16 Library introduction [library]

16.3 Method of description [description]

16.3.2 Structure of each clause [structure]

16.3.2.1 Elements [structure.elements]

1
#
Each library clause contains the following elements, as applicable:156
156)
To save space, items that do not apply to a Clause are omitted.
For example, if a Clause does not specify any requirements, there will be no “Requirements” subclause.
 ⮥

16.3.2.2 Summary [structure.summary]

1
#
The Summary provides a synopsis of the category, and introduces the first-level subclauses.
Each subclause also provides a summary, listing the headers specified in the subclause and the library entities provided in each header.
2
#
The contents of the summary and the detailed specifications include:

16.3.2.3 Requirements [structure.requirements]

1
#
Requirements describe constraints that shall be met by a C++ program that extends the standard library.
Such extensions are generally one of the following:
  • (1.1)
    Template arguments
  • (1.2)
    Derived classes
  • (1.3)
    Containers, iterators, and algorithms that meet an interface convention or model a concept
2
#
The string and iostream components use an explicit representation of operations required of template arguments.
They use a class template char_­traits to define these constraints.
3
#
Interface convention requirements are stated as generally as possible.
Instead of stating “class X has to define a member function operator++()”, the interface requires “for any object x of class X, ++x is defined”.
That is, whether the operator is a member is unspecified.
4
#
Requirements are stated in terms of well-defined expressions that define valid terms of the types that meet the requirements.
For every set of well-defined expression requirements there is either a named concept or a table that specifies an initial set of the valid expressions and their semantics.
Any generic algorithm ([algorithms]) that uses the well-defined expression requirements is described in terms of the valid expressions for its template type parameters.
5
#
The library specification uses a typographical convention for naming requirements.
Names in italic type that begin with the prefix Cpp17 refer to sets of well-defined expression requirements typically presented in tabular form, possibly with additional prose semantic requirements.
For example, Cpp17Destructible (Table 32) is such a named requirement.
Names in constant width type refer to library concepts which are presented as a concept definition ([temp]), possibly with additional prose semantic requirements.
For example, destructible ([concept.destructible]) is such a named requirement.
6
#
Template argument requirements are sometimes referenced by name.
7
#
In some cases the semantic requirements are presented as C++ code.
Such code is intended as a specification of equivalence of a construct to another construct, not necessarily as the way the construct must be implemented.157
8
#
Required operations of any concept defined in this document need not be total functions; that is, some arguments to a required operation may result in the required semantics failing to be met.
[Example 1:
The required < operator of the totally_­ordered concept ([concept.totallyordered]) does not meet the semantic requirements of that concept when operating on NaNs.
— end example]
This does not affect whether a type models the concept.
9
#
A declaration may explicitly impose requirements through its associated constraints ([temp.constr.decl]).
When the associated constraints refer to a concept ([temp.concept]), the semantic constraints specified for that concept are additionally imposed on the use of the declaration.
157)
Although in some cases the code given is unambiguously the optimum implementation.
 ⮥

16.3.2.4 Detailed specifications [structure.specifications]

1
#
The detailed specifications each contain the following elements:
  • (1.1)
    name and brief description
  • (1.2)
    synopsis (class definition or function declaration, as appropriate)
  • (1.3)
    restrictions on template arguments, if any
  • (1.4)
    description of class invariants
  • (1.5)
    description of function semantics
2
#
Descriptions of class member functions follow the order (as appropriate):158
  • (2.1)
    constructor(s) and destructor
  • (2.2)
    copying, moving & assignment functions
  • (2.3)
    comparison operator functions
  • (2.4)
    modifier functions
  • (2.5)
    observer functions
  • (2.6)
    operators and other non-member functions
3
#
Descriptions of function semantics contain the following elements (as appropriate):159
  • (3.1)
    Constraints: the conditions for the function's participation in overload resolution ([over.match]).
    [Note 1:
    Failure to meet such a condition results in the function's silent non-viability.
    — end note]
    [Example 1:
    An implementation might express such a condition via a constraint-expression ([temp.constr.decl]).
    — end example]
  • (3.2)
    Mandates: the conditions that, if not met, render the program ill-formed.
    [Example 2:
    An implementation might express such a condition via the constant-expression in a static_assert-declaration ([dcl.pre]).
    If the diagnostic is to be emitted only after the function has been selected by overload resolution, an implementation might express such a condition via a constraint-expression ([temp.constr.decl]) and also define the function as deleted.
    — end example]
  • (3.3)
    Preconditions: the conditions that the function assumes to hold whenever it is called; violation of any preconditions results in undefined behavior.
  • (3.4)
    Effects: the actions performed by the function.
  • (3.5)
    Synchronization: the synchronization operations ([intro.multithread]) applicable to the function.
  • (3.6)
    Postconditions: the conditions (sometimes termed observable results) established by the function.
  • (3.7)
    Returns: a description of the value(s) returned by the function.
  • (3.8)
    Throws: any exceptions thrown by the function, and the conditions that would cause the exception.
  • (3.9)
    Complexity: the time and/or space complexity of the function.
  • (3.10)
    Remarks: additional semantic constraints on the function.
  • (3.11)
    Error conditions: the error conditions for error codes reported by the function.
4
#
Whenever the Effects element specifies that the semantics of some function F are Equivalent to some code sequence, then the various elements are interpreted as follows.
If F's semantics specifies any Constraints or Mandates elements, then those requirements are logically imposed prior to the equivalent-to semantics.
Next, the semantics of the code sequence are determined by the Constraints, Mandates, Preconditions, Effects, Synchronization, Postconditions, Returns, Throws, Complexity, Remarks, and Error conditions specified for the function invocations contained in the code sequence.
The value returned from F is specified by F's Returns element, or if F has no Returns element, a non-void return from F is specified by the return statements ([stmt.return]) in the code sequence.
If F's semantics contains a Throws, Postconditions, or Complexity element, then that supersedes any occurrences of that element in the code sequence.
5
#
For non-reserved replacement and handler functions, [support] specifies two behaviors for the functions in question: their required and default behavior.
The default behavior describes a function definition provided by the implementation.
The required behavior describes the semantics of a function definition provided by either the implementation or a C++ program.
Where no distinction is explicitly made in the description, the behavior described is the required behavior.
6
#
If the formulation of a complexity requirement calls for a negative number of operations, the actual requirement is zero operations.160
7
#
Complexity requirements specified in the library clauses are upper bounds, and implementations that provide better complexity guarantees meet the requirements.
8
#
Error conditions specify conditions where a function may fail.
The conditions are listed, together with a suitable explanation, as the enum class errc constants ([syserr]).
158)
To save space, items that do not apply to a class are omitted.
For example, if a class does not specify any comparison operator functions, there will be no “Comparison operator functions” subclause.
 ⮥
159)
To save space, elements that do not apply to a function are omitted.
For example, if a function specifies no preconditions, there will be no Preconditions: element.
 ⮥
160)
This simplifies the presentation of complexity requirements in some cases.
 ⮥

16.3.2.5 C library [structure.see.also]

1
#
Paragraphs labeled “See also” contain cross-references to the relevant portions of other standards ([intro.refs]).