std::flat_multimap<Key,T,Compare,KeyContainer,MappedContainer>:: replace
From zh.cppreference.net
<
cpp
|
container
|
flat multimap
C++
Containers library
|
(C++17)
|
||||
| Sequence | ||||
|
(C++11)
|
||||
|
(C++26)
|
||||
|
(C++26)
|
||||
|
(C++11)
|
||||
| Associative | ||||
| Unordered associative | ||||
|
(C++11)
|
||||
|
(C++11)
|
||||
|
(C++11)
|
||||
|
(C++11)
|
||||
| Adaptors | ||||
|
(C++23)
|
||||
|
(C++23)
|
||||
|
(C++23)
|
||||
|
(C++23)
|
||||
| Views | ||||
|
(C++20)
|
||||
|
(C++23)
|
||||
| Tables | ||||
| Iterator invalidation | ||||
| Member function table | ||||
| Non-member function table |
std::flat_multimap
| Member types | ||||
| Member functions | ||||
| Non-member functions | ||||
| Helper classes | ||||
| Tags | ||||
| Deduction guides | ||||
|
void
replace
(
key_container_type
&&
key_cont, mapped_container_type
&&
mapped_cont
)
;
|
(自 C++23 起) | |
替换底层容器
c
。等价于:
c.keys = std::move(key_cont); c.values = std::move(mapped_cont);
必须满足以下条件:
- 表达式 key_cont. size ( ) == mapped_cont. size ( ) 为 true ,
-
key_cont
的元素相对于
compare已排序。否则,行为未定义。
内容参数
复杂度等同于对适配容器应用 std::move 的复杂度。 示例运行此代码 #include <algorithm>
#include <cassert>
#include <flat_map>
#include <print>
#include <utility>
#include <vector>
int main()
{
std::vector<int> keys{1, 2, 3};
assert(std::ranges::is_sorted(keys));
std::vector<double> values{2.2, 3.3, 1.1};
assert(keys.size() == values.size());
std::flat_multimap<int, double> map;
assert(map.empty());
map.replace(std::move(keys), std::move(values));
assert(map.size() == 3);
assert(map.keys().size() == 3);
assert(map.values().size() == 3);
assert(keys.empty());
assert(values.empty());
std::println("{}", map);
}
输出: {1: 2.2, 2: 3.3, 3: 1.1}
参见
|