Merge pull request MicrosoftDocs#1056 from msebolt/format-standard-pr3

format standard pr3

Author: rmca14

docs/standard-library/cache-chunklist-class.md

@@ -27,13 +27,13 @@ class cache_chunklist
 
 |Parameter|Description|
 |---------------|-----------------|
-|`Sz`|The number of elements in the array to be allocated.|
+|*Sz*|The number of elements in the array to be allocated.|
 
 ## Remarks
 
-This template class uses `operator new` to allocate chunks of raw memory, suballocating blocks to allocate storage for a memory block when needed; it stores deallocated memory blocks in a separate free list for each chunk, and uses `operator delete` to deallocate a chunk when none of its memory blocks is in use.
+This template class uses **operator new** to allocate chunks of raw memory, suballocating blocks to allocate storage for a memory block when needed; it stores deallocated memory blocks in a separate free list for each chunk, and uses **operator delete** to deallocate a chunk when none of its memory blocks is in use.
 
-Each memory block holds `Sz` bytes of usable memory and a pointer to the chunk that it belongs to. Each chunk holds `Nelts` memory blocks, three pointers, an int and the data that `operator new` and `operator delete` require.
+Each memory block holds *Sz* bytes of usable memory and a pointer to the chunk that it belongs to. Each chunk holds `Nelts` memory blocks, three pointers, an int and the data that **operator new** and **operator delete** require.
 
 ### Constructors
 
@@ -66,7 +66,7 @@ void *allocate(std::size_t count);
 
 |Parameter|Description|
 |---------------|-----------------|
-|`count`|The number of elements in the array to be allocated.|
+|*count*|The number of elements in the array to be allocated.|
 
 ### Return Value
 
@@ -96,8 +96,8 @@ void deallocate(void* ptr, std::size_t count);
 
 |Parameter|Description|
 |---------------|-----------------|
-|`ptr`|A pointer to the first object to be deallocated from storage.|
-|`count`|The number of objects to be deallocated from storage.|
+|*ptr*|A pointer to the first object to be deallocated from storage.|
+|*count*|The number of objects to be deallocated from storage.|
 
 ### Remarks
 

docs/standard-library/cache-freelist-class.md

@@ -27,14 +27,14 @@ class cache_freelist
 
 |Parameter|Description|
 |---------------|-----------------|
-|`Sz`|The number of elements in the array to be allocated.|
-|`Max`|The max class representing the maximum size of the free list. This can be [max_fixed_size](../standard-library/max-fixed-size-class.md), [max_none](../standard-library/max-none-class.md), [max_unbounded](../standard-library/max-unbounded-class.md), or [max_variable_size](../standard-library/max-variable-size-class.md).|
+|*Sz*|The number of elements in the array to be allocated.|
+|*Max*|The max class representing the maximum size of the free list. This can be [max_fixed_size](../standard-library/max-fixed-size-class.md), [max_none](../standard-library/max-none-class.md), [max_unbounded](../standard-library/max-unbounded-class.md), or [max_variable_size](../standard-library/max-variable-size-class.md).|
 
 ## Remarks
 
-The cache_freelist template class maintains a free list of memory blocks of size `Sz`. When the free list is full it uses `operator delete` to deallocate memory blocks. When the free list is empty it uses `operator new` to allocate new memory blocks. The maximum size of the free list is determined by the class max class passed in the `Max` parameter.
+The cache_freelist template class maintains a free list of memory blocks of size *Sz*. When the free list is full it uses **operator delete** to deallocate memory blocks. When the free list is empty it uses **operator new** to allocate new memory blocks. The maximum size of the free list is determined by the class max class passed in the *Max* parameter.
 
-Each memory block holds `Sz` bytes of usable memory and the data that `operator new` and `operator delete` require.
+Each memory block holds *Sz* bytes of usable memory and the data that **operator new** and **operator delete** require.
 
 ### Constructors
 
@@ -67,7 +67,7 @@ void *allocate(std::size_t count);
 
 |Parameter|Description|
 |---------------|-----------------|
