Outperforming std::deque: Introducing the Shift-To-Middle Array

The Shift-To-Middle Array is a dynamic array designed to outperform std::deque, std::vector, and linked lists in insertion and deletion at both ends. It achieves this by using contiguous memory, improving cache locality, and supporting SIMD and parallel optimizations. Benchmarks show significant performance gains, especially on multi-core CPUs and hardware with SIMD instruction sets. The project is open-source, with full API documentation and benchmark reports available. Contributions are welcome!