Jive reference manual
|
#include <jem/util/SparseArray.h>
Classes | |
class | Element |
Public Types | |
typedef Tuple< idx_t, N > | Index |
typedef Tuple< idx_t, N > | Shape |
typedef HashTableNode< Element > | Node |
typedef Alloc | Allocator |
typedef HashTableIterator< Element > | Iterator |
typedef HashTableIterator< Element, const Element &, const Element * > | ConstIterator |
Public Member Functions | |
SparseArray () | |
SparseArray (const T &zero) | |
SparseArray (const SparseArray &rhs) | |
~SparseArray () | |
Iterator | begin () |
ConstIterator | begin () const |
Iterator | end () |
ConstIterator | end () const |
SparseArray & | operator= (const SparseArray &rhs) |
SparseArray & | operator= (T rhs) |
void | swap (SparseArray &rhs) |
T & | operator[] (const Index &i) |
T | operator[] (const Index &i) const |
T & | operator[] (idx_t i) |
T | operator[] (idx_t i) const |
T & | operator() (idx_t i, idx_t j) |
T | operator() (idx_t i, idx_t j) const |
T & | operator() (idx_t i, idx_t j, idx_t k) |
T | operator() (idx_t i, idx_t j, idx_t k) const |
T & | operator() (idx_t i, idx_t j, idx_t k, idx_t l) |
T | operator() (idx_t i, idx_t j, idx_t k, idx_t l) const |
T & | operator() (idx_t i, idx_t j, idx_t k, idx_t l, idx_t p) |
T | operator() (idx_t i, idx_t j, idx_t k, idx_t l, idx_t p) const |
T & | operator() (idx_t i, idx_t j, idx_t k, idx_t l, idx_t p, idx_t q) |
T | operator() (idx_t i, idx_t j, idx_t k, idx_t l, idx_t p, idx_t q) const |
T * | find (const Index &i) |
const T * | find (const Index &i) const |
T * | find (idx_t i) |
const T * | find (idx_t i) const |
T * | find (idx_t i, idx_t j) |
const T * | find (idx_t i, idx_t j) const |
T * | find (idx_t i, idx_t j, idx_t k) |
const T * | find (idx_t i, idx_t j, idx_t k) const |
T * | find (idx_t i, idx_t j, idx_t k, idx_t l) |
const T * | find (idx_t i, idx_t j, idx_t k, idx_t l) const |
T * | find (idx_t i, idx_t j, idx_t k, idx_t l, idx_t p) |
const T * | find (idx_t i, idx_t j, idx_t k, idx_t l, idx_t p) const |
T * | find (idx_t i, idx_t j, idx_t k, idx_t l, idx_t p, idx_t q) |
const T * | find (idx_t i, idx_t j, idx_t k, idx_t l, idx_t p, idx_t q) const |
bool | erase (const Index &i) |
bool | erase (idx_t i) |
bool | erase (idx_t i, idx_t j) |
bool | erase (idx_t i, idx_t j, idx_t k) |
bool | erase (idx_t i, idx_t j, idx_t k, idx_t l) |
bool | erase (idx_t i, idx_t j, idx_t k, idx_t l, idx_t p) |
bool | erase (idx_t i, idx_t j, idx_t k, idx_t l, idx_t p, idx_t q) |
void | clear () |
void | reserve (idx_t cap) |
void | trimToSize () |
idx_t | capacity () const |
void | reshape () |
void | reshape (const Shape &sh) |
void | reshape (idx_t m) |
void | reshape (idx_t m, idx_t n) |
void | reshape (idx_t m, idx_t n, idx_t p) |
void | reshape (idx_t m, idx_t n, idx_t p, idx_t q) |
void | reshape (idx_t m, idx_t n, idx_t p, idx_t q, idx_t r) |
void | reshape (idx_t m, idx_t n, idx_t p, idx_t q, idx_t r, idx_t s) |
const Shape & | shape () const |
idx_t | size () const |
idx_t | size (int idim) const |
const T & | getZero () const |
void | setZero (const T &zero) |
idx_t | nonZeroCount () const |
template<class Output > | |
void | printStats (Output &out) const |
Static Public Attributes | |
static const idx_t | RANK = N |
typedef Tuple<idx_t,N> jem::util::SparseArray< T, N, Alloc >::Index |
typedef Tuple<idx_t,N> jem::util::SparseArray< T, N, Alloc >::Shape |
typedef HashTableNode<Element> jem::util::SparseArray< T, N, Alloc >::Node |
typedef Alloc jem::util::SparseArray< T, N, Alloc >::Allocator |
typedef HashTableIterator< Element > jem::util::SparseArray< T, N, Alloc >::Iterator |
typedef HashTableIterator< Element, const Element&, const Element* > jem::util::SparseArray< T, N, Alloc >::ConstIterator |
jem::util::SparseArray< T, N, Alloc >::SparseArray | ( | ) |
jem::util::SparseArray< T, N, Alloc >::SparseArray | ( | const T & | zero | ) |
jem::util::SparseArray< T, N, Alloc >::SparseArray | ( | const SparseArray< T, N, Alloc > & | rhs | ) |
jem::util::SparseArray< T, N, Alloc >::~SparseArray | ( | ) |
Iterator jem::util::SparseArray< T, N, Alloc >::begin | ( | ) |
ConstIterator jem::util::SparseArray< T, N, Alloc >::begin | ( | ) | const |
Iterator jem::util::SparseArray< T, N, Alloc >::end | ( | ) |
ConstIterator jem::util::SparseArray< T, N, Alloc >::end | ( | ) | const |
SparseArray& jem::util::SparseArray< T, N, Alloc >::operator= | ( | const SparseArray< T, N, Alloc > & | rhs | ) |
SparseArray& jem::util::SparseArray< T, N, Alloc >::operator= | ( | T | rhs | ) |
void jem::util::SparseArray< T, N, Alloc >::swap | ( | SparseArray< T, N, Alloc > & | rhs | ) |
T& jem::util::SparseArray< T, N, Alloc >::operator[] | ( | const Index & | i | ) |
T jem::util::SparseArray< T, N, Alloc >::operator[] | ( | const Index & | i | ) | const |
T& jem::util::SparseArray< T, N, Alloc >::operator[] | ( | idx_t | i | ) |
T jem::util::SparseArray< T, N, Alloc >::operator[] | ( | idx_t | i | ) | const |
T& jem::util::SparseArray< T, N, Alloc >::operator() | ( | idx_t | i, |
idx_t | j | ||
) |
T jem::util::SparseArray< T, N, Alloc >::operator() | ( | idx_t | i, |
idx_t | j | ||
) | const |
T& jem::util::SparseArray< T, N, Alloc >::operator() | ( | idx_t | i, |
idx_t | j, | ||
idx_t | k | ||
) |
T jem::util::SparseArray< T, N, Alloc >::operator() | ( | idx_t | i, |
idx_t | j, | ||
idx_t | k | ||
) | const |
T& jem::util::SparseArray< T, N, Alloc >::operator() | ( | idx_t | i, |
idx_t | j, | ||
idx_t | k, | ||
idx_t | l | ||
) |
T jem::util::SparseArray< T, N, Alloc >::operator() | ( | idx_t | i, |
idx_t | j, | ||
idx_t | k, | ||
idx_t | l | ||
) | const |
T& jem::util::SparseArray< T, N, Alloc >::operator() | ( | idx_t | i, |
idx_t | j, | ||
idx_t | k, | ||
idx_t | l, | ||
idx_t | p | ||
) |
T jem::util::SparseArray< T, N, Alloc >::operator() | ( | idx_t | i, |
idx_t | j, | ||
idx_t | k, | ||
idx_t | l, | ||
idx_t | p | ||
) | const |
T& jem::util::SparseArray< T, N, Alloc >::operator() | ( | idx_t | i, |
idx_t | j, | ||
idx_t | k, | ||
idx_t | l, | ||
idx_t | p, | ||
idx_t | q | ||
) |
T jem::util::SparseArray< T, N, Alloc >::operator() | ( | idx_t | i, |
idx_t | j, | ||
idx_t | k, | ||
idx_t | l, | ||
idx_t | p, | ||
idx_t | q | ||
) | const |
T* jem::util::SparseArray< T, N, Alloc >::find | ( | const Index & | i | ) |
const T* jem::util::SparseArray< T, N, Alloc >::find | ( | const Index & | i | ) | const |
T* jem::util::SparseArray< T, N, Alloc >::find | ( | idx_t | i | ) |
const T* jem::util::SparseArray< T, N, Alloc >::find | ( | idx_t | i | ) | const |
T* jem::util::SparseArray< T, N, Alloc >::find | ( | idx_t | i, |
idx_t | j | ||
) |
const T* jem::util::SparseArray< T, N, Alloc >::find | ( | idx_t | i, |
idx_t | j | ||
) | const |
T* jem::util::SparseArray< T, N, Alloc >::find | ( | idx_t | i, |
idx_t | j, | ||
idx_t | k | ||
) |
const T* jem::util::SparseArray< T, N, Alloc >::find | ( | idx_t | i, |
idx_t | j, | ||
idx_t | k | ||
) | const |
T* jem::util::SparseArray< T, N, Alloc >::find | ( | idx_t | i, |
idx_t | j, | ||
idx_t | k, | ||
idx_t | l | ||
) |
const T* jem::util::SparseArray< T, N, Alloc >::find | ( | idx_t | i, |
idx_t | j, | ||
idx_t | k, | ||
idx_t | l | ||
) | const |
T* jem::util::SparseArray< T, N, Alloc >::find | ( | idx_t | i, |
idx_t | j, | ||
idx_t | k, | ||
idx_t | l, | ||
idx_t | p | ||
) |
const T* jem::util::SparseArray< T, N, Alloc >::find | ( | idx_t | i, |
idx_t | j, | ||
idx_t | k, | ||
idx_t | l, | ||
idx_t | p | ||
) | const |
T* jem::util::SparseArray< T, N, Alloc >::find | ( | idx_t | i, |
idx_t | j, | ||
idx_t | k, | ||
idx_t | l, | ||
idx_t | p, | ||
idx_t | q | ||
) |
const T* jem::util::SparseArray< T, N, Alloc >::find | ( | idx_t | i, |
idx_t | j, | ||
idx_t | k, | ||
idx_t | l, | ||
idx_t | p, | ||
idx_t | q | ||
) | const |
bool jem::util::SparseArray< T, N, Alloc >::erase | ( | const Index & | i | ) |
bool jem::util::SparseArray< T, N, Alloc >::erase | ( | idx_t | i | ) |
bool jem::util::SparseArray< T, N, Alloc >::erase | ( | idx_t | i, |
idx_t | j | ||
) |
bool jem::util::SparseArray< T, N, Alloc >::erase | ( | idx_t | i, |
idx_t | j, | ||
idx_t | k | ||
) |
bool jem::util::SparseArray< T, N, Alloc >::erase | ( | idx_t | i, |
idx_t | j, | ||
idx_t | k, | ||
idx_t | l | ||
) |
bool jem::util::SparseArray< T, N, Alloc >::erase | ( | idx_t | i, |
idx_t | j, | ||
idx_t | k, | ||
idx_t | l, | ||
idx_t | p | ||
) |
bool jem::util::SparseArray< T, N, Alloc >::erase | ( | idx_t | i, |
idx_t | j, | ||
idx_t | k, | ||
idx_t | l, | ||
idx_t | p, | ||
idx_t | q | ||
) |
void jem::util::SparseArray< T, N, Alloc >::clear | ( | ) |
void jem::util::SparseArray< T, N, Alloc >::reserve | ( | idx_t | cap | ) |
void jem::util::SparseArray< T, N, Alloc >::trimToSize | ( | ) |
idx_t jem::util::SparseArray< T, N, Alloc >::capacity | ( | ) | const |
void jem::util::SparseArray< T, N, Alloc >::reshape | ( | ) |
void jem::util::SparseArray< T, N, Alloc >::reshape | ( | const Shape & | sh | ) |
void jem::util::SparseArray< T, N, Alloc >::reshape | ( | idx_t | m | ) |
void jem::util::SparseArray< T, N, Alloc >::reshape | ( | idx_t | m, |
idx_t | n | ||
) |
void jem::util::SparseArray< T, N, Alloc >::reshape | ( | idx_t | m, |
idx_t | n, | ||
idx_t | p | ||
) |
void jem::util::SparseArray< T, N, Alloc >::reshape | ( | idx_t | m, |
idx_t | n, | ||
idx_t | p, | ||
idx_t | q | ||
) |
void jem::util::SparseArray< T, N, Alloc >::reshape | ( | idx_t | m, |
idx_t | n, | ||
idx_t | p, | ||
idx_t | q, | ||
idx_t | r | ||
) |
void jem::util::SparseArray< T, N, Alloc >::reshape | ( | idx_t | m, |
idx_t | n, | ||
idx_t | p, | ||
idx_t | q, | ||
idx_t | r, | ||
idx_t | s | ||
) |
const Shape& jem::util::SparseArray< T, N, Alloc >::shape | ( | ) | const |
idx_t jem::util::SparseArray< T, N, Alloc >::size | ( | ) | const |
idx_t jem::util::SparseArray< T, N, Alloc >::size | ( | int | idim | ) | const |
const T& jem::util::SparseArray< T, N, Alloc >::getZero | ( | ) | const |
void jem::util::SparseArray< T, N, Alloc >::setZero | ( | const T & | zero | ) |
idx_t jem::util::SparseArray< T, N, Alloc >::nonZeroCount | ( | ) | const |
void jem::util::SparseArray< T, N, Alloc >::printStats | ( | Output & | out | ) | const |
|
static |