KrisLibrary
1.0.0
|
Convenience routines for C arrays and STL vectors. More...
#include <algorithm>
#include <functional>
#include <assert.h>
Go to the source code of this file.
Namespaces | |
ArrayUtils | |
Convenience routines for C arrays and STL vectors. | |
Functions | |
template<typename T > | |
void | ArrayUtils::copy (const T &a, T *out, int n) |
template<typename T > | |
void | ArrayUtils::copy (const T *a, T *out, int n) |
template<typename T , typename ftype > | |
void | ArrayUtils::foreach (T *a, ftype f, int n) |
template<typename T > | |
void | ArrayUtils::reverse (T *a, int n) |
template<typename t1 , typename t2 , typename ftype > | |
void | ArrayUtils::transform (const t1 *a, t2 *out, ftype f, int n) |
template<typename t1 , typename t2 , typename t3 , typename ftype > | |
void | ArrayUtils::binary_transform (const t1 *a, const t2 *b, t3 *out, ftype f, int n) |
template<typename T > | |
void | ArrayUtils::add (const T *a, const T *b, T *out, int n) |
template<typename T > | |
void | ArrayUtils::sub (const T *a, const T *b, T *out, int n) |
template<typename T > | |
void | ArrayUtils::mul (const T *a, const T *b, T *out, int n) |
template<typename T > | |
void | ArrayUtils::div (const T *a, const T *b, T *out, int n) |
template<typename T > | |
T | ArrayUtils::nth_element (const std::vector< T > &S, size_t n) |
returns the nth largest element in the array a | |
template<typename T , typename fless > | |
T | ArrayUtils::nth_element (const std::vector< T > &S, size_t n, fless less) |
returns the nth largest element in the array a | |
template<typename T > | |
bool | ArrayUtils::is_sorted (T *a, int n) |
template<typename T , typename fless > | |
bool | ArrayUtils::is_sorted (T *a, int n, fless f) |
template<typename T > | |
void | ArrayUtils::quicksort (T *a, int p, int r) |
template<typename T , typename fless > | |
void | ArrayUtils::quicksort (T *a, int p, int r, fless f) |
template<typename T > | |
void | ArrayUtils::sort (T *a, int n) |
template<typename T , typename fless > | |
void | ArrayUtils::sort (T *a, int n, fless f) |
template<class T > | |
void | ArrayUtils::concat (std::vector< T > &a, const std::vector< T > &b) |
Concatenates b onto the end of a. | |
Convenience routines for C arrays and STL vectors.