| Cmachine_learning::adaline | |
| Cmachine_learning::aystar_search::AyStarSearch< Puzzle > | A class defining A* search algorithm. for some initial state and final state |
| 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 |
| CBtree | |
| Coperations_on_datastructures::circular_linked_list::CircularLinkedList | A class that implements a Circular Linked List |
| Ccll | |
| Ccompare | |
| CCompare< S, T, E > | Comparator class for priority queue |
| 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 | 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 |
| Crange_queries::perSegTree::Node | |
| Csearch::sublist_search::Node | A Node structure representing a single link Node in a linked list |
| 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::jarvis::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.2