depq 0.6 → 0.7

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: e79a116c9cd6b58578bf23c9100e7bc0f5e19a21
+  data.tar.gz: b4a2db49fd3317bd8db9e9b523a032f462ed7c76
+SHA512:
+  metadata.gz: 9c8d68e0287f4057d239f18ff810f9aea3f1f0c518e0c9f4a7d340e528a31d599a1a7c1918d65941232ff86ed4742eb8c02472fd3e65e006866fba18f5a2c1ee
+  data.tar.gz: 592cee5adb6c096fa464e4725d43d51a5bb53b8bdd179b8c51b6d6dc01a39471ea46a6cb02d85ddc8b2b9345816836e34d3e65ec7009836b080bba7a769a6489

data/README

@@ -8,9 +8,9 @@ depq is double-ended stable priority queue with priority update operation implem
 * priority - you can get a value with minimum priority
 * double-ended - you can get a value with maximum priority too
 * stable - you will get the value inserted first with minimum/maximum priority
-* priority update - usable for Dijkstra's shortest path algorithm and various graph algorithms
+* priority update - you can change the priority of inserted values (usable for Dijkstra's shortest path algorithm and various graph algorithms)
 * implicit heap - compact heap representation using array.  most operations are O(log n) at worst
-* iterator operations: nlargest, nsmallest and merge
+* several utility methods: nlargest, nsmallest, merge, astar_search
 
 == Install
 
@@ -18,12 +18,8 @@ depq is double-ended stable priority queue with priority update operation implem
 
 == Links
 
-* ((<reference manual|URL:http://depq.rubyforge.org/rdoc/classes/Depq.html>))
-* ((<home page on rubyforge|URL:http://depq.rubyforge.org/>))
-* ((<project info on rubyforge|URL:http://rubyforge.org/projects/depq/>))
-* ((<depq on rubygems.org|URL:http://rubygems.org/gems/depq>))
 * ((<source repository on github|URL:http://github.com/akr/depq>))
-* ((<raa entry|URL:http://raa.ruby-lang.org/project/depq/>))
+* ((<depq on rubygems.org|URL:http://rubygems.org/gems/depq>))
 
 == Introduction
 
@@ -182,26 +178,30 @@ Tanaka Akira <akr@fsij.org>
 == License
 
 Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions are met:
-
-(1) Redistributions of source code must retain the above copyright notice, this
-    list of conditions and the following disclaimer.
-(2) Redistributions in binary form must reproduce the above copyright notice,
-    this list of conditions and the following disclaimer in the documentation
-    and/or other materials provided with the distribution.
-(3) The name of the author may not be used to endorse or promote products
-    derived from this software without specific prior written permission.
-
-THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
-WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
-MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
-EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
-EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
-OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
-IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY
-OF SUCH DAMAGE.
+modification, are permitted provided that the following conditions
+are met:
+
+ 1. Redistributions of source code must retain the above copyright
+    notice, this list of conditions and the following disclaimer.
+ 2. Redistributions in binary form must reproduce the above
+    copyright notice, this list of conditions and the following
+    disclaimer in the documentation and/or other materials provided
+    with the distribution.
+ 3. The name of the author may not be used to endorse or promote
+    products derived from this software without specific prior
+    written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
+OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
+DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
+GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
+OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
+EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 (The modified BSD licence)
 

data/lib/depq.rb

@@ -3,26 +3,30 @@
 # Copyright (C) 2009-2011 Tanaka Akira  <akr@fsij.org>
 #
 # Redistribution and use in source and binary forms, with or without
-# modification, are permitted provided that the following conditions are met:
+# modification, are permitted provided that the following conditions
+# are met:
 #
-#  1. Redistributions of source code must retain the above copyright notice, this
-#     list of conditions and the following disclaimer.
-#  2. Redistributions in binary form must reproduce the above copyright notice,
-#     this list of conditions and the following disclaimer in the documentation
-#     and/or other materials provided with the distribution.
-#  3. The name of the author may not be used to endorse or promote products
-#     derived from this software without specific prior written permission.
+#  1. Redistributions of source code must retain the above copyright
+#     notice, this list of conditions and the following disclaimer.
+#  2. Redistributions in binary form must reproduce the above
+#     copyright notice, this list of conditions and the following
+#     disclaimer in the documentation and/or other materials provided
+#     with the distribution.
+#  3. The name of the author may not be used to endorse or promote
+#     products derived from this software without specific prior
+#     written permission.
 #
-# THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
-# WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
-# MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
-# EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
-# EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
-# OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
-# IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY
-# OF SUCH DAMAGE.
+# THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
+# OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+# WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+# ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
+# DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+# DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
+# GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+# WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
+# OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
+# EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 # = Depq - Double-Ended Priority Queue
 #
@@ -295,7 +299,7 @@ class Depq
     def priority
       if in_queue?
         q = depq_or_subpriority()
-        priority, subpriority = q.send(:internal_get_priority, self)
+        priority, _subpriority = q.send(:internal_get_priority, self)
         priority
       else
         index_or_priority()
@@ -306,7 +310,7 @@ class Depq
     def subpriority
       if in_queue?
         q = depq_or_subpriority()
-        priority, subpriority = q.send(:internal_get_priority, self)
+        _priority, subpriority = q.send(:internal_get_priority, self)
         subpriority
       else
         depq_or_subpriority()
@@ -441,6 +445,26 @@ class Depq
   ARY_SLICE_SIZE = 3
   # :startdoc:
 
+  def get_entry_ps(i)
+    get_entry(i).values_at(1, 2)
+  end
+  private :get_entry_ps
+
+  def get_entry_e(i)
+    get_entry(i)[0]
+  end
+  private :get_entry_e
+
+  def get_entry_p(i)
+    get_entry(i)[1]
+  end
+  private :get_entry_p
+
+  def get_entry_s(i)
+    get_entry(i)[2]
+  end
+  private :get_entry_s
+
   def get_entry(i)
     locator = @ary[i*ARY_SLICE_SIZE+0]
     priority = @ary[i*ARY_SLICE_SIZE+1]
@@ -535,7 +559,7 @@ class Depq
 
   def check_locator(loc)
     if !self.equal?(loc.depq) ||
-       !get_entry(loc.send(:index))[0].equal?(loc)
+       !get_entry_e(loc.send(:index)).equal?(loc)
       raise ArgumentError, "unexpected locator"
     end
   end
@@ -689,7 +713,7 @@ class Depq
 
   def internal_get_priority(loc)
     check_locator(loc)
-    locator, priority, subpriority = get_entry(loc.send(:index))
+    priority, subpriority = get_entry_ps(loc.send(:index))
     [priority, subpriority]
   end
   private :internal_get_priority
@@ -968,7 +992,7 @@ class Depq
     check_locator(loc)
     index = loc.send(:index)
     if @heapsize <= index
-      _, priority, subpriority = get_entry(index)
+      priority, subpriority = get_entry_ps(index)
       last = self.size - 1
       if index != last
         loc2, priority2, subpriority2 = get_entry(last)
@@ -1128,7 +1152,7 @@ class Depq
   #
   def delete_unspecified_locator
     return nil if empty?
-    loc, _ = get_entry(self.size-1)
+    loc = get_entry_e(self.size-1)
     delete_locator(loc)
   end
 
@@ -1594,13 +1618,12 @@ class Depq
   end
 
   def mm_find_top_loc
-    loc, _ = get_entry(0)
-    loc
+    get_entry_e(0)
   end
 
   def mm_delete_loc(loc, upper)
     i = loc.send(:index)
-    _, priority, subpriority = get_entry(i)
+    priority, subpriority = get_entry_ps(i)
     last = self.size - 1
     loc.send(:internal_deleted, priority, subpriority)
     el, pl, sl = delete_last_entry
@@ -1666,8 +1689,8 @@ class Depq
   end
 
   def min_upper?(i, j)
-    ei, pi, si = get_entry(i)
-    ej, pj, sj = get_entry(j)
+    pi, si = get_entry_ps(i)
+    pj, sj = get_entry_ps(j)
     min_compare(pi, si, pj, sj) <= 0
   end
 
@@ -1710,8 +1733,8 @@ class Depq
   end
 
   def max_upper?(i, j)
-    ei, pi, si = get_entry(i)
-    ej, pj, sj = get_entry(j)
+    pi, si = get_entry_ps(i)
+    pj, sj = get_entry_ps(j)
     max_compare(pi, si, pj, sj) >= 0
   end
 
@@ -1761,14 +1784,14 @@ class Depq
   def itv_child2_maxside(i) i &= ~1; i*2+5 end
 
   def pcmp(i, j)
-    ei, pi, si = get_entry(i)
-    ej, pj, sj = get_entry(j)
+    pi = get_entry_p(i)
+    pj = get_entry_p(j)
     compare_priority(pi, pj)
   end
 
   def scmp(i, j)
-    ei, pi, si = get_entry(i)
-    ej, pj, sj = get_entry(j)
+    si = get_entry_s(i)
+    sj = get_entry_s(j)
     si <=> sj
   end
 
@@ -1841,7 +1864,7 @@ class Depq
             k = k1
           elsif pc > 0
             k = k2
-          elsif (sc = scmp(k1, k2)) <= 0
+          elsif scmp(k1, k2) <= 0
             k = k1
           else
             k = k2
@@ -1872,7 +1895,7 @@ class Depq
             k = k2
           elsif pc > 0
             k = k1
-          elsif (sc = scmp(k1, k2)) <= 0
+          elsif scmp(k1, k2) <= 0
             k = k1
           else
             k = k2
@@ -1986,7 +2009,7 @@ class Depq
 
   def itv_update_prio(loc, prio, subprio)
     i = loc.send(:index)
-    ei, pi, si = get_entry(i)
+    ei = get_entry_e(i)
     set_entry(i, ei, prio, subprio)
     range = 0...self.size
     itv_adjust(i, range)
@@ -2012,15 +2035,15 @@ class Depq
     when 0
       [nil, nil]
     when 1
-      e0, p0, s0 = get_entry(0)
+      e0 = get_entry_e(0)
       [e0, e0]
     else
       if pcmp(0, 1) == 0
-        e0, p0, s0 = get_entry(0)
+        e0 = get_entry_e(0)
         [e0, e0]
       else
-        e0, p0, s0 = get_entry(0)
-        e1, p1, s1 = get_entry(1)
+        e0 = get_entry_e(0)
+        e1 = get_entry_e(1)
         [e0, e1]
       end
     end
@@ -2036,7 +2059,7 @@ class Depq
 
   def itv_delete_loc(loc)
     i = loc.send(:index)
-    _, priority, subpriority = get_entry(i)
+    priority, subpriority = get_entry_ps(i)
     last = self.size - 1
     loc.send(:internal_deleted, priority, subpriority)
     el, pl, sl = delete_last_entry

data/sample/dhondt.rb

@@ -0,0 +1,53 @@
+# D'Hondt method
+#
+# usage:
+#   ruby -Ilib sample/dhondt.rb number-of-seats party1:votes1 party2:votes2 ...
+#
+# example:
+#   % ruby -Ilib sample/dhondt.rb 10 A:230000 B:120000 C:90000 D:30000
+#   A       230000  5
+#   B       120000  3
+#   C       90000   2
+#   D       30000   0
+
+require 'depq'
+
+def dhondt(number_of_seats, number_of_votes_for_parties)
+  q = Depq.new
+  number_of_votes_for_parties.each {|party, votes|
+    seats_gotten = 0
+    q.insert [party, votes, seats_gotten], Rational(votes, seats_gotten+1)
+  }
+  number_of_seats.times {
+    (party, votes, seats_gotten), priority = q.delete_max_priority
+    if !q.empty? && q.find_min_priority[1] == priority
+      # There may be two or more parties with maximum priority.
+      # Random choice should be implemented here...
+      raise
+    end
+    seats_gotten += 1
+    q.insert [party, votes, seats_gotten], Rational(votes, seats_gotten+1)
+  }
+  h = {}
+  until q.empty?
+    party, votes, seats_gotten = q.delete_max
+    h[party] = seats_gotten
+  end
+  h
+end
+
+number_of_seats = ARGV.shift.to_i
+number_of_votes_for_parties = []
+ARGV.each {|arg|
+  /\A(.*):(\d+)\z/ =~ arg
+  party = $1
+  votes = $2.to_i
+  number_of_votes_for_parties << [party, votes]
+}
+
+result = dhondt(number_of_seats, number_of_votes_for_parties)
+
+number_of_votes_for_parties.each {|party, votes|
+  seats_gotten = result[party]
+  puts "#{party}\t#{votes}\t#{seats_gotten}"
+}

data/test/test-depq.rb

@@ -3,26 +3,30 @@
 # Copyright (C) 2009 Tanaka Akira  <akr@fsij.org>
 #
 # Redistribution and use in source and binary forms, with or without
-# modification, are permitted provided that the following conditions are met:
+# modification, are permitted provided that the following conditions
+# are met:
 #
-#  1. Redistributions of source code must retain the above copyright notice, this
-#     list of conditions and the following disclaimer.
-#  2. Redistributions in binary form must reproduce the above copyright notice,
-#     this list of conditions and the following disclaimer in the documentation
-#     and/or other materials provided with the distribution.
-#  3. The name of the author may not be used to endorse or promote products
-#     derived from this software without specific prior written permission.
+#  1. Redistributions of source code must retain the above copyright
+#     notice, this list of conditions and the following disclaimer.
+#  2. Redistributions in binary form must reproduce the above
+#     copyright notice, this list of conditions and the following
+#     disclaimer in the documentation and/or other materials provided
+#     with the distribution.
+#  3. The name of the author may not be used to endorse or promote
+#     products derived from this software without specific prior
+#     written permission.
 #
-# THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED
-# WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
-# MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
-# EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
-# EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
-# OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-# CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
-# IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY
-# OF SUCH DAMAGE.
+# THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
+# OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+# WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+# ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
+# DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+# DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
+# GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+# WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
+# OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
+# EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 require 'depq'
 require 'test/unit'
@@ -45,12 +49,12 @@ class Depq
   end
 
   def min_validation
-    mm_validation &method(:min_upper?)
+    mm_validation(&method(:min_upper?))
   end
   MinMode[:validation] = :min_validation
 
   def max_validation
-    mm_validation &method(:max_upper?)
+    mm_validation(&method(:max_upper?))
   end
   MaxMode[:validation] = :max_validation
 
@@ -258,7 +262,7 @@ class TestDepq < Test::Unit::TestCase
     q = Depq.new
     a = q.insert("a", 2)
     b = q.insert("b", 1)
-    c = q.insert("c", 3)
+        q.insert("c", 3)
     assert_equal(b, q.find_min_locator)
     a.update("d", 0)
     assert_equal("d", a.value)
@@ -275,11 +279,11 @@ class TestDepq < Test::Unit::TestCase
   def test_locator_update_subpriority_min
     q = Depq.new
     a = q.insert("a", 1, 0)
-    b = q.insert("b", 2, 1)
+        q.insert("b", 2, 1)
     c = q.insert("c", 1, 2)
-    d = q.insert("d", 2, 3)
-    e = q.insert("e", 1, 4)
-    f = q.insert("f", 2, 5)
+        q.insert("d", 2, 3)
+        q.insert("e", 1, 4)
+        q.insert("f", 2, 5)
     assert_equal(a, q.find_min_locator)
     a.update("A", 1, 10)
     assert_equal(c, q.find_min_locator)
@@ -295,12 +299,12 @@ class TestDepq < Test::Unit::TestCase
 
   def test_locator_update_subpriority_max
     q = Depq.new
-    a = q.insert("a", 1, 0)
+        q.insert("a", 1, 0)
     b = q.insert("b", 2, 1)
-    c = q.insert("c", 1, 2)
+        q.insert("c", 1, 2)
     d = q.insert("d", 2, 3)
-    e = q.insert("e", 1, 4)
-    f = q.insert("f", 2, 5)
+        q.insert("e", 1, 4)
+        q.insert("f", 2, 5)
     assert_equal(b, q.find_max_locator)
     b.update("B", 2, 6)
     assert_equal(d, q.find_max_locator)
@@ -316,7 +320,7 @@ class TestDepq < Test::Unit::TestCase
 
   def test_locator_update_max
     q = Depq.new
-    a = q.insert("a", 2)
+        q.insert("a", 2)
     b = q.insert("b", 1)
     c = q.insert("c", 3)
     assert_equal(c, q.find_max_locator)
@@ -624,7 +628,7 @@ class TestDepq < Test::Unit::TestCase
     q = Depq.new
     loc1 = q.insert 10
     assert_equal([loc1, loc1], q.find_minmax_locator)
-    loc2 = q.insert 10
+    q.insert 10
     assert_equal([loc1, loc1], q.find_minmax_locator)
   end
 

metadata

@@ -1,26 +1,20 @@
 --- !ruby/object:Gem::Specification
 name: depq
 version: !ruby/object:Gem::Version
-  version: '0.6'
-  prerelease: 
+  version: '0.7'
 platform: ruby
 authors:
 - Tanaka Akira
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2011-11-29 00:00:00.000000000 Z
+date: 2014-06-29 00:00:00.000000000 Z
 dependencies: []
-description: ! 'depq is a Double-Ended Priority Queue library.
-
-  It is a data structure which can insert elements and delete elements with minimum
-  and maximum priority.
-
+description: |
+  depq is a Double-Ended Priority Queue library.
+  It is a data structure which can insert elements and delete elements with minimum and maximum priority.
   If there are elements which has same priority, the element inserted first is chosen.
-
   The priority can be changed after the element is inserted.
-
-'
 email: akr@fsij.org
 executables: []
 extensions: []
@@ -28,6 +22,7 @@ extra_rdoc_files: []
 files:
 - README
 - lib/depq.rb
+- sample/dhondt.rb
 - sample/dijkstra.rb
 - sample/exqsort.rb
 - sample/huffman.rb
@@ -37,29 +32,29 @@ files:
 - sample/prim.rb
 - sample/sched.rb
 - test/test-depq.rb
-homepage: http://depq.rubyforge.org/
-licenses: []
+homepage: https://github.com/akr/depq
+licenses:
+- BSD-3-Clause
+metadata: {}
 post_install_message: 
 rdoc_options: []
 require_paths:
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement
-  none: false
   requirements:
-  - - ! '>='
+  - - ">="
     - !ruby/object:Gem::Version
       version: '0'
 required_rubygems_version: !ruby/object:Gem::Requirement
-  none: false
   requirements:
-  - - ! '>='
+  - - ">="
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
 rubyforge_project: depq
-rubygems_version: 1.8.11
+rubygems_version: 2.2.2
 signing_key: 
-specification_version: 3
+specification_version: 4
 summary: Stable Double-Ended Priority Queue.
 test_files:
 - test/test-depq.rb