The Gaudi Framework  master (ff829712)
Loading...
Searching...
No Matches
SharedObjectsContainer< TYPE > Class Template Reference

Very simple class to represent the container of objects which are not owned by this container. More...

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

Inheritance diagram for SharedObjectsContainer< TYPE >:
Collaboration diagram for SharedObjectsContainer< TYPE >:

Public Types

typedef std::vector< const TYPE * > ConstVector
 the actual container type
 
typedef ConstVector::value_type value_type
 
typedef ConstVector::size_type size_type
 
typedef ConstVector::reference reference
 
typedef ConstVector::const_reference const_reference
 
typedef ConstVector::iterator iterator
 
typedef ConstVector::const_iterator const_iterator
 
typedef ConstVector::reverse_iterator reverse_iterator
 
typedef ConstVector::const_reverse_iterator const_reverse_iterator
 
- Public Types inherited from ObjectContainerBase
typedef size_t size_type
 size_type, to conform the STL container interface
 

Public Member Functions

 SharedObjectsContainer ()=default
 
 SharedObjectsContainer (SharedObjectsContainer &&)=default
 
SharedObjectsContaineroperator= (SharedObjectsContainer &&)=default
 
 SharedObjectsContainer (const ConstVector &data)
 
 SharedObjectsContainer (ConstVector &&data)
 
template<class DATA>
 SharedObjectsContainer (DATA first, DATA last)
 the templated constructor from the pair of iterators
 
template<class DATA, class PREDICATE>
 SharedObjectsContainer (DATA first, DATA last, const PREDICATE &cut)
 the templated constructor from the pair of iterators and the predicate.
 
const CLIDclID () const override
 Retrieve the unique class ID (virtual)
 
const ConstVectordata () const
 get the access to the underlying container (const)
 
 operator const ConstVector & () const
 cast to the underlying container
 
size_type size () const
 get the actual size of the container
 
bool empty () const
 empty container?
 
void push_back (const TYPE *object)
 insert one object into the container
 
void insert (const TYPE *object)
 insert one object into the container
 
template<class DATA>
void insert (DATA first, DATA last)
 add the sequence of objects into the container
 
template<class DATA, class PREDICATE>
void insert (DATA first, DATA last, const PREDICATE &cut)
 add the sequence of 'good'objects into the container
 
template<class OUTPUT, class PREDICATE>
OUTPUT get (const PREDICATE &cut, OUTPUT output) const
 get from the container all objects which satisfy the certain criteria
 
void erase (iterator i)
 erase the object by iterator
 
template<class PREDICATE>
void erase (const PREDICATE &cut)
 erase the objects which satisfy the criteria
 
bool erase (const TYPE *object)
 erase the first occurance of the certain element
 
reference operator[] (size_type index)
 index access
 
const_reference operator[] (size_type index) const
 index access (const-version)
 
reference operator() (size_type index)
 'functional'-access
 
const_reference operator() (size_type index) const
 'functional'-access (const version)
 
reference at (size_type index)
 checked access
 
const_reference at (size_type index) const
 checked access (const-version)
 
iterator begin ()
 
iterator end ()
 
const_iterator begin () const
 
const_iterator end () const
 
reverse_iterator rbegin ()
 
reverse_iterator rend ()
 
const_reverse_iterator rbegin () const
 
const_reverse_iterator rend () const
 
reference front ()
 the first element (only for non-empty vectors)
 
const_reference front () const
 the first element (only for non-empty vectors) (const-version)
 
reference back ()
 the last element (only for non-empty vectors)
 
const_reference back () const
 the last element (only for non-empty vectors) (const-version)
 
bool operator== (const SharedObjectsContainer &right) const
 equal content with other container ?
 
bool operator== (const ConstVector &right) const
 equal content with corresponding vector ?
 
bool operator< (const SharedObjectsContainer &right) const
 comparisons with other container
 
bool operator< (const ConstVector &right) const
 comparisons with corresponding vector
 
long index (const ContainedObject *object) const override
 Distance of a given object from the beginning of its container.
 
const ContainedObjectcontainedObject (long index) const override
 Pointer to an object of a given distance.
 
ContainedObjectcontainedObject (long index) override
 
size_type numberOfObjects () const override
 Number of objects in the container.
 
long add (ContainedObject *object) override
 Virtual functions (forwards to the concrete container definitions) Add an object to the container.
 
long remove (ContainedObject *value) override
 Release object from the container (the pointer will be removed from the container, but the object itself will remain alive).
 
