Skip to content

Commit

Permalink
Browse files Browse the repository at this point in the history
Use link macros more.
  • Loading branch information
Eelis committed Sep 17, 2017
1 parent cadfe22 commit 5235167
Show file tree
Hide file tree
Showing 13 changed files with 342 additions and 308 deletions.
2 changes: 1 addition & 1 deletion source/classes.tex
Expand Up @@ -547,7 +547,7 @@
(a \defn{non-static data member} or
\defn{non-static member function}~(\ref{class.mfct.non-static}), respectively).
\begin{note} A non-static data member of non-reference
type is a member subobject of a class object\iref{intro.object}.\end{note}
type is a \deflink{member subobject}{\ref{intro.object}} of a class object.\end{note}

\pnum
A member shall not be declared twice in the
Expand Down
12 changes: 6 additions & 6 deletions source/declarations.tex
Expand Up @@ -1840,7 +1840,7 @@
of a \grammarterm{new-expression}\iref{expr.new},
or
as the \grammarterm{simple-type-specifier}
in an explicit type conversion (functional notation)\iref{expr.type.conv}.
in an \link{explicit type conversion (functional notation)}{\ref{expr.type.conv}}.
A placeholder for a deduced class type
shall not appear in any other context.

Expand Down Expand Up @@ -2491,8 +2491,8 @@
class, function, class template or function template\footnote{this implies that the name of the class or function is unqualified.}
the friend is a member of the innermost enclosing
namespace. The \tcode{friend} declaration does not by itself make the name
visible to unqualified lookup\iref{basic.lookup.unqual} or qualified
lookup\iref{basic.lookup.qual}. \begin{note} The name of the friend will be
visible to \link{unqualified lookup}{\ref{basic.lookup.unqual}} or \link{qualified
lookup}{\ref{basic.lookup.qual}}. \begin{note} The name of the friend will be
visible in its namespace if a matching declaration is provided at namespace
scope (either before or after the class definition granting friendship).
\end{note} If a friend
Expand Down Expand Up @@ -3732,7 +3732,7 @@
\grammarterm{class-head}\iref{class}, respectively) and to the
declaration or definition of an enumeration (in an
\grammarterm{opaque-enum-declaration} or \grammarterm{enum-head},
respectively\iref{dcl.enum}).
respectively).
An \grammarterm{alignment-specifier} with an ellipsis is a \deflink{pack expansion}{\ref{temp.variadic}}.

\pnum
Expand All @@ -3750,7 +3750,7 @@
\pnum
An \grammarterm{alignment-specifier} of the form
\tcode{alignas(} \grammarterm{type-id} \tcode{)} has the same
effect as \tcode{alignas(\brk{}alignof(} \grammarterm{type-id}~\tcode{))}\iref{expr.alignof}.
effect as \tcode{alignas(\brk{}\link{alignof}{expr.alignof}(} \grammarterm{type-id}~\tcode{))}.

\pnum
The alignment requirement of an entity is the strictest nonzero alignment
Expand Down Expand Up @@ -4046,7 +4046,7 @@
calls a function previously declared \tcode{nodiscard}, or
whose return type is a possibly cv-qualified class or enumeration type
marked \tcode{nodiscard}. Appearance of a nodiscard call as
a potentially-evaluated discarded-value expression\iref{expr}
a potentially-evaluated \deflink{discarded-value expression}{\ref{expr}}
is discouraged unless explicitly cast to \tcode{void}.
Implementations should issue a warning in such cases.
This is typically because discarding the return value
Expand Down
20 changes: 10 additions & 10 deletions source/expressions.tex
Expand Up @@ -135,7 +135,7 @@
In an unevaluated operand, a non-static class member may be
named\iref{expr.prim} and naming of objects or functions does not, by
itself, require that a definition be provided\iref{basic.def.odr}.
An unevaluated operand is considered a full-expression\iref{intro.execution}.
An unevaluated operand is considered a \deflink{full-expression}{\ref{intro.execution}}.
\end{note}

