reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
1319 path.setRoot(&map->rootBranch(), map->rootSize, Offset); 1321 path.setRoot(&map->rootLeaf(), map->rootSize, Offset); 1331 return branched() ? path.leaf<Leaf>().start(path.leafOffset()) : 1331 return branched() ? path.leaf<Leaf>().start(path.leafOffset()) : 1332 path.leaf<RootLeaf>().start(path.leafOffset()); 1332 path.leaf<RootLeaf>().start(path.leafOffset()); 1338 return branched() ? path.leaf<Leaf>().stop(path.leafOffset()) : 1338 return branched() ? path.leaf<Leaf>().stop(path.leafOffset()) : 1339 path.leaf<RootLeaf>().stop(path.leafOffset()); 1339 path.leaf<RootLeaf>().stop(path.leafOffset()); 1345 return branched() ? path.leaf<Leaf>().value(path.leafOffset()) : 1345 return branched() ? path.leaf<Leaf>().value(path.leafOffset()) : 1346 path.leaf<RootLeaf>().value(path.leafOffset()); 1346 path.leaf<RootLeaf>().value(path.leafOffset()); 1358 bool valid() const { return path.valid(); } 1361 bool atBegin() const { return path.atBegin(); } 1378 if (path.leafOffset() != RHS.path.leafOffset()) 1378 if (path.leafOffset() != RHS.path.leafOffset()) 1380 return &path.template leaf<Leaf>() == &RHS.path.template leaf<Leaf>(); 1380 return &path.template leaf<Leaf>() == &RHS.path.template leaf<Leaf>(); 1391 path.fillLeft(map->height); 1402 if (++path.leafOffset() == path.leafSize() && branched()) 1402 if (++path.leafOffset() == path.leafSize() && branched()) 1403 path.moveRight(map->height); 1416 if (path.leafOffset() && (valid() || !branched())) 1417 --path.leafOffset(); 1419 path.moveLeft(map->height); 1448 path.leafOffset() = 1449 map->rootLeaf().findFrom(path.leafOffset(), map->rootSize, x); 1458 IntervalMapImpl::NodeRef NR = path.subtree(path.height()); 1458 IntervalMapImpl::NodeRef NR = path.subtree(path.height()); 1459 for (unsigned i = map->height - path.height() - 1; i; --i) { 1461 path.push(NR, p); 1464 path.push(NR, NR.get<Leaf>().safeFind(0, x)); 1483 if (!Traits::stopLess(path.leaf<Leaf>().stop(path.leafSize() - 1), x)) { 1483 if (!Traits::stopLess(path.leaf<Leaf>().stop(path.leafSize() - 1), x)) { 1484 path.leafOffset() = path.leaf<Leaf>().safeFind(path.leafOffset(), x); 1484 path.leafOffset() = path.leaf<Leaf>().safeFind(path.leafOffset(), x); 1484 path.leafOffset() = path.leaf<Leaf>().safeFind(path.leafOffset(), x); 1489 path.pop(); 1492 if (path.height()) { 1493 for (unsigned l = path.height() - 1; l; --l) { 1494 if (!Traits::stopLess(path.node<Branch>(l).stop(path.offset(l)), x)) { 1494 if (!Traits::stopLess(path.node<Branch>(l).stop(path.offset(l)), x)) { 1496 path.offset(l + 1) = 1497 path.node<Branch>(l + 1).safeFind(path.offset(l + 1), x); 1497 path.node<Branch>(l + 1).safeFind(path.offset(l + 1), x); 1500 path.pop(); 1503 if (!Traits::stopLess(map->rootBranch().stop(path.offset(0)), x)) { 1504 path.offset(1) = path.node<Branch>(1).safeFind(path.offset(1), x); 1504 path.offset(1) = path.node<Branch>(1).safeFind(path.offset(1), x); 1504 path.offset(1) = path.node<Branch>(1).safeFind(path.offset(1), x); 1510 setRoot(map->rootBranch().findFrom(path.offset(0), map->rootSize, x)); 1568 if (this->path.atLastEntry(this->path.height())) 1568 if (this->path.atLastEntry(this->path.height())) 1569 setNodeStop(this->path.height(), b); 1615 Path &P = this->path; 1643 Path &P = this->path; 1669 IntervalMapImpl::Path &P = this->path; 1740 IntervalMapImpl::Path &P = this->path; 1785 IntervalMapImpl::Path &P = this->path; 1808 Path &P = this->path; 1872 IntervalMapImpl::Path &P = this->path; 1885 IntervalMapImpl::Path &P = this->path; 1919 IntervalMapImpl::Path &P = this->path; 1967 Path &P = this->path;