@@ -210,14 +210,14 @@ class AddChildAction : public UndoableAction
210210 {
211211 parentTree.object ->children .erase (parentTree.object ->children .begin () + childIndex);
212212 parentTree.object ->sendChildRemovedMessage (childTree, childIndex);
213-
213+
214214 // Restore previous parent
215215 if (previousParent.isValid ())
216216 {
217217 // Restore to previous parent at previous index
218218 const int numChildren = static_cast <int > (previousParent.object ->children .size ());
219219 const int actualIndex = (previousIndex < 0 || previousIndex > numChildren) ? numChildren : previousIndex;
220-
220+
221221 previousParent.object ->children .insert (previousParent.object ->children .begin () + actualIndex, childTree);
222222 childTree.object ->parent = previousParent.object ;
223223 previousParent.object ->sendChildAddedMessage (childTree);
@@ -439,11 +439,11 @@ class SimpleTransactionAction : public UndoableAction
439439 break ;
440440 }
441441 }
442-
443- if (!willBeKept && currentChild.object != nullptr )
442+
443+ if (! willBeKept && currentChild.object != nullptr )
444444 currentChild.object ->parent .reset ();
445445 }
446-
446+
447447 dataTree.object ->properties = props;
448448 dataTree.object ->children = children;
449449
@@ -1262,7 +1262,7 @@ void DataTree::Transaction::commit()
12621262 {
12631263 // Apply changes first to get final state, then create undo action with before/after states
12641264 applyChangesToTree (dataTree, originalProperties, originalChildren, propertyChanges, childChanges);
1265-
1265+
12661266 // Create a simple action that can restore the original state
12671267 undoManager->perform (new SimpleTransactionAction (dataTree, description, originalProperties, originalChildren));
12681268 }
0 commit comments