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 "MutationObserver.h" | 33 #include "core/dom/MutationObserver.h" |
34 | 34 |
| 35 #include <algorithm> |
35 #include "Dictionary.h" | 36 #include "Dictionary.h" |
36 #include "Document.h" | 37 #include "core/dom/Document.h" |
37 #include "ExceptionCode.h" | 38 #include "core/dom/ExceptionCode.h" |
38 #include "MutationCallback.h" | 39 #include "core/dom/MutationCallback.h" |
39 #include "MutationObserverRegistration.h" | 40 #include "core/dom/MutationObserverRegistration.h" |
40 #include "MutationRecord.h" | 41 #include "core/dom/MutationRecord.h" |
41 #include "Node.h" | 42 #include "core/dom/Node.h" |
42 #include <algorithm> | |
43 #include <wtf/HashSet.h> | 43 #include <wtf/HashSet.h> |
44 #include <wtf/MainThread.h> | 44 #include <wtf/MainThread.h> |
45 #include <wtf/Vector.h> | 45 #include <wtf/Vector.h> |
46 | 46 |
47 namespace WebCore { | 47 namespace WebCore { |
48 | 48 |
49 static unsigned s_observerPriority = 0; | 49 static unsigned s_observerPriority = 0; |
50 | 50 |
51 struct MutationObserver::ObserverLessThan { | 51 struct MutationObserver::ObserverLessThan { |
52 bool operator()(const RefPtr<MutationObserver>& lhs, const RefPtr<MutationOb
server>& rhs) | 52 bool operator()(const RefPtr<MutationObserver>& lhs, const RefPtr<MutationOb
server>& rhs) |
(...skipping 184 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
237 observers[i]->deliver(); | 237 observers[i]->deliver(); |
238 else | 238 else |
239 suspendedMutationObservers().add(observers[i]); | 239 suspendedMutationObservers().add(observers[i]); |
240 } | 240 } |
241 } | 241 } |
242 | 242 |
243 deliveryInProgress = false; | 243 deliveryInProgress = false; |
244 } | 244 } |
245 | 245 |
246 } // namespace WebCore | 246 } // namespace WebCore |
OLD | NEW |