Add removeAll method to sets and maps and use them

Source/wtf/LinkedHashSet.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 222 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 it, ValuePeekInType newValue) { return m_impl.template add<NodeHashFunctions>(newValue, it.node()); }
 
     void remove(ValuePeekInType);
     void remove(iterator);
     void clear() { m_impl.clear(); }
+    template<typename Collection>
+    void removeAll(const Collection& other) { WTF::removeAll(*this, other); }
 
     void trace(typename Allocator::Visitor* visitor) { m_impl.trace(visitor); }
 
     int64_t modifications() const { return m_impl.modifications(); }
     void checkModifications(int64_t mods) const { m_impl.checkModifications(mods); }
 
 private:
     Node* anchor() { return reinterpret_cast<Node*>(&m_anchor); }
     const Node* anchor() const { return reinterpret_cast<const Node*>(&m_anchor); }
     Node* firstNode() { return reinterpret_cast<Node*>(m_anchor.m_next); }
@@ skipping 452 matching lines @@
     iterator end = set.end();
     for (iterator it = set.begin(); it != end; ++it)
         delete *it;
 }
 
 }
 
 using WTF::LinkedHashSet;
 
 #endif /* WTF_LinkedHashSet_h */