unchecked_set_intersection
Same as set_intersection, but allows the use of an unchecked iterator as output iterator when _SECURE_SCL=1 is defined. unchecked_set_intersection is defined in the stdext namespace.
Note
This algorithm is a Microsoft extension to the Standard C++ Library. Code implemented using this algorithm will not be portable.
template<class InputIterator1, class InputIterator2, class OutputIterator>
OutputIterator unchecked_set_intersection(
InputIterator1_First1,
InputIterator1_Last1,
InputIterator2_First2,
InputIterator2_Last2,
OutputIterator_Result
);
template<class InputIterator1, class InputIterator2, class OutputIterator, class BinaryPredicate>
OutputIterator unchecked_set_intersection(
InputIterator1_First1,
InputIterator1_Last1,
InputIterator2_First2,
InputIterator2_Last2,
OutputIterator_Result,
BinaryPredicate_Comp
);
Parameters
_First1
An input iterator addressing the position of the first element in the first of two sorted source ranges to be united and sorted into a single range representing the intersection of the two source ranges._Last1
An input iterator addressing the position one past the last element in the first of two sorted source ranges to be united and sorted into a single range representing the intersection of the two source ranges._First2
An input iterator addressing the position of the first element in second of two consecutive sorted source ranges to be united and sorted into a single range representing the intersection of the two source ranges._Last2
An input iterator addressing the position one past the last element in second of two consecutive sorted source ranges to be united and sorted into a single range representing the intersection of the two source ranges._Result
An output iterator addressing the position of the first element in the destination range where the two source ranges are to be united into a single sorted range representing the intersection of the two source ranges._Comp
User-defined predicate function object that defines the sense in which one element is greater than another. The binary predicate takes two arguments and should return true when the first element is less than the second element and false otherwise.
Return Value
An output iterator addressing the position one past the last element in the sorted destination range representing the intersection of the two source ranges.
Remarks
See set_intersection for a code sample.
For more information on checked iterators, see Checked Iterators.
Requirements
Header: <algorithm>
Namespace: stdext