Deque implementation
IvanFilipov opened this issue · 2 comments
IvanFilipov commented
What is interesting here - to have O(1) access at random possition
IvanFilipov commented
Features to support:
- O(1) random access
- push_back/push_front O(1)*
- pop also
- random access iterator (maybe)
generally to be as close as possible to std::deque
Notes:
- should be in dsa:: namespace
- should follow the code convention
- put it into FMI-DSA/data_structures/deque
- embed it to tests into FMI-DSA/data_structures/stack/template_stack and FMI-DSA/data_structures/queue/template_queue
IvanFilipov commented