From 3d5656fb57cbb7ebd2dd98116ce71039ab19a113 Mon Sep 17 00:00:00 2001 From: Paul Beckingham Date: Sun, 5 Sep 2010 09:14:36 -0400 Subject: [PATCH] Unit Tests - The lisp.t.cpp tests were written for an older and different Tree object. This change brings it more up to date. --- src/tests/lisp.t.cpp | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) diff --git a/src/tests/lisp.t.cpp b/src/tests/lisp.t.cpp index a5f6fc7ca..32875123b 100644 --- a/src/tests/lisp.t.cpp +++ b/src/tests/lisp.t.cpp @@ -42,10 +42,10 @@ int main (int argc, char** argv) // -> no child nodes Lisp l; Tree* t = l.parse ("(one)"); - // TODO When tegelsten/Tree is merged in, uncomment this. - t->dump (); + //t->dump (); + test.is (t->branches (), 1, "(one) -> 1 node under root"); - test.is ((*t)[0]->tags (), 0, "(one) -> 0 tags"); + test.is ((*t)[0]->tags (), 1, "(one) -> 1 tag"); test.is ((*t)[0]->branches (), 0, "(one) -> 0 child nodes"); delete t; @@ -53,10 +53,10 @@ int main (int argc, char** argv) // t -> "one" (tag: "two") // -> no child nodes t = l.parse ("(one two)"); - // TODO When tegelsten/Tree is merged in, uncomment this. - t->dump (); + //t->dump (); + test.is (t->branches (), 1, "(one two) -> 1 node under root"); - test.is ((*t)[0]->tags (), 1, "(one) -> 1 tag"); + test.is ((*t)[0]->tags (), 2, "(one) -> 2 tags"); test.is ((*t)[0]->branches (), 0, "(one two) -> 0 child nodes"); delete t;