-|`count`|The number of elements in the array to be allocated.|
+|*count*|The number of elements in the array to be allocated.|
 
 ### Return Value
 
@@ -97,8 +97,8 @@ void deallocate(void* ptr, std::size_t count);
 
 |Parameter|Description|
 |---------------|-----------------|
-|`ptr`|A pointer to the first object to be deallocated from storage.|
-|`count`|The number of objects to be deallocated from storage.|
+|*ptr*|A pointer to the first object to be deallocated from storage.|
+|*count*|The number of objects to be deallocated from storage.|
 
 ### Remarks
 

docs/standard-library/cache-suballoc-class.md

@@ -27,13 +27,13 @@ class cache_suballoc
 
 |Parameter|Description|
 |---------------|-----------------|
-|`Sz`|The number of elements in the array to be allocated.|
+|*Sz*|The number of elements in the array to be allocated.|
 
 ## Remarks
 
-The cache_suballoc template class stores deallocated memory blocks in a free list with unbounded length, using `freelist<sizeof(Type), max_unbounded>`, and suballocates memory blocks from a larger chunk allocated with `operator new` when the free list is empty.
+The cache_suballoc template class stores deallocated memory blocks in a free list with unbounded length, using `freelist<sizeof(Type), max_unbounded>`, and suballocates memory blocks from a larger chunk allocated with **operator new** when the free list is empty.
 
-Each chunk holds `Sz * Nelts` bytes of usable memory and the data that `operator new` and `operator delete` require. Allocated chunks are never freed.
+Each chunk holds `Sz * Nelts` bytes of usable memory and the data that **operator new** and **operator delete** require. Allocated chunks are never freed.
 
 ### Constructors
 
@@ -66,7 +66,7 @@ void *allocate(std::size_t count);
 
 |Parameter|Description|
 |---------------|-----------------|
-|`count`|The number of elements in the array to be allocated.|
+|*count*|The number of elements in the array to be allocated.|
 
 ### Return Value
 
@@ -96,8 +96,8 @@ void deallocate(void* ptr, std::size_t count);
 
 |Parameter|Description|
 |---------------|-----------------|
-|`ptr`|A pointer to the first object to be deallocated from storage.|
-|`count`|The number of objects to be deallocated from storage.|
+|*ptr*|A pointer to the first object to be deallocated from storage.|
+|*count*|The number of objects to be deallocated from storage.|
 
 ### Remarks
 

docs/standard-library/cauchy-distribution-class.md

@@ -50,14 +50,14 @@ public:
 ### Parameters
 
 *RealType*
-The floating-point result type, defaults to `double`. For possible types, see [\<random>](../standard-library/random.md).
+The floating-point result type, defaults to **double**. For possible types, see [\<random>](../standard-library/random.md).
 
 *URNG*
 The uniform random number generator engine. For possible types, see [\<random>](../standard-library/random.md).
 
 ## Remarks
 
-The template class describes a distribution that produces values of a user-specified floating-point type, or type `double` if none is provided, distributed according to the Cauchy Distribution. The following table links to articles about individual members.
+The template class describes a distribution that produces values of a user-specified floating-point type, or type **double** if none is provided, distributed according to the Cauchy Distribution. The following table links to articles about individual members.
 
 ||||
 |-|-|-|

docs/standard-library/char-traits-char-struct.md

@@ -14,7 +14,7 @@ ms.workload: ["cplusplus"]
 ---
 # char_traits<char> Struct
 
-A struct that is a specialization of the template struct **char_traits\<CharType>** to an element of type `char`.
+A struct that is a specialization of the template struct **char_traits\<CharType>** to an element of type **char**.
 
 ## Syntax
 
@@ -25,7 +25,7 @@ struct char_traits<char>;
 
 ## Remarks
 
-Specialization allows the struct to take advantage of library functions that manipulate objects of this type `char`.
+Specialization allows the struct to take advantage of library functions that manipulate objects of this type **char**.
 
 ## Example