Lines Matching refs:elements
32 elements(0),
42 elements(0),
52 elements(0),
62 elements(0),
77 elements = (UHashTok *)uprv_malloc(sizeof(UHashTok)*initialCapacity);
78 if (elements == 0) {
87 uprv_free(elements);
88 elements = 0;
100 if (elements[i].pointer != 0 && deleter != 0) {
101 (*deleter)(elements[i].pointer);
103 (*assign)(&elements[i], &other.elements[i]);
116 if (!(*comparer)(elements[i], other.elements[i])) {
126 elements[count++].pointer = obj;
132 elements[count].pointer = NULL; // Pointers may be bigger than ints.
133 elements[count].integer = elem;
140 if (elements[index].pointer != 0 && deleter != 0) {
141 (*deleter)(elements[index].pointer);
143 elements[index].pointer = obj;
150 if (elements[index].pointer != 0 && deleter != 0) {
152 (*deleter)(elements[index].pointer);
154 elements[index].pointer = NULL;
155 elements[index].integer = elem;
164 elements[i] = elements[i-1];
166 elements[index].pointer = obj;
176 elements[i] = elements[i-1];
178 elements[index].pointer = NULL;
179 elements[index].integer = elem;
186 return (0 <= index && index < count) ? elements[index].pointer : 0;
190 return (0 <= index && index < count) ? elements[index].integer : 0;
195 if (indexOf(other.elements[i]) < 0) {
204 if (indexOf(other.elements[i]) >= 0) {
214 int32_t j = indexOf(other.elements[i]);
226 int32_t i = other.indexOf(elements[j]);
254 if (elements[i].pointer != 0) {
255 (*deleter)(elements[i].pointer);
270 if (elements[i].pointer != other.elements[i].pointer) {
277 key.pointer = &other.elements[i];
278 if (!(*comparer)(key, elements[i])) {
305 if ((*comparer)(key, elements[i])) {
315 if (key.pointer == elements[i].pointer) {
319 if (key.integer == elements[i].integer) {
334 UHashTok* newElems = (UHashTok *)uprv_realloc(elements, sizeof(UHashTok)*newCap);
340 elements = newElems;
348 * then truncate the array, possibly deleting held elements for i >=
365 elements[i] = empty;
377 * Fill in the given array with all elements of this vector.
382 *a++ = elements[i].pointer;
411 e = elements[index].pointer;
413 elements[i] = elements[i+1];
423 * as defined by 'compare'. The current elements are assumed to
434 * as defined by 'compare'. The current elements are assumed to
443 // ASSUME elements[] IS CURRENTLY SORTED
446 // will be inserted between two elements a and b such that a <=
447 // tok && tok < b, where there is a 'virtual' elements[-1] always
448 // less than tok and a 'virtual' elements[count] always greater
453 int8_t c = (*compare)(elements[probe], tok);
463 elements[i] = elements[i-1];
465 elements[min] = tok;
493 * Compares int32_t vector elements.
512 uprv_sortArray(elements, count, sizeof(UHashTok),
534 uprv_sortArray(elements, count, sizeof(UHashTok),
