5#ifndef NAVIGATION_NAVIGABLEVECTOR_H
6#define NAVIGATION_NAVIGABLEVECTOR_H
12#include "AthLinks/ElementLink.h"
18template <
typename CONT,
typename OBJCT=
typename CONT::base_value_type >
42 void addElement(
const CONT* aContainer,
const OBJCT* anObject)
80 return i >= 0 && i < (int)
m_store.size()
ElementLink implementation for ROOT usage.
bool toIndexedElement(BaseConstReference data, index_type elemID, IProxyDict *sg=0)
Set the link to an element given by index and pointer to container.
bool toContainedElement(BaseConstReference data, ElementType element, IProxyDict *sg=0)
Set from element pointer and a reference to the container (storable)
NavigableVectorIterator end()
NavigableVectorIterator begin()
NavigableVectorIterator & find(const object_type *anObject)
NavigableVectorIterator< OBJCT, store_type > const_iterator
virtual ~NavigableVector()=default
const data_type & linkAt(size_t i) const
const OBJCT * operator[](int i) const
store_type::const_iterator store_const_iter
void addElement(const CONT *aContainer, const OBJCT *anObject)
const_iterator find(const OBJCT *anObject) const
store_type::iterator store_iter
const_iterator end() const
void addElement(const data_type &aLink)
const OBJCT * operator[](size_t i) const
const_iterator begin() const
ElementLink< CONT > data_type
unsigned int size() const
const OBJCT * object_const_ptr
void addElement(const CONT *aContainer, external_index_type anIndex)
std::vector< data_type > store_type
SG::GenerateIndexingPolicy< CONT >::type::index_type external_index_type
void push_back(data_type &theData)