boostorg/unordered
1
0
Fork 1
mirror of https://github.com/boostorg/unordered.git synced 2025-07-31 20:04:29 +02:00
Code Issues Packages Projects Releases Wiki Activity

editorial

Browse Source
This commit is contained in:
joaquintides
2023-05-21 12:43:45 +02:00
parent 96f5983f88
commit 2a28698c8c
3 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
doc/unordered/unordered_flat_map.adoc
View File

@@ -875,7 +875,7 @@ template<class K, class... Args>
std::pair<iterator, bool> try_emplace(K&& k, Args&&... args); std::pair<iterator, bool> try_emplace(K&& k, Args&&... args);
``` ```
Inserts a new node into the container if there is no existing element with key `k` contained within it. Inserts a new element into the container if there is no existing element with key `k` contained within it.
If there is an existing element with key `k` this function does nothing. If there is an existing element with key `k` this function does nothing.
@@ -920,7 +920,7 @@ template<class K, class... Args>
iterator try_emplace(const_iterator hint, K&& k, Args&&... args); iterator try_emplace(const_iterator hint, K&& k, Args&&... args);
``` ```
Inserts a new node into the container if there is no existing element with key `k` contained within it. Inserts a new element into the container if there is no existing element with key `k` contained within it.
If there is an existing element with key `k` this function does nothing. If there is an existing element with key `k` this function does nothing.

4
doc/unordered/unordered_map.adoc
View File

@@ -1013,7 +1013,7 @@ template <class K, class... Args>
std::pair<iterator, bool> try_emplace(K&& k, Args&&... args) std::pair<iterator, bool> try_emplace(K&& k, Args&&... args)
``` ```
Inserts a new node into the container if there is no existing element with key `k` contained within it. Inserts a new element into the container if there is no existing element with key `k` contained within it.
If there is an existing element with key `k` this function does nothing. If there is an existing element with key `k` this function does nothing.
@@ -1062,7 +1062,7 @@ template<class K, class... Args>
iterator try_emplace(const_iterator hint, K&& k, Args&&... args); iterator try_emplace(const_iterator hint, K&& k, Args&&... args);
``` ```
Inserts a new node into the container if there is no existing element with key `k` contained within it. Inserts a new element into the container if there is no existing element with key `k` contained within it.
If there is an existing element with key `k` this function does nothing. If there is an existing element with key `k` this function does nothing.

4
doc/unordered/unordered_node_map.adoc
View File

@@ -945,7 +945,7 @@ template<class K, class... Args>
std::pair<iterator, bool> try_emplace(K&& k, Args&&... args); std::pair<iterator, bool> try_emplace(K&& k, Args&&... args);
``` ```
Inserts a new node into the container if there is no existing element with key `k` contained within it. Inserts a new element into the container if there is no existing element with key `k` contained within it.
If there is an existing element with key `k` this function does nothing. If there is an existing element with key `k` this function does nothing.
@@ -990,7 +990,7 @@ template<class K, class... Args>
iterator try_emplace(const_iterator hint, K&& k, Args&&... args); iterator try_emplace(const_iterator hint, K&& k, Args&&... args);
``` ```
Inserts a new node into the container if there is no existing element with key `k` contained within it. Inserts a new element into the container if there is no existing element with key `k` contained within it.
If there is an existing element with key `k` this function does nothing. If there is an existing element with key `k` this function does nothing.