std Namespace Reference

STL namespace. More...

Namespaces
namespace	pmr

Classes
class	allocator
	STL class.
class	array
	STL class.
class	atomic
	STL class.
class	atomic_ref
	STL class.
class	auto_ptr
	STL class.
class	bad_alloc
	STL class.
class	bad_cast
	STL class.
class	bad_exception
	STL class.
class	bad_typeid
	STL class.
class	basic_fstream
	STL class.
class	basic_ifstream
	STL class.
class	basic_ios
	STL class.
class	basic_iostream
	STL class.
class	basic_istream
	STL class.
class	basic_istringstream
	STL class.
class	basic_ofstream
	STL class.
class	basic_ostream
	STL class.
class	basic_ostringstream
	STL class.
class	basic_string
	STL class.
class	basic_string_view
	STL class.
class	basic_stringstream
	STL class.
class	bitset
	STL class.
class	complex
	STL class.
struct	default_delete< CxxUtils::CRCTable >
class	deque
	STL class.
class	domain_error
	STL class.
class	error_category
	STL class.
class	error_code
	STL class.
class	error_condition
	STL class.
class	exception
	STL class.
struct	formatter< Guid::string >
struct	formatter< ISkipEventIdxSvc::EvtId >
class	forward_list
	STL class.
class	fstream
	STL class.
struct	hash< CP::SystematicSet >
	Specialization of std::hash for std::unordered_map. More...
struct	hash< FlavorTagInference::GNNOptions >
struct	hash< Guid >
struct	hash< HWIdentifier >
struct	hash< Identifier >
struct	hash< IdentifierHash >
struct	hash< ITkPixelOnlineId >
struct	hash< NswAsBuilt::pcbIdentifier_t >
struct	hash< NswAsBuilt::quadrupletIdentifier_t >
struct	hash< NswAsBuilt::stripIdentifier_t >
struct	hash< Trig::Combination >
	Hash function to support associative containers. More...
class	ifstream
	STL class.
class	invalid_argument
	STL class.
class	ios
	STL class.
class	ios_base
	STL class.
class	istream
	STL class.
class	istringstream
	STL class.
class	iterator_traits< TrigConf::ConstIter< V, T > >
class	jthread
	STL class.
class	length_error
	STL class.
class	list
	STL class.
class	lock_guard
	STL class.
class	logic_error
	STL class.
class	map
	STL class.
class	multimap
	STL class.
class	multiset
	STL class.
class	mutex
	STL class.
class	ofstream
	STL class.
class	ostream
	STL class.
class	ostringstream
	STL class.
class	out_of_range
	STL class.
class	overflow_error
	STL class.
class	pair
	STL class.
struct	pair< ElementLink< CONT >, T2 >
	Specialization for a pair containing an ElementLink, allowing for faster initialization. More...
class	priority_queue
	STL class.
class	queue
	STL class.
class	range_error
	STL class.
class	recursive_mutex
	STL class.
class	recursive_timed_mutex
	STL class.
class	runtime_error
	STL class.
class	set
	STL class.
class	shared_lock
	STL class.
class	shared_mutex
	STL class.
class	shared_ptr
	STL class.
class	shared_timed_mutex
	STL class.
class	smart_ptr
	STL class.
class	span
	STL class.
class	stack
	STL class.
class	string
	STL class.
class	string_view
	STL class.
class	stringstream
	STL class.
class	system_error
	STL class.
class	thread
	STL class.
class	timed_mutex
	STL class.
class	u16string
	STL class.
class	u16string_view
	STL class.
class	u32string
	STL class.
class	u32string_view
	STL class.
class	u8string
	STL class.
class	u8string_view
	STL class.
class	underflow_error
	STL class.
class	unique_lock
	STL class.
class	unique_ptr
	STL class.
class	unordered_map
	STL class.
class	unordered_multimap
	STL class.
class	unordered_multiset
	STL class.
class	unordered_set
	STL class.
class	valarray
	STL class.
class	vector
	STL class.
class	weak_ptr
	STL class.
class	wfstream
	STL class.
class	wifstream
	STL class.
class	wios
	STL class.
