void insert_case2(struct rbtree* t, struct rbtree_node* n) { if (node_color(n->parent) == BLACK) return; else insert_case3(t, n); }
/* when n is no root */ void insert_case2(bbst tree, node n){ if (node_color(n->parent) == BLACK) return; else /* here n always have grandfather cuz he's RED */ insert_case3(tree, n); }
void insert_case2(leaf* n) { if (n->parent->color == col::black) return; else insert_case3(n); }
static inline void insert_case2(struct RBTREE_TYPENAME* target, struct RBTREE_NODE* node) { DEBUG_RBTREE("insert_case2\n"); if (node->parent->color == BLACK) return; else insert_case3(target, node); DEBUG_RBTREE("insert_case2 done.\n"); }
/* * === FUNCTION ====================================================================== * Name: insert_case2 * Description: Covers the case that the parent's color is BLACK * ===================================================================================== */ static void insert_case2 ( set * n ) { if(n->parent->color == BLACK) { return; } else { insert_case3(n); } } /* ----- end of static function insert_case2 ----- */
static void insert_case2(L_RBTREE *t, node *n) { if (node_color(n->parent) == L_BLACK_NODE) return; /* Tree is still valid */ else insert_case3(t, n); }
void insert_case2(rbtree t, node n) { if (node_color(n->parent) == BLACK) return; /* Tree is still valid */ else insert_case3(t, n); }
void insert_case2(GtkWidget *darea, rbtree t, node n) { if (node_color(n->parent) == BLACK) return; else insert_case3(darea, t, n); }
void insert_case2(rb_node* n, rb_tree* tree) { if (n->parent->color == BLACK) return; /* Tree is still valid */ else insert_case3(n, tree); }