Skip to content

Commit 583d675

Browse files
rachana-sataorachana-satao
committed
updating this keyword
1 parent 5e4a478 commit 583d675

11 files changed

Lines changed: 98 additions & 87 deletions

‎docs/standard-library/algorithm-functions.md‎

Lines changed: 13 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -1,9 +1,10 @@
11
---
22
description: "Learn more about: <algorithm> functions"
33
title: "<algorithm> functions"
4-
ms.date: 06/01/2022
4+
ms.date: 06/07/2022
55
f1_keywords: ["algorithm/std::adjacent_find", "algorithm/std::all_of", "algorithm/std::any_of", "algorithm/std::binary_search", "algorithm/std::copy", "algorithm/std::copy_backward", "algorithm/std::copy_if", "algorithm/std::copy_n", "algorithm/std::equal", "algorithm/std::equal_range", "algorithm/std::fill", "algorithm/std::fill_n", "algorithm/std::find", "algorithm/std::find_end", "algorithm/std::find_first_of", "algorithm/std::find_if", "algorithm/std::find_if_not", "algorithm/std::for_each", "algorithm/std::generate", "algorithm/std::generate_n", "algorithm/std::includes", "algorithm/std::inplace_merge", "algorithm/std::is_heap", "algorithm/std::is_heap_until", "algorithm/std::is_partitioned", "algorithm/std::is_permutation", "algorithm/std::is_sorted", "algorithm/std::is_sorted_until", "algorithm/std::iter_swap", "algorithm/std::lexicographical_compare", "algorithm/std::lower_bound", "algorithm/std::make_heap", "algorithm/std::max", "algorithm/std::max_element", "algorithm/std::merge", "algorithm/std::min", "algorithm/std::minmax", "algorithm/std::minmax_element", "algorithm/std::min_element", "algorithm/std::mismatch", "algorithm/std::move", "algorithm/std::move_backward", "algorithm/std::next_permutation", "algorithm/std::none_of", "algorithm/std::nth_element", "algorithm/std::partial_sort", "algorithm/std::partial_sort_copy", "algorithm/std::partition", "algorithm/std::partition_point", "algorithm/std::pop_heap", "algorithm/std::prev_permutation", "algorithm/std::push_heap", "algorithm/std::random_shuffle", "algorithm/std::remove", "algorithm/std::remove_copy", "algorithm/std::remove_copy_if", "algorithm/std::remove_if", "algorithm/std::replace", "algorithm/std::replace_copy", "algorithm/std::replace_copy_if", "algorithm/std::replace_if", "algorithm/std::reverse", "algorithm/std::reverse_copy", "algorithm/std::rotate", "algorithm/std::rotate_copy", "algorithm/std::search", "algorithm/std::search_n", "algorithm/std::set_difference", "algorithm/std::set_intersection", "algorithm/std::set_symmetric_difference", "algorithm/std::set_union", "algorithm/std::shuffle", "algorithm/std::sort", "algorithm/std::sort_heap", "algorithm/std::stable_partition", "algorithm/std::stable_sort", "algorithm/std::swap_ranges", "algorithm/std::transform", "algorithm/std::unique", "algorithm/std::unique_copy", "algorithm/std::upper_bound", "xutility/std::copy", "xutility/std::copy_backward", "xutility/std::copy_n", "xutility/std::count", "xutility/std::equal", "xutility/std::fill", "xutility/std::fill_n", "xutility/std::find", "xutility/std::is_permutation", "xutility/std::lexicographical_compare", "xutility/std::move", "xutility/std::move_backward", "xutility/std::reverse", "xutility/std::rotate", "algorithm/std::count_if", "algorithm/std::partition_copy", "algorithm/std::swap"]
66
helpviewer_keywords: ["std::adjacent_find [C++]", "std::all_of [C++]", "std::any_of [C++]", "std::binary_search [C++]", "std::copy [C++]", "std::copy_backward [C++]", "std::copy_if [C++]", "std::copy_n [C++]", "std::equal [C++]", "std::equal_range [C++]", "std::fill [C++]", "std::fill_n [C++]", "std::find [C++]", "std::find_end [C++]", "std::find_first_of [C++]", "std::find_if [C++]", "std::find_if_not [C++]", "std::for_each [C++]", "std::generate [C++]", "std::generate_n [C++]", "std::includes [C++]", "std::inplace_merge [C++]", "std::is_heap [C++]", "std::is_heap_until [C++]", "std::is_partitioned [C++]", "std::is_permutation [C++]", "std::is_sorted [C++]", "std::is_sorted_until [C++]", "std::iter_swap [C++]", "std::lexicographical_compare [C++]", "std::lower_bound [C++]", "std::make_heap [C++]", "std::max [C++]", "std::max_element [C++]", "std::merge [C++]", "std::min [C++]", "std::minmax [C++]", "std::minmax_element [C++]", "std::min_element [C++]", "std::mismatch [C++]", "std::move [C++]", "std::move_backward [C++]", "std::next_permutation [C++]", "std::none_of [C++]", "std::nth_element [C++]", "std::partial_sort [C++]", "std::partial_sort_copy [C++]", "std::partition [C++]", "std::partition_point [C++]", "std::pop_heap [C++]", "std::prev_permutation [C++]", "std::push_heap [C++]", "std::random_shuffle [C++]", "std::remove [C++]", "std::remove_copy [C++]", "std::remove_copy_if [C++]", "std::remove_if [C++]", "std::replace [C++]", "std::replace_copy [C++]", "std::replace_copy_if [C++]", "std::replace_if [C++]", "std::reverse [C++]", "std::reverse_copy [C++]", "std::rotate [C++]", "std::rotate_copy [C++]", "std::search [C++]", "std::search_n [C++]", "std::set_difference [C++]", "std::set_intersection [C++]", "std::set_symmetric_difference [C++]", "std::set_union [C++]", "std::shuffle [C++]", "std::sort [C++]", "std::sort_heap [C++]", "std::stable_partition [C++]", "std::stable_sort [C++]", "std::swap_ranges [C++]", "std::transform [C++]", "std::unique [C++]", "std::unique_copy [C++]", "std::upper_bound [C++]", "std::copy [C++]", "std::copy_backward [C++]", "std::copy_n [C++]", "std::count [C++]", "std::equal [C++]", "std::fill [C++]", "std::fill_n [C++]", "std::find [C++]", "std::is_permutation [C++]", "std::lexicographical_compare [C++]", "std::move [C++]", "std::move_backward [C++]", "std::reverse [C++]", "std::rotate [C++]", "std::count_if [C++]", "std::partition_copy [C++]", "std::swap [C++]"]
7+
ms.custom: devdivchpfy22
78
---
89
# `<algorithm>` functions
910

