test_sort_lists.C File Reference

#include <gsl/gsl_rng.h>
#include <cassert>
#include <cerrno>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <ahSort.H>
#include <tpl_sort_utils.H>
#include <ctime>

Include dependency graph for test_sort_lists.C:

Go to the source code of this file.

Functions
template<template< typename T > class List, typename T = long>
List< T >	build_int_list (int n)
template<template< typename T > class List, typename T >
bool	verify_sort (const List< T > &list)
template<template< typename T > class List, typename T = long>
List< T * >	build_ptr_list (int n)
template<template< typename T > class List, typename T >
bool	verify_sort (const List< T * > &list)
template<template< typename T > class List, typename T >
void	free_ptr_list (List< T * > &list)
int	main (int argc, char *argv[])

Variables
gsl_rng *	r = NULL

Function Documentation

build_int_list()

template<template< typename T > class List, typename T = long>

List< T > build_int_list

(

int

n

)

Definition at line 44 of file test_sort_lists.C.

References Aleph::Dlink::append(), Aleph::divide_and_conquer_partition_dp(), and r.

build_ptr_list()

template<template< typename T > class List, typename T = long>

List< T * > build_ptr_list

(

int

n

)

Definition at line 68 of file test_sort_lists.C.

References Aleph::Dlink::append(), Aleph::divide_and_conquer_partition_dp(), and r.

free_ptr_list()

template<template< typename T > class List, typename T >

void free_ptr_list

(

List< T * > &

list

)

Definition at line 91 of file test_sort_lists.C.

Referenced by main().

main()

int main	(	int	argc,
		char *	argv[]
	)

Definition at line 99 of file test_sort_lists.C.

References Aleph::divide_and_conquer_partition_dp(), free_ptr_list(), l, FunctionalMethods< Container, T >::length(), Aleph::mergesort(), Aleph::quicksort(), r, Aleph::sort(), verify_sort(), and y.

verify_sort() [1/2]

template<template< typename T > class List, typename T >

bool verify_sort

(

const List< T * > &

list

)

Definition at line 79 of file test_sort_lists.C.

References Aleph::divide_and_conquer_partition_dp().

verify_sort() [2/2]

template<template< typename T > class List, typename T >

bool verify_sort

(

const List< T > &

list

)

Definition at line 55 of file test_sort_lists.C.

References Aleph::divide_and_conquer_partition_dp().

Referenced by main().

Variable Documentation

r

gsl_rng* r = NULL

Examples

knapsack_example.cc, lis_example.cc, manacher_example.cc, matrix_chain_example.cc, subset_sum_example.cc, and z_algorithm_example.cc.

Definition at line 40 of file test_sort_lists.C.

