| 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 26 matching lines...) Expand all Loading... |
| 37 namespace blink { | 37 namespace blink { |
| 38 | 38 |
| 39 class EventPath; | 39 class EventPath; |
| 40 class EventTarget; | 40 class EventTarget; |
| 41 class Node; | 41 class Node; |
| 42 template <typename NodeType> class StaticNodeTypeList; | 42 template <typename NodeType> class StaticNodeTypeList; |
| 43 typedef StaticNodeTypeList<Node> StaticNodeList; | 43 typedef StaticNodeTypeList<Node> StaticNodeList; |
| 44 class TouchEventContext; | 44 class TouchEventContext; |
| 45 class TreeScope; | 45 class TreeScope; |
| 46 | 46 |
| 47 class TreeScopeEventContext FINAL : public RefCountedWillBeGarbageCollected<Tree
ScopeEventContext> { | 47 class TreeScopeEventContext final : public RefCountedWillBeGarbageCollected<Tree
ScopeEventContext> { |
| 48 DECLARE_EMPTY_DESTRUCTOR_WILL_BE_REMOVED(TreeScopeEventContext); | 48 DECLARE_EMPTY_DESTRUCTOR_WILL_BE_REMOVED(TreeScopeEventContext); |
| 49 public: | 49 public: |
| 50 static PassRefPtrWillBeRawPtr<TreeScopeEventContext> create(TreeScope&); | 50 static PassRefPtrWillBeRawPtr<TreeScopeEventContext> create(TreeScope&); |
| 51 void trace(Visitor*); | 51 void trace(Visitor*); |
| 52 | 52 |
| 53 TreeScope& treeScope() const { return *m_treeScope; } | 53 TreeScope& treeScope() const { return *m_treeScope; } |
| 54 | 54 |
| 55 EventTarget* target() const { return m_target.get(); } | 55 EventTarget* target() const { return m_target.get(); } |
| 56 void setTarget(PassRefPtrWillBeRawPtr<EventTarget>); | 56 void setTarget(PassRefPtrWillBeRawPtr<EventTarget>); |
| 57 | 57 |
| (...skipping 54 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 112 | 112 |
| 113 inline bool TreeScopeEventContext::isInclusiveAncestorOf(const TreeScopeEventCon
text& other) | 113 inline bool TreeScopeEventContext::isInclusiveAncestorOf(const TreeScopeEventCon
text& other) |
| 114 { | 114 { |
| 115 ASSERT(m_preOrder != -1 && m_postOrder != -1 && other.m_preOrder != -1 && ot
her.m_postOrder != -1); | 115 ASSERT(m_preOrder != -1 && m_postOrder != -1 && other.m_preOrder != -1 && ot
her.m_postOrder != -1); |
| 116 return m_preOrder <= other.m_preOrder && other.m_postOrder <= m_postOrder; | 116 return m_preOrder <= other.m_preOrder && other.m_postOrder <= m_postOrder; |
| 117 } | 117 } |
| 118 | 118 |
| 119 } | 119 } |
| 120 | 120 |
| 121 #endif // TreeScopeEventContext_h | 121 #endif // TreeScopeEventContext_h |
| OLD | NEW |