algorithm.hpp File Reference

#include <utility>
#include <algorithm>
#include <functional>
#include <boost/test/detail/suppress_warnings.hpp>
#include <boost/test/detail/enable_warnings.hpp>

Include dependency graph for algorithm.hpp:

This graph shows which files directly or indirectly include this file:

Namespaces
	boost
	Duration formatting facet for input.
	boost::unit_test

Functions
template<class InputIter1 , class InputIter2 >
std::pair< InputIter1, InputIter2 >	boost::unit_test::mismatch (InputIter1 first1, InputIter1 last1, InputIter2 first2, InputIter2 last2)
	this algorithm search through two collections for first mismatch position that get returned as a pair of iterators, first pointing to the mismatch position in first collection, second iterator in second one More...
template<class InputIter1 , class InputIter2 , class Predicate >
std::pair< InputIter1, InputIter2 >	boost::unit_test::mismatch (InputIter1 first1, InputIter1 last1, InputIter2 first2, InputIter2 last2, Predicate pred)
	this algorithm search through two collections for first mismatch position that get returned as a pair of iterators, first pointing to the mismatch position in first collection, second iterator in second one. More...
template<class ForwardIterator1 , class ForwardIterator2 >
ForwardIterator1	boost::unit_test::find_first_not_of (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2)
	this algorithm search through first collection for first element that does not belong a second one More...
template<class ForwardIterator1 , class ForwardIterator2 , class Predicate >
ForwardIterator1	boost::unit_test::find_first_not_of (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, Predicate pred)
	this algorithm search through first collection for first element that does not satisfy binary predicate in conjunction will any element in second collection More...
template<class BidirectionalIterator1 , class ForwardIterator2 >
BidirectionalIterator1	boost::unit_test::find_last_of (BidirectionalIterator1 first1, BidirectionalIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2)
	this algorithm search through first collection for last element that belongs to a second one More...
template<class BidirectionalIterator1 , class ForwardIterator2 , class Predicate >
BidirectionalIterator1	boost::unit_test::find_last_of (BidirectionalIterator1 first1, BidirectionalIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, Predicate pred)
	this algorithm search through first collection for last element that satisfy binary predicate in conjunction will at least one element in second collection More...
template<class BidirectionalIterator1 , class ForwardIterator2 >
BidirectionalIterator1	boost::unit_test::find_last_not_of (BidirectionalIterator1 first1, BidirectionalIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2)
	this algorithm search through first collection for last element that does not belong to a second one More...
template<class BidirectionalIterator1 , class ForwardIterator2 , class Predicate >
BidirectionalIterator1	boost::unit_test::find_last_not_of (BidirectionalIterator1 first1, BidirectionalIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, Predicate pred)
	this algorithm search through first collection for last element that does not satisfy binary predicate in conjunction will any element in second collection More...