[EDITORIAL] Correct mispellings of "only if" as "if and only if"

concepts.tex

@@ -339,7 +339,7 @@
 Let \tcode{C} be \tcode{common_reference_t<T, U>}. Let \tcode{t} be a
 function whose return type is \tcode{T}, and let \tcode{u} be a function
 whose return type is \tcode{U}. \tcode{CommonReference<T, U>} is satisfied
-if and only if:
+only if:
 \begin{itemize}
 \item \tcode{C(t())} equals \tcode{C(t())} if and only if \tcode{t()} is an
   equality preserving expression~(\ref{concepts.lib.general.equality}).
@@ -381,7 +381,7 @@
 \pnum
 Let \tcode{C} be \tcode{common_type_t<T, U>}. Let
 \tcode{t} be a function whose return type is \tcode{T}, and let \tcode{u} be a function
-whose return type is \tcode{U}. \tcode{Common<T, U>} is satisfied if and only if:
+whose return type is \tcode{U}. \tcode{Common<T, U>} is satisfied only if:
 \begin{itemize}
 \item \tcode{C(t())} equals \tcode{C(t())} if and only if
   \tcode{t()} is an equality preserving
@@ -456,7 +456,7 @@
 otherwise, let \tcode{v} be an rvalue of type \tcode{R}.
 Let \tcode{uu} be a distinct object of type \tcode{R} such that
 \tcode{uu} is equal to \tcode{v}.
-Then \tcode{Assignable<T, U>} is satisfied if and only if
+Then \tcode{Assignable<T, U>} is satisfied only if
 
 \begin{itemize}
 \item \tcode{addressof(t = v) == addressof(t)}.
@@ -498,8 +498,8 @@
 
 \pnum
 An object \tcode{t} is \defn{swappable with} an object \tcode{u} if and only if
-\tcode{SwappableWith<T, U>} is satisfied. \tcode{SwappableWith<T, U>} is satisfied if
-and only if given distinct objects \tcode{t2} equal to \tcode{t}
+\tcode{SwappableWith<T, U>} is satisfied. \tcode{SwappableWith<T, U>} is satisfied
+only if given distinct objects \tcode{t2} equal to \tcode{t}
 and \tcode{u2} equal to \tcode{u}, after evaluating either
 \tcode{ranges::swap(t, u)} or \tcode{ranges::swap(u, t)}, \tcode{t2} is equal to
 \tcode{u} and \tcode{u2} is equal to \tcode{t}.
@@ -593,7 +593,7 @@
 
 \pnum
 Given values \tcode{b1} and \tcode{b2} of type \tcode{B}, then
-\tcode{Boolean<B>} is satisfied if and only if
+\tcode{Boolean<B>} is satisfied only if
 
 \begin{itemize}
 \item \tcode{bool(b1) == [](bool x) \{ return x; \}(b1)}.
@@ -632,7 +632,7 @@
 \begin{itemdescr}
 \pnum
 Let \tcode{t} and \tcode{u} be objects of types \tcode{T} and \tcode{U} respectively.
-\tcode{WeaklyEqualityComparableWith<T, U>} is satisfied if and only if:
+\tcode{WeaklyEqualityComparableWith<T, U>} is satisfied only if:
 \begin{itemize}
 \item \tcode{t == u}, \tcode{u == t}, \tcode{t != u}, and \tcode{u != t}
       have the same domain.
@@ -650,9 +650,8 @@
 
 \begin{itemdescr}
 \pnum
-Let \tcode{a} and \tcode{b} be objects
-of type \tcode{T}. \tcode{EqualityComparable<T>}
-is satisfied if and only if:
+Let \tcode{a} and \tcode{b} be objects of type \tcode{T}.
+\tcode{EqualityComparable<T>} is satisfied only if:
 
 \begin{itemize}
 \item \tcode{bool(a == b)} if and only if \tcode{a} is equal to \tcode{b}.
@@ -679,8 +678,7 @@
 \pnum
 Let \tcode{t} be an object of type \tcode{T}, \tcode{u} be an object of type \tcode{U}, and \tcode{C} be
 \tcode{common_reference_t<const T\&, const U\&>}.
