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 Apple Inc. All rights reserv
ed. | 5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserv
ed. |
6 * | 6 * |
7 * This library is free software; you can redistribute it and/or | 7 * This library is free software; you can redistribute it and/or |
8 * modify it under the terms of the GNU Library General Public | 8 * modify it under the terms of the GNU Library General Public |
9 * License as published by the Free Software Foundation; either | 9 * License as published by the Free Software Foundation; either |
10 * version 2 of the License, or (at your option) any later version. | 10 * version 2 of the License, or (at your option) any later version. |
(...skipping 874 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
885 } | 885 } |
886 } | 886 } |
887 | 887 |
888 PassRefPtr<HTMLCollection> ContainerNode::children() | 888 PassRefPtr<HTMLCollection> ContainerNode::children() |
889 { | 889 { |
890 return ensureRareData().ensureNodeLists().addCacheWithAtomicName<HTMLCollect
ion>(this, NodeChildren); | 890 return ensureRareData().ensureNodeLists().addCacheWithAtomicName<HTMLCollect
ion>(this, NodeChildren); |
891 } | 891 } |
892 | 892 |
893 Element* ContainerNode::firstElementChild() const | 893 Element* ContainerNode::firstElementChild() const |
894 { | 894 { |
895 return ElementTraversal::firstWithin(this); | 895 return ElementTraversal::firstWithin(*this); |
896 } | 896 } |
897 | 897 |
898 Element* ContainerNode::lastElementChild() const | 898 Element* ContainerNode::lastElementChild() const |
899 { | 899 { |
900 Node* n = lastChild(); | 900 Node* n = lastChild(); |
901 while (n && !n->isElementNode()) | 901 while (n && !n->isElementNode()) |
902 n = n->previousSibling(); | 902 n = n->previousSibling(); |
903 return toElement(n); | 903 return toElement(n); |
904 } | 904 } |
905 | 905 |
(...skipping 98 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1004 return true; | 1004 return true; |
1005 | 1005 |
1006 if (node->isElementNode() && toElement(node)->shadow()) | 1006 if (node->isElementNode() && toElement(node)->shadow()) |
1007 return true; | 1007 return true; |
1008 | 1008 |
1009 return false; | 1009 return false; |
1010 } | 1010 } |
1011 #endif | 1011 #endif |
1012 | 1012 |
1013 } // namespace WebCore | 1013 } // namespace WebCore |
OLD | NEW |