philiprehberger-ring_buffer 0.7.0 → 0.8.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: c341e6a009acc45d1b8ca3ca03851ae4d1f3b713396b23f7be323e53908579d2
-  data.tar.gz: f53265859bebd7feec3f5f664f619ac82fb34f047019bb9316855be31c22cda1
+  metadata.gz: 7c4971ce57872af1d067144dcc2f47be6361c2223b33f3d3fe64e52be9a5b436
+  data.tar.gz: da55e74cbcb7de740c01f7867f4667de5e605f64cb3d2c87e36dd7ab5cfe80ac
 SHA512:
-  metadata.gz: 710ec989953bac0172e8358fe9eefa1ecf62ab0950522770c34bf7df2f8f17590c1ff5440ee5254897d8b3172bc697a54d168764be622bd6f280af2459600255
-  data.tar.gz: 84b6227b2fdabb56f9b3aae4e595fdda1db5906f145c35f7c7b994d163bd8254db49b8549a7197242d2135fac0fc9ecc9da7f43e715d8f9315fe9f66d1871b78
+  metadata.gz: c1d3172843fb04b1c5a1119899b1977cfaf1e4d8f04d5035615a05813cc364377f86b05dd2206e845582e23fa4eee273adfa7bd6f34a5b1f9fd4ebfdff531d91
+  data.tar.gz: c644de2e1a605a9675b318aae413e5de527ed08e51d2987ffd936bde5de97391ac8c005b60402799f605e01ff93f1281336a1659f3caf11d21f00628c6bbc7ff

data/CHANGELOG.md

@@ -7,6 +7,11 @@ and this gem adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.htm
 
 ## [Unreleased]
 
+## [0.8.0] - 2026-04-28
+
+### Added
+- `RingBuffer#each_chunk(size)` — yield successive non-overlapping chunks of `size` elements (oldest first). Returns an Enumerator without a block. Raises `Error` for non-positive sizes.
+
 ## [0.7.0] - 2026-04-21
 
 ### Added

data/README.md

@@ -167,6 +167,22 @@ buf.sample       # => random element
 buf.sample(2)    # => [random, random]
 ```
 
+### Chunked Iteration
+
+Yield successive non-overlapping chunks of fixed size in oldest-first order.
+The final chunk may be shorter:
+
+```ruby
+buf = Philiprehberger::RingBuffer.new(10)
+(1..7).each { |v| buf.push(v) }
+
+buf.each_chunk(2).to_a   # => [[1, 2], [3, 4], [5, 6], [7]]
+
+buf.each_chunk(3) do |chunk|
+  process_batch(chunk)
+end
+```
+
 ### Enumerable
 
 ```ruby
@@ -210,6 +226,7 @@ buf.select(&:odd?)        # => [1, 3]
 | `#ema(alpha:)` | Exponential moving average (single float) |
 | `#range` | Spread between min and max numeric elements |
 | `#count_by(&block)` | Bucketed counts by block return value |
+| `#each_chunk(size)` | Yield successive non-overlapping chunks of `size` elements (oldest first) |
 
 ## Development
 

data/lib/philiprehberger/ring_buffer/version.rb

@@ -2,6 +2,6 @@
 
 module Philiprehberger
   class RingBuffer
-    VERSION = '0.7.0'
+    VERSION = '0.8.0'
   end
 end

data/lib/philiprehberger/ring_buffer.rb

@@ -361,5 +361,22 @@ module Philiprehberger
       each { |element| result[block.call(element)] += 1 }
       result
     end
+
+    # Yield successive non-overlapping chunks of `size` elements (oldest first)
+    #
+    # The final chunk may be shorter than `size` if the buffer length is not
+    # a multiple of `size`. An empty buffer yields nothing.
+    #
+    # @param size [Integer] chunk size (must be positive)
+    # @yield [chunk] each chunk in oldest-to-newest order
+    # @yieldparam chunk [Array] up to `size` elements
+    # @return [Enumerator] when no block is given
+    # @raise [Error] when `size` is not a positive integer
+    def each_chunk(size, &block)
+      raise Error, 'size must be a positive integer' unless size.is_a?(Integer) && size.positive?
+      return enum_for(:each_chunk, size) unless block
+
+      to_a.each_slice(size, &block)
+    end
   end
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: philiprehberger-ring_buffer
 version: !ruby/object:Gem::Version
-  version: 0.7.0
+  version: 0.8.0
 platform: ruby
 authors:
 - Philip Rehberger
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2026-04-21 00:00:00.000000000 Z
+date: 2026-04-29 00:00:00.000000000 Z
 dependencies: []
 description: Fixed-capacity ring buffer that overwrites oldest entries on overflow,
   with index access, push/pop/shift mutation, oldest/newest peek, built-in statistics