# Category/Library/C++

**Broaden your selection:** Category/Library

## Category/Library

*C++* (48)

- Alpine3D
- Alpine3D is a spatially distributed (surface), three dimensional (atmospheric) model for analyzing and predicting dynamics of snow-dominated surface processes in mountainous topography. It includes models for snow cover (SNOWPACK), vegetation and soil, snow transport, radiation transfer and runoff which can be enabled or disabled on demand.

- AngelScript
**The**Featuring a syntax similar to C/C++, it has been designed from the beginning to be an easy to use component, both for the application programmer and the script writer.*AngelCode Scripting Library*, or AngelScript as it is also known, is an extremely flexible cross-platform scripting library designed to allow applications to extend their functionality through external scripts.

- BRL-CAD
- BRL-CAD includes an interactive geometry editor, parallel ray-tracing support for rendering and geometric analysis, path-tracing for realistic image synthesis, network distributed framebuffer support, image-processing and signal-processing tools.

- Boost
**Boost is a repository of portable and peer-reviewed C++ libraries.**- Accumulators
- Framework for incremental calculation, and collection of statistical accumulators. Math and numerics
- Algorithm
- A collection of useful generic algorithms. Algorithms
- Any
- Safe, generic container for single values of different value types. Data structures
- Array
- STL compliant container wrapper for arrays of constant size. Containers
- Asio
- Portable networking, including sockets, timers, hostname resolution and socket iostreams. Concurrent Programming
- Assign
- Filling containers with constant or generated data has never been easier. Input/Output
- Bimap
- Bidirectional maps library for C++. With Boost.Bimap you can create associative containers in which both types can be used as key. Containers
- Bind
- boost::bind is a generalization of the standard functions std::bind1st and std::bind2nd. It supports arbitrary function objects, functions, function pointers, and member function pointers, and is able to bind any argument to a specific value or route input arguments into arbitrary positions. Function objects and higher-order programming
- Call Traits
- Defines types for passing parameters. Generic Programming
- Chrono
- Useful time utilities. Domain Specific
- Circular Buffer
- A STL compliant container also known as ring or cyclic buffer. Containers
- Compatibility
- Help for non-conforming standard libraries. Broken compiler workarounds
- Compressed Pair
- Empty member optimization. Data structures
- Concept Check
- Tools for generic programming. Generic Programming
- Config
- Helps Boost library developers adapt to compiler idiosyncrasies; not intended for library users. Broken compiler workarounds
- Container
- Standard library containers and extensions. Containers
- Context
- Context switching library. Concurrent Programming
- Conversion
- Polymorphic and lexical casts. String and text processing
- CRC
- The Boost CRC Library provides two implementations of CRC (cyclic redundancy code) computation objects and two implementations of CRC computation functions. The implementations are template-based. Domain Specific
- Date Time
- A set of date-time libraries based on generic programming concepts. Domain Specific
- Dynamic Bitset
- The dynamic_bitset class represents a set of bits. It provides accesses to the value of individual bits via an operator[] and provides all of the bitwise operators that one can apply to builtin integers, such as operator& and operator<<. The number of bits in the set is specified at runtime via a parameter to the constructor of the dynamic_bitset. Containers
- Enable If
- Selective inclusion of function template overloads. Generic Programming
- Exception
- The Boost Exception library supports transporting of arbitrary data in exception objects, and transporting of exceptions between threads. Language Features Emulation
- Filesystem
- The Boost Filesystem Library provides portable facilities to query and manipulate paths, files, and directories. System
- Flyweight
- Design pattern to manage large quantities of highly redundant objects. Patterns and Idioms
- Foreach
- In C++, writing a loop that iterates over a sequence is tedious. We can either use iterators, which requires a considerable amount of boiler-plate, or we can use the std::for_each() algorithm and move our loop body into a predicate, which requires no less boiler-plate and forces us to move our logic far from where it will be used. In contrast, some other languages, like Perl, provide a dedicated "foreach" construct that automates this process. BOOST_FOREACH is just such a construct for C++. It iterates over sequences for us, freeing us from having to deal directly with iterators or write predicates. Algorithms
- Format
- The format library provides a class for formatting arguments according to a format-string, as does printf, but with two major differences: format sends the arguments to an internal stream, and so is entirely type-safe and naturally supports all user-defined types; the ellipsis (...) can not be used correctly in the strongly typed context of format, and thus the function call with arbitrary arguments is replaced by successive calls to an argument feeding operator%. String and text processing
- Function
- Function object wrappers for deferred calls or callbacks. Function objects and higher-order programming
- Function Types
- Boost.FunctionTypes provides functionality to classify, decompose and synthesize function, function pointer, function reference and pointer to member types. Generic Programming
- Functional
- The Boost.Function library contains a family of class templates that are function object wrappers. Function objects and higher-order programming
- Functional/Factory
- Function object templates for dynamic and static object creation Function objects and higher-order programming
- Functional/Forward
- Adapters to allow generic function objects to accept arbitrary arguments Function objects and higher-order programming
- Functional/Hash
- A TR1 hash function object that can be extended to hash user defined types. Function objects and higher-order programming
- Functional/Overloaded Function
- Overload different functions into a single function object. Function objects and higher-order programming
- Fusion
- Library for working with tuples, including various containers, algorithms, etc. Template Metaprogramming
- Geometry
- Geometry Library. Algorithms
- GIL
- Generic Image Library Containers
- Graph
- The BGL graph interface and graph components are generic, in the same sense as the the Standard Template Library (STL). Containers
- Heap
- Priority queue data structures. Data structures
- ICL
- Interval Container Library, interval sets and maps and aggregation of associated values Containers
- Identity Type
- Wrap types within round parenthesis so they can always be passed as macro parameters. Preprocessor Metaprogramming
- In Place Factory, Typed In Place Factory
- Generic in-place construction of contained objects with a variadic argument-list. Generic Programming
- Integer
- The organization of boost integer headers and classes is designed to take advantage of <stdint.h> types from the 1999 C standard without resorting to undefined behavior in terms of the 1998 C++ standard. The header <boost/cstdint.hpp> makes the standard integer types safely available in namespace boost without placing any names in namespace std. Math and numerics
- Interprocess
- Shared memory, memory mapped files, process-shared mutexes, condition variables, containers and allocators. Concurrent Programming
- Interval
- Extends the usual arithmetic functions to mathematical intervals. Math and numerics
- Intrusive
- Intrusive containers and algorithms. Containers
- IO State Savers
- The I/O sub-library of Boost helps segregate the large number of Boost headers. This sub-library should contain various items to use with/for the standard I/O library. Input/Output
- Iostreams
- Boost.IOStreams provides a framework for defining streams, stream buffers and i/o filters. String and text processing
- Iterators
- The Boost Iterator Library contains two parts. The first is a system of concepts which extend the C++ standard iterator requirements. The second is a framework of components for building iterators based on these extended concepts and includes several useful iterator adaptors. Iterators
- Lambda
- Define small unnamed function objects at the actual call site, and more. Function objects and higher-order programming
- Lexical Cast
- General literal text conversions, such as an int represented a string, or vice-versa, from Kevlin Henney. String and text processing
- Local Function
- Program functions locally, within other functions, directly within the scope where they are needed. Function objects and higher-order programming
- Locale
- Provide localization and Unicode handling tools for C++. String and text processing
- Math
- Boost.Math includes several contributions in the domain of mathematics: The Greatest Common Divisor and Least Common Multiple library provides run-time and compile-time evaluation of the greatest common divisor (GCD) or least common multiple (LCM) of two integers. The Special Functions library currently provides eight templated special functions, in namespace boost. The Complex Number Inverse Trigonometric Functions are the inverses of trigonometric functions currently present in the C++ standard. Quaternions are a relative of complex numbers often used to parameterise rotations in three dimentional space. Octonions, like quaternions, are a relative of complex numbers. Math and numerics
- Math Common Factor
- Greatest common divisor and least common multiple. Math and numerics
- Math Octonion
- Octonions. Math and numerics
- Math Quaternion
- Quaternions. Math and numerics
- Math/Special Functions
- A wide selection of mathematical special functions. Math and numerics
- Math/Statistical Distributions
- A wide selection of univariate statistical distributions and functions that operate on them. Math and numerics
- Member Function
- Generalized binders for function/object/pointers and member functions. Function objects and higher-order programming
- Meta State Machine
- A very high-performance library for expressive UML2 finite state machines. State Machines
- Min-Max
- Standard library extensions for simultaneous min/max and min/max element computations. Algorithms
- Move
- Portable move semantics for C++03 and C++11 compilers. Language Features Emulation
- MPI
- Message Passing Interface library, for use in distributed-memory parallel application programming. Concurrent Programming
- MPL
- The Boost.MPL library is a general-purpose, high-level C++ template metaprogramming framework of compile-time algorithms, sequences and metafunctions. It provides a conceptual foundation and an extensive set of powerful and coherent tools that make doing explict metaprogramming in C++ as easy and enjoyable as possible within the current language. Template Metaprogramming
- Multi-Array
- Boost.MultiArray provides a generic N-dimensional array concept definition and common implementations of that interface. Containers
- Multi-Index
- The Boost Multi-index Containers Library provides a class template named multi_index_container which enables the construction of containers maintaining one or more indices with different sorting and access semantics. Containers
- Numeric Conversion
- Optimized Policy-based Numeric Conversions. Math and numerics
- Operators
- Templates ease arithmetic classes and iterators. Iterators
- Optional
- Discriminated-union wrapper for optional values. Miscellaneous
- Parameter
- Boost.Parameter Library - Write functions that accept arguments by name. Programming Interfaces
- Phoenix
- Define small unnamed function objects at the actual call site, and more. Function objects and higher-order programming
- Pointer Container
- Containers for storing heap-allocated polymorphic objects to ease OO-programming. Containers
- Polygon
- Booleans/clipping, resizing/offsetting and more for planar polygons with integral coordinates. Miscellaneous
- Pool
- Memory pool management. Memory
- Preprocessor
- Preprocessor metaprogramming tools including repetition and recursion. Preprocessor Metaprogramming
- Program Options
- The program_options library allows program developers to obtain program options, that is (name, value) pairs from the user, via conventional methods such as command line and config file. Input/Output
- Property Map
- Concepts defining interfaces which map key objects to value objects. Containers
- Property Tree
- A tree data structure especially suited to storing configuration data. Containers
- Proto
- Expression template library and compiler construction toolkit for domain-specific embedded languages. Template Metaprogramming
- Python
- The Boost Python Library is a framework for interfacing Python and C++. It allows you to quickly and seamlessly expose C++ classes functions and objects to Python, and vice-versa, using no special tools -- just your C++ compiler. Inter-language support
- Random
- A complete system for random number generation. Math and numerics
- Range
- A new infrastructure for generic algorithms that builds on top of the new iterator concepts. Algorithms
- Ratio
- Compile time rational arithmetic. Math and numerics
- Rational
- A rational number class. Math and numerics
- Ref
- A utility library for passing references to generic functions. Function objects and higher-order programming
- Regex
- Regular expression library. String and text processing
- Result Of
- Determines the type of a function call expression. Function objects and higher-order programming
- Scope Exit
- Execute arbitrary code at scope exit. Language Features Emulation
- Serialization
- Serialization for persistence and marshalling. Input/Output
- Signals
- Managed signals & slots callback implementation. Function objects and higher-order programming
- Signals2
- Managed signals & slots callback implementation (thread-safe version 2). Function objects and higher-order programming
- Smart Ptr
- Smart pointer class templates. Memory
- Spirit
- LL parser framework represents parsers directly as EBNF grammars in inlined C++. String and text processing
- Statechart
- Boost.Statechart - Arbitrarily complex finite state machines can be implemented in easily readable and maintainable C++ code. State Machines
- Static Assert
- Static assertions (compile time assertions). Generic Programming
- String Algo
- String algorithms library. String and text processing
- Swap
- Enhanced generic swap function. Miscellaneous
- System
- Operating system support, including the diagnostics support that will be part of the C++0x standard library. System
- Test
- Support for simple program testing, full unit testing, and for program execution monitoring. Correctness and testing
- Thread
- Portable C++ multi-threading. Concurrent Programming
- Timer
- Event timer, progress timer, and progress display classes. Miscellaneous
- Tokenizer
- Break of a string or other character sequence into a series of tokens. String and text processing
- TR1
- The TR1 library provides an implementation of the C++ Technical Report on Standard Library Extensions. This library does not itself implement the TR1 components, rather it's a thin wrapper that will include your standard library's TR1 implementation (if it has one), otherwise it will include the Boost Library equivalents, and import them into namespace std::tr1. Miscellaneous
- Tribool
- 3-state boolean type library. Miscellaneous
- Tuple
- Ease definition of functions returning multiple values, and more. Data structures
- Type Traits
- Templates for fundamental properties of types. Generic Programming
- Typeof
- Typeof operator emulation. Language Features Emulation
- uBLAS
- uBLAS provides matrix and vector classes as well as basic linear algebra routines. Several dense, packed and sparse storage schemes are supported. Math and numerics
- Units
- Zero-overhead dimensional analysis and unit/quantity manipulation and conversion. Domain Specific
- Unordered
- Unordered associative containers. Containers
- Utility
- Class noncopyable plus checked_delete(), checked_array_delete(), next(), prior() function templates, plus base-from-member idiom. Algorithms
- Uuid
- A universally unique identifier. Data structures
- Value Initialized
- Wrapper for uniform-syntax value initialization, based on the original idea of David Abrahams. Miscellaneous
- Variant
- Safe, generic, stack-based discriminated union container. Containers
- Wave
- The Boost.Wave library is a Standards conformant, and highly configurable implementation of the mandated C99/C++ preprocessor functionality packed behind an easy to use iterator interface. String and text processing
- Xpressive
- Regular expressions that can be written as strings or as expression templates, and which can refer to each other and themselves recursively with the power of context-free grammars. String and text processing

