Revert "[everywhere] Replace "might" and "could" ...".

This reverts commit ae06f3e.

We will make these changes in a more careful series of smaller commits.

Author: tkoeppe

source/algorithms.tex

@@ -8586,9 +8586,8 @@
 
 \pnum
 \begin{example}
-The function
 \tcode{ranges::lexicographical_compare(I1, S1, I2, S2, Comp, Proj1, Proj2)}
-can be implemented as:
+could be implemented as:
 \begin{codeblock}
 for ( ; first1 != last1 && first2 != last2 ; ++first1, (void) ++first2) {
   if (invoke(comp, invoke(proj1, *first1), invoke(proj2, *first2))) return true;

source/atomics.tex

@@ -770,7 +770,7 @@
 atomic operations applied through any other \tcode{atomic_ref}
 referencing the same object.
 \begin{note}
-Atomic operations or the \tcode{atomic_ref} constructor can acquire
+Atomic operations or the \tcode{atomic_ref} constructor could acquire
 a shared resource, such as a lock associated with the referenced object,
 to enable atomic operations to be applied to the referenced object.
 \end{note}

source/basic.tex

@@ -1542,7 +1542,7 @@
 \begin{footnote}
 This
 refers to unqualified names following the class name;
-such a name can be used in a \grammarterm{base-specifier} or
+such a name might be used in a \grammarterm{base-specifier} or
 in the \grammarterm{member-specification} of the class definition.
 \end{footnote}
 outside of a complete-class context\iref{class.mem} of \tcode{X}
@@ -2859,7 +2859,7 @@
 \grammarterm{using-directive}{s}
 do not declare entities.
 Enumerators do not have linkage,
-but can serve as the name of an enumeration with linkage\iref{dcl.enum}.
+but might serve as the name of an enumeration with linkage\iref{dcl.enum}.
 \end{note}
 
 \pnum
@@ -3816,7 +3816,7 @@
 \impldef{any use of an invalid pointer other than to perform indirection or deallocate}
 behavior.
 \begin{footnote}
-Implementations can define that
+Some implementations might define that
 copying an invalid pointer value
 causes a system-generated runtime fault.
 \end{footnote}
@@ -4229,7 +4229,7 @@
 \begin{note}
 The effect of using an invalid pointer value (including passing it to a
 deallocation function) is undefined, see~\ref{basic.stc}.
-This is true even if the unsafely-derived pointer value compares equal to
+This is true even if the unsafely-derived pointer value might compare equal to
 some safely-derived pointer value.
 \end{note}
 It is
@@ -4272,10 +4272,9 @@
 
 When \tcode{D} is the type of a complete object, it will have a subobject of
 type \tcode{B}, so it must be aligned appropriately for a \tcode{long double}.
-If \tcode{D} appears as a base class subobject,
-the alignment requirement of \tcode{B} might influence the alignment of only
-the most-derived object, reducing the alignment requirements on the \tcode{D}
-subobject.
+If \tcode{D} appears as a subobject of another object that also has \tcode{B}
+as a virtual base class, the \tcode{B} subobject might be part of a different
+subobject, reducing the alignment requirements on the \tcode{D} subobject.
 \end{example}
 The result of the \tcode{alignof} operator reflects the alignment
 requirement of the type in the complete-object case.
@@ -5331,7 +5330,7 @@
 A pointer past the end of an object\iref{expr.add}
 is not considered to point to an unrelated object
 of the object's type
-that is located at that address.
+that might be located at that address.
 A pointer value becomes invalid
 when the storage it denotes
 reaches the end of its storage duration;
@@ -5732,7 +5731,7 @@
 \placeholder{B} or \placeholder{B} is sequenced before \placeholder{A}, but it is unspecified which.
 \begin{note}
 Indeterminately sequenced evaluations cannot overlap, but either
-can be executed first.
+could be executed first.
 \end{note}
 An expression \placeholder{X}
 is said to be sequenced before
@@ -6356,7 +6355,7 @@
 \begin{example}
 A library I/O function that blocks until the I/O operation is complete can
 be considered to continuously check whether the operation is complete. Each
-such check can consist of one or more execution steps, for example using
+such check might consist of one or more execution steps, for example using
 observable behavior of the abstract machine.
 \end{example}
 

source/classes.tex

@@ -837,7 +837,7 @@
 if that member is not a bit-field. Its
 address is also the same as the address of each of its base class subobjects.
 \begin{note}
-There can therefore be unnamed padding within a standard-layout struct object
+There might therefore be unnamed padding within a standard-layout struct object
 inserted by an implementation, but
 not at its beginning, as necessary to achieve appropriate alignment.
 \end{note}
@@ -3613,7 +3613,7 @@
 
 \pnum
 \begin{note}
-A base class subobject can have a layout different
+A base class subobject might have a layout different
 from the layout of a most derived object of the same type. A base class
 subobject might have a polymorphic behavior\iref{class.cdtor}
 different from the polymorphic behavior of a most derived object of the
@@ -3705,7 +3705,7 @@
 \end{importgraphic}
 
 In such lattices, explicit qualification can be used to specify which
-subobject is meant. The body of function \tcode{C::f} can refer to the
+subobject is meant. The body of function \tcode{C::f} could refer to the
 member \tcode{next} of each \tcode{L} subobject:
 \begin{codeblock}
 void C::f() { A::next = B::next; }      // well-formed
@@ -3792,8 +3792,8 @@
 \begin{footnote}
 If
 all virtual functions are immediate functions,
-the class is still polymorphic even if
-its internal representation does not otherwise require
+the class is still polymorphic even though
+its internal representation might not otherwise require
 any additions for that polymorphic behavior.
 \end{footnote}
 
@@ -4158,7 +4158,7 @@
 \grammarterm{pure-specifier}\iref{class.mem} in the function declaration
 in the class definition.
 \begin{note}
-Such a function can be inherited: see below.
+Such a function might be inherited: see below.
 \end{note}
 A class is an \defnadj{abstract}{class}
 if it has at least one pure virtual function.

source/compatibility.tex

@@ -632,7 +632,7 @@
 active, and has been superseded by \tcode{uncaught_exceptions}.
 \effect
 A valid \CppXVII{} program that calls \tcode{std::uncaught_exception} may fail
-to compile. It can be revised to use \tcode{std::uncaught_exceptions} instead,
+to compile. It might be revised to use \tcode{std::uncaught_exceptions} instead,
 for clear and portable semantics.
 
 \nodiffref
@@ -2585,7 +2585,7 @@
 \difficulty
 Semantic transformation.
 To make the struct type name visible in the scope of the enclosing
-struct, the struct tag can be declared in the scope of the
+struct, the struct tag could be declared in the scope of the
 enclosing struct, before the enclosing struct is defined.
 Example:
 \begin{codeblock}
@@ -2597,7 +2597,7 @@
 
 All the definitions of C struct types enclosed in other struct
 definitions and accessed outside the scope of the enclosing
-struct can be exported to the scope of the enclosing struct.
+struct could be exported to the scope of the enclosing struct.
 Note: this is a consequence of the difference in scope rules,
 which is documented in \ref{basic.scope}.
 \howwide

source/concepts.tex

@@ -394,7 +394,7 @@
 are modeled, then \tcode{T} and \tcode{U} share a
 \term{common reference type}, \tcode{C}.
 \begin{note}
-\tcode{C} can be the same as \tcode{T} or \tcode{U}, or can be a
+\tcode{C} could be the same as \tcode{T}, or \tcode{U}, or it could be a
 different type. \tcode{C} can be a reference type.
 \end{note}
 
@@ -437,7 +437,7 @@
 \tcode{C}, then \tcode{T} and \tcode{U} share a \term{common type},
 \tcode{C}.
 \begin{note}
-\tcode{C} can be the same as \tcode{T} or \tcode{U}, or can be a
+\tcode{C} could be the same as \tcode{T}, or \tcode{U}, or it could be a
 different type. \tcode{C} might not be unique.
 \end{note}
 

source/declarations.tex

@@ -1236,7 +1236,7 @@
 Redundant cv-qualifications are ignored.
 \begin{note}
 For example,
-these can be introduced by typedefs.
+these could be introduced by typedefs.
 \end{note}
 
 \pnum
@@ -4610,7 +4610,7 @@
 this is the defining declaration\iref{basic.def} of the variable,
 but the initializing declaration
 of a non-inline static data member\iref{class.static.data}
-can be the declaration within the class definition
+might be the declaration within the class definition
 and not the definition at namespace scope.
 \end{note}
 
@@ -8200,7 +8200,7 @@
 \begin{note}
 Some of the properties associated with an entity with language linkage
 are specific to each implementation and are not described here. For
-example, a particular language linkage can be associated with a
+example, a particular language linkage might be associated with a
 particular form of representing names of objects and functions with
 external linkage, or with a particular calling convention, etc.
 \end{note}
@@ -9188,6 +9188,6 @@
 };
 \end{codeblock}
 Here, \tcode{hasher}, \tcode{pred}, and \tcode{alloc}
