Loading...
Searching...
No Matches
bitpit::utils Namespace Reference
Namespace for generic utility functions. More...
Namespaces | |
namespace | binary |
The namespace 'binary' contains routines for handling binary archives. | |
namespace | hashing |
Functions for generating the hash of data types. | |
namespace | string |
Namespace for string utility functions. | |
Classes | |
struct | DoubleFloatingComparison |
struct | DoubleFloatingEqual |
struct | DoubleFloatingGreater |
struct | DoubleFloatingGreaterEqual |
struct | DoubleFloatingLess |
struct | DoubleFloatingLessEqual |
Typedefs | |
template<typename T> | |
using | is_iterable = decltype(is_iterable_impl<T>(0)) |
Functions | |
template bool | addToOrderedVector (const long &, std::vector< long > &, std::less< long >) |
template<typename T, typename Comparator = std::less<T>> | |
bool | addToOrderedVector (const T &value, std::vector< T > &list, Comparator comparator=Comparator()) |
template bool | addToOrderedVector (const unsigned long &, std::vector< unsigned long > &, std::less< unsigned long >) |
std::size_t | countDigits (int n) |
template<class T> | |
void | eraseValue (std::vector< T > &, const T &) |
void | extractWithoutReplacement (int n, int m, std::vector< int > &list) |
unsigned long | factorial (unsigned long n) |
template std::vector< long >::const_iterator | findInOrderedVector (const long &, const std::vector< long > &, std::less< long >) |
template<typename T, typename Comparator = std::less<T>> | |
std::vector< T >::const_iterator | findInOrderedVector (const T &value, const std::vector< T > &list, Comparator comparator=Comparator()) |
template std::vector< unsignedlong >::const_iterator | findInOrderedVector (const unsigned long &, const std::vector< unsigned long > &, std::less< unsigned long >) |
template<class T> | |
std::vector< T > | intersectionVector (const std::vector< T > &, const std::vector< T > &) |
template<typename T> | |
std::false_type | is_iterable_impl (...) |
template<typename T> | |
auto | 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 | reorderContainer (OrderContainer &order, DataContainer &v, std::size_t size) |
template<typename T> | |
void | reorderVector (std::vector< size_t > &order, std::vector< T > &v, std::size_t size) |
template<typename Container, typename Index> | |
void | swapValue (Container &v, Index i, Index j) |
template<> | |
void | swapValue (std::vector< bool > &v, std::size_t i, std::size_t j) |
template<> | |
void | swapValue (std::vector< bool > &v, std::size_t i, std::size_t j) |
Detailed Description
Namespace for generic utility functions.
Typedef Documentation
◆ is_iterable
template<typename T>
using bitpit::utils::is_iterable = decltype(is_iterable_impl<T>(0)) |
Definition at line 224 of file commonUtils.tpp.
