Lines Matching full:count
30 count(0),
40 count(0),
50 count(0),
60 count(0),
96 if (ensureCapacity(other.count, ec)) {
97 setSize(other.count, ec);
99 for (int32_t i=0; i<other.count; ++i) {
112 if (count != other.count) return FALSE;
115 for (i=0; i<count; ++i) {
125 if (ensureCapacity(count + 1, status)) {
126 elements[count++].pointer = obj;
131 if (ensureCapacity(count + 1, status)) {
132 elements[count].pointer = NULL; // Pointers may be bigger than ints.
133 elements[count].integer = elem;
134 count++;
139 if (0 <= index && index < count) {
149 if (0 <= index && index < count) {
161 // must have 0 <= index <= count
162 if (0 <= index && index <= count && ensureCapacity(count + 1, status)) {
163 for (int32_t i=count; i>index; --i) {
167 ++count;
173 // must have 0 <= index <= count
174 if (0 <= index && index <= count && ensureCapacity(count + 1, status)) {
175 for (int32_t i=count; i>index; --i) {
180 ++count;
186 return (0 <= index && index < count) ? elements[index].pointer : 0;
190 return (0 <= index && index < count) ? elements[index].integer : 0;
253 for (int32_t i=0; i<count; ++i) {
259 count = 0;
265 if (this->count != other.count) {
269 for (i=0; i<count; i++) {
276 for (i=0; i<count; i++) {
304 for (i=startIndex; i<count; ++i) {
310 for (i=startIndex; i<count; ++i) {
370 if (newSize > count) {
377 for (i=count; i<newSize; ++i) {
381 /* Most efficient to count down */
382 for (i=count-1; i>=newSize; --i) {
386 count = newSize;
394 for (int i=0; i<count; ++i) {
423 if (0 <= index && index < count) {
425 for (int32_t i=index; i<count-1; ++i) {
428 --count;
461 // less than tok and a 'virtual' elements[count] always greater
463 int32_t min = 0, max = count;
474 if (ensureCapacity(count + 1, ec)) {
475 for (int32_t i=count; i>min; --i) {
479 ++count;
525 uprv_sortArray(elements, count, sizeof(UHashTok),
547 uprv_sortArray(elements, count, sizeof(UHashTok),
