Detailed Description

Classes
class	mrpt::containers::bimap< KEY, VALUE >
	A bidirectional version of std::map, declared as bimap<KEY,VALUE> and which actually contains two std::map's, one for keys and another for values. More...

class	mrpt::containers::CDynamicGrid< T >
	A 2D grid of dynamic size which stores any kind of data at each cell. More...

class	mrpt::containers::CDynamicGrid3D< T >
	A 3D rectangular grid of dynamic size which stores any kind of data at each voxel. More...

class	mrpt::containers::circular_buffer< T >
	A circular buffer of fixed size (defined at construction-time), implemented with a std::vector as the underlying storage. More...

class	mrpt::containers::CThreadSafeQueue< T >
	A thread-safe template queue for object passing between threads; for a template argument of T, the objects being passed in the queue are "T*". More...

class	mrpt::containers::deepcopy_poly_ptr< T >
	Wrapper to a std::shared_ptr<>, adding deep-copy semantics to copy ctor and copy operator, suitable for polymorphic classes with a `clone()` method. More...

class	mrpt::containers::list_searchable< T >
	This class implements a STL container with features of both, a std::set and a std::list. More...

class	mrpt::containers::map_as_vector< KEY, VALUE, VECTOR_T >
	A STL-like container which looks and behaves (almost exactly) like a std::map<> but is implemented as a linear std::vector<> indexed by KEY. More...

Typedefs
template<typename T >
using	mrpt::containers::poly_ptr = internal::generic_copier_ptr< T, internal::CopyCloner< T > >
	Smart pointer for polymorphic classes with a `clone()` method. More...

template<typename T >
using	mrpt::containers::copy_ptr = internal::generic_copier_ptr< T, internal::CopyStatic< T > >
	Smart pointer for non-polymorphic classes. More...