Merge pull request #1054 from msebolt/format-standard-pr1

format standard pr1

Author: ktoliver

docs/standard-library/add-const-class.md

@@ -25,12 +25,12 @@ struct add_const;
 
 ### Parameters
 
-`Ty`
+*Ty*
  The type to modify.
 
 ## Remarks
 
-An instance of the type modifier holds a modified-type that is `Ty` if `Ty` is a reference, a function, or a const-qualified type, otherwise `const Ty`.
+An instance of the type modifier holds a modified-type that is *Ty* if *Ty* is a reference, a function, or a const-qualified type, otherwise `const Ty`.
 
 ## Example
 

docs/standard-library/add-cv-class.md

@@ -14,7 +14,7 @@ ms.workload: ["cplusplus"]
 ---
 # add_cv Class
 
-Makes const volatile type from type.
+Makes **const volatile** type from type.
 
 ## Syntax
 
@@ -33,7 +33,7 @@ The type to modify.
 
 ## Remarks
 
-An instance of the modified type `add_cv<T>` has a `type` member typedef equivalent to *T* modified by both [add_volatile](../standard-library/add-volatile-class.md) and [add_const](../standard-library/add-const-class.md), unless *T* already has the cv-qualifiers, is a reference, or is a function.
+An instance of the modified type `add_cv<T>` has a `type` member **typedef** equivalent to *T* modified by both [add_volatile](../standard-library/add-volatile-class.md) and [add_const](../standard-library/add-const-class.md), unless *T* already has the cv-qualifiers, is a reference, or is a function.
 
 The `add_cv_t<T>` helper type is a shortcut to access the `add_cv<T>` member typedef `type`.
 

docs/standard-library/add-lvalue-reference-class.md

@@ -28,12 +28,12 @@ using add_lvalue_reference_t = typename add_lvalue_reference<T>::type;
 
 ### Parameters
 
-`T`
+*T*
  The type to modify.
 
 ## Remarks
 
-An instance of the type modifier holds a modified-type that is `T` if `T` is an lvalue reference, otherwise `T&`.
+An instance of the type modifier holds a modified-type that is *T* if *T* is an lvalue reference, otherwise `T&`.
 
 ## Example
 

docs/standard-library/add-pointer-class.md

@@ -33,7 +33,7 @@ The type to modify.
 
 ## Remarks
 
-The member typedef `type` names the same type as `remove_reference<T>::type*`. The alias `add_pointer_t` is a shortcut to access the member typedef `type`.
+The member **typedef** `type` names the same type as `remove_reference<T>::type*`. The alias `add_pointer_t` is a shortcut to access the member **typedef** `type`.
 
 Because it is invalid to make a pointer from a reference, `add_pointer` removes the reference, if any, from the specified type before it makes a pointer-to-type. Consequently, you can use a type with `add_pointer` without being concerned about whether the type is a reference.
 

docs/standard-library/add-rvalue-reference-class.md

@@ -28,12 +28,12 @@ using add_rvalue_reference_t = typename add_rvalue_reference<T>::type;
 
 ### Parameters
 
-T
+*T*
  The type to modify.
 
 ## Remarks
 
-The `add_rvalue_reference` class has a member named `type`, which is an alias for the type of an rvalue reference to the template parameter `T`. The semantics of reference collapsing imply that, for non-object and non-function types `T`, `T&&` is a `T`. For example, when `T` is an lvalue reference type, `add_rvalue_reference<T>::type` is the lvalue reference type, not an rvalue reference.
+The `add_rvalue_reference` class has a member named `type`, which is an alias for the type of an rvalue reference to the template parameter *T*. The semantics of reference collapsing imply that, for non-object and non-function types *T*, `T&&` is a *T*. For example, when *T* is an lvalue reference type, `add_rvalue_reference<T>::type` is the lvalue reference type, not an rvalue reference.
 
 For convenience, \<type_traits> defines a helper template, `add_rvalue_reference_t`, that aliases the `type` member of `add_rvalue_reference`.
 

docs/standard-library/add-volatile-class.md

@@ -14,7 +14,7 @@ ms.workload: ["cplusplus"]
 ---
 # add_volatile Class
 
-Makes a volatile type from the specified type.
+Makes a **volatile** type from the specified type.
 
 ## Syntax
 
@@ -33,7 +33,7 @@ The type to modify.
 
 ## Remarks
 
-An instance of `add_volatile<T>` has a member typedef `type` that is *T* if *T* is a reference, a function, or a volatile-qualified type, otherwise `volatile` *T*. The alias `add_volatile_t` is a shortcut to access the member typedef `type`.
+An instance of `add_volatile<T>` has a member **typedef** `type` that is *T* if *T* is a reference, a function, or a volatile-qualified type, otherwise **volatile** *T*. The alias `add_volatile_t` is a shortcut to access the member **typedef** `type`.
 
 ## Example
 

