OLD | NEW |
| (Empty) |
1 /* | |
2 * Copyright (C) 2009 Google Inc. All rights reserved. | |
3 * | |
4 * Redistribution and use in source and binary forms, with or without | |
5 * modification, are permitted provided that the following conditions are | |
6 * met: | |
7 * | |
8 * * Redistributions of source code must retain the above copyright | |
9 * notice, this list of conditions and the following disclaimer. | |
10 * * Redistributions in binary form must reproduce the above | |
11 * copyright notice, this list of conditions and the following disclaimer | |
12 * in the documentation and/or other materials provided with the | |
13 * distribution. | |
14 * * Neither the name of Google Inc. nor the names of its | |
15 * contributors may be used to endorse or promote products derived from | |
16 * this software without specific prior written permission. | |
17 * | |
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
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. | |
29 */ | |
30 | |
31 #ifndef NamedNodesCollection_h | |
32 #define NamedNodesCollection_h | |
33 | |
34 #include "core/dom/Element.h" | |
35 #include "core/dom/NodeList.h" | |
36 #include "wtf/PassRefPtr.h" | |
37 #include "wtf/RefPtr.h" | |
38 #include "wtf/Vector.h" | |
39 | |
40 namespace blink { | |
41 | |
42 class NamedNodesCollection FINAL : public NodeList { | |
43 public: | |
44 static PassRefPtrWillBeRawPtr<NodeList> create(const WillBeHeapVector<RefPtr
WillBeMember<Element> >& nodes) | |
45 { | |
46 return adoptRefWillBeNoop(new NamedNodesCollection(nodes)); | |
47 } | |
48 | |
49 virtual unsigned length() const OVERRIDE { return m_nodes.size(); } | |
50 virtual Element* item(unsigned) const OVERRIDE; | |
51 | |
52 virtual void trace(Visitor*) OVERRIDE; | |
53 | |
54 private: | |
55 explicit NamedNodesCollection(const WillBeHeapVector<RefPtrWillBeMember<Elem
ent> > nodes) | |
56 : m_nodes(nodes) { } | |
57 | |
58 WillBeHeapVector<RefPtrWillBeMember<Element> > m_nodes; | |
59 }; | |
60 | |
61 } // namespace blink | |
62 | |
63 #endif // NamedNodesCollection_h | |
OLD | NEW |