x_:

intervalidus.Interval.Patterns.x_:
object x_:

Attributes

Source
Interval.scala
Graph
Supertypes
class Object
trait Matchable
class Any
Self type
x_:.type

Members list

Value members

Concrete methods

def unapply[D <: NonEmptyTuple, H](i: Interval[D])(using IsAtLeastTwoDimensional[D], IsAtHead[D, H], DomainLike[NonEmptyTail[D]], DomainValueLike[H]): (Interval1D[H], Interval[NonEmptyTail[D]])

Decomposes a multidimensional interval by extracting its constituent head 1D interval and remaining tail interval. It is essentially the inverse of Interval.x. Useful when chaining a match on a fixed number of dimensions, where this pattern will match in all but the last position, e.g.,

Decomposes a multidimensional interval by extracting its constituent head 1D interval and remaining tail interval. It is essentially the inverse of Interval.x. Useful when chaining a match on a fixed number of dimensions, where this pattern will match in all but the last position, e.g.,

 dataIntervals.collect:
   case horizontal x_: vertical x_: depth =>
     randSubinterval(horizontal) x randSubinterval(vertical) x randSubinterval(depth)

Attributes

Source
Interval.scala
def unapply[H1 : DomainValueLike, H2 : DomainValueLike](i: In2D[H1, H2]): (Interval1D[H1], Interval1D[H2])

Specific to a two-dimensional interval, decomposes it by extracting its two constituent 1D intervals. It is essentially the inverse of Interval1D.x. Useful when chaining a match on a fixed number of dimensions, where this pattern will match in the last position, e.g.,

Specific to a two-dimensional interval, decomposes it by extracting its two constituent 1D intervals. It is essentially the inverse of Interval1D.x. Useful when chaining a match on a fixed number of dimensions, where this pattern will match in the last position, e.g.,

 dataIntervals.collect:
   case horizontal x_: vertical x_: depth =>
     randSubinterval(horizontal) x randSubinterval(vertical) x randSubinterval(depth)

Attributes

Source
Interval.scala