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 #include "config.h" | |
32 #include "WebNodeCollection.h" | |
33 | |
34 #include "WebElement.h" | |
35 #include "core/dom/Node.h" | |
36 #include "core/html/HTMLCollection.h" | |
37 #include "wtf/PassRefPtr.h" | |
38 | |
39 using namespace WebCore; | |
40 | |
41 namespace blink { | |
42 | |
43 void WebNodeCollection::reset() | |
44 { | |
45 assign(0); | |
46 } | |
47 | |
48 void WebNodeCollection::assign(const WebNodeCollection& other) | |
49 { | |
50 HTMLCollection* p = const_cast<HTMLCollection*>(other.m_private); | |
51 if (p) | |
52 p->ref(); | |
53 assign(p); | |
54 } | |
55 | |
56 WebNodeCollection::WebNodeCollection(const PassRefPtr<HTMLCollection>& col) | |
57 : m_private(static_cast<HTMLCollection*>(col.leakRef())) | |
58 { | |
59 } | |
60 | |
61 void WebNodeCollection::assign(HTMLCollection* p) | |
62 { | |
63 // p is already ref'd for us by the caller | |
64 if (m_private) | |
65 m_private->deref(); | |
66 m_private = p; | |
67 } | |
68 | |
69 unsigned WebNodeCollection::length() const | |
70 { | |
71 return m_private->length(); | |
72 } | |
73 | |
74 WebElement WebNodeCollection::nextItem() const | |
75 { | |
76 Element* element = m_private->item(m_current); | |
77 if (element) | |
78 m_current++; | |
79 return WebElement(element); | |
80 } | |
81 | |
82 WebElement WebNodeCollection::firstItem() const | |
83 { | |
84 m_current = 0; | |
85 return nextItem(); | |
86 } | |
87 | |
88 } // namespace blink | |
OLD | NEW |