Searched refs:safeFind (Results 1 - 1 of 1) sorted by relevance

/external/llvm/include/llvm/ADT/
H A DIntervalMap.h583 /// safeFind - Find an interval that is known to exist. This is the same as
590 unsigned safeFind(unsigned i, KeyT x) const { function in class:llvm::IntervalMapImpl::LeafNode
605 unsigned i = safeFind(0, x);
719 /// safeFind - Find a subtree that is known to exist. This is the same as
725 unsigned safeFind(unsigned i, KeyT x) const {
738 return subtree(safeFind(0, x));
1459 unsigned p = NR.get<Branch>().safeFind(0, x);
1463 path.push(NR, NR.get<Leaf>().safeFind(0, x));
1483 path.leafOffset() = path.leaf<Leaf>().safeFind(path.leafOffset(), x);
1496 path.node<Branch>(l + 1).safeFind(pat
[all...]

Completed in 135 milliseconds