Package com.sgfj

Examples of com.sgfj.SGFNode

472
473
474
475
476
477
478
479
480
481
482
    public void testCompressed() {
        try {
            String data = "(;SZ[3]AW[aa:cb]AB[bc][cc])";
            SGFParser parser = new SGFParser(data);
            SGFNode tree = parser.parse();
            DocumentedGame game = new DocumentedGame(tree);
            byte[] gold = {
                W, W, W,
                W, W, W,
                N, B, B
View Full Code Here
489
490
491
492
493
494
495
496
497
498
499
        }
    }

    void checkData(String data, byte[][] gold, int[] wCapts, int[] bCapts) throws Exception {
        SGFParser parser = new SGFParser(data);
        SGFNode tree = parser.parse();
        DocumentedGame game = new DocumentedGame(tree);
        int node = 0;
        do {
            for (int pos = 0; pos < game.board.maxPos(); pos++) {
                //SGFPoint p = game.board.xy(pos);
View Full Code Here
304
305
306
307
308
309
310
311
312
313
314
        }
        boolean doPass() {
            return false;
        }
        boolean doUndo() {
            SGFNode lastSetupNode = game.kifuFirstMove(true).iterator().prev(false);
            if (game.kifuLastMove() != lastSetupNode && game.prev()) {
                if (gobanCanvas.showMoveHints) {
                    setCursor(game.kifuLastMove().iterator().next(false));
                } else {
                    if (hasRespondMove && game.kifuLastMove() != lastSetupNode)
View Full Code Here
339
340
341
342
343
344
345
346
347
348
349
            }
            return true;
        }
        boolean doRestart() {
            boolean notify = false;
            SGFNode lastSetupNode = game.kifuFirstMove(true).iterator().prev(false);
            while (game.kifuLastMove() != lastSetupNode && game.prev())
                notify = true;
            gobanCanvas.showMoveHints = false;
            //if (notify && gobanCanvas.showMoveHints)
            //    setCursorToNextGoodMove();
View Full Code Here
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
        while (true) {
            int offset = parser.getCharsConsumed();

            // parse file to get tree
            SGFNode tree = null;
            try {
                tree = parser.parse();
            } catch (SGFEOFException e) {
                // DO NOTHING
                break;
            } catch (SGFParseError e) {
                System.out.println("Parse error " + filePath + ":" + e.getMessage());
                break;
            } catch (IOException e) {
                // TODO Auto-generated catch block
                e.printStackTrace();
                break;
            }

            Problem entry = new Problem();
            entry.subPath = subPath;

            String gn;
            try {
                gn = tree.getProperty(SGFPropertyName.GN).getText();
            } catch (SGFException e) {
                gn = "unknown";
            }
            System.out.println(gn + ": " + offset);

            String genre;
            try {
                genre = tree.getProperty(SGFPropertyName.GE).getText();
            } catch (SGFException e) {
                genre = "undefined";
            }
            int i = genres.indexOf(genre);
            if (i < 0) {
                i = genres.size();
                genres.addElement(genre);
            }
            entry.genre = i;

            try {
                entry.difficulty = rank2int(tree.getProperty(SGFPropertyName.DI).getText());
            } catch (SGFException e) {
                entry.difficulty = 0;
            }
            try {
                entry.difficultyP = tree.getProperty(SGFPropertyName.DP).getInt();
            } catch (SGFException e) {
                entry.difficultyP = -1;
            }
            try {
                entry.popularity = tree.getProperty(SGFPropertyName.CO).getInt();
            } catch (SGFException e) {
                entry.popularity = -1;
            }

            entry.offset = offset;
View Full Code Here
628
629
630
631
632
633
634
635
636
    }

    private void checkMoveHintsProperties() {
        if (game == null)
            return;
        SGFNode head = game.kifuHead();
        if ((head.bits & (SGFNode.BAD_MOVE | SGFNode.GOOD_MOVE)) == 0)
            SGFParser.parseMoveHintsProperties(head);
    }
View Full Code Here
693
694
695
696
697
698
699
700
701
702
703
    private boolean setCursorToNextGoodMove() {
        SGFNodeIterator i = game.kifuLastMove().iterator();
        if (i.next(true) != null) {
            i.firstVariant(true);
            do {
                SGFNode node = i.current();
                if ((node.bits & SGFNode.GOOD_MOVE) != 0) {
                    return setCursor(node);
                }
            } while (i.nextVariant(true) != null);
            // no good moves found, set cursor to any move
View Full Code Here
833
834
835
836
837
838
839
840
841
842
843
                                //#endif

                                if (game != null) {
                                    if (mode == probMode) {
                                        // skip first "Pass" moves, since we don't have "Pass" in problem mode
                                        SGFNode lastSetupNode = game.kifuFirstMove(true).iterator().prev(false);
                                        if (lastSetupNode != null) {
                                            try {
                                                while (game.kifuLastMove() != lastSetupNode && game.next())
                                                    // DO NOTHING
                                                    ;
View Full Code Here
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
         */
        is.skip(offset);
        InputStreamReader isr = new InputStreamReader(is/*, "UTF8"*/);
        //isr.skip(offset); // FIXME: Why this doesn't work?
        SGFParser parser = new SGFParser(isr);
        SGFNode newTree = parser.parse();
        is.close();

/*    SGFCup parser = new SGFCup(new SGFLex(isr));
        parser.tree = new SGFTree(2048);
        try {
View Full Code Here
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
        try {
            String sgf = din.readUTF();

            if (sgf.length() > 0) {
                SGFParser parser = new SGFParser(sgf);
                SGFNode newTree = parser.parse();
                newGame = new DocumentedGame(newTree);

                int depth = din.readShort();
                while (depth-- > 0) {
                    int varNumber = din.readShort();
View Full Code Here
TOP

Related Classes of com.sgfj.SGFNode

  • com.sgfj.t.SGFNodeBoundsVisitorTest
  • com.sgfj.t.SGFNodeIteratorTest
  • com.sgfj.t.SGFNodeTest
  • com.sgfj.t.SGFParserTest
  • com.sgfj.t.SGFWriterTest
  • com.tinygo.Controller
  • com.tinygo.Controller$ProblemMode
  • com.tinygo.FileSelectScreen
  • com.tinygo.GobanCanvas
  • com.tinygo.logic.DocumentedGame
    • Copyright © 2018 www.massapicom. 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.