You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: docs/overview/whats-new-cpp-docs.md
+2-2Lines changed: 2 additions & 2 deletions
Original file line number
Diff line number
Diff line change
@@ -1,6 +1,6 @@
1
1
---
2
2
title: "What's new for the C++ docs"
3
-
description: "The new docs and doc updates for the Microsoft C/C++ compiler, ATL/MFC, C runtime, and standard template library docs."
3
+
description: "The new docs and doc updates for the Microsoft C/C++ compiler, ATL/MFC, C runtime, and standard library docs."
4
4
ms.date: "02/05/2021"
5
5
---
6
6
# Microsoft C++ docs: What's new for Visual Studio 16.8
@@ -161,7 +161,7 @@ This article lists some of the major changes to docs for Visual Studio 16.8.
161
161
162
162
-[How to: Use existing C++ code in a Universal Windows Platform app](../porting/how-to-use-existing-cpp-code-in-a-universal-windows-platform-app.md) - Reworked for clarity and updated examples
163
163
164
-
## Microsoft C++ Standard Template Library (STL) reference
Copy file name to clipboardExpand all lines: docs/standard-library/multiset-class.md
+45-45Lines changed: 45 additions & 45 deletions
Original file line number
Diff line number
Diff line change
@@ -63,54 +63,54 @@ In C++14, you can enable heterogeneous lookup by specifying the `std::less<>` or
63
63
64
64
### Typedefs
65
65
66
-
|Type name|Description|
67
-
|-|-|
68
-
|[`allocator_type`](#allocator_type)|A typedef for the `allocator` class for the `multiset` object.|
69
-
|[`const_iterator`](#const_iterator)|A typedef for a bidirectional iterator that can read a **`const`** element in the `multiset`.|
70
-
|[`const_pointer`](#const_pointer)|A typedef for a pointer to a **`const`** element in a `multiset`.|
71
-
|[`const_reference`](#const_reference)|A typedef for a reference to a **`const`** element stored in a `multiset` for reading and doing **`const`** operations.|
72
-
|[`const_reverse_iterator`](#const_reverse_iterator)|A typedef for a bidirectional iterator that can read any **`const`** element in the `multiset`.|
73
-
|[`difference_type`](#difference_type)|A signed integer typedef for the number of elements of a `multiset` in a range between elements pointed to by iterators.|
74
-
|[`iterator`](#iterator)|A typedef for a bidirectional iterator that can read or modify any element in a `multiset`.|
75
-
|[`key_compare`](#key_compare)|A typedef for a function object that can compare two keys to determine the relative order of two elements in the `multiset`.|
76
-
|[`key_type`](#key_type)|A typedef for a function object that can compare two sort keys to determine the relative order of two elements in the `multiset`.|
77
-
|[`pointer`](#pointer)|A typedef for a pointer to an element in a `multiset`.|
78
-
|[`reference`](#reference)|A typedef for a reference to an element stored in a `multiset`.|
79
-
|[`reverse_iterator`](#reverse_iterator)|A typedef for a bidirectional iterator that can read or modify an element in a reversed `multiset`.|
80
-
|[`size_type`](#size_type)|An unsigned integer type that can represent the number of elements in a `multiset`.|
81
-
|[`value_compare`](#value_compare)|The typedef for a function object that can compare two elements as sort keys to determine their relative order in the `multiset`.|
82
-
|[`value_type`](#value_type)|A typedef that describes an object stored as an element as a `multiset` in its capacity as a value.|
66
+
|Type name | Description|
67
+
|--|--|
68
+
|[`allocator_type`](#allocator_type) | A typedef for the `allocator` class for the `multiset` object.|
69
+
|[`const_iterator`](#const_iterator) | A typedef for a bidirectional iterator that can read a **`const`** element in the `multiset`.|
70
+
|[`const_pointer`](#const_pointer) | A typedef for a pointer to a **`const`** element in a `multiset`.|
71
+
|[`const_reference`](#const_reference) | A typedef for a reference to a **`const`** element stored in a `multiset` for reading and doing **`const`** operations.|
72
+
|[`const_reverse_iterator`](#const_reverse_iterator) | A typedef for a bidirectional iterator that can read any **`const`** element in the `multiset`.|
73
+
|[`difference_type`](#difference_type) | A signed integer typedef for the number of elements of a `multiset` in a range between elements pointed to by iterators.|
74
+
|[`iterator`](#iterator) | A typedef for a bidirectional iterator that can read or modify any element in a `multiset`.|
75
+
|[`key_compare`](#key_compare) | A typedef for a function object that can compare two keys to determine the relative order of two elements in the `multiset`.|
76
+
|[`key_type`](#key_type) | A typedef for a function object that can compare two sort keys to determine the relative order of two elements in the `multiset`.|
77
+
|[`pointer`](#pointer) | A typedef for a pointer to an element in a `multiset`.|
78
+
|[`reference`](#reference) | A typedef for a reference to an element stored in a `multiset`.|
79
+
|[`reverse_iterator`](#reverse_iterator) | A typedef for a bidirectional iterator that can read or modify an element in a reversed `multiset`.|
80
+
|[`size_type`](#size_type) | An unsigned integer type that can represent the number of elements in a `multiset`.|
81
+
|[`value_compare`](#value_compare) | The typedef for a function object that can compare two elements as sort keys to determine their relative order in the `multiset`.|
82
+
|[`value_type`](#value_type) | A typedef that describes an object stored as an element as a `multiset` in its capacity as a value.|
83
83
84
84
### Member functions
85
85
86
-
|Member function|Description|
87
-
|-|-|
88
-
|[`begin`](#begin)|Returns an iterator that points to the first element in the `multiset`.|
89
-
|[`cbegin`](#cbegin)|Returns a const iterator that addresses the first element in the `multiset`.|
90
-
|[`cend`](#cend)|Returns a const iterator that addresses the location succeeding the last element in a `multiset`.|
91
-
|[`clear`](#clear)|Erases all the elements of a `multiset`.|
92
-
|[`contains`](#contains)<sup>C++20</sup>|Check if there's an element with the specified key in the `multiset`.|
93
-
|[`count`](#count)|Returns the number of elements in a `multiset` whose key matches the key specified as a parameter.|
94
-
|[`crbegin`](#crbegin)|Returns a const iterator addressing the first element in a reversed `multiset`.|
95
-
|[`crend`](#crend)|Returns a const iterator that addresses the location succeeding the last element in a reversed `multiset`.|
96
-
|[`emplace`](#emplace)|Inserts an element constructed in place into a `multiset`.|
97
-
|[`emplace_hint`](#emplace_hint)|Inserts an element constructed in place into a `multiset`, with a placement hint.|
98
-
|[`empty`](#empty)|Tests if a `multiset` is empty.|
99
-
|[`end`](#end)|Returns an iterator that points to the location after the last element in a `multiset`.|
100
-
|[`equal_range`](#equal_range)|Returns a pair of iterators. The first iterator in the pair points to the first element in a `multiset` with a key that is greater than a specified key. The second iterator in the pair points to first element in the `multiset` with a key that is equal to or greater than the key.|
101
-
|[`erase`](#erase)|Removes an element or a range of elements in a `multiset` from specified positions or removes elements that match a specified key.|
102
-
|[`find`](#find)|Returns an iterator that points to the first location of an element in a `multiset` that has a key equal to a specified key.|
103
-
|[`get_allocator`](#get_allocator)|Returns a copy of the `allocator` object that is used to construct the `multiset`.|
104
-
|[`insert`](#insert)|Inserts an element or a range of elements into a `multiset`.|
105
-
|[`key_comp`](#key_comp)|Provides a function object that can compare two sort keys to determine the relative order of two elements in the `multiset`.|
106
-
|[`lower_bound`](#lower_bound)|Returns an iterator to the first element in a `multiset` with a key that is equal to or greater than a specified key.|
107
-
|[`max_size`](#max_size)|Returns the maximum length of the `multiset`.|
108
-
|[`rbegin`](#rbegin)|Returns an iterator that points to the first element in a reversed `multiset`.|
109
-
|[`rend`](#rend)|Returns an iterator that points to the location succeeding the last element in a reversed `multiset`.|
110
-
|[`size`](#size)|Returns the number of elements in a `multiset`.|
111
-
|[`swap`](#swap)|Exchanges the elements of two `multiset`s.|
112
-
|[`upper_bound`](#upper_bound)|Returns an iterator to the first element in a `multiset` with a key that is greater than a specified key.|
113
-
|[`value_comp`](#value_comp)|Retrieves a copy of the comparison object that is used to order element values in a `multiset`.|
86
+
|Member function | Description|
87
+
|--|--|
88
+
|[`begin`](#begin) | Returns an iterator that points to the first element in the `multiset`.|
89
+
|[`cbegin`](#cbegin) | Returns a const iterator that addresses the first element in the `multiset`.|
90
+
|[`cend`](#cend) | Returns a const iterator that addresses the location succeeding the last element in a `multiset`.|
91
+
|[`clear`](#clear) | Erases all the elements of a `multiset`.|
92
+
|[`contains`](#contains)<sup>C++20</sup> | Check if there's an element with the specified key in the `multiset`.|
93
+
|[`count`](#count) | Returns the number of elements in a `multiset` whose key matches the key specified as a parameter.|
94
+
|[`crbegin`](#crbegin) | Returns a const iterator addressing the first element in a reversed `multiset`.|
95
+
|[`crend`](#crend) | Returns a const iterator that addresses the location succeeding the last element in a reversed `multiset`.|
96
+
|[`emplace`](#emplace) | Inserts an element constructed in place into a `multiset`.|
97
+
|[`emplace_hint`](#emplace_hint) | Inserts an element constructed in place into a `multiset`, with a placement hint.|
98
+
|[`empty`](#empty) | Tests if a `multiset` is empty.|
99
+
|[`end`](#end) | Returns an iterator that points to the location after the last element in a `multiset`.|
100
+
|[`equal_range`](#equal_range) | Returns a pair of iterators. The first iterator in the pair points to the first element in a `multiset` with a key that is greater than a specified key. The second iterator in the pair points to first element in the `multiset` with a key that is equal to or greater than the key.|
101
+
|[`erase`](#erase) | Removes an element or a range of elements in a `multiset` from specified positions or removes elements that match a specified key.|
102
+
|[`find`](#find) | Returns an iterator that points to the first location of an element in a `multiset` that has a key equal to a specified key.|
103
+
|[`get_allocator`](#get_allocator) | Returns a copy of the `allocator` object that is used to construct the `multiset`.|
104
+
|[`insert`](#insert) | Inserts an element or a range of elements into a `multiset`.|
105
+
|[`key_comp`](#key_comp) | Provides a function object that can compare two sort keys to determine the relative order of two elements in the `multiset`.|
106
+
|[`lower_bound`](#lower_bound) | Returns an iterator to the first element in a `multiset` with a key that is equal to or greater than a specified key.|
107
+
|[`max_size`](#max_size) | Returns the maximum length of the `multiset`.|
108
+
|[`rbegin`](#rbegin) | Returns an iterator that points to the first element in a reversed `multiset`.|
109
+
|[`rend`](#rend) | Returns an iterator that points to the location succeeding the last element in a reversed `multiset`.|
110
+
|[`size`](#size) | Returns the number of elements in a `multiset`.|
111
+
|[`swap`](#swap) | Exchanges the elements of two `multiset`s.|
112
+
|[`upper_bound`](#upper_bound) | Returns an iterator to the first element in a `multiset` with a key that is greater than a specified key.|
113
+
|[`value_comp`](#value_comp) | Retrieves a copy of the comparison object that is used to order element values in a `multiset`.|
0 commit comments