| /external/llvm-project/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 | 24 struct is_odd { struct
32 return std::is_partitioned(std::begin(ia), std::end(ia), is_odd()) in test_constexpr() argument
33 && !std::is_partitioned(std::begin(ib), std::end(ib), is_odd()); in test_constexpr()
41 unary_counting_predicate<is_odd, int> pred((is_odd())); in main()
50 unary_counting_predicate<is_odd, int> pred((is_odd())); in main()
59 unary_counting_predicate<is_odd, int> pred((is_odd())); in main()
68 unary_counting_predicate<is_odd, int> pred((is_odd())); in main()
77 unary_counting_predicate<is_odd, int> pred((is_odd())); in main()
86 unary_counting_predicate<is_odd, int> pred((is_odd())); in main()
|
| D | partition_point.pass.cpp | 21 struct is_odd struct
31 return (std::partition_point(std::begin(ia), std::end(ia), is_odd()) == ia+3) in test_constexpr() argument
32 && (std::partition_point(std::begin(ib), std::end(ib), is_odd()) == ib+1) in test_constexpr()
44 is_odd()) == forward_iterator<const int*>(ia)); in main()
50 is_odd()) == forward_iterator<const int*>(ia + 1)); in main()
56 is_odd()) == forward_iterator<const int*>(ia + 2)); in main()
62 is_odd()) == forward_iterator<const int*>(ia + 3)); in main()
68 is_odd()) == forward_iterator<const int*>(ia + 4)); in main()
74 is_odd()) == forward_iterator<const int*>(ia + 5)); in main()
80 is_odd()) == forward_iterator<const int*>(ia + 6)); in main()
[all …]
|
| D | partition_copy.pass.cpp | 24 struct is_odd struct
36 std::begin(r1), std::begin(r2), is_odd()); in test_constexpr() argument
38 return std::all_of(std::begin(r1), p.first, is_odd()) in test_constexpr()
40 && std::none_of(std::begin(r2), p.second, is_odd()) in test_constexpr()
55 output_iterator<int*>(r1), r2, is_odd()); in main()
|
| D | stable_partition.pass.cpp | 24 struct is_odd struct
|
| /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/native/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/rust/crates/num-integer/src/ |
| D | lib.rs | 245 fn is_odd(&self) -> bool; in is_odd() method
557 fn is_odd(&self) -> bool {
777 assert_eq!((-4 as $T).is_odd(), false);
778 assert_eq!((-3 as $T).is_odd(), true);
779 assert_eq!((-2 as $T).is_odd(), false);
780 assert_eq!((-1 as $T).is_odd(), true);
781 assert_eq!((0 as $T).is_odd(), false);
782 assert_eq!((1 as $T).is_odd(), true);
783 assert_eq!((2 as $T).is_odd(), false);
784 assert_eq!((3 as $T).is_odd(), true);
[all …]
|
| D | roots.rs | 142 assert!(n.is_odd(), "even roots of a negative are imaginary");
|
| /external/wpa_supplicant_8/src/eap_common/ |
| D | eap_pwd_common.c | 139 u8 found_ctr = 0, is_odd = 0; in compute_password_element() local
200 is_odd = const_time_select_u8( in compute_password_element()
201 found, is_odd, pwe_digest[SHA256_MAC_LEN - 1] & 0x01); in compute_password_element()
266 is_odd) != 0) { in compute_password_element()
|
| /external/rust/crates/serde_json/src/lexical/ |
| D | rounding.rs | 88 let is_odd = fp.mant & 1 == 1; in tie_even() localVariable
93 if is_above || (is_odd && is_halfway) { in tie_even()
|
| /external/tensorflow/tensorflow/python/data/experimental/kernel_tests/optimization/ |
| D | map_and_filter_fusion_test.py | 49 is_odd = lambda x: math_ops.equal(x % 2, 0) function
51 predicates = [take_all, is_zero, is_odd, greater]
|
| /external/rust/crates/ring/crypto/fipsmodule/ec/ |
| D | gfp_p384.c | 132 Limb is_odd = constant_time_is_nonzero_w(a[0] & 1); in elem_div_by_2() local
154 copy_conditional(r, adjusted, is_odd); in elem_div_by_2()
|
| /external/tensorflow/tensorflow/python/ops/signal/ |
| D | fft_ops.py | 352 is_odd = _math_ops.mod(fft_length[-1], 2)
356 [input_last_dimension - 2 + is_odd], real_dtype),
357 _array_ops.ones([1 - is_odd], real_dtype)], 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 | 201 is_odd = all(x % 2 == 1 for x in result)
202 self.assertTrue(is_even or is_odd)
|
| /external/skia/src/gpu/d3d/ |
| D | GrD3DGpu.cpp | 887 static bool is_odd(int x) { in is_odd() function
970 if (is_odd(width) && is_odd(height)) { in onRegenerateMipMapLevels()
972 } else if (is_odd(width)) { in onRegenerateMipMapLevels()
974 } else if (is_odd(height)) { in onRegenerateMipMapLevels()
|
| /external/mesa3d/src/gallium/drivers/radeonsi/ |
| D | gfx10_shader_ngg.c | 1581 LLVMValueRef is_odd = ctx->ac.i1false; in gfx10_ngg_gs_emit_vertex() local
1584 is_odd = LLVMBuildICmp(builder, LLVMIntEQ, tmp, ctx->ac.i32_1, ""); in gfx10_ngg_gs_emit_vertex()
1597 LLVMBuildShl(builder, LLVMBuildZExt(builder, is_odd, ctx->ac.i8, ""), ctx->ac.i8_1, ""), ""); in gfx10_ngg_gs_emit_vertex()
1851 LLVMValueRef is_odd = LLVMBuildLShr(builder, flags, ctx->ac.i8_1, ""); in gfx10_ngg_gs_emit_epilogue() local
1852 is_odd = LLVMBuildTrunc(builder, is_odd, ctx->ac.i1, ""); in gfx10_ngg_gs_emit_epilogue()
1856 ac_build_triangle_strip_indices_to_triangle(&ctx->ac, is_odd, flatshade_first, prim.index); in gfx10_ngg_gs_emit_epilogue()
|
| /external/tensorflow/tensorflow/core/common_runtime/ |
| D | ring_gatherer_test.cc | 212 bool is_odd = ((di % 2) == 1); in Init() local
213 int other = (di + (is_odd ? 7 : 3)) % num_devices; in Init()
|
| D | ring_reducer_test.cc | 235 bool is_odd = ((di % 2) == 1); in Init() local
236 int other = (di + (is_odd ? 7 : 3)) % num_devices; in Init()
|
| /external/rust/crates/ring/src/rsa/ |
| D | signing.rs | 324 if !d.is_odd() { in from_der_reader()
|