philiprehberger-interval 0.4.0 → 0.5.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: ecb8d7c68d3603d44c8df9a87a224c52300377809ad98ab1d19fe1a89ec13449
-  data.tar.gz: 75b3438103596f8a4de7f358a9f1cc25cd39fe5e80a47dfb6f25d38852e26964
+  metadata.gz: 2cc42dea01af0c3d94ccd1473f57540edadacd0da1763cfb29cfcceaca105900
+  data.tar.gz: 0455405d87eda7c2a20b913bcd9d26477247dfd69a99adc2f00be29c340aaf5e
 SHA512:
-  metadata.gz: 78198caa2a0cf621b3545997e8fdfb58ad7424d7304e7d4367873dd69eaa02db2c91f1ed5a95cd365074be886063fb91941dea72180b2ce4e099c6e1982fddcf
-  data.tar.gz: 2dbb700fce8cd9cf5d973ab0baabece8e8b94e8d79f71939a805418f7fdfdbf626ca183ae9ab0fc18c2c036f21a2c0de9ddd28d90e1978da02139ac8eb3d1178
+  metadata.gz: fd54e350ee506ed02827ad6c23f4eec3d492eadc9b68cee0d4a4608773e1611a799ceb4ca2e56409ba0e27145852fe5c6d8adb168875f93c3818f25e82ef4c55
+  data.tar.gz: 626544c2d371d2c1de5a1a1b4f4ac7f181af2b8397ae85168e617b7d77a8445f0f3f6d7e66a01fc81586bce8f144692410d8c0a677d86cffbf44b323bfc4498a

data/CHANGELOG.md

@@ -7,6 +7,11 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 
 ## [Unreleased]
 
+## [0.5.0] - 2026-04-16
+
+### Added
+- `Range#sample(n = nil)` — return a random Float within the interval, or an array of n random Floats; respects open/closed boundaries via rejection sampling; raises on empty intervals; returns start for point intervals
+
 ## [0.4.0] - 2026-04-15
 
 ### Added

data/README.md

@@ -84,6 +84,19 @@ Philiprehberger::Interval.gaps(intervals)
 # => [[7, 10]]
 ```
 
+### Sampling Random Values
+
+Return one or more random Floats from within an interval. Open boundaries are respected via rejection sampling:
+
+```ruby
+interval = Philiprehberger::Interval.new(1.0, 5.0)
+interval.sample        # => 3.247... (single Float)
+interval.sample(3)     # => [1.823..., 4.501..., 2.964...]
+
+open = Philiprehberger::Interval.new(1.0, 5.0, type: :open)
+open.sample            # => always strictly between 1.0 and 5.0
+```
+
 ### Finding a Common Intersection
 
 Compute the overlap shared by every interval, or `nil` if any pair is disjoint:
@@ -123,6 +136,7 @@ shift.include?(Time.new(2026, 1, 1, 12))  # => true
 | `#scale(factor, anchor:)` | Scale width around anchor (`:center`, `:left`, `:right`) |
 | `#split(n)` | Split into n equal sub-intervals |
 | `#clamp(value)` | Clamp value to interval bounds |
+| `#sample(n = nil)` | Return a random Float, or array of n Floats, within the interval (respects boundaries) |
 | `.merge(intervals)` | Merge overlapping intervals into non-overlapping set |
 | `.gaps(intervals)` | Find gaps between a set of intervals |
 | `.intersection(intervals)` | Common overlap of a collection of intervals, or `nil` |

data/lib/philiprehberger/interval/range.rb

@@ -186,6 +186,26 @@ module Philiprehberger
         end
       end
 
+      # Return one or more random Floats within the interval.
+      #
+      # Without an argument, returns a single random Float. With an integer
+      # argument, returns an array of that many random Floats. Respects boundary
+      # types: open boundaries are excluded via rejection sampling. Returns
+      # +start+ immediately for point intervals (start == finish, closed).
+      #
+      # @param n [Integer, nil] number of samples, or nil for a single value
+      # @return [Float, Array<Float>]
+      # @raise [Error] if the interval is empty
+      def sample(n = nil)
+        raise Error, 'cannot sample an empty interval' if empty?
+
+        if n.nil?
+          sample_one
+        else
+          Array.new(n) { sample_one }
+        end
+      end
+
       # Clamp a value to the interval bounds.
       #
       # @param value [Comparable] the value to clamp
@@ -239,6 +259,22 @@ module Philiprehberger
       def empty?
         @start == @finish && @type != :closed
       end
+
+      private
+
+      def sample_one
+        return @start.to_f if @start == @finish
+
+        lo = @start.to_f
+        hi = @finish.to_f
+
+        loop do
+          value = lo + (rand * (hi - lo))
+          left_ok  = left_closed?  ? value >= lo : value > lo
+          right_ok = right_closed? ? value <= hi : value < hi
+          return value if left_ok && right_ok
+        end
+      end
     end
   end
 end

data/lib/philiprehberger/interval/version.rb

@@ -2,6 +2,6 @@
 
 module Philiprehberger
   module Interval
-    VERSION = '0.4.0'
+    VERSION = '0.5.0'
   end
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: philiprehberger-interval
 version: !ruby/object:Gem::Version
-  version: 0.4.0
+  version: 0.5.0
 platform: ruby
 authors:
 - Philip Rehberger
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2026-04-15 00:00:00.000000000 Z
+date: 2026-04-17 00:00:00.000000000 Z
 dependencies: []
 description: Interval data type supporting closed, open, and half-open boundaries
   with overlap detection, containment, intersection, union, subtraction, shift, scale,