This graph shows which files directly or indirectly include this file:

Namespaces
namespace	bitpit::utils
	Namespace for generic utility functions.

Typedefs
template<typename T>
using	bitpit::utils::is_iterable = decltype(is_iterable_impl<T>(0))

Functions
template<typename T, typename Comparator = std::less<T>>
bool	bitpit::utils::addToOrderedVector (const T &value, std::vector< T > &list, Comparator comparator=Comparator())

template<class T>
void	bitpit::utils::eraseValue (std::vector< T > &, const T &)

template<typename T, typename Comparator = std::less<T>>
std::vector< T >::const_iterator	bitpit::utils::findInOrderedVector (const T &value, const std::vector< T > &list, Comparator comparator=Comparator())

template<class T>
std::vector< T >	bitpit::utils::intersectionVector (const std::vector< T > &, const std::vector< T > &)

template<typename T>
std::false_type	bitpit::utils::is_iterable_impl (...)

template<typename T>
auto	bitpit::utils::is_iterable_impl (int) -> decltype(std::begin(std::declval< T & >()) !=std::end(std::declval< T & >()),++std::declval< decltype(std::begin(std::declval< T & >()))& >(), *std::begin(std::declval< T & >()), std::true_type{})

template<typename OrderContainer, typename DataContainer>
void	bitpit::utils::reorderContainer (OrderContainer &order, DataContainer &v, std::size_t size)

template<typename T>
void	bitpit::utils::reorderVector (std::vector< size_t > &order, std::vector< T > &v, std::size_t size)

template<typename Container, typename Index>
void	bitpit::utils::swapValue (Container &v, Index i, Index j)

Macro Definition Documentation

◆ __BITPIT_COMMON_UTILS_TPP__

#define __BITPIT_COMMON_UTILS_TPP__

Definition at line 26 of file commonUtils.tpp.