-Then \tcode{EqualityComparableWith<T, U>}
-is satisfied if and only if:
+Then \tcode{EqualityComparableWith<T, U>} is satisfied only if:
 
 \begin{itemize}
 \item \tcode{bool(t == u) == bool(C(t) == C(u))}.
@@ -705,7 +703,7 @@
 \begin{itemdescr}
 \pnum
 Let \tcode{a}, \tcode{b}, and \tcode{c} be objects of type \tcode{T}.
-Then \tcode{StrictTotallyOrdered<T>} is satisfied if and only if
+Then \tcode{StrictTotallyOrdered<T>} is satisfied only if
 
 \begin{itemize}
 \item Exactly one of \tcode{bool(a < b)}, \tcode{bool(a > b)}, or
@@ -745,7 +743,7 @@
 Let \tcode{t} be an object of type T, \tcode{u} be an object
 of type \tcode{U}, and \tcode{C} be
 \tcode{common_reference_t<const T\&, const U\&>}.
-Then \tcode{StrictTotallyOrderedWith<T, U>} is satisfied if and only if
+Then \tcode{StrictTotallyOrderedWith<T, U>} is satisfied only if
 
 \begin{itemize}
 \item \tcode{bool(t < u) == bool(C(t) < C(u)).}
@@ -792,7 +790,7 @@
 
 \pnum
 Given a (possibly \tcode{const}) lvalue \tcode{t} of type \tcode{T} and pointer
-\tcode{p} of type \tcode{T*}, \tcode{Destructible<T>} is satisfied if and only if
+\tcode{p} of type \tcode{T*}, \tcode{Destructible<T>} is satisfied only if
 
 \begin{itemize}
 \item After evaluating the expression \tcode{t.$\sim$T()},
@@ -867,7 +865,7 @@
 Let \tcode{U} be the type \tcode{remove_cv_t<T>},
 \tcode{rv} be an rvalue of type \tcode{U},
 and \tcode{u2} be a distinct object of type \tcode{T} equal to \tcode{rv}.
-Then \tcode{MoveConstructible<T>} is satisfied if and only if
+Then \tcode{MoveConstructible<T>} is satisfied only if
 
 \begin{itemize}
 \item After the definition \tcode{T u = rv;}, \tcode{u} is equal to \tcode{u2}.
@@ -896,7 +894,7 @@
 \pnum
 Let \tcode{v} be an lvalue of type (possibly \tcode{const})
 \tcode{remove_cv_t<T>} or an rvalue of type \tcode{const remove_cv_t<T>}.
-Then \tcode{CopyConstructible<T>} is satisfied if and only if
+Then \tcode{CopyConstructible<T>} is satisfied only if
 
 \begin{itemize}
 \item After the definition \tcode{T u = v;}, \tcode{u} is equal
@@ -1050,7 +1048,7 @@
 object of type \tcode{T}, \tcode{u} be any
 object of type \tcode{U}, and \tcode{C} be
 \tcode{common_reference_t<const T\&, const U\&>}.
-Then \tcode{Relation<R, T, U>} is satisfied if and only if
+Then \tcode{Relation<R, T, U>} is satisfied only if
 
 \begin{itemize}
 \item \tcode{bool(r(t, u)) == bool(r(C(t), C(u))).}
@@ -1068,7 +1066,7 @@
 
 \begin{itemdescr}
 \pnum
-A \tcode{Relation} satisfies \tcode{StrictWeakOrder} if and only if
+A \tcode{Relation} satisfies \tcode{StrictWeakOrder} only if
 it imposes a \techterm{strict weak ordering} on its arguments.
 
 \pnum

iterators.tex

@@ -997,7 +997,7 @@
 
 \pnum
 Let \tcode{E} be an an expression such that \tcode{decltype((E))} is \tcode{T}, and let \tcode{o}
-be a dereferenceable object of type \tcode{Out}. Then \tcode{Writable<Out, T>} is satisfied if and only if
+be a dereferenceable object of type \tcode{Out}. Then \tcode{Writable<Out, T>} is satisfied only if
 
 \begin{itemize}
 \item If \tcode{Readable<Out> \&\& Same<value_type_t<Out>, decay_t<T>{>}} is satisfied,
