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.

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. More...
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. More...
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. More...
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. More...
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. More...
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. More...
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. More...
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. More...
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. More...
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. More...
template<class DVL >
void	std::reverse (typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > end)
	Specialization of reverse for DataVector/List. More...
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. More...
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. More...
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. More...
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. More...
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. More...
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. More...
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. More...
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. More...
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. More...
template<class DVL >
void	std::sort (typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > end)
	Specialization of sort for DataVector/List. More...
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. More...
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. More...
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. More...
template<class DVL >
void	std::stable_sort (DataModel_detail::iterator< DVL > beg, DataModel_detail::iterator< DVL > end)
	Specialization of stable_sort for DataVector/List. More...
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. More...
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. More...
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. More...
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. More...
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. More...
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. More...
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. More...
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. More...
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. More...

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.

Function Documentation

inplace_merge() [1/4]

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.

Parameters

beg	The start iterator for the merge operation.
mid	Divider between the two sequences to be merged.
end	The end iterator for the merge operation.

beg, mid, and end should both be iterators from the same DataVector/List. This performs the operation in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 442 of file DVL_algorithms.h.

{
  std::inplace_merge (beg.base(), mid.base(), end.base());
  DataModel_detail::resortAux (beg, end);
}

inplace_merge() [2/4]

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.

Parameters

beg	The start iterator for the merge operation.
mid	Divider between the two sequences to be merged.
end	The end iterator for the merge operation.
comp	The comparison object.

beg, mid, and end should both be iterators from the same DataVector/List. This performs the operation in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 466 of file DVL_algorithms.h.

{
  std::inplace_merge (beg.base(), mid.base(), end.base(),
                      typename DataModel_detail::Compwrapper<DVL, Compare>(comp));
  DataModel_detail::resortAux (beg, end);
}

inplace_merge() [3/4]

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.

Parameters

beg	The start iterator for the merge operation.
mid	Divider between the two sequences to be merged.
end	The end iterator for the merge operation.

beg, mid, and end should both be iterators from the same DataVector/List. This performs the operation in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 491 of file DVL_algorithms.h.

{
  typedef typename DVL::BaseContainer::reverse_iterator ri;
  std::inplace_merge (ri (beg.base().base()),
                      ri (mid.base().base()),
                      ri (end.base().base()));
  DataModel_detail::resortAux (beg, end);
}

inplace_merge() [4/4]

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.

Parameters

beg	The start iterator for the merge operation.
mid	Divider between the two sequences to be merged.
end	The end iterator for the merge operation.
comp	The comparison object.

beg, mid, and end should both be iterators from the same DataVector/List. This performs the operation in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 518 of file DVL_algorithms.h.

{
  typedef typename DVL::BaseContainer::reverse_iterator ri;
  std::inplace_merge (ri (beg.base().base()),
                      ri (mid.base().base()),
                      ri (end.base().base()),
                      typename DataModel_detail::Compwrapper<DVL, Compare>(comp));
  DataModel_detail::resortAux (beg, end);
}

partial_sort() [1/4]

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.

Parameters

beg	The start iterator for the sort.
mid	The middle iterator for the sort.
end	The end iterator for the sort.

beg, mid, and end should both be iterators from the same DataVector/List. This performs the sort in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 734 of file DVL_algorithms.h.

{
  // Wrap the default comparison object,
  // in case someone's overridden operator< for pointers.
  typedef std::less<typename DVL::BaseContainer::value_type> less;
  std::partial_sort (beg.base(), mid.base(), end.base(),
                     DataModel_detail::Compwrapper<DVL, less> (less()));
  DataModel_detail::resortAux (beg, end);
}

partial_sort() [2/4]

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.

Parameters

beg	The start iterator for the sort.
mid	The middle iterator for the sort.
end	The end iterator for the sort.

beg, mid, and end should both be iterators from the same DataVector/List. This performs the sort in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 759 of file DVL_algorithms.h.

