Add solutions for part 1

projects/12/ArrayTest/Array.jack

@@ -0,0 +1,29 @@
+// This file is part of www.nand2tetris.org
+// and the book "The Elements of Computing Systems"
+// by Nisan and Schocken, MIT Press.
+// File name: projects/12/Array.jack
+
+/**
+ * Represents an array.
+ * In the Jack language, arrays are instances of the Array class.
+ * Once declared, the array entries can be accessed using the usual
+ * syntax arr[i]. Each array entry can hold a primitive data type as
+ * well as any object type. Different array entries can have different
+ * data types.
+ */
+class Array {
+    /** Constructs a new Array of the given size. */
+    function Array new(int size) {
+        if (size > 0) {
+            return Memory.alloc(size);
+        } else {
+            return 0;
+        }
+    }
+
+    /** Disposes this array. */
+    method void dispose() {
+        do Memory.deAlloc(this);
+        return;
+    }
+}

projects/12/ArrayTest/ArrayTest.cmp

@@ -0,0 +1,2 @@
+|RAM[8000]|RAM[8001]|RAM[8002]|RAM[8003]|
+|     222 |     122 |     100 |      10 |

projects/12/ArrayTest/ArrayTest.tst

@@ -0,0 +1,15 @@
+// This file is part of www.nand2tetris.org
+// and the book "The Elements of Computing Systems"
+// by Nisan and Schocken, MIT Press.
+// File name: projects/12/ArrayTest/ArrayTest.tst
+
+load,
+output-file ArrayTest.out,
+compare-to ArrayTest.cmp,
+output-list RAM[8000]%D2.6.1 RAM[8001]%D2.6.1 RAM[8002]%D2.6.1 RAM[8003]%D2.6.1;
+
+repeat 1000000 {
+  vmstep;
+}
+
+output;

projects/12/ArrayTest/Main.jack

@@ -0,0 +1,40 @@
+// This file is part of www.nand2tetris.org
+// and the book "The Elements of Computing Systems"
+// by Nisan and Schocken, MIT Press.
+// File name: projects/12/ArrayTest/Main.jack
+
+/** Test program for the OS Array class. */
+class Main {
+
+    /** Performs several Array manipulations. */
+    function void main() {
+        var Array r;                  // stores test results
+        var Array a, b, c;
+        
+        let r = 8000;
+        
+        let a = Array.new(3);
+        let a[2] = 222;
+        let r[0] = a[2];              // RAM[8000] = 222
+        
+        let b = Array.new(3);
+        let b[1] = a[2] - 100;
+        let r[1] = b[1];              // RAM[8001] = 122
+        
+        let c = Array.new(500);
+        let c[499] = a[2] - b[1];
+        let r[2] = c[499];            // RAM[8002] = 100
+        
+        do a.dispose();
+        do b.dispose();
+        
+        let b = Array.new(3);
+        let b[0] = c[499] - 90;
+        let r[3] = b[0];              // RAM[8003] = 10
+        
+        do c.dispose();
+        do b.dispose();
+        
+        return;
+    }
+}