| 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 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 #include "config.h" | 31 #include "config.h" |
| 32 #include "core/dom/MutationObserver.h" | 32 #include "core/dom/MutationObserver.h" |
| 33 | 33 |
| 34 #include <algorithm> | 34 #include "bindings/core/v8/Dictionary.h" |
| 35 #include "bindings/v8/Dictionary.h" | 35 #include "bindings/core/v8/ExceptionState.h" |
| 36 #include "bindings/v8/ExceptionState.h" | |
| 37 #include "core/dom/ExceptionCode.h" | 36 #include "core/dom/ExceptionCode.h" |
| 38 #include "core/dom/Microtask.h" | 37 #include "core/dom/Microtask.h" |
| 39 #include "core/dom/MutationCallback.h" | 38 #include "core/dom/MutationCallback.h" |
| 40 #include "core/dom/MutationObserverRegistration.h" | 39 #include "core/dom/MutationObserverRegistration.h" |
| 41 #include "core/dom/MutationRecord.h" | 40 #include "core/dom/MutationRecord.h" |
| 42 #include "core/dom/Node.h" | 41 #include "core/dom/Node.h" |
| 43 #include "core/inspector/InspectorInstrumentation.h" | 42 #include "core/inspector/InspectorInstrumentation.h" |
| 44 #include "wtf/MainThread.h" | 43 #include "wtf/MainThread.h" |
| 44 #include <algorithm> |
| 45 | 45 |
| 46 namespace WebCore { | 46 namespace WebCore { |
| 47 | 47 |
| 48 static unsigned s_observerPriority = 0; | 48 static unsigned s_observerPriority = 0; |
| 49 | 49 |
| 50 struct MutationObserver::ObserverLessThan { | 50 struct MutationObserver::ObserverLessThan { |
| 51 bool operator()(const RefPtrWillBeMember<MutationObserver>& lhs, const RefPt
rWillBeMember<MutationObserver>& rhs) | 51 bool operator()(const RefPtrWillBeMember<MutationObserver>& lhs, const RefPt
rWillBeMember<MutationObserver>& rhs) |
| 52 { | 52 { |
| 53 return lhs->m_priority < rhs->m_priority; | 53 return lhs->m_priority < rhs->m_priority; |
| 54 } | 54 } |
| (...skipping 219 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 274 } | 274 } |
| 275 } | 275 } |
| 276 | 276 |
| 277 void MutationObserver::trace(Visitor* visitor) | 277 void MutationObserver::trace(Visitor* visitor) |
| 278 { | 278 { |
| 279 visitor->trace(m_records); | 279 visitor->trace(m_records); |
| 280 visitor->trace(m_registrations); | 280 visitor->trace(m_registrations); |
| 281 } | 281 } |
| 282 | 282 |
| 283 } // namespace WebCore | 283 } // namespace WebCore |
| OLD | NEW |