September 2017 Update

Task/Balanced-brackets/Aime/balanced-brackets.aime

@@ -1,11 +1,11 @@
 integer
-unbalanced(text s)
+unbalanced(data s)
 {
     integer b, i;
 
     b = 0;
     i = 0;
-    while (i < length(s)) {
+    while (i < b_length(s)) {
         if (s[i] == '[') {
             b += 1;
         } else {
@@ -24,22 +24,15 @@ unbalanced(text s)
 text
 generate(integer d)
 {
-    integer i;
-    text s;
+    list l;
+    data b;
 
-    i = d;
-    while (i) {
-        s = insert(s, 0, '[');
-        i -= 1;
-    }
+    l_pn_integer(l, 0, d, '[');
+    l_pn_integer(l, 0, d, ']');
+    l_rand(l);
+    l_ucall(l, b_append, 1, b);
 
-    i = d;
-    while (i) {
-        s = insert(s, drand(length(s)), ']');
-        i -= 1;
-    }
-
-    return s;
+    return b;
 }
 
 integer
@@ -52,12 +45,7 @@ main(void)
         text s;
 
         s = generate(i);
-        o_text(s);
-        o_text(" is ");
-        if (unbalanced(s)) {
-            o_text("un");
-        }
-        o_text("balanced\n");
+        o_plan(s, " is ", unbalanced(s) ? "un" : "", "balanced\n");
 
         i += 1;
     }