struct Geode::Matrix2x3(T)

Overview

Matrix with 2 rows and 3 columns. Provides a rectangular array of scalars of the same type.

T is the scalar type. Indices i and j refer to the zero-based row and column index respectively. Unless noted otherwise, all operations are in row-major order.

Included Modules

Defined in:

geode/matrices/matrix2.cr

Constructors

Class Method Summary

Instance Method Summary

Macro Summary

Instance methods inherited from module Geode::CommonMatrix(T, 2, 3)

[](i : Int, j : Int) : T [], []?(i : Int, j : Int) : T | Nil []?, column(j : Int) : CommonVector(T, M) column, column?(j : Int) : CommonVector(T, M) | Nil column?, columns : Int columns, columns_at(*indices) : Tuple columns_at, each_column(& : CommonVector(T, M) -> _) each_column, each_column_with_index(offset = 0, & : CommonVector(T, M), Int32 -> _) each_column_with_index, each_indices(& : Int32, Int32 -> _) each_indices, each_row(& : CommonVector(T, N) -> _) each_row, each_row_with_index(offset = 0, & : CommonVector(T, N), Int32 -> _) each_row_with_index, each_with_indices(& : T, Int32, Int32 -> _) each_with_indices, inspect(io : IO) : Nil inspect, map(& : T -> U) : CommonMatrix forall U map, map_with_index(offset = 0, & : T, Int32 -> U) : CommonMatrix(U, M, N) forall U map_with_index, map_with_indices(& : T, Int32, Int32 -> U) : CommonMatrix(U, M, N) forall U map_with_indices, row(i : Int) : CommonVector(T, N) row, row?(i : Int) : CommonVector(T, N) | Nil row?, rows : Int rows, rows_at(*indices) : Tuple rows_at, size size, square? square?, to_columns : Array to_columns, to_rows : Array to_rows, to_s(io : IO) : Nil to_s, unsafe_fetch(i : Int, j : Int) : T unsafe_fetch, unsafe_fetch_column(j : Int) : CommonVector(T, M) unsafe_fetch_column, unsafe_fetch_row(i : Int) : CommonVector(T, N) unsafe_fetch_row, zip_map(other : CommonMatrix(U, M, N), & : T, U -> V) : CommonMatrix(V, M, N) forall U, V zip_map

Instance methods inherited from module Geode::MatrixVectors(2, 3)

&*(vector : CommonVector(U, P)) : CommonVector forall U, P &*, *(vector : CommonVector(U, P)) : CommonVector forall U, P *, column? column?, row? row?, to_vector : CommonVector to_vector

Instance methods inherited from module Geode::MatrixOperations(2, 3)

&*(scalar : Number) : CommonMatrix &*, &+(other : CommonMatrix(T, M, N)) : CommonMatrix forall T &+, &-(other : CommonMatrix(T, M, N)) : CommonMatrix forall T &-, *(scalar : Number) : CommonMatrix *, +(other : CommonMatrix(T, M, N)) : CommonMatrix forall T +, -(other : CommonMatrix(T, M, N)) : CommonMatrix forall T
- : self -, /(scalar : Number) : CommonMatrix /, //(scalar : Number) : CommonMatrix //, abs : self abs, abs2 : self abs2, ceil : self ceil, clamp(min : CommonMatrix(T, M, N), max : CommonMatrix(T, M, N)) : CommonMatrix forall T
clamp(min, max) : CommonMatrix
clamp(range : Range(CommonMatrix(T, M, N), CommonMatrix(T, M, N))) : CommonMatrix forall T
clamp(range : Range) : CommonMatrix clamp, edge(edge : CommonMatrix(T, M, N)) : self forall T
edge(edge) : self edge, floor : self floor, fraction : self fraction, lerp(other : CommonMatrix(T, M, N), t : Number) : CommonMatrix forall T lerp, round(mode : Number::RoundingMode = :ties_even) : self
round(digits : Number, base = 10, *, mode : Number::RoundingMode = :ties_even) : self round, scale(matrix : CommonMatrix(T, M, N)) : CommonMatrix forall T scale, scale!(matrix : CommonMatrix(T, M, N)) : CommonMatrix forall T scale!, sign : self sign

