STL

swMATH11800MaRDI QIDQ23738FDOQ23738

Author name not available (Why is that?)

Described by source

• Compile-time advances of the C++ standard template library
• C++ standard template library by infinite iterators

Cited In (70)

• Construction of robust class hierarchies
• An object‐oriented interface for the dynamic memory management of sparse discrete mathematical operators in numerical scientific applications
• A mostly-copying collector component for class templates
• Title not available (Why is that?)
• Why code complexity metrics fail on the C++ standard template library
• Die C++-Standardbibliothek
• General template units for the finite volume method in box-shaped domains
• Evaluation of predicates in the C++ standard template library
• A Simulation Methodology to Study Input Buffering in ATM Switches
• Title not available (Why is that?)
• Adaptive, limited-memory BFGS algorithms for unconstrained optimization
• A language for generic programming in the large
• Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
• Generic programming with C++ concepts and Haskell type classes—a comparison
• C++ lambda expressions and closures
• Title not available (Why is that?)
• Alternative generic libraries
• Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL
• Sorting and searching in the presence of memory faults (without redundancy)
• Title not available (Why is that?)
• Cadabra: a field-theory motivated symbolic computer algebra system
• A mesh adaptation framework for dealing with large deforming meshes
• Title not available (Why is that?)
• A constraint programming approach to extract the maximum number of non-overlapping test forms
• Productivity, performance, and portability for computational fluid dynamics applications
• Semantics of templates in a compositional framework for building logics
• Title not available (Why is that?)
• Design and evaluation of C++ open multi-methods
• Programming with C++ concepts
• Simple and safe SQL queries with \texttt{C++} templates
• FC++: Functional tools for object-oriented tasks
• On the design of CGAL a computational geometry algorithms library
• The Lambda Library: unnamed functions in C++
• Expression templates for primal value taping in the reverse mode of algorithmic differentiation
• An efficient way to assemble finite element matrices in vector languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• An algorithm oriented mesh database
• Dynamic algorithm selection for runtime concepts
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Managing application complexity in the SAMRAI object‐oriented framework
• Computing the Voronoi cells of planes, spheres and cylinders in \(\mathbb{R}^3\)
• Adaptive set-oriented computation of topological horseshoe factors in area and volume preserving maps
• A generic topology library
• NB{\texttt{malloc}}: Allocating memory in a lock-free manner
• Title not available (Why is that?)
• VORPAL: a versatile plasma simulation code
• Reasoning about memory layouts
• A generic grid interface for parallel and adaptive scientific computing. II: Implementation and tests in DUNE
• Solving projective complete intersection faster
• Localized homology
• Title not available (Why is that?)
• Title not available (Why is that?)
• OOMPAA -- Object-oriented model for probing assemblages of atoms
• Statistical computing in C++ and R.
• An exact, complete and efficient implementation for computing planar maps of quadric intersection curves: exploiting a little more geometry and a little less algebra
• Dense and sparse matrix classes using the \(C++\) Standard Template Library
• Sorting and searching in faulty memories
• GUIDE: parallel library-centric application design by a generic scientific simulation environment
• External-memory multimaps
• Igatools: an isogeometric analysis library
• Title not available (Why is that?)
• An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
• Title not available (Why is that?)
• The mathematical-function computation handbook. Programming using the MathCW portable software library
• Advanced programming techniques applied to CGAL's arrangement package
• Branch-and-price for staff rostering: an efficient implementation using generic programming and nested column generation
• Introducing the open-source \texttt{mfront} code generator: application to mechanical behaviours and material knowledge management within the PLEIADES fuel element modelling platform

This page was built for software: STL