Referenced by Aleph::Bloom_Filter< T >::Bloom_Filter(), Aleph::Testing::GridNetworkGenerator< Net >::GridNetworkGenerator(), SimpleMatrix::SimpleMatrix(), __gmp_set_expr(), Aleph::__random_select(), Aleph::__random_select(), Aleph::__random_select(), Aleph::__select_rec(), Aleph::__split_key_dup_rec_xt(), Aleph::__split_key_rec_xt(), Aleph::__split_pos_rec(), Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder >::_divides_exactly(), Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder >::_exact_quotient(), Aleph::Gen_Polynomial< Coefficient >::_integer_exact_quot(), Aleph::multi_poly_detail::add_indices(), Aleph::Li_Chao_Tree< T >::add_line_impl(), adjust_minimal_separation_with_letf_sibling(), adjust_size_by_tags(), Aleph::BinNodeInfixIterator< Node >::advance_to_max(), Aleph::BinNodeInfixIterator< Node >::advance_to_min(), aleatorio(), Aleph::FFT< Real >::Plan::apply_butterflies(), assign_external_nodes(), Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder >::autoreduce_groebner_basis(), Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder >::autoreduced_generators(), Aleph::Tikz_Plane::bbox_of(), Aleph::binary_search(), Aleph::binary_search(), Aleph::binary_search(), Aleph::binary_search_rec(), biodiversity_survey(), Aleph::AABBTree::box_contains_point(), brute_and(), Aleph::ClosestPairDivideAndConquer::brute_force(), brute_gcd(), brute_max(), brute_min(), brute_or(), brute_product(), brute_sum(), brute_xor(), K2Tree< T >::build(), build_int_list(), build_ptr_list(), Aleph::DynSetTree< Key, Tree, Compare >::call_split_pos(), cdt_has_edge(), Aleph::detail::check_composite(), check_delaunay_for_non_constrained(), Aleph::Cnode::children(), Aleph::Segment_Tree_Beats< T >::chmax(), Aleph::Segment_Tree_Beats< T >::chmax_impl(), Aleph::Segment_Tree_Beats< T >::chmin(), Aleph::Segment_Tree_Beats< T >::chmin_impl(), Aleph::PolygonOffset::cleanup(), Aleph::ClosestPairDivideAndConquer::closest_segment(), compute_assignment_cost(), Aleph::compute_bipartite(), Aleph::compute_bipartite_all_components(), Aleph::compute_maximum_cardinality_bipartite_matching(), Aleph::compute_min_cut(), Aleph::timsort_detail::compute_minrun(), Aleph::compute_optimal_costs(), Aleph::compute_stats(), OhashCommon< HashTbl, Key >::contains_or_insert(), OhashCommon< HashTbl, Key >::contains_or_insert(), Aleph::multi_poly_detail::decrement_index_at(), demo_compare_algorithms_on_logistics(), demo_matching(), demo_survey_design(), demo_transformations(), Aleph::design_survey(), Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder >::divmod(), Aleph::Gen_Polynomial< Coefficient >::divmod(), Aleph::Gen_Avl_Tree< NodeType, Key, Compare >::doubleRotateLeft(), Aleph::Gen_Avl_Tree_Rk< NodeType, Key, Compare >::doubleRotateLeft(), Aleph::Gen_Avl_Tree< NodeType, Key, Compare >::doubleRotateRight(), Aleph::Gen_Avl_Tree_Rk< NodeType, Key, Compare >::doubleRotateRight(), Aleph::Tikz_Plane::draw_rectangle(), election_polling(), Aleph::FFT< Real >::elliptic_prototype(), QuadTree::empty(), Aleph::VoronoiDiagramFortune::enqueue_circle_event(), EqualSequenceMethod< Container >::equal_to(), EqualToMethod< Container >::equal_to(), __gmp_binary_plus::eval(), __gmp_binary_minus::eval(), __gmp_binary_multiplies::eval(), __gmp_binary_divides::eval(), __gmp_unary_plus::eval(), __gmp_unary_minus::eval(), __gmp_abs_function::eval(), __gmp_binary_plus::eval(), __gmp_binary_minus::eval(), __gmp_binary_multiplies::eval(), __gmp_binary_divides::eval(), __gmp_binary_plus::eval(), __gmp_binary_minus::eval(), __gmp_binary_multiplies::eval(), __gmp_binary_divides::eval(), __gmp_binary_plus::eval(), __gmp_binary_minus::eval(), __gmp_binary_plus::eval(), __gmp_binary_minus::eval(), __gmp_binary_multiplies::eval(), __gmp_binary_divides::eval(), __gmp_binary_plus::eval(), __gmp_binary_minus::eval(), __gmp_binary_multiplies::eval(), __gmp_binary_divides::eval(), __gmp_binary_lshift::eval(), __gmp_binary_rshift::eval(), __gmp_binary_plus::eval(), __gmp_binary_minus::eval(), __gmp_binary_plus::eval(), __gmp_binary_minus::eval(), __gmp_binary_multiplies::eval(), __gmp_binary_divides::eval(), __gmp_binary_plus::eval(), __gmp_binary_minus::eval(), __gmp_binary_multiplies::eval(), __gmp_binary_divides::eval(), __gmp_binary_equal::eval(), __gmp_binary_not_equal::eval(), __gmp_binary_less::eval(), __gmp_binary_less_equal::eval(), __gmp_binary_greater::eval(), __gmp_binary_greater_equal::eval(), __gmp_cmp_function::eval(), example_basic_assignment(), example_maximization(), example_rectangular(), expect_autoreduced_basis(), expect_buchberger_criterion(), Aleph::Gen_Link_Cut_Tree_WithEdges< VT, ET, EdgeMonoid, LazyTag >::export_to_tree_node(), Aleph::multi_poly_detail::extend_index(), Aleph::Gen_Polynomial< Coefficient >::factor_mod_p(), GenTdSplayTreeRk< NodeType, Key, Compare >::Iterator::find_min(), Aleph::Gen_Avl_Tree_Rk< NodeType, Key, Compare >::find_position(), Aleph::HtdRbTreeRk< Key, Compare >::find_position(), Aleph::Gen_Rb_Tree_Rk< NodeType, Key, Compare >::find_position(), Aleph::GenTdRbTreeRk< NodeType, Key, Compare >::find_position(), Aleph::BinTreeXt_Operation< Node, Cmp >::find_position(), Aleph::find_position(), Aleph::find_position(), Aleph::Gen_Rb_Tree_Rk< NodeType, Key, Compare >::fix_red_violation(), Aleph::multi_poly_detail::flat_to_multi_index(), Aleph::Gen_Heavy_Light_Decomposition< GT, SA >::for_each_path_segment_undirected_id(), Aleph::Gen_Polynomial< Coefficient >::from_roots(), fst_hast(), Aleph::Gen_Polynomial< Coefficient >::gcd(), generate_tree(), generate_tree(), Aleph::Modular_Matrix< MatrixT >::get_val(), Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder >::groebner_basis(), has_constrained_edge(), Aleph::heapsort_subrange(), in_circle_str(), Aleph::BinTreeXt_Operation< Node, Cmp >::inorder_position(), Aleph::inorder_position(), Aleph::inorder_position(), Aleph::inorder_position(), Aleph::inorder_position(), Aleph::inOrderThreaded(), QuadTree::insert(), Aleph::insert_by_key_xt(), Aleph::insert_by_key_xt(), Aleph::insert_by_pos_xt(), Aleph::insert_dup_by_key_xt(), Aleph::insert_dup_by_key_xt(), Aleph::insert_in_bst(), Aleph::BinTree_Operation< Node, Cmp >::insert_root(), Aleph::insert_root(), Aleph::insertion_sort(), Aleph::insertion_sort(), Aleph::insertion_sort_range(), Aleph::introsort(), Aleph::introsort_loop(), Aleph::introsort_loop(), Aleph::Gen_Heavy_Light_Decomposition< GT, SA >::is_ancestor_id(), Aleph::BinTree_Operation< Node, Cmp >::join(), Aleph::join(), Aleph::BinTree_Operation< Node, Cmp >::join_preorder(), Aleph::join_preorder(), Aleph::jsw_fill_table(), Aleph::Gen_Euler_Tour_LCA< T, Comp >::lca(), Aleph::Gen_Euler_RMQ_LCA< GT, SA >::lca_id(), Aleph::multi_poly_detail::lcm_indices(), Aleph::lcp_array_kasai(), main(), main(), main(), make_noisy_circle(), make_random_polygon(), make_star(), make_star(), Aleph::manacher(), Aleph::merge(), Aleph::merge(), Aleph::mergeinsertsort(), Aleph::mergesort(), Aleph::mergesort(), Aleph::mergesort(), Aleph::mergesort(), Aleph::Gen_Mo_On_Trees< GT, Policy >::mo_sweep(), Aleph::Gen_Mo_On_Tree_Node< T, Policy >::mo_sweep(), Aleph::GenBinTree< NodeType, Key, Compare >::move_all(), mpfr_add_d(), mpfr_d_div(), mpfr_d_sub(), mpfr_div_d(), mpfr_mul_d(), mpfr_sub_d(), my_hash(), network_packet_analysis(), Aleph::next_combination_mask(), Aleph::GenBinHeap< NodeType, Key, Compare >::Iterator::next_ne(), Aleph::BinNodePrefixIterator< Node >::next_ne(), Aleph::PolygonOffset::offset_polygon(), QuadTree::operate_on_nodes(), EqualSequenceMethod< Container >::operator!=(), EqualToMethod< Container >::operator!=(), Aleph::Rectangle::operator!=(), Aleph::Compute_Bipartite< GT, SA >::operator()(), Aleph::ConvexPolygonDistanceGJK::operator()(), Aleph::PolygonOffset::operator()(), Cmp_Rec::operator()(), GslRngDeleter::operator()(), Aleph::Compute_Min_Cut< GT, Max_Flow, SA >::operator()(), Cmp_Rec::operator()(), Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder >::operator*(), Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder >::operator*(), Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder >::operator+(), Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder >::operator+(), Aleph::Vector< T, NumType >::operator+(), Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder >::operator-(), Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder >::operator-(), Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder >::operator-(), Aleph::Vector< T, NumType >::operator-(), Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder >::operator/(), Foo::operator<(), operator<(), Aleph::operator<<(), Foo::operator<=(), operator<=(), EqualSequenceMethod< Container >::operator==(), EqualToMethod< Container >::operator==(), MyRecord::operator==(), Aleph::Path< GT >::Path_Desc::operator==(), Aleph::Rectangle::operator==(), operator==(), operator>(), operator>=(), Aleph::partition(), Aleph::partition(), Aleph::partition_op(), Aleph::partition_op(), Aleph::partition_op_impl(), Aleph::partition_three_way(), Aleph::partition_three_way_op(), Aleph::Gen_Mo_On_Trees< GT, Policy >::path_solve(), Aleph::Gen_Mo_On_Tree_Node< T, Policy >::path_solve(), Aleph::preorder_to_bst(), Aleph::preOrderThreaded(), Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder >::primitive_part(), Aleph::print_benchmark_results(), print_operations_per_second(), print_range(), print_results_table(), Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder >::promote(), Aleph::Gen_Polynomial< Coefficient >::pseudo_divmod(), Aleph::Segment_Tree_Beats< T >::pull_up(), Aleph::put_mec_result(), Aleph::Gen_Cartesian_Tree_RMQ< T, Comp >::query(), Aleph::Gen_Disjoint_Sparse_Table< T, Op >::query(), Aleph::Gen_Fenwick_Tree< T, Plus, Minus >::query(), Aleph::Range_Fenwick_Tree< T >::query(), Aleph::Gen_Segment_Tree< T, Op >::query(), Aleph::Gen_Lazy_Segment_Tree< Policy >::query(), Aleph::Gen_Sparse_Table< T, Op >::query(), Aleph::Gen_Cartesian_Tree_RMQ< T, Comp >::query_idx(), Aleph::Li_Chao_Tree< T >::query_impl(), Aleph::Gen_Segment_Tree< T, Op >::query_impl(), Aleph::Gen_Lazy_Segment_Tree< Policy >::query_impl(), Aleph::Segment_Tree_Beats< T >::query_max(), Aleph::Segment_Tree_Beats< T >::query_max_impl(), Aleph::Segment_Tree_Beats< T >::query_min(), Aleph::Segment_Tree_Beats< T >::query_min_impl(), Aleph::Gen_HLD_Path_Query< GT, T, Op, SA >::query_path_id(), Aleph::Segment_Tree_Beats< T >::query_sum(), Aleph::Segment_Tree_Beats< T >::query_sum_impl(), Aleph::quicksort(), Aleph::quicksort(), Aleph::quicksort_insertion(), Aleph::quicksort_no_tail(), Aleph::quicksort_op(), Aleph::quicksort_rec(), Aleph::quicksort_rec(), Aleph::quicksort_rec_min(), rainforest_biodiversity(), random(), random_int(), Aleph::random_search(), Aleph::random_search(), random_tree(), Aleph::ClosestPairDivideAndConquer::recurse(), Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder >::reduced_groebner_basis(), Aleph::DynArray< T >::reserve(), roots_and_interpolation(), Aleph::rotl32(), Aleph::rotl64(), run_performance_comparison(), run_tree(), sample_tree(), scenario_3(), scenario_4(), scenario_4_rmq_comparison(), scenario_construction(), scenario_parlay_betting(), scenario_probability(), scenario_range_gcd(), scenario_sales_analytics(), scenario_sensor_monitoring(), scenario_sports_leaderboard(), scenario_xor_checksum(), Aleph::search_extreme(), Aleph::search_extreme(), Aleph::search_max(), Aleph::search_max(), Aleph::search_min(), OhashCommon< HashTbl, Key >::search_or_insert(), OhashCommon< HashTbl, Key >::search_or_insert(), Aleph::BinTree_Operation< Node, Cmp >::search_or_insert(), Aleph::search_or_insert_by_key_xt(), Aleph::search_or_insert_by_key_xt(), Aleph::search_or_insert_in_bst(), Aleph::select(), Aleph::select_ne(), Aleph::select_pivot(), Aleph::select_pivot_op(), Aleph::select_pivot_op(), Aleph::select_pivot_op_impl(), Aleph::select_rec(), Aleph::sequential_search(), Aleph::sequential_search(), MpFrC::set_rnd(), Aleph::Modular_Matrix< MatrixT >::set_val(), Aleph::sift_down(), Aleph::sift_down(), Aleph::sift_down_up(), Aleph::sift_up(), Aleph::sift_up(), Aleph::ChaikinSmoothing::smooth_closed_once(), Aleph::ChaikinSmoothing::smooth_open_once(), snd_hash(), Aleph::Gen_Mo_Algorithm< T, Policy >::solve(), GenTdSplayTree< NodeType, Key, Compare >::splay_impl(), GenTdSplayTreeRk< NodeType, Key, Compare >::splay_impl(), GenTdSplayTreeRk< NodeType, Key, Compare >::splay_max(), Aleph::GenBinTree< NodeType, Key, Compare >::split(), Aleph::DynDlist< T >::split(), Aleph::HTList::split(), Aleph::GenBinTree< NodeType, Key, Compare >::split_dup(), Aleph::DynSetTree< Key, Tree, Compare >::split_key(), Aleph::split_key(), Aleph::BinTree_Operation< Node, Cmp >::split_key(), Aleph::DynSetTree< Key, Tree, Compare >::split_key_dup(), Aleph::BinTreeXt_Operation< Node, Cmp >::split_key_dup_rec(), Aleph::split_key_dup_rec_xt(), Aleph::split_key_dup_rec_xt(), Aleph::BinTreeXt_Operation< Node, Cmp >::split_key_rec(), Aleph::split_key_rec_xt(), Aleph::split_key_rec_xt(), Aleph::Dlink::split_list(), Aleph::DynDlist< T >::split_list(), Aleph::HTList::split_list(), Aleph::Dlink::split_list_ne(), Aleph::DynDlist< T >::split_list_ne(), Aleph::HTList::split_list_ne(), Aleph::DynSetTree< Key, Tree, Compare >::split_pos(), Aleph::split_pos_rec(), Aleph::Gen_Polynomial< Coefficient >::sturm_chain(), Aleph::multi_poly_detail::sub_indices(), Aleph::Gen_HLD< GT, T, Op, SA >::subtree_query_id(), Aleph::Gen_Heavy_Light_Decomposition< GT, SA >::subtree_range_id(), Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder >::terms(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), test(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), TEST(), test(), TEST(), TEST(), test_adversarial_single_outlier(), test_adversarial_zigzag(), test_all_equal(), test_construct_all_identical(), test_copy_constructor(), test_disjoint_split_min(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), TEST_F(), test_hash_table(), test_idempotent_overlap_split(), test_max_cross_validation(), test_min_cross_validation(), test_non_idempotent_correctness(), test_perf_queries(), test_prefix_sum_consistency(), test_splitting_composability(), test_splitting_product(), test_stress_all_pairs_small(), test_stress_double_sum(), test_stress_exhaustive_small(), test_stress_product_small(), test_stress_sum_large(), test_stress_sum_small(), test_string_concatenation(), test_string_stress(), test_xor_stress(), Aleph::timsort(), Aleph::GeomSerializer::to_wkt(), Aleph::NTT< MOD, ROOT >::tonelli_shanks(), Aleph::FFT< Real >::transform_impl(), Aleph::Gen_Polynomial< Coefficient >::try_exact_candidate_division(), TYPED_TEST(), Aleph::Gen_Lazy_Segment_Tree< Policy >::update(), Aleph::Range_Fenwick_Tree< T >::update(), Aleph::Gen_Lazy_Segment_Tree< Policy >::update_impl(), Aleph::valid_heap(), verify_bipartition(), Aleph::Gen_Polynomial< Coefficient >::xgcd(), and Aleph::z_algorithm().