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 46 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
57 void childAdded(PassRefPtrWillBeRawPtr<Node>); | 57 void childAdded(PassRefPtrWillBeRawPtr<Node>); |
58 void willRemoveChild(PassRefPtrWillBeRawPtr<Node>); | 58 void willRemoveChild(PassRefPtrWillBeRawPtr<Node>); |
59 | 59 |
60 bool hasObservers() const { return m_observers; } | 60 bool hasObservers() const { return m_observers; } |
61 | 61 |
62 // Register and unregister mutation scopes that are using this mutation | 62 // Register and unregister mutation scopes that are using this mutation |
63 // accumulator. | 63 // accumulator. |
64 void enterMutationScope() { m_mutationScopes++; } | 64 void enterMutationScope() { m_mutationScopes++; } |
65 void leaveMutationScope(); | 65 void leaveMutationScope(); |
66 | 66 |
67 void trace(Visitor*); | 67 DECLARE_TRACE(); |
68 | 68 |
69 private: | 69 private: |
70 ChildListMutationAccumulator(PassRefPtrWillBeRawPtr<Node>, PassOwnPtrWillBeR
awPtr<MutationObserverInterestGroup>); | 70 ChildListMutationAccumulator(PassRefPtrWillBeRawPtr<Node>, PassOwnPtrWillBeR
awPtr<MutationObserverInterestGroup>); |
71 | 71 |
72 void enqueueMutationRecord(); | 72 void enqueueMutationRecord(); |
73 bool isEmpty(); | 73 bool isEmpty(); |
74 bool isAddedNodeInOrder(Node*); | 74 bool isAddedNodeInOrder(Node*); |
75 bool isRemovedNodeInOrder(Node*); | 75 bool isRemovedNodeInOrder(Node*); |
76 | 76 |
77 RefPtrWillBeMember<Node> m_target; | 77 RefPtrWillBeMember<Node> m_target; |
(...skipping 43 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
121 m_accumulator->willRemoveChild(&child); | 121 m_accumulator->willRemoveChild(&child); |
122 } | 122 } |
123 | 123 |
124 private: | 124 private: |
125 RefPtrWillBeMember<ChildListMutationAccumulator> m_accumulator; | 125 RefPtrWillBeMember<ChildListMutationAccumulator> m_accumulator; |
126 }; | 126 }; |
127 | 127 |
128 } // namespace blink | 128 } // namespace blink |
129 | 129 |
130 #endif // ChildListMutationScope_h | 130 #endif // ChildListMutationScope_h |
OLD | NEW |