Skip to content

Commit 01934f7

Browse files
authored
Resolve rogue ConcRT reference syntax
1 parent bbf4e08 commit 01934f7

File tree

5 files changed

+11
-46
lines changed

5 files changed

+11
-46
lines changed

docs/parallel/concrt/reference/concurrent-priority-queue-class.md

Lines changed: 3 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -14,10 +14,9 @@ The `concurrent_priority_queue` class is a container that allows multiple thread
1414

1515
```cpp
1616
template <typename T,
17-
typename _Compare= std::less<T>,
18-
typename _Ax = std::allocator<T>
19-
>,
20-
typename _Ax = std::allocator<T>> class concurrent_priority_queue;
17+
typename _Compare = std::less<T>,
18+
typename _Ax = std::allocator<T>>
19+
class concurrent_priority_queue;
2120
```
2221

2322
### Parameters

docs/parallel/concrt/reference/concurrent-unordered-map-class.md

Lines changed: 2 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -16,18 +16,8 @@ template <typename K,
1616
typename _Element_type,
1717
typename _Hasher = std::hash<K>,
1818
typename key_equality = std::equal_to<K>,
19-
typename _Allocator_type = std::allocator<std::pair<const K,
20-
_Element_type>>
21-
>,
22-
typename key_equality = std::equal_to<K>,
23-
typename _Allocator_type = std::allocator<std::pair<const K,
24-
_Element_type>>> class concurrent_unordered_map : public details::_Concurrent_hash<details::_Concurrent_unordered_map_traits<K,
25-
_Element_type,
26-
details::_Hash_compare<K,
27-
_Hasher,
28-
key_equality>,
29-
_Allocator_type,
30-
false>>;
19+
typename _Allocator_type = std::allocator<std::pair<const K, _Element_type>>>
20+
class concurrent_unordered_map : public details::_Concurrent_hash<details::_Concurrent_unordered_map_traits<K, _Element_type, details::_Hash_compare<K, _Hasher, key_equality>, _Allocator_type, false>>;
3121
```
3222
3323
### Parameters

docs/parallel/concrt/reference/concurrent-unordered-multimap-class.md

Lines changed: 2 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -16,18 +16,8 @@ template <typename K,
1616
typename _Element_type,
1717
typename _Hasher = std::hash<K>,
1818
typename key_equality = std::equal_to<K>,
19-
typename _Allocator_type = std::allocator<std::pair<const K,
20-
_Element_type>>
21-
>,
22-
typename key_equality = std::equal_to<K>,
23-
typename _Allocator_type = std::allocator<std::pair<const K,
24-
_Element_type>>> class concurrent_unordered_multimap : public details::_Concurrent_hash<details::_Concurrent_unordered_map_traits<K,
25-
_Element_type,
26-
details::_Hash_compare<K,
27-
_Hasher,
28-
key_equality>,
29-
_Allocator_type,
30-
true>>;
19+
typename _Allocator_type = std::allocator<std::pair<const K, _Element_type>>>
20+
class concurrent_unordered_multimap : public details::_Concurrent_hash<details::_Concurrent_unordered_map_traits<K, _Element_type, details::_Hash_compare<K, _Hasher, key_equality>, _Allocator_type, true>>;
3121
```
3222
3323
### Parameters

docs/parallel/concrt/reference/concurrent-unordered-multiset-class.md

Lines changed: 2 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -15,15 +15,8 @@ The `concurrent_unordered_multiset` class is an concurrency-safe container that
1515
template <typename K,
1616
typename _Hasher = std::hash<K>,
1717
typename key_equality = std::equal_to<K>,
18-
typename _Allocator_type = std::allocator<K>
19-
>,
20-
typename key_equality = std::equal_to<K>,
21-
typename _Allocator_type = std::allocator<K>> class concurrent_unordered_multiset : public details::_Concurrent_hash<details::_Concurrent_unordered_set_traits<K,
22-
details::_Hash_compare<K,
23-
_Hasher,
24-
key_equality>,
25-
_Allocator_type,
26-
true>>;
18+
typename _Allocator_type = std::allocator<K>>
19+
class concurrent_unordered_multiset : public details::_Concurrent_hash<details::_Concurrent_unordered_set_traits<K, details::_Hash_compare<K, _Hasher, key_equality>, _Allocator_type, true>>;
2720
```
2821
2922
### Parameters

docs/parallel/concrt/reference/concurrent-unordered-set-class.md

Lines changed: 2 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -15,15 +15,8 @@ The `concurrent_unordered_set` class is an concurrency-safe container that contr
1515
template <typename K,
1616
typename _Hasher = std::hash<K>,
1717
typename key_equality = std::equal_to<K>,
18-
typename _Allocator_type = std::allocator<K>
19-
>,
20-
typename key_equality = std::equal_to<K>,
21-
typename _Allocator_type = std::allocator<K>> class concurrent_unordered_set : public details::_Concurrent_hash<details::_Concurrent_unordered_set_traits<K,
22-
details::_Hash_compare<K,
23-
_Hasher,
24-
key_equality>,
25-
_Allocator_type,
26-
false>>;
18+
typename _Allocator_type = std::allocator<K>>
19+
class concurrent_unordered_set : public details::_Concurrent_hash<details::_Concurrent_unordered_set_traits<K, details::_Hash_compare<K, _Hasher, key_equality>, _Allocator_type, false>>;
2720
```
2821
2922
### Parameters

0 commit comments

Comments
 (0)