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 24 matching lines...) Expand all Loading... |
35 | 35 |
36 namespace blink { | 36 namespace blink { |
37 | 37 |
38 class Event; | 38 class Event; |
39 class EventTarget; | 39 class EventTarget; |
40 class Node; | 40 class Node; |
41 class TouchEvent; | 41 class TouchEvent; |
42 class TouchList; | 42 class TouchList; |
43 class TreeScope; | 43 class TreeScope; |
44 | 44 |
45 class EventPath FINAL : public NoBaseWillBeGarbageCollected<EventPath> { | 45 class EventPath final : public NoBaseWillBeGarbageCollected<EventPath> { |
46 public: | 46 public: |
47 explicit EventPath(Event*); | 47 explicit EventPath(Event*); |
48 explicit EventPath(Node*); | 48 explicit EventPath(Node*); |
49 void resetWith(Node*); | 49 void resetWith(Node*); |
50 | 50 |
51 NodeEventContext& operator[](size_t index) { return m_nodeEventContexts[inde
x]; } | 51 NodeEventContext& operator[](size_t index) { return m_nodeEventContexts[inde
x]; } |
52 const NodeEventContext& operator[](size_t index) const { return m_nodeEventC
ontexts[index]; } | 52 const NodeEventContext& operator[](size_t index) const { return m_nodeEventC
ontexts[index]; } |
53 NodeEventContext& last() { return m_nodeEventContexts[size() - 1]; } | 53 NodeEventContext& last() { return m_nodeEventContexts[size() - 1]; } |
54 | 54 |
55 bool isEmpty() const { return m_nodeEventContexts.isEmpty(); } | 55 bool isEmpty() const { return m_nodeEventContexts.isEmpty(); } |
(...skipping 36 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
92 | 92 |
93 WillBeHeapVector<NodeEventContext, 64> m_nodeEventContexts; | 93 WillBeHeapVector<NodeEventContext, 64> m_nodeEventContexts; |
94 RawPtrWillBeMember<Node> m_node; | 94 RawPtrWillBeMember<Node> m_node; |
95 RawPtrWillBeMember<Event> m_event; | 95 RawPtrWillBeMember<Event> m_event; |
96 WillBeHeapVector<RefPtrWillBeMember<TreeScopeEventContext> > m_treeScopeEven
tContexts; | 96 WillBeHeapVector<RefPtrWillBeMember<TreeScopeEventContext> > m_treeScopeEven
tContexts; |
97 }; | 97 }; |
98 | 98 |
99 } // namespace | 99 } // namespace |
100 | 100 |
101 #endif | 101 #endif |
OLD | NEW |