Examples of SGFTree

Examples of com.tinysgf.SGFTree

42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
            for (int i = 0; i < data.length; i++) {
                InputStreamReader isr = new InputStreamReader(
                        new ByteArrayInputStream(data[i].getBytes()), "UTF8");
                SGFCup parser = new SGFCup(new SGFLex(isr));
                parser.parse();
                SGFTree tree = parser.tree;
/*        System.out.println(i);
                System.out.println(tree.toString());
                System.out.println(data[i]);
*/        assertEquals(data[i], tree.toString());
            }
        } catch (Exception e) {
            e.printStackTrace();
            fail("Unexpected!");
        }
View Full Code Here

Examples of com.tinysgf.SGFTree

60
61
62
63
64
65
66
67
68
69
70
        try {
            String data = "(;SZ[19](;B[da]C[RIGHT];W[ab])(;B[ad]))";
            InputStreamReader isr = new InputStreamReader(
                    new ByteArrayInputStream(data.getBytes()), "UTF8");
            SGFCup parser = new SGFCup(new SGFLex(isr));
            parser.tree = new SGFTree(1, 1);
            parser.parse();
            assertEquals(data, parser.tree.toString());
        } catch (Exception e) {
            e.printStackTrace();
            fail("Unexpected!");
View Full Code Here

Examples of com.tinysgf.SGFTree

24
25
26
27
28
29
30
31
32
33
34
35
36
37
import junit.framework.TestCase;

public class SGFTreeTest extends TestCase {

    public void testCollection() {
        SGFTree collection = new SGFTree();
        int root1 = collection.newNode();
        int root2 = collection.newNode();
        collection.linkVariant(root1, root2);
        assertEquals(SGFTree.ROOT, root1);
        assertEquals(SGFTree.NULL, collection.getPrev(root1));
        assertEquals(SGFTree.NULL, collection.getPrev(root2));
        assertEquals(root2, collection.getNextVariant(root1));
    }
View Full Code Here

Examples of com.tinysgf.SGFTree

35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
        assertEquals(SGFTree.NULL, collection.getPrev(root2));
        assertEquals(root2, collection.getNextVariant(root1));
    }

    public void testNewNode() {
        SGFTree tree = new SGFTree();
        assertEquals(SGFTree.NONE, tree.getMoveProperty(SGFTree.ROOT));

        int m = tree.newNode();

        // add simple node
        int m1 = tree.newNode(m, SGFTree.BLACK_MOVE, 3, 4);
        assertEquals(SGFTree.BLACK_MOVE, tree.getMoveProperty(m1));
        assertEquals(3, tree.getMoveX(m1));
        assertEquals(4, tree.getMoveY(m1));
        assertEquals(m, tree.getPrev(m1));
        assertEquals(SGFTree.NULL, tree.getNext(m1));
        assertEquals(SGFTree.NULL, tree.getNextVariant(m1));
        assertEquals(m1, tree.getNext(m));

        // add variant
        int m2 = tree.newNode(m, SGFTree.BLACK_MOVE, 5, 6);
        assertEquals(m, tree.getPrev(m2));
        assertEquals(SGFTree.NULL, tree.getNext(m2));
        assertEquals(SGFTree.NULL, tree.getNextVariant(m2));
        assertEquals(m2, tree.getNextVariant(m1));
        assertEquals(m1, tree.getNext(m));
    }
View Full Code Here

Examples of com.tinysgf.SGFTree

60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
        assertEquals(m2, tree.getNextVariant(m1));
        assertEquals(m1, tree.getNext(m));
    }

    public void testLinkNode() {
        SGFTree tree = new SGFTree();
        int m = tree.newNode();
        int m1 = tree.newNode(SGFTree.BLACK_MOVE, 3, 4);
        tree.linkNode(m, m1);
        assertEquals(SGFTree.BLACK_MOVE, tree.getMoveProperty(m1));
        assertEquals(3, tree.getMoveX(m1));
        assertEquals(4, tree.getMoveY(m1));
        assertEquals(m, tree.getPrev(m1));
        assertEquals(SGFTree.NULL, tree.getNext(m1));
        assertEquals(SGFTree.NULL, tree.getNextVariant(m1));
        assertEquals(m1, tree.getNext(m));
    }
View Full Code Here

Examples of com.tinysgf.SGFTree

74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
        assertEquals(SGFTree.NULL, tree.getNextVariant(m1));
        assertEquals(m1, tree.getNext(m));
    }

    public void testRemoveNode() {
        SGFTree tree = new SGFTree();
        int m1 = tree.newNode(SGFTree.BLACK_MOVE, 3, 4);
        int m2 = tree.newNode(m1, SGFTree.WHITE_MOVE, 3, 5);
        int m2v2 = tree.newNode(m1, SGFTree.WHITE_MOVE, 3, 7);
        int m2v3 = tree.newNode(m1, SGFTree.WHITE_MOVE, 3, 8);
        int m3 = tree.newNode(m2, SGFTree.BLACK_MOVE, 4, 4);

        tree.removeNode(m3);
        assertEquals(SGFTree.NULL, tree.getNext(m2));
        int m3_ = tree.newNode(m2, SGFTree.BLACK_MOVE, 4, 9);
        assertEquals(m3_, m3);

        tree.removeNode(m2v2);
        assertEquals(m2v3, tree.getNextVariant(m2));
        tree.removeNode(m2);
        assertEquals(m2v3, tree.getNext(m1));
    }
View Full Code Here

Examples of com.tinysgf.SGFTree

93
94
95
96
97
98
99
100
101
102
103
        tree.removeNode(m2);
        assertEquals(m2v3, tree.getNext(m1));
    }

    public void testGetHead() {
        SGFTree tree = new SGFTree();
        int m1 = tree.newNode(SGFTree.BLACK_MOVE, 3, 4);
        int m2 = tree.newNode(m1, SGFTree.WHITE_MOVE, 3, 5);
        int m3 = tree.newNode(m2, SGFTree.BLACK_MOVE, 4, 4);
        assertEquals(m1, tree.getHead(m3));
    }
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.