| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/ |
| H A D | is_partitioned.pass.cpp | 25 struct is_odd { struct
33 return std::is_partitioned(std::begin(ia), std::end(ia), is_odd())
34 && !std::is_partitioned(std::begin(ib), std::end(ib), is_odd());
42 unary_counting_predicate<is_odd, int> pred((is_odd()));
51 unary_counting_predicate<is_odd, int> pred((is_odd()));
60 unary_counting_predicate<is_odd, int> pred((is_odd()));
69 unary_counting_predicate<is_odd, in
[all...] |
| H A 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)
33 && (std::partition_point(std::begin(ib), std::end(ib), is_odd()) == ib+1)
45 is_odd()) == forward_iterator<const int*>(ia));
51 is_odd()) == forward_iterator<const int*>(ia + 1));
57 is_odd()) == forward_iterator<const int*>(ia + 2));
63 is_odd()) == forward_iterator<const int*>(ia + 3));
69 is_odd()) == forward_iterator<const int*>(ia + 4));
75 is_odd()) == forward_iterator<const int*>(ia + 5));
81 is_odd())
[all...] |
| H A D | partition.pass.cpp | 24 struct is_odd struct
36 Iter r = std::partition(Iter(ia), Iter(ia + sa), is_odd());
39 assert(is_odd()(*i));
41 assert(!is_odd()(*i));
43 r = std::partition(Iter(ia), Iter(ia), is_odd());
48 r = std::partition(Iter(ia), Iter(ia+sa), is_odd());
53 r = std::partition(Iter(ia), Iter(ia+sa), is_odd());
59 r = std::partition(Iter(ia), Iter(ia+sa), is_odd());
62 assert(is_odd()(*i));
64 assert(!is_odd()(*
[all...] |
| H A D | partition_copy.pass.cpp | 25 struct is_odd struct
37 std::begin(r1), std::begin(r2), is_odd());
39 return std::all_of(std::begin(r1), p.first, is_odd())
41 && std::none_of(std::begin(r2), p.second, is_odd())
56 output_iterator<int*>(r1), r2, is_odd());
|
| H A D | stable_partition.pass.cpp | 25 struct is_odd struct
|
| /external/wpa_supplicant_8/hostapd/src/eap_common/ |
| H A D | eap_pwd_common.c | 97 int nid, is_odd, ret = 0; local
242 is_odd = 1;
244 is_odd = 0;
253 is_odd, NULL))
|
| /external/wpa_supplicant_8/src/eap_common/ |
| H A D | eap_pwd_common.c | 97 int nid, is_odd, ret = 0; local
242 is_odd = 1;
244 is_odd = 0;
253 is_odd, NULL))
|
| /external/wpa_supplicant_8/wpa_supplicant/src/eap_common/ |
| H A D | eap_pwd_common.c | 97 int nid, is_odd, ret = 0; local
242 is_odd = 1;
244 is_odd = 0;
253 is_odd, NULL))
|
| /external/tensorflow/tensorflow/python/ops/ |
| H A D | spectral_grad.py | 158 is_odd = math_ops.mod(fft_length[-1], 2)
161 [[1.0], 2.0 * array_ops.ones([input_last_dimension - 2 + is_odd]),
162 array_ops.ones([1 - is_odd])], 0)
|
| /external/tensorflow/tensorflow/compiler/tf2xla/kernels/ |
| H A D | unary_ops.cc | 136 auto is_odd = b->Eq(nearest_even_int, one); local
138 b->Or(b->Gt(fraction, half), b->And(b->Eq(fraction, half), is_odd)),
|
| /external/python/cpython2/Modules/ |
| H A D | parsermodule.c | 979 #define is_odd(n) (((n) & 1) == 1) macro
1637 && is_odd(nch)
1829 && is_odd(nch)
1870 int res = is_odd(nch) && validate_dotted_as_name(CHILD(tree, 0));
2174 int res = validate_ntype(tree, test) && is_odd(nch);
2208 int res = validate_ntype(tree, or_test) && is_odd(nch);
2227 && is_odd(nch)
2261 && is_odd(nch)
2329 && is_odd(nch)
2346 && is_odd(nc
[all...] |
| /external/tensorflow/tensorflow/contrib/data/python/kernel_tests/ |
| H A D | bucketing_test.py | 373 is_odd = all(x % 2 == 1 for x in result)
374 self.assertTrue(is_even or is_odd)
|
| /external/tensorflow/tensorflow/core/kernels/ |
| H A D | cwise_ops.h | 438 bool is_odd = (nearest_even_int == Scalar(1)); local
439 if (is_odd) {
|