Lines Matching refs:left
4 * cpp macro implementation of left-leaning 2-3 red-black trees. Parent
491 a_type *left = pathp[1].node; \
492 rbtn_left_set(a_type, a_field, cnode, left); \
493 if (rbtn_red_get(a_type, a_field, left)) { \
494 a_type *leftleft = rbtn_left_get(a_type, a_field, left);\
510 a_type *left = rbtn_left_get(a_type, a_field, cnode); \
511 if (left != NULL && rbtn_red_get(a_type, a_field, \
512 left)) { \
514 rbtn_black_set(a_type, a_field, left); \
518 /* Lean left. */ \
598 a_type *left = rbtn_left_get(a_type, a_field, node); \
599 if (left != NULL) { \
600 /* node has no successor, but it has a left child. */\
601 /* Splice node out, without losing the left child. */\
603 assert(rbtn_red_get(a_type, a_field, left)); \
604 rbtn_black_set(a_type, a_field, left); \
606 rbtree->rbt_root = left; \
610 left); \
613 left); \
732 a_type *left; \
735 left = rbtn_left_get(a_type, a_field, pathp->node); \
736 if (rbtn_red_get(a_type, a_field, left)) { \
739 left); \
791 a_type *leftleft = rbtn_left_get(a_type, a_field, left);\
802 rbtn_red_set(a_type, a_field, left); \
824 rbtn_red_set(a_type, a_field, left); \
830 a_type *leftleft = rbtn_left_get(a_type, a_field, left);\
866 rbtn_red_set(a_type, a_field, left); \