Functions | |
template<typename InputIterator1, typename InputIterator2> bool | std::includes (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2) |
Determines whether all elements of a sequence exists in a range. | |
template<typename InputIterator1, typename InputIterator2, typename Compare> bool | std::includes (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp) |
Determines whether all elements of a sequence exists in a range using comparison. | |
template<typename InputIterator1, typename InputIterator2, typename OutputIterator> OutputIterator | std::set_union (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator __result) |
Return the union of two sorted ranges. | |
template<typename InputIterator1, typename InputIterator2, typename OutputIterator, typename Compare> OutputIterator | std::set_union (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator __result, Compare comp) |
Return the union of two sorted ranges using a comparison functor. | |
template<typename InputIterator1, typename InputIterator2, typename OutputIterator> OutputIterator | std::set_intersection (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator __result) |
Return the intersection of two sorted ranges. | |
template<typename InputIterator1, typename InputIterator2, typename OutputIterator, typename Compare> OutputIterator | std::set_intersection (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator __result, Compare comp) |
Return the intersection of two sorted ranges using comparison functor. | |
template<typename InputIterator1, typename InputIterator2, typename OutputIterator> OutputIterator | std::set_difference (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator __result) |
Return the difference of two sorted ranges. | |
template<typename InputIterator1, typename InputIterator2, typename OutputIterator, typename Compare> OutputIterator | std::set_difference (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator __result, Compare comp) |
Return the difference of two sorted ranges using comparison functor. | |
template<typename InputIterator1, typename InputIterator2, typename OutputIterator> OutputIterator | std::set_symmetric_difference (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator __result) |
Return the symmetric difference of two sorted ranges. | |
template<typename InputIterator1, typename InputIterator2, typename OutputIterator, typename Compare> OutputIterator | std::set_symmetric_difference (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator __result, Compare comp) |
Return the symmetric difference of two sorted ranges using comparison functor. |
The number of comparisons will be linear.
|
Determines whether all elements of a sequence exists in a range using comparison.
Definition at line 4026 of file stl_algo.h. |
|
Determines whether all elements of a sequence exists in a range.
Definition at line 3979 of file stl_algo.h. |
|
Return the difference of two sorted ranges using comparison functor.
Definition at line 4361 of file stl_algo.h. References std::copy(). |
|
Return the difference of two sorted ranges.
Definition at line 4303 of file stl_algo.h. References std::copy(). |
|
Return the intersection of two sorted ranges using comparison functor.
Definition at line 4249 of file stl_algo.h. |
|
Return the intersection of two sorted ranges.
Definition at line 4195 of file stl_algo.h. |
|
Return the symmetric difference of two sorted ranges using comparison functor.
Definition at line 4476 of file stl_algo.h. References std::copy(). |
|
Return the symmetric difference of two sorted ranges.
Definition at line 4415 of file stl_algo.h. References std::copy(). |
|
Return the union of two sorted ranges using a comparison functor.
Definition at line 4134 of file stl_algo.h. References std::copy(). |
|
Return the union of two sorted ranges.
Definition at line 4072 of file stl_algo.h. References std::copy(). |