Add removeAll method to sets and maps and use them

Source/wtf/HashMap.h

 /*
  * Copyright (C) 2005, 2006, 2007, 2008, 2011 Apple Inc. All rights reserved.
  *
  * 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,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
@@ skipping 108 matching lines @@
         AddResult set(KeyPeekInType, MappedPassInType);
 
         // does nothing if key is already present
         // return value is a pair of the iterator to the key location,
         // and a boolean that's true if a new value was actually added
         AddResult add(KeyPeekInType, MappedPassInType);
 
         void remove(KeyPeekInType);
         void remove(iterator);
         void clear();
+        template<typename Collection>
+        void removeAll(const Collection& toBeRemoved) { WTF::removeAll(*this, toBeRemoved); }
 
         MappedPassOutType take(KeyPeekInType); // efficient combination of get with remove
 
         // An alternate version of find() that finds the object by hashing and comparing
         // with some other type, to avoid the cost of type conversion. HashTranslator
         // must have the following function members:
         //   static unsigned hash(const T&);
         //   static bool equal(const ValueType&, const T&);
         template<typename HashTranslator, typename T> iterator find(const T&);
         template<typename HashTranslator, typename T> const_iterator find(const T&) const;
@@ skipping 368 matching lines @@
         iterator end = collection.end().values();
         for (unsigned i = 0; it != end; ++it, ++i)
             vector[i] = *it;
     }
 
 } // namespace WTF
 
 using WTF::HashMap;
 
 #endif /* WTF_HashMap_h */