| 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 * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008 Apple Inc. All rights reserv
ed. | 4 * Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008 Apple Inc. All rights reserv
ed. |
| 5 * Copyright (C) 2014 Samsung Electronics. All rights reserved. | 5 * Copyright (C) 2014 Samsung Electronics. All rights reserved. |
| 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. |
| 11 * | 11 * |
| 12 * This library is distributed in the hope that it will be useful, | 12 * This library is distributed in the hope that it will be useful, |
| 13 * but WITHOUT ANY WARRANTY; without even the implied warranty of | 13 * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | 14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 15 * Library General Public License for more details. | 15 * Library General Public License for more details. |
| 16 * | 16 * |
| 17 * You should have received a copy of the GNU Library General Public License | 17 * You should have received a copy of the GNU Library General Public License |
| 18 * along with this library; see the file COPYING.LIB. If not, write to | 18 * along with this library; see the file COPYING.LIB. If not, write to |
| 19 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, | 19 * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, |
| 20 * Boston, MA 02110-1301, USA. | 20 * Boston, MA 02110-1301, USA. |
| 21 * | 21 * |
| 22 */ | 22 */ |
| 23 | 23 |
| 24 #ifndef HTMLFormControlsCollection_h | 24 #ifndef HTMLFormControlsCollection_h |
| 25 #define HTMLFormControlsCollection_h | 25 #define HTMLFormControlsCollection_h |
| 26 | 26 |
| 27 #include "core/html/FormAssociatedElement.h" | 27 #include "core/html/FormAssociatedElement.h" |
| 28 #include "core/html/HTMLCollection.h" | 28 #include "core/html/HTMLCollection.h" |
| 29 #include "core/html/HTMLElement.h" |
| 29 #include "core/html/RadioNodeList.h" | 30 #include "core/html/RadioNodeList.h" |
| 30 | 31 |
| 31 namespace blink { | 32 namespace blink { |
| 32 | 33 |
| 33 class HTMLElement; | |
| 34 class HTMLImageElement; | 34 class HTMLImageElement; |
| 35 class QualifiedName; | 35 class QualifiedName; |
| 36 | 36 |
| 37 // This class is just a big hack to find form elements even in malformed HTML el
ements. | 37 // This class is just a big hack to find form elements even in malformed HTML el
ements. |
| 38 // The famous <table><tr><form><td> problem. | 38 // The famous <table><tr><form><td> problem. |
| 39 | 39 |
| 40 class HTMLFormControlsCollection FINAL : public HTMLCollection { | 40 class HTMLFormControlsCollection FINAL : public HTMLCollection { |
| 41 public: | 41 public: |
| 42 static PassRefPtrWillBeRawPtr<HTMLFormControlsCollection> create(ContainerNo
de&, CollectionType); | 42 static PassRefPtrWillBeRawPtr<HTMLFormControlsCollection> create(ContainerNo
de&, CollectionType); |
| 43 | 43 |
| 44 virtual ~HTMLFormControlsCollection(); | 44 virtual ~HTMLFormControlsCollection(); |
| 45 | 45 |
| 46 virtual Element* namedItem(const AtomicString& name) const OVERRIDE; | 46 HTMLElement* item(unsigned offset) const { return toHTMLElement(HTMLCollecti
on::item(offset)); } |
| 47 |
| 48 virtual HTMLElement* namedItem(const AtomicString& name) const OVERRIDE; |
| 47 void namedGetter(const AtomicString& name, RefPtrWillBeRawPtr<RadioNodeList>
&, RefPtrWillBeRawPtr<Element>&); | 49 void namedGetter(const AtomicString& name, RefPtrWillBeRawPtr<RadioNodeList>
&, RefPtrWillBeRawPtr<Element>&); |
| 48 | 50 |
| 49 virtual void trace(Visitor*) OVERRIDE; | 51 virtual void trace(Visitor*) OVERRIDE; |
| 50 | 52 |
| 51 private: | 53 private: |
| 52 explicit HTMLFormControlsCollection(ContainerNode&); | 54 explicit HTMLFormControlsCollection(ContainerNode&); |
| 53 | 55 |
| 54 virtual void updateIdNameCache() const OVERRIDE; | 56 virtual void updateIdNameCache() const OVERRIDE; |
| 55 virtual void supportedPropertyNames(Vector<String>& names) OVERRIDE; | 57 virtual void supportedPropertyNames(Vector<String>& names) OVERRIDE; |
| 56 | 58 |
| 57 const FormAssociatedElement::List& formControlElements() const; | 59 const FormAssociatedElement::List& formControlElements() const; |
| 58 const WillBeHeapVector<RawPtrWillBeMember<HTMLImageElement> >& formImageElem
ents() const; | 60 const WillBeHeapVector<RawPtrWillBeMember<HTMLImageElement> >& formImageElem
ents() const; |
| 59 virtual Element* virtualItemAfter(Element*) const OVERRIDE; | 61 virtual HTMLElement* virtualItemAfter(Element*) const OVERRIDE; |
| 60 virtual void invalidateCache(Document* oldDocument = 0) const OVERRIDE; | 62 virtual void invalidateCache(Document* oldDocument = 0) const OVERRIDE; |
| 61 | 63 |
| 62 mutable RawPtrWillBeMember<Element> m_cachedElement; | 64 mutable RawPtrWillBeMember<HTMLElement> m_cachedElement; |
| 63 mutable unsigned m_cachedElementOffsetInArray; | 65 mutable unsigned m_cachedElementOffsetInArray; |
| 64 }; | 66 }; |
| 65 DEFINE_TYPE_CASTS(HTMLFormControlsCollection, LiveNodeListBase, collection, coll
ection->type() == FormControls, collection.type() == FormControls); | 67 DEFINE_TYPE_CASTS(HTMLFormControlsCollection, LiveNodeListBase, collection, coll
ection->type() == FormControls, collection.type() == FormControls); |
| 66 | 68 |
| 67 } // namespace | 69 } // namespace |
| 68 | 70 |
| 69 #endif | 71 #endif |
| OLD | NEW |