apollo::planning::IndexedQueue< I, T > Class Template Reference

#include <indexed_queue.h>

Collaboration diagram for apollo::planning::IndexedQueue< I, T >:

Public Member Functions
	IndexedQueue (size_t capacity)
const T *	Find (const I id) const
const T *	Latest () const
bool	Add (const I id, std::unique_ptr< T > ptr)
void	Clear ()

Public Attributes
size_t	capacity_ = 0
std::queue< std::pair< I, const T * > >	queue_
std::unordered_map< I, std::unique_ptr< T > >	map_

Constructor & Destructor Documentation

IndexedQueue()

template<typename I, typename T>

apollo::planning::IndexedQueue< I, T >::IndexedQueue ( size_t  capacity )

inlineexplicit

Member Function Documentation

Add()

template<typename I, typename T>

bool apollo::planning::IndexedQueue< I, T >::Add ( const I  id, std::unique_ptr< T >  ptr  )

inline

Clear()

template<typename I, typename T>

void apollo::planning::IndexedQueue< I, T >::Clear ( )

inline

Find()

template<typename I, typename T>

const T* apollo::planning::IndexedQueue< I, T >::Find ( const I  id ) const

inline

Latest()

template<typename I, typename T>

const T* apollo::planning::IndexedQueue< I, T >::Latest ( ) const

inline

Member Data Documentation

capacity_

template<typename I, typename T>

size_t apollo::planning::IndexedQueue< I, T >::capacity_ = 0

map_

template<typename I, typename T>

std::unordered_map<I, std::unique_ptr<T> > apollo::planning::IndexedQueue< I, T >::map_

queue_

template<typename I, typename T>

std::queue<std::pair<I, const T *> > apollo::planning::IndexedQueue< I, T >::queue_

---

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

• modules/planning/common/indexed_queue.h