philiprehberger-interval 0.2.0 → 0.3.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 6039cd1187d208aeb17ffae5d095d4dd9416fd8175f95084984600dc36c15b74
-  data.tar.gz: 4cb497c7a97490954a47568a6b024e517f71a680f040644073b60b316f6fe174
+  metadata.gz: 2614076496fada8f6202df687ec993c5438e3a47945824e05e6bb4d00cc1c046
+  data.tar.gz: 2557c885218f82fe7de28ea6e91e660b9b901ab2995ca8d68e3a1ef9cf9b2d21
 SHA512:
-  metadata.gz: 60355c282c23da5623dc104947363632290343db018701c800f0b10e65bb64d87e5c5e0a69b08ca309ee7241318d92381cca64a1f9fc0f5be036a139d2258b9a
-  data.tar.gz: 4c686abfd2318284ca810c87d25787804029ec3355039f56f3a859d3abdae8925704e0320a3ac6be192174dbe426fd28622ce73be36d514e0e18ae00b26117f1
+  metadata.gz: ed05a860c2d28ce9cfdf00787585e117c41ee03bd1a4f917f4c06d4c461313a7fcdfe0fa7ce9f6073804c4c67c1169e84a7988a2070d8f54f42a725a0caef36b
+  data.tar.gz: 8451b55300a3d8d489cc895792256f4e7a1077d9be2a0df25aee1e7f9ef42d9defa2de2fe7eabe3b3d3c58c6c959037f65f89a06eaa8e96d61025ff91a09e285

data/CHANGELOG.md

@@ -7,6 +7,11 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 
 ## [Unreleased]
 
+## [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

@@ -83,6 +83,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
@@ -110,6 +123,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/version.rb

@@ -2,6 +2,6 @@
 
 module Philiprehberger
   module Interval
-    VERSION = '0.2.0'
+    VERSION = '0.3.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.3.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,