Premium
Cdt: a container data type library
Author(s) -
Vo KiemPhong
Publication year - 1997
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/(sici)1097-024x(199710)27:10<1177::aid-spe125>3.0.co;2-7
Subject(s) - container (type theory) , multiset , computer science , flexibility (engineering) , queue , set (abstract data type) , stack (abstract data type) , priority queue , database , type (biology) , set operations , object (grammar) , theoretical computer science , programming language , engineering , mathematics , artificial intelligence , discrete mathematics , mechanical engineering , ecology , statistics , biology
Cdt is a container data type library that provides a uniform set of operations to manage dictionaries based on the common storage methods: list , stack , queue , ordered set/multiset , and unordered set/multiset . Both object description and storage method in a dictionary can be dynamically changed so that abstract operations can be exactly matched with run‐time requirements for operational flexibility and performance. A study comparing Cdt and other popular container packages shows that Cdt performs best in both computing time and space usage. © 1997 John Wiley & Sons, Ltd