Instance methods inherited from module Geode::MatrixIterators(T, 2, 3)

each_column : Iterator(CommonVector(T, M)) each_column, each_column_with_index(offset = 0) : Iterator(Tuple(CommonVector(T, M), Int32)) each_column_with_index, each_indices : Iterator(Tuple(Int32, Int32)) each_indices, each_row : Iterator(CommonVector(T, N)) each_row, each_row_with_index(offset = 0) : Iterator(Tuple(CommonVector(T, N), Int32)) each_row_with_index, each_with_indices : Iterator(Tuple(T, Int32, Int32)) each_with_indices

Instance methods inherited from module Geode::MatrixComparison(2, 3)

==(other : CommonMatrix(T, M, N)) forall T ==, compare(other : CommonMatrix(T, M, N)) : CommonMatrix(Int32, M, N) forall T compare, eq?(other : CommonMatrix(T, M, N)) : CommonMatrix(Bool, M, N) forall T eq?, ge?(other : CommonMatrix(T, M, N)) : CommonMatrix(Bool, M, N) forall T ge?, gt?(other : CommonMatrix(T, M, N)) : CommonMatrix(Bool, M, N) forall T gt?, le?(other : CommonMatrix(T, M, N)) : CommonMatrix(Bool, M, N) forall T le?, lt?(other : CommonMatrix(T, M, N)) : CommonMatrix(Bool, M, N) forall T lt?, near_zero?(tolerance) near_zero?, zero? zero?

Constructor Detail

def self.new(matrix : CommonMatrix(T, 2, 3)) #

Copies contents from another matrix.


[View source]
def self.new(&) #

Creates a new matrix by iterating through each element.

Yields the indices (i and j) for the matrix element. The block should return the value to use for the corresponding element.

Matrix2x3.new { |i, j| i * 10 + j }

[View source]
def self.new(rows : Indexable(Indexable(T))) #

Creates a new matrix from nested collections.

The size of rows must be 2. Each row of elements in rows must have a size of 3.


[View source]
def self.new(elements : Indexable(T)) #

Creates a new matrix from a flat collection of elements.

The size of elements must be equal to 2 x 3 (6). Items in elements are consumed in row-major order.


[View source]
def self.zero : self #

Creates a matrix filled with zeroes.


[View source]

Class Method Detail

def self.[](row_0 : Indexable, row_1 : Indexable) #

Constructs a matrix with existing elements.

The type of the elements is specified by the type parameter. Each value is cast to the type T.


[View source]

Instance Method Detail

def &*(other : CommonMatrix(U, 3, P)) : Matrix forall U, P #

Multiplies this matrix by another.

The other matrix's row count (M) must be equal to this matrix's column count (N). Produces a new matrix with the row count from this matrix and the column count from other. Matrices can be of any size and type as long as this condition is met.

Values will wrap instead of overflowing and raising an error.


[View source]
def &*(other : Matrix3x1) : Matrix2x1 #

Multiplies this matrix by another.

The other matrix's row count (M) must be equal to this matrix's column count (N). Produces a new matrix with the row count from this matrix and the column count from other. Matrices can be of any size and type as long as this condition is met.

Values will wrap instead of overflowing and raising an error.


[View source]
def &*(other : Matrix3x2) : Matrix2x2 #

Multiplies this matrix by another.

The other matrix's row count (M) must be equal to this matrix's column count (N). Produces a new matrix with the row count from this matrix and the column count from other. Matrices can be of any size and type as long as this condition is met.

Values will wrap instead of overflowing and raising an error.


[View source]
def &*(other : Matrix3x3) : Matrix2x3 #

Multiplies this matrix by another.

The other matrix's row count (M) must be equal to this matrix's column count (N). Produces a new matrix with the row count from this matrix and the column count from other. Matrices can be of any size and type as long as this condition is met.

Values will wrap instead of overflowing and raising an error.


[View source]
def &*(other : Matrix3x4) : Matrix2x4 #

Multiplies this matrix by another.

The other matrix's row count (M) must be equal to this matrix's column count (N). Produces a new matrix with the row count from this matrix and the column count from other. Matrices can be of any size and type as long as this condition is met.

Values will wrap instead of overflowing and raising an error.


