Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(257)

Unified Diff: third_party/WebKit/Source/platform/wtf/ListHashSet.h

Issue 2804953004: Migrate WTF::HashTable::add() to ::insert() (Closed)
Patch Set: Created 3 years, 8 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View side-by-side diff with in-line comments
Download patch
« no previous file with comments | « third_party/WebKit/Source/platform/wtf/LinkedHashSet.h ('k') | no next file » | no next file with comments »
Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
Index: third_party/WebKit/Source/platform/wtf/ListHashSet.h
diff --git a/third_party/WebKit/Source/platform/wtf/ListHashSet.h b/third_party/WebKit/Source/platform/wtf/ListHashSet.h
index 2cf4c18c324ba5794898f58fc590463612b2e700..9c3a87f77d090dc746c2424421b92cade5494f43 100644
--- a/third_party/WebKit/Source/platform/wtf/ListHashSet.h
+++ b/third_party/WebKit/Source/platform/wtf/ListHashSet.h
@@ -922,7 +922,7 @@ ListHashSet<T, inlineCapacity, U, V>::insert(IncomingValueType&& value) {
// because it lets it take lvalues by reference, but for our purposes it's
// inconvenient, since it constrains us to be const, whereas the allocator
// actually changes when it does allocations.
- auto result = m_impl.template add<BaseTranslator>(
+ auto result = m_impl.template insert<BaseTranslator>(
std::forward<IncomingValueType>(value), *this->getAllocator());
if (result.isNewEntry)
appendNode(*result.storedValue);
@@ -943,7 +943,7 @@ typename ListHashSet<T, inlineCapacity, U, V>::AddResult
ListHashSet<T, inlineCapacity, U, V>::appendOrMoveToLast(
IncomingValueType&& value) {
createAllocatorIfNeeded();
- auto result = m_impl.template add<BaseTranslator>(
+ auto result = m_impl.template insert<BaseTranslator>(
std::forward<IncomingValueType>(value), *this->getAllocator());
Node* node = *result.storedValue;
if (!result.isNewEntry)
@@ -958,7 +958,7 @@ typename ListHashSet<T, inlineCapacity, U, V>::AddResult
ListHashSet<T, inlineCapacity, U, V>::prependOrMoveToFirst(
IncomingValueType&& value) {
createAllocatorIfNeeded();
- auto result = m_impl.template add<BaseTranslator>(
+ auto result = m_impl.template insert<BaseTranslator>(
std::forward<IncomingValueType>(value), *this->getAllocator());
Node* node = *result.storedValue;
if (!result.isNewEntry)
@@ -974,7 +974,7 @@ ListHashSet<T, inlineCapacity, U, V>::insertBefore(
iterator it,
IncomingValueType&& newValue) {
createAllocatorIfNeeded();
- auto result = m_impl.template add<BaseTranslator>(
+ auto result = m_impl.template insert<BaseTranslator>(
std::forward<IncomingValueType>(newValue), *this->getAllocator());
if (result.isNewEntry)
insertNodeBefore(it.getNode(), *result.storedValue);
« no previous file with comments | « third_party/WebKit/Source/platform/wtf/LinkedHashSet.h ('k') | no next file » | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698