147       indices.reserve(capacity * getRank());  in SparseTensorCOO()
156     uint64_t rank = getRank();  in add()
182     uint64_t rank = getRank();  in sort()
195   uint64_t getRank() const { return dimSizes.size(); }  in getRank()  function
268       : dimSizes(dimSizes), rev(getRank()),  in SparseTensorStorageBase()
269         dimTypes(sparsity, sparsity + getRank()) {  in SparseTensorStorageBase()
271     const uint64_t rank = getRank();  in SparseTensorStorageBase()
288   uint64_t getRank() const { return dimSizes.size(); }  in getRank()  function in __anon2f09016c0111::SparseTensorStorageBase
295     assert(d < getRank());  in getDimSize()
308     assert(d < getRank());  in isCompressedDim()
396       : SparseTensorStorageBase(dimSizes, perm, sparsity), pointers(getRank()),  in SparseTensorStorage()
397         indices(getRank()), idx(getRank()) {}  in SparseTensorStorage()
416     for (uint64_t r = 0, rank = getRank(); r < rank; r++) {  in SparseTensorStorage()
459     assert(d < getRank());  in getPointers()
463     assert(d < getRank());  in getIndices()
492     const uint64_t lastDim = getRank() - 1;  in expInsert()
530     newEnumerator(&enumerator, getRank(), perm);  in toCOO()
623       if (d + 1 == getRank())  in appendIndex()
670     uint64_t rank = getRank();  in fromCOO()
711       if (d + 1 == getRank())  in finalizeSegment()
720     uint64_t rank = getRank();  in endPath()
730     uint64_t rank = getRank();  in insPath()
743     for (uint64_t r = 0, rank = getRank(); r < rank; r++)  in lexDiff()
794       : src(tensor), permsz(src.getRev().size()), reord(getRank()),  in SparseTensorEnumeratorBase()
795         cursor(getRank()) {  in SparseTensorEnumeratorBase()
797     assert(rank == getRank() && "Permutation rank mismatch");  in SparseTensorEnumeratorBase()
819   uint64_t getRank() const { return permsz.size(); }  in getRank()  function in __anon2f09016c0111::SparseTensorEnumeratorBase
864     if (d == Base::getRank()) {  in forallElements()
914       : dimSizes(dimSizes), dimTypes(sparsity), nnz(getRank()) {  in SparseTensorNNZ()
919     for (uint64_t rank = getRank(), r = 0; r < rank; r++) {  in SparseTensorNNZ()
947   uint64_t getRank() const { return dimSizes.size(); }  in getRank()  function in __anon2f09016c0111::SparseTensorNNZ
954     assert(enumerator.getRank() == getRank() && "Tensor rank mismatch");  in initialize()
968     assert(stopDim < getRank() && "Stopping-dimension is out of bounds");  in forallIndices()
982     for (uint64_t rank = getRank(), r = 0; r < rank; r++) {  in add()
1016   tensor.newEnumerator(&enumerator, getRank(), perm);  in SparseTensorStorage()
1023     for (uint64_t rank = getRank(), r = 0; r < rank; r++) {  in SparseTensorStorage()
1054     for (uint64_t rank = getRank(), r = 0; r < rank; r++) {  in SparseTensorStorage()
1080   for (uint64_t parentSz = 1, rank = getRank(), r = 0; r < rank; r++) {  in SparseTensorStorage()
1193   uint64_t getRank() const {  in getRank()  function in __anon2f09016c0111::SparseTensorFile
1212     assert(d < getRank());  in getDimSize()
1219     assert(rank == getRank() && "Rank mismatch");  in assertMatchesShape()
1405   uint64_t rank = coo->getRank();  in outSparseTensor()
1470   uint64_t rank = sparseTensor->getRank();  in fromMLIRSparseTensor()
1844   const uint64_t rank = stfile.getRank();  in readSparseTensorShape()