85     enum { WidthFactor = 8 };  enumerator
142     RopePiece Pieces[2*WidthFactor];
158     bool isFull() const { return NumPieces == 2*WidthFactor; }  in isFull()
313   std::copy(&Pieces[WidthFactor], &Pieces[2*WidthFactor],  in insert()
316   std::fill(&Pieces[WidthFactor], &Pieces[2*WidthFactor], RopePiece());  in insert()
319   NewNode->NumPieces = NumPieces = WidthFactor;  in insert()
401     RopePieceBTreeNode *Children[2*WidthFactor];
419     bool isFull() const { return NumChildren == 2*WidthFactor; }  in isFull()
552   memcpy(&NewNode->Children[0], &Children[WidthFactor],  in HandleChildPiece()
553          WidthFactor*sizeof(Children[0]));  in HandleChildPiece()
556   NewNode->NumChildren = NumChildren = WidthFactor;  in HandleChildPiece()
560   if (i < WidthFactor)  in HandleChildPiece()
563     NewNode->HandleChildPiece(i-WidthFactor, RHS);  in HandleChildPiece()