class Tree {
int item;
- Tree @left, right;
+ Tree ref left, right;
fun static Tree new_Tree(int it, int depth) {
Tree t;
<<< "stretch tree of depth ", stretchDepth, " check: ",
Tree.new_Tree(0, stretchDepth).check() >>>;
-Tree.new_Tree(0, maxDepth) @=> Tree@ longLivedTree;
+Tree.new_Tree(0, maxDepth) @=> Tree ref longLivedTree;
#! iterations = 2 ** maxDepth
1 => int iterations;
else
return recursive_fib(n - 2) + recursive_fib(n - 1);
}
-#!<<< 5 => recursive_fib >>>;
<<< 40 => recursive_fib >>>;
--- /dev/null
+int list[0];
+
+for (int i; i < 1000000; ++i)
+ list << i;
+
+int sum;
+for (int i; i < list.size(); ++i)
+ i +=> sum;
+
+<<< sum >>>;
if ("" == "abc") ++count;
if ("abc" == "abcd") ++count;
if ("changed one character" == "changed !ne character") ++count;
-#! if ("123" == 123) ++count
+ if (`${123}` == "123") ++count;
if ("a slightly longer string" ==
"a slightly longer string!") ++count;
if ("a slightly longer string" ==