removing hyphenation from ly adverbs

source/algorithms.tex

@@ -256,7 +256,7 @@
 
 \pnum
 The well-formedness and behavior of a call to an algorithm with
-an explicitly-specified template argument list
+an explicitly specified template argument list
 is unspecified, except where explicitly stated otherwise.
 \begin{note}
 Consequently, an implementation can declare an algorithm with
@@ -9566,7 +9566,7 @@
 is lexicographically sorted with respect to \tcode{comp} and \tcode{proj}.
 If no such permutation exists,
 transforms the sequence into the first permutation;
-that is, the ascendingly-sorted one.
+that is, the ascendingly sorted one.
 
 \pnum
 \returns
@@ -9625,7 +9625,7 @@
 is lexicographically sorted with respect to \tcode{comp} and \tcode{proj}.
 If no such permutation exists,
 transforms the sequence into the last permutation;
-that is, the descendingly-sorted one.
+that is, the descendingly sorted one.
 
 \pnum
 \returns
@@ -11148,7 +11148,7 @@
 When new objects are created by
 the algorithms specified in \ref{specialized.algorithms},
 the lifetime ends for any existing objects
-(including potentially-overlapping subobjects \ref{intro.object})
+(including potentially overlapping subobjects \ref{intro.object})
 in storage that is reused \ref{basic.life}.
 \end{note}
 

source/basic.tex

@@ -395,7 +395,7 @@
 \item Otherwise, the set is empty.
 \end{itemize}
 \begin{note}
-This set is a (possibly-empty) set of \grammarterm{id-expression}{s},
+This set is a (possibly empty) set of \grammarterm{id-expression}{s},
 each of which is either $E$ or a subexpression of $E$.
 \begin{example}
 In the following example, the set of potential results of the initializer
@@ -455,7 +455,7 @@
 A variable is named by an expression
 if the expression is an \grammarterm{id-expression} that denotes it.
 A variable \tcode{x} that is named by a
-potentially-evaluated expression $N$
+potentially evaluated expression $N$
 that appears at a point $P$
 is \defnx{odr-used}{odr-use} by $N$ unless
 \begin{itemize}
@@ -510,18 +510,18 @@
 \end{example}
 
 \pnum
-A structured binding is odr-used if it appears as a potentially-evaluated expression.
+A structured binding is odr-used if it appears as a potentially evaluated expression.
 
 \pnum
-\tcode{*\keyword{this}} is odr-used if \keyword{this} appears as a potentially-evaluated expression
+\tcode{*\keyword{this}} is odr-used if \keyword{this} appears as a potentially evaluated expression
 (including as the result of any implicit transformation to
 a class member access expression\iref{expr.prim.id.general}).
 
 \pnum
 A virtual member
 function is odr-used if it is not pure.
 A function is odr-used if it is named by
-a potentially-evaluated expression or conversion.
+a potentially evaluated expression or conversion.
 A non-placement allocation or deallocation
 function for a class is odr-used by the definition of a constructor of that
 class. A non-placement deallocation function for a class is odr-used by the
@@ -537,7 +537,7 @@
 
 \pnum
 An assignment operator function in a class is odr-used by an
-implicitly-defined
+implicitly defined
 copy assignment or move assignment function for another class as specified
 in~\ref{class.copy.assign}.
 A constructor for a class is odr-used as specified
@@ -778,7 +778,7 @@
 For the purposes of the preceding requirements:
 
 \begin{itemize}
-\item If \tcode{D} is a class with an implicitly-declared
+\item If \tcode{D} is a class with an implicitly declared
 constructor\iref{class.default.ctor,class.copy.ctor},
 it is as if the constructor was
 implicitly defined in every translation unit where it is odr-used, and the
@@ -1411,7 +1411,7 @@
 \begin{itemize}
 \item
 If $P$ is associated with a \grammarterm{declarator} and
-is preceded by a (possibly-parenthesized) \grammarterm{noptr-declarator} of
+is preceded by a (possibly parenthesized) \grammarterm{noptr-declarator} of
 the form
 \grammarterm{declarator-id} \opt{\grammarterm{attribute-specifier-seq}},
 its scope extends to the end of the nearest enclosing
@@ -3395,7 +3395,7 @@
 \defn{most derived object}.
 
 \pnum
-A \defn{potentially-overlapping subobject} is either:
+A \defn{potentially overlapping subobject} is either:
 \begin{itemize}
 \item a base class subobject, or
 \item a non-static data member
@@ -3407,7 +3407,7 @@
 \indextext{object!nonzero size}%
 An object has nonzero size if it
 \begin{itemize}
-\item is not a potentially-overlapping subobject, or
+\item is not a potentially overlapping subobject, or
 \item is not of class type, or
 \item is of a class type with virtual member functions or virtual base classes, or
 \item has subobjects of nonzero size or unnamed bit-fields of nonzero length.