{
  std::partial_sort (beg.base(), mid.base(), end.base(),
                     DataModel_detail::Compwrapper<DVL, Compare> (comp));
  DataModel_detail::resortAux (beg, end);
}

partial_sort() [3/4]

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.

Parameters

beg	The start reverse_iterator for the sort.
mid	The middle reverse_iterator for the sort.
end	The end reverse_iterator for the sort.

beg, mid, and end should both be reverse_iterators from the same DataVector/List. This performs the sort in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 782 of file DVL_algorithms.h.

{
  typedef typename DVL::BaseContainer::reverse_iterator ri;
  // Wrap the default comparison object,
  // in case someone's overridden operator< for pointers.
  typedef std::less<typename DVL::BaseContainer::value_type> less;
  std::partial_sort (ri (beg.base().base()),
                     ri (mid.base().base()),
                     ri (end.base().base()),
                     typename DataModel_detail::Compwrapper<DVL, less>
                       (less()));
  DataModel_detail::resortAux (beg, end);
}

partial_sort() [4/4]

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.

Parameters

beg	The start reverse_iterator for the sort.
mid	The middle reverse_iterator for the sort.
end	The end reverse_iterator for the sort.

beg, mid, and end should both be reverse_iterators from the same DataVector/List. This performs the sort in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 811 of file DVL_algorithms.h.

{
  typedef typename DVL::BaseContainer::reverse_iterator ri;
  std::partial_sort (ri (beg.base().base()),
                     ri (mid.base().base()),
                     ri (end.base().base()),
                     typename DataModel_detail::Compwrapper<DVL, Compare>
                       (comp));
  DataModel_detail::resortAux (beg, end);
}

partition() [1/2]

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.

Parameters

beg	The start iterator for the partition operation.
end	The end iterator for the partition operation.
pred	The predicate for the partition.

beg and end should both be iterators from the same DataVector/List. This performs the operation in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 324 of file DVL_algorithms.h.

{
  typename DataModel_detail::iterator<DVL> ret
    (std::partition (beg.base(), end.base(),
                     DataModel_detail::Predwrapper<DVL, Predicate> (pred)),
     beg.container());
  DataModel_detail::resortAux (beg, end);
  return ret;
}

partition() [2/2]

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.

Parameters

beg	The start reverse_iterator for the partition operation.
end	The end reverse_iterator for the partition operation.
pred	The predicate for the partition.

beg and end should both be reverse_iterators from the same DataVector/List. This performs the operation in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 351 of file DVL_algorithms.h.

{
  typedef typename DataModel_detail::iterator<DVL> Iterator;
  typedef typename DVL::BaseContainer::reverse_iterator ri;
  typedef typename DataModel_detail::Predwrapper<DVL, Predicate> pwrap_t;
  std::reverse_iterator<Iterator> ret
    (Iterator (std::partition (ri(beg.base().base()),
                               ri(end.base().base()),
                               pwrap_t (pred)).base(),
               beg.base().container()));
  DataModel_detail::resortAux (beg, end);
  return ret;
}

remove() [1/2]

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.

Parameters

beg	The start iterator for the remove.
end	The end iterator for the remove.
value	The value to remove.

beg and end should both be iterators from the same DataVector/List. This performs the remove in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 49 of file DVL_algorithms.h.

{
  // Implemented with iter_swap, no extra index manipulation needed.
  return DataModel_detail::dvl_remove (beg, end, value);
}

remove() [2/2]

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.

Parameters

beg	The start reverse_iterator for the remove.
end	The end reverse_iterator for the remove.
value	The value to remove.

beg and end should both be reverseIterators from the same DataVector/List. This performs the remove in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 92 of file DVL_algorithms.h.

{
  // Implemented with iter_swap, no extra index manipulation needed.
  return DataModel_detail::dvl_remove (beg, end, value);
}

remove_if() [1/2]

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.

Parameters

