philiprehberger-priority_queue 0.2.1 → 0.3.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 550864e1c3c7c28c4d978059acd56e73d64fd084e9263f46afd5fbf52a86671e
-  data.tar.gz: 766b98241695a100ba12122f06c6a7d4cada3c28685643f08fae483b667da0ce
+  metadata.gz: 81ecb740f0ef3871c9662a0bf53f627784e039ad638c3e772fae8cbf9664ec52
+  data.tar.gz: 8233105bc0db893faa7a53696c2283165d4bc6b5f10f86c02771a1101ddb1a76
 SHA512:
-  metadata.gz: a76b48855cd5782999ec79ae730efc4ebeaad9a02f78b4b1d981979d3cdf7b9543108d53bf710163d526b09273f655a9dc0bcf716c42c870c6678994d2a4b29d
-  data.tar.gz: d31237580572959f8cbf0943504b96205df6b97678a4385dcf5963bf069b52f8eac8cbd45d644be6779c7cca1d98ec039e6e507844888f4d83ad9e61e0d00c59
+  metadata.gz: 47adacec5e5bd08c5cd6dd2a45500f5e5901372df0171b1aaceb6aefe0e162fc4504e67b345a067ee818685333ca158eb3440a7fe9173c4716e2ed18f1586537
+  data.tar.gz: 53380b7734ed65fcbf26b80644caef0268b2c187182a8168792aba4fa855433a4dcca840060a9f673972cb4250fc3e1cc996e75474bfcb8a07ac35168d03da59

data/CHANGELOG.md

@@ -7,6 +7,11 @@ and this gem adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.htm
 
 ## [Unreleased]
 
+## [0.3.0] - 2026-04-15
+
+### Added
+- `Queue#pop_n(n)` to pop up to `n` items in priority order and return them as an array; returns `[]` for empty queues or `n == 0`; raises `ArgumentError` for negative `n`
+
 ## [0.2.1] - 2026-04-15
 
 ### Fixed

data/README.md

@@ -127,6 +127,21 @@ queue.drain # => ["a", "b", "c"]
 queue.empty? # => true
 ```
 
+### Pop N
+
+Pop up to `n` items in priority order. Returns fewer than `n` items when the queue is exhausted.
+
+```ruby
+queue = Philiprehberger::PriorityQueue::Queue.new
+queue.push("a", priority: 1)
+queue.push("b", priority: 2)
+queue.push("c", priority: 3)
+
+queue.pop_n(2) # => ["a", "b"]
+queue.pop_n(5) # => ["c"]
+queue.pop_n(0) # => []
+```
+
 ### Delete
 
 Remove a specific item by value.
@@ -202,6 +217,7 @@ merged.size # => 3
 | `#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 |
+| `#pop_n(n)` | Pop up to `n` items in priority order and return as array; returns `[]` for empty queue or `n == 0`; raises `ArgumentError` for negative `n` |
 | `#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) |

data/lib/philiprehberger/priority_queue/version.rb

@@ -2,6 +2,6 @@
 
 module Philiprehberger
   module PriorityQueue
-    VERSION = '0.2.1'
+    VERSION = '0.3.0'
   end
 end

data/lib/philiprehberger/priority_queue.rb

@@ -57,6 +57,18 @@ module Philiprehberger
         @heap[0][2]
       end
 
+      def pop_n(n)
+        raise ArgumentError, "n must be non-negative, got #{n}" if n.negative?
+
+        result = []
+        n.times do
+          break if empty?
+
+          result << pop
+        end
+        result
+      end
+
       def empty?
         @size.zero?
       end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: philiprehberger-priority_queue
 version: !ruby/object:Gem::Version
-  version: 0.2.1
+  version: 0.3.0
 platform: ruby
 authors:
 - Philip Rehberger