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 |
11 * documentation and/or other materials provided with the distribution. | 11 * documentation and/or other materials provided with the distribution. |
12 * | 12 * |
13 * THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY | 13 * THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY |
14 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | 14 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | 15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR | 16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR |
17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, | 17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, | 18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR | 19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR |
20 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY | 20 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY |
21 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 21 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
23 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 23 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
24 * | 24 * |
25 */ | 25 */ |
26 | 26 |
27 #include "config.h" | |
28 #include "core/events/TreeScopeEventContext.h" | 27 #include "core/events/TreeScopeEventContext.h" |
29 | 28 |
30 #include "core/dom/StaticNodeList.h" | 29 #include "core/dom/StaticNodeList.h" |
31 #include "core/dom/shadow/ShadowRoot.h" | 30 #include "core/dom/shadow/ShadowRoot.h" |
32 #include "core/events/EventPath.h" | 31 #include "core/events/EventPath.h" |
33 #include "core/events/TouchEventContext.h" | 32 #include "core/events/TouchEventContext.h" |
34 | 33 |
35 namespace blink { | 34 namespace blink { |
36 | 35 |
37 bool TreeScopeEventContext::isUnclosedTreeOf(const TreeScopeEventContext& other) | 36 bool TreeScopeEventContext::isUnclosedTreeOf(const TreeScopeEventContext& other) |
(...skipping 79 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
117 m_preOrder = orderNumber; | 116 m_preOrder = orderNumber; |
118 m_containingClosedShadowTree = (rootNode().isShadowRoot() && !toShadowRoot(r
ootNode()).isOpen()) ? this : nearestAncestorClosedTreeScopeEventContext; | 117 m_containingClosedShadowTree = (rootNode().isShadowRoot() && !toShadowRoot(r
ootNode()).isOpen()) ? this : nearestAncestorClosedTreeScopeEventContext; |
119 for (size_t i = 0; i < m_children.size(); ++i) | 118 for (size_t i = 0; i < m_children.size(); ++i) |
120 orderNumber = m_children[i]->calculateTreeOrderAndSetNearestAncestorClos
edTree(orderNumber + 1, containingClosedShadowTree()); | 119 orderNumber = m_children[i]->calculateTreeOrderAndSetNearestAncestorClos
edTree(orderNumber + 1, containingClosedShadowTree()); |
121 m_postOrder = orderNumber + 1; | 120 m_postOrder = orderNumber + 1; |
122 | 121 |
123 return orderNumber + 1; | 122 return orderNumber + 1; |
124 } | 123 } |
125 | 124 |
126 } // namespace blink | 125 } // namespace blink |
OLD | NEW |