summaryrefslogtreecommitdiff
path: root/absl/container
diff options
context:
space:
mode:
authorGravatar Abseil Team <absl-team@google.com>2020-09-14 07:33:19 -0700
committerGravatar Gennadiy Rozental <rogeeff@google.com>2020-09-16 06:16:20 -0400
commitc1ae0a497586edd38b0261846b8e4afdcfa30f0b (patch)
tree3fb8903861953b97e6328d10f6cf72318329770f /absl/container
parent6af91b35109cb35ae53cfe908e31a0c31c4a47f3 (diff)
Export of internal Abseil changes
-- 14d42e9d0b8aed0c0f00900cd6fd790908930de5 by Gennadiy Rozental <rogeeff@google.com>: Fix gcc ci build command for LTS PiperOrigin-RevId: 331543198 -- f1655ec91a4ad656dd1100cf2e134d08941278ca by Abseil Team <absl-team@google.com>: Consistently document size_type return value of all map/set types. PiperOrigin-RevId: 331528359 GitOrigin-RevId: 14d42e9d0b8aed0c0f00900cd6fd790908930de5 Change-Id: I33ebba4acb3e5918e4e112f03c81aba529dcd0b4
Diffstat (limited to 'absl/container')
-rw-r--r--absl/container/btree_map.h2
-rw-r--r--absl/container/btree_set.h2
-rw-r--r--absl/container/flat_hash_map.h3
-rw-r--r--absl/container/flat_hash_set.h3
-rw-r--r--absl/container/node_hash_map.h3
-rw-r--r--absl/container/node_hash_set.h3
6 files changed, 10 insertions, 6 deletions
diff --git a/absl/container/btree_map.h b/absl/container/btree_map.h
index 448ac48a..abc09b0a 100644
--- a/absl/container/btree_map.h
+++ b/absl/container/btree_map.h
@@ -185,7 +185,7 @@ class btree_map
// template <typename K> size_type erase(const K& key):
//
// Erases the element with the matching key, if it exists, returning the
- // number of elements erased.
+ // number of elements erased (0 or 1).
using Base::erase;
// btree_map::insert()
diff --git a/absl/container/btree_set.h b/absl/container/btree_set.h
index d3e78866..21ef0a03 100644
--- a/absl/container/btree_set.h
+++ b/absl/container/btree_set.h
@@ -183,7 +183,7 @@ class btree_set
// template <typename K> size_type erase(const K& key):
//
// Erases the element with the matching key, if it exists, returning the
- // number of elements erased.
+ // number of elements erased (0 or 1).
using Base::erase;
// btree_set::insert()
diff --git a/absl/container/flat_hash_map.h b/absl/container/flat_hash_map.h
index dbd37d3c..74def0df 100644
--- a/absl/container/flat_hash_map.h
+++ b/absl/container/flat_hash_map.h
@@ -234,7 +234,8 @@ class flat_hash_map : public absl::container_internal::raw_hash_map<
//
// size_type erase(const key_type& key):
//
- // Erases the element with the matching key, if it exists.
+ // Erases the element with the matching key, if it exists, returning the
+ // number of elements erased (0 or 1).
using Base::erase;
// flat_hash_map::insert()
diff --git a/absl/container/flat_hash_set.h b/absl/container/flat_hash_set.h
index 94be6e3d..81e145aa 100644
--- a/absl/container/flat_hash_set.h
+++ b/absl/container/flat_hash_set.h
@@ -227,7 +227,8 @@ class flat_hash_set
//
// size_type erase(const key_type& key):
//
- // Erases the element with the matching key, if it exists.
+ // Erases the element with the matching key, if it exists, returning the
+ // number of elements erased (0 or 1).
using Base::erase;
// flat_hash_set::insert()
diff --git a/absl/container/node_hash_map.h b/absl/container/node_hash_map.h
index 9852ff7f..7a39f628 100644
--- a/absl/container/node_hash_map.h
+++ b/absl/container/node_hash_map.h
@@ -225,7 +225,8 @@ class node_hash_map
//
// size_type erase(const key_type& key):
//
- // Erases the element with the matching key, if it exists.
+ // Erases the element with the matching key, if it exists, returning the
+ // number of elements erased (0 or 1).
using Base::erase;
// node_hash_map::insert()
diff --git a/absl/container/node_hash_set.h b/absl/container/node_hash_set.h
index 56bab5c2..56ce3b66 100644
--- a/absl/container/node_hash_set.h
+++ b/absl/container/node_hash_set.h
@@ -217,7 +217,8 @@ class node_hash_set
//
// size_type erase(const key_type& key):
//
- // Erases the element with the matching key, if it exists.
+ // Erases the element with the matching key, if it exists, returning the
+ // number of elements erased (0 or 1).
using Base::erase;
// node_hash_set::insert()