| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/ |
| D | partition.pass.cpp | 24 struct is_odd struct
36 Iter r = std::partition(Iter(ia), Iter(ia + sa), is_odd()); in test() argument
39 assert(is_odd()(*i)); in test()
41 assert(!is_odd()(*i)); in test()
43 r = std::partition(Iter(ia), Iter(ia), is_odd()); in test()
48 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); in test()
53 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); in test()
59 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); in test()
62 assert(is_odd()(*i)); in test()
64 assert(!is_odd()(*i)); in test()
[all …]
|
| D | is_partitioned.pass.cpp | 25 struct is_odd { struct
33 return std::is_partitioned(std::begin(ia), std::end(ia), is_odd()) in test_constexpr() argument
34 && !std::is_partitioned(std::begin(ib), std::end(ib), is_odd()); in test_constexpr()
42 unary_counting_predicate<is_odd, int> pred((is_odd())); in main()
51 unary_counting_predicate<is_odd, int> pred((is_odd())); in main()
60 unary_counting_predicate<is_odd, int> pred((is_odd())); in main()
69 unary_counting_predicate<is_odd, int> pred((is_odd())); in main()
78 unary_counting_predicate<is_odd, int> pred((is_odd())); in main()
87 unary_counting_predicate<is_odd, int> pred((is_odd())); in main()
|
| D | partition_point.pass.cpp | 22 struct is_odd struct
32 return (std::partition_point(std::begin(ia), std::end(ia), is_odd()) == ia+3) in test_constexpr() argument
33 && (std::partition_point(std::begin(ib), std::end(ib), is_odd()) == ib+1) in test_constexpr()
45 is_odd()) == forward_iterator<const int*>(ia)); in main()
51 is_odd()) == forward_iterator<const int*>(ia + 1)); in main()
57 is_odd()) == forward_iterator<const int*>(ia + 2)); in main()
63 is_odd()) == forward_iterator<const int*>(ia + 3)); in main()
69 is_odd()) == forward_iterator<const int*>(ia + 4)); in main()
75 is_odd()) == forward_iterator<const int*>(ia + 5)); in main()
81 is_odd()) == forward_iterator<const int*>(ia + 6)); in main()
[all …]
|
| D | partition_copy.pass.cpp | 25 struct is_odd struct
37 std::begin(r1), std::begin(r2), is_odd()); in test_constexpr() argument
39 return std::all_of(std::begin(r1), p.first, is_odd()) in test_constexpr()
41 && std::none_of(std::begin(r2), p.second, is_odd()) in test_constexpr()
56 output_iterator<int*>(r1), r2, is_odd()); in main()
|
| D | stable_partition.pass.cpp | 25 struct is_odd struct
|
| /external/libtextclassifier/utils/ |
| D | checksum.cc | 25 bool is_odd = true; in VerifyLuhnChecksum() local
40 if (is_odd) { in VerifyLuhnChecksum()
45 is_odd = !is_odd; in VerifyLuhnChecksum()
|
| /external/tensorflow/tensorflow/python/data/experimental/kernel_tests/optimization/ |
| D | map_and_filter_fusion_test.py | 45 is_odd = lambda x: math_ops.equal(x % 2, 0) function
49 filters = [take_all, is_zero, is_odd, greater]
|
| /external/wpa_supplicant_8/src/eap_common/ |
| D | eap_pwd_common.c | 157 u8 mask, found_ctr = 0, is_odd = 0; in compute_password_element() local
234 is_odd = const_time_select_u8( in compute_password_element()
235 found, is_odd, pwe_digest[SHA256_MAC_LEN - 1] & 0x01); in compute_password_element()
325 is_odd) != 0) { in compute_password_element()
|
| /external/tensorflow/tensorflow/python/ops/signal/ |
| D | fft_ops.py | 309 is_odd = _math_ops.mod(fft_length[-1], 2)
312 [[1.0], 2.0 * _array_ops.ones([input_last_dimension - 2 + is_odd]),
313 _array_ops.ones([1 - is_odd])], 0)
|
| /external/python/cpython2/Modules/ |
| D | parsermodule.c | 1021 #define is_odd(n) (((n) & 1) == 1) macro
1679 && is_odd(nch) in validate_expr_stmt()
1871 && is_odd(nch) in validate_dotted_name()
1912 int res = is_odd(nch) && validate_dotted_as_name(CHILD(tree, 0)); in validate_dotted_as_names()
2216 int res = validate_ntype(tree, test) && is_odd(nch); in validate_test()
2250 int res = validate_ntype(tree, or_test) && is_odd(nch); in validate_or_test()
2269 && is_odd(nch) in validate_and_test()
2303 && is_odd(nch) in validate_comparison()
2371 && is_odd(nch) in validate_expr()
2388 && is_odd(nch) in validate_xor_expr()
[all …]
|
| /external/tensorflow/tensorflow/python/data/experimental/kernel_tests/ |
| D | group_by_window_test.py | 197 is_odd = all(x % 2 == 1 for x in result)
198 self.assertTrue(is_even or is_odd)
|
| /external/tensorflow/tensorflow/compiler/xla/client/lib/ |
| D | math.cc | 506 auto is_odd = Eq(nearest_even_int, one); in RoundToEven() local
507 return Select(Or(Gt(fraction, half), And(Eq(fraction, half), is_odd)), in RoundToEven()
|
| /external/tensorflow/tensorflow/core/common_runtime/ |
| D | ring_gatherer_test.cc | 201 bool is_odd = ((di % 2) == 1); in Init() local
202 int other = (di + (is_odd ? 7 : 3)) % num_devices; in Init()
|
| D | ring_reducer_test.cc | 223 bool is_odd = ((di % 2) == 1); in Init() local
224 int other = (di + (is_odd ? 7 : 3)) % num_devices; in Init()
|
| /external/tensorflow/tensorflow/core/kernels/ |
| D | cwise_ops.h | 487 bool is_odd = (nearest_even_int == Scalar(1));
488 if (is_odd) {
|
| /external/python/cpython3/Doc/library/ |
| D | itertools.rst | 783 # partition(is_odd, range(10)) --> 0 2 4 6 8 and 1 3 5 7 9
|