Implementation details for basic_syncbuf and related stream types.
Types
Name |
Description |
Provide a namespace for implementing helper routines for algorithm implementations. |
|
Exception type thrown when a |
|
Adaptor that produces a standard bidirectional iterator from a core type. |
|
This class provides methods for creating and destroying nodes using the appropriate allocator‐traits of the (template parameter) type |
|
STL‐compliant searcher using the Boyer‐Moore‐Horspool algorithm. |
|
Char‐optimized Boyer‐Moore‐Horspool searcher implementation. |
|
This class template implements the same interfaces as the |
|
Metafunction aliasing |
|
Searcher functor using a naive sequential search for a fixed needle. |
|
Trait indicating whether the default searcher can use an optimized path. |
|
STL‐compliant forward iterator adapted from a minimal implementation. |
|
Component‐private metafunction providing nested argument typedefs for |
|
Namespace for looking up an invoker for a given callable type. |
|
Customization point that detects whether a |
|
Dispatcher that invokes a callable of category |
|
forward declaration |
|
forward declaration |
|
forward declaration |
|
|
forward declaration |
forward declaration |
|
forward declaration |
|
forward declaration |
|
forward declaration |
|
Forward declaration of the invocability metafunction for |
|
Metafunction that is |
|
This is a component‐private class. Do not use. |
|
Utility types and constants for |
|
This component‐private class template contains the physical representation and provides the variadic interfaces for |
|
Value‐semantic unordered container of keyed elements. |
|
Standard‐conforming forward iterator over a single hash‐table bucket. |
|
STL‐conforming forward iterator over hash‐table node lists. |
|
This class probably already exists in |
|
This |
|
Comparator adapter used by |
|
Wrapper ensuring a comparator's call operator is const‐qualified. |
|
Wrapper ensuring a hash functor's call operator is const‐qualified. |
|
Proctor that deletes a managed node unless |
|
Utilities for initializing and destroying |
|
Temporary proxy for quoting a |
|
Temporary proxy for quoting a |
|
This |
|
Meta‐function for detecting types convertible to a string view. |
|
This utility struct provides a namespace for functions on iterators and iterator ranges. |
|
Utility for type‐based dispatch of insert‐distance calculation. |
|
This class compares map keys with |
|
Component‐private class template implementing |
|
Tag type selecting construction from a forwarding reference. |
|
Metafunction detecting constructibility from a non‐optional type. |
|
Tag type selecting copy construction from another |
|
Tag type selecting copy construction from a |
|
Component‐private storage that destroys a non‐trivial contained value. |
|
Component‐private buffer managing an optional's contained value. |
|
Helper enabling in‐place construction of immovable values. |
|
Constructor tag used to implement the |
|
Metafunction that is |
|
This metafunction is derived from |
|
Tag type selecting move construction from another |
|
Tag type selecting move construction from a |
|
This trivial tag type is used to create |
|
Tag type distinguishing user arguments from |
|
Metafunction detecting allocator propagation for const value types. |
|
This utility class template provides functions for selecting the element of pair, returned from |
|
Metafunction giving the index of the pair element having type |
|
STL‐compliant random‐access iterator adapted from a minimal implementation. |
|
Comparator for |
|
In‐place |
|
Out‐of‐place concrete implementation of the |
|
Proctor that deletes a pointer if out‐of‐place rep construction fails. |
|
In‐place |
|
This |
|
This |
|
Function‐like deleter that deletes a pointer with |
|
Trait detecting whether |
|
Trait detecting whether |
|
Trait detecting whether |
|
Trait detecting compatibility of |
|
Trait detecting convertibility of |
|
Tag type identifying a |
|
Proctor that disposes a |
|
SFINAE helper that probes whether |
|
Memory pool that allocates blocks of a fixed value type. |
|
Provide type aliases for a maximally aligned |
|
This |
|
Stores a non‐reference |
|
This component‐private empty class is used as a dummy "allocator" when |
|
Component‐private node storing a stop callback for |
|
Shared stop state that tracks a stop request and registered callbacks. |
|
Intrusive list node that stores a registered stop‐callback invocation. |
|
This component‐private class represents a node in a doubly‐linked list. |
|
Component‐private |
|
This class is an intermediate link between |
|
Provide a non‐owning reference to a contiguous character sequence. |
|
[*PRIVATE*]This class provides a namespace for private comparison implementation functions. |
|
Allocator‐independent base of |
|
Internal utils. |
|
STL‐conforming bidirectional iterator over ordered tree nodes. |
|
POD‐like node for a red‐black tree of parameterized |
|
Memory manager that creates and deletes nodes for tree‐based containers. |
|
This |
|
The |
|
This component‐private struct keeps track of the allocator for a |
|
Check whether |
|
Determine whether |
|
Define the data representation and special member functions of |
|
Compute the alternative type at |
|
This component‐private metafunction checks whether a conversion from a pointer type to (template parameter) |
|
This component‐private tag type is used as a parameter type for constructors of |
|
Determine whether |
|
Compute the index of the unique best‐match alternative, or |
|
Metafunction that is |
|
This component‐private class has deleted copy assignment operator if (template parameter) |
|
This component‐private class is a visitor that is used to implement the copy assignment operator for |
|
This component‐private class is a visitor that is used to implement the copy constructor for |
|
This component‐private class has deleted copy constructor if (template parameter) |
|
Provide the |
|
Count occurrences of |
|
Count how many times |
|
This component‐private class manages an object of type (template parameter) |
|
This component‐private struct is a visitor that destroys the active alternative of the visited |
|
Component‐private visitor for variant |
|
Component‐private vtable entry invoking a visitor on alternative |
|
Component‐private vtable entry invoking a tagged visitor on alternative |
|
Component‐private visitor for variant |
|
Component‐private visitor for variant |
|
Determine whether |
|
Determine whether |
|
This component‐private class is a visitor that is used to implement |
|
Determine whether the unique best‐match alternative is constructible. |
|
This component‐private metafunction derives from |
|
This component‐private metafunction is derived from |
|
Determine whether |
|
This component‐private metafunction is derived from |
|
This component‐private metafunction is derived from |
|
This component‐private metafunction is derived from |
|
This component‐private metafunction is derived from |
|
Determine whether |
|
Determine whether |
|
Component‐private visitor for variant |
|
Component‐private visitor for variant |
|
This component‐private class has deleted move assignment operator if (template parameter) |
|
This component‐private class is a visitor that is used to implement the move assignment operator for |
|
This component‐private class is a visitor that is used to implement the move constructor for |
|
This component‐private class has deleted move constructor if (template parameter) |
|
This component‐private trivial tag type is used to distinguish between arguments passed by a user, and an |
|
Component‐private visitor for variant |
|
This component‐private metafunction provides a member typedef |
|
Compute an overload set of |
|
This component‐private class has special member functions that are either deleted or defaulted according to the specified template parameters. |
|
This component‐private class is a visitor that is used to implement |
|
Compute the zero‐based index of |
|
Compute |
|
This component‐private union stores a |
|
This component‐private metafunction is derived from |
|
This component‐private struct computes an array in which element |
|
This component‐private struct computes an array in which element |
|
Determine whether the unique best‐match alternative is assignable. |
|
Result type for the |
Type Aliases
Name |
Description |
Alias for |
|
Alias for |
|
This |
|
Wide‐character string ref type ( |
Functions
Name |
Description |
Pass the specified |
|
Addition operators |
|
Increment operators |
|
Subtraction operators |
|
Decrement operators |
|
Read a quoted string from the specified |
|
Component‐private constraint helper for |
|
Component‐private constraint helper for |
|
|
|
Write the specified |
|
|
|
Write the value of the specified |
|
Equality operators |
|
Inequality operators |
|
Return |
|
Return |
|
Return |
|
Return |
Variables
Name |
Description |
Determine whether |
Concepts
Name |
Description |
Concept identifying iterators that expose an |
|
Component‐private concept modeling the exposition‐only |
|
Component‐private concept that is satisfied when |
|
This component‐private concept models whether a type is derived from one of |
|
Component‐private concept that is satisfied when |
Created with MrDocs