Cdt: a general and efficient container data type library

Authors:
Kiem-Phong Vo
Affiliations:
AT&T Labs, Murray Hill, NJ
Venue:
ATEC '97 Proceedings of the annual conference on USENIX Annual Technical Conference
Year:
1997

Citing 4
Cited 0

Self-adjusting binary search trees

Journal of the ACM (JACM)
Algorithms (2nd ed.)

Algorithms (2nd ed.)
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
The STL Tutorial and Reference Guide: C++ Programming with the Standard Template Library

The STL Tutorial and Reference Guide: C++ Programming with the Standard Template Library

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cdt is a container type library that provides a uniform set of operations to manage dictionaries based on the common storage methods: list, stack, queue, set, and ordered set. It is implemented on top of linked lists, hash tables, and splay trees. Applications can dynamically change both object description and storage methods so that abstract operations can be exactly matched with run-time requirements to optimize performance. This paper briefly overviews Cdt and presents a performance study comparing it to other popular container data type packages.