#include <algorithm>#include <boost/iterator/iterator_adaptor.hpp>#include <boost/type_traits/remove_cv.hpp>#include <boost/variant/get.hpp>#include <memory>#include <numeric>#include <type_traits>#include <vector>#include "lanelet2_core/Forward.h"#include "lanelet2_core/utility/Optional.h"
Include dependency graph for Utilities.h:
This graph shows which files directly or indirectly include this file:
Go to the source code of this file.
Classes | |
| struct | lanelet::utils::IdLess< T > |
| Compares ids of primitives. Can be used for some sorted stl containers. More... | |
| struct | lanelet::utils::detail::MoveIf< Move > |
| struct | lanelet::utils::detail::MoveIf< false > |
| struct | lanelet::utils::detail::MoveIf< true > |
| struct | lanelet::utils::detail::ReserveIfNecessary< ContainerT > |
| struct | lanelet::utils::detail::ReserveIfNecessary< std::vector< T > > |
Namespaces | |
| lanelet | |
| lanelet::internal | |
| lanelet::utils | |
| lanelet::utils::detail | |
Functions | |
| template<class T > | |
| std::shared_ptr< const T > | lanelet::utils::addConst (std::shared_ptr< T > t) |
| template<class T > | |
| const T & | lanelet::utils::addConst (T &t) |
| template<typename Container , typename Predicate > | |
| bool | lanelet::utils::anyOf (const Container &c, Predicate &&p) |
| template<typename VectorT , typename ContainerT > | |
| VectorT | lanelet::utils::detail::concatenate (ContainerT &&c) |
| template<typename ContainerT > | |
| auto | lanelet::utils::concatenate (ContainerT &&c) |
| overload assuming that c is a container of containers. The return type will be the type of the inner container. More... | |
| template<typename VectorT , typename ContainerT , typename Func > | |
| VectorT | lanelet::utils::detail::concatenate (ContainerT &&c, Func f) |
| template<typename ContainerT , typename Func > | |
| auto | lanelet::utils::concatenate (ContainerT &&c, Func f) |
| create one big vector from a vector and a function that returns a vector for each element in this vector More... | |
| template<typename T > | |
| auto | lanelet::utils::concatenate (std::initializer_list< T > &&c) |
| template<typename T , typename Func > | |
| auto | lanelet::utils::concatenate (std::initializer_list< T > &&c, Func f) |
| template<typename ContainerT , typename Func > | |
| auto | lanelet::utils::detail::concatenateRange (ContainerT &&c, Func f) |
| template<typename ContainerT , typename Func > | |
| auto | lanelet::utils::concatenateRange (ContainerT &&c, Func f) |
| Similar to concatenate but expects Func to return a pair of begin and end of the range to concatenated. More... | |
| template<typename ContainerT , typename Func , typename AllocatorT > | |
| auto | lanelet::utils::detail::concatenateRange (ContainerT &&c, Func f, const AllocatorT &alloc) |
| template<typename ContainerT , typename Func , typename AllocatorT > | |
| auto | lanelet::utils::concatenateRange (ContainerT &&c, Func f, const AllocatorT &alloc) |
| Overload for an allocator (e.g. for Eigen::aligned_allocator) More... | |
| template<typename T , typename Func > | |
| auto | lanelet::utils::concatenateRange (std::initializer_list< T > &&c, Func f) |
| template<typename T , typename Func , typename AllocatorT > | |
| auto | lanelet::utils::concatenateRange (std::initializer_list< T > &&c, Func f, const AllocatorT &alloc) |
| template<typename Container , typename Value > | |
| bool | lanelet::utils::contains (const Container &c, const Value &v) |
| template<typename VectorT > | |
| VectorT | lanelet::utils::detail::createReserved (size_t size) |
| template<typename ContainerT , typename ValueT > | |
| auto | lanelet::utils::find (ContainerT &&c, const ValueT &val) |
| template<typename ContainerT , typename Func > | |
| auto | lanelet::utils::findIf (ContainerT &&c, Func f) |
| template<typename Container , typename Func > | |
| void | lanelet::utils::forEach (Container &&c, Func &&f) |
| template<typename T , typename Variant > | |
| std::vector< T > | lanelet::utils::getVariant (const std::vector< Variant > &v) |
| template<typename PrimitiveT > | |
| constexpr bool | lanelet::utils::idLess (const PrimitiveT &p1, const PrimitiveT &p2) |
| Compares ids of primitives. Can be used for some stl algorithms. More... | |
| template<typename Container > | |
| Container | lanelet::utils::invert (const Container &cont) |
| bool | lanelet::utils::nearZero (double d) |
| Tests if a double is close to zero within a small margin. More... | |
| template<typename T1 , typename T2 > | |
| auto | lanelet::utils::orderedPair (T1 &first, T2 &second) |
| template<class T > | |
| T & | lanelet::utils::removeConst (const T &t) |
| template<typename Container , typename ConstIterator > | |
| Container::iterator | lanelet::internal::removeConst (Container &c, ConstIterator it) |
| template<class T > | |
| std::shared_ptr< T > | lanelet::utils::removeConst (std::shared_ptr< const T > t) |
| constexpr bool | lanelet::utils::strequal (char const *lhs, char const *rhs) |
| compares two c-strings at compile time. Do not use this for run time. More... | |
| template<typename WeakT > | |
| auto | lanelet::utils::strong (std::vector< WeakT > v) |
| transforms a vector of weak_ptrs to a vector of shared_ptrs More... | |
| template<typename Range , typename Func > | |
| auto | lanelet::utils::sum (Range &&r, Func f) |
| Wrapper around std::accumulate for summing up the result of Func over a range. More... | |
| template<typename Container , typename Func > | |
| auto | lanelet::utils::detail::transform (Container &&c, Func f) |
| template<typename Container , typename Func > | |
| auto | lanelet::utils::transform (Container &&c, Func f) |
| template<typename Iterator , typename Func > | |
| auto | lanelet::utils::transform (Iterator begin, Iterator end, const Func f) |
| template<typename T , typename Func > | |
| auto | lanelet::utils::transform (std::initializer_list< T > &&c, Func f) |
| template<typename OutT , typename InT > | |
| auto | lanelet::utils::transformSharedPtr (const std::vector< std::shared_ptr< InT >> &v) |