| /third_party/boost/libs/mpl/test/ |
| D | partition.cpp | 24 template< typename N > struct is_odd struct
27 BOOST_MPL_AUX_LAMBDA_SUPPORT(1, is_odd, (N))
35 , is_odd<_1> in MPL_TEST_CASE()
|
| /third_party/boost/libs/hana/example/ |
| D | all_of.cpp | 22 BOOST_HANA_CONSTEXPR_LAMBDA auto is_odd = [](auto x) { in __anon36c9b3d10102() variable
27 BOOST_HANA_CONSTEXPR_CHECK(hana::all_of(hana::make_tuple(1, 3), is_odd)); in main()
28 BOOST_HANA_CONSTANT_CHECK(!hana::all_of(hana::make_tuple(3_c, 4_c), is_odd)); in main()
|
| D | any_of.cpp | 22 BOOST_HANA_CONSTEXPR_LAMBDA auto is_odd = [](auto x) { in __anon1f1a65400102() variable
27 BOOST_HANA_CONSTEXPR_CHECK(hana::any_of(hana::make_tuple(1, 2), is_odd)); in main()
28 BOOST_HANA_CONSTANT_CHECK(!hana::any_of(hana::make_tuple(2_c, 4_c), is_odd)); in main()
|
| D | none_of.cpp | 21 BOOST_HANA_CONSTEXPR_LAMBDA auto is_odd = [](auto x) { in __anon9d8babc80102() variable
26 BOOST_HANA_CONSTANT_CHECK(hana::none_of(hana::make_tuple(2_c, 4_c), is_odd)); in main()
27 BOOST_HANA_CONSTEXPR_CHECK(!hana::none_of(hana::make_tuple(1, 2), is_odd)); in main()
|
| D | count_if.cpp | 20 auto is_odd = [](auto x) { in __anon05d04c1b0102() variable
26 BOOST_HANA_CONSTANT_CHECK(hana::count_if(ints, is_odd) == hana::size_c<2>); in main()
|
| /third_party/boost/libs/phoenix/doc/starter_kit/ |
| D | function.qbk | 18 functions. The code below is a rewrite of the `is_odd` function using the
32 function<is_odd_impl> is_odd;
46 * `is_odd`, an instance of `function<is_odd_impl>`, is the lazy function.
48 Now, `is_odd` is a truly lazy function that we can use in conjunction with the
51 std::find_if(c.begin(), c.end(), is_odd(arg1));
|
| /third_party/boost/libs/geometry/test/iterators/ |
| D | test_iterator_common.hpp | 66 struct is_odd struct
80 return !is_odd<T>()(t); in operator ()() argument
162 std::remove_if(first, beyond, is_odd<value_type>()); in test_using_remove_if()
168 BOOST_CHECK( !is_odd<value_type>()(*it) ); in test_using_remove_if()
177 is_odd<value_type>()), in test_using_remove_if()
|
| /third_party/skia/tests/sksl/runtime_errors/ |
| D | IllegalRecursionMutual.skvm | 4 bool is_odd(int n)
6 bool is_odd(int n)
|
| /third_party/skia/resources/sksl/runtime_errors/ |
| D | IllegalRecursionMutual.rts | 5 bool is_odd (int n) { return n == 0 ? false : is_even(n - 1); }
6 bool is_even(int n) { return n == 0 ? true : is_odd (n - 1); }
|
| /third_party/boost/libs/spirit/classic/phoenix/example/fundamental/ |
| D | sample3.cpp | 28 function<is_odd_> is_odd; variable
38 iterator it = find_if(c.begin(), c.end(), is_odd(arg1)); in main()
|
| /third_party/boost/libs/phoenix/example/ |
| D | function.cpp | 26 function<is_odd_> is_odd; variable
38 iterator it = std::find_if(c.begin(), c.end(), is_odd(arg1)); in main()
|
| /third_party/boost/libs/range/test/adaptor_test/ |
| D | filtered.cpp | 48 struct is_odd struct
150 filtered_test_impl< Container, is_odd, is_odd >(); in filtered_test_all_predicates()
|
| /third_party/boost/libs/compute/test/ |
| D | test_gather.cpp | 51 BOOST_COMPUTE_FUNCTION(bool, is_odd, (int x), in BOOST_AUTO_TEST_CASE()
59 input.begin(), input.end(), odds.begin(), is_odd, queue in BOOST_AUTO_TEST_CASE()
|
| D | test_unique.cpp | 89 BOOST_COMPUTE_FUNCTION(bool, is_odd, (uint_ x), in BOOST_AUTO_TEST_CASE()
93 BOOST_VERIFY(compute::none_of(vec.begin(), vec.end(), is_odd, queue)); in BOOST_AUTO_TEST_CASE()
|
| D | test_count.cpp | 196 BOOST_COMPUTE_FUNCTION(bool, is_odd, (int x), in BOOST_AUTO_TEST_CASE()
202 compute::count_if(vec.begin(), vec.end(), is_odd, queue), vec.size() / 2 in BOOST_AUTO_TEST_CASE()
|
| /third_party/boost/libs/mp11/test/ |
| D | mp_remove_if.cpp | 23 template<class N> using is_odd = mp_bool<N::value % 2 != 0>; typedef
61 using R1 = mp_remove_if<L1, is_odd>; in main()
|
| /third_party/boost/libs/mpl/doc/src/refmanual/ |
| D | inserter_.rst | 79 template< typename N > struct is_odd : bool_< ( N::value % 2 ) > {};
85 , if_< is_odd<_2>, push_back<_1,_2>, _1 >
|
| D | reverse_partition.rst | 97 template< typename N > struct is_odd : bool_<(N::value % 2)> {};
101 , is_odd<_1>
|
| D | partition.rst | 97 template< typename N > struct is_odd : bool_<(N::value % 2)> {};
101 , is_odd<_1>
|
| D | stable_partition.rst | 111 template< typename N > struct is_odd : bool_<(N::value % 2)> {};
115 , is_odd<_1>
|
| D | reverse_stable_partition.rst | 111 template< typename N > struct is_odd : bool_<(N::value % 2)> {};
115 , is_odd<_1>
|
| /third_party/boost/libs/compute/perf/ |
| D | perf_copy_if.cpp | 35 BOOST_COMPUTE_FUNCTION(bool, is_odd, (int x), in test_copy_if_odd()
44 input.begin(), input.end(), output.begin(), is_odd, queue in test_copy_if_odd()
|
| /third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/eap_common/ |
| D | eap_pwd_common.c | 140 u8 found_ctr = 0, is_odd = 0; in compute_password_element() local
197 is_odd = const_time_select_u8( in compute_password_element()
198 found, is_odd, pwe_digest[SHA256_MAC_LEN - 1] & 0x01); in compute_password_element()
284 is_eq = const_time_eq(is_odd, x_y[primebytelen - 1] & 0x01); in compute_password_element()
|
| /third_party/wpa_supplicant/wpa_supplicant-2.9/src/eap_common/ |
| D | eap_pwd_common.c | 140 u8 found_ctr = 0, is_odd = 0; in compute_password_element() local
197 is_odd = const_time_select_u8( in compute_password_element()
198 found, is_odd, pwe_digest[SHA256_MAC_LEN - 1] & 0x01); in compute_password_element()
284 is_eq = const_time_eq(is_odd, x_y[primebytelen - 1] & 0x01); in compute_password_element()
|
| /third_party/boost/libs/phoenix/doc/advanced/ |
| D | porting.qbk | 44 boost::phoenix::function<is_odd_impl> is_odd = is_odd_impl();
58 boost::phoenix::function<is_odd_impl> is_odd = is_odd_impl();
|