/cvmfs/atlas.cern.ch/repo/sw/ASG/AnalysisBase/2.4.31/AthContainers/AthContainers/DataList.icc File Reference

An STL list of pointers that by default owns its pointed-to elements. Implementation file. More...

#include "AthContainers/tools/CompareAndPrint.h"
#include "AthContainers/tools/ATHCONTAINERS_ASSERT.h"
#include <limits>
#include "AthContainers/tools/DVLEltBaseInfo.icc"

Classes
struct	DataList_detail::VirtBases< B1, DataModel_detail::NoBase, DataModel_detail::NoBase >
	VirtBases for one class. More...
struct	DataList_detail::VirtBases< B1, B2, DataModel_detail::NoBase >
	VirtBases for two classes. More...
class	DataList_detail::VirtBases< B1, B2, B3 >
	VirtBases for three classes. More...
class	DataList_detail::VirtBases< B1, B2, B3 >
	VirtBases for three classes. More...
Defines
#define	DATALIST   DataList<T, DataModel_detail::NoBase>
#define	DVLTYPE   DataList
Functions
template<class L >
void	DataList_detail::optimizeMeAway_DL (L &, bool)
template<class LIST >
LIST::iterator	DataList_detail::remove_duplicates (LIST &l, bool quiet=false)
	Remove duplicates from a DataList before deleting elements.
template<class T >
bool	operator== (const DataList< T > &a, const DataList< T > &b)
	List equality comparison.
template<class T >
bool	operator!= (const DataList< T > &a, const DataList< T > &b)
	Based on operator==.
template<class T >
bool	operator< (const DataList< T > &a, const DataList< T > &b)
	List ordering relation.
template<class T >
bool	operator> (const DataList< T > &a, const DataList< T > &b)
	Based on operator<.
template<class T >
bool	operator<= (const DataList< T > &a, const DataList< T > &b)
	Based on operator<.
template<class T >
bool	operator>= (const DataList< T > &a, const DataList< T > &b)
	Based on operator<.
template<class T >
void	swap (DataList< T > &a, DataList< T > &b)
	See DataList<T, BASE>::swap().
template<class T >
void	dvl_makecontainer (size_t, DataList< T > *&cont)
	Construct a new container.

---

Detailed Description

An STL list of pointers that by default owns its pointed-to elements. Implementation file.

Author:

scott snyder, Paolo Calafiura, Sebastien Binet, etc

Date:

February 2006; rewritten from earlier version.

---

Function Documentation

template<class T >

void dvl_makecontainer	(	size_t	,
		DataList< T > *&	cont
	)			[inline]

Construct a new container.

Parameters:

	nreserve	Number of elements for which to reserve space. (Ignored if not appropriate.)
	cont[out]	Pointer to the constructed container. (Returned via an argument to allow for template argument deduction.)

Specialization for DataList.

template<class T >

bool operator<	(	const DataList< T > &	a,
		const DataList< T > &	b
	)			[inline]

List ordering relation.

Parameters:

	a	A DataList.
	b	A DataList of the same type as x.

Returns:

True iff x is lexicographically less than y.

This is a total ordering relation. It is linear in the size of the lists. Comparisons are done on the pointer values of the elements.

See std::lexicographical_compare() for how the determination is made.

template<class T >

bool operator==	(	const DataList< T > &	a,
		const DataList< T > &	b
	)			[inline]

List equality comparison.

Parameters:

	a	A DataList.
	b	A DataList of the same type as x.

Returns:

True iff the size and elements of the lists are equal.

This is an equivalence relation. It is linear in the size of the lists. Lists are considered equivalent if their sizes are equal, and if corresponding elements compare equal.

template<class T >

void swap	(	DataList< T > &	a,
		DataList< T > &	b
	)			[inline]

See DataList<T, BASE>::swap().

See DataList<T, BASE>::swap().