list) {\r\n if (distToLeft() >= 3) {\r\n Random random = new Random(2749631);\r\n int leftExtension;\r\n do {\r\n leftExtension = 1 + Math.abs(RandomUtils.geometric(random, 0.2));\r\n } while (leftExtension >= distToLeft());\r\n\r\n int extensionHeight = 2 + Math.abs(RandomUtils.poisson(random, 2));\r\n int start = Math.max(0,\r\n RandomUtils.uniform(random, endDoor().Y() - extensionHeight, endDoor().Y()));\r\n int end = start + extensionHeight + 1;\r\n if (branchEnable(endDoor(), LEFT, leftExtension, start, end) &&\r\n RandomUtils.bernoulli(random, 1.0 - leftExtension * 1.0 / distToLeft())) {\r\n Room bottomRoom = new Room(endDoor().X() - leftExtension, start + 1, leftExtension, extensionHeight, myWorld);\r\n bottomRoom.setDoor(RIGHT, endDoor().X() - 1, endDoor().Y());\r\n list.add(bottomRoom);\r\n }\r\n }\r\n\r\n if (hasSideDoor() && distToTop() >= 3) {\r\n Random random = new Random(8461375);\r\n int topExtension;\r\n do {\r\n topExtension = 1 + Math.abs(RandomUtils.geometric(random, 0.2));\r\n } while (topExtension >= distToTop());\r\n\r\n if (branchEnable(sideDoor(), UP, topExtension, sideDoor().X() - 1, sideDoor().X() + 1) &&\r\n RandomUtils.bernoulli(random, 1.0 - topExtension * 1.0 / distToTop())) {\r\n list.add(new Hallway(sideDoor().X(), sideDoor().Y() + 1, topExtension, UP, myWorld));\r\n }\r\n }\r\n\r\n if (hasSideDoor() && distToBottom() >= 3) {\r\n Random random = new Random(7894561);\r\n int bottomExtension;\r\n do {\r\n bottomExtension = 1 + Math.abs(RandomUtils.geometric(random, 0.2));\r\n } while (bottomExtension >= distToBottom());\r\n\r\n if (branchEnable(sideDoor(), DOWN, bottomExtension, sideDoor().X() - 1, sideDoor().X() + 1) &&\r\n RandomUtils.bernoulli(random, 1.0 - bottomExtension * 1.0 / distToBottom())) {\r\n list.add(new Hallway(sideDoor().X(), sideDoor().Y() - 1, bottomExtension, DOWN, myWorld));\r\n }\r\n }\r\n }","title":""},{"docid":"0e6ab2197ee4a96ec38740617de6316b","score":"0.6124575","text":"public void goUp(int desiredFloor) {\n if (doorOpen == false && desiredFloor > currentFloor && desiredFloor <= numberOfFloors) {\r\n currentFloor = desiredFloor;\r\n }\r\n }","title":""},{"docid":"232cb22314cdd10c9682c7ddbec3563e","score":"0.6078508","text":"private void branchRight(List<Space> list) {\r\n if (distToRight() >= 3) {\r\n Random random = new Random(69451873);\r\n int rightExtension;\r\n do {\r\n rightExtension = 1 + Math.abs(RandomUtils.geometric(random, 0.2));\r\n } while (rightExtension >= distToRight());\r\n\r\n int extensionHeight = 2 + Math.abs(RandomUtils.poisson(random, 2));\r\n int start = Math.max(0,\r\n RandomUtils.uniform(random, endDoor().Y() - extensionHeight, endDoor().Y()));\r\n int end = start + extensionHeight + 1;\r\n if (branchEnable(endDoor(), RIGHT, rightExtension, start, end) &&\r\n RandomUtils.bernoulli(random, 1.0 - rightExtension * 1.0 / distToRight())) {\r\n Room rightRoom = new Room(endDoor().X() + 1, start + 1, rightExtension, extensionHeight, myWorld);\r\n rightRoom.setDoor(LEFT, endDoor().X() + 1, endDoor().Y());\r\n list.add(rightRoom);\r\n }\r\n }\r\n\r\n if (hasSideDoor() && distToTop() >= 3) {\r\n Random random = new Random(8461375);\r\n int topExtension;\r\n do {\r\n topExtension = 1 + Math.abs(RandomUtils.geometric(random, 0.2));\r\n } while (topExtension >= distToTop());\r\n\r\n if (branchEnable(sideDoor(), UP, topExtension, sideDoor().X() - 1, sideDoor().X() + 1) &&\r\n RandomUtils.bernoulli(random, 1.0 - topExtension * 1.0 / distToTop())) {\r\n list.add(new Hallway(sideDoor().X(), sideDoor().Y() + 1, topExtension, UP, myWorld));\r\n }\r\n }\r\n\r\n if (hasSideDoor() && distToBottom() >= 3) {\r\n Random random = new Random(7894561);\r\n int bottomExtension;\r\n do {\r\n bottomExtension = 1 + Math.abs(RandomUtils.geometric(random, 0.2));\r\n } while (bottomExtension >= distToBottom());\r\n\r\n if (branchEnable(sideDoor(), DOWN, bottomExtension, sideDoor().X() - 1, sideDoor().X() + 1) &&\r\n RandomUtils.bernoulli(random, 1.0 - bottomExtension * 1.0 / distToBottom())) {\r\n list.add(new Hallway(sideDoor().X(), sideDoor().Y() - 1, bottomExtension, DOWN, myWorld));\r\n }\r\n }\r\n }","title":""},{"docid":"2a2020ef3a9a9338e08625ee10cea9b4","score":"0.6074555","text":"public void pushUp(int onFloor, int toFloor) {\n\t\tsynchronized (floors[onFloor]) {\n\t\t\tSystem.out.println(\"*** Someone on floor \" + onFloor\n\t\t\t\t\t+ \" wants to go to \" + toFloor);\n\t\t\tfloors[onFloor].upPeople.addElement(new Integer(toFloor));\n\t\t\tif (floors[onFloor].upPeople.size() == 1)\n\t\t\t\tfloors[onFloor].upFlag = false;\n\t\t}\n\t}","title":""},{"docid":"476988327d322bfe6616ff83d3a4298b","score":"0.5934221","text":"public void putUp() {\n wristSolenoid.set(false);\n }","title":""},{"docid":"68a2ebec21a3449a8e22960cd6cc6200","score":"0.5883428","text":"public void moveUp() {\n if (currentDirection != direction.down) { // it is not possible to move\n // in the opposite direction\n currentDirection = direction.up;\n }\n }","title":""},{"docid":"f58109bfbd1a05e314491c93dea8b31f","score":"0.56877404","text":"@Override\r\n public List<Space> branch() {\n ArrayList<Space> branches = new ArrayList<>();\r\n //Random random = new Random(194623);\r\n\r\n switch (direction) {\r\n case UP -> branchUp(branches);\r\n case RIGHT -> branchRight(branches);\r\n case DOWN -> branchDown(branches);\r\n case LEFT -> branchLeft(branches);\r\n default -> throw new IllegalArgumentException(\"Illegal direction!\");\r\n }\r\n return branches;\r\n }","title":""},{"docid":"7da8c8a970d7fe3a70009d7c9913c7d8","score":"0.5685818","text":"public void isOpenUp(){\n\t\tplayer1.setDirection(\"Up\");\n\t\ttry {\n\t\t\tif (this.checkPos(player1.getX(), player1.getY() - 1) == player1.returnOpen()|| this.checkPos(player1.getX(), player1.getY() - 1) == player1.returnExit() ||\n\t\t\t\t\tthis.checkPos(player1.getX(), player1.getY() - 1) == player1.returnPowerUp() || this.checkPos(player1.getX(), player1.getY() - 1) == player1.returnEvidence() ||\n\t\t\t\t\tthis.checkPos(player1.getX(), player1.getY() - 1) == player1.returnFinished()){\n\t\t\t\tplayer1.moveUp();\n\t\t\t\tthis.setPos();\n\t\t\t\tSystem.out.println(\"Your position is \" + player1.getX() + \", \" + player1.getY());\n\t\t\t}\n\t\t\telse {\n\t\t\t\tSystem.out.println(\"Cannot go here\");\n\t\t\t}\n\t\t\tif (this.isDone()) {\n\t\t\t\tplayer1.setX(2);\n\t\t\t\tplayer1.setY(2);\n\t\t\t\tplayer1.setMap(player1.reachedExit());\n\t\t\t}\n\t\t}\n\t\tcatch(Exception ArrayIndexOutOfBounds){\n\t\t}\n\t}","title":""},{"docid":"29cd249044169a9a9540eb5c880fed93","score":"0.5663132","text":"public void pushDown(int onFloor, int toFloor) {\n\t\tsynchronized (floors[onFloor]) {\n\t\t\tSystem.out.println(\"*** Someone on floor \" + onFloor\n\t\t\t\t\t+ \" wants to go to \" + toFloor);\n\t\t\tfloors[onFloor].downPeople.addElement(new Integer(toFloor));\n\t\t\tif (floors[onFloor].downPeople.size() == 1)\n\t\t\t\tfloors[onFloor].downFlag = false;\n\t\t}\n\t}","title":""},{"docid":"7b2a4013d9c66ba9379df3a4d042957f","score":"0.56614494","text":"private void doorOpening(Hallway hallway) {\n //System.out.println(hallway.toString() + \" Door Opening\");\n\n // Determine if this is a wasted call\n int floor = atFloorState.getFloor();\n // Check for an erroneous door opening and make sure floor is in range\n if (floor == MessageDictionary.NONE) {\n ++wastedOpeningsCount;\n return;\n }\n // Check for car call\n if (carCalls[floor - 1][hallway.ordinal()].pressed())\n return;\n // Check if there was a hall call\n boolean hadCall = false;\n for (Direction d : Direction.replicationValues) {\n if (hallCalls[floor - 1][hallway.ordinal()][d.ordinal()].pressed())\n return;\n }\n // No call, by definition this is a wasted opening\n ++wastedOpeningsCount;\n }","title":""},{"docid":"2a2e0faee540f219b07a0a90f2bc3d08","score":"0.5656461","text":"public void move_up ()\r\n {\r\n redo.setEnabled (false);\r\n //restricting to move through walls and diamonds\r\n if (map [z] [x - 1] [y] != 1 && map [z] [x - 1] [y] != 3)\r\n {\r\n r = M;\r\n x -= 1;\r\n store ();\r\n redraw_1 ();\r\n M++;\r\n r++;\r\n }\r\n \r\n // otherwise, changes the position of the character and diamond\r\n // on the grid and calls the redraw function to display the move \r\n else if (map [z] [x - 1] [y] == 3)\r\n {\r\n if (map [z] [x - 2] [y] != 1 && map [z] [x - 2] [y] != 3)\r\n {\r\n r = M;\r\n x -= 1;\r\n map [z] [x - 1] [y] = 3;\r\n map [z] [x] [y] = underMap [z] [x] [y];\r\n store ();\r\n redraw_1 ();\r\n M++;\r\n r++;\r\n\r\n }\r\n }\r\n }","title":""},{"docid":"0428fb05b522d7202fabaca018796b22","score":"0.5642284","text":"public void moveElevatorTopDown( ElevatorCarTimeBased elevator){\n if (!elevator.isInTransit()){\r\n //if need passengers\r\n if ((elevator.getOccupants().size() < elevator.getCapacity()\r\n && elevator.getFloor() != building.getFloors().get(0)) || elevator.getOccupants().size()==0){\r\n int targetLevel = building.getFloors().size()-1;\r\n while ( building.getFloors().get(targetLevel).getOccupants().isEmpty() && targetLevel >= 0){\r\n targetLevel--;\r\n if (targetLevel == 0) {\r\n break;\r\n }\r\n }\r\n //Go to the highest floor with people on it && load up\r\n if (elevator.getFloor() == building.getFloors().get(targetLevel)){\r\n elevator.loadPassengers(building.getFloors().get(targetLevel).getOccupants());\r\n System.out.println(\"Collecting. Current occupants: \" + elevator.getOccupants().size());\r\n } else {\r\n System.out.println(\"Moving to floor: \" + targetLevel);\r\n elevator.moveToFloor(building.getFloors().get(targetLevel));\r\n }\r\n } else {\r\n if (elevator.getFloor() == building.getFloors().get(0)){\r\n elevator.unloadPassengers(building.getFloors().get(0).getOccupants());\r\n System.out.println(\"Dropping\");\r\n } else {\r\n System.out.println(\"Moving to bottom floor with \" + elevator.getOccupants().size() + \" passengers \");\r\n elevator.moveToFloor(building.getFloors().get(0));\r\n }\r\n }\r\n }\r\n }","title":""},{"docid":"bfcdb2efa5f4effa6b1fe7ac86835722","score":"0.5630137","text":"private void wrapUp() {\r\n for (int j = y; j < y + length; j++) {\r\n if (myWorld[x - 1][j] == Tileset.NOTHING) {\r\n myWorld[x - 1][j] = Tileset.WALL;\r\n }\r\n if (myWorld[x + 1][j] == Tileset.NOTHING) {\r\n myWorld[x + 1][j] = Tileset.WALL;\r\n }\r\n }\r\n for (int i = x - 1; i <= x + 1; i++) {\r\n if (myWorld[i][y + length] == Tileset.NOTHING) {\r\n myWorld[i][y + length] = Tileset.WALL;\r\n }\r\n if (myWorld[i][y - 1] == Tileset.NOTHING) {\r\n myWorld[i][y - 1] = Tileset.WALL;\r\n }\r\n }\r\n }","title":""},{"docid":"f60ac7ad2b4d3158435c1f34e16fcb62","score":"0.56267506","text":"public static void MoveUp() {\n\t\t\n\t\tif (x+1<map[0].length && map[y][x + 1] == 3) {\n\t\t\tRotateTowards(y, x + 1);\n\t\t\tMove(5);\n\t\t\tx++;\n\t\t\tmap[x][y] = 4;\n\t\t} else if (x-1> -1 && map[y][x - 1] == 3) {\n\t\t\tRotateTowards(y, x - 1);\n\t\t\tMove(5);\n\t\t\tx--;\n\t\t\tmap[x][y] = 4;\n\t\t} else if (y+1<map.length && map[y + 1][x] == 3) {\n\t\t\tRotateTowards(y + 1, x);\n\t\t\tMove(5);\n\t\t\ty++;\n\t\t\tmap[x][y] = 4;\n\t\t} else if (y-1> -1 &&map[y - 1][x] == 3) {\n\t\t\tRotateTowards(y - 1, x);\n\t\t\tMove(5);\n\t\t\ty--;\n\t\t\tmap[x][y] = 4;\n\t\t}\n\n\t}","title":""},{"docid":"88418e8ff98a91357672a6861d4b55c4","score":"0.5598393","text":"private void doorReversalEnded(Hallway hallway, Side side) {\n // System.out.println(hallway.toString() + \" \" + side.toString()\n // + \" Door Reversal Ended\");\n }","title":""},{"docid":"add7b7d00f666b7668c476f5f3c8c905","score":"0.5596577","text":"private void createRoom(Position leftBottom, Position rightUp) {\n recordRoom(leftBottom, rightUp);\n int left = leftBottom.x;\n int bottom = leftBottom.y;\n int right = rightUp.x;\n int up = rightUp.y;\n\n for (int i = left; i <= right; i++) {\n for (int j = bottom; j <= up; j++) {\n if (i == left || i == right || j == bottom || j == up) {\n world[i][j] = Tileset.WALL;\n } else {\n world[i][j] = Tileset.FLOOR;\n }\n }\n }\n }","title":""},{"docid":"b2cd387a7566ea73b125a167287cacae","score":"0.5577544","text":"public void moveUP() {\r\n\t\t//flags will keep track of the direction frog is facing and update\r\n\t\tif (!facingUp) { \r\n\t\t\tfacingUp = true;\r\n\t\t\tfacingDown = false;\r\n\t\t\tfacingLeft = false;\r\n\t\t\tfacingRight = false;\r\n\t\t}\r\n\t\t// This will increment progress as player goes further up\r\n\t\tif(progress <= yTrack){\r\n\t\t\tprogress++;\r\n\t\t\tchangeScore(1);\r\n\t\t}\r\n\t\t// This will cap yTrack based upon our array to prevent a HUGE bonus\r\n\t\tif(y > 40)\r\n\t\t\tyTrack++;\r\n\t\t//actual movement of frog. jumpsize depends on y value\r\n\t\tif (y <= 40 + jumpsize)\r\n\t\t\ty = 40;\r\n\t\telse if (y <= 292 )\r\n\t\t\ty -= jumpsize * 2;\r\n\t\telse y -= jumpsize;\r\n\t\tplatformCheck();\r\n\t}","title":""},{"docid":"41f7ecefd1851992a93474ad58078cc8","score":"0.55719244","text":"private void addUp(Board currentBoard) {\n //checking the checking up-left\n Coordinate nextLeft = this.coordinate.getNorth_west();\n if (nextLeft != null) {\n //if north-west is valid tile\n nextLeft = nextLeft.getNorth();\n if (nextLeft != null) {\n //if another north is a valid tile.\n checkForPieces(this.possibleMoves, nextLeft, currentBoard);\n }\n }\n //checking the up-right\n Coordinate nextRight = this.coordinate.getNorth_east();\n if (nextRight != null) {\n //if north-east is a valid tile\n nextRight = nextRight.getNorth();\n if (nextRight != null) {\n //if another north is a valid tile\n checkForPieces(this.possibleMoves, nextRight, currentBoard);\n }\n }\n }","title":""},{"docid":"52accbbe211b7679cf885726b4eba292","score":"0.5568094","text":"public void request(int direction, int userFloor) {\n\t\t/************user requests to go up************/\n\t\tif (direction > 0) {\n\t\t\t/////////////figure out which elevator to use//////\n\t\t\t\n\t\t\t/* both elevators are not in use */\n\t\t\tif (one.getStatus() == 0 && two.getStaus() == 0) {\n\t\t\t\t/* randomly pick e1 or e2, and use that elevator */\n\t\t\t\t//TODO randomly select, and change next line of code\n\t\t\t\tcall(one, userFloor);\n\t\t\t\t\n\t\t\t/* elevator 1 is going up and user's floor is before destination floor*/\t\n\t\t\t} else if (one.getStatus() > 0 && one.getDestination() > userFloor) {\n\t\t\t\t/* use elevator 1, call it to the user's floor */\n\t\t\t\tcall(one, userFloor);\n\t\t\t\t\n\t\t\t/* elevator 2 is going up and user's floor is before destination floor*/\t\n\t\t\t} else if (two.getStatus() > 0 && two.getDestination() > userFloor) {\n\t\t\t\t/* use elevator 2, call it to the user's floor*/\n\t\t\t\tcall(two, userFloor);\n\t\t\t\t\n\t\t\t/* elevator 1 not in use */\t\n\t\t\t} else if (one.getStatus() == 0) {\n\t\t\t\t/* use elevator 1 */\n\t\t\t\tcall(one, userFloor);\n\t\t\t\t\n\t\t\t/* elevator 2 not in use */\t\n\t\t\t} else if (two.getStatus() == 0) {\n\t\t\t\t/* use elevator 2 */\n\t\t\t\tcall(two, userFloor);\n\t\t\t\t\n\t\t\t} else {\n\t\t\t\t/* just use elevator 2 because idk what else to do */\n\t\t\t\tcall(two, userFloor);\n\t\t\t}\n\t\t\t\t\n\t\t/************user requests to go down************/\n\t\t} else {\n\t\t\t/////////////figure out which elevator to use//////\n\t\t\t\n\t\t\t/* both elevators are not in use */\n\t\t\tif (one.getStatus() == 0 && two.getStaus() == 0) {\n\t\t\t\t/* randomly pick e1 or e2, and use that elevator */\n\t\t\t\n\t\t\t/* elevator 1 is going down and user's floor is before destination floor*/\t\n\t\t\t} else if (one.getStatus() < 0 && one.getDestination() < userFloor) {\n\t\t\t\t/* use elevator 1 */\n\t\t\t\tcall(one, userFloor);\n\t\t\t\t\n\t\t\t/* elevator 2 is going down and user's floor is before destination floor*/\t\n\t\t\t} else if (two.getStatus() < 0 && two.getDestination() < userFloor) {\n\t\t\t\t/* use elevator 2 */\n\t\t\t\tcall(two, userFloor);\n\t\t\t\t\n\t\t\t/* elevator 1 not in use */\t\n\t\t\t} else if (one.getStatus() == 0) {\n\t\t\t\t/* use elevator 1 */\n\t\t\t\tcall(one, userFloor);\n\n\t\t\t/* elevator 2 not in use */\t\n\t\t\t} else if (two.getStatus() == 0) {\n\t\t\t\t/* use elevator 2 */\n\t\t\t\tcall(two, userFloor);\n\t\t\t\t\n\t\t\t} else {\n\t\t\t\t/* just use elevator 2 because idk what else to do */\n\t\t\t\tcall(two, userFloor);\n\n\t\t\t}\t\t\n\t\t}\n\n\t}","title":""},{"docid":"decadbb1dcc14354cfb797910ca6de0b","score":"0.5557547","text":"@Test\n public void testActUpDownUp() {\n int idx = 0;\n int level[] = {2,1,3};\n elevator.setDestination(level[idx]);\n idx++;\n do {\n elevator.act();\n// System.out.println(\"L\"+elevator.getCurrentLevel()+\" - \"+elevator.getDirectionState().getClass().getName());\n if(elevator.isInDestination() && idx < level.length) {\n elevator.setDestination(level[idx]);\n idx++;\n }\n } while (!elevator.isWaiting());\n assertEquals(level[idx-1], elevator.getCurrentLevel());\n }","title":""},{"docid":"30ef44f6bd88e2652a7c802f8debe274","score":"0.5548559","text":"void bottomUpApproach() {\r\n \tfor(int i=n/2 - 1; i>=0; i--)\r\n \t\tdownAdjustment(n, i);\r\n }","title":""},{"docid":"30ef44f6bd88e2652a7c802f8debe274","score":"0.5548559","text":"void bottomUpApproach() {\r\n \tfor(int i=n/2 - 1; i>=0; i--)\r\n \t\tdownAdjustment(n, i);\r\n }","title":""},{"docid":"639f2dbccb0a7cc2a8db8361fa8c1cd8","score":"0.55386746","text":"public void flipUp() {\n Side temp = top;\n top = bottom;\n bottom = temp;\n\n }","title":""},{"docid":"fb313db080f1e28e195c176470161c2d","score":"0.54952097","text":"public void setUP(boolean up) {\n\t\tthis.up=up;\n\t}","title":""},{"docid":"0e23e2d1b40d99fb1169d0b3c56eda8f","score":"0.54745","text":"public void paddleUp() {\n\t\tif(coordinates[1] <= 0)\n\t\t\tcoordinates[1] += paddleSpeed; // stops paddle from exiting screen\n\t\tcoordinates[1] -= paddleSpeed;\n\t}","title":""},{"docid":"85d56ad18c2c0f78b0ffaaec6867ee83","score":"0.54722494","text":"public final void levelUP() {\n if (this.isLevelUp()) {\n // contor - va contoriza nr de niveluri pe care li-a atins eroul curent\n int contor = this.level;\n int oneXP = lvlUpConst1 + contor * lvlUpConst2;\n while (oneXP <= this.xp) {\n contor++;\n oneXP = lvlUpConst1 + contor * lvlUpConst2;\n }\n this.level = contor;\n // reactualizam hp si hpMaxim pentru nivelul nou\n this.hp = viataConst + this.level * hpNouConst;\n this.hpMaxim = viataConst + this.level * hpNouConst;\n }\n }","title":""},{"docid":"58a540948a0fcac21e3187b27331e9ab","score":"0.54622304","text":"public void goBottom(){\n _eyeC.X = 3f;\n _eyeC.Y = 3f;\n _eyeC.Z = -3f;\n _lookC.X = -3f;\n _lookC.Y = -2f;\n _lookC.Z = 3f;\n\n _upC.X = 0.0f;\n _upC.Y = 0.5f;\n _upC.Z = 0.0f;\n }","title":""},{"docid":"8cb1bfa22f04aa63e2fe6e46ed27877f","score":"0.5441524","text":"public boolean moveUp() {\n\t\tif (currCell.hasNeighborUp()) {\n\t\t\tprevCell = currCell;\n\t\t\tcurrCell = grid[x][y-1];\n\t\t\treturn true;\n\t\t}\n\t\tSystem.out.println(\"Can't move Up\");\n\t\treturn false;\n\t}","title":""},{"docid":"4cd86d066d6293bbfaaa57b1f3fcab3c","score":"0.5441215","text":"@Test\r\n\t\tpublic void testRoomExit() {\r\n\t\t\t// Take one step, essentially just the adj list\r\n\t\t\tboard.calcTargets(18, 4, 1);\r\n\t\t\tSet<BoardCell> targets = board.getTargets();\r\n\t\t\t// Ensure doesn't exit through the wall\r\n\t\t\tassertEquals(1, targets.size());\r\n\t\t\tassertTrue(targets.contains(board.getCellAt(19, 4)));\r\n\t\t\t// Take two steps\r\n\t\t\tboard.calcTargets(18, 4, 2);\r\n\t\t\ttargets = board.getTargets();\r\n\t\t\tassertEquals(3, targets.size());\r\n\t\t\tassertTrue(targets.contains(board.getCellAt(19, 3)));\r\n\t\t\tassertTrue(targets.contains(board.getCellAt(19, 5)));\r\n\t\t\tassertTrue(targets.contains(board.getCellAt(20, 4)));\r\n\t\t}","title":""},{"docid":"3a9c8f3537e3a00cb008dc43b60bc1ce","score":"0.5433006","text":"public void wallsAndGates(int[][] rooms) {\n int[][] directions = new int[][] {{-1, 0}, {1, 0}, {0, 1}, {0, -1}};\n int row = rooms.length, col = rooms[0].length; \n Queue<int[]> queue = new LinkedList<>();\n for (int i = 0; i < row; i++) {\n for (int j = 0; j < col; j++) {\n if (rooms[i][j] == 0) {\n queue.offer(new int[] {i, j});\n }\n }\n }\n \n while (!queue.isEmpty()) {\n int[] gate = queue.poll();\n int cur_r = gate[0], cur_c = gate[1];\n \n //BFS 4 directions\n for (int[] dir : directions) {\n int next_r = cur_r + dir[0];\n int next_c = cur_c + dir[1];\n if (next_r < 0 || next_r >= row || next_c < 0 || next_c >= col ||\n rooms[next_r][next_c] != Integer.MAX_VALUE) {\n continue;\n }\n rooms[next_r][next_c] = Math.min(rooms[cur_r][cur_c] + 1, rooms[next_r][next_c]);\n queue.offer(new int[] {next_r, next_c});\n \n }\n }\n \n \n }","title":""},{"docid":"a2666fd113e8a9b9fa427b6e97859d29","score":"0.54313934","text":"@Test\n\tpublic void hallwayUpDown() {\n\t\tLinkedList<Integer> testList = newBoard.getAdjList(newBoard.calcIndex(19, 4));\n\t\tAssert.assertEquals(2, testList.size());\n\t\tAssert.assertTrue(testList.contains(newBoard.calcIndex(20, 4)));\n\t\tAssert.assertTrue(testList.contains(newBoard.calcIndex(18, 4)));\n\t}","title":""},{"docid":"4042c829184d2277eedfb791ac9dc101","score":"0.53984386","text":"public boolean checkUp(int floor) {\n\t\tsynchronized (floors[floor]) {\n\t\t\tboolean ret = floors[floor].upPeople.size() != 0;\n\t\t\tret = ret && !floors[floor].upFlag;\n\t\t\treturn ret;\n\t\t}\n\t}","title":""},{"docid":"69b957483f1b81ca18574d15b0f467a3","score":"0.53926593","text":"private static boolean _moveUp() {\n\t\tboolean moved = false;\n\n\t\t// Counterintuitively, we start on top row and \"reach\" down\n\t\tfor (int i = 0; i <= 2; i++) {\n\t\t\tInteger[] pullFrom = grid[i+1];\n\t\t\tInteger[] pullTo = grid[i];\n\n\t\t\tfor (int j = 0; j <= 3; j++) {\n\t\t\t\tif (pullTo[j] == 0 && pullFrom[j] == 0) {\n\t\t\t\t\tcontinue;\n\t\t\t\t} else if (pullTo[j] == 0 && pullFrom[j] != 0) {\n\t\t\t\t\t// Pull unconditionally\n\t\t\t\t\tpullTo[j] = pullFrom[j];\n\t\t\t\t\tpullFrom[j] = 0;\n\t\t\t\t\tmoved = true;\n\t\t\t\t} else if (pullTo[j].equals(pullFrom[j])) {\n\t\t\t\t\t// Add them\n\t\t\t\t\tpullTo[j] += pullFrom[j];\n\t\t\t\t\tpullFrom[j] = 0;\n\t\t\t\t\tmoved = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Keep recursing as long as we moved things\n\t\tif (moved) {\n\t\t\t_moveUp();\n\t\t}\n\n\t\t// See the remarks in the bottom of _moveDown() about the caller\n\t\t// getting `moved`.\n\n\t\treturn moved;\n\t}","title":""},{"docid":"c98ed6dcf02b56fd7e3740e2b70d912e","score":"0.5385396","text":"private void snapToFloor(Wall w) {\n\t\twallUnder = true;\n\t\tsetY(w.getY() - height/2.0f);\n\t}","title":""},{"docid":"d2ef53589c87bf8200abf95e551eff3f","score":"0.5380728","text":"private void goDown() {\r\n for (int i = y; i > y - length; i--) {\r\n myWorld[x][i] = Tileset.FLOOR;\r\n }\r\n\r\n doors[0] = new Door(x, y - length + 1);\r\n if (length < 3) {\r\n doors[1] = null;\r\n } else {\r\n Random random = new Random();\r\n doors[1] = new Door(x, RandomUtils.uniform(random, y - length + 1, y - 1));\r\n }\r\n }","title":""},{"docid":"1846e2f784544a70f93c2baf0fe41733","score":"0.53675663","text":"private void verticalStepUp() {\n\t\tturnLeft();\n\t\tif(frontIsClear()) {\n\t\t\tmove();\n\t\t}\n\t\tturnRight();\n\t}","title":""},{"docid":"acd8d77f132af9dcd036e1d84c55f124","score":"0.5357646","text":"private void moveUp() {\n\t\t\n\t\tint v = nodes.size() -1;\n\t\twhile (v > 0) {\n\t\t\tint p =(v-1)/2;\n\t\t\tT node = nodes.get(v);\n\t\t\tT Parent = nodes.get(p);\n\t\t\t\n\t\t\t\n\t\t\t//compares the two values, moves smaller value up the heap.\n\t\t\t//< minHeap, > maxHeap\n\t\t\tif (node.compareTo(Parent) > 0) {\n\t\t\t\t\n\t\t\t\t//swap\n\t\t\t\tnodes.set(v, Parent);\n\t\t\t\tnodes.set(p, node);\n\t\t\t\t//move up\n\t\t\t\tv = p;\n\t\t\t\t\n\t\t\t} else {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}","title":""},{"docid":"5d6ff8b0abb455159be3002c395978d5","score":"0.5348499","text":"public void ladderUp() {\n\t\tif (onLadder && !isFrozen){\n\t\t\tsetYVel(-walkVel - getXAcc());\n\t\t\t\n\t\t\tif (getXAcc() < 3.0f){\n\t\t\t\tsetXAcc(getXAcc() * 1.2f);\n\t\t\t\tsetClimbing();\n\t\t\t}\n\t\t}\n\t}","title":""},{"docid":"daf06f264aa5e61e287326109fd11a91","score":"0.53363824","text":"public void normalMovement(){\n\t\t\n\t\tBuilding bld = (Building)simState.getAgentByID(buildingID);\n\t\tint x = robot_loc.x;\n\t\tint y = robot_loc.y;\n\t\tif((c_dir==Curr_Direction.Same)){\n\t\t\tif(bld.checkStep(x,y+1)){\n\t\t\t\n\t\t\t if(bld.updateAgentPos(this,x, y+1)){\n\t\t\t\t robot_loc.x = x;\n\t\t\t\t robot_loc.y = y+1;\n\t\t\t\t deadlockedsteps=0;\n\t\t\t }\n\t\t\t else{\n\t\t\t\t deadlockedsteps++;\n\t\t\t }\n\t\t\t \n\t\t\t return;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tc_dir=Curr_Direction.West;\n\t\t\t}\n\t\t}\n\t\t\n\t\t\n\t\t List<Curr_Direction> dirList = Arrays.asList(Curr_Direction.values());\n\t\t TreeSet<Curr_Direction> dirs = new TreeSet<Curr_Direction>(new dirComparator());\n\t\t dirs.addAll(dirList);\n\t\t for (Curr_Direction dir : dirs) {\n\t\t\t \n\t\t\t if(dir == c_dir){\n\t\t\t\t switch(c_dir){\n\t\t\t\t case Same:\n\t\t\t\t case North:\n\t\t\t\t\t if(bld.checkStep(x+1,y)){\n\t\t\t\t\t\t x=x+1;\n\t\t\t\t\t\t c_dir = Curr_Direction.East;\n\t\t\t\t\t\t \n\t\t\t\t\t }\n\t\t\t\t\t else if(bld.checkStep(x,y+1)){\n\t\t\t\t\t\t y=y+1;\n\t\t\t\t\t\t c_dir = Curr_Direction.North;\n\t\t\t\t\t\t \n\t\t\t\t\t }\n\t\t\t\t\t else if(bld.checkStep(x-1,y)){\n\t\t\t\t\t\t \n\t\t\t\t\t\t c_dir = Curr_Direction.West;\n\t\t\t\t\t\t \n\t\t\t\t\t }\n\t\t\t\t\t else if(bld.checkStep(x,y-1)){\n\t\t\t\t\t\t y=y-1;\n\t\t\t\t\t\t c_dir = Curr_Direction.South;\n\t\t\t\t\t\t \n\t\t\t\t\t }\n\t\t\t\t\t break;\n\t\t\t\t case South:\n\t\t\t\t\t \n\t\t\t\t\t if(bld.checkStep(x-1,y)){\n\t\t\t\t\t\t x=x-1;\n\t\t\t\t\t\t c_dir = Curr_Direction.West;\n\t\t\t\t\t\t \n\t\t\t\t\t }\n\t\t\t\t\t else if(bld.checkStep(x,y-1)){\n\t\t\t\t\t\t y=y-1;\n\t\t\t\t\t\t \n\t\t\t\t\t }\n\t\t\t\t\t else if(bld.checkStep(x+1,y)){\n\t\t\t\t\t\t x=x+1;\n\t\t\t\t\t\t c_dir = Curr_Direction.East;\n\t\t\t\t\t\t \n\t\t\t\t\t }\n\t\t\t\t\t else if(bld.checkStep(x,y+1)){\n\t\t\t\t\t\t y=y+1;\n\t\t\t\t\t\t c_dir = Curr_Direction.North;\n\t\t\t\t\t\t \n\t\t\t\t\t }\n\t\t\t\t\t break;\n\t\t\t\t case East:\n\t\t\t\t\t \n\t\t\t\t\t if(bld.checkStep(x,y-1)){\n\t\t\t\t\t\t y=y-1;\n\t\t\t\t\t\t c_dir = Curr_Direction.South;\n\t\t\t\t\t\t \n\t\t\t\t\t }\n\t\t\t\t\t else if(bld.checkStep(x+1,y)){\n\t\t\t\t\t\t x=x+1;\n\t\t\t\t\t\t c_dir = Curr_Direction.East;\n\t\t\t\t\t\t \n\t\t\t\t\t }\n\t\t\t\t\t else if(bld.checkStep(x,y+1)){\n\t\t\t\t\t\t y=y+1;\n\t\t\t\t\t\t c_dir = Curr_Direction.North;\n\t\t\t\t\t\t \n\t\t\t\t\t }\n\t\t\t\t\t else if(bld.checkStep(x-1,y)){\n\t\t\t\t\t\t x=x-1;\n\t\t\t\t\t\t c_dir = Curr_Direction.West;\n\t\t\t\t\t\t \n\t\t\t\t\t }\n\t\t\t\t\t break;\n\t\t\t\t case West:\n\t\t\t\t\t \n\t\t\t\t\t if(bld.checkStep(x,y+1)){\n\t\t\t\t\t\t y=y+1;\n\t\t\t\t\t\t c_dir = Curr_Direction.North;\n\t\t\t\t\t\t \n\t\t\t\t\t }\n\t\t\t\t\t else if(bld.checkStep(x-1,y)){\n\t\t\t\t\t\t x=x-1;\n\t\t\t\t\t\t c_dir = Curr_Direction.West;\n\t\t\t\t\t\t \n\t\t\t\t\t }\n\t\t\t\t\t else if(bld.checkStep(x,y-1)){\n\t\t\t\t\t\t y=y-1;\n\t\t\t\t\t\t c_dir = Curr_Direction.South;\n\t\t\t\t\t\t \n\t\t\t\t\t }\n\t\t\t\t\t else if(bld.checkStep(x+1,y)){\n\t\t\t\t\t\t x=x+1;\n\t\t\t\t\t\t c_dir = Curr_Direction.East;\n\t\t\t\t\t\t \n\t\t\t\t\t }\n\t\t\t\t\t break;\n\t\t\t\t }\n\t\t\t\t break;\n\t\t\t }\n\t\t\t \n\t\t\t \n\t\t \n\t\t }\n\t\t\n\t\t\n\t\t\n\t\t\n\t\tif( bld.updateAgentPos(this,x, y)){\n\t\t\t robot_loc.x = x;\n\t\t\t robot_loc.y = y;\n\t\t\t deadlockedsteps=0;\n\t\t\t //Deepak:uncomment once storage api works\n\t\t\t\t/*simState.storage.updRobotPos(super.getID(), \n\t\t\t robot_loc.x, robot_loc.y);*/\n\t\t}\n\t\telse{\n\t\t\tdeadlockedsteps++;\n\t\t}\n\t\t\n\t}","title":""},{"docid":"490d4a19090644b27cd7d5a8295e1746","score":"0.532473","text":"@Test\n public void testActUpDown() {\n int level1 = 3;\n int level2 = 1;\n elevator.setDestination(level1);\n do {\n elevator.act();\n// System.out.println(\"L\"+elevator.getCurrentLevel()+\" - \"+elevator.getDirectionState().getClass().getName());\n if(elevator.isInDestination()) {\n elevator.setDestination(level2);\n }\n } while (!elevator.isWaiting());\n assertEquals(level2, elevator.getCurrentLevel());\n }","title":""},{"docid":"d4e5d2c9bf83d2c2e15fe27b9b32a286","score":"0.5317799","text":"private void doorOpened(Hallway hallway) {\n //System.out.println(hallway.toString() + \" Door Opened\");\n }","title":""},{"docid":"4af52f184bf93e1eec7da1d6a099b502","score":"0.5310194","text":"public void move(String direction, HashMap<String, Room> rooms) {\n direction = direction.toLowerCase();\n Room current = rooms.get(location_);\n\n String[] temp = current.getNeighbors();\n\n if (direction.equals(\"north\")) { // if direction is north...\n if (!temp[0].equals(\"-\")) { // if there is a room in said direction\n addRoom(location_);\n location_ = temp[0];\n } else {\n System.out.println(\"Sorry, cannot go this way, try again!\");\n System.out.println();\n }\n } else if (direction.equals(\"east\")) { // if direction is east...\n if (temp[1].equals(\"Trap Room\")) {\n addRoom(location_);\n goRandomRoom();\n } else if (!temp[1].equals(\"-\")) { // if there is a room in said direction\n addRoom(location_);\n location_ = temp[1];\n } else {\n System.out.println(\"Sorry, cannot go this way, try again!\");\n System.out.println();\n }\n } else if (direction.equals(\"south\")) { // if direction is south...\n if (!temp[2].equals(\"-\")) { // if there is a room in said direction\n addRoom(location_);\n location_ = temp[2];\n } else {\n System.out.println(\"Sorry, cannot go this way, try again!\");\n System.out.println();\n }\n } else if (direction.equals(\"west\")) { // if direction is west...\n if (temp[3].equals(\"Trap Room\")) {\n addRoom(location_);\n goRandomRoom();\n } else if (!temp[3].equals(\"-\")) { // if there is a room in said direction\n addRoom(location_);\n location_ = temp[3];\n } else {\n System.out.println(\"Sorry, cannot go this way, try again!\");\n System.out.println();\n }\n } else if (direction.equals(\"up\")) { // if direction is up...\n if (temp[4].equals(\"Warehouse\") && !inventory_.containsKey(\"key\")) { // if there is a room in said direction\n System.out.println(\"You need a key to unlock the door\");\n System.out.println();\n } else if (!temp[4].equals(\"-\")) { // if there is a room in said direction\n addRoom(location_);\n location_ = temp[4];\n } else {\n System.out.println(\"Sorry, cannot go this way, try again!\");\n System.out.println();\n }\n } else if (direction.equals(\"down\")) { // if direction is down...\n if (temp[5].equals(\"Basement\") && !inventory_.containsKey(\"key\")) {\n System.out.println(\"You need a key to unlock the door\");\n System.out.println();\n } else if (!temp[5].equals(\"-\")) { // if there is a room in said direction\n addRoom(location_);\n location_ = temp[5];\n } else {\n System.out.println(\"Sorry, cannot go this way, try again!\");\n System.out.println();\n }\n } else { // else\n System.out.println(\"Sorry, not a valid direction, try again!\");\n System.out.println();\n }\n }","title":""},{"docid":"b685d29a1be3a8d2bf6b5a33681a2ee6","score":"0.5303024","text":"public void ensureRobotInArea() {\n float cornerBounce = 1;\n\n if(!detectNotBlack(getLeftColor()) || detectLeftEdge()) {\n if (this.velocity.x < 0) {\n orientation += PI/2;\n this.velocity.x = -velocity.x;\n } else if (this.velocity.x >= 0) {\n orientation += PI/2;\n velocity.x = cornerBounce;\n }\n }\n if(!detectNotBlack(getRightColor()) || detectRightEdge()){\n if (this.velocity.x > 0) {\n orientation += PI/2;\n velocity.x = - velocity.x;\n } else if (this.velocity.x <= 0) {\n orientation += PI/2;\n velocity.x = -cornerBounce;\n }\n }\n if(!detectNotBlack(getUpColor()) || detectTopEdge()){\n if (this.velocity.y < 0) {\n orientation += PI/2;\n velocity.y = - velocity.y;\n } else if (this.velocity.y >= 0) {\n orientation += PI/2;\n velocity.y = cornerBounce;\n }\n }\n if(!detectNotBlack(getDownColor()) || detectBottomEdge()){\n if (this.velocity.y > 0) {\n orientation += PI/2;\n velocity.y = - velocity.y;\n } else if (this.velocity.y <= 0) {\n orientation += PI/2;\n velocity.y = - cornerBounce;\n }\n }\n }","title":""},{"docid":"a52d4175e207b35e4a8635f411e7aa72","score":"0.5299215","text":"public void buildHouse() {\r\n\t\tbuildWalls();\r\n\t\tbuildfloor();\r\n\t\tbuildroof();\r\n\t}","title":""},{"docid":"06f31504b7c285ed650c6232abf03c11","score":"0.52924055","text":"@Test\r\n\t\tpublic void testAdjacencyRoomExit() {\r\n\t\t\t// TEST DOORWAY RIGHT\r\n\t\t\tSet<BoardCell> testList = board.getAdjList(6, 7);\r\n\t\t\tassertEquals(1, testList.size());\r\n\t\t\tassertTrue(testList.contains(board.getCellAt(6, 8)));\r\n\t\t\t// TEST DOORWAY LEFT\r\n\t\t\ttestList = board.getAdjList(16, 22);\r\n\t\t\tassertEquals(1, testList.size());\r\n\t\t\tassertTrue(testList.contains(board.getCellAt(16, 21)));\r\n\t\t\t// TEST DOORWAY DOWN\r\n\t\t\ttestList = board.getAdjList(13, 18);\r\n\t\t\tassertEquals(1, testList.size());\r\n\t\t\tassertTrue(testList.contains(board.getCellAt(14, 18)));\r\n\t\t\t// TEST DOORWAY UP\r\n\t\t\ttestList = board.getAdjList(14, 4);\r\n\t\t\tassertEquals(1, testList.size());\r\n\t\t\tassertTrue(testList.contains(board.getCellAt(13, 4)));\r\n\t\t\t// TEST DOORWAY RIGHT, WHERE THERE'S A WALKWAY above\r\n\t\t\ttestList = board.getAdjList(22, 5);\r\n\t\t\tassertEquals(1, testList.size());\r\n\t\t\tassertTrue(testList.contains(board.getCellAt(22, 6)));\r\n\r\n\t\t}","title":""},{"docid":"dc7f502d5ff04eea4852388cbc4ef229","score":"0.5281419","text":"private void stepUp() {\n\t\tmove();\n\t\tturnLeft();\n\t\tmove();\n\t\tturnRight();\n\t}","title":""},{"docid":"eb21b8d3f9834ca272fc1fe3cb990032","score":"0.527997","text":"public void moveUp() {\n\t\tutils.moveUp();\n\t}","title":""},{"docid":"2419f883e256009a3ee47187257246c6","score":"0.5274279","text":"@Override\n\tpublic void process(Hunter h) {\n\t\t// If the floor is full, the hunter is redirected in a random direction\n\t\tif(isFull) {\n\t\t\th.setDirection(1 + (int)(Math.random()*8));\n\t\t\th.setBypassDirection(0);\n\t\t\t\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tPosition old = h.getPosition();\n\t\t\n\t\th.getCurrentFloor().leave();\n\t\tthis.come(h);\n\t\t\n\t\t// If the hunter was bypassing a wall\n\t\tif(h.getBypassDirection() > 0) {\n\t\t\tif(h.getBypassDirection() == 1 || h.getBypassDirection() == 3) {\n\t\t\t\tif(h.getPosition().getColumn() != old.getColumn()) {\n\t\t\t\t\th.setBypassDirection(0);\n\t\t\t\t}\n\t\t\t}else {\n\t\t\t\tif(h.getPosition().getRow() != old.getRow()) {\n\t\t\t\t\th.setBypassDirection(0);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\t// Redirect the hunter to the best direction to get closer to the treasure\n\t\tPosition treasure_pos = this.getBoard().getTreasure().getPosition();\n\t\th.setDirection(h.getPosition().getBestDirTo(treasure_pos,this.getBoard(),false,h.getBypassDirection()));\n\t\t\n\t}","title":""},{"docid":"97a97ec181a4849075db93b56d1e008e","score":"0.52594453","text":"public void buildIsland(Island island) {\n\t\tint builderIndex = 0; //provides input for switch statement on which direction to check\r\n\t\tfor (int index = 0; index < island.getLandCount(); index++) {//take every land in island, find adjacent lands, add to island\r\n\t\t\twhile (builderIndex < 4) { //while directions havent all been checked...\r\n\t\t\t\tswitch (builderIndex) {\r\n\t\t\t\tcase 0: //check top\r\n\t\t\t\t\tif (island.landArray[index].getYValue() != 0 && mapArray[island.landArray[index].getXValue()][island.landArray[index].getYValue() - 1].getLandType() == 1) { //if its not at the top and land above land at index is a land...\r\n\t\t\t\t\t\tif (!mapArray[island.landArray[index].getXValue()][island.landArray[index].getYValue() - 1].isCounted) {//...and its been counted...\r\n\t\t\t\t\t\t\tisland.addLand(mapArray[island.landArray[index].getXValue()][island.landArray[index].getYValue() - 1]);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t\tbuilderIndex++;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\tcase 1: //check right\r\n\t\t\t\t\tif (island.landArray[index].getXValue() != sizeX - 1 && mapArray[island.landArray[index].getXValue() + 1][island.landArray[index].getYValue()].getLandType() == 1) { //if its not at the far right and land right of land at index is a land...\r\n\t\t\t\t\t\tif (!mapArray[island.landArray[index].getXValue() + 1][island.landArray[index].getYValue()].isCounted) {//...and its been counted...\r\n\t\t\t\t\t\t\tisland.addLand(mapArray[island.landArray[index].getXValue() + 1][island.landArray[index].getYValue()]);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t\tbuilderIndex++;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\tcase 2: //check below\r\n\t\t\t\t\tif (island.landArray[index].getYValue() != sizeY - 1 && mapArray[island.landArray[index].getXValue()][island.landArray[index].getYValue() + 1].getLandType() == 1) { //if its not at the bottom and land below land at index is a land...\r\n\t\t\t\t\t\tif (!mapArray[island.landArray[index].getXValue()][island.landArray[index].getYValue() + 1].isCounted) {//...and its been counted...\r\n\t\t\t\t\t\t\tisland.addLand(mapArray[island.landArray[index].getXValue()][island.landArray[index].getYValue() + 1]);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t\tbuilderIndex++;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\tcase 3: //check left\r\n\t\t\t\t\tif (island.landArray[index].getXValue() != 0 && mapArray[island.landArray[index].getXValue() - 1][island.landArray[index].getYValue()].getLandType() == 1) { //if its not at the far left and land left of land at index is a land...\r\n\t\t\t\t\t\tif (!mapArray[island.landArray[index].getXValue() - 1][island.landArray[index].getYValue()].isCounted) {//...and its been counted...\r\n\t\t\t\t\t\t\tisland.addLand(mapArray[island.landArray[index].getXValue() - 1][island.landArray[index].getYValue()]);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t\tbuilderIndex++;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\tdefault:\r\n\t\t\t\t\tSystem.out.println(\"Something broke in the switch statement for the islandbuilder!\");\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tbuilderIndex = 0;\r\n\t\t}\r\n\t}","title":""},{"docid":"7b20e648bd362643e487a37bdd1512fa","score":"0.5238879","text":"public boolean canGoUp(Zoo z) {\n return (location.getY() - 1 >= 0\n && z.getCell(new Point(location.getX(), location.getY() - 1)) instanceof Road);\n }","title":""},{"docid":"32a16d4e8f77e60a4361b85289fbcfdf","score":"0.5235033","text":"public void up() {\n\t\tupDown = false;\n\t}","title":""},{"docid":"b25c2846ceb397abc3cfc732ff208eeb","score":"0.521952","text":"@Test\n public void testIsOnFloorNotOnFloor() {\n int level = elevator.goUp();\n boolean result = elevator.isOnFloor();\n assertFalse(result);\n assertFalse(level == 0);\n }","title":""},{"docid":"2f5d66d8c5b526ac04ea6fb7ac77ae09","score":"0.52181405","text":"public void upcurseur(){\r\n\t\tpositioncurseur-=1;\r\n\t\tif (menu==0) {\r\n\t\t\tif (positioncurseur<=-1) {\r\n\t\t\t\tpositioncurseur=maxpos-1;\r\n\t\t\t}\r\n\t\t}\r\n\t\telse if (menu==1) {\r\n\t\t\tif (positioncurseur<=-1) {\r\n\t\t\t\tpositioncurseur=maxpos-1;\r\n\t\t\t}\r\n\t\t} else { assert false; }\r\n\t}","title":""},{"docid":"b0429cb5de7de96addb3a949b5cb7ce9","score":"0.5213267","text":"public void climbArmUp() {\n\n climbArmPnumatic.set(Value.kForward);\n climbArmPosition = ClimbArmPosition.UP;\n\n }","title":""},{"docid":"0f697bef3d69332b3eb6869c7fcb7511","score":"0.5212236","text":"public void moveUp(){\n int x = me.getXCor() - 1;\n int y = me.getYCor();\n try{\n\t if (board[x][y] instanceof Passenger){\n\t me.inP(); //increases counter of passengers by 1\n\t }\n\t if (board[x][y] instanceof Terminal){\n\t if(me.getP() != ppl){\n\t\t System.out.println(\"PICK UP THE DARN PASSENGERS\");\n\t\t return;\n\t\t }\n\t gameOver = true; \n\t }\n\t board[x][y] = me;\n\t board[me.getXCor()][me.getYCor()] = \"|___\";\n\t me.setCords(x, y);\n\t me.inM();\n\t }\n catch(ArrayIndexOutOfBoundsException e){\n\t System.out.println(\"You can't move that way!\");\n\t }\n }","title":""},{"docid":"99d9e2f6dea9c2cbe9ce2aa5a97c5d17","score":"0.5206795","text":"private boolean pathOut(HashSet<IndexPoint> checked, int x, int y) {\n IndexPoint pos = new IndexPoint(x, y);\n checked.add(pos);\n if (madeRooms.containsKey(pos)) {\n return ((madeRooms.get(pos).down && !checked.contains(new IndexPoint(x, y - 1))) ? pathOut(checked, x, y - 1) : false) ||\n ((madeRooms.get(pos).up && !checked.contains(new IndexPoint(x, y + 1))) ? pathOut(checked, x, y + 1) : false) ||\n ((madeRooms.get(pos).right && !checked.contains(new IndexPoint(x + 1, y))) ? pathOut(checked, x + 1, y) : false) ||\n ((madeRooms.get(pos).left && !checked.contains(new IndexPoint(x - 1, y))) ? pathOut(checked, x - 1, y) : false);\n } else return true;\n }","title":""},{"docid":"3865892be97ab05c083dd8e449e6fce6","score":"0.5194145","text":"public void zigzig(Node node){ // Move two nodes up along the Outer path\n // Do something\n }","title":""},{"docid":"39ba06ce1520eb51c792dca76c5e5764","score":"0.51918006","text":"private void moveUp() {\n\t\tif(currentAnimation == null)\n\t\t\treturn;\n\t\torientation(Direction.UP);\n\t\tupwardsMovementAnimation.start();\n\t\tcurrentAnimation = upwardsMovementAnimation;\n\t}","title":""},{"docid":"4b86e68849257492759b0696b5d79e65","score":"0.51899153","text":"private void doorClosed(Hallway hallway) {\n //System.out.println(hallway.toString() + \" Door Closed\");\n //once all doors are closed, check to see if the car was overweight\n if (!doorState.anyDoorOpen()) {\n if (wasOverweight) {\n message(\"Overweight\");\n overWeightCount++;\n wasOverweight = false;\n }\n }\n // See if this is the end of a door reversal\n if (doorReversalStopwatch.isRunning() == true\n && doorReversalState.hasReversal() == false) {\n doorReversalStopwatch.stop();\n }\n }","title":""},{"docid":"9f09f76be750653a1ac73cdcd2bbdf24","score":"0.51789355","text":"public void upPressed()\r\n {\r\n if (snake.getDirection()!=Location.SOUTH)\r\n snake.changeDirection(Location.NORTH);\r\n }","title":""},{"docid":"cabf1fa5d46effc87d7cb83f89c6c6ff","score":"0.5177916","text":"@Test\n public void testActUpDestination() {\n elevator.setDestination(2);\n elevator.act();\n elevator.act();\n elevator.act();\n assertEquals(2, elevator.getCurrentLevel());\n assertEquals(elevator.getDirectionStateDestination(), elevator.getDirectionState());\n }","title":""},{"docid":"14ae6167726e0c56b9adb71e7b45742c","score":"0.51777774","text":"public void check_up(Ball b){\n\t\tsetFalse();\n\t\tu=true;\n\t\tif(b.getY()<b.getPosYmax()){\n\t\t\tb.setY(biby.ballSpeed);\n\t\t\tbiby.cam.position.set(b.getX(), b.getY(), 0);\n\t\t\tbiby.cam.update();\n\t\t}else{\n\t\t\tb.setUp(false);\n\t\t\tb.setMoving(false);\n\t\t}\n\t}","title":""},{"docid":"aabd370b7d984344b44a847c83281ead","score":"0.5175059","text":"public boolean ballHitPaddleUpperEdge() {\n\n if (paddle.getSide() == Paddle.LEFT) {\n return ball.getCenterX() <= paddle.getOuterLimit() && ball.getLowerLimit() >= paddle.getUpperLimit() && ball.getLowerLimit() < (paddle.getUpperLimit() + paddle.getHeight() / 2) && ballNotBehindPaddle();\n } else {\n return ball.getCenterX() >= paddle.getOuterLimit() && ball.getLowerLimit() >= paddle.getUpperLimit() && ball.getLowerLimit() < (paddle.getUpperLimit() + paddle.getHeight() / 2) && ballNotBehindPaddle();\n }\n }","title":""},{"docid":"b9bd5981b489a36f4aab4783c76b33b5","score":"0.51726615","text":"public static void exitBooth(Player player) {\n RoomTile tile = player.getRoomUser().getTile();\n Room room = player.getRoomUser().getRoom();\n\n if (tile == null || tile.getHighestItem() == null || room == null) {\n return;\n }\n\n if (!tile.getHighestItem().getDefinition().getSprite().equals(\"poolBooth\")) {\n return;\n }\n\n if (!room.getModel().getName().equals(\"pool_a\") &&\n !room.getModel().getName().equals(\"md_a\")) {\n return;\n }\n\n tile.getHighestItem().showProgram(\"open\");\n player.getRoomUser().setWalkingAllowed(true);\n\n if (room.getData().getModel().equals(\"pool_a\")) {\n if (player.getRoomUser().getPosition().getY() == 11) {\n player.getRoomUser().walkTo(19, 11);\n }\n\n if (player.getRoomUser().getPosition().getY() == 9) {\n player.getRoomUser().walkTo(19, 9);\n }\n }\n\n if (room.getData().getModel().equals(\"md_a\")) {\n if (player.getRoomUser().getPosition().getX() == 8) {\n player.getRoomUser().walkTo(8, 2);\n }\n\n if (player.getRoomUser().getPosition().getX() == 9) {\n player.getRoomUser().walkTo(9, 9);\n }\n }\n }","title":""},{"docid":"66504472d206b14cd8e35c2896200cf9","score":"0.5160994","text":"public void armBottom(){\n downSpike.set(Relay.Value.kOn);\n upSpike.set(Relay.Value.kOff);\n }","title":""},{"docid":"4ede3ed6e24deec5320854a00aaa1fd0","score":"0.5159421","text":"private void moveUp() {\n if (desktop[indexX - 1][indexY] == 3) {\n if (desktop[indexX - 2][indexY] == 0 || desktop[indexX - 2][indexY] == 4){\n desktop[indexX - 1][indexY] = 0;\n desktop[indexX - 2][indexY] = 3;\n }\n }\n\n if (desktop[indexX - 1][indexY] == 0 || desktop[indexX - 1][indexY] == 4) {\n desktop[indexX][indexY] = 0;\n indexX -= 1;\n desktop[indexX][indexY] = 1;\n }\n }","title":""},{"docid":"cc4b542a4cdaf9ba9d8d8b31b06d3f73","score":"0.51591134","text":"void moveUp (int j) {\n\t// TODO\n try{\n int index = getDAncestorIndex(j);\n if(join(index, j)) { //the parent node of the last leaf calling the DAncestor, the last child\n return;\n } else {\n moveUp(index);\n }\n\n }catch(RootE e) {\n// throw new Error();\n }\n }","title":""},{"docid":"a74187b2187efbcbf696355d977211dd","score":"0.5156439","text":"public void moveUp()\r\n\t {\r\n\t moveVertical(-20);\r\n\t }","title":""},{"docid":"c0d0155392c911443d775c0c1f743f1e","score":"0.5145183","text":"public void levelup(){\n\t\tif (gett().equals(\"TankBot\")){ //health and attack power are scaled differently depending on the MiniRobo type \r\n\t\t\tsetmaxhp(getmaxhp()+(8+(level*3))); \r\n\t\t\tsethp(getmaxhp()); //MiniRobos heal up to full upon leveling up\r\n\t\t\tsetp(getp()+(1+(1*level)));\t\t\r\n\t\t}\r\n\t\telse if (gett().equals(\"ShotBot\")){\r\n\t\t\tsetmaxhp(getmaxhp()+ (2+(level*4)));\r\n\t\t\tsethp(getmaxhp());\r\n\t\t\tif (level==1 || level==3){ //ShotBot gains an additional bullet every other level\r\n\t\t\t\tbulletnum+=1;\r\n\t\t\t}\r\n\t\t\tbulletpow+=1;\r\n\t\t\tsetp(bulletpow*bulletnum);\r\n\t\t}\r\n\t\telse if (gett().equals(\"LaserBot\")){\r\n\t\t\tsetmaxhp(getmaxhp()+(2+(level*2)));\r\n\t\t\tsethp(getmaxhp());\r\n\t\t\tsetp(getp()+(6+(1*level)));\r\n\t\t}\r\n\t\tlevel+=1;\r\n\t}","title":""},{"docid":"6a65d30b18a1023c2653b888dcbe9004","score":"0.51434296","text":"public void ensureInArea(){\n\n int cornerBounce = player.playerSize*10;\n\n if(!checkNotBlack(getLeftColor()) || checkLeftEdge()) {\n if (this.velocity.x < 0) {\n this.velocity.x = -this.velocity.x;\n }\n else if (this.velocity.x >= 0) {\n this.velocity.x = cornerBounce;\n }\n }\n if(!checkNotBlack(getRightColor()) || checkRightEdge()){\n if (this.velocity.x > 0) {\n this.velocity.x = -this.velocity.x;\n } else if (this.velocity.x <= 0) {\n this.velocity.x = -cornerBounce;\n }\n }\n if(!checkNotBlack(getUpColor()) || checkTopEdge()){\n if (this.velocity.y < 0) {\n this.velocity.y = -this.velocity.y;\n } else if (this.velocity.y >= 0) {\n this.velocity.y = cornerBounce;\n }\n }\n if(!checkNotBlack(getDownColor()) || checkBottomEdge()){\n if (this.velocity.y > 0) {\n this.velocity.y = -this.velocity.y;\n } else if (this.velocity.y <= 0) {\n this.velocity.y = -cornerBounce;\n }\n }\n }","title":""},{"docid":"e85069493b75cc6fff9881ec828843e5","score":"0.5141904","text":"private void doorClosing(Hallway hallway) {\n //System.out.println(hallway.toString() + \" Door Closing\");\n }","title":""},{"docid":"e6b857a02820cfb7d7712bf55f7b9096","score":"0.5140632","text":"public void moveUp()\n {\n if (this.current.hasParent())\n {\n \n }\n }","title":""},{"docid":"a9c4fd489f57666d0d81656a91e4da0b","score":"0.51374716","text":"private void goRoom(Command command)\n {\n if (!command.hasSecondWord())\n {\n // if there is no second word, we don't know where to go...\n System.out.println(\"Go where?\");\n return;\n }\n\n String direction = command.getSecondWord();\n\n // Try to leave current room.\n Room nextRoom = currentRoom.getExit(direction);\n\n if (nextRoom == null)\n {\n System.out.println(\"There is no door!\");\n }\n else\n {\n currentRoom = nextRoom;\n checkFinish();\n System.out.println(currentRoom.getLongDescription());\n }\n }","title":""},{"docid":"3ca8546a27ecde7a7c8e4ab1c19b30c1","score":"0.51315534","text":"public Cell getCellUp(){\n\t\tCell temp;\n\n\t\tif(currCell.hasNeighborUp()){\n\t\t\ttemp = grid[x][y-1];\n\t\t}\n\t\telse{\n\t\t\ttemp = dummy;\n\t\t}\n\t\treturn temp;\n\t}","title":""},{"docid":"94d9e89be5ec39394751e5f76a3a1589","score":"0.51241773","text":"@Test\n\tpublic void testAdjWalkways() {\n\t\t// Testing walkway at left edge of board, between two room walls\n\t\tSet<BoardCell> testList = board.getAdjList(8, 0);\n\t\tassertTrue(testList.contains(board.getCellAt(8, 1)));\n\t\tassertEquals(1, testList.size());\n\t\t\n\t\t// Testing walkway in middle of walkway\n\t\ttestList = board.getAdjList(13, 6);\n\t\tassertTrue(testList.contains(board.getCellAt(13, 5)));\n\t\tassertTrue(testList.contains(board.getCellAt(13, 7)));\n\t\tassertTrue(testList.contains(board.getCellAt(12, 6)));\n\t\tassertTrue(testList.contains(board.getCellAt(14, 6)));\n\t\tassertEquals(4, testList.size());\n\t\t\n\t\t// Testing walkway on bottom edge of board, next to one room wall\n\t\ttestList = board.getAdjList(20, 7);\n\t\tassertTrue(testList.contains(board.getCellAt(19, 7)));\n\t\tassertTrue(testList.contains(board.getCellAt(20, 6)));\n\t\tassertEquals(2, testList.size());\n\t\t\n\t\t// Testing walkway between two rooms\n\t\ttestList = board.getAdjList(3, 11);\n\t\tassertTrue(testList.contains(board.getCellAt(2, 11)));\n\t\tassertTrue(testList.contains(board.getCellAt(4, 11)));\n\t\tassertEquals(2, testList.size());\n\t\t\n\t\t// Testing walkway on right edge of board, next to two room walls\n\t\ttestList = board.getAdjList(13, 20);\n\t\tassertTrue(testList.contains(board.getCellAt(14, 20)));\n\t\tassertEquals(1, testList.size());\n\t\t\n\t\t// Testing walkway on top edge of board, next to a room wall\n\t\ttestList = board.getAdjList(0, 15);\n\t\tassertTrue(testList.contains(board.getCellAt(0, 16)));\n\t\tassertTrue(testList.contains(board.getCellAt(1, 15)));\n\t\tassertEquals(2, testList.size());\n\t}","title":""},{"docid":"43d7fb5a09e42c28dd44bb9b0c689d51","score":"0.5121772","text":"private void goRoom(Command pCommand){\n gui.println(\"\");\n if(!pCommand.hasSecondWord()) {\n // if there is no second word, we don't know where to go...\n gui.println(\"Go where?\");\n return;\n }\n\n String vDirection = pCommand.getSecondWord();\n\n // Try to leave current room.\n Room nextRoom = aPlayer.getCurrentRoom().getExit(vDirection);\n\n if (nextRoom == null){\n gui.println(\"There is no door!\");\n return ;\n }\n boolean pStack=true;\n if(aPlayer.getCurrentRoom().getDoor(vDirection)!=null){\n if(aPlayer.getCurrentRoom().getDoor(vDirection).isTrapDoor()){\n if(!aPlayer.getCurrentRoom().getDoor(vDirection).canGo()){\n gui.println(\"you can go through this door\\nat least not in this direction!\");\n return;\n }\n if(aPlayer.getCurrentRoom().getDoor(vDirection).canGo()){\n pStack=false;\n aPlayer.getStack().clear();\n } \n }\n else if(aPlayer.getCurrentRoom().getDoor(vDirection).isLocked()){\n if(!aPlayer.getInventory().itemInList(\"key\")){\n gui.println(\"this door is locked, but you open it with your key\");\n aPlayer.getCurrentRoom().getDoor(vDirection).setLocked(false);\n }\n else{\n gui.println(\"this door seems to be locked, you will need a key\");\n return;\n }\n }\n } \n if(pStack)\n aPlayer.getStack().push(aPlayer.getCurrentRoom());\n \n if(aPlayer.getCurrentRoom().isTransportRoom())\n aPlayer.getStack().clear();\n \n aPlayer.setCurrentRoom(nextRoom);\n gui.println(aPlayer.getCurrentRoom().getLongDescription());\n if(aPlayer.getCurrentRoom().getImageName() != null)\n gui.showImage(aPlayer.getCurrentRoom().getImageName()); \n win();\n addAMove();\n }","title":""},{"docid":"686c813f6a0d082498d76c0657ba83af","score":"0.51146954","text":"public void moveUp() {\n move(upSpeed);\n }","title":""},{"docid":"096b84018cb472a895708946c5d65675","score":"0.5107216","text":"public void roomBreaker(){\r\n count = 0;\r\n for (int i = 0; i < n; i++){\r\n for (int j = 0; j < n; j++){\r\n // remove rooms to the left if they're not in set\r\n if (j != 0){\r\n breakLeftWall(count, i, j);\r\n }\r\n // remove rooms to the bottom if they're not in set\r\n if ((i != (n-1)) && ((count+1) != (n*n))){\r\n breakBottomWall(count, i, j);\r\n }\r\n // remove rooms to the right if they're not in set\r\n if ((j != (n-1)) && ((count +1) != (n*n))){\r\n breakRightWall(count, i, j);\r\n }\r\n // remove rooms to the top if they're not in set\r\n if ((i != 0) && ((count +1) != (n*n))){\r\n breakTopWall(count, i, j);\r\n }\r\n count++;\r\n }\r\n }\r\n }","title":""},{"docid":"58a23396cadafccf1a80cf34d73d240b","score":"0.5102398","text":"public void commandS() {\r\n\t\tif (currentRoom.getDoorSouth() == null) {\r\n\t\t\tSystem.out.println(\"BOOM! You walked into a wall because there was no door.\\n\");\r\n\t\t}\r\n\t\telse {\r\n\t\t\tcurrentRoom = currentRoom.getSouthRoom();\r\n\t\t\tSystem.out.println(currentRoom.toString());\r\n\t\t}\r\n\t}","title":""},{"docid":"8680a4274206f863ba9198f15e83b1f7","score":"0.5079963","text":"public boolean isUp() {\n\t\treturn getY() < 0;\n\t}","title":""},{"docid":"a6bf07cceeefd8a0035a358d63ed9ed2","score":"0.5079769","text":"static int bringUpFromDownSide () {\r\n\t\t//returns 0 if is not successfull\r\n\t\t//returns 1 if one corner is already placed correctly\r\n\t\tif (d[0]==WHITE) {\r\n\t\t\tif (f[3]==RED) {\r\n\t\t\t\treturn 1;\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn 0;\r\n\t}","title":""},{"docid":"3974155be8de542c588d9681c4af8ec6","score":"0.5070786","text":"public void putDown() {\n wristSolenoid.set(true);\n }","title":""},{"docid":"107cb2c88c6354b1e45af125009c35bf","score":"0.5064397","text":"private void wrapDown() {\r\n for (int j = y; j > y - length; j--) {\r\n if (myWorld[x - 1][j] == Tileset.NOTHING) {\r\n myWorld[x - 1][j] = Tileset.WALL;\r\n }\r\n if (myWorld[x + 1][j] == Tileset.NOTHING) {\r\n myWorld[x + 1][j] = Tileset.WALL;\r\n }\r\n }\r\n for (int i = x - 1; i <= x + 1; i++) {\r\n if (myWorld[i][y + 1] == Tileset.NOTHING) {\r\n myWorld[i][y + 1] = Tileset.WALL;\r\n }\r\n if (myWorld[i][y - length] == Tileset.NOTHING) {\r\n myWorld[i][y - length] = Tileset.WALL;\r\n }\r\n }\r\n }","title":""},{"docid":"c70428dd171f8c77bcf9b3cb4c85d4b4","score":"0.50563645","text":"public void ElevatorHalf(){\n elevatorLift.setTargetPosition(ELEVATOR_HALF);\n while(elevatorLift.isBusy()){\n //wait for elevator to reach target...\n }\n }","title":""},{"docid":"95c084bc35bcfc629df56cbea5167de0","score":"0.5055286","text":"public void calcAdjCells(Board thisBoard) {\n\t\tif(this.isRoom()) {\n\t\t\treturn;\n\t\t}\n\t\tif(this.isDoorway()) {\n\t\t\tif(this.doorDirection == DoorDirection.RIGHT) {\n\t\t\t\tthis.adjCells.add(this.getDoorNeighbor(thisBoard));\n\t\t\t}else if(this.doorDirection == DoorDirection.LEFT) {\n\t\t\t\tthis.adjCells.add(this.getDoorNeighbor(thisBoard));\n\t\t\t}else if(this.doorDirection == DoorDirection.UP) {\n\t\t\t\tthis.adjCells.add(this.getDoorNeighbor(thisBoard));\n\t\t\t}else if(this.doorDirection == DoorDirection.DOWN) {\n\t\t\t\tthis.adjCells.add(this.getDoorNeighbor(thisBoard));\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\tif(this.row > 0) {\n\t\t\tif(thisBoard.getCellAt(row-1,column).isWalkway()) {\n\t\t\t\tthis.adjCells.add(thisBoard.getCellAt(row-1,column));\n\t\t\t}\n\t\t\tif(thisBoard.getCellAt(row-1,column).isDoorway()) {\n\t\t\t\tif(thisBoard.getCellAt(row-1, column).getDoorNeighbor(thisBoard).equals(this)) {\n\t\t\t\t\tthis.adjCells.add(thisBoard.getCellAt(row-1, column));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(this.column > 0) {\n\t\t\tif(thisBoard.getCellAt(row,column-1).isWalkway()) {\n\t\t\t\tthis.adjCells.add(thisBoard.getCellAt(row,column-1));\n\t\t\t}\n\t\t\tif(thisBoard.getCellAt(row,column-1).isDoorway()) {\n\t\t\t\tif(thisBoard.getCellAt(row, column-1).getDoorNeighbor(thisBoard).equals(this)) {\n\t\t\t\t\tthis.adjCells.add(thisBoard.getCellAt(row, column-1));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(this.row < thisBoard.getNumRows()-1) {\n\t\t\tif(thisBoard.getCellAt(row+1,column).isWalkway()) {\n\t\t\t\tthis.adjCells.add(thisBoard.getCellAt(row+1,column));\n\t\t\t}\n\t\t\tif(thisBoard.getCellAt(row+1,column).isDoorway()) {\n\t\t\t\tif(thisBoard.getCellAt(row+1, column).getDoorNeighbor(thisBoard).equals(this)) {\n\t\t\t\t\tthis.adjCells.add(thisBoard.getCellAt(row+1, column));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(this.column < thisBoard.getNumColumns()-1) {\n\t\t\tif(thisBoard.getCellAt(row,column+1).isWalkway()) {\n\t\t\t\tthis.adjCells.add(thisBoard.getCellAt(row,column+1));\n\t\t\t}\n\t\t\tif(thisBoard.getCellAt(row,column+1).isDoorway()) {\n\t\t\t\tif(thisBoard.getCellAt(row, column+1).getDoorNeighbor(thisBoard).equals(this)) {\n\t\t\t\t\tthis.adjCells.add(thisBoard.getCellAt(row, column+1));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}","title":""},{"docid":"e75a13ce0346b40066f21160b81f2854","score":"0.50527894","text":"private void setDirection(){\n\n// Offroad_GSR Rally = (Offroad_GSR)gameStateRecord;\n client_sb.i_Button = direct;\n\n switch(direct){\n case Offroad_SB.MOVE_LEFT:\n\t groundPosition-=(client_sb.PLAYER_HORIZ_STEP);\n\t skyPosition-=(client_sb.PLAYER_HORIZ_STEP>>1);\n\t\t\t\t break;\n case Offroad_SB.MOVE_RIGHT:\n\t\t\t\t groundPosition+=(client_sb.PLAYER_HORIZ_STEP);\n\t\t\t\t skyPosition+=(client_sb.PLAYER_HORIZ_STEP>>1);\n }\n if (groundPosition>0)groundPosition-=Ground.getWidth();\n else\n if (groundPosition<=-Ground.getWidth())groundPosition+=Ground.getWidth();\n\n if (skyPosition>0)skyPosition-=Sky.getWidth();\n else\n if (skyPosition<-Sky.getWidth())skyPosition+=Sky.getWidth();\n }","title":""},{"docid":"631191761ce6a128e7b55c0facb0dffc","score":"0.50521094","text":"public void goUpALevel() {\n\t\tspiderSpawningInterval -= 30;\n\t\tlevel++;\n\t\tnumStrawberries--;\n\t\ttimerDelay--; \n\tif(level % 3 == 1)\n\t numSpiders++;\n\tif(level % 3 == 2)\n\t numBarriers++;\n\n\t\tinitaliseLevel();\n\t}","title":""},{"docid":"528de4a044ecc688312873ceaafcf980","score":"0.50515443","text":"public void goEast()\r\n\t{\r\n\t\tif(playerPosition<dungeon.length-1)\r\n\t\t{\r\n\t\t\tdungeon[playerPosition].setHasMonster(false);\r\n\t\t\tdungeon[playerPosition].setHasPlayer(false);\r\n\t\t\tdungeon[playerPosition].setHasWeapon(false);\r\n\t\t\tsetPlayerPosition(playerPosition += 1);\r\n\t\t\tdungeon[playerPosition].setHasPlayer(true);\r\n\t\t}//end if\r\n\t}","title":""},{"docid":"67aab9edbfb87fc8133f29f0ea2c09a9","score":"0.5045844","text":"public int goUp(int a, int b) {\n for (int i = LEVEL_ANC - 1; i >= 0; i--) {\n if (!isAncestor(b, binaryRaise[a][i])) {\n a = binaryRaise[a][i];\n }\n// if (binaryRaise[a][i] != 0) {\n// System.out.println(b + \"\\t\" + a + \"\\t\" + binaryRaise[a][i] + \"\\t\" + isAncestor(b, binaryRaise[a][i]));\n// }\n }\n\n return a;\n }","title":""},{"docid":"f6b06dc190e6947a83d6222aec000257","score":"0.5036226","text":"private void teenagerNightAction() {\n\r\n\t\tfor (final Point p : getTownHall().getKnownVillages()) {\r\n\r\n\t\t\tif (getTownHall().getRelationWithVillage(p) > Building.RELATION_EXCELLENT) {\r\n\t\t\t\tfinal Building distantVillage = mw.getBuilding(p);\r\n\r\n\t\t\t\tif (distantVillage != null && distantVillage.culture == getCulture() && distantVillage != getTownHall()) {\r\n\t\t\t\t\tboolean canMoveIn = false;\r\n\r\n\t\t\t\t\tif (MLN.LogChildren >= MLN.MAJOR) {\r\n\t\t\t\t\t\tMLN.major(this, \"Attempting to move to village: \" + distantVillage.getVillageQualifiedName());\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tBuilding distantInn = null;\r\n\t\t\t\t\tfor (final Building distantBuilding : distantVillage.getBuildings()) {\r\n\t\t\t\t\t\tif (!canMoveIn && distantBuilding != null && distantBuilding.isHouse()) {\r\n\t\t\t\t\t\t\tif (distantBuilding.canChildMoveIn(gender, familyName)) {\r\n\t\t\t\t\t\t\t\tcanMoveIn = true;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t} else if (distantInn == null && distantBuilding.isInn) {\r\n\t\t\t\t\t\t\tif (distantBuilding.vrecords.size() < 2) {\r\n\t\t\t\t\t\t\t\tdistantInn = distantBuilding;\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\tif (canMoveIn && distantInn != null) {\r\n\r\n\t\t\t\t\t\tif (MLN.LogChildren >= MLN.MAJOR) {\r\n\t\t\t\t\t\t\tMLN.major(this, \"Moving to village: \" + distantVillage.getVillageQualifiedName());\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\tgetHouse().transferVillager(getHouse().getVillagerRecordById(villager_id), distantInn, false);\r\n\t\t\t\t\t\tdistantInn.visitorsList.add(\"panels.childarrived;\" + getName() + \";\" + getTownHall().getVillageQualifiedName());\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t}\r\n\t}","title":""},{"docid":"7e10a15266a01823634fa39dbc42ce28","score":"0.50359845","text":"private void lvlUp(){\r\n\t\tRandom ran = new Random();\r\n\t\tmaxHealth += (ran.nextInt(6) + 5);\r\n\t\tif(maxHealth > 100){\r\n\t\t\tmaxHealth = 100;\r\n\t\t}\r\n\t\tatt += (ran.nextInt(6) + 5);\r\n\t\tif(att > 100){\r\n\t\t\tatt = 100;\r\n\t\t}\r\n\t\tdef += (ran.nextInt(6) + 5);\r\n\t\tif(def > 100){\r\n\t\t\tdef = 100;\r\n\t\t}\r\n\t\tlv++;\r\n\t}","title":""},{"docid":"49a44aac65a9cc5288573978a2365d96","score":"0.50315326","text":"public void addUPnode(WorldObject object) {\n\t\tthis.up = new Node(object);\n\t}","title":""},{"docid":"2af482eb22ac14cc2467efcdbd951a60","score":"0.5031133","text":"void floatStraightUp() {\n // Move upwards.\n\tif (this.getCoordinateTwo() < -1) { \n this.getTank().getMyLittleFishies().remove(this);\n return;\n\t}\n this.setCoordinateTwo(this.getCoordinateTwo() - 1);\n \n // Figure out whether to grow, if at all.\n double movement = Math.random();\n // Occasionally change a . to a o or a o to a O.\n if (movement < 0.05) {\n if (appearance.equals(\".\")) {\n // If the appearance is a ., change it to an o.\n appearance = \"o\";\n } else if (appearance.equals(\"o\")) {\n // If the appearance is an o, change it to a O.\n appearance = \"O\";\n }\n }\n }","title":""},{"docid":"2fc6a6c22cddaf79ea7899ff3ed6caa3","score":"0.50256664","text":"upperBoundLeaf createupperBoundLeaf();","title":""},{"docid":"78e068c1eae544fde9c8e871bef2bb95","score":"0.5020069","text":"public void move() {\n if (_currentFloor == Floor.FIRST) {\n _directionOfTravel = DirectionOfTravel.UP;\n }\n if (_currentFloor == Floor.SEVENTH) {\n _directionOfTravel = DirectionOfTravel.DOWN;\n }\n\n if (_directionOfTravel == DirectionOfTravel.UP) {\n _currentFloor = _currentFloor.nextFloorUp();\n } else if (_directionOfTravel == DirectionOfTravel.DOWN) {\n _currentFloor = _currentFloor.nextFloorDown();\n }\n\n if(_currentFloor.hasDestinationRequests()){\n stop();\n }\n }","title":""},{"docid":"dc848875d4c0692c1956d0df267b5a2d","score":"0.50196725","text":"public Hallway(int x, int y, int l, int direction, TETile[][] world) {\r\n this.x = x;\r\n this.y = y;\r\n length = l;\r\n myWorld = world;\r\n this.direction = direction;\r\n\r\n switch (direction) {\r\n case UP -> goUp();\r\n case RIGHT -> goRight();\r\n case DOWN -> goDown();\r\n case LEFT -> goLeft();\r\n default -> throw new IllegalArgumentException(\"Illegal direction!\");\r\n }\r\n }","title":""},{"docid":"6fb7fa222b152d8b1a51b055ec8fb91a","score":"0.50166965","text":"@Test\n public void testChooseDirectionAtDeadEnd() {\n \n for (final Terrain t : Terrain.values()) {\n if (t != Terrain.STREET && t != Terrain.CROSSWALK && t != Terrain.LIGHT) {\n \n final Map<Direction, Terrain> neighbors = new HashMap<Direction, Terrain>();\n neighbors.put(Direction.WEST, t);\n neighbors.put(Direction.NORTH, t);\n neighbors.put(Direction.EAST, t);\n neighbors.put(Direction.SOUTH, Terrain.STREET);\n \n final Truck truck = new Truck(0, 0, Direction.NORTH);\n \n // the Truck must reverse and go SOUTH\n assertEquals(\"Truck chooseDirection() failed \"\n + \"when reverse was the only valid choice!\",\n Direction.SOUTH, truck.chooseDirection(neighbors));\n }\n \n }\n }","title":""}],"string":"[\n {\n \"docid\": \"300a346dd21213925e34c8c30cf2acb9\",\n \"score\": \"0.69719136\",\n \"text\": \"private void branchDown(List<Space> list) {\\r\\n if (distToBottom() >= 3) {\\r\\n Random random = new Random(3916274);\\r\\n int bottomExtension;\\r\\n do {\\r\\n bottomExtension = 1 + Math.abs(RandomUtils.geometric(random, 0.3));\\r\\n } while (bottomExtension >= distToBottom());\\r\\n\\r\\n int extensionWidth = 2 + Math.abs(RandomUtils.poisson(random, 2));\\r\\n int start = Math.max(0,\\r\\n RandomUtils.uniform(random, endDoor().X() - extensionWidth, endDoor().X()));\\r\\n int end = start + extensionWidth + 1;\\r\\n if (branchEnable(endDoor(), DOWN, bottomExtension, start, end) &&\\r\\n RandomUtils.bernoulli(random, 1.0 - bottomExtension * 1.0 / distToBottom())) {\\r\\n Room bottomRoom = new Room(start + 1, endDoor().Y() - bottomExtension, extensionWidth, bottomExtension, myWorld);\\r\\n bottomRoom.setDoor(UP, endDoor().X(), endDoor().Y() - 1);\\r\\n list.add(bottomRoom);\\r\\n }\\r\\n }\\r\\n\\r\\n if (hasSideDoor() && distToLeft() >= 3) {\\r\\n Random random = new Random(2643132);\\r\\n int leftExtension;\\r\\n do {\\r\\n leftExtension = 1 + Math.abs(RandomUtils.geometric(random, 0.2));\\r\\n } while (leftExtension >= distToLeft());\\r\\n\\r\\n if (branchEnable(sideDoor(), LEFT, leftExtension, sideDoor().Y() - 1, sideDoor().Y() + 1) &&\\r\\n RandomUtils.bernoulli(random, 1.0 - leftExtension * 1.0 / distToLeft())) {\\r\\n list.add(new Hallway(sideDoor().X() - 1, sideDoor().Y(), leftExtension, LEFT, myWorld));\\r\\n }\\r\\n }\\r\\n\\r\\n if (hasSideDoor() && distToRight() >= 3) {\\r\\n Random random = new Random(5927165);\\r\\n int rightExtension;\\r\\n do {\\r\\n rightExtension = 1 + Math.abs(RandomUtils.geometric(random, 0.2));\\r\\n } while (rightExtension >= distToLeft());\\r\\n\\r\\n if (branchEnable(sideDoor(), RIGHT, rightExtension, sideDoor().Y() - 1, sideDoor().Y() + 1) &&\\r\\n RandomUtils.bernoulli(random, 1.0 - rightExtension * 1.0 / distToRight())) {\\r\\n list.add(new Hallway(sideDoor().X() + 1, sideDoor().Y(), rightExtension, RIGHT, myWorld));\\r\\n }\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"229a5c7d84508723fa49bfbfda7c58d7\",\n \"score\": \"0.6758944\",\n \"text\": \"public void moveElevatorBottomUp ( ElevatorCarTimeBased elevator){\\n if (!elevator.isInTransit()){\\r\\n //if need passengers\\r\\n if ((elevator.getOccupants().size() < elevator.getCapacity()\\r\\n && elevator.getFloor() != building.getFloors().get(0)) || elevator.getOccupants().size()==0){\\r\\n int targetLevel = 1;\\r\\n while (targetLevel < building.getFloors().size() && building.getFloors().get(targetLevel).getOccupants().isEmpty()){\\r\\n targetLevel++;\\r\\n }\\r\\n if (targetLevel >= building.getFloors().size() ){\\r\\n targetLevel=0;\\r\\n }\\r\\n //Go to the highest floor with people on it && load up\\r\\n if (elevator.getFloor() == building.getFloors().get(targetLevel)){\\r\\n elevator.loadPassengers(building.getFloors().get(targetLevel).getOccupants());\\r\\n System.out.println(\\\"Collecting. Current occupants: \\\" + elevator.getOccupants().size());\\r\\n } else {\\r\\n System.out.println(\\\"Moving to floor: \\\" + targetLevel);\\r\\n elevator.moveToFloor(building.getFloors().get(targetLevel));\\r\\n }\\r\\n } else {\\r\\n if (elevator.getFloor() == building.getFloors().get(0)){\\r\\n elevator.unloadPassengers(building.getFloors().get(0).getOccupants());\\r\\n System.out.println(\\\"Dropping\\\");\\r\\n } else {\\r\\n System.out.println(\\\"Moving to bottom floor with \\\" + elevator.getOccupants().size() + \\\" passengers \\\");\\r\\n elevator.moveToFloor(building.getFloors().get(0));\\r\\n }\\r\\n }\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f8ad8d790645a5bfaf21edd21cefe3e5\",\n \"score\": \"0.6343173\",\n \"text\": \"private void goUp() {\\r\\n for (int i = y; i < y + length; i++) {\\r\\n myWorld[x][i] = Tileset.FLOOR;\\r\\n }\\r\\n\\r\\n doors[0] = new Door(x, y + length - 1);\\r\\n if (length < 3) {\\r\\n doors[1] = null;\\r\\n } else {\\r\\n Random random = new Random();\\r\\n doors[1] = new Door(x, RandomUtils.uniform(random, y + 1, y + length - 1));\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc09134fe8165262b9f998d28e11e168\",\n \"score\": \"0.6308608\",\n \"text\": \"private void branchLeft(List<Space> list) {\\r\\n if (distToLeft() >= 3) {\\r\\n Random random = new Random(2749631);\\r\\n int leftExtension;\\r\\n do {\\r\\n leftExtension = 1 + Math.abs(RandomUtils.geometric(random, 0.2));\\r\\n } while (leftExtension >= distToLeft());\\r\\n\\r\\n int extensionHeight = 2 + Math.abs(RandomUtils.poisson(random, 2));\\r\\n int start = Math.max(0,\\r\\n RandomUtils.uniform(random, endDoor().Y() - extensionHeight, endDoor().Y()));\\r\\n int end = start + extensionHeight + 1;\\r\\n if (branchEnable(endDoor(), LEFT, leftExtension, start, end) &&\\r\\n RandomUtils.bernoulli(random, 1.0 - leftExtension * 1.0 / distToLeft())) {\\r\\n Room bottomRoom = new Room(endDoor().X() - leftExtension, start + 1, leftExtension, extensionHeight, myWorld);\\r\\n bottomRoom.setDoor(RIGHT, endDoor().X() - 1, endDoor().Y());\\r\\n list.add(bottomRoom);\\r\\n }\\r\\n }\\r\\n\\r\\n if (hasSideDoor() && distToTop() >= 3) {\\r\\n Random random = new Random(8461375);\\r\\n int topExtension;\\r\\n do {\\r\\n topExtension = 1 + Math.abs(RandomUtils.geometric(random, 0.2));\\r\\n } while (topExtension >= distToTop());\\r\\n\\r\\n if (branchEnable(sideDoor(), UP, topExtension, sideDoor().X() - 1, sideDoor().X() + 1) &&\\r\\n RandomUtils.bernoulli(random, 1.0 - topExtension * 1.0 / distToTop())) {\\r\\n list.add(new Hallway(sideDoor().X(), sideDoor().Y() + 1, topExtension, UP, myWorld));\\r\\n }\\r\\n }\\r\\n\\r\\n if (hasSideDoor() && distToBottom() >= 3) {\\r\\n Random random = new Random(7894561);\\r\\n int bottomExtension;\\r\\n do {\\r\\n bottomExtension = 1 + Math.abs(RandomUtils.geometric(random, 0.2));\\r\\n } while (bottomExtension >= distToBottom());\\r\\n\\r\\n if (branchEnable(sideDoor(), DOWN, bottomExtension, sideDoor().X() - 1, sideDoor().X() + 1) &&\\r\\n RandomUtils.bernoulli(random, 1.0 - bottomExtension * 1.0 / distToBottom())) {\\r\\n list.add(new Hallway(sideDoor().X(), sideDoor().Y() - 1, bottomExtension, DOWN, myWorld));\\r\\n }\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0e6ab2197ee4a96ec38740617de6316b\",\n \"score\": \"0.6124575\",\n \"text\": \"public void goUp(int desiredFloor) {\\n if (doorOpen == false && desiredFloor > currentFloor && desiredFloor <= numberOfFloors) {\\r\\n currentFloor = desiredFloor;\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"232cb22314cdd10c9682c7ddbec3563e\",\n \"score\": \"0.6078508\",\n \"text\": \"private void branchRight(List<Space> list) {\\r\\n if (distToRight() >= 3) {\\r\\n Random random = new Random(69451873);\\r\\n int rightExtension;\\r\\n do {\\r\\n rightExtension = 1 + Math.abs(RandomUtils.geometric(random, 0.2));\\r\\n } while (rightExtension >= distToRight());\\r\\n\\r\\n int extensionHeight = 2 + Math.abs(RandomUtils.poisson(random, 2));\\r\\n int start = Math.max(0,\\r\\n RandomUtils.uniform(random, endDoor().Y() - extensionHeight, endDoor().Y()));\\r\\n int end = start + extensionHeight + 1;\\r\\n if (branchEnable(endDoor(), RIGHT, rightExtension, start, end) &&\\r\\n RandomUtils.bernoulli(random, 1.0 - rightExtension * 1.0 / distToRight())) {\\r\\n Room rightRoom = new Room(endDoor().X() + 1, start + 1, rightExtension, extensionHeight, myWorld);\\r\\n rightRoom.setDoor(LEFT, endDoor().X() + 1, endDoor().Y());\\r\\n list.add(rightRoom);\\r\\n }\\r\\n }\\r\\n\\r\\n if (hasSideDoor() && distToTop() >= 3) {\\r\\n Random random = new Random(8461375);\\r\\n int topExtension;\\r\\n do {\\r\\n topExtension = 1 + Math.abs(RandomUtils.geometric(random, 0.2));\\r\\n } while (topExtension >= distToTop());\\r\\n\\r\\n if (branchEnable(sideDoor(), UP, topExtension, sideDoor().X() - 1, sideDoor().X() + 1) &&\\r\\n RandomUtils.bernoulli(random, 1.0 - topExtension * 1.0 / distToTop())) {\\r\\n list.add(new Hallway(sideDoor().X(), sideDoor().Y() + 1, topExtension, UP, myWorld));\\r\\n }\\r\\n }\\r\\n\\r\\n if (hasSideDoor() && distToBottom() >= 3) {\\r\\n Random random = new Random(7894561);\\r\\n int bottomExtension;\\r\\n do {\\r\\n bottomExtension = 1 + Math.abs(RandomUtils.geometric(random, 0.2));\\r\\n } while (bottomExtension >= distToBottom());\\r\\n\\r\\n if (branchEnable(sideDoor(), DOWN, bottomExtension, sideDoor().X() - 1, sideDoor().X() + 1) &&\\r\\n RandomUtils.bernoulli(random, 1.0 - bottomExtension * 1.0 / distToBottom())) {\\r\\n list.add(new Hallway(sideDoor().X(), sideDoor().Y() - 1, bottomExtension, DOWN, myWorld));\\r\\n }\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2a2020ef3a9a9338e08625ee10cea9b4\",\n \"score\": \"0.6074555\",\n \"text\": \"public void pushUp(int onFloor, int toFloor) {\\n\\t\\tsynchronized (floors[onFloor]) {\\n\\t\\t\\tSystem.out.println(\\\"*** Someone on floor \\\" + onFloor\\n\\t\\t\\t\\t\\t+ \\\" wants to go to \\\" + toFloor);\\n\\t\\t\\tfloors[onFloor].upPeople.addElement(new Integer(toFloor));\\n\\t\\t\\tif (floors[onFloor].upPeople.size() == 1)\\n\\t\\t\\t\\tfloors[onFloor].upFlag = false;\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"476988327d322bfe6616ff83d3a4298b\",\n \"score\": \"0.5934221\",\n \"text\": \"public void putUp() {\\n wristSolenoid.set(false);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"68a2ebec21a3449a8e22960cd6cc6200\",\n \"score\": \"0.5883428\",\n \"text\": \"public void moveUp() {\\n if (currentDirection != direction.down) { // it is not possible to move\\n // in the opposite direction\\n currentDirection = direction.up;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f58109bfbd1a05e314491c93dea8b31f\",\n \"score\": \"0.56877404\",\n \"text\": \"@Override\\r\\n public List<Space> branch() {\\n ArrayList<Space> branches = new ArrayList<>();\\r\\n //Random random = new Random(194623);\\r\\n\\r\\n switch (direction) {\\r\\n case UP -> branchUp(branches);\\r\\n case RIGHT -> branchRight(branches);\\r\\n case DOWN -> branchDown(branches);\\r\\n case LEFT -> branchLeft(branches);\\r\\n default -> throw new IllegalArgumentException(\\\"Illegal direction!\\\");\\r\\n }\\r\\n return branches;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7da8c8a970d7fe3a70009d7c9913c7d8\",\n \"score\": \"0.5685818\",\n \"text\": \"public void isOpenUp(){\\n\\t\\tplayer1.setDirection(\\\"Up\\\");\\n\\t\\ttry {\\n\\t\\t\\tif (this.checkPos(player1.getX(), player1.getY() - 1) == player1.returnOpen()|| this.checkPos(player1.getX(), player1.getY() - 1) == player1.returnExit() ||\\n\\t\\t\\t\\t\\tthis.checkPos(player1.getX(), player1.getY() - 1) == player1.returnPowerUp() || this.checkPos(player1.getX(), player1.getY() - 1) == player1.returnEvidence() ||\\n\\t\\t\\t\\t\\tthis.checkPos(player1.getX(), player1.getY() - 1) == player1.returnFinished()){\\n\\t\\t\\t\\tplayer1.moveUp();\\n\\t\\t\\t\\tthis.setPos();\\n\\t\\t\\t\\tSystem.out.println(\\\"Your position is \\\" + player1.getX() + \\\", \\\" + player1.getY());\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tSystem.out.println(\\\"Cannot go here\\\");\\n\\t\\t\\t}\\n\\t\\t\\tif (this.isDone()) {\\n\\t\\t\\t\\tplayer1.setX(2);\\n\\t\\t\\t\\tplayer1.setY(2);\\n\\t\\t\\t\\tplayer1.setMap(player1.reachedExit());\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcatch(Exception ArrayIndexOutOfBounds){\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"29cd249044169a9a9540eb5c880fed93\",\n \"score\": \"0.5663132\",\n \"text\": \"public void pushDown(int onFloor, int toFloor) {\\n\\t\\tsynchronized (floors[onFloor]) {\\n\\t\\t\\tSystem.out.println(\\\"*** Someone on floor \\\" + onFloor\\n\\t\\t\\t\\t\\t+ \\\" wants to go to \\\" + toFloor);\\n\\t\\t\\tfloors[onFloor].downPeople.addElement(new Integer(toFloor));\\n\\t\\t\\tif (floors[onFloor].downPeople.size() == 1)\\n\\t\\t\\t\\tfloors[onFloor].downFlag = false;\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7b2a4013d9c66ba9379df3a4d042957f\",\n \"score\": \"0.56614494\",\n \"text\": \"private void doorOpening(Hallway hallway) {\\n //System.out.println(hallway.toString() + \\\" Door Opening\\\");\\n\\n // Determine if this is a wasted call\\n int floor = atFloorState.getFloor();\\n // Check for an erroneous door opening and make sure floor is in range\\n if (floor == MessageDictionary.NONE) {\\n ++wastedOpeningsCount;\\n return;\\n }\\n // Check for car call\\n if (carCalls[floor - 1][hallway.ordinal()].pressed())\\n return;\\n // Check if there was a hall call\\n boolean hadCall = false;\\n for (Direction d : Direction.replicationValues) {\\n if (hallCalls[floor - 1][hallway.ordinal()][d.ordinal()].pressed())\\n return;\\n }\\n // No call, by definition this is a wasted opening\\n ++wastedOpeningsCount;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2a2e0faee540f219b07a0a90f2bc3d08\",\n \"score\": \"0.5656461\",\n \"text\": \"public void move_up ()\\r\\n {\\r\\n redo.setEnabled (false);\\r\\n //restricting to move through walls and diamonds\\r\\n if (map [z] [x - 1] [y] != 1 && map [z] [x - 1] [y] != 3)\\r\\n {\\r\\n r = M;\\r\\n x -= 1;\\r\\n store ();\\r\\n redraw_1 ();\\r\\n M++;\\r\\n r++;\\r\\n }\\r\\n \\r\\n // otherwise, changes the position of the character and diamond\\r\\n // on the grid and calls the redraw function to display the move \\r\\n else if (map [z] [x - 1] [y] == 3)\\r\\n {\\r\\n if (map [z] [x - 2] [y] != 1 && map [z] [x - 2] [y] != 3)\\r\\n {\\r\\n r = M;\\r\\n x -= 1;\\r\\n map [z] [x - 1] [y] = 3;\\r\\n map [z] [x] [y] = underMap [z] [x] [y];\\r\\n store ();\\r\\n redraw_1 ();\\r\\n M++;\\r\\n r++;\\r\\n\\r\\n }\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0428fb05b522d7202fabaca018796b22\",\n \"score\": \"0.5642284\",\n \"text\": \"public void moveElevatorTopDown( ElevatorCarTimeBased elevator){\\n if (!elevator.isInTransit()){\\r\\n //if need passengers\\r\\n if ((elevator.getOccupants().size() < elevator.getCapacity()\\r\\n && elevator.getFloor() != building.getFloors().get(0)) || elevator.getOccupants().size()==0){\\r\\n int targetLevel = building.getFloors().size()-1;\\r\\n while ( building.getFloors().get(targetLevel).getOccupants().isEmpty() && targetLevel >= 0){\\r\\n targetLevel--;\\r\\n if (targetLevel == 0) {\\r\\n break;\\r\\n }\\r\\n }\\r\\n //Go to the highest floor with people on it && load up\\r\\n if (elevator.getFloor() == building.getFloors().get(targetLevel)){\\r\\n elevator.loadPassengers(building.getFloors().get(targetLevel).getOccupants());\\r\\n System.out.println(\\\"Collecting. Current occupants: \\\" + elevator.getOccupants().size());\\r\\n } else {\\r\\n System.out.println(\\\"Moving to floor: \\\" + targetLevel);\\r\\n elevator.moveToFloor(building.getFloors().get(targetLevel));\\r\\n }\\r\\n } else {\\r\\n if (elevator.getFloor() == building.getFloors().get(0)){\\r\\n elevator.unloadPassengers(building.getFloors().get(0).getOccupants());\\r\\n System.out.println(\\\"Dropping\\\");\\r\\n } else {\\r\\n System.out.println(\\\"Moving to bottom floor with \\\" + elevator.getOccupants().size() + \\\" passengers \\\");\\r\\n elevator.moveToFloor(building.getFloors().get(0));\\r\\n }\\r\\n }\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bfcdb2efa5f4effa6b1fe7ac86835722\",\n \"score\": \"0.5630137\",\n \"text\": \"private void wrapUp() {\\r\\n for (int j = y; j < y + length; j++) {\\r\\n if (myWorld[x - 1][j] == Tileset.NOTHING) {\\r\\n myWorld[x - 1][j] = Tileset.WALL;\\r\\n }\\r\\n if (myWorld[x + 1][j] == Tileset.NOTHING) {\\r\\n myWorld[x + 1][j] = Tileset.WALL;\\r\\n }\\r\\n }\\r\\n for (int i = x - 1; i <= x + 1; i++) {\\r\\n if (myWorld[i][y + length] == Tileset.NOTHING) {\\r\\n myWorld[i][y + length] = Tileset.WALL;\\r\\n }\\r\\n if (myWorld[i][y - 1] == Tileset.NOTHING) {\\r\\n myWorld[i][y - 1] = Tileset.WALL;\\r\\n }\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f60ac7ad2b4d3158435c1f34e16fcb62\",\n \"score\": \"0.56267506\",\n \"text\": \"public static void MoveUp() {\\n\\t\\t\\n\\t\\tif (x+1<map[0].length && map[y][x + 1] == 3) {\\n\\t\\t\\tRotateTowards(y, x + 1);\\n\\t\\t\\tMove(5);\\n\\t\\t\\tx++;\\n\\t\\t\\tmap[x][y] = 4;\\n\\t\\t} else if (x-1> -1 && map[y][x - 1] == 3) {\\n\\t\\t\\tRotateTowards(y, x - 1);\\n\\t\\t\\tMove(5);\\n\\t\\t\\tx--;\\n\\t\\t\\tmap[x][y] = 4;\\n\\t\\t} else if (y+1<map.length && map[y + 1][x] == 3) {\\n\\t\\t\\tRotateTowards(y + 1, x);\\n\\t\\t\\tMove(5);\\n\\t\\t\\ty++;\\n\\t\\t\\tmap[x][y] = 4;\\n\\t\\t} else if (y-1> -1 &&map[y - 1][x] == 3) {\\n\\t\\t\\tRotateTowards(y - 1, x);\\n\\t\\t\\tMove(5);\\n\\t\\t\\ty--;\\n\\t\\t\\tmap[x][y] = 4;\\n\\t\\t}\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"88418e8ff98a91357672a6861d4b55c4\",\n \"score\": \"0.5598393\",\n \"text\": \"private void doorReversalEnded(Hallway hallway, Side side) {\\n // System.out.println(hallway.toString() + \\\" \\\" + side.toString()\\n // + \\\" Door Reversal Ended\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"add7b7d00f666b7668c476f5f3c8c905\",\n \"score\": \"0.5596577\",\n \"text\": \"private void createRoom(Position leftBottom, Position rightUp) {\\n recordRoom(leftBottom, rightUp);\\n int left = leftBottom.x;\\n int bottom = leftBottom.y;\\n int right = rightUp.x;\\n int up = rightUp.y;\\n\\n for (int i = left; i <= right; i++) {\\n for (int j = bottom; j <= up; j++) {\\n if (i == left || i == right || j == bottom || j == up) {\\n world[i][j] = Tileset.WALL;\\n } else {\\n world[i][j] = Tileset.FLOOR;\\n }\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b2cd387a7566ea73b125a167287cacae\",\n \"score\": \"0.5577544\",\n \"text\": \"public void moveUP() {\\r\\n\\t\\t//flags will keep track of the direction frog is facing and update\\r\\n\\t\\tif (!facingUp) { \\r\\n\\t\\t\\tfacingUp = true;\\r\\n\\t\\t\\tfacingDown = false;\\r\\n\\t\\t\\tfacingLeft = false;\\r\\n\\t\\t\\tfacingRight = false;\\r\\n\\t\\t}\\r\\n\\t\\t// This will increment progress as player goes further up\\r\\n\\t\\tif(progress <= yTrack){\\r\\n\\t\\t\\tprogress++;\\r\\n\\t\\t\\tchangeScore(1);\\r\\n\\t\\t}\\r\\n\\t\\t// This will cap yTrack based upon our array to prevent a HUGE bonus\\r\\n\\t\\tif(y > 40)\\r\\n\\t\\t\\tyTrack++;\\r\\n\\t\\t//actual movement of frog. jumpsize depends on y value\\r\\n\\t\\tif (y <= 40 + jumpsize)\\r\\n\\t\\t\\ty = 40;\\r\\n\\t\\telse if (y <= 292 )\\r\\n\\t\\t\\ty -= jumpsize * 2;\\r\\n\\t\\telse y -= jumpsize;\\r\\n\\t\\tplatformCheck();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"41f7ecefd1851992a93474ad58078cc8\",\n \"score\": \"0.55719244\",\n \"text\": \"private void addUp(Board currentBoard) {\\n //checking the checking up-left\\n Coordinate nextLeft = this.coordinate.getNorth_west();\\n if (nextLeft != null) {\\n //if north-west is valid tile\\n nextLeft = nextLeft.getNorth();\\n if (nextLeft != null) {\\n //if another north is a valid tile.\\n checkForPieces(this.possibleMoves, nextLeft, currentBoard);\\n }\\n }\\n //checking the up-right\\n Coordinate nextRight = this.coordinate.getNorth_east();\\n if (nextRight != null) {\\n //if north-east is a valid tile\\n nextRight = nextRight.getNorth();\\n if (nextRight != null) {\\n //if another north is a valid tile\\n checkForPieces(this.possibleMoves, nextRight, currentBoard);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"52accbbe211b7679cf885726b4eba292\",\n \"score\": \"0.5568094\",\n \"text\": \"public void request(int direction, int userFloor) {\\n\\t\\t/************user requests to go up************/\\n\\t\\tif (direction > 0) {\\n\\t\\t\\t/////////////figure out which elevator to use//////\\n\\t\\t\\t\\n\\t\\t\\t/* both elevators are not in use */\\n\\t\\t\\tif (one.getStatus() == 0 && two.getStaus() == 0) {\\n\\t\\t\\t\\t/* randomly pick e1 or e2, and use that elevator */\\n\\t\\t\\t\\t//TODO randomly select, and change next line of code\\n\\t\\t\\t\\tcall(one, userFloor);\\n\\t\\t\\t\\t\\n\\t\\t\\t/* elevator 1 is going up and user's floor is before destination floor*/\\t\\n\\t\\t\\t} else if (one.getStatus() > 0 && one.getDestination() > userFloor) {\\n\\t\\t\\t\\t/* use elevator 1, call it to the user's floor */\\n\\t\\t\\t\\tcall(one, userFloor);\\n\\t\\t\\t\\t\\n\\t\\t\\t/* elevator 2 is going up and user's floor is before destination floor*/\\t\\n\\t\\t\\t} else if (two.getStatus() > 0 && two.getDestination() > userFloor) {\\n\\t\\t\\t\\t/* use elevator 2, call it to the user's floor*/\\n\\t\\t\\t\\tcall(two, userFloor);\\n\\t\\t\\t\\t\\n\\t\\t\\t/* elevator 1 not in use */\\t\\n\\t\\t\\t} else if (one.getStatus() == 0) {\\n\\t\\t\\t\\t/* use elevator 1 */\\n\\t\\t\\t\\tcall(one, userFloor);\\n\\t\\t\\t\\t\\n\\t\\t\\t/* elevator 2 not in use */\\t\\n\\t\\t\\t} else if (two.getStatus() == 0) {\\n\\t\\t\\t\\t/* use elevator 2 */\\n\\t\\t\\t\\tcall(two, userFloor);\\n\\t\\t\\t\\t\\n\\t\\t\\t} else {\\n\\t\\t\\t\\t/* just use elevator 2 because idk what else to do */\\n\\t\\t\\t\\tcall(two, userFloor);\\n\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t/************user requests to go down************/\\n\\t\\t} else {\\n\\t\\t\\t/////////////figure out which elevator to use//////\\n\\t\\t\\t\\n\\t\\t\\t/* both elevators are not in use */\\n\\t\\t\\tif (one.getStatus() == 0 && two.getStaus() == 0) {\\n\\t\\t\\t\\t/* randomly pick e1 or e2, and use that elevator */\\n\\t\\t\\t\\n\\t\\t\\t/* elevator 1 is going down and user's floor is before destination floor*/\\t\\n\\t\\t\\t} else if (one.getStatus() < 0 && one.getDestination() < userFloor) {\\n\\t\\t\\t\\t/* use elevator 1 */\\n\\t\\t\\t\\tcall(one, userFloor);\\n\\t\\t\\t\\t\\n\\t\\t\\t/* elevator 2 is going down and user's floor is before destination floor*/\\t\\n\\t\\t\\t} else if (two.getStatus() < 0 && two.getDestination() < userFloor) {\\n\\t\\t\\t\\t/* use elevator 2 */\\n\\t\\t\\t\\tcall(two, userFloor);\\n\\t\\t\\t\\t\\n\\t\\t\\t/* elevator 1 not in use */\\t\\n\\t\\t\\t} else if (one.getStatus() == 0) {\\n\\t\\t\\t\\t/* use elevator 1 */\\n\\t\\t\\t\\tcall(one, userFloor);\\n\\n\\t\\t\\t/* elevator 2 not in use */\\t\\n\\t\\t\\t} else if (two.getStatus() == 0) {\\n\\t\\t\\t\\t/* use elevator 2 */\\n\\t\\t\\t\\tcall(two, userFloor);\\n\\t\\t\\t\\t\\n\\t\\t\\t} else {\\n\\t\\t\\t\\t/* just use elevator 2 because idk what else to do */\\n\\t\\t\\t\\tcall(two, userFloor);\\n\\n\\t\\t\\t}\\t\\t\\n\\t\\t}\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"decadbb1dcc14354cfb797910ca6de0b\",\n \"score\": \"0.5557547\",\n \"text\": \"@Test\\n public void testActUpDownUp() {\\n int idx = 0;\\n int level[] = {2,1,3};\\n elevator.setDestination(level[idx]);\\n idx++;\\n do {\\n elevator.act();\\n// System.out.println(\\\"L\\\"+elevator.getCurrentLevel()+\\\" - \\\"+elevator.getDirectionState().getClass().getName());\\n if(elevator.isInDestination() && idx < level.length) {\\n elevator.setDestination(level[idx]);\\n idx++;\\n }\\n } while (!elevator.isWaiting());\\n assertEquals(level[idx-1], elevator.getCurrentLevel());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"30ef44f6bd88e2652a7c802f8debe274\",\n \"score\": \"0.5548559\",\n \"text\": \"void bottomUpApproach() {\\r\\n \\tfor(int i=n/2 - 1; i>=0; i--)\\r\\n \\t\\tdownAdjustment(n, i);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"30ef44f6bd88e2652a7c802f8debe274\",\n \"score\": \"0.5548559\",\n \"text\": \"void bottomUpApproach() {\\r\\n \\tfor(int i=n/2 - 1; i>=0; i--)\\r\\n \\t\\tdownAdjustment(n, i);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"639f2dbccb0a7cc2a8db8361fa8c1cd8\",\n \"score\": \"0.55386746\",\n \"text\": \"public void flipUp() {\\n Side temp = top;\\n top = bottom;\\n bottom = temp;\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fb313db080f1e28e195c176470161c2d\",\n \"score\": \"0.54952097\",\n \"text\": \"public void setUP(boolean up) {\\n\\t\\tthis.up=up;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0e23e2d1b40d99fb1169d0b3c56eda8f\",\n \"score\": \"0.54745\",\n \"text\": \"public void paddleUp() {\\n\\t\\tif(coordinates[1] <= 0)\\n\\t\\t\\tcoordinates[1] += paddleSpeed; // stops paddle from exiting screen\\n\\t\\tcoordinates[1] -= paddleSpeed;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"85d56ad18c2c0f78b0ffaaec6867ee83\",\n \"score\": \"0.54722494\",\n \"text\": \"public final void levelUP() {\\n if (this.isLevelUp()) {\\n // contor - va contoriza nr de niveluri pe care li-a atins eroul curent\\n int contor = this.level;\\n int oneXP = lvlUpConst1 + contor * lvlUpConst2;\\n while (oneXP <= this.xp) {\\n contor++;\\n oneXP = lvlUpConst1 + contor * lvlUpConst2;\\n }\\n this.level = contor;\\n // reactualizam hp si hpMaxim pentru nivelul nou\\n this.hp = viataConst + this.level * hpNouConst;\\n this.hpMaxim = viataConst + this.level * hpNouConst;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"58a540948a0fcac21e3187b27331e9ab\",\n \"score\": \"0.54622304\",\n \"text\": \"public void goBottom(){\\n _eyeC.X = 3f;\\n _eyeC.Y = 3f;\\n _eyeC.Z = -3f;\\n _lookC.X = -3f;\\n _lookC.Y = -2f;\\n _lookC.Z = 3f;\\n\\n _upC.X = 0.0f;\\n _upC.Y = 0.5f;\\n _upC.Z = 0.0f;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8cb1bfa22f04aa63e2fe6e46ed27877f\",\n \"score\": \"0.5441524\",\n \"text\": \"public boolean moveUp() {\\n\\t\\tif (currCell.hasNeighborUp()) {\\n\\t\\t\\tprevCell = currCell;\\n\\t\\t\\tcurrCell = grid[x][y-1];\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t\\tSystem.out.println(\\\"Can't move Up\\\");\\n\\t\\treturn false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4cd86d066d6293bbfaaa57b1f3fcab3c\",\n \"score\": \"0.5441215\",\n \"text\": \"@Test\\r\\n\\t\\tpublic void testRoomExit() {\\r\\n\\t\\t\\t// Take one step, essentially just the adj list\\r\\n\\t\\t\\tboard.calcTargets(18, 4, 1);\\r\\n\\t\\t\\tSet<BoardCell> targets = board.getTargets();\\r\\n\\t\\t\\t// Ensure doesn't exit through the wall\\r\\n\\t\\t\\tassertEquals(1, targets.size());\\r\\n\\t\\t\\tassertTrue(targets.contains(board.getCellAt(19, 4)));\\r\\n\\t\\t\\t// Take two steps\\r\\n\\t\\t\\tboard.calcTargets(18, 4, 2);\\r\\n\\t\\t\\ttargets = board.getTargets();\\r\\n\\t\\t\\tassertEquals(3, targets.size());\\r\\n\\t\\t\\tassertTrue(targets.contains(board.getCellAt(19, 3)));\\r\\n\\t\\t\\tassertTrue(targets.contains(board.getCellAt(19, 5)));\\r\\n\\t\\t\\tassertTrue(targets.contains(board.getCellAt(20, 4)));\\r\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3a9c8f3537e3a00cb008dc43b60bc1ce\",\n \"score\": \"0.5433006\",\n \"text\": \"public void wallsAndGates(int[][] rooms) {\\n int[][] directions = new int[][] {{-1, 0}, {1, 0}, {0, 1}, {0, -1}};\\n int row = rooms.length, col = rooms[0].length; \\n Queue<int[]> queue = new LinkedList<>();\\n for (int i = 0; i < row; i++) {\\n for (int j = 0; j < col; j++) {\\n if (rooms[i][j] == 0) {\\n queue.offer(new int[] {i, j});\\n }\\n }\\n }\\n \\n while (!queue.isEmpty()) {\\n int[] gate = queue.poll();\\n int cur_r = gate[0], cur_c = gate[1];\\n \\n //BFS 4 directions\\n for (int[] dir : directions) {\\n int next_r = cur_r + dir[0];\\n int next_c = cur_c + dir[1];\\n if (next_r < 0 || next_r >= row || next_c < 0 || next_c >= col ||\\n rooms[next_r][next_c] != Integer.MAX_VALUE) {\\n continue;\\n }\\n rooms[next_r][next_c] = Math.min(rooms[cur_r][cur_c] + 1, rooms[next_r][next_c]);\\n queue.offer(new int[] {next_r, next_c});\\n \\n }\\n }\\n \\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a2666fd113e8a9b9fa427b6e97859d29\",\n \"score\": \"0.54313934\",\n \"text\": \"@Test\\n\\tpublic void hallwayUpDown() {\\n\\t\\tLinkedList<Integer> testList = newBoard.getAdjList(newBoard.calcIndex(19, 4));\\n\\t\\tAssert.assertEquals(2, testList.size());\\n\\t\\tAssert.assertTrue(testList.contains(newBoard.calcIndex(20, 4)));\\n\\t\\tAssert.assertTrue(testList.contains(newBoard.calcIndex(18, 4)));\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4042c829184d2277eedfb791ac9dc101\",\n \"score\": \"0.53984386\",\n \"text\": \"public boolean checkUp(int floor) {\\n\\t\\tsynchronized (floors[floor]) {\\n\\t\\t\\tboolean ret = floors[floor].upPeople.size() != 0;\\n\\t\\t\\tret = ret && !floors[floor].upFlag;\\n\\t\\t\\treturn ret;\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"69b957483f1b81ca18574d15b0f467a3\",\n \"score\": \"0.53926593\",\n \"text\": \"private static boolean _moveUp() {\\n\\t\\tboolean moved = false;\\n\\n\\t\\t// Counterintuitively, we start on top row and \\\"reach\\\" down\\n\\t\\tfor (int i = 0; i <= 2; i++) {\\n\\t\\t\\tInteger[] pullFrom = grid[i+1];\\n\\t\\t\\tInteger[] pullTo = grid[i];\\n\\n\\t\\t\\tfor (int j = 0; j <= 3; j++) {\\n\\t\\t\\t\\tif (pullTo[j] == 0 && pullFrom[j] == 0) {\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t} else if (pullTo[j] == 0 && pullFrom[j] != 0) {\\n\\t\\t\\t\\t\\t// Pull unconditionally\\n\\t\\t\\t\\t\\tpullTo[j] = pullFrom[j];\\n\\t\\t\\t\\t\\tpullFrom[j] = 0;\\n\\t\\t\\t\\t\\tmoved = true;\\n\\t\\t\\t\\t} else if (pullTo[j].equals(pullFrom[j])) {\\n\\t\\t\\t\\t\\t// Add them\\n\\t\\t\\t\\t\\tpullTo[j] += pullFrom[j];\\n\\t\\t\\t\\t\\tpullFrom[j] = 0;\\n\\t\\t\\t\\t\\tmoved = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t// Keep recursing as long as we moved things\\n\\t\\tif (moved) {\\n\\t\\t\\t_moveUp();\\n\\t\\t}\\n\\n\\t\\t// See the remarks in the bottom of _moveDown() about the caller\\n\\t\\t// getting `moved`.\\n\\n\\t\\treturn moved;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c98ed6dcf02b56fd7e3740e2b70d912e\",\n \"score\": \"0.5385396\",\n \"text\": \"private void snapToFloor(Wall w) {\\n\\t\\twallUnder = true;\\n\\t\\tsetY(w.getY() - height/2.0f);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d2ef53589c87bf8200abf95e551eff3f\",\n \"score\": \"0.5380728\",\n \"text\": \"private void goDown() {\\r\\n for (int i = y; i > y - length; i--) {\\r\\n myWorld[x][i] = Tileset.FLOOR;\\r\\n }\\r\\n\\r\\n doors[0] = new Door(x, y - length + 1);\\r\\n if (length < 3) {\\r\\n doors[1] = null;\\r\\n } else {\\r\\n Random random = new Random();\\r\\n doors[1] = new Door(x, RandomUtils.uniform(random, y - length + 1, y - 1));\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1846e2f784544a70f93c2baf0fe41733\",\n \"score\": \"0.53675663\",\n \"text\": \"private void verticalStepUp() {\\n\\t\\tturnLeft();\\n\\t\\tif(frontIsClear()) {\\n\\t\\t\\tmove();\\n\\t\\t}\\n\\t\\tturnRight();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"acd8d77f132af9dcd036e1d84c55f124\",\n \"score\": \"0.5357646\",\n \"text\": \"private void moveUp() {\\n\\t\\t\\n\\t\\tint v = nodes.size() -1;\\n\\t\\twhile (v > 0) {\\n\\t\\t\\tint p =(v-1)/2;\\n\\t\\t\\tT node = nodes.get(v);\\n\\t\\t\\tT Parent = nodes.get(p);\\n\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t\\t//compares the two values, moves smaller value up the heap.\\n\\t\\t\\t//< minHeap, > maxHeap\\n\\t\\t\\tif (node.compareTo(Parent) > 0) {\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t//swap\\n\\t\\t\\t\\tnodes.set(v, Parent);\\n\\t\\t\\t\\tnodes.set(p, node);\\n\\t\\t\\t\\t//move up\\n\\t\\t\\t\\tv = p;\\n\\t\\t\\t\\t\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5d6ff8b0abb455159be3002c395978d5\",\n \"score\": \"0.5348499\",\n \"text\": \"public void ladderUp() {\\n\\t\\tif (onLadder && !isFrozen){\\n\\t\\t\\tsetYVel(-walkVel - getXAcc());\\n\\t\\t\\t\\n\\t\\t\\tif (getXAcc() < 3.0f){\\n\\t\\t\\t\\tsetXAcc(getXAcc() * 1.2f);\\n\\t\\t\\t\\tsetClimbing();\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"daf06f264aa5e61e287326109fd11a91\",\n \"score\": \"0.53363824\",\n \"text\": \"public void normalMovement(){\\n\\t\\t\\n\\t\\tBuilding bld = (Building)simState.getAgentByID(buildingID);\\n\\t\\tint x = robot_loc.x;\\n\\t\\tint y = robot_loc.y;\\n\\t\\tif((c_dir==Curr_Direction.Same)){\\n\\t\\t\\tif(bld.checkStep(x,y+1)){\\n\\t\\t\\t\\n\\t\\t\\t if(bld.updateAgentPos(this,x, y+1)){\\n\\t\\t\\t\\t robot_loc.x = x;\\n\\t\\t\\t\\t robot_loc.y = y+1;\\n\\t\\t\\t\\t deadlockedsteps=0;\\n\\t\\t\\t }\\n\\t\\t\\t else{\\n\\t\\t\\t\\t deadlockedsteps++;\\n\\t\\t\\t }\\n\\t\\t\\t \\n\\t\\t\\t return;\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\tc_dir=Curr_Direction.West;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t\\n\\t\\t List<Curr_Direction> dirList = Arrays.asList(Curr_Direction.values());\\n\\t\\t TreeSet<Curr_Direction> dirs = new TreeSet<Curr_Direction>(new dirComparator());\\n\\t\\t dirs.addAll(dirList);\\n\\t\\t for (Curr_Direction dir : dirs) {\\n\\t\\t\\t \\n\\t\\t\\t if(dir == c_dir){\\n\\t\\t\\t\\t switch(c_dir){\\n\\t\\t\\t\\t case Same:\\n\\t\\t\\t\\t case North:\\n\\t\\t\\t\\t\\t if(bld.checkStep(x+1,y)){\\n\\t\\t\\t\\t\\t\\t x=x+1;\\n\\t\\t\\t\\t\\t\\t c_dir = Curr_Direction.East;\\n\\t\\t\\t\\t\\t\\t \\n\\t\\t\\t\\t\\t }\\n\\t\\t\\t\\t\\t else if(bld.checkStep(x,y+1)){\\n\\t\\t\\t\\t\\t\\t y=y+1;\\n\\t\\t\\t\\t\\t\\t c_dir = Curr_Direction.North;\\n\\t\\t\\t\\t\\t\\t \\n\\t\\t\\t\\t\\t }\\n\\t\\t\\t\\t\\t else if(bld.checkStep(x-1,y)){\\n\\t\\t\\t\\t\\t\\t \\n\\t\\t\\t\\t\\t\\t c_dir = Curr_Direction.West;\\n\\t\\t\\t\\t\\t\\t \\n\\t\\t\\t\\t\\t }\\n\\t\\t\\t\\t\\t else if(bld.checkStep(x,y-1)){\\n\\t\\t\\t\\t\\t\\t y=y-1;\\n\\t\\t\\t\\t\\t\\t c_dir = Curr_Direction.South;\\n\\t\\t\\t\\t\\t\\t \\n\\t\\t\\t\\t\\t }\\n\\t\\t\\t\\t\\t break;\\n\\t\\t\\t\\t case South:\\n\\t\\t\\t\\t\\t \\n\\t\\t\\t\\t\\t if(bld.checkStep(x-1,y)){\\n\\t\\t\\t\\t\\t\\t x=x-1;\\n\\t\\t\\t\\t\\t\\t c_dir = Curr_Direction.West;\\n\\t\\t\\t\\t\\t\\t \\n\\t\\t\\t\\t\\t }\\n\\t\\t\\t\\t\\t else if(bld.checkStep(x,y-1)){\\n\\t\\t\\t\\t\\t\\t y=y-1;\\n\\t\\t\\t\\t\\t\\t \\n\\t\\t\\t\\t\\t }\\n\\t\\t\\t\\t\\t else if(bld.checkStep(x+1,y)){\\n\\t\\t\\t\\t\\t\\t x=x+1;\\n\\t\\t\\t\\t\\t\\t c_dir = Curr_Direction.East;\\n\\t\\t\\t\\t\\t\\t \\n\\t\\t\\t\\t\\t }\\n\\t\\t\\t\\t\\t else if(bld.checkStep(x,y+1)){\\n\\t\\t\\t\\t\\t\\t y=y+1;\\n\\t\\t\\t\\t\\t\\t c_dir = Curr_Direction.North;\\n\\t\\t\\t\\t\\t\\t \\n\\t\\t\\t\\t\\t }\\n\\t\\t\\t\\t\\t break;\\n\\t\\t\\t\\t case East:\\n\\t\\t\\t\\t\\t \\n\\t\\t\\t\\t\\t if(bld.checkStep(x,y-1)){\\n\\t\\t\\t\\t\\t\\t y=y-1;\\n\\t\\t\\t\\t\\t\\t c_dir = Curr_Direction.South;\\n\\t\\t\\t\\t\\t\\t \\n\\t\\t\\t\\t\\t }\\n\\t\\t\\t\\t\\t else if(bld.checkStep(x+1,y)){\\n\\t\\t\\t\\t\\t\\t x=x+1;\\n\\t\\t\\t\\t\\t\\t c_dir = Curr_Direction.East;\\n\\t\\t\\t\\t\\t\\t \\n\\t\\t\\t\\t\\t }\\n\\t\\t\\t\\t\\t else if(bld.checkStep(x,y+1)){\\n\\t\\t\\t\\t\\t\\t y=y+1;\\n\\t\\t\\t\\t\\t\\t c_dir = Curr_Direction.North;\\n\\t\\t\\t\\t\\t\\t \\n\\t\\t\\t\\t\\t }\\n\\t\\t\\t\\t\\t else if(bld.checkStep(x-1,y)){\\n\\t\\t\\t\\t\\t\\t x=x-1;\\n\\t\\t\\t\\t\\t\\t c_dir = Curr_Direction.West;\\n\\t\\t\\t\\t\\t\\t \\n\\t\\t\\t\\t\\t }\\n\\t\\t\\t\\t\\t break;\\n\\t\\t\\t\\t case West:\\n\\t\\t\\t\\t\\t \\n\\t\\t\\t\\t\\t if(bld.checkStep(x,y+1)){\\n\\t\\t\\t\\t\\t\\t y=y+1;\\n\\t\\t\\t\\t\\t\\t c_dir = Curr_Direction.North;\\n\\t\\t\\t\\t\\t\\t \\n\\t\\t\\t\\t\\t }\\n\\t\\t\\t\\t\\t else if(bld.checkStep(x-1,y)){\\n\\t\\t\\t\\t\\t\\t x=x-1;\\n\\t\\t\\t\\t\\t\\t c_dir = Curr_Direction.West;\\n\\t\\t\\t\\t\\t\\t \\n\\t\\t\\t\\t\\t }\\n\\t\\t\\t\\t\\t else if(bld.checkStep(x,y-1)){\\n\\t\\t\\t\\t\\t\\t y=y-1;\\n\\t\\t\\t\\t\\t\\t c_dir = Curr_Direction.South;\\n\\t\\t\\t\\t\\t\\t \\n\\t\\t\\t\\t\\t }\\n\\t\\t\\t\\t\\t else if(bld.checkStep(x+1,y)){\\n\\t\\t\\t\\t\\t\\t x=x+1;\\n\\t\\t\\t\\t\\t\\t c_dir = Curr_Direction.East;\\n\\t\\t\\t\\t\\t\\t \\n\\t\\t\\t\\t\\t }\\n\\t\\t\\t\\t\\t break;\\n\\t\\t\\t\\t }\\n\\t\\t\\t\\t break;\\n\\t\\t\\t }\\n\\t\\t\\t \\n\\t\\t\\t \\n\\t\\t \\n\\t\\t }\\n\\t\\t\\n\\t\\t\\n\\t\\t\\n\\t\\t\\n\\t\\tif( bld.updateAgentPos(this,x, y)){\\n\\t\\t\\t robot_loc.x = x;\\n\\t\\t\\t robot_loc.y = y;\\n\\t\\t\\t deadlockedsteps=0;\\n\\t\\t\\t //Deepak:uncomment once storage api works\\n\\t\\t\\t\\t/*simState.storage.updRobotPos(super.getID(), \\n\\t\\t\\t robot_loc.x, robot_loc.y);*/\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tdeadlockedsteps++;\\n\\t\\t}\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"490d4a19090644b27cd7d5a8295e1746\",\n \"score\": \"0.532473\",\n \"text\": \"@Test\\n public void testActUpDown() {\\n int level1 = 3;\\n int level2 = 1;\\n elevator.setDestination(level1);\\n do {\\n elevator.act();\\n// System.out.println(\\\"L\\\"+elevator.getCurrentLevel()+\\\" - \\\"+elevator.getDirectionState().getClass().getName());\\n if(elevator.isInDestination()) {\\n elevator.setDestination(level2);\\n }\\n } while (!elevator.isWaiting());\\n assertEquals(level2, elevator.getCurrentLevel());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d4e5d2c9bf83d2c2e15fe27b9b32a286\",\n \"score\": \"0.5317799\",\n \"text\": \"private void doorOpened(Hallway hallway) {\\n //System.out.println(hallway.toString() + \\\" Door Opened\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4af52f184bf93e1eec7da1d6a099b502\",\n \"score\": \"0.5310194\",\n \"text\": \"public void move(String direction, HashMap<String, Room> rooms) {\\n direction = direction.toLowerCase();\\n Room current = rooms.get(location_);\\n\\n String[] temp = current.getNeighbors();\\n\\n if (direction.equals(\\\"north\\\")) { // if direction is north...\\n if (!temp[0].equals(\\\"-\\\")) { // if there is a room in said direction\\n addRoom(location_);\\n location_ = temp[0];\\n } else {\\n System.out.println(\\\"Sorry, cannot go this way, try again!\\\");\\n System.out.println();\\n }\\n } else if (direction.equals(\\\"east\\\")) { // if direction is east...\\n if (temp[1].equals(\\\"Trap Room\\\")) {\\n addRoom(location_);\\n goRandomRoom();\\n } else if (!temp[1].equals(\\\"-\\\")) { // if there is a room in said direction\\n addRoom(location_);\\n location_ = temp[1];\\n } else {\\n System.out.println(\\\"Sorry, cannot go this way, try again!\\\");\\n System.out.println();\\n }\\n } else if (direction.equals(\\\"south\\\")) { // if direction is south...\\n if (!temp[2].equals(\\\"-\\\")) { // if there is a room in said direction\\n addRoom(location_);\\n location_ = temp[2];\\n } else {\\n System.out.println(\\\"Sorry, cannot go this way, try again!\\\");\\n System.out.println();\\n }\\n } else if (direction.equals(\\\"west\\\")) { // if direction is west...\\n if (temp[3].equals(\\\"Trap Room\\\")) {\\n addRoom(location_);\\n goRandomRoom();\\n } else if (!temp[3].equals(\\\"-\\\")) { // if there is a room in said direction\\n addRoom(location_);\\n location_ = temp[3];\\n } else {\\n System.out.println(\\\"Sorry, cannot go this way, try again!\\\");\\n System.out.println();\\n }\\n } else if (direction.equals(\\\"up\\\")) { // if direction is up...\\n if (temp[4].equals(\\\"Warehouse\\\") && !inventory_.containsKey(\\\"key\\\")) { // if there is a room in said direction\\n System.out.println(\\\"You need a key to unlock the door\\\");\\n System.out.println();\\n } else if (!temp[4].equals(\\\"-\\\")) { // if there is a room in said direction\\n addRoom(location_);\\n location_ = temp[4];\\n } else {\\n System.out.println(\\\"Sorry, cannot go this way, try again!\\\");\\n System.out.println();\\n }\\n } else if (direction.equals(\\\"down\\\")) { // if direction is down...\\n if (temp[5].equals(\\\"Basement\\\") && !inventory_.containsKey(\\\"key\\\")) {\\n System.out.println(\\\"You need a key to unlock the door\\\");\\n System.out.println();\\n } else if (!temp[5].equals(\\\"-\\\")) { // if there is a room in said direction\\n addRoom(location_);\\n location_ = temp[5];\\n } else {\\n System.out.println(\\\"Sorry, cannot go this way, try again!\\\");\\n System.out.println();\\n }\\n } else { // else\\n System.out.println(\\\"Sorry, not a valid direction, try again!\\\");\\n System.out.println();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b685d29a1be3a8d2bf6b5a33681a2ee6\",\n \"score\": \"0.5303024\",\n \"text\": \"public void ensureRobotInArea() {\\n float cornerBounce = 1;\\n\\n if(!detectNotBlack(getLeftColor()) || detectLeftEdge()) {\\n if (this.velocity.x < 0) {\\n orientation += PI/2;\\n this.velocity.x = -velocity.x;\\n } else if (this.velocity.x >= 0) {\\n orientation += PI/2;\\n velocity.x = cornerBounce;\\n }\\n }\\n if(!detectNotBlack(getRightColor()) || detectRightEdge()){\\n if (this.velocity.x > 0) {\\n orientation += PI/2;\\n velocity.x = - velocity.x;\\n } else if (this.velocity.x <= 0) {\\n orientation += PI/2;\\n velocity.x = -cornerBounce;\\n }\\n }\\n if(!detectNotBlack(getUpColor()) || detectTopEdge()){\\n if (this.velocity.y < 0) {\\n orientation += PI/2;\\n velocity.y = - velocity.y;\\n } else if (this.velocity.y >= 0) {\\n orientation += PI/2;\\n velocity.y = cornerBounce;\\n }\\n }\\n if(!detectNotBlack(getDownColor()) || detectBottomEdge()){\\n if (this.velocity.y > 0) {\\n orientation += PI/2;\\n velocity.y = - velocity.y;\\n } else if (this.velocity.y <= 0) {\\n orientation += PI/2;\\n velocity.y = - cornerBounce;\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a52d4175e207b35e4a8635f411e7aa72\",\n \"score\": \"0.5299215\",\n \"text\": \"public void buildHouse() {\\r\\n\\t\\tbuildWalls();\\r\\n\\t\\tbuildfloor();\\r\\n\\t\\tbuildroof();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"06f31504b7c285ed650c6232abf03c11\",\n \"score\": \"0.52924055\",\n \"text\": \"@Test\\r\\n\\t\\tpublic void testAdjacencyRoomExit() {\\r\\n\\t\\t\\t// TEST DOORWAY RIGHT\\r\\n\\t\\t\\tSet<BoardCell> testList = board.getAdjList(6, 7);\\r\\n\\t\\t\\tassertEquals(1, testList.size());\\r\\n\\t\\t\\tassertTrue(testList.contains(board.getCellAt(6, 8)));\\r\\n\\t\\t\\t// TEST DOORWAY LEFT\\r\\n\\t\\t\\ttestList = board.getAdjList(16, 22);\\r\\n\\t\\t\\tassertEquals(1, testList.size());\\r\\n\\t\\t\\tassertTrue(testList.contains(board.getCellAt(16, 21)));\\r\\n\\t\\t\\t// TEST DOORWAY DOWN\\r\\n\\t\\t\\ttestList = board.getAdjList(13, 18);\\r\\n\\t\\t\\tassertEquals(1, testList.size());\\r\\n\\t\\t\\tassertTrue(testList.contains(board.getCellAt(14, 18)));\\r\\n\\t\\t\\t// TEST DOORWAY UP\\r\\n\\t\\t\\ttestList = board.getAdjList(14, 4);\\r\\n\\t\\t\\tassertEquals(1, testList.size());\\r\\n\\t\\t\\tassertTrue(testList.contains(board.getCellAt(13, 4)));\\r\\n\\t\\t\\t// TEST DOORWAY RIGHT, WHERE THERE'S A WALKWAY above\\r\\n\\t\\t\\ttestList = board.getAdjList(22, 5);\\r\\n\\t\\t\\tassertEquals(1, testList.size());\\r\\n\\t\\t\\tassertTrue(testList.contains(board.getCellAt(22, 6)));\\r\\n\\r\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dc7f502d5ff04eea4852388cbc4ef229\",\n \"score\": \"0.5281419\",\n \"text\": \"private void stepUp() {\\n\\t\\tmove();\\n\\t\\tturnLeft();\\n\\t\\tmove();\\n\\t\\tturnRight();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eb21b8d3f9834ca272fc1fe3cb990032\",\n \"score\": \"0.527997\",\n \"text\": \"public void moveUp() {\\n\\t\\tutils.moveUp();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2419f883e256009a3ee47187257246c6\",\n \"score\": \"0.5274279\",\n \"text\": \"@Override\\n\\tpublic void process(Hunter h) {\\n\\t\\t// If the floor is full, the hunter is redirected in a random direction\\n\\t\\tif(isFull) {\\n\\t\\t\\th.setDirection(1 + (int)(Math.random()*8));\\n\\t\\t\\th.setBypassDirection(0);\\n\\t\\t\\t\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\t\\n\\t\\tPosition old = h.getPosition();\\n\\t\\t\\n\\t\\th.getCurrentFloor().leave();\\n\\t\\tthis.come(h);\\n\\t\\t\\n\\t\\t// If the hunter was bypassing a wall\\n\\t\\tif(h.getBypassDirection() > 0) {\\n\\t\\t\\tif(h.getBypassDirection() == 1 || h.getBypassDirection() == 3) {\\n\\t\\t\\t\\tif(h.getPosition().getColumn() != old.getColumn()) {\\n\\t\\t\\t\\t\\th.setBypassDirection(0);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}else {\\n\\t\\t\\t\\tif(h.getPosition().getRow() != old.getRow()) {\\n\\t\\t\\t\\t\\th.setBypassDirection(0);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t// Redirect the hunter to the best direction to get closer to the treasure\\n\\t\\tPosition treasure_pos = this.getBoard().getTreasure().getPosition();\\n\\t\\th.setDirection(h.getPosition().getBestDirTo(treasure_pos,this.getBoard(),false,h.getBypassDirection()));\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"97a97ec181a4849075db93b56d1e008e\",\n \"score\": \"0.52594453\",\n \"text\": \"public void buildIsland(Island island) {\\n\\t\\tint builderIndex = 0; //provides input for switch statement on which direction to check\\r\\n\\t\\tfor (int index = 0; index < island.getLandCount(); index++) {//take every land in island, find adjacent lands, add to island\\r\\n\\t\\t\\twhile (builderIndex < 4) { //while directions havent all been checked...\\r\\n\\t\\t\\t\\tswitch (builderIndex) {\\r\\n\\t\\t\\t\\tcase 0: //check top\\r\\n\\t\\t\\t\\t\\tif (island.landArray[index].getYValue() != 0 && mapArray[island.landArray[index].getXValue()][island.landArray[index].getYValue() - 1].getLandType() == 1) { //if its not at the top and land above land at index is a land...\\r\\n\\t\\t\\t\\t\\t\\tif (!mapArray[island.landArray[index].getXValue()][island.landArray[index].getYValue() - 1].isCounted) {//...and its been counted...\\r\\n\\t\\t\\t\\t\\t\\t\\tisland.addLand(mapArray[island.landArray[index].getXValue()][island.landArray[index].getYValue() - 1]);\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\tbuilderIndex++;\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\tcase 1: //check right\\r\\n\\t\\t\\t\\t\\tif (island.landArray[index].getXValue() != sizeX - 1 && mapArray[island.landArray[index].getXValue() + 1][island.landArray[index].getYValue()].getLandType() == 1) { //if its not at the far right and land right of land at index is a land...\\r\\n\\t\\t\\t\\t\\t\\tif (!mapArray[island.landArray[index].getXValue() + 1][island.landArray[index].getYValue()].isCounted) {//...and its been counted...\\r\\n\\t\\t\\t\\t\\t\\t\\tisland.addLand(mapArray[island.landArray[index].getXValue() + 1][island.landArray[index].getYValue()]);\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\tbuilderIndex++;\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\tcase 2: //check below\\r\\n\\t\\t\\t\\t\\tif (island.landArray[index].getYValue() != sizeY - 1 && mapArray[island.landArray[index].getXValue()][island.landArray[index].getYValue() + 1].getLandType() == 1) { //if its not at the bottom and land below land at index is a land...\\r\\n\\t\\t\\t\\t\\t\\tif (!mapArray[island.landArray[index].getXValue()][island.landArray[index].getYValue() + 1].isCounted) {//...and its been counted...\\r\\n\\t\\t\\t\\t\\t\\t\\tisland.addLand(mapArray[island.landArray[index].getXValue()][island.landArray[index].getYValue() + 1]);\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\tbuilderIndex++;\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\tcase 3: //check left\\r\\n\\t\\t\\t\\t\\tif (island.landArray[index].getXValue() != 0 && mapArray[island.landArray[index].getXValue() - 1][island.landArray[index].getYValue()].getLandType() == 1) { //if its not at the far left and land left of land at index is a land...\\r\\n\\t\\t\\t\\t\\t\\tif (!mapArray[island.landArray[index].getXValue() - 1][island.landArray[index].getYValue()].isCounted) {//...and its been counted...\\r\\n\\t\\t\\t\\t\\t\\t\\tisland.addLand(mapArray[island.landArray[index].getXValue() - 1][island.landArray[index].getYValue()]);\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\tbuilderIndex++;\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\tdefault:\\r\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"Something broke in the switch statement for the islandbuilder!\\\");\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tbuilderIndex = 0;\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7b20e648bd362643e487a37bdd1512fa\",\n \"score\": \"0.5238879\",\n \"text\": \"public boolean canGoUp(Zoo z) {\\n return (location.getY() - 1 >= 0\\n && z.getCell(new Point(location.getX(), location.getY() - 1)) instanceof Road);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"32a16d4e8f77e60a4361b85289fbcfdf\",\n \"score\": \"0.5235033\",\n \"text\": \"public void up() {\\n\\t\\tupDown = false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b25c2846ceb397abc3cfc732ff208eeb\",\n \"score\": \"0.521952\",\n \"text\": \"@Test\\n public void testIsOnFloorNotOnFloor() {\\n int level = elevator.goUp();\\n boolean result = elevator.isOnFloor();\\n assertFalse(result);\\n assertFalse(level == 0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2f5d66d8c5b526ac04ea6fb7ac77ae09\",\n \"score\": \"0.52181405\",\n \"text\": \"public void upcurseur(){\\r\\n\\t\\tpositioncurseur-=1;\\r\\n\\t\\tif (menu==0) {\\r\\n\\t\\t\\tif (positioncurseur<=-1) {\\r\\n\\t\\t\\t\\tpositioncurseur=maxpos-1;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\telse if (menu==1) {\\r\\n\\t\\t\\tif (positioncurseur<=-1) {\\r\\n\\t\\t\\t\\tpositioncurseur=maxpos-1;\\r\\n\\t\\t\\t}\\r\\n\\t\\t} else { assert false; }\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b0429cb5de7de96addb3a949b5cb7ce9\",\n \"score\": \"0.5213267\",\n \"text\": \"public void climbArmUp() {\\n\\n climbArmPnumatic.set(Value.kForward);\\n climbArmPosition = ClimbArmPosition.UP;\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0f697bef3d69332b3eb6869c7fcb7511\",\n \"score\": \"0.5212236\",\n \"text\": \"public void moveUp(){\\n int x = me.getXCor() - 1;\\n int y = me.getYCor();\\n try{\\n\\t if (board[x][y] instanceof Passenger){\\n\\t me.inP(); //increases counter of passengers by 1\\n\\t }\\n\\t if (board[x][y] instanceof Terminal){\\n\\t if(me.getP() != ppl){\\n\\t\\t System.out.println(\\\"PICK UP THE DARN PASSENGERS\\\");\\n\\t\\t return;\\n\\t\\t }\\n\\t gameOver = true; \\n\\t }\\n\\t board[x][y] = me;\\n\\t board[me.getXCor()][me.getYCor()] = \\\"|___\\\";\\n\\t me.setCords(x, y);\\n\\t me.inM();\\n\\t }\\n catch(ArrayIndexOutOfBoundsException e){\\n\\t System.out.println(\\\"You can't move that way!\\\");\\n\\t }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"99d9e2f6dea9c2cbe9ce2aa5a97c5d17\",\n \"score\": \"0.5206795\",\n \"text\": \"private boolean pathOut(HashSet<IndexPoint> checked, int x, int y) {\\n IndexPoint pos = new IndexPoint(x, y);\\n checked.add(pos);\\n if (madeRooms.containsKey(pos)) {\\n return ((madeRooms.get(pos).down && !checked.contains(new IndexPoint(x, y - 1))) ? pathOut(checked, x, y - 1) : false) ||\\n ((madeRooms.get(pos).up && !checked.contains(new IndexPoint(x, y + 1))) ? pathOut(checked, x, y + 1) : false) ||\\n ((madeRooms.get(pos).right && !checked.contains(new IndexPoint(x + 1, y))) ? pathOut(checked, x + 1, y) : false) ||\\n ((madeRooms.get(pos).left && !checked.contains(new IndexPoint(x - 1, y))) ? pathOut(checked, x - 1, y) : false);\\n } else return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3865892be97ab05c083dd8e449e6fce6\",\n \"score\": \"0.5194145\",\n \"text\": \"public void zigzig(Node node){ // Move two nodes up along the Outer path\\n // Do something\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"39ba06ce1520eb51c792dca76c5e5764\",\n \"score\": \"0.51918006\",\n \"text\": \"private void moveUp() {\\n\\t\\tif(currentAnimation == null)\\n\\t\\t\\treturn;\\n\\t\\torientation(Direction.UP);\\n\\t\\tupwardsMovementAnimation.start();\\n\\t\\tcurrentAnimation = upwardsMovementAnimation;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4b86e68849257492759b0696b5d79e65\",\n \"score\": \"0.51899153\",\n \"text\": \"private void doorClosed(Hallway hallway) {\\n //System.out.println(hallway.toString() + \\\" Door Closed\\\");\\n //once all doors are closed, check to see if the car was overweight\\n if (!doorState.anyDoorOpen()) {\\n if (wasOverweight) {\\n message(\\\"Overweight\\\");\\n overWeightCount++;\\n wasOverweight = false;\\n }\\n }\\n // See if this is the end of a door reversal\\n if (doorReversalStopwatch.isRunning() == true\\n && doorReversalState.hasReversal() == false) {\\n doorReversalStopwatch.stop();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9f09f76be750653a1ac73cdcd2bbdf24\",\n \"score\": \"0.51789355\",\n \"text\": \"public void upPressed()\\r\\n {\\r\\n if (snake.getDirection()!=Location.SOUTH)\\r\\n snake.changeDirection(Location.NORTH);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cabf1fa5d46effc87d7cb83f89c6c6ff\",\n \"score\": \"0.5177916\",\n \"text\": \"@Test\\n public void testActUpDestination() {\\n elevator.setDestination(2);\\n elevator.act();\\n elevator.act();\\n elevator.act();\\n assertEquals(2, elevator.getCurrentLevel());\\n assertEquals(elevator.getDirectionStateDestination(), elevator.getDirectionState());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"14ae6167726e0c56b9adb71e7b45742c\",\n \"score\": \"0.51777774\",\n \"text\": \"public void check_up(Ball b){\\n\\t\\tsetFalse();\\n\\t\\tu=true;\\n\\t\\tif(b.getY()<b.getPosYmax()){\\n\\t\\t\\tb.setY(biby.ballSpeed);\\n\\t\\t\\tbiby.cam.position.set(b.getX(), b.getY(), 0);\\n\\t\\t\\tbiby.cam.update();\\n\\t\\t}else{\\n\\t\\t\\tb.setUp(false);\\n\\t\\t\\tb.setMoving(false);\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aabd370b7d984344b44a847c83281ead\",\n \"score\": \"0.5175059\",\n \"text\": \"public boolean ballHitPaddleUpperEdge() {\\n\\n if (paddle.getSide() == Paddle.LEFT) {\\n return ball.getCenterX() <= paddle.getOuterLimit() && ball.getLowerLimit() >= paddle.getUpperLimit() && ball.getLowerLimit() < (paddle.getUpperLimit() + paddle.getHeight() / 2) && ballNotBehindPaddle();\\n } else {\\n return ball.getCenterX() >= paddle.getOuterLimit() && ball.getLowerLimit() >= paddle.getUpperLimit() && ball.getLowerLimit() < (paddle.getUpperLimit() + paddle.getHeight() / 2) && ballNotBehindPaddle();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b9bd5981b489a36f4aab4783c76b33b5\",\n \"score\": \"0.51726615\",\n \"text\": \"public static void exitBooth(Player player) {\\n RoomTile tile = player.getRoomUser().getTile();\\n Room room = player.getRoomUser().getRoom();\\n\\n if (tile == null || tile.getHighestItem() == null || room == null) {\\n return;\\n }\\n\\n if (!tile.getHighestItem().getDefinition().getSprite().equals(\\\"poolBooth\\\")) {\\n return;\\n }\\n\\n if (!room.getModel().getName().equals(\\\"pool_a\\\") &&\\n !room.getModel().getName().equals(\\\"md_a\\\")) {\\n return;\\n }\\n\\n tile.getHighestItem().showProgram(\\\"open\\\");\\n player.getRoomUser().setWalkingAllowed(true);\\n\\n if (room.getData().getModel().equals(\\\"pool_a\\\")) {\\n if (player.getRoomUser().getPosition().getY() == 11) {\\n player.getRoomUser().walkTo(19, 11);\\n }\\n\\n if (player.getRoomUser().getPosition().getY() == 9) {\\n player.getRoomUser().walkTo(19, 9);\\n }\\n }\\n\\n if (room.getData().getModel().equals(\\\"md_a\\\")) {\\n if (player.getRoomUser().getPosition().getX() == 8) {\\n player.getRoomUser().walkTo(8, 2);\\n }\\n\\n if (player.getRoomUser().getPosition().getX() == 9) {\\n player.getRoomUser().walkTo(9, 9);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"66504472d206b14cd8e35c2896200cf9\",\n \"score\": \"0.5160994\",\n \"text\": \"public void armBottom(){\\n downSpike.set(Relay.Value.kOn);\\n upSpike.set(Relay.Value.kOff);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4ede3ed6e24deec5320854a00aaa1fd0\",\n \"score\": \"0.5159421\",\n \"text\": \"private void moveUp() {\\n if (desktop[indexX - 1][indexY] == 3) {\\n if (desktop[indexX - 2][indexY] == 0 || desktop[indexX - 2][indexY] == 4){\\n desktop[indexX - 1][indexY] = 0;\\n desktop[indexX - 2][indexY] = 3;\\n }\\n }\\n\\n if (desktop[indexX - 1][indexY] == 0 || desktop[indexX - 1][indexY] == 4) {\\n desktop[indexX][indexY] = 0;\\n indexX -= 1;\\n desktop[indexX][indexY] = 1;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cc4b542a4cdaf9ba9d8d8b31b06d3f73\",\n \"score\": \"0.51591134\",\n \"text\": \"void moveUp (int j) {\\n\\t// TODO\\n try{\\n int index = getDAncestorIndex(j);\\n if(join(index, j)) { //the parent node of the last leaf calling the DAncestor, the last child\\n return;\\n } else {\\n moveUp(index);\\n }\\n\\n }catch(RootE e) {\\n// throw new Error();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a74187b2187efbcbf696355d977211dd\",\n \"score\": \"0.5156439\",\n \"text\": \"public void moveUp()\\r\\n\\t {\\r\\n\\t moveVertical(-20);\\r\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c0d0155392c911443d775c0c1f743f1e\",\n \"score\": \"0.5145183\",\n \"text\": \"public void levelup(){\\n\\t\\tif (gett().equals(\\\"TankBot\\\")){ //health and attack power are scaled differently depending on the MiniRobo type \\r\\n\\t\\t\\tsetmaxhp(getmaxhp()+(8+(level*3))); \\r\\n\\t\\t\\tsethp(getmaxhp()); //MiniRobos heal up to full upon leveling up\\r\\n\\t\\t\\tsetp(getp()+(1+(1*level)));\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\telse if (gett().equals(\\\"ShotBot\\\")){\\r\\n\\t\\t\\tsetmaxhp(getmaxhp()+ (2+(level*4)));\\r\\n\\t\\t\\tsethp(getmaxhp());\\r\\n\\t\\t\\tif (level==1 || level==3){ //ShotBot gains an additional bullet every other level\\r\\n\\t\\t\\t\\tbulletnum+=1;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tbulletpow+=1;\\r\\n\\t\\t\\tsetp(bulletpow*bulletnum);\\r\\n\\t\\t}\\r\\n\\t\\telse if (gett().equals(\\\"LaserBot\\\")){\\r\\n\\t\\t\\tsetmaxhp(getmaxhp()+(2+(level*2)));\\r\\n\\t\\t\\tsethp(getmaxhp());\\r\\n\\t\\t\\tsetp(getp()+(6+(1*level)));\\r\\n\\t\\t}\\r\\n\\t\\tlevel+=1;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6a65d30b18a1023c2653b888dcbe9004\",\n \"score\": \"0.51434296\",\n \"text\": \"public void ensureInArea(){\\n\\n int cornerBounce = player.playerSize*10;\\n\\n if(!checkNotBlack(getLeftColor()) || checkLeftEdge()) {\\n if (this.velocity.x < 0) {\\n this.velocity.x = -this.velocity.x;\\n }\\n else if (this.velocity.x >= 0) {\\n this.velocity.x = cornerBounce;\\n }\\n }\\n if(!checkNotBlack(getRightColor()) || checkRightEdge()){\\n if (this.velocity.x > 0) {\\n this.velocity.x = -this.velocity.x;\\n } else if (this.velocity.x <= 0) {\\n this.velocity.x = -cornerBounce;\\n }\\n }\\n if(!checkNotBlack(getUpColor()) || checkTopEdge()){\\n if (this.velocity.y < 0) {\\n this.velocity.y = -this.velocity.y;\\n } else if (this.velocity.y >= 0) {\\n this.velocity.y = cornerBounce;\\n }\\n }\\n if(!checkNotBlack(getDownColor()) || checkBottomEdge()){\\n if (this.velocity.y > 0) {\\n this.velocity.y = -this.velocity.y;\\n } else if (this.velocity.y <= 0) {\\n this.velocity.y = -cornerBounce;\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e85069493b75cc6fff9881ec828843e5\",\n \"score\": \"0.5141904\",\n \"text\": \"private void doorClosing(Hallway hallway) {\\n //System.out.println(hallway.toString() + \\\" Door Closing\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6b857a02820cfb7d7712bf55f7b9096\",\n \"score\": \"0.5140632\",\n \"text\": \"public void moveUp()\\n {\\n if (this.current.hasParent())\\n {\\n \\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a9c4fd489f57666d0d81656a91e4da0b\",\n \"score\": \"0.51374716\",\n \"text\": \"private void goRoom(Command command)\\n {\\n if (!command.hasSecondWord())\\n {\\n // if there is no second word, we don't know where to go...\\n System.out.println(\\\"Go where?\\\");\\n return;\\n }\\n\\n String direction = command.getSecondWord();\\n\\n // Try to leave current room.\\n Room nextRoom = currentRoom.getExit(direction);\\n\\n if (nextRoom == null)\\n {\\n System.out.println(\\\"There is no door!\\\");\\n }\\n else\\n {\\n currentRoom = nextRoom;\\n checkFinish();\\n System.out.println(currentRoom.getLongDescription());\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ca8546a27ecde7a7c8e4ab1c19b30c1\",\n \"score\": \"0.51315534\",\n \"text\": \"public Cell getCellUp(){\\n\\t\\tCell temp;\\n\\n\\t\\tif(currCell.hasNeighborUp()){\\n\\t\\t\\ttemp = grid[x][y-1];\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\ttemp = dummy;\\n\\t\\t}\\n\\t\\treturn temp;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"94d9e89be5ec39394751e5f76a3a1589\",\n \"score\": \"0.51241773\",\n \"text\": \"@Test\\n\\tpublic void testAdjWalkways() {\\n\\t\\t// Testing walkway at left edge of board, between two room walls\\n\\t\\tSet<BoardCell> testList = board.getAdjList(8, 0);\\n\\t\\tassertTrue(testList.contains(board.getCellAt(8, 1)));\\n\\t\\tassertEquals(1, testList.size());\\n\\t\\t\\n\\t\\t// Testing walkway in middle of walkway\\n\\t\\ttestList = board.getAdjList(13, 6);\\n\\t\\tassertTrue(testList.contains(board.getCellAt(13, 5)));\\n\\t\\tassertTrue(testList.contains(board.getCellAt(13, 7)));\\n\\t\\tassertTrue(testList.contains(board.getCellAt(12, 6)));\\n\\t\\tassertTrue(testList.contains(board.getCellAt(14, 6)));\\n\\t\\tassertEquals(4, testList.size());\\n\\t\\t\\n\\t\\t// Testing walkway on bottom edge of board, next to one room wall\\n\\t\\ttestList = board.getAdjList(20, 7);\\n\\t\\tassertTrue(testList.contains(board.getCellAt(19, 7)));\\n\\t\\tassertTrue(testList.contains(board.getCellAt(20, 6)));\\n\\t\\tassertEquals(2, testList.size());\\n\\t\\t\\n\\t\\t// Testing walkway between two rooms\\n\\t\\ttestList = board.getAdjList(3, 11);\\n\\t\\tassertTrue(testList.contains(board.getCellAt(2, 11)));\\n\\t\\tassertTrue(testList.contains(board.getCellAt(4, 11)));\\n\\t\\tassertEquals(2, testList.size());\\n\\t\\t\\n\\t\\t// Testing walkway on right edge of board, next to two room walls\\n\\t\\ttestList = board.getAdjList(13, 20);\\n\\t\\tassertTrue(testList.contains(board.getCellAt(14, 20)));\\n\\t\\tassertEquals(1, testList.size());\\n\\t\\t\\n\\t\\t// Testing walkway on top edge of board, next to a room wall\\n\\t\\ttestList = board.getAdjList(0, 15);\\n\\t\\tassertTrue(testList.contains(board.getCellAt(0, 16)));\\n\\t\\tassertTrue(testList.contains(board.getCellAt(1, 15)));\\n\\t\\tassertEquals(2, testList.size());\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"43d7fb5a09e42c28dd44bb9b0c689d51\",\n \"score\": \"0.5121772\",\n \"text\": \"private void goRoom(Command pCommand){\\n gui.println(\\\"\\\");\\n if(!pCommand.hasSecondWord()) {\\n // if there is no second word, we don't know where to go...\\n gui.println(\\\"Go where?\\\");\\n return;\\n }\\n\\n String vDirection = pCommand.getSecondWord();\\n\\n // Try to leave current room.\\n Room nextRoom = aPlayer.getCurrentRoom().getExit(vDirection);\\n\\n if (nextRoom == null){\\n gui.println(\\\"There is no door!\\\");\\n return ;\\n }\\n boolean pStack=true;\\n if(aPlayer.getCurrentRoom().getDoor(vDirection)!=null){\\n if(aPlayer.getCurrentRoom().getDoor(vDirection).isTrapDoor()){\\n if(!aPlayer.getCurrentRoom().getDoor(vDirection).canGo()){\\n gui.println(\\\"you can go through this door\\\\nat least not in this direction!\\\");\\n return;\\n }\\n if(aPlayer.getCurrentRoom().getDoor(vDirection).canGo()){\\n pStack=false;\\n aPlayer.getStack().clear();\\n } \\n }\\n else if(aPlayer.getCurrentRoom().getDoor(vDirection).isLocked()){\\n if(!aPlayer.getInventory().itemInList(\\\"key\\\")){\\n gui.println(\\\"this door is locked, but you open it with your key\\\");\\n aPlayer.getCurrentRoom().getDoor(vDirection).setLocked(false);\\n }\\n else{\\n gui.println(\\\"this door seems to be locked, you will need a key\\\");\\n return;\\n }\\n }\\n } \\n if(pStack)\\n aPlayer.getStack().push(aPlayer.getCurrentRoom());\\n \\n if(aPlayer.getCurrentRoom().isTransportRoom())\\n aPlayer.getStack().clear();\\n \\n aPlayer.setCurrentRoom(nextRoom);\\n gui.println(aPlayer.getCurrentRoom().getLongDescription());\\n if(aPlayer.getCurrentRoom().getImageName() != null)\\n gui.showImage(aPlayer.getCurrentRoom().getImageName()); \\n win();\\n addAMove();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"686c813f6a0d082498d76c0657ba83af\",\n \"score\": \"0.51146954\",\n \"text\": \"public void moveUp() {\\n move(upSpeed);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"096b84018cb472a895708946c5d65675\",\n \"score\": \"0.5107216\",\n \"text\": \"public void roomBreaker(){\\r\\n count = 0;\\r\\n for (int i = 0; i < n; i++){\\r\\n for (int j = 0; j < n; j++){\\r\\n // remove rooms to the left if they're not in set\\r\\n if (j != 0){\\r\\n breakLeftWall(count, i, j);\\r\\n }\\r\\n // remove rooms to the bottom if they're not in set\\r\\n if ((i != (n-1)) && ((count+1) != (n*n))){\\r\\n breakBottomWall(count, i, j);\\r\\n }\\r\\n // remove rooms to the right if they're not in set\\r\\n if ((j != (n-1)) && ((count +1) != (n*n))){\\r\\n breakRightWall(count, i, j);\\r\\n }\\r\\n // remove rooms to the top if they're not in set\\r\\n if ((i != 0) && ((count +1) != (n*n))){\\r\\n breakTopWall(count, i, j);\\r\\n }\\r\\n count++;\\r\\n }\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"58a23396cadafccf1a80cf34d73d240b\",\n \"score\": \"0.5102398\",\n \"text\": \"public void commandS() {\\r\\n\\t\\tif (currentRoom.getDoorSouth() == null) {\\r\\n\\t\\t\\tSystem.out.println(\\\"BOOM! You walked into a wall because there was no door.\\\\n\\\");\\r\\n\\t\\t}\\r\\n\\t\\telse {\\r\\n\\t\\t\\tcurrentRoom = currentRoom.getSouthRoom();\\r\\n\\t\\t\\tSystem.out.println(currentRoom.toString());\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8680a4274206f863ba9198f15e83b1f7\",\n \"score\": \"0.5079963\",\n \"text\": \"public boolean isUp() {\\n\\t\\treturn getY() < 0;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a6bf07cceeefd8a0035a358d63ed9ed2\",\n \"score\": \"0.5079769\",\n \"text\": \"static int bringUpFromDownSide () {\\r\\n\\t\\t//returns 0 if is not successfull\\r\\n\\t\\t//returns 1 if one corner is already placed correctly\\r\\n\\t\\tif (d[0]==WHITE) {\\r\\n\\t\\t\\tif (f[3]==RED) {\\r\\n\\t\\t\\t\\treturn 1;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\treturn 0;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3974155be8de542c588d9681c4af8ec6\",\n \"score\": \"0.5070786\",\n \"text\": \"public void putDown() {\\n wristSolenoid.set(true);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"107cb2c88c6354b1e45af125009c35bf\",\n \"score\": \"0.5064397\",\n \"text\": \"private void wrapDown() {\\r\\n for (int j = y; j > y - length; j--) {\\r\\n if (myWorld[x - 1][j] == Tileset.NOTHING) {\\r\\n myWorld[x - 1][j] = Tileset.WALL;\\r\\n }\\r\\n if (myWorld[x + 1][j] == Tileset.NOTHING) {\\r\\n myWorld[x + 1][j] = Tileset.WALL;\\r\\n }\\r\\n }\\r\\n for (int i = x - 1; i <= x + 1; i++) {\\r\\n if (myWorld[i][y + 1] == Tileset.NOTHING) {\\r\\n myWorld[i][y + 1] = Tileset.WALL;\\r\\n }\\r\\n if (myWorld[i][y - length] == Tileset.NOTHING) {\\r\\n myWorld[i][y - length] = Tileset.WALL;\\r\\n }\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c70428dd171f8c77bcf9b3cb4c85d4b4\",\n \"score\": \"0.50563645\",\n \"text\": \"public void ElevatorHalf(){\\n elevatorLift.setTargetPosition(ELEVATOR_HALF);\\n while(elevatorLift.isBusy()){\\n //wait for elevator to reach target...\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"95c084bc35bcfc629df56cbea5167de0\",\n \"score\": \"0.5055286\",\n \"text\": \"public void calcAdjCells(Board thisBoard) {\\n\\t\\tif(this.isRoom()) {\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tif(this.isDoorway()) {\\n\\t\\t\\tif(this.doorDirection == DoorDirection.RIGHT) {\\n\\t\\t\\t\\tthis.adjCells.add(this.getDoorNeighbor(thisBoard));\\n\\t\\t\\t}else if(this.doorDirection == DoorDirection.LEFT) {\\n\\t\\t\\t\\tthis.adjCells.add(this.getDoorNeighbor(thisBoard));\\n\\t\\t\\t}else if(this.doorDirection == DoorDirection.UP) {\\n\\t\\t\\t\\tthis.adjCells.add(this.getDoorNeighbor(thisBoard));\\n\\t\\t\\t}else if(this.doorDirection == DoorDirection.DOWN) {\\n\\t\\t\\t\\tthis.adjCells.add(this.getDoorNeighbor(thisBoard));\\n\\t\\t\\t}\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tif(this.row > 0) {\\n\\t\\t\\tif(thisBoard.getCellAt(row-1,column).isWalkway()) {\\n\\t\\t\\t\\tthis.adjCells.add(thisBoard.getCellAt(row-1,column));\\n\\t\\t\\t}\\n\\t\\t\\tif(thisBoard.getCellAt(row-1,column).isDoorway()) {\\n\\t\\t\\t\\tif(thisBoard.getCellAt(row-1, column).getDoorNeighbor(thisBoard).equals(this)) {\\n\\t\\t\\t\\t\\tthis.adjCells.add(thisBoard.getCellAt(row-1, column));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(this.column > 0) {\\n\\t\\t\\tif(thisBoard.getCellAt(row,column-1).isWalkway()) {\\n\\t\\t\\t\\tthis.adjCells.add(thisBoard.getCellAt(row,column-1));\\n\\t\\t\\t}\\n\\t\\t\\tif(thisBoard.getCellAt(row,column-1).isDoorway()) {\\n\\t\\t\\t\\tif(thisBoard.getCellAt(row, column-1).getDoorNeighbor(thisBoard).equals(this)) {\\n\\t\\t\\t\\t\\tthis.adjCells.add(thisBoard.getCellAt(row, column-1));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(this.row < thisBoard.getNumRows()-1) {\\n\\t\\t\\tif(thisBoard.getCellAt(row+1,column).isWalkway()) {\\n\\t\\t\\t\\tthis.adjCells.add(thisBoard.getCellAt(row+1,column));\\n\\t\\t\\t}\\n\\t\\t\\tif(thisBoard.getCellAt(row+1,column).isDoorway()) {\\n\\t\\t\\t\\tif(thisBoard.getCellAt(row+1, column).getDoorNeighbor(thisBoard).equals(this)) {\\n\\t\\t\\t\\t\\tthis.adjCells.add(thisBoard.getCellAt(row+1, column));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(this.column < thisBoard.getNumColumns()-1) {\\n\\t\\t\\tif(thisBoard.getCellAt(row,column+1).isWalkway()) {\\n\\t\\t\\t\\tthis.adjCells.add(thisBoard.getCellAt(row,column+1));\\n\\t\\t\\t}\\n\\t\\t\\tif(thisBoard.getCellAt(row,column+1).isDoorway()) {\\n\\t\\t\\t\\tif(thisBoard.getCellAt(row, column+1).getDoorNeighbor(thisBoard).equals(this)) {\\n\\t\\t\\t\\t\\tthis.adjCells.add(thisBoard.getCellAt(row, column+1));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e75a13ce0346b40066f21160b81f2854\",\n \"score\": \"0.50527894\",\n \"text\": \"private void setDirection(){\\n\\n// Offroad_GSR Rally = (Offroad_GSR)gameStateRecord;\\n client_sb.i_Button = direct;\\n\\n switch(direct){\\n case Offroad_SB.MOVE_LEFT:\\n\\t groundPosition-=(client_sb.PLAYER_HORIZ_STEP);\\n\\t skyPosition-=(client_sb.PLAYER_HORIZ_STEP>>1);\\n\\t\\t\\t\\t break;\\n case Offroad_SB.MOVE_RIGHT:\\n\\t\\t\\t\\t groundPosition+=(client_sb.PLAYER_HORIZ_STEP);\\n\\t\\t\\t\\t skyPosition+=(client_sb.PLAYER_HORIZ_STEP>>1);\\n }\\n if (groundPosition>0)groundPosition-=Ground.getWidth();\\n else\\n if (groundPosition<=-Ground.getWidth())groundPosition+=Ground.getWidth();\\n\\n if (skyPosition>0)skyPosition-=Sky.getWidth();\\n else\\n if (skyPosition<-Sky.getWidth())skyPosition+=Sky.getWidth();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"631191761ce6a128e7b55c0facb0dffc\",\n \"score\": \"0.50521094\",\n \"text\": \"public void goUpALevel() {\\n\\t\\tspiderSpawningInterval -= 30;\\n\\t\\tlevel++;\\n\\t\\tnumStrawberries--;\\n\\t\\ttimerDelay--; \\n\\tif(level % 3 == 1)\\n\\t numSpiders++;\\n\\tif(level % 3 == 2)\\n\\t numBarriers++;\\n\\n\\t\\tinitaliseLevel();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"528de4a044ecc688312873ceaafcf980\",\n \"score\": \"0.50515443\",\n \"text\": \"public void goEast()\\r\\n\\t{\\r\\n\\t\\tif(playerPosition<dungeon.length-1)\\r\\n\\t\\t{\\r\\n\\t\\t\\tdungeon[playerPosition].setHasMonster(false);\\r\\n\\t\\t\\tdungeon[playerPosition].setHasPlayer(false);\\r\\n\\t\\t\\tdungeon[playerPosition].setHasWeapon(false);\\r\\n\\t\\t\\tsetPlayerPosition(playerPosition += 1);\\r\\n\\t\\t\\tdungeon[playerPosition].setHasPlayer(true);\\r\\n\\t\\t}//end if\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"67aab9edbfb87fc8133f29f0ea2c09a9\",\n \"score\": \"0.5045844\",\n \"text\": \"public int goUp(int a, int b) {\\n for (int i = LEVEL_ANC - 1; i >= 0; i--) {\\n if (!isAncestor(b, binaryRaise[a][i])) {\\n a = binaryRaise[a][i];\\n }\\n// if (binaryRaise[a][i] != 0) {\\n// System.out.println(b + \\\"\\\\t\\\" + a + \\\"\\\\t\\\" + binaryRaise[a][i] + \\\"\\\\t\\\" + isAncestor(b, binaryRaise[a][i]));\\n// }\\n }\\n\\n return a;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f6b06dc190e6947a83d6222aec000257\",\n \"score\": \"0.5036226\",\n \"text\": \"private void teenagerNightAction() {\\n\\r\\n\\t\\tfor (final Point p : getTownHall().getKnownVillages()) {\\r\\n\\r\\n\\t\\t\\tif (getTownHall().getRelationWithVillage(p) > Building.RELATION_EXCELLENT) {\\r\\n\\t\\t\\t\\tfinal Building distantVillage = mw.getBuilding(p);\\r\\n\\r\\n\\t\\t\\t\\tif (distantVillage != null && distantVillage.culture == getCulture() && distantVillage != getTownHall()) {\\r\\n\\t\\t\\t\\t\\tboolean canMoveIn = false;\\r\\n\\r\\n\\t\\t\\t\\t\\tif (MLN.LogChildren >= MLN.MAJOR) {\\r\\n\\t\\t\\t\\t\\t\\tMLN.major(this, \\\"Attempting to move to village: \\\" + distantVillage.getVillageQualifiedName());\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\tBuilding distantInn = null;\\r\\n\\t\\t\\t\\t\\tfor (final Building distantBuilding : distantVillage.getBuildings()) {\\r\\n\\t\\t\\t\\t\\t\\tif (!canMoveIn && distantBuilding != null && distantBuilding.isHouse()) {\\r\\n\\t\\t\\t\\t\\t\\t\\tif (distantBuilding.canChildMoveIn(gender, familyName)) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tcanMoveIn = true;\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t} else if (distantInn == null && distantBuilding.isInn) {\\r\\n\\t\\t\\t\\t\\t\\t\\tif (distantBuilding.vrecords.size() < 2) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tdistantInn = distantBuilding;\\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\\tif (canMoveIn && distantInn != null) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\tif (MLN.LogChildren >= MLN.MAJOR) {\\r\\n\\t\\t\\t\\t\\t\\t\\tMLN.major(this, \\\"Moving to village: \\\" + distantVillage.getVillageQualifiedName());\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\tgetHouse().transferVillager(getHouse().getVillagerRecordById(villager_id), distantInn, false);\\r\\n\\t\\t\\t\\t\\t\\tdistantInn.visitorsList.add(\\\"panels.childarrived;\\\" + getName() + \\\";\\\" + getTownHall().getVillageQualifiedName());\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7e10a15266a01823634fa39dbc42ce28\",\n \"score\": \"0.50359845\",\n \"text\": \"private void lvlUp(){\\r\\n\\t\\tRandom ran = new Random();\\r\\n\\t\\tmaxHealth += (ran.nextInt(6) + 5);\\r\\n\\t\\tif(maxHealth > 100){\\r\\n\\t\\t\\tmaxHealth = 100;\\r\\n\\t\\t}\\r\\n\\t\\tatt += (ran.nextInt(6) + 5);\\r\\n\\t\\tif(att > 100){\\r\\n\\t\\t\\tatt = 100;\\r\\n\\t\\t}\\r\\n\\t\\tdef += (ran.nextInt(6) + 5);\\r\\n\\t\\tif(def > 100){\\r\\n\\t\\t\\tdef = 100;\\r\\n\\t\\t}\\r\\n\\t\\tlv++;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"49a44aac65a9cc5288573978a2365d96\",\n \"score\": \"0.50315326\",\n \"text\": \"public void addUPnode(WorldObject object) {\\n\\t\\tthis.up = new Node(object);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2af482eb22ac14cc2467efcdbd951a60\",\n \"score\": \"0.5031133\",\n \"text\": \"void floatStraightUp() {\\n // Move upwards.\\n\\tif (this.getCoordinateTwo() < -1) { \\n this.getTank().getMyLittleFishies().remove(this);\\n return;\\n\\t}\\n this.setCoordinateTwo(this.getCoordinateTwo() - 1);\\n \\n // Figure out whether to grow, if at all.\\n double movement = Math.random();\\n // Occasionally change a . to a o or a o to a O.\\n if (movement < 0.05) {\\n if (appearance.equals(\\\".\\\")) {\\n // If the appearance is a ., change it to an o.\\n appearance = \\\"o\\\";\\n } else if (appearance.equals(\\\"o\\\")) {\\n // If the appearance is an o, change it to a O.\\n appearance = \\\"O\\\";\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2fc6a6c22cddaf79ea7899ff3ed6caa3\",\n \"score\": \"0.50256664\",\n \"text\": \"upperBoundLeaf createupperBoundLeaf();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"78e068c1eae544fde9c8e871bef2bb95\",\n \"score\": \"0.5020069\",\n \"text\": \"public void move() {\\n if (_currentFloor == Floor.FIRST) {\\n _directionOfTravel = DirectionOfTravel.UP;\\n }\\n if (_currentFloor == Floor.SEVENTH) {\\n _directionOfTravel = DirectionOfTravel.DOWN;\\n }\\n\\n if (_directionOfTravel == DirectionOfTravel.UP) {\\n _currentFloor = _currentFloor.nextFloorUp();\\n } else if (_directionOfTravel == DirectionOfTravel.DOWN) {\\n _currentFloor = _currentFloor.nextFloorDown();\\n }\\n\\n if(_currentFloor.hasDestinationRequests()){\\n stop();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dc848875d4c0692c1956d0df267b5a2d\",\n \"score\": \"0.50196725\",\n \"text\": \"public Hallway(int x, int y, int l, int direction, TETile[][] world) {\\r\\n this.x = x;\\r\\n this.y = y;\\r\\n length = l;\\r\\n myWorld = world;\\r\\n this.direction = direction;\\r\\n\\r\\n switch (direction) {\\r\\n case UP -> goUp();\\r\\n case RIGHT -> goRight();\\r\\n case DOWN -> goDown();\\r\\n case LEFT -> goLeft();\\r\\n default -> throw new IllegalArgumentException(\\\"Illegal direction!\\\");\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6fb7fa222b152d8b1a51b055ec8fb91a\",\n \"score\": \"0.50166965\",\n \"text\": \"@Test\\n public void testChooseDirectionAtDeadEnd() {\\n \\n for (final Terrain t : Terrain.values()) {\\n if (t != Terrain.STREET && t != Terrain.CROSSWALK && t != Terrain.LIGHT) {\\n \\n final Map<Direction, Terrain> neighbors = new HashMap<Direction, Terrain>();\\n neighbors.put(Direction.WEST, t);\\n neighbors.put(Direction.NORTH, t);\\n neighbors.put(Direction.EAST, t);\\n neighbors.put(Direction.SOUTH, Terrain.STREET);\\n \\n final Truck truck = new Truck(0, 0, Direction.NORTH);\\n \\n // the Truck must reverse and go SOUTH\\n assertEquals(\\\"Truck chooseDirection() failed \\\"\\n + \\\"when reverse was the only valid choice!\\\",\\n Direction.SOUTH, truck.chooseDirection(neighbors));\\n }\\n \\n }\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":3899,"cells":{"query_id":{"kind":"string","value":"f95d0e7cf366d22b0a351cea972c3663"},"query":{"kind":"string","value":"This method should return the size of the stack"},"positive_passages":{"kind":"list like","value":[{"docid":"8202c2b8475d0f96498788ddc8bc0dce","score":"0.0","text":"public int getSize(){\r\n return (A.getSize());\r\n //To be written by student\r\n }","title":""}],"string":"[\n {\n \"docid\": \"8202c2b8475d0f96498788ddc8bc0dce\",\n \"score\": \"0.0\",\n \"text\": \"public int getSize(){\\r\\n return (A.getSize());\\r\\n //To be written by student\\r\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"1ef90c6689a3cf491cf075135dc214d9","score":"0.89875853","text":"public int stackSize() {\r\n return stack.size();\r\n }","title":""},{"docid":"b890eae726daa5b2089cde9d7ef38f42","score":"0.8638514","text":"public int size() {\n return stack.size();\n }","title":""},{"docid":"771fbe0d927b30a796354f33b724138e","score":"0.8519742","text":"public int stackSize() {\r\n return stackTrace.size();\r\n }","title":""},{"docid":"28854a5ea7ac4ea63d8b0ecbc9941420","score":"0.8456245","text":"public int size() {\n return stackCount;\n }","title":""},{"docid":"afd0512173dc5ae442d3e7e5b084b9d0","score":"0.8453942","text":"public int getStackCapacity(){\n return this.stack.getStackCapacity();\n }","title":""},{"docid":"1a63062f3643fcc096304e69c7814a83","score":"0.8239133","text":"public int getStackSize(){\r\n return stack.size();\r\n }","title":""},{"docid":"cffa384336d8b14af6cbb8e3cabf58a6","score":"0.813856","text":"public int size() {\n\t\tSystem.out.println(\"Inside size() - The numStackElements = \" + numStackElements);\n\t\treturn numStackElements;\n\t\t//int dummy = 0;\n\t\t//return dummy;\n\t}","title":""},{"docid":"fe2f9e5c5836f8e92df4588c3cc18169","score":"0.79768056","text":"public int size() {\n\t return this.callStack.size() +1;\n\t }","title":""},{"docid":"f79f4879292973957ce840dccbbbcd91","score":"0.78954095","text":"public int currSize() {\n int pointer = framePointer.peek();\n int runStackSize = runTimeStack.size();\n return (pointer >= runStackSize) ? 0 : (runStackSize - pointer);\n }","title":""},{"docid":"9fac70d139b13736835ab5c2ba14dcf1","score":"0.7626478","text":"public int size(){\n return stack1.size() + stack2.size();\n }","title":""},{"docid":"f4316084a6723c66cf94817a05f8d54e","score":"0.75782835","text":"private int numStack() {\n \tint stackNumber = 0;\n \tint stackCount = 0;\n \tboolean stackExists = true;\n \t\n \twhile (stackExists) {\n\t\t\ttry {\n \t\t\tcargo.toArray(stackNumber);\n \t\t\tstackExists = true;\n \t\t} catch (ManifestException e) {\n \t\t\tstackExists = false;\n \t\t} \t\t\n \t\tif (stackExists) {\n \t\t\tstackCount++;\n \t\t}\n \t\tstackNumber++;\n\t\t}\t\n \treturn stackCount;\n }","title":""},{"docid":"10a964f895023cd56a248553e490d02f","score":"0.7575299","text":"public int getStackSize(){\n return this.stack.getStackSize();\n }","title":""},{"docid":"4ce34297c496d214de469c76127310e0","score":"0.73795676","text":"public int getMaxStackSize()\n {\n return 64;\n }","title":""},{"docid":"a12c2dee57ff23a5940e86b2d9d640e5","score":"0.7319862","text":"public int size()\n {\n int counter = 0;\n node temp = stack;\n\n //Counting elements in stack\n while (temp != null)\n {\n counter++;\n temp = temp.next;\n }\n\n return counter;\n }","title":""},{"docid":"e46de31e99889b5621aff264d3a9f113","score":"0.73015386","text":"private int computeStackUsage() {\n\t\tint s = 0; // stack size after each operation\r\n\t\tint max = 0; // maximum stack size seen\r\n\t\tfor (int i = 0; i < codeSize; i++) {\r\n\t\t\tif (code[i] >= 0 || code[i] == VARIABLE || code[i] == CONSTANT) {\r\n\t\t\t\ts++;\r\n\t\t\t\tif (s > max)\r\n\t\t\t\t\tmax = s;\r\n\t\t\t} else if (code[i] >= POWER)\r\n\t\t\t\ts--;\r\n\t\t}\r\n\t\treturn max;\r\n\t}","title":""},{"docid":"34ef660159178e9eea210d098110516b","score":"0.7216199","text":"public int yyInputStackSize ()\r\n\t{\r\n\t\treturn _yyInputStack == null ? 0 : _yyInputStack.size ();\r\n\t}","title":""},{"docid":"423ecf559d5718439fb101a14b3b518d","score":"0.71915925","text":"public int getImageStackSize() {\n\t\tif (stack==null)\n\t\t\treturn 1;\n\t\telse {\n\t\t\tint slices = stack.getSize();\n\t\t\tif (slices==0) slices = 1;\n\t\t\treturn slices;\n\t\t}\n\t}","title":""},{"docid":"285c4cbbb9c120f814c68d903ac10d47","score":"0.7187789","text":"public int getStackSize() {\n\t\tif (stack==null)\n\t\t\treturn 1;\n\t\telse {\n\t\t\tint slices = stack.getSize();\n\t\t\t//if (compositeImage) slices /= nChannels;\n\t\t\tif (slices<=0) slices = 1;\n\t\t\treturn slices;\n\t\t}\n\t}","title":""},{"docid":"cdc6f577d4d6be6f2ef1c757b0818afa","score":"0.7142355","text":"public int yyInputStackSize ()\r\n {\r\n return _yyInputStack == null ? 0 : _yyInputStack.size ();\r\n }","title":""},{"docid":"c2932e12dbbcac927d14a6c2d7ee2e7c","score":"0.7090034","text":"int getStack();","title":""},{"docid":"af16068d1b66f9de3020e87a176c2c3a","score":"0.7016422","text":"public static <T> int size(MyStack<T> s) {\n\n\t\tif (s == null) {\n\t\t\tthrow new java.util.NoSuchElementException(\"Cannot operate on null stack\");\n\t\t}\n\n\t\t// We don't want to modify the original stack\n\t\t// Therefore, we must clone the original stack\n\t\t// and perform operations on the cloned stack\n\t\tvar clonedS = cloneStack(s);\n\n\t\tint length = 0;\n\t\twhile (!clonedS.isEmpty()) {\n\t\t\tclonedS.pop();\n\t\t\tlength += 1;\n\t\t}\n\n\t\treturn length;\n\t}","title":""},{"docid":"7d99ccc6d24f058e14b8b7cb7af2f9e6","score":"0.7010842","text":"public int getMaxStack() {\r\n return max_stack;\r\n }","title":""},{"docid":"13e9d8f291cfa08770b372e2f4f7b8fd","score":"0.70076686","text":"public Integer getStackSize() {\n\treturn new Integer(-1);\n }","title":""},{"docid":"c3779c7017efadde5e369fc681c38c97","score":"0.698494","text":"public int getStackMax() { return _stackmax; }","title":""},{"docid":"7de1a18ca694b470008009477aa3c3bb","score":"0.6973468","text":"public int getMaxStack() {\r\n return maxStack;\r\n }","title":""},{"docid":"8f12654268a95e13e50f9495dc490fdd","score":"0.6962847","text":"@Test\n public void testSize() throws Exception\n {\n assertEquals(0, stack.size());\n\n // Test for regular lab3.stack\n stack.push(\"Top\");\n stack.push(\"Topmost\");\n }","title":""},{"docid":"230797ad278d6a559533814d7b9f8277","score":"0.6858701","text":"@Test\n void testSizeAfterPushes(){\n this.test.push(\"primeiro\");\n this.test.push(\"segundo\");\n this.test.push(\"terceiro\");\n\n assertEquals(3, this.test.size(), \"After 3 pushes the stack's size isn't returning 3\");\n\n }","title":""},{"docid":"92be6dde92d5d1b54d58a4812d573058","score":"0.6835288","text":"public int getMaxStackable();","title":""},{"docid":"19f53dca27125894433c8c2150af83d8","score":"0.6806353","text":"public int getStackSize() {\n return elements.length;\n }","title":""},{"docid":"39e7a61a95234b9def65b8ff949ec9c9","score":"0.6720694","text":"@Test\n\tvoid testSize() {\n\t\tmyStack.push(Integer.toString(5));\n\t\tmyStack.push(Integer.toString(8));\n\t\tassertEquals(myStack.size(), 2, \" should be 2\");\n\t}","title":""},{"docid":"8abaec23a0a33db592687066241e685c","score":"0.670009","text":"public int getGraphicsStackSize() {\n return graphicsStack.size();\n }","title":""},{"docid":"a10802489a4e7533574ff191d3f223a9","score":"0.66665983","text":"public static int getNumOfStacksNeeded(int length) {\n\treturn (int)((length-1)/ArrayStack.length() + 1);\n }","title":""},{"docid":"07615fd6d98afd32d37d0086bd70e80a","score":"0.66389674","text":"public int size() {\n\t\t// replace this with your code\n\t\treturn heapSize;\n\t}","title":""},{"docid":"b8bca99b3396c4ebe4c287d3afc9c01d","score":"0.66128695","text":"public static int size_count() {\n return (8 / 8);\n }","title":""},{"docid":"720321a62ab56557d9d3708eb5d77c47","score":"0.6586302","text":"public int size() {\n\t\t// return size (have been keeping track of it in methods\n\t\treturn size;\n\t}","title":""},{"docid":"68d66019091335d0aa4748eb63161ac1","score":"0.65302396","text":"@Test\n public void whenUseGetSizeThenReturnSizeStack() {\n String first = \"Test\";\n String second = \"Bingo\";\n link.push(first);\n link.push(second);\n int result = link.getSize();\n assertThat(result, is(2));\n }","title":""},{"docid":"47cf7350c87ea00ff3d106a7a45836ad","score":"0.65107197","text":"public static int size_cnt() {\n return (16 / 8);\n }","title":""},{"docid":"d40457917fc8e09243786528b04497c9","score":"0.64942926","text":"public int getNumberOfElements(){\n\t\tint count = 0;\n\t\tfor(int i=0; i<stackArray.length; i++){\n\t\t\tif(stackArray[i] != null)\n\t\t\t\tcount++;\n\t\t}\n\t\t\n\t\treturn count;\n\t}","title":""},{"docid":"ac0aac8f0148bdf9451053f4ea9add42","score":"0.6487802","text":"public int sizeInBytes() {\n int size = 0;\n if (this.variable != null) {\n size = 0 + 4;\n }\n return size + 4 + 4 + this.variables.sizeInBytes();\n }","title":""},{"docid":"477cf07aea57145fd98c7844f2bd1732","score":"0.64773196","text":"int size() {\n\t\treturn heap.size();\n\t}","title":""},{"docid":"526f67d7aed4cc9bbbbe928a6be4427f","score":"0.64015734","text":"public int size() { \n\treturn top+1; \n }","title":""},{"docid":"5cb8bac90ee9c72ca77e3c8c5d117adf","score":"0.63936687","text":"public int getStack() {\n return this.stack;\n }","title":""},{"docid":"ced21fd9eba5613caed9cad557addf55","score":"0.6390986","text":"public float getStackSpace() {\n return mStackSpace;\n }","title":""},{"docid":"fd2aa4727fa38f4263f5f1701dc12d4a","score":"0.63788545","text":"protected final int getStackHeight(Point2 p) {\n for (int i = 0; i < m_containerSpots[p.x].length; i++) {\n if (m_containerSpots[p.x][i][p.y].container == null)\n return i;\n }\n return m_containerSpots[p.x].length;\n }","title":""},{"docid":"f29181a59d44d771a37bcff9d71a6681","score":"0.6369386","text":"public int size() {\n return top + 1;\n }","title":""},{"docid":"cd61efc186b78a120d239e87e2e3667b","score":"0.6352451","text":"public int size() {\n return top + 1;\n }","title":""},{"docid":"308a83fa404e4490fdfbde073d985455","score":"0.6335088","text":"@Test\n void testSizeOnConstruction(){\n assertEquals(0, this.test.size(), \"New stack size is not returning 0\");\n }","title":""},{"docid":"ff1364f7278e55352549e8d5990c5f5a","score":"0.6306568","text":"public static Integer size() {\n\t\treturn count;\n\t}","title":""},{"docid":"be21e18f3fe33db975b3be9de9b87c4f","score":"0.63059044","text":"public int getCurrentSize();","title":""},{"docid":"be21e18f3fe33db975b3be9de9b87c4f","score":"0.63059044","text":"public int getCurrentSize();","title":""},{"docid":"aba03f79d8629a31be75e13edd8c1799","score":"0.6303986","text":"public int size() {\n\t\t/* your code here */\n\t\tif (tail == null)\n\t\t\treturn 1;\n\t\telse\n\t\t\treturn 1 + tail.size();\n\t\t\n\t}","title":""},{"docid":"17f46c957fb1d708e3d4723f9b9a9bfb","score":"0.62985176","text":"public int getSlotStackLimit()\n {\n return 1;\n }","title":""},{"docid":"f2907c942b89eeebf15346bcacf2a720","score":"0.62955046","text":"public static int getBoardHeight() {\n\t\tboolean[][] input = getFullStack();\n\t\treturn input.length;\n\t}","title":""},{"docid":"a690eb80c557bc6af41901196ebfa52b","score":"0.629033","text":"public int getSize () {\n return top + 1;\n }","title":""},{"docid":"f3a5ce2c95c328be2a300b5540ff5607","score":"0.6285147","text":"public int getInventoryStackLimit()\r\n {\r\n return 64;\r\n }","title":""},{"docid":"d5065393646da2190979c55f88497a0c","score":"0.6285121","text":"private void calculateStackmax()\n {\n _stackmax = 0;\n int ptr = 0;\n for (int i = 0; i < _tokenlist.length; ++i)\n {\n if (_tokenlist[i].getType() == Token.INSTRUCTION.CONSTANT || _tokenlist[i].getType() == Token.INSTRUCTION.VARIABLE)\n ++ptr;\n else if (_tokenlist[i].getType() == Token.INSTRUCTION.OPERATOR && _tokenlist[i].getData().getReal() < 6)\n --ptr;\n _stackmax = (ptr > _stackmax) ? ptr : _stackmax;\n }\n \n }","title":""},{"docid":"b950c83260633def5552c3c488f8ee70","score":"0.6278419","text":"public int getStackDepth() { return stackDepth; }","title":""},{"docid":"41ca9f367bcf8993cac116ef75a88d10","score":"0.625808","text":"public int size() {\n // DO NOT MODIFY THIS METHOD!\n return size;\n }","title":""},{"docid":"9d3b62e36f4ab7722258a395a8ea26db","score":"0.62561303","text":"public static int count() {\r\n \treturn sizes.length;\r\n }","title":""},{"docid":"9f85c98524facd1d6edf122e90da1c2c","score":"0.6241821","text":"public int getSizeInBytes() {\n\t\treturn 4 + 4 + 4 + 4 + 4 + (tag.length()*2) + 4 + 4 + (8*frames.size());\n\t}","title":""},{"docid":"837cad4a1d0c5f2baee487d20b9c1cc1","score":"0.62414217","text":"public int size(){\n return top + 1;\n }","title":""},{"docid":"141e733aab55787ba265c27003765ce7","score":"0.62103945","text":"public int size() {\n // DO NOT MODIFY!\n return size;\n }","title":""},{"docid":"141e733aab55787ba265c27003765ce7","score":"0.62103945","text":"public int size() {\n // DO NOT MODIFY!\n return size;\n }","title":""},{"docid":"4d9d241d058f798fa62a300ef39fbc33","score":"0.6204237","text":"static int SIZEOF() {\n\t\t\treturn 256;\n\t\t}","title":""},{"docid":"4d9d241d058f798fa62a300ef39fbc33","score":"0.6204237","text":"static int SIZEOF() {\n\t\t\treturn 256;\n\t\t}","title":""},{"docid":"81ae6b58622edec74534d3efa481bd9d","score":"0.62010676","text":"public int size() {\r\n LLNode<T> currNode = top;\r\n int size = 0;\r\n while(currNode != null) {\r\n size += 1;\r\n currNode = currNode.getLink();\r\n }\r\n return size;\r\n }","title":""},{"docid":"3ce071161c68b9cbaebbfcd05389418a","score":"0.6181354","text":"public int getTotalSize();","title":""},{"docid":"b111f91db22bb914df2c09329b79408f","score":"0.6178552","text":"private long getMaxEnergyStored(ItemStack stack) {\n\t\treturn TeslaUtils.getCapacity(stack, null);\n\t}","title":""},{"docid":"034e5d554178ffac137eaabea630ab47","score":"0.6172943","text":"public int frameSize() {\n numFrames = frames.size();//number of frames becomes equal to the size of the frames\n return frames.size();//then it is returned\n }","title":""},{"docid":"d4fce001bdace4be14c965fb5253b799","score":"0.61679715","text":"public int sizeInBytes() {\n\t\tint len = 1 + 4 + 4 + (srcImageTag.length()*2);\t//{Collidable/Spawner}, hp, imageSourceLen name\n\t\t//Add the sprites\n\t\tlen += 8;\t//Row and col of the spot on the spritesheet (for debug mode ease of access)\n\t\tlen += 1;\t//Is the entity savable (byte)\n\t\tlen += 4;\t//num sprites\n\t\tfor (Sprite s : sprites) {\n\t\t\tlen += s.getSizeInBytes();\n\t\t}\n\t\treturn len;\n\t}","title":""},{"docid":"fae7655ad84cc7d5cbbdb8a8e91b7cc0","score":"0.6165453","text":"public static int size_request() {\n return (8 / 8);\n }","title":""},{"docid":"6d7d7e84b63f20e4ccb9a4f302025c01","score":"0.61628515","text":"public int size () {\r\n\t\treturn size;\r\n\t}","title":""},{"docid":"f58b80d37e7a90fabb09c0ca93c028bd","score":"0.6156193","text":"public int countOut() {\n\t\tif (callCheck())\n\t\t\treturn EMPTY_STACK_VALUE+1;\n\t\treturn numbers[total--];\n\t}","title":""},{"docid":"6f26dc8ddd20614cf8987fd6810611f6","score":"0.6155866","text":"public int size() {\n // replace the code below to implement the size method\n return size;\n }","title":""},{"docid":"a21bd79298924c0b35b3acf89e9b53b9","score":"0.6155008","text":"public boolean isStackFull(){\r\n return (topOfStack==A.getSize()-1);\r\n }","title":""},{"docid":"5d060639a205ea2bff3015479430cd1f","score":"0.614295","text":"public int getMaxFlow(FluidStack stack)\n\t{\n\t\treturn 1000;\n\t}","title":""},{"docid":"bc5b5a344f3dc24ab73c44b71b1adda1","score":"0.61371017","text":"public int calculateGridSize() {\n\t\tif (hasStack(2) || hasStack(5) || hasStack(6) || hasStack(7) || hasStack(8)) return 3;\n\t\tif (hasStack(1) || hasStack(3) || hasStack(4)) return 2;\n\t\tif (hasStack(0)) return 1;\n\n\t\treturn 0;\n\t}","title":""},{"docid":"602734dbe2a402a8f08e9337667a43ad","score":"0.6131817","text":"public int size() {\n // recursive approach seems more perspicuous\n if( headReference == null) return 0;\n else return size( headReference);\n }","title":""},{"docid":"8a6261f8f8860390b36732409917b0ca","score":"0.6127575","text":"public int getCurrentSize ()\n {\n return getCurrentSizeHelper ( headRef );\n }","title":""},{"docid":"d966b97ac4ff6acb670068e435a946af","score":"0.61179924","text":"public int size() {\n\t\treturn topIndex + 1;\n\t}","title":""},{"docid":"41051200632268bf9b6fcf97133a1779","score":"0.61108947","text":"public int size() {\n\t\t//return the size counter\n\t\treturn size;\n\t}","title":""},{"docid":"ef47536cd8b43b2a65c589aae1d45242","score":"0.6110594","text":"int currentSize();","title":""},{"docid":"96af65bbe470c752961f427f924c8cd6","score":"0.61081344","text":"protected synchronized int size() {\n\t\tQueue<LogEntry> buff = getDeque();\n\t\treturn buff.size();\n\t}","title":""},{"docid":"ef6cc45025ae35dfebdb8f6c5a290f7f","score":"0.6102934","text":"public int size( )\n {\n return size;\n }","title":""},{"docid":"0639b4c4cf8974d82e92983c792a9f68","score":"0.61018807","text":"public int size() {\r\n\t\t\tint size = 1;\r\n\t\t\tif(left != null) {\r\n\t\t\t\tsize += left.size();\r\n\t\t\t}\r\n\t\t\tif(right != null) {\r\n\t\t\t\tsize += right.size();\r\n\t\t\t}\r\n\t\t\treturn size;\r\n\t\t}","title":""},{"docid":"38e37de238709c1faac3ae1fc1853581","score":"0.60910845","text":"public static void stack() {\n Stack<Integer> s = new Stack<>(); // initialise\n\n s.push(5); // push a new element\n s.empty(); // check if stack is empty\n s.pop(); // pop an element\n s.peek(); // get the top element of the stack\n s.size(); // size of the stack\n }","title":""},{"docid":"1308f3a1b7cbf1d3bdf2861dc03ed6e2","score":"0.60883695","text":"private int getArity() {\n return fp - (stack[fp - 1] + 3);\n }","title":""},{"docid":"1002c951362169dff23a0c563714f61b","score":"0.6085322","text":"public int size() {\n\t\treturn currSize;\n\t}","title":""},{"docid":"ff8395b68d9bf06f8afdf9f47496472b","score":"0.6078963","text":"public int getCurrentSize() {\n return count;\n }","title":""},{"docid":"724d1459934fa44d0acb4ffc585c1e62","score":"0.6072425","text":"static int SIZEOF() {\n\t\t\treturn 32;\n\t\t}","title":""},{"docid":"83b60840a3a082dffb315c453c61155c","score":"0.6071037","text":"public static int getSize()\r\n\t{\r\n\t\treturn size;\r\n\t}","title":""},{"docid":"0b3d03aae02b0b9f7f1905b5868e5c64","score":"0.6068594","text":"private int getHandsStackSize(BufferedImage stackImage, int digitsCount,\n\t\t\tboolean isPlayerSittingAtTheTop) {\n\n\t\tint[] stackSize = new int[digitsCount];\n\t\tint currXOffset = 0;\n\t\tint currYOffset = 0;\n\n\t\t// TODO: change this stupid if\n\t\tif (digitsCount < 2) {\n\t\t\treturn 5;\n\t\t}\n\n\t\tif (isPlayerSittingAtTheTop) {\n\t\t\tcurrXOffset = upXOffset + (digitsAfterCommaCount - digitsCount)\n\t\t\t\t\t* leftDigitXDifference;\n\t\t\tcurrYOffset = upYOffset;\n\t\t} else {\n\t\t\tcurrXOffset = downXOffset + (digitsAfterCommaCount - digitsCount)\n\t\t\t\t\t* leftDigitXDifference;\n\t\t\tcurrYOffset = downYOffset;\n\t\t}\n\n\t\tfor (int i = 0; i < digitsCount; i++) {\n\n\t\t\t// System.out.println(\"SUBIMAGE: x=\"\n\t\t\t// + (currXOffset + (digitWithSpaceWidth * i)) + \", y=\"\n\t\t\t// + currYOffset);\n\n\t\t\tstackSize[i] = digitReader.getDigit(stackImage.getSubimage(\n\t\t\t\t\tcurrXOffset + (digitWithSpaceWidth * i), currYOffset,\n\t\t\t\t\tdigitWidth, digitHeight));\n\n\t\t}\n\n\t\treturn NumberFormatter.getIntFromDigits(stackSize);\n\t}","title":""},{"docid":"a7e92455ddf0170afa4a41efbceb3de2","score":"0.6065396","text":"protected int getQueueSize(){\n\t\tif(\tthis.m_queue!=null){\n\t\t\treturn \tthis.m_queue.queueSize();\n\t\t}\n\t\treturn 0;\n\t}","title":""},{"docid":"4c76e164fbe8c95b808a1ff26a57ab47","score":"0.60588026","text":"@Test\n public void doubleStackFirstStackSizeConstantAfterGettingTop() {\n IDoubleStack doubleStack = getFactory().makeDoubleStack(DEFAULT_MAX_SIZE);\n IStack firstStack = doubleStack.getFirstStack();\n for (int i = 0; i < DEFAULT_MAX_SIZE; i++) {\n firstStack.push(new Integer(i));\n }\n int sizeBeforeGettingTop = firstStack.size();\n firstStack.top();\n assertEquals(sizeBeforeGettingTop, firstStack.size());\n }","title":""},{"docid":"8d21a85e6364c8ef587db9ff7f9f0cde","score":"0.6057332","text":"public int size(){\n\t\treturn this.size;\n\t\t//Runs in O(1) time since we are returning an already defined variable, which takes constant time.\n\t}","title":""},{"docid":"eddb4a1f4f555a6edb221bc0e812a01a","score":"0.6057267","text":"@Test\n public void StackSize() {\n NewStack newStack = new NewStack(listSet.size());\n\n assertEquals(-1, newStack.size());\n\n for(Lego lego : listSet) {\n newStack.push(lego);\n }\n\n // Een lege stack return -1 als grootte. Vandaar dat van de verwachte stack 1 wordt afgetrokken.\n assertEquals(listSet.size() - 1, newStack.size());\n }","title":""},{"docid":"95c72a84619e4e3535a82dd507983f01","score":"0.6054096","text":"@Test\n public void pushMethodTest_pushManyElementsToLStack_sizeShouldNotBeZero() {\n final int numberOfPushedElements = 100;\n //Arrange\n for (int i = 0; i < numberOfPushedElements; i++) {\n this.testStack.push(i);\n }\n int expected = numberOfPushedElements;\n //Act\n int actual = this.testStack.size();\n //Assert\n Assert.assertEquals(\n \"LStack's size after pushing an element should not be zero!\", expected, actual);\n }","title":""},{"docid":"4792a4ea4ec9e40b80f8eaff4b6f4d4f","score":"0.60539484","text":"int treeSize() {\r\n\t\treturn\r\n\t\t\tmemSize()\r\n\t\t\t+ (this.preDDocs.listSize())\r\n\t\t\t+ (this.modifiers.listSize())\r\n\t\t\t+ (this.postModifiers.listSize())\r\n\t\t\t+ (this.returnType == null ? 0 : getReturnType().treeSize())\r\n\t\t\t+ (this.name == null ? 0 : getName().treeSize())\r\n\t\t\t+ (this.templateParameters.listSize())\r\n\t\t\t+ (this.arguments.listSize())\r\n\t\t\t+ (this.constraint == null ? 0 : getConstraint().treeSize())\r\n\t\t\t+ (this.precondition == null ? 0 : getPrecondition().treeSize())\r\n\t\t\t+ (this.postcondition == null ? 0 : getPostcondition().treeSize())\r\n\t\t\t+ (this.postconditionVariableName == null ? 0 : getPostconditionVariableName().treeSize())\r\n\t\t\t+ (this.body == null ? 0 : getBody().treeSize())\r\n\t\t\t+ (this.postDDoc == null ? 0 : getPostDDoc().treeSize())\r\n\t;\r\n\t}","title":""},{"docid":"d95d72ab7b18cee4a4f26a4e97b32b6d","score":"0.60513115","text":"public boolean isStackFull() {\n\t\treturn (top == stackSize - 1);\n\t}","title":""},{"docid":"f311b670f39bd25d1eed81909fc6a383","score":"0.6042819","text":"public final int size ()\n {\n return _size;\n }","title":""},{"docid":"3748bce112923721e9023fc3fde52e1b","score":"0.60374266","text":"private int size(){\n return theQueue.getSize();\n }","title":""}],"string":"[\n {\n \"docid\": \"1ef90c6689a3cf491cf075135dc214d9\",\n \"score\": \"0.89875853\",\n \"text\": \"public int stackSize() {\\r\\n return stack.size();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b890eae726daa5b2089cde9d7ef38f42\",\n \"score\": \"0.8638514\",\n \"text\": \"public int size() {\\n return stack.size();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"771fbe0d927b30a796354f33b724138e\",\n \"score\": \"0.8519742\",\n \"text\": \"public int stackSize() {\\r\\n return stackTrace.size();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"28854a5ea7ac4ea63d8b0ecbc9941420\",\n \"score\": \"0.8456245\",\n \"text\": \"public int size() {\\n return stackCount;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"afd0512173dc5ae442d3e7e5b084b9d0\",\n \"score\": \"0.8453942\",\n \"text\": \"public int getStackCapacity(){\\n return this.stack.getStackCapacity();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a63062f3643fcc096304e69c7814a83\",\n \"score\": \"0.8239133\",\n \"text\": \"public int getStackSize(){\\r\\n return stack.size();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cffa384336d8b14af6cbb8e3cabf58a6\",\n \"score\": \"0.813856\",\n \"text\": \"public int size() {\\n\\t\\tSystem.out.println(\\\"Inside size() - The numStackElements = \\\" + numStackElements);\\n\\t\\treturn numStackElements;\\n\\t\\t//int dummy = 0;\\n\\t\\t//return dummy;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fe2f9e5c5836f8e92df4588c3cc18169\",\n \"score\": \"0.79768056\",\n \"text\": \"public int size() {\\n\\t return this.callStack.size() +1;\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f79f4879292973957ce840dccbbbcd91\",\n \"score\": \"0.78954095\",\n \"text\": \"public int currSize() {\\n int pointer = framePointer.peek();\\n int runStackSize = runTimeStack.size();\\n return (pointer >= runStackSize) ? 0 : (runStackSize - pointer);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9fac70d139b13736835ab5c2ba14dcf1\",\n \"score\": \"0.7626478\",\n \"text\": \"public int size(){\\n return stack1.size() + stack2.size();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f4316084a6723c66cf94817a05f8d54e\",\n \"score\": \"0.75782835\",\n \"text\": \"private int numStack() {\\n \\tint stackNumber = 0;\\n \\tint stackCount = 0;\\n \\tboolean stackExists = true;\\n \\t\\n \\twhile (stackExists) {\\n\\t\\t\\ttry {\\n \\t\\t\\tcargo.toArray(stackNumber);\\n \\t\\t\\tstackExists = true;\\n \\t\\t} catch (ManifestException e) {\\n \\t\\t\\tstackExists = false;\\n \\t\\t} \\t\\t\\n \\t\\tif (stackExists) {\\n \\t\\t\\tstackCount++;\\n \\t\\t}\\n \\t\\tstackNumber++;\\n\\t\\t}\\t\\n \\treturn stackCount;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"10a964f895023cd56a248553e490d02f\",\n \"score\": \"0.7575299\",\n \"text\": \"public int getStackSize(){\\n return this.stack.getStackSize();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4ce34297c496d214de469c76127310e0\",\n \"score\": \"0.73795676\",\n \"text\": \"public int getMaxStackSize()\\n {\\n return 64;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a12c2dee57ff23a5940e86b2d9d640e5\",\n \"score\": \"0.7319862\",\n \"text\": \"public int size()\\n {\\n int counter = 0;\\n node temp = stack;\\n\\n //Counting elements in stack\\n while (temp != null)\\n {\\n counter++;\\n temp = temp.next;\\n }\\n\\n return counter;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e46de31e99889b5621aff264d3a9f113\",\n \"score\": \"0.73015386\",\n \"text\": \"private int computeStackUsage() {\\n\\t\\tint s = 0; // stack size after each operation\\r\\n\\t\\tint max = 0; // maximum stack size seen\\r\\n\\t\\tfor (int i = 0; i < codeSize; i++) {\\r\\n\\t\\t\\tif (code[i] >= 0 || code[i] == VARIABLE || code[i] == CONSTANT) {\\r\\n\\t\\t\\t\\ts++;\\r\\n\\t\\t\\t\\tif (s > max)\\r\\n\\t\\t\\t\\t\\tmax = s;\\r\\n\\t\\t\\t} else if (code[i] >= POWER)\\r\\n\\t\\t\\t\\ts--;\\r\\n\\t\\t}\\r\\n\\t\\treturn max;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"34ef660159178e9eea210d098110516b\",\n \"score\": \"0.7216199\",\n \"text\": \"public int yyInputStackSize ()\\r\\n\\t{\\r\\n\\t\\treturn _yyInputStack == null ? 0 : _yyInputStack.size ();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"423ecf559d5718439fb101a14b3b518d\",\n \"score\": \"0.71915925\",\n \"text\": \"public int getImageStackSize() {\\n\\t\\tif (stack==null)\\n\\t\\t\\treturn 1;\\n\\t\\telse {\\n\\t\\t\\tint slices = stack.getSize();\\n\\t\\t\\tif (slices==0) slices = 1;\\n\\t\\t\\treturn slices;\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"285c4cbbb9c120f814c68d903ac10d47\",\n \"score\": \"0.7187789\",\n \"text\": \"public int getStackSize() {\\n\\t\\tif (stack==null)\\n\\t\\t\\treturn 1;\\n\\t\\telse {\\n\\t\\t\\tint slices = stack.getSize();\\n\\t\\t\\t//if (compositeImage) slices /= nChannels;\\n\\t\\t\\tif (slices<=0) slices = 1;\\n\\t\\t\\treturn slices;\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cdc6f577d4d6be6f2ef1c757b0818afa\",\n \"score\": \"0.7142355\",\n \"text\": \"public int yyInputStackSize ()\\r\\n {\\r\\n return _yyInputStack == null ? 0 : _yyInputStack.size ();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c2932e12dbbcac927d14a6c2d7ee2e7c\",\n \"score\": \"0.7090034\",\n \"text\": \"int getStack();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"af16068d1b66f9de3020e87a176c2c3a\",\n \"score\": \"0.7016422\",\n \"text\": \"public static <T> int size(MyStack<T> s) {\\n\\n\\t\\tif (s == null) {\\n\\t\\t\\tthrow new java.util.NoSuchElementException(\\\"Cannot operate on null stack\\\");\\n\\t\\t}\\n\\n\\t\\t// We don't want to modify the original stack\\n\\t\\t// Therefore, we must clone the original stack\\n\\t\\t// and perform operations on the cloned stack\\n\\t\\tvar clonedS = cloneStack(s);\\n\\n\\t\\tint length = 0;\\n\\t\\twhile (!clonedS.isEmpty()) {\\n\\t\\t\\tclonedS.pop();\\n\\t\\t\\tlength += 1;\\n\\t\\t}\\n\\n\\t\\treturn length;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7d99ccc6d24f058e14b8b7cb7af2f9e6\",\n \"score\": \"0.7010842\",\n \"text\": \"public int getMaxStack() {\\r\\n return max_stack;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"13e9d8f291cfa08770b372e2f4f7b8fd\",\n \"score\": \"0.70076686\",\n \"text\": \"public Integer getStackSize() {\\n\\treturn new Integer(-1);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c3779c7017efadde5e369fc681c38c97\",\n \"score\": \"0.698494\",\n \"text\": \"public int getStackMax() { return _stackmax; }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7de1a18ca694b470008009477aa3c3bb\",\n \"score\": \"0.6973468\",\n \"text\": \"public int getMaxStack() {\\r\\n return maxStack;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8f12654268a95e13e50f9495dc490fdd\",\n \"score\": \"0.6962847\",\n \"text\": \"@Test\\n public void testSize() throws Exception\\n {\\n assertEquals(0, stack.size());\\n\\n // Test for regular lab3.stack\\n stack.push(\\\"Top\\\");\\n stack.push(\\\"Topmost\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"230797ad278d6a559533814d7b9f8277\",\n \"score\": \"0.6858701\",\n \"text\": \"@Test\\n void testSizeAfterPushes(){\\n this.test.push(\\\"primeiro\\\");\\n this.test.push(\\\"segundo\\\");\\n this.test.push(\\\"terceiro\\\");\\n\\n assertEquals(3, this.test.size(), \\\"After 3 pushes the stack's size isn't returning 3\\\");\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"92be6dde92d5d1b54d58a4812d573058\",\n \"score\": \"0.6835288\",\n \"text\": \"public int getMaxStackable();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"19f53dca27125894433c8c2150af83d8\",\n \"score\": \"0.6806353\",\n \"text\": \"public int getStackSize() {\\n return elements.length;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"39e7a61a95234b9def65b8ff949ec9c9\",\n \"score\": \"0.6720694\",\n \"text\": \"@Test\\n\\tvoid testSize() {\\n\\t\\tmyStack.push(Integer.toString(5));\\n\\t\\tmyStack.push(Integer.toString(8));\\n\\t\\tassertEquals(myStack.size(), 2, \\\" should be 2\\\");\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8abaec23a0a33db592687066241e685c\",\n \"score\": \"0.670009\",\n \"text\": \"public int getGraphicsStackSize() {\\n return graphicsStack.size();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a10802489a4e7533574ff191d3f223a9\",\n \"score\": \"0.66665983\",\n \"text\": \"public static int getNumOfStacksNeeded(int length) {\\n\\treturn (int)((length-1)/ArrayStack.length() + 1);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"07615fd6d98afd32d37d0086bd70e80a\",\n \"score\": \"0.66389674\",\n \"text\": \"public int size() {\\n\\t\\t// replace this with your code\\n\\t\\treturn heapSize;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b8bca99b3396c4ebe4c287d3afc9c01d\",\n \"score\": \"0.66128695\",\n \"text\": \"public static int size_count() {\\n return (8 / 8);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"720321a62ab56557d9d3708eb5d77c47\",\n \"score\": \"0.6586302\",\n \"text\": \"public int size() {\\n\\t\\t// return size (have been keeping track of it in methods\\n\\t\\treturn size;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"68d66019091335d0aa4748eb63161ac1\",\n \"score\": \"0.65302396\",\n \"text\": \"@Test\\n public void whenUseGetSizeThenReturnSizeStack() {\\n String first = \\\"Test\\\";\\n String second = \\\"Bingo\\\";\\n link.push(first);\\n link.push(second);\\n int result = link.getSize();\\n assertThat(result, is(2));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"47cf7350c87ea00ff3d106a7a45836ad\",\n \"score\": \"0.65107197\",\n \"text\": \"public static int size_cnt() {\\n return (16 / 8);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d40457917fc8e09243786528b04497c9\",\n \"score\": \"0.64942926\",\n \"text\": \"public int getNumberOfElements(){\\n\\t\\tint count = 0;\\n\\t\\tfor(int i=0; i<stackArray.length; i++){\\n\\t\\t\\tif(stackArray[i] != null)\\n\\t\\t\\t\\tcount++;\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn count;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ac0aac8f0148bdf9451053f4ea9add42\",\n \"score\": \"0.6487802\",\n \"text\": \"public int sizeInBytes() {\\n int size = 0;\\n if (this.variable != null) {\\n size = 0 + 4;\\n }\\n return size + 4 + 4 + this.variables.sizeInBytes();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"477cf07aea57145fd98c7844f2bd1732\",\n \"score\": \"0.64773196\",\n \"text\": \"int size() {\\n\\t\\treturn heap.size();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"526f67d7aed4cc9bbbbe928a6be4427f\",\n \"score\": \"0.64015734\",\n \"text\": \"public int size() { \\n\\treturn top+1; \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5cb8bac90ee9c72ca77e3c8c5d117adf\",\n \"score\": \"0.63936687\",\n \"text\": \"public int getStack() {\\n return this.stack;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ced21fd9eba5613caed9cad557addf55\",\n \"score\": \"0.6390986\",\n \"text\": \"public float getStackSpace() {\\n return mStackSpace;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fd2aa4727fa38f4263f5f1701dc12d4a\",\n \"score\": \"0.63788545\",\n \"text\": \"protected final int getStackHeight(Point2 p) {\\n for (int i = 0; i < m_containerSpots[p.x].length; i++) {\\n if (m_containerSpots[p.x][i][p.y].container == null)\\n return i;\\n }\\n return m_containerSpots[p.x].length;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f29181a59d44d771a37bcff9d71a6681\",\n \"score\": \"0.6369386\",\n \"text\": \"public int size() {\\n return top + 1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd61efc186b78a120d239e87e2e3667b\",\n \"score\": \"0.6352451\",\n \"text\": \"public int size() {\\n return top + 1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"308a83fa404e4490fdfbde073d985455\",\n \"score\": \"0.6335088\",\n \"text\": \"@Test\\n void testSizeOnConstruction(){\\n assertEquals(0, this.test.size(), \\\"New stack size is not returning 0\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ff1364f7278e55352549e8d5990c5f5a\",\n \"score\": \"0.6306568\",\n \"text\": \"public static Integer size() {\\n\\t\\treturn count;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"be21e18f3fe33db975b3be9de9b87c4f\",\n \"score\": \"0.63059044\",\n \"text\": \"public int getCurrentSize();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"be21e18f3fe33db975b3be9de9b87c4f\",\n \"score\": \"0.63059044\",\n \"text\": \"public int getCurrentSize();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aba03f79d8629a31be75e13edd8c1799\",\n \"score\": \"0.6303986\",\n \"text\": \"public int size() {\\n\\t\\t/* your code here */\\n\\t\\tif (tail == null)\\n\\t\\t\\treturn 1;\\n\\t\\telse\\n\\t\\t\\treturn 1 + tail.size();\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"17f46c957fb1d708e3d4723f9b9a9bfb\",\n \"score\": \"0.62985176\",\n \"text\": \"public int getSlotStackLimit()\\n {\\n return 1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f2907c942b89eeebf15346bcacf2a720\",\n \"score\": \"0.62955046\",\n \"text\": \"public static int getBoardHeight() {\\n\\t\\tboolean[][] input = getFullStack();\\n\\t\\treturn input.length;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a690eb80c557bc6af41901196ebfa52b\",\n \"score\": \"0.629033\",\n \"text\": \"public int getSize () {\\n return top + 1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f3a5ce2c95c328be2a300b5540ff5607\",\n \"score\": \"0.6285147\",\n \"text\": \"public int getInventoryStackLimit()\\r\\n {\\r\\n return 64;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d5065393646da2190979c55f88497a0c\",\n \"score\": \"0.6285121\",\n \"text\": \"private void calculateStackmax()\\n {\\n _stackmax = 0;\\n int ptr = 0;\\n for (int i = 0; i < _tokenlist.length; ++i)\\n {\\n if (_tokenlist[i].getType() == Token.INSTRUCTION.CONSTANT || _tokenlist[i].getType() == Token.INSTRUCTION.VARIABLE)\\n ++ptr;\\n else if (_tokenlist[i].getType() == Token.INSTRUCTION.OPERATOR && _tokenlist[i].getData().getReal() < 6)\\n --ptr;\\n _stackmax = (ptr > _stackmax) ? ptr : _stackmax;\\n }\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b950c83260633def5552c3c488f8ee70\",\n \"score\": \"0.6278419\",\n \"text\": \"public int getStackDepth() { return stackDepth; }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"41ca9f367bcf8993cac116ef75a88d10\",\n \"score\": \"0.625808\",\n \"text\": \"public int size() {\\n // DO NOT MODIFY THIS METHOD!\\n return size;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d3b62e36f4ab7722258a395a8ea26db\",\n \"score\": \"0.62561303\",\n \"text\": \"public static int count() {\\r\\n \\treturn sizes.length;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9f85c98524facd1d6edf122e90da1c2c\",\n \"score\": \"0.6241821\",\n \"text\": \"public int getSizeInBytes() {\\n\\t\\treturn 4 + 4 + 4 + 4 + 4 + (tag.length()*2) + 4 + 4 + (8*frames.size());\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"837cad4a1d0c5f2baee487d20b9c1cc1\",\n \"score\": \"0.62414217\",\n \"text\": \"public int size(){\\n return top + 1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"141e733aab55787ba265c27003765ce7\",\n \"score\": \"0.62103945\",\n \"text\": \"public int size() {\\n // DO NOT MODIFY!\\n return size;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"141e733aab55787ba265c27003765ce7\",\n \"score\": \"0.62103945\",\n \"text\": \"public int size() {\\n // DO NOT MODIFY!\\n return size;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4d9d241d058f798fa62a300ef39fbc33\",\n \"score\": \"0.6204237\",\n \"text\": \"static int SIZEOF() {\\n\\t\\t\\treturn 256;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4d9d241d058f798fa62a300ef39fbc33\",\n \"score\": \"0.6204237\",\n \"text\": \"static int SIZEOF() {\\n\\t\\t\\treturn 256;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"81ae6b58622edec74534d3efa481bd9d\",\n \"score\": \"0.62010676\",\n \"text\": \"public int size() {\\r\\n LLNode<T> currNode = top;\\r\\n int size = 0;\\r\\n while(currNode != null) {\\r\\n size += 1;\\r\\n currNode = currNode.getLink();\\r\\n }\\r\\n return size;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ce071161c68b9cbaebbfcd05389418a\",\n \"score\": \"0.6181354\",\n \"text\": \"public int getTotalSize();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b111f91db22bb914df2c09329b79408f\",\n \"score\": \"0.6178552\",\n \"text\": \"private long getMaxEnergyStored(ItemStack stack) {\\n\\t\\treturn TeslaUtils.getCapacity(stack, null);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"034e5d554178ffac137eaabea630ab47\",\n \"score\": \"0.6172943\",\n \"text\": \"public int frameSize() {\\n numFrames = frames.size();//number of frames becomes equal to the size of the frames\\n return frames.size();//then it is returned\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d4fce001bdace4be14c965fb5253b799\",\n \"score\": \"0.61679715\",\n \"text\": \"public int sizeInBytes() {\\n\\t\\tint len = 1 + 4 + 4 + (srcImageTag.length()*2);\\t//{Collidable/Spawner}, hp, imageSourceLen name\\n\\t\\t//Add the sprites\\n\\t\\tlen += 8;\\t//Row and col of the spot on the spritesheet (for debug mode ease of access)\\n\\t\\tlen += 1;\\t//Is the entity savable (byte)\\n\\t\\tlen += 4;\\t//num sprites\\n\\t\\tfor (Sprite s : sprites) {\\n\\t\\t\\tlen += s.getSizeInBytes();\\n\\t\\t}\\n\\t\\treturn len;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fae7655ad84cc7d5cbbdb8a8e91b7cc0\",\n \"score\": \"0.6165453\",\n \"text\": \"public static int size_request() {\\n return (8 / 8);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6d7d7e84b63f20e4ccb9a4f302025c01\",\n \"score\": \"0.61628515\",\n \"text\": \"public int size () {\\r\\n\\t\\treturn size;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f58b80d37e7a90fabb09c0ca93c028bd\",\n \"score\": \"0.6156193\",\n \"text\": \"public int countOut() {\\n\\t\\tif (callCheck())\\n\\t\\t\\treturn EMPTY_STACK_VALUE+1;\\n\\t\\treturn numbers[total--];\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6f26dc8ddd20614cf8987fd6810611f6\",\n \"score\": \"0.6155866\",\n \"text\": \"public int size() {\\n // replace the code below to implement the size method\\n return size;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a21bd79298924c0b35b3acf89e9b53b9\",\n \"score\": \"0.6155008\",\n \"text\": \"public boolean isStackFull(){\\r\\n return (topOfStack==A.getSize()-1);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5d060639a205ea2bff3015479430cd1f\",\n \"score\": \"0.614295\",\n \"text\": \"public int getMaxFlow(FluidStack stack)\\n\\t{\\n\\t\\treturn 1000;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc5b5a344f3dc24ab73c44b71b1adda1\",\n \"score\": \"0.61371017\",\n \"text\": \"public int calculateGridSize() {\\n\\t\\tif (hasStack(2) || hasStack(5) || hasStack(6) || hasStack(7) || hasStack(8)) return 3;\\n\\t\\tif (hasStack(1) || hasStack(3) || hasStack(4)) return 2;\\n\\t\\tif (hasStack(0)) return 1;\\n\\n\\t\\treturn 0;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"602734dbe2a402a8f08e9337667a43ad\",\n \"score\": \"0.6131817\",\n \"text\": \"public int size() {\\n // recursive approach seems more perspicuous\\n if( headReference == null) return 0;\\n else return size( headReference);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8a6261f8f8860390b36732409917b0ca\",\n \"score\": \"0.6127575\",\n \"text\": \"public int getCurrentSize ()\\n {\\n return getCurrentSizeHelper ( headRef );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d966b97ac4ff6acb670068e435a946af\",\n \"score\": \"0.61179924\",\n \"text\": \"public int size() {\\n\\t\\treturn topIndex + 1;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"41051200632268bf9b6fcf97133a1779\",\n \"score\": \"0.61108947\",\n \"text\": \"public int size() {\\n\\t\\t//return the size counter\\n\\t\\treturn size;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ef47536cd8b43b2a65c589aae1d45242\",\n \"score\": \"0.6110594\",\n \"text\": \"int currentSize();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"96af65bbe470c752961f427f924c8cd6\",\n \"score\": \"0.61081344\",\n \"text\": \"protected synchronized int size() {\\n\\t\\tQueue<LogEntry> buff = getDeque();\\n\\t\\treturn buff.size();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ef6cc45025ae35dfebdb8f6c5a290f7f\",\n \"score\": \"0.6102934\",\n \"text\": \"public int size( )\\n {\\n return size;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0639b4c4cf8974d82e92983c792a9f68\",\n \"score\": \"0.61018807\",\n \"text\": \"public int size() {\\r\\n\\t\\t\\tint size = 1;\\r\\n\\t\\t\\tif(left != null) {\\r\\n\\t\\t\\t\\tsize += left.size();\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tif(right != null) {\\r\\n\\t\\t\\t\\tsize += right.size();\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\treturn size;\\r\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"38e37de238709c1faac3ae1fc1853581\",\n \"score\": \"0.60910845\",\n \"text\": \"public static void stack() {\\n Stack<Integer> s = new Stack<>(); // initialise\\n\\n s.push(5); // push a new element\\n s.empty(); // check if stack is empty\\n s.pop(); // pop an element\\n s.peek(); // get the top element of the stack\\n s.size(); // size of the stack\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1308f3a1b7cbf1d3bdf2861dc03ed6e2\",\n \"score\": \"0.60883695\",\n \"text\": \"private int getArity() {\\n return fp - (stack[fp - 1] + 3);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1002c951362169dff23a0c563714f61b\",\n \"score\": \"0.6085322\",\n \"text\": \"public int size() {\\n\\t\\treturn currSize;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ff8395b68d9bf06f8afdf9f47496472b\",\n \"score\": \"0.6078963\",\n \"text\": \"public int getCurrentSize() {\\n return count;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"724d1459934fa44d0acb4ffc585c1e62\",\n \"score\": \"0.6072425\",\n \"text\": \"static int SIZEOF() {\\n\\t\\t\\treturn 32;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"83b60840a3a082dffb315c453c61155c\",\n \"score\": \"0.6071037\",\n \"text\": \"public static int getSize()\\r\\n\\t{\\r\\n\\t\\treturn size;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b3d03aae02b0b9f7f1905b5868e5c64\",\n \"score\": \"0.6068594\",\n \"text\": \"private int getHandsStackSize(BufferedImage stackImage, int digitsCount,\\n\\t\\t\\tboolean isPlayerSittingAtTheTop) {\\n\\n\\t\\tint[] stackSize = new int[digitsCount];\\n\\t\\tint currXOffset = 0;\\n\\t\\tint currYOffset = 0;\\n\\n\\t\\t// TODO: change this stupid if\\n\\t\\tif (digitsCount < 2) {\\n\\t\\t\\treturn 5;\\n\\t\\t}\\n\\n\\t\\tif (isPlayerSittingAtTheTop) {\\n\\t\\t\\tcurrXOffset = upXOffset + (digitsAfterCommaCount - digitsCount)\\n\\t\\t\\t\\t\\t* leftDigitXDifference;\\n\\t\\t\\tcurrYOffset = upYOffset;\\n\\t\\t} else {\\n\\t\\t\\tcurrXOffset = downXOffset + (digitsAfterCommaCount - digitsCount)\\n\\t\\t\\t\\t\\t* leftDigitXDifference;\\n\\t\\t\\tcurrYOffset = downYOffset;\\n\\t\\t}\\n\\n\\t\\tfor (int i = 0; i < digitsCount; i++) {\\n\\n\\t\\t\\t// System.out.println(\\\"SUBIMAGE: x=\\\"\\n\\t\\t\\t// + (currXOffset + (digitWithSpaceWidth * i)) + \\\", y=\\\"\\n\\t\\t\\t// + currYOffset);\\n\\n\\t\\t\\tstackSize[i] = digitReader.getDigit(stackImage.getSubimage(\\n\\t\\t\\t\\t\\tcurrXOffset + (digitWithSpaceWidth * i), currYOffset,\\n\\t\\t\\t\\t\\tdigitWidth, digitHeight));\\n\\n\\t\\t}\\n\\n\\t\\treturn NumberFormatter.getIntFromDigits(stackSize);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a7e92455ddf0170afa4a41efbceb3de2\",\n \"score\": \"0.6065396\",\n \"text\": \"protected int getQueueSize(){\\n\\t\\tif(\\tthis.m_queue!=null){\\n\\t\\t\\treturn \\tthis.m_queue.queueSize();\\n\\t\\t}\\n\\t\\treturn 0;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4c76e164fbe8c95b808a1ff26a57ab47\",\n \"score\": \"0.60588026\",\n \"text\": \"@Test\\n public void doubleStackFirstStackSizeConstantAfterGettingTop() {\\n IDoubleStack doubleStack = getFactory().makeDoubleStack(DEFAULT_MAX_SIZE);\\n IStack firstStack = doubleStack.getFirstStack();\\n for (int i = 0; i < DEFAULT_MAX_SIZE; i++) {\\n firstStack.push(new Integer(i));\\n }\\n int sizeBeforeGettingTop = firstStack.size();\\n firstStack.top();\\n assertEquals(sizeBeforeGettingTop, firstStack.size());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8d21a85e6364c8ef587db9ff7f9f0cde\",\n \"score\": \"0.6057332\",\n \"text\": \"public int size(){\\n\\t\\treturn this.size;\\n\\t\\t//Runs in O(1) time since we are returning an already defined variable, which takes constant time.\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eddb4a1f4f555a6edb221bc0e812a01a\",\n \"score\": \"0.6057267\",\n \"text\": \"@Test\\n public void StackSize() {\\n NewStack newStack = new NewStack(listSet.size());\\n\\n assertEquals(-1, newStack.size());\\n\\n for(Lego lego : listSet) {\\n newStack.push(lego);\\n }\\n\\n // Een lege stack return -1 als grootte. Vandaar dat van de verwachte stack 1 wordt afgetrokken.\\n assertEquals(listSet.size() - 1, newStack.size());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"95c72a84619e4e3535a82dd507983f01\",\n \"score\": \"0.6054096\",\n \"text\": \"@Test\\n public void pushMethodTest_pushManyElementsToLStack_sizeShouldNotBeZero() {\\n final int numberOfPushedElements = 100;\\n //Arrange\\n for (int i = 0; i < numberOfPushedElements; i++) {\\n this.testStack.push(i);\\n }\\n int expected = numberOfPushedElements;\\n //Act\\n int actual = this.testStack.size();\\n //Assert\\n Assert.assertEquals(\\n \\\"LStack's size after pushing an element should not be zero!\\\", expected, actual);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4792a4ea4ec9e40b80f8eaff4b6f4d4f\",\n \"score\": \"0.60539484\",\n \"text\": \"int treeSize() {\\r\\n\\t\\treturn\\r\\n\\t\\t\\tmemSize()\\r\\n\\t\\t\\t+ (this.preDDocs.listSize())\\r\\n\\t\\t\\t+ (this.modifiers.listSize())\\r\\n\\t\\t\\t+ (this.postModifiers.listSize())\\r\\n\\t\\t\\t+ (this.returnType == null ? 0 : getReturnType().treeSize())\\r\\n\\t\\t\\t+ (this.name == null ? 0 : getName().treeSize())\\r\\n\\t\\t\\t+ (this.templateParameters.listSize())\\r\\n\\t\\t\\t+ (this.arguments.listSize())\\r\\n\\t\\t\\t+ (this.constraint == null ? 0 : getConstraint().treeSize())\\r\\n\\t\\t\\t+ (this.precondition == null ? 0 : getPrecondition().treeSize())\\r\\n\\t\\t\\t+ (this.postcondition == null ? 0 : getPostcondition().treeSize())\\r\\n\\t\\t\\t+ (this.postconditionVariableName == null ? 0 : getPostconditionVariableName().treeSize())\\r\\n\\t\\t\\t+ (this.body == null ? 0 : getBody().treeSize())\\r\\n\\t\\t\\t+ (this.postDDoc == null ? 0 : getPostDDoc().treeSize())\\r\\n\\t;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d95d72ab7b18cee4a4f26a4e97b32b6d\",\n \"score\": \"0.60513115\",\n \"text\": \"public boolean isStackFull() {\\n\\t\\treturn (top == stackSize - 1);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f311b670f39bd25d1eed81909fc6a383\",\n \"score\": \"0.6042819\",\n \"text\": \"public final int size ()\\n {\\n return _size;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3748bce112923721e9023fc3fde52e1b\",\n \"score\": \"0.60374266\",\n \"text\": \"private int size(){\\n return theQueue.getSize();\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":38,"numItemsPerPage":100,"numTotalItems":995064,"offset":3800,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3ODk1NzczNiwic3ViIjoiL2RhdGFzZXRzL250aGFrdXIvY29ybnN0YWNrLWphdmEtdjEtdGV2YXRyb24tMU0iLCJleHAiOjE3Nzg5NjEzMzYsImlzcyI6Imh0dHBzOi8vaHVnZ2luZ2ZhY2UuY28ifQ.fRMjYx5KmU4EDfKrUL6kS27uLNnWpO7F-471un1MzVmyFJpR4SIbZhqSAfos3mMHwKbBqv5GsMWN3XpnM_65AQ","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":995064,"numBytesParquet":17569818855}]},"discussionsStats":{"closed":0,"open":0,"total":0},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
query_id stringlengths 32 32 | query stringlengths 7 129k | positive_passages listlengths 1 1 | negative_passages listlengths 88 101 |
|---|---|---|---|
968c75845cac271c63ae9a744a7a7e99 | Created with IntelliJ IDEA. | [
{
"docid": "7ec1c8f92548a3df99fc20a018b7b5d2",
"score": "0.0",
"text": "public interface SourceUserTokenRepository extends CrudRepository<SourceUserToken,Long>,\n JpaSpecificationExecutor<SourceUserToken> {\n}",
"title": ""
}
] | [
{
"docid": "8f31ed4dec33eaea2bc3912ffe04ab5c",
"score": "0.63245845",
"text": "private CodeCamp() {\n \n }",
"title": ""
},
{
"docid": "bdc1683df7d1d6b2d988cd3acab4903e",
"score": "0.6292495",
"text": "public void mo5201a() {\n }",
"title": ""... |
7ef7fb3ec79f72aa0f4b75c96c1af2fa | / 191: / 192: | [
{
"docid": "f23a3250fe5a15a41040d7d4e19268f7",
"score": "0.0",
"text": "public MediaType getContentType()\r\n/* 193: */ {\r\n/* 194:289 */ String value = getFirst(\"Content-Type\");\r\n/* 195:290 */ return value != null ? MediaType.parseMediaType(value) : null;\r\n/* 196: */ }",
"t... | [
{
"docid": "6f73acb43c1f4d18104547a83493c266",
"score": "0.5434775",
"text": "private String processBytes(String bytes){\n Pattern p = Pattern.compile(\"170-180\");\r\n Matcher m = p.matcher(bytes);\r\n //find two bounds\r\n int posi[] = new int[2];\r\n for(int i=0;i<2;i++){\r\n... |
e0d0927aaae0a8fa670bcf627cda37e9 | $ANTLR end "rule__Device__Alternatives_6" $ANTLR start "rule__FetchData__Alternatives_3" InternalIoT.g:755:1: rule__FetchData__Alternatives_3 : ( ( ( rule__FetchData__Group_3_0__0 ) ) | ( ( rule__FetchData__Group_3_1__0 ) ) ); | [
{
"docid": "112629c78bba0095bb0321633ccab868",
"score": "0.78659976",
"text": "public final void rule__FetchData__Alternatives_3() throws RecognitionException {\r\n\r\n \t\tint stackSize = keepStackSize();\r\n \t\r\n try {\r\n // InternalIoT.g:759:1: ( ( ( rule__FetchData... | [
{
"docid": "fde1e62e62cd9568536ab65b385c0c5d",
"score": "0.79431045",
"text": "public final void rule__FetchData__Group__3__Impl() throws RecognitionException {\r\n\r\n \t\tint stackSize = keepStackSize();\r\n \t\r\n try {\r\n // InternalIoT.g:2832:1: ( ( ( rule__FetchDat... |
944d3501bdf69feb8bead0a5bbdb82e1 | Construct a new square dotted outline object with the same width and fill paint as the given dotted outline object. | [
{
"docid": "9b59d0b226a2e44a5fe763d43a7074d7",
"score": "0.63687944",
"text": "public SquareDottedOutline\n\t\t(SquareDottedOutline theOutline)\n\t\t{\n\t\tmyWidth = theOutline.myWidth;\n\t\tmyFill = theOutline.myFill;\n\t\tcomputeStroke();\n\t\t}",
"title": ""
}
] | [
{
"docid": "8e1f333f1309af273972c418d8b2aa4f",
"score": "0.74589765",
"text": "public SquareDottedOutline()\n\t\t{\n\t\tmyWidth = NORMAL_WIDTH;\n\t\tmyFill = NORMAL_FILL;\n\t\tcomputeStroke();\n\t\t}",
"title": ""
},
{
"docid": "77db97b3c35c8cc36522338e6f0fd83e",
"score": "0.599985",
... |
f517cb0ae567cd4096a6ffebe1944d22 | DATABASE CHECK Inits the connection. Here it tries to run database script to create tables if not exists. | [
{
"docid": "433e2a9c47ad74c2e49e754b0d1d2412",
"score": "0.0",
"text": "public static void init() throws FileNotFoundException, IOException, SQLException, URISyntaxException {\r\n\r\n\t\ttry (InputStream fileStream = new FileInputStream(DATABASE_PROPERTIES_FILENAME)) {\r\n\r\n\t\t\tprops.load(fileStream... | [
{
"docid": "76547210bb465d22524f4191be8179c3",
"score": "0.72904104",
"text": "public void checkDB()\n {\n try {\n initializeDB();\n } catch (SQLException sqle) {\n sqle.printStackTrace();\n }\n\n }",
"title": ""
},
{
"docid": "672a2b4d2ca0e7fa7a8b07bc28fd3b6e",
"sco... |
a3d216371428f4660b349dfe33898f45 | Verify text in all column | [
{
"docid": "2c34e1e781ca28d7fa5dad4815ac8a35",
"score": "0.6328355",
"text": "public boolean isTextEqualsInColumn(String columnName, String cellValue) {\n if(cellValue.equals(\"EMPTY_STRING\")){\n cellValue = \"\";\n }\n List<String> headerList = getHeadingsAsString();\n ... | [
{
"docid": "5ba723529d9de85e53563886575935f9",
"score": "0.66144806",
"text": "public boolean checkText(CanvasPanelTable canvasPanelTable){\r\n\t\ttry{\r\n\t\t\tint row = Integer.parseInt(rowBox.getText());\r\n\t\t\tint col = Integer.parseInt(colBox.getText());\r\n\t\t\tif(row > 0 && col > 0 ){\r\n\t\t\... |
90ee68fcd182498e6a1d1b336b537a07 | Removes defined hash from the suite | [
{
"docid": "89cc13114d0d3fe6c5fa24336ad5fdbf",
"score": "0.5889792",
"text": "public void RemoveRipemd128() {\n\n if (this.suite[Hashes.RIPEMD_128.ordinal()] != null) {\n this.suite[Hashes.RIPEMD_128.ordinal()] = null;\n this.selfCreatedHash[Hashes.RIPEMD_128.ordinal()] = fa... | [
{
"docid": "40cea80ac40c162511533c2825f66a2f",
"score": "0.74164623",
"text": "public void Remove(Hashes hash) {\n\n if (this.suite[hash.ordinal()] != null) {\n if (this.selfCreatedHash[hash.ordinal()]) {\n this.suite[hash.ordinal()] = null;\n }\n t... |
03caf41083af07e8b5b28311cf9f2e7f | Returns the maximum number of days kept in memory for message counter. | [
{
"docid": "3ef17dbb2b04f2ad10b177685e3c570e",
"score": "0.8678009",
"text": "@Attribute(desc = \"Maximum number of days kept in memory for message counter\")\n int getMessageCounterMaxDayCount();",
"title": ""
}
] | [
{
"docid": "b977e81e759184f83c153f3e9fd76aaa",
"score": "0.71895576",
"text": "@Attribute(desc = \"Maximum number of days kept in memory for message counter\")\n void setMessageCounterMaxDayCount(int count) throws Exception;",
"title": ""
},
{
"docid": "2b63c176979582e491dc45c50136192e",
... |
93a48b66e785222d071991983c0b076e | Do something in response to button click Intents are objects of the android.content.Intent type. Your code can send them to the Android system defining the components you are targeting. Intent to start an activity called SecondActivity with the following code: | [
{
"docid": "f6def1f03918d4c56788a99fe6810243",
"score": "0.67305565",
"text": "public void onClick(View v) {\n String problem = \"Energy Management\";\r\n aim = new Intention(problem, 1, 0);\r\n Intent intent = new Intent(Business.this, Result.class);\r\n ... | [
{
"docid": "b7fe7271b623e32526d48dc0ab9a646d",
"score": "0.756363",
"text": "public void onClick(View arg0) {\n Intent i = new Intent(getApplicationContext(), SecondScreenActivity.class);\n \n // starting new activity\n ... |
3007903164d38cc0bb5ed42ab9b6ffa5 | TODO: Return the communication channel to the service. | [
{
"docid": "d07fd9e3a63aad74a1d8b467b2c0b8e2",
"score": "0.0",
"text": "@Override\n public IBinder onBind(Intent intent) {\n return null;\n }",
"title": ""
}
] | [
{
"docid": "e95b7cc6aa35f650687f6516b3f55221",
"score": "0.743544",
"text": "Channel getChannel();",
"title": ""
},
{
"docid": "a29caee598771b5f015b1e17ca12dd69",
"score": "0.7319032",
"text": "public ChannelObject getChannel() { return channel; }",
"title": ""
},
{
"doci... |
ef5b1263416d2daa513d7fe7e5048e00 | .vega.commands.v1.NodeSignature node_signature = 2003 [json_name = "nodeSignature"]; | [
{
"docid": "2c2c3bc50878b8cba249c7c36d7f2a7c",
"score": "0.54594254",
"text": "@java.lang.Override\n public boolean hasNodeSignature() {\n return commandCase_ == 2003;\n }",
"title": ""
}
] | [
{
"docid": "fb3432fba10b72930f77da1acabfbd92",
"score": "0.81726503",
"text": "io.vegaprotocol.vega.commands.v1.ValidatorCommands.NodeSignature getNodeSignature();",
"title": ""
},
{
"docid": "b050522f150553df487fe0e33ba51857",
"score": "0.74676085",
"text": "io.vegaprotocol.vega.com... |
e95f44c42fc673dd06c419603ac84156 | First stage RPN localization loss weight. optional float first_stage_localization_loss_weight = 16 [default = 1]; | [
{
"docid": "282d16542634aed15c5b7bcc2541e595",
"score": "0.755301",
"text": "@java.lang.Override\n public float getFirstStageLocalizationLossWeight() {\n return firstStageLocalizationLossWeight_;\n }",
"title": ""
}
] | [
{
"docid": "1bd60a9dea283b0bb25efc62f5079ce6",
"score": "0.7742223",
"text": "float getFirstStageLocalizationLossWeight();",
"title": ""
},
{
"docid": "8a12164612ae886c55fcbde1f9101111",
"score": "0.75490606",
"text": "@java.lang.Override\n public float getFirstStageLocalizationLo... |
942026660c148b3407c6c1527dc9bc65 | Returns a new instance of this icon with specified dimensions. | [
{
"docid": "5833dfe0dfeedb3b1f8ed165067f0b96",
"score": "0.6586549",
"text": "public static RadianceIcon of(int width, int height) {\n ext_bmp base = new ext_bmp();\n base.width = width;\n base.height = height;\n return base;\n }",
"title": ""
}
] | [
{
"docid": "b35e88e48be3e45a0fe3ba2a7f0d1cab",
"score": "0.6741007",
"text": "public static ResizableIcon of(int width, int height) {\n Mail_forward base = new Mail_forward();\n base.width = width;\n base.height = height;\n return base;\n }",
"title": ""
},
{
"doci... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "f6041681535d699cc434e2b914d2e8c4",
"score": "0.0",
"text": "public static void main(String[] args) {\n\t\tScanner sc=new Scanner(System.in);\r\n\t\tSystem.out.println(\"enter a number\");\r\n\t\tint a=sc.nextInt();\r\n\t\tSystem.out.println(\"enter b number \");\r\n\t\tint b=sc.nextInt();\r\... | [
{
"docid": "1acc57d42c31dee937ac33ea6f2a5b0b",
"score": "0.68399656",
"text": "@Override\r\n\tpublic void comer() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "118f2b8a20f48999973063ac332d07d3",
"score": "0.6563993",
"text": "@Override\r\n\t\t\tpublic void atras() {\n\r\n\t\t\t}",
... |
47978f7ef64ece1f71009e7e1def32ea | Callback invoked when a new MQTT message is received The payload structure is as follows considering bytes: 6: Sniffer MAC 6: Source MAC (that can be either global or locally administered) 2: Sequence Number of packet 1: SSID len up to 32: SSID 16: fp Since all the analysis needed can be made on text data we can serial... | [
{
"docid": "f138b5ec3decfd380dff2db155b9dc51",
"score": "0.77706546",
"text": "@Override\n public void messageArrived(String s, MqttMessage mqttMessage) throws Exception {\n try {\n String time = new Timestamp(System.currentTimeMillis()).toString();\n String payload = Hel... | [
{
"docid": "9a05acf746af7738155bb55425ada66a",
"score": "0.61241764",
"text": "public void onMessageArrived(String topic, byte [] payload, int qos, boolean retained);",
"title": ""
},
{
"docid": "4fe177ea32664fb582e08c477c07c518",
"score": "0.5924395",
"text": "@Override\n ... |
77910eac287c4c48fc1a4212ef5fff11 | This method creates a Lucene index for all the model folders in the folder "folderName" | [
{
"docid": "20ac1c12bf734f0e63f87afe380c1cce",
"score": "0.8294726",
"text": "public void createLuceneIndexes(String folderName)\n\t{\t\t\n\t\tFile file = new File(folderName);\n\t\tString[] names = file.list();\n\n\t\tfor(String name : names)\n\t\t{\n\t\t\t// TODO: HARDCODING! Assuming that the model f... | [
{
"docid": "4ceadc87ca815a87cfe9c8f08c8ac3ce",
"score": "0.7368874",
"text": "public void buildIndex(String folderName, String indexStorageFolder) throws IOException{\n\t\t// 0. Specify the analyzer for tokenizing text.\n\t\t// The same analyzer should be used for indexing and searching\n\t\tStandard... |
711104c3ef4682855d37474691df2791 | get programe by package name | [
{
"docid": "e542dedc489f1b923c058cbe3f9c8eef",
"score": "0.6849401",
"text": "public Programe getProgrameByPackageName(Context context, String packageName) {\r\n if (Build.VERSION.SDK_INT < ANDROID_M) {\r\n List<Programe> processList = getRunningProcess(context);\r\n for (Pr... | [
{
"docid": "b02a30e3b65ca5f0212dcd54bd274bf6",
"score": "0.7061478",
"text": "String getPackage();",
"title": ""
},
{
"docid": "35c5b358e434ded4add9ff5fda0c6432",
"score": "0.67739695",
"text": "public java.lang.String getPackageName();",
"title": ""
},
{
"docid": "d2f766... |
89de11cfd2e7bda1b77e7a6c99d8d545 | Flush everything out to disk and remove all purgeable imaged objects from memory. This doesn't clear the ShepherdMap table. This will have to be a weak table, and then the destruction of a shepherd or shepherdStub should remove it from myShepherdMap. | [
{
"docid": "99f12bca25b01925f9ef417efb8b8cda",
"score": "0.7304139",
"text": "public void purge() {\n/*\nudanax-top.st:16722:FakePacker methodsFor: 'transactions'!\n{void} purge\n\t\"Flush everything out to disk and remove all purgeable imaged\n\t objects from memory. This doesn't clear the ShepherdMap... | [
{
"docid": "4bbc1dce15b8d8bcbe28ef60b2fc8975",
"score": "0.65730315",
"text": "public void clear() {\n\t\t//Kill all entities\n\t\tentities.parallelStream().forEach(e -> e.kill());\n\n\t\t//Clear the lists\n\t\tentities.clear();\n\t\tdrawables.clear();\n\t\tcollidables.clear();\n\t}",
"title": ""
... |
dbcc8ca0dc634523b88153862eddbcd3 | Created by mavarazy on 12/8/14. | [
{
"docid": "71e05a552544bab5ccbe0389e956ecd6",
"score": "0.0",
"text": "public interface PendingPlayerPhoneRepository extends MongoRepository<PendingPlayerPhone, String> {\n}",
"title": ""
}
] | [
{
"docid": "40be4915804d3229e08fed067ec03fd6",
"score": "0.63403314",
"text": "Bug_616419() {\r\n\t}",
"title": ""
},
{
"docid": "27bc40cf2c5e26e0bf8b70807e0bcaed",
"score": "0.60952187",
"text": "@Override\r\n\tpublic void caminar() {\n\t\t\r\n\t}",
"title": ""
},
{
"doc... |
5f306a41cd16e1d8effb50da8023d522 | optional string pgm_open_tp = 8; | [
{
"docid": "d821782f9e62b7f02ffaa9bb733a34c7",
"score": "0.52550983",
"text": "public java.lang.String getPgmOpenTp() {\n java.lang.Object ref = pgmOpenTp_;\n if (ref instanceof java.lang.String) {\n return (java.lang.String) ref;\n } else {\n com.google.protobuf.ByteString ... | [
{
"docid": "d59be8834c7a92c6fc2f56756b887bdc",
"score": "0.531422",
"text": "public java.lang.String getPgmOpenTp() {\n java.lang.Object ref = pgmOpenTp_;\n if (!(ref instanceof java.lang.String)) {\n java.lang.String s = ((com.google.protobuf.ByteString) ref)\n .toSt... |
96293a79a6dd5e65f563d46728a16214 | Loops through "known" humans and eats them, so they should now be inside the "lastEaten" ArrayList of the humans HashMap | [
{
"docid": "5c625c77f976df98568680224345d364",
"score": "0.0",
"text": "public void eat() {\n\n }",
"title": ""
}
] | [
{
"docid": "325b4c7c041132b1d0bcff1d69f2a5a3",
"score": "0.6247509",
"text": "protected void cmdHateAll(CommandSender sender) {\n TrackedParticle particle = new TrackedParticle(Particle.VILLAGER_ANGRY, CONFIG.PLAYER_MS);\n for (Player player : Bukkit.getOnlinePlayers()) {\n if (... |
4e8164d25b7f00b75ebb88ab991ef50b | Fill Values data by reading ObjectInputStream. | [
{
"docid": "c677cc07b74314da971a6fa1dcf72950",
"score": "0.6563026",
"text": "public void readValuesData(DataInputStream dis, ObjectInputStream ois) {\n try {\n\n\t\t\tint length = 0;\n\t\t\n\t\t\t\t\t\tthis.AddressLine1 = readString(dis,ois);\n\t\t\t\t\t\n\t\t\t\t\t\tthis.AddressLine2 = readStri... | [
{
"docid": "e5486d27d37b2edd548d2b52950190df",
"score": "0.6922912",
"text": "public void readValuesData(DataInputStream dis, ObjectInputStream ois) {\n try {\n\n\t\t\tint length = 0;\n\t\t\n\n\t\t\n\n }\n\n\t\t\n \tfinally {}\n\n }",
"title": ""
},
{
"docid": "65123f... |
66ac13f4a1d1129e4c1881452eb5684e | An internationalized wrapper call to log4j's error method | [
{
"docid": "b89062c0cd77f6397afa05a1aefe41d6",
"score": "0.0",
"text": "public void error( String code, Object arg0 ) {\n\t if ( isErrorEnabled() ) {\n\t\tObject[] args = { arg0 };\n\t\terror( code, args );\n\t }\n\t}",
"title": ""
}
] | [
{
"docid": "3917797562250b1e3cf981e87a0911c8",
"score": "0.70254254",
"text": "public void error(String logMessage);",
"title": ""
},
{
"docid": "db14e11ab5a213591342f5bb5ffc812e",
"score": "0.6961155",
"text": "public void error(String logMessage,Exception e);",
"title": ""
},... |
1cead01904f5740842e0c22cdb1b0679 | is the user's head leaning back relative to his torso? | [
{
"docid": "f83e19f810f6bd0d73690ac5139289dc",
"score": "0.63405395",
"text": "private void leanBack(int userID,\n\t\t\tHashMap<SkeletonJoint, SkeletonJointPosition> skel) {\n\t\tPoint3D torsoPt = SkeletonUtility.getJointPosition(skel, SkeletonJoint.TORSO);\n\t\tPoint3D headPt = SkeletonUtility.getJoint... | [
{
"docid": "32e829bfdcf0c9e189cc1a4b836fd5cf",
"score": "0.6419882",
"text": "boolean hasRobotelo();",
"title": ""
},
{
"docid": "5f0db23e45bc4a3ad11a5cf3d1e3acb9",
"score": "0.6149818",
"text": "public boolean isOnLadder()\n {\n \t// let's not climb\n return false;\n ... |
76bf02ab056c83d290a51805fc4c0cd8 | Sets the left child. | [
{
"docid": "14718f4130c47b2608d55ec5adcd0ac4",
"score": "0.67735755",
"text": "public void setLeftTree(NodeLeaf leftTree) {\n\t\tthis.leftTree = leftTree;\n\t}",
"title": ""
}
] | [
{
"docid": "dc193737e6b6b71a0db5b46269712e4f",
"score": "0.8509406",
"text": "public void setLeftChild(Node leftChild) {\n this.leftChild = leftChild;\n }",
"title": ""
},
{
"docid": "727951e5f63e1fc2306afefcbe3d2307",
"score": "0.8465965",
"text": "public void setLeftChild... |
b083b0fb8ee86a9c68682aebf9993fe3 | org.exolab.castor.types.Date getDtDTContactOccurred() Returns the value of field 'dtDtMonthlySummBegin'. | [
{
"docid": "41d6df9203f8ba38edbafba3eb5e326e",
"score": "0.6793998",
"text": "public org.exolab.castor.types.Date getDtDtMonthlySummBegin()\r\n {\r\n return this._dtDtMonthlySummBegin;\r\n }",
"title": ""
}
] | [
{
"docid": "1b67c66bfea8218909e73b2ccdf04331",
"score": "0.7761276",
"text": "public org.exolab.castor.types.Date getDtDTContactOccurred()\r\n {\r\n return this._dtDTContactOccurred;\r\n }",
"title": ""
},
{
"docid": "ccd688b9fb3d76c4d852bc068e5a1077",
"score": "0.76579314",... |
50df350cf4e19f1890ab7413d335ded3 | This method was generated by MyBatis Generator. This method corresponds to the database table edu.agent_relation | [
{
"docid": "17acefb467f105943e87e4526b244338",
"score": "0.44917762",
"text": "int insertSelective(AgentRelation record);",
"title": ""
}
] | [
{
"docid": "a976b6d1f1c9b9c6c591dd8a3400fb8f",
"score": "0.59587264",
"text": "@Select({ \"select\", \"agent_id, refer_agent, register_date\",\n\t\t\t\"from edu.agent_relation\",\n\t\t\t\"where agent_id = #{agent_id,jdbcType=NUMERIC}\",\n\t\t\t\"and refer_agent = #{refer_agent,jdbcType=NUMERIC}\" })\n\t... |
d6643695506fe070f393fcae2ca8f6cd | method to add interest | [
{
"docid": "6ba7043db3d066675a62a1341d5cbaf0",
"score": "0.79288477",
"text": "public void addInterest(double interest) {\n this.setBalance(this.getBalance()*(1+interest));\n }",
"title": ""
}
] | [
{
"docid": "ad159a82e4b02681b3e829754b1ef62f",
"score": "0.8446307",
"text": "public void addInterest() {\n\t\t\n\t\tbalance += balance * (interest/100);\n\t}",
"title": ""
},
{
"docid": "6155a306857ffecfe1dfbb6ca9f1a444",
"score": "0.8248351",
"text": "public void addInterest()\r\n\... |
a3d3f8c8ac277b79fa7d0a5d64bb5d6b | Returns the variable value for state. | [
{
"docid": "a882a3c15908b78f7179974299200562",
"score": "0.7348217",
"text": "public String getstate() {\n return (String)ensureVariableManager().getVariableValue(\"state\");\n }",
"title": ""
}
] | [
{
"docid": "a7ad82ed156973042f5bd47a6c0e0c1a",
"score": "0.76131296",
"text": "public String getValue() throws UPNPResponseException, IOException {\n\t\tif (stateVarMsg == null) {\n\t\t\tsynchronized (this) {\n\t\t\t\tif (stateVarMsg == null) {\n\t\t\t\t\tUPNPMessageFactory factory = UPNPMessageFactory.... |
a2430e6e9222b676ce6e9afdcc621af1 | Adds the two given AmusingPreciseNumbers, leaving the two AmusingPreciseNumbers given as arguments unchanged. | [
{
"docid": "343e7ddbb82e59175778090e78b77084",
"score": "0.7428203",
"text": "public static AmusingPreciseNumber add(AmusingPreciseNumber numb1, AmusingPreciseNumber numb2) {\r\n\t\tAmusingPreciseNumber temp1 = new AmusingPreciseNumber(numb1);\r\n\t\tAmusingPreciseNumber temp2 = new AmusingPreciseNumber... | [
{
"docid": "4a6fdeb9cc4f3418892443f5b30d2f84",
"score": "0.6799118",
"text": "public void add(AmusingPreciseNumber numb) {\r\n\t\tint carry = 0;\r\n\t\tboolean executed = false;\r\n\t\tboolean equal = contentsAreEqual(numb);\r\n\t\texecuted = checkSignsAdditive(numb, equal);\r\n\t\taddDecimals(numb);\r\... |
b29b68a7e89166f966e4f2eff97e7ae5 | Load values from the LocaleOption | [
{
"docid": "d7a77087c6b0ad0cf8dbe52d830b7b4f",
"score": "0.67954016",
"text": "void load() {\r\n final LocaleOption localeOption = LocaleOption.getDefault();\r\n \r\n final String[] datePatternsList = localeOption.getDatePatternList();\r\n this.datePatternsPE = PropertyEditor... | [
{
"docid": "e8fcb7bbf49fb08d77dcaa07d4e056f4",
"score": "0.6807357",
"text": "public void loadLocale(){\n SharedPreferences prefs = getSharedPreferences(\"Settings\", Activity.MODE_PRIVATE);\n String language = prefs.getString(\"My_Lang\", \"\");\n setLocale(language);\n }",
... |
0158fc8aee7f8cab06aed74c57121d99 | This method is used to check if graph is connected or not | [
{
"docid": "0380d30ccb535837c17d026e8dc0dc0e",
"score": "0.7775929",
"text": "@Override\n\tpublic boolean isConnected() \n\t{\n\t\tboolean visited[] = new boolean[noOfVertices];\n\t\tvisited = dfs(0, visited);\n\t\tfor(boolean visit : visited) \n\t\t{\n\t\t\tif(!visit)\n\t\t\t{\n\t\t\t\treturn false;\n\... | [
{
"docid": "86c37ade70bc70667351937d4fccf629",
"score": "0.8850499",
"text": "boolean isConnected() throws GraphTrouble;",
"title": ""
},
{
"docid": "dcde4c451f287d99111641aa739ffa72",
"score": "0.82957625",
"text": "public boolean isConnected() {\n\t\tGraph g = getConnectedComponent... |
c9eb461fbc120262dda91c9b647eeb73 | Check if the user has the given restriction set. Default to true if error occured during calling UserManager, so it fails safe. | [
{
"docid": "40f17a91622e88e56a7e171afdd98771",
"score": "0.7287997",
"text": "private boolean hasRestriction(String restriction, int userId) {\n try {\n return mUm.hasUserRestriction(restriction, userId);\n } catch (RemoteException e) {\n Slog.e(TAG, \"Remote Exceptio... | [
{
"docid": "6ab6239a4ba18d2882461e26f6c6c274",
"score": "0.64747703",
"text": "public boolean isValidUser() {\r\n return !usernotfound;\r\n }",
"title": ""
},
{
"docid": "3427aa250c8ccbbe54785aa60027d7d2",
"score": "0.63666445",
"text": "boolean hasRestriction();",
"tit... |
e1026bfc4efa7d28fbb3cad68a3259c3 | Returns the number of anagraficas. | [
{
"docid": "23fce0e03beb60e12ded0e98591316da",
"score": "0.0",
"text": "public static int countAll()\n\t\tthrows com.liferay.portal.kernel.exception.SystemException {\n\t\treturn getPersistence().countAll();\n\t}",
"title": ""
}
] | [
{
"docid": "3af3e1ead71022bbf5474e333b2cd6e8",
"score": "0.73463017",
"text": "int getAnysCount();",
"title": ""
},
{
"docid": "710cf63d344fc35aa26b35e76bf70638",
"score": "0.71631795",
"text": "public int countTotalAnuncios() throws Exception {\n\t\t\r\n\t\tAnuncioCriteria anuncioCr... |
518bf5364cda3c6202a1a392996f93d1 | Inflate the menu; this adds items to the action bar if it is present. | [
{
"docid": "3d581f8da4e634e0c085638e968bf6dd",
"score": "0.0",
"text": "@Override\n public boolean onCreateOptionsMenu(Menu menu) {\n getMenuInflater().inflate(R.menu.main, menu);\n return true;\n }",
"title": ""
}
] | [
{
"docid": "d74efebd6fe79f46209a7e8cb2c52d89",
"score": "0.71840715",
"text": "@Override\n\tpublic boolean onCreateOptionsMenu(Menu menu) {\n\t\tMenuInflater mif= getMenuInflater();\n\t\tmif.inflate(R.menu.main_activity_action, menu);\n\t\treturn super.onCreateOptionsMenu(menu);\n\t}",
"title": ""
... |
9cb3bc213c61d643fe2d22dcf4d27ad6 | Create a new ParsedNPC object. | [
{
"docid": "2097095e1c40a51bb683d284166966ed",
"score": "0.787273",
"text": "public ParsedNPC()\r\n {\r\n npc = new NPC();\r\n hidden = false;\r\n }",
"title": ""
}
] | [
{
"docid": "bbc7fe02a87376b9677ca31504b2cc99",
"score": "0.6100343",
"text": "public NPC(int npcId) {\n\t\tthis.npcId = npcId;\n\t\tthis.def = NPCDefinition.forId(npcId);\n\t}",
"title": ""
},
{
"docid": "3d42e107a85cff43020f7c261d50e2cf",
"score": "0.58246636",
"text": "public void ... |
4b8b68d4eed7a213db28059016463df6 | Interface to C language function: void calcdpd(float t, float rh, int mni, int ni, int nj, float dpd); | [
{
"docid": "71eaaec9d232f8bc366f62a3c3fdeb0e",
"score": "0.78686315",
"text": "public static void calcdpd(float[] t, int t_offset, float[] rh, int rh_offset, int[] mni, int mni_offset, int[] ni, int ni_offset, int[] nj, int nj_offset, float[] dpd, int dpd_offset)\n {\n if(t != null && t.length <= t_... | [
{
"docid": "c4c18b59dd89b1f7142c79a0a3c166e9",
"score": "0.82176393",
"text": "public static void calcdpd(java.nio.FloatBuffer t, java.nio.FloatBuffer rh, java.nio.IntBuffer mni, java.nio.IntBuffer ni, java.nio.IntBuffer nj, java.nio.FloatBuffer dpd)\n {\n boolean _direct = BufferFactory.isDirect(t)... |
e2fc9fb8f6c54c6a17d77d20f28be698 | optional double price = 4; | [
{
"docid": "c953c2fe9282e99e3254eb5cc2093515",
"score": "0.7315933",
"text": "double getPrice();",
"title": ""
}
] | [
{
"docid": "215c11672477f9deabb0e0777dc078f2",
"score": "0.77965146",
"text": "private void setPrice(double price){this.price = price;}",
"title": ""
},
{
"docid": "ee54bd34b80069bc2e7cb606a189c423",
"score": "0.76159",
"text": "public void setPrice (double price){\r\n this.pr... |
f133afafb7efeea66c1bd1b1ffe76e8c | Sets the error message. | [
{
"docid": "cc0e885625d9b2bbc94713554928c0a0",
"score": "0.0",
"text": "public ErrorDTO setErrorMessage(String errorMessage) {\r\n\t\tthis.errorMessage = errorMessage;\r\n\t\treturn this;\r\n\t}",
"title": ""
}
] | [
{
"docid": "ec48d0c39f74e2cb1f0ce8863e1ac6a6",
"score": "0.83618724",
"text": "void setError(String msg);",
"title": ""
},
{
"docid": "44c07e1333af426929c19005d94e8f7e",
"score": "0.7999573",
"text": "void setError(String errorMessage);",
"title": ""
},
{
"docid": "06c650... |
5432da771521fd8f7b6901f3055da4c9 | Decrypt lines that are encoded and encrypted using the hashedKey | [
{
"docid": "48e1f92cab2ac00dda20209d78916eb4",
"score": "0.5398481",
"text": "public LinkedList<TableEntry> decryptLines(Object[] lines, Component... components) {\n\t\tLinkedList<TableEntry> toReturn = new LinkedList<TableEntry>();\n\t\t\n\t\tif(lines.length < 2)\n\t\t\treturn toReturn;\n\t\t\n\t\t// C... | [
{
"docid": "7a7c4dcb010c088c3a3b3f426aed63af",
"score": "0.6605819",
"text": "public void decrypt() {\r\n\t\t\t//Setting an initial size of the file.\r\n setFileBytes(level2(fileBytes, false));\r\n int f = 0;\r\n boolean truth = true;\r\n\r\n key = keyStream()... |
9a208fbf87f5bc629445b11785f89eac | $ANTLR end "rule__RangeStatement__Group__0" $ANTLR start "rule__RangeStatement__Group__0__Impl" ../org.eclipse.yang.ui/srcgen/org/xtext/editor/yang/ui/contentassist/antlr/internal/InternalYang.g:13274:1: rule__RangeStatement__Group__0__Impl : ( 'range' ) ; | [
{
"docid": "bc5315f8c466af865f32f2e31842f26d",
"score": "0.8764301",
"text": "public final void rule__RangeStatement__Group__0__Impl() throws RecognitionException {\n\n \t\tint stackSize = keepStackSize();\n \n try {\n // ../org.eclipse.yang.ui/src-gen/org/xtext/edito... | [
{
"docid": "6893689d4cf135152b205f9308f5763e",
"score": "0.7857647",
"text": "public final void rule__RangeStatement__Group__0() throws RecognitionException {\n\n \t\tint stackSize = keepStackSize();\n \n try {\n // ../org.eclipse.yang.ui/src-gen/org/xtext/editor/yang... |
3c0c87e292cb7f8e29f26799512f214c | Set up the table for the output side of this application. | [
{
"docid": "9104437eaabaa1193567df2e1682d56d",
"score": "0.7287473",
"text": "private void setupOutputTable(Session session) {\n // Create the table, if it does not exist yet.\n session.execute(String.format(\n \"CREATE TABLE IF NOT EXISTS %s ( \" +\n \"%s text PRIMARY KEY, %s in... | [
{
"docid": "ea452aa78c4b1e9aca060aebec707860",
"score": "0.7000098",
"text": "private void createTable() {\n\n // Sets the table at the top of the screen\n table.top();\n table.setFillParent(true);\n\n // Adds the first row to the table.\n table.add(scoreLabel).expandX... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "cf78a14966b20556053f80632dd2388d",
"score": "0.0",
"text": "@Override\n\t\t\t\t\tpublic void onClick(DialogInterface dialog, int which) {\n\t\t\t\t\t\tdialog.cancel();\t\t\t\t\t\t\t\n\t\t\t\t\t}",
"title": ""
}
] | [
{
"docid": "663ac6f718361fb243bf093a1c7ded6a",
"score": "0.66285414",
"text": "@Override\r\n\tprotected void Goukakyuu() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "80d20df1cc75d8fa96c12c49a757fc43",
"score": "0.65323734",
"text": "@Override\n\tprotected void getExras() {\n\t\t\n\t}"... |
53e80041a6118c6884663836446b953b | float horiz = x sprite.getWidth()/2 + sprite.getWidth()sprite.getScaleX()/2; float vert = y sprite.getHeight()/2 + sprite.getHeight()sprite.getScaleY()/2; | [
{
"docid": "a1f4fc827c9380cad20c6cf50d67afc0",
"score": "0.0",
"text": "public void setPosition(float x, float y){\n\t\t\n\t\tsprite.setPosition(x, y);\n\t}",
"title": ""
}
] | [
{
"docid": "fb9a5909daedbdea60181985768237f4",
"score": "0.6344389",
"text": "public float getPosX(){return px;}",
"title": ""
},
{
"docid": "d49ade477883acbd1c4f8cc64108eea1",
"score": "0.6189022",
"text": "private void drawSprite(int x, int y, int u, int v)\n {\n GlStateM... |
570be89c23d91d5bb3878be3e7e28af6 | Returns the value of the 'Dept nm' attribute. If the meaning of the 'Dept nm' attribute isn't clear, there really should be more of a description here... | [
{
"docid": "69e47ffa849662c5d0f007183d101dc7",
"score": "0.88611895",
"text": "String getDept_nm();",
"title": ""
}
] | [
{
"docid": "05ce1459585b2de51665da1b6958d0e1",
"score": "0.7871401",
"text": "public String getDeptName() {\n return (String)getAttributeInternal(DEPTNAME);\n }",
"title": ""
},
{
"docid": "27574dd6ff49f8c9b029114a34bc3ea8",
"score": "0.7840367",
"text": "String getDept_typ... |
a344c584ff638b8590ae2efa15f4853a | accept property value visitor | [
{
"docid": "5aa7774a8b519a6978048ac7dbf09715",
"score": "0.54356956",
"text": "@Override\r\n public void accept(IPropertyValueVisitor visitor) {\r\n // relations\r\n _acceptSingle(ch.actifsource.core.javamodel.IAttribute.class, cleon.applications.actifsource.metamodel._import.xml2asrc.Xml2asrcPac... | [
{
"docid": "227040ffbd00997414b4cf25900fb62f",
"score": "0.63330716",
"text": "public void visit(OWLAnnotationProperty property) {\n \t\t\t\t\t\t\t\t\t}",
"title": ""
},
{
"docid": "c7ff06f98a96349d72c60bc01b1e0164",
"score": "0.6330603",
"text": "public boolean propertyValueChangedE... |
190a6468b777e99d0c9c55a1387af03b | Create an entity for this test. This is a static method, as tests for other entities might also need it, if they test an entity which requires the current entity. | [
{
"docid": "dc3407aee3eb14fe7793c9c14a10615a",
"score": "0.0",
"text": "public static Compra createEntity(EntityManager em) {\n Compra compra = new Compra().cantidadComprada(DEFAULT_CANTIDAD_COMPRADA).precioPagado(DEFAULT_PRECIO_PAGADO);\n return compra;\n }",
"title": ""
}
] | [
{
"docid": "e540839c51ba5e6603605333184e347a",
"score": "0.77237517",
"text": "Entity createEntity();",
"title": ""
},
{
"docid": "e540839c51ba5e6603605333184e347a",
"score": "0.77237517",
"text": "Entity createEntity();",
"title": ""
},
{
"docid": "e540839c51ba5e66036053... |
8c8b1fece42ad34e53043f37fb9425c2 | it seems that the method is never called. | [
{
"docid": "7f15ae858b74ed126230091f67946602",
"score": "0.0",
"text": "public PageNavigation update() {\r\n try {\r\n getFacade().edit(currentOrder);\r\n JsfUtil.addSuccessMessage(ResourceBundle.getBundle(BUNDLE).getString(\"CustomerOrderUpdated\"));\r\n return P... | [
{
"docid": "3208f3d55bbde0923d5805f3e1a1fbc2",
"score": "0.7046295",
"text": "protected void notExistMethod() {\n\n\t}",
"title": ""
},
{
"docid": "7ffbcc7c5a5fd2efca7e77b940aba5fd",
"score": "0.6975175",
"text": "public void bugWorkaround() {\n }",
"title": ""
},
{
"d... |
a5d9cd27aee29e0342f2462fcde40b9e | Caches the plan section plan maps in the entity cache if it is enabled. | [
{
"docid": "51140ae6564ae6d2ba45df166fe024df",
"score": "0.66263527",
"text": "public static void cacheResult(\n java.util.List<com.ext.portlet.model.PlanSectionPlanMap> planSectionPlanMaps) {\n getPersistence().cacheResult(planSectionPlanMaps);\n }",
"title": ""
}
] | [
{
"docid": "d8e354e276ba65af40bba35016f96907",
"score": "0.69158906",
"text": "public static void cacheResult(\n com.ext.portlet.model.PlanSectionPlanMap planSectionPlanMap) {\n getPersistence().cacheResult(planSectionPlanMap);\n }",
"title": ""
},
{
"docid": "a86ef27a1067e9... |
a73d031d7c9df119e1856baaf483df49 | Updates the alternate location LocationModel and displays a toast to user with new address | [
{
"docid": "ff1aa892662ac269eeee7fbdb2601976",
"score": "0.73603016",
"text": "@Override\n\tpublic void updateSetLocation(Address address)\n\t{\t\n\t\talternateLocation = new LocationModel(address.getLongitude(), address.getLatitude());\n\t\t\n\t\t/* Toast the user with the new location */\n\t\tString l... | [
{
"docid": "06eaac9fc22b66a7be85de2775437f9e",
"score": "0.6790631",
"text": "private void displayLocation() {\n\n mLastLocation = LocationServices.FusedLocationApi\n .getLastLocation(mGoogleApiClient);\n\n if (mLastLocation != null) {\n double latitude = mLastLoc... |
67c37162d93b8dd36716fa29a662a414 | le caractere en haut a gauche est le [0][0] | [
{
"docid": "7ee6718eb899bd4ea96a4df857281f62",
"score": "0.0",
"text": "public void setMap(int abscisse, int ordonnee, char carac) // change un caract�re de la map\n\t{\n\t\tif (abscisse >= 0 && ordonnee >= 0 && abscisse < this.HAUTEUR && ordonnee < this.LARGEUR)\n\t\t{\n\t\t\tthis.map[abscisse][ordon... | [
{
"docid": "3a88d13be513a48f3cb0e128c0066fa6",
"score": "0.6006903",
"text": "@Override\n\tpublic Object bottem() {\n\t\treturn arr[0];\n\t}",
"title": ""
},
{
"docid": "bea42d84fedfcc578588c4f8a4b6e821",
"score": "0.5633984",
"text": "public int getFirstContour() {\n/* 183 */ re... |
cd9db24064089be69fe139da7fdc7114 | The WorkbenchTestable implementation of this TestableObject method flushes the event queue, runs the test in a syncExec, then flushes the event queue again. | [
{
"docid": "fbe427da43199040d1ff4ae2756e7492",
"score": "0.5750566",
"text": "@Override\n\tpublic void runTest(Runnable testRunnable) {\n\t\tthis.display.syncExec(testRunnable);\n\t}",
"title": ""
}
] | [
{
"docid": "576c74e10b3a35a1d6d6dbbbd44e1dde",
"score": "0.64751756",
"text": "@Test\n public void testExecute() throws Exception\n {\n SyncCommandTestImpl cmd = createCommand(null);\n List<SongEntity> songs = new LinkedList<SongEntity>();\n List<Command> syncCmds = new Linked... |
2b4d622975fb46186c09fb411caa5db0 | Initialize this component must be called before the component could be used. | [
{
"docid": "a195fa709a9b97962bbe4b63f0ce9ab9",
"score": "0.0",
"text": "void initialize();",
"title": ""
}
] | [
{
"docid": "04d710b2c606de278263bf7bcf2b3b61",
"score": "0.81060135",
"text": "public void initialize() {\r\n super.initialize();\r\n }",
"title": ""
},
{
"docid": "340e7690859b1992e1a58a70e405c8bc",
"score": "0.8096954",
"text": "protected void initialize() {\r\n ... |
a855a5f132278260428fc99ffba9eefa | This method is used to insert a new node in the tree | [
{
"docid": "e7d3af42ca0ddd621f796557fbcf7e6b",
"score": "0.72193044",
"text": "public void insertNode(T insertValue) {\n if (root == null) {\n root = new TreeNode<T>(insertValue);\n } else\n root.insert(insertValue);\n\n }",
"title": ""
}
] | [
{
"docid": "c0028fa408d0c3f36a45368246ba88df",
"score": "0.7901704",
"text": "@Override\n\tpublic void insertNode(Node n){\n\t\tfringe.insertFirst(n);\n\t}",
"title": ""
},
{
"docid": "0c19f370100d3609304a422a7c6a66ac",
"score": "0.7636032",
"text": "@Test\n void insertNode() {\n ... |
1b0db9a86fbc30535f4932272842fb48 | / renamed from: a | [
{
"docid": "4aaeae2a5ef7f46109e91fdcee40ed83",
"score": "0.0",
"text": "public final boolean mo119684a(T t) {\n if (this.f122608h) {\n return false;\n }\n try {\n this.f122250a.accept(t);\n return this.f122605e.mo119684a(t);\n... | [
{
"docid": "5b086c8ac16e5d5bb19debbe6162f992",
"score": "0.6385309",
"text": "public interface C35018a {\n /* renamed from: a */\n void mo88789a();\n }",
"title": ""
},
{
"docid": "b83b0f0ec27f3e5a93d4f7f54f8557d8",
"score": "0.6229075",
"text": "protected interface ... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "0b2ca31d3053005635ceb066d46230f7",
"score": "0.0",
"text": "@Override\r\n\tpublic String toString(int[][] grid) {\n\t\treturn null;\r\n\t}",
"title": ""
}
] | [
{
"docid": "ffe5fe3cec40acf4b0b07ea257dfa06a",
"score": "0.6831473",
"text": "private void apparence()\r\n\t\t{\r\n\r\n\t\t}",
"title": ""
},
{
"docid": "838a915c9ea69d56cc37df198cff9cb2",
"score": "0.67589027",
"text": "@Override\n\t\t\t\tpublic void pintar() {\n\t\t\t\t\t\n\t\t\t\t... |
60c9ab71ae34f092d57bf8a892539919 | Setter method for name. | [
{
"docid": "601fba5f146d2e4ab748ce3723adecfc",
"score": "0.0",
"text": "public void setName(String aName) {\n name = aName;\n }",
"title": ""
}
] | [
{
"docid": "f21ab70bef6c5bda61bbac83eb811a39",
"score": "0.8339863",
"text": "void setName(String name_);",
"title": ""
},
{
"docid": "82a93841424b3018d18a4b2cfaa06d52",
"score": "0.82891816",
"text": "public final void setName(String name) {_name = name;}",
"title": ""
},
{
... |
188c6fe47ad41637102bd0ab455eae83 | Gets the market data requirements from a curve specification. | [
{
"docid": "9482ca3743ca7e81bf1919fefd361a1f",
"score": "0.7114536",
"text": "static Set<ValueRequirement> getRequirements(final AbstractCurveSpecification abstractSpecification, final String curveName) {\n final Set<ValueRequirement> requirements = new HashSet<>();\n if (abstractSpecification ins... | [
{
"docid": "820ad8528e91dc67a3e7bee6c4b293cc",
"score": "0.5607344",
"text": "GovernanceSourceSpecification getSpecification();",
"title": ""
},
{
"docid": "834a43a915fe5644440fc380f53c4a21",
"score": "0.5515587",
"text": "public Set<Specification> getSpecs();",
"title": ""
},
... |
9b3e0515a5bb2f02a6205a81a2cb455b | Returns a Raster that contains the decoded contents of the SeekableStream associated with this ImageDecoder. Only the first page of a multipage image is decoded. | [
{
"docid": "80d5ef02cafb4db0ac416eb62e55e92a",
"score": "0.49855232",
"text": "Raster decodeAsRaster() throws IOException;",
"title": ""
}
] | [
{
"docid": "0d3e457a33ce4b65c282fab2958aa5b4",
"score": "0.6156134",
"text": "Raster decodeAsRaster(int page) throws IOException;",
"title": ""
},
{
"docid": "8b2453bbae37379e554d088ed08cdaa7",
"score": "0.57841086",
"text": "public interface ImageDecoder {\n\n /**\n * Returns... |
4f860f7d37e4aa51161792d0db22baeb | Returns all internal connectors. | [
{
"docid": "06fe9ad6364de61e332c257377fec717",
"score": "0.76988727",
"text": "public Set<Connector> getConnectors() {\n\t\treturn new HashSet<Connector>(connectors);\n\t}",
"title": ""
}
] | [
{
"docid": "6ff329d00fce332de913a39ca4e5a98f",
"score": "0.7747343",
"text": "List<ConnectorDefinition> getConnectors();",
"title": ""
},
{
"docid": "d6673d22fc254b3fcb6d096a54b7cdef",
"score": "0.72229904",
"text": "private Iterable<C> getConnectors() {\n NCLElement root = ge... |
95631d086aaee98fce3cb070d979b65c | Initiate thread pool, creates and add worker threads to the pool. | [
{
"docid": "5eafdd109aacd44395ebef90af4ac47c",
"score": "0.76384336",
"text": "public void initiateThreadPool() {\n pool = new ThreadPool(minimumThreadsAllowed, maximumThreadsAllowed, idleSeconds);\n // starting point for worker threads.\n ImpressionMarksEventDispatcher eventDispatcher = ... | [
{
"docid": "a1bbdcced615654655fe10eb8e71b874",
"score": "0.70343906",
"text": "public PoolTest(int threadPoolSize){\r\n\t\tpoolSize = threadPoolSize;\r\n\t\tmanager = new ThreadPoolManager(poolSize, null);\r\n\t}",
"title": ""
},
{
"docid": "0adb535d07ecd88cbd774d386e30043e",
"score": "0... |
d194bdb2eb45edbdb37a179708a8b932 | Return a representation of this instance. | [
{
"docid": "c5bd3b7083d70b38bcb2c42e2378c085",
"score": "0.0",
"text": "@Override public String toString() {\r\n return \"(\" + value + \", \" + priority + \")\";\r\n }",
"title": ""
}
] | [
{
"docid": "40a4ac0ba19f1a93f44ddbca3d670b96",
"score": "0.7694254",
"text": "public String serialize() {\n Gson gson = new Gson();\n return gson.toJson(this);\n }",
"title": ""
},
{
"docid": "0cb050ecf6ac74c048583e34849bc3cc",
"score": "0.76299363",
"tex... |
e1a07a95e4517be946d6f026e4200cf6 | Returns the random number generator. | [
{
"docid": "3bb088a4781ec785ff277b2cb8d847de",
"score": "0.8407885",
"text": "public Random getRandomNumberGenerator() { return randomNumberGenerator; }",
"title": ""
}
] | [
{
"docid": "a6b8f4b338dbdc6a3f249e99ed3e1165",
"score": "0.77393514",
"text": "public Random getRandomGenerator() {\n return randomGenerator;\n }",
"title": ""
},
{
"docid": "c1c75210dae77d90aaef41bae70c6b58",
"score": "0.7572167",
"text": "public static RandomNumberGenerator get... |
59437dc11ef1ae1c5873cdaba7f4b063 | Goal: who reaches 2030 first? Questions asked everyday for 17 days related to 17 UN Goals Right answer => 1 step towards 2030 Wrong answer => same position or sometimes pushed back Some Example Questions Below Goal 1: End Poverty | [
{
"docid": "1104c937958badad2ebff960526a22f4",
"score": "0.62849885",
"text": "public void Day1(){\n System.out.println(\"Goal 1: Choose the right answer: a/A,b/B,c/C\");\n System.out.println(\"Let's start with an easy question\");\n System.out.println(\"Despite having a job, ___ % ... | [
{
"docid": "af585043b55ee9a9d464c531304a9b47",
"score": "0.57709175",
"text": "void retryGame() {\n\t\tquizTime = false;\n\t\tdistractCountdown = DISTRACT_DURATION;\n\t\tnumPredators = 3;\n\t\tquestionNumber = -1;\n\t\tnest.numEggs = 3;\n\t\tgeneratePredators();\n\t}",
"title": ""
},
{
"doci... |
0dffc6531374d6192d0d2be1b2875950 | Given Accept the content in XML format With Content Type as JSON When I perform the POST request Then Status Code 400 Bad Request should be returned | [
{
"docid": "fac87dea58b66ef0d98785cb25f7781e",
"score": "0.6086791",
"text": "@Test\n\tpublic void testPostWithoutBody(){\n\t\t\t\t\n\t\tgiven()\n\t\t.accept(ContentType.XML)\n\t\t.with()\n\t\t.contentType(ContentType.JSON)\n\t\t.and()\n\t\t.when()\n\t\t.post(\"/add\")\n\t\t.then()\n\t\t.assertThat()\n\... | [
{
"docid": "2549d65d536225b2ec5a265547aa02d6",
"score": "0.5713337",
"text": "@Test\n\tpublic void createContentWithInvalidContentType() throws Exception {\n\t\tString createContentReq = \"{\\\"request\\\": {\\\"content\\\": {\\\"name\\\": \\\"Unit Test\\\",\\\"code\\\": \\\"unit.test\\\",\\\"mimeType\\... |
0c3a978b912f3b12808eab49bbedeb69 | This method was generated by MyBatis Generator. This method returns the value of the database column os_user_login.login_time | [
{
"docid": "eb1a2125203dea087a90a55e2bebea2e",
"score": "0.75818163",
"text": "public Date getLoginTime() {\n return loginTime;\n }",
"title": ""
}
] | [
{
"docid": "70153ec0c30cd57207173cfa4a06a0cd",
"score": "0.69417167",
"text": "DateTime getLastLoginTime();",
"title": ""
},
{
"docid": "d8773f5738b9103e2f6e76f87a72d8e0",
"score": "0.66451",
"text": "public Date getUserLastLoginTime() {\n return userLastLoginTime;\n }",
... |
f920c9bb7259283d129a858205452612 | so that when the next shape is selected, we will know it is its first time being selected after another shape was selected | [
{
"docid": "ca0c6039dbfa4055ebc78a91d1cf78d2",
"score": "0.0",
"text": "@Override\r\n\tpublic void mouseReleased(MouseEvent event) {\n\t\tfirst_time = true;\r\n\r\n\t}",
"title": ""
}
] | [
{
"docid": "a528c751aaa3a3d98c1165125fcc2dcc",
"score": "0.70282197",
"text": "public void shapeSelect(int x, int y){\n boolean found = false;\n for(int i = shapeList.size() - 1; i >= 0 && !found; i--){\n if(shapeList.get(i).isOn(x,y)){\n selected = shapeList.get(i);\n found = t... |
dc92b53b6af749859e332bc5c0d3aa0d | Retorna as classes components do projeto. | [
{
"docid": "e99873b9a90534dab65f1c0da372bed3",
"score": "0.0",
"text": "SortedSet<NgComponentRepresentation> getNgComponents();",
"title": ""
}
] | [
{
"docid": "bfd548bfc522db92f0a5a00206fc4f06",
"score": "0.6170519",
"text": "JPanel getProjectCreator()\n{\n return new ProjectCreator();\n}",
"title": ""
},
{
"docid": "4de06c1220fcebf64248777f0604e70b",
"score": "0.605183",
"text": "ComponentmodelPackage getComponentmodelPackage... |
976208a3727e543ee925acedfc670eb0 | This method was generated by MyBatis Generator. This method corresponds to the database table tb_student | [
{
"docid": "d41b14a9cada0b0bdf5ba1d71ac408ef",
"score": "0.0",
"text": "int updateByPrimaryKey(Student record);",
"title": ""
}
] | [
{
"docid": "590c0b1b0604aed7e91dc3155d6b9225",
"score": "0.663496",
"text": "List<Student> queryStudentById(String id) throws SQLException;",
"title": ""
},
{
"docid": "11ef72fb5d5451fc6cc8bfbf47ba1ab3",
"score": "0.66338545",
"text": "@Override\r\n\tpublic List<Student> listAllStude... |
6d401c1438fc400eb973cee5a6ad2cae | Creates new form KartaPostav | [
{
"docid": "7c77f37a8fb0591b2230c4c3e4e876e6",
"score": "0.58371335",
"text": "public KartaPostav(int PK, int addOrUpdate) {\n initComponents();\n this.PK = PK;\n this.addOrUpdate = addOrUpdate;\n\n jTextFieldFullName.setDocument(new PlainDocument() {\n @Override\n... | [
{
"docid": "bd09e8ca25e3b92e51a520a9065f40c2",
"score": "0.65853465",
"text": "public void create() {\r\n try {\r\n preCreate();\r\n preSave();\r\n pManager.create(getCo());\r\n info(\"El registro se ha creado con exito.\");\r\n RequestContex... |
98d92dacedccbb5adeebfc8dc09c44b0 | repeated int64 peak_m_z = 1 [packed = true]; Actual peak_m_z values are expected to be strictly increasing, so we store the deltas of the numerators to keep the numbers smaller. | [
{
"docid": "483a714e8727b2c606418dccab3e5b18",
"score": "0.49980232",
"text": "public Builder addAllPeakMZ(\n java.lang.Iterable<? extends java.lang.Long> values) {\n ensurePeakMZIsMutable();\n super.addAll(values, peakMZ_);\n onChanged();\n return this;\n }",
... | [
{
"docid": "a4c0b1aa06b7cf5b7fc0a905dbc3dda1",
"score": "0.5640447",
"text": "public int[] asMajorPeakMZs();",
"title": ""
},
{
"docid": "7426234552551bb769cc43299c9d7796",
"score": "0.54947203",
"text": "int getPeakMZCount();",
"title": ""
},
{
"docid": "fcb87664b6a3afcd... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "21ef034f91bda06316843f170165cd42",
"score": "0.0",
"text": "@Override\n public int getCount() {\n return 3;\n }",
"title": ""
}
] | [
{
"docid": "1acc57d42c31dee937ac33ea6f2a5b0b",
"score": "0.68399656",
"text": "@Override\r\n\tpublic void comer() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "118f2b8a20f48999973063ac332d07d3",
"score": "0.6563993",
"text": "@Override\r\n\t\t\tpublic void atras() {\n\r\n\t\t\t}",
... |
c06cb8541f2d799505776935b0281104 | So other objects can subscribe and get notified. Used by StateActionPrototype. | [
{
"docid": "b6d4ea0509ea9ba635bb525b6aacf5ee",
"score": "0.6101163",
"text": "public interface ChangeListener {\n void actionFired(boolean status);\n}",
"title": ""
}
] | [
{
"docid": "1b45daa1fd1aa5304a12ce766a9fd60a",
"score": "0.66048455",
"text": "public interface SubscriberServiceStateAction\r\n{\r\n\r\n /**\r\n * Executes the state change for a particular subscriber\r\n * @param ctx\r\n * @param subscriber\r\n * @throws StateChangeException\r\n ... |
6297e653474b0e49ffaf3ce7473d4f7e | Spring Data repository for the ShopSection entity. | [
{
"docid": "79660065dff7d2644023133eedd45507",
"score": "0.78728855",
"text": "@SuppressWarnings(\"unused\")\n@Repository\npublic interface ShopSectionRepository extends JpaRepository<ShopSection, Long>, JpaSpecificationExecutor<ShopSection> {\n List<ShopSection> findAllByShopId(Long shopId);\n\n}",
... | [
{
"docid": "12a36b4d1904253f22d84c6da1178f1f",
"score": "0.6837094",
"text": "public interface SectionRepository extends CrudRepository<SectionDto, Integer> {\n}",
"title": ""
},
{
"docid": "590b5c0b613d43a548104337a8e8a4b6",
"score": "0.67638266",
"text": "public interface ShopRepos... |
36ea92e69169d8daf62ff44a0f0e200d | This method returns the azimuth parameter. | [
{
"docid": "80d7c61f8fecf8e150e252d2a22c0e25",
"score": "0.8572878",
"text": "public int getAzimuth() \n\t{\n\t\treturn lookupValue(Params.AZIMUTH);\n\t}",
"title": ""
}
] | [
{
"docid": "7dce2990a731c163980b1646f530c356",
"score": "0.83981746",
"text": "public double getAzimuth() {\n return azimuth;\n }",
"title": ""
},
{
"docid": "e6c045d8c4c2f5528a52341ee1b10cea",
"score": "0.67839473",
"text": "public JsonNode getPitchRollAzimuth();",
"ti... |
9f30eca9217af21929666ba98c6069c5 | Adds the given bytes to the response. | [
{
"docid": "c8aab8cbbbeea9b2c215d8583bce8a8c",
"score": "0.7098553",
"text": "protected void addBytes( final byte[] bytes ) {\n if ( bytes == null ) {\n return;\n }\n for ( final byte b : bytes ) {\n messageContents[currentOutputPosition] = b;\n currentOutputPosition+... | [
{
"docid": "b9a9c7a8005572652b37acef70674589",
"score": "0.6768112",
"text": "protected void addBytes(byte[] bytes) throws Exception {\n\t\tnioParser.addBytes(bytes);\n\t}",
"title": ""
},
{
"docid": "cdc1e312dc5121bf77e7b1dbd2be4d0c",
"score": "0.6141959",
"text": "protected void ad... |
3b4b102e011ab4a5e38ac9e99e8e47a1 | Restart a service through swarm | [
{
"docid": "edef8eecc8e9a4df373f356ee736c170",
"score": "0.70892173",
"text": "boolean restartService(Container service, UserI user);",
"title": ""
}
] | [
{
"docid": "9975988e5b01f9b54b5f2e9f50ba5779",
"score": "0.6729901",
"text": "@Override\n\tprotected void onRestart() {\n\t\tsuper.onRestart();\n\t\tdoBindService();\n\t}",
"title": ""
},
{
"docid": "8933b2109b9f491b73f757a10d1d1273",
"score": "0.6715378",
"text": "private void resta... |
2aae96d90a2c469c19daa0671ca42bbe | Gets the value at index 28. | [
{
"docid": "a3c241065c8c7d676a9f606110cc8e7f",
"score": "0.71580046",
"text": "public V getValue28();",
"title": ""
}
] | [
{
"docid": "1e3dcc347e40c2b908be630a09c32ae9",
"score": "0.69423676",
"text": "public V get28();",
"title": ""
},
{
"docid": "c3daf7daa9643f20941d33ae7f482174",
"score": "0.6401636",
"text": "protected final int getValue(int index)\n/* */ {\n/* 287 */ return this.m_data_[in... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "5a43553efc38147daac041b346ed565a",
"score": "0.0",
"text": "public static void main(String[] args) {\n\t\tEquals obj1 = new Equals(\"blue\");\r\n\t\tEquals obj2 = new Equals(\"blue\");\r\n\t\tEquals obj3 = new Equals(\"red\");\r\n\t\t\r\n\t\tboolean a = obj1.equals2(obj2);\r\n\t\tboolean b =... | [
{
"docid": "da34ed11fe7c5649b3cd0bdad6dca5df",
"score": "0.7115143",
"text": "@Override\n\t\tpublic void 비행() {\n\t\t\t\n\t\t}",
"title": ""
},
{
"docid": "99cfe01c5035e9a9ca6dafada0e4a005",
"score": "0.67343336",
"text": "@Override\r\n\tpublic void caminar() {\r\n\t\t// TODO Auto-g... |
2c159164e7ff4d6757561c6643446363 | Show a platform native text input screen. | [
{
"docid": "c81a0f7ec81e40a7969351c12daff17b",
"score": "0.7399618",
"text": "public final void showNativeTextScreen(TextBox uilTextBox) {\n final Command cmdDone = new Command(\"Done\", Command.OK, 0);\n\n javax.microedition.lcdui.TextBox nativeTextBox = new javax.microedition.lcdui.TextB... | [
{
"docid": "8115ba8c87fcbd37d9f9c5a72e7014d2",
"score": "0.64786714",
"text": "public void displayUserInput(String input) {\n\n // display the user input\n outputWindow.appendText(input, new Color(50,50,50), true);\n\n }",
"title": ""
},
{
"docid": "3210182263ed4133a99aa11d0... |
0c19b8ebe23716898cb6c48057a44b63 | Make the request to the Twilio API to perform the update. | [
{
"docid": "3da4e95e987619350bd331ed89bb5654",
"score": "0.0",
"text": "@Override\n @SuppressWarnings(\"checkstyle:linelength\")\n public Webhook update(final TwilioRestClient client) {\n Request request = new Request(\n HttpMethod.POST,\n Domains.IPMESSAGING.toString(... | [
{
"docid": "62d20d1a8417c6e7f2415931c0f3f00d",
"score": "0.6512337",
"text": "void update(UpdateRequest updateRequest);",
"title": ""
},
{
"docid": "3c57c05044bff0c4b3419f47bb56c5f9",
"score": "0.64688325",
"text": "@WebMethod\n\tpublic static void Update() {}",
"title": ""
},
... |
8e29dad5fef01a8c5cbd849b3532ac08 | Created by xiaoyu on 2017/9/20. | [
{
"docid": "5be3a96bc5401fe8444ecf804b25bafa",
"score": "0.0",
"text": "public interface IMyBankListBiz {\n void getdata(MyBankListListener myBankListListener, String token);\n}",
"title": ""
}
] | [
{
"docid": "27bc40cf2c5e26e0bf8b70807e0bcaed",
"score": "0.6373809",
"text": "@Override\r\n\tpublic void caminar() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "1acc57d42c31dee937ac33ea6f2a5b0b",
"score": "0.61257255",
"text": "@Override\r\n\tpublic void comer() {\n\t\t\r\n\t}",
"t... |
5107edfcc41343107ea31f7922b18d98 | Handles the HTTP GET method. | [
{
"docid": "6f1219d2c08584420209d3f2203825fa",
"score": "0.0",
"text": "@Override\n protected void doGet(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n processRequest(request, response);\n }",
"title": ""
}
] | [
{
"docid": "9aa99ba443864eeb9435a1ccc06bd55e",
"score": "0.7308342",
"text": "public void doGet(HttpServletRequest req, HttpServletResponse resp) {\n }",
"title": ""
},
{
"docid": "b34954facd5a52bfbdf567331c004f78",
"score": "0.72048396",
"text": "@Override\r\n\tpublic void doGet(Re... |
6a3520915b3090b5b4b462b330474356 | Sets the color to render the StaffInfoFolder's name. | [
{
"docid": "795258a7944535aef8a2b3248e1523bc",
"score": "0.5939448",
"text": "public void setNameColor(String color){\n\t\tsuper.setTitleColor(color);\n\t}",
"title": ""
}
] | [
{
"docid": "75a415c5c391a820fffbe89f9a575896",
"score": "0.5369418",
"text": "public BbStaffInfoFolder(StaffInfoVO staff_info_vo) {\n \t_staff_info_vo = staff_info_vo;\n \t_staff_info_vo.setFolder(true);\n }",
"title": ""
},
{
"docid": "c513f20d8aac2ae97c82c32fa4f0736f",
"score"... |
e27ef04d2b8bb85e15f4e762f22d5eb9 | generated using sqlalchemy session.query(func.count('')).filter(Test.name == 'foo').scalar() | [
{
"docid": "86cb6b15f0eca722dba6de05b3e47617",
"score": "0.69190556",
"text": "@Test\n public void testSqlAlchemyGeneratedCountWithStar() throws Exception {\n\n execute(\"create table test (col1 integer primary key, col2 string) with (number_of_replicas=0)\");\n ensureYellow();\n ... | [
{
"docid": "27bc15f6a7018f4050cb31c071206cb5",
"score": "0.73588276",
"text": "@Test\r\n public void testCountArgument() {\r\n final TableReference tableOne = tableRef(\"TableOne\");\r\n SelectStatement testStatement = select(count(field(\"name\")), countDistinct(field(\"name\"))).from(tableOne);... |
68d41fdb65ea57dd9e68a45687b287ea | Attempts to store a transaction in the database. | [
{
"docid": "79275c30d4c243c0bf048628e7c68703",
"score": "0.0",
"text": "public boolean makeTransaction(String usernameTo,String usernameFrom, double amount) {\n String insertString = \"INSERT INTO transactions (amount,fromuser,touser) VALUES(?,?,?);\";\n try{\n PreparedStatement... | [
{
"docid": "cc67b8b254fb7729fc0eed8da8af7883",
"score": "0.67665005",
"text": "void commit() throws TransactionException;",
"title": ""
},
{
"docid": "ab69386893a5ac0b0b144e577c419465",
"score": "0.675488",
"text": "public boolean commitTransaction();",
"title": ""
},
{
"... |
92883682029fe458f6fdcc7ae2bd3a81 | / min cost to node 0 ... 6 | [
{
"docid": "d365ccde5487fe67f43de00eb422c73d",
"score": "0.0",
"text": "RouterData (int sourceID, int destID, int[] mincosts){\n this.sourceid = sourceID;\n this.destid = destID;\n System.arraycopy(mincosts, 0, this.cost, 0, RouterSimulator.NUM_NODES);\n }",
"title": ""
}
] | [
{
"docid": "f3c0afbd6e5672a8da87c556cda74d89",
"score": "0.7251852",
"text": "public int minCost(int[][] costs) {\n int r = 0, b = 0, g = 0;\n for (int i = 0; i < costs.length; i++) {\n int tempR = r;\n r = Math.min(b, g) + costs[i][0];\n int tempG = g;\n g = Math.min(t... |
fe053fa56c49cec916fe33d3e3644eee | Sets the the fetch interval, that is the number of system ticks between each request by this Aggregator to get the cumulative demand of all HouseHolds attached to it | [
{
"docid": "e7821adbd2fb2b90c6216c9271f4959c",
"score": "0.7135747",
"text": "public void setFetchInterval(int interval) {\n universe = SmartGridUniverse.getInstance();\n // overwrite fetch interval with new one\n this.fetchInterval = interval;\n }",
"title": ""
}
] | [
{
"docid": "d3b52a23576b983c768e0af2d19308da",
"score": "0.65949893",
"text": "public int getFetchInterval() {\n return fetchInterval;\n }",
"title": ""
},
{
"docid": "32b1045bd3c387304b6c007b86411309",
"score": "0.60288084",
"text": "public void update() {\n // if i... |
274948fd8f7dd060042aa47e7656bacc | Gets the attribute value for the calculated attribute ItemId | [
{
"docid": "b8bd079731cf369cebf09ac9ff589a7c",
"score": "0.66801965",
"text": "public Number getItemId()\n {\n return (Number)getAttributeInternal(ITEMID);\n }",
"title": ""
}
] | [
{
"docid": "114e9b0ec857f9ff26bc7e7812e2b5ed",
"score": "0.73325104",
"text": "public Long getAttributeItemId() {\n return attributeItemId;\n }",
"title": ""
},
{
"docid": "a20bc6277a17817bfcdcdfd13a83e501",
"score": "0.690959",
"text": "io.dstore.values.IntegerValue getBon... |
5b91e51c7ea29042da2f8f7529342aa4 | Get the value of visitorId | [
{
"docid": "c70b02f44c09746a7b92d90b02da40f3",
"score": "0.7713513",
"text": "public Long getVisitorId() {\n return visitorId;\n }",
"title": ""
}
] | [
{
"docid": "b8d96f7942b852de2a3c58385081ca09",
"score": "0.72830087",
"text": "public abstract String getSiteVisitorId();",
"title": ""
},
{
"docid": "28a3f6c82ad5042f686c6c7be91cdfcf",
"score": "0.7012718",
"text": "public String getmVisitorId() {\n\t\treturn mVisitorId;\n\t}",
... |
1b672b42adaba4780ce4dc7da52ea992 | upon flush() write the existing contents of the OutputStream to the logger as a log record. | [
{
"docid": "cb1ce6f3ff55e670ea55f0a91efdb3c0",
"score": "0.652436",
"text": "public void flush() throws IOException {\n String record;\n synchronized(this) {\n super.flush();\n record = this.toString();\n super.reset();\n } \n if (recor... | [
{
"docid": "4bc6484363c5f3833d30206629274c75",
"score": "0.64272135",
"text": "private void writeToOutputStream(final StorletLogger logger, final byte[] output, final OutputStream outputStream,\n final byte[] recordSeparator) throws IOException {\n\n outputStream.write(outp... |
102935cac49f330b2bff1baf818a731f | This interface must be implemented by activities that contain this fragment to allow an interaction in this fragment to be communicated to the activity and potentially other fragments contained in that activity. See the Android Training lesson Communicating with Other Fragments for more information. | [
{
"docid": "dd253f4e7519fcd7b6a4a863107ca4d1",
"score": "0.0",
"text": "public interface OnFragmentInteractionListener {\n // TODO: Update argument type and name\n void onListInteraction(int index, boolean isLongClicked);\n }",
"title": ""
}
] | [
{
"docid": "e1f39afa57fe2a2d46630e1a38a3a80b",
"score": "0.73246294",
"text": "public interface OnFragmentInteractionListener {\n void onFragmentMessage(String TAG, Object data);\n}",
"title": ""
},
{
"docid": "74146275c7fa99822f82e623860ec8e7",
"score": "0.7208353",
"text": "publ... |
eb38030ae15d02d404e626565ff066e9 | This method was generated by MyBatis Generator. This method sets the value of the database column cycling_total.max_altitude | [
{
"docid": "fdc50e4c97ef974304b89b01a49c3622",
"score": "0.6571727",
"text": "public void setMaxAltitude(Float maxAltitude) {\n this.maxAltitude = maxAltitude;\n }",
"title": ""
}
] | [
{
"docid": "b626e0940a1f644fcba346e7984108b8",
"score": "0.64373946",
"text": "public void setMaxAltitudeInFeet(double newAltitude) {\n\t\tthis.maxAltitudeInFeet = newAltitude;\n\t}",
"title": ""
},
{
"docid": "2352bbd25203bd6a3458e6f080a143bf",
"score": "0.6433795",
"text": "public ... |
0a90b4b24866decd227e5b31f1448411 | db = new DBHelper(this); for (Wine w: updateWineList) db.updateWine(w); wineList.clear(); wineList = db.getAllWines(); | [
{
"docid": "849b46a8df5fb33342d40a0b6ef5a347",
"score": "0.5329845",
"text": "public void endIt() {\n\n Log.i(TAG, \"Showing all updated Wine List:\");\n for (Wine w: updateWineList)\n Log.i(TAG, w.toString());\n\n Log.i(TAG, \"Showing imageUri\");\n Log.i(TAG, image... | [
{
"docid": "3450a1b1c7851d31eacc4433cc5bec51",
"score": "0.65288264",
"text": "public static void actualizarList(){\n ClienteList.updateClienteQuery(); \n ProveedorList.updateProveedorQuery();\n CategoriaList.updateCategoriaQuery();\n MarcaList.updateMarcaQuery();\n Ar... |
f5868265f1909c85ebe756ee88dd0243 | ================================================Tab LIST WORD ABC ========================================================== | [
{
"docid": "35f4b9404f898c38576a24b175983ddd",
"score": "0.531567",
"text": "private void settablistdahoc() {\n\t\tlvdahoc =(ListView)findViewById(R.id.lvdahoc);\n\t\tArrayList<String> tudahoc = new ArrayList<String>();\n\t\tArrayList<String> nghiadahoc = new ArrayList<String>();\n\n\t\tfor(int i=0;i<ar... | [
{
"docid": "75c8509992e9e8c10c6f1d36be2f595a",
"score": "0.6530434",
"text": "private static String manualTab(String entry)\r\n\t{\r\n\t\tString tab = \"\";\r\n\t\tfor(int count=0; count < 15 - entry.length(); count++)\r\n\t\t\ttab += \" \";\r\n\t\treturn tab;\r\n\t}",
"title": ""
},
{
"doci... |
5c5017692909da7c0bcc8cb846f6431b | Getter for the type | [
{
"docid": "6b8282126ca13ecf50515ff4a4b14f49",
"score": "0.0",
"text": "@Basic @Immutable\n\tpublic char getType(){\n\t\treturn this.type;\n\t}",
"title": ""
}
] | [
{
"docid": "7499c6fd907c8ed51059f30bafad0282",
"score": "0.8539371",
"text": "Type getType() {\n return type;\n }",
"title": ""
},
{
"docid": "7499c6fd907c8ed51059f30bafad0282",
"score": "0.8539371",
"text": "Type getType() {\n return type;\n }",
"title": ""
... |
604ab05049a8eb5c4beb99f5c61745a5 | TODO: Replace this with your own logic | [
{
"docid": "ac2638e7217be55ae2cfffbc10afb31b",
"score": "0.0",
"text": "public static boolean isEmailValid(String email) {\n return email.contains(\"@\") && email.contains(\".\");\n }",
"title": ""
}
] | [
{
"docid": "ea8460c7314de45803a19bf7c984d4bf",
"score": "0.5507535",
"text": "@Override\n public void perish() {\n \n }",
"title": ""
},
{
"docid": "28237d6ae20e1aa35aaca12e05c950c9",
"score": "0.5415208",
"text": "@Override\n\tpublic void sacrifier() {\n\t\t\n\t}",
... |
f678969e70db0e667c7b1b380f065814 | number of missiles blown up so far in level | [
{
"docid": "f5fa6e7ae055dfc9e14f552211fe915f",
"score": "0.0",
"text": "public void actionPerformed (ActionEvent e) //when buttons are clicked\r\n\t{\r\n\r\n\t if (e.getSource () == start) //if the user clicks the start button\r\n\t {\r\n\t\t//showing and hidding components\r\n\t\tmyName.setVisib... | [
{
"docid": "6b91f13b2880d22bac9125f9da44629c",
"score": "0.657914",
"text": "@Override\n\tpublic long getNumberOfLookUps() {\t\t\n\t\treturn hitsCounter+missCounter;\n\t}",
"title": ""
},
{
"docid": "180628017588278ae6f9ab8ec322d2f2",
"score": "0.6527251",
"text": "public int getMiss... |
f34041f25466264d98ca4f5a9a5a5dcc | Branch the hallway which is upwards. A room is generated on the top door of the upwards hallway, while hallways (left or rightwards) are generated at the side door. | [
{
"docid": "02eca3fc5f68b9d78a097be2d72e337c",
"score": "0.736599",
"text": "private void branchUp(List<Space> list) {\r\n if (distToTop() >= 3) {\r\n Random random = new Random(946263);\r\n int topExtension;\r\n do {\r\n topExtension = 1 + Math.abs... | [
{
"docid": "300a346dd21213925e34c8c30cf2acb9",
"score": "0.69719136",
"text": "private void branchDown(List<Space> list) {\r\n if (distToBottom() >= 3) {\r\n Random random = new Random(3916274);\r\n int bottomExtension;\r\n do {\r\n bottomExtension ... |
f95d0e7cf366d22b0a351cea972c3663 | This method should return the size of the stack | [
{
"docid": "8202c2b8475d0f96498788ddc8bc0dce",
"score": "0.0",
"text": "public int getSize(){\r\n return (A.getSize());\r\n //To be written by student\r\n }",
"title": ""
}
] | [
{
"docid": "1ef90c6689a3cf491cf075135dc214d9",
"score": "0.89875853",
"text": "public int stackSize() {\r\n return stack.size();\r\n }",
"title": ""
},
{
"docid": "b890eae726daa5b2089cde9d7ef38f42",
"score": "0.8638514",
"text": "public int size() {\n return stack.si... |