OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2011 Google Inc. All Rights Reserved. | 2 * Copyright (C) 2011 Google Inc. All Rights Reserved. |
3 * Copyright (C) 2012 Apple Inc. All Rights Reserved. | 3 * Copyright (C) 2012 Apple Inc. All Rights Reserved. |
4 * | 4 * |
5 * Redistribution and use in source and binary forms, with or without | 5 * Redistribution and use in source and binary forms, with or without |
6 * modification, are permitted provided that the following conditions | 6 * modification, are permitted provided that the following conditions |
7 * are met: | 7 * are met: |
8 * 1. Redistributions of source code must retain the above copyright | 8 * 1. Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * 2. Redistributions in binary form must reproduce the above copyright | 10 * 2. Redistributions in binary form must reproduce the above copyright |
(...skipping 39 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
50 // the destructor. | 50 // the destructor. |
51 class TreeScope : public WillBeGarbageCollectedMixin { | 51 class TreeScope : public WillBeGarbageCollectedMixin { |
52 public: | 52 public: |
53 TreeScope* parentTreeScope() const { return m_parentTreeScope; } | 53 TreeScope* parentTreeScope() const { return m_parentTreeScope; } |
54 | 54 |
55 TreeScope* olderShadowRootOrParentTreeScope() const; | 55 TreeScope* olderShadowRootOrParentTreeScope() const; |
56 bool isInclusiveOlderSiblingShadowRootOrAncestorTreeScopeOf(const TreeScope&
) const; | 56 bool isInclusiveOlderSiblingShadowRootOrAncestorTreeScopeOf(const TreeScope&
) const; |
57 | 57 |
58 Element* adjustedFocusedElement() const; | 58 Element* adjustedFocusedElement() const; |
59 Element* getElementById(const AtomicString&) const; | 59 Element* getElementById(const AtomicString&) const; |
60 const WillBeHeapVector<RawPtrWillBeMember<Element> >& getAllElementsById(con
st AtomicString&) const; | 60 const WillBeHeapVector<RawPtrWillBeMember<Element>>& getAllElementsById(cons
t AtomicString&) const; |
61 bool hasElementWithId(const AtomicString& id) const; | 61 bool hasElementWithId(const AtomicString& id) const; |
62 bool containsMultipleElementsWithId(const AtomicString& id) const; | 62 bool containsMultipleElementsWithId(const AtomicString& id) const; |
63 void addElementById(const AtomicString& elementId, Element*); | 63 void addElementById(const AtomicString& elementId, Element*); |
64 void removeElementById(const AtomicString& elementId, Element*); | 64 void removeElementById(const AtomicString& elementId, Element*); |
65 | 65 |
66 Document& document() const | 66 Document& document() const |
67 { | 67 { |
68 ASSERT(m_document); | 68 ASSERT(m_document); |
69 return *m_document; | 69 return *m_document; |
70 } | 70 } |
(...skipping 134 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
205 return m_elementsById && m_elementsById->containsMultiple(id); | 205 return m_elementsById && m_elementsById->containsMultiple(id); |
206 } | 206 } |
207 | 207 |
208 DEFINE_COMPARISON_OPERATORS_WITH_REFERENCES(TreeScope) | 208 DEFINE_COMPARISON_OPERATORS_WITH_REFERENCES(TreeScope) |
209 | 209 |
210 HitTestResult hitTestInDocument(const Document*, int x, int y); | 210 HitTestResult hitTestInDocument(const Document*, int x, int y); |
211 | 211 |
212 } // namespace blink | 212 } // namespace blink |
213 | 213 |
214 #endif // TreeScope_h | 214 #endif // TreeScope_h |
OLD | NEW |