Introduce LiteralSet

Source/core/dom/QualifiedName.h

 /*
  * Copyright (C) 2005, 2006, 2009 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
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  * Library General Public License for more details.
  *
  * You should have received a copy of the GNU Library General Public License
  * along with this library; see the file COPYING.LIB.  If not, write to
  * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
  * Boston, MA 02110-1301, USA.
  *
  */
 
 #ifndef QualifiedName_h
 #define QualifiedName_h
 
-#include <wtf/Forward.h>
-#include <wtf/HashTraits.h>
-#include <wtf/RefCounted.h>
-#include <wtf/text/AtomicString.h>
+#include "wtf/Forward.h"
+#include "wtf/HashTraits.h"
+#include "wtf/LiteralSet.h"
+#include "wtf/RefCounted.h"
+#include "wtf/text/AtomicString.h"
 
 namespace WebCore {
 
 struct QualifiedNameComponents {
     StringImpl* m_prefix;
     StringImpl* m_localName;
     StringImpl* m_namespace;
 };
 
 class QualifiedName {
@@ skipping 83 matching lines @@
 inline bool operator==(const AtomicString& a, const QualifiedName& q) { return a == q.localName(); }
 inline bool operator!=(const AtomicString& a, const QualifiedName& q) { return a != q.localName(); }
 inline bool operator==(const QualifiedName& q, const AtomicString& a) { return a == q.localName(); }
 inline bool operator!=(const QualifiedName& q, const AtomicString& a) { return a != q.localName(); }
 
 inline unsigned hashComponents(const QualifiedNameComponents& buf)
 {
     return StringHasher::hashMemory<sizeof(QualifiedNameComponents)>(&buf);
 }
 
+struct QualifiedNameComparer {
+    static bool lessThan(const QualifiedName* const& a, const QualifiedName* const& b)
+    {
+        return a->impl() < b->impl();
+    }
+};
+
+typedef LiteralSet<const QualifiedName*, QualifiedNameComparer> QualifiedNameLiteralSet;
+
+struct LocalNameComparer {
+    static bool lessThan(const QualifiedName* const& a, const QualifiedName* const& b)
+    {
+        return a->localName().impl() < b->localName().impl();
+    }
+};
+
+typedef LiteralSet<const QualifiedName*, LocalNameComparer> LocalNameLiteralSet;
+
 struct QualifiedNameHash {
     static unsigned hash(const QualifiedName& name) { return hash(name.impl()); }
 
     static unsigned hash(const QualifiedName::QualifiedNameImpl* name) 
     {
         if (!name->m_existingHash)
             name->m_existingHash = name->computeHash();
         return name->m_existingHash;
     }
 
@@ skipping 16 matching lines @@
         typedef WebCore::QualifiedNameHash Hash;
     };
     
     template<> struct HashTraits<WebCore::QualifiedName> : SimpleClassHashTraits<WebCore::QualifiedName> {
         static const bool emptyValueIsZero = false;
         static WebCore::QualifiedName emptyValue() { return WebCore::nullQName(); }
     };
 }
 
 #endif