138 	struct key *kprev, *k;  local
159 	k = (struct key *)xmalloc(sizeof (struct key));
160 	k->time = LB;
161 	k->numnote = 1;
162 	k->notice = n;
163 	k->left = NULL;
164 	kprev = k;
166 	n->key = k;
179 		k = (struct key *)xmalloc(sizeof (struct key));
180 		k->time = t;
181 		k->numnote = 1;
182 		k->notice = n;
183 		k->left = kprev;
184 		kprev->right = k;
185 		kprev = k;
186 		n->key = k;
188 		ind->key = k;
202 	k = (struct key *)xmalloc(sizeof (struct key));
203 	k->time = INFINITY;
204 	k->numnote = 1;
205 	k->notice = n;
206 	k->left = kprev;
207 	k->right = NULL;
208 	kprev->right = k;
209 	n->key = k;
212 	ind->key = k;
236 	struct key *k, *k2;  local
264 	k = (ind->key)->left;
265 	while (k->time > time) k = k->left;
266 	k = k->right;
269 	if (k->numnote == NLIM) {
271 		k->numnote = NLIM / 2;
272 		n2 = k->notice;
279 		k2->right = k;
280 		k2->left = k->left;
281 		k->left = k2;
285 		if (k2->time > time) k = k2; }
291 	k->numnote = k->numnote + 1;
292 	n2 = k->notice;
320 	struct key *k, *kl, *kr;  local
333 				k = n->key;
334 				(k->left)->right = k->right;
335 				(k->right)->left = k->left;
336 				free(k);
345 				k = n2->key;
346 				k->numnote = k->numnote - 1;
351 				kl = k->left;
352 				kr = k->right;
354 				    ((kl->numnote+k->numnote) <= NLIM)) {
357 					k->numnote += kl->numnote;
358 					(kl->left)->right = k;
359 					k->left = kl->left;
361 				} else if ((!(k->notice)->isdummy) &&
362 					    ((kr->numnote+k->numnote)
365 					(k->notice)->key = NULL;
366 					kr->numnote += k->numnote;
367 					(k->left)->right = kr;
368 					kr->left = k->left;
369 					free(k); }
381 	k = (index->key)->left;
382 	while (k->left != NULL) k = k->left;
383 	n = (k->notice)->right;
407 	struct key *k, *fk;  in el_first()  local
418 			k = index->key;  in el_first()
419 			k->time += DT;  in el_first()
420 			(k->notice)->time += DT;  in el_first()
440 		k = ind->key;  in el_first()
441 		next_int = k->time + DT;	/* upper bound on new inter.  */  in el_first()
442 		while (k->time < next_int) k = k->right;  in el_first()
444 		n = (k->notice)->left;  in el_first()
460 		fk->numnote = k->numnote - ctr + 1;  in el_first()
461 		fk->left = k->left;  in el_first()
462 		fk->right = k;  in el_first()
463 		(k->left)->right = fk;  in el_first()
464 		k->left = fk;  in el_first()
465 		k->numnote = ctr;  in el_first()
479 	k = n->key;  in el_first()
480 	k->numnote = k->numnote - 1;  in el_first()
482 	if (k->numnote == 0) {  in el_first()
483 		(k->left)->right = k->right;  in el_first()
484 		(k->right)->left = k->left;  in el_first()
485 		free(k); }  in el_first()
507 	struct key *k, *k2;  in el_delete()  local
513 	k = ind->key;  in el_delete()
514 	while (k->left != NULL) k = k->left;  in el_delete()
515 	n = k->notice;  in el_delete()
520 	while (k != NULL) {  in el_delete()
521 		k2 = k->right;  in el_delete()
522 		free(k);  in el_delete()
523 		k = k2; }  in el_delete()