[description] - C++11 → C++14

Files changed (1) hide show

tmp/tmpb_vm9owi/{from.md → to.md} RENAMED Viewed

@@ -60,11 +60,11 @@ Requirements are stated in terms of well-defined expressions that define
 valid terms of the types that satisfy the requirements. For every set of
 well-defined expression requirements there is a table that specifies an
 initial set of the valid expressions and their semantics. Any generic
 algorithm (Clause  [[algorithms]]) that uses the well-defined expression
 requirements is described in terms of the valid expressions for its
-formal type parameters.
 Template argument requirements are sometimes referenced by name. See
 [[type.descriptions]].
 In some cases the semantic requirements are presented as C++code. Such
@@ -239,21 +239,22 @@ bitmask{}& operator^=(bitmask{}& X, bitmask{} Y) {
   X = X ^ Y; return X;
 }
 ```
 Here, the names *C0*, *C1*, etc. represent *bitmask elements* for this
-particular bitmask type. All such elements have distinct values such
-that, for any pair *Ci* and *Cj*, *Ci* & *Ci* is nonzero and *Ci* & *Cj*
-is zero.
 The following terms apply to objects and values of bitmask types:
 - To *set* a value *Y* in an object *X* is to evaluate the expression
-  *X* |= *Y*.
 - To *clear* a value *Y* in an object *X* is to evaluate the expression
-  *X* &= ~*Y*.
-- The value *Y* *is set* in the object *X* if the expression *X* & *Y*
   is nonzero.
 ##### Character sequences <a id="character.seq">[[character.seq]]</a>
 The C standard library makes widespread use of characters and character

 valid terms of the types that satisfy the requirements. For every set of
 well-defined expression requirements there is a table that specifies an
 initial set of the valid expressions and their semantics. Any generic
 algorithm (Clause  [[algorithms]]) that uses the well-defined expression
 requirements is described in terms of the valid expressions for its
+template type parameters.
 Template argument requirements are sometimes referenced by name. See
 [[type.descriptions]].
 In some cases the semantic requirements are presented as C++code. Such
   X = X ^ Y; return X;
 }
 ```
 Here, the names *C0*, *C1*, etc. represent *bitmask elements* for this
+particular bitmask type. All such elements have distinct, nonzero values
+such that, for any pair *Ci* and *Cj* where *i* != *j*, *Ci* & *Ci* is
+nonzero and *Ci* & *Cj* is zero. Additionally, the value 0 is used to
+represent an *empty bitmask*, in which no bitmask elements are set.
 The following terms apply to objects and values of bitmask types:
 - To *set* a value *Y* in an object *X* is to evaluate the expression
+  *X* `|=` *Y*.
 - To *clear* a value *Y* in an object *X* is to evaluate the expression
+  *X* `&= ~`*Y*.
+- The value *Y* *is set* in the object *X* if the expression *X* `&` *Y*
   is nonzero.
 ##### Character sequences <a id="character.seq">[[character.seq]]</a>
 The C standard library makes widespread use of characters and character

Diff to HTML by rtfpessoa