Package com.sgfj

Examples of com.sgfj.SGFNodeIterator.current()

95
96
97
98
99
100
101
102
103
104
105
        playNodeProperties();

        // Find color to play for first nodes without move
        do {
            try {
                byte color = ni.current().getMoveProperty().color;
                if (color != Board.NONE) {
                    colorToPlay = color;
                    break;
                }
            } catch (SGFPropertyNotFoundException e) {
View Full Code Here
236
237
238
239
240
241
242
243
244
245
246
     */
    public SGFNode kifuFirstMove(boolean skipPass) {
        SGFNodeIterator i = kifu.first(false).iterator();
        do {
            try {
                SGFMove move = i.current().getMoveProperty();
                if (!skipPass || move.x >= 0)
                    break;
            } catch (SGFPropertyNotFoundException e) {
            }
        } while (i.next(true) != null);
View Full Code Here
242
243
244
245
246
247
248
249
250
251
252
                if (!skipPass || move.x >= 0)
                    break;
            } catch (SGFPropertyNotFoundException e) {
            }
        } while (i.next(true) != null);
        return i.current();
    }

    private final void boardPlay(int pos, byte color, boolean allowIllegal) throws GameException {
        super.play(pos, color, allowIllegal);
    }
View Full Code Here
383
384
385
386
387
388
389
390
391
392
393
        // mark next move (if not marked in props)
        if (showNextMove) {
            SGFNodeIterator i = lastMoveNode.iterator();
            if (i.next(true) != null) {
                try {
                    SGFMove m = i.current().getMoveProperty();
                    if (isInView(m) && (getWit(m).bits & WIT.PURE_MARK) == 0)
                        getWit(m).addMark(WIT.CIRCLE);
                } catch (SGFPropertyNotFoundException e) {
                    // DO NOTHING
                }
View Full Code Here
404
405
406
407
408
409
410
411
412
413
414
        // mark variations
        if (showVariants) {
            SGFNodeIterator i = lastMoveNode.iterator();
            i.firstVariant(true);
            do {
                SGFNode node = i.current();
                if (node != lastMoveNode)
                    try {
                        SGFMove m = node.getMoveProperty();
                        if (isInView(m))
                            getWit(m).addMark(WIT.VARIANT);
View Full Code Here
422
423
424
425
426
427
428
429
430
431
432
        if (showMoveHints) {
            SGFNodeIterator i = lastMoveNode.iterator();
            if (i.next(true) != null) {
                i.firstVariant(true);
                do {
                    SGFNode node = i.current();
                    try {
                        SGFMove m = node.getMoveProperty();
                        if (isInView(m)) {
                            if ((node.bits & SGFNode.GOOD_MOVE) != 0)
                                getWit(m).addMark(WIT.GOOD_MOVE);
View Full Code Here
641
642
643
644
645
646
647
648
649
650
651
                SGFNodeIterator nextMoves = node.iterator();
                int bits = 0;
                if (nextMoves.next(true) != null) {
                    nextMoves.firstVariant(true);
                    do {
                        bits |= nextMoves.current().bits;
                    } while (nextMoves.nextVariant(true) != null);
                }

                //#ifdef debug
                System.out.println("Next move bits: " + bits);
View Full Code Here
205
206
207
208
209
210
211
212
213
214
215
                    // search for appropriate variant
                    SGFMove newMove = new SGFMove(cursorX, cursorY, game.colorToPlay);
                    SGFMove variantMove;
                    i.firstVariant(true);
                    do {
                        variantMove = i.current().getMoveProperty();
                    } while (!newMove.equals(variantMove) && i.nextVariant(true) != null);

                    if (!newMove.equals(variantMove))
                        return false;
                }
View Full Code Here
238
239
240
241
242
243
244
245
246
247
248
                        i.firstVariant(true);
                        int nGoodVariants = 0;
                        int nBadVariants = 0;

                        do {
                            if ((i.current().bits & SGFNode.GOOD_MOVE) != 0)
                                nGoodVariants++;
                            else if ((i.current().bits & SGFNode.BAD_MOVE) != 0)
                                nBadVariants++;
                        } while (i.nextVariant(true) != null);
View Full Code Here
240
241
242
243
244
245
246
247
248
249
250
                        int nBadVariants = 0;

                        do {
                            if ((i.current().bits & SGFNode.GOOD_MOVE) != 0)
                                nGoodVariants++;
                            else if ((i.current().bits & SGFNode.BAD_MOVE) != 0)
                                nBadVariants++;
                        } while (i.nextVariant(true) != null);

                        // play response if there is good/bad hint
                        if (nGoodVariants > 0 || nBadVariants > 0) {
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.