philiprehberger-interval 0.2.0 → 0.4.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 6039cd1187d208aeb17ffae5d095d4dd9416fd8175f95084984600dc36c15b74
-  data.tar.gz: 4cb497c7a97490954a47568a6b024e517f71a680f040644073b60b316f6fe174
+  metadata.gz: ecb8d7c68d3603d44c8df9a87a224c52300377809ad98ab1d19fe1a89ec13449
+  data.tar.gz: 75b3438103596f8a4de7f358a9f1cc25cd39fe5e80a47dfb6f25d38852e26964
 SHA512:
-  metadata.gz: 60355c282c23da5623dc104947363632290343db018701c800f0b10e65bb64d87e5c5e0a69b08ca309ee7241318d92381cca64a1f9fc0f5be036a139d2258b9a
-  data.tar.gz: 4c686abfd2318284ca810c87d25787804029ec3355039f56f3a859d3abdae8925704e0320a3ac6be192174dbe426fd28622ce73be36d514e0e18ae00b26117f1
+  metadata.gz: 78198caa2a0cf621b3545997e8fdfb58ad7424d7304e7d4367873dd69eaa02db2c91f1ed5a95cd365074be886063fb91941dea72180b2ce4e099c6e1982fddcf
+  data.tar.gz: 2dbb700fce8cd9cf5d973ab0baabece8e8b94e8d79f71939a805418f7fdfdbf626ca183ae9ab0fc18c2c036f21a2c0de9ddd28d90e1978da02139ac8eb3d1178

data/CHANGELOG.md

@@ -7,6 +7,16 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 
 ## [Unreleased]
 
+## [0.4.0] - 2026-04-15
+
+### Added
+- `Range#overlap_ratio(other)` — fraction of self covered by another interval (Float in 0.0–1.0)
+
+## [0.3.0] - 2026-04-15
+
+### Added
+- `Interval.intersection(intervals)` — compute the common overlap of a collection of intervals
+
 ## [0.2.0] - 2026-04-03
 
 ### Added

data/README.md

@@ -36,6 +36,7 @@ a.overlaps?(b)     # => true
 a.intersect(b)     # => [3, 5]
 a.union(b)         # => [1, 8]
 a.include?(4)      # => true
+a.overlap_ratio(b) # => 0.5
 ```
 
 ### Interval Types
@@ -83,6 +84,19 @@ Philiprehberger::Interval.gaps(intervals)
 # => [[7, 10]]
 ```
 
+### Finding a Common Intersection
+
+Compute the overlap shared by every interval, or `nil` if any pair is disjoint:
+
+```ruby
+Philiprehberger::Interval.intersection([
+  Philiprehberger::Interval.new(1, 10),
+  Philiprehberger::Interval.new(3, 8),
+  Philiprehberger::Interval.new(5, 12)
+])
+# => [5, 8]
+```
+
 ### With Time Values
 
 ```ruby
@@ -100,6 +114,7 @@ shift.include?(Time.new(2026, 1, 1, 12))  # => true
 | `#contains?(other)` | Check if interval fully contains another |
 | `#adjacent?(other)` | Check if intervals are touching but not overlapping |
 | `#intersect(other)` | Return the overlap between two intervals |
+| `#overlap_ratio(other)` | Fraction of self covered by other (0.0–1.0) |
 | `#union(other)` | Return the combined interval |
 | `#subtract(other)` | Remove another interval, returning remaining parts |
 | `#size` | Length of the interval |
@@ -110,6 +125,7 @@ shift.include?(Time.new(2026, 1, 1, 12))  # => true
 | `#clamp(value)` | Clamp value to interval bounds |
 | `.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` |
 
 ## Development
 

data/lib/philiprehberger/interval/range.rb

@@ -113,6 +113,23 @@ module Philiprehberger
         @finish - @start
       end
 
+      # Return the fraction of self that is covered by another interval.
+      #
+      # Returns a Float in 0.0..1.0. Returns 0.0 if disjoint, 1.0 if self is
+      # fully contained in other. If self has zero length (a point), returns
+      # 1.0 when the point is within other, else 0.0.
+      #
+      # @param other [Range] the other interval
+      # @return [Float] the fraction of self covered by other
+      def overlap_ratio(other)
+        return other.include?(@start) ? 1.0 : 0.0 if size.zero?
+
+        overlap = intersect(other)
+        return 0.0 if overlap.nil?
+
+        overlap.size.to_f / size
+      end
+
       # Check if a point is within the interval.
       #
       # @param point [Comparable] the point to check

data/lib/philiprehberger/interval/version.rb

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

data/lib/philiprehberger/interval.rb

@@ -39,6 +39,20 @@ module Philiprehberger
       merged
     end
 
+    # Compute the common overlap across a collection of intervals.
+    #
+    # @param intervals [Array<Range>] the intervals to intersect
+    # @return [Range, nil] the common intersection, or nil if any pair is disjoint
+    def self.intersection(intervals)
+      return nil if intervals.empty?
+
+      intervals[1..].reduce(intervals.first) do |acc, current|
+        return nil if acc.nil?
+
+        acc.intersect(current)
+      end
+    end
+
     # Find gaps between a collection of intervals.
     #
     # @param intervals [Array<Range>] the intervals to analyze

metadata

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