| /external/llvm-project/polly/lib/External/isl/ |
| D | isl_fold.c | 436 __isl_take isl_qpolynomial_fold *fold1, in isl_qpolynomial_fold_fold_on_domain() argument
444 if (!fold1 || !fold2) in isl_qpolynomial_fold_fold_on_domain()
447 isl_assert(fold1->dim->ctx, fold1->type == fold2->type, goto error); in isl_qpolynomial_fold_fold_on_domain()
448 isl_assert(fold1->dim->ctx, isl_space_is_equal(fold1->dim, fold2->dim), in isl_qpolynomial_fold_fold_on_domain()
451 better = fold1->type == isl_fold_max ? -1 : 1; in isl_qpolynomial_fold_fold_on_domain()
453 if (isl_qpolynomial_fold_is_empty(fold1) || in isl_qpolynomial_fold_fold_on_domain()
455 isl_qpolynomial_fold_free(fold1); in isl_qpolynomial_fold_fold_on_domain()
460 isl_qpolynomial_fold_is_nan(fold1)) { in isl_qpolynomial_fold_fold_on_domain()
462 return fold1; in isl_qpolynomial_fold_fold_on_domain()
465 res = qpolynomial_fold_alloc(fold1->type, isl_space_copy(fold1->dim), in isl_qpolynomial_fold_fold_on_domain()
[all …]
|
| D | isl_polynomial_private.h | 210 __isl_take isl_qpolynomial_fold *fold1,
214 __isl_take isl_qpolynomial_fold *fold1,
217 int isl_qpolynomial_fold_plain_cmp(__isl_keep isl_qpolynomial_fold *fold1,
|
| /external/rust/crates/itertools/benches/ |
| D | tree_fold1.rs | 21 stack.into_iter().fold1(f) in tree_fold1_vec()
82 fold1,
100 fold1,
118 fold1,
|
| /external/icu/icu4c/source/common/ |
| D | unormcmp.cpp | 163 UChar fold1[UCASE_MAX_STRING_LENGTH+1], fold2[UCASE_MAX_STRING_LENGTH+1]; in unorm_cmpEquivFold() local
344 u_memcpy(fold1, p, length); in unorm_cmpEquivFold()
347 U16_APPEND_UNSAFE(fold1, i, length); in unorm_cmpEquivFold()
352 start1=s1=fold1; in unorm_cmpEquivFold()
353 limit1=fold1+length; in unorm_cmpEquivFold()
|
| D | ustrcase.cpp | 1419 UChar fold1[UCASE_MAX_STRING_LENGTH+1], fold2[UCASE_MAX_STRING_LENGTH+1]; in _cmpFold() local
1643 u_memcpy(fold1, p, length); in _cmpFold()
1646 U16_APPEND_UNSAFE(fold1, i, length); in _cmpFold()
1651 start1=s1=fold1; in _cmpFold()
1652 limit1=fold1+length; in _cmpFold()
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| D | Normalizer.java | 2179 StringBuilder fold1, fold2; in cmpEquivFold() local
2203 fold1=new StringBuilder(); in cmpEquivFold()
2207 fold1=fold2=null; in cmpEquivFold()
2328 (length=csp.toFullFolding(cp1, fold1, options))>=0 in cmpEquivFold()
2359 fold1.delete(0, fold1.length()-length); in cmpEquivFold()
2361 fold1.setLength(0); in cmpEquivFold()
2362 fold1.appendCodePoint(length); in cmpEquivFold()
2366 cs1=fold1; in cmpEquivFold()
2368 limit1=fold1.length(); in cmpEquivFold()
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| D | Normalizer.java | 2128 StringBuilder fold1, fold2; in cmpEquivFold() local
2152 fold1=new StringBuilder(); in cmpEquivFold()
2156 fold1=fold2=null; in cmpEquivFold()
2277 (length=csp.toFullFolding(cp1, fold1, options))>=0 in cmpEquivFold()
2308 fold1.delete(0, fold1.length()-length); in cmpEquivFold()
2310 fold1.setLength(0); in cmpEquivFold()
2311 fold1.appendCodePoint(length); in cmpEquivFold()
2315 cs1=fold1; in cmpEquivFold()
2317 limit1=fold1.length(); in cmpEquivFold()
|
| /external/rust/crates/itertools/src/ |
| D | concat_impl.rs | 21 iterable.into_iter().fold1(|mut a, b| { a.extend(b); a }).unwrap_or_else(<_>::default) in concat()
|
| D | kmerge_impl.rs | 214 .fold1(size_hint::add) in size_hint()
|
| D | lib.rs | 2004 fn fold1<F>(mut self, f: F) -> Option<Self::Item> in fold1() method
|
| /external/rust/crates/grpcio-sys/grpc/third_party/re2/ |
| D | ucs2.diff | 46 - void AddUCS2Pair(uint8 lo1, uint8 hi1, bool fold1,
86 - void Compiler::AddUCS2Pair(uint8 lo1, uint8 hi1, bool fold1,
90 - ip = RuneByteSuffix(lo1, hi1, fold1, NULL);
94 - ip = RuneByteSuffix(lo1, hi1, fold1, ip);
|
| /external/rust/crates/itertools/ |
| D | CHANGELOG.md | 91 …- Add new iterator method `.tree_fold1()` which is like `.fold1()` except items are combined in a …
135 - `.foreach()` and `.fold1()` use `self`, like `.fold()` does.
318 - `.fold1()` *method*
|
| /external/rust/crates/itertools/tests/ |
| D | test_core.rs | 244 assert_eq!((0..i).tree_fold1(|x, y| x + y), (0..i).fold1(|x, y| x + y)); in tree_fold1()
|
| D | quick.rs | 1145 let min = cloned(&a).fold1(f64::min);
1146 let max = cloned(&a).fold1(f64::max);
1296 .map(|(key, vals)| (key, vals.into_iter().fold1(|acc, val| acc + val).unwrap()))
|
| /external/llvm-project/polly/lib/External/isl/include/isl/ |
| D | polynomial.h | 318 int isl_qpolynomial_fold_plain_is_equal(__isl_keep isl_qpolynomial_fold *fold1,
327 __isl_take isl_qpolynomial_fold *fold1,
|
| /external/rust/crates/nom/ |
| D | CHANGELOG.md | 1076 - the `fold0!` and `fold1!` macros were too complex and awkward to use, the `many*` combinators wil…
|