Lines Matching refs:suffixArrayTemp

515     std::vector<DataType> suffixArrayTemp;  in Init()  local
517 InitBuckets(oldInfo, buckets, suffixArrayTemp); in Init()
529 len = suffixArrayTemp[suffixArray_[i]] + 1 - i; in Init()
530 Split(suffixArrayTemp, i, len, h); in Init()
541 suffixArray_[suffixArrayTemp[i]] = i; in Init()
548 void SuffixArray<DataType>::SplitForLess(std::vector<DataType> &suffixArrayTemp, in SplitForLess() argument
554 DataType x = suffixArrayTemp[suffixArray_[k] + h]; in SplitForLess()
556 if (suffixArrayTemp[suffixArray_[k + i] + h] < x) { in SplitForLess()
557 x = suffixArrayTemp[suffixArray_[k + i] + h]; in SplitForLess()
560 if (suffixArrayTemp[suffixArray_[k + i] + h] == x) { in SplitForLess()
566 suffixArrayTemp[suffixArray_[k + i]] = k + j - 1; in SplitForLess()
575 void SuffixArray<DataType>::Split(std::vector<DataType> &suffixArrayTemp, DataType start, DataType … in Split() argument
578 SplitForLess(suffixArrayTemp, start, len, h); in Split()
582 DataType x = suffixArrayTemp[suffixArray_[start + len / MULTIPLE_TWO] + h]; in Split()
586 jj = (suffixArrayTemp[suffixArray_[i] + h] < x) ? (jj + 1) : jj; in Split()
587 kk = (suffixArrayTemp[suffixArray_[i] + h] == x) ? (kk + 1) : kk; in Split()
595 if (suffixArrayTemp[suffixArray_[i] + h] < x) { in Split()
597 } else if (suffixArrayTemp[suffixArray_[i] + h] == x) { in Split()
606 if (suffixArrayTemp[suffixArray_[jj + j] + h] == x) { in Split()
614 Split(suffixArrayTemp, start, jj - start, h); in Split()
618 suffixArrayTemp[suffixArray_[jj + i]] = kk - 1; in Split()
624 Split(suffixArrayTemp, kk, start + len - kk, h); in Split()
670 std::vector<DataType> &buckets, std::vector<DataType> &suffixArrayTemp) in InitBuckets() argument
673 suffixArrayTemp.resize(oldInfo.length + 1, 0); in InitBuckets()
694 suffixArrayTemp[i] = buckets[oldInfo.buffer[i]]; in InitBuckets()
696 suffixArrayTemp[oldInfo.length] = 0; in InitBuckets()