EnTT: entt::radix_sort< Bit, N > Struct Template Reference

EnTT 3.16.0

Loading...
Searching...
No Matches
Public Member Functions | List of all members
entt::radix_sort< Bit, N > Struct Template Reference

Function object for performing LSD radix sort. More...

`#include <algorithm.hpp>`

## Public Member Functions
template<typename It, typename Getter = identity>
void | operator() (It first, It last, Getter getter=Getter{}) const
| Sorts the elements in a range.

## Detailed Description

template<std::size_t Bit, std::size_t N>
struct entt::radix_sort< Bit, N >

Function object for performing LSD radix sort.

Template Parameters

  Bit | Number of bits processed per pass.
  N | Maximum number of bits to sort.

Definition at line 79 of file algorithm.hpp.

## Member Function Documentation

## ◆ operator()()

template<std::size_t Bit, std::size_t N>
template<typename It, typename Getter = identity>

void entt::radix_sort< Bit, N >::operator() | ( | It | first,
|  | It | last,
|  | Getter | getter = Getter{} ) const
| inline

Sorts the elements in a range.

Sorts the elements in a range using the given getter to access the actual data to be sorted.

This implementation is inspired by the online book Physically Based Rendering.

Template Parameters

  It | Type of random access iterator.
  Getter | Type of getter function object.

Parameters

  first | An iterator to the first element of the range to sort.
  last | An iterator past the last element of the range to sort.
  getter | A valid getter function object.

Definition at line 98 of file algorithm.hpp.

The documentation for this struct was generated from the following file:

- src/entt/core/algorithm.hpp