Compile-time advances of the C++ standard template library. 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 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. Every standard container offers a template parameter in order to customize the memory management. Allocator types are accountable for allocation and deallocation of memory.par In this paper, we present some scenarios that may cause undefined or weird behaviour at runtime. These scenarios are related to allocators and reverse iterators. We emit warnings while these constructs are used without any modification in the compiler. We also present a general approach to emit “customized” warnings. We support the so-called believe-me marks in order to disable our specific warnings.

References in zbMATH (referenced in 79 articles , 2 standard articles )

Showing results 41 to 60 of 79.
Sorted by year (citations)
  1. Zomorodian, Afra; Carlsson, Gunnar: Localized homology (2008)
  2. Archip, Alexandru; Amarandei, Cristian Mihai; Aruştei, Simona; Craus, Mitică: Optimizing association rule mining algorithms using C++ standard template library (2007)
  3. Bandyopadhyay, Deepak; Snoeyink, Jack: Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL (2007)
  4. Peeters, Kasper: Cadabra: a field-theory motivated symbolic computer algebra system (2007)
  5. Wein, Ron; Fogel, Efi; Zukerman, Baruch; Halperin, Dan: Advanced programming techniques applied to CGAL’s arrangement package (2007)
  6. Belov, Dmitry I.; Armstrong, Ronald D.: A constraint programming approach to extract the maximum number of non-overlapping test forms (2006)
  7. Berberich, Eric; Hemmer, Michael; Kettner, Lutz; Schömer, Elmar; Wolpert, Nicola: An exact, complete and efficient implementation for computing planar maps of quadric intersection curves: exploiting a little more geometry and a little less algebra (2005)
  8. Bischof, Holger: Systematic development of parallel programs using skeletons (2005)
  9. Gregor, Douglas; Järvi, Jaakko; Kulkarni, Mayuresh; Lumsdaine, Andrew; Musser, David; Schupp, Sibylle: Generic programming and high-performance libraries (2005) ioport
  10. Kuhlins, Stefan; Schader, Martin: The C++ standard library. Introduction and reference book. (2005)
  11. Finocchi, Irene; Italiano, Giuseppe F.: Sorting and searching in the presence of memory faults (without redundancy) (2004)
  12. Nieter, Chet; Cary, John R.: VORPAL: a versatile plasma simulation code (2004)
  13. An, Ping; Jula, Alin; Rus, Silvius; Saunders, Steven; Smith, Tim; Tanase, Gabriel; Thomas, Nathan; Amato, Nancy; Rauchwerger, Lawrence: STAPL: An adaptive, generic parallel C++ library (2003)
  14. Gregor, Douglas; Schupp, Sibylle: Making the usage of STL safe (2003)
  15. Heaney, Matthew: Charles: A data structure library for Ada95 (2003)
  16. Järvi, Jaakko; Powell, Gary; Lumsdaine, Andrew: The Lambda Library: Unnamed functions in C++ (2003)
  17. Klostermeyer, William; Musser, David; Sánchez-Ruíz, A. J.: Complete traversals as general iteration patterns (2003)
  18. Remacle, Jean-François; Shephard, Mark S.: An algorithm oriented mesh database (2003)
  19. Hornung, Richard D.; Kohn, Scott R.: Managing application complexity in the SAMRAI object-oriented framework (2002)
  20. Manzini, G.; Mazet, S.: An object-oriented interface for the dynamic memory management of sparse discrete mathematical operators in numerical scientific applications (2002)