- Carom
- Super fun carom board game.

- Coolkey
- Linux Driver support for the CoolKey and Common Access Card (CAC) smart card security keys used in a Public Key Infrastructure (PKI). The libpkcs11 module allows use of Smart Cards in applications that use mozilla Network Security Services (NSS).

- DUNE-Common
- DUNE, the Distributed and Unified Numerics Environment is a modular toolbox for solving partial differential equations (PDEs) with grid-based methods. It supports the easy implementation of methods like Finite Elements (FE), Finite Volumes (FV), and also Finite Differences (FD). DUNE is free software licensed under the GPL (version 2) with a so called "runtime exception" (see license). This licence is similar to the one under which the libstdc++ libraries are distributed. Thus it is possible to use DUNE even in proprietary software. The underlying idea of DUNE is to create slim interfaces allowing an efficient use of legacy and/or new libraries. Modern C++ programming techniques enable very different implementations of the same concept (i.e. grids, solvers, ...) using a common interface at a very low overhead. Thus DUNE ensures efficiency in scientific computations and supports high-performance computing applications. DUNE is based on the following main principles:
- Separation of data structures and algorithms by abstract interfaces.- This provides more functionality with less code and also ensures maintainability and extendability of the framework.
- Efficient implementation of these interfaces using generic programming techniques.
- Static polymorphism allows the compiler to do more optimizations, in particular function inlining, which in turn allows the interface to have very small functions (implemented by one or few machine instructions) without a severe performance penalty. In essence the algorithms are parametrized with a particular data structure and the interface is removed at compile time. Thus the resulting code is as efficient as if it would have been written for the special case.
- Reuse of existing finite element packages with a large body of functionality.- In particular the finite element codes UG, ALBERTA, and ALUGrid have been adapted to the DUNE framework. Thus, parallel and adaptive meshes with multiple element types and refinement rules are available. All these packages can be linked together in one executable.
- The framework consists of a number of modules which are downloadable as separate packages. The current core modules are:
- dune-common- contains the basic classes used by all DUNE-modules. It provides some infrastructural classes for debugging and exception handling as well as a library to handle dense matrices and vectors.
- dune-grid- is the most mature module. It defines nonconforming, hierarchically nested, multi-element-type, parallel grids in arbitrary space dimensions. Graphical output with several packages is available, e.g. file output to IBM data explorer and VTK (parallel XML format for unstructured grids). The graphics package Grape has been integrated in interactive mode.
- dune-istl (Iterative Solver Template Library)- provides generic sparse matrix/vector classes and a variety of solvers based on these classes. A special feature is the use of templates to exploit the recursive block structure of finite element matrices at compile time. Available solvers include Krylov methods, (block-) incomplete decompositions and aggregation-based algebraic multigrid.

