Functions

Functions

template<typename InputIterator1 , typename InputIterator2 >
bool ustl::includes (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2)
 Returns true if [first2,last2) is a subset of [first1,last1)
 
template<typename InputIterator1 , typename InputIterator2 , typename OutputIterator >
OutputIterator ustl::set_union (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result)
 Merges [first1,last1) with [first2,last2) More...
 
template<typename InputIterator1 , typename InputIterator2 , typename OutputIterator >
OutputIterator ustl::set_intersection (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result)
 Creates a set containing elements shared by the given ranges.
 
template<typename InputIterator1 , typename InputIterator2 , typename OutputIterator >
OutputIterator ustl::set_difference (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result)
 Removes from [first1,last1) elements present in [first2,last2)
 
template<typename InputIterator1 , typename InputIterator2 , typename OutputIterator >
OutputIterator ustl::set_symmetric_difference (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result)
 Performs union of sets A-B and B-A.
 

Detailed Description

Algorithms for working with sorted sets.

Function Documentation

template<typename InputIterator1 , typename InputIterator2 , typename OutputIterator >
OutputIterator ustl::set_union ( InputIterator1  first1,
InputIterator1  last1,
InputIterator2  first2,
InputIterator2  last2,
OutputIterator  result 
)
inline

Merges [first1,last1) with [first2,last2)

Result will contain every element that is in either set. If duplicate elements are present, max(n,m) is placed in the result.


Generated on Mon Sep 28 2015 17:58:50 for uSTL by Doxygen 1.8.10