| 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 26 matching lines...) Expand all Loading... |
| 37 class DOMSelection; | 37 class DOMSelection; |
| 38 class Document; | 38 class Document; |
| 39 class Element; | 39 class Element; |
| 40 class HitTestResult; | 40 class HitTestResult; |
| 41 class ScopedStyleResolver; | 41 class ScopedStyleResolver; |
| 42 class Node; | 42 class Node; |
| 43 | 43 |
| 44 // A class which inherits both Node and TreeScope must call clearRareData() in i
ts destructor | 44 // A class which inherits both Node and TreeScope must call clearRareData() in i
ts destructor |
| 45 // so that the Node destructor no longer does problematic NodeList cache manipul
ation in | 45 // so that the Node destructor no longer does problematic NodeList cache manipul
ation in |
| 46 // the destructor. | 46 // the destructor. |
| 47 class TreeScope : public DummyBase<void> { | 47 class TreeScope { |
| 48 public: | 48 public: |
| 49 TreeScope* parentTreeScope() const { return m_parentTreeScope; } | 49 TreeScope* parentTreeScope() const { return m_parentTreeScope; } |
| 50 | 50 |
| 51 TreeScope* olderShadowRootOrParentTreeScope() const; | 51 TreeScope* olderShadowRootOrParentTreeScope() const; |
| 52 bool isInclusiveOlderSiblingShadowRootOrAncestorTreeScopeOf(const TreeScope&
) const; | 52 bool isInclusiveOlderSiblingShadowRootOrAncestorTreeScopeOf(const TreeScope&
) const; |
| 53 | 53 |
| 54 Element* adjustedFocusedElement() const; | 54 Element* adjustedFocusedElement() const; |
| 55 Element* getElementById(const AtomicString&) const; | 55 Element* getElementById(const AtomicString&) const; |
| 56 void addElementById(const AtomicString& elementId, Element*); | 56 void addElementById(const AtomicString& elementId, Element*); |
| 57 void removeElementById(const AtomicString& elementId, Element*); | 57 void removeElementById(const AtomicString& elementId, Element*); |
| (...skipping 114 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 172 }; | 172 }; |
| 173 | 173 |
| 174 DEFINE_COMPARISON_OPERATORS_WITH_REFERENCES(TreeScope) | 174 DEFINE_COMPARISON_OPERATORS_WITH_REFERENCES(TreeScope) |
| 175 | 175 |
| 176 HitTestResult hitTestInDocument(const Document*, int x, int y); | 176 HitTestResult hitTestInDocument(const Document*, int x, int y); |
| 177 TreeScope* commonTreeScope(Node*, Node*); | 177 TreeScope* commonTreeScope(Node*, Node*); |
| 178 | 178 |
| 179 } // namespace blink | 179 } // namespace blink |
| 180 | 180 |
| 181 #endif // TreeScope_h | 181 #endif // TreeScope_h |
| OLD | NEW |