Difference between revisions of "cpp/algorithm/set difference"
m (Text replace - "===Equivalent function===" to "===Possible implementation===") |
m (Text replace - "{{example cpp" to "{{example") |
||
| Line 80: | Line 80: | ||
===Example=== | ===Example=== | ||
| − | {{example | + | {{example |
| | | | ||
| code= | | code= | ||
Revision as of 15:34, 19 April 2012
Template:cpp/algorithm/sidebar Template:ddcl list begin <tr class="t-dsc-header">
<td><algorithm>
<td></td> <td></td> </tr> <tr class="t-dcl ">
<td >OutputIterator set_difference( InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
<td > (1) </td> <td class="t-dcl-nopad"> </td> </tr> <tr class="t-dcl ">
<td > class OutputIterator, class Compare >
OutputIterator set_difference( InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
<td > (2) </td> <td class="t-dcl-nopad"> </td> </tr> Template:ddcl list end
Copies the elements from the sorted range [first1, last1) which are not found in the sorted range [first2, last2) to the range beginning at d_first. The resulting range is also sorted. The first version expects both input ranges to be sorted with Template:cpp, the second version expects them to be sorted with the given comparison function comp. Equivalent elements are treated individually, that is, if some element is found m times in [first1, last1) and n times in [first2, last2), it will be copied to d_first exactly Template:cpp times. The resulting range cannot overlap with either of the input ranges.
Contents |
Parameters
| first1, last1 | - | the range of elements to examine |
| first2, last2 | - | the range of elements to search for |
| comp | - | comparison function object (i.e. an object that satisfies the requirements of Compare) which returns true if the first argument is less than the second. The signature of the comparison function should be equivalent to the following: bool cmp(const Type1& a, const Type2& b); While the signature does not need to have const&, the function must not modify the objects passed to it and must be able to accept all values of type (possibly const) |
Return value
Iterator past the end of the constructed range.
Complexity
At most 2·(N1+N2-1) comparisons, where N1 Template:cpp and N2 Template:cpp.
Possible implementation
Example
| This section is incomplete Reason: no example |
