Fix wrong behaviour of topological sort.

When dealing with repeated and unordered classes it can generate an
invalid result array.

Reviewer: Renato Araújo <renato.filho@openbossa.org>
          Marcelo Lira <marcelo.lira@openbossa.org>

1 files changed, 4 insertions, 2 deletions

diff --git a/abstractmetabuilder.cpp b/abstractmetabuilder.cpp
index b02a60fbb..6bfee26cc 100644
--- a/abstractmetabuilder.cpp
+++ b/abstractmetabuilder.cpp
@@ -2668,15 +2668,17 @@ AbstractMetaClassList AbstractMetaBuilder::classesTopologicalSorted(const Abstra
 
     const AbstractMetaClassList& classList = cppClass ? cppClass->innerClasses() : m_metaClasses;
 
-    Graph graph(classList.count());
-
     int i = 0;
     foreach (AbstractMetaClass* clazz, classList) {
+        if (map.contains(clazz->qualifiedCppName()))
+            continue;
         map[clazz->qualifiedCppName()] = i;
         reverseMap[i] = clazz;
         i++;
     }
 
+    Graph graph(map.count());
+
     // TODO choose a better name to these regexs
     QRegExp regex1("\\(.*\\)");
     QRegExp regex2("::.*");