118     a->sorted = ck_realloc_u32((void**)&a->sorted,a->size,0,sizeof(*a->sorted));  in array_extend()
129 	if (a->sorted) free(a->sorted);  in array_free_data()
137 	a->sorted = NULL;  in array_free_data()
180 	force_assert(a->sorted[a->used] == du); /* only works on "simple" lists */
232         const int x = ((data_string *)a->sorted[probe])->ext;  in array_get_index_ext()
236           : array_keycmpb(k, klen, &a->sorted[probe]->key);  in array_get_index_ext()
250     return ipos >= 0 ? a->sorted[ipos] : NULL;  in array_get_element_klen_ext()
266         const buffer * const b = &a->sorted[probe]->key;  in array_get_index()
286     return ipos >= 0 ? a->sorted[ipos] : NULL;  in array_get_element_klen()
292     return ipos >= 0 ? a->sorted[ipos] : NULL;  in array_get_data_unset()
300     data_unset * const entry = a->sorted[ipos];  in array_extract_element_klen()
303         data_unset ** const d = a->sorted + ipos;  in array_extract_element_klen()
363     data_unset ** const d = a->sorted + pos;  in array_insert_data_at_pos()
365         memmove(d+1, d, ndx * sizeof(*a->sorted));  in array_insert_data_at_pos()
390     if (ipos >= 0) return &((data_string *)a->sorted[ipos])->value;  in array_get_buf_ptr_ext()
401     if (ipos >= 0) return &((data_integer *)a->sorted[ipos])->value;  in array_get_int_ptr()
411     if (ipos >= 0) return &((data_string *)a->sorted[ipos])->value;  in array_get_buf_ptr()
438     if (ipos >= 0) return &a->sorted[ipos];  in array_find_or_insert()
451     data_unset *old = a->sorted[ipos];  in array_replace()
453     a->sorted[ipos] = entry;  in array_replace()