Lines Matching +defs:left +defs:right
163 // Because the intervals are sorted by left endpoint, inorder
166 // See whether we need to traverse the left subtree.
167 IntervalNode* left = node->left();
168 if (left
171 && !(left->data().maxHigh() < adapter.lowValue()))
172 searchForOverlapsFrom<AdapterType>(left, adapter);
177 // See whether we need to traverse the right subtree.
181 searchForOverlapsFrom<AdapterType>(node->right(), adapter);
189 IntervalNode* left = node->left();
190 if (left) {
191 if (*curMax < left->data().maxHigh())
192 curMax = &left->data().maxHigh();
194 IntervalNode* right = node->right();
195 if (right) {
196 if (*curMax < right->data().maxHigh())
197 curMax = &right->data().maxHigh();
213 IntervalNode* left = node->left();
214 IntervalNode* right = node->right();
215 if (left) {
216 if (!checkInvariantsFromNode(left, &leftMaxValue))
219 if (right) {
220 if (!checkInvariantsFromNode(right, &rightMaxValue))
223 if (!left && !right) {
230 if (!left || !right) {
231 if (left)