Add backticks in link text after "class template"

Author: Rageking8

docs/atl-mfc-shared/basic-cstring-operations.md

@@ -19,7 +19,7 @@ This topic explains the following basic [CString](../atl-mfc-shared/reference/cs
 
 - [Converting CString objects](#_core_converting_cstring_objects)
 
-`Class CString` is based on class template [CStringT](../atl-mfc-shared/reference/cstringt-class.md). `CString` is a **`typedef`** of `CStringT`. More exactly, `CString` is a **`typedef`** of an *explicit specialization* of `CStringT`, which is a common way to use a class template to define a class. Similarly defined classes are `CStringA` and `CStringW`.
+`Class CString` is based on class template [`CStringT`](../atl-mfc-shared/reference/cstringt-class.md). `CString` is a **`typedef`** of `CStringT`. More exactly, `CString` is a **`typedef`** of an *explicit specialization* of `CStringT`, which is a common way to use a class template to define a class. Similarly defined classes are `CStringA` and `CStringW`.
 
 `CString`, `CStringA`, and `CStringW` are defined in atlstr.h. `CStringT` is defined in cstringt.h.
 

docs/standard-library/array-operators.md

@@ -116,7 +116,7 @@ Right container to compare.
 
 ### Remarks
 
-The template function overloads `operator<` to compare two objects of class template [array](../standard-library/array-class-stl.md). The function returns `lexicographical_compare(left.begin(), left.end(), right.begin())`.
+The template function overloads `operator<` to compare two objects of class template [`array`](../standard-library/array-class-stl.md). The function returns `lexicographical_compare(left.begin(), left.end(), right.begin())`.
 
 ### Example
 
@@ -262,7 +262,7 @@ Right container to compare.
 
 ### Remarks
 
-The template function overloads `operator==` to compare two objects of class template [array](../standard-library/array-class-stl.md). The function returns `equal(left.begin(), left.end(), right.begin())`.
+The template function overloads `operator==` to compare two objects of class template [`array`](../standard-library/array-class-stl.md). The function returns `equal(left.begin(), left.end(), right.begin())`.
 
 ### Example
 

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

@@ -23,4 +23,4 @@ Specialization allows the struct to take advantage of library functions that man
 
 ## Example
 
-See the typedefs and member functions of the class template [char_traits](../standard-library/char-traits-struct.md)
+See the typedefs and member functions of the class template [`char_traits`](../standard-library/char-traits-struct.md)

docs/standard-library/cvt-wbuffer.md

@@ -8,7 +8,7 @@ ms.assetid: 6e6eb44c-1bc4-4d8c-a4bd-b39c753ce725
 ---
 # `<cvt/wbuffer>`
 
-The header `<cvt/wstring>` in previous versions of Visual Studio defined the class template [wbuffer_convert](../standard-library/wbuffer-convert-class.md) in the stdext::cvt namespace. The header is maintained for backward compatibility. New code should use the version of the class that is defined in [\<locale>](../standard-library/locale.md) in the `std` namespace
+The header `<cvt/wstring>` in previous versions of Visual Studio defined the class template [`wbuffer_convert`](../standard-library/wbuffer-convert-class.md) in the stdext::cvt namespace. The header is maintained for backward compatibility. New code should use the version of the class that is defined in [\<locale>](../standard-library/locale.md) in the `std` namespace
 
 ## Syntax
 

docs/standard-library/cvt-wstring.md

@@ -8,7 +8,7 @@ ms.assetid: d78b04bb-9ac0-4adb-8ffe-3aefb9b14c2d
 ---
 # `<cvt/wstring>`
 
-The header `<cvt/wstring>` in previous versions of Visual Studio defined the class template [wstring_convert](../standard-library/wstring-convert-class.md) in the stdext::cvt namespace. The header is maintained for backward compatibility. New code should use the version of the class that is defined in [\<locale>](../standard-library/locale.md) in the `std` namespace
+The header `<cvt/wstring>` in previous versions of Visual Studio defined the class template [`wstring_convert`](../standard-library/wstring-convert-class.md) in the stdext::cvt namespace. The header is maintained for backward compatibility. New code should use the version of the class that is defined in [\<locale>](../standard-library/locale.md) in the `std` namespace
 
 ## Syntax
 

docs/standard-library/regex-traits-class.md

@@ -24,7 +24,7 @@ The character element type to describe.
 
 ## Remarks
 
-The class template describes various regular expression traits for type *Elem*. The class template [basic_regex](../standard-library/basic-regex-class.md) uses this information to manipulate elements of type *Elem*.
+The class template describes various regular expression traits for type *Elem*. The class template [`basic_regex`](../standard-library/basic-regex-class.md) uses this information to manipulate elements of type *Elem*.
 
 Each `regex_traits` object holds an object of type `regex_traits::locale` which is used by some of its member functions. The default locale is a copy of `regex_traits::locale()`. The member function `imbue` replaces the locale object, and the member function `getloc` returns a copy of the locale object.
 

docs/standard-library/regex-typedefs.md

@@ -18,7 +18,7 @@ typedef match_results<const char*> cmatch;
 
 ### Remarks
 
-The type describes a specialization of class template [match_results](../standard-library/match-results-class.md) for iterators of type `const char*`.
+The type describes a specialization of class template [`match_results`](../standard-library/match-results-class.md) for iterators of type `const char*`.
 
 ## <a name="cregex_iterator"></a> cregex_iterator Typedef
 
@@ -30,7 +30,7 @@ typedef regex_iterator<const char*> cregex_iterator;
 
 ### Remarks
 
-The type describes a specialization of class template [regex_iterator](../standard-library/regex-iterator-class.md) for iterators of type `const char*`.
+The type describes a specialization of class template [`regex_iterator`](../standard-library/regex-iterator-class.md) for iterators of type `const char*`.
 
 ## <a name="cregex_token_iterator"></a> cregex_token_iterator Typedef
 
@@ -42,7 +42,7 @@ typedef regex_token_iterator<const char*> cregex_token_iterator;
 
 ### Remarks
 
-The type describes a specialization of class template [regex_token_iterator](../standard-library/regex-token-iterator-class.md) for iterators of type `const char*`.
+The type describes a specialization of class template [`regex_token_iterator`](../standard-library/regex-token-iterator-class.md) for iterators of type `const char*`.
 
 ## <a name="csub_match"></a> csub_match Typedef
 
@@ -54,7 +54,7 @@ typedef sub_match<const char*> csub_match;
 
 ### Remarks
 
-The type describes a specialization of class template [sub_match](../standard-library/sub-match-class.md) for iterators of type `const char*`.
+The type describes a specialization of class template [`sub_match`](../standard-library/sub-match-class.md) for iterators of type `const char*`.
 
 ## <a name="regex"></a> regex Typedef
 
@@ -66,7 +66,7 @@ typedef basic_regex<char> regex;
 
 ### Remarks
 
-The type describes a specialization of class template [basic_regex](../standard-library/basic-regex-class.md) for elements of type **`char`**.
+The type describes a specialization of class template [`basic_regex`](../standard-library/basic-regex-class.md) for elements of type **`char`**.
 
 > [!NOTE]
 > High-bit characters will have unpredictable results with `regex`. Values outside the range of 0 to 127 may result in undefined behavior.
@@ -81,7 +81,7 @@ typedef match_results<string::const_iterator> smatch;
 
 ### Remarks
 
-The type describes a specialization of class template [match_results](../standard-library/match-results-class.md) for iterators of type `string::const_iterator`.
+The type describes a specialization of class template [`match_results`](../standard-library/match-results-class.md) for iterators of type `string::const_iterator`.
 
 ## <a name="sregex_iterator"></a> sregex_iterator Typedef
 
@@ -93,7 +93,7 @@ typedef regex_iterator<string::const_iterator> sregex_iterator;
 
 ### Remarks
 
-The type describes a specialization of class template [regex_iterator](../standard-library/regex-iterator-class.md) for iterators of type `string::const_iterator`.
+The type describes a specialization of class template [`regex_iterator`](../standard-library/regex-iterator-class.md) for iterators of type `string::const_iterator`.
 
 ## <a name="sregex_token_iterator"></a> sregex_token_iterator Typedef
 
@@ -105,7 +105,7 @@ typedef regex_token_iterator<string::const_iterator> sregex_token_iterator;
 
 ### Remarks
 
-The type describes a specialization of class template [regex_token_iterator](../standard-library/regex-token-iterator-class.md) for iterators of type `string::const_iterator`.
+The type describes a specialization of class template [`regex_token_iterator`](../standard-library/regex-token-iterator-class.md) for iterators of type `string::const_iterator`.
 
 ## <a name="ssub_match"></a> ssub_match Typedef
 
@@ -117,7 +117,7 @@ typedef sub_match<string::const_iterator> ssub_match;
 
 ### Remarks
 
-The type describes a specialization of class template [sub_match](../standard-library/sub-match-class.md) for iterators of type `string::const_iterator`.
+The type describes a specialization of class template [`sub_match`](../standard-library/sub-match-class.md) for iterators of type `string::const_iterator`.
 
 ## <a name="wcmatch"></a> wcmatch Typedef
 
@@ -129,7 +129,7 @@ typedef match_results<const wchar_t *> wcmatch;
 
 ### Remarks
 
-The type describes a specialization of class template [match_results](../standard-library/match-results-class.md) for iterators of type `const wchar_t*`.
+The type describes a specialization of class template [`match_results`](../standard-library/match-results-class.md) for iterators of type `const wchar_t*`.
 
 ## <a name="wcregex_iterator"></a> wcregex_iterator Typedef
 
@@ -141,7 +141,7 @@ typedef regex_iterator<const wchar_t*> wcregex_iterator;
 
 ### Remarks
 
-The type describes a specialization of class template [regex_iterator](../standard-library/regex-iterator-class.md) for iterators of type `const wchar_t*`.
+The type describes a specialization of class template [`regex_iterator`](../standard-library/regex-iterator-class.md) for iterators of type `const wchar_t*`.
 
 ## <a name="wcregex_token_iterator"></a> wcregex_token_iterator Typedef
 
@@ -153,7 +153,7 @@ typedef regex_token_iterator<const wchar_t*> wcregex_token_iterator;
 
 ### Remarks
 
-The type describes a specialization of class template [regex_token_iterator](../standard-library/regex-token-iterator-class.md) for iterators of type `const wchar_t*`.
+The type describes a specialization of class template [`regex_token_iterator`](../standard-library/regex-token-iterator-class.md) for iterators of type `const wchar_t*`.
 
 ## <a name="wcsub_match"></a> wcsub_match Typedef
 
@@ -165,7 +165,7 @@ typedef sub_match<const wchar_t*> wcsub_match;
 
 ### Remarks
 
-The type describes a specialization of class template [sub_match](../standard-library/sub-match-class.md) for iterators of type `const wchar_t*`.
+The type describes a specialization of class template [`sub_match`](../standard-library/sub-match-class.md) for iterators of type `const wchar_t*`.
 
 ## <a name="wregex"></a> wregex Typedef
 
@@ -177,7 +177,7 @@ typedef basic_regex<wchar_t> wregex;
 
 ### Remarks
 
-The type describes a specialization of class template [basic_regex](../standard-library/basic-regex-class.md) for elements of type **`wchar_t`**.
+The type describes a specialization of class template [`basic_regex`](../standard-library/basic-regex-class.md) for elements of type **`wchar_t`**.
 
 ## <a name="wsmatch"></a> wsmatch Typedef
 
@@ -189,7 +189,7 @@ typedef match_results<wstring::const_iterator> wsmatch;
 
 ### Remarks
 
-The type describes a specialization of class template [match_results](../standard-library/match-results-class.md) for iterators of type `wstring::const_iterator`.
+The type describes a specialization of class template [`match_results`](../standard-library/match-results-class.md) for iterators of type `wstring::const_iterator`.
 
 ## <a name="wsregex_iterator"></a> wsregex_iterator Typedef
 
@@ -201,7 +201,7 @@ typedef regex_iterator<wstring::const_iterator> wsregex_iterator;
 
 ### Remarks
 
-The type describes a specialization of class template [regex_iterator](../standard-library/regex-iterator-class.md) for iterators of type `wstring::const_iterator`.
+The type describes a specialization of class template [`regex_iterator`](../standard-library/regex-iterator-class.md) for iterators of type `wstring::const_iterator`.
 
 ## <a name="wsregex_token_iterator"></a> wsregex_token_iterator Typedef
 
@@ -213,7 +213,7 @@ typedef regex_token_iterator<wstring::const_iterator> wsregex_token_iterator;
 
 ### Remarks
 
-The type describes a specialization of class template [regex_token_iterator](../standard-library/regex-token-iterator-class.md) for iterators of type `wstring::const_iterator`.
+The type describes a specialization of class template [`regex_token_iterator`](../standard-library/regex-token-iterator-class.md) for iterators of type `wstring::const_iterator`.
 
 ## <a name="wssub_match"></a> wssub_match Typedef
 
@@ -225,7 +225,7 @@ typedef sub_match<wstring::const_iterator> wssub_match;
 
 ### Remarks
 
-The type describes a specialization of class template [sub_match](../standard-library/sub-match-class.md) for iterators of type `wstring::const_iterator`.
+The type describes a specialization of class template [`sub_match`](../standard-library/sub-match-class.md) for iterators of type `wstring::const_iterator`.
 
 ## See also
 

docs/standard-library/string-operators.md

@@ -89,7 +89,7 @@ The string that is the concatenation of the input strings.
 
 ### Remarks
 
-The functions each overload `operator+` to concatenate two objects of class template [basic_string](../standard-library/basic-string-class.md). All effectively return `basic_string< CharType, Traits, Allocator>(Left).append(right)`. For more information, see [append](../standard-library/basic-string-class.md#append).
+The functions each overload `operator+` to concatenate two objects of class template [`basic_string`](../standard-library/basic-string-class.md). All effectively return `basic_string< CharType, Traits, Allocator>(Left).append(right)`. For more information, see [append](../standard-library/basic-string-class.md#append).
 
 ### Example
 

docs/standard-library/unordered-multimap-class.md

@@ -99,7 +99,7 @@ The allocator class.
 
 ## Remarks
 
-The object orders the sequence it controls by calling two stored objects, a comparison function object of type [unordered_multimap::key_equal](#key_equal) and a hash function object of type [unordered_multimap::hasher](#hasher). You access the first stored object by calling the member function [unordered_multimap::key_eq](#key_eq)`()`; and you access the second stored object by calling the member function [unordered_multimap::hash_function](#hash)`()`. Specifically, for all values `X` and `Y` of type `Key`, the call `key_eq()(X, Y)` returns true only if the two argument values have equivalent ordering; the call `hash_function()(keyval)` yields a distribution of values of type `size_t`. Unlike class template [unordered_map](../standard-library/unordered-map-class.md), an object of type `unordered_multimap` does not ensure that `key_eq()(X, Y)` is always false for any two elements of the controlled sequence. (Keys need not be unique.)
+The object orders the sequence it controls by calling two stored objects, a comparison function object of type [unordered_multimap::key_equal](#key_equal) and a hash function object of type [unordered_multimap::hasher](#hasher). You access the first stored object by calling the member function [unordered_multimap::key_eq](#key_eq)`()`; and you access the second stored object by calling the member function [unordered_multimap::hash_function](#hash)`()`. Specifically, for all values `X` and `Y` of type `Key`, the call `key_eq()(X, Y)` returns true only if the two argument values have equivalent ordering; the call `hash_function()(keyval)` yields a distribution of values of type `size_t`. Unlike class template [`unordered_map`](../standard-library/unordered-map-class.md), an object of type `unordered_multimap` does not ensure that `key_eq()(X, Y)` is always false for any two elements of the controlled sequence. (Keys need not be unique.)
 
 The object also stores a maximum load factor, which specifies the maximum desired average number of elements per bucket. If inserting an element causes [unordered_multimap::load_factor](#load_factor)`()` to exceed the maximum load factor, the container increases the number of buckets and rebuilds the hash table as needed.
 

docs/standard-library/unordered-multiset-class.md

@@ -91,7 +91,7 @@ The allocator class.
 
 ## Remarks
 
-The object orders the sequence it controls by calling two stored objects, a comparison function object of type [unordered_multiset::key_equal](#key_equal) and a hash function object of type [unordered_multiset::hasher](#hasher). You access the first stored object by calling the member function [unordered_multiset::key_eq](#key_eq)`()`; and you access the second stored object by calling the member function [unordered_multiset::hash_function](#hash)`()`. Specifically, for all values `X` and `Y` of type `Key`, the call `key_eq()(X, Y)` returns true only if the two argument values have equivalent ordering; the call `hash_function()(keyval)` yields a distribution of values of type `size_t`. Unlike class template [unordered_set](../standard-library/unordered-set-class.md), an object of type `unordered_multiset` does not ensure that `key_eq()(X, Y)` is always false for any two elements of the controlled sequence. (Keys need not be unique.)
+The object orders the sequence it controls by calling two stored objects, a comparison function object of type [unordered_multiset::key_equal](#key_equal) and a hash function object of type [unordered_multiset::hasher](#hasher). You access the first stored object by calling the member function [unordered_multiset::key_eq](#key_eq)`()`; and you access the second stored object by calling the member function [unordered_multiset::hash_function](#hash)`()`. Specifically, for all values `X` and `Y` of type `Key`, the call `key_eq()(X, Y)` returns true only if the two argument values have equivalent ordering; the call `hash_function()(keyval)` yields a distribution of values of type `size_t`. Unlike class template [`unordered_set`](../standard-library/unordered-set-class.md), an object of type `unordered_multiset` does not ensure that `key_eq()(X, Y)` is always false for any two elements of the controlled sequence. (Keys need not be unique.)
 
 The object also stores a maximum load factor, which specifies the maximum desired average number of elements per bucket. If inserting an element causes [unordered_multiset::load_factor](#load_factor)`()` to exceed the maximum load factor, the container increases the number of buckets and rebuilds the hash table as needed.