- Public Member Functions inherited from DataObject
 DataObject ()
 Standard Constructor.
 
 DataObject (const DataObject &rhs)
 Copy Constructor.
 
DataObjectoperator= (const DataObject &rhs)
 Assignment Operator.
 
 DataObject (DataObject &&rhs)
 Move Constructor.
 
DataObjectoperator= (DataObject &&rhs)
 Move Assignment Operator.
 
virtual ~DataObject ()
 Standard Destructor.
 
virtual unsigned long addRef ()
 Add reference to object.
 
virtual unsigned long release ()
 release reference to object
 
const std::string & name () const
 Retreive DataObject name. It is the name when registered in the store.
 
virtual StatusCode update ()
 Provide empty placeholder for internal object reconfiguration callback.
 
void setRegistry (IRegistry *pRegistry)
 Set pointer to Registry.
 
IRegistryregistry () const
 Get pointer to Registry.
 
LinkManagerlinkMgr ()
 Retrieve Link manager.
 
const LinkManagerlinkMgr () const
 
unsigned char version () const
 Retrieve version number of this object representation.
 
void setVersion (unsigned char vsn)
 Set version number of this object representation.
 
unsigned long refCount () const
 Return the refcount.
 
virtual std::ostream & fillStream (std::ostream &s) const
 Fill the output stream (ASCII)
 

Static Public Member Functions

static const CLIDclassID ()
 Retrieve the unuqie class ID (static)
 
- Static Public Member Functions inherited from DataObject
static const CLIDclassID ()
 Retrieve reference to class definition structure (static access)
 

Private Attributes

ConstVector m_data
 

Additional Inherited Members

- Protected Member Functions inherited from ObjectContainerBase
 ObjectContainerBase ()=default
 Constructor.
 
 ObjectContainerBase (ObjectContainerBase &&)=default
 
ObjectContainerBaseoperator= (ObjectContainerBase &&)=default
 
 ~ObjectContainerBase () override=default
 

Detailed Description

template<class TYPE>
class SharedObjectsContainer< TYPE >

Very simple class to represent the container of objects which are not owned by this container.

This concept seem to be very useful for LHCb HLT, DaVinci, tracking, alignments.

Warning
the container is not persistable (on-purpose)
Author
Vanya BELYAEV Ivan..nosp@m.Bely.nosp@m.aev@n.nosp@m.ikhe.nosp@m.f.nl
Date
2008-07-23

Definition at line 31 of file SharedObjectsContainer.h.

Member Typedef Documentation

◆ const_iterator

template<class TYPE>
typedef ConstVector::const_iterator SharedObjectsContainer< TYPE >::const_iterator

Definition at line 41 of file SharedObjectsContainer.h.

◆ const_reference

template<class TYPE>
typedef ConstVector::const_reference SharedObjectsContainer< TYPE >::const_reference

Definition at line 39 of file SharedObjectsContainer.h.

◆ const_reverse_iterator

template<class TYPE>
typedef ConstVector::const_reverse_iterator SharedObjectsContainer< TYPE >::const_reverse_iterator

Definition at line 43 of file SharedObjectsContainer.h.

◆ ConstVector

template<class TYPE>
typedef std::vector<const TYPE*> SharedObjectsContainer< TYPE >::ConstVector

the actual container type

Definition at line 34 of file SharedObjectsContainer.h.

◆ iterator

template<class TYPE>
typedef ConstVector::iterator SharedObjectsContainer< TYPE >::iterator

Definition at line 40 of file SharedObjectsContainer.h.

◆ reference

template<class TYPE>
typedef ConstVector::reference SharedObjectsContainer< TYPE >::reference

Definition at line 38 of file SharedObjectsContainer.h.

◆ reverse_iterator

template<class TYPE>
typedef ConstVector::reverse_iterator SharedObjectsContainer< TYPE >::reverse_iterator

Definition at line 42 of file SharedObjectsContainer.h.

◆ size_type

template<class TYPE>
typedef ConstVector::size_type SharedObjectsContainer< TYPE >::size_type

Definition at line 37 of file SharedObjectsContainer.h.

◆ value_type

template<class TYPE>
typedef ConstVector::value_type SharedObjectsContainer< TYPE >::value_type

Definition at line 36 of file SharedObjectsContainer.h.

Constructor & Destructor Documentation

◆ SharedObjectsContainer() [1/6]

template<class TYPE>
SharedObjectsContainer< TYPE >::SharedObjectsContainer ( )
default

◆ SharedObjectsContainer() [2/6]

