Lines Matching refs:elements
30 elements(NULL)
39 elements(0)
54 elements = (int32_t *)uprv_malloc(sizeof(int32_t)*initialCapacity);
55 if (elements == 0) {
63 uprv_free(elements);
64 elements = 0;
74 elements[i] = other.elements[i];
84 if (elements[i] != other.elements[i]) {
94 elements[index] = elem;
103 elements[i] = elements[i-1];
105 elements[index] = elem;
113 if (indexOf(other.elements[i]) < 0) {
122 if (indexOf(other.elements[i]) >= 0) {
132 int32_t j = indexOf(other.elements[i]);
144 int32_t i = other.indexOf(elements[j]);
156 elements[i] = elements[i+1];
173 if (elements[i] != other.elements[i]) {
186 if (key == elements[i]) {
209 int32_t* newElems = (int32_t *)uprv_realloc(elements, sizeof(int32_t)*newCap);
215 elements = newElems;
233 int32_t* newElems = (int32_t *)uprv_realloc(elements, sizeof(int32_t)*maxCapacity);
239 elements = newElems;
248 * then truncate the array, possibly deleting held elements for i >=
263 elements[i] = 0;
274 * as defined by 'compare'. The current elements are assumed to
279 // will be inserted between two elements a and b such that a <=
280 // tok && tok < b, where there is a 'virtual' elements[-1] always
281 // less than tok and a 'virtual' elements[count] always greater
286 //int8_t c = (*compare)(elements[probe], tok);
288 if (elements[probe] > tok) {
297 elements[i] = elements[i-1];
299 elements[min] = tok;
