Merge branch 'master' into b19

Author: zygoloid

README.rst

@@ -42,6 +42,15 @@ Install the following packages:
 
    dnf install texlive texlive-isodate texlive-relsize texlive-ulem texlive-fixme texlive-extract
 
+-----------------------------
+Getting Started on Arch Linux
+-----------------------------
+
+Install the following packages:
+
+   latex-mk from the Arch User Repository.
+   pacman -S texlive-latexextra
+
 ------------
 Instructions
 ------------

source/Makefile

@@ -38,6 +38,7 @@ reindex:
 	$(STDPDF)
 	$(STDPDF)
 	makeindex generalindex
+	makeindex headerindex
 	makeindex libraryindex
 	makeindex grammarindex
 	makeindex impldefindex

source/access.tex

@@ -195,7 +195,7 @@
 (\ref{class.derived}):
 
 \begin{ncbnftab}
-access-specifier \terminal{:} member-specification\opt
+access-specifier \terminal{:} member-specification\opt{}
 \end{ncbnftab}
 
 An

source/algorithms.tex

@@ -36,9 +36,9 @@ \chapter{Bibliography}
 
 \clearpage
 \input{xrefdelta}
-\renewcommand{\glossaryname}{Cross references from ISO \CppXVII}
+\renewcommand{\glossaryname}{Cross references from ISO \CppXVII{}}
 \renewcommand{\preglossaryhook}{All clause and subclause labels from
-ISO \CppXVII (ISO/IEC 14882:2017, \doccite{Programming Languages --- \Cpp})
+ISO \CppXVII{} (ISO/IEC 14882:2017, \doccite{Programming Languages --- \Cpp{}})
 are present in this document, with the exceptions described below.\\}
 \renewcommand{\leftmark}{\glossaryname}
 {
@@ -64,6 +64,15 @@ \chapter{Bibliography}
 \printindex[grammarindex]
 }
 
+\clearpage
+\renewcommand{\preindexhook}{}
+\renewcommand{\indexname}{Index of library headers}
+\renewcommand{\leftmark}{\indexname}
+{
+\raggedright
+\printindex[headerindex]
+}
+
 \clearpage
 \renewcommand{\preindexhook}{}
 \renewcommand{\indexname}{Index of library names}

source/atomics.tex

@@ -4,11 +4,11 @@
 \gramSec[gram.basic]{Basic concepts}
 
 \pnum
-\begin{note} This Clause presents the basic concepts of the \Cpp language.
+\begin{note} This Clause presents the basic concepts of the \Cpp{} language.
 It explains the difference between an object and a
 name and how they relate to the value categories for expressions.
 It introduces the concepts of a
-declaration and a definition and presents \Cpp's
+declaration and a definition and presents \Cpp{}'s
 notion of type, scope, linkage, and
 storage duration. The mechanisms for starting and
 terminating a program are discussed. Finally, this Clause presents the
@@ -215,7 +215,7 @@
 \pnum
 \begin{note}
 \indextext{implementation-generated}%
-In some circumstances, \Cpp implementations implicitly define the
+In some circumstances, \Cpp{} implementations implicitly define the
 default constructor\iref{class.ctor},
 copy constructor\iref{class.copy},
 move constructor\iref{class.copy},
@@ -776,7 +776,7 @@
 \item for a declaration of the form
 
 \begin{ncbnf}
-class-key attribute-specifier-seq\opt identifier \terminal{;}
+class-key attribute-specifier-seq\opt{} identifier \terminal{;}
 \end{ncbnf}
 
 the \grammarterm{identifier} is declared to be a
@@ -1775,7 +1775,7 @@
 \grammarterm{qualified-id} of the form:
 
 \begin{ncbnf}
-nested-name-specifier\opt class-name \terminal{::} \terminal{\tilde} class-name
+nested-name-specifier\opt{} class-name \terminal{::} \terminal{\~} class-name
 \end{ncbnf}
 
 the second \grammarterm{class-name} is looked up in the same scope as the
@@ -2135,7 +2135,7 @@
 following form:
 
 \begin{ncbnf}
