Lines Matching refs:count
54 private int count = 0;
59 //Size of the undefined if count is kept.
68 //Set to true if a count of ids above the entry limit should be kept.
74 * maintain count, plus an extra 128 slots.
78 * @param doCount The index maintain count.
116 count = 0;
158 * in the parameter. The specified limit and maintain count parameters define
195 count = 0;
197 else if ((count + importIDSet.size()) > limit) //add together => undefined
206 count = 0;
235 if((l < 0) || (isDefined() && ((count + 1) > limit)))
240 undefinedSize = count + 1;
244 count = 0;
276 count = array.length;
304 count = 0;
308 count = array.length;
319 * ID set. The specified limit and maintain count parameters define
324 * @return <CODE>True</CODE> if the import ID set started keeping a count as
338 count = 0;
343 count = 0;
349 count = 0;
353 count = array.length;
366 for(int i=0; i < count; i++)
368 if(binarySearch(that.array, that.count, array[i]) < 0)
374 count = c;
380 resize(this.count+that.count);
382 if (that.count == 0)
388 if (this.count == 0 || that.array[0] > this.array[this.count-1])
390 System.arraycopy(that.array, 0, this.array, this.count, that.count);
391 count += that.count;
395 if (this.array[0] > that.array[that.count-1])
397 System.arraycopy(this.array, 0, this.array, that.count, this.count);
398 System.arraycopy(that.array, 0, this.array, 0, that.count);
399 count += that.count;
403 int destPos = binarySearch(this.array, this.count, that.array[0]);
410 int aCount = this.count - destPos;
411 int aPos = destPos + that.count;
416 if (this.array[aPos] > that.array[that.count-1])
418 System.arraycopy(that.array, 0, this.array, destPos, that.count);
419 count += that.count;
424 for ( bPos = 0; aPos < aEnd && bPos < that.count; )
449 int bRemain = that.count - bPos;
456 count = destPos;
467 return count;
473 resize(count+1);
475 if (count == 0 || v > array[count-1])
477 array[count++] = v;
481 int pos = binarySearch(array, count, v);
492 System.arraycopy(array, pos, array, pos+1, count-pos);
494 count++;
499 private static int binarySearch(long[] a, int count, long key)
502 int high = count-1;
537 System.arraycopy(array, 0, newBytes, 0, count);
561 int encodedSize = count * 8;
565 for (int pos = 0, i = 0; i < count; i++) {