case class GridBounds[N](colMin: N, rowMin: N, colMax: N, rowMax: N)(implicit evidence$1: Integral[N]) extends Product with Serializable
Represents grid coordinates of a subsection of a RasterExtent. These coordinates are inclusive.
- Alphabetic
- By Inheritance
- GridBounds
- Serializable
- Serializable
- Product
- Equals
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
- new GridBounds(colMin: N, rowMin: N, colMax: N, rowMax: N)(implicit arg0: Integral[N])
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
-(other: GridBounds[N]): Seq[GridBounds[N]]
Another name for the 'minus' method.
Another name for the 'minus' method.
- other
The other GridBounds
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
buffer(colBuffer: N, rowBuffer: N, clamp: Boolean = true): GridBounds[N]
Creates a new GridBounds using a buffer around this GridBounds.
Creates a new GridBounds using a buffer around this GridBounds.
- colBuffer
The amount the cols within this GridBounds should be buffered.
- rowBuffer
The amount the rows within this GridBounds should be buffered.
- clamp
Determines whether or not to clamp the GridBounds to the grid such that it no value will be under 0; defaults to true. If false, then the resulting GridBounds can contain negative values outside of the grid boundaries.
- Note
This will not buffer past 0 regardless of how much the buffer falls below it.
-
def
buffer(bufferSize: Int): GridBounds[N]
Creates a new GridBounds using a buffer around this GridBounds.
Creates a new GridBounds using a buffer around this GridBounds.
- bufferSize
The amount this GridBounds should be buffered by.
- Note
This will not buffer past 0 regardless of how much the buffer falls below it.
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
- val colMax: N
- val colMin: N
-
def
combine(other: GridBounds[N]): GridBounds[N]
Return the union of GridBounds.
-
def
contains(other: GridBounds[N]): Boolean
Empty gridbounds contain nothing, though non empty gridbounds contains iteslf
-
def
contains(col: N, row: N): Boolean
Return true if the present GridBounds contains the position pointed to by the given column and row, otherwise false.
Return true if the present GridBounds contains the position pointed to by the given column and row, otherwise false.
- col
The column
- row
The row
-
def
coordsIter: Iterator[(N, N)]
Return the coordinates covered by the present GridBounds.
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def height: N
-
def
intersection(dimensions: Dimensions[N]): Option[GridBounds[N]]
Return the intersection of the present grid and a raster of given dimensions.
Return the intersection of the present grid and a raster of given dimensions. The raster is treated as if its upper-left corner is at cell (0, 0) relative to this grid.
- dimensions
The dimensions of a raster
-
def
intersection(other: GridBounds[N]): Option[GridBounds[N]]
Return the intersection of the present GridBounds and the given GridBounds.
Return the intersection of the present GridBounds and the given GridBounds.
- other
The other GridBounds
-
def
intersects(dimensions: Dimensions[N]): Boolean
Returns true if the present grid intersects a rastser of given dimensions.
Returns true if the present grid intersects a rastser of given dimensions. The raster is treated as if its upper-left corner is at cell (0, 0) relative to this grid.
- dimensions
The dimensions of a raster
-
def
intersects(other: GridBounds[N]): Boolean
Returns true if the present GridBounds and the given one intersect (including their boundaries), otherwise returns false.
Returns true if the present GridBounds and the given one intersect (including their boundaries), otherwise returns false.
- other
The other GridBounds
- def isEmpty: Boolean
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
minus(other: GridBounds[N]): Seq[GridBounds[N]]
Returns the difference of the present GridBounds and the given one.
Returns the difference of the present GridBounds and the given one. This returns a sequence, because the difference may consist of more than one GridBounds.
- other
The other GridBounds
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
offset(colOffset: N, rowOffset: N): GridBounds[N]
Offsets this GridBounds to a new location relative to its current position
Offsets this GridBounds to a new location relative to its current position
- colOffset
The amount the cols should be shifted.
- rowOffset
The amount the rows should be shifted.
-
def
offset(boundsOffset: N): GridBounds[N]
Offsets this GridBounds to a new location relative to its current position
Offsets this GridBounds to a new location relative to its current position
- boundsOffset
The amount the GridBounds should be shifted.
- val rowMax: N
- val rowMin: N
- def size: N
-
def
split(cols: N, rows: N): Iterator[GridBounds[N]]
Split into windows, covering original CellBounds
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
- def toGridType[M](implicit arg0: Integral[M]): GridBounds[M]
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
- def width: N