Project proposal: Associative containers with strong guarantees
Author:Jyrki Katajainen
Publication:CPH STL Report 2007-4, Department of Computer Science, University of Copenhagen (2007), 39 pp.
Full text:<pdf.gif>PDF (240 kB)  <ps.gif>PS (614 kB)  
Abstract:

The Standard Template Library (STL) is a collection of generic algorithms and data structures that is part of the standard run-time environment of the C++ programming language. The STL provides four kinds of associative element containers: set, multiset, map, and multimap. In this project the goal is to develop an associative container that is safer, more reliable, more usable, and/or more efficient (with respect to time and space) than any of the existing realizations.

Related:<html.gif>HTML (Compressed tar ball)  
BibLATEX:
@report{Kat2007cR,
  author = {Jyrki Katajainen},
  title = {Project proposal: {A}ssociative containers with strong guarantees},
  type = {CPH STL Report},
  number = {2007-4},
  institution = {Department of Computer Science, University of Copenhagen},
  year = {2007},
  pagetotal = {39},
}
This page was generated by Jyrki Katajainen <jyrki@di.ku.dk> on 31.12.2011.