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

/freebsd-13-stable/contrib/llvm-project/clang/lib/Rewrite/
H A DRewriteRope.cpp53 /// 'WidthFactor' children/values. For our use cases, this doesn't seem to
59 /// RopePieceBTreeLeaf - Directly manages up to '2*WidthFactor' RopePiece
63 /// up to '2*WidthFactor' other nodes in the tree.
79 /// WidthFactor - This controls the number of K/V slots held in the BTree:
81 /// 'WidthFactor' elements in it (either ropepieces or children), (except
82 /// the root, which may have less) and may have at most 2*WidthFactor
84 enum { WidthFactor = 8 }; enumerator in enum:__anon1980::RopePieceBTreeNode::__anon1981
128 /// RopePieceBTreeLeaf - Directly manages up to '2*WidthFactor' RopePiece
141 RopePiece Pieces[2*WidthFactor];
157 bool isFull() const { return NumPieces == 2*WidthFactor; }
[all...]
H A DDeltaTree.cpp65 /// WidthFactor - This controls the number of K/V slots held in the BTree:
67 /// WidthFactor-1 K/V pairs (except the root) and may have at most
68 /// 2*WidthFactor-1 K/V pairs.
69 enum { WidthFactor = 8 }; enumerator in enum:__anon1978::DeltaTreeNode::__anon1979
72 SourceDelta Values[2*WidthFactor-1];
91 bool isFull() const { return NumValuesUsed == 2*WidthFactor-1; }
126 DeltaTreeNode *Children[2*WidthFactor];
295 /// DoSplit - Split the currently full node (which has 2*WidthFactor-1 values)
296 /// into two subtrees each with "WidthFactor-1" values and a pivot value.
301 // Since this node is full, it contains 2*WidthFactor
[all...]

Completed in 65 milliseconds