/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/java.base/share/classes/java/util/ |
H A D | TimSort.java | 477 int base1 = runBase[i]; in mergeAt() local 482 assert base1 + len1 == base2; in mergeAt() 500 int k = gallopRight(a[base2], a, base1, len1, 0, c); in mergeAt() 502 base1 += k; in mergeAt() 518 mergeLo(base1, len1, base2, len2); in mergeAt() 520 mergeHi(base1, len1, base2, len2); in mergeAt() 686 assert len1 > 0 && len2 > 0 && base1 + len1 == base2; 693 int dest = base1; // Indexes int a 694 System.arraycopy(a, base1, tmp, cursor1, len1); 802 assert len1 > 0 && len2 > 0 && base1 + len1 == base2; [all …]
|
/dports/math/sound-of-sorting/sound-of-sorting-5884a35/src/algorithms/ |
H A D | timsort.cpp | 270 iter_t base1 = pending_[i].base; in mergeAt() local 276 assert( base1 + len1 == base2 ); in mergeAt() 286 diff_t const k = gallopRight(*base2, base1, len1, 0); in mergeAt() 289 base1 += k; in mergeAt() 303 mergeLo(base1, len1, base2, len2); in mergeAt() 306 mergeHi(base1, len1, base2, len2); in mergeAt() 405 assert( len1 > 0 && len2 > 0 && base1 + len1 == base2 ); in mergeLo() 407 copy_to_tmp(base1, len1); in mergeLo() 411 iter_t dest = base1; in mergeLo() 524 assert( len1 > 0 && len2 > 0 && base1 + len1 == base2 ); in mergeHi() [all …]
|
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/java.base/share/classes/java/util/ |
H A D | TimSort.java | 477 int base1 = runBase[i]; in mergeAt() local 482 assert base1 + len1 == base2; in mergeAt() 500 int k = gallopRight(a[base2], a, base1, len1, 0, c); in mergeAt() 502 base1 += k; in mergeAt() 518 mergeLo(base1, len1, base2, len2); in mergeAt() 520 mergeHi(base1, len1, base2, len2); in mergeAt() 686 assert len1 > 0 && len2 > 0 && base1 + len1 == base2; 693 int dest = base1; // Indexes int a 694 System.arraycopy(a, base1, tmp, cursor1, len1); 802 assert len1 > 0 && len2 > 0 && base1 + len1 == base2; [all …]
|
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/java.base/share/classes/java/util/ |
H A D | TimSort.java | 477 int base1 = runBase[i]; in mergeAt() local 482 assert base1 + len1 == base2; in mergeAt() 500 int k = gallopRight(a[base2], a, base1, len1, 0, c); in mergeAt() 502 base1 += k; in mergeAt() 518 mergeLo(base1, len1, base2, len2); in mergeAt() 520 mergeHi(base1, len1, base2, len2); in mergeAt() 686 assert len1 > 0 && len2 > 0 && base1 + len1 == base2; 693 int dest = base1; // Indexes int a 694 System.arraycopy(a, base1, tmp, cursor1, len1); 802 assert len1 > 0 && len2 > 0 && base1 + len1 == base2; [all …]
|
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/java.base/share/classes/java/util/ |
H A D | TimSort.java | 477 int base1 = runBase[i]; in mergeAt() local 482 assert base1 + len1 == base2; in mergeAt() 500 int k = gallopRight(a[base2], a, base1, len1, 0, c); in mergeAt() 502 base1 += k; in mergeAt() 518 mergeLo(base1, len1, base2, len2); in mergeAt() 520 mergeHi(base1, len1, base2, len2); in mergeAt() 686 assert len1 > 0 && len2 > 0 && base1 + len1 == base2; 693 int dest = base1; // Indexes int a 694 System.arraycopy(a, base1, tmp, cursor1, len1); 802 assert len1 > 0 && len2 > 0 && base1 + len1 == base2; [all …]
|
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/java.base/share/classes/java/util/ |
H A D | TimSort.java | 477 int base1 = runBase[i]; in mergeAt() local 482 assert base1 + len1 == base2; in mergeAt() 500 int k = gallopRight(a[base2], a, base1, len1, 0, c); in mergeAt() 502 base1 += k; in mergeAt() 518 mergeLo(base1, len1, base2, len2); in mergeAt() 520 mergeHi(base1, len1, base2, len2); in mergeAt() 686 assert len1 > 0 && len2 > 0 && base1 + len1 == base2; 693 int dest = base1; // Indexes int a 694 System.arraycopy(a, base1, tmp, cursor1, len1); 802 assert len1 > 0 && len2 > 0 && base1 + len1 == base2; [all …]
|
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/java.base/share/classes/java/util/ |
H A D | TimSort.java | 477 int base1 = runBase[i]; in mergeAt() local 482 assert base1 + len1 == base2; in mergeAt() 500 int k = gallopRight(a[base2], a, base1, len1, 0, c); in mergeAt() 502 base1 += k; in mergeAt() 518 mergeLo(base1, len1, base2, len2); in mergeAt() 520 mergeHi(base1, len1, base2, len2); in mergeAt() 686 assert len1 > 0 && len2 > 0 && base1 + len1 == base2; 693 int dest = base1; // Indexes int a 694 System.arraycopy(a, base1, tmp, cursor1, len1); 802 assert len1 > 0 && len2 > 0 && base1 + len1 == base2; [all …]
|
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/jdk/src/share/classes/java/util/ |
H A D | TimSort.java | 473 int base1 = runBase[i]; in mergeAt() local 478 assert base1 + len1 == base2; in mergeAt() 496 int k = gallopRight(a[base2], a, base1, len1, 0, c); in mergeAt() 498 base1 += k; in mergeAt() 514 mergeLo(base1, len1, base2, len2); in mergeAt() 516 mergeHi(base1, len1, base2, len2); in mergeAt() 682 assert len1 > 0 && len2 > 0 && base1 + len1 == base2; 689 int dest = base1; // Indexes int a 690 System.arraycopy(a, base1, tmp, cursor1, len1); 798 assert len1 > 0 && len2 > 0 && base1 + len1 == base2; [all …]
|
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/libcxx/test/std/ranges/range.adaptors/range.transform/ |
H A D | base.pass.cpp | 32 CopyableView base1 = transformView.base(); in test() local 34 assert(std::ranges::begin(base1) == globalBuff); in test() 43 const CopyableView base1 = transformView.base(); in test() local 45 assert(std::ranges::begin(base1) == globalBuff); in test()
|
/dports/graphics/R-cran-shape/shape/R/ |
H A D | cylindersegment.R | 9 base1 <- mid ; base1[1]<-mid[1]-len/2 functionVar 19 ex <- base1[1] + rx * cos(x) 20 ey <- base1[2] + ry * sin(x)
|
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/libcxx/test/std/ranges/range.adaptors/range.transform/ |
H A D | base.pass.cpp | 31 CopyableView base1 = transformView.base(); in test() local 33 assert(std::ranges::begin(base1) == globalBuff); in test() 42 const CopyableView base1 = transformView.base(); in test() local 44 assert(std::ranges::begin(base1) == globalBuff); in test()
|
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/libcxx/test/std/ranges/range.adaptors/range.transform/ |
H A D | base.pass.cpp | 32 CopyableView base1 = transformView.base(); in test() local 34 assert(std::ranges::begin(base1) == globalBuff); in test() 43 const CopyableView base1 = transformView.base(); in test() local 45 assert(std::ranges::begin(base1) == globalBuff); in test()
|
/dports/devel/llvm13/llvm-project-13.0.1.src/libcxx/test/std/ranges/range.adaptors/range.transform/ |
H A D | base.pass.cpp | 32 CopyableView base1 = transformView.base(); in test() local 34 assert(std::ranges::begin(base1) == globalBuff); in test() 43 const CopyableView base1 = transformView.base(); in test() local 45 assert(std::ranges::begin(base1) == globalBuff); in test()
|
/dports/biology/artemis/artemis-17.0.1-11-g3e43d27e/uk/ac/sanger/artemis/plot/ |
H A D | CodonUsageAlgorithm.java | 121 final char base1 = sequence[i]; in getValues() local 126 usage_data.getCodonValue(base1, base2, base3); in getValues() 140 final char base1 = Bases.complement(sequence[i + 2]); in getValues() local 145 usage_data.getCodonValue(base1, base2, base3); in getValues() 264 final char base1 = sequence.charAt (i); in getFeatureScore() local 269 usage_data.getCodonValue (base1, base2, base3); in getFeatureScore()
|
/dports/science/gabedit/GabeditSrc251_300720/utils/Dalton/SGE/ |
H A D | submitDalton | 70 base1=`echo $queue | awk '{split($0,a,"lin"); print a[1]}'` 72 if ( test $base1 != $base2 ) 74 base1=`echo $queue | awk '{split($0,a,"proc"); print a[1]}'` 76 if ( test $base1 != $base2 )
|
/dports/math/spooles-mpich/spooles.2.2_SHARED/Drand/src/ |
H A D | init.c | 49 if ( drand == NULL || u <= 0 || u >= drand->base1 ) { in Drand_setSeed() 52 drand, u, drand->base1) ; in Drand_setSeed() 75 || u <= 0 || u >= drand->base1 in Drand_setSeeds() 80 drand, u, v, drand->base1, drand->base2) ; in Drand_setSeeds()
|
/dports/math/spooles/spooles.2.2_SHARED/Drand/src/ |
H A D | init.c | 49 if ( drand == NULL || u <= 0 || u >= drand->base1 ) { in Drand_setSeed() 52 drand, u, drand->base1) ; in Drand_setSeed() 75 || u <= 0 || u >= drand->base1 in Drand_setSeeds() 80 drand, u, v, drand->base1, drand->base2) ; in Drand_setSeeds()
|
/dports/math/spooles-mpich/spooles.2.2/Drand/src/ |
H A D | init.c | 49 if ( drand == NULL || u <= 0 || u >= drand->base1 ) { in Drand_setSeed() 52 drand, u, drand->base1) ; in Drand_setSeed() 75 || u <= 0 || u >= drand->base1 in Drand_setSeeds() 80 drand, u, v, drand->base1, drand->base2) ; in Drand_setSeeds()
|
/dports/math/spooles/spooles.2.2/Drand/src/ |
H A D | init.c | 49 if ( drand == NULL || u <= 0 || u >= drand->base1 ) { in Drand_setSeed() 52 drand, u, drand->base1) ; in Drand_setSeed() 75 || u <= 0 || u >= drand->base1 in Drand_setSeeds() 80 drand, u, v, drand->base1, drand->base2) ; in Drand_setSeeds()
|
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/testsuite/g++.old-deja/g++.mike/ |
H A D | opr-dot1.C | 3 typedef struct base1 { struct 11 class derived1 : public base1 { argument 20 fails.base1::x = 5; in test1()
|
/dports/lang/gcc9/gcc-9.4.0/gcc/testsuite/g++.old-deja/g++.mike/ |
H A D | opr-dot1.C | 3 typedef struct base1 { struct 11 class derived1 : public base1 { argument 20 fails.base1::x = 5; in test1()
|
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/testsuite/g++.old-deja/g++.mike/ |
H A D | opr-dot1.C | 3 typedef struct base1 { struct 11 class derived1 : public base1 { argument 20 fails.base1::x = 5; in test1()
|
/dports/devel/riscv64-gcc/gcc-8.3.0/gcc/testsuite/g++.old-deja/g++.mike/ |
H A D | opr-dot1.C | 3 typedef struct base1 { struct 11 class derived1 : public base1 { argument 20 fails.base1::x = 5; in test1()
|
/dports/devel/avr-gcc/gcc-10.2.0/gcc/testsuite/g++.old-deja/g++.mike/ |
H A D | opr-dot1.C | 3 typedef struct base1 { struct 11 class derived1 : public base1 { argument 20 fails.base1::x = 5; in test1()
|
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/testsuite/g++.old-deja/g++.mike/ |
H A D | opr-dot1.C | 3 typedef struct base1 { struct 11 class derived1 : public base1 { argument 20 fails.base1::x = 5; in test1()
|