philiprehberger-priority_queue 0.1.10 → 0.2.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: e95bdf19e31db232c54ac6ee645aa4a9023fc87140d2be6310c8469e4a5440d2
-  data.tar.gz: 944088fb4246573e985496a73fa8ca50a369da021274c050b8db926e3a6f7b4c
+  metadata.gz: 4b651b4373f8d4da469ba23f030935a1cfe4acc6ee9b2876900d9bddd096f43d
+  data.tar.gz: 49c7c9ed171f003c839929b0af6875f0a0611e63a26b0c7c74584d0456518026
 SHA512:
-  metadata.gz: 5c21fb11db45c81cc229b54ac6a8589000543141859a47abe483be620825e7662ce5b89228b278927e5665e842443300421641a9e494d372d3921f43bbcaad5a
-  data.tar.gz: 7efaf2fe7884442250b83e94e4c9e472f82b50e0ce7ee7ae8cc0f2390674cdd7827176de9c77baefd7df1a81b02ffca32260429545dbda04e9ea0566e0602db1
+  metadata.gz: 1d5e7ea68204ea32eb3caeb06463f6782b28b44147029839a56ce75010e0cb3400fda69f32d97f4113eef247252aa5925808da025fef416119d8fce7a2c5001f
+  data.tar.gz: 5067adc0908c771d46959704071c658846d262e6a3d089c8cfe15fd919fa7be4e0d2b84b103b39f333707ea187a3a746245ef50a715e3d186d810393c5d30b1b

data/CHANGELOG.md

@@ -7,6 +7,21 @@ and this gem adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.htm
 
 ## [Unreleased]
 
+## [0.2.0] - 2026-04-03
+
+### Added
+- Include `Enumerable` module with `each` yielding `[item, priority]` pairs in priority order
+- `push_many(items)` for batch pushing from array of hashes
+- `peek_priority` to return just the top priority value
+- `drain` to pop all items and return as array in priority order
+- `delete(item)` to remove a specific item by value
+- `priorities` to return sorted array of unique priority values
+
+## [0.1.11] - 2026-03-31
+
+### Added
+- Add GitHub issue templates, dependabot config, and PR template
+
 ## [0.1.10] - 2026-03-31
 
 ### Changed

data/README.md

@@ -88,6 +88,84 @@ queue.change_priority("task_a", 1) # task_a is now highest priority
 queue.pop # => "task_a"
 ```
 
+### Batch Push
+
+Add multiple items at once from an array of hashes.
+
+```ruby
+queue = Philiprehberger::PriorityQueue::Queue.new
+queue.push_many([
+  { item: "email", priority: 2 },
+  { item: "backup", priority: 5 },
+  { item: "alert", priority: 1 }
+])
+
+queue.pop # => "alert"
+```
+
+### Peek Priority
+
+Return just the top priority value without the item.
+
+```ruby
+queue = Philiprehberger::PriorityQueue::Queue.new
+queue.push("task", priority: 7)
+queue.peek_priority # => 7
+```
+
+### Drain
+
+Pop all items and return them as an array in priority order.
+
+```ruby
+queue = Philiprehberger::PriorityQueue::Queue.new
+queue.push("c", priority: 3)
+queue.push("a", priority: 1)
+queue.push("b", priority: 2)
+
+queue.drain # => ["a", "b", "c"]
+queue.empty? # => true
+```
+
+### Delete
+
+Remove a specific item by value.
+
+```ruby
+queue = Philiprehberger::PriorityQueue::Queue.new
+queue.push("a", priority: 1)
+queue.push("b", priority: 2)
+
+queue.delete("a") # => "a"
+queue.size # => 1
+```
+
+### Priorities
+
+Return a sorted array of unique priority values currently in the queue.
+
+```ruby
+queue = Philiprehberger::PriorityQueue::Queue.new
+queue.push("a", priority: 3)
+queue.push("b", priority: 1)
+queue.push("c", priority: 3)
+
+queue.priorities # => [1, 3]
+```
+
+### Enumerable
+
+The queue includes `Enumerable`, yielding `[item, priority]` pairs in priority order without modifying the queue.
+
+```ruby
+queue = Philiprehberger::PriorityQueue::Queue.new
+queue.push("x", priority: 10)
+queue.push("y", priority: 5)
+
+queue.map { |item, priority| "#{item}:#{priority}" } # => ["y:5", "x:10"]
+queue.select { |_item, priority| priority > 7 }      # => [["x", 10]]
+```
+
 ### Merging Queues
 
 Combine two queues into a new queue. The originals are unchanged.
@@ -121,6 +199,12 @@ merged.size # => 3
 | `#include?(item)` | Return `true` if the item is in the queue |
 | `#clear` | Remove all items from the queue; returns `self` |
 | `#merge(other)` | Return a new queue containing items from both queues |
