Decently performant double-linked two-way linked list implementation

1 files changed, 2 insertions, 0 deletions

diff --git a/main.c b/main.c
index abd1b21..58c28dd 100644
--- a/main.c
+++ b/main.c
@@ -7,6 +7,8 @@ datatype(binarytree, ((leaf, int), (node, binarytree *, int, binarytree *) ));
 int main() {
     const auto tree = instance(binarytree, leaf, 3);
 
+    print(&tree);
+
     match(tree) {
         of(leaf, v) print("Leafy ", v);
         of(node, _, v, _) print("Nodey ", v);