Lines Matching refs:elements
33 elements(0),
43 elements(0),
53 elements(0),
63 elements(0),
78 elements = (UElement *)uprv_malloc(sizeof(UElement)*initialCapacity);
79 if (elements == 0) {
88 uprv_free(elements);
89 elements = 0;
101 if (elements[i].pointer != 0 && deleter != 0) {
102 (*deleter)(elements[i].pointer);
104 (*assign)(&elements[i], &other.elements[i]);
117 if (!(*comparer)(elements[i], other.elements[i])) {
127 elements[count++].pointer = obj;
133 elements[count].pointer = NULL; // Pointers may be bigger than ints.
134 elements[count].integer = elem;
141 if (elements[index].pointer != 0 && deleter != 0) {
142 (*deleter)(elements[index].pointer);
144 elements[index].pointer = obj;
151 if (elements[index].pointer != 0 && deleter != 0) {
153 (*deleter)(elements[index].pointer);
155 elements[index].pointer = NULL;
156 elements[index].integer = elem;
165 elements[i] = elements[i-1];
167 elements[index].pointer = obj;
177 elements[i] = elements[i-1];
179 elements[index].pointer = NULL;
180 elements[index].integer = elem;
187 return (0 <= index && index < count) ? elements[index].pointer : 0;
191 return (0 <= index && index < count) ? elements[index].integer : 0;
196 if (indexOf(other.elements[i]) < 0) {
205 if (indexOf(other.elements[i]) >= 0) {
215 int32_t j = indexOf(other.elements[i]);
227 int32_t i = other.indexOf(elements[j]);
255 if (elements[i].pointer != 0) {
256 (*deleter)(elements[i].pointer);
271 if (elements[i].pointer != other.elements[i].pointer) {
278 key.pointer = &other.elements[i];
279 if (!(*comparer)(key, elements[i])) {
306 if ((*comparer)(key, elements[i])) {
316 if (key.pointer == elements[i].pointer) {
320 if (key.integer == elements[i].integer) {
348 UElement* newElems = (UElement *)uprv_realloc(elements, sizeof(UElement)*newCap);
354 elements = newElems;
362 * then truncate the array, possibly deleting held elements for i >=
379 elements[i] = empty;
391 * Fill in the given array with all elements of this vector.
396 *a++ = elements[i].pointer;
425 e = elements[index].pointer;
427 elements[i] = elements[i+1];
437 * as defined by 'compare'. The current elements are assumed to
448 * as defined by 'compare'. The current elements are assumed to
457 // ASSUME elements[] IS CURRENTLY SORTED
460 // will be inserted between two elements a and b such that a <=
461 // tok && tok < b, where there is a 'virtual' elements[-1] always
462 // less than tok and a 'virtual' elements[count] always greater
467 int8_t c = (*compare)(elements[probe], e);
477 elements[i] = elements[i-1];
479 elements[min] = e;
507 * Compares int32_t vector elements.
526 uprv_sortArray(elements, count, sizeof(UElement),
548 uprv_sortArray(elements, count, sizeof(UElement),
559 uprv_sortArray(elements, count, sizeof(UElement),