Package com.tinysgf

Examples of com.tinysgf.SGFTree.newNode()

25
26
27
28
29
30
31
32
33
34
35
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));
View Full Code Here
26
27
28
29
30
31
32
33
34
35
36
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
38
39
40
41
42
43
44
45
46
47
48
    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));
View Full Code Here
41
42
43
44
45
46
47
48
49
50
51
        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));
View Full Code Here
51
52
53
54
55
56
57
58
59
60
61
        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
61
62
63
64
65
66
67
68
69
70
71
        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));
View Full Code Here
62
63
64
65
66
67
68
69
70
71
72
    }

    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));
View Full Code Here
75
76
77
78
79
80
81
82
83
84
85
        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);
View Full Code Here
76
77
78
79
80
81
82
83
84
85
86
    }

    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);
View Full Code Here
77
78
79
80
81
82
83
84
85
86
87
    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));
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.