|
MRPT
1.9.9
|
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... | |
Namespaces | |
| mrpt::containers::internal | |
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... | |
Functions | |
| template<class Visitor , class... T> | |
| void | mrpt::visit_each (const Visitor &vis, T &&... t) |
| using mrpt::containers::copy_ptr = typedef internal::generic_copier_ptr<T, internal::CopyStatic<T> > |
Smart pointer for non-polymorphic classes.
No shared copies, that is, each copy_ptr<T> owns a unique instance of T. Copying a copy_ptr<T> invokes the copy operator for T.
Definition at line 165 of file deepcopy_ptr.h.
| using mrpt::containers::poly_ptr = typedef internal::generic_copier_ptr<T, internal::CopyCloner<T> > |
Smart pointer for polymorphic classes with a clone() method.
No shared copies, that is, each poly_ptr<T> owns a unique instance of T. Copying a poly_ptr<T> invokes the copy operator for T.
Definition at line 157 of file deepcopy_ptr.h.
| void mrpt::visit_each | ( | const Visitor & | vis, |
| T &&... | t | ||
| ) |
Definition at line 21 of file visit_each.h.
Referenced by TEST().
| Page generated by Doxygen 1.8.14 for MRPT 1.9.9 Git: 7d5e6d718 Fri Aug 24 01:51:28 2018 +0200 at lun nov 2 08:35:50 CET 2020 |