DocumentOrderedMap.cpp [plain text]
#include "config.h"
#include "DocumentOrderedMap.h"
#include "Element.h"
#include "HTMLMapElement.h"
#include "HTMLNames.h"
#include "TreeScope.h"
namespace WebCore {
using namespace HTMLNames;
inline bool keyMatchesId(AtomicStringImpl* key, Element* element)
{
return element->hasID() && element->getIdAttribute().impl() == key;
}
inline bool keyMatchesMapName(AtomicStringImpl* key, Element* element)
{
return element->hasTagName(mapTag) && static_cast<HTMLMapElement*>(element)->getName().impl() == key;
}
inline bool keyMatchesLowercasedMapName(AtomicStringImpl* key, Element* element)
{
return element->hasTagName(mapTag) && static_cast<HTMLMapElement*>(element)->getName().lower().impl() == key;
}
void DocumentOrderedMap::clear()
{
m_map.clear();
m_duplicateCounts.clear();
}
void DocumentOrderedMap::add(AtomicStringImpl* key, Element* element)
{
ASSERT(key);
ASSERT(element);
if (!m_duplicateCounts.contains(key)) {
pair<Map::iterator, bool> addResult = m_map.add(key, element);
if (addResult.second)
return;
m_map.remove(addResult.first);
m_duplicateCounts.add(key);
} else {
Map::iterator cachedItem = m_map.find(key);
if (cachedItem != m_map.end()) {
m_map.remove(cachedItem);
m_duplicateCounts.add(key);
}
}
m_duplicateCounts.add(key);
}
void DocumentOrderedMap::remove(AtomicStringImpl* key, Element* element)
{
ASSERT(key);
ASSERT(element);
m_map.checkConsistency();
Map::iterator cachedItem = m_map.find(key);
if (cachedItem != m_map.end() && cachedItem->second == element)
m_map.remove(cachedItem);
else
m_duplicateCounts.remove(key);
}
template<bool keyMatches(AtomicStringImpl*, Element*)>
inline Element* DocumentOrderedMap::get(AtomicStringImpl* key, const TreeScope* scope) const
{
ASSERT(key);
m_map.checkConsistency();
Element* element = m_map.get(key);
if (element)
return element;
if (m_duplicateCounts.contains(key)) {
for (Node* node = scope->firstChild(); node; node = node->traverseNextNode()) {
if (!node->isElementNode())
continue;
element = static_cast<Element*>(node);
if (!keyMatches(key, element))
continue;
m_duplicateCounts.remove(key);
m_map.set(key, element);
return element;
}
ASSERT_NOT_REACHED();
}
return 0;
}
Element* DocumentOrderedMap::getElementById(AtomicStringImpl* key, const TreeScope* scope) const
{
return get<keyMatchesId>(key, scope);
}
Element* DocumentOrderedMap::getElementByMapName(AtomicStringImpl* key, const TreeScope* scope) const
{
return get<keyMatchesMapName>(key, scope);
}
Element* DocumentOrderedMap::getElementByLowercasedMapName(AtomicStringImpl* key, const TreeScope* scope) const
{
return get<keyMatchesLowercasedMapName>(key, scope);
}
}