43     int nused;  member
54 	x->nallocated = x->nused = 0;  in new_itemlist()
66 		l->nallocated = l->nused + ALLOCCHUNK;  in item_add()
67 		new = malloc(sizeof (char *) * l->nused);  in item_add()
68 		memcpy(new, l->items, l->nused * sizeof (char *));  in item_add()
70 	} else if (l->nallocated == l->nused) {  in item_add()
77 	l->items[l->nused++] = s;  in item_add()
78 	l->sorted = l->nused <= 1;  in item_add()
87 		l->nused = n;  in item_add_list()
131 	int hi = l->nused - 1;  in item_search()
134 		qsort(l->items, l->nused, sizeof (char *), xcmp);  in item_search()
155 	if (i >= l->nused || i < 0)  in item_get()