Eliminating a signed vs. unsigned comparison.

diff --git a/src/expr/node_manager.cpp b/src/expr/node_manager.cpp
index 1d54d0f9df1ec55f66ac8d77d37ec41c4760ae5a..a9be514180611e596eb09ac0942467c6ff9a81c4 100644 (file)
--- a/src/expr/node_manager.cpp
+++ b/src/expr/node_manager.cpp
@@ -383,7 +383,7 @@ std::vector<NodeValue*> NodeManager::TopologicalSort(
         stack.back().first = true;
         Assert(visited.count(current) == 0);
         visited.insert(current);
-        for (int i = 0; i < current->getNumChildren(); ++i) {
+        for (unsigned i = 0; i < current->getNumChildren(); ++i) {
           expr::NodeValue* child = current->getChild(i);
           if (visited.find(child) == visited.end()) {
             stack.push_back(std::make_pair(false, child));