OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2014 Google Inc. All Rights Reserved. | 2 * Copyright (C) 2014 Google Inc. All Rights Reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions | 5 * modification, are permitted provided that the following conditions |
6 * are met: | 6 * are met: |
7 * 1. Redistributions of source code must retain the above copyright | 7 * 1. Redistributions of source code must retain the above copyright |
8 * notice, this list of conditions and the following disclaimer. | 8 * notice, this list of conditions and the following disclaimer. |
9 * 2. Redistributions in binary form must reproduce the above copyright | 9 * 2. Redistributions in binary form must reproduce the above copyright |
10 * notice, this list of conditions and the following disclaimer in the | 10 * notice, this list of conditions and the following disclaimer in the |
(...skipping 42 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
53 | 53 |
54 TreeScope& treeScope() const { return *m_treeScope; } | 54 TreeScope& treeScope() const { return *m_treeScope; } |
55 Node& rootNode() const { return *m_rootNode; } | 55 Node& rootNode() const { return *m_rootNode; } |
56 | 56 |
57 EventTarget* target() const { return m_target.get(); } | 57 EventTarget* target() const { return m_target.get(); } |
58 void setTarget(PassRefPtrWillBeRawPtr<EventTarget>); | 58 void setTarget(PassRefPtrWillBeRawPtr<EventTarget>); |
59 | 59 |
60 EventTarget* relatedTarget() const { return m_relatedTarget.get(); } | 60 EventTarget* relatedTarget() const { return m_relatedTarget.get(); } |
61 void setRelatedTarget(PassRefPtrWillBeRawPtr<EventTarget>); | 61 void setRelatedTarget(PassRefPtrWillBeRawPtr<EventTarget>); |
62 | 62 |
63 TouchEventContext* touchEventContext() const { return m_touchEventContext.ge
t(); } | 63 TouchEventContext* touchEventContext() const; |
64 TouchEventContext* ensureTouchEventContext(); | 64 TouchEventContext* ensureTouchEventContext(); |
65 | 65 |
66 WillBeHeapVector<RefPtrWillBeMember<EventTarget>>& ensureEventPath(EventPath
&); | 66 WillBeHeapVector<RefPtrWillBeMember<EventTarget>>& ensureEventPath(EventPath
&); |
67 | 67 |
68 bool isInclusiveAncestorOf(const TreeScopeEventContext&) const; | 68 bool isInclusiveAncestorOf(const TreeScopeEventContext&) const; |
69 bool isDescendantOf(const TreeScopeEventContext&) const; | 69 bool isDescendantOf(const TreeScopeEventContext&) const; |
70 #if ENABLE(ASSERT) | 70 #if ENABLE(ASSERT) |
71 bool isExclusivePartOf(const TreeScopeEventContext&) const; | 71 bool isExclusivePartOf(const TreeScopeEventContext&) const; |
72 #endif | 72 #endif |
73 void addChild(TreeScopeEventContext& child) { m_children.append(&child); } | 73 void addChild(TreeScopeEventContext& child) { m_children.append(&child); } |
(...skipping 65 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
139 { | 139 { |
140 ASSERT(m_preOrder != -1 && m_postOrder != -1 && other.m_preOrder != -1 && ot
her.m_postOrder != -1); | 140 ASSERT(m_preOrder != -1 && m_postOrder != -1 && other.m_preOrder != -1 && ot
her.m_postOrder != -1); |
141 return (m_preOrder < other.m_preOrder && m_postOrder < other.m_preOrder) | 141 return (m_preOrder < other.m_preOrder && m_postOrder < other.m_preOrder) |
142 || (m_preOrder > other.m_preOrder && m_preOrder > other.m_postOrder); | 142 || (m_preOrder > other.m_preOrder && m_preOrder > other.m_postOrder); |
143 } | 143 } |
144 #endif | 144 #endif |
145 | 145 |
146 } | 146 } |
147 | 147 |
148 #endif // TreeScopeEventContext_h | 148 #endif // TreeScopeEventContext_h |
OLD | NEW |