[View source]
def *(other : CommonMatrix(U, 3, P)) : Matrix forall U, P #

Multiplies this matrix by another.

The other matrix's row count (M) must be equal to this matrix's column count (N). Produces a new matrix with the row count from this matrix and the column count from other. Matrices can be of any size and type as long as this condition is met.


[View source]
def *(other : Matrix3x1) : Matrix2x1 #

Multiplies this matrix by another.

The other matrix's row count (M) must be equal to this matrix's column count (N). Produces a new matrix with the row count from this matrix and the column count from other. Matrices can be of any size and type as long as this condition is met.


[View source]
def *(other : Matrix3x2) : Matrix2x2 #

Multiplies this matrix by another.

The other matrix's row count (M) must be equal to this matrix's column count (N). Produces a new matrix with the row count from this matrix and the column count from other. Matrices can be of any size and type as long as this condition is met.


[View source]
def *(other : Matrix3x3) : Matrix2x3 #

Multiplies this matrix by another.

The other matrix's row count (M) must be equal to this matrix's column count (N). Produces a new matrix with the row count from this matrix and the column count from other. Matrices can be of any size and type as long as this condition is met.


[View source]
def *(other : Matrix3x4) : Matrix2x4 #

Multiplies this matrix by another.

The other matrix's row count (M) must be equal to this matrix's column count (N). Produces a new matrix with the row count from this matrix and the column count from other. Matrices can be of any size and type as long as this condition is met.


[View source]
def a : T #

Retrieves the element at (0, 0)


[View source]
def b : T #

Retrieves the element at (0, 1)


[View source]
def c : T #

Retrieves the element at (0, 2)


[View source]
def d : T #

Retrieves the element at (1, 0)


[View source]
def e : T #

Retrieves the element at (1, 1)


[View source]
def f : T #

Retrieves the element at (1, 2)


[View source]
def map(& : T -> U) : Matrix2x3 forall U #

Returns a new matrix with elements mapped by the given block.


[View source]
def sub(i : Int, j : Int) : Matrix1x2(T) #

Returns a smaller matrix by removing a row and column.

The row indicated by i and the column indicated by j are removed in the resulting matrix.


[View source]
def to_slice : Slice(T) #

Returns a slice that points to the elements in this matrix.

NOTE The returned slice is only valid for the caller's scope and sub-calls. The slice points to memory on the stack, it will be invalid after the caller returns.


[View source]
def to_unsafe : Pointer(T) #

Returns a pointer to the data for this matrix.

The elements are tightly packed and ordered consecutively in memory.

NOTE The returned pointer is only valid for the caller's scope and sub-calls. The pointer refers to memory on the stack, it will be invalid after the caller returns.


[View source]
def transpose : Matrix3x2(T) #

Returns a new matrix that is transposed from this one.


[View source]
def unsafe_fetch(index : Int) #

Retrieves the scalar value of the component at the given index, without checking size boundaries.

End-users should never invoke this method directly. Instead, methods like #[] and #[]? should be used.

This method should only be directly invoked if the index is certain to be in bounds.


[View source]
def unsafe_fetch_column(j : Int) : Vector2(T) #
Description copied from module Geode::CommonMatrix(T, 2, 3)

Retrieves the column at the specified index.

Returns the elements as a vector. The vector will have a size equal to the number of rows in this matrix. This method does not perform any bounds checks. It should only be used if the indices are guaranteed to be in bounds.

matrix = Matrix[[1, 2, 3], [4, 5, 6]]
matrix.unsafe_fetch_column(1) # => (2, 5)

[View source]
def unsafe_fetch_row(i : Int) : Vector3(T) #
Description copied from module Geode::CommonMatrix(T, 2, 3)

Retrieves the row at the specified index.

Returns the elements as a vector. The vector will have a size equal to the number of columns in this matrix. This method does not perform any bounds checks. It should only be used if the indices are guaranteed to be in bounds.

matrix = Matrix[[1, 2, 3], [4, 5, 6]]
matrix.unsafe_fetch_row(1) # => (4, 5, 6)

[View source]

Macro Detail

macro [](*rows) #

Constructs a matrix with existing elements.

The type of the elements is derived from the type of each argument. The size of rows must be 2 and the size of each row must be 3.


[View source]