case class KeyBounds[+K](minKey: K, maxKey: K) extends Bounds[K] with Product with Serializable
Represents non-empty region of descrete space. Any key which is greater than or equal to minKey and less then or equal to maxKey in each individual dimension is part of the region described by these Bounds.
- minKey
Minimum key of the region, inclusive.
- maxKey
Maximum key of the region, inclusive.
- Alphabetic
- By Inheritance
- KeyBounds
- Bounds
- Serializable
- Serializable
- Product
- Equals
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
-
new
KeyBounds(minKey: K, maxKey: K)
- minKey
Minimum key of the region, inclusive.
- maxKey
Maximum key of the region, inclusive.
Value Members
-
def
combine[B >: K](other: Bounds[B])(implicit b: Boundable[B]): KeyBounds[B]
Combine two regions by creating a region that covers both regions fully
-
def
contains[B >: K](other: Bounds[B])(implicit b: Boundable[B]): Boolean
Test if other bounds are fully contained by this bounds.
Test if other bounds are fully contained by this bounds. EmptyBounds contain no other bounds but are contained by all non-empty bounds.
-
final
def
flatMap[B](f: (KeyBounds[K]) ⇒ Bounds[B]): Bounds[B]
Returns the result of applying f to this Bounds minKey and maxKey if this it is nonempty.
Returns the result of applying f to this Bounds minKey and maxKey if this it is nonempty. The minKey and maxKeys are given as instance of KeyBounds instead of a tuple. If this Bounds is EmptyBounds it is returned unchanged.
- Definition Classes
- Bounds
- Annotations
- @inline()
-
def
get: KeyBounds[K]
Returns non-empty bounds or throws NoSuchElementException
-
def
getOrElse[B >: K](default: ⇒ KeyBounds[B]): KeyBounds[B]
Returns non-empty bounds or the default value
Returns non-empty bounds or the default value
- Definition Classes
- Bounds
-
def
include[B >: K](key: B)(implicit b: Boundable[B]): KeyBounds[B]
Expand bounds to include the key or keep unchanged if it is already included
-
def
includes[B >: K](key: B)(implicit b: Boundable[B]): Boolean
Test if the key is included in bounds
-
def
intersect[B >: K](other: Bounds[B])(implicit b: Boundable[B]): Bounds[B]
Returns the intersection, if any, between two bounds
-
def
intersects[B >: K](other: KeyBounds[B])(implicit b: Boundable[B]): Boolean
Test if two bounds for intersection
Test if two bounds for intersection
- Definition Classes
- Bounds
-
def
isEmpty: Boolean
Returns true if this is EmptyBounds
Returns true if this is EmptyBounds
- val maxKey: K
- val minKey: K
-
def
nonEmpty: Boolean
Returns false if this is EmptyBounds
Returns false if this is EmptyBounds
- Definition Classes
- Bounds
- def rekey[B >: K](sourceLayout: LayoutDefinition, targetLayout: LayoutDefinition)(implicit arg0: SpatialComponent[B]): KeyBounds[B]
- def setSpatialBounds[B >: K](gridBounds: TileBounds)(implicit ev: SpatialComponent[B]): KeyBounds[B]
-
def
setSpatialBounds[B >: K](other: KeyBounds[SpatialKey])(implicit ev: SpatialComponent[B]): KeyBounds[B]
Updates the spatial region of bounds to match that of the argument, leaving other dimensions, if any, unchanged.
- def toOption: Option[KeyBounds[K]]