OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
3 * (C) 1999 Antti Koivisto (koivisto@kde.org) | 3 * (C) 1999 Antti Koivisto (koivisto@kde.org) |
4 * (C) 2001 Dirk Mueller (mueller@kde.org) | 4 * (C) 2001 Dirk Mueller (mueller@kde.org) |
5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012 Apple Inc.
All rights reserved. | 5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012 Apple Inc. |
6 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.t
orchmobile.com/) | 6 * All rights reserved. |
| 7 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. |
| 8 * (http://www.torchmobile.com/) |
7 * | 9 * |
8 * This library is free software; you can redistribute it and/or | 10 * This library is free software; you can redistribute it and/or |
9 * modify it under the terms of the GNU Library General Public | 11 * modify it under the terms of the GNU Library General Public |
10 * License as published by the Free Software Foundation; either | 12 * License as published by the Free Software Foundation; either |
11 * version 2 of the License, or (at your option) any later version. | 13 * version 2 of the License, or (at your option) any later version. |
12 * | 14 * |
13 * This library is distributed in the hope that it will be useful, | 15 * This library is distributed in the hope that it will be useful, |
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of | 16 * but WITHOUT ANY WARRANTY; without even the implied warranty of |
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | 17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
16 * Library General Public License for more details. | 18 * Library General Public License for more details. |
(...skipping 154 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
171 if (current.previousSibling()) | 173 if (current.previousSibling()) |
172 return current.previousSibling(); | 174 return current.previousSibling(); |
173 return previousAncestorSiblingPostOrder(current, stayWithin); | 175 return previousAncestorSiblingPostOrder(current, stayWithin); |
174 } | 176 } |
175 | 177 |
176 Node* NodeTraversal::commonAncestor(const Node& nodeA, const Node& nodeB) { | 178 Node* NodeTraversal::commonAncestor(const Node& nodeA, const Node& nodeB) { |
177 return Range::commonAncestorContainer(&nodeA, &nodeB); | 179 return Range::commonAncestorContainer(&nodeA, &nodeB); |
178 } | 180 } |
179 | 181 |
180 } // namespace blink | 182 } // namespace blink |
OLD | NEW |