Lines Matching full:dummy
223 // Create a dummy node. The use of the dummy node is a bit
224 // counter-intuitive: The right child of the dummy node will hold
225 // the L tree of the algorithm. The left child of the dummy node
226 // will hold the R tree of the algorithm. Using a dummy node, left
228 Node* dummy = &dummy_node;
229 Node* left = dummy;
230 Node* right = dummy;
273 current->left_ = dummy->right_;
274 current->right_ = dummy->left_;
