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

An STL vector 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 <functional>
#include "AthContainers/tools/DVLEltBaseInfo.icc"

Classes
struct	DataVector_detail::VirtBases< B1, DataModel_detail::NoBase, DataModel_detail::NoBase >
	VirtBases for one class. More...
struct	DataVector_detail::VirtBases< B1, B2, DataModel_detail::NoBase >
	VirtBases for two classes. More...
class	DataVector_detail::VirtBases< B1, B2, B3 >
	VirtBases for three classes. More...
class	DataVector_detail::VirtBases< B1, B2, B3 >
	VirtBases for three classes. More...
Defines
#define	DATAVECTOR   DataVector<T, DataModel_detail::NoBase>
#define	DVLTYPE   DataVector
Functions
template<class FI >
void	DataVector_detail::optimizeMeAway_DV (FI, bool)
template<class ForwIter >
ForwIter	DataVector_detail::remove_duplicates (ForwIter b, ForwIter e, bool quiet=false)
	Remove duplicates from a DataVector before deleting elements.
template<class T >
bool	operator== (const DataVector< T > &a, const DataVector< T > &b)
	Vector equality comparison.
template<class T >
bool	operator!= (const DataVector< T > &a, const DataVector< T > &b)
	Based on operator==.
template<class T >
bool	operator< (const DataVector< T > &a, const DataVector< T > &b)
	Vector ordering relation.
template<class T >
bool	operator> (const DataVector< T > &a, const DataVector< T > &b)
	Based on operator<.
template<class T >
bool	operator<= (const DataVector< T > &a, const DataVector< T > &b)
	Based on operator<.
template<class T >
bool	operator>= (const DataVector< T > &a, const DataVector< T > &b)
	Based on operator<.
template<class T >
void	swap (DataVector< T > &a, DataVector< T > &b)
	See DataVector<T, BASE>::swap().
template<class T >
void	dvl_makecontainer (size_t nreserve, DataVector< T > *&cont)
	Construct a new container.

---

Detailed Description

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

Author:

scott snyder, Paolo Calafiura, etc

Date:

May 2005; rewritten from earlier version.

---

Function Documentation

template<class T >

void dvl_makecontainer	(	size_t	nreserve,
		DataVector< 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 DataVector.

template<class T >

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

Vector ordering relation.

Parameters:

	a	A DataVector.
	b	A DataVector 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 vectors. 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 DataVector< T > &	a,
		const DataVector< T > &	b
	)			[inline]

Vector equality comparison.

Parameters:

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

Returns:

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

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