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.
bool std::includes | ( | InputIterator1 | first1, | |
InputIterator1 | last1, | |||
InputIterator2 | first2, | |||
InputIterator2 | last2, | |||
Compare | comp | |||
) | [inline] |
Determines whether all elements of a sequence exists in a range using comparison.
first1 | Start of search range. | |
last1 | End of search range. | |
first2 | Start of sequence | |
last2 | End of sequence. | |
comp | Comparison function to use. |
Definition at line 4023 of file stl_algo.h.
bool std::includes | ( | InputIterator1 | first1, | |
InputIterator1 | last1, | |||
InputIterator2 | first2, | |||
InputIterator2 | last2 | |||
) | [inline] |
Determines whether all elements of a sequence exists in a range.
first1 | Start of search range. | |
last1 | End of search range. | |
first2 | Start of sequence | |
last2 | End of sequence. |
Definition at line 3976 of file stl_algo.h.
OutputIterator std::set_difference | ( | InputIterator1 | first1, | |
InputIterator1 | last1, | |||
InputIterator2 | first2, | |||
InputIterator2 | last2, | |||
OutputIterator | __result, | |||
Compare | comp | |||
) | [inline] |
Return the difference of two sorted ranges using comparison functor.
first1 | Start of first range. | |
last1 | End of first range. | |
first2 | Start of second range. | |
last2 | End of second range. | |
comp | The comparison functor. |
Definition at line 4358 of file stl_algo.h.
OutputIterator std::set_difference | ( | InputIterator1 | first1, | |
InputIterator1 | last1, | |||
InputIterator2 | first2, | |||
InputIterator2 | last2, | |||
OutputIterator | __result | |||
) | [inline] |
Return the difference of two sorted ranges.
first1 | Start of first range. | |
last1 | End of first range. | |
first2 | Start of second range. | |
last2 | End of second range. |
Definition at line 4300 of file stl_algo.h.
OutputIterator std::set_intersection | ( | InputIterator1 | first1, | |
InputIterator1 | last1, | |||
InputIterator2 | first2, | |||
InputIterator2 | last2, | |||
OutputIterator | __result, | |||
Compare | comp | |||
) | [inline] |
Return the intersection of two sorted ranges using comparison functor.
first1 | Start of first range. | |
last1 | End of first range. | |
first2 | Start of second range. | |
last2 | End of second range. | |
comp | The comparison functor. |
Definition at line 4246 of file stl_algo.h.
OutputIterator std::set_intersection | ( | InputIterator1 | first1, | |
InputIterator1 | last1, | |||
InputIterator2 | first2, | |||
InputIterator2 | last2, | |||
OutputIterator | __result | |||
) | [inline] |
Return the intersection of two sorted ranges.
first1 | Start of first range. | |
last1 | End of first range. | |
first2 | Start of second range. | |
last2 | End of second range. |
Definition at line 4192 of file stl_algo.h.
OutputIterator std::set_symmetric_difference | ( | InputIterator1 | first1, | |
InputIterator1 | last1, | |||
InputIterator2 | first2, | |||
InputIterator2 | last2, | |||
OutputIterator | __result, | |||
Compare | comp | |||
) | [inline] |
Return the symmetric difference of two sorted ranges using comparison functor.
first1 | Start of first range. | |
last1 | End of first range. | |
first2 | Start of second range. | |
last2 | End of second range. | |
comp | The comparison functor. |
Definition at line 4473 of file stl_algo.h.
OutputIterator std::set_symmetric_difference | ( | InputIterator1 | first1, | |
InputIterator1 | last1, | |||
InputIterator2 | first2, | |||
InputIterator2 | last2, | |||
OutputIterator | __result | |||
) | [inline] |
Return the symmetric difference of two sorted ranges.
first1 | Start of first range. | |
last1 | End of first range. | |
first2 | Start of second range. | |
last2 | End of second range. |
Definition at line 4412 of file stl_algo.h.
OutputIterator std::set_union | ( | InputIterator1 | first1, | |
InputIterator1 | last1, | |||
InputIterator2 | first2, | |||
InputIterator2 | last2, | |||
OutputIterator | __result, | |||
Compare | comp | |||
) | [inline] |
Return the union of two sorted ranges using a comparison functor.
first1 | Start of first range. | |
last1 | End of first range. | |
first2 | Start of second range. | |
last2 | End of second range. | |
comp | The comparison functor. |
Definition at line 4131 of file stl_algo.h.
OutputIterator std::set_union | ( | InputIterator1 | first1, | |
InputIterator1 | last1, | |||
InputIterator2 | first2, | |||
InputIterator2 | last2, | |||
OutputIterator | __result | |||
) | [inline] |
Return the union of two sorted ranges.
first1 | Start of first range. | |
last1 | End of first range. | |
first2 | Start of second range. | |
last2 | End of second range. |
Definition at line 4069 of file stl_algo.h.