@@ -1042,10 +1042,10 @@
 \pnum
 Let \tcode{i} be an object of type \tcode{I}. When both pre- and post-increment
 are valid, \tcode{i} is said to be \techterm{incrementable}. Then
-\tcode{WeaklyIncrementable<I>} is satisfied if and only if
+\tcode{WeaklyIncrementable<I>} is satisfied only if
 
 \begin{itemize}
-\item \tcode{++i} is valid if and only if \tcode{i++} is valid.
+\item The expressions \tcode{++i} and \tcode{i++} have the same domain.
 \item If \tcode{i} is incrementable, then both \tcode{++i}
   and \tcode{i++} advance \tcode{i} to the next element.
 \item If \tcode{i} is incrementable, then \tcode{\&++i} is equal to \tcode{\&i}.
@@ -1081,8 +1081,7 @@
 
 \pnum
 Let \tcode{a} and \tcode{b} be incrementable objects of type \tcode{I}.
-Then \tcode{Incrementable<I>} is satisfied
-if and only if
+Then \tcode{Incrementable<I>} is satisfied only if
 
 \begin{itemize}
 \item If \tcode{bool(a == b)} then \tcode{bool(a++ == b)}.
@@ -1141,8 +1140,7 @@
 \pnum
 Let \tcode{s} and \tcode{i} be values of type \tcode{S} and
 \tcode{I} such that \range{i}{s} denotes a range. Types
-\tcode{S} and \tcode{I} satisfy \tcode{Sentinel<S, I>}
-if and only if:
+\tcode{S} and \tcode{I} satisfy \tcode{Sentinel<S, I>} only if:
 
 \begin{itemize}
 \item \tcode{i == s} is well-defined.
@@ -1185,7 +1183,7 @@
 a sentinel of type \tcode{S} such that \range{i}{s} denotes a range.
 Let $N$ be the smallest number of applications of \tcode{++i}
 necessary to make \tcode{bool(i == s)} be \tcode{true}.
-\tcode{SizedSentinel<S, I>} is satisfied if and only if:
+\tcode{SizedSentinel<S, I>} is satisfied only if:
 
 \begin{itemize}
 \item If $N$ is representable by \tcode{difference_type_t<I>},
@@ -1340,12 +1338,12 @@
 
 \pnum
 A bidirectional iterator \tcode{r} is decrementable if and only if there exists some \tcode{s} such that
-\tcode{++s == r}. The expressions \tcode{\dcr{}r} and \tcode{r\dcr{}} are only valid if \tcode{r} is
-decrementable.
+\tcode{++s == r}. Decrementable iterators \tcode{r} shall be in the domain of the expressions
+\tcode{\dcr{}r} and \tcode{r\dcr{}}.
 
 \pnum
 Let \tcode{a} and \tcode{b} be decrementable objects of type \tcode{I}. Then
-\tcode{BidirectionalIterator<I>} is satisfied if and only if:
+\tcode{BidirectionalIterator<I>} is satisfied only if:
 
 \begin{itemize}
 \item \tcode{\&\dcr{}a == \&a}.
@@ -1388,7 +1386,7 @@
 from \tcode{a}. Let \tcode{n} be the smallest value of type
 \tcode{difference_type_t<I>} such that after
 \tcode{n} applications of \tcode{++a}, then \tcode{bool(a == b)}. Then
-\tcode{RandomAccessIterator<I>} is satisfied if and only if:
+\tcode{RandomAccessIterator<I>} is satisfied only if:
 
 \begin{itemize}
 \item \tcode{(a += n)} is equal to \tcode{b}.

numerics.tex

@@ -47,7 +47,7 @@
 
 \pnum
 Let \tcode{g} be any object of type \tcode{G}. Then
-\tcode{UniformRandomNumberGenerator<G>} is satisfied if and only if
+\tcode{UniformRandomNumberGenerator<G>} is satisfied only if
 
 \begin{itemize}
 \item Both \tcode{G::min()} and \tcode{G::max()} are constant expressions~(\cxxref{expr.const}).