| package groovy.tree |
| |
| /** |
| * This test uses the concise GroovyMarkup syntax to test the building of trees |
| */ |
| class TreeTest extends GroovyTestCase { |
| |
| void testSmallTree() { |
| def b = NodeBuilder.newInstance() |
| |
| def root = b.root1(a:5, b:7) { |
| elem1('hello1') |
| elem2('hello2') |
| elem3(x:7) |
| } |
| |
| assert root != null |
| |
| print(root) |
| } |
| |
| void testTree() { |
| def b = NodeBuilder.newInstance() |
| |
| def root = b.root2(a:5, b:7) { |
| elem1('hello1') |
| elem2('hello2') |
| nestedElem(x:'abc', y:'def') { |
| child(z:'def') |
| child2() |
| } |
| |
| nestedElem2(z:'zzz') { |
| child(z:'def') |
| child2("hello") |
| } |
| } |
| |
| assert root != null |
| |
| print(root) |
| |
| def e1 = root.elem1.get(0) |
| assert e1.value() == 'hello1' |
| |
| def e2 = root.elem2.get(0) |
| assert e2.value() == 'hello2' |
| |
| assert root.elem1.get(0).value() == 'hello1' |
| assert root.elem2.get(0).value() == 'hello2' |
| |
| assert root.nestedElem.get(0).attributes() == ['x':'abc', 'y':'def'] |
| assert root.nestedElem.child.get(0).attributes() == ['z':'def'] |
| |
| assert root.nestedElem.child2.get(0).value() == [] |
| assert root.nestedElem.child2.get(0).text() == '' |
| |
| assert root.nestedElem2.get(0).attributes() == ['z':'zzz'] |
| assert root.nestedElem2.child.get(0).attributes() == ['z':'def'] |
| assert root.nestedElem2.child2.get(0).value() == 'hello' |
| assert root.nestedElem2.child2.get(0).text() == 'hello' |
| |
| def list = root.value() |
| assert list.size() == 4 |
| |
| assert root.attributes().a == 5 |
| assert root.attributes().b == 7 |
| |
| assert root.nestedElem.get(0).attributes().x == 'abc' |
| assert root.nestedElem.get(0).attributes().y == 'def' |
| assert root.nestedElem2.get(0).attributes().z == 'zzz' |
| assert root.nestedElem2.child.get(0).attributes().z == 'def' |
| |
| /** @todo parser add .@ as an operation |
| assert root.@a == 5 |
| assert root.@b == 7 |
| */ |
| } |
| } |