/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/java.base/share/classes/java/util/ |
H A D | ComparableTimSort.java | 477 len2 = gallopLeft((Comparable<Object>) a[base1 + len1 - 1], a, in mergeAt() 507 private static int gallopLeft(Comparable<Object> key, Object[] a, in gallopLeft() method in ComparableTimSort 723 count2 = gallopLeft((Comparable) tmp[cursor1], a, cursor2, len2, 0); 843 count2 = len2 - gallopLeft((Comparable) a[cursor1], tmp, tmpBase, len2, len2 - 1);
|
H A D | TimSort.java | 511 len2 = gallopLeft(a[base1 + len1 - 1], a, base2, len2, len2 - 1, c); in mergeAt() 541 private static <T> int gallopLeft(T key, T[] a, int base, int len, int hint, in gallopLeft() method in TimSort 756 count2 = gallopLeft(tmp[cursor1], a, cursor2, len2, 0, c); 876 count2 = len2 - gallopLeft(a[cursor1], tmp, tmpBase, len2, len2 - 1, c);
|
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/java.base/share/classes/java/util/ |
H A D | ComparableTimSort.java | 477 len2 = gallopLeft((Comparable<Object>) a[base1 + len1 - 1], a, in mergeAt() 507 private static int gallopLeft(Comparable<Object> key, Object[] a, in gallopLeft() method in ComparableTimSort 723 count2 = gallopLeft((Comparable) tmp[cursor1], a, cursor2, len2, 0); 843 count2 = len2 - gallopLeft((Comparable) a[cursor1], tmp, tmpBase, len2, len2 - 1);
|
H A D | TimSort.java | 511 len2 = gallopLeft(a[base1 + len1 - 1], a, base2, len2, len2 - 1, c); in mergeAt() 541 private static <T> int gallopLeft(T key, T[] a, int base, int len, int hint, in gallopLeft() method in TimSort 756 count2 = gallopLeft(tmp[cursor1], a, cursor2, len2, 0, c); 876 count2 = len2 - gallopLeft(a[cursor1], tmp, tmpBase, len2, len2 - 1, c);
|
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/jdk/src/share/classes/java/util/ |
H A D | ComparableTimSort.java | 473 len2 = gallopLeft((Comparable<Object>) a[base1 + len1 - 1], a, in mergeAt() 503 private static int gallopLeft(Comparable<Object> key, Object[] a, in gallopLeft() method in ComparableTimSort 719 count2 = gallopLeft((Comparable) tmp[cursor1], a, cursor2, len2, 0); 839 count2 = len2 - gallopLeft((Comparable) a[cursor1], tmp, tmpBase, len2, len2 - 1);
|
H A D | TimSort.java | 507 len2 = gallopLeft(a[base1 + len1 - 1], a, base2, len2, len2 - 1, c); in mergeAt() 537 private static <T> int gallopLeft(T key, T[] a, int base, int len, int hint, in gallopLeft() method in TimSort 752 count2 = gallopLeft(tmp[cursor1], a, cursor2, len2, 0, c); 872 count2 = len2 - gallopLeft(a[cursor1], tmp, tmpBase, len2, len2 - 1, c);
|
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/java.base/share/classes/java/util/ |
H A D | ComparableTimSort.java | 477 len2 = gallopLeft((Comparable<Object>) a[base1 + len1 - 1], a, in mergeAt() 507 private static int gallopLeft(Comparable<Object> key, Object[] a, in gallopLeft() method in ComparableTimSort 723 count2 = gallopLeft((Comparable) tmp[cursor1], a, cursor2, len2, 0); 843 count2 = len2 - gallopLeft((Comparable) a[cursor1], tmp, tmpBase, len2, len2 - 1);
|
H A D | TimSort.java | 511 len2 = gallopLeft(a[base1 + len1 - 1], a, base2, len2, len2 - 1, c); in mergeAt() 541 private static <T> int gallopLeft(T key, T[] a, int base, int len, int hint, in gallopLeft() method in TimSort 756 count2 = gallopLeft(tmp[cursor1], a, cursor2, len2, 0, c); 876 count2 = len2 - gallopLeft(a[cursor1], tmp, tmpBase, len2, len2 - 1, c);
|
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/java.base/share/classes/java/util/ |
H A D | ComparableTimSort.java | 477 len2 = gallopLeft((Comparable<Object>) a[base1 + len1 - 1], a, in mergeAt() 507 private static int gallopLeft(Comparable<Object> key, Object[] a, in gallopLeft() method in ComparableTimSort 723 count2 = gallopLeft((Comparable) tmp[cursor1], a, cursor2, len2, 0); 843 count2 = len2 - gallopLeft((Comparable) a[cursor1], tmp, tmpBase, len2, len2 - 1);
|
H A D | TimSort.java | 511 len2 = gallopLeft(a[base1 + len1 - 1], a, base2, len2, len2 - 1, c); in mergeAt() 541 private static <T> int gallopLeft(T key, T[] a, int base, int len, int hint, in gallopLeft() method in TimSort 756 count2 = gallopLeft(tmp[cursor1], a, cursor2, len2, 0, c); 876 count2 = len2 - gallopLeft(a[cursor1], tmp, tmpBase, len2, len2 - 1, c);
|
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/java.base/share/classes/java/util/ |
H A D | ComparableTimSort.java | 477 len2 = gallopLeft((Comparable<Object>) a[base1 + len1 - 1], a, in mergeAt() 507 private static int gallopLeft(Comparable<Object> key, Object[] a, in gallopLeft() method in ComparableTimSort 723 count2 = gallopLeft((Comparable) tmp[cursor1], a, cursor2, len2, 0); 843 count2 = len2 - gallopLeft((Comparable) a[cursor1], tmp, tmpBase, len2, len2 - 1);
|
H A D | TimSort.java | 511 len2 = gallopLeft(a[base1 + len1 - 1], a, base2, len2, len2 - 1, c); in mergeAt() 541 private static <T> int gallopLeft(T key, T[] a, int base, int len, int hint, in gallopLeft() method in TimSort 756 count2 = gallopLeft(tmp[cursor1], a, cursor2, len2, 0, c); 876 count2 = len2 - gallopLeft(a[cursor1], tmp, tmpBase, len2, len2 - 1, c);
|
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/java.base/share/classes/java/util/ |
H A D | ComparableTimSort.java | 477 len2 = gallopLeft((Comparable<Object>) a[base1 + len1 - 1], a, in mergeAt() 507 private static int gallopLeft(Comparable<Object> key, Object[] a, in gallopLeft() method in ComparableTimSort 723 count2 = gallopLeft((Comparable) tmp[cursor1], a, cursor2, len2, 0); 843 count2 = len2 - gallopLeft((Comparable) a[cursor1], tmp, tmpBase, len2, len2 - 1);
|
H A D | TimSort.java | 511 len2 = gallopLeft(a[base1 + len1 - 1], a, base2, len2, len2 - 1, c); in mergeAt() 541 private static <T> int gallopLeft(T key, T[] a, int base, int len, int hint, in gallopLeft() method in TimSort 756 count2 = gallopLeft(tmp[cursor1], a, cursor2, len2, 0, c); 876 count2 = len2 - gallopLeft(a[cursor1], tmp, tmpBase, len2, len2 - 1, c);
|
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/java.base/share/classes/java/util/ |
H A D | ComparableTimSort.java | 477 len2 = gallopLeft((Comparable<Object>) a[base1 + len1 - 1], a, in mergeAt() 507 private static int gallopLeft(Comparable<Object> key, Object[] a, in gallopLeft() method in ComparableTimSort 723 count2 = gallopLeft((Comparable) tmp[cursor1], a, cursor2, len2, 0); 843 count2 = len2 - gallopLeft((Comparable) a[cursor1], tmp, tmpBase, len2, len2 - 1);
|
H A D | TimSort.java | 511 len2 = gallopLeft(a[base1 + len1 - 1], a, base2, len2, len2 - 1, c); in mergeAt() 541 private static <T> int gallopLeft(T key, T[] a, int base, int len, int hint, in gallopLeft() method in TimSort 756 count2 = gallopLeft(tmp[cursor1], a, cursor2, len2, 0, c); 876 count2 = len2 - gallopLeft(a[cursor1], tmp, tmpBase, len2, len2 - 1, c);
|
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/java.base/share/classes/java/util/ |
H A D | ComparableTimSort.java | 477 len2 = gallopLeft((Comparable<Object>) a[base1 + len1 - 1], a, in mergeAt() 507 private static int gallopLeft(Comparable<Object> key, Object[] a, in gallopLeft() method in ComparableTimSort 723 count2 = gallopLeft((Comparable) tmp[cursor1], a, cursor2, len2, 0); 843 count2 = len2 - gallopLeft((Comparable) a[cursor1], tmp, tmpBase, len2, len2 - 1);
|
H A D | TimSort.java | 511 len2 = gallopLeft(a[base1 + len1 - 1], a, base2, len2, len2 - 1, c); in mergeAt() 541 private static <T> int gallopLeft(T key, T[] a, int base, int len, int hint, in gallopLeft() method in TimSort 756 count2 = gallopLeft(tmp[cursor1], a, cursor2, len2, 0, c); 876 count2 = len2 - gallopLeft(a[cursor1], tmp, tmpBase, len2, len2 - 1, c);
|
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/jdk/src/share/classes/java/util/ |
H A D | ComparableTimSort.java | 473 len2 = gallopLeft((Comparable<Object>) a[base1 + len1 - 1], a, in mergeAt() 503 private static int gallopLeft(Comparable<Object> key, Object[] a, in gallopLeft() method in ComparableTimSort 719 count2 = gallopLeft((Comparable) tmp[cursor1], a, cursor2, len2, 0); 839 count2 = len2 - gallopLeft((Comparable) a[cursor1], tmp, tmpBase, len2, len2 - 1);
|
H A D | TimSort.java | 507 len2 = gallopLeft(a[base1 + len1 - 1], a, base2, len2, len2 - 1, c); in mergeAt() 537 private static <T> int gallopLeft(T key, T[] a, int base, int len, int hint, in gallopLeft() method in TimSort 752 count2 = gallopLeft(tmp[cursor1], a, cursor2, len2, 0, c); 872 count2 = len2 - gallopLeft(a[cursor1], tmp, tmpBase, len2, len2 - 1, c);
|
/dports/math/sound-of-sorting/sound-of-sorting-5884a35/src/algorithms/ |
H A D | timsort.cpp | 296 len2 = gallopLeft(*(base1 + (len1 - 1)), base2, len2, len2 - 1); in mergeAt() 311 diff_t gallopLeft(ref_t key, Iter const base, diff_t const len, diff_t const hint) { in gallopLeft() function in TimSortNS::TimSort 479 count2 = gallopLeft(*cursor1, cursor2, len2, 0); in mergeLo() 600 count2 = len2 - gallopLeft(*cursor1, tmp_.begin(), len2, len2 - 1); in mergeHi()
|
/dports/devel/spark/spark-2.1.1/core/src/main/java/org/apache/spark/util/collection/ |
H A D | TimSort.java | 518 len2 = gallopLeft(s.getKey(a, base1 + len1 - 1, key0), a, base2, len2, len2 - 1, c); in mergeAt() 548 private int gallopLeft(K key, Buffer a, int base, int len, int hint, Comparator<? super K> c) { in gallopLeft() method in TimSort 769 count2 = gallopLeft(s.getKey(tmp, cursor1, key0), a, cursor2, len2, 0, c); 891 count2 = len2 - gallopLeft(s.getKey(a, cursor1, key0), tmp, 0, len2, len2 - 1, c);
|
/dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/include/util/ |
H A D | timsort.hpp | 299 len2 = gallopLeft(*(base1 + (len1 - 1)), base2, len2, len2 - 1); in mergeAt() 312 …template <typename Iter> diff_t gallopLeft(ref_t key, Iter const base, diff_t const len, diff_t co… in gallopLeft() function in gfx::TimSort 476 count2 = gallopLeft(*cursor1, cursor2, len2, 0); in mergeLo() 595 count2 = len2 - gallopLeft(*(cursor1-1), tmp_.begin(), len2, len2 - 1); in mergeHi()
|
/dports/biology/ncbi-blast+/ncbi-blast-2.12.0+-src/c++/include/util/ |
H A D | timsort.hpp | 299 len2 = gallopLeft(*(base1 + (len1 - 1)), base2, len2, len2 - 1); in mergeAt() 312 …template <typename Iter> diff_t gallopLeft(ref_t key, Iter const base, diff_t const len, diff_t co… in gallopLeft() function in gfx::TimSort 476 count2 = gallopLeft(*cursor1, cursor2, len2, 0); in mergeLo() 595 count2 = len2 - gallopLeft(*(cursor1-1), tmp_.begin(), len2, len2 - 1); in mergeHi()
|
/dports/devel/kdevelop/kdevelop-21.12.3/3rdparty/timsort/ |
H A D | timsort.hpp | 267 len2 = gallopLeft(*(base1 + (len1 - 1)), base2, len2, len2 - 1, compare); in mergeConsecutiveRuns() 281 static diff_t gallopLeft(ref_t key, Iter const base, diff_t const len, in gallopLeft() function in gfx::detail::TimSort 475 count2 = gallopLeft(*cursor1, cursor2, len2, 0, compare); in mergeLo() 601 count2 = len2 - gallopLeft(*(cursor1 - 1), tmp_.begin(), len2, len2 - 1, compare); in mergeHi()
|