浏览代码

Whitespace

Turo Lamminen 7 年之前
父节点
当前提交
bd0d47c5fc
共有 1 个文件被更改,包括 5 次插入5 次删除
  1. 5 5
      code/OptimizeGraph.cpp

+ 5 - 5
code/OptimizeGraph.cpp

@@ -234,11 +234,11 @@ void OptimizeGraphProcess::CollectNewChildren(aiNode* nd, std::list<aiNode*>& no
     nd->mNumChildren = static_cast<unsigned int>(child_nodes.size());
     nd->mNumChildren = static_cast<unsigned int>(child_nodes.size());
 
 
     if (nd->mChildren) {
     if (nd->mChildren) {
-    aiNode** tmp = nd->mChildren;
-    for (std::list<aiNode*>::iterator it = child_nodes.begin(); it != child_nodes.end(); ++it) {
-        aiNode* node = *tmp++ = *it;
-        node->mParent = nd;
-    }
+        aiNode** tmp = nd->mChildren;
+        for (std::list<aiNode*>::iterator it = child_nodes.begin(); it != child_nodes.end(); ++it) {
+            aiNode* node = *tmp++ = *it;
+            node->mParent = nd;
+        }
     }
     }
 
 
     nodes_out += static_cast<unsigned int>(child_nodes.size());
     nodes_out += static_cast<unsigned int>(child_nodes.size());