add base module
							parent
							
								
									d6fe41d59d
								
							
						
					
					
						commit
						eaac392f37
					
				|  | @ -62,7 +62,7 @@ namespace gtsam { | |||
|  * convenience to avoid having lengthy types in the code.  Through timing, | ||||
|  * we've seen that the fast_pool_allocator can lead to speedups of several | ||||
|  * percent. | ||||
|  * @addtogroup base | ||||
|  * @ingroup base | ||||
|  */ | ||||
| template<typename KEY, typename VALUE> | ||||
| class ConcurrentMap : public ConcurrentMapBase<KEY,VALUE> { | ||||
|  |  | |||
|  | @ -28,7 +28,7 @@ namespace gtsam { | |||
| /**
 | ||||
|  * Disjoint set forest using an STL map data structure underneath | ||||
|  * Uses rank compression and union by rank, iterator version | ||||
|  * @addtogroup base | ||||
|  * @ingroup base | ||||
|  */ | ||||
| template <class KEY> | ||||
| class DSFMap { | ||||
|  |  | |||
|  | @ -33,7 +33,7 @@ namespace gtsam { | |||
|  * A fast implementation of disjoint set forests that uses vector as underly data structure. | ||||
|  * This is the absolute minimal DSF data structure, and only allows size_t keys | ||||
|  * Uses rank compression but not union by rank :-( | ||||
|  * @addtogroup base | ||||
|  * @ingroup base | ||||
|  */ | ||||
| class GTSAM_EXPORT DSFBase { | ||||
| 
 | ||||
|  | @ -59,7 +59,7 @@ public: | |||
| 
 | ||||
| /**
 | ||||
|  * DSFVector additionally keeps a vector of keys to support more expensive operations | ||||
|  * @addtogroup base | ||||
|  * @ingroup base | ||||
|  */ | ||||
| class GTSAM_EXPORT DSFVector: public DSFBase { | ||||
| 
 | ||||
|  |  | |||
|  | @ -34,7 +34,7 @@ namespace gtsam { | |||
|  * convenience to avoid having lengthy types in the code.  Through timing, | ||||
|  * we've seen that the fast_pool_allocator can lead to speedups of several | ||||
|  * percent. | ||||
|    * @addtogroup base | ||||
|    * @ingroup base | ||||
|  */ | ||||
| template<typename VALUE> | ||||
| class FastList: public std::list<VALUE, typename internal::FastDefaultAllocator<VALUE>::type> { | ||||
|  |  | |||
|  | @ -31,7 +31,7 @@ namespace gtsam { | |||
|  * convenience to avoid having lengthy types in the code.  Through timing, | ||||
|  * we've seen that the fast_pool_allocator can lead to speedups of several | ||||
|  * percent. | ||||
|  * @addtogroup base | ||||
|  * @ingroup base | ||||
|  */ | ||||
| template<typename KEY, typename VALUE> | ||||
| class FastMap : public std::map<KEY, VALUE, std::less<KEY>, | ||||
|  |  | |||
|  | @ -43,7 +43,7 @@ namespace gtsam { | |||
|  * fast_pool_allocator instead of the default STL allocator.  This is just a | ||||
|  * convenience to avoid having lengthy types in the code.  Through timing, | ||||
|  * we've seen that the fast_pool_allocator can lead to speedups of several %. | ||||
|  * @addtogroup base | ||||
|  * @ingroup base | ||||
|  */ | ||||
| template<typename VALUE> | ||||
| class FastSet: public std::set<VALUE, std::less<VALUE>, | ||||
|  |  | |||
|  | @ -27,7 +27,7 @@ namespace gtsam { | |||
| /**
 | ||||
|  * FastVector is a type alias to a std::vector with a custom memory allocator. | ||||
|  * The particular allocator depends on GTSAM's cmake configuration. | ||||
|  * @addtogroup base | ||||
|  * @ingroup base | ||||
|  */ | ||||
| template <typename T> | ||||
| using FastVector = | ||||
|  |  | |||
|  | @ -47,7 +47,7 @@ namespace gtsam { | |||
|   * matrix view.  firstBlock() determines the block that appears to have index 0 for all operations | ||||
|   * (except re-setting firstBlock()). | ||||
|   * | ||||
|   * @addtogroup base */ | ||||
|   * @ingroup base */ | ||||
|   class GTSAM_EXPORT SymmetricBlockMatrix | ||||
|   { | ||||
|   public: | ||||
|  |  | |||
|  | @ -51,7 +51,7 @@ namespace gtsam { | |||
|    * tests and in generic algorithms. | ||||
|    * | ||||
|    * See macros for details on using this structure | ||||
|    * @addtogroup base | ||||
|    * @ingroup base | ||||
|    * @tparam T is the objectype this constrains to be testable - assumes print() and equals() | ||||
|    */ | ||||
|   template <class T> | ||||
|  |  | |||
|  | @ -14,7 +14,7 @@ | |||
|  * @brief    Base exception type that uses tbb_allocator if GTSAM is compiled with TBB | ||||
|  * @author   Richard Roberts | ||||
|  * @date     Aug 21, 2010 | ||||
|  * @addtogroup base | ||||
|  * @ingroup base | ||||
|  */ | ||||
| 
 | ||||
| #pragma once | ||||
|  |  | |||
|  | @ -38,7 +38,7 @@ namespace gtsam { | |||
|    * row for all operations.  To include all rows, rowEnd() should be set to the number of rows in | ||||
|    * the matrix (i.e. one after the last true row index). | ||||
|    * | ||||
|    * @addtogroup base */ | ||||
|    * @ingroup base */ | ||||
|   class GTSAM_EXPORT VerticalBlockMatrix | ||||
|   { | ||||
|   public: | ||||
|  |  | |||
|  | @ -14,7 +14,7 @@ | |||
|  * @brief    Functions for handling type information | ||||
|  * @author   Varun Agrawal | ||||
|  * @date     May 18, 2020 | ||||
|  * @addtogroup base | ||||
|  * @ingroup base | ||||
|  */ | ||||
| 
 | ||||
| #include <gtsam/base/types.h> | ||||
|  |  | |||
|  | @ -14,7 +14,7 @@ | |||
|  * @brief    Typedefs for easier changing of types | ||||
|  * @author   Richard Roberts | ||||
|  * @date     Aug 21, 2010 | ||||
|  * @addtogroup base | ||||
|  * @ingroup base | ||||
|  */ | ||||
| 
 | ||||
| #pragma once | ||||
|  |  | |||
|  | @ -13,7 +13,7 @@ | |||
|  * @file     global_includes.h | ||||
|  * @brief    Included from all GTSAM files | ||||
|  * @author   Richard Roberts | ||||
|  * @addtogroup base | ||||
|  * @ingroup base | ||||
|  */ | ||||
| 
 | ||||
| #pragma once | ||||
|  |  | |||
|  | @ -9,6 +9,9 @@ | |||
| \defgroup Sequential Solving by sequential variable elimination (QR and Cholesky) | ||||
| @{ @} | ||||
| 
 | ||||
| \defgroup base Base | ||||
| @{ @} | ||||
| 
 | ||||
| \defgroup basis Basis | ||||
| @{ @} | ||||
| 
 | ||||
|  |  | |||
|  | @ -28,7 +28,7 @@ namespace gtsam { | |||
| 
 | ||||
|   /**
 | ||||
|    * @brief Binary tree | ||||
|    * @addtogroup base | ||||
|    * @ingroup base | ||||
|    */ | ||||
|   template<class KEY, class VALUE> | ||||
|   class BTree { | ||||
|  |  | |||
|  | @ -33,7 +33,7 @@ namespace gtsam { | |||
|  * S = {S_1,S_2,...} of disjoint dynamic sets. Each set is identified by | ||||
|  * a representative, which is some member of the set. | ||||
|  * | ||||
|  * @addtogroup base | ||||
|  * @ingroup base | ||||
|  */ | ||||
| template<class KEY> | ||||
| class DSF: protected BTree<KEY, KEY> { | ||||
|  |  | |||
		Loading…
	
		Reference in New Issue