reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
1055 return rootSize == 0; 1067 return !branched() ? rootLeaf().stop(rootSize - 1) : 1068 rootBranch().stop(rootSize - 1); 1083 if (branched() || rootSize == RootLeaf::Capacity) 1087 unsigned p = rootLeaf().findFrom(0, rootSize, a); 1088 rootSize = rootLeaf().insertFrom(p, rootSize, a, b, y); 1088 rootSize = rootLeaf().insertFrom(p, rootSize, a, b, y); 1179 size[0] = rootSize; 1181 NewOffset = distribute(Nodes, rootSize, Leaf::Capacity, nullptr, size, 1201 rootSize = Nodes; 1220 Size[0] = rootSize; 1222 NewOffset = distribute(Nodes, rootSize, Leaf::Capacity, nullptr, Size, 1239 rootSize = Nodes; 1253 for (unsigned i = 0; i != rootSize; ++i) 1288 rootSize = 0; 1319 path.setRoot(&map->rootBranch(), map->rootSize, Offset); 1321 path.setRoot(&map->rootLeaf(), map->rootSize, Offset); 1396 setRoot(map->rootSize); 1436 setRoot(map->rootLeaf().findFrom(0, map->rootSize, x)); 1449 map->rootLeaf().findFrom(path.leafOffset(), map->rootSize, x); 1472 setRoot(map->rootBranch().findFrom(0, map->rootSize, x)); 1510 setRoot(map->rootBranch().findFrom(path.offset(0), map->rootSize, x)); 1744 if (IM.rootSize < RootBranch::Capacity) { 1745 IM.rootBranch().insert(P.offset(0), IM.rootSize, Node, Stop); 1746 P.setSize(0, ++IM.rootSize); 1754 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); 1788 unsigned Size = IM.rootLeaf().insertFrom(P.leafOffset(), IM.rootSize, a, b, y); 1792 P.setSize(0, IM.rootSize = Size); 1798 P.replaceRoot(&IM.rootBranch(), IM.rootSize, Offset); 1876 IM.rootLeaf().erase(P.leafOffset(), IM.rootSize); 1877 P.setSize(0, --IM.rootSize); 1922 IM.rootBranch().erase(P.offset(0), IM.rootSize); 1923 P.setSize(0, --IM.rootSize);