| 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(PassRefPtr<Node>); | 57 void childAdded(PassRefPtr<Node>); |
| 58 void willRemoveChild(PassRefPtr<Node>); | 58 void willRemoveChild(PassRefPtr<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*); | |
| 68 | |
| 69 private: | 67 private: |
| 70 ChildListMutationAccumulator(PassRefPtr<Node>, PassOwnPtr<MutationObserverIn
terestGroup>); | 68 ChildListMutationAccumulator(PassRefPtr<Node>, PassOwnPtr<MutationObserverIn
terestGroup>); |
| 71 | 69 |
| 72 void enqueueMutationRecord(); | 70 void enqueueMutationRecord(); |
| 73 bool isEmpty(); | 71 bool isEmpty(); |
| 74 bool isAddedNodeInOrder(Node*); | 72 bool isAddedNodeInOrder(Node*); |
| 75 bool isRemovedNodeInOrder(Node*); | 73 bool isRemovedNodeInOrder(Node*); |
| 76 | 74 |
| 77 RefPtr<Node> m_target; | 75 RefPtr<Node> m_target; |
| 78 | 76 |
| (...skipping 42 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 121 m_accumulator->willRemoveChild(&child); | 119 m_accumulator->willRemoveChild(&child); |
| 122 } | 120 } |
| 123 | 121 |
| 124 private: | 122 private: |
| 125 RefPtr<ChildListMutationAccumulator> m_accumulator; | 123 RefPtr<ChildListMutationAccumulator> m_accumulator; |
| 126 }; | 124 }; |
| 127 | 125 |
| 128 } // namespace blink | 126 } // namespace blink |
| 129 | 127 |
| 130 #endif // ChildListMutationScope_h | 128 #endif // ChildListMutationScope_h |
| OLD | NEW |