From 1b56637c6fb150fa217ce7beaab0dcabb0e821f4 Mon Sep 17 00:00:00 2001 From: luzpaz Date: Mon, 10 Jul 2017 14:55:25 -0400 Subject: [PATCH] typo fix --- src/Gui/Tree.cpp | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/src/Gui/Tree.cpp b/src/Gui/Tree.cpp index 2b413f85fa..493b67b862 100644 --- a/src/Gui/Tree.cpp +++ b/src/Gui/Tree.cpp @@ -1123,7 +1123,7 @@ void DocumentItem::populateItem(DocumentObjectItem *item, bool refresh) { int i=-1; // iterate through the claimed children, and try to synchronize them with the - // children tree item with the same order of apperance. + // children tree item with the same order of appearance. for(auto child : children) { if(!canCreateItem(child,pDocument)) continue; @@ -1179,7 +1179,7 @@ void DocumentItem::populateItem(DocumentObjectItem *item, bool refresh) { DocumentObjectItem* obj = static_cast(childItem); // Add the child item back to document root if it is the only // instance. Now, because of the lazy loading strategy, this may - // not truely be the last instance of the object. It may belong to + // not truly be the last instance of the object. It may belong to // other parents not expanded yet. We don't want to traverse the // whole tree to confirm that. Just let it be. If the other // parent(s) later expanded, this child item will be moved from