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 Peter Kelly (pmk@post.com) | 4 * (C) 2001 Peter Kelly (pmk@post.com) |
5 * (C) 2001 Dirk Mueller (mueller@kde.org) | 5 * (C) 2001 Dirk Mueller (mueller@kde.org) |
6 * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2013 Appl
e Inc. All rights reserved. | 6 * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2013 Appl
e Inc. All rights reserved. |
7 * | 7 * |
8 * This library is free software; you can redistribute it and/or | 8 * This library is free software; you can redistribute it and/or |
9 * modify it under the terms of the GNU Library General Public | 9 * modify it under the terms of the GNU Library General Public |
10 * License as published by the Free Software Foundation; either | 10 * License as published by the Free Software Foundation; either |
(...skipping 806 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
817 inline bool isDisabledFormControl(const Node* node) | 817 inline bool isDisabledFormControl(const Node* node) |
818 { | 818 { |
819 return node->isElementNode() && toElement(node)->isDisabledFormControl(); | 819 return node->isElementNode() && toElement(node)->isDisabledFormControl(); |
820 } | 820 } |
821 | 821 |
822 inline bool Node::hasTagName(const QualifiedName& name) const | 822 inline bool Node::hasTagName(const QualifiedName& name) const |
823 { | 823 { |
824 return isElementNode() && toElement(this)->hasTagName(name); | 824 return isElementNode() && toElement(this)->hasTagName(name); |
825 } | 825 } |
826 | 826 |
827 inline bool Node::hasLocalName(const AtomicString& name) const | |
828 { | |
829 return isElementNode() && toElement(this)->hasLocalName(name); | |
830 } | |
831 | |
832 inline bool Node::hasAttributes() const | |
833 { | |
834 return isElementNode() && toElement(this)->hasAttributes(); | |
835 } | |
836 | |
837 inline NamedNodeMap* Node::attributes() const | |
838 { | |
839 return isElementNode() ? toElement(this)->attributes() : 0; | |
840 } | |
841 | |
842 inline Element* Node::parentElement() const | 827 inline Element* Node::parentElement() const |
843 { | 828 { |
844 ContainerNode* parent = parentNode(); | 829 ContainerNode* parent = parentNode(); |
845 return parent && parent->isElementNode() ? toElement(parent) : 0; | 830 return parent && parent->isElementNode() ? toElement(parent) : 0; |
846 } | 831 } |
847 | 832 |
848 inline Element* Node::previousElementSibling() const | 833 inline Element* Node::previousElementSibling() const |
849 { | 834 { |
850 Node* n = previousSibling(); | 835 Node* n = previousSibling(); |
851 while (n && !n->isElementNode()) | 836 while (n && !n->isElementNode()) |
(...skipping 244 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1096 | 1081 |
1097 inline const Attribute* ElementData::attributeItem(unsigned index) const | 1082 inline const Attribute* ElementData::attributeItem(unsigned index) const |
1098 { | 1083 { |
1099 RELEASE_ASSERT(index < length()); | 1084 RELEASE_ASSERT(index < length()); |
1100 return attributeBase() + index; | 1085 return attributeBase() + index; |
1101 } | 1086 } |
1102 | 1087 |
1103 } // namespace | 1088 } // namespace |
1104 | 1089 |
1105 #endif | 1090 #endif |
OLD | NEW |