diff options
Diffstat (limited to 'examples/tree.zc')
| -rw-r--r-- | examples/tree.zc | 23 |
1 files changed, 13 insertions, 10 deletions
diff --git a/examples/tree.zc b/examples/tree.zc index 9ef515e..4f304de 100644 --- a/examples/tree.zc +++ b/examples/tree.zc @@ -1,26 +1,29 @@ +namespace; +include rt; + // a binary search tree where every node owns its children. there's no free // anywhere: when the root's block ends, the whole tree goes with it. struct node { int v; node* left, right; }; -node*.u leaf(int v) { node* n = new(node); n.v = v; return u*n; } +node*.u leaf(int v) { node* n = rt.new(node); n.v = v; return n; } // n is borrowed; storing a new leaf into it makes n the leaf's owner -fn insert(node*.m n, int v) { +void insert(node*.m n, int v) { if (v < n.v) { if (n.left) insert(n.left, v); else n.left = leaf(v); } else { if (n.right) insert(n.right, v); else n.right = leaf(v); } - return 0; + return; } -fn walk(node* n) { if (!n) return 0; walk(n.left); put_n(n.v); put_c(' '); walk(n.right); return 0; } +void walk(node* n) { if (!n) return; walk(n.left); rt.put_n(n.v); rt.put_c(' '); walk(n.right); return; } int height(node* n) { if (!n) return 0; int l = height(n.left), r = height(n.right); return 1 + (l > r ? l : r); } -fn main() { - let before = live_objects(); +void main() { + let before = rt.live_objects(); { node* root = leaf(50); int x = 7; for (int i = 0; i < 30; i++) { x = (x * 37 + 11) % 100; insert(root, x); } - walk(root); put_c(10); - put_s("height "); put_n(height(root)); put_s(", live objects "); put_n(live_objects() - before); put_c(10); + walk(root); rt.put_c(10); + rt.put_s("height "); rt.put_n(height(root)); rt.put_s(", live objects "); rt.put_n(rt.live_objects() - before); rt.put_c(10); } - put_s("after the block: "); put_n(live_objects() - before); put_c(10); - return 0; + rt.put_s("after the block: "); rt.put_n(rt.live_objects() - before); rt.put_c(10); + return; } |