| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2009 Google Inc. All rights reserved. | 2 * Copyright (C) 2009 Google Inc. All rights reserved. |
| 3 * | 3 * |
| 4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
| 5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
| 6 * met: | 6 * met: |
| 7 * | 7 * |
| 8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
| 9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
| 10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
| (...skipping 13 matching lines...) Expand all Loading... |
| 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 29 */ | 29 */ |
| 30 | 30 |
| 31 #ifndef NamedNodesCollection_h | 31 #ifndef NamedNodesCollection_h |
| 32 #define NamedNodesCollection_h | 32 #define NamedNodesCollection_h |
| 33 | 33 |
| 34 #include "core/dom/Node.h" | 34 #include "core/dom/Element.h" |
| 35 #include "core/dom/NodeList.h" | 35 #include "core/dom/NodeList.h" |
| 36 #include "wtf/PassRefPtr.h" | 36 #include "wtf/PassRefPtr.h" |
| 37 #include "wtf/RefPtr.h" | 37 #include "wtf/RefPtr.h" |
| 38 #include "wtf/Vector.h" | 38 #include "wtf/Vector.h" |
| 39 | 39 |
| 40 namespace WebCore { | 40 namespace WebCore { |
| 41 | 41 |
| 42 class NamedNodesCollection FINAL : public NodeList { | 42 class NamedNodesCollection FINAL : public NodeList { |
| 43 public: | 43 public: |
| 44 static PassRefPtrWillBeRawPtr<NodeList> create(const WillBeHeapVector<RefPtr
WillBeMember<Element> >& nodes) | 44 static PassRefPtrWillBeRawPtr<NodeList> create(const WillBeHeapVector<RefPtr
WillBeMember<Element> >& nodes) |
| 45 { | 45 { |
| 46 return adoptRefWillBeNoop(new NamedNodesCollection(nodes)); | 46 return adoptRefWillBeNoop(new NamedNodesCollection(nodes)); |
| 47 } | 47 } |
| 48 | 48 |
| 49 virtual unsigned length() const OVERRIDE { return m_nodes.size(); } | 49 virtual unsigned length() const OVERRIDE { return m_nodes.size(); } |
| 50 virtual Node* item(unsigned) const OVERRIDE; | 50 virtual Element* item(unsigned) const OVERRIDE; |
| 51 | 51 |
| 52 virtual void trace(Visitor*) OVERRIDE; | 52 virtual void trace(Visitor*) OVERRIDE; |
| 53 | 53 |
| 54 private: | 54 private: |
| 55 explicit NamedNodesCollection(const WillBeHeapVector<RefPtrWillBeMember<Elem
ent> > nodes) | 55 explicit NamedNodesCollection(const WillBeHeapVector<RefPtrWillBeMember<Elem
ent> > nodes) |
| 56 : m_nodes(nodes) { } | 56 : m_nodes(nodes) { } |
| 57 | 57 |
| 58 WillBeHeapVector<RefPtrWillBeMember<Element> > m_nodes; | 58 WillBeHeapVector<RefPtrWillBeMember<Element> > m_nodes; |
| 59 }; | 59 }; |
| 60 | 60 |
| 61 } // namespace WebCore | 61 } // namespace WebCore |
| 62 | 62 |
| 63 #endif // NamedNodesCollection_h | 63 #endif // NamedNodesCollection_h |
| OLD | NEW |