\pnum
Expand Down Expand Up @@ -500,7 +500,7 @@
\begin{note}
A concept's constraints are also considered
when using a template name\iref{temp.names}
and during overload resolution\iref{over},
and during \deflink{overload resolution}{\ref{over}},
and they are compared
during the the partial ordering of constraints\iref{temp.constr.order}.
\end{note}
Expand All @@ -526,7 +526,7 @@
In the declaration of \tcode{p2},
those constraints are required to be satisfied
even though
\tcode{f} is an unevaluated operand\iref{expr}.
\tcode{f} is an \deflink{unevaluated operand}{\ref{expr}}.
\end{example}

\rSec3[expr.prim.id.unqual]{Unqualified names}
Expand Down Expand Up @@ -619,7 +619,7 @@
\pnum
The \grammarterm{nested-name-specifier} \tcode{::} names the global namespace.
A \grammarterm{nested-name-specifier} that names a
namespace\iref{basic.namespace}, optionally followed by the keyword
\link{namespace}{\ref{basic.namespace}}, optionally followed by the keyword
\tcode{template}\iref{temp.names}, and then followed by the name of a member
of that namespace (or the name of a member of a namespace made visible by a
\grammarterm{using-directive}), is a
Expand Down Expand Up @@ -1515,7 +1515,7 @@
\pnum
A \grammarterm{requires-expression} provides a concise way to express
requirements on template arguments
that can be checked by name lookup\iref{basic.lookup}
that can be checked by \link{name lookup}{\ref{basic.lookup}}
or by checking properties of types and expressions.

\begin{bnf}
Expand Down Expand Up @@ -1551,7 +1551,7 @@
A \grammarterm{requires-expression} is a prvalue of type \tcode{bool}
whose value is described below.
Expressions appearing within a \grammarterm{requirement-body}
are unevaluated operands\iref{expr}.
are \deflinkx{unevaluated operands}{unevaluated operand}{\ref{expr}}.

\pnum
\begin{example}
Expand Down Expand Up @@ -1649,7 +1649,7 @@
\begin{note}
The enclosing \grammarterm{requires-expression} will evaluate to \tcode{false}
if substitution of template arguments into the \grammarterm{expression} fails.
The \grammarterm{expression} is an unevaluated operand\iref{expr}.
The \grammarterm{expression} is an \deflink{unevaluated operand}{\ref{expr}}.
\end{note}
\begin{example}
\begin{codeblock}
Expand Down Expand Up @@ -1716,7 +1716,7 @@
into the \grammarterm{expression} is performed.

\item If the \tcode{noexcept} specifier is present,
\tcode{E} shall not be a potentially-throwing expression\iref{except.spec}.
\tcode{E} shall not be a \deflinkx{potentially-throwing expression}{potentially-throwing!expression}{\ref{except.spec}}.

\item If the \grammarterm{return-type-requirement} is present, then:

Expand Down Expand Up @@ -1836,7 +1836,7 @@
\end{example}

\pnum
A local parameter shall only appear as an unevaluated operand\iref{expr}
A local parameter shall only appear as an \deflink{unevaluated operand}{\ref{expr}}
within the \grammarterm{constraint-expression}.
\begin{example}
\begin{codeblock}
Expand Down Expand Up @@ -2558,7 +2558,7 @@

\pnum
When \tcode{typeid} is applied to a glvalue expression whose type is a
\deflink{polymorphic class}{\ref{class.virtual}} type, the result refers to a
\deflinkx{polymorphic class}{class!polymorphic}{\ref{class.virtual}} type, the result refers to a
\tcode{std::type_info} object representing the type of the \deflink{most derived
object}{\ref{intro.object}} (that is, the dynamic type) to which the
glvalue refers. If the glvalue expression is obtained by applying the
Expand Down
2 changes: 1 addition & 1 deletion source/intro.tex
Expand Up @@ -952,7 +952,7 @@
used in the call, or
\item
if \tcode{e} creates an \link{aggregate}{\ref{dcl.init.aggr}} object,
the constituent expressions of each default member initializer\iref{class.mem}
the constituent expressions of each \deflink{default member initializer}{\ref{class.mem}}
used in the initialization.
\end{itemize}

Expand Down

0 comments on commit 5235167

Please sign in to comment.