| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2013 Google Inc. All rights reserved. | 2 * Copyright (C) 2013 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 are | 5 * modification, are permitted provided that the following conditions are |
| 6 * met: | 6 * met: |
| 7 * | 7 * |
| 8 * * Redistributions of source code must retain the above copyright | 8 * * 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 * * Neither the name of Google Inc. nor the names of its | 10 * * Neither the name of Google Inc. nor the names of its |
| (...skipping 27 matching lines...) Expand all Loading... |
| 38 namespace blink { | 38 namespace blink { |
| 39 | 39 |
| 40 class Event; | 40 class Event; |
| 41 class EventTarget; | 41 class EventTarget; |
| 42 class Node; | 42 class Node; |
| 43 class TouchEvent; | 43 class TouchEvent; |
| 44 class TouchList; | 44 class TouchList; |
| 45 class TreeScope; | 45 class TreeScope; |
| 46 | 46 |
| 47 class CORE_EXPORT EventPath final : public NoBaseWillBeGarbageCollectedFinalized
<EventPath> { | 47 class CORE_EXPORT EventPath final : public NoBaseWillBeGarbageCollectedFinalized
<EventPath> { |
| 48 WTF_MAKE_FAST_ALLOCATED_WILL_BE_REMOVED(EventPath); |
| 49 WTF_MAKE_NONCOPYABLE(EventPath); |
| 48 public: | 50 public: |
| 49 explicit EventPath(Node&, Event* = nullptr); | 51 explicit EventPath(Node&, Event* = nullptr); |
| 50 | 52 |
| 51 void initializeWith(Node&, Event*); | 53 void initializeWith(Node&, Event*); |
| 52 | 54 |
| 53 NodeEventContext& operator[](size_t index) { return m_nodeEventContexts[inde
x]; } | 55 NodeEventContext& operator[](size_t index) { return m_nodeEventContexts[inde
x]; } |
| 54 const NodeEventContext& operator[](size_t index) const { return m_nodeEventC
ontexts[index]; } | 56 const NodeEventContext& operator[](size_t index) const { return m_nodeEventC
ontexts[index]; } |
| 55 NodeEventContext& at(size_t index) { return m_nodeEventContexts[index]; } | 57 NodeEventContext& at(size_t index) { return m_nodeEventContexts[index]; } |
| 56 NodeEventContext& last() { return m_nodeEventContexts[size() - 1]; } | 58 NodeEventContext& last() { return m_nodeEventContexts[size() - 1]; } |
| 57 | 59 |
| (...skipping 45 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 103 WillBeHeapVector<NodeEventContext> m_nodeEventContexts; | 105 WillBeHeapVector<NodeEventContext> m_nodeEventContexts; |
| 104 RawPtrWillBeMember<Node> m_node; | 106 RawPtrWillBeMember<Node> m_node; |
| 105 RawPtrWillBeMember<Event> m_event; | 107 RawPtrWillBeMember<Event> m_event; |
| 106 WillBeHeapVector<RefPtrWillBeMember<TreeScopeEventContext>> m_treeScopeEvent
Contexts; | 108 WillBeHeapVector<RefPtrWillBeMember<TreeScopeEventContext>> m_treeScopeEvent
Contexts; |
| 107 OwnPtrWillBeMember<WindowEventContext> m_windowEventContext; | 109 OwnPtrWillBeMember<WindowEventContext> m_windowEventContext; |
| 108 }; | 110 }; |
| 109 | 111 |
| 110 } // namespace | 112 } // namespace |
| 111 | 113 |
| 112 #endif | 114 #endif |
| OLD | NEW |