DVL_algorithms.h File Reference

Specializations of STL algorithms to work with DataVector/List. More...

#include "AthContainers/tools/DVLIterator.h"
#include <iterator>
#include <algorithm>
#include "AthContainers/tools/DVL_algorithms.icc"

Include dependency graph for DVL_algorithms.h:

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

Go to the source code of this file.

Namespaces
namespace	std
	STL namespace.

Functions
template<class DVL, class T>
DataModel_detail::iterator< DVL >	std::remove (typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > end, const T &value)
	Specialization of remove for DataVector/List.
template<class DVL, class Predicate>
DataModel_detail::iterator< DVL >	std::remove_if (typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > end, Predicate pred)
	Specialization of remove_if for DataVector/List.
template<class DVL, class T>
std::reverse_iterator< DataModel_detail::iterator< DVL > >	std::remove (typename std::reverse_iterator< DataModel_detail::iterator< DVL > > beg, typename std::reverse_iterator< DataModel_detail::iterator< DVL > > end, const T &value)
	Specialization of remove for DataVector/List.
template<class DVL, class Predicate>
std::reverse_iterator< DataModel_detail::iterator< DVL > >	std::remove_if (typename std::reverse_iterator< DataModel_detail::iterator< DVL > > beg, typename std::reverse_iterator< DataModel_detail::iterator< DVL > > end, Predicate pred)
	Specialization of remove_if for DataVector/List.
template<class DVL>
DataModel_detail::iterator< DVL >	std::unique (typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > end)
	Specialization of unique for DataVector/List.
template<class DVL, class BinaryPredicate>
DataModel_detail::iterator< DVL >	std::unique (typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > end, BinaryPredicate pred)
	Specialization of unique for DataVector/List.
template<class DVL>
std::reverse_iterator< DataModel_detail::iterator< DVL > >	std::unique (typename std::reverse_iterator< DataModel_detail::iterator< DVL > > beg, typename std::reverse_iterator< DataModel_detail::iterator< DVL > > end)
	Specialization of unique for DataVector/List.
template<class DVL, class BinaryPredicate>
std::reverse_iterator< DataModel_detail::iterator< DVL > >	std::unique (typename std::reverse_iterator< DataModel_detail::iterator< DVL > > beg, typename std::reverse_iterator< DataModel_detail::iterator< DVL > > end, BinaryPredicate pred)
	Specialization of unique for DataVector/List.
template<class DVL>
void	std::rotate (typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > mid, typename DataModel_detail::iterator< DVL > end)
	Specialization of rotate for DataVector/List.
template<class DVL>
void	std::rotate (typename std::reverse_iterator< DataModel_detail::iterator< DVL > > beg, typename std::reverse_iterator< DataModel_detail::iterator< DVL > > mid, typename std::reverse_iterator< DataModel_detail::iterator< DVL > > end)
	Specialization of rotate for DataVector/List.
template<class DVL>
void	std::reverse (typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > end)
	Specialization of reverse for DataVector/List.
template<class DVL>
void	std::reverse (typename std::reverse_iterator< DataModel_detail::iterator< DVL > > beg, typename std::reverse_iterator< DataModel_detail::iterator< DVL > > end)
	Specialization of reverse for DataVector/List.
template<class DVL, class Predicate>
DataModel_detail::iterator< DVL >	std::partition (typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > end, Predicate pred)
	Specialization of partition for DataVector/List.
template<class DVL, class Predicate>
std::reverse_iterator< DataModel_detail::iterator< DVL > >	std::partition (typename std::reverse_iterator< DataModel_detail::iterator< DVL > > beg, typename std::reverse_iterator< DataModel_detail::iterator< DVL > > end, Predicate pred)
	Specialization of partition for DataVector/List.
template<class DVL, class Predicate>
DataModel_detail::iterator< DVL >	std::stable_partition (typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > end, Predicate pred)
	Specialization of stable_partition for DataVector/List.
template<class DVL, class Predicate>
std::reverse_iterator< DataModel_detail::iterator< DVL > >	std::stable_partition (typename std::reverse_iterator< DataModel_detail::iterator< DVL > > beg, typename std::reverse_iterator< DataModel_detail::iterator< DVL > > end, Predicate pred)
	Specialization of stable_partition for DataVector/List.
template<class DVL>
void	std::inplace_merge (typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > mid, typename DataModel_detail::iterator< DVL > end)
	Specialization of inplace_merge for DataVector/List.
