Home
last modified time | relevance | path

Searched refs:len1 (Results 76 – 100 of 7402) sorted by relevance

12345678910>>...297

/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/java.base/share/classes/java/util/
H A DComparableTimSort.java469 len1 -= k; in mergeAt()
470 if (len1 == 0) in mergeAt()
484 if (len1 <= len2) in mergeAt()
653 assert len1 > 0 && len2 > 0 && base1 + len1 == base2;
670 if (len1 == 1) {
743 if (len1 == 1) {
770 assert len1 > 0 && len2 > 0 && base1 + len1 == base2;
784 if (--len1 == 0) {
789 dest -= len1;
830 count1 = len1 - gallopRight((Comparable) tmp[cursor2], a, base1, len1, len1 - 1);
[all …]
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/jdk/src/share/classes/java/util/
H A DComparableTimSort.java465 len1 -= k; in mergeAt()
466 if (len1 == 0) in mergeAt()
480 if (len1 <= len2) in mergeAt()
649 assert len1 > 0 && len2 > 0 && base1 + len1 == base2;
666 if (len1 == 1) {
739 if (len1 == 1) {
766 assert len1 > 0 && len2 > 0 && base1 + len1 == base2;
780 if (--len1 == 0) {
785 dest -= len1;
826 count1 = len1 - gallopRight((Comparable) tmp[cursor2], a, base1, len1, len1 - 1);
[all …]
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/java.base/share/classes/java/util/
H A DComparableTimSort.java469 len1 -= k; in mergeAt()
470 if (len1 == 0) in mergeAt()
484 if (len1 <= len2) in mergeAt()
653 assert len1 > 0 && len2 > 0 && base1 + len1 == base2;
670 if (len1 == 1) {
743 if (len1 == 1) {
770 assert len1 > 0 && len2 > 0 && base1 + len1 == base2;
784 if (--len1 == 0) {
789 dest -= len1;
830 count1 = len1 - gallopRight((Comparable) tmp[cursor2], a, base1, len1, len1 - 1);
[all …]
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/java.base/share/classes/java/util/
H A DComparableTimSort.java469 len1 -= k; in mergeAt()
470 if (len1 == 0) in mergeAt()
484 if (len1 <= len2) in mergeAt()
653 assert len1 > 0 && len2 > 0 && base1 + len1 == base2;
670 if (len1 == 1) {
743 if (len1 == 1) {
770 assert len1 > 0 && len2 > 0 && base1 + len1 == base2;
784 if (--len1 == 0) {
789 dest -= len1;
830 count1 = len1 - gallopRight((Comparable) tmp[cursor2], a, base1, len1, len1 - 1);
[all …]
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/java.base/share/classes/java/util/
H A DComparableTimSort.java469 len1 -= k; in mergeAt()
470 if (len1 == 0) in mergeAt()
484 if (len1 <= len2) in mergeAt()
653 assert len1 > 0 && len2 > 0 && base1 + len1 == base2;
670 if (len1 == 1) {
743 if (len1 == 1) {
770 assert len1 > 0 && len2 > 0 && base1 + len1 == base2;
784 if (--len1 == 0) {
789 dest -= len1;
830 count1 = len1 - gallopRight((Comparable) tmp[cursor2], a, base1, len1, len1 - 1);
[all …]
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/java.base/share/classes/java/util/
H A DComparableTimSort.java469 len1 -= k; in mergeAt()
470 if (len1 == 0) in mergeAt()
484 if (len1 <= len2) in mergeAt()
653 assert len1 > 0 && len2 > 0 && base1 + len1 == base2;
670 if (len1 == 1) {
743 if (len1 == 1) {
770 assert len1 > 0 && len2 > 0 && base1 + len1 == base2;
784 if (--len1 == 0) {
789 dest -= len1;
830 count1 = len1 - gallopRight((Comparable) tmp[cursor2], a, base1, len1, len1 - 1);
[all …]
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/java.base/share/classes/java/util/
H A DComparableTimSort.java469 len1 -= k; in mergeAt()
470 if (len1 == 0) in mergeAt()
484 if (len1 <= len2) in mergeAt()
653 assert len1 > 0 && len2 > 0 && base1 + len1 == base2;
670 if (len1 == 1) {
743 if (len1 == 1) {
770 assert len1 > 0 && len2 > 0 && base1 + len1 == base2;
784 if (--len1 == 0) {
789 dest -= len1;
830 count1 = len1 - gallopRight((Comparable) tmp[cursor2], a, base1, len1, len1 - 1);
[all …]
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/java.base/share/classes/java/util/
H A DComparableTimSort.java469 len1 -= k; in mergeAt()
470 if (len1 == 0) in mergeAt()
484 if (len1 <= len2) in mergeAt()
653 assert len1 > 0 && len2 > 0 && base1 + len1 == base2;
670 if (len1 == 1) {
743 if (len1 == 1) {
770 assert len1 > 0 && len2 > 0 && base1 + len1 == base2;
784 if (--len1 == 0) {
789 dest -= len1;
830 count1 = len1 - gallopRight((Comparable) tmp[cursor2], a, base1, len1, len1 - 1);
[all …]
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/jdk/src/share/classes/java/util/
H A DComparableTimSort.java465 len1 -= k; in mergeAt()
466 if (len1 == 0) in mergeAt()
480 if (len1 <= len2) in mergeAt()
649 assert len1 > 0 && len2 > 0 && base1 + len1 == base2;
666 if (len1 == 1) {
739 if (len1 == 1) {
766 assert len1 > 0 && len2 > 0 && base1 + len1 == base2;
780 if (--len1 == 0) {
785 dest -= len1;
826 count1 = len1 - gallopRight((Comparable) tmp[cursor2], a, base1, len1, len1 - 1);
[all …]
/dports/math/e-antic/flint2-ae7ec89/fmpz_poly/
H A Dmullow_KS.c31 len1 = FLINT_MIN(len1, n); in _fmpz_poly_mullow_KS()
34 FMPZ_VEC_NORM(poly1, len1); in _fmpz_poly_mullow_KS()
37 if (!len1 | !len2) in _fmpz_poly_mullow_KS()
46 if (n > len1 + len2 - 1) in _fmpz_poly_mullow_KS()
48 _fmpz_vec_zero(res + len1 + len2 - 1, n - (len1 + len2 - 1)); in _fmpz_poly_mullow_KS()
49 n = len1 + len2 - 1; in _fmpz_poly_mullow_KS()
52 bits1 = _fmpz_vec_max_bits(poly1, len1); in _fmpz_poly_mullow_KS()
126 const slong len1 = poly1->length; in fmpz_poly_mullow_KS() local
129 if (len1 == 0 || len2 == 0 || n == 0) in fmpz_poly_mullow_KS()
135 n = FLINT_MIN(n, len1 + len2 - 1); in fmpz_poly_mullow_KS()
[all …]
H A Dcompose.c23 if (len1 == 1) in _fmpz_poly_compose()
26 _fmpz_poly_evaluate_fmpz(res, poly1, len1, poly2); in _fmpz_poly_compose()
27 else if (len1 <= 4) in _fmpz_poly_compose()
32 _fmpz_vec_set(res, poly1, len1); in _fmpz_poly_compose()
33 _fmpz_poly_taylor_shift(res, poly2, len1); in _fmpz_poly_compose()
37 for (i = 1; i < len1; i += 2) in _fmpz_poly_compose()
47 for (i = 0; i < len1; i++) in _fmpz_poly_compose()
66 const slong len1 = poly1->length; in fmpz_poly_compose() local
70 if (len1 == 0) in fmpz_poly_compose()
75 if (len1 == 1 || len2 == 0) in fmpz_poly_compose()
[all …]
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fmpz_poly/
H A Dmullow_KS.c31 len1 = FLINT_MIN(len1, n); in _fmpz_poly_mullow_KS()
34 FMPZ_VEC_NORM(poly1, len1); in _fmpz_poly_mullow_KS()
37 if (!len1 | !len2) in _fmpz_poly_mullow_KS()
46 if (n > len1 + len2 - 1) in _fmpz_poly_mullow_KS()
48 _fmpz_vec_zero(res + len1 + len2 - 1, n - (len1 + len2 - 1)); in _fmpz_poly_mullow_KS()
49 n = len1 + len2 - 1; in _fmpz_poly_mullow_KS()
52 bits1 = _fmpz_vec_max_bits(poly1, len1); in _fmpz_poly_mullow_KS()
126 const slong len1 = poly1->length; in fmpz_poly_mullow_KS() local
129 if (len1 == 0 || len2 == 0 || n == 0) in fmpz_poly_mullow_KS()
135 n = FLINT_MIN(n, len1 + len2 - 1); in fmpz_poly_mullow_KS()
[all …]
H A Dcompose.c23 if (len1 == 1) in _fmpz_poly_compose()
26 _fmpz_poly_evaluate_fmpz(res, poly1, len1, poly2); in _fmpz_poly_compose()
27 else if (len1 <= 4) in _fmpz_poly_compose()
32 _fmpz_vec_set(res, poly1, len1); in _fmpz_poly_compose()
33 _fmpz_poly_taylor_shift(res, poly2, len1); in _fmpz_poly_compose()
37 for (i = 1; i < len1; i += 2) in _fmpz_poly_compose()
47 for (i = 0; i < len1; i++) in _fmpz_poly_compose()
66 const slong len1 = poly1->length; in fmpz_poly_compose() local
70 if (len1 == 0) in fmpz_poly_compose()
75 if (len1 == 1 || len2 == 0) in fmpz_poly_compose()
[all …]
/dports/math/flint2/flint-2.8.4/fmpz_poly/
H A Dmullow_KS.c31 len1 = FLINT_MIN(len1, n); in _fmpz_poly_mullow_KS()
34 FMPZ_VEC_NORM(poly1, len1); in _fmpz_poly_mullow_KS()
37 if (!len1 | !len2) in _fmpz_poly_mullow_KS()
46 if (n > len1 + len2 - 1) in _fmpz_poly_mullow_KS()
48 _fmpz_vec_zero(res + len1 + len2 - 1, n - (len1 + len2 - 1)); in _fmpz_poly_mullow_KS()
49 n = len1 + len2 - 1; in _fmpz_poly_mullow_KS()
52 bits1 = _fmpz_vec_max_bits(poly1, len1); in _fmpz_poly_mullow_KS()
126 const slong len1 = poly1->length; in fmpz_poly_mullow_KS() local
129 if (len1 == 0 || len2 == 0 || n == 0) in fmpz_poly_mullow_KS()
135 n = FLINT_MIN(n, len1 + len2 - 1); in fmpz_poly_mullow_KS()
[all …]
H A Dcompose.c23 if (len1 == 1) in _fmpz_poly_compose()
26 _fmpz_poly_evaluate_fmpz(res, poly1, len1, poly2); in _fmpz_poly_compose()
27 else if (len1 <= 4) in _fmpz_poly_compose()
32 _fmpz_vec_set(res, poly1, len1); in _fmpz_poly_compose()
33 _fmpz_poly_taylor_shift(res, poly2, len1); in _fmpz_poly_compose()
37 for (i = 1; i < len1; i += 2) in _fmpz_poly_compose()
47 for (i = 0; i < len1; i++) in _fmpz_poly_compose()
66 const slong len1 = poly1->length; in fmpz_poly_compose() local
70 if (len1 == 0) in fmpz_poly_compose()
75 if (len1 == 1 || len2 == 0) in fmpz_poly_compose()
[all …]
/dports/benchmarks/stress-ng/stress-ng-0.13.09/
H A Dstress-str.c34 const size_t len1,
81 const size_t len1, in stress_strcasecmp() argument
117 const size_t len1, in stress_strncasecmp() argument
153 const size_t len1, in stress_index() argument
182 const size_t len1, in stress_rindex() argument
212 const size_t len1, in stress_strlcpy() argument
239 const size_t len1, in stress_strcpy() argument
267 const size_t len1, in stress_strlcat() argument
303 const size_t len1, in stress_strcat() argument
695 tmplen = len1; in stress_str()
[all …]
/dports/math/arb/arb-2.21.1/acb_poly/
H A Dmullow_transpose.c16 acb_srcptr poly1, slong len1, in _acb_poly_mullow_transpose() argument
23 len1 = FLINT_MIN(len1, n); in _acb_poly_mullow_transpose()
28 b = a + len1; in _acb_poly_mullow_transpose()
29 c = b + len1; in _acb_poly_mullow_transpose()
37 for (i = 0; i < len1; i++) in _acb_poly_mullow_transpose()
61 if (poly1 == poly2 && len1 == len2) in _acb_poly_mullow_transpose()
86 slong len1, len2; in acb_poly_mullow_transpose() local
88 len1 = poly1->length; in acb_poly_mullow_transpose()
91 if (len1 == 0 || len2 == 0 || n == 0) in acb_poly_mullow_transpose()
97 n = FLINT_MIN((len1 + len2 - 1), n); in acb_poly_mullow_transpose()
[all …]
/dports/shells/bash/bash-5.1/lib/sh/
H A Dmbscasecmp.c38 int len1, len2, mb_cur_max; local
41 len1 = len2 = 0;
48 len1 = mbtowc (&c1, mbs1, mb_cur_max);
51 if (len1 == 0)
55 else if (len1 > 0 && len2 < 0)
57 else if (len1 < 0 && len2 > 0)
59 else if (len1 < 0 && len2 < 0)
61 len1 = strlen (mbs1);
63 return (len1 == len2 ? memcmp (mbs1, mbs2, len1)
64 : ((len1 < len2) ? (memcmp (mbs1, mbs2, len1) > 0 ? 1 : -1)
[all …]
/dports/math/e-antic/flint2-ae7ec89/fmpq_poly/
H A Ddivides.c28 _fmpz_poly_content(c1, poly1, len1); in _fmpq_poly_divides()
33 poly1_pp = _fmpz_vec_init(len1); in _fmpq_poly_divides()
59 _fmpz_vec_clear(poly1_pp, len1); in _fmpq_poly_divides()
75 slong len1, len2; in fmpq_poly_divides() local
78 len1 = poly1->length; in fmpq_poly_divides()
83 if (len1 == 0) in fmpq_poly_divides()
97 if (len2 > len1) in fmpq_poly_divides()
100 fmpq_poly_fit_length(q, len1 - len2 + 1); in fmpq_poly_divides()
104 qpoly = _fmpz_vec_init(len1 - len2 + 1); in fmpq_poly_divides()
114 _fmpz_vec_clear(qpoly, len1 - len2 + 1); in fmpq_poly_divides()
[all …]
/dports/math/flint2/flint-2.8.4/fmpq_poly/
H A Ddivides.c28 _fmpz_poly_content(c1, poly1, len1); in _fmpq_poly_divides()
33 poly1_pp = _fmpz_vec_init(len1); in _fmpq_poly_divides()
59 _fmpz_vec_clear(poly1_pp, len1); in _fmpq_poly_divides()
75 slong len1, len2; in fmpq_poly_divides() local
78 len1 = poly1->length; in fmpq_poly_divides()
83 if (len1 == 0) in fmpq_poly_divides()
97 if (len2 > len1) in fmpq_poly_divides()
100 fmpq_poly_fit_length(q, len1 - len2 + 1); in fmpq_poly_divides()
104 qpoly = _fmpz_vec_init(len1 - len2 + 1); in fmpq_poly_divides()
114 _fmpz_vec_clear(qpoly, len1 - len2 + 1); in fmpq_poly_divides()
[all …]
/dports/math/e-antic/e-antic-1.0.0-rc.13/libeantic/upstream/antic/fmpq_poly/
H A Ddivides.c28 _fmpz_poly_content(c1, poly1, len1); in _fmpq_poly_divides()
33 poly1_pp = _fmpz_vec_init(len1); in _fmpq_poly_divides()
59 _fmpz_vec_clear(poly1_pp, len1); in _fmpq_poly_divides()
75 slong len1, len2; in fmpq_poly_divides() local
78 len1 = poly1->length; in fmpq_poly_divides()
83 if (len1 == 0) in fmpq_poly_divides()
97 if (len2 > len1) in fmpq_poly_divides()
100 fmpq_poly_fit_length(q, len1 - len2 + 1); in fmpq_poly_divides()
104 qpoly = _fmpz_vec_init(len1 - len2 + 1); in fmpq_poly_divides()
114 _fmpz_vec_clear(qpoly, len1 - len2 + 1); in fmpq_poly_divides()
[all …]
/dports/math/sound-of-sorting/sound-of-sorting-5884a35/src/algorithms/
H A Dtimsort.cpp290 len1 -= k; in mergeAt()
292 if(len1 == 0) { in mergeAt()
302 if(len1 <= len2) { in mergeAt()
405 assert( len1 > 0 && len2 > 0 && base1 + len1 == base2 ); in mergeLo()
418 if(len1 == 1) { in mergeLo()
510 if(len1 == 1) { in mergeLo()
524 assert( len1 > 0 && len2 > 0 && base1 + len1 == base2 ); in mergeHi()
533 if(--len1 == 0) { in mergeHi()
540 std::copy_backward(cursor1 + 1, cursor1 + (1 + len1), dest + (1 + len1)); in mergeHi()
582 count1 = len1 - gallopRight(*cursor2, base1, len1, len1 - 1); in mergeHi()
[all …]
/dports/science/eccodes/eccodes-2.23.0-Source/examples/F90/
H A Dgrib_read_from_file.f9038 integer(kind=kindOfSize_t) :: len1 ! For large messages local
44 len1 = size
45 call codes_read_from_file(ifile, buffer, len1, iret)
49 if (len1 /= message_lengths(count1)) then
53 len1 = size
54 call codes_read_from_file(ifile, buffer, len1, iret)
75 integer :: len1 local
81 len1 = size
82 call codes_read_from_file(ifile, buffer, len1, iret)
86 if (len1 /= message_lengths(count1)) then
[all …]
/dports/devel/stringencoders/stringencoders-v3.10.3/test/
H A Dmodp_bjavascript_test.c17 const int len1 = strlen(s1); in testNoEscape() local
18 int d = modp_bjavascript_encode(buf, s1, len1); in testNoEscape()
20 mu_assert_int_equals(len1, d); in testNoEscape()
23 int sz = modp_bjavascript_encode_strlen(s1, len1); in testNoEscape()
24 mu_assert_int_equals(sz, len1); in testNoEscape()
34 const int len1 = strlen(s1); in testSimpleEscape() local
36 int d = modp_bjavascript_encode(buf, s1, len1); in testSimpleEscape()
62 const int len1 = strlen(s1); in testSQuoteEscape() local
64 int d = modp_bjavascript_encode(buf, s1, len1); in testSQuoteEscape()
87 const int len1 = strlen(s1); in testDQuoteEscape() local
[all …]
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/java.base/share/classes/java/util/
H A DTimSort.java503 len1 -= k; in mergeAt()
504 if (len1 == 0) in mergeAt()
517 if (len1 <= len2) in mergeAt()
686 assert len1 > 0 && len2 > 0 && base1 + len1 == base2;
702 if (len1 == 1) {
776 if (len1 == 1) {
802 assert len1 > 0 && len2 > 0 && base1 + len1 == base2;
816 if (--len1 == 0) {
821 dest -= len1;
863 count1 = len1 - gallopRight(tmp[cursor2], a, base1, len1, len1 - 1, c);
[all …]

12345678910>>...297