86 lines
2.5 KiB
C++
86 lines
2.5 KiB
C++
/* ----------------------------------------------------------------------------
|
|
|
|
* GTSAM Copyright 2010, Georgia Tech Research Corporation,
|
|
* Atlanta, Georgia 30332-0415
|
|
* All Rights Reserved
|
|
* Authors: Frank Dellaert, et al. (see THANKS for the full author list)
|
|
|
|
* See LICENSE for the license information
|
|
|
|
* -------------------------------------------------------------------------- */
|
|
|
|
/**
|
|
* @file FastList.h
|
|
* @brief A thin wrapper around std::list that uses boost's fast_pool_allocator.
|
|
* @author Richard Roberts
|
|
* @date Oct 22, 2010
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <gtsam/base/FastDefaultAllocator.h>
|
|
#include <list>
|
|
#include <boost/utility/enable_if.hpp>
|
|
#include <boost/serialization/nvp.hpp>
|
|
#include <boost/serialization/version.hpp>
|
|
#include <boost/serialization/optional.hpp>
|
|
#include <boost/serialization/list.hpp>
|
|
|
|
namespace gtsam {
|
|
|
|
/**
|
|
* FastList is a thin wrapper around std::list that uses the boost
|
|
* 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
|
|
* percent.
|
|
* @ingroup base
|
|
*/
|
|
template<typename VALUE>
|
|
class FastList: public std::list<VALUE, typename internal::FastDefaultAllocator<VALUE>::type> {
|
|
|
|
public:
|
|
|
|
typedef std::list<VALUE, typename internal::FastDefaultAllocator<VALUE>::type> Base;
|
|
|
|
/** Default constructor */
|
|
FastList() {}
|
|
|
|
/** Constructor from a range, passes through to base class */
|
|
template<typename INPUTITERATOR>
|
|
explicit FastList(INPUTITERATOR first, INPUTITERATOR last) : Base(first, last) {}
|
|
|
|
/** Copy constructor from another FastList */
|
|
FastList(const FastList<VALUE>& x) : Base(x) {}
|
|
|
|
/** Copy constructor from the base list class */
|
|
FastList(const Base& x) : Base(x) {}
|
|
|
|
#ifdef GTSAM_ALLOCATOR_BOOSTPOOL
|
|
/** Copy constructor from a standard STL container */
|
|
FastList(const std::list<VALUE>& x) {
|
|
// This if statement works around a bug in boost pool allocator and/or
|
|
// STL vector where if the size is zero, the pool allocator will allocate
|
|
// huge amounts of memory.
|
|
if(x.size() > 0)
|
|
Base::assign(x.begin(), x.end());
|
|
}
|
|
#endif
|
|
|
|
/** Conversion to a standard STL container */
|
|
operator std::list<VALUE>() const {
|
|
return std::list<VALUE>(this->begin(), this->end());
|
|
}
|
|
|
|
private:
|
|
/** Serialization function */
|
|
friend class boost::serialization::access;
|
|
template<class ARCHIVE>
|
|
void serialize(ARCHIVE & ar, const unsigned int /*version*/) {
|
|
ar & BOOST_SERIALIZATION_BASE_OBJECT_NVP(Base);
|
|
}
|
|
|
|
};
|
|
|
|
}
|