Lines Matching defs:tmp
80 * Maximum initial size of tmp array, which is used for merging. The array
91 private Object[] tmp;
120 tmp = newArray;
449 // Merge remaining runs, using tmp array with min(len1, len2) elements
507 int tmp = lastOfs;
509 ofs = hint - tmp;
562 int tmp = lastOfs;
564 ofs = hint - tmp;
623 Object[] tmp = ensureCapacity(len1);
624 System.arraycopy(a, base1, tmp, 0, len1);
626 int cursor1 = 0; // Indexes into tmp array
633 System.arraycopy(tmp, cursor1, a, dest, len1);
638 a[dest + len2] = tmp[cursor1]; // Last elt of run 1 to end of merge
654 if (((Comparable) a[cursor2]).compareTo(tmp[cursor1]) < 0) {
661 a[dest++] = tmp[cursor1++];
676 count1 = gallopRight((Comparable) a[cursor2], tmp, cursor1, len1, 0);
678 System.arraycopy(tmp, cursor1, a, dest, count1);
689 count2 = gallopLeft((Comparable) tmp[cursor1], a, cursor2, len2, 0);
698 a[dest++] = tmp[cursor1++];
712 a[dest + len2] = tmp[cursor1]; // Last elt of run 1 to end of merge
719 System.arraycopy(tmp, cursor1, a, dest, len1);
740 Object[] tmp = ensureCapacity(len2);
741 System.arraycopy(a, base2, tmp, 0, len2);
744 int cursor2 = len2 - 1; // Indexes into tmp array
750 System.arraycopy(tmp, 0, a, dest - (len2 - 1), len2);
757 a[dest] = tmp[cursor2];
773 if (((Comparable) tmp[cursor2]).compareTo(a[cursor1]) < 0) {
780 a[dest--] = tmp[cursor2--];
795 count1 = len1 - gallopRight((Comparable) tmp[cursor2], a, base1, len1, len1 - 1);
804 a[dest--] = tmp[cursor2--];
808 count2 = len2 - gallopLeft((Comparable) a[cursor1], tmp, 0, len2, len2 - 1);
813 System.arraycopy(tmp, cursor2 + 1, a, dest + 1, count2);
833 a[dest] = tmp[cursor2]; // Move first elt of run2 to front of merge
840 System.arraycopy(tmp, 0, a, dest - (len2 - 1), len2);
845 * Ensures that the external array tmp has at least the specified
849 * @param minCapacity the minimum required capacity of the tmp array
850 * @return tmp, whether or not it grew
853 if (tmp.length < minCapacity) {
870 tmp = newArray;
872 return tmp;