/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/test/Transforms/InstCombine/ |
H A D | intptr1.ll | 27 %cmp1 = icmp ult float* %a, %a_end 46 %cmp = icmp ult float* %incdec.ptr, %a_end 80 %cmp1 = icmp ult float* %a, %a_end 93 %ptrcmp = icmp ult float* %tmp, %a_end 103 %cmp = icmp ult float* %incdec.ptr, %a_end 135 %cmp1 = icmp ult float* %a, %a_end 155 %cmp = icmp ult float* %incdec.ptr, %a_end 187 %cmp1 = icmp ult float* %a, %a_end 207 %cmp = icmp ult float* %incdec.ptr, %a_end 237 %cmp1 = icmp ult float* %a, %a_end [all …]
|
/dports/graphics/llvm-mesa/llvm-13.0.1.src/test/Transforms/InstCombine/ |
H A D | intptr1.ll | 27 %cmp1 = icmp ult float* %a, %a_end 46 %cmp = icmp ult float* %incdec.ptr, %a_end 80 %cmp1 = icmp ult float* %a, %a_end 93 %ptrcmp = icmp ult float* %tmp, %a_end 103 %cmp = icmp ult float* %incdec.ptr, %a_end 135 %cmp1 = icmp ult float* %a, %a_end 155 %cmp = icmp ult float* %incdec.ptr, %a_end 187 %cmp1 = icmp ult float* %a, %a_end 207 %cmp = icmp ult float* %incdec.ptr, %a_end 237 %cmp1 = icmp ult float* %a, %a_end [all …]
|
/dports/devel/llvm13/llvm-project-13.0.1.src/llvm/test/Transforms/InstCombine/ |
H A D | intptr1.ll | 27 %cmp1 = icmp ult float* %a, %a_end 46 %cmp = icmp ult float* %incdec.ptr, %a_end 80 %cmp1 = icmp ult float* %a, %a_end 93 %ptrcmp = icmp ult float* %tmp, %a_end 103 %cmp = icmp ult float* %incdec.ptr, %a_end 135 %cmp1 = icmp ult float* %a, %a_end 155 %cmp = icmp ult float* %incdec.ptr, %a_end 187 %cmp1 = icmp ult float* %a, %a_end 207 %cmp = icmp ult float* %incdec.ptr, %a_end 237 %cmp1 = icmp ult float* %a, %a_end [all …]
|
/dports/biology/canu/canu-2.2/src/correction/ |
H A D | generateCorrectionLayouts.C | 99 … ovl[oo].b_iid, ovl[oo].a_bgn(), ovl[oo].a_end(), ovlLength, ovl[oo].erate(), maxEvidenceErate); in generateLayout() 103 if (ovl[oo].a_end() - ovl[oo].a_bgn() < minEvidenceLength) { in generateLayout() 106 … ovl[oo].b_iid, ovl[oo].a_bgn(), ovl[oo].a_end(), ovlLength, ovl[oo].erate(), minEvidenceLength); in generateLayout() 114 …ovl[oo].b_iid, ovl[oo].a_bgn(), ovl[oo].a_end(), ovlLength, ovl[oo].erate(), ovlScore, olapThresh[… in generateLayout() 121 ovl[oo].b_iid, ovl[oo].a_bgn(), ovl[oo].a_end(), ovlLength, ovl[oo].erate()); in generateLayout() 127 …ovl[oo].b_iid, ovl[oo].a_bgn(), ovl[oo].a_end(), ovlLength, ovl[oo].erate(), ovlScore, olapThresh[… in generateLayout() 139 ovl[oo].a_bgn(), ovl[oo].a_end()); in generateLayout() 146 ovl[oo].a_end(), ovl[oo].a_bgn()); in generateLayout()
|
/dports/devel/boost-docs/boost_1_72_0/libs/algorithm/test/ |
H A D | ordered_test.cpp | 26 #define a_end(v) (v + elementsof (v)) macro 28 #define b_e(v) a_begin(v),a_end(v) 55 …rted_until ( b_e(strictlyIncreasingValues)) == a_end(strictlyIncreasing… in test_ordered() 56 …rted_until ( b_e(strictlyIncreasingValues), std::less<int>()) == a_end(strictlyIncreasing… in test_ordered() 61 …BOOST_CHECK ( ba::is_sorted_until ( b_e(constantValues), std::less<int>()) == a_end(con… in test_ordered() 63 …BOOST_CHECK ( ba::is_sorted_until ( b_e(nonConstantArray), std::less<int>()) == a_end(non… in test_ordered() 83 …strictlyIncreasingValues), boost::end(strictlyIncreasingValues), less) == a_end(strictlyIncreasing… in test_ordered()
|
/dports/devel/boost-libs/boost_1_72_0/libs/algorithm/test/ |
H A D | ordered_test.cpp | 26 #define a_end(v) (v + elementsof (v)) macro 28 #define b_e(v) a_begin(v),a_end(v) 55 …rted_until ( b_e(strictlyIncreasingValues)) == a_end(strictlyIncreasing… in test_ordered() 56 …rted_until ( b_e(strictlyIncreasingValues), std::less<int>()) == a_end(strictlyIncreasing… in test_ordered() 61 …BOOST_CHECK ( ba::is_sorted_until ( b_e(constantValues), std::less<int>()) == a_end(con… in test_ordered() 63 …BOOST_CHECK ( ba::is_sorted_until ( b_e(nonConstantArray), std::less<int>()) == a_end(non… in test_ordered() 83 …strictlyIncreasingValues), boost::end(strictlyIncreasingValues), less) == a_end(strictlyIncreasing… in test_ordered()
|
/dports/devel/boost-python-libs/boost_1_72_0/libs/algorithm/test/ |
H A D | ordered_test.cpp | 26 #define a_end(v) (v + elementsof (v)) macro 28 #define b_e(v) a_begin(v),a_end(v) 55 …rted_until ( b_e(strictlyIncreasingValues)) == a_end(strictlyIncreasing… in test_ordered() 56 …rted_until ( b_e(strictlyIncreasingValues), std::less<int>()) == a_end(strictlyIncreasing… in test_ordered() 61 …BOOST_CHECK ( ba::is_sorted_until ( b_e(constantValues), std::less<int>()) == a_end(con… in test_ordered() 63 …BOOST_CHECK ( ba::is_sorted_until ( b_e(nonConstantArray), std::less<int>()) == a_end(non… in test_ordered() 83 …strictlyIncreasingValues), boost::end(strictlyIncreasingValues), less) == a_end(strictlyIncreasing… in test_ordered()
|
/dports/devel/hyperscan/boost_1_75_0/libs/algorithm/test/ |
H A D | ordered_test.cpp | 26 #define a_end(v) (v + elementsof (v)) macro 28 #define b_e(v) a_begin(v),a_end(v) 55 …rted_until ( b_e(strictlyIncreasingValues)) == a_end(strictlyIncreasing… in test_ordered() 56 …rted_until ( b_e(strictlyIncreasingValues), std::less<int>()) == a_end(strictlyIncreasing… in test_ordered() 61 …BOOST_CHECK ( ba::is_sorted_until ( b_e(constantValues), std::less<int>()) == a_end(con… in test_ordered() 63 …BOOST_CHECK ( ba::is_sorted_until ( b_e(nonConstantArray), std::less<int>()) == a_end(non… in test_ordered() 83 …strictlyIncreasingValues), boost::end(strictlyIncreasingValues), less) == a_end(strictlyIncreasing… in test_ordered()
|
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/algorithm/test/ |
H A D | ordered_test.cpp | 26 #define a_end(v) (v + elementsof (v)) macro 28 #define b_e(v) a_begin(v),a_end(v) 53 …rted_until ( b_e(strictlyIncreasingValues)) == a_end(strictlyIncreasing… in test_ordered() 54 …rted_until ( b_e(strictlyIncreasingValues), std::less<int>()) == a_end(strictlyIncreasing… in test_ordered() 59 …BOOST_CHECK ( ba::is_sorted_until ( b_e(constantValues), std::less<int>()) == a_end(con… in test_ordered() 61 …BOOST_CHECK ( ba::is_sorted_until ( b_e(nonConstantArray), std::less<int>()) == a_end(non… in test_ordered()
|
/dports/databases/xtrabackup/boost_1_59_0/libs/algorithm/test/ |
H A D | ordered_test.cpp | 26 #define a_end(v) (v + elementsof (v)) macro 28 #define b_e(v) a_begin(v),a_end(v) 53 …rted_until ( b_e(strictlyIncreasingValues)) == a_end(strictlyIncreasing… in test_ordered() 54 …rted_until ( b_e(strictlyIncreasingValues), std::less<int>()) == a_end(strictlyIncreasing… in test_ordered() 59 …BOOST_CHECK ( ba::is_sorted_until ( b_e(constantValues), std::less<int>()) == a_end(con… in test_ordered() 61 …BOOST_CHECK ( ba::is_sorted_until ( b_e(nonConstantArray), std::less<int>()) == a_end(non… in test_ordered()
|
/dports/databases/percona57-server/boost_1_59_0/libs/algorithm/test/ |
H A D | ordered_test.cpp | 26 #define a_end(v) (v + elementsof (v)) macro 28 #define b_e(v) a_begin(v),a_end(v) 53 …rted_until ( b_e(strictlyIncreasingValues)) == a_end(strictlyIncreasing… in test_ordered() 54 …rted_until ( b_e(strictlyIncreasingValues), std::less<int>()) == a_end(strictlyIncreasing… in test_ordered() 59 …BOOST_CHECK ( ba::is_sorted_until ( b_e(constantValues), std::less<int>()) == a_end(con… in test_ordered() 61 …BOOST_CHECK ( ba::is_sorted_until ( b_e(nonConstantArray), std::less<int>()) == a_end(non… in test_ordered()
|
/dports/databases/percona57-client/boost_1_59_0/libs/algorithm/test/ |
H A D | ordered_test.cpp | 26 #define a_end(v) (v + elementsof (v)) macro 28 #define b_e(v) a_begin(v),a_end(v) 53 …rted_until ( b_e(strictlyIncreasingValues)) == a_end(strictlyIncreasing… in test_ordered() 54 …rted_until ( b_e(strictlyIncreasingValues), std::less<int>()) == a_end(strictlyIncreasing… in test_ordered() 59 …BOOST_CHECK ( ba::is_sorted_until ( b_e(constantValues), std::less<int>()) == a_end(con… in test_ordered() 61 …BOOST_CHECK ( ba::is_sorted_until ( b_e(nonConstantArray), std::less<int>()) == a_end(non… in test_ordered()
|
/dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/algorithm/test/ |
H A D | ordered_test.cpp | 26 #define a_end(v) (v + elementsof (v)) macro 28 #define b_e(v) a_begin(v),a_end(v) 53 …rted_until ( b_e(strictlyIncreasingValues)) == a_end(strictlyIncreasing… in test_ordered() 54 …rted_until ( b_e(strictlyIncreasingValues), std::less<int>()) == a_end(strictlyIncreasing… in test_ordered() 59 …BOOST_CHECK ( ba::is_sorted_until ( b_e(constantValues), std::less<int>()) == a_end(con… in test_ordered() 61 …BOOST_CHECK ( ba::is_sorted_until ( b_e(nonConstantArray), std::less<int>()) == a_end(non… in test_ordered()
|
/dports/graphics/opendx/dx-4.4.4/src/exec/dxmods/ |
H A D | enumerate.c | 171 Array a_start = NULL, a_end = NULL, a_delta = NULL; in MakeLinearList() local 252 a_end = DXArrayConvertV(end, t, c, rank, shape); in MakeLinearList() 260 i_end = *(int *)DXGetArrayData(a_end); in MakeLinearList() 280 i_end = *(int *)DXGetArrayData(a_end); in MakeLinearList() 303 i_end = *(int *)DXGetArrayData(a_end); in MakeLinearList() 331 f_end = *(float *)DXGetArrayData(a_end); in MakeLinearList() 351 f_end = *(float *)DXGetArrayData(a_end); in MakeLinearList() 373 f_end = *(float *)DXGetArrayData(a_end); in MakeLinearList() 409 DXDelete((Object)a_end); in MakeLinearList() 695 DXDelete((Object)a_end); in MakeLinearList() [all …]
|
/dports/databases/pgrouting/pgrouting-3.2.0/src/transitiveClosure/ |
H A D | transitiveClosure_driver.cpp | 62 boost::graph_traits < boost::adjacency_list <> >::adjacency_iterator ai, a_end; in get_postgres_result() local 68 boost::tie(ai, a_end) = adjacent_vertices(u, TC); in get_postgres_result() 69 size_t adj_siz = static_cast<size_t>(a_end - ai); in get_postgres_result() 72 for (; ai != a_end; ++ai) { in get_postgres_result()
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/blink/renderer/platform/wtf/text/ |
H A D | utf8.cc | 420 const CharType* a_end, in EqualWithUTF8Internal() argument 458 return a == a_end; in EqualWithUTF8Internal() 462 const UChar* a_end, in EqualUTF16WithUTF8() argument 465 return EqualWithUTF8Internal(a, a_end, b, b_end); in EqualUTF16WithUTF8() 469 const LChar* a_end, in EqualLatin1WithUTF8() argument 472 return EqualWithUTF8Internal(a, a_end, b, b_end); in EqualLatin1WithUTF8()
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/blink/renderer/platform/wtf/text/ |
H A D | utf8.cc | 420 const CharType* a_end, in EqualWithUTF8Internal() argument 458 return a == a_end; in EqualWithUTF8Internal() 462 const UChar* a_end, in EqualUTF16WithUTF8() argument 465 return EqualWithUTF8Internal(a, a_end, b, b_end); in EqualUTF16WithUTF8() 469 const LChar* a_end, in EqualLatin1WithUTF8() argument 472 return EqualWithUTF8Internal(a, a_end, b, b_end); in EqualLatin1WithUTF8()
|
/dports/net/py-pypacker/pypacker-268e27c813545bf7995dd0a80abdb4da24d64722/pypacker/layer567/ |
H A D | dns.py | 312 a_end = off + DNS.get_dns_length(buf[off:]) + 2 + 2 + 4 314 dlen = unpack_H(buf[a_end: a_end + 2])[0] 317 a_end += (2 + dlen) 319 a = DNS.Answer(buf[off: a_end]) 323 off = a_end
|
/dports/shells/fish/fish-3.3.1/src/ |
H A D | util.cpp | 20 const wchar_t *a_end, *b_end; in wcsfilecmp_leading_digits() local 22 long a_num = fish_wcstol(*a, &a_end, 10); in wcsfilecmp_leading_digits() 29 *a = a_end; in wcsfilecmp_leading_digits()
|
/dports/www/ilias/ILIAS-5.4.25/Services/MathJax/classes/ |
H A D | class.ilMathJax.php | 310 * @param string $a_end end tag to be converted 316 …public function insertLatexImages($a_text, $a_start = '[tex]', $a_end = '[/tex]', $a_dir = null, $… argument 327 $a_end = str_replace("\\", "", $a_end); 334 if (is_int($epos = ilStr::strIPos($a_text, $a_end, $spos + ilStr::strLen($a_start)))) { 353 $cpos = $epos + ilStr::strLen($a_end); 391 …::subStr($a_text, 0, $spos) . $replacement . ilStr::subStr($a_text, $epos + ilStr::strLen($a_end));
|
/dports/databases/mariadb104-server/mariadb-10.4.24/strings/ |
H A D | ctype-latin1.c | 593 const uchar *a_end= a + a_length; in my_strnncoll_latin1_de() local 597 while ((a < a_end || a_extend) && (b < b_end || b_extend)) in my_strnncoll_latin1_de() 624 return ((a < a_end || a_extend) ? (b_is_prefix ? 0 : 1) : in my_strnncoll_latin1_de() 633 const uchar *a_end= a + a_length, *b_end= b + b_length; in my_strnncollsp_latin1_de() local 636 while ((a < a_end || a_extend) && (b < b_end || b_extend)) in my_strnncollsp_latin1_de() 667 if (a < a_end) in my_strnncollsp_latin1_de() 668 return my_strnncollsp_padspace_bin(a, a_end - a); in my_strnncollsp_latin1_de()
|
/dports/databases/mariadb104-client/mariadb-10.4.24/strings/ |
H A D | ctype-latin1.c | 593 const uchar *a_end= a + a_length; 597 while ((a < a_end || a_extend) && (b < b_end || b_extend)) 624 return ((a < a_end || a_extend) ? (b_is_prefix ? 0 : 1) : 633 const uchar *a_end= a + a_length, *b_end= b + b_length; 636 while ((a < a_end || a_extend) && (b < b_end || b_extend)) 667 if (a < a_end) 668 return my_strnncollsp_padspace_bin(a, a_end - a);
|
/dports/databases/mariadb105-client/mariadb-10.5.15/strings/ |
H A D | ctype-latin1.c | 596 const uchar *a_end= a + a_length; in my_strnncoll_latin1_de() local 600 while ((a < a_end || a_extend) && (b < b_end || b_extend)) in my_strnncoll_latin1_de() 627 return ((a < a_end || a_extend) ? (b_is_prefix ? 0 : 1) : in my_strnncoll_latin1_de() 636 const uchar *a_end= a + a_length, *b_end= b + b_length; in my_strnncollsp_latin1_de() local 639 while ((a < a_end || a_extend) && (b < b_end || b_extend)) in my_strnncollsp_latin1_de() 670 if (a < a_end) in my_strnncollsp_latin1_de() 671 return my_strnncollsp_padspace_bin(a, a_end - a); in my_strnncollsp_latin1_de()
|
/dports/www/ilias6/ILIAS-6.14/Services/MathJax/classes/ |
H A D | class.ilMathJax.php | 310 * @param string $a_end end tag to be converted 316 …public function insertLatexImages($a_text, $a_start = '[tex]', $a_end = '[/tex]', $a_dir = null, $… argument 327 $a_end = str_replace("\\", "", $a_end); 334 if (is_int($epos = ilStr::strIPos($a_text, $a_end, $spos + ilStr::strLen($a_start)))) { 353 $cpos = $epos + ilStr::strLen($a_end); 391 …::subStr($a_text, 0, $spos) . $replacement . ilStr::subStr($a_text, $epos + ilStr::strLen($a_end));
|
/dports/databases/mariadb103-client/mariadb-10.3.34/strings/ |
H A D | ctype-latin1.c | 593 const uchar *a_end= a + a_length; in my_strnncoll_latin1_de() local 597 while ((a < a_end || a_extend) && (b < b_end || b_extend)) in my_strnncoll_latin1_de() 624 return ((a < a_end || a_extend) ? (b_is_prefix ? 0 : 1) : in my_strnncoll_latin1_de() 633 const uchar *a_end= a + a_length, *b_end= b + b_length; in my_strnncollsp_latin1_de() local 636 while ((a < a_end || a_extend) && (b < b_end || b_extend)) in my_strnncollsp_latin1_de() 667 if (a < a_end) in my_strnncollsp_latin1_de() 668 return my_strnncollsp_padspace_bin(a, a_end - a); in my_strnncollsp_latin1_de()
|