In article <gp********************************@4ax.com>,

Dylan <sp******@ontheball.com> wrote:

Is there an STL algorithm that will return true if each element in

coll1 is present in coll2

template <class InputIterator1, class InputIterator2>

bool includes(InputIterator1 first1, InputIterator1 last1,

InputIterator2 first2, InputIterator2 last2);

template <class InputIterator1, class InputIterator2,

class StrictWeakOrdering>

bool includes(InputIterator1 first1, InputIterator1 last1,

InputIterator2 first2, InputIterator2 last2,

StrictWeakOrdering comp);

Includes tests whether one sorted range includes another sorted range.

That is, it returns true if and only if, for every element in [first2,

last2), an equivalent element [1] is also present in [first1, last1)

[2]. Both [first1, last1) and [first2, last2) must be sorted in

ascending order.