- DUNE-Grid
- DUNE, the Distributed and Unified Numerics Environment is a modular toolbox for solving partial differential equations (PDEs) with grid-based methods. It supports the easy implementation of methods like Finite Elements (FE), Finite Volumes (FV), and also Finite Differences (FD). DUNE is free software licensed under the GPL (version 2) with a so called "runtime exception" (see license). This licence is similar to the one under which the libstdc++ libraries are distributed. Thus it is possible to use DUNE even in proprietary software. The underlying idea of DUNE is to create slim interfaces allowing an efficient use of legacy and/or new libraries. Modern C++ programming techniques enable very different implementations of the same concept (i.e. grids, solvers, ...) using a common interface at a very low overhead. Thus DUNE ensures efficiency in scientific computations and supports high-performance computing applications. DUNE is based on the following main principles:
- Separation of data structures and algorithms by abstract interfaces.- This provides more functionality with less code and also ensures maintainability and extendability of the framework.
- Efficient implementation of these interfaces using generic programming techniques.
- Static polymorphism allows the compiler to do more optimizations, in particular function inlining, which in turn allows the interface to have very small functions (implemented by one or few machine instructions) without a severe performance penalty. In essence the algorithms are parametrized with a particular data structure and the interface is removed at compile time. Thus the resulting code is as efficient as if it would have been written for the special case.
- Reuse of existing finite element packages with a large body of functionality.- In particular the finite element codes UG, ALBERTA, and ALUGrid have been adapted to the DUNE framework. Thus, parallel and adaptive meshes with multiple element types and refinement rules are available. All these packages can be linked together in one executable.
- The framework consists of a number of modules which are downloadable as separate packages. The current core modules are:
- dune-common- contains the basic classes used by all DUNE-modules. It provides some infrastructural classes for debugging and exception handling as well as a library to handle dense matrices and vectors.
- dune-grid- is the most mature module. It defines nonconforming, hierarchically nested, multi-element-type, parallel grids in arbitrary space dimensions. Graphical output with several packages is available, e.g. file output to IBM data explorer and VTK (parallel XML format for unstructured grids). The graphics package Grape has been integrated in interactive mode.
- dune-istl (Iterative Solver Template Library)- provides generic sparse matrix/vector classes and a variety of solvers based on these classes. A special feature is the use of templates to exploit the recursive block structure of finite element matrices at compile time. Available solvers include Krylov methods, (block-) incomplete decompositions and aggregation-based algebraic multigrid.

