86 	int i, pos = 0;  in array_get_index()  local
91 	for (i = pos = a->next_power_of_2 / 2; ; i >>= 1) {  in array_get_index()
94 		if (pos < 0) {  in array_get_index()
95 			pos += i;  in array_get_index()
96 		} else if (pos >= (int)a->used) {  in array_get_index()
97 			pos -= i;  in array_get_index()
99 …= buffer_caseless_compare(key, keylen, a->data[a->sorted[pos]]->key->ptr, a->data[a->sorted[pos]]-…  in array_get_index()
103 				ndx = a->sorted[pos];  in array_get_index()
106 				pos -= i;  in array_get_index()
108 				pos += i;  in array_get_index()
114 	if (rndx) *rndx = pos;  in array_get_index()
183 	int pos = 0;  in array_insert_unique()  local
193 	if (-1 != (ndx = array_get_index(a, str->key->ptr, str->key->used, &pos))) {  in array_insert_unique()
233 	if (pos != ndx &&  in array_insert_unique()
234 	    ((pos < 0) ||  in array_insert_unique()
235 …compare(str->key->ptr, str->key->used, a->data[a->sorted[pos]]->key->ptr, a->data[a->sorted[pos]]-…  in array_insert_unique()
236 		pos++;  in array_insert_unique()
240 	if (pos != ndx) {  in array_insert_unique()
241 		memmove(a->sorted + (pos + 1), a->sorted + (pos), (ndx - pos) * sizeof(*a->sorted));  in array_insert_unique()
245 	a->sorted[pos] = ndx;  in array_insert_unique()