util/IntrusiveHashSet: rename insert() to insert_commit()
Clarify that the method is not a freestanding insertion method but should only be used after insert_check().
This commit is contained in:
parent
e133f621a4
commit
42d5b05f54
@ -31,7 +31,7 @@ RemoteTagCache::Lookup(const std::string &uri) noexcept
|
||||
auto [tag, value] = map.insert_check(uri);
|
||||
if (value) {
|
||||
auto item = new Item(*this, uri);
|
||||
map.insert(tag, *item);
|
||||
map.insert_commit(tag, *item);
|
||||
waiting_list.push_back(*item);
|
||||
lock.unlock();
|
||||
|
||||
|
@ -235,7 +235,7 @@ public:
|
||||
*
|
||||
* @param bucket the bucket returned by insert_check()
|
||||
*/
|
||||
constexpr void insert(bucket_iterator bucket, reference item) noexcept {
|
||||
constexpr void insert_commit(bucket_iterator bucket, reference item) noexcept {
|
||||
++counter;
|
||||
GetBucket(item).insert(bucket, item);
|
||||
}
|
||||
|
@ -43,7 +43,7 @@ TEST(IntrusiveHashSet, Basic)
|
||||
{
|
||||
auto [position, inserted] = set.insert_check(2);
|
||||
ASSERT_TRUE(inserted);
|
||||
set.insert(position, b);
|
||||
set.insert_commit(position, b);
|
||||
}
|
||||
|
||||
ASSERT_FALSE(set.insert_check(2).second);
|
||||
@ -52,7 +52,7 @@ TEST(IntrusiveHashSet, Basic)
|
||||
{
|
||||
auto [position, inserted] = set.insert_check(a);
|
||||
ASSERT_TRUE(inserted);
|
||||
set.insert(position, a);
|
||||
set.insert_commit(position, a);
|
||||
}
|
||||
|
||||
set.insert(c);
|
||||
@ -100,7 +100,7 @@ TEST(IntrusiveHashSet, Basic)
|
||||
{
|
||||
auto [position, inserted] = set.insert_check(f);
|
||||
ASSERT_TRUE(inserted);
|
||||
set.insert(position, f);
|
||||
set.insert_commit(position, f);
|
||||
}
|
||||
|
||||
ASSERT_EQ(set.find(a), set.iterator_to(f));
|
||||
|
Loading…
Reference in New Issue
Block a user