|
COMBINATORIAL_BLAS
1.3
|
#include <SpTuples.h>
Public Member Functions | |
| SpTuples (int64_t size, IT nRow, IT nCol) | |
| SpTuples (int64_t size, IT nRow, IT nCol, tuple< IT, IT, NT > *mytuples) | |
| SpTuples (int64_t maxnnz, IT nRow, IT nCol, vector< IT > &edges, bool removeloops=true) | |
| SpTuples (int64_t size, IT nRow, IT nCol, StackEntry< NT, pair< IT, IT > > *&multstack) | |
| SpTuples (const SpTuples< IT, NT > &rhs) | |
| SpTuples (const SpDCCols< IT, NT > &rhs) | |
| Constructor for converting SpDCCols matrix -> SpTuples. | |
| ~SpTuples () | |
| SpTuples< IT, NT > & | operator= (const SpTuples< IT, NT > &rhs) |
| IT & | rowindex (IT i) |
| IT & | colindex (IT i) |
| NT & | numvalue (IT i) |
| IT | rowindex (IT i) const |
| IT | colindex (IT i) const |
| NT | numvalue (IT i) const |
| void | SortRowBased () |
| void | SortColBased () |
| IT | RemoveLoops () |
| pair< IT, IT > | RowLimits () |
| pair< IT, IT > | ColLimits () |
| tuple< IT, IT, NT > | front () |
| tuple< IT, IT, NT > | back () |
| ofstream & | putstream (ofstream &outfile) const |
| ifstream & | getstream (ifstream &infile) |
| bool | isZero () const |
| IT | getnrow () const |
| IT | getncol () const |
| int64_t | getnnz () const |
| void | PrintInfo () |
Public Member Functions inherited from SpMat< IT, NT, SpTuples< IT, NT > > | |
| void | Create (const vector< IT > &essentials) |
| void | Create (IT size, IT nRow, IT nCol, tuple< IT, IT, NT > *mytuples) |
| SpMat< IT, NT, SpTuples< IT, NT > > | operator() (const vector< IT > &ri, const vector< IT > &ci) const |
| void | SpGEMM (SpMat< IT, NT, SpTuples< IT, NT > > &A, SpMat< IT, NT, SpTuples< IT, NT > > &B, bool isAT, bool isBT) |
| void | Split (SpMat< IT, NT, SpTuples< IT, NT > > &partA, SpMat< IT, NT, SpTuples< IT, NT > > &partB) |
| void | Merge (SpMat< IT, NT, SpTuples< IT, NT > > &partA, SpMat< IT, NT, SpTuples< IT, NT > > &partB) |
| Arr< IT, NT > | GetArrays () const |
| vector< IT > | GetEssentials () const |
| void | Transpose () |
| bool | operator== (const SpMat< IT, NT, SpTuples< IT, NT > > &rhs) const |
| ofstream & | put (ofstream &outfile) const |
| ifstream & | get (ifstream &infile) |
Friends | |
| class | SpDCCols |
| template<typename SR , typename IU , typename NU > | |
| SpTuples< IU, NU > | MergeAll (const vector< SpTuples< IU, NU > * > &ArrSpTups, IU mstar, IU nstar, bool delarrs) |
| template<typename SR , typename IU , typename NU > | |
| SpTuples< IU, NU > * | MergeAllRec (const vector< SpTuples< IU, NU > * > &ArrSpTups, IU mstar, IU nstar) |
Triplets are represented using the boost::tuple class of the Boost library Number of entries are 64-bit addressible, but each entry is only <class it>=""> addressible Therefore, size is int64_t but nrows/ncols (representing range of first two entries in tuple) is of type IT
Definition at line 37 of file SpTuples.h.
Definition at line 14 of file SpTuples.cpp.
| SpTuples< IT, NT >::SpTuples | ( | int64_t | size, |
| IT | nRow, | ||
| IT | nCol, | ||
| tuple< IT, IT, NT > * | mytuples | ||
| ) |
Definition at line 28 of file SpTuples.cpp.
| SpTuples< IT, NT >::SpTuples | ( | int64_t | maxnnz, |
| IT | nRow, | ||
| IT | nCol, | ||
| vector< IT > & | edges, | ||
| bool | removeloops = true |
||
| ) |
Generate a SpTuples object from an edge list
| [in,out] | edges,: | edge list that might contain duplicate edges. freed upon return Semantics differ depending on the object created: NT=bool: duplicates are ignored NT='countable' (such as short,int): duplicated as summed to keep count |
Definition at line 42 of file SpTuples.cpp.
| SpTuples< IT, NT >::SpTuples | ( | int64_t | size, |
| IT | nRow, | ||
| IT | nCol, | ||
| StackEntry< NT, pair< IT, IT > > *& | multstack | ||
| ) |
Generate a SpTuples object from StackEntry array, then delete that array
| [in] | multstack | {value-key pairs where keys are pair<col_ind, row_ind> sorted lexicographically} |
Definition at line 109 of file SpTuples.cpp.
Hint1: copy constructor (constructs a new object. i.e. this is NEVER called on an existing object) Hint2: Base's default constructor is called under the covers Normally Base's copy constructor should be invoked but it doesn't matter here as Base has no data members
Definition at line 141 of file SpTuples.cpp.
Constructor for converting SpDCCols matrix -> SpTuples.
Definition at line 152 of file SpTuples.cpp.
Definition at line 127 of file SpTuples.cpp.
|
inline |
Definition at line 127 of file SpTuples.h.
|
inline |
Definition at line 52 of file SpTuples.h.
|
inline |
Definition at line 56 of file SpTuples.h.
|
inline |
Definition at line 114 of file SpTuples.h.
|
inline |
Definition at line 126 of file SpTuples.h.
|
inline |
Reimplemented from SpMat< IT, NT, SpTuples< IT, NT > >.
Definition at line 141 of file SpTuples.h.
Reimplemented from SpMat< IT, NT, SpTuples< IT, NT > >.
Definition at line 142 of file SpTuples.h.
|
inline |
Reimplemented from SpMat< IT, NT, SpTuples< IT, NT > >.
Definition at line 140 of file SpTuples.h.
| ifstream & SpTuples< IT, NT >::getstream | ( | ifstream & | infile | ) |
Loads a triplet matrix from infile
Definition at line 212 of file SpTuples.cpp.
|
inline |
Reimplemented from SpMat< IT, NT, SpTuples< IT, NT > >.
Definition at line 139 of file SpTuples.h.
|
inline |
Definition at line 53 of file SpTuples.h.
|
inline |
Definition at line 57 of file SpTuples.h.
| SpTuples< IT, NT > & SpTuples< IT, NT >::operator= | ( | const SpTuples< IT, NT > & | rhs | ) |
Definition at line 182 of file SpTuples.cpp.
| void SpTuples< IT, NT >::PrintInfo | ( | ) |
Definition at line 255 of file SpTuples.cpp.
| ofstream & SpTuples< IT, NT >::putstream | ( | ofstream & | outfile | ) | const |
Output to a triplets file
Definition at line 243 of file SpTuples.cpp.
|
inline |
Definition at line 79 of file SpTuples.h.
|
inline |
Definition at line 51 of file SpTuples.h.
|
inline |
Definition at line 55 of file SpTuples.h.
|
inline |
Definition at line 102 of file SpTuples.h.
|
inline |
Definition at line 69 of file SpTuples.h.
|
inline |
Definition at line 59 of file SpTuples.h.
|
friend |
|
friend |
Definition at line 164 of file SpTuples.h.
1.8.1.1