The deque class in the Copenhagen STL: First attempt

TL;DRAbstract

Abstract. This report presents work done to implement the deque class for the Copenhagen STL. The ideas of two articles are explored and combined in an at-tempt to implement a data structure that improves the running times of the core deque operations compared to an existing implementation. Even though the the-oretical time requirements are achieved, benchmarks show that the data structure performs poorly compared to the existing deque implementation in the operations concerned with growing and shrinking the data structure at the ends. Considering that these operations are key operations of a deque, the measured performance makes the implemented deque an unappealing choice for the Copenhagen STL deque class. However, the implemented deque offers substantial improvements of the random element access operations, and greatly outperforms the deque to which it is compared in operations that inserts and erase elements. It is recommended that an implementation combining the work of this proje

Chat with Paper

AI Agents for this Paper