philiprehberger-priority_queue 0.1.5 → 0.1.6

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 7f342e86d70008478c28ee2b630fbd5332375444b75e95cd4fdf50067f411be4
-  data.tar.gz: 8078c13c51a0a9d793bc5163c52ee7727251571767402a8bf059cc9bdeea29da
+  metadata.gz: 7527c4ccc3db4ec7cd3f63e45ad84f7f1fa4724436f099cb7f68269dd0f21510
+  data.tar.gz: 395a2885bc1fc84d675bd6bba4387dddaaff5bd2979745c62f5c9ecec8441299
 SHA512:
-  metadata.gz: dcc26ff306632c787749bbee30127076cda0c3c915ea00c8f862ffd1cf3671332c5b8f1e6d25c415ccf78083d8c4b4983ada21d3a7c519a0dbaf358b7999030e
-  data.tar.gz: 6a96813563fd436773fee5ef8b2483cc926dd525e10958f07f055ddfc11342e08c1e171c736f3e6161abe69bef35f5fc7c048ef96a94ab2daf11622f80042a79
+  metadata.gz: f85b7772d196465f5e3569f67347a6e98d204e31c2d1c9207da474a270820aad208f36acd04b60bfcdbbe4052d445769a39d48f588eacf24a025802413c00438
+  data.tar.gz: 4169e41b5cfcbd1070f0bd360e57ca3898b04896b7db4356bf64bbdaa01969695f88f5114d7f1ed121fdce89d2e13ec3313e0c59c85d8b128dad997cd47cbaca

data/CHANGELOG.md

@@ -7,6 +7,12 @@ and this gem adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.htm
 
 ## [Unreleased]
 
+## [0.1.6] - 2026-03-24
+
+### Fixed
+- Standardize README API section to table format
+- Fix Installation section quote style to double quotes
+
 ## [0.1.5] - 2026-03-23
 
 ### Fixed

data/README.md

@@ -15,7 +15,7 @@ Binary heap priority queue with min/max modes, custom comparators, and priority
 Add to your Gemfile:
 
 ```ruby
-gem 'philiprehberger-priority_queue'
+gem "philiprehberger-priority_queue"
 ```
 
 Or install directly:
@@ -74,45 +74,19 @@ queue.clear             # removes all items
 
 ## API
 
-### `Queue.new(mode: :min, &comparator)`
-
-Creates a new priority queue. Mode can be `:min` (default) or `:max`. An optional block provides a custom comparator.
-
-### `#push(item, priority:)` / `#<<`
-
-Adds an item with the given priority. Returns self. The `<<` operator accepts a hash: `queue << { item: 'x', priority: 1 }`.
-
-### `#pop`
-
-Removes and returns the highest-priority item. Returns `nil` if empty.
-
-### `#peek`
-
-Returns the highest-priority item without removing it. Returns `nil` if empty.
-
-### `#size` / `#empty?`
-
-Returns the number of items or whether the queue is empty.
-
-### `#change_priority(item, new_priority)`
-
-Updates the priority of an existing item and re-heapifies. Raises `ArgumentError` if the item is not found.
-
-### `#to_a`
-
-Returns all items sorted by priority.
-
-### `#include?(item)`
-
-Returns `true` if the item is in the queue.
-
-### `#clear`
-
-Removes all items from the queue.
-
-### `#merge(other)`
-
-Returns a new queue containing items from both queues. Does not modify the originals.
+| Method | Description |
+|--------|-------------|
+| `Queue.new(mode: :min, &comparator)` | Create a priority queue; mode can be `:min` or `:max`; optional custom comparator block |
+| `#push(item, priority:)` | Add an item with the given priority |
+| `#pop` | Remove and return the highest-priority item |
+| `#peek` | Return the highest-priority item without removing it |
+| `#size` | Return the number of items in the queue |
+| `#empty?` | Return `true` if the queue has no items |
+| `#change_priority(item, new_priority)` | Update the priority of an existing item and re-heapify |
+| `#to_a` | Return all items sorted by priority |
+| `#include?(item)` | Return `true` if the item is in the queue |
+| `#clear` | Remove all items from the queue |
+| `#merge(other)` | Return a new queue containing items from both queues |
 
 ## Development
 

data/lib/philiprehberger/priority_queue/version.rb

@@ -2,6 +2,6 @@
 
 module Philiprehberger
   module PriorityQueue
-    VERSION = '0.1.5'
+    VERSION = '0.1.6'
   end
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: philiprehberger-priority_queue
 version: !ruby/object:Gem::Version
-  version: 0.1.5
+  version: 0.1.6
 platform: ruby
 authors:
 - philiprehberger
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2026-03-23 00:00:00.000000000 Z
+date: 2026-03-24 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,