algorithms.h File Reference

#include "frozen/bits/basic_types.h"
#include <limits>
#include <tuple>

Include dependency graph for algorithms.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
struct	frozen::bits::LowerBound< T, Compare >

Namespaces
namespace	frozen
namespace	frozen::bits

Typedefs
template<std::size_t N>
using	frozen::bits::select_uint_least_t = decltype(select_uint_least(std::integral_constant<std::size_t, bit_weight(N)>()))

Functions
auto constexpr	frozen::bits::next_highest_power_of_two (std::size_t v)
template<class T>
auto constexpr	frozen::bits::log (T v)
constexpr std::size_t	frozen::bits::bit_weight (std::size_t n)
unsigned int	frozen::bits::select_uint_least (std::integral_constant< std::size_t, 4 >)
unsigned long	frozen::bits::select_uint_least (std::integral_constant< std::size_t, 3 >)
unsigned long long	frozen::bits::select_uint_least (std::integral_constant< std::size_t, 2 >)
template<std::size_t N>
unsigned long long	frozen::bits::select_uint_least (std::integral_constant< std::size_t, N >)
template<typename Iter, typename Compare>
constexpr auto	frozen::bits::min_element (Iter begin, const Iter end, Compare const &compare)
template<class T>
constexpr void	frozen::bits::cswap (T &a, T &b)
template<class T, class U>
constexpr void	frozen::bits::cswap (std::pair< T, U > &a, std::pair< T, U > &b)
template<class... Tys, std::size_t... Is>
constexpr void	frozen::bits::cswap (std::tuple< Tys... > &a, std::tuple< Tys... > &b, std::index_sequence< Is... >)
template<class... Tys>
constexpr void	frozen::bits::cswap (std::tuple< Tys... > &a, std::tuple< Tys... > &b)
template<typename Iter>
constexpr void	frozen::bits::iter_swap (Iter a, Iter b)
template<typename Iterator, class Compare>
constexpr Iterator	frozen::bits::partition (Iterator left, Iterator right, Compare const &compare)
template<typename Iterator, class Compare>
constexpr void	frozen::bits::quicksort (Iterator left, Iterator right, Compare const &compare)
template<typename Container, class Compare>
constexpr Container	frozen::bits::quicksort (Container const &array, Compare const &compare)
template<std::size_t N, class ForwardIt, class T, class Compare>
constexpr ForwardIt	frozen::bits::lower_bound (ForwardIt first, const T &value, Compare const &compare)
template<std::size_t N, class Compare, class ForwardIt, class T>
constexpr bool	frozen::bits::binary_search (ForwardIt first, const T &value, Compare const &compare)
template<class InputIt1, class InputIt2>
constexpr bool	frozen::bits::equal (InputIt1 first1, InputIt1 last1, InputIt2 first2)
template<class InputIt1, class InputIt2>
constexpr bool	frozen::bits::lexicographical_compare (InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2)