| /third_party/boost/boost/range/algorithm/ |
| D | stable_partition.hpp | 32 stable_partition(BidirectionalRange& rng, UnaryPredicate pred) in stable_partition() function
35 return std::stable_partition(boost::begin(rng), boost::end(rng), pred); in stable_partition()
41 stable_partition(const BidirectionalRange& rng, UnaryPredicate pred) in stable_partition() function
44 return std::stable_partition(boost::begin(rng),boost::end(rng),pred); in stable_partition()
50 stable_partition(BidirectionalRange& rng, UnaryPredicate pred) in stable_partition() function
54 std::stable_partition(boost::begin(rng), boost::end(rng), pred), in stable_partition()
61 stable_partition(const BidirectionalRange& rng, UnaryPredicate pred) in stable_partition() function
65 std::stable_partition(boost::begin(rng),boost::end(rng),pred), in stable_partition()
70 using range::stable_partition;
|
| /third_party/boost/libs/range/doc/reference/algorithm/ |
| D | stable_partition.qbk | 6 [section:stable_partition stable_partition]
13 stable_partition(ForwardRange& rng, UnaryPredicate pred);
17 stable_partition(const ForwardRange& rng, UnaryPredicate pred);
25 stable_partition(ForwardRange& rng, UnaryPredicate pred);
33 stable_partition(const ForwardRange& rng, UnaryPredicate pred);
38 …stable_partition` reorders the elements in the range `rng` base on the function object `pred`. Onc…
46 Defined in the header file `boost/range/algorithm/stable_partition.hpp`
|
| /third_party/boost/libs/mpl/doc/src/refmanual/ |
| D | stable_partition.rst | 1 .. Algorithms/Transformation Algorithms//stable_partition |90
3 stable_partition title
17 struct stable_partition
28 ``stable_partition`` is guaranteed to preserve the relative order of the
40 #include <boost/mpl/stable_partition.hpp>
74 typedef stable_partition<s,pred,in1,in2>::type r;
113 typedef stable_partition<
|
| D | partition.rst | 28 ``partition`` is a synonym for |stable_partition|.
82 typedef stable_partition<s,pred,in1,in2>::type r;
113 |Transformation Algorithms|, |Reversible Algorithm|, |reverse_partition|, |stable_partition|, |sort|
|
| D | reverse_stable_partition.rst | 40 #include <boost/mpl/stable_partition.hpp>
127 |Transformation Algorithms|, |Reversible Algorithm|, |stable_partition|, |reverse_partition|, |sort…
|
| /third_party/boost/libs/range/test/algorithm_test/ |
| D | stable_partition.cpp | 44 iter_t result = boost::stable_partition(cont, UnaryPredicate()); in test_iter()
46 iter_t temp_result = boost::stable_partition( in test_iter()
69 result_t result = boost::stable_partition<return_type>(cont, policy.pred()); in operator ()()
71 result_t result2 = boost::stable_partition<return_type>( in operator ()()
87 return std::stable_partition(cont.begin(), cont.end(), UnaryPredicate()); in reference()
|
| /third_party/boost/libs/mpl/test/ |
| D | stable_partition.cpp | 29 typedef stable_partition< in MPL_TEST_CASE()
40 typedef stable_partition< in MPL_TEST_CASE()
|
| D | Jamfile.v2 | 89 compile stable_partition.cpp ;
|
| /third_party/boost/boost/algorithm/ |
| D | gather.hpp | 94 std::stable_partition ( first, pivot, !boost::bind<bool> ( pred, _1 )), in gather()
95 std::stable_partition ( pivot, last, boost::bind<bool> ( pred, _1 ))); in gather()
|
| /third_party/boost/libs/algorithm/doc/ |
| D | gather.qbk | 56 …stable_partition`, which requires bidirectional iterators. Some standard libraries (libstdc++ and …
60 `gather` uses `stable_partition`, which will attempt to allocate temporary memory, but will work in…
|
| /third_party/boost/boost/compute/algorithm/ |
| D | partition.hpp | 39 return stable_partition(first, last, predicate, queue); in partition()
|
| D | stable_partition.hpp | 44 inline Iterator stable_partition(Iterator first, in stable_partition() function
|
| /third_party/boost/libs/compute/include/boost/compute/algorithm/ |
| D | partition.hpp | 39 return stable_partition(first, last, predicate, queue); in partition()
|
| D | stable_partition.hpp | 44 inline Iterator stable_partition(Iterator first, in stable_partition() function
|
| /third_party/boost/libs/phoenix/test/algorithm/ |
| D | transformation2.cpp | 89 using boost::phoenix::stable_partition; in stable_partition_test()
92 int* const end = stable_partition(arg1, even())(array); in stable_partition_test()
|
| /third_party/boost/libs/compute/test/ |
| D | test_stable_partition.cpp | 31 bc::stable_partition(vector.begin(), vector.begin() + 10, in BOOST_AUTO_TEST_CASE()
|
| /third_party/boost/libs/compute/perf/ |
| D | perf_stl_stable_partition.cpp | 40 std::stable_partition(host_vector.begin(), host_vector.end(), in main()
|
| D | perf_stable_partition.cpp | 53 boost::compute::stable_partition( in main()
|
| D | CMakeLists.txt | 78 stable_partition
|
| /third_party/boost/boost/mpl/ |
| D | stable_partition.hpp | 71 BOOST_MPL_AUX_INSERTER_ALGORITHM_DEF(4, stable_partition)
|
| /third_party/boost/libs/range/test/ |
| D | algorithm.cpp | 269 i = boost::stable_partition(rng, null_pred()); in test_algorithms()
440 BOOST_RANGE_RETURNS_TEST1( stable_partition, cv, std::negate<int>() ); in simple_compile_test()
441 BOOST_RANGE_RETURNS_TEST1( stable_partition, v, std::negate<int>() ); in simple_compile_test()
|
| /third_party/boost/boost/intrusive/detail/ |
| D | common_slist_algorithms.hpp | 110 …static void stable_partition(node_ptr before_beg, node_ptr end, Pred pred, stable_partition_info &… in stable_partition() function in boost::intrusive::detail::common_slist_algorithms
|
| /third_party/boost/libs/compute/doc/ |
| D | reference.qbk | 111 * [funcref boost::compute::stable_partition stable_partition()]
|
| /third_party/boost/boost/phoenix/stl/algorithm/ |
| D | transformation.hpp | 555 struct stable_partition struct
569 return std::stable_partition(detail::begin_(r), detail::end_(r), p); in operator ()()
1158 BOOST_PHOENIX_ADAPT_CALLABLE(stable_partition, impl::stable_partition, 2)
|
| /third_party/boost/libs/phoenix/doc/modules/ |
| D | stl.qbk | 218 [[`stable_partition(r, f)`] [`stable_partition(begin(r), end(r), f)`] []]
|