Repository files navigation

• Generic
• Unit tested
• Terminating errors
• Documented

General overview:

1. Red Black Tree

   • Initialization
   • Insertion
   • Deletion
   • Searching
   • Contains
   • Print
   • Pre order traversal
   • In order traversal
   • Post order traversal
   • Get Size
   • Is Empty
   • Transform to array
   • Clear
   • Destroy

2. AVL Tree

   • Initialization
   • Insertion
   • Deletion
   • Searching
   • Contains
   • Pre order traversal
   • In order traversal
   • Post order traversal
   • Breadth first traversal
   • Get Size
   • Is Empty
   • Transform to array
   • Clear
   • Destroy

3. Binary Tree

   • Initialization
   • Insertion
   • Deletion
   • Searching
   • Contains
   • Pre order traversal
   • In order traversal
   • Post order traversal
   • Get Size
   • Is Empty
   • Transform to array
   • Clear
   • Destroy

4. Splay Tree

   • Initialization
   • Insertion
   • Deletion
   • Searching
   • Contains
   • Get Size
   • Is Empty
   • Transform to array
   • Clear
   • Destroy

5. Binary Heap

   • Initialization
   • Insertion
   • Deletion
   • Searching
   • Contains
   • Get Size
   • Is Empty
   • Transform to array
   • Clear
   • Destroy

6. Trie

   • Initialization
   • Add word
   • Remove Word
   • Contains Word
   • Auto completion
   • Generate suggestions
   • Print words
   • Clear
   • Destroy

1. Directed Graph

   • Initialization
   • Add node
   • remove node
   • add edge
   • remove edge
   • Contains node
   • Contains edge
   • Get size
   • Is empty
   • Print
   • Depth first traversal
   • Breadth first traversal
   • Topological sort
   • Check if node is a part of cycle
   • Graph Contains Cycles
   • Clear
   • Destroy

2. Undirected Graph

   • Initialization
   • Add node
   • remove node
   • add edge
   • remove edge
   • Contains node
   • Contains edge
   • Get edge weight
   • Get size
   • Is empty
   • Print
   • Shortest distance (Dijkstra's algorithm)
   • Shortest path (Dijkstra's algorithm)
   • Minimum spanning graph (Prim's algorithm)
   • Check if node is a part of cycle
   • Graph Contains Cycles
   • Clear
   • Destroy

1. Hashmap

2. Linked list hashmap

   • Initialization
   • Insertion
   • Deletion
   • Search for value
   • Search for key
   • Contains
   • Transform to value array
   • Transform to entry array
   • Get size
   • Is empty
   • Clear
   • Destroy

3. Hashset

   • Initialization
   • Insertion
   • Deletion
   • Search
   • Contains
   • Transform to array
   • Get size
   • Is empty
   • Clear
   • Destroy

1. String
   • Initialization
   • Append character
   • Add character at index
   • Update character
   • Remove character
   • Append char array or string
   • Change string by another char array or string
   • Get character index
   • Get character at index
   • Is sub string of another char array or string
   • Convert to char array
   • Convert to char array between specific range
   • Is equal to char array or to string
   • Compare with char array or with string
   • Get length
   • Trim, trim start, and trim end
   • Custom trim, trim start, and trim end
   • Scan input
   • Print
   • Split
   • Clear
   • Destroy

1. Vector

2. Array list

   • Initialization
   • Insertion
   • Deletion
   • Contains
   • Get
   • Get index and get last index
   • Transform to array and sub array
   • Sort
   • Get length
   • Is empty
   • Print
   • Clear
   • Destroy

3. Set

   • Initialization
   • Insertion
   • Deletion
   • Contains
   • Get
   • Get index
   • Transform to array
   • Get length
   • Is empty
   • Clear
   • Destroy

4. Linked list

5. Doubly linked list

   • Initialization
   • Insertion
   • Deletion
   • Get
   • Get index
   • Get item
   • Get at index
   • Get first and last
   • Contains
   • Transform to array
   • Get length
   • Is empty
   • Print
   • Clear
   • Destroy

1. Matrix

   • Initialization
   • Insertion
   • Deletion
   • Get
   • Get index
   • Contains
   • Add row at last and at index
   • Add column at last and at index
   • Remove row at index
   • Remove column at index
   • Get number of rows
   • Get number of columns
   • Get number of items
   • Is empty
   • Transform to array
   • Print
   • Clear
   • Destroy

1. Pair

   • Initialization
   • Get first and second
   • Set first and second
   • Set first and second without freeing the old elements
   • Swap elements
   • Destroy

1. Stack

2. Doubly linked list stack

   • Initialization
   • Push
   • Pop
   • Peek
   • Contains
   • Is equal to another stack
   • Transform to array
   • Get length
   • Is empty
   • Clear
   • Destroy

1. Queue

2. Linked list queue

3. Stack queue

4. Priority queue

5. Priority queue implemnted using binary heap

   • Initialization
   • Enqueue
   • Dequeue
   • Peek
   • Get length
   • Is empty
   • Transform to array
   • Clear
   • Destroy

1. Deque

2. Doubly linked list deque

   • Initialization
   • Insert front and end
   • Get front and end
   • Peek front and end
   • Get length
   • Is Empty
   • Transform to array
   • Clear
   • Destroy

• Get number of digits
• Transform to char array
• Max int
• Min int
• Compare integers
• Compare integers reverse
• Compare integers pointers
• Compare integers pointers reverse
• Generate integer pointer from another integer pointer
• Generate integer pointer from an integer value
• Integer hash function
• Sum two integers
• Sum array of integers

1. Text File Loader

   • Initialization
   • Read file as string or as char array
   • Read file lines
   • Read file using a delimiter
   • Count lines
   • Read a specific line as a string or a char array
   • Write a string or a char array
   • Append a string or a char array at the end of the file
   • Append a string or a char array at the end of a specific line
   • Add a string or a char array at a specific line index
   • Update a specific line using a string or a char array
   • Remove a specific line
   • Change file
   • Clear the text file
   • Destroy

2. Input Scanner

   You should pass stdin file to the function to scan the input.

   • Scan String
   • Scan char array
   • Scan character
   • Scan integer
   • Scan long
   • Scan long long
   • Scan short
   • Scan double
   • Scan float

The errors codes generated by summing the words ASCII values of the characters and multiply every character value by it's( index + 1 ).
The first four error code numbers are the sum of the "DATA_STRUCTURE" characters,
and the rest of the error code is the sum of the error enum.
ex: INVALID_ARG is 4987.