OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2011 Google Inc. All rights reserved. | 2 * Copyright (C) 2011 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 14 matching lines...) Expand all Loading... |
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 #include "config.h" | 31 #include "config.h" |
32 | 32 |
33 #include "core/dom/MutationObserverRegistration.h" | 33 #include "core/dom/MutationObserverRegistration.h" |
34 | 34 |
35 #include "core/dom/Document.h" | |
36 #include "core/dom/Node.h" | 35 #include "core/dom/Node.h" |
37 #include "core/dom/QualifiedName.h" | 36 #include "core/dom/QualifiedName.h" |
38 | 37 |
39 namespace WebCore { | 38 namespace WebCore { |
40 | 39 |
41 PassOwnPtr<MutationObserverRegistration> MutationObserverRegistration::create(Pa
ssRefPtr<MutationObserver> observer, Node* registrationNode, MutationObserverOpt
ions options, const HashSet<AtomicString>& attributeFilter) | 40 PassOwnPtr<MutationObserverRegistration> MutationObserverRegistration::create(Pa
ssRefPtr<MutationObserver> observer, Node* registrationNode, MutationObserverOpt
ions options, const HashSet<AtomicString>& attributeFilter) |
42 { | 41 { |
43 return adoptPtr(new MutationObserverRegistration(observer, registrationNode,
options, attributeFilter)); | 42 return adoptPtr(new MutationObserverRegistration(observer, registrationNode,
options, attributeFilter)); |
44 } | 43 } |
45 | 44 |
(...skipping 79 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
125 void MutationObserverRegistration::addRegistrationNodesToSet(HashSet<Node*>& nod
es) const | 124 void MutationObserverRegistration::addRegistrationNodesToSet(HashSet<Node*>& nod
es) const |
126 { | 125 { |
127 nodes.add(m_registrationNode); | 126 nodes.add(m_registrationNode); |
128 if (!m_transientRegistrationNodes) | 127 if (!m_transientRegistrationNodes) |
129 return; | 128 return; |
130 for (NodeHashSet::const_iterator iter = m_transientRegistrationNodes->begin(
); iter != m_transientRegistrationNodes->end(); ++iter) | 129 for (NodeHashSet::const_iterator iter = m_transientRegistrationNodes->begin(
); iter != m_transientRegistrationNodes->end(); ++iter) |
131 nodes.add(iter->get()); | 130 nodes.add(iter->get()); |
132 } | 131 } |
133 | 132 |
134 } // namespace WebCore | 133 } // namespace WebCore |
OLD | NEW |