Add removeAll method to sets and maps and use them

Source/wtf/ListHashSet.h

 /*
  * Copyright (C) 2005, 2006, 2007, 2008, 2011, 2012 Apple Inc. All rights reserved.
  * Copyright (C) 2011, Benjamin Poulain <ikipou@gmail.com>
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
  * License as published by the Free Software Foundation; either
  * version 2 of the License, or (at your option) any later version.
  *
  * This library is distributed in the hope that it will be useful,
@@ skipping 138 matching lines @@
         // Add the value to the beginning of the collection. If the value was already in
         // the list, it is moved to the beginning.
         AddResult prependOrMoveToFirst(ValuePeekInType);
 
         AddResult insertBefore(ValuePeekInType beforeValue, ValuePeekInType newValue);
         AddResult insertBefore(iterator, ValuePeekInType);
 
         void remove(ValuePeekInType);
         void remove(iterator);
         void clear();
+        template<typename Collection>
+        void removeAll(const Collection& other);
 
     private:
         void unlink(Node*);
         void unlinkAndDelete(Node*);
         void appendNode(Node*);
         void prependNode(Node*);
         void insertNodeBefore(Node* beforeNode, Node* newNode);
         void deleteAllNodes();
         void createAllocatorIfNeeded();
 
@@ skipping 662 matching lines @@
     template<typename T, size_t inlineCapacity, typename U>
     inline void ListHashSet<T, inlineCapacity, U>::clear()
     {
         deleteAllNodes();
         m_impl.clear();
         m_head = 0;
         m_tail = 0;
     }
 
     template<typename T, size_t inlineCapacity, typename U>
+    template<typename Collection>
+    inline void ListHashSet<T, inlineCapacity, U>::removeAll(const Collection& other)
+    {
+        if (other.isEmpty() || isEmpty())
+            return;
+        typedef typename Collection::const_iterator CollectionIterator;
+        CollectionIterator otherEnd(other.end());
+        for (CollectionIterator it(other.begin()); it != otherEnd; ++it)
+            remove(*it);
+    }
+
+    template<typename T, size_t inlineCapacity, typename U>
     void ListHashSet<T, inlineCapacity, U>::unlink(Node* node)
     {
         if (!node->m_prev) {
             ASSERT(node == m_head);
             m_head = node->m_next;
         } else {
             ASSERT(node != m_head);
             node->m_prev->m_next = node->m_next;
         }
 
@@ skipping 117 matching lines @@
     inline void deleteAllValues(const ListHashSet<T, inlineCapacity, U>& collection)
     {
         deleteAllValues<true, typename ListHashSet<T, inlineCapacity, U>::ValueType>(collection.m_impl);
     }
 
 } // namespace WTF
 
 using WTF::ListHashSet;
 
 #endif /* WTF_ListHashSet_h */