Added logo to documentation backup and updated TODO

TODO

@@ -2,19 +2,16 @@ TODO
 
 [/] - In Progress
 [X] - Finished
-[~] - Needs to be reviewed
 
 #!! High Priority ----------------------------------------------------------------------------------
 
 [/] Tests
 [/] Documentation
-[/] Add error codes that can be accessed from the collection's struct
 [/] Callback utility
     on_create, on_read, on_update, on_delete, on_resize
 
 #!! Medium Priority --------------------------------------------------------------------------------
 
-[ ] Add memory usage in the benchmark
 [ ] Add to_array and from_array functions
 [ ] Separate each collection unit test into their own executable
 
@@ -27,43 +24,14 @@ TODO
     [ ] deserialize  {all}
 [ ] Zip Iterators
 [ ] Consumer Iterators
-[ ] Dev Collections
-    [ ] BidiMap
-    [~] Deque
-    [ ] HashMap
-    [ ] HashSet
-    [ ] Heap
-    [ ] IntervalHeap
-    [ ] LinkedList
-    [ ] List
-    [ ] MultiMap
-    [ ] MultiSet
-    [ ] Queue
-    [ ] SortedList
-    [ ] Stack
-    [ ] TreeMap
-    [ ] TreeSet
-[ ] Statically Allocated Collections
-    [ ] BidiMap
-    [ ] Deque
-    [ ] HashMap
-    [ ] HashSet
-    [ ] Heap
-    [ ] IntervalHeap
-    [ ] LinkedList
-    [ ] List
-    [ ] MultiMap
-    [ ] MultiSet
-    [~] Queue
-    [ ] SortedList
-    [~] Stack
-    [ ] TreeMap
-    [ ] TreeSet
+[ ] Add memory usage in the benchmark
 
 #!! Optimizations ----------------------------------------------------------------------------------
 
 [ ] Use binary search to find optimum hashtable prime size inside impl_calculate_size
 [ ] Optimize certain loops that use iterators but can simply use a normal loop
+[ ] Replace IntervalHeap node by a simple buffer of two pointers (V (*buffer)[2])
+[ ] Merge bidirectional map key_buffer and val_buffer to a single buffer and make key_dist and val_dist into dist[2]
 
 #!! Done -------------------------------------------------------------------------------------------
 
@@ -95,3 +63,4 @@ TODO
 [X] Fix cases where new_custom() should be used instead of just new()
 [X] Add Function Tables that contains data type functions
     (compare, copy, display, free, hash, priority)
+[X] Add error codes that can be accessed from the collection's struct