Alexander A. Stepanov, Meng Lee · 1998
this document for any purpose is hereby granted without fee, provided that the above copyright notice appear in all copies and that both that copyright notice and this permission notice appear in supporting documentation. 1 1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2 Structure of the library . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 3 Requirements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 4 Core components . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
Cited by 408
Ivor Horton · 2010
Cited by 3
Ulrich Breymann · 2020
No AccessC++ programmierenOct 2020Die Standard Template Library (STL)Ulrich BreymannUlrich Breymannhttps://doi.org/10.3139/9783446465510.010SectionsAboutPDF ToolsAdd to FavoritesDownload CitationTrack CitationsCopy LTI LinkPDF key 'share (en)' returned an object instead of string.FacebookTwitterEmailLinkedIn previous chapternext chapter FiguresReferencesRelatedDetails 2020Pages: 447-462Print ISBN: 978-3-446-46386-8eISBN: 978-3-446-46551-0 Copyright & Permissions© 2020 Carl Hanser Verlag GmbH & Co. KGPDF downloadLoading ...
Cited by 0
Dietmar Herrmann · 2001
Die Wiederverwendbarkeit von Code durch Anwendung von Templates, d. h. von datentypunabhängigen Funktionen und Klassen, ist ein grundlegendes Ziel der OOP. Durch die Aufnahme von standardisierten Templates in die ANSI C++-Norm wird dem Programmierer eine erprobte, flexible, allgemein gültige Implementierung von Algorithmen und Datenstrukturen an die Hand gegeben. Nach der Verabschiedung des Final Draft im November 1997 ist nun keine Änderung mehr zu erwarten, obwohl viele Entwickler bis zuletzt noch auf die Einbeziehung einer Template-Klasse zur Hashsuche gehofft haben.
Cited by 0
Ivor Horton · Apress eBooks · 2004
As you already know, C++ provides an extensive standard library that simplifies many programming tasks. In addition to what you have seen up to now, this library also provides a range of templates that provide a much higher level of capability. You can use these templates to create standard containers, algorithms, and functions for your data types whenever you need such facilities in your programs. Collectively these templates are often referred to as the Standard Template Library (STL). This chapter introduces the basic STL containers and the algorithms that work alongside these containers.KeywordsVector ObjectSubscript OperatorTemplate ParameterDouble AverageStandard Template LibraryThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Cited by 0
Norbert Pataki · arXiv (Cornell University) · 2011
The C++ Standard Template Library is the flagship example for libraries based on the generic programming paradigm. The usage of this library is intended to minimize the number of classical C/C++ errors, but does not warrant bug-free programs. Furthermore, many new kinds of errors may arise from the inaccurate use of the generic programming paradigm, like dereferencing invalid iterators or misunderstanding remove-like algorithms. In this paper we present some typical scenarios that may cause runtime or portability problems. We emit warnings and errors while these risky constructs are used. We also present a general approach to emit "customized" warnings. We support the so-called "believe-me marks" to disable warnings. We present another typical usage of our technique, when classes become deprecated during the software lifecycle.
Cited by 4Open access
Rajanikanth Jammalamadaka · 2016
Cited by 0
Schupp, S. (Tuebingen Univ. (Germany). Fakultaet fuer Informatik), Tuebingen Univ. (Germany). Wilhelm-Schickard-Inst. fuer Informatik · OpenGrey (Institut de l'Information Scientifique et Technique) · 1996
Available from TIB Hannover: RR 4367(96-18) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informationsbibliothek
Cited by 0
Pataki, Norbert, Szűgyi, Zalán, Török, Márk et al. · ELTE Digital Institutional Repository (EDIT) (Eötvös Loránd University) · 2011
Cited by 0Open access
Pataki, Norbert · ELTE Digital Institutional Repository (EDIT) (Eötvös Loránd University) · 2010
Cited by 1Open access
2023
No AccessC++ programmierenAug 202310 Die Standard Template Library (STL)https://doi.org/10.3139/9783446478466.010SectionsAboutPDF ToolsAdd to FavoritesDownload CitationTrack CitationsCopy LTI LinkPDF key 'share (en)' returned an object instead of string.FacebookTwitterEmailLinkedIn previous chapternext chapter FiguresReferencesRelatedDetails 2023Pages: 457-472Print ISBN: 978-3-446-47689-9eISBN: 978-3-446-47846-6 PDF downloadLoading ...
Cited by 0
Ulrich Breymann · Der C++-Programmierer · 2014
No AccessDer C++-ProgrammiererJan 2014Einführung in die Standard Template Library (STL)Ulrich BreymannUlrich Breymannhttps://doi.org/10.3139/9783446439535.011SectionsAboutPDF ToolsAdd to FavoritesDownload CitationTrack CitationsCopy LTI LinkPDF key 'share (en)' returned an object instead of string.FacebookTwitterEmailLinkedIn previous chapternext chapter FiguresReferencesRelatedDetails 2014Pages: 403-414Print ISBN: 978-3-446-43894-1eISBN: 978-3-446-43953-5 Copyright & Permissions© 2014 Carl Hanser Verlag GmbH & Co. KGPDF DownloadLoading ...
Cited by 0
Szűgyi, Zalán, Török, Márk, Pataki, Norbert · ELTE Digital Institutional Repository (EDIT) (Eötvös Loránd University) · 2011
Cited by 1Open access
Nancy M. Amato, Lawrence Rauchwerger · 2008
Cited by 0
Mallach, Sven · Computer Science Publication Server (University of Cologne) · 2008
A diploma thesis presenting a hardware-oriented parallelization of the C++ Standard Template Library. Strategies like thread pooling and thread affinity are used to enable speedups already for small input sizes and to best exploit the underlying hardware. Comparisons with existing approaches are used for evaluations.
Cited by 0Open access
Objectivity, INC. · CERN Document Server (European Organization for Nuclear Research) · 1996
Cited by 0
State and University Library Dresden (Saxon State Library) · 2003
- Einführung in die Arbeit mit Templates - Vorstellung der in der STL enthaltenen Templates - Beispiele für deren Nutzung
Cited by 0Open access
Roman Dementiev Lutz Kettner · 2005
Cited by 0
Ping An, Alin Jula, Silvius Rus et al. · 2001
is a parallel library designed as a superset of the ANSI C++ Standard Template Library (STL). It is sequentially consistent for functions with the same name, and executes on uni- or multi-processor systems that utilize shared or distributed memory. STAPL is implemented using simple parallel extensions of C++ that currently provide a SPMD model of parallelism, and supports nested parallelism. The library is intended to be general purpose, but emphasizes irregular programs to allow the exploitation of parallelism in areas such as particle transport calculations, molecular dynamics, geometric modeling, and graph algorithms, which use dynamically linked data structures. STAPL provides several different algorithms for some library routines, and selects among them adaptively at run-time. STAPL can replace STL automatically by invoking a preprocessing translation phase. The performance of translated code is close to the results obtained using STAPL directly (less than 5 % performance deterioration). However, STAPL also provides functionality to allow the user to further optimize the code and achieve additional performance gains. We present results obtained using STAPL for a molecular dynamics code and a particle transport code. I.
Cited by 0
Norbert Pataki · ELTE Digital Institutional Repository (EDIT) (Eötvös Loránd University) · 2011
The C++ Standard Template Library (STL) is the most pop- ular library based on the generic programming paradigm. STL is widely- used, because it consists of many useful generic data structures and generic algorithms that are fairly irrespective of the used container. Iterators bridge the gap between containers and algorithms. As a result of this lay- out the complexity of the library is reduced and we can extend the library with new containers and algorithms simultaneously. Function objects (also known as functors) make the library much more exible without signicant runtime overhead. They parametrize user-
Cited by 9Open access