Namespaces
Variants
Views
Actions

Library Concepts

From cppreference.com
< cpp
 
 
 

Concept is a term that describes a named set of requirements for a type.

Formal specification of concepts (ISO/IEC TS 19217:2015) is an experimental technical specification, which makes it possible to verify that template arguments satisfy the expectations of a template or function during overload resolution and template specialization.

The library concepts listed on this page are the named requirements used in the normative text of the C++ standard to define the expectations of the standard library. It is expected that a future version of the C++ standard library will formalize these library concepts using the facilities of the above-mentioned technical specification. Until then, the burden is on the programmer to ensure that library templates are instantiated with template arguments that satisfy these concepts. Failure to do so may result in very complex compiler diagnostics.

Contents

Basic

specifies that an object of the type can be default constructed
(concept)
specifies that an object of the type can be constructed from rvalue
(concept)
specifies that an object of the type can be constructed from lvalue
(concept)
specifies that an object of the type can be assigned from rvalue
(concept)
specifies that an object of the type can be assigned from lvalue
(concept)
specifies that type has a destructor
(concept)

Layout

Note, that the standard doesn't define named requirements or concepts with names specified in this subcategory.
These are type categories defined by the core language. They are included here as concepts only for consistency.
class with trivial copy, assignment and destructor
(concept)
class with trivial constructors, assignment and destructor
(concept)
non-virtual class containing only other StandardLayout members, all with the same access control
(concept)
POD (Plain Old Data) structure, compatible with C struct
(concept)

Library-wide

has a working operator== that is an equivalence relation
(concept)
operator< is a strict weak ordering relation
(concept)
(C++11)
can be swapped with an unqualified non-member function call swap()
(concept)
an Iterator that dereferences to a Swappable type
(concept)
pointer-like type supporting a null value
(concept)
(C++11)
a FunctionObject that for inputs with different values has a low probability of giving the same output
(concept)
class type that contains allocation information
(concept)
an object that can be called with the function call syntax
(concept)
a type for which the invoke operation is defined
(concept)
a FunctionObject that returns a value convertible to bool for one argument without modifying it
(concept)
a FunctionObject that returns a value convertible to bool for two arguments without modifying them
(concept)
a BinaryPredicate that establishes an ordering relation
(concept)

Container

data structure that allows element access using iterators
(concept)
container using bidirectional iterators
(concept)
container using an allocator
(concept)
container with elements stored linearly
(concept)
container with elements stored at adjacent memory addresses
(concept)
container that stores elements by associating them to keys
(concept)
container that stores elements stored in buckets by associating them to keys
(concept)
Container element
element can be default-constructed in uninitialized storage
(concept)
element can be copy-constructed in uninitialized storage
(concept)
element can be move-constructed in uninitialized storage
(concept)
element can be constructed in uninitialized storage
(concept)
(C++11)
element can be destroyed using an allocator
(concept)

Iterator

general concept to access data within some data structure
(concept)
iterator that can be used to read data
(concept)
iterator that can be used to write data
(concept)
iterator that can be used to read data multiple times
(concept)
iterator that can be both incremented and decremented
(concept)
iterator that can be advanced in constant time
(concept)
iterator to contiguously-allocated elements
(concept)

Stream I/O functions

a stream input function that doesn't skip whitespace and counts the processed characters
(concept)
a stream input function that skips leading whitespace
(concept)
a basic stream output function
(concept)
a stream output function that sets failbit on errors and returns a reference to the stream
(concept)

Random Number Generation

consumes a sequence of integers and produces a sequence of 32-bit unsigned values
(concept)
returns uniformly distributed random unsigned integers
(concept)
a deterministic UniformRandomNumberGenerator, defined by the seed
(concept)
a RandomNumberEngine that transforms the output of another RandomNumberEngine
(concept)
returns random numbers distributed according to a given mathematical probability density function
(concept)

Concurrency

provides exclusive ownership semantics for execution agents (i.e. threads)
(concept)
(C++11)
adds attempted lock acquisition to BasicLockable
(concept)
adds timed lock acquisition to Lockable
(concept)
(C++11)
a Lockable that protects against data races and sequentially consistent synchronization
(concept)
a TimedLockable that protects against data races and sequentially consistent synchronization
(concept)
a Mutex that supports shared ownership mode
(concept)
a TimedMutex that supports shared ownership mode
(concept)

Other

describes a property of a type
(concept)
describes a relationship between two types
(concept)
modifies a property of a type
(concept)
(C++11)
aggregates a duration, a time point, and a function to get the current time point
(concept)
a Clock that doesn't throw exceptions
(concept)
defines types and functions for a character type
(concept)
represents a position in a stream
(concept)
represents an offset in a stream
(concept)
bitset, integer, or enumeration
(concept)
a type for which initialization is effectively equal to assignment
(concept)
defines types and functions used by the regular expressions library
(concept)
a type with constexpr constructor
(concept)