STL

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

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

1 2 3 4 next

  1. Beebe, Nelson H. F.: The mathematical-function computation handbook. Programming using the MathCW portable software library (2017)
  2. Cuvelier, François; Japhet, Caroline; Scarella, Gilles: An efficient way to assemble finite element matrices in vector languages (2016)
  3. De La Cruz, Luis M.; Ramos, Eduardo: General template units for the finite volume method in box-shaped domains (2016)
  4. Dasseville, Ingmar; Van der Hallen, Matthias; Janssens, Gerda; Denecker, Marc: Semantics of templates in a compositional framework for building logics (2015)
  5. Horváth, Gábor; Pataki, Norbert: Clang matchers for verified usage of the C++ Standard Template Library (2015) ioport
  6. Pauletti, M. Sebastian; Martinelli, Massimiliano; Cavallini, Nicola; Antolin, Pablo: Igatools: an isogeometric analysis library (2015)
  7. 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)
  8. Angelino, Elaine; Goodrich, Michael T.; Mitzenmacher, Michael; Thaler, Justin: External-memory multimaps (2013)
  9. Dohn, Anders; Mason, Andrew: Branch-and-price for staff rostering: an efficient implementation using generic programming and nested column generation (2013)
  10. Pataki, Norbert: C++ standard template library by ranges (2012) ioport
  11. Pataki, Norbert: Compile-time advances of the C++ standard template library (2012)
  12. Tabatabaei, Seyed Salim; Coates, Mark; Rabbat, Michael: GANC: greedy agglomerative normalized cut for graph clustering (2012) ioport
  13. Bourdev, Lubomir; Järvi, Jaakko: Efficient run-time dispatching in generic programming with minimal code bloat (2011) ioport
  14. Heinzl, René; Schwaha, Philipp: A generic topology library (2011)
  15. Kozsik, Tamás; Pataki, Norbert; Szűgyi, Zalán: C++ standard template library by infinite iterators (2011)
  16. Pataki, Norbert: C++ Standard Template Library by safe functors (2011) ioport
  17. Siek, Jeremy G.; Lumsdaine, Andrew: A language for generic programming in the large (2011)
  18. Bernardy, Jean-Philippe; Jansson, Patrik; Zalewski, Marcin; Schupp, Sibylle: Generic programming with C++ concepts and Haskell type classes-a comparison (2010)
  19. Bucksch, Alexander; Lindenbergh, Roderik; Menenti, Massimo: SkelTre. Robust skeleton extraction from imperfect point clouds (2010) ioport
  20. Compère, Gaëtan; Remacle, Jean-François; Jansson, Johan; Hoffman, Johan: A mesh adaptation framework for dealing with large deforming meshes (2010)

1 2 3 4 next