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 53 articles , 2 standard articles )

Showing results 1 to 20 of 53.
Sorted by year (citations)

1 2 3 next

  1. Horváth, Gábor; Pataki, Norbert: Clang matchers for verified usage of the C++ Standard Template Library (2015)
  2. Pauletti, M.Sebastian; Martinelli, Massimiliano; Cavallini, Nicola; Antolin, Pablo: Igatools: an isogeometric analysis library (2015)
  3. Silva, Ricardo M.A.; Silva, Diego M.; Resende, Mauricio G.C.; Mateus, Geraldo R.; Gonçalves, José F.; Festa, Paola: An edge-swap heuristic for generating spanning trees with minimum number of branch vertices (2014)
  4. Angelino, Elaine; Goodrich, Michael T.; Mitzenmacher, Michael; Thaler, Justin: External-memory multimaps (2013)
  5. Dohn, Anders; Mason, Andrew: Branch-and-price for staff rostering: an efficient implementation using generic programming and nested column generation (2013)
  6. Pataki, Norbert: Compile-time advances of the C++ standard template library (2012)
  7. Tabatabaei, Seyed Salim; Coates, Mark; Rabbat, Michael: GANC: greedy agglomerative normalized cut for graph clustering (2012)
  8. Bourdev, Lubomir; Järvi, Jaakko: Efficient run-time dispatching in generic programming with minimal code bloat (2011)
  9. Heinzl, René; Schwaha, Philipp: A generic topology library (2011)
  10. Kozsik, Tamás; Pataki, Norbert; Szűgyi, Zalán: C++ standard template library by infinite iterators (2011)
  11. Siek, Jeremy G.; Lumsdaine, Andrew: A language for generic programming in the large (2011)
  12. Bucksch, Alexander; Lindenbergh, Roderik; Menenti, Massimo: SkelTre. Robust skeleton extraction from imperfect point clouds (2010)
  13. Gast, Holger: Reasoning about memory layouts (2010)
  14. Gidenstam, Anders; Papatriantafilou, Marina; Tsigas, Philippas: NB malloc: Allocating memory in a lock-free manner (2010)
  15. Gil, Joseph (Yossi); Lenz, Keren: Simple and safe SQL queries with C++ templates (2010)
  16. Järvi, Jaakko; Freeman, John: C++ lambda expressions and closures (2010)
  17. Järvi, Jaakko; Marcus, Mat; Smith, Jacob N.: Programming with C++ concepts (2010)
  18. Mireles James, J.D.: Adaptive set-oriented computation of topological horseshoe factors in area and volume preserving maps (2010)
  19. Pirkelbauer, Peter; Parent, Sean; Marcus, Mat; Stroustrup, Bjarne: Dynamic algorithm selection for runtime concepts (2010)
  20. Pirkelbauer, Peter; Solodkyy, Yuriy; Stroustrup, Bjarne: Design and evaluation of C++ open multi-methods (2010)

1 2 3 next