Lines Matching refs: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;
118 node->smaller = t->smaller;
121 t->smaller = node; /* in the sub node for this same key, we use the
122 smaller pointer to point back to the master
133 node->smaller = node->larger = NULL;
136 node->smaller = t->smaller;
138 t->smaller = NULL;
143 node->smaller = t;
167 /* too big node, try the smaller chain */
168 if(t->smaller)
169 t=Curl_splay(t->smaller->key, t);
187 x->smaller = t->smaller;
193 if(t->smaller == NULL) {
197 x = Curl_splay(i, t->smaller);
234 and thus we can unlink it easily. The 'smaller' link of a subnode
236 if(removenode->smaller == NULL)
239 removenode->smaller->same = removenode->same;
241 removenode->same->smaller = removenode->smaller;
244 removenode->smaller = NULL;
268 smaller/larger links */
272 x->smaller = t->smaller;
276 if(t->smaller == NULL)
279 x = Curl_splay(removenode->key, t->smaller);