pairing_heap 3.1.2 → 3.1.3

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 8389560b615ae5871d0adbae5a6b4e55554fa2df72e611e208a91352cdb3af28
-  data.tar.gz: 130e2d0daa895cf7921e18dd736552de22bf6ac23aab8bbdb0c6a33536c2d5e9
+  metadata.gz: 0c7122d09fdfbcda744f2824df424af7634b2497594ecda22ec08a24b1372a91
+  data.tar.gz: 6e2a075da8593426c0bd893594d01bc3434036af94ca607cd6c1613fc9900272
 SHA512:
-  metadata.gz: 6f2d1588a2de63ce23c96ee06af18983304798dd4d678e88e58a7ee09efafafe511adc8d33259ed17aee88fcba63726fa467fb6a79a7ce863dac25466137e4ec
-  data.tar.gz: e972e7c8cd380c9374870c5b9232c1c307f3c723ba7672007f66e843d837482dd5e983d683eba29ef4e24aeaed839b8ab5f78cc382a0d6731de0f2fd393e716e
+  metadata.gz: b24f2b9386d50527877e19f1de73dfef77258ff2f9051704c33c7d3a93610322b67f7467ae85113870ce45246e63d282e97102bd98ce10978f0297858c2fd50e
+  data.tar.gz: abf622d8f59d67cdcf65fd6e96564877929e9a8979df5f98d417141ce2d3040d41a483f2f4abedb86e4bbcee832260714131f07f665563a035cfb18b33c1ff3e

data/Gemfile.lock

@@ -1,7 +1,7 @@
 PATH
   remote: .
   specs:
-    pairing_heap (3.1.2)
+    pairing_heap (3.1.3)
 
 GEM
   remote: https://rubygems.org/
@@ -102,7 +102,7 @@ CHECKSUMS
   lint_roller (1.1.0) sha256=2c0c845b632a7d172cb849cc90c1bce937a28c5c8ccccb50dfd46a485003cc87
   logger (1.7.0) sha256=196edec7cc44b66cfb40f9755ce11b392f21f7967696af15d274dde7edff0203
   minitest (6.0.6) sha256=153ea36d1d987a62942382b61075745042a2b3123b1cd48f4c3675af9cc7d6f1
-  pairing_heap (3.1.2)
+  pairing_heap (3.1.3)
   parallel (1.27.0) sha256=4ac151e1806b755fb4e2dc2332cbf0e54f2e24ba821ff2d3dcf86bf6dc4ae130
   parser (3.3.10.0) sha256=ce3587fa5cc55a88c4ba5b2b37621b3329aadf5728f9eafa36bbd121462aabd6
   prism (1.9.0) sha256=7b530c6a9f92c24300014919c9dcbc055bf4cdf51ec30aed099b06cd6674ef85

data/Rakefile

@@ -13,7 +13,7 @@ Rake::TestTask.new(:test) do |t|
 end
 
 task :rbs do
-  sh "rbs validate sig/pairing_heap.rbs"
+  sh "rbs -I sig validate"
 end
 
 task default: %i[test standard rbs]

data/lib/pairing_heap/version.rb

@@ -1,5 +1,5 @@
 # frozen_string_literal: true
 
 module PairingHeap
-  VERSION = "3.1.2"
+  VERSION = "3.1.3"
 end

data/sig/pairing_heap.rbs

@@ -25,7 +25,7 @@ module PairingHeap
 
     # Returns the element and its priority at the top of the heap.
     #   Time Complexity: O(1)
-    def peek_with_priority: () -> [Elem, Priority] | [nil, nil]
+    def peek_with_priority: () -> ([Elem, Priority] | [nil, nil])
 
     # Time Complexity: O(1)
     def empty?: () -> bool
@@ -48,7 +48,7 @@ module PairingHeap
 
     # Removes element from the top of the heap and returns it along with its priority.
     #   Time Complexity: O(N), Amortized: O(log N)
-    def pop_with_priority: () -> [Elem, Priority] | [nil, nil]
+    def pop_with_priority: () -> ([Elem, Priority] | [nil, nil])
 
     # Changes a priority of element to a more prioritary one.
     #   Time Complexity: O(1), Amortized: O(log N)
@@ -73,7 +73,7 @@ module PairingHeap
 
     # Returns [false, nil] if the element is not in heap, [true, priority] if it is.
     #   Time Complexity: O(1)
-    def get_priority_if_exists: (Elem elem) -> [false, nil] | [true, Priority]
+    def get_priority_if_exists: (Elem elem) -> ([false, nil] | [true, Priority])
 
     # Yields each element in the heap. No order guarantees.
     def each: () { (Elem) -> void } -> void
@@ -105,7 +105,7 @@ module PairingHeap
 
     # Returns the element and its priority at the top of the heap.
     #   Time Complexity: O(1)
-    def peek_with_priority: () -> [Elem, Priority] | [nil, nil]
+    def peek_with_priority: () -> ([Elem, Priority] | [nil, nil])
 
     # Time Complexity: O(1)
     def empty?: () -> bool
@@ -128,7 +128,7 @@ module PairingHeap
 
     # Removes element from the top of the heap and returns it along with its priority.
     #   Time Complexity: O(N), Amortized: O(log N)
-    def pop_with_priority: () -> [Elem, Priority] | [nil, nil]
+    def pop_with_priority: () -> ([Elem, Priority] | [nil, nil])
 
     # Yields each element in the heap. No order guarantees.
     def each: () { (Elem) -> void } -> void
@@ -146,7 +146,7 @@ module PairingHeap
   end
 
   # Priority queue where the smallest priority is the most prioritary
-  class MinPriorityQueue[Elem, Priority < Comparable[Priority]] < PairingHeap[Elem, Priority]
+  class MinPriorityQueue[Elem, Priority < Comparable] < PairingHeap[Elem, Priority]
     def initialize: () -> void
 
     alias decrease_key change_priority
@@ -155,7 +155,7 @@ module PairingHeap
   end
 
   # Priority queue where the highest priority is the most prioritary
-  class MaxPriorityQueue[Elem, Priority < Comparable[Priority]] < PairingHeap[Elem, Priority]
+  class MaxPriorityQueue[Elem, Priority < Comparable] < PairingHeap[Elem, Priority]
     def initialize: () -> void
 
     alias increase_key change_priority

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: pairing_heap
 version: !ruby/object:Gem::Version
-  version: 3.1.2
+  version: 3.1.3
 platform: ruby
 authors:
 - Marcin Henryk Bartkowiak