| /third_party/boost/boost/preprocessor/list/ |
| D | filter.hpp | 26 # define BOOST_PP_LIST_FILTER(pred, data, list) BOOST_PP_TUPLE_ELEM(3, 2, BOOST_PP_LIST_FOLD_RIG… argument
28 # define BOOST_PP_LIST_FILTER(pred, data, list) BOOST_PP_LIST_FILTER_I(pred, data, list) argument
29 # define BOOST_PP_LIST_FILTER_I(pred, data, list) BOOST_PP_TUPLE_ELEM(3, 2, BOOST_PP_LIST_FOLD_R… argument
40 # define BOOST_PP_LIST_FILTER_O_D(d, pred, data, res, elem) (pred, data, BOOST_PP_IF(pred(d, dat… argument
42 # define BOOST_PP_LIST_FILTER_O_D(d, pred, data, res, elem) (pred, data, BOOST_PP_IF(pred##(d, d… argument
48 # define BOOST_PP_LIST_FILTER_D(d, pred, data, list) BOOST_PP_TUPLE_ELEM(3, 2, BOOST_PP_LIST_FOL… argument
50 # define BOOST_PP_LIST_FILTER_D(d, pred, data, list) BOOST_PP_LIST_FILTER_D_I(d, pred, data, lis… argument
51 # define BOOST_PP_LIST_FILTER_D_I(d, pred, data, list) BOOST_PP_TUPLE_ELEM(3, 2, BOOST_PP_LIST_F… argument
|
| /third_party/boost/boost/preprocessor/seq/ |
| D | filter.hpp | 26 # define BOOST_PP_SEQ_FILTER(pred, data, seq) BOOST_PP_SEQ_TAIL(BOOST_PP_TUPLE_ELEM(3, 2, BOOST_… argument
28 # define BOOST_PP_SEQ_FILTER(pred, data, seq) BOOST_PP_SEQ_FILTER_I(pred, data, seq) argument
29 # define BOOST_PP_SEQ_FILTER_I(pred, data, seq) BOOST_PP_SEQ_TAIL(BOOST_PP_TUPLE_ELEM(3, 2, BOOS… argument
40 # define BOOST_PP_SEQ_FILTER_O_I(s, pred, data, res, elem) (pred, data, res BOOST_PP_EXPR_IF(pred… argument
42 # define BOOST_PP_SEQ_FILTER_O_I(s, pred, data, res, elem) (pred, data, res BOOST_PP_EXPR_IF(pred… argument
48 # define BOOST_PP_SEQ_FILTER_S(s, pred, data, seq) BOOST_PP_SEQ_TAIL(BOOST_PP_TUPLE_ELEM(3, 2, B… argument
50 # define BOOST_PP_SEQ_FILTER_S(s, pred, data, seq) BOOST_PP_SEQ_FILTER_S_I(s, pred, data, seq) argument
51 # define BOOST_PP_SEQ_FILTER_S_I(s, pred, data, seq) BOOST_PP_SEQ_TAIL(BOOST_PP_TUPLE_ELEM(3, 2,… argument
|
| /third_party/gn/src/base/ |
| D | stl_util.h | 32 void IterateAndEraseIf(Container& container, Predicate pred) { in IterateAndEraseIf()
150 Predicate pred) { in EraseIf()
162 void EraseIf(std::deque<T, Allocator>& container, Predicate pred) { in EraseIf()
174 void EraseIf(std::vector<T, Allocator>& container, Predicate pred) { in EraseIf()
188 void EraseIf(std::forward_list<T, Allocator>& container, Predicate pred) { in EraseIf()
201 void EraseIf(std::list<T, Allocator>& container, Predicate pred) { in EraseIf()
206 void EraseIf(std::map<Key, T, Compare, Allocator>& container, Predicate pred) { in EraseIf()
212 Predicate pred) { in EraseIf()
217 void EraseIf(std::set<Key, Compare, Allocator>& container, Predicate pred) { in EraseIf()
223 Predicate pred) { in EraseIf()
[all …]
|
| /third_party/boost/boost/range/algorithm/ |
| D | remove_if.hpp | 32 remove_if(ForwardRange& rng, UnaryPredicate pred) in remove_if()
41 remove_if(const ForwardRange& rng, UnaryPredicate pred) in remove_if()
52 remove_if(ForwardRange& rng, UnaryPredicate pred) in remove_if()
63 remove_if(const ForwardRange& rng, UnaryPredicate pred) in remove_if()
|
| D | find_if.hpp | 35 find_if( SinglePassRange& rng, UnaryPredicate pred ) in find_if()
44 find_if( const SinglePassRange& rng, UnaryPredicate pred ) in find_if()
58 find_if( SinglePassRange& rng, UnaryPredicate pred ) in find_if()
69 find_if( const SinglePassRange& rng, UnaryPredicate pred ) in find_if()
|
| D | partition.hpp | 31 partition(ForwardRange& rng, UnaryPredicate pred) in partition()
40 partition(const ForwardRange& rng, UnaryPredicate pred) in partition()
52 partition(ForwardRange& rng, UnaryPredicate pred) in partition()
63 partition(const ForwardRange& rng, UnaryPredicate pred) in partition()
|
| D | stable_partition.hpp | 32 stable_partition(BidirectionalRange& rng, UnaryPredicate pred) in stable_partition()
41 stable_partition(const BidirectionalRange& rng, UnaryPredicate pred) in stable_partition()
50 stable_partition(BidirectionalRange& rng, UnaryPredicate pred) in stable_partition()
61 stable_partition(const BidirectionalRange& rng, UnaryPredicate pred) in stable_partition()
|
| D | unique.hpp | 52 unique( ForwardRange& rng, BinaryPredicate pred ) in unique()
62 unique( const ForwardRange& rng, BinaryPredicate pred ) in unique()
89 unique( ForwardRange& rng, BinaryPredicate pred ) in unique()
97 unique( const ForwardRange& rng, BinaryPredicate pred ) in unique()
|
| D | adjacent_find.hpp | 51 adjacent_find(ForwardRange & rng, BinaryPredicate pred) in adjacent_find()
63 adjacent_find(const ForwardRange& rng, BinaryPredicate pred) in adjacent_find()
99 adjacent_find(ForwardRange& rng, BinaryPredicate pred) in adjacent_find()
113 adjacent_find(const ForwardRange& rng, BinaryPredicate pred) in adjacent_find()
|
| D | mismatch.hpp | 50 BinaryPredicate pred) in mismatch_impl()
136 mismatch(SinglePassRange1& rng1, const SinglePassRange2& rng2, BinaryPredicate pred) in mismatch()
151 mismatch(const SinglePassRange1& rng1, const SinglePassRange2& rng2, BinaryPredicate pred) in mismatch()
166 mismatch(SinglePassRange1& rng1, SinglePassRange2& rng2, BinaryPredicate pred) in mismatch()
181 mismatch(const SinglePassRange1& rng1, SinglePassRange2& rng2, BinaryPredicate pred) in mismatch()
|
| D | min_element.hpp | 72 min_element(ForwardRange& rng, BinaryPredicate pred) in min_element()
81 min_element(const ForwardRange& rng, BinaryPredicate pred) in min_element()
114 min_element(ForwardRange& rng, BinaryPredicate pred) in min_element()
125 min_element(const ForwardRange& rng, BinaryPredicate pred) in min_element()
|
| D | max_element.hpp | 72 max_element(ForwardRange& rng, BinaryPredicate pred) in max_element()
81 max_element(const ForwardRange& rng, BinaryPredicate pred) in max_element()
114 max_element(ForwardRange& rng, BinaryPredicate pred) in max_element()
125 max_element(const ForwardRange& rng, BinaryPredicate pred) in max_element()
|
| D | lower_bound.hpp | 55 lower_bound( ForwardRange& rng, const Value& val, SortPredicate pred ) in lower_bound()
64 lower_bound( const ForwardRange& rng, const Value& val, SortPredicate pred ) in lower_bound()
101 lower_bound( ForwardRange& rng, const Value& val, SortPredicate pred ) in lower_bound()
112 lower_bound( const ForwardRange& rng, const Value& val, SortPredicate pred ) in lower_bound()
|
| D | find_end.hpp | 63 find_end(ForwardRange1 & rng1, const ForwardRange2& rng2, BinaryPredicate pred) in find_end()
75 find_end(const ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred) in find_end()
122 find_end(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred) in find_end()
137 find_end(const ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred) in find_end()
|
| D | find_first_of.hpp | 63 find_first_of(SinglePassRange1 & rng1, ForwardRange2 const & rng2, BinaryPredicate pred) in find_first_of()
75 find_first_of(const SinglePassRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred) in find_first_of()
124 BinaryPredicate pred) in find_first_of()
140 BinaryPredicate pred) in find_first_of()
|
| D | search.hpp | 55 search(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred) in search()
66 search(const ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred) in search()
106 search(ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred) in search()
120 search(const ForwardRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred) in search()
|
| D | upper_bound.hpp | 56 upper_bound( ForwardRange& rng, const Value& val, SortPredicate pred ) in upper_bound()
65 upper_bound( const ForwardRange& rng, const Value& val, SortPredicate pred ) in upper_bound()
103 upper_bound( ForwardRange& rng, const Value& val, SortPredicate pred ) in upper_bound()
115 upper_bound( const ForwardRange& rng, const Value& val, SortPredicate pred ) in upper_bound()
|
| D | set_algorithm.hpp | 45 BinaryPredicate pred) in includes()
78 BinaryPredicate pred) in set_union()
111 BinaryPredicate pred) in set_intersection()
145 BinaryPredicate pred) in set_difference()
181 BinaryPredicate pred) in set_symmetric_difference()
|
| /third_party/mesa3d/src/gtest/include/gtest/ |
| D | gtest_pred_impl.h | 89 Pred pred, in AssertPred1Helper()
107 #define GTEST_PRED1_(pred, v1, on_failure)\ argument
116 #define EXPECT_PRED1(pred, v1) \ argument
120 #define ASSERT_PRED1(pred, v1) \ argument
133 Pred pred, in AssertPred2Helper()
154 #define GTEST_PRED2_(pred, v1, v2, on_failure)\ argument
165 #define EXPECT_PRED2(pred, v1, v2) \ argument
169 #define ASSERT_PRED2(pred, v1, v2) \ argument
184 Pred pred, in AssertPred3Helper()
207 #define GTEST_PRED3_(pred, v1, v2, v3, on_failure)\ argument
[all …]
|
| /third_party/googletest/googletest/include/gtest/ |
| D | gtest_pred_impl.h | 89 Pred pred, in AssertPred1Helper()
107 #define GTEST_PRED1_(pred, v1, on_failure)\ argument
116 #define EXPECT_PRED1(pred, v1) \ argument
120 #define ASSERT_PRED1(pred, v1) \ argument
133 Pred pred, in AssertPred2Helper()
154 #define GTEST_PRED2_(pred, v1, v2, on_failure)\ argument
165 #define EXPECT_PRED2(pred, v1, v2) \ argument
169 #define ASSERT_PRED2(pred, v1, v2) \ argument
184 Pred pred, in AssertPred3Helper()
207 #define GTEST_PRED3_(pred, v1, v2, v3, on_failure)\ argument
[all …]
|
| /third_party/boost/boost/range/adaptor/ |
| D | replaced_if.hpp | 42 replace_value_if(const Pred& pred, const Value& to) in replace_value_if()
84 replaced_if_range( R& r, const Pred& pred, value_type to ) in replaced_if_range()
94 replace_if_holder( const Pred& pred, const T& to ) in replace_if_holder()
98 const Pred& pred() const { return m_pred; } in pred() function in boost::range_detail::replace_if_holder
142 replace_if(SinglePassRange& rng, Pred pred, Value to) in replace_if()
153 replace_if(const SinglePassRange& rng, Pred pred, Value to) in replace_if()
|
| /third_party/boost/boost/thread/pthread/ |
| D | condition_variable_fwd.hpp | 89 void wait(unique_lock<mutex>& m,predicate_type pred) in wait()
163 boost::system_time const& abs_time,predicate_type pred) in timed_wait()
190 ::boost::xtime const& abs_time,predicate_type pred) in timed_wait()
198 duration_type const& wait_duration,predicate_type pred) in timed_wait()
283 Predicate pred) in wait_until()
298 Predicate pred) in wait_until()
319 Predicate pred) in wait_for()
|
| /third_party/boost/libs/compute/include/boost/compute/functional/ |
| D | logical.hpp | 24 invoked_unary_negate_function(const Predicate &pred, in invoked_unary_negate_function()
31 Predicate pred() const in pred() function in boost::compute::detail::invoked_unary_negate_function
52 invoked_binary_negate_function(const Predicate &pred, in invoked_binary_negate_function()
61 Predicate pred() const in pred() function in boost::compute::detail::invoked_binary_negate_function
118 explicit unary_negate(Predicate pred) in unary_negate()
145 explicit binary_negate(Predicate pred) in binary_negate()
|
| /third_party/boost/boost/compute/functional/ |
| D | logical.hpp | 24 invoked_unary_negate_function(const Predicate &pred, in invoked_unary_negate_function()
31 Predicate pred() const in pred() function in boost::compute::detail::invoked_unary_negate_function
52 invoked_binary_negate_function(const Predicate &pred, in invoked_binary_negate_function()
61 Predicate pred() const in pred() function in boost::compute::detail::invoked_binary_negate_function
118 explicit unary_negate(Predicate pred) in unary_negate()
145 explicit binary_negate(Predicate pred) in binary_negate()
|
| /third_party/boost/boost/fiber/ |
| D | condition_variable.hpp | 94 void wait( LockType & lt, Pred pred) { in wait()
140 std::chrono::time_point< Clock, Duration > const& timeout_time, Pred pred) { in wait_until()
156 …wait_for( LockType & lt, std::chrono::duration< Rep, Period > const& timeout_duration, Pred pred) { in wait_for()
192 void wait( std::unique_lock< mutex > & lt, Pred pred) { in wait()
217 std::chrono::time_point< Clock, Duration > const& timeout_time, Pred pred) { in wait_until()
243 std::chrono::duration< Rep, Period > const& timeout_duration, Pred pred) { in wait_for()
|