@@ -3499,7 +3499,7 @@
 Further, after implicitly creating objects within a specified region of storage,
 some operations are described as producing a pointer to a
 \defnadj{suitable created}{object}.
-These operations select one of the implicitly-created objects
+These operations select one of the implicitly created objects
 whose address is the address of the start of the region of storage,
 and produce a pointer value that points to that object,
 if that value would result in the program having defined behavior.
@@ -3839,7 +3839,7 @@
 \item $o_1$ is not a const, complete object, and
 
 \item neither $o_1$ nor $o_2$
-is a potentially-overlapping subobject\iref{intro.object}, and
+is a potentially overlapping subobject\iref{intro.object}, and
 
 \item either $o_1$ and $o_2$ are both complete objects, or
 $o_1$ and $o_2$ are direct subobjects of objects $p_1$ and $p_2$, respectively,
@@ -4530,7 +4530,7 @@
 
 \pnum
 When an object of class type \tcode{X}
-is passed to or returned from a potentially-evaluated function call,
+is passed to or returned from a potentially evaluated function call,
 if \tcode{X} is
 \begin{itemize}
 \item
@@ -4855,7 +4855,7 @@
 \pnum
 \indextext{object!byte copying and|(}%
 \indextext{type!trivially copyable}%
-For any object (other than a potentially-overlapping subobject) of trivially copyable type
+For any object (other than a potentially overlapping subobject) of trivially copyable type
 \tcode{T}, whether or not the object holds a valid value of type
 \tcode{T}, the underlying bytes\iref{intro.memory} making up the
 object can be copied into an array of
@@ -4882,7 +4882,7 @@
 \pnum
 For two distinct objects \tcode{obj1} and \tcode{obj2}
 of trivially copyable type \tcode{T},
-where neither \tcode{obj1} nor \tcode{obj2} is a potentially-overlapping subobject,
+where neither \tcode{obj1} nor \tcode{obj2} is a potentially overlapping subobject,
 if the underlying bytes\iref{intro.memory} making up
 \tcode{obj1} are copied into \tcode{obj2},
 \begin{footnote}
@@ -4939,17 +4939,17 @@
 \end{footnote}
 
 \pnum
-\indextext{type!incompletely-defined object}%
+\indextext{type!incompletely defined object}%
 A class that has been declared but not defined, an enumeration type in certain
 contexts\iref{dcl.enum}, or an array of unknown
 bound or of incomplete element type, is an
-\defnadj{incompletely-defined}{object type}.
+\defnadj{incompletely defined}{object type}.
 \begin{footnote}
-The size and layout of an instance of an incompletely-defined
+The size and layout of an instance of an incompletely defined
 object type is unknown.
 \end{footnote}
 \label{term.incomplete.type}%
-Incompletely-defined object types and \cv{}~\keyword{void} are
+Incompletely defined object types and \cv{}~\keyword{void} are
 \defnadjx{incomplete}{types}{type}\iref{basic.fundamental}.
 \begin{note}
 Objects cannot be defined to have an incomplete type\iref{basic.def}.
@@ -5681,7 +5681,7 @@
 if there is an object \placeholder{y},
 pointer-interconvertible with \placeholder{x},
 such that \placeholder{b} is within the storage occupied by
-\placeholder{y}, or the immediately-enclosing array object
+\placeholder{y}, or the immediately enclosing array object
 if \placeholder{y} is an array element.
 
 \pnum
@@ -5995,7 +5995,7 @@
 Expressions appearing in the \grammarterm{compound-statement} of a \grammarterm{lambda-expression}
 are not subexpressions of the \grammarterm{lambda-expression}.
 \end{note}
-The \defnadjx{potentially-evaluated}{subexpressions}{subexpression} of
+The \defnadjx{potentially evaluated}{subexpressions}{subexpression} of
 an expression, conversion, or \grammarterm{initializer} $E$ are
 \begin{itemize}
 \item
@@ -7002,7 +7002,7 @@
 \indextext{initialization!order of}%
 Dynamic initialization of a non-block variable with static storage duration is
 unordered if the variable is an implicitly or explicitly instantiated
-specialization, is partially-ordered if the variable
+specialization, is partially ordered if the variable
 is an inline variable that is not an implicitly or explicitly instantiated
 specialization, and otherwise is ordered.
 \begin{note}
@@ -7028,7 +7028,7 @@
 If \tcode{V} and \tcode{W} have ordered initialization and
 the definition of \tcode{V}
 is appearance-ordered before the definition of \tcode{W}, or
-if \tcode{V} has partially-ordered initialization,
+if \tcode{V} has partially ordered initialization,
 \tcode{W} does not have unordered initialization, and
 for every definition \tcode{E} of \tcode{W}
 there exists a definition \tcode{D} of \tcode{V}