philiprehberger-ring_buffer 0.5.0 → 0.7.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 14989919be86bb2eda368bc258ce97204162a5435b48c2d1187f6890934ed5b8
-  data.tar.gz: 74276b96e9b504278022d5c64c089048eb48fa08e629a441c1064e71947dd95d
+  metadata.gz: c341e6a009acc45d1b8ca3ca03851ae4d1f3b713396b23f7be323e53908579d2
+  data.tar.gz: f53265859bebd7feec3f5f664f619ac82fb34f047019bb9316855be31c22cda1
 SHA512:
-  metadata.gz: 218f50092f5d9f13b4c22e627a4773c06053bc8fd417b5f98a5728bf44aab035ea7253355b695bf76bb0323c161d7c4e8201bf8ccca411d95467ef6fac71d46a
-  data.tar.gz: 115237b8ffc4260f1bdab21d4529c0e9dc0ff996de8549904c3bdf4bd653a61fecd72e874c0286973973a6fe1a3f0d37222ece924c74b1836444d08e38e25573
+  metadata.gz: 710ec989953bac0172e8358fe9eefa1ecf62ab0950522770c34bf7df2f8f17590c1ff5440ee5254897d8b3172bc697a54d168764be622bd6f280af2459600255
+  data.tar.gz: 84b6227b2fdabb56f9b3aae4e595fdda1db5906f145c35f7c7b994d163bd8254db49b8549a7197242d2135fac0fc9ecc9da7f43e715d8f9315fe9f66d1871b78

data/CHANGELOG.md

@@ -7,6 +7,18 @@ and this gem adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.htm
 
 ## [Unreleased]
 
+## [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
+- `#moving_average(window:)` for sliding window averages over buffer elements
+- `#ema(alpha:)` for exponential moving average calculation
+
 ## [0.5.0] - 2026-04-14
 
 ### Added
@@ -85,6 +97,8 @@ 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
 [0.3.0]: https://github.com/philiprehberger/rb-ring-buffer/releases/tag/v0.3.0

data/README.md

@@ -137,6 +137,26 @@ buf.percentile(75)   # => 75.25
 buf.percentile(90)   # => 90.1
 ```
 
+### Moving Averages
+
+```ruby
+buf = Philiprehberger::RingBuffer.new(5)
+[1, 2, 3, 4, 5].each { |v| buf.push(v) }
+
+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
@@ -186,6 +206,10 @@ buf.select(&:odd?)        # => [1, 3]
 | `#variance` | Population variance |
 | `#stddev` | Population standard deviation |
 | `#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 |
 
 ## Development
 

data/lib/philiprehberger/ring_buffer/version.rb

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

data/lib/philiprehberger/ring_buffer.rb

@@ -287,6 +287,41 @@ module Philiprehberger
       n.nil? ? arr.sample : arr.sample(n)
     end
 
+    # Sliding window averages over elements oldest to newest
+    #
+    # @param window [Integer] window size
+    # @return [Array<Float>]
+    def moving_average(window:)
+      raise Error, 'buffer is empty' if empty?
+      raise Error, 'window must be a positive integer' unless window.is_a?(Integer) && window.positive?
+      raise Error, 'window exceeds buffer size' if window > @count
+
+      arr = to_a
+      arr.each { |v| raise Error, 'all elements must be numeric' unless v.is_a?(Numeric) }
+
+      (0..(arr.length - window)).map do |i|
+        arr[i, window].sum.to_f / window
+      end
+    end
+
+    # Exponential moving average
+    #
+    # @param alpha [Float] smoothing factor (0 < alpha <= 1)
+    # @return [Float]
+    def ema(alpha:)
+      raise Error, 'buffer is empty' if empty?
+      raise Error, 'alpha must be between 0 (exclusive) and 1 (inclusive)' unless alpha.is_a?(Numeric) && alpha.positive? && alpha <= 1
+
+      arr = to_a
+      arr.each { |v| raise Error, 'all elements must be numeric' unless v.is_a?(Numeric) }
+
+      result = arr.first.to_f
+      arr.drop(1).each do |v|
+        result = (alpha * v) + ((1 - alpha) * result)
+      end
+      result
+    end
+
     # Human-readable string representation
     #
     # @return [String]
@@ -300,5 +335,31 @@ 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
   end
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: philiprehberger-ring_buffer
 version: !ruby/object:Gem::Version
-  version: 0.5.0
+  version: 0.7.0
 platform: ruby
 authors:
 - Philip Rehberger
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2026-04-14 00:00:00.000000000 Z
+date: 2026-04-21 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