true false update

mtx48109 · mtx48109 · commit 83654db7312d · 2018-07-10T12:50:00.000-07:00
diff --git a/docs/standard-library/hash-map-class.md b/docs/standard-library/hash-map-class.md
@@ -67,7 +67,7 @@ The hash_map should be the associative container of choice when the conditions a
 
 The hash_map orders the sequence it controls by calling a stored hash *Traits* object of class [value_compare](../standard-library/value-compare-class.md). This stored object may be accessed by calling the member function [key_comp](#key_comp). Such a function object must behave the same as an object of class [hash_compare](../standard-library/hash-compare-class.md)<Key, less\<Key>>. Specifically, for all values *Key* of type *Key*, the call `Traits`( `Key` ) yields a distribution of values of type `size_t`.
 
-In general, the elements need be merely less than comparable to establish this order: so that, given any two elements, it may be determined either that they are equivalent (in the sense that neither is less than the other) or that one is less than the other. This results in an ordering between the nonequivalent elements. On a more technical note, the comparison function is a binary predicate that induces a strict weak ordering in the standard mathematical sense. A binary predicate f(x y) is a function object that has two argument objects `x` and `y` and a return value of `true` or `false`. An ordering imposed on a hash_map is a strict weak ordering if the binary predicate is irreflexive, antisymmetric, and transitive and if equivalence is transitive, where two objects x and y are defined to be equivalent when both f(x, y) and f(y, x) are false. If the stronger condition of equality between keys replaces that of equivalence, then the ordering becomes total (in the sense that all the elements are ordered with respect to each other) and the keys matched will be indiscernible from each other.
+In general, the elements need be merely less than comparable to establish this order: so that, given any two elements, it may be determined either that they are equivalent (in the sense that neither is less than the other) or that one is less than the other. This results in an ordering between the nonequivalent elements. On a more technical note, the comparison function is a binary predicate that induces a strict weak ordering in the standard mathematical sense. A binary predicate f(x y) is a function object that has two argument objects `x` and `y` and a return value of **true** or **false**. An ordering imposed on a hash_map is a strict weak ordering if the binary predicate is irreflexive, antisymmetric, and transitive and if equivalence is transitive, where two objects x and y are defined to be equivalent when both f(x, y) and f(y, x) are false. If the stronger condition of equality between keys replaces that of equivalence, then the ordering becomes total (in the sense that all the elements are ordered with respect to each other) and the keys matched will be indiscernible from each other.
 
 The actual order of elements in the controlled sequence depends on the hash function, the ordering function, and the current size of the hash table stored in the container object. You cannot determine the current size of the hash table, so you cannot in general predict the order of elements in the controlled sequence. Inserting elements invalidates no iterators, and removing elements invalidates only those iterators that had specifically pointed at the removed elements.
 
diff --git a/docs/standard-library/hash-multimap-class.md b/docs/standard-library/hash-multimap-class.md
@@ -67,7 +67,7 @@ The hash_multimap should be the associative container of choice when the conditi
 
 The hash_multimap orders the sequence it controls by calling a stored hash `Traits` object of type [value_compare](../standard-library/value-compare-class.md). This stored object may be accessed by calling the member function [key_comp](../standard-library/hash-map-class.md#key_comp). Such a function object must behave the same as an object of class [hash_compare](../standard-library/hash-compare-class.md)`<Key, less<Key>>`. Specifically, for all values `Key` of type `Key`, the call `Traits (Key)` yields a distribution of values of type `size_t`.
 
-In general, the elements need be merely less than comparable to establish this order: so that, given any two elements, it may be determined either that they are equivalent (in the sense that neither is less than the other) or that one is less than the other. This results in an ordering between the non-equivalent elements. On a more technical note, the comparison function is a binary predicate that induces a strict weak ordering in the standard mathematical sense. A binary predicate f(x, y) is a function object that has two argument objects `x` and `y` and a return value of `true` or `false`. An ordering imposed on a hash_multimap is a strict weak ordering if the binary predicate is irreflexive, antisymmetric, and transitive and if equivalence is transitive, where two objects `x` and `y` are defined to be equivalent when both f(x, y) and f(y, x) are `false`. If the stronger condition of equality between keys replaces that of equivalence, then the ordering becomes total (in the sense that all the elements are ordered with respect to each other) and the keys matched will be indiscernible from each other.
+In general, the elements need be merely less than comparable to establish this order: so that, given any two elements, it may be determined either that they are equivalent (in the sense that neither is less than the other) or that one is less than the other. This results in an ordering between the non-equivalent elements. On a more technical note, the comparison function is a binary predicate that induces a strict weak ordering in the standard mathematical sense. A binary predicate f(x, y) is a function object that has two argument objects `x` and `y` and a return value of **true** or **false**. An ordering imposed on a hash_multimap is a strict weak ordering if the binary predicate is irreflexive, antisymmetric, and transitive and if equivalence is transitive, where two objects `x` and `y` are defined to be equivalent when both f(x, y) and f(y, x) are **false**. If the stronger condition of equality between keys replaces that of equivalence, then the ordering becomes total (in the sense that all the elements are ordered with respect to each other) and the keys matched will be indiscernible from each other.
 
 The actual order of elements in the controlled sequence depends on the hash function, the ordering function, and the current size of the hash table stored in the container object. You cannot determine the current size of the hash table, so you cannot in general predict the order of elements in the controlled sequence. Inserting elements invalidates no iterators, and removing elements invalidates only those iterators that had specifically pointed at the removed elements.
 
diff --git a/docs/standard-library/hash-set-class.md b/docs/standard-library/hash-set-class.md
@@ -726,7 +726,7 @@ emplace(
 
 ### Return Value
 
-The `emplace` member function returns a pair whose **bool** component returns `true` if an insertion was make and `false` if the `hash_set` already contained an element whose key had an equivalent value in the ordering, and whose iterator component returns the address where a new element was inserted or where the element was already located.
+The `emplace` member function returns a pair whose **bool** component returns **true** if an insertion was make and **false** if the `hash_set` already contained an element whose key had an equivalent value in the ordering, and whose iterator component returns the address where a new element was inserted or where the element was already located.
 
 ### Remarks
 
@@ -1401,7 +1401,7 @@ void insert(
 
 ### Return Value
 
-The first `insert` member function returns a pair whose **bool** component returns `true` if an insertion was make and `false` if the `hash_set` already contained an element whose key had an equivalent value in the ordering, and whose iterator component returns the address where a new element was inserted or where the element was already located.
+The first `insert` member function returns a pair whose **bool** component returns **true** if an insertion was make and **false** if the `hash_set` already contained an element whose key had an equivalent value in the ordering, and whose iterator component returns the address where a new element was inserted or where the element was already located.
 
 To access the iterator component of a pair `pr` returned by this member function, use `pr.first` and to dereference it, use `*(pr.first)`. To access the **bool** component of a pair `pr` returned by this member function, use `pr.second`, and to dereference it, use `*(pr.second)`.
 
diff --git a/docs/standard-library/iomanip-functions.md b/docs/standard-library/iomanip-functions.md
@@ -31,7 +31,7 @@ T7 get_money(Money& _Amount, bool _Intl);
  The extracted monetary value.
 
 *_Intl*
- If `true`, use international format. The default value is `false`.
+ If **true**, use international format. The default value is **false**.
 
 ### Remarks
 
@@ -75,7 +75,7 @@ T8 put_money(const Money& _Amount, bool _Intl);
  The monetary amount to insert into the stream.
 
 *_Intl*
- Set to `true` if manipulator should use international format, `false` if it should not.
+ Set to **true** if manipulator should use international format, **false** if it should not.
 
 ### Return Value
 
diff --git a/docs/standard-library/ios-base-class.md b/docs/standard-library/ios-base-class.md
@@ -65,7 +65,7 @@ An object of class ios_base also stores stream state information, in an object o
 |[basefield](#fmtflags)|A bitmask defined as `dec` &#124; `hex` &#124; `oct`.|
 |[beg](#seekdir)|Specifies seeking relative to the beginning of a sequence.|
 |[binary](#openmode)|Specifies that a file should be read as a binary stream, rather than as a text stream.|
-|[boolalpha](#fmtflags)|Specifies insertion or extraction of objects of type **bool** as names (such as `true` and `false`) rather than as numeric values.|
+|[boolalpha](#fmtflags)|Specifies insertion or extraction of objects of type **bool** as names (such as **true** and **false**) rather than as numeric values.|
 |[cur](#seekdir)|Specifies seeking relative to the current position within a sequence.|
 |[dec](#fmtflags)|Specifies insertion or extraction of integer values in decimal format.|
 |[end](#seekdir)|Specifies seeking relative to the end of a sequence.|
@@ -324,7 +324,7 @@ The type is a bitmask type that describes an object that can store format flags.
 
 - `right`, to pad to a field width as needed by inserting fill characters at the beginning of a generated field (right justification).
 
-- `boolalpha`, to insert or extract objects of type **bool** as names (such as `true` and `false`) rather than as numeric values.
+- `boolalpha`, to insert or extract objects of type **bool** as names (such as **true** and **false**) rather than as numeric values.
 
 - `fixed`, to insert floating-point values in fixed-point format (with no exponent field).
 
