Lines Matching refs:elements
31 elements(NULL)
40 elements(0)
58 elements = (int32_t *)uprv_malloc(sizeof(int32_t)*initialCapacity);
59 if (elements == 0) {
67 uprv_free(elements);
68 elements = 0;
78 elements[i] = other.elements[i];
88 if (elements[i] != other.elements[i]) {
98 elements[index] = elem;
107 elements[i] = elements[i-1];
109 elements[index] = elem;
117 if (indexOf(other.elements[i]) < 0) {
126 if (indexOf(other.elements[i]) >= 0) {
136 int32_t j = indexOf(other.elements[i]);
148 int32_t i = other.indexOf(elements[j]);
160 elements[i] = elements[i+1];
177 if (elements[i] != other.elements[i]) {
190 if (key == elements[i]) {
226 int32_t* newElems = (int32_t *)uprv_realloc(elements, sizeof(int32_t)*newCap);
232 elements = newElems;
254 int32_t* newElems = (int32_t *)uprv_realloc(elements, sizeof(int32_t)*maxCapacity);
260 elements = newElems;
269 * then truncate the array, possibly deleting held elements for i >=
284 elements[i] = 0;
295 * as defined by 'compare'. The current elements are assumed to
300 // will be inserted between two elements a and b such that a <=
301 // tok && tok < b, where there is a 'virtual' elements[-1] always
302 // less than tok and a 'virtual' elements[count] always greater
307 //int8_t c = (*compare)(elements[probe], tok);
309 if (elements[probe] > tok) {
318 elements[i] = elements[i-1];
320 elements[min] = tok;
