| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
| 3 * (C) 2004-2005 Allan Sandfeld Jensen (kde@carewolf.com) | 3 * (C) 2004-2005 Allan Sandfeld Jensen (kde@carewolf.com) |
| 4 * Copyright (C) 2006, 2007 Nicholas Shanks (webkit@nickshanks.com) | 4 * Copyright (C) 2006, 2007 Nicholas Shanks (webkit@nickshanks.com) |
| 5 * Copyright (C) 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All rights
reserved. | 5 * Copyright (C) 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All rights
reserved. |
| 6 * Copyright (C) 2007 Alexey Proskuryakov <ap@webkit.org> | 6 * Copyright (C) 2007 Alexey Proskuryakov <ap@webkit.org> |
| 7 * Copyright (C) 2007, 2008 Eric Seidel <eric@webkit.org> | 7 * Copyright (C) 2007, 2008 Eric Seidel <eric@webkit.org> |
| 8 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.t
orchmobile.com/) | 8 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.t
orchmobile.com/) |
| 9 * Copyright (c) 2011, Code Aurora Forum. All rights reserved. | 9 * Copyright (c) 2011, Code Aurora Forum. All rights reserved. |
| 10 * Copyright (C) Research In Motion Limited 2011. All rights reserved. | 10 * Copyright (C) Research In Motion Limited 2011. All rights reserved. |
| (...skipping 11 matching lines...) Expand all Loading... |
| 22 * | 22 * |
| 23 * You should have received a copy of the GNU Library General Public License | 23 * You should have received a copy of the GNU Library General Public License |
| 24 * along with this library; see the file COPYING.LIB. If not, write to | 24 * along with this library; see the file COPYING.LIB. If not, write to |
| 25 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, | 25 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, |
| 26 * Boston, MA 02110-1301, USA. | 26 * Boston, MA 02110-1301, USA. |
| 27 */ | 27 */ |
| 28 | 28 |
| 29 #ifndef SiblingTraversalStrategies_h | 29 #ifndef SiblingTraversalStrategies_h |
| 30 #define SiblingTraversalStrategies_h | 30 #define SiblingTraversalStrategies_h |
| 31 | 31 |
| 32 #include "Element.h" | 32 #include "core/dom/Element.h" |
| 33 #include "core/rendering/style/RenderStyle.h" | 33 #include "core/rendering/style/RenderStyle.h" |
| 34 | 34 |
| 35 #include <wtf/UnusedParam.h> | 35 #include <wtf/UnusedParam.h> |
| 36 | 36 |
| 37 namespace WebCore { | 37 namespace WebCore { |
| 38 | 38 |
| 39 struct DOMSiblingTraversalStrategy { | 39 struct DOMSiblingTraversalStrategy { |
| 40 bool isFirstChild(Element*) const; | 40 bool isFirstChild(Element*) const; |
| 41 bool isLastChild(Element*) const; | 41 bool isLastChild(Element*) const; |
| 42 bool isFirstOfType(Element*, const QualifiedName&) const; | 42 bool isFirstOfType(Element*, const QualifiedName&) const; |
| (...skipping 221 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 264 if (siblings[i] && siblings[i]->isElementNode() && siblings[i]->hasTagNa
me(type)) | 264 if (siblings[i] && siblings[i]->isElementNode() && siblings[i]->hasTagNa
me(type)) |
| 265 return ++count; | 265 return ++count; |
| 266 } | 266 } |
| 267 | 267 |
| 268 return count; | 268 return count; |
| 269 } | 269 } |
| 270 | 270 |
| 271 } | 271 } |
| 272 | 272 |
| 273 #endif | 273 #endif |
| OLD | NEW |