class	wistream
	STL class.
class	wistringstream
	STL class.
class	wofstream
	STL class.
class	wostream
	STL class.
class	wostringstream
	STL class.
class	wstring
	STL class.
class	wstring_view
	STL class.
class	wstringstream
	STL class.

Functions
template<class DVL, class T>
DataModel_detail::iterator< DVL >	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 >	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 > >	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 > >	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 >	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 >	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 > >	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 > >	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	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	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	reverse (typename DataModel_detail::iterator< DVL > beg, typename DataModel_detail::iterator< DVL > end)
	Specialization of reverse for DataVector/List.
template<class DVL>
void	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 >	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 > >	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 >	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 > >	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	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	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	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	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	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	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	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	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	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	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	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	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	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	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	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	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	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	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.
template<class DV>
void	iter_swap (typename DataModel_detail::iterator< DV > a, typename DataModel_detail::iterator< DV > b)
	Specialization of iter_swap for DataVector/DataList.
template<class DV>
void	iter_swap (typename std::reverse_iterator< DataModel_detail::iterator< DV > > a, typename std::reverse_iterator< DataModel_detail::iterator< DV > > b)
	Specialization of iter_swap for DataVector/DataList.
template<class DV>
DataModel_detail::iterator< DV >	swap_ranges (DataModel_detail::iterator< DV > first1, DataModel_detail::iterator< DV > last1, DataModel_detail::iterator< DV > first2)
	Specialization of swap_ranges for DataVector/DataList.
template<class DV>
std::reverse_iterator< DataModel_detail::iterator< DV > >	swap_ranges (std::reverse_iterator< DataModel_detail::iterator< DV > > first1, std::reverse_iterator< DataModel_detail::iterator< DV > > last1, std::reverse_iterator< DataModel_detail::iterator< DV > > first2)
	Specialization of swap_ranges for DataVector/DataList.
template<typename DOBJ>
void	swap (ElementLinkVector< DOBJ > &lhs, ElementLinkVector< DOBJ > &rhs)
ostream &	operator<< (ostream &s, const SG::VarHandleKey &m)
void	__throw_bad_array_new_length ()
ostream &	operator<< (ostream &s, const SG::VarHandleKeyArray &m)
template<class T_container, class T_Func>
std::size_t	erase_if (T_container &container, T_Func pred)
template<typename T>
std::ostream &	operator<< (std::ostream &os, const std::set< T > &s)
ostream &	operator<< (ostream &s, const Gaudi::Parsers::VecDict_t &vecDict)

Detailed Description

STL namespace.

Iterator traits for the above iterator.

Define a hash functional.

Set a delete policy for unique_ptr<CRCTable>.

This allows us to use an incomplete declaration here, and define the class only in the cxx file.

note that the std::iterator will be deprecated in C++17

Function Documentation

__throw_bad_array_new_length()

void std::__throw_bad_array_new_length

(

)

Definition at line 30 of file excabort.cxx.

{
  std::abort();
}

erase_if()

template<class T_container, class T_Func>

std::size_t std::erase_if ( T_container & container, T_Func pred )

inline

Definition at line 29 of file TruthParticleHitCountAlg.cxx.

                                                                  {
      std::size_t orig_size = container->size();
      for ( typename T_container::iterator iter = container.begin();
            iter != container.end();
            /* increment only if nothing was erased! */ ) {
         if (pred(*iter)) {
            iter = erase(iter);
         }
         else {
            ++iter;
         }
      }
      return orig_size - container->size();
   }

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);
}

iter_swap() [1/2]

template<class DV>

void std::iter_swap	(	typename DataModel_detail::iterator< DV >	a,
		typename DataModel_detail::iterator< DV >	b )

Specialization of iter_swap for DataVector/DataList.

Parameters

a	First iterator for the swap.
b	Second iterator for the swap.

Swaps *a with *b, respecting the DataVector/List ownership rules.

Definition at line 36 of file DVL_iter_swap.h.

{
  DV::iter_swap (a, b);
}

iter_swap() [2/2]

template<class DV>