docs/standard-library/algorithm-functions.md

@@ -43,12 +43,12 @@ The C++ Standard Library numeric algorithms that are provided for numerical proc
 |Function template|Description|
 |-|-|
 |[adjacent_find](../standard-library/algorithm-functions.md#adjacent_find)|Searches for two adjacent elements that are either equal or satisfy a specified condition.|
-|[all_of](../standard-library/algorithm-functions.md#all_of)|Returns `true` when a condition is present at each element in the given range.|
-|[any_of](../standard-library/algorithm-functions.md#any_of)|Returns `true` when a condition is present at least once in the specified range of elements.|
+|[all_of](../standard-library/algorithm-functions.md#all_of)|Returns **true** when a condition is present at each element in the given range.|
+|[any_of](../standard-library/algorithm-functions.md#any_of)|Returns **true** when a condition is present at least once in the specified range of elements.|
 |[binary_search](../standard-library/algorithm-functions.md#binary_search)|Tests whether there is an element in a sorted range that is equal to a specified value or that is equivalent to it in a sense specified by a binary predicate.|
 |[copy](../standard-library/algorithm-functions.md#copy)|Assigns the values of elements from a source range to a destination range, iterating through the source sequence of elements and assigning them new positions in a forward direction.|
 |[copy_backward](../standard-library/algorithm-functions.md#copy_backward)|Assigns the values of elements from a source range to a destination range, iterating through the source sequence of elements and assigning them new positions in a backward direction.|
-|[copy_if](../standard-library/algorithm-functions.md#copy_if)|Copy all elements in a given range that test `true` for a specified condition|
+|[copy_if](../standard-library/algorithm-functions.md#copy_if)|Copy all elements in a given range that test **true** for a specified condition|
 |[copy_n](../standard-library/algorithm-functions.md#copy_n)|Copies a specified number of elements.|
 |[count](../standard-library/algorithm-functions.md#count)|Returns the number of elements in a range whose values match a specified value.|
 |[count_if](../standard-library/algorithm-functions.md#count_if)|Returns the number of elements in a range whose values match a specified condition.|
@@ -66,12 +66,12 @@ The C++ Standard Library numeric algorithms that are provided for numerical proc
 |[generate_n](../standard-library/algorithm-functions.md#generate_n)|Assigns the values generated by a function object to a specified number of element is a range and returns to the position one past the last assigned value.|
 |[includes](../standard-library/algorithm-functions.md#includes)|Tests whether one sorted range contains all the elements contained in a second sorted range, where the ordering or equivalence criterion between elements may be specified by a binary predicate.|
 |[inplace_merge](../standard-library/algorithm-functions.md#inplace_merge)|Combines the elements from two consecutive sorted ranges into a single sorted range, where the ordering criterion may be specified by a binary predicate.|
-|[is_heap](../standard-library/algorithm-functions.md#is_heap)|Returns `true` if the elements in the specified range form a heap.|
-|[is_heap_until](../standard-library/algorithm-functions.md#is_heap_until)|Returns `true` if the specified range forms a heap until the last element.|
-|[is_partitioned](../standard-library/algorithm-functions.md#is_partitioned)|Returns `true` if all the elements in the given range that test `true` for a condition come before any elements that test `false`.|
+|[is_heap](../standard-library/algorithm-functions.md#is_heap)|Returns **true** if the elements in the specified range form a heap.|
+|[is_heap_until](../standard-library/algorithm-functions.md#is_heap_until)|Returns **true** if the specified range forms a heap until the last element.|
+|[is_partitioned](../standard-library/algorithm-functions.md#is_partitioned)|Returns **true** if all the elements in the given range that test **true** for a condition come before any elements that test **false**.|
 |[is_permutation](../standard-library/algorithm-functions.md#is_permutation)|Determines whether the elements in a given range form a valid permutation.|
-|[is_sorted](../standard-library/algorithm-functions.md#is_sorted)|Returns `true` if the elements in the specified range are in sorted order.|
-|[is_sorted_until](../standard-library/algorithm-functions.md#is_sorted_until)|Returns `true` if the elements in the specified range are in sorted order.|
+|[is_sorted](../standard-library/algorithm-functions.md#is_sorted)|Returns **true** if the elements in the specified range are in sorted order.|
+|[is_sorted_until](../standard-library/algorithm-functions.md#is_sorted_until)|Returns **true** if the elements in the specified range are in sorted order.|
 |[iter_swap](../standard-library/algorithm-functions.md#iter_swap)|Exchanges two values referred to by a pair of specified iterators.|
 |[lexicographical_compare](../standard-library/algorithm-functions.md#lexicographical_compare)|Compares element by element between two sequences to determine which is lesser of the two.|
 |[lower_bound](../standard-library/algorithm-functions.md#lower_bound)|Finds the position of the first element in an ordered range that has a value greater than or equivalent to a specified value, where the ordering criterion may be specified by a binary predicate.|
@@ -87,12 +87,12 @@ The C++ Standard Library numeric algorithms that are provided for numerical proc
 |[<alg> move](../standard-library/algorithm-functions.md#alg_move)|Move elements associated with a specified range.|
 |[move_backward](../standard-library/algorithm-functions.md#move_backward)|Moves the elements of one iterator to another. The move starts with the last element in a specified range, and ends with the first element in that range.|
 |[next_permutation](../standard-library/algorithm-functions.md#next_permutation)|Reorders the elements in a range so that the original ordering is replaced by the lexicographically next greater permutation if it exists, where the sense of next may be specified with a binary predicate.|
-|[none_of](../standard-library/algorithm-functions.md#none_of)|Returns `true` when a condition is never present among elements in the given range.|
+|[none_of](../standard-library/algorithm-functions.md#none_of)|Returns **true** when a condition is never present among elements in the given range.|
 |[nth_element](../standard-library/algorithm-functions.md#nth_element)|Partitions a range of elements, correctly locating the *n*th element of the sequence in the range so that all the elements in front of it are less than or equal to it and all the elements that follow it in the sequence are greater than or equal to it.|
 |[partial_sort](../standard-library/algorithm-functions.md#partial_sort)|Arranges a specified number of the smaller elements in a range into a nondescending order or according to an ordering criterion specified by a binary predicate.|
 |[partial_sort_copy](../standard-library/algorithm-functions.md#partial_sort_copy)|Copies elements from a source range into a destination range where the source elements are ordered by either less than or another specified binary predicate.|
 |[partition](../standard-library/algorithm-functions.md#partition)|Classifies elements in a range into two disjoint sets, with those elements satisfying a unary predicate preceding those that fail to satisfy it.|
-|[partition_copy](../standard-library/algorithm-functions.md#partition_copy)|Copies elements for which a condition is `true` to one destination, and for which the condition is `false` to another. The elements must come from a specified range.|
+|[partition_copy](../standard-library/algorithm-functions.md#partition_copy)|Copies elements for which a condition is **true** to one destination, and for which the condition is **false** to another. The elements must come from a specified range.|
 |[partition_point](../standard-library/algorithm-functions.md#partition_point)|Returns the first element in the given range that does not satisfy the condition. The elements are sorted so that those that satisfy the condition come before those that do not.|
 |[pop_heap](../standard-library/algorithm-functions.md#pop_heap)|Removes the largest element from the front of a heap to the next-to-last position in the range and then forms a new heap from the remaining elements.|
 |[prev_permutation](../standard-library/algorithm-functions.md#prev_permutation)|Reorders the elements in a range so that the original ordering is replaced by the lexicographically next greater permutation if it exists, where the sense of next may be specified with a binary predicate.|

docs/standard-library/algorithm.md

@@ -29,7 +29,7 @@ The descriptions of the algorithm template functions employ several shorthand ph
 
 - Expressions such as *X* - *Y*, where *X* and *Y* can be iterators other than random-access iterators, are intended in the mathematical sense. The function does not necessarily evaluate operator**-** if it must determine such a value. The same is also true for expressions such as *X* + *N* and *X* - *N*, where *N* is an integer type.
 
-Several algorithms make use of a predicate that performs a pairwise comparison, such as with `operator==`, to yield a `bool` result. The predicate function `operator==`, or any replacement for it, must not alter either of its operands. It must yield the same `bool` result every time it is evaluated, and it must yield the same result if a copy of either operand is substituted for the operand.
+Several algorithms make use of a predicate that performs a pairwise comparison, such as with `operator==`, to yield a **bool** result. The predicate function `operator==`, or any replacement for it, must not alter either of its operands. It must yield the same **bool** result every time it is evaluated, and it must yield the same result if a copy of either operand is substituted for the operand.
 
 Several algorithms make use of a predicate that must impose a strict weak ordering on pairs of elements from a sequence. For the predicate `pr`(*X*, *Y*):
 
@@ -39,11 +39,11 @@ Several algorithms make use of a predicate that must impose a strict weak orderi
 
 - Ordering means that `pr`(*X*, *Y*) && `pr`(*Y*, Z) implies `pr`(*X*, Z).
 
-Some of these algorithms implicitly use the predicate *X* \< *Y*. Other predicates that typically satisfy the strict weak ordering requirement are *X* > *Y*, **less**(*X*, *Y*), and `greater`(*X*, *Y*). Note, however, that predicates such as *X* \<= *Y* and *X* >= *Y* do not satisfy this requirement.
+Some of these algorithms implicitly use the predicate *X* \< *Y*. Other predicates that typically satisfy the strict weak ordering requirement are *X* > *Y*, `less`(*X*, *Y*), and `greater`(*X*, *Y*). Note, however, that predicates such as *X* \<= *Y* and *X* >= *Y* do not satisfy this requirement.
 
-A sequence of elements designated by iterators in the range [`First`, `Last`) is a sequence ordered by operator**<** if, for each *N* in the range [0, `Last` - `First`) and for each *M* in the range (N, `Last` - `First`) the predicate !(\*(`First` + *M*) < \*(*First* + *N*)) is true. (Note that the elements are sorted in ascending order.) The predicate function **operator<**, or any replacement for it, must not alter either of its operands. It must yield the same `bool` result every time it is evaluated, and it must yield the same result if a copy of either operand is substituted for the operand. Moreover, it must impose a strict weak ordering on the operands it compares.
+A sequence of elements designated by iterators in the range [`First`, `Last`) is a sequence ordered by operator**<** if, for each *N* in the range [0, `Last` - `First`) and for each *M* in the range (N, `Last` - `First`) the predicate !(\*(`First` + *M*) < \*(*First* + *N*)) is true. (Note that the elements are sorted in ascending order.) The predicate function `operator<`, or any replacement for it, must not alter either of its operands. It must yield the same `bool` result every time it is evaluated, and it must yield the same result if a copy of either operand is substituted for the operand. Moreover, it must impose a strict weak ordering on the operands it compares.
 
-A sequence of elements designated by iterators in the range [`First`, `Last`) is a heap ordered by **operator<** if, for each *N* in the range [1, `Last` - `First`) the predicate !(\*`First` < \*(`First` + *N*)) is true. (The first element is the largest.) Its internal structure is otherwise known only to the template functions [make_heap](../standard-library/algorithm-functions.md#make_heap), [pop_heap](../standard-library/algorithm-functions.md#pop_heap), and [push_heap](../standard-library/algorithm-functions.md#push_heap). As with an ordered sequence, the predicate function **operator<**, or any replacement for it, must not alter either of its operands, and it must impose a strict weak ordering on the operands it compares. It must yield the same `bool` result every time it is evaluated, and it must yield the same result if a copy of either operand is substituted for the operand.
+A sequence of elements designated by iterators in the range [`First`, `Last`) is a heap ordered by `operator<` if, for each *N* in the range [1, `Last` - `First`) the predicate !(\*`First` < \*(`First` + *N*)) is true. (The first element is the largest.) Its internal structure is otherwise known only to the template functions [make_heap](../standard-library/algorithm-functions.md#make_heap), [pop_heap](../standard-library/algorithm-functions.md#pop_heap), and [push_heap](../standard-library/algorithm-functions.md#push_heap). As with an ordered sequence, the predicate function `operator<`, or any replacement for it, must not alter either of its operands, and it must impose a strict weak ordering on the operands it compares. It must yield the same **bool** result every time it is evaluated, and it must yield the same result if a copy of either operand is substituted for the operand.
 
 The C++ Standard Library algorithms are located in the [\<algorithm>](../standard-library/algorithm.md) and [\<numeric>](../standard-library/numeric.md) header files.
 

docs/standard-library/algorithms.md

@@ -28,15 +28,15 @@ using aligned_storage_t = typename aligned_storage<Len, Align>::type;
 
 ### Parameters
 
-`Len`
+*Len*
  The object size.
 
-`Align`
+*Align*
  The object alignment.
 
 ## Remarks
 
-The template member typedef `type` is a synonym for a POD type with alignment `Align` and size `Len`. `Align` must be equal to `alignment_of<T>::value` for some type `T`, or to the default alignment.
+The template member typedef `type` is a synonym for a POD type with alignment *Align* and size *Len*. *Align* must be equal to `alignment_of<T>::value` for some type `T`, or to the default alignment.
 
 ## Example
 

docs/standard-library/aligned-storage-class.md

@@ -28,15 +28,15 @@ using aligned_union_t = typename aligned_union<Len, Types...>::type;
 
 ### Parameters
 
-`Len`
+*Len*
  The alignment value for the largest type in the union.
 
-`Types`
+*Types*
  The distinct types in the underlying union.
 
 ## Remarks
 
-Use the template class to get the alignment and size needed to store a union in uninitialized storage. The member typedef `type` names a POD type suitable for storage of any type listed in `Types`; the minimum size is `Len`. The static member `alignment_value` of type `std::size_t` contains the strictest alignment required of all the types listed in `Types`.
+Use the template class to get the alignment and size needed to store a union in uninitialized storage. The member typedef `type` names a POD type suitable for storage of any type listed in *Types*; the minimum size is *Len*. The static member `alignment_value` of type `std::size_t` contains the strictest alignment required of all the types listed in *Types*.
 
 ## Example