| 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 12 matching lines...) Expand all Loading... |
| 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 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 #include "config.h" | 31 #include "config.h" |
| 32 | 32 |
| 33 #include "MutationObserverRegistration.h" | 33 #include "core/dom/MutationObserverRegistration.h" |
| 34 | 34 |
| 35 #include "Document.h" | 35 #include "core/dom/Document.h" |
| 36 #include "Node.h" | 36 #include "core/dom/Node.h" |
| 37 #include "QualifiedName.h" | 37 #include "core/dom/QualifiedName.h" |
| 38 | 38 |
| 39 namespace WebCore { | 39 namespace WebCore { |
| 40 | 40 |
| 41 PassOwnPtr<MutationObserverRegistration> MutationObserverRegistration::create(Pa
ssRefPtr<MutationObserver> observer, Node* registrationNode, MutationObserverOpt
ions options, const HashSet<AtomicString>& attributeFilter) | 41 PassOwnPtr<MutationObserverRegistration> MutationObserverRegistration::create(Pa
ssRefPtr<MutationObserver> observer, Node* registrationNode, MutationObserverOpt
ions options, const HashSet<AtomicString>& attributeFilter) |
| 42 { | 42 { |
| 43 return adoptPtr(new MutationObserverRegistration(observer, registrationNode,
options, attributeFilter)); | 43 return adoptPtr(new MutationObserverRegistration(observer, registrationNode,
options, attributeFilter)); |
| 44 } | 44 } |
| 45 | 45 |
| 46 MutationObserverRegistration::MutationObserverRegistration(PassRefPtr<MutationOb
server> observer, Node* registrationNode, MutationObserverOptions options, const
HashSet<AtomicString>& attributeFilter) | 46 MutationObserverRegistration::MutationObserverRegistration(PassRefPtr<MutationOb
server> observer, Node* registrationNode, MutationObserverOptions options, const
HashSet<AtomicString>& attributeFilter) |
| 47 : m_observer(observer) | 47 : m_observer(observer) |
| (...skipping 77 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 125 void MutationObserverRegistration::addRegistrationNodesToSet(HashSet<Node*>& nod
es) const | 125 void MutationObserverRegistration::addRegistrationNodesToSet(HashSet<Node*>& nod
es) const |
| 126 { | 126 { |
| 127 nodes.add(m_registrationNode); | 127 nodes.add(m_registrationNode); |
| 128 if (!m_transientRegistrationNodes) | 128 if (!m_transientRegistrationNodes) |
| 129 return; | 129 return; |
| 130 for (NodeHashSet::const_iterator iter = m_transientRegistrationNodes->begin(
); iter != m_transientRegistrationNodes->end(); ++iter) | 130 for (NodeHashSet::const_iterator iter = m_transientRegistrationNodes->begin(
); iter != m_transientRegistrationNodes->end(); ++iter) |
| 131 nodes.add(iter->get()); | 131 nodes.add(iter->get()); |
| 132 } | 132 } |
| 133 | 133 |
| 134 } // namespace WebCore | 134 } // namespace WebCore |
| OLD | NEW |