pkgsrc/devel/ruby-lazy_priority_queue/PLIST

@comment $NetBSD: PLIST,v 1.1 2016/10/10 23:15:34 taca Exp $
${GEM_HOME}/cache/${GEM_NAME}.gem
${GEM_LIBDIR}/lib/lazy_priority_queue.rb
${GEM_HOME}/specifications/${GEM_NAME}.gemspec
Add ruby-lazy_priority_queue 0.1.1, required by ruby-rgl. A priority queue which implements a lazy binomial heap. It supports the change priority operation, being suitable for algorithms like Dijkstra's shortest path and Prim's minimum spanning tree. It can be instantiated as a min-priority queue as well as a max-priority queue. 2016-10-11 01:15:34 +02:00			`@comment $NetBSD: PLIST,v 1.1 2016/10/10 23:15:34 taca Exp $`
			`${GEM_HOME}/cache/${GEM_NAME}.gem`
			`${GEM_LIBDIR}/lib/lazy_priority_queue.rb`
			`${GEM_HOME}/specifications/${GEM_NAME}.gemspec`