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 23 matching lines...) Expand all Loading... |
34 #include "core/dom/MutationObserver.h" | 34 #include "core/dom/MutationObserver.h" |
35 #include "platform/heap/Handle.h" | 35 #include "platform/heap/Handle.h" |
36 #include "wtf/HashSet.h" | 36 #include "wtf/HashSet.h" |
37 #include "wtf/text/AtomicString.h" | 37 #include "wtf/text/AtomicString.h" |
38 #include "wtf/text/AtomicStringHash.h" | 38 #include "wtf/text/AtomicStringHash.h" |
39 | 39 |
40 namespace blink { | 40 namespace blink { |
41 | 41 |
42 class QualifiedName; | 42 class QualifiedName; |
43 | 43 |
44 class MutationObserverRegistration FINAL : public NoBaseWillBeGarbageCollectedFi
nalized<MutationObserverRegistration> { | 44 class MutationObserverRegistration final : public NoBaseWillBeGarbageCollectedFi
nalized<MutationObserverRegistration> { |
45 public: | 45 public: |
46 static PassOwnPtrWillBeRawPtr<MutationObserverRegistration> create(MutationO
bserver&, Node*, MutationObserverOptions, const HashSet<AtomicString>& attribute
Filter); | 46 static PassOwnPtrWillBeRawPtr<MutationObserverRegistration> create(MutationO
bserver&, Node*, MutationObserverOptions, const HashSet<AtomicString>& attribute
Filter); |
47 ~MutationObserverRegistration(); | 47 ~MutationObserverRegistration(); |
48 | 48 |
49 void resetObservation(MutationObserverOptions, const HashSet<AtomicString>&
attributeFilter); | 49 void resetObservation(MutationObserverOptions, const HashSet<AtomicString>&
attributeFilter); |
50 void observedSubtreeNodeWillDetach(Node&); | 50 void observedSubtreeNodeWillDetach(Node&); |
51 void clearTransientRegistrations(); | 51 void clearTransientRegistrations(); |
52 bool hasTransientRegistrations() const { return m_transientRegistrationNodes
&& !m_transientRegistrationNodes->isEmpty(); } | 52 bool hasTransientRegistrations() const { return m_transientRegistrationNodes
&& !m_transientRegistrationNodes->isEmpty(); } |
53 void unregister(); | 53 void unregister(); |
54 | 54 |
(...skipping 19 matching lines...) Expand all Loading... |
74 typedef WillBeHeapHashSet<RefPtrWillBeMember<Node> > NodeHashSet; | 74 typedef WillBeHeapHashSet<RefPtrWillBeMember<Node> > NodeHashSet; |
75 OwnPtrWillBeMember<NodeHashSet> m_transientRegistrationNodes; | 75 OwnPtrWillBeMember<NodeHashSet> m_transientRegistrationNodes; |
76 | 76 |
77 MutationObserverOptions m_options; | 77 MutationObserverOptions m_options; |
78 HashSet<AtomicString> m_attributeFilter; | 78 HashSet<AtomicString> m_attributeFilter; |
79 }; | 79 }; |
80 | 80 |
81 } // namespace blink | 81 } // namespace blink |
82 | 82 |
83 #endif // MutationObserverRegistration_h | 83 #endif // MutationObserverRegistration_h |
OLD | NEW |