beg	The start iterator for the remove.
end	The end iterator for the remove.
pred	The predicate for the removal.

beg and end should both be iterators from the same DataVector/List. This performs the remove in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 70 of file DVL_algorithms.h.

{
  // Implemented with iter_swap, no extra index manipulation needed.
  return DataModel_detail::dvl_remove_if (beg, end, pred);
}

remove_if() [2/2]

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.

Parameters

beg	The start reverse_iterator for the remove.
end	The end reverse_iterator for the remove.
pred	The predicate for the removal.

beg and end should both be reverse_iterators from the same DataVector/List. This performs the remove in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 114 of file DVL_algorithms.h.

{
  // Implemented with iter_swap, no extra index manipulation needed.
  return DataModel_detail::dvl_remove_if (beg, end, pred);
}

reverse() [1/2]

template<class DVL >

void std::reverse	(	typename DataModel_detail::iterator< DVL >	beg,
		typename DataModel_detail::iterator< DVL >	end
	)

Specialization of reverse for DataVector/List.

Parameters

beg	The start iterator for the reverse operation.
end	The end iterator for the reverse operation.

beg and end should both be iterators from the same DataVector/List. This performs the operation in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 280 of file DVL_algorithms.h.

{
  std::reverse (beg.base(), end.base());
  DataModel_detail::resortAux (beg, end);
}

reverse() [2/2]

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.

Parameters

beg	The start reverse_iterator for the reverse operation.
end	The end reverse_iterator for the reverse operation.

beg and end should both be reverse_iterators from the same DataVector/List. This performs the operation in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 301 of file DVL_algorithms.h.

{
  typedef typename DVL::BaseContainer::reverse_iterator ri;
  std::reverse (ri(beg.base().base()), ri(end.base().base()));
  DataModel_detail::resortAux (beg, end);
}

rotate() [1/2]

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.

Parameters

beg	The start iterator for the rotate operation.
mid	The middle iterator for the rotate operation.
end	The end iterator for the rotate operation.

beg and end should both be iterators from the same DataVector/List. This performs the operation in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 221 of file DVL_algorithms.h.

{
  std::rotate (beg.base(), mid.base(), end.base());
  DataModel_detail::resortAux (beg, end);
}

rotate() [2/2]

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.

Parameters

beg	The start reverse_iterator for the rotate operation.
mid	The middle reverse_iterator for the rotate operation.
end	The end reverse_iterator for the rotate operation.

beg and end should both be reverse_iterators from the same DataVector/List. This performs the operation in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 244 of file DVL_algorithms.h.

{
  typedef typename DVL::BaseContainer::reverse_iterator ri;
  std::rotate (ri(beg.base().base()),
               ri(mid.base().base()),
               ri(end.base().base()));
  DataModel_detail::resortAux (beg, end);
}

shuffle() [1/2]

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.

Parameters

beg	The start iterator for the shuffle operation.
end	The end iterator for the shuffle operation.
g	The uniform random number generator.

beg and end should both be iterators from the same DataVector/List. This performs the operation in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 839 of file DVL_algorithms.h.

{
  std::shuffle (beg.base(), end.base(), g);
  DataModel_detail::resortAux (beg, end);
}

shuffle() [2/2]

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.

Parameters

beg	The start reverse_iterator for the shuffle operation.
end	The end reverse_iterator for the shuffle operation.
g	The uniform random number generator.

beg and end should both be reverse_iterators from the same DataVector/List. This performs the operation in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 862 of file DVL_algorithms.h.

{
  typedef typename DVL::BaseContainer::reverse_iterator ri;
  std::shuffle (ri(beg.base().base()),
                ri(end.base().base()),
                g);
  DataModel_detail::resortAux (beg, end);
}

sort() [1/4]

template<class DVL >

void std::sort	(	typename DataModel_detail::iterator< DVL >	beg,
		typename DataModel_detail::iterator< DVL >	end
	)