template<class TYPE>
SharedObjectsContainer< TYPE >::SharedObjectsContainer ( SharedObjectsContainer< TYPE > && )
default

◆ SharedObjectsContainer() [3/6]

template<class TYPE>
SharedObjectsContainer< TYPE >::SharedObjectsContainer ( const ConstVector & data)
inline

Definition at line 48 of file SharedObjectsContainer.h.

48: m_data( data ) {}
const ConstVector & data() const
get the access to the underlying container (const)

◆ SharedObjectsContainer() [4/6]

template<class TYPE>
SharedObjectsContainer< TYPE >::SharedObjectsContainer ( ConstVector && data)
inline

Definition at line 49 of file SharedObjectsContainer.h.

49: m_data( std::move( data ) ) {}
Very simple class to represent the container of objects which are not owned by this container.

◆ SharedObjectsContainer() [5/6]

template<class TYPE>
template<class DATA>
SharedObjectsContainer< TYPE >::SharedObjectsContainer ( DATA first,
DATA last )
inline

the templated constructor from the pair of iterators

Parameters
first'begin'-iterator of the input sequence
last'last'-iterator of the input sequence

Definition at line 56 of file SharedObjectsContainer.h.

56: m_data( first, last ) {}

◆ SharedObjectsContainer() [6/6]

template<class TYPE>
template<class DATA, class PREDICATE>
SharedObjectsContainer< TYPE >::SharedObjectsContainer ( DATA first,
DATA last,
const PREDICATE & cut )
inline

the templated constructor from the pair of iterators and the predicate.

Only the elements which satisfy the criteria goes into the container e.g. create the container only with "basic" particles:

// some sequence of someting, convertiblle to "const LHCb::Particle*":
SEQUENCE source = ... ;
PARTICLES* particles = new PARTICLES
( source.begin() ,
source.end () ,
std::mem_fun(&LHCb::Particle::isBasic) ) ;
SharedObjectsContainer()=default
Parameters
first'begin'-iterator if the input sequence
last'last'-iterator of the input sequence
cutpre predicate

Definition at line 81 of file SharedObjectsContainer.h.

81 {
82 insert( first, last, cut );
83 }
void insert(const TYPE *object)
insert one object into the container

Member Function Documentation

◆ add()

template<class TYPE>
long SharedObjectsContainer< TYPE >::add ( ContainedObject * object)
inlineoverridevirtual

Virtual functions (forwards to the concrete container definitions) Add an object to the container.

On success the object's index is returned.

Implements ObjectContainerBase.

Definition at line 292 of file SharedObjectsContainer.h.

292 {
293 if ( !object ) { return -1; }
294 TYPE* _obj = dynamic_cast<TYPE*>( object );
295 if ( !_obj ) { return -1; }
296 const size_type pos = size();
297 push_back( _obj );
298 return pos;
299 }
size_type size() const
get the actual size of the container
ConstVector::size_type size_type
void push_back(const TYPE *object)
insert one object into the container

◆ at() [1/2]

template<class TYPE>
reference SharedObjectsContainer< TYPE >::at ( size_type index)
inline

checked access

Definition at line 237 of file SharedObjectsContainer.h.

237{ return m_data.at( index ); }
long index(const ContainedObject *object) const override
Distance of a given object from the beginning of its container.

◆ at() [2/2]

template<class TYPE>
const_reference SharedObjectsContainer< TYPE >::at ( size_type index) const
inline

checked access (const-version)

Definition at line 239 of file SharedObjectsContainer.h.

239{ return m_data.at( index ); }

◆ back() [1/2]

template<class TYPE>
reference SharedObjectsContainer< TYPE >::back ( )
inline

the last element (only for non-empty vectors)

Definition at line 253 of file SharedObjectsContainer.h.

253{ return m_data.back(); }

◆ back() [2/2]

template<class TYPE>
const_reference SharedObjectsContainer< TYPE >::back ( ) const
inline

the last element (only for non-empty vectors) (const-version)

Definition at line 255 of file SharedObjectsContainer.h.

255{ return m_data.back(); }

◆ begin() [1/2]

template<class TYPE>
iterator SharedObjectsContainer< TYPE >::begin ( )
inline

Definition at line 240 of file SharedObjectsContainer.h.

240{ return m_data.begin(); }

◆ begin() [2/2]

template<class TYPE>
const_iterator SharedObjectsContainer< TYPE >::begin ( ) const
inline

Definition at line 242 of file SharedObjectsContainer.h.

242{ return m_data.begin(); }