void std::iter_swap	(	typename std::reverse_iterator< DataModel_detail::iterator< DV > >	a,
		typename std::reverse_iterator< DataModel_detail::iterator< DV > >	b )

Specialization of iter_swap for DataVector/DataList.

Parameters

a	First reverse_iterator for the swap.
b	Second reverse_iterator for the swap.

Swaps *a with *b, respecting the DataVector/List ownership rules.

Definition at line 52 of file DVL_iter_swap.h.

{
  DataModel_detail::iterator<DV> ai = a.base();
  DataModel_detail::iterator<DV> bi = b.base();
  --ai;
  --bi;
  DV::iter_swap (ai, bi);
}

operator<<() [1/4]

ostream & std::operator<<	(	ostream &	s,
		const Gaudi::Parsers::VecDict_t &	vecDict )

Definition at line 790 of file TrigEgammaMonitorBaseAlgorithm.cxx.

  {
    s << '{';
    for ( const auto& dict : vecDict ) {
      Gaudi::Utils::toStream( dict, s );
    }
    s << '}';
    return s;
  }

operator<<() [2/4]

ostream & std::operator<<	(	ostream &	s,
		const SG::VarHandleKey &	m )

Definition at line 158 of file AthToolSupport/AsgDataHandles/Root/VarHandleKey.cxx.

                                                           {
    // s << "'" << m.objKey() << "'";
    s << "'" << m.key() << "'";
    return s;
  }

operator<<() [3/4]

ostream & std::operator<<	(	ostream &	s,
		const SG::VarHandleKeyArray &	m )

Definition at line 60 of file StoreGate/src/VarHandleKeyArray.cxx.

                                                                {
    s << "[" <<  m.toString() << "]";
    return s;
  }

operator<<() [4/4]

template<typename T>

std::ostream & std::operator<<	(	std::ostream &	os,
		const std::set< T > &	s )

Definition at line 44 of file NavigationTesterAlg.cxx.

    {
        os << "{";
        for (auto itr = s.begin(); itr != s.end(); ++itr)
        {
            if (itr != s.begin())
                os << ", ";
            os << *itr;
        }
        return os << "}";
    }

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);
}

swap()

template<typename DOBJ>

void std::swap	(	ElementLinkVector< DOBJ > &	lhs,
		ElementLinkVector< DOBJ > &	rhs )

Definition at line 485 of file AthLinks/ElementLinkVector.h.

                                    {
#ifdef __ELVDEBUG
  std::cout << "std::swap called for lhs " << std::hex << &lhs 
        << " rhs " << &rhs << std::dec << std::endl;  
#endif
  lhs.swap(rhs);
}

swap_ranges() [1/2]

template<class DV>

DataModel_detail::iterator< DV > std::swap_ranges	(	DataModel_detail::iterator< DV >	first1,
		DataModel_detail::iterator< DV >	last1,
		DataModel_detail::iterator< DV >	first2 )

Specialization of swap_ranges for DataVector/DataList.

Parameters

first1	Start of the first range.
last	End of the first range.
first2	Start of the second range.

Swap, element-by-element, the two ranges [first1, last) and [first2, first2+(last-first1)).

Definition at line 74 of file DVL_iter_swap.h.

{
 
  for (; first1 != last1; ++first1, ++first2)
    std::iter_swap(first1, first2);
  return first2;
}

swap_ranges() [2/2]

template<class DV>

std::reverse_iterator< DataModel_detail::iterator< DV > > std::swap_ranges	(	std::reverse_iterator< DataModel_detail::iterator< DV > >	first1,
		std::reverse_iterator< DataModel_detail::iterator< DV > >	last1,
		std::reverse_iterator< DataModel_detail::iterator< DV > >	first2 )

Specialization of swap_ranges for DataVector/DataList.

Parameters

first1	Start of the first range.
last	End of the first range.
first2	Start of the second range.

Swap, element-by-element, the two ranges [first1, last) and [first2, first2+(last-first1)).

Definition at line 96 of file DVL_iter_swap.h.

{
 
  for (; first1 != last1; ++first1, ++first2)
    std::iter_swap(first1, first2);
  return first2;
}

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);
}