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 41 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
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 |
55 bool shouldReceiveMutationFrom(Node&, MutationObserver::MutationType, const
QualifiedName* attributeName) const; | 55 bool shouldReceiveMutationFrom(Node&, MutationObserver::MutationType, const
QualifiedName* attributeName) const; |
56 bool isSubtree() const { return m_options & MutationObserver::Subtree; } | 56 bool isSubtree() const { return m_options & MutationObserver::Subtree; } |
57 | 57 |
58 MutationObserver& observer() const { return *m_observer; } | 58 MutationObserver& observer() const { return *m_observer; } |
59 MutationRecordDeliveryOptions deliveryOptions() const { return m_options & (
MutationObserver::AttributeOldValue | MutationObserver::CharacterDataOldValue);
} | 59 MutationRecordDeliveryOptions deliveryOptions() const { return m_options & (
MutationObserver::AttributeOldValue | MutationObserver::CharacterDataOldValue);
} |
60 MutationObserverOptions mutationTypes() const { return m_options & MutationO
bserver::AllMutationTypes; } | 60 MutationObserverOptions mutationTypes() const { return m_options & MutationO
bserver::AllMutationTypes; } |
61 | 61 |
62 void addRegistrationNodesToSet(WillBeHeapHashSet<RawPtrWillBeMember<Node> >&
) const; | 62 void addRegistrationNodesToSet(WillBeHeapHashSet<RawPtrWillBeMember<Node>>&)
const; |
63 | 63 |
64 DECLARE_TRACE(); | 64 DECLARE_TRACE(); |
65 | 65 |
66 void dispose(); | 66 void dispose(); |
67 | 67 |
68 private: | 68 private: |
69 MutationObserverRegistration(MutationObserver&, Node*, MutationObserverOptio
ns, const HashSet<AtomicString>& attributeFilter); | 69 MutationObserverRegistration(MutationObserver&, Node*, MutationObserverOptio
ns, const HashSet<AtomicString>& attributeFilter); |
70 | 70 |
71 RefPtrWillBeMember<MutationObserver> m_observer; | 71 RefPtrWillBeMember<MutationObserver> m_observer; |
72 RawPtrWillBeWeakMember<Node> m_registrationNode; | 72 RawPtrWillBeWeakMember<Node> m_registrationNode; |
73 RefPtrWillBeMember<Node> m_registrationNodeKeepAlive; | 73 RefPtrWillBeMember<Node> m_registrationNodeKeepAlive; |
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 |