◆ classID()

template<class TYPE>
static const CLID & SharedObjectsContainer< TYPE >::classID ( )
inlinestatic

Retrieve the unuqie class ID (static)

Definition at line 88 of file SharedObjectsContainer.h.

88 {
89 static const CLID s_clid = ( ( static_cast<CLID>( -1 ) << 16 ) // 16 used and 16 empty bits
90 & !CLID_ObjectVector // not an ObjectVector
91 & !CLID_ObjectList // not an ObjectList
92 & !static_cast<CLID>( 0x00030000 ) // not a KeyedContainer/map
93 & !static_cast<CLID>( 0x00040000 ) ) // not a KeyedContainer/hashmap
94 + TYPE::classID(); // the specific CLID from the contents
95 //
96 return s_clid;
97 }

◆ clID()

template<class TYPE>
const CLID & SharedObjectsContainer< TYPE >::clID ( ) const
inlineoverridevirtual

Retrieve the unique class ID (virtual)

Reimplemented from DataObject.

Definition at line 86 of file SharedObjectsContainer.h.

static const CLID & classID()
Retrieve the unuqie class ID (static)

◆ containedObject() [1/2]

template<class TYPE>
const ContainedObject * SharedObjectsContainer< TYPE >::containedObject ( long index) const
inlineoverridevirtual

Pointer to an object of a given distance.

Parameters
indexth eindex to be checked
Returns
the object

Implements ObjectContainerBase.

Definition at line 278 of file SharedObjectsContainer.h.

278 {
279 if ( 0 > index || !( index < (long)size() ) ) { return nullptr; }
280 return m_data[index];
281 }

◆ containedObject() [2/2]

template<class TYPE>
ContainedObject * SharedObjectsContainer< TYPE >::containedObject ( long index)
inlineoverridevirtual

Implements ObjectContainerBase.

Definition at line 282 of file SharedObjectsContainer.h.

282 {
283 if ( 0 > index || !( index < (long)size() ) ) { return nullptr; }
284 return &const_cast<TYPE&>( *m_data[index] );
285 }

◆ data()

template<class TYPE>
const ConstVector & SharedObjectsContainer< TYPE >::data ( ) const
inline

get the access to the underlying container (const)

Definition at line 99 of file SharedObjectsContainer.h.

99{ return m_data; }

◆ empty()

template<class TYPE>
bool SharedObjectsContainer< TYPE >::empty ( ) const
inline

empty container?

Definition at line 105 of file SharedObjectsContainer.h.

105{ return m_data.empty(); }

◆ end() [1/2]

template<class TYPE>
iterator SharedObjectsContainer< TYPE >::end ( )
inline

Definition at line 241 of file SharedObjectsContainer.h.

241{ return m_data.end(); }

◆ end() [2/2]

template<class TYPE>
const_iterator SharedObjectsContainer< TYPE >::end ( ) const
inline

Definition at line 243 of file SharedObjectsContainer.h.

243{ return m_data.end(); }

◆ erase() [1/3]

template<class TYPE>
template<class PREDICATE>
void SharedObjectsContainer< TYPE >::erase ( const PREDICATE & cut)
inline

erase the objects which satisfy the criteria

E.g. remove all particles with small transverse momentum

namespace bl = boost::lambda ;
PARTICLES* particles = ... ;
particles -> erase
( bl::bind(&LHCb::Particle::pt,bl::_1) < 1 * Gaudi::Units::GeV ) ;
void erase(iterator i)
erase the object by iterator
constexpr double GeV
See also
std::remove_if
Parameters
cutpredicate

Definition at line 201 of file SharedObjectsContainer.h.

201 {
202 m_data.erase( std::remove_if( begin(), end(), cut ), end() );
203 }

◆ erase() [2/3]

template<class TYPE>
bool SharedObjectsContainer< TYPE >::erase ( const TYPE * object)
inline

erase the first occurance of the certain element

To remove all occurances one can use:

PARTICLES* particles = ... ;
const LHCb::Particle* B = ... ;
// remove all occurances
while ( particles -> erase ( B ) ) {} ;
Parameters
objectthe element to be removed
Returns
true if the element is removed

Definition at line 222 of file SharedObjectsContainer.h.

222 {
223 auto i = std::find( begin(), end(), object );
224 if ( end() == i ) { return false; }
225 m_data.erase( i );
226 return true;
227 }

◆ erase() [3/3]

template<class TYPE>
void SharedObjectsContainer< TYPE >::erase ( iterator i)
inline

erase the object by iterator

