Rogue Wave banner
Previous fileTop of documentContentsIndexNext file

includes


Algorithm

Summary

A basic set of operation for sorted sequences.

Data Type and Member Function Indexes
(exclusive of constructors and destructors)

None

Synopsis

#include <algorithm>
template <class InputIterator1, class InputIterator2>
 bool includes (InputIterator1 first1, InputIterator1 last1,
                InputIterator2 first2, 
                InputIterator2 last2);

template <class InputIterator1, class InputIterator2, 
          class Compare>
 bool includes (InputIterator1 first1, InputIterator1 last1,
              InputIterator2 first2, 
              InputIterator2 last2, Compare comp);

Description

The includes algorithm compares two sorted sequences and returns true if every element in the range [first2, last2) is contained in the range [first1, last1). It returns false otherwise. include assumes that the sequences are sorted using the less than operator (operator<), unless an alternative comparison operator (comp) is included.

Complexity

At most ((last1 - first1) + (last2 - first2)) * 2 -1 comparisons are performed.

Example

Program Output

Warnings

If your compiler does not support default template parameters, then you always need to supply the Allocator template argument. For instance, you have to write:

set<int, less<int>, allocator<int> >

instead of:

set<int>

If your compiler does not support namespaces, then you do not need the using declaration for std.

See Also

set,set_union, set_intersection, set_difference, set_symmetric_difference



Previous fileTop of documentContentsIndexNext file
Copyright (c) 1998, Rogue Wave Software, Inc.
Send mail to report errors or comment on the documentation.
OEM Release, June 1998