Lines Matching refs:Capacity
195 enum { Capacity = N };
359 /// Elements + Grow <= Nodes * Capacity.
364 /// NewSize[i] <= Capacity.
372 /// Grow is set and NewSize[idx] == Capacity-1. The index points to the node
378 /// @param Capacity The capacity of each node.
384 IdxPair distribute(unsigned Nodes, unsigned Elements, unsigned Capacity,
484 assert(n <= NodeT::Capacity && "Size too big for node");
600 /// @return (insert position, new size), or (i, Capacity+1) on overflow.
1074 if (branched() || rootSize == RootLeaf::Capacity)
1150 const unsigned Nodes = RootLeaf::Capacity / Leaf::Capacity + 1;
1160 NewOffset = distribute(Nodes, rootSize, Leaf::Capacity, NULL, size,
1191 const unsigned Nodes = RootBranch::Capacity / Branch::Capacity + 1;
1201 NewOffset = distribute(Nodes, rootSize, Leaf::Capacity, NULL, Size,
1723 if (IM.rootSize < RootBranch::Capacity) {
1743 if (P.size(Level) == Branch::Capacity) {
1770 if (Size <= RootLeaf::Capacity) {
1832 if (Size > Leaf::Capacity) {
1836 assert(Size <= Leaf::Capacity && "overflow() didn't make room");
1974 if (Elements + 1 > Nodes * NodeT::Capacity) {
1986 IdxPair NewOffset = distribute(Nodes, Elements, NodeT::Capacity,