-can have the same address as \tcode{buckets}
+could have the same address as \tcode{buckets}
 if their respective types are all empty.
 \end{example}

source/expressions.tex

@@ -1685,7 +1685,7 @@
 or operator template is the \grammarterm{requires-clause}
 of the \grammarterm{lambda-declarator}, if any.
 \begin{note}
-The function call operator template for a generic lambda can be
+The function call operator template for a generic lambda might be
 an abbreviated function template\iref{dcl.fct}.
 \end{note}
 \begin{example}
@@ -2167,12 +2167,12 @@
   };
 }
 \end{codeblock}
-Within \tcode{g1}, an implementation can optimize away
+Within \tcode{g1}, an implementation might optimize away
 the capture of \tcode{x} as it is not odr-used.
 \end{example}
 \begin{note}
 The set of captured entities is determined syntactically,
-and entities can be implicitly captured
+and entities might be implicitly captured
 even if the expression denoting a local entity
 is within a discarded statement\iref{stmt.if}.
 \begin{example}
@@ -4319,7 +4319,7 @@
 The address of an overloaded function\iref{over} can be taken
 only in a context that uniquely determines which version of the
 overloaded function is referred to (see~\ref{over.over}).
-Since the context influences whether the operand is a static or
+Since the context might determine whether the operand is a static or
 non-static member function, the context can also affect whether the
 expression has type ``pointer to function'' or ``pointer to member
 function''.
