# Algorithms_in_C++: Class Members

Here is a list of all documented class members with links to the class documentation for each member:

### - _ -

- _digits : large_number

### - a -

- abs() : Complex
- accuracy : machine_learning::adaline
- adaline() : machine_learning::adaline
- add_digit() : large_number
- addEdge() : Graph , graph , Graph
- addVertices() : Graph
- adj : graph
- arg() : Complex

### - c -

- capacity : MinHeap
- check_size_match() : machine_learning::adaline
- clear() : queue< Kind > , stack< Type >
- codec() : ciphers::HillCipher
- Complex() : Complex
- connected_components : graph

### - d -

- data : node< Kind >
- decreaseKey() : MinHeap
- decrypt_text() : ciphers::HillCipher
- deleteKey() : MinHeap
- depth_first_search() : graph
- deQueue() : queue< Kind >
- digit_char() : large_number
- direction() : SegmentIntersection
- display() : queue< Kind > , stack< Type >

### - e -

- Edge() : Edge
- encrypt_text() : ciphers::HillCipher
- enQueue() : queue< Kind >
- eta : machine_learning::adaline
- explore() : graph
- extractMin() : MinHeap

### - f -

- FenwickTree() : FenwickTree
- fit() : machine_learning::adaline
- front() : queue< Kind >

### - g -

- gcd() : ciphers::HillCipher
- generate_decryption_key() : ciphers::HillCipher
- generate_encryption_key() : ciphers::HillCipher
- generate_keys() : ciphers::HillCipher
- get_char_idx() : ciphers::HillCipher
- get_idx_char() : ciphers::HillCipher
- get_inverse() : ciphers::HillCipher
- getAdjList() : Graph
- getConnectedComponents() : graph
- getMin() : MinHeap
- getVertices() : Graph
- Graph() : Graph
- graph() : graph
- Graph() : Graph

### - h -

- harr : MinHeap
- hasChildren() : Trie
- heap_size : MinHeap

### - i -

- imag() : Complex
- insert() : Trie
- insertKey() : MinHeap
- isCyclicBFS() : CycleCheck
- isCyclicDFS() : CycleCheck
- isCyclicDFSHelper() : CycleCheck
- isEmptyQueue() : queue< Kind >
- isEmptyStack() : stack< Type >

### - k -

- key : list

### - l -

- large_number() : large_number
- left() : MinHeap

### - m -

- mat_mul() : ciphers::HillCipher
- mean() : statistics::stats_computer1< T > , statistics::stats_computer2< T >
- MinHeap() : MinHeap
- MinHeapify() : MinHeap
- multiply() : large_number

### - n -

- new_val() : statistics::stats_computer1< T > , statistics::stats_computer2< T >
- next : list , node< Kind >
- num_digits() : large_number

### - o -

- offset() : FenwickTree
- on_segment() : SegmentIntersection
- operator!= : large_number
- operator*() : Complex
- operator*=() : large_number
- operator+() : Complex , large_number
- operator++() : large_number
- operator+=() : large_number
- operator-() : Complex
- operator/() : Complex
- operator<< : large_number , machine_learning::adaline
- operator=() : Complex , large_number , stack< Type >
- operator== : large_number
- operator>> : statistics::stats_computer1< T > , statistics::stats_computer2< T >
- operator[]() : large_number
- operator~() : Complex

### - p -

- Point() : Point
- pop() : stack< Type >
- predict() : machine_learning::adaline
- push() : stack< Type >

### - q -

- queue() : queue< Kind >
- queueFront : queue< Kind >
- queueRear : queue< Kind >

### - r -

- rand_range() : ciphers::HillCipher
- real() : Complex
- removeWordHelper() : Trie
- right() : MinHeap

### - s -

- search() : Trie
- size : stack< Type >
- stack() : stack< Type >
- stackTop : stack< Type >
- std() : statistics::stats_computer1< T > , statistics::stats_computer2< T >
- sum() : FenwickTree
- sum_range() : FenwickTree

### - t -

- test() : large_number
- top() : stack< Type > , tower
- Trie() : Trie

### - u -

- update() : FenwickTree

### - v -

- values : tower
- variance() : statistics::stats_computer1< T > , statistics::stats_computer2< T >

### - w -

- weights : machine_learning::adaline

### - x -

- x : Point

### - y -

- y : Point

### - ~ -

- ~queue() : queue< Kind >
- ~stack() : stack< Type >