1769497, fixed typos.

john-par · john-par · commit ba940dc35015 · 2020-10-07T10:47:59.000-07:00
diff --git a/docs/cpp/static-assert.md b/docs/cpp/static-assert.md
@@ -35,7 +35,7 @@ The compiler examines the **`static_assert`** declaration for syntax errors when
 
 You can use the **`static_assert`** keyword at namespace, class, or block scope. (The **`static_assert`** keyword is technically a declaration, even though it does not introduce new name into your program, because it can be used at namespace scope.)
 
-## Description of static_assert with namespace scope
+## Description of `static_assert` with namespace scope
 
 In the following example, the **`static_assert`** declaration has namespace scope. Because the compiler knows the size of type `void *`, the expression is evaluated immediately.
 
@@ -45,7 +45,7 @@ In the following example, the **`static_assert`** declaration has namespace scop
 static_assert(sizeof(void *) == 4, "64-bit code generation is not supported.");
 ```
 
-## Description of static_assert with class scope
+## Description of `static_assert` with class scope
 
 In the following example, the **`static_assert`** declaration has class scope. The **`static_assert`** verifies that a template parameter is a *plain old data* (POD) type. The compiler examines the **`static_assert`** declaration when it is declared, but does not evaluate the *constant-expression* parameter until the `basic_string` class template is instantiated in `main()`.
 
diff --git a/docs/cpp/using-declaration.md b/docs/cpp/using-declaration.md
@@ -116,7 +116,7 @@ int main() {
 In B::f()
 ```
 
-## Example: using declaration with explicit qualification
+## Example: `using` declaration with explicit qualification
 
 Members declared by using a using declaration can be referenced by using explicit qualification. The `::` prefix refers to the global namespace.
 
@@ -156,7 +156,7 @@ In f
 In A::g
 ```
 
-## Example: using declaration synonyms and aliases
+## Example: `using` declaration synonyms and aliases
 
 When a using declaration is made, the synonym created by the declaration refers only to definitions that are valid at the point of the using declaration. Definitions added to a namespace after the using declaration are not valid synonyms.
 
diff --git a/docs/dotnet/how-to-do-ddx-ddv-data-binding-with-windows-forms.md b/docs/dotnet/how-to-do-ddx-ddv-data-binding-with-windows-forms.md
@@ -64,7 +64,7 @@ void CMFC01Dlg::OnBnClickedOk()
 }
 ```
 
-## Example: Add line of code to BOOL CMFC01Dlg::OnInitDialog()
+## Example: Add a line of code to BOOL CMFC01Dlg::OnInitDialog()
 
 And add the following line to the implementation of BOOL CMFC01Dlg::OnInitDialog().
 
diff --git a/docs/extensions/nullptr-cpp-component-extensions.md b/docs/extensions/nullptr-cpp-component-extensions.md
@@ -198,7 +198,7 @@ int main() {
 NULL
 ```
 
-## Example: nullptr assigned to native pointer
+## Example: `nullptr` assigned to native pointer
 
 The following code example shows that **`nullptr`** can be assigned to a native pointer when you compile with `/clr`.
 
diff --git a/docs/parallel/concrt/how-to-use-a-message-block-filter.md b/docs/parallel/concrt/how-to-use-a-message-block-filter.md
@@ -32,7 +32,7 @@ Because the `transformer` object receives only prime numbers, the `transformer`
 
 The `transformer` object now processes only those values that are prime. In the previous example, `transformer` object processes all messages. Therefore, the previous example must receive the same number of messages that it sends. This example uses the result of the [concurrency::send](reference/concurrency-namespace-functions.md#send) function to determine how many messages to receive from the `transformer` object. The `send` function returns **`true`** when the message buffer accepts the message and **`false`** when the message buffer rejects the message. Therefore, the number of times that the message buffer accepts the message matches the count of prime numbers.
 
-## Example: Complete code example
+## Example: Complete code sample
 
 The following code shows the complete example. The example calls both the `count_primes` function and the `count_primes_filter` function.
 
diff --git a/docs/parallel/concrt/how-to-use-exception-handling-to-break-from-a-parallel-loop.md b/docs/parallel/concrt/how-to-use-exception-handling-to-break-from-a-parallel-loop.md
@@ -40,7 +40,7 @@ The following example creates a `tree` object and searches it for several values
 
 This example uses the [concurrency::parallel_invoke](reference/concurrency-namespace-functions.md#parallel_invoke) algorithm to search for values in parallel. For more information about this algorithm, see [Parallel Algorithms](../../parallel/concrt/parallel-algorithms.md).
 
-## Example: Complete code example
+## Example: Complete code sample
 
 The following complete example uses exception handling to search for values in a basic tree structure.
 
diff --git a/docs/parallel/concrt/how-to-use-parallel-containers-to-increase-efficiency.md b/docs/parallel/concrt/how-to-use-parallel-containers-to-increase-efficiency.md
@@ -40,7 +40,7 @@ This example prints the prime factors for each Carmichael number if that number
 
 [!code-cpp[concrt-carmichael-primes#4](../../parallel/concrt/codesnippet/cpp/how-to-use-parallel-containers-to-increase-efficiency_4.cpp)]
 
-## Example: Complete code example
+## Example: Complete code sample
 
 The following code shows the complete example, which uses parallel containers to compute the prime factors of the Carmichael numbers.
 
diff --git a/docs/parallel/concrt/how-to-write-a-parallel-for-loop.md b/docs/parallel/concrt/how-to-write-a-parallel-for-loop.md
@@ -22,7 +22,7 @@ The following example shows the `parallel_matrix_multiply` function, which uses
 
 This example parallelizes the outer loop only because it performs enough work to benefit from the overhead for parallel processing. If you parallelize the inner loop, you will not receive a gain in performance because the small amount of work that the inner loop performs does not overcome the overhead for parallel processing. Therefore, parallelizing the outer loop only is the best way to maximize the benefits of concurrency on most systems.
 
-## Example: Complete code example
+## Example: Complete code sample
 
 The following more complete example compares the performance of the `matrix_multiply` function versus the `parallel_matrix_multiply` function.
 

Original file line number	Diff line number	Diff line change
`@@ -64,7 +64,7 @@ void CMFC01Dlg::OnBnClickedOk()`
`64`	`64`	`}`
`65`	`65`	```
`66`	`66`
`67`		`-## Example: Add line of code to BOOL CMFC01Dlg::OnInitDialog()`
	`67`	`+## Example: Add a line of code to BOOL CMFC01Dlg::OnInitDialog()`
`68`	`68`
`69`	`69`	`And add the following line to the implementation of BOOL CMFC01Dlg::OnInitDialog().`
`70`	`70`