Searched refs:getEndIdx (Results 1 – 8 of 8) sorted by relevance
69 virtual unsigned getEndIdx() const = 0;138 unsigned getEndIdx() const override;182 unsigned getEndIdx() const override;
26 unsigned SuffixTreeInternalNode::getEndIdx() const { return EndIdx; } in getEndIdx() function in SuffixTreeInternalNode33 unsigned SuffixTreeLeafNode::getEndIdx() const { in getEndIdx() function in SuffixTreeLeafNode
26 return N->getEndIdx() - N->getStartIdx() + 1; in numElementsInSubstring()
900 return X.StartIdx <= Y.getEndIdx() && Y.StartIdx >= X.StartIdx; in overlap()1216 unsigned CandAEnd = CandA.getEndIdx(); in CheckLargerCands()1218 unsigned CandBEnd = CandB.getEndIdx(); in CheckLargerCands()1223 (MatchedCand->getEndIdx() < CandAEnd)) in CheckLargerCands()1237 MatchedCand->getEndIdx() < CandBEnd) in CheckLargerCands()1419 for (unsigned Idx = IRCand.getStartIdx(), Edx = IRCand.getEndIdx(); in findCandidates()
127 unsigned getEndIdx() const { return StartIdx + Len - 1; } in getEndIdx() function
797 StartIdx <= CandidatesForRepeatedSeq.back().getEndIdx()) { in findCandidates()803 << ", " << CandidatesForRepeatedSeq.back().getEndIdx() in findCandidates()1060 UnsignedVecBegin + C.getEndIdx() + 1, [](unsigned I) { in outline()1191 UnsignedVecBegin + C.getEndIdx() + 1)) in outline()
933 unsigned getEndIdx() const { return StartIdx + Len - 1; } in getEndIdx() function
2344 unsigned EndIdx = IRSC->getEndIdx(); in isCompatibleWithAlreadyOutlinedCode()2402 unsigned EndIdx = IRSC.getEndIdx(); in pruneIncompatibleRegions()2948 unsigned EndIdx = OS->Candidate->getEndIdx(); in doOutline()