Specialization of sort for DataVector/List.

Parameters

beg	The start iterator for the sort.
end	The end iterator for the sort.

beg and end should both be iterators from the same DataVector/List. This performs the sort in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 554 of file DVL_algorithms.h.

{
  // Wrap the default comparison object,
  // in case someone's overridden operator< for pointers.
  typedef std::less<typename DVL::BaseContainer::value_type> less;
  std::sort (beg.base(), end.base(),
             typename DataModel_detail::Compwrapper<DVL, less> (less()));
  DataModel_detail::resortAux (beg, end);
}

sort() [2/4]

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.

Parameters

beg	The start iterator for the sort.
end	The end iterator for the sort.
comp	The comparison functional object.

beg and end should both be iterators from the same DataVector/List. This performs the sort in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 577 of file DVL_algorithms.h.

{
  std::sort (beg.base(), end.base(),
             typename DataModel_detail::Compwrapper<DVL, Compare> (comp));
  DataModel_detail::resortAux (beg, end);
}

sort() [3/4]

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.

Parameters

beg	The start reverse_iterator for the sort.
end	The end reverse_iterator for the sort.

beg and end should both be reverse iterators from the same DataVector/List. This performs the sort in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 598 of file DVL_algorithms.h.

{
  typedef typename DVL::BaseContainer::reverse_iterator ri;
  // Wrap the default comparison object,
  // in case someone's overridden operator< for pointers.
  typedef std::less<typename DVL::BaseContainer::value_type> less;
  std::sort (ri (beg.base().base()), ri (end.base().base()),
             typename DataModel_detail::Compwrapper<DVL, less> (less()));
  DataModel_detail::resortAux (beg, end);
}

sort() [4/4]

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.

Parameters

beg	The start reverse_iterator for the sort.
end	The end reverse_iterator for the sort.
comp	The comparison functional object.

beg and end should both be reverse iterators from the same DataVector/List. This performs the sort in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 623 of file DVL_algorithms.h.

{
  typedef typename DVL::BaseContainer::reverse_iterator ri;
  std::sort (ri (beg.base().base()), ri (end.base().base()),
             typename DataModel_detail::Compwrapper<DVL, Compare> (comp));
  DataModel_detail::resortAux (beg, end);
}

stable_partition() [1/2]

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.

Parameters

beg	The start iterator for the partition operation.
end	The end iterator for the partition operation.
pred	The predicate for the partition.

beg and end should both be iterators from the same DataVector/List. This performs the operation in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 382 of file DVL_algorithms.h.

{
  DataModel_detail::iterator<DVL> ret
    (std::stable_partition (beg.base(), end.base(),
                            DataModel_detail::Predwrapper<DVL, Predicate>
                              (pred)),
     beg.container());
  DataModel_detail::resortAux (beg, end);
  return ret;
}

stable_partition() [2/2]

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.

Parameters

beg	The start reverse_iterator for the partition operation.
end	The end reverse_iterator for the partition operation.
pred	The predicate for the partition.

beg and end should both be reverse_iterators from the same DataVector/List. This performs the operation in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 410 of file DVL_algorithms.h.

{
  typedef typename DataModel_detail::iterator<DVL> Iterator;
  typedef typename DVL::BaseContainer::reverse_iterator ri;
  typedef typename DataModel_detail::Predwrapper<DVL, Predicate> pwrap_t;
  std::reverse_iterator<Iterator> ret
    (Iterator (std::stable_partition (ri(beg.base().base()),
                                      ri(end.base().base()),
                                      pwrap_t (pred)).base(),
               beg.base().container()));
  DataModel_detail::resortAux (beg, end);
  return ret;
}

stable_sort() [1/4]

template<class DVL >

void std::stable_sort	(	DataModel_detail::iterator< DVL >	beg,
		DataModel_detail::iterator< DVL >	end
	)

Specialization of stable_sort for DataVector/List.

Parameters

