GaudiUtils::VectorMap< KEY, VALUE, KEYCOMPARE, ALLOCATOR >::_compare_type Struct Reference

The actual structure used to compare the elements Only "key" is important for comparison. More...

#include </builds/gaudi/Gaudi/GaudiKernel/include/GaudiKernel/VectorMap.h>

Inheritance diagram for GaudiUtils::VectorMap< KEY, VALUE, KEYCOMPARE, ALLOCATOR >::_compare_type:

Collaboration diagram for GaudiUtils::VectorMap< KEY, VALUE, KEYCOMPARE, ALLOCATOR >::_compare_type:

Public Member Functions
bool	operator() (const value_type &v1, const value_type &v2) const
	compare pairs (key,mapped): use compare by keys
template<detail::key_comparable< key_type, key_compare > K>
bool	operator() (const K &k, const value_type &v) const
	compare key and pair (key,mapped): use compare by keys
template<detail::key_comparable< key_type, key_compare > K>
bool	operator() (const value_type &v, const K &k) const
	compare pair (key,mapped) and the key: use compare by keys

Detailed Description

template<typename KEY, typename VALUE, typename KEYCOMPARE = std::less<>, typename ALLOCATOR = std::allocator<std::pair<KEY, VALUE>>>
struct GaudiUtils::VectorMap< KEY, VALUE, KEYCOMPARE, ALLOCATOR >::_compare_type

The actual structure used to compare the elements Only "key" is important for comparison.

Definition at line 162 of file VectorMap.h.

Member Function Documentation

operator()() [1/3]

template<typename KEY, typename VALUE, typename KEYCOMPARE = std::less<>, typename ALLOCATOR = std::allocator<std::pair<KEY, VALUE>>>

template<detail::key_comparable< key_type, key_compare > K>

bool GaudiUtils::VectorMap< KEY, VALUE, KEYCOMPARE, ALLOCATOR >::_compare_type::operator() ( const K & k, const value_type & v ) const

inline

compare key and pair (key,mapped): use compare by keys

Definition at line 171 of file VectorMap.h.

                                                               {
        return operator()( k, v.first );
      }

operator()() [2/3]

template<typename KEY, typename VALUE, typename KEYCOMPARE = std::less<>, typename ALLOCATOR = std::allocator<std::pair<KEY, VALUE>>>

template<detail::key_comparable< key_type, key_compare > K>

bool GaudiUtils::VectorMap< KEY, VALUE, KEYCOMPARE, ALLOCATOR >::_compare_type::operator() ( const value_type & v, const K & k ) const

inline

compare pair (key,mapped) and the key: use compare by keys

Definition at line 176 of file VectorMap.h.

                                                               {
        return operator()( v.first, k );
      }

operator()() [3/3]

template<typename KEY, typename VALUE, typename KEYCOMPARE = std::less<>, typename ALLOCATOR = std::allocator<std::pair<KEY, VALUE>>>

bool GaudiUtils::VectorMap< KEY, VALUE, KEYCOMPARE, ALLOCATOR >::_compare_type::operator() ( const value_type & v1, const value_type & v2 ) const

inline

compare pairs (key,mapped): use compare by keys

Definition at line 168 of file VectorMap.h.

{ return operator()( v1.first, v2.first ); }

---

The documentation for this struct was generated from the following file:

• GaudiKernel/include/GaudiKernel/VectorMap.h