radix_sort.h File Reference

#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <cstring>
#include <limits>
#include <type_traits>
#include <utility>
#include <vector>
#include "absl/algorithm/container.h"
#include "absl/base/casts.h"
#include "absl/base/log_severity.h"
#include "absl/log/check.h"
#include "absl/log/log.h"
#include "absl/numeric/bits.h"
#include "absl/types/span.h"

Go to the source code of this file.

Classes
struct	operations_research::internal::ToUInt< T >
struct	operations_research::internal::ToUInt< double >
struct	operations_research::internal::ToUInt< float >

Namespaces
namespace	operations_research
	In SWIG mode, we don't want anything besides these top-level includes.
namespace	operations_research::internal
	End of the interface. Below is the implementation.

Typedefs
template<typename T>
using	operations_research::internal::to_uint = typename ToUInt<T>::type

Functions
template<typename T>
void	operations_research::RadixSort (absl::Span< T > values, int num_bits=sizeof(T) *8)
template<typename T>
int	operations_research::NumBitsForZeroTo (T max_value)
template<typename T, int radix_width, int num_passes>
void	operations_research::RadixSortTpl (absl::Span< T > values)
	The internal template that does all the work.

Variables
const bool	operations_research::DEBUG_MODE = true