|
|
|
|
|
|
by bogdan-lab
446 days ago
|
|
|
The main benefit list gives you comparing to vector is a stable memory. This is often an important property. But lists are slow with an element access. This problem is solved by deque. Therefore, I argue that alternative to deque has to have a stable memory property. Otherwise, you can just use a vector. This implementation is trying to do so, btw, but for some reasons it operates with a raw memory under the hood instead of just holding a vector and rotating it here and there. Such approach is unnecessary complicated and error-prone |
|
|