27 	a->used = src->used;  in array_init_array()
64 		for (i = 0; i < a->used; i++) {  in array_reset()
69 	a->used = 0;  in array_reset()
75 	assert(a->used != 0);  in array_pop()
77 	a->used --;  in array_pop()
78 	du = a->data[a->used];  in array_pop()
79 	a->data[a->used] = NULL;  in array_pop()
96 		} else if (pos >= (int)a->used) {  in array_get_index()
99 …seless_compare(key, keylen, a->data[a->sorted[pos]]->key->ptr, a->data[a->sorted[pos]]->key->used);  in array_get_index()
135 	for (i = a->used; i < a->size; i++) {  in array_get_unused_element()
140 			a->data[i] = a->data[a->used];  in array_get_unused_element()
141 			a->data[a->used] = NULL;  in array_get_unused_element()
171 	if (-1 == (ndx = array_get_index(a, du->key->ptr, du->key->used, NULL))) {  in array_replace()
187 	if (str->key->used == 0 || str->is_index_key) {  in array_insert_unique()
193 	if (-1 != (ndx = array_get_index(a, str->key->ptr, str->key->used, &pos))) {  in array_insert_unique()
205 	if (a->used+1 > INT_MAX) {  in array_insert_unique()
216 		for (j = a->used; j < a->size; j++) a->data[j] = NULL;  in array_insert_unique()
217 	} else if (a->size == a->used) {  in array_insert_unique()
223 		for (j = a->used; j < a->size; j++) a->data[j] = NULL;  in array_insert_unique()
226 	ndx = (int) a->used;  in array_insert_unique()
231 	a->data[a->used++] = str;  in array_insert_unique()
235 …eless_compare(str->key->ptr, str->key->used, a->data[a->sorted[pos]]->key->ptr, a->data[a->sorted[…  in array_insert_unique()
263 	for (i = 0; i < a->used; i ++) {  in array_get_max_key_length()
279 	if (a->used > 5) {  in array_print()
282 	for (i = 0; i < a->used && oneline; i++) {  in array_print()
300 		for (i = 0; i < a->used; i++) {  in array_print()
313 	for (i = 0; i < a->used; i++) {  in array_print()