-class-key attribute-specifier-seq\opt identifier \terminal{;}
+class-key attribute-specifier-seq\opt{} identifier \terminal{;}
 \end{ncbnf}
 
 the \grammarterm{identifier} is looked up according
@@ -2150,7 +2150,7 @@
 form:
 
 \begin{ncbnf}
-class-key attribute-specifier-seq\opt identifier \terminal{;}
+class-key attribute-specifier-seq\opt{} identifier \terminal{;}
 \end{ncbnf}
 
 the \grammarterm{elaborated-type-specifier} is a declaration that
@@ -2316,7 +2316,7 @@
 
 \begin{bnf}
 \nontermdef{translation-unit}\br
-    declaration-seq\opt
+    declaration-seq\opt{}
 \end{bnf}
 
 \pnum
@@ -2540,7 +2540,7 @@
 identity does not require a diagnostic.
 
 \pnum
-\begin{note} Linkage to non-\Cpp declarations can be achieved using a
+\begin{note} Linkage to non-\Cpp{} declarations can be achieved using a
 \grammarterm{linkage-specification}\iref{dcl.link}. \end{note}%
 \indextext{linkage|)}
 
@@ -2550,7 +2550,7 @@
 
 \pnum
 \indextext{memory model|(}%
-The fundamental storage unit in the \Cpp memory model is the
+The fundamental storage unit in the \Cpp{} memory model is the
 \defn{byte}.
 A byte is at least large enough to contain any member of the basic
 \indextext{character set!basic execution}%
@@ -2562,7 +2562,7 @@
 the number of which is \impldef{bits in a byte}. The least
 significant bit is called the \defn{low-order bit}; the most
 significant bit is called the \defn{high-order bit}. The memory
-available to a \Cpp program consists of one or more sequences of
+available to a \Cpp{} program consists of one or more sequences of
 contiguous bytes. Every byte has a unique address.
 
 \pnum
@@ -2614,7 +2614,7 @@
 
 \pnum
 \indextext{object model|(}%
-The constructs in a \Cpp program create, destroy, refer to, access, and
+The constructs in a \Cpp{} program create, destroy, refer to, access, and
 manipulate objects.
 An \defn{object} is created
 by a definition\iref{basic.def},
@@ -2800,7 +2800,7 @@
 
 \pnum
 \begin{note}
-\Cpp  provides a variety of fundamental types and several ways of composing
+\Cpp{} provides a variety of fundamental types and several ways of composing
 new types from existing types\iref{basic.types}.
 \end{note}%
 \indextext{object model|)}
@@ -2877,7 +2877,7 @@
 For an object under construction or destruction, see~\ref{class.cdtor}.
 Otherwise, such
 a pointer refers to allocated
-storage\iref{basic.stc.dynamic.deallocation}, and using the pointer as
+storage\iref{basic.stc.dynamic.allocation}, and using the pointer as
 if the pointer were of type \tcode{void*}, is
 well-defined. Indirection through such a pointer is permitted but the resulting lvalue may only be used in
 limited ways, as described below. The
@@ -2943,7 +2943,7 @@
 For an object under construction or destruction, see~\ref{class.cdtor}.
 Otherwise, such
 a glvalue refers to
-allocated storage\iref{basic.stc.dynamic.deallocation}, and using the
+allocated storage\iref{basic.stc.dynamic.allocation}, and using the
 properties of the glvalue that do not depend on its value is
 well-defined. The program has undefined behavior if:
 \begin{itemize}
@@ -3181,7 +3181,7 @@
 \indextext{\idxcode{new}}%
 \grammarterm{new-expression}{s}\iref{expr.new}, and destroyed using
 \indextext{\idxcode{delete}}%
-\grammarterm{delete-expression}{s}\iref{expr.delete}. A \Cpp implementation
+\grammarterm{delete-expression}{s}\iref{expr.delete}. A \Cpp{} implementation
 provides access to, and management of, dynamic storage via the global
 \defn{allocation functions} \tcode{operator new} and \tcode{operator
 new[]} and the global \defn{deallocation functions} \tcode{operator
@@ -3194,7 +3194,7 @@
 \pnum
 The library provides default definitions for the global allocation and
 deallocation functions. Some global allocation and deallocation
-functions are replaceable\iref{new.delete}. A \Cpp program shall
+functions are replaceable\iref{new.delete}. A \Cpp{} program shall
 provide at most one definition of a replaceable allocation or
 deallocation function. Any such function definition replaces the default
 version provided in the library\iref{replacement.functions}. The
@@ -3203,16 +3203,16 @@
 program.
 
 \begin{codeblock}
-void* operator new(std::size_t);
-void* operator new(std::size_t, std::align_val_t);
+[[nodiscard]] void* operator new(std::size_t);
+[[nodiscard]] void* operator new(std::size_t, std::align_val_t);
 
 void operator delete(void*) noexcept;
 void operator delete(void*, std::size_t) noexcept;
 void operator delete(void*, std::align_val_t) noexcept;
 void operator delete(void*, std::size_t, std::align_val_t) noexcept;
 
-void* operator new[](std::size_t);
-void* operator new[](std::size_t, std::align_val_t);
+[[nodiscard]] void* operator new[](std::size_t);
+[[nodiscard]] void* operator new[](std::size_t, std::align_val_t);
 
 void operator delete[](void*) noexcept;
 void operator delete[](void*, std::size_t) noexcept;
@@ -3240,7 +3240,7 @@
 class\iref{class.free}.
 
 \pnum
-Any allocation and/or deallocation functions defined in a \Cpp program,
+Any allocation and/or deallocation functions defined in a \Cpp{} program,
 including the default versions in the library, shall conform to the
 semantics specified in~\ref{basic.stc.dynamic.allocation}
 and~\ref{basic.stc.dynamic.deallocation}.
@@ -3288,7 +3288,7 @@
 returned as a request for zero size is undefined.\footnote{The intent is
 to have \tcode{operator new()} implementable by
 calling \tcode{std::malloc()} or \tcode{std::calloc()}, so the rules are
-substantially the same. \Cpp differs from C in requiring a zero request
+substantially the same. \Cpp{} differs from C in requiring a zero request
 to return a non-null pointer.}
 
 \pnum
@@ -3311,7 +3311,7 @@
 A global allocation function is only called as the result of a new
 expression\iref{expr.new}, or called directly using the function call
 syntax\iref{expr.call}, or called indirectly through calls to the
-functions in the \Cpp standard library. \begin{note} In particular, a
+functions in the \Cpp{} standard library. \begin{note} In particular, a
 global allocation function is not called to allocate storage for objects
 with static storage duration\iref{basic.stc.static}, for objects or references
 with thread storage duration\iref{basic.stc.thread}, for objects of
@@ -3394,12 +3394,12 @@
 A pointer value is a \defn{safely-derived pointer} to a dynamic object only if it
 has an object pointer type and it is one of the following:
 \begin{itemize}
-\item the value returned by a call to the \Cpp standard library implementation of
+\item the value returned by a call to the \Cpp{} standard library implementation of
 \tcode{::operator new(std::\brk{}size_t)} or
 \tcode{::operator new(std::size_t, std::align_val_t)}%
 ;\footnote{This subclause does not impose restrictions
 on indirection through pointers to memory not allocated by \tcode{::operator new}. This
-maintains the ability of many \Cpp implementations to use binary libraries and
+maintains the ability of many \Cpp{} implementations to use binary libraries and
 components written in other languages. In particular, this applies to C binaries,
 because indirection through pointers to memory allocated by \tcode{std::malloc} is not restricted.}
 
@@ -3636,7 +3636,7 @@
 a set of bits in the object representation that determines a
 \defn{value}, which is one discrete element of an
 \impldef{values of a trivially copyable type} set of values.\footnote{The
-intent is that the memory model of \Cpp is compatible
+intent is that the memory model of \Cpp{} is compatible
 with that of ISO/IEC 9899 Programming Language C.}
 
 \pnum
@@ -3751,7 +3751,7 @@
 within a constant expression.
 It is not a guarantee that it is possible to create such an object,
 nor is it a guarantee that any object of that type
-will usable in a constant expression.
+will be usable in a constant expression.
 \end{note}
 
 \pnum
@@ -4556,7 +4556,7 @@
 If \placeholder{A} and \placeholder{B} would not otherwise be sequenced then they are
 indeterminately sequenced.
 \end{note}
-Several contexts in \Cpp  cause evaluation of a function call, even
+Several contexts in \Cpp{} cause evaluation of a function call, even
 though no corresponding function call syntax appears in the translation
 unit.
 \begin{example}
@@ -4596,7 +4596,7 @@
 with automatic or thread storage duration\iref{basic.stc} is associated with
 one specific thread, and can be accessed by a different thread only indirectly
 through a pointer or reference\iref{basic.compound}.} Under a hosted
-implementation, a \Cpp program can have more than one thread running
+implementation, a \Cpp{} program can have more than one thread running
 concurrently. The execution of each thread proceeds as defined by the remainder
 of this document. The execution of the entire program consists of an execution
 of all of its threads. \begin{note} Usually the execution can be viewed as an
@@ -4878,7 +4878,7 @@
 \begin{note} The four preceding coherence requirements effectively disallow
 compiler reordering of atomic operations to a single object, even if both
 operations are relaxed loads. This effectively makes the cache coherence
-guarantee provided by most hardware available to \Cpp atomic operations.
+guarantee provided by most hardware available to \Cpp{} atomic operations.
 \end{note}
 
 \pnum
@@ -4902,7 +4902,7 @@
 except for the special case for signal handlers described below.
 Any such data race results in undefined
 behavior. \begin{note} It can be shown that programs that correctly use mutexes
-and \tcode{memory_order_seq_cst} operations to prevent all data races and use no
+and \tcode{memory_order::seq_cst} operations to prevent all data races and use no
 other synchronization operations behave as if the operations executed by their
 constituent threads were simply interleaved, with each
 \indextext{value computation}%
@@ -4942,7 +4942,7 @@
 
 \pnum
 \begin{note} Transformations that introduce a speculative read of a potentially
-shared memory location may not preserve the semantics of the \Cpp program as
+shared memory location may not preserve the semantics of the \Cpp{} program as
 defined in this document, since they potentially introduce a data race. However,
 they are typically valid in the context of an optimizing compiler that targets a
 specific machine with well-defined semantics for data races. They would be
@@ -5174,7 +5174,7 @@
 
 \pnum
 An implementation shall not predefine the \tcode{main} function. This
-function shall not be overloaded.  Its type shall have \Cpp language linkage
+function shall not be overloaded.  Its type shall have \Cpp{} language linkage
 and it shall have a declared return type of type
 \tcode{int}, but otherwise its type is \impldef{parameters to \tcode{main}}.
 \indextext{\idxcode{main} function!implementation-defined parameters to}%
@@ -5198,7 +5198,7 @@
 \tcode{argv[0]} through \tcode{argv[argc-1]} as pointers to the initial
 characters of null-terminated multibyte strings (\ntmbs{}s)\iref{multibyte.strings}
 and \tcode{argv[0]} shall be the pointer to
-the initial character of a \ntmbs that represents the name used to
+the initial character of a \ntmbs{} that represents the name used to
 invoke the program or \tcode{""}. The value of \tcode{argc} shall be
 non-negative. The value of \tcode{argv[argc]} shall be 0. \begin{note} It
 is recommended that any further (optional) parameters be added after
@@ -5548,7 +5548,7 @@
 \indexlibrary{\idxcode{abort}}%
 \indextext{termination!program}%
 Calling the function \tcode{std::abort()} declared in
-\indextext{\idxhdr{cstdlib}}%
+\indexhdr{cstdlib}%
 \tcode{<cstdlib>} terminates the program without executing any destructors
 and without calling
 the functions passed to \tcode{std::atexit()} or \tcode{std::at_quick_exit()}.%