#include <stdint.h>
#include <string.h>
#include <algorithm>
#include <cmath>
#include <vector>
#include "hwy/base.h"
#include "hwy/contrib/sort/vqsort.h"
#include "hwy/contrib/sort/traits-inl.h"
#include "hwy/contrib/sort/traits128-inl.h"
#include "hwy/contrib/sort/vqsort-inl.h"
#include "hwy/tests/test_util-inl.h"
Go to the source code of this file.
|
static std::vector< Dist > | hwy::AllDist () |
|
static const char * | hwy::DistName (Dist dist) |
|
const char * | hwy::AlgoName (Algo algo) |
|
| HWY_BEFORE_NAMESPACE () |
|
template<typename T , class DU64 , HWY_IF_NOT_FLOAT(T) > |
Vec< DU64 > | hwy::HWY_NAMESPACE::RandomValues (DU64 du64, Vec< DU64 > &s0, Vec< DU64 > &s1, const Vec< DU64 > mask) |
|
template<class DU64 > |
Vec< DU64 > | hwy::HWY_NAMESPACE::MaskForDist (DU64 du64, const Dist dist, size_t sizeof_t) |
|
template<typename T > |
InputStats< T > | hwy::HWY_NAMESPACE::GenerateInput (const Dist dist, T *v, size_t num) |
|
template<class Order , typename KeyType , HWY_IF_NOT_LANE_SIZE(KeyType, 16) > |
void | hwy::HWY_NAMESPACE::CallHeapSort (KeyType *HWY_RESTRICT keys, const size_t num_keys) |
|
template<class Order , typename KeyType > |
void | hwy::HWY_NAMESPACE::Run (Algo algo, KeyType *HWY_RESTRICT inout, size_t num, SharedState &shared, size_t thread) |
|
| HWY_AFTER_NAMESPACE () |
|
◆ HAVE_AVX2SORT
◆ HAVE_IPS4O
◆ HAVE_PARALLEL_IPS4O
◆ HAVE_PDQSORT
◆ HAVE_SORT512
◆ HAVE_VXSORT
◆ HIGHWAY_HWY_CONTRIB_SORT_ALGO_TOGGLE
#define HIGHWAY_HWY_CONTRIB_SORT_ALGO_TOGGLE |
◆ VXSORT_AVX3
◆ HWY_AFTER_NAMESPACE()
◆ HWY_BEFORE_NAMESPACE()