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 129 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
140 RefPtrWillBeRawPtr<StaticNodeList> removedNodes = StaticNodeList::adopt(m_re
movedNodes); | 140 RefPtrWillBeRawPtr<StaticNodeList> removedNodes = StaticNodeList::adopt(m_re
movedNodes); |
141 RefPtrWillBeRawPtr<MutationRecord> record = MutationRecord::createChildList(
m_target, addedNodes.release(), removedNodes.release(), m_previousSibling.releas
e(), m_nextSibling.release()); | 141 RefPtrWillBeRawPtr<MutationRecord> record = MutationRecord::createChildList(
m_target, addedNodes.release(), removedNodes.release(), m_previousSibling.releas
e(), m_nextSibling.release()); |
142 m_observers->enqueueMutationRecord(record.release()); | 142 m_observers->enqueueMutationRecord(record.release()); |
143 m_lastAdded = nullptr; | 143 m_lastAdded = nullptr; |
144 ASSERT(isEmpty()); | 144 ASSERT(isEmpty()); |
145 } | 145 } |
146 | 146 |
147 bool ChildListMutationAccumulator::isEmpty() | 147 bool ChildListMutationAccumulator::isEmpty() |
148 { | 148 { |
149 bool result = m_removedNodes.isEmpty() && m_addedNodes.isEmpty(); | 149 bool result = m_removedNodes.isEmpty() && m_addedNodes.isEmpty(); |
150 #ifndef NDEBUG | 150 #if ENABLE(ASSERT) |
151 if (result) { | 151 if (result) { |
152 ASSERT(!m_previousSibling); | 152 ASSERT(!m_previousSibling); |
153 ASSERT(!m_nextSibling); | 153 ASSERT(!m_nextSibling); |
154 ASSERT(!m_lastAdded); | 154 ASSERT(!m_lastAdded); |
155 } | 155 } |
156 #endif | 156 #endif |
157 return result; | 157 return result; |
158 } | 158 } |
159 | 159 |
160 void ChildListMutationAccumulator::trace(Visitor* visitor) | 160 void ChildListMutationAccumulator::trace(Visitor* visitor) |
161 { | 161 { |
162 visitor->trace(m_target); | 162 visitor->trace(m_target); |
163 visitor->trace(m_removedNodes); | 163 visitor->trace(m_removedNodes); |
164 visitor->trace(m_addedNodes); | 164 visitor->trace(m_addedNodes); |
165 visitor->trace(m_previousSibling); | 165 visitor->trace(m_previousSibling); |
166 visitor->trace(m_nextSibling); | 166 visitor->trace(m_nextSibling); |
167 visitor->trace(m_lastAdded); | 167 visitor->trace(m_lastAdded); |
168 visitor->trace(m_observers); | 168 visitor->trace(m_observers); |
169 } | 169 } |
170 | 170 |
171 } // namespace WebCore | 171 } // namespace WebCore |
OLD | NEW |