@@ -1308,34 +1309,34 @@ int main()
13081309

13091310
```Output
13101311
Vector sorted by the default binary predicate <:
1311-
-3 -2 -1 -1 0 0 1 2 3 4
1312+
-3 -2 -1 -1 0 0 1 2 3 4
13121313

13131314
Result of equal_range with value = 3:
1314-
-3 -2 -1 -1 0 0 1 2 [ 3 ] 4
1315+
-3 -2 -1 -1 0 0 1 2 [ 3 ] 4
13151316

13161317
Vector sorted by the binary predicate greater:
1317-
4 3 2 1 0 0 -1 -1 -2 -3
1318+
4 3 2 1 0 0 -1 -1 -2 -3
13181319

13191320
Result of equal_range with value = 3:
1320-
4 [ 3 ] 2 1 0 0 -1 -1 -2 -3
1321+
4 [ 3 ] 2 1 0 0 -1 -1 -2 -3
13211322

13221323
Vector sorted by the binary predicate abs_lesser:
1323-
0 0 -1 1 -1 2 -2 3 -3 4
1324+
0 0 -1 1 -1 2 -2 3 -3 4
13241325

13251326
Result of equal_range with value = 3:
1326-
0 0 -1 1 -1 2 -2 [ 3 -3 ] 4
1327+
0 0 -1 1 -1 2 -2 [ 3 -3 ] 4
13271328

13281329
Vector sorted by the default binary predicate <:
1329-
blah cute fluffy fun kittens meowmeowmeow
1330+
blah cute fluffy fun kittens meowmeowmeow
13301331

13311332
Result of equal_range with value = fred:
1332-
blah cute fluffy [ ] fun kittens meowmeowmeow
1333+
blah cute fluffy [ ] fun kittens meowmeowmeow
13331334

13341335
Vector sorted by the binary predicate shorter_than:
1335-
fun cute blah fluffy kittens meowmeowmeow
1336+
fun cute blah fluffy kittens meowmeowmeow
13361337

13371338
Result of equal_range with value = fred:
1338-
fun [ cute blah ] fluffy kittens meowmeowmeow
1339+
fun [ cute blah ] fluffy kittens meowmeowmeow
13391340

13401341
```
13411342

@@ -2102,7 +2103,7 @@ A copy of the function object after it has been applied to all of the elements i
21022103