+| `#push_many(items)` | Batch push from array of hashes `[{ item: x, priority: n }, ...]`; returns `self` |
+| `#peek_priority` | Return just the top priority value; returns `nil` when empty |
+| `#drain` | Pop all items and return as array in priority order; empties the queue |
+| `#delete(item)` | Remove a specific item by value; returns the item or `nil` |
+| `#priorities` | Return sorted array of unique priority values in the queue |
+| `#each` | Yield `[item, priority]` pairs in priority order (Enumerable) |
 
 ## Development
 

data/lib/philiprehberger/priority_queue/version.rb

@@ -2,6 +2,6 @@
 
 module Philiprehberger
   module PriorityQueue
-    VERSION = '0.1.10'
+    VERSION = '0.2.0'
   end
 end

data/lib/philiprehberger/priority_queue.rb

@@ -5,6 +5,8 @@ require_relative 'priority_queue/version'
 module Philiprehberger
   module PriorityQueue
     class Queue
+      include Enumerable
+
       attr_reader :size
 
       def initialize(mode: :min, &comparator)
@@ -90,6 +92,55 @@ module Philiprehberger
         self
       end
 
+      def each(&block)
+        return enum_for(:each) unless block
+
+        sorted = @heap.sort { |a, b| compare_entries(a, b) }
+        sorted.each { |entry| block.call(entry[2], entry[0]) }
+        self
+      end
+
+      def push_many(items)
+        items.each { |h| push(h[:item], priority: h[:priority]) }
+        self
+      end
+
+      def peek_priority
+        return nil if empty?
+
+        @heap[0][0]
+      end
+
+      def drain
+        result = []
+        result << pop until empty?
+        result
+      end
+
+      def delete(item)
+        idx = @item_index[item]
+        return nil if idx.nil?
+
+        if idx == @size - 1
+          entry = @heap.pop
+          @size -= 1
+          @item_index.delete(item)
+          return entry[2]
+        end
+
+        swap(idx, @size - 1)
+        entry = @heap.pop
+        @size -= 1
+        @item_index.delete(item)
+        bubble_up(idx)
+        bubble_down(idx)
+        entry[2]
+      end
+
+      def priorities
+        @heap.map { |entry| entry[0] }.uniq.sort
+      end
+
       def merge(other)
         merged = self.class.new(&@comparator)
         @heap.each { |entry| merged.push(entry[2], priority: entry[0]) }

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: philiprehberger-priority_queue
 version: !ruby/object:Gem::Version
-  version: 0.1.10
+  version: 0.2.0
 platform: ruby
 authors:
 - philiprehberger
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2026-03-31 00:00:00.000000000 Z
+date: 2026-04-04 00:00:00.000000000 Z
 dependencies: []
 description: A binary heap-based priority queue supporting min-heap, max-heap, and
   custom comparator modes. Features O(log n) push/pop, priority changes, merge operations,
@@ -24,11 +24,11 @@ files:
 - README.md
 - lib/philiprehberger/priority_queue.rb
 - lib/philiprehberger/priority_queue/version.rb
-homepage: https://github.com/philiprehberger/rb-priority-queue
+homepage: https://philiprehberger.com/open-source-packages/ruby/philiprehberger-priority_queue
 licenses:
 - MIT
 metadata:
-  homepage_uri: https://github.com/philiprehberger/rb-priority-queue
+  homepage_uri: https://philiprehberger.com/open-source-packages/ruby/philiprehberger-priority_queue
   source_code_uri: https://github.com/philiprehberger/rb-priority-queue
   changelog_uri: https://github.com/philiprehberger/rb-priority-queue/blob/main/CHANGELOG.md
   bug_tracker_uri: https://github.com/philiprehberger/rb-priority-queue/issues