min_max 0.1.6 → 0.1.7

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 012d1e5c570db138f41f8ac8556dde89598878d15fc9176a7006bdd33e5deaf5
-  data.tar.gz: 70a8c3a7bb6afdaf23260ccd56c87acd1bd85e49d40d9231fbb316bf6beb4917
+  metadata.gz: 2b43d258b5b9ccddc81016bb4c69c186df448ab7c51ae712f136ceed6218a145
+  data.tar.gz: 8c22dd5c5ac6ced73a789dc6813f62bc51168e3e48e2e2ca1b689187be7af8ac
 SHA512:
-  metadata.gz: bc3d399e2eae53e244c0bb3a5d502cf725e3b4d4b0d941e1c96d9f0ceeee367a4688ec191116c75d94bed5bbc4470c59626e53da13c85afb24fd44df1f6668bc
-  data.tar.gz: d98bef37722feef1534e85f709f95dcaf314dc5f9013b32e10d667c653b97c3274e8f210fa42d2fdeb6f1fdb63c9f4a62da2d1cfd44ae2178b1439d79c56e8a8
+  metadata.gz: b02f4bdcbe8d60e8e2dfba61218a7958e8d97dd54a8939a0befcd363c796e049f11b7f7f58e014c8f8ead40773ea4ad9695fc69a89022e0bec6ac738ae4968ac
+  data.tar.gz: b55fc832a26ce35e955e275ea812b64de15f541fea714a57e107f078d287e3436a76a041a6152863ea1b9680282c0864096cb7784f1aaed525cf5b253b989465

data/README.md

@@ -1,8 +1,8 @@
 # MinMax Heap
 
-The MinMax Heap gem provides a high-performance minmax heap implementation for Ruby, written in Rust. 
+The MinMax Heap gem provides a high-performance minmax heap implementation for Ruby, written in Rust.
 The gem wraps the excellent [min-max-heap-rs](https://github.com/tov/min-max-heap-rs) Rust library.
-It allows for the creation of a min-max-heap and supporting operations like pushing and popping multiple items, iterating over heap items, and converting heaps to arrays. 
+It allows for the creation of a min-max-heap and supporting operations like pushing and popping multiple items, iterating over heap items, and converting heaps to arrays.
 
 ## Features
 
@@ -13,9 +13,9 @@ It allows for the creation of a min-max-heap and supporting operations like push
 - Convert heap to array with `#to_a`, `#to_a_asc` and `#to_a_desc`.
 
 ## Prequisites
-- You must have a working Rust compiler installed on your system. 
+- You must have a working Rust compiler installed on your system.
 ```bash
-curl --proto '=https' --tlsv1.2 -sSf https://sh.rustup.rs | 
+curl --proto '=https' --tlsv1.2 -sSf https://sh.rustup.rs |
 ```
 
 ## Installation
@@ -79,6 +79,21 @@ heap.to_a_desc # => [5, 3, 1]
 heap.to_a # => Heap order
 ```
 
+## Iterate in order
+```ruby
+heap.each_asc   #<Enumerator: ...>
+heap.each_desc  #<Enumerator: ...>
+```
+
+## Peek at min and max items
+```ruby
+heap.peek_min # => 1
+heap.first # => 1
+
+heap.peek_max # => 1
+heap.last # => 1
+```
+
 ## Size
 ```ruby
 heap.size # => 4
@@ -110,4 +125,3 @@ You can run the `benchmarks/benchmarks.rb` file inside this repository for compa
 min-max should be the fastest to pop from a large heap, often by a significant margin, while also offering both min and max operations from a single heap.
 Some options are faster at pushing individual items, but the difference is within the same order of magnitude.
 Batch pushing to min-max also significantly increases insert speed.
-

data/lib/min_max/version.rb

@@ -1,5 +1,5 @@
 # frozen_string_literal: true
 
 class MinMax
-  VERSION = "0.1.6"
+  VERSION = "0.1.7"
 end

data/lib/min_max.rb

@@ -16,7 +16,7 @@ class MinMax
     self._new.tap{|s|
       s.instance_eval{
         @priority_blk = (blk || proc{|x| x.respond_to?(:priority) ? x.priority : x.to_i })
-        @storage = Hash.new{|h,k| h[k] = [0, nil] }
+        @storage = Hash.new{|h,k| h[k] = [0, nil] }.compare_by_identity
       }
       s.push(*args)
     }
@@ -24,13 +24,13 @@ class MinMax
 
   def push(*args)
     mapped = args.map do |a|
-      hash = a.hash
-      entry = self.storage[hash]
+      object_id = a.object_id
+      entry = self.storage[object_id]
       entry[0] += 1
       entry[1] ||= a
       [
         (self.priority_blk.call(a) rescue 0),
-        hash
+        object_id
       ]
     end
      _push(mapped)
@@ -81,18 +81,30 @@ class MinMax
   end
 
   def count(val)
-    counts.has_key?(val.hash) ? counts[val.hash] : 0
+    storage.has_key?(val.object_id) ? storage[val.object_id].first : 0
   end
 
   def contains?(val)
-    counts.has_key?(val.hash) && counts[val.hash] > 0
+    storage.has_key?(val.object_id)
   end
 
   def to_a_asc
+    return to_enum(:to_a_asc) unless block_given?
     _to_a_asc.map{|p| retrieve(p, false) }
   end
 
   def to_a_desc
+    return to_enum(:to_a_desc) unless block_given?
+    _to_a_desc.map{|p| retrieve(p, false) }
+  end
+
+  def each_asc
+    return to_enum(:each_asc) unless block_given?
+    _to_a_asc.each{|p| yield retrieve(p, false) }
+  end
+
+  def each_desc
+    return to_enum(:each_desc) unless block_given?
     _to_a_desc.map{|p| retrieve(p, false) }
   end
 
@@ -101,11 +113,10 @@ class MinMax
   end
 
   private
-  def retrieve(hash, remove=true)
-    entry = self.storage[hash]
-    self.storage.delete(hash) if remove && (entry[0] -= 1) == 0
+  def retrieve(object_id, remove=true)
+    entry = self.storage[object_id]
+    self.storage.delete(object_id) if remove && (entry[0] -= 1) == 0
     entry[1]
   end
 
 end
-

metadata

@@ -1,14 +1,13 @@
 --- !ruby/object:Gem::Specification
 name: min_max
 version: !ruby/object:Gem::Version
-  version: 0.1.6
+  version: 0.1.7
 platform: ruby
 authors:
 - Wouter Coppieters
-autorequire:
 bindir: exe
 cert_chain: []
-date: 2024-02-25 00:00:00.000000000 Z
+date: 2025-01-03 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rb_sys
@@ -79,7 +78,6 @@ licenses:
 metadata:
   allowed_push_host: https://rubygems.org
   homepage_uri: https://github.com/wouterken/min_max
-post_install_message:
 rdoc_options: []
 require_paths:
 - lib
@@ -94,8 +92,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: 3.3.11
 requirements: []
-rubygems_version: 3.5.6
-signing_key:
+rubygems_version: 3.6.2
 specification_version: 4
 summary: A min max heap extension for Ruby
 test_files: []