| 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 116 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 127 void removedLastRefToScope(); | 127 void removedLastRefToScope(); |
| 128 | 128 |
| 129 bool isInclusiveAncestorOf(const TreeScope&) const; | 129 bool isInclusiveAncestorOf(const TreeScope&) const; |
| 130 unsigned short comparePosition(const TreeScope&) const; | 130 unsigned short comparePosition(const TreeScope&) const; |
| 131 | 131 |
| 132 const TreeScope* commonAncestorTreeScope(const TreeScope& other) const; | 132 const TreeScope* commonAncestorTreeScope(const TreeScope& other) const; |
| 133 TreeScope* commonAncestorTreeScope(TreeScope& other); | 133 TreeScope* commonAncestorTreeScope(TreeScope& other); |
| 134 | 134 |
| 135 Element* getElementByAccessKey(const String& key) const; | 135 Element* getElementByAccessKey(const String& key) const; |
| 136 | 136 |
| 137 virtual void trace(Visitor*); | 137 DECLARE_VIRTUAL_TRACE(); |
| 138 | 138 |
| 139 ScopedStyleResolver* scopedStyleResolver() const { return m_scopedStyleResol
ver.get(); } | 139 ScopedStyleResolver* scopedStyleResolver() const { return m_scopedStyleResol
ver.get(); } |
| 140 ScopedStyleResolver& ensureScopedStyleResolver(); | 140 ScopedStyleResolver& ensureScopedStyleResolver(); |
| 141 void clearScopedStyleResolver(); | 141 void clearScopedStyleResolver(); |
| 142 | 142 |
| 143 protected: | 143 protected: |
| 144 TreeScope(ContainerNode&, Document&); | 144 TreeScope(ContainerNode&, Document&); |
| 145 TreeScope(Document&); | 145 TreeScope(Document&); |
| 146 virtual ~TreeScope(); | 146 virtual ~TreeScope(); |
| 147 | 147 |
| (...skipping 57 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 |