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 45 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
56 NodeEventContext& operator[](size_t index) { return m_nodeEventContexts[inde
x]; } | 56 NodeEventContext& operator[](size_t index) { return m_nodeEventContexts[inde
x]; } |
57 const NodeEventContext& operator[](size_t index) const { return m_nodeEventC
ontexts[index]; } | 57 const NodeEventContext& operator[](size_t index) const { return m_nodeEventC
ontexts[index]; } |
58 const NodeEventContext& last() const { return m_nodeEventContexts[size() - 1
]; } | 58 const NodeEventContext& last() const { return m_nodeEventContexts[size() - 1
]; } |
59 | 59 |
60 bool isEmpty() const { return m_nodeEventContexts.isEmpty(); } | 60 bool isEmpty() const { return m_nodeEventContexts.isEmpty(); } |
61 size_t size() const { return m_nodeEventContexts.size(); } | 61 size_t size() const { return m_nodeEventContexts.size(); } |
62 | 62 |
63 void adjustForRelatedTarget(Node*, EventTarget* relatedTarget); | 63 void adjustForRelatedTarget(Node*, EventTarget* relatedTarget); |
64 void adjustForTouchEvent(Node*, TouchEvent&); | 64 void adjustForTouchEvent(Node*, TouchEvent&); |
65 | 65 |
66 static Node* parent(Node*); | |
67 static EventTarget* eventTargetRespectingTargetRules(Node*); | 66 static EventTarget* eventTargetRespectingTargetRules(Node*); |
68 | 67 |
69 private: | 68 private: |
70 EventPath(); | 69 EventPath(); |
71 | 70 |
72 NodeEventContext& at(size_t index) { return m_nodeEventContexts[index]; } | 71 NodeEventContext& at(size_t index) { return m_nodeEventContexts[index]; } |
73 | 72 |
74 void addNodeEventContext(Node*); | 73 void addNodeEventContext(Node*); |
75 | 74 |
76 void calculatePath(); | 75 void calculatePath(); |
(...skipping 19 matching lines...) Expand all Loading... |
96 | 95 |
97 Vector<NodeEventContext, 64> m_nodeEventContexts; | 96 Vector<NodeEventContext, 64> m_nodeEventContexts; |
98 Node* m_node; | 97 Node* m_node; |
99 Event* m_event; | 98 Event* m_event; |
100 Vector<RefPtr<TreeScopeEventContext> > m_treeScopeEventContexts; | 99 Vector<RefPtr<TreeScopeEventContext> > m_treeScopeEventContexts; |
101 }; | 100 }; |
102 | 101 |
103 } // namespace | 102 } // namespace |
104 | 103 |
105 #endif | 104 #endif |
OLD | NEW |