Definition at line 182 of file SharedObjectsContainer.h.

182{ m_data.erase( i ); }

◆ front() [1/2]

template<class TYPE>
reference SharedObjectsContainer< TYPE >::front ( )
inline

the first element (only for non-empty vectors)

Definition at line 249 of file SharedObjectsContainer.h.

249{ return m_data.front(); }

◆ front() [2/2]

template<class TYPE>
const_reference SharedObjectsContainer< TYPE >::front ( ) const
inline

the first element (only for non-empty vectors) (const-version)

Definition at line 251 of file SharedObjectsContainer.h.

251{ return m_data.front(); }

◆ get()

template<class TYPE>
template<class OUTPUT, class PREDICATE>
OUTPUT SharedObjectsContainer< TYPE >::get ( const PREDICATE & cut,
OUTPUT output ) const
inline

get from the container all objects which satisfy the certain criteria

E.g. get all particles with transverse momentum in excess of 1 * GeV

namespace bl = boost::lambda ;
typedef std::vector<const LHCb::Particle*> TARGET ;
PARTICLES* particles = ... ;
TARGET target ;
particles -> get
( bl::bind(&LHCb::Particle::pt,bl::_1) > 1 * Gaudi::Units::GeV ,
std::back_inserter ( target ) ) ;
OUTPUT get(const PREDICATE &cut, OUTPUT output) const
get from the container all objects which satisfy the certain criteria
Parameters
cutthe predicate
outptutthe output iterator
Returns
the current position of the output itrator (almost useless)

Definition at line 178 of file SharedObjectsContainer.h.

178 {
179 return std::copy_if( begin(), end(), output, std::cref( cut ) );
180 }

◆ index()

template<class TYPE>
long SharedObjectsContainer< TYPE >::index ( const ContainedObject * object) const
inlineoverridevirtual

Distance of a given object from the beginning of its container.

Parameters
objectthe object to be checked

Implements ObjectContainerBase.

Definition at line 270 of file SharedObjectsContainer.h.

270 {
271 auto _i = std::find( begin(), end(), object );
272 return end() != _i ? ( _i - begin() ) : -1;
273 }

◆ insert() [1/3]

template<class TYPE>
void SharedObjectsContainer< TYPE >::insert ( const TYPE * object)
inline

insert one object into the container

Parameters
objectobject to be added

Definition at line 113 of file SharedObjectsContainer.h.

113{ m_data.push_back( object ); }

◆ insert() [2/3]

template<class TYPE>
template<class DATA>
void SharedObjectsContainer< TYPE >::insert ( DATA first,
DATA last )
inline

add the sequence of objects into the container

Parameters
first'begin'-iterator for the sequnce
last'end'-iterator for the sequence

Definition at line 119 of file SharedObjectsContainer.h.

119 {
120 m_data.insert( end(), first, last );
121 }

◆ insert() [3/3]

template<class TYPE>
template<class DATA, class PREDICATE>
void SharedObjectsContainer< TYPE >::insert ( DATA first,
DATA last,
const PREDICATE & cut )
inline

add the sequence of 'good'objects into the container

Only the objects which satisfy the predicate go to the container, e.g. put into container only particles which transverse momentum in excess of 1 * GeV:

namespace bl = boost::lambda ;
// some sequence of someting, convertible to "const LHCb::Particle*":
SEQUENCE source = ... ;
PARTICLES* particles = ... ;
particles -> insert
( source.begin() ,
source.end () ,
bl::bind(&LHCb::Particle::pt,bl::_1) > 1 * Gaudi::Units::GeV ) ;
Parameters
first'begin'-iterator for the sequnce
last'end'-iterator for the sequence
cutthe predicate to be applied

Definition at line 149 of file SharedObjectsContainer.h.

149 {
150 m_data.reserve( m_data.size() + std::distance( first, last ) );
152 }

◆ numberOfObjects()

template<class TYPE>
size_type SharedObjectsContainer< TYPE >::numberOfObjects ( ) const
inlineoverridevirtual

Number of objects in the container.

Implements ObjectContainerBase.

Definition at line 287 of file SharedObjectsContainer.h.

287{ return m_data.size(); }

◆ operator const ConstVector &()

template<class TYPE>
SharedObjectsContainer< TYPE >::operator const ConstVector & ( ) const
inline

cast to the underlying container

Definition at line 101 of file SharedObjectsContainer.h.

101{ return data(); }

◆ operator()() [1/2]

template<class TYPE>
reference SharedObjectsContainer< TYPE >::operator() ( size_type index)
inline

