Sparse Int Matrix
A sparse matrix for storing integers. It works just like SparseMatrix but optimizes int storage. This particular interface only provides read access. The matrix needs to be initialized appropriately or used on a class that is actually mutable.
Inheritors
Types
Functions
Get all elements in the matrix as sequence.
Determine whether the content of this matrix is the same as the other by checking equality on the cell values. Sparse matrices with different dimensions, but the same valid indices can be equal.
Creates a copy of the matrix of an appropriate type with the same content.
Perform the action for each index in the (sparse) matrix. This skips sparse indices.
This function can be used to determine whether the given coordinates are valid. Returns true if valid. This function works on any value for the coordinates and should return false
for all values out of range (x<0 || x>=[maxWidth]
), (y<0 || y>=[maxHeight]
).
A map implementation that creates a boolean sparse matrix based upon the receiver and the transformation function.
Create a new SparseIntMatrix with the dimensions of the original where the value of each cell is the result of applying the transform to the value of the cell in the original.