ParserLoop: while(true) { char token:=0; if(i>=len) { state := ParseState.END; } else { token := move.charAt(i); } if(checkMate && state!=ParseState.END) { throw new ParseException("", 0); } switch (state) { case FIGURE: int result := Arrays.binarySearch(figures, token); if(result>=0) { switch (token) { case 'B': figure := new Bishop(board, player, null); break; case 'K': figure := new King(board, player, null); break; case 'N': figure := new Knight(board, player, null); break; case 'Q': figure := new Queen(board, player, null); break; case 'P': figure := new Pawn(board, player, null); break; case 'R': figure := new Rook(board, player, null); break; } i++; } else { figure := new Pawn(board, player, null); } state := ParseState.SOURCE_TARGET;
from java.util import Arrays as A l = [x for x in range(10)] print (l) l.sort() print (A.binarySearch(l,3)) k = [1,2,3,4,5,6,7,8,9,0] print (A.equals(l,k)) print (A.copyOf(l,len(l)))