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 16 matching lines...) Expand all Loading... |
27 #include "config.h" | 27 #include "config.h" |
28 #include "core/events/TreeScopeEventContext.h" | 28 #include "core/events/TreeScopeEventContext.h" |
29 | 29 |
30 #include "core/dom/StaticNodeList.h" | 30 #include "core/dom/StaticNodeList.h" |
31 #include "core/dom/shadow/ShadowRoot.h" | 31 #include "core/dom/shadow/ShadowRoot.h" |
32 #include "core/events/EventPath.h" | 32 #include "core/events/EventPath.h" |
33 #include "core/events/TouchEventContext.h" | 33 #include "core/events/TouchEventContext.h" |
34 | 34 |
35 namespace WebCore { | 35 namespace WebCore { |
36 | 36 |
37 PassRefPtrWillBeRawPtr<NodeList> TreeScopeEventContext::ensureEventPath(EventPat
h& path) | 37 PassRefPtrWillBeRawPtr<StaticNodeList> TreeScopeEventContext::ensureEventPath(Ev
entPath& path) |
38 { | 38 { |
39 if (m_eventPath) | 39 if (m_eventPath) |
40 return m_eventPath; | 40 return m_eventPath; |
41 | 41 |
42 WillBeHeapVector<RefPtrWillBeMember<Node> > nodes; | 42 WillBeHeapVector<RefPtrWillBeMember<Node> > nodes; |
43 nodes.reserveInitialCapacity(path.size()); | 43 nodes.reserveInitialCapacity(path.size()); |
44 for (size_t i = 0; i < path.size(); ++i) { | 44 for (size_t i = 0; i < path.size(); ++i) { |
45 TreeScope& treeScope = path[i].treeScopeEventContext().treeScope(); | 45 TreeScope& treeScope = path[i].treeScopeEventContext().treeScope(); |
46 if (treeScope.rootNode().isShadowRoot() && toShadowRoot(treeScope).type(
) == ShadowRoot::AuthorShadowRoot) | 46 if (treeScope.rootNode().isShadowRoot() && toShadowRoot(treeScope).type(
) == ShadowRoot::AuthorShadowRoot) |
47 nodes.append(path[i].node()); | 47 nodes.append(path[i].node()); |
(...skipping 40 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
88 int TreeScopeEventContext::calculatePrePostOrderNumber(int orderNumber) | 88 int TreeScopeEventContext::calculatePrePostOrderNumber(int orderNumber) |
89 { | 89 { |
90 m_preOrder = orderNumber; | 90 m_preOrder = orderNumber; |
91 for (size_t i = 0; i < m_children.size(); ++i) | 91 for (size_t i = 0; i < m_children.size(); ++i) |
92 orderNumber = m_children[i]->calculatePrePostOrderNumber(orderNumber + 1
); | 92 orderNumber = m_children[i]->calculatePrePostOrderNumber(orderNumber + 1
); |
93 m_postOrder = orderNumber + 1; | 93 m_postOrder = orderNumber + 1; |
94 return orderNumber + 1; | 94 return orderNumber + 1; |
95 } | 95 } |
96 | 96 |
97 } | 97 } |
OLD | NEW |