1#ifndef included_AMP_Algorithms
2#define included_AMP_Algorithms
13 static void fill_n( TYPE *x,
const size_t N,
const TYPE alpha );
14 static void copy_n(
const TYPE *x,
const size_t N, TYPE *y );
15 static void exclusive_scan(
const TYPE *x,
const size_t N, TYPE *y,
const TYPE alpha );
17 static void sort( TYPE *x,
const size_t N );
20 static TYPE
accumulate(
const TYPE *x,
const size_t N, TYPE alpha );
21 static size_t unique( TYPE *x,
const size_t N );
static void copy_n(const TYPE *x, const size_t N, TYPE *y)
static TYPE accumulate(const TYPE *x, const size_t N, TYPE alpha)
static void sort(TYPE *x, const size_t N)
static void exclusive_scan(const TYPE *x, const size_t N, TYPE *y, const TYPE alpha)
static size_t unique(TYPE *x, const size_t N)
static void inclusive_scan(const TYPE *x, const size_t N, TYPE *y)
static TYPE max_element(const TYPE *x, const size_t N)
static void fill_n(TYPE *x, const size_t N, const TYPE alpha)
static TYPE min_element(const TYPE *x, const size_t N)