circular dependencies problem fixed.

src/vpkResolver.Mod

@@ -0,0 +1,91 @@
+MODULE vpkResolver;
+IMPORT Out, Strings, StringList, vpkdepTree, vpkRetriever;
+
+TYPE
+   Tdep = vpkdepTree.Tdep;
+  Tdeps = vpkdepTree.Tdeps;
+
+  TdepTree = vpkdepTree.TdepTree;
+
+PROCEDURE treeContains(VAR d: Tdep; VAR depTree: TdepTree): BOOLEAN;
+VAR
+  res: BOOLEAN;
+  i: INTEGER;
+  d2: Tdep;
+BEGIN
+  Out.String("entered treeContains, tree count is "); Out.Int(depTree.Count, 0); Out.Ln;
+  res := FALSE;
+  i := 0;
+  REPEAT
+    Out.Int(i, 0); Out.Ln;
+    d2 := depTree.Get(depTree, i);
+    IF d2 # NIL THEN
+      Out.String("comparing, "); Out.String(d.name^); Out.String(" & "); Out.String(d2.name^); Out.Ln;
+      IF d = d2 THEN (*res := TRUE*) Out.String("TR") ELSE Out.String("FL") END;Out.Ln;(* TODO: understand why this doesnt work *)
+      IF d.name^ = d2.name^ THEN res := TRUE; Out.String("TR") ELSE Out.String("FL")  END; Out.Ln;
+    END;
+    INC(i)
+  UNTIL res OR (i >= depTree.Count);
+  IF res THEN Out.String("yes!") ELSE Out.String("no!"); Out.Ln END;
+  RETURN res;
+END treeContains;
+
+PROCEDURE mkDepTree(VAR d: Tdep; VAR depTree, met: TdepTree);
+VAR
+  depStrs: StringList.TStringList;
+  t: Tdep;
+  deps: Tdeps;
+  e: StringList.Node;
+  i: INTEGER;
+BEGIN
+  Out.String("processing dep: "); Out.String(d.name^); Out.Ln;
+  met.Add(met, d);
+
+    depStrs := vpkRetriever.getDeps(d.name^); 
+    IF depStrs # NIL THEN
+      Out.String("it has "); Out.Int(depStrs.Count, 0); Out.String(" deps"); Out.Ln;
+      NEW (deps, depStrs.Count);
+      d.deps := deps;
+      i := 0;
+      REPEAT
+        e := depStrs.Get(depStrs, i);
+        IF e # NIL THEN
+          (*Out.String (e.obj(StringList.TString).str^); Out.Ln;*)
+          NEW(t); NEW(t.name, Strings.Length(e.obj(StringList.TString).str^)+1);
+          COPY (e.obj(StringList.TString).str^, t.name^);
+          deps[i] := t;
+          Out.String("checking if "); Out.String(t.name^); Out.String(" resolved"); Out.Ln;
+          IF ~treeContains(t, depTree) THEN
+            Out.String("checking if "); Out.String(t.name^); Out.String(" met"); Out.Ln;
+            IF treeContains(t, met) THEN
+              Out.String("curcular dependency!"); Out.Ln;
+              Out.String(d.name^); Out.String(" requires "); Out.String(t.name^); Out.Ln;
+              HALT(60)
+            ELSE
+              mkDepTree(t, depTree, met)
+            END;
+          END;
+        END;
+        INC(i) 
+      UNTIL i = depStrs.Count - 1;
+    ELSE
+      Out.String("has no deps"); Out.Ln;
+    END;
+    depTree.Add(depTree, d);
+END mkDepTree;
+
+PROCEDURE resolve*(first: ARRAY OF CHAR): TdepTree;
+VAR
+  depTree: TdepTree;
+  met: TdepTree;
+  dep:  Tdep;
+BEGIN
+  depTree := vpkdepTree.Create();
+  met := vpkdepTree.Create(); (* for deps that we already met *)
+  NEW(dep); NEW(dep.name, Strings.Length(first) + 1);
+  COPY(first, dep.name^);
+  mkDepTree(dep, depTree, met);
+  RETURN depTree
+END resolve;
+
+END vpkResolver.

src/vpkRetriever.Mod

@@ -0,0 +1,32 @@
+MODULE vpkRetriever;
+IMPORT StringList, strutils, vpkJsonParser, vpkStorage, vpkSettings;
+
+
+PROCEDURE getDeps*(VAR name: ARRAY OF CHAR): StringList.TStringList;
+VAR
+  jsonRecord, dependencies: vpkJsonParser.JsonTypePointer;
+  p: strutils.pstring;
+  b: BOOLEAN;
+  result: StringList.TStringList;
+  pkgName : ARRAY 32 OF CHAR;
+BEGIN
+  result := NIL;
+  p := NIL;
+  vpkStorage.json2pstring(name, p);
+  IF p # NIL THEN
+    jsonRecord := vpkJsonParser.Create(p^);
+    b := jsonRecord.GetTerminal(jsonRecord, vpkSettings.pkgTypKey, pkgName);
+    IF b THEN
+      dependencies := NIL;
+      dependencies := jsonRecord.GetNonTerminal(jsonRecord, vpkSettings.depTypKey);
+      IF dependencies # NIL THEN
+        dependencies.GetTerminalKeys(dependencies, result);
+        RETURN result
+      END
+    END
+  END;
+  RETURN result
+END getDeps;
+
+
+END vpkRetriever.