21032104
### Remarks
21042105

2105-
The algorithm `for_each` is very flexible, allowing the modification of each element within a range in different, user-specified ways. Templatized functions may be reused in a modified form by passing different parameters. User-defined functions may accumulate information within an internal state that the algorithm may return after processing all of the elements in the range.
2106+
The algorithm `for_each` is flexible, allowing the modification of each element within a range in different, user-specified ways. Templatized functions may be reused in a modified form by passing different parameters. User-defined functions may accumulate information within an internal state that the algorithm may return after processing all of the elements in the range.
21062107

21072108
The range referenced must be valid; all pointers must be dereferenceable and, within the sequence, the last position must be reachable from the first by incrementation.
21082109

‎docs/standard-library/allocator-base-class.md‎

Lines changed: 4 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,10 +1,11 @@
11
---
22
description: "Learn more about: allocator_base Class"
33
title: "allocator_base Class"
4-
ms.date: "11/04/2016"
4+
ms.date: 06/07/2022
55
f1_keywords: ["allocators/stdext::allocator_base", "allocators/stdext::allocators::allocator_base", "allocators/stdext::allocator_base::const_pointer", "allocators/stdext::allocator_base::const_reference", "allocators/stdext::allocator_base::difference_type", "allocators/stdext::allocator_base::pointer", "allocators/stdext::allocator_base::reference", "allocators/stdext::allocator_base::size_type", "allocators/stdext::allocator_base::value_type", "allocators/stdext::allocator_base::_Charalloc", "allocators/stdext::allocator_base::_Chardealloc", "allocators/stdext::allocator_base::address", "allocators/stdext::allocator_base::allocate", "allocators/stdext::allocator_base::construct", "allocators/stdext::allocator_base::deallocate", "allocators/stdext::allocator_base::destroy", "allocators/stdext::allocator_base::max_size"]
66
helpviewer_keywords: ["stdext::allocator_base [C++]", "stdext::allocators [C++], allocator_base", "stdext::allocator_base [C++], const_pointer", "stdext::allocator_base [C++], const_reference", "stdext::allocator_base [C++], difference_type", "stdext::allocator_base [C++], pointer", "stdext::allocator_base [C++], reference", "stdext::allocator_base [C++], size_type", "stdext::allocator_base [C++], value_type", "stdext::allocator_base [C++], _Charalloc", "stdext::allocator_base [C++], _Chardealloc", "stdext::allocator_base [C++], address", "stdext::allocator_base [C++], allocate", "stdext::allocator_base [C++], construct", "stdext::allocator_base [C++], deallocate", "stdext::allocator_base [C++], destroy", "stdext::allocator_base [C++], max_size"]
77
ms.assetid: f920b45f-2a88-4bb0-8ead-b6126b426ed4
8+
ms.custom: devdivchpfy22
89
---
910
# allocator_base Class
1011

@@ -81,7 +82,7 @@ A pointer to the allocated object.
8182

8283
### Remarks
8384

84-
This member function is used by containers when compiled with a compiler that cannot compile rebind. It implements `_Charalloc` for the user-defined allocator by returning the result of a call to the `allocate` function of the synchronization filter.
85+
This member function is used by containers when compiled with a compiler that can't compile rebind. It implements `_Charalloc` for the user-defined allocator by returning the result of a call to the `allocate` function of the synchronization filter.
8586

8687
## <a name="chardealloc"></a> allocator_base::_Chardealloc
8788

@@ -101,7 +102,7 @@ The number of objects to be deallocated from storage.
101102
102103
### Remarks
103104
104-
This member function is used by containers when compiled with a compiler that cannot compile rebind. It implements `_Chardealloc` for the user-defined allocator by calling the `deallocate` function of the synchronization filter. The pointer ptr must have been earlier returned by a call to `_Charalloc` for an allocator object that compares equal to **`*this`**, allocating an array object of the same size and type. `_Chardealloc` never throws an exception.
105+
This member function is used by containers when compiled with a compiler that can't compile rebind. It implements `_Chardealloc` for the user-defined allocator by calling the `deallocate` function of the synchronization filter. The pointer ptr must have been earlier returned by a call to `_Charalloc` for an allocator object that compares equal to **`*this`**, allocating an array object of the same size and type. `_Chardealloc` never throws an exception.
105106
106107
## <a name="address"></a> allocator_base::address
107108

‎docs/standard-library/array-class-stl.md‎

