philiprehberger-interval 0.6.0 → 0.7.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 8aaad786d674299bcc97c96acb85df9aad7bcd91b3794404a6aad674946c8461
-  data.tar.gz: 1ec309715dd29b1f132481150d32a1c00d95413d3c0ad3aca1d6ea79420daa0e
+  metadata.gz: 9c177128b92f238098513a447db1fd1ea888fad019048acb053e334621b9299a
+  data.tar.gz: ace5a8129bd130ec72d08412cf014835ee7ea8877627caf3fbce6539455b3be6
 SHA512:
-  metadata.gz: 34ff8595dd0ede63f6cc187e06ba0de8a51fb80d15d777845c72512f8721402e225e54dbefc56089eb44610549e6de4307e03c2503a133cd9844e8446c5dbe80
-  data.tar.gz: 27c3dc2e5c9215554f995de13fbed3090311f0f09e337ea1b8d100d68e526731de1d089b141dbcb2c938421b1a8a5dd9ada07d95d3d9b123aaa72a0ab1b70f6e
+  metadata.gz: dcfc3793178ca911054202f5c6feeea44d952751c47a33cd3e5b9939fe26fd674d20fb2b4f62b687ae6b510e55ad9db64a0151aa285ffdd65205907fa79bf4f9
+  data.tar.gz: 05fd282975ef4dd41fdf9bc16990130395ba55aba456d9bf94dfef2df56fcf1d50e4587b8c0f5dcd761325eab9cf7bf0b6fef3d62179f62b29953fed7f01d1ae

data/CHANGELOG.md

@@ -7,6 +7,11 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 
 ## [Unreleased]
 
+## [0.7.0] - 2026-05-01
+
+### Added
+- `Interval.span(intervals)` — return the smallest closed interval containing every input interval; complements `merge` (multiple intervals on gaps) and `intersection` (common overlap)
+
 ## [0.6.0] - 2026-04-21
 
 ### Added

data/README.md

@@ -110,6 +110,19 @@ Philiprehberger::Interval.intersection([
 # => [5, 8]
 ```
 
+### Spanning Interval
+
+Compute the smallest closed interval that contains every input — useful for charting and bounding-box queries. Spans across gaps too:
+
+```ruby
+Philiprehberger::Interval.span([
+  Philiprehberger::Interval.new(3, 7),
+  Philiprehberger::Interval.new(1, 4),
+  Philiprehberger::Interval.new(8, 10)
+])
+# => [1, 10]
+```
+
 ### Touching Intervals
 
 Check whether two intervals meet at exactly one point with no overlap and no gap — useful when partitioning a range so every value is covered exactly once:
@@ -156,6 +169,7 @@ shift.include?(Time.new(2026, 1, 1, 12))  # => true
 | `.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` |
+| `.span(intervals)` | Smallest closed interval enclosing all inputs (or `nil` if empty) |
 
 ## Development
 

data/lib/philiprehberger/interval/version.rb

@@ -2,6 +2,6 @@
 
 module Philiprehberger
   module Interval
-    VERSION = '0.6.0'
+    VERSION = '0.7.0'
   end
 end

data/lib/philiprehberger/interval.rb

@@ -67,5 +67,22 @@ module Philiprehberger
       end
       result
     end
+
+    # The smallest closed interval that contains every input interval.
+    #
+    # The result spans from the minimum start to the maximum finish across
+    # all inputs and is always returned as a closed interval. Distinct from
+    # {.merge} (which yields multiple intervals when there are gaps) and
+    # {.intersection} (which yields the common overlap or nil).
+    #
+    # @param intervals [Array<Range>] the intervals to span
+    # @return [Range, nil] the enclosing interval, or `nil` if the input is empty
+    def self.span(intervals)
+      return nil if intervals.empty?
+
+      min_start = intervals.map(&:start).min
+      max_finish = intervals.map(&:finish).max
+      Range.new(min_start, max_finish)
+    end
   end
 end

metadata

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