#include <et-forward.h>
|
| typedef FastTM2IteratorBase< P_numtype, N_rows, N_columns, const TinyMatrix< P_numtype, N_rows, N_columns > > | T_base |
| |
| typedef T_base::T_numtype | T_numtype |
| |
| typedef T_base::T_matrix | T_matrix |
| |
| typedef T_base::T_iterator | T_iterator |
| |
| typedef T_base::T_ctorArg1 | T_ctorArg1 |
| |
| typedef T_base::T_ctorArg2 | T_ctorArg2 |
| |
| typedef T_base::T_range_result | T_range_result |
| |
| typedef P_numtype | T_numtype |
| |
| typedef opType< T_numtype >::T_optype | T_optype |
| |
| typedef asET< T_numtype >::T_wrapped | T_typeprop |
| |
| typedef unwrapET< T_typeprop >::T_unwrapped | T_result |
| |
| typedef ETBase< FastTV2Iterator< T_numtype, simdTypes< T_numtype >::vecWidth > > | T_tvtypeprop |
| | Result type for fastRead_tv is a FastTVIterator. More...
|
| |
| typedef unwrapET< T_tvtypeprop >::T_unwrapped | T_tvresult |
| |
| typedef TinyMatrix< T_numtype, N_rows, N_columns > | T_matrix |
| |
| typedef FastTM2IteratorBase< P_numtype, N_rows, N_columns, const TinyMatrix< P_numtype, N_rows, N_columns > > | T_iterator |
| |
| typedef const T_matrix & | T_ctorArg1 |
| |
| typedef int | T_ctorArg2 |
| |
| typedef FastTM2CopyIterator< P_numtype, N_rows, N_columns > | T_range_result |
| |
|
| | FastTM2CopyIterator (const FastTM2CopyIterator &x) |
| |
| | FastTM2CopyIterator (const T_matrix &array) |
| |
| void | operator= (const FastTM2CopyIterator &x) |
| |
| | FastTM2IteratorBase (const T_iterator &x) |
| |
| | FastTM2IteratorBase (const T_matrix &array) |
| |
| void | operator= (const T_iterator &x) |
| |
| | ~FastTM2IteratorBase () |
| |
| T_result | operator() (TinyVector< int, 2 > i) const |
| |
| T_result | first_value () const |
| |
| T_result | operator* () const |
| |
| T_result | operator[] (int i) const |
| |
| T_result | fastRead (diffType i) const |
| |
| tvresult< N >::Type | fastRead_tv (diffType i) const |
| |
| bool | isVectorAligned (diffType offset) const |
| | Since data_ is simd aligned by construction, we just have to check the offest. More...
|
| |
| void | push (int position) |
| |
| void | pop (int position) |
| |
| void | advance () |
| |
| void | advance (int n) |
| |
| void | loadStride (int rank) |
| |
| const T_numtype *restrict | data () const |
| |
| const T_matrix & | array () const |
| |
| void | _bz_setData (const T_numtype *ptr) |
| |
| void | _bz_offsetData (sizeType i) |
| |
| void | _bz_offsetData (sizeType offset, int dim) |
| |
| void | _bz_offsetData (sizeType offset1, int dim1, sizeType offset2, int dim2) |
| |
| int | stride () const |
| |
| bool | isUnitStride () const |
| |
| void | advanceUnitStride () |
| |
| bool | canCollapse (int outerLoopRank, int innerLoopRank) const |
| |
| bool | shapeCheck (const T_shape &s) const |
| |
| T_result | shift (int offset, int dim) const |
| |
| T_result | shift (int offset1, int dim1, int offset2, int dim2) const |
| |
| void | prettyPrint (std::string &str, prettyPrintFormat &format) const |
| |
template<typename P_numtype , int N_rows, int N_columns>
template<typename P_numtype , int N_rows, int N_columns>
template<typename P_numtype , int N_rows, int N_columns>
template<typename P_numtype , int N_rows, int N_columns>
template<typename P_numtype , int N_rows, int N_columns>
template<typename P_numtype , int N_rows, int N_columns>
template<typename P_numtype , int N_rows, int N_columns>
template<typename P_numtype , int N_rows, int N_columns>
template<typename P_numtype , int N_rows, int N_columns>
template<typename P_numtype , int N_rows, int N_columns>
The documentation for this class was generated from the following files: