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 22 matching lines...) Expand all Loading... |
33 | 33 |
34 namespace WebCore { | 34 namespace WebCore { |
35 | 35 |
36 class ContainerNode; | 36 class ContainerNode; |
37 class DOMSelection; | 37 class DOMSelection; |
38 class Document; | 38 class Document; |
39 class Element; | 39 class Element; |
40 class HTMLLabelElement; | 40 class HTMLLabelElement; |
41 class HTMLMapElement; | 41 class HTMLMapElement; |
42 class HitTestResult; | 42 class HitTestResult; |
43 class LayoutPoint; | |
44 class IdTargetObserverRegistry; | 43 class IdTargetObserverRegistry; |
45 class Node; | 44 class Node; |
46 class RenderObject; | |
47 | 45 |
48 // A class which inherits both Node and TreeScope must call clearRareData() in i
ts destructor | 46 // A class which inherits both Node and TreeScope must call clearRareData() in i
ts destructor |
49 // so that the Node destructor no longer does problematic NodeList cache manipul
ation in | 47 // so that the Node destructor no longer does problematic NodeList cache manipul
ation in |
50 // the destructor. | 48 // the destructor. |
51 class TreeScope : public WillBeGarbageCollectedMixin { | 49 class TreeScope : public WillBeGarbageCollectedMixin { |
52 public: | 50 public: |
53 TreeScope* parentTreeScope() const { return m_parentTreeScope; } | 51 TreeScope* parentTreeScope() const { return m_parentTreeScope; } |
54 | 52 |
55 TreeScope* olderShadowRootOrParentTreeScope() const; | 53 TreeScope* olderShadowRootOrParentTreeScope() const; |
56 bool isInclusiveOlderSiblingShadowRootOrAncestorTreeScopeOf(const TreeScope&
) const; | 54 bool isInclusiveOlderSiblingShadowRootOrAncestorTreeScopeOf(const TreeScope&
) const; |
(...skipping 150 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
207 inline bool operator!=(const TreeScope& a, const TreeScope& b) { return !(a == b
); } | 205 inline bool operator!=(const TreeScope& a, const TreeScope& b) { return !(a == b
); } |
208 inline bool operator!=(const TreeScope& a, const TreeScope* b) { return !(a == b
); } | 206 inline bool operator!=(const TreeScope& a, const TreeScope* b) { return !(a == b
); } |
209 inline bool operator!=(const TreeScope* a, const TreeScope& b) { return !(a == b
); } | 207 inline bool operator!=(const TreeScope* a, const TreeScope& b) { return !(a == b
); } |
210 | 208 |
211 HitTestResult hitTestInDocument(const Document*, int x, int y); | 209 HitTestResult hitTestInDocument(const Document*, int x, int y); |
212 TreeScope* commonTreeScope(Node*, Node*); | 210 TreeScope* commonTreeScope(Node*, Node*); |
213 | 211 |
214 } // namespace WebCore | 212 } // namespace WebCore |
215 | 213 |
216 #endif // TreeScope_h | 214 #endif // TreeScope_h |
OLD | NEW |