A fast and flexible doubly linked list that allows for O(1) inserts and removes in the middle of the list. This list pre-allocates memory and doesn't have to allocate and deallocate memory on every insert / remove operation