Project proposal: Associative containers with strong guarantees. CPH STL Report 2007-4

Research output: Working paperResearch

Standard

Project proposal: : Associative containers with strong guarantees. CPH STL Report 2007-4. / Katajainen, Jyrki.

2007.

Research output: Working paperResearch

Harvard

Katajainen, J 2007 'Project proposal:: Associative containers with strong guarantees. CPH STL Report 2007-4'. <http://cphstl.dk/Report/Associative-containers/mini-project.pdf>

APA

Katajainen, J. (2007). Project proposal:: Associative containers with strong guarantees. CPH STL Report 2007-4. http://cphstl.dk/Report/Associative-containers/mini-project.pdf

Vancouver

Katajainen J. Project proposal:: Associative containers with strong guarantees. CPH STL Report 2007-4. 2007.

Author

Katajainen, Jyrki. / Project proposal: : Associative containers with strong guarantees. CPH STL Report 2007-4. 2007.

Bibtex

@techreport{a5794ca0c30011debda0000ea68e967b,
title = "Project proposal:: Associative containers with strong guarantees. CPH STL Report 2007-4",
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.",
author = "Jyrki Katajainen",
year = "2007",
language = "English",
type = "WorkingPaper",

}

RIS

TY - UNPB

T1 - Project proposal:

T2 - Associative containers with strong guarantees. CPH STL Report 2007-4

AU - Katajainen, Jyrki

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

M3 - Working paper

BT - Project proposal:

ER -

ID: 15402120