Lines changed: 17 additions & 16 deletions
Original file line numberDiff line numberDiff line change
@@ -1,10 +1,11 @@
11
---
22
description: "Learn more about: array Class (C++ Standard Library)"
33
title: "array Class (C++ Standard Library)| Microsoft Docs"
4-
ms.date: "11/13/2019"
4+
ms.date: 06/07/2022
55
f1_keywords: ["array/std::array", "array/std::array::const_iterator", "array/std::array::const_pointer", "array/std::array::const_reference", "array/std::array::const_reverse_iterator", "array/std::array::difference_type", "array/std::array::iterator", "array/std::array::pointer", "array/std::array::reference", "array/std::array::reverse_iterator", "array/std::array::size_type", "array/std::array::value_type", "array/std::array::assign", "array/std::array::at", "array/std::array::back", "array/std::array::begin", "array/std::array::cbegin", "array/std::array::cend", "array/std::array::crbegin", "array/std::array::crend", "array/std::array::data", "array/std::array::empty", "array/std::array::end", "array/std::array::fill", "array/std::array::front", "array/std::array::max_size", "array/std::array::rbegin", "array/std::array::rend", "array/std::array::size", "array/std::array::swap", "array/std::array::operator=", "array/std::array::operator[]"]
66
helpviewer_keywords: ["std::array [C++]", "std::array [C++], const_iterator", "std::array [C++], const_pointer", "std::array [C++], const_reference", "std::array [C++], const_reverse_iterator", "std::array [C++], difference_type", "std::array [C++], iterator", "std::array [C++], pointer", "std::array [C++], reference", "std::array [C++], reverse_iterator", "std::array [C++], size_type", "std::array [C++], value_type", "std::array [C++], assign", "std::array [C++], at", "std::array [C++], back", "std::array [C++], begin", "std::array [C++], cbegin", "std::array [C++], cend", "std::array [C++], crbegin", "std::array [C++], crend", "std::array [C++], data", "std::array [C++], empty", "std::array [C++], end", "std::array [C++], fill", "std::array [C++], front", "std::array [C++], max_size", "std::array [C++], rbegin", "std::array [C++], rend", "std::array [C++], size", "std::array [C++], swap", ", ", "std::array [C++], const_iterator", "std::array [C++], const_pointer", "std::array [C++], const_reference", "std::array [C++], const_reverse_iterator", "std::array [C++], difference_type", "std::array [C++], iterator", "std::array [C++], pointer", "std::array [C++], reference", "std::array [C++], reverse_iterator", "std::array [C++], size_type", "std::array [C++], value_type", "std::array [C++], assign", "std::array [C++], at", "std::array [C++], back", "std::array [C++], begin", "std::array [C++], cbegin", "std::array [C++], cend", "std::array [C++], crbegin", "std::array [C++], crend", "std::array [C++], data", "std::array [C++], empty", "std::array [C++], end", "std::array [C++], fill", "std::array [C++], front", "std::array [C++], max_size", "std::array [C++], rbegin", "std::array [C++], rend", "std::array [C++], size", "std::array [C++], swap"]
77
ms.assetid: fdfd43a5-b2b5-4b9e-991f-93bf10fb4293
8+
ms.custom: devdivchpfy22
89
---
910
# `array` Class (C++ Standard Library)
1011

@@ -297,9 +298,9 @@ A **`const`** random-access iterator that points at the first element of the ran
297298

298299
### Remarks
299300

300-
With the return value of `cbegin`, the elements in the range cannot be modified.
301+
With the return value of `cbegin`, the elements in the range can't be modified.
301302

302-
You can use this member function in place of the `begin()` member function to guarantee that the return value is `const_iterator`. Typically, it's used in conjunction with the [`auto`](../cpp/auto-cpp.md) type deduction keyword, as shown in the following example. In the example, consider `Container` to be a modifiable (non- **`const`**) container of any kind that supports `begin()` and `cbegin()`.
303+
You can use this member function in place of the `begin()` member function to guarantee that the return value is `const_iterator`. Typically, it's used with the [`auto`](../cpp/auto-cpp.md) type deduction keyword, as shown in the following example. In the example, consider `Container` to be a modifiable (non- **`const`**) container of any kind that supports `begin()` and `cbegin()`.
303304

