2 * Copyright (C) 2011 Google Inc. All Rights Reserved.
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
7 * 1. Redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer.
9 * 2. Redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution.
13 * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
14 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
20 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
21 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
23 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29 #include "ContainerNode.h"
30 #include "DocumentOrderedMap.h"
37 class TreeScope : public ContainerNode {
38 friend class Document;
41 TreeScope* parentTreeScope() const { return m_parentTreeScope; }
42 void setParentTreeScope(TreeScope*);
44 Element* getElementById(const AtomicString&) const;
45 bool hasElementWithId(AtomicStringImpl* id) const;
46 bool containsMultipleElementsWithId(const AtomicString& id) const;
47 void addElementById(const AtomicString& elementId, Element*);
48 void removeElementById(const AtomicString& elementId, Element*);
50 void addImageMap(HTMLMapElement*);
51 void removeImageMap(HTMLMapElement*);
52 HTMLMapElement* getImageMap(const String& url) const;
54 void addNodeListCache() { ++m_numNodeListCaches; }
55 void removeNodeListCache() { ASSERT(m_numNodeListCaches > 0); --m_numNodeListCaches; }
56 bool hasNodeListCaches() const { return m_numNodeListCaches; }
58 // Find first anchor with the given name.
59 // First searches for an element with the given ID, but if that fails, then looks
60 // for an anchor with the given name. ID matching is always case sensitive, but
61 // Anchor name matching is case sensitive in strict mode and not case sensitive in
62 // quirks mode for historical compatibility reasons.
63 Element* findAnchor(const String& name);
65 virtual bool applyAuthorSheets() const;
71 void destroyTreeScopeData();
74 TreeScope* m_parentTreeScope;
76 DocumentOrderedMap m_elementsById;
77 DocumentOrderedMap m_imageMapsByName;
79 unsigned m_numNodeListCaches;
82 inline bool TreeScope::hasElementWithId(AtomicStringImpl* id) const
85 return m_elementsById.contains(id);
88 inline bool TreeScope::containsMultipleElementsWithId(const AtomicString& id) const
90 return m_elementsById.containsMultiple(id.impl());
93 } // namespace WebCore