philiprehberger-ring_buffer 0.6.0 → 0.8.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 296d9b4ccfe2ca3cacba6bf34911e142381b0f8e40d2cdf0ed8f23432ff957a3
-  data.tar.gz: cfe72d59c6b58f6d0be55488a17d1760c3914ecad2ed5a91bd2dc903c8d8c8a1
+  metadata.gz: 7c4971ce57872af1d067144dcc2f47be6361c2223b33f3d3fe64e52be9a5b436
+  data.tar.gz: da55e74cbcb7de740c01f7867f4667de5e605f64cb3d2c87e36dd7ab5cfe80ac
 SHA512:
-  metadata.gz: 5268f470fe0f0ca1ba767f7e4c5c4f121686d2b6ae57a83b2aafae19600f88dc1dbef2b5a097001d407afeaa8d0e48613df80aafccf7cf745aff47b247fd8f7f
-  data.tar.gz: 00c612791299049a02e35df9c4d3ff9fe8e0106beb37408b351df13a8875b7ea40b53540d61139f98ec814122dbee73bee7a6c62ba5b571dd7c1bf0101d9fe77
+  metadata.gz: c1d3172843fb04b1c5a1119899b1977cfaf1e4d8f04d5035615a05813cc364377f86b05dd2206e845582e23fa4eee273adfa7bd6f34a5b1f9fd4ebfdff531d91
+  data.tar.gz: c644de2e1a605a9675b318aae413e5de527ed08e51d2987ffd936bde5de97391ac8c005b60402799f605e01ff93f1281336a1659f3caf11d21f00628c6bbc7ff

data/CHANGELOG.md

@@ -7,6 +7,17 @@ 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
+- `RingBuffer#range` — spread between min and max
+- `RingBuffer#count_by` — bucketed counts by block return value
+
 ## [0.6.0] - 2026-04-15
 
 ### Added
@@ -91,6 +102,7 @@ and this gem adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.htm
 - Last-n element retrieval
 - Enumerable support
 
+[0.7.0]: https://github.com/philiprehberger/rb-ring-buffer/releases/tag/v0.7.0
 [0.6.0]: https://github.com/philiprehberger/rb-ring-buffer/releases/tag/v0.6.0
 [0.5.0]: https://github.com/philiprehberger/rb-ring-buffer/releases/tag/v0.5.0
 [0.4.0]: https://github.com/philiprehberger/rb-ring-buffer/releases/tag/v0.4.0

data/README.md

@@ -147,6 +147,16 @@ buf.moving_average(window: 3)  # => [2.0, 3.0, 4.0]
 buf.ema(alpha: 0.5)            # => 4.0625
 ```
 
+### Descriptive Helpers
+
+```ruby
+buf = Philiprehberger::RingBuffer.new(10)
+[1, 2, 3, 4, 5, 6].each { |v| buf.push(v) }
+
+buf.range                  # => 5 (max - min)
+buf.count_by(&:even?)      # => { false => 3, true => 3 }
+```
+
 ### Random Sampling
 
 ```ruby
@@ -157,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
@@ -198,6 +224,9 @@ buf.select(&:odd?)        # => [1, 3]
 | `#median` | Median value |
 | `#moving_average(window:)` | Sliding window averages (oldest to newest) |
 | `#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.6.0'
+    VERSION = '0.8.0'
   end
 end

data/lib/philiprehberger/ring_buffer.rb

@@ -335,5 +335,48 @@ module Philiprehberger
     def each(&)
       to_a.each(&)
     end
+
+    # Spread between the minimum and maximum numeric elements
+    #
+    # @return [Numeric] the difference between max and min
+    # @raise [Error] if the buffer is empty
+    def range
+      raise Error, 'buffer is empty' if empty?
+
+      max - min
+    end
+
+    # Bucket elements by the block's return value and count each bucket
+    #
+    # Iterates oldest-to-newest via {#each}. An empty buffer returns `{}`.
+    #
+    # @yield [element] block whose return value is used as the bucket key
+    # @yieldparam element [Object] each element in oldest-to-newest order
+    # @return [Hash{Object => Integer}] bucket key to count mapping
+    # @return [Enumerator] if no block is given
+    def count_by(&block)
+      return enum_for(:count_by) unless block
+
+      result = Hash.new(0)
+      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.6.0
+  version: 0.8.0
 platform: ruby
 authors:
 - Philip Rehberger
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2026-04-16 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