The deepmesa linked list was designed to be fast. Here we demonstrate the performance gains against std::LinkedList.
The Deepmesa Linkedlist is 2x faster at pushing elements to the front of the list. This is primarily because the list doesn't have to allocate memory on every push
Similarly, the Deepmesa Linkedlist is 2x faster at pushing elements to the back of the list. Again, this is because the list doesn't have to allocate memory on every push
The Deepmesa Linkedlist is 2x faster at popping elements from the front of the list. This is primarily because the list doesn't have to deallocate memory on every pop
The Deepmesa Linkedlist is 2x faster at popping elements from the back of the list. This is because the list doesn't have to deallocate memory on every pop
std::LinkedList doesn't allow pushing in the middle of the list so we benchmark against pushing to the front of the list. Pushing in the middle of the deepmesa list is a faster constant time operation than pushing to the front of the std::LinkedList.