Added progsbase source code

Author: martinfjohansen

.gitignore

@@ -0,0 +1,4 @@
+*.o
+imports
+bin
+C/pbtpl

src/TestLauncher.java

@@ -0,0 +1,7 @@
+public class TestLauncher {
+    public static void main(String [] args){
+        int failures;
+        failures = (int)tests.tests.test();
+        System.out.println(failures);
+    }
+}

src/info.json

@@ -0,0 +1,18 @@
+{
+  "name": "TextualTemplates",
+  "version": "0.1.10",
+  "organization namespace": "no.inductive.libraries",
+  "scientific namespace": "computerscience.algorithms.templates",
+  "imports": [
+    ["", "no.inductive.idea10.programs", "references", "0.1.5"],
+    ["", "no.inductive.idea10.programs", "JSON", "0.4.3"],
+    ["", "no.inductive.idea10.programs", "lists", "0.1.13"],
+    ["", "no.inductive.idea10.programs", "strings", "0.9.14"],
+    ["", "no.inductive.idea10.programs", "arrays", "0.9.7"]
+  ],
+  "development imports": [
+    ["","no.inductive.idea10.programs","testing","0.1.8"]
+  ],
+  "ownerCustomerId": "Inductive AS",
+  "reprefix": []
+}

src/main/TextualTemplates/LinkedListNodeFunctions/LinkedListNodeFunctions.java

@@ -0,0 +1,76 @@
+package TextualTemplates.LinkedListNodeFunctions;
+
+
+import TextualTemplates.TextualTemplates.Node;
+
+public class LinkedListNodeFunctions {
+	public static LinkedListNodes CreateLinkedListNodes(){
+		LinkedListNodes ll;
+
+		ll = new LinkedListNodes();
+		ll.first = new LinkedListNodeNodes();
+		ll.last = ll.first;
+		ll.last.end = true;
+
+		return ll;
+	}
+
+	public static void LinkedListAddNode(LinkedListNodes ll, Node value){
+		ll.last.end = false;
+		ll.last.value = value;
+		ll.last.next = new LinkedListNodeNodes();
+		ll.last.next.end = true;
+		ll.last = ll.last.next;
+	}
+
+	public static Node [] LinkedListNodesToArray(LinkedListNodes ll){
+		Node [] array;
+		double length, i;
+		LinkedListNodeNodes node;
+
+		node = ll.first;
+
+		length = LinkedListNodesLength(ll);
+
+		array = new Node [(int)(length)];
+
+		for(i = 0d; i < length; i = i + 1d){
+			array[(int)(i)] = node.value;
+			node = node.next;
+		}
+
+		return array;
+	}
+
+	public static double LinkedListNodesLength(LinkedListNodes ll){
+		double l;
+		LinkedListNodeNodes node;
+
+		l = 0d;
+		node = ll.first;
+		for(; !node.end; ){
+			node = node.next;
+			l = l + 1d;
+		}
+
+		return l;
+	}
+
+	public static void FreeLinkedListNode(LinkedListNodes ll){
+		LinkedListNodeNodes node, prev;
+
+		node = ll.first;
+
+		for(; !node.end; ){
+			prev = node;
+			node = node.next;
+			delete(prev);
+		}
+
+		delete(node);
+	}
+
+  public static void delete(Object object){
+    // Java has garbage collection.
+  }
+}

src/main/TextualTemplates/LinkedListNodeFunctions/LinkedListNodeNodes.java

@@ -0,0 +1,9 @@
+package TextualTemplates.LinkedListNodeFunctions;
+
+import TextualTemplates.TextualTemplates.Node;
+
+public class LinkedListNodeNodes {
+	public boolean end;
+	public Node value;
+	public LinkedListNodeNodes next;
+}

src/main/TextualTemplates/LinkedListNodeFunctions/LinkedListNodes.java

@@ -0,0 +1,9 @@
+package TextualTemplates.LinkedListNodeFunctions;
+
+import TextualTemplates.LinkedListNodeFunctions.LinkedListNodeNodes;
+import TextualTemplates.TextualTemplates.TextualTemplates;
+
+public class LinkedListNodes {
+	public LinkedListNodeNodes first;
+	public LinkedListNodeNodes last;
+}

src/main/TextualTemplates/TextualTemplates/Node.java

@@ -0,0 +1,13 @@
+package TextualTemplates.TextualTemplates;
+
+import TextualTemplates.LinkedListNodeFunctions.LinkedListNodes;
+
+public class Node {
+    public char [] type;
+    public char [] p1;
+    public char [] p2;
+    public Node block1;
+    public boolean hasElseBlock;
+    public Node block2;
+    public LinkedListNodes nodes;
+}