template<class DVL, class Compare>
void	std::inplace_merge (typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > mid, typename DataModel_detail::iterator< DVL > end, Compare comp)
	Specialization of inplace_merge for DataVector/List.
template<class DVL>
void	std::inplace_merge (typename std::reverse_iterator< DataModel_detail::iterator< DVL > > beg, typename std::reverse_iterator< DataModel_detail::iterator< DVL > > mid, typename std::reverse_iterator< DataModel_detail::iterator< DVL > > end)
	Specialization of inplace_merge for DataVector/List.
template<class DVL, class Compare>
void	std::inplace_merge (typename std::reverse_iterator< DataModel_detail::iterator< DVL > > beg, typename std::reverse_iterator< DataModel_detail::iterator< DVL > > mid, typename std::reverse_iterator< DataModel_detail::iterator< DVL > > end, Compare comp)
	Specialization of inplace_merge for DataVector/List.
template<class DVL>
void	std::sort (typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > end)
	Specialization of sort for DataVector/List.
template<class DVL, class Compare>
void	std::sort (typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > end, Compare comp)
	Specialization of sort for DataVector/List.
template<class DVL>
void	std::sort (typename std::reverse_iterator< DataModel_detail::iterator< DVL > > beg, typename std::reverse_iterator< DataModel_detail::iterator< DVL > > end)
	Specialization of sort for DataVector/List.
template<class DVL, class Compare>
void	std::sort (typename std::reverse_iterator< DataModel_detail::iterator< DVL > > beg, typename std::reverse_iterator< DataModel_detail::iterator< DVL > > end, const Compare &comp)
	Specialization of sort for DataVector/List.
template<class DVL>
void	std::stable_sort (DataModel_detail::iterator< DVL > beg, DataModel_detail::iterator< DVL > end)
	Specialization of stable_sort for DataVector/List.
template<class DVL, class Compare>
void	std::stable_sort (DataModel_detail::iterator< DVL > beg, DataModel_detail::iterator< DVL > end, Compare comp)
	Specialization of stable_sort for DataVector/List.
template<class DVL>
void	std::stable_sort (std::reverse_iterator< DataModel_detail::iterator< DVL > > beg, std::reverse_iterator< DataModel_detail::iterator< DVL > > end)
	Specialization of stable_sort for DataVector/List.
template<class DVL, class Compare>
void	std::stable_sort (std::reverse_iterator< DataModel_detail::iterator< DVL > > beg, std::reverse_iterator< DataModel_detail::iterator< DVL > > end, Compare comp)
	Specialization of stable_sort for DataVector/List.
template<class DVL>
void	std::partial_sort (DataModel_detail::iterator< DVL > beg, DataModel_detail::iterator< DVL > mid, DataModel_detail::iterator< DVL > end)
	Specialization of partial_sort for DataVector/List.
template<class DVL, class Compare>
void	std::partial_sort (DataModel_detail::iterator< DVL > beg, DataModel_detail::iterator< DVL > mid, DataModel_detail::iterator< DVL > end, Compare comp)
	Specialization of partial_sort for DataVector/List.
template<class DVL>
void	std::partial_sort (std::reverse_iterator< DataModel_detail::iterator< DVL > > beg, std::reverse_iterator< DataModel_detail::iterator< DVL > > mid, std::reverse_iterator< DataModel_detail::iterator< DVL > > end)
	Specialization of partial_sort for DataVector/List.
template<class DVL, class Compare>
void	std::partial_sort (std::reverse_iterator< DataModel_detail::iterator< DVL > > beg, std::reverse_iterator< DataModel_detail::iterator< DVL > > mid, std::reverse_iterator< DataModel_detail::iterator< DVL > > end, Compare comp)
	Specialization of partial_sort for DataVector/List.
template<class DVL, class UniformRandom>
void	std::shuffle (typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > end, UniformRandom &g)
	Specialization of shuffle for DataVector/List.
template<class DVL, class UniformRandom>
void	std::shuffle (typename std::reverse_iterator< DataModel_detail::iterator< DVL > > beg, typename std::reverse_iterator< DataModel_detail::iterator< DVL > > end, UniformRandom &g)
	Specialization of shuffle for DataVector/List.

Detailed Description

Specializations of STL algorithms to work with DataVector/List.

Author

scott snyder snyde.nosp@m.r@bn.nosp@m.l.gov

Date

Sep, 2010

Definition in file DVL_algorithms.h.