#include <genesis/placement/function/emd.hpp>
template<typename T>
class genesis::utils::Matrix< T >
Definition at line 53 of file placement/function/emd.hpp.
|
| | Matrix () |
| |
| | Matrix (Matrix &&)=default |
| |
| | Matrix (Matrix const &)=default |
| |
| | Matrix (size_t rows, size_t cols) |
| |
| | Matrix (size_t rows, size_t cols, std::initializer_list< T > const &init_list) |
| |
| | Matrix (size_t rows, size_t cols, std::vector< T > &&data) |
| |
| | Matrix (size_t rows, size_t cols, std::vector< T > const &data) |
| |
| | Matrix (size_t rows, size_t cols, T init) |
| |
| | ~Matrix ()=default |
| |
| T & | at (const size_t row, const size_t col) |
| |
| T const & | at (const size_t row, const size_t col) const |
| |
| iterator | begin () |
| |
| const_iterator | begin () const |
| |
| const_iterator | cbegin () const |
| |
| const_iterator | cend () const |
| |
| MatrixCol< self_type, value_type > | col (size_t col) |
| |
| MatrixCol< const self_type, const value_type > | col (size_t col) const |
| |
| size_t | cols () const |
| |
| container_type const & | data () const |
| |
| bool | empty () const |
| |
| iterator | end () |
| |
| const_iterator | end () const |
| |
| bool | operator!= (Matrix< T > const &other) const |
| |
| T & | operator() (const size_t row, const size_t col) |
| |
| T const & | operator() (const size_t row, const size_t col) const |
| |
| Matrix & | operator= (Matrix &&)=default |
| |
| Matrix & | operator= (Matrix const &)=default |
| |
| bool | operator== (Matrix< T > const &other) const |
| |
| MatrixRow< self_type, value_type > | row (size_t row) |
| |
| MatrixRow< const self_type, const value_type > | row (size_t row) const |
| |
| size_t | rows () const |
| |
| size_t | size () const |
| |
| void | swap (Matrix &other) |
| |
◆ Matrix() [1/8]
◆ Matrix() [2/8]
| Matrix |
( |
size_t |
rows, |
|
|
size_t |
cols |
|
) |
| |
|
inline |
◆ Matrix() [3/8]
| Matrix |
( |
size_t |
rows, |
|
|
size_t |
cols, |
|
|
T |
init |
|
) |
| |
|
inline |
◆ Matrix() [4/8]
| Matrix |
( |
size_t |
rows, |
|
|
size_t |
cols, |
|
|
std::vector< T > const & |
data |
|
) |
| |
|
inline |
◆ Matrix() [5/8]
| Matrix |
( |
size_t |
rows, |
|
|
size_t |
cols, |
|
|
std::vector< T > && |
data |
|
) |
| |
|
inline |
◆ Matrix() [6/8]
| Matrix |
( |
size_t |
rows, |
|
|
size_t |
cols, |
|
|
std::initializer_list< T > const & |
init_list |
|
) |
| |
|
inline |
◆ ~Matrix()
◆ Matrix() [7/8]
◆ Matrix() [8/8]
◆ at() [1/2]
| T& at |
( |
const size_t |
row, |
|
|
const size_t |
col |
|
) |
| |
|
inline |
◆ at() [2/2]
| T const& at |
( |
const size_t |
row, |
|
|
const size_t |
col |
|
) |
| const |
|
inline |
◆ begin() [1/2]
◆ begin() [2/2]
◆ cbegin()
◆ cend()
◆ col() [1/2]
◆ col() [2/2]
◆ cols()
◆ data()
◆ empty()
◆ end() [1/2]
◆ end() [2/2]
◆ operator!=()
| bool operator!= |
( |
Matrix< T > const & |
other | ) |
const |
|
inline |
◆ operator()() [1/2]
| T& operator() |
( |
const size_t |
row, |
|
|
const size_t |
col |
|
) |
| |
|
inline |
◆ operator()() [2/2]
| T const& operator() |
( |
const size_t |
row, |
|
|
const size_t |
col |
|
) |
| const |
|
inline |
◆ operator=() [1/2]
◆ operator=() [2/2]
◆ operator==()
| bool operator== |
( |
Matrix< T > const & |
other | ) |
const |
|
inline |
◆ row() [1/2]
◆ row() [2/2]
◆ rows()
◆ size()
◆ swap()
| void swap |
( |
Matrix< T > & |
other | ) |
|
|
inline |
◆ swap
◆ transpose_inplace
| void transpose_inplace |
( |
Matrix< T > & |
| ) |
|
|
friend |
Transpose a Matrix inplace, without allocating a new Matrix.
Only needs additional storage for 1 bit per element of the matrix, compared to the full reallocation of the transpose() function. It is however somewhat slower (4-5x more time in our debug build).
Definition at line 146 of file utils/containers/matrix/operators.hpp.
◆ const_iterator
◆ container_type
◆ iterator
| using iterator = typename container_type::iterator |
◆ self_type
◆ value_type
The documentation for this class was generated from the following files:
1.8.17