|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
#include <iostream>#include <vector>#include <string>#include <cmath>#include <ctime>#include <tpl_binTree.H>#include <tpl_binNodeUtils.H>#include <opBinTree.H>#include <cstdlib>Go to the source code of this file.
Functions | |
| void | print (BinNode< int > *node, int, int) |
| void | assign (BinTree< int >::Node *node, int, int) |
| double | bin_coef (int n, int k) |
| int | main (int argc, char *argv[]) |
Variables | |
| static int * | k |
| double bin_coef | ( | int | n, |
| int | k | ||
| ) |
Definition at line 57 of file testOpBinTree.C.
References Aleph::divide_and_conquer_partition_dp(), k, and min().
Referenced by main().
| int main | ( | int | argc, |
| char * | argv[] | ||
| ) |
Definition at line 87 of file testOpBinTree.C.
References assign(), bin_coef(), Aleph::destroyRec(), Aleph::divide_and_conquer_partition_dp(), Aleph::GenBinTree< NodeType, Key, Compare >::getRoot(), Aleph::inOrderRec(), Aleph::GenBinTree< NodeType, Key, Compare >::insert(), k, keys, pow(), Aleph::preOrderRec(), print(), and Aleph::GenBinTree< NodeType, Key, Compare >::search().
| void print | ( | BinNode< int > * | node, |
| int | , | ||
| int | |||
| ) |
Definition at line 43 of file testOpBinTree.C.
References Aleph::BinNode< Key >::get_key().
Referenced by main().
|
static |
Definition at line 49 of file testOpBinTree.C.
Referenced by Aleph::DynMapTree< Key, Data, Tree, Compare >::DynMapTree(), Aleph::FixedQueue< T >::FixedQueue(), Aleph::Floyd_All_Shortest_Paths< GT, Distance, SA >::Floyd_All_Shortest_Paths(), Aleph::Gen_Reroot_DP< GT, T, SA >::Gen_Reroot_DP(), Aleph::Gen_Tree_DP< GT, T, SA >::Gen_Tree_DP(), Aleph::MinHash< T >::MinHash(), Aleph::Vector< T, NumType >::Proxy::Proxy(), Aleph::HashSet< Key, HashSetTable, Cmp >::add(), Aleph::ODhashTable< Key, Cmp >::allocate_bucket(), Aleph::stl_comb_detail::arrangements_impl(), Aleph::DelaunayTriangulationBowyerWatson::as_triangles(), Aleph::ConstrainedDelaunayTriangulation::as_triangles(), assign(), Aleph::Gen_Disjoint_Sparse_Table< T, Op >::at(), Aleph::Gen_Sparse_Table< T, Op >::at(), Aleph::Gen_Disjoint_Sparse_Table< T, Op >::at(), Aleph::Gen_Sparse_Table< T, Op >::at(), Aleph::blossom_weighted_detail::mwmatching::impl::MatchingContext< WeightType >::augment_blossom_rec(), bin_coef(), Aleph::Gen_Disjoint_Sparse_Table< T, Op >::build(), Aleph::Gen_Mo_On_Trees< GT, Policy >::build(), Aleph::Gen_Mo_On_Tree_Node< T, Policy >::build(), Aleph::PolygonOffset::build_augmented(), build_barbell_graph(), Aleph::build_combinations(), Aleph::build_combinations(), Aleph::Tarjan_Connected_Components< GT, Itor, SA >::build_cycle(), Aleph::MonotonePolygonTriangulation::build_faces_from_diagonals(), Aleph::Gen_Binary_Lifting_LCA< GT, SA >::build_jump_table(), Aleph::Gen_Sparse_Table< T, Op >::build_upper_levels(), Aleph::FFT< Real >::butterworth_prototype(), Aleph::FFT< Real >::chebyshev1_prototype(), Aleph::FFT< Real >::chebyshev2_prototype(), Aleph::chromatic_number(), Aleph::combination_count(), Aleph::stl_comb_detail::combinations_impl(), Aleph::FFT< Real >::comp_ellint_1_impl(), Aleph::compute_stats(), Aleph::compute_stats(), JohnsonTest::computeFloydWarshall(), Random_Network_Flow< Net >::connect_ranks(), Aleph::Tarjan_Connected_Components< GT, Itor, SA >::connected_components(), Aleph::Naive_Suffix_Tree::contains(), Aleph::MCF_Arc< Arc_Info, FT >::cost(), Aleph::sort_utils_detail::counting_sort_impl(), Aleph::sort_utils_detail::counting_sort_impl(), Aleph::sort_utils_detail::counting_sort_impl(), Aleph::sort_utils_detail::counting_sort_impl(), Aleph::counting_sort_indices(), Random_Network_Flow< Net >::create_ranks(), Aleph::csv_group_by(), Aleph::csv_inner_join(), Aleph::csv_unique(), Aleph::Fibonacci_Heap< T, Compare >::decrease_key(), Aleph::Fibonacci_Heap< T, Compare >::decrease_key(), demo_basic(), demo_cache_filter(), demo_cookie_safety(), demo_false_positives(), demo_map_coloring(), demo_optimal_params(), demo_performance(), demo_register_allocation(), demo_spell_checker(), Aleph::Modular_Matrix< MatrixT >::determinant(), Aleph::RotatingCalipersConvexPolygon::diameter(), Aleph::divide_and_conquer_partition_dp(), FunctionalMethods< Container, T >::each(), Aleph::FFT< Real >::ellint_1_impl(), Aleph::eppstein_k_shortest_paths(), EqualToMethod< Container >::equal_to(), Aleph::Bloom_Filter< T >::estimate(), Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder >::eval_gradient(), Aleph::FFT< Real >::evaluate_cosine_series(), Aleph::Bloom_Filter< T >::expected_size(), Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder >::factor_recombination(), Aleph::multi_poly_detail::falling_factorial(), Aleph::Naive_Suffix_Tree::find_all(), Aleph::Fenwick_Tree< T >::find_kth(), find_test(), Aleph::FFT< Real >::firls_impl(), Aleph::first_combination_mask(), Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder >::fit(), Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder >::fit_parallel(), Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder >::fit_ridge(), Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder >::fit_weighted(), Aleph::FFT< Real >::flatten_tensor3_row_major(), Aleph::MCF_Arc< Arc_Info, FT >::flow(), Aleph::fmix64(), Aleph::for_each_combination(), Aleph::for_each_combination(), Aleph::MCF_Graph< NodeT, ArcT >::get_commodity(), Aleph::Floyd_All_Shortest_Paths< GT, Distance, SA >::get_min_path(), Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder >::gradient(), Aleph::BooleanPolygonOperations::greiner_hormann(), Aleph::ODhashTable< Key, Cmp >::hard_allocate_bucket(), Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder >::ideal_product(), Aleph::MemArray< T >::init_dim(), RankTreeTest< Tree >::insert_all(), insert_n_random_items_in_map(), Aleph::Naive_Suffix_Tree::insert_suffix(), Aleph::FFT< Real >::integrate_cos_basis(), Aleph::FFT< Real >::integrate_offset_cos_basis(), Aleph::Modular_Matrix< MatrixT >::inverse(), Aleph::FFT< Real >::inverse_transform_real_optimized_impl(), Aleph::VoronoiDiagramFortune::is_valid_delaunay(), Aleph::jen_hash(), Aleph::karp_minimum_mean_cycle(), Aleph::karp_minimum_mean_cycle_value(), Aleph::knapsack_01(), Aleph::knapsack_bounded(), Aleph::knuth_optimize_interval(), Aleph::Gen_Binary_Lifting_LCA< GT, SA >::kth_ancestor(), Aleph::Gen_Binary_Lifting_LCA< GT, SA >::kth_ancestor_id(), Aleph::Simplex< T >::latex_solve(), Aleph::Gen_Mo_On_Trees< GT, Policy >::lca(), Aleph::Gen_Mo_On_Tree_Node< T, Policy >::lca(), Aleph::Gen_Binary_Lifting_LCA< GT, SA >::lca_id(), Aleph::lcp_array_kasai(), Aleph::Gen_Binary_Lifting_LCA< GT, SA >::lift(), Aleph::longest_increasing_subsequence(), Aleph::longest_nondecreasing_subsequence(), Aleph::ModularCombinatorics::lucas_nCk(), main(), main(), TdRbTreeTest::make_nodes(), TdRbTreeCustomCompareTest::make_nodes(), TdRbTreeRkTest::make_nodes(), Aleph::manacher(), Aleph::matrix_chain_order(), Aleph::MinimumEnclosingCircle::mec_with_two_points(), Aleph::merge(), Aleph::timsort_detail::merge_at(), Aleph::ConvexPolygonDecomposition::merge_faces(), Aleph::RotatingCalipersConvexPolygon::minimum_width(), mod_hash(), Aleph::FFT< Real >::modified_bessel_i0(), mpq_set_mpfr(), mpz_set_mpfr(), Aleph::FFT< Real >::multiply_real_optimized(), Aleph::ModularCombinatorics::nCk(), Aleph::next_combination_mask(), Aleph::nonplanar_certificate_to_dot(), Aleph::nonplanar_certificate_to_gexf(), Aleph::nonplanar_certificate_to_graphml(), Aleph::nonplanar_certificate_to_json(), Aleph::VoronoiDiagramFortune::normalized_triangle(), Aleph::FFT< Real >::one_sided_frequency_grid(), Aleph::open_gap(), Aleph::ChaikinSmoothing::operator()(), Aleph::VoronoiDiagramFromDelaunay::operator()(), Aleph::AlphaShape::operator()(), Aleph::Yen_K_Shortest_Paths< GT, Distance, SA >::operator()(), Aleph::Eppstein_K_Shortest_Paths< GT, Distance, SA >::operator()(), Aleph::Dft_Pair_Cmp< Key, Data, Cmp >::operator()(), Aleph::ConvexPolygonDecomposition::operator()(), Aleph::Dft_Pair_Cmp< Key, Data, Cmp >::operator()(), Aleph::Vector< T, NumType >::operator()(), Aleph::Vector< T, NumType >::operator()(), Aleph::Build_Grid< GT, Operation_On_Node, Operation_On_Arc >::operator()(), Aleph::Vector< T, NumType >::operator[](), Aleph::Vector< T, NumType >::operator[](), Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder >::partial(), Aleph::NTT< MOD, ROOT >::poly_power(), Aleph::Vector< T, NumType >::print(), Aleph::MCF_LP_Solver< Net >::print_formulation(), Aleph::put_alpha_shape_result(), Aleph::Gen_Disjoint_Sparse_Table< T, Op >::query(), Aleph::Gen_Sparse_Table< T, Op >::query(), Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder >::redundant_pair_by_chain_criterion(), Aleph::FFT< Real >::remez_impl(), Aleph::Gen_MultiPolynomial< Coefficient, MonomOrder >::remove_zeros(), Aleph::MemArray< T >::reserve(), Aleph::reservoir_sample(), Aleph::FFT< Real >::reshape_tensor3_row_major(), Aleph::DynArray< T >::resize_dir(), Aleph::FFT< Real >::reverse_bessel_polynomial(), Aleph::FFT< Real >::roots_pass_residual_check(), sample_tree(), Aleph::Aho_Corasick::search(), Aleph::Random_Graph_Base< GT, Init_Node, Init_Arc >::select_random_node(), Aleph::MCF_Arc< Arc_Info, FT >::set_cost(), Aleph::MCF_Arc< Arc_Info, FT >::set_flow(), Aleph::Gen_Polynomial< Coefficient >::shift(), Aleph::Gen_Polynomial< Coefficient >::shift_down(), Aleph::Gen_Polynomial< Coefficient >::shift_up(), Aleph::FFT< Real >::signed_binomial(), Aleph::ChaikinSmoothing::smooth_polygon(), Aleph::MCF_LP_Solver< Net >::solve(), Aleph::FFT< Real >::solve_dense_system(), Aleph::split_n(), Aleph::stl_arrangements(), Aleph::stl_combinations(), Aleph::stl_group_by(), Aleph::stl_max_by(), Aleph::stl_min_by(), Aleph::stl_traverse_arrangements(), Aleph::stl_traverse_combinations(), Aleph::subset_sum(), Aleph::suffix_array(), 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(), 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_DynMap(), test_DynMapLinHash(), test_DynSet(), test_DynSetLinHash(), 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(), Aleph::Vector< T, NumType >::to_str(), Aleph::MCF_Graph< NodeT, ArcT >::total_cost(), Aleph::blossom_weighted_detail::mwmatching::impl::MatchingContext< WeightType >::trace_alternating_paths(), Aleph::FFT< Real >::transfer_function_to_sections(), Aleph::FFT< Real >::transform_real_optimized(), Aleph::VoronoiDiagramFortune::triangulate_sweep(), Aleph::Gen_Polynomial< Coefficient >::try_divide_by_linear_factor(), Aleph::FFT< Real >::try_laguerre_roots(), TYPED_TEST(), TYPED_TEST(), TYPED_TEST(), TYPED_TEST(), TYPED_TEST(), TYPED_TEST(), TYPED_TEST(), TYPED_TEST(), TYPED_TEST(), TYPED_TEST(), TYPED_TEST_P(), TYPED_TEST_P(), TYPED_TEST_P(), TYPED_TEST_P(), TYPED_TEST_P(), Aleph::uni_group_by(), Aleph::Gen_Binary_Lifting_LCA< GT, SA >::up_at(), Aleph::Gen_Binary_Lifting_LCA< GT, SA >::up_at(), Aleph::Fibonacci_Heap< T, Compare >::update_key(), Aleph::FFT< Real >::upfirdn(), Aleph::FFT< Real >::validate_real_spectrum(), Aleph::MCF_LP_Solver< Net >::var_index(), Aleph::vertex_connectivity(), Aleph::warshall_compute_transitive_clausure(), and Aleph::yen_k_shortest_paths().