304305
```cpp
305306
auto i1 = Container.begin();
@@ -325,7 +326,7 @@ A random-access iterator that points just beyond the end of the range.
325326

326327
`cend` is used to test whether an iterator has passed the end of its range.
327328

328-
You can use this member function in place of the `end()` member function to guarantee that the return value is `const_iterator`. Typically, it's used in conjunction with the [`auto`](../cpp/auto-cpp.md) type deduction keyword, as shown in the following example. In the example, consider `Container` to be a modifiable (non- **`const`**) container of any kind that supports `end()` and `cend()`.
329+
You can use this member function in place of the `end()` member function to guarantee that the return value is `const_iterator`. Typically, it's used with the [`auto`](../cpp/auto-cpp.md) type deduction keyword, as shown in the following example. In the example, consider `Container` to be a modifiable (non- **`const`**) container of any kind that supports `end()` and `cend()`.
329330

330331
```cpp
331332
auto i1 = Container.end();
@@ -335,7 +336,7 @@ auto i2 = Container.cend();
335336
// i2 is Container<T>::const_iterator
336337
```
337338

338-
The value returned by `cend` should not be dereferenced.
339+
The value returned by `cend` shouldn't be dereferenced.
339340

340341
## <a name="const_iterator"></a> `array::const_iterator`
341342

@@ -531,7 +532,7 @@ A const reverse random-access iterator addressing the first element in a reverse
531532

532533
### Remarks
533534

534-
With the return value of `crbegin`, the array object cannot be modified.
535+
With the return value of `crbegin`, the array object can't be modified.
535536

536537
### Example
537538

@@ -575,13 +576,13 @@ A const reverse random-access iterator that addresses the location succeeding th
575576

576577
### Remarks
577578

578-
`crend` is used with a reversed array just as [`array::cend`](#cend) is used with a array.
579+
`crend` is used with a reversed array just as [`array::cend`](#cend) is used with an array.
579580

580-
With the return value of `crend` (suitably decremented), the array object cannot be modified.
581+
With the return value of `crend` (suitably decremented), the array object can't be modified.
581582

582583
`crend` can be used to test to whether a reverse iterator has reached the end of its array.
583584

584-
The value returned by `crend` should not be dereferenced.
585+
The value returned by `crend` shouldn't be dereferenced.
585586

586587
### Example
587588

@@ -661,7 +662,7 @@ typedef std::ptrdiff_t difference_type;
661662

662663
### Remarks
663664

664-
The signed integer type describes an object that can represent the difference between the addresses of any two elements in the controlled sequence. It is a synonym for the type `std::ptrdiff_t`.
665+
The signed integer type describes an object that can represent the difference between the addresses of any two elements in the controlled sequence. It's a synonym for the type `std::ptrdiff_t`.
665666

666667
### Example
667668

@@ -793,7 +794,7 @@ int main()
793794

794795
## <a name="fill"></a> `array::fill`
795796

796-
Erases a array and copies the specified elements to the empty array.
797+
Erases an array and copies the specified elements to the empty array.
797798

798799
```cpp
799800
void fill(const Type& val);
@@ -992,7 +993,7 @@ Position of element to access.
992993

993994
The member functions return a reference to the element of the controlled sequence at position *`off`*. If that position is invalid, the behavior is undefined.
994995

995-
There is also a non-member [`get`](array-functions.md#get) function available to get a reference to an element of an **`array`**.
996+
There's also a non-member [`get`](array-functions.md#get) function available to get a reference to an element of an **`array`**.
996997

997998
### Example
998999

@@ -1348,15 +1349,15 @@ int main()
13481349

13491350
## <a name="size_type"></a> `array::size_type`
13501351

1351-
The type of an unsigned distance between two element.
1352+
The type of an unsigned distance between two elements.
13521353

13531354
```cpp
13541355
typedef std::size_t size_type;
13551356
```
13561357

13571358
### Remarks
13581359

1359-
The unsigned integer type describes an object that can represent the length of any controlled sequence. It is a synonym for the type `std::size_t`.
1360+
The unsigned integer type describes an object that can represent the length of any controlled sequence. It's a synonym for the type `std::size_t`.
13601361

13611362
### Example
13621363

@@ -1405,9 +1406,9 @@ Array to swap contents with.
14051406
14061407
### Remarks
14071408
1408-
The member function swaps the controlled sequences between **`*this`** and *right*. It performs a number of element assignments and constructor calls proportional to `N`.
1409+
The member function swaps the controlled sequences between **`*this`** and *right*. It performs many element assignments and constructor calls proportional to `N`.
14091410
1410-
There is also a non-member [`swap`](array-functions.md#swap) function available to swap two **`array`** instances.
1411+
There's also a non-member [`swap`](array-functions.md#swap) function available to swap two **`array`** instances.
14111412
14121413
### Example
14131414

0 commit comments

Comments
 (0)