beg	The start iterator for the sort.
end	The end iterator for the sort.

beg and end should both be iterators from the same DataVector/List. This performs the sort in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 644 of file DVL_algorithms.h.

{
  // Wrap the default comparison object,
  // in case someone's overridden operator< for pointers.
  typedef std::less<typename DVL::BaseContainer::value_type> less;
  std::stable_sort (beg.base(), end.base(),
                    DataModel_detail::Compwrapper<DVL, less> (less()));
  DataModel_detail::resortAux (beg, end);
}

stable_sort() [2/4]

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.

Parameters

beg	The start iterator for the sort.
end	The end iterator for the sort.

beg and end should both be iterators from the same DataVector/List. This performs the sort in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 666 of file DVL_algorithms.h.

{
  std::stable_sort (beg.base(), end.base(),
                    DataModel_detail::Compwrapper<DVL, Compare> (comp));
  DataModel_detail::resortAux (beg, end);
}

stable_sort() [3/4]

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.

Parameters

beg	The start reverse_iterator for the sort.
end	The end reverse_iterator for the sort.

beg and end should both be reverse_iterators from the same DataVector/List. This performs the sort in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 687 of file DVL_algorithms.h.

{
  typedef typename DVL::BaseContainer::reverse_iterator ri;
  // Wrap the default comparison object,
  // in case someone's overridden operator< for pointers.
  typedef std::less<typename DVL::BaseContainer::value_type> less;
  std::stable_sort (ri (beg.base().base()), ri (end.base().base()),
                    typename DataModel_detail::Compwrapper<DVL, less> (less()));
  DataModel_detail::resortAux (beg, end);
}

stable_sort() [4/4]

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.

Parameters

beg	The start reverse_iterator for the sort.
end	The end reverse_iterator for the sort.

beg and end should both be reverse_iterators from the same DataVector/List. This performs the sort in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 711 of file DVL_algorithms.h.

{
  typedef typename DVL::BaseContainer::reverse_iterator ri;
  std::stable_sort (ri (beg.base().base()), ri (end.base().base()),
                    typename DataModel_detail::Compwrapper<DVL, Compare>(comp));
  DataModel_detail::resortAux (beg, end);
}

unique() [1/4]

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.

Parameters

beg	The start iterator for the unique operation.
end	The end iterator for the unique operation.
value	The value to remove.

beg and end should both be iterators from the same DataVector/List. This performs the operation in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 135 of file DVL_algorithms.h.

{
  // Implemented with iter_swap, no extra index manipulation needed.
  return DataModel_detail::dvl_unique (beg, end);
}

unique() [2/4]

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.

Parameters

beg	The start iterator for the unique operation.
end	The end iterator for the unique operation.
pred	The predicate for the operation.

beg and end should both be iterators from the same DataVector/List. This performs the operation in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 155 of file DVL_algorithms.h.

{
  // Implemented with iter_swap, no extra index manipulation needed.
  return DataModel_detail::dvl_unique (beg, end, pred);
}

unique() [3/4]

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.

Parameters

beg	The start reverse_iterator for the unique operation.
end	The end reverse_iterator for the unique operation.
value	The value to remove.

beg and end should both be reverse_iterators from the same DataVector/List. This performs the operation in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 177 of file DVL_algorithms.h.

{
  // Implemented with iter_swap, no extra index manipulation needed.
  return DataModel_detail::dvl_unique (beg, end);
}

unique() [4/4]

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.

Parameters

beg	The start reverse_iterator for the unique operation.
end	The end reverse_iterator for the unique operation.
pred	The predicate for the operation.

beg and end should both be reverse_iterators from the same DataVector/List. This performs the operation in a way that doesn't run afoul of DataVector/List's object ownership rules.

Definition at line 199 of file DVL_algorithms.h.

{
  // Implemented with iter_swap, no extra index manipulation needed.
  return DataModel_detail::dvl_unique (beg, end, pred);
}