xMax) || (newValue < xMin)) { // outside the bounds of the problem\n newValue = tempX.getReal(randDim) - (inc * stepSize);\n walkSpecifier.flipBit(randDim); // change the direction\t\t \n }\n // }\n /* else {\n\t\tint randBit = (int)Math.floor(randGenerator.nextDouble()*2);\n\t\tif (randBit == 0) inc = 1;\n\t\telse inc = -1;\n\t\tnewValue = tempX.getReal(randDim) + (inc * stepSize);\n\t\tif ((newValue > xMax) || (newValue < xMin)) \n\t\t newValue = tempX.getReal(randDim) - (inc * stepSize);\n\t } */\n tempX.setReal(randDim, newValue); // change tempX to new value\n }\n\n else if (walkType == WALKTYPE_RANDOM_PROGRESSIVE) {\n for (int i = 0; i < dimension; i++) {\n // save the previous component:\n points[count].setReal(i, tempX.getReal(i));\n\n // for all steps: progress in set direction\n smallRandomChange = (randGenerator.nextDouble() * stepSize); // a positive value\n if (walkSpecifier.isSet(i))\n smallRandomChange = -smallRandomChange;\n newValue = tempX.getReal(i) + smallRandomChange;\n if (newValue < xMin) { // out of bounds -- too small:\n // calculate by how much it goes over the boundary:\n double diff = xMin - newValue;\n newValue = xMin + diff; // bounce back from the boundary\n walkSpecifier.flipBit(i); // change direction bias for that dimension\n }\n else if (newValue > xMax) { // out of bounds -- too big:\n double diff = newValue - xMax;\n newValue = xMax - diff; // bounce back from the boundary\n walkSpecifier.flipBit(i); // change direction bias for that dimension\n }\n // previous strategy: change direction in both cases (too big or too small):\n // newValue = tempX.getReal(i) - smallRandomChange;\n // walkSpecifier.flipBit(i); // change the direction\n tempX.setReal(i, newValue);\n }\n }\n\n else { // WALKTYPE_RANDOM_*\n for (int i = 0; i < dimension; i++) { // for every part of the vector\n points[count].setReal(i, tempX.getReal(i)); // save the last position\n\n if (walkType == WALKTYPE_RANDOM) {\n boolean outsideBounds = true; // assume out of bounds to start\n while (outsideBounds) { // while the new value is outside the bounds \t\t\t\n // generate a small random step in either direction\n smallRandomChange = (randGenerator.nextDouble() * stepSize * 2) - stepSize;\n newValue = tempX.getReal(i) + smallRandomChange; // change tempXi by small random amount\n if ((newValue >= xMin) && (newValue <= xMax)) { // check if new value would be in bounds\n outsideBounds = false;\n tempX.setReal(i, newValue); // update tempX with the step\n } // end of if\t\t \n } // end of while outside bounds\n }\n else { // WALKTYPE_RANDOM_INCREASING or WALKTYPE_RANDOM_INCREASING_NOWRAP \n smallRandomChange = (randGenerator.nextDouble() * stepSize); // a positive value\n newValue = tempX.getReal(i) + smallRandomChange; // change tempXi by small positive amount\n if ((newValue > xMax) || (newValue < xMin)) { // outside the bounds\n if (walkType == WALKTYPE_RANDOM_INCREASING_NOWRAP) {\n // save the rest of the previous position:\n for (int j = i + 1; j < dimension; j++)\n points[count].setReal(j, tempX.getReal(j));\n stopWalk(count); // stop the walk at the current number of steps\n return;\n }\n else {\n newValue = xMin; // wrap to minimum value\n }\n }\n tempX.setReal(i, newValue); // change tempXi to new value\n }\n } // end of for each part of the vector\n }\n count++;\n }\n }","title":""},{"docid":"8a5cfd488124c3825093e5baf089a0db","score":"0.59746504","text":"private TwoTuple getFirstMove() {\n\t\tint stX, stY;\n\t\tstX = (int) (Math.random() * this.colDimension) + 1;\n\t\tstY = (int) (Math.random() * this.rowDimension) + 1;\n\t\treturn new TwoTuple(stX, stY);\n\t}","title":""},{"docid":"c71b5ee728e44b9eb8da5ace9c0be479","score":"0.5967686","text":"public static void soldierRandom() throws GameActionException {\n int action = (rc.getRobot().getID()*rand.nextInt(1001) + 500)%1001;\n // construct PASTR\n if (action < 4) {\n Soldier.constructPastr();\n }\n // attack nearby cunts\n else if (action < 600) {\n //Attacks.attackRandom();\n Attacks.interceptAndAttack();\n }\n // move in a random direction\n else if (action < 700) {\n Soldier.randomMove();\n }\n // suicide bomb enemy PASTRs\n else if (action < 700) {\n Soldier.suicideBomb();\n }\n // move away from the friendly HQ\n else if (action < (800)) {\n Soldier.moveAwayFromHQ();\n }\n //Sneak towards the enemy\n else {\n Soldier.sneakTowardEnemyHQ();\n }\n }","title":""},{"docid":"0d769604faef086ec1c81165912a50ff","score":"0.59662414","text":"int random(int roof){\n return (rand.nextInt(roof)); // Uses random class and rood to return randomized number\n }","title":""},{"docid":"8b03d9faaa5d042d29c3114506564bdd","score":"0.5964866","text":"public String randomAction(){\n\t\tif(generator.nextDouble() < AI_MOVE_PROBABILITY)\n\t\t\treturn \"move\";\n\t\telse\n\t\t\treturn \"shoot\";\n\t}","title":""},{"docid":"7a3b2225ce8c603ed6dadc3d1b9fd8e2","score":"0.59618425","text":"public void faceRandomDirection() {\n turn(Greenfoot.getRandomNumber(360));\n }","title":""},{"docid":"6e18fd18c5d0790ac6cb6550cca8c191","score":"0.5955642","text":"public boolean makeMove(JumbleMove move)\n {\n\tint a = move.getMoveA();\n\tint b = move.getMoveB();\n\t\n\tif(isPossibleMove(move))\n\t{\n\t String[] random = StringManipulator.stringToArray(m_state);\n\t \n\t String hold = random[a];\n\t random[a] = random[b];\n\t random[b] = hold;\n\t \n\t m_state = StringManipulator.arrayToString(random);\n\t \n\t return true;\n\t}\n\telse\n\t return false;\n }","title":""},{"docid":"079da5bc4535d86033d2f295b6e5c9de","score":"0.59532803","text":"void generate();","title":""}],"string":"[\n {\n \"docid\": \"c793037030e12106034bb7512c771f8b\",\n \"score\": \"0.76178086\",\n \"text\": \"public void makeRandomMove() {\\n\\t\\tRandom myRandom = new Random();\\n\\t\\t// We can move in one of four directions (North, South, East, or West)\\n\\t\\tint direction = myRandom.nextInt(4);\\n\\t\\t// Get all four neighboring locations and store in an Array of Locations called\\n\\t\\t// neighbors\\n\\t\\t// Note: neighbors[0] is the location north of our current Location.\\n\\t\\t// neighbors[1] is east. neighbors[2] is south. neighbors[3] is west.\\n\\t\\tLocation[] neighbors = currentLocation.getNeighbors();\\n\\t\\t// If we randomly chose an invalid or wall location to move in to, try again.\\n\\t\\twhile (!Maze.isOpen(neighbors[direction])) {\\n\\t\\t\\tdirection = myRandom.nextInt(4);\\n\\t\\t}\\n\\t\\t// take a step in the randomly selected open direction.\\n\\t\\ttakeStep(neighbors[direction]);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a8d877f5ad4ce71593dae1015cee51df\",\n \"score\": \"0.7612744\",\n \"text\": \"public List randomMove();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3b547affd1985a592d7b7be38835f42b\",\n \"score\": \"0.7463666\",\n \"text\": \"private Move getRandomMove() {\\n\\t\\tFaceName face;\\n\\t\\tDirection dir;\\n\\t\\tRandom r = new Random();\\n\\t\\t\\n\\t\\t//first generate the face moved\\n\\t\\tint x = r.nextInt(9);\\n\\t\\t\\n\\t\\tif(x < 2) face = FaceName.Up;\\n\\t\\telse if(x < 4) face = FaceName.Right;\\n\\t\\telse if(x < 6) face = FaceName.Front;\\n\\t\\telse if(x == 6) face = FaceName.Back;\\n\\t\\telse if(x == 7) face = FaceName.Left;\\n\\t\\telse face = FaceName.Down;\\n\\t\\t\\n\\t\\t//now generate the direction of movement\\n\\t\\tx = r.nextInt(10);\\n\\t\\t\\n\\t\\tif(x < 4) dir = Direction.Clock;\\n\\t\\telse if(x < 8) dir = Direction.Counterclock;\\n\\t\\telse dir = Direction.Twice;\\n\\t\\t\\n\\t\\treturn new Move(face, dir);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"da647b5d926a960facd242dc28cf5048\",\n \"score\": \"0.7202295\",\n \"text\": \"public int randomMove(){\\n\\t\\treturn generator.nextInt(2 * Game.MAX_MOVE) - Game.MAX_MOVE;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"96ff9a81ba68dbdbb76a2d9df6e6485a\",\n \"score\": \"0.7181495\",\n \"text\": \"public abstract boolean moveRandom(List moves);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8044a52e72f0db780ed6556fc13d6ca3\",\n \"score\": \"0.7080131\",\n \"text\": \"public void random(){\\n int i;\\n for( i = 0; i <200; i++){\\n int num;\\n\\n num = (int)(Math.random()*16);\\n /**because the random number generator is multiplied by 16 and the game starts off\\n * being in an already solved state this makes every randomized option that it gives SOLVABLE\\n */\\n move(num);//goes back to the method move and uses the new int as a paramter for the next positions of the buttons\\n\\n }\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7d66cf6b455112ea25486a08c81e948d\",\n \"score\": \"0.6935275\",\n \"text\": \"@Test\\n public void populateBoardRandom() {\\n // Should generate 80% '2' and 20% '4', than apply to a random available\\n // position on the board\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8f703410f4c6bc8401779a2f52b08e89\",\n \"score\": \"0.690883\",\n \"text\": \"@Override\\n protected int getNextMove() {\\n int[] freeSquares = myGame.getFreeSquares();\\n int i = random.nextInt(freeSquares.length);\\n return freeSquares[i];\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a0dc6c48919cf41105a7b77e78180302\",\n \"score\": \"0.690696\",\n \"text\": \"public void move() {\\n List moves = board.getConnections(location);\\n location = moves.get(random.nextInt(moves.size()));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a3839674119d71923e1b24dee7f01ee\",\n \"score\": \"0.6803012\",\n \"text\": \"Move randomPlayAndLearn(Board theBoard) {\\n MoveList list = theBoard.generateMoves();\\r\\n Learner.trimLosing(list,theBoard); //get rid of the losing moves \\r\\n if (list.isEmpty()) { //there are no moves left?\\r\\n Learner.handleLoss(); //save the losing information\\r\\n return selectRandomMove(theBoard);\\r\\n }\\r\\n else {\\r\\n int r = rand(list.size());\\r\\n Learner.setLastMove(theBoard, list.get(r)); //remember the last move\\r\\n \\r\\n return list.get(r);\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c23996c4be4327702c5f0eff0c89e6f\",\n \"score\": \"0.6796265\",\n \"text\": \"public Move randomMove(Stack possibilities){\\n int moveID = rand.nextInt(possibilities.size());\\n System.out.println(\\\"Agent randomly selected move : \\\"+moveID);\\n for(int i=1;i < (possibilities.size()-(moveID));i++){\\n possibilities.pop();\\n }\\n Move selectedMove = (Move)possibilities.pop();\\n return selectedMove;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6edf8e808f85bb597835413ceba845ba\",\n \"score\": \"0.6612815\",\n \"text\": \"public void generateMaze() {\\r\\n\\t\\tgenerateMaze(new Random().nextLong());\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6a0882123228a587931dac4d2e80aa44\",\n \"score\": \"0.65918887\",\n \"text\": \"private Cell makeRandomMove() {\\n Cell myCell = null;\\n int row, col;\\n\\n while (myCell == null) {\\n row = _RandomMove.nextInt(_RowColCells);\\n col = _RandomMove.nextInt(_RowColCells);\\n\\n if (_TheGame.IsCellEmpty(row, col)) {\\n //create a new cell to return to caller (don't care about image as this is just\\n //for coordinates\\n myCell = new Cell(row, col, null);\\n }\\n }\\n\\n return myCell;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"460a492ff6ef76060eb18b2f978b555e\",\n \"score\": \"0.65835875\",\n \"text\": \"public void shuffle(){\\n\\t\\tint s = size();\\n\\t\\tfor(int i = 0; i < s; i++){\\n\\t\\t\\tint newPos = random.nextInt(s);\\n\\t\\t\\tPoint temp = get(newPos);\\n\\t\\t\\tset(newPos, get(i));\\n\\t\\t\\tset(i, temp);\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7ba80c728d289a01c2a030264a5ece02\",\n \"score\": \"0.65660274\",\n \"text\": \"private static void randMove(char[][] gameBoard, String player) {\\n Random rand = new Random();\\n int cpuPos = rand.nextInt(9) + 1;\\n while (player1Positions.contains(cpuPos) || player2Positions.contains(cpuPos)) {\\n cpuPos = rand.nextInt(9) + 1;\\n }\\n placePiece(gameBoard, cpuPos, player);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0708973c6e6a32c550824a3c3436653b\",\n \"score\": \"0.6546874\",\n \"text\": \"public void randomRotation() {\\n for (ArrayList x : this.board) {\\n for (GamePiece g : x) {\\n int rand = this.r.nextInt(4);\\n for (int i = 0; i <= rand; i++) {\\n g.clickCellRandom();\\n }\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c5cf3e6bf29b3deab4d40fcdc7dfa69c\",\n \"score\": \"0.65120953\",\n \"text\": \"public static void getRandomPieceDest()\\n\\t{\\n\\t\\tRandom randomPieceDest = new Random();\\n\\t\\trandomDest = randomPieceDest.nextInt(4) + 0;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ec24e47f1e3cb81f527a0d35eb8d8bce\",\n \"score\": \"0.6503601\",\n \"text\": \"public void randomRotate() {\\n\\t\\tint randomInt = (int) (Math.random() * 4);\\n\\t\\tfor (int i = 0; i < randomInt; i++) {\\n\\t\\t\\tboolean temp = this.getDirection()[0];\\n\\t\\t\\tnorth = this.getDirection()[1];\\n\\t\\t\\tsouth = this.getDirection()[2];\\n\\t\\t\\teast = this.getDirection()[3];\\n\\t\\t\\twest = temp;\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b4fb5993734d9f6d929a0fd12101e7d1\",\n \"score\": \"0.64837\",\n \"text\": \"public abstract void generateMaze(long seed);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6010d9e72cf453c604afc884c7f934a8\",\n \"score\": \"0.64597726\",\n \"text\": \"public void move()\\n {\\n System.out.println(\\\"[\\\" + name + \\\"]\\\");\\n\\n Random rand = new Random();\\n int[] possibleMoves = new int[]{1, 3, 5, 7};\\n int numberOfWalls = 0;\\n\\n //wherever there is a wall, the possibleMoves[index] becomes 0\\n if(tiles[playerTileId].getUp()) possibleMoves[0] = 0;\\n if(tiles[playerTileId].getDown()) possibleMoves[2] = 0;\\n if(tiles[playerTileId].getLeft()) possibleMoves[3] = 0;\\n if(tiles[playerTileId].getRight()) possibleMoves[1] = 0;\\n\\n //checks if the player can move\\n for(int i = 0; i < 4; i++)\\n {\\n if(possibleMoves[i] == 0) numberOfWalls++;\\n }\\n if(numberOfWalls == 4) System.out.println(\\\"Player \\\" + playerId + \\\" can't move!\\\");\\n\\n int randomNumber = rand.nextInt(4);\\n\\n //get random int of the possibleMoves array, that fulfills the requirements\\n while(possibleMoves[randomNumber] == 0) randomNumber = rand.nextInt(4);\\n\\n //move to the chosen direction (update the correct coordinate)\\n switch(possibleMoves[randomNumber])\\n {\\n //up\\n case 1 ->\\n {\\n y++;\\n playerTileId += board.getN();\\n }\\n //down\\n case 5 ->\\n {\\n y--;\\n playerTileId -= board.getN();\\n }\\n //left\\n case 7 ->\\n {\\n x--;\\n playerTileId -= 1;\\n }\\n //right\\n case 3 ->\\n {\\n x++;\\n playerTileId += 1;\\n }\\n }\\n \\n System.out.println(\\\"x: \\\" + x + \\\", y: \\\" + y);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bb7c3d7d3ddc7939530d333936e33cad\",\n \"score\": \"0.6458576\",\n \"text\": \"public static Point2D.Float getRandMove(float Fm){\\n Random generator = new Random();\\n generator.setSeed(121);\\n double r= (Fm*sqrt(random()));\\n double theta= (random()*2*PI);\\n double x=r*cos(theta);\\n double y=r*sin(theta);\\n return new Point2D.Float( Math.round(x * 100000f) / 100000f, Math.round(y * 100000f) / 100000f);\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"65e820a2b427d4ccab288893fb530501\",\n \"score\": \"0.6455333\",\n \"text\": \"private static int findBlackKingRandomMove(ArrayList moves) {\\n int rez = BlackMoveFinder.random.nextInt(moves.size());\\n return moves.get(rez).moveNumber;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"11b3887ca63e311759969d21d8cc451b\",\n \"score\": \"0.6412085\",\n \"text\": \"private void randMap()\\r\\n\\t{\\r\\n\\t\\tint width=tiles.length;\\r\\n\\t\\tint height=tiles[0].length;\\r\\n\\t\\tRoom hold=null;\\r\\n\\t\\tboolean spawnSet=false;\\r\\n\\t\\tfor(int x=0;x0) {\\n \\t\\t\\twEaten = true;\\n \\t\\t}\\n \\t\\t\\n \\t\\t/* checks to see if black has eaten pills */\\n \\t\\tif(b.pst[25].getNum()>0) {\\n \\t\\t\\tbEaten = true;\\n \\t\\t}\\n \\t\\t\\n \\t\\t/* self-explanatory */\\n \\t\\tif(whiteTurn) {\\n \\t\\t\\t\\n \\t\\t\\tmoveSet.clear();\\n \\t\\t\\t\\n \\t\\t\\t//to be removed\\n \\t\\t\\t\\n \\t\\t\\tSystem.out.println(\\\"\\\\t\\\\t\\\\t\\\\t\\\\t generating moves for \\\"+r1+\\\" and \\\"+r2);\\n \\t\\t\\t\\n \\t\\t\\t\\n \\t\\t\\t/* check to see if we are in last run mode */\\n \\t\\t\\tfor(int i=0; i<18; i++) {\\n \\t\\t\\t\\tif(b.pst[i].getCol()==false && b.pst[i].getNum() != 0) {\\n \\t\\t\\t\\t\\tlastCounter++;\\n \\t\\t\\t\\t}\\n \\t\\t\\t}\\n \\t\\t\\tif(lastCounter==0) {\\n \\t\\t\\t\\tlastRun = true;\\n \\t\\t\\t} \\n \\t\\t\\t\\n \\t\\t\\tif(wEaten) {\\n \\t\\t\\t\\tif(!exoume_diples) {\\n \\t\\t\\t\\t\\tir1Col = b.pst[r1-1].getCol();\\n \\t\\t\\t\\t\\tir1Num = b.pst[r1-1].getNum();\\n \\t\\t\\t\\t\\tif((ir1Col==false || ir1Num==0) || (ir1Col==true) && (ir1Num==1)) {\\n \\t\\t\\t\\t\\t\\tmoveSet.add(\\\"out.\\\"+r1);\\n \\t\\t\\t\\t\\t\\tm1Happened = true;\\n \\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\tir2Col = b.pst[r2-1].getCol();\\n \\t\\t\\t\\t\\tir2Num = b.pst[r2-1].getNum();\\n \\t\\t\\t\\t\\tif((ir2Col==false || ir2Num==0) || (ir2Col==true) && (ir2Num==1)) {\\n \\t\\t\\t\\t\\t\\tmoveSet.add(\\\"out.\\\"+r2);\\n \\t\\t\\t\\t\\t\\tm2Happened = true;\\n \\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\tif(m1Happened || m2Happened) {\\n \\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\tir1r2Col = b.pst[r1+r2-1].getCol();\\n \\t\\t\\t\\t\\t\\tir1r2Num = b.pst[r1+r2-1].getNum();\\n \\t\\t\\t\\t\\t\\tif((ir1r2Col==false || ir1r2Num==0) || (ir1r2Col==true) && (ir1r2Num==1)) {\\n \\t\\t\\t\\t\\t\\t\\tmoveSet.add(\\\"out.\\\"+(r1+r2));\\n \\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t} else if(exoume_diples) {\\n \\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\tbyte counter_diplwn = 1;\\n \\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\twhile(counter_diplwn < 5 && ((counter_diplwn*r1)-1) < 24 ) {\\n \\t\\t\\t\\t\\t\\tidubsCol = b.pst[(counter_diplwn*r1)-1].getCol();\\n \\t\\t\\t\\t\\t\\tidubsNum = b.pst[(counter_diplwn*r1)-1].getNum();\\n \\t\\t\\t\\t\\t\\tif((idubsCol==false || idubsNum==0) || (idubsCol==true) && (idubsNum==1)) {\\n \\t\\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\t\\tmoveSet.add(\\\"out.\\\"+(counter_diplwn*(r1)));\\n \\t\\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\t} else {\\n \\t\\t\\t\\t\\t\\t\\tbreak;\\n \\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\tcounter_diplwn ++ ;\\n \\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t}\\n \\t\\t\\t} else {\\n \\t\\t\\t\\t\\n \\t\\t\\t\\t/* loop that goes through every position on the board */\\n \\t\\t\\t\\tfor(int i=0; i<24; i++) {\\n \\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t/* legal moves for non-double dice rolls */\\n \\t\\t\\t\\t\\tif (!exoume_diples) {\\t\\n \\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\t/* gets the color and number of pills that exist in the current position(i) */\\n \\t\\t\\t\\t\\t\\tiCol = b.pst[i].getCol();\\n \\t\\t\\t\\t\\t\\tiNum = b.pst[i].getNum();\\n \\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\t/* if the color is white, and there are some pills in the position, continue */\\n \\t\\t\\t\\t\\t\\tif(iCol==false && iNum!=0) {\\n \\t\\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\t\\t/* if the position the first dice brings us to is within the game borders, continue */\\n \\t\\t\\t\\t\\t\\t\\tif(i+r1<24) {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\t\\t\\t/* gets the color and number of pills of the position we are trying to move to */\\n \\t\\t\\t\\t\\t\\t\\t\\tir1Col = b.pst[i+r1].getCol();\\n \\t\\t\\t\\t\\t\\t\\t\\tir1Num = b.pst[i+r1].getNum();\\n \\t\\t\\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\t\\t\\t/* checks to see if we can move there legally */\\n \\t\\t\\t\\t\\t\\t\\t\\tif((ir1Col==false || ir1Num==0) || (ir1Col==true) && (ir1Num==1)) {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t/* we print the legal moves, and also add them to moveSet */\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tmoveSet.add((i+1)+\\\".\\\"+(i+r1+1));\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t/* tells us the first dice produced a legal move */\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tm1Happened = true;\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t/* not sure if this is useful in this method */\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tif(ir1Col) {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"It will eat a black pill\\\");\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\t\\t/* if the position we are trying to move to exceeds the game borders, and we are in last run mode, continue */\\t\\n \\t\\t\\t\\t\\t\\t\\t} else if (((i+r1) >= 24) && lastRun) {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\t\\t\\t/* again, prints legal moves and adds them to the set */\\n \\t\\t\\t\\t\\t\\t\\t\\tmoveSet.add((i+1)+\\\".out\\\");\\n \\t\\t\\t\\t\\t\\t\\t\\tm1Happened = true;\\n \\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\t\\t/* same stuff for the second dice */\\n \\t\\t\\t\\t\\t\\t\\tif(i+r2<24) {\\n \\t\\t\\t\\t\\t\\t\\t\\tir2Col = b.pst[i+r2].getCol();\\n \\t\\t\\t\\t\\t\\t\\t\\tir2Num = b.pst[i+r2].getNum();\\n \\t\\t\\t\\t\\t\\t\\t\\tif((ir2Col==false || ir2Num==0) || (ir2Col==true) && (ir2Num==1)) {\\n \\t\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tmoveSet.add((i+1)+\\\".\\\"+(i+r2+1));\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tm2Happened = true;\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tif(ir2Col) {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"It will eat a black pill\\\");\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\t\\t} else if (((i+r2) >= 24) && lastRun) {\\n \\t\\n \\t\\t\\t\\t\\t\\t\\t\\tmoveSet.add((i+1)+\\\".out\\\");\\n \\t\\t\\t\\t\\t\\t\\t\\tm2Happened = true;\\n \\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\t\\t/* legal moves for the addition of both dice */\\n \\t\\t\\t\\t\\t\\t\\tif(i+r1+r2<24) {\\t\\n \\t\\t\\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\t\\t\\t/* checks if at least one of the two dice gives us a legal move in order to continue */\\n \\t\\t\\t\\t\\t\\t\\t\\tif(m1Happened || m2Happened) {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t/* same stuff as before */\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tir1r2Col = b.pst[i+r1+r2].getCol();\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tir1r2Num = b.pst[i+r1+r2].getNum();\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tif((ir1r2Col==false || ir1r2Num==0) || (ir1r2Col==true) && (ir1r2Num==1)) {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\tmoveSet.add((i+1)+\\\".\\\"+(i+r1+r2+1));\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//TODO: possibly remove this check entirely\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif(ir1r2Col) {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"It will eat a black pill\\\");\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\t\\t/* last run check for both dice */\\n \\t\\t\\t\\t\\t\\t\\t} else if(((i+r1+r2) >=24) && lastRun) {\\n \\t\\t\\t\\t\\t\\t\\t\\tif(m1Happened || m2Happened) {\\n \\t\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tmoveSet.add((i+1)+\\\".out\\\");\\n \\t\\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t/* legal moves for double dice rolls */\\n \\t\\t\\t\\t\\telse if(exoume_diples) {\\n \\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\tbyte counter_diplwn = 1;\\n \\t\\t\\t\\t\\t\\tiCol = b.pst[i].getCol() ;\\n \\t\\t\\t\\t\\t\\tiNum = b.pst[i].getNum(); \\n \\t\\t\\t\\t\\t\\tif(iCol == false && iNum != 0){\\n \\t\\t\\t\\t\\t\\t\\tif(!lastRun){\\n \\t\\t\\t\\t\\t\\t\\t\\twhile(counter_diplwn < 5 && i+counter_diplwn*r1 < 24 ) {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tidubsCol = b.pst[i+counter_diplwn*r1].getCol();\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tidubsNum = b.pst[i+counter_diplwn*r1].getNum();\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tif((idubsCol==false || idubsNum==0) || (idubsCol==true) && (idubsNum==1)) {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\tmoveSet.add((i+1)+\\\".\\\"+(i+counter_diplwn*r1+1));\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//TODO: possibly remove this check entirely\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif(idubsCol) {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"It will eat a black pill\\\");\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t} else {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tcounter_diplwn ++ ;\\n \\t\\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\t/* dubs last run mode legals */\\n \\t\\t\\t\\t\\t\\t\\t} else if(lastRun) {\\n \\t\\t\\t\\t\\t\\t\\t\\twhile(counter_diplwn < 5) {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tif(i+counter_diplwn*r1 < 24) {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\tidubsCol = b.pst[i+counter_diplwn*r1].getCol();\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\tidubsNum = b.pst[i+counter_diplwn*r1].getNum();\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif((idubsCol==false || idubsNum==0) || (idubsCol==true) && (idubsNum==1)) {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tmoveSet.add((i+1)+\\\".\\\"+(i+counter_diplwn*r1+1));\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//TODO: possibly remove this check entirely\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif(idubsCol) {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"It will eat a black pill\\\");\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\t\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t} else { break; }\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\tcounter_diplwn ++ ;\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t} else {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif(iNum>0) {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tmoveSet.add((i+1)+\\\".out\\\");\\t\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tcounter_diplwn++;\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\t\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\n \\t\\t\\t\\tm1Happened = false;\\n \\t\\t\\t\\tm2Happened = false;\\n \\t\\t\\t\\t}\\n \\t\\t\\t}\\n \\t\\tIterator it = moveSet.iterator();\\n while (it.hasNext()) {\\n System.out.println(it.next());\\n } \\n \\n \\t\\t\\n \\t\\t} else {\\n \\t\\t\\t\\n \\t\\t\\t moveSet.clear();\\n \\t\\t\\t\\n \\t\\t\\t//TODO: remove this \\n \\t\\t\\tSystem.out.println(\\\"\\\\t\\\\t\\\\t\\\\t\\\\t black rolled \\\"+r1+\\\" and \\\"+r2);\\n \\t\\t\\t\\n \\t\\t\\t/* check to see if we are in last run mode */\\n \\t\\t\\tfor(int i=23; i>6; i--) {\\n \\t\\t\\t\\tif(b.pst[i].getCol()==true && b.pst[i].getNum() != 0) {\\n \\t\\t\\t\\t\\tlastCounter++;\\n \\t\\t\\t\\t}\\n \\t\\t\\t}\\n \\t\\t\\tif(lastCounter==0) {\\n \\t\\t\\t\\tlastRun = true;\\n \\t\\t\\t}\\n \\t\\t\\t\\n \\t\\t\\tif(bEaten) {\\n \\t\\t\\t\\tif(!exoume_diples) {\\n \\t\\t\\t\\t\\tir1Col = b.pst[24-r1].getCol();\\n \\t\\t\\t\\t\\tir1Num = b.pst[24-r1].getNum();\\n \\t\\t\\t\\t\\tif((ir1Col==true || ir1Num==0) || (ir1Col==false) && (ir1Num==1)) {\\n \\t\\t\\t\\t\\t\\tmoveSet.add(\\\"out.\\\"+(24-r1+1));\\n \\t\\t\\t\\t\\t\\tm1Happened = true;\\n \\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\tir2Col = b.pst[24-r2].getCol();\\n \\t\\t\\t\\t\\tir2Num = b.pst[24-r2].getNum();\\n \\t\\t\\t\\t\\tif((ir2Col==true || ir2Num==0) || (ir2Col==false) && (ir2Num==1)) {\\n \\t\\t\\t\\t\\t\\tmoveSet.add(\\\"out.\\\"+(24-r2+1));\\n \\t\\t\\t\\t\\t\\tm2Happened = true;\\n \\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\tif(m1Happened || m2Happened) {\\n \\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\tir1r2Col = b.pst[24-(r1+r2)].getCol();\\n \\t\\t\\t\\t\\t\\tir1r2Num = b.pst[24-(r1+r2)].getNum();\\n \\t\\t\\t\\t\\t\\tif((ir1r2Col==true || ir1r2Num==0) || (ir1r2Col==false) && (ir1r2Num==1)) {\\n \\t\\t\\t\\t\\t\\t\\tmoveSet.add(\\\"out.\\\"+(24-(r1+r2+1)));\\n \\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t} else if(exoume_diples) {\\n \\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\tbyte counter_diplwn = 1;\\n \\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\twhile(counter_diplwn < 5 && (24-counter_diplwn*(r1)) >= 0 ) {\\n \\t\\t\\t\\t\\t\\tidubsCol = b.pst[24-counter_diplwn*(r1)].getCol();\\n \\t\\t\\t\\t\\t\\tidubsNum = b.pst[24-counter_diplwn*(r1)].getNum();\\n \\t\\t\\t\\t\\t\\tif((idubsCol==true || idubsNum==0) || (idubsCol==false) && (idubsNum==1)) {\\n \\t\\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\t\\tmoveSet.add(\\\"out.\\\"+(24-counter_diplwn*(r1)));\\n \\t\\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\t} else {\\n \\t\\t\\t\\t\\t\\t\\tbreak;\\n \\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\tcounter_diplwn ++ ;\\n \\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t}\\n \\t\\t\\t} else {\\n \\t\\t\\t\\t\\n \\t\\t\\t\\tfor(int i=23; i>0; i--) {\\n \\t\\t\\t\\t\\tif(!exoume_diples) {\\n \\t\\t\\t\\t\\t\\tiCol = b.pst[i].getCol();\\n \\t\\t\\t\\t\\t\\tiNum = b.pst[i].getNum();\\n \\t\\t\\t\\t\\t\\tif(iCol==true && iNum!=0) {\\n \\t\\t\\t\\t\\t\\t\\tif(i-r1>=0)\\t{\\n \\t\\t\\t\\t\\t\\t\\t\\tir1Col = b.pst[i-r1].getCol();\\n \\t\\t\\t\\t\\t\\t\\t\\tir1Num = b.pst[i-r1].getNum();\\n \\t\\t\\t\\t\\t\\t\\t\\tif((ir1Col==true || ir1Num==0) || (ir1Col==false) && (ir1Num==1)) {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tmoveSet.add((i+1)+\\\".\\\"+(i-r1+1));\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tm1Happened = true;\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tif((ir1Col==false) && (ir1Num==1)) {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"It will eat a white pill\\\");\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\t} else if (((i-r1) < 0) && lastRun) {\\n \\t\\t\\t\\t\\t\\t\\t\\tmoveSet.add((i+1)+\\\".out\\\");\\n \\t\\t\\t\\t\\t\\t\\t\\tm1Happened = true;\\n \\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\t\\tif(i-r2>=0) {\\n \\t\\t\\t\\t\\t\\t\\t\\tir2Col = b.pst[i-r2].getCol();\\n \\t\\t\\t\\t\\t\\t\\t\\tir2Num = b.pst[i-r2].getNum();\\n \\t\\t\\t\\t\\t\\t\\t\\tif((ir2Col==true || ir2Num==0) || (ir2Col==false) && (ir2Num==1)) {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tmoveSet.add((i+1)+\\\".\\\"+(i-r2+1));\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tm2Happened = true;\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tif((ir2Col==false) && (ir2Num==1)) {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"It will eat a white pill\\\");\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\t} else if (((i+r2) < 0) && lastRun) {\\n \\t\\t\\t\\t\\t\\t\\t\\tmoveSet.add((i+1)+\\\".out\\\");\\n \\t\\t\\t\\t\\t\\t\\t\\tm2Happened = true;\\n \\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\t\\tif(i-r1-r2>=0) {\\n \\t\\t\\t\\t\\t\\t\\t\\tif(m1Happened || m2Happened) {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tir1r2Col = b.pst[i-r1-r2].getCol();\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tir1r2Num = b.pst[i-r1-r2].getNum();\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tif((ir1r2Col==true || ir1r2Num==0) || (ir1r2Col==false) && (ir1r2Num==1)) {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\tmoveSet.add((i+1)+\\\".\\\"+(i-r1-r2+1));\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif((ir1r2Col==false) && (ir1r2Num==1)) {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"It will eat a white pill\\\");\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\t} else if(((i-r1-r2) < 0) && lastRun) {\\n \\t\\t\\t\\t\\t\\t\\t\\tif(m1Happened || m2Happened) {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tmoveSet.add((i+1)+\\\".out\\\");\\n \\t\\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\t}\\t\\n \\t\\t\\t\\t\\t\\t}\\t\\n \\t\\t\\t\\t\\t} \\n \\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\telse if(exoume_diples) {\\n \\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\tbyte counter_diplwn = 1;\\n \\t\\t\\t\\t\\t\\tiCol = b.pst[i].getCol() ;\\n \\t\\t\\t\\t\\t\\tiNum = b.pst[i].getNum();\\n \\t\\t\\t\\t\\t\\tif(iCol == true && iNum != 0){\\n \\t\\t\\t\\t\\t\\t\\tif(!lastRun) {\\n \\t\\t\\t\\t\\t\\t\\t\\twhile(counter_diplwn < 5 && i-counter_diplwn*r1 >= 0 ){\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tidubsCol = b.pst[i-counter_diplwn*r1].getCol();\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tidubsNum = b.pst[i-counter_diplwn*r1].getNum();\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tif((idubsCol==true || idubsNum==0) || ((idubsCol==false) && (idubsNum==1))) {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\tmoveSet.add((i+1)+\\\".\\\"+((i-counter_diplwn*r1)+1));\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif(idubsCol==false && idubsNum>0) {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"It will eat a white pill\\\");\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t} else {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tcounter_diplwn ++ ;\\n \\t\\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\t} else if(lastRun) {\\n \\t\\t\\t\\t\\t\\t\\t\\twhile(counter_diplwn < 5) {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tif(i+counter_diplwn*r1 >= 0) {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\tidubsCol = b.pst[i-counter_diplwn*r1].getCol();\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\tidubsNum = b.pst[i-counter_diplwn*r1].getNum();\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif((idubsCol==true || idubsNum==0) || ((idubsCol==false) && (idubsNum==1))) {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tmoveSet.add((i+1)+\\\".\\\"+((i-counter_diplwn*r1)+1));\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif(idubsCol==false && idubsNum>0) {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"It will eat a white pill\\\");\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t} else {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\tcounter_diplwn ++ ;\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t} else {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif(iNum>0) {\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tmoveSet.add((i+1)+\\\".out\\\");\\t\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tcounter_diplwn++;\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\t\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\n \\t\\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t}\\n \\t\\t\\t\\tm1Happened = false;\\n \\t\\t\\t\\tm2Happened = false;\\n \\t\\t\\t\\t}\\n \\t\\t\\t}\\n \\t\\tIterator it = moveSet.iterator();\\n while (it.hasNext()) {\\n System.out.println(it.next());\\n } \\n \\t\\t}\\n \\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eb36ac96ce68f08555a9895cc454f744\",\n \"score\": \"0.6376123\",\n \"text\": \"Random getRandom();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"85081f7c1eafdc9b8be2649d7895a021\",\n \"score\": \"0.63610595\",\n \"text\": \"public Direction getMove(){\\n\\t\\tint movesBeforeRepeat = 5;\\n\\t\\tint movesBeforeMoving = 1;\\n\\t\\t\\n\\t\\tmoves++;\\n\\t\\tRandomGenerator rando = new RandomGenerator();\\n\\t\\tif(moves > movesBeforeRepeat){\\n\\t\\t\\tmoves = 1;\\n\\t\\t}\\n\\t\\tif(moves == movesBeforeMoving){\\n\\t\\t\\tdirection = rando.nextInt(1,4);\\n\\t\\t}\\n\\t\\tif(direction == 1)return Direction.NORTH;\\n\\t\\telse if(direction == 2)return Direction.EAST;\\n\\t\\telse if(direction == 3)return Direction.SOUTH;\\n\\t\\treturn Direction.WEST;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6ca82724b41684bea6d83f0b2bd58a56\",\n \"score\": \"0.63588184\",\n \"text\": \"public void aleatorio() {\\n\\t\\tRandom rand = new Random();\\n\\t crescente();\\t\\n\\t\\tfor (int i = 0; i < n; i++) {\\n swap(i, Math.abs(rand.nextInt()) % n);\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d6af4dea87bbfeec09d96cf31811da1\",\n \"score\": \"0.63568985\",\n \"text\": \"public void walkForward() {\\n int movement = random.nextInt(5) + 1;\\n System.out.println(\\\"Enemy Robot walks forward \\\" + movement + \\\" distance.\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c6ee1a0e23afc88d0377924ce318f939\",\n \"score\": \"0.6341056\",\n \"text\": \"@Override\\n\\tpublic void doTimeStep() {\\n\\t\\tmoved = false; \\n\\t\\tif (Critter.getRandomInt(100) % 6 == 0){\\n\\t\\t\\tCritter2 kid = new Critter2(); \\n\\t\\t\\treproduce(kid, Critter.getRandomInt(8)); \\n\\t\\t}\\n\\t\\telse if (Critter.getRandomInt(100) % 2 == 0){\\n\\t\\t\\twalk(direction); \\n\\t\\t\\tmoved = true; \\n\\t\\t\\tnumSteps1++; \\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\trun(direction); \\n\\t\\t\\tmoved = true; \\n\\t\\t\\tnumSteps1 = numSteps1 + 2; \\n\\t\\t}\\n\\t\\t\\n\\t\\tdirection = getEnergy() * Critter.getRandomInt(8) % 8; \\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ead666a2b556859893eede69fad9cb09\",\n \"score\": \"0.633832\",\n \"text\": \"private int move() {\\n // just move randomly for now\\n // int myMove = generator.nextInt(numValidMoves);\\n\\n minimax(state, round, true, 0, Integer.MIN_VALUE, Integer.MAX_VALUE);\\n \\n return choice;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3f7afbecd82dd4df478c1356ed898644\",\n \"score\": \"0.6332662\",\n \"text\": \"@Override\\n public void makeMove(Model model) {\\n ArrayList list = getFreeCells(model);\\n Integer result = list.get(new Random().nextInt(list.size()));\\n model.setSecondMove(result / 3, result % 3);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a5cf4a8fecb13de51ecb3e0dd1d2839\",\n \"score\": \"0.6330532\",\n \"text\": \"public int randomMove() {\\n\\t\\tint i = r.nextInt(myGame.getColumnCount());\\n\\t\\twhile (getLowestEmptyIndex(myGame.getColumn(i)) == -1) {\\n\\t\\t\\ti = r.nextInt(myGame.getColumnCount());\\n\\t\\t}\\n\\t\\treturn i;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"03a0b6fc074aab6ba395fa6f98fe25cf\",\n \"score\": \"0.632792\",\n \"text\": \"public void moveRandomly() {\\n\\t\\tint randStep = Warehouse.getRandomStep();\\n\\t\\tif(logger != null) {\\n\\t\\t\\tlogger.finest(\\\"random step for x direction is \\\" + randStep); \\n\\t\\t}\\n\\t\\tint xadd = randStep;\\n\\t\\tint yadd = Warehouse.getRandomStep();\\n\\t\\tint newx = xadd + workerInfo.location.x;\\n\\t\\tif (newx < 0) {\\n\\t\\t\\tnewx=0;\\n\\t\\t} \\n\\t\\tif (newx > Warehouse.warehouseWidth) {\\n\\t\\t\\tnewx = Warehouse.warehouseWidth;\\n\\t\\t}\\n\\t\\t\\n\\t\\tint newy = yadd + workerInfo.location.y;\\n\\t\\tif (newy < 0) {\\n\\t\\t\\tnewy=0;\\n\\t\\t} \\n\\t\\tif (newy > Warehouse.warehouseHeight) {\\n\\t\\t\\tnewy = Warehouse.warehouseHeight;\\n\\t\\t}\\t\\t\\t\\n\\t\\tworkerInfo.setLocation(new Point(newx,newy));\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"504c1829725b788ae3b3e94a1f865cc6\",\n \"score\": \"0.6326126\",\n \"text\": \"@Override\\n public void doTimeStep() {\\n walk(getRandomInt(8));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"19d1867a1e330f46a95bc449000d9c42\",\n \"score\": \"0.6312571\",\n \"text\": \"public String randomDirection(){\\n ArrayList direction = new ArrayList<>();\\n Random randomGen = new Random();\\n direction.add(\\\"north\\\");\\n direction.add(\\\"east\\\");\\n direction.add(\\\"south\\\");\\n direction.add(\\\"west\\\");\\n return(direction.get(randomGen.nextInt(direction.size())));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"92fef0285d70234ddaddf223c90fde16\",\n \"score\": \"0.6305634\",\n \"text\": \"private static void getRandomJumpSource()\\n\\t{\\n\\t\\tRandom randomJumpSource = new Random();\\n\\t\\trandomJump = computerJumps.get(randomJumpSource.nextInt(computerJumps.size()));\\n\\t\\trandomSourceX = Integer.parseInt(randomJump.substring(0,1));\\n\\t\\trandomSourceY = Integer.parseInt(randomJump.substring(1,2));\\n\\t\\tMove.originX = randomSourceX;\\n\\t\\tMove.originY = randomSourceY;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2baec3137fa384a7465b91cfb34d4219\",\n \"score\": \"0.63003445\",\n \"text\": \"private ArrayList generateRandomRoute() {\\r\\n\\t\\tArrayList cities = new ArrayList();\\r\\n\\t\\tfor(int i=0; i= height)movY = random(-4, -2);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e4ec580b98f92510b2aaa039cf3bd91a\",\n \"score\": \"0.6293133\",\n \"text\": \"public void generateRandomPosition() {\\n float[] rotationMatrix = new float[16];\\n float[] posVec = new float[4];\\n\\n // Matrix.setRotateM takes the angle in degrees, but Math.tan takes the angle in radians, so\\n // yaw is in degrees and pitch is in radians.\\n float yawDegrees = (random.nextFloat() - 0.5f) * 2.0f * MAX_YAW;\\n float pitchRadians = (float) Math.toRadians((random.nextFloat() - 0.5f) * 2.0f * MAX_PITCH);\\n\\n // Creates a matrix for rotation by angle yawDegrees around the y axis.\\n Matrix.setRotateM(rotationMatrix, 0, yawDegrees, 0.0f, 1.0f, 0.0f);\\n\\n // Calculates a new random position.\\n float targetDistance = random.nextFloat() * (MAX_TARGET_DISTANCE - MIN_TARGET_DISTANCE) + MIN_TARGET_DISTANCE;\\n\\n Position temp;\\n // Allows to randomly generate objects with a negative z coordinate.\\n if (random.nextBoolean())\\n temp = new Position(0, 0, -targetDistance);\\n else\\n temp = new Position(0, 0, targetDistance);\\n\\n Matrix.multiplyMV(posVec, 0, rotationMatrix, 0, temp.getModel(), 12);\\n setPosition(posVec[0], (float) Math.tan(pitchRadians) * temp.getZCoordinate(), posVec[2]);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0074bee779ef3bcc34e0da9b492c54f3\",\n \"score\": \"0.6286733\",\n \"text\": \"public ArrayList generateMoves(Player player) {\\n int playerNumber = player.getPlayerNumber();\\n ArrayList moveList = new ArrayList<>();\\n\\n for (int i = 0; i < board.length; i++) {\\n if (isValidMove(playerNumber, i)) {\\n Move move = new Move(i);\\n if (CORNERS.contains(move.getMove())) {\\n move.setValue(500);\\n } else if (AMOVES.contains(move.getMove())) {\\n move.setValue(250);\\n } else if (BMOVES.contains(move.getMove())) {\\n move.setValue(100);\\n } else if (CMOVES.contains(move.getMove())) {\\n move.setValue(50);\\n } else\\n move.setValue(-5);\\n\\n moveList.add(move);\\n }\\n }\\n\\n //in case of no moves, add pass move\\n if (moveList.size() > 0) {\\n Collections.sort(moveList, new MoveComparator());\\n Collections.reverse(moveList);\\n } else {\\n String pass = \\\"\\\" + player.getPlayerColor();\\n Move move = new Move(pass);\\n moveList.add(move);\\n }\\n\\n player.assignPossibleMoves(moveList);\\n return moveList;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e25b30f0e9235ef3cd4d129a32f9a859\",\n \"score\": \"0.62672293\",\n \"text\": \"public static Position generateRandomDelta() {\\n Random r = new Random();\\n int newX = (int) (Math.random() * 20) - 10;\\n int newY = (int) (Math.random() * 20) - 10;\\n\\n return new Position(newX, newY);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"713fda496778192d4086f1e55575f158\",\n \"score\": \"0.6236649\",\n \"text\": \"private int randomGen () {\\n\\t\\tRandom random = new Random();\\n\\t\\treturn random.nextInt(9);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d21f1dba58b7ae92f370984101fe389\",\n \"score\": \"0.62351847\",\n \"text\": \"public void moveToRandomLocation ()\\n {\\n if (grid != null)\\n {\\n ArrayList l = grid.getEmptyLocations ();\\n int x = (int)(Math.random () * l.size());\\n setLoc (l.get(x));\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2140fb6148394bd1afefdba66313c8e7\",\n \"score\": \"0.623379\",\n \"text\": \"private Position makeMove(final Position position) {\\n\\t\\tboolean moveMade = false;\\n\\t\\tfinal int x = position.getXPosition();\\n\\t\\tfinal int y = position.getYPosition();\\n\\t\\tPosition newPosition = position;\\n\\n\\t\\t// Choose a random direction to attempt to travel in.\\n\\t\\tint testDirection = (int) (Math.random() * 4);\\n\\n\\t\\t/*\\n\\t\\t * While a move has not been made, choose a random direction to attempt to move\\n\\t\\t * in. First check if that direction is valid, then check if the adjacent cell\\n\\t\\t * in that direction has NOT been visited. If not, move into it. Otherwise, try\\n\\t\\t * another random direction.\\n\\t\\t */\\n\\t\\twhile (!moveMade) {\\n\\t\\t\\tif (testDirection == 0) {\\n\\t\\t\\t\\tif (y > 0 && !finalState[x][y - 1].getIsVisited()) {\\n\\t\\t\\t\\t\\tnewPosition = new Position(x, y - 1);\\n\\t\\t\\t\\t\\tmoveNorth(x, y);\\n\\t\\t\\t\\t\\tmoveMade = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else if (testDirection == 1) {\\n\\t\\t\\t\\tif (x < size - 1 && !finalState[x + 1][y].getIsVisited()) {\\n\\t\\t\\t\\t\\tnewPosition = new Position(x + 1, y);\\n\\t\\t\\t\\t\\tmoveEast(x, y);\\n\\t\\t\\t\\t\\tmoveMade = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else if (testDirection == 2) {\\n\\t\\t\\t\\tif (y < size - 1 && !finalState[x][y + 1].getIsVisited()) {\\n\\t\\t\\t\\t\\tnewPosition = new Position(x, y + 1);\\n\\t\\t\\t\\t\\tmoveSouth(x, y);\\n\\t\\t\\t\\t\\tmoveMade = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else if (testDirection == 3) {\\n\\t\\t\\t\\tif (x > 0 && !finalState[x - 1][y].getIsVisited()) {\\n\\t\\t\\t\\t\\tnewPosition = new Position(x - 1, y);\\n\\t\\t\\t\\t\\tmoveWest(x, y);\\n\\t\\t\\t\\t\\tmoveMade = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\ttestDirection = (int) (Math.random() * 4);\\n\\t\\t}\\n\\t\\treturn newPosition;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7e0f03918200c15f357e0872f829e242\",\n \"score\": \"0.62325776\",\n \"text\": \"public void randomizePuzzle() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a04fbcaa8cc22fcba1e02b7aba73792e\",\n \"score\": \"0.6228398\",\n \"text\": \"void machineTurn() {\\n /**\\n * checking if a spot is empty so the machine doesn't take a spot that's already taken\\n */\\n\\n // Don't know if the move is random or not.\\n wasLastMachineMoveRandom = false;\\n\\n // Win if you can\\n if (playToWinOrBlock(\\\"X\\\")) {\\n return;\\n }\\n\\n // Block if you can\\n if (playToWinOrBlock(\\\"O\\\")) {\\n return;\\n }\\n\\n int machineRow;\\n int machineCol;\\n\\n /**\\n * creating the list of moves the computer can chose from\\n */\\n int[][] emptyMoves = new int[9][2];\\n\\n\\n /**\\n * setting the counter to 0\\n */\\n int counter = 0;\\n\\n // Randonmly pick a square\\n for (int i = 0; i < _placeholders.length; i++) {\\n /**\\n * going through I and J to check all values\\n */\\n for (int j = 0; j < _placeholders.length; j++) {\\n /**\\n * checks if they're empty\\n */\\n if (_placeholders[i][j].getPlayerToken() == BLANK) {\\n /**\\n * if they're empty sets it as a value to be able to be taken by the random picker\\n */\\n emptyMoves[counter][0] = i;\\n emptyMoves[counter][1] = j;\\n /**\\n * counter to know where put the empty column and row position\\n */\\n counter = counter + 1;\\n }\\n }\\n }\\n /**\\n * picks a random empty spot to place an X\\n */\\n int randomNumber = _rand.nextInt(counter);\\n wasLastMachineMoveRandom = true;\\n /**\\n * sets the empty row value for the machines move\\n */\\n machineRow = emptyMoves[randomNumber][0];\\n /**\\n * sets the empty column value for the machines move\\n */\\n machineCol = emptyMoves[randomNumber][1];\\n\\n /**\\n * adds the X to the board\\n */\\n _placeholders[machineRow][machineCol].setPlayerToken(\\\"X\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c99d77564d981bc8b0b5dc8e20b1afff\",\n \"score\": \"0.62239945\",\n \"text\": \"public void generate() {\\n List visited = new ArrayList<>();\\n //paths available to choose\\n List toVisit = new ArrayList<>();\\n\\n //this is where it starts\\n visited.add(0);\\n //initial paths that are possible to perform\\n toVisit.add(new Vector2I(0, 1));\\n //width here because it is 2d array represented as 1d array, so the width is actually just moving to row 1;\\n toVisit.add(new Vector2I(0, WIDTH));\\n\\n while (toVisit.size() > 0) {\\n int randomIndex = rand.nextInt(toVisit.size());\\n Vector2I nextPath = toVisit.remove(randomIndex);\\n\\n //check if the tile was visited before (this will help avoid circle)\\n if (visited.contains(nextPath.end))\\n continue;\\n\\n //ensure the path goes from up to bottom and from left to right\\n if (nextPath.start > nextPath.end)\\n maze.add(new Vector2I(nextPath.end, nextPath.start));\\n else\\n maze.add(nextPath);\\n\\n visited.add(nextPath.end);\\n\\n int above = nextPath.end - WIDTH;\\n if (above > 0 && !visited.contains(above))\\n toVisit.add(new Vector2I(nextPath.end, above));\\n\\n //module here to check if we are not off the maze, this is 1d array, so it will go to previous row actually\\n int left = nextPath.end - 1;\\n if (left % WIDTH != WIDTH - 1 && !visited.contains(left))\\n toVisit.add(new Vector2I(nextPath.end, left));\\n\\n int right = nextPath.end + 1;\\n if (right % WIDTH != 0 && !visited.contains(right))\\n toVisit.add(new Vector2I(nextPath.end, right));\\n\\n //width*heigth is the last index +1\\n int below = nextPath.end + WIDTH;\\n if (below < WIDTH * HEIGHT && !visited.contains(below))\\n toVisit.add(new Vector2I(nextPath.end, below));\\n }\\n transformToMatrix();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f5792a1e0841dfc6bbad2278c60e9923\",\n \"score\": \"0.621878\",\n \"text\": \"private Cell randomStepZ(Cell pos) {\\n ArrayList steps = getCells(pos, 0);\\n if (steps.size() == 0) return null;\\n steps.add(0);\\n int stepDir = random.nextInt(steps.size());\\n steps.forEach(System.out::print);\\n System.out.println(\\\"->\\\" + steps.get(stepDir));\\n if (steps.get(stepDir) == 0) return null;\\n return pos.and(new Cell(steps.get(stepDir)));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8d05a15706d3b74f1174d9ec3eab1914\",\n \"score\": \"0.6206174\",\n \"text\": \"public synchronized int RandomChoice(){\\n long seed = System.nanoTime();\\n Collections.shuffle(choices, new Random(seed));\\n int valueOfMove=choices.get(0);\\n choices.remove(0);\\n return valueOfMove;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9bf2d88145dd0aeb93efac132220ebe2\",\n \"score\": \"0.6202777\",\n \"text\": \"private void generateNewRandom() {\\r\\n \\t\\tfloat newRandom;\\r\\n \\t\\tdo {\\r\\n \\t\\t\\tnewRandom = Simulation.random.nextFloat();\\r\\n \\t\\t} while (this.random == newRandom);\\r\\n \\t\\tthis.random = newRandom;\\r\\n \\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e84a4d3b2e610b9b7ac5e7a3626de800\",\n \"score\": \"0.6197327\",\n \"text\": \"private List getRandomizedAvailablePositions() {\\r\\n\\t\\tList positions = new LinkedList();\\r\\n\\t\\tfor (int i = 0; i < width; i++) {\\r\\n\\t\\t\\tfor (int j = 0; j < height; j++) {\\r\\n\\t\\t\\t\\tif (board[i][j] == null) {\\r\\n\\t\\t\\t\\t\\tpositions.add(new Point(i, j));\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\tCollections.shuffle(positions);\\r\\n\\t\\treturn positions;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b76e26de652ab2e6aed89ee514f52995\",\n \"score\": \"0.61966103\",\n \"text\": \"public void addRandomTile() {\\n int count = 0;\\n\\n for(int i = 0; i < GRID_SIZE; i++){\\n for(int j = 0; j < GRID_SIZE; j++){\\n if(this.grid[i][j] == 0){\\n // need to keep track of 0 locations, but can't use\\n // regular numbers (1,2,3) as labels.\\n // so flip 0's to negative number (-1, -2, -3 ...) and identify them\\n // later when setting random location\\n this.grid[i][j] = -count;\\n count++;\\n }\\n }\\n }\\n\\n // no open spot - exit\\n if(count == 0){\\n return;\\n }\\n\\n int location = random.nextInt(count);\\n // flip location value also bc the 0 locations are labeled with\\n // negative numbers\\n location = -location;\\n int value = random.nextInt(100);\\n\\n // flipped - go down the row first\\n for(int k = 0; k < GRID_SIZE; k++){\\n for(int l = 0; l < GRID_SIZE; l++){ //\\n if(this.grid[l][k] == location){\\n if(value < TWO_PROBABILITY){\\n this.grid[l][k] = 2;\\n }else{\\n this.grid[l][k] = 4;\\n }\\n }\\n }\\n }\\n\\n // change the negative numbers back to zero\\n // to restore original values\\n for(int row = 0; row < GRID_SIZE; row++){\\n for(int col = 0; col < GRID_SIZE; col++){\\n if(this.grid[row][col] < 0)\\n this.grid[row][col] = 0;\\n }\\n } \\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c664e20347292e025b8510e2ca80acc\",\n \"score\": \"0.6179007\",\n \"text\": \"public static void randomMove(MovableObject objectToMove){\\r\\n\\t\\tint direction = generateRandomNumberWithinSpan(1, 4);\\r\\n\\t\\tobjectToMove.move(direction);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a23c6cb5e7d40d009434aa6ce8dc72d8\",\n \"score\": \"0.6159203\",\n \"text\": \"public Tile populateBoard() {\\n\\t\\t// Using a compass rose to define directions\\n\\t\\t// N is 0\\n\\t\\t// E is 1\\n\\t\\t// S is 2\\n\\t\\t// W is 3\\n\\n\\t\\tplaceFixedTiles();\\n\\n\\t\\t// these variables hold the amount of tiles left over\\n\\t\\tint _twoDirectionLeft = 14;\\n\\t\\tint _oppositeDirectionLeft = 13;\\n\\t\\tint _threeDirectionLeft = 7;\\n\\n\\t\\t//3 types of tile and corresponding code\\n\\t\\tint _twoDir = 0;\\n\\t\\tint _oppDir = 1;\\n\\t\\tint _threeDir = 2;\\n\\t\\t\\n\\t\\t//current index points to next tile to add\\n\\t\\tint currIndex = 0;\\n\\t\\t\\n\\t\\tint[] randomSequence = getRandomsequence(_twoDir, _twoDirectionLeft, _oppDir, _oppositeDirectionLeft, _threeDir, _threeDirectionLeft);\\n\\t\\t\\n\\t\\t// fills every (empty) place in the array with a different, randomized\\n\\t\\t// tile\\n\\t\\tfor (int i = 0; i < length; i++) {\\n\\t\\t\\tfor (int j = 0; j < length; j++) {\\n\\n\\t\\t\\t\\tif (_gameBoard[i][j] == null) {\\n\\n\\t\\t\\t\\t\\t// System.out.println(\\\"2\\\");\\n\\t\\t\\t\\t\\t// generates an array of ints that are unique so they can be\\n\\t\\t\\t\\t\\t// used to set the directions\\n\\t\\t\\t\\t\\tint[] XYZ = generateXuniqueNumber(3, 4);\\n\\n\\t\\t\\t\\t\\tint x = XYZ[0];\\n\\t\\t\\t\\t\\tint y = XYZ[1];\\n\\t\\t\\t\\t\\tint z = XYZ[2];\\n\\n\\t\\t\\t\\t\\t// while there is an empty place in the gameBoard, make a\\n\\t\\t\\t\\t\\t// random tile, check if that tile is free to be used, and\\n\\t\\t\\t\\t\\t// fill the spot in the array\\n\\n\\t\\t\\t\\t\\tif (randomSequence[currIndex] == _twoDir) {\\n\\n\\t\\t\\t\\t\\t\\t// the current object is assigned the value of a\\n\\t\\t\\t\\t\\t\\t// randomized twoDirectionTile\\n\\t\\t\\t\\t\\t\\tthis.assigntile(i, j, new TwoDirectionTile(x));\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t} else if (randomSequence[currIndex] == _oppDir) {\\n\\n\\t\\t\\t\\t\\t\\t// the current object is assigned the value of a\\n\\t\\t\\t\\t\\t\\t// randomized OppositeDirectionTile\\n\\t\\t\\t\\t\\t\\tthis.assigntile(i, j, new OppositeDirectionTile(x));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if (randomSequence[currIndex] == _threeDir) {\\n\\n\\t\\t\\t\\t\\t\\t// the current object is assigned the value of a\\n\\t\\t\\t\\t\\t\\t// randomized ThreeDirectionTile\\n\\t\\t\\t\\t\\t\\tthis.assigntile(i, j, new ThreeDirectionTile(x, y, z));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tcurrIndex++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t// This free tile will be passed off to the player to begin the game\\n\\t\\tif (_twoDirectionLeft == 1) {\\n\\n\\t\\t\\t_freetile = new TwoDirectionTile(0);\\n\\t\\t} else if (_oppositeDirectionLeft == 1) {\\n\\n\\t\\t\\t_freetile = new OppositeDirectionTile(0);\\n\\t\\t} else if (_threeDirectionLeft == 1) {\\n\\n\\t\\t\\t_freetile = new ThreeDirectionTile(0, 1, 2);\\n\\t\\t}\\n\\t\\t// resets the tiles locations\\n\\t\\tfor (int i = 0; i < _gameBoard.length; i++) {\\n\\t\\t\\tfor (int j = 0; j < _gameBoard.length; j++) {\\n\\t\\t\\t\\t_gameBoard[i][j].setCoordinates(i, j);\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t//set Token on the Board\\n\\t\\taddTokensToBoard();\\n\\t\\t\\n\\t\\treturn _freetile;\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c70633ee7bf0c67dea9738e972a20b82\",\n \"score\": \"0.615484\",\n \"text\": \"public void shuffle() {\\n int n = md.nbTiles;\\n\\n while (n > 1) {\\n int r = RANDOM.nextInt(n--);\\n int tmp = md.tiles[r];\\n md.tiles[r] = md.tiles[n];\\n md.tiles[n] = tmp;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7d9b000fa90872d666869032a7c7b43a\",\n \"score\": \"0.6149972\",\n \"text\": \"private int makeBogoMove(BoardMechanics bm) {\\r\\n\\t\\tint move = (int) Math.round(Math.random()* 6);\\r\\n\\t\\twhile (bm.getBoard().get(0).get(move).getValue() != 0) move = (int) Math.round(Math.random()* 6);\\r\\n\\t\\treturn move;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2f2b2c1d484d7464298cc50ee4ae6956\",\n \"score\": \"0.6149641\",\n \"text\": \"public Maze generate(int row, int column);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c15099eeba419f9e1fb130f5a850754f\",\n \"score\": \"0.6119761\",\n \"text\": \"public void generateBoard()\\n {\\n System.out.println(\\\"generate maze\\\");\\n setSizeOfMaze();\\n\\n System.out.println(width);\\n System.out.println(height);\\n\\n System.out.println(\\\"fill maze\\\");\\n fillMaze(); // fill up the maze and prints maze , maze get full of blank space \\\" \\\" empty\\\".\\n\\n\\n\\n System.out.println(\\\"make rand start pos\\\");\\n //makeStartPositionForPathbuilding();\\n System.out.println(\\\"Print start position\\\");\\n //printMaze();\\n //System.out.println(\\\"find RandDirection :\\\" + randomDirection);\\n\\n\\n //ChoosePathAndBuild();// chose a path randomly and try to make a path.\\n printMaze();\\n //makeEntranceInBorder();\\n //makeExitInBorder();\\n //insertMinotaur();\\n\\n\\n System.out.println(\\\"END*******************************************************************************\\\");\\n\\n printMaze();\\n //Minotaur minotaur = new Minotaur(maze,startMinotaurRow,startMinotaurColumn);\\n //Gui gui= new Gui(game,minotaur,maze,totalHeight,totalWidth,startMinotaurRow,startMinotaurColumn);\\n //minotaur.passInstance(gui);\\n //gui.passInstance(game);\\n //gui.createFrame();\\n\\n\\n // solve the maze:\\n\\n //SolveMaze solveMaze = new SolveMaze(maze,randomRowForEntrance);\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d249f31f1d85011315ff3e0dca07aa27\",\n \"score\": \"0.6117085\",\n \"text\": \"public int getRandom();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"baffbaef73812622911e89ee740b580b\",\n \"score\": \"0.61139214\",\n \"text\": \"public static int getRandomUtility(State state, int agentColor) {\\n int whitescore = 0;\\n int blackscore = 0;\\n Random random = new Random();\\n int x = random.nextInt(900) + 100;\\n for (int i = 0; i < state.m_boardSize; i++) {\\n for (int j = 0; j < state.m_boardSize; j++) {\\n if (state.m_board[i][j] != Utils.empty) {\\n if (state.m_board[i][j] >= Utils.wPawn && state.m_board[i][j] <= Utils.wKing) { //if the piece in that position is white\\n if (state.m_board[i][j] == Utils.wPawn) {\\n whitescore += random.nextInt(900) + 100;\\n }\\n if (state.m_board[i][j] == Utils.wRook) {\\n whitescore += random.nextInt(900) + 100;\\n }\\n if (state.m_board[i][j] == Utils.wBishop) {\\n whitescore += random.nextInt(900) + 100;\\n }\\n if (state.m_board[i][j] == Utils.wKnight) {\\n whitescore += random.nextInt(900) + 100;\\n }\\n if (state.m_board[i][j] == Utils.wQueen) {\\n whitescore += random.nextInt(900) + 100;\\n }\\n if (state.m_board[i][j] == Utils.wKing) {\\n whitescore += random.nextInt(900) + 100;\\n }\\n } else { //if piece is black\\n if (state.m_board[i][j] == Utils.bPawn) {\\n blackscore += random.nextInt(900) + 100;\\n }\\n if (state.m_board[i][j] == Utils.bRook) {\\n blackscore += random.nextInt(900) + 100;\\n }\\n if (state.m_board[i][j] == Utils.bBishop) {\\n blackscore += random.nextInt(900) + 100;\\n }\\n if (state.m_board[i][j] == Utils.bKnight) {\\n blackscore += random.nextInt(900) + 100;\\n }\\n if (state.m_board[i][j] == Utils.bQueen) {\\n blackscore += random.nextInt(900) + 100;\\n }\\n if (state.m_board[i][j] == Utils.bKing) {\\n blackscore += random.nextInt(900) + 100;;\\n }\\n }\\n }\\n }\\n }\\n if(agentColor == 0){\\n return whitescore-blackscore;\\n }else{\\n return blackscore-whitescore;\\n }\\n \\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7777c84df1642a72285249390095cbe7\",\n \"score\": \"0.6105925\",\n \"text\": \"public int getNextRandomDirection() {\\r\\n\\t\\tboolean emptyTile[] = getEmptyTile();\\r\\n\\t\\tboolean find = false;\\r\\n\\t\\tint temp = -1;\\r\\n\\r\\n\\t\\twhile(!find) {\\r\\n\\t\\t\\ttemp = random.nextInt(4);\\r\\n\\t\\t\\tif (emptyTile[temp]) {\\r\\n\\t\\t\\t\\tif (findNextDirection == temp) {\\r\\n\\t\\t\\t\\t\\tfindNextDirection = -1;\\r\\n\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\tfind = true;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\tfindNextDirection = temp;\\r\\n\\t\\treturn temp;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6b732c6ce78c53c0bd7f068ef754cf29\",\n \"score\": \"0.6101131\",\n \"text\": \"public void generateRandom() {\\n Random rgen = new Random();\\n \\n //1D array of ints 1 to n*n\\n int[] nvalues = new int[(n*n)];\\n for (int i=0; i adjList = new RandomList<>();\\n\\n adjList.add(randCell);\\n\\n // While we have stuff in the adjacency list\\n while (!adjList.isEmpty()) {\\n // Get a random cell and remove it\\n MazeCell cell = adjList.popRandom();\\n\\n // TODO: THIS IS HOW I FIXED IT\\n // If this cell has already been visited, ignore it\\n if (cell.isVisited()) {\\n continue;\\n }\\n\\n // Visit the cell\\n cell.visit();\\n\\n // Get its neighboring/adjacent cells\\n ArrayList neighbors = getNeighbors(cell);\\n\\n // Randomly go through the list of neighbors until you find one that is already visited\\n Iterator iter = new RandomListIterator<>(neighbors);\\n while (iter.hasNext()) {\\n MazeCell adjCell = iter.next();\\n\\n // Then, remove the wall between the current cell and its already visited neighbor\\n if (adjCell.isVisited()) {\\n removeWall(cell, adjCell);\\n break;\\n }\\n }\\n\\n // Add the neighboring cells that haven't been visited to the adjacency list\\n for (MazeCell adjCell : neighbors) {\\n if (!adjCell.isVisited()) {\\n adjList.add(adjCell);\\n }\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8e593b62700219dab9d2e2a2e522ffe0\",\n \"score\": \"0.6071582\",\n \"text\": \"public int rand() {\\n if (n == 0) {\\n return addd;\\n }\\n\\n int x = random();\\n\\n // undo transformations\\n return x * fak + addd;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"02e612cfe086716bd4ca9c797ab07d20\",\n \"score\": \"0.60690767\",\n \"text\": \"private Move generateMove(ArrayList moves) {\\n\\t\\tMove m = null;\\n\\t\\t\\n\\t\\tboolean valid = false;\\n\\t\\t\\n\\t\\tif(moves.size() == 0) return getRandomMove(); //the first move can be anything\\n\\t\\twhile(!valid) {\\n\\t\\t\\tm = getRandomMove();\\n\\t\\t\\t\\n\\t\\t\\t//check whether the previous move is the same face\\n\\t\\t\\tif(moves.get(moves.size() - 1).getFace() == m.getFace()) continue;\\n\\t\\t\\t\\n\\t\\t\\t//now check whether a move since the last time this move was made has \\\"moved\\\" this move's face\\n\\t\\t\\telse {\\n\\t\\t\\t\\tvalid = true; //this will become false if the loop finds something\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t//loop through and find the last move that involved\\n\\t\\t\\t\\tfor(int i = moves.size()-1; i >= 0; i--) {\\n\\t\\t\\t\\t\\t//if you find a face that's the same, the move isn't valid\\n\\t\\t\\t\\t\\tif(moves.get(i).getFace() == m.getFace()) {\\n\\t\\t\\t\\t\\t\\tvalid = false;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t//if the face opposite of the current face is moved,\\n\\t\\t\\t\\t\\t//the current face isn't changed, so keep searching back\\n\\t\\t\\t\\t\\telse if(moves.get(i).getFace() == m.getFace().opposite()) continue;\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t//otherwise, a move is found that mutates\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tvalid = true;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t//if the loop reaches the first element of the input,\\n\\t\\t\\t\\t//then it will return valid as true, which is fine\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn m;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a77f2f01b0a4cfd49215f6dca89a04cf\",\n \"score\": \"0.6068118\",\n \"text\": \"private int[] generateMoves(final GameStateModule state)\\n {\\n int i;\\n int[] moves = new int[state.getWidth()]; //maybe this should be Integer instead of int?\\n\\n for(i = 0; i < state.getWidth(); ++i)\\n {\\n if(state.canMakeMove(i))\\n {\\n moves[i] = i; //can play column i\\n }\\n else\\n {\\n moves[i] = -1; //mark move as invalid.\\n }\\n }\\n\\n return moves;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a3a988bb2da7577b7ea4f0d8bc643242\",\n \"score\": \"0.6066196\",\n \"text\": \"@Override\\r\\n\\tpublic int move(Scanner scanner) {\\r\\n\\t\\t// TODO Auto-generated method stub\\r\\n\\t\\tint cell;\\r\\n\\t\\t\\r\\n\\t\\tdo {\\r\\n\\t\\t\\tcell = (int)(Math.random()*10);\\r\\n\\t\\t} while (!validateMove(cell));\\r\\n\\t\\t\\r\\n\\t\\treturn cell;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5e024ea8893561f6a5df0f538ff0ca8d\",\n \"score\": \"0.6065701\",\n \"text\": \"@Override\\n public void update()\\n {\\n int randomPiece = random.nextInt( Assets.pieces.length );\\n player = Assets.pieces[ randomPiece ];\\n\\n // set random rotation\\n int randomRoation = random.nextInt( player.getCoordCount() );\\n for( int i = 0; i < randomRoation; i++ )\\n {\\n player.rotateLeft();\\n }\\n\\n // try to spawn at random position\\n boolean gameOver = !generateSpawnPosition();\\n\\n if( gameOver )\\n currentState = loosingState;\\n else\\n currentState = fallingState;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0532b170c0598e2aa531be88e7b3011d\",\n \"score\": \"0.6061759\",\n \"text\": \"public abstract SkeletonInterpolator randomWalk();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"90bb8286212899f811f234686785fcf0\",\n \"score\": \"0.60590875\",\n \"text\": \"@Override\\r\\n\\tpublic void swim() {\\r\\n\\t\\tdouble move = Math.random() * MOVEMENT_PER_SWIM * 2 - MOVEMENT_PER_SWIM;\\r\\n\\t\\tplaceCrab(this.x + move, this.y);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"017fb6ea1adcd7065e542cdf981a52d1\",\n \"score\": \"0.6054801\",\n \"text\": \"public void takeStep() {\\r\\n\\t\\tint randNum = generator.nextInt(NUM_DIRECTIONS);\\r\\n\\t\\tswitch (randNum) {\\r\\n\\t\\t\\tcase EAST: this.curLoc = this.curLoc.translate(this.theStepSize, 0); break;\\r\\n\\t\\t\\tcase NORTH: this.curLoc = this.curLoc.translate(0, this.theStepSize); break;\\r\\n\\t\\t\\tcase WEST: this.curLoc = this.curLoc.translate(-this.theStepSize, 0); break;\\r\\n\\t\\t\\tcase SOUTH: this.curLoc = this.curLoc.translate(0, -this.theStepSize); break;\\r\\n\\t\\t} \\t\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"95ad3d7a91b8b9f860f8ad932960a754\",\n \"score\": \"0.604617\",\n \"text\": \"public void geraAgente(){\\n int x,y; \\n do{\\n y = rand.nextInt(n);\\n x = rand.nextInt(n);\\n }while(!isLivre(x, y) || !temSaida(x, y));\\n agente.setX(x);\\n agente.setY(y);\\n System.out.println(\\\"Agente x \\\"+x+\\\" y \\\"+y);\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2398a3d5d6d2d00f840bb0e998dfbc60\",\n \"score\": \"0.604501\",\n \"text\": \"private ArrayList generateTwoOptTour(ArrayList route){\\r\\n\\t\\tRandom generator = new Random(); \\r\\n\\t\\tint i = generator.nextInt(route.size());\\r\\n\\t\\tint u = generator.nextInt(route.size());\\r\\n\\t\\t\\r\\n\\t\\twhile(i == u){\\r\\n\\t\\t\\tu = generator.nextInt(route.size());\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tCollections.swap(route, i, u);\\r\\n\\t\\treturn route;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8d43089c343d5973df39f832ca223f86\",\n \"score\": \"0.6044135\",\n \"text\": \"public void buildRandomSquare() {\\n\\n HashMap map = squarePoints();\\n int y1 = map.get(\\\"p1\\\").y;\\n int x1 = map.get(\\\"p1\\\").x;\\n int y2 = map.get(\\\"p2\\\").y;\\n int x2 = map.get(\\\"p2\\\").x;\\n int y3 = map.get(\\\"p3\\\").y;\\n int x3 = map.get(\\\"p3\\\").x;\\n int y4 = map.get(\\\"p4\\\").y;\\n int x4 = map.get(\\\"p4\\\").x;\\n\\n for (int i = y1; i < y2; i++) {\\n world[x1][i] = Tileset.WALL;\\n }\\n for (int j = x2; j < x3; j++) {\\n world[j][y2] = Tileset.WALL;\\n }\\n for (int k = y3; k > y4; k--) {\\n world[x4][k] = Tileset.WALL;\\n }\\n\\n for (int l = x4; l > x1; l--) {\\n world[l][y4] = Tileset.WALL;\\n }\\n unconnected.add(Integer.toString(numOfSq));\\n layFloor(new Position(x1, y1), new Position(x3, y3));\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c20359bb166b43a17b64896390af6fcd\",\n \"score\": \"0.6033536\",\n \"text\": \"@Override\\r\\n\\tpublic Move generateMove(Cell player_cell, Memory memory, Set nearby_cells, Set nearby_pheromes) {\\n\\t\\tif(memory instanceof DummyMemory||memory instanceof ExplorerMemory){\\r\\n\\t\\t\\t//System.out.println(\\\"The cell was not defender last round. Decide the direction.\\\");\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//Choose a good move\\r\\n\\t\\t\\tPoint dir=decideNextDirection(player_cell,nearby_cells,nearby_pheromes);\\r\\n\\t\\t\\tint circleMem=translateDirToMem(dir);\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//Initialize the memory again with this direction\\r\\n\\t\\t\\tDefenderMemory dm=DefenderMemory.getNewObject();\\r\\n\\t\\t\\tdm.initialize(circleMem);\\r\\n\\t\\t\\tMemory nextMem = generateNextMoveMemory(dm);\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//Go to the direction\\r\\n\\t\\t\\tPoint nextStep=generateNextDirection(player_cell,memory,nearby_cells,nearby_pheromes);\\r\\n\\t\\t\\t\\r\\n\\t\\t\\treturn new Move(dir,nextMem.getByte());\\r\\n\\t\\t}\\r\\n\\t\\t//If we were circling last round, keep circling this round\\r\\n\\t\\telse if(memory instanceof DefenderMemory){\\r\\n\\t\\t\\tPoint nextStep=generateNextDirection(player_cell,memory,nearby_cells,nearby_pheromes);\\r\\n\\t\\t\\tMemory nextMem = generateNextMoveMemory(memory);\\r\\n\\t\\t\\t\\r\\n\\t\\t\\treturn new Move(nextStep,nextMem.getByte());\\r\\n\\t\\t}else{\\r\\n\\t\\t\\t//System.out.println(\\\"Error: Unmanipulable memory in RangerMemory \\\"+memory.getByte());\\r\\n\\t\\t\\treturn new Move(new Point(0,0),new DummyMemory().getByte());\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a8c175239454497307bc4f6c834abac2\",\n \"score\": \"0.60325944\",\n \"text\": \"public Vector2D getRandomDiagonalMovement() {\\n return diagonalMovements[random.nextInt(diagonalMovements.length)];\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c96146866c3cb38fa974792a0d73a7a\",\n \"score\": \"0.60214776\",\n \"text\": \"public Board twin() {\\n\\t\\tint length = blocks.length;\\r\\n\\t\\tint[] copy = blocks.clone();\\r\\n\\t\\t// System.arraycopy(blocks, 0, copy, 0, length*length);\\r\\n\\t\\tint randomI1 = StdRandom.uniform(length);\\r\\n\\t\\tint randomI2 = StdRandom.uniform(length);\\r\\n\\t\\twhile (copy[randomI1] == 0) {\\r\\n\\t\\t\\trandomI1 = StdRandom.uniform(length);\\r\\n\\t\\t}\\r\\n\\t\\twhile (copy[randomI2] == 0\\r\\n\\t\\t\\t\\t|| randomI1 == randomI2) {\\r\\n\\t\\t\\trandomI2 = StdRandom.uniform(length);\\r\\n\\t\\t}\\r\\n\\t\\tswap(copy, randomI1, randomI2);\\r\\n\\t\\treturn new Board(copy);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7556aef03ef46055951c6c03f7da46d\",\n \"score\": \"0.6016675\",\n \"text\": \"public void roll() {\\n \\t\\tbyte dice1 = (byte)((Math.random()*6)+1);\\n \\t\\tbyte dice2 = (byte)((Math.random()*6)+1);\\n \\t movegen(dice1, dice2);\\n \\t if(dice1!=dice2)\\n \\t \\tmove((byte)(dice1+dice2),dice1,dice2);\\n \\t else \\n \\t \\tmove((byte)(dice1*4),dice1,dice2);\\n \\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"07c3c9f4e11efe3acc8b9a401ca9cab7\",\n \"score\": \"0.6002881\",\n \"text\": \"public Tile[][] generateRandomMap() {\\n populate();\\n\\n Point lastPoint = new Point(1 + (int) (Math.random()*7 + 1), 0);\\n ArrayList possibleTiles = new ArrayList();\\n Point holder = null;\\n Point secHolder = null;\\n int tilesAdded = 0;\\n do {\\n RiverTile river;\\n river = new RiverTile();\\n tiles[lastPoint.y][lastPoint.x] = river;\\n tilesAdded++;\\n possibleTiles.clear();\\n for (Point surr: getSurroundings(lastPoint)) {\\n if (isValid(tiles, surr)) {\\n possibleTiles.add(surr);\\n }\\n }\\n if (possibleTiles.size() == 0) {\\n break;\\n }\\n\\n if (holder != null) {\\n secHolder = new Point(holder.x, holder.y);\\n }\\n\\n //last tile\\n holder = new Point(lastPoint.x, lastPoint.y);\\n\\n //newer tile\\n lastPoint = possibleTiles.get((int)(Math.random() * possibleTiles.size()));\\n\\n String image = getRiverImage(secHolder, holder, lastPoint);\\n river.setRiverType(image);\\n\\n System.out.println(tiles[holder.y][holder.x].getImage());\\n\\n } while (lastPoint.getY() < 4 || tilesAdded <= 5 || tilesAdded >= 10);\\n tiles[2][4] = new TownTile();\\n return tiles;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"223719acf3aef3ba92119e30f8166758\",\n \"score\": \"0.5999848\",\n \"text\": \"public abstract long getRandom(int x, int y);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"379da1eb5c539279da12c95c0503157d\",\n \"score\": \"0.59972304\",\n \"text\": \"private static void getRandomPieceSource()\\n\\t{\\n\\t\\tRandom randomPieceSource = new Random();\\n\\t\\trandomSource = computerPieces.get(randomPieceSource.nextInt(computerPieces.size()));\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b3e6a4c7ab215212e933e3f352fceee7\",\n \"score\": \"0.59889656\",\n \"text\": \"protected void placeAllShips(){\\n int randCell; //declare random cell as an integer\\n SecureRandom dir = new SecureRandom(); //random number generator\\n shipSizeSum = 0; //initial sum of sizes is zero\\n for(int m = 0; m < 6; m++){ //make the following 6 times, therefore 6 ships on the grid\\n direction = dir.nextInt(2); //get a random direction, either 0 or 1\\n SHIP_LENGTH = 2 + rnd.nextInt(3); //get a random ships size from 2 to 4\\n shipSizeSum = shipSizeSum + SHIP_LENGTH;// calculate sum of grid cells containing a ship\\n do { //go through the loop at least once\\n randCell = rnd.nextInt(49); //choose a cell between 0 and 49\\n }while(!checkOverlap(randCell, direction, SHIP_LENGTH)); //make sure there is no overlapping\\n\\n //if the random direction is right\\n if(direction == DIRECTION_RIGHT){\\n for(int i = randCell; i < randCell+SHIP_LENGTH; i++){\\n grid[i] = SHIP; //place a ship directly next to each other as many times as the ship length is\\n }\\n }\\n\\n //if the direction is down\\n else if (direction == DIRECTION_DOWN){\\n for(int i = randCell; i < randCell+(10*(SHIP_LENGTH-1))+SHIP_LENGTH; i+=10){\\n grid[i] = SHIP; //place a ship every 10 cells (since we have 10 cells per row) for as long as the ship length is\\n }\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ff2c73ed416ea2dc81da5542a9911f5d\",\n \"score\": \"0.5980997\",\n \"text\": \"private int[] randomPos() {\\n\\t\\tint[] pin= {randomizer.nextInt(height),randomizer.nextInt(width)};\\n\\t\\treturn pin;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d42085e7c8cf309db176f534ad96e7a0\",\n \"score\": \"0.597985\",\n \"text\": \"public void gamePlay(){\\n a1 = getRandoma();\\n b1 = getRandomb();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"406a68518dc06bf3b2633b5e2768bb16\",\n \"score\": \"0.5975616\",\n \"text\": \"public void generatePlayers() {\\n Random random = new Random();\\n\\n var playerOne = new Player(\\\"Player 1\\\");\\n var playerTwo = new Player(\\\"Player 2\\\");\\n\\n this.setplayerOne(playerOne);\\n this.setplayerTwo(playerTwo);\\n\\n if (random.nextBoolean()) {\\n this.currentPlayer = this.playerOne;\\n } else {\\n this.currentPlayer = this.playerTwo;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5ae542a6021e7fd8fac559b5500ca5e5\",\n \"score\": \"0.59749717\",\n \"text\": \"private Sprite generateRandomSprite(){{\\n\\n int i = random.nextInt(100);\\n if (i < 8){\\n return new Sprite(27);\\n }\\n else {\\n return new Sprite(26);\\n }}\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"57f975925c8a78e742762d780e47565d\",\n \"score\": \"0.5974936\",\n \"text\": \"public void doRandomWalk() {\\n // intialise the random number generator:\\n Random randGenerator = new Random();\\n\\n Vector tempX = new Vector(dimension); // temporary position vector for the random walk\\n\\n // INITIALISE THE STARTING POSITION\\n if (startStrategy == START_POSITION_XMIN) {\\n for (int i = 0; i < dimension; i++)\\n tempX.setReal(i, xMin);\\n }\\n else if (startStrategy == START_POSITION_RANDOM) {\\n // assign tempX a random value within the bounds of the problem (starting position):\\n for (int i = 0; i < dimension; i++)\\n tempX.setReal(i, randGenerator.nextDouble() * (xMax - xMin) + xMin);\\n }\\n else if (startStrategy == START_POSITION_SMALL) {\\n double xRange = xMax - xMin;\\n double smallRange = percSmall * xRange;\\n for (int i = 0; i < dimension; i++)\\n tempX.setReal(i, randGenerator.nextDouble() * smallRange + xMin);\\n }\\n else if (startStrategy == START_POSITION_SPECIFIED) {\\n // use the walkSpecifier object to determine where to start:\\n\\n // for every dimension, generate a random number in the starting zone hypervolume:\\n for (int i = 0; i < dimension; i++) {\\n // generate a random offset within 50% of the range:\\n double offset = randGenerator.nextDouble() * ((xMax - xMin) * 0.5);\\n if (walkSpecifier.isSet(i))\\n tempX.setReal(i, xMax - offset);\\n else\\n tempX.setReal(i, xMin + offset);\\n }\\n // generate a random dimension to move the starting position to the edge of the search space:\\n int randDim = (int) Math.floor(randGenerator.nextDouble() * dimension);\\n if (walkSpecifier.isSet(randDim)) // this means that this dimension should be at maximum\\n tempX.setReal(randDim, xMax);\\n else\\n tempX.setReal(randDim, xMin);\\n }\\n\\n // DO THE WALK:\\n int count = 0; // for counting the number of steps taken\\n double smallRandomChange, newValue = 0;\\n while (count < numPoints) {\\n\\n if (walkType == WALKTYPE_RANDOM_MANHATTAN) {\\n // save the previous point:\\n for (int i = 0; i < dimension; i++) {\\n points[count].setReal(i, tempX.getReal(i));\\n }\\n // generate a random dimension within the dimension of the problem:\\n int randDim = (int) Math.floor(randGenerator.nextDouble() * dimension);\\n int inc = 1;\\n // if(count%2 == 0) {\\n if (walkSpecifier.isSet(randDim))\\n inc = -1;\\n else\\n inc = 1;\\n newValue = tempX.getReal(randDim) + (inc * stepSize); // decrease or increase by stepSize in the random dimension\\n if ((newValue > xMax) || (newValue < xMin)) { // outside the bounds of the problem\\n newValue = tempX.getReal(randDim) - (inc * stepSize);\\n walkSpecifier.flipBit(randDim); // change the direction\\t\\t \\n }\\n // }\\n /* else {\\n\\t\\tint randBit = (int)Math.floor(randGenerator.nextDouble()*2);\\n\\t\\tif (randBit == 0) inc = 1;\\n\\t\\telse inc = -1;\\n\\t\\tnewValue = tempX.getReal(randDim) + (inc * stepSize);\\n\\t\\tif ((newValue > xMax) || (newValue < xMin)) \\n\\t\\t newValue = tempX.getReal(randDim) - (inc * stepSize);\\n\\t } */\\n tempX.setReal(randDim, newValue); // change tempX to new value\\n }\\n\\n else if (walkType == WALKTYPE_RANDOM_PROGRESSIVE) {\\n for (int i = 0; i < dimension; i++) {\\n // save the previous component:\\n points[count].setReal(i, tempX.getReal(i));\\n\\n // for all steps: progress in set direction\\n smallRandomChange = (randGenerator.nextDouble() * stepSize); // a positive value\\n if (walkSpecifier.isSet(i))\\n smallRandomChange = -smallRandomChange;\\n newValue = tempX.getReal(i) + smallRandomChange;\\n if (newValue < xMin) { // out of bounds -- too small:\\n // calculate by how much it goes over the boundary:\\n double diff = xMin - newValue;\\n newValue = xMin + diff; // bounce back from the boundary\\n walkSpecifier.flipBit(i); // change direction bias for that dimension\\n }\\n else if (newValue > xMax) { // out of bounds -- too big:\\n double diff = newValue - xMax;\\n newValue = xMax - diff; // bounce back from the boundary\\n walkSpecifier.flipBit(i); // change direction bias for that dimension\\n }\\n // previous strategy: change direction in both cases (too big or too small):\\n // newValue = tempX.getReal(i) - smallRandomChange;\\n // walkSpecifier.flipBit(i); // change the direction\\n tempX.setReal(i, newValue);\\n }\\n }\\n\\n else { // WALKTYPE_RANDOM_*\\n for (int i = 0; i < dimension; i++) { // for every part of the vector\\n points[count].setReal(i, tempX.getReal(i)); // save the last position\\n\\n if (walkType == WALKTYPE_RANDOM) {\\n boolean outsideBounds = true; // assume out of bounds to start\\n while (outsideBounds) { // while the new value is outside the bounds \\t\\t\\t\\n // generate a small random step in either direction\\n smallRandomChange = (randGenerator.nextDouble() * stepSize * 2) - stepSize;\\n newValue = tempX.getReal(i) + smallRandomChange; // change tempXi by small random amount\\n if ((newValue >= xMin) && (newValue <= xMax)) { // check if new value would be in bounds\\n outsideBounds = false;\\n tempX.setReal(i, newValue); // update tempX with the step\\n } // end of if\\t\\t \\n } // end of while outside bounds\\n }\\n else { // WALKTYPE_RANDOM_INCREASING or WALKTYPE_RANDOM_INCREASING_NOWRAP \\n smallRandomChange = (randGenerator.nextDouble() * stepSize); // a positive value\\n newValue = tempX.getReal(i) + smallRandomChange; // change tempXi by small positive amount\\n if ((newValue > xMax) || (newValue < xMin)) { // outside the bounds\\n if (walkType == WALKTYPE_RANDOM_INCREASING_NOWRAP) {\\n // save the rest of the previous position:\\n for (int j = i + 1; j < dimension; j++)\\n points[count].setReal(j, tempX.getReal(j));\\n stopWalk(count); // stop the walk at the current number of steps\\n return;\\n }\\n else {\\n newValue = xMin; // wrap to minimum value\\n }\\n }\\n tempX.setReal(i, newValue); // change tempXi to new value\\n }\\n } // end of for each part of the vector\\n }\\n count++;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8a5cfd488124c3825093e5baf089a0db\",\n \"score\": \"0.59746504\",\n \"text\": \"private TwoTuple getFirstMove() {\\n\\t\\tint stX, stY;\\n\\t\\tstX = (int) (Math.random() * this.colDimension) + 1;\\n\\t\\tstY = (int) (Math.random() * this.rowDimension) + 1;\\n\\t\\treturn new TwoTuple(stX, stY);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c71b5ee728e44b9eb8da5ace9c0be479\",\n \"score\": \"0.5967686\",\n \"text\": \"public static void soldierRandom() throws GameActionException {\\n int action = (rc.getRobot().getID()*rand.nextInt(1001) + 500)%1001;\\n // construct PASTR\\n if (action < 4) {\\n Soldier.constructPastr();\\n }\\n // attack nearby cunts\\n else if (action < 600) {\\n //Attacks.attackRandom();\\n Attacks.interceptAndAttack();\\n }\\n // move in a random direction\\n else if (action < 700) {\\n Soldier.randomMove();\\n }\\n // suicide bomb enemy PASTRs\\n else if (action < 700) {\\n Soldier.suicideBomb();\\n }\\n // move away from the friendly HQ\\n else if (action < (800)) {\\n Soldier.moveAwayFromHQ();\\n }\\n //Sneak towards the enemy\\n else {\\n Soldier.sneakTowardEnemyHQ();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0d769604faef086ec1c81165912a50ff\",\n \"score\": \"0.59662414\",\n \"text\": \"int random(int roof){\\n return (rand.nextInt(roof)); // Uses random class and rood to return randomized number\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8b03d9faaa5d042d29c3114506564bdd\",\n \"score\": \"0.5964866\",\n \"text\": \"public String randomAction(){\\n\\t\\tif(generator.nextDouble() < AI_MOVE_PROBABILITY)\\n\\t\\t\\treturn \\\"move\\\";\\n\\t\\telse\\n\\t\\t\\treturn \\\"shoot\\\";\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7a3b2225ce8c603ed6dadc3d1b9fd8e2\",\n \"score\": \"0.59618425\",\n \"text\": \"public void faceRandomDirection() {\\n turn(Greenfoot.getRandomNumber(360));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6e18fd18c5d0790ac6cb6550cca8c191\",\n \"score\": \"0.5955642\",\n \"text\": \"public boolean makeMove(JumbleMove move)\\n {\\n\\tint a = move.getMoveA();\\n\\tint b = move.getMoveB();\\n\\t\\n\\tif(isPossibleMove(move))\\n\\t{\\n\\t String[] random = StringManipulator.stringToArray(m_state);\\n\\t \\n\\t String hold = random[a];\\n\\t random[a] = random[b];\\n\\t random[b] = hold;\\n\\t \\n\\t m_state = StringManipulator.arrayToString(random);\\n\\t \\n\\t return true;\\n\\t}\\n\\telse\\n\\t return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"079da5bc4535d86033d2f295b6e5c9de\",\n \"score\": \"0.59532803\",\n \"text\": \"void generate();\",\n \"title\": \"\"\n }\n]"}}},{"rowIdx":92,"cells":{"query_id":{"kind":"string","value":"741c7da3044b3bb9100548992d3e8f8f"},"query":{"kind":"string","value":"Create an JsonConsumer from a path"},"positive_passages":{"kind":"list like","value":[{"docid":"e1b3ae7d2f945e12d9c4079818163f48","score":"0.8514753","text":"public static JsonConsumer newConsumer(Path path) throws Exception {\n return JsonStreamSpec.with(path).consumer();\n }","title":""}],"string":"[\n {\n \"docid\": \"e1b3ae7d2f945e12d9c4079818163f48\",\n \"score\": \"0.8514753\",\n \"text\": \"public static JsonConsumer newConsumer(Path path) throws Exception {\\n return JsonStreamSpec.with(path).consumer();\\n }\",\n \"title\": \"\"\n }\n]"},"negative_passages":{"kind":"list like","value":[{"docid":"c96913915bc178fae77a7a7bac50e089","score":"0.8605594","text":"public static JsonConsumer newConsumer(String path) throws Exception {\n return JsonStreamSpec.with(path).consumer();\n }","title":""},{"docid":"6fcd6155d31fbbb4dfcb3c4641dccb1f","score":"0.5602896","text":"public static JsonConsumer newConsumerAndClose(InputStream inputStream) throws Exception {\n return JsonStreamSpec.with(inputStream).closeOnFinish().consumer();\n }","title":""},{"docid":"c0c4b70a2ff82033565097bed155e1c3","score":"0.54441684","text":"public static JsonStream stream(String path) throws Exception {\n return JsonStreamSpec.with(path).stream();\n }","title":""},{"docid":"cabe3324029acce2537079cd17ed69d9","score":"0.5366503","text":"public static JsonStream stream(Path path) throws Exception {\n return JsonStreamSpec.with(path).stream();\n }","title":""},{"docid":"1789108e2e13c8fd7b62406f5cc9cfbc","score":"0.52780175","text":"public static JsonConsumer newConsumerAndClose(JsonParser xmlStreamReader) throws Exception {\n return JsonStreamSpec.with(xmlStreamReader).closeOnFinish().consumer();\n }","title":""},{"docid":"2a19b0c0dc19a3eb101963b81f4f37e8","score":"0.51260215","text":"public static void main(String[] args) throws JsonProcessingException {\n Consumer consumer = new Consumer();\n\n }","title":""},{"docid":"cbcae58cbd73186e8bf0ff8b830ad48d","score":"0.50747323","text":"protected abstract RemoteFileConsumer buildConsumer(Processor processor);","title":""},{"docid":"ed7e53eb10114b32a66a4c254dc9ba2c","score":"0.47944266","text":"@Test\n public void testConsumerRoute() throws Exception {\n RouteBuilder simpleRoute = new RouteBuilder() {\n @Override\n public void configure() {\n from(\"direct:getFile\")\n .pollEnrich(\"file://src/main/resources/inputs/?include=input.*\\\\.txt&noop=true&idempotent=true&initialDelay=0\")\n .convertBodyTo(String.class);\n }\n };\n\n CamelContext camel = new DefaultCamelContext();\n camel.disableJMX();\n camel.setStreamCaching(true);\n camel.addRoutes(simpleRoute);\n camel.start();\n\n String result = camel.createFluentProducerTemplate().to(\"direct:getFile\").request(String.class);\n assertEquals(\"Hello World\\n\", result);\n\n camel.stop();\n }","title":""},{"docid":"fa08a51caa9c8ac9eb4a6ae3adc0433c","score":"0.47468257","text":"public static JSONObject getJsonFromFile(String path) {\n JSONObject json = new JSONObject();\n\n try {\n String s = new String(Files.readAllBytes(Paths.get(JsonDeserializer.class.getResource(path).toURI())));\n json = new JSONObject(s);\n } catch (URISyntaxException | IOException e) {\n e.printStackTrace();\n }\n\n return json;\n }","title":""},{"docid":"51d62b0421e89e43145f8cbdd31290b6","score":"0.4651697","text":"JsonReader() {\n scopes = new int[32];\n pathNames = new String[32];\n pathIndices = new int[32];\n }","title":""},{"docid":"4cbc8910241f70759826c72cb8b921cc","score":"0.46379888","text":"public CamelRemoteFileBindingModel setConsumer(CamelRemoteFileConsumerBindingModel consumer);","title":""},{"docid":"3c9533fbdabd780c7206809be906b271","score":"0.46328765","text":"@Override\n public Consumer createConsumer(Processor processor) throws Exception {\n InputStream is = getResourceAsInputStream();\n String text = IOHelper.loadText(is);\n\n // split each line\n Stream stream = Arrays.stream(text.split(\"\\n\"));\n\n // sort goals scored on minutes\n stream = stream.sorted((a, b) -> goalTime(a).compareTo(goalTime(b)));\n\n // store goals in a list\n List goals = stream.collect(Collectors.toList());\n\n // create consumer with the goals\n return new GoalConsumer(this, processor, goals);\n }","title":""},{"docid":"0d018d900bc2ba86facb6ad60055ec56","score":"0.46162918","text":"Consumer getFileConsumer()\n {\n return builderFactory.getComponentBuilder().fileConsumer()\n .setCronExpression(cronExpression)\n .setScheduledJobGroupName(scheduledGroupName)\n .setScheduledJobName(scheduledName)\n .setFilenames(sourceFilenames)\n .setLogMatchedFilenames(true)\n .setConfiguredResourceId(fileConsumerConfiguredResourceId)\n .build();\n }","title":""},{"docid":"9b5bea070dac6565d789295c5601f94e","score":"0.45708606","text":"void consume(AbstractConsumerManager consumerManager);","title":""},{"docid":"825b1a040294e28bd247e6e3711cc098","score":"0.45640013","text":"private JacksonJsonProvider createJsonProvider() {\n\t\tfinal JacksonJsonProvider jsonProvider = new JacksonJsonProvider();\n\t\tjsonProvider.setMapper(new ObjectMapper());\n\t\treturn jsonProvider;\n\t}","title":""},{"docid":"e3c21560aee92a3fbccaeaff6e176b73","score":"0.44860306","text":"public Api getApi(String path);","title":""},{"docid":"874741e6598296cfce3b20edbe3c256e","score":"0.4485891","text":"public interface JsonRecipe {\n void write(JsonGenerator generator) throws IOException;\n}","title":""},{"docid":"bded3a2b88396696d409d7dd91e4fc2f","score":"0.4468971","text":"public void addConsumer(StringConsumer sc) {\n\t\t\n\t}","title":""},{"docid":"028c7b92384f58bc9f3b14a69b7ce867","score":"0.4457344","text":"public void createResource(String path);","title":""},{"docid":"4135bb5e8c7e18c9665015d1674940f9","score":"0.44510487","text":"private DocumentContext getJsonStringFromFile(String filePath) {\n String json = null;\n if (filePath != null && !filePath.isEmpty()) {\n // Relative path or /server/ means it's a classpath resource\n if (!filePath.startsWith(\"/\") || filePath.startsWith(\"/server/\")) {\n String path = filePath.startsWith(\"/server/\") ? filePath.substring(\"/server/\".length()) : filePath;\n LOGGER.debug(\"Looking for classpath resource : \" + path);\n JsonNode node = getJson(path);\n if (node != null) {\n json = node.toString();\n LOGGER.debug(\"Class path json : \" + json);\n }\n } else {\n // absolute path\n LOGGER.debug(\"Looking for file: \" + filePath);\n try {\n json = new String(Files.readAllBytes(Paths.get(filePath)));\n } catch (Exception e) {\n LOGGER.debug(\"Unexpected exception reading JSON string from file: \" + e);\n }\n }\n }\n if (json == null) {\n return JsonPath.parse(\"{}\"); //parse an empty object and set that for the context if the file cannot be loaded for some reason\n }\n return JsonPath.parse(json);\n }","title":""},{"docid":"497058f887b5b3ad757ee772059edd39","score":"0.4394805","text":"public void loadFromJson(String alias, String path, String schema) throws IOException, ParseException {\n\n override(alias, String.format(\n \"%s = LOAD '%s' using JsonLoader('%s');\",\n alias,\n path,\n schema\n // TODO debug why it doesn't work\n // sb.toString()\n ));\n }","title":""},{"docid":"e2570b33af1ccebb28a5c3f679815605","score":"0.43755084","text":"private Consumer createConsumer() {\n final Properties props = getProperties();\n final Consumer consumer = new KafkaConsumer<>(props);\n\n String topicName = this.connectionBean.getEndpoint().getAddress().split(\"/\")[1];\n consumer.subscribe(Collections.singletonList(topicName));\n return consumer;\n }","title":""},{"docid":"2e1493fb0aca147b0424494b3437bd59","score":"0.43695945","text":"void resolver_init(String path);","title":""},{"docid":"376ef331bf9feb1a44950a760cf43863","score":"0.4368315","text":"@Override\n public SystemConsumer getConsumer(String systemName, Config config, MetricsRegistry registry) {\n if (useCachedConsumer && mockConsumer != null) {\n return mockConsumer;\n }\n\n String jobName = config.get(\"job.name\");\n String jobId = config.get(\"job.id\");\n if (jobName == null) {\n throw new ConfigException(\"Must define job.name.\");\n }\n if (jobId == null) {\n jobId = \"1\";\n }\n String streamName = CoordinatorStreamUtil.getCoordinatorStreamName(jobName, jobId);\n SystemStreamPartition systemStreamPartition = new SystemStreamPartition(systemName, streamName, new Partition(0));\n mockConsumer = new MockCoordinatorStreamWrappedConsumer(systemStreamPartition, config);\n mockConsumer.register(systemStreamPartition, \"0\");\n return mockConsumer;\n }","title":""},{"docid":"d0a24f2d888c3c08ce4e3fd5654aa8d1","score":"0.43479154","text":"public TwitterStreamFactory(String configTreePath) {\n this(configTreePath, null);\n }","title":""},{"docid":"56453fb1ddafd73940d68ba642d9fa88","score":"0.43440112","text":"@GET\n @Produces(MediaType.APPLICATION_JSON)\n @Path(\"/{id}\")\n public ConsumerType getConsumerType(@PathParam(\"id\") String id) {\n ConsumerType toReturn = consumerTypeCurator.find(id);\n\n if (toReturn != null) {\n return toReturn;\n }\n\n throw new NotFoundException(\n i18n.tr(\"ConsumerType with id '\" + id + \"' could not be found.\"));\n }","title":""},{"docid":"be1e745a99d94059cf0e46f5e9bf6ccc","score":"0.43118382","text":"public interface UnderFileSystemFactory {\n\n /**\n * Gets whether this factory supports the given path and thus whether calling the\n * {@link #create(String, Object)} can succeed for this path\n *\n * @param path\n * File path\n * @param tachyonConf\n * Tachyon configuration\n * @return True if the path is supported, false otherwise\n */\n public boolean supportsPath(String path, TachyonConf tachyonConf);\n\n /**\n * Creates a client for accessing the given path\n *\n * @param path\n * File path\n * @param tachyonConf\n * Tachyon configuration\n * @param conf\n * Optional configuration object for the UFS, may be null\n * @return Client\n * @throws IllegalArgumentException\n * Thrown if this factory does not support clients for the given path or if the\n * configuration provided is insufficient to create a client\n */\n public UnderFileSystem create(String path, TachyonConf tachyonConf, Object conf);\n}","title":""},{"docid":"dac67b0b49f956a60ae9325d37a45a4b","score":"0.4306105","text":"public ClassReader(String path) {\n\t\tcleanPath = PathWorker.getCleanPath(path);\n\t\tclassName = PathWorker.getFileWithoutExt(path);\n\t}","title":""},{"docid":"f33a28765c282618df2e613cb6a8d2b0","score":"0.4298659","text":"UriFromPath createUriFromPath();","title":""},{"docid":"2d9f0f61fd8b1a96a32d3590a19a917a","score":"0.42985564","text":"@ResponseStatus(value = HttpStatus.OK)\n\t@RequestMapping(value = \"{customerGuid}/consumer/{consumerGuid}\", produces = {\"application/json\"}, method = RequestMethod.GET)\n\tpublic Consumer getConsumer(\n\t\t\t@PathVariable(value = \"customerGuid\") final String customerGuid,\n\t\t\t@PathVariable(value = \"consumerGuid\") final String consumerGuid)\n\t{\n\tLOG.info(\"Entering method getConsumer\");\n\t\n\t// check if incoming customer and consumer guid are valid or not\n\tisValidGuid(customerGuid, \"Customer\");\n\tisValidGuid(consumerGuid, \"Consumer\");\n\t\n\tOptional lookupResult = consumerCassandraRepo.findById(consumerGuid);\n\t\n\tif(!lookupResult.isPresent()) {\n\t\tLOG.error(\"Consumer not found for customer guid {} and consumer guid {}\", customerGuid, consumerGuid);\n\t\tthrow new ResourceNotFoundException(\"Consumer doesn't exist\");\n\t}\n\t\n\tConsumerDTO consumerDtoResponse = lookupResult.get();\n\t\n\tConsumer consumerResponse = consumerMapper.dtoToConsumer(consumerDtoResponse);\n\t\n\tLOG.info(\"Exiting method getConsumer\");\n\n\treturn consumerResponse;\n\t}","title":""},{"docid":"5be58535c514b2e7da06e8a0c59b43d0","score":"0.42874578","text":"public JsonReader(String source) {\r\n this.source = source;\r\n }","title":""},{"docid":"271793b5efec6ce3aae2c2df508d2344","score":"0.42786697","text":"public static JSONObject getJSONFromFile(String path) {\n\t\tString jsonString = getFileContents(path);\n\t\treturn new JSONObject(jsonString);\n\t}","title":""},{"docid":"86d7e365db8b044d00a7b74d63f0bc66","score":"0.42747366","text":"JsonObjectReader createJsonObjectReader(Reader reader, long initialPosition, int maxObjectLen, Mode mode, Class objectClass) throws IOException;","title":""},{"docid":"a9074c0e89c53643d7cab95d1df7ed97","score":"0.42711365","text":"void consume(AbstractConsumerManager consumerManager, ITraceContext trace);","title":""},{"docid":"37c6e7efb37b3e9038ece85efbb32e84","score":"0.42512733","text":"private Consumer() {\n }","title":""},{"docid":"e5ab918d80b0a64aa2b4cdccd121a508","score":"0.42480856","text":"void handle(Builder builder, Resource config) throws IOException;","title":""},{"docid":"874d670c7c94a15dee42a9220e33ca53","score":"0.42479023","text":"@Override\n\tString buildRefreshCommand(IPath path) throws JsonGenerationException, JsonMappingException, IOException,\n\t\t\tURISyntaxException {\n\t\treturn null;\n\t}","title":""},{"docid":"e544a12f82868777ef44aebf464a7c11","score":"0.4234852","text":"@GetMapping(value = {\"/consumeByTime\"})\n public List consumer2ByTime(@RequestParam(\"count\") Integer count,\n @RequestParam(\"startTime\") @DateTimeFormat(iso = ISO.DATE_TIME) ZonedDateTime startTime) {\n\n if (count == null) {\n count = CONSUMER_1_DEFAULT_MESSAGE_FETCH_COUNT;\n }\n\n if (startTime == null) {\n /* get the current time and subtract some the default hour value */\n startTime = ZonedDateTime.now().minusHours(DEFAULT_ZONE_TIME_OFFSET);\n }\n\n try {\n\n /* create a JetStream instance */\n JetStream js = connection.jetStream();\n\n /* configure the consumer to use DeliverPolicy.ByStartTime.*/\n ConsumerConfiguration consumerConfig = ConsumerConfiguration.builder()\n .durable(CONSUME_BY_TIME)\n .deliverPolicy(DeliverPolicy.ByStartTime)\n .startTime(startTime)\n .replayPolicy(ReplayPolicy.Instant)\n .build();\n\n /* create the pull options */\n PullSubscribeOptions pullOptions = PullSubscribeOptions.builder()\n .configuration(consumerConfig)\n .build();\n\n /* create the subscription */\n JetStreamSubscription subscription = js.subscribe(CONSUMER_SUBJECT_1, pullOptions);\n\n /* retrieve count message. */\n List messages = subscription.fetch(count, Duration.ofSeconds(SUBSCRIBER_FETCH_TIMEOUT_IN_SECONDS));\n\n /* return a list of formatted messages. */\n return formatMessages(messages);\n\n } catch (IOException | JetStreamApiException ex) {\n Logger.getLogger(RESTController.class.getName()).log(Level.SEVERE, null, ex);\n }\n\n return null;\n }","title":""},{"docid":"5bafcd26411464ab0cd7e8368c4156ad","score":"0.42313275","text":"public JsonReader(String source) {\n this.source = source;\n }","title":""},{"docid":"5bafcd26411464ab0cd7e8368c4156ad","score":"0.42313275","text":"public JsonReader(String source) {\n this.source = source;\n }","title":""},{"docid":"5bafcd26411464ab0cd7e8368c4156ad","score":"0.42313275","text":"public JsonReader(String source) {\n this.source = source;\n }","title":""},{"docid":"5bafcd26411464ab0cd7e8368c4156ad","score":"0.42313275","text":"public JsonReader(String source) {\n this.source = source;\n }","title":""},{"docid":"059ad6a967e1cf103a0c43723cae5022","score":"0.42298228","text":"@ConstructorProperties({\"scheme\", \"stringPath\", \"sinkMode\"})\n public Hfs( Scheme scheme, String stringPath, SinkMode sinkMode )\n {\n super( scheme, sinkMode );\n setStringPath( stringPath );\n }","title":""},{"docid":"6f34419d20eb80989efe3c64b2391d42","score":"0.42283273","text":"@Bean\r\n\tpublic ConsumerFactory userConsumerFactory() {\r\n\t\tMap config = new HashMap();\r\n\r\n\t\tconfig.put(ConsumerConfig.BOOTSTRAP_SERVERS_CONFIG, \"127.0.0.1:9092\");\r\n\t\tconfig.put(ConsumerConfig.GROUP_ID_CONFIG, \"group_json\");\r\n\t\tconfig.put(ConsumerConfig.KEY_DESERIALIZER_CLASS_CONFIG, StringDeserializer.class);\r\n\t\tconfig.put(ConsumerConfig.VALUE_DESERIALIZER_CLASS_CONFIG, JsonDeserializer.class);\r\n\t\treturn new DefaultKafkaConsumerFactory(config, new StringDeserializer(), new JsonDeserializer(User.class));\r\n\t}","title":""},{"docid":"63bf4fb8cd82bacd99a7f294617346ce","score":"0.42271593","text":"public T Parse(String path) throws IOException;","title":""},{"docid":"31231d3566faa1bf4ce66339630241fd","score":"0.4223445","text":"@ConstructorProperties({\"scheme\", \"stringPath\"})\n public Hfs( Scheme scheme, String stringPath )\n {\n super( scheme );\n setStringPath( stringPath );\n }","title":""},{"docid":"3cc2f64387f7d62dfdc34593748dbb56","score":"0.42205244","text":"static public ContentHandleFactory newFactory() {\n return new ContentHandleFactory() {\n @Override\n public Class[] getHandledClasses() {\n return new Class[]{ JsonParser.class };\n }\n @Override\n public boolean isHandled(Class type) {\n return JsonParser.class.isAssignableFrom(type);\n }\n @Override\n public ContentHandle newHandle(Class type) {\n @SuppressWarnings(\"unchecked\")\n ContentHandle handle = isHandled(type) ?\n (ContentHandle) new JacksonParserHandle() : null;\n return handle;\n }\n };\n }","title":""},{"docid":"672f8e8b3b36622a2b9e74ff36c3a7c5","score":"0.42023748","text":"@Path(\"/configurations\")\npublic interface ConfigurationWebApi {\n\n @GET\n @Path(\"{path:.*}\")\n @Produces(MediaType.APPLICATION_JSON)\n String read(@PathParam(\"path\") String path);\n\n @POST\n @Path(\"{path:.*}\")\n @Consumes(MediaType.APPLICATION_JSON)\n void write(@PathParam(\"path\") String path, String data);\n\n @PUT\n @Path(\"{path:.*}\")\n @Consumes(MediaType.APPLICATION_JSON)\n void overwrite(@PathParam(\"path\") String path, String data);\n\n @DELETE\n @Path(\"{path:.*}\")\n void delete(@PathParam(\"path\") String path);\n}","title":""},{"docid":"bec70a60d84e8ce386d8bc7a0db30db2","score":"0.41958597","text":"public static Json queryMetaJson(String path) throws IOException {\n\t\treturn invokeWithFallbacks((service, arg) -> Json.read(Utils.readString(new URL(service.meta + arg))), path);\n\t}","title":""},{"docid":"fd74966dbadb639879d9620def0f1e89","score":"0.4192363","text":"public void parseFunction(Path path) {\n\t\t\t\t\n\t\tJSONParser jsonParser = new JSONParser();\n\n\t\ttry (BufferedReader reader = Files.newBufferedReader(path, Charset.forName(\"UTF-8\"))) {\n\t\t\t\n\t\t\tJSONObject singleSongObject = (JSONObject) jsonParser.parse(reader);\n\n\t\t\t// save as a single song object\n\t\t\tSong song = new Song(singleSongObject);\n\n\t\t\t// invoke in threadSafeMusicLibrary and invoke the inherited addSong method by calling super.addSong() from super class - musicLibrary to add song\t\t\t\n\t\t\tthreadSafeML.addSong(song);\n\t\t\t\n\t\t} \n\t\tcatch (IOException e) {\n\t\t\tSystem.out.println(e);\n\t\t} \n\t\tcatch (ParseException e) {\n\n\t\t\tSystem.out.println(e);\n\t\t}\n\n\t}","title":""},{"docid":"0aac1f68800e8d1493e871401d7eda53","score":"0.4187114","text":"public synchronized void asObject(Path outpath) throws IOException, InterruptedException {\n\t\tFiles.createFile(outpath);\n\t\tnew IndexJSONWriter().asObject(this, outpath);\n\t}","title":""},{"docid":"435e10352c0c3a2cadb1081643b01d00","score":"0.4185477","text":"public ReadableFile create(Path path) {\n return new ReadableFileImpl(path);\n }","title":""},{"docid":"7ccbf8ce794993236bd4b8facd27f791","score":"0.41809475","text":"public FileStream getFile( final String _path ) ;","title":""},{"docid":"71311f9b22d39c4842601d75911f3c35","score":"0.41769528","text":"public JsonParser map(final String path, final Class target) {\n\t\treturn null;\n\t}","title":""},{"docid":"a1de1c6ca379a5a79c6e6c90941255b8","score":"0.41766956","text":"public UnderFileSystem create(String path, TachyonConf tachyonConf, Object conf);","title":""},{"docid":"ca60b66d888d6f0579a5a3372b890b6d","score":"0.41693562","text":"@Override\n public void onReceiveRequest(ClientRequest req) {\n mProcessor.readPath(req);\n }","title":""},{"docid":"4e64a513da2613ad560851d4d3e4c278","score":"0.4160137","text":"public interface IPodsAsyncPathHandler extends IPodserviceEntityHandler\n{\n /**\n * get /pods\n * No summary given.\n * \n * @param _consumer A consumer into which responses may be passed.\n * @param cursor No summary given.\n * @param limit No summary given.\n * @throws JapiException If the method cannot be called\n */\n void handleGet(\n @Nonnull IConsumer _consumer,\n @Nullable Cursor cursor,\n @Nullable CursorLimit limit\n\t\n ) throws JapiException;\n \n}","title":""},{"docid":"826e589a4e8e94930002bd5cf114194c","score":"0.4149347","text":"public void init() {\n if (this.segments == null) {\n if (\"*\".equals(this.path)) {\n this.segments = new Segement[]{WildCardSegement.instance};\n } else {\n this.segments = new JSONPathParser(this.path).explain();\n }\n }\n }","title":""},{"docid":"106f858fc3859bdeb44fa8cdc0170333","score":"0.41420442","text":"@Override\n\tpublic abstract T getResourceByPath(String path);","title":""},{"docid":"f6ac1b0a7bfe5bffe464040531fdb784","score":"0.41418427","text":"public ResourceStreamInfo(String contentType, ServletContext context,\r\n String path) {\r\n this.contentType = contentType;\r\n this.context = context;\r\n this.path = path;\r\n }","title":""},{"docid":"62916a61bca27312748795fde28ef8ee","score":"0.41397694","text":"@Test\n public void testWriteMultipleJSONDocsFromFactory() throws KeyManagementException, NoSuchAlgorithmException, Exception {\n String docId[] = { \"/a.json\", \"/b.json\", \"/c.json\" };\n String json1 = new String(\"{\\\"animal\\\":\\\"dog\\\", \\\"says\\\":\\\"woof\\\"}\");\n String json2 = new String(\"{\\\"animal\\\":\\\"cat\\\", \\\"says\\\":\\\"meow\\\"}\");\n String json3 = new String(\"{\\\"animal\\\":\\\"rat\\\", \\\"says\\\":\\\"keek\\\"}\");\n\n JsonFactory f = new JsonFactory();\n\n JSONDocumentManager docMgr = client.newJSONDocumentManager();\n docMgr.setMetadataCategories(Metadata.ALL);\n DocumentWriteSet writeset = docMgr.newWriteSet();\n\n // Create a content Factory from JacksonDatabindHandle that will handle\n // writes.\n ContentHandleFactory ch = JacksonParserHandle.newFactory();\n\n // Instantiate a handle.\n JacksonParserHandle jacksonParserHandle1 = (JacksonParserHandle) ch.newHandle(JsonParser.class);\n JacksonParserHandle jacksonParserHandle2 = (JacksonParserHandle) ch.newHandle(JsonParser.class);\n JacksonParserHandle jacksonParserHandle3 = (JacksonParserHandle) ch.newHandle(JsonParser.class);\n\n jacksonParserHandle1.set(f.createParser(json1));\n jacksonParserHandle2.set(f.createParser(json2));\n jacksonParserHandle3.set(f.createParser(json3));\n\n writeset.add(docId[0], jacksonParserHandle1);\n writeset.add(docId[1], jacksonParserHandle2);\n writeset.add(docId[2], jacksonParserHandle3);\n\n docMgr.write(writeset);\n\n // Using JacksonHandle to read back from database.\n JacksonHandle jacksonhandle = new JacksonHandle();\n docMgr.read(docId[0], jacksonhandle);\n JSONAssert.assertEquals(json1, jacksonhandle.toString(), true);\n\n docMgr.read(docId[1], jacksonhandle);\n JSONAssert.assertEquals(json2, jacksonhandle.toString(), true);\n\n docMgr.read(docId[2], jacksonhandle);\n JSONAssert.assertEquals(json3, jacksonhandle.toString(), true);\n // Close handles.\n jacksonParserHandle1.close();\n jacksonParserHandle2.close();\n jacksonParserHandle3.close();\n }","title":""},{"docid":"2ad2ea2c7684b30d5e2b0f4f26d9e7c5","score":"0.41365927","text":"public HttpClientRequestActionBuilder get(String path) {\n return request(HttpMethod.GET, path);\n }","title":""},{"docid":"c6cd6152f4b7b9286d65af68c24a5953","score":"0.4136016","text":"public JsonProperty addPath(String path) {\n\t\tthis.paths.add(new JsonPath(path, JsonPath.PathType.STRING));\n\t\treturn this;\n\t}","title":""},{"docid":"99084f594412671d3ee80e8379bb90a7","score":"0.41303924","text":"@Override\n\tpublic SwiftFileSystem newFileSystem(URI uri, Map env) throws IOException {\n\t\tif (cache.containsKey(uri)) throw new FileSystemAlreadyExistsException();\n\t\t\n\t\tSwiftUri swiftUri = new SwiftUri(uri);\n\t\tif (!swiftUri.hasVersion() || !swiftUri.hasTenant()) {\n\t\t\tthrow new IllegalArgumentException(\"URI path needs both a version and a tenant\");\n\t\t}\n\t\tif (swiftUri.hasContainer()) {\n\t\t\tthrow new IllegalArgumentException(\"URI path should only have a version and tenant.\");\n\t\t}\n\t\tif (!swiftUri.getVersion().equals(\"v1\")) throw new IllegalArgumentException(\"This provider only supports version 1\");\n\t\t\n\t\tAccount account;\n\t\tif (env.get(ACCOUNT) != null) {\n\t\t\taccount = (Account) env.get(ACCOUNT);\n\t\t} else {\n\t\t\tAccountFactory accountFactory = new AccountFactory();\n\t\t\t\n\t\t\taccountFactory.setTenantName(swiftUri.getTenant());\n\t\t\taccountFactory.setUsername(uri.getUserInfo());\n\t\t\taccountFactory.setPassword((String) env.get(PASSWORD));\n\t\t\taccountFactory.setAuthUrl((String) env.get(AUTH_URL));\n\t\t\taccountFactory.setSocketTimeout((Integer) env.get(SOCKET_TIMEOUT));\n\t\t\taccountFactory.setPreferredRegion((String) env.get(PREFERRED_REGION));\n\t\t\taccountFactory.setHashPassword((String) env.get(HASH_PASSWORD));\n\t\t\taccountFactory.setAuthenticationMethod(convert((AuthenticationMethod) env.get(AUTHENTICATION_METHOD)));\n\t\t\taccountFactory.setMock((Boolean) env.get(MOCK));\n\t\t\t\n\t\t\taccount = accountFactory.createAccount();\n\t\t}\n\t\t\n\t\tSwiftFileSystem fileSystem = new SwiftFileSystem(this, uri, account);\n\t\tcache.put(uri, fileSystem);\n\t\t\n\t\treturn fileSystem;\n\t}","title":""},{"docid":"959e78d0840d04c5453b935f244a7410","score":"0.41241312","text":"public Api addApi(String path);","title":""},{"docid":"ce2391d217aae8f7cd6015615a757df4","score":"0.412074","text":"default KafkaConsumer createConsumer() {\n return createConsumer(null);\n }","title":""},{"docid":"d4415fed1dc48b02b409d47ef75cd091","score":"0.41193667","text":"@Path(\"/codes_of_conduct\")\npublic interface CodesResource {\n /**\n *\n */\n @Path(\"/{key}\")\n @GET\n @Produces(\"application/json\")\n Response codes_of_conduct_get_conduct_code(@PathParam(\"key\") String key);\n\n /**\n *\n */\n @GET\n @Produces(\"application/json\")\n Response codes_of_conduct_get_all_codes_of_conduct();\n}","title":""},{"docid":"e812d0dc55fc1dc42d04d9fb60181991","score":"0.4117185","text":"private static T readObj(Class clz, String path) {\n T obj = null;\n try {\n FileInputStream fis = new FileInputStream(path);\n ObjectInputStream ois = new ObjectInputStream(fis);\n obj = (T) ois.readObject();\n } catch (Exception e) {\n e.printStackTrace();\n return null;\n }\n return obj;\n }","title":""},{"docid":"96a53ae961ad313b1b00c84897598c72","score":"0.4104437","text":"T messageHandler(Handler handler);","title":""},{"docid":"d6f072d3bcb9b551552622831dc8f950","score":"0.41027266","text":"ConsumerContext getConsumerContext();","title":""},{"docid":"5f907ca3389d4a9a8f4df26030fb4677","score":"0.41004822","text":"ReaderProvider read(URI source) throws IOException;","title":""},{"docid":"be36005907438b96d0e525ee9ce333b0","score":"0.4097442","text":"@PUT\r\n @Consumes(\"application/json\")\r\n public void putJson(String content) {\r\n }","title":""},{"docid":"98bb510d94c719fbc620e71f9da8974d","score":"0.40968266","text":"@PUT\n @Consumes(\"application/json\")\n public void putJson(String content) {\n }","title":""},{"docid":"98bb510d94c719fbc620e71f9da8974d","score":"0.40968266","text":"@PUT\n @Consumes(\"application/json\")\n public void putJson(String content) {\n }","title":""},{"docid":"98bb510d94c719fbc620e71f9da8974d","score":"0.40968266","text":"@PUT\n @Consumes(\"application/json\")\n public void putJson(String content) {\n }","title":""},{"docid":"98bb510d94c719fbc620e71f9da8974d","score":"0.40968266","text":"@PUT\n @Consumes(\"application/json\")\n public void putJson(String content) {\n }","title":""},{"docid":"c4b4c94b6017275de4d4336217fd4573","score":"0.40858695","text":"public JsonPathExpression.Builder jsonpath() {\n return new JsonPathExpression.Builder();\n }","title":""},{"docid":"f5f3939ffed05f2754d79d3421af6051","score":"0.40755507","text":"@Test\n public void testJsonFileHandlerRead() {\n }","title":""},{"docid":"066c93578f4404b79c2feb753d4aec8d","score":"0.4067146","text":"@Test\n public void fromJson() throws IOException {\n\n }","title":""},{"docid":"f9ad764d0c96e637f6b37b214e727233","score":"0.40670472","text":"@Path(\"/\")\npublic interface CAOrderService\n{\n\n\n /**\n * \n * CA create order call.\n * \n * @param headers\n * the headers\n * @param in\n * the data\n * @param delay\n * delay for which the request will wait before being transmitted.\n * @return a response.\n * @throws InterruptedException\n * if the thread sleeps for too long.\n */\n @Path(\"orders\")\n @PUT\n @Consumes(\"application/json;charset=UTF-8\")\n Response createOrder(@Context final HttpHeaders headers, final byte[] in, @DefaultValue(\"0\") @QueryParam(\"delay\") int delay)\n throws InterruptedException;\n\n\n\n\n /**\n * CA order error.\n * \n * @param code\n * If integer param occur, then should return Status code equals param.\n * @return Should return Error Status Code .Method for throwing server error with appropriate status code.\n * @throws Exception\n * on error\n */\n @Path(\"/{a:orders}/{code}\")\n @PUT\n @Consumes(\"application/json;charset=UTF-8\")\n Response createOrderError(@PathParam(\"code\") int code) throws Exception;\n\n}","title":""},{"docid":"48e1fd83aab6674b0126acfa3e522285","score":"0.40619174","text":"public abstract MessageConsumer getConsumer(Destination d, String selector) throws JMSException;","title":""},{"docid":"8261a5f6ae60c7e28f3f3ba35b3adcb6","score":"0.40434596","text":"public TwitterStreamFactory(String configTreePath, StatusListener listener) {\n this(ConfigurationContext.getInstance(configTreePath), listener);\n }","title":""},{"docid":"f42163d0419967900ff7b28cbf45c7a1","score":"0.4039814","text":"public User(final String path) throws IOException, ParseException {\n this.jsonPath = path;\n final JSONParser jsonparser = new JSONParser();\n filereader = new FileReader(jsonPath);\n jsonObject = (JSONObject) jsonparser.parse(filereader);\n\n this.email = this.jsonObject.get(\"email\").toString();\n this.password = this.jsonObject.get(\"password\").toString();\n }","title":""},{"docid":"24bab614bc8fdcf94fb2edab8edfba0e","score":"0.40327075","text":"@Start\n \tpublic void init() {\n \t\tif (this.consumer == null) {\n \t\t\tthis.consumer = this.getConsumerFactory().newConsumer(this.getBaseServiceUri(), this.getFormatType(), this.username, this.password, this.getConsumerVersion());\n \t\t}\n \t}","title":""},{"docid":"f0caeeb3c79069a4d4de95355dfdeab2","score":"0.40319008","text":"JsonPathExpression(String propertyName, String path, Op operator, Object value) {\n super(propertyName);\n this.path = path;\n this.operator = operator;\n this.value = value;\n this.upperValue = null;\n }","title":""},{"docid":"3a1dce87a86dbff425c1be1d089874c5","score":"0.40267032","text":"public Service(String name, String path) {\n this.name = name;\n this.path = path;\n this.api = UUID.randomUUID().toString();\n }","title":""},{"docid":"5005ba9c34eedfa3cd72dd165ca50b66","score":"0.4009974","text":"public GsonStorage(String path) throws DukeFatalException {\n File dataDir = new File(\"data\");\n File reportDir = new File(\"data/reports\");\n\n if (!dataDir.exists()) {\n dataDir.mkdir();\n }\n if (!reportDir.exists()) {\n reportDir.mkdir();\n }\n filePath = path;\n jsonFile = new File(filePath);\n if (!jsonFile.exists()) {\n try {\n if (!jsonFile.createNewFile()) {\n throw new IOException();\n }\n } catch (IOException e) {\n throw new DukeFatalException(\"Unable to setup data file, try checking your permissions?\");\n }\n }\n }","title":""},{"docid":"d2522d18260f5c6d2e16a1bfba53919c","score":"0.40056533","text":"public StringConsumer(final String name, Type type) {\n super(name);\n this.type = type;\n }","title":""},{"docid":"03972d79b11aacfc272f14a4884d709c","score":"0.39928484","text":"public abstract void read(JsonReader jsonReader, Object obj) throws IOException, IllegalAccessException;","title":""},{"docid":"7921e74c80d10b7eee06eeecf008dc7c","score":"0.39923906","text":"public FastJsonObjectProvider(JSONObject object) {\n this.object = object;\n }","title":""},{"docid":"c9761c770c905f16bc68e3ab6ca287d4","score":"0.39918414","text":"public IO(String path) {\r\n\t\tthis.pathfile = path;\r\n\t}","title":""},{"docid":"c978a377a0046352647aa6d15c4e180e","score":"0.39893243","text":"@Override\n\tpublic File fileReader(String path) {\n\t\treturn null;\n\t}","title":""},{"docid":"4f14aa344715cd4c8511b620439e0f8b","score":"0.39871135","text":"void setConverterProvider(JsonConverterProvider converterProdiver);","title":""},{"docid":"4994aff6e3f4e30135f10d3b4ab4ef0d","score":"0.3985671","text":"public InputStream getStream(String path);","title":""},{"docid":"9bf7b6961f7b41daf0e813d1eb62015a","score":"0.39855492","text":"public T createDataSource(final JsonNode json);","title":""},{"docid":"d690cc383d5ae42e716b37d69bf59ced","score":"0.39839077","text":"@Bean\n\tpublic ConsumerFactory consumerFactory() {\n\t\treturn new DefaultKafkaConsumerFactory<>(consumerConfig(), new StringDeserializer(),\n\t\t\t\tnew JsonDeserializer<>(PropertyRequest.class));\n\t}","title":""},{"docid":"ec2a67668af21ba0c4bd451af493081c","score":"0.39815477","text":"public abstract MessageConsumer getConsumer(Destination d) throws JMSException;","title":""},{"docid":"ebb5ccd7a1a7f53c36909e897a7d5017","score":"0.39767691","text":"public interface TrackClient {\n @GET(\"/{path}\")\n Response trackAdProgress(@Path(\"path\") String path);\n}","title":""},{"docid":"ac80595adf77738241b9034af8723895","score":"0.3974836","text":"public CarfDetailProviderImpl(String json){\n super();\n this.json = new String[]{json};\n }","title":""},{"docid":"de93881f5a53e130ae8940e05bd28b31","score":"0.39747265","text":"public ConsumerRequest() {\n }","title":""}],"string":"[\n {\n \"docid\": \"c96913915bc178fae77a7a7bac50e089\",\n \"score\": \"0.8605594\",\n \"text\": \"public static JsonConsumer newConsumer(String path) throws Exception {\\n return JsonStreamSpec.with(path).consumer();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6fcd6155d31fbbb4dfcb3c4641dccb1f\",\n \"score\": \"0.5602896\",\n \"text\": \"public static JsonConsumer newConsumerAndClose(InputStream inputStream) throws Exception {\\n return JsonStreamSpec.with(inputStream).closeOnFinish().consumer();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c0c4b70a2ff82033565097bed155e1c3\",\n \"score\": \"0.54441684\",\n \"text\": \"public static JsonStream stream(String path) throws Exception {\\n return JsonStreamSpec.with(path).stream();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cabe3324029acce2537079cd17ed69d9\",\n \"score\": \"0.5366503\",\n \"text\": \"public static JsonStream stream(Path path) throws Exception {\\n return JsonStreamSpec.with(path).stream();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1789108e2e13c8fd7b62406f5cc9cfbc\",\n \"score\": \"0.52780175\",\n \"text\": \"public static JsonConsumer newConsumerAndClose(JsonParser xmlStreamReader) throws Exception {\\n return JsonStreamSpec.with(xmlStreamReader).closeOnFinish().consumer();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2a19b0c0dc19a3eb101963b81f4f37e8\",\n \"score\": \"0.51260215\",\n \"text\": \"public static void main(String[] args) throws JsonProcessingException {\\n Consumer consumer = new Consumer();\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cbcae58cbd73186e8bf0ff8b830ad48d\",\n \"score\": \"0.50747323\",\n \"text\": \"protected abstract RemoteFileConsumer buildConsumer(Processor processor);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ed7e53eb10114b32a66a4c254dc9ba2c\",\n \"score\": \"0.47944266\",\n \"text\": \"@Test\\n public void testConsumerRoute() throws Exception {\\n RouteBuilder simpleRoute = new RouteBuilder() {\\n @Override\\n public void configure() {\\n from(\\\"direct:getFile\\\")\\n .pollEnrich(\\\"file://src/main/resources/inputs/?include=input.*\\\\\\\\.txt&noop=true&idempotent=true&initialDelay=0\\\")\\n .convertBodyTo(String.class);\\n }\\n };\\n\\n CamelContext camel = new DefaultCamelContext();\\n camel.disableJMX();\\n camel.setStreamCaching(true);\\n camel.addRoutes(simpleRoute);\\n camel.start();\\n\\n String result = camel.createFluentProducerTemplate().to(\\\"direct:getFile\\\").request(String.class);\\n assertEquals(\\\"Hello World\\\\n\\\", result);\\n\\n camel.stop();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fa08a51caa9c8ac9eb4a6ae3adc0433c\",\n \"score\": \"0.47468257\",\n \"text\": \"public static JSONObject getJsonFromFile(String path) {\\n JSONObject json = new JSONObject();\\n\\n try {\\n String s = new String(Files.readAllBytes(Paths.get(JsonDeserializer.class.getResource(path).toURI())));\\n json = new JSONObject(s);\\n } catch (URISyntaxException | IOException e) {\\n e.printStackTrace();\\n }\\n\\n return json;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"51d62b0421e89e43145f8cbdd31290b6\",\n \"score\": \"0.4651697\",\n \"text\": \"JsonReader() {\\n scopes = new int[32];\\n pathNames = new String[32];\\n pathIndices = new int[32];\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4cbc8910241f70759826c72cb8b921cc\",\n \"score\": \"0.46379888\",\n \"text\": \"public CamelRemoteFileBindingModel setConsumer(CamelRemoteFileConsumerBindingModel consumer);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c9533fbdabd780c7206809be906b271\",\n \"score\": \"0.46328765\",\n \"text\": \"@Override\\n public Consumer createConsumer(Processor processor) throws Exception {\\n InputStream is = getResourceAsInputStream();\\n String text = IOHelper.loadText(is);\\n\\n // split each line\\n Stream stream = Arrays.stream(text.split(\\\"\\\\n\\\"));\\n\\n // sort goals scored on minutes\\n stream = stream.sorted((a, b) -> goalTime(a).compareTo(goalTime(b)));\\n\\n // store goals in a list\\n List goals = stream.collect(Collectors.toList());\\n\\n // create consumer with the goals\\n return new GoalConsumer(this, processor, goals);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0d018d900bc2ba86facb6ad60055ec56\",\n \"score\": \"0.46162918\",\n \"text\": \"Consumer getFileConsumer()\\n {\\n return builderFactory.getComponentBuilder().fileConsumer()\\n .setCronExpression(cronExpression)\\n .setScheduledJobGroupName(scheduledGroupName)\\n .setScheduledJobName(scheduledName)\\n .setFilenames(sourceFilenames)\\n .setLogMatchedFilenames(true)\\n .setConfiguredResourceId(fileConsumerConfiguredResourceId)\\n .build();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9b5bea070dac6565d789295c5601f94e\",\n \"score\": \"0.45708606\",\n \"text\": \"void consume(AbstractConsumerManager consumerManager);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"825b1a040294e28bd247e6e3711cc098\",\n \"score\": \"0.45640013\",\n \"text\": \"private JacksonJsonProvider createJsonProvider() {\\n\\t\\tfinal JacksonJsonProvider jsonProvider = new JacksonJsonProvider();\\n\\t\\tjsonProvider.setMapper(new ObjectMapper());\\n\\t\\treturn jsonProvider;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e3c21560aee92a3fbccaeaff6e176b73\",\n \"score\": \"0.44860306\",\n \"text\": \"public Api getApi(String path);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"874741e6598296cfce3b20edbe3c256e\",\n \"score\": \"0.4485891\",\n \"text\": \"public interface JsonRecipe {\\n void write(JsonGenerator generator) throws IOException;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bded3a2b88396696d409d7dd91e4fc2f\",\n \"score\": \"0.4468971\",\n \"text\": \"public void addConsumer(StringConsumer sc) {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"028c7b92384f58bc9f3b14a69b7ce867\",\n \"score\": \"0.4457344\",\n \"text\": \"public void createResource(String path);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4135bb5e8c7e18c9665015d1674940f9\",\n \"score\": \"0.44510487\",\n \"text\": \"private DocumentContext getJsonStringFromFile(String filePath) {\\n String json = null;\\n if (filePath != null && !filePath.isEmpty()) {\\n // Relative path or /server/ means it's a classpath resource\\n if (!filePath.startsWith(\\\"/\\\") || filePath.startsWith(\\\"/server/\\\")) {\\n String path = filePath.startsWith(\\\"/server/\\\") ? filePath.substring(\\\"/server/\\\".length()) : filePath;\\n LOGGER.debug(\\\"Looking for classpath resource : \\\" + path);\\n JsonNode node = getJson(path);\\n if (node != null) {\\n json = node.toString();\\n LOGGER.debug(\\\"Class path json : \\\" + json);\\n }\\n } else {\\n // absolute path\\n LOGGER.debug(\\\"Looking for file: \\\" + filePath);\\n try {\\n json = new String(Files.readAllBytes(Paths.get(filePath)));\\n } catch (Exception e) {\\n LOGGER.debug(\\\"Unexpected exception reading JSON string from file: \\\" + e);\\n }\\n }\\n }\\n if (json == null) {\\n return JsonPath.parse(\\\"{}\\\"); //parse an empty object and set that for the context if the file cannot be loaded for some reason\\n }\\n return JsonPath.parse(json);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"497058f887b5b3ad757ee772059edd39\",\n \"score\": \"0.4394805\",\n \"text\": \"public void loadFromJson(String alias, String path, String schema) throws IOException, ParseException {\\n\\n override(alias, String.format(\\n \\\"%s = LOAD '%s' using JsonLoader('%s');\\\",\\n alias,\\n path,\\n schema\\n // TODO debug why it doesn't work\\n // sb.toString()\\n ));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e2570b33af1ccebb28a5c3f679815605\",\n \"score\": \"0.43755084\",\n \"text\": \"private Consumer createConsumer() {\\n final Properties props = getProperties();\\n final Consumer consumer = new KafkaConsumer<>(props);\\n\\n String topicName = this.connectionBean.getEndpoint().getAddress().split(\\\"/\\\")[1];\\n consumer.subscribe(Collections.singletonList(topicName));\\n return consumer;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2e1493fb0aca147b0424494b3437bd59\",\n \"score\": \"0.43695945\",\n \"text\": \"void resolver_init(String path);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"376ef331bf9feb1a44950a760cf43863\",\n \"score\": \"0.4368315\",\n \"text\": \"@Override\\n public SystemConsumer getConsumer(String systemName, Config config, MetricsRegistry registry) {\\n if (useCachedConsumer && mockConsumer != null) {\\n return mockConsumer;\\n }\\n\\n String jobName = config.get(\\\"job.name\\\");\\n String jobId = config.get(\\\"job.id\\\");\\n if (jobName == null) {\\n throw new ConfigException(\\\"Must define job.name.\\\");\\n }\\n if (jobId == null) {\\n jobId = \\\"1\\\";\\n }\\n String streamName = CoordinatorStreamUtil.getCoordinatorStreamName(jobName, jobId);\\n SystemStreamPartition systemStreamPartition = new SystemStreamPartition(systemName, streamName, new Partition(0));\\n mockConsumer = new MockCoordinatorStreamWrappedConsumer(systemStreamPartition, config);\\n mockConsumer.register(systemStreamPartition, \\\"0\\\");\\n return mockConsumer;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d0a24f2d888c3c08ce4e3fd5654aa8d1\",\n \"score\": \"0.43479154\",\n \"text\": \"public TwitterStreamFactory(String configTreePath) {\\n this(configTreePath, null);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"56453fb1ddafd73940d68ba642d9fa88\",\n \"score\": \"0.43440112\",\n \"text\": \"@GET\\n @Produces(MediaType.APPLICATION_JSON)\\n @Path(\\\"/{id}\\\")\\n public ConsumerType getConsumerType(@PathParam(\\\"id\\\") String id) {\\n ConsumerType toReturn = consumerTypeCurator.find(id);\\n\\n if (toReturn != null) {\\n return toReturn;\\n }\\n\\n throw new NotFoundException(\\n i18n.tr(\\\"ConsumerType with id '\\\" + id + \\\"' could not be found.\\\"));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"be1e745a99d94059cf0e46f5e9bf6ccc\",\n \"score\": \"0.43118382\",\n \"text\": \"public interface UnderFileSystemFactory {\\n\\n /**\\n * Gets whether this factory supports the given path and thus whether calling the\\n * {@link #create(String, Object)} can succeed for this path\\n *\\n * @param path\\n * File path\\n * @param tachyonConf\\n * Tachyon configuration\\n * @return True if the path is supported, false otherwise\\n */\\n public boolean supportsPath(String path, TachyonConf tachyonConf);\\n\\n /**\\n * Creates a client for accessing the given path\\n *\\n * @param path\\n * File path\\n * @param tachyonConf\\n * Tachyon configuration\\n * @param conf\\n * Optional configuration object for the UFS, may be null\\n * @return Client\\n * @throws IllegalArgumentException\\n * Thrown if this factory does not support clients for the given path or if the\\n * configuration provided is insufficient to create a client\\n */\\n public UnderFileSystem create(String path, TachyonConf tachyonConf, Object conf);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dac67b0b49f956a60ae9325d37a45a4b\",\n \"score\": \"0.4306105\",\n \"text\": \"public ClassReader(String path) {\\n\\t\\tcleanPath = PathWorker.getCleanPath(path);\\n\\t\\tclassName = PathWorker.getFileWithoutExt(path);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f33a28765c282618df2e613cb6a8d2b0\",\n \"score\": \"0.4298659\",\n \"text\": \"UriFromPath createUriFromPath();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d9f0f61fd8b1a96a32d3590a19a917a\",\n \"score\": \"0.42985564\",\n \"text\": \"@ResponseStatus(value = HttpStatus.OK)\\n\\t@RequestMapping(value = \\\"{customerGuid}/consumer/{consumerGuid}\\\", produces = {\\\"application/json\\\"}, method = RequestMethod.GET)\\n\\tpublic Consumer getConsumer(\\n\\t\\t\\t@PathVariable(value = \\\"customerGuid\\\") final String customerGuid,\\n\\t\\t\\t@PathVariable(value = \\\"consumerGuid\\\") final String consumerGuid)\\n\\t{\\n\\tLOG.info(\\\"Entering method getConsumer\\\");\\n\\t\\n\\t// check if incoming customer and consumer guid are valid or not\\n\\tisValidGuid(customerGuid, \\\"Customer\\\");\\n\\tisValidGuid(consumerGuid, \\\"Consumer\\\");\\n\\t\\n\\tOptional lookupResult = consumerCassandraRepo.findById(consumerGuid);\\n\\t\\n\\tif(!lookupResult.isPresent()) {\\n\\t\\tLOG.error(\\\"Consumer not found for customer guid {} and consumer guid {}\\\", customerGuid, consumerGuid);\\n\\t\\tthrow new ResourceNotFoundException(\\\"Consumer doesn't exist\\\");\\n\\t}\\n\\t\\n\\tConsumerDTO consumerDtoResponse = lookupResult.get();\\n\\t\\n\\tConsumer consumerResponse = consumerMapper.dtoToConsumer(consumerDtoResponse);\\n\\t\\n\\tLOG.info(\\\"Exiting method getConsumer\\\");\\n\\n\\treturn consumerResponse;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5be58535c514b2e7da06e8a0c59b43d0\",\n \"score\": \"0.42874578\",\n \"text\": \"public JsonReader(String source) {\\r\\n this.source = source;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"271793b5efec6ce3aae2c2df508d2344\",\n \"score\": \"0.42786697\",\n \"text\": \"public static JSONObject getJSONFromFile(String path) {\\n\\t\\tString jsonString = getFileContents(path);\\n\\t\\treturn new JSONObject(jsonString);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"86d7e365db8b044d00a7b74d63f0bc66\",\n \"score\": \"0.42747366\",\n \"text\": \"JsonObjectReader createJsonObjectReader(Reader reader, long initialPosition, int maxObjectLen, Mode mode, Class objectClass) throws IOException;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a9074c0e89c53643d7cab95d1df7ed97\",\n \"score\": \"0.42711365\",\n \"text\": \"void consume(AbstractConsumerManager consumerManager, ITraceContext trace);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"37c6e7efb37b3e9038ece85efbb32e84\",\n \"score\": \"0.42512733\",\n \"text\": \"private Consumer() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e5ab918d80b0a64aa2b4cdccd121a508\",\n \"score\": \"0.42480856\",\n \"text\": \"void handle(Builder builder, Resource config) throws IOException;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"874d670c7c94a15dee42a9220e33ca53\",\n \"score\": \"0.42479023\",\n \"text\": \"@Override\\n\\tString buildRefreshCommand(IPath path) throws JsonGenerationException, JsonMappingException, IOException,\\n\\t\\t\\tURISyntaxException {\\n\\t\\treturn null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e544a12f82868777ef44aebf464a7c11\",\n \"score\": \"0.4234852\",\n \"text\": \"@GetMapping(value = {\\\"/consumeByTime\\\"})\\n public List consumer2ByTime(@RequestParam(\\\"count\\\") Integer count,\\n @RequestParam(\\\"startTime\\\") @DateTimeFormat(iso = ISO.DATE_TIME) ZonedDateTime startTime) {\\n\\n if (count == null) {\\n count = CONSUMER_1_DEFAULT_MESSAGE_FETCH_COUNT;\\n }\\n\\n if (startTime == null) {\\n /* get the current time and subtract some the default hour value */\\n startTime = ZonedDateTime.now().minusHours(DEFAULT_ZONE_TIME_OFFSET);\\n }\\n\\n try {\\n\\n /* create a JetStream instance */\\n JetStream js = connection.jetStream();\\n\\n /* configure the consumer to use DeliverPolicy.ByStartTime.*/\\n ConsumerConfiguration consumerConfig = ConsumerConfiguration.builder()\\n .durable(CONSUME_BY_TIME)\\n .deliverPolicy(DeliverPolicy.ByStartTime)\\n .startTime(startTime)\\n .replayPolicy(ReplayPolicy.Instant)\\n .build();\\n\\n /* create the pull options */\\n PullSubscribeOptions pullOptions = PullSubscribeOptions.builder()\\n .configuration(consumerConfig)\\n .build();\\n\\n /* create the subscription */\\n JetStreamSubscription subscription = js.subscribe(CONSUMER_SUBJECT_1, pullOptions);\\n\\n /* retrieve count message. */\\n List messages = subscription.fetch(count, Duration.ofSeconds(SUBSCRIBER_FETCH_TIMEOUT_IN_SECONDS));\\n\\n /* return a list of formatted messages. */\\n return formatMessages(messages);\\n\\n } catch (IOException | JetStreamApiException ex) {\\n Logger.getLogger(RESTController.class.getName()).log(Level.SEVERE, null, ex);\\n }\\n\\n return null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5bafcd26411464ab0cd7e8368c4156ad\",\n \"score\": \"0.42313275\",\n \"text\": \"public JsonReader(String source) {\\n this.source = source;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5bafcd26411464ab0cd7e8368c4156ad\",\n \"score\": \"0.42313275\",\n \"text\": \"public JsonReader(String source) {\\n this.source = source;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5bafcd26411464ab0cd7e8368c4156ad\",\n \"score\": \"0.42313275\",\n \"text\": \"public JsonReader(String source) {\\n this.source = source;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5bafcd26411464ab0cd7e8368c4156ad\",\n \"score\": \"0.42313275\",\n \"text\": \"public JsonReader(String source) {\\n this.source = source;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"059ad6a967e1cf103a0c43723cae5022\",\n \"score\": \"0.42298228\",\n \"text\": \"@ConstructorProperties({\\\"scheme\\\", \\\"stringPath\\\", \\\"sinkMode\\\"})\\n public Hfs( Scheme scheme, String stringPath, SinkMode sinkMode )\\n {\\n super( scheme, sinkMode );\\n setStringPath( stringPath );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6f34419d20eb80989efe3c64b2391d42\",\n \"score\": \"0.42283273\",\n \"text\": \"@Bean\\r\\n\\tpublic ConsumerFactory userConsumerFactory() {\\r\\n\\t\\tMap config = new HashMap();\\r\\n\\r\\n\\t\\tconfig.put(ConsumerConfig.BOOTSTRAP_SERVERS_CONFIG, \\\"127.0.0.1:9092\\\");\\r\\n\\t\\tconfig.put(ConsumerConfig.GROUP_ID_CONFIG, \\\"group_json\\\");\\r\\n\\t\\tconfig.put(ConsumerConfig.KEY_DESERIALIZER_CLASS_CONFIG, StringDeserializer.class);\\r\\n\\t\\tconfig.put(ConsumerConfig.VALUE_DESERIALIZER_CLASS_CONFIG, JsonDeserializer.class);\\r\\n\\t\\treturn new DefaultKafkaConsumerFactory(config, new StringDeserializer(), new JsonDeserializer(User.class));\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"63bf4fb8cd82bacd99a7f294617346ce\",\n \"score\": \"0.42271593\",\n \"text\": \"public T Parse(String path) throws IOException;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"31231d3566faa1bf4ce66339630241fd\",\n \"score\": \"0.4223445\",\n \"text\": \"@ConstructorProperties({\\\"scheme\\\", \\\"stringPath\\\"})\\n public Hfs( Scheme scheme, String stringPath )\\n {\\n super( scheme );\\n setStringPath( stringPath );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3cc2f64387f7d62dfdc34593748dbb56\",\n \"score\": \"0.42205244\",\n \"text\": \"static public ContentHandleFactory newFactory() {\\n return new ContentHandleFactory() {\\n @Override\\n public Class[] getHandledClasses() {\\n return new Class[]{ JsonParser.class };\\n }\\n @Override\\n public boolean isHandled(Class type) {\\n return JsonParser.class.isAssignableFrom(type);\\n }\\n @Override\\n public ContentHandle newHandle(Class type) {\\n @SuppressWarnings(\\\"unchecked\\\")\\n ContentHandle handle = isHandled(type) ?\\n (ContentHandle) new JacksonParserHandle() : null;\\n return handle;\\n }\\n };\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"672f8e8b3b36622a2b9e74ff36c3a7c5\",\n \"score\": \"0.42023748\",\n \"text\": \"@Path(\\\"/configurations\\\")\\npublic interface ConfigurationWebApi {\\n\\n @GET\\n @Path(\\\"{path:.*}\\\")\\n @Produces(MediaType.APPLICATION_JSON)\\n String read(@PathParam(\\\"path\\\") String path);\\n\\n @POST\\n @Path(\\\"{path:.*}\\\")\\n @Consumes(MediaType.APPLICATION_JSON)\\n void write(@PathParam(\\\"path\\\") String path, String data);\\n\\n @PUT\\n @Path(\\\"{path:.*}\\\")\\n @Consumes(MediaType.APPLICATION_JSON)\\n void overwrite(@PathParam(\\\"path\\\") String path, String data);\\n\\n @DELETE\\n @Path(\\\"{path:.*}\\\")\\n void delete(@PathParam(\\\"path\\\") String path);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bec70a60d84e8ce386d8bc7a0db30db2\",\n \"score\": \"0.41958597\",\n \"text\": \"public static Json queryMetaJson(String path) throws IOException {\\n\\t\\treturn invokeWithFallbacks((service, arg) -> Json.read(Utils.readString(new URL(service.meta + arg))), path);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fd74966dbadb639879d9620def0f1e89\",\n \"score\": \"0.4192363\",\n \"text\": \"public void parseFunction(Path path) {\\n\\t\\t\\t\\t\\n\\t\\tJSONParser jsonParser = new JSONParser();\\n\\n\\t\\ttry (BufferedReader reader = Files.newBufferedReader(path, Charset.forName(\\\"UTF-8\\\"))) {\\n\\t\\t\\t\\n\\t\\t\\tJSONObject singleSongObject = (JSONObject) jsonParser.parse(reader);\\n\\n\\t\\t\\t// save as a single song object\\n\\t\\t\\tSong song = new Song(singleSongObject);\\n\\n\\t\\t\\t// invoke in threadSafeMusicLibrary and invoke the inherited addSong method by calling super.addSong() from super class - musicLibrary to add song\\t\\t\\t\\n\\t\\t\\tthreadSafeML.addSong(song);\\n\\t\\t\\t\\n\\t\\t} \\n\\t\\tcatch (IOException e) {\\n\\t\\t\\tSystem.out.println(e);\\n\\t\\t} \\n\\t\\tcatch (ParseException e) {\\n\\n\\t\\t\\tSystem.out.println(e);\\n\\t\\t}\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0aac1f68800e8d1493e871401d7eda53\",\n \"score\": \"0.4187114\",\n \"text\": \"public synchronized void asObject(Path outpath) throws IOException, InterruptedException {\\n\\t\\tFiles.createFile(outpath);\\n\\t\\tnew IndexJSONWriter().asObject(this, outpath);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"435e10352c0c3a2cadb1081643b01d00\",\n \"score\": \"0.4185477\",\n \"text\": \"public ReadableFile create(Path path) {\\n return new ReadableFileImpl(path);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7ccbf8ce794993236bd4b8facd27f791\",\n \"score\": \"0.41809475\",\n \"text\": \"public FileStream getFile( final String _path ) ;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"71311f9b22d39c4842601d75911f3c35\",\n \"score\": \"0.41769528\",\n \"text\": \"public JsonParser map(final String path, final Class target) {\\n\\t\\treturn null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a1de1c6ca379a5a79c6e6c90941255b8\",\n \"score\": \"0.41766956\",\n \"text\": \"public UnderFileSystem create(String path, TachyonConf tachyonConf, Object conf);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ca60b66d888d6f0579a5a3372b890b6d\",\n \"score\": \"0.41693562\",\n \"text\": \"@Override\\n public void onReceiveRequest(ClientRequest req) {\\n mProcessor.readPath(req);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e64a513da2613ad560851d4d3e4c278\",\n \"score\": \"0.4160137\",\n \"text\": \"public interface IPodsAsyncPathHandler extends IPodserviceEntityHandler\\n{\\n /**\\n * get /pods\\n * No summary given.\\n * \\n * @param _consumer A consumer into which responses may be passed.\\n * @param cursor No summary given.\\n * @param limit No summary given.\\n * @throws JapiException If the method cannot be called\\n */\\n void handleGet(\\n @Nonnull IConsumer _consumer,\\n @Nullable Cursor cursor,\\n @Nullable CursorLimit limit\\n\\t\\n ) throws JapiException;\\n \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"826e589a4e8e94930002bd5cf114194c\",\n \"score\": \"0.4149347\",\n \"text\": \"public void init() {\\n if (this.segments == null) {\\n if (\\\"*\\\".equals(this.path)) {\\n this.segments = new Segement[]{WildCardSegement.instance};\\n } else {\\n this.segments = new JSONPathParser(this.path).explain();\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"106f858fc3859bdeb44fa8cdc0170333\",\n \"score\": \"0.41420442\",\n \"text\": \"@Override\\n\\tpublic abstract T getResourceByPath(String path);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f6ac1b0a7bfe5bffe464040531fdb784\",\n \"score\": \"0.41418427\",\n \"text\": \"public ResourceStreamInfo(String contentType, ServletContext context,\\r\\n String path) {\\r\\n this.contentType = contentType;\\r\\n this.context = context;\\r\\n this.path = path;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"62916a61bca27312748795fde28ef8ee\",\n \"score\": \"0.41397694\",\n \"text\": \"@Test\\n public void testWriteMultipleJSONDocsFromFactory() throws KeyManagementException, NoSuchAlgorithmException, Exception {\\n String docId[] = { \\\"/a.json\\\", \\\"/b.json\\\", \\\"/c.json\\\" };\\n String json1 = new String(\\\"{\\\\\\\"animal\\\\\\\":\\\\\\\"dog\\\\\\\", \\\\\\\"says\\\\\\\":\\\\\\\"woof\\\\\\\"}\\\");\\n String json2 = new String(\\\"{\\\\\\\"animal\\\\\\\":\\\\\\\"cat\\\\\\\", \\\\\\\"says\\\\\\\":\\\\\\\"meow\\\\\\\"}\\\");\\n String json3 = new String(\\\"{\\\\\\\"animal\\\\\\\":\\\\\\\"rat\\\\\\\", \\\\\\\"says\\\\\\\":\\\\\\\"keek\\\\\\\"}\\\");\\n\\n JsonFactory f = new JsonFactory();\\n\\n JSONDocumentManager docMgr = client.newJSONDocumentManager();\\n docMgr.setMetadataCategories(Metadata.ALL);\\n DocumentWriteSet writeset = docMgr.newWriteSet();\\n\\n // Create a content Factory from JacksonDatabindHandle that will handle\\n // writes.\\n ContentHandleFactory ch = JacksonParserHandle.newFactory();\\n\\n // Instantiate a handle.\\n JacksonParserHandle jacksonParserHandle1 = (JacksonParserHandle) ch.newHandle(JsonParser.class);\\n JacksonParserHandle jacksonParserHandle2 = (JacksonParserHandle) ch.newHandle(JsonParser.class);\\n JacksonParserHandle jacksonParserHandle3 = (JacksonParserHandle) ch.newHandle(JsonParser.class);\\n\\n jacksonParserHandle1.set(f.createParser(json1));\\n jacksonParserHandle2.set(f.createParser(json2));\\n jacksonParserHandle3.set(f.createParser(json3));\\n\\n writeset.add(docId[0], jacksonParserHandle1);\\n writeset.add(docId[1], jacksonParserHandle2);\\n writeset.add(docId[2], jacksonParserHandle3);\\n\\n docMgr.write(writeset);\\n\\n // Using JacksonHandle to read back from database.\\n JacksonHandle jacksonhandle = new JacksonHandle();\\n docMgr.read(docId[0], jacksonhandle);\\n JSONAssert.assertEquals(json1, jacksonhandle.toString(), true);\\n\\n docMgr.read(docId[1], jacksonhandle);\\n JSONAssert.assertEquals(json2, jacksonhandle.toString(), true);\\n\\n docMgr.read(docId[2], jacksonhandle);\\n JSONAssert.assertEquals(json3, jacksonhandle.toString(), true);\\n // Close handles.\\n jacksonParserHandle1.close();\\n jacksonParserHandle2.close();\\n jacksonParserHandle3.close();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ad2ea2c7684b30d5e2b0f4f26d9e7c5\",\n \"score\": \"0.41365927\",\n \"text\": \"public HttpClientRequestActionBuilder get(String path) {\\n return request(HttpMethod.GET, path);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c6cd6152f4b7b9286d65af68c24a5953\",\n \"score\": \"0.4136016\",\n \"text\": \"public JsonProperty addPath(String path) {\\n\\t\\tthis.paths.add(new JsonPath(path, JsonPath.PathType.STRING));\\n\\t\\treturn this;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"99084f594412671d3ee80e8379bb90a7\",\n \"score\": \"0.41303924\",\n \"text\": \"@Override\\n\\tpublic SwiftFileSystem newFileSystem(URI uri, Map env) throws IOException {\\n\\t\\tif (cache.containsKey(uri)) throw new FileSystemAlreadyExistsException();\\n\\t\\t\\n\\t\\tSwiftUri swiftUri = new SwiftUri(uri);\\n\\t\\tif (!swiftUri.hasVersion() || !swiftUri.hasTenant()) {\\n\\t\\t\\tthrow new IllegalArgumentException(\\\"URI path needs both a version and a tenant\\\");\\n\\t\\t}\\n\\t\\tif (swiftUri.hasContainer()) {\\n\\t\\t\\tthrow new IllegalArgumentException(\\\"URI path should only have a version and tenant.\\\");\\n\\t\\t}\\n\\t\\tif (!swiftUri.getVersion().equals(\\\"v1\\\")) throw new IllegalArgumentException(\\\"This provider only supports version 1\\\");\\n\\t\\t\\n\\t\\tAccount account;\\n\\t\\tif (env.get(ACCOUNT) != null) {\\n\\t\\t\\taccount = (Account) env.get(ACCOUNT);\\n\\t\\t} else {\\n\\t\\t\\tAccountFactory accountFactory = new AccountFactory();\\n\\t\\t\\t\\n\\t\\t\\taccountFactory.setTenantName(swiftUri.getTenant());\\n\\t\\t\\taccountFactory.setUsername(uri.getUserInfo());\\n\\t\\t\\taccountFactory.setPassword((String) env.get(PASSWORD));\\n\\t\\t\\taccountFactory.setAuthUrl((String) env.get(AUTH_URL));\\n\\t\\t\\taccountFactory.setSocketTimeout((Integer) env.get(SOCKET_TIMEOUT));\\n\\t\\t\\taccountFactory.setPreferredRegion((String) env.get(PREFERRED_REGION));\\n\\t\\t\\taccountFactory.setHashPassword((String) env.get(HASH_PASSWORD));\\n\\t\\t\\taccountFactory.setAuthenticationMethod(convert((AuthenticationMethod) env.get(AUTHENTICATION_METHOD)));\\n\\t\\t\\taccountFactory.setMock((Boolean) env.get(MOCK));\\n\\t\\t\\t\\n\\t\\t\\taccount = accountFactory.createAccount();\\n\\t\\t}\\n\\t\\t\\n\\t\\tSwiftFileSystem fileSystem = new SwiftFileSystem(this, uri, account);\\n\\t\\tcache.put(uri, fileSystem);\\n\\t\\t\\n\\t\\treturn fileSystem;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"959e78d0840d04c5453b935f244a7410\",\n \"score\": \"0.41241312\",\n \"text\": \"public Api addApi(String path);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ce2391d217aae8f7cd6015615a757df4\",\n \"score\": \"0.412074\",\n \"text\": \"default KafkaConsumer createConsumer() {\\n return createConsumer(null);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d4415fed1dc48b02b409d47ef75cd091\",\n \"score\": \"0.41193667\",\n \"text\": \"@Path(\\\"/codes_of_conduct\\\")\\npublic interface CodesResource {\\n /**\\n *\\n */\\n @Path(\\\"/{key}\\\")\\n @GET\\n @Produces(\\\"application/json\\\")\\n Response codes_of_conduct_get_conduct_code(@PathParam(\\\"key\\\") String key);\\n\\n /**\\n *\\n */\\n @GET\\n @Produces(\\\"application/json\\\")\\n Response codes_of_conduct_get_all_codes_of_conduct();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e812d0dc55fc1dc42d04d9fb60181991\",\n \"score\": \"0.4117185\",\n \"text\": \"private static T readObj(Class clz, String path) {\\n T obj = null;\\n try {\\n FileInputStream fis = new FileInputStream(path);\\n ObjectInputStream ois = new ObjectInputStream(fis);\\n obj = (T) ois.readObject();\\n } catch (Exception e) {\\n e.printStackTrace();\\n return null;\\n }\\n return obj;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"96a53ae961ad313b1b00c84897598c72\",\n \"score\": \"0.4104437\",\n \"text\": \"T messageHandler(Handler handler);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d6f072d3bcb9b551552622831dc8f950\",\n \"score\": \"0.41027266\",\n \"text\": \"ConsumerContext getConsumerContext();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5f907ca3389d4a9a8f4df26030fb4677\",\n \"score\": \"0.41004822\",\n \"text\": \"ReaderProvider read(URI source) throws IOException;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"be36005907438b96d0e525ee9ce333b0\",\n \"score\": \"0.4097442\",\n \"text\": \"@PUT\\r\\n @Consumes(\\\"application/json\\\")\\r\\n public void putJson(String content) {\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"98bb510d94c719fbc620e71f9da8974d\",\n \"score\": \"0.40968266\",\n \"text\": \"@PUT\\n @Consumes(\\\"application/json\\\")\\n public void putJson(String content) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"98bb510d94c719fbc620e71f9da8974d\",\n \"score\": \"0.40968266\",\n \"text\": \"@PUT\\n @Consumes(\\\"application/json\\\")\\n public void putJson(String content) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"98bb510d94c719fbc620e71f9da8974d\",\n \"score\": \"0.40968266\",\n \"text\": \"@PUT\\n @Consumes(\\\"application/json\\\")\\n public void putJson(String content) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"98bb510d94c719fbc620e71f9da8974d\",\n \"score\": \"0.40968266\",\n \"text\": \"@PUT\\n @Consumes(\\\"application/json\\\")\\n public void putJson(String content) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c4b4c94b6017275de4d4336217fd4573\",\n \"score\": \"0.40858695\",\n \"text\": \"public JsonPathExpression.Builder jsonpath() {\\n return new JsonPathExpression.Builder();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f5f3939ffed05f2754d79d3421af6051\",\n \"score\": \"0.40755507\",\n \"text\": \"@Test\\n public void testJsonFileHandlerRead() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"066c93578f4404b79c2feb753d4aec8d\",\n \"score\": \"0.4067146\",\n \"text\": \"@Test\\n public void fromJson() throws IOException {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f9ad764d0c96e637f6b37b214e727233\",\n \"score\": \"0.40670472\",\n \"text\": \"@Path(\\\"/\\\")\\npublic interface CAOrderService\\n{\\n\\n\\n /**\\n * \\n * CA create order call.\\n * \\n * @param headers\\n * the headers\\n * @param in\\n * the data\\n * @param delay\\n * delay for which the request will wait before being transmitted.\\n * @return a response.\\n * @throws InterruptedException\\n * if the thread sleeps for too long.\\n */\\n @Path(\\\"orders\\\")\\n @PUT\\n @Consumes(\\\"application/json;charset=UTF-8\\\")\\n Response createOrder(@Context final HttpHeaders headers, final byte[] in, @DefaultValue(\\\"0\\\") @QueryParam(\\\"delay\\\") int delay)\\n throws InterruptedException;\\n\\n\\n\\n\\n /**\\n * CA order error.\\n * \\n * @param code\\n * If integer param occur, then should return Status code equals param.\\n * @return Should return Error Status Code .Method for throwing server error with appropriate status code.\\n * @throws Exception\\n * on error\\n */\\n @Path(\\\"/{a:orders}/{code}\\\")\\n @PUT\\n @Consumes(\\\"application/json;charset=UTF-8\\\")\\n Response createOrderError(@PathParam(\\\"code\\\") int code) throws Exception;\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"48e1fd83aab6674b0126acfa3e522285\",\n \"score\": \"0.40619174\",\n \"text\": \"public abstract MessageConsumer getConsumer(Destination d, String selector) throws JMSException;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8261a5f6ae60c7e28f3f3ba35b3adcb6\",\n \"score\": \"0.40434596\",\n \"text\": \"public TwitterStreamFactory(String configTreePath, StatusListener listener) {\\n this(ConfigurationContext.getInstance(configTreePath), listener);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f42163d0419967900ff7b28cbf45c7a1\",\n \"score\": \"0.4039814\",\n \"text\": \"public User(final String path) throws IOException, ParseException {\\n this.jsonPath = path;\\n final JSONParser jsonparser = new JSONParser();\\n filereader = new FileReader(jsonPath);\\n jsonObject = (JSONObject) jsonparser.parse(filereader);\\n\\n this.email = this.jsonObject.get(\\\"email\\\").toString();\\n this.password = this.jsonObject.get(\\\"password\\\").toString();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"24bab614bc8fdcf94fb2edab8edfba0e\",\n \"score\": \"0.40327075\",\n \"text\": \"@Start\\n \\tpublic void init() {\\n \\t\\tif (this.consumer == null) {\\n \\t\\t\\tthis.consumer = this.getConsumerFactory().newConsumer(this.getBaseServiceUri(), this.getFormatType(), this.username, this.password, this.getConsumerVersion());\\n \\t\\t}\\n \\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f0caeeb3c79069a4d4de95355dfdeab2\",\n \"score\": \"0.40319008\",\n \"text\": \"JsonPathExpression(String propertyName, String path, Op operator, Object value) {\\n super(propertyName);\\n this.path = path;\\n this.operator = operator;\\n this.value = value;\\n this.upperValue = null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3a1dce87a86dbff425c1be1d089874c5\",\n \"score\": \"0.40267032\",\n \"text\": \"public Service(String name, String path) {\\n this.name = name;\\n this.path = path;\\n this.api = UUID.randomUUID().toString();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5005ba9c34eedfa3cd72dd165ca50b66\",\n \"score\": \"0.4009974\",\n \"text\": \"public GsonStorage(String path) throws DukeFatalException {\\n File dataDir = new File(\\\"data\\\");\\n File reportDir = new File(\\\"data/reports\\\");\\n\\n if (!dataDir.exists()) {\\n dataDir.mkdir();\\n }\\n if (!reportDir.exists()) {\\n reportDir.mkdir();\\n }\\n filePath = path;\\n jsonFile = new File(filePath);\\n if (!jsonFile.exists()) {\\n try {\\n if (!jsonFile.createNewFile()) {\\n throw new IOException();\\n }\\n } catch (IOException e) {\\n throw new DukeFatalException(\\\"Unable to setup data file, try checking your permissions?\\\");\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d2522d18260f5c6d2e16a1bfba53919c\",\n \"score\": \"0.40056533\",\n \"text\": \"public StringConsumer(final String name, Type type) {\\n super(name);\\n this.type = type;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"03972d79b11aacfc272f14a4884d709c\",\n \"score\": \"0.39928484\",\n \"text\": \"public abstract void read(JsonReader jsonReader, Object obj) throws IOException, IllegalAccessException;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7921e74c80d10b7eee06eeecf008dc7c\",\n \"score\": \"0.39923906\",\n \"text\": \"public FastJsonObjectProvider(JSONObject object) {\\n this.object = object;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c9761c770c905f16bc68e3ab6ca287d4\",\n \"score\": \"0.39918414\",\n \"text\": \"public IO(String path) {\\r\\n\\t\\tthis.pathfile = path;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c978a377a0046352647aa6d15c4e180e\",\n \"score\": \"0.39893243\",\n \"text\": \"@Override\\n\\tpublic File fileReader(String path) {\\n\\t\\treturn null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4f14aa344715cd4c8511b620439e0f8b\",\n \"score\": \"0.39871135\",\n \"text\": \"void setConverterProvider(JsonConverterProvider converterProdiver);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4994aff6e3f4e30135f10d3b4ab4ef0d\",\n \"score\": \"0.3985671\",\n \"text\": \"public InputStream getStream(String path);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9bf7b6961f7b41daf0e813d1eb62015a\",\n \"score\": \"0.39855492\",\n \"text\": \"public T createDataSource(final JsonNode json);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d690cc383d5ae42e716b37d69bf59ced\",\n \"score\": \"0.39839077\",\n \"text\": \"@Bean\\n\\tpublic ConsumerFactory consumerFactory() {\\n\\t\\treturn new DefaultKafkaConsumerFactory<>(consumerConfig(), new StringDeserializer(),\\n\\t\\t\\t\\tnew JsonDeserializer<>(PropertyRequest.class));\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ec2a67668af21ba0c4bd451af493081c\",\n \"score\": \"0.39815477\",\n \"text\": \"public abstract MessageConsumer getConsumer(Destination d) throws JMSException;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ebb5ccd7a1a7f53c36909e897a7d5017\",\n \"score\": \"0.39767691\",\n \"text\": \"public interface TrackClient {\\n @GET(\\\"/{path}\\\")\\n Response trackAdProgress(@Path(\\\"path\\\") String path);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ac80595adf77738241b9034af8723895\",\n \"score\": \"0.3974836\",\n \"text\": \"public CarfDetailProviderImpl(String json){\\n super();\\n this.json = new String[]{json};\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"de93881f5a53e130ae8940e05bd28b31\",\n \"score\": \"0.39747265\",\n \"text\": \"public ConsumerRequest() {\\n }\",\n \"title\": \"\"\n }\n]"}}},{"rowIdx":93,"cells":{"query_id":{"kind":"string","value":"1d3f798f34a85829293372349c4ce375"},"query":{"kind":"string","value":"/ Unable to fully structure code Enabled aggressive block sorting Lifted jumps to return sites"},"positive_passages":{"kind":"list like","value":[{"docid":"64a97fbd511bd5919b08f34bc6918be3","score":"0.0","text":"@Override\n protected boolean showOrClearStorageErrorPopup(StorageController.StorageState var1) {\n var2_2 = -1;\n var3_3 = R.string.cam_strings_error_memory_title_txt;\n if (this.isCurrentStorageExternal()) {\n switch (.$SwitchMap$com$sonyericsson$cameracommon$mediasaving$StorageController$StorageState[this.getCurrentStorageState().ordinal()]) {\n case 1: {\n this.closeDialog(true);\n ** break;\n }\n case 2: {\n var2_2 = R.string.cam_strings_error_internal_sd_full_txt;\n }\nlbl10: // 3 sources:\n default: {\n return this.showStoragePopup(var2_2, var3_3, true);\n }\n case 3: \n case 4: \n }\n var2_2 = R.string.cam_strings_error_memory_unavailable_txt;\n return this.showStoragePopup(var2_2, var3_3, true);\n }\n switch (.$SwitchMap$com$sonyericsson$cameracommon$mediasaving$StorageController$StorageState[this.getCurrentStorageState().ordinal()]) {\n default: {\n return this.showStoragePopup(var2_2, var3_3, true);\n }\n case 1: {\n this.closeDialog(true);\n return this.showStoragePopup(var2_2, var3_3, true);\n }\n case 2: {\n var2_2 = R.string.cam_strings_error_internal_sd_full_txt;\n return this.showStoragePopup(var2_2, var3_3, true);\n }\n case 3: \n case 4: \n }\n var2_2 = R.string.cam_strings_error_memory_ims_unavailable_txt;\n return this.showStoragePopup(var2_2, var3_3, true);\n }","title":""}],"string":"[\n {\n \"docid\": \"64a97fbd511bd5919b08f34bc6918be3\",\n \"score\": \"0.0\",\n \"text\": \"@Override\\n protected boolean showOrClearStorageErrorPopup(StorageController.StorageState var1) {\\n var2_2 = -1;\\n var3_3 = R.string.cam_strings_error_memory_title_txt;\\n if (this.isCurrentStorageExternal()) {\\n switch (.$SwitchMap$com$sonyericsson$cameracommon$mediasaving$StorageController$StorageState[this.getCurrentStorageState().ordinal()]) {\\n case 1: {\\n this.closeDialog(true);\\n ** break;\\n }\\n case 2: {\\n var2_2 = R.string.cam_strings_error_internal_sd_full_txt;\\n }\\nlbl10: // 3 sources:\\n default: {\\n return this.showStoragePopup(var2_2, var3_3, true);\\n }\\n case 3: \\n case 4: \\n }\\n var2_2 = R.string.cam_strings_error_memory_unavailable_txt;\\n return this.showStoragePopup(var2_2, var3_3, true);\\n }\\n switch (.$SwitchMap$com$sonyericsson$cameracommon$mediasaving$StorageController$StorageState[this.getCurrentStorageState().ordinal()]) {\\n default: {\\n return this.showStoragePopup(var2_2, var3_3, true);\\n }\\n case 1: {\\n this.closeDialog(true);\\n return this.showStoragePopup(var2_2, var3_3, true);\\n }\\n case 2: {\\n var2_2 = R.string.cam_strings_error_internal_sd_full_txt;\\n return this.showStoragePopup(var2_2, var3_3, true);\\n }\\n case 3: \\n case 4: \\n }\\n var2_2 = R.string.cam_strings_error_memory_ims_unavailable_txt;\\n return this.showStoragePopup(var2_2, var3_3, true);\\n }\",\n \"title\": \"\"\n }\n]"},"negative_passages":{"kind":"list like","value":[{"docid":"ea97cf060879cffc1b7bef111f282d29","score":"0.6016002","text":"final void fallbackSortImpl(int nblock) {\n final int[] ftab = new int[257];\n int H, i, j, k, lo, hi, cc, cc1;\n int nNotDone;\n int nBhtab;\n final int[] eclass = getEclass();\n\n for (i = 0; i < nblock; i++) {\n eclass[i] = 0;\n }\n /*--\n LBZ2: Initial 1-char radix sort to generate\n initial fmap and initial BH bits.\n --*/\n for (i = 0; i < nblock; i++) {\n ftab[data.block[i] & 0xff]++;\n }\n for (i = 1; i < 257; i++) {\n ftab[i] += ftab[i - 1];\n }\n\n for (i = 0; i < nblock; i++) {\n j = data.block[i] & 0xff;\n k = ftab[j] - 1;\n ftab[j] = k;\n data.fmap[k] = i;\n }\n\n nBhtab = 64 + nblock;\n final BitSet bhtab = new BitSet(nBhtab);\n for (i = 0; i < 256; i++) {\n bhtab.set(ftab[i]);\n }\n\n /*--\n LBZ2: Inductively refine the buckets. Kind-of an\n \"exponential radix sort\" (!), inspired by the\n Manber-Myers suffix array construction algorithm.\n --*/\n\n /*-- LBZ2: set sentinel bits for block-end detection --*/\n for (i = 0; i < 32; i++) {\n bhtab.set(nblock + 2 * i);\n bhtab.clear(nblock + 2 * i + 1);\n }\n\n /*-- LBZ2: the log(N) loop --*/\n H = 1;\n while (true) {\n\n j = 0;\n for (i = 0; i < nblock; i++) {\n if (bhtab.get(i)) {\n j = i;\n }\n k = data.fmap[i] - H;\n if (k < 0) {\n k += nblock;\n }\n eclass[k] = j;\n }\n\n nNotDone = 0;\n hi = -1;\n while (true) {\n\n /*-- LBZ2: find the next non-singleton bucket --*/\n k = hi + 1;\n k = bhtab.nextClearBit(k);\n lo = k - 1;\n if (lo >= nblock) {\n break;\n }\n k = bhtab.nextSetBit(k + 1);\n hi = k - 1;\n if (hi >= nblock) {\n break;\n }\n\n /*-- LBZ2: now [lo, hi] bracket current bucket --*/\n if (hi > lo) {\n nNotDone += hi - lo + 1;\n fallbackQSort3(eclass, lo, hi);\n\n /*-- LBZ2: scan bucket and generate header bits-- */\n cc = -1;\n for (i = lo; i <= hi; i++) {\n cc1 = eclass[data.fmap[i]];\n if (cc != cc1) {\n bhtab.set(i);\n cc = cc1;\n }\n }\n }\n }\n\n H *= 2;\n if (H > nblock || nNotDone == 0) {\n break;\n }\n }\n }","title":""},{"docid":"7319ceb9d04e6561df45960edae22b5f","score":"0.5820456","text":"public n a(q var1_1, I var2_2, am var3_3, am var4_4, gv var5_5) {\n block11 : {\n var32_6 = fj.z;\n var6_7 = var5_5.a();\n var7_8 = var5_5.b();\n var9_9 = new n(new t(0.0, 0.0), var1_1);\n var9_9.a(6.283185307179586 - this.d);\n var10_10 = ae.a(var2_2, var3_3, var4_4, 0.0);\n if (var10_10.h() >= 2 && (var10_10.h() != 2 || t.a(var10_10.c(), var10_10.d()) >= 1.0E-4)) ** GOTO lbl17\n if (var10_10.h() >= 2) ** GOTO lbl-1000\n var11_11 = var9_9.h();\n var9_9.e(var3_3.getX() + var11_11.a * 0.5, var3_3.getY() + var11_11.b * 0.5);\n if (var32_6) lbl-1000: // 2 sources:\n {\n var11_12 = var10_10.c();\n var9_9.e(var11_12.a, var11_12.b);\n }\n if (this.d() == false) return var9_9;\n ae.b(var9_9);\n return var9_9;\nlbl17: // 1 sources:\n if (var6_7 < 0) {\n var11_13 = Math.max(0, var10_10.h() - 1 + var6_7);\n if (!var32_6) break block11;\n }\n var11_14 = Math.min(var10_10.h() - 2, var6_7);\n }\n if ((var12_15 = var10_10.a(var11_14)) == null) {\n var13_16 = var9_9.h();\n var9_9.e(var3_3.getX() + var13_16.a * 0.5, var3_3.getY() + var13_16.b * 0.5);\n if (this.d() == false) return var9_9;\n ae.b(var9_9);\n return var9_9;\n }\n var13_17 = var12_15.c();\n var14_18 = var12_15.d();\n if (var12_15.g() != 0.0) ** GOTO lbl39\n var15_19 = var3_3.getX() + var3_3.getWidth() * 0.5 + var2_2.getSourcePoint().a - (var4_4.getX() + var4_4.getWidth() * 0.5 + var2_2.getTargetPoint().a);\n var17_20 = var3_3.getY() + var3_3.getHeight() * 0.5 + var2_2.getSourcePoint().b - (var4_4.getY() + var4_4.getHeight() * 0.5 + var2_2.getTargetPoint().b);\n if (var15_19 != 0.0 || var17_20 != 0.0) ** GOTO lbl-1000\n var14_18 = new t(var13_17.a + 1.0E-6, var13_17.b);\n if (var32_6) lbl-1000: // 2 sources:\n {\n var19_22 = Math.sqrt(var15_19 * var15_19 + var17_20 * var17_20);\n var14_18 = new t(var13_17.a + 1.0E-6 * var15_19 / var19_22, var13_17.b + 1.0E-6 * var17_20 / var19_22);\n }\n var12_15 = new m(var13_17, var14_18);\nlbl39: // 2 sources:\n if (this.b) {\n var9_9.a(ik.c(z.d(var12_15.i(), ik.g) - this.d));\n }\n var15_19 = Math.abs(var5_5.c());\n var17_21 = new n(var9_9);\n this.a(var17_21, var12_15, var13_17, var15_19);\n if (var11_14 == 0 && this.a(var3_3, var17_21)) {\n this.b(var17_21, var12_15, var3_3, var15_19);\n }\n var18_25 = new n(var9_9);\n this.a(var18_25, var12_15, var14_18, var15_19);\n if (var11_14 >= var10_10.h() - 2 && this.a(var4_4, var18_25)) {\n this.a(var18_25, var12_15, var4_4, var15_19);\n }\n if (t.a(var17_21.a(), var18_25.a()) < 1.0E-4) {\n var19_23 = var12_15.i();\n var19_23.c();\n var18_25.d(var19_23.a(), var19_23.b());\n }\n if (0.0 <= var7_8 && var7_8 <= 1.0) ** GOTO lbl-1000\n var20_26 = var18_25.b() - var17_21.b();\n var24_28 = Math.sqrt(var20_26 * var20_26 + (var22_27 = var18_25.c() - var17_21.c()) * var22_27);\n v0 = var26_29 = var24_28 != 0.0 ? var7_8 / var24_28 : 0.0;\n if (var7_8 >= 0.0) ** GOTO lbl-1000\n var28_30 = var17_21.b() + var26_29 * var20_26;\n var30_31 = var17_21.c() + var26_29 * var22_27;\n if (var32_6) lbl-1000: // 2 sources:\n {\n var28_30 = var18_25.b() + var26_29 * var20_26;\n var30_31 = var18_25.c() + var26_29 * var22_27;\n }\n var19_24 = new t(var28_30, var30_31);\n if (var32_6) lbl-1000: // 2 sources:\n {\n var19_24 = new t(var17_21.b() * (1.0 - var7_8) + var18_25.b() * var7_8, var17_21.c() * (1.0 - var7_8) + var18_25.c() * var7_8);\n }\n var9_9.a(var19_24);\n if (this.d() == false) return var9_9;\n ae.b(var9_9);\n return var9_9;\n }","title":""},{"docid":"6b5bf96536773da83480aa54f2f96436","score":"0.5770869","text":"protected void func_180433_a(double p_180433_1_, boolean p_180433_3_, Block p_180433_4_, BlockPos p_180433_5_) {\n/* 537 */ if (p_180433_3_) {\n/* */ \n/* 539 */ if (this.fallDistance > 3.0F)\n/* */ {\n/* 541 */ fall(this.fallDistance, 1.0F);\n/* */ \n/* 543 */ if (!this.worldObj.isRemote && !this.isDead) {\n/* */ \n/* 545 */ setDead();\n/* */ \n/* */ int var6;\n/* 548 */ for (var6 = 0; var6 < 3; var6++)\n/* */ {\n/* 550 */ dropItemWithOffset(Item.getItemFromBlock(Blocks.planks), 1, 0.0F);\n/* */ }\n/* */ \n/* 553 */ for (var6 = 0; var6 < 2; var6++)\n/* */ {\n/* 555 */ dropItemWithOffset(Items.stick, 1, 0.0F);\n/* */ }\n/* */ } \n/* */ \n/* 559 */ this.fallDistance = 0.0F;\n/* */ }\n/* */ \n/* 562 */ } else if (this.worldObj.getBlockState((new BlockPos(this)).offsetDown()).getBlock().getMaterial() != Material.water && p_180433_1_ < 0.0D) {\n/* */ \n/* 564 */ this.fallDistance = (float)(this.fallDistance - p_180433_1_);\n/* */ } \n/* */ }","title":""},{"docid":"5ba1d9c9474200bbfaddf61cbfedfce5","score":"0.5733453","text":"private void d(bu var1_1, q var2_2) {\n block26 : {\n block25 : {\n block24 : {\n block23 : {\n var10_3 = fj.z;\n var3_4 = null;\n var4_5 = cm.a(var1_1, var2_2);\n var5_6 = this.a(var4_5, var2_2);\n var6_7 = this.a(var1_1, var2_2);\n if ((var5_6 || var6_7) && this.c() && var1_1.C() != null && (var7_8 = var1_1.C().n(var2_2)) != null) {\n if (this.h.add(var7_8)) {\n var1_1.a(new y.c.y((q)var7_8).a());\n }\n if ((var8_10 = var1_1.t((q)var7_8).getAutoBoundsFeature()) != null && var8_10.isAutoBoundsEnabled()) {\n var8_10.setAutoBoundsEnabled(false);\n var3_4 = var8_10;\n }\n }\n if (var5_6) {\n if (this.h.add(var2_2)) {\n var1_1.a(new y.c.y(var2_2).a());\n }\n if (var2_2.a() > 0) {\n var1_1.a(var2_2.j());\n }\n }\n if (!(var4_5 instanceof y.h.b.a)) ** GOTO lbl56\n var7_8 = ((y.h.b.a)var4_5).l();\n var8_11 = var7_8.k();\n while (var8_11-- > 1) {\n this.b(var2_2, var7_8.b(var8_11));\n if (!var10_3) {\n if (!var10_3) continue;\n }\n ** GOTO lbl-1000\n }\n if (var7_8.k() <= 1) ** GOTO lbl-1000\n this.b(var2_2, var7_8.b(0));\n if (var10_3) lbl-1000: // 3 sources:\n {\n var8_12 = var7_8.b(0);\n var9_14 = var8_12.k();\n while (var9_14-- > 0) {\n this.b(var2_2, var8_12.b(var9_14));\n if (!var10_3) {\n if (!var10_3) continue;\n }\n break block23;\n }\n if (this.a(var2_2, var8_12) && var8_12.k() > 0) {\n this.c(var2_2, var8_12);\n }\n }\n }\n var8_10 = var7_8.n();\n while (var8_10-- > true) {\n this.b(var2_2, var7_8.c((int)var8_10));\n if (!var10_3) {\n if (!var10_3) continue;\n }\n ** GOTO lbl-1000\n }\n if (var7_8.n() <= 1) ** GOTO lbl-1000\n this.b(var2_2, var7_8.c(0));\n if (var10_3) lbl-1000: // 3 sources:\n {\n var8_13 = var7_8.c(0);\n var9_14 = var8_13.n();\n while (var9_14-- > 0) {\n this.b(var2_2, var8_13.c(var9_14));\n if (!var10_3) {\n if (!var10_3) continue;\n }\n break block24;\n }\n if (this.a(var2_2, var8_13) && var8_13.n() > 0) {\n this.c(var2_2, var8_13);\n }\n }\n }\n var7_9 = var4_5.portCount();\n while (var7_9-- > 0) {\n var8_10 = var4_5.getPort(var7_9);\n if (!this.a(var2_2, (eU)var8_10)) continue;\n this.a(var4_5, (eU)var8_10, var7_9);\n if (!var10_3) {\n if (!var10_3) continue;\n }\n break block25;\n }\n var7_9 = var4_5.labelCount();\n }\n while (var7_9-- > 0) {\n var8_10 = var4_5.getLabel(var7_9);\n if (!this.a(var2_2, (eR)var8_10)) continue;\n this.a(var4_5, (eR)var8_10, var7_9);\n if (!var10_3) {\n if (!var10_3) continue;\n }\n break block26;\n }\n if (var6_7) {\n this.c(var1_1, var2_2);\n }\n }\n if (var3_4 == null) return;\n var3_4.setAutoBoundsEnabled(true);\n }\n\n /*\n * Exception decompiling\n */\n private void e(bu var1_1, q var2_2) {\n // This method has failed to decompile. When submitting a bug report, please provide this stack trace, and (if you hold appropriate legal rights) the relevant class file.\n // org.benf.cfr.reader.util.ConfusedCFRException: Statement already marked as first in another block\n // org.benf.cfr.reader.bytecode.analysis.opgraph.Op03SimpleStatement.markFirstStatementInBlock(Op03SimpleStatement.java:420)\n // org.benf.cfr.reader.bytecode.analysis.opgraph.op3rewriters.Misc.markWholeBlock(Misc.java:219)\n // org.benf.cfr.reader.bytecode.analysis.opgraph.op3rewriters.ConditionalRewriter.considerAsSimpleIf(ConditionalRewriter.java:619)\n // org.benf.cfr.reader.bytecode.analysis.opgraph.op3rewriters.ConditionalRewriter.identifyNonjumpingConditionals(ConditionalRewriter.java:45)\n // org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisInner(CodeAnalyser.java:681)\n // org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisOrWrapFail(CodeAnalyser.java:220)\n // org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysis(CodeAnalyser.java:165)\n // org.benf.cfr.reader.entities.attributes.AttributeCode.analyse(AttributeCode.java:91)\n // org.benf.cfr.reader.entities.Method.analyse(Method.java:354)\n // org.benf.cfr.reader.entities.ClassFile.analyseMid(ClassFile.java:751)\n // org.benf.cfr.reader.entities.ClassFile.analyseTop(ClassFile.java:683)\n // org.benf.cfr.reader.Main.doJar(Main.java:129)\n // org.benf.cfr.reader.Main.main(Main.java:181)\n // the.bytecode.club.bytecodeviewer.decompilers.CFRDecompiler.decompileToZip(CFRDecompiler.java:245)\n // the.bytecode.club.bytecodeviewer.gui.MainViewerGUI$18$1$3.run(MainViewerGUI.java:1107)\n throw new IllegalStateException(\"Decompilation failed\");\n }\n\n private void f(bu bu2, q q2) {\n this.g = null;\n this.f = null;\n this.e = null;\n this.d = false;\n }\n\n @Override\n public void actionPerformed(ActionEvent actionEvent) {\n ch ch2 = this.a(actionEvent);\n if (ch2 == null) return;\n this.a(ch2);\n ch2.getGraph2D().T();\n }\n\n /*\n * WARNING - Removed try catching itself - possible behaviour change.\n * Unable to fully structure code\n * Enabled unnecessary exception pruning\n */\n public void a(ch var1_1) {\n var7_2 = fj.z;\n var2_3 = var1_1.getGraph2D();\n var2_3.r();\n try {\n block7 : {\n var3_4 = var2_3.p();\n while (var3_4.f()) {\n this.b(var2_3, var3_4.a());\n var3_4.g();\n if (!var7_2) {\n if (!var7_2) continue;\n }\n break block7;\n }\n this.h = new HashSet();\n }\n if ((var3_4 = var2_3.C()) != null) ** GOTO lbl21\n var4_5 = var2_3.o();\n while (var4_5.f()) {\n this.b(var2_3, var4_5.e());\n var4_5.g();\n if (var7_2 != false) return;\n if (!var7_2) continue;\nlbl21: // 2 sources:\n var4_5 = new ArrayList(var2_3.f());\n var3_4.a(var3_4.e(var2_3), new cp(this, (ArrayList)var4_5));\n var5_6 = var4_5.iterator();\n while (var5_6.hasNext()) {\n this.b(var2_3, (q)var5_6.next());\n if (var7_2 != false) return;\n if (!var7_2) continue;\n }\n break block4;\n }\n this.h = null;\n return;\n }\n finally {\n var2_3.s();\n }\n }\n\n protected void b(bu bu2, d d2) {\n boolean bl2;\n int n2;\n aB aB2;\n block5 : {\n int n3;\n bl2 = fj.z;\n aB2 = bu2.i(d2);\n if (this.a(aB2, d2)) {\n bu2.a(new y.c.f(d2).a());\n aB2 = bu2.i(d2);\n }\n y y2 = aB2.bends();\n while (y2.f()) {\n n3 = (int)this.a(d2, y2.a()) ? 1 : 0;\n if (!bl2) {\n if (n3 != 0) {\n this.a(aB2, y2.a());\n }\n y2.g();\n if (!bl2) continue;\n }\n break block5;\n }\n n3 = n2 = aB2.labelCount();\n }\n while (n2-- > 0) {\n aA aA2 = aB2.getLabel(n2);\n if (!this.a(d2, aA2)) continue;\n this.a(aB2, aA2, n2);\n if (bl2) return;\n if (!bl2) continue;\n }\n if (!this.a(bu2, d2)) return;\n this.c(bu2, d2);\n }\n\n protected ch a(ActionEvent actionEvent) {\n return cm.a(actionEvent, this.a);\n }\n\n boolean a(aB aB2, d d2) {\n boolean bl2;\n int n2;\n block5 : {\n bl2 = fj.z;\n y y2 = aB2.bends();\n while (y2.f()) {\n n2 = (int)this.a(d2, y2.a()) ? 1 : 0;\n if (!bl2) {\n if (n2 != 0) {\n return true;\n }\n y2.g();\n if (!bl2) continue;\n }\n break block5;\n }\n n2 = aB2.labelCount();\n }\n if (n2 <= 0) return false;\n int n3 = 0;\n do {\n if (n3 >= aB2.labelCount()) return false;\n boolean bl3 = this.a(d2, aB2.getLabel(n3));\n if (bl2) return bl3;\n if (bl3) {\n return true;\n }\n ++n3;\n } while (!bl2);\n return false;\n }\n\n boolean a(fj fj2, q q2) {\n boolean bl2;\n boolean bl3;\n Object object;\n int n2;\n block14 : {\n bl3 = fj.z;\n if (fj2 instanceof y.h.b.a) {\n Object object2;\n ArrayList arrayList;\n block13 : {\n boolean bl4;\n object = ((y.h.b.a)fj2).l();\n arrayList = new ArrayList();\n arrayList.addAll(object.l());\n while (!arrayList.isEmpty()) {\n object2 = (c)arrayList.remove(arrayList.size() - 1);\n bl4 = this.a(q2, (c)object2);\n if (!bl3) {\n if (bl4) {\n return true;\n }\n arrayList.addAll(object2.l());\n if (!bl3) continue;\n }\n break block13;\n }\n arrayList.clear();\n bl4 = arrayList.addAll(object.o());\n }\n while (!arrayList.isEmpty()) {\n object2 = (f)arrayList.remove(arrayList.size() - 1);\n n2 = (int)this.a(q2, (f)object2) ? 1 : 0;\n if (!bl3) {\n if (n2 != 0) {\n return true;\n }\n arrayList.addAll(object2.o());\n if (!bl3) continue;\n }\n break block14;\n }\n }\n n2 = fj2.portCount();\n }\n if (n2 > 0) {\n object = fj2.ports();\n while (object.hasNext()) {\n if (!this.a(q2, (eU)object.next())) continue;\n bl2 = true;\n if (!bl3) {\n return bl2;\n }\n break;\n }\n } else {\n bl2 = fj2.labelCount();\n }\n if (bl2 <= false) return false;\n int n3 = 0;\n do {\n if (n3 >= fj2.labelCount()) return false;\n boolean bl5 = this.a(q2, fj2.getLabel(n3));\n if (bl3) return bl5;\n if (bl5) {\n return true;\n }\n ++n3;\n } while (!bl3);\n return false;\n }\n\n boolean b(q q2, c c2) {\n boolean bl2 = fj.z;\n boolean bl3 = false;\n int n2 = c2.k();\n while (n2-- > 0) {\n bl3 |= this.b(q2, c2.b(n2));\n if (bl2) return bl3;\n if (!bl2) continue;\n }\n if (!this.a(q2, c2)) return bl3;\n this.c(q2, c2);\n return true;\n }\n\n boolean b(q q2, f f2) {\n boolean bl2 = fj.z;\n boolean bl3 = false;\n int n2 = f2.n();\n while (n2-- > 0) {\n bl3 |= this.b(q2, f2.c(n2));\n if (bl2) return bl3;\n if (!bl2) continue;\n }\n if (!this.a(q2, f2)) return bl3;\n this.c(q2, f2);\n return true;\n }\n\n protected void c(bu bu2, d d2) {\n bu2.a(d2);\n }\n\n protected void a(aB aB2, aA aA2, int n2) {\n aB2.removeLabel(aA2);\n }\n\n protected void a(aB aB2, x x2) {\n aB2.removeBend(x2);\n }\n\n protected void c(bu bu2, q q2) {\n bu2.a(q2);\n }\n\n protected void a(fj fj2, eR eR2, int n2) {\n fj2.removeLabel(eR2);\n }\n\n protected void a(fj fj2, eU eU2, int n2) {\n fj2.removePort(n2);\n }\n\n protected void c(q q2, c c2) {\n c2.c();\n }\n\n protected void c(q q2, f f2) {\n f2.c();\n }\n}","title":""},{"docid":"cbf101e1f6086bf8b43dbbe7548256d8","score":"0.5671651","text":"private boolean mainSimpleSort(final int lo, final int hi, final int d, final int lastShadow) {\n final int bigN = hi - lo + 1;\n\n if (bigN < 2)\n return firstAttempt && (workDone > workLimit);\n\n int hp = 0;\n while (INCS[hp] < bigN) {\n hp++;\n }\n\n final int lastPlus1 = lastShadow + 1;\n final boolean firstAttemptShadow = firstAttempt;\n final int workLimitShadow = workLimit;\n int workDoneShadow = workDone;\n\n // Following block contains unrolled code which could be shortened by\n // coding it in additional loops.\n\n HP:\n while (--hp >= 0) {\n final int h = INCS[hp];\n final int mj = lo + h - 1;\n\n for (int i = lo + h; i <= hi; ) {\n // copy\n for (int k = 3; (i <= hi) && (--k >= 0); i++) {\n final int v = data.fmap[i];\n final int vd = v + d;\n int j = i;\n\n // for (int a;\n // (j > mj) && mainGtU((a = fmap[j - h]) + d, vd,\n // block, quadrant, lastShadow);\n // j -= h) {\n // fmap[j] = a;\n // }\n //\n // unrolled version:\n\n // start inline mainGTU\n boolean onceRunned = false;\n int a = 0;\n\n HAMMER:\n while (true) {\n if (onceRunned) {\n data.fmap[j] = a;\n if ((j -= h) <= mj) { //NOSONAR\n break HAMMER;\n }\n } else {\n onceRunned = true;\n }\n\n a = data.fmap[j - h];\n int i1 = a + d;\n int i2 = vd;\n\n // following could be done in a loop, but\n // unrolled it for performance:\n if (data.block[i1 + 1] == data.block[i2 + 1]) {\n if (data.block[i1 + 2] == data.block[i2 + 2]) {\n if (data.block[i1 + 3] == data.block[i2 + 3]) {\n if (data.block[i1 + 4] == data.block[i2 + 4]) {\n if (data.block[i1 + 5] == data.block[i2 + 5]) {\n if (data.block[i1 += 6] == data.block[i2 += 6]) { //NOSONAR\n int x = lastShadow;\n X:\n while (x > 0) {\n x -= 4;\n\n if (data.block[i1 + 1] == data.block[i2 + 1]) {\n if (this.data.sfmap[i1] == this.data.sfmap[i2]) {\n if (data.block[i1 + 2] == data.block[i2 + 2]) {\n if (this.data.sfmap[i1 + 1] == this.data.sfmap[i2 + 1]) {\n if (data.block[i1 + 3] == data.block[i2 + 3]) {\n if (this.data.sfmap[i1 + 2] == this.data.sfmap[i2 + 2]) {\n if (data.block[i1 + 4] == data.block[i2 + 4]) {\n if (this.data.sfmap[i1 + 3] == this.data.sfmap[i2 + 3]) {\n if ((i1 += 4) >= lastPlus1) { //NOSONAR\n i1 -= lastPlus1;\n }\n if ((i2 += 4) >= lastPlus1) { //NOSONAR\n i2 -= lastPlus1;\n }\n workDoneShadow++;\n continue X;\n } else if (this.data.sfmap[i1 + 3] > this.data.sfmap[i2 + 3]) {\n continue HAMMER;\n } else {\n break HAMMER;\n }\n } else if ((data.block[i1 + 4] & 0xff) > (data.block[i2 + 4] & 0xff)) {\n continue HAMMER;\n } else {\n break HAMMER;\n }\n } else if (this.data.sfmap[i1 + 2] > this.data.sfmap[i2 + 2]) {\n continue HAMMER;\n } else {\n break HAMMER;\n }\n } else if ((data.block[i1 + 3] & 0xff) > (data.block[i2 + 3] & 0xff)) {\n continue HAMMER;\n } else {\n break HAMMER;\n }\n } else if (this.data.sfmap[i1 + 1] > this.data.sfmap[i2 + 1]) {\n continue HAMMER;\n } else {\n break HAMMER;\n }\n } else if ((data.block[i1 + 2] & 0xff) > (data.block[i2 + 2] & 0xff)) {\n continue HAMMER;\n } else {\n break HAMMER;\n }\n } else if (this.data.sfmap[i1] > this.data.sfmap[i2]) {\n continue HAMMER;\n } else {\n break HAMMER;\n }\n } else if ((data.block[i1 + 1] & 0xff) > (data.block[i2 + 1] & 0xff)) {\n continue HAMMER;\n } else {\n break HAMMER;\n }\n\n }\n break HAMMER;\n } // while x > 0\n if ((data.block[i1] & 0xff) > (data.block[i2] & 0xff)) {\n continue HAMMER;\n }\n break HAMMER;\n } else if ((data.block[i1 + 5] & 0xff) > (data.block[i2 + 5] & 0xff)) {\n continue HAMMER;\n } else {\n break HAMMER;\n }\n } else if ((data.block[i1 + 4] & 0xff) > (data.block[i2 + 4] & 0xff)) {\n continue HAMMER;\n } else {\n break HAMMER;\n }\n } else if ((data.block[i1 + 3] & 0xff) > (data.block[i2 + 3] & 0xff)) {\n continue HAMMER;\n } else {\n break HAMMER;\n }\n } else if ((data.block[i1 + 2] & 0xff) > (data.block[i2 + 2] & 0xff)) {\n continue HAMMER;\n } else {\n break HAMMER;\n }\n } else if ((data.block[i1 + 1] & 0xff) > (data.block[i2 + 1] & 0xff)) {\n continue HAMMER;\n } else {\n break HAMMER;\n }\n\n } // HAMMER\n // end inline mainGTU\n\n data.fmap[j] = v;\n }\n\n if (firstAttemptShadow && (i <= hi)\n && (workDoneShadow > workLimitShadow)) {\n break HP;\n }\n }\n }\n\n workDone = workDoneShadow;\n return firstAttemptShadow && (workDoneShadow > workLimitShadow);\n }","title":""},{"docid":"638a4a24c566dbee2f8f1022b55b4bd7","score":"0.5615852","text":"public void func_149749_a(World world, int x, int y, int z, Block bl, int md)\n/* */ {\n/* 210 */ if (!world.field_72995_K) {\n/* 211 */ if (md != 0)\n/* */ {\n/* 213 */ for (int a = -1; a <= 1; a++) {\n/* 214 */ for (int b = -1; b <= 1; b++)\n/* 215 */ for (int c = -1; c <= 1; c++)\n/* 216 */ if ((world.func_147439_a(x + a, y + b, z + c) == this) && (world.func_72805_g(x + a, y + b, z + c) == 0)) {\n/* 217 */ TileAlchemyFurnaceAdvanced tile = (TileAlchemyFurnaceAdvanced)world.func_147438_o(x + a, y + b, z + c);\n/* 218 */ if (tile != null) {\n/* 219 */ tile.destroy = true;\n/* 220 */ return;\n/* */ }\n/* */ }\n/* */ }\n/* */ } else {\n/* 225 */ for (int a = -1; a <= 1; a++) {\n/* 226 */ for (int b = 0; b <= 1; b++) {\n/* 227 */ for (int c = -1; c <= 1; c++) {\n/* 228 */ if (((a != 0) || (b != 0) || (c != 0)) && (world.func_147439_a(x + a, y + b, z + c) == this)) {\n/* 229 */ int m = world.func_72805_g(x + a, y + b, z + c);\n/* 230 */ world.func_147465_d(x + a, y + b, z + c, Block.func_149634_a(func_149650_a(m, world.field_73012_v, 0)), func_149692_a(m), 3);\n/* */ }\n/* */ }\n/* */ }\n/* */ }\n/* */ }\n/* */ }\n/* */ }","title":""},{"docid":"76e0147de9a9e4b5204c777a813afe1d","score":"0.5570214","text":"public static void spaceOptimizedLCS(){\n\n }","title":""},{"docid":"73c0440bde8fdd28342e57b4a67c9be7","score":"0.5554023","text":"private Integer blocksToMoveEnhancedHeuristic(BoardState state) {\n\n\t\tif (isGoalState(state)) {\n\t\t\treturn 0;\n\t\t}\n\n\t\tBlock block = state.getBlocks().get(0);\n\t\tSet blocks = new HashSet();\n\n\t\t/* Set of blocks that obstruct a certain block */\n\t\tMap> map = new HashMap>();\n\n\t\t/* Amount of obstructions produced by a certain block */\n\t\tList obstructionsCount = new ArrayList();\n\n\t\tfor (int j = block.getHead().getJ() + 1; j < board[0].length; j++) {\n\t\t\tif (state.getBoard()[block.getHead().getI()][j] != 0) {\n\t\t\t\tint id = state.getBoard()[block.getHead().getI()][j];\n\t\t\t\tblocks.add(id);\n\t\t\t\tSet blockingBlocks = state.blockingBlocks(id);\n\t\t\t\tSet ignore = new HashSet();\n\n\t\t\t\tif (!blockingBlocks.isEmpty()) {\n\t\t\t\t\tmap.put(id, blockingBlocks);\n\t\t\t\t}\n\n\t\t\t\tfor (TopObstruction t : obstructionsCount) {\n\t\t\t\t\tif (blockingBlocks.contains(t.id)) {\n\t\t\t\t\t\tt.increaseCount();\n\t\t\t\t\t}\n\t\t\t\t\tignore.add(t.id);\n\t\t\t\t}\n\n\t\t\t\tfor (Integer i : blockingBlocks) {\n\t\t\t\t\tif (!ignore.contains(i)) {\n\t\t\t\t\t\tobstructionsCount.add(new TopObstruction(i));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tCollections.sort(obstructionsCount);\n\n\t\twhile (!map.isEmpty() && !obstructionsCount.isEmpty()) {\n\t\t\tTopObstruction t = obstructionsCount.remove(0);\n\n\t\t\tIterator>> iterator = map\n\t\t\t\t\t.entrySet().iterator();\n\t\t\twhile (iterator.hasNext()) {\n\t\t\t\tEntry> next = iterator.next();\n\t\t\t\tif (next.getValue().contains(t.id)) {\n\t\t\t\t\titerator.remove();\n\t\t\t\t\tblocks.add(t.id);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn blocks.size() + 1;\n\n\t}","title":""},{"docid":"562f77bb8d34b165cd4498630b3d7057","score":"0.5527271","text":"public int getOrder()\r\n/* 30: */ {\r\n/* 31:133 */ return 5;\r\n/* 32: */ }","title":""},{"docid":"93892bd4ebc6ca197bf55daf501ac684","score":"0.55205774","text":"@Override\r\n protected void sort() {\r\n //WRITECODE\r\n }","title":""},{"docid":"bbc962804a7ba3765b2bfcc92f41619c","score":"0.5518686","text":"private static long preSortSteps() {\n \tclearSwapCounter();\n \tSortObject.resetCompares();\n \treturn System.currentTimeMillis();\n }","title":""},{"docid":"0f49c1bac2fdfd08e317dc373b767186","score":"0.5498088","text":"public boolean a(World paramaqu, Random paramRandom, bjb parambjb)\r\n/* 33: */ {\r\n/* 34:1107 */ if (a(paramaqu, parambjb)) {\r\n/* 35:1108 */ return false;\r\n/* 36: */ }\r\n/* 37:1112 */ a(paramaqu, parambjb, 0, 0, 0, 8, 4, 10, true, paramRandom, blr.c());\r\n/* 38: */ \r\n/* 39:1114 */ a(paramaqu, paramRandom, parambjb, this.d, 1, 1, 0);\r\n/* 40: */ \r\n/* 41:1116 */ a(paramaqu, parambjb, 1, 1, 10, 3, 3, 10, BlockList.air.instance(), BlockList.air.instance(), false);\r\n/* 42: */ \r\n/* 43: */ \r\n/* 44:1119 */ a(paramaqu, parambjb, 4, 1, 1, 4, 3, 1, false, paramRandom, blr.c());\r\n/* 45:1120 */ a(paramaqu, parambjb, 4, 1, 3, 4, 3, 3, false, paramRandom, blr.c());\r\n/* 46:1121 */ a(paramaqu, parambjb, 4, 1, 7, 4, 3, 7, false, paramRandom, blr.c());\r\n/* 47:1122 */ a(paramaqu, parambjb, 4, 1, 9, 4, 3, 9, false, paramRandom, blr.c());\r\n/* 48: */ \r\n/* 49: */ \r\n/* 50:1125 */ a(paramaqu, parambjb, 4, 1, 4, 4, 3, 6, BlockList.ironBars.instance(), BlockList.ironBars.instance(), false);\r\n/* 51:1126 */ a(paramaqu, parambjb, 5, 1, 5, 7, 3, 5, BlockList.ironBars.instance(), BlockList.ironBars.instance(), false);\r\n/* 52: */ \r\n/* 53: */ \r\n/* 54:1129 */ a(paramaqu, BlockList.ironBars.instance(), 4, 3, 2, parambjb);\r\n/* 55:1130 */ a(paramaqu, BlockList.ironBars.instance(), 4, 3, 8, parambjb);\r\n/* 56:1131 */ a(paramaqu, BlockList.ironDoor.instance(a(BlockList.ironDoor, 3)), 4, 1, 2, parambjb);\r\n/* 57:1132 */ a(paramaqu, BlockList.ironDoor.instance(a(BlockList.ironDoor, 3) + 8), 4, 2, 2, parambjb);\r\n/* 58:1133 */ a(paramaqu, BlockList.ironDoor.instance(a(BlockList.ironDoor, 3)), 4, 1, 8, parambjb);\r\n/* 59:1134 */ a(paramaqu, BlockList.ironDoor.instance(a(BlockList.ironDoor, 3) + 8), 4, 2, 8, parambjb);\r\n/* 60: */ \r\n/* 61:1136 */ return true;\r\n/* 62: */ }","title":""},{"docid":"dc99d0a487d745641cd4abfd0aa19db2","score":"0.547032","text":"public int mo1325d(int r5) {\n /*\n r4 = this;\n int[] r0 = r4.f887a\n r1 = -1\n if (r0 != 0) goto L_0x0006\n return r1\n L_0x0006:\n int r0 = r0.length\n if (r5 < r0) goto L_0x000a\n return r1\n L_0x000a:\n java.util.List r0 = r4.f888b\n if (r0 != 0) goto L_0x0010\n L_0x000e:\n r0 = r1\n goto L_0x0046\n L_0x0010:\n androidx.recyclerview.widget.StaggeredGridLayoutManager$d$a r0 = r4.mo1324c(r5)\n if (r0 == 0) goto L_0x001b\n java.util.List r2 = r4.f888b\n r2.remove(r0)\n L_0x001b:\n java.util.List r0 = r4.f888b\n int r0 = r0.size()\n r2 = 0\n L_0x0022:\n if (r2 >= r0) goto L_0x0034\n java.util.List r3 = r4.f888b\n java.lang.Object r3 = r3.get(r2)\n androidx.recyclerview.widget.StaggeredGridLayoutManager$d$a r3 = (androidx.recyclerview.widget.StaggeredGridLayoutManager.C0143d.C0144a) r3\n int r3 = r3.f889e\n if (r3 < r5) goto L_0x0031\n goto L_0x0035\n L_0x0031:\n int r2 = r2 + 1\n goto L_0x0022\n L_0x0034:\n r2 = r1\n L_0x0035:\n if (r2 == r1) goto L_0x000e\n java.util.List r0 = r4.f888b\n java.lang.Object r0 = r0.get(r2)\n androidx.recyclerview.widget.StaggeredGridLayoutManager$d$a r0 = (androidx.recyclerview.widget.StaggeredGridLayoutManager.C0143d.C0144a) r0\n java.util.List r3 = r4.f888b\n r3.remove(r2)\n int r0 = r0.f889e\n L_0x0046:\n if (r0 != r1) goto L_0x0052\n int[] r0 = r4.f887a\n int r2 = r0.length\n java.util.Arrays.fill(r0, r5, r2, r1)\n int[] r5 = r4.f887a\n int r5 = r5.length\n return r5\n L_0x0052:\n int[] r2 = r4.f887a\n int r0 = r0 + 1\n java.util.Arrays.fill(r2, r5, r0, r1)\n return r0\n */\n throw new UnsupportedOperationException(\"Method not decompiled: androidx.recyclerview.widget.StaggeredGridLayoutManager.C0143d.mo1325d(int):int\");\n }","title":""},{"docid":"aa7ce5d12625c11b0fdd7175f98793c7","score":"0.54469955","text":"private void sort0(){\n\t\tint n = a.length;\n\t\tfor(int i = 1; i < n; i++ ){\n\t\t\tfor(int j = i ; j > 0 && less(a[j], a[j-1]); j--){\n\t\t\t\texch(j,j-1);\n\t\t\t}\n\t\t}\n\t}","title":""},{"docid":"baa501be4fa299f4110823a2f6ee4fd8","score":"0.5421204","text":"public void visitEnd() {\n/* 101 */ Collections.sort(this.tryCatchBlocks, new Comparator()\n/* */ {\n/* */ \n/* */ \n/* */ \n/* */ \n/* */ public int compare(TryCatchBlockNode tryCatchBlockNode1, TryCatchBlockNode tryCatchBlockNode2)\n/* */ {\n/* 109 */ return blockLength(tryCatchBlockNode1) - blockLength(tryCatchBlockNode2);\n/* */ }\n/* */ \n/* */ private int blockLength(TryCatchBlockNode tryCatchBlockNode) {\n/* 113 */ int startIndex = TryCatchBlockSorter.this.instructions.indexOf((AbstractInsnNode)tryCatchBlockNode.start);\n/* 114 */ int endIndex = TryCatchBlockSorter.this.instructions.indexOf((AbstractInsnNode)tryCatchBlockNode.end);\n/* 115 */ return endIndex - startIndex;\n/* */ }\n/* */ });\n/* */ \n/* 119 */ for (int i = 0; i < this.tryCatchBlocks.size(); i++) {\n/* 120 */ ((TryCatchBlockNode)this.tryCatchBlocks.get(i)).updateIndex(i);\n/* */ }\n/* 122 */ if (this.mv != null)\n/* 123 */ accept(this.mv); \n/* */ }","title":""},{"docid":"9087d0f31d5c38a93895a718fdf89230","score":"0.54189724","text":"public abstract void preorder();","title":""},{"docid":"7436a6016fb195abf5d5ccf94430ddd3","score":"0.54156685","text":"private Integer blocksToMoveHeuristic(BoardState state) {\n\t\tBlock block = state.getBlocks().get(0);\n\t\tSet blocks = new HashSet();\n\n\t\tif (isGoalState(state)) {\n\t\t\treturn 0;\n\t\t}\n\n\t\tfor (int j = block.getHead().getJ() + 1; j < board[0].length; j++) {\n\t\t\tif (state.getBoard()[block.getHead().getI()][j] != 0) {\n\t\t\t\tblocks.add(state.getBoard()[block.getHead().getI()][j]);\n\t\t\t}\n\t\t}\n\n\t\treturn blocks.size() + 1;\n\n\t}","title":""},{"docid":"e12eea4310082a0b622f7213e34fd885","score":"0.54025155","text":"int checkBlockLine(int[] p_76496_1_, int[] p_76496_2_)\n {\n int[] aint2 = new int[] {0, 0, 0};\n byte b0 = 0;\n byte b1;\n\n for (b1 = 0; b0 < 3; ++b0)\n {\n aint2[b0] = p_76496_2_[b0] - p_76496_1_[b0];\n\n if (Math.abs(aint2[b0]) > Math.abs(aint2[b1]))\n {\n b1 = b0;\n }\n }\n\n if (aint2[b1] == 0)\n {\n return -1;\n }\n else\n {\n byte b2 = otherCoordPairs[b1];\n byte b3 = otherCoordPairs[b1 + 3];\n byte b4;\n\n if (aint2[b1] > 0)\n {\n b4 = 1;\n }\n else\n {\n b4 = -1;\n }\n\n double d0 = (double)aint2[b2] / (double)aint2[b1];\n double d1 = (double)aint2[b3] / (double)aint2[b1];\n int[] aint3 = new int[] {0, 0, 0};\n int i = 0;\n int j;\n\n for (j = aint2[b1] + b4; i != j; i += b4)\n {\n aint3[b1] = p_76496_1_[b1] + i;\n aint3[b2] = MathHelper.floor_double((double)p_76496_1_[b2] + (double)i * d0);\n aint3[b3] = MathHelper.floor_double((double)p_76496_1_[b3] + (double)i * d1);\n Block block = this.worldObj.getBlock(aint3[0], aint3[1], aint3[2]);\n\n if (!this.isReplaceable(worldObj, aint3[0], aint3[1], aint3[2]))\n {\n break;\n }\n }\n\n return i == j ? -1 : Math.abs(i);\n }\n }","title":""},{"docid":"f71aa008e611d2242efdbfe4f57ecfa7","score":"0.5386017","text":"private List search(List seen, Location loc0, Location loc, boolean leaves, boolean outlinedTree)\r\n\t{\r\n\t\tList result = new ArrayList<>();\r\n\t\t//search directions vary based on the mode\r\n\t\t\r\n\t\tfor(int mode = outlinedTree ? 1 : 0; mode < (leaves ? 2 : 1); mode++)\r\n\t\t{\t\r\n\t\t\tUnitRelativePosition[] relativeLocs;\r\n\t\t\tif(mode == 1)\r\n\t\t\t\trelativeLocs = SEARCH_LEAVES;\r\n\t\t\telse\r\n\t\t\t\trelativeLocs = SEARCH_LOGS;\r\n\t\t\t\r\n\t\t\tfor(int i=0; i= 100)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tif((Boolean)Setting.DEBUG.getValue())\r\n\t\t\t\t\t\t\tTreeFeller.log(Level.INFO, \"Limit reached at x = \"+x+\",z = \"+z);\r\n\t\t\t\t\t\tcontinue; \t\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\tif((Boolean) Setting.DEBUG.getValue())\r\n\t\t\t\t\tTreeFeller.log(Level.INFO, \"Processing \"+neighbor+\":\"+b.getType()+\" in mode \"+mode);\r\n\t\t\t\tseen.add(neighbor);\r\n\t\t\t\t\r\n\t\t\t\tif(mode == 1)\r\n\t\t\t\t{\r\n\t\t\t\t\t//the purpose of this code block is to define a region around the tree that is currently being felled\r\n\t\t\t\t\t//this region should not contain any other trees so that the leaves of the other trees are not affected \r\n\t\t\t\t\tif(region != null && !region.contains(x, z))\r\n\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\tif(dist == -1)\r\n\t\t\t\t\t\tdist = MathUtil.distSquared(loc0.getBlockX(), loc0.getBlockZ(), x, z);\r\n\t\t\t\t\t\r\n\t\t\t\t\t//this heuristic prevents the algorithm from classifying the base of the tree as the stump of another tree\r\n\t\t\t\t\t//note that this greedy behavior may not always work\r\n\t\t\t\t\tif(isStump(b, true))\r\n\t\t\t\t\t\t\t//&& (!(Boolean)Setting.USE_HEURISTICS.getValue() || dist > 2))\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tif((Boolean)Setting.DEBUG.getValue())\r\n\t\t\t\t\t\t\tTreeFeller.log(Level.INFO, \"Found other tree at \"+neighbor.getX()+\" \"+neighbor.getY()+\" \"+neighbor.getZ());\r\n\t\t\t\t\t\tList seenOther = new ArrayList<>(100);\r\n\t\t\t\t\t\tList otherTree = search(seenOther, neighbor, neighbor, false, false);\r\n\t\t\t\t\t\tint closestDist = Integer.MAX_VALUE;\r\n\t\t\t\t\t\tLocation closest = null;\r\n\t\t\t\t\t\tfor(int j=otherTree.size()-1; j>=0; j--)\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\tBlock treeBlock = otherTree.get(j);\r\n\t\t\t\t\t\t\tLocation tl = treeBlock.getLocation();\r\n\t\t\t\t\t\t\tint logDist = MathUtil.distSquared(tl.getBlockX(), tl.getBlockZ(), loc0.getBlockX(), loc0.getBlockZ());\r\n\t\t\t\t\t\t\tif(logDist < closestDist)\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tclosest = tl;\r\n\t\t\t\t\t\t\t\tclosestDist = logDist;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tif(closest == null && (Boolean)Setting.DEBUG.getValue())\r\n\t\t\t\t\t\t\tTreeFeller.log(Level.WARNING, \"closest = null\");\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tif(region == null \r\n\t\t\t\t\t\t\t\t|| closest != null && closestDist <= region.getRadiusSquared())\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\tUnitRelativePosition relPos = UnitRelativePosition.getRelativePosition(closest, loc0);\r\n\t\t\t\t\t\t\tLocation offset = UnitRelativePosition.apply(relPos, closest);\r\n\t\t\t\t\t\t\tint ox = offset.getBlockX(), oz = offset.getBlockZ();\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t//check to see if this makes the region smaller\r\n\t\t\t\t\t\t\tint candidateDist = MathUtil.distSquared(loc0.getBlockX(), loc0.getBlockZ(), ox, oz);\r\n\t\t\t\t\t\t\tif(region == null)\r\n\t\t\t\t\t\t\t\tregion = new Region(loc0.getBlockX(), loc0.getBlockZ(), candidateDist);\r\n\t\t\t\t\t\t\telse if(candidateDist < region.getRadiusSquared())\r\n\t\t\t\t\t\t\t\tregion.setRadiusSquared(candidateDist);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tif((Boolean)Setting.DEBUG.getValue())\r\n\t\t\t\t\t\t\tTreeFeller.log(Level.INFO, \"Region set to \"+region);\r\n\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\t//TreeFeller.log(Level.INFO, \"Recurring on \"+b.getLocation());\r\n\t\t\t\tresult.add(b);\r\n\t\t\t\t\r\n\t\t\t\tList sub = search(seen, loc0, neighbor, leaves, mode == 1);\r\n\t\t\t\t\r\n\t\t\t\tfor(int j=0; j tour) {\n\t\tboolean gotoExchange = false;\n\t\n\t\tint c1, c2; /* cities considered for an exchange */\n\t\tint s_c1, s_c2; /* successor cities of c1 and c2 */\n\t\tint p_c1, p_c2; /* predecessor cities of c1 and c2 */\n\t\tint pos_c1, pos_c2; /* positions of cities c1, c2 */\n\t\tint i, j, h, l;\n\t\tint help;\n\t\tboolean improvement_flag;\n\t\tint countImprovement;\n\t\tint h1 = 0, h2 = 0, h3 = 0, h4 = 0;\n\t\tdouble radius; /* radius of nn-search */\n\t\tdouble gain = 0.0;\n\t\tint[] random_vector;\n\t\tHashMap pos; /* positions of cities in tour */\n\t\tHashMap dlb; /* contains don't look bits */\n\t\t\n\t\tpos = new HashMap(tour.size() - 1);\n\t\tdlb = new HashMap(tour.size() - 1);\n\t\tfor (i = 0; i < tour.size() - 1; i++) {\n\t\t pos.put(tour.get(i), i);\n\t\t dlb.put(tour.get(i), false);\n\t\t}\n\t\n\t\timprovement_flag = true;\n\t\tcountImprovement = 0;\n\t\trandom_vector = generate_random_permutation(tour);\n\t\n\t\twhile (improvement_flag) {\n\t\t\tif (countImprovement > 50) {\n\t\t\t\t//System.out.println(\"Exiting from loop..\");\n\t\t\t\tbreak;\n\t\t\t}\n\t\t improvement_flag = false;\n\t\n\t\t for (l = 0; l < tour.size() - 1; l++) {\n\t\t\t\tc1 = random_vector[l];\n\t\t\t\tif (dlb_flag && dlb.get(c1))\n\t\t\t\t continue;\n\t\t\t\tpos_c1 = pos.get(c1);\n\t\t\t\ts_c1 = tour.get(pos_c1 + 1);\n\t\t\t\tradius = MTsp.instance.distance[c1 + 1][s_c1 + 1];\n\t\t\n\t\t\t\t/* First search for c1's nearest neighbours, use successor of c1 */\n\t\t\t\tfor (h = 0; h < nn_ls; h++) {\n\t\t\t\t c2 = MTsp.instance.nn_list_all[c1 + 1][h]; /* exchange partner, determine its position */\n\t\t\t\t //make sure that c2 is in the same subtour with c1; if it isn't choose another element\n\t\t\t\t if (pos.get(c2 - 1) == null) {\n\t\t\t\t \tcontinue;\n\t\t\t\t }\n\t\t\t\t if (radius > MTsp.instance.distance[c1 + 1][c2]) {\n\t\t\t\t\t\ts_c2 = tour.get(pos.get(c2 - 1) + 1);\n\t\t\t\t\t\tgain = -radius + MTsp.instance.distance[c1 + 1][c2] + MTsp.instance.distance[s_c1 + 1][s_c2 + 1]\n\t\t\t\t\t\t\t- MTsp.instance.distance[c2][s_c2 + 1];\n\t\t\t\t\t\tif (gain < 0) {\n\t\t\t\t\t\t h1 = c1;\n\t\t\t\t\t\t h2 = s_c1;\n\t\t\t\t\t\t h3 = c2 - 1;\n\t\t\t\t\t\t h4 = s_c2;\n\t\t\t\t\t\t gotoExchange = true;\n\t\t\t\t\t\t break;\n\t\t\t\t\t\t}\n\t\t\t\t } else\n\t\t\t\t \tbreak;\n\t\t\t\t}\n\t\t\n\t\t\t\tif (gotoExchange) {\n\t\t\t\t /* Search one for next c1's h-nearest neighbours, use predecessor c1 */\n\t\t\t\t if (pos_c1 > 0)\n\t\t\t\t \tp_c1 = tour.get(pos_c1 - 1);\n\t\t\t\t else\n\t\t\t\t \tp_c1 = tour.get(tour.size() - 2);\n\t\t\t\t radius = MTsp.instance.distance[p_c1 + 1][c1 + 1];\n\t\t\t\t for (h = 0; h < nn_ls; h++) {\n\t\t\t\t\t\tc2 = MTsp.instance.nn_list_all[c1 + 1][h]; /* exchange partner, determine its position */\n\t\t\t\t\t\t//make sure that c2 is in the same subtour with c1; if it isn't choose another element\n\t\t\t\t\t if (pos.get(c2 - 1) == null) {\n\t\t\t\t\t \tcontinue;\n\t\t\t\t\t }\n\t\t\t\t\t\tif (radius > MTsp.instance.distance[c1 + 1][c2]) {\n\t\t\t\t\t\t pos_c2 = pos.get(c2 - 1);\n\t\t\t\t\t\t if (pos_c2 > 0)\n\t\t\t\t\t\t \tp_c2 = tour.get(pos_c2 - 1);\n\t\t\t\t\t\t else\n\t\t\t\t\t\t \tp_c2 = tour.get(tour.size() - 2);\n\t\t\t\t\t\t if (p_c2 == c1)\n\t\t\t\t\t\t \tcontinue;\n\t\t\t\t\t\t if (p_c1 == (c2 - 1))\n\t\t\t\t\t\t \tcontinue;\n\t\t\t\t\t\t gain = -radius + MTsp.instance.distance[c1 + 1][c2] + MTsp.instance.distance[p_c1 + 1][p_c2 + 1]\n\t\t\t\t\t\t\t - MTsp.instance.distance[p_c2 + 1][c2];\n\t\t\t\t\t\t if (gain < 0) {\n\t\t\t\t\t\t\t\th1 = p_c1;\n\t\t\t\t\t\t\t\th2 = c1;\n\t\t\t\t\t\t\t\th3 = p_c2;\n\t\t\t\t\t\t\t\th4 = c2 - 1;\n\t\t\t\t\t\t\t\tgotoExchange = true;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t }\n\t\t\t\t\t\t} else\n\t\t\t\t\t\t break;\n\t\t\t\t }\n\t\t\t\t}\n\t\t\n\t\t\t\tif (!gotoExchange) {\n\t\t\t\t /* No exchange */\n\t\t\t\t dlb.put(c1, true);\n\t\t\t\t continue;\n\t\t\t\t}\n\t\t\n\t\t\t\tif (gotoExchange) {\n\t\t\t\t gotoExchange = false;\n\t\t\t\t improvement_flag = true;\n\t\t\t\t countImprovement++;\n\t\t\t\t //System.out.println(\"countImprovement=\" + countImprovement);\n\t\t\t\t dlb.put(h1, false);\n\t\t\t\t dlb.put(h2, false);\n\t\t\t\t dlb.put(h3, false);\n\t\t\t\t dlb.put(h4, false);\n\t\t\t\t /* Now perform move */\n\t\t\t\t if (pos.get(h3) < pos.get(h1)) {\n\t\t\t\t\t\thelp = h1;\n\t\t\t\t\t\th1 = h3;\n\t\t\t\t\t\th3 = help;\n\t\t\t\t\t\thelp = h2;\n\t\t\t\t\t\th2 = h4;\n\t\t\t\t\t\th4 = help;\n\t\t\t\t }\n\t\t\t\t if (pos.get(h3) - pos.get(h2) < (tour.size() - 1) / 2 + 1) {\n\t\t\t\t\t\t/* reverse inner part from pos[h2] to pos[h3] */\n\t\t\t\t\t\ti = pos.get(h2);\n\t\t\t\t\t\tj = pos.get(h3);\n\t\t\t\t\t\t//System.out.println(\"i=\" + i + \" j=\" + j);\n\t\t\t\t\t\tif (i >= j) {\n\t\t\t\t\t\t\t//System.out.println(\"Got here..\");\n\t\t\t\t\t\t\t//countImprovement--;\n\t\t\t\t\t\t}\n\t\t\t\t\t\twhile (i < j) {\n\t\t\t\t\t\t c1 = tour.get(i);\n\t\t\t\t\t\t c2 = tour.get(j);\n\t\t\t\t\t\t tour.set(i, c2);\n\t\t\t\t\t\t tour.set(j, c1);\n\t\t\t\t\t\t pos.put(c1, j);\n\t\t\t\t\t\t pos.put(c2, i);\n\t\t\t\t\t\t i++;\n\t\t\t\t\t\t j--;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t//System.out.println(\"Improvement applied->case 1..\");\n\t\t\t\t } else {\n\t\t\t\t\t\t/* reverse outer part from pos[h4] to pos[h1] */\n\t\t\t\t\t\ti = pos.get(h1);\n\t\t\t\t\t\tj = pos.get(h4);\n\t\t\t\t\t\tif (j > i)\n\t\t\t\t\t\t help = tour.size() - (j - i);\n\t\t\t\t\t\telse\n\t\t\t\t\t\t help = (i - j) + 1;\n\t\t\t\t\t\thelp = help / 2;\n\t\t\t\t\t\tfor (h = 0; h < help; h++) {\n\t\t\t\t\t\t c1 = tour.get(i);\n\t\t\t\t\t\t c2 = tour.get(j);\n\t\t\t\t\t\t tour.set(i, c2);\n\t\t\t\t\t\t tour.set(j, c1);\n\t\t\t\t\t\t pos.put(c1, j);\n\t\t\t\t\t\t pos.put(c2, i);\n\t\t\t\t\t\t i--;\n\t\t\t\t\t\t j++;\n\t\t\t\t\t\t if (i < 0)\n\t\t\t\t\t\t \ti = tour.size() - 2;\n\t\t\t\t\t\t if (j >= tour.size() - 1)\n\t\t\t\t\t\t \tj = 0;\n\t\t\t\t\t\t}\n\t\t\t\t\t\ttour.set(tour.size() - 1, tour.get(0));\n\t\t\t\t\t\t//System.out.println(\"Improvement applied->case 2..\");\n\t\t\t\t }\n\t\t\t\t} else {\n\t\t\t\t dlb.put(c1, true);\n\t\t\t\t}\n\t\n\t\t }\n\t\t}\n\n }","title":""},{"docid":"ae7cccbc2e14c4365876a81e3c3f2e77","score":"0.53374946","text":"private void insertionSort(){\n\t\tfor (int e=1; e-1;d--){\r\n\t\t\t\tif(bots.get(d+1).getNumBeeps() 0) {\n/* 542 */ return j + 1;\n/* */ }\n/* 544 */ while (i <= j) {\n/* 545 */ k = i + (j - i) / 2;\n/* 546 */ MarkData markData1 = this.marks.elementAt(k);\n/* 547 */ m = compare(paramMarkData, markData1);\n/* */ \n/* 549 */ if (m == 0)\n/* */ {\n/* 551 */ return k; } \n/* 552 */ if (m < 0) {\n/* 553 */ j = k - 1; continue;\n/* */ } \n/* 555 */ i = k + 1;\n/* */ } \n/* */ \n/* */ \n/* */ \n/* 560 */ return (m < 0) ? k : (k + 1);\n/* */ }","title":""},{"docid":"2540e7124e8a748c98f9766d025f7255","score":"0.5313515","text":"void sortSquidL(Squid[] a, int many) {\n for (int m = many; m > 1; m--) {\n int k = 0;\n for (int j = 1; j a[k].legs) k = j;\n }\n swapSquid(a, m-1, k);\n }\n}","title":""},{"docid":"04c56aaf2cf4ad99407e19d0f48ac25a","score":"0.53018624","text":"void preOrder();","title":""},{"docid":"91ed777fb8ae57e4c70b328df3bc70e5","score":"0.5292525","text":"public void func_70299_a(int par1, ItemStack par2ItemStack)\n/* */ {\n/* 131 */ this.furnaceItemStacks[par1] = par2ItemStack;\n/* */ \n/* 133 */ if ((par2ItemStack != null) && (par2ItemStack.field_77994_a > func_70297_j_()))\n/* */ {\n/* 135 */ par2ItemStack.field_77994_a = func_70297_j_();\n/* */ }\n/* */ }","title":""},{"docid":"e317a71f3a9909ad50735e0adde56f73","score":"0.52908826","text":"public T put(long var1_1, T var3_2) {\n block4 : {\n var4_3 = (int)(var1_1 & (long)this.mask);\n var5_4 = this.table[var4_3];\n do {\n if (var5_4 == null) {\n this.table[var4_3] = new Entry(var1_1, var3_2, this.table[var4_3]);\n var7_5 = this.size;\n this.size = var7_5 + 1;\n if (var7_5 < this.threshold) return null;\n break block4;\n }\n if (var5_4.key == var1_1) break;\n var5_4 = var5_4.next;\n } while (true);\n var6_14 = var5_4.value;\n var5_4.value = var3_2;\n return var6_14;\n }\n var8_6 = 2 * this.capacity;\n var9_7 = new Entry[var8_6];\n var10_8 = this.table;\n var11_9 = var8_6 - 1;\n var12_10 = 0;\n do {\n ** if (var12_10 >= var10_8.length) goto lbl26\nlbl24: // 1 sources:\n ** if ((var13_11 = var10_8[var12_10]) == null) goto lbl38\nlbl25: // 1 sources:\n ** GOTO lbl31\nlbl26: // 1 sources:\n this.table = var9_7;\n this.capacity = var8_6;\n this.threshold = (int)((float)var8_6 * this.loadFactor);\n this.mask = -1 + this.capacity;\n return null;\nlbl31: // 1 sources:\n var10_8[var12_10] = null;\n do {\n var14_12 = var13_11.next;\n var15_13 = (int)(var13_11.key & (long)var11_9);\n var13_11.next = var9_7[var15_13];\n var9_7[var15_13] = var13_11;\n } while ((var13_11 = var14_12) != null);\nlbl38: // 2 sources:\n ++var12_10;\n } while (true);\n }","title":""},{"docid":"d0a50609234726f2b3ce92605a7feb30","score":"0.52826387","text":"public ur b(qx player, int i)\r\n/* 44: */ {\r\n/* 45:36 */ ur itemstack = null;\r\n/* 46:37 */ sr slot = (sr)this.c.get(i);\r\n/* 47:38 */ if ((slot != null) && (slot.d()))\r\n/* 48: */ {\r\n/* 49:39 */ ur itemstack1 = slot.c();\r\n/* 50:40 */ itemstack = itemstack1.l();\r\n/* 51:41 */ if (i < 9)\r\n/* 52: */ {\r\n/* 53:42 */ if (!a(itemstack1, 9, 45, true)) {\r\n/* 54:43 */ return null;\r\n/* 55: */ }\r\n/* 56: */ }\r\n/* 57:45 */ else if (!a(itemstack1, 0, 9, false)) {\r\n/* 58:46 */ return null;\r\n/* 59: */ }\r\n/* 60:48 */ if (itemstack1.a == 0) {\r\n/* 61:49 */ slot.c(null);\r\n/* 62: */ } else {\r\n/* 63:51 */ slot.e();\r\n/* 64: */ }\r\n/* 65:53 */ if (itemstack1.a != itemstack.a) {\r\n/* 66:54 */ slot.a(player, itemstack1);\r\n/* 67: */ } else {\r\n/* 68:56 */ return null;\r\n/* 69: */ }\r\n/* 70: */ }\r\n/* 71:59 */ return itemstack;\r\n/* 72: */ }","title":""},{"docid":"e4c2b3c82568f5ee1fb8827db67f3328","score":"0.52759075","text":"private void fallbackSort(int last) {\n data.block[0] = data.block[last + 1];\n fallbackSortImpl(last + 1);\n\n for (int i = 0; i < last + 1; i++)\n --data.fmap[i];\n\n for (int i = 0; i < last + 1; i++) {\n if (data.fmap[i] != -1)\n continue;\n\n data.fmap[i] = last;\n break;\n }\n }","title":""},{"docid":"b1df26d5a5f510a4119b1945411f2ed9","score":"0.52703583","text":"private void lruAlgorithm() {\n int pointer = -1;\n LinkedList lstPageRepl = new LinkedList<>();\n for (int i = 0; i < pageAccess.length; i++) {\n if(i != 0)\n lruCopyHistory(i-1, i);\n\n if(lstPageRepl.contains(pageAccess[i])) {\n lstPageRepl.remove(lstPageRepl.indexOf(pageAccess[i]));\n lstPageRepl.addFirst(pageAccess[i]);\n allLinkedListsHistory.add(new LinkedList<>(lstPageRepl));\n continue;\n }\n\n if(lstPageRepl.size() < amountPageFrames) {\n pointer++;\n }\n else {\n int toReplace = lstPageRepl.getLast();\n Integer[] actualArrayHistory = IntStream.of( pageReplacementHistory[i] ).boxed().toArray( Integer[]::new );\n pointer = Arrays.asList(actualArrayHistory).indexOf(toReplace);\n lstPageRepl.removeLast();\n }\n lstPageRepl.addFirst(pageAccess[i]);\n pageReplacementHistory[i][pointer] = pageAccess[i];\n allLinkedListsHistory.add(new LinkedList<>(lstPageRepl));\n }\n }","title":""},{"docid":"5dd708353f4783c2f04cf6e7568fde3d","score":"0.52651733","text":"public ur b(qx player, int i)\r\n/* 45: */ {\r\n/* 46:35 */ ur itemstack = null;\r\n/* 47:36 */ sr slot = (sr)this.c.get(i);\r\n/* 48:37 */ if ((slot != null) && (slot.d()))\r\n/* 49: */ {\r\n/* 50:38 */ ur itemstack1 = slot.c();\r\n/* 51:39 */ itemstack = itemstack1.l();\r\n/* 52:40 */ if (i < 9)\r\n/* 53: */ {\r\n/* 54:41 */ if (!a(itemstack1, 9, 45, true)) {\r\n/* 55:42 */ return null;\r\n/* 56: */ }\r\n/* 57: */ }\r\n/* 58:44 */ else if (!a(itemstack1, 0, 9, false)) {\r\n/* 59:45 */ return null;\r\n/* 60: */ }\r\n/* 61:47 */ if (itemstack1.a == 0) {\r\n/* 62:48 */ slot.c(null);\r\n/* 63: */ } else {\r\n/* 64:50 */ slot.e();\r\n/* 65: */ }\r\n/* 66:52 */ if (itemstack1.a != itemstack.a) {\r\n/* 67:53 */ slot.a(player, itemstack1);\r\n/* 68: */ } else {\r\n/* 69:55 */ return null;\r\n/* 70: */ }\r\n/* 71: */ }\r\n/* 72:58 */ return itemstack;\r\n/* 73: */ }","title":""},{"docid":"64eab175a3f3aea96033eade29b5da80","score":"0.52643365","text":"public ABObject computeFinalBlocks2() {\n ArrayList allBlocks = getAllBlocks();\n if(pigs != null)\n allBlocks.addAll(pigs);\n ArrayList piggies = new ArrayList();\n if(pigs != null)\n piggies.addAll(pigs);\n\n Point total_com = getCenterOfMass(allBlocks);\n Point pigs_com = getCenterOfMass(piggies);\n System.out.println(\"Totol COM \" + total_com);\n System.out.println(\"Pig COM \" + pigs_com);\n\n System.out.println(\"Distance Pig COM and Total Com \" + (distance(pigs_com, total_com)));\n if(distance(pigs_com, total_com) < 70 || true)\n {\n ABObject top_target = topToppleTarget(total_com);\n ABObject bottom_target = bottomSlideTarget(total_com);\n System.out.println(\"top_tagert X: \" + ((top_target)));\n System.out.println(\"bootom_tagert X: \" + ((bottom_target)));\n\n if(top_target!=null)\n return top_target;\n else if(bottom_target!=null)\n return bottom_target;\n }\n return null;\n }","title":""},{"docid":"d16759d2069d172d01891d7ad7f81427","score":"0.52624166","text":"public void sort() {\n\t\tfor(int i = 0; i < rij.length-1; i++){\n\t\t\tint min = i;\n\t\t\tfor(int j = i+1; j 0; var4--) {\n/* */ \n/* 245 */ func_175905_a(worldIn, p_175923_2_, Blocks.vine, p_175923_3_);\n/* 246 */ p_175923_2_ = p_175923_2_.offsetDown();\n/* */ } \n/* */ }","title":""},{"docid":"bbd349e6e54e8dc2974e9cc799af55e9","score":"0.52301526","text":"public void func_145845_h()\n/* */ {\n/* 322 */ boolean flag = this.furnaceBurnTime > 0;\n/* 323 */ boolean flag1 = false;\n/* 324 */ this.count += 1;\n/* 325 */ if (this.furnaceBurnTime > 0)\n/* */ {\n/* 327 */ this.furnaceBurnTime -= 1;\n/* */ }\n/* */ \n/* 330 */ if (!this.field_145850_b.field_72995_K)\n/* */ {\n/* 332 */ if (this.bellows < 0) { getBellows();\n/* */ }\n/* 334 */ if ((this.count % (this.speedBoost ? 20 : 40) == 0) && (this.aspects.size() > 0)) {\n/* 335 */ AspectList exlude = new AspectList();\n/* 336 */ int deep = 0;\n/* 337 */ TileEntity tile = null;\n/* 338 */ while (deep < 5) {\n/* 339 */ deep++;\n/* 340 */ tile = this.field_145850_b.func_147438_o(this.field_145851_c, this.field_145848_d + deep, this.field_145849_e);\n/* 341 */ if (!(tile instanceof TileAlembic)) break;\n/* 342 */ TileAlembic alembic = (TileAlembic)tile;\n/* 343 */ if ((alembic.aspect != null) && (alembic.amount < alembic.maxAmount) && (this.aspects.getAmount(alembic.aspect) > 0)) {\n/* 344 */ takeFromContainer(alembic.aspect, 1);\n/* 345 */ alembic.addToContainer(alembic.aspect, 1);\n/* 346 */ exlude.merge(alembic.aspect, 1);\n/* 347 */ this.field_145850_b.func_147471_g(this.field_145851_c, this.field_145848_d, this.field_145849_e);\n/* 348 */ this.field_145850_b.func_147471_g(this.field_145851_c, this.field_145848_d + deep, this.field_145849_e);\n/* */ }\n/* 350 */ tile = null;\n/* */ }\n/* */ \n/* */ \n/* */ \n/* */ \n/* 356 */ deep = 0;\n/* 357 */ while (deep < 5) {\n/* 358 */ deep++;\n/* 359 */ tile = this.field_145850_b.func_147438_o(this.field_145851_c, this.field_145848_d + deep, this.field_145849_e);\n/* 360 */ if (!(tile instanceof TileAlembic)) break;\n/* 361 */ TileAlembic alembic = (TileAlembic)tile;\n/* 362 */ if ((alembic.aspect == null) || (alembic.amount == 0)) {\n/* 363 */ Aspect as = null;\n/* 364 */ if (alembic.aspectFilter == null) {\n/* 365 */ as = takeRandomAspect(exlude);\n/* */ }\n/* 367 */ else if (takeFromContainer(alembic.aspectFilter, 1)) {\n/* 368 */ as = alembic.aspectFilter;\n/* */ }\n/* */ \n/* 371 */ if (as != null) {\n/* 372 */ alembic.addToContainer(as, 1);\n/* 373 */ this.field_145850_b.func_147471_g(this.field_145851_c, this.field_145848_d, this.field_145849_e);\n/* 374 */ this.field_145850_b.func_147471_g(this.field_145851_c, this.field_145848_d + deep, this.field_145849_e);\n/* 375 */ break;\n/* */ }\n/* */ }\n/* */ }\n/* */ }\n/* */ \n/* */ \n/* */ \n/* */ \n/* */ \n/* 385 */ if ((this.furnaceBurnTime == 0) && (canSmelt()))\n/* */ {\n/* 387 */ this.currentItemBurnTime = (this.furnaceBurnTime = TileEntityFurnace.func_145952_a(this.furnaceItemStacks[1]));\n/* */ \n/* 389 */ if (this.furnaceBurnTime > 0)\n/* */ {\n/* 391 */ flag1 = true;\n/* 392 */ this.speedBoost = false;\n/* */ \n/* 394 */ if (this.furnaceItemStacks[1] != null)\n/* */ {\n/* 396 */ if (this.furnaceItemStacks[1].func_77969_a(new ItemStack(thaumcraft.common.config.ConfigItems.itemResource, 1, 0))) {\n/* 397 */ this.speedBoost = true;\n/* */ }\n/* 399 */ this.furnaceItemStacks[1].field_77994_a -= 1;\n/* */ \n/* 401 */ if (this.furnaceItemStacks[1].field_77994_a == 0)\n/* */ {\n/* 403 */ this.furnaceItemStacks[1] = this.furnaceItemStacks[1].func_77973_b().getContainerItem(this.furnaceItemStacks[1]);\n/* */ }\n/* */ }\n/* */ }\n/* */ }\n/* */ \n/* 409 */ if ((isBurning()) && (canSmelt()))\n/* */ {\n/* 411 */ this.furnaceCookTime += 1;\n/* */ \n/* 413 */ if (this.furnaceCookTime >= this.smeltTime)\n/* */ {\n/* 415 */ this.furnaceCookTime = 0;\n/* 416 */ smeltItem();\n/* 417 */ flag1 = true;\n/* */ }\n/* */ }\n/* */ else\n/* */ {\n/* 422 */ this.furnaceCookTime = 0;\n/* */ }\n/* */ \n/* 425 */ if (flag != this.furnaceBurnTime > 0)\n/* */ {\n/* 427 */ flag1 = true;\n/* 428 */ this.field_145850_b.func_147471_g(this.field_145851_c, this.field_145848_d, this.field_145849_e);\n/* */ }\n/* */ }\n/* */ \n/* 432 */ if (flag1)\n/* */ {\n/* 434 */ func_70296_d();\n/* */ }\n/* */ }","title":""},{"docid":"3e7d8fc5ee34c3a50a78f092d63bf0a8","score":"0.52026606","text":"@Override\n\t\tpublic Bloc[] genererBlocs() {\n\t\t\treturn null;\n\t\t}","title":""},{"docid":"3e7d8fc5ee34c3a50a78f092d63bf0a8","score":"0.52026606","text":"@Override\n\t\tpublic Bloc[] genererBlocs() {\n\t\t\treturn null;\n\t\t}","title":""},{"docid":"3e7d8fc5ee34c3a50a78f092d63bf0a8","score":"0.52026606","text":"@Override\n\t\tpublic Bloc[] genererBlocs() {\n\t\t\treturn null;\n\t\t}","title":""},{"docid":"3e7d8fc5ee34c3a50a78f092d63bf0a8","score":"0.52026606","text":"@Override\n\t\tpublic Bloc[] genererBlocs() {\n\t\t\treturn null;\n\t\t}","title":""},{"docid":"3e7d8fc5ee34c3a50a78f092d63bf0a8","score":"0.52026606","text":"@Override\n\t\tpublic Bloc[] genererBlocs() {\n\t\t\treturn null;\n\t\t}","title":""},{"docid":"3e7d8fc5ee34c3a50a78f092d63bf0a8","score":"0.52026606","text":"@Override\n\t\tpublic Bloc[] genererBlocs() {\n\t\t\treturn null;\n\t\t}","title":""},{"docid":"3e7d8fc5ee34c3a50a78f092d63bf0a8","score":"0.52026606","text":"@Override\n\t\tpublic Bloc[] genererBlocs() {\n\t\t\treturn null;\n\t\t}","title":""},{"docid":"4514e5bebadc26519ebd188070fa0dc0","score":"0.51974565","text":"public void breadthFirstExplore() {\n for (ArrayList nodeArray : nodeGrid) {\n for (Node node : nodeArray) {\n node.parent = null;\n }\n }\n PriorityQueue frontierQueue = new PriorityQueue(1, new Comparator() {\n public int compare(Node a, Node b) {\n int distA = 0;\n int distB = 0;\n /*\n if (Ant.this.ants.getFoodTiles().size() > 0) {\n Tile closestFood = Ant.this.distanceSort(Ant.this.ants.getFoodTiles()).peek();\n distA = Ant.this.ants.getDistance(a.position, closestFood);\n distB = Ant.this.ants.getDistance(b.position, closestFood);\n } else if (Ant.this.closestUnseen != null) {\n distA = Ant.this.ants.getDistance(a.position, Ant.this.closestUnseen);\n distB = Ant.this.ants.getDistance(b.position, Ant.this.closestUnseen);\n }\n */\n return (distA + a.length()) - (distB + b.length());\n }\n });\n frontierQueue.add(nodeGrid.get(this.position.getRow()).get(this.position.getCol()));\n HashSet frontierSet = new HashSet(frontierQueue);\n HashSet exploredSet = new HashSet();\n List directions = new ArrayList(EnumSet.allOf(Aim.class));\n\n while (frontierQueue.size() > 0) {\n Node path = frontierQueue.poll();\n frontierSet.remove(path);\n exploredSet.add(path);\n\n if (!seen.contains(path.position)) { \n setGoal(path.retracePath());\n exploring = true;\n return;\n }\n\n for (Aim direction : directions) {\n Tile neighborTile = ants.getTile(path.position, direction);\n Node neighbor = nodeGrid.get(neighborTile.getRow()).get(neighborTile.getCol());\n if (neighbor.walkable) {\n if (!frontierSet.contains(neighbor) && !exploredSet.contains(neighbor)) {\n neighbor.parent = path;\n frontierQueue.add(neighbor);\n frontierSet.add(neighbor);\n }\n }\n }\n }\n }","title":""},{"docid":"ce13daa00eff173d3955e92746a02978","score":"0.5187312","text":"public static void main(String args[]){\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n List l = new List();\n int blocks[] = new int[0];\n try {\n String inp[] = br.readLine().split(\" \");\n for(String s : inp){\n int d = Integer.parseInt(s);\n if(d != -1){\n l.append(d);\n }\n }\n int k = Integer.parseInt(br.readLine());\n inp = br.readLine().split(\" \");\n blocks = new int[k];\n for(int i = 0; i < k; i++){\n blocks[i] = Integer.parseInt(inp[i]);\n }\n } catch (IOException e) {\n e.printStackTrace();\n }\n List ans = reverseBlocks(l.head,blocks);\n printList(ans);\n// for(int i=0;i<5;i++){\n// try {\n// l.append(Integer.parseInt(br.readLine()));\n// } catch (IOException e) {\n// e.printStackTrace();\n// }\n// }\n// printList(l);\n// l.insertBefore(1,6);\n// printList(l);\n }","title":""},{"docid":"a9a558cf37f3bc896d904c2abd138e4a","score":"0.51795244","text":"void executeSort() {\n\t\tinsertionSort();\n//\t\tquickSort(list_, 0, 499);\n\n\t}","title":""},{"docid":"d360adbb4631e0887c48786f2b3c909a","score":"0.51668936","text":"private static int[] effInsertionSort(int[] arr) {\n\t\tint temp1 = 0;\n\t\tfor(int i = 1; i < arr.length; i++) {\n\t\t int j = i - 1;\n\t\t\tint temp = arr[i];\n\t\t\tint insertionPoint = getBinarySearch(arr, 0, j, temp);\n\t\t System.out.println(\"INSER\"+insertionPoint);\n\t\t\twhile(insertionPoint inputTrack, Stack sideTrack, Stack exitTrack){\n\n\t\t\n\t\twhile(!inputTrack.isEmpty()){\n\t\t\tint x = 0;\n\n\t\t\tif(exitTrack.isEmpty()){\n\t\t\t\tx = inputTrack.pop();\n\t\t\t\tSystem.out.println(\"\\nMove \"+x +\" from input to exit\");\n\t\t\t\texitTrack.push(x);\t\n\n\t\t\t}else if(inputTrack.peek() >= exitTrack.peek() && sideTrack.isEmpty() ){\n\t\t\t\tx = inputTrack.pop();\n\t\t\t\tSystem.out.println(\"\\nMove \"+x +\" from input to exit\");\n\t\t\t\texitTrack.push(x);\t\n\n\t\t\t}else if(inputTrack.peek() >= exitTrack.peek() && !sideTrack.isEmpty()){\n\t\t\t\tif(inputTrack.peek() >= sideTrack.peek()){\n\t\t\t\t\tx = sideTrack.pop();\n\t\t\t\t\tSystem.out.println(\"\\nMove \"+x +\" from siding to exit\");\n\t\t\t\t\texitTrack.push(x);\n\t\t\t\t}else{\n\t\t\t\t\tx=inputTrack.pop();\n\t\t\t\t\tSystem.out.println(\"\\nMove \"+x +\" from input to exit\");\n\t\t\t\t\texitTrack.push(x);\t\n\t\t\t\t}\n\n\t\t\t}else if(inputTrack.peek() < exitTrack.peek() && !sideTrack.isEmpty()){\n\t\t\t\tif(inputTrack.peek() < sideTrack.peek()){\n\t\t\t\t\tx= exitTrack.pop();\n\t\t\t\t\tSystem.out.println(\"\\nMove \"+x +\" from exit to siding\");\n\t\t\t\t\tsideTrack.push(x);\n\t\t\t\t}\n\n\t\t\t}\n\t\t\telse if(inputTrack.peek() < exitTrack.peek() && sideTrack.isEmpty()){\n\t\t\t\tx= exitTrack.pop();\n\t\t\t\tSystem.out.println(\"\\nMove \"+x +\" from exit to siding\");\n\t\t\t\tsideTrack.push(x);\n\t\t\t}\n\n\n\t\t}\n\t\tsortSideTrack(sideTrack,exitTrack);\n\n\t\t\n\n\t}","title":""},{"docid":"496e8fcf00a291c14f9e3b7265c93a83","score":"0.5143301","text":"protected TryCatchBlockSorter(int api, MethodVisitor methodVisitor, int access, String name, String descriptor, String signature, String[] exceptions) {\n/* 94 */ super(api, access, name, descriptor, signature, exceptions);\n/* 95 */ this.mv = methodVisitor;\n/* */ }","title":""},{"docid":"8c2a42519cad6d33751ecd48620f54b7","score":"0.51308614","text":"private void phase2() throws LinkerException {\n\t\tfor(String symbol : this.tableE.getSymbolAddress().keySet()) {\n\t\t\tShort addressValue = this.tableP.getAddress(symbol);\n\t\t\tif(addressValue == null)\n\t\t\t\tthrow new LinkerException(\"The symbol \" + symbol + \" wasn't found!\");\n\t\t\t\n\t\t\tthis.textBuffer.relocate(this.tableE.getAddress(symbol), addressValue);\n\t\t}\t\n\t\t\n\t\t// Proccess each R entry\n\t\tfor(Short addr : this.tableR.getAddressAddressModule().keySet()) {\n\t\t\tthis.textBuffer.relocate(addr, this.tableR.getAddressAddressModule().get(addr));\n\t\t}\t\n\t}","title":""},{"docid":"f9589436343fcbc9ea7eee29ce424800","score":"0.5128142","text":"private ArrayList findStable(int block){\n\t\t//TBD\n\t\t// we know current support value Lsupport Rsupport\n\t\t// check the board.\n\t\tArrayList que = new ArrayList();\n\t\tfor (int i = -15;i <= 15; ++i){\n\t\t\tif(Board[i+15] == 0){\n\t\t\t\tif ((Lsupport - block*(i+3))*(Rsupport - block*(i+1)) <= 0){\n\t\t\t\t\t// no tipping\n\t\t\t\t\t// put i into\n\t\t\t\t\tque.add(i);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn que;\n\t\t\n\t}","title":""},{"docid":"2a3d27b01ea769e740296a3c9c5a1925","score":"0.5127093","text":"public boolean method_6351(ahb var1, Random var2, int var3, int var4, int var5) {\r\n byte var7 = 3;\r\n String[] var6 = class_752.method_4253();\r\n int var8 = var2.nextInt(2) + 2;\r\n int var9 = var2.nextInt(2) + 2;\r\n int var10 = 0;\r\n int var11 = var3 - var8 - 1;\r\n\r\n int var12;\r\n int var13;\r\n int var10000;\r\n int var10001;\r\n label385:\r\n while(true) {\r\n var10000 = var11;\r\n\r\n label382:\r\n while(var10000 <= var3 + var8 + 1) {\r\n var10000 = var4 - 1;\r\n if(var6 == null) {\r\n break label385;\r\n }\r\n\r\n var12 = var10000;\r\n\r\n label379:\r\n do {\r\n var10000 = var12;\r\n var10001 = var4 + var7 + 1;\r\n\r\n label376:\r\n while(true) {\r\n if(var10000 > var10001) {\r\n break label379;\r\n }\r\n\r\n var10000 = var5 - var9 - 1;\r\n if(var6 == null) {\r\n continue label382;\r\n }\r\n\r\n var13 = var10000;\r\n\r\n while(true) {\r\n if(var13 > var5 + var9 + 1) {\r\n break label376;\r\n }\r\n\r\n awt var14 = var1.getBlock(var11, var12, var13).method_2424();\r\n var10000 = var12;\r\n var10001 = var4 - 1;\r\n if(var6 == null) {\r\n break;\r\n }\r\n\r\n if(var6 != null) {\r\n label333: {\r\n if(var12 == var10001) {\r\n var10000 = var14.method_5063();\r\n if(var6 == null) {\r\n break label333;\r\n }\r\n\r\n if(var10000 == 0) {\r\n return false;\r\n }\r\n }\r\n\r\n var10000 = var12;\r\n }\r\n\r\n var10001 = var4 + var7 + 1;\r\n }\r\n\r\n if(var6 != null) {\r\n label341: {\r\n if(var10000 == var10001) {\r\n var10000 = var14.method_5063();\r\n if(var6 == null) {\r\n break label341;\r\n }\r\n\r\n if(var10000 == 0) {\r\n return false;\r\n }\r\n }\r\n\r\n var10000 = var11;\r\n }\r\n\r\n var10001 = var3 - var8 - 1;\r\n }\r\n\r\n label394: {\r\n label395: {\r\n if(var6 != null) {\r\n label396: {\r\n if(var10000 != var10001) {\r\n var10000 = var11;\r\n var10001 = var3 + var8 + 1;\r\n if(var6 == null) {\r\n break label396;\r\n }\r\n\r\n if(var11 != var10001) {\r\n var10000 = var13;\r\n var10001 = var5 - var9 - 1;\r\n if(var6 == null) {\r\n break label396;\r\n }\r\n\r\n if(var13 != var10001) {\r\n var10000 = var13;\r\n var10001 = var5 + var9 + 1;\r\n if(var6 == null) {\r\n break label396;\r\n }\r\n\r\n if(var13 != var10001) {\r\n break label394;\r\n }\r\n }\r\n }\r\n }\r\n\r\n var10000 = var12;\r\n if(var6 == null) {\r\n break label395;\r\n }\r\n\r\n var10001 = var4;\r\n }\r\n }\r\n\r\n if(var10000 != var10001) {\r\n break label394;\r\n }\r\n\r\n var10000 = var1.method_34(var11, var12, var13);\r\n }\r\n\r\n if(var6 != null) {\r\n if(var10000 == 0) {\r\n break label394;\r\n }\r\n\r\n var10000 = var1.method_34(var11, var12 + 1, var13);\r\n }\r\n\r\n if(var10000 != 0) {\r\n ++var10;\r\n }\r\n }\r\n\r\n ++var13;\r\n if(var6 == null) {\r\n break label376;\r\n }\r\n }\r\n }\r\n\r\n ++var12;\r\n } while(var6 != null);\r\n\r\n ++var11;\r\n if(var6 != null) {\r\n continue label385;\r\n }\r\n break;\r\n }\r\n\r\n var10000 = var10;\r\n break;\r\n }\r\n\r\n if(var6 != null) {\r\n if(var10000 >= 1) {\r\n label421: {\r\n var10000 = var10;\r\n byte var21 = 5;\r\n if(var6 != null) {\r\n if(var10 > 5) {\r\n break label421;\r\n }\r\n\r\n var10000 = var3 - var8;\r\n var21 = 1;\r\n }\r\n\r\n var11 = var10000 - var21;\r\n\r\n label298:\r\n while(true) {\r\n var10000 = var11;\r\n\r\n label295:\r\n while(var10000 <= var3 + var8 + 1) {\r\n var10000 = var4 + var7;\r\n if(var6 == null) {\r\n break label298;\r\n }\r\n\r\n var12 = var10000;\r\n\r\n label292:\r\n do {\r\n var10000 = var12;\r\n var10001 = var4 - 1;\r\n\r\n label289:\r\n while(true) {\r\n if(var10000 < var10001) {\r\n break label292;\r\n }\r\n\r\n var10000 = var5 - var9 - 1;\r\n if(var6 == null) {\r\n continue label295;\r\n }\r\n\r\n var13 = var10000;\r\n\r\n while(true) {\r\n if(var13 > var5 + var9 + 1) {\r\n break label289;\r\n }\r\n\r\n label283: {\r\n label403: {\r\n var10000 = var11;\r\n if(var6 != null) {\r\n label404: {\r\n var10001 = var3 - var8 - 1;\r\n if(var6 == null) {\r\n break;\r\n }\r\n\r\n if(var11 != var10001) {\r\n var10000 = var12;\r\n if(var6 == null) {\r\n break label404;\r\n }\r\n\r\n if(var12 != var4 - 1) {\r\n var10000 = var13;\r\n if(var6 == null) {\r\n break label404;\r\n }\r\n\r\n if(var13 != var5 - var9 - 1) {\r\n var10000 = var11;\r\n if(var6 == null) {\r\n break label404;\r\n }\r\n\r\n if(var11 != var3 + var8 + 1) {\r\n var10000 = var12;\r\n if(var6 == null) {\r\n break label404;\r\n }\r\n\r\n if(var12 != var4 + var7 + 1) {\r\n if(var6 == null) {\r\n break label283;\r\n }\r\n\r\n if(var13 != var5 + var9 + 1) {\r\n break label403;\r\n }\r\n }\r\n }\r\n }\r\n }\r\n }\r\n\r\n var10000 = var12;\r\n }\r\n }\r\n\r\n if(var6 != null) {\r\n label257: {\r\n if(var10000 >= 0) {\r\n var10000 = var1.getBlock(var11, var12 - 1, var13).method_2424().method_5063();\r\n if(var6 == null) {\r\n break label257;\r\n }\r\n\r\n if(var10000 == 0) {\r\n var1.method_2056(var11, var12, var13);\r\n if(var6 != null) {\r\n break label283;\r\n }\r\n }\r\n }\r\n\r\n var10000 = var1.getBlock(var11, var12, var13).method_2424().method_5063();\r\n }\r\n }\r\n\r\n if(var6 != null) {\r\n if(var10000 == 0) {\r\n break label283;\r\n }\r\n\r\n var10000 = var12;\r\n }\r\n\r\n if(var6 != null) {\r\n label249: {\r\n if(var10000 == var4 - 1) {\r\n var10000 = var2.nextInt(4);\r\n if(var6 == null) {\r\n break label249;\r\n }\r\n\r\n if(var10000 != 0) {\r\n var1.method_2054(var11, var12, var13, class_1192.field_6075, 0, 2);\r\n if(var6 != null) {\r\n break label283;\r\n }\r\n }\r\n }\r\n\r\n var1.method_2054(var11, var12, var13, class_1192.field_6029, 0, 2);\r\n }\r\n }\r\n\r\n if(var6 != null) {\r\n break label283;\r\n }\r\n }\r\n\r\n var1.method_2056(var11, var12, var13);\r\n }\r\n\r\n ++var13;\r\n if(var6 == null) {\r\n break label289;\r\n }\r\n }\r\n }\r\n\r\n --var12;\r\n } while(var6 != null);\r\n\r\n ++var11;\r\n if(var6 != null) {\r\n continue label298;\r\n }\r\n break;\r\n }\r\n\r\n var10000 = 0;\r\n break;\r\n }\r\n\r\n var11 = var10000;\r\n\r\n label215:\r\n while(true) {\r\n var10000 = var11;\r\n\r\n label212:\r\n while(var10000 < 2) {\r\n if(var6 == null) {\r\n break label215;\r\n }\r\n\r\n var12 = 0;\r\n\r\n while(true) {\r\n if(var12 < 3) {\r\n label407: {\r\n var13 = var3 + var2.nextInt(var8 * 2 + 1) - var8;\r\n int var15 = var5 + var2.nextInt(var9 * 2 + 1) - var9;\r\n var10000 = var1.method_34(var13, var4, var15);\r\n if(var6 == null) {\r\n continue label212;\r\n }\r\n\r\n label414: {\r\n if(var6 != null) {\r\n if(var10000 == 0) {\r\n break label414;\r\n }\r\n\r\n var10000 = 0;\r\n }\r\n\r\n int var16 = var10000;\r\n var10000 = var1.getBlock(var13 - 1, var4, var15).method_2424().method_5063();\r\n if(var6 != null) {\r\n if(var10000 != 0) {\r\n ++var16;\r\n }\r\n\r\n var10000 = var1.getBlock(var13 + 1, var4, var15).method_2424().method_5063();\r\n }\r\n\r\n if(var6 != null) {\r\n if(var10000 != 0) {\r\n ++var16;\r\n }\r\n\r\n var10000 = var1.getBlock(var13, var4, var15 - 1).method_2424().method_5063();\r\n }\r\n\r\n if(var6 != null) {\r\n if(var10000 != 0) {\r\n ++var16;\r\n }\r\n\r\n var10000 = var1.getBlock(var13, var4, var15 + 1).method_2424().method_5063();\r\n }\r\n\r\n if(var6 != null) {\r\n if(var10000 != 0) {\r\n ++var16;\r\n }\r\n\r\n var10000 = var16;\r\n }\r\n\r\n if(var6 != null) {\r\n if(var10000 != 1) {\r\n break label414;\r\n }\r\n\r\n var1.method_2054(var13, var4, var15, class_1192.field_6081, 0, 2);\r\n }\r\n\r\n class_1652[] var17 = class_1652.method_9098(field_6017, new class_1652[]{class_1010.field_5259.getBlock06(var2)});\r\n class_594 var18 = (class_594)var1.method_31(var13, var4, var15);\r\n if(var6 == null) {\r\n break;\r\n }\r\n\r\n if(var18 == null) {\r\n break label407;\r\n }\r\n\r\n class_1652.method_9096(var2, var17, var18, 8);\r\n if(var6 != null) {\r\n break label407;\r\n }\r\n }\r\n\r\n ++var12;\r\n if(var6 != null) {\r\n continue;\r\n }\r\n }\r\n }\r\n\r\n ++var11;\r\n break;\r\n }\r\n\r\n if(var6 != null) {\r\n continue label215;\r\n }\r\n break;\r\n }\r\n\r\n var1.method_2054(var3, var4, var5, class_1192.field_6079, 0, 2);\r\n break;\r\n }\r\n\r\n label166: {\r\n class_584 var20 = (class_584)var1.method_31(var3, var4, var5);\r\n class_584 var23 = var20;\r\n if(var6 != null) {\r\n if(var20 == null) {\r\n break label166;\r\n }\r\n\r\n var23 = var20;\r\n }\r\n\r\n var23.method_3123().method_5672(this.method_6404(var2));\r\n if(var6 != null) {\r\n return true;\r\n }\r\n }\r\n\r\n PrintStream var24 = System.err;\r\n StringBuilder var22 = new StringBuilder();\r\n String[] var19 = field_6018;\r\n var24.println(var22.append(\"Failed to fetch mob spawner entity at (\").append(var3).append(\", \").append(var4).append(\", \").append(var5).append(\")\").toString());\r\n return true;\r\n }\r\n }\r\n\r\n var10000 = 0;\r\n }\r\n\r\n return (boolean)var10000;\r\n }","title":""},{"docid":"e8e493885b692f7605eb127ea61957bf","score":"0.51266927","text":"public void tileTick()\r\n/* 43: */ {\r\n/* 44: 56 */ int co = this.Count;\r\n/* 45: 57 */ if (TileLogicStorage.this.Deadmap > 0)\r\n/* 46: */ {\r\n/* 47: 58 */ if (TileLogicStorage.this.Active)\r\n/* 48: */ {\r\n/* 49: 58 */ this.Count -= this.Dec;TileLogicStorage.this.Active = false;\r\n/* 50: */ }\r\n/* 51: 59 */ if (TileLogicStorage.this.Disabled)\r\n/* 52: */ {\r\n/* 53: 59 */ this.Count += this.Inc;TileLogicStorage.this.Disabled = false;\r\n/* 54: */ }\r\n/* 55: */ }\r\n/* 56: */ else\r\n/* 57: */ {\r\n/* 58: 61 */ if (TileLogicStorage.this.Active)\r\n/* 59: */ {\r\n/* 60: 61 */ this.Count += this.Inc;TileLogicStorage.this.Active = false;\r\n/* 61: */ }\r\n/* 62: 62 */ if (TileLogicStorage.this.Disabled)\r\n/* 63: */ {\r\n/* 64: 62 */ this.Count -= this.Dec;TileLogicStorage.this.Disabled = false;\r\n/* 65: */ }\r\n/* 66: */ }\r\n/* 67: 64 */ if (this.Count < 0) {\r\n/* 68: 64 */ this.Count = 0;\r\n/* 69: */ }\r\n/* 70: 65 */ if (this.Count > this.CountMax) {\r\n/* 71: 65 */ this.Count = this.CountMax;\r\n/* 72: */ }\r\n/* 73: 66 */ if (co != this.Count)\r\n/* 74: */ {\r\n/* 75: 67 */ TileLogicStorage.this.updateBlockChange();\r\n/* 76: 68 */ TileLogicStorage.this.playSound(\"random.click\", 0.3F, 0.5F, false);\r\n/* 77: */ }\r\n/* 78: 70 */ updatePowerState();\r\n/* 79: */ }","title":""},{"docid":"7b69549ae670c1b1fcb006f4e8af958c","score":"0.5116518","text":"protected boolean func_175806_a(World worldIn, StructureBoundingBox p_175806_2_, Random p_175806_3_, int p_175806_4_, int p_175806_5_, int p_175806_6_, int p_175806_7_, List p_175806_8_, int p_175806_9_) {\n/* 791 */ BlockPos var10 = new BlockPos(getXWithOffset(p_175806_4_, p_175806_6_), getYWithOffset(p_175806_5_), getZWithOffset(p_175806_4_, p_175806_6_));\n/* */ \n/* 793 */ if (p_175806_2_.func_175898_b((Vec3i)var10) && worldIn.getBlockState(var10).getBlock() != Blocks.dispenser) {\n/* */ \n/* 795 */ worldIn.setBlockState(var10, Blocks.dispenser.getStateFromMeta(getMetadataWithOffset(Blocks.dispenser, p_175806_7_)), 2);\n/* 796 */ TileEntity var11 = worldIn.getTileEntity(var10);\n/* */ \n/* 798 */ if (var11 instanceof TileEntityDispenser)\n/* */ {\n/* 800 */ WeightedRandomChestContent.func_177631_a(p_175806_3_, p_175806_8_, (TileEntityDispenser)var11, p_175806_9_);\n/* */ }\n/* */ \n/* 803 */ return true;\n/* */ } \n/* */ \n/* */ \n/* 807 */ return false;\n/* */ }","title":""},{"docid":"be03c617a4da1158cf39d58ec084ffd8","score":"0.51158047","text":"private void d(X var1_1) {\n block7 : {\n block8 : {\n var8_2 = a.f;\n var2_3 = new D();\n var3_4 = var1_1.o();\n while (var3_4.f()) {\n var4_5 = var3_4.e();\n var2_3.add(new j(var4_5, var1_1.s((q)var4_5), 0));\n var3_4.g();\n if (var8_2 == 0) {\n if (var8_2 == 0) continue;\n }\n break block7;\n }\n var3_4 = var1_1.p();\n while (var3_4.f()) {\n block9 : {\n var4_5 = var3_4.a();\n v0 = var1_1;\n if (var8_2 != 0) break block8;\n var5_6 = v0.l((d)var4_5).a();\n var6_7 = (t)var5_6.d();\n var5_6.g();\n while (var5_6.f()) {\n var7_8 = (t)var5_6.d();\n var2_3.add(new j(var4_5, new m((t)var6_7, var7_8), 1));\n var6_7 = var7_8;\n var5_6.g();\n if (var8_2 == 0) {\n if (var8_2 == 0) continue;\n }\n break block9;\n }\n var3_4.g();\n }\n if (var8_2 == 0) continue;\n }\n v0 = this.i;\n }\n var3_4 = v0.o();\n }\n while (var3_4.f()) {\n var4_5 = (Q)this.n.b(var3_4.e());\n var5_6 = var4_5.e();\n if (var8_2 != 0) return;\n if (!(var5_6 instanceof C)) ** GOTO lbl42\n var6_7 = var1_1.a((C)var5_6);\n var2_3.add(new j(var6_7, (Q)var4_5, 2));\n if (var8_2 == 0) ** GOTO lbl47\nlbl42: // 2 sources:\n if (!(var5_6 instanceof aj)) ** GOTO lbl-1000\n var6_7 = var1_1.a((aj)var5_6);\n var2_3.add(new j(var6_7, (Q)var4_5, 2));\n if (var8_2 != 0) lbl-1000: // 2 sources:\n {\n var2_3.add(new j((Object)null, (Q)var4_5, 2));\n }\nlbl47: // 4 sources:\n var3_4.g();\n if (var8_2 == 0) continue;\n }\n f.a(var2_3, new l(this));\n }","title":""},{"docid":"83c0575633dc0558e639cfc9dc10d902","score":"0.51136833","text":"public final void mo54117b(com.p280ss.android.socialbase.downloader.p906d.C20198c r3) {\n /*\n r2 = this;\n if (r3 != 0) goto L_0x0003\n return\n L_0x0003:\n java.lang.Class r0 = com.p280ss.android.socialbase.downloader.p906d.C20202d.class\n monitor-enter(r0)\n r1 = 524288(0x80000, float:7.34684E-40)\n boolean r1 = com.p280ss.android.socialbase.downloader.utils.C20356b.m67535a(r1) // Catch:{ Throwable -> 0x0028 }\n if (r1 == 0) goto L_0x001c\n android.util.SparseArray r1 = r2.f54690a // Catch:{ Throwable -> 0x0028 }\n int r3 = r1.indexOfValue(r3) // Catch:{ Throwable -> 0x0028 }\n if (r3 < 0) goto L_0x0028\n android.util.SparseArray r1 = r2.f54690a // Catch:{ Throwable -> 0x0028 }\n r1.removeAt(r3) // Catch:{ Throwable -> 0x0028 }\n goto L_0x0028\n L_0x001c:\n android.util.SparseArray r1 = r2.f54690a // Catch:{ Throwable -> 0x0028 }\n int r3 = r3.mo54106d() // Catch:{ Throwable -> 0x0028 }\n r1.remove(r3) // Catch:{ Throwable -> 0x0028 }\n goto L_0x0028\n L_0x0026:\n r3 = move-exception\n goto L_0x002a\n L_0x0028:\n monitor-exit(r0) // Catch:{ all -> 0x0026 }\n return\n L_0x002a:\n monitor-exit(r0) // Catch:{ all -> 0x0026 }\n throw r3\n */\n throw new UnsupportedOperationException(\"Method not decompiled: com.p280ss.android.socialbase.downloader.p906d.C20202d.mo54117b(com.ss.android.socialbase.downloader.d.c):void\");\n }","title":""},{"docid":"a2cdffa14f495899fac6350ae6c8fb18","score":"0.51093554","text":"public int[] method_6679(int var1, int var2, int var3, int var4) {\r\n int[] var6 = this.field_6573.method_6679(var1 - 1, var2 - 1, var3 + 2, var4 + 2);\r\n int[] var7 = this.field_6579.method_6679(var1 - 1, var2 - 1, var3 + 2, var4 + 2);\r\n String[] var10000 = class_752.method_4253();\r\n int[] var8 = class_1323.method_6956(var3 * var4);\r\n String[] var5 = var10000;\r\n int var9 = 0;\r\n\r\n do {\r\n int var20 = var9;\r\n\r\n label345:\r\n while(true) {\r\n if(var20 >= var4) {\r\n return var8;\r\n }\r\n\r\n int var10 = 0;\r\n\r\n while(true) {\r\n if(var10 >= var3) {\r\n break label345;\r\n }\r\n\r\n this.method_6677((long)(var10 + var1), (long)(var9 + var2));\r\n int var11 = var6[var10 + 1 + (var9 + 1) * (var3 + 2)];\r\n int var12 = var7[var10 + 1 + (var9 + 1) * (var3 + 2)];\r\n var20 = (var12 - 2) % 29;\r\n if(var5 == null) {\r\n break;\r\n }\r\n\r\n if(var5 != null) {\r\n var20 = var20 == 0?1:0;\r\n }\r\n\r\n int var13 = var20;\r\n var20 = var11;\r\n if(var5 != null) {\r\n if(var11 > 255) {\r\n field_6578.debug(\"old! \" + var11);\r\n }\r\n\r\n var20 = var11;\r\n }\r\n\r\n label355: {\r\n if(var5 != null) {\r\n label335: {\r\n if(var20 != 0) {\r\n var20 = var12;\r\n if(var5 == null) {\r\n break label335;\r\n }\r\n\r\n if(var12 >= 2) {\r\n var20 = (var12 - 2) % 29;\r\n if(var5 == null) {\r\n break label335;\r\n }\r\n\r\n if(var20 == 1) {\r\n var20 = var11;\r\n if(var5 == null) {\r\n break label335;\r\n }\r\n\r\n if(var11 < 128) {\r\n if(class_985.method_5725(var11 + 128) != null) {\r\n var8[var10 + var9 * var3] = var11 + 128;\r\n if(var5 != null) {\r\n break label355;\r\n }\r\n }\r\n\r\n var8[var10 + var9 * var3] = var11;\r\n if(var5 != null) {\r\n break label355;\r\n }\r\n }\r\n }\r\n }\r\n }\r\n\r\n var20 = this.method_6678(3);\r\n }\r\n }\r\n\r\n label356: {\r\n if(var5 != null) {\r\n label315: {\r\n if(var20 != 0) {\r\n var20 = var13;\r\n if(var5 == null) {\r\n break label315;\r\n }\r\n\r\n if(var13 == 0) {\r\n break label356;\r\n }\r\n }\r\n\r\n var20 = var11;\r\n }\r\n }\r\n\r\n int var14;\r\n int var15;\r\n int var10001;\r\n label304: {\r\n label357: {\r\n var14 = var20;\r\n var20 = var11;\r\n var10001 = class_985.field_4990.field_5050;\r\n if(var5 != null) {\r\n if(var11 == class_985.field_4990.field_5050) {\r\n var14 = class_985.field_5005.field_5050;\r\n if(var5 != null) {\r\n break label357;\r\n }\r\n }\r\n\r\n var20 = var11;\r\n var10001 = class_985.field_4992.field_5050;\r\n }\r\n\r\n if(var5 != null) {\r\n if(var20 == var10001) {\r\n var14 = class_985.field_5006.field_5050;\r\n if(var5 != null) {\r\n break label357;\r\n }\r\n }\r\n\r\n var20 = var11;\r\n var10001 = class_985.field_5015.field_5050;\r\n }\r\n\r\n if(var5 != null) {\r\n if(var20 == var10001) {\r\n var14 = class_985.field_5016.field_5050;\r\n if(var5 != null) {\r\n break label357;\r\n }\r\n }\r\n\r\n var20 = var11;\r\n var10001 = class_985.field_5017.field_5050;\r\n }\r\n\r\n if(var5 != null) {\r\n if(var20 == var10001) {\r\n var14 = class_985.field_4989.field_5050;\r\n if(var5 != null) {\r\n break label357;\r\n }\r\n }\r\n\r\n var20 = var11;\r\n var10001 = class_985.field_4993.field_5050;\r\n }\r\n\r\n if(var5 != null) {\r\n if(var20 == var10001) {\r\n var14 = class_985.field_5007.field_5050;\r\n if(var5 != null) {\r\n break label357;\r\n }\r\n }\r\n\r\n var20 = var11;\r\n var10001 = class_985.field_5020.field_5050;\r\n }\r\n\r\n if(var5 != null) {\r\n if(var20 == var10001) {\r\n var14 = class_985.field_5021.field_5050;\r\n if(var5 != null) {\r\n break label357;\r\n }\r\n }\r\n\r\n var20 = var11;\r\n var10001 = class_985.field_5018.field_5050;\r\n }\r\n\r\n if(var5 != null) {\r\n if(var20 == var10001) {\r\n var14 = class_985.field_5019.field_5050;\r\n if(var5 != null) {\r\n break label357;\r\n }\r\n }\r\n\r\n var20 = var11;\r\n var10001 = class_985.field_4989.field_5050;\r\n }\r\n\r\n if(var5 != null) {\r\n if(var20 == var10001) {\r\n var20 = this.method_6678(3);\r\n if(var5 != null) {\r\n if(var20 == 0) {\r\n var14 = class_985.field_5006.field_5050;\r\n if(var5 != null) {\r\n break label357;\r\n }\r\n }\r\n\r\n var20 = class_985.field_4992.field_5050;\r\n }\r\n\r\n var14 = var20;\r\n if(var5 != null) {\r\n break label357;\r\n }\r\n }\r\n\r\n var20 = var11;\r\n var10001 = class_985.field_5000.field_5050;\r\n }\r\n\r\n if(var5 != null) {\r\n if(var20 == var10001) {\r\n var14 = class_985.field_5001.field_5050;\r\n if(var5 != null) {\r\n break label357;\r\n }\r\n }\r\n\r\n var20 = var11;\r\n var10001 = class_985.field_5009.field_5050;\r\n }\r\n\r\n if(var5 != null) {\r\n if(var20 == var10001) {\r\n var14 = class_985.field_5010.field_5050;\r\n if(var5 != null) {\r\n break label357;\r\n }\r\n }\r\n\r\n var20 = var11;\r\n var10001 = class_985.field_4988.field_5050;\r\n }\r\n\r\n if(var5 != null) {\r\n if(var20 == var10001) {\r\n var14 = class_985.field_5012.field_5050;\r\n if(var5 != null) {\r\n break label357;\r\n }\r\n }\r\n\r\n var20 = var11;\r\n var10001 = class_985.field_4991.field_5050;\r\n }\r\n\r\n if(var5 != null) {\r\n if(var20 == var10001) {\r\n var14 = class_985.field_5022.field_5050;\r\n if(var5 != null) {\r\n break label357;\r\n }\r\n }\r\n\r\n var20 = var11;\r\n var10001 = class_985.field_5023.field_5050;\r\n }\r\n\r\n if(var5 != null) {\r\n if(var20 == var10001) {\r\n var14 = class_985.field_5024.field_5050;\r\n if(var5 != null) {\r\n break label357;\r\n }\r\n }\r\n\r\n var20 = var11;\r\n var10001 = class_985.field_5026.field_5050;\r\n }\r\n\r\n var20 = method_6680(var20, var10001);\r\n if(var5 != null) {\r\n if(var20 != 0) {\r\n var14 = class_985.field_5025.field_5050;\r\n if(var5 != null) {\r\n break label357;\r\n }\r\n }\r\n\r\n var20 = var11;\r\n }\r\n\r\n if(var5 == null) {\r\n break label304;\r\n }\r\n\r\n if(var20 == class_985.field_5012.field_5050) {\r\n var20 = this.method_6678(3);\r\n if(var5 == null) {\r\n break label304;\r\n }\r\n\r\n if(var20 == 0) {\r\n label207: {\r\n var15 = this.method_6678(2);\r\n var20 = var15;\r\n if(var5 != null) {\r\n if(var15 == 0) {\r\n var14 = class_985.field_4989.field_5050;\r\n if(var5 != null) {\r\n break label207;\r\n }\r\n }\r\n\r\n var20 = class_985.field_4992.field_5050;\r\n }\r\n\r\n var14 = var20;\r\n }\r\n }\r\n }\r\n }\r\n\r\n var20 = var13;\r\n }\r\n\r\n label358: {\r\n label359: {\r\n label360: {\r\n if(var5 != null) {\r\n if(var20 != 0) {\r\n var20 = var14;\r\n var10001 = var11;\r\n if(var5 == null) {\r\n break label360;\r\n }\r\n\r\n if(var14 != var11) {\r\n label184: {\r\n var20 = var14 + 128;\r\n if(var5 != null) {\r\n if(class_985.method_5725(var20) != null) {\r\n var14 += 128;\r\n if(var5 != null) {\r\n break label184;\r\n }\r\n }\r\n\r\n var20 = var11;\r\n }\r\n\r\n var14 = var20;\r\n }\r\n }\r\n }\r\n\r\n var20 = var14;\r\n }\r\n\r\n if(var5 == null) {\r\n break label359;\r\n }\r\n\r\n var10001 = var11;\r\n }\r\n\r\n if(var20 == var10001) {\r\n var8[var10 + var9 * var3] = var11;\r\n if(var5 != null) {\r\n break label358;\r\n }\r\n }\r\n\r\n var20 = var6[var10 + 1 + (var9 + 1 - 1) * (var3 + 2)];\r\n }\r\n\r\n var15 = var20;\r\n int var16 = var6[var10 + 1 + 1 + (var9 + 1) * (var3 + 2)];\r\n int var17 = var6[var10 + 1 - 1 + (var9 + 1) * (var3 + 2)];\r\n int var18 = var6[var10 + 1 + (var9 + 1 + 1) * (var3 + 2)];\r\n int var19 = 0;\r\n var20 = method_6680(var15, var11);\r\n if(var5 != null) {\r\n if(var20 != 0) {\r\n ++var19;\r\n }\r\n\r\n var20 = method_6680(var16, var11);\r\n }\r\n\r\n if(var5 != null) {\r\n if(var20 != 0) {\r\n ++var19;\r\n }\r\n\r\n var20 = method_6680(var17, var11);\r\n }\r\n\r\n if(var5 != null) {\r\n if(var20 != 0) {\r\n ++var19;\r\n }\r\n\r\n var20 = method_6680(var18, var11);\r\n }\r\n\r\n if(var5 != null) {\r\n if(var20 != 0) {\r\n ++var19;\r\n }\r\n\r\n var20 = var19;\r\n }\r\n\r\n if(var20 >= 3) {\r\n var8[var10 + var9 * var3] = var14;\r\n if(var5 != null) {\r\n break label358;\r\n }\r\n }\r\n\r\n var8[var10 + var9 * var3] = var11;\r\n }\r\n\r\n if(var5 != null) {\r\n break label355;\r\n }\r\n }\r\n\r\n var8[var10 + var9 * var3] = var11;\r\n }\r\n\r\n ++var10;\r\n if(var5 == null) {\r\n break label345;\r\n }\r\n }\r\n }\r\n\r\n ++var9;\r\n } while(var5 != null);\r\n\r\n return var8;\r\n }","title":""},{"docid":"659ba5f5a1d6324593e8f2eea1aaa0f2","score":"0.51053005","text":"public void test423129b() {\n this.runNegativeTest(new String[] { \"X.java\", \"import java.util.ArrayList;\\n\" + \"import java.util.Arrays;\\n\" + \"import java.util.Collections;\\n\" + \"import java.util.Comparator;\\n\" + \"public class X {\\n\" + \" int compareTo(X x) { return 0; }\\n\" + \"\tvoid foo() {\\n\" + \"\t\tCollections.sort(new ArrayList(Arrays.asList(new X(), new X(), new X())),\\n\" + \"\t\t\t\t(X o1, X o2) -> o1.compareTo(o2)); //[2]\\n\" + \"\t}\\n\" + \"\t}\\n\" + \"}\\n\" }, \"----------\\n\" + \"1. ERROR in X.java (at line 12)\\n\" + \"\t}\\n\" + \"\t^\\n\" + \"Syntax error on token \\\"}\\\", delete this token\\n\" + \"----------\\n\", true);\n }","title":""},{"docid":"355dba0a4ab53dfe47662664156440f7","score":"0.5089408","text":"public JJITInstruction run(KFrame frame) throws Exception {\n KReference this_ref = ((KReference)frame.getLocal(0));\n // *********[45] ALOAD(0)\n frame.push(this_ref);\n // *********[46] ALOAD(0)\n // **REMOVED Substitution** s0_ref = this_ref;\n // *********[47] GETFIELD(jnt.Bench.Bench,ascending,Z)\n // **REMOVED Substitution** s0 = c_ascending.getInstanceValue(this_ref);\n // *********[48] IFEQ(57)\n // **REMOVED Substitution** index = c_ascending.getInstanceValue(this_ref).intValue();\n // **REMOVED Substitution** jump = c_ascending.getInstanceValue(this_ref).intValue() == 0;\n return ((c_ascending.getInstanceValue(this_ref).intValue() == 0)?(c_label):(c_next));\n }","title":""},{"docid":"19223c8b989f18ae469643bcfa18a3b6","score":"0.5081068","text":"private static List[] getStartingDeterminisation() {\n\t\tList[] returnValue = new ArrayList[MAX_STATE];\n\t\tint ac = 0;\n\t\t//\t\tList local = null;\n\t\tint[] local = null;\n\t\tint cp = 0;\n\t\tfor (int i = 0; i < states.length; i++) {\n\t\t\tif (states[i][0] == 1 && isnotIn(returnValue, ac, i)) {\n\t\t\t\tlocal = new int[MAX_STATE];\n\t\t\t\tcp = 0;\n\t\t\t\tlocal[cp++] = i;\n\t\t\t\tfor (int j = 0; j < cp; j++) {\n\t\t\t\t\tfor (int k = 0; k < MAX_STATE; k++) {\n\t\t\t\t\t\tif (epsilons[local[j]][k] == -1) {\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t} else if (isnotIn(local, cp, epsilons[local[j]][k])) {\n\t\t\t\t\t\t\tlocal[cp++] = epsilons[local[j]][k];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturnValue[ac++] = tabToList(local, cp);\n\t\t\t}\n\n\t\t}\n\t\treturn returnValue;\n\t}","title":""},{"docid":"c4bda1b57bfff434d05745b150e1ecf1","score":"0.50795823","text":"private final void f() {\n /*\n r14 = this;\n r11 = 0;\n r12 = 1;\n r13 = 0;\n r0 = r14.i;\n if (r0 == 0) goto L_0x00ec;\n L_0x0007:\n r0 = r14.c;\n if (r0 == 0) goto L_0x00ec;\n L_0x000b:\n r0 = r14.c;\n r1 = 32;\n r0 = r0.c(r1);\n if (r0 != 0) goto L_0x0023;\n L_0x0015:\n r0 = r14.e;\n if (r0 == 0) goto L_0x00ed;\n L_0x0019:\n r0 = r14.e;\n r0 = r0.p;\n r2 = 1;\n r0 = (r0 > r2 ? 1 : (r0 == r2 ? 0 : -1));\n if (r0 != 0) goto L_0x00ed;\n L_0x0023:\n r10 = r12;\n L_0x0024:\n r0 = r14.i;\n r0 = (defpackage.azq) r0;\n r1 = r14.c;\n r1 = r1.c();\n r2 = r14.c;\n r2 = r2.k();\n r3 = r14.c;\n r3 = r3.i;\n r4 = r14.c;\n r4 = r4.f();\n r5 = r14.l();\n r6 = r14.c;\n r6 = r6.b;\n r6 = r6.getDetails();\n r6 = r6.getStatusHints();\n if (r6 == 0) goto L_0x00f0;\n L_0x0050:\n r7 = r6.getIcon();\n if (r7 == 0) goto L_0x00f0;\n L_0x0056:\n r6 = r6.getIcon();\n r7 = r14.g;\n r6 = r6.loadDrawable(r7);\n if (r6 == 0) goto L_0x00f0;\n L_0x0062:\n r7 = r14.m();\n if (r7 == 0) goto L_0x00f3;\n L_0x0068:\n r7 = r14.c;\n r7 = r7.h();\n r7 = r7.getGatewayAddress();\n r7 = defpackage.azo.a(r7);\n L_0x0076:\n r8 = r14.c;\n r9 = 8;\n r8 = r8.c(r9);\n r9 = r14.c;\n r9 = r9.c(r12);\n r0.a(r1, r2, r3, r4, r5, r6, r7, r8, r9, r10);\n r14.g();\n r0 = r14.c;\n r1 = 4;\n r1 = r0.c(r1);\n r0 = r14.c;\n r0 = r0.h;\n if (r0 != 0) goto L_0x0099;\n L_0x0097:\n if (r1 == 0) goto L_0x00f7;\n L_0x0099:\n r0 = r14.c;\n r0 = r0.i();\n if (r0 == 0) goto L_0x00f5;\n L_0x00a1:\n r2 = defpackage.bcj.b();\n r2 = r2.n();\n r0 = defpackage.buf.a(r2, r0);\n if (r0 == 0) goto L_0x00f5;\n L_0x00af:\n r0 = r0.getSubscriptionAddress();\n r0 = defpackage.azo.a(r0);\n L_0x00b7:\n r2 = defpackage.bcj.b();\n r2 = r2.n();\n r3 = defpackage.bcj.b();\n r3 = r3.z;\n r4 = r14.c;\n r4 = r4.i();\n r2 = defpackage.buf.a(r2, r3, r4);\n if (r1 != 0) goto L_0x0112;\n L_0x00d1:\n r2 = android.telephony.PhoneNumberUtils.compare(r0, r2);\n if (r2 == 0) goto L_0x0112;\n L_0x00d7:\n r0 = \"Numbers are the same (and callback number is not being forced to show); not showing the callback number\";\n defpackage.bdf.a(r14, r0);\n L_0x00dc:\n r0 = r14.i;\n r0 = (defpackage.azq) r0;\n r2 = r14.c;\n r2 = r2.h;\n if (r2 != 0) goto L_0x00e8;\n L_0x00e6:\n if (r1 == 0) goto L_0x00e9;\n L_0x00e8:\n r11 = r12;\n L_0x00e9:\n r0.a(r13, r11);\n L_0x00ec:\n return;\n L_0x00ed:\n r10 = r11;\n goto L_0x0024;\n L_0x00f0:\n r6 = r13;\n goto L_0x0062;\n L_0x00f3:\n r7 = r13;\n goto L_0x0076;\n L_0x00f5:\n r0 = r13;\n goto L_0x00b7;\n L_0x00f7:\n r0 = r14.c;\n r0 = r0.b;\n r0 = r0.getDetails();\n r0 = r0.getStatusHints();\n if (r0 == 0) goto L_0x0114;\n L_0x0105:\n r0 = r0.getExtras();\n if (r0 == 0) goto L_0x0114;\n L_0x010b:\n r2 = \"android.telecom.extra.CALL_BACK_NUMBER\";\n r0 = r0.getString(r2);\n goto L_0x00b7;\n L_0x0112:\n r13 = r0;\n goto L_0x00dc;\n L_0x0114:\n r0 = r13;\n goto L_0x00b7;\n */\n throw new UnsupportedOperationException(\"Method not decompiled: azo.f():void\");\n }","title":""},{"docid":"12d25cf67e5dcc0d11d5760ca676ae27","score":"0.50780344","text":"public static d a(r var0) {\n var1_1 = false;\n var2_2 = -1;\n var3_3 = -1;\n var4_4 = false;\n var5_5 = false;\n var6_6 = false;\n var7_7 = -1;\n var8_8 = -1;\n var9_9 = false;\n var10_10 = false;\n var11_11 = true;\n var12_12 = var0.a();\n var13_13 = 0;\n var14_14 = null;\n var15_15 = false;\n do {\n if (var13_13 >= var12_12) ** GOTO lbl33\n var17_16 = var0.a(var13_13);\n var18_18 = var0.b(var13_13);\n if (!var17_16.equalsIgnoreCase(\"Cache-Control\")) ** GOTO lbl26\n if (var14_14 != null) {\n var11_11 = false;\n } else {\n var14_14 = var18_18;\n }\n ** GOTO lbl28\nlbl26: // 1 sources:\n if (!var17_16.equalsIgnoreCase(\"Pragma\")) ** GOTO lbl31\n var11_11 = false;\nlbl28: // 3 sources:\n var19_17 = var15_15;\n var20_20 = 0;\n ** GOTO lbl38\nlbl31: // 1 sources:\n var19_17 = var15_15;\n ** GOTO lbl90\nlbl33: // 1 sources:\n if (!var11_11) {\n var16_29 = null;\n return new d(var15_15, var1_1, var2_2, var3_3, var4_4, var5_5, var6_6, var7_7, var8_8, var9_9, var10_10, var16_29);\n }\n var16_29 = var14_14;\n return new d(var15_15, var1_1, var2_2, var3_3, var4_4, var5_5, var6_6, var7_7, var8_8, var9_9, var10_10, var16_29);\nlbl38: // 13 sources:\n while (var20_20 < var18_18.length()) {\n var21_19 = c.a(var18_18, var20_20, \"=,;\");\n var22_22 = var18_18.substring(var20_20, var21_19).trim();\n if (var21_19 == var18_18.length() || var18_18.charAt(var21_19) == ',' || var18_18.charAt(var21_19) == ';') {\n var20_20 = var21_19 + 1;\n var23_21 = null;\n } else {\n var24_24 = c.a(var18_18, var21_19 + 1);\n if (var24_24 < var18_18.length() && var18_18.charAt(var24_24) == '\\\"') {\n var27_25 = var24_24 + 1;\n var28_28 = c.a(var18_18, var27_25, \"\\\"\");\n var29_27 = var18_18.substring(var27_25, var28_28);\n var20_20 = var28_28 + 1;\n var23_21 = var29_27;\n } else {\n var25_23 = c.a(var18_18, var24_24, \",;\");\n var26_26 = var18_18.substring(var24_24, var25_23).trim();\n var20_20 = var25_23;\n var23_21 = var26_26;\n }\n }\n if (\"no-cache\".equalsIgnoreCase(var22_22)) {\n var19_17 = true;\n continue;\n }\n if (\"no-store\".equalsIgnoreCase(var22_22)) {\n var1_1 = true;\n continue;\n }\n if (\"max-age\".equalsIgnoreCase(var22_22)) {\n var2_2 = c.b(var23_21, -1);\n continue;\n }\n if (\"s-maxage\".equalsIgnoreCase(var22_22)) {\n var3_3 = c.b(var23_21, -1);\n continue;\n }\n if (\"private\".equalsIgnoreCase(var22_22)) {\n var4_4 = true;\n continue;\n }\n if (\"public\".equalsIgnoreCase(var22_22)) {\n var5_5 = true;\n continue;\n }\n if (\"must-revalidate\".equalsIgnoreCase(var22_22)) {\n var6_6 = true;\n continue;\n }\n if (\"max-stale\".equalsIgnoreCase(var22_22)) {\n var7_7 = c.b(var23_21, Integer.MAX_VALUE);\n continue;\n }\n if (\"min-fresh\".equalsIgnoreCase(var22_22)) {\n var8_8 = c.b(var23_21, -1);\n continue;\n }\n if (\"only-if-cached\".equalsIgnoreCase(var22_22)) {\n var9_9 = true;\n continue;\n }\n if (!\"no-transform\".equalsIgnoreCase(var22_22)) continue;\n var10_10 = true;\n }\nlbl90: // 2 sources:\n ++var13_13;\n var15_15 = var19_17;\n } while (true);\n }","title":""},{"docid":"1c8589be45b75399a766b8f4661000e1","score":"0.50772345","text":"public void sort() {\n\n\t}","title":""},{"docid":"842f3954c520b20b559427a98bd54d11","score":"0.5076949","text":"@SuppressWarnings(\"UnnecessaryReturnStatement\")\r\n public void backtracking(){ \r\n if(orderedVars.isEmpty()) {\r\n makeSolution();\r\n return;\r\n }\r\n \r\n CSPVariable cspVar;\r\n cspVar = orderedVars.poll();\r\n \r\n cspVar.storage.stream().filter((var) -> (consistent(var, cspVar))).forEachOrdered((var) -> {\r\n if(cspVar.Row){ \r\n rowSolution[tempX++] = new Line(var,cspVar.position,cspVar.Row);\r\n backtracking();\r\n rowSolution[--tempX] = null;\r\n } else{\r\n colSolution[tempY++] = new Line(var,cspVar.position,cspVar.Row);\r\n backtracking();\r\n colSolution[--tempY] = null;\r\n }\r\n });\r\n \r\n orderedVars.add(cspVar);\r\n }","title":""},{"docid":"95b34d53c614d0fb183983f5d3719f38","score":"0.5071713","text":"public List rGreaterL() { //List vertices, int length, int range\n //List distances = new ArrayList();\n for (int i = 0; i < vertices.size(); i++) {\n distances.add(0);\n }\n // get all the gaps & all the overlaps\n // order them in such a way that they are ordered. ie, include start and\n // end of each\n List> gaps = getGaps();\n\n for (int i = 0; i < gaps.size(); i++) { // removed -1\n int costLeft = 0;\n int costRight = 0;\n int c = 0;\n if (gaps.get(i).get(2) > 0) {\n if (i > 0) {\n // check left for overlaps\n if (gaps.get(i - 1).get(2) < 0) {\n // calculate cost of left - for now set cost to 1\n costLeft = 1;\n } else {\n // if its another gap, ignore it. or set it to infinite\n costLeft = 1000;\n }\n } // make sure i-1 doesn't cause a NPE\n\n if (i + 1 < gaps.size()) {\n if (gaps.get(i + 1).get(2) < 0) {\n // calculate cost of right. - for now set cost to 1\n costRight = 1;\n } else {\n // if its another gap, ignore it. or set it to infinite\n costRight = 1000;\n }\n }\n if(i == 0){\n int vertexShifted = gaps.get(0).get(1);\n // shift it left by gap distance.\n distances.set(vertexShifted, -gaps.get(0).get(2));\n int newVertixLoc = vertices.get(0)-gaps.get(0).get(2);\n //update the next gap.\n int diff = vertices.get(1)-newVertixLoc;\n if(diff == 0){\n gaps.get(1).set(2, -(2*range));\n }\n else if(diff > (2*range)){\n //gap\n int d = diff - (2*range);\n gaps.get(1).set(2,d);\n }\n else if(diff < (2*range)){\n //overlap\n int ov = (2*range) - diff;\n gaps.get(1).set(2,ov);\n }else if(diff == (2*range)){\n //exactly where they should be\n gaps.get(1).set(2,0);\n }\n }\n else if (costLeft <= costRight) { // right shift is done - ONLY if its not the first vertex\n if (Math.abs(gaps.get(i - 1).get(2)) < gaps.get(i).get(2)) {\n c = Math.abs(gaps.get(i - 1).get(2)); // size of left overlap\n } else {\n c = gaps.get(i).get(2); // size of current gap\n }\n gaps.get(i).set(2, gaps.get(i).get(2) - c);\n gaps.get(i - 1).set(2, Math.abs(gaps.get(i - 1).get(2)) - c);\n int vertixShifted = gaps.get(i - 1).get(1); /*at this point, vertix shifted points to the index, not the actual vertex */\n distances.set(vertixShifted, distances.get(vertixShifted)+c);\n // add c to the values in array d of sensors between\n }\n else if(i == gaps.size()-1){\n if(gaps.get(i-1).get(2) < 0){\n int movementRoom = Math.abs(gaps.get(i-1).get(2));\n // to avoid the nasty edge case of movementRoom putting vertex above length\n if(movementRoom >= gaps.get(i).get(2)){\n movementRoom = gaps.get(i).get(2);\n }\n // what if movement room puts it above length? then you start crying.\n gaps.get(i-1).set(2, gaps.get(i-1).get(2)+movementRoom);\n gaps.get(i).set(2, movementRoom);\n System.out.println(\"Vertex: \" + gaps.get(i).get(0) + \" Length is: \" + length + \" Distances size: \" + distances.size() + \" What is i? \" + i);\n distances.set(gaps.get(i).get(0), distances.get(gaps.get(i).get(0))+movementRoom);\n }\n }\n else { // left shift is done\n if (Math.abs(gaps.get(i + 1).get(2)) < Math.abs(gaps.get(i).get(2))) {\n c = Math.abs(gaps.get(i + 1).get(2));\n } else {\n c = gaps.get(i).get(2);\n }\n gaps.get(i).set(2, gaps.get(i).get(2) - c);\n gaps.get(i + 1).set(2, Math.abs(gaps.get(i + 1).get(2)) - c);\n int vertixShifted = gaps.get(i + 1).get(0); /*add this to array of d. Negative */\n // vertixShifted is now an index, not the vertex itself.\n\t\t\t\t\t/* This tells where a vertix should move */\n distances.set(vertixShifted, distances.get(vertixShifted)-c);\n }\n } // if not first vertix\n\n }// for\n\n return distances;\n }","title":""},{"docid":"8d109f9b2d776e57c596db6a9d7f82b0","score":"0.5070586","text":"private void sortToppings(){\n }","title":""},{"docid":"4d9e9f45b06f671ba748f5fa6d4d26ee","score":"0.5066124","text":"private void inPlaceSort(int beginIndex, int endIndex, PSTPoint s) {\n\tSort.heapSort(tree,baseZeroIndex(beginIndex),baseZeroIndex(endIndex));\n }","title":""},{"docid":"26419b5d2557f08fb63333a2af92fb48","score":"0.506078","text":"public int getBlockZ() {\n/* 217 */ return locToBlock(this.z);\n/* */ }","title":""},{"docid":"e1d39f58fdd9eafe9760459cf457e8b1","score":"0.5055323","text":"void DW(com.aide.ui.scm.a.b.b r13) {\n /*\n r12 = this;\n r0 = -1;\n r7 = 0;\n r8 = r12.v5;\n r9 = r13.v5;\n r10 = r12.j6;\n r6 = r0;\n r1 = r7;\n r3 = r7;\n L_0x000b:\n if (r3 >= r10) goto L_0x0022;\n L_0x000d:\n r2 = r3 + 1;\n r2 = r8[r2];\n if (r2 != 0) goto L_0x0022;\n L_0x0013:\n r2 = r1;\n L_0x0014:\n r1 = r2 + 1;\n r2 = r2 + 1;\n r2 = r9[r2];\n if (r2 == 0) goto L_0x001f;\n L_0x001c:\n r0 = r1;\n r2 = r1;\n goto L_0x0014;\n L_0x001f:\n r3 = r3 + 1;\n goto L_0x000b;\n L_0x0022:\n if (r3 != r10) goto L_0x0025;\n L_0x0024:\n return;\n L_0x0025:\n r2 = r3;\n r4 = r1;\n r5 = r3;\n L_0x0028:\n if (r5 >= r10) goto L_0x0034;\n L_0x002a:\n r3 = r5 + 1;\n r3 = r8[r3];\n if (r3 == 0) goto L_0x0034;\n L_0x0030:\n r3 = r5 + 1;\n r5 = r3;\n goto L_0x0028;\n L_0x0034:\n if (r5 == r10) goto L_0x0064;\n L_0x0036:\n r3 = r12.VH;\n r3 = r3[r2];\n r11 = r12.VH;\n r11 = r11[r5];\n if (r3 != r11) goto L_0x0064;\n L_0x0040:\n r3 = r4 + 1;\n r3 = r9[r3];\n if (r3 != 0) goto L_0x0064;\n L_0x0046:\n if (r5 == r10) goto L_0x0064;\n L_0x0048:\n if (r6 < 0) goto L_0x004c;\n L_0x004a:\n if (r2 == r6) goto L_0x0064;\n L_0x004c:\n if (r0 < 0) goto L_0x0050;\n L_0x004e:\n if (r1 == r0) goto L_0x0064;\n L_0x0050:\n r3 = r5 + 1;\n r3 = r5 + 1;\n r11 = 1;\n r8[r3] = r11;\n r3 = r2 + 1;\n r2 = r2 + 1;\n r8[r2] = r7;\n r5 = r5 + 1;\n r2 = r4 + 1;\n r4 = r2;\n r2 = r3;\n goto L_0x0028;\n L_0x0064:\n r0 = r4;\n r6 = r5;\n r1 = r4;\n r3 = r5;\n goto L_0x000b;\n */\n throw new UnsupportedOperationException(\"Method not decompiled: com.aide.ui.scm.a.b.b.DW(com.aide.ui.scm.a$b$b):void\");\n }","title":""},{"docid":"9dfa4378083cc9eabedd1661991a8297","score":"0.5052783","text":"private final void a() {\n /*\n r6 = this;\n int r0 = r6.f83764c\n r1 = 0\n if (r0 >= 0) goto L_0x000b\n r6.f83762a = r1\n r0 = 0\n r6.f83765d = r0\n return\n L_0x000b:\n kotlin.text.d r0 = r6.f83767f\n int r0 = r0.f83760c\n r2 = -1\n r3 = 1\n if (r0 <= 0) goto L_0x0020\n int r0 = r6.f83766e\n int r0 = r0 + r3\n r6.f83766e = r0\n int r0 = r6.f83766e\n kotlin.text.d r4 = r6.f83767f\n int r4 = r4.f83760c\n if (r0 >= r4) goto L_0x002c\n L_0x0020:\n int r0 = r6.f83764c\n kotlin.text.d r4 = r6.f83767f\n java.lang.CharSequence r4 = r4.f83758a\n int r4 = r4.length()\n if (r0 <= r4) goto L_0x0040\n L_0x002c:\n int r0 = r6.f83763b\n kotlin.ranges.IntRange r1 = new kotlin.ranges.IntRange\n kotlin.text.d r4 = r6.f83767f\n java.lang.CharSequence r4 = r4.f83758a\n int r4 = kotlin.text.StringsKt.getLastIndex(r4)\n r1.(r0, r4)\n r6.f83765d = r1\n r6.f83764c = r2\n goto L_0x0091\n L_0x0040:\n kotlin.text.d r0 = r6.f83767f\n kotlin.jvm.functions.Function2> r0 = r0.f83761d\n kotlin.text.d r4 = r6.f83767f\n java.lang.CharSequence r4 = r4.f83758a\n int r5 = r6.f83764c\n java.lang.Integer r5 = java.lang.Integer.valueOf(r5)\n java.lang.Object r0 = r0.invoke(r4, r5)\n kotlin.Pair r0 = (kotlin.Pair) r0\n if (r0 != 0) goto L_0x006a\n int r0 = r6.f83763b\n kotlin.ranges.IntRange r1 = new kotlin.ranges.IntRange\n kotlin.text.d r4 = r6.f83767f\n java.lang.CharSequence r4 = r4.f83758a\n int r4 = kotlin.text.StringsKt.getLastIndex(r4)\n r1.(r0, r4)\n r6.f83765d = r1\n r6.f83764c = r2\n goto L_0x0091\n L_0x006a:\n java.lang.Object r2 = r0.component1()\n java.lang.Number r2 = (java.lang.Number) r2\n int r2 = r2.intValue()\n java.lang.Object r0 = r0.component2()\n java.lang.Number r0 = (java.lang.Number) r0\n int r0 = r0.intValue()\n int r4 = r6.f83763b\n kotlin.ranges.IntRange r4 = kotlin.ranges.RangesKt.until((int) r4, (int) r2)\n r6.f83765d = r4\n int r2 = r2 + r0\n r6.f83763b = r2\n int r2 = r6.f83763b\n if (r0 != 0) goto L_0x008e\n r1 = 1\n L_0x008e:\n int r2 = r2 + r1\n r6.f83764c = r2\n L_0x0091:\n r6.f83762a = r3\n return\n */\n throw new UnsupportedOperationException(\"Method not decompiled: kotlin.text.d.a.a():void\");\n }","title":""},{"docid":"4292197eb34f9a6ca30d81eade0272b0","score":"0.5044995","text":"private void stepCursor() {\n predpred = pred;\n pred = curr;\n curr = curr.next;\n if (listOrder == ListOrder.BubbleUp) {\n // swap curr and curr.next if the latter has a larger key\n DataNode next = curr.next;\n if (curr.key < next.key) {\n swapNeighboringNodes(pred);\n curr = next;\n }\n }\n }","title":""},{"docid":"3e7b64dde9d3c17807eecbb9850f0175","score":"0.5043057","text":"public float getPlacedBlockOffsetZ() {\n/* 110 */ return this.facingZ;\n/* */ }","title":""},{"docid":"32186ec69d155a774e0419cd63256f74","score":"0.5043034","text":"public void mo1342b() {\n int i = 0;\n View view = (View) this.f903a.get(0);\n C0142c b = mo1341b(view);\n this.f904b = StaggeredGridLayoutManager.this.f871u.mo6362d(view);\n if (b.f886f) {\n C0144a c = StaggeredGridLayoutManager.this.f857E.mo1324c(b.mo1248a());\n if (c != null && c.f890f == -1) {\n int i2 = this.f904b;\n int i3 = this.f907e;\n int[] iArr = c.f891g;\n if (iArr != null) {\n i = iArr[i3];\n }\n this.f904b = i2 - i;\n }\n }\n }","title":""},{"docid":"f994fc974d7ef6ce93307d868e63017f","score":"0.5042866","text":"int[] hungarianMethod(int w[][]) {\r\n\t final int n = w.length, m = w[0].length, PHI = -1, NOL = -2,\r\n\t INF = 1<<30;\r\n\t boolean[] x[] = new boolean[n][m], ss = new boolean[n], st = new boolean[m];\r\n\t int[] u = new int[n], v = new int[m], p = new int[m], ls = new int[n], lt = new int[m], a = new int[n];\r\n\t int f = 0;\r\n\r\n\t for (int i = 0; i < n; i++)\r\n\t for (int j = 0; j < m; j++)\r\n\t f = Math.max(f, w[i][j]);\r\n\r\n\t Arrays.fill(u, f);\r\n\t Arrays.fill(p, INF);\r\n\t Arrays.fill(lt, NOL);\r\n\t Arrays.fill(ls, PHI);\r\n\t Arrays.fill(a, -1);\r\n\r\n\t while (true) {\r\n\t f = -1;\r\n\t for (int i = 0; i < n && f == -1; i++)\r\n\t if (ls[i] != NOL && !ss[i])\r\n\t f = i;\r\n\r\n\t if (f != -1) {\r\n\t ss[f] = true;\r\n\t for (int j = 0; j < m; j++)\r\n\t if (!x[f][j] && u[f] + v[j] - w[f][j] < p[j]) {\r\n\t lt[j] = f;\r\n\t p[j] = u[f] + v[j] - w[f][j];\r\n\t }\r\n\t } else {\r\n\t for (int i = 0; i < m && f == -1; i++)\r\n\t if (lt[i] != NOL && !st[i] && p[i] == 0)\r\n\t f = i;\r\n\r\n\t if (f == -1) {\r\n\t int d1 = INF, d2 = INF, d;\r\n\t for (int i : u)\r\n\t d1 = Math.min(d1, i);\r\n\r\n\t for (int i : p)\r\n\t if (i > 0)\r\n\t d2 = Math.min(d2, i);\r\n\r\n\t d = Math.min(d1, d2);\r\n\r\n\t for (int i = 0; i < n; i++)\r\n\t if (ls[i] != NOL)\r\n\t u[i] -= d;\r\n\r\n\t for (int i = 0; i < m; i++) {\r\n\t if (p[i] == 0)\r\n\t v[i] += d;\r\n\t if (p[i] > 0 && lt[i] != NOL)\r\n\t p[i] -= d;\r\n\t }\r\n\r\n\t if (d2 >= d1)\r\n\t break;\r\n\t } else {\r\n\t st[f] = true;\r\n\t int s = -1;\r\n\r\n\t for (int i = 0; i < n && s == -1; i++)\r\n\t if (x[i][f])\r\n\t s = i;\r\n\r\n\t if (s == -1) {\r\n\t for (int l, r; ; f = r) {\r\n\t r = f;\r\n\t l = lt[r];\r\n\r\n\t if (r >= 0 && l >= 0)\r\n\t x[l][r] = !x[l][r];\r\n\t else\r\n\t break;\r\n\r\n\t r = ls[l];\r\n\t if (r >= 0 && l >= 0)\r\n\t x[l][r] = !x[l][r];\r\n\t else\r\n\t break;\r\n\t }\r\n\r\n\t Arrays.fill(p, INF);\r\n\t Arrays.fill(lt, NOL);\r\n\t Arrays.fill(ls, NOL);\r\n\t Arrays.fill(ss, false);\r\n\t Arrays.fill(st, false);\r\n\r\n\t for (int i = 0; i < n; i++) {\r\n\t boolean ex = true;\r\n\t for (int j = 0; j < m && ex; j++)\r\n\t ex = !x[i][j];\r\n\t if (ex)\r\n\t ls[i] = PHI;\r\n\t }\r\n\t } else\r\n\t ls[s] = f;\r\n\t }\r\n\t }\r\n\t }\r\n\r\n\t for (int i = 0; i < n; i++)\r\n\t for (int j = 0; j < m; j++)\r\n\t if (x[i][j])\r\n\t a[j] = i;\r\n\t return a;\r\n\t}","title":""},{"docid":"055d5ba7ead04bc21bc1b1ce9cc38368","score":"0.5040194","text":"@Override\r\n\tpublic void updateTick(World par1World, int par2, int par3, int par4, Random par5Random)\r\n\t{\r\n\t\tif (!par1World.isRemote)\r\n\t\t{\r\n\t\t\tint l = par1World.getBlockMetadata(par2, par3, par4);\r\n\r\n\t\t\tif ((l & 8) != 0 && (l & 4) == 0)\r\n\t\t\t{\r\n\t\t\t\tbyte b0 = 4;\r\n\t\t\t\tint i1 = b0 + 1;\r\n\t\t\t\tbyte b1 = 32;\r\n\t\t\t\tint j1 = b1 * b1;\r\n\t\t\t\tint k1 = b1 / 2;\r\n\r\n\t\t\t\tif (this.adjacentTreeBlocks == null)\r\n\t\t\t\t{\r\n\t\t\t\t\tthis.adjacentTreeBlocks = new int[b1 * b1 * b1];\r\n\t\t\t\t}\r\n\r\n\t\t\t\tint l1;\r\n\r\n\t\t\t\tif (par1World.checkChunksExist(par2 - i1, par3 - i1, par4 - i1, par2 + i1, par3 + i1, par4 + i1))\r\n\t\t\t\t{\r\n\t\t\t\t\tint i2;\r\n\t\t\t\t\tint j2;\r\n\t\t\t\t\tint k2;\r\n\r\n\t\t\t\t\tfor (l1 = -b0; l1 <= b0; ++l1)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tfor (i2 = -b0; i2 <= b0; ++i2)\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\tfor (j2 = -b0; j2 <= b0; ++j2)\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tk2 = par1World.getBlockId(par2 + l1, par3 + i2, par4 + j2);\r\n\r\n\t\t\t\t\t\t\t\tBlock block = Block.blocksList[k2];\r\n\r\n\t\t\t\t\t\t\t\tif (block != null && block.canSustainLeaves(par1World, par2 + l1, par3 + i2, par4 + j2))\r\n\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\tthis.adjacentTreeBlocks[(l1 + k1) * j1 + (i2 + k1) * b1 + j2 + k1] = 0;\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\telse if (block != null && block.isLeaves(par1World, par2 + l1, par3 + i2, par4 + j2))\r\n\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\tthis.adjacentTreeBlocks[(l1 + k1) * j1 + (i2 + k1) * b1 + j2 + k1] = -2;\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\telse\r\n\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\tthis.adjacentTreeBlocks[(l1 + k1) * j1 + (i2 + k1) * b1 + j2 + k1] = -1;\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tfor (l1 = 1; l1 <= 4; ++l1)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tfor (i2 = -b0; i2 <= b0; ++i2)\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\tfor (j2 = -b0; j2 <= b0; ++j2)\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tfor (k2 = -b0; k2 <= b0; ++k2)\r\n\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\tif (this.adjacentTreeBlocks[(i2 + k1) * j1 + (j2 + k1) * b1 + k2 + k1] == l1 - 1)\r\n\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\tif (this.adjacentTreeBlocks[(i2 + k1 - 1) * j1 + (j2 + k1) * b1 + k2 + k1] == -2)\r\n\t\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\t\tthis.adjacentTreeBlocks[(i2 + k1 - 1) * j1 + (j2 + k1) * b1 + k2 + k1] = l1;\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\tif (this.adjacentTreeBlocks[(i2 + k1 + 1) * j1 + (j2 + k1) * b1 + k2 + k1] == -2)\r\n\t\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\t\tthis.adjacentTreeBlocks[(i2 + k1 + 1) * j1 + (j2 + k1) * b1 + k2 + k1] = l1;\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\tif (this.adjacentTreeBlocks[(i2 + k1) * j1 + (j2 + k1 - 1) * b1 + k2 + k1] == -2)\r\n\t\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\t\tthis.adjacentTreeBlocks[(i2 + k1) * j1 + (j2 + k1 - 1) * b1 + k2 + k1] = l1;\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\tif (this.adjacentTreeBlocks[(i2 + k1) * j1 + (j2 + k1 + 1) * b1 + k2 + k1] == -2)\r\n\t\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\t\tthis.adjacentTreeBlocks[(i2 + k1) * j1 + (j2 + k1 + 1) * b1 + k2 + k1] = l1;\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\tif (this.adjacentTreeBlocks[(i2 + k1) * j1 + (j2 + k1) * b1 + (k2 + k1 - 1)] == -2)\r\n\t\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\t\tthis.adjacentTreeBlocks[(i2 + k1) * j1 + (j2 + k1) * b1 + (k2 + k1 - 1)] = l1;\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\tif (this.adjacentTreeBlocks[(i2 + k1) * j1 + (j2 + k1) * b1 + k2 + k1 + 1] == -2)\r\n\t\t\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\t\t\tthis.adjacentTreeBlocks[(i2 + k1) * j1 + (j2 + k1) * b1 + k2 + k1 + 1] = l1;\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\r\n\t\t\t\tl1 = this.adjacentTreeBlocks[k1 * j1 + k1 * b1 + k1];\r\n\r\n\t\t\t\tif (l1 >= 0)\r\n\t\t\t\t{\r\n\t\t\t\t\tpar1World.setBlockMetadataWithNotify(par2, par3, par4, l & -9, 4);\r\n\t\t\t\t}\r\n\t\t\t\telse\r\n\t\t\t\t{\r\n\t\t\t\t\tthis.removeLeaves(par1World, par2, par3, par4);\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t}\r\n\t}","title":""},{"docid":"9bf453c56939811816f63476e51f50fa","score":"0.5038486","text":"public int compare(TryCatchBlockNode tryCatchBlockNode1, TryCatchBlockNode tryCatchBlockNode2)\n/* */ {\n/* 109 */ return blockLength(tryCatchBlockNode1) - blockLength(tryCatchBlockNode2);\n/* */ }","title":""},{"docid":"98f320264e7468fa4738cd1a44e04419","score":"0.5038158","text":"public static void main(String[] args) {\n\t\t l = new Linkedlist(1);\r\n\t\tl.next =new Linkedlist(2);\r\n\t\tl.next.next =new Linkedlist(3);\r\n\t\tl.next.next.next =new Linkedlist(4);\r\n\t\tl.next.next.next.next =new Linkedlist(5);\r\n\t\tl.next.next.next.next.next =new Linkedlist(6);\r\n\t\tl.next.next.next.next.next.next =new Linkedlist(7);\r\n\t\tl.next.next.next.next.next.next.next =new Linkedlist(8);\r\n\t\tl.next.next.next.next.next.next.next.next =new Linkedlist(9);\r\n\t\tl.next.next.next.next.next.next.next.next.next =new Linkedlist(10);\r\n\t\tl.next.next.next.next.next.next.next.next.next.next=null;\r\n\t\tLinkedlist temp = l;\r\n\t\t \r\n\t\tint count =0;\r\n\t\twhile(temp!=null){\r\n\t\t\ttemp=temp.next ;\r\n\t\t\tcount++;\r\n\t\t}\r\n\t\t\r\n\t\tBuildBStfromDLL n = BuildBSt(count);\r\n\t\t\r\nprintlevelorder(n);\r\n\t}","title":""},{"docid":"7106d13e69cd6a7a0392837f113d470a","score":"0.5037112","text":"@Override\n protected long doProblemSpecificStuff() {\n\n permutations = new ArrayList(MILLION);\n populatePermutations();\n Collections.sort(permutations); // A pain, but nothing compared to the O(n^10) we just went through\n\n return permutations.get(MILLION - 1); // Fencepost (AKA off-by-one)\n }","title":""},{"docid":"8dde31cf3330f769c60296098ebabd45","score":"0.50369686","text":"public void sortLights() {}","title":""},{"docid":"cff076f2c4dede96ab9080eccb3126fb","score":"0.5029037","text":"private void comparator() {\n\t\t// your code starts here\n\t\tint currentPoint = 0;\n\t\t//get points of contestant with given ID\n\t\tfor(int i=1;i<5;i++) {\n\t\t\tswitch(i) {\n\t\t\tcase 1:\n\t\t\t\tcurrentPoint = totalPointOfKUArchitect1;\n\t\t\t\tbreak;\n\t\t\tcase 2:\n\t\t\t\tcurrentPoint = totalPointOfKUArchitect2;\n\t\t\t\tbreak;\n\t\t\tcase 3:\n\t\t\t\tcurrentPoint = totalPointOfKUArchitect3;\n\t\t\t\tbreak;\n\t\t\tcase 4:\n\t\t\t\tcurrentPoint = totalPointOfKUArchitect4;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t // compare current contestant's point with each three points which are in first 3 list.\n\t\t\tif(currentPoint>=firstPoint) {\n\t\t\t\tthirdPoint = secondPoint;\n\t\t\t\tthirdID = secondID;\n\t\t\t\tsecondPoint = firstPoint;\n\t\t\t\tsecondID = firstID;\n\t\t\t\tfirstID = i;\n\t\t\t\tfirstPoint = currentPoint;\n\t\t\t}\n\t\t\telse if(currentPoint>=secondPoint){\n\t\t\t\t\tthirdPoint = secondPoint;\n\t\t\t\t\tthirdID = secondID;\n\t\t\t\t\tsecondPoint = currentPoint;\n\t\t\t\t\tsecondID = i;\n\t\t\t}\n\t\t\telse if(currentPoint>=thirdPoint) {\n\t\t\t\tthirdPoint = currentPoint;\n\t\t\t\tthirdID = i;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\t\tprintln();\n\t\tprintln(\"KUArchitect#\"+firstID+ \" becomes #1 with \"+ firstPoint+\" points.\");\n\t\tprintln(\"KUArchitect#\"+secondID+ \" becomes #2 with \" + secondPoint+\" points.\");\n\t\tprintln(\"KUArchitect#\"+thirdID+ \" becomes #3 with \"+ thirdPoint+\" points.\");\n\t\t}","title":""},{"docid":"512e29325e6417e25070401158ad6a54","score":"0.50287735","text":"final int compare(MarkData paramMarkData1, MarkData paramMarkData2) {\n/* 494 */ if (paramMarkData1.index < paramMarkData2.index)\n/* 495 */ return -1; \n/* 496 */ if (paramMarkData1.index > paramMarkData2.index) {\n/* 497 */ return 1;\n/* */ }\n/* 499 */ return 0;\n/* */ }","title":""},{"docid":"7400a032cf725a51aa122bf0a529dfb8","score":"0.5024756","text":"public boolean a(ur ist, qx player, yc world, int x, int y, int z, int side, float xp, float yp, float zp)\r\n/* 22: */ {\r\n/* 23:25 */ int bid = world.a(x, y, z);\r\n/* 24:26 */ int blockID = g();\r\n/* 25:28 */ if (bid == amq.aV.cm) {\r\n/* 26:29 */ side = 1;\r\n/* 27:30 */ } else if ((bid != amq.bx.cm) && (bid != amq.aa.cm) && (bid != amq.ab.cm)) {\r\n/* 28:33 */ switch (side)\r\n/* 29: */ {\r\n/* 30: */ case 0: \r\n/* 31:34 */ y--; break;\r\n/* 32: */ case 1: \r\n/* 33:35 */ y++; break;\r\n/* 34: */ case 2: \r\n/* 35:36 */ z--; break;\r\n/* 36: */ case 3: \r\n/* 37:37 */ z++; break;\r\n/* 38: */ case 4: \r\n/* 39:38 */ x--; break;\r\n/* 40: */ default: \r\n/* 41:39 */ x++;\r\n/* 42: */ }\r\n/* 43: */ }\r\n/* 44:42 */ if (ist.a == 0) {\r\n/* 45:42 */ return false;\r\n/* 46: */ }\r\n/* 47:43 */ if (!player.a(x, y, z, side, ist)) {\r\n/* 48:43 */ return false;\r\n/* 49: */ }\r\n/* 50:45 */ if (y >= world.O() - 1) {\r\n/* 51:45 */ return false;\r\n/* 52: */ }\r\n/* 53:47 */ if (!world.a(blockID, x, y, z, false, side, player)) {\r\n/* 54:48 */ return false;\r\n/* 55: */ }\r\n/* 56:50 */ amq bl = amq.p[blockID];\r\n/* 57:52 */ if (world.d(x, y, z, blockID, a(ist.j())))\r\n/* 58: */ {\r\n/* 59:54 */ if (world.a(x, y, z) == blockID)\r\n/* 60: */ {\r\n/* 61:55 */ BlockExtended bex = (BlockExtended)amq.p[blockID];\r\n/* 62:56 */ bex.onBlockPlacedUseful(world, x, y, z, side, player, ist);\r\n/* 63: */ }\r\n/* 64:58 */ world.a(x + 0.5F, y + 0.5F, z + 0.5F, bl.cz.e(), (bl.cz.c() + 1.0F) / 2.0F, bl.cz.d() * 0.8F);\r\n/* 65: */ \r\n/* 66: */ \r\n/* 67: */ \r\n/* 68: */ \r\n/* 69: */ \r\n/* 70:64 */ ist.a -= 1;\r\n/* 71: */ }\r\n/* 72:66 */ return true;\r\n/* 73: */ }","title":""},{"docid":"21334864605942e1c830d180c29fb316","score":"0.502207","text":"public void Sort() {\n\t}","title":""},{"docid":"188e78172b07e09da7df0c549d713b21","score":"0.50184786","text":"int main() {\n\tint[][] c;\n\tint[] ans;\n\tint[] visit, pre, f;\n\tint[] i, j, open, closed;\n\tint k, start, ending;\n\tint flag;\n\tint i1;\n\t\n\tc = new int[][110];\n\tfor (i1 = 0; i1 < 110; i1 = i1 + 1) {\n\t\tc[i1] = new int[110];\n\t\tfillIntArray(c[i1], 0);\n\t}\n\t\n\tans = new int[1];\n\tans[0] = 0;\n\tvisit = new int[110];\n\tfillIntArray(visit, 0);\n\tpre = new int[110];\n\tfillIntArray(pre, 0);\n\tf = new int[110];\n\tfillIntArray(f, 0);\n\ti = new int[1];\n\ti[0] = 0;\n\tj = new int[1];\n\tj[0] = 0;\n\topen = new int[1];\n\t\n\topen[0] = 0;\n\tclosed = new int[1];\n\tclosed[0] = 0;\n\tk = 0;\n\tstart = 99;\n\tending = 100;\n\tflag = 0;\n\t\n\tbuild(c, i, j, start, ending);\n while (find(open, closed, i, j, ending, visit, f, start, pre, flag, c)>0) {\n\t improve(i, j, ans, pre, c, ending);\n\t}\n printInt(ans[0]); \t/* ans[0] is 49 */\n}","title":""},{"docid":"30a43207b2612ffc32828e23c3600f82","score":"0.5015507","text":"public static void balanceHeaps()\n {\n // add your code here\n }","title":""},{"docid":"21bd3d1bea2ac9a5c94c6c5404915ede","score":"0.49845523","text":"public void sortForDisplacement( )\n {\n sort(Vehicle::compareDisplacement);\n }","title":""},{"docid":"ace10fc8e26403dc824a54f9e8d86484","score":"0.49815","text":"private static void jumpSearch()\r\n\t \r\n\t {\r\n\t\t \r\n\t\t int jump=(int)Math.sqrt(size);\r\n\t\t int previous=0;\r\n\t\t \r\n\t\t for (int i = 0; i < ar.length; i+=jump) \r\n\t\t {\r\n\t\t\t if(ar[i]>key)\r\n\t\t\t {\r\n\t\t\t\t break;\r\n\t\t\t }\r\n\t\t\t previous=i;\r\n\t\t\t\r\n\t\t}\r\n\t\t \r\n\t\t //Calling linear-search\r\n\t\tlinearSearch(previous);\r\n\t\t \r\n\t }","title":""},{"docid":"e9b4313ac2dc5b9f096ab9a283c27ce2","score":"0.4969222","text":"public void reArrange() {\n return;\n }","title":""},{"docid":"3e1ea5b77e52e9892be3e5f12dc04751","score":"0.49684858","text":"public int[] func_94128_d(int par1)\n/* */ {\n/* 536 */ return par1 == 1 ? slots_top : par1 == 0 ? slots_bottom : slots_sides;\n/* */ }","title":""},{"docid":"1be9c298f7a96351089e9dfe4eea5222","score":"0.49665838","text":"@Override\n\tpublic void onPostBlockPlaced(World p_149714_1_, int p_149714_2_, int p_149714_3_, int p_149714_4_, int p_149714_5_) {\n\t}","title":""},{"docid":"5835454347ecd8759cab3d40ad87decb","score":"0.4955757","text":"public final void mo56977b() {\n /*\n r5 = this;\n com.ss.android.ugc.aweme.common.a r0 = r5.f67571b\n if (r0 == 0) goto L_0x0087\n com.ss.android.ugc.aweme.common.e r0 = r5.f67572c\n if (r0 != 0) goto L_0x000a\n goto L_0x0087\n L_0x000a:\n com.ss.android.ugc.aweme.common.a r0 = r5.f67571b\n java.lang.String r1 = \"mModel\"\n kotlin.jvm.internal.C7573i.m23582a(r0, r1)\n com.ss.android.ugc.aweme.discover.model.DiscoveryV4DetailListModel r0 = (com.p280ss.android.ugc.aweme.discover.model.DiscoveryV4DetailListModel) r0\n int r0 = r0.mListQueryType\n r1 = 1\n if (r0 == r1) goto L_0x0049\n r2 = 4\n if (r0 == r2) goto L_0x001c\n goto L_0x0048\n L_0x001c:\n r5.m88092e()\n com.ss.android.ugc.aweme.common.e r0 = r5.f67572c\n com.ss.android.ugc.aweme.common.e.c r0 = (com.p280ss.android.ugc.aweme.common.p1144e.C25675c) r0\n java.util.List r2 = r5.f70767d\n com.ss.android.ugc.aweme.common.a r3 = r5.f67571b\n java.lang.String r4 = \"mModel\"\n kotlin.jvm.internal.C7573i.m23582a(r3, r4)\n com.ss.android.ugc.aweme.discover.model.DiscoveryV4DetailListModel r3 = (com.p280ss.android.ugc.aweme.discover.model.DiscoveryV4DetailListModel) r3\n boolean r3 = r3.isHasMore()\n if (r3 == 0) goto L_0x0044\n com.ss.android.ugc.aweme.common.a r3 = r5.f67571b\n java.lang.String r4 = \"mModel\"\n kotlin.jvm.internal.C7573i.m23582a(r3, r4)\n com.ss.android.ugc.aweme.discover.model.DiscoveryV4DetailListModel r3 = (com.p280ss.android.ugc.aweme.discover.model.DiscoveryV4DetailListModel) r3\n boolean r3 = r3.isNewDataEmpty()\n if (r3 != 0) goto L_0x0044\n goto L_0x0045\n L_0x0044:\n r1 = 0\n L_0x0045:\n r0.mo59108b(r2, r1)\n L_0x0048:\n return\n L_0x0049:\n java.util.List r0 = r5.f70767d\n int r0 = r0.size()\n if (r0 <= 0) goto L_0x0056\n java.util.List r0 = r5.f70767d\n r0.clear()\n L_0x0056:\n com.ss.android.ugc.aweme.common.a r0 = r5.f67571b\n java.lang.String r1 = \"mModel\"\n kotlin.jvm.internal.C7573i.m23582a(r0, r1)\n com.ss.android.ugc.aweme.discover.model.DiscoveryV4DetailListModel r0 = (com.p280ss.android.ugc.aweme.discover.model.DiscoveryV4DetailListModel) r0\n boolean r0 = r0.isDataEmpty()\n if (r0 == 0) goto L_0x006d\n com.ss.android.ugc.aweme.common.e r0 = r5.f67572c\n com.ss.android.ugc.aweme.common.e.c r0 = (com.p280ss.android.ugc.aweme.common.p1144e.C25675c) r0\n r0.ae_()\n return\n L_0x006d:\n r5.m88092e()\n com.ss.android.ugc.aweme.common.e r0 = r5.f67572c\n com.ss.android.ugc.aweme.common.e.c r0 = (com.p280ss.android.ugc.aweme.common.p1144e.C25675c) r0\n java.util.List r1 = r5.f70767d\n com.ss.android.ugc.aweme.common.a r2 = r5.f67571b\n java.lang.String r3 = \"mModel\"\n kotlin.jvm.internal.C7573i.m23582a(r2, r3)\n com.ss.android.ugc.aweme.discover.model.DiscoveryV4DetailListModel r2 = (com.p280ss.android.ugc.aweme.discover.model.DiscoveryV4DetailListModel) r2\n boolean r2 = r2.isHasMore()\n r0.mo59099a(r1, r2)\n return\n L_0x0087:\n return\n */\n throw new UnsupportedOperationException(\"Method not decompiled: com.p280ss.android.ugc.aweme.discover.presenter.C26814a.mo56977b():void\");\n }","title":""},{"docid":"07f21f531b9bf3db7350b5a80a922ed9","score":"0.49538642","text":"public static void main(String[] args)\n {\n PrintWriter pen = new PrintWriter(System.out, true);\n \n //Test reverse array builder\n Integer[] test = SorterAnalyzer.reverseIntArrBuilder.build(20);\n pen.println(\"reverse array\");\n pen.println(Arrays.toString(test));\n \n // test merge method\n Integer[] a1 = { 8, 9, 10, 13 };\n Integer[] a2 = { -2 };\n Integer[] results = new Integer[5];\n \n Utils.merge(StandardIntegerComparator.COMPARATOR, a1, 0, 4, a2, 0, 1,\n results, 0, 5);\n pen.println(\"merged array:\");\n pen.println(Arrays.toString(results));\n \n // test quick sorter\n Integer[] sortme = { 10, 9, 8, 13, -2 };\n NewQuicksorter sorter = new NewQuicksorter();\n sorter.qsort(sortme, StandardIntegerComparator.COMPARATOR, 0, 5);\n pen.println(\"sorted by NewQuicksorter\");\n pen.println(Arrays.toString(sortme));\n \n // test in line swap insertion sorter\n Integer[] sortmea = { 10, 9, 8, 13, -2 };\n InsertionSorterInlineSwap sortera = new InsertionSorterInlineSwap();\n sortera.sorti(sortmea, SorterAnalyzer.standardIntComparator);\n pen.println(\"sorted by InsertionSorterInlineSwap\");\n pen.println(Arrays.toString(sortmea));\n \n // test shift insertion sorter\n Integer[] sortmeb = { 10, 9, 8, 13, -2 };\n InsertionSorterShift sorterb = new InsertionSorterShift();\n sorterb.sorti(sortmeb, SorterAnalyzer.standardIntComparator);\n pen.println(\"sorted by InsertionSorterShift\");\n pen.println(Arrays.toString(sortmeb));\n \n // test mergesorterB (scratch array)\n Integer[] sortmec = { 10, 9, 8, 13, -2 };\n MergeSorterB sorterc = new MergeSorterB();\n sorterc.sorti(sortmec, SorterAnalyzer.standardIntComparator);\n pen.println(\"sorted by MergeSorterB\");\n pen.println(Arrays.toString(sortmec));\n \n //test iterativemergesorter\n Integer[] sortmed = { 10, 9, 8, 13, -2 };\n IterativeMergeSorter sorterd = new IterativeMergeSorter();\n sorterd.sorti(sortmed, SorterAnalyzer.standardIntComparator);\n pen.println(\"sorted by IterativeMergeSorter\");\n pen.println(Arrays.toString(sortmed));\n \n // test integerQuicksort\n int[] sortmee = { 3, 7, 8, 12, 0, -45, -5, 7, 10, 13 };\n IntegerQuicksort.qsort(sortmee, 0, sortmee.length);\n pen.println(\"sorted by IntegerQuicksort\");\n pen.println(Arrays.toString(sortmee));\n\n }","title":""},{"docid":"bb7dabe37eda30da4908c2f9b0023c03","score":"0.49511975","text":"public float getPlacedBlockOffsetY() {\n/* 102 */ return this.facingY;\n/* */ }","title":""},{"docid":"7aac2051a720dff92d77194363a0fcbd","score":"0.49486914","text":"public final void b() {\n /*\n r8 = this;\n java.lang.ref.WeakReference r0 = r8.c\n java.lang.Object r0 = r0.get()\n a.j.h r0 = (a.j.h) r0\n if (r0 == 0) goto L_0x0141\n L_0x000a:\n a.c.a.b.a r1 = r8.f409a\n int r2 = r1.e\n r3 = 1\n r4 = 0\n if (r2 != 0) goto L_0x0013\n goto L_0x002f\n L_0x0013:\n a.c.a.b.b$c r1 = r1.f203b\n java.lang.Object r1 = r1.getValue()\n a.j.i$a r1 = (a.j.i.a) r1\n a.j.e$b r1 = r1.f411a\n a.c.a.b.a r2 = r8.f409a\n a.c.a.b.b$c r2 = r2.c\n java.lang.Object r2 = r2.getValue()\n a.j.i$a r2 = (a.j.i.a) r2\n a.j.e$b r2 = r2.f411a\n if (r1 != r2) goto L_0x0031\n a.j.e$b r1 = r8.f410b\n if (r1 != r2) goto L_0x0031\n L_0x002f:\n r1 = r3\n goto L_0x0032\n L_0x0031:\n r1 = r4\n L_0x0032:\n r8.f = r4\n if (r1 != 0) goto L_0x0140\n a.j.e$b r1 = r8.f410b\n a.c.a.b.a r2 = r8.f409a\n a.c.a.b.b$c r2 = r2.f203b\n java.lang.Object r2 = r2.getValue()\n a.j.i$a r2 = (a.j.i.a) r2\n a.j.e$b r2 = r2.f411a\n int r1 = r1.compareTo(r2)\n if (r1 >= 0) goto L_0x00dc\n a.c.a.b.a r1 = r8.f409a\n a.c.a.b.b$b r2 = new a.c.a.b.b$b\n a.c.a.b.b$c r5 = r1.c\n a.c.a.b.b$c r6 = r1.f203b\n r2.(r5, r6)\n java.util.WeakHashMap, java.lang.Boolean> r1 = r1.d\n java.lang.Boolean r4 = java.lang.Boolean.valueOf(r4)\n r1.put(r2, r4)\n L_0x005e:\n boolean r1 = r2.hasNext()\n if (r1 == 0) goto L_0x00dc\n boolean r1 = r8.f\n if (r1 != 0) goto L_0x00dc\n java.lang.Object r1 = r2.next()\n java.util.Map$Entry r1 = (java.util.Map.Entry) r1\n java.lang.Object r4 = r1.getValue()\n a.j.i$a r4 = (a.j.i.a) r4\n L_0x0074:\n a.j.e$b r5 = r4.f411a\n a.j.e$b r6 = r8.f410b\n int r5 = r5.compareTo(r6)\n if (r5 <= 0) goto L_0x005e\n boolean r5 = r8.f\n if (r5 != 0) goto L_0x005e\n a.c.a.b.a r5 = r8.f409a\n java.lang.Object r6 = r1.getKey()\n boolean r5 = r5.contains(r6)\n if (r5 == 0) goto L_0x005e\n a.j.e$b r5 = r4.f411a\n int r6 = r5.ordinal()\n if (r6 == 0) goto L_0x00d6\n if (r6 == r3) goto L_0x00d0\n r7 = 2\n if (r6 == r7) goto L_0x00be\n r7 = 3\n if (r6 == r7) goto L_0x00bb\n r7 = 4\n if (r6 != r7) goto L_0x00a4\n a.j.e$a r5 = a.j.e.a.ON_PAUSE\n goto L_0x00c0\n L_0x00a4:\n java.lang.IllegalArgumentException r0 = new java.lang.IllegalArgumentException\n java.lang.StringBuilder r1 = new java.lang.StringBuilder\n r1.()\n java.lang.String r2 = \"Unexpected state value \"\n r1.append(r2)\n r1.append(r5)\n java.lang.String r1 = r1.toString()\n r0.(r1)\n throw r0\n L_0x00bb:\n a.j.e$a r5 = a.j.e.a.ON_STOP\n goto L_0x00c0\n L_0x00be:\n a.j.e$a r5 = a.j.e.a.ON_DESTROY\n L_0x00c0:\n a.j.e$b r6 = b((a.j.e.a) r5)\n java.util.ArrayList r7 = r8.g\n r7.add(r6)\n r4.a(r0, r5)\n r8.a()\n goto L_0x0074\n L_0x00d0:\n java.lang.IllegalArgumentException r0 = new java.lang.IllegalArgumentException\n r0.()\n throw r0\n L_0x00d6:\n java.lang.IllegalArgumentException r0 = new java.lang.IllegalArgumentException\n r0.()\n throw r0\n L_0x00dc:\n a.c.a.b.a r1 = r8.f409a\n a.c.a.b.b$c r1 = r1.c\n boolean r2 = r8.f\n if (r2 != 0) goto L_0x000a\n if (r1 == 0) goto L_0x000a\n a.j.e$b r2 = r8.f410b\n java.lang.Object r1 = r1.getValue()\n a.j.i$a r1 = (a.j.i.a) r1\n a.j.e$b r1 = r1.f411a\n int r1 = r2.compareTo(r1)\n if (r1 <= 0) goto L_0x000a\n a.c.a.b.a r1 = r8.f409a\n a.c.a.b.b$d r1 = r1.a()\n L_0x00fc:\n boolean r2 = r1.hasNext()\n if (r2 == 0) goto L_0x000a\n boolean r2 = r8.f\n if (r2 != 0) goto L_0x000a\n java.lang.Object r2 = r1.next()\n java.util.Map$Entry r2 = (java.util.Map.Entry) r2\n java.lang.Object r3 = r2.getValue()\n a.j.i$a r3 = (a.j.i.a) r3\n L_0x0112:\n a.j.e$b r4 = r3.f411a\n a.j.e$b r5 = r8.f410b\n int r4 = r4.compareTo(r5)\n if (r4 >= 0) goto L_0x00fc\n boolean r4 = r8.f\n if (r4 != 0) goto L_0x00fc\n a.c.a.b.a r4 = r8.f409a\n java.lang.Object r5 = r2.getKey()\n boolean r4 = r4.contains(r5)\n if (r4 == 0) goto L_0x00fc\n a.j.e$b r4 = r3.f411a\n java.util.ArrayList r5 = r8.g\n r5.add(r4)\n a.j.e$b r4 = r3.f411a\n a.j.e$a r4 = b((a.j.e.b) r4)\n r3.a(r0, r4)\n r8.a()\n goto L_0x0112\n L_0x0140:\n return\n L_0x0141:\n java.lang.IllegalStateException r0 = new java.lang.IllegalStateException\n java.lang.String r1 = \"LifecycleOwner of this LifecycleRegistry is alreadygarbage collected. It is too late to change lifecycle state.\"\n r0.(r1)\n throw r0\n */\n throw new UnsupportedOperationException(\"Method not decompiled: a.j.i.b():void\");\n }","title":""}],"string":"[\n {\n \"docid\": \"ea97cf060879cffc1b7bef111f282d29\",\n \"score\": \"0.6016002\",\n \"text\": \"final void fallbackSortImpl(int nblock) {\\n final int[] ftab = new int[257];\\n int H, i, j, k, lo, hi, cc, cc1;\\n int nNotDone;\\n int nBhtab;\\n final int[] eclass = getEclass();\\n\\n for (i = 0; i < nblock; i++) {\\n eclass[i] = 0;\\n }\\n /*--\\n LBZ2: Initial 1-char radix sort to generate\\n initial fmap and initial BH bits.\\n --*/\\n for (i = 0; i < nblock; i++) {\\n ftab[data.block[i] & 0xff]++;\\n }\\n for (i = 1; i < 257; i++) {\\n ftab[i] += ftab[i - 1];\\n }\\n\\n for (i = 0; i < nblock; i++) {\\n j = data.block[i] & 0xff;\\n k = ftab[j] - 1;\\n ftab[j] = k;\\n data.fmap[k] = i;\\n }\\n\\n nBhtab = 64 + nblock;\\n final BitSet bhtab = new BitSet(nBhtab);\\n for (i = 0; i < 256; i++) {\\n bhtab.set(ftab[i]);\\n }\\n\\n /*--\\n LBZ2: Inductively refine the buckets. Kind-of an\\n \\\"exponential radix sort\\\" (!), inspired by the\\n Manber-Myers suffix array construction algorithm.\\n --*/\\n\\n /*-- LBZ2: set sentinel bits for block-end detection --*/\\n for (i = 0; i < 32; i++) {\\n bhtab.set(nblock + 2 * i);\\n bhtab.clear(nblock + 2 * i + 1);\\n }\\n\\n /*-- LBZ2: the log(N) loop --*/\\n H = 1;\\n while (true) {\\n\\n j = 0;\\n for (i = 0; i < nblock; i++) {\\n if (bhtab.get(i)) {\\n j = i;\\n }\\n k = data.fmap[i] - H;\\n if (k < 0) {\\n k += nblock;\\n }\\n eclass[k] = j;\\n }\\n\\n nNotDone = 0;\\n hi = -1;\\n while (true) {\\n\\n /*-- LBZ2: find the next non-singleton bucket --*/\\n k = hi + 1;\\n k = bhtab.nextClearBit(k);\\n lo = k - 1;\\n if (lo >= nblock) {\\n break;\\n }\\n k = bhtab.nextSetBit(k + 1);\\n hi = k - 1;\\n if (hi >= nblock) {\\n break;\\n }\\n\\n /*-- LBZ2: now [lo, hi] bracket current bucket --*/\\n if (hi > lo) {\\n nNotDone += hi - lo + 1;\\n fallbackQSort3(eclass, lo, hi);\\n\\n /*-- LBZ2: scan bucket and generate header bits-- */\\n cc = -1;\\n for (i = lo; i <= hi; i++) {\\n cc1 = eclass[data.fmap[i]];\\n if (cc != cc1) {\\n bhtab.set(i);\\n cc = cc1;\\n }\\n }\\n }\\n }\\n\\n H *= 2;\\n if (H > nblock || nNotDone == 0) {\\n break;\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7319ceb9d04e6561df45960edae22b5f\",\n \"score\": \"0.5820456\",\n \"text\": \"public n a(q var1_1, I var2_2, am var3_3, am var4_4, gv var5_5) {\\n block11 : {\\n var32_6 = fj.z;\\n var6_7 = var5_5.a();\\n var7_8 = var5_5.b();\\n var9_9 = new n(new t(0.0, 0.0), var1_1);\\n var9_9.a(6.283185307179586 - this.d);\\n var10_10 = ae.a(var2_2, var3_3, var4_4, 0.0);\\n if (var10_10.h() >= 2 && (var10_10.h() != 2 || t.a(var10_10.c(), var10_10.d()) >= 1.0E-4)) ** GOTO lbl17\\n if (var10_10.h() >= 2) ** GOTO lbl-1000\\n var11_11 = var9_9.h();\\n var9_9.e(var3_3.getX() + var11_11.a * 0.5, var3_3.getY() + var11_11.b * 0.5);\\n if (var32_6) lbl-1000: // 2 sources:\\n {\\n var11_12 = var10_10.c();\\n var9_9.e(var11_12.a, var11_12.b);\\n }\\n if (this.d() == false) return var9_9;\\n ae.b(var9_9);\\n return var9_9;\\nlbl17: // 1 sources:\\n if (var6_7 < 0) {\\n var11_13 = Math.max(0, var10_10.h() - 1 + var6_7);\\n if (!var32_6) break block11;\\n }\\n var11_14 = Math.min(var10_10.h() - 2, var6_7);\\n }\\n if ((var12_15 = var10_10.a(var11_14)) == null) {\\n var13_16 = var9_9.h();\\n var9_9.e(var3_3.getX() + var13_16.a * 0.5, var3_3.getY() + var13_16.b * 0.5);\\n if (this.d() == false) return var9_9;\\n ae.b(var9_9);\\n return var9_9;\\n }\\n var13_17 = var12_15.c();\\n var14_18 = var12_15.d();\\n if (var12_15.g() != 0.0) ** GOTO lbl39\\n var15_19 = var3_3.getX() + var3_3.getWidth() * 0.5 + var2_2.getSourcePoint().a - (var4_4.getX() + var4_4.getWidth() * 0.5 + var2_2.getTargetPoint().a);\\n var17_20 = var3_3.getY() + var3_3.getHeight() * 0.5 + var2_2.getSourcePoint().b - (var4_4.getY() + var4_4.getHeight() * 0.5 + var2_2.getTargetPoint().b);\\n if (var15_19 != 0.0 || var17_20 != 0.0) ** GOTO lbl-1000\\n var14_18 = new t(var13_17.a + 1.0E-6, var13_17.b);\\n if (var32_6) lbl-1000: // 2 sources:\\n {\\n var19_22 = Math.sqrt(var15_19 * var15_19 + var17_20 * var17_20);\\n var14_18 = new t(var13_17.a + 1.0E-6 * var15_19 / var19_22, var13_17.b + 1.0E-6 * var17_20 / var19_22);\\n }\\n var12_15 = new m(var13_17, var14_18);\\nlbl39: // 2 sources:\\n if (this.b) {\\n var9_9.a(ik.c(z.d(var12_15.i(), ik.g) - this.d));\\n }\\n var15_19 = Math.abs(var5_5.c());\\n var17_21 = new n(var9_9);\\n this.a(var17_21, var12_15, var13_17, var15_19);\\n if (var11_14 == 0 && this.a(var3_3, var17_21)) {\\n this.b(var17_21, var12_15, var3_3, var15_19);\\n }\\n var18_25 = new n(var9_9);\\n this.a(var18_25, var12_15, var14_18, var15_19);\\n if (var11_14 >= var10_10.h() - 2 && this.a(var4_4, var18_25)) {\\n this.a(var18_25, var12_15, var4_4, var15_19);\\n }\\n if (t.a(var17_21.a(), var18_25.a()) < 1.0E-4) {\\n var19_23 = var12_15.i();\\n var19_23.c();\\n var18_25.d(var19_23.a(), var19_23.b());\\n }\\n if (0.0 <= var7_8 && var7_8 <= 1.0) ** GOTO lbl-1000\\n var20_26 = var18_25.b() - var17_21.b();\\n var24_28 = Math.sqrt(var20_26 * var20_26 + (var22_27 = var18_25.c() - var17_21.c()) * var22_27);\\n v0 = var26_29 = var24_28 != 0.0 ? var7_8 / var24_28 : 0.0;\\n if (var7_8 >= 0.0) ** GOTO lbl-1000\\n var28_30 = var17_21.b() + var26_29 * var20_26;\\n var30_31 = var17_21.c() + var26_29 * var22_27;\\n if (var32_6) lbl-1000: // 2 sources:\\n {\\n var28_30 = var18_25.b() + var26_29 * var20_26;\\n var30_31 = var18_25.c() + var26_29 * var22_27;\\n }\\n var19_24 = new t(var28_30, var30_31);\\n if (var32_6) lbl-1000: // 2 sources:\\n {\\n var19_24 = new t(var17_21.b() * (1.0 - var7_8) + var18_25.b() * var7_8, var17_21.c() * (1.0 - var7_8) + var18_25.c() * var7_8);\\n }\\n var9_9.a(var19_24);\\n if (this.d() == false) return var9_9;\\n ae.b(var9_9);\\n return var9_9;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6b5bf96536773da83480aa54f2f96436\",\n \"score\": \"0.5770869\",\n \"text\": \"protected void func_180433_a(double p_180433_1_, boolean p_180433_3_, Block p_180433_4_, BlockPos p_180433_5_) {\\n/* 537 */ if (p_180433_3_) {\\n/* */ \\n/* 539 */ if (this.fallDistance > 3.0F)\\n/* */ {\\n/* 541 */ fall(this.fallDistance, 1.0F);\\n/* */ \\n/* 543 */ if (!this.worldObj.isRemote && !this.isDead) {\\n/* */ \\n/* 545 */ setDead();\\n/* */ \\n/* */ int var6;\\n/* 548 */ for (var6 = 0; var6 < 3; var6++)\\n/* */ {\\n/* 550 */ dropItemWithOffset(Item.getItemFromBlock(Blocks.planks), 1, 0.0F);\\n/* */ }\\n/* */ \\n/* 553 */ for (var6 = 0; var6 < 2; var6++)\\n/* */ {\\n/* 555 */ dropItemWithOffset(Items.stick, 1, 0.0F);\\n/* */ }\\n/* */ } \\n/* */ \\n/* 559 */ this.fallDistance = 0.0F;\\n/* */ }\\n/* */ \\n/* 562 */ } else if (this.worldObj.getBlockState((new BlockPos(this)).offsetDown()).getBlock().getMaterial() != Material.water && p_180433_1_ < 0.0D) {\\n/* */ \\n/* 564 */ this.fallDistance = (float)(this.fallDistance - p_180433_1_);\\n/* */ } \\n/* */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5ba1d9c9474200bbfaddf61cbfedfce5\",\n \"score\": \"0.5733453\",\n \"text\": \"private void d(bu var1_1, q var2_2) {\\n block26 : {\\n block25 : {\\n block24 : {\\n block23 : {\\n var10_3 = fj.z;\\n var3_4 = null;\\n var4_5 = cm.a(var1_1, var2_2);\\n var5_6 = this.a(var4_5, var2_2);\\n var6_7 = this.a(var1_1, var2_2);\\n if ((var5_6 || var6_7) && this.c() && var1_1.C() != null && (var7_8 = var1_1.C().n(var2_2)) != null) {\\n if (this.h.add(var7_8)) {\\n var1_1.a(new y.c.y((q)var7_8).a());\\n }\\n if ((var8_10 = var1_1.t((q)var7_8).getAutoBoundsFeature()) != null && var8_10.isAutoBoundsEnabled()) {\\n var8_10.setAutoBoundsEnabled(false);\\n var3_4 = var8_10;\\n }\\n }\\n if (var5_6) {\\n if (this.h.add(var2_2)) {\\n var1_1.a(new y.c.y(var2_2).a());\\n }\\n if (var2_2.a() > 0) {\\n var1_1.a(var2_2.j());\\n }\\n }\\n if (!(var4_5 instanceof y.h.b.a)) ** GOTO lbl56\\n var7_8 = ((y.h.b.a)var4_5).l();\\n var8_11 = var7_8.k();\\n while (var8_11-- > 1) {\\n this.b(var2_2, var7_8.b(var8_11));\\n if (!var10_3) {\\n if (!var10_3) continue;\\n }\\n ** GOTO lbl-1000\\n }\\n if (var7_8.k() <= 1) ** GOTO lbl-1000\\n this.b(var2_2, var7_8.b(0));\\n if (var10_3) lbl-1000: // 3 sources:\\n {\\n var8_12 = var7_8.b(0);\\n var9_14 = var8_12.k();\\n while (var9_14-- > 0) {\\n this.b(var2_2, var8_12.b(var9_14));\\n if (!var10_3) {\\n if (!var10_3) continue;\\n }\\n break block23;\\n }\\n if (this.a(var2_2, var8_12) && var8_12.k() > 0) {\\n this.c(var2_2, var8_12);\\n }\\n }\\n }\\n var8_10 = var7_8.n();\\n while (var8_10-- > true) {\\n this.b(var2_2, var7_8.c((int)var8_10));\\n if (!var10_3) {\\n if (!var10_3) continue;\\n }\\n ** GOTO lbl-1000\\n }\\n if (var7_8.n() <= 1) ** GOTO lbl-1000\\n this.b(var2_2, var7_8.c(0));\\n if (var10_3) lbl-1000: // 3 sources:\\n {\\n var8_13 = var7_8.c(0);\\n var9_14 = var8_13.n();\\n while (var9_14-- > 0) {\\n this.b(var2_2, var8_13.c(var9_14));\\n if (!var10_3) {\\n if (!var10_3) continue;\\n }\\n break block24;\\n }\\n if (this.a(var2_2, var8_13) && var8_13.n() > 0) {\\n this.c(var2_2, var8_13);\\n }\\n }\\n }\\n var7_9 = var4_5.portCount();\\n while (var7_9-- > 0) {\\n var8_10 = var4_5.getPort(var7_9);\\n if (!this.a(var2_2, (eU)var8_10)) continue;\\n this.a(var4_5, (eU)var8_10, var7_9);\\n if (!var10_3) {\\n if (!var10_3) continue;\\n }\\n break block25;\\n }\\n var7_9 = var4_5.labelCount();\\n }\\n while (var7_9-- > 0) {\\n var8_10 = var4_5.getLabel(var7_9);\\n if (!this.a(var2_2, (eR)var8_10)) continue;\\n this.a(var4_5, (eR)var8_10, var7_9);\\n if (!var10_3) {\\n if (!var10_3) continue;\\n }\\n break block26;\\n }\\n if (var6_7) {\\n this.c(var1_1, var2_2);\\n }\\n }\\n if (var3_4 == null) return;\\n var3_4.setAutoBoundsEnabled(true);\\n }\\n\\n /*\\n * Exception decompiling\\n */\\n private void e(bu var1_1, q var2_2) {\\n // This method has failed to decompile. When submitting a bug report, please provide this stack trace, and (if you hold appropriate legal rights) the relevant class file.\\n // org.benf.cfr.reader.util.ConfusedCFRException: Statement already marked as first in another block\\n // org.benf.cfr.reader.bytecode.analysis.opgraph.Op03SimpleStatement.markFirstStatementInBlock(Op03SimpleStatement.java:420)\\n // org.benf.cfr.reader.bytecode.analysis.opgraph.op3rewriters.Misc.markWholeBlock(Misc.java:219)\\n // org.benf.cfr.reader.bytecode.analysis.opgraph.op3rewriters.ConditionalRewriter.considerAsSimpleIf(ConditionalRewriter.java:619)\\n // org.benf.cfr.reader.bytecode.analysis.opgraph.op3rewriters.ConditionalRewriter.identifyNonjumpingConditionals(ConditionalRewriter.java:45)\\n // org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisInner(CodeAnalyser.java:681)\\n // org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysisOrWrapFail(CodeAnalyser.java:220)\\n // org.benf.cfr.reader.bytecode.CodeAnalyser.getAnalysis(CodeAnalyser.java:165)\\n // org.benf.cfr.reader.entities.attributes.AttributeCode.analyse(AttributeCode.java:91)\\n // org.benf.cfr.reader.entities.Method.analyse(Method.java:354)\\n // org.benf.cfr.reader.entities.ClassFile.analyseMid(ClassFile.java:751)\\n // org.benf.cfr.reader.entities.ClassFile.analyseTop(ClassFile.java:683)\\n // org.benf.cfr.reader.Main.doJar(Main.java:129)\\n // org.benf.cfr.reader.Main.main(Main.java:181)\\n // the.bytecode.club.bytecodeviewer.decompilers.CFRDecompiler.decompileToZip(CFRDecompiler.java:245)\\n // the.bytecode.club.bytecodeviewer.gui.MainViewerGUI$18$1$3.run(MainViewerGUI.java:1107)\\n throw new IllegalStateException(\\\"Decompilation failed\\\");\\n }\\n\\n private void f(bu bu2, q q2) {\\n this.g = null;\\n this.f = null;\\n this.e = null;\\n this.d = false;\\n }\\n\\n @Override\\n public void actionPerformed(ActionEvent actionEvent) {\\n ch ch2 = this.a(actionEvent);\\n if (ch2 == null) return;\\n this.a(ch2);\\n ch2.getGraph2D().T();\\n }\\n\\n /*\\n * WARNING - Removed try catching itself - possible behaviour change.\\n * Unable to fully structure code\\n * Enabled unnecessary exception pruning\\n */\\n public void a(ch var1_1) {\\n var7_2 = fj.z;\\n var2_3 = var1_1.getGraph2D();\\n var2_3.r();\\n try {\\n block7 : {\\n var3_4 = var2_3.p();\\n while (var3_4.f()) {\\n this.b(var2_3, var3_4.a());\\n var3_4.g();\\n if (!var7_2) {\\n if (!var7_2) continue;\\n }\\n break block7;\\n }\\n this.h = new HashSet();\\n }\\n if ((var3_4 = var2_3.C()) != null) ** GOTO lbl21\\n var4_5 = var2_3.o();\\n while (var4_5.f()) {\\n this.b(var2_3, var4_5.e());\\n var4_5.g();\\n if (var7_2 != false) return;\\n if (!var7_2) continue;\\nlbl21: // 2 sources:\\n var4_5 = new ArrayList(var2_3.f());\\n var3_4.a(var3_4.e(var2_3), new cp(this, (ArrayList)var4_5));\\n var5_6 = var4_5.iterator();\\n while (var5_6.hasNext()) {\\n this.b(var2_3, (q)var5_6.next());\\n if (var7_2 != false) return;\\n if (!var7_2) continue;\\n }\\n break block4;\\n }\\n this.h = null;\\n return;\\n }\\n finally {\\n var2_3.s();\\n }\\n }\\n\\n protected void b(bu bu2, d d2) {\\n boolean bl2;\\n int n2;\\n aB aB2;\\n block5 : {\\n int n3;\\n bl2 = fj.z;\\n aB2 = bu2.i(d2);\\n if (this.a(aB2, d2)) {\\n bu2.a(new y.c.f(d2).a());\\n aB2 = bu2.i(d2);\\n }\\n y y2 = aB2.bends();\\n while (y2.f()) {\\n n3 = (int)this.a(d2, y2.a()) ? 1 : 0;\\n if (!bl2) {\\n if (n3 != 0) {\\n this.a(aB2, y2.a());\\n }\\n y2.g();\\n if (!bl2) continue;\\n }\\n break block5;\\n }\\n n3 = n2 = aB2.labelCount();\\n }\\n while (n2-- > 0) {\\n aA aA2 = aB2.getLabel(n2);\\n if (!this.a(d2, aA2)) continue;\\n this.a(aB2, aA2, n2);\\n if (bl2) return;\\n if (!bl2) continue;\\n }\\n if (!this.a(bu2, d2)) return;\\n this.c(bu2, d2);\\n }\\n\\n protected ch a(ActionEvent actionEvent) {\\n return cm.a(actionEvent, this.a);\\n }\\n\\n boolean a(aB aB2, d d2) {\\n boolean bl2;\\n int n2;\\n block5 : {\\n bl2 = fj.z;\\n y y2 = aB2.bends();\\n while (y2.f()) {\\n n2 = (int)this.a(d2, y2.a()) ? 1 : 0;\\n if (!bl2) {\\n if (n2 != 0) {\\n return true;\\n }\\n y2.g();\\n if (!bl2) continue;\\n }\\n break block5;\\n }\\n n2 = aB2.labelCount();\\n }\\n if (n2 <= 0) return false;\\n int n3 = 0;\\n do {\\n if (n3 >= aB2.labelCount()) return false;\\n boolean bl3 = this.a(d2, aB2.getLabel(n3));\\n if (bl2) return bl3;\\n if (bl3) {\\n return true;\\n }\\n ++n3;\\n } while (!bl2);\\n return false;\\n }\\n\\n boolean a(fj fj2, q q2) {\\n boolean bl2;\\n boolean bl3;\\n Object object;\\n int n2;\\n block14 : {\\n bl3 = fj.z;\\n if (fj2 instanceof y.h.b.a) {\\n Object object2;\\n ArrayList arrayList;\\n block13 : {\\n boolean bl4;\\n object = ((y.h.b.a)fj2).l();\\n arrayList = new ArrayList();\\n arrayList.addAll(object.l());\\n while (!arrayList.isEmpty()) {\\n object2 = (c)arrayList.remove(arrayList.size() - 1);\\n bl4 = this.a(q2, (c)object2);\\n if (!bl3) {\\n if (bl4) {\\n return true;\\n }\\n arrayList.addAll(object2.l());\\n if (!bl3) continue;\\n }\\n break block13;\\n }\\n arrayList.clear();\\n bl4 = arrayList.addAll(object.o());\\n }\\n while (!arrayList.isEmpty()) {\\n object2 = (f)arrayList.remove(arrayList.size() - 1);\\n n2 = (int)this.a(q2, (f)object2) ? 1 : 0;\\n if (!bl3) {\\n if (n2 != 0) {\\n return true;\\n }\\n arrayList.addAll(object2.o());\\n if (!bl3) continue;\\n }\\n break block14;\\n }\\n }\\n n2 = fj2.portCount();\\n }\\n if (n2 > 0) {\\n object = fj2.ports();\\n while (object.hasNext()) {\\n if (!this.a(q2, (eU)object.next())) continue;\\n bl2 = true;\\n if (!bl3) {\\n return bl2;\\n }\\n break;\\n }\\n } else {\\n bl2 = fj2.labelCount();\\n }\\n if (bl2 <= false) return false;\\n int n3 = 0;\\n do {\\n if (n3 >= fj2.labelCount()) return false;\\n boolean bl5 = this.a(q2, fj2.getLabel(n3));\\n if (bl3) return bl5;\\n if (bl5) {\\n return true;\\n }\\n ++n3;\\n } while (!bl3);\\n return false;\\n }\\n\\n boolean b(q q2, c c2) {\\n boolean bl2 = fj.z;\\n boolean bl3 = false;\\n int n2 = c2.k();\\n while (n2-- > 0) {\\n bl3 |= this.b(q2, c2.b(n2));\\n if (bl2) return bl3;\\n if (!bl2) continue;\\n }\\n if (!this.a(q2, c2)) return bl3;\\n this.c(q2, c2);\\n return true;\\n }\\n\\n boolean b(q q2, f f2) {\\n boolean bl2 = fj.z;\\n boolean bl3 = false;\\n int n2 = f2.n();\\n while (n2-- > 0) {\\n bl3 |= this.b(q2, f2.c(n2));\\n if (bl2) return bl3;\\n if (!bl2) continue;\\n }\\n if (!this.a(q2, f2)) return bl3;\\n this.c(q2, f2);\\n return true;\\n }\\n\\n protected void c(bu bu2, d d2) {\\n bu2.a(d2);\\n }\\n\\n protected void a(aB aB2, aA aA2, int n2) {\\n aB2.removeLabel(aA2);\\n }\\n\\n protected void a(aB aB2, x x2) {\\n aB2.removeBend(x2);\\n }\\n\\n protected void c(bu bu2, q q2) {\\n bu2.a(q2);\\n }\\n\\n protected void a(fj fj2, eR eR2, int n2) {\\n fj2.removeLabel(eR2);\\n }\\n\\n protected void a(fj fj2, eU eU2, int n2) {\\n fj2.removePort(n2);\\n }\\n\\n protected void c(q q2, c c2) {\\n c2.c();\\n }\\n\\n protected void c(q q2, f f2) {\\n f2.c();\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cbf101e1f6086bf8b43dbbe7548256d8\",\n \"score\": \"0.5671651\",\n \"text\": \"private boolean mainSimpleSort(final int lo, final int hi, final int d, final int lastShadow) {\\n final int bigN = hi - lo + 1;\\n\\n if (bigN < 2)\\n return firstAttempt && (workDone > workLimit);\\n\\n int hp = 0;\\n while (INCS[hp] < bigN) {\\n hp++;\\n }\\n\\n final int lastPlus1 = lastShadow + 1;\\n final boolean firstAttemptShadow = firstAttempt;\\n final int workLimitShadow = workLimit;\\n int workDoneShadow = workDone;\\n\\n // Following block contains unrolled code which could be shortened by\\n // coding it in additional loops.\\n\\n HP:\\n while (--hp >= 0) {\\n final int h = INCS[hp];\\n final int mj = lo + h - 1;\\n\\n for (int i = lo + h; i <= hi; ) {\\n // copy\\n for (int k = 3; (i <= hi) && (--k >= 0); i++) {\\n final int v = data.fmap[i];\\n final int vd = v + d;\\n int j = i;\\n\\n // for (int a;\\n // (j > mj) && mainGtU((a = fmap[j - h]) + d, vd,\\n // block, quadrant, lastShadow);\\n // j -= h) {\\n // fmap[j] = a;\\n // }\\n //\\n // unrolled version:\\n\\n // start inline mainGTU\\n boolean onceRunned = false;\\n int a = 0;\\n\\n HAMMER:\\n while (true) {\\n if (onceRunned) {\\n data.fmap[j] = a;\\n if ((j -= h) <= mj) { //NOSONAR\\n break HAMMER;\\n }\\n } else {\\n onceRunned = true;\\n }\\n\\n a = data.fmap[j - h];\\n int i1 = a + d;\\n int i2 = vd;\\n\\n // following could be done in a loop, but\\n // unrolled it for performance:\\n if (data.block[i1 + 1] == data.block[i2 + 1]) {\\n if (data.block[i1 + 2] == data.block[i2 + 2]) {\\n if (data.block[i1 + 3] == data.block[i2 + 3]) {\\n if (data.block[i1 + 4] == data.block[i2 + 4]) {\\n if (data.block[i1 + 5] == data.block[i2 + 5]) {\\n if (data.block[i1 += 6] == data.block[i2 += 6]) { //NOSONAR\\n int x = lastShadow;\\n X:\\n while (x > 0) {\\n x -= 4;\\n\\n if (data.block[i1 + 1] == data.block[i2 + 1]) {\\n if (this.data.sfmap[i1] == this.data.sfmap[i2]) {\\n if (data.block[i1 + 2] == data.block[i2 + 2]) {\\n if (this.data.sfmap[i1 + 1] == this.data.sfmap[i2 + 1]) {\\n if (data.block[i1 + 3] == data.block[i2 + 3]) {\\n if (this.data.sfmap[i1 + 2] == this.data.sfmap[i2 + 2]) {\\n if (data.block[i1 + 4] == data.block[i2 + 4]) {\\n if (this.data.sfmap[i1 + 3] == this.data.sfmap[i2 + 3]) {\\n if ((i1 += 4) >= lastPlus1) { //NOSONAR\\n i1 -= lastPlus1;\\n }\\n if ((i2 += 4) >= lastPlus1) { //NOSONAR\\n i2 -= lastPlus1;\\n }\\n workDoneShadow++;\\n continue X;\\n } else if (this.data.sfmap[i1 + 3] > this.data.sfmap[i2 + 3]) {\\n continue HAMMER;\\n } else {\\n break HAMMER;\\n }\\n } else if ((data.block[i1 + 4] & 0xff) > (data.block[i2 + 4] & 0xff)) {\\n continue HAMMER;\\n } else {\\n break HAMMER;\\n }\\n } else if (this.data.sfmap[i1 + 2] > this.data.sfmap[i2 + 2]) {\\n continue HAMMER;\\n } else {\\n break HAMMER;\\n }\\n } else if ((data.block[i1 + 3] & 0xff) > (data.block[i2 + 3] & 0xff)) {\\n continue HAMMER;\\n } else {\\n break HAMMER;\\n }\\n } else if (this.data.sfmap[i1 + 1] > this.data.sfmap[i2 + 1]) {\\n continue HAMMER;\\n } else {\\n break HAMMER;\\n }\\n } else if ((data.block[i1 + 2] & 0xff) > (data.block[i2 + 2] & 0xff)) {\\n continue HAMMER;\\n } else {\\n break HAMMER;\\n }\\n } else if (this.data.sfmap[i1] > this.data.sfmap[i2]) {\\n continue HAMMER;\\n } else {\\n break HAMMER;\\n }\\n } else if ((data.block[i1 + 1] & 0xff) > (data.block[i2 + 1] & 0xff)) {\\n continue HAMMER;\\n } else {\\n break HAMMER;\\n }\\n\\n }\\n break HAMMER;\\n } // while x > 0\\n if ((data.block[i1] & 0xff) > (data.block[i2] & 0xff)) {\\n continue HAMMER;\\n }\\n break HAMMER;\\n } else if ((data.block[i1 + 5] & 0xff) > (data.block[i2 + 5] & 0xff)) {\\n continue HAMMER;\\n } else {\\n break HAMMER;\\n }\\n } else if ((data.block[i1 + 4] & 0xff) > (data.block[i2 + 4] & 0xff)) {\\n continue HAMMER;\\n } else {\\n break HAMMER;\\n }\\n } else if ((data.block[i1 + 3] & 0xff) > (data.block[i2 + 3] & 0xff)) {\\n continue HAMMER;\\n } else {\\n break HAMMER;\\n }\\n } else if ((data.block[i1 + 2] & 0xff) > (data.block[i2 + 2] & 0xff)) {\\n continue HAMMER;\\n } else {\\n break HAMMER;\\n }\\n } else if ((data.block[i1 + 1] & 0xff) > (data.block[i2 + 1] & 0xff)) {\\n continue HAMMER;\\n } else {\\n break HAMMER;\\n }\\n\\n } // HAMMER\\n // end inline mainGTU\\n\\n data.fmap[j] = v;\\n }\\n\\n if (firstAttemptShadow && (i <= hi)\\n && (workDoneShadow > workLimitShadow)) {\\n break HP;\\n }\\n }\\n }\\n\\n workDone = workDoneShadow;\\n return firstAttemptShadow && (workDoneShadow > workLimitShadow);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"638a4a24c566dbee2f8f1022b55b4bd7\",\n \"score\": \"0.5615852\",\n \"text\": \"public void func_149749_a(World world, int x, int y, int z, Block bl, int md)\\n/* */ {\\n/* 210 */ if (!world.field_72995_K) {\\n/* 211 */ if (md != 0)\\n/* */ {\\n/* 213 */ for (int a = -1; a <= 1; a++) {\\n/* 214 */ for (int b = -1; b <= 1; b++)\\n/* 215 */ for (int c = -1; c <= 1; c++)\\n/* 216 */ if ((world.func_147439_a(x + a, y + b, z + c) == this) && (world.func_72805_g(x + a, y + b, z + c) == 0)) {\\n/* 217 */ TileAlchemyFurnaceAdvanced tile = (TileAlchemyFurnaceAdvanced)world.func_147438_o(x + a, y + b, z + c);\\n/* 218 */ if (tile != null) {\\n/* 219 */ tile.destroy = true;\\n/* 220 */ return;\\n/* */ }\\n/* */ }\\n/* */ }\\n/* */ } else {\\n/* 225 */ for (int a = -1; a <= 1; a++) {\\n/* 226 */ for (int b = 0; b <= 1; b++) {\\n/* 227 */ for (int c = -1; c <= 1; c++) {\\n/* 228 */ if (((a != 0) || (b != 0) || (c != 0)) && (world.func_147439_a(x + a, y + b, z + c) == this)) {\\n/* 229 */ int m = world.func_72805_g(x + a, y + b, z + c);\\n/* 230 */ world.func_147465_d(x + a, y + b, z + c, Block.func_149634_a(func_149650_a(m, world.field_73012_v, 0)), func_149692_a(m), 3);\\n/* */ }\\n/* */ }\\n/* */ }\\n/* */ }\\n/* */ }\\n/* */ }\\n/* */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"76e0147de9a9e4b5204c777a813afe1d\",\n \"score\": \"0.5570214\",\n \"text\": \"public static void spaceOptimizedLCS(){\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"73c0440bde8fdd28342e57b4a67c9be7\",\n \"score\": \"0.5554023\",\n \"text\": \"private Integer blocksToMoveEnhancedHeuristic(BoardState state) {\\n\\n\\t\\tif (isGoalState(state)) {\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\n\\t\\tBlock block = state.getBlocks().get(0);\\n\\t\\tSet blocks = new HashSet();\\n\\n\\t\\t/* Set of blocks that obstruct a certain block */\\n\\t\\tMap> map = new HashMap>();\\n\\n\\t\\t/* Amount of obstructions produced by a certain block */\\n\\t\\tList obstructionsCount = new ArrayList();\\n\\n\\t\\tfor (int j = block.getHead().getJ() + 1; j < board[0].length; j++) {\\n\\t\\t\\tif (state.getBoard()[block.getHead().getI()][j] != 0) {\\n\\t\\t\\t\\tint id = state.getBoard()[block.getHead().getI()][j];\\n\\t\\t\\t\\tblocks.add(id);\\n\\t\\t\\t\\tSet blockingBlocks = state.blockingBlocks(id);\\n\\t\\t\\t\\tSet ignore = new HashSet();\\n\\n\\t\\t\\t\\tif (!blockingBlocks.isEmpty()) {\\n\\t\\t\\t\\t\\tmap.put(id, blockingBlocks);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tfor (TopObstruction t : obstructionsCount) {\\n\\t\\t\\t\\t\\tif (blockingBlocks.contains(t.id)) {\\n\\t\\t\\t\\t\\t\\tt.increaseCount();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tignore.add(t.id);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tfor (Integer i : blockingBlocks) {\\n\\t\\t\\t\\t\\tif (!ignore.contains(i)) {\\n\\t\\t\\t\\t\\t\\tobstructionsCount.add(new TopObstruction(i));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tCollections.sort(obstructionsCount);\\n\\n\\t\\twhile (!map.isEmpty() && !obstructionsCount.isEmpty()) {\\n\\t\\t\\tTopObstruction t = obstructionsCount.remove(0);\\n\\n\\t\\t\\tIterator>> iterator = map\\n\\t\\t\\t\\t\\t.entrySet().iterator();\\n\\t\\t\\twhile (iterator.hasNext()) {\\n\\t\\t\\t\\tEntry> next = iterator.next();\\n\\t\\t\\t\\tif (next.getValue().contains(t.id)) {\\n\\t\\t\\t\\t\\titerator.remove();\\n\\t\\t\\t\\t\\tblocks.add(t.id);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\treturn blocks.size() + 1;\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"562f77bb8d34b165cd4498630b3d7057\",\n \"score\": \"0.5527271\",\n \"text\": \"public int getOrder()\\r\\n/* 30: */ {\\r\\n/* 31:133 */ return 5;\\r\\n/* 32: */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"93892bd4ebc6ca197bf55daf501ac684\",\n \"score\": \"0.55205774\",\n \"text\": \"@Override\\r\\n protected void sort() {\\r\\n //WRITECODE\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bbc962804a7ba3765b2bfcc92f41619c\",\n \"score\": \"0.5518686\",\n \"text\": \"private static long preSortSteps() {\\n \\tclearSwapCounter();\\n \\tSortObject.resetCompares();\\n \\treturn System.currentTimeMillis();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0f49c1bac2fdfd08e317dc373b767186\",\n \"score\": \"0.5498088\",\n \"text\": \"public boolean a(World paramaqu, Random paramRandom, bjb parambjb)\\r\\n/* 33: */ {\\r\\n/* 34:1107 */ if (a(paramaqu, parambjb)) {\\r\\n/* 35:1108 */ return false;\\r\\n/* 36: */ }\\r\\n/* 37:1112 */ a(paramaqu, parambjb, 0, 0, 0, 8, 4, 10, true, paramRandom, blr.c());\\r\\n/* 38: */ \\r\\n/* 39:1114 */ a(paramaqu, paramRandom, parambjb, this.d, 1, 1, 0);\\r\\n/* 40: */ \\r\\n/* 41:1116 */ a(paramaqu, parambjb, 1, 1, 10, 3, 3, 10, BlockList.air.instance(), BlockList.air.instance(), false);\\r\\n/* 42: */ \\r\\n/* 43: */ \\r\\n/* 44:1119 */ a(paramaqu, parambjb, 4, 1, 1, 4, 3, 1, false, paramRandom, blr.c());\\r\\n/* 45:1120 */ a(paramaqu, parambjb, 4, 1, 3, 4, 3, 3, false, paramRandom, blr.c());\\r\\n/* 46:1121 */ a(paramaqu, parambjb, 4, 1, 7, 4, 3, 7, false, paramRandom, blr.c());\\r\\n/* 47:1122 */ a(paramaqu, parambjb, 4, 1, 9, 4, 3, 9, false, paramRandom, blr.c());\\r\\n/* 48: */ \\r\\n/* 49: */ \\r\\n/* 50:1125 */ a(paramaqu, parambjb, 4, 1, 4, 4, 3, 6, BlockList.ironBars.instance(), BlockList.ironBars.instance(), false);\\r\\n/* 51:1126 */ a(paramaqu, parambjb, 5, 1, 5, 7, 3, 5, BlockList.ironBars.instance(), BlockList.ironBars.instance(), false);\\r\\n/* 52: */ \\r\\n/* 53: */ \\r\\n/* 54:1129 */ a(paramaqu, BlockList.ironBars.instance(), 4, 3, 2, parambjb);\\r\\n/* 55:1130 */ a(paramaqu, BlockList.ironBars.instance(), 4, 3, 8, parambjb);\\r\\n/* 56:1131 */ a(paramaqu, BlockList.ironDoor.instance(a(BlockList.ironDoor, 3)), 4, 1, 2, parambjb);\\r\\n/* 57:1132 */ a(paramaqu, BlockList.ironDoor.instance(a(BlockList.ironDoor, 3) + 8), 4, 2, 2, parambjb);\\r\\n/* 58:1133 */ a(paramaqu, BlockList.ironDoor.instance(a(BlockList.ironDoor, 3)), 4, 1, 8, parambjb);\\r\\n/* 59:1134 */ a(paramaqu, BlockList.ironDoor.instance(a(BlockList.ironDoor, 3) + 8), 4, 2, 8, parambjb);\\r\\n/* 60: */ \\r\\n/* 61:1136 */ return true;\\r\\n/* 62: */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dc99d0a487d745641cd4abfd0aa19db2\",\n \"score\": \"0.547032\",\n \"text\": \"public int mo1325d(int r5) {\\n /*\\n r4 = this;\\n int[] r0 = r4.f887a\\n r1 = -1\\n if (r0 != 0) goto L_0x0006\\n return r1\\n L_0x0006:\\n int r0 = r0.length\\n if (r5 < r0) goto L_0x000a\\n return r1\\n L_0x000a:\\n java.util.List r0 = r4.f888b\\n if (r0 != 0) goto L_0x0010\\n L_0x000e:\\n r0 = r1\\n goto L_0x0046\\n L_0x0010:\\n androidx.recyclerview.widget.StaggeredGridLayoutManager$d$a r0 = r4.mo1324c(r5)\\n if (r0 == 0) goto L_0x001b\\n java.util.List r2 = r4.f888b\\n r2.remove(r0)\\n L_0x001b:\\n java.util.List r0 = r4.f888b\\n int r0 = r0.size()\\n r2 = 0\\n L_0x0022:\\n if (r2 >= r0) goto L_0x0034\\n java.util.List r3 = r4.f888b\\n java.lang.Object r3 = r3.get(r2)\\n androidx.recyclerview.widget.StaggeredGridLayoutManager$d$a r3 = (androidx.recyclerview.widget.StaggeredGridLayoutManager.C0143d.C0144a) r3\\n int r3 = r3.f889e\\n if (r3 < r5) goto L_0x0031\\n goto L_0x0035\\n L_0x0031:\\n int r2 = r2 + 1\\n goto L_0x0022\\n L_0x0034:\\n r2 = r1\\n L_0x0035:\\n if (r2 == r1) goto L_0x000e\\n java.util.List r0 = r4.f888b\\n java.lang.Object r0 = r0.get(r2)\\n androidx.recyclerview.widget.StaggeredGridLayoutManager$d$a r0 = (androidx.recyclerview.widget.StaggeredGridLayoutManager.C0143d.C0144a) r0\\n java.util.List r3 = r4.f888b\\n r3.remove(r2)\\n int r0 = r0.f889e\\n L_0x0046:\\n if (r0 != r1) goto L_0x0052\\n int[] r0 = r4.f887a\\n int r2 = r0.length\\n java.util.Arrays.fill(r0, r5, r2, r1)\\n int[] r5 = r4.f887a\\n int r5 = r5.length\\n return r5\\n L_0x0052:\\n int[] r2 = r4.f887a\\n int r0 = r0 + 1\\n java.util.Arrays.fill(r2, r5, r0, r1)\\n return r0\\n */\\n throw new UnsupportedOperationException(\\\"Method not decompiled: androidx.recyclerview.widget.StaggeredGridLayoutManager.C0143d.mo1325d(int):int\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa7ce5d12625c11b0fdd7175f98793c7\",\n \"score\": \"0.54469955\",\n \"text\": \"private void sort0(){\\n\\t\\tint n = a.length;\\n\\t\\tfor(int i = 1; i < n; i++ ){\\n\\t\\t\\tfor(int j = i ; j > 0 && less(a[j], a[j-1]); j--){\\n\\t\\t\\t\\texch(j,j-1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"baa501be4fa299f4110823a2f6ee4fd8\",\n \"score\": \"0.5421204\",\n \"text\": \"public void visitEnd() {\\n/* 101 */ Collections.sort(this.tryCatchBlocks, new Comparator()\\n/* */ {\\n/* */ \\n/* */ \\n/* */ \\n/* */ \\n/* */ public int compare(TryCatchBlockNode tryCatchBlockNode1, TryCatchBlockNode tryCatchBlockNode2)\\n/* */ {\\n/* 109 */ return blockLength(tryCatchBlockNode1) - blockLength(tryCatchBlockNode2);\\n/* */ }\\n/* */ \\n/* */ private int blockLength(TryCatchBlockNode tryCatchBlockNode) {\\n/* 113 */ int startIndex = TryCatchBlockSorter.this.instructions.indexOf((AbstractInsnNode)tryCatchBlockNode.start);\\n/* 114 */ int endIndex = TryCatchBlockSorter.this.instructions.indexOf((AbstractInsnNode)tryCatchBlockNode.end);\\n/* 115 */ return endIndex - startIndex;\\n/* */ }\\n/* */ });\\n/* */ \\n/* 119 */ for (int i = 0; i < this.tryCatchBlocks.size(); i++) {\\n/* 120 */ ((TryCatchBlockNode)this.tryCatchBlocks.get(i)).updateIndex(i);\\n/* */ }\\n/* 122 */ if (this.mv != null)\\n/* 123 */ accept(this.mv); \\n/* */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9087d0f31d5c38a93895a718fdf89230\",\n \"score\": \"0.54189724\",\n \"text\": \"public abstract void preorder();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7436a6016fb195abf5d5ccf94430ddd3\",\n \"score\": \"0.54156685\",\n \"text\": \"private Integer blocksToMoveHeuristic(BoardState state) {\\n\\t\\tBlock block = state.getBlocks().get(0);\\n\\t\\tSet blocks = new HashSet();\\n\\n\\t\\tif (isGoalState(state)) {\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\n\\t\\tfor (int j = block.getHead().getJ() + 1; j < board[0].length; j++) {\\n\\t\\t\\tif (state.getBoard()[block.getHead().getI()][j] != 0) {\\n\\t\\t\\t\\tblocks.add(state.getBoard()[block.getHead().getI()][j]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\treturn blocks.size() + 1;\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e12eea4310082a0b622f7213e34fd885\",\n \"score\": \"0.54025155\",\n \"text\": \"int checkBlockLine(int[] p_76496_1_, int[] p_76496_2_)\\n {\\n int[] aint2 = new int[] {0, 0, 0};\\n byte b0 = 0;\\n byte b1;\\n\\n for (b1 = 0; b0 < 3; ++b0)\\n {\\n aint2[b0] = p_76496_2_[b0] - p_76496_1_[b0];\\n\\n if (Math.abs(aint2[b0]) > Math.abs(aint2[b1]))\\n {\\n b1 = b0;\\n }\\n }\\n\\n if (aint2[b1] == 0)\\n {\\n return -1;\\n }\\n else\\n {\\n byte b2 = otherCoordPairs[b1];\\n byte b3 = otherCoordPairs[b1 + 3];\\n byte b4;\\n\\n if (aint2[b1] > 0)\\n {\\n b4 = 1;\\n }\\n else\\n {\\n b4 = -1;\\n }\\n\\n double d0 = (double)aint2[b2] / (double)aint2[b1];\\n double d1 = (double)aint2[b3] / (double)aint2[b1];\\n int[] aint3 = new int[] {0, 0, 0};\\n int i = 0;\\n int j;\\n\\n for (j = aint2[b1] + b4; i != j; i += b4)\\n {\\n aint3[b1] = p_76496_1_[b1] + i;\\n aint3[b2] = MathHelper.floor_double((double)p_76496_1_[b2] + (double)i * d0);\\n aint3[b3] = MathHelper.floor_double((double)p_76496_1_[b3] + (double)i * d1);\\n Block block = this.worldObj.getBlock(aint3[0], aint3[1], aint3[2]);\\n\\n if (!this.isReplaceable(worldObj, aint3[0], aint3[1], aint3[2]))\\n {\\n break;\\n }\\n }\\n\\n return i == j ? -1 : Math.abs(i);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f71aa008e611d2242efdbfe4f57ecfa7\",\n \"score\": \"0.5386017\",\n \"text\": \"private List search(List seen, Location loc0, Location loc, boolean leaves, boolean outlinedTree)\\r\\n\\t{\\r\\n\\t\\tList result = new ArrayList<>();\\r\\n\\t\\t//search directions vary based on the mode\\r\\n\\t\\t\\r\\n\\t\\tfor(int mode = outlinedTree ? 1 : 0; mode < (leaves ? 2 : 1); mode++)\\r\\n\\t\\t{\\t\\r\\n\\t\\t\\tUnitRelativePosition[] relativeLocs;\\r\\n\\t\\t\\tif(mode == 1)\\r\\n\\t\\t\\t\\trelativeLocs = SEARCH_LEAVES;\\r\\n\\t\\t\\telse\\r\\n\\t\\t\\t\\trelativeLocs = SEARCH_LOGS;\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tfor(int i=0; i= 100)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tif((Boolean)Setting.DEBUG.getValue())\\r\\n\\t\\t\\t\\t\\t\\t\\tTreeFeller.log(Level.INFO, \\\"Limit reached at x = \\\"+x+\\\",z = \\\"+z);\\r\\n\\t\\t\\t\\t\\t\\tcontinue; \\t\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif((Boolean) Setting.DEBUG.getValue())\\r\\n\\t\\t\\t\\t\\tTreeFeller.log(Level.INFO, \\\"Processing \\\"+neighbor+\\\":\\\"+b.getType()+\\\" in mode \\\"+mode);\\r\\n\\t\\t\\t\\tseen.add(neighbor);\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif(mode == 1)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t//the purpose of this code block is to define a region around the tree that is currently being felled\\r\\n\\t\\t\\t\\t\\t//this region should not contain any other trees so that the leaves of the other trees are not affected \\r\\n\\t\\t\\t\\t\\tif(region != null && !region.contains(x, z))\\r\\n\\t\\t\\t\\t\\t\\tcontinue;\\r\\n\\t\\t\\t\\t\\tif(dist == -1)\\r\\n\\t\\t\\t\\t\\t\\tdist = MathUtil.distSquared(loc0.getBlockX(), loc0.getBlockZ(), x, z);\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t//this heuristic prevents the algorithm from classifying the base of the tree as the stump of another tree\\r\\n\\t\\t\\t\\t\\t//note that this greedy behavior may not always work\\r\\n\\t\\t\\t\\t\\tif(isStump(b, true))\\r\\n\\t\\t\\t\\t\\t\\t\\t//&& (!(Boolean)Setting.USE_HEURISTICS.getValue() || dist > 2))\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tif((Boolean)Setting.DEBUG.getValue())\\r\\n\\t\\t\\t\\t\\t\\t\\tTreeFeller.log(Level.INFO, \\\"Found other tree at \\\"+neighbor.getX()+\\\" \\\"+neighbor.getY()+\\\" \\\"+neighbor.getZ());\\r\\n\\t\\t\\t\\t\\t\\tList seenOther = new ArrayList<>(100);\\r\\n\\t\\t\\t\\t\\t\\tList otherTree = search(seenOther, neighbor, neighbor, false, false);\\r\\n\\t\\t\\t\\t\\t\\tint closestDist = Integer.MAX_VALUE;\\r\\n\\t\\t\\t\\t\\t\\tLocation closest = null;\\r\\n\\t\\t\\t\\t\\t\\tfor(int j=otherTree.size()-1; j>=0; j--)\\r\\n\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\tBlock treeBlock = otherTree.get(j);\\r\\n\\t\\t\\t\\t\\t\\t\\tLocation tl = treeBlock.getLocation();\\r\\n\\t\\t\\t\\t\\t\\t\\tint logDist = MathUtil.distSquared(tl.getBlockX(), tl.getBlockZ(), loc0.getBlockX(), loc0.getBlockZ());\\r\\n\\t\\t\\t\\t\\t\\t\\tif(logDist < closestDist)\\r\\n\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tclosest = tl;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tclosestDist = logDist;\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tif(closest == null && (Boolean)Setting.DEBUG.getValue())\\r\\n\\t\\t\\t\\t\\t\\t\\tTreeFeller.log(Level.WARNING, \\\"closest = null\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tif(region == null \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t|| closest != null && closestDist <= region.getRadiusSquared())\\r\\n\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\tUnitRelativePosition relPos = UnitRelativePosition.getRelativePosition(closest, loc0);\\r\\n\\t\\t\\t\\t\\t\\t\\tLocation offset = UnitRelativePosition.apply(relPos, closest);\\r\\n\\t\\t\\t\\t\\t\\t\\tint ox = offset.getBlockX(), oz = offset.getBlockZ();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t//check to see if this makes the region smaller\\r\\n\\t\\t\\t\\t\\t\\t\\tint candidateDist = MathUtil.distSquared(loc0.getBlockX(), loc0.getBlockZ(), ox, oz);\\r\\n\\t\\t\\t\\t\\t\\t\\tif(region == null)\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tregion = new Region(loc0.getBlockX(), loc0.getBlockZ(), candidateDist);\\r\\n\\t\\t\\t\\t\\t\\t\\telse if(candidateDist < region.getRadiusSquared())\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tregion.setRadiusSquared(candidateDist);\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\tif((Boolean)Setting.DEBUG.getValue())\\r\\n\\t\\t\\t\\t\\t\\t\\tTreeFeller.log(Level.INFO, \\\"Region set to \\\"+region);\\r\\n\\t\\t\\t\\t\\t\\tcontinue;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t//TreeFeller.log(Level.INFO, \\\"Recurring on \\\"+b.getLocation());\\r\\n\\t\\t\\t\\tresult.add(b);\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tList sub = search(seen, loc0, neighbor, leaves, mode == 1);\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tfor(int j=0; j tour) {\\n\\t\\tboolean gotoExchange = false;\\n\\t\\n\\t\\tint c1, c2; /* cities considered for an exchange */\\n\\t\\tint s_c1, s_c2; /* successor cities of c1 and c2 */\\n\\t\\tint p_c1, p_c2; /* predecessor cities of c1 and c2 */\\n\\t\\tint pos_c1, pos_c2; /* positions of cities c1, c2 */\\n\\t\\tint i, j, h, l;\\n\\t\\tint help;\\n\\t\\tboolean improvement_flag;\\n\\t\\tint countImprovement;\\n\\t\\tint h1 = 0, h2 = 0, h3 = 0, h4 = 0;\\n\\t\\tdouble radius; /* radius of nn-search */\\n\\t\\tdouble gain = 0.0;\\n\\t\\tint[] random_vector;\\n\\t\\tHashMap pos; /* positions of cities in tour */\\n\\t\\tHashMap dlb; /* contains don't look bits */\\n\\t\\t\\n\\t\\tpos = new HashMap(tour.size() - 1);\\n\\t\\tdlb = new HashMap(tour.size() - 1);\\n\\t\\tfor (i = 0; i < tour.size() - 1; i++) {\\n\\t\\t pos.put(tour.get(i), i);\\n\\t\\t dlb.put(tour.get(i), false);\\n\\t\\t}\\n\\t\\n\\t\\timprovement_flag = true;\\n\\t\\tcountImprovement = 0;\\n\\t\\trandom_vector = generate_random_permutation(tour);\\n\\t\\n\\t\\twhile (improvement_flag) {\\n\\t\\t\\tif (countImprovement > 50) {\\n\\t\\t\\t\\t//System.out.println(\\\"Exiting from loop..\\\");\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t improvement_flag = false;\\n\\t\\n\\t\\t for (l = 0; l < tour.size() - 1; l++) {\\n\\t\\t\\t\\tc1 = random_vector[l];\\n\\t\\t\\t\\tif (dlb_flag && dlb.get(c1))\\n\\t\\t\\t\\t continue;\\n\\t\\t\\t\\tpos_c1 = pos.get(c1);\\n\\t\\t\\t\\ts_c1 = tour.get(pos_c1 + 1);\\n\\t\\t\\t\\tradius = MTsp.instance.distance[c1 + 1][s_c1 + 1];\\n\\t\\t\\n\\t\\t\\t\\t/* First search for c1's nearest neighbours, use successor of c1 */\\n\\t\\t\\t\\tfor (h = 0; h < nn_ls; h++) {\\n\\t\\t\\t\\t c2 = MTsp.instance.nn_list_all[c1 + 1][h]; /* exchange partner, determine its position */\\n\\t\\t\\t\\t //make sure that c2 is in the same subtour with c1; if it isn't choose another element\\n\\t\\t\\t\\t if (pos.get(c2 - 1) == null) {\\n\\t\\t\\t\\t \\tcontinue;\\n\\t\\t\\t\\t }\\n\\t\\t\\t\\t if (radius > MTsp.instance.distance[c1 + 1][c2]) {\\n\\t\\t\\t\\t\\t\\ts_c2 = tour.get(pos.get(c2 - 1) + 1);\\n\\t\\t\\t\\t\\t\\tgain = -radius + MTsp.instance.distance[c1 + 1][c2] + MTsp.instance.distance[s_c1 + 1][s_c2 + 1]\\n\\t\\t\\t\\t\\t\\t\\t- MTsp.instance.distance[c2][s_c2 + 1];\\n\\t\\t\\t\\t\\t\\tif (gain < 0) {\\n\\t\\t\\t\\t\\t\\t h1 = c1;\\n\\t\\t\\t\\t\\t\\t h2 = s_c1;\\n\\t\\t\\t\\t\\t\\t h3 = c2 - 1;\\n\\t\\t\\t\\t\\t\\t h4 = s_c2;\\n\\t\\t\\t\\t\\t\\t gotoExchange = true;\\n\\t\\t\\t\\t\\t\\t break;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t } else\\n\\t\\t\\t\\t \\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\n\\t\\t\\t\\tif (gotoExchange) {\\n\\t\\t\\t\\t /* Search one for next c1's h-nearest neighbours, use predecessor c1 */\\n\\t\\t\\t\\t if (pos_c1 > 0)\\n\\t\\t\\t\\t \\tp_c1 = tour.get(pos_c1 - 1);\\n\\t\\t\\t\\t else\\n\\t\\t\\t\\t \\tp_c1 = tour.get(tour.size() - 2);\\n\\t\\t\\t\\t radius = MTsp.instance.distance[p_c1 + 1][c1 + 1];\\n\\t\\t\\t\\t for (h = 0; h < nn_ls; h++) {\\n\\t\\t\\t\\t\\t\\tc2 = MTsp.instance.nn_list_all[c1 + 1][h]; /* exchange partner, determine its position */\\n\\t\\t\\t\\t\\t\\t//make sure that c2 is in the same subtour with c1; if it isn't choose another element\\n\\t\\t\\t\\t\\t if (pos.get(c2 - 1) == null) {\\n\\t\\t\\t\\t\\t \\tcontinue;\\n\\t\\t\\t\\t\\t }\\n\\t\\t\\t\\t\\t\\tif (radius > MTsp.instance.distance[c1 + 1][c2]) {\\n\\t\\t\\t\\t\\t\\t pos_c2 = pos.get(c2 - 1);\\n\\t\\t\\t\\t\\t\\t if (pos_c2 > 0)\\n\\t\\t\\t\\t\\t\\t \\tp_c2 = tour.get(pos_c2 - 1);\\n\\t\\t\\t\\t\\t\\t else\\n\\t\\t\\t\\t\\t\\t \\tp_c2 = tour.get(tour.size() - 2);\\n\\t\\t\\t\\t\\t\\t if (p_c2 == c1)\\n\\t\\t\\t\\t\\t\\t \\tcontinue;\\n\\t\\t\\t\\t\\t\\t if (p_c1 == (c2 - 1))\\n\\t\\t\\t\\t\\t\\t \\tcontinue;\\n\\t\\t\\t\\t\\t\\t gain = -radius + MTsp.instance.distance[c1 + 1][c2] + MTsp.instance.distance[p_c1 + 1][p_c2 + 1]\\n\\t\\t\\t\\t\\t\\t\\t - MTsp.instance.distance[p_c2 + 1][c2];\\n\\t\\t\\t\\t\\t\\t if (gain < 0) {\\n\\t\\t\\t\\t\\t\\t\\t\\th1 = p_c1;\\n\\t\\t\\t\\t\\t\\t\\t\\th2 = c1;\\n\\t\\t\\t\\t\\t\\t\\t\\th3 = p_c2;\\n\\t\\t\\t\\t\\t\\t\\t\\th4 = c2 - 1;\\n\\t\\t\\t\\t\\t\\t\\t\\tgotoExchange = true;\\n\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t }\\n\\t\\t\\t\\t\\t\\t} else\\n\\t\\t\\t\\t\\t\\t break;\\n\\t\\t\\t\\t }\\n\\t\\t\\t\\t}\\n\\t\\t\\n\\t\\t\\t\\tif (!gotoExchange) {\\n\\t\\t\\t\\t /* No exchange */\\n\\t\\t\\t\\t dlb.put(c1, true);\\n\\t\\t\\t\\t continue;\\n\\t\\t\\t\\t}\\n\\t\\t\\n\\t\\t\\t\\tif (gotoExchange) {\\n\\t\\t\\t\\t gotoExchange = false;\\n\\t\\t\\t\\t improvement_flag = true;\\n\\t\\t\\t\\t countImprovement++;\\n\\t\\t\\t\\t //System.out.println(\\\"countImprovement=\\\" + countImprovement);\\n\\t\\t\\t\\t dlb.put(h1, false);\\n\\t\\t\\t\\t dlb.put(h2, false);\\n\\t\\t\\t\\t dlb.put(h3, false);\\n\\t\\t\\t\\t dlb.put(h4, false);\\n\\t\\t\\t\\t /* Now perform move */\\n\\t\\t\\t\\t if (pos.get(h3) < pos.get(h1)) {\\n\\t\\t\\t\\t\\t\\thelp = h1;\\n\\t\\t\\t\\t\\t\\th1 = h3;\\n\\t\\t\\t\\t\\t\\th3 = help;\\n\\t\\t\\t\\t\\t\\thelp = h2;\\n\\t\\t\\t\\t\\t\\th2 = h4;\\n\\t\\t\\t\\t\\t\\th4 = help;\\n\\t\\t\\t\\t }\\n\\t\\t\\t\\t if (pos.get(h3) - pos.get(h2) < (tour.size() - 1) / 2 + 1) {\\n\\t\\t\\t\\t\\t\\t/* reverse inner part from pos[h2] to pos[h3] */\\n\\t\\t\\t\\t\\t\\ti = pos.get(h2);\\n\\t\\t\\t\\t\\t\\tj = pos.get(h3);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"i=\\\" + i + \\\" j=\\\" + j);\\n\\t\\t\\t\\t\\t\\tif (i >= j) {\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"Got here..\\\");\\n\\t\\t\\t\\t\\t\\t\\t//countImprovement--;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\twhile (i < j) {\\n\\t\\t\\t\\t\\t\\t c1 = tour.get(i);\\n\\t\\t\\t\\t\\t\\t c2 = tour.get(j);\\n\\t\\t\\t\\t\\t\\t tour.set(i, c2);\\n\\t\\t\\t\\t\\t\\t tour.set(j, c1);\\n\\t\\t\\t\\t\\t\\t pos.put(c1, j);\\n\\t\\t\\t\\t\\t\\t pos.put(c2, i);\\n\\t\\t\\t\\t\\t\\t i++;\\n\\t\\t\\t\\t\\t\\t j--;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"Improvement applied->case 1..\\\");\\n\\t\\t\\t\\t } else {\\n\\t\\t\\t\\t\\t\\t/* reverse outer part from pos[h4] to pos[h1] */\\n\\t\\t\\t\\t\\t\\ti = pos.get(h1);\\n\\t\\t\\t\\t\\t\\tj = pos.get(h4);\\n\\t\\t\\t\\t\\t\\tif (j > i)\\n\\t\\t\\t\\t\\t\\t help = tour.size() - (j - i);\\n\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t help = (i - j) + 1;\\n\\t\\t\\t\\t\\t\\thelp = help / 2;\\n\\t\\t\\t\\t\\t\\tfor (h = 0; h < help; h++) {\\n\\t\\t\\t\\t\\t\\t c1 = tour.get(i);\\n\\t\\t\\t\\t\\t\\t c2 = tour.get(j);\\n\\t\\t\\t\\t\\t\\t tour.set(i, c2);\\n\\t\\t\\t\\t\\t\\t tour.set(j, c1);\\n\\t\\t\\t\\t\\t\\t pos.put(c1, j);\\n\\t\\t\\t\\t\\t\\t pos.put(c2, i);\\n\\t\\t\\t\\t\\t\\t i--;\\n\\t\\t\\t\\t\\t\\t j++;\\n\\t\\t\\t\\t\\t\\t if (i < 0)\\n\\t\\t\\t\\t\\t\\t \\ti = tour.size() - 2;\\n\\t\\t\\t\\t\\t\\t if (j >= tour.size() - 1)\\n\\t\\t\\t\\t\\t\\t \\tj = 0;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\ttour.set(tour.size() - 1, tour.get(0));\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"Improvement applied->case 2..\\\");\\n\\t\\t\\t\\t }\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t dlb.put(c1, true);\\n\\t\\t\\t\\t}\\n\\t\\n\\t\\t }\\n\\t\\t}\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ae7cccbc2e14c4365876a81e3c3f2e77\",\n \"score\": \"0.53374946\",\n \"text\": \"private void insertionSort(){\\n\\t\\tfor (int e=1; e-1;d--){\\r\\n\\t\\t\\t\\tif(bots.get(d+1).getNumBeeps() 0) {\\n/* 542 */ return j + 1;\\n/* */ }\\n/* 544 */ while (i <= j) {\\n/* 545 */ k = i + (j - i) / 2;\\n/* 546 */ MarkData markData1 = this.marks.elementAt(k);\\n/* 547 */ m = compare(paramMarkData, markData1);\\n/* */ \\n/* 549 */ if (m == 0)\\n/* */ {\\n/* 551 */ return k; } \\n/* 552 */ if (m < 0) {\\n/* 553 */ j = k - 1; continue;\\n/* */ } \\n/* 555 */ i = k + 1;\\n/* */ } \\n/* */ \\n/* */ \\n/* */ \\n/* 560 */ return (m < 0) ? k : (k + 1);\\n/* */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2540e7124e8a748c98f9766d025f7255\",\n \"score\": \"0.5313515\",\n \"text\": \"void sortSquidL(Squid[] a, int many) {\\n for (int m = many; m > 1; m--) {\\n int k = 0;\\n for (int j = 1; j a[k].legs) k = j;\\n }\\n swapSquid(a, m-1, k);\\n }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"04c56aaf2cf4ad99407e19d0f48ac25a\",\n \"score\": \"0.53018624\",\n \"text\": \"void preOrder();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"91ed777fb8ae57e4c70b328df3bc70e5\",\n \"score\": \"0.5292525\",\n \"text\": \"public void func_70299_a(int par1, ItemStack par2ItemStack)\\n/* */ {\\n/* 131 */ this.furnaceItemStacks[par1] = par2ItemStack;\\n/* */ \\n/* 133 */ if ((par2ItemStack != null) && (par2ItemStack.field_77994_a > func_70297_j_()))\\n/* */ {\\n/* 135 */ par2ItemStack.field_77994_a = func_70297_j_();\\n/* */ }\\n/* */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e317a71f3a9909ad50735e0adde56f73\",\n \"score\": \"0.52908826\",\n \"text\": \"public T put(long var1_1, T var3_2) {\\n block4 : {\\n var4_3 = (int)(var1_1 & (long)this.mask);\\n var5_4 = this.table[var4_3];\\n do {\\n if (var5_4 == null) {\\n this.table[var4_3] = new Entry(var1_1, var3_2, this.table[var4_3]);\\n var7_5 = this.size;\\n this.size = var7_5 + 1;\\n if (var7_5 < this.threshold) return null;\\n break block4;\\n }\\n if (var5_4.key == var1_1) break;\\n var5_4 = var5_4.next;\\n } while (true);\\n var6_14 = var5_4.value;\\n var5_4.value = var3_2;\\n return var6_14;\\n }\\n var8_6 = 2 * this.capacity;\\n var9_7 = new Entry[var8_6];\\n var10_8 = this.table;\\n var11_9 = var8_6 - 1;\\n var12_10 = 0;\\n do {\\n ** if (var12_10 >= var10_8.length) goto lbl26\\nlbl24: // 1 sources:\\n ** if ((var13_11 = var10_8[var12_10]) == null) goto lbl38\\nlbl25: // 1 sources:\\n ** GOTO lbl31\\nlbl26: // 1 sources:\\n this.table = var9_7;\\n this.capacity = var8_6;\\n this.threshold = (int)((float)var8_6 * this.loadFactor);\\n this.mask = -1 + this.capacity;\\n return null;\\nlbl31: // 1 sources:\\n var10_8[var12_10] = null;\\n do {\\n var14_12 = var13_11.next;\\n var15_13 = (int)(var13_11.key & (long)var11_9);\\n var13_11.next = var9_7[var15_13];\\n var9_7[var15_13] = var13_11;\\n } while ((var13_11 = var14_12) != null);\\nlbl38: // 2 sources:\\n ++var12_10;\\n } while (true);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d0a50609234726f2b3ce92605a7feb30\",\n \"score\": \"0.52826387\",\n \"text\": \"public ur b(qx player, int i)\\r\\n/* 44: */ {\\r\\n/* 45:36 */ ur itemstack = null;\\r\\n/* 46:37 */ sr slot = (sr)this.c.get(i);\\r\\n/* 47:38 */ if ((slot != null) && (slot.d()))\\r\\n/* 48: */ {\\r\\n/* 49:39 */ ur itemstack1 = slot.c();\\r\\n/* 50:40 */ itemstack = itemstack1.l();\\r\\n/* 51:41 */ if (i < 9)\\r\\n/* 52: */ {\\r\\n/* 53:42 */ if (!a(itemstack1, 9, 45, true)) {\\r\\n/* 54:43 */ return null;\\r\\n/* 55: */ }\\r\\n/* 56: */ }\\r\\n/* 57:45 */ else if (!a(itemstack1, 0, 9, false)) {\\r\\n/* 58:46 */ return null;\\r\\n/* 59: */ }\\r\\n/* 60:48 */ if (itemstack1.a == 0) {\\r\\n/* 61:49 */ slot.c(null);\\r\\n/* 62: */ } else {\\r\\n/* 63:51 */ slot.e();\\r\\n/* 64: */ }\\r\\n/* 65:53 */ if (itemstack1.a != itemstack.a) {\\r\\n/* 66:54 */ slot.a(player, itemstack1);\\r\\n/* 67: */ } else {\\r\\n/* 68:56 */ return null;\\r\\n/* 69: */ }\\r\\n/* 70: */ }\\r\\n/* 71:59 */ return itemstack;\\r\\n/* 72: */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e4c2b3c82568f5ee1fb8827db67f3328\",\n \"score\": \"0.52759075\",\n \"text\": \"private void fallbackSort(int last) {\\n data.block[0] = data.block[last + 1];\\n fallbackSortImpl(last + 1);\\n\\n for (int i = 0; i < last + 1; i++)\\n --data.fmap[i];\\n\\n for (int i = 0; i < last + 1; i++) {\\n if (data.fmap[i] != -1)\\n continue;\\n\\n data.fmap[i] = last;\\n break;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b1df26d5a5f510a4119b1945411f2ed9\",\n \"score\": \"0.52703583\",\n \"text\": \"private void lruAlgorithm() {\\n int pointer = -1;\\n LinkedList lstPageRepl = new LinkedList<>();\\n for (int i = 0; i < pageAccess.length; i++) {\\n if(i != 0)\\n lruCopyHistory(i-1, i);\\n\\n if(lstPageRepl.contains(pageAccess[i])) {\\n lstPageRepl.remove(lstPageRepl.indexOf(pageAccess[i]));\\n lstPageRepl.addFirst(pageAccess[i]);\\n allLinkedListsHistory.add(new LinkedList<>(lstPageRepl));\\n continue;\\n }\\n\\n if(lstPageRepl.size() < amountPageFrames) {\\n pointer++;\\n }\\n else {\\n int toReplace = lstPageRepl.getLast();\\n Integer[] actualArrayHistory = IntStream.of( pageReplacementHistory[i] ).boxed().toArray( Integer[]::new );\\n pointer = Arrays.asList(actualArrayHistory).indexOf(toReplace);\\n lstPageRepl.removeLast();\\n }\\n lstPageRepl.addFirst(pageAccess[i]);\\n pageReplacementHistory[i][pointer] = pageAccess[i];\\n allLinkedListsHistory.add(new LinkedList<>(lstPageRepl));\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5dd708353f4783c2f04cf6e7568fde3d\",\n \"score\": \"0.52651733\",\n \"text\": \"public ur b(qx player, int i)\\r\\n/* 45: */ {\\r\\n/* 46:35 */ ur itemstack = null;\\r\\n/* 47:36 */ sr slot = (sr)this.c.get(i);\\r\\n/* 48:37 */ if ((slot != null) && (slot.d()))\\r\\n/* 49: */ {\\r\\n/* 50:38 */ ur itemstack1 = slot.c();\\r\\n/* 51:39 */ itemstack = itemstack1.l();\\r\\n/* 52:40 */ if (i < 9)\\r\\n/* 53: */ {\\r\\n/* 54:41 */ if (!a(itemstack1, 9, 45, true)) {\\r\\n/* 55:42 */ return null;\\r\\n/* 56: */ }\\r\\n/* 57: */ }\\r\\n/* 58:44 */ else if (!a(itemstack1, 0, 9, false)) {\\r\\n/* 59:45 */ return null;\\r\\n/* 60: */ }\\r\\n/* 61:47 */ if (itemstack1.a == 0) {\\r\\n/* 62:48 */ slot.c(null);\\r\\n/* 63: */ } else {\\r\\n/* 64:50 */ slot.e();\\r\\n/* 65: */ }\\r\\n/* 66:52 */ if (itemstack1.a != itemstack.a) {\\r\\n/* 67:53 */ slot.a(player, itemstack1);\\r\\n/* 68: */ } else {\\r\\n/* 69:55 */ return null;\\r\\n/* 70: */ }\\r\\n/* 71: */ }\\r\\n/* 72:58 */ return itemstack;\\r\\n/* 73: */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"64eab175a3f3aea96033eade29b5da80\",\n \"score\": \"0.52643365\",\n \"text\": \"public ABObject computeFinalBlocks2() {\\n ArrayList allBlocks = getAllBlocks();\\n if(pigs != null)\\n allBlocks.addAll(pigs);\\n ArrayList piggies = new ArrayList();\\n if(pigs != null)\\n piggies.addAll(pigs);\\n\\n Point total_com = getCenterOfMass(allBlocks);\\n Point pigs_com = getCenterOfMass(piggies);\\n System.out.println(\\\"Totol COM \\\" + total_com);\\n System.out.println(\\\"Pig COM \\\" + pigs_com);\\n\\n System.out.println(\\\"Distance Pig COM and Total Com \\\" + (distance(pigs_com, total_com)));\\n if(distance(pigs_com, total_com) < 70 || true)\\n {\\n ABObject top_target = topToppleTarget(total_com);\\n ABObject bottom_target = bottomSlideTarget(total_com);\\n System.out.println(\\\"top_tagert X: \\\" + ((top_target)));\\n System.out.println(\\\"bootom_tagert X: \\\" + ((bottom_target)));\\n\\n if(top_target!=null)\\n return top_target;\\n else if(bottom_target!=null)\\n return bottom_target;\\n }\\n return null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d16759d2069d172d01891d7ad7f81427\",\n \"score\": \"0.52624166\",\n \"text\": \"public void sort() {\\n\\t\\tfor(int i = 0; i < rij.length-1; i++){\\n\\t\\t\\tint min = i;\\n\\t\\t\\tfor(int j = i+1; j 0; var4--) {\\n/* */ \\n/* 245 */ func_175905_a(worldIn, p_175923_2_, Blocks.vine, p_175923_3_);\\n/* 246 */ p_175923_2_ = p_175923_2_.offsetDown();\\n/* */ } \\n/* */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bbd349e6e54e8dc2974e9cc799af55e9\",\n \"score\": \"0.52301526\",\n \"text\": \"public void func_145845_h()\\n/* */ {\\n/* 322 */ boolean flag = this.furnaceBurnTime > 0;\\n/* 323 */ boolean flag1 = false;\\n/* 324 */ this.count += 1;\\n/* 325 */ if (this.furnaceBurnTime > 0)\\n/* */ {\\n/* 327 */ this.furnaceBurnTime -= 1;\\n/* */ }\\n/* */ \\n/* 330 */ if (!this.field_145850_b.field_72995_K)\\n/* */ {\\n/* 332 */ if (this.bellows < 0) { getBellows();\\n/* */ }\\n/* 334 */ if ((this.count % (this.speedBoost ? 20 : 40) == 0) && (this.aspects.size() > 0)) {\\n/* 335 */ AspectList exlude = new AspectList();\\n/* 336 */ int deep = 0;\\n/* 337 */ TileEntity tile = null;\\n/* 338 */ while (deep < 5) {\\n/* 339 */ deep++;\\n/* 340 */ tile = this.field_145850_b.func_147438_o(this.field_145851_c, this.field_145848_d + deep, this.field_145849_e);\\n/* 341 */ if (!(tile instanceof TileAlembic)) break;\\n/* 342 */ TileAlembic alembic = (TileAlembic)tile;\\n/* 343 */ if ((alembic.aspect != null) && (alembic.amount < alembic.maxAmount) && (this.aspects.getAmount(alembic.aspect) > 0)) {\\n/* 344 */ takeFromContainer(alembic.aspect, 1);\\n/* 345 */ alembic.addToContainer(alembic.aspect, 1);\\n/* 346 */ exlude.merge(alembic.aspect, 1);\\n/* 347 */ this.field_145850_b.func_147471_g(this.field_145851_c, this.field_145848_d, this.field_145849_e);\\n/* 348 */ this.field_145850_b.func_147471_g(this.field_145851_c, this.field_145848_d + deep, this.field_145849_e);\\n/* */ }\\n/* 350 */ tile = null;\\n/* */ }\\n/* */ \\n/* */ \\n/* */ \\n/* */ \\n/* 356 */ deep = 0;\\n/* 357 */ while (deep < 5) {\\n/* 358 */ deep++;\\n/* 359 */ tile = this.field_145850_b.func_147438_o(this.field_145851_c, this.field_145848_d + deep, this.field_145849_e);\\n/* 360 */ if (!(tile instanceof TileAlembic)) break;\\n/* 361 */ TileAlembic alembic = (TileAlembic)tile;\\n/* 362 */ if ((alembic.aspect == null) || (alembic.amount == 0)) {\\n/* 363 */ Aspect as = null;\\n/* 364 */ if (alembic.aspectFilter == null) {\\n/* 365 */ as = takeRandomAspect(exlude);\\n/* */ }\\n/* 367 */ else if (takeFromContainer(alembic.aspectFilter, 1)) {\\n/* 368 */ as = alembic.aspectFilter;\\n/* */ }\\n/* */ \\n/* 371 */ if (as != null) {\\n/* 372 */ alembic.addToContainer(as, 1);\\n/* 373 */ this.field_145850_b.func_147471_g(this.field_145851_c, this.field_145848_d, this.field_145849_e);\\n/* 374 */ this.field_145850_b.func_147471_g(this.field_145851_c, this.field_145848_d + deep, this.field_145849_e);\\n/* 375 */ break;\\n/* */ }\\n/* */ }\\n/* */ }\\n/* */ }\\n/* */ \\n/* */ \\n/* */ \\n/* */ \\n/* */ \\n/* 385 */ if ((this.furnaceBurnTime == 0) && (canSmelt()))\\n/* */ {\\n/* 387 */ this.currentItemBurnTime = (this.furnaceBurnTime = TileEntityFurnace.func_145952_a(this.furnaceItemStacks[1]));\\n/* */ \\n/* 389 */ if (this.furnaceBurnTime > 0)\\n/* */ {\\n/* 391 */ flag1 = true;\\n/* 392 */ this.speedBoost = false;\\n/* */ \\n/* 394 */ if (this.furnaceItemStacks[1] != null)\\n/* */ {\\n/* 396 */ if (this.furnaceItemStacks[1].func_77969_a(new ItemStack(thaumcraft.common.config.ConfigItems.itemResource, 1, 0))) {\\n/* 397 */ this.speedBoost = true;\\n/* */ }\\n/* 399 */ this.furnaceItemStacks[1].field_77994_a -= 1;\\n/* */ \\n/* 401 */ if (this.furnaceItemStacks[1].field_77994_a == 0)\\n/* */ {\\n/* 403 */ this.furnaceItemStacks[1] = this.furnaceItemStacks[1].func_77973_b().getContainerItem(this.furnaceItemStacks[1]);\\n/* */ }\\n/* */ }\\n/* */ }\\n/* */ }\\n/* */ \\n/* 409 */ if ((isBurning()) && (canSmelt()))\\n/* */ {\\n/* 411 */ this.furnaceCookTime += 1;\\n/* */ \\n/* 413 */ if (this.furnaceCookTime >= this.smeltTime)\\n/* */ {\\n/* 415 */ this.furnaceCookTime = 0;\\n/* 416 */ smeltItem();\\n/* 417 */ flag1 = true;\\n/* */ }\\n/* */ }\\n/* */ else\\n/* */ {\\n/* 422 */ this.furnaceCookTime = 0;\\n/* */ }\\n/* */ \\n/* 425 */ if (flag != this.furnaceBurnTime > 0)\\n/* */ {\\n/* 427 */ flag1 = true;\\n/* 428 */ this.field_145850_b.func_147471_g(this.field_145851_c, this.field_145848_d, this.field_145849_e);\\n/* */ }\\n/* */ }\\n/* */ \\n/* 432 */ if (flag1)\\n/* */ {\\n/* 434 */ func_70296_d();\\n/* */ }\\n/* */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e7d8fc5ee34c3a50a78f092d63bf0a8\",\n \"score\": \"0.52026606\",\n \"text\": \"@Override\\n\\t\\tpublic Bloc[] genererBlocs() {\\n\\t\\t\\treturn null;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e7d8fc5ee34c3a50a78f092d63bf0a8\",\n \"score\": \"0.52026606\",\n \"text\": \"@Override\\n\\t\\tpublic Bloc[] genererBlocs() {\\n\\t\\t\\treturn null;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e7d8fc5ee34c3a50a78f092d63bf0a8\",\n \"score\": \"0.52026606\",\n \"text\": \"@Override\\n\\t\\tpublic Bloc[] genererBlocs() {\\n\\t\\t\\treturn null;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e7d8fc5ee34c3a50a78f092d63bf0a8\",\n \"score\": \"0.52026606\",\n \"text\": \"@Override\\n\\t\\tpublic Bloc[] genererBlocs() {\\n\\t\\t\\treturn null;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e7d8fc5ee34c3a50a78f092d63bf0a8\",\n \"score\": \"0.52026606\",\n \"text\": \"@Override\\n\\t\\tpublic Bloc[] genererBlocs() {\\n\\t\\t\\treturn null;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e7d8fc5ee34c3a50a78f092d63bf0a8\",\n \"score\": \"0.52026606\",\n \"text\": \"@Override\\n\\t\\tpublic Bloc[] genererBlocs() {\\n\\t\\t\\treturn null;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e7d8fc5ee34c3a50a78f092d63bf0a8\",\n \"score\": \"0.52026606\",\n \"text\": \"@Override\\n\\t\\tpublic Bloc[] genererBlocs() {\\n\\t\\t\\treturn null;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4514e5bebadc26519ebd188070fa0dc0\",\n \"score\": \"0.51974565\",\n \"text\": \"public void breadthFirstExplore() {\\n for (ArrayList nodeArray : nodeGrid) {\\n for (Node node : nodeArray) {\\n node.parent = null;\\n }\\n }\\n PriorityQueue frontierQueue = new PriorityQueue(1, new Comparator() {\\n public int compare(Node a, Node b) {\\n int distA = 0;\\n int distB = 0;\\n /*\\n if (Ant.this.ants.getFoodTiles().size() > 0) {\\n Tile closestFood = Ant.this.distanceSort(Ant.this.ants.getFoodTiles()).peek();\\n distA = Ant.this.ants.getDistance(a.position, closestFood);\\n distB = Ant.this.ants.getDistance(b.position, closestFood);\\n } else if (Ant.this.closestUnseen != null) {\\n distA = Ant.this.ants.getDistance(a.position, Ant.this.closestUnseen);\\n distB = Ant.this.ants.getDistance(b.position, Ant.this.closestUnseen);\\n }\\n */\\n return (distA + a.length()) - (distB + b.length());\\n }\\n });\\n frontierQueue.add(nodeGrid.get(this.position.getRow()).get(this.position.getCol()));\\n HashSet frontierSet = new HashSet(frontierQueue);\\n HashSet exploredSet = new HashSet();\\n List |