-- main() : graph_coloring.cpp, knight_tour.cpp, minimax.cpp, n_queens.cpp, n_queens_all_solution_optimised.cpp, nqueen_print_all_solutions.cpp, rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, sudoku_solver.cpp, wildcard_matching.cpp, count_bits_flip.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, set_kth_bit.cpp, a1z26_cipher.cpp, atbash_cipher.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, fcfs_scheduling.cpp, avltree.cpp, disjoint_set.cpp, dsu_path_compression.cpp, dsu_union_rank.cpp, linked_list.cpp, linkedlist_implentation_usingarray.cpp, list_array.cpp, queue_using_array.cpp, queue_using_two_stacks.cpp, reverse_a_linked_list.cpp, skip_list.cpp, sparse_table.cpp, tree_234.cpp, trie_modern.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.cpp, jarvis_algorithm.cpp, line_segment_intersection.cpp, bidirectional_dijkstra.cpp, breadth_first_search.cpp, connected_components.cpp, connected_components_with_dsu.cpp, depth_first_search.cpp, depth_first_search_with_stack.cpp, dijkstra.cpp, hamiltons_cycle.cpp, hopcroft_karp.cpp, is_graph_bipartite.cpp, lowest_common_ancestor.cpp, travelling_salesman_problem.cpp, spirograph.cpp, jumpgame.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, approximate_pi.cpp, area.cpp, armstrong_number.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.cpp, eulers_totient_function.cpp, extended_euclid_algorithm.cpp, factorial.cpp, fast_power.cpp, fibonacci.cpp, fibonacci_fast.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, gcd_iterative_euclidean.cpp, gcd_of_n_numbers.cpp, gcd_recursive_euclidean.cpp, integral_approximation.cpp, integral_approximation2.cpp, inv_sqrt.cpp, large_factorial.cpp, largest_power.cpp, lcm_sum.cpp, least_common_multiple.cpp, magic_number.cpp, miller_rabin.cpp, modular_division.cpp, modular_exponentiation.cpp, modular_inverse_fermat_little_theorem.cpp, modular_inverse_simple.cpp, n_bonacci.cpp, n_choose_r.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, perimeter.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.cpp, realtime_stats.cpp, sieve_of_eratosthenes.cpp, sqrt_double.cpp, string_fibonacci.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, volume.cpp, babylonian_method.cpp, bisection_method.cpp, brent_method_extrema.cpp, composite_simpson_rule.cpp, false_position.cpp, fast_fourier_transform.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, gram_schmidt.cpp, inverse_fast_fourier_transform.cpp, lu_decompose.cpp, midpoint_integral_method.cpp, newton_raphson_method.cpp, ode_forward_euler.cpp, ode_midpoint_euler.cpp, ode_semi_implicit_euler.cpp, qr_decomposition.cpp, qr_eigen_values.cpp, rungekutta.cpp, successive_approximation.cpp, array_left_rotation.cpp, array_right_rotation.cpp, circular_linked_list.cpp, inorder_successor_of_bst.cpp, intersection_of_two_arrays.cpp, reverse_binary_tree.cpp, trie_multiple_search.cpp, union_of_two_arrays.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, kadanes3.cpp, lru_cache.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, recursive_tree_traversal.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, geometric_dist.cpp, poisson_dist.cpp, windowed_median.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, prefix_sum_array.cpp, segtree.cpp, sparse_table.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search2.cpp, linear_search.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, binary_insertion_sort.cpp, bogo_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, strand_sort.cpp, wave_sort.cpp, brute_force_string_searching.cpp, horspool.cpp, knuth_morris_pratt.cpp, manacher_algorithm.cpp, rabin_karp.cpp, z_function.cpp
+- main() : graph_coloring.cpp, knight_tour.cpp, minimax.cpp, n_queens.cpp, n_queens_all_solution_optimised.cpp, nqueen_print_all_solutions.cpp, rat_maze.cpp, subarray_sum.cpp, subset_sum.cpp, sudoku_solver.cpp, wildcard_matching.cpp, count_bits_flip.cpp, count_of_set_bits.cpp, count_of_trailing_ciphers_in_factorial_n.cpp, hamming_distance.cpp, set_kth_bit.cpp, a1z26_cipher.cpp, atbash_cipher.cpp, caesar_cipher.cpp, elliptic_curve_key_exchange.cpp, hill_cipher.cpp, morse_code.cpp, vigenere_cipher.cpp, xor_cipher.cpp, fcfs_scheduling.cpp, avltree.cpp, bloom_filter.cpp, disjoint_set.cpp, dsu_path_compression.cpp, dsu_union_rank.cpp, linked_list.cpp, linkedlist_implentation_usingarray.cpp, list_array.cpp, queue_using_array.cpp, queue_using_two_stacks.cpp, reverse_a_linked_list.cpp, skip_list.cpp, sparse_table.cpp, tree_234.cpp, trie_modern.cpp, trie_tree.cpp, trie_using_hashmap.cpp, karatsuba_algorithm_for_fast_multiplication.cpp, 0_1_knapsack.cpp, abbreviation.cpp, coin_change_topdown.cpp, cut_rod.cpp, house_robber.cpp, kadane2.cpp, longest_increasing_subsequence.cpp, longest_palindromic_subsequence.cpp, minimum_edit_distance.cpp, palindrome_partitioning.cpp, shortest_common_supersequence.cpp, word_break.cpp, jarvis_algorithm.cpp, line_segment_intersection.cpp, bidirectional_dijkstra.cpp, breadth_first_search.cpp, connected_components.cpp, connected_components_with_dsu.cpp, depth_first_search.cpp, depth_first_search_with_stack.cpp, dijkstra.cpp, hamiltons_cycle.cpp, hopcroft_karp.cpp, is_graph_bipartite.cpp, lowest_common_ancestor.cpp, travelling_salesman_problem.cpp, spirograph.cpp, jumpgame.cpp, chaining.cpp, double_hash_hash_table.cpp, linear_probing_hash_table.cpp, md5.cpp, quadratic_probing_hash_table.cpp, sha1.cpp, adaline_learning.cpp, kohonen_som_topology.cpp, kohonen_som_trace.cpp, neural_network.cpp, ordinary_least_squares_regressor.cpp, approximate_pi.cpp, area.cpp, armstrong_number.cpp, binary_exponent.cpp, binomial_calculate.cpp, check_amicable_pair.cpp, check_factorial.cpp, check_prime.cpp, complex_numbers.cpp, double_factorial.cpp, eulers_totient_function.cpp, extended_euclid_algorithm.cpp, factorial.cpp, fast_power.cpp, fibonacci.cpp, fibonacci_fast.cpp, fibonacci_matrix_exponentiation.cpp, fibonacci_sum.cpp, finding_number_of_digits_in_a_number.cpp, gcd_iterative_euclidean.cpp, gcd_of_n_numbers.cpp, gcd_recursive_euclidean.cpp, integral_approximation.cpp, integral_approximation2.cpp, inv_sqrt.cpp, large_factorial.cpp, largest_power.cpp, lcm_sum.cpp, least_common_multiple.cpp, magic_number.cpp, miller_rabin.cpp, modular_division.cpp, modular_exponentiation.cpp, modular_inverse_fermat_little_theorem.cpp, modular_inverse_simple.cpp, n_bonacci.cpp, n_choose_r.cpp, ncr_modulo_p.cpp, number_of_positive_divisors.cpp, perimeter.cpp, power_for_huge_numbers.cpp, power_of_two.cpp, prime_factorization.cpp, prime_numbers.cpp, primes_up_to_billion.cpp, realtime_stats.cpp, sieve_of_eratosthenes.cpp, sqrt_double.cpp, string_fibonacci.cpp, sum_of_binomial_coefficient.cpp, sum_of_digits.cpp, vector_cross_product.cpp, volume.cpp, babylonian_method.cpp, bisection_method.cpp, brent_method_extrema.cpp, composite_simpson_rule.cpp, false_position.cpp, fast_fourier_transform.cpp, gaussian_elimination.cpp, golden_search_extrema.cpp, gram_schmidt.cpp, inverse_fast_fourier_transform.cpp, lu_decompose.cpp, midpoint_integral_method.cpp, newton_raphson_method.cpp, ode_forward_euler.cpp, ode_midpoint_euler.cpp, ode_semi_implicit_euler.cpp, qr_decomposition.cpp, qr_eigen_values.cpp, rungekutta.cpp, successive_approximation.cpp, array_left_rotation.cpp, array_right_rotation.cpp, circular_linked_list.cpp, inorder_successor_of_bst.cpp, intersection_of_two_arrays.cpp, reverse_binary_tree.cpp, trie_multiple_search.cpp, union_of_two_arrays.cpp, buzz_number.cpp, decimal_to_hexadecimal.cpp, decimal_to_roman_numeral.cpp, fast_integer_input.cpp, happy_number.cpp, iterative_tree_traversals.cpp, kadanes3.cpp, lru_cache.cpp, matrix_exponentiation.cpp, palindrome_of_number.cpp, pascal_triangle.cpp, postfix_evaluation.cpp, primality_test.cpp, recursive_tree_traversal.cpp, smallest_circle.cpp, sparse_matrix.cpp, spiral_print.cpp, stairs_pattern.cpp, tower_of_hanoi.cpp, vector_important_functions.cpp, addition_rule.cpp, bayes_theorem.cpp, binomial_dist.cpp, geometric_dist.cpp, poisson_dist.cpp, windowed_median.cpp, fenwick_tree.cpp, heavy_light_decomposition.cpp, persistent_seg_tree_lazy_prop.cpp, prefix_sum_array.cpp, segtree.cpp, sparse_table.cpp, exponential_search.cpp, fibonacci_search.cpp, floyd_cycle_detection_algo.cpp, hash_search.cpp, interpolation_search2.cpp, linear_search.cpp, median_search.cpp, saddleback_search.cpp, sublist_search.cpp, ternary_search.cpp, text_search.cpp, binary_insertion_sort.cpp, bogo_sort.cpp, comb_sort.cpp, count_inversions.cpp, cycle_sort.cpp, dnf_sort.cpp, gnome_sort.cpp, heap_sort.cpp, insertion_sort.cpp, merge_insertion_sort.cpp, merge_sort.cpp, pancake_sort.cpp, pigeonhole_sort.cpp, quick_sort.cpp, quick_sort_3.cpp, radix_sort2.cpp, random_pivot_quick_sort.cpp, recursive_bubble_sort.cpp, selection_sort_recursive.cpp, shell_sort2.cpp, strand_sort.cpp, wave_sort.cpp, brute_force_string_searching.cpp, horspool.cpp, knuth_morris_pratt.cpp, manacher_algorithm.cpp, rabin_karp.cpp, z_function.cpp
- mat_mul() : qr_eigen_values.cpp
- mat_size : matrix_exponentiation.cpp
- matrix : lu_decomposition.h
diff --git a/globals_s.html b/globals_s.html
index 74bdbd7d1..634a418b2 100644
--- a/globals_s.html
+++ b/globals_s.html
@@ -111,8 +111,8 @@ $(document).ready(function(){initNavTree('globals_s.html',''); initResizable();
- show_array() : bogo_sort.cpp
- show_data() : shell_sort2.cpp
- show_pascal() : pascal_triangle.cpp
-- Sieve() : primes_up_to_billion.cpp
- sieve() : sieve_of_eratosthenes.cpp
+- Sieve() : primes_up_to_billion.cpp
- SieveOfEratosthenes() : prime_factorization.cpp
- sortcol() : fcfs_scheduling.cpp
- spiralPrint() : spiral_print.cpp
diff --git a/globals_t.html b/globals_t.html
index 64da1c146..6732cd830 100644
--- a/globals_t.html
+++ b/globals_t.html
@@ -115,6 +115,9 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
- test_3d_classes() : kohonen_som_trace.cpp
- test_3d_classes1() : kohonen_som_topology.cpp
- test_3d_classes2() : kohonen_som_topology.cpp
+- test_bitset() : bloom_filter.cpp
+- test_bloom_filter_int() : bloom_filter.cpp
+- test_bloom_filter_string() : bloom_filter.cpp
- test_circle() : kohonen_som_trace.cpp
- test_contains() : binary_search_tree2.cpp
- test_double() : quick_sort_3.cpp
diff --git a/hierarchy.html b/hierarchy.html
index 1bb81bf89..8e39b676a 100644
--- a/hierarchy.html
+++ b/hierarchy.html
@@ -109,108 +109,110 @@ This inheritance list is sorted roughly, but not completely, alphabetically: Cbinary_search_tree< T > | The Binary Search Tree class |
| Coperations_on_datastructures::reverse_binary_tree::BinaryTree | A Binary Tree class that implements a Binary Search Tree (BST) by default |
| Cothers::iterative_tree_traversals::BinaryTree | Defines the functions associated with the binary tree |
-| Cbinary_search_tree< T >::bst_node | A struct to represent a node in the Binary Search Tree |
-| Cothers::recursive_tree_traversals::BT | BT used to make the entire structure of the binary tree and the functions associated with the binary tree |
-| CBtree | |
-| Coperations_on_datastructures::circular_linked_list::CircularLinkedList | A class that implements a Circular Linked List |
-| Ccll | |
-| CCompare< S, T, E > | Comparator class for priority queue |
-| Ccompare | |
-| Cmachine_learning::aystar_search::AyStarSearch< Puzzle >::comparison_operator | Custom comparator for open_list |
-| CComplex | Class Complex to represent complex numbers as a field |
-| Cgeometry::jarvis::Convexhull | |
-| CCycleCheck | |
-| Cmachine_learning::neural_network::layers::DenseLayer | |
-| Cdouble_linked_list | |
-| Cdsu | Disjoint sets union data structure, class based representation |
-| CEasterYearMonthDay | For IO operations |
-| CEdge | |
-| Cmachine_learning::aystar_search::EightPuzzle< N > | A class defining EightPuzzle/15-Puzzle game |
-| Cdouble_hashing::Entry | |
-| Clinear_probing::Entry | |
-| Cquadratic_probing::Entry | |
-| CFCFS< S, T, E > | Class which implements the FCFS scheduling algorithm |
-| CFenwickTree | |
-| Cprobability::geometric_dist::geometric_distribution | A class to model the geometric distribution |
-| CGraph | |
-| ►Cgraph::Graph< T > | |
-| Cgraph::RootedTree | |
-| Cgraph::is_graph_bipartite::Graph | Class for representing graph as an adjacency list |
-| Chash_chain | Chain class with a given modulus |
-| Cciphers::HillCipher | Implementation of Hill Cipher algorithm |
-| Cgraph::HKGraph | Represents Bipartite graph for Hopcroft Karp implementation |
-| Cmachine_learning::aystar_search::AyStarSearch< Puzzle >::Info | Struct that handles all the information related to the current state |
-| CItem | |
-| Clarge_number | |
-| Cdata_structures::linked_list::link | |
-| Clinkedlist | |
-| Cdata_structures::linked_list::list | |
-| Cdata_structures::list_array::list< N > | Structure of List with supporting methods |
-| Clist | |
-| Cgraph::LowestCommonAncestor | |
-| Cothers::lru_cache::LRUCache | LRU cache class |
-| CMinHeap | |
-| CMinHeapNode | |
-| Cmst | |
-| Cmath::ncr_modulo_p::NCRModuloP | Class which contains all methods required for calculating nCr mod p |
-| Cmachine_learning::neural_network::NeuralNetwork | |
-| Cdata_structures::linked_list::Node | |
-| Cdata_structures::Node | |
-| Cdata_structures::tree_234::Node | 2-3-4 tree node class |
-| Cdata_structures::trie_using_hashmap::Trie::Node | Struct representing a trie node |
-| Cnode< Kind > | |
-| CNode | |
-| Coperations_on_datastructures::circular_linked_list::Node | A Node struct that represents a single Node in a Binary Tree |
-| Coperations_on_datastructures::inorder_traversal_of_bst::Node | A Node structure representing a single node in BST |
-| Coperations_on_datastructures::reverse_binary_tree::Node | A Node struct that represents a single node in a Binary Tree |
-| Cothers::iterative_tree_traversals::Node | Defines the structure of a node of the tree |
-| Cothers::recursive_tree_traversals::Node | The structure to hold Nodes of the tree |
-| Crange_queries::perSegTree::Node | |
-| Csearch::sublist_search::Node | A Node structure representing a single link Node in a linked list |
-| Cnode< Type > | |
-| Crange_queries::perSegTree | Range query here is range sum, but the code can be modified to make different queries like range max or min |
-| Cciphers::elliptic_curve_key_exchange::Point | Definition of struct Point |
-| Cgeometry::grahamscan::Point | |
-| Cgeometry::jarvis::Point | |
-| Cmath::Point | |
-| CPoint | |
-| Cquery | |
-| Cqueue< Kind > | |
-| CQueue | |
-| Cdata_structures::queue_using_array::Queue_Array | Queue_Array class containing the main data and also index of head and tail of the array |
-| CRBtree | |
-| CSegmentIntersection | |
-| ►Crange_queries::heavy_light_decomposition::SG< X > | Segment Tree, to store heavy chains |
-| Crange_queries::heavy_light_decomposition::HLD< X > | The Heavy-Light Decomposition class |
-| Cdata_structures::SkipList | |
-| CSolution | |
-| Cdata_structures::sparse_table::Sparse_table | |
-| Cdata_structures::stack_using_queue::Stack | Stack Class implementation for basic methods of Stack Data Structure |
-| Cothers::postfix_expression::Stack | Creates an array to be used as stack for storing values |
-| Cstack< Type > | |
-| Cstack_linkedList | |
-| Cstatistics::stats_computer1< T > | |
-| Cstatistics::stats_computer2< T > | |
-| CTestCases | Class encapsulating the necessary test cases |
-| Coperations_on_datastructures::trie_operations::Tnode | Class defining the structure of trie node and containing the methods to perform operations on them |
-| Ctower | |
-| ►Crange_queries::heavy_light_decomposition::Tree< X > | A Basic Tree, which supports binary lifting |
-| Crange_queries::heavy_light_decomposition::HLD< X > | The Heavy-Light Decomposition class |
-| Cdata_structures::tree_234::Tree234 | 2-3-4 tree class |
-| Cdata_structures::trie | Trie implementation for small-case English alphabets a-z |
-| Cdata_structures::trie_using_hashmap::Trie | Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix |
-| CTrie | |
-| CTrie::TrieNode | |
-| ►Cstd::true_type [external] | |
-| Cstd::is_arithmetic< uint128_t > | |
-| Cstd::is_arithmetic< uint256_t > | |
-| Cstd::is_integral< uint128_t > | |
-| Cstd::is_integral< uint256_t > | |
-| Cstd::is_unsigned< uint128_t > | |
-| Cstd::is_unsigned< uint256_t > | |
-| Cuint128_t | Class for 128-bit unsigned integer |
-| Cuint256_t | Class for 256-bit unsigned integer |
-| Cprobability::windowed_median::WindowedMedian | A class to calculate the median of a leading sliding window at the back of a stream of integer values |
+| Cdata_structures::Bitset | Simple bitset implementation for bloom filter |
+| Cdata_structures::BloomFilter< T > | Bloom filter template class |
+| Cbinary_search_tree< T >::bst_node | A struct to represent a node in the Binary Search Tree |
+| Cothers::recursive_tree_traversals::BT | BT used to make the entire structure of the binary tree and the functions associated with the binary tree |
+| CBtree | |
+| Coperations_on_datastructures::circular_linked_list::CircularLinkedList | A class that implements a Circular Linked List |
+| Ccll | |
+| CCompare< S, T, E > | Comparator class for priority queue |
+| Ccompare | |
+| Cmachine_learning::aystar_search::AyStarSearch< Puzzle >::comparison_operator | Custom comparator for open_list |
+| CComplex | Class Complex to represent complex numbers as a field |
+| Cgeometry::jarvis::Convexhull | |
+| CCycleCheck | |
+| Cmachine_learning::neural_network::layers::DenseLayer | |
+| Cdouble_linked_list | |
+| Cdsu | Disjoint sets union data structure, class based representation |
+| CEasterYearMonthDay | For IO operations |
+| CEdge | |
+| Cmachine_learning::aystar_search::EightPuzzle< N > | A class defining EightPuzzle/15-Puzzle game |
+| Cdouble_hashing::Entry | |
+| Clinear_probing::Entry | |
+| Cquadratic_probing::Entry | |
+| CFCFS< S, T, E > | Class which implements the FCFS scheduling algorithm |
+| CFenwickTree | |
+| Cprobability::geometric_dist::geometric_distribution | A class to model the geometric distribution |
+| CGraph | |
+| ►Cgraph::Graph< T > | |
+| Cgraph::RootedTree | |
+| Cgraph::is_graph_bipartite::Graph | Class for representing graph as an adjacency list |
+| Chash_chain | Chain class with a given modulus |
+| Cciphers::HillCipher | Implementation of Hill Cipher algorithm |
+| Cgraph::HKGraph | Represents Bipartite graph for Hopcroft Karp implementation |
+| Cmachine_learning::aystar_search::AyStarSearch< Puzzle >::Info | Struct that handles all the information related to the current state |
+| CItem | |
+| Clarge_number | |
+| Cdata_structures::linked_list::link | |
+| Clinkedlist | |
+| Cdata_structures::linked_list::list | |
+| Cdata_structures::list_array::list< N > | Structure of List with supporting methods |
+| Clist | |
+| Cgraph::LowestCommonAncestor | |
+| Cothers::lru_cache::LRUCache | LRU cache class |
+| CMinHeap | |
+| CMinHeapNode | |
+| Cmst | |
+| Cmath::ncr_modulo_p::NCRModuloP | Class which contains all methods required for calculating nCr mod p |
+| Cmachine_learning::neural_network::NeuralNetwork | |
+| Cdata_structures::linked_list::Node | |
+| Cdata_structures::Node | |
+| Cdata_structures::tree_234::Node | 2-3-4 tree node class |
+| Cdata_structures::trie_using_hashmap::Trie::Node | Struct representing a trie node |
+| CNode | |
+| Cnode< Kind > | |
+| Coperations_on_datastructures::circular_linked_list::Node | A Node struct that represents a single Node in a Binary Tree |
+| Coperations_on_datastructures::inorder_traversal_of_bst::Node | A Node structure representing a single node in BST |
+| Coperations_on_datastructures::reverse_binary_tree::Node | A Node struct that represents a single node in a Binary Tree |
+| Cothers::iterative_tree_traversals::Node | Defines the structure of a node of the tree |
+| Cothers::recursive_tree_traversals::Node | The structure to hold Nodes of the tree |
+| Crange_queries::perSegTree::Node | |
+| Csearch::sublist_search::Node | A Node structure representing a single link Node in a linked list |
+| Cnode< Type > | |
+| Crange_queries::perSegTree | Range query here is range sum, but the code can be modified to make different queries like range max or min |
+| Cciphers::elliptic_curve_key_exchange::Point | Definition of struct Point |
+| Cgeometry::grahamscan::Point | |
+| Cgeometry::jarvis::Point | |
+| Cmath::Point | |
+| CPoint | |
+| Cquery | |
+| CQueue | |
+| Cqueue< Kind > | |
+| Cdata_structures::queue_using_array::Queue_Array | Queue_Array class containing the main data and also index of head and tail of the array |
+| CRBtree | |
+| CSegmentIntersection | |
+| ►Crange_queries::heavy_light_decomposition::SG< X > | Segment Tree, to store heavy chains |
+| Crange_queries::heavy_light_decomposition::HLD< X > | The Heavy-Light Decomposition class |
+| Cdata_structures::SkipList | |
+| CSolution | |
+| Cdata_structures::sparse_table::Sparse_table | |
+| Cdata_structures::stack_using_queue::Stack | Stack Class implementation for basic methods of Stack Data Structure |
+| Cothers::postfix_expression::Stack | Creates an array to be used as stack for storing values |
+| Cstack< Type > | |
+| Cstack_linkedList | |
+| Cstatistics::stats_computer1< T > | |
+| Cstatistics::stats_computer2< T > | |
+| CTestCases | Class encapsulating the necessary test cases |
+| Coperations_on_datastructures::trie_operations::Tnode | Class defining the structure of trie node and containing the methods to perform operations on them |
+| Ctower | |
+| ►Crange_queries::heavy_light_decomposition::Tree< X > | A Basic Tree, which supports binary lifting |
+| Crange_queries::heavy_light_decomposition::HLD< X > | The Heavy-Light Decomposition class |
+| Cdata_structures::tree_234::Tree234 | 2-3-4 tree class |
+| Cdata_structures::trie | Trie implementation for small-case English alphabets a-z |
+| Cdata_structures::trie_using_hashmap::Trie | Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix |
+| CTrie | |
+| CTrie::TrieNode | |
+| ►Cstd::true_type [external] | |
+| Cstd::is_arithmetic< uint128_t > | |
+| Cstd::is_arithmetic< uint256_t > | |
+| Cstd::is_integral< uint128_t > | |
+| Cstd::is_integral< uint256_t > | |
+| Cstd::is_unsigned< uint128_t > | |
+| Cstd::is_unsigned< uint256_t > | |
+| Cuint128_t | Class for 128-bit unsigned integer |
+| Cuint256_t | Class for 256-bit unsigned integer |
+| Cprobability::windowed_median::WindowedMedian | A class to calculate the median of a leading sliding window at the back of a stream of integer values |
1.9.5
+