philiprehberger-queue_stack 0.3.0 → 0.4.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 61b9b755594ffadcc05a80b942c0424a29043da9e01c81bc41045c5d440156e1
-  data.tar.gz: 823d4982ec931ecf197a42e37ceb7439939a4e6e06070d22ceb437eb1985f2e4
+  metadata.gz: 8f720c2ee97526d57826cb37fba4be96e6e1143879b7627a2792cef97ffaa1dc
+  data.tar.gz: 311fdae1a3eb9f31d27f4ef77006eae1f224050418ac97721540d761ac081ac0
 SHA512:
-  metadata.gz: 0c2f235cd8a6f31bafd5d94af63806e3caabc0fff8743b82815ff90df255f74dbf6d924edccb57e5d73f0fef65958b1c7231e60e96bc9dde9aee3e94718ce0fd
-  data.tar.gz: 35d25847836f39bbd80fd7aa8ff07005c126cec030be1d1e9908a4d428d8f96cf2b662167cce8428314aefd7a1ce2384179dd8489e132f1635333e2ffd1dec48
+  metadata.gz: fd4c5bc553fde4d2278b2efa422ed0c4c67aaf63d9c5bc049bce395066ab544533bf2b11696a564769cbd6dbdd900a4c802a12abec032d888d17c0d0d5d0dc36
+  data.tar.gz: aa1cc6ea3d889cde7c372943df2bb9b5c46d0f87f3e628659e01ebbbf3697a8ce548f41c36508a3f82af14818ca0bd852da74aa577e13abf29899f1b60e6a162

data/CHANGELOG.md

@@ -7,6 +7,11 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 
 ## [Unreleased]
 
+## [0.4.0] - 2026-04-15
+
+### Added
+- `Queue#peek_at(index)` returns the item at the given position without removing it, supporting negative indices like `Array#[]` and returning `nil` when out of range
+
 ## [0.3.0] - 2026-04-09
 
 ### Added

data/README.md

@@ -40,9 +40,13 @@ item = q.dequeue  # => 'task'
 q = Philiprehberger::QueueStack::Queue.new(capacity: 10)
 q.enqueue('first')
 q.enqueue('second')
-q.dequeue   # => 'first'
-q.peek      # => 'second'
-q.size      # => 1
+q.enqueue('third')
+q.peek         # => 'first'
+q.peek_at(1)   # => 'second'
+q.peek_at(-1)  # => 'third'
+q.peek_at(99)  # => nil (out of range)
+q.dequeue      # => 'first'
+q.size         # => 2
 ```
 
 ### Stack (LIFO)
@@ -149,6 +153,7 @@ q.full?   # => true
 | `#try_dequeue(timeout:)` | Dequeue with timeout, returns nil on timeout |
 | `#clear` | Remove all items without returning them |
 | `#peek` | View front item without removing |
+| `#peek_at(index)` | View item at the given position (supports negative indices, returns nil if out of range) |
 | `#drain` | Remove and return all items as array (FIFO order) |
 | `#each` | Iterate items without removing (returns Enumerator if no block) |
 | `#to_a` | Snapshot as array (FIFO order) |

data/lib/philiprehberger/queue_stack/queue.rb

@@ -175,6 +175,18 @@ module Philiprehberger
         @mutex.synchronize { @items.first }
       end
 
+      # Peek at the item at the given position without removing it.
+      #
+      # Indexing follows +Array#[]+ semantics: +0+ is the front of the queue,
+      # +size - 1+ is the back, and negative indices count from the back
+      # (+-1+ is the last item). Returns +nil+ when the index is out of range.
+      #
+      # @param index [Integer] position in the queue (supports negative indices)
+      # @return [Object, nil] the item at the position or nil if out of range
+      def peek_at(index)
+        @mutex.synchronize { @items[index] }
+      end
+
       # Return the number of items in the queue.
       #
       # @return [Integer]

data/lib/philiprehberger/queue_stack/version.rb

@@ -2,6 +2,6 @@
 
 module Philiprehberger
   module QueueStack
-    VERSION = '0.3.0'
+    VERSION = '0.4.0'
   end
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: philiprehberger-queue_stack
 version: !ruby/object:Gem::Version
-  version: 0.3.0
+  version: 0.4.0
 platform: ruby
 authors:
 - Philip Rehberger
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2026-04-09 00:00:00.000000000 Z
+date: 2026-04-15 00:00:00.000000000 Z
 dependencies: []
 description: Thread-safe queue and stack data structures with configurable capacity
   limits, blocking enqueue/dequeue with timeouts, and peek operations. Uses Mutex