Initial Commit

Circular Buffer including Queues (FIFO) and Stacks (FILO)

• Support for Queue or Stack from the same base class
• Restrict overflow or not
• O(1) operations for insertions (queue/push) and removal (dequeue/pop)
• Preview any element at index, or all
• Insert elements directly from an array in near O(1) time (no for loop)