anonymous_namespace{test.cpp} Namespace Reference

Typedefs
using	list = std::list<int>
using	value_type = list::value_type
using	iterator = list::iterator
using	T = int
using	V = std::array<T, 8>
using	I = typename V::const_iterator
using	bsearch_fn = bool(I, I, const T&)

Functions
template<auto rotate, typename T >
bool	check (T v, std::size_t b, std::size_t n, std::size_t e)
template<auto f>
void	rotate_empty ()
template<auto f>
void	rotate_end ()
template<auto f>
void	rotate_empty_end ()
template<auto f>
void	rotate_perm ()
void	rotate_perm_data ()
void	test_data (const std::vector< std::size_t > &sizes)
void	link (struct node *l, std::size_t n)
void	data (void)
template<typename T >
void	test (auto sort)

Variables
constexpr auto	rotate = codex::rotate<iterator, iterator>
constexpr auto	rotate_rec = codex::rotate_rec<iterator, iterator>
const list	L = {0, 1, 2, 3, 4, 5, 6, 7}
const auto	N = L.size()
constexpr V	v = {0, 1, 2, 3, 4, 5, 6, 7}
constexpr std::array	fns = {codex::bsearch<I, I, T>, std::binary_search<I, T>}

Typedef Documentation

bsearch_fn

using anonymous_namespace{test.cpp}::bsearch_fn = bool(I, I, const T&)

I

using anonymous_namespace{test.cpp}::I = typename V::const_iterator

iterator

typedef list::iterator anonymous_namespace{test.cpp}::iterator = list::iterator

list

typedef std::forward_list< int > anonymous_namespace{test.cpp}::list = std::list<int>

T

using anonymous_namespace{test.cpp}::T = int

V

std::array anonymous_namespace{test.cpp}::V = std::array<T, 8>

constexpr

value_type

typedef list::value_type anonymous_namespace{test.cpp}::value_type = list::value_type

Function Documentation

check()

template<auto rotate, typename T >

bool anonymous_namespace{test.cpp}::check	(	T	v,
		std::size_t	b,
		std::size_t	n,
		std::size_t	e )

Here is the caller graph for this function:

data()

void anonymous_namespace{test.cpp}::data

(

void

)

link()

void anonymous_namespace{test.cpp}::link	(	struct node *	l,
		std::size_t	n )

rotate_empty()

template<auto f>

void anonymous_namespace{test.cpp}::rotate_empty

(

)

Here is the call graph for this function:

rotate_empty_end()

template<auto f>

void anonymous_namespace{test.cpp}::rotate_empty_end

(

)

Here is the call graph for this function:

rotate_end()

template<auto f>

void anonymous_namespace{test.cpp}::rotate_end

(

)

Here is the call graph for this function:

rotate_perm()

template<auto f>

void anonymous_namespace{test.cpp}::rotate_perm

(

)

Here is the call graph for this function:

rotate_perm_data()

void anonymous_namespace{test.cpp}::rotate_perm_data

(

)

test()

template<typename T >

void anonymous_namespace{test.cpp}::test

(

auto

sort

)

test_data()

void anonymous_namespace{test.cpp}::test_data

(

const std::vector< std::size_t > &

sizes

)

Variable Documentation

fns

std::array anonymous_namespace{test.cpp}::fns = {codex::bsearch<I, I, T>, std::binary_search<I, T>}

constexpr

L

const list anonymous_namespace{test.cpp}::L = {0, 1, 2, 3, 4, 5, 6, 7}

N

auto anonymous_namespace{test.cpp}::N = L.size()

constexpr

rotate

auto anonymous_namespace{test.cpp}::rotate = codex::rotate<iterator, iterator>

constexpr

rotate_rec

auto anonymous_namespace{test.cpp}::rotate_rec = codex::rotate_rec<iterator, iterator>

constexpr

v

std::array anonymous_namespace{test.cpp}::v = {0, 1, 2, 3, 4, 5, 6, 7}

constexpr