| 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 58 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 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; |
| 78 | 78 |
| 79 WillBeHeapVector<RefPtrWillBeMember<Node> > m_removedNodes; | 79 WillBeHeapVector<RefPtrWillBeMember<Node>> m_removedNodes; |
| 80 WillBeHeapVector<RefPtrWillBeMember<Node> > m_addedNodes; | 80 WillBeHeapVector<RefPtrWillBeMember<Node>> m_addedNodes; |
| 81 RefPtrWillBeMember<Node> m_previousSibling; | 81 RefPtrWillBeMember<Node> m_previousSibling; |
| 82 RefPtrWillBeMember<Node> m_nextSibling; | 82 RefPtrWillBeMember<Node> m_nextSibling; |
| 83 RawPtrWillBeMember<Node> m_lastAdded; | 83 RawPtrWillBeMember<Node> m_lastAdded; |
| 84 | 84 |
| 85 OwnPtrWillBeMember<MutationObserverInterestGroup> m_observers; | 85 OwnPtrWillBeMember<MutationObserverInterestGroup> m_observers; |
| 86 | 86 |
| 87 unsigned m_mutationScopes; | 87 unsigned m_mutationScopes; |
| 88 }; | 88 }; |
| 89 | 89 |
| 90 class ChildListMutationScope final { | 90 class ChildListMutationScope final { |
| (...skipping 30 matching lines...) Expand all 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 |