'functional'-access

Definition at line 233 of file SharedObjectsContainer.h.

233{ return m_data[index]; }

◆ operator()() [2/2]

template<class TYPE>
const_reference SharedObjectsContainer< TYPE >::operator() ( size_type index) const
inline

'functional'-access (const version)

Definition at line 235 of file SharedObjectsContainer.h.

235{ return m_data[index]; }

◆ operator<() [1/2]

template<class TYPE>
bool SharedObjectsContainer< TYPE >::operator< ( const ConstVector & right) const
inline

comparisons with corresponding vector

Definition at line 263 of file SharedObjectsContainer.h.

263{ return m_data < right; }

◆ operator<() [2/2]

template<class TYPE>
bool SharedObjectsContainer< TYPE >::operator< ( const SharedObjectsContainer< TYPE > & right) const
inline

comparisons with other container

Definition at line 261 of file SharedObjectsContainer.h.

261{ return m_data < right.m_data; }

◆ operator=()

template<class TYPE>
SharedObjectsContainer & SharedObjectsContainer< TYPE >::operator= ( SharedObjectsContainer< TYPE > && )
default

◆ operator==() [1/2]

template<class TYPE>
bool SharedObjectsContainer< TYPE >::operator== ( const ConstVector & right) const
inline

equal content with corresponding vector ?

Definition at line 259 of file SharedObjectsContainer.h.

259{ return m_data == right; }

◆ operator==() [2/2]

template<class TYPE>
bool SharedObjectsContainer< TYPE >::operator== ( const SharedObjectsContainer< TYPE > & right) const
inline

equal content with other container ?

Definition at line 257 of file SharedObjectsContainer.h.

257{ return &right == this || right.m_data == m_data; }

◆ operator[]() [1/2]

template<class TYPE>
reference SharedObjectsContainer< TYPE >::operator[] ( size_type index)
inline

index access

Definition at line 229 of file SharedObjectsContainer.h.

229{ return m_data[index]; }

◆ operator[]() [2/2]

template<class TYPE>
const_reference SharedObjectsContainer< TYPE >::operator[] ( size_type index) const
inline

index access (const-version)

Definition at line 231 of file SharedObjectsContainer.h.

231{ return m_data[index]; }

◆ push_back()

template<class TYPE>
void SharedObjectsContainer< TYPE >::push_back ( const TYPE * object)
inline

insert one object into the container

Parameters
objectobject to be added

Definition at line 109 of file SharedObjectsContainer.h.

109{ m_data.push_back( object ); }

◆ rbegin() [1/2]

template<class TYPE>
reverse_iterator SharedObjectsContainer< TYPE >::rbegin ( )
inline

Definition at line 244 of file SharedObjectsContainer.h.

244{ return m_data.rbegin(); }

◆ rbegin() [2/2]

template<class TYPE>
const_reverse_iterator SharedObjectsContainer< TYPE >::rbegin ( ) const
inline

Definition at line 246 of file SharedObjectsContainer.h.

246{ return m_data.rbegin(); }

◆ remove()

template<class TYPE>
long SharedObjectsContainer< TYPE >::remove ( ContainedObject * value)
inlineoverridevirtual

Release object from the container (the pointer will be removed from the container, but the object itself will remain alive).

If the object was found it's index is returned.

Implements ObjectContainerBase.

Definition at line 304 of file SharedObjectsContainer.h.

304 {
305 auto _i = std::find( begin(), end(), value );
306 if ( end() == _i ) { return -1; }
307 const size_type pos = _i - begin();
308 m_data.erase( _i );
309 return pos;
310 }

◆ rend() [1/2]

template<class TYPE>
reverse_iterator SharedObjectsContainer< TYPE >::rend ( )
inline

Definition at line 245 of file SharedObjectsContainer.h.

245{ return m_data.rend(); }

◆ rend() [2/2]

template<class TYPE>
const_reverse_iterator SharedObjectsContainer< TYPE >::rend ( ) const
inline

Definition at line 247 of file SharedObjectsContainer.h.

247{ return m_data.rend(); }

◆ size()

template<class TYPE>
size_type SharedObjectsContainer< TYPE >::size ( ) const
inline

get the actual size of the container

Definition at line 103 of file SharedObjectsContainer.h.

103{ return m_data.size(); }

Member Data Documentation

◆ m_data

template<class TYPE>
ConstVector SharedObjectsContainer< TYPE >::m_data
private

Definition at line 313 of file SharedObjectsContainer.h.


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