stlsoft/algorithms/unordered.hpp File Reference

---

Detailed Description

[C++ only] Algorithms for manipulating unordered sequences (Algorithms Library).

#include <stlsoft/stlsoft.h>
#include <stlsoft/algorithms/std/alt.hpp>
#include <functional>

Go to the source code of this file.

Namespaces
namespace	stlsoft
Functions
template<typename I>
std::pair< I, I >	find_first_duplicate (I first, I last)
	Finds the first duplicate item in the unordered sequence [first, last).
template<typename I, typename BP>
std::pair< I, I >	find_first_duplicate (I first, I last, BP pred)
template<typename FI>
FI	unordered_unique (FI first, FI last)
template<typename FI, typename BP>
FI	unordered_unique (FI first, FI last, BP pred)
template<typename FI, typename BP>
FI	unordered_unique_if (FI first, FI last, BP pred)
template<typename FI, typename OI>
OI	unordered_unique_copy (FI first, FI last, OI dest)
template<typename C, typename BP>
void	remove_duplicates_from_unordered_sequence (C &container, BP pred)
	This algorithm removes duplicate entries from unordered sequences.
template<typename C>
void	remove_duplicates_from_unordered_sequence (C &container)
	This algorithm removes duplicate entries from unordered sequences.
template<typename I>
I	skip_equal (I first, I last)
	Skips along from a given iteration point to the first subsequent iteration point whose value is not equal to that of the starting point.
template<typename I1, typename I2>
bool	unordered_includes (I1 first1, I1 last1, I2 first2, I2 last2)
	Determines whether all elements from the range [first2, last2) are contained within the range [first1, last1).