philiprehberger-interval 0.5.0 → 0.7.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 2cc42dea01af0c3d94ccd1473f57540edadacd0da1763cfb29cfcceaca105900
-  data.tar.gz: 0455405d87eda7c2a20b913bcd9d26477247dfd69a99adc2f00be29c340aaf5e
+  metadata.gz: 9c177128b92f238098513a447db1fd1ea888fad019048acb053e334621b9299a
+  data.tar.gz: ace5a8129bd130ec72d08412cf014835ee7ea8877627caf3fbce6539455b3be6
 SHA512:
-  metadata.gz: fd54e350ee506ed02827ad6c23f4eec3d492eadc9b68cee0d4a4608773e1611a799ceb4ca2e56409ba0e27145852fe5c6d8adb168875f93c3818f25e82ef4c55
-  data.tar.gz: 626544c2d371d2c1de5a1a1b4f4ac7f181af2b8397ae85168e617b7d77a8445f0f3f6d7e66a01fc81586bce8f144692410d8c0a677d86cffbf44b323bfc4498a
+  metadata.gz: dcfc3793178ca911054202f5c6feeea44d952751c47a33cd3e5b9939fe26fd674d20fb2b4f62b687ae6b510e55ad9db64a0151aa285ffdd65205907fa79bf4f9
+  data.tar.gz: 05fd282975ef4dd41fdf9bc16990130395ba55aba456d9bf94dfef2df56fcf1d50e4587b8c0f5dcd761325eab9cf7bf0b6fef3d62179f62b29953fed7f01d1ae

data/CHANGELOG.md

@@ -7,6 +7,20 @@ 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
+- `Range#touching?` — strict boundary-touching predicate
+- `Range#length` — alias for `#size`
+
+### Fixed
+- `bug_report.yml` — require Ruby version; add Gem version input per guide
+
 ## [0.5.0] - 2026-04-16
 
 ### Added

data/README.md

@@ -110,6 +110,33 @@ 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:
+
+```ruby
+a = Philiprehberger::Interval.new(1, 5, type: :right_open) # [1, 5)
+b = Philiprehberger::Interval.new(5, 10, type: :closed)    # [5, 10]
+a.touching?(b) # => true  (5 covered once)
+
+c = Philiprehberger::Interval.new(1, 5, type: :closed)     # [1, 5]
+d = Philiprehberger::Interval.new(5, 10, type: :closed)    # [5, 10]
+c.touching?(d) # => false (5 covered twice)
+```
+
 ### With Time Values
 
 ```ruby
@@ -126,11 +153,13 @@ shift.include?(Time.new(2026, 1, 1, 12))  # => true
 | `#overlaps?(other)` | Check if two intervals overlap (respects boundary types) |
 | `#contains?(other)` | Check if interval fully contains another |
 | `#adjacent?(other)` | Check if intervals are touching but not overlapping |
+| `#touching?(other)` | Check if intervals meet at a single point with exactly one closed side |
 | `#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 |
+| `#length` | Alias for `#size` |
 | `#include?(point)` | Check if a point falls within the interval (respects boundary types) |
 | `#shift(delta)` | Return new interval shifted by delta, preserving type |
 | `#scale(factor, anchor:)` | Scale width around anchor (`:center`, `:left`, `:right`) |
@@ -140,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/range.rb

@@ -112,6 +112,27 @@ module Philiprehberger
       def size
         @finish - @start
       end
+      alias length size
+
+      # Check if this interval strictly touches another at a single endpoint.
+      #
+      # Returns +true+ iff the two intervals share exactly one endpoint value
+      # and exactly one of the two boundaries at that point is closed — so the
+      # meeting point is covered exactly once, with no gap and no overlap.
+      #
+      # @param other [Range] the other interval
+      # @return [Boolean]
+      def touching?(other)
+        return false if overlaps?(other)
+
+        if @finish == other.start
+          right_closed? ^ other.left_closed?
+        elsif other.finish == @start
+          other.right_closed? ^ left_closed?
+        else
+          false
+        end
+      end
 
       # Return the fraction of self that is covered by another interval.
       #

data/lib/philiprehberger/interval/version.rb

@@ -2,6 +2,6 @@
 
 module Philiprehberger
   module Interval
-    VERSION = '0.5.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.5.0
+  version: 0.7.0
 platform: ruby
 authors:
 - Philip Rehberger
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2026-04-17 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,