- DUNE-ISTL
- DUNE, the Distributed and Unified Numerics Environment is a modular toolbox for solving partial differential equations (PDEs) with grid-based methods. It supports the easy implementation of methods like Finite Elements (FE), Finite Volumes (FV), and also Finite Differences (FD). DUNE is free software licensed under the GPL (version 2) with a so called "runtime exception" (see license). This licence is similar to the one under which the libstdc++ libraries are distributed. Thus it is possible to use DUNE even in proprietary software. The underlying idea of DUNE is to create slim interfaces allowing an efficient use of legacy and/or new libraries. Modern C++ programming techniques enable very different implementations of the same concept (i.e. grids, solvers, ...) using a common interface at a very low overhead. Thus DUNE ensures efficiency in scientific computations and supports high-performance computing applications. DUNE is based on the following main principles:
- Separation of data structures and algorithms by abstract interfaces.- This provides more functionality with less code and also ensures maintainability and extendability of the framework.
- Efficient implementation of these interfaces using generic programming techniques.
- Static polymorphism allows the compiler to do more optimizations, in particular function inlining, which in turn allows the interface to have very small functions (implemented by one or few machine instructions) without a severe performance penalty. In essence the algorithms are parametrized with a particular data structure and the interface is removed at compile time. Thus the resulting code is as efficient as if it would have been written for the special case.
- Reuse of existing finite element packages with a large body of functionality.- In particular the finite element codes UG, ALBERTA, and ALUGrid have been adapted to the DUNE framework. Thus, parallel and adaptive meshes with multiple element types and refinement rules are available. All these packages can be linked together in one executable.
- The framework consists of a number of modules which are downloadable as separate packages. The current core modules are:
- dune-common- contains the basic classes used by all DUNE-modules. It provides some infrastructural classes for debugging and exception handling as well as a library to handle dense matrices and vectors.
- dune-grid- is the most mature module. It defines nonconforming, hierarchically nested, multi-element-type, parallel grids in arbitrary space dimensions. Graphical output with several packages is available, e.g. file output to IBM data explorer and VTK (parallel XML format for unstructured grids). The graphics package Grape has been integrated in interactive mode.
- dune-istl (Iterative Solver Template Library)- provides generic sparse matrix/vector classes and a variety of solvers based on these classes. A special feature is the use of templates to exploit the recursive block structure of finite element matrices at compile time. Available solvers include Krylov methods, (block-) incomplete decompositions and aggregation-based algebraic multigrid.

- Degate
- Degate is a tool that aids VLSI- reverse engineering of digital logic in integrated circuits (ICs). Degate helps you to explore layered images from ICs. It matches standard cells on the imagery given by graphical templates and to some degree degate matches vias and wires and assists you in tracing circuit paths and in reconstructing the net list. Degate is not a completely automatic analyzing tool. Degate helps you with some automation in your manual chip reverse engineering process.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.

The copyright and license notices on this page only apply to the text on this page. Any software or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.