Lines Matching defs:curr
110 struct rbt_string_node *curr = t->rbt_root;
113 while (curr != t->rbt_nil)
115 trail = curr;
116 int cmp = strcmp (str, curr->str);
118 curr = curr->left;
120 curr = curr->right;
146 curr = fresh;
147 while (curr->par->color == RBT_RED)
148 if (curr->par == curr->par->par->left)
150 struct rbt_string_node *uncle = curr->par->par->right;
153 curr->par->color = RBT_BLACK;
155 curr->par->par->color = RBT_RED;
156 curr = curr->par->par;
158 else if (curr == curr->par->right)
160 curr = curr->par;
161 rbt_left_rotate (t, curr);
165 curr->par->color = RBT_BLACK;
166 curr->par->par->color = RBT_RED;
167 rbt_right_rotate (t, curr->par->par);
170 else /* curr->par == curr->par->par->right */
174 struct rbt_string_node *aunt = curr->par->par->left;
177 curr->par->color = RBT_BLACK;
179 curr->par->par->color = RBT_RED;
180 curr = curr->par->par;
182 else if (curr == curr->par->left)
184 curr = curr->par;
185 rbt_right_rotate (t, curr);
189 curr->par->color = RBT_BLACK;
190 curr->par->par->color = RBT_RED;
191 rbt_left_rotate (t, curr->par->par);
203 struct rbt_string_node *curr = t->rbt_root;
205 while (curr != t->rbt_nil)
207 int cmp = strcmp (str, curr->str);
209 curr = curr->left;
211 curr = curr->right;