Lines Matching full:larger
32 * positive when : when i is larger than j
48 N.smaller = N.larger = NULL;
58 t->smaller = y->larger;
59 y->larger = t;
69 if(t->larger == NULL)
71 if(compare(i, t->larger->key) > 0) {
72 y = t->larger; /* rotate larger */
73 t->larger = y->smaller;
76 if(t->larger == NULL)
79 l->larger = t; /* link larger */
81 t = t->larger;
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;
134 node->larger = t;
139 node->larger = t->larger;
141 t->larger = NULL;
152 resulting tree. best-fit means the smallest node if it is not larger than
182 x->larger = t->larger;
192 x = t->larger;
256 smaller/larger links */
259 x->larger = t->larger;
267 x = t->larger;
270 x->larger = t->larger;
