Lines Matching full:smaller
30 * negative value: when i is smaller than j
48 N.smaller = N.larger = NULL;
54 if(t->smaller == NULL)
56 if(compare(i, t->smaller->key) < 0) {
57 y = t->smaller; /* rotate smaller */
58 t->smaller = y->larger;
61 if(t->smaller == NULL)
64 r->smaller = t; /* link smaller */
66 t = t->smaller;
73 t->larger = y->smaller;
74 y->smaller = t;
87 l->larger = t->smaller; /* assemble */
88 r->smaller = t->larger;
89 t->smaller = N.larger;
90 t->larger = N.smaller;
130 node->smaller = node->larger = NULL;
133 node->smaller = t->smaller;
135 t->smaller = NULL;
140 node->smaller = t;
183 x->smaller = t->smaller;
191 /* we splayed the tree to the smallest element, there is no smaller */
256 smaller/larger links */
260 x->smaller = t->smaller;
266 if(t->smaller == NULL)
269 x = Curl_splay(removenode->key, t->smaller);