@@ -6572,8 +6572,8 @@
 and the converted operand is used in place of the original operand for
 the remainder of this subclause.
 \begin{note}
-The conversion can be ill-formed even if an implicit conversion
-sequence can be formed.
+The conversion might be ill-formed even if an implicit conversion
+sequence could be formed.
 \end{note}
 
 \pnum
@@ -6828,7 +6828,7 @@
 \begin{note}
 This restriction applies to the relationship
 between the left and right sides of the assignment operation; it is not a
-statement about how the target of the assignment can be aliased in general.
+statement about how the target of the assignment might be aliased in general.
 See~\ref{basic.lval}.
 \end{note}
 

source/iterators.tex

@@ -2639,7 +2639,7 @@
 \begin{example}
 For a program-defined iterator
 \tcode{BinaryTreeIterator},
-it can be included
+it could be included
 into the bidirectional iterator category by specializing the
 \tcode{iterator_traits}
 template:

source/lib-intro.tex

@@ -308,20 +308,20 @@
 Failure to meet such a condition results in the function's silent non-viability.
 \end{note}
 \begin{example}
-An implementation can express such a condition
+An implementation might express such a condition
 via a \grammarterm{constraint-expression}\iref{temp.constr.decl}.
 \end{example}
 
 \item
 \mandates
 the conditions that, if not met, render the program ill-formed.
 \begin{example}
-An implementation can express such a condition
+An implementation might express such a condition
 via the \grammarterm{constant-expression}
 in a \grammarterm{static_assert-declaration}\iref{dcl.pre}.
 If the diagnostic is to be emitted only after the function
 has been selected by overload resolution,
-an implementation can express such a condition
+an implementation might express such a condition
 via a \grammarterm{constraint-expression}\iref{temp.constr.decl}
 and also define the function as deleted.
 \end{example}