tmp/tmpe2_1fqhv/{from.md → to.md}
RENAMED
|
@@ -0,0 +1,47 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
### Header `<flat_map>` synopsis <a id="flat.map.syn">[[flat.map.syn]]</a>
|
| 2 |
+
|
| 3 |
+
``` cpp
|
| 4 |
+
#include <compare> // see [compare.syn]
|
| 5 |
+
#include <initializer_list> // see [initializer.list.syn]
|
| 6 |
+
|
| 7 |
+
namespace std {
|
| 8 |
+
// [flat.map], class template flat_map
|
| 9 |
+
template<class Key, class T, class Compare = less<Key>,
|
| 10 |
+
class KeyContainer = vector<Key>, class MappedContainer = vector<T>>
|
| 11 |
+
class flat_map;
|
| 12 |
+
|
| 13 |
+
struct sorted_unique_t { explicit sorted_unique_t() = default; };
|
| 14 |
+
inline constexpr sorted_unique_t sorted_unique{};
|
| 15 |
+
|
| 16 |
+
template<class Key, class T, class Compare, class KeyContainer, class MappedContainer,
|
| 17 |
+
class Allocator>
|
| 18 |
+
struct uses_allocator<flat_map<Key, T, Compare, KeyContainer, MappedContainer>,
|
| 19 |
+
Allocator>;
|
| 20 |
+
|
| 21 |
+
// [flat.map.erasure], erasure for flat_map
|
| 22 |
+
template<class Key, class T, class Compare, class KeyContainer, class MappedContainer,
|
| 23 |
+
class Predicate>
|
| 24 |
+
typename flat_map<Key, T, Compare, KeyContainer, MappedContainer>::size_type
|
| 25 |
+
erase_if(flat_map<Key, T, Compare, KeyContainer, MappedContainer>& c, Predicate pred);
|
| 26 |
+
|
| 27 |
+
// [flat.multimap], class template flat_multimap
|
| 28 |
+
template<class Key, class T, class Compare = less<Key>,
|
| 29 |
+
class KeyContainer = vector<Key>, class MappedContainer = vector<T>>
|
| 30 |
+
class flat_multimap;
|
| 31 |
+
|
| 32 |
+
struct sorted_equivalent_t { explicit sorted_equivalent_t() = default; };
|
| 33 |
+
inline constexpr sorted_equivalent_t sorted_equivalent{};
|
| 34 |
+
|
| 35 |
+
template<class Key, class T, class Compare, class KeyContainer, class MappedContainer,
|
| 36 |
+
class Allocator>
|
| 37 |
+
struct uses_allocator<flat_multimap<Key, T, Compare, KeyContainer, MappedContainer>,
|
| 38 |
+
Allocator>;
|
| 39 |
+
|
| 40 |
+
// [flat.multimap.erasure], erasure for flat_multimap
|
| 41 |
+
template<class Key, class T, class Compare, class KeyContainer, class MappedContainer,
|
| 42 |
+
class Predicate>
|
| 43 |
+
typename flat_multimap<Key, T, Compare, KeyContainer, MappedContainer>::size_type
|
| 44 |
+
erase_if(flat_multimap<Key, T, Compare, KeyContainer, MappedContainer>& c, Predicate pred);
|
| 45 |
+
}
|
| 46 |
+
```
|
| 47 |
+
|