()); \\n CUP$AnalyseurSyntaxique$result = parser.getSymbolFactory().newSymbol(\\\"APPELFONCTION\\\",7, ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-2)), ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.peek()), RESULT);\\n }\\n return CUP$AnalyseurSyntaxique$result;\\n\\n /*. . . . . . . . . . . . . . . . . . . .*/\\n case 51: // APPELFONCTION ::= IDF PAROUVRANTE PAR_EFF PARFERMANTE \\n {\\n ExpressionBinaire RESULT =null;\\n\\t\\tint ileft = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-3)).left;\\n\\t\\tint iright = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-3)).right;\\n\\t\\tString i = (String)((java_cup.runtime.Symbol) CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-3)).value;\\n\\t\\tint peleft = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-1)).left;\\n\\t\\tint peright = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-1)).right;\\n\\t\\tArrayList<ExpressionBinaire> pe = (ArrayList<ExpressionBinaire>)((java_cup.runtime.Symbol) CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-1)).value;\\n\\t\\t RESULT = new AppelFonction(ileft + 1, i, pe); \\n CUP$AnalyseurSyntaxique$result = parser.getSymbolFactory().newSymbol(\\\"APPELFONCTION\\\",7, ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-3)), ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.peek()), RESULT);\\n }\\n return CUP$AnalyseurSyntaxique$result;\\n\\n /*. . . . . . . . . . . . . . . . . . . .*/\\n case 52: // PAR_EFF ::= EXP VIRGULE PAR_EFF \\n {\\n ArrayList<ExpressionBinaire> RESULT =null;\\n\\t\\tint eleft = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-2)).left;\\n\\t\\tint eright = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-2)).right;\\n\\t\\tExpressionBinaire e = (ExpressionBinaire)((java_cup.runtime.Symbol) CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-2)).value;\\n\\t\\tint peleft = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.peek()).left;\\n\\t\\tint peright = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.peek()).right;\\n\\t\\tArrayList<ExpressionBinaire> pe = (ArrayList<ExpressionBinaire>)((java_cup.runtime.Symbol) CUP$AnalyseurSyntaxique$stack.peek()).value;\\n\\t\\t pe.add(e);\\n RESULT = pe;\\n \\n CUP$AnalyseurSyntaxique$result = parser.getSymbolFactory().newSymbol(\\\"PAR_EFF\\\",19, ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-2)), ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.peek()), RESULT);\\n }\\n return CUP$AnalyseurSyntaxique$result;\\n\\n /*. . . . . . . . . . . . . . . . . . . .*/\\n case 53: // PAR_EFF ::= EXP \\n {\\n ArrayList<ExpressionBinaire> RESULT =null;\\n\\t\\tint eleft = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.peek()).left;\\n\\t\\tint eright = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.peek()).right;\\n\\t\\tExpressionBinaire e = (ExpressionBinaire)((java_cup.runtime.Symbol) CUP$AnalyseurSyntaxique$stack.peek()).value;\\n\\t\\t ArrayList<ExpressionBinaire> al = new ArrayList<>();\\n al.add(e);\\n RESULT = al;\\n \\n CUP$AnalyseurSyntaxique$result = parser.getSymbolFactory().newSymbol(\\\"PAR_EFF\\\",19, ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.peek()), ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.peek()), RESULT);\\n }\\n return CUP$AnalyseurSyntaxique$result;\\n\\n /*. . . . . . . . . . . . . . . . . . . .*/\\n case 54: // DECLARATION ::= DECL_VAR \\n {\\n Instruction RESULT =null;\\n\\t\\tint dleft = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.peek()).left;\\n\\t\\tint dright = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.peek()).right;\\n\\t\\tInstruction d = (Instruction)((java_cup.runtime.Symbol) CUP$AnalyseurSyntaxique$stack.peek()).value;\\n\\t\\t RESULT = d ; \\n CUP$AnalyseurSyntaxique$result = parser.getSymbolFactory().newSymbol(\\\"DECLARATION\\\",12, ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.peek()), ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.peek()), RESULT);\\n }\\n return CUP$AnalyseurSyntaxique$result;\\n\\n /*. . . . . . . . . . . . . . . . . . . .*/\\n case 55: // DECLARATION ::= DECL_FONCTION \\n {\\n Instruction RESULT =null;\\n\\t\\tint dleft = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.peek()).left;\\n\\t\\tint dright = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.peek()).right;\\n\\t\\tInstruction d = (Instruction)((java_cup.runtime.Symbol) CUP$AnalyseurSyntaxique$stack.peek()).value;\\n\\t\\t Instruction in = d;\\n TDS.getInstance().sortieBloc();\\n RESULT = d; \\n CUP$AnalyseurSyntaxique$result = parser.getSymbolFactory().newSymbol(\\\"DECLARATION\\\",12, ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.peek()), ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.peek()), RESULT);\\n }\\n return CUP$AnalyseurSyntaxique$result;\\n\\n /*. . . . . . . . . . . . . . . . . . . .*/\\n case 56: // DECL_FONCTION ::= FONCTIONT IDF PARAMETRES DEBUT LINSTF FIN \\n {\\n Instruction RESULT =null;\\n\\t\\tint ileft = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-4)).left;\\n\\t\\tint iright = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-4)).right;\\n\\t\\tString i = (String)((java_cup.runtime.Symbol) CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-4)).value;\\n\\t\\tint pleft = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-3)).left;\\n\\t\\tint pright = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-3)).right;\\n\\t\\tArrayList<Idf> p = (ArrayList<Idf>)((java_cup.runtime.Symbol) CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-3)).value;\\n\\t\\tint lileft = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-1)).left;\\n\\t\\tint liright = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-1)).right;\\n\\t\\tArbreAbstrait li = (ArbreAbstrait)((java_cup.runtime.Symbol) CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-1)).value;\\n\\t\\t TDS.getInstance().ajouter(new EntreeFonction(i, ileft+1, p.size()), new SymboleFonction(TDS.getInstance().getTableLocaleCourante().getNumBloc()));\\n TDS.getInstance().getTableLocaleCourante().setNbParams(p.size());\\n RESULT = new DeclarerFonction(ileft+1, i, p, li);\\n \\n CUP$AnalyseurSyntaxique$result = parser.getSymbolFactory().newSymbol(\\\"DECL_FONCTION\\\",11, ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-5)), ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.peek()), RESULT);\\n }\\n return CUP$AnalyseurSyntaxique$result;\\n\\n /*. . . . . . . . . . . . . . . . . . . .*/\\n case 57: // FONCTIONT ::= FONCTION \\n {\\n String RESULT =null;\\n\\t\\t TDS.getInstance().entreeBloc();\\n CUP$AnalyseurSyntaxique$result = parser.getSymbolFactory().newSymbol(\\\"FONCTIONT\\\",0, ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.peek()), ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.peek()), RESULT);\\n }\\n return CUP$AnalyseurSyntaxique$result;\\n\\n /*. . . . . . . . . . . . . . . . . . . .*/\\n case 58: // PARAMETRES ::= PAROUVRANTE PARFERMANTE \\n {\\n ArrayList<Idf> RESULT =null;\\n\\t\\t RESULT = new ArrayList<>(); \\n CUP$AnalyseurSyntaxique$result = parser.getSymbolFactory().newSymbol(\\\"PARAMETRES\\\",17, ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-1)), ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.peek()), RESULT);\\n }\\n return CUP$AnalyseurSyntaxique$result;\\n\\n /*. . . . . . . . . . . . . . . . . . . .*/\\n case 59: // PARAMETRES ::= PAROUVRANTE PARAMETRESDECL PARFERMANTE \\n {\\n ArrayList<Idf> RESULT =null;\\n\\t\\tint prleft = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-1)).left;\\n\\t\\tint prright = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-1)).right;\\n\\t\\tArrayList<Idf> pr = (ArrayList<Idf>)((java_cup.runtime.Symbol) CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-1)).value;\\n\\t\\t RESULT = pr; \\n CUP$AnalyseurSyntaxique$result = parser.getSymbolFactory().newSymbol(\\\"PARAMETRES\\\",17, ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-2)), ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.peek()), RESULT);\\n }\\n return CUP$AnalyseurSyntaxique$result;\\n\\n /*. . . . . . . . . . . . . . . . . . . .*/\\n case 60: // PARAMETRESDECL ::= ENTIER IDF POINTVIRGULE PARAMETRESDECL \\n {\\n ArrayList<Idf> RESULT =null;\\n\\t\\tint ileft = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-2)).left;\\n\\t\\tint iright = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-2)).right;\\n\\t\\tString i = (String)((java_cup.runtime.Symbol) CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-2)).value;\\n\\t\\tint prleft = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.peek()).left;\\n\\t\\tint prright = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.peek()).right;\\n\\t\\tArrayList<Idf> pr = (ArrayList<Idf>)((java_cup.runtime.Symbol) CUP$AnalyseurSyntaxique$stack.peek()).value;\\n\\t\\t TDS.getInstance().getTableLocaleCourante().ajouter(new EntreeVariable(i, ileft+1), new SymboleVariable(Valeurs.getInstance().getTaillePile(TDS.getInstance().getTableLocaleCourante().getNumBloc())));\\n Valeurs.getInstance().empiler(TDS.getInstance().getTableLocaleCourante().getNumBloc());\\n pr.add(new Idf(ileft+1, i));\\n RESULT = pr;\\n \\n CUP$AnalyseurSyntaxique$result = parser.getSymbolFactory().newSymbol(\\\"PARAMETRESDECL\\\",18, ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-3)), ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.peek()), RESULT);\\n }\\n return CUP$AnalyseurSyntaxique$result;\\n\\n /*. . . . . . . . . . . . . . . . . . . .*/\\n case 61: // PARAMETRESDECL ::= ENTIER IDF \\n {\\n ArrayList<Idf> RESULT =null;\\n\\t\\tint ileft = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.peek()).left;\\n\\t\\tint iright = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.peek()).right;\\n\\t\\tString i = (String)((java_cup.runtime.Symbol) CUP$AnalyseurSyntaxique$stack.peek()).value;\\n\\t\\t ArrayList<Idf> al = new ArrayList<>();\\n TDS.getInstance().getTableLocaleCourante().ajouter(new EntreeVariable(i, ileft+1), new SymboleVariable(Valeurs.getInstance().getTaillePile(TDS.getInstance().getTableLocaleCourante().getNumBloc())));\\n Valeurs.getInstance().empiler(TDS.getInstance().getTableLocaleCourante().getNumBloc());\\n al.add(new Idf(ileft+1, i));\\n RESULT = al;\\n \\n CUP$AnalyseurSyntaxique$result = parser.getSymbolFactory().newSymbol(\\\"PARAMETRESDECL\\\",18, ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-1)), ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.peek()), RESULT);\\n }\\n return CUP$AnalyseurSyntaxique$result;\\n\\n /*. . . . . . . . . . . . . . . . . . . .*/\\n case 62: // DECL_VAR ::= ENTIER IDF POINTVIRGULE \\n {\\n Instruction RESULT =null;\\n\\t\\tint ileft = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-1)).left;\\n\\t\\tint iright = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-1)).right;\\n\\t\\tString i = (String)((java_cup.runtime.Symbol) CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-1)).value;\\n\\t\\t TDS.getInstance().getTableLocaleCourante().ajouter(new EntreeVariable(i, ileft+1), new SymboleVariable(Valeurs.getInstance().getTaillePile(TDS.getInstance().getTableLocaleCourante().getNumBloc())));\\n Valeurs.getInstance().empiler(TDS.getInstance().getTableLocaleCourante().getNumBloc());\\n RESULT = new Declarer(ileft+1, i);\\n \\n CUP$AnalyseurSyntaxique$result = parser.getSymbolFactory().newSymbol(\\\"DECL_VAR\\\",10, ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-2)), ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.peek()), RESULT);\\n }\\n return CUP$AnalyseurSyntaxique$result;\\n\\n /*. . . . . . . . . . . . . . . . . . . .*/\\n case 63: // DECL_VAR ::= ENTIER CROCHOUVRANT EXP CROCHFERMANT IDF POINTVIRGULE \\n {\\n Instruction RESULT =null;\\n\\t\\tint eleft = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-3)).left;\\n\\t\\tint eright = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-3)).right;\\n\\t\\tExpressionBinaire e = (ExpressionBinaire)((java_cup.runtime.Symbol) CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-3)).value;\\n\\t\\tint ileft = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-1)).left;\\n\\t\\tint iright = ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-1)).right;\\n\\t\\tString i = (String)((java_cup.runtime.Symbol) CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-1)).value;\\n\\t\\t TDS.getInstance().getTableLocaleCourante().ajouter(new EntreeTableau(i, ileft+1), new SymboleTableau(Valeurs.getInstance().getTaillePile(TDS.getInstance().getTableLocaleCourante().getNumBloc()), 4, e));\\n Valeurs.getInstance().empilerTableau(TDS.getInstance().getTableLocaleCourante().getNumBloc(), e);\\n RESULT = new DeclarerTableau(ileft+1, i, e);\\n \\n CUP$AnalyseurSyntaxique$result = parser.getSymbolFactory().newSymbol(\\\"DECL_VAR\\\",10, ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.elementAt(CUP$AnalyseurSyntaxique$top-5)), ((java_cup.runtime.Symbol)CUP$AnalyseurSyntaxique$stack.peek()), RESULT);\\n }\\n return CUP$AnalyseurSyntaxique$result;\\n\\n /* . . . . . .*/\\n default:\\n throw new Exception(\\n \\\"Invalid action number \\\"+CUP$AnalyseurSyntaxique$act_num+\\\"found in internal parse table\\\");\\n\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"88c68ad5811d253a479d5c2773129b22\",\n \"score\": \"0.556137\",\n \"text\": \"public abstract String apply(String target);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"085172313e7dddd718cebc037ab77ff0\",\n \"score\": \"0.5559617\",\n \"text\": \"public String parseAction(String action) {\\n finalMessage = \\\"\\\";\\n\\n char command = action.charAt(0);\\n // remember prof cell coordinate is (col, row)\\n int ySource = (new Integer(action.substring(1, 2)).intValue() - 1);\\n int xSource = (new Integer(action.substring(2, 3)).intValue() - 1);\\n int yTarget = new Integer(action.substring(3, 4)).intValue();\\n int xTarget = new Integer(action.substring(4, 5)).intValue();\\n\\n //check if either source and target position is out of the fantasy_board; this condition doesn't check whether the target x or y are equals 0.\\n if (xSource >= BOARD_SIDE_SIZE || ySource >= BOARD_SIDE_SIZE || xTarget > BOARD_SIDE_SIZE || yTarget > BOARD_SIDE_SIZE ||\\n xSource < 0 || ySource < 0 || xTarget < 0 || yTarget < 0) {\\n return generateError(\\\"ERROR: the final position is out of the fantasy_board\\\");\\n }\\n // for M, A, T: target (x,y) must be != 0; for F, H, R: target (x,y) must be == 0\\n if ((command == 'M' || command == 'A'|| command == 'T') && (xTarget == 0 || yTarget == 0) || (command == 'F'||\\n command == 'H' || command == 'R') && (xTarget != 0 || yTarget != 0)) {\\n return generateError(\\\"ERROR: invalid action\\\");\\n }\\n\\n // now can decrement target (x,y) to allow correct location for M, A, T; as for F, H or R, it's not considered at all\\n xTarget -= 1;\\n yTarget -= 1;\\n\\n boolean flag = false;\\n\\n // check if in position (ySource, xSource) there's a piece belonging to the player playing the current turn\\n Piece selectedPiece;\\n if(command=='F'){\\n selectedPiece = getPieceAtTurn((turn+1)%NUMBER_OF_PLAYERS, ySource, xSource);\\n }else{\\n selectedPiece = getPieceAtTurn(turn, ySource, xSource);\\n }\\n if (command!='R' && selectedPiece == null) {\\n flag = true;\\n }\\n\\n /* if the source position is wrong, that is either it's an invalid position ('0') or the position of the piece of\\n the opponent playing the turn\\n */\\n if (flag) {\\n return generateError(\\\"ERROR: the starting player isn't correct\\\");\\n }\\n\\n Direction movingDirection;\\n Direction attackingDirection;\\n Player playerPlaying;\\n\\n // these if-else separates the possible types of command\\n if (command == 'M') {\\n if(selectedPiece.getStatus()==Status.ACTIVE) {\\n movingDirection = selectedPiece.getMoveDirection();\\n if (movingDirection == HORIZONTAL_VERTICAL) {\\n //case HORIZONTAL_VERTICAL:\\n HorizontalVerticalMoveValidator hrValidator = new HorizontalVerticalMoveValidator(currentConfiguration, selectedPiece, xSource, ySource, xTarget, yTarget);\\n if (hrValidator.checkMove()) {\\n performMove(yTarget, xTarget, selectedPiece, hrValidator);\\n } else {\\n return generateError(\\\"ERROR: it's not possible to make a move\\\");\\n }\\n //case ANY:\\n } else if (movingDirection == ANY) {\\n AnyMoveValidator anyValidator = new AnyMoveValidator(currentConfiguration, selectedPiece, xSource, ySource, xTarget, yTarget);\\n if (anyValidator.checkMove()) {\\n performMove(yTarget, xTarget, selectedPiece, anyValidator);\\n } else {\\n return generateError(\\\"ERROR: it's not possible to make a move\\\");\\n }\\n }\\n }else{\\n return generateError(\\\"ERROR: This piece cannot be moved because frozen\\\");\\n }\\n } else if (command == 'A') {\\n if (selectedPiece.getStatus() == Status.ACTIVE) {\\n attackingDirection = selectedPiece.getAttackDirection();\\n\\n if (attackingDirection == HORIZONTAL_VERTICAL) {\\n HorizontalVerticalAttackValidator hvav = new HorizontalVerticalAttackValidator(currentConfiguration, selectedPiece, xSource, ySource, xTarget, yTarget);\\n if (hvav.checkAttack()) {\\n performAttack(xTarget, yTarget, selectedPiece);\\n } else {\\n return generateError(hvav.getErrorMessage());\\n }\\n } else if (attackingDirection == DIAGONAL) {\\n DiagonalAttackValidator dav = new DiagonalAttackValidator(currentConfiguration, selectedPiece, xSource, ySource, xTarget, yTarget);\\n if (dav.checkAttack()) {\\n performAttack(xTarget, yTarget, selectedPiece);\\n } else {\\n return generateError(dav.getErrorMessage());\\n }\\n }\\n else if (attackingDirection == NOT_AVAILABLE) {\\n return generateError(\\\"ERROR: neither mage nor squire can attack\\\");\\n }\\n }\\n else{\\n return generateError(\\\"ERROR: The selected piece cannot attack because it's frozen\\\");\\n }\\n }\\n // Commands regarding to casting spells\\n else if (command == 'H') {\\n if(playerHasMage(turn)) {\\n playerPlaying = players[this.turn];\\n HealValidator hvv = new HealValidator(getCurrentConfiguration(),selectedPiece,xSource,ySource,playerPlaying);\\n if (hvv.checkSpell()){\\n castHeal(selectedPiece, playerPlaying);\\n }else{\\n return generateError(hvv.getErrorMessage());\\n }\\n }else {\\n return generateError(\\\"ERROR: This player cannot cast spells\\\");\\n }\\n\\n } else if (command == 'T') {\\n if (playerHasMage(turn)) {\\n playerPlaying = players[this.turn];\\n TeleportValidator tv = new TeleportValidator(this.getCurrentConfiguration(),selectedPiece,xSource,ySource,xTarget,yTarget,playerPlaying);\\n if(tv.checkSpell()){\\n castTeleport(xSource, ySource, xTarget, yTarget, selectedPiece, playerPlaying);\\n }\\n else{\\n return generateError(tv.getErrorMessage());\\n }\\n } else {\\n return generateError(\\\"ERROR: This player cannot cast spells\\\");\\n }\\n\\n } else if (command == 'R') {\\n if (playerHasMage(turn)) {\\n playerPlaying = players[this.turn];\\n ReviveValidator rv = new ReviveValidator(this.getCurrentConfiguration(),selectedPiece,xSource,ySource,playerPlaying,initialConfiguration,turn);\\n if(rv.checkSpell()){\\n castRevive(rv.getSymbolToRevive(), xSource, ySource, playerPlaying);\\n }else{\\n return generateError(rv.getErrorMessage());\\n }\\n\\n }else {\\n return generateError(\\\"ERROR: This player cannot cast spells\\\");\\n }\\n\\n }else if (command == 'F') {\\n if (playerHasMage(turn)){\\n Player opponentPlayer = players[(turn+1)%NUMBER_OF_PLAYERS];\\n playerPlaying = players[turn];\\n FreezeValidator fv = new FreezeValidator(this.getCurrentConfiguration(),selectedPiece,xSource,ySource,playerPlaying,turn);\\n\\n if(fv.checkSpell()){\\n castFreeze(selectedPiece, playerPlaying, opponentPlayer);\\n }else{\\n return generateError(fv.getErrorMessage());\\n }\\n }else{\\n return generateError(\\\"ERROR: This player cannot cast spells\\\");\\n }\\n }\\n\\n return finalMessage;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2fe48faed4d97288ed60e369dc0fc7c5\",\n \"score\": \"0.5559301\",\n \"text\": \"public void act() \\n {\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d02a673dd50d2026962efc2206bb4b2\",\n \"score\": \"0.5558077\",\n \"text\": \"@Override\\n\\t\\tpublic void action() {\\n\\t\\t\\tMessageTemplate mt = MessageTemplate.MatchPerformative(ACLMessage.REQUEST);\\n\\t\\t\\tACLMessage msg = receive(mt);\\n\\t\\t\\tif (msg != null) {\\n\\t\\t\\t\\ttry {\\n\\t\\t\\t\\t\\tContentElement ce = null;\\n\\t\\t\\t\\t\\t// System.out.println(msg.getContent());\\n\\t\\t\\t\\t\\t// Let JADE convert from String to Java objects\\n\\t\\t\\t\\t\\t// Output will be a ContentElements\\n\\t\\t\\t\\t\\tce = getContentManager().extractContent(msg);\\n\\t\\t\\t\\t\\tif (ce instanceof Action) {\\n\\t\\t\\t\\t\\t\\tConcept action = ((Action) ce).getAction();\\n\\t\\t\\t\\t\\t\\tif (action instanceof SellPhones) {\\n\\t\\t\\t\\t\\t\\t\\tSellPhones order = (SellPhones) action;\\n\\t\\t\\t\\t\\t\\t\\tphoneOrdersMngr.phoneOrderReceived(order);\\n\\t\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"Received phone order\\\");\\n//\\t\\t\\t\\t\\t\\t\\tSystem.out.println(phoneOrdersMngr.orderToString(order));\\n\\t\\t\\t\\t\\t\\t\\torderCount++;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t} catch (CodecException ce) {\\n\\t\\t\\t\\t\\tce.printStackTrace();\\n\\t\\t\\t\\t} catch (OntologyException oe) {\\n\\t\\t\\t\\t\\toe.printStackTrace();\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tSystem.out.println(\\\"----------------\\\");\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tblock();\\n\\t\\t\\t}\\n\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b55a62da014d97a23e400891a5519f00\",\n \"score\": \"0.5556109\",\n \"text\": \"private int parseAction(IWContext iwc) {\\n \\t\\tiwc.toString(); // remove\\n \\t\\tint action = ACTION_DEFAULT;\\n \\t\\treturn action;\\n \\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c218b448b1151a26380f91c18a44ec49\",\n \"score\": \"0.55548805\",\n \"text\": \"public abstract Action nextAction(Area environment);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d4c51cdbe2e2e5a1ee5f12643023aa8\",\n \"score\": \"0.55527556\",\n \"text\": \"@Override\\n public void onAction(@NonNull String result) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d4c51cdbe2e2e5a1ee5f12643023aa8\",\n \"score\": \"0.55527556\",\n \"text\": \"@Override\\n public void onAction(@NonNull String result) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"48f422a0efe7fe0dca9f385568861daf\",\n \"score\": \"0.55472875\",\n \"text\": \"public static void main(String[] args) {\\n PrintStream out=System.out;\\n\\t\\tAction actA =new Robot();//机器人的行为\\n\\t\\tactA.command(Action.EAT);\\n\\t\\tactA.command(Action.WORK);\\n\\t\\t\\n\\t\\tAction actB=new Woman();//美女的行为\\n\\t\\tactB.command(Action.EAT+Action.SLEEP+Action.RUN);\\n\\t\\t\\n\\t\\tAction actc=new Man();//帅哥的行为\\n\\t\\tactc.command(Action.EAT+Action.SLEEP+Action.RUN+Action.WORK);\\n\\t\\t\\n\\t\\t\\n\\t\\t\\n\\t\\t\\n\\t\\t\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"35e123b081fa0adc3b2e6da0b6e26ad1\",\n \"score\": \"0.5543327\",\n \"text\": \"@Test\\n public void testParseMessageAction() {\\n\\t// todo\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4168f39c9a518a3f2afe34f7d99a856f\",\n \"score\": \"0.5537692\",\n \"text\": \"protected abstract A getTestAction();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0cc9e64ddd67e2af45e2df2b6da43a12\",\n \"score\": \"0.55352795\",\n \"text\": \"public T caseAction(Action object) {\\r\\n\\t\\treturn null;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0cc9e64ddd67e2af45e2df2b6da43a12\",\n \"score\": \"0.55352795\",\n \"text\": \"public T caseAction(Action object) {\\r\\n\\t\\treturn null;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0cc9e64ddd67e2af45e2df2b6da43a12\",\n \"score\": \"0.55352795\",\n \"text\": \"public T caseAction(Action object) {\\r\\n\\t\\treturn null;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0cc9e64ddd67e2af45e2df2b6da43a12\",\n \"score\": \"0.55352795\",\n \"text\": \"public T caseAction(Action object) {\\r\\n\\t\\treturn null;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f7e5eaee186ba0dc55a24fa38c8d5af0\",\n \"score\": \"0.55314267\",\n \"text\": \"List<Instruction> act(FullContext ctx, Bot bot);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a8a66743ab08f14e4a87509742713377\",\n \"score\": \"0.5528086\",\n \"text\": \"void executeGenericAction(Action action);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a6625ab967de77d3dc09ba44b189737\",\n \"score\": \"0.55228424\",\n \"text\": \"void executeAction(IAction action);\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":983188,"cells":{"query_id":{"kind":"string","value":"5010364c7021b1de8c6a8a9337f6bac6"},"query":{"kind":"string","value":"/ Used to get the students by CSDepartment class"},"positive_passages":{"kind":"list like","value":[{"docid":"f3a3375d89092167040b3ea857f944d5","score":"0.0","text":"public TreeSet<Student> getStudents(){\n \t return students;\n }","title":""}],"string":"[\n {\n \"docid\": \"f3a3375d89092167040b3ea857f944d5\",\n \"score\": \"0.0\",\n \"text\": \"public TreeSet<Student> getStudents(){\\n \\t return students;\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"5a8fa7eb508b0e284e8aa4513f0050e2","score":"0.69700116","text":"public List<Student> getStudentsInClass(Classroom classroom);","title":""},{"docid":"83f97302062d43073d7990e380fbf03a","score":"0.67889833","text":"Student getStudents();","title":""},{"docid":"71af0b651e9b3d8e9a476933c7cb8459","score":"0.67640746","text":"private static void studentBasedOnDepartment() {\r\n System.out.println(\"Enter the Department of the student cse/ece/eee/mech/it\");\r\n String departmentOfStudent = scan.next();\r\n for (Student s:studentdata) {\r\n if (departmentOfStudent.equalsIgnoreCase(s.getDepartmentOfStudent())) {\r\n System.out.println(\"The details of the student are\");\r\n System.out.println(\"FirstName :\" + s.getFirstNameOfStudent());\r\n System.out.println(\"LastName :\" + s.getLastNameOfStudent());\r\n System.out.println(\"Age :\" + s.getAgeOfStudent());\r\n System.out.println(\"Department :\" + s.getDepartmentOfStudent());\r\n System.out.println(\"Year :\" + s.getYearOfStudent());\r\n }\r\n }\r\n }","title":""},{"docid":"2526c80e7ee3ca3b607973c2e62e1e45","score":"0.6487636","text":"public static List<Student> getStudentList(String className) {\n List<Student> studentList = new ArrayList<>();\n for (Clase clase : management.getClase()) {\n if (clase.getName() == className) {\n for (Student student : management.getStudents()) {\n boolean validate = idStudentExistInClass(clase, student.getId());\n if (!validate) {\n studentList.add(student);\n }\n\n }\n }\n }\n return studentList;\n }","title":""},{"docid":"16349a0a9f97f28096a14d92e153abc3","score":"0.6473333","text":"public studentImpl getCollegeStudent(String id) ;","title":""},{"docid":"4c3d82c245b6c6e07c436a0a72df57ee","score":"0.6345581","text":"@RequestMapping(value = \"/class/{className}\", method = RequestMethod.GET)\n\tpublic List<Student> findStudentsWithClass(@PathVariable(value = \"className\") String className){\n\t\tpopulateSchoolAndStudents();\n\t\treturn studentList.stream().filter(s -> s.getClassName().equalsIgnoreCase(className)).collect(Collectors.toList());\n\t}","title":""},{"docid":"59d96b8dcdc3ca7a590a03c65ba98d5c","score":"0.6229872","text":"Set<ClassroomStudent> getClassroomStudents();","title":""},{"docid":"6c2054d0232fad3153bf51183ce7ad45","score":"0.62190694","text":"@Query(\"SELECT sc FROM StudentCourse as sc WHERE sc.user.userID = :esid\")\r\n\tList<StudentCourse> findEnrollmentByStuID(@Param(\"esid\") int esid);","title":""},{"docid":"df45f0db3a01ba6a3a603f6b6fb8e953","score":"0.61715585","text":"public List<Skills>getSkillsByDepartment(int departmentId)throws DAOException;","title":""},{"docid":"864f0a26f50fe7816bc8f89ab8399b2a","score":"0.6131614","text":"public Student getStudentById(int id);","title":""},{"docid":"82fc4525d7d3bf910e66aa57ed09caa9","score":"0.6125358","text":"public Department getStudentSchool() {\n return studentSchool;\n }","title":""},{"docid":"3327597306642a75f43bfa882fb3889d","score":"0.6124187","text":"List<User> selectByDepartmentSn(Params params);","title":""},{"docid":"92305d827ef914ad9196094fd0f26e2a","score":"0.6119559","text":"public List<Course> getCoursesByDepartment(String department){\n\t\tscanResult = client.scan(scanRequest);\n\t\tArrayList<Course> list = new ArrayList<>();\n\t\tfor (Map<String, AttributeValue> courseItem : scanResult.getItems()){\n\t\t\ttry{\n\t\t\t\tAttributeValue v = courseItem.get(\"department\");\n\t\t\t\tString dept = v.getS();\n\t\t\t\tif(dept.equalsIgnoreCase(department)) {\n\t\t\t\t\tv = courseItem.get(\"id\");\n\t\t\t\t\tString id = v.getS();\n\t\t\t\t\tCourse course = mapper.load(Course.class, id);\n\t\t\t\t\tlist.add(course);\n\t\t\t\t}\t\t\t\t\n\t\t\t} catch (Exception e){\n\t\t\t\tSystem.out.println(e.getMessage());\n\t\t\t}\n\t\t}\n\t\tif(list.isEmpty()) {\n\t\t\tthrow new DataNotFoundException(\"Didn't find courses for the department \" + department);\n\t\t}\n\t\treturn list;\n\t}","title":""},{"docid":"fb6570470f7471c866519f025df32bfa","score":"0.6109912","text":"public student findStudentByName(String name) throws Exception;","title":""},{"docid":"2cd7730eb8239e9a73e654e495b91b52","score":"0.6045256","text":"List<Department> getDepartmentList();","title":""},{"docid":"bec21d125cd3dfe759132072fdae5656","score":"0.60427934","text":"public List<Student> findStudentByLastname(String lastname);","title":""},{"docid":"d8307034557909a7866171c176aef7f8","score":"0.5987044","text":"public List<Student> getEnrolledStudentsDB(int courseId);","title":""},{"docid":"a9ce5718665a0b0ea3ba84be120a71d0","score":"0.59294754","text":"public CourseSet asStudentGetCourseSet();","title":""},{"docid":"16cde55502eb758e02d5fa3344c2cd8d","score":"0.5917876","text":"List<Student> get();","title":""},{"docid":"ccb53a0b103e10a4840cc09eaca682fc","score":"0.5910914","text":"@Override\n\tpublic List<CourseInfo> find(String cname, String semester, Integer status) {\n\t\tDBHelper db = new DBHelper();\n\t\tString sql = \"select * from CourseInfo where 1=1\";\n\t\tList<Object> params = new ArrayList<Object>();\n\t\tif (!StringUtil.isNull(cname)) {\n\t\t\tsql += \" and cname like ?\";\n\t\t\tparams.add(\"%\" + cname + \"%\");\n\n\t\t}\n\t\tif (!StringUtil.isNull(semester)) {\n\t\t\tsql += \" and semester = ?\";\n\t\t\tparams.add(semester);\n\n\t\t}\n\t\tif (status != null) {\n\t\t\tsql += \" and status = ?\";\n\t\t\tparams.add(status);\n\n\t\t}\n\n\t\treturn db.finds(sql, CourseInfo.class, params);\n\t}","title":""},{"docid":"f9e8e1b0a862d346f1f4d86d8d2b2f84","score":"0.59061074","text":"private void searchStaffByDepartmentName(String departmentName){\n ArrayList<Staff> staffFound = new ArrayList<>();\n for(Staff aStaff : staffList.getStaffList()) {\n if(aStaff.getDepartment().toLowerCase().equals(departmentName.toLowerCase())){\n staffFound.add(aStaff);\n }\n }\n // If there is no staff in the department\n // Then inform to the user\n if(staffFound.isEmpty()){\n System.out.println(\"-> No staff is found\");\n }\n // otherwise, print out staff's information\n else{\n System.out.println(String.format(Constants.SFSTAFFHEADER, \"ID\", \"Name\", \"Title\", \"Age\", \"Salary Grade\", \"Joining date\", \"Department\", \"Annual leave\", \"OT hours\"));\n for(Staff aStaff : staffFound){\n System.out.println(aStaff.toString());\n }\n }\n }","title":""},{"docid":"1fc0f942812ad5d6919248a78e3cbca2","score":"0.5885367","text":"List<Students> findFirstByFirstName(String firstName);","title":""},{"docid":"2d22c47d7619fa47242e80177f754972","score":"0.58795214","text":"@GET\n\tpublic List<Student> getStudents(@Context ContainerRequestContext requestContext,\n\t\t\t@QueryParam(\"classroomId\") String classId) {\n\t\tString userId = getUserId(requestContext);\n\t\tif (classId != null)\n\t\t\treturn studentService.getStudentsInClassroom(userId, classId);\n\t\treturn studentService.getStudents(userId);\n\n\t}","title":""},{"docid":"483ee2c48a80106ef67fb1260d590b8b","score":"0.5846973","text":"public static void getClassListWhereAStudentBelong(int idStudent) {\n for (Clase clase : management.getClase()) {\n for (Student student : clase.getStudents()) {\n if (student.getId() == idStudent) {\n System.out.println(\"Class Name: \" + clase.getName() + \" ||Class ID:\" + clase.getClassId() + \" ||Assigned ClassRoom: \" + clase.getAssignedClassRoom());\n }\n }\n }\n }","title":""},{"docid":"7056bde5b80d750b367714f53d20e027","score":"0.5845396","text":"public List<student> getAllStudents (){\n\t\treturn repos.findAll();\n\t}","title":""},{"docid":"734f9ee35c4fa67ed4a66ce3462bf7c9","score":"0.5835207","text":"List<Course> selectByExample(CourseExample example);","title":""},{"docid":"0aeeeceff97e15ca405546e0842ffbe3","score":"0.58236283","text":"@Override\n\tpublic Student selectStudent(String npm) {\n\t\tfor(Student s : studentList){\n\t\t\tif(s.getNpm().equals(npm)){\n\t\t\t\treturn s;\n\t\t\t}\n\t\t}\n\t\treturn null;\n\t}","title":""},{"docid":"34fdb235a487ac6a2b33461ae09ba628","score":"0.58030474","text":"@Override\n\t\n\tpublic List<Student> getStudents() {\n\t\tSession currentSession=sessionFactory.getCurrentSession();\n\t\t\n\t\t\n\t\t//create a query\n\t\tQuery<Student> query= currentSession.createQuery(\"from Student order by firstName\",Student.class);\n\t\t\n\t\t\n\t\t//execute query and get list\n\t\tList<Student> students=query.getResultList();\n\t\t\n\t\t\n\t\t//return list\n\treturn students;\n\t\n\t}","title":""},{"docid":"332ee76f1509c29545cb80d1488d9b66","score":"0.5777745","text":"List<Staff> findByDepartment(Department department);","title":""},{"docid":"5e9798fc85cdefdd726b10736c6c30c5","score":"0.5768813","text":"@Query(\"SELECT sc FROM StudentCourse as sc WHERE sc.status = 'Active'\")\r\n\tList<StudentCourse> findActiveEnrollment();","title":""},{"docid":"e8e13f24fe446edadae6d2b221107d5e","score":"0.5762197","text":"List<TSysDepartment> selectAll();","title":""},{"docid":"293658c35092e00e43ddde34614dd7d6","score":"0.5755723","text":"public List<Role> getRolesByDepartment(Department department);","title":""},{"docid":"f1e7a0714206ba072ef9e45911230e43","score":"0.57360315","text":"Student get(int id);","title":""},{"docid":"01f9e453d9d0393f0030565eb284e787","score":"0.57263094","text":"public static Student findMajor(ArrayList<Student> students, String major){\n for (int i = 0; i < students.size(); i++){\n if (major.equals(students.get(i).getMajor())){\n return students.get(i);\n }\n \n }\n Student noresult = new Student();//create an empty instance of student if the search failed\n noresult.setMajor(\"No result\");//return zero GPA and no result\n return noresult;\n }","title":""},{"docid":"1e6754e8e891a13fc9a3e091ffcfbd69","score":"0.5714129","text":"List<Student> getStudentList(int firstResult, int maxResults);","title":""},{"docid":"d3c0ea698087285596a8baa0245a8746","score":"0.57065237","text":"List<TCourse> selectByExample(TCourseExample example);","title":""},{"docid":"9ad570ef2c232db37be91194d76d5e44","score":"0.57042295","text":"java.lang.String getStudentName();","title":""},{"docid":"3b76dad9775e67f61878edc38fba859e","score":"0.5699748","text":"List<Department> getDepartments();","title":""},{"docid":"bbd81b3c30b1b470d937c6b8bfdc27a2","score":"0.56955135","text":"List<Department> getAllDepartment();","title":""},{"docid":"781c4e8fa184d930e523df8d1910fdd2","score":"0.56881934","text":"@Select(\"select name, npm, gpa from student\")\n @Results (value = {\n \t\t@Result (property=\"name\", column=\"name\"),\n \t\t@Result (property=\"npm\", column=\"npm\"),\n \t\t@Result (property=\"gpa\", column=\"gpa\"),\n \t\t@Result (property=\"course\", column=\"id_course\", \n \t\tjavaType = List.class, many= @Many(select= \"selectCourse\"))\n })\n List<CourseModel> selectStudent();","title":""},{"docid":"80f7d8d88e711de83f06dda9249e1e03","score":"0.5686172","text":"List<Students> findByFirstName(String firstName);","title":""},{"docid":"66504e8fa10e2911adcee1ef249cf47a","score":"0.56825155","text":"public ArrayList<Student> getStudents(Integer taeId, String course) {\n\t\tString hql = \"from Student where studentId in (select studentId from StudentCourse where courseId in (select courseId from Course where teacherId=? and courseName=?))\";\n\t\tQuery q = getSession().createQuery(hql);\n\t\tq.setParameter(0, taeId);\n\t\tq.setParameter(1, course);\n\t\tArrayList<Student> students =(ArrayList<Student>)q.list();\t\t\t\n\t\treturn students;\n\t}","title":""},{"docid":"12f196d626a6b2331de73ae6b1ea10da","score":"0.56756204","text":"public void setStudentSchool(Department studentSchool) {\n this.studentSchool = studentSchool;\n }","title":""},{"docid":"2fdb7c29dd58084258860f580540c3f5","score":"0.5659142","text":"public List<ProfessionalCourseClass> findByCourseId(int courseId);","title":""},{"docid":"ceb347191d65399b04df9a599764a490","score":"0.5658818","text":"ArrayList<Course> searchAllCourses(int profID) {\n try {\n String sql = \"SELECT * FROM \" + courseTableName;\n statement = jdbc_connection.prepareStatement(sql);\n ResultSet courses = statement.executeQuery();\n Course temp;\n ArrayList<Course> courseList = new ArrayList<>();\n while(courses.next())\n {\n boolean activeBoolean = false;\n if(courses.getString(\"ACTIVE\").charAt(0)=='0') {\n activeBoolean = false;\n }\n else if(courses.getString(\"ACTIVE\").charAt(0)=='1') {\n activeBoolean = true;\n }\n temp = new Course (courses.getInt(\"PROFESSORID\"),\n courses.getString(\"COURSENAME\"),\n activeBoolean);\n temp.setCourseID(courses.getInt(\"ID\"));\n if(profID == temp.getProfessorID()){\n courseList.add(temp);\n }\n }\n courses.close();\n return courseList;\n } catch (SQLException e) {\n e.printStackTrace();\n }\n return null;\n }","title":""},{"docid":"2e84321f0fc9e4eedbc14f5ec630a9d5","score":"0.5642834","text":"@Override\r\n public List<GradeClass> findClassList( String schoolId) {\n\r\n GradeClassExample example = new GradeClassExample();\r\n example.createCriteria().andDelFlagEqualTo( 0).andSchoolIdEqualTo( schoolId);\r\n List<GradeClass> gradeClassList = gradeClassMapper.selectByExample( example);\r\n List<String> xd = new ArrayList<String>();\r\n for (GradeClass gradeClass:gradeClassList) {\r\n if ( !xd.contains( gradeClass.getXd())) {\r\n xd.add(gradeClass.getXd());\r\n }\r\n }\r\n Collections.sort(xd);\r\n for ( GradeClass gradeClass:gradeClassList){\r\n gradeClass.setRemarks(ConstantUtil.getValueByKeyAndFlag(Integer.valueOf(gradeClass.getXd()),\"xd\")+\r\n ConstantUtil.getValueByKeyAndFlag(gradeClass.getNj(),\"nj\")+\r\n gradeClass.getName());\r\n gradeClass.setName(gradeClass.getXd()+\",\"+gradeClass.getNj()+\",\"+gradeClass.getName());\r\n\r\n }\r\n return gradeClassList;\r\n }","title":""},{"docid":"ad85f55ca0a87fdc5c64992e9ddbad3f","score":"0.564147","text":"public List<Department>getDepartmentByCompanyCode(int companyCode)throws DAOException;","title":""},{"docid":"0c0feb4d35ae5b57c0e8c2b06a897b0c","score":"0.56379646","text":"public Student search(String pLastName){\n return getRoster().getStudent(pLastName);\n }","title":""},{"docid":"2bb279472a1a5d1b8278d2b8c44142e6","score":"0.56299025","text":"List<SubjectDTO> getSubjectsByInstructorId(Long instructorId);","title":""},{"docid":"a5822386d2372ac9bb2738030c935714","score":"0.5626787","text":"public List<Course> findByName(String courseName);","title":""},{"docid":"419aa1e02b584b41b5b75dc18e776f80","score":"0.5609511","text":"public void showStaffByDepartment(){\n if(!departmentList.getDepartmentList().isEmpty()){\n System.out.println(\"\\n* Staff by Department\");\n for(Department aDepartment : departmentList.getDepartmentList()){\n System.out.println(\"** Department: \" + aDepartment.getDepartmentName());\n searchStaffByDepartmentName(aDepartment.getDepartmentName());\n }\n System.out.println();\n }\n else{\n System.out.println(\"-> Sorry, there is no department created yet\");\n }\n promptEnter();\n }","title":""},{"docid":"aaed5b0ec0d1b4389e1f58692c829e4b","score":"0.5602381","text":"public static Student findStudent()\n { \n Student foundStudent = null;\n boolean firstLoop = true;\n \n System.out.println(\"\");\n System.out.println(\"All Student Name's Below:\");\n for (Student s:Classroom.studentList)\n {\n System.out.println(s.getFirstName() + \" \" + s.getLastName());\n }\n \n while (foundStudent == null)\n {\n if (!firstLoop)\n {\n System.out.println(\"Re-Enter a name please. The name you inputted was inccorect: \");\n }\n String findingStudent = Greenfoot.ask(\"Please enter the name of the student you want to find (Enter First and Last Name!): \");\n for (Student s:Classroom.studentList)\n {\n if (findingStudent.toLowerCase().equals(s.getFirstName().toLowerCase() + \" \" + s.getLastName().toLowerCase()))\n {\n foundStudent = s;\n }\n }\n firstLoop = false;\n }\n \n return foundStudent;\n }","title":""},{"docid":"f5f5253f652b0442d98edeaed4bf2c55","score":"0.56019545","text":"public List<Student> getSearchStudent() {\n\t\treturn searchedStudentList;\n\t}","title":""},{"docid":"f2e8e10fcbb89bd897ac085f5385c768","score":"0.5596281","text":"List<Student> selectAll();","title":""},{"docid":"8fd6ad68a49a575e82d4e3b116217a44","score":"0.5589517","text":"public List<Course> getCourses(String professorUsername) {\n\n List<Course> courses = new ArrayList<>();\n String query = \"select * from courses where instructor_username = ?\";\n\n try ( Connection con = ds.getConnection();\n PreparedStatement stmt = con.prepareStatement(query)) {\n\n stmt.setString(1, professorUsername);\n\n try (ResultSet rs = stmt.executeQuery()) {\n while (rs.next()) {\n courses.add(new Course(\n rs.getString(\"id\"),\n rs.getString(\"title\"),\n rs.getInt(\"ects\"),\n rs.getInt(\"teaching_hours\"),\n rs.getString(\"instructor_username\"),\n rs.getInt(\"semester\"),\n rs.getString(\"department_id\")));\n }\n }\n\n } catch (SQLException e) {\n e.printStackTrace();\n }\n\n return courses;\n }","title":""},{"docid":"594c54cd5c1708a24e5f5e158a2d9ab3","score":"0.5582761","text":"@Override\r\n\tpublic List<Customer> getCustListByDept(String department,Page<Customer> page) {\n\t\tList<Customer> custList = custMapper.getCustListByDept(department, page);\r\n\t\treturn custList;\r\n\t}","title":""},{"docid":"aff39794bd381b39229290a47221ae10","score":"0.5580509","text":"public List<User> getProfessorsByDept(String departmentId) {\n List<User> professors = new ArrayList<>();\n\n Connection con = null;\n ResultSet rs = null;\n PreparedStatement stmt = null;\n\n String query =\n \"SELECT * FROM javapart3.users WHERE role_id='instructor' AND department_id=?\";\n\n try {\n con = ds.getConnection();\n\n stmt = con.prepareStatement(query);\n stmt.setString(1, departmentId);\n\n rs = stmt.executeQuery();\n\n while (rs.next()) {\n professors.add(new User(\n rs.getString(\"username\"),\n null, rs.getString(\"first_name\"),\n rs.getString(\"last_name\"),\n rs.getLong(\"phone_number\"),\n rs.getString(\"email\"),\n rs.getString(\"role_id\"),\n rs.getString(\"department_id\")));\n }\n\n } catch (SQLException e) {\n e.printStackTrace();\n } finally {\n try {\n rs.close();\n stmt.close();\n con.close();\n } catch (SQLException e) {\n e.printStackTrace();\n }\n }\n\n return professors;\n }","title":""},{"docid":"bcb9595354fa2e130b440255da9d514f","score":"0.5575121","text":"cn.edu.jxau.netty.protobuf.multi.DataInfo.Student getStudent();","title":""},{"docid":"349c459b3c930c4038eb55245bbb80c4","score":"0.55692303","text":"public String identifyDepartment(int empId);","title":""},{"docid":"89c085373dc6ac9524dca65ed6931ed4","score":"0.5563901","text":"public List<MarksBean> getStudentList(String lec_id) {\n List<MarksBean> result = null;\n try {\n String sql = \"SELECT user.user_id, subject.sub_code FROM user INNER JOIN subject ON user.reg_year = subject.year WHERE subject.lecturer_id = '\"+lec_id+\"'\";\n result = template.query(sql, new RowMapper<MarksBean>() {\n @Override\n public MarksBean mapRow(ResultSet rs, int rowNum) throws SQLException {\n MarksBean res = new MarksBean();\n res.setUser_id(rs.getString(\"user_id\"));\n res.setSub_code(rs.getString(\"sub_code\"));\n return res;\n }\n });\n }catch (Exception e){\n System.out.println(e);\n }\n return result;\n }","title":""},{"docid":"a9df1dcd10ee8425c55d7b2527f7c057","score":"0.55612403","text":"public Student getStudent(int stud) {\n\t\tif (stud > studentList.size() - 1 || stud < 0)\n\t\t\treturn null;\n\t\treturn studentList.get(stud);\n\t}","title":""},{"docid":"10d1b85eab6c1c0a599246c41a7fb587","score":"0.5550469","text":"public Vector <Teacher> searchByCpf (String cpf) throws SQLException,\n\t\t\tClienteException {\n\n\t\tString selectQuery = \"SELECT * FROM professor WHERE cpf = \" + \"\\\"\"\n\t\t\t\t+ cpf + \"\\\";\";\n\t\tVector<Teacher> selectedTeachers = this.search(selectQuery); \n\t\treturn selectedTeachers;\n\t}","title":""},{"docid":"e3178d75cae1b5f5136c8891ba3d3097","score":"0.5549313","text":"ArrayList<StudentEnrollment> searchAllStudentEnrollments(int courseID) {\n try {\n String sql = \"SELECT * FROM \" + studentEnrollmentTableName;\n statement = jdbc_connection.prepareStatement(sql);\n ResultSet enrollments = statement.executeQuery();\n StudentEnrollment temp;\n ArrayList<StudentEnrollment> enrollmentList = new ArrayList<>();\n while(enrollments.next())\n {\n boolean activeBoolean = false;\n if(enrollments.getString(\"ACTIVE\").charAt(0)=='0') {\n activeBoolean = false;\n }\n else if(enrollments.getString(\"ACTIVE\").charAt(0)=='1') {\n activeBoolean = true;\n }\n temp = new StudentEnrollment (enrollments.getInt(\"STUDENTID\"),\n enrollments.getInt(\"COURSEID\"), activeBoolean);\n temp.setEnrollmentID(enrollments.getInt(\"ID\"));\n\n if(courseID == temp.getCourseID()){\n enrollmentList.add(temp);\n }\n }\n enrollments.close();\n return enrollmentList;\n } catch (SQLException e) {\n e.printStackTrace();\n }\n return null;\n }","title":""},{"docid":"a61df993937084b957b9ff5f25f80db2","score":"0.5538876","text":"List<Students> findByLastName(String lastName);","title":""},{"docid":"a1993be0a09efc9f6bc843dcfe801952","score":"0.5538118","text":"public List<Course> findByName(String name);","title":""},{"docid":"687accf5d09a8c08260379b048105eb9","score":"0.5537797","text":"String nameOfDepartment();","title":""},{"docid":"f5553da0dc122f0b1d76ece6892b8df8","score":"0.55374825","text":"@Select(\"select student.npm, name, gpa \" + \n \"from student join studentcourse \" + \n \"on student.npm = studentcourse.npm \" + \n \"where studentcourse.id_course = #{id_course}\")\n List<StudentModel> selectStudents (@Param(\"id_course\") String id_course);","title":""},{"docid":"642f51f5338ba2dbe0a5021e27ccbd8e","score":"0.55374676","text":"@Override\r\n\tpublic List<Enrolment> findstudentbylecturerid(String s) {\n\t\treturn scRepository.findstudentbylecturerid(s);\r\n\t}","title":""},{"docid":"22e6d8276979ffb662694385a9d0c415","score":"0.55347943","text":"List<BaseUniversity> selectByExample(BaseUniversityExample example);","title":""},{"docid":"e84bf9cac97f902d8c6096303dd0f01e","score":"0.55320144","text":"@Override\n public Student queryBySno(String sno) {\n return studentMapper.queryById(sno);\n }","title":""},{"docid":"ad7ab040df46cb5c3a04b6ad423a7c2e","score":"0.5529405","text":"public static List<Student> getStudentList() {\n stuList = new ArrayList<Student>();\n Student s1 = new Student();\n s1.setName(\"abc\");\n s1.setRollno(1);\n s1.setTotalMarks(200);\n stuList.add(s1);\n s1 = new Student();\n s1.setName(\"def\");\n s1.setRollno(2);\n s1.setTotalMarks(400);\n stuList.add(s1);\n s1 = new Student();\n s1.setName(\"xyz\");\n s1.setRollno(3);\n s1.setTotalMarks(260);\n stuList.add(s1);\n return stuList;\n }","title":""},{"docid":"cd097b67b53d190d74992f0a3adfa433","score":"0.5524551","text":"public List<Course> getAllTeacherStudentCourses() {\n User user = getCurrentUser();\n List<Course> listCourses = courseRepo.findAll();\n return listCourses.stream().filter(c -> c.getUsers().contains(user)).collect(Collectors.toList());\n\n }","title":""},{"docid":"26e4fe56af7877d8ebfa29e94a0cab82","score":"0.55033916","text":"public ArrayList<String> byDepartment(String department){\n\t\t//American ArrayLists\n\t\tArrayList<String> AmericanURL = new ArrayList<String>();\n\t\tArrayList<String> Across110thStreet = new ArrayList<String>();\n\t\tArrayList<String> AmazingGrace = new ArrayList<String>();\n\t\tArrayList<String> HobosLullaby = new ArrayList<String>();\n\t\tArrayList<String> HonkyTonkin = new ArrayList<String>();\n\t\tArrayList<String> NightTrain = new ArrayList<String>();\n\t\tArrayList<String> Offbeat = new ArrayList<String>();\n\t\tArrayList<String> SomethingInsideOfMe = new ArrayList<String>();\n\t\tArrayList<String> TheMoonshineShow = new ArrayList<String>();\n\t\tArrayList<String> TuesdaysJustAsBad = new ArrayList<String>();\t\t\n\t\t\n\t\t\n\t\t//American ALL [10 pages]\n\t\tAmericanURL.add(\"https://www.cc-seas.columbia.edu/wkcr/playlist?field_department_nid=52\");\n\t\tfor (int i = 1; i < 10; i++){\n\t\t\tAmericanURL.add(\"https://www.cc-seas.columbia.edu/wkcr/playlist?page=\" + i + \"&field_department_nid=52\");\n\t\t}\n\t\t//American ACROSS 110TH STREET [1 page]\n\t\tAcross110thStreet.add(\"https://www.cc-seas.columbia.edu/wkcr/playlist?field_station_program_nid=70\");\n\t\t//American AMAZING GRACE [1 page]\n\t\tAmazingGrace.add(\"https://www.cc-seas.columbia.edu/wkcr/playlist?field_station_program_nid=5\");\n\t\t//American HOBO'S LULLABY [1 page]\n\t\tHobosLullaby.add(\"https://www.cc-seas.columbia.edu/wkcr/playlist?field_station_program_nid=2340\");\n\t\t//American HONKY TONKIN [1 page]\n\t\tHonkyTonkin.add(\"https://www.cc-seas.columbia.edu/wkcr/playlist?field_station_program_nid=28\");\n\t\t//American NIGHT TRAIN [1 page]\n\t\tNightTrain.add(\"https://www.cc-seas.columbia.edu/wkcr/playlist?field_station_program_nid=30\");\n\t\t//American OFFBEAT [2 pages]\n\t\tOffbeat.add(\"https://www.cc-seas.columbia.edu/wkcr/playlist?field_station_program_nid=31\");\n\t\tOffbeat.add(\"https://www.cc-seas.columbia.edu/wkcr/playlist?page=1&field_station_program_nid=31\");\n\t\t//American SOMETHING INSIDE OF ME [1 page]\n\t\tSomethingInsideOfMe.add(\"https://www.cc-seas.columbia.edu/wkcr/playlist?field_station_program_nid=4899\");\n\t\t//American THE MOONSHINE SHOW [2 pages]\n\t\tTheMoonshineShow.add(\"https://www.cc-seas.columbia.edu/wkcr/playlist?field_station_program_nid=6\");\n\t\tTheMoonshineShow.add(\"https://www.cc-seas.columbia.edu/wkcr/playlist?page=1&field_station_program_nid=6\");\n\t\t//American TUESDAYS JUST AS BAD [2 pages]\n\t\tTuesdaysJustAsBad.add(\"https://www.cc-seas.columbia.edu/wkcr/playlist?field_station_program_nid=29\");\n\t\tTuesdaysJustAsBad.add(\"https://www.cc-seas.columbia.edu/wkcr/playlist?page=1&field_station_program_nid=29\");\n\t\t\n\t\tif (department == \"American\"){\n\t\t\tdepartmentURL = AmericanURL;\n\t\t}\n\t\tif (department == \"Across 110th Street\"){\n\t\t\tdepartmentURL = Across110thStreet;\n\t\t}\n\t\tif (department == \"Amazing Grace\"){\n\t\t\tdepartmentURL = AmazingGrace;\n\t\t}\n\t\tif (department == \"Hobo's Lullaby\"){\n\t\t\tdepartmentURL = HobosLullaby;\n\t\t}\n\t\tif (department == \"Honky Tonkin\"){\n\t\t\tdepartmentURL = HonkyTonkin;\n\t\t}\n\t\tif (department == \"Night Train\"){\n\t\t\tdepartmentURL = NightTrain;\n\t\t}\n\t\tif (department == \"Offbeat\"){\n\t\t\tdepartmentURL = Offbeat;\n\t\t}\n\t\tif (department == \"Something Inside of Me\"){\n\t\t\tdepartmentURL = SomethingInsideOfMe;\n\t\t}\n\t\tif (department == \"The Moonshine Show\"){\n\t\t\tdepartmentURL = TheMoonshineShow;\n\t\t}\n\t\tif (department == \"Tuesday's Just As Bad\"){\n\t\t\tdepartmentURL = TuesdaysJustAsBad;\n\t\t}\n\t\treturn departmentURL;\n\t}","title":""},{"docid":"fc4a175c14bbfc07aefddbbb6d3a5ef0","score":"0.54987746","text":"ArrayList<StudentEnrollment> searchUsers(String lastName) {\n try{\n printUserTable();\n String sql = \"SELECT * FROM \" + userTableName + \" WHERE LASTNAME = '\" + lastName + \"'\";\n statement = jdbc_connection.prepareStatement(sql);\n ResultSet users = statement.executeQuery();\n ArrayList<StudentEnrollment> enrollmentList = new ArrayList<>();\n\n if(users == null) {\n return null;\n }\n User temp = null;\n while(users.next())\n {\n temp = new User (users.getString(\"EMAIL\"),\n users.getString(\"LASTNAME\"),\n users.getString(\"FIRSTNAME\"),\n users.getString(\"TYPE\").charAt(0));\n temp.setID( users.getInt(\"ID\"));\n\n ArrayList<StudentEnrollment> se = searchStudentEnrollment(temp.getID());\n StudentEnrollment [] enrollments = se.toArray(new StudentEnrollment [se.size()]);\n if(enrollments[0]!=null) {\n enrollmentList.add(enrollments[0]);\n }\n }\n users.close();\n return enrollmentList;\n }catch (SQLException e) { e.printStackTrace(); }\n return null;\n }","title":""},{"docid":"e934d7499b0f67f66ea244ad2c9d642a","score":"0.54946995","text":"@Override\r\n\tpublic List<Student> findAllStudents() {\n\r\n\t\tList<Student> students = new ArrayList<Student>();\r\n\r\n\t\tString FIND_ALL_STUDENTS = \"select * from student\";\r\n\r\n\t\ttry {\r\n\t\t\tClass.forName(\"oracle.jdbc.driver.OracleDriver\");\r\n\t\t\tSystem.out.println(\"Driver loaded successfully\");\r\n\r\n\t\t\t// 2. get the connection\r\n\t\t\tConnection con = DriverManager.getConnection(\"jdbc:oracle:thin:@localhost:1521:xe\", \"rupashi\", \"1234\");\r\n\t\t\tSystem.out.println(\"Connection obtained.\");\r\n\r\n\t\t\tStatement st = con.createStatement();\r\n\t\t\tResultSet set = st.executeQuery(FIND_ALL_STUDENTS);\r\n\t\t\twhile (set.next()) {\r\n\r\n\t\t\t\tint rollNo = set.getInt(\"rno\");\r\n\t\t\t\tString name = set.getString(\"name\");\r\n\t\t\t\tint total = set.getInt(\"total\");\r\n\t\t\t\tStudent student = new Student(rollNo, name, total);\r\n\t\t\t\tstudents.add(student);\r\n\t\t\t}\r\n\r\n\t\t} catch (ClassNotFoundException e) {\r\n\t\t\t// TODO Auto-generated catch block\r\n\t\t\te.printStackTrace();\r\n\t\t} catch (SQLException e) {\r\n\t\t\t// TODO Auto-generated catch block\r\n\t\t\te.printStackTrace();\r\n\t\t}\r\n\r\n\t\treturn students;\r\n\r\n\t}","title":""},{"docid":"1c92f210dd1fce8893a47431e9f85b66","score":"0.54928356","text":"@Override\n public List<Student> getStudentsFromClassroom(Long id) {\n return studentRepository\n .findAll()\n .stream()\n .filter(student -> student.getClassroom().getId().equals(id))\n .collect(Collectors.toList());\n }","title":""},{"docid":"6aa1b2612d097b48b97112df6a57c75f","score":"0.54912084","text":"List<Students> getAllRecordsByFirstName(@Param(\"firstName\")String firstName);","title":""},{"docid":"ef0e005189d687b3c5156c3253b044b9","score":"0.54843396","text":"@Override\n\tpublic List<Tblstudentgrades> getStudentList(int facultyId) {\n\t\treturn enrollmentMapper.getStudentList(facultyId);\n\t}","title":""},{"docid":"648d1afc8cfec3f3b28da79f9ddc70c2","score":"0.54689217","text":"public List<Subject> getSubjectsOfAStudentUser() {\n User user = getCurrentUser();\n return user.getCourses().stream().filter(c -> Objects.nonNull(c.getSubject())).map(Course::getSubject)\n .sorted((c1, c2) -> c1.getId().compareTo(c2.getId())).collect(Collectors.toList());\n\n }","title":""},{"docid":"b98d3a775409c1edd4628973b59f5e9d","score":"0.5468857","text":"public List<Student> listStudent() {\n\t\ttry {\n\t\t\tSession s = HibernateUtil.currentSession();\n\t\t\tHibernateUtil.beginTransaction();\n\t\t\tList<Student> results = s.createQuery(\"from Student stu\").list();\n\t\t\tHibernateUtil.commitTransaction();\n\t\t\tHibernateUtil.closeSession();\n\t\t\tif (results != null && results.size() > 0) {\n\t\t\t\treturn results;\n\t\t\t}\n\t\t} catch (HibernateException e) {\n\t\t\tlog.fatal(e);\n\t\t}\n\t\treturn null;\n\t}","title":""},{"docid":"9415090a92fafa61ae1c9d4efa2827e2","score":"0.5457662","text":"public ArrayList<Degree> getDegreesByDepartment(String abbreviation) {\n \n Statement stmt = null;\n ResultSet rs = null;\n Connection connection = null;\n \n String esc = \"\\\"\";\n ArrayList<Degree> toReturn = new ArrayList<Degree>();\n try {\n connection = DBConnection.getConnection();\n stmt = connection.createStatement();\n rs = stmt.executeQuery(\"SELECT * FROM \" + TABLE\n + \" WHERE department_abbreviation=\"\n + esc + abbreviation + esc\n + \" order by title\");\n while (rs.next()) {\n Degree b = getDegreeFromResultSet(rs);\n toReturn.add(b);\n }\n } catch (SQLException e) {\n e.printStackTrace();\n } finally {\n DBConnection.releaseConnection(connection);\n }\n return toReturn;\n }","title":""},{"docid":"987982f906d5beb2f5226fbc94e02c29","score":"0.5456879","text":"@Override\n\tpublic Student findStudent(String examid) {\n\t\treturn null;\n\t}","title":""},{"docid":"da0029556c52508eb78276705bd70845","score":"0.54565555","text":"@Override\n\tpublic List<Banji> findCourse() {\n\t\treturn studentDao.findCourse();\n\t}","title":""},{"docid":"a448d8349a30a586ae90bb40ee62d7fb","score":"0.5455143","text":"public static void getInformationRelatedWithTheSelectedClass(int classId) {\n\n for (Clase clase : management.getClase()) {\n if (clase.getClassId()==classId) {\n System.out.println(\"Class Name:\" + clase.getName() + \" ||Class ID: \"+ clase.getClassId() + \" ||Assigned Class Room:\" + clase.getAssignedClassRoom() + \"||\");\n System.out.println(\"........................................................................................................\");\n System.out.println(\"Assigned Teacher:\");\n System.out.println(clase.getTeacher().toString());\n System.out.println(\"........................................................................................................\");\n System.out.println(\"Students List:\");\n for (Student student : clase.getStudents()) {\n System.out.println(student);\n }\n }\n }\n }","title":""},{"docid":"4e856396d4b5bd747acae0eec5c34c62","score":"0.5452483","text":"List<Students> findByFirstNameAndMiddleName(String firstName,String middleName);","title":""},{"docid":"50dbfe8aa97162aecbbc0b98124015b3","score":"0.5451688","text":"public void facultyStudents(String facultyName) {\n\t\t\tList<List<Course>> courses = persons.stream()\n\t\t\t\t.filter(p -> p instanceof Faculty)\n\t\t\t\t.map(e-> {\n\t\t\t\t\tFaculty f = (Faculty)e;\t\t\t\t\t\n\t\t\t\t\treturn f;\t\t\n\t\t\t\t})\n\t\t\t\t.peek(e -> System.out.println(\"Mapped value: \" + e))\n\t\t\t\t.filter(f-> f.getName().equals(facultyName))\n\t\t\t\t.map(f -> f.getCourses())\n\t\t\t\t.peek(e -> System.out.println(\"Mapped value 2: \" + e))\n\t\t\t\t.collect(Collectors.toList());\n\t\t\n\t\t\t\t\n\t}","title":""},{"docid":"7efd20bfd4b4e0df42e619b36902b9c3","score":"0.5449179","text":"public List<Enrolled> getStudentEnrollment(String student_fk) {\n Connection conn = null;\n PreparedStatement stmt = null;\n ResultSet rs = null;\n List<Enrolled> rval = new ArrayList<>();\n\n try {\n conn = DriverManager.getConnection(__jdbcUrl);\n\n stmt = conn.prepareStatement(\"select * from enrolled where student_fk = ?\");\n stmt.setString(1,student_fk);\n rs = stmt.executeQuery();\n while (rs.next()) {\n rval.add(new Enrolled(rs.getInt(1), rs.getInt(2), rs.getString(3)));\n }\n }\n catch (Exception se) {\n se.printStackTrace();\n return null;\n }\n finally {\n DbUtils.closeConnections(rs, stmt, conn);\n }\n\n return rval;\n }","title":""},{"docid":"4871512c3a0f2a87a72917923d8d07c8","score":"0.54476523","text":"@Override\n\tpublic ArrayList<RegisteredCourses> viewCourseStudents(String courseID, Integer semesterID) throws NoStudentInCourseException{\n\t\tConnection connection=DBUtil.getConnection();\n\t\ttry {\n\t\t\tPreparedStatement stmt = connection.prepareStatement(SQLQueries.VIEW_REGISTERED_STUDENTS(courseID, semesterID));\n\t\t\tstmt.setString(1, courseID);\n\t\t\tstmt.setInt(2, semesterID);\n\t\t\tResultSet rs = stmt.executeQuery();\n\t\t\t\n\t\t\tArrayList<RegisteredCourses> ans = new ArrayList<RegisteredCourses>();\n\t\t\tArrayList<String> temp = new ArrayList<String>();\n\t\t\tif(!rs.next())\n\t\t\t{\n\n\t\t\t\tthrow new NoStudentInCourseException(courseID);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tdo {\n\t\t\t\t\ttemp.add(rs.getString(\"course_id\"));\n\t\t\t\t\tRegisteredCourses tempObject = new RegisteredCourses(rs.getInt(\"student_id\"), rs.getInt(\"semester_id\"), temp);\n\t\t\t\t\tans.add(tempObject);\n\t\t\t\t\ttemp.clear();\n\t\t\t\t}while(rs.next());\n\t\t\t}\n\t\t\t\n\n\t\t\treturn ans;\n\t\t}\n\t\tcatch(SQLException e) {\n\t\t}\n\t\t\n\t\treturn null;\n\t}","title":""},{"docid":"25c1a45ec62c26d9ec7140ac84b9a16f","score":"0.5446191","text":"@Override\n\tpublic List<Map<String, Object>> searchBanjiCourse(String classname) {\n\t\treturn studentDao.searchBanjiCourse(classname);\n\t}","title":""},{"docid":"aaaacd7896f608fcd79482ee76bc2195","score":"0.5440708","text":"public String getCollege();","title":""},{"docid":"cbea8c7a9a63a49d6d8617307f678761","score":"0.54404855","text":"@Override\n public List<mmStaff> listStaffsByDepartment(String departmentCode){\n \ttry {\n \t\tif(departmentCode != null){\n \t\t\treturn staffDAO.listStaffsByDepartment(departmentCode);\n \t\t}\n \t\treturn null;\n } catch (Exception e) {\n System.out.println(\"Exception: \" + e.getMessage());\n return null;\n }\n }","title":""},{"docid":"e8daea42d23de50c03ee41a331310b6e","score":"0.54381835","text":"@SuppressWarnings(\"unchecked\")\r\n\t@Override\r\n\tpublic List<Department> select(String CollegeID) {\n\t\tList<Department> list=new ArrayList<Department>();\r\n\t\tString HQL=\"from Department dep where dep.college.CollegeID=?\";\r\n\t\tObject [] parmas={CollegeID};\r\n\t\tlist=hb.select(HQL,parmas);\r\n\t\treturn list;\r\n\t}","title":""},{"docid":"ef71c00679d957ed3d025fa446a85a86","score":"0.54355747","text":"public List<GradedStudent> getGradedStudents(String courseId) {\n List<GradedStudent> gradedStudents = new ArrayList<>();\n\n String query =\n \"select username, first_name, last_name, phone_number, email, role_id, users.department_id, grade \"\n + \"from users \"\n + \"inner join grades \"\n + \"on users.username = grades.student_id \"\n + \"inner join courses \"\n + \"on grades.course_id = courses.id \"\n + \"where grades.course_id = ?\";\n\n try ( Connection con = ds.getConnection();\n PreparedStatement stmt = con.prepareStatement(query)) {\n\n stmt.setString(1, courseId);\n\n try (ResultSet rs = stmt.executeQuery()) {\n while (rs.next()) {\n gradedStudents.add(new GradedStudent(\n rs.getString(\"username\"),\n null,\n rs.getString(\"first_name\"),\n rs.getString(\"last_name\"),\n rs.getLong(\"phone_number\"),\n rs.getString(\"email\"),\n rs.getString(\"role_id\"),\n rs.getString(\"department_id\"),\n rs.getInt(\"grade\")));\n }\n }\n\n } catch (SQLException e) {\n e.printStackTrace();\n }\n\n return gradedStudents;\n }","title":""},{"docid":"7d5d4bac2ff2c5b05470af31cea82fb8","score":"0.54291624","text":"@Override\n\tpublic String getStudentByNo(String no) {\n\t\treturn myDao.getStudentByNo(no);\n\t}","title":""},{"docid":"f46210f4d3b1cc400d318676fd419e98","score":"0.5421967","text":"@Query(\"SELECT sc FROM StudentCourse as sc WHERE sc.enrollmentID = :eid\")\r\n\tStudentCourse findEnrollmentByID(@Param(\"eid\") int eid);","title":""},{"docid":"9b6a164127ec13b9fd623da73c8d1d58","score":"0.541961","text":"public List<MemberDTO> getStudentId(String studentId) {\n EntityManager em = emf.createEntityManager();\n TypedQuery<Member> query = em.createQuery(\"SELECT m FROM Member m WHERE m.studentId LIKE :studentId\", Member.class);\n query.setParameter(\"studentId\", \"%\" + studentId + \"%\");\n List<Member> members = query.getResultList();\n List<MemberDTO> memberDTOs = new ArrayList();\n members.forEach((Member member) -> {\n memberDTOs.add(new MemberDTO(member));\n });\n return memberDTOs;\n }","title":""},{"docid":"cd1dcd47b51c5652b41e4e78314a8ef7","score":"0.5409898","text":"public static List<SchoolClass> createSchoolClassesList(Student student) {\n\t\tList<SchoolClass> returnSchoolClasses = new ArrayList<SchoolClass>();\n\n\t\tString sql = \"SELECT * FROM school_class_student WHERE student_id=\\'\" + student.id + \"\\'\";\n\n\t\tConnection connection = DB.getConnection();\n\t\tStatement statement = null;\n\t\ttry {\n\t\t\tstatement = connection.createStatement();\n\t\t\tstatement.execute(sql);\n\t\t\tResultSet rs = statement.getResultSet();\n\t\t\twhile (rs.next()) {\n\t\t\t\treturnSchoolClasses.add(SchoolClass.find.where().eq(\"ID\", rs.getLong(\"school_class_id\")).findUnique());\n\t\t\t}\n\t\t} catch (SQLException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\n\t\ttry {\n\t\t\tstatement.close();\n\t\t\tconnection.close();\n\t\t} catch (SQLException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\n\t\treturn returnSchoolClasses;\n\t}","title":""},{"docid":"e8ef9c7b519489847ba2eb7b4433110b","score":"0.54076684","text":"List<ClassInfo> selectByExample(ClassInfoExample example);","title":""},{"docid":"e8ef9c7b519489847ba2eb7b4433110b","score":"0.54076684","text":"List<ClassInfo> selectByExample(ClassInfoExample example);","title":""},{"docid":"0b3dcf44c0a538c43126c18c8d1943d5","score":"0.540314","text":"private ArrayList<Student> findStudent(String searchTerm, String searchOn) { \r\n \r\n\t//list of search results\r\n ArrayList<Student> studentsFound = new ArrayList<>(); \r\n \r\n switch (searchOn) {\r\n //search by student ID\r\n case \"ID\":\r\n for (Student student: students) {\r\n\t\t //add the student if a match found\r\n if (student.getStudentID().equalsIgnoreCase(searchTerm)) { \r\n studentsFound.add(student);\r\n }\r\n } \r\n break;\r\n\t //search by student surname\r\n case \"surname\":\r\n for (Student student: students) {\r\n\t\t //add the student if a match found\r\n if (student.getSurname().equalsIgnoreCase(searchTerm)) {\r\n studentsFound.add(student);\r\n \r\n }\r\n } \r\n break;\r\n\t //search by student first name\r\n case \"first\":\r\n for (Student student: students) {\r\n\t\t //add the student if a match found\r\n if (student.getGivenName().equalsIgnoreCase(searchTerm)) {\r\n studentsFound.add(student); \r\n }\r\n } \r\n break; \r\n }\r\n\t//return the search results\r\n return studentsFound; \r\n }","title":""},{"docid":"69b0a3c5ccaadad17fc05b7a551b350e","score":"0.54025364","text":"public Student getStudentById(int stdId) {\n SQLiteDatabase db = this.getWritableDatabase();\n String query = \"SELECT id, name, age, class_name, city FROM student_info WHERE id = ?\";\n Cursor cursor = db.rawQuery(query, new String[] {String.valueOf(stdId)});\n cursor.moveToFirst();\n Student std = new Student();\n std.setId(cursor.getInt(0));\n std.setName(cursor.getString(1));\n std.setAge(cursor.getInt(2));\n std.setClassName(cursor.getString(3));\n std.setCity(cursor.getString(4));\n db.close();\n return std;\n }","title":""}],"string":"[\n {\n \"docid\": \"5a8fa7eb508b0e284e8aa4513f0050e2\",\n \"score\": \"0.69700116\",\n \"text\": \"public List<Student> getStudentsInClass(Classroom classroom);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"83f97302062d43073d7990e380fbf03a\",\n \"score\": \"0.67889833\",\n \"text\": \"Student getStudents();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"71af0b651e9b3d8e9a476933c7cb8459\",\n \"score\": \"0.67640746\",\n \"text\": \"private static void studentBasedOnDepartment() {\\r\\n System.out.println(\\\"Enter the Department of the student cse/ece/eee/mech/it\\\");\\r\\n String departmentOfStudent = scan.next();\\r\\n for (Student s:studentdata) {\\r\\n if (departmentOfStudent.equalsIgnoreCase(s.getDepartmentOfStudent())) {\\r\\n System.out.println(\\\"The details of the student are\\\");\\r\\n System.out.println(\\\"FirstName :\\\" + s.getFirstNameOfStudent());\\r\\n System.out.println(\\\"LastName :\\\" + s.getLastNameOfStudent());\\r\\n System.out.println(\\\"Age :\\\" + s.getAgeOfStudent());\\r\\n System.out.println(\\\"Department :\\\" + s.getDepartmentOfStudent());\\r\\n System.out.println(\\\"Year :\\\" + s.getYearOfStudent());\\r\\n }\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2526c80e7ee3ca3b607973c2e62e1e45\",\n \"score\": \"0.6487636\",\n \"text\": \"public static List<Student> getStudentList(String className) {\\n List<Student> studentList = new ArrayList<>();\\n for (Clase clase : management.getClase()) {\\n if (clase.getName() == className) {\\n for (Student student : management.getStudents()) {\\n boolean validate = idStudentExistInClass(clase, student.getId());\\n if (!validate) {\\n studentList.add(student);\\n }\\n\\n }\\n }\\n }\\n return studentList;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"16349a0a9f97f28096a14d92e153abc3\",\n \"score\": \"0.6473333\",\n \"text\": \"public studentImpl getCollegeStudent(String id) ;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4c3d82c245b6c6e07c436a0a72df57ee\",\n \"score\": \"0.6345581\",\n \"text\": \"@RequestMapping(value = \\\"/class/{className}\\\", method = RequestMethod.GET)\\n\\tpublic List<Student> findStudentsWithClass(@PathVariable(value = \\\"className\\\") String className){\\n\\t\\tpopulateSchoolAndStudents();\\n\\t\\treturn studentList.stream().filter(s -> s.getClassName().equalsIgnoreCase(className)).collect(Collectors.toList());\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"59d96b8dcdc3ca7a590a03c65ba98d5c\",\n \"score\": \"0.6229872\",\n \"text\": \"Set<ClassroomStudent> getClassroomStudents();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6c2054d0232fad3153bf51183ce7ad45\",\n \"score\": \"0.62190694\",\n \"text\": \"@Query(\\\"SELECT sc FROM StudentCourse as sc WHERE sc.user.userID = :esid\\\")\\r\\n\\tList<StudentCourse> findEnrollmentByStuID(@Param(\\\"esid\\\") int esid);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"df45f0db3a01ba6a3a603f6b6fb8e953\",\n \"score\": \"0.61715585\",\n \"text\": \"public List<Skills>getSkillsByDepartment(int departmentId)throws DAOException;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"864f0a26f50fe7816bc8f89ab8399b2a\",\n \"score\": \"0.6131614\",\n \"text\": \"public Student getStudentById(int id);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"82fc4525d7d3bf910e66aa57ed09caa9\",\n \"score\": \"0.6125358\",\n \"text\": \"public Department getStudentSchool() {\\n return studentSchool;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3327597306642a75f43bfa882fb3889d\",\n \"score\": \"0.6124187\",\n \"text\": \"List<User> selectByDepartmentSn(Params params);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"92305d827ef914ad9196094fd0f26e2a\",\n \"score\": \"0.6119559\",\n \"text\": \"public List<Course> getCoursesByDepartment(String department){\\n\\t\\tscanResult = client.scan(scanRequest);\\n\\t\\tArrayList<Course> list = new ArrayList<>();\\n\\t\\tfor (Map<String, AttributeValue> courseItem : scanResult.getItems()){\\n\\t\\t\\ttry{\\n\\t\\t\\t\\tAttributeValue v = courseItem.get(\\\"department\\\");\\n\\t\\t\\t\\tString dept = v.getS();\\n\\t\\t\\t\\tif(dept.equalsIgnoreCase(department)) {\\n\\t\\t\\t\\t\\tv = courseItem.get(\\\"id\\\");\\n\\t\\t\\t\\t\\tString id = v.getS();\\n\\t\\t\\t\\t\\tCourse course = mapper.load(Course.class, id);\\n\\t\\t\\t\\t\\tlist.add(course);\\n\\t\\t\\t\\t}\\t\\t\\t\\t\\n\\t\\t\\t} catch (Exception e){\\n\\t\\t\\t\\tSystem.out.println(e.getMessage());\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(list.isEmpty()) {\\n\\t\\t\\tthrow new DataNotFoundException(\\\"Didn't find courses for the department \\\" + department);\\n\\t\\t}\\n\\t\\treturn list;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fb6570470f7471c866519f025df32bfa\",\n \"score\": \"0.6109912\",\n \"text\": \"public student findStudentByName(String name) throws Exception;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2cd7730eb8239e9a73e654e495b91b52\",\n \"score\": \"0.6045256\",\n \"text\": \"List<Department> getDepartmentList();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bec21d125cd3dfe759132072fdae5656\",\n \"score\": \"0.60427934\",\n \"text\": \"public List<Student> findStudentByLastname(String lastname);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d8307034557909a7866171c176aef7f8\",\n \"score\": \"0.5987044\",\n \"text\": \"public List<Student> getEnrolledStudentsDB(int courseId);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a9ce5718665a0b0ea3ba84be120a71d0\",\n \"score\": \"0.59294754\",\n \"text\": \"public CourseSet asStudentGetCourseSet();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"16cde55502eb758e02d5fa3344c2cd8d\",\n \"score\": \"0.5917876\",\n \"text\": \"List<Student> get();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ccb53a0b103e10a4840cc09eaca682fc\",\n \"score\": \"0.5910914\",\n \"text\": \"@Override\\n\\tpublic List<CourseInfo> find(String cname, String semester, Integer status) {\\n\\t\\tDBHelper db = new DBHelper();\\n\\t\\tString sql = \\\"select * from CourseInfo where 1=1\\\";\\n\\t\\tList<Object> params = new ArrayList<Object>();\\n\\t\\tif (!StringUtil.isNull(cname)) {\\n\\t\\t\\tsql += \\\" and cname like ?\\\";\\n\\t\\t\\tparams.add(\\\"%\\\" + cname + \\\"%\\\");\\n\\n\\t\\t}\\n\\t\\tif (!StringUtil.isNull(semester)) {\\n\\t\\t\\tsql += \\\" and semester = ?\\\";\\n\\t\\t\\tparams.add(semester);\\n\\n\\t\\t}\\n\\t\\tif (status != null) {\\n\\t\\t\\tsql += \\\" and status = ?\\\";\\n\\t\\t\\tparams.add(status);\\n\\n\\t\\t}\\n\\n\\t\\treturn db.finds(sql, CourseInfo.class, params);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f9e8e1b0a862d346f1f4d86d8d2b2f84\",\n \"score\": \"0.59061074\",\n \"text\": \"private void searchStaffByDepartmentName(String departmentName){\\n ArrayList<Staff> staffFound = new ArrayList<>();\\n for(Staff aStaff : staffList.getStaffList()) {\\n if(aStaff.getDepartment().toLowerCase().equals(departmentName.toLowerCase())){\\n staffFound.add(aStaff);\\n }\\n }\\n // If there is no staff in the department\\n // Then inform to the user\\n if(staffFound.isEmpty()){\\n System.out.println(\\\"-> No staff is found\\\");\\n }\\n // otherwise, print out staff's information\\n else{\\n System.out.println(String.format(Constants.SFSTAFFHEADER, \\\"ID\\\", \\\"Name\\\", \\\"Title\\\", \\\"Age\\\", \\\"Salary Grade\\\", \\\"Joining date\\\", \\\"Department\\\", \\\"Annual leave\\\", \\\"OT hours\\\"));\\n for(Staff aStaff : staffFound){\\n System.out.println(aStaff.toString());\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1fc0f942812ad5d6919248a78e3cbca2\",\n \"score\": \"0.5885367\",\n \"text\": \"List<Students> findFirstByFirstName(String firstName);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d22c47d7619fa47242e80177f754972\",\n \"score\": \"0.58795214\",\n \"text\": \"@GET\\n\\tpublic List<Student> getStudents(@Context ContainerRequestContext requestContext,\\n\\t\\t\\t@QueryParam(\\\"classroomId\\\") String classId) {\\n\\t\\tString userId = getUserId(requestContext);\\n\\t\\tif (classId != null)\\n\\t\\t\\treturn studentService.getStudentsInClassroom(userId, classId);\\n\\t\\treturn studentService.getStudents(userId);\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"483ee2c48a80106ef67fb1260d590b8b\",\n \"score\": \"0.5846973\",\n \"text\": \"public static void getClassListWhereAStudentBelong(int idStudent) {\\n for (Clase clase : management.getClase()) {\\n for (Student student : clase.getStudents()) {\\n if (student.getId() == idStudent) {\\n System.out.println(\\\"Class Name: \\\" + clase.getName() + \\\" ||Class ID:\\\" + clase.getClassId() + \\\" ||Assigned ClassRoom: \\\" + clase.getAssignedClassRoom());\\n }\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7056bde5b80d750b367714f53d20e027\",\n \"score\": \"0.5845396\",\n \"text\": \"public List<student> getAllStudents (){\\n\\t\\treturn repos.findAll();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"734f9ee35c4fa67ed4a66ce3462bf7c9\",\n \"score\": \"0.5835207\",\n \"text\": \"List<Course> selectByExample(CourseExample example);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0aeeeceff97e15ca405546e0842ffbe3\",\n \"score\": \"0.58236283\",\n \"text\": \"@Override\\n\\tpublic Student selectStudent(String npm) {\\n\\t\\tfor(Student s : studentList){\\n\\t\\t\\tif(s.getNpm().equals(npm)){\\n\\t\\t\\t\\treturn s;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"34fdb235a487ac6a2b33461ae09ba628\",\n \"score\": \"0.58030474\",\n \"text\": \"@Override\\n\\t\\n\\tpublic List<Student> getStudents() {\\n\\t\\tSession currentSession=sessionFactory.getCurrentSession();\\n\\t\\t\\n\\t\\t\\n\\t\\t//create a query\\n\\t\\tQuery<Student> query= currentSession.createQuery(\\\"from Student order by firstName\\\",Student.class);\\n\\t\\t\\n\\t\\t\\n\\t\\t//execute query and get list\\n\\t\\tList<Student> students=query.getResultList();\\n\\t\\t\\n\\t\\t\\n\\t\\t//return list\\n\\treturn students;\\n\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"332ee76f1509c29545cb80d1488d9b66\",\n \"score\": \"0.5777745\",\n \"text\": \"List<Staff> findByDepartment(Department department);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5e9798fc85cdefdd726b10736c6c30c5\",\n \"score\": \"0.5768813\",\n \"text\": \"@Query(\\\"SELECT sc FROM StudentCourse as sc WHERE sc.status = 'Active'\\\")\\r\\n\\tList<StudentCourse> findActiveEnrollment();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e8e13f24fe446edadae6d2b221107d5e\",\n \"score\": \"0.5762197\",\n \"text\": \"List<TSysDepartment> selectAll();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"293658c35092e00e43ddde34614dd7d6\",\n \"score\": \"0.5755723\",\n \"text\": \"public List<Role> getRolesByDepartment(Department department);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f1e7a0714206ba072ef9e45911230e43\",\n \"score\": \"0.57360315\",\n \"text\": \"Student get(int id);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"01f9e453d9d0393f0030565eb284e787\",\n \"score\": \"0.57263094\",\n \"text\": \"public static Student findMajor(ArrayList<Student> students, String major){\\n for (int i = 0; i < students.size(); i++){\\n if (major.equals(students.get(i).getMajor())){\\n return students.get(i);\\n }\\n \\n }\\n Student noresult = new Student();//create an empty instance of student if the search failed\\n noresult.setMajor(\\\"No result\\\");//return zero GPA and no result\\n return noresult;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1e6754e8e891a13fc9a3e091ffcfbd69\",\n \"score\": \"0.5714129\",\n \"text\": \"List<Student> getStudentList(int firstResult, int maxResults);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d3c0ea698087285596a8baa0245a8746\",\n \"score\": \"0.57065237\",\n \"text\": \"List<TCourse> selectByExample(TCourseExample example);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9ad570ef2c232db37be91194d76d5e44\",\n \"score\": \"0.57042295\",\n \"text\": \"java.lang.String getStudentName();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3b76dad9775e67f61878edc38fba859e\",\n \"score\": \"0.5699748\",\n \"text\": \"List<Department> getDepartments();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bbd81b3c30b1b470d937c6b8bfdc27a2\",\n \"score\": \"0.56955135\",\n \"text\": \"List<Department> getAllDepartment();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"781c4e8fa184d930e523df8d1910fdd2\",\n \"score\": \"0.56881934\",\n \"text\": \"@Select(\\\"select name, npm, gpa from student\\\")\\n @Results (value = {\\n \\t\\t@Result (property=\\\"name\\\", column=\\\"name\\\"),\\n \\t\\t@Result (property=\\\"npm\\\", column=\\\"npm\\\"),\\n \\t\\t@Result (property=\\\"gpa\\\", column=\\\"gpa\\\"),\\n \\t\\t@Result (property=\\\"course\\\", column=\\\"id_course\\\", \\n \\t\\tjavaType = List.class, many= @Many(select= \\\"selectCourse\\\"))\\n })\\n List<CourseModel> selectStudent();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80f7d8d88e711de83f06dda9249e1e03\",\n \"score\": \"0.5686172\",\n \"text\": \"List<Students> findByFirstName(String firstName);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"66504e8fa10e2911adcee1ef249cf47a\",\n \"score\": \"0.56825155\",\n \"text\": \"public ArrayList<Student> getStudents(Integer taeId, String course) {\\n\\t\\tString hql = \\\"from Student where studentId in (select studentId from StudentCourse where courseId in (select courseId from Course where teacherId=? and courseName=?))\\\";\\n\\t\\tQuery q = getSession().createQuery(hql);\\n\\t\\tq.setParameter(0, taeId);\\n\\t\\tq.setParameter(1, course);\\n\\t\\tArrayList<Student> students =(ArrayList<Student>)q.list();\\t\\t\\t\\n\\t\\treturn students;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"12f196d626a6b2331de73ae6b1ea10da\",\n \"score\": \"0.56756204\",\n \"text\": \"public void setStudentSchool(Department studentSchool) {\\n this.studentSchool = studentSchool;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2fdb7c29dd58084258860f580540c3f5\",\n \"score\": \"0.5659142\",\n \"text\": \"public List<ProfessionalCourseClass> findByCourseId(int courseId);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ceb347191d65399b04df9a599764a490\",\n \"score\": \"0.5658818\",\n \"text\": \"ArrayList<Course> searchAllCourses(int profID) {\\n try {\\n String sql = \\\"SELECT * FROM \\\" + courseTableName;\\n statement = jdbc_connection.prepareStatement(sql);\\n ResultSet courses = statement.executeQuery();\\n Course temp;\\n ArrayList<Course> courseList = new ArrayList<>();\\n while(courses.next())\\n {\\n boolean activeBoolean = false;\\n if(courses.getString(\\\"ACTIVE\\\").charAt(0)=='0') {\\n activeBoolean = false;\\n }\\n else if(courses.getString(\\\"ACTIVE\\\").charAt(0)=='1') {\\n activeBoolean = true;\\n }\\n temp = new Course (courses.getInt(\\\"PROFESSORID\\\"),\\n courses.getString(\\\"COURSENAME\\\"),\\n activeBoolean);\\n temp.setCourseID(courses.getInt(\\\"ID\\\"));\\n if(profID == temp.getProfessorID()){\\n courseList.add(temp);\\n }\\n }\\n courses.close();\\n return courseList;\\n } catch (SQLException e) {\\n e.printStackTrace();\\n }\\n return null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2e84321f0fc9e4eedbc14f5ec630a9d5\",\n \"score\": \"0.5642834\",\n \"text\": \"@Override\\r\\n public List<GradeClass> findClassList( String schoolId) {\\n\\r\\n GradeClassExample example = new GradeClassExample();\\r\\n example.createCriteria().andDelFlagEqualTo( 0).andSchoolIdEqualTo( schoolId);\\r\\n List<GradeClass> gradeClassList = gradeClassMapper.selectByExample( example);\\r\\n List<String> xd = new ArrayList<String>();\\r\\n for (GradeClass gradeClass:gradeClassList) {\\r\\n if ( !xd.contains( gradeClass.getXd())) {\\r\\n xd.add(gradeClass.getXd());\\r\\n }\\r\\n }\\r\\n Collections.sort(xd);\\r\\n for ( GradeClass gradeClass:gradeClassList){\\r\\n gradeClass.setRemarks(ConstantUtil.getValueByKeyAndFlag(Integer.valueOf(gradeClass.getXd()),\\\"xd\\\")+\\r\\n ConstantUtil.getValueByKeyAndFlag(gradeClass.getNj(),\\\"nj\\\")+\\r\\n gradeClass.getName());\\r\\n gradeClass.setName(gradeClass.getXd()+\\\",\\\"+gradeClass.getNj()+\\\",\\\"+gradeClass.getName());\\r\\n\\r\\n }\\r\\n return gradeClassList;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ad85f55ca0a87fdc5c64992e9ddbad3f\",\n \"score\": \"0.564147\",\n \"text\": \"public List<Department>getDepartmentByCompanyCode(int companyCode)throws DAOException;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0c0feb4d35ae5b57c0e8c2b06a897b0c\",\n \"score\": \"0.56379646\",\n \"text\": \"public Student search(String pLastName){\\n return getRoster().getStudent(pLastName);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2bb279472a1a5d1b8278d2b8c44142e6\",\n \"score\": \"0.56299025\",\n \"text\": \"List<SubjectDTO> getSubjectsByInstructorId(Long instructorId);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a5822386d2372ac9bb2738030c935714\",\n \"score\": \"0.5626787\",\n \"text\": \"public List<Course> findByName(String courseName);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"419aa1e02b584b41b5b75dc18e776f80\",\n \"score\": \"0.5609511\",\n \"text\": \"public void showStaffByDepartment(){\\n if(!departmentList.getDepartmentList().isEmpty()){\\n System.out.println(\\\"\\\\n* Staff by Department\\\");\\n for(Department aDepartment : departmentList.getDepartmentList()){\\n System.out.println(\\\"** Department: \\\" + aDepartment.getDepartmentName());\\n searchStaffByDepartmentName(aDepartment.getDepartmentName());\\n }\\n System.out.println();\\n }\\n else{\\n System.out.println(\\\"-> Sorry, there is no department created yet\\\");\\n }\\n promptEnter();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aaed5b0ec0d1b4389e1f58692c829e4b\",\n \"score\": \"0.5602381\",\n \"text\": \"public static Student findStudent()\\n { \\n Student foundStudent = null;\\n boolean firstLoop = true;\\n \\n System.out.println(\\\"\\\");\\n System.out.println(\\\"All Student Name's Below:\\\");\\n for (Student s:Classroom.studentList)\\n {\\n System.out.println(s.getFirstName() + \\\" \\\" + s.getLastName());\\n }\\n \\n while (foundStudent == null)\\n {\\n if (!firstLoop)\\n {\\n System.out.println(\\\"Re-Enter a name please. The name you inputted was inccorect: \\\");\\n }\\n String findingStudent = Greenfoot.ask(\\\"Please enter the name of the student you want to find (Enter First and Last Name!): \\\");\\n for (Student s:Classroom.studentList)\\n {\\n if (findingStudent.toLowerCase().equals(s.getFirstName().toLowerCase() + \\\" \\\" + s.getLastName().toLowerCase()))\\n {\\n foundStudent = s;\\n }\\n }\\n firstLoop = false;\\n }\\n \\n return foundStudent;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f5f5253f652b0442d98edeaed4bf2c55\",\n \"score\": \"0.56019545\",\n \"text\": \"public List<Student> getSearchStudent() {\\n\\t\\treturn searchedStudentList;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f2e8e10fcbb89bd897ac085f5385c768\",\n \"score\": \"0.5596281\",\n \"text\": \"List<Student> selectAll();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8fd6ad68a49a575e82d4e3b116217a44\",\n \"score\": \"0.5589517\",\n \"text\": \"public List<Course> getCourses(String professorUsername) {\\n\\n List<Course> courses = new ArrayList<>();\\n String query = \\\"select * from courses where instructor_username = ?\\\";\\n\\n try ( Connection con = ds.getConnection();\\n PreparedStatement stmt = con.prepareStatement(query)) {\\n\\n stmt.setString(1, professorUsername);\\n\\n try (ResultSet rs = stmt.executeQuery()) {\\n while (rs.next()) {\\n courses.add(new Course(\\n rs.getString(\\\"id\\\"),\\n rs.getString(\\\"title\\\"),\\n rs.getInt(\\\"ects\\\"),\\n rs.getInt(\\\"teaching_hours\\\"),\\n rs.getString(\\\"instructor_username\\\"),\\n rs.getInt(\\\"semester\\\"),\\n rs.getString(\\\"department_id\\\")));\\n }\\n }\\n\\n } catch (SQLException e) {\\n e.printStackTrace();\\n }\\n\\n return courses;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"594c54cd5c1708a24e5f5e158a2d9ab3\",\n \"score\": \"0.5582761\",\n \"text\": \"@Override\\r\\n\\tpublic List<Customer> getCustListByDept(String department,Page<Customer> page) {\\n\\t\\tList<Customer> custList = custMapper.getCustListByDept(department, page);\\r\\n\\t\\treturn custList;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aff39794bd381b39229290a47221ae10\",\n \"score\": \"0.5580509\",\n \"text\": \"public List<User> getProfessorsByDept(String departmentId) {\\n List<User> professors = new ArrayList<>();\\n\\n Connection con = null;\\n ResultSet rs = null;\\n PreparedStatement stmt = null;\\n\\n String query =\\n \\\"SELECT * FROM javapart3.users WHERE role_id='instructor' AND department_id=?\\\";\\n\\n try {\\n con = ds.getConnection();\\n\\n stmt = con.prepareStatement(query);\\n stmt.setString(1, departmentId);\\n\\n rs = stmt.executeQuery();\\n\\n while (rs.next()) {\\n professors.add(new User(\\n rs.getString(\\\"username\\\"),\\n null, rs.getString(\\\"first_name\\\"),\\n rs.getString(\\\"last_name\\\"),\\n rs.getLong(\\\"phone_number\\\"),\\n rs.getString(\\\"email\\\"),\\n rs.getString(\\\"role_id\\\"),\\n rs.getString(\\\"department_id\\\")));\\n }\\n\\n } catch (SQLException e) {\\n e.printStackTrace();\\n } finally {\\n try {\\n rs.close();\\n stmt.close();\\n con.close();\\n } catch (SQLException e) {\\n e.printStackTrace();\\n }\\n }\\n\\n return professors;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bcb9595354fa2e130b440255da9d514f\",\n \"score\": \"0.5575121\",\n \"text\": \"cn.edu.jxau.netty.protobuf.multi.DataInfo.Student getStudent();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"349c459b3c930c4038eb55245bbb80c4\",\n \"score\": \"0.55692303\",\n \"text\": \"public String identifyDepartment(int empId);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"89c085373dc6ac9524dca65ed6931ed4\",\n \"score\": \"0.5563901\",\n \"text\": \"public List<MarksBean> getStudentList(String lec_id) {\\n List<MarksBean> result = null;\\n try {\\n String sql = \\\"SELECT user.user_id, subject.sub_code FROM user INNER JOIN subject ON user.reg_year = subject.year WHERE subject.lecturer_id = '\\\"+lec_id+\\\"'\\\";\\n result = template.query(sql, new RowMapper<MarksBean>() {\\n @Override\\n public MarksBean mapRow(ResultSet rs, int rowNum) throws SQLException {\\n MarksBean res = new MarksBean();\\n res.setUser_id(rs.getString(\\\"user_id\\\"));\\n res.setSub_code(rs.getString(\\\"sub_code\\\"));\\n return res;\\n }\\n });\\n }catch (Exception e){\\n System.out.println(e);\\n }\\n return result;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a9df1dcd10ee8425c55d7b2527f7c057\",\n \"score\": \"0.55612403\",\n \"text\": \"public Student getStudent(int stud) {\\n\\t\\tif (stud > studentList.size() - 1 || stud < 0)\\n\\t\\t\\treturn null;\\n\\t\\treturn studentList.get(stud);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"10d1b85eab6c1c0a599246c41a7fb587\",\n \"score\": \"0.5550469\",\n \"text\": \"public Vector <Teacher> searchByCpf (String cpf) throws SQLException,\\n\\t\\t\\tClienteException {\\n\\n\\t\\tString selectQuery = \\\"SELECT * FROM professor WHERE cpf = \\\" + \\\"\\\\\\\"\\\"\\n\\t\\t\\t\\t+ cpf + \\\"\\\\\\\";\\\";\\n\\t\\tVector<Teacher> selectedTeachers = this.search(selectQuery); \\n\\t\\treturn selectedTeachers;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e3178d75cae1b5f5136c8891ba3d3097\",\n \"score\": \"0.5549313\",\n \"text\": \"ArrayList<StudentEnrollment> searchAllStudentEnrollments(int courseID) {\\n try {\\n String sql = \\\"SELECT * FROM \\\" + studentEnrollmentTableName;\\n statement = jdbc_connection.prepareStatement(sql);\\n ResultSet enrollments = statement.executeQuery();\\n StudentEnrollment temp;\\n ArrayList<StudentEnrollment> enrollmentList = new ArrayList<>();\\n while(enrollments.next())\\n {\\n boolean activeBoolean = false;\\n if(enrollments.getString(\\\"ACTIVE\\\").charAt(0)=='0') {\\n activeBoolean = false;\\n }\\n else if(enrollments.getString(\\\"ACTIVE\\\").charAt(0)=='1') {\\n activeBoolean = true;\\n }\\n temp = new StudentEnrollment (enrollments.getInt(\\\"STUDENTID\\\"),\\n enrollments.getInt(\\\"COURSEID\\\"), activeBoolean);\\n temp.setEnrollmentID(enrollments.getInt(\\\"ID\\\"));\\n\\n if(courseID == temp.getCourseID()){\\n enrollmentList.add(temp);\\n }\\n }\\n enrollments.close();\\n return enrollmentList;\\n } catch (SQLException e) {\\n e.printStackTrace();\\n }\\n return null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a61df993937084b957b9ff5f25f80db2\",\n \"score\": \"0.5538876\",\n \"text\": \"List<Students> findByLastName(String lastName);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a1993be0a09efc9f6bc843dcfe801952\",\n \"score\": \"0.5538118\",\n \"text\": \"public List<Course> findByName(String name);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"687accf5d09a8c08260379b048105eb9\",\n \"score\": \"0.5537797\",\n \"text\": \"String nameOfDepartment();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f5553da0dc122f0b1d76ece6892b8df8\",\n \"score\": \"0.55374825\",\n \"text\": \"@Select(\\\"select student.npm, name, gpa \\\" + \\n \\\"from student join studentcourse \\\" + \\n \\\"on student.npm = studentcourse.npm \\\" + \\n \\\"where studentcourse.id_course = #{id_course}\\\")\\n List<StudentModel> selectStudents (@Param(\\\"id_course\\\") String id_course);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"642f51f5338ba2dbe0a5021e27ccbd8e\",\n \"score\": \"0.55374676\",\n \"text\": \"@Override\\r\\n\\tpublic List<Enrolment> findstudentbylecturerid(String s) {\\n\\t\\treturn scRepository.findstudentbylecturerid(s);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"22e6d8276979ffb662694385a9d0c415\",\n \"score\": \"0.55347943\",\n \"text\": \"List<BaseUniversity> selectByExample(BaseUniversityExample example);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e84bf9cac97f902d8c6096303dd0f01e\",\n \"score\": \"0.55320144\",\n \"text\": \"@Override\\n public Student queryBySno(String sno) {\\n return studentMapper.queryById(sno);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ad7ab040df46cb5c3a04b6ad423a7c2e\",\n \"score\": \"0.5529405\",\n \"text\": \"public static List<Student> getStudentList() {\\n stuList = new ArrayList<Student>();\\n Student s1 = new Student();\\n s1.setName(\\\"abc\\\");\\n s1.setRollno(1);\\n s1.setTotalMarks(200);\\n stuList.add(s1);\\n s1 = new Student();\\n s1.setName(\\\"def\\\");\\n s1.setRollno(2);\\n s1.setTotalMarks(400);\\n stuList.add(s1);\\n s1 = new Student();\\n s1.setName(\\\"xyz\\\");\\n s1.setRollno(3);\\n s1.setTotalMarks(260);\\n stuList.add(s1);\\n return stuList;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd097b67b53d190d74992f0a3adfa433\",\n \"score\": \"0.5524551\",\n \"text\": \"public List<Course> getAllTeacherStudentCourses() {\\n User user = getCurrentUser();\\n List<Course> listCourses = courseRepo.findAll();\\n return listCourses.stream().filter(c -> c.getUsers().contains(user)).collect(Collectors.toList());\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"26e4fe56af7877d8ebfa29e94a0cab82\",\n \"score\": \"0.55033916\",\n \"text\": \"public ArrayList<String> byDepartment(String department){\\n\\t\\t//American ArrayLists\\n\\t\\tArrayList<String> AmericanURL = new ArrayList<String>();\\n\\t\\tArrayList<String> Across110thStreet = new ArrayList<String>();\\n\\t\\tArrayList<String> AmazingGrace = new ArrayList<String>();\\n\\t\\tArrayList<String> HobosLullaby = new ArrayList<String>();\\n\\t\\tArrayList<String> HonkyTonkin = new ArrayList<String>();\\n\\t\\tArrayList<String> NightTrain = new ArrayList<String>();\\n\\t\\tArrayList<String> Offbeat = new ArrayList<String>();\\n\\t\\tArrayList<String> SomethingInsideOfMe = new ArrayList<String>();\\n\\t\\tArrayList<String> TheMoonshineShow = new ArrayList<String>();\\n\\t\\tArrayList<String> TuesdaysJustAsBad = new ArrayList<String>();\\t\\t\\n\\t\\t\\n\\t\\t\\n\\t\\t//American ALL [10 pages]\\n\\t\\tAmericanURL.add(\\\"https://www.cc-seas.columbia.edu/wkcr/playlist?field_department_nid=52\\\");\\n\\t\\tfor (int i = 1; i < 10; i++){\\n\\t\\t\\tAmericanURL.add(\\\"https://www.cc-seas.columbia.edu/wkcr/playlist?page=\\\" + i + \\\"&field_department_nid=52\\\");\\n\\t\\t}\\n\\t\\t//American ACROSS 110TH STREET [1 page]\\n\\t\\tAcross110thStreet.add(\\\"https://www.cc-seas.columbia.edu/wkcr/playlist?field_station_program_nid=70\\\");\\n\\t\\t//American AMAZING GRACE [1 page]\\n\\t\\tAmazingGrace.add(\\\"https://www.cc-seas.columbia.edu/wkcr/playlist?field_station_program_nid=5\\\");\\n\\t\\t//American HOBO'S LULLABY [1 page]\\n\\t\\tHobosLullaby.add(\\\"https://www.cc-seas.columbia.edu/wkcr/playlist?field_station_program_nid=2340\\\");\\n\\t\\t//American HONKY TONKIN [1 page]\\n\\t\\tHonkyTonkin.add(\\\"https://www.cc-seas.columbia.edu/wkcr/playlist?field_station_program_nid=28\\\");\\n\\t\\t//American NIGHT TRAIN [1 page]\\n\\t\\tNightTrain.add(\\\"https://www.cc-seas.columbia.edu/wkcr/playlist?field_station_program_nid=30\\\");\\n\\t\\t//American OFFBEAT [2 pages]\\n\\t\\tOffbeat.add(\\\"https://www.cc-seas.columbia.edu/wkcr/playlist?field_station_program_nid=31\\\");\\n\\t\\tOffbeat.add(\\\"https://www.cc-seas.columbia.edu/wkcr/playlist?page=1&field_station_program_nid=31\\\");\\n\\t\\t//American SOMETHING INSIDE OF ME [1 page]\\n\\t\\tSomethingInsideOfMe.add(\\\"https://www.cc-seas.columbia.edu/wkcr/playlist?field_station_program_nid=4899\\\");\\n\\t\\t//American THE MOONSHINE SHOW [2 pages]\\n\\t\\tTheMoonshineShow.add(\\\"https://www.cc-seas.columbia.edu/wkcr/playlist?field_station_program_nid=6\\\");\\n\\t\\tTheMoonshineShow.add(\\\"https://www.cc-seas.columbia.edu/wkcr/playlist?page=1&field_station_program_nid=6\\\");\\n\\t\\t//American TUESDAYS JUST AS BAD [2 pages]\\n\\t\\tTuesdaysJustAsBad.add(\\\"https://www.cc-seas.columbia.edu/wkcr/playlist?field_station_program_nid=29\\\");\\n\\t\\tTuesdaysJustAsBad.add(\\\"https://www.cc-seas.columbia.edu/wkcr/playlist?page=1&field_station_program_nid=29\\\");\\n\\t\\t\\n\\t\\tif (department == \\\"American\\\"){\\n\\t\\t\\tdepartmentURL = AmericanURL;\\n\\t\\t}\\n\\t\\tif (department == \\\"Across 110th Street\\\"){\\n\\t\\t\\tdepartmentURL = Across110thStreet;\\n\\t\\t}\\n\\t\\tif (department == \\\"Amazing Grace\\\"){\\n\\t\\t\\tdepartmentURL = AmazingGrace;\\n\\t\\t}\\n\\t\\tif (department == \\\"Hobo's Lullaby\\\"){\\n\\t\\t\\tdepartmentURL = HobosLullaby;\\n\\t\\t}\\n\\t\\tif (department == \\\"Honky Tonkin\\\"){\\n\\t\\t\\tdepartmentURL = HonkyTonkin;\\n\\t\\t}\\n\\t\\tif (department == \\\"Night Train\\\"){\\n\\t\\t\\tdepartmentURL = NightTrain;\\n\\t\\t}\\n\\t\\tif (department == \\\"Offbeat\\\"){\\n\\t\\t\\tdepartmentURL = Offbeat;\\n\\t\\t}\\n\\t\\tif (department == \\\"Something Inside of Me\\\"){\\n\\t\\t\\tdepartmentURL = SomethingInsideOfMe;\\n\\t\\t}\\n\\t\\tif (department == \\\"The Moonshine Show\\\"){\\n\\t\\t\\tdepartmentURL = TheMoonshineShow;\\n\\t\\t}\\n\\t\\tif (department == \\\"Tuesday's Just As Bad\\\"){\\n\\t\\t\\tdepartmentURL = TuesdaysJustAsBad;\\n\\t\\t}\\n\\t\\treturn departmentURL;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fc4a175c14bbfc07aefddbbb6d3a5ef0\",\n \"score\": \"0.54987746\",\n \"text\": \"ArrayList<StudentEnrollment> searchUsers(String lastName) {\\n try{\\n printUserTable();\\n String sql = \\\"SELECT * FROM \\\" + userTableName + \\\" WHERE LASTNAME = '\\\" + lastName + \\\"'\\\";\\n statement = jdbc_connection.prepareStatement(sql);\\n ResultSet users = statement.executeQuery();\\n ArrayList<StudentEnrollment> enrollmentList = new ArrayList<>();\\n\\n if(users == null) {\\n return null;\\n }\\n User temp = null;\\n while(users.next())\\n {\\n temp = new User (users.getString(\\\"EMAIL\\\"),\\n users.getString(\\\"LASTNAME\\\"),\\n users.getString(\\\"FIRSTNAME\\\"),\\n users.getString(\\\"TYPE\\\").charAt(0));\\n temp.setID( users.getInt(\\\"ID\\\"));\\n\\n ArrayList<StudentEnrollment> se = searchStudentEnrollment(temp.getID());\\n StudentEnrollment [] enrollments = se.toArray(new StudentEnrollment [se.size()]);\\n if(enrollments[0]!=null) {\\n enrollmentList.add(enrollments[0]);\\n }\\n }\\n users.close();\\n return enrollmentList;\\n }catch (SQLException e) { e.printStackTrace(); }\\n return null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e934d7499b0f67f66ea244ad2c9d642a\",\n \"score\": \"0.54946995\",\n \"text\": \"@Override\\r\\n\\tpublic List<Student> findAllStudents() {\\n\\r\\n\\t\\tList<Student> students = new ArrayList<Student>();\\r\\n\\r\\n\\t\\tString FIND_ALL_STUDENTS = \\\"select * from student\\\";\\r\\n\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tClass.forName(\\\"oracle.jdbc.driver.OracleDriver\\\");\\r\\n\\t\\t\\tSystem.out.println(\\\"Driver loaded successfully\\\");\\r\\n\\r\\n\\t\\t\\t// 2. get the connection\\r\\n\\t\\t\\tConnection con = DriverManager.getConnection(\\\"jdbc:oracle:thin:@localhost:1521:xe\\\", \\\"rupashi\\\", \\\"1234\\\");\\r\\n\\t\\t\\tSystem.out.println(\\\"Connection obtained.\\\");\\r\\n\\r\\n\\t\\t\\tStatement st = con.createStatement();\\r\\n\\t\\t\\tResultSet set = st.executeQuery(FIND_ALL_STUDENTS);\\r\\n\\t\\t\\twhile (set.next()) {\\r\\n\\r\\n\\t\\t\\t\\tint rollNo = set.getInt(\\\"rno\\\");\\r\\n\\t\\t\\t\\tString name = set.getString(\\\"name\\\");\\r\\n\\t\\t\\t\\tint total = set.getInt(\\\"total\\\");\\r\\n\\t\\t\\t\\tStudent student = new Student(rollNo, name, total);\\r\\n\\t\\t\\t\\tstudents.add(student);\\r\\n\\t\\t\\t}\\r\\n\\r\\n\\t\\t} catch (ClassNotFoundException e) {\\r\\n\\t\\t\\t// TODO Auto-generated catch block\\r\\n\\t\\t\\te.printStackTrace();\\r\\n\\t\\t} catch (SQLException e) {\\r\\n\\t\\t\\t// TODO Auto-generated catch block\\r\\n\\t\\t\\te.printStackTrace();\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\treturn students;\\r\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1c92f210dd1fce8893a47431e9f85b66\",\n \"score\": \"0.54928356\",\n \"text\": \"@Override\\n public List<Student> getStudentsFromClassroom(Long id) {\\n return studentRepository\\n .findAll()\\n .stream()\\n .filter(student -> student.getClassroom().getId().equals(id))\\n .collect(Collectors.toList());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6aa1b2612d097b48b97112df6a57c75f\",\n \"score\": \"0.54912084\",\n \"text\": \"List<Students> getAllRecordsByFirstName(@Param(\\\"firstName\\\")String firstName);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ef0e005189d687b3c5156c3253b044b9\",\n \"score\": \"0.54843396\",\n \"text\": \"@Override\\n\\tpublic List<Tblstudentgrades> getStudentList(int facultyId) {\\n\\t\\treturn enrollmentMapper.getStudentList(facultyId);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"648d1afc8cfec3f3b28da79f9ddc70c2\",\n \"score\": \"0.54689217\",\n \"text\": \"public List<Subject> getSubjectsOfAStudentUser() {\\n User user = getCurrentUser();\\n return user.getCourses().stream().filter(c -> Objects.nonNull(c.getSubject())).map(Course::getSubject)\\n .sorted((c1, c2) -> c1.getId().compareTo(c2.getId())).collect(Collectors.toList());\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b98d3a775409c1edd4628973b59f5e9d\",\n \"score\": \"0.5468857\",\n \"text\": \"public List<Student> listStudent() {\\n\\t\\ttry {\\n\\t\\t\\tSession s = HibernateUtil.currentSession();\\n\\t\\t\\tHibernateUtil.beginTransaction();\\n\\t\\t\\tList<Student> results = s.createQuery(\\\"from Student stu\\\").list();\\n\\t\\t\\tHibernateUtil.commitTransaction();\\n\\t\\t\\tHibernateUtil.closeSession();\\n\\t\\t\\tif (results != null && results.size() > 0) {\\n\\t\\t\\t\\treturn results;\\n\\t\\t\\t}\\n\\t\\t} catch (HibernateException e) {\\n\\t\\t\\tlog.fatal(e);\\n\\t\\t}\\n\\t\\treturn null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9415090a92fafa61ae1c9d4efa2827e2\",\n \"score\": \"0.5457662\",\n \"text\": \"public ArrayList<Degree> getDegreesByDepartment(String abbreviation) {\\n \\n Statement stmt = null;\\n ResultSet rs = null;\\n Connection connection = null;\\n \\n String esc = \\\"\\\\\\\"\\\";\\n ArrayList<Degree> toReturn = new ArrayList<Degree>();\\n try {\\n connection = DBConnection.getConnection();\\n stmt = connection.createStatement();\\n rs = stmt.executeQuery(\\\"SELECT * FROM \\\" + TABLE\\n + \\\" WHERE department_abbreviation=\\\"\\n + esc + abbreviation + esc\\n + \\\" order by title\\\");\\n while (rs.next()) {\\n Degree b = getDegreeFromResultSet(rs);\\n toReturn.add(b);\\n }\\n } catch (SQLException e) {\\n e.printStackTrace();\\n } finally {\\n DBConnection.releaseConnection(connection);\\n }\\n return toReturn;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"987982f906d5beb2f5226fbc94e02c29\",\n \"score\": \"0.5456879\",\n \"text\": \"@Override\\n\\tpublic Student findStudent(String examid) {\\n\\t\\treturn null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"da0029556c52508eb78276705bd70845\",\n \"score\": \"0.54565555\",\n \"text\": \"@Override\\n\\tpublic List<Banji> findCourse() {\\n\\t\\treturn studentDao.findCourse();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a448d8349a30a586ae90bb40ee62d7fb\",\n \"score\": \"0.5455143\",\n \"text\": \"public static void getInformationRelatedWithTheSelectedClass(int classId) {\\n\\n for (Clase clase : management.getClase()) {\\n if (clase.getClassId()==classId) {\\n System.out.println(\\\"Class Name:\\\" + clase.getName() + \\\" ||Class ID: \\\"+ clase.getClassId() + \\\" ||Assigned Class Room:\\\" + clase.getAssignedClassRoom() + \\\"||\\\");\\n System.out.println(\\\"........................................................................................................\\\");\\n System.out.println(\\\"Assigned Teacher:\\\");\\n System.out.println(clase.getTeacher().toString());\\n System.out.println(\\\"........................................................................................................\\\");\\n System.out.println(\\\"Students List:\\\");\\n for (Student student : clase.getStudents()) {\\n System.out.println(student);\\n }\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e856396d4b5bd747acae0eec5c34c62\",\n \"score\": \"0.5452483\",\n \"text\": \"List<Students> findByFirstNameAndMiddleName(String firstName,String middleName);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"50dbfe8aa97162aecbbc0b98124015b3\",\n \"score\": \"0.5451688\",\n \"text\": \"public void facultyStudents(String facultyName) {\\n\\t\\t\\tList<List<Course>> courses = persons.stream()\\n\\t\\t\\t\\t.filter(p -> p instanceof Faculty)\\n\\t\\t\\t\\t.map(e-> {\\n\\t\\t\\t\\t\\tFaculty f = (Faculty)e;\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\treturn f;\\t\\t\\n\\t\\t\\t\\t})\\n\\t\\t\\t\\t.peek(e -> System.out.println(\\\"Mapped value: \\\" + e))\\n\\t\\t\\t\\t.filter(f-> f.getName().equals(facultyName))\\n\\t\\t\\t\\t.map(f -> f.getCourses())\\n\\t\\t\\t\\t.peek(e -> System.out.println(\\\"Mapped value 2: \\\" + e))\\n\\t\\t\\t\\t.collect(Collectors.toList());\\n\\t\\t\\n\\t\\t\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7efd20bfd4b4e0df42e619b36902b9c3\",\n \"score\": \"0.5449179\",\n \"text\": \"public List<Enrolled> getStudentEnrollment(String student_fk) {\\n Connection conn = null;\\n PreparedStatement stmt = null;\\n ResultSet rs = null;\\n List<Enrolled> rval = new ArrayList<>();\\n\\n try {\\n conn = DriverManager.getConnection(__jdbcUrl);\\n\\n stmt = conn.prepareStatement(\\\"select * from enrolled where student_fk = ?\\\");\\n stmt.setString(1,student_fk);\\n rs = stmt.executeQuery();\\n while (rs.next()) {\\n rval.add(new Enrolled(rs.getInt(1), rs.getInt(2), rs.getString(3)));\\n }\\n }\\n catch (Exception se) {\\n se.printStackTrace();\\n return null;\\n }\\n finally {\\n DbUtils.closeConnections(rs, stmt, conn);\\n }\\n\\n return rval;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4871512c3a0f2a87a72917923d8d07c8\",\n \"score\": \"0.54476523\",\n \"text\": \"@Override\\n\\tpublic ArrayList<RegisteredCourses> viewCourseStudents(String courseID, Integer semesterID) throws NoStudentInCourseException{\\n\\t\\tConnection connection=DBUtil.getConnection();\\n\\t\\ttry {\\n\\t\\t\\tPreparedStatement stmt = connection.prepareStatement(SQLQueries.VIEW_REGISTERED_STUDENTS(courseID, semesterID));\\n\\t\\t\\tstmt.setString(1, courseID);\\n\\t\\t\\tstmt.setInt(2, semesterID);\\n\\t\\t\\tResultSet rs = stmt.executeQuery();\\n\\t\\t\\t\\n\\t\\t\\tArrayList<RegisteredCourses> ans = new ArrayList<RegisteredCourses>();\\n\\t\\t\\tArrayList<String> temp = new ArrayList<String>();\\n\\t\\t\\tif(!rs.next())\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tthrow new NoStudentInCourseException(courseID);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tdo {\\n\\t\\t\\t\\t\\ttemp.add(rs.getString(\\\"course_id\\\"));\\n\\t\\t\\t\\t\\tRegisteredCourses tempObject = new RegisteredCourses(rs.getInt(\\\"student_id\\\"), rs.getInt(\\\"semester_id\\\"), temp);\\n\\t\\t\\t\\t\\tans.add(tempObject);\\n\\t\\t\\t\\t\\ttemp.clear();\\n\\t\\t\\t\\t}while(rs.next());\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\n\\t\\t\\treturn ans;\\n\\t\\t}\\n\\t\\tcatch(SQLException e) {\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"25c1a45ec62c26d9ec7140ac84b9a16f\",\n \"score\": \"0.5446191\",\n \"text\": \"@Override\\n\\tpublic List<Map<String, Object>> searchBanjiCourse(String classname) {\\n\\t\\treturn studentDao.searchBanjiCourse(classname);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aaaacd7896f608fcd79482ee76bc2195\",\n \"score\": \"0.5440708\",\n \"text\": \"public String getCollege();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cbea8c7a9a63a49d6d8617307f678761\",\n \"score\": \"0.54404855\",\n \"text\": \"@Override\\n public List<mmStaff> listStaffsByDepartment(String departmentCode){\\n \\ttry {\\n \\t\\tif(departmentCode != null){\\n \\t\\t\\treturn staffDAO.listStaffsByDepartment(departmentCode);\\n \\t\\t}\\n \\t\\treturn null;\\n } catch (Exception e) {\\n System.out.println(\\\"Exception: \\\" + e.getMessage());\\n return null;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e8daea42d23de50c03ee41a331310b6e\",\n \"score\": \"0.54381835\",\n \"text\": \"@SuppressWarnings(\\\"unchecked\\\")\\r\\n\\t@Override\\r\\n\\tpublic List<Department> select(String CollegeID) {\\n\\t\\tList<Department> list=new ArrayList<Department>();\\r\\n\\t\\tString HQL=\\\"from Department dep where dep.college.CollegeID=?\\\";\\r\\n\\t\\tObject [] parmas={CollegeID};\\r\\n\\t\\tlist=hb.select(HQL,parmas);\\r\\n\\t\\treturn list;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ef71c00679d957ed3d025fa446a85a86\",\n \"score\": \"0.54355747\",\n \"text\": \"public List<GradedStudent> getGradedStudents(String courseId) {\\n List<GradedStudent> gradedStudents = new ArrayList<>();\\n\\n String query =\\n \\\"select username, first_name, last_name, phone_number, email, role_id, users.department_id, grade \\\"\\n + \\\"from users \\\"\\n + \\\"inner join grades \\\"\\n + \\\"on users.username = grades.student_id \\\"\\n + \\\"inner join courses \\\"\\n + \\\"on grades.course_id = courses.id \\\"\\n + \\\"where grades.course_id = ?\\\";\\n\\n try ( Connection con = ds.getConnection();\\n PreparedStatement stmt = con.prepareStatement(query)) {\\n\\n stmt.setString(1, courseId);\\n\\n try (ResultSet rs = stmt.executeQuery()) {\\n while (rs.next()) {\\n gradedStudents.add(new GradedStudent(\\n rs.getString(\\\"username\\\"),\\n null,\\n rs.getString(\\\"first_name\\\"),\\n rs.getString(\\\"last_name\\\"),\\n rs.getLong(\\\"phone_number\\\"),\\n rs.getString(\\\"email\\\"),\\n rs.getString(\\\"role_id\\\"),\\n rs.getString(\\\"department_id\\\"),\\n rs.getInt(\\\"grade\\\")));\\n }\\n }\\n\\n } catch (SQLException e) {\\n e.printStackTrace();\\n }\\n\\n return gradedStudents;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7d5d4bac2ff2c5b05470af31cea82fb8\",\n \"score\": \"0.54291624\",\n \"text\": \"@Override\\n\\tpublic String getStudentByNo(String no) {\\n\\t\\treturn myDao.getStudentByNo(no);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f46210f4d3b1cc400d318676fd419e98\",\n \"score\": \"0.5421967\",\n \"text\": \"@Query(\\\"SELECT sc FROM StudentCourse as sc WHERE sc.enrollmentID = :eid\\\")\\r\\n\\tStudentCourse findEnrollmentByID(@Param(\\\"eid\\\") int eid);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9b6a164127ec13b9fd623da73c8d1d58\",\n \"score\": \"0.541961\",\n \"text\": \"public List<MemberDTO> getStudentId(String studentId) {\\n EntityManager em = emf.createEntityManager();\\n TypedQuery<Member> query = em.createQuery(\\\"SELECT m FROM Member m WHERE m.studentId LIKE :studentId\\\", Member.class);\\n query.setParameter(\\\"studentId\\\", \\\"%\\\" + studentId + \\\"%\\\");\\n List<Member> members = query.getResultList();\\n List<MemberDTO> memberDTOs = new ArrayList();\\n members.forEach((Member member) -> {\\n memberDTOs.add(new MemberDTO(member));\\n });\\n return memberDTOs;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd1dcd47b51c5652b41e4e78314a8ef7\",\n \"score\": \"0.5409898\",\n \"text\": \"public static List<SchoolClass> createSchoolClassesList(Student student) {\\n\\t\\tList<SchoolClass> returnSchoolClasses = new ArrayList<SchoolClass>();\\n\\n\\t\\tString sql = \\\"SELECT * FROM school_class_student WHERE student_id=\\\\'\\\" + student.id + \\\"\\\\'\\\";\\n\\n\\t\\tConnection connection = DB.getConnection();\\n\\t\\tStatement statement = null;\\n\\t\\ttry {\\n\\t\\t\\tstatement = connection.createStatement();\\n\\t\\t\\tstatement.execute(sql);\\n\\t\\t\\tResultSet rs = statement.getResultSet();\\n\\t\\t\\twhile (rs.next()) {\\n\\t\\t\\t\\treturnSchoolClasses.add(SchoolClass.find.where().eq(\\\"ID\\\", rs.getLong(\\\"school_class_id\\\")).findUnique());\\n\\t\\t\\t}\\n\\t\\t} catch (SQLException e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\n\\t\\ttry {\\n\\t\\t\\tstatement.close();\\n\\t\\t\\tconnection.close();\\n\\t\\t} catch (SQLException e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\n\\t\\treturn returnSchoolClasses;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e8ef9c7b519489847ba2eb7b4433110b\",\n \"score\": \"0.54076684\",\n \"text\": \"List<ClassInfo> selectByExample(ClassInfoExample example);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e8ef9c7b519489847ba2eb7b4433110b\",\n \"score\": \"0.54076684\",\n \"text\": \"List<ClassInfo> selectByExample(ClassInfoExample example);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b3dcf44c0a538c43126c18c8d1943d5\",\n \"score\": \"0.540314\",\n \"text\": \"private ArrayList<Student> findStudent(String searchTerm, String searchOn) { \\r\\n \\r\\n\\t//list of search results\\r\\n ArrayList<Student> studentsFound = new ArrayList<>(); \\r\\n \\r\\n switch (searchOn) {\\r\\n //search by student ID\\r\\n case \\\"ID\\\":\\r\\n for (Student student: students) {\\r\\n\\t\\t //add the student if a match found\\r\\n if (student.getStudentID().equalsIgnoreCase(searchTerm)) { \\r\\n studentsFound.add(student);\\r\\n }\\r\\n } \\r\\n break;\\r\\n\\t //search by student surname\\r\\n case \\\"surname\\\":\\r\\n for (Student student: students) {\\r\\n\\t\\t //add the student if a match found\\r\\n if (student.getSurname().equalsIgnoreCase(searchTerm)) {\\r\\n studentsFound.add(student);\\r\\n \\r\\n }\\r\\n } \\r\\n break;\\r\\n\\t //search by student first name\\r\\n case \\\"first\\\":\\r\\n for (Student student: students) {\\r\\n\\t\\t //add the student if a match found\\r\\n if (student.getGivenName().equalsIgnoreCase(searchTerm)) {\\r\\n studentsFound.add(student); \\r\\n }\\r\\n } \\r\\n break; \\r\\n }\\r\\n\\t//return the search results\\r\\n return studentsFound; \\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"69b0a3c5ccaadad17fc05b7a551b350e\",\n \"score\": \"0.54025364\",\n \"text\": \"public Student getStudentById(int stdId) {\\n SQLiteDatabase db = this.getWritableDatabase();\\n String query = \\\"SELECT id, name, age, class_name, city FROM student_info WHERE id = ?\\\";\\n Cursor cursor = db.rawQuery(query, new String[] {String.valueOf(stdId)});\\n cursor.moveToFirst();\\n Student std = new Student();\\n std.setId(cursor.getInt(0));\\n std.setName(cursor.getString(1));\\n std.setAge(cursor.getInt(2));\\n std.setClassName(cursor.getString(3));\\n std.setCity(cursor.getString(4));\\n db.close();\\n return std;\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":983189,"cells":{"query_id":{"kind":"string","value":"8319cfcd49f690c1197254a23c3a7e29"},"query":{"kind":"string","value":"Verifies the specified remote group can be updated, if necessary."},"positive_passages":{"kind":"list like","value":[{"docid":"ae40422eee8bab9b0de29895e6055f16","score":"0.7365647","text":"@SuppressWarnings(\"unchecked\")\n private void verifyUpdate(RemoteProcessGroup remoteProcessGroup, RemoteProcessGroupDTO remoteProcessGroupDto) {\n // see if the remote process group can start/stop transmitting\n if (isNotNull(remoteProcessGroupDto.isTransmitting())) {\n if (!remoteProcessGroup.isTransmitting() && remoteProcessGroupDto.isTransmitting()) {\n remoteProcessGroup.verifyCanStartTransmitting();\n } else if (remoteProcessGroup.isTransmitting() && !remoteProcessGroupDto.isTransmitting()) {\n remoteProcessGroup.verifyCanStopTransmitting();\n }\n }\n\n // validate the proposed configuration\n final List<String> requestValidation = validateProposedRemoteProcessGroupConfiguration(remoteProcessGroupDto);\n // ensure there was no validation errors\n if (!requestValidation.isEmpty()) {\n throw new ValidationException(requestValidation);\n }\n\n // if any remote group properties are changing, verify update\n if (isAnyNotNull(remoteProcessGroupDto.getYieldDuration(),\n remoteProcessGroupDto.getLocalNetworkInterface(),\n remoteProcessGroupDto.getCommunicationsTimeout(),\n remoteProcessGroupDto.getProxyHost(),\n remoteProcessGroupDto.getProxyPort(),\n remoteProcessGroupDto.getProxyUser(),\n remoteProcessGroupDto.getProxyPassword())) {\n remoteProcessGroup.verifyCanUpdate();\n }\n }","title":""}],"string":"[\n {\n \"docid\": \"ae40422eee8bab9b0de29895e6055f16\",\n \"score\": \"0.7365647\",\n \"text\": \"@SuppressWarnings(\\\"unchecked\\\")\\n private void verifyUpdate(RemoteProcessGroup remoteProcessGroup, RemoteProcessGroupDTO remoteProcessGroupDto) {\\n // see if the remote process group can start/stop transmitting\\n if (isNotNull(remoteProcessGroupDto.isTransmitting())) {\\n if (!remoteProcessGroup.isTransmitting() && remoteProcessGroupDto.isTransmitting()) {\\n remoteProcessGroup.verifyCanStartTransmitting();\\n } else if (remoteProcessGroup.isTransmitting() && !remoteProcessGroupDto.isTransmitting()) {\\n remoteProcessGroup.verifyCanStopTransmitting();\\n }\\n }\\n\\n // validate the proposed configuration\\n final List<String> requestValidation = validateProposedRemoteProcessGroupConfiguration(remoteProcessGroupDto);\\n // ensure there was no validation errors\\n if (!requestValidation.isEmpty()) {\\n throw new ValidationException(requestValidation);\\n }\\n\\n // if any remote group properties are changing, verify update\\n if (isAnyNotNull(remoteProcessGroupDto.getYieldDuration(),\\n remoteProcessGroupDto.getLocalNetworkInterface(),\\n remoteProcessGroupDto.getCommunicationsTimeout(),\\n remoteProcessGroupDto.getProxyHost(),\\n remoteProcessGroupDto.getProxyPort(),\\n remoteProcessGroupDto.getProxyUser(),\\n remoteProcessGroupDto.getProxyPassword())) {\\n remoteProcessGroup.verifyCanUpdate();\\n }\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"89fe4fa842f8392aeb8601820bf064e4","score":"0.6278116","text":"private boolean updateGroup(int id) {\r\n\t\tGroup group = new Group();\r\n\t\tgroup.setID(id);\r\n\t\tgroup.setDescription(\"Updated Group\");\r\n\t\tgroup.setName(\"Update Test\");\r\n\t\treturn requester.updateObject(group);\r\n\t}","title":""},{"docid":"27f9b69e18f57a55b84010b5230736ea","score":"0.62176704","text":"private RemoteProcessGroup updateRemoteProcessGroup(RemoteProcessGroup remoteProcessGroup, RemoteProcessGroupDTO remoteProcessGroupDTO) {\n verifyUpdate(remoteProcessGroup, remoteProcessGroupDTO);\n\n // configure the remote process group\n final String targetUris = remoteProcessGroupDTO.getTargetUris();\n final String name = remoteProcessGroupDTO.getName();\n final String comments = remoteProcessGroupDTO.getComments();\n final String communicationsTimeout = remoteProcessGroupDTO.getCommunicationsTimeout();\n final String yieldDuration = remoteProcessGroupDTO.getYieldDuration();\n final String proxyHost = remoteProcessGroupDTO.getProxyHost();\n final Integer proxyPort = remoteProcessGroupDTO.getProxyPort();\n final String proxyUser = remoteProcessGroupDTO.getProxyUser();\n final String proxyPassword = remoteProcessGroupDTO.getProxyPassword();\n\n final String transportProtocol = remoteProcessGroupDTO.getTransportProtocol();\n final String localNetworkInterface = remoteProcessGroupDTO.getLocalNetworkInterface();\n\n if (isNotNull(targetUris)) {\n remoteProcessGroup.setTargetUris(targetUris);\n }\n if (isNotNull(name)) {\n remoteProcessGroup.setName(name);\n }\n if (isNotNull(comments)) {\n remoteProcessGroup.setComments(comments);\n }\n if (isNotNull(communicationsTimeout)) {\n remoteProcessGroup.setCommunicationsTimeout(communicationsTimeout);\n }\n if (isNotNull(yieldDuration)) {\n remoteProcessGroup.setYieldDuration(yieldDuration);\n }\n if (isNotNull(remoteProcessGroupDTO.getPosition())) {\n remoteProcessGroup.setPosition(new Position(remoteProcessGroupDTO.getPosition().getX(), remoteProcessGroupDTO.getPosition().getY()));\n }\n if (isNotNull(transportProtocol)) {\n remoteProcessGroup.setTransportProtocol(SiteToSiteTransportProtocol.valueOf(transportProtocol.toUpperCase()));\n // No null check because these proxy settings have to be clear if not specified.\n // But when user Enable/Disable transmission, only isTransmitting is sent.\n // To prevent clearing these values in that case, set these only if transportProtocol is sent,\n // assuming UI sends transportProtocol always for update.\n remoteProcessGroup.setProxyHost(proxyHost);\n remoteProcessGroup.setProxyPort(proxyPort);\n remoteProcessGroup.setProxyUser(proxyUser);\n // Keep using current password when null or \"********\" was sent.\n // Passing other values updates the password,\n // specify empty String to clear password.\n if (isNotNull(proxyPassword) && !DtoFactory.SENSITIVE_VALUE_MASK.equals(proxyPassword)) {\n remoteProcessGroup.setProxyPassword(proxyPassword);\n }\n }\n if (localNetworkInterface != null) {\n if (StringUtils.isBlank(localNetworkInterface)) {\n remoteProcessGroup.setNetworkInterface(null);\n } else {\n remoteProcessGroup.setNetworkInterface(localNetworkInterface);\n }\n }\n\n final Boolean isTransmitting = remoteProcessGroupDTO.isTransmitting();\n if (isNotNull(isTransmitting)) {\n // start or stop as necessary\n if (!remoteProcessGroup.isConfiguredToTransmit() && isTransmitting) {\n remoteProcessGroup.startTransmitting();\n } else if (remoteProcessGroup.isConfiguredToTransmit() && !isTransmitting) {\n remoteProcessGroup.stopTransmitting();\n }\n }\n\n final ProcessGroup group = remoteProcessGroup.getProcessGroup();\n if (group != null) {\n group.onComponentModified();\n }\n return remoteProcessGroup;\n }","title":""},{"docid":"5ef5d898a38c8198e38e6cf2dd7c622e","score":"0.6134846","text":"public boolean updateGroup(MemberGroup group) {\n\t\tif (group == null) throw new IllegalParameterException(new String[]{\"group\"}, new Object[]{group});\n\n\t\t// save group\n\t\tmemberGroupDAO.persist(group);\n\t\tlogger.info(\"updateGroup: New Member Group(\" + group.getId() + \") updated\");\n\n\t\treturn true;\n\t}","title":""},{"docid":"514a52c57c1d321ee151611ad6ce2af1","score":"0.6079206","text":"@Override\n\tpublic boolean updateGroup(ProductGroup productGroup) {\n\t\treturn false;\n\t}","title":""},{"docid":"da5bab5b691aaef1e46be2bb35405d88","score":"0.6077985","text":"UpdateGroupResult updateGroup(UpdateGroupRequest updateGroupRequest);","title":""},{"docid":"bde6b2df4ed9009032781b009692a1b0","score":"0.6074299","text":"private void verifyUpdatePort(RemoteGroupPort port, RemoteProcessGroupPortDTO remoteProcessGroupPortDto) {\n // see if the remote process group can start/stop transmitting\n if (isNotNull(remoteProcessGroupPortDto.isTransmitting())) {\n if (!port.isRunning() && remoteProcessGroupPortDto.isTransmitting()) {\n port.verifyCanStart();\n } else if (port.isRunning() && !remoteProcessGroupPortDto.isTransmitting()) {\n port.verifyCanStop();\n }\n }\n\n // validate the proposed configuration\n final List<String> requestValidation = validateProposedRemoteProcessGroupPortConfiguration(port, remoteProcessGroupPortDto);\n // ensure there was no validation errors\n if (!requestValidation.isEmpty()) {\n throw new ValidationException(requestValidation);\n }\n\n\n // verify update when appropriate\n if (isAnyNotNull(remoteProcessGroupPortDto.getConcurrentlySchedulableTaskCount(),\n remoteProcessGroupPortDto.getUseCompression(),\n remoteProcessGroupPortDto.getBatchSettings())) {\n port.verifyCanUpdate();\n }\n }","title":""},{"docid":"8721e4b8ea240e538917319f0eb50615","score":"0.5949514","text":"private void updateGroupStatus(List<GroupInfo> groups, LdapUserGroup group, LdapUserGroupModel groupModel,\n int groupIndex) {\n if (groupIndex != -1) {\n GroupInfo groupInfo = groups.get(groupIndex);\n String realmAttributes = groupInfo.getRealmAttributes();\n String dn = getDnFromRealmAttributes(realmAttributes);\n if (!dn.equals(group.getGroupDn())) {\n groupModel.setRequiredUpdate(LdapUserGroup.Status.REQUIRES_UPDATE);\n } else {\n groupModel.setRequiredUpdate(LdapUserGroup.Status.IN_ARTIFACTORY);\n }\n } else {\n groupModel.setRequiredUpdate(LdapUserGroup.Status.DOES_NOT_EXIST);\n }\n }","title":""},{"docid":"49c66495fd75493bae76cac28be9b93a","score":"0.59004575","text":"@Test\n public void testUpdateGroupOK() throws Exception {\n final Long gid1=2L, member1Id = 1L;\n \n Member member1 = Member.builder().memberId(member1Id).name(group2Member1Name).rating(group2Member1Rating).build();\n List<Member> members = new ArrayList<Member>();\n members.add(member1);\n Groups group1 = Groups.builder().gid(gid1).groupName(group1Name).members(members).attr1(attr1).build();\n \n memberRepository.save(member1);\n groupsRepository.save(group1);\n\n //when updates with pu\n members.remove(member1);\n Member updatedMember = Member.builder().memberId(member1Id).name(group2Member1Name).rating(updatedRating).build();\n members.add(updatedMember);\n Groups modifiedGroups = Groups.builder().gid(gid1).groupName(updatedGroup2Name).attr1(updatedAttr1).attr2(attr2).members(members).build();\n \n final String baseUrl = BASE_URL_ROOT+serverPort+\"/wrest/group/\"+groupsRepository.findGroupsByGroupName(group1Name).get().get(0).getGid();\n \n HttpEntity<Groups> request = new HttpEntity<>(modifiedGroups);\n ResponseEntity<String> response = this.testTemplate.exchange(baseUrl, HttpMethod.PUT, request, String.class);\n \n //verify tehe updates\n assertEquals(HttpStatus.ACCEPTED, response.getStatusCode());\n assertTrue(response.getBody().contains(group2Member1Name));\n assertTrue(response.getBody().contains(String.valueOf(updatedRating)));\n assertTrue(response.getBody().contains(updatedGroup2Name));\n assertFalse(response.getBody().contains(group1Name));\n assertTrue(response.getBody().contains(String.valueOf(group2Member1Rating)));\n //assertEquals(JsonUtil.asJsonString(modifiedGroups), result.getBody());\n }","title":""},{"docid":"a519beedbb86993ec464156a3874189c","score":"0.57351595","text":"void update() throws GroupsException;","title":""},{"docid":"054802606421cb343008678bca7f2d85","score":"0.5733872","text":"int update(GroupAccount groupNo) throws Exception;","title":""},{"docid":"62278c5ec9b70de2a7a5b9fc10c62e43","score":"0.5720774","text":"public boolean belongGroup(MsnGroup group);","title":""},{"docid":"bd827bdc39790a5291f6320d776e95d8","score":"0.56505823","text":"public int update(Group group) {\n\t\treturn groupDao.update(group);\n\t}","title":""},{"docid":"edecde4879047508cc465053d4f5fe79","score":"0.55560416","text":"default void updateGroup(\n com.google.cloud.migrationcenter.v1.UpdateGroupRequest request,\n io.grpc.stub.StreamObserver<com.google.longrunning.Operation> responseObserver) {\n io.grpc.stub.ServerCalls.asyncUnimplementedUnaryCall(\n getUpdateGroupMethod(), responseObserver);\n }","title":""},{"docid":"751997617f643ec5704a12d3982cd811","score":"0.5533695","text":"public String updateMetricGroup(MetricGroup group) throws RdkTimeoutException {\n reauthenticate();\n logger.log(Level.INFO, \"PUT \" + metricsServiceUrl + \"/groups/\" + group.get_id());\n logger.log(Level.INFO, gson.toJson(group));\n WebTarget dashboardsTarget = metricsServiceTarget.path(\"groups/\" + group.get_id());\n Response response = dashboardsTarget.request().cookie(rdkCookies.get(RDK_COOKIE_ID)).accept(MediaType.TEXT_PLAIN)\n \t\t.header(\"Authorization\", \"Bearer \" + jwtHeader).put(Entity.entity(group, MediaType.APPLICATION_JSON));\n processResponse(response);\n MetricsServiceResponse<GenericResult> id = response.readEntity(new GenericType<MetricsServiceResponse<GenericResult>>() {\n });\n logger.log(Level.INFO, \"updateMetricGroupResponse: \\n\" + gson.toJson(id));\n return id.getData().getResult();\n }","title":""},{"docid":"f8529cac48b5ff7fd338ce3d97b61f20","score":"0.55242383","text":"@Override\n public boolean isInGroup(String group)\n {\n return false;\n }","title":""},{"docid":"436cb449ed390bcb38796fa7e3f280c5","score":"0.5510213","text":"@Override\r\n\tpublic boolean doUpdate(Groups vo) throws Exception {\n\t\treturn false;\r\n\t}","title":""},{"docid":"3425bef875dc64d8537495a20b09245e","score":"0.54248005","text":"protected abstract boolean groupCheck();","title":""},{"docid":"57c4d5a66cbdd1e45795102afacc5da3","score":"0.5423194","text":"int update(Dues groupNo) throws Exception;","title":""},{"docid":"7f0e067f0427c89af80fdfa9de012ecf","score":"0.5413388","text":"public void test_updateAllAssignmentsInGroup() {\n Group group1 = new GroupBuilder().withName(\"g1\").build();\n Group group2 = new GroupBuilder().withName(\"g2\").build();\n mDatabaseManager.create(group1);\n mDatabaseManager.create(group2);\n\n // Add some Members\n Member m1 = new MemberBuilder().withName(\"m1\").build();\n Member m2 = new MemberBuilder().withName(\"m2\").build();\n Member m3 = new MemberBuilder().withName(\"m3\").build();\n m1.setGroup(group1);\n m2.setGroup(group1);\n m3.setGroup(group1);\n mDatabaseManager.create(m1);\n mDatabaseManager.create(m2);\n mDatabaseManager.create(m3);\n\n // Attempt with no Assignments\n mDatabaseManager.updateAllAssignmentsInGroup(group1.getId(), Assignment.Status.Assigned);\n\n // Create the assignments\n Assignment a1 = new Assignment();\n a1.setGiverMember(m1);\n a1.setReceiverMember(m2);\n mDatabaseManager.create(a1);\n\n Assignment a2 = new Assignment();\n a2.setGiverMember(m2);\n a2.setReceiverMember(m3);\n mDatabaseManager.create(a2);\n\n Assignment a3 = new Assignment();\n a3.setGiverMember(m3);\n a3.setReceiverMember(m1);\n mDatabaseManager.create(a3);\n\n /*\n * Create some Members and Assignments for Group2\n * These Assignments should not be affected by the update on Group1\n */\n Member m1_2 = new MemberBuilder().withName(\"m1_2\").build();\n Member m2_2 = new MemberBuilder().withName(\"m2_2\").build();\n Member m3_2 = new MemberBuilder().withName(\"m3_2\").build();\n m1_2.setGroup(group2);\n m2_2.setGroup(group2);\n m3_2.setGroup(group2);\n mDatabaseManager.create(m1_2);\n mDatabaseManager.create(m2_2);\n mDatabaseManager.create(m3_2);\n\n // Create the assignments\n Assignment a1_2 = new Assignment();\n a1_2.setGiverMember(m1_2);\n a1_2.setReceiverMember(m2_2);\n mDatabaseManager.create(a1_2);\n\n Assignment a2_2 = new Assignment();\n a2_2.setGiverMember(m2_2);\n a2_2.setReceiverMember(m3_2);\n mDatabaseManager.create(a2_2);\n\n Assignment a3_2 = new Assignment();\n a3_2.setGiverMember(m3_2);\n a3_2.setReceiverMember(m1_2);\n mDatabaseManager.create(a3_2);\n\n // Verify initial Assignment state\n assertEquals(Assignment.Status.Assigned, a1.getSendStatus());\n assertEquals(Assignment.Status.Assigned, a2.getSendStatus());\n assertEquals(Assignment.Status.Assigned, a3.getSendStatus());\n\n assertEquals(Assignment.Status.Assigned, a1_2.getSendStatus());\n assertEquals(Assignment.Status.Assigned, a2_2.getSendStatus());\n assertEquals(Assignment.Status.Assigned, a3_2.getSendStatus());\n\n // Update all the Assignments for Group1\n mDatabaseManager.updateAllAssignmentsInGroup(group1.getId(), Assignment.Status.Sent);\n\n // Verify Assignment state updated for Group1\n assertEquals(Assignment.Status.Sent, mDatabaseManager.queryById(a1.getId(), Assignment.class).getSendStatus());\n assertEquals(Assignment.Status.Sent, mDatabaseManager.queryById(a2.getId(), Assignment.class).getSendStatus());\n assertEquals(Assignment.Status.Sent, mDatabaseManager.queryById(a3.getId(), Assignment.class).getSendStatus());\n\n // Verify Assignment state NOT updated for Group2\n assertEquals(Assignment.Status.Assigned, a1_2.getSendStatus());\n assertEquals(Assignment.Status.Assigned, a2_2.getSendStatus());\n assertEquals(Assignment.Status.Assigned, a3_2.getSendStatus());\n }","title":""},{"docid":"3bd61187d5bb7d55d8417e4de009c9f6","score":"0.54118013","text":"public com.google.common.util.concurrent.ListenableFuture<com.google.longrunning.Operation>\n updateGroup(com.google.cloud.migrationcenter.v1.UpdateGroupRequest request) {\n return io.grpc.stub.ClientCalls.futureUnaryCall(\n getChannel().newCall(getUpdateGroupMethod(), getCallOptions()), request);\n }","title":""},{"docid":"f121a4ba6325fa50d9790880e95b16d3","score":"0.5387682","text":"void updateGroup(@NonNull PermissionGroup permissionGroup);","title":""},{"docid":"a08ff3dee4ac4b0cf3d7d9d8064df6c7","score":"0.5371093","text":"public void updateGroup(\n com.google.cloud.migrationcenter.v1.UpdateGroupRequest request,\n io.grpc.stub.StreamObserver<com.google.longrunning.Operation> responseObserver) {\n io.grpc.stub.ClientCalls.asyncUnaryCall(\n getChannel().newCall(getUpdateGroupMethod(), getCallOptions()),\n request,\n responseObserver);\n }","title":""},{"docid":"1f8c537e0153193e1a3787319182fa91","score":"0.53547025","text":"boolean canAddMember(String groupUid);","title":""},{"docid":"886335c980a7b4c6c7e54a75dbb9790b","score":"0.53297627","text":"public void testUpdateGroupNotUniqueFails() {\n\n Group g1 = new GroupBuilder().withName(\"g1\").build();\n Group g2 = new GroupBuilder().withName(\"g2\").build();\n mDatabaseManager.create(g1);\n mDatabaseManager.create(g2);\n\n // Now try to get it back (but doesn't exist)\n try {\n g2.setName(g1.getName());\n mDatabaseManager.update(g2);\n fail(\"Should have thrown SQLException - non unique Group name is not allowed\");\n } catch(SQLException exp) {\n assertTrue(true);\n }\n }","title":""},{"docid":"540d5f9349f28178f277fe8fc2d53c8d","score":"0.53134954","text":"@Test\n\tpublic void whenCreateGroupWithSameNameThenReturnShouldBeTrue() {\n\t\tassertTrue(manager.checkGroupExistence(\"TVD\"));\n\t}","title":""},{"docid":"c59830c94ae43ee3599691b2b28f2a6c","score":"0.5293798","text":"private boolean updateBPGroup(X_I_BP_GroupJP impBPGroup, MBPGroup updateBPGroup)\r\n\t{\r\n\t\tModelValidationEngine.get().fireImportValidate(this, impBPGroup, updateBPGroup, ImportValidator.TIMING_BEFORE_IMPORT);\r\n\r\n\t\tupdateBPGroup.setAD_Org_ID(impBPGroup.getAD_Org_ID());\r\n\r\n\t\tif(!Util.isEmpty(impBPGroup.getName()))\r\n\t\t\tupdateBPGroup.setName(impBPGroup.getName());\r\n\r\n\t\tif(!Util.isEmpty(impBPGroup.getDescription()))\r\n\t\t\tupdateBPGroup.setDescription(impBPGroup.getDescription());\r\n\r\n\t\tupdateBPGroup.setIsDefault(impBPGroup.isDefault());\r\n\t\tupdateBPGroup.setIsConfidentialInfo(impBPGroup.isConfidentialInfo());\r\n\r\n\t\tif(impBPGroup.getAD_PrintColor_ID() > 0)\r\n\t\t\tupdateBPGroup.setAD_PrintColor_ID(impBPGroup.getAD_PrintColor_ID());\r\n\r\n\t\tif(impBPGroup.getM_PriceList_ID() > 0)\r\n\t\t\tupdateBPGroup.setM_PriceList_ID(impBPGroup.getM_PriceList_ID());\r\n\r\n\t\tif(impBPGroup.getPO_PriceList_ID() > 0)\r\n\t\t\tupdateBPGroup.setPO_PriceList_ID(impBPGroup.getPO_PriceList_ID());\r\n\r\n\t\tif(impBPGroup.getM_DiscountSchema_ID() > 0)\r\n\t\t\tupdateBPGroup.setM_DiscountSchema_ID(impBPGroup.getM_DiscountSchema_ID());\r\n\r\n\t\tif(impBPGroup.getPO_DiscountSchema_ID() > 0)\r\n\t\t\tupdateBPGroup.setPO_DiscountSchema_ID(impBPGroup.getPO_DiscountSchema_ID());\r\n\r\n\t\tif(impBPGroup.getCreditWatchPercent() != null)\r\n\t\t\tupdateBPGroup.setCreditWatchPercent(impBPGroup.getCreditWatchPercent());\r\n\r\n\t\tif(impBPGroup.getPriceMatchTolerance() != null)\r\n\t\t\tupdateBPGroup.setPriceMatchTolerance(impBPGroup.getPriceMatchTolerance());\r\n\r\n\t\tif(impBPGroup.getC_Dunning_ID() > 0)\r\n\t\t\tupdateBPGroup.setC_Dunning_ID(impBPGroup.getC_Dunning_ID());\r\n\r\n\t\tupdateBPGroup.setIsActive(impBPGroup.isI_IsActiveJP());\r\n\r\n\r\n\t\tModelValidationEngine.get().fireImportValidate(this, impBPGroup, updateBPGroup, ImportValidator.TIMING_AFTER_IMPORT);\r\n\r\n\t\ttry {\r\n\t\t\tupdateBPGroup.saveEx(get_TrxName());\r\n\t\t}catch (Exception e) {\r\n\t\t\timpBPGroup.setI_ErrorMsg(Msg.getMsg(getCtx(),\"SaveError\") + Msg.getElement(getCtx(), \"C_BP_Group_ID\")+\" : \" + e.toString());\r\n\t\t\timpBPGroup.setI_IsImported(false);\r\n\t\t\timpBPGroup.setProcessed(false);\r\n\t\t\timpBPGroup.saveEx(get_TrxName());\r\n\t\t\treturn false;\r\n\t\t}\r\n\r\n\t\tif(!Util.isEmpty(impBPGroup.getJP_AcctSchema_Name()) && impBPGroup.getC_AcctSchema_ID() > 0)\r\n\t\t\tsetBPGroupAcct(updateBPGroup, impBPGroup);\r\n\r\n\t\tif(Util.isEmpty(impBPGroup.getI_ErrorMsg()))\r\n\t\t{\r\n\t\t\timpBPGroup.setI_ErrorMsg(Msg.getMsg(getCtx(), \"Update\"));\r\n\t\t}else {\r\n\t\t\timpBPGroup.setI_ErrorMsg(Msg.getMsg(getCtx(), \"Update\") + \" & \" + impBPGroup.getI_ErrorMsg());\r\n\t\t}\r\n\r\n\t\timpBPGroup.setI_IsImported(true);\r\n\t\timpBPGroup.setProcessed(true);\r\n\t\timpBPGroup.saveEx(get_TrxName());\r\n\r\n\t\treturn true;\r\n\t}","title":""},{"docid":"9dad7a406668661b6273bd2563c388ab","score":"0.5284574","text":"public boolean updateGroupData(final InterviewAssessMaster bean) {\r\n\t\tboolean result = false;\r\n\t\ttry {\r\n\t\t\tfinal Object[][] updateObj = new Object[1][5];\r\n\t\t\tupdateObj[0][0] = bean.getGroupName();\r\n\t\t\tupdateObj[0][1] = bean.getGroupDescription();\r\n\t\t\tupdateObj[0][2] = bean.getGroupAbbreviation();\r\n\t\t\tupdateObj[0][3] = bean.getIsGroupActive();\r\n\t\t\tupdateObj[0][4] = bean.getGroupCode();\r\n\t\t\tresult = this.getSqlModel().singleExecute(\r\n\t\t\t\t\t\t\t\"UPDATE HRMS_REC_INTERVIEW_GROUP SET HRMS_REC_INTERVIEW_GROUP.GROUP_NAME = ?, HRMS_REC_INTERVIEW_GROUP.GROUP_DESCRIPTION = ?, HRMS_REC_INTERVIEW_GROUP.GROUP_ABBR = ?, HRMS_REC_INTERVIEW_GROUP.GROUP_IS_ACTIVE = ? WHERE HRMS_REC_INTERVIEW_GROUP.GROUP_ID = ? \",\r\n\t\t\t\t\t\t\tupdateObj);\r\n\t\t} catch (final Exception e) {\r\n\t\t\te.printStackTrace();\r\n\t\t}\r\n\t\treturn result;\r\n\t}","title":""},{"docid":"e24cf3728e62b9b0bc2f097a5fb26cda","score":"0.5280245","text":"@Override\n public Response updateGroup(int groupId, String groupName) {\n log.info(\"Start execution of method updateGroup(int groupId,String groupName)\");\n response.setStatus((byte) 0);\n response.setMessage(MessageConstants.GROUP_UPDATE_NOT_SUCESSFULL);\n Connection con = DBConnection.getConnection();\n if (con != null) {\n try {\n PreparedStatement pstmt = con.prepareStatement(SQLConstants.QUERY_UPDATE_GROUP_DETAILS);\n pstmt.setString(1, groupName);\n pstmt.setString(2, FeeManagement.userName);\n pstmt.setDate(3, new java.sql.Date(new java.util.Date().getTime()));\n pstmt.setInt(4, groupId);\n\n int i = pstmt.executeUpdate();\n\n if (i != 0) {\n\n response.setStatus((byte) 1);\n response.setMessage(MessageConstants.GROUP_UPDATE_SUCESSFULL);\n\n }\n } catch (SQLException ex) {\n log.info(MessageConstants.GROUP_UPDATE_NOT_SUCESSFULL);\n log.error(ex.getMessage());\n response.setMessage(MessageConstants.GROUP_UPDATE_NOT_SUCESSFULL);\n }\n\n } else {\n log.info(MessageConstants.CONNECTION_ERROR);\n response.setMessage(MessageConstants.CONNECTION_ERROR);\n }\n log.info(\"End of method updateGroup(int groupId,String groupName)\");\n return response;\n }","title":""},{"docid":"8994cf740ef27a676f60d320ac5c6960","score":"0.5217289","text":"public com.google.longrunning.Operation updateGroup(\n com.google.cloud.migrationcenter.v1.UpdateGroupRequest request) {\n return io.grpc.stub.ClientCalls.blockingUnaryCall(\n getChannel(), getUpdateGroupMethod(), getCallOptions(), request);\n }","title":""},{"docid":"4030d0ae796f9befec9c5351baa0a182","score":"0.5212039","text":"int updateByPrimaryKeySelective(Group record);","title":""},{"docid":"5729e6bc32a0955f1408fd8dce560449","score":"0.52080756","text":"@Test\r\n\tpublic void testIsGroupValid_2()\r\n\t\tthrows Exception {\r\n\t\tUserDetailService fixture = new UserDetailService();\r\n\t\tGroupDetail group = new GroupDetail();\r\n\t\tAirplaneModel ap = new AirplaneModel();\r\n\t\tAirplaneModel ap1= new AirplaneModel(12L);\r\n\t\tUserPrivilegesModel userPrivileges = new UserPrivilegesModel();\r\n\t\tList<AirplaneModel> list = new ArrayList<AirplaneModel>();\r\n\t\tList<AirplaneModel> list1 = new ArrayList<AirplaneModel>();\r\n\t\tlist.add(ap1);\r\n\t\tsuperUserMap.put(group,null);\r\n\t\tuserPrivileges.setSuperUserMap(superUserMap);\r\n\t\tboolean result = fixture.isGroupValid(group, userPrivileges);\r\n\t\tassertTrue(result);\r\n\t}","title":""},{"docid":"3387a9511c4ed4631cfcd8c2f91883f5","score":"0.51797867","text":"int updateByPrimaryKey(EcsUsergroup record);","title":""},{"docid":"39a507fe73d5a8598fd4f844ff95af2e","score":"0.51658213","text":"private void updateTaskGroup(TaskGroup aTaskGroup) {\n\t}","title":""},{"docid":"3fbc8279d298b78a0e993c08ea98555a","score":"0.5154286","text":"@Test\r\n\tpublic void testIsGroupValid_1()\r\n\t\tthrows Exception {\r\n\t\tUserDetailService fixture = new UserDetailService();\r\n\t\tGroupDetail group = new GroupDetail();\r\n\t\tAirplaneModel ap = new AirplaneModel();\r\n\t\tAirplaneModel ap1= new AirplaneModel(12L);\r\n\t\tUserPrivilegesModel userPrivileges = new UserPrivilegesModel();\r\n\t\tList<AirplaneModel> list = new ArrayList<AirplaneModel>();\r\n\t\tList<AirplaneModel> list1 = new ArrayList<AirplaneModel>();\r\n\t\tlist.add(ap1);\r\n\t\tsuperUserMap.put(group,list);\r\n\t\tuserPrivileges.setSuperUserMap(null);\r\n\t\tboolean result = fixture.isGroupValid(group, userPrivileges);\r\n\t\tassertFalse(result);\r\n\t}","title":""},{"docid":"1cba034344ecb7a708251a2477fc52a0","score":"0.5137546","text":"protected void completeSave(AuthzGroup azGroup)\n\t{\n\t\t// update the properties\n\t\taddLiveUpdateProperties((BaseAuthzGroup) azGroup);\n\n\t\t// allow any advisors to make last minute changes \n\t\tfor (AuthzGroupAdvisor authzGroupAdvisor : authzGroupAdvisors) {\n\t\t\ttry {\n\t\t\t\tauthzGroupAdvisor.update(azGroup);\n\t\t\t} catch (Exception e) {\n\t\t\t\tlog.error(\"Advisor error during completeSave()\", e);\n\t\t\t}\n\t\t}\n\t\t// complete the azGroup\n\t\tm_storage.save(azGroup);\n\n\t\t// track it\n\t\tString event = ((BaseAuthzGroup) azGroup).getEvent();\n\t\tif (event == null) event = SECURE_UPDATE_AUTHZ_GROUP;\n // KNL-1230 handle changes to authzgroups by processing caching changes\n if (SECURE_UPDATE_AUTHZ_GROUP.equals(event)) {\n // we only care about update events here\n try {\n HashSet<String> roles = null;\n HashSet<String> permissions = null;\n Set<DbAuthzGroupService.DbStorage.RoleAndFunction> lastChangedPerms = ((BaseAuthzGroup) azGroup).m_lastChangedRlFn;\n if (lastChangedPerms != null && !lastChangedPerms.isEmpty()) {\n roles = new HashSet<String>();\n permissions = new HashSet<String>(lastChangedPerms.size());\n for (DbAuthzGroupService.DbStorage.RoleAndFunction rf : lastChangedPerms) {\n permissions.add(rf.function);\n roles.add(rf.role);\n }\n if (log.isDebugEnabled()) {\n log.debug(\"Changed permissions for roles (\" + roles + \") in \" + azGroup.getId() + \": \" + permissions);\n }\n }\n ((SakaiSecurity) securityService()).notifyRealmChanged(azGroup.getId(), roles, permissions);\n } catch (Exception e) {\n log.warn(\"Failure while trying to notify SS about realm changes for AZG(\" + azGroup.getId() + \"): \" + e, e);\n }\n } // End KNL-1230\n\t\teventTrackingService().post(eventTrackingService().newEvent(event, azGroup.getReference(), true));\n\n\t\t// close the azGroup object\n\t\t((BaseAuthzGroup) azGroup).closeEdit();\n ((BaseAuthzGroup) azGroup).m_lastChangedRlFn = null; // cleanup\n\n\t\t// update the db with latest provider, and site security with the latest changes, using the updated azGroup\n\t\tBaseAuthzGroup updatedRealm = (BaseAuthzGroup) m_storage.get(azGroup.getId());\n\t\tupdateSiteSecurity(updatedRealm);\n\n\t\t// clear the event for next time\n\t\t((BaseAuthzGroup) azGroup).setEvent(null);\n\t}","title":""},{"docid":"4744e8644a5619b4cac96c05a0cf2bce","score":"0.5133182","text":"public static final boolean quitGroup(Group group) {\n try {\n Group newGroup = new Group(group); // Copy info from previous group\n newGroup.removeGroupMember(UserHelper.getLogged()); // Remove logged user from new group to update database\n\n Map<String, Object> newGroupMap = convertGroupToMap(newGroup);\n\n FirebaseConfig.getFirebaseDatabase() // remove member of Group\n .child(Constants.GroupNode.KEY)\n .child(group.getId())\n .setValue(newGroupMap);\n return true;\n } catch (Exception e) {\n Log.e(TAG, \"removeFromDatabase: \" + e.getMessage() );\n return false;\n }\n }","title":""},{"docid":"d4a2afbaca9f50b2e5075736d578fead","score":"0.5128491","text":"@Test(dataProvider = \"groupsFromFile\")\n public void testGroupCreationwithValidData(GroupData group) throws Exception {\n\t SortedListOf<GroupData> oldList = app.getGroupHelper().GetGroupsFormCash();\n\n app.getGroupHelper().createGroup(group);\n \n \n SortedListOf<GroupData> newlist= app.getApplicationModel().getGroups(); \n \n // assertEquals(newlist.size(),oldList.size()+1);\n//\t assertThat(newlist, equalTo(oldList.withAdded(group)));\n\t \n\t if(\"yes\".equals(app.getProperty(\"check.db\"))) {\n\t\t if (wantToCheck()) {\n\t\t assertThat(app.getApplicationModel().getGroups(),equalTo(app.getHibernateHelper().listGroups()));\n\t\t }\n\t }\n\t \n\t if(\"yes\".equals(app.getProperty(\"check.ui\"))) {\n\t\t if (wantToCheck()) {\n\t\t assertThat(app.getApplicationModel().getGroups(),equalTo(app.getGroupHelper().getUiGroups()));\n\t\t }\n\t }\n\t \n\t \n \n }","title":""},{"docid":"fd6033e2f88d6f735fec6609e1ce28ea","score":"0.5122548","text":"boolean isBackupGroup(KdbGroup group);","title":""},{"docid":"16367c103c198a77c2f38ca693de6ed7","score":"0.5121872","text":"@Transactional\n\t@Override\n\tpublic boolean updateGroupName(GroupInfo groupInfo) {\n\t\ttry {\n\t\t\treturn groupInfoMapper.updateByPrimaryKeySelective(groupInfo);\n\t\t} catch (Exception e) {\n\t\t\tlogger.error(\"修改群组名称时发生异常:\" + e.getMessage());\n\t\t\tthrow new RuntimeException();\n\t\t}\n\t\t\n\t}","title":""},{"docid":"5b2a0dd4d9c8696ca2de918f70da965d","score":"0.5116964","text":"public void update(int _no_tubes, String _group_name) throws SQLException{\n assert group_name != null : \"Precondition group_name != null\";\n s.update_group(no_tubes, group_name, member.get(0), member.get(1), member.get(2), _no_tubes, _group_name);\n }","title":""},{"docid":"fe5630be4c27cb99acab20e948429809","score":"0.5095303","text":"void updateMembers() throws GroupsException;","title":""},{"docid":"7fd6d16041a56735547234d9e3aabfc8","score":"0.5069843","text":"@Override\n public boolean leaveGroup(Group group, Person person) {\n try {\n String sql = \"DELETE FROM group_members WHERE groupID = ? AND userID = ?\";\n template.update(sql, group.getGroupID(), person.getPersonID());\n return true;\n } catch (Exception ex) {\n return false;\n }\n }","title":""},{"docid":"acd28bf6724ed32712500057ecbdedd0","score":"0.5067289","text":"boolean isGroupSupported();","title":""},{"docid":"572f1231f93d94afe80c16035809686b","score":"0.50447166","text":"@Test\r\n\tpublic void testIsGroupValid_3()\r\n\t\tthrows Exception {\r\n\t\tUserDetailService fixture = new UserDetailService();\r\n\t\tGroupDetail group = new GroupDetail();\r\n\t\tAirplaneModel ap = new AirplaneModel();\r\n\t\tAirplaneModel ap1= new AirplaneModel(12L);\r\n\t\tUserPrivilegesModel userPrivileges = new UserPrivilegesModel();\r\n\t\tList<AirplaneModel> list = new ArrayList<AirplaneModel>();\r\n\t\tList<AirplaneModel> list1 = new ArrayList<AirplaneModel>();\r\n\t\tlist.add(ap1);\r\n\t\tsuperUserMap.put(group,list);\r\n\t\tuserPrivileges.setSuperUserMap(superUserMap);\r\n\t\tboolean result = fixture.isGroupValid(group, userPrivileges);\r\n\t\tassertTrue(result);\r\n\t}","title":""},{"docid":"bb42f4ecac7230b7503557ed572f8e28","score":"0.5039094","text":"public void test_hasGroupTrue() {\n Group group1 = new GroupBuilder().build();\n mDatabaseManager.create(group1);\n assertTrue(mDatabaseManager.queryHasGroup());\n }","title":""},{"docid":"ddd7cd1e03bc38a7ee7cee65fc2b6148","score":"0.50252295","text":"public boolean moveGroup(Collection<GameObject> group, Vector2D.Direction direction) {\n List<GameObject> movers = new ArrayList<>();\n for (GameObject obj : group) {\n if (obj.canMove()) {\n movers.add(obj);\n }\n }\n\n for (GameObject obj : movers) {\n Vector2D movePoint = obj.getLocation().getPointInDirection(direction);\n if (!isPointValid(movePoint, movers)) {\n return false;\n }\n }\n\n for (GameObject obj : movers) {\n filledPositions.remove(obj.getLocation());\n }\n for (GameObject obj : movers) {\n obj.setLocation(obj.getLocation().getPointInDirection(direction));\n filledPositions.put(obj.getLocation(), obj);\n\n obj.setMove(false);\n }\n return true;\n }","title":""},{"docid":"17670ee92276d1e83e2dc70ec037e8a7","score":"0.50088805","text":"public boolean isSetGroup()\r\n {\r\n synchronized (monitor())\r\n {\r\n check_orphaned();\r\n return get_store().find_attribute_user(GROUP$12) != null;\r\n }\r\n }","title":""},{"docid":"c08dd9184ac0f8218d1d5d6453d4d699","score":"0.50032616","text":"@Test\n public void remoteProcessGroupsTest() {\n // TODO: test remoteProcessGroups\n }","title":""},{"docid":"17cb2490bb033d660061feb50c4debef","score":"0.49860543","text":"public boolean insertGroup(Group group) {\n\t\ttry (Connection con = getConnection();\n\t\t\t\tPreparedStatement pstmt = con.prepareStatement(SQL_INSERT_GROUP, Statement.RETURN_GENERATED_KEYS)) {\n\t\t\tpstmt.setString(1, group.getName());\n\t\t\tResultSet resultSet;\n\t\t\tif (pstmt.executeUpdate() > 0) {\n\t\t\t\tresultSet = pstmt.getGeneratedKeys();\n\t\t\t\tif (resultSet.next()) {\n\t\t\t\t\tgroup.setId(resultSet.getInt(1));\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t} catch (SQLException e) {\n\t\t\tSystem.err.println(e.getLocalizedMessage());\n\t\t}\n\t\treturn false;\n\n\t}","title":""},{"docid":"4485cb0f46a2f12f8bd7685595b8388a","score":"0.49823922","text":"@Test\n public void update() throws Exception {\n Group group = new Group();\n group.setNumber(POIT_12);\n\n mockMvc.perform(put(GROUPS_ID, 2)\n .header(ACCEPT_LANGUAGE, EN)\n .param(CURATOR_ID, \"2\")\n .param(TEACHER_ID_LIST, \"3\")\n .contentType(APPLICATION_JSON_CHARSET_UTF_8)\n .content(json(group))\n )\n .andExpect(status().isOk())\n .andExpect(content().contentType(APPLICATION_JSON_CHARSET_UTF_8))\n .andExpect(jsonPath($_ID, is(2)))\n .andExpect(jsonPath($_NUMBER, is(POIT_12)));\n }","title":""},{"docid":"194ca6ef08759efb9659e961e07f7581","score":"0.4980102","text":"@Test\n public void testDeleteGroupOK() throws Exception {\n final Long gid1=1L, member1Id = 1L;\n\n Member member1 = Member.builder().memberId(member1Id).name(group2Member1Name).rating(group2Member1Rating).build();\n List<Member> members = new ArrayList<Member>();\n members.add(member1);\n \n Groups group1 = Groups.builder().gid(gid1).groupName(group1Name).members(members).attr1(attr1).build();\n memberRepository.save(member1);\n \n groupsRepository.save(group1);\n final String baseUrl = urlPrefix + \"/group/\"+groupsRepository.findGroupsByGroupName(group1Name).get().get(0).getGid();\n //when delete the group\n RequestEntity<Void> request = RequestEntity.delete(new URI(baseUrl)).build();\n ResponseEntity<Void> response = testTemplate.exchange(request, Void.class);\n //verify the result\n assertEquals(HttpStatus.NO_CONTENT, response.getStatusCode());\n\n assertFalse(groupsRepository.findGroupsByGroupName(group1Name).isPresent());\n }","title":""},{"docid":"3e760a5400626fa45c13d6ebf21ac187","score":"0.49606124","text":"public ValidationResult validatePapRest(boolean updateGroupFlow) {\n var result = new BeanValidationResult(\"group\", this);\n\n result.validateNotNull(\"pdpType\", pdpType);\n // When doing PdpGroup Update operation, supported policy types and policies doesn't have to be validated.\n if (!updateGroupFlow) {\n result.validateNotNullList(\"policies\", policies, ToscaConceptIdentifier::validatePapRest);\n result.validateNotNullList(\"supportedPolicyTypes\", supportedPolicyTypes,\n ToscaConceptIdentifier::validatePapRest);\n\n if (supportedPolicyTypes != null && supportedPolicyTypes.isEmpty()) {\n result.addResult(\"supportedPolicyTypes\", supportedPolicyTypes, ValidationStatus.INVALID, \"empty list\");\n }\n }\n\n if (desiredInstanceCount <= 0) {\n result.addResult(\"desiredInstanceCount\", desiredInstanceCount, ValidationStatus.INVALID, \"non-positive\");\n }\n\n return result;\n }","title":""},{"docid":"47944987352b6a3594f643e566d1f46a","score":"0.495737","text":"int updateByPrimaryKey(Group record);","title":""},{"docid":"47944987352b6a3594f643e566d1f46a","score":"0.495737","text":"int updateByPrimaryKey(Group record);","title":""},{"docid":"ae2cd9ec1830d6c8fbfef5b7534b6c8f","score":"0.49429184","text":"public void setGroup(Group group) {\n this.group = group;\n }","title":""},{"docid":"ab82e3d1244a2d92cf930ca6c02821ac","score":"0.4942836","text":"private void assertCommandSuccess(String cmd, Group grp) {\n Model expectedModel = prepModel(grp, true);\n\n String expectedResultMessage = getSb(grp.getGrpName(), grp.getPersonList());\n\n assertCommandSuccess(cmd, expectedModel, expectedResultMessage);\n }","title":""},{"docid":"468d3bbdc4f9671ab36a9a93265c08df","score":"0.4933923","text":"boolean deepContains(IGroupMember gm) throws GroupsException;","title":""},{"docid":"0f2eb9e92763ee4bfe3d8ef9cd97758f","score":"0.49171147","text":"public void test_isMember() {\r\n\t\tAllUsersGroup group;\r\n\r\n\t\tgroup = AllUsersGroup.getInstance();\r\n\r\n\t\tassertTrue(\"Should be member\", group.isMember(new CanonicalUser(\"id\")));\r\n\t}","title":""},{"docid":"2e1c4ca9ca228dcf7e2e5d5bb7c1d4a7","score":"0.4915625","text":"public boolean groupExists(){\n\t\t\n\t\treturn false;\n\t}","title":""},{"docid":"165f84333155f9740a645611110a0a11","score":"0.491474","text":"@Test // USERGRID-1729\n public void updateGroupWithSameNameAsApp() throws IOException {\n String groupId = null;\n String groupPath = context.getAppName();\n try {\n Map<String, Object> groupMap = new HashMap<String, Object>();\n groupMap.put( \"title\", \"Old Title\" );\n groupMap.put( \"path\", groupPath );\n String path = context.getOrgName() + \"/\" + context.getAppName() + \"/groups\";\n JsonNode groupJson = webResourceBuilder( path ).post( JsonNode.class, groupMap );\n groupId = groupJson.get( \"entities\" ).get( 0 ).get( \"uuid\" ).getTextValue();\n }\n catch ( UniformInterfaceException e ) {\n fail( \"Error creating group: \" + IOUtils.toString( e.getResponse().getEntityInputStream() ) );\n }\n\n assertTitle( groupId, \"Old Title\" );\n\n // update that group by giving it a new title and using group path in URL\n try {\n Map<String, Object> group = new HashMap<String, Object>();\n group.put( \"title\", \"New Title\" );\n String path = context.getOrgName() + \"/\" + context.getAppName() + \"/groups/\" + groupPath;\n webResourceBuilder( path ).put( JsonNode.class, group );\n }\n catch ( UniformInterfaceException e ) {\n fail( \"Error updating group: \" + IOUtils.toString( e.getResponse().getEntityInputStream() ) );\n }\n\n assertTitle( groupId, \"New Title\" );\n\n // update that group by giving it a new title and using UUID in URL\n try {\n Map<String, Object> group = new HashMap<String, Object>();\n group.put( \"title\", \"Even Newer Title\" );\n String path = context.getOrgName() + \"/\" + context.getAppName() + \"/groups/\" + groupId;\n webResourceBuilder( path ).put( JsonNode.class, group );\n }\n catch ( UniformInterfaceException e ) {\n fail( \"Error updating group: \" + IOUtils.toString( e.getResponse().getEntityInputStream() ) );\n }\n\n assertTitle( groupId, \"Even Newer Title\" );\n }","title":""},{"docid":"a75c4a9bd3eb9b9b7d3cee746ed31126","score":"0.49099272","text":"private boolean checkGroup(StudyGroup studyGroup) {\n ArrayList<Participant> participants = studyGroup.getParticipants();\n if (participants != null) {\n for (int i = 0; i < participants.size(); i++) {\n Participant p = participants.get(i);\n String uid = p.getUid();\n if (uid.equals(mUID)) return false;\n }\n }\n\n // check if group is empty\n if (studyGroup.getParticipantCount() == 0) {\n return false;\n }\n\n // check if group is not full yet\n if (studyGroup.getParticipantCount() >= studyGroup.getParticipantsMax()) {\n return false;\n }\n\n // check if end date is still in the future\n String dateTo = studyGroup.getDateTo();\n final Calendar c = Calendar.getInstance();\n int year = c.get(Calendar.YEAR);\n int month = c.get(Calendar.MONTH);\n int day = c.get(Calendar.DAY_OF_MONTH);\n String dateCurrent = String.format(Locale.ENGLISH, \"%d-%02d-%02d\", year, month + 1, day);\n int comparison = dateTo.compareTo(dateCurrent);\n if (comparison >= 0) {\n return true;\n } else {\n return false;\n }\n }","title":""},{"docid":"5a08c0184a9dec7804f89700f7f6b8f0","score":"0.49098653","text":"protected abstract void setGroup(Group group);","title":""},{"docid":"f31a08c3d6efea0e5b09ff5909f47c09","score":"0.48954865","text":"public interface Group {\n\t\n\t/**\n\t * Returns the group leader's id.\n\t * @return The group leader id\n\t * @throws CoordinationException\n\t */\n\tpublic String getLeaderId() throws CoordinationException;\n\t\n\t/**\n\t * Returns my member id.\n\t * @return Current node's member id\n\t * @throws CoordinationException\n\t */\n\tpublic String getMemberId();\n\t\n\t/**\n\t * Returns ids of all the members in the group.\n\t * @return Group member ids.\n * @throws CoordinationException \n\t */\n\tpublic List<String> getMemberIds() throws CoordinationException;\n\t\n\t/**\n\t * Returns the current group id.\n\t * @return group id\n\t */\n\tpublic String getGroupId();\n\t\n\t/**\n\t * Broadcasts a message to all the members in the group.\n\t * @param data The data to be broadcasted\n\t * @throws CoordinationException\n\t */\n\tpublic void broadcast(byte[] data) throws CoordinationException;\n\t\n\t/**\n\t * Send and receives message to/from a peer in the group.\n\t * @param memberId The member id of the peer the call should be made to\n\t * @param data The data to be sent to the peer\n\t * @throws CoordinationException If a communication error or a processing error\n\t * occurs in the target \n\t */\n\tpublic byte[] sendReceive(String memberId, byte[] data) throws CoordinationException;\n\t\n\t/**\n\t * Leave the group.\n\t * @throws CoordinationException\n\t */\n\tpublic void leave() throws CoordinationException;\n\t\n\t/**\n\t * Set a group event listener to this group, to receive group notifications.\n\t * @param listener The GroupEventListener implementation\n\t * @see GroupEventListener\n\t */\n\tpublic void setGroupEventListener(GroupEventListener listener);\n\t\n\t/**\n\t * Returns the registered group event listener.\n\t * @return group event listener\n\t */\n\tpublic GroupEventListener getGroupEventListener();\n\t\n\t/**\n\t * Clears all group messages that are stored.\n\t * @throws CoordinationException \n\t */\n\tpublic void clearGroupMessages() throws CoordinationException;\n\t\n\t/**\n\t * Waits for a specific number of members are arrived in the group.\n\t * @param count The number of members\n\t * @throws CoordinationException\n\t */\n\tpublic void waitForMemberCount(int count) throws CoordinationException;\n\t\n}","title":""},{"docid":"8dd7389b274a264624cc51b17d7bdae0","score":"0.4890794","text":"public void setGroup(boolean group) {\n this.group = group;\n }","title":""},{"docid":"a4da7270580ceb852c81fe6b98642f3f","score":"0.48894155","text":"default @NonNull Task<Void> updateGroupAsync(@NonNull PermissionGroup permissionGroup) {\n return Task.supply(() -> this.updateGroup(permissionGroup));\n }","title":""},{"docid":"9c9bda08f44d103f3fa2848722961996","score":"0.48883167","text":"protected void validateGroups(Object resultObject, int total, String orderBy, int start, int count, int[] groups, String[] roles) {\n assertNotNull(resultObject);\n assertTrue(resultObject.getClass().toString(), resultObject instanceof VootGetGroupsResponse);\n \n VootGetGroupsResponse vootGetGroupsResponse = (VootGetGroupsResponse) resultObject;\n assertEquals(start, vootGetGroupsResponse.getStartIndex().intValue());\n assertEquals(count, vootGetGroupsResponse.getItemsPerPage().intValue());\n assertEquals(total, vootGetGroupsResponse.getTotalResults().intValue());\n assertEquals(count, GrouperUtil.length(vootGetGroupsResponse.getEntry()));\n \n if (groups == null) {\n assertNull(vootGetGroupsResponse.getEntry());\n }\n else {\n assertNotNull(vootGetGroupsResponse.getEntry());\n \n // Check if all groups are present in the response, without considering their order\n int groupCount = 0;\n @SuppressWarnings(\"unchecked\")\n List<VootGroup> groupsList = Arrays.asList(vootGetGroupsResponse.getEntry());\n for (int i = 0; i < total; ++i) {\n VootGroup vootGroup = new VootGroup();\n vootGroup.setId(GROUP_NAMES[groups[i]]);\n vootGroup.setName(GROUP_NAMES[groups[i]]);\n vootGroup.setDescription(GROUP_DESCRIPTIONS[groups[i]]);\n vootGroup.setVoot_membership_role(roles[i]);\n \n if (groupsList.contains(vootGroup)) groupCount++;\n }\n \n assertEquals(count, groupCount);\n \n // Check if all groups are present in the response, also considering their order\n if (orderBy != null) {\n try {\n // Set up introspection for the field specified by orderBy\n Field f = VootGroup.class.getDeclaredField(orderBy);\n f.setAccessible(true);\n \n // Verify sorting\n for (int i = 0; i < total-1; ++i) {\n String value1 = f.get(vootGetGroupsResponse.getEntry()[i]).toString();\n String value2 = f.get(vootGetGroupsResponse.getEntry()[i+1]).toString();\n \n assertTrue(value1.compareTo(value2) <= 0);\n }\n }\n catch (Exception e) {\n assertTrue(\"Exception in checking sort\", false);\n }\n }\n }\n }","title":""},{"docid":"d4b6fa305f9e0f1c1d70774fd80e450e","score":"0.48800254","text":"int updateByExampleSelective(@Param(\"record\") VUserGroup record, @Param(\"example\") VUserGroupExample example);","title":""},{"docid":"6d772384eecec957ae2c50a4115063be","score":"0.4875348","text":"boolean isEditable() throws GroupsException;","title":""},{"docid":"5c617c133d6296f4c10dae2f03171c2c","score":"0.48748112","text":"boolean hasGroupId();","title":""},{"docid":"5c617c133d6296f4c10dae2f03171c2c","score":"0.48748112","text":"boolean hasGroupId();","title":""},{"docid":"5c617c133d6296f4c10dae2f03171c2c","score":"0.48748112","text":"boolean hasGroupId();","title":""},{"docid":"5c617c133d6296f4c10dae2f03171c2c","score":"0.48748112","text":"boolean hasGroupId();","title":""},{"docid":"5c617c133d6296f4c10dae2f03171c2c","score":"0.48748112","text":"boolean hasGroupId();","title":""},{"docid":"5c617c133d6296f4c10dae2f03171c2c","score":"0.48748112","text":"boolean hasGroupId();","title":""},{"docid":"5c617c133d6296f4c10dae2f03171c2c","score":"0.48748112","text":"boolean hasGroupId();","title":""},{"docid":"5c617c133d6296f4c10dae2f03171c2c","score":"0.48748112","text":"boolean hasGroupId();","title":""},{"docid":"5c617c133d6296f4c10dae2f03171c2c","score":"0.48748112","text":"boolean hasGroupId();","title":""},{"docid":"5c617c133d6296f4c10dae2f03171c2c","score":"0.48748112","text":"boolean hasGroupId();","title":""},{"docid":"5c617c133d6296f4c10dae2f03171c2c","score":"0.48748112","text":"boolean hasGroupId();","title":""},{"docid":"5c617c133d6296f4c10dae2f03171c2c","score":"0.48748112","text":"boolean hasGroupId();","title":""},{"docid":"5c617c133d6296f4c10dae2f03171c2c","score":"0.48748112","text":"boolean hasGroupId();","title":""},{"docid":"5c617c133d6296f4c10dae2f03171c2c","score":"0.48748112","text":"boolean hasGroupId();","title":""},{"docid":"5c617c133d6296f4c10dae2f03171c2c","score":"0.48748112","text":"boolean hasGroupId();","title":""},{"docid":"5c617c133d6296f4c10dae2f03171c2c","score":"0.48748112","text":"boolean hasGroupId();","title":""},{"docid":"5c617c133d6296f4c10dae2f03171c2c","score":"0.48748112","text":"boolean hasGroupId();","title":""},{"docid":"5c617c133d6296f4c10dae2f03171c2c","score":"0.48748112","text":"boolean hasGroupId();","title":""},{"docid":"5c617c133d6296f4c10dae2f03171c2c","score":"0.48748112","text":"boolean hasGroupId();","title":""},{"docid":"5c617c133d6296f4c10dae2f03171c2c","score":"0.48748112","text":"boolean hasGroupId();","title":""},{"docid":"5c617c133d6296f4c10dae2f03171c2c","score":"0.48748112","text":"boolean hasGroupId();","title":""},{"docid":"5c617c133d6296f4c10dae2f03171c2c","score":"0.48748112","text":"boolean hasGroupId();","title":""},{"docid":"5c617c133d6296f4c10dae2f03171c2c","score":"0.48748112","text":"boolean hasGroupId();","title":""},{"docid":"5c617c133d6296f4c10dae2f03171c2c","score":"0.48748112","text":"boolean hasGroupId();","title":""},{"docid":"5c617c133d6296f4c10dae2f03171c2c","score":"0.48748112","text":"boolean hasGroupId();","title":""},{"docid":"5c617c133d6296f4c10dae2f03171c2c","score":"0.48748112","text":"boolean hasGroupId();","title":""},{"docid":"0233d16bf9f7b8d7914e58132eb0c876","score":"0.48725238","text":"public static void update(GroupPermission groupPermission, GroupPermission oldGroupPermission) throws Exception {\n String command = \"\";\n if (groupPermission.NewerDate != oldGroupPermission.NewerDate)\n {\n if (!StringSupport.equals(command, \"\"))\n {\n command += \",\";\n }\n \n command += \"NewerDate = \" + POut.date(groupPermission.NewerDate) + \"\";\n }\n \n if (groupPermission.NewerDays != oldGroupPermission.NewerDays)\n {\n if (!StringSupport.equals(command, \"\"))\n {\n command += \",\";\n }\n \n command += \"NewerDays = \" + POut.int(groupPermission.NewerDays) + \"\";\n }\n \n if (groupPermission.UserGroupNum != oldGroupPermission.UserGroupNum)\n {\n if (!StringSupport.equals(command, \"\"))\n {\n command += \",\";\n }\n \n command += \"UserGroupNum = \" + POut.long(groupPermission.UserGroupNum) + \"\";\n }\n \n if (groupPermission.PermType != oldGroupPermission.PermType)\n {\n if (!StringSupport.equals(command, \"\"))\n {\n command += \",\";\n }\n \n command += \"PermType = \" + POut.int(((Enum)groupPermission.PermType).ordinal()) + \"\";\n }\n \n if (StringSupport.equals(command, \"\"))\n {\n return ;\n }\n \n command = \"UPDATE grouppermission SET \" + command + \" WHERE GroupPermNum = \" + POut.long(groupPermission.GroupPermNum);\n Db.nonQ(command);\n }","title":""},{"docid":"d91cad2e427f2fe849b2bcf059df0bcd","score":"0.48663995","text":"public void sendRemote(GroupMessage msg) {\n }","title":""},{"docid":"47a3056aa57ff90b324858efe9103993","score":"0.48660064","text":"boolean hasGroup();","title":""},{"docid":"47a3056aa57ff90b324858efe9103993","score":"0.48660064","text":"boolean hasGroup();","title":""},{"docid":"47a3056aa57ff90b324858efe9103993","score":"0.48660064","text":"boolean hasGroup();","title":""},{"docid":"1a69ff0bc53beb8767843c7a59e99b37","score":"0.48619863","text":"@Test\n public void testGetForVdsGroup() {\n storage_pool result = dao.getForVdsGroup(vdsGroup);\n\n assertNotNull(result);\n }","title":""}],"string":"[\n {\n \"docid\": \"89fe4fa842f8392aeb8601820bf064e4\",\n \"score\": \"0.6278116\",\n \"text\": \"private boolean updateGroup(int id) {\\r\\n\\t\\tGroup group = new Group();\\r\\n\\t\\tgroup.setID(id);\\r\\n\\t\\tgroup.setDescription(\\\"Updated Group\\\");\\r\\n\\t\\tgroup.setName(\\\"Update Test\\\");\\r\\n\\t\\treturn requester.updateObject(group);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"27f9b69e18f57a55b84010b5230736ea\",\n \"score\": \"0.62176704\",\n \"text\": \"private RemoteProcessGroup updateRemoteProcessGroup(RemoteProcessGroup remoteProcessGroup, RemoteProcessGroupDTO remoteProcessGroupDTO) {\\n verifyUpdate(remoteProcessGroup, remoteProcessGroupDTO);\\n\\n // configure the remote process group\\n final String targetUris = remoteProcessGroupDTO.getTargetUris();\\n final String name = remoteProcessGroupDTO.getName();\\n final String comments = remoteProcessGroupDTO.getComments();\\n final String communicationsTimeout = remoteProcessGroupDTO.getCommunicationsTimeout();\\n final String yieldDuration = remoteProcessGroupDTO.getYieldDuration();\\n final String proxyHost = remoteProcessGroupDTO.getProxyHost();\\n final Integer proxyPort = remoteProcessGroupDTO.getProxyPort();\\n final String proxyUser = remoteProcessGroupDTO.getProxyUser();\\n final String proxyPassword = remoteProcessGroupDTO.getProxyPassword();\\n\\n final String transportProtocol = remoteProcessGroupDTO.getTransportProtocol();\\n final String localNetworkInterface = remoteProcessGroupDTO.getLocalNetworkInterface();\\n\\n if (isNotNull(targetUris)) {\\n remoteProcessGroup.setTargetUris(targetUris);\\n }\\n if (isNotNull(name)) {\\n remoteProcessGroup.setName(name);\\n }\\n if (isNotNull(comments)) {\\n remoteProcessGroup.setComments(comments);\\n }\\n if (isNotNull(communicationsTimeout)) {\\n remoteProcessGroup.setCommunicationsTimeout(communicationsTimeout);\\n }\\n if (isNotNull(yieldDuration)) {\\n remoteProcessGroup.setYieldDuration(yieldDuration);\\n }\\n if (isNotNull(remoteProcessGroupDTO.getPosition())) {\\n remoteProcessGroup.setPosition(new Position(remoteProcessGroupDTO.getPosition().getX(), remoteProcessGroupDTO.getPosition().getY()));\\n }\\n if (isNotNull(transportProtocol)) {\\n remoteProcessGroup.setTransportProtocol(SiteToSiteTransportProtocol.valueOf(transportProtocol.toUpperCase()));\\n // No null check because these proxy settings have to be clear if not specified.\\n // But when user Enable/Disable transmission, only isTransmitting is sent.\\n // To prevent clearing these values in that case, set these only if transportProtocol is sent,\\n // assuming UI sends transportProtocol always for update.\\n remoteProcessGroup.setProxyHost(proxyHost);\\n remoteProcessGroup.setProxyPort(proxyPort);\\n remoteProcessGroup.setProxyUser(proxyUser);\\n // Keep using current password when null or \\\"********\\\" was sent.\\n // Passing other values updates the password,\\n // specify empty String to clear password.\\n if (isNotNull(proxyPassword) && !DtoFactory.SENSITIVE_VALUE_MASK.equals(proxyPassword)) {\\n remoteProcessGroup.setProxyPassword(proxyPassword);\\n }\\n }\\n if (localNetworkInterface != null) {\\n if (StringUtils.isBlank(localNetworkInterface)) {\\n remoteProcessGroup.setNetworkInterface(null);\\n } else {\\n remoteProcessGroup.setNetworkInterface(localNetworkInterface);\\n }\\n }\\n\\n final Boolean isTransmitting = remoteProcessGroupDTO.isTransmitting();\\n if (isNotNull(isTransmitting)) {\\n // start or stop as necessary\\n if (!remoteProcessGroup.isConfiguredToTransmit() && isTransmitting) {\\n remoteProcessGroup.startTransmitting();\\n } else if (remoteProcessGroup.isConfiguredToTransmit() && !isTransmitting) {\\n remoteProcessGroup.stopTransmitting();\\n }\\n }\\n\\n final ProcessGroup group = remoteProcessGroup.getProcessGroup();\\n if (group != null) {\\n group.onComponentModified();\\n }\\n return remoteProcessGroup;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5ef5d898a38c8198e38e6cf2dd7c622e\",\n \"score\": \"0.6134846\",\n \"text\": \"public boolean updateGroup(MemberGroup group) {\\n\\t\\tif (group == null) throw new IllegalParameterException(new String[]{\\\"group\\\"}, new Object[]{group});\\n\\n\\t\\t// save group\\n\\t\\tmemberGroupDAO.persist(group);\\n\\t\\tlogger.info(\\\"updateGroup: New Member Group(\\\" + group.getId() + \\\") updated\\\");\\n\\n\\t\\treturn true;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"514a52c57c1d321ee151611ad6ce2af1\",\n \"score\": \"0.6079206\",\n \"text\": \"@Override\\n\\tpublic boolean updateGroup(ProductGroup productGroup) {\\n\\t\\treturn false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"da5bab5b691aaef1e46be2bb35405d88\",\n \"score\": \"0.6077985\",\n \"text\": \"UpdateGroupResult updateGroup(UpdateGroupRequest updateGroupRequest);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bde6b2df4ed9009032781b009692a1b0\",\n \"score\": \"0.6074299\",\n \"text\": \"private void verifyUpdatePort(RemoteGroupPort port, RemoteProcessGroupPortDTO remoteProcessGroupPortDto) {\\n // see if the remote process group can start/stop transmitting\\n if (isNotNull(remoteProcessGroupPortDto.isTransmitting())) {\\n if (!port.isRunning() && remoteProcessGroupPortDto.isTransmitting()) {\\n port.verifyCanStart();\\n } else if (port.isRunning() && !remoteProcessGroupPortDto.isTransmitting()) {\\n port.verifyCanStop();\\n }\\n }\\n\\n // validate the proposed configuration\\n final List<String> requestValidation = validateProposedRemoteProcessGroupPortConfiguration(port, remoteProcessGroupPortDto);\\n // ensure there was no validation errors\\n if (!requestValidation.isEmpty()) {\\n throw new ValidationException(requestValidation);\\n }\\n\\n\\n // verify update when appropriate\\n if (isAnyNotNull(remoteProcessGroupPortDto.getConcurrentlySchedulableTaskCount(),\\n remoteProcessGroupPortDto.getUseCompression(),\\n remoteProcessGroupPortDto.getBatchSettings())) {\\n port.verifyCanUpdate();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8721e4b8ea240e538917319f0eb50615\",\n \"score\": \"0.5949514\",\n \"text\": \"private void updateGroupStatus(List<GroupInfo> groups, LdapUserGroup group, LdapUserGroupModel groupModel,\\n int groupIndex) {\\n if (groupIndex != -1) {\\n GroupInfo groupInfo = groups.get(groupIndex);\\n String realmAttributes = groupInfo.getRealmAttributes();\\n String dn = getDnFromRealmAttributes(realmAttributes);\\n if (!dn.equals(group.getGroupDn())) {\\n groupModel.setRequiredUpdate(LdapUserGroup.Status.REQUIRES_UPDATE);\\n } else {\\n groupModel.setRequiredUpdate(LdapUserGroup.Status.IN_ARTIFACTORY);\\n }\\n } else {\\n groupModel.setRequiredUpdate(LdapUserGroup.Status.DOES_NOT_EXIST);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"49c66495fd75493bae76cac28be9b93a\",\n \"score\": \"0.59004575\",\n \"text\": \"@Test\\n public void testUpdateGroupOK() throws Exception {\\n final Long gid1=2L, member1Id = 1L;\\n \\n Member member1 = Member.builder().memberId(member1Id).name(group2Member1Name).rating(group2Member1Rating).build();\\n List<Member> members = new ArrayList<Member>();\\n members.add(member1);\\n Groups group1 = Groups.builder().gid(gid1).groupName(group1Name).members(members).attr1(attr1).build();\\n \\n memberRepository.save(member1);\\n groupsRepository.save(group1);\\n\\n //when updates with pu\\n members.remove(member1);\\n Member updatedMember = Member.builder().memberId(member1Id).name(group2Member1Name).rating(updatedRating).build();\\n members.add(updatedMember);\\n Groups modifiedGroups = Groups.builder().gid(gid1).groupName(updatedGroup2Name).attr1(updatedAttr1).attr2(attr2).members(members).build();\\n \\n final String baseUrl = BASE_URL_ROOT+serverPort+\\\"/wrest/group/\\\"+groupsRepository.findGroupsByGroupName(group1Name).get().get(0).getGid();\\n \\n HttpEntity<Groups> request = new HttpEntity<>(modifiedGroups);\\n ResponseEntity<String> response = this.testTemplate.exchange(baseUrl, HttpMethod.PUT, request, String.class);\\n \\n //verify tehe updates\\n assertEquals(HttpStatus.ACCEPTED, response.getStatusCode());\\n assertTrue(response.getBody().contains(group2Member1Name));\\n assertTrue(response.getBody().contains(String.valueOf(updatedRating)));\\n assertTrue(response.getBody().contains(updatedGroup2Name));\\n assertFalse(response.getBody().contains(group1Name));\\n assertTrue(response.getBody().contains(String.valueOf(group2Member1Rating)));\\n //assertEquals(JsonUtil.asJsonString(modifiedGroups), result.getBody());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a519beedbb86993ec464156a3874189c\",\n \"score\": \"0.57351595\",\n \"text\": \"void update() throws GroupsException;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"054802606421cb343008678bca7f2d85\",\n \"score\": \"0.5733872\",\n \"text\": \"int update(GroupAccount groupNo) throws Exception;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"62278c5ec9b70de2a7a5b9fc10c62e43\",\n \"score\": \"0.5720774\",\n \"text\": \"public boolean belongGroup(MsnGroup group);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bd827bdc39790a5291f6320d776e95d8\",\n \"score\": \"0.56505823\",\n \"text\": \"public int update(Group group) {\\n\\t\\treturn groupDao.update(group);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"edecde4879047508cc465053d4f5fe79\",\n \"score\": \"0.55560416\",\n \"text\": \"default void updateGroup(\\n com.google.cloud.migrationcenter.v1.UpdateGroupRequest request,\\n io.grpc.stub.StreamObserver<com.google.longrunning.Operation> responseObserver) {\\n io.grpc.stub.ServerCalls.asyncUnimplementedUnaryCall(\\n getUpdateGroupMethod(), responseObserver);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"751997617f643ec5704a12d3982cd811\",\n \"score\": \"0.5533695\",\n \"text\": \"public String updateMetricGroup(MetricGroup group) throws RdkTimeoutException {\\n reauthenticate();\\n logger.log(Level.INFO, \\\"PUT \\\" + metricsServiceUrl + \\\"/groups/\\\" + group.get_id());\\n logger.log(Level.INFO, gson.toJson(group));\\n WebTarget dashboardsTarget = metricsServiceTarget.path(\\\"groups/\\\" + group.get_id());\\n Response response = dashboardsTarget.request().cookie(rdkCookies.get(RDK_COOKIE_ID)).accept(MediaType.TEXT_PLAIN)\\n \\t\\t.header(\\\"Authorization\\\", \\\"Bearer \\\" + jwtHeader).put(Entity.entity(group, MediaType.APPLICATION_JSON));\\n processResponse(response);\\n MetricsServiceResponse<GenericResult> id = response.readEntity(new GenericType<MetricsServiceResponse<GenericResult>>() {\\n });\\n logger.log(Level.INFO, \\\"updateMetricGroupResponse: \\\\n\\\" + gson.toJson(id));\\n return id.getData().getResult();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f8529cac48b5ff7fd338ce3d97b61f20\",\n \"score\": \"0.55242383\",\n \"text\": \"@Override\\n public boolean isInGroup(String group)\\n {\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"436cb449ed390bcb38796fa7e3f280c5\",\n \"score\": \"0.5510213\",\n \"text\": \"@Override\\r\\n\\tpublic boolean doUpdate(Groups vo) throws Exception {\\n\\t\\treturn false;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3425bef875dc64d8537495a20b09245e\",\n \"score\": \"0.54248005\",\n \"text\": \"protected abstract boolean groupCheck();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"57c4d5a66cbdd1e45795102afacc5da3\",\n \"score\": \"0.5423194\",\n \"text\": \"int update(Dues groupNo) throws Exception;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7f0e067f0427c89af80fdfa9de012ecf\",\n \"score\": \"0.5413388\",\n \"text\": \"public void test_updateAllAssignmentsInGroup() {\\n Group group1 = new GroupBuilder().withName(\\\"g1\\\").build();\\n Group group2 = new GroupBuilder().withName(\\\"g2\\\").build();\\n mDatabaseManager.create(group1);\\n mDatabaseManager.create(group2);\\n\\n // Add some Members\\n Member m1 = new MemberBuilder().withName(\\\"m1\\\").build();\\n Member m2 = new MemberBuilder().withName(\\\"m2\\\").build();\\n Member m3 = new MemberBuilder().withName(\\\"m3\\\").build();\\n m1.setGroup(group1);\\n m2.setGroup(group1);\\n m3.setGroup(group1);\\n mDatabaseManager.create(m1);\\n mDatabaseManager.create(m2);\\n mDatabaseManager.create(m3);\\n\\n // Attempt with no Assignments\\n mDatabaseManager.updateAllAssignmentsInGroup(group1.getId(), Assignment.Status.Assigned);\\n\\n // Create the assignments\\n Assignment a1 = new Assignment();\\n a1.setGiverMember(m1);\\n a1.setReceiverMember(m2);\\n mDatabaseManager.create(a1);\\n\\n Assignment a2 = new Assignment();\\n a2.setGiverMember(m2);\\n a2.setReceiverMember(m3);\\n mDatabaseManager.create(a2);\\n\\n Assignment a3 = new Assignment();\\n a3.setGiverMember(m3);\\n a3.setReceiverMember(m1);\\n mDatabaseManager.create(a3);\\n\\n /*\\n * Create some Members and Assignments for Group2\\n * These Assignments should not be affected by the update on Group1\\n */\\n Member m1_2 = new MemberBuilder().withName(\\\"m1_2\\\").build();\\n Member m2_2 = new MemberBuilder().withName(\\\"m2_2\\\").build();\\n Member m3_2 = new MemberBuilder().withName(\\\"m3_2\\\").build();\\n m1_2.setGroup(group2);\\n m2_2.setGroup(group2);\\n m3_2.setGroup(group2);\\n mDatabaseManager.create(m1_2);\\n mDatabaseManager.create(m2_2);\\n mDatabaseManager.create(m3_2);\\n\\n // Create the assignments\\n Assignment a1_2 = new Assignment();\\n a1_2.setGiverMember(m1_2);\\n a1_2.setReceiverMember(m2_2);\\n mDatabaseManager.create(a1_2);\\n\\n Assignment a2_2 = new Assignment();\\n a2_2.setGiverMember(m2_2);\\n a2_2.setReceiverMember(m3_2);\\n mDatabaseManager.create(a2_2);\\n\\n Assignment a3_2 = new Assignment();\\n a3_2.setGiverMember(m3_2);\\n a3_2.setReceiverMember(m1_2);\\n mDatabaseManager.create(a3_2);\\n\\n // Verify initial Assignment state\\n assertEquals(Assignment.Status.Assigned, a1.getSendStatus());\\n assertEquals(Assignment.Status.Assigned, a2.getSendStatus());\\n assertEquals(Assignment.Status.Assigned, a3.getSendStatus());\\n\\n assertEquals(Assignment.Status.Assigned, a1_2.getSendStatus());\\n assertEquals(Assignment.Status.Assigned, a2_2.getSendStatus());\\n assertEquals(Assignment.Status.Assigned, a3_2.getSendStatus());\\n\\n // Update all the Assignments for Group1\\n mDatabaseManager.updateAllAssignmentsInGroup(group1.getId(), Assignment.Status.Sent);\\n\\n // Verify Assignment state updated for Group1\\n assertEquals(Assignment.Status.Sent, mDatabaseManager.queryById(a1.getId(), Assignment.class).getSendStatus());\\n assertEquals(Assignment.Status.Sent, mDatabaseManager.queryById(a2.getId(), Assignment.class).getSendStatus());\\n assertEquals(Assignment.Status.Sent, mDatabaseManager.queryById(a3.getId(), Assignment.class).getSendStatus());\\n\\n // Verify Assignment state NOT updated for Group2\\n assertEquals(Assignment.Status.Assigned, a1_2.getSendStatus());\\n assertEquals(Assignment.Status.Assigned, a2_2.getSendStatus());\\n assertEquals(Assignment.Status.Assigned, a3_2.getSendStatus());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3bd61187d5bb7d55d8417e4de009c9f6\",\n \"score\": \"0.54118013\",\n \"text\": \"public com.google.common.util.concurrent.ListenableFuture<com.google.longrunning.Operation>\\n updateGroup(com.google.cloud.migrationcenter.v1.UpdateGroupRequest request) {\\n return io.grpc.stub.ClientCalls.futureUnaryCall(\\n getChannel().newCall(getUpdateGroupMethod(), getCallOptions()), request);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f121a4ba6325fa50d9790880e95b16d3\",\n \"score\": \"0.5387682\",\n \"text\": \"void updateGroup(@NonNull PermissionGroup permissionGroup);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a08ff3dee4ac4b0cf3d7d9d8064df6c7\",\n \"score\": \"0.5371093\",\n \"text\": \"public void updateGroup(\\n com.google.cloud.migrationcenter.v1.UpdateGroupRequest request,\\n io.grpc.stub.StreamObserver<com.google.longrunning.Operation> responseObserver) {\\n io.grpc.stub.ClientCalls.asyncUnaryCall(\\n getChannel().newCall(getUpdateGroupMethod(), getCallOptions()),\\n request,\\n responseObserver);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f8c537e0153193e1a3787319182fa91\",\n \"score\": \"0.53547025\",\n \"text\": \"boolean canAddMember(String groupUid);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"886335c980a7b4c6c7e54a75dbb9790b\",\n \"score\": \"0.53297627\",\n \"text\": \"public void testUpdateGroupNotUniqueFails() {\\n\\n Group g1 = new GroupBuilder().withName(\\\"g1\\\").build();\\n Group g2 = new GroupBuilder().withName(\\\"g2\\\").build();\\n mDatabaseManager.create(g1);\\n mDatabaseManager.create(g2);\\n\\n // Now try to get it back (but doesn't exist)\\n try {\\n g2.setName(g1.getName());\\n mDatabaseManager.update(g2);\\n fail(\\\"Should have thrown SQLException - non unique Group name is not allowed\\\");\\n } catch(SQLException exp) {\\n assertTrue(true);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"540d5f9349f28178f277fe8fc2d53c8d\",\n \"score\": \"0.53134954\",\n \"text\": \"@Test\\n\\tpublic void whenCreateGroupWithSameNameThenReturnShouldBeTrue() {\\n\\t\\tassertTrue(manager.checkGroupExistence(\\\"TVD\\\"));\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c59830c94ae43ee3599691b2b28f2a6c\",\n \"score\": \"0.5293798\",\n \"text\": \"private boolean updateBPGroup(X_I_BP_GroupJP impBPGroup, MBPGroup updateBPGroup)\\r\\n\\t{\\r\\n\\t\\tModelValidationEngine.get().fireImportValidate(this, impBPGroup, updateBPGroup, ImportValidator.TIMING_BEFORE_IMPORT);\\r\\n\\r\\n\\t\\tupdateBPGroup.setAD_Org_ID(impBPGroup.getAD_Org_ID());\\r\\n\\r\\n\\t\\tif(!Util.isEmpty(impBPGroup.getName()))\\r\\n\\t\\t\\tupdateBPGroup.setName(impBPGroup.getName());\\r\\n\\r\\n\\t\\tif(!Util.isEmpty(impBPGroup.getDescription()))\\r\\n\\t\\t\\tupdateBPGroup.setDescription(impBPGroup.getDescription());\\r\\n\\r\\n\\t\\tupdateBPGroup.setIsDefault(impBPGroup.isDefault());\\r\\n\\t\\tupdateBPGroup.setIsConfidentialInfo(impBPGroup.isConfidentialInfo());\\r\\n\\r\\n\\t\\tif(impBPGroup.getAD_PrintColor_ID() > 0)\\r\\n\\t\\t\\tupdateBPGroup.setAD_PrintColor_ID(impBPGroup.getAD_PrintColor_ID());\\r\\n\\r\\n\\t\\tif(impBPGroup.getM_PriceList_ID() > 0)\\r\\n\\t\\t\\tupdateBPGroup.setM_PriceList_ID(impBPGroup.getM_PriceList_ID());\\r\\n\\r\\n\\t\\tif(impBPGroup.getPO_PriceList_ID() > 0)\\r\\n\\t\\t\\tupdateBPGroup.setPO_PriceList_ID(impBPGroup.getPO_PriceList_ID());\\r\\n\\r\\n\\t\\tif(impBPGroup.getM_DiscountSchema_ID() > 0)\\r\\n\\t\\t\\tupdateBPGroup.setM_DiscountSchema_ID(impBPGroup.getM_DiscountSchema_ID());\\r\\n\\r\\n\\t\\tif(impBPGroup.getPO_DiscountSchema_ID() > 0)\\r\\n\\t\\t\\tupdateBPGroup.setPO_DiscountSchema_ID(impBPGroup.getPO_DiscountSchema_ID());\\r\\n\\r\\n\\t\\tif(impBPGroup.getCreditWatchPercent() != null)\\r\\n\\t\\t\\tupdateBPGroup.setCreditWatchPercent(impBPGroup.getCreditWatchPercent());\\r\\n\\r\\n\\t\\tif(impBPGroup.getPriceMatchTolerance() != null)\\r\\n\\t\\t\\tupdateBPGroup.setPriceMatchTolerance(impBPGroup.getPriceMatchTolerance());\\r\\n\\r\\n\\t\\tif(impBPGroup.getC_Dunning_ID() > 0)\\r\\n\\t\\t\\tupdateBPGroup.setC_Dunning_ID(impBPGroup.getC_Dunning_ID());\\r\\n\\r\\n\\t\\tupdateBPGroup.setIsActive(impBPGroup.isI_IsActiveJP());\\r\\n\\r\\n\\r\\n\\t\\tModelValidationEngine.get().fireImportValidate(this, impBPGroup, updateBPGroup, ImportValidator.TIMING_AFTER_IMPORT);\\r\\n\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tupdateBPGroup.saveEx(get_TrxName());\\r\\n\\t\\t}catch (Exception e) {\\r\\n\\t\\t\\timpBPGroup.setI_ErrorMsg(Msg.getMsg(getCtx(),\\\"SaveError\\\") + Msg.getElement(getCtx(), \\\"C_BP_Group_ID\\\")+\\\" : \\\" + e.toString());\\r\\n\\t\\t\\timpBPGroup.setI_IsImported(false);\\r\\n\\t\\t\\timpBPGroup.setProcessed(false);\\r\\n\\t\\t\\timpBPGroup.saveEx(get_TrxName());\\r\\n\\t\\t\\treturn false;\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tif(!Util.isEmpty(impBPGroup.getJP_AcctSchema_Name()) && impBPGroup.getC_AcctSchema_ID() > 0)\\r\\n\\t\\t\\tsetBPGroupAcct(updateBPGroup, impBPGroup);\\r\\n\\r\\n\\t\\tif(Util.isEmpty(impBPGroup.getI_ErrorMsg()))\\r\\n\\t\\t{\\r\\n\\t\\t\\timpBPGroup.setI_ErrorMsg(Msg.getMsg(getCtx(), \\\"Update\\\"));\\r\\n\\t\\t}else {\\r\\n\\t\\t\\timpBPGroup.setI_ErrorMsg(Msg.getMsg(getCtx(), \\\"Update\\\") + \\\" & \\\" + impBPGroup.getI_ErrorMsg());\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\timpBPGroup.setI_IsImported(true);\\r\\n\\t\\timpBPGroup.setProcessed(true);\\r\\n\\t\\timpBPGroup.saveEx(get_TrxName());\\r\\n\\r\\n\\t\\treturn true;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dad7a406668661b6273bd2563c388ab\",\n \"score\": \"0.5284574\",\n \"text\": \"public boolean updateGroupData(final InterviewAssessMaster bean) {\\r\\n\\t\\tboolean result = false;\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tfinal Object[][] updateObj = new Object[1][5];\\r\\n\\t\\t\\tupdateObj[0][0] = bean.getGroupName();\\r\\n\\t\\t\\tupdateObj[0][1] = bean.getGroupDescription();\\r\\n\\t\\t\\tupdateObj[0][2] = bean.getGroupAbbreviation();\\r\\n\\t\\t\\tupdateObj[0][3] = bean.getIsGroupActive();\\r\\n\\t\\t\\tupdateObj[0][4] = bean.getGroupCode();\\r\\n\\t\\t\\tresult = this.getSqlModel().singleExecute(\\r\\n\\t\\t\\t\\t\\t\\t\\t\\\"UPDATE HRMS_REC_INTERVIEW_GROUP SET HRMS_REC_INTERVIEW_GROUP.GROUP_NAME = ?, HRMS_REC_INTERVIEW_GROUP.GROUP_DESCRIPTION = ?, HRMS_REC_INTERVIEW_GROUP.GROUP_ABBR = ?, HRMS_REC_INTERVIEW_GROUP.GROUP_IS_ACTIVE = ? WHERE HRMS_REC_INTERVIEW_GROUP.GROUP_ID = ? \\\",\\r\\n\\t\\t\\t\\t\\t\\t\\tupdateObj);\\r\\n\\t\\t} catch (final Exception e) {\\r\\n\\t\\t\\te.printStackTrace();\\r\\n\\t\\t}\\r\\n\\t\\treturn result;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e24cf3728e62b9b0bc2f097a5fb26cda\",\n \"score\": \"0.5280245\",\n \"text\": \"@Override\\n public Response updateGroup(int groupId, String groupName) {\\n log.info(\\\"Start execution of method updateGroup(int groupId,String groupName)\\\");\\n response.setStatus((byte) 0);\\n response.setMessage(MessageConstants.GROUP_UPDATE_NOT_SUCESSFULL);\\n Connection con = DBConnection.getConnection();\\n if (con != null) {\\n try {\\n PreparedStatement pstmt = con.prepareStatement(SQLConstants.QUERY_UPDATE_GROUP_DETAILS);\\n pstmt.setString(1, groupName);\\n pstmt.setString(2, FeeManagement.userName);\\n pstmt.setDate(3, new java.sql.Date(new java.util.Date().getTime()));\\n pstmt.setInt(4, groupId);\\n\\n int i = pstmt.executeUpdate();\\n\\n if (i != 0) {\\n\\n response.setStatus((byte) 1);\\n response.setMessage(MessageConstants.GROUP_UPDATE_SUCESSFULL);\\n\\n }\\n } catch (SQLException ex) {\\n log.info(MessageConstants.GROUP_UPDATE_NOT_SUCESSFULL);\\n log.error(ex.getMessage());\\n response.setMessage(MessageConstants.GROUP_UPDATE_NOT_SUCESSFULL);\\n }\\n\\n } else {\\n log.info(MessageConstants.CONNECTION_ERROR);\\n response.setMessage(MessageConstants.CONNECTION_ERROR);\\n }\\n log.info(\\\"End of method updateGroup(int groupId,String groupName)\\\");\\n return response;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8994cf740ef27a676f60d320ac5c6960\",\n \"score\": \"0.5217289\",\n \"text\": \"public com.google.longrunning.Operation updateGroup(\\n com.google.cloud.migrationcenter.v1.UpdateGroupRequest request) {\\n return io.grpc.stub.ClientCalls.blockingUnaryCall(\\n getChannel(), getUpdateGroupMethod(), getCallOptions(), request);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4030d0ae796f9befec9c5351baa0a182\",\n \"score\": \"0.5212039\",\n \"text\": \"int updateByPrimaryKeySelective(Group record);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5729e6bc32a0955f1408fd8dce560449\",\n \"score\": \"0.52080756\",\n \"text\": \"@Test\\r\\n\\tpublic void testIsGroupValid_2()\\r\\n\\t\\tthrows Exception {\\r\\n\\t\\tUserDetailService fixture = new UserDetailService();\\r\\n\\t\\tGroupDetail group = new GroupDetail();\\r\\n\\t\\tAirplaneModel ap = new AirplaneModel();\\r\\n\\t\\tAirplaneModel ap1= new AirplaneModel(12L);\\r\\n\\t\\tUserPrivilegesModel userPrivileges = new UserPrivilegesModel();\\r\\n\\t\\tList<AirplaneModel> list = new ArrayList<AirplaneModel>();\\r\\n\\t\\tList<AirplaneModel> list1 = new ArrayList<AirplaneModel>();\\r\\n\\t\\tlist.add(ap1);\\r\\n\\t\\tsuperUserMap.put(group,null);\\r\\n\\t\\tuserPrivileges.setSuperUserMap(superUserMap);\\r\\n\\t\\tboolean result = fixture.isGroupValid(group, userPrivileges);\\r\\n\\t\\tassertTrue(result);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3387a9511c4ed4631cfcd8c2f91883f5\",\n \"score\": \"0.51797867\",\n \"text\": \"int updateByPrimaryKey(EcsUsergroup record);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"39a507fe73d5a8598fd4f844ff95af2e\",\n \"score\": \"0.51658213\",\n \"text\": \"private void updateTaskGroup(TaskGroup aTaskGroup) {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3fbc8279d298b78a0e993c08ea98555a\",\n \"score\": \"0.5154286\",\n \"text\": \"@Test\\r\\n\\tpublic void testIsGroupValid_1()\\r\\n\\t\\tthrows Exception {\\r\\n\\t\\tUserDetailService fixture = new UserDetailService();\\r\\n\\t\\tGroupDetail group = new GroupDetail();\\r\\n\\t\\tAirplaneModel ap = new AirplaneModel();\\r\\n\\t\\tAirplaneModel ap1= new AirplaneModel(12L);\\r\\n\\t\\tUserPrivilegesModel userPrivileges = new UserPrivilegesModel();\\r\\n\\t\\tList<AirplaneModel> list = new ArrayList<AirplaneModel>();\\r\\n\\t\\tList<AirplaneModel> list1 = new ArrayList<AirplaneModel>();\\r\\n\\t\\tlist.add(ap1);\\r\\n\\t\\tsuperUserMap.put(group,list);\\r\\n\\t\\tuserPrivileges.setSuperUserMap(null);\\r\\n\\t\\tboolean result = fixture.isGroupValid(group, userPrivileges);\\r\\n\\t\\tassertFalse(result);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1cba034344ecb7a708251a2477fc52a0\",\n \"score\": \"0.5137546\",\n \"text\": \"protected void completeSave(AuthzGroup azGroup)\\n\\t{\\n\\t\\t// update the properties\\n\\t\\taddLiveUpdateProperties((BaseAuthzGroup) azGroup);\\n\\n\\t\\t// allow any advisors to make last minute changes \\n\\t\\tfor (AuthzGroupAdvisor authzGroupAdvisor : authzGroupAdvisors) {\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tauthzGroupAdvisor.update(azGroup);\\n\\t\\t\\t} catch (Exception e) {\\n\\t\\t\\t\\tlog.error(\\\"Advisor error during completeSave()\\\", e);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t// complete the azGroup\\n\\t\\tm_storage.save(azGroup);\\n\\n\\t\\t// track it\\n\\t\\tString event = ((BaseAuthzGroup) azGroup).getEvent();\\n\\t\\tif (event == null) event = SECURE_UPDATE_AUTHZ_GROUP;\\n // KNL-1230 handle changes to authzgroups by processing caching changes\\n if (SECURE_UPDATE_AUTHZ_GROUP.equals(event)) {\\n // we only care about update events here\\n try {\\n HashSet<String> roles = null;\\n HashSet<String> permissions = null;\\n Set<DbAuthzGroupService.DbStorage.RoleAndFunction> lastChangedPerms = ((BaseAuthzGroup) azGroup).m_lastChangedRlFn;\\n if (lastChangedPerms != null && !lastChangedPerms.isEmpty()) {\\n roles = new HashSet<String>();\\n permissions = new HashSet<String>(lastChangedPerms.size());\\n for (DbAuthzGroupService.DbStorage.RoleAndFunction rf : lastChangedPerms) {\\n permissions.add(rf.function);\\n roles.add(rf.role);\\n }\\n if (log.isDebugEnabled()) {\\n log.debug(\\\"Changed permissions for roles (\\\" + roles + \\\") in \\\" + azGroup.getId() + \\\": \\\" + permissions);\\n }\\n }\\n ((SakaiSecurity) securityService()).notifyRealmChanged(azGroup.getId(), roles, permissions);\\n } catch (Exception e) {\\n log.warn(\\\"Failure while trying to notify SS about realm changes for AZG(\\\" + azGroup.getId() + \\\"): \\\" + e, e);\\n }\\n } // End KNL-1230\\n\\t\\teventTrackingService().post(eventTrackingService().newEvent(event, azGroup.getReference(), true));\\n\\n\\t\\t// close the azGroup object\\n\\t\\t((BaseAuthzGroup) azGroup).closeEdit();\\n ((BaseAuthzGroup) azGroup).m_lastChangedRlFn = null; // cleanup\\n\\n\\t\\t// update the db with latest provider, and site security with the latest changes, using the updated azGroup\\n\\t\\tBaseAuthzGroup updatedRealm = (BaseAuthzGroup) m_storage.get(azGroup.getId());\\n\\t\\tupdateSiteSecurity(updatedRealm);\\n\\n\\t\\t// clear the event for next time\\n\\t\\t((BaseAuthzGroup) azGroup).setEvent(null);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4744e8644a5619b4cac96c05a0cf2bce\",\n \"score\": \"0.5133182\",\n \"text\": \"public static final boolean quitGroup(Group group) {\\n try {\\n Group newGroup = new Group(group); // Copy info from previous group\\n newGroup.removeGroupMember(UserHelper.getLogged()); // Remove logged user from new group to update database\\n\\n Map<String, Object> newGroupMap = convertGroupToMap(newGroup);\\n\\n FirebaseConfig.getFirebaseDatabase() // remove member of Group\\n .child(Constants.GroupNode.KEY)\\n .child(group.getId())\\n .setValue(newGroupMap);\\n return true;\\n } catch (Exception e) {\\n Log.e(TAG, \\\"removeFromDatabase: \\\" + e.getMessage() );\\n return false;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d4a2afbaca9f50b2e5075736d578fead\",\n \"score\": \"0.5128491\",\n \"text\": \"@Test(dataProvider = \\\"groupsFromFile\\\")\\n public void testGroupCreationwithValidData(GroupData group) throws Exception {\\n\\t SortedListOf<GroupData> oldList = app.getGroupHelper().GetGroupsFormCash();\\n\\n app.getGroupHelper().createGroup(group);\\n \\n \\n SortedListOf<GroupData> newlist= app.getApplicationModel().getGroups(); \\n \\n // assertEquals(newlist.size(),oldList.size()+1);\\n//\\t assertThat(newlist, equalTo(oldList.withAdded(group)));\\n\\t \\n\\t if(\\\"yes\\\".equals(app.getProperty(\\\"check.db\\\"))) {\\n\\t\\t if (wantToCheck()) {\\n\\t\\t assertThat(app.getApplicationModel().getGroups(),equalTo(app.getHibernateHelper().listGroups()));\\n\\t\\t }\\n\\t }\\n\\t \\n\\t if(\\\"yes\\\".equals(app.getProperty(\\\"check.ui\\\"))) {\\n\\t\\t if (wantToCheck()) {\\n\\t\\t assertThat(app.getApplicationModel().getGroups(),equalTo(app.getGroupHelper().getUiGroups()));\\n\\t\\t }\\n\\t }\\n\\t \\n\\t \\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fd6033e2f88d6f735fec6609e1ce28ea\",\n \"score\": \"0.5122548\",\n \"text\": \"boolean isBackupGroup(KdbGroup group);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"16367c103c198a77c2f38ca693de6ed7\",\n \"score\": \"0.5121872\",\n \"text\": \"@Transactional\\n\\t@Override\\n\\tpublic boolean updateGroupName(GroupInfo groupInfo) {\\n\\t\\ttry {\\n\\t\\t\\treturn groupInfoMapper.updateByPrimaryKeySelective(groupInfo);\\n\\t\\t} catch (Exception e) {\\n\\t\\t\\tlogger.error(\\\"修改群组名称时发生异常:\\\" + e.getMessage());\\n\\t\\t\\tthrow new RuntimeException();\\n\\t\\t}\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5b2a0dd4d9c8696ca2de918f70da965d\",\n \"score\": \"0.5116964\",\n \"text\": \"public void update(int _no_tubes, String _group_name) throws SQLException{\\n assert group_name != null : \\\"Precondition group_name != null\\\";\\n s.update_group(no_tubes, group_name, member.get(0), member.get(1), member.get(2), _no_tubes, _group_name);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fe5630be4c27cb99acab20e948429809\",\n \"score\": \"0.5095303\",\n \"text\": \"void updateMembers() throws GroupsException;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7fd6d16041a56735547234d9e3aabfc8\",\n \"score\": \"0.5069843\",\n \"text\": \"@Override\\n public boolean leaveGroup(Group group, Person person) {\\n try {\\n String sql = \\\"DELETE FROM group_members WHERE groupID = ? AND userID = ?\\\";\\n template.update(sql, group.getGroupID(), person.getPersonID());\\n return true;\\n } catch (Exception ex) {\\n return false;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"acd28bf6724ed32712500057ecbdedd0\",\n \"score\": \"0.5067289\",\n \"text\": \"boolean isGroupSupported();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"572f1231f93d94afe80c16035809686b\",\n \"score\": \"0.50447166\",\n \"text\": \"@Test\\r\\n\\tpublic void testIsGroupValid_3()\\r\\n\\t\\tthrows Exception {\\r\\n\\t\\tUserDetailService fixture = new UserDetailService();\\r\\n\\t\\tGroupDetail group = new GroupDetail();\\r\\n\\t\\tAirplaneModel ap = new AirplaneModel();\\r\\n\\t\\tAirplaneModel ap1= new AirplaneModel(12L);\\r\\n\\t\\tUserPrivilegesModel userPrivileges = new UserPrivilegesModel();\\r\\n\\t\\tList<AirplaneModel> list = new ArrayList<AirplaneModel>();\\r\\n\\t\\tList<AirplaneModel> list1 = new ArrayList<AirplaneModel>();\\r\\n\\t\\tlist.add(ap1);\\r\\n\\t\\tsuperUserMap.put(group,list);\\r\\n\\t\\tuserPrivileges.setSuperUserMap(superUserMap);\\r\\n\\t\\tboolean result = fixture.isGroupValid(group, userPrivileges);\\r\\n\\t\\tassertTrue(result);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bb42f4ecac7230b7503557ed572f8e28\",\n \"score\": \"0.5039094\",\n \"text\": \"public void test_hasGroupTrue() {\\n Group group1 = new GroupBuilder().build();\\n mDatabaseManager.create(group1);\\n assertTrue(mDatabaseManager.queryHasGroup());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ddd7cd1e03bc38a7ee7cee65fc2b6148\",\n \"score\": \"0.50252295\",\n \"text\": \"public boolean moveGroup(Collection<GameObject> group, Vector2D.Direction direction) {\\n List<GameObject> movers = new ArrayList<>();\\n for (GameObject obj : group) {\\n if (obj.canMove()) {\\n movers.add(obj);\\n }\\n }\\n\\n for (GameObject obj : movers) {\\n Vector2D movePoint = obj.getLocation().getPointInDirection(direction);\\n if (!isPointValid(movePoint, movers)) {\\n return false;\\n }\\n }\\n\\n for (GameObject obj : movers) {\\n filledPositions.remove(obj.getLocation());\\n }\\n for (GameObject obj : movers) {\\n obj.setLocation(obj.getLocation().getPointInDirection(direction));\\n filledPositions.put(obj.getLocation(), obj);\\n\\n obj.setMove(false);\\n }\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"17670ee92276d1e83e2dc70ec037e8a7\",\n \"score\": \"0.50088805\",\n \"text\": \"public boolean isSetGroup()\\r\\n {\\r\\n synchronized (monitor())\\r\\n {\\r\\n check_orphaned();\\r\\n return get_store().find_attribute_user(GROUP$12) != null;\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c08dd9184ac0f8218d1d5d6453d4d699\",\n \"score\": \"0.50032616\",\n \"text\": \"@Test\\n public void remoteProcessGroupsTest() {\\n // TODO: test remoteProcessGroups\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"17cb2490bb033d660061feb50c4debef\",\n \"score\": \"0.49860543\",\n \"text\": \"public boolean insertGroup(Group group) {\\n\\t\\ttry (Connection con = getConnection();\\n\\t\\t\\t\\tPreparedStatement pstmt = con.prepareStatement(SQL_INSERT_GROUP, Statement.RETURN_GENERATED_KEYS)) {\\n\\t\\t\\tpstmt.setString(1, group.getName());\\n\\t\\t\\tResultSet resultSet;\\n\\t\\t\\tif (pstmt.executeUpdate() > 0) {\\n\\t\\t\\t\\tresultSet = pstmt.getGeneratedKeys();\\n\\t\\t\\t\\tif (resultSet.next()) {\\n\\t\\t\\t\\t\\tgroup.setId(resultSet.getInt(1));\\n\\t\\t\\t\\t\\treturn true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t} catch (SQLException e) {\\n\\t\\t\\tSystem.err.println(e.getLocalizedMessage());\\n\\t\\t}\\n\\t\\treturn false;\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4485cb0f46a2f12f8bd7685595b8388a\",\n \"score\": \"0.49823922\",\n \"text\": \"@Test\\n public void update() throws Exception {\\n Group group = new Group();\\n group.setNumber(POIT_12);\\n\\n mockMvc.perform(put(GROUPS_ID, 2)\\n .header(ACCEPT_LANGUAGE, EN)\\n .param(CURATOR_ID, \\\"2\\\")\\n .param(TEACHER_ID_LIST, \\\"3\\\")\\n .contentType(APPLICATION_JSON_CHARSET_UTF_8)\\n .content(json(group))\\n )\\n .andExpect(status().isOk())\\n .andExpect(content().contentType(APPLICATION_JSON_CHARSET_UTF_8))\\n .andExpect(jsonPath($_ID, is(2)))\\n .andExpect(jsonPath($_NUMBER, is(POIT_12)));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"194ca6ef08759efb9659e961e07f7581\",\n \"score\": \"0.4980102\",\n \"text\": \"@Test\\n public void testDeleteGroupOK() throws Exception {\\n final Long gid1=1L, member1Id = 1L;\\n\\n Member member1 = Member.builder().memberId(member1Id).name(group2Member1Name).rating(group2Member1Rating).build();\\n List<Member> members = new ArrayList<Member>();\\n members.add(member1);\\n \\n Groups group1 = Groups.builder().gid(gid1).groupName(group1Name).members(members).attr1(attr1).build();\\n memberRepository.save(member1);\\n \\n groupsRepository.save(group1);\\n final String baseUrl = urlPrefix + \\\"/group/\\\"+groupsRepository.findGroupsByGroupName(group1Name).get().get(0).getGid();\\n //when delete the group\\n RequestEntity<Void> request = RequestEntity.delete(new URI(baseUrl)).build();\\n ResponseEntity<Void> response = testTemplate.exchange(request, Void.class);\\n //verify the result\\n assertEquals(HttpStatus.NO_CONTENT, response.getStatusCode());\\n\\n assertFalse(groupsRepository.findGroupsByGroupName(group1Name).isPresent());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e760a5400626fa45c13d6ebf21ac187\",\n \"score\": \"0.49606124\",\n \"text\": \"public ValidationResult validatePapRest(boolean updateGroupFlow) {\\n var result = new BeanValidationResult(\\\"group\\\", this);\\n\\n result.validateNotNull(\\\"pdpType\\\", pdpType);\\n // When doing PdpGroup Update operation, supported policy types and policies doesn't have to be validated.\\n if (!updateGroupFlow) {\\n result.validateNotNullList(\\\"policies\\\", policies, ToscaConceptIdentifier::validatePapRest);\\n result.validateNotNullList(\\\"supportedPolicyTypes\\\", supportedPolicyTypes,\\n ToscaConceptIdentifier::validatePapRest);\\n\\n if (supportedPolicyTypes != null && supportedPolicyTypes.isEmpty()) {\\n result.addResult(\\\"supportedPolicyTypes\\\", supportedPolicyTypes, ValidationStatus.INVALID, \\\"empty list\\\");\\n }\\n }\\n\\n if (desiredInstanceCount <= 0) {\\n result.addResult(\\\"desiredInstanceCount\\\", desiredInstanceCount, ValidationStatus.INVALID, \\\"non-positive\\\");\\n }\\n\\n return result;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"47944987352b6a3594f643e566d1f46a\",\n \"score\": \"0.495737\",\n \"text\": \"int updateByPrimaryKey(Group record);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"47944987352b6a3594f643e566d1f46a\",\n \"score\": \"0.495737\",\n \"text\": \"int updateByPrimaryKey(Group record);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ae2cd9ec1830d6c8fbfef5b7534b6c8f\",\n \"score\": \"0.49429184\",\n \"text\": \"public void setGroup(Group group) {\\n this.group = group;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ab82e3d1244a2d92cf930ca6c02821ac\",\n \"score\": \"0.4942836\",\n \"text\": \"private void assertCommandSuccess(String cmd, Group grp) {\\n Model expectedModel = prepModel(grp, true);\\n\\n String expectedResultMessage = getSb(grp.getGrpName(), grp.getPersonList());\\n\\n assertCommandSuccess(cmd, expectedModel, expectedResultMessage);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"468d3bbdc4f9671ab36a9a93265c08df\",\n \"score\": \"0.4933923\",\n \"text\": \"boolean deepContains(IGroupMember gm) throws GroupsException;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0f2eb9e92763ee4bfe3d8ef9cd97758f\",\n \"score\": \"0.49171147\",\n \"text\": \"public void test_isMember() {\\r\\n\\t\\tAllUsersGroup group;\\r\\n\\r\\n\\t\\tgroup = AllUsersGroup.getInstance();\\r\\n\\r\\n\\t\\tassertTrue(\\\"Should be member\\\", group.isMember(new CanonicalUser(\\\"id\\\")));\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2e1c4ca9ca228dcf7e2e5d5bb7c1d4a7\",\n \"score\": \"0.4915625\",\n \"text\": \"public boolean groupExists(){\\n\\t\\t\\n\\t\\treturn false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"165f84333155f9740a645611110a0a11\",\n \"score\": \"0.491474\",\n \"text\": \"@Test // USERGRID-1729\\n public void updateGroupWithSameNameAsApp() throws IOException {\\n String groupId = null;\\n String groupPath = context.getAppName();\\n try {\\n Map<String, Object> groupMap = new HashMap<String, Object>();\\n groupMap.put( \\\"title\\\", \\\"Old Title\\\" );\\n groupMap.put( \\\"path\\\", groupPath );\\n String path = context.getOrgName() + \\\"/\\\" + context.getAppName() + \\\"/groups\\\";\\n JsonNode groupJson = webResourceBuilder( path ).post( JsonNode.class, groupMap );\\n groupId = groupJson.get( \\\"entities\\\" ).get( 0 ).get( \\\"uuid\\\" ).getTextValue();\\n }\\n catch ( UniformInterfaceException e ) {\\n fail( \\\"Error creating group: \\\" + IOUtils.toString( e.getResponse().getEntityInputStream() ) );\\n }\\n\\n assertTitle( groupId, \\\"Old Title\\\" );\\n\\n // update that group by giving it a new title and using group path in URL\\n try {\\n Map<String, Object> group = new HashMap<String, Object>();\\n group.put( \\\"title\\\", \\\"New Title\\\" );\\n String path = context.getOrgName() + \\\"/\\\" + context.getAppName() + \\\"/groups/\\\" + groupPath;\\n webResourceBuilder( path ).put( JsonNode.class, group );\\n }\\n catch ( UniformInterfaceException e ) {\\n fail( \\\"Error updating group: \\\" + IOUtils.toString( e.getResponse().getEntityInputStream() ) );\\n }\\n\\n assertTitle( groupId, \\\"New Title\\\" );\\n\\n // update that group by giving it a new title and using UUID in URL\\n try {\\n Map<String, Object> group = new HashMap<String, Object>();\\n group.put( \\\"title\\\", \\\"Even Newer Title\\\" );\\n String path = context.getOrgName() + \\\"/\\\" + context.getAppName() + \\\"/groups/\\\" + groupId;\\n webResourceBuilder( path ).put( JsonNode.class, group );\\n }\\n catch ( UniformInterfaceException e ) {\\n fail( \\\"Error updating group: \\\" + IOUtils.toString( e.getResponse().getEntityInputStream() ) );\\n }\\n\\n assertTitle( groupId, \\\"Even Newer Title\\\" );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a75c4a9bd3eb9b9b7d3cee746ed31126\",\n \"score\": \"0.49099272\",\n \"text\": \"private boolean checkGroup(StudyGroup studyGroup) {\\n ArrayList<Participant> participants = studyGroup.getParticipants();\\n if (participants != null) {\\n for (int i = 0; i < participants.size(); i++) {\\n Participant p = participants.get(i);\\n String uid = p.getUid();\\n if (uid.equals(mUID)) return false;\\n }\\n }\\n\\n // check if group is empty\\n if (studyGroup.getParticipantCount() == 0) {\\n return false;\\n }\\n\\n // check if group is not full yet\\n if (studyGroup.getParticipantCount() >= studyGroup.getParticipantsMax()) {\\n return false;\\n }\\n\\n // check if end date is still in the future\\n String dateTo = studyGroup.getDateTo();\\n final Calendar c = Calendar.getInstance();\\n int year = c.get(Calendar.YEAR);\\n int month = c.get(Calendar.MONTH);\\n int day = c.get(Calendar.DAY_OF_MONTH);\\n String dateCurrent = String.format(Locale.ENGLISH, \\\"%d-%02d-%02d\\\", year, month + 1, day);\\n int comparison = dateTo.compareTo(dateCurrent);\\n if (comparison >= 0) {\\n return true;\\n } else {\\n return false;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5a08c0184a9dec7804f89700f7f6b8f0\",\n \"score\": \"0.49098653\",\n \"text\": \"protected abstract void setGroup(Group group);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f31a08c3d6efea0e5b09ff5909f47c09\",\n \"score\": \"0.48954865\",\n \"text\": \"public interface Group {\\n\\t\\n\\t/**\\n\\t * Returns the group leader's id.\\n\\t * @return The group leader id\\n\\t * @throws CoordinationException\\n\\t */\\n\\tpublic String getLeaderId() throws CoordinationException;\\n\\t\\n\\t/**\\n\\t * Returns my member id.\\n\\t * @return Current node's member id\\n\\t * @throws CoordinationException\\n\\t */\\n\\tpublic String getMemberId();\\n\\t\\n\\t/**\\n\\t * Returns ids of all the members in the group.\\n\\t * @return Group member ids.\\n * @throws CoordinationException \\n\\t */\\n\\tpublic List<String> getMemberIds() throws CoordinationException;\\n\\t\\n\\t/**\\n\\t * Returns the current group id.\\n\\t * @return group id\\n\\t */\\n\\tpublic String getGroupId();\\n\\t\\n\\t/**\\n\\t * Broadcasts a message to all the members in the group.\\n\\t * @param data The data to be broadcasted\\n\\t * @throws CoordinationException\\n\\t */\\n\\tpublic void broadcast(byte[] data) throws CoordinationException;\\n\\t\\n\\t/**\\n\\t * Send and receives message to/from a peer in the group.\\n\\t * @param memberId The member id of the peer the call should be made to\\n\\t * @param data The data to be sent to the peer\\n\\t * @throws CoordinationException If a communication error or a processing error\\n\\t * occurs in the target \\n\\t */\\n\\tpublic byte[] sendReceive(String memberId, byte[] data) throws CoordinationException;\\n\\t\\n\\t/**\\n\\t * Leave the group.\\n\\t * @throws CoordinationException\\n\\t */\\n\\tpublic void leave() throws CoordinationException;\\n\\t\\n\\t/**\\n\\t * Set a group event listener to this group, to receive group notifications.\\n\\t * @param listener The GroupEventListener implementation\\n\\t * @see GroupEventListener\\n\\t */\\n\\tpublic void setGroupEventListener(GroupEventListener listener);\\n\\t\\n\\t/**\\n\\t * Returns the registered group event listener.\\n\\t * @return group event listener\\n\\t */\\n\\tpublic GroupEventListener getGroupEventListener();\\n\\t\\n\\t/**\\n\\t * Clears all group messages that are stored.\\n\\t * @throws CoordinationException \\n\\t */\\n\\tpublic void clearGroupMessages() throws CoordinationException;\\n\\t\\n\\t/**\\n\\t * Waits for a specific number of members are arrived in the group.\\n\\t * @param count The number of members\\n\\t * @throws CoordinationException\\n\\t */\\n\\tpublic void waitForMemberCount(int count) throws CoordinationException;\\n\\t\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8dd7389b274a264624cc51b17d7bdae0\",\n \"score\": \"0.4890794\",\n \"text\": \"public void setGroup(boolean group) {\\n this.group = group;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4da7270580ceb852c81fe6b98642f3f\",\n \"score\": \"0.48894155\",\n \"text\": \"default @NonNull Task<Void> updateGroupAsync(@NonNull PermissionGroup permissionGroup) {\\n return Task.supply(() -> this.updateGroup(permissionGroup));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9c9bda08f44d103f3fa2848722961996\",\n \"score\": \"0.48883167\",\n \"text\": \"protected void validateGroups(Object resultObject, int total, String orderBy, int start, int count, int[] groups, String[] roles) {\\n assertNotNull(resultObject);\\n assertTrue(resultObject.getClass().toString(), resultObject instanceof VootGetGroupsResponse);\\n \\n VootGetGroupsResponse vootGetGroupsResponse = (VootGetGroupsResponse) resultObject;\\n assertEquals(start, vootGetGroupsResponse.getStartIndex().intValue());\\n assertEquals(count, vootGetGroupsResponse.getItemsPerPage().intValue());\\n assertEquals(total, vootGetGroupsResponse.getTotalResults().intValue());\\n assertEquals(count, GrouperUtil.length(vootGetGroupsResponse.getEntry()));\\n \\n if (groups == null) {\\n assertNull(vootGetGroupsResponse.getEntry());\\n }\\n else {\\n assertNotNull(vootGetGroupsResponse.getEntry());\\n \\n // Check if all groups are present in the response, without considering their order\\n int groupCount = 0;\\n @SuppressWarnings(\\\"unchecked\\\")\\n List<VootGroup> groupsList = Arrays.asList(vootGetGroupsResponse.getEntry());\\n for (int i = 0; i < total; ++i) {\\n VootGroup vootGroup = new VootGroup();\\n vootGroup.setId(GROUP_NAMES[groups[i]]);\\n vootGroup.setName(GROUP_NAMES[groups[i]]);\\n vootGroup.setDescription(GROUP_DESCRIPTIONS[groups[i]]);\\n vootGroup.setVoot_membership_role(roles[i]);\\n \\n if (groupsList.contains(vootGroup)) groupCount++;\\n }\\n \\n assertEquals(count, groupCount);\\n \\n // Check if all groups are present in the response, also considering their order\\n if (orderBy != null) {\\n try {\\n // Set up introspection for the field specified by orderBy\\n Field f = VootGroup.class.getDeclaredField(orderBy);\\n f.setAccessible(true);\\n \\n // Verify sorting\\n for (int i = 0; i < total-1; ++i) {\\n String value1 = f.get(vootGetGroupsResponse.getEntry()[i]).toString();\\n String value2 = f.get(vootGetGroupsResponse.getEntry()[i+1]).toString();\\n \\n assertTrue(value1.compareTo(value2) <= 0);\\n }\\n }\\n catch (Exception e) {\\n assertTrue(\\\"Exception in checking sort\\\", false);\\n }\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d4b6fa305f9e0f1c1d70774fd80e450e\",\n \"score\": \"0.48800254\",\n \"text\": \"int updateByExampleSelective(@Param(\\\"record\\\") VUserGroup record, @Param(\\\"example\\\") VUserGroupExample example);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6d772384eecec957ae2c50a4115063be\",\n \"score\": \"0.4875348\",\n \"text\": \"boolean isEditable() throws GroupsException;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c617c133d6296f4c10dae2f03171c2c\",\n \"score\": \"0.48748112\",\n \"text\": \"boolean hasGroupId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c617c133d6296f4c10dae2f03171c2c\",\n \"score\": \"0.48748112\",\n \"text\": \"boolean hasGroupId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c617c133d6296f4c10dae2f03171c2c\",\n \"score\": \"0.48748112\",\n \"text\": \"boolean hasGroupId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c617c133d6296f4c10dae2f03171c2c\",\n \"score\": \"0.48748112\",\n \"text\": \"boolean hasGroupId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c617c133d6296f4c10dae2f03171c2c\",\n \"score\": \"0.48748112\",\n \"text\": \"boolean hasGroupId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c617c133d6296f4c10dae2f03171c2c\",\n \"score\": \"0.48748112\",\n \"text\": \"boolean hasGroupId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c617c133d6296f4c10dae2f03171c2c\",\n \"score\": \"0.48748112\",\n \"text\": \"boolean hasGroupId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c617c133d6296f4c10dae2f03171c2c\",\n \"score\": \"0.48748112\",\n \"text\": \"boolean hasGroupId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c617c133d6296f4c10dae2f03171c2c\",\n \"score\": \"0.48748112\",\n \"text\": \"boolean hasGroupId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c617c133d6296f4c10dae2f03171c2c\",\n \"score\": \"0.48748112\",\n \"text\": \"boolean hasGroupId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c617c133d6296f4c10dae2f03171c2c\",\n \"score\": \"0.48748112\",\n \"text\": \"boolean hasGroupId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c617c133d6296f4c10dae2f03171c2c\",\n \"score\": \"0.48748112\",\n \"text\": \"boolean hasGroupId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c617c133d6296f4c10dae2f03171c2c\",\n \"score\": \"0.48748112\",\n \"text\": \"boolean hasGroupId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c617c133d6296f4c10dae2f03171c2c\",\n \"score\": \"0.48748112\",\n \"text\": \"boolean hasGroupId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c617c133d6296f4c10dae2f03171c2c\",\n \"score\": \"0.48748112\",\n \"text\": \"boolean hasGroupId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c617c133d6296f4c10dae2f03171c2c\",\n \"score\": \"0.48748112\",\n \"text\": \"boolean hasGroupId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c617c133d6296f4c10dae2f03171c2c\",\n \"score\": \"0.48748112\",\n \"text\": \"boolean hasGroupId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c617c133d6296f4c10dae2f03171c2c\",\n \"score\": \"0.48748112\",\n \"text\": \"boolean hasGroupId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c617c133d6296f4c10dae2f03171c2c\",\n \"score\": \"0.48748112\",\n \"text\": \"boolean hasGroupId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c617c133d6296f4c10dae2f03171c2c\",\n \"score\": \"0.48748112\",\n \"text\": \"boolean hasGroupId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c617c133d6296f4c10dae2f03171c2c\",\n \"score\": \"0.48748112\",\n \"text\": \"boolean hasGroupId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c617c133d6296f4c10dae2f03171c2c\",\n \"score\": \"0.48748112\",\n \"text\": \"boolean hasGroupId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c617c133d6296f4c10dae2f03171c2c\",\n \"score\": \"0.48748112\",\n \"text\": \"boolean hasGroupId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c617c133d6296f4c10dae2f03171c2c\",\n \"score\": \"0.48748112\",\n \"text\": \"boolean hasGroupId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c617c133d6296f4c10dae2f03171c2c\",\n \"score\": \"0.48748112\",\n \"text\": \"boolean hasGroupId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c617c133d6296f4c10dae2f03171c2c\",\n \"score\": \"0.48748112\",\n \"text\": \"boolean hasGroupId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0233d16bf9f7b8d7914e58132eb0c876\",\n \"score\": \"0.48725238\",\n \"text\": \"public static void update(GroupPermission groupPermission, GroupPermission oldGroupPermission) throws Exception {\\n String command = \\\"\\\";\\n if (groupPermission.NewerDate != oldGroupPermission.NewerDate)\\n {\\n if (!StringSupport.equals(command, \\\"\\\"))\\n {\\n command += \\\",\\\";\\n }\\n \\n command += \\\"NewerDate = \\\" + POut.date(groupPermission.NewerDate) + \\\"\\\";\\n }\\n \\n if (groupPermission.NewerDays != oldGroupPermission.NewerDays)\\n {\\n if (!StringSupport.equals(command, \\\"\\\"))\\n {\\n command += \\\",\\\";\\n }\\n \\n command += \\\"NewerDays = \\\" + POut.int(groupPermission.NewerDays) + \\\"\\\";\\n }\\n \\n if (groupPermission.UserGroupNum != oldGroupPermission.UserGroupNum)\\n {\\n if (!StringSupport.equals(command, \\\"\\\"))\\n {\\n command += \\\",\\\";\\n }\\n \\n command += \\\"UserGroupNum = \\\" + POut.long(groupPermission.UserGroupNum) + \\\"\\\";\\n }\\n \\n if (groupPermission.PermType != oldGroupPermission.PermType)\\n {\\n if (!StringSupport.equals(command, \\\"\\\"))\\n {\\n command += \\\",\\\";\\n }\\n \\n command += \\\"PermType = \\\" + POut.int(((Enum)groupPermission.PermType).ordinal()) + \\\"\\\";\\n }\\n \\n if (StringSupport.equals(command, \\\"\\\"))\\n {\\n return ;\\n }\\n \\n command = \\\"UPDATE grouppermission SET \\\" + command + \\\" WHERE GroupPermNum = \\\" + POut.long(groupPermission.GroupPermNum);\\n Db.nonQ(command);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d91cad2e427f2fe849b2bcf059df0bcd\",\n \"score\": \"0.48663995\",\n \"text\": \"public void sendRemote(GroupMessage msg) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"47a3056aa57ff90b324858efe9103993\",\n \"score\": \"0.48660064\",\n \"text\": \"boolean hasGroup();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"47a3056aa57ff90b324858efe9103993\",\n \"score\": \"0.48660064\",\n \"text\": \"boolean hasGroup();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"47a3056aa57ff90b324858efe9103993\",\n \"score\": \"0.48660064\",\n \"text\": \"boolean hasGroup();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a69ff0bc53beb8767843c7a59e99b37\",\n \"score\": \"0.48619863\",\n \"text\": \"@Test\\n public void testGetForVdsGroup() {\\n storage_pool result = dao.getForVdsGroup(vdsGroup);\\n\\n assertNotNull(result);\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":983190,"cells":{"query_id":{"kind":"string","value":"9f228ffca88ab4e8722857b43637f94a"},"query":{"kind":"string","value":"A good way to store a stacktrace away efficiently is to simply construct an exception. Later, if you want to inspect the stacktrace call exception.getStackTrace() which will do the slow work of resolving the stack frames to methods."},"positive_passages":{"kind":"list like","value":[{"docid":"fa3ccfa35c0ba286bfc1a7a1040e57dc","score":"0.5869296","text":"@SuppressWarnings(\"ThrowableInstanceNeverThrown\")\n private Supplier<StackTraceElement[]> keepOriginalStackTrace() {\n return new Exception()::getStackTrace;\n }","title":""}],"string":"[\n {\n \"docid\": \"fa3ccfa35c0ba286bfc1a7a1040e57dc\",\n \"score\": \"0.5869296\",\n \"text\": \"@SuppressWarnings(\\\"ThrowableInstanceNeverThrown\\\")\\n private Supplier<StackTraceElement[]> keepOriginalStackTrace() {\\n return new Exception()::getStackTrace;\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"125b662a6538e7100d359534be148292","score":"0.6146035","text":"private void throwStackException() {\n try {\n throw new Exception(\"stack underflow exception\");\n } catch (Exception ex) {\n ex.printStackTrace();\n s = new Stack();\n }\n }","title":""},{"docid":"5b4701545f105751d3c8acc64f7cbfd6","score":"0.57426846","text":"public synchronized Throwable fillInStackTrace() {\n/* 16 */ return this;\n/* */ }","title":""},{"docid":"6e413c28e2e29c4ace4a175defca2be7","score":"0.5579829","text":"@Test(timeout = 4000)\n public void test001() throws Throwable {\n ClassWriter classWriter0 = new ClassWriter(943);\n String[] stringArray0 = new String[5];\n stringArray0[0] = \"_Ew)rOy'*S7|\";\n stringArray0[1] = \"_Ew)rOy'*S7|\";\n int int0 = MethodWriter.SAME_LOCALS_1_STACK_ITEM_FRAME_EXTENDED;\n stringArray0[2] = \"_Ew)rOy'*S7|\";\n Item item0 = classWriter0.newFloat(943);\n stringArray0[3] = \"_Ew)rOy'*S7|\";\n stringArray0[4] = \"_Ew)rOy'*S7|\";\n MethodWriter methodWriter0 = new MethodWriter(classWriter0, 2, \"_Ew)rOy'*S7|\", \"_Ew)rOy'*S7|\", \"_Ew)rOy'*S7|\", stringArray0, true, true);\n Object[] objectArray0 = new Object[4];\n objectArray0[0] = (Object) item0;\n Object object0 = new Object();\n objectArray0[1] = object0;\n item0.strVal3 = \"_Ew)rOy'*S7|\";\n objectArray0[2] = (Object) \"_Ew)rOy'*S7|\";\n objectArray0[3] = (Object) \"_Ew)rOy'*S7|\";\n methodWriter0.visitFrame(943, 2, objectArray0, 247, stringArray0);\n methodWriter0.visitTypeInsn(4088, \"java/lang/Throwable\");\n item0.index = 4125;\n methodWriter0.visitFieldInsn(12, \"StackMap\", \"\", \"_Ew)rOy'*S7|\");\n methodWriter0.visitInsn(12);\n methodWriter0.visitMethodInsn(1, \"java/lang/Throwable\", \"_Ew)rOy'*S7|\", \"java/lang/Throwable\");\n Label label0 = new Label();\n label0.getFirst();\n Label label1 = label0.getFirst();\n methodWriter0.visitTryCatchBlock(label1, label0, label0, \"C)v!4\");\n methodWriter0.visitIincInsn(1, 69);\n methodWriter0.visitFieldInsn((-3092), \"_Ew)rOy'*S7|\", \"RuntimeInvisibleParameterAnnotations\", \"_Ew)rOy'*S7|\");\n }","title":""},{"docid":"5484f64483d0fc3f02b1b768fe3130f5","score":"0.55081624","text":"public StackTrace() {\n final StackTraceElement[] stack = Thread.currentThread().getStackTrace();\n // Skip first two elements to remove getStackTrace/StackTrace.<init>\n stackTraceElements = Arrays.copyOfRange(stack, 2, stack.length);\n }","title":""},{"docid":"fccbca8d5f1688b8334e4ea2ff79a575","score":"0.5441383","text":"StackOverflowException() {\n }","title":""},{"docid":"bebfe005318ad77dabb6fccd0d17bdf5","score":"0.5411759","text":"public String getStack() {\r\n\t\tif (stackTrace == null) {\r\n\t\t\tif (stack == null) {\r\n\t\t\t\tStringWriter sw = new StringWriter(512);\r\n\t\t\t\tPrintWriter pw = new PrintWriter(sw, true);\r\n\t\t\t\tThrowable cause = getCause();\r\n\t\t\t\tif (cause == null) {\r\n\t\t\t\t\tsuper.printStackTrace(pw);\r\n\t\t\t\t} else {\r\n\t\t\t\t\tcause.printStackTrace(pw);\r\n\t\t\t\t}\r\n\t\t\t\tstackTrace = sw.toString().trim();\r\n\t\t\t} else {\r\n\t\t\t\tstackTrace = stack.trim();\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn stackTrace;\r\n\t}","title":""},{"docid":"3ba02500c4b8f0e477b2811e2cc5c125","score":"0.54057413","text":"public void writeStackTrace(final Exception exception);","title":""},{"docid":"8ddf746ac8c7facddba9accd8b050354","score":"0.5405387","text":"void createException(String reason, Object caller);","title":""},{"docid":"64e4b6c9f6ecf99527c3fd9c7bd361b2","score":"0.5380813","text":"@Test(timeout = 4000)\n public void test010() throws Throwable {\n ClassWriter classWriter0 = new ClassWriter(943);\n String[] stringArray0 = new String[5];\n stringArray0[0] = \"_Ew)rOy'*S7|\";\n stringArray0[1] = \"_Ew)rOy'*S7|\";\n int int0 = MethodWriter.SAME_LOCALS_1_STACK_ITEM_FRAME_EXTENDED;\n stringArray0[2] = \"_Ew)rOy'*S7|\";\n Item item0 = classWriter0.newFloat(943);\n stringArray0[3] = \"_Ew)rOy'*S7|\";\n stringArray0[4] = \"_Ew)rOy'*S7|\";\n MethodWriter methodWriter0 = new MethodWriter(classWriter0, 943, \"_Ew)rOy'*S7|\", \"_Ew)rOy'*S7|\", \"_Ew)rOy'*S7|\", stringArray0, true, true);\n Object[] objectArray0 = new Object[4];\n objectArray0[0] = (Object) item0;\n Object object0 = new Object();\n objectArray0[1] = object0;\n item0.strVal3 = \"_Ew)rOy'*S7|\";\n objectArray0[2] = (Object) \"_Ew)rOy'*S7|\";\n objectArray0[3] = (Object) \"_Ew)rOy'*S7|\";\n methodWriter0.visitFrame(943, 2, objectArray0, 247, stringArray0);\n methodWriter0.visitTypeInsn(4123, \"java/lang/Throwable\");\n item0.index = 4125;\n methodWriter0.visitFieldInsn(12, \"StackMap\", \"\", \"_Ew)rOy'*S7|\");\n methodWriter0.visitInsn(12);\n methodWriter0.visitMethodInsn(1, \"java/lang/Throwable\", \"_Ew)rOy'*S7|\", \"java/lang/Throwable\");\n Label label0 = new Label();\n label0.getFirst();\n Label label1 = label0.getFirst();\n label1.inputStackTop = 943;\n methodWriter0.visitTryCatchBlock(label1, label0, label0, \"C)v!4\");\n methodWriter0.visitIincInsn(1, 69);\n }","title":""},{"docid":"c2c2fbcbfdd0765d1ef6e4c9f0fd068f","score":"0.5377543","text":"@Override\n public synchronized java.lang.Throwable fillInStackTrace() {\n // no need to do anything we will overwrite this.\n return this;\n }","title":""},{"docid":"02fc1bd2de883f867ae233d72e83ba33","score":"0.5371984","text":"public void setStackTrace(StackTrace stackTrace) {\n this.stackTrace = stackTrace;\n }","title":""},{"docid":"1e42ecbb1da2a4accb8124a672461537","score":"0.53592473","text":"public Frame[] createBacktrace(int level, boolean nativeException) {\n int traceSize = frameIndex - level + 1;\n Frame[] traceFrames;\n \n if (traceSize <= 0) return null;\n \n if (nativeException) {\n // assert level == 0;\n traceFrames = new Frame[traceSize + 1];\n traceFrames[traceSize] = frameStack[frameIndex];\n } else {\n traceFrames = new Frame[traceSize];\n }\n \n System.arraycopy(frameStack, 0, traceFrames, 0, traceSize);\n \n return traceFrames;\n }","title":""},{"docid":"49b17aeb81028b7922e2f9d643f9a0e7","score":"0.53502244","text":"public StackTrace getStackTrace() {\n return stackTrace;\n }","title":""},{"docid":"88b970101503cbe95fba826a9d7026d4","score":"0.53358597","text":"public void stackTrace(String msg) {\n\t\tException e = new Exception(msg);\n\t\tSystem.err.println(\"Forcing stack trace: \" + msg);\n\t\tstackTrace(e);\n\t}","title":""},{"docid":"64ec3cbd46a78439e9ad7a5cd1984087","score":"0.5322822","text":"public void fillInStackTrace() {\n stackTrace = $.getStackTrace();\n }","title":""},{"docid":"3eb6f65e83d6957342cd6ae250781773","score":"0.5195854","text":"public StackOverflowException(String stack_is_full) {\n super(stack_is_full);\n }","title":""},{"docid":"af717fda4e0d7069c9ad0ed1116010cf","score":"0.51919323","text":"public StoreException(Throwable cause) {\r\n super(cause);\r\n }","title":""},{"docid":"4a98e072689c5b33ef551099d0ec38c0","score":"0.51545936","text":"public StackUnderflowException()\r\n\t{\r\n\t\tsuper(\"Stack Underflow\");\r\n\t}","title":""},{"docid":"a6743892f8816f0a66f5207ae12098a7","score":"0.5152756","text":"public EmptyStackException() {\n\n }","title":""},{"docid":"423b1702f6c76eddf0ecb12e97e84db0","score":"0.514187","text":"public CrashReport(Throwable throwable) { this.exception = throwable; }","title":""},{"docid":"d2dfb291656416c2e27993e81f565136","score":"0.5121362","text":"Exception createException();","title":""},{"docid":"2003ef628153f2be9f65aad91af3184d","score":"0.51182735","text":"private static Object convertThrowableToStackTrace(final Object message) {\n\n return ((message != null) && (message instanceof Throwable))\n ? ExceptionUtils.getStackTrace((Throwable) message)\n : message;\n }","title":""},{"docid":"0573d3bb1dc1045d572f586b5eed2827","score":"0.51177454","text":"public String getStacktrace() {\r\n return stacktrace;\r\n }","title":""},{"docid":"8438d7f169681f917e2cc44d74d91812","score":"0.509644","text":"public StackOverflowException(String reason) {\r\n\t\tsuper(reason);\r\n\t}","title":""},{"docid":"b295793027bbc9e4988fe6aa3569f4d1","score":"0.50878143","text":"public RemoteTestException(Throwable e)\n {\n remoteThrowable = e;\n\n StringWriter stringWriter = new StringWriter();\n PrintWriter writer = new PrintWriter(stringWriter);\n e.printStackTrace(writer);\n StringBuffer buffer = stringWriter.getBuffer();\n remoteStackTrace = buffer.toString();\n }","title":""},{"docid":"be054f63044709c9de814bc809eda244","score":"0.50811064","text":"public void setStacktrace(String stacktrace) {\r\n this.stacktrace = stacktrace;\r\n }","title":""},{"docid":"3a0e772e9acca0ae4ca64058ce6203e2","score":"0.50579804","text":"public ValidationFailure withStacktrace(StackTraceElement[] stacktraceElements) {\n causes.add(\n new Cause().addAttribute(CauseAttributes.STACKTRACE, GSON.toJson(stacktraceElements)));\n return this;\n }","title":""},{"docid":"7cb501286dc32b120537d0522c571436","score":"0.50541466","text":"public IRubyObject createCallerBacktrace(Ruby runtime, int level) {\n RubyStackTraceElement[] trace = gatherCallerBacktrace(level);\n \n // scrub out .java core class names and replace with Ruby equivalents\n OUTER: for (int i = 0; i < trace.length; i++) {\n RubyStackTraceElement element = trace[i];\n String classDotMethod = element.getClassName() + \".\" + element.getMethodName();\n if (runtime.getBoundMethods().containsKey(classDotMethod)) {\n String rubyName = runtime.getBoundMethods().get(classDotMethod);\n // find first Ruby file+line\n RubyStackTraceElement rubyElement = null;\n for (int j = i; j < trace.length; j++) {\n rubyElement = trace[j];\n if (!rubyElement.getFileName().endsWith(\".java\")) {\n trace[i] = new RubyStackTraceElement(\n element.getClassName(),\n rubyName,\n rubyElement.getFileName(),\n rubyElement.getLineNumber(),\n rubyElement.isBinding(),\n rubyElement.getFrameType());\n continue OUTER;\n }\n }\n // no match, leave it as is\n \n }\n }\n \n RubyArray backtrace = runtime.newArray(trace.length - level);\n \n for (int i = level; i < trace.length; i++) {\n addBackTraceElement(runtime, backtrace, trace[i]);\n }\n \n return backtrace;\n }","title":""},{"docid":"3d02037d9797db9c3e1a825fb2015edf","score":"0.5032095","text":"private static Stack<String> levelTrace() {\n\t\tStack<String> levelTrace = levelTraceTLS.get();\n\t\tif (levelTrace == null) {\n\t\t\tlevelTrace = new Stack<String>();\n\t\t\tlevelTraceTLS.set(levelTrace);\n\t\t}\n\t\treturn levelTrace;\n\t}","title":""},{"docid":"60d491a797ecf010a5a9caab237de587","score":"0.50169796","text":"protected StackFrame getUnderlyingStackFrame() throws DebugException {\n synchronized (fThread) {\n if (fStackFrame == null) {\n if (fDepth == -1) {\n throw new DebugException(new Status(IStatus.ERROR, JDIDebugPlugin.getUniqueIdentifier(), IJavaStackFrame.ERR_INVALID_STACK_FRAME, JDIDebugModelMessages.JDIStackFrame_25, null));\n }\n if (fThread.isSuspended()) {\n // re-index stack frames - See Bug 47198\n fThread.computeStackFrames();\n if (fDepth == -1) {\n // If depth is -1, then this is an invalid frame\n throw new DebugException(new Status(IStatus.ERROR, JDIDebugPlugin.getUniqueIdentifier(), IJavaStackFrame.ERR_INVALID_STACK_FRAME, JDIDebugModelMessages.JDIStackFrame_25, null));\n }\n } else {\n throw new DebugException(new Status(IStatus.ERROR, JDIDebugPlugin.getUniqueIdentifier(), IJavaThread.ERR_THREAD_NOT_SUSPENDED, JDIDebugModelMessages.JDIStackFrame_25, null));\n }\n }\n return fStackFrame;\n }\n }","title":""},{"docid":"72c341480de9ca0c5a529b97717f5f6d","score":"0.500919","text":"public EmptyStackException() {\n }","title":""},{"docid":"90fcca97d4aa8f1c519fe0759bcc4c88","score":"0.49991986","text":"StackTraceWriter getStackTraceWriter();","title":""},{"docid":"bec64334ba1782cb598f8cba29bc486a","score":"0.49909183","text":"@Test(timeout = 4000)\n public void test105() throws Throwable {\n ClassWriter classWriter0 = new ClassWriter(943);\n String[] stringArray0 = new String[5];\n stringArray0[0] = \"_Ew)rOy'*S7|\";\n stringArray0[1] = \"_Ew)rOy'*S7|\";\n classWriter0.addType(\"_Ew)rOy'*S7|\");\n stringArray0[2] = \"_Ew)rOy'*S7|\";\n Item item0 = classWriter0.newFloat(943);\n stringArray0[3] = \"_Ew)rOy'*S7|\";\n stringArray0[4] = \"\";\n MethodWriter methodWriter0 = new MethodWriter(classWriter0, 943, \"_Ew)rOy'*S7|\", \"_Ew)rOy'*S7|\", \"_Ew)rOy'*S7|\", stringArray0, true, true);\n Object[] objectArray0 = new Object[4];\n objectArray0[0] = (Object) item0;\n Object object0 = new Object();\n objectArray0[1] = object0;\n item0.strVal3 = \"\";\n objectArray0[2] = (Object) \"_Ew)rOy'*S7|\";\n objectArray0[3] = (Object) \"_Ew)rOy'*S7|\";\n methodWriter0.visitFrame(943, 2, objectArray0, 1, stringArray0);\n methodWriter0.visitTypeInsn(4123, \"java/lang/Throwable\");\n methodWriter0.visitFieldInsn((-312), \"StackMap\", \"\", \"Code\");\n // Undeclared exception!\n try { \n methodWriter0.visitInsn((-312));\n fail(\"Expecting exception: NullPointerException\");\n \n } catch(NullPointerException e) {\n //\n // no message in exception (getMessage() returned null)\n //\n }\n }","title":""},{"docid":"26e66d583fbf63e99aff3930b57918c9","score":"0.4987955","text":"public void prepareBacktrace(ThreadContext context, boolean nativeException) {\n- boolean fullTrace = false;\n if (backtraceElements == null) {\n- switch (TRACE_TYPE) {\n- case RAW:\n- backtraceElements = ThreadContext.gatherRawBacktrace(getRuntime(), Thread.currentThread().getStackTrace());\n- break;\n- case FULL:\n- fullTrace = true;\n- default:\n- backtraceElements = ThreadContext.gatherHybridBacktrace(\n- context.getRuntime(),\n- context.createBacktrace2(0, nativeException),\n- Thread.currentThread().getStackTrace(),\n- fullTrace);\n- }\n+ backtraceElements = RubyInstanceConfig.TRACE_TYPE.getBacktrace(context, nativeException);\n }\n }","title":""},{"docid":"291ec85894f767f285218b8a2c75ceae","score":"0.49845093","text":"void logError(String message, String stackTrace);","title":""},{"docid":"987fb564ab42a17dfe9a709dec8e8703","score":"0.49746716","text":"public final java.util.List<java.lang.StackTraceElement> c(java.lang.String r8, java.lang.Thread r9, java.util.List<java.lang.StackTraceElement> r10) {\n /*\n r7 = this;\n java.lang.String r0 = \"RUNNING\"\n boolean r8 = kotlin.jvm.internal.Intrinsics.areEqual(r8, r0)\n r0 = 1\n r8 = r8 ^ r0\n if (r8 != 0) goto L_0x00c9\n if (r9 != 0) goto L_0x000e\n goto L_0x00c9\n L_0x000e:\n kotlin.Result$Companion r8 = kotlin.Result.Companion // Catch:{ all -> 0x0019 }\n java.lang.StackTraceElement[] r8 = r9.getStackTrace() // Catch:{ all -> 0x0019 }\n java.lang.Object r8 = kotlin.Result.m242constructorimpl(r8) // Catch:{ all -> 0x0019 }\n goto L_0x0024\n L_0x0019:\n r8 = move-exception\n kotlin.Result$Companion r9 = kotlin.Result.Companion\n java.lang.Object r8 = kotlin.ResultKt.createFailure(r8)\n java.lang.Object r8 = kotlin.Result.m242constructorimpl(r8)\n L_0x0024:\n boolean r9 = kotlin.Result.m247isFailureimpl(r8)\n if (r9 == 0) goto L_0x002b\n r8 = 0\n L_0x002b:\n java.lang.StackTraceElement[] r8 = (java.lang.StackTraceElement[]) r8\n if (r8 == 0) goto L_0x00c9\n int r9 = r8.length\n r1 = 0\n r2 = 0\n L_0x0032:\n r3 = -1\n if (r2 >= r9) goto L_0x0064\n r4 = r8[r2]\n java.lang.String r5 = r4.getClassName()\n java.lang.String r6 = \"kotlin.coroutines.jvm.internal.BaseContinuationImpl\"\n boolean r5 = kotlin.jvm.internal.Intrinsics.areEqual(r5, r6)\n if (r5 == 0) goto L_0x005d\n java.lang.String r5 = r4.getMethodName()\n java.lang.String r6 = \"resumeWith\"\n boolean r5 = kotlin.jvm.internal.Intrinsics.areEqual(r5, r6)\n if (r5 == 0) goto L_0x005d\n java.lang.String r4 = r4.getFileName()\n java.lang.String r5 = \"ContinuationImpl.kt\"\n boolean r4 = kotlin.jvm.internal.Intrinsics.areEqual(r4, r5)\n if (r4 == 0) goto L_0x005d\n r4 = 1\n goto L_0x005e\n L_0x005d:\n r4 = 0\n L_0x005e:\n if (r4 == 0) goto L_0x0061\n goto L_0x0065\n L_0x0061:\n int r2 = r2 + 1\n goto L_0x0032\n L_0x0064:\n r2 = -1\n L_0x0065:\n int r9 = r2 + -1\n int r9 = r7.d(r9, r8, r10)\n if (r9 != r3) goto L_0x007e\n int r9 = r2 + -2\n int r9 = r7.d(r9, r8, r10)\n java.lang.Integer r9 = java.lang.Integer.valueOf(r9)\n java.lang.Boolean r4 = java.lang.Boolean.TRUE\n kotlin.Pair r9 = kotlin.TuplesKt.to(r9, r4)\n goto L_0x0088\n L_0x007e:\n java.lang.Integer r9 = java.lang.Integer.valueOf(r9)\n java.lang.Boolean r4 = java.lang.Boolean.FALSE\n kotlin.Pair r9 = kotlin.TuplesKt.to(r9, r4)\n L_0x0088:\n java.lang.Object r4 = r9.component1()\n java.lang.Number r4 = (java.lang.Number) r4\n int r4 = r4.intValue()\n java.lang.Object r9 = r9.component2()\n java.lang.Boolean r9 = (java.lang.Boolean) r9\n boolean r9 = r9.booleanValue()\n if (r4 != r3) goto L_0x009f\n return r10\n L_0x009f:\n int r3 = r10.size()\n int r3 = r3 + r2\n int r3 = r3 - r4\n int r3 = r3 - r0\n int r3 = r3 - r9\n java.util.ArrayList r5 = new java.util.ArrayList\n r5.<init>(r3)\n int r2 = r2 - r9\n L_0x00ad:\n if (r1 >= r2) goto L_0x00b7\n r9 = r8[r1]\n r5.add(r9)\n int r1 = r1 + 1\n goto L_0x00ad\n L_0x00b7:\n int r4 = r4 + r0\n int r8 = r10.size()\n L_0x00bc:\n if (r4 >= r8) goto L_0x00c8\n java.lang.Object r9 = r10.get(r4)\n r5.add(r9)\n int r4 = r4 + 1\n goto L_0x00bc\n L_0x00c8:\n return r5\n L_0x00c9:\n return r10\n */\n throw new UnsupportedOperationException(\"Method not decompiled: kotlinx.coroutines.debug.internal.DebugProbesImpl.c(java.lang.String, java.lang.Thread, java.util.List):java.util.List\");\n }","title":""},{"docid":"b67f357aa26fc6c02cfe02724b187fd7","score":"0.49439886","text":"com.google.devtools.cloudtrace.v2.StackTrace.StackFrames getStackFrames();","title":""},{"docid":"1509f3f3e88876733cf984316799fb6f","score":"0.49430683","text":"private static void a(Throwable th) {\n ArrayList<a> b2 = b();\n b2.add(new a(th));\n if (b2.size() > 5) {\n b2.remove(0);\n }\n ObjectOutputStream objectOutputStream = null;\n try {\n ObjectOutputStream objectOutputStream2 = new ObjectOutputStream(d.a().openFileOutput(\".exceptiondetail\", 0));\n try {\n objectOutputStream2.writeObject(b2);\n try {\n objectOutputStream2.close();\n } catch (IOException e) {\n j.a(\"MEH\", \"saveException exception\", (Throwable) e);\n }\n } catch (IOException e2) {\n e = e2;\n objectOutputStream = objectOutputStream2;\n try {\n j.a(\"\", (Throwable) e);\n if (objectOutputStream == null) {\n }\n } catch (Throwable th2) {\n th = th2;\n if (objectOutputStream != null) {\n try {\n objectOutputStream.close();\n } catch (IOException e3) {\n j.a(\"MEH\", \"saveException exception\", (Throwable) e3);\n }\n }\n throw th;\n }\n } catch (Throwable th3) {\n th = th3;\n objectOutputStream = objectOutputStream2;\n if (objectOutputStream != null) {\n }\n throw th;\n }\n } catch (IOException e4) {\n e = e4;\n j.a(\"\", (Throwable) e);\n if (objectOutputStream == null) {\n objectOutputStream.close();\n }\n }\n }","title":""},{"docid":"258f20e593837cd7f00362aaf3e3bf01","score":"0.49421644","text":"protected void genExceptionLog(Throwable exception)\r\n/* 142: */ throws Exception\r\n/* 143: */ {\r\n/* 144:153 */ Writer result = new StringWriter();\r\n/* 145:154 */ PrintWriter printWriter = new PrintWriter(result);\r\n/* 146:155 */ exception.printStackTrace(printWriter);\r\n/* 147: */ \r\n/* 148: */ \r\n/* 149:158 */ File file = new File(this.filePath + this.exceptionFileName);\r\n/* 150:159 */ FileOutputStream out = new FileOutputStream(file);\r\n/* 151:160 */ OutputStreamWriter osw = new OutputStreamWriter(out, \"BIG5\");\r\n/* 152: */ \r\n/* 153:162 */ BufferedWriter bw = new BufferedWriter(osw);\r\n/* 154:163 */ bw.write(result.toString());\r\n/* 155: */ \r\n/* 156:165 */ bw.flush();\r\n/* 157: */ \r\n/* 158:167 */ bw.close();\r\n/* 159:168 */ osw.close();\r\n/* 160:169 */ out.close();\r\n/* 161: */ }","title":""},{"docid":"5633d61350a3b00836b7487f7c41abeb","score":"0.49401695","text":"public Caller(int backSteps) {\n Exception e = new Exception();\n StackTraceElement[] trace = e.getStackTrace();\n\n for (int i = trace.length - 1; i >= 0; i--) {\n StackTraceElement element = trace[i];\n if (element.getClassName().equals(Caller.class.getName())) {\n int previ = i + 2 + backSteps;\n if (previ < trace.length) {\n callerElement = trace[previ];\n }\n else {\n callerElement = null;\n }\n break;\n }\n }\n }","title":""},{"docid":"6b0b61ad1246663e381735b78a0d80a3","score":"0.4918855","text":"void trace(Object message, Throwable t);","title":""},{"docid":"d0840784cdc1395edce24e69a4df51bf","score":"0.4904665","text":"StackOverflowException(final String msg) {\n super(msg);\n }","title":""},{"docid":"4764eced59348dae1d402f79398f5835","score":"0.4890184","text":"public static String stackTrace(Throwable t) {\n\t\tStringWriter w = new StringWriter();\n\t\tPrintWriter pw = new PrintWriter(w);\n\t\tt.printStackTrace(pw);\n\t\tpw.flush();\n\t\treturn w.toString();\n\t}","title":""},{"docid":"3ac4355024b8470402385ce0747b5bfe","score":"0.48855475","text":"@Test(timeout = 4000)\n public void test071() throws Throwable {\n ClassWriter classWriter0 = new ClassWriter(943);\n String[] stringArray0 = new String[5];\n stringArray0[0] = \"_Ew)rOy'*S7|\";\n stringArray0[1] = \"_Ew)rOy'*S7|\";\n classWriter0.addType(\"_Ew)rOy'*S7|\");\n stringArray0[2] = \"_Ew)rOy'*S7|\";\n Item item0 = classWriter0.newFloat(943);\n stringArray0[3] = \"_Ew)rOy'*S7|\";\n stringArray0[4] = \"\";\n MethodWriter methodWriter0 = new MethodWriter(classWriter0, 943, \"_Ew)rOy'*S7|\", \"_Ew)rOy'*S7|\", \"_Ew)rOy'*S7|\", stringArray0, true, true);\n Object[] objectArray0 = new Object[4];\n objectArray0[0] = (Object) item0;\n Object object0 = new Object();\n objectArray0[1] = object0;\n item0.strVal3 = \"\";\n objectArray0[2] = (Object) \"_Ew)rOy'*S7|\";\n objectArray0[3] = (Object) \"_Ew)rOy'*S7|\";\n methodWriter0.visitFrame(943, 2, objectArray0, 1, stringArray0);\n methodWriter0.visitTypeInsn(4123, \"java/lang/Throwable\");\n methodWriter0.visitFieldInsn(12, \"StackMap\", \"\", \"Code\");\n methodWriter0.visitInsn(12);\n methodWriter0.visitMethodInsn(1, \"java/lang/Throwable\", \"\", \"java/lang/Throwable\");\n Label label0 = new Label();\n Label label1 = label0.getFirst();\n Label label2 = label1.next;\n methodWriter0.visitTryCatchBlock((Label) null, label0, label0, \"Code\");\n assertSame(label0, label1);\n }","title":""},{"docid":"701e47aee7f284a44b087d869a768a54","score":"0.4858038","text":"public NestingException(Throwable nestedException)\r\n {\r\n this.nestedException = nestedException;\r\n nestedException.printStackTrace();\r\n stackTraceString = generateStackTraceString(nestedException);\r\n }","title":""},{"docid":"46bbbb7e078b3094c0ff64d4c26e14b3","score":"0.48539245","text":"@Test(timeout = 4000)\n public void test004() throws Throwable {\n ClassWriter classWriter0 = new ClassWriter(943);\n String[] stringArray0 = new String[5];\n stringArray0[0] = \"_Ew)rOy'*S7|\";\n stringArray0[1] = \"_Ew)rOy'*S7|\";\n classWriter0.addType(\"_Ew)rOy'*S7|\");\n stringArray0[2] = \"_Ew)rOy'*S7|\";\n Item item0 = classWriter0.newFloat(943);\n stringArray0[3] = \"_Ew)rOy'*S7|\";\n stringArray0[4] = \"\";\n MethodWriter methodWriter0 = new MethodWriter(classWriter0, 943, \"_Ew)rOy'*S7|\", \"_Ew)rOy'*S7|\", \"_Ew)rOy'*S7|\", stringArray0, true, true);\n Object[] objectArray0 = new Object[4];\n objectArray0[0] = (Object) item0;\n Object object0 = new Object();\n objectArray0[1] = object0;\n item0.strVal3 = \"\";\n objectArray0[2] = (Object) \"_Ew)rOy'*S7|\";\n objectArray0[3] = (Object) \"_Ew)rOy'*S7|\";\n methodWriter0.visitFrame(943, 2, objectArray0, 1, stringArray0);\n methodWriter0.visitTypeInsn(4123, \"java/lang/Throwable\");\n classWriter0.visitSource(\"\", \"M<i4iF\");\n methodWriter0.visitFieldInsn(12, \"StackMap\", \"\", \"Code\");\n methodWriter0.visitInsn(12);\n methodWriter0.visitFrame(1, 93, stringArray0, (-4485), stringArray0);\n Edge edge0 = new Edge();\n Label label0 = edge0.successor;\n // Undeclared exception!\n try { \n methodWriter0.visitJumpInsn(14, (Label) null);\n fail(\"Expecting exception: NullPointerException\");\n \n } catch(NullPointerException e) {\n //\n // no message in exception (getMessage() returned null)\n //\n verifyException(\"org.objectweb.asm.jip.MethodWriter\", e);\n }\n }","title":""},{"docid":"43ef5119be8b211923c7a91774c7e764","score":"0.48258975","text":"private static Throwable method_5974(Throwable var0) {\r\n return var0;\r\n }","title":""},{"docid":"bc63bddbd67eef9a47e51fb524832a6d","score":"0.4822028","text":"public StoreException(String msg, Throwable cause) {\r\n super(msg, cause);\r\n }","title":""},{"docid":"449c0c4968343c13a0a95dea090a81fb","score":"0.48142135","text":"private String getStackTrace(Exception e) {\n ByteArrayOutputStream baos = new ByteArrayOutputStream();\n PrintStream printStream = new PrintStream(baos);\n e.printStackTrace(printStream);\n return baos.toString();\n }","title":""},{"docid":"4b4faf9fbbed6e987a2719d19a9603a2","score":"0.47987276","text":"void mo85577a(Exception exc);","title":""},{"docid":"c6ff9f7ff3bf2caf4d64b07571477764","score":"0.4795245","text":"public MyExceptionLogger(String message) {\n super(message);\n trace = new StringWriter();\n PrintWriter pw = new PrintWriter(trace);\n super.printStackTrace(pw);\n logger = Logger.getLogger(\"myLogger\");\n logger.log(Level.SEVERE, trace.toString());\n }","title":""},{"docid":"707799ede71cc9024a08e77b5762db05","score":"0.47873664","text":"public String getExceptionStack() {\n\t\treturn exceptionStack;\n\t}","title":""},{"docid":"123c5b636148746a7346dcec49c674b3","score":"0.477843","text":"com.google.devtools.cloudtrace.v2.StackTrace.StackFramesOrBuilder getStackFramesOrBuilder();","title":""},{"docid":"d10a1d57777fa6ed6e65f679f5515652","score":"0.47742143","text":"public String getStackTraceString()\r\n {\r\n if (nestedException == null)\r\n return null;\r\n StringBuffer traceBuffer = new StringBuffer();\r\n if (nestedException instanceof NestingException)\r\n {\r\n traceBuffer.append(((NestingException) nestedException).getStackTraceString());\r\n traceBuffer.append(\"-------- nested by:\\n\");\r\n }\r\n traceBuffer.append(stackTraceString);\r\n return traceBuffer.toString();\r\n }","title":""},{"docid":"f4d4fc1f524ef326f0268b2bfb841a1c","score":"0.47723863","text":"public final String buildTraceback(final Throwable throwable) {\n\t\tfinal StringWriter stringWriter = new StringWriter();\n\t\tfinal PrintWriter printWriter = new PrintWriter(stringWriter);\n\t\tthrowable.printStackTrace(printWriter);\n\t\tprintWriter.flush();\n\t\tfinal String traceback = stringWriter.toString();\n\t\ttry {\n\t\t\tstringWriter.close();\n\t\t} catch (final IOException e1) {\n\t\t}\n\t\tprintWriter.close();\n\t\treturn traceback;\n\t}","title":""},{"docid":"714b6f891c23c1e45472e5e0a8655db3","score":"0.47458434","text":"@Test(timeout = 4000)\n public void test152() throws Throwable {\n Frame frame0 = new Frame();\n ClassWriter classWriter0 = new ClassWriter(16777228);\n classWriter0.addUninitializedType(\"5E8k=2Z\", 16777228);\n Item item0 = classWriter0.newDouble(25165824);\n // Undeclared exception!\n try { \n frame0.execute(262144, (-1452), classWriter0, item0);\n fail(\"Expecting exception: NullPointerException\");\n \n } catch(NullPointerException e) {\n //\n // no message in exception (getMessage() returned null)\n //\n verifyException(\"wheel.asm.Frame\", e);\n }\n }","title":""},{"docid":"dab9c500d8cc1f8162f1ea868d1e67b2","score":"0.4743507","text":"private void trackException(MonKeyImp key, Throwable exception) {\n String stackTrace = new StringBuilder()\n .append(\"stackTrace=\")\n .append(Misc.getExceptionTrace(exception))\n .toString();\n\n key.setDetails(stackTrace);\n // Specific exception counter. Example: java.lang.RuntimeException\n MonitorFactory.add(new MonKeyImp(exception.getClass().getName(), stackTrace, EXCEPTION), 1);\n // General exception counter which is a total for all exceptions thrown\n MonitorFactory.add(new MonKeyImp(MonitorFactory.EXCEPTIONS_LABEL, stackTrace, EXCEPTION), 1);\n }","title":""},{"docid":"8fa5a721cf2a0683505d5cdee924c17f","score":"0.4741667","text":"private void setCauseStackTrace(Throwable arg0) {\n if (arg0 != null) {\n StringWriter sw = new StringWriter();\n PrintWriter pw = new PrintWriter(sw);\n arg0.printStackTrace(pw);\n setCauseStackTrace(sw.getBuffer().toString());\n }\n }","title":""},{"docid":"d404a982bf1e20056a972ab5d977fb9f","score":"0.47306418","text":"long getStackTraceHashId();","title":""},{"docid":"79cdcc8fb337816490447b7628259583","score":"0.47241047","text":"private String getStackTraceAsString(Exception e) {\n StringWriter writer = new StringWriter();\n PrintWriter pwriter = new PrintWriter(writer);\n e.printStackTrace(pwriter);\n return writer.toString();\n }","title":""},{"docid":"218c99104a4e4c2c73d47525f1ee3f17","score":"0.47193772","text":"@Override\n public Throwable fillInStackTrace() {\n return this;\n }","title":""},{"docid":"b24d96fc541384f59dd4c3e80fa36502","score":"0.47168604","text":"public final void mo30348B(Throwable th) {\n AppMethodBeat.m2504i(118535);\n C25052j.m39376p(th, \"exception\");\n Throwable th2 = this.BQH;\n if (th2 == null) {\n this.BQH = th;\n AppMethodBeat.m2505o(118535);\n } else if (th == th2) {\n AppMethodBeat.m2505o(118535);\n } else {\n th2 = this.BQF;\n if (th2 == null) {\n this.BQF = th;\n AppMethodBeat.m2505o(118535);\n } else if (th2 instanceof Throwable) {\n if (th == th2) {\n AppMethodBeat.m2505o(118535);\n return;\n }\n ArrayList ely = C16458b.ely();\n ely.add(th2);\n ely.add(th);\n this.BQF = ely;\n AppMethodBeat.m2505o(118535);\n } else if (!(th2 instanceof ArrayList)) {\n th2 = new IllegalStateException(\"State is \".concat(String.valueOf(th2)).toString());\n AppMethodBeat.m2505o(118535);\n throw th2;\n } else if (th2 == null) {\n C44941v c44941v = new C44941v(\"null cannot be cast to non-null type kotlin.collections.ArrayList<kotlin.Throwable> /* = java.util.ArrayList<kotlin.Throwable> */\");\n AppMethodBeat.m2505o(118535);\n throw c44941v;\n } else {\n ((ArrayList) th2).add(th);\n AppMethodBeat.m2505o(118535);\n }\n }\n }","title":""},{"docid":"ac5e87778f4cf24addd376e040b50c4c","score":"0.4700967","text":"@Override\n\tpublic void trace(Object message, Throwable t) {\n\n\t}","title":""},{"docid":"f44334e6bda38040d98762d55a39011c","score":"0.4690395","text":"@Override\n @Exported(name = \"exception\")\n public String getErrorStackTrace() {\n if (exception != null) {\n return exception.toString();\n }\n return null;\n }","title":""},{"docid":"79be8a2e059918aaaaa6f7e9eb715467","score":"0.4684171","text":"public static String createElidedStacktrace(Throwable err) {\n StringBuilder sb = new StringBuilder();\n StackTraceElement[] st = err.getStackTrace();\n for (StackTraceElement s : st) {\n String str = s.toString();\n if (!str.startsWith(\"reactor.\")\n && !str.startsWith(\"java.\")\n && !str.startsWith(\"com.couchbase.client.core\")\n && sb.length() > 0) {\n sb.append(sb);\n sb.append(\"; \");\n }\n }\n return sb.toString();\n }","title":""},{"docid":"27580f1045a626f3d1114484d52a910f","score":"0.46757036","text":"private StackTraceElement unwindStackTrace() {\n final StackTraceElement[] stes = Thread.currentThread().getStackTrace();\n int offset = 0;\n while (offset < stes.length\n && (stes[offset].getClassName().equals(THREAD_CLASS_NAME) || stes[offset]\n .getClassName().equals(LOGHELPER_CLASS_NAME))) {\n ++offset;\n }\n return stes[offset];\n }","title":""},{"docid":"34e1ada07351131a4ca79f156d1f4efe","score":"0.46672994","text":"public Log(Level level, Throwable exception, String callerClass, String callerMethod, Integer callerLine) {\n this.level = level;\n this.exception = exception;\n this.callerClass = callerClass;\n this.callerMethod = callerMethod;\n this.callerLine = callerLine;\n setOtherFields();\n }","title":""},{"docid":"e52dee9e0a42d9b11b82d54948eb218d","score":"0.46666372","text":"public DBAnalyticsException(Throwable cause) {\n\t\tthis(cause, (String) null);\n\n\t}","title":""},{"docid":"36582649ec7bc3e776a8e9fcf04dc8c4","score":"0.46588922","text":"public StackUnderflowException(String message)\r\n\t{\r\n\t\tsuper(message);\r\n\t}","title":""},{"docid":"b138a0878255e75a87b343436e31607f","score":"0.4655342","text":"@Test(timeout = 4000)\n public void test073() throws Throwable {\n Frame frame0 = new Frame();\n ClassWriter classWriter0 = new ClassWriter(1889);\n Item item0 = classWriter0.newConstItem(\"java/lang/Object\");\n // Undeclared exception!\n try { \n frame0.execute(110, 1687, classWriter0, item0);\n fail(\"Expecting exception: NullPointerException\");\n \n } catch(NullPointerException e) {\n //\n // no message in exception (getMessage() returned null)\n //\n verifyException(\"wheel.asm.Frame\", e);\n }\n }","title":""},{"docid":"c3636c7b9f56406cfd68b98e9da6d0f7","score":"0.46544993","text":"@Test(timeout = 4000)\n public void test119() throws Throwable {\n Frame frame0 = new Frame();\n ClassWriter classWriter0 = new ClassWriter(157);\n Item item0 = classWriter0.newFloat(157);\n // Undeclared exception!\n try { \n frame0.execute(40, 157, classWriter0, item0);\n fail(\"Expecting exception: NullPointerException\");\n \n } catch(NullPointerException e) {\n //\n // no message in exception (getMessage() returned null)\n //\n verifyException(\"wheel.asm.Frame\", e);\n }\n }","title":""},{"docid":"d2b3a386feaa912167c73426bdb877c2","score":"0.46375138","text":"public static String getStackTrace(Throwable t) {\n try {\n StringWriter sw = new StringWriter();\n\n t.printStackTrace(new PrintWriter(sw));\n sw.close();\n return sw.toString();\n } catch (Exception e) {\n return null;\n }\n }","title":""},{"docid":"f8673610d4a458da1113ede8ff3959c3","score":"0.4637275","text":"public void stackTrace(Throwable e) {\n\t\te.printStackTrace(System.err);\n\t\tSystem.err.flush();\n\t}","title":""},{"docid":"b8f28013f84c1a1bc426f4ad693e0b34","score":"0.46294507","text":"public static void m5215a(Context context, String str, Throwable th) {\n String str2;\n if (cbvp.m128521h()) {\n if (th != null) {\n str2 = Log.getStackTraceString(th);\n } else {\n str2 = \"NULL_EXCEPTION\";\n }\n Bundle bundle = new Bundle();\n bundle.putString(\"error_type\", str);\n bundle.putString(\"exception\", str2);\n m5212a(context, bundle);\n }\n }","title":""},{"docid":"8d8df55ed82c16ae0cc0da2d2442c5a5","score":"0.46275926","text":"private static Exception method_650(Exception var0) {\r\n return var0;\r\n }","title":""},{"docid":"9a4352ec6e63069f4789826efa38b520","score":"0.46206585","text":"public OverflowException(){}","title":""},{"docid":"4e05c88c08b8a2e9e80d54460850d7af","score":"0.46096772","text":"private ImmutableStackEntry stackEntry(Location location, int scope) {\n\t\treturn new ImmutableStackEntry(location, scope);\n\t}","title":""},{"docid":"6dc69abccfe180cdb5cbdfc735e09a85","score":"0.46077144","text":"@Test(timeout = 4000)\n public void test173() throws Throwable {\n Frame frame0 = new Frame();\n ClassWriter classWriter0 = new ClassWriter(16777230);\n classWriter0.visitAnnotation(\"(sZ_{}R/m@=[\", false);\n Item item0 = classWriter0.newDouble(25165824);\n // Undeclared exception!\n try { \n frame0.execute(262144, (-1452), classWriter0, item0);\n fail(\"Expecting exception: NullPointerException\");\n \n } catch(NullPointerException e) {\n //\n // no message in exception (getMessage() returned null)\n //\n verifyException(\"wheel.asm.Frame\", e);\n }\n }","title":""},{"docid":"404548ec4141d650d1cf21e347628608","score":"0.46074396","text":"@Test(timeout = 4000)\n public void test117() throws Throwable {\n Frame frame0 = new Frame();\n ClassWriter classWriter0 = new ClassWriter(2312);\n // Undeclared exception!\n try { \n frame0.execute(42, 1500, classWriter0, (Item) null);\n fail(\"Expecting exception: NullPointerException\");\n \n } catch(NullPointerException e) {\n //\n // no message in exception (getMessage() returned null)\n //\n verifyException(\"wheel.asm.Frame\", e);\n }\n }","title":""},{"docid":"6c0a24d77089738a2634ca72816b5ab1","score":"0.46045414","text":"public void setExceptionStack(String exceptionStack) {\n\t\tthis.exceptionStack = exceptionStack;\n\t}","title":""},{"docid":"5c022da6653ea8194e1b11306fc70cdf","score":"0.4604439","text":"@Test(timeout = 4000)\n public void test174() throws Throwable {\n Frame frame0 = new Frame();\n ClassWriter classWriter0 = new ClassWriter(138);\n Label label0 = new Label();\n frame0.owner = label0;\n Item item0 = classWriter0.key;\n frame0.execute(138, 2447, classWriter0, item0);\n // Undeclared exception!\n try { \n frame0.execute(2447, 178, classWriter0, item0);\n fail(\"Expecting exception: NullPointerException\");\n \n } catch(NullPointerException e) {\n //\n // no message in exception (getMessage() returned null)\n //\n verifyException(\"wheel.asm.Frame\", e);\n }\n }","title":""},{"docid":"35f79be59fd45a783fc704e256e6f161","score":"0.4604371","text":"ExceptionType createExceptionType();","title":""},{"docid":"69657d80fe56f00464c427671ace344a","score":"0.46042284","text":"static public String exceptionTraceToString(Throwable throwableException) {\n StringWriter sw = new StringWriter();\n PrintWriter pw = new PrintWriter(sw);\n throwableException.printStackTrace(pw);\n String sStackTrace = sw.toString();\n return sStackTrace;\n }","title":""},{"docid":"69b278e16f6b49833d0d8ad5bb8de4ad","score":"0.46040246","text":"@Test(timeout = 4000)\n public void test027() throws Throwable {\n Frame frame0 = new Frame();\n ClassWriter classWriter0 = new ClassWriter(2081);\n Item item0 = classWriter0.newDouble((-1618.965255341501));\n // Undeclared exception!\n try { \n frame0.execute(191, 4, classWriter0, item0);\n fail(\"Expecting exception: NullPointerException\");\n \n } catch(NullPointerException e) {\n //\n // no message in exception (getMessage() returned null)\n //\n verifyException(\"wheel.asm.Frame\", e);\n }\n }","title":""},{"docid":"0784f1103ba39fb541018a36132eb807","score":"0.46038494","text":"@Test(timeout = 4000)\n public void test053() throws Throwable {\n Frame frame0 = new Frame();\n ClassWriter classWriter0 = new ClassWriter(1148);\n Item item0 = classWriter0.newFloat(1148);\n // Undeclared exception!\n try { \n frame0.execute(157, 1, classWriter0, item0);\n fail(\"Expecting exception: NullPointerException\");\n \n } catch(NullPointerException e) {\n //\n // no message in exception (getMessage() returned null)\n //\n verifyException(\"wheel.asm.Frame\", e);\n }\n }","title":""},{"docid":"2d274ef2f01a45a087eef14c602cb259","score":"0.4601437","text":"public RollbackException(Throwable cause) {\r\n super(cause);\r\n }","title":""},{"docid":"2c7779b93b8795b7121a780c4f66c4d6","score":"0.4597479","text":"@Test(timeout = 4000)\n public void test141() throws Throwable {\n ClassWriter classWriter0 = new ClassWriter(18);\n String[] stringArray0 = new String[2];\n stringArray0[0] = \"S-$*(/+ab4)X5~\";\n stringArray0[1] = \"LineNumberTable\";\n MethodWriter methodWriter0 = new MethodWriter(classWriter0, (-1482286481), \"S-$*(/+ab4)X5~\", \"S-$*(/+ab4)X5~\", \"LineNumberTable\", stringArray0, false, false);\n methodWriter0.visitFrame(18, (-1482286481), stringArray0, 18, stringArray0);\n // Undeclared exception!\n try { \n methodWriter0.visitFrame((-3), 18, stringArray0, 101, stringArray0);\n fail(\"Expecting exception: IllegalStateException\");\n \n } catch(IllegalStateException e) {\n //\n // no message in exception (getMessage() returned null)\n //\n verifyException(\"org.objectweb.asm.jip.MethodWriter\", e);\n }\n }","title":""},{"docid":"988fe4201c6909c34492bd2d26e8fc8b","score":"0.45972005","text":"@Test(timeout = 4000)\n public void test097() throws Throwable {\n Frame frame0 = new Frame();\n ClassWriter classWriter0 = new ClassWriter(1918);\n Item item0 = classWriter0.newInteger(359);\n // Undeclared exception!\n try { \n frame0.execute(72, 72, classWriter0, item0);\n fail(\"Expecting exception: NullPointerException\");\n \n } catch(NullPointerException e) {\n //\n // no message in exception (getMessage() returned null)\n //\n verifyException(\"wheel.asm.Frame\", e);\n }\n }","title":""},{"docid":"b64253e07ac59f14353aca86901f0b81","score":"0.4595942","text":"@Test(timeout = 4000)\n public void test116() throws Throwable {\n Frame frame0 = new Frame();\n ClassWriter classWriter0 = new ClassWriter(2417);\n Item item0 = classWriter0.newDouble(1478.6038);\n // Undeclared exception!\n try { \n frame0.execute(43, 16777218, classWriter0, item0);\n fail(\"Expecting exception: NullPointerException\");\n \n } catch(NullPointerException e) {\n //\n // no message in exception (getMessage() returned null)\n //\n verifyException(\"wheel.asm.Frame\", e);\n }\n }","title":""},{"docid":"ca5c2d0e8af59212364cd888469507cc","score":"0.45914587","text":"@Test(timeout = 4000)\n public void test131() throws Throwable {\n ClassWriter classWriter0 = new ClassWriter(169);\n MethodWriter methodWriter0 = new MethodWriter(classWriter0, 1, \"LineNumberTable\", \"MfmYEHAR]`?j)H\", \"4qWq \", (String[]) null, true, false);\n // Undeclared exception!\n try { \n methodWriter0.visitFrame((-1), (-208), (Object[]) null, 127, (Object[]) null);\n fail(\"Expecting exception: NegativeArraySizeException\");\n \n } catch(NegativeArraySizeException e) {\n //\n // no message in exception (getMessage() returned null)\n //\n verifyException(\"org.objectweb.asm.jip.MethodWriter\", e);\n }\n }","title":""},{"docid":"d6b389e67cb5e73dade18a5cdd4e0143","score":"0.4587724","text":"public Log(Level level, String message, Throwable exception, String callerClass, String callerMethod, Integer callerLine) {\n this.level = level;\n this.message = message;\n this.exception = exception;\n this.callerClass = callerClass;\n this.callerMethod = callerMethod;\n this.callerLine = callerLine;\n setOtherFields();\n }","title":""},{"docid":"4d233d6963ba5ed293ef672ebb0b3cdd","score":"0.45820782","text":"public StackFrame getStackFrame();","title":""},{"docid":"e6333f4e7f6edbc4d76b582078a34da3","score":"0.4574734","text":"public Backtrace[] createBacktrace2(int level, boolean nativeException) {\n Backtrace[] newTrace = new Backtrace[backtraceIndex + 1];\n for (int i = 0; i <= backtraceIndex; i++) {\n newTrace[i] = backtrace[i].clone();\n }\n return newTrace;\n }","title":""},{"docid":"5707dc5f41e34b7d731403fe1f31a8bf","score":"0.45690614","text":"@Test(timeout = 4000)\n public void test114() throws Throwable {\n Frame frame0 = new Frame();\n ClassWriter classWriter0 = new ClassWriter(1898);\n Item item0 = classWriter0.key;\n // Undeclared exception!\n try { \n frame0.execute(46, 2, classWriter0, item0);\n fail(\"Expecting exception: NullPointerException\");\n \n } catch(NullPointerException e) {\n //\n // no message in exception (getMessage() returned null)\n //\n verifyException(\"wheel.asm.Frame\", e);\n }\n }","title":""},{"docid":"b4fa574ede93056ed00f684f0f7ae421","score":"0.45668688","text":"public String build(LogTrace logTrace) throws IllegalAccessException;","title":""},{"docid":"b6e0780088de49e29fffa2bc8b15595d","score":"0.456548","text":"@Test(timeout = 4000)\n public void test133() throws Throwable {\n Frame frame0 = new Frame();\n ClassWriter classWriter0 = new ClassWriter(126);\n Item item0 = classWriter0.newDouble(0.0);\n // Undeclared exception!\n try { \n frame0.execute(18, 450, classWriter0, item0);\n fail(\"Expecting exception: NullPointerException\");\n \n } catch(NullPointerException e) {\n //\n // no message in exception (getMessage() returned null)\n //\n verifyException(\"wheel.asm.Frame\", e);\n }\n }","title":""},{"docid":"e8bc9de0fc67a5c11c02c1b4c5fcc67f","score":"0.45603523","text":"@Test(timeout = 4000)\n public void test001() throws Throwable {\n Frame frame0 = new Frame();\n ClassWriter classWriter0 = new ClassWriter(16777228);\n Item item0 = classWriter0.newDouble(2);\n item0.set(453, \"\\\" SP\", \"\\\" SP\", \"\\\" SP\");\n // Undeclared exception!\n try { \n frame0.execute(179, 179, classWriter0, item0);\n fail(\"Expecting exception: NullPointerException\");\n \n } catch(NullPointerException e) {\n //\n // no message in exception (getMessage() returned null)\n //\n verifyException(\"wheel.asm.Frame\", e);\n }\n }","title":""},{"docid":"267d2870fb53829416373a3434bd5c17","score":"0.45578763","text":"public StackTraceElement[] getStackTrace(){\n\t\t\tStackTraceElement[] ste = super.getStackTrace();\n\t\t\tStackTraceElement[] s = new StackTraceElement[1];\n\t\t\ts[0] = ste[ste.length-1];\n\t\t\treturn s;\n\t\t}","title":""},{"docid":"fcea27b968fbe12e634edf5fe6e7fb84","score":"0.45561805","text":"public IModelElementTrace getOrCreateModelElementTrace(Object element) throws EolIncrementalExecutionException {\n//\t\tlogger.info(\"Creting ModelElementTrace for {}\", element);\n//\t\tString elementId = model.getElementId(element);\n//\t\tif (modelElementTraces.containsKey(elementId)) {\n//\t\t\tlogger.info(\"Retreiving ModelElementTrace from cache\");\n//\t\t\treturn modelElementTraces.get(elementId);\n//\t\t}\n//\t\tif (!model.owns(element)) {\n//\t\t\tthrow new EolIncrementalExecutionException(\"Model does not know about element \" + element);\n//\t\t}\n\t\tIModelElementTrace trace = null;\n//\t\ttry {\n//\t\t\tlogger.info(\"Creating new ModelElementTrace\");\n//\t\t\ttrace = new ModelElementTrace(elementId, modelTrace);\n//\t\t} catch (TraceModelDuplicateRelation e) {\n//\t\t\tthrow new EolIncrementalExecutionException(\"Error creating ModelElementTrace trace for \" + element);\n//\t\t}\n//\t\tmodelElementTraces.put(elementId, trace);\n\t\treturn trace;\n\t}","title":""},{"docid":"5ae20f1215eddd99c0d792b8e24ce591","score":"0.45547763","text":"@Test(timeout = 4000)\n public void test083() throws Throwable {\n Frame frame0 = new Frame();\n ClassWriter classWriter0 = new ClassWriter((-1401));\n Item item0 = classWriter0.newDouble(0);\n // Undeclared exception!\n try { \n frame0.execute(89, (-1432), (ClassWriter) null, item0);\n fail(\"Expecting exception: NullPointerException\");\n \n } catch(NullPointerException e) {\n //\n // no message in exception (getMessage() returned null)\n //\n verifyException(\"wheel.asm.Frame\", e);\n }\n }","title":""}],"string":"[\n {\n \"docid\": \"125b662a6538e7100d359534be148292\",\n \"score\": \"0.6146035\",\n \"text\": \"private void throwStackException() {\\n try {\\n throw new Exception(\\\"stack underflow exception\\\");\\n } catch (Exception ex) {\\n ex.printStackTrace();\\n s = new Stack();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5b4701545f105751d3c8acc64f7cbfd6\",\n \"score\": \"0.57426846\",\n \"text\": \"public synchronized Throwable fillInStackTrace() {\\n/* 16 */ return this;\\n/* */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6e413c28e2e29c4ace4a175defca2be7\",\n \"score\": \"0.5579829\",\n \"text\": \"@Test(timeout = 4000)\\n public void test001() throws Throwable {\\n ClassWriter classWriter0 = new ClassWriter(943);\\n String[] stringArray0 = new String[5];\\n stringArray0[0] = \\\"_Ew)rOy'*S7|\\\";\\n stringArray0[1] = \\\"_Ew)rOy'*S7|\\\";\\n int int0 = MethodWriter.SAME_LOCALS_1_STACK_ITEM_FRAME_EXTENDED;\\n stringArray0[2] = \\\"_Ew)rOy'*S7|\\\";\\n Item item0 = classWriter0.newFloat(943);\\n stringArray0[3] = \\\"_Ew)rOy'*S7|\\\";\\n stringArray0[4] = \\\"_Ew)rOy'*S7|\\\";\\n MethodWriter methodWriter0 = new MethodWriter(classWriter0, 2, \\\"_Ew)rOy'*S7|\\\", \\\"_Ew)rOy'*S7|\\\", \\\"_Ew)rOy'*S7|\\\", stringArray0, true, true);\\n Object[] objectArray0 = new Object[4];\\n objectArray0[0] = (Object) item0;\\n Object object0 = new Object();\\n objectArray0[1] = object0;\\n item0.strVal3 = \\\"_Ew)rOy'*S7|\\\";\\n objectArray0[2] = (Object) \\\"_Ew)rOy'*S7|\\\";\\n objectArray0[3] = (Object) \\\"_Ew)rOy'*S7|\\\";\\n methodWriter0.visitFrame(943, 2, objectArray0, 247, stringArray0);\\n methodWriter0.visitTypeInsn(4088, \\\"java/lang/Throwable\\\");\\n item0.index = 4125;\\n methodWriter0.visitFieldInsn(12, \\\"StackMap\\\", \\\"\\\", \\\"_Ew)rOy'*S7|\\\");\\n methodWriter0.visitInsn(12);\\n methodWriter0.visitMethodInsn(1, \\\"java/lang/Throwable\\\", \\\"_Ew)rOy'*S7|\\\", \\\"java/lang/Throwable\\\");\\n Label label0 = new Label();\\n label0.getFirst();\\n Label label1 = label0.getFirst();\\n methodWriter0.visitTryCatchBlock(label1, label0, label0, \\\"C)v!4\\\");\\n methodWriter0.visitIincInsn(1, 69);\\n methodWriter0.visitFieldInsn((-3092), \\\"_Ew)rOy'*S7|\\\", \\\"RuntimeInvisibleParameterAnnotations\\\", \\\"_Ew)rOy'*S7|\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5484f64483d0fc3f02b1b768fe3130f5\",\n \"score\": \"0.55081624\",\n \"text\": \"public StackTrace() {\\n final StackTraceElement[] stack = Thread.currentThread().getStackTrace();\\n // Skip first two elements to remove getStackTrace/StackTrace.<init>\\n stackTraceElements = Arrays.copyOfRange(stack, 2, stack.length);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fccbca8d5f1688b8334e4ea2ff79a575\",\n \"score\": \"0.5441383\",\n \"text\": \"StackOverflowException() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bebfe005318ad77dabb6fccd0d17bdf5\",\n \"score\": \"0.5411759\",\n \"text\": \"public String getStack() {\\r\\n\\t\\tif (stackTrace == null) {\\r\\n\\t\\t\\tif (stack == null) {\\r\\n\\t\\t\\t\\tStringWriter sw = new StringWriter(512);\\r\\n\\t\\t\\t\\tPrintWriter pw = new PrintWriter(sw, true);\\r\\n\\t\\t\\t\\tThrowable cause = getCause();\\r\\n\\t\\t\\t\\tif (cause == null) {\\r\\n\\t\\t\\t\\t\\tsuper.printStackTrace(pw);\\r\\n\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\tcause.printStackTrace(pw);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tstackTrace = sw.toString().trim();\\r\\n\\t\\t\\t} else {\\r\\n\\t\\t\\t\\tstackTrace = stack.trim();\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\treturn stackTrace;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ba02500c4b8f0e477b2811e2cc5c125\",\n \"score\": \"0.54057413\",\n \"text\": \"public void writeStackTrace(final Exception exception);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8ddf746ac8c7facddba9accd8b050354\",\n \"score\": \"0.5405387\",\n \"text\": \"void createException(String reason, Object caller);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"64e4b6c9f6ecf99527c3fd9c7bd361b2\",\n \"score\": \"0.5380813\",\n \"text\": \"@Test(timeout = 4000)\\n public void test010() throws Throwable {\\n ClassWriter classWriter0 = new ClassWriter(943);\\n String[] stringArray0 = new String[5];\\n stringArray0[0] = \\\"_Ew)rOy'*S7|\\\";\\n stringArray0[1] = \\\"_Ew)rOy'*S7|\\\";\\n int int0 = MethodWriter.SAME_LOCALS_1_STACK_ITEM_FRAME_EXTENDED;\\n stringArray0[2] = \\\"_Ew)rOy'*S7|\\\";\\n Item item0 = classWriter0.newFloat(943);\\n stringArray0[3] = \\\"_Ew)rOy'*S7|\\\";\\n stringArray0[4] = \\\"_Ew)rOy'*S7|\\\";\\n MethodWriter methodWriter0 = new MethodWriter(classWriter0, 943, \\\"_Ew)rOy'*S7|\\\", \\\"_Ew)rOy'*S7|\\\", \\\"_Ew)rOy'*S7|\\\", stringArray0, true, true);\\n Object[] objectArray0 = new Object[4];\\n objectArray0[0] = (Object) item0;\\n Object object0 = new Object();\\n objectArray0[1] = object0;\\n item0.strVal3 = \\\"_Ew)rOy'*S7|\\\";\\n objectArray0[2] = (Object) \\\"_Ew)rOy'*S7|\\\";\\n objectArray0[3] = (Object) \\\"_Ew)rOy'*S7|\\\";\\n methodWriter0.visitFrame(943, 2, objectArray0, 247, stringArray0);\\n methodWriter0.visitTypeInsn(4123, \\\"java/lang/Throwable\\\");\\n item0.index = 4125;\\n methodWriter0.visitFieldInsn(12, \\\"StackMap\\\", \\\"\\\", \\\"_Ew)rOy'*S7|\\\");\\n methodWriter0.visitInsn(12);\\n methodWriter0.visitMethodInsn(1, \\\"java/lang/Throwable\\\", \\\"_Ew)rOy'*S7|\\\", \\\"java/lang/Throwable\\\");\\n Label label0 = new Label();\\n label0.getFirst();\\n Label label1 = label0.getFirst();\\n label1.inputStackTop = 943;\\n methodWriter0.visitTryCatchBlock(label1, label0, label0, \\\"C)v!4\\\");\\n methodWriter0.visitIincInsn(1, 69);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c2c2fbcbfdd0765d1ef6e4c9f0fd068f\",\n \"score\": \"0.5377543\",\n \"text\": \"@Override\\n public synchronized java.lang.Throwable fillInStackTrace() {\\n // no need to do anything we will overwrite this.\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"02fc1bd2de883f867ae233d72e83ba33\",\n \"score\": \"0.5371984\",\n \"text\": \"public void setStackTrace(StackTrace stackTrace) {\\n this.stackTrace = stackTrace;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1e42ecbb1da2a4accb8124a672461537\",\n \"score\": \"0.53592473\",\n \"text\": \"public Frame[] createBacktrace(int level, boolean nativeException) {\\n int traceSize = frameIndex - level + 1;\\n Frame[] traceFrames;\\n \\n if (traceSize <= 0) return null;\\n \\n if (nativeException) {\\n // assert level == 0;\\n traceFrames = new Frame[traceSize + 1];\\n traceFrames[traceSize] = frameStack[frameIndex];\\n } else {\\n traceFrames = new Frame[traceSize];\\n }\\n \\n System.arraycopy(frameStack, 0, traceFrames, 0, traceSize);\\n \\n return traceFrames;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"49b17aeb81028b7922e2f9d643f9a0e7\",\n \"score\": \"0.53502244\",\n \"text\": \"public StackTrace getStackTrace() {\\n return stackTrace;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"88b970101503cbe95fba826a9d7026d4\",\n \"score\": \"0.53358597\",\n \"text\": \"public void stackTrace(String msg) {\\n\\t\\tException e = new Exception(msg);\\n\\t\\tSystem.err.println(\\\"Forcing stack trace: \\\" + msg);\\n\\t\\tstackTrace(e);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"64ec3cbd46a78439e9ad7a5cd1984087\",\n \"score\": \"0.5322822\",\n \"text\": \"public void fillInStackTrace() {\\n stackTrace = $.getStackTrace();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3eb6f65e83d6957342cd6ae250781773\",\n \"score\": \"0.5195854\",\n \"text\": \"public StackOverflowException(String stack_is_full) {\\n super(stack_is_full);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"af717fda4e0d7069c9ad0ed1116010cf\",\n \"score\": \"0.51919323\",\n \"text\": \"public StoreException(Throwable cause) {\\r\\n super(cause);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a98e072689c5b33ef551099d0ec38c0\",\n \"score\": \"0.51545936\",\n \"text\": \"public StackUnderflowException()\\r\\n\\t{\\r\\n\\t\\tsuper(\\\"Stack Underflow\\\");\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a6743892f8816f0a66f5207ae12098a7\",\n \"score\": \"0.5152756\",\n \"text\": \"public EmptyStackException() {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"423b1702f6c76eddf0ecb12e97e84db0\",\n \"score\": \"0.514187\",\n \"text\": \"public CrashReport(Throwable throwable) { this.exception = throwable; }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d2dfb291656416c2e27993e81f565136\",\n \"score\": \"0.5121362\",\n \"text\": \"Exception createException();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2003ef628153f2be9f65aad91af3184d\",\n \"score\": \"0.51182735\",\n \"text\": \"private static Object convertThrowableToStackTrace(final Object message) {\\n\\n return ((message != null) && (message instanceof Throwable))\\n ? ExceptionUtils.getStackTrace((Throwable) message)\\n : message;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0573d3bb1dc1045d572f586b5eed2827\",\n \"score\": \"0.51177454\",\n \"text\": \"public String getStacktrace() {\\r\\n return stacktrace;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8438d7f169681f917e2cc44d74d91812\",\n \"score\": \"0.509644\",\n \"text\": \"public StackOverflowException(String reason) {\\r\\n\\t\\tsuper(reason);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b295793027bbc9e4988fe6aa3569f4d1\",\n \"score\": \"0.50878143\",\n \"text\": \"public RemoteTestException(Throwable e)\\n {\\n remoteThrowable = e;\\n\\n StringWriter stringWriter = new StringWriter();\\n PrintWriter writer = new PrintWriter(stringWriter);\\n e.printStackTrace(writer);\\n StringBuffer buffer = stringWriter.getBuffer();\\n remoteStackTrace = buffer.toString();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"be054f63044709c9de814bc809eda244\",\n \"score\": \"0.50811064\",\n \"text\": \"public void setStacktrace(String stacktrace) {\\r\\n this.stacktrace = stacktrace;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3a0e772e9acca0ae4ca64058ce6203e2\",\n \"score\": \"0.50579804\",\n \"text\": \"public ValidationFailure withStacktrace(StackTraceElement[] stacktraceElements) {\\n causes.add(\\n new Cause().addAttribute(CauseAttributes.STACKTRACE, GSON.toJson(stacktraceElements)));\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7cb501286dc32b120537d0522c571436\",\n \"score\": \"0.50541466\",\n \"text\": \"public IRubyObject createCallerBacktrace(Ruby runtime, int level) {\\n RubyStackTraceElement[] trace = gatherCallerBacktrace(level);\\n \\n // scrub out .java core class names and replace with Ruby equivalents\\n OUTER: for (int i = 0; i < trace.length; i++) {\\n RubyStackTraceElement element = trace[i];\\n String classDotMethod = element.getClassName() + \\\".\\\" + element.getMethodName();\\n if (runtime.getBoundMethods().containsKey(classDotMethod)) {\\n String rubyName = runtime.getBoundMethods().get(classDotMethod);\\n // find first Ruby file+line\\n RubyStackTraceElement rubyElement = null;\\n for (int j = i; j < trace.length; j++) {\\n rubyElement = trace[j];\\n if (!rubyElement.getFileName().endsWith(\\\".java\\\")) {\\n trace[i] = new RubyStackTraceElement(\\n element.getClassName(),\\n rubyName,\\n rubyElement.getFileName(),\\n rubyElement.getLineNumber(),\\n rubyElement.isBinding(),\\n rubyElement.getFrameType());\\n continue OUTER;\\n }\\n }\\n // no match, leave it as is\\n \\n }\\n }\\n \\n RubyArray backtrace = runtime.newArray(trace.length - level);\\n \\n for (int i = level; i < trace.length; i++) {\\n addBackTraceElement(runtime, backtrace, trace[i]);\\n }\\n \\n return backtrace;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3d02037d9797db9c3e1a825fb2015edf\",\n \"score\": \"0.5032095\",\n \"text\": \"private static Stack<String> levelTrace() {\\n\\t\\tStack<String> levelTrace = levelTraceTLS.get();\\n\\t\\tif (levelTrace == null) {\\n\\t\\t\\tlevelTrace = new Stack<String>();\\n\\t\\t\\tlevelTraceTLS.set(levelTrace);\\n\\t\\t}\\n\\t\\treturn levelTrace;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"60d491a797ecf010a5a9caab237de587\",\n \"score\": \"0.50169796\",\n \"text\": \"protected StackFrame getUnderlyingStackFrame() throws DebugException {\\n synchronized (fThread) {\\n if (fStackFrame == null) {\\n if (fDepth == -1) {\\n throw new DebugException(new Status(IStatus.ERROR, JDIDebugPlugin.getUniqueIdentifier(), IJavaStackFrame.ERR_INVALID_STACK_FRAME, JDIDebugModelMessages.JDIStackFrame_25, null));\\n }\\n if (fThread.isSuspended()) {\\n // re-index stack frames - See Bug 47198\\n fThread.computeStackFrames();\\n if (fDepth == -1) {\\n // If depth is -1, then this is an invalid frame\\n throw new DebugException(new Status(IStatus.ERROR, JDIDebugPlugin.getUniqueIdentifier(), IJavaStackFrame.ERR_INVALID_STACK_FRAME, JDIDebugModelMessages.JDIStackFrame_25, null));\\n }\\n } else {\\n throw new DebugException(new Status(IStatus.ERROR, JDIDebugPlugin.getUniqueIdentifier(), IJavaThread.ERR_THREAD_NOT_SUSPENDED, JDIDebugModelMessages.JDIStackFrame_25, null));\\n }\\n }\\n return fStackFrame;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"72c341480de9ca0c5a529b97717f5f6d\",\n \"score\": \"0.500919\",\n \"text\": \"public EmptyStackException() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"90fcca97d4aa8f1c519fe0759bcc4c88\",\n \"score\": \"0.49991986\",\n \"text\": \"StackTraceWriter getStackTraceWriter();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bec64334ba1782cb598f8cba29bc486a\",\n \"score\": \"0.49909183\",\n \"text\": \"@Test(timeout = 4000)\\n public void test105() throws Throwable {\\n ClassWriter classWriter0 = new ClassWriter(943);\\n String[] stringArray0 = new String[5];\\n stringArray0[0] = \\\"_Ew)rOy'*S7|\\\";\\n stringArray0[1] = \\\"_Ew)rOy'*S7|\\\";\\n classWriter0.addType(\\\"_Ew)rOy'*S7|\\\");\\n stringArray0[2] = \\\"_Ew)rOy'*S7|\\\";\\n Item item0 = classWriter0.newFloat(943);\\n stringArray0[3] = \\\"_Ew)rOy'*S7|\\\";\\n stringArray0[4] = \\\"\\\";\\n MethodWriter methodWriter0 = new MethodWriter(classWriter0, 943, \\\"_Ew)rOy'*S7|\\\", \\\"_Ew)rOy'*S7|\\\", \\\"_Ew)rOy'*S7|\\\", stringArray0, true, true);\\n Object[] objectArray0 = new Object[4];\\n objectArray0[0] = (Object) item0;\\n Object object0 = new Object();\\n objectArray0[1] = object0;\\n item0.strVal3 = \\\"\\\";\\n objectArray0[2] = (Object) \\\"_Ew)rOy'*S7|\\\";\\n objectArray0[3] = (Object) \\\"_Ew)rOy'*S7|\\\";\\n methodWriter0.visitFrame(943, 2, objectArray0, 1, stringArray0);\\n methodWriter0.visitTypeInsn(4123, \\\"java/lang/Throwable\\\");\\n methodWriter0.visitFieldInsn((-312), \\\"StackMap\\\", \\\"\\\", \\\"Code\\\");\\n // Undeclared exception!\\n try { \\n methodWriter0.visitInsn((-312));\\n fail(\\\"Expecting exception: NullPointerException\\\");\\n \\n } catch(NullPointerException e) {\\n //\\n // no message in exception (getMessage() returned null)\\n //\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"26e66d583fbf63e99aff3930b57918c9\",\n \"score\": \"0.4987955\",\n \"text\": \"public void prepareBacktrace(ThreadContext context, boolean nativeException) {\\n- boolean fullTrace = false;\\n if (backtraceElements == null) {\\n- switch (TRACE_TYPE) {\\n- case RAW:\\n- backtraceElements = ThreadContext.gatherRawBacktrace(getRuntime(), Thread.currentThread().getStackTrace());\\n- break;\\n- case FULL:\\n- fullTrace = true;\\n- default:\\n- backtraceElements = ThreadContext.gatherHybridBacktrace(\\n- context.getRuntime(),\\n- context.createBacktrace2(0, nativeException),\\n- Thread.currentThread().getStackTrace(),\\n- fullTrace);\\n- }\\n+ backtraceElements = RubyInstanceConfig.TRACE_TYPE.getBacktrace(context, nativeException);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"291ec85894f767f285218b8a2c75ceae\",\n \"score\": \"0.49845093\",\n \"text\": \"void logError(String message, String stackTrace);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"987fb564ab42a17dfe9a709dec8e8703\",\n \"score\": \"0.49746716\",\n \"text\": \"public final java.util.List<java.lang.StackTraceElement> c(java.lang.String r8, java.lang.Thread r9, java.util.List<java.lang.StackTraceElement> r10) {\\n /*\\n r7 = this;\\n java.lang.String r0 = \\\"RUNNING\\\"\\n boolean r8 = kotlin.jvm.internal.Intrinsics.areEqual(r8, r0)\\n r0 = 1\\n r8 = r8 ^ r0\\n if (r8 != 0) goto L_0x00c9\\n if (r9 != 0) goto L_0x000e\\n goto L_0x00c9\\n L_0x000e:\\n kotlin.Result$Companion r8 = kotlin.Result.Companion // Catch:{ all -> 0x0019 }\\n java.lang.StackTraceElement[] r8 = r9.getStackTrace() // Catch:{ all -> 0x0019 }\\n java.lang.Object r8 = kotlin.Result.m242constructorimpl(r8) // Catch:{ all -> 0x0019 }\\n goto L_0x0024\\n L_0x0019:\\n r8 = move-exception\\n kotlin.Result$Companion r9 = kotlin.Result.Companion\\n java.lang.Object r8 = kotlin.ResultKt.createFailure(r8)\\n java.lang.Object r8 = kotlin.Result.m242constructorimpl(r8)\\n L_0x0024:\\n boolean r9 = kotlin.Result.m247isFailureimpl(r8)\\n if (r9 == 0) goto L_0x002b\\n r8 = 0\\n L_0x002b:\\n java.lang.StackTraceElement[] r8 = (java.lang.StackTraceElement[]) r8\\n if (r8 == 0) goto L_0x00c9\\n int r9 = r8.length\\n r1 = 0\\n r2 = 0\\n L_0x0032:\\n r3 = -1\\n if (r2 >= r9) goto L_0x0064\\n r4 = r8[r2]\\n java.lang.String r5 = r4.getClassName()\\n java.lang.String r6 = \\\"kotlin.coroutines.jvm.internal.BaseContinuationImpl\\\"\\n boolean r5 = kotlin.jvm.internal.Intrinsics.areEqual(r5, r6)\\n if (r5 == 0) goto L_0x005d\\n java.lang.String r5 = r4.getMethodName()\\n java.lang.String r6 = \\\"resumeWith\\\"\\n boolean r5 = kotlin.jvm.internal.Intrinsics.areEqual(r5, r6)\\n if (r5 == 0) goto L_0x005d\\n java.lang.String r4 = r4.getFileName()\\n java.lang.String r5 = \\\"ContinuationImpl.kt\\\"\\n boolean r4 = kotlin.jvm.internal.Intrinsics.areEqual(r4, r5)\\n if (r4 == 0) goto L_0x005d\\n r4 = 1\\n goto L_0x005e\\n L_0x005d:\\n r4 = 0\\n L_0x005e:\\n if (r4 == 0) goto L_0x0061\\n goto L_0x0065\\n L_0x0061:\\n int r2 = r2 + 1\\n goto L_0x0032\\n L_0x0064:\\n r2 = -1\\n L_0x0065:\\n int r9 = r2 + -1\\n int r9 = r7.d(r9, r8, r10)\\n if (r9 != r3) goto L_0x007e\\n int r9 = r2 + -2\\n int r9 = r7.d(r9, r8, r10)\\n java.lang.Integer r9 = java.lang.Integer.valueOf(r9)\\n java.lang.Boolean r4 = java.lang.Boolean.TRUE\\n kotlin.Pair r9 = kotlin.TuplesKt.to(r9, r4)\\n goto L_0x0088\\n L_0x007e:\\n java.lang.Integer r9 = java.lang.Integer.valueOf(r9)\\n java.lang.Boolean r4 = java.lang.Boolean.FALSE\\n kotlin.Pair r9 = kotlin.TuplesKt.to(r9, r4)\\n L_0x0088:\\n java.lang.Object r4 = r9.component1()\\n java.lang.Number r4 = (java.lang.Number) r4\\n int r4 = r4.intValue()\\n java.lang.Object r9 = r9.component2()\\n java.lang.Boolean r9 = (java.lang.Boolean) r9\\n boolean r9 = r9.booleanValue()\\n if (r4 != r3) goto L_0x009f\\n return r10\\n L_0x009f:\\n int r3 = r10.size()\\n int r3 = r3 + r2\\n int r3 = r3 - r4\\n int r3 = r3 - r0\\n int r3 = r3 - r9\\n java.util.ArrayList r5 = new java.util.ArrayList\\n r5.<init>(r3)\\n int r2 = r2 - r9\\n L_0x00ad:\\n if (r1 >= r2) goto L_0x00b7\\n r9 = r8[r1]\\n r5.add(r9)\\n int r1 = r1 + 1\\n goto L_0x00ad\\n L_0x00b7:\\n int r4 = r4 + r0\\n int r8 = r10.size()\\n L_0x00bc:\\n if (r4 >= r8) goto L_0x00c8\\n java.lang.Object r9 = r10.get(r4)\\n r5.add(r9)\\n int r4 = r4 + 1\\n goto L_0x00bc\\n L_0x00c8:\\n return r5\\n L_0x00c9:\\n return r10\\n */\\n throw new UnsupportedOperationException(\\\"Method not decompiled: kotlinx.coroutines.debug.internal.DebugProbesImpl.c(java.lang.String, java.lang.Thread, java.util.List):java.util.List\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b67f357aa26fc6c02cfe02724b187fd7\",\n \"score\": \"0.49439886\",\n \"text\": \"com.google.devtools.cloudtrace.v2.StackTrace.StackFrames getStackFrames();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1509f3f3e88876733cf984316799fb6f\",\n \"score\": \"0.49430683\",\n \"text\": \"private static void a(Throwable th) {\\n ArrayList<a> b2 = b();\\n b2.add(new a(th));\\n if (b2.size() > 5) {\\n b2.remove(0);\\n }\\n ObjectOutputStream objectOutputStream = null;\\n try {\\n ObjectOutputStream objectOutputStream2 = new ObjectOutputStream(d.a().openFileOutput(\\\".exceptiondetail\\\", 0));\\n try {\\n objectOutputStream2.writeObject(b2);\\n try {\\n objectOutputStream2.close();\\n } catch (IOException e) {\\n j.a(\\\"MEH\\\", \\\"saveException exception\\\", (Throwable) e);\\n }\\n } catch (IOException e2) {\\n e = e2;\\n objectOutputStream = objectOutputStream2;\\n try {\\n j.a(\\\"\\\", (Throwable) e);\\n if (objectOutputStream == null) {\\n }\\n } catch (Throwable th2) {\\n th = th2;\\n if (objectOutputStream != null) {\\n try {\\n objectOutputStream.close();\\n } catch (IOException e3) {\\n j.a(\\\"MEH\\\", \\\"saveException exception\\\", (Throwable) e3);\\n }\\n }\\n throw th;\\n }\\n } catch (Throwable th3) {\\n th = th3;\\n objectOutputStream = objectOutputStream2;\\n if (objectOutputStream != null) {\\n }\\n throw th;\\n }\\n } catch (IOException e4) {\\n e = e4;\\n j.a(\\\"\\\", (Throwable) e);\\n if (objectOutputStream == null) {\\n objectOutputStream.close();\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"258f20e593837cd7f00362aaf3e3bf01\",\n \"score\": \"0.49421644\",\n \"text\": \"protected void genExceptionLog(Throwable exception)\\r\\n/* 142: */ throws Exception\\r\\n/* 143: */ {\\r\\n/* 144:153 */ Writer result = new StringWriter();\\r\\n/* 145:154 */ PrintWriter printWriter = new PrintWriter(result);\\r\\n/* 146:155 */ exception.printStackTrace(printWriter);\\r\\n/* 147: */ \\r\\n/* 148: */ \\r\\n/* 149:158 */ File file = new File(this.filePath + this.exceptionFileName);\\r\\n/* 150:159 */ FileOutputStream out = new FileOutputStream(file);\\r\\n/* 151:160 */ OutputStreamWriter osw = new OutputStreamWriter(out, \\\"BIG5\\\");\\r\\n/* 152: */ \\r\\n/* 153:162 */ BufferedWriter bw = new BufferedWriter(osw);\\r\\n/* 154:163 */ bw.write(result.toString());\\r\\n/* 155: */ \\r\\n/* 156:165 */ bw.flush();\\r\\n/* 157: */ \\r\\n/* 158:167 */ bw.close();\\r\\n/* 159:168 */ osw.close();\\r\\n/* 160:169 */ out.close();\\r\\n/* 161: */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5633d61350a3b00836b7487f7c41abeb\",\n \"score\": \"0.49401695\",\n \"text\": \"public Caller(int backSteps) {\\n Exception e = new Exception();\\n StackTraceElement[] trace = e.getStackTrace();\\n\\n for (int i = trace.length - 1; i >= 0; i--) {\\n StackTraceElement element = trace[i];\\n if (element.getClassName().equals(Caller.class.getName())) {\\n int previ = i + 2 + backSteps;\\n if (previ < trace.length) {\\n callerElement = trace[previ];\\n }\\n else {\\n callerElement = null;\\n }\\n break;\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6b0b61ad1246663e381735b78a0d80a3\",\n \"score\": \"0.4918855\",\n \"text\": \"void trace(Object message, Throwable t);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d0840784cdc1395edce24e69a4df51bf\",\n \"score\": \"0.4904665\",\n \"text\": \"StackOverflowException(final String msg) {\\n super(msg);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4764eced59348dae1d402f79398f5835\",\n \"score\": \"0.4890184\",\n \"text\": \"public static String stackTrace(Throwable t) {\\n\\t\\tStringWriter w = new StringWriter();\\n\\t\\tPrintWriter pw = new PrintWriter(w);\\n\\t\\tt.printStackTrace(pw);\\n\\t\\tpw.flush();\\n\\t\\treturn w.toString();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ac4355024b8470402385ce0747b5bfe\",\n \"score\": \"0.48855475\",\n \"text\": \"@Test(timeout = 4000)\\n public void test071() throws Throwable {\\n ClassWriter classWriter0 = new ClassWriter(943);\\n String[] stringArray0 = new String[5];\\n stringArray0[0] = \\\"_Ew)rOy'*S7|\\\";\\n stringArray0[1] = \\\"_Ew)rOy'*S7|\\\";\\n classWriter0.addType(\\\"_Ew)rOy'*S7|\\\");\\n stringArray0[2] = \\\"_Ew)rOy'*S7|\\\";\\n Item item0 = classWriter0.newFloat(943);\\n stringArray0[3] = \\\"_Ew)rOy'*S7|\\\";\\n stringArray0[4] = \\\"\\\";\\n MethodWriter methodWriter0 = new MethodWriter(classWriter0, 943, \\\"_Ew)rOy'*S7|\\\", \\\"_Ew)rOy'*S7|\\\", \\\"_Ew)rOy'*S7|\\\", stringArray0, true, true);\\n Object[] objectArray0 = new Object[4];\\n objectArray0[0] = (Object) item0;\\n Object object0 = new Object();\\n objectArray0[1] = object0;\\n item0.strVal3 = \\\"\\\";\\n objectArray0[2] = (Object) \\\"_Ew)rOy'*S7|\\\";\\n objectArray0[3] = (Object) \\\"_Ew)rOy'*S7|\\\";\\n methodWriter0.visitFrame(943, 2, objectArray0, 1, stringArray0);\\n methodWriter0.visitTypeInsn(4123, \\\"java/lang/Throwable\\\");\\n methodWriter0.visitFieldInsn(12, \\\"StackMap\\\", \\\"\\\", \\\"Code\\\");\\n methodWriter0.visitInsn(12);\\n methodWriter0.visitMethodInsn(1, \\\"java/lang/Throwable\\\", \\\"\\\", \\\"java/lang/Throwable\\\");\\n Label label0 = new Label();\\n Label label1 = label0.getFirst();\\n Label label2 = label1.next;\\n methodWriter0.visitTryCatchBlock((Label) null, label0, label0, \\\"Code\\\");\\n assertSame(label0, label1);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"701e47aee7f284a44b087d869a768a54\",\n \"score\": \"0.4858038\",\n \"text\": \"public NestingException(Throwable nestedException)\\r\\n {\\r\\n this.nestedException = nestedException;\\r\\n nestedException.printStackTrace();\\r\\n stackTraceString = generateStackTraceString(nestedException);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"46bbbb7e078b3094c0ff64d4c26e14b3\",\n \"score\": \"0.48539245\",\n \"text\": \"@Test(timeout = 4000)\\n public void test004() throws Throwable {\\n ClassWriter classWriter0 = new ClassWriter(943);\\n String[] stringArray0 = new String[5];\\n stringArray0[0] = \\\"_Ew)rOy'*S7|\\\";\\n stringArray0[1] = \\\"_Ew)rOy'*S7|\\\";\\n classWriter0.addType(\\\"_Ew)rOy'*S7|\\\");\\n stringArray0[2] = \\\"_Ew)rOy'*S7|\\\";\\n Item item0 = classWriter0.newFloat(943);\\n stringArray0[3] = \\\"_Ew)rOy'*S7|\\\";\\n stringArray0[4] = \\\"\\\";\\n MethodWriter methodWriter0 = new MethodWriter(classWriter0, 943, \\\"_Ew)rOy'*S7|\\\", \\\"_Ew)rOy'*S7|\\\", \\\"_Ew)rOy'*S7|\\\", stringArray0, true, true);\\n Object[] objectArray0 = new Object[4];\\n objectArray0[0] = (Object) item0;\\n Object object0 = new Object();\\n objectArray0[1] = object0;\\n item0.strVal3 = \\\"\\\";\\n objectArray0[2] = (Object) \\\"_Ew)rOy'*S7|\\\";\\n objectArray0[3] = (Object) \\\"_Ew)rOy'*S7|\\\";\\n methodWriter0.visitFrame(943, 2, objectArray0, 1, stringArray0);\\n methodWriter0.visitTypeInsn(4123, \\\"java/lang/Throwable\\\");\\n classWriter0.visitSource(\\\"\\\", \\\"M<i4iF\\\");\\n methodWriter0.visitFieldInsn(12, \\\"StackMap\\\", \\\"\\\", \\\"Code\\\");\\n methodWriter0.visitInsn(12);\\n methodWriter0.visitFrame(1, 93, stringArray0, (-4485), stringArray0);\\n Edge edge0 = new Edge();\\n Label label0 = edge0.successor;\\n // Undeclared exception!\\n try { \\n methodWriter0.visitJumpInsn(14, (Label) null);\\n fail(\\\"Expecting exception: NullPointerException\\\");\\n \\n } catch(NullPointerException e) {\\n //\\n // no message in exception (getMessage() returned null)\\n //\\n verifyException(\\\"org.objectweb.asm.jip.MethodWriter\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"43ef5119be8b211923c7a91774c7e764\",\n \"score\": \"0.48258975\",\n \"text\": \"private static Throwable method_5974(Throwable var0) {\\r\\n return var0;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc63bddbd67eef9a47e51fb524832a6d\",\n \"score\": \"0.4822028\",\n \"text\": \"public StoreException(String msg, Throwable cause) {\\r\\n super(msg, cause);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"449c0c4968343c13a0a95dea090a81fb\",\n \"score\": \"0.48142135\",\n \"text\": \"private String getStackTrace(Exception e) {\\n ByteArrayOutputStream baos = new ByteArrayOutputStream();\\n PrintStream printStream = new PrintStream(baos);\\n e.printStackTrace(printStream);\\n return baos.toString();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4b4faf9fbbed6e987a2719d19a9603a2\",\n \"score\": \"0.47987276\",\n \"text\": \"void mo85577a(Exception exc);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c6ff9f7ff3bf2caf4d64b07571477764\",\n \"score\": \"0.4795245\",\n \"text\": \"public MyExceptionLogger(String message) {\\n super(message);\\n trace = new StringWriter();\\n PrintWriter pw = new PrintWriter(trace);\\n super.printStackTrace(pw);\\n logger = Logger.getLogger(\\\"myLogger\\\");\\n logger.log(Level.SEVERE, trace.toString());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"707799ede71cc9024a08e77b5762db05\",\n \"score\": \"0.47873664\",\n \"text\": \"public String getExceptionStack() {\\n\\t\\treturn exceptionStack;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"123c5b636148746a7346dcec49c674b3\",\n \"score\": \"0.477843\",\n \"text\": \"com.google.devtools.cloudtrace.v2.StackTrace.StackFramesOrBuilder getStackFramesOrBuilder();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d10a1d57777fa6ed6e65f679f5515652\",\n \"score\": \"0.47742143\",\n \"text\": \"public String getStackTraceString()\\r\\n {\\r\\n if (nestedException == null)\\r\\n return null;\\r\\n StringBuffer traceBuffer = new StringBuffer();\\r\\n if (nestedException instanceof NestingException)\\r\\n {\\r\\n traceBuffer.append(((NestingException) nestedException).getStackTraceString());\\r\\n traceBuffer.append(\\\"-------- nested by:\\\\n\\\");\\r\\n }\\r\\n traceBuffer.append(stackTraceString);\\r\\n return traceBuffer.toString();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f4d4fc1f524ef326f0268b2bfb841a1c\",\n \"score\": \"0.47723863\",\n \"text\": \"public final String buildTraceback(final Throwable throwable) {\\n\\t\\tfinal StringWriter stringWriter = new StringWriter();\\n\\t\\tfinal PrintWriter printWriter = new PrintWriter(stringWriter);\\n\\t\\tthrowable.printStackTrace(printWriter);\\n\\t\\tprintWriter.flush();\\n\\t\\tfinal String traceback = stringWriter.toString();\\n\\t\\ttry {\\n\\t\\t\\tstringWriter.close();\\n\\t\\t} catch (final IOException e1) {\\n\\t\\t}\\n\\t\\tprintWriter.close();\\n\\t\\treturn traceback;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"714b6f891c23c1e45472e5e0a8655db3\",\n \"score\": \"0.47458434\",\n \"text\": \"@Test(timeout = 4000)\\n public void test152() throws Throwable {\\n Frame frame0 = new Frame();\\n ClassWriter classWriter0 = new ClassWriter(16777228);\\n classWriter0.addUninitializedType(\\\"5E8k=2Z\\\", 16777228);\\n Item item0 = classWriter0.newDouble(25165824);\\n // Undeclared exception!\\n try { \\n frame0.execute(262144, (-1452), classWriter0, item0);\\n fail(\\\"Expecting exception: NullPointerException\\\");\\n \\n } catch(NullPointerException e) {\\n //\\n // no message in exception (getMessage() returned null)\\n //\\n verifyException(\\\"wheel.asm.Frame\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dab9c500d8cc1f8162f1ea868d1e67b2\",\n \"score\": \"0.4743507\",\n \"text\": \"private void trackException(MonKeyImp key, Throwable exception) {\\n String stackTrace = new StringBuilder()\\n .append(\\\"stackTrace=\\\")\\n .append(Misc.getExceptionTrace(exception))\\n .toString();\\n\\n key.setDetails(stackTrace);\\n // Specific exception counter. Example: java.lang.RuntimeException\\n MonitorFactory.add(new MonKeyImp(exception.getClass().getName(), stackTrace, EXCEPTION), 1);\\n // General exception counter which is a total for all exceptions thrown\\n MonitorFactory.add(new MonKeyImp(MonitorFactory.EXCEPTIONS_LABEL, stackTrace, EXCEPTION), 1);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8fa5a721cf2a0683505d5cdee924c17f\",\n \"score\": \"0.4741667\",\n \"text\": \"private void setCauseStackTrace(Throwable arg0) {\\n if (arg0 != null) {\\n StringWriter sw = new StringWriter();\\n PrintWriter pw = new PrintWriter(sw);\\n arg0.printStackTrace(pw);\\n setCauseStackTrace(sw.getBuffer().toString());\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d404a982bf1e20056a972ab5d977fb9f\",\n \"score\": \"0.47306418\",\n \"text\": \"long getStackTraceHashId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"79cdcc8fb337816490447b7628259583\",\n \"score\": \"0.47241047\",\n \"text\": \"private String getStackTraceAsString(Exception e) {\\n StringWriter writer = new StringWriter();\\n PrintWriter pwriter = new PrintWriter(writer);\\n e.printStackTrace(pwriter);\\n return writer.toString();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"218c99104a4e4c2c73d47525f1ee3f17\",\n \"score\": \"0.47193772\",\n \"text\": \"@Override\\n public Throwable fillInStackTrace() {\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b24d96fc541384f59dd4c3e80fa36502\",\n \"score\": \"0.47168604\",\n \"text\": \"public final void mo30348B(Throwable th) {\\n AppMethodBeat.m2504i(118535);\\n C25052j.m39376p(th, \\\"exception\\\");\\n Throwable th2 = this.BQH;\\n if (th2 == null) {\\n this.BQH = th;\\n AppMethodBeat.m2505o(118535);\\n } else if (th == th2) {\\n AppMethodBeat.m2505o(118535);\\n } else {\\n th2 = this.BQF;\\n if (th2 == null) {\\n this.BQF = th;\\n AppMethodBeat.m2505o(118535);\\n } else if (th2 instanceof Throwable) {\\n if (th == th2) {\\n AppMethodBeat.m2505o(118535);\\n return;\\n }\\n ArrayList ely = C16458b.ely();\\n ely.add(th2);\\n ely.add(th);\\n this.BQF = ely;\\n AppMethodBeat.m2505o(118535);\\n } else if (!(th2 instanceof ArrayList)) {\\n th2 = new IllegalStateException(\\\"State is \\\".concat(String.valueOf(th2)).toString());\\n AppMethodBeat.m2505o(118535);\\n throw th2;\\n } else if (th2 == null) {\\n C44941v c44941v = new C44941v(\\\"null cannot be cast to non-null type kotlin.collections.ArrayList<kotlin.Throwable> /* = java.util.ArrayList<kotlin.Throwable> */\\\");\\n AppMethodBeat.m2505o(118535);\\n throw c44941v;\\n } else {\\n ((ArrayList) th2).add(th);\\n AppMethodBeat.m2505o(118535);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ac5e87778f4cf24addd376e040b50c4c\",\n \"score\": \"0.4700967\",\n \"text\": \"@Override\\n\\tpublic void trace(Object message, Throwable t) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f44334e6bda38040d98762d55a39011c\",\n \"score\": \"0.4690395\",\n \"text\": \"@Override\\n @Exported(name = \\\"exception\\\")\\n public String getErrorStackTrace() {\\n if (exception != null) {\\n return exception.toString();\\n }\\n return null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"79be8a2e059918aaaaa6f7e9eb715467\",\n \"score\": \"0.4684171\",\n \"text\": \"public static String createElidedStacktrace(Throwable err) {\\n StringBuilder sb = new StringBuilder();\\n StackTraceElement[] st = err.getStackTrace();\\n for (StackTraceElement s : st) {\\n String str = s.toString();\\n if (!str.startsWith(\\\"reactor.\\\")\\n && !str.startsWith(\\\"java.\\\")\\n && !str.startsWith(\\\"com.couchbase.client.core\\\")\\n && sb.length() > 0) {\\n sb.append(sb);\\n sb.append(\\\"; \\\");\\n }\\n }\\n return sb.toString();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"27580f1045a626f3d1114484d52a910f\",\n \"score\": \"0.46757036\",\n \"text\": \"private StackTraceElement unwindStackTrace() {\\n final StackTraceElement[] stes = Thread.currentThread().getStackTrace();\\n int offset = 0;\\n while (offset < stes.length\\n && (stes[offset].getClassName().equals(THREAD_CLASS_NAME) || stes[offset]\\n .getClassName().equals(LOGHELPER_CLASS_NAME))) {\\n ++offset;\\n }\\n return stes[offset];\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"34e1ada07351131a4ca79f156d1f4efe\",\n \"score\": \"0.46672994\",\n \"text\": \"public Log(Level level, Throwable exception, String callerClass, String callerMethod, Integer callerLine) {\\n this.level = level;\\n this.exception = exception;\\n this.callerClass = callerClass;\\n this.callerMethod = callerMethod;\\n this.callerLine = callerLine;\\n setOtherFields();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e52dee9e0a42d9b11b82d54948eb218d\",\n \"score\": \"0.46666372\",\n \"text\": \"public DBAnalyticsException(Throwable cause) {\\n\\t\\tthis(cause, (String) null);\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"36582649ec7bc3e776a8e9fcf04dc8c4\",\n \"score\": \"0.46588922\",\n \"text\": \"public StackUnderflowException(String message)\\r\\n\\t{\\r\\n\\t\\tsuper(message);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b138a0878255e75a87b343436e31607f\",\n \"score\": \"0.4655342\",\n \"text\": \"@Test(timeout = 4000)\\n public void test073() throws Throwable {\\n Frame frame0 = new Frame();\\n ClassWriter classWriter0 = new ClassWriter(1889);\\n Item item0 = classWriter0.newConstItem(\\\"java/lang/Object\\\");\\n // Undeclared exception!\\n try { \\n frame0.execute(110, 1687, classWriter0, item0);\\n fail(\\\"Expecting exception: NullPointerException\\\");\\n \\n } catch(NullPointerException e) {\\n //\\n // no message in exception (getMessage() returned null)\\n //\\n verifyException(\\\"wheel.asm.Frame\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c3636c7b9f56406cfd68b98e9da6d0f7\",\n \"score\": \"0.46544993\",\n \"text\": \"@Test(timeout = 4000)\\n public void test119() throws Throwable {\\n Frame frame0 = new Frame();\\n ClassWriter classWriter0 = new ClassWriter(157);\\n Item item0 = classWriter0.newFloat(157);\\n // Undeclared exception!\\n try { \\n frame0.execute(40, 157, classWriter0, item0);\\n fail(\\\"Expecting exception: NullPointerException\\\");\\n \\n } catch(NullPointerException e) {\\n //\\n // no message in exception (getMessage() returned null)\\n //\\n verifyException(\\\"wheel.asm.Frame\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d2b3a386feaa912167c73426bdb877c2\",\n \"score\": \"0.46375138\",\n \"text\": \"public static String getStackTrace(Throwable t) {\\n try {\\n StringWriter sw = new StringWriter();\\n\\n t.printStackTrace(new PrintWriter(sw));\\n sw.close();\\n return sw.toString();\\n } catch (Exception e) {\\n return null;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f8673610d4a458da1113ede8ff3959c3\",\n \"score\": \"0.4637275\",\n \"text\": \"public void stackTrace(Throwable e) {\\n\\t\\te.printStackTrace(System.err);\\n\\t\\tSystem.err.flush();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b8f28013f84c1a1bc426f4ad693e0b34\",\n \"score\": \"0.46294507\",\n \"text\": \"public static void m5215a(Context context, String str, Throwable th) {\\n String str2;\\n if (cbvp.m128521h()) {\\n if (th != null) {\\n str2 = Log.getStackTraceString(th);\\n } else {\\n str2 = \\\"NULL_EXCEPTION\\\";\\n }\\n Bundle bundle = new Bundle();\\n bundle.putString(\\\"error_type\\\", str);\\n bundle.putString(\\\"exception\\\", str2);\\n m5212a(context, bundle);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8d8df55ed82c16ae0cc0da2d2442c5a5\",\n \"score\": \"0.46275926\",\n \"text\": \"private static Exception method_650(Exception var0) {\\r\\n return var0;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9a4352ec6e63069f4789826efa38b520\",\n \"score\": \"0.46206585\",\n \"text\": \"public OverflowException(){}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e05c88c08b8a2e9e80d54460850d7af\",\n \"score\": \"0.46096772\",\n \"text\": \"private ImmutableStackEntry stackEntry(Location location, int scope) {\\n\\t\\treturn new ImmutableStackEntry(location, scope);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6dc69abccfe180cdb5cbdfc735e09a85\",\n \"score\": \"0.46077144\",\n \"text\": \"@Test(timeout = 4000)\\n public void test173() throws Throwable {\\n Frame frame0 = new Frame();\\n ClassWriter classWriter0 = new ClassWriter(16777230);\\n classWriter0.visitAnnotation(\\\"(sZ_{}R/m@=[\\\", false);\\n Item item0 = classWriter0.newDouble(25165824);\\n // Undeclared exception!\\n try { \\n frame0.execute(262144, (-1452), classWriter0, item0);\\n fail(\\\"Expecting exception: NullPointerException\\\");\\n \\n } catch(NullPointerException e) {\\n //\\n // no message in exception (getMessage() returned null)\\n //\\n verifyException(\\\"wheel.asm.Frame\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"404548ec4141d650d1cf21e347628608\",\n \"score\": \"0.46074396\",\n \"text\": \"@Test(timeout = 4000)\\n public void test117() throws Throwable {\\n Frame frame0 = new Frame();\\n ClassWriter classWriter0 = new ClassWriter(2312);\\n // Undeclared exception!\\n try { \\n frame0.execute(42, 1500, classWriter0, (Item) null);\\n fail(\\\"Expecting exception: NullPointerException\\\");\\n \\n } catch(NullPointerException e) {\\n //\\n // no message in exception (getMessage() returned null)\\n //\\n verifyException(\\\"wheel.asm.Frame\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6c0a24d77089738a2634ca72816b5ab1\",\n \"score\": \"0.46045414\",\n \"text\": \"public void setExceptionStack(String exceptionStack) {\\n\\t\\tthis.exceptionStack = exceptionStack;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c022da6653ea8194e1b11306fc70cdf\",\n \"score\": \"0.4604439\",\n \"text\": \"@Test(timeout = 4000)\\n public void test174() throws Throwable {\\n Frame frame0 = new Frame();\\n ClassWriter classWriter0 = new ClassWriter(138);\\n Label label0 = new Label();\\n frame0.owner = label0;\\n Item item0 = classWriter0.key;\\n frame0.execute(138, 2447, classWriter0, item0);\\n // Undeclared exception!\\n try { \\n frame0.execute(2447, 178, classWriter0, item0);\\n fail(\\\"Expecting exception: NullPointerException\\\");\\n \\n } catch(NullPointerException e) {\\n //\\n // no message in exception (getMessage() returned null)\\n //\\n verifyException(\\\"wheel.asm.Frame\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"35f79be59fd45a783fc704e256e6f161\",\n \"score\": \"0.4604371\",\n \"text\": \"ExceptionType createExceptionType();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"69657d80fe56f00464c427671ace344a\",\n \"score\": \"0.46042284\",\n \"text\": \"static public String exceptionTraceToString(Throwable throwableException) {\\n StringWriter sw = new StringWriter();\\n PrintWriter pw = new PrintWriter(sw);\\n throwableException.printStackTrace(pw);\\n String sStackTrace = sw.toString();\\n return sStackTrace;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"69b278e16f6b49833d0d8ad5bb8de4ad\",\n \"score\": \"0.46040246\",\n \"text\": \"@Test(timeout = 4000)\\n public void test027() throws Throwable {\\n Frame frame0 = new Frame();\\n ClassWriter classWriter0 = new ClassWriter(2081);\\n Item item0 = classWriter0.newDouble((-1618.965255341501));\\n // Undeclared exception!\\n try { \\n frame0.execute(191, 4, classWriter0, item0);\\n fail(\\\"Expecting exception: NullPointerException\\\");\\n \\n } catch(NullPointerException e) {\\n //\\n // no message in exception (getMessage() returned null)\\n //\\n verifyException(\\\"wheel.asm.Frame\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0784f1103ba39fb541018a36132eb807\",\n \"score\": \"0.46038494\",\n \"text\": \"@Test(timeout = 4000)\\n public void test053() throws Throwable {\\n Frame frame0 = new Frame();\\n ClassWriter classWriter0 = new ClassWriter(1148);\\n Item item0 = classWriter0.newFloat(1148);\\n // Undeclared exception!\\n try { \\n frame0.execute(157, 1, classWriter0, item0);\\n fail(\\\"Expecting exception: NullPointerException\\\");\\n \\n } catch(NullPointerException e) {\\n //\\n // no message in exception (getMessage() returned null)\\n //\\n verifyException(\\\"wheel.asm.Frame\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d274ef2f01a45a087eef14c602cb259\",\n \"score\": \"0.4601437\",\n \"text\": \"public RollbackException(Throwable cause) {\\r\\n super(cause);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c7779b93b8795b7121a780c4f66c4d6\",\n \"score\": \"0.4597479\",\n \"text\": \"@Test(timeout = 4000)\\n public void test141() throws Throwable {\\n ClassWriter classWriter0 = new ClassWriter(18);\\n String[] stringArray0 = new String[2];\\n stringArray0[0] = \\\"S-$*(/+ab4)X5~\\\";\\n stringArray0[1] = \\\"LineNumberTable\\\";\\n MethodWriter methodWriter0 = new MethodWriter(classWriter0, (-1482286481), \\\"S-$*(/+ab4)X5~\\\", \\\"S-$*(/+ab4)X5~\\\", \\\"LineNumberTable\\\", stringArray0, false, false);\\n methodWriter0.visitFrame(18, (-1482286481), stringArray0, 18, stringArray0);\\n // Undeclared exception!\\n try { \\n methodWriter0.visitFrame((-3), 18, stringArray0, 101, stringArray0);\\n fail(\\\"Expecting exception: IllegalStateException\\\");\\n \\n } catch(IllegalStateException e) {\\n //\\n // no message in exception (getMessage() returned null)\\n //\\n verifyException(\\\"org.objectweb.asm.jip.MethodWriter\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"988fe4201c6909c34492bd2d26e8fc8b\",\n \"score\": \"0.45972005\",\n \"text\": \"@Test(timeout = 4000)\\n public void test097() throws Throwable {\\n Frame frame0 = new Frame();\\n ClassWriter classWriter0 = new ClassWriter(1918);\\n Item item0 = classWriter0.newInteger(359);\\n // Undeclared exception!\\n try { \\n frame0.execute(72, 72, classWriter0, item0);\\n fail(\\\"Expecting exception: NullPointerException\\\");\\n \\n } catch(NullPointerException e) {\\n //\\n // no message in exception (getMessage() returned null)\\n //\\n verifyException(\\\"wheel.asm.Frame\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b64253e07ac59f14353aca86901f0b81\",\n \"score\": \"0.4595942\",\n \"text\": \"@Test(timeout = 4000)\\n public void test116() throws Throwable {\\n Frame frame0 = new Frame();\\n ClassWriter classWriter0 = new ClassWriter(2417);\\n Item item0 = classWriter0.newDouble(1478.6038);\\n // Undeclared exception!\\n try { \\n frame0.execute(43, 16777218, classWriter0, item0);\\n fail(\\\"Expecting exception: NullPointerException\\\");\\n \\n } catch(NullPointerException e) {\\n //\\n // no message in exception (getMessage() returned null)\\n //\\n verifyException(\\\"wheel.asm.Frame\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ca5c2d0e8af59212364cd888469507cc\",\n \"score\": \"0.45914587\",\n \"text\": \"@Test(timeout = 4000)\\n public void test131() throws Throwable {\\n ClassWriter classWriter0 = new ClassWriter(169);\\n MethodWriter methodWriter0 = new MethodWriter(classWriter0, 1, \\\"LineNumberTable\\\", \\\"MfmYEHAR]`?j)H\\\", \\\"4qWq \\\", (String[]) null, true, false);\\n // Undeclared exception!\\n try { \\n methodWriter0.visitFrame((-1), (-208), (Object[]) null, 127, (Object[]) null);\\n fail(\\\"Expecting exception: NegativeArraySizeException\\\");\\n \\n } catch(NegativeArraySizeException e) {\\n //\\n // no message in exception (getMessage() returned null)\\n //\\n verifyException(\\\"org.objectweb.asm.jip.MethodWriter\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d6b389e67cb5e73dade18a5cdd4e0143\",\n \"score\": \"0.4587724\",\n \"text\": \"public Log(Level level, String message, Throwable exception, String callerClass, String callerMethod, Integer callerLine) {\\n this.level = level;\\n this.message = message;\\n this.exception = exception;\\n this.callerClass = callerClass;\\n this.callerMethod = callerMethod;\\n this.callerLine = callerLine;\\n setOtherFields();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4d233d6963ba5ed293ef672ebb0b3cdd\",\n \"score\": \"0.45820782\",\n \"text\": \"public StackFrame getStackFrame();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6333f4e7f6edbc4d76b582078a34da3\",\n \"score\": \"0.4574734\",\n \"text\": \"public Backtrace[] createBacktrace2(int level, boolean nativeException) {\\n Backtrace[] newTrace = new Backtrace[backtraceIndex + 1];\\n for (int i = 0; i <= backtraceIndex; i++) {\\n newTrace[i] = backtrace[i].clone();\\n }\\n return newTrace;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5707dc5f41e34b7d731403fe1f31a8bf\",\n \"score\": \"0.45690614\",\n \"text\": \"@Test(timeout = 4000)\\n public void test114() throws Throwable {\\n Frame frame0 = new Frame();\\n ClassWriter classWriter0 = new ClassWriter(1898);\\n Item item0 = classWriter0.key;\\n // Undeclared exception!\\n try { \\n frame0.execute(46, 2, classWriter0, item0);\\n fail(\\\"Expecting exception: NullPointerException\\\");\\n \\n } catch(NullPointerException e) {\\n //\\n // no message in exception (getMessage() returned null)\\n //\\n verifyException(\\\"wheel.asm.Frame\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b4fa574ede93056ed00f684f0f7ae421\",\n \"score\": \"0.45668688\",\n \"text\": \"public String build(LogTrace logTrace) throws IllegalAccessException;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b6e0780088de49e29fffa2bc8b15595d\",\n \"score\": \"0.456548\",\n \"text\": \"@Test(timeout = 4000)\\n public void test133() throws Throwable {\\n Frame frame0 = new Frame();\\n ClassWriter classWriter0 = new ClassWriter(126);\\n Item item0 = classWriter0.newDouble(0.0);\\n // Undeclared exception!\\n try { \\n frame0.execute(18, 450, classWriter0, item0);\\n fail(\\\"Expecting exception: NullPointerException\\\");\\n \\n } catch(NullPointerException e) {\\n //\\n // no message in exception (getMessage() returned null)\\n //\\n verifyException(\\\"wheel.asm.Frame\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e8bc9de0fc67a5c11c02c1b4c5fcc67f\",\n \"score\": \"0.45603523\",\n \"text\": \"@Test(timeout = 4000)\\n public void test001() throws Throwable {\\n Frame frame0 = new Frame();\\n ClassWriter classWriter0 = new ClassWriter(16777228);\\n Item item0 = classWriter0.newDouble(2);\\n item0.set(453, \\\"\\\\\\\" SP\\\", \\\"\\\\\\\" SP\\\", \\\"\\\\\\\" SP\\\");\\n // Undeclared exception!\\n try { \\n frame0.execute(179, 179, classWriter0, item0);\\n fail(\\\"Expecting exception: NullPointerException\\\");\\n \\n } catch(NullPointerException e) {\\n //\\n // no message in exception (getMessage() returned null)\\n //\\n verifyException(\\\"wheel.asm.Frame\\\", e);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"267d2870fb53829416373a3434bd5c17\",\n \"score\": \"0.45578763\",\n \"text\": \"public StackTraceElement[] getStackTrace(){\\n\\t\\t\\tStackTraceElement[] ste = super.getStackTrace();\\n\\t\\t\\tStackTraceElement[] s = new StackTraceElement[1];\\n\\t\\t\\ts[0] = ste[ste.length-1];\\n\\t\\t\\treturn s;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fcea27b968fbe12e634edf5fe6e7fb84\",\n \"score\": \"0.45561805\",\n \"text\": \"public IModelElementTrace getOrCreateModelElementTrace(Object element) throws EolIncrementalExecutionException {\\n//\\t\\tlogger.info(\\\"Creting ModelElementTrace for {}\\\", element);\\n//\\t\\tString elementId = model.getElementId(element);\\n//\\t\\tif (modelElementTraces.containsKey(elementId)) {\\n//\\t\\t\\tlogger.info(\\\"Retreiving ModelElementTrace from cache\\\");\\n//\\t\\t\\treturn modelElementTraces.get(elementId);\\n//\\t\\t}\\n//\\t\\tif (!model.owns(element)) {\\n//\\t\\t\\tthrow new EolIncrementalExecutionException(\\\"Model does not know about element \\\" + element);\\n//\\t\\t}\\n\\t\\tIModelElementTrace trace = null;\\n//\\t\\ttry {\\n//\\t\\t\\tlogger.info(\\\"Creating new ModelElementTrace\\\");\\n//\\t\\t\\ttrace = new ModelElementTrace(elementId, modelTrace);\\n//\\t\\t} catch (TraceModelDuplicateRelation e) {\\n//\\t\\t\\tthrow new EolIncrementalExecutionException(\\\"Error creating ModelElementTrace trace for \\\" + element);\\n//\\t\\t}\\n//\\t\\tmodelElementTraces.put(elementId, trace);\\n\\t\\treturn trace;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5ae20f1215eddd99c0d792b8e24ce591\",\n \"score\": \"0.45547763\",\n \"text\": \"@Test(timeout = 4000)\\n public void test083() throws Throwable {\\n Frame frame0 = new Frame();\\n ClassWriter classWriter0 = new ClassWriter((-1401));\\n Item item0 = classWriter0.newDouble(0);\\n // Undeclared exception!\\n try { \\n frame0.execute(89, (-1432), (ClassWriter) null, item0);\\n fail(\\\"Expecting exception: NullPointerException\\\");\\n \\n } catch(NullPointerException e) {\\n //\\n // no message in exception (getMessage() returned null)\\n //\\n verifyException(\\\"wheel.asm.Frame\\\", e);\\n }\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":983191,"cells":{"query_id":{"kind":"string","value":"dc0bf5b4ccfdb58df4a9a11f9f64980d"},"query":{"kind":"string","value":"Gets all of the active users with their associated session ID. Admin function."},"positive_passages":{"kind":"list like","value":[{"docid":"942cc363a55a2ce09c880bb9b5b1a715","score":"0.0","text":"public String getAllSessionIds(String sessionId) throws AuthenticationException {\n verifySessionIdForUser(ADMIN_EMAIL, sessionId);\n\n StringBuilder sessionIds = new StringBuilder();\n sessionIds.append(\"<h3>Current Sessions:</h3><br/>\");\n for(String email : sessionIdsByEmail.keySet()) {\n sessionIds.append(\"<b>\");\n sessionIds.append(email);\n sessionIds.append(\"</b>\");\n sessionIds.append(\": \");\n\n sessionIds.append(sessionIdsByEmail.get(email));\n sessionIds.append(\"<br/>\");\n }\n\n return sessionIds.toString();\n }","title":""}],"string":"[\n {\n \"docid\": \"942cc363a55a2ce09c880bb9b5b1a715\",\n \"score\": \"0.0\",\n \"text\": \"public String getAllSessionIds(String sessionId) throws AuthenticationException {\\n verifySessionIdForUser(ADMIN_EMAIL, sessionId);\\n\\n StringBuilder sessionIds = new StringBuilder();\\n sessionIds.append(\\\"<h3>Current Sessions:</h3><br/>\\\");\\n for(String email : sessionIdsByEmail.keySet()) {\\n sessionIds.append(\\\"<b>\\\");\\n sessionIds.append(email);\\n sessionIds.append(\\\"</b>\\\");\\n sessionIds.append(\\\": \\\");\\n\\n sessionIds.append(sessionIdsByEmail.get(email));\\n sessionIds.append(\\\"<br/>\\\");\\n }\\n\\n return sessionIds.toString();\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"2ea8e4bd3c19c8277ebca428c09b25e1","score":"0.73089254","text":"public List<UserDetails> getActiveUsers() {\r\n\t\t\r\n\t\tList<UserDetails> userList =userMap.values().stream().filter(u -> u.isActive()) .collect(Collectors.toList());\r\n\t\t\r\n\t\tif(userList ==null || userList.isEmpty() )\r\n\t\t{\r\n\t\t\tthrow new NullPointerException(\"There is no active user present in the table\");\r\n\t\t\t\r\n\t\t}\r\n\t\treturn userList;\r\n\t}","title":""},{"docid":"dc19f2fd75ae8df4d057409d34b880ee","score":"0.72062373","text":"public List<Users> getAllUsers() {\n log.info(\"----- Entered getAllUsers ----\");\n List<Users> users = new ArrayList<Users>();\n Session session = null;\n\n try {\n session = SessionFactoryProvider.getSessionFactory().openSession();\n users = session.createCriteria(Users.class).list();\n } catch (HibernateException hibernateException) {\n log.error(\"Error getting all users\", hibernateException);\n } finally {\n if (session != null) {\n session.close();\n }\n }\n\n return users;\n }","title":""},{"docid":"28a82ed10a5b329d1d5f6908e66505c4","score":"0.72032005","text":"private synchronized String[] getUserList() {\n String[] users = new String[sessions.size()];\n int i = 0;\n for (Map.Entry<String, Session> s : sessions.entrySet()) {\n if (!checkSessionActive(s.getKey()))\n continue;\n users[i] = s.getValue().getUsername();\n i++;\n }\n Arrays.sort(users);\n return users;\n }","title":""},{"docid":"8098cd0b4bf377d112b3bf9474bf6386","score":"0.7167239","text":"public List<UserDetails> getAllUsers() {\r\n\t\r\n\t\t\r\n\t\tList<UserDetails> userList =userMap.values().stream().filter(u -> u.isActive()) .collect(Collectors.toList());\r\n\t\t\r\n\t\tif(userList ==null || userList.isEmpty() )\r\n\t\t{\r\n\t\t\tthrow new NullPointerException(\"There is no user present in the table\");\r\n\t\t\t\r\n\t\t}\r\n\t\treturn userMap.values().stream().collect(Collectors.toList());\r\n\t}","title":""},{"docid":"1fbcee5526af010c03cf60cd1f1e9070","score":"0.71547323","text":"List<Session> getUserSessions();","title":""},{"docid":"fdc6c906023b7c14202bf72a9303ae63","score":"0.7146264","text":"private List<User> getUsers() {\n return current_manager.getUser();\n }","title":""},{"docid":"b530110f816d6123d585ed33eaec1744","score":"0.70731544","text":"@Override\n public List<User> getUsers() {\n try {\n statement = connection.prepareStatement(SQlQueries.FIND_ALL_USERS);\n resultSet = statement.executeQuery();\n while (resultSet.next()) {\n user = load(resultSet);\n users.add(user);\n }\n return users;\n } catch (SQLException e) {\n LOGGER.error(e);\n } finally {\n close(resultSet, statement, connection);\n }\n return null;\n }","title":""},{"docid":"3fd64edfaf331440469f32172822faed","score":"0.7051132","text":"public NSArray<SWUser> allUsers() {\n\t\treturn SWUser.allUsers( ec() );\n\t}","title":""},{"docid":"1e940ff132d14645d3730d484f3c8bf2","score":"0.7050887","text":"public List<User> getAllUsers(){\n\t\treturn inMemoryUserDao.getAll();\n\t}","title":""},{"docid":"1134dcacbc7c8abf2b04469aeec53921","score":"0.70303","text":"public List<User> getAllActiveUsers() {\r\n TypedQuery<User> query = em.createQuery(\"SELECT u FROM User u WHERE u.isActiv = true\", User.class);\r\n return query.getResultList();\r\n }","title":""},{"docid":"c06e85d55b5415bfd5456f665e398b0d","score":"0.7028518","text":"public List<User> getUsers() {\n\t\tList<User> users = this.identity_service.createUserQuery().list();\n\n\t\tlogger.debug(\"Current number of users: \" + users.size());\n\n\t\treturn users;\n\t}","title":""},{"docid":"e40a5562633688a5744d8193994a6e66","score":"0.695016","text":"@Override\n\t\tpublic List<User> getUsers() {\n\t\t\tSession currentSession = sessionFactory.getCurrentSession();\n\t\t\t\n\t\t\t//create a query\n\t\t\t// query users\n\t\t\t\n\t\t\tSystem.out.println(\"Printing from UserDAOImpl: \\n\");\n\t\t\t\n\t\t\t//List<User> users1 = (List<User>) currentSession.load(User.class, );\n\t\t\t\n\t\t\tList<User> users = currentSession.createQuery(\"from User\").getResultList();\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\tSystem.out.println(\"Printing from UserDAOImpl: \" + users);\n\t\t\t// return the results\n\t\t\t\n\t\t\treturn users;\n\t\t}","title":""},{"docid":"afe7975bfe691fcb394e6293da0e96bb","score":"0.69466484","text":"public List<User> getAllUsers() {\n\t\tif (startUp == true) {\n\t\t\tgetUsers();\n\t\t\tstartUp = false;\n\t\t}\n\t\tlogger.info(\"getAllUsers: \" + users);\n\t\treturn users;\n\t}","title":""},{"docid":"fce95e59dded4d1e93950f096192d2ad","score":"0.69452333","text":"public List<User> getUsersDao() {\n\t\tSession ses = HibernateUtil.currentSession();\n\t\ttry {\n\t\t\treturn ses.createCriteria(User.class).list();\n\t\t} finally {\n\t\t\tHibernateUtil.closeSession();\n\t\t}\n\t}","title":""},{"docid":"d970ff67528ddb22c8412bcb2aa5c891","score":"0.6930097","text":"public List<User> listUsers() {\r\n List<User> userData = new ArrayList<User>();\r\n Session session = HibernateUtil.getSessionFactory().openSession();\r\n Transaction tx = null;\r\n\r\n try {\r\n tx = session.beginTransaction();\r\n userData = session.createQuery(\"FROM User\").list();\r\n tx.commit();\r\n } catch (HibernateException e) {\r\n if (tx != null) {\r\n tx.rollback();\r\n }\r\n e.printStackTrace();\r\n } finally {\r\n session.close();\r\n }\r\n return userData;\r\n }","title":""},{"docid":"0691213a3b42c7742073fe4087bc511a","score":"0.6880609","text":"public List<Account> getUsersActive();","title":""},{"docid":"dde011a48d0a7a0f7fc9ad173c1eea0c","score":"0.6875159","text":"public List<AppUser> getAllUsers();","title":""},{"docid":"17c376763edf2f7035a7bfefaa7e18df","score":"0.6854019","text":"@Override\n\t@Transactional\n\tpublic Iterable<User> getUsers() {\n\t\treturn userDao.findAll(); // delegate the call to DAO\n\t}","title":""},{"docid":"608ad1a3ebcbd3f92056bea1a842584a","score":"0.684919","text":"public List<User> getAllUsers() { return allUsers; }","title":""},{"docid":"7843c310946bd773ed6233a2a0b0e957","score":"0.68481016","text":"public List<User> getUsersRole() {\n return AppContext.getApplicationContext().getBean(SecurityService.class).getAllUserForRole(id);\n }","title":""},{"docid":"0339e86c3b8663bb55039a6d970c003b","score":"0.68472236","text":"@Override\n\tpublic List<ERS_User> getAllUsers() {\n\t\tSession ses = HibernateUtil.getSession();\n\t\t\n\t\tList<ERS_User> userList = ses.createQuery(\"FROM ERS_User\").list();\n\t\t\n\t\tHibernateUtil.closeSession();\n\t\t\n\t\treturn userList;\n\t}","title":""},{"docid":"40601289ea4639b5576094d53872a942","score":"0.68469846","text":"@Override\n\tpublic List<Cusers> getUserList() {\n\t\tSession session= SESSION_FACTORY.getCurrentSession();\n\t\tTransaction tx= session.beginTransaction();\n\t\tList<Cusers> list=session.createQuery(\"from Cusers\").list();\n\t\ttx.commit();\t\t\n\t\treturn list;\n\t}","title":""},{"docid":"c75b7de8d8885cb45e55091cb3694cdd","score":"0.6841966","text":"@Override\n\tpublic Users getUsersById(int id) {\n\t\treturn userRepository.getUserById(id);\n\t}","title":""},{"docid":"7f6430d4050a3583ad61ff727c34d0c5","score":"0.68301344","text":"public List<Users> listAllUsers();","title":""},{"docid":"53d8b1e5fcc2cd241fd50fb4bb17ca9a","score":"0.6826475","text":"@Override\n\tpublic List<User> getAllUsers() \n\t{\n\t\tString sqlState = \"SELECT DISTINCT * \"\n\t\t\t\t+ \"\t\t from users, user_roles\"\n\t\t\t\t+ \"\t\t where users.username = user_roles.username \";\t\n\t\tList<User> allUsers = jdbcTempObject.query(sqlState, new UserCollection());\n\t\treturn allUsers;\n\t}","title":""},{"docid":"1847550bc80a2e7936c33992abc2a4e8","score":"0.6825489","text":"public List<User> getUsers() {\n Query query = new Query(\"User\");\n PreparedQuery results = userDatastore.prepare(query);\n\n List<User> users = getUserInformation(results);\n return users;\n }","title":""},{"docid":"0646d7a0ed6a0502cee984529758d0d7","score":"0.68085873","text":"public List getUserAll() {\n\t\treturn xxuserDAO.findAll();\n\t}","title":""},{"docid":"f4978e70dab722dad3d7b70a3d504c41","score":"0.68072474","text":"protected Iterator listAllUsers() {\n return getAllUsers().iterator();\n }","title":""},{"docid":"fe5ee8b8f7955142335c9e20a16a59e3","score":"0.679347","text":"public Collection<User> getAll() {\n return getCurrentSession().createQuery(\"from User\").list();\n }","title":""},{"docid":"e17ffbd9ec100e5005306a4cdfc2058a","score":"0.6784945","text":"@Override\n public List<User> getAllUsers() {\n Connection connection = ThreadLocaleHandler.getConnection();\n List<User> users = new ArrayList<>();\n try {\n PreparedStatement ps = connection.prepareStatement(Const.GET_ALL_USERS);\n\n ResultSet rs = ps.executeQuery();\n while (rs.next()) {\n users.add(userMapper.map(rs));\n }\n } catch (SQLException e) {\n LOG.error(e);\n }\n return users;\n }","title":""},{"docid":"a46de36e1ef9061866b935c154188ea2","score":"0.67802256","text":"public ArrayList<User> getAllUsers() {\n\t\treturn users;\n\t}","title":""},{"docid":"0bac88e0993124fce297fd45a55bee6c","score":"0.6776874","text":"public List getAllUsers() {\n\n return userAccountRepository.findAll();\n }","title":""},{"docid":"58a61d38dcfb395179034d3422037a3c","score":"0.67482394","text":"@Override\n public List<User> readAllUsers() {\n Session session = HibernateUtilities.getSession();\n session.beginTransaction();\n Query query = session.getNamedQuery(READ_ALL_USERS);\n List<User> users = query.list();\n session.getTransaction().commit();\n session.close();\n return users;\n }","title":""},{"docid":"29eed8fbcf10c59300439f5558f533b9","score":"0.6738114","text":"@Override\r\n\tpublic List<User> getUsers() {\n\t\treturn userRepository.findAll();\r\n\t}","title":""},{"docid":"2bc841bf3609050f64084aa11ff1ed6d","score":"0.67234343","text":"public List<User> getAllUsers();","title":""},{"docid":"2bc841bf3609050f64084aa11ff1ed6d","score":"0.67234343","text":"public List<User> getAllUsers();","title":""},{"docid":"2bc841bf3609050f64084aa11ff1ed6d","score":"0.67234343","text":"public List<User> getAllUsers();","title":""},{"docid":"b0efda424b0f81670a79ab84a188d4e6","score":"0.6718547","text":"List<Session> getAdminSessions();","title":""},{"docid":"1e964ad1cdc112f444e570b327516f97","score":"0.6717974","text":"@Override\n\tpublic Users getUsersById(int id) {\n\t\tSession session=sessionFactory.openSession();\n\t\tTransaction ts=session.beginTransaction();\n\t\tQuery query=session.createQuery(\"from Users where id=\"+id);\n\t\tUsers user=(Users) query.list().get(0);\n\t\tts.commit();\n\t\tsession.close();\n\t\treturn user;\n\t}","title":""},{"docid":"3921dbe39e174629d814f6f2ce4f2a4b","score":"0.671716","text":"@Override\n public List<Users> getUsers() {\n return (List<Users>)sessionFactory.getCurrentSession().createQuery(\"FROM Users \").list();\n }","title":""},{"docid":"cc3bb0f4372d071cb2ce3a4dfc67cbad","score":"0.6713516","text":"public List<UserRegistration> viewActiveUserList() {\r\n\r\n\t\tQuery query = new Query();\r\n\t\tquery.addCriteria(Criteria.where(\"status\").is(\"1\"));\r\n\r\n\t\treturn registrationRepository.findByStatus(1);\r\n\r\n\t}","title":""},{"docid":"34003001f8830daf7ddf8234d02562e4","score":"0.67007244","text":"@Override\r\n\tpublic List<User> getAllUsers() {\n\t\tList<User> users=null;\r\n\t\tSession session=sessionFactory.openSession();\r\n\t\ttry {\t\r\n\t\t\tTransaction tx=session.beginTransaction();\t\r\n\t\t\tString hql = \"from User\";\r\n\t\t\tQuery query = session.createQuery(hql);\t\r\n\t\t\tusers = query.list();\r\n\t\t\ttx.commit();\r\n\t\t} catch (Exception e) {\r\n\t\t\te.printStackTrace();\r\n\t\t}\r\n\t\tsession.close();\r\n\t\treturn users;\r\n\t}","title":""},{"docid":"f7520b8c1ea655a6cf6c4bfd1c7de8c0","score":"0.66969013","text":"public RealmResults<User> getUsers() {\n\n return realm.where(User.class).findAll();\n }","title":""},{"docid":"e981c2891481e8aab0f3301132261666","score":"0.66899866","text":"public IUser[] getAllUsers();","title":""},{"docid":"17e761271c1e9086079441b381439349","score":"0.6688978","text":"@Override\n\tpublic List<User> findAllUser() {\n\t\treturn sqlSessionTemplate.selectList(SELECT_ALL_USER);\n\t}","title":""},{"docid":"cfe589f76e648ccf96f0dba2b35f3026","score":"0.66777444","text":"public List<User> getUsers(){\n init();\n return userList;\n }","title":""},{"docid":"13388ec14218054e1432c23d95c31611","score":"0.6674619","text":"public List<User> listUsers() {\n\t\treturn users.getList();\n\t}","title":""},{"docid":"9169590f5cfdeee0e50769ab2f6f0dca","score":"0.6672823","text":"public List<Users> viewAllUsers();","title":""},{"docid":"e8558e7dea66ee7ade64c1af36b7414b","score":"0.6669341","text":"public List<User> getAll() {\n\n Session session = sessionFactory.openSession();\n\n CriteriaBuilder builder = session.getCriteriaBuilder();\n CriteriaQuery<User> query = builder.createQuery(User.class);\n Root<User> root = query.from(User.class);\n List<User> users = session.createQuery(query).getResultList();\n\n logger.debug(\"The list of Users \" + users);\n session.close();\n\n return users;\n }","title":""},{"docid":"99516f02ffc98075a77127c8653758bc","score":"0.66642284","text":"public ResultSet getUsers()\n\t{\n\t\ttry\n\t\t{\n\t\t\tString queryString = \"SELECT * FROM users\";\n\n\t\t\tpstmt = conn.prepareStatement(queryString, ResultSet.TYPE_SCROLL_INSENSITIVE, ResultSet.CONCUR_READ_ONLY); \n\n\t\t\trset = pstmt.executeQuery();\n\t\t}\n\n\t\tcatch (SQLException e)\n\t\t{\n\t\t\tSystem.out.println(\"Could not get Users\");\n\t\t}\n\n\t\treturn rset;\n\t}","title":""},{"docid":"25661c5b720a616c7a127138da8679d3","score":"0.66470104","text":"User[] getAllUsers();","title":""},{"docid":"a635eb8c1ff2280e0cfc6e7bf935e687","score":"0.66453683","text":"public List<CurrentUserBean> getLoggedUsers() {\n return loggedUsers;\n }","title":""},{"docid":"5cc836588c6ad6fbbe84a2d6691e13a0","score":"0.66354895","text":"public ArrayList<User> getUsers()\n {\n return new ArrayList<>(this.users.values());\n }","title":""},{"docid":"40079f3e0a08eb35263e39bb22628aa7","score":"0.6630041","text":"@Override\r\n\tpublic List<User> getUserList() {\n\t\treturn userMapper.selectAll();\r\n\t}","title":""},{"docid":"0af4da97ef0b00c72c859e8161ed4d51","score":"0.66264534","text":"public java.util.List<ch.ivyteam.ivy.security.IUser> getUsers()\n {\n return users;\n }","title":""},{"docid":"7f5f54e8e2c5dabc0389da560c1154fb","score":"0.66202414","text":"@Override\n\tpublic List<User> getAll() {\n\t\treturn users;\n\t}","title":""},{"docid":"f316a9948b6f155dee82e562cc19ba07","score":"0.66158664","text":"@SuppressWarnings(\"unchecked\")\r\n\t@Override\r\n\tpublic List<Connected> findAllUsers() {\n\t\tList<Connected> model = null;\r\n\t\t\r\n\t\tif (session == null)\r\n\t\t\tsession = HibernateUtil.getSessionFactory();\r\n\t\t\r\n\t\tQuery q = session.createQuery(\"from Connected\");\r\n\t\tmodel = q.list();\r\n\t\treturn model;\r\n\t}","title":""},{"docid":"4a02c05c2920b83ae16852f001ad1bc5","score":"0.6609484","text":"public List<UserDetails> getUsers() {\n return users;\n }","title":""},{"docid":"2628a3cc67bf9b7ed724a946e5f762a9","score":"0.66042256","text":"@Override\n public ArrayList<UserDTO> getUsers() {\n PersistenceContext.setSettings(this.getPersistenceSettings());\n\n ArrayList<UserDTO> users = new ArrayList<>();\n\n ListUserController ctrl = new ListUserController();\n\n Iterable<User> usrs = ctrl.listUsers();\n\n usrs.forEach(u -> users.add(u.toDTO()));\n\n return users;\n }","title":""},{"docid":"0273ad74c999bf2c97a46b20b0375564","score":"0.65971905","text":"public List<Users> listUsers() {\n\t\treturn null;\r\n\t}","title":""},{"docid":"11b20a072ce946602b1a01a5a69ddaf6","score":"0.6596425","text":"@Override\n\tpublic List<Cusers> getAdminUsers() {\n\t\tSession session= SESSION_FACTORY.getCurrentSession();\n\t\t\n\t\tTransaction tx= session.beginTransaction();\n\t\t\n\t\tList<Cusers> list=session.createQuery(\"from Cusers where roletype='administrator'\").list();\n\t\t\n\t\ttx.commit();\t\t\n\t\t\n\t\treturn \tlist;\n\t\t\n\t}","title":""},{"docid":"d7abcbd8a23097e3425de348bd481717","score":"0.65863377","text":"@SuppressWarnings(\"unchecked\")\n\tpublic Set<User> listUsers() {\n\t\tSet<User> usersList = null;\n\n\t\ttry {\n\t\t\tList<User> users = (List<User>) sessionFactory.getCurrentSession()\n\t\t\t\t\t.createCriteria(User.class)\n\t\t\t\t\t.setResultTransformer(Criteria.DISTINCT_ROOT_ENTITY).list();\n\t\t\tusersList = new HashSet<User>(users);\n\t\t} catch (HibernateException e) {\n\t\t\tlogger.error(Thread.currentThread().getStackTrace()[2]\n\t\t\t\t\t.getLineNumber());\n\t\t\tlogger.error(MSG, e);\n\t\t\te.printStackTrace();\n\t\t} catch (Exception e) {\n\t\t\tlogger.error(MSG, e);\n\t\t\te.printStackTrace();\n\t\t}\n\n\t\treturn usersList;\n\t}","title":""},{"docid":"afcd8f39bdc44a8d202df3dc37731c0a","score":"0.6580513","text":"@Override\n\tpublic List<Users> getAll() {\n\t\treturn userDao.findAll();\n\t}","title":""},{"docid":"f9b9e232a32991a0a3b0cb2633ba5e62","score":"0.6576384","text":"@Override\n\tpublic List<User> queryAllUsers() {\n\t\tConfiguration conf = new Configuration().configure();\n\t\tStandardServiceRegistry serviceRegistry = new StandardServiceRegistryBuilder()\n .applySettings(conf.getProperties()).build();\n\t\tSessionFactory sf = conf.buildSessionFactory(serviceRegistry);\n\t\tSession sess = sf.openSession();\n\t\tTransaction tx = sess.beginTransaction();\n\t\tString hql=\"from User as user\";//使用命名参数，推荐使用，易读。\n\t\tQuery query=sess.createQuery(hql);\n\t\t@SuppressWarnings(\"unchecked\")\n\t\tList<User> user = query.list();\n\t\ttx.commit();\n\t\tsess.close();\n\t\tsf.close();\n\t\treturn user;\n\t}","title":""},{"docid":"7f536a88d5a4f6cf688c23349acdf61c","score":"0.6569879","text":"public List<String> getUsers() {\n try {\n dbconnection = DriverManager.getConnection(CONNECTIONURL, USERNAME, PASSWORD);\n String query = \"Select * from user_details;\";\n dbstatement = dbconnection.prepareStatement(query);\n ResultSet rs2 = dbstatement.executeQuery();\n List<String> getUsers = new ArrayList<String>();\n while (rs2.next())\n {\n getUsers.add(rs2.getString(\"Name\"));\n }\n return getUsers;\n }\n catch ( SQLException e)\n {\n return null;\n }\n }","title":""},{"docid":"d76665ef0fe77297842dc1e36e08701a","score":"0.6569749","text":"public Collection<User> listUsers() {\r\n\t\treturn m_user.values();\r\n\t}","title":""},{"docid":"aa796b10bfd1a39c00f7f2655946829b","score":"0.65668195","text":"@SuppressWarnings(value = { \"unchecked\" })\n\tpublic List<User> getAllUsers(){\n\n\t\treturn session().createQuery(\"from User\").list();\n\t\t\n\t\t//return jdbcTemplate.query(\"select * from users , authorities where users.username=authorities.username\", BeanPropertyRowMapper.newInstance(User.class));\n\t\t\n\t\n\t\t\n\t\t\n\t}","title":""},{"docid":"068f8e181c823263e1baf8892dcd5ae9","score":"0.656365","text":"@Override\n\tpublic ResultSet getAllUsers() {\n\t\tString query = \"select * from \" + TableNames.USER + \" where \" + UserColumnNames.IS_ADMIN + \" = 'N'\";\n\t\tResultSet rs = null;\n\t\ttry {\n\t\t\trs = DBConnection.executeQuery(query);\n\n\t\t} catch (ClassNotFoundException e) {\n\t\t\te.printStackTrace();\n\t\t} catch (SQLException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t\treturn rs;\n\t}","title":""},{"docid":"72eecc68ba5b0e613dd6684bdf65f2cf","score":"0.65613455","text":"@Override\r\n\tpublic List<User> getUsers() {\n\t\treturn users;\r\n\t}","title":""},{"docid":"7700ab974bc7fa809cc061bd45f8c9ca","score":"0.6560922","text":"public ResultSet getAllUsers() {\r\n\r\n try {\r\n //SQL = \"INSERT INTO USERS (USERNAME, PASSWORD, USERLEVEL)\" \r\n // + \"VALUES ('admin', 'admin', 'Owner');\";\r\n //stmt.executeUpdate(SQL);\r\n\r\n SQL = \"SELECT * FROM USERS;\";\r\n allUsers = stmt.executeQuery(SQL);\r\n return allUsers;\r\n\r\n } catch (SQLException err) {\r\n\r\n System.out.println(err.getMessage());\r\n return null;\r\n\r\n }\r\n\r\n }","title":""},{"docid":"68e89d71d94e5c0bfa38d565c3b3be9e","score":"0.65583134","text":"public List<AuthUser> findAllUsers() {\r\n\t\treturn userReposotory.findAll();\r\n\t}","title":""},{"docid":"c42f9c4e752ddfed5d3f104399a358c0","score":"0.6555215","text":"@Override\n\tpublic List<User> getall() {\n\t\treturn US.findAll();\n\t}","title":""},{"docid":"b9d21bbede7d3c4c792d5b566916db46","score":"0.6554077","text":"@RequestMapping(value=\"/getUsers\")\r\n\tpublic List<User> viewAllUsers() {\n\t\treturn adminService.viewAllUsers();\r\n\t}","title":""},{"docid":"3e4454d5f06203ad0821f4f04eb89a8a","score":"0.6543043","text":"public UserModel getUsers() {\n \t\treturn userList;\n \t}","title":""},{"docid":"e5664dcfc0d6f73b6f974d557bc03147","score":"0.65412873","text":"@GET\n\tpublic Collection<UserObject> getUsers() \n\t{\t \n\t PretendDatabase d = PretendDatabase.getInstance();\n\t return d.data();\n\t}","title":""},{"docid":"134c0cdaea2d591b54bc7e208008307c","score":"0.6541205","text":"public List<User> getAllUsers() {\n return userRepository.findAll();\n }","title":""},{"docid":"d773366d2fee062513b8430fb7537c45","score":"0.65404963","text":"@RequestMapping(value=\"/api/getAllUsers\", method={ RequestMethod.GET})\n\tpublic List<User> getAllUsers() {\n\t\tPendingTableDao dao=PendingTableDao.getInstance();\n\t\treturn dao.getAllUsers();\n\t\t\n\t}","title":""},{"docid":"11a5df503d2285d0e133d986a99503a9","score":"0.65350795","text":"public List<User> selectAll() {\n\t\treturn userDao.selectAll();\r\n\t}","title":""},{"docid":"2b071b1cf482ff7f41814f7c1d54fec3","score":"0.65269524","text":"public List<User> getUsers();","title":""},{"docid":"2b071b1cf482ff7f41814f7c1d54fec3","score":"0.65269524","text":"public List<User> getUsers();","title":""},{"docid":"c57585143e72ab3c11ce48de98adcde4","score":"0.6525206","text":"String[] getAllUsers();","title":""},{"docid":"4c341ef06d0687e95b1bdfdff4b9e325","score":"0.65196747","text":"@Override\r\n\tpublic List<User> allUser() {\n\t\treturn userdao.allUser();\r\n\t}","title":""},{"docid":"b586292f83a6618d94268dbb1dc8d101","score":"0.651707","text":"public List<User> getAllUsers() {\r\n\t\tList<User> users = new ArrayList<User>();\r\n\r\n\t\tString query = \"SELECT * FROM USERS ORDER BY ID\";\r\n\t\ttry {\r\n\t\t\tStatement stmt = dbConnection.createStatement();\r\n\t\t\tResultSet rs = stmt.executeQuery(query);\r\n\t\t\twhile (rs.next()) {\r\n\t\t\t\tUser user = new User();\r\n\r\n\t\t\t\tuser.setId(rs.getInt(\"ID\"));\r\n\t\t\t\tuser.setUsername(rs.getString(\"USERNAME\"));\r\n\t\t\t\tuser.setUserFirstname(rs.getString(\"USERFIRSTNAME\"));\r\n\t\t\t\tuser.setUserLastname(rs.getString(\"USERLASTNAME\"));\r\n\t\t\t\tuser.setUserEmail(rs.getString(\"USEREMAIL\"));\r\n\t\t\t\tusers.add(user);\r\n\t\t\t}\r\n\t\t} catch (SQLException e) {\r\n\t\t\tSystem.err.println(e.getMessage());\r\n\t\t}\r\n\t\treturn users;\r\n\t}","title":""},{"docid":"44b5685141c40d684af3ee001deee932","score":"0.65137076","text":"public ArrayList<User> getAllUsers();","title":""},{"docid":"5779342ad0e20ca298510c9394524a02","score":"0.6509861","text":"@Override\n\tpublic List<User> getAll() {\n\t\tList<User> users = userDao.findAll();\n\t\treturn users;\n\t}","title":""},{"docid":"932db424936ef816b694e5c650cea843","score":"0.6509692","text":"@Override\n\tpublic List<UserLoginSession> fetchAll() {\n\t\tList<UserLoginSession> list = this.sessionFactory.getCurrentSession()\n\t\t\t\t.createQuery(\"from UserLoginSession\").list();\n\t\treturn list;\n\t}","title":""},{"docid":"5a5c77167634c5548991d571b4398a0b","score":"0.65089715","text":"public List<UUID> getAllStoredUsers();","title":""},{"docid":"fbe99239a0e203489e648dfb2d11a276","score":"0.65074694","text":"@Override\r\n\tpublic List<User> getAllUsers() {\n\t\treturn userRepository.findAll();\r\n\t}","title":""},{"docid":"59831a49299faabf215dc8e1dc2af5a6","score":"0.65050703","text":"public ArrayList<User> getListUsers() {\n return listUsers;\n }","title":""},{"docid":"60e097da7c29c569bed451cf10643d97","score":"0.64995","text":"public static List<User> allUsers() {\n\t\t\n\t\t//List<User> allUsers = new Model.Finder<>(String.class, User.class).all();\n\t\t\n\t\tList<User> allUsers = Ebean.find(User.class)\n\t\t\t\t.select(\"id\")\n\t\t\t\t.orderBy()\n\t\t\t\t.asc(\"id\")\n\t\t\t\t.findList();\n\t\t\n\t\treturn allUsers;\n\t\t\n\t\t\n\t}","title":""},{"docid":"8b3e5ce8a9fc6b0bf8cdd46bc739731c","score":"0.64957106","text":"public ArrayList<User> getUsers();","title":""},{"docid":"ebcbd41a4880e6445f1934e94b584ac9","score":"0.64861834","text":"@Transactional(readOnly = true, isolation = Isolation.READ_COMMITTED)\n\tpublic List<User> getUsers() {\n\t\treturn userRepository.findAll();\n\t}","title":""},{"docid":"286924d9b55627ab71a6f69e7683edde","score":"0.64850503","text":"List<User> getUsers();","title":""},{"docid":"286924d9b55627ab71a6f69e7683edde","score":"0.64850503","text":"List<User> getUsers();","title":""},{"docid":"286924d9b55627ab71a6f69e7683edde","score":"0.64850503","text":"List<User> getUsers();","title":""},{"docid":"cb0411547cf8af1d5a3d75e99e1f0f67","score":"0.6464665","text":"public JSONArray getUsers() throws IOException\n {\n return (JSONArray) api.doRequest(\"GET\", getBaseApiPath() + \"/users\");\n }","title":""},{"docid":"a9bdea7ea0d6753e6f39f98519cc12c3","score":"0.645676","text":"@Override\n\tpublic List<User> getAllUser() {\n\t\tSession session = sessionFactory.getCurrentSession();\n\t\tsession.beginTransaction();\n\t\tQuery query = session.createQuery(\"From User\");\n\t\tList<User> list = query.getResultList();\n\t\tsession.close();\n\t\treturn list;\n\t}","title":""},{"docid":"2ff5d3d33aac12a115dd9b98c1db0df7","score":"0.6448001","text":"@Override\n public Collection<User> getUsers() {\n return userRepository.getAllUsers();\n }","title":""},{"docid":"cee46bd9c21e510918d4fc20f1f2c435","score":"0.6440035","text":"List<User> getAllUsers();","title":""},{"docid":"cee46bd9c21e510918d4fc20f1f2c435","score":"0.6440035","text":"List<User> getAllUsers();","title":""},{"docid":"34cc244a736df6ef62f7d4a69b07e404","score":"0.6436959","text":"public List getUsers() {\n List users = new ArrayList();\n SQLiteDatabase db = this.getWritableDatabase();\n String query = \"SELECT id, username, password, homeCountry, name, surname, avatarId, count, motherLanguage, targetLanguage, destination from user_info ORDER BY id ASC\";\n Cursor cursor = db.rawQuery(query, null);\n while (cursor.moveToNext()) {\n User usr = new User();\n usr.setId(cursor.getInt(0));\n usr.setUsername(cursor.getString(1));\n usr.setPassword(cursor.getString(2));\n usr.setHomeCountry(cursor.getString(3));\n usr.setName(cursor.getString(4));\n usr.setSurname(cursor.getString(5));\n usr.setAvatar(cursor.getInt(6));\n usr.setCount(cursor.getInt(7));\n usr.setMotherLanguage(cursor.getString(8));\n usr.setTargetLanguage(cursor.getString(9));\n usr.setDestination(cursor.getString(10));\n users.add(usr);\n }\n db.close();\n return users;\n }","title":""}],"string":"[\n {\n \"docid\": \"2ea8e4bd3c19c8277ebca428c09b25e1\",\n \"score\": \"0.73089254\",\n \"text\": \"public List<UserDetails> getActiveUsers() {\\r\\n\\t\\t\\r\\n\\t\\tList<UserDetails> userList =userMap.values().stream().filter(u -> u.isActive()) .collect(Collectors.toList());\\r\\n\\t\\t\\r\\n\\t\\tif(userList ==null || userList.isEmpty() )\\r\\n\\t\\t{\\r\\n\\t\\t\\tthrow new NullPointerException(\\\"There is no active user present in the table\\\");\\r\\n\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\treturn userList;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dc19f2fd75ae8df4d057409d34b880ee\",\n \"score\": \"0.72062373\",\n \"text\": \"public List<Users> getAllUsers() {\\n log.info(\\\"----- Entered getAllUsers ----\\\");\\n List<Users> users = new ArrayList<Users>();\\n Session session = null;\\n\\n try {\\n session = SessionFactoryProvider.getSessionFactory().openSession();\\n users = session.createCriteria(Users.class).list();\\n } catch (HibernateException hibernateException) {\\n log.error(\\\"Error getting all users\\\", hibernateException);\\n } finally {\\n if (session != null) {\\n session.close();\\n }\\n }\\n\\n return users;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"28a82ed10a5b329d1d5f6908e66505c4\",\n \"score\": \"0.72032005\",\n \"text\": \"private synchronized String[] getUserList() {\\n String[] users = new String[sessions.size()];\\n int i = 0;\\n for (Map.Entry<String, Session> s : sessions.entrySet()) {\\n if (!checkSessionActive(s.getKey()))\\n continue;\\n users[i] = s.getValue().getUsername();\\n i++;\\n }\\n Arrays.sort(users);\\n return users;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8098cd0b4bf377d112b3bf9474bf6386\",\n \"score\": \"0.7167239\",\n \"text\": \"public List<UserDetails> getAllUsers() {\\r\\n\\t\\r\\n\\t\\t\\r\\n\\t\\tList<UserDetails> userList =userMap.values().stream().filter(u -> u.isActive()) .collect(Collectors.toList());\\r\\n\\t\\t\\r\\n\\t\\tif(userList ==null || userList.isEmpty() )\\r\\n\\t\\t{\\r\\n\\t\\t\\tthrow new NullPointerException(\\\"There is no user present in the table\\\");\\r\\n\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\treturn userMap.values().stream().collect(Collectors.toList());\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1fbcee5526af010c03cf60cd1f1e9070\",\n \"score\": \"0.71547323\",\n \"text\": \"List<Session> getUserSessions();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fdc6c906023b7c14202bf72a9303ae63\",\n \"score\": \"0.7146264\",\n \"text\": \"private List<User> getUsers() {\\n return current_manager.getUser();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b530110f816d6123d585ed33eaec1744\",\n \"score\": \"0.70731544\",\n \"text\": \"@Override\\n public List<User> getUsers() {\\n try {\\n statement = connection.prepareStatement(SQlQueries.FIND_ALL_USERS);\\n resultSet = statement.executeQuery();\\n while (resultSet.next()) {\\n user = load(resultSet);\\n users.add(user);\\n }\\n return users;\\n } catch (SQLException e) {\\n LOGGER.error(e);\\n } finally {\\n close(resultSet, statement, connection);\\n }\\n return null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3fd64edfaf331440469f32172822faed\",\n \"score\": \"0.7051132\",\n \"text\": \"public NSArray<SWUser> allUsers() {\\n\\t\\treturn SWUser.allUsers( ec() );\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1e940ff132d14645d3730d484f3c8bf2\",\n \"score\": \"0.7050887\",\n \"text\": \"public List<User> getAllUsers(){\\n\\t\\treturn inMemoryUserDao.getAll();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1134dcacbc7c8abf2b04469aeec53921\",\n \"score\": \"0.70303\",\n \"text\": \"public List<User> getAllActiveUsers() {\\r\\n TypedQuery<User> query = em.createQuery(\\\"SELECT u FROM User u WHERE u.isActiv = true\\\", User.class);\\r\\n return query.getResultList();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c06e85d55b5415bfd5456f665e398b0d\",\n \"score\": \"0.7028518\",\n \"text\": \"public List<User> getUsers() {\\n\\t\\tList<User> users = this.identity_service.createUserQuery().list();\\n\\n\\t\\tlogger.debug(\\\"Current number of users: \\\" + users.size());\\n\\n\\t\\treturn users;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e40a5562633688a5744d8193994a6e66\",\n \"score\": \"0.695016\",\n \"text\": \"@Override\\n\\t\\tpublic List<User> getUsers() {\\n\\t\\t\\tSession currentSession = sessionFactory.getCurrentSession();\\n\\t\\t\\t\\n\\t\\t\\t//create a query\\n\\t\\t\\t// query users\\n\\t\\t\\t\\n\\t\\t\\tSystem.out.println(\\\"Printing from UserDAOImpl: \\\\n\\\");\\n\\t\\t\\t\\n\\t\\t\\t//List<User> users1 = (List<User>) currentSession.load(User.class, );\\n\\t\\t\\t\\n\\t\\t\\tList<User> users = currentSession.createQuery(\\\"from User\\\").getResultList();\\n\\t\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\tSystem.out.println(\\\"Printing from UserDAOImpl: \\\" + users);\\n\\t\\t\\t// return the results\\n\\t\\t\\t\\n\\t\\t\\treturn users;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"afe7975bfe691fcb394e6293da0e96bb\",\n \"score\": \"0.69466484\",\n \"text\": \"public List<User> getAllUsers() {\\n\\t\\tif (startUp == true) {\\n\\t\\t\\tgetUsers();\\n\\t\\t\\tstartUp = false;\\n\\t\\t}\\n\\t\\tlogger.info(\\\"getAllUsers: \\\" + users);\\n\\t\\treturn users;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fce95e59dded4d1e93950f096192d2ad\",\n \"score\": \"0.69452333\",\n \"text\": \"public List<User> getUsersDao() {\\n\\t\\tSession ses = HibernateUtil.currentSession();\\n\\t\\ttry {\\n\\t\\t\\treturn ses.createCriteria(User.class).list();\\n\\t\\t} finally {\\n\\t\\t\\tHibernateUtil.closeSession();\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d970ff67528ddb22c8412bcb2aa5c891\",\n \"score\": \"0.6930097\",\n \"text\": \"public List<User> listUsers() {\\r\\n List<User> userData = new ArrayList<User>();\\r\\n Session session = HibernateUtil.getSessionFactory().openSession();\\r\\n Transaction tx = null;\\r\\n\\r\\n try {\\r\\n tx = session.beginTransaction();\\r\\n userData = session.createQuery(\\\"FROM User\\\").list();\\r\\n tx.commit();\\r\\n } catch (HibernateException e) {\\r\\n if (tx != null) {\\r\\n tx.rollback();\\r\\n }\\r\\n e.printStackTrace();\\r\\n } finally {\\r\\n session.close();\\r\\n }\\r\\n return userData;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0691213a3b42c7742073fe4087bc511a\",\n \"score\": \"0.6880609\",\n \"text\": \"public List<Account> getUsersActive();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dde011a48d0a7a0f7fc9ad173c1eea0c\",\n \"score\": \"0.6875159\",\n \"text\": \"public List<AppUser> getAllUsers();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"17c376763edf2f7035a7bfefaa7e18df\",\n \"score\": \"0.6854019\",\n \"text\": \"@Override\\n\\t@Transactional\\n\\tpublic Iterable<User> getUsers() {\\n\\t\\treturn userDao.findAll(); // delegate the call to DAO\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"608ad1a3ebcbd3f92056bea1a842584a\",\n \"score\": \"0.684919\",\n \"text\": \"public List<User> getAllUsers() { return allUsers; }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7843c310946bd773ed6233a2a0b0e957\",\n \"score\": \"0.68481016\",\n \"text\": \"public List<User> getUsersRole() {\\n return AppContext.getApplicationContext().getBean(SecurityService.class).getAllUserForRole(id);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0339e86c3b8663bb55039a6d970c003b\",\n \"score\": \"0.68472236\",\n \"text\": \"@Override\\n\\tpublic List<ERS_User> getAllUsers() {\\n\\t\\tSession ses = HibernateUtil.getSession();\\n\\t\\t\\n\\t\\tList<ERS_User> userList = ses.createQuery(\\\"FROM ERS_User\\\").list();\\n\\t\\t\\n\\t\\tHibernateUtil.closeSession();\\n\\t\\t\\n\\t\\treturn userList;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"40601289ea4639b5576094d53872a942\",\n \"score\": \"0.68469846\",\n \"text\": \"@Override\\n\\tpublic List<Cusers> getUserList() {\\n\\t\\tSession session= SESSION_FACTORY.getCurrentSession();\\n\\t\\tTransaction tx= session.beginTransaction();\\n\\t\\tList<Cusers> list=session.createQuery(\\\"from Cusers\\\").list();\\n\\t\\ttx.commit();\\t\\t\\n\\t\\treturn list;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c75b7de8d8885cb45e55091cb3694cdd\",\n \"score\": \"0.6841966\",\n \"text\": \"@Override\\n\\tpublic Users getUsersById(int id) {\\n\\t\\treturn userRepository.getUserById(id);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7f6430d4050a3583ad61ff727c34d0c5\",\n \"score\": \"0.68301344\",\n \"text\": \"public List<Users> listAllUsers();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"53d8b1e5fcc2cd241fd50fb4bb17ca9a\",\n \"score\": \"0.6826475\",\n \"text\": \"@Override\\n\\tpublic List<User> getAllUsers() \\n\\t{\\n\\t\\tString sqlState = \\\"SELECT DISTINCT * \\\"\\n\\t\\t\\t\\t+ \\\"\\t\\t from users, user_roles\\\"\\n\\t\\t\\t\\t+ \\\"\\t\\t where users.username = user_roles.username \\\";\\t\\n\\t\\tList<User> allUsers = jdbcTempObject.query(sqlState, new UserCollection());\\n\\t\\treturn allUsers;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1847550bc80a2e7936c33992abc2a4e8\",\n \"score\": \"0.6825489\",\n \"text\": \"public List<User> getUsers() {\\n Query query = new Query(\\\"User\\\");\\n PreparedQuery results = userDatastore.prepare(query);\\n\\n List<User> users = getUserInformation(results);\\n return users;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0646d7a0ed6a0502cee984529758d0d7\",\n \"score\": \"0.68085873\",\n \"text\": \"public List getUserAll() {\\n\\t\\treturn xxuserDAO.findAll();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f4978e70dab722dad3d7b70a3d504c41\",\n \"score\": \"0.68072474\",\n \"text\": \"protected Iterator listAllUsers() {\\n return getAllUsers().iterator();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fe5ee8b8f7955142335c9e20a16a59e3\",\n \"score\": \"0.679347\",\n \"text\": \"public Collection<User> getAll() {\\n return getCurrentSession().createQuery(\\\"from User\\\").list();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e17ffbd9ec100e5005306a4cdfc2058a\",\n \"score\": \"0.6784945\",\n \"text\": \"@Override\\n public List<User> getAllUsers() {\\n Connection connection = ThreadLocaleHandler.getConnection();\\n List<User> users = new ArrayList<>();\\n try {\\n PreparedStatement ps = connection.prepareStatement(Const.GET_ALL_USERS);\\n\\n ResultSet rs = ps.executeQuery();\\n while (rs.next()) {\\n users.add(userMapper.map(rs));\\n }\\n } catch (SQLException e) {\\n LOG.error(e);\\n }\\n return users;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a46de36e1ef9061866b935c154188ea2\",\n \"score\": \"0.67802256\",\n \"text\": \"public ArrayList<User> getAllUsers() {\\n\\t\\treturn users;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0bac88e0993124fce297fd45a55bee6c\",\n \"score\": \"0.6776874\",\n \"text\": \"public List getAllUsers() {\\n\\n return userAccountRepository.findAll();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"58a61d38dcfb395179034d3422037a3c\",\n \"score\": \"0.67482394\",\n \"text\": \"@Override\\n public List<User> readAllUsers() {\\n Session session = HibernateUtilities.getSession();\\n session.beginTransaction();\\n Query query = session.getNamedQuery(READ_ALL_USERS);\\n List<User> users = query.list();\\n session.getTransaction().commit();\\n session.close();\\n return users;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"29eed8fbcf10c59300439f5558f533b9\",\n \"score\": \"0.6738114\",\n \"text\": \"@Override\\r\\n\\tpublic List<User> getUsers() {\\n\\t\\treturn userRepository.findAll();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2bc841bf3609050f64084aa11ff1ed6d\",\n \"score\": \"0.67234343\",\n \"text\": \"public List<User> getAllUsers();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2bc841bf3609050f64084aa11ff1ed6d\",\n \"score\": \"0.67234343\",\n \"text\": \"public List<User> getAllUsers();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2bc841bf3609050f64084aa11ff1ed6d\",\n \"score\": \"0.67234343\",\n \"text\": \"public List<User> getAllUsers();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b0efda424b0f81670a79ab84a188d4e6\",\n \"score\": \"0.6718547\",\n \"text\": \"List<Session> getAdminSessions();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1e964ad1cdc112f444e570b327516f97\",\n \"score\": \"0.6717974\",\n \"text\": \"@Override\\n\\tpublic Users getUsersById(int id) {\\n\\t\\tSession session=sessionFactory.openSession();\\n\\t\\tTransaction ts=session.beginTransaction();\\n\\t\\tQuery query=session.createQuery(\\\"from Users where id=\\\"+id);\\n\\t\\tUsers user=(Users) query.list().get(0);\\n\\t\\tts.commit();\\n\\t\\tsession.close();\\n\\t\\treturn user;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3921dbe39e174629d814f6f2ce4f2a4b\",\n \"score\": \"0.671716\",\n \"text\": \"@Override\\n public List<Users> getUsers() {\\n return (List<Users>)sessionFactory.getCurrentSession().createQuery(\\\"FROM Users \\\").list();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cc3bb0f4372d071cb2ce3a4dfc67cbad\",\n \"score\": \"0.6713516\",\n \"text\": \"public List<UserRegistration> viewActiveUserList() {\\r\\n\\r\\n\\t\\tQuery query = new Query();\\r\\n\\t\\tquery.addCriteria(Criteria.where(\\\"status\\\").is(\\\"1\\\"));\\r\\n\\r\\n\\t\\treturn registrationRepository.findByStatus(1);\\r\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"34003001f8830daf7ddf8234d02562e4\",\n \"score\": \"0.67007244\",\n \"text\": \"@Override\\r\\n\\tpublic List<User> getAllUsers() {\\n\\t\\tList<User> users=null;\\r\\n\\t\\tSession session=sessionFactory.openSession();\\r\\n\\t\\ttry {\\t\\r\\n\\t\\t\\tTransaction tx=session.beginTransaction();\\t\\r\\n\\t\\t\\tString hql = \\\"from User\\\";\\r\\n\\t\\t\\tQuery query = session.createQuery(hql);\\t\\r\\n\\t\\t\\tusers = query.list();\\r\\n\\t\\t\\ttx.commit();\\r\\n\\t\\t} catch (Exception e) {\\r\\n\\t\\t\\te.printStackTrace();\\r\\n\\t\\t}\\r\\n\\t\\tsession.close();\\r\\n\\t\\treturn users;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f7520b8c1ea655a6cf6c4bfd1c7de8c0\",\n \"score\": \"0.66969013\",\n \"text\": \"public RealmResults<User> getUsers() {\\n\\n return realm.where(User.class).findAll();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e981c2891481e8aab0f3301132261666\",\n \"score\": \"0.66899866\",\n \"text\": \"public IUser[] getAllUsers();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"17e761271c1e9086079441b381439349\",\n \"score\": \"0.6688978\",\n \"text\": \"@Override\\n\\tpublic List<User> findAllUser() {\\n\\t\\treturn sqlSessionTemplate.selectList(SELECT_ALL_USER);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cfe589f76e648ccf96f0dba2b35f3026\",\n \"score\": \"0.66777444\",\n \"text\": \"public List<User> getUsers(){\\n init();\\n return userList;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"13388ec14218054e1432c23d95c31611\",\n \"score\": \"0.6674619\",\n \"text\": \"public List<User> listUsers() {\\n\\t\\treturn users.getList();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9169590f5cfdeee0e50769ab2f6f0dca\",\n \"score\": \"0.6672823\",\n \"text\": \"public List<Users> viewAllUsers();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e8558e7dea66ee7ade64c1af36b7414b\",\n \"score\": \"0.6669341\",\n \"text\": \"public List<User> getAll() {\\n\\n Session session = sessionFactory.openSession();\\n\\n CriteriaBuilder builder = session.getCriteriaBuilder();\\n CriteriaQuery<User> query = builder.createQuery(User.class);\\n Root<User> root = query.from(User.class);\\n List<User> users = session.createQuery(query).getResultList();\\n\\n logger.debug(\\\"The list of Users \\\" + users);\\n session.close();\\n\\n return users;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"99516f02ffc98075a77127c8653758bc\",\n \"score\": \"0.66642284\",\n \"text\": \"public ResultSet getUsers()\\n\\t{\\n\\t\\ttry\\n\\t\\t{\\n\\t\\t\\tString queryString = \\\"SELECT * FROM users\\\";\\n\\n\\t\\t\\tpstmt = conn.prepareStatement(queryString, ResultSet.TYPE_SCROLL_INSENSITIVE, ResultSet.CONCUR_READ_ONLY); \\n\\n\\t\\t\\trset = pstmt.executeQuery();\\n\\t\\t}\\n\\n\\t\\tcatch (SQLException e)\\n\\t\\t{\\n\\t\\t\\tSystem.out.println(\\\"Could not get Users\\\");\\n\\t\\t}\\n\\n\\t\\treturn rset;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"25661c5b720a616c7a127138da8679d3\",\n \"score\": \"0.66470104\",\n \"text\": \"User[] getAllUsers();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a635eb8c1ff2280e0cfc6e7bf935e687\",\n \"score\": \"0.66453683\",\n \"text\": \"public List<CurrentUserBean> getLoggedUsers() {\\n return loggedUsers;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5cc836588c6ad6fbbe84a2d6691e13a0\",\n \"score\": \"0.66354895\",\n \"text\": \"public ArrayList<User> getUsers()\\n {\\n return new ArrayList<>(this.users.values());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"40079f3e0a08eb35263e39bb22628aa7\",\n \"score\": \"0.6630041\",\n \"text\": \"@Override\\r\\n\\tpublic List<User> getUserList() {\\n\\t\\treturn userMapper.selectAll();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0af4da97ef0b00c72c859e8161ed4d51\",\n \"score\": \"0.66264534\",\n \"text\": \"public java.util.List<ch.ivyteam.ivy.security.IUser> getUsers()\\n {\\n return users;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7f5f54e8e2c5dabc0389da560c1154fb\",\n \"score\": \"0.66202414\",\n \"text\": \"@Override\\n\\tpublic List<User> getAll() {\\n\\t\\treturn users;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f316a9948b6f155dee82e562cc19ba07\",\n \"score\": \"0.66158664\",\n \"text\": \"@SuppressWarnings(\\\"unchecked\\\")\\r\\n\\t@Override\\r\\n\\tpublic List<Connected> findAllUsers() {\\n\\t\\tList<Connected> model = null;\\r\\n\\t\\t\\r\\n\\t\\tif (session == null)\\r\\n\\t\\t\\tsession = HibernateUtil.getSessionFactory();\\r\\n\\t\\t\\r\\n\\t\\tQuery q = session.createQuery(\\\"from Connected\\\");\\r\\n\\t\\tmodel = q.list();\\r\\n\\t\\treturn model;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a02c05c2920b83ae16852f001ad1bc5\",\n \"score\": \"0.6609484\",\n \"text\": \"public List<UserDetails> getUsers() {\\n return users;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2628a3cc67bf9b7ed724a946e5f762a9\",\n \"score\": \"0.66042256\",\n \"text\": \"@Override\\n public ArrayList<UserDTO> getUsers() {\\n PersistenceContext.setSettings(this.getPersistenceSettings());\\n\\n ArrayList<UserDTO> users = new ArrayList<>();\\n\\n ListUserController ctrl = new ListUserController();\\n\\n Iterable<User> usrs = ctrl.listUsers();\\n\\n usrs.forEach(u -> users.add(u.toDTO()));\\n\\n return users;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0273ad74c999bf2c97a46b20b0375564\",\n \"score\": \"0.65971905\",\n \"text\": \"public List<Users> listUsers() {\\n\\t\\treturn null;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"11b20a072ce946602b1a01a5a69ddaf6\",\n \"score\": \"0.6596425\",\n \"text\": \"@Override\\n\\tpublic List<Cusers> getAdminUsers() {\\n\\t\\tSession session= SESSION_FACTORY.getCurrentSession();\\n\\t\\t\\n\\t\\tTransaction tx= session.beginTransaction();\\n\\t\\t\\n\\t\\tList<Cusers> list=session.createQuery(\\\"from Cusers where roletype='administrator'\\\").list();\\n\\t\\t\\n\\t\\ttx.commit();\\t\\t\\n\\t\\t\\n\\t\\treturn \\tlist;\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d7abcbd8a23097e3425de348bd481717\",\n \"score\": \"0.65863377\",\n \"text\": \"@SuppressWarnings(\\\"unchecked\\\")\\n\\tpublic Set<User> listUsers() {\\n\\t\\tSet<User> usersList = null;\\n\\n\\t\\ttry {\\n\\t\\t\\tList<User> users = (List<User>) sessionFactory.getCurrentSession()\\n\\t\\t\\t\\t\\t.createCriteria(User.class)\\n\\t\\t\\t\\t\\t.setResultTransformer(Criteria.DISTINCT_ROOT_ENTITY).list();\\n\\t\\t\\tusersList = new HashSet<User>(users);\\n\\t\\t} catch (HibernateException e) {\\n\\t\\t\\tlogger.error(Thread.currentThread().getStackTrace()[2]\\n\\t\\t\\t\\t\\t.getLineNumber());\\n\\t\\t\\tlogger.error(MSG, e);\\n\\t\\t\\te.printStackTrace();\\n\\t\\t} catch (Exception e) {\\n\\t\\t\\tlogger.error(MSG, e);\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\n\\t\\treturn usersList;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"afcd8f39bdc44a8d202df3dc37731c0a\",\n \"score\": \"0.6580513\",\n \"text\": \"@Override\\n\\tpublic List<Users> getAll() {\\n\\t\\treturn userDao.findAll();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f9b9e232a32991a0a3b0cb2633ba5e62\",\n \"score\": \"0.6576384\",\n \"text\": \"@Override\\n\\tpublic List<User> queryAllUsers() {\\n\\t\\tConfiguration conf = new Configuration().configure();\\n\\t\\tStandardServiceRegistry serviceRegistry = new StandardServiceRegistryBuilder()\\n .applySettings(conf.getProperties()).build();\\n\\t\\tSessionFactory sf = conf.buildSessionFactory(serviceRegistry);\\n\\t\\tSession sess = sf.openSession();\\n\\t\\tTransaction tx = sess.beginTransaction();\\n\\t\\tString hql=\\\"from User as user\\\";//使用命名参数，推荐使用，易读。\\n\\t\\tQuery query=sess.createQuery(hql);\\n\\t\\t@SuppressWarnings(\\\"unchecked\\\")\\n\\t\\tList<User> user = query.list();\\n\\t\\ttx.commit();\\n\\t\\tsess.close();\\n\\t\\tsf.close();\\n\\t\\treturn user;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7f536a88d5a4f6cf688c23349acdf61c\",\n \"score\": \"0.6569879\",\n \"text\": \"public List<String> getUsers() {\\n try {\\n dbconnection = DriverManager.getConnection(CONNECTIONURL, USERNAME, PASSWORD);\\n String query = \\\"Select * from user_details;\\\";\\n dbstatement = dbconnection.prepareStatement(query);\\n ResultSet rs2 = dbstatement.executeQuery();\\n List<String> getUsers = new ArrayList<String>();\\n while (rs2.next())\\n {\\n getUsers.add(rs2.getString(\\\"Name\\\"));\\n }\\n return getUsers;\\n }\\n catch ( SQLException e)\\n {\\n return null;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d76665ef0fe77297842dc1e36e08701a\",\n \"score\": \"0.6569749\",\n \"text\": \"public Collection<User> listUsers() {\\r\\n\\t\\treturn m_user.values();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa796b10bfd1a39c00f7f2655946829b\",\n \"score\": \"0.65668195\",\n \"text\": \"@SuppressWarnings(value = { \\\"unchecked\\\" })\\n\\tpublic List<User> getAllUsers(){\\n\\n\\t\\treturn session().createQuery(\\\"from User\\\").list();\\n\\t\\t\\n\\t\\t//return jdbcTemplate.query(\\\"select * from users , authorities where users.username=authorities.username\\\", BeanPropertyRowMapper.newInstance(User.class));\\n\\t\\t\\n\\t\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"068f8e181c823263e1baf8892dcd5ae9\",\n \"score\": \"0.656365\",\n \"text\": \"@Override\\n\\tpublic ResultSet getAllUsers() {\\n\\t\\tString query = \\\"select * from \\\" + TableNames.USER + \\\" where \\\" + UserColumnNames.IS_ADMIN + \\\" = 'N'\\\";\\n\\t\\tResultSet rs = null;\\n\\t\\ttry {\\n\\t\\t\\trs = DBConnection.executeQuery(query);\\n\\n\\t\\t} catch (ClassNotFoundException e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t} catch (SQLException e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t\\treturn rs;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"72eecc68ba5b0e613dd6684bdf65f2cf\",\n \"score\": \"0.65613455\",\n \"text\": \"@Override\\r\\n\\tpublic List<User> getUsers() {\\n\\t\\treturn users;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7700ab974bc7fa809cc061bd45f8c9ca\",\n \"score\": \"0.6560922\",\n \"text\": \"public ResultSet getAllUsers() {\\r\\n\\r\\n try {\\r\\n //SQL = \\\"INSERT INTO USERS (USERNAME, PASSWORD, USERLEVEL)\\\" \\r\\n // + \\\"VALUES ('admin', 'admin', 'Owner');\\\";\\r\\n //stmt.executeUpdate(SQL);\\r\\n\\r\\n SQL = \\\"SELECT * FROM USERS;\\\";\\r\\n allUsers = stmt.executeQuery(SQL);\\r\\n return allUsers;\\r\\n\\r\\n } catch (SQLException err) {\\r\\n\\r\\n System.out.println(err.getMessage());\\r\\n return null;\\r\\n\\r\\n }\\r\\n\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"68e89d71d94e5c0bfa38d565c3b3be9e\",\n \"score\": \"0.65583134\",\n \"text\": \"public List<AuthUser> findAllUsers() {\\r\\n\\t\\treturn userReposotory.findAll();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c42f9c4e752ddfed5d3f104399a358c0\",\n \"score\": \"0.6555215\",\n \"text\": \"@Override\\n\\tpublic List<User> getall() {\\n\\t\\treturn US.findAll();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b9d21bbede7d3c4c792d5b566916db46\",\n \"score\": \"0.6554077\",\n \"text\": \"@RequestMapping(value=\\\"/getUsers\\\")\\r\\n\\tpublic List<User> viewAllUsers() {\\n\\t\\treturn adminService.viewAllUsers();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e4454d5f06203ad0821f4f04eb89a8a\",\n \"score\": \"0.6543043\",\n \"text\": \"public UserModel getUsers() {\\n \\t\\treturn userList;\\n \\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e5664dcfc0d6f73b6f974d557bc03147\",\n \"score\": \"0.65412873\",\n \"text\": \"@GET\\n\\tpublic Collection<UserObject> getUsers() \\n\\t{\\t \\n\\t PretendDatabase d = PretendDatabase.getInstance();\\n\\t return d.data();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"134c0cdaea2d591b54bc7e208008307c\",\n \"score\": \"0.6541205\",\n \"text\": \"public List<User> getAllUsers() {\\n return userRepository.findAll();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d773366d2fee062513b8430fb7537c45\",\n \"score\": \"0.65404963\",\n \"text\": \"@RequestMapping(value=\\\"/api/getAllUsers\\\", method={ RequestMethod.GET})\\n\\tpublic List<User> getAllUsers() {\\n\\t\\tPendingTableDao dao=PendingTableDao.getInstance();\\n\\t\\treturn dao.getAllUsers();\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"11a5df503d2285d0e133d986a99503a9\",\n \"score\": \"0.65350795\",\n \"text\": \"public List<User> selectAll() {\\n\\t\\treturn userDao.selectAll();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2b071b1cf482ff7f41814f7c1d54fec3\",\n \"score\": \"0.65269524\",\n \"text\": \"public List<User> getUsers();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2b071b1cf482ff7f41814f7c1d54fec3\",\n \"score\": \"0.65269524\",\n \"text\": \"public List<User> getUsers();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c57585143e72ab3c11ce48de98adcde4\",\n \"score\": \"0.6525206\",\n \"text\": \"String[] getAllUsers();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4c341ef06d0687e95b1bdfdff4b9e325\",\n \"score\": \"0.65196747\",\n \"text\": \"@Override\\r\\n\\tpublic List<User> allUser() {\\n\\t\\treturn userdao.allUser();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b586292f83a6618d94268dbb1dc8d101\",\n \"score\": \"0.651707\",\n \"text\": \"public List<User> getAllUsers() {\\r\\n\\t\\tList<User> users = new ArrayList<User>();\\r\\n\\r\\n\\t\\tString query = \\\"SELECT * FROM USERS ORDER BY ID\\\";\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tStatement stmt = dbConnection.createStatement();\\r\\n\\t\\t\\tResultSet rs = stmt.executeQuery(query);\\r\\n\\t\\t\\twhile (rs.next()) {\\r\\n\\t\\t\\t\\tUser user = new User();\\r\\n\\r\\n\\t\\t\\t\\tuser.setId(rs.getInt(\\\"ID\\\"));\\r\\n\\t\\t\\t\\tuser.setUsername(rs.getString(\\\"USERNAME\\\"));\\r\\n\\t\\t\\t\\tuser.setUserFirstname(rs.getString(\\\"USERFIRSTNAME\\\"));\\r\\n\\t\\t\\t\\tuser.setUserLastname(rs.getString(\\\"USERLASTNAME\\\"));\\r\\n\\t\\t\\t\\tuser.setUserEmail(rs.getString(\\\"USEREMAIL\\\"));\\r\\n\\t\\t\\t\\tusers.add(user);\\r\\n\\t\\t\\t}\\r\\n\\t\\t} catch (SQLException e) {\\r\\n\\t\\t\\tSystem.err.println(e.getMessage());\\r\\n\\t\\t}\\r\\n\\t\\treturn users;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"44b5685141c40d684af3ee001deee932\",\n \"score\": \"0.65137076\",\n \"text\": \"public ArrayList<User> getAllUsers();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5779342ad0e20ca298510c9394524a02\",\n \"score\": \"0.6509861\",\n \"text\": \"@Override\\n\\tpublic List<User> getAll() {\\n\\t\\tList<User> users = userDao.findAll();\\n\\t\\treturn users;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"932db424936ef816b694e5c650cea843\",\n \"score\": \"0.6509692\",\n \"text\": \"@Override\\n\\tpublic List<UserLoginSession> fetchAll() {\\n\\t\\tList<UserLoginSession> list = this.sessionFactory.getCurrentSession()\\n\\t\\t\\t\\t.createQuery(\\\"from UserLoginSession\\\").list();\\n\\t\\treturn list;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5a5c77167634c5548991d571b4398a0b\",\n \"score\": \"0.65089715\",\n \"text\": \"public List<UUID> getAllStoredUsers();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fbe99239a0e203489e648dfb2d11a276\",\n \"score\": \"0.65074694\",\n \"text\": \"@Override\\r\\n\\tpublic List<User> getAllUsers() {\\n\\t\\treturn userRepository.findAll();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"59831a49299faabf215dc8e1dc2af5a6\",\n \"score\": \"0.65050703\",\n \"text\": \"public ArrayList<User> getListUsers() {\\n return listUsers;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"60e097da7c29c569bed451cf10643d97\",\n \"score\": \"0.64995\",\n \"text\": \"public static List<User> allUsers() {\\n\\t\\t\\n\\t\\t//List<User> allUsers = new Model.Finder<>(String.class, User.class).all();\\n\\t\\t\\n\\t\\tList<User> allUsers = Ebean.find(User.class)\\n\\t\\t\\t\\t.select(\\\"id\\\")\\n\\t\\t\\t\\t.orderBy()\\n\\t\\t\\t\\t.asc(\\\"id\\\")\\n\\t\\t\\t\\t.findList();\\n\\t\\t\\n\\t\\treturn allUsers;\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8b3e5ce8a9fc6b0bf8cdd46bc739731c\",\n \"score\": \"0.64957106\",\n \"text\": \"public ArrayList<User> getUsers();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ebcbd41a4880e6445f1934e94b584ac9\",\n \"score\": \"0.64861834\",\n \"text\": \"@Transactional(readOnly = true, isolation = Isolation.READ_COMMITTED)\\n\\tpublic List<User> getUsers() {\\n\\t\\treturn userRepository.findAll();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"286924d9b55627ab71a6f69e7683edde\",\n \"score\": \"0.64850503\",\n \"text\": \"List<User> getUsers();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"286924d9b55627ab71a6f69e7683edde\",\n \"score\": \"0.64850503\",\n \"text\": \"List<User> getUsers();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"286924d9b55627ab71a6f69e7683edde\",\n \"score\": \"0.64850503\",\n \"text\": \"List<User> getUsers();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cb0411547cf8af1d5a3d75e99e1f0f67\",\n \"score\": \"0.6464665\",\n \"text\": \"public JSONArray getUsers() throws IOException\\n {\\n return (JSONArray) api.doRequest(\\\"GET\\\", getBaseApiPath() + \\\"/users\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a9bdea7ea0d6753e6f39f98519cc12c3\",\n \"score\": \"0.645676\",\n \"text\": \"@Override\\n\\tpublic List<User> getAllUser() {\\n\\t\\tSession session = sessionFactory.getCurrentSession();\\n\\t\\tsession.beginTransaction();\\n\\t\\tQuery query = session.createQuery(\\\"From User\\\");\\n\\t\\tList<User> list = query.getResultList();\\n\\t\\tsession.close();\\n\\t\\treturn list;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ff5d3d33aac12a115dd9b98c1db0df7\",\n \"score\": \"0.6448001\",\n \"text\": \"@Override\\n public Collection<User> getUsers() {\\n return userRepository.getAllUsers();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cee46bd9c21e510918d4fc20f1f2c435\",\n \"score\": \"0.6440035\",\n \"text\": \"List<User> getAllUsers();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cee46bd9c21e510918d4fc20f1f2c435\",\n \"score\": \"0.6440035\",\n \"text\": \"List<User> getAllUsers();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"34cc244a736df6ef62f7d4a69b07e404\",\n \"score\": \"0.6436959\",\n \"text\": \"public List getUsers() {\\n List users = new ArrayList();\\n SQLiteDatabase db = this.getWritableDatabase();\\n String query = \\\"SELECT id, username, password, homeCountry, name, surname, avatarId, count, motherLanguage, targetLanguage, destination from user_info ORDER BY id ASC\\\";\\n Cursor cursor = db.rawQuery(query, null);\\n while (cursor.moveToNext()) {\\n User usr = new User();\\n usr.setId(cursor.getInt(0));\\n usr.setUsername(cursor.getString(1));\\n usr.setPassword(cursor.getString(2));\\n usr.setHomeCountry(cursor.getString(3));\\n usr.setName(cursor.getString(4));\\n usr.setSurname(cursor.getString(5));\\n usr.setAvatar(cursor.getInt(6));\\n usr.setCount(cursor.getInt(7));\\n usr.setMotherLanguage(cursor.getString(8));\\n usr.setTargetLanguage(cursor.getString(9));\\n usr.setDestination(cursor.getString(10));\\n users.add(usr);\\n }\\n db.close();\\n return users;\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":983192,"cells":{"query_id":{"kind":"string","value":"38292c49c000bba7a4ee49307f1de9a9"},"query":{"kind":"string","value":"Method to reset scores"},"positive_passages":{"kind":"list like","value":[{"docid":"056270ee6c2c468a3564a8a446294c0d","score":"0.8071721","text":"private void resetScores(){\n numberRight = 0;\n numberWrong = 0;\n score = 0;\n\n SharedPreferences.Editor edit = AstroQA.prefs.edit();\n edit.putInt(\"numberRight\", numberRight);\n edit.putInt(\"numberWrong\", numberWrong);\n edit.putInt(\"numberQuestions\", numberRight+numberWrong);\n edit.putFloat(\"score\", score);\n edit.putInt(\"qnumber\",AstroQA.qnumber);\n edit.commit();\n\n String s = \"Right: \"+numberRight+\" Wrong: \"+numberWrong+\" Score: \" + score +\"%\";\n tv4.setText(\"\");\n tv4.append(s);\n }","title":""}],"string":"[\n {\n \"docid\": \"056270ee6c2c468a3564a8a446294c0d\",\n \"score\": \"0.8071721\",\n \"text\": \"private void resetScores(){\\n numberRight = 0;\\n numberWrong = 0;\\n score = 0;\\n\\n SharedPreferences.Editor edit = AstroQA.prefs.edit();\\n edit.putInt(\\\"numberRight\\\", numberRight);\\n edit.putInt(\\\"numberWrong\\\", numberWrong);\\n edit.putInt(\\\"numberQuestions\\\", numberRight+numberWrong);\\n edit.putFloat(\\\"score\\\", score);\\n edit.putInt(\\\"qnumber\\\",AstroQA.qnumber);\\n edit.commit();\\n\\n String s = \\\"Right: \\\"+numberRight+\\\" Wrong: \\\"+numberWrong+\\\" Score: \\\" + score +\\\"%\\\";\\n tv4.setText(\\\"\\\");\\n tv4.append(s);\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"c8dbbc076e57f2c8ef740f264766447c","score":"0.89652145","text":"public void resetScore() {\r\n\t\tscore = 0;\r\n\t}","title":""},{"docid":"e86f2aa05cb9f1870593be914598418a","score":"0.8957344","text":"public void resetScore() {\n this.score = 0;\n }","title":""},{"docid":"2744f066aa59d3bc2942deb5307b7a04","score":"0.8840269","text":"public void reset() {\n this.score = 0;\n }","title":""},{"docid":"42dec0f6668c1f6411e3c78e83819ca4","score":"0.8839727","text":"public void reset() {\n\t\tcurrentScore = 0;\n\t}","title":""},{"docid":"22afc1d6deff3a966dd84f997d6261cb","score":"0.88343114","text":"public static void resetScore() {\r\n score = 0;\r\n }","title":""},{"docid":"6b9740bf8df25581e72081c3b0d35cb9","score":"0.8636276","text":"public void resetScore(){\n myInformation.put(SCORE, INITIAL_SCORE);\n }","title":""},{"docid":"b28accc3290cddcc59171bd2444782f6","score":"0.86223817","text":"public void reset() {\n score = 0;\n displayScore = 0;\n }","title":""},{"docid":"faba181ed1dfe9799bd4e30b4d49ec62","score":"0.85684144","text":"public static void resetScores(){\n\t\tscores[PLAYER1] = scores[PLAYER2] = 0;\n\t}","title":""},{"docid":"daf2081e7ae68d68b450e8d3f441115d","score":"0.84865004","text":"public void resetScore() {\r\n this.playerOneScore = 0;\r\n this.playerTwoScore = 0;\r\n }","title":""},{"docid":"1a84f8d0b79438fac60900536a952d2b","score":"0.8460037","text":"public static void resetScore()\r\n {\n right = 0;\r\n left = 0;\r\n }","title":""},{"docid":"8ed5877505f45f9f56a15f692c37eba4","score":"0.8392863","text":"public void reset(){\r\n\t\tscore = scoreVisual = 0;\r\n\t\tupdateScore();\r\n\t}","title":""},{"docid":"7fcabd4d7b4ae7ff8eb4c5c576b797c6","score":"0.81934947","text":"public void resetScores() {\r\n\t\t\r\n\t\ttrenchStats.getScore(ChatColor.RED + \"Players:\").setScore(red.getSize());\r\n\t\ttrenchStats.getScore(ChatColor.RED + \"Kills:\").setScore(0);\r\n\t\t\r\n\t\ttrenchStats.getScore(ChatColor.BLUE + \"Players:\").setScore(blue.getSize());\r\n\t\ttrenchStats.getScore(ChatColor.BLUE + \"Kills:\").setScore(0);\r\n\r\n\t}","title":""},{"docid":"2316f9234dcd6862207a0a059ad4c1f5","score":"0.80484325","text":"void clearScores();","title":""},{"docid":"f20f87277dfd918ec1d623ee43534d72","score":"0.80277","text":"private void clearScore() {\n Arrays.fill(score[0], 0);\n Arrays.fill(score[1], 0);\n }","title":""},{"docid":"da59001e0285945c2051767e1acc1890","score":"0.7983793","text":"public void refreshScore()\n\t{\n\t\tscore = 0;\n\t}","title":""},{"docid":"99278202eee9b77a77a1c7c9033b48ca","score":"0.77990156","text":"public void reset() {\n\t\tfor (ServerPeer s: spelers) {\n\t\t\ts.reset();\t\n\t\t}\n\t\tscoreboard = new HashMap<ServerPeer, Integer>();\n\t\tfor (ServerPeer s: spelers) {\n\t\t\tscoreboard.put(s, new Integer(0));\n\t\t}\n\t\teindeSpel = false;\n\t}","title":""},{"docid":"f8453b1e3a174e8bb503952caa11c6d3","score":"0.76569","text":"public void resetScore (View v) {\n scoreRogerFederer = 0;\n scoreRafaelNadal = 0;\n counterRogerFederer = 0;\n counterRafaelNadal = 0;\n displayForRogerFederer(scoreRogerFederer);\n displayForRafaelNadal(scoreRafaelNadal);\n\n }","title":""},{"docid":"dd31ba5bccbddb77a99404eb168b2404","score":"0.76385564","text":"public void resetScore(View v) {\n scoreTeamA = 0;\n scoreTeamB = 0;\n foulTeamA = 0;\n foulTeamB = 0;\n displayForTeamA(scoreTeamA);\n displayForTeamB(scoreTeamB);\n displayFoulForTeamA(foulTeamA);\n displayFoulForTeamB(foulTeamB);\n }","title":""},{"docid":"674f21c3e54df88471cd181b0ef55fba","score":"0.7549249","text":"public void reset(){\n totalScore = Unset;\n pinCounts.put(Ball.ONE, Unset);\n pinCounts.put(Ball.TWO, Unset);\n pinCounts.put(Ball.THREE, Unset);\n setFrameState(FrameState.ACTIVE);\n\n if(next != null)\n next.reset();\n }","title":""},{"docid":"278e32fd72348e7bde363f6746612b06","score":"0.75468343","text":"public void resetScoreTeamA() {\n scoreTeamA = 0;\n }","title":""},{"docid":"0554b0d2e0535c2e5216223644da0730","score":"0.7546004","text":"public void resetScore(View v) {\r\n scoreTeamOne = 0;\r\n scoreTeamTwo = 0;\r\n displayscoreTeamOne(scoreTeamOne);\r\n displayscoreTeamTwo(scoreTeamTwo);\r\n\r\n outTeamOne = 0;\r\n outTeamTwo = 0;\r\n displayoutTeamOne(outTeamOne);\r\n displayoutTeamTwo(outTeamTwo);\r\n\r\n strikeTeamOne = 0;\r\n strikeTeamTwo = 0;\r\n displaystrikeTeamOne(strikeTeamOne);\r\n displaystrikeTeamTwo(strikeTeamTwo);\r\n\r\n ballTeamOne = 0;\r\n ballTeamTwo = 0;\r\n displayballTeamOne(ballTeamOne);\r\n displayballTeamTwo(ballTeamTwo);\r\n }","title":""},{"docid":"2bd5b5543088c8383467dcf7de2abef2","score":"0.7534935","text":"public void resetScore(View v) {\n scoreTeamA = 0;\n scoreTeamB = 0;\n displayForTeamA( scoreTeamA );\n displayForTeamB( scoreTeamB );\n }","title":""},{"docid":"37fdb17f85a7051a8a0a14e606303b66","score":"0.75070345","text":"public void resetScoreAll(View view) {\n scoreTeamA = 0;\n scoreTeamB = 0;\n displayForTeamA(scoreTeamA);\n displayForTeamB(scoreTeamB);\n }","title":""},{"docid":"d9f7fbe434db93246d3597f2c3a9e5f1","score":"0.74911207","text":"public void resetScore(View v) {\n scoreTeamA = 0;\n scoreTeamB = 0;\n displayForTeamA(scoreTeamA);\n displayForTeamB(scoreTeamB);\n }","title":""},{"docid":"ee88b67bb3ac5ac66ffa941b81631ecb","score":"0.74822164","text":"public void resetScore(View v) {\n teamAScore = 0;\n teamBScore = 0;\n\n displayForTeamA(teamAScore);\n displayForTeamB(teamBScore);\n }","title":""},{"docid":"6e6b51c0756a0cb8a63901cd07e46a90","score":"0.74508697","text":"public int resetAndGetScore() {\r\n\t\tpoints = 0;\r\n\t\tthis.scorePoints();\r\n\t\treturn points;\r\n\t}","title":""},{"docid":"a6a56412688e706dafa7c7894766b5f4","score":"0.73953587","text":"public void reset(){\r\n\t\tframeCount=1;\r\n\t\trollNumber=1;\r\n\t\tpinsDown=0;\r\n\t\tfinalBowl=0;\r\n\t\tscore=0;\r\n\t\tbonus=0;\r\n\t\tisOver=false;\r\n\t}","title":""},{"docid":"21867eeae62f0f2990c402b621d2e928","score":"0.73886186","text":"public static void resetHighScore() {\r\n\t\tallScore = \"\";\r\n\t\tallNames = \"\";\r\n\t\tConstants.prefs.putInteger(\"highScore\", 0);\r\n\t\tConstants.prefs.putInteger(\"allNames\", 0);\r\n//\t\tConstants.prefs.putString(\"highScore\", allScore);\r\n\t\tConstants.prefs.flush();\r\n\t}","title":""},{"docid":"b164771b0d724e959f47be17b9eb303c","score":"0.73668456","text":"public void resetScore(View view) {\n goalsTeamA = 0;\n pointsTeamA = 0;\n goalsTeamB = 0;\n pointsTeamB = 0;\n\n displayForTeamA(goalsTeamA, pointsTeamA);\n displayForTeamB(goalsTeamB, pointsTeamB);\n }","title":""},{"docid":"2435cc6d5de43ef73c52c0bf5d470ace","score":"0.7255836","text":"public void resetScoreTeamB() {\n scoreTeamA = 0;\n }","title":""},{"docid":"39c22133fb4f3a27866b335f09d38223","score":"0.71391684","text":"public void resetScore(View view) {\n moneyScoreTeamA = 0;\n productsScoreTeamA = 0;\n moneyScoreTeamB = 0;\n productsScoreTeamB = 0;\n showScoreStatus = 0;\n String moneyMessage = \"€\" + moneyScoreTeamA;\n displayMoneyForTeamA(moneyMessage);\n displayProductsForTeamA(productsScoreTeamA);\n String moneyMessageB = \"€\" + moneyScoreTeamB;\n displayMoneyForTeamB(moneyMessageB);\n displayProductsForTeamB(productsScoreTeamB);\n\n String winMessageTeamA = \"\";\n String winMessageTeamB = \"\";\n String tieMessage = \"\";\n String winProductsMessageTeamA = \"\";\n String winProductsMessageTeamB = \"\";\n String tieMessageProducts = \"\";\n\n displayMoneyMessage(winMessageTeamA);\n displayMoneyMessage(winMessageTeamB);\n displayMoneyMessage(tieMessage);\n displayProductsMessage(winProductsMessageTeamA);\n displayProductsMessage(winProductsMessageTeamB);\n displayProductsMessage(tieMessageProducts);\n }","title":""},{"docid":"3108ed6cbc8a75ed8a60063ddd511fca","score":"0.7139042","text":"public void reset() {\n square = new Square(COURT_WIDTH, COURT_HEIGHT, Color.BLACK);\n //poison = new Poison(COURT_WIDTH, COURT_HEIGHT);\n \n snitch = null;\n double randNum = Math.random();\n if (randNum >= 0.5) {\n snitch = new HotPepperFruit(COURT_WIDTH, COURT_HEIGHT);\n } else {\n snitch = new LongFruit(COURT_WIDTH, COURT_HEIGHT);\n }\n \n playing = true;\n \n // write score to file if its in top 5 high scores\n this.reorderHighScores(gameScore, fruitScore);\n this.writeScores();\n \n // reset scores\n gameScore = 0;\n fruitScore = 0;\n status.setText(\"Playing game... Score: \" + gameScore + \" \"\n + scoresList[0] + \"&\" + fruitNumsList[0] + \"\\n\"\n + scoresList[1] + \"&\" + fruitNumsList[1] + \"\\n\"\n + scoresList[2] + \"&\" + fruitNumsList[2] + \"\\n\"\n + scoresList[3] + \"&\" + fruitNumsList[3] + \"\\n\"\n + scoresList[4] + \"&\" + fruitNumsList[4] + \"\\n\"\n + \" Instructions: Move the snake using up/down/right/left \"\n + \"and eat all the fruit. 20 points for the green fruit and 50 \"\n + \"for the red fruit. You lose when you hit the wall!\");\n \n \n\n // Make sure that this component has the keyboard focus\n requestFocusInWindow();\n }","title":""},{"docid":"cd3ff0883ec9191b6ea5d0d63ef6ee46","score":"0.7115553","text":"public Builder clearScores() {\n scores_ = emptyIntList();\n bitField0_ = (bitField0_ & ~0x00000080);\n onChanged();\n return this;\n }","title":""},{"docid":"54290e2e0e64e7b8c6112f6a9f9d86cc","score":"0.7090228","text":"public void reset () {\n currentQuestionIndex = 0;\n score = 0;\n Collections.shuffle(questions);\n }","title":""},{"docid":"cfdf08b9e113ea00fcf0ac462e187ca2","score":"0.70782745","text":"public static void Resets(){\n\t\tfor(int i = 0; i < horseinrace.size(); i ++){\n\t\t\thorseinrace.get(i).SetRunningPos(0);\n\t\t\twinners[i] = 0 ;\n\t\t\thorseinrace.clear();\n\t\t}\n\t\tresultclosed = false;\n\t}","title":""},{"docid":"bc25c69623ee8f16047a28722de2af7e","score":"0.70777357","text":"public void resetPoints()\n\t{\n\t\tpoints = new ArrayList<Point>();\n\t\tYScores = new ArrayList<Double>();\n\t\tXScores = new ArrayList<Double>();\n\t}","title":""},{"docid":"a7136598e862746f66c54c74e2aa1a8f","score":"0.70524466","text":"@Override\n protected void resetOrganScores(){\n organScores.clear();\n organScores.put(CCOrganScores.APPENDIX, 1f);\n organScores.put(CCOrganScores.INTESTINE, 4f);\n organScores.put(CCOrganScores.KIDNEY, 2f);\n organScores.put(CCOrganScores.LIVER, 1f);\n organScores.put(CCOrganScores.SPLEEN, 1f);\n organScores.put(CCOrganScores.STOMACH, 1f);\n organScores.put(CCOrganScores.LUNG, 2f);\n }","title":""},{"docid":"56e45edf637adaaf1b72958baee9b9a7","score":"0.7003129","text":"public static void resetDieScore()\n\t{\n\t\tvalue_from_die = 0;\n\t}","title":""},{"docid":"ae119318ffbf7c305b2e5fc3b10ae2cb","score":"0.7001829","text":"public void setOverallScore(){\n //Empty since I wont be setting anything\n \n }","title":""},{"docid":"9bc37dabfacc6dd2ddebebf190623907","score":"0.6998757","text":"public void clear() {\r\n this.scoreInfos.clear();\r\n }","title":""},{"docid":"0a525e96b81cd49d63f8c146bc2014e0","score":"0.69981825","text":"public void reset()\r\n { \r\n for (int i = 0; i < RUBRICS; ++i)\r\n for (int j = 0; i < WEIGHTS; ++i)\r\n {\r\n keywordsUsed[i][j].clear();\r\n wordCounts[i][j] = 0;\r\n }\r\n \r\n scores = new double[RUBRICS+1];\r\n keywordTree.reset();\r\n totalWords = 0;\r\n }","title":""},{"docid":"2a1fa545efef18415c79ffc329029c45","score":"0.6991006","text":"public void resetBestScore() {\n\t\tmBestScore = 0;\n\t\tmBestScoreTV.setText(String.valueOf(mBestScore));\n\t}","title":""},{"docid":"a10a5d562db6ea08589b5523b48bfd5c","score":"0.6972012","text":"public void setInitialScore()\n\t{\n\t\tthis.blackScore = 2;\n\t\tthis.whiteScore = 2;\n\t}","title":""},{"docid":"c59bfea43356ba3530b6c279b7a8e467","score":"0.69646835","text":"public void clear() {\n this.topScore.clear();\n }","title":""},{"docid":"8e56645b470e5974ee1b9bc3dfa0e5bb","score":"0.69471747","text":"public void resetStats() {\n health = 100;\n hurt = false;\n hurtTime = 0;\n }","title":""},{"docid":"2f24a8b33282d65880e75dcf0a9ebcea","score":"0.69379616","text":"public void reset() {\n statistics = new MatchupStatistics();\n }","title":""},{"docid":"53aeb9ac50e8d7d2fddc58efe6674b68","score":"0.68934256","text":"public void resetScoreAndWickets(View view) {\n scoreTeamA = 0;\n scoreTeamB = 0;\n wicketsTeamA = 0;\n wicketsTeamB = 0;\n displayScoreForTeamA(scoreTeamA);\n displayScoreForTeamB(scoreTeamB);\n displayWicketsForTeamA(wicketsTeamA);\n displayWicketsForTeamB(wicketsTeamB);\n }","title":""},{"docid":"17978a3f33edcf54230ba35bd39abe7a","score":"0.68454933","text":"public void resetStats() {\n recursionSteps = -1;\n swap = 0;\n compare = 0;\n }","title":""},{"docid":"f291352d62be93081262db8495387e93","score":"0.6810226","text":"public void clear() {\n highScores.clear();\n }","title":""},{"docid":"5469a798a7b429111d4cd7c19aff0c9f","score":"0.6776736","text":"public void reset() {\r\n\t\t\r\n\t\troll_count = 0;\r\n\t\t\r\n\t}","title":""},{"docid":"613a4256c41612f915f2e392f21ad6b9","score":"0.6772928","text":"public Builder clearScore() {\n \n score_ = 0;\n onChanged();\n return this;\n }","title":""},{"docid":"31e90e205d8a35c5f947f6c83e56760f","score":"0.67694134","text":"public void resetBoard() {\n for (int y = 0; y < 13; y++) {\n if (players[whoseTurn].scoreObj[y].used != true) {\n players[whoseTurn].scoreObj[y].value = 0;\n scoreField[y].setBackground(Color.WHITE);\n scoreField[y].setText(\" \");\n } else {\n scoreField[y].setText(\" \" + players[whoseTurn].scoreObj[y].value);\n }\n }\n }","title":""},{"docid":"549c78ec40b362e3a26def58823380a8","score":"0.67622954","text":"public void scores(){\n\t\tscore.increase();\n\t\tincreaseHeight();\n\t}","title":""},{"docid":"8042ea1796e246a6bb17112477ca1c9d","score":"0.675702","text":"public void resetCounters()\n\t{\n\t\tfinal Cursor< LongType > cursor = counts.cursor();\n\t\twhile ( cursor.hasNext() )\n\t\t{\n\t\t\tcursor.next().setZero();\n\t\t}\n\t\ttotalValues = 0;\n\t}","title":""},{"docid":"9afb2c8029a6fd37d12e688cedaaab84","score":"0.6740592","text":"public void resetScoreTeamA(View view) {\n scoreTeamA = 0;\n displayForTeamA(scoreTeamA);\n }","title":""},{"docid":"857d5fcce941b27752e962ae220e4828","score":"0.67220855","text":"public void reset() {\n\t\t_cnt = 0;\n\t\t_err = 0;\n\t\t_err_timestamp = 0;\n\t\t_max = 0;\n\t\t_max_timestamp = 0;\n\t\t_min_timestamp = 0;\n\t\t_avg = 0;\n\t\t_avg_max_timestamp = 0;\n\t\t_avg_min_timestamp = 0;\n\t}","title":""},{"docid":"8efcb3186c1dee4ae8d862006624bdc2","score":"0.67192","text":"public void reset(View view) {\n scoreTeamB = 0;\n scoreTeamA = 0;\n displayForTeamB(scoreTeamB);\n displayForTeamA(scoreTeamA);\n }","title":""},{"docid":"736efc9fbf4bb27715fc105234b0528a","score":"0.67020696","text":"public void reset()\n\t{\t\t\n\t\tsuper.reset();\n\t\ttotalCosts = 0;\n\t}","title":""},{"docid":"26326c794ec8ebd55368b6ccb2aca711","score":"0.66900086","text":"public void resetScores(View view){\n MediaPlayer woosh = MediaPlayer.create(ScoresActivity.this,R.raw.woosh); woosh.start();\n writeStudentLevels(\"1,1,1,1,1,1\",this);\n TextView io = findViewById(R.id.io_score_view);\n io.setText(String.format(\"%1$-\" + 28 + \"s\", \"Input/Output_\").replace(' ', '=').replace('_',' ') + \" 1\");\n TextView var = findViewById(R.id.var_score_view);\n var.setText(String.format(\"%1$-\" + 28 + \"s\", \"Variables_\").replace(' ', '=').replace('_',' ') + \" 1\");\n TextView con = findViewById(R.id.con_score_view);\n con.setText(String.format(\"%1$-\" + 28 + \"s\", \"Control_Structures_\").replace(' ', '=').replace('_',' ') + \" 1\");\n TextView ds = findViewById(R.id.ds_score_view);\n ds.setText(String.format(\"%1$-\" + 28 + \"s\", \"Data_Structures_\").replace(' ', '=').replace('_',' ') + \" 1\");\n TextView fun = findViewById(R.id.fun_score_view);\n fun.setText(String.format(\"%1$-\" + 28 + \"s\", \"Functions_\").replace(' ', '=').replace('_',' ') + \" 1\");\n TextView oop = findViewById(R.id.oop_score_view);\n oop.setText(String.format(\"%1$-\" + 28 + \"s\", \"Object-Oriented_Principles_\").replace(' ', '=').replace('_',' ') + \" 1\");\n }","title":""},{"docid":"86bd4625d3d1f52e35ff5f003e697863","score":"0.66857964","text":"ScoreGrid()\n {\n scoreSheet = new Integer[SCORE_SHEET_ROWS.length];\n Arrays.fill(scoreSheet, NO_SCORE);\n yahtzeeBonuses = 0;\n scorer = new Scorer();\n }","title":""},{"docid":"d0fbd6f609a059e410744f86d5474193","score":"0.6676198","text":"public Builder clearScore() {\n bitField0_ = (bitField0_ & ~0x00000002);\n score_ = 0;\n onChanged();\n return this;\n }","title":""},{"docid":"d0fbd6f609a059e410744f86d5474193","score":"0.66752523","text":"public Builder clearScore() {\n bitField0_ = (bitField0_ & ~0x00000002);\n score_ = 0;\n onChanged();\n return this;\n }","title":""},{"docid":"d0fbd6f609a059e410744f86d5474193","score":"0.66752523","text":"public Builder clearScore() {\n bitField0_ = (bitField0_ & ~0x00000002);\n score_ = 0;\n onChanged();\n return this;\n }","title":""},{"docid":"d0fbd6f609a059e410744f86d5474193","score":"0.6675236","text":"public Builder clearScore() {\n bitField0_ = (bitField0_ & ~0x00000002);\n score_ = 0;\n onChanged();\n return this;\n }","title":""},{"docid":"40f52a2aa0be81786e17237f7ba2bf98","score":"0.66636246","text":"public void resetStats() {\n\t\tpersister.resetStatistics();\n\t}","title":""},{"docid":"6d899e1c3a99df36bcd50932a897a2db","score":"0.66610783","text":"public Builder clearScore() {\n bitField0_ = (bitField0_ & ~0x00000004);\n score_ = 0;\n onChanged();\n return this;\n }","title":""},{"docid":"331bd1c23c3086aa8b09f9c390273e7a","score":"0.6655831","text":"public void resetStatistics()\n\t{\n\t\tthis.stats.reset();\n\t}","title":""},{"docid":"c7fee47275cb7bd8c112372029745c87","score":"0.66457","text":"public static void setNewScoreList() {\r\n\t for(int i = 0; i < 8; i++){\r\n\t\t player_scores[i] = 0;\r\n\t }\r\n }","title":""},{"docid":"4921b0193b53eed9f974800c5a787f5d","score":"0.6626416","text":"public void reset(View view){\n teamAScore = 0;\n teamBScore = 0;\n String str = \"\";\n displayResult(str);\n displayForTeamA(teamAScore);\n displayForTeamB(teamBScore);\n }","title":""},{"docid":"f2a280f646803f69ebd045606a06faed","score":"0.6619686","text":"@Override\r\n public void reset() {\n super.reset(); \r\n //sets health to normal value\r\n health = 140;\r\n }","title":""},{"docid":"7a8dbb9f5d381c9e4587271965330523","score":"0.6611312","text":"private void resetGame() {\n // Reset variables\n play = false;\n win = false;\n myScore = 0;\n myLives = 3;\n myLevel = 1;\n\n myBall.setSpeed(150);\n myBall.reset();\n\n myPaddle.setSpeed(10);\n myPaddle.reset();\n\n removeBlocks();\n removePowers();\n\n myBlocks = new ArrayList<>();\n MapGenerator(numRow + myLevel, numCol);\n\n updateStatus();\n }","title":""},{"docid":"5208ab9187972786e13c1937a4337147","score":"0.66104114","text":"static void resetGame() {\n\t\tguessesleft = 4; \n\t\twins = 0; \n\t\ttokens = 0; \n\t\tBoxPane1.setInfo(\"Make a guess\");\n\t}","title":""},{"docid":"881af15bba652062baded30886557fec","score":"0.65931034","text":"public void clearHighScores(){\n\n Resources res = context.getResources();\n\n //Get the stored total number of high scores from resources\n int totalHS = res.getInteger(R.integer.total_high_scores);\n\n String defaultName = res.getString(R.string.hsn_default);\n int defaultValue = res.getInteger(R.integer.hs_default);\n\n //Get an array of keys for the high scores and their attached names from resources.\n String[] hs_keys = res.getStringArray(R.array.hs_keys);\n String[] hsn_keys = res.getStringArray(R.array.hsn_keys);\n\n for(int i = 0; i < totalHS; i++){\n\n editHighScore(defaultName, defaultValue, hsn_keys[i], hs_keys[i]);\n }\n }","title":""},{"docid":"72a8b04d874319ba4e653927fb5a4231","score":"0.65541536","text":"public void updateScore()\n\t{\n\t\tthis.blackScore = black.getScore();\n\t\tthis.whiteScore = white.getScore();\n\t}","title":""},{"docid":"0ce4f5548f44b8352984faaeade67887","score":"0.65412456","text":"void resetCounters() {\n this.resetCounter = 0;\n this.splitBridgeCounter = 0;\n }","title":""},{"docid":"591e3293167a5a6384437a075c3136be","score":"0.6532153","text":"public void resetStats() {\n replay.resetStats();\n aggProtoStats.clear();\n if (protocol != null) {\n protocol.resetStats();\n }\n consistencyTracker.resetStats();\n }","title":""},{"docid":"f460b4e0d4115c827f23b256a62895a3","score":"0.65274423","text":"public static void resetValues() {\r\n\t\taction = 6;\r\n\t\tlocX = 0;\r\n\t\tlocY = 0;\r\n\t\tpower = 5;\r\n\t\tbatteries = 0;\r\n\t\tturn = 0;\r\n\t}","title":""},{"docid":"cb058141166ef224001a06f370215677","score":"0.6526788","text":"public Builder clearScore() {\n bitField0_ = (bitField0_ & ~0x00000002);\n score_ = false;\n onChanged();\n return this;\n }","title":""},{"docid":"0ed9119986267842427bcaf02119a674","score":"0.6519124","text":"public void restart() {\n this.moves = 0;\n this.score = 0;\n board.init();\n board.addNew();\n }","title":""},{"docid":"095cce9a6c894151018e3881c008cabb","score":"0.6518124","text":"private void resetGame() {\r\n System.out.println(\"count p1 is ? \" + sCountForWinP1\r\n + \"-* count p2 ?? \" + sCountForWinP2\r\n + \"-* count darw ?? \" + sCountForDraw);\r\n //boardXO = 0;\r\n Arrays.fill(boardXO, 0);\r\n lastPlayerTurn = 0;\r\n winner = 0;\r\n countForMove = 0;\r\n isPlayerWin = \"f\";\r\n isNoPlayerWin = \"f\";\r\n finalBoardXO.clear();\r\n vaildTurn = \"t\";\r\n validMove = \"t\";\r\n //counPlyer = 0; // make a problem\r\n }","title":""},{"docid":"e1f238d1c2620d2fa0d69f81faa3dc09","score":"0.65148383","text":"public void reset () {\n\t\tturnNum = 0;\n\t\tboxValues = new String[9];\n\t}","title":""},{"docid":"763c2d2a275934fbef1b8b793c1fe71f","score":"0.6496123","text":"private void reset() {\r\n //Teams\r\n teamOne.clear();\r\n teamTwo.clear();\r\n\r\n //Game variables\r\n shipType = 1;\r\n deathLimit = 2;\r\n keepDeaths = false;\r\n evenTeams = false;\r\n roundNumber = 1;\r\n\r\n //Other variables\r\n lockArena = false;\r\n isUneven = false;\r\n\r\n //Cancel all timers\r\n m_botAction.cancelTasks();\r\n }","title":""},{"docid":"bae1c4efc5d6a57660d13d1c2f235329","score":"0.6488756","text":"void resets();","title":""},{"docid":"0a08f7a91eed563ec45a4403de967601","score":"0.64727634","text":"public void reset() {\n\t\t_left.resetTachoCount();\n\t\t_right.resetTachoCount();\n\t}","title":""},{"docid":"4b9c02a46bd3e2bd56e16a0e7d8f2c93","score":"0.64710253","text":"public void setScore(int score) {\n if (score < 0) {\n this.score = 0;\n } else {\n this.score = score;\n }\n }","title":""},{"docid":"e6d25faff2195b1e5edee7da2faebd75","score":"0.64694196","text":"public void Reset(View view) {\n userScore = 0; userTurnScore = 0; compScore = 0; compTurnScore = 0;\n handler.removeCallbacks(timerRunnable);\n handler.removeCallbacks(timerRunnable2);\n updateScore(userTurnScore);\n Button one = (Button) findViewById(R.id.button1);\n Button two = (Button) findViewById(R.id.button2);\n one.setClickable(true); //enable these buttons while user plays\n two.setClickable(true);\n one.setText(\"Roll\");\n two.setText(\"Hold\");\n ImageView imageView = (ImageView) findViewById(R.id.imageView1);\n imageView.setImageResource(R.drawable.dice1);\n TextView textView = (TextView) findViewById(R.id.textView3);\n textView.setVisibility(TextView.INVISIBLE);\n }","title":""},{"docid":"3b66182a89b8e62fc41590f406476345","score":"0.64656085","text":"public void reset(){\n \tthis.maxEnergy = BASE_MAX_ENERGY;\n \tthis.curEnergy = BASE_MAX_ENERGY;\n \tthis.curHealth = MAX_HEALTH;\n \tthis.nextShotCountDown = 0;\n \tthis.position = new oop.ex2.SpaceShipPhysics();\n }","title":""},{"docid":"b5fd841ad2c73a2a687d73a8ab0096a6","score":"0.6451458","text":"private void reset() {\n pnlDashboardStats.reset();\n }","title":""},{"docid":"b6ea0b0f0ff209a289f2df778a0edcf5","score":"0.6445361","text":"public void reset(){\n\t\tarray.clear();\n\t\tsplits.clear();\n\t\tvarIndices.clear();\n\t\tvars.clear();\n\t\tvarNames.clear();\n\t\thook = null;\n\t\tarCursor = 0;\n\t\tvarID = 0;\n\t}","title":""},{"docid":"8d37ac7d3bbb9b83e2b01114e8f46f26","score":"0.6437237","text":"public void reset()\n\t{\n\t\twarnings = errors = 0;\n\t}","title":""},{"docid":"1cdd27ea51798552fecbbc82c94abb4e","score":"0.64366466","text":"public static void reset() {\n\t\tdeadline = 0;\n\t\tmoney = 0;\n\t\ttimestamp = 0;\n//\t\tstep = 0;\n\t\tjobsCompleted = 0;\n\t}","title":""},{"docid":"5519a6e64826f6d440f9c7a31c6a132e","score":"0.64305466","text":"public Builder clearRankScore() {\n \n rankScore_ = 0D;\n onChanged();\n return this;\n }","title":""},{"docid":"3db798b6ee6b5d10346c5aa01da9d731","score":"0.64279485","text":"private void resetGame()\n {\n valid.setText(\"\");\n isVisited.setText(\"\");\n largeBoard.setDisable(false);\n smallBoard.setDisable(false);\n player.reset();\n score.setText(\"Score: \" + player.getScore());\n guesses.setText(\"Guessed Words:\" + player.getGuessedWords());\n invalidWords.clear();\n badGuesses.setText(\"Invalid Guessed Words:\" + invalidWords);\n resetTimer();\n clearBoard(gBoard);\n }","title":""},{"docid":"8bef1a64a129294dbb77d701b319d7f0","score":"0.64151347","text":"public void resetCounter(){\n\t\tcounter=0;\r\n\t}","title":""},{"docid":"1d91d58645dc21e218215029750a3f45","score":"0.641417","text":"private void resetGame() {\n animatedImageYouWin.reset();\n lastLevelIsComplete = false;\n levelNum = 0;\n userInterface.setLevelNum(levelNum + 1);\n resetLevel();\n }","title":""},{"docid":"d56d26f27ee60b0968e9624586847f26","score":"0.64138174","text":"public void reset() {\r\n \r\n this.setSize(900,600);\r\n this.addKeyListener(this);\r\n \r\n // Applet only\r\n laser = new Sound(\"laser80.wav\");\r\n shipHit = new Sound(\"explode0.wav\");\r\n asteroidHit = new Sound(\"explode1.wav\");\r\n thruster = new Sound(\"thruster.wav\");\r\n \r\n rocks = new AsteroidHandler();\r\n explosions = new ExplosionHandler();\r\n stars = new StarsHandler();\r\n powerups = new PowerupHandler();\r\n ship = new Spacecraft(explosions, laser);\r\n \r\n shieldRemaining = new ProgressBar(735, 10, 1);\r\n \r\n upKeyPressed = false;\r\n downKeyPressed = false;\r\n rightKeyPressed = false;\r\n leftKeyPressed = false;\r\n spaceBarPressed = false;\r\n shiftKeyPressed = false;\r\n score = 0;\r\n isOddFrame = false;\r\n \r\n showHighScores = false;\r\n \r\n framerate = new Timer(20, this);\r\n }","title":""},{"docid":"dd79d2421a54ca8dfcb1dce527ba06e2","score":"0.641183","text":"public void setScore(int score)\r\n {\r\n Score = score;\r\n }","title":""},{"docid":"939a235bb3754a165efbd189fb0e0dfb","score":"0.6408669","text":"public void pointsReset () {\n pointsForTeamA = 0;\n displayForTeamA(pointsForTeamA);\n pointsForTeamB = 0;\n displayForTeamB(pointsForTeamB);\n }","title":""},{"docid":"352c1c02cb9a7a15959015a009077104","score":"0.63916355","text":"public void resetGame() {\n previous_states.clear();\n resetRenders();\n capturedWhite = 0;\n capturedBlack = 0;\n in_play = true;\n current_player = 2;\n opposing = 1;\n winnerLabel.setVisible(false);\n }","title":""},{"docid":"433833a751dd84d13c27d067d81dfba5","score":"0.6386684","text":"public void reset() {\n gameInProgress = false;\n players.clear();\n }","title":""}],"string":"[\n {\n \"docid\": \"c8dbbc076e57f2c8ef740f264766447c\",\n \"score\": \"0.89652145\",\n \"text\": \"public void resetScore() {\\r\\n\\t\\tscore = 0;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e86f2aa05cb9f1870593be914598418a\",\n \"score\": \"0.8957344\",\n \"text\": \"public void resetScore() {\\n this.score = 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2744f066aa59d3bc2942deb5307b7a04\",\n \"score\": \"0.8840269\",\n \"text\": \"public void reset() {\\n this.score = 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"42dec0f6668c1f6411e3c78e83819ca4\",\n \"score\": \"0.8839727\",\n \"text\": \"public void reset() {\\n\\t\\tcurrentScore = 0;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"22afc1d6deff3a966dd84f997d6261cb\",\n \"score\": \"0.88343114\",\n \"text\": \"public static void resetScore() {\\r\\n score = 0;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6b9740bf8df25581e72081c3b0d35cb9\",\n \"score\": \"0.8636276\",\n \"text\": \"public void resetScore(){\\n myInformation.put(SCORE, INITIAL_SCORE);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b28accc3290cddcc59171bd2444782f6\",\n \"score\": \"0.86223817\",\n \"text\": \"public void reset() {\\n score = 0;\\n displayScore = 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"faba181ed1dfe9799bd4e30b4d49ec62\",\n \"score\": \"0.85684144\",\n \"text\": \"public static void resetScores(){\\n\\t\\tscores[PLAYER1] = scores[PLAYER2] = 0;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"daf2081e7ae68d68b450e8d3f441115d\",\n \"score\": \"0.84865004\",\n \"text\": \"public void resetScore() {\\r\\n this.playerOneScore = 0;\\r\\n this.playerTwoScore = 0;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a84f8d0b79438fac60900536a952d2b\",\n \"score\": \"0.8460037\",\n \"text\": \"public static void resetScore()\\r\\n {\\n right = 0;\\r\\n left = 0;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8ed5877505f45f9f56a15f692c37eba4\",\n \"score\": \"0.8392863\",\n \"text\": \"public void reset(){\\r\\n\\t\\tscore = scoreVisual = 0;\\r\\n\\t\\tupdateScore();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7fcabd4d7b4ae7ff8eb4c5c576b797c6\",\n \"score\": \"0.81934947\",\n \"text\": \"public void resetScores() {\\r\\n\\t\\t\\r\\n\\t\\ttrenchStats.getScore(ChatColor.RED + \\\"Players:\\\").setScore(red.getSize());\\r\\n\\t\\ttrenchStats.getScore(ChatColor.RED + \\\"Kills:\\\").setScore(0);\\r\\n\\t\\t\\r\\n\\t\\ttrenchStats.getScore(ChatColor.BLUE + \\\"Players:\\\").setScore(blue.getSize());\\r\\n\\t\\ttrenchStats.getScore(ChatColor.BLUE + \\\"Kills:\\\").setScore(0);\\r\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2316f9234dcd6862207a0a059ad4c1f5\",\n \"score\": \"0.80484325\",\n \"text\": \"void clearScores();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f20f87277dfd918ec1d623ee43534d72\",\n \"score\": \"0.80277\",\n \"text\": \"private void clearScore() {\\n Arrays.fill(score[0], 0);\\n Arrays.fill(score[1], 0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"da59001e0285945c2051767e1acc1890\",\n \"score\": \"0.7983793\",\n \"text\": \"public void refreshScore()\\n\\t{\\n\\t\\tscore = 0;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"99278202eee9b77a77a1c7c9033b48ca\",\n \"score\": \"0.77990156\",\n \"text\": \"public void reset() {\\n\\t\\tfor (ServerPeer s: spelers) {\\n\\t\\t\\ts.reset();\\t\\n\\t\\t}\\n\\t\\tscoreboard = new HashMap<ServerPeer, Integer>();\\n\\t\\tfor (ServerPeer s: spelers) {\\n\\t\\t\\tscoreboard.put(s, new Integer(0));\\n\\t\\t}\\n\\t\\teindeSpel = false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f8453b1e3a174e8bb503952caa11c6d3\",\n \"score\": \"0.76569\",\n \"text\": \"public void resetScore (View v) {\\n scoreRogerFederer = 0;\\n scoreRafaelNadal = 0;\\n counterRogerFederer = 0;\\n counterRafaelNadal = 0;\\n displayForRogerFederer(scoreRogerFederer);\\n displayForRafaelNadal(scoreRafaelNadal);\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dd31ba5bccbddb77a99404eb168b2404\",\n \"score\": \"0.76385564\",\n \"text\": \"public void resetScore(View v) {\\n scoreTeamA = 0;\\n scoreTeamB = 0;\\n foulTeamA = 0;\\n foulTeamB = 0;\\n displayForTeamA(scoreTeamA);\\n displayForTeamB(scoreTeamB);\\n displayFoulForTeamA(foulTeamA);\\n displayFoulForTeamB(foulTeamB);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"674f21c3e54df88471cd181b0ef55fba\",\n \"score\": \"0.7549249\",\n \"text\": \"public void reset(){\\n totalScore = Unset;\\n pinCounts.put(Ball.ONE, Unset);\\n pinCounts.put(Ball.TWO, Unset);\\n pinCounts.put(Ball.THREE, Unset);\\n setFrameState(FrameState.ACTIVE);\\n\\n if(next != null)\\n next.reset();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"278e32fd72348e7bde363f6746612b06\",\n \"score\": \"0.75468343\",\n \"text\": \"public void resetScoreTeamA() {\\n scoreTeamA = 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0554b0d2e0535c2e5216223644da0730\",\n \"score\": \"0.7546004\",\n \"text\": \"public void resetScore(View v) {\\r\\n scoreTeamOne = 0;\\r\\n scoreTeamTwo = 0;\\r\\n displayscoreTeamOne(scoreTeamOne);\\r\\n displayscoreTeamTwo(scoreTeamTwo);\\r\\n\\r\\n outTeamOne = 0;\\r\\n outTeamTwo = 0;\\r\\n displayoutTeamOne(outTeamOne);\\r\\n displayoutTeamTwo(outTeamTwo);\\r\\n\\r\\n strikeTeamOne = 0;\\r\\n strikeTeamTwo = 0;\\r\\n displaystrikeTeamOne(strikeTeamOne);\\r\\n displaystrikeTeamTwo(strikeTeamTwo);\\r\\n\\r\\n ballTeamOne = 0;\\r\\n ballTeamTwo = 0;\\r\\n displayballTeamOne(ballTeamOne);\\r\\n displayballTeamTwo(ballTeamTwo);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2bd5b5543088c8383467dcf7de2abef2\",\n \"score\": \"0.7534935\",\n \"text\": \"public void resetScore(View v) {\\n scoreTeamA = 0;\\n scoreTeamB = 0;\\n displayForTeamA( scoreTeamA );\\n displayForTeamB( scoreTeamB );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"37fdb17f85a7051a8a0a14e606303b66\",\n \"score\": \"0.75070345\",\n \"text\": \"public void resetScoreAll(View view) {\\n scoreTeamA = 0;\\n scoreTeamB = 0;\\n displayForTeamA(scoreTeamA);\\n displayForTeamB(scoreTeamB);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d9f7fbe434db93246d3597f2c3a9e5f1\",\n \"score\": \"0.74911207\",\n \"text\": \"public void resetScore(View v) {\\n scoreTeamA = 0;\\n scoreTeamB = 0;\\n displayForTeamA(scoreTeamA);\\n displayForTeamB(scoreTeamB);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ee88b67bb3ac5ac66ffa941b81631ecb\",\n \"score\": \"0.74822164\",\n \"text\": \"public void resetScore(View v) {\\n teamAScore = 0;\\n teamBScore = 0;\\n\\n displayForTeamA(teamAScore);\\n displayForTeamB(teamBScore);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6e6b51c0756a0cb8a63901cd07e46a90\",\n \"score\": \"0.74508697\",\n \"text\": \"public int resetAndGetScore() {\\r\\n\\t\\tpoints = 0;\\r\\n\\t\\tthis.scorePoints();\\r\\n\\t\\treturn points;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a6a56412688e706dafa7c7894766b5f4\",\n \"score\": \"0.73953587\",\n \"text\": \"public void reset(){\\r\\n\\t\\tframeCount=1;\\r\\n\\t\\trollNumber=1;\\r\\n\\t\\tpinsDown=0;\\r\\n\\t\\tfinalBowl=0;\\r\\n\\t\\tscore=0;\\r\\n\\t\\tbonus=0;\\r\\n\\t\\tisOver=false;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"21867eeae62f0f2990c402b621d2e928\",\n \"score\": \"0.73886186\",\n \"text\": \"public static void resetHighScore() {\\r\\n\\t\\tallScore = \\\"\\\";\\r\\n\\t\\tallNames = \\\"\\\";\\r\\n\\t\\tConstants.prefs.putInteger(\\\"highScore\\\", 0);\\r\\n\\t\\tConstants.prefs.putInteger(\\\"allNames\\\", 0);\\r\\n//\\t\\tConstants.prefs.putString(\\\"highScore\\\", allScore);\\r\\n\\t\\tConstants.prefs.flush();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b164771b0d724e959f47be17b9eb303c\",\n \"score\": \"0.73668456\",\n \"text\": \"public void resetScore(View view) {\\n goalsTeamA = 0;\\n pointsTeamA = 0;\\n goalsTeamB = 0;\\n pointsTeamB = 0;\\n\\n displayForTeamA(goalsTeamA, pointsTeamA);\\n displayForTeamB(goalsTeamB, pointsTeamB);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2435cc6d5de43ef73c52c0bf5d470ace\",\n \"score\": \"0.7255836\",\n \"text\": \"public void resetScoreTeamB() {\\n scoreTeamA = 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"39c22133fb4f3a27866b335f09d38223\",\n \"score\": \"0.71391684\",\n \"text\": \"public void resetScore(View view) {\\n moneyScoreTeamA = 0;\\n productsScoreTeamA = 0;\\n moneyScoreTeamB = 0;\\n productsScoreTeamB = 0;\\n showScoreStatus = 0;\\n String moneyMessage = \\\"€\\\" + moneyScoreTeamA;\\n displayMoneyForTeamA(moneyMessage);\\n displayProductsForTeamA(productsScoreTeamA);\\n String moneyMessageB = \\\"€\\\" + moneyScoreTeamB;\\n displayMoneyForTeamB(moneyMessageB);\\n displayProductsForTeamB(productsScoreTeamB);\\n\\n String winMessageTeamA = \\\"\\\";\\n String winMessageTeamB = \\\"\\\";\\n String tieMessage = \\\"\\\";\\n String winProductsMessageTeamA = \\\"\\\";\\n String winProductsMessageTeamB = \\\"\\\";\\n String tieMessageProducts = \\\"\\\";\\n\\n displayMoneyMessage(winMessageTeamA);\\n displayMoneyMessage(winMessageTeamB);\\n displayMoneyMessage(tieMessage);\\n displayProductsMessage(winProductsMessageTeamA);\\n displayProductsMessage(winProductsMessageTeamB);\\n displayProductsMessage(tieMessageProducts);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3108ed6cbc8a75ed8a60063ddd511fca\",\n \"score\": \"0.7139042\",\n \"text\": \"public void reset() {\\n square = new Square(COURT_WIDTH, COURT_HEIGHT, Color.BLACK);\\n //poison = new Poison(COURT_WIDTH, COURT_HEIGHT);\\n \\n snitch = null;\\n double randNum = Math.random();\\n if (randNum >= 0.5) {\\n snitch = new HotPepperFruit(COURT_WIDTH, COURT_HEIGHT);\\n } else {\\n snitch = new LongFruit(COURT_WIDTH, COURT_HEIGHT);\\n }\\n \\n playing = true;\\n \\n // write score to file if its in top 5 high scores\\n this.reorderHighScores(gameScore, fruitScore);\\n this.writeScores();\\n \\n // reset scores\\n gameScore = 0;\\n fruitScore = 0;\\n status.setText(\\\"Playing game... Score: \\\" + gameScore + \\\" \\\"\\n + scoresList[0] + \\\"&\\\" + fruitNumsList[0] + \\\"\\\\n\\\"\\n + scoresList[1] + \\\"&\\\" + fruitNumsList[1] + \\\"\\\\n\\\"\\n + scoresList[2] + \\\"&\\\" + fruitNumsList[2] + \\\"\\\\n\\\"\\n + scoresList[3] + \\\"&\\\" + fruitNumsList[3] + \\\"\\\\n\\\"\\n + scoresList[4] + \\\"&\\\" + fruitNumsList[4] + \\\"\\\\n\\\"\\n + \\\" Instructions: Move the snake using up/down/right/left \\\"\\n + \\\"and eat all the fruit. 20 points for the green fruit and 50 \\\"\\n + \\\"for the red fruit. You lose when you hit the wall!\\\");\\n \\n \\n\\n // Make sure that this component has the keyboard focus\\n requestFocusInWindow();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd3ff0883ec9191b6ea5d0d63ef6ee46\",\n \"score\": \"0.7115553\",\n \"text\": \"public Builder clearScores() {\\n scores_ = emptyIntList();\\n bitField0_ = (bitField0_ & ~0x00000080);\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"54290e2e0e64e7b8c6112f6a9f9d86cc\",\n \"score\": \"0.7090228\",\n \"text\": \"public void reset () {\\n currentQuestionIndex = 0;\\n score = 0;\\n Collections.shuffle(questions);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cfdf08b9e113ea00fcf0ac462e187ca2\",\n \"score\": \"0.70782745\",\n \"text\": \"public static void Resets(){\\n\\t\\tfor(int i = 0; i < horseinrace.size(); i ++){\\n\\t\\t\\thorseinrace.get(i).SetRunningPos(0);\\n\\t\\t\\twinners[i] = 0 ;\\n\\t\\t\\thorseinrace.clear();\\n\\t\\t}\\n\\t\\tresultclosed = false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc25c69623ee8f16047a28722de2af7e\",\n \"score\": \"0.70777357\",\n \"text\": \"public void resetPoints()\\n\\t{\\n\\t\\tpoints = new ArrayList<Point>();\\n\\t\\tYScores = new ArrayList<Double>();\\n\\t\\tXScores = new ArrayList<Double>();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a7136598e862746f66c54c74e2aa1a8f\",\n \"score\": \"0.70524466\",\n \"text\": \"@Override\\n protected void resetOrganScores(){\\n organScores.clear();\\n organScores.put(CCOrganScores.APPENDIX, 1f);\\n organScores.put(CCOrganScores.INTESTINE, 4f);\\n organScores.put(CCOrganScores.KIDNEY, 2f);\\n organScores.put(CCOrganScores.LIVER, 1f);\\n organScores.put(CCOrganScores.SPLEEN, 1f);\\n organScores.put(CCOrganScores.STOMACH, 1f);\\n organScores.put(CCOrganScores.LUNG, 2f);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"56e45edf637adaaf1b72958baee9b9a7\",\n \"score\": \"0.7003129\",\n \"text\": \"public static void resetDieScore()\\n\\t{\\n\\t\\tvalue_from_die = 0;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ae119318ffbf7c305b2e5fc3b10ae2cb\",\n \"score\": \"0.7001829\",\n \"text\": \"public void setOverallScore(){\\n //Empty since I wont be setting anything\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9bc37dabfacc6dd2ddebebf190623907\",\n \"score\": \"0.6998757\",\n \"text\": \"public void clear() {\\r\\n this.scoreInfos.clear();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0a525e96b81cd49d63f8c146bc2014e0\",\n \"score\": \"0.69981825\",\n \"text\": \"public void reset()\\r\\n { \\r\\n for (int i = 0; i < RUBRICS; ++i)\\r\\n for (int j = 0; i < WEIGHTS; ++i)\\r\\n {\\r\\n keywordsUsed[i][j].clear();\\r\\n wordCounts[i][j] = 0;\\r\\n }\\r\\n \\r\\n scores = new double[RUBRICS+1];\\r\\n keywordTree.reset();\\r\\n totalWords = 0;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2a1fa545efef18415c79ffc329029c45\",\n \"score\": \"0.6991006\",\n \"text\": \"public void resetBestScore() {\\n\\t\\tmBestScore = 0;\\n\\t\\tmBestScoreTV.setText(String.valueOf(mBestScore));\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a10a5d562db6ea08589b5523b48bfd5c\",\n \"score\": \"0.6972012\",\n \"text\": \"public void setInitialScore()\\n\\t{\\n\\t\\tthis.blackScore = 2;\\n\\t\\tthis.whiteScore = 2;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c59bfea43356ba3530b6c279b7a8e467\",\n \"score\": \"0.69646835\",\n \"text\": \"public void clear() {\\n this.topScore.clear();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8e56645b470e5974ee1b9bc3dfa0e5bb\",\n \"score\": \"0.69471747\",\n \"text\": \"public void resetStats() {\\n health = 100;\\n hurt = false;\\n hurtTime = 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2f24a8b33282d65880e75dcf0a9ebcea\",\n \"score\": \"0.69379616\",\n \"text\": \"public void reset() {\\n statistics = new MatchupStatistics();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"53aeb9ac50e8d7d2fddc58efe6674b68\",\n \"score\": \"0.68934256\",\n \"text\": \"public void resetScoreAndWickets(View view) {\\n scoreTeamA = 0;\\n scoreTeamB = 0;\\n wicketsTeamA = 0;\\n wicketsTeamB = 0;\\n displayScoreForTeamA(scoreTeamA);\\n displayScoreForTeamB(scoreTeamB);\\n displayWicketsForTeamA(wicketsTeamA);\\n displayWicketsForTeamB(wicketsTeamB);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"17978a3f33edcf54230ba35bd39abe7a\",\n \"score\": \"0.68454933\",\n \"text\": \"public void resetStats() {\\n recursionSteps = -1;\\n swap = 0;\\n compare = 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f291352d62be93081262db8495387e93\",\n \"score\": \"0.6810226\",\n \"text\": \"public void clear() {\\n highScores.clear();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5469a798a7b429111d4cd7c19aff0c9f\",\n \"score\": \"0.6776736\",\n \"text\": \"public void reset() {\\r\\n\\t\\t\\r\\n\\t\\troll_count = 0;\\r\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"613a4256c41612f915f2e392f21ad6b9\",\n \"score\": \"0.6772928\",\n \"text\": \"public Builder clearScore() {\\n \\n score_ = 0;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"31e90e205d8a35c5f947f6c83e56760f\",\n \"score\": \"0.67694134\",\n \"text\": \"public void resetBoard() {\\n for (int y = 0; y < 13; y++) {\\n if (players[whoseTurn].scoreObj[y].used != true) {\\n players[whoseTurn].scoreObj[y].value = 0;\\n scoreField[y].setBackground(Color.WHITE);\\n scoreField[y].setText(\\\" \\\");\\n } else {\\n scoreField[y].setText(\\\" \\\" + players[whoseTurn].scoreObj[y].value);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"549c78ec40b362e3a26def58823380a8\",\n \"score\": \"0.67622954\",\n \"text\": \"public void scores(){\\n\\t\\tscore.increase();\\n\\t\\tincreaseHeight();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8042ea1796e246a6bb17112477ca1c9d\",\n \"score\": \"0.675702\",\n \"text\": \"public void resetCounters()\\n\\t{\\n\\t\\tfinal Cursor< LongType > cursor = counts.cursor();\\n\\t\\twhile ( cursor.hasNext() )\\n\\t\\t{\\n\\t\\t\\tcursor.next().setZero();\\n\\t\\t}\\n\\t\\ttotalValues = 0;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9afb2c8029a6fd37d12e688cedaaab84\",\n \"score\": \"0.6740592\",\n \"text\": \"public void resetScoreTeamA(View view) {\\n scoreTeamA = 0;\\n displayForTeamA(scoreTeamA);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"857d5fcce941b27752e962ae220e4828\",\n \"score\": \"0.67220855\",\n \"text\": \"public void reset() {\\n\\t\\t_cnt = 0;\\n\\t\\t_err = 0;\\n\\t\\t_err_timestamp = 0;\\n\\t\\t_max = 0;\\n\\t\\t_max_timestamp = 0;\\n\\t\\t_min_timestamp = 0;\\n\\t\\t_avg = 0;\\n\\t\\t_avg_max_timestamp = 0;\\n\\t\\t_avg_min_timestamp = 0;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8efcb3186c1dee4ae8d862006624bdc2\",\n \"score\": \"0.67192\",\n \"text\": \"public void reset(View view) {\\n scoreTeamB = 0;\\n scoreTeamA = 0;\\n displayForTeamB(scoreTeamB);\\n displayForTeamA(scoreTeamA);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"736efc9fbf4bb27715fc105234b0528a\",\n \"score\": \"0.67020696\",\n \"text\": \"public void reset()\\n\\t{\\t\\t\\n\\t\\tsuper.reset();\\n\\t\\ttotalCosts = 0;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"26326c794ec8ebd55368b6ccb2aca711\",\n \"score\": \"0.66900086\",\n \"text\": \"public void resetScores(View view){\\n MediaPlayer woosh = MediaPlayer.create(ScoresActivity.this,R.raw.woosh); woosh.start();\\n writeStudentLevels(\\\"1,1,1,1,1,1\\\",this);\\n TextView io = findViewById(R.id.io_score_view);\\n io.setText(String.format(\\\"%1$-\\\" + 28 + \\\"s\\\", \\\"Input/Output_\\\").replace(' ', '=').replace('_',' ') + \\\" 1\\\");\\n TextView var = findViewById(R.id.var_score_view);\\n var.setText(String.format(\\\"%1$-\\\" + 28 + \\\"s\\\", \\\"Variables_\\\").replace(' ', '=').replace('_',' ') + \\\" 1\\\");\\n TextView con = findViewById(R.id.con_score_view);\\n con.setText(String.format(\\\"%1$-\\\" + 28 + \\\"s\\\", \\\"Control_Structures_\\\").replace(' ', '=').replace('_',' ') + \\\" 1\\\");\\n TextView ds = findViewById(R.id.ds_score_view);\\n ds.setText(String.format(\\\"%1$-\\\" + 28 + \\\"s\\\", \\\"Data_Structures_\\\").replace(' ', '=').replace('_',' ') + \\\" 1\\\");\\n TextView fun = findViewById(R.id.fun_score_view);\\n fun.setText(String.format(\\\"%1$-\\\" + 28 + \\\"s\\\", \\\"Functions_\\\").replace(' ', '=').replace('_',' ') + \\\" 1\\\");\\n TextView oop = findViewById(R.id.oop_score_view);\\n oop.setText(String.format(\\\"%1$-\\\" + 28 + \\\"s\\\", \\\"Object-Oriented_Principles_\\\").replace(' ', '=').replace('_',' ') + \\\" 1\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"86bd4625d3d1f52e35ff5f003e697863\",\n \"score\": \"0.66857964\",\n \"text\": \"ScoreGrid()\\n {\\n scoreSheet = new Integer[SCORE_SHEET_ROWS.length];\\n Arrays.fill(scoreSheet, NO_SCORE);\\n yahtzeeBonuses = 0;\\n scorer = new Scorer();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d0fbd6f609a059e410744f86d5474193\",\n \"score\": \"0.6676198\",\n \"text\": \"public Builder clearScore() {\\n bitField0_ = (bitField0_ & ~0x00000002);\\n score_ = 0;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d0fbd6f609a059e410744f86d5474193\",\n \"score\": \"0.66752523\",\n \"text\": \"public Builder clearScore() {\\n bitField0_ = (bitField0_ & ~0x00000002);\\n score_ = 0;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d0fbd6f609a059e410744f86d5474193\",\n \"score\": \"0.66752523\",\n \"text\": \"public Builder clearScore() {\\n bitField0_ = (bitField0_ & ~0x00000002);\\n score_ = 0;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d0fbd6f609a059e410744f86d5474193\",\n \"score\": \"0.6675236\",\n \"text\": \"public Builder clearScore() {\\n bitField0_ = (bitField0_ & ~0x00000002);\\n score_ = 0;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"40f52a2aa0be81786e17237f7ba2bf98\",\n \"score\": \"0.66636246\",\n \"text\": \"public void resetStats() {\\n\\t\\tpersister.resetStatistics();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6d899e1c3a99df36bcd50932a897a2db\",\n \"score\": \"0.66610783\",\n \"text\": \"public Builder clearScore() {\\n bitField0_ = (bitField0_ & ~0x00000004);\\n score_ = 0;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"331bd1c23c3086aa8b09f9c390273e7a\",\n \"score\": \"0.6655831\",\n \"text\": \"public void resetStatistics()\\n\\t{\\n\\t\\tthis.stats.reset();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7fee47275cb7bd8c112372029745c87\",\n \"score\": \"0.66457\",\n \"text\": \"public static void setNewScoreList() {\\r\\n\\t for(int i = 0; i < 8; i++){\\r\\n\\t\\t player_scores[i] = 0;\\r\\n\\t }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4921b0193b53eed9f974800c5a787f5d\",\n \"score\": \"0.6626416\",\n \"text\": \"public void reset(View view){\\n teamAScore = 0;\\n teamBScore = 0;\\n String str = \\\"\\\";\\n displayResult(str);\\n displayForTeamA(teamAScore);\\n displayForTeamB(teamBScore);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f2a280f646803f69ebd045606a06faed\",\n \"score\": \"0.6619686\",\n \"text\": \"@Override\\r\\n public void reset() {\\n super.reset(); \\r\\n //sets health to normal value\\r\\n health = 140;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7a8dbb9f5d381c9e4587271965330523\",\n \"score\": \"0.6611312\",\n \"text\": \"private void resetGame() {\\n // Reset variables\\n play = false;\\n win = false;\\n myScore = 0;\\n myLives = 3;\\n myLevel = 1;\\n\\n myBall.setSpeed(150);\\n myBall.reset();\\n\\n myPaddle.setSpeed(10);\\n myPaddle.reset();\\n\\n removeBlocks();\\n removePowers();\\n\\n myBlocks = new ArrayList<>();\\n MapGenerator(numRow + myLevel, numCol);\\n\\n updateStatus();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5208ab9187972786e13c1937a4337147\",\n \"score\": \"0.66104114\",\n \"text\": \"static void resetGame() {\\n\\t\\tguessesleft = 4; \\n\\t\\twins = 0; \\n\\t\\ttokens = 0; \\n\\t\\tBoxPane1.setInfo(\\\"Make a guess\\\");\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"881af15bba652062baded30886557fec\",\n \"score\": \"0.65931034\",\n \"text\": \"public void clearHighScores(){\\n\\n Resources res = context.getResources();\\n\\n //Get the stored total number of high scores from resources\\n int totalHS = res.getInteger(R.integer.total_high_scores);\\n\\n String defaultName = res.getString(R.string.hsn_default);\\n int defaultValue = res.getInteger(R.integer.hs_default);\\n\\n //Get an array of keys for the high scores and their attached names from resources.\\n String[] hs_keys = res.getStringArray(R.array.hs_keys);\\n String[] hsn_keys = res.getStringArray(R.array.hsn_keys);\\n\\n for(int i = 0; i < totalHS; i++){\\n\\n editHighScore(defaultName, defaultValue, hsn_keys[i], hs_keys[i]);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"72a8b04d874319ba4e653927fb5a4231\",\n \"score\": \"0.65541536\",\n \"text\": \"public void updateScore()\\n\\t{\\n\\t\\tthis.blackScore = black.getScore();\\n\\t\\tthis.whiteScore = white.getScore();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0ce4f5548f44b8352984faaeade67887\",\n \"score\": \"0.65412456\",\n \"text\": \"void resetCounters() {\\n this.resetCounter = 0;\\n this.splitBridgeCounter = 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"591e3293167a5a6384437a075c3136be\",\n \"score\": \"0.6532153\",\n \"text\": \"public void resetStats() {\\n replay.resetStats();\\n aggProtoStats.clear();\\n if (protocol != null) {\\n protocol.resetStats();\\n }\\n consistencyTracker.resetStats();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f460b4e0d4115c827f23b256a62895a3\",\n \"score\": \"0.65274423\",\n \"text\": \"public static void resetValues() {\\r\\n\\t\\taction = 6;\\r\\n\\t\\tlocX = 0;\\r\\n\\t\\tlocY = 0;\\r\\n\\t\\tpower = 5;\\r\\n\\t\\tbatteries = 0;\\r\\n\\t\\tturn = 0;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cb058141166ef224001a06f370215677\",\n \"score\": \"0.6526788\",\n \"text\": \"public Builder clearScore() {\\n bitField0_ = (bitField0_ & ~0x00000002);\\n score_ = false;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0ed9119986267842427bcaf02119a674\",\n \"score\": \"0.6519124\",\n \"text\": \"public void restart() {\\n this.moves = 0;\\n this.score = 0;\\n board.init();\\n board.addNew();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"095cce9a6c894151018e3881c008cabb\",\n \"score\": \"0.6518124\",\n \"text\": \"private void resetGame() {\\r\\n System.out.println(\\\"count p1 is ? \\\" + sCountForWinP1\\r\\n + \\\"-* count p2 ?? \\\" + sCountForWinP2\\r\\n + \\\"-* count darw ?? \\\" + sCountForDraw);\\r\\n //boardXO = 0;\\r\\n Arrays.fill(boardXO, 0);\\r\\n lastPlayerTurn = 0;\\r\\n winner = 0;\\r\\n countForMove = 0;\\r\\n isPlayerWin = \\\"f\\\";\\r\\n isNoPlayerWin = \\\"f\\\";\\r\\n finalBoardXO.clear();\\r\\n vaildTurn = \\\"t\\\";\\r\\n validMove = \\\"t\\\";\\r\\n //counPlyer = 0; // make a problem\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e1f238d1c2620d2fa0d69f81faa3dc09\",\n \"score\": \"0.65148383\",\n \"text\": \"public void reset () {\\n\\t\\tturnNum = 0;\\n\\t\\tboxValues = new String[9];\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"763c2d2a275934fbef1b8b793c1fe71f\",\n \"score\": \"0.6496123\",\n \"text\": \"private void reset() {\\r\\n //Teams\\r\\n teamOne.clear();\\r\\n teamTwo.clear();\\r\\n\\r\\n //Game variables\\r\\n shipType = 1;\\r\\n deathLimit = 2;\\r\\n keepDeaths = false;\\r\\n evenTeams = false;\\r\\n roundNumber = 1;\\r\\n\\r\\n //Other variables\\r\\n lockArena = false;\\r\\n isUneven = false;\\r\\n\\r\\n //Cancel all timers\\r\\n m_botAction.cancelTasks();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bae1c4efc5d6a57660d13d1c2f235329\",\n \"score\": \"0.6488756\",\n \"text\": \"void resets();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0a08f7a91eed563ec45a4403de967601\",\n \"score\": \"0.64727634\",\n \"text\": \"public void reset() {\\n\\t\\t_left.resetTachoCount();\\n\\t\\t_right.resetTachoCount();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4b9c02a46bd3e2bd56e16a0e7d8f2c93\",\n \"score\": \"0.64710253\",\n \"text\": \"public void setScore(int score) {\\n if (score < 0) {\\n this.score = 0;\\n } else {\\n this.score = score;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6d25faff2195b1e5edee7da2faebd75\",\n \"score\": \"0.64694196\",\n \"text\": \"public void Reset(View view) {\\n userScore = 0; userTurnScore = 0; compScore = 0; compTurnScore = 0;\\n handler.removeCallbacks(timerRunnable);\\n handler.removeCallbacks(timerRunnable2);\\n updateScore(userTurnScore);\\n Button one = (Button) findViewById(R.id.button1);\\n Button two = (Button) findViewById(R.id.button2);\\n one.setClickable(true); //enable these buttons while user plays\\n two.setClickable(true);\\n one.setText(\\\"Roll\\\");\\n two.setText(\\\"Hold\\\");\\n ImageView imageView = (ImageView) findViewById(R.id.imageView1);\\n imageView.setImageResource(R.drawable.dice1);\\n TextView textView = (TextView) findViewById(R.id.textView3);\\n textView.setVisibility(TextView.INVISIBLE);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3b66182a89b8e62fc41590f406476345\",\n \"score\": \"0.64656085\",\n \"text\": \"public void reset(){\\n \\tthis.maxEnergy = BASE_MAX_ENERGY;\\n \\tthis.curEnergy = BASE_MAX_ENERGY;\\n \\tthis.curHealth = MAX_HEALTH;\\n \\tthis.nextShotCountDown = 0;\\n \\tthis.position = new oop.ex2.SpaceShipPhysics();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b5fd841ad2c73a2a687d73a8ab0096a6\",\n \"score\": \"0.6451458\",\n \"text\": \"private void reset() {\\n pnlDashboardStats.reset();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b6ea0b0f0ff209a289f2df778a0edcf5\",\n \"score\": \"0.6445361\",\n \"text\": \"public void reset(){\\n\\t\\tarray.clear();\\n\\t\\tsplits.clear();\\n\\t\\tvarIndices.clear();\\n\\t\\tvars.clear();\\n\\t\\tvarNames.clear();\\n\\t\\thook = null;\\n\\t\\tarCursor = 0;\\n\\t\\tvarID = 0;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8d37ac7d3bbb9b83e2b01114e8f46f26\",\n \"score\": \"0.6437237\",\n \"text\": \"public void reset()\\n\\t{\\n\\t\\twarnings = errors = 0;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1cdd27ea51798552fecbbc82c94abb4e\",\n \"score\": \"0.64366466\",\n \"text\": \"public static void reset() {\\n\\t\\tdeadline = 0;\\n\\t\\tmoney = 0;\\n\\t\\ttimestamp = 0;\\n//\\t\\tstep = 0;\\n\\t\\tjobsCompleted = 0;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5519a6e64826f6d440f9c7a31c6a132e\",\n \"score\": \"0.64305466\",\n \"text\": \"public Builder clearRankScore() {\\n \\n rankScore_ = 0D;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3db798b6ee6b5d10346c5aa01da9d731\",\n \"score\": \"0.64279485\",\n \"text\": \"private void resetGame()\\n {\\n valid.setText(\\\"\\\");\\n isVisited.setText(\\\"\\\");\\n largeBoard.setDisable(false);\\n smallBoard.setDisable(false);\\n player.reset();\\n score.setText(\\\"Score: \\\" + player.getScore());\\n guesses.setText(\\\"Guessed Words:\\\" + player.getGuessedWords());\\n invalidWords.clear();\\n badGuesses.setText(\\\"Invalid Guessed Words:\\\" + invalidWords);\\n resetTimer();\\n clearBoard(gBoard);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bef1a64a129294dbb77d701b319d7f0\",\n \"score\": \"0.64151347\",\n \"text\": \"public void resetCounter(){\\n\\t\\tcounter=0;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d91d58645dc21e218215029750a3f45\",\n \"score\": \"0.641417\",\n \"text\": \"private void resetGame() {\\n animatedImageYouWin.reset();\\n lastLevelIsComplete = false;\\n levelNum = 0;\\n userInterface.setLevelNum(levelNum + 1);\\n resetLevel();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d56d26f27ee60b0968e9624586847f26\",\n \"score\": \"0.64138174\",\n \"text\": \"public void reset() {\\r\\n \\r\\n this.setSize(900,600);\\r\\n this.addKeyListener(this);\\r\\n \\r\\n // Applet only\\r\\n laser = new Sound(\\\"laser80.wav\\\");\\r\\n shipHit = new Sound(\\\"explode0.wav\\\");\\r\\n asteroidHit = new Sound(\\\"explode1.wav\\\");\\r\\n thruster = new Sound(\\\"thruster.wav\\\");\\r\\n \\r\\n rocks = new AsteroidHandler();\\r\\n explosions = new ExplosionHandler();\\r\\n stars = new StarsHandler();\\r\\n powerups = new PowerupHandler();\\r\\n ship = new Spacecraft(explosions, laser);\\r\\n \\r\\n shieldRemaining = new ProgressBar(735, 10, 1);\\r\\n \\r\\n upKeyPressed = false;\\r\\n downKeyPressed = false;\\r\\n rightKeyPressed = false;\\r\\n leftKeyPressed = false;\\r\\n spaceBarPressed = false;\\r\\n shiftKeyPressed = false;\\r\\n score = 0;\\r\\n isOddFrame = false;\\r\\n \\r\\n showHighScores = false;\\r\\n \\r\\n framerate = new Timer(20, this);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dd79d2421a54ca8dfcb1dce527ba06e2\",\n \"score\": \"0.641183\",\n \"text\": \"public void setScore(int score)\\r\\n {\\r\\n Score = score;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"939a235bb3754a165efbd189fb0e0dfb\",\n \"score\": \"0.6408669\",\n \"text\": \"public void pointsReset () {\\n pointsForTeamA = 0;\\n displayForTeamA(pointsForTeamA);\\n pointsForTeamB = 0;\\n displayForTeamB(pointsForTeamB);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"352c1c02cb9a7a15959015a009077104\",\n \"score\": \"0.63916355\",\n \"text\": \"public void resetGame() {\\n previous_states.clear();\\n resetRenders();\\n capturedWhite = 0;\\n capturedBlack = 0;\\n in_play = true;\\n current_player = 2;\\n opposing = 1;\\n winnerLabel.setVisible(false);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"433833a751dd84d13c27d067d81dfba5\",\n \"score\": \"0.6386684\",\n \"text\": \"public void reset() {\\n gameInProgress = false;\\n players.clear();\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":983193,"cells":{"query_id":{"kind":"string","value":"76d709aec45750a701b1b260532fc960"},"query":{"kind":"string","value":"The logical id of the resource, as used in the URL for the resource. Once assigned, this value never changes."},"positive_passages":{"kind":"list like","value":[{"docid":"7cbfe2c2728185659812e3d0273ea5d1","score":"0.0","text":"@Override\n public Builder id(java.lang.String id) {\n return (Builder) super.id(id);\n }","title":""}],"string":"[\n {\n \"docid\": \"7cbfe2c2728185659812e3d0273ea5d1\",\n \"score\": \"0.0\",\n \"text\": \"@Override\\n public Builder id(java.lang.String id) {\\n return (Builder) super.id(id);\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"2a2232aa358169e84882d025ae809828","score":"0.750502","text":"@Override\n\tpublic Integer getId() {\n\t\treturn resourceId;\n\t}","title":""},{"docid":"2df9eddc0cf3555661172b279af6c4fa","score":"0.7460068","text":"String resourceId();","title":""},{"docid":"d6688e45572f706f497c253553960259","score":"0.7354745","text":"public String getId() {\n return resource;\n }","title":""},{"docid":"fd378ab3399a0b22a3e220a859747454","score":"0.72481316","text":"@java.lang.Override\n public long getResourceId() {\n return resourceId_;\n }","title":""},{"docid":"7d7ec670371a8abea229b9dc2f830620","score":"0.7216121","text":"long getResourceId();","title":""},{"docid":"18ffc78dfffa904365c184dfb1b0f739","score":"0.721266","text":"@java.lang.Override\n public long getResourceId() {\n return resourceId_;\n }","title":""},{"docid":"580b28afb1082caaa303adf84d76e4a8","score":"0.71833205","text":"@Schema(description = \"Unique identifier of target ResourceSpecification\")\n\n\tpublic String getId() {\n\t\treturn id;\n\t}","title":""},{"docid":"47c8eab6d50c8a7bf0be3734b74315af","score":"0.7130808","text":"public ResourceId getId(){\n return this.resourceId;\n }","title":""},{"docid":"bd0f676b47d2751d49fe5eb270a21837","score":"0.7104633","text":"public Integer getResourceId() {\r\n\t\treturn resourceId;\r\n\t}","title":""},{"docid":"ecf8ce1abc83c4e6e7e9d7122371c194","score":"0.70736814","text":"public String getResourceId() {\n return resourceId;\n }","title":""},{"docid":"ab2eb30ca69efc3cb6a56f302035f6cd","score":"0.7069924","text":"public String resourceId() {\n return this.resourceId;\n }","title":""},{"docid":"990e0cc3cdb86523b2ba7a19acac845e","score":"0.7059554","text":"ResourceLocation getID();","title":""},{"docid":"ec190af2b093e2bc10bba1b5a3c30d62","score":"0.7054586","text":"java.lang.String getResourceId();","title":""},{"docid":"ec4a874e4d2703cfbabed1fa56143ddf","score":"0.7050095","text":"public int getResourceId() {\n return resourceId;\n }","title":""},{"docid":"919ff3aec52873458c43a3628a687c49","score":"0.70169365","text":"public Integer getResourceId() {\n return resourceId;\n }","title":""},{"docid":"d3b0c7ef46ba442ba6f731b343d81e40","score":"0.699638","text":"@Override\n public String getResourceId() {\n return resourceId;\n }","title":""},{"docid":"9589c0cb06416b9d1253297dc6a6106e","score":"0.6949582","text":"public String getResourceIdentifier() {\n return rcId;\n }","title":""},{"docid":"ddfef84abd59fef6d94189f804460187","score":"0.6905356","text":"public int getResourceID()\n\t{\n\t\treturn this.resourceID;\n\t}","title":""},{"docid":"525eb9c71cc702049a612df5635521ab","score":"0.67780906","text":"@Override\n public String id() {\n return resourcePoolId;\n }","title":""},{"docid":"525eb9c71cc702049a612df5635521ab","score":"0.67780906","text":"@Override\n public String id() {\n return resourcePoolId;\n }","title":""},{"docid":"14ec2e253a1abc64fed67202164ee98d","score":"0.6777721","text":"@ApiModelProperty(value = \"The id of the resource we are defining access for (null for top level)\")\n public String getId() {\n return id;\n }","title":""},{"docid":"de4ea5063aba11ea225026a4cb26a8b4","score":"0.6757218","text":"public java.lang.String getResourceId() {\n java.lang.Object ref = resourceId_;\n if (!(ref instanceof java.lang.String)) {\n com.google.protobuf.ByteString bs = (com.google.protobuf.ByteString) ref;\n java.lang.String s = bs.toStringUtf8();\n resourceId_ = s;\n return s;\n } else {\n return (java.lang.String) ref;\n }\n }","title":""},{"docid":"5f3d3c8dbcf1c33fb3584a5ba19c4e39","score":"0.6720668","text":"public String getResourceId() {\n return this.resourceId;\n }","title":""},{"docid":"2cdd19cfb6aba5f181bce19f59214fdf","score":"0.66956466","text":"@java.lang.Override\n public java.lang.String getResourceId() {\n java.lang.Object ref = resourceId_;\n if (ref instanceof java.lang.String) {\n return (java.lang.String) ref;\n } else {\n com.google.protobuf.ByteString bs = (com.google.protobuf.ByteString) ref;\n java.lang.String s = bs.toStringUtf8();\n resourceId_ = s;\n return s;\n }\n }","title":""},{"docid":"f5bf611f93bd49defddfa3d28696c2f5","score":"0.6677025","text":"public co.com.tigo.gatewaytigov19.webscp.ws.IdDTO getResourceId() {\n return resourceId;\n }","title":""},{"docid":"74ef16b2ba4519f6fc21118b2a7ff795","score":"0.6669093","text":"@Schema(required = true, description = \"The randomly-generated id of a Resource\")\n public String getId() {\n return id;\n }","title":""},{"docid":"541f38542b968993115f25264df5e7ff","score":"0.65928453","text":"public int getResourceID()\n {\n return resourceID;\n }","title":""},{"docid":"83a292c4656bebcb1c142dbbb11af1ef","score":"0.65466464","text":"URI getId();","title":""},{"docid":"de1a98bbb204dca33b1311213f1b41e8","score":"0.651042","text":"@ApiModelProperty(value = \"Uniquely identifies the resource within the collection of like resources.\")\n @JsonProperty(\"Id\")\n public String getId() {\n return id;\n }","title":""},{"docid":"a8348bf5f8bbf8882b57712ed06db3d0","score":"0.6501942","text":"public Id<R> assignId(R resource);","title":""},{"docid":"d781136ba761071a3e6bafd7c6ef4c82","score":"0.6498172","text":"java.lang.String getId();","title":""},{"docid":"d781136ba761071a3e6bafd7c6ef4c82","score":"0.6498172","text":"java.lang.String getId();","title":""},{"docid":"d781136ba761071a3e6bafd7c6ef4c82","score":"0.6498172","text":"java.lang.String getId();","title":""},{"docid":"d781136ba761071a3e6bafd7c6ef4c82","score":"0.6498172","text":"java.lang.String getId();","title":""},{"docid":"d781136ba761071a3e6bafd7c6ef4c82","score":"0.6498172","text":"java.lang.String getId();","title":""},{"docid":"d781136ba761071a3e6bafd7c6ef4c82","score":"0.6498172","text":"java.lang.String getId();","title":""},{"docid":"d781136ba761071a3e6bafd7c6ef4c82","score":"0.6498172","text":"java.lang.String getId();","title":""},{"docid":"d781136ba761071a3e6bafd7c6ef4c82","score":"0.6498172","text":"java.lang.String getId();","title":""},{"docid":"d781136ba761071a3e6bafd7c6ef4c82","score":"0.6498172","text":"java.lang.String getId();","title":""},{"docid":"d781136ba761071a3e6bafd7c6ef4c82","score":"0.6498172","text":"java.lang.String getId();","title":""},{"docid":"d781136ba761071a3e6bafd7c6ef4c82","score":"0.6498172","text":"java.lang.String getId();","title":""},{"docid":"d781136ba761071a3e6bafd7c6ef4c82","score":"0.6498172","text":"java.lang.String getId();","title":""},{"docid":"d781136ba761071a3e6bafd7c6ef4c82","score":"0.6498172","text":"java.lang.String getId();","title":""},{"docid":"d781136ba761071a3e6bafd7c6ef4c82","score":"0.6498172","text":"java.lang.String getId();","title":""},{"docid":"d781136ba761071a3e6bafd7c6ef4c82","score":"0.6498172","text":"java.lang.String getId();","title":""},{"docid":"d781136ba761071a3e6bafd7c6ef4c82","score":"0.6498172","text":"java.lang.String getId();","title":""},{"docid":"d781136ba761071a3e6bafd7c6ef4c82","score":"0.6498172","text":"java.lang.String getId();","title":""},{"docid":"d781136ba761071a3e6bafd7c6ef4c82","score":"0.6498172","text":"java.lang.String getId();","title":""},{"docid":"d781136ba761071a3e6bafd7c6ef4c82","score":"0.6498172","text":"java.lang.String getId();","title":""},{"docid":"d781136ba761071a3e6bafd7c6ef4c82","score":"0.6498172","text":"java.lang.String getId();","title":""},{"docid":"d781136ba761071a3e6bafd7c6ef4c82","score":"0.6498172","text":"java.lang.String getId();","title":""},{"docid":"d781136ba761071a3e6bafd7c6ef4c82","score":"0.6498172","text":"java.lang.String getId();","title":""},{"docid":"d781136ba761071a3e6bafd7c6ef4c82","score":"0.6498172","text":"java.lang.String getId();","title":""},{"docid":"d781136ba761071a3e6bafd7c6ef4c82","score":"0.6498172","text":"java.lang.String getId();","title":""},{"docid":"d781136ba761071a3e6bafd7c6ef4c82","score":"0.6498172","text":"java.lang.String getId();","title":""},{"docid":"d781136ba761071a3e6bafd7c6ef4c82","score":"0.6498172","text":"java.lang.String getId();","title":""},{"docid":"d781136ba761071a3e6bafd7c6ef4c82","score":"0.6498172","text":"java.lang.String getId();","title":""},{"docid":"d781136ba761071a3e6bafd7c6ef4c82","score":"0.6498172","text":"java.lang.String getId();","title":""},{"docid":"5d0aad5834e3d05091221735046c6258","score":"0.6427361","text":"@ApiModelProperty(example = \"null\", value = \"Internal identifier of a device\")\n public String getId() {\n return id;\n }","title":""},{"docid":"e034d0b9232ab2377d2f13623f17eb96","score":"0.64247406","text":"ResourceLocalIdentifier createResourceLocalIdentifier();","title":""},{"docid":"c8eae18c54794936144b5292dc74dab9","score":"0.6405309","text":"@java.lang.Override\n public com.google.protobuf.ByteString getResourceIdBytes() {\n java.lang.Object ref = resourceId_;\n if (ref instanceof java.lang.String) {\n com.google.protobuf.ByteString b =\n com.google.protobuf.ByteString.copyFromUtf8((java.lang.String) ref);\n resourceId_ = b;\n return b;\n } else {\n return (com.google.protobuf.ByteString) ref;\n }\n }","title":""},{"docid":"14ad822af35a4182fe1c37aeb0d62bad","score":"0.6398342","text":"public String getResourcesId() {\n return resourcesId;\n }","title":""},{"docid":"d87c38b285a89731762d7f9d0dd355fc","score":"0.6391659","text":"public com.google.protobuf.ByteString getResourceIdBytes() {\n java.lang.Object ref = resourceId_;\n if (ref instanceof String) {\n com.google.protobuf.ByteString b =\n com.google.protobuf.ByteString.copyFromUtf8((java.lang.String) ref);\n resourceId_ = b;\n return b;\n } else {\n return (com.google.protobuf.ByteString) ref;\n }\n }","title":""},{"docid":"e59b63de3dd21cf1dc310c4466f8f4fe","score":"0.6301775","text":"String targetResourceId();","title":""},{"docid":"ffc2c1799759ea8993345c456917c8d7","score":"0.6278991","text":"@Schema(description = \"Identifier of the resource against which usage is emitted\")\n public UUID getResourceId() {\n return resourceId;\n }","title":""},{"docid":"45d51fda6f764c6feca6398d66cad378","score":"0.62763196","text":"java.lang.String getExternalId();","title":""},{"docid":"422bca09ca4b08b2a4c6470cdec2a828","score":"0.6252025","text":"public String getResourceGuid() {\n return this.resourceGuid;\n }","title":""},{"docid":"1d8878d1edbe508d5907acffef82063d","score":"0.62478346","text":"public String getInternalId() {\n return internalId;\n }","title":""},{"docid":"83249de746e23bb0d2e22066dade81f4","score":"0.62361217","text":"@Override\n public void id(Resource resource) {\n }","title":""},{"docid":"a7e63fd3e31a40a2311a4d7be5d01100","score":"0.6219532","text":"public String getInternalId() {\n\n return this.internalId;\n }","title":""},{"docid":"dab9f146de8794446366b5fbf8f93d3c","score":"0.62159824","text":"public java.lang.String getId(){\n return localId;\n }","title":""},{"docid":"2845e0c41163fb67176092d499fb15b4","score":"0.6211713","text":"String getId();","title":""},{"docid":"2845e0c41163fb67176092d499fb15b4","score":"0.6211713","text":"String getId();","title":""},{"docid":"2845e0c41163fb67176092d499fb15b4","score":"0.6211713","text":"String getId();","title":""},{"docid":"2845e0c41163fb67176092d499fb15b4","score":"0.6211713","text":"String getId();","title":""},{"docid":"2845e0c41163fb67176092d499fb15b4","score":"0.6211713","text":"String getId();","title":""},{"docid":"2845e0c41163fb67176092d499fb15b4","score":"0.6211713","text":"String getId();","title":""},{"docid":"2845e0c41163fb67176092d499fb15b4","score":"0.6211713","text":"String getId();","title":""},{"docid":"2845e0c41163fb67176092d499fb15b4","score":"0.6211713","text":"String getId();","title":""},{"docid":"2845e0c41163fb67176092d499fb15b4","score":"0.6211713","text":"String getId();","title":""},{"docid":"2845e0c41163fb67176092d499fb15b4","score":"0.6211713","text":"String getId();","title":""},{"docid":"2845e0c41163fb67176092d499fb15b4","score":"0.6211713","text":"String getId();","title":""},{"docid":"2845e0c41163fb67176092d499fb15b4","score":"0.6211713","text":"String getId();","title":""},{"docid":"2845e0c41163fb67176092d499fb15b4","score":"0.6211713","text":"String getId();","title":""},{"docid":"2845e0c41163fb67176092d499fb15b4","score":"0.6211713","text":"String getId();","title":""},{"docid":"2845e0c41163fb67176092d499fb15b4","score":"0.6211713","text":"String getId();","title":""},{"docid":"2845e0c41163fb67176092d499fb15b4","score":"0.6211713","text":"String getId();","title":""},{"docid":"2845e0c41163fb67176092d499fb15b4","score":"0.6211713","text":"String getId();","title":""},{"docid":"2845e0c41163fb67176092d499fb15b4","score":"0.6211713","text":"String getId();","title":""},{"docid":"2845e0c41163fb67176092d499fb15b4","score":"0.6211713","text":"String getId();","title":""},{"docid":"2845e0c41163fb67176092d499fb15b4","score":"0.6211713","text":"String getId();","title":""},{"docid":"2845e0c41163fb67176092d499fb15b4","score":"0.6211713","text":"String getId();","title":""},{"docid":"2845e0c41163fb67176092d499fb15b4","score":"0.6211713","text":"String getId();","title":""},{"docid":"2845e0c41163fb67176092d499fb15b4","score":"0.6211713","text":"String getId();","title":""},{"docid":"2845e0c41163fb67176092d499fb15b4","score":"0.6211713","text":"String getId();","title":""},{"docid":"2845e0c41163fb67176092d499fb15b4","score":"0.6211713","text":"String getId();","title":""},{"docid":"2845e0c41163fb67176092d499fb15b4","score":"0.6211713","text":"String getId();","title":""},{"docid":"2845e0c41163fb67176092d499fb15b4","score":"0.6211713","text":"String getId();","title":""},{"docid":"2845e0c41163fb67176092d499fb15b4","score":"0.6211713","text":"String getId();","title":""},{"docid":"2845e0c41163fb67176092d499fb15b4","score":"0.6211713","text":"String getId();","title":""},{"docid":"2845e0c41163fb67176092d499fb15b4","score":"0.6211713","text":"String getId();","title":""}],"string":"[\n {\n \"docid\": \"2a2232aa358169e84882d025ae809828\",\n \"score\": \"0.750502\",\n \"text\": \"@Override\\n\\tpublic Integer getId() {\\n\\t\\treturn resourceId;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2df9eddc0cf3555661172b279af6c4fa\",\n \"score\": \"0.7460068\",\n \"text\": \"String resourceId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d6688e45572f706f497c253553960259\",\n \"score\": \"0.7354745\",\n \"text\": \"public String getId() {\\n return resource;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fd378ab3399a0b22a3e220a859747454\",\n \"score\": \"0.72481316\",\n \"text\": \"@java.lang.Override\\n public long getResourceId() {\\n return resourceId_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7d7ec670371a8abea229b9dc2f830620\",\n \"score\": \"0.7216121\",\n \"text\": \"long getResourceId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"18ffc78dfffa904365c184dfb1b0f739\",\n \"score\": \"0.721266\",\n \"text\": \"@java.lang.Override\\n public long getResourceId() {\\n return resourceId_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"580b28afb1082caaa303adf84d76e4a8\",\n \"score\": \"0.71833205\",\n \"text\": \"@Schema(description = \\\"Unique identifier of target ResourceSpecification\\\")\\n\\n\\tpublic String getId() {\\n\\t\\treturn id;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"47c8eab6d50c8a7bf0be3734b74315af\",\n \"score\": \"0.7130808\",\n \"text\": \"public ResourceId getId(){\\n return this.resourceId;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bd0f676b47d2751d49fe5eb270a21837\",\n \"score\": \"0.7104633\",\n \"text\": \"public Integer getResourceId() {\\r\\n\\t\\treturn resourceId;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ecf8ce1abc83c4e6e7e9d7122371c194\",\n \"score\": \"0.70736814\",\n \"text\": \"public String getResourceId() {\\n return resourceId;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ab2eb30ca69efc3cb6a56f302035f6cd\",\n \"score\": \"0.7069924\",\n \"text\": \"public String resourceId() {\\n return this.resourceId;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"990e0cc3cdb86523b2ba7a19acac845e\",\n \"score\": \"0.7059554\",\n \"text\": \"ResourceLocation getID();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ec190af2b093e2bc10bba1b5a3c30d62\",\n \"score\": \"0.7054586\",\n \"text\": \"java.lang.String getResourceId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ec4a874e4d2703cfbabed1fa56143ddf\",\n \"score\": \"0.7050095\",\n \"text\": \"public int getResourceId() {\\n return resourceId;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"919ff3aec52873458c43a3628a687c49\",\n \"score\": \"0.70169365\",\n \"text\": \"public Integer getResourceId() {\\n return resourceId;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d3b0c7ef46ba442ba6f731b343d81e40\",\n \"score\": \"0.699638\",\n \"text\": \"@Override\\n public String getResourceId() {\\n return resourceId;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9589c0cb06416b9d1253297dc6a6106e\",\n \"score\": \"0.6949582\",\n \"text\": \"public String getResourceIdentifier() {\\n return rcId;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ddfef84abd59fef6d94189f804460187\",\n \"score\": \"0.6905356\",\n \"text\": \"public int getResourceID()\\n\\t{\\n\\t\\treturn this.resourceID;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"525eb9c71cc702049a612df5635521ab\",\n \"score\": \"0.67780906\",\n \"text\": \"@Override\\n public String id() {\\n return resourcePoolId;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"525eb9c71cc702049a612df5635521ab\",\n \"score\": \"0.67780906\",\n \"text\": \"@Override\\n public String id() {\\n return resourcePoolId;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"14ec2e253a1abc64fed67202164ee98d\",\n \"score\": \"0.6777721\",\n \"text\": \"@ApiModelProperty(value = \\\"The id of the resource we are defining access for (null for top level)\\\")\\n public String getId() {\\n return id;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"de4ea5063aba11ea225026a4cb26a8b4\",\n \"score\": \"0.6757218\",\n \"text\": \"public java.lang.String getResourceId() {\\n java.lang.Object ref = resourceId_;\\n if (!(ref instanceof java.lang.String)) {\\n com.google.protobuf.ByteString bs = (com.google.protobuf.ByteString) ref;\\n java.lang.String s = bs.toStringUtf8();\\n resourceId_ = s;\\n return s;\\n } else {\\n return (java.lang.String) ref;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5f3d3c8dbcf1c33fb3584a5ba19c4e39\",\n \"score\": \"0.6720668\",\n \"text\": \"public String getResourceId() {\\n return this.resourceId;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2cdd19cfb6aba5f181bce19f59214fdf\",\n \"score\": \"0.66956466\",\n \"text\": \"@java.lang.Override\\n public java.lang.String getResourceId() {\\n java.lang.Object ref = resourceId_;\\n if (ref instanceof java.lang.String) {\\n return (java.lang.String) ref;\\n } else {\\n com.google.protobuf.ByteString bs = (com.google.protobuf.ByteString) ref;\\n java.lang.String s = bs.toStringUtf8();\\n resourceId_ = s;\\n return s;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f5bf611f93bd49defddfa3d28696c2f5\",\n \"score\": \"0.6677025\",\n \"text\": \"public co.com.tigo.gatewaytigov19.webscp.ws.IdDTO getResourceId() {\\n return resourceId;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"74ef16b2ba4519f6fc21118b2a7ff795\",\n \"score\": \"0.6669093\",\n \"text\": \"@Schema(required = true, description = \\\"The randomly-generated id of a Resource\\\")\\n public String getId() {\\n return id;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"541f38542b968993115f25264df5e7ff\",\n \"score\": \"0.65928453\",\n \"text\": \"public int getResourceID()\\n {\\n return resourceID;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"83a292c4656bebcb1c142dbbb11af1ef\",\n \"score\": \"0.65466464\",\n \"text\": \"URI getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"de1a98bbb204dca33b1311213f1b41e8\",\n \"score\": \"0.651042\",\n \"text\": \"@ApiModelProperty(value = \\\"Uniquely identifies the resource within the collection of like resources.\\\")\\n @JsonProperty(\\\"Id\\\")\\n public String getId() {\\n return id;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a8348bf5f8bbf8882b57712ed06db3d0\",\n \"score\": \"0.6501942\",\n \"text\": \"public Id<R> assignId(R resource);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d781136ba761071a3e6bafd7c6ef4c82\",\n \"score\": \"0.6498172\",\n \"text\": \"java.lang.String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d781136ba761071a3e6bafd7c6ef4c82\",\n \"score\": \"0.6498172\",\n \"text\": \"java.lang.String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d781136ba761071a3e6bafd7c6ef4c82\",\n \"score\": \"0.6498172\",\n \"text\": \"java.lang.String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d781136ba761071a3e6bafd7c6ef4c82\",\n \"score\": \"0.6498172\",\n \"text\": \"java.lang.String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d781136ba761071a3e6bafd7c6ef4c82\",\n \"score\": \"0.6498172\",\n \"text\": \"java.lang.String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d781136ba761071a3e6bafd7c6ef4c82\",\n \"score\": \"0.6498172\",\n \"text\": \"java.lang.String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d781136ba761071a3e6bafd7c6ef4c82\",\n \"score\": \"0.6498172\",\n \"text\": \"java.lang.String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d781136ba761071a3e6bafd7c6ef4c82\",\n \"score\": \"0.6498172\",\n \"text\": \"java.lang.String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d781136ba761071a3e6bafd7c6ef4c82\",\n \"score\": \"0.6498172\",\n \"text\": \"java.lang.String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d781136ba761071a3e6bafd7c6ef4c82\",\n \"score\": \"0.6498172\",\n \"text\": \"java.lang.String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d781136ba761071a3e6bafd7c6ef4c82\",\n \"score\": \"0.6498172\",\n \"text\": \"java.lang.String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d781136ba761071a3e6bafd7c6ef4c82\",\n \"score\": \"0.6498172\",\n \"text\": \"java.lang.String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d781136ba761071a3e6bafd7c6ef4c82\",\n \"score\": \"0.6498172\",\n \"text\": \"java.lang.String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d781136ba761071a3e6bafd7c6ef4c82\",\n \"score\": \"0.6498172\",\n \"text\": \"java.lang.String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d781136ba761071a3e6bafd7c6ef4c82\",\n \"score\": \"0.6498172\",\n \"text\": \"java.lang.String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d781136ba761071a3e6bafd7c6ef4c82\",\n \"score\": \"0.6498172\",\n \"text\": \"java.lang.String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d781136ba761071a3e6bafd7c6ef4c82\",\n \"score\": \"0.6498172\",\n \"text\": \"java.lang.String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d781136ba761071a3e6bafd7c6ef4c82\",\n \"score\": \"0.6498172\",\n \"text\": \"java.lang.String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d781136ba761071a3e6bafd7c6ef4c82\",\n \"score\": \"0.6498172\",\n \"text\": \"java.lang.String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d781136ba761071a3e6bafd7c6ef4c82\",\n \"score\": \"0.6498172\",\n \"text\": \"java.lang.String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d781136ba761071a3e6bafd7c6ef4c82\",\n \"score\": \"0.6498172\",\n \"text\": \"java.lang.String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d781136ba761071a3e6bafd7c6ef4c82\",\n \"score\": \"0.6498172\",\n \"text\": \"java.lang.String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d781136ba761071a3e6bafd7c6ef4c82\",\n \"score\": \"0.6498172\",\n \"text\": \"java.lang.String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d781136ba761071a3e6bafd7c6ef4c82\",\n \"score\": \"0.6498172\",\n \"text\": \"java.lang.String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d781136ba761071a3e6bafd7c6ef4c82\",\n \"score\": \"0.6498172\",\n \"text\": \"java.lang.String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d781136ba761071a3e6bafd7c6ef4c82\",\n \"score\": \"0.6498172\",\n \"text\": \"java.lang.String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d781136ba761071a3e6bafd7c6ef4c82\",\n \"score\": \"0.6498172\",\n \"text\": \"java.lang.String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d781136ba761071a3e6bafd7c6ef4c82\",\n \"score\": \"0.6498172\",\n \"text\": \"java.lang.String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5d0aad5834e3d05091221735046c6258\",\n \"score\": \"0.6427361\",\n \"text\": \"@ApiModelProperty(example = \\\"null\\\", value = \\\"Internal identifier of a device\\\")\\n public String getId() {\\n return id;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e034d0b9232ab2377d2f13623f17eb96\",\n \"score\": \"0.64247406\",\n \"text\": \"ResourceLocalIdentifier createResourceLocalIdentifier();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c8eae18c54794936144b5292dc74dab9\",\n \"score\": \"0.6405309\",\n \"text\": \"@java.lang.Override\\n public com.google.protobuf.ByteString getResourceIdBytes() {\\n java.lang.Object ref = resourceId_;\\n if (ref instanceof java.lang.String) {\\n com.google.protobuf.ByteString b =\\n com.google.protobuf.ByteString.copyFromUtf8((java.lang.String) ref);\\n resourceId_ = b;\\n return b;\\n } else {\\n return (com.google.protobuf.ByteString) ref;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"14ad822af35a4182fe1c37aeb0d62bad\",\n \"score\": \"0.6398342\",\n \"text\": \"public String getResourcesId() {\\n return resourcesId;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d87c38b285a89731762d7f9d0dd355fc\",\n \"score\": \"0.6391659\",\n \"text\": \"public com.google.protobuf.ByteString getResourceIdBytes() {\\n java.lang.Object ref = resourceId_;\\n if (ref instanceof String) {\\n com.google.protobuf.ByteString b =\\n com.google.protobuf.ByteString.copyFromUtf8((java.lang.String) ref);\\n resourceId_ = b;\\n return b;\\n } else {\\n return (com.google.protobuf.ByteString) ref;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e59b63de3dd21cf1dc310c4466f8f4fe\",\n \"score\": \"0.6301775\",\n \"text\": \"String targetResourceId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ffc2c1799759ea8993345c456917c8d7\",\n \"score\": \"0.6278991\",\n \"text\": \"@Schema(description = \\\"Identifier of the resource against which usage is emitted\\\")\\n public UUID getResourceId() {\\n return resourceId;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"45d51fda6f764c6feca6398d66cad378\",\n \"score\": \"0.62763196\",\n \"text\": \"java.lang.String getExternalId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"422bca09ca4b08b2a4c6470cdec2a828\",\n \"score\": \"0.6252025\",\n \"text\": \"public String getResourceGuid() {\\n return this.resourceGuid;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d8878d1edbe508d5907acffef82063d\",\n \"score\": \"0.62478346\",\n \"text\": \"public String getInternalId() {\\n return internalId;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"83249de746e23bb0d2e22066dade81f4\",\n \"score\": \"0.62361217\",\n \"text\": \"@Override\\n public void id(Resource resource) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a7e63fd3e31a40a2311a4d7be5d01100\",\n \"score\": \"0.6219532\",\n \"text\": \"public String getInternalId() {\\n\\n return this.internalId;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dab9f146de8794446366b5fbf8f93d3c\",\n \"score\": \"0.62159824\",\n \"text\": \"public java.lang.String getId(){\\n return localId;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2845e0c41163fb67176092d499fb15b4\",\n \"score\": \"0.6211713\",\n \"text\": \"String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2845e0c41163fb67176092d499fb15b4\",\n \"score\": \"0.6211713\",\n \"text\": \"String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2845e0c41163fb67176092d499fb15b4\",\n \"score\": \"0.6211713\",\n \"text\": \"String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2845e0c41163fb67176092d499fb15b4\",\n \"score\": \"0.6211713\",\n \"text\": \"String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2845e0c41163fb67176092d499fb15b4\",\n \"score\": \"0.6211713\",\n \"text\": \"String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2845e0c41163fb67176092d499fb15b4\",\n \"score\": \"0.6211713\",\n \"text\": \"String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2845e0c41163fb67176092d499fb15b4\",\n \"score\": \"0.6211713\",\n \"text\": \"String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2845e0c41163fb67176092d499fb15b4\",\n \"score\": \"0.6211713\",\n \"text\": \"String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2845e0c41163fb67176092d499fb15b4\",\n \"score\": \"0.6211713\",\n \"text\": \"String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2845e0c41163fb67176092d499fb15b4\",\n \"score\": \"0.6211713\",\n \"text\": \"String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2845e0c41163fb67176092d499fb15b4\",\n \"score\": \"0.6211713\",\n \"text\": \"String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2845e0c41163fb67176092d499fb15b4\",\n \"score\": \"0.6211713\",\n \"text\": \"String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2845e0c41163fb67176092d499fb15b4\",\n \"score\": \"0.6211713\",\n \"text\": \"String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2845e0c41163fb67176092d499fb15b4\",\n \"score\": \"0.6211713\",\n \"text\": \"String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2845e0c41163fb67176092d499fb15b4\",\n \"score\": \"0.6211713\",\n \"text\": \"String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2845e0c41163fb67176092d499fb15b4\",\n \"score\": \"0.6211713\",\n \"text\": \"String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2845e0c41163fb67176092d499fb15b4\",\n \"score\": \"0.6211713\",\n \"text\": \"String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2845e0c41163fb67176092d499fb15b4\",\n \"score\": \"0.6211713\",\n \"text\": \"String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2845e0c41163fb67176092d499fb15b4\",\n \"score\": \"0.6211713\",\n \"text\": \"String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2845e0c41163fb67176092d499fb15b4\",\n \"score\": \"0.6211713\",\n \"text\": \"String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2845e0c41163fb67176092d499fb15b4\",\n \"score\": \"0.6211713\",\n \"text\": \"String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2845e0c41163fb67176092d499fb15b4\",\n \"score\": \"0.6211713\",\n \"text\": \"String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2845e0c41163fb67176092d499fb15b4\",\n \"score\": \"0.6211713\",\n \"text\": \"String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2845e0c41163fb67176092d499fb15b4\",\n \"score\": \"0.6211713\",\n \"text\": \"String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2845e0c41163fb67176092d499fb15b4\",\n \"score\": \"0.6211713\",\n \"text\": \"String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2845e0c41163fb67176092d499fb15b4\",\n \"score\": \"0.6211713\",\n \"text\": \"String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2845e0c41163fb67176092d499fb15b4\",\n \"score\": \"0.6211713\",\n \"text\": \"String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2845e0c41163fb67176092d499fb15b4\",\n \"score\": \"0.6211713\",\n \"text\": \"String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2845e0c41163fb67176092d499fb15b4\",\n \"score\": \"0.6211713\",\n \"text\": \"String getId();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2845e0c41163fb67176092d499fb15b4\",\n \"score\": \"0.6211713\",\n \"text\": \"String getId();\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":983194,"cells":{"query_id":{"kind":"string","value":"430c9daf757584626c77063a7f0373ab"},"query":{"kind":"string","value":"private long DijkstraNum = Integer.MAX_VALUE; private ArrayList DijkstraPath = new ArrayList();"},"positive_passages":{"kind":"list like","value":[{"docid":"1690ec6f43bfbe5d4a6c5e6f726968ae","score":"0.0","text":"public Node(Object value) {\n this.value = value;\n }","title":""}],"string":"[\n {\n \"docid\": \"1690ec6f43bfbe5d4a6c5e6f726968ae\",\n \"score\": \"0.0\",\n \"text\": \"public Node(Object value) {\\n this.value = value;\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"bcc9f0a0485d5cfe4128bf9420fe965e","score":"0.6299296","text":"private ArrayList<Node> Dijkstra(Node loc1, Node loc2) {\n\n // Initially, only the start node is known.\n dPQ.add(start);\n\n //while loop that actually runs through all possible paths.\n while (dPQ.isEmpty() != true) {\n dNode current = dPQ.poll();\n //System.out.println(current.node.getNodeID());\n //Check if the goal has been reached yet\n if (current.node.getNodeID().equals(loc2.getNodeID())) {\n System.out.println(\"reached dijkstra goal!\");\n //if so trace back its path\n closedSet.clear();\n dPQ.clear();\n return reconstruct_path(current);\n }\n //add the current path to the closedSet(Explored)\n closedSet.add(current.node.getNodeID());\n\n neighbors.clear();\n //get all the edges connected to the starting node\n neighbors = edgeM.getNeighbors(current.node);\n //add all the nodes from the connected edges to the neighbors list\n Boolean floorChange = false;\n\n //loop through the nieghbors\n for (int i = 0; i < neighbors.size(); i++) {\n //check if the node is in the closed set\n for (int j = 0; j < closedSet.size(); j++) {\n if (neighbors.get(i).getNodeID().equals(closedSet.get(j))) {\n alreadfound = true;\n break;// Ignore the neighbor which is already evaluated.\n } else{\n alreadfound = false;\n\n }\n }\n\n if (alreadfound == true){\n\n //if the node is in the closed set ignore it\n }\n else {\n //if it is not in the closed set add it the priority queue allong with its parent\n Edge gEdge= new Edge(current.node,neighbors.get(i));\n double distToNext = gEdge.getWeight();\n double parentCost;\n if (current.parent == null){\n parentCost = 0;\n }\n else {\n parentCost = current.parent.gCost;\n }\n double gCost = parentCost + distToNext ;\n if(((loc2.getBuilding().equals(\"BTM\") || loc2.getBuilding().equals(\"Shapiro\")))||((neighbors.get(i).getBuilding().equals(\"BTM\") || neighbors.get(i).getBuilding().equals(\"Shapiro\")))){\n if (!(loc2.getBuilding().equals(neighbors.get(i)))){\n //if one is the tower and one is fransis ignore\n if (!(neighbors.get(i).getFloor().equals(\"2\"))) {\n gCost += 100;\n }\n }\n }\n if (!(loc2.getFloor().equals(neighbors.get(i).getFloor()))){\n //if one is the tower and one is fransis ignore\n gCost += 200;\n }\n\n dNode tempStar = new dNode(neighbors.get(i), current, gCost);\n dPQ.add(tempStar);\n //System.out.println(dPQ.size());\n }\n\n }\n }\n //fail case returns empty list\n ArrayList<Node> failList = new ArrayList<Node>();\n return failList;\n }","title":""},{"docid":"46ae48923f3b82083acbac9f474c582f","score":"0.62109447","text":"public static void main(String[] args) {\r\n \r\n \tlong startTime = System.nanoTime();\r\n \t\r\n \t\r\n\r\n \t\r\n \tclass Graph{\r\n \t\t//int vertices;\r\n \t\tHashMap<Integer,Vertices> vertices; \r\n \t\tHashSet<Edge> edges;\r\n \t\tclass Vertices\r\n \t\t\t{\r\n \t\t\tint Label;\r\n \t\t\t//int id;\r\n \t\t\tList<Edge> adjacent=new ArrayList<Edge>();;\r\n\t\t\t\tprivate int length=-1;\r\n \t\t\t\r\n \t\t\tpublic int getLabel() {\r\n \t\t\t\treturn Label;\r\n \t\t\t}\r\n \t\t\tpublic void setLabel(int label) {\r\n \t\t\t\tLabel = label;\r\n \t\t\t}\r\n \t\t\t\r\n\t\t\t\tpublic List<Edge> getIncident() {\r\n\t\t\t\t\treturn adjacent;\r\n\t\t\t\t}\r\n\t\t\t\tpublic void setLength(int count) {\r\n\t\t\t\t\tthis.length=count;\r\n\t\t\t\t}\r\n\t\t\t\tpublic int getLength() {\r\n\t\t\t\t\treturn this.length;\r\n\t\t\t\t}\r\n\t\t\t\t\t\r\n \t\t\t}\r\n \t\t\r\n \t\t class Edge{\r\n \t\t\t//int id;\r\n \t\t\tint start,end;\r\n \t\t\tint Label;\r\n \t\t\t\r\n \t\t\tpublic Edge(int v1, int v2) {\r\n \t\t\t\t// TODO Auto-generated constructor stub\r\n \t\t\t\tstart=v1;\r\n \t\t\t\tend=v2;\r\n \t\t\t\t\r\n \t\t\t}\r\n \t\t\tpublic int getStart() {\r\n \t\t\t\treturn start;\r\n \t\t\t}\r\n \t\t\t\r\n \t\t\tpublic int getEnd() {\r\n \t\t\t\treturn end;\r\n \t\t\t}\r\n \t\t\t\r\n \t\t\tpublic int getLabel() {\r\n \t\t\t\treturn Label;\r\n \t\t\t}\r\n \t\t\tpublic void setLabel(int label) {\r\n \t\t\t\tLabel = label;\r\n \t\t\t}\r\n\t\t\t\tpublic int opposite(int v) {\r\n\t\t\t\t\t// TODO Auto-generated method stub\r\n\t\t\t\t\tif(v==start)return end;\r\n\t\t\t\t\telse return start;\r\n\t\t\t\t\t\r\n\t\t\t\t\t\r\n\t\t\t\t}\r\n \t\t\t\r\n \t\t}\r\n \t\tGraph(int [][]ed,int n){\r\n \t\t\tvertices=new HashMap<Integer, Vertices>();\r\n \t\t\tedges=new HashSet<Edge>();\r\n \t\t\tfor(int i=0;i<n;i++)\r\n \t\t\t\tvertices.put(i, new Vertices());\r\n \t\t\tfor(int[] e:ed){\r\n \t\t\t\t\r\n \t\t\t\t//Vertices v1=vertices.get(e[0]-1);\r\n \t\t\t\t//Vertices v2=vertices.get(e[1]-1);\r\n \t\t\t\t\r\n \t\t\t\t//Vertices v1=new Vertices(e[0]-1);\r\n \t\t\t\t//Vertices v2=new Vertices(e[1]-1);\r\n \t\t\t\t//if(!vertices.containsKey(e[0]))vertices.put(e[0],v1);\r\n \t\t\t\t//if(!vertices.containsKey(e[1]))vertices.put(e[1],v2);\r\n \t\t\t\tedges.add(new Edge(e[0]-1,e[1]-1));\r\n \t\t\t}\r\n \t\t\t/*for(Integer v: vertices.keySet()){\r\n \t\t\t\tVertices vertex=vertices.get(v);\r\n \t\t\t\t//vertex.setIncident(new LinkedList<Edge>());\r\n \t\t\t\t/*for(Edge e :edges){\r\n \t\t\t\t\tif(e.getStart()==v||e.getEnd()==v){\r\n \t\t\t\t\t\tvertex.getIncident().add(e);\r\n \t\t\t\t\t}\r\n \t\t\t\t}*/\r\n \t\t\t\t\r\n \t\t\t//}\r\n \t\t}\r\n\t\t\tpublic void BFS(int s) {\r\n\t\t\t\t/*for(Edge e:edges){\r\n\t\t\t\t\te.setLabel(\"U\");\r\n\t\t\t\t}\r\n\t\t\t\tfor(Integer v: vertices.keySet()){\r\n \t\t\t\tVertices vertex=vertices.get(v);\r\n \t\t\t\tvertex.setLabel(\"U\");\r\n\t\t\t\t\r\n\t\t\t}*/\r\n\t\t\t\t/*for(Integer v: vertices.keySet()){\r\n\t\t\t\t\tVertices vertex=vertices.get(v);\r\n\t\t\t\t\tif(vertex.getLabel().equals(\"U\"))BFS(vertex);\r\n\t\t\t\t\t\r\n\t\t\t\t}*/\r\n\t\t\t\t\r\n\t\t\t\tBFS(s-1,vertices);\r\n\t\t\t}\r\n\t\t\tpublic void BFS(int s, HashMap<Integer,Vertices> vertices2) {\r\n\t\t\t\tVertices vertex=vertices.get(s);\r\n\t\t\t\tList<Integer> L=new ArrayList<Integer>();\r\n\t\t\t\tint count=0;\r\n\t\t\t\tvertex.setLength(count);\r\n\t\t\t\tL.add(s);\r\n\t\t\t\tvertex.setLabel(1);\r\n\t\t\t\tint counter=0;\r\n\t\t\t\tint temp=vertex.getLength();\r\n\t\t\t\twhile(!L.isEmpty()){\r\n\t\t\t\t\tint test=L.get(0);\r\n\t\t\t\t\tVertices v=vertices.get(test);\r\n\t\t\t\t\tcounter++;\r\n\t\t\t\t\tif(temp!=v.getLength())count++;\r\n\t\t\t\t\ttemp=v.getLength();\r\n\t\t\t\t\tL.remove(0);\r\n\t\t\t\t\t//if((v.getLength()-1==count))count++;\r\n\t\t\t\t\t//List<Edge> li= v.getIncident();\r\n\t\t\t\t\t\r\n\t\t\t\t\t//\tfor(Edge e:li){\r\n\t\t\t\t\t//for(int k = 0;k<li.size();k++){\r\n\t\t\t\t\t\t\t//count++;\r\n\t\t\t\t\tint counterb=0;\r\n\t\t\t\t\t\tfor(Edge e :edges){\r\n\t \t\t\t\t\tif(e.getStart()==test||e.getEnd()==test){\r\n\t \t\t\t\t\t\tcounterb++;\r\n\t \t\t\t\t\t\r\n\t\t\t\t\t\t\t //e=li.get(k);\r\n\t\t\t\t\t\t\tif(e.getLabel()==0){\r\n\t\t\t\t\t\t\t\tint oppo=e.opposite(test);\r\n\t\t\t\t\t\t\t\tVertices w=vertices.get(e.opposite(test));\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tif(w.getLabel()==0){\r\n\t\t\t\t\t\t\t\t\te.setLabel(2);\r\n\t\t\t\t\t\t\t\t\tw.setLabel(1);\r\n\t\t\t\t\t\t\t\t\tL.add(oppo);\r\n\t\t\t\t\t\t\t\t\tw.setLength(count+1);\r\n\t\t\t\t\t\t\t\t\t//count--;\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\telse {\r\n\t\t\t\t\t\t\t\t\te.setLabel(3);\r\n\t\t\t\t\t\t\t\t\t//count--;\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t//count--;\r\n\t\t\t\t\t\t\t}//count--;\r\n\t\t\t\t\t\t\t\r\n\t \t\t\t\t\t}//if(k==li.size()-1)count++;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tSystem.out.println(\"counterb: \"+counterb);\r\n\t\t\t\t\t\t//if((v.getLength()-1==count))\r\n\t\t\t\t\t\t//count++;\r\n\t\t\t\t } //end while\r\n\t\t\t\tSystem.out.println(\"Counter:\");\r\n\t\t\t\tSystem.out.println(counter);\r\n\t\t\t}\r\n\t\t\tpublic void out(int s,int m) {\r\n\t\t\t\tVertices main=vertices.get(s-1);\r\n\t\t\t\t\r\n\t\t\t\tfor(int i=0;i<m;i++){\r\n\t\t\t\t\tVertices vertex=vertices.get(i);\r\n\t\t\t\tif(vertex!=main){\r\n\t\t\t\t\tif(vertex.length!=-1)\r\n\t\t\t\t\tSystem.out.printf(\"%d \",vertex.getLength()*6);\r\n\t\t\t\t/*{\toutput.append(vertex.getLength()*6);\r\n\t\t\t\t\toutput.append(\" \");\r\n\t\t\t\t}*/\r\n\t\t\t\telse System.out.printf(\"-1 \");\r\n\t\t\t\t\t//output.append(\"-1 \");\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\t\t//System.out.printf(\"-1 \");\r\n\t\t\t\t}\r\n\t\t\t\t/*for(Integer v: vertices.keySet()){\r\n\t\t\t\t\tVertices vertex=vertices.get(v);\r\n\t\t\t\t\tif(vertex!=main)\r\n\t\t\t\t\tSystem.out.printf(\"%d \",vertex.getLength()*6);\r\n\t\t\t\t\t\r\n\t\t\t\t}*/\r\n\t\t\t}\r\n \t}\r\n \t\r\n \t\r\n \t/*********************************************************************************\r\n \t * \r\n \t * \r\n \t * \r\n \t * \r\n \t * \r\n \t * \r\n \t * \r\n \t * \r\n \t */\r\n \tlong endTime = System.nanoTime();\r\n \tSystem.out.println(\"Create classes time\");\r\n \tSystem.out.println(startTime-endTime);\r\n \t\r\n \tScanner in =new Scanner(System.in);\r\n \tint q=in.nextInt();\r\n \t//StringBuilder[] output=new StringBuilder[q];\r\n \t\r\n \tfor(int ii=0;ii<q;ii++)\r\n \t{\r\n \t\t\r\n \t\t//output[ii]=new StringBuilder();\r\n \t\tint verticeCount=in.nextInt();\r\n \t\tint edgeCount=in.nextInt();\r\n \t\t\r\n \t\tint[][] edges=new int[edgeCount][2];\r\n \t\t\r\n \t\tfor (int j=0;j<edgeCount;j++){\r\n \t\t\t\r\n \t\t\tedges[j][0]=in.nextInt();\r\n \t\t\tedges[j][1]=in.nextInt();\r\n \t\t\t\r\n \t\t\t\r\n \t\t}\r\n \t\tint s=in.nextInt();\r\n \t\t//in.close();\r\n \t\tGraph G=new Graph(edges,verticeCount);\r\n \t\tG.BFS(s);\r\n \t\t\r\n \t\tG.out(s,verticeCount);\r\n \t\tSystem.out.println();\r\n \t\tG=null;\r\n \t\t\r\n \t}\r\n \tin.close();\r\n \t/*for (int ii=0;ii<q;ii++){\r\n \t\tSystem.out.println(output[ii].toString());\r\n \t}*/\r\n \tlong TendTime = System.nanoTime();\r\n \tSystem.out.println(\"Exectuion time total is : \");\r\n \tSystem.out.println(TendTime-startTime);\r\n \t\r\n \t}","title":""},{"docid":"0c0f445b3a4c919114c8c905efe25cb8","score":"0.6180038","text":"public ArrayList<Edge<T>> dijsktra(Vertex<T> entry, Vertex<T> goal){\n if(entry == null || goal == null){\n throw new NullPointerException(\"entry or goal vertex was not found! Error in: graph.dijkstra\");\n }\n\n // assign a number to each vertex\n assignIndexToVertices();\n\n for(Vertex<T> v:vertices){\n // a false value here is equal to setting the vertexDistances-value to infinity\n v.placeholderInitialized = false;\n }\n\n boolean[] visited = new boolean[vertices.size()];\n\n QuickAccessHeapTree<Vertex<T>> toProcess = new QuickAccessHeapTree<>((a, b) -> a.placeholder-b.placeholder<0?-1:a.placeholder-b.placeholder>0?1:0);\n toProcess.add(entry);\n entry.placeholderInitialized = true;\n\n while (!toProcess.isEmpty()){\n // pops the smallest element\n Vertex<T> vertex = toProcess.popMin();\n\n // mark the current vertex as visited\n visited[vertex.index] = true;\n\n if(vertex.equals(goal)){\n return getShortestPath(entry, goal);\n }\n\n for(Edge<T> e: vertex.getOutgoingEdges()){\n Vertex<T> w = e.getEnd();\n if(!visited[w.index]){\n toProcess.add(w);\n visited[w.index] = true;\n }\n if(w.placeholder > vertex.placeholder + e.getWeight() || !w.placeholderInitialized){\n w.placeholder = vertex.placeholder + e.getWeight();\n toProcess.updateKey(w);\n // after the first time that we assign a shortest distance value to a vertex, mark it as initialized\n // so we don't treat it as if it had a distance value of infinity\n w.placeholderInitialized = true;\n }\n }\n\n }\n\n System.out.println(\"We reached the goal (\" + goal.getItem().toString() + \") with a length of \" + goal.placeholder);\n\n return null;\n }","title":""},{"docid":"2b95d1602d722735eeb30125ace389c2","score":"0.61353576","text":"@Test\n public void dijkstraPathsTest() {\n int n = 7;\n int m = 6;\n Graph g = new GridGenerator<>(MemoryGraph.class, n, m).create();\n\n Map<VertexPair, Double> distFloyd = FloydWarshall.execute(g);\n\n VertexPair largestPair = distFloyd.keySet().iterator().next();\n double largestDistance = 0.0;\n for (VertexPair e : distFloyd.keySet()) {\n if (distFloyd.get(e) > largestDistance) {\n largestDistance = distFloyd.get(e);\n largestPair = e;\n }\n }\n\n Map<Vertex, Collection<VertexSequence>> r = Dijkstra.executeWithPath(g, largestPair.getSource());\n int num = r.get(largestPair.getTarget()).size();\n\n Assert.assertEquals(\"dijkstraPathsTest\", LongMath.binomial(n + m - 2, n - 1), num);\n }","title":""},{"docid":"6940c125ac303fe4c76afcae143870be","score":"0.6099519","text":"public void dijkstra( String startName )\r\n {\r\n PriorityQueue<Path> pq = new PriorityQueue<Path>( );\r\n\r\n Vertex start = vertexMap.get( startName );\r\n if( start == null )\r\n return;\r\n\r\n clearAll( );\r\n pq.add( new Path( start, 0 ) ); start.dist = 0;\r\n \r\n int nodesSeen = 0;\r\n while( !pq.isEmpty( ) && nodesSeen < vertexMap.size( ) )\r\n {\r\n Path vrec = pq.remove( );\r\n Vertex v = vrec.dest;\r\n if( v.scratch != 0 ) // already processed v\r\n continue;\r\n \r\n v.scratch = 1;\r\n nodesSeen++;\r\n\r\n for( Edge e : v.adj )\r\n {\r\n Vertex w = e.dest;\r\n double cvw = e.cost;\r\n \r\n if( cvw < 0 ){\r\n System.out.println(\"Graph has negative edges\" );\r\n break;\r\n }\r\n \r\n /*System.out.println(\" \");\r\n System.out.println(\"start \" + v.name);\r\n System.out.println(\"dest \" + w.name);\r\n System.out.println(\"w.dist \" + w.dist);\r\n System.out.println(\"v.dist + cvw\" + (v.dist+cvw));*/\r\n if( w.dist > v.dist + cvw )\r\n {\r\n w.dist = v.dist +cvw;\r\n w.prev = v;\r\n pq.add( new Path( w, w.dist ) );\r\n if(v.multiple == true){\r\n w.multiple = true;\r\n //System.out.println(w.name + \" MULTIPLE\");\r\n }\r\n }else if ((w.dist == v.dist + cvw)){\r\n //System.out.println(w.name + \" multiple\");\r\n w.multiple = true;\r\n w.scratch=0;\r\n }\r\n }\r\n }\r\n \r\n }","title":""},{"docid":"4dee0b2757d8583e73b007c03936508b","score":"0.60398144","text":"private FastestRoute(ArrayList<Integer>[] adjList, ArrayList<Integer>[] costList)\r\n\t{\r\n\t\tadj = adjList;\r\n\t\tcost = costList;\r\n\t\tnodes = new Vertex[adjList.length]; // after we instantiate the 'nodes' we have to populate it with the 'Vertex' objects with default values\r\n\t\tfor (int i = 0; i < nodes.length; i++)\r\n\t\t\tnodes[i] = new Vertex();\r\n\t}","title":""},{"docid":"e9c8a392d62ffb7f06d801f91b92f78c","score":"0.60386723","text":"public ArrayList<Integer>[][] calculShortestPaths(int size,ArrayList<Pair> liens) {\n\t\tArrayList<Integer>[][] paths= new ArrayList[size][size];\n\t\t//initialiser paths\n\t\tfor (int i=0;i<size;i++) {\n\t\t\tfor (int j=0;j<size;j++) {\n\t\t\t\tArrayList<Integer> l = new ArrayList<Integer>() ;\n\t\t\t\tl.add(j);\n\t\t\t\tpaths[i][j] = l; \n\t\t\t}\n\t\t}\n\n\t\t//\t\tInitialisation de matrice d'adjacence\n\t\tdouble[][] m = new double[size][size];\n\t\tfor(Pair pair : liens) {\n\t\t\tm[pair.p1][pair.p2] = 1;\n\t\t\tm[pair.p2][pair.p1] = 1;\n\t\t}\n\n\t\tfor(int i =0;i<size;i++) {\n\t\t\tfor (int j=0;j<size;j++) {\n\t\t\t\tif(i == j) m[i][j] = 0;\n\t\t\t\tif(m[i][j]!=1)\n\t\t\t\t\tm[i][j]= Double.MAX_VALUE;\n\t\t\t}\n\t\t}\n\n\t\t// calculer les plus courts chemins\n\t\tfor(int k = 0 ; k< size;k++) {\n\t\t\tfor(int i = 0 ; i< size;i++) {\n\t\t\t\tfor(int j = 0 ; j<size;j++) {\n\n\t\t\t\t\tif(i == j) continue;\n\t\t\t\t\tif(m[i][j]> m[i][k]+m[k][j]) {\n\t\t\t\t\t\tm[i][j]= m[i][k]+m[k][j];\n\t\t\t\t\t\tpaths[i][j]= paths[i][k];\n\t\t\t\t\t} \n\t\t\t\t\tif(m[i][j] == m[i][k]+m[k][j]) {\n\t\t\t\t\t\tArrayList<Integer> list = (ArrayList<Integer>) paths[i][k].clone();\n\t\t\t\t\t\tfor(int path:paths[i][j]) {\n\t\t\t\t\t\t\tif(!list.contains(path))\n\t\t\t\t\t\t\t\tlist.add(path);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tpaths[i][j]=list;\n\t\t\t\t\t}\n\t\t\t\t} \t \t \t\n\t\t\t}\n\t\t}\n\n\n\t\treturn paths;\n\t}","title":""},{"docid":"b404b58f1ad5e4973bfff677f914b4e2","score":"0.5967858","text":"private static void shortestPath(ArrayList<ArrayList<Integer>> adj, int v) {\n\t\t\n\t\tInteger[] distance=new Integer[v+1];\n\t\tfor(int i=0;i< distance.length;i++)\n\t\t{\n\t\t\tdistance[i]=9999;\n\t\t\t\n\t\t}\n\t\t\n\t\tint src=0;\n\t\tqueue1.add(src);\n\t\tdistance[src]=0;\n\t\twhile(queue1.size()>0)\n\t\t{\n\t\t\tint elem=queue1.poll();\n\t\t\tfor(int i: adj.get(elem))\n\t\t\t{\n\t\t\t\tif(distance[i] > distance[elem]+1)\n\t\t\t\t{\n\t\t\t\t\tdistance[i]=distance[elem]+1;\n\t\t\t\t\tqueue1.add(i);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(distance[3]);\n\t}","title":""},{"docid":"60977617e463fa0ade45c260e301f6e3","score":"0.5959473","text":"void dijkstra(int graph[][], HashMap hm, int src, int dest)\n {\n int dist[] = new int[V]; // The output array. dist[i] will hold\n \n int path[] = new int[V]; // the shortest distance from src to i path.\n \n // sptSet[i] will true if vertex i is included in shortest\n // path tree or shortest distance from src to i is finalized\n Boolean sptSet[] = new Boolean[V];\n \n // Initialize all distances as INFINITE and stpSet[] as false\n for (int i = 0; i < V; i++)\n {\n dist[i] = Integer.MAX_VALUE;\n sptSet[i] = false;\n }\n \n // Distance of source vertex from itself is always 0\n dist[src] = 0;\n path[src] = src;\n \n // Find shortest path for all vertices\n for (int count = 0; count < V-1; count++)\n {\n // Pick the minimum distance vertex from the set of vertices\n // not yet processed. u is always equal to src in first\n // iteration.\n int u = minDistance(dist, sptSet);\n if(u == dest)break; // If the Destination is reached, break the for loop.\n \n // Mark the picked vertex as processed\n sptSet[u] = true;\n \n // Update dist value of the adjacent vertices of the\n // picked vertex.\n for (int v = 0; v < V; v++)\n \n // Update dist[v] only if is not in sptSet, there is an\n // edge from u to v, and total weight of path from src to\n // v through u is smaller than current value of dist[v]\n if (!sptSet[v] && graph[u][v]!=0 &&\n dist[u] != Integer.MAX_VALUE &&\n dist[u]+graph[u][v] < dist[v]){\n dist[v] = dist[u] + graph[u][v];\n \tpath[v] = u;\n }\n }\n \n // print the constructed distance array\n printSolution(dist, path, V, src, dest, hm);\n }","title":""},{"docid":"672f486c02ed9462512ddfb7ced33aec","score":"0.5895148","text":"@Override\n public List<node_info> shortestPath(int src, int dest) {\n if(src==dest){\n List<node_info> r = new LinkedList<>();\n r.add(_graph.getNode(src));\n return r;\n }\n\n int[] pointToKey = ((WGraph_DS)_graph).toKeyArray();// can improve by O(n)\n HashMap<Integer,Integer> keyToPoint = new HashMap<>();\n double[] distance = new double[pointToKey.length];\n boolean[] was = new boolean[pointToKey.length];\n int[] comeFromKey = new int[pointToKey.length];\n for (int i = 0; i < pointToKey.length; i++) { //initialisation\n keyToPoint.put(pointToKey[i],i);\n distance[i] = Double.MAX_VALUE;\n was[i]=false;\n comeFromKey[i]=-1;\n }\n for (node_info n : _graph.getV(dest) //for the dest\n ) {\n distance[keyToPoint.get(n.getKey())]=_graph.getEdge(dest,n.getKey());\n comeFromKey[keyToPoint.get(n.getKey())] = dest;\n }\n was[keyToPoint.get(dest)]=true;\n\n boolean thereIsChange = true;\n int nodePointer = keyToPoint.get(dest);\n\n while (thereIsChange) { //pass on all the graph\n thereIsChange=false;\n boolean first = true;\n for (int i = 0; i < pointToKey.length; i++) { //find the min distance and point to it\n if ((!was[i]&distance[i]<Integer.MAX_VALUE&first)|(!was[i]&distance[i]<distance[nodePointer]&!first)){\n nodePointer=i;\n first = false;\n thereIsChange = true; //there is work to be done\n }\n }\n\n for (node_info n : _graph.getV(pointToKey[nodePointer]) //neighbors pass\n ) {\n if (distance[keyToPoint.get(n.getKey())] > distance[nodePointer] + _graph.getEdge(n.getKey(), pointToKey[nodePointer])&!was[keyToPoint.get(n.getKey())]) {\n distance[keyToPoint.get(n.getKey())] = distance[nodePointer] + _graph.getEdge(n.getKey(), pointToKey[nodePointer]);\n comeFromKey[keyToPoint.get(n.getKey())] = pointToKey[nodePointer];\n }\n }\n was[nodePointer] = true;\n }\n\n if (!was[keyToPoint.get(src)])return null;\n List<node_info> shortestPath = new LinkedList<>();\n shortestPath.add(_graph.getNode(src));\n int last = keyToPoint.get(comeFromKey[keyToPoint.get(src)]);\n if(last==keyToPoint.get(dest)) return shortestPath;\n while (true){\n shortestPath.add(_graph.getNode(pointToKey[last]));\n last = keyToPoint.get(comeFromKey[last]);\n if(pointToKey[last]==dest)break;\n }\n return shortestPath;\n }","title":""},{"docid":"190a397eaee5e5f0ecfb35e7504df8f5","score":"0.5874963","text":"public void dijkstra(Integer s){\n MinHeap fila = new MinHeap();\n //Set<Vertice> verificado= new HashSet<>();\n Vertice atual;\n initMinPath(0);\n for(int i= 0; i<vertices.size(); i++){\n fila.insert(getVertice(i));\n }\n while(!fila.isEmpty()){\n atual= fila.extractMin();\n //verificado.add(atual);\n if(vertices.get(atual.id) != null) {\n for (Aresta a : vertices.get(atual.id).getValue()) {\n relax(atual.id, a.vertice, a.peso, fila);\n }\n }\n }\n }","title":""},{"docid":"83e63bf42276aed28426deef15f8a0cf","score":"0.5864024","text":"private static void shortestPathDjistra(ArrayList<ArrayList<Pair<Integer, Integer>>> adjWeighted, int v) {\n\n\t\tInteger[] distance=new Integer[v+1];\n\t\tfor(int i=0;i< distance.length;i++)\n\t\t{\n\t\t\tdistance[i]=9999;\n\t\t\t\n\t\t}\n\t\tint src=0;\n\t\tpqueue.add(new Pair(0,0));\n\t\tdistance[src]=0;\n\t\t\n\t\twhile(pqueue.size()>0)\n\t\t{\n\t\tPair elem=pqueue.poll();\n\t\tArrayList< Pair<Integer,Integer>> p=adjWeighted.get((int) elem.getValue());\n\t\tfor(Pair p1: p)\n\t\t{\n\t\t\tif(distance[(int) p1.getValue()] > distance[(int) elem.getValue()]+1 )\n\t\t\t{\n\t\t\t\tdistance[(int) p1.getValue()]=distance[(int) elem.getValue()]+1;\n\t\t\t\tpqueue.add(new Pair(distance[(int) p1.getValue()],p1.getKey()));\n\t\t\t}\n\t\t\n\t\t}\n\t\t\t\n\t\t}\n\t\tSystem.out.println(distance[3]);\n\n\t}","title":""},{"docid":"7577f9f2a24c195f19620a13fb358e24","score":"0.58607936","text":"ArrayList<Node> constructShortestPath() {\n for (Node n : this.mazeList) {\n if (n.partOfFinalPath) {\n shortestPath.add(n);\n }\n }\n\n return shortestPath;\n }","title":""},{"docid":"8e6552de6865c39ce8d63988a7505465","score":"0.5850537","text":"public List<Integer> getShortestPath() {\n\t\tDijkstraNode dNode = destDijkstraNode;\n\t\tif (dNode==null) \n\t\t\treturn null;\n\t\t\n\t\t/**\n\t\t * Generate path in the reverse order\n\t\t */\n\t\tLinkedList<Integer> result = new LinkedList<Integer>();\n\t\tfor(DijkstraNode dn=dNode;dn!=null;){\n\t\t\tresult.addFirst(dn.getLink().getId());\n\t\t\tdn = dn.getPrevNode();\n\t\t}\n\t\treturn result;\n\t\t\n\t}","title":""},{"docid":"9144ee8c19642e360732eb3e808398b3","score":"0.579003","text":"Driver ()\n { \n dijkstra = new Dijkstra(new Graph().getGraph()); \n }","title":""},{"docid":"94892c7c06ea9fe39c67bae1fa4bf7e0","score":"0.57850343","text":"public Link(Vertex vertex, int index, int distance) // constructor\n {\n this.vertex = vertex;\n this.indexOnArray = index;\n this.dData = distance;\n }","title":""},{"docid":"998c0bec6b9a18174e0bbc517a8e6a13","score":"0.5757041","text":"public Dijkstra(Graph g){\n this.g = g;\n }","title":""},{"docid":"a93a7130d6fd2071f57c4ddba5bd84a4","score":"0.5754974","text":"public ShortestPathAlgorithm() { \r\n\t\tData data = new Data( \"null\", \"null\", 0);\r\n\t\tarrayData.add(data);\r\n\t\tarrayNode.add(\"null\");\r\n\t}","title":""},{"docid":"7fbc4b78d13e7e3f16a10feb85cd1c50","score":"0.57027733","text":"public Graf(){\n vertexArray = new ArrayList<Vertex>();\n arestaArray = new ArrayList<Aresta>(); \n }","title":""},{"docid":"7dc56c4f65eccbc81bee7240d33dd161","score":"0.5684075","text":"public Vertex() {\n\t\tadjacency = new ArrayList<Integer>();\n\t}","title":""},{"docid":"cf4d4b13ef2d97470fe3eb5a34d41051","score":"0.56723136","text":"public BigInteger dijkstra() {\n\n\t\tboolean[] selected = new boolean[friendships.length];\n\t\tBigInteger[] noise = new BigInteger[friendships.length];\n\n\t\tQueue<Pair> connected = new PriorityQueue<>();\n\n\t\tfor (int i = 0; i < friendships.length; i++)\n\t\t\tnoise[i] = DEFAULT_VAL;\n\n\t\tfor (int node : friendships[s]) {\n\t\t\tBigInteger value = new BigInteger(\"0\");\n\t\t\tnoise[node] = value;\n\t\t\tconnected.add(new Pair(node, value));\n\t\t}\n\n\t\tdo {\n\t\t\tPair pair = connected.remove();\n\t\t\tselected[pair.getKey()] = true;\n\t\t\tif (pair.getKey() == t)\n\t\t\t\tbreak;\n\t\t\texploreNodes(pair, selected, noise, connected);\n\n\t\t} while (!connected.isEmpty());\n\n\t\treturn noise[t].mod(MODULE_POW);\n\t}","title":""},{"docid":"5cd897282b7d5e6767cbfc240ce54281","score":"0.5661883","text":"public static void main(String[] args) {\n final int[][] graph = { { 0, 2, 4, Dijkstra.M, Dijkstra.M, Dijkstra.M }, \n { 2, 0, 1, 4, Dijkstra.M, Dijkstra.M },\n {4, 1, 0, 2, 6, Dijkstra.M}, {Dijkstra.M, 4, 2, 0, 1, 3}, \n {Dijkstra.M, Dijkstra.M, 6, 1, 0, 5},\n {Dijkstra.M, Dijkstra.M, Dijkstra.M, 3, 5, 0 }};\n Dijkstra d = new Dijkstra(graph);\n int sp = d.shortestPath(0, 4);\n System.out.println(\"d = \" + sp);\n }","title":""},{"docid":"a217f4adb3045effe4efd3ecd5cf17ee","score":"0.562217","text":"shortestPath() throws IOException, ClassNotFoundException{\r\n \tFile stops, stopTimes, transfers;\r\n \tstops = new File(\"stops.txt\");\r\n \tstopTimes = new File(\"stop_times.txt\");\r\n \ttransfers = new File(\"transfers.txt\");\r\n \t\r\n \t//-1s here, as all input files have a header\r\n \tthis.V = numberOfLines(stops) - 1;\r\n \tint transferEdges = numberOfLines(transfers) - 1;\r\n\r\n \tthis.graph = new double[V][V];\r\n \t\r\n \tconversions = new ArrayList<Integer>(V);\r\n \tSystem.out.println(V + \" Stops & \" + (transferEdges) + \" Transfers\");\r\n \t\r\n \t// Set all values in graph to Integer.MAX_VALUE, so that Floyd Warshall will work\r\n \tfor(int i = 0; i < V; i++) {\r\n \t\tfor(int j = 0; j < V; j++) {\r\n \t\t\tif(i == j) { graph[i][j] = 0; }\r\n \t\t\telse { graph[i][j] = Integer.MAX_VALUE; }\r\n \t\t}\r\n \t}\r\n \t\r\n \t// Generating translation key from stop id to index in graph\r\n \tScanner stopScanner;\r\n \ttry {\r\n \t\tstopScanner = new Scanner(stops);\r\n \t} catch (FileNotFoundException e) {\r\n \t\te.printStackTrace();\r\n \t\treturn;\r\n \t}\r\n \tstopScanner.useDelimiter(\",\");\r\n \tstopScanner.nextLine(); // dump headers\r\n \tfor(int i = 0; i < V; i++) {\r\n \t\tint stopID = (int) stopScanner.nextDouble();\r\n \t\tconversions.add(stopID);\r\n \t\tstopScanner.nextLine();\r\n \t}\r\n \t\r\n \tstopScanner.close();\r\n \t\r\n \t//TODO: assign Stops & Edges to the graph\r\n \t// stop numbers will have to be assigned to integers, and reconverted at the end\r\n \t\r\n \tScanner tranScanner;\r\n\t\ttry {\r\n\t\t\ttranScanner = new Scanner(transfers);\r\n\t\t} catch (FileNotFoundException e) {\r\n\t\t\te.printStackTrace();\r\n\t\t\treturn;\r\n\t\t}\r\n \t//Assigning costs of all edges defined in transfers.txt\r\n\t\ttranScanner.nextLine(); // dump headers\r\n\t\ttranScanner.useDelimiter(\",\");\r\n \tfor(int i = 0; i < transferEdges; i++) {\r\n \t\tint from = conversions.indexOf(Integer.parseInt(tranScanner.next()));\r\n \t\tint to = conversions.indexOf(Integer.parseInt(tranScanner.next()));\r\n \t\tint transType = (int) tranScanner.nextDouble();\r\n \t\tif(transType == 2) {\r\n \t\t\tgraph[from][to] = ((conversions.indexOf(Integer.parseInt(tranScanner.nextLine().replace(',', ' ').trim()))) / 100.0);\r\n \t\t}\r\n \t\telse if(transType == 0) {\r\n \t\t\tgraph[from][to] = 2;\r\n \t\ttranScanner.nextLine();\r\n \t\t}\r\n \t\telse {\r\n \t\t\tSystem.out.println(\"INVALID transfer_type: \" + transType);\r\n \t\t\ttranScanner.close();\r\n \t\t\treturn;\r\n \t\t}\r\n \t}\r\n \ttranScanner.close();\r\n \tScanner timeScanner;\r\n \ttry {\r\n \t\ttimeScanner = new Scanner(stopTimes);\r\n \t} catch (FileNotFoundException e) {\r\n \t\te.printStackTrace();\r\n \t\treturn;\r\n \t}\r\n \t//Assigning costs of all edges defined in stop_times.txt\r\n\t\ttimeScanner.nextLine();\r\n \t\r\n \tString[] line1 = timeScanner.nextLine().split(\",\");\r\n\t\tString[] line2 = timeScanner.nextLine().split(\",\");\r\n\t\r\n \twhile(timeScanner.hasNextLine()) {\r\n \t\tif(Integer.parseInt(line1[0]) == Integer.parseInt(line2[0])) {\r\n \t\t\tint from = conversions.indexOf(Integer.parseInt(line1[3]));\r\n \t\t\tint to = conversions.indexOf(Integer.parseInt(line2[3]));\r\n \t\t\tgraph[from][to] = 1;\r\n \t\t}\r\n \t\tline1 = line2;\r\n \t\tline2 = timeScanner.nextLine().split(\",\");\r\n \t} \t\r\n \ttimeScanner.close();\r\n \t\r\n \tthis.paths = new int[V][V];\r\n \tfor(int i = 0; i < V; i++) {\r\n \t\tfor(int j = 0; j < V; j++) {\r\n \t\t\tpaths[i][j] = j;\r\n \t\t}\r\n \t}\r\n \tFile graphFile = new File(\"graph.txt\");\r\n \tFile pathsFile = new File(\"paths.txt\");\r\n \tif (graphFile.exists() && pathsFile.exists())\r\n \t{\r\n \t\tSystem.out.println(\"retrieving graph files...\");\r\n \t\tObjectInputStream inputStream = new ObjectInputStream(new FileInputStream(\"graph.txt\"));\r\n \t\tgraph = (double[][])inputStream.readObject();\r\n \t\tinputStream.close();\r\n \t\tinputStream = new ObjectInputStream(new FileInputStream(\"paths.txt\"));\r\n \t\tpaths = (int[][])inputStream.readObject();\r\n \t\tinputStream.close();\r\n \t\tSystem.out.println(\"graph files retrieved\");\r\n \t} else {\r\n\t \tSystem.out.println(\"Warshalling Floyds...\");\r\n\t \tfor (int k = 0; k < V; k++)\r\n\t \t{\r\n\t \t\tif(k % 100 == 0) {System.out.println(k + \" / \" + V); }\r\n\t \tfor (int i = 0; i < V; i++)\r\n\t \t{\r\n\t \t\tfor (int j = 0; j < V; j++)\r\n\t {\r\n\t \t\t\tif (graph[i][k] + graph[k][j] < graph[i][j]) {\r\n\t \t\t\t\tgraph[i][j] = graph[i][k] + graph[k][j]; // Cost(i to j) now Cost(i to k) + Cost(k to j) \r\n\t \t\t\t\tpaths[i][j] = k; //Path from (i to j), now goes (i to k to j)\r\n\t \t\t\t}\r\n\t }\r\n\t }\r\n\t }\r\n\t \tSystem.out.println(\"Floyds Wharshalled!\");\r\n\t \t\r\n\t \tSystem.out.println(\"generating files...\");\r\n\t \tObjectOutputStream outputStream = new ObjectOutputStream(new FileOutputStream(\"graph.txt\"));\r\n\t \toutputStream.writeObject(graph);\r\n\t \toutputStream.close();\r\n\t \toutputStream = new ObjectOutputStream(new FileOutputStream(\"paths.txt\"));\r\n\t \toutputStream.writeObject(paths);\r\n\t \toutputStream.close();\r\n\t \tSystem.out.println(\"files generated\");\r\n \t}\r\n }","title":""},{"docid":"fbff13ebdc20ec4a5eb2d696d4bbcd88","score":"0.5618457","text":"private static <T> void initShortestPath(WGraph<T> graph, T start, int limit, HashMap<Pair<T, Integer>, Double> dist, PriorityQueue<Pair<T,Integer>> priQueue) {\n\tPair<T, Integer> p = new Pair<T, Integer>(start, 0);\n\n\tdist.put(p, 0.0);\n\tfor(int i=1; i <= limit; i++) {\n\t p = new Pair<T,Integer>(start, i);\n\t dist.put(p, Double.POSITIVE_INFINITY);\n\t}\n\n\tfor ( T vertex : graph.getVertices() ) {\n\t for(int i=0; i <= limit; i++) {\n\t\tp = new Pair<T, Integer>(vertex, i);\n\t\tif( !vertex.equals(start) )\n\t\t dist.put(p, Double.POSITIVE_INFINITY);\n\t\tpriQueue.add( p, dist.get(p));\n\t }\n\t}\n }","title":""},{"docid":"6d61552e38ce83daa6055e5e8a6485aa","score":"0.5616366","text":"void dijkstra(int graph[][], int src)\n {\n ArrayList<Integer> distList = new ArrayList<Integer>(V);\n Set<Integer> spSet = new HashSet<Integer>();\n\n for(int i=0;i < V; i++) {\n distList.add(Integer.MAX_VALUE);\n }\n distList.set(src, 0);\n\n for(int j=0; j< V ; j++) {\n int nextV = minDistance(spSet, distList);\n spSet.add(nextV);\n\n for (int i = 0; i < V; i++) {\n if (!spSet.contains(i) &&\n graph[nextV][i] != 0 &&\n distList.get(nextV) + graph[nextV][i] < distList.get(i)) {\n distList.set(i, distList.get(nextV) + graph[nextV][i]);\n }\n }\n }\n // print the constructed distance array\n printSolution(distList, V);\n }","title":""},{"docid":"a7eff1f5b044dff5b9f5b2175a0129e0","score":"0.5603963","text":"public void dijkstra(int start, int end) {\n long tempoInicial = System.currentTimeMillis();\n \n No inicio = nos.get(start);\n No fim = nos.get(end);\n \n inicio.setCustoMinimo(0); //O inicio tem custo 0\n\n List<No> nosAbertos = new ArrayList<>(); //Lista de nós abertos\n\n //Popula a lista com todos os nós abertos\n for (No no : nos) {\n nosAbertos.add(no);\n }\n\n No atual = inicio; //Nó em que estamos atualmente\n\n //Encontra os caminhos mínimos dos nós a partir da origem\n while (!nosAbertos.isEmpty()) {\n for (Aresta aresta : atual.getAdjacentes()) { //Calcula o custo para todos os nós adjacentes\n int novoCusto = atual.getCustoMinimo() + aresta.getCusto();\n int antigoCusto = aresta.getDestino().getCustoMinimo();\n \n if (novoCusto < antigoCusto) {\n aresta.getDestino().setCustoMinimo(novoCusto); //Altera o custo mínimo de um nó\n aresta.getDestino().setAntecessor(atual); //Define o nó antecessor\n }\n }\n\n atual.setEstadoNo(EstadoNo.FECHADO); //Fecha o nó atual\n nosAbertos.remove(atual); //Remove o nó atual da lista de nós abertos\n Collections.sort(nosAbertos); //Ordena a lista de nós abertos\n if (!nosAbertos.isEmpty()) {\n atual = nosAbertos.get(0); //Pega o nó com o menos custo\n }\n }\n long tempoFinal = System.currentTimeMillis();\n long tempoTotal = tempoFinal - tempoInicial;\n\n //Constroi o menor caminho da origem até o destino\n Stack<No> caminhoMinimo = new Stack<>(); //Uma pilha para montar o caminha mínimo do fim para o inicio\n caminhoMinimo.addElement(fim); //Adiciona o fim ao caminho minimo\n\n atual = fim; //Começa pelo fim\n while (!atual.equals(inicio)) { //Se repete até voltarmos ao início\n atual = atual.getAntecessor();\n caminhoMinimo.addElement(atual);\n }\n int count = caminhoMinimo.size();\n //Exibe todos os nós na pilha de caminho mínimo\n while (!caminhoMinimo.empty()) {\n atual = caminhoMinimo.pop();\n //System.out.println(\"NO:\" + atual.getId());\n }\n \n resetGrafo();\n \n System.out.println(\"COM HEAP\");\n System.out.println(\"\\nTAMANHO: \" + count);\n System.out.println(\"TEMPO: \" + tempoTotal+\"ms\");\n }","title":""},{"docid":"31abe4bf63a724ee3df0634bf06a588c","score":"0.5603942","text":"public static void main(String[] args) throws IOException{\n \n\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n List<List<Node>> graph = new ArrayList<List<Node>>();\n \n String[] temp = br.readLine().split(\" \");\n int n = Integer.parseInt(temp[0]);\n int m = Integer.parseInt(temp[1]);\n int k = Integer.parseInt(temp[2]);\n for(int i = 0 ; i < n ; i++){\n graph.add(new ArrayList<Node>());\n for(int j = 0 ; j < MAXFISH ; j++){\n optimal_cost[i][j] = Integer.MAX_VALUE/2;\n \n }\n }\n\n for(int i = 0; i < n; i++){\n String[] temp1 = br.readLine().split(\" \") ;\n int no_fish_type = Integer.parseInt(temp1[0]);\n for(int j = 1; j <=no_fish_type ; j++){\n int fish_type = Integer.parseInt(temp1[j]);\n gathered[i] = gathered[i] | 1 << (fish_type-1);\n \n }\n }\n /*for(int i=0;i<n;i++){\n System.out.println(gathered[i]);\n }*/\n for(int i = 0; i < m ; i++){\n String[] temp2 = br.readLine().split(\" \");\n int from = Integer.parseInt(temp2[0]);\n int to = Integer.parseInt(temp2[1]);\n int cost = Integer.parseInt(temp2[2]);\n graph.get(from-1).add(new Node(to-1 , cost));\n graph.get(to-1).add(new Node(from-1 , cost));\n \n }\n /*for(int i = 0 ; i < n ; i++){\n for(Node node:graph.get(i)){\n System.out.println(i+ \" \"+ node.dest + \" \" + node.cost);\n }\n }*/\n dijkstra(graph,0);\n \n int ans = Integer.MAX_VALUE;\n for(int i = 0 ; i < (1 << k) ; i++){\n for(int j = i ; j < (1 << k) ; j++){\n if((i|j) == (1 << k) - 1){\n int val = Math.max(optimal_cost[n-1][i],optimal_cost[n-1][j]);\n if(val < ans){\n ans = val;\n }\n }\n }\n }\n System.out.println(ans);\n \n \n }","title":""},{"docid":"cfd4f8b8a3034846e2818e3b971648e9","score":"0.55916667","text":"public Algorithm(){\n sequencePath = new Stack<>();\n shortestPath = new Stack<>();\n }","title":""},{"docid":"8f57e6ead3fce97870d17100dcb2208c","score":"0.5582919","text":"private TreeSet<NRoute> getSetOfNPathOfNNearestLinks(int GPSNodeIndex) {\r\n\r\n\t\t// store n nearest links here by creating path for each link\r\n\t\tTreeSet<NRoute> nRouteSet = new TreeSet<NRoute>();\r\n\r\n\t\t// current minimum found distance\r\n\t\t// double currentMinDistance = 0;\r\n\r\n\t\t// nRouteSize = nRouteSize *2;\r\n\r\n\t\tdouble arMinDis[] = new double[nRouteSize];\r\n\t\tmyOSMWayPart arMinWp[] = new myOSMWayPart[nRouteSize];\r\n\r\n\t\tfor (int i = 0; i < nRouteSize; i++) {\r\n\t\t\tarMinDis[i] = Double.MAX_VALUE;\r\n\t\t}\r\n\r\n\t\tint count = 0;\r\n\t\t// search nearest link\r\n\t\tmyOSMWay w;\r\n\t\tmyOSMWayPart wp;\r\n\t\tfor (int wi = 0; wi < myMap.ways.size(); wi++) {\r\n\r\n\t\t\tw = myMap.ways.get(wi);\r\n\r\n\t\t\tfor (int wpi = 0; wpi < w.WayParts.length; wpi++) {\r\n\r\n\t\t\t\twp = w.WayParts[wpi];\r\n\r\n\t\t\t\tdouble distance = Coordinates.getDistance(gpsTrace.getNode(GPSNodeIndex), wp);\r\n\r\n\t\t\t\tif (distance < arMinDis[nRouteSize - 1]) {\r\n\t\t\t\t\tcount++;\r\n\r\n\t\t\t\t\tarMinDis[nRouteSize - 1] = distance;\r\n\t\t\t\t\tarMinWp[nRouteSize - 1] = wp;\r\n\r\n\t\t\t\t\tfor (int i = nRouteSize - 1; i >= 1; i--) {\r\n\r\n\t\t\t\t\t\tif (arMinDis[i] < arMinDis[i - 1]) {\r\n\t\t\t\t\t\t\tdouble d = arMinDis[i];\r\n\t\t\t\t\t\t\tarMinDis[i] = arMinDis[i - 1];\r\n\t\t\t\t\t\t\tarMinDis[i - 1] = d;\r\n\r\n\t\t\t\t\t\t\tmyOSMWayPart wpx = arMinWp[i];\r\n\t\t\t\t\t\t\tarMinWp[i] = arMinWp[i - 1];\r\n\t\t\t\t\t\t\tarMinWp[i - 1] = wpx;\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tfor (int i = 0; i < count && i < nRouteSize; i++) {\r\n\t\t\tNRoute nRoute = new NRoute(gpsTrace);\r\n\t\t\tnRoute.addLink(arMinWp[i], GPSNodeIndex);\r\n\r\n\t\t\tnRouteSet.add(nRoute);\r\n\t\t}\r\n\r\n\t\t/*\r\n\t\t * // get n nearest links for (int i = 1; i <= nRouteSize; i++) {\r\n\t\t * \r\n\t\t * Logger.println(\"Starting run nr.\" + i + \" of \" + nRouteSize);\r\n\t\t * \r\n\t\t * // save minimum distance and street link during search progress\r\n\t\t * double minDistance = Double.MAX_VALUE; // StreetLink\r\n\t\t * nearestStreetLink = null; myOSMWayPart nearestWayPart = null;\r\n\t\t * \r\n\t\t * \r\n\t\t * // search nearest link myOSMWay w; myOSMWayPart wp; for (int wi=0; wi\r\n\t\t * < myMap.ways.size(); wi++) {\r\n\t\t * \r\n\t\t * w = myMap.ways.get(wi);\r\n\t\t * \r\n\t\t * for (int wpi=0; wpi < w.WayParts.length; wpi++) {\r\n\t\t * \r\n\t\t * wp = w.WayParts[wpi];\r\n\t\t * \r\n\t\t * // get distance to street link double distance =\r\n\t\t * Coordinates.getDistance(gpsTrace.getNode(GPSNodeIndex), wp);\r\n\t\t * \r\n\t\t * // check if link is in the run if ((distance < minDistance) &&\r\n\t\t * (distance > currentMinDistance)) { // save distance and street link\r\n\t\t * minDistance = distance; nearestWayPart = wp; } } }\r\n\t\t */\r\n\r\n\t\t/*\r\n\t\t * for (StreetLink streetLink : streetLinks) {\r\n\t\t * \r\n\t\t * // get distance to street link double distance =\r\n\t\t * Coordinates.getDistance(gpsTrace.getNode(GPSNodeIndex), streetLink);\r\n\t\t * \r\n\t\t * // check if link is in the run if ((distance < minDistance) &&\r\n\t\t * (distance > currentMinDistance)) { // save distance and street link\r\n\t\t * minDistance = distance; nearestStreetLink = streetLink; } }\r\n\t\t */\r\n\r\n\t\t/*\r\n\t\t * // create new path if nearest link was found if (nearestWayPart !=\r\n\t\t * null) {\r\n\t\t * \r\n\t\t * Logger.println(\"Found nearest link Nr.\" + i);\r\n\t\t * \r\n\t\t * // save new current minimum distance currentMinDistance =\r\n\t\t * minDistance;\r\n\t\t * \r\n\t\t * // create new path through adding nearest street link to new n route\r\n\t\t * container NRoute nRoute = new NRoute(gpsTrace);\r\n\t\t * nRoute.addLink(nearestWayPart, GPSNodeIndex);\r\n\t\t * \r\n\t\t * // add to tree set, gets automatically ordered by score\r\n\t\t * nRouteSet.add(nRoute); } else { Logger.println(\"No nearest link nr. \"\r\n\t\t * + i + \" found!\"); } }\r\n\t\t */\r\n\r\n\t\t// return tree set\r\n\t\treturn nRouteSet;\r\n\t}","title":""},{"docid":"362a109c6c87470e68695f0a4bfe14de","score":"0.5571647","text":"public int[] singleSourceDijkstra(StateVertex source){\n\t\tint [] dist = new int [getNumVertices()];\n\t\tPriorityQueue<PriorityVertex> queue = new PriorityQueue<PriorityVertex>(10, new PriorityVertexComparator()); //priority by distance\n\t\tArrayList<PriorityVertex> visited = new ArrayList<>();\n\t\tHashMap<StateVertex, Integer> vertexIds = assignIntIDToVertex();\n\t\tint srcID = vertexIds.get(source);\n\t\tdist[srcID] = 0;\n\t\tfor(int i=0; i<dist.length; i++){ \t\t//initialize dist: source = 0, others = infinity\n\t\t\tif(i!=srcID){\n\t\t\t\tdist[i] = Integer.MAX_VALUE;\n\t\t\t}\n\t\t}\n\t\t//add all vertices as PriorityVertex to queue\n\t\tfor (Map.Entry<StateVertex, Integer> entry : vertexIds.entrySet()) {\n\t\t\tStateVertex key = entry.getKey();\n\t\t\tInteger value = entry.getValue();\n\t\t\tqueue.add(new PriorityVertex(key, value.intValue(), dist[value.intValue()]));\n\t\t}\t\t\n\t\t//dijkstra\n\t\twhile(!queue.isEmpty()){\n\t\t\tPriorityVertex current = queue.poll();\n\t\t\tif(!visited.contains(current)){\n\t\t\t\tvisited.add(current);\n\t\t\t\tTreeSet<StateVertex> currentAdj = adjacencyList.get(current.getVertex());\n\t\t\t\tfor (StateVertex v : currentAdj) {\n\t\t\t\t\tint vId = vertexIds.get(v);\n\t\t\t\t\tint currentId = vertexIds.get(current.getVertex());\n\t\t\t\t\tif(dist[currentId]+1<dist[vId]){ //edge weight=1\n\t\t\t\t\t\tdist[vId] = dist[currentId]+1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t//update PrirotyVertex distance values in queue. updating in queue itself won't work. \n\t\t\t//so use a temp to copy everything, then update, clear old queue, then copy back from temp to old queue\n\t\t\tPriorityQueue<PriorityVertex> temp = new PriorityQueue<>(10, new PriorityVertexComparator());\n\t\t\ttemp.addAll(queue);\n\t\t\tfor (PriorityVertex pv : temp) {\n\t\t\t\tint id = vertexIds.get(pv.getVertex());\n\t\t\t\tpv.setDistance(dist[id]);\n\t\t\t}\n\t\t\tqueue.clear();\n\t\t\tqueue.addAll(temp);\n\t\t}\n\t\treturn dist;\n\t}","title":""},{"docid":"dfc36975600626991908ff7314724c7d","score":"0.5570134","text":"public static int[] Dijkstra(ArrayList<Node>[] graph, int startVertex) {\n int len = graph.length;\n int[] distArr = new int[len];\n Arrays.fill(distArr, max_val);\n\n PriorityQueue<Node> pq = new PriorityQueue<>();\n distArr[startVertex] = 0;\n pq.add(new Node(startVertex, distArr[startVertex]));\n while (!pq.isEmpty()) {\n Node node = pq.poll();\n int id = node.id;\n int w = node.dist;\n // reduce loop times\n if (w > distArr[id]) {\n continue;\n }\n for (Node neighbour : graph[id]) {\n if (w + neighbour.dist < distArr[neighbour.id]) {\n distArr[neighbour.id] = w + neighbour.dist;\n pq.add(new Node(neighbour.id, distArr[neighbour.id]));\n }\n }\n }\n\n return distArr;\n }","title":""},{"docid":"7077e96f410cad59c19056b9640e1d91","score":"0.5552254","text":"void BFS(int src, int dst) {\n\t\tboolean visited[] = new boolean[noOfVertices];\r\n\t\t\r\n\t\t// pred[i] array stores predecessor of\r\n // i and distance array stores distance of i\r\n // from src\r\n\r\n\t\tint dist[] = new int[noOfVertices];\r\n\r\n\t\tint pred[] = new int[noOfVertices];\r\n\r\n\t\tfor (int i = 0; i < noOfVertices; i++) {\r\n\r\n\t\t\tpred[i] = -1;\r\n\t\t}\r\n\r\n\t\t// Create a queue for BFS\r\n\t\tLinkedList<Integer> queue = new LinkedList<Integer>();\r\n\r\n\t\t// Mark the current node as visited and enqueue it\r\n\t\tvisited[src] = true;\r\n\t\tdist[src] = 0;\r\n\t\tqueue.add(src);\r\n\t\twhile (queue.size() != 0) {\r\n\t\t\t// Dequeue a vertex from queue and print it\r\n\t\t\tint s = queue.poll();\r\n\t\t\t System.out.print(s+\" \");\r\n\r\n\t\t\t// Get all adjacent vertices of the dequeued vertex s\r\n\t\t\t// If a adjacent has not been visited, then mark it\r\n\t\t\t// visited and enqueue it\r\n\t\t\tIterator<Integer> i = list[s].listIterator();\r\n\t\t\twhile (i.hasNext()) {\r\n\t\t\t\tint n = i.next();\r\n\t\t\t\tif (!visited[n]) {\r\n\t\t\t\t\tvisited[n] = true;\r\n\t\t\t\t\tdist[n] = dist[s] + 1;\r\n\t\t\t\t\tpred[n] = s;\r\n\t\t\t\t\tqueue.add(n);\r\n\t\t\t\t\tif (n == dst) {\r\n\t\t\t\t\t\tSystem.out.println(Arrays.toString(dist));\r\n\t\t\t\t\t\tSystem.out.println(Arrays.toString(pred));\r\n\t\t\t\t\t\tLinkedList<Integer> path = new LinkedList<Integer>();\r\n\t\t\t\t\t\tint crawl = dst;\r\n\t\t\t\t\t\tpath.add(crawl);\r\n\t\t\t\t\t\twhile (pred[crawl] != -1) {\r\n\t\t\t\t\t\t\tpath.add(pred[crawl]);\r\n\t\t\t\t\t\t\tcrawl = pred[crawl];\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t// Print distance\r\n\t\t\t\t\t\tSystem.out.println(\"Shortest path length is: \" + dist[dst]);\r\n\r\n\t\t\t\t\t\t// Print path\r\n\t\t\t\t\t\tSystem.out.println(\"Path is ::\");\r\n\t\t\t\t\t\tfor (int j = path.size() - 1; j >= 0; j--) {\r\n\t\t\t\t\t\t\tSystem.out.print(path.get(j) + \" \");\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\treturn;\r\n\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\r\n\t}","title":""},{"docid":"2d634b5f9c9166543910b6f6222a7234","score":"0.553761","text":"public GraphMatrixDirected() {\n \tthis.nodes = new ArrayList<Node>();\t\t/* Creazione della lista dei nodi vuota */\n \tthis.adjmatrix = new ArrayList<ArrayList<AdjacentMatrixElement>>();\t/* Creazione della matrice di adiacenza vuota */\n }","title":""},{"docid":"1794f707932de96fb51095e4f03cd7fe","score":"0.55304104","text":"public Graph() // constructor\r\n\t{\r\n\t\tvertexList = new Vertex[MAX_VERTS];\r\n\t\t//adjacency matrix\r\n\t\tadjMat = new int[MAX_VERTS][MAX_VERTS];\r\n\t\tnVerts = 0;\r\n\t\tfor(int j=0; j<MAX_VERTS; j++) // set adjacency\r\n\t\t\tfor(int k=0; k<MAX_VERTS; k++) // matrix to 0\r\n\t\t\t\tadjMat[j][k] = INFINITY;\r\n\t\tthePQ = new PriorityQ();\r\n\t}","title":""},{"docid":"77a5fd241035122f9cec4924cdabe477","score":"0.55235994","text":"@Override\n public double shortestPathDist(int src, int dest) {\n if (src==dest) return 0;\n\n int[] pointToKey = ((WGraph_DS)_graph).toKeyArray();// can improve by O(n)\n HashMap<Integer,Integer> keyToPoint = new HashMap<>();\n double[] distance = new double[pointToKey.length];\n boolean[] was = new boolean[pointToKey.length];\n int[] comeFromKey = new int[pointToKey.length];\n for (int i = 0; i < pointToKey.length; i++) { //initialisation\n keyToPoint.put(pointToKey[i],i);\n distance[i] = Double.MAX_VALUE;\n was[i]=false;\n comeFromKey[i]=-1;\n }\n for (node_info n : _graph.getV(dest) //for the dest\n ) {\n distance[keyToPoint.get(n.getKey())]=_graph.getEdge(dest,n.getKey());\n comeFromKey[keyToPoint.get(n.getKey())] = dest;\n }\n was[keyToPoint.get(dest)]=true;\n\n boolean thereIsChange = true;\n int nodePointer = keyToPoint.get(dest);\n\n while (thereIsChange) { //pass on all the graph\n thereIsChange=false;\n boolean first = true;\n for (int i = 0; i < pointToKey.length; i++) { //find the min distance and point to it\n if ((!was[i]&distance[i]<Integer.MAX_VALUE&first)|(!was[i]&distance[i]<distance[nodePointer]&!first)){\n nodePointer=i;\n first = false;\n thereIsChange = true; //there is work to be done\n }\n }\n\n for (node_info n : _graph.getV(pointToKey[nodePointer]) //neighbors pass\n ) {\n if (distance[keyToPoint.get(n.getKey())] > distance[nodePointer] + _graph.getEdge(n.getKey(), pointToKey[nodePointer])&!was[keyToPoint.get(n.getKey())]) {\n distance[keyToPoint.get(n.getKey())] = distance[nodePointer] + _graph.getEdge(n.getKey(), pointToKey[nodePointer]);\n comeFromKey[keyToPoint.get(n.getKey())] = pointToKey[nodePointer];\n }\n }\n was[nodePointer] = true;\n }\n if(distance[keyToPoint.get(src)]==Double.MAX_VALUE) return -1;\n return distance[keyToPoint.get(src)];\n }","title":""},{"docid":"3976e530126a17f4dd9c116eacc5f240","score":"0.5511838","text":"public static void main(String[] args) throws IOException {\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\t\tBufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));\n\t\t\n\t\tStringTokenizer st = new StringTokenizer(br.readLine());\t\t\n\t\t\n\t\tV = Integer.parseInt(st.nextToken()); // 정점의 갯수\n\t\tE = Integer.parseInt(st.nextToken()); // 도로의 갯수\n\t\t\n\t\tarr = new ArrayList[V+1];\n\t\tfor(int i=1; i<=V; i++) { //맥세권, 스세권 부모노드 생성하기위해 +2 \n\t\t\tarr[i] = new ArrayList<>();\n\t\t}\n\t\tmdist = new int[V+1]; //맥도날드용\n\t\tsdist = new int[V+1]; //스타벅스용\n\t\t\n\t\tfor(int i=0; i<E; i++) {\n\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\tint u = Integer.parseInt(st.nextToken()); //점1\n\t\t\tint v = Integer.parseInt(st.nextToken()); //점2\n\t\t\tint w = Integer.parseInt(st.nextToken()); //가중치\n\t\t\tarr[u].add(new Ed(v,w));\t\n\t\t\tarr[v].add(new Ed(u,w));\t\n\t\t}\t\t\n\t\t\n\t\t// 맥세권\n\t\tArrays.fill(mdist,Integer.MAX_VALUE);\n\t\tst = new StringTokenizer(br.readLine());\n\t\t\n\t\tM = Integer.parseInt(st.nextToken()); // 맥도날드수 \n\t\tMx = Integer.parseInt(st.nextToken()); // 맥세권 조건\t\t\n\n\t\tst = new StringTokenizer(br.readLine());\n\t\tfor(int i=0; i<M; i++) {\n\t\t\tint mm = Integer.parseInt(st.nextToken()); // 맥도날드 위치\n\t\t\tmdist[mm] = 0;\n\t\t\tqueue.add(new Ed(mm, 0));\t// 맥도날드의 위치를 시작점. 가중치 0\n\t\t\t\n\t\t}\n\t\tdijkstra(mdist);\n\n\t\t// 스세권\n\t\tArrays.fill(sdist,Integer.MAX_VALUE);\n\t\tst = new StringTokenizer(br.readLine());\n\t\t\n\t\tS = Integer.parseInt(st.nextToken()); // 스타벅스 수 \n\t\tSy = Integer.parseInt(st.nextToken()); // 스세권 조건\n\t\t\n\t\tst = new StringTokenizer(br.readLine());\n\t\tfor(int i=0; i<S; i++) {\n\t\t\tint ss = Integer.parseInt(st.nextToken()); // 스타벅스 위치\n\t\t\tsdist[ss] = 0;\n\t\t\tqueue.add(new Ed(ss, 0)); // 스타벅스의 위치를 시작점. 가중치 0\n\t\t}\n\t\tdijkstra(sdist);\n\t\t\n\t\tint ans = Integer.MAX_VALUE;\n for(int i=1; i<=V; i++) {\n if((mdist[i]>0 && mdist[i]<=Mx) && (sdist[i]>0 && sdist[i]<=Sy)) // dist수행항 결과가 스세권, 맥세권 조건보다는 작아야함.\n ans = Math.min(ans, mdist[i]+sdist[i]);\n }\n\n \n\n if(ans==Integer.MAX_VALUE)\n \tans = -1;\n\n bw.write(String.valueOf(ans));\n bw.flush();\n\t\tbw.close();\n\t\tbr.close();\n\n\t}","title":""},{"docid":"5a31029b8de394370996fba746d14304","score":"0.55074185","text":"public int[][] dijkstra(int source){\n int graphSize = this.nodes.size(); //Gets number of nodes in the graph for convenience\n int dist_prev[][] = new int[graphSize][2]; //Funky way to return both distance and previous node at the same time\n ArrayList<Node> unVisited = new ArrayList<Node>(); //Array of unvisited nodes that didn't have their minimum distance calculated yet\n\n for (int i = 0; i < graphSize; i++){ //For each Node in the graph\n dist_prev[i][0] = Integer.MAX_VALUE / 2; //Makes the distance stupidly high\n dist_prev[i][1] = -1; //Makes the previous Node be something impossible\n unVisited.add(this.nodes.get(i)); //Make all of them unvisited\n }\n\n dist_prev[source][0] = 0; //The only distance we know for sure is from the source to itself, 0 to be exact\n\n while (!unVisited.isEmpty()){ //While there are still Nodes distances to be calculated\n\n int min = 0; //The next 8 lines are a spaghetti I used to avoid making a method that returns the smallest distance, I probably should correct it someday\n for(int i = 0; i < unVisited.size(); i++){ //For each Node yet to be visited\n if(dist_prev[unVisited.get(i).id][0] <= dist_prev[unVisited.get(min).id][0]){ //Verify if this Node has the smallest distance\n min = i; //Of them all\n }\n }\n int minidx = unVisited.get(min).id; //Gets the real graph id from the Node we found to be the one in the unvisited to possess the smallest distance\n unVisited.remove(min); //Remove this guys (let's call him minidx, for convenience) from the unvisited because we already found it's smallest distance\n\n for (int i = 0; i < this.getNodeById(minidx).neighbours.size(); i++){ //For each neighbour in minidx\n Node aux = this.getNodeById(minidx).neighbours.get(i).end; //Did this in order to reduce typing\n if(unVisited.contains(aux)){ //If the neighbour is yet to be visited\n int maybeDist = this.getNodeById(minidx).neighbours.get(i).weight + dist_prev[minidx][0]; //calculates a possible smallest distance from source to the minidx neighbour\n if(maybeDist < dist_prev[aux.id][0] ){ //If the distance is in fact smaller than the one we have\n dist_prev[aux.id][0] = maybeDist; //Change it\n dist_prev[aux.id][1] = minidx; //And make minidx it's predecessor\n }\n }\n\n }\n\n }\n\n return dist_prev; //In the end it returns a int[a][b] were a is the id of the node you want to know the distance from the source, and b can be '0' for the distance valor or '1' for the predecessor id\n }","title":""},{"docid":"bef9a58145ff95b4a17ef3509ab9900e","score":"0.5505369","text":"private void blokujPetle()\n {\n\n Iterator<Edge> it=path.iterator();\n Edge start=it.next();\n Edge stop=start;\n int prev=start.getTo();\n while(it.hasNext())\n {\n Edge e=it.next();\n if(prev!=e.getFrom())\n {\n //dodany if\n if(distances[stop.getTo()][start.getFrom()]!=-1)\n {\n distances[stop.getTo()][start.getFrom()]=INF; //blokuje wszystkie spójne częsci poza ostatnią\n start=e;\n stop=e;\n prev=start.getTo();\n }\n }\n else\n {\n stop=e;\n prev=e.getTo();\n }\n \n }\n //dodany if zeby nie robilo niesk w miejscu ktorego nie ma\n if(distances[stop.getTo()][start.getFrom()]!=-1)\n distances[stop.getTo()][start.getFrom()]=INF;\n // zawsze ostatnia pętla zostaje do zablokowania jeżeli path spójny to całość jeżeli nie\n // to ostatnia część\n }","title":""},{"docid":"408258350e36d38f5cf570f33838eeb2","score":"0.5501265","text":"public int[] dijkstra1(int r,ArrayList<HashMap<Integer,Integer>> in){\r\n\tfinal int[] out=new int[in.size()],prev=new int[in.size()];\r\n\tTreeSet<Integer> pq=new TreeSet<Integer>(new Comparator<Integer>(){\r\n\t\tpublic int compare(Integer i0, Integer i1) {\r\n\t\t\tif(out[i0]!=out[i1])return Double.compare(out[i0],out[i1]);\r\n\t\t\treturn i0-i1;\r\n\t\t}\r\n\t});\r\n\tArrays.fill(out, Integer.MAX_VALUE/2);\r\n\tout[r]=0;\r\n\tprev[r]=-1;\r\n\tpq.add(r);\r\n\twhile(!pq.isEmpty()){\r\n\t\tint t=pq.first();\r\n\t\tpq.remove(pq.first());\r\n\t\tfor(int i:in.get(t).keySet())if(out[t]+in.get(t).get(i)<out[i]){\r\n\t\t\tpq.remove(i);\r\n\t\t\tout[i]=out[t]+in.get(t).get(i);\r\n\t\t\tprev[i]=t;\r\n\t\t\tpq.add(i);\r\n\t\t}\r\n\t}\r\n\treturn out;//note you can also return previous here if you like....or some combination of the two\r\n}","title":""},{"docid":"4fdec1a614aef433030ef518346357e3","score":"0.5496664","text":"public void spanningTree(){\n\t\tgraphArray = new LinkedList[al.size()];\n\t\tfor(int i=0;i<al.size();i++){\n\t\t\tgraphArray[i]= new LinkedList();\n\t\t}\n\t\tboolean [] visit = new boolean[al.size()]; \n\t\tvisit[0]=true;\n\t\tdouble minDistance = -1;\n\t\tint minVertax = -1;\n\t\tint correlativeVertax = -1;\n \n\t\tfor(int i=0;i<al.size()-1;i++){\n\t\t\tfor(int j=0;j<al.size();j++){\n\t\t\t\tif(!visit[j]){\n\t\t\t\t\tfor(int k=0;k<al.size();k++){\n\t\t\t\t\t\tif(visit[k]){\n\t\t\t\t\t\t\tif(minDistance>distanceMatrix[j][k]||minDistance==-1){\n\t\t\t\t\t\t\t\tminDistance=distanceMatrix[j][k];\n\t\t\t\t\t\t\t\tminVertax=j;\n\t\t\t\t\t\t\t\tcorrelativeVertax=k;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\tgraphArray[correlativeVertax].addFirst(al.get(minVertax));\n\t\tvisit[minVertax]=true;\n\t\tminDistance=-1;\n\t\tminVertax=-1;\n\t\tcorrelativeVertax = -1;\t\n\t\t}\n\t}","title":""},{"docid":"b5ca54449d0bcf7bedf30ef45f854520","score":"0.54731244","text":"public static void main(String[] args) {\n Scanner in = new Scanner(System.in);\n int N = in.nextInt();\n int M = in.nextInt();\n \n PriorityQueue<Node> pq = new PriorityQueue(new Comparator<Node>(){\n @Override\n public int compare(Node n1, Node n2){\n return n1.dist - n2.dist;\n }\n });\n \n ArrayList<int[]>[] graph = new ArrayList[N+1];\n HashMap<Integer, Node> map = new HashMap<Integer, Node>();\n \n for(int i=0; i<M; i++){\n int x = in.nextInt();\n int y = in.nextInt();\n int r = in.nextInt();\n int[] to = {y,r};\n int[] from = {x,r};\n if(graph[x] == null)\n graph[x] = new ArrayList<int[]>(); \n if(graph[y] == null)\n graph[y] = new ArrayList<int[]>();\n graph[x].add(to);\n graph[y].add(from);\n }\n \n int start = in.nextInt();\n Node sp = new Node();\n sp.position = start;\n sp.source = 0;\n sp.dist = 0;\n pq.add(sp);\n map.put(start, sp);\n \n for(int i=1; i<N+1; i++){\n if(i != start){\n Node n = new Node();\n n.position = i;\n pq.add(n);\n map.put(i, n);\n }\n }\n \n int sum = 0;\n \n HashSet<Integer> visited = new HashSet<Integer>();\n \n while(!pq.isEmpty()){\n Node node = pq.poll();\n visited.add(node.position);\n \n if(node.dist == Integer.MAX_VALUE)\n break;\n \n //System.out.println(\"polling: \" + node.position);\n sum+= node.dist;\n // System.out.println(\"Sum: \" + sum);\n for(int[] arr : graph[node.position]){\n //0 has node\n //1 has dist\n if(!map.containsKey(arr[0]))\n continue;\n Node n = map.get(arr[0]);\n int newDist = arr[1];\n if(newDist < n.dist && !visited.contains(n.position)){\n //System.out.println(\"Updating \" + n.position + \" to \" + newDist);\n n.dist = newDist;\n n.source = node.position;\n pq.remove(n);\n pq.add(n);\n }\n }\n }\n in.close();\n System.out.println(sum);\n }","title":""},{"docid":"5d6d8790b39bd5901b5b298d73a3d8f8","score":"0.5471593","text":"private DegreesOfSeparationBFS() { }","title":""},{"docid":"ed3604025ac00db31f283ce80a20b0c6","score":"0.54704565","text":"private List<DFSVertex> DFS(List<DFSVertex> vertices, int maxDistance, String licenceId) {\n\n List<DFSVertex> remoteVertexList = new ArrayList<>();\n List<Long> visited = new ArrayList<>(subgraph.numVertices());\n\n for (DFSVertex vertex : vertices) {\n if (visited.contains(vertex.vertex)) {\n continue;\n }\n\n\n Deque<DFSVertex> stack = new ArrayDeque<>();\n stack.push(vertex);\n\n parent:\n while (!stack.isEmpty()) {\n DFSVertex top = stack.peek();\n if (subgraph.getVertex(top.vertex).isRemote()) {\n //add remote\n if (top.currentDistance < maxDistance)\n remoteVertexList.add(top);\n }\n\n String attVal = (String) getCurrentInstance().getPropertiesForVertex(top.vertex).\n getValue(LICENSE_PLACE_ATT);\n visited.add(top.vertex);\n if (licenceId.equals(attVal)) {\n lastKnownLocation.put(getIteration(), top.vertex);\n logLocation(\"\" + top.vertex, licenceId, getCurrentInstance().getTimestampStart());\n if (vertex.currentDistance >= maxDistance) {\n return remoteVertexList;\n }\n }\n\n for (ITemplateEdge e : subgraph.getVertex(top.vertex).outEdges()) {\n\n ITemplateVertex sink = e.getSink(subgraph.getVertex(top.vertex));\n Float distance = (Float) getCurrentInstance().getPropertiesForEdge(e.getId()).\n getValue(DISTANCE_ATT);\n\n DFSVertex w = new DFSVertex();\n w.currentDistance = top.currentDistance + distance;\n w.vertex = sink.getId();\n\n if (visited.contains(sink.getId())) {\n continue;\n }\n\n if (w.currentDistance < maxDistance) {\n stack.push(w);\n }\n\n continue parent;\n\n }\n stack.pop();\n }\n\n\n\n }\n\n return remoteVertexList;\n }","title":""},{"docid":"4c19a7fc76b5c774661619a4728a812c","score":"0.54565763","text":"public void createedge(){\n\t\t \n\t\t addLane(\"path1\", 0, 1, 626);\n\t\t addLane(\"path2\", 0, 5, 702);\n\t\t addLane(\"path3\", 1, 3, 358);\n\t\t addLane(\"path4\", 1, 5, 534);\n\t\t addLane(\"path5\", 3, 2, 35);\n\t\t addLane(\"path6\", 3, 5, 577);\n\t\t addLane(\"path7\", 2, 5, 570);\n\t\t addLane(\"path8\", 2, 4, 324);\n\t\t addLane(\"path9\", 4, 5, 510);\n\t\t addLane(\"path10\", 4, 6, 585);\n\t\t addLane(\"path11\", 4, 7, 870);\n\t\t addLane(\"path12\", 5, 6, 374);\n\t\t addLane(\"path13\", 6, 7, 667);\n\t\t addLane(\"path14\", 6, 9, 585);\n\t\t addLane(\"path15\", 6, 10,706);\n\t\t addLane(\"path16\", 7, 8, 226);\n\t\t addLane(\"path17\", 7, 9, 461);\n\t\t addLane(\"path18\", 7, 12, 423);\n\t\t addLane(\"path19\", 7, 11, 545);\n\t\t addLane(\"path20\", 8, 12, 483);\n\t\t addLane(\"path21\", 8, 15, 704);\n\t\t addLane(\"path22\", 9, 11, 240);\n\t\t addLane(\"path23\", 9, 12, 372);\n\t\t addLane(\"path24\", 9, 10, 420);\n\t\t addLane(\"path25\", 9, 13, 444);\n\t\t addLane(\"path26\", 10, 11, 466);\n\t\t addLane(\"path27\", 10, 13, 290);\n\t\t addLane(\"path28\", 10, 14, 509);\n\t\t addLane(\"path29\", 11, 12, 244);\n\t\t addLane(\"path30\", 11, 13, 326);\n\t\t addLane(\"path31\", 11, 14, 235);\n\t\t addLane(\"path32\", 11, 15, 470);\n\t\t addLane(\"path33\", 12, 14, 388);\n\t\t addLane(\"path34\", 12, 15, 335);\n\t\t addLane(\"path35\", 12, 18,689);\n\t\t addLane(\"path36\", 13, 14, 226);\n\t\t addLane(\"path37\", 13, 9, 461);\n\t\t addLane(\"path38\", 13, 12, 423);\n\t\t addLane(\"path39\", 14, 15, 417);\n\t\t addLane(\"path40\", 14, 16, 158);\n\t\t addLane(\"path41\", 14, 17, 427);\n\t\t addLane(\"path42\", 14, 19, 329);\n\t\t addLane(\"path43\", 15, 18, 408);\n\t\t addLane(\"path44\", 15, 16, 435);\n\t\t addLane(\"path45\", 15, 17, 228);\n\t\t addLane(\"path46\", 16, 19, 172);\n\t\t addLane(\"path47\", 16, 20, 275);\n\t\t addLane(\"path48\", 16, 17, 348);\n\t\t addLane(\"path49\", 17, 19, 363);\n\t\t addLane(\"path50\", 17, 20, 333);\n\t\t addLane(\"path51\", 17, 18, 465);\n\t\t addLane(\"path52\", 19, 20, 126);\n\t\t addLane(\"path53\", 19, 21, 238);\n\t\t addLane(\"path54\", 20, 21, 153);\n\t\t addLane(\"path55\", 20, 22, 200);\n\t\t addLane(\"path56\", 21, 22, 54);\n\t\t addLane(\"path57\", 21, 23, 233);\n\t\t addLane(\"path58\", 22, 23, 192);\n\t\t \n\t\t \n\t }","title":""},{"docid":"3829d703e1d415f5885f6675dfaa43af","score":"0.54418886","text":"private ArrayList<Point> astar(Point goal) {\n HashMap<Point,Integer> openSet = new HashMap<Point,Integer>();\n HashMap<Point,Integer> g_score = new HashMap<Point,Integer>();\n HashMap<Point,Point> came_from = new HashMap<Point,Point>();\n HashMap<Point,Orientation> coming_from = new HashMap<Point,Orientation>();\n ArrayList<Point> closedSet = new ArrayList<Point>();\n \n Point start = new Point(2,1);\n coming_from.put(start,GhostOrientation);\n\n g_score.put(start,0); // start g score = 0;\n openSet.put(start,heuristic(start,goal)); // 0 + heuristic;\n\n while(!openSet.isEmpty()) {\n //choose the lowest cost node\n Point current = lowest_cost_node(openSet);\n\n \tfor(Entry<Point,Integer> item : openSet.entrySet()) {\n \t\tSystem.out.println(item.getKey().y+\", \"+item.getKey().x + \": \"+item.getValue());\n \t}\n \tSystem.out.println(\">\"+current.y+\", \"+current.x+\": \"+openSet.get(current));\n \tSystem.out.println();\n\n if(current.equals(goal))\n return reconstruct_path(came_from,came_from.get(goal));\n\n openSet.remove(current);\n ArrayList<Point> neighbours = neighbour_nodes(current,coming_from.get(current));\n\n if(neighbours.size() > 0)\n closedSet.add(current);\n\n for(Point neighbour : neighbours) {\n if(closedSet.contains(neighbour))\n break;\n\n int temp_g_score = g_score.get(current) + 1; // add one distance between the node\n\n if (!g_score.containsKey(neighbour) || temp_g_score < g_score.get(neighbour)) {\n\n came_from.put(neighbour,current);\n coming_from.put(neighbour,getOrientationFrom(neighbour,current));\n g_score.put(neighbour,temp_g_score);\n\n if(!openSet.containsKey(neighbour)) {\n int temp_f_val = g_score.get(neighbour) + heuristic(neighbour, goal);\n openSet.put(neighbour,temp_f_val);\n }\n\n }\n }\n }\n\n return new ArrayList<Point>();\n }","title":""},{"docid":"c00a2a5428a8f914b6acb0de862477ed","score":"0.54030985","text":"public UndirectedGraph() {\n\t\t// TODO Auto-generated constructor stub\n\t\tthis.adJList = new HashMap<>();\n\t}","title":""},{"docid":"6123a959a19e030e278ba2f26196982d","score":"0.5401392","text":"public static int findCheapestPath(List<List<String>> edges) {\r\n weightmin = 10;\r\n // Write your code here\r\n HashMap<String, Node> map = new HashMap<>();\r\n for (List<String> edge: edges) {\r\n Node a = map.get(edge.get(0)); // Start node;\r\n if (a == null) {\r\n a = new Node(edge.get(0));\r\n map.put(edge.get(0), a);\r\n }\r\n Node b = map.get(edge.get(1)); // End node;\r\n if (b == null) {\r\n b = new Node(edge.get(1));\r\n map.put(edge.get(1), b);\r\n }\r\n // Add edge\r\n a.add(new NodeEdge(b, Integer.parseInt(edge.get(2)))); \r\n }\r\n \r\n // TODO: Find path from A to H ...\r\n return dfs(map.get(\"A\"), map.get(\"H\"));\r\n\r\n }","title":""},{"docid":"1b32ab4baff83d4471bd8493b03c3b51","score":"0.5400709","text":"private static void dijkstra(List<Edge> edges, int startingNode) {\r\n\r\n\t\tMap<Integer, List<Edge>> graph = buildGraph(edges);\r\n\t\t// use reverse order priority queue\r\n\t\tPriorityQueue<Edge> priorityQueue = new PriorityQueue<Edge>();\r\n\r\n\t\tboolean[] visitedNode = new boolean[graph.size()];\r\n\t\tint[] parent = new int[graph.size()];\r\n\t\tint[] distance = new int[graph.size()];\r\n\t\t// initialize the parent and distance array\r\n\t\tfor (int i = 0; i < distance.length; i++) {\r\n\t\t\tdistance[i] = Integer.MAX_VALUE;\r\n\t\t\tparent[i] = -1;\r\n\t\t}\r\n\t\tvisitedNode[startingNode] = true;\r\n\t\tparent[startingNode] = startingNode;\r\n\t\tdistance[startingNode] = 0;\r\n\r\n\t\tdo {\r\n\t\t\t// TODO\r\n\t\t\tList<Edge> childOfStartingtNode = graph.get(startingNode);\r\n\t\t\tfor (Edge edge : childOfStartingtNode) {\r\n\t\t\t\tif (!edge.isConnected()) {\r\n\r\n\t\t\t\t\tpriorityQueue.add(edge);\r\n\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tEdge currentEdge = priorityQueue.poll();\r\n\t\t\tcurrentEdge.setConnected(true);\r\n\t\t\tif (!visitedNode[currentEdge.getEndNode()]) {\r\n\t\t\t\tvisitedNode[currentEdge.getEndNode()] = true;\r\n\t\t\t\tparent[currentEdge.getEndNode()] = currentEdge.getStartNode();\r\n\r\n\t\t\t\tint newDistance = distance[currentEdge.getStartNode()]\r\n\t\t\t\t\t\t+ currentEdge.getWightl();\r\n\r\n\t\t\t\tif (distance[currentEdge.getEndNode()] > newDistance) {\r\n\t\t\t\t\tdistance[currentEdge.getEndNode()] = newDistance;\r\n\t\t\t\t}\r\n\t\t\t\tstartingNode = currentEdge.getEndNode();\r\n\t\t\t}\r\n\r\n\t\t} while (priorityQueue.size() > 0);\r\n\r\n\t\tfor (int i = 0; i < graph.size(); i++) {\r\n\t\t\tSystem.out.println(\"Node: \" + i);\r\n\t\t\tSystem.out.println(\"distance: \" + distance[i]);\r\n\t\t\tSystem.out.println(\"Parent: \" + parent[i]);\r\n\t\t\tSystem.out.println();\r\n\t\t}\r\n\t}","title":""},{"docid":"580b7551c2b57336d78bc1728ac9ef81","score":"0.5391323","text":"private HashMap<Integer,Integer> short_path (int src,int dest)\n{ HashMap<Integer,Integer> node_map = new HashMap<Integer,Integer>();\n node_data temp_node;\n // a list that function as a queue\n LinkedList<node_data> list_of_nodes = new LinkedList<node_data>();\n // if the dest and src are equal return just one node in the collection\n if(src==dest)\n { graph1.getNode(src).setTag(0);\n node_map.put(src,-1);\n return node_map;}\n // rest every node node in the graph , tag to -1 and information to white\n for (node_data current_node : graph1.getV()) {\n current_node.setInfo(\"white\");\n current_node.setTag(-1);\n }// sets the src node and insert it to the queue and the collection\n graph1.getNode(src).setInfo(\"grey\");\n graph1.getNode(src).setTag(0);\n list_of_nodes.add(graph1.getNode(src));\n node_map.put(src,-1);\n // run until sets every node in the path\n while(!list_of_nodes.isEmpty())\n {\n // get the first node in queue\n temp_node = list_of_nodes.getFirst();\n list_of_nodes.remove(list_of_nodes.getFirst());\n // check if the node have neighbors if it had go over them and sets them\n if(temp_node.getNi().size()>0) {\n // go over the node neighbors\n for (node_data current_node : temp_node.getNi()) {\n // if not been altered, sets his info to grey and his tag to previous tag +1\n if (current_node.getInfo().equals(\"white\")) {\n current_node.setInfo(\"grey\");\n current_node.setTag(temp_node.getTag() + 1);\n // insert the node to the collection\n node_map.put(current_node.getKey(), temp_node.getKey());\n // if its reach the dest node stop and return the collection\n if (current_node.equals(graph1.getNode(dest))) {\n return node_map;\n }\n // add the node to the queue\n list_of_nodes.add(current_node);\n }\n }\n }\n temp_node.setInfo(\"black\");\n }\n return node_map;\n}","title":""},{"docid":"8d488f42e1ad6e91aafacb4cd585a2cc","score":"0.5383921","text":"public static void main(String args[]) throws IOException{\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n int max = Integer.MAX_VALUE;\n \n StringTokenizer st = new StringTokenizer(br.readLine(),\" \");\n \n int m = Integer.parseInt(st.nextToken());\n int n = Integer.parseInt(st.nextToken());\n int arr[][] = new int[m+1][n+1];\n int dist[][] = new int[m+1][n+1];\n // int temp;\n \n for(int i = 1; i <= m; i++){\n st =new StringTokenizer(br.readLine(),\" \");\n for(int j = 1; j <= n; j++){\n \n arr[i][j] = Integer.parseInt(st.nextToken());\n dist[i][j] = max;\n \n }\n }\n \n dist[1][1] = arr[1][1];\n \n \n if(arr[1][1]==-1)\n System.out.println(\"-1\");\n \n else if(arr[m][n]==-1)\n System.out.println(\"-1\");\n \n else{\n \n \n Graph temp;\n int cur_row;\n int cur_col;\n int distance;\n int next;\n int temp_weight;\n \n \n PriorityQueue<Graph> queue = new PriorityQueue<>(new Comparator<Graph>() {\n public int compare(Graph g1, Graph g2) {\n if(g1.weight <= g2.weight) {\n return -1;\n }else {\n return 1;\n }\n }\n });\n \n \n queue.add(new Graph(1,1,arr[1][1]));\n \n while(!queue.isEmpty()){\n temp = queue.poll();\n cur_row = temp.row;\n cur_col = temp.column;\n distance = temp.weight;\n \n //System.out.println(cur_row+\" \"+cur_col);\n \n \n if(dist[cur_row][cur_col] < distance) //업데이트 전의 값이므로 스킵\n continue;\n \n //System.out.println(temp.node+\" \"+dist[temp.node]);\n \n if(cur_row+1 >=1 && cur_row+1<=m){\n temp_weight = arr[cur_row+1][cur_col];\n if(temp_weight!=-1){\n if(dist[cur_row+1][cur_col] > temp_weight+distance){\n dist[cur_row+1][cur_col] = temp_weight+distance;\n queue.offer(new Graph(cur_row+1,cur_col,temp_weight+distance));\n }\n \n }\n }\n \n if(cur_col+1 >=1 && cur_col+1<=n){\n temp_weight = arr[cur_row][cur_col+1];\n if(temp_weight!=-1){\n if(dist[cur_row][cur_col+1] > temp_weight+distance){\n dist[cur_row][cur_col+1] = temp_weight+distance;\n queue.offer(new Graph(cur_row,cur_col+1,temp_weight+distance));\n }\n \n }\n }\n \n if(cur_row-1 >=1 && cur_row-1<=m){\n temp_weight = arr[cur_row-1][cur_col];\n if(temp_weight!=-1){\n if(dist[cur_row-1][cur_col] > temp_weight+distance){\n dist[cur_row-1][cur_col] = temp_weight+distance;\n queue.offer(new Graph(cur_row-1,cur_col,temp_weight+distance));\n }\n \n }\n }\n \n if(cur_col-1 >=1 && cur_col-1<=n){\n temp_weight = arr[cur_row][cur_col-1];\n if(temp_weight!=-1){\n if(dist[cur_row][cur_col-1] > temp_weight+distance){\n dist[cur_row][cur_col-1] = temp_weight+distance;\n queue.offer(new Graph(cur_row,cur_col-1,temp_weight+distance));\n }\n \n }\n }\n \n \n \n \n }\n if(dist[m][n]!=max)\n System.out.println(dist[m][n]);\n else\n System.out.println(\"-1\");\n \n }\n \n \n }","title":""},{"docid":"27d71d2adcee6749ae9baa631637f4d6","score":"0.53817445","text":"public Node(){\r\n this.parent = null;\r\n this.coordinates = new Point();\r\n this.depth = 0;\r\n this.valid_moves = new ArrayList<Point>();\r\n }","title":""},{"docid":"1dc5133e59de3712238186aba32d041d","score":"0.53814673","text":"public Graph(int numVertex){\n this.numVertex = numVertex; \n this.adj = new LinkedList[numVertex];\n \n // initialize adjucent nodes\n for(int i = 0 ; i < adj.length; i++){\n adj[i] = new LinkedList();\n }\n }","title":""},{"docid":"8f1a14a4695d9d02a1e0ec3f312c60c5","score":"0.537513","text":"public Dist[] dijkstra(int source){\n Dist[] result = new Dist[nodeCount +1];\n Dist[] minHeap = new Dist[nodeCount + 1];\n result[source] = new Dist(source, 0);\n int size = 0;\n for (int i = 0; i < result.length ; i++) {\n if (i != source) {\n result[i] = new Dist(i, MAXWEIGHT);\n }\n insert(minHeap, result[i], i);\n size++;\n }\n HashSet<Integer> visitedNodes = new HashSet<>();\n while (size > 0){\n Dist curr = extractMin(minHeap, size);\n visitedNodes.add(curr.getNodeNumber());\n size--;\n int vertexNum = curr.getNodeNumber();\n if (vertexNum == 0){\n continue;\n }\n\n int currDist = curr.getDist();\n HashMap<Integer, Integer> adjVertices = nodeArr[vertexNum].getEdges();\n\n for (Map.Entry<Integer, Integer> ent : adjVertices.entrySet()){\n\n int vertexToAdd = ent.getKey(); //number of the vertex connected to curr node\n //checking if the node is already visited\n if (visitedNodes.contains(vertexToAdd)){\n continue;\n }\n int temp = ent.getValue(); //distance from source to that vertex\n int newDist = currDist + temp;\n if (newDist < result[vertexToAdd].getDist()){\n result[vertexToAdd].updateDist(newDist);\n for (int i = 0; i < minHeap.length; i++) {\n if (minHeap[i].getNodeNumber() == vertexToAdd){\n minHeap[i].updateDist(newDist);\n while (i > 0){\n if (minHeap[i].getDist() < minHeap[i-1].getDist()){\n swap(minHeap, i, i-1);\n }\n i--;\n }\n break;\n }\n\n\n }\n }\n }\n }\n return result;\n }","title":""},{"docid":"8c1cd3b3f93769793955d1e7af52645a","score":"0.5371602","text":"Graph(ArrayList<String> vertex, ArrayList<Link> edge){\n this.v = vertex;\n this.e = edge;\n }","title":""},{"docid":"90db7cdcd86207a39ad94a502728422d","score":"0.5370992","text":"void dijkstraWithoutPath(final int source) {\r\n dijkstra(source, false);\r\n }","title":""},{"docid":"90edb4977bfc124e6e7e83010a3eca85","score":"0.53702426","text":"public static void main(String[] args) {\n int graph[][] = new int[][] { { 0, 4, 0, 0, 0, 0, 0, 8, 0 }, \n { 4, 0, 8, 0, 0, 0, 0, 11, 0 }, \n { 0, 8, 0, 7, 0, 4, 0, 0, 2 }, \n { 0, 0, 7, 0, 9, 14, 0, 0, 0 }, \n { 0, 0, 0, 9, 0, 10, 0, 0, 0 }, \n { 0, 0, 4, 14, 10, 0, 2, 0, 0 }, \n { 0, 0, 0, 0, 0, 2, 0, 1, 6 }, \n { 8, 11, 0, 0, 0, 0, 1, 0, 7 }, \n { 0, 0, 2, 0, 0, 0, 6, 7, 0 } }; \n ShortestPath t = new ShortestPath(); \n t.dijkstra(graph, 0, 9); \n\t}","title":""},{"docid":"3b5a0599423bee7b4f36e1e3364d5a33","score":"0.535515","text":"public Graph(Integer nrNoduri) {\n this.nrNoduri = nrNoduri;\n listeAdiacente = new LinkedList[nrNoduri];\n for (int i = 0; i < nrNoduri; i++)\n listeAdiacente[i] = new LinkedList();\n }","title":""},{"docid":"c2adf0068485501433c4a076a2b77345","score":"0.5353484","text":"public Node() {\n connectedTo = new ArrayList<>();\n lowestConn = new ArrayList<>();\n }","title":""},{"docid":"9d66f404d36ff33b7414487ce7f54d80","score":"0.53462803","text":"@Override\n public List<node_data> shortestPath(int src, int dest) {\n int key_temp;\n LinkedList<node_data> path_list1,path_list2;\n path_list1=new LinkedList<node_data>();\n path_list2=new LinkedList<node_data>();\n HashMap<Integer,Integer> node_map;\n // if graph null or empty return empty list\n if(graph1==null)\n return path_list2;\n if(graph1.nodeSize()==0)\n return path_list2;\n // if one of the vertex not in the graph return empty list\n if(graph1.getNode(src)==null||graph1.getNode(dest)== null)\n return path_list2;\n // activates inner function to set tags and create a collection\n node_map = short_path(src, dest);\n key_temp = dest;\n // if its a path between the vertices create a list\n if(graph1.getNode(dest).getTag()!=-1) {\n // create a list by the collection the list will be from dest to src\n while (node_map.get(key_temp) != -1) {\n path_list1.add(graph1.getNode(key_temp));\n key_temp = node_map.get(key_temp);\n }\n path_list1.add(graph1.getNode(key_temp));\n // reversed the list so it will be from src to dest\n while (!path_list1.isEmpty()) {\n path_list2.add(path_list1.getLast());\n path_list1.remove(path_list1.getLast());\n }\n }\n return path_list2;\n }","title":""},{"docid":"9473c453173e004c9693e706bc77dff0","score":"0.53446263","text":"Flock() {\n boids = new ArrayList(); // Initialize the arraylist\n }","title":""},{"docid":"3d17d70de473933c719303f2a0e3457f","score":"0.53424555","text":"int[] getPathArray() {\r\n if (isSPDone) {\r\n return parent;\r\n } else {\r\n throw new UnsupportedOperationException(\r\n \"Cannot get distance of nodes before performing any shortest path algorithm.\");\r\n }\r\n }","title":""},{"docid":"2627300b389b2a78bb1a433c92cb9001","score":"0.53373253","text":"public double ACO_Engine(){\n double answer =Double.MAX_VALUE; //stores the shortest path solution\n for(int i=0;i<100000;i++){ //for a predefined number of iterations\n ants = new ArrayList<Ant>(); //each time create new ants for better running time\n createAnts(); //create new ants so that they are given new starting cities\n int antsCompletedTour = 0; //stores the number of ants that completed a tour\n while(antsCompletedTour < numberOfAnts){ //while not all ants completed the tour\n for(int j=0;j<numberOfAnts;j++){ //move each ant to a new city\n if(!ants.get(j).completedTour(g)){\n moveAnt(ants.get(j));\n }else{\n antsCompletedTour++;\n }\n }\n }\n double smallestDistance = Double.MAX_VALUE; //stores the smallest distance found in some iteration\n int bestAntIndex = -1; //stores the index of the ant that found the shortest path in some iteration\n for(int j=0;j<numberOfAnts;j++){\n if(ants.get(j).getRouteLength()<smallestDistance){ // get smallest distance in current iteration\n bestAntIndex = j; //store it's index\n smallestDistance = ants.get(j).getRouteLength(); //store smallest distance\n }\n }\n if(smallestDistance<answer){ //if smallest distance in current iteration is better than global update global\n answer = smallestDistance;\n }\n System.out.println(\"iteration \"+i+\"smallest distance : \"+answer); //jew smallest disntace\n for(int j=0;j<ants.get(bestAntIndex).route.visitedCities.size()-1;j++){\n //globally update the pheromone levels of edges used by the best any\n int currentCityIndex = ants.get(bestAntIndex).route.visitedCities.get(j).getID()-1;\n int nextCityIndex = ants.get(bestAntIndex).route.visitedCities.get(j+1).getID()-1;\n globalPheromoneUpdate(currentCityIndex,nextCityIndex,ants.get(bestAntIndex).getRouteLength());\n }\n //update the pheromone level from the last city to the starting city (to go back)\n int currentCityIndex = ants.get(bestAntIndex).route.visitedCities.get(\n ants.get(bestAntIndex).route.visitedCities.size()-1).getID()-1;\n int nextCityIndex = ants.get(bestAntIndex).route.visitedCities.get(0).getID()-1;\n globalPheromoneUpdate(currentCityIndex,nextCityIndex,ants.get(bestAntIndex).getRouteLength());\n }\n return answer;\n }","title":""},{"docid":"3e8240e5dea515eaeecc9ddfdfbd5fb5","score":"0.53336","text":"public DjikstraBinaryHeap(String file)\n\t{\n\t\t// Read the sample text file\n\t\ttry {\n\t\t\t// Open the file to read\n\t\t\tFileInputStream fstream = new FileInputStream(file);\n\t\t\t\n\t\t\t// Get the object of the DataInputStream\n\t\t\tDataInputStream in = new DataInputStream(fstream);\n\t\t\tBufferedReader br = new BufferedReader (new InputStreamReader(in));\n\t\t\t\n\t\t\t// Read the initial two numbers from the first string atop each file\n\t\t\tScanner primer = new Scanner(br.readLine()).useDelimiter(\"\\\\s*\\\\w+=\");\n\t\t\tthis.vertices = Integer.parseInt(primer.next());\n\t\t\tthis.edges = Integer.parseInt(primer.next());\n\t\t\tprimer.close();\n\t\t\t\t\n\t\t\t// Setup dist[i][j] matrix\n\t\t//\tVector<Integer> iVec = new Vector<Integer>(this.vertices);\n\t\t\tthis.dist = new int[this.vertices][this.vertices];\n\t\t\tfor (int i=0; i < this.vertices; i++) {\n\t\t\t\tfor (int j=0; j < this.vertices; j++) {\n\t\t\t\t\tthis.dist[i][j] = 0;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\t// Read File Line by Line\n\t\t\tString strLine;\n\t\t\tint sourceVertex = 0;\n\t\t\twhile ((strLine = br.readLine()) != null) {\n\t\t\t\tif (!strLine.isEmpty()) {\n\t\t\t\t\tString[] tokens = strLine.trim().split(\"[\\\\s]+\");\n\t\t\t\t\tswitch (tokens.length) {\n\t\t\t\t\tcase 1:\n\t\t\t\t\t\tsourceVertex = Integer.parseInt(tokens[0]);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 2:\n\t\t\t\t\t\tthis.dist[sourceVertex][Integer.parseInt(tokens[0])] = Integer.parseInt(tokens[1]);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\tSystem.out.println(\"[Warning] Number of digits > 2\");\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t} catch(Exception e) { // catch exception if any\n\t\t\tSystem.err.println(\"Error: \" + e.getMessage());\n\t\t}\n\t}","title":""},{"docid":"0733bc1237a826951d0e76074e1a3eb6","score":"0.5330774","text":"public ArrayList()\n\t{\n\t\tlist = new Node[20000];\n\t\tlength = 0;\n\t}","title":""},{"docid":"6f3a88edd0533f4f13b3903d5c209aea","score":"0.53235936","text":"public Algorithm(){ \r\n this.listNodes = new ArrayList<>();\r\n this.listEdges = new ArrayList<>();\r\n this.r = null;\r\n }","title":""},{"docid":"6d40ed0ded4e3a4fc93a670af3caf16b","score":"0.53103554","text":"public LinkedList<Graph.Vertex> getDiameter(ArrayList<Graph.Vertex> bfs){\r\n\t\tLinkedList<Graph.Vertex> result = new LinkedList<>();\r\n\t\tGraph.Vertex parent = bfs.get(bfs.size()-1);\r\n\t\twhile (parent != null) {\r\n\t\t\tresult.add(parent);\r\n\t\t\tparent = this.bfs.getParent(parent);\r\n\t\t}\r\n\t\treturn result;\r\n\t}","title":""},{"docid":"b2e536b769b8eb610b0d8e2b76c67071","score":"0.53068453","text":"public List getDirections_LeastTransfer(String startStationName, String endStationName)//求换乘次数最少的路径\n {\n\t\tif(!this.hasStation(startStationName) || !this.hasStation(endStationName))\n\t\t{\n\t\t\tthrow new RuntimeException(\"Stations entered do not exist on this subway.\");\n\t\t}\n\n //This method is based on a well-known bit of code called Dijkstra's algorithm, which figures out the shortest path between two nodes on a graph.\n\t\tStation start = new Station(startStationName);\n\t\tStation end = new Station(endStationName);\n\t\tList finalRoute = new LinkedList();\n\t\tList route = new LinkedList(); //Record searched route\n\t\tint transferTime= 100; \n\t\tList startList = new LinkedList();\n\t\tstartList.add(start);\n\t\troute.add(startList);\n\t\t\n\t\twhile(!route.isEmpty()){\n\t\t\tList updateRoute = new LinkedList();\n\t\t\tfor (Iterator i = route.iterator(); i.hasNext();){\n\t\t\t\tList currentRoute = (List)i.next();\n\t\t\t\tStation lastStation = (Station)currentRoute.get(currentRoute.size()-1);\n\t\t\t\tList neighbors = (List)network.get(lastStation.getName());\n\t\t\t\tfor (Iterator j = neighbors.iterator(); j.hasNext();){\n\t\t\t\t\tStation station = (Station)j.next();\n\t\t\t\t\tList newRoute = new LinkedList(currentRoute);\n\t\t\t\t\tif(!newRoute.contains(station)){\n\t\t\t\t\t\tnewRoute.add(station);\n\t\t\t\t\t\tif(newRoute.contains(end)){\n\t\t\t\t\t\t\tint currentTransfer = transferTimes(newRoute);\n\t\t\t\t\t\t\tif(currentTransfer < transferTime){\n\t\t\t\t\t\t\t\ttransferTime = currentTransfer;\n\t\t\t\t\t\t\t\tfinalRoute = new LinkedList(newRoute);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse{\n\t\t\t\t\t\t\tint currentTransfer = transferTimes(newRoute);\n\t\t\t\t\t\t\tif(currentTransfer < transferTime){\n\t\t\t\t\t\t\t\tupdateRoute.add(newRoute);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\t\n\t\t\t\t}\n\t\t\t}\n\t\t\troute = new LinkedList(updateRoute);\n\t\t}\n\t\t\n\t\t//We've found the path by now.\n\t\tStation keyStation = end;\n\t\tStation station;\n\t\t//Once we've got a path, we just \"unwind\" the path, and create a List of connections to get from the starting station to the destination station.\n\t\t\tfor (int i = finalRoute.size()-1; i>=0;)\n\t\t\t{\n\t\t\t\tstation = (Station)finalRoute.get(i);\n\t\t\t\twhile(getConnection(keyStation, station) == null)\n\t\t\t\t{\n\t\t\t\t\ti--;\n\t\t\t\t\tstation = (Station)finalRoute.get(i);\n\t\t\t\t}\n\t\t\t\troute.add(0, getConnection(station, keyStation));\n\t\t\t\tkeyStation = station;\n\t\t\t\ti--;\n\t\t\t}\n\n\t\treturn route;\n\t}","title":""},{"docid":"b30f354756c8ec2adc0fc875d8d2dcfc","score":"0.53020173","text":"public void computeDijkstra() {\n\t\t\n\t\treferenceDjk = new Dijkstra(Dijkstra.Element.NODE, \"referenceDjk\",\"weight\");\n\t\treferenceDjk.init(graph);\n\t\treferenceDjk.setSource(graph.getNode(referenceNodeId));\n\t\treferenceDjk.compute();\n\t\t\n\t\tlogger.info(\"computing paths from each induction loop...\");\n\t\tfor (Loop loop : loops) {\n\t\t\tDijkstra djk = new Dijkstra(Dijkstra.Element.NODE, loop.getEdge(),\"weight\");\n\t\t\tdjk.init(graph);\n\t\t\tdjk.setSource(graph.getNode(loop.getEdge()));\n\t\t\tdjk.compute();\n\t\t\tloop.setDijkstra(loop.getEdge());\n\t\t}\n\n\t\tArrayList<String> zonesToRemove = new ArrayList<String>();\n\t\t\n\t\tlogger.info(\"computing from residential zones to a referenceNode... \");\n\t\tzonesToRemove.addAll(checkConnectivityOfSourceZones(ZoneType.RESIDENTIAL,5));\n\t\t\n\t\tlogger.info(\"computing path from a random point in each zone to a reference node. This takes a while... %n\"); \n\t\tzonesToRemove.addAll(checkConnectvityOfDestinationZones(5));\n\t\t\n\t\tlogger.info(\"removing isolated zones \" + zonesToRemove.size());\n\t\tremoveZones(zonesToRemove);\n\t\t\n\t\tlogger.info(\"updating probabilities\");\n\t\tupdateProbabilities();\n\t}","title":""},{"docid":"cd1ec3728813d3712894960714d1a000","score":"0.5301051","text":"public AdjacencyList(int v)\t//parameterised constructor\r\n {\r\n \tadj=new Node[v];\r\n }","title":""},{"docid":"513bad0c54c7dbe93137ac515650ed07","score":"0.5299785","text":"private void calculatePath()\n {\n dijkstra.execute( myGraph.getVertex( jComboBox1.getSelectedIndex() - 1 ) );\n path = dijkstra.getPath( myGraph.getVertex( jComboBox2.getSelectedIndex() - 1 ) );\n }","title":""},{"docid":"823abda796d6132de851f375b0d7011a","score":"0.529195","text":"public static void main(String[] args) {\n Vertice novo;\n\n int tVertices, org, dest, op, num, tipo;\n\n System.out.println(\"Tipo do grado (1-não orientado, 2-orientado)\");\n tipo = in.nextInt();\n\n System.out.println(\"Digite número de vértices do grafo:\");\n tVertices = in.nextInt();\n\n adj = new ListaAdjacente[tVertices + 1];\n marcado = new int[tVertices + 1];\n\n for (int i = 1; i <= tVertices; i++) {\n adj[i] = new ListaAdjacente();\n marcado[i] = 0;\n }\n\n System.out.println(\"Arestas do grafo: VérticesOrigem (-1 para parar):\");\n org = in.nextInt();\n\n System.out.println(\"Arestas do grafo: VérticeDestino (-1 para parar):\");\n dest = in.nextInt();\n\n while (org != -1 && dest != -1) {\n novo = new Vertice();\n novo.num = dest;\n novo.prox = adj[org].listaV;\n adj[org].listaV = novo;\n\n if (tipo == 1) {\n novo = new Vertice();\n novo.num = org;\n novo.prox = adj[dest].listaV;\n adj[dest].listaV = novo;\n }\n\n System.out.println(\"Arestas do grafo: VérticeOrigem (-1 para parar):\");\n org = in.nextInt();\n System.out.println(\"Arestas do grafo: VérticeDestino (-1 para parar):\");\n dest = in.nextInt();\n }\n\n do {\n System.out.println(\"1 - Buscar em profundidade\");\n System.out.println(\"2 - Mostar lista de adjacencias\");\n System.out.println(\"3 - Sair\");\n System.out.print(\"Digite seu opção: \");\n op = in.nextInt();\n switch (op) {\n case 1:\n System.out.println(\"Digite um vértice de partida da busca:\");\n num = in.nextInt();\n System.out.println(\" \" + num);\n buscaprof(adj, tVertices, num);\n for (int i = 1; i <= tVertices; i++) {\n marcado[i] = 0;\n }\n break;\n case 2:\n mostrar_adj(adj, tVertices);\n break;\n }\n } while (op != 3);\n }","title":""},{"docid":"02b795a51cbfd8c486d2107bd820b686","score":"0.5290536","text":"public void minimumPathDijkstra(String source, String destination) {\n int sourceIndex = verticesIndexes(source);\n int destinationIndex = verticesIndexes(destination);\n int[] minimumWeights = new int[totalVertices];\n boolean[] visited = new boolean[totalVertices];\n\n for (int vertexIndex = 0; vertexIndex < totalVertices; vertexIndex++) {\n minimumWeights[vertexIndex] = Integer.MAX_VALUE;\n visited[vertexIndex] = false;\n }\n\n minimumWeights[sourceIndex] = 0;\n int[] parents = new int[totalVertices];\n parents[sourceIndex] = -1;\n\n for (int index = 0; index < totalVertices; index++) {\n int neighbour = -1;\n int minumum = Integer.MAX_VALUE;\n for (int vertexIndex = 0; vertexIndex < totalVertices; vertexIndex++) {\n if (!visited[vertexIndex] && minimumWeights[vertexIndex] < minumum) {\n neighbour = vertexIndex;\n minumum = minimumWeights[vertexIndex];\n }\n }\n\n visited[neighbour] = true;\n\n for (int vertexIndex = 0; vertexIndex < totalVertices; vertexIndex++) {\n int edgeDistance = adjacencyMatrix[neighbour][vertexIndex];\n if (edgeDistance > 0 && ((minumum + edgeDistance) < minimumWeights[vertexIndex])) {\n parents[vertexIndex] = neighbour;\n minimumWeights[vertexIndex] = minumum + edgeDistance;\n }\n }\n }\n displayMinimum(sourceIndex, destinationIndex, minimumWeights, parents);\n }","title":""},{"docid":"4ef3ee009a31c1260065958d14f7cc2e","score":"0.52892435","text":"public static ArrayList<String> shortestChain(Graph g, String p1, String p2) {\r\n\r\n\t\t/** COMPLETE THIS METHOD **/\r\n\r\n\t\tPerson[] memb;\r\n\t\tmemb = g.members;\r\n\t\tArrayList<String> shortestChain = new ArrayList<String>();\r\n\t\tint n = memb.length;\r\n\r\n\t\tint A[] = new int[n];\r\n\t\tint B[] = new int[n];\r\n\t\tint C[] = new int[n];\r\n\t\tboolean visited[] = new boolean[n];\r\n\r\n\t\tfor(int i=0;i<n;i++)\r\n\t\t{\r\n\r\n\t\t\tB[i]=Integer.MAX_VALUE;\r\n\t\t}\r\n\t\tB[g.map.get(p1)]=0;\r\n\r\n\r\n\r\n\t\tfor(int i=0;i<n; i++)\r\n\t\t\tA[i]=i;\r\n\r\n\t\tfor(int i=0;i<n-1;i++)\r\n\t\t{\r\n\r\n\t\t\tint minVertex = findMinVertex(B,visited);\r\n\t\t\tvisited[minVertex]=true;\r\n\t\t\tif(B[minVertex]!=Integer.MAX_VALUE)\r\n\t\t\t{\r\n\r\n\t\t\t\twhile(memb[minVertex].first!=null)\r\n\t\t\t\t{\r\n\t\t\t\t\tint t = memb[minVertex].first.fnum;\r\n\t\t\t\t\tif(B[t]>B[minVertex]+1)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tB[t] = B[minVertex]+1;\r\n\t\t\t\t\t\tC[t]=minVertex;\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tmemb[minVertex].first = memb[minVertex].first.next;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t}\r\n\t\tint sourceIndex = g.map.get(p1);\r\n\t\tint destinationIndex = g.map.get(p2);\r\n\t\tif(sourceIndex==destinationIndex)\r\n\t\t{\r\n\t\t\tshortestChain.add(0,memb[destinationIndex].name);\r\n\t\t\tshortestChain.add(0,memb[destinationIndex].name);\r\n\t\t\treturn shortestChain;\r\n\t\t}\r\n\t\tif(B[destinationIndex]==Integer.MAX_VALUE)\r\n\t\t\treturn null;\r\n\t\tshortestChain.add(0,memb[destinationIndex].name);\r\n\t\twhile(true)\r\n\t\t{\r\n\t\t\tif(B[destinationIndex]==Integer.MAX_VALUE)\r\n\t\t\t\treturn null;\r\n\t\t\tshortestChain.add(0,memb[C[destinationIndex]].name);\r\n\t\t\tdestinationIndex = C[destinationIndex];\r\n\t\t\tif(destinationIndex==sourceIndex)\r\n\t\t\t{\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\t// FOLLOWING LINE IS A PLACEHOLDER TO MAKE COMPILER HAPPY\r\n\t\t// CHANGE AS REQUIRED FOR YOUR IMPLEMENTATION\r\n\t\treturn shortestChain;\r\n\t}","title":""},{"docid":"eb726f16d13c4e8c5ed8018d19b6cd8d","score":"0.5288879","text":"public float[] shortPath() {\n\t\t\n\t\t// define u as integer\n\t\tint u;\n\t\t\n\t\t// Setup S and dist[]\n\t\tfor (int i=0 ; i <= this.n ; i++) {\n\t\t\t\n\t\t\t// Set all S element into false\n\t\t\tS[i] = false;\n\t\t\t\n\t\t\t// Set value of dist[]\n\t\t\t// This part is different from the book \n\t\t\t// This will help to determine min value to get the \"u\"\n\t\t\tif(cost[this.v][i] != 0.0) {\n\t\t\t\t// set the distance of reachable vertex from v as the value on cost matrix\n\t\t\t\tdist[i] = cost[this.v][i];\n\t\t\t} else {\n\t\t\t\t// set unreached vertex from v to unlimited ( represent on Max Value of float )\n\t\t\t\tdist[i] = Float.MAX_VALUE;\n\t\t\t}\n\t\t}\n\t\t\n\t\t// Set v into true, so it will not be examined for the next step\n\t\tS[this.v] = true;\n\t\t\n\t\t// Set dist v to v into 0\n\t\tdist[this.v] = (float) 0.0;\n\t\t\n\t\t/**\n\t\t * Modification to print the path\n\t\t */\n\t\tparents[v] = this.NO_PARENT;\n\t\t\n\t\t// Begin iteration from the nearest vertex\n\t\tfor(int num = 1 ; num < this.n ; num++) {\n\t\t\t\n\t\t\t// get the index of the nearest vertex\n\t\t\tu = minDistance(this.dist,this.S);\n\t\t\t\n\t\t\t// Set this index to True, so it will not re examined on next iteration\n\t\t\tthis.S[u] = true;\n\t\t\t\n\t\t\tif(num==1) {\n\t\t\t\tparents[u] = v;\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t\tfor(int w = 0; w <= this.n ; w++) {\n\t\t\t\t\n\t\t\t\t// Exchange the distance which is previously unreachable from v\n\t\t\t\t// than become reachable through u\n\t\t\t\t// adding the condition cost[u][w] != 0\n\t\t\t\tif((S[w] == false) && (dist[w]>dist[u]+cost[u][w]) && (cost[u][w] != 0.0)) {\n\t\t\t\t\tparents[w] = u;\n\t\t\t\t\tdist[w] = dist[u]+cost[u][w];\n\t\t\t\t}\t\n\t\t\t}\n\t\t}\n\t\t\n\t\t// return dist\n\t\treturn dist;\n\t}","title":""},{"docid":"a2b89aee462cbf1f46b6d913f53987f3","score":"0.5284113","text":"public double getMaximumDirectedPathLength() {\n\t\treturn 0;\r\n\t}","title":""},{"docid":"534994f1375b921af532a57f90478405","score":"0.52826786","text":"@Test\n public void lm_issue2() {\n NodeAccess na = graph.getNodeAccess();\n DecimalEncodedValue speedEnc = encoder.getAverageSpeedEnc();\n na.setNode(0, 49.406987, 9.709767);\n na.setNode(1, 49.403612, 9.702953);\n na.setNode(2, 49.409755, 9.706517);\n na.setNode(3, 49.409021, 9.708649);\n na.setNode(4, 49.400674, 9.700906);\n na.setNode(5, 49.408735, 9.709486);\n na.setNode(6, 49.406402, 9.700937);\n na.setNode(7, 49.406965, 9.702660);\n na.setNode(8, 49.405227, 9.702863);\n na.setNode(9, 49.409411, 9.709085);\n graph.edge(0, 1, 623.197000, true).set(speedEnc, 112);\n graph.edge(5, 1, 741.414000, true).set(speedEnc, 13);\n graph.edge(9, 4, 1140.835000, true).set(speedEnc, 35);\n graph.edge(5, 6, 670.689000, true).set(speedEnc, 18);\n graph.edge(5, 9, 80.731000, false).set(speedEnc, 88);\n graph.edge(0, 9, 273.948000, true).set(speedEnc, 82);\n graph.edge(4, 0, 956.552000, true).set(speedEnc, 60);\n preProcessGraph();\n int source = 5;\n int target = 4;\n Path refPath = new DijkstraBidirectionRef(graph, weighting, NODE_BASED)\n .calcPath(source, target);\n Path path = createAlgo()\n .calcPath(source, target);\n comparePaths(refPath, path, source, target);\n }","title":""},{"docid":"18255526c78dc5fd8d245ece76ad291f","score":"0.52822554","text":"public static void main(String[] args) {\r\n GraphVisualization graph = new GraphVisualization();\r\n java.util.LinkedList<String> DistinctVertex = new java.util.LinkedList<String>();//used to enter vertexes\r\n java.util.LinkedList<String> SourceVertex = new java.util.LinkedList<String>();//to form directed graph\r\n java.util.LinkedList<String> DestinationVertex = new java.util.LinkedList<String>();//to form directed graph\r\n java.util.LinkedList<Integer> EdgeHeight = new java.util.LinkedList<Integer>();//used to enter edge weight\r\n\r\n Scanner s = new Scanner(System.in);\r\n int n; // number of points\r\n int a; // pointID\r\n int f; // number of food available at the point\r\n int l; // maxkang of the point\r\n int m; // number of route connected\r\n int threshold;//size of colony\r\n\r\n //MENU INPUT POINT\r\n System.out.println(\"(THE MAP/POINTS INPUT MENU)\");\r\n // ask the user to input the number of points\r\n System.out.print(\"Enter the number of points: \");\r\n n = s.nextInt();\r\n Hafiz = new Map(n);// set the number of points, tapi point masih belum ada\r\n// System.out.println(\"enter information, kat sini kene baiki cara user input\");\r\n System.out.println(\"Please enter information about points\");\r\n for (int i = 0; i < n; i++) {\r\n System.out.println(\"(Point \" + (i + 1) + \")\");\r\n a = i + 1;\r\n DistinctVertex.add(Integer.toString(a));\r\n System.out.print(\"Enter the number of food available at the point : \");\r\n f = s.nextInt();\r\n System.out.print(\"Enter the maximum amount of kangaroo that could fit in point \" + (i + 1) + \": \");\r\n l = s.nextInt();\r\n System.out.print(\"Enter the number of route that is connected to \" + (i + 1) + \": \");\r\n m = s.nextInt();\r\n Hafiz.points.addNode(new Points(a, f, l, m));\r\n System.out.println();\r\n System.out.println();\r\n }\r\n System.out.println();\r\n for (int i = 0; i < Hafiz.numberofpoints; i++) {\r\n if ((Hafiz.points.atindex(i).getnumroute() != 0)) {\r\n System.out.println(\"Point ID: \" + Hafiz.points.atindex(i).getpointID());\r\n for (int r = 0; r < Hafiz.points.atindex(i).getnumroute(); r++) {\r\n int tempID;\r\n System.out.print(\"Route from \" + Hafiz.points.atindex(i).getpointID() + \" to Point: \");\r\n tempID = s.nextInt();\r\n for (int t = 0; t < Hafiz.numberofpoints; t++) {\r\n if (Hafiz.points.atindex(t).getpointID() == tempID) {\r\n System.out.print(\"with height of: \");\r\n int tempheight = s.nextInt();\r\n Hafiz.points.atindex(i).addroute(new Route(Hafiz.points.atindex(t), tempheight));// tambah jalan\r\n\r\n SourceVertex.add(Integer.toString(Hafiz.points.atindex(i).getpointID()));\r\n DestinationVertex.add(Integer.toString(tempID));\r\n EdgeHeight.add(tempheight);\r\n }\r\n\r\n }\r\n }\r\n System.out.println();\r\n } else {\r\n System.out.println(\"Point ID: \" + Hafiz.points.atindex(i).getpointID() + \" has no outward route\");\r\n }\r\n System.out.println();\r\n }\r\n //END MENU INPUT POINT\r\n //test\r\n\r\n //KANGAROO INPUT POINT\r\n System.out.println(\"(THE KANGAROO INPUT MENU)\");\r\n System.out.print(\"Enter the amount of Kangaroo(s) for the whole map : \");\r\n int tempnumkang = s.nextInt();\r\n //i , s and p KANGAROOS INFORMATION\r\n System.out.println(\"Adding kangaroos id,gender(M/F),pouchcapacity\");\r\n for (int i = 0; i < tempnumkang; i++) {\r\n System.out.print(\"ID: \");\r\n int tempID = s.nextInt();\r\n System.out.print(\"Gender: \");\r\n s.nextLine();\r\n char c = s.nextLine().charAt(0);\r\n char c1 = Character.toUpperCase(c);\r\n Character tempgender = c1;\r\n System.out.print(\"Pouch Capacity: \");\r\n int temppouch = s.nextInt();\r\n Hafiz.Kangaroos.addNode(new Kangaroo(tempID, tempgender, temppouch));\r\n System.out.println();\r\n }\r\n System.out.println(\"Size of a colony(threshold): \");\r\n threshold = s.nextInt();\r\n Points.colony = threshold;\r\n System.out.println();\r\n System.out.println();\r\n //\r\n //END KANGAROO INPUT POINT\r\n graph.Visualize_Directed_Graph(DistinctVertex, SourceVertex, DestinationVertex, EdgeHeight);\r\n\r\n System.out.println(\"_____________________________________________________________\");\r\n System.out.println(\"List of route taken by the Kangaroo(s)\");\r\n Hafiz.tick();\r\n\r\n //\r\n int counter = 0;\r\n for (int i = 0; i < Hafiz.Kangaroos.length(); i++) { //kira bilangan kangaroo yang ada dalam colony\r\n if (Hafiz.Kangaroos.atindex(i).isincolony() == false) {\r\n // System.out.println(JumpyGrof.Kangaroos.atindex(i).toString());\r\n counter++;\r\n }\r\n }\r\n for (int i = 0; i < JumpyGrof.Hafiz.points.length(); i++) {\r\n // System.out.println(\"Food at point \" + JumpyGrof.Hafiz.points.atindex(i).getpointID() + \": \" + JumpyGrof.Hafiz.points.atindex(i).getfood());\r\n }\r\n\r\n // System.out.println(\"Number of colony formed: \" + Points.numberofcolony);\r\n System.out.println();\r\n System.out.println();\r\n //List of Kangaroos that was not able to colonized\r\n System.out.println(\"List of Kangaroos that was not able to colonized\");\r\n System.out.println(\"Number of Remaining Kangaroos: \" + counter);\r\n for (int i = 0; i < Hafiz.Kangaroos.length(); i++) {\r\n if (Hafiz.Kangaroos.atindex(i).isincolony() == false) {\r\n System.out.println(Hafiz.Kangaroos.atindex(i).toString());\r\n }\r\n }\r\n System.out.println();\r\n System.out.println();\r\n counter = 0;\r\n //\r\n\r\n //\r\n System.out.println(\"LIST OF FOOD LEFT (DEBUGGING)\");\r\n for (int i = 0; i < JumpyGrof.Hafiz.points.length(); i++) {\r\n System.out.println(\"Food at point \" + JumpyGrof.Hafiz.points.atindex(i).getpointID() + \": \" + JumpyGrof.Hafiz.points.atindex(i).getfood());\r\n }\r\n System.out.println();\r\n //\r\n\r\n //List of Kangaroos that are able to colonized\r\n System.out.println(\"List of Kangaroos that are able to colonized\");\r\n for (int i = 0; i < Hafiz.Kangaroos.length(); i++) {\r\n if (Hafiz.Kangaroos.atindex(i).isincolony() == true) {\r\n counter++;\r\n }\r\n }\r\n System.out.println(\"Number of colony formed: \" + Points.numberofcolony);\r\n System.out.println(\"Number of Kangaroos that are colonized: \" + counter);\r\n for (int i = 0; i < JumpyGrof.Hafiz.points.length(); i++) {\r\n if (JumpyGrof.Hafiz.points.atindex(i).iscolonized() == true) {\r\n System.out.println(\"Colony at point \" + JumpyGrof.Hafiz.points.atindex(i).getpointID());\r\n for (int j = 0; j < Hafiz.Kangaroos.length(); j++) {\r\n if (Hafiz.Kangaroos.atindex(j).getpointID() == JumpyGrof.Hafiz.points.atindex(i).getpointID()) {\r\n System.out.println(Hafiz.Kangaroos.atindex(j).toString());\r\n }\r\n }\r\n }\r\n }\r\n //\r\n System.out.println(\"________________________________________________________________________________________\");\r\n\r\n }","title":""},{"docid":"470c4633d6cff60f5103b1a5e454b68a","score":"0.5276353","text":"public Graph() {\r\n\t\tvertices = new ArrayList<>();\r\n\t}","title":""},{"docid":"a336f6bbc6821c27f9bf794e5cec1d3d","score":"0.52716607","text":"public void shortestPathPrecomputation() {\n \t\n \tshortestPath = new ArrayList[wordIndex.size()][wordIndex.size()];\t//initialize the 2D arraylist. \n \t\n \tfor(int n = 0; n < wordIndex.size(); n++) {\n\t \tArrayList<heapNode> visited = new ArrayList<heapNode>();\t\t//A list of visited nodes. Words are added\n\t \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t//to this list if the node is removed from\n\t \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t//the priority queue. \n\t \tminHeap mh = new minHeap(wordIndex.size());\t\t\t\t\t\t//The priority queue\n\t \tString curWord = wordIndex.get(n);\t\t\t\t\t\t\t\t//The starting word of the paths\n\t \theapNode curNode = new heapNode(curWord, null);\n\t \tmh.insert(curNode);\n\t \t\n\t \twhile(!mh.isEmpty()) {\t\t\t\t\t\t\t\t\t\t\t//remove the element with the shortest path\n\t \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t//until the priority queue is empty\n\t \t\theapNode min = mh.getMin();\n\t \t\tvisited.add(min);\t\t\t\t\t\t\t\t\t\t\t//mark the node with shortest path visited\n\t \t\theapNode[] nodeList = mh.getList();\n\t \t\tfor(heapNode i : nodeList) {\t\t\t\t\t\t\t\t//for every item in the priority queue\n\t \t\t\tIterable<String> neighbor = graph.getNeighbors(i.word);\t//add all neighbors that are not marked \n\t \t\t\tif(neighbor == null)\t\t\t\t\t\t\t\t\t//visited and are not already in the queue\n\t \t\t\t\tcontinue;\t\t\t\t\t\t\t\t\t\t\t//to the priority queue.\n\t \t\t\tIterator<String> neighbors = neighbor.iterator();\n\t \t\t\tpoint: while(neighbors.hasNext()){\n\t \t\t\t\tString newWord = neighbors.next();\n\t \t\t\t\tfor(heapNode j : visited) {\n\t \t\t\t\t\tif(j.word.equals(newWord))\n\t\t\t\t\t\t\t\tcontinue point;\n\t \t\t\t\t}\n\t \t\t\t\theapNode oldWord = mh.findNode(newWord);\n\t \t\t\t\theapNode newWordNode = new heapNode(newWord, i);\n\t \t\t\t\tif(oldWord == null)\n\t \t\t\t\t\tmh.insert(new heapNode(newWord,i));\n\t \t\t\t\telse\n\t \t\t\t\t\tif(oldWord.distance > newWordNode.distance)\t//update the word in queue if a shorter path is\n\t \t\t\t\t\t\toldWord.setDistance(i);\t\t\t\t\t//found (not expected in this program since\n\t \t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t//the distance is continuously increasing)\n\t \t\t\t}\n\t \t\t}\n\t \t\tmh.removeMin();\n\t \t}\n\t \t\n\t \tfor(int m = 0; m < visited.size(); m++) {\t\t\t\t//construct shortest paths between the starting \n\t \t\tList<String> path = new ArrayList<String>();\t\t//vertex and every other vertex possible.\n\t \t\theapNode pathNode = visited.get(m);\n\t \t\tpath.add(pathNode.word);\t\t\t\t\t\t\t//put the destination in the list\n\t \t\tint destIndex = wordIndex.indexOf(pathNode.word);\t//find the index of destination.\n\t \t\twhile(pathNode.ances != null) {\t\t\t\t\t\t//this is true when it reaches the starting node.\n\t \t\t\tpathNode = pathNode.ances;\n\t \t\t\tpath.add(0, pathNode.word);\t\t\t\t\t\t//add the previous node to the beginning of the path\n\t \t\t}\n\t \t\tshortestPath[n][destIndex] = path;\n\t \t}\n \t}\n }","title":""},{"docid":"e7110d3006b13a1281d860e1e0e75cc2","score":"0.52691007","text":"public static void main(String[] args)\r\n {\r\n \r\n Graph graph = new Graph(32000); //I ran into a problem with making the graph index range any larger, not sure how to get around this issue. I tried\r\n graph.initializeNodes(graph, 32000); //allocating more memory in eclipse for heap space, but it didn't work. 30-32k seemed as high as I could take it. \r\n\r\n for(int i = 1; i<=5; i++)\r\n {\r\n System.out.print(\"Node \" + i + \"\\'s \");\r\n graph.showVertex(i);\r\n System.out.print(\"Routes: \\n\");\r\n graph.showEdges(i);\r\n System.out.println(\"\\n\");\r\n }\r\n\r\n int select = graph.search();\r\n graph.algorithmChoice(graph, select);\r\n }","title":""},{"docid":"a1bcaffd665528fb5825e2f6931b1697","score":"0.526657","text":"public List getDirections_LeastKm(String startStationName, String endStationName)//求实际距离最短的路径\n {\n\t\tif(!this.hasStation(startStationName) || !this.hasStation(endStationName))\n\t\t{\n\t\t\tthrow new RuntimeException(\"Stations entered do not exist on this subway.\");\n\t\t}\n\n\t\tStation start = new Station(startStationName);\n\t\tStation end = new Station(endStationName);\n\t\tList route = new LinkedList();\n\t\tList reachableStations = new LinkedList(); \n\t\tList unreachStations=new LinkedList();\n\t\tMap previousStations = new HashMap(); \n\t Map destLength=new HashMap();\n\t\t\n\t\t//Initialize the dest[]\n\t\tfor(Iterator i = stations.iterator(); i.hasNext();)\n\t\t{\n\t\t\tStation station = (Station)i.next();\n\t\t\tdestLength.put(station.getName(),100000);\n\t\t}\n\n //Judge whether the destination is one station away from the start\n\t\t//Initialize previousStations\n\t\tList neighbors = (List)network.get(startStationName); \n\t\tfor(Iterator i = neighbors.iterator(); i.hasNext();)\n\t\t{\n\t\t\tStation station = (Station)i.next();\n\t\t\tif(station.equals(end))\n\t\t\t{\n\t\t\t\troute.add(getConnection(start, end));\n\t\t\t\treturn route;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tpreviousStations.put(station.getName(), start);\n\t\t\t\tConnection connection=getConnection(start, station);\n\t\t\t}\n\t\t}\n\n\t\tList nextStations = new LinkedList();\n\t\tStation currentStation = start;\n\t\treachableStations.add(currentStation); \n\t\tunreachStations.addAll(stations);\n\t\tunreachStations.remove(start);\n\t int minLength=100000;\n\t\tStation chosenStation;\n\t\t\n\t\t//Input the initial value to dest[] for iteration\n\t\tfor(Iterator i = unreachStations.iterator(); i.hasNext();){\n\t\t\tStation station=(Station)i.next();\n\t\t\tif(hasConnection(start.getName(),station.getName())){\n\t\t\t\tConnection connect = (Connection) getConnection(start,station);\n\t\t\t\tdestLength.remove(station.getName());\n\t\t\t\tdestLength.put(station.getName(),connect.getLength());\n\t\t\t}\t\t\t\n\t\t}\n\t\t\n\t\t//Dijkstra\n\t\twhile(!unreachStations.isEmpty()){\n\t\t\tIterator temp=unreachStations.iterator();\n\t\t\tchosenStation=(Station)temp.next();\n\t\t\tminLength=(int)destLength.get(chosenStation.getName());\n\t\t\tfor(Iterator i = unreachStations.iterator(); i.hasNext();){\n\t\t\t Station station=(Station)i.next();\n\t\t\t\tint length=(int)destLength.get(station.getName());\n\t\t\t\tif(length<minLength){\n\t\t\t\t\tminLength=length;\n\t\t\t\t\tchosenStation=station;\n\t\t\t\t}\t\t\t\t\n\t\t\t}\n\t\t\tif(chosenStation.equals(end)){\n\t\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse{\n\t\t\t\treachableStations.add(chosenStation);\n\t\t\t\tunreachStations.remove(chosenStation);\n\t\t\t\tfor(Iterator j = unreachStations.iterator(); j.hasNext();){\n\t\t\t\t\tStation unStation=(Station)j.next();\n\t\t\t\t\tif(hasConnection(chosenStation.getName(),unStation.getName())){\n\t\t\t\t\t\tConnection tempConnection=(Connection)getConnection(chosenStation,unStation);\n\t\t\t\t\t\tif((int)destLength.get(unStation.getName())>(int)destLength.get(chosenStation.getName())+tempConnection.getLength()){\n\t\t\t\t\t\t\tdestLength.remove(unStation.getName());\n\t\t\t\t\t\t\tint newLength=(int)destLength.get(chosenStation.getName())+tempConnection.getLength();\n\t\t\t\t\t\t\tdestLength.put(unStation.getName(),newLength);\n\t\t\t\t\t\t\tpreviousStations.remove(unStation);\n\t\t\t\t\t\t\tpreviousStations.put(unStation.getName(), chosenStation);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\n\t\t//We've found the path by now.\n\t\tboolean keepLooping = true;\n\t\tStation keyStation = end;\n\t\tStation station;\n\n\t\t//Once we've got a path, we just \"unwind\" the path, and create a List of connections to get from the starting station to the destination station.\n\t\twhile(keepLooping)\n\t\t{\n\t\t\tstation = (Station)previousStations.get(keyStation.getName());\n\t\t\troute.add(0, getConnection(station, keyStation));\n\t\t\tif(start.equals(station))\n\t\t\t{\n\t\t\t\tkeepLooping = false;\n\t\t\t}\n\t\t\tkeyStation = station;\n\t\t}\n\n\t\treturn route;\n }","title":""},{"docid":"feb17c9e9dda153569b46f99817efcb4","score":"0.5262023","text":"@Override\n public List<node_data> shortestPath(int src, int dest) {\n\n if(this.k.nodeSize() == 0) return null;\n\n if(src == dest) {\n List<node_data> l1 = new ArrayList<>();\n l1.add(this.k.getNode(src));\n return l1;\n }\n // change all the tags of nodes in the graph to 0 - like never visited\n Collection<node_data> nodesCo = this.k.getV();\n for(node_data node : nodesCo) node.setTag(0);\n\n ArrayList<node_data> path = new ArrayList<>();\n ArrayList<NodeAlgo> prevs = new ArrayList<>();\n\n node_data a = this.k.getNode(src);\n node_data b = this.k.getNode(dest);\n\n if(a == null || b == null) return null;\n\n Queue<node_data> queue = new LinkedList();\n queue.add(a);\n a.setTag(1);\n\n // BFS algorithm\n while (!queue.isEmpty()) {\n node_data t = queue.poll();\n if (t == b) {\n path.add(t);\n while(t != a) {\n for(int i = 0; i < prevs.size(); i++) {\n if(t.getKey() == prevs.get(i).key.getKey()) {\n path.add(t);\n t = prevs.get(i).prev;\n if(t == a) {\n return path;\n }\n }\n }\n }\n }\n for (node_data m : t.getNi()) {\n if (m.getTag() == 0) {\n NodeAlgo temp = new NodeAlgo(m, t);\n prevs.add(temp);\n m.setTag(1);\n queue.add(m);\n }\n }\n }\n\n return null;\n }","title":""},{"docid":"c381d093d96cf757087a214fb4d863fb","score":"0.52560717","text":"public ArrayList<Vertex<T>> getAdjacencies(){\n ArrayList<Vertex<T>> adj = new ArrayList<Vertex<T>>(this.adjacents);\n return adj;\n }","title":""},{"docid":"c7204d00526a0e79664775dcef954066","score":"0.5255827","text":"private void sSSP(int src) {\n\n\t\tQueue<Integer> bfs = new LinkedList<>();\n\n\t\tbfs.add(src);\n\t\tMap<Integer, Integer> dis = new HashMap<>(); // vertex - distance from source\n\t\tfor (int vertex : adjList.keySet()) {\n\t\t\tdis.put(vertex, Integer.MAX_VALUE);\n\t\t}\n\t\tdis.put(src, 0);\n\n\t\twhile (!bfs.isEmpty()) {\n\t\t\tint front = bfs.poll(); // vertex - 4\n\t\t\t// System.out.print(front + \" \");\n\n\t\t\tList<Integer> neighbourList = this.adjList.get(front); // [1, 3]\n\n\t\t\tfor (int neighbour : neighbourList) {\n\t\t\t\tif (dis.get(neighbour) == Integer.MAX_VALUE) { // agar neigbhour infinite distance pr hai source se, so\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t// it is unvisited\n\t\t\t\t\tbfs.add(neighbour);\n\t\t\t\t\tint distance = dis.get(front) + 1; // 4 ka distance + 1 = 0 + 1 = 1;\n\t\t\t\t\tdis.put(neighbour, distance);\n\t\t\t\t\tSystem.out.println(\"distance of \" + neighbour + \" from source \" + src + \" is \" + distance);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}","title":""},{"docid":"998af662a08a5928d2e2e1bdcbe3bbf1","score":"0.5254536","text":"public static void main(String[] args) {\n generator = new Random();\n //test1();\n\n ListGraph graph = CreateDirectedAcyclicGraph();\n FrmGraph frm = new FrmGraph(graph,70);\n\n if ( is_undirected(graph)) {\n System.out.println(\"Graph is undirected\");\n }\n else {\n System.out.println(\"Graph is directed\");\n }\n\n if ( is_acyclic_graph(graph)) {\n System.out.println(\"Graph is acyclic\");\n }\n else {\n System.out.println(\"Graph is cyclic\");\n }\n ShortestPath s= new ShortestPath(graph);\n ArrayList<Integer> path;\n\n path= s.getPath(0,9);\n System.out.println(\"Shortest PAth from 0 to 9\");\n printPath(graph, path);\n\n path= s.getPath(3,9);\n System.out.println(\"Shortest PAth from 3 to 9\");\n printPath(graph, path);\n\n\n path= s.getPath(3,8);\n System.out.println(\"Shortest PAth from 3 to 8\");\n printPath(graph, path);\n\n\n }","title":""},{"docid":"8500d3c854cf6d9d34bfc6513630d326","score":"0.52484435","text":"public Search(){\r\n\t\tgraph = new ArrayList<Vertex>();\r\n\t}","title":""},{"docid":"1f51ed14c927511307fa9d0ef7747723","score":"0.5248127","text":"private static void Dijkstra(Graph g) {\n Vertex src = g.verts.get(1);\n initialize(g, src);\n IndexedHeap<Vertex> pq = new IndexedHeap<>(g.numNodes + 1, \n (Vertex v1, Vertex v2) -> v1.distance - v2.distance);\n for (Vertex u : g)\n pq.add(u);\n while (!pq.isEmpty()) {\n Vertex u = pq.remove();\n u.seen = true;\n for (Edge e : u.Adj) {\n Vertex v = e.otherEnd(u);\n if (!v.seen) {\n if (relax(u, v, e))\n pq.decreaseKey(v);\n }\n }\n }\n }","title":""},{"docid":"a9d229a5e499506d07efe75a479caffd","score":"0.5242002","text":"ArrayList<Vertex> neighbors(Vertex v);","title":""},{"docid":"c7b9edccac8143df7ca7d8d6d61ef7d6","score":"0.5239693","text":"public static void leerArchivo(int num, double p){\r\n int mb = 1024 * 1024;\r\n long beforeUsedMem=Runtime.getRuntime().totalMemory()-Runtime.getRuntime().freeMemory();\r\n long startTime = 0;\r\n long endTime=0;\r\n final String nombreDelArchivo = \"dataset-ejemplo-U=\"+num+\"-p=\"+p+\".txt\";\r\n Graph graph = new Graph(num);\r\n try {\r\n BufferedReader br = new BufferedReader(new FileReader(nombreDelArchivo));\r\n String lineaActual = br.readLine();\r\n for (int i = 1; i <= 3; i++)lineaActual = br.readLine();\r\n for (int i = 0; i < num ; i++){\r\n lineaActual = br.readLine();\r\n String name= \"\";\r\n String [] cadenaParticionada = lineaActual.split(\" \");\r\n if ((cadenaParticionada.length >= 4)) {\r\n for (int j=3; j<cadenaParticionada.length;j++) name += \" \"+cadenaParticionada[j];\r\n }\r\n int v =Integer.parseInt(cadenaParticionada[0]);\r\n double x = Double.parseDouble(cadenaParticionada[1]);\r\n double y = Double.parseDouble(cadenaParticionada[2]);\r\n if (v==1) graph.addNode(v,x,y,name,0);\r\n else graph.addNode(v,x,y,name);\r\n }\r\n\r\n for (int i = 1; i <= 3; i++)\r\n lineaActual = br.readLine();\r\n startTime=System.currentTimeMillis();\r\n lineaActual = br.readLine();\r\n while (lineaActual != null){\r\n String [] cadenaParticionada = lineaActual.split(\" \");\r\n int src = Integer.parseInt(cadenaParticionada[0]);\r\n int dest = Integer.parseInt(cadenaParticionada[1]);\r\n double weight = Double.parseDouble(cadenaParticionada[2]);\r\n if (src==1) graph.addHval(dest,weight);\r\n graph.addSuccesor(src,dest,weight);\r\n lineaActual = br.readLine();\r\n }\r\n endTime = System.currentTimeMillis();\r\n }\r\n catch(IOException ioe) {\r\n System.out.println(\"Error leyendo el archivo de entrada: \" + ioe.getMessage());\r\n }\r\n\r\n\r\n\r\n\r\n graph.solve(p);\r\n// long endTime = System.currentTimeMillis();\r\n\r\n long timeElapsed = endTime - startTime;\r\n\r\n System.out.println(\"Execution time in milliseconds: \" + timeElapsed);\r\n graph.reset();\r\n\r\n long afterUsedMem=Runtime.getRuntime().totalMemory()-Runtime.getRuntime().freeMemory();\r\n long actualMemUsed=afterUsedMem-beforeUsedMem;\r\n //System.out.print(actualMemUsed);\r\n }","title":""},{"docid":"0a2852282a2df6d7ec422a710b2f88ef","score":"0.5238385","text":"public Test(){\n\t\tgraphAdjacencyList.add( new LinkedList<Integer>() );\t\t//ignore 0th index to make future access more understandable\n\t\tgraphAdjacencyList.add( new LinkedList<Integer>( Arrays.asList(2, 3) ) );\n\t\tgraphAdjacencyList.add( new LinkedList<Integer>( Arrays.asList(1, 3, 4, 5) ) );\n\t\tgraphAdjacencyList.add( new LinkedList<Integer>( Arrays.asList(1, 2, 5, 7, 8) ) );\n\t\tgraphAdjacencyList.add( new LinkedList<Integer>( Arrays.asList(2, 5) ) );\n\t\tgraphAdjacencyList.add( new LinkedList<Integer>( Arrays.asList(2, 3, 4, 6) ) );\n\t\tgraphAdjacencyList.add( new LinkedList<Integer>( Arrays.asList(5) ) );\n\t\tgraphAdjacencyList.add( new LinkedList<Integer>( Arrays.asList(3, 8) ) );\n\t\tgraphAdjacencyList.add( new LinkedList<Integer>( Arrays.asList(3, 7) ) );\n\t\t\n\t}","title":""},{"docid":"47696f3be4b16d1ba94369455f64a2b7","score":"0.52290887","text":"public int[] dijkstra(Nodo nodo) {\r\n\t\tList<Integer> usados = new ArrayList<Integer>();\r\n\t\tList<Integer> pendientes = new ArrayList<Integer>();\r\n\t\tint[] vectorResultado = new int[nodos.size()];\r\n\t\tint[] vectorCamino = new int[nodos.size()];\r\n\r\n\t\tusados.add(nodos.indexOf(nodo)); // agrego el nodo existente a la lista de usados\r\n\t\tfor (int i = 0; i < nodos.size(); i++)\r\n\t\t\tif (nodos.get(i) != nodo) { // lleno el vector y la lista de pendientes\r\n\t\t\t\tvectorResultado[i] = ((MatrizAsimetrica) matrizAdyacencia).getValueAt(nodos.indexOf(nodo), i);\r\n\t\t\t\tpendientes.add(nodos.indexOf(nodos.get(i)));\r\n\t\t\t}\r\n\r\n\t\twhile (!pendientes.isEmpty()) {\r\n\t\t\tint pibote = buscarMin(vectorResultado, pendientes); // busco en el vector el minimo, en relacion con la lista\r\n\t\t\tusados.add(pibote); // agrego el nodo que salio nominado a los usados\r\n\t\t\tfor (Integer numero : pendientes)\r\n\t\t\t\tvectorResultado[numero] = reemplazarMinimo(vectorResultado, vectorCamino, pibote, numero);\r\n\t\t}\r\n\t\treturn vectorResultado;\r\n\t}","title":""},{"docid":"fe61c8b4ac6e287d94f00f2945827b86","score":"0.5228566","text":"private static int distance(ArrayList<Integer>[] adj, ArrayList<Integer>[] cost, int s, int t) {\n \tint[] dist = new int[adj.length];\n int[] prev = new int[adj.length];\n for(int i = 0; i < dist.length; ++i) {\n \tdist[i] = Integer.MAX_VALUE;\n \tprev[i] = -1; \n }\n dist[s] = 0;\n // TODO Java do not support ChangePriority in PriorityQueue\n \t// we use a HashSet to record incomplete Vertices\n \tPriorityQueue<Vertex> pQueue = new PriorityQueue<>();\n \tHashSet<Integer> set = new HashSet<>();\n \tfor(int v = 0; v < adj.length; ++v) {\n \t\t// Although it is not necessary to add all Vertices into pQueue\n \t\t// at the beginning, to prevent consistency, I still add them all.\n \t\tpQueue.offer(new Vertex(v, dist[v]));\n \t\tset.add(v);\n \t}\n while(!set.isEmpty()) {\n \tVertex u = pQueue.poll();\n \t// TODO mark u as processed immediately\n \tset.remove(u.index);\n// \tSystem.out.print(u.index);\n// \tSystem.out.print(\": \");\n \tfor(int i = 0; i < adj[u.index].size(); ++i) {\n \t\tint v = adj[u.index].get(i);\n// \t\tSystem.out.print(v);\n// \t\tSystem.out.print(\" \");\n \t\t// TODO have to check if v processed already\n \t\t// since we cannot modify Vertices in pQueue\n \t\tif(set.contains(v) && dist[v] > dist[u.index] + cost[u.index].get(i)) {\n \t\t\tdist[v] = dist[u.index] + cost[u.index].get(i);\n \t\t\tprev[v] = u.index;\n \t\t\tpQueue.add(new Vertex(v, dist[v]));\n \t\t}\n \t}\n// \tSystem.out.println();\n }\n // TODO if invalid, return -1\n \treturn (dist[t] >= 0 && dist[t] < Integer.MAX_VALUE)? dist[t]: -1;\n }","title":""},{"docid":"3538804d70336a5a1e39d30501c2ab17","score":"0.5220576","text":"private void dijkstra(String nodeName)\n {\n int i=0;\n boolean flag=false;\n while(i<this.listNodes.size() && !flag)\n {\n if(this.listNodes.get(i).getName().equalsIgnoreCase(nodeName))\n {\n flag=true;\n }else\n {\n i++;\n }\n }\n this.markedList.add(nodeName);\n String[] aux=this.dijkstra.get(nodeName).split(\";\");\n int value=Integer.parseInt(aux[0]);\n String label=aux[1];\n for (GraphEdge edge : this.listEdges.get(i)) \n {\n if(!this.markedList.contains(edge.getEndNode().getName()))\n {\n if(!this.dijkstra.get(edge.getEndNode().getName()).equalsIgnoreCase(\"&\"))\n {\n String aux2[]=this.dijkstra.get(edge.getEndNode().getName()).split(\";\");\n if(Integer.parseInt(aux[0])>(value+edge.getValue()) )\n {\n this.dijkstra.put(edge.getEndNode().getName(), (value+edge.getValue()+\";\"+nodeName));\n }\n }else\n {\n this.dijkstra.put(edge.getEndNode().getName(), (value+edge.getValue()+\";\"+nodeName));\n }\n }\n }\n String nextNode=searchLower();\n if(!nextNode.equals(\"\"))\n {\n dijkstra(nextNode);\n }\n }","title":""},{"docid":"64f870c26dc9e69502e4fcb094ac7334","score":"0.5217945","text":"public Graph(File topology)\n {\n vertices = new ArrayList<>();\n links = new ArrayList<>();\n \n try {\n Scanner sc = new Scanner(new FileReader(topology));\n \n String[] lines = null, columns = null;\n if(sc.hasNextLine())\n \tlines = sc.nextLine().split(\"; \");\n if(sc.hasNextLine())\n \tcolumns = sc.nextLine().split(\"; \");\n \n for(int i = 0; i < lines.length; i++) {\n \tfor(int j = 0; j <= columns.length; j++) {\n \t\tString vertice = i + \"\" + j;\n \t\tthis.addVertice(vertice);\n \t\tSystem.out.println(\"Vertice add: \"+vertice);\n \t\t\n \t}\n }\n \n for(int i = 0; i < lines.length; i++) {\n \tString [] line = lines[i].split(\" \");\n \tfor(int j = 0; j < line.length; j++) {\n \t\tif(line[j].contains(\";\"))\n \t\t\tline[j]=line[j].substring(0, line[j].length()-1);\n \t\tSystem.out.println(\"line[j] \"+line[j]);\n \t\tif(line[j].equals(\"0\")) { //there is a link\n \t\tRouter starting = this.getVertice(\"\" + j + (columns.length - i));\n \t\tRouter ending = this.getVertice(\"\" + (j+1) + (columns.length - i));\n \t\tthis.addAresta(starting, ending, ports[2]);\n \t\tthis.addAresta(ending, starting, ports[3]); \t\t\t\n \t\t}\n \t\tif(!line[j].equals(\"0\") && !line[j].equals(\"1\")){\n \t\t\t\n \t\t\tRouter starting = this.getVertice(\"\" + j + (columns.length - i)); \t\t\t\n \t\tRouter ending = this.getVertice(\"\" + (j+1) + (columns.length - i)); \t\t\n \t\tthis.addAresta(starting, ending, ports[2]);\n \t\tthis.addAresta(ending, starting, ports[3]); \n \t\tstarting.getLink(ending).setDFER(Double.parseDouble(line[j]));\n \t\tending.getLink(starting).setDFER(Double.parseDouble(line[j]));\n \t\t}\n \t}\n }\n\n for(int i = 0; i < columns.length; i++) {\n \tString [] column = columns[i].split(\" \");\n \tfor(int j = 0; j < column.length; j++) { \t\t\n \t\tif(column[j].contains(\";\"))\n \t\t\tcolumn[j]=column[j].substring(0, column[j].length()-1);\n \t\t\n \t\tif(column[j].equals(\"0\")) { //there is a link\n \t\tRouter starting = this.getVertice(j + \"\" + (columns.length - i));\n \t\tRouter ending = this.getVertice(j + \"\" + (columns.length - 1 - i));\n \t\tthis.addAresta(starting, ending, ports[1]);\n \t\tthis.addAresta(ending, starting, ports[0]); \t\t\t\n \t\t}\n \t\t\n \t\tif(!column[j].equals(\"0\") && !column[j].equals(\"1\")){\n \t\t\tRouter starting = this.getVertice(\"\" + j + (columns.length - i));\n \t\tRouter ending = this.getVertice(\"\" + j + (columns.length -1 - i));\n \t\tthis.addAresta(starting, ending, ports[1]);\n \t\tthis.addAresta(ending, starting, ports[0]);\n \t\t\n \t\tstarting.getLink(ending).setDFER(Double.parseDouble(column[j]));\n \t\tending.getLink(starting).setDFER(Double.parseDouble(column[j]));\n \t\t}\n \t}\n }\n\n sc.close();\n \n \n } catch(Exception ex) { \n Logger.getLogger(Graph.class.getName()).log(Level.SEVERE, null, ex);\n }\n }","title":""},{"docid":"a000b1cae35cad1aaf1d218e32c8b598","score":"0.52121097","text":"public int calcLongestRoad2()\r\n {\r\n //Date startTime = new Date();\r\n //\r\n // clear the lr paths vector so that we have an accurate\r\n // representation. if someone cut our longest path in two\r\n // we won't catch it unless we clear the vector\r\n //\r\n D.ebugPrintln(\"CLEARING PATH DATA\");\r\n lrPaths.removeAllElements();\r\n \r\n /**\r\n * we're doing a depth first search of all possible road paths\r\n */\r\n SOCBoard board = game.getBoard();\r\n Stack pending = new Stack();\r\n int longest = 0;\r\n \r\n for (Enumeration e = roadNodes.elements(); e.hasMoreElements();)\r\n {\r\n Integer roadNode = (Integer) e.nextElement();\r\n int pathStartCoord = roadNode.intValue();\r\n pending.push(new NodeLenVis(pathStartCoord, 0, new Vector()));\r\n \r\n while (!pending.isEmpty())\r\n {\r\n NodeLenVis curNode = (NodeLenVis) pending.pop();\r\n int coord = curNode.node;\r\n int len = curNode.len;\r\n Vector visited = curNode.vis;\r\n boolean pathEnd = false;\r\n \r\n /**\r\n * check for road blocks\r\n */\r\n Enumeration pEnum = board.getPieces().elements();\r\n \r\n while (pEnum.hasMoreElements())\r\n {\r\n SOCPlayingPiece p = (SOCPlayingPiece) pEnum.nextElement();\r\n \r\n if ((len > 0) && (p.getPlayer().getPlayerNumber() != this.getPlayerNumber()) && ((p.getType() == SOCPlayingPiece.SETTLEMENT) || (p.getType() == SOCPlayingPiece.CITY)) && (p.getCoordinates() == coord))\r\n {\r\n pathEnd = true;\r\n \r\n //D.ebugPrintln(\"^^^ path end at \"+Integer.toHexString(coord));\r\n break;\r\n }\r\n }\r\n \r\n if (!pathEnd)\r\n {\r\n pathEnd = true;\r\n \r\n int j;\r\n IntPair pair;\r\n boolean match;\r\n \r\n j = coord - 0x11;\r\n pair = new IntPair(coord, j);\r\n match = false;\r\n \r\n if (board.isNodeOnBoard(j) && isConnectedByRoad(coord, j))\r\n {\r\n for (Enumeration ev = visited.elements();\r\n ev.hasMoreElements();)\r\n {\r\n IntPair vis = (IntPair) ev.nextElement();\r\n \r\n if (vis.equals(pair))\r\n {\r\n match = true;\r\n \r\n break;\r\n }\r\n }\r\n \r\n if (!match)\r\n {\r\n Vector newVis = (Vector) visited.clone();\r\n newVis.addElement(pair);\r\n pending.push(new NodeLenVis(j, len + 1, newVis));\r\n pathEnd = false;\r\n }\r\n }\r\n \r\n j = coord + 0x11;\r\n pair = new IntPair(coord, j);\r\n match = false;\r\n \r\n if (board.isNodeOnBoard(j) && isConnectedByRoad(coord, j))\r\n {\r\n for (Enumeration ev = visited.elements();\r\n ev.hasMoreElements();)\r\n {\r\n IntPair vis = (IntPair) ev.nextElement();\r\n \r\n if (vis.equals(pair))\r\n {\r\n match = true;\r\n \r\n break;\r\n }\r\n }\r\n \r\n if (!match)\r\n {\r\n Vector newVis = (Vector) visited.clone();\r\n newVis.addElement(pair);\r\n pending.push(new NodeLenVis(j, len + 1, newVis));\r\n pathEnd = false;\r\n }\r\n }\r\n \r\n j = (coord + 0x10) - 0x01;\r\n pair = new IntPair(coord, j);\r\n match = false;\r\n \r\n if (board.isNodeOnBoard(j) && isConnectedByRoad(coord, j))\r\n {\r\n for (Enumeration ev = visited.elements();\r\n ev.hasMoreElements();)\r\n {\r\n IntPair vis = (IntPair) ev.nextElement();\r\n \r\n if (vis.equals(pair))\r\n {\r\n match = true;\r\n \r\n break;\r\n }\r\n }\r\n \r\n if (!match)\r\n {\r\n Vector newVis = (Vector) visited.clone();\r\n newVis.addElement(pair);\r\n pending.push(new NodeLenVis(j, len + 1, newVis));\r\n pathEnd = false;\r\n }\r\n }\r\n \r\n j = coord - 0x10 + 0x01;\r\n pair = new IntPair(coord, j);\r\n match = false;\r\n \r\n if (board.isNodeOnBoard(j) && isConnectedByRoad(coord, j))\r\n {\r\n for (Enumeration ev = visited.elements();\r\n ev.hasMoreElements();)\r\n {\r\n IntPair vis = (IntPair) ev.nextElement();\r\n \r\n if (vis.equals(pair))\r\n {\r\n match = true;\r\n \r\n break;\r\n }\r\n }\r\n \r\n if (!match)\r\n {\r\n Vector newVis = (Vector) visited.clone();\r\n newVis.addElement(pair);\r\n pending.push(new NodeLenVis(j, len + 1, newVis));\r\n pathEnd = false;\r\n }\r\n }\r\n }\r\n \r\n if (pathEnd)\r\n {\r\n if (len > longest)\r\n {\r\n longest = len;\r\n }\r\n \r\n //\r\n // we want to store the longest path for a single set of nodes\r\n // check to make sure that we don't save two paths that share a node\r\n //\r\n boolean intersection;\r\n boolean addNewPath = true;\r\n Vector trash = new Vector();\r\n \r\n for (Enumeration pdEnum = lrPaths.elements();\r\n pdEnum.hasMoreElements();)\r\n {\r\n SOCLRPathData oldPathData = (SOCLRPathData) pdEnum.nextElement();\r\n D.ebugPrintln(\"oldPathData = \" + oldPathData);\r\n \r\n Vector nodePairs = oldPathData.getNodePairs();\r\n intersection = false;\r\n \r\n for (Enumeration ev = visited.elements();\r\n ev.hasMoreElements();)\r\n {\r\n IntPair vis = (IntPair) ev.nextElement();\r\n D.ebugPrintln(\"vis = \" + vis);\r\n \r\n for (Enumeration npev = nodePairs.elements();\r\n npev.hasMoreElements();)\r\n {\r\n IntPair np = (IntPair) npev.nextElement();\r\n D.ebugPrintln(\"np = \" + np);\r\n \r\n if (np.equals(vis))\r\n {\r\n D.ebugPrintln(\"oldPathData.nodePairs.contains(vis)\");\r\n intersection = true;\r\n \r\n break;\r\n }\r\n }\r\n \r\n if (intersection)\r\n {\r\n break;\r\n }\r\n }\r\n \r\n if (intersection)\r\n {\r\n //\r\n // only keep the longer of the two paths\r\n //\r\n if (oldPathData.getLength() < len)\r\n {\r\n D.ebugPrintln(\"REMOVING OLDPATHDATA\");\r\n trash.addElement(oldPathData);\r\n }\r\n else\r\n {\r\n addNewPath = false;\r\n D.ebugPrintln(\"NOT ADDING NEW PATH\");\r\n }\r\n }\r\n }\r\n \r\n if (!trash.isEmpty())\r\n {\r\n for (Enumeration trashEnum = trash.elements();\r\n trashEnum.hasMoreElements();)\r\n {\r\n SOCLRPathData oldPathData = (SOCLRPathData) trashEnum.nextElement();\r\n lrPaths.removeElement(oldPathData);\r\n }\r\n }\r\n \r\n if (addNewPath)\r\n {\r\n SOCLRPathData newPathData = new SOCLRPathData(pathStartCoord, coord, len, visited);\r\n D.ebugPrintln(\"ADDING PATH: \" + newPathData);\r\n lrPaths.addElement(newPathData);\r\n }\r\n }\r\n }\r\n }\r\n \r\n longestRoadLength = longest;\r\n \r\n //Date stopTime = new Date();\r\n //long elapsed = stopTime.getTime() - startTime.getTime();\r\n //System.out.println(\"LONGEST FOR \"+name+\" IS \"+longest+\" TIME = \"+elapsed+\"ms\");\r\n return longest;\r\n }","title":""},{"docid":"efb2334f0adb82ee05fb00f273a94d97","score":"0.5209543","text":"public static void shortestPaths(String a) {\n\t\tNode start = adjList.get(a);\n\t\tPriorityQueue<Node> pq = new PriorityQueue<Node>();\n\t\tint count = 0;\n\n\t\t// Makes distance from start Node infinity except for itself, which will be 0.\n\t\tfor (String i : adjList.keySet()) {\n\t\t\tNode n = adjList.get(i);\n\t\t\tn.dist = Integer.MAX_VALUE;\n\t\t\tif (n.id == start.id) {\n\t\t\t\tn.dist = 0;\n\t\t\t}\n\t\t\tcount++;\n\t\t\tpq.add(n);\n\t\t}\n\n\t\t/* After it is added to the PQ the Node with the minimum distance will be visited. If a Node\n\t\t * it is connected to has not been visited, it will visit and create a cost to reach it from\n\t\t * the given start Node. It also keeps track of what order the nodes were visited.\n\t\t */\n\t\twhile (count > 0) {\n\t\t\tNode curr = adjList.get(pq.poll().id);\n\t\t\tcurr.visited = true;\n\t\t\tcount--;\n\t\t\tLinkedList<Node> connections = curr.adjacence;\n\t\t\t\n\t\t\tfor (Node n : connections) {\n\t\t\t\tif (n.visited == false) {\n\t\t\t\t\tdouble cost = curr.edgeConnections.get(n).distance;\n\t\t\t\t\tif (n.dist > curr.dist + cost) {\n\t\t\t\t\t\tn.parent = curr; // Keeps track of order of nodes visited.\n\t\t\t\t\t\tn.dist = curr.dist + cost;\n\t\t\t\t\t\tpq.remove(n);\n\t\t\t\t\t\tpq.add(n);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}","title":""},{"docid":"a499430378885460d7f38f736524c21d","score":"0.520513","text":"public void minimumPathDijkstra(String source) {\n int sourceIndex = verticesIndexes(source);\n int[] minimumWeights = new int[totalVertices];\n boolean[] visited = new boolean[totalVertices];\n\n for (int vertexIndex = 0; vertexIndex < totalVertices; vertexIndex++) {\n minimumWeights[vertexIndex] = Integer.MAX_VALUE;\n visited[vertexIndex] = false;\n }\n\n minimumWeights[sourceIndex] = 0;\n int[] parents = new int[totalVertices];\n parents[sourceIndex] = -1;\n\n for (int index = 0; index < totalVertices; index++) {\n int neighbour = -1;\n int minumum = Integer.MAX_VALUE;\n for (int vertexIndex = 0; vertexIndex < totalVertices; vertexIndex++) {\n if (!visited[vertexIndex] && minimumWeights[vertexIndex] < minumum) {\n neighbour = vertexIndex;\n minumum = minimumWeights[vertexIndex];\n }\n }\n\n visited[neighbour] = true;\n\n for (int vertexIndex = 0; vertexIndex < totalVertices; vertexIndex++) {\n int edgeDistance = adjacencyMatrix[neighbour][vertexIndex];\n if (edgeDistance > 0 && ((minumum + edgeDistance) < minimumWeights[vertexIndex])) {\n parents[vertexIndex] = neighbour;\n minimumWeights[vertexIndex] = minumum + edgeDistance;\n }\n }\n }\n displayMinimum(sourceIndex, minimumWeights, parents);\n }","title":""},{"docid":"f4ad48d4e8b767df28cc4537419a1e53","score":"0.52022773","text":"public Link(long dd) // constructor\n{ dData = dd; }","title":""},{"docid":"7fcf7394b0f4054bab67364b44098c5c","score":"0.5199872","text":"public void printPath(Dijkstra d, Graph g){\n int e = d.getNumberLineEnd();\n //Récupétation des chemins\n while(e != d.getNumberLineBegin())\n {\n d.getStationsPath().add(g.getStations().get(e));\n int tmp = e;\n e = d.getParent()[e];\n d.setDuration(d.getDuration() + g.getNetWork()[tmp][e].getWeight());\n }\n d.getStationsPath().add(g.getStations().get(e));\n\n //Inversion du liste de chemin.\n Collections.reverse(d.getStationsPath());\n\n ArrayList<Station> s = new ArrayList<Station>();\n s.add(d.getStationsPath().get(0));\n for( int i = 1; i < d.getStationsPath().size() - 1; i++ ){\n if( d.getStationsPath().get(i).getNumberLine() != d.getStationsPath().get(i + 1).getNumberLine() ){\n s.add(d.getStationsPath().get(i));\n s.add(d.getStationsPath().get(i + 1));\n }\n\n }\n s.add(d.getStationsPath().get(d.getStationsPath().size() - 1));\n\n //Traçage du chemin.\n System.out.println(\"Vous êtes: \" + d.getStationsPath().get(0).getNameStation());\n if( 2 < d.getStationsPath().size() ){\n int x1 = d.getStationsPath().get(1).getNumberStation(), y1 = d.getStationsPath().get(2).getNumberStation();\n int numStation = g.getNetWork()[x1][y1].getTerminus();\n if( numStation == sNO_TERMINUS )\n numStation = x1;\n if( numStation == 30 ){\n System.out.print(\"- Prenez la ligne 3bis \");\n }else if( numStation == 70 ){\n System.out.print(\"- Prenez la ligne 7bis \");\n }else {\n System.out.print(\"- Prenez la ligne \" + d.getStationsPath().get(0).getNumberLine());\n }\n System.out.println(\" direction \" + g.getStations().get(numStation).getNameStation());\n }\n else {\n int x1 = d.getStationsPath().get(0).getNumberStation(), y1 = d.getStationsPath().get(1).getNumberStation();\n int numStation = g.getNetWork()[x1][y1].getTerminus();\n System.out.print(\"- Prenez la ligne \" + d.getStationsPath().get(0).getNumberLine());\n System.out.println(\" direction \" + g.getStations().get(numStation).getNameStation());\n }\n\n for( int i = 2; i < s.size() - 1; i += 2 ){\n int x = s.get(i).getNumberStation(),\n y = s.get(i + 1).getNumberStation();\n int station = g.getNetWork()[x][y].getTerminus();\n System.out.print(\"- A \" + g.getStations().get(x).getNameStation() );\n if( station == 30 ){\n System.out.print(\" prenez la ligne 3bis \");\n }else if( station == 70 ){\n System.out.print(\" prenez la ligne 7bis \");\n }else {\n System.out.print(\" prenez la ligne \" + g.getStations().get(x).getNumberLine());\n }\n if( station == sNO_TERMINUS ){\n station = y;\n }\n System.out.println(\" direction \" + g.getStations().get(station).getNameStation());\n }\n\n System.out.println(\"Vous devriez arriver à \" + g.getStations().get(d.getNumberLineEnd()).getNameStation() + \" dans \" + getTime(d.getDuration()));\n }","title":""},{"docid":"fc08210549865ce888b55beb22a89c08","score":"0.5198583","text":"private AdjacencyMap(){\n this.adjacencies = new HashMap<JOctreeKey, List<JOctreeKey>>();\n this.nodesInfo = new HashMap<JOctreeKey, Pair<Float, Point3D>>();\n }","title":""},{"docid":"5bd0a4b0133c5360a5a2b21cd106d4cd","score":"0.5196397","text":"public DAG(int V){\n this.V = V;\n this.E = 0;\n indegree = new int[V];\n outdegree = new int[V];\n visited = new int[V];\n adj = new int[V][V];\n for(int i = 0; i<V; i++){//sets up an empty graph in 2D array\n for(int j=0;j<V;j++){\n adj[i][j] = 0;\n }\n }\n }","title":""}],"string":"[\n {\n \"docid\": \"bcc9f0a0485d5cfe4128bf9420fe965e\",\n \"score\": \"0.6299296\",\n \"text\": \"private ArrayList<Node> Dijkstra(Node loc1, Node loc2) {\\n\\n // Initially, only the start node is known.\\n dPQ.add(start);\\n\\n //while loop that actually runs through all possible paths.\\n while (dPQ.isEmpty() != true) {\\n dNode current = dPQ.poll();\\n //System.out.println(current.node.getNodeID());\\n //Check if the goal has been reached yet\\n if (current.node.getNodeID().equals(loc2.getNodeID())) {\\n System.out.println(\\\"reached dijkstra goal!\\\");\\n //if so trace back its path\\n closedSet.clear();\\n dPQ.clear();\\n return reconstruct_path(current);\\n }\\n //add the current path to the closedSet(Explored)\\n closedSet.add(current.node.getNodeID());\\n\\n neighbors.clear();\\n //get all the edges connected to the starting node\\n neighbors = edgeM.getNeighbors(current.node);\\n //add all the nodes from the connected edges to the neighbors list\\n Boolean floorChange = false;\\n\\n //loop through the nieghbors\\n for (int i = 0; i < neighbors.size(); i++) {\\n //check if the node is in the closed set\\n for (int j = 0; j < closedSet.size(); j++) {\\n if (neighbors.get(i).getNodeID().equals(closedSet.get(j))) {\\n alreadfound = true;\\n break;// Ignore the neighbor which is already evaluated.\\n } else{\\n alreadfound = false;\\n\\n }\\n }\\n\\n if (alreadfound == true){\\n\\n //if the node is in the closed set ignore it\\n }\\n else {\\n //if it is not in the closed set add it the priority queue allong with its parent\\n Edge gEdge= new Edge(current.node,neighbors.get(i));\\n double distToNext = gEdge.getWeight();\\n double parentCost;\\n if (current.parent == null){\\n parentCost = 0;\\n }\\n else {\\n parentCost = current.parent.gCost;\\n }\\n double gCost = parentCost + distToNext ;\\n if(((loc2.getBuilding().equals(\\\"BTM\\\") || loc2.getBuilding().equals(\\\"Shapiro\\\")))||((neighbors.get(i).getBuilding().equals(\\\"BTM\\\") || neighbors.get(i).getBuilding().equals(\\\"Shapiro\\\")))){\\n if (!(loc2.getBuilding().equals(neighbors.get(i)))){\\n //if one is the tower and one is fransis ignore\\n if (!(neighbors.get(i).getFloor().equals(\\\"2\\\"))) {\\n gCost += 100;\\n }\\n }\\n }\\n if (!(loc2.getFloor().equals(neighbors.get(i).getFloor()))){\\n //if one is the tower and one is fransis ignore\\n gCost += 200;\\n }\\n\\n dNode tempStar = new dNode(neighbors.get(i), current, gCost);\\n dPQ.add(tempStar);\\n //System.out.println(dPQ.size());\\n }\\n\\n }\\n }\\n //fail case returns empty list\\n ArrayList<Node> failList = new ArrayList<Node>();\\n return failList;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"46ae48923f3b82083acbac9f474c582f\",\n \"score\": \"0.62109447\",\n \"text\": \"public static void main(String[] args) {\\r\\n \\r\\n \\tlong startTime = System.nanoTime();\\r\\n \\t\\r\\n \\t\\r\\n\\r\\n \\t\\r\\n \\tclass Graph{\\r\\n \\t\\t//int vertices;\\r\\n \\t\\tHashMap<Integer,Vertices> vertices; \\r\\n \\t\\tHashSet<Edge> edges;\\r\\n \\t\\tclass Vertices\\r\\n \\t\\t\\t{\\r\\n \\t\\t\\tint Label;\\r\\n \\t\\t\\t//int id;\\r\\n \\t\\t\\tList<Edge> adjacent=new ArrayList<Edge>();;\\r\\n\\t\\t\\t\\tprivate int length=-1;\\r\\n \\t\\t\\t\\r\\n \\t\\t\\tpublic int getLabel() {\\r\\n \\t\\t\\t\\treturn Label;\\r\\n \\t\\t\\t}\\r\\n \\t\\t\\tpublic void setLabel(int label) {\\r\\n \\t\\t\\t\\tLabel = label;\\r\\n \\t\\t\\t}\\r\\n \\t\\t\\t\\r\\n\\t\\t\\t\\tpublic List<Edge> getIncident() {\\r\\n\\t\\t\\t\\t\\treturn adjacent;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tpublic void setLength(int count) {\\r\\n\\t\\t\\t\\t\\tthis.length=count;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tpublic int getLength() {\\r\\n\\t\\t\\t\\t\\treturn this.length;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\r\\n \\t\\t\\t}\\r\\n \\t\\t\\r\\n \\t\\t class Edge{\\r\\n \\t\\t\\t//int id;\\r\\n \\t\\t\\tint start,end;\\r\\n \\t\\t\\tint Label;\\r\\n \\t\\t\\t\\r\\n \\t\\t\\tpublic Edge(int v1, int v2) {\\r\\n \\t\\t\\t\\t// TODO Auto-generated constructor stub\\r\\n \\t\\t\\t\\tstart=v1;\\r\\n \\t\\t\\t\\tend=v2;\\r\\n \\t\\t\\t\\t\\r\\n \\t\\t\\t}\\r\\n \\t\\t\\tpublic int getStart() {\\r\\n \\t\\t\\t\\treturn start;\\r\\n \\t\\t\\t}\\r\\n \\t\\t\\t\\r\\n \\t\\t\\tpublic int getEnd() {\\r\\n \\t\\t\\t\\treturn end;\\r\\n \\t\\t\\t}\\r\\n \\t\\t\\t\\r\\n \\t\\t\\tpublic int getLabel() {\\r\\n \\t\\t\\t\\treturn Label;\\r\\n \\t\\t\\t}\\r\\n \\t\\t\\tpublic void setLabel(int label) {\\r\\n \\t\\t\\t\\tLabel = label;\\r\\n \\t\\t\\t}\\r\\n\\t\\t\\t\\tpublic int opposite(int v) {\\r\\n\\t\\t\\t\\t\\t// TODO Auto-generated method stub\\r\\n\\t\\t\\t\\t\\tif(v==start)return end;\\r\\n\\t\\t\\t\\t\\telse return start;\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t}\\r\\n \\t\\t\\t\\r\\n \\t\\t}\\r\\n \\t\\tGraph(int [][]ed,int n){\\r\\n \\t\\t\\tvertices=new HashMap<Integer, Vertices>();\\r\\n \\t\\t\\tedges=new HashSet<Edge>();\\r\\n \\t\\t\\tfor(int i=0;i<n;i++)\\r\\n \\t\\t\\t\\tvertices.put(i, new Vertices());\\r\\n \\t\\t\\tfor(int[] e:ed){\\r\\n \\t\\t\\t\\t\\r\\n \\t\\t\\t\\t//Vertices v1=vertices.get(e[0]-1);\\r\\n \\t\\t\\t\\t//Vertices v2=vertices.get(e[1]-1);\\r\\n \\t\\t\\t\\t\\r\\n \\t\\t\\t\\t//Vertices v1=new Vertices(e[0]-1);\\r\\n \\t\\t\\t\\t//Vertices v2=new Vertices(e[1]-1);\\r\\n \\t\\t\\t\\t//if(!vertices.containsKey(e[0]))vertices.put(e[0],v1);\\r\\n \\t\\t\\t\\t//if(!vertices.containsKey(e[1]))vertices.put(e[1],v2);\\r\\n \\t\\t\\t\\tedges.add(new Edge(e[0]-1,e[1]-1));\\r\\n \\t\\t\\t}\\r\\n \\t\\t\\t/*for(Integer v: vertices.keySet()){\\r\\n \\t\\t\\t\\tVertices vertex=vertices.get(v);\\r\\n \\t\\t\\t\\t//vertex.setIncident(new LinkedList<Edge>());\\r\\n \\t\\t\\t\\t/*for(Edge e :edges){\\r\\n \\t\\t\\t\\t\\tif(e.getStart()==v||e.getEnd()==v){\\r\\n \\t\\t\\t\\t\\t\\tvertex.getIncident().add(e);\\r\\n \\t\\t\\t\\t\\t}\\r\\n \\t\\t\\t\\t}*/\\r\\n \\t\\t\\t\\t\\r\\n \\t\\t\\t//}\\r\\n \\t\\t}\\r\\n\\t\\t\\tpublic void BFS(int s) {\\r\\n\\t\\t\\t\\t/*for(Edge e:edges){\\r\\n\\t\\t\\t\\t\\te.setLabel(\\\"U\\\");\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tfor(Integer v: vertices.keySet()){\\r\\n \\t\\t\\t\\tVertices vertex=vertices.get(v);\\r\\n \\t\\t\\t\\tvertex.setLabel(\\\"U\\\");\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}*/\\r\\n\\t\\t\\t\\t/*for(Integer v: vertices.keySet()){\\r\\n\\t\\t\\t\\t\\tVertices vertex=vertices.get(v);\\r\\n\\t\\t\\t\\t\\tif(vertex.getLabel().equals(\\\"U\\\"))BFS(vertex);\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t}*/\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tBFS(s-1,vertices);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tpublic void BFS(int s, HashMap<Integer,Vertices> vertices2) {\\r\\n\\t\\t\\t\\tVertices vertex=vertices.get(s);\\r\\n\\t\\t\\t\\tList<Integer> L=new ArrayList<Integer>();\\r\\n\\t\\t\\t\\tint count=0;\\r\\n\\t\\t\\t\\tvertex.setLength(count);\\r\\n\\t\\t\\t\\tL.add(s);\\r\\n\\t\\t\\t\\tvertex.setLabel(1);\\r\\n\\t\\t\\t\\tint counter=0;\\r\\n\\t\\t\\t\\tint temp=vertex.getLength();\\r\\n\\t\\t\\t\\twhile(!L.isEmpty()){\\r\\n\\t\\t\\t\\t\\tint test=L.get(0);\\r\\n\\t\\t\\t\\t\\tVertices v=vertices.get(test);\\r\\n\\t\\t\\t\\t\\tcounter++;\\r\\n\\t\\t\\t\\t\\tif(temp!=v.getLength())count++;\\r\\n\\t\\t\\t\\t\\ttemp=v.getLength();\\r\\n\\t\\t\\t\\t\\tL.remove(0);\\r\\n\\t\\t\\t\\t\\t//if((v.getLength()-1==count))count++;\\r\\n\\t\\t\\t\\t\\t//List<Edge> li= v.getIncident();\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t//\\tfor(Edge e:li){\\r\\n\\t\\t\\t\\t\\t//for(int k = 0;k<li.size();k++){\\r\\n\\t\\t\\t\\t\\t\\t\\t//count++;\\r\\n\\t\\t\\t\\t\\tint counterb=0;\\r\\n\\t\\t\\t\\t\\t\\tfor(Edge e :edges){\\r\\n\\t \\t\\t\\t\\t\\tif(e.getStart()==test||e.getEnd()==test){\\r\\n\\t \\t\\t\\t\\t\\t\\tcounterb++;\\r\\n\\t \\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t //e=li.get(k);\\r\\n\\t\\t\\t\\t\\t\\t\\tif(e.getLabel()==0){\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tint oppo=e.opposite(test);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tVertices w=vertices.get(e.opposite(test));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tif(w.getLabel()==0){\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\te.setLabel(2);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tw.setLabel(1);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tL.add(oppo);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tw.setLength(count+1);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t//count--;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\telse {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\te.setLabel(3);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t//count--;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t//count--;\\r\\n\\t\\t\\t\\t\\t\\t\\t}//count--;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t \\t\\t\\t\\t\\t}//if(k==li.size()-1)count++;\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"counterb: \\\"+counterb);\\r\\n\\t\\t\\t\\t\\t\\t//if((v.getLength()-1==count))\\r\\n\\t\\t\\t\\t\\t\\t//count++;\\r\\n\\t\\t\\t\\t } //end while\\r\\n\\t\\t\\t\\tSystem.out.println(\\\"Counter:\\\");\\r\\n\\t\\t\\t\\tSystem.out.println(counter);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tpublic void out(int s,int m) {\\r\\n\\t\\t\\t\\tVertices main=vertices.get(s-1);\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tfor(int i=0;i<m;i++){\\r\\n\\t\\t\\t\\t\\tVertices vertex=vertices.get(i);\\r\\n\\t\\t\\t\\tif(vertex!=main){\\r\\n\\t\\t\\t\\t\\tif(vertex.length!=-1)\\r\\n\\t\\t\\t\\t\\tSystem.out.printf(\\\"%d \\\",vertex.getLength()*6);\\r\\n\\t\\t\\t\\t/*{\\toutput.append(vertex.getLength()*6);\\r\\n\\t\\t\\t\\t\\toutput.append(\\\" \\\");\\r\\n\\t\\t\\t\\t}*/\\r\\n\\t\\t\\t\\telse System.out.printf(\\\"-1 \\\");\\r\\n\\t\\t\\t\\t\\t//output.append(\\\"-1 \\\");\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t//System.out.printf(\\\"-1 \\\");\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t/*for(Integer v: vertices.keySet()){\\r\\n\\t\\t\\t\\t\\tVertices vertex=vertices.get(v);\\r\\n\\t\\t\\t\\t\\tif(vertex!=main)\\r\\n\\t\\t\\t\\t\\tSystem.out.printf(\\\"%d \\\",vertex.getLength()*6);\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t}*/\\r\\n\\t\\t\\t}\\r\\n \\t}\\r\\n \\t\\r\\n \\t\\r\\n \\t/*********************************************************************************\\r\\n \\t * \\r\\n \\t * \\r\\n \\t * \\r\\n \\t * \\r\\n \\t * \\r\\n \\t * \\r\\n \\t * \\r\\n \\t * \\r\\n \\t */\\r\\n \\tlong endTime = System.nanoTime();\\r\\n \\tSystem.out.println(\\\"Create classes time\\\");\\r\\n \\tSystem.out.println(startTime-endTime);\\r\\n \\t\\r\\n \\tScanner in =new Scanner(System.in);\\r\\n \\tint q=in.nextInt();\\r\\n \\t//StringBuilder[] output=new StringBuilder[q];\\r\\n \\t\\r\\n \\tfor(int ii=0;ii<q;ii++)\\r\\n \\t{\\r\\n \\t\\t\\r\\n \\t\\t//output[ii]=new StringBuilder();\\r\\n \\t\\tint verticeCount=in.nextInt();\\r\\n \\t\\tint edgeCount=in.nextInt();\\r\\n \\t\\t\\r\\n \\t\\tint[][] edges=new int[edgeCount][2];\\r\\n \\t\\t\\r\\n \\t\\tfor (int j=0;j<edgeCount;j++){\\r\\n \\t\\t\\t\\r\\n \\t\\t\\tedges[j][0]=in.nextInt();\\r\\n \\t\\t\\tedges[j][1]=in.nextInt();\\r\\n \\t\\t\\t\\r\\n \\t\\t\\t\\r\\n \\t\\t}\\r\\n \\t\\tint s=in.nextInt();\\r\\n \\t\\t//in.close();\\r\\n \\t\\tGraph G=new Graph(edges,verticeCount);\\r\\n \\t\\tG.BFS(s);\\r\\n \\t\\t\\r\\n \\t\\tG.out(s,verticeCount);\\r\\n \\t\\tSystem.out.println();\\r\\n \\t\\tG=null;\\r\\n \\t\\t\\r\\n \\t}\\r\\n \\tin.close();\\r\\n \\t/*for (int ii=0;ii<q;ii++){\\r\\n \\t\\tSystem.out.println(output[ii].toString());\\r\\n \\t}*/\\r\\n \\tlong TendTime = System.nanoTime();\\r\\n \\tSystem.out.println(\\\"Exectuion time total is : \\\");\\r\\n \\tSystem.out.println(TendTime-startTime);\\r\\n \\t\\r\\n \\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0c0f445b3a4c919114c8c905efe25cb8\",\n \"score\": \"0.6180038\",\n \"text\": \"public ArrayList<Edge<T>> dijsktra(Vertex<T> entry, Vertex<T> goal){\\n if(entry == null || goal == null){\\n throw new NullPointerException(\\\"entry or goal vertex was not found! Error in: graph.dijkstra\\\");\\n }\\n\\n // assign a number to each vertex\\n assignIndexToVertices();\\n\\n for(Vertex<T> v:vertices){\\n // a false value here is equal to setting the vertexDistances-value to infinity\\n v.placeholderInitialized = false;\\n }\\n\\n boolean[] visited = new boolean[vertices.size()];\\n\\n QuickAccessHeapTree<Vertex<T>> toProcess = new QuickAccessHeapTree<>((a, b) -> a.placeholder-b.placeholder<0?-1:a.placeholder-b.placeholder>0?1:0);\\n toProcess.add(entry);\\n entry.placeholderInitialized = true;\\n\\n while (!toProcess.isEmpty()){\\n // pops the smallest element\\n Vertex<T> vertex = toProcess.popMin();\\n\\n // mark the current vertex as visited\\n visited[vertex.index] = true;\\n\\n if(vertex.equals(goal)){\\n return getShortestPath(entry, goal);\\n }\\n\\n for(Edge<T> e: vertex.getOutgoingEdges()){\\n Vertex<T> w = e.getEnd();\\n if(!visited[w.index]){\\n toProcess.add(w);\\n visited[w.index] = true;\\n }\\n if(w.placeholder > vertex.placeholder + e.getWeight() || !w.placeholderInitialized){\\n w.placeholder = vertex.placeholder + e.getWeight();\\n toProcess.updateKey(w);\\n // after the first time that we assign a shortest distance value to a vertex, mark it as initialized\\n // so we don't treat it as if it had a distance value of infinity\\n w.placeholderInitialized = true;\\n }\\n }\\n\\n }\\n\\n System.out.println(\\\"We reached the goal (\\\" + goal.getItem().toString() + \\\") with a length of \\\" + goal.placeholder);\\n\\n return null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2b95d1602d722735eeb30125ace389c2\",\n \"score\": \"0.61353576\",\n \"text\": \"@Test\\n public void dijkstraPathsTest() {\\n int n = 7;\\n int m = 6;\\n Graph g = new GridGenerator<>(MemoryGraph.class, n, m).create();\\n\\n Map<VertexPair, Double> distFloyd = FloydWarshall.execute(g);\\n\\n VertexPair largestPair = distFloyd.keySet().iterator().next();\\n double largestDistance = 0.0;\\n for (VertexPair e : distFloyd.keySet()) {\\n if (distFloyd.get(e) > largestDistance) {\\n largestDistance = distFloyd.get(e);\\n largestPair = e;\\n }\\n }\\n\\n Map<Vertex, Collection<VertexSequence>> r = Dijkstra.executeWithPath(g, largestPair.getSource());\\n int num = r.get(largestPair.getTarget()).size();\\n\\n Assert.assertEquals(\\\"dijkstraPathsTest\\\", LongMath.binomial(n + m - 2, n - 1), num);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6940c125ac303fe4c76afcae143870be\",\n \"score\": \"0.6099519\",\n \"text\": \"public void dijkstra( String startName )\\r\\n {\\r\\n PriorityQueue<Path> pq = new PriorityQueue<Path>( );\\r\\n\\r\\n Vertex start = vertexMap.get( startName );\\r\\n if( start == null )\\r\\n return;\\r\\n\\r\\n clearAll( );\\r\\n pq.add( new Path( start, 0 ) ); start.dist = 0;\\r\\n \\r\\n int nodesSeen = 0;\\r\\n while( !pq.isEmpty( ) && nodesSeen < vertexMap.size( ) )\\r\\n {\\r\\n Path vrec = pq.remove( );\\r\\n Vertex v = vrec.dest;\\r\\n if( v.scratch != 0 ) // already processed v\\r\\n continue;\\r\\n \\r\\n v.scratch = 1;\\r\\n nodesSeen++;\\r\\n\\r\\n for( Edge e : v.adj )\\r\\n {\\r\\n Vertex w = e.dest;\\r\\n double cvw = e.cost;\\r\\n \\r\\n if( cvw < 0 ){\\r\\n System.out.println(\\\"Graph has negative edges\\\" );\\r\\n break;\\r\\n }\\r\\n \\r\\n /*System.out.println(\\\" \\\");\\r\\n System.out.println(\\\"start \\\" + v.name);\\r\\n System.out.println(\\\"dest \\\" + w.name);\\r\\n System.out.println(\\\"w.dist \\\" + w.dist);\\r\\n System.out.println(\\\"v.dist + cvw\\\" + (v.dist+cvw));*/\\r\\n if( w.dist > v.dist + cvw )\\r\\n {\\r\\n w.dist = v.dist +cvw;\\r\\n w.prev = v;\\r\\n pq.add( new Path( w, w.dist ) );\\r\\n if(v.multiple == true){\\r\\n w.multiple = true;\\r\\n //System.out.println(w.name + \\\" MULTIPLE\\\");\\r\\n }\\r\\n }else if ((w.dist == v.dist + cvw)){\\r\\n //System.out.println(w.name + \\\" multiple\\\");\\r\\n w.multiple = true;\\r\\n w.scratch=0;\\r\\n }\\r\\n }\\r\\n }\\r\\n \\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4dee0b2757d8583e73b007c03936508b\",\n \"score\": \"0.60398144\",\n \"text\": \"private FastestRoute(ArrayList<Integer>[] adjList, ArrayList<Integer>[] costList)\\r\\n\\t{\\r\\n\\t\\tadj = adjList;\\r\\n\\t\\tcost = costList;\\r\\n\\t\\tnodes = new Vertex[adjList.length]; // after we instantiate the 'nodes' we have to populate it with the 'Vertex' objects with default values\\r\\n\\t\\tfor (int i = 0; i < nodes.length; i++)\\r\\n\\t\\t\\tnodes[i] = new Vertex();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e9c8a392d62ffb7f06d801f91b92f78c\",\n \"score\": \"0.60386723\",\n \"text\": \"public ArrayList<Integer>[][] calculShortestPaths(int size,ArrayList<Pair> liens) {\\n\\t\\tArrayList<Integer>[][] paths= new ArrayList[size][size];\\n\\t\\t//initialiser paths\\n\\t\\tfor (int i=0;i<size;i++) {\\n\\t\\t\\tfor (int j=0;j<size;j++) {\\n\\t\\t\\t\\tArrayList<Integer> l = new ArrayList<Integer>() ;\\n\\t\\t\\t\\tl.add(j);\\n\\t\\t\\t\\tpaths[i][j] = l; \\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t//\\t\\tInitialisation de matrice d'adjacence\\n\\t\\tdouble[][] m = new double[size][size];\\n\\t\\tfor(Pair pair : liens) {\\n\\t\\t\\tm[pair.p1][pair.p2] = 1;\\n\\t\\t\\tm[pair.p2][pair.p1] = 1;\\n\\t\\t}\\n\\n\\t\\tfor(int i =0;i<size;i++) {\\n\\t\\t\\tfor (int j=0;j<size;j++) {\\n\\t\\t\\t\\tif(i == j) m[i][j] = 0;\\n\\t\\t\\t\\tif(m[i][j]!=1)\\n\\t\\t\\t\\t\\tm[i][j]= Double.MAX_VALUE;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t// calculer les plus courts chemins\\n\\t\\tfor(int k = 0 ; k< size;k++) {\\n\\t\\t\\tfor(int i = 0 ; i< size;i++) {\\n\\t\\t\\t\\tfor(int j = 0 ; j<size;j++) {\\n\\n\\t\\t\\t\\t\\tif(i == j) continue;\\n\\t\\t\\t\\t\\tif(m[i][j]> m[i][k]+m[k][j]) {\\n\\t\\t\\t\\t\\t\\tm[i][j]= m[i][k]+m[k][j];\\n\\t\\t\\t\\t\\t\\tpaths[i][j]= paths[i][k];\\n\\t\\t\\t\\t\\t} \\n\\t\\t\\t\\t\\tif(m[i][j] == m[i][k]+m[k][j]) {\\n\\t\\t\\t\\t\\t\\tArrayList<Integer> list = (ArrayList<Integer>) paths[i][k].clone();\\n\\t\\t\\t\\t\\t\\tfor(int path:paths[i][j]) {\\n\\t\\t\\t\\t\\t\\t\\tif(!list.contains(path))\\n\\t\\t\\t\\t\\t\\t\\t\\tlist.add(path);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tpaths[i][j]=list;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t} \\t \\t \\t\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\n\\t\\treturn paths;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b404b58f1ad5e4973bfff677f914b4e2\",\n \"score\": \"0.5967858\",\n \"text\": \"private static void shortestPath(ArrayList<ArrayList<Integer>> adj, int v) {\\n\\t\\t\\n\\t\\tInteger[] distance=new Integer[v+1];\\n\\t\\tfor(int i=0;i< distance.length;i++)\\n\\t\\t{\\n\\t\\t\\tdistance[i]=9999;\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t\\tint src=0;\\n\\t\\tqueue1.add(src);\\n\\t\\tdistance[src]=0;\\n\\t\\twhile(queue1.size()>0)\\n\\t\\t{\\n\\t\\t\\tint elem=queue1.poll();\\n\\t\\t\\tfor(int i: adj.get(elem))\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(distance[i] > distance[elem]+1)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tdistance[i]=distance[elem]+1;\\n\\t\\t\\t\\t\\tqueue1.add(i);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tSystem.out.println(distance[3]);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"60977617e463fa0ade45c260e301f6e3\",\n \"score\": \"0.5959473\",\n \"text\": \"void dijkstra(int graph[][], HashMap hm, int src, int dest)\\n {\\n int dist[] = new int[V]; // The output array. dist[i] will hold\\n \\n int path[] = new int[V]; // the shortest distance from src to i path.\\n \\n // sptSet[i] will true if vertex i is included in shortest\\n // path tree or shortest distance from src to i is finalized\\n Boolean sptSet[] = new Boolean[V];\\n \\n // Initialize all distances as INFINITE and stpSet[] as false\\n for (int i = 0; i < V; i++)\\n {\\n dist[i] = Integer.MAX_VALUE;\\n sptSet[i] = false;\\n }\\n \\n // Distance of source vertex from itself is always 0\\n dist[src] = 0;\\n path[src] = src;\\n \\n // Find shortest path for all vertices\\n for (int count = 0; count < V-1; count++)\\n {\\n // Pick the minimum distance vertex from the set of vertices\\n // not yet processed. u is always equal to src in first\\n // iteration.\\n int u = minDistance(dist, sptSet);\\n if(u == dest)break; // If the Destination is reached, break the for loop.\\n \\n // Mark the picked vertex as processed\\n sptSet[u] = true;\\n \\n // Update dist value of the adjacent vertices of the\\n // picked vertex.\\n for (int v = 0; v < V; v++)\\n \\n // Update dist[v] only if is not in sptSet, there is an\\n // edge from u to v, and total weight of path from src to\\n // v through u is smaller than current value of dist[v]\\n if (!sptSet[v] && graph[u][v]!=0 &&\\n dist[u] != Integer.MAX_VALUE &&\\n dist[u]+graph[u][v] < dist[v]){\\n dist[v] = dist[u] + graph[u][v];\\n \\tpath[v] = u;\\n }\\n }\\n \\n // print the constructed distance array\\n printSolution(dist, path, V, src, dest, hm);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"672f486c02ed9462512ddfb7ced33aec\",\n \"score\": \"0.5895148\",\n \"text\": \"@Override\\n public List<node_info> shortestPath(int src, int dest) {\\n if(src==dest){\\n List<node_info> r = new LinkedList<>();\\n r.add(_graph.getNode(src));\\n return r;\\n }\\n\\n int[] pointToKey = ((WGraph_DS)_graph).toKeyArray();// can improve by O(n)\\n HashMap<Integer,Integer> keyToPoint = new HashMap<>();\\n double[] distance = new double[pointToKey.length];\\n boolean[] was = new boolean[pointToKey.length];\\n int[] comeFromKey = new int[pointToKey.length];\\n for (int i = 0; i < pointToKey.length; i++) { //initialisation\\n keyToPoint.put(pointToKey[i],i);\\n distance[i] = Double.MAX_VALUE;\\n was[i]=false;\\n comeFromKey[i]=-1;\\n }\\n for (node_info n : _graph.getV(dest) //for the dest\\n ) {\\n distance[keyToPoint.get(n.getKey())]=_graph.getEdge(dest,n.getKey());\\n comeFromKey[keyToPoint.get(n.getKey())] = dest;\\n }\\n was[keyToPoint.get(dest)]=true;\\n\\n boolean thereIsChange = true;\\n int nodePointer = keyToPoint.get(dest);\\n\\n while (thereIsChange) { //pass on all the graph\\n thereIsChange=false;\\n boolean first = true;\\n for (int i = 0; i < pointToKey.length; i++) { //find the min distance and point to it\\n if ((!was[i]&distance[i]<Integer.MAX_VALUE&first)|(!was[i]&distance[i]<distance[nodePointer]&!first)){\\n nodePointer=i;\\n first = false;\\n thereIsChange = true; //there is work to be done\\n }\\n }\\n\\n for (node_info n : _graph.getV(pointToKey[nodePointer]) //neighbors pass\\n ) {\\n if (distance[keyToPoint.get(n.getKey())] > distance[nodePointer] + _graph.getEdge(n.getKey(), pointToKey[nodePointer])&!was[keyToPoint.get(n.getKey())]) {\\n distance[keyToPoint.get(n.getKey())] = distance[nodePointer] + _graph.getEdge(n.getKey(), pointToKey[nodePointer]);\\n comeFromKey[keyToPoint.get(n.getKey())] = pointToKey[nodePointer];\\n }\\n }\\n was[nodePointer] = true;\\n }\\n\\n if (!was[keyToPoint.get(src)])return null;\\n List<node_info> shortestPath = new LinkedList<>();\\n shortestPath.add(_graph.getNode(src));\\n int last = keyToPoint.get(comeFromKey[keyToPoint.get(src)]);\\n if(last==keyToPoint.get(dest)) return shortestPath;\\n while (true){\\n shortestPath.add(_graph.getNode(pointToKey[last]));\\n last = keyToPoint.get(comeFromKey[last]);\\n if(pointToKey[last]==dest)break;\\n }\\n return shortestPath;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"190a397eaee5e5f0ecfb35e7504df8f5\",\n \"score\": \"0.5874963\",\n \"text\": \"public void dijkstra(Integer s){\\n MinHeap fila = new MinHeap();\\n //Set<Vertice> verificado= new HashSet<>();\\n Vertice atual;\\n initMinPath(0);\\n for(int i= 0; i<vertices.size(); i++){\\n fila.insert(getVertice(i));\\n }\\n while(!fila.isEmpty()){\\n atual= fila.extractMin();\\n //verificado.add(atual);\\n if(vertices.get(atual.id) != null) {\\n for (Aresta a : vertices.get(atual.id).getValue()) {\\n relax(atual.id, a.vertice, a.peso, fila);\\n }\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"83e63bf42276aed28426deef15f8a0cf\",\n \"score\": \"0.5864024\",\n \"text\": \"private static void shortestPathDjistra(ArrayList<ArrayList<Pair<Integer, Integer>>> adjWeighted, int v) {\\n\\n\\t\\tInteger[] distance=new Integer[v+1];\\n\\t\\tfor(int i=0;i< distance.length;i++)\\n\\t\\t{\\n\\t\\t\\tdistance[i]=9999;\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\tint src=0;\\n\\t\\tpqueue.add(new Pair(0,0));\\n\\t\\tdistance[src]=0;\\n\\t\\t\\n\\t\\twhile(pqueue.size()>0)\\n\\t\\t{\\n\\t\\tPair elem=pqueue.poll();\\n\\t\\tArrayList< Pair<Integer,Integer>> p=adjWeighted.get((int) elem.getValue());\\n\\t\\tfor(Pair p1: p)\\n\\t\\t{\\n\\t\\t\\tif(distance[(int) p1.getValue()] > distance[(int) elem.getValue()]+1 )\\n\\t\\t\\t{\\n\\t\\t\\t\\tdistance[(int) p1.getValue()]=distance[(int) elem.getValue()]+1;\\n\\t\\t\\t\\tpqueue.add(new Pair(distance[(int) p1.getValue()],p1.getKey()));\\n\\t\\t\\t}\\n\\t\\t\\n\\t\\t}\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\tSystem.out.println(distance[3]);\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7577f9f2a24c195f19620a13fb358e24\",\n \"score\": \"0.58607936\",\n \"text\": \"ArrayList<Node> constructShortestPath() {\\n for (Node n : this.mazeList) {\\n if (n.partOfFinalPath) {\\n shortestPath.add(n);\\n }\\n }\\n\\n return shortestPath;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8e6552de6865c39ce8d63988a7505465\",\n \"score\": \"0.5850537\",\n \"text\": \"public List<Integer> getShortestPath() {\\n\\t\\tDijkstraNode dNode = destDijkstraNode;\\n\\t\\tif (dNode==null) \\n\\t\\t\\treturn null;\\n\\t\\t\\n\\t\\t/**\\n\\t\\t * Generate path in the reverse order\\n\\t\\t */\\n\\t\\tLinkedList<Integer> result = new LinkedList<Integer>();\\n\\t\\tfor(DijkstraNode dn=dNode;dn!=null;){\\n\\t\\t\\tresult.addFirst(dn.getLink().getId());\\n\\t\\t\\tdn = dn.getPrevNode();\\n\\t\\t}\\n\\t\\treturn result;\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9144ee8c19642e360732eb3e808398b3\",\n \"score\": \"0.579003\",\n \"text\": \"Driver ()\\n { \\n dijkstra = new Dijkstra(new Graph().getGraph()); \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"94892c7c06ea9fe39c67bae1fa4bf7e0\",\n \"score\": \"0.57850343\",\n \"text\": \"public Link(Vertex vertex, int index, int distance) // constructor\\n {\\n this.vertex = vertex;\\n this.indexOnArray = index;\\n this.dData = distance;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"998c0bec6b9a18174e0bbc517a8e6a13\",\n \"score\": \"0.5757041\",\n \"text\": \"public Dijkstra(Graph g){\\n this.g = g;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a93a7130d6fd2071f57c4ddba5bd84a4\",\n \"score\": \"0.5754974\",\n \"text\": \"public ShortestPathAlgorithm() { \\r\\n\\t\\tData data = new Data( \\\"null\\\", \\\"null\\\", 0);\\r\\n\\t\\tarrayData.add(data);\\r\\n\\t\\tarrayNode.add(\\\"null\\\");\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7fbc4b78d13e7e3f16a10feb85cd1c50\",\n \"score\": \"0.57027733\",\n \"text\": \"public Graf(){\\n vertexArray = new ArrayList<Vertex>();\\n arestaArray = new ArrayList<Aresta>(); \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7dc56c4f65eccbc81bee7240d33dd161\",\n \"score\": \"0.5684075\",\n \"text\": \"public Vertex() {\\n\\t\\tadjacency = new ArrayList<Integer>();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cf4d4b13ef2d97470fe3eb5a34d41051\",\n \"score\": \"0.56723136\",\n \"text\": \"public BigInteger dijkstra() {\\n\\n\\t\\tboolean[] selected = new boolean[friendships.length];\\n\\t\\tBigInteger[] noise = new BigInteger[friendships.length];\\n\\n\\t\\tQueue<Pair> connected = new PriorityQueue<>();\\n\\n\\t\\tfor (int i = 0; i < friendships.length; i++)\\n\\t\\t\\tnoise[i] = DEFAULT_VAL;\\n\\n\\t\\tfor (int node : friendships[s]) {\\n\\t\\t\\tBigInteger value = new BigInteger(\\\"0\\\");\\n\\t\\t\\tnoise[node] = value;\\n\\t\\t\\tconnected.add(new Pair(node, value));\\n\\t\\t}\\n\\n\\t\\tdo {\\n\\t\\t\\tPair pair = connected.remove();\\n\\t\\t\\tselected[pair.getKey()] = true;\\n\\t\\t\\tif (pair.getKey() == t)\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\texploreNodes(pair, selected, noise, connected);\\n\\n\\t\\t} while (!connected.isEmpty());\\n\\n\\t\\treturn noise[t].mod(MODULE_POW);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5cd897282b7d5e6767cbfc240ce54281\",\n \"score\": \"0.5661883\",\n \"text\": \"public static void main(String[] args) {\\n final int[][] graph = { { 0, 2, 4, Dijkstra.M, Dijkstra.M, Dijkstra.M }, \\n { 2, 0, 1, 4, Dijkstra.M, Dijkstra.M },\\n {4, 1, 0, 2, 6, Dijkstra.M}, {Dijkstra.M, 4, 2, 0, 1, 3}, \\n {Dijkstra.M, Dijkstra.M, 6, 1, 0, 5},\\n {Dijkstra.M, Dijkstra.M, Dijkstra.M, 3, 5, 0 }};\\n Dijkstra d = new Dijkstra(graph);\\n int sp = d.shortestPath(0, 4);\\n System.out.println(\\\"d = \\\" + sp);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a217f4adb3045effe4efd3ecd5cf17ee\",\n \"score\": \"0.562217\",\n \"text\": \"shortestPath() throws IOException, ClassNotFoundException{\\r\\n \\tFile stops, stopTimes, transfers;\\r\\n \\tstops = new File(\\\"stops.txt\\\");\\r\\n \\tstopTimes = new File(\\\"stop_times.txt\\\");\\r\\n \\ttransfers = new File(\\\"transfers.txt\\\");\\r\\n \\t\\r\\n \\t//-1s here, as all input files have a header\\r\\n \\tthis.V = numberOfLines(stops) - 1;\\r\\n \\tint transferEdges = numberOfLines(transfers) - 1;\\r\\n\\r\\n \\tthis.graph = new double[V][V];\\r\\n \\t\\r\\n \\tconversions = new ArrayList<Integer>(V);\\r\\n \\tSystem.out.println(V + \\\" Stops & \\\" + (transferEdges) + \\\" Transfers\\\");\\r\\n \\t\\r\\n \\t// Set all values in graph to Integer.MAX_VALUE, so that Floyd Warshall will work\\r\\n \\tfor(int i = 0; i < V; i++) {\\r\\n \\t\\tfor(int j = 0; j < V; j++) {\\r\\n \\t\\t\\tif(i == j) { graph[i][j] = 0; }\\r\\n \\t\\t\\telse { graph[i][j] = Integer.MAX_VALUE; }\\r\\n \\t\\t}\\r\\n \\t}\\r\\n \\t\\r\\n \\t// Generating translation key from stop id to index in graph\\r\\n \\tScanner stopScanner;\\r\\n \\ttry {\\r\\n \\t\\tstopScanner = new Scanner(stops);\\r\\n \\t} catch (FileNotFoundException e) {\\r\\n \\t\\te.printStackTrace();\\r\\n \\t\\treturn;\\r\\n \\t}\\r\\n \\tstopScanner.useDelimiter(\\\",\\\");\\r\\n \\tstopScanner.nextLine(); // dump headers\\r\\n \\tfor(int i = 0; i < V; i++) {\\r\\n \\t\\tint stopID = (int) stopScanner.nextDouble();\\r\\n \\t\\tconversions.add(stopID);\\r\\n \\t\\tstopScanner.nextLine();\\r\\n \\t}\\r\\n \\t\\r\\n \\tstopScanner.close();\\r\\n \\t\\r\\n \\t//TODO: assign Stops & Edges to the graph\\r\\n \\t// stop numbers will have to be assigned to integers, and reconverted at the end\\r\\n \\t\\r\\n \\tScanner tranScanner;\\r\\n\\t\\ttry {\\r\\n\\t\\t\\ttranScanner = new Scanner(transfers);\\r\\n\\t\\t} catch (FileNotFoundException e) {\\r\\n\\t\\t\\te.printStackTrace();\\r\\n\\t\\t\\treturn;\\r\\n\\t\\t}\\r\\n \\t//Assigning costs of all edges defined in transfers.txt\\r\\n\\t\\ttranScanner.nextLine(); // dump headers\\r\\n\\t\\ttranScanner.useDelimiter(\\\",\\\");\\r\\n \\tfor(int i = 0; i < transferEdges; i++) {\\r\\n \\t\\tint from = conversions.indexOf(Integer.parseInt(tranScanner.next()));\\r\\n \\t\\tint to = conversions.indexOf(Integer.parseInt(tranScanner.next()));\\r\\n \\t\\tint transType = (int) tranScanner.nextDouble();\\r\\n \\t\\tif(transType == 2) {\\r\\n \\t\\t\\tgraph[from][to] = ((conversions.indexOf(Integer.parseInt(tranScanner.nextLine().replace(',', ' ').trim()))) / 100.0);\\r\\n \\t\\t}\\r\\n \\t\\telse if(transType == 0) {\\r\\n \\t\\t\\tgraph[from][to] = 2;\\r\\n \\t\\ttranScanner.nextLine();\\r\\n \\t\\t}\\r\\n \\t\\telse {\\r\\n \\t\\t\\tSystem.out.println(\\\"INVALID transfer_type: \\\" + transType);\\r\\n \\t\\t\\ttranScanner.close();\\r\\n \\t\\t\\treturn;\\r\\n \\t\\t}\\r\\n \\t}\\r\\n \\ttranScanner.close();\\r\\n \\tScanner timeScanner;\\r\\n \\ttry {\\r\\n \\t\\ttimeScanner = new Scanner(stopTimes);\\r\\n \\t} catch (FileNotFoundException e) {\\r\\n \\t\\te.printStackTrace();\\r\\n \\t\\treturn;\\r\\n \\t}\\r\\n \\t//Assigning costs of all edges defined in stop_times.txt\\r\\n\\t\\ttimeScanner.nextLine();\\r\\n \\t\\r\\n \\tString[] line1 = timeScanner.nextLine().split(\\\",\\\");\\r\\n\\t\\tString[] line2 = timeScanner.nextLine().split(\\\",\\\");\\r\\n\\t\\r\\n \\twhile(timeScanner.hasNextLine()) {\\r\\n \\t\\tif(Integer.parseInt(line1[0]) == Integer.parseInt(line2[0])) {\\r\\n \\t\\t\\tint from = conversions.indexOf(Integer.parseInt(line1[3]));\\r\\n \\t\\t\\tint to = conversions.indexOf(Integer.parseInt(line2[3]));\\r\\n \\t\\t\\tgraph[from][to] = 1;\\r\\n \\t\\t}\\r\\n \\t\\tline1 = line2;\\r\\n \\t\\tline2 = timeScanner.nextLine().split(\\\",\\\");\\r\\n \\t} \\t\\r\\n \\ttimeScanner.close();\\r\\n \\t\\r\\n \\tthis.paths = new int[V][V];\\r\\n \\tfor(int i = 0; i < V; i++) {\\r\\n \\t\\tfor(int j = 0; j < V; j++) {\\r\\n \\t\\t\\tpaths[i][j] = j;\\r\\n \\t\\t}\\r\\n \\t}\\r\\n \\tFile graphFile = new File(\\\"graph.txt\\\");\\r\\n \\tFile pathsFile = new File(\\\"paths.txt\\\");\\r\\n \\tif (graphFile.exists() && pathsFile.exists())\\r\\n \\t{\\r\\n \\t\\tSystem.out.println(\\\"retrieving graph files...\\\");\\r\\n \\t\\tObjectInputStream inputStream = new ObjectInputStream(new FileInputStream(\\\"graph.txt\\\"));\\r\\n \\t\\tgraph = (double[][])inputStream.readObject();\\r\\n \\t\\tinputStream.close();\\r\\n \\t\\tinputStream = new ObjectInputStream(new FileInputStream(\\\"paths.txt\\\"));\\r\\n \\t\\tpaths = (int[][])inputStream.readObject();\\r\\n \\t\\tinputStream.close();\\r\\n \\t\\tSystem.out.println(\\\"graph files retrieved\\\");\\r\\n \\t} else {\\r\\n\\t \\tSystem.out.println(\\\"Warshalling Floyds...\\\");\\r\\n\\t \\tfor (int k = 0; k < V; k++)\\r\\n\\t \\t{\\r\\n\\t \\t\\tif(k % 100 == 0) {System.out.println(k + \\\" / \\\" + V); }\\r\\n\\t \\tfor (int i = 0; i < V; i++)\\r\\n\\t \\t{\\r\\n\\t \\t\\tfor (int j = 0; j < V; j++)\\r\\n\\t {\\r\\n\\t \\t\\t\\tif (graph[i][k] + graph[k][j] < graph[i][j]) {\\r\\n\\t \\t\\t\\t\\tgraph[i][j] = graph[i][k] + graph[k][j]; // Cost(i to j) now Cost(i to k) + Cost(k to j) \\r\\n\\t \\t\\t\\t\\tpaths[i][j] = k; //Path from (i to j), now goes (i to k to j)\\r\\n\\t \\t\\t\\t}\\r\\n\\t }\\r\\n\\t }\\r\\n\\t }\\r\\n\\t \\tSystem.out.println(\\\"Floyds Wharshalled!\\\");\\r\\n\\t \\t\\r\\n\\t \\tSystem.out.println(\\\"generating files...\\\");\\r\\n\\t \\tObjectOutputStream outputStream = new ObjectOutputStream(new FileOutputStream(\\\"graph.txt\\\"));\\r\\n\\t \\toutputStream.writeObject(graph);\\r\\n\\t \\toutputStream.close();\\r\\n\\t \\toutputStream = new ObjectOutputStream(new FileOutputStream(\\\"paths.txt\\\"));\\r\\n\\t \\toutputStream.writeObject(paths);\\r\\n\\t \\toutputStream.close();\\r\\n\\t \\tSystem.out.println(\\\"files generated\\\");\\r\\n \\t}\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fbff13ebdc20ec4a5eb2d696d4bbcd88\",\n \"score\": \"0.5618457\",\n \"text\": \"private static <T> void initShortestPath(WGraph<T> graph, T start, int limit, HashMap<Pair<T, Integer>, Double> dist, PriorityQueue<Pair<T,Integer>> priQueue) {\\n\\tPair<T, Integer> p = new Pair<T, Integer>(start, 0);\\n\\n\\tdist.put(p, 0.0);\\n\\tfor(int i=1; i <= limit; i++) {\\n\\t p = new Pair<T,Integer>(start, i);\\n\\t dist.put(p, Double.POSITIVE_INFINITY);\\n\\t}\\n\\n\\tfor ( T vertex : graph.getVertices() ) {\\n\\t for(int i=0; i <= limit; i++) {\\n\\t\\tp = new Pair<T, Integer>(vertex, i);\\n\\t\\tif( !vertex.equals(start) )\\n\\t\\t dist.put(p, Double.POSITIVE_INFINITY);\\n\\t\\tpriQueue.add( p, dist.get(p));\\n\\t }\\n\\t}\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6d61552e38ce83daa6055e5e8a6485aa\",\n \"score\": \"0.5616366\",\n \"text\": \"void dijkstra(int graph[][], int src)\\n {\\n ArrayList<Integer> distList = new ArrayList<Integer>(V);\\n Set<Integer> spSet = new HashSet<Integer>();\\n\\n for(int i=0;i < V; i++) {\\n distList.add(Integer.MAX_VALUE);\\n }\\n distList.set(src, 0);\\n\\n for(int j=0; j< V ; j++) {\\n int nextV = minDistance(spSet, distList);\\n spSet.add(nextV);\\n\\n for (int i = 0; i < V; i++) {\\n if (!spSet.contains(i) &&\\n graph[nextV][i] != 0 &&\\n distList.get(nextV) + graph[nextV][i] < distList.get(i)) {\\n distList.set(i, distList.get(nextV) + graph[nextV][i]);\\n }\\n }\\n }\\n // print the constructed distance array\\n printSolution(distList, V);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a7eff1f5b044dff5b9f5b2175a0129e0\",\n \"score\": \"0.5603963\",\n \"text\": \"public void dijkstra(int start, int end) {\\n long tempoInicial = System.currentTimeMillis();\\n \\n No inicio = nos.get(start);\\n No fim = nos.get(end);\\n \\n inicio.setCustoMinimo(0); //O inicio tem custo 0\\n\\n List<No> nosAbertos = new ArrayList<>(); //Lista de nós abertos\\n\\n //Popula a lista com todos os nós abertos\\n for (No no : nos) {\\n nosAbertos.add(no);\\n }\\n\\n No atual = inicio; //Nó em que estamos atualmente\\n\\n //Encontra os caminhos mínimos dos nós a partir da origem\\n while (!nosAbertos.isEmpty()) {\\n for (Aresta aresta : atual.getAdjacentes()) { //Calcula o custo para todos os nós adjacentes\\n int novoCusto = atual.getCustoMinimo() + aresta.getCusto();\\n int antigoCusto = aresta.getDestino().getCustoMinimo();\\n \\n if (novoCusto < antigoCusto) {\\n aresta.getDestino().setCustoMinimo(novoCusto); //Altera o custo mínimo de um nó\\n aresta.getDestino().setAntecessor(atual); //Define o nó antecessor\\n }\\n }\\n\\n atual.setEstadoNo(EstadoNo.FECHADO); //Fecha o nó atual\\n nosAbertos.remove(atual); //Remove o nó atual da lista de nós abertos\\n Collections.sort(nosAbertos); //Ordena a lista de nós abertos\\n if (!nosAbertos.isEmpty()) {\\n atual = nosAbertos.get(0); //Pega o nó com o menos custo\\n }\\n }\\n long tempoFinal = System.currentTimeMillis();\\n long tempoTotal = tempoFinal - tempoInicial;\\n\\n //Constroi o menor caminho da origem até o destino\\n Stack<No> caminhoMinimo = new Stack<>(); //Uma pilha para montar o caminha mínimo do fim para o inicio\\n caminhoMinimo.addElement(fim); //Adiciona o fim ao caminho minimo\\n\\n atual = fim; //Começa pelo fim\\n while (!atual.equals(inicio)) { //Se repete até voltarmos ao início\\n atual = atual.getAntecessor();\\n caminhoMinimo.addElement(atual);\\n }\\n int count = caminhoMinimo.size();\\n //Exibe todos os nós na pilha de caminho mínimo\\n while (!caminhoMinimo.empty()) {\\n atual = caminhoMinimo.pop();\\n //System.out.println(\\\"NO:\\\" + atual.getId());\\n }\\n \\n resetGrafo();\\n \\n System.out.println(\\\"COM HEAP\\\");\\n System.out.println(\\\"\\\\nTAMANHO: \\\" + count);\\n System.out.println(\\\"TEMPO: \\\" + tempoTotal+\\\"ms\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"31abe4bf63a724ee3df0634bf06a588c\",\n \"score\": \"0.5603942\",\n \"text\": \"public static void main(String[] args) throws IOException{\\n \\n\\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\\n List<List<Node>> graph = new ArrayList<List<Node>>();\\n \\n String[] temp = br.readLine().split(\\\" \\\");\\n int n = Integer.parseInt(temp[0]);\\n int m = Integer.parseInt(temp[1]);\\n int k = Integer.parseInt(temp[2]);\\n for(int i = 0 ; i < n ; i++){\\n graph.add(new ArrayList<Node>());\\n for(int j = 0 ; j < MAXFISH ; j++){\\n optimal_cost[i][j] = Integer.MAX_VALUE/2;\\n \\n }\\n }\\n\\n for(int i = 0; i < n; i++){\\n String[] temp1 = br.readLine().split(\\\" \\\") ;\\n int no_fish_type = Integer.parseInt(temp1[0]);\\n for(int j = 1; j <=no_fish_type ; j++){\\n int fish_type = Integer.parseInt(temp1[j]);\\n gathered[i] = gathered[i] | 1 << (fish_type-1);\\n \\n }\\n }\\n /*for(int i=0;i<n;i++){\\n System.out.println(gathered[i]);\\n }*/\\n for(int i = 0; i < m ; i++){\\n String[] temp2 = br.readLine().split(\\\" \\\");\\n int from = Integer.parseInt(temp2[0]);\\n int to = Integer.parseInt(temp2[1]);\\n int cost = Integer.parseInt(temp2[2]);\\n graph.get(from-1).add(new Node(to-1 , cost));\\n graph.get(to-1).add(new Node(from-1 , cost));\\n \\n }\\n /*for(int i = 0 ; i < n ; i++){\\n for(Node node:graph.get(i)){\\n System.out.println(i+ \\\" \\\"+ node.dest + \\\" \\\" + node.cost);\\n }\\n }*/\\n dijkstra(graph,0);\\n \\n int ans = Integer.MAX_VALUE;\\n for(int i = 0 ; i < (1 << k) ; i++){\\n for(int j = i ; j < (1 << k) ; j++){\\n if((i|j) == (1 << k) - 1){\\n int val = Math.max(optimal_cost[n-1][i],optimal_cost[n-1][j]);\\n if(val < ans){\\n ans = val;\\n }\\n }\\n }\\n }\\n System.out.println(ans);\\n \\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cfd4f8b8a3034846e2818e3b971648e9\",\n \"score\": \"0.55916667\",\n \"text\": \"public Algorithm(){\\n sequencePath = new Stack<>();\\n shortestPath = new Stack<>();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8f57e6ead3fce97870d17100dcb2208c\",\n \"score\": \"0.5582919\",\n \"text\": \"private TreeSet<NRoute> getSetOfNPathOfNNearestLinks(int GPSNodeIndex) {\\r\\n\\r\\n\\t\\t// store n nearest links here by creating path for each link\\r\\n\\t\\tTreeSet<NRoute> nRouteSet = new TreeSet<NRoute>();\\r\\n\\r\\n\\t\\t// current minimum found distance\\r\\n\\t\\t// double currentMinDistance = 0;\\r\\n\\r\\n\\t\\t// nRouteSize = nRouteSize *2;\\r\\n\\r\\n\\t\\tdouble arMinDis[] = new double[nRouteSize];\\r\\n\\t\\tmyOSMWayPart arMinWp[] = new myOSMWayPart[nRouteSize];\\r\\n\\r\\n\\t\\tfor (int i = 0; i < nRouteSize; i++) {\\r\\n\\t\\t\\tarMinDis[i] = Double.MAX_VALUE;\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tint count = 0;\\r\\n\\t\\t// search nearest link\\r\\n\\t\\tmyOSMWay w;\\r\\n\\t\\tmyOSMWayPart wp;\\r\\n\\t\\tfor (int wi = 0; wi < myMap.ways.size(); wi++) {\\r\\n\\r\\n\\t\\t\\tw = myMap.ways.get(wi);\\r\\n\\r\\n\\t\\t\\tfor (int wpi = 0; wpi < w.WayParts.length; wpi++) {\\r\\n\\r\\n\\t\\t\\t\\twp = w.WayParts[wpi];\\r\\n\\r\\n\\t\\t\\t\\tdouble distance = Coordinates.getDistance(gpsTrace.getNode(GPSNodeIndex), wp);\\r\\n\\r\\n\\t\\t\\t\\tif (distance < arMinDis[nRouteSize - 1]) {\\r\\n\\t\\t\\t\\t\\tcount++;\\r\\n\\r\\n\\t\\t\\t\\t\\tarMinDis[nRouteSize - 1] = distance;\\r\\n\\t\\t\\t\\t\\tarMinWp[nRouteSize - 1] = wp;\\r\\n\\r\\n\\t\\t\\t\\t\\tfor (int i = nRouteSize - 1; i >= 1; i--) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\tif (arMinDis[i] < arMinDis[i - 1]) {\\r\\n\\t\\t\\t\\t\\t\\t\\tdouble d = arMinDis[i];\\r\\n\\t\\t\\t\\t\\t\\t\\tarMinDis[i] = arMinDis[i - 1];\\r\\n\\t\\t\\t\\t\\t\\t\\tarMinDis[i - 1] = d;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\tmyOSMWayPart wpx = arMinWp[i];\\r\\n\\t\\t\\t\\t\\t\\t\\tarMinWp[i] = arMinWp[i - 1];\\r\\n\\t\\t\\t\\t\\t\\t\\tarMinWp[i - 1] = wpx;\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tfor (int i = 0; i < count && i < nRouteSize; i++) {\\r\\n\\t\\t\\tNRoute nRoute = new NRoute(gpsTrace);\\r\\n\\t\\t\\tnRoute.addLink(arMinWp[i], GPSNodeIndex);\\r\\n\\r\\n\\t\\t\\tnRouteSet.add(nRoute);\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\t/*\\r\\n\\t\\t * // get n nearest links for (int i = 1; i <= nRouteSize; i++) {\\r\\n\\t\\t * \\r\\n\\t\\t * Logger.println(\\\"Starting run nr.\\\" + i + \\\" of \\\" + nRouteSize);\\r\\n\\t\\t * \\r\\n\\t\\t * // save minimum distance and street link during search progress\\r\\n\\t\\t * double minDistance = Double.MAX_VALUE; // StreetLink\\r\\n\\t\\t * nearestStreetLink = null; myOSMWayPart nearestWayPart = null;\\r\\n\\t\\t * \\r\\n\\t\\t * \\r\\n\\t\\t * // search nearest link myOSMWay w; myOSMWayPart wp; for (int wi=0; wi\\r\\n\\t\\t * < myMap.ways.size(); wi++) {\\r\\n\\t\\t * \\r\\n\\t\\t * w = myMap.ways.get(wi);\\r\\n\\t\\t * \\r\\n\\t\\t * for (int wpi=0; wpi < w.WayParts.length; wpi++) {\\r\\n\\t\\t * \\r\\n\\t\\t * wp = w.WayParts[wpi];\\r\\n\\t\\t * \\r\\n\\t\\t * // get distance to street link double distance =\\r\\n\\t\\t * Coordinates.getDistance(gpsTrace.getNode(GPSNodeIndex), wp);\\r\\n\\t\\t * \\r\\n\\t\\t * // check if link is in the run if ((distance < minDistance) &&\\r\\n\\t\\t * (distance > currentMinDistance)) { // save distance and street link\\r\\n\\t\\t * minDistance = distance; nearestWayPart = wp; } } }\\r\\n\\t\\t */\\r\\n\\r\\n\\t\\t/*\\r\\n\\t\\t * for (StreetLink streetLink : streetLinks) {\\r\\n\\t\\t * \\r\\n\\t\\t * // get distance to street link double distance =\\r\\n\\t\\t * Coordinates.getDistance(gpsTrace.getNode(GPSNodeIndex), streetLink);\\r\\n\\t\\t * \\r\\n\\t\\t * // check if link is in the run if ((distance < minDistance) &&\\r\\n\\t\\t * (distance > currentMinDistance)) { // save distance and street link\\r\\n\\t\\t * minDistance = distance; nearestStreetLink = streetLink; } }\\r\\n\\t\\t */\\r\\n\\r\\n\\t\\t/*\\r\\n\\t\\t * // create new path if nearest link was found if (nearestWayPart !=\\r\\n\\t\\t * null) {\\r\\n\\t\\t * \\r\\n\\t\\t * Logger.println(\\\"Found nearest link Nr.\\\" + i);\\r\\n\\t\\t * \\r\\n\\t\\t * // save new current minimum distance currentMinDistance =\\r\\n\\t\\t * minDistance;\\r\\n\\t\\t * \\r\\n\\t\\t * // create new path through adding nearest street link to new n route\\r\\n\\t\\t * container NRoute nRoute = new NRoute(gpsTrace);\\r\\n\\t\\t * nRoute.addLink(nearestWayPart, GPSNodeIndex);\\r\\n\\t\\t * \\r\\n\\t\\t * // add to tree set, gets automatically ordered by score\\r\\n\\t\\t * nRouteSet.add(nRoute); } else { Logger.println(\\\"No nearest link nr. \\\"\\r\\n\\t\\t * + i + \\\" found!\\\"); } }\\r\\n\\t\\t */\\r\\n\\r\\n\\t\\t// return tree set\\r\\n\\t\\treturn nRouteSet;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"362a109c6c87470e68695f0a4bfe14de\",\n \"score\": \"0.5571647\",\n \"text\": \"public int[] singleSourceDijkstra(StateVertex source){\\n\\t\\tint [] dist = new int [getNumVertices()];\\n\\t\\tPriorityQueue<PriorityVertex> queue = new PriorityQueue<PriorityVertex>(10, new PriorityVertexComparator()); //priority by distance\\n\\t\\tArrayList<PriorityVertex> visited = new ArrayList<>();\\n\\t\\tHashMap<StateVertex, Integer> vertexIds = assignIntIDToVertex();\\n\\t\\tint srcID = vertexIds.get(source);\\n\\t\\tdist[srcID] = 0;\\n\\t\\tfor(int i=0; i<dist.length; i++){ \\t\\t//initialize dist: source = 0, others = infinity\\n\\t\\t\\tif(i!=srcID){\\n\\t\\t\\t\\tdist[i] = Integer.MAX_VALUE;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//add all vertices as PriorityVertex to queue\\n\\t\\tfor (Map.Entry<StateVertex, Integer> entry : vertexIds.entrySet()) {\\n\\t\\t\\tStateVertex key = entry.getKey();\\n\\t\\t\\tInteger value = entry.getValue();\\n\\t\\t\\tqueue.add(new PriorityVertex(key, value.intValue(), dist[value.intValue()]));\\n\\t\\t}\\t\\t\\n\\t\\t//dijkstra\\n\\t\\twhile(!queue.isEmpty()){\\n\\t\\t\\tPriorityVertex current = queue.poll();\\n\\t\\t\\tif(!visited.contains(current)){\\n\\t\\t\\t\\tvisited.add(current);\\n\\t\\t\\t\\tTreeSet<StateVertex> currentAdj = adjacencyList.get(current.getVertex());\\n\\t\\t\\t\\tfor (StateVertex v : currentAdj) {\\n\\t\\t\\t\\t\\tint vId = vertexIds.get(v);\\n\\t\\t\\t\\t\\tint currentId = vertexIds.get(current.getVertex());\\n\\t\\t\\t\\t\\tif(dist[currentId]+1<dist[vId]){ //edge weight=1\\n\\t\\t\\t\\t\\t\\tdist[vId] = dist[currentId]+1;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t//update PrirotyVertex distance values in queue. updating in queue itself won't work. \\n\\t\\t\\t//so use a temp to copy everything, then update, clear old queue, then copy back from temp to old queue\\n\\t\\t\\tPriorityQueue<PriorityVertex> temp = new PriorityQueue<>(10, new PriorityVertexComparator());\\n\\t\\t\\ttemp.addAll(queue);\\n\\t\\t\\tfor (PriorityVertex pv : temp) {\\n\\t\\t\\t\\tint id = vertexIds.get(pv.getVertex());\\n\\t\\t\\t\\tpv.setDistance(dist[id]);\\n\\t\\t\\t}\\n\\t\\t\\tqueue.clear();\\n\\t\\t\\tqueue.addAll(temp);\\n\\t\\t}\\n\\t\\treturn dist;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dfc36975600626991908ff7314724c7d\",\n \"score\": \"0.5570134\",\n \"text\": \"public static int[] Dijkstra(ArrayList<Node>[] graph, int startVertex) {\\n int len = graph.length;\\n int[] distArr = new int[len];\\n Arrays.fill(distArr, max_val);\\n\\n PriorityQueue<Node> pq = new PriorityQueue<>();\\n distArr[startVertex] = 0;\\n pq.add(new Node(startVertex, distArr[startVertex]));\\n while (!pq.isEmpty()) {\\n Node node = pq.poll();\\n int id = node.id;\\n int w = node.dist;\\n // reduce loop times\\n if (w > distArr[id]) {\\n continue;\\n }\\n for (Node neighbour : graph[id]) {\\n if (w + neighbour.dist < distArr[neighbour.id]) {\\n distArr[neighbour.id] = w + neighbour.dist;\\n pq.add(new Node(neighbour.id, distArr[neighbour.id]));\\n }\\n }\\n }\\n\\n return distArr;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7077e96f410cad59c19056b9640e1d91\",\n \"score\": \"0.5552254\",\n \"text\": \"void BFS(int src, int dst) {\\n\\t\\tboolean visited[] = new boolean[noOfVertices];\\r\\n\\t\\t\\r\\n\\t\\t// pred[i] array stores predecessor of\\r\\n // i and distance array stores distance of i\\r\\n // from src\\r\\n\\r\\n\\t\\tint dist[] = new int[noOfVertices];\\r\\n\\r\\n\\t\\tint pred[] = new int[noOfVertices];\\r\\n\\r\\n\\t\\tfor (int i = 0; i < noOfVertices; i++) {\\r\\n\\r\\n\\t\\t\\tpred[i] = -1;\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\t// Create a queue for BFS\\r\\n\\t\\tLinkedList<Integer> queue = new LinkedList<Integer>();\\r\\n\\r\\n\\t\\t// Mark the current node as visited and enqueue it\\r\\n\\t\\tvisited[src] = true;\\r\\n\\t\\tdist[src] = 0;\\r\\n\\t\\tqueue.add(src);\\r\\n\\t\\twhile (queue.size() != 0) {\\r\\n\\t\\t\\t// Dequeue a vertex from queue and print it\\r\\n\\t\\t\\tint s = queue.poll();\\r\\n\\t\\t\\t System.out.print(s+\\\" \\\");\\r\\n\\r\\n\\t\\t\\t// Get all adjacent vertices of the dequeued vertex s\\r\\n\\t\\t\\t// If a adjacent has not been visited, then mark it\\r\\n\\t\\t\\t// visited and enqueue it\\r\\n\\t\\t\\tIterator<Integer> i = list[s].listIterator();\\r\\n\\t\\t\\twhile (i.hasNext()) {\\r\\n\\t\\t\\t\\tint n = i.next();\\r\\n\\t\\t\\t\\tif (!visited[n]) {\\r\\n\\t\\t\\t\\t\\tvisited[n] = true;\\r\\n\\t\\t\\t\\t\\tdist[n] = dist[s] + 1;\\r\\n\\t\\t\\t\\t\\tpred[n] = s;\\r\\n\\t\\t\\t\\t\\tqueue.add(n);\\r\\n\\t\\t\\t\\t\\tif (n == dst) {\\r\\n\\t\\t\\t\\t\\t\\tSystem.out.println(Arrays.toString(dist));\\r\\n\\t\\t\\t\\t\\t\\tSystem.out.println(Arrays.toString(pred));\\r\\n\\t\\t\\t\\t\\t\\tLinkedList<Integer> path = new LinkedList<Integer>();\\r\\n\\t\\t\\t\\t\\t\\tint crawl = dst;\\r\\n\\t\\t\\t\\t\\t\\tpath.add(crawl);\\r\\n\\t\\t\\t\\t\\t\\twhile (pred[crawl] != -1) {\\r\\n\\t\\t\\t\\t\\t\\t\\tpath.add(pred[crawl]);\\r\\n\\t\\t\\t\\t\\t\\t\\tcrawl = pred[crawl];\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t// Print distance\\r\\n\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"Shortest path length is: \\\" + dist[dst]);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t// Print path\\r\\n\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"Path is ::\\\");\\r\\n\\t\\t\\t\\t\\t\\tfor (int j = path.size() - 1; j >= 0; j--) {\\r\\n\\t\\t\\t\\t\\t\\t\\tSystem.out.print(path.get(j) + \\\" \\\");\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\treturn;\\r\\n\\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\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d634b5f9c9166543910b6f6222a7234\",\n \"score\": \"0.553761\",\n \"text\": \"public GraphMatrixDirected() {\\n \\tthis.nodes = new ArrayList<Node>();\\t\\t/* Creazione della lista dei nodi vuota */\\n \\tthis.adjmatrix = new ArrayList<ArrayList<AdjacentMatrixElement>>();\\t/* Creazione della matrice di adiacenza vuota */\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1794f707932de96fb51095e4f03cd7fe\",\n \"score\": \"0.55304104\",\n \"text\": \"public Graph() // constructor\\r\\n\\t{\\r\\n\\t\\tvertexList = new Vertex[MAX_VERTS];\\r\\n\\t\\t//adjacency matrix\\r\\n\\t\\tadjMat = new int[MAX_VERTS][MAX_VERTS];\\r\\n\\t\\tnVerts = 0;\\r\\n\\t\\tfor(int j=0; j<MAX_VERTS; j++) // set adjacency\\r\\n\\t\\t\\tfor(int k=0; k<MAX_VERTS; k++) // matrix to 0\\r\\n\\t\\t\\t\\tadjMat[j][k] = INFINITY;\\r\\n\\t\\tthePQ = new PriorityQ();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77a5fd241035122f9cec4924cdabe477\",\n \"score\": \"0.55235994\",\n \"text\": \"@Override\\n public double shortestPathDist(int src, int dest) {\\n if (src==dest) return 0;\\n\\n int[] pointToKey = ((WGraph_DS)_graph).toKeyArray();// can improve by O(n)\\n HashMap<Integer,Integer> keyToPoint = new HashMap<>();\\n double[] distance = new double[pointToKey.length];\\n boolean[] was = new boolean[pointToKey.length];\\n int[] comeFromKey = new int[pointToKey.length];\\n for (int i = 0; i < pointToKey.length; i++) { //initialisation\\n keyToPoint.put(pointToKey[i],i);\\n distance[i] = Double.MAX_VALUE;\\n was[i]=false;\\n comeFromKey[i]=-1;\\n }\\n for (node_info n : _graph.getV(dest) //for the dest\\n ) {\\n distance[keyToPoint.get(n.getKey())]=_graph.getEdge(dest,n.getKey());\\n comeFromKey[keyToPoint.get(n.getKey())] = dest;\\n }\\n was[keyToPoint.get(dest)]=true;\\n\\n boolean thereIsChange = true;\\n int nodePointer = keyToPoint.get(dest);\\n\\n while (thereIsChange) { //pass on all the graph\\n thereIsChange=false;\\n boolean first = true;\\n for (int i = 0; i < pointToKey.length; i++) { //find the min distance and point to it\\n if ((!was[i]&distance[i]<Integer.MAX_VALUE&first)|(!was[i]&distance[i]<distance[nodePointer]&!first)){\\n nodePointer=i;\\n first = false;\\n thereIsChange = true; //there is work to be done\\n }\\n }\\n\\n for (node_info n : _graph.getV(pointToKey[nodePointer]) //neighbors pass\\n ) {\\n if (distance[keyToPoint.get(n.getKey())] > distance[nodePointer] + _graph.getEdge(n.getKey(), pointToKey[nodePointer])&!was[keyToPoint.get(n.getKey())]) {\\n distance[keyToPoint.get(n.getKey())] = distance[nodePointer] + _graph.getEdge(n.getKey(), pointToKey[nodePointer]);\\n comeFromKey[keyToPoint.get(n.getKey())] = pointToKey[nodePointer];\\n }\\n }\\n was[nodePointer] = true;\\n }\\n if(distance[keyToPoint.get(src)]==Double.MAX_VALUE) return -1;\\n return distance[keyToPoint.get(src)];\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3976e530126a17f4dd9c116eacc5f240\",\n \"score\": \"0.5511838\",\n \"text\": \"public static void main(String[] args) throws IOException {\\n\\t\\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\\n\\t\\tBufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));\\n\\t\\t\\n\\t\\tStringTokenizer st = new StringTokenizer(br.readLine());\\t\\t\\n\\t\\t\\n\\t\\tV = Integer.parseInt(st.nextToken()); // 정점의 갯수\\n\\t\\tE = Integer.parseInt(st.nextToken()); // 도로의 갯수\\n\\t\\t\\n\\t\\tarr = new ArrayList[V+1];\\n\\t\\tfor(int i=1; i<=V; i++) { //맥세권, 스세권 부모노드 생성하기위해 +2 \\n\\t\\t\\tarr[i] = new ArrayList<>();\\n\\t\\t}\\n\\t\\tmdist = new int[V+1]; //맥도날드용\\n\\t\\tsdist = new int[V+1]; //스타벅스용\\n\\t\\t\\n\\t\\tfor(int i=0; i<E; i++) {\\n\\t\\t\\tst = new StringTokenizer(br.readLine());\\n\\t\\t\\tint u = Integer.parseInt(st.nextToken()); //점1\\n\\t\\t\\tint v = Integer.parseInt(st.nextToken()); //점2\\n\\t\\t\\tint w = Integer.parseInt(st.nextToken()); //가중치\\n\\t\\t\\tarr[u].add(new Ed(v,w));\\t\\n\\t\\t\\tarr[v].add(new Ed(u,w));\\t\\n\\t\\t}\\t\\t\\n\\t\\t\\n\\t\\t// 맥세권\\n\\t\\tArrays.fill(mdist,Integer.MAX_VALUE);\\n\\t\\tst = new StringTokenizer(br.readLine());\\n\\t\\t\\n\\t\\tM = Integer.parseInt(st.nextToken()); // 맥도날드수 \\n\\t\\tMx = Integer.parseInt(st.nextToken()); // 맥세권 조건\\t\\t\\n\\n\\t\\tst = new StringTokenizer(br.readLine());\\n\\t\\tfor(int i=0; i<M; i++) {\\n\\t\\t\\tint mm = Integer.parseInt(st.nextToken()); // 맥도날드 위치\\n\\t\\t\\tmdist[mm] = 0;\\n\\t\\t\\tqueue.add(new Ed(mm, 0));\\t// 맥도날드의 위치를 시작점. 가중치 0\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\tdijkstra(mdist);\\n\\n\\t\\t// 스세권\\n\\t\\tArrays.fill(sdist,Integer.MAX_VALUE);\\n\\t\\tst = new StringTokenizer(br.readLine());\\n\\t\\t\\n\\t\\tS = Integer.parseInt(st.nextToken()); // 스타벅스 수 \\n\\t\\tSy = Integer.parseInt(st.nextToken()); // 스세권 조건\\n\\t\\t\\n\\t\\tst = new StringTokenizer(br.readLine());\\n\\t\\tfor(int i=0; i<S; i++) {\\n\\t\\t\\tint ss = Integer.parseInt(st.nextToken()); // 스타벅스 위치\\n\\t\\t\\tsdist[ss] = 0;\\n\\t\\t\\tqueue.add(new Ed(ss, 0)); // 스타벅스의 위치를 시작점. 가중치 0\\n\\t\\t}\\n\\t\\tdijkstra(sdist);\\n\\t\\t\\n\\t\\tint ans = Integer.MAX_VALUE;\\n for(int i=1; i<=V; i++) {\\n if((mdist[i]>0 && mdist[i]<=Mx) && (sdist[i]>0 && sdist[i]<=Sy)) // dist수행항 결과가 스세권, 맥세권 조건보다는 작아야함.\\n ans = Math.min(ans, mdist[i]+sdist[i]);\\n }\\n\\n \\n\\n if(ans==Integer.MAX_VALUE)\\n \\tans = -1;\\n\\n bw.write(String.valueOf(ans));\\n bw.flush();\\n\\t\\tbw.close();\\n\\t\\tbr.close();\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5a31029b8de394370996fba746d14304\",\n \"score\": \"0.55074185\",\n \"text\": \"public int[][] dijkstra(int source){\\n int graphSize = this.nodes.size(); //Gets number of nodes in the graph for convenience\\n int dist_prev[][] = new int[graphSize][2]; //Funky way to return both distance and previous node at the same time\\n ArrayList<Node> unVisited = new ArrayList<Node>(); //Array of unvisited nodes that didn't have their minimum distance calculated yet\\n\\n for (int i = 0; i < graphSize; i++){ //For each Node in the graph\\n dist_prev[i][0] = Integer.MAX_VALUE / 2; //Makes the distance stupidly high\\n dist_prev[i][1] = -1; //Makes the previous Node be something impossible\\n unVisited.add(this.nodes.get(i)); //Make all of them unvisited\\n }\\n\\n dist_prev[source][0] = 0; //The only distance we know for sure is from the source to itself, 0 to be exact\\n\\n while (!unVisited.isEmpty()){ //While there are still Nodes distances to be calculated\\n\\n int min = 0; //The next 8 lines are a spaghetti I used to avoid making a method that returns the smallest distance, I probably should correct it someday\\n for(int i = 0; i < unVisited.size(); i++){ //For each Node yet to be visited\\n if(dist_prev[unVisited.get(i).id][0] <= dist_prev[unVisited.get(min).id][0]){ //Verify if this Node has the smallest distance\\n min = i; //Of them all\\n }\\n }\\n int minidx = unVisited.get(min).id; //Gets the real graph id from the Node we found to be the one in the unvisited to possess the smallest distance\\n unVisited.remove(min); //Remove this guys (let's call him minidx, for convenience) from the unvisited because we already found it's smallest distance\\n\\n for (int i = 0; i < this.getNodeById(minidx).neighbours.size(); i++){ //For each neighbour in minidx\\n Node aux = this.getNodeById(minidx).neighbours.get(i).end; //Did this in order to reduce typing\\n if(unVisited.contains(aux)){ //If the neighbour is yet to be visited\\n int maybeDist = this.getNodeById(minidx).neighbours.get(i).weight + dist_prev[minidx][0]; //calculates a possible smallest distance from source to the minidx neighbour\\n if(maybeDist < dist_prev[aux.id][0] ){ //If the distance is in fact smaller than the one we have\\n dist_prev[aux.id][0] = maybeDist; //Change it\\n dist_prev[aux.id][1] = minidx; //And make minidx it's predecessor\\n }\\n }\\n\\n }\\n\\n }\\n\\n return dist_prev; //In the end it returns a int[a][b] were a is the id of the node you want to know the distance from the source, and b can be '0' for the distance valor or '1' for the predecessor id\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bef9a58145ff95b4a17ef3509ab9900e\",\n \"score\": \"0.5505369\",\n \"text\": \"private void blokujPetle()\\n {\\n\\n Iterator<Edge> it=path.iterator();\\n Edge start=it.next();\\n Edge stop=start;\\n int prev=start.getTo();\\n while(it.hasNext())\\n {\\n Edge e=it.next();\\n if(prev!=e.getFrom())\\n {\\n //dodany if\\n if(distances[stop.getTo()][start.getFrom()]!=-1)\\n {\\n distances[stop.getTo()][start.getFrom()]=INF; //blokuje wszystkie spójne częsci poza ostatnią\\n start=e;\\n stop=e;\\n prev=start.getTo();\\n }\\n }\\n else\\n {\\n stop=e;\\n prev=e.getTo();\\n }\\n \\n }\\n //dodany if zeby nie robilo niesk w miejscu ktorego nie ma\\n if(distances[stop.getTo()][start.getFrom()]!=-1)\\n distances[stop.getTo()][start.getFrom()]=INF;\\n // zawsze ostatnia pętla zostaje do zablokowania jeżeli path spójny to całość jeżeli nie\\n // to ostatnia część\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"408258350e36d38f5cf570f33838eeb2\",\n \"score\": \"0.5501265\",\n \"text\": \"public int[] dijkstra1(int r,ArrayList<HashMap<Integer,Integer>> in){\\r\\n\\tfinal int[] out=new int[in.size()],prev=new int[in.size()];\\r\\n\\tTreeSet<Integer> pq=new TreeSet<Integer>(new Comparator<Integer>(){\\r\\n\\t\\tpublic int compare(Integer i0, Integer i1) {\\r\\n\\t\\t\\tif(out[i0]!=out[i1])return Double.compare(out[i0],out[i1]);\\r\\n\\t\\t\\treturn i0-i1;\\r\\n\\t\\t}\\r\\n\\t});\\r\\n\\tArrays.fill(out, Integer.MAX_VALUE/2);\\r\\n\\tout[r]=0;\\r\\n\\tprev[r]=-1;\\r\\n\\tpq.add(r);\\r\\n\\twhile(!pq.isEmpty()){\\r\\n\\t\\tint t=pq.first();\\r\\n\\t\\tpq.remove(pq.first());\\r\\n\\t\\tfor(int i:in.get(t).keySet())if(out[t]+in.get(t).get(i)<out[i]){\\r\\n\\t\\t\\tpq.remove(i);\\r\\n\\t\\t\\tout[i]=out[t]+in.get(t).get(i);\\r\\n\\t\\t\\tprev[i]=t;\\r\\n\\t\\t\\tpq.add(i);\\r\\n\\t\\t}\\r\\n\\t}\\r\\n\\treturn out;//note you can also return previous here if you like....or some combination of the two\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4fdec1a614aef433030ef518346357e3\",\n \"score\": \"0.5496664\",\n \"text\": \"public void spanningTree(){\\n\\t\\tgraphArray = new LinkedList[al.size()];\\n\\t\\tfor(int i=0;i<al.size();i++){\\n\\t\\t\\tgraphArray[i]= new LinkedList();\\n\\t\\t}\\n\\t\\tboolean [] visit = new boolean[al.size()]; \\n\\t\\tvisit[0]=true;\\n\\t\\tdouble minDistance = -1;\\n\\t\\tint minVertax = -1;\\n\\t\\tint correlativeVertax = -1;\\n \\n\\t\\tfor(int i=0;i<al.size()-1;i++){\\n\\t\\t\\tfor(int j=0;j<al.size();j++){\\n\\t\\t\\t\\tif(!visit[j]){\\n\\t\\t\\t\\t\\tfor(int k=0;k<al.size();k++){\\n\\t\\t\\t\\t\\t\\tif(visit[k]){\\n\\t\\t\\t\\t\\t\\t\\tif(minDistance>distanceMatrix[j][k]||minDistance==-1){\\n\\t\\t\\t\\t\\t\\t\\t\\tminDistance=distanceMatrix[j][k];\\n\\t\\t\\t\\t\\t\\t\\t\\tminVertax=j;\\n\\t\\t\\t\\t\\t\\t\\t\\tcorrelativeVertax=k;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\tgraphArray[correlativeVertax].addFirst(al.get(minVertax));\\n\\t\\tvisit[minVertax]=true;\\n\\t\\tminDistance=-1;\\n\\t\\tminVertax=-1;\\n\\t\\tcorrelativeVertax = -1;\\t\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b5ca54449d0bcf7bedf30ef45f854520\",\n \"score\": \"0.54731244\",\n \"text\": \"public static void main(String[] args) {\\n Scanner in = new Scanner(System.in);\\n int N = in.nextInt();\\n int M = in.nextInt();\\n \\n PriorityQueue<Node> pq = new PriorityQueue(new Comparator<Node>(){\\n @Override\\n public int compare(Node n1, Node n2){\\n return n1.dist - n2.dist;\\n }\\n });\\n \\n ArrayList<int[]>[] graph = new ArrayList[N+1];\\n HashMap<Integer, Node> map = new HashMap<Integer, Node>();\\n \\n for(int i=0; i<M; i++){\\n int x = in.nextInt();\\n int y = in.nextInt();\\n int r = in.nextInt();\\n int[] to = {y,r};\\n int[] from = {x,r};\\n if(graph[x] == null)\\n graph[x] = new ArrayList<int[]>(); \\n if(graph[y] == null)\\n graph[y] = new ArrayList<int[]>();\\n graph[x].add(to);\\n graph[y].add(from);\\n }\\n \\n int start = in.nextInt();\\n Node sp = new Node();\\n sp.position = start;\\n sp.source = 0;\\n sp.dist = 0;\\n pq.add(sp);\\n map.put(start, sp);\\n \\n for(int i=1; i<N+1; i++){\\n if(i != start){\\n Node n = new Node();\\n n.position = i;\\n pq.add(n);\\n map.put(i, n);\\n }\\n }\\n \\n int sum = 0;\\n \\n HashSet<Integer> visited = new HashSet<Integer>();\\n \\n while(!pq.isEmpty()){\\n Node node = pq.poll();\\n visited.add(node.position);\\n \\n if(node.dist == Integer.MAX_VALUE)\\n break;\\n \\n //System.out.println(\\\"polling: \\\" + node.position);\\n sum+= node.dist;\\n // System.out.println(\\\"Sum: \\\" + sum);\\n for(int[] arr : graph[node.position]){\\n //0 has node\\n //1 has dist\\n if(!map.containsKey(arr[0]))\\n continue;\\n Node n = map.get(arr[0]);\\n int newDist = arr[1];\\n if(newDist < n.dist && !visited.contains(n.position)){\\n //System.out.println(\\\"Updating \\\" + n.position + \\\" to \\\" + newDist);\\n n.dist = newDist;\\n n.source = node.position;\\n pq.remove(n);\\n pq.add(n);\\n }\\n }\\n }\\n in.close();\\n System.out.println(sum);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5d6d8790b39bd5901b5b298d73a3d8f8\",\n \"score\": \"0.5471593\",\n \"text\": \"private DegreesOfSeparationBFS() { }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ed3604025ac00db31f283ce80a20b0c6\",\n \"score\": \"0.54704565\",\n \"text\": \"private List<DFSVertex> DFS(List<DFSVertex> vertices, int maxDistance, String licenceId) {\\n\\n List<DFSVertex> remoteVertexList = new ArrayList<>();\\n List<Long> visited = new ArrayList<>(subgraph.numVertices());\\n\\n for (DFSVertex vertex : vertices) {\\n if (visited.contains(vertex.vertex)) {\\n continue;\\n }\\n\\n\\n Deque<DFSVertex> stack = new ArrayDeque<>();\\n stack.push(vertex);\\n\\n parent:\\n while (!stack.isEmpty()) {\\n DFSVertex top = stack.peek();\\n if (subgraph.getVertex(top.vertex).isRemote()) {\\n //add remote\\n if (top.currentDistance < maxDistance)\\n remoteVertexList.add(top);\\n }\\n\\n String attVal = (String) getCurrentInstance().getPropertiesForVertex(top.vertex).\\n getValue(LICENSE_PLACE_ATT);\\n visited.add(top.vertex);\\n if (licenceId.equals(attVal)) {\\n lastKnownLocation.put(getIteration(), top.vertex);\\n logLocation(\\\"\\\" + top.vertex, licenceId, getCurrentInstance().getTimestampStart());\\n if (vertex.currentDistance >= maxDistance) {\\n return remoteVertexList;\\n }\\n }\\n\\n for (ITemplateEdge e : subgraph.getVertex(top.vertex).outEdges()) {\\n\\n ITemplateVertex sink = e.getSink(subgraph.getVertex(top.vertex));\\n Float distance = (Float) getCurrentInstance().getPropertiesForEdge(e.getId()).\\n getValue(DISTANCE_ATT);\\n\\n DFSVertex w = new DFSVertex();\\n w.currentDistance = top.currentDistance + distance;\\n w.vertex = sink.getId();\\n\\n if (visited.contains(sink.getId())) {\\n continue;\\n }\\n\\n if (w.currentDistance < maxDistance) {\\n stack.push(w);\\n }\\n\\n continue parent;\\n\\n }\\n stack.pop();\\n }\\n\\n\\n\\n }\\n\\n return remoteVertexList;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4c19a7fc76b5c774661619a4728a812c\",\n \"score\": \"0.54565763\",\n \"text\": \"public void createedge(){\\n\\t\\t \\n\\t\\t addLane(\\\"path1\\\", 0, 1, 626);\\n\\t\\t addLane(\\\"path2\\\", 0, 5, 702);\\n\\t\\t addLane(\\\"path3\\\", 1, 3, 358);\\n\\t\\t addLane(\\\"path4\\\", 1, 5, 534);\\n\\t\\t addLane(\\\"path5\\\", 3, 2, 35);\\n\\t\\t addLane(\\\"path6\\\", 3, 5, 577);\\n\\t\\t addLane(\\\"path7\\\", 2, 5, 570);\\n\\t\\t addLane(\\\"path8\\\", 2, 4, 324);\\n\\t\\t addLane(\\\"path9\\\", 4, 5, 510);\\n\\t\\t addLane(\\\"path10\\\", 4, 6, 585);\\n\\t\\t addLane(\\\"path11\\\", 4, 7, 870);\\n\\t\\t addLane(\\\"path12\\\", 5, 6, 374);\\n\\t\\t addLane(\\\"path13\\\", 6, 7, 667);\\n\\t\\t addLane(\\\"path14\\\", 6, 9, 585);\\n\\t\\t addLane(\\\"path15\\\", 6, 10,706);\\n\\t\\t addLane(\\\"path16\\\", 7, 8, 226);\\n\\t\\t addLane(\\\"path17\\\", 7, 9, 461);\\n\\t\\t addLane(\\\"path18\\\", 7, 12, 423);\\n\\t\\t addLane(\\\"path19\\\", 7, 11, 545);\\n\\t\\t addLane(\\\"path20\\\", 8, 12, 483);\\n\\t\\t addLane(\\\"path21\\\", 8, 15, 704);\\n\\t\\t addLane(\\\"path22\\\", 9, 11, 240);\\n\\t\\t addLane(\\\"path23\\\", 9, 12, 372);\\n\\t\\t addLane(\\\"path24\\\", 9, 10, 420);\\n\\t\\t addLane(\\\"path25\\\", 9, 13, 444);\\n\\t\\t addLane(\\\"path26\\\", 10, 11, 466);\\n\\t\\t addLane(\\\"path27\\\", 10, 13, 290);\\n\\t\\t addLane(\\\"path28\\\", 10, 14, 509);\\n\\t\\t addLane(\\\"path29\\\", 11, 12, 244);\\n\\t\\t addLane(\\\"path30\\\", 11, 13, 326);\\n\\t\\t addLane(\\\"path31\\\", 11, 14, 235);\\n\\t\\t addLane(\\\"path32\\\", 11, 15, 470);\\n\\t\\t addLane(\\\"path33\\\", 12, 14, 388);\\n\\t\\t addLane(\\\"path34\\\", 12, 15, 335);\\n\\t\\t addLane(\\\"path35\\\", 12, 18,689);\\n\\t\\t addLane(\\\"path36\\\", 13, 14, 226);\\n\\t\\t addLane(\\\"path37\\\", 13, 9, 461);\\n\\t\\t addLane(\\\"path38\\\", 13, 12, 423);\\n\\t\\t addLane(\\\"path39\\\", 14, 15, 417);\\n\\t\\t addLane(\\\"path40\\\", 14, 16, 158);\\n\\t\\t addLane(\\\"path41\\\", 14, 17, 427);\\n\\t\\t addLane(\\\"path42\\\", 14, 19, 329);\\n\\t\\t addLane(\\\"path43\\\", 15, 18, 408);\\n\\t\\t addLane(\\\"path44\\\", 15, 16, 435);\\n\\t\\t addLane(\\\"path45\\\", 15, 17, 228);\\n\\t\\t addLane(\\\"path46\\\", 16, 19, 172);\\n\\t\\t addLane(\\\"path47\\\", 16, 20, 275);\\n\\t\\t addLane(\\\"path48\\\", 16, 17, 348);\\n\\t\\t addLane(\\\"path49\\\", 17, 19, 363);\\n\\t\\t addLane(\\\"path50\\\", 17, 20, 333);\\n\\t\\t addLane(\\\"path51\\\", 17, 18, 465);\\n\\t\\t addLane(\\\"path52\\\", 19, 20, 126);\\n\\t\\t addLane(\\\"path53\\\", 19, 21, 238);\\n\\t\\t addLane(\\\"path54\\\", 20, 21, 153);\\n\\t\\t addLane(\\\"path55\\\", 20, 22, 200);\\n\\t\\t addLane(\\\"path56\\\", 21, 22, 54);\\n\\t\\t addLane(\\\"path57\\\", 21, 23, 233);\\n\\t\\t addLane(\\\"path58\\\", 22, 23, 192);\\n\\t\\t \\n\\t\\t \\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3829d703e1d415f5885f6675dfaa43af\",\n \"score\": \"0.54418886\",\n \"text\": \"private ArrayList<Point> astar(Point goal) {\\n HashMap<Point,Integer> openSet = new HashMap<Point,Integer>();\\n HashMap<Point,Integer> g_score = new HashMap<Point,Integer>();\\n HashMap<Point,Point> came_from = new HashMap<Point,Point>();\\n HashMap<Point,Orientation> coming_from = new HashMap<Point,Orientation>();\\n ArrayList<Point> closedSet = new ArrayList<Point>();\\n \\n Point start = new Point(2,1);\\n coming_from.put(start,GhostOrientation);\\n\\n g_score.put(start,0); // start g score = 0;\\n openSet.put(start,heuristic(start,goal)); // 0 + heuristic;\\n\\n while(!openSet.isEmpty()) {\\n //choose the lowest cost node\\n Point current = lowest_cost_node(openSet);\\n\\n \\tfor(Entry<Point,Integer> item : openSet.entrySet()) {\\n \\t\\tSystem.out.println(item.getKey().y+\\\", \\\"+item.getKey().x + \\\": \\\"+item.getValue());\\n \\t}\\n \\tSystem.out.println(\\\">\\\"+current.y+\\\", \\\"+current.x+\\\": \\\"+openSet.get(current));\\n \\tSystem.out.println();\\n\\n if(current.equals(goal))\\n return reconstruct_path(came_from,came_from.get(goal));\\n\\n openSet.remove(current);\\n ArrayList<Point> neighbours = neighbour_nodes(current,coming_from.get(current));\\n\\n if(neighbours.size() > 0)\\n closedSet.add(current);\\n\\n for(Point neighbour : neighbours) {\\n if(closedSet.contains(neighbour))\\n break;\\n\\n int temp_g_score = g_score.get(current) + 1; // add one distance between the node\\n\\n if (!g_score.containsKey(neighbour) || temp_g_score < g_score.get(neighbour)) {\\n\\n came_from.put(neighbour,current);\\n coming_from.put(neighbour,getOrientationFrom(neighbour,current));\\n g_score.put(neighbour,temp_g_score);\\n\\n if(!openSet.containsKey(neighbour)) {\\n int temp_f_val = g_score.get(neighbour) + heuristic(neighbour, goal);\\n openSet.put(neighbour,temp_f_val);\\n }\\n\\n }\\n }\\n }\\n\\n return new ArrayList<Point>();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c00a2a5428a8f914b6acb0de862477ed\",\n \"score\": \"0.54030985\",\n \"text\": \"public UndirectedGraph() {\\n\\t\\t// TODO Auto-generated constructor stub\\n\\t\\tthis.adJList = new HashMap<>();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6123a959a19e030e278ba2f26196982d\",\n \"score\": \"0.5401392\",\n \"text\": \"public static int findCheapestPath(List<List<String>> edges) {\\r\\n weightmin = 10;\\r\\n // Write your code here\\r\\n HashMap<String, Node> map = new HashMap<>();\\r\\n for (List<String> edge: edges) {\\r\\n Node a = map.get(edge.get(0)); // Start node;\\r\\n if (a == null) {\\r\\n a = new Node(edge.get(0));\\r\\n map.put(edge.get(0), a);\\r\\n }\\r\\n Node b = map.get(edge.get(1)); // End node;\\r\\n if (b == null) {\\r\\n b = new Node(edge.get(1));\\r\\n map.put(edge.get(1), b);\\r\\n }\\r\\n // Add edge\\r\\n a.add(new NodeEdge(b, Integer.parseInt(edge.get(2)))); \\r\\n }\\r\\n \\r\\n // TODO: Find path from A to H ...\\r\\n return dfs(map.get(\\\"A\\\"), map.get(\\\"H\\\"));\\r\\n\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1b32ab4baff83d4471bd8493b03c3b51\",\n \"score\": \"0.5400709\",\n \"text\": \"private static void dijkstra(List<Edge> edges, int startingNode) {\\r\\n\\r\\n\\t\\tMap<Integer, List<Edge>> graph = buildGraph(edges);\\r\\n\\t\\t// use reverse order priority queue\\r\\n\\t\\tPriorityQueue<Edge> priorityQueue = new PriorityQueue<Edge>();\\r\\n\\r\\n\\t\\tboolean[] visitedNode = new boolean[graph.size()];\\r\\n\\t\\tint[] parent = new int[graph.size()];\\r\\n\\t\\tint[] distance = new int[graph.size()];\\r\\n\\t\\t// initialize the parent and distance array\\r\\n\\t\\tfor (int i = 0; i < distance.length; i++) {\\r\\n\\t\\t\\tdistance[i] = Integer.MAX_VALUE;\\r\\n\\t\\t\\tparent[i] = -1;\\r\\n\\t\\t}\\r\\n\\t\\tvisitedNode[startingNode] = true;\\r\\n\\t\\tparent[startingNode] = startingNode;\\r\\n\\t\\tdistance[startingNode] = 0;\\r\\n\\r\\n\\t\\tdo {\\r\\n\\t\\t\\t// TODO\\r\\n\\t\\t\\tList<Edge> childOfStartingtNode = graph.get(startingNode);\\r\\n\\t\\t\\tfor (Edge edge : childOfStartingtNode) {\\r\\n\\t\\t\\t\\tif (!edge.isConnected()) {\\r\\n\\r\\n\\t\\t\\t\\t\\tpriorityQueue.add(edge);\\r\\n\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\tEdge currentEdge = priorityQueue.poll();\\r\\n\\t\\t\\tcurrentEdge.setConnected(true);\\r\\n\\t\\t\\tif (!visitedNode[currentEdge.getEndNode()]) {\\r\\n\\t\\t\\t\\tvisitedNode[currentEdge.getEndNode()] = true;\\r\\n\\t\\t\\t\\tparent[currentEdge.getEndNode()] = currentEdge.getStartNode();\\r\\n\\r\\n\\t\\t\\t\\tint newDistance = distance[currentEdge.getStartNode()]\\r\\n\\t\\t\\t\\t\\t\\t+ currentEdge.getWightl();\\r\\n\\r\\n\\t\\t\\t\\tif (distance[currentEdge.getEndNode()] > newDistance) {\\r\\n\\t\\t\\t\\t\\tdistance[currentEdge.getEndNode()] = newDistance;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tstartingNode = currentEdge.getEndNode();\\r\\n\\t\\t\\t}\\r\\n\\r\\n\\t\\t} while (priorityQueue.size() > 0);\\r\\n\\r\\n\\t\\tfor (int i = 0; i < graph.size(); i++) {\\r\\n\\t\\t\\tSystem.out.println(\\\"Node: \\\" + i);\\r\\n\\t\\t\\tSystem.out.println(\\\"distance: \\\" + distance[i]);\\r\\n\\t\\t\\tSystem.out.println(\\\"Parent: \\\" + parent[i]);\\r\\n\\t\\t\\tSystem.out.println();\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"580b7551c2b57336d78bc1728ac9ef81\",\n \"score\": \"0.5391323\",\n \"text\": \"private HashMap<Integer,Integer> short_path (int src,int dest)\\n{ HashMap<Integer,Integer> node_map = new HashMap<Integer,Integer>();\\n node_data temp_node;\\n // a list that function as a queue\\n LinkedList<node_data> list_of_nodes = new LinkedList<node_data>();\\n // if the dest and src are equal return just one node in the collection\\n if(src==dest)\\n { graph1.getNode(src).setTag(0);\\n node_map.put(src,-1);\\n return node_map;}\\n // rest every node node in the graph , tag to -1 and information to white\\n for (node_data current_node : graph1.getV()) {\\n current_node.setInfo(\\\"white\\\");\\n current_node.setTag(-1);\\n }// sets the src node and insert it to the queue and the collection\\n graph1.getNode(src).setInfo(\\\"grey\\\");\\n graph1.getNode(src).setTag(0);\\n list_of_nodes.add(graph1.getNode(src));\\n node_map.put(src,-1);\\n // run until sets every node in the path\\n while(!list_of_nodes.isEmpty())\\n {\\n // get the first node in queue\\n temp_node = list_of_nodes.getFirst();\\n list_of_nodes.remove(list_of_nodes.getFirst());\\n // check if the node have neighbors if it had go over them and sets them\\n if(temp_node.getNi().size()>0) {\\n // go over the node neighbors\\n for (node_data current_node : temp_node.getNi()) {\\n // if not been altered, sets his info to grey and his tag to previous tag +1\\n if (current_node.getInfo().equals(\\\"white\\\")) {\\n current_node.setInfo(\\\"grey\\\");\\n current_node.setTag(temp_node.getTag() + 1);\\n // insert the node to the collection\\n node_map.put(current_node.getKey(), temp_node.getKey());\\n // if its reach the dest node stop and return the collection\\n if (current_node.equals(graph1.getNode(dest))) {\\n return node_map;\\n }\\n // add the node to the queue\\n list_of_nodes.add(current_node);\\n }\\n }\\n }\\n temp_node.setInfo(\\\"black\\\");\\n }\\n return node_map;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8d488f42e1ad6e91aafacb4cd585a2cc\",\n \"score\": \"0.5383921\",\n \"text\": \"public static void main(String args[]) throws IOException{\\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\\n int max = Integer.MAX_VALUE;\\n \\n StringTokenizer st = new StringTokenizer(br.readLine(),\\\" \\\");\\n \\n int m = Integer.parseInt(st.nextToken());\\n int n = Integer.parseInt(st.nextToken());\\n int arr[][] = new int[m+1][n+1];\\n int dist[][] = new int[m+1][n+1];\\n // int temp;\\n \\n for(int i = 1; i <= m; i++){\\n st =new StringTokenizer(br.readLine(),\\\" \\\");\\n for(int j = 1; j <= n; j++){\\n \\n arr[i][j] = Integer.parseInt(st.nextToken());\\n dist[i][j] = max;\\n \\n }\\n }\\n \\n dist[1][1] = arr[1][1];\\n \\n \\n if(arr[1][1]==-1)\\n System.out.println(\\\"-1\\\");\\n \\n else if(arr[m][n]==-1)\\n System.out.println(\\\"-1\\\");\\n \\n else{\\n \\n \\n Graph temp;\\n int cur_row;\\n int cur_col;\\n int distance;\\n int next;\\n int temp_weight;\\n \\n \\n PriorityQueue<Graph> queue = new PriorityQueue<>(new Comparator<Graph>() {\\n public int compare(Graph g1, Graph g2) {\\n if(g1.weight <= g2.weight) {\\n return -1;\\n }else {\\n return 1;\\n }\\n }\\n });\\n \\n \\n queue.add(new Graph(1,1,arr[1][1]));\\n \\n while(!queue.isEmpty()){\\n temp = queue.poll();\\n cur_row = temp.row;\\n cur_col = temp.column;\\n distance = temp.weight;\\n \\n //System.out.println(cur_row+\\\" \\\"+cur_col);\\n \\n \\n if(dist[cur_row][cur_col] < distance) //업데이트 전의 값이므로 스킵\\n continue;\\n \\n //System.out.println(temp.node+\\\" \\\"+dist[temp.node]);\\n \\n if(cur_row+1 >=1 && cur_row+1<=m){\\n temp_weight = arr[cur_row+1][cur_col];\\n if(temp_weight!=-1){\\n if(dist[cur_row+1][cur_col] > temp_weight+distance){\\n dist[cur_row+1][cur_col] = temp_weight+distance;\\n queue.offer(new Graph(cur_row+1,cur_col,temp_weight+distance));\\n }\\n \\n }\\n }\\n \\n if(cur_col+1 >=1 && cur_col+1<=n){\\n temp_weight = arr[cur_row][cur_col+1];\\n if(temp_weight!=-1){\\n if(dist[cur_row][cur_col+1] > temp_weight+distance){\\n dist[cur_row][cur_col+1] = temp_weight+distance;\\n queue.offer(new Graph(cur_row,cur_col+1,temp_weight+distance));\\n }\\n \\n }\\n }\\n \\n if(cur_row-1 >=1 && cur_row-1<=m){\\n temp_weight = arr[cur_row-1][cur_col];\\n if(temp_weight!=-1){\\n if(dist[cur_row-1][cur_col] > temp_weight+distance){\\n dist[cur_row-1][cur_col] = temp_weight+distance;\\n queue.offer(new Graph(cur_row-1,cur_col,temp_weight+distance));\\n }\\n \\n }\\n }\\n \\n if(cur_col-1 >=1 && cur_col-1<=n){\\n temp_weight = arr[cur_row][cur_col-1];\\n if(temp_weight!=-1){\\n if(dist[cur_row][cur_col-1] > temp_weight+distance){\\n dist[cur_row][cur_col-1] = temp_weight+distance;\\n queue.offer(new Graph(cur_row,cur_col-1,temp_weight+distance));\\n }\\n \\n }\\n }\\n \\n \\n \\n \\n }\\n if(dist[m][n]!=max)\\n System.out.println(dist[m][n]);\\n else\\n System.out.println(\\\"-1\\\");\\n \\n }\\n \\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"27d71d2adcee6749ae9baa631637f4d6\",\n \"score\": \"0.53817445\",\n \"text\": \"public Node(){\\r\\n this.parent = null;\\r\\n this.coordinates = new Point();\\r\\n this.depth = 0;\\r\\n this.valid_moves = new ArrayList<Point>();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dc5133e59de3712238186aba32d041d\",\n \"score\": \"0.53814673\",\n \"text\": \"public Graph(int numVertex){\\n this.numVertex = numVertex; \\n this.adj = new LinkedList[numVertex];\\n \\n // initialize adjucent nodes\\n for(int i = 0 ; i < adj.length; i++){\\n adj[i] = new LinkedList();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8f1a14a4695d9d02a1e0ec3f312c60c5\",\n \"score\": \"0.537513\",\n \"text\": \"public Dist[] dijkstra(int source){\\n Dist[] result = new Dist[nodeCount +1];\\n Dist[] minHeap = new Dist[nodeCount + 1];\\n result[source] = new Dist(source, 0);\\n int size = 0;\\n for (int i = 0; i < result.length ; i++) {\\n if (i != source) {\\n result[i] = new Dist(i, MAXWEIGHT);\\n }\\n insert(minHeap, result[i], i);\\n size++;\\n }\\n HashSet<Integer> visitedNodes = new HashSet<>();\\n while (size > 0){\\n Dist curr = extractMin(minHeap, size);\\n visitedNodes.add(curr.getNodeNumber());\\n size--;\\n int vertexNum = curr.getNodeNumber();\\n if (vertexNum == 0){\\n continue;\\n }\\n\\n int currDist = curr.getDist();\\n HashMap<Integer, Integer> adjVertices = nodeArr[vertexNum].getEdges();\\n\\n for (Map.Entry<Integer, Integer> ent : adjVertices.entrySet()){\\n\\n int vertexToAdd = ent.getKey(); //number of the vertex connected to curr node\\n //checking if the node is already visited\\n if (visitedNodes.contains(vertexToAdd)){\\n continue;\\n }\\n int temp = ent.getValue(); //distance from source to that vertex\\n int newDist = currDist + temp;\\n if (newDist < result[vertexToAdd].getDist()){\\n result[vertexToAdd].updateDist(newDist);\\n for (int i = 0; i < minHeap.length; i++) {\\n if (minHeap[i].getNodeNumber() == vertexToAdd){\\n minHeap[i].updateDist(newDist);\\n while (i > 0){\\n if (minHeap[i].getDist() < minHeap[i-1].getDist()){\\n swap(minHeap, i, i-1);\\n }\\n i--;\\n }\\n break;\\n }\\n\\n\\n }\\n }\\n }\\n }\\n return result;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8c1cd3b3f93769793955d1e7af52645a\",\n \"score\": \"0.5371602\",\n \"text\": \"Graph(ArrayList<String> vertex, ArrayList<Link> edge){\\n this.v = vertex;\\n this.e = edge;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"90db7cdcd86207a39ad94a502728422d\",\n \"score\": \"0.5370992\",\n \"text\": \"void dijkstraWithoutPath(final int source) {\\r\\n dijkstra(source, false);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"90edb4977bfc124e6e7e83010a3eca85\",\n \"score\": \"0.53702426\",\n \"text\": \"public static void main(String[] args) {\\n int graph[][] = new int[][] { { 0, 4, 0, 0, 0, 0, 0, 8, 0 }, \\n { 4, 0, 8, 0, 0, 0, 0, 11, 0 }, \\n { 0, 8, 0, 7, 0, 4, 0, 0, 2 }, \\n { 0, 0, 7, 0, 9, 14, 0, 0, 0 }, \\n { 0, 0, 0, 9, 0, 10, 0, 0, 0 }, \\n { 0, 0, 4, 14, 10, 0, 2, 0, 0 }, \\n { 0, 0, 0, 0, 0, 2, 0, 1, 6 }, \\n { 8, 11, 0, 0, 0, 0, 1, 0, 7 }, \\n { 0, 0, 2, 0, 0, 0, 6, 7, 0 } }; \\n ShortestPath t = new ShortestPath(); \\n t.dijkstra(graph, 0, 9); \\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3b5a0599423bee7b4f36e1e3364d5a33\",\n \"score\": \"0.535515\",\n \"text\": \"public Graph(Integer nrNoduri) {\\n this.nrNoduri = nrNoduri;\\n listeAdiacente = new LinkedList[nrNoduri];\\n for (int i = 0; i < nrNoduri; i++)\\n listeAdiacente[i] = new LinkedList();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c2adf0068485501433c4a076a2b77345\",\n \"score\": \"0.5353484\",\n \"text\": \"public Node() {\\n connectedTo = new ArrayList<>();\\n lowestConn = new ArrayList<>();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d66f404d36ff33b7414487ce7f54d80\",\n \"score\": \"0.53462803\",\n \"text\": \"@Override\\n public List<node_data> shortestPath(int src, int dest) {\\n int key_temp;\\n LinkedList<node_data> path_list1,path_list2;\\n path_list1=new LinkedList<node_data>();\\n path_list2=new LinkedList<node_data>();\\n HashMap<Integer,Integer> node_map;\\n // if graph null or empty return empty list\\n if(graph1==null)\\n return path_list2;\\n if(graph1.nodeSize()==0)\\n return path_list2;\\n // if one of the vertex not in the graph return empty list\\n if(graph1.getNode(src)==null||graph1.getNode(dest)== null)\\n return path_list2;\\n // activates inner function to set tags and create a collection\\n node_map = short_path(src, dest);\\n key_temp = dest;\\n // if its a path between the vertices create a list\\n if(graph1.getNode(dest).getTag()!=-1) {\\n // create a list by the collection the list will be from dest to src\\n while (node_map.get(key_temp) != -1) {\\n path_list1.add(graph1.getNode(key_temp));\\n key_temp = node_map.get(key_temp);\\n }\\n path_list1.add(graph1.getNode(key_temp));\\n // reversed the list so it will be from src to dest\\n while (!path_list1.isEmpty()) {\\n path_list2.add(path_list1.getLast());\\n path_list1.remove(path_list1.getLast());\\n }\\n }\\n return path_list2;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9473c453173e004c9693e706bc77dff0\",\n \"score\": \"0.53446263\",\n \"text\": \"Flock() {\\n boids = new ArrayList(); // Initialize the arraylist\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3d17d70de473933c719303f2a0e3457f\",\n \"score\": \"0.53424555\",\n \"text\": \"int[] getPathArray() {\\r\\n if (isSPDone) {\\r\\n return parent;\\r\\n } else {\\r\\n throw new UnsupportedOperationException(\\r\\n \\\"Cannot get distance of nodes before performing any shortest path algorithm.\\\");\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2627300b389b2a78bb1a433c92cb9001\",\n \"score\": \"0.53373253\",\n \"text\": \"public double ACO_Engine(){\\n double answer =Double.MAX_VALUE; //stores the shortest path solution\\n for(int i=0;i<100000;i++){ //for a predefined number of iterations\\n ants = new ArrayList<Ant>(); //each time create new ants for better running time\\n createAnts(); //create new ants so that they are given new starting cities\\n int antsCompletedTour = 0; //stores the number of ants that completed a tour\\n while(antsCompletedTour < numberOfAnts){ //while not all ants completed the tour\\n for(int j=0;j<numberOfAnts;j++){ //move each ant to a new city\\n if(!ants.get(j).completedTour(g)){\\n moveAnt(ants.get(j));\\n }else{\\n antsCompletedTour++;\\n }\\n }\\n }\\n double smallestDistance = Double.MAX_VALUE; //stores the smallest distance found in some iteration\\n int bestAntIndex = -1; //stores the index of the ant that found the shortest path in some iteration\\n for(int j=0;j<numberOfAnts;j++){\\n if(ants.get(j).getRouteLength()<smallestDistance){ // get smallest distance in current iteration\\n bestAntIndex = j; //store it's index\\n smallestDistance = ants.get(j).getRouteLength(); //store smallest distance\\n }\\n }\\n if(smallestDistance<answer){ //if smallest distance in current iteration is better than global update global\\n answer = smallestDistance;\\n }\\n System.out.println(\\\"iteration \\\"+i+\\\"smallest distance : \\\"+answer); //jew smallest disntace\\n for(int j=0;j<ants.get(bestAntIndex).route.visitedCities.size()-1;j++){\\n //globally update the pheromone levels of edges used by the best any\\n int currentCityIndex = ants.get(bestAntIndex).route.visitedCities.get(j).getID()-1;\\n int nextCityIndex = ants.get(bestAntIndex).route.visitedCities.get(j+1).getID()-1;\\n globalPheromoneUpdate(currentCityIndex,nextCityIndex,ants.get(bestAntIndex).getRouteLength());\\n }\\n //update the pheromone level from the last city to the starting city (to go back)\\n int currentCityIndex = ants.get(bestAntIndex).route.visitedCities.get(\\n ants.get(bestAntIndex).route.visitedCities.size()-1).getID()-1;\\n int nextCityIndex = ants.get(bestAntIndex).route.visitedCities.get(0).getID()-1;\\n globalPheromoneUpdate(currentCityIndex,nextCityIndex,ants.get(bestAntIndex).getRouteLength());\\n }\\n return answer;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e8240e5dea515eaeecc9ddfdfbd5fb5\",\n \"score\": \"0.53336\",\n \"text\": \"public DjikstraBinaryHeap(String file)\\n\\t{\\n\\t\\t// Read the sample text file\\n\\t\\ttry {\\n\\t\\t\\t// Open the file to read\\n\\t\\t\\tFileInputStream fstream = new FileInputStream(file);\\n\\t\\t\\t\\n\\t\\t\\t// Get the object of the DataInputStream\\n\\t\\t\\tDataInputStream in = new DataInputStream(fstream);\\n\\t\\t\\tBufferedReader br = new BufferedReader (new InputStreamReader(in));\\n\\t\\t\\t\\n\\t\\t\\t// Read the initial two numbers from the first string atop each file\\n\\t\\t\\tScanner primer = new Scanner(br.readLine()).useDelimiter(\\\"\\\\\\\\s*\\\\\\\\w+=\\\");\\n\\t\\t\\tthis.vertices = Integer.parseInt(primer.next());\\n\\t\\t\\tthis.edges = Integer.parseInt(primer.next());\\n\\t\\t\\tprimer.close();\\n\\t\\t\\t\\t\\n\\t\\t\\t// Setup dist[i][j] matrix\\n\\t\\t//\\tVector<Integer> iVec = new Vector<Integer>(this.vertices);\\n\\t\\t\\tthis.dist = new int[this.vertices][this.vertices];\\n\\t\\t\\tfor (int i=0; i < this.vertices; i++) {\\n\\t\\t\\t\\tfor (int j=0; j < this.vertices; j++) {\\n\\t\\t\\t\\t\\tthis.dist[i][j] = 0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t// Read File Line by Line\\n\\t\\t\\tString strLine;\\n\\t\\t\\tint sourceVertex = 0;\\n\\t\\t\\twhile ((strLine = br.readLine()) != null) {\\n\\t\\t\\t\\tif (!strLine.isEmpty()) {\\n\\t\\t\\t\\t\\tString[] tokens = strLine.trim().split(\\\"[\\\\\\\\s]+\\\");\\n\\t\\t\\t\\t\\tswitch (tokens.length) {\\n\\t\\t\\t\\t\\tcase 1:\\n\\t\\t\\t\\t\\t\\tsourceVertex = Integer.parseInt(tokens[0]);\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\tcase 2:\\n\\t\\t\\t\\t\\t\\tthis.dist[sourceVertex][Integer.parseInt(tokens[0])] = Integer.parseInt(tokens[1]);\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\tdefault:\\n\\t\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"[Warning] Number of digits > 2\\\");\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t} catch(Exception e) { // catch exception if any\\n\\t\\t\\tSystem.err.println(\\\"Error: \\\" + e.getMessage());\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0733bc1237a826951d0e76074e1a3eb6\",\n \"score\": \"0.5330774\",\n \"text\": \"public ArrayList()\\n\\t{\\n\\t\\tlist = new Node[20000];\\n\\t\\tlength = 0;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6f3a88edd0533f4f13b3903d5c209aea\",\n \"score\": \"0.53235936\",\n \"text\": \"public Algorithm(){ \\r\\n this.listNodes = new ArrayList<>();\\r\\n this.listEdges = new ArrayList<>();\\r\\n this.r = null;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6d40ed0ded4e3a4fc93a670af3caf16b\",\n \"score\": \"0.53103554\",\n \"text\": \"public LinkedList<Graph.Vertex> getDiameter(ArrayList<Graph.Vertex> bfs){\\r\\n\\t\\tLinkedList<Graph.Vertex> result = new LinkedList<>();\\r\\n\\t\\tGraph.Vertex parent = bfs.get(bfs.size()-1);\\r\\n\\t\\twhile (parent != null) {\\r\\n\\t\\t\\tresult.add(parent);\\r\\n\\t\\t\\tparent = this.bfs.getParent(parent);\\r\\n\\t\\t}\\r\\n\\t\\treturn result;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b2e536b769b8eb610b0d8e2b76c67071\",\n \"score\": \"0.53068453\",\n \"text\": \"public List getDirections_LeastTransfer(String startStationName, String endStationName)//求换乘次数最少的路径\\n {\\n\\t\\tif(!this.hasStation(startStationName) || !this.hasStation(endStationName))\\n\\t\\t{\\n\\t\\t\\tthrow new RuntimeException(\\\"Stations entered do not exist on this subway.\\\");\\n\\t\\t}\\n\\n //This method is based on a well-known bit of code called Dijkstra's algorithm, which figures out the shortest path between two nodes on a graph.\\n\\t\\tStation start = new Station(startStationName);\\n\\t\\tStation end = new Station(endStationName);\\n\\t\\tList finalRoute = new LinkedList();\\n\\t\\tList route = new LinkedList(); //Record searched route\\n\\t\\tint transferTime= 100; \\n\\t\\tList startList = new LinkedList();\\n\\t\\tstartList.add(start);\\n\\t\\troute.add(startList);\\n\\t\\t\\n\\t\\twhile(!route.isEmpty()){\\n\\t\\t\\tList updateRoute = new LinkedList();\\n\\t\\t\\tfor (Iterator i = route.iterator(); i.hasNext();){\\n\\t\\t\\t\\tList currentRoute = (List)i.next();\\n\\t\\t\\t\\tStation lastStation = (Station)currentRoute.get(currentRoute.size()-1);\\n\\t\\t\\t\\tList neighbors = (List)network.get(lastStation.getName());\\n\\t\\t\\t\\tfor (Iterator j = neighbors.iterator(); j.hasNext();){\\n\\t\\t\\t\\t\\tStation station = (Station)j.next();\\n\\t\\t\\t\\t\\tList newRoute = new LinkedList(currentRoute);\\n\\t\\t\\t\\t\\tif(!newRoute.contains(station)){\\n\\t\\t\\t\\t\\t\\tnewRoute.add(station);\\n\\t\\t\\t\\t\\t\\tif(newRoute.contains(end)){\\n\\t\\t\\t\\t\\t\\t\\tint currentTransfer = transferTimes(newRoute);\\n\\t\\t\\t\\t\\t\\t\\tif(currentTransfer < transferTime){\\n\\t\\t\\t\\t\\t\\t\\t\\ttransferTime = currentTransfer;\\n\\t\\t\\t\\t\\t\\t\\t\\tfinalRoute = new LinkedList(newRoute);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\t\\t\\tint currentTransfer = transferTimes(newRoute);\\n\\t\\t\\t\\t\\t\\t\\tif(currentTransfer < transferTime){\\n\\t\\t\\t\\t\\t\\t\\t\\tupdateRoute.add(newRoute);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\t\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\troute = new LinkedList(updateRoute);\\n\\t\\t}\\n\\t\\t\\n\\t\\t//We've found the path by now.\\n\\t\\tStation keyStation = end;\\n\\t\\tStation station;\\n\\t\\t//Once we've got a path, we just \\\"unwind\\\" the path, and create a List of connections to get from the starting station to the destination station.\\n\\t\\t\\tfor (int i = finalRoute.size()-1; i>=0;)\\n\\t\\t\\t{\\n\\t\\t\\t\\tstation = (Station)finalRoute.get(i);\\n\\t\\t\\t\\twhile(getConnection(keyStation, station) == null)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\ti--;\\n\\t\\t\\t\\t\\tstation = (Station)finalRoute.get(i);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\troute.add(0, getConnection(station, keyStation));\\n\\t\\t\\t\\tkeyStation = station;\\n\\t\\t\\t\\ti--;\\n\\t\\t\\t}\\n\\n\\t\\treturn route;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b30f354756c8ec2adc0fc875d8d2dcfc\",\n \"score\": \"0.53020173\",\n \"text\": \"public void computeDijkstra() {\\n\\t\\t\\n\\t\\treferenceDjk = new Dijkstra(Dijkstra.Element.NODE, \\\"referenceDjk\\\",\\\"weight\\\");\\n\\t\\treferenceDjk.init(graph);\\n\\t\\treferenceDjk.setSource(graph.getNode(referenceNodeId));\\n\\t\\treferenceDjk.compute();\\n\\t\\t\\n\\t\\tlogger.info(\\\"computing paths from each induction loop...\\\");\\n\\t\\tfor (Loop loop : loops) {\\n\\t\\t\\tDijkstra djk = new Dijkstra(Dijkstra.Element.NODE, loop.getEdge(),\\\"weight\\\");\\n\\t\\t\\tdjk.init(graph);\\n\\t\\t\\tdjk.setSource(graph.getNode(loop.getEdge()));\\n\\t\\t\\tdjk.compute();\\n\\t\\t\\tloop.setDijkstra(loop.getEdge());\\n\\t\\t}\\n\\n\\t\\tArrayList<String> zonesToRemove = new ArrayList<String>();\\n\\t\\t\\n\\t\\tlogger.info(\\\"computing from residential zones to a referenceNode... \\\");\\n\\t\\tzonesToRemove.addAll(checkConnectivityOfSourceZones(ZoneType.RESIDENTIAL,5));\\n\\t\\t\\n\\t\\tlogger.info(\\\"computing path from a random point in each zone to a reference node. This takes a while... %n\\\"); \\n\\t\\tzonesToRemove.addAll(checkConnectvityOfDestinationZones(5));\\n\\t\\t\\n\\t\\tlogger.info(\\\"removing isolated zones \\\" + zonesToRemove.size());\\n\\t\\tremoveZones(zonesToRemove);\\n\\t\\t\\n\\t\\tlogger.info(\\\"updating probabilities\\\");\\n\\t\\tupdateProbabilities();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd1ec3728813d3712894960714d1a000\",\n \"score\": \"0.5301051\",\n \"text\": \"public AdjacencyList(int v)\\t//parameterised constructor\\r\\n {\\r\\n \\tadj=new Node[v];\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"513bad0c54c7dbe93137ac515650ed07\",\n \"score\": \"0.5299785\",\n \"text\": \"private void calculatePath()\\n {\\n dijkstra.execute( myGraph.getVertex( jComboBox1.getSelectedIndex() - 1 ) );\\n path = dijkstra.getPath( myGraph.getVertex( jComboBox2.getSelectedIndex() - 1 ) );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"823abda796d6132de851f375b0d7011a\",\n \"score\": \"0.529195\",\n \"text\": \"public static void main(String[] args) {\\n Vertice novo;\\n\\n int tVertices, org, dest, op, num, tipo;\\n\\n System.out.println(\\\"Tipo do grado (1-não orientado, 2-orientado)\\\");\\n tipo = in.nextInt();\\n\\n System.out.println(\\\"Digite número de vértices do grafo:\\\");\\n tVertices = in.nextInt();\\n\\n adj = new ListaAdjacente[tVertices + 1];\\n marcado = new int[tVertices + 1];\\n\\n for (int i = 1; i <= tVertices; i++) {\\n adj[i] = new ListaAdjacente();\\n marcado[i] = 0;\\n }\\n\\n System.out.println(\\\"Arestas do grafo: VérticesOrigem (-1 para parar):\\\");\\n org = in.nextInt();\\n\\n System.out.println(\\\"Arestas do grafo: VérticeDestino (-1 para parar):\\\");\\n dest = in.nextInt();\\n\\n while (org != -1 && dest != -1) {\\n novo = new Vertice();\\n novo.num = dest;\\n novo.prox = adj[org].listaV;\\n adj[org].listaV = novo;\\n\\n if (tipo == 1) {\\n novo = new Vertice();\\n novo.num = org;\\n novo.prox = adj[dest].listaV;\\n adj[dest].listaV = novo;\\n }\\n\\n System.out.println(\\\"Arestas do grafo: VérticeOrigem (-1 para parar):\\\");\\n org = in.nextInt();\\n System.out.println(\\\"Arestas do grafo: VérticeDestino (-1 para parar):\\\");\\n dest = in.nextInt();\\n }\\n\\n do {\\n System.out.println(\\\"1 - Buscar em profundidade\\\");\\n System.out.println(\\\"2 - Mostar lista de adjacencias\\\");\\n System.out.println(\\\"3 - Sair\\\");\\n System.out.print(\\\"Digite seu opção: \\\");\\n op = in.nextInt();\\n switch (op) {\\n case 1:\\n System.out.println(\\\"Digite um vértice de partida da busca:\\\");\\n num = in.nextInt();\\n System.out.println(\\\" \\\" + num);\\n buscaprof(adj, tVertices, num);\\n for (int i = 1; i <= tVertices; i++) {\\n marcado[i] = 0;\\n }\\n break;\\n case 2:\\n mostrar_adj(adj, tVertices);\\n break;\\n }\\n } while (op != 3);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"02b795a51cbfd8c486d2107bd820b686\",\n \"score\": \"0.5290536\",\n \"text\": \"public void minimumPathDijkstra(String source, String destination) {\\n int sourceIndex = verticesIndexes(source);\\n int destinationIndex = verticesIndexes(destination);\\n int[] minimumWeights = new int[totalVertices];\\n boolean[] visited = new boolean[totalVertices];\\n\\n for (int vertexIndex = 0; vertexIndex < totalVertices; vertexIndex++) {\\n minimumWeights[vertexIndex] = Integer.MAX_VALUE;\\n visited[vertexIndex] = false;\\n }\\n\\n minimumWeights[sourceIndex] = 0;\\n int[] parents = new int[totalVertices];\\n parents[sourceIndex] = -1;\\n\\n for (int index = 0; index < totalVertices; index++) {\\n int neighbour = -1;\\n int minumum = Integer.MAX_VALUE;\\n for (int vertexIndex = 0; vertexIndex < totalVertices; vertexIndex++) {\\n if (!visited[vertexIndex] && minimumWeights[vertexIndex] < minumum) {\\n neighbour = vertexIndex;\\n minumum = minimumWeights[vertexIndex];\\n }\\n }\\n\\n visited[neighbour] = true;\\n\\n for (int vertexIndex = 0; vertexIndex < totalVertices; vertexIndex++) {\\n int edgeDistance = adjacencyMatrix[neighbour][vertexIndex];\\n if (edgeDistance > 0 && ((minumum + edgeDistance) < minimumWeights[vertexIndex])) {\\n parents[vertexIndex] = neighbour;\\n minimumWeights[vertexIndex] = minumum + edgeDistance;\\n }\\n }\\n }\\n displayMinimum(sourceIndex, destinationIndex, minimumWeights, parents);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4ef3ee009a31c1260065958d14f7cc2e\",\n \"score\": \"0.52892435\",\n \"text\": \"public static ArrayList<String> shortestChain(Graph g, String p1, String p2) {\\r\\n\\r\\n\\t\\t/** COMPLETE THIS METHOD **/\\r\\n\\r\\n\\t\\tPerson[] memb;\\r\\n\\t\\tmemb = g.members;\\r\\n\\t\\tArrayList<String> shortestChain = new ArrayList<String>();\\r\\n\\t\\tint n = memb.length;\\r\\n\\r\\n\\t\\tint A[] = new int[n];\\r\\n\\t\\tint B[] = new int[n];\\r\\n\\t\\tint C[] = new int[n];\\r\\n\\t\\tboolean visited[] = new boolean[n];\\r\\n\\r\\n\\t\\tfor(int i=0;i<n;i++)\\r\\n\\t\\t{\\r\\n\\r\\n\\t\\t\\tB[i]=Integer.MAX_VALUE;\\r\\n\\t\\t}\\r\\n\\t\\tB[g.map.get(p1)]=0;\\r\\n\\r\\n\\r\\n\\r\\n\\t\\tfor(int i=0;i<n; i++)\\r\\n\\t\\t\\tA[i]=i;\\r\\n\\r\\n\\t\\tfor(int i=0;i<n-1;i++)\\r\\n\\t\\t{\\r\\n\\r\\n\\t\\t\\tint minVertex = findMinVertex(B,visited);\\r\\n\\t\\t\\tvisited[minVertex]=true;\\r\\n\\t\\t\\tif(B[minVertex]!=Integer.MAX_VALUE)\\r\\n\\t\\t\\t{\\r\\n\\r\\n\\t\\t\\t\\twhile(memb[minVertex].first!=null)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tint t = memb[minVertex].first.fnum;\\r\\n\\t\\t\\t\\t\\tif(B[t]>B[minVertex]+1)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tB[t] = B[minVertex]+1;\\r\\n\\t\\t\\t\\t\\t\\tC[t]=minVertex;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\tmemb[minVertex].first = memb[minVertex].first.next;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\r\\n\\t\\t}\\r\\n\\t\\tint sourceIndex = g.map.get(p1);\\r\\n\\t\\tint destinationIndex = g.map.get(p2);\\r\\n\\t\\tif(sourceIndex==destinationIndex)\\r\\n\\t\\t{\\r\\n\\t\\t\\tshortestChain.add(0,memb[destinationIndex].name);\\r\\n\\t\\t\\tshortestChain.add(0,memb[destinationIndex].name);\\r\\n\\t\\t\\treturn shortestChain;\\r\\n\\t\\t}\\r\\n\\t\\tif(B[destinationIndex]==Integer.MAX_VALUE)\\r\\n\\t\\t\\treturn null;\\r\\n\\t\\tshortestChain.add(0,memb[destinationIndex].name);\\r\\n\\t\\twhile(true)\\r\\n\\t\\t{\\r\\n\\t\\t\\tif(B[destinationIndex]==Integer.MAX_VALUE)\\r\\n\\t\\t\\t\\treturn null;\\r\\n\\t\\t\\tshortestChain.add(0,memb[C[destinationIndex]].name);\\r\\n\\t\\t\\tdestinationIndex = C[destinationIndex];\\r\\n\\t\\t\\tif(destinationIndex==sourceIndex)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\t// FOLLOWING LINE IS A PLACEHOLDER TO MAKE COMPILER HAPPY\\r\\n\\t\\t// CHANGE AS REQUIRED FOR YOUR IMPLEMENTATION\\r\\n\\t\\treturn shortestChain;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eb726f16d13c4e8c5ed8018d19b6cd8d\",\n \"score\": \"0.5288879\",\n \"text\": \"public float[] shortPath() {\\n\\t\\t\\n\\t\\t// define u as integer\\n\\t\\tint u;\\n\\t\\t\\n\\t\\t// Setup S and dist[]\\n\\t\\tfor (int i=0 ; i <= this.n ; i++) {\\n\\t\\t\\t\\n\\t\\t\\t// Set all S element into false\\n\\t\\t\\tS[i] = false;\\n\\t\\t\\t\\n\\t\\t\\t// Set value of dist[]\\n\\t\\t\\t// This part is different from the book \\n\\t\\t\\t// This will help to determine min value to get the \\\"u\\\"\\n\\t\\t\\tif(cost[this.v][i] != 0.0) {\\n\\t\\t\\t\\t// set the distance of reachable vertex from v as the value on cost matrix\\n\\t\\t\\t\\tdist[i] = cost[this.v][i];\\n\\t\\t\\t} else {\\n\\t\\t\\t\\t// set unreached vertex from v to unlimited ( represent on Max Value of float )\\n\\t\\t\\t\\tdist[i] = Float.MAX_VALUE;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t// Set v into true, so it will not be examined for the next step\\n\\t\\tS[this.v] = true;\\n\\t\\t\\n\\t\\t// Set dist v to v into 0\\n\\t\\tdist[this.v] = (float) 0.0;\\n\\t\\t\\n\\t\\t/**\\n\\t\\t * Modification to print the path\\n\\t\\t */\\n\\t\\tparents[v] = this.NO_PARENT;\\n\\t\\t\\n\\t\\t// Begin iteration from the nearest vertex\\n\\t\\tfor(int num = 1 ; num < this.n ; num++) {\\n\\t\\t\\t\\n\\t\\t\\t// get the index of the nearest vertex\\n\\t\\t\\tu = minDistance(this.dist,this.S);\\n\\t\\t\\t\\n\\t\\t\\t// Set this index to True, so it will not re examined on next iteration\\n\\t\\t\\tthis.S[u] = true;\\n\\t\\t\\t\\n\\t\\t\\tif(num==1) {\\n\\t\\t\\t\\tparents[u] = v;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t\\tfor(int w = 0; w <= this.n ; w++) {\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Exchange the distance which is previously unreachable from v\\n\\t\\t\\t\\t// than become reachable through u\\n\\t\\t\\t\\t// adding the condition cost[u][w] != 0\\n\\t\\t\\t\\tif((S[w] == false) && (dist[w]>dist[u]+cost[u][w]) && (cost[u][w] != 0.0)) {\\n\\t\\t\\t\\t\\tparents[w] = u;\\n\\t\\t\\t\\t\\tdist[w] = dist[u]+cost[u][w];\\n\\t\\t\\t\\t}\\t\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t// return dist\\n\\t\\treturn dist;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a2b89aee462cbf1f46b6d913f53987f3\",\n \"score\": \"0.5284113\",\n \"text\": \"public double getMaximumDirectedPathLength() {\\n\\t\\treturn 0;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"534994f1375b921af532a57f90478405\",\n \"score\": \"0.52826786\",\n \"text\": \"@Test\\n public void lm_issue2() {\\n NodeAccess na = graph.getNodeAccess();\\n DecimalEncodedValue speedEnc = encoder.getAverageSpeedEnc();\\n na.setNode(0, 49.406987, 9.709767);\\n na.setNode(1, 49.403612, 9.702953);\\n na.setNode(2, 49.409755, 9.706517);\\n na.setNode(3, 49.409021, 9.708649);\\n na.setNode(4, 49.400674, 9.700906);\\n na.setNode(5, 49.408735, 9.709486);\\n na.setNode(6, 49.406402, 9.700937);\\n na.setNode(7, 49.406965, 9.702660);\\n na.setNode(8, 49.405227, 9.702863);\\n na.setNode(9, 49.409411, 9.709085);\\n graph.edge(0, 1, 623.197000, true).set(speedEnc, 112);\\n graph.edge(5, 1, 741.414000, true).set(speedEnc, 13);\\n graph.edge(9, 4, 1140.835000, true).set(speedEnc, 35);\\n graph.edge(5, 6, 670.689000, true).set(speedEnc, 18);\\n graph.edge(5, 9, 80.731000, false).set(speedEnc, 88);\\n graph.edge(0, 9, 273.948000, true).set(speedEnc, 82);\\n graph.edge(4, 0, 956.552000, true).set(speedEnc, 60);\\n preProcessGraph();\\n int source = 5;\\n int target = 4;\\n Path refPath = new DijkstraBidirectionRef(graph, weighting, NODE_BASED)\\n .calcPath(source, target);\\n Path path = createAlgo()\\n .calcPath(source, target);\\n comparePaths(refPath, path, source, target);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"18255526c78dc5fd8d245ece76ad291f\",\n \"score\": \"0.52822554\",\n \"text\": \"public static void main(String[] args) {\\r\\n GraphVisualization graph = new GraphVisualization();\\r\\n java.util.LinkedList<String> DistinctVertex = new java.util.LinkedList<String>();//used to enter vertexes\\r\\n java.util.LinkedList<String> SourceVertex = new java.util.LinkedList<String>();//to form directed graph\\r\\n java.util.LinkedList<String> DestinationVertex = new java.util.LinkedList<String>();//to form directed graph\\r\\n java.util.LinkedList<Integer> EdgeHeight = new java.util.LinkedList<Integer>();//used to enter edge weight\\r\\n\\r\\n Scanner s = new Scanner(System.in);\\r\\n int n; // number of points\\r\\n int a; // pointID\\r\\n int f; // number of food available at the point\\r\\n int l; // maxkang of the point\\r\\n int m; // number of route connected\\r\\n int threshold;//size of colony\\r\\n\\r\\n //MENU INPUT POINT\\r\\n System.out.println(\\\"(THE MAP/POINTS INPUT MENU)\\\");\\r\\n // ask the user to input the number of points\\r\\n System.out.print(\\\"Enter the number of points: \\\");\\r\\n n = s.nextInt();\\r\\n Hafiz = new Map(n);// set the number of points, tapi point masih belum ada\\r\\n// System.out.println(\\\"enter information, kat sini kene baiki cara user input\\\");\\r\\n System.out.println(\\\"Please enter information about points\\\");\\r\\n for (int i = 0; i < n; i++) {\\r\\n System.out.println(\\\"(Point \\\" + (i + 1) + \\\")\\\");\\r\\n a = i + 1;\\r\\n DistinctVertex.add(Integer.toString(a));\\r\\n System.out.print(\\\"Enter the number of food available at the point : \\\");\\r\\n f = s.nextInt();\\r\\n System.out.print(\\\"Enter the maximum amount of kangaroo that could fit in point \\\" + (i + 1) + \\\": \\\");\\r\\n l = s.nextInt();\\r\\n System.out.print(\\\"Enter the number of route that is connected to \\\" + (i + 1) + \\\": \\\");\\r\\n m = s.nextInt();\\r\\n Hafiz.points.addNode(new Points(a, f, l, m));\\r\\n System.out.println();\\r\\n System.out.println();\\r\\n }\\r\\n System.out.println();\\r\\n for (int i = 0; i < Hafiz.numberofpoints; i++) {\\r\\n if ((Hafiz.points.atindex(i).getnumroute() != 0)) {\\r\\n System.out.println(\\\"Point ID: \\\" + Hafiz.points.atindex(i).getpointID());\\r\\n for (int r = 0; r < Hafiz.points.atindex(i).getnumroute(); r++) {\\r\\n int tempID;\\r\\n System.out.print(\\\"Route from \\\" + Hafiz.points.atindex(i).getpointID() + \\\" to Point: \\\");\\r\\n tempID = s.nextInt();\\r\\n for (int t = 0; t < Hafiz.numberofpoints; t++) {\\r\\n if (Hafiz.points.atindex(t).getpointID() == tempID) {\\r\\n System.out.print(\\\"with height of: \\\");\\r\\n int tempheight = s.nextInt();\\r\\n Hafiz.points.atindex(i).addroute(new Route(Hafiz.points.atindex(t), tempheight));// tambah jalan\\r\\n\\r\\n SourceVertex.add(Integer.toString(Hafiz.points.atindex(i).getpointID()));\\r\\n DestinationVertex.add(Integer.toString(tempID));\\r\\n EdgeHeight.add(tempheight);\\r\\n }\\r\\n\\r\\n }\\r\\n }\\r\\n System.out.println();\\r\\n } else {\\r\\n System.out.println(\\\"Point ID: \\\" + Hafiz.points.atindex(i).getpointID() + \\\" has no outward route\\\");\\r\\n }\\r\\n System.out.println();\\r\\n }\\r\\n //END MENU INPUT POINT\\r\\n //test\\r\\n\\r\\n //KANGAROO INPUT POINT\\r\\n System.out.println(\\\"(THE KANGAROO INPUT MENU)\\\");\\r\\n System.out.print(\\\"Enter the amount of Kangaroo(s) for the whole map : \\\");\\r\\n int tempnumkang = s.nextInt();\\r\\n //i , s and p KANGAROOS INFORMATION\\r\\n System.out.println(\\\"Adding kangaroos id,gender(M/F),pouchcapacity\\\");\\r\\n for (int i = 0; i < tempnumkang; i++) {\\r\\n System.out.print(\\\"ID: \\\");\\r\\n int tempID = s.nextInt();\\r\\n System.out.print(\\\"Gender: \\\");\\r\\n s.nextLine();\\r\\n char c = s.nextLine().charAt(0);\\r\\n char c1 = Character.toUpperCase(c);\\r\\n Character tempgender = c1;\\r\\n System.out.print(\\\"Pouch Capacity: \\\");\\r\\n int temppouch = s.nextInt();\\r\\n Hafiz.Kangaroos.addNode(new Kangaroo(tempID, tempgender, temppouch));\\r\\n System.out.println();\\r\\n }\\r\\n System.out.println(\\\"Size of a colony(threshold): \\\");\\r\\n threshold = s.nextInt();\\r\\n Points.colony = threshold;\\r\\n System.out.println();\\r\\n System.out.println();\\r\\n //\\r\\n //END KANGAROO INPUT POINT\\r\\n graph.Visualize_Directed_Graph(DistinctVertex, SourceVertex, DestinationVertex, EdgeHeight);\\r\\n\\r\\n System.out.println(\\\"_____________________________________________________________\\\");\\r\\n System.out.println(\\\"List of route taken by the Kangaroo(s)\\\");\\r\\n Hafiz.tick();\\r\\n\\r\\n //\\r\\n int counter = 0;\\r\\n for (int i = 0; i < Hafiz.Kangaroos.length(); i++) { //kira bilangan kangaroo yang ada dalam colony\\r\\n if (Hafiz.Kangaroos.atindex(i).isincolony() == false) {\\r\\n // System.out.println(JumpyGrof.Kangaroos.atindex(i).toString());\\r\\n counter++;\\r\\n }\\r\\n }\\r\\n for (int i = 0; i < JumpyGrof.Hafiz.points.length(); i++) {\\r\\n // System.out.println(\\\"Food at point \\\" + JumpyGrof.Hafiz.points.atindex(i).getpointID() + \\\": \\\" + JumpyGrof.Hafiz.points.atindex(i).getfood());\\r\\n }\\r\\n\\r\\n // System.out.println(\\\"Number of colony formed: \\\" + Points.numberofcolony);\\r\\n System.out.println();\\r\\n System.out.println();\\r\\n //List of Kangaroos that was not able to colonized\\r\\n System.out.println(\\\"List of Kangaroos that was not able to colonized\\\");\\r\\n System.out.println(\\\"Number of Remaining Kangaroos: \\\" + counter);\\r\\n for (int i = 0; i < Hafiz.Kangaroos.length(); i++) {\\r\\n if (Hafiz.Kangaroos.atindex(i).isincolony() == false) {\\r\\n System.out.println(Hafiz.Kangaroos.atindex(i).toString());\\r\\n }\\r\\n }\\r\\n System.out.println();\\r\\n System.out.println();\\r\\n counter = 0;\\r\\n //\\r\\n\\r\\n //\\r\\n System.out.println(\\\"LIST OF FOOD LEFT (DEBUGGING)\\\");\\r\\n for (int i = 0; i < JumpyGrof.Hafiz.points.length(); i++) {\\r\\n System.out.println(\\\"Food at point \\\" + JumpyGrof.Hafiz.points.atindex(i).getpointID() + \\\": \\\" + JumpyGrof.Hafiz.points.atindex(i).getfood());\\r\\n }\\r\\n System.out.println();\\r\\n //\\r\\n\\r\\n //List of Kangaroos that are able to colonized\\r\\n System.out.println(\\\"List of Kangaroos that are able to colonized\\\");\\r\\n for (int i = 0; i < Hafiz.Kangaroos.length(); i++) {\\r\\n if (Hafiz.Kangaroos.atindex(i).isincolony() == true) {\\r\\n counter++;\\r\\n }\\r\\n }\\r\\n System.out.println(\\\"Number of colony formed: \\\" + Points.numberofcolony);\\r\\n System.out.println(\\\"Number of Kangaroos that are colonized: \\\" + counter);\\r\\n for (int i = 0; i < JumpyGrof.Hafiz.points.length(); i++) {\\r\\n if (JumpyGrof.Hafiz.points.atindex(i).iscolonized() == true) {\\r\\n System.out.println(\\\"Colony at point \\\" + JumpyGrof.Hafiz.points.atindex(i).getpointID());\\r\\n for (int j = 0; j < Hafiz.Kangaroos.length(); j++) {\\r\\n if (Hafiz.Kangaroos.atindex(j).getpointID() == JumpyGrof.Hafiz.points.atindex(i).getpointID()) {\\r\\n System.out.println(Hafiz.Kangaroos.atindex(j).toString());\\r\\n }\\r\\n }\\r\\n }\\r\\n }\\r\\n //\\r\\n System.out.println(\\\"________________________________________________________________________________________\\\");\\r\\n\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"470c4633d6cff60f5103b1a5e454b68a\",\n \"score\": \"0.5276353\",\n \"text\": \"public Graph() {\\r\\n\\t\\tvertices = new ArrayList<>();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a336f6bbc6821c27f9bf794e5cec1d3d\",\n \"score\": \"0.52716607\",\n \"text\": \"public void shortestPathPrecomputation() {\\n \\t\\n \\tshortestPath = new ArrayList[wordIndex.size()][wordIndex.size()];\\t//initialize the 2D arraylist. \\n \\t\\n \\tfor(int n = 0; n < wordIndex.size(); n++) {\\n\\t \\tArrayList<heapNode> visited = new ArrayList<heapNode>();\\t\\t//A list of visited nodes. Words are added\\n\\t \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//to this list if the node is removed from\\n\\t \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//the priority queue. \\n\\t \\tminHeap mh = new minHeap(wordIndex.size());\\t\\t\\t\\t\\t\\t//The priority queue\\n\\t \\tString curWord = wordIndex.get(n);\\t\\t\\t\\t\\t\\t\\t\\t//The starting word of the paths\\n\\t \\theapNode curNode = new heapNode(curWord, null);\\n\\t \\tmh.insert(curNode);\\n\\t \\t\\n\\t \\twhile(!mh.isEmpty()) {\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//remove the element with the shortest path\\n\\t \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//until the priority queue is empty\\n\\t \\t\\theapNode min = mh.getMin();\\n\\t \\t\\tvisited.add(min);\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//mark the node with shortest path visited\\n\\t \\t\\theapNode[] nodeList = mh.getList();\\n\\t \\t\\tfor(heapNode i : nodeList) {\\t\\t\\t\\t\\t\\t\\t\\t//for every item in the priority queue\\n\\t \\t\\t\\tIterable<String> neighbor = graph.getNeighbors(i.word);\\t//add all neighbors that are not marked \\n\\t \\t\\t\\tif(neighbor == null)\\t\\t\\t\\t\\t\\t\\t\\t\\t//visited and are not already in the queue\\n\\t \\t\\t\\t\\tcontinue;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//to the priority queue.\\n\\t \\t\\t\\tIterator<String> neighbors = neighbor.iterator();\\n\\t \\t\\t\\tpoint: while(neighbors.hasNext()){\\n\\t \\t\\t\\t\\tString newWord = neighbors.next();\\n\\t \\t\\t\\t\\tfor(heapNode j : visited) {\\n\\t \\t\\t\\t\\t\\tif(j.word.equals(newWord))\\n\\t\\t\\t\\t\\t\\t\\t\\tcontinue point;\\n\\t \\t\\t\\t\\t}\\n\\t \\t\\t\\t\\theapNode oldWord = mh.findNode(newWord);\\n\\t \\t\\t\\t\\theapNode newWordNode = new heapNode(newWord, i);\\n\\t \\t\\t\\t\\tif(oldWord == null)\\n\\t \\t\\t\\t\\t\\tmh.insert(new heapNode(newWord,i));\\n\\t \\t\\t\\t\\telse\\n\\t \\t\\t\\t\\t\\tif(oldWord.distance > newWordNode.distance)\\t//update the word in queue if a shorter path is\\n\\t \\t\\t\\t\\t\\t\\toldWord.setDistance(i);\\t\\t\\t\\t\\t//found (not expected in this program since\\n\\t \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//the distance is continuously increasing)\\n\\t \\t\\t\\t}\\n\\t \\t\\t}\\n\\t \\t\\tmh.removeMin();\\n\\t \\t}\\n\\t \\t\\n\\t \\tfor(int m = 0; m < visited.size(); m++) {\\t\\t\\t\\t//construct shortest paths between the starting \\n\\t \\t\\tList<String> path = new ArrayList<String>();\\t\\t//vertex and every other vertex possible.\\n\\t \\t\\theapNode pathNode = visited.get(m);\\n\\t \\t\\tpath.add(pathNode.word);\\t\\t\\t\\t\\t\\t\\t//put the destination in the list\\n\\t \\t\\tint destIndex = wordIndex.indexOf(pathNode.word);\\t//find the index of destination.\\n\\t \\t\\twhile(pathNode.ances != null) {\\t\\t\\t\\t\\t\\t//this is true when it reaches the starting node.\\n\\t \\t\\t\\tpathNode = pathNode.ances;\\n\\t \\t\\t\\tpath.add(0, pathNode.word);\\t\\t\\t\\t\\t\\t//add the previous node to the beginning of the path\\n\\t \\t\\t}\\n\\t \\t\\tshortestPath[n][destIndex] = path;\\n\\t \\t}\\n \\t}\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e7110d3006b13a1281d860e1e0e75cc2\",\n \"score\": \"0.52691007\",\n \"text\": \"public static void main(String[] args)\\r\\n {\\r\\n \\r\\n Graph graph = new Graph(32000); //I ran into a problem with making the graph index range any larger, not sure how to get around this issue. I tried\\r\\n graph.initializeNodes(graph, 32000); //allocating more memory in eclipse for heap space, but it didn't work. 30-32k seemed as high as I could take it. \\r\\n\\r\\n for(int i = 1; i<=5; i++)\\r\\n {\\r\\n System.out.print(\\\"Node \\\" + i + \\\"\\\\'s \\\");\\r\\n graph.showVertex(i);\\r\\n System.out.print(\\\"Routes: \\\\n\\\");\\r\\n graph.showEdges(i);\\r\\n System.out.println(\\\"\\\\n\\\");\\r\\n }\\r\\n\\r\\n int select = graph.search();\\r\\n graph.algorithmChoice(graph, select);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a1bcaffd665528fb5825e2f6931b1697\",\n \"score\": \"0.526657\",\n \"text\": \"public List getDirections_LeastKm(String startStationName, String endStationName)//求实际距离最短的路径\\n {\\n\\t\\tif(!this.hasStation(startStationName) || !this.hasStation(endStationName))\\n\\t\\t{\\n\\t\\t\\tthrow new RuntimeException(\\\"Stations entered do not exist on this subway.\\\");\\n\\t\\t}\\n\\n\\t\\tStation start = new Station(startStationName);\\n\\t\\tStation end = new Station(endStationName);\\n\\t\\tList route = new LinkedList();\\n\\t\\tList reachableStations = new LinkedList(); \\n\\t\\tList unreachStations=new LinkedList();\\n\\t\\tMap previousStations = new HashMap(); \\n\\t Map destLength=new HashMap();\\n\\t\\t\\n\\t\\t//Initialize the dest[]\\n\\t\\tfor(Iterator i = stations.iterator(); i.hasNext();)\\n\\t\\t{\\n\\t\\t\\tStation station = (Station)i.next();\\n\\t\\t\\tdestLength.put(station.getName(),100000);\\n\\t\\t}\\n\\n //Judge whether the destination is one station away from the start\\n\\t\\t//Initialize previousStations\\n\\t\\tList neighbors = (List)network.get(startStationName); \\n\\t\\tfor(Iterator i = neighbors.iterator(); i.hasNext();)\\n\\t\\t{\\n\\t\\t\\tStation station = (Station)i.next();\\n\\t\\t\\tif(station.equals(end))\\n\\t\\t\\t{\\n\\t\\t\\t\\troute.add(getConnection(start, end));\\n\\t\\t\\t\\treturn route;\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\tpreviousStations.put(station.getName(), start);\\n\\t\\t\\t\\tConnection connection=getConnection(start, station);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tList nextStations = new LinkedList();\\n\\t\\tStation currentStation = start;\\n\\t\\treachableStations.add(currentStation); \\n\\t\\tunreachStations.addAll(stations);\\n\\t\\tunreachStations.remove(start);\\n\\t int minLength=100000;\\n\\t\\tStation chosenStation;\\n\\t\\t\\n\\t\\t//Input the initial value to dest[] for iteration\\n\\t\\tfor(Iterator i = unreachStations.iterator(); i.hasNext();){\\n\\t\\t\\tStation station=(Station)i.next();\\n\\t\\t\\tif(hasConnection(start.getName(),station.getName())){\\n\\t\\t\\t\\tConnection connect = (Connection) getConnection(start,station);\\n\\t\\t\\t\\tdestLength.remove(station.getName());\\n\\t\\t\\t\\tdestLength.put(station.getName(),connect.getLength());\\n\\t\\t\\t}\\t\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t\\t//Dijkstra\\n\\t\\twhile(!unreachStations.isEmpty()){\\n\\t\\t\\tIterator temp=unreachStations.iterator();\\n\\t\\t\\tchosenStation=(Station)temp.next();\\n\\t\\t\\tminLength=(int)destLength.get(chosenStation.getName());\\n\\t\\t\\tfor(Iterator i = unreachStations.iterator(); i.hasNext();){\\n\\t\\t\\t Station station=(Station)i.next();\\n\\t\\t\\t\\tint length=(int)destLength.get(station.getName());\\n\\t\\t\\t\\tif(length<minLength){\\n\\t\\t\\t\\t\\tminLength=length;\\n\\t\\t\\t\\t\\tchosenStation=station;\\n\\t\\t\\t\\t}\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\tif(chosenStation.equals(end)){\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\treachableStations.add(chosenStation);\\n\\t\\t\\t\\tunreachStations.remove(chosenStation);\\n\\t\\t\\t\\tfor(Iterator j = unreachStations.iterator(); j.hasNext();){\\n\\t\\t\\t\\t\\tStation unStation=(Station)j.next();\\n\\t\\t\\t\\t\\tif(hasConnection(chosenStation.getName(),unStation.getName())){\\n\\t\\t\\t\\t\\t\\tConnection tempConnection=(Connection)getConnection(chosenStation,unStation);\\n\\t\\t\\t\\t\\t\\tif((int)destLength.get(unStation.getName())>(int)destLength.get(chosenStation.getName())+tempConnection.getLength()){\\n\\t\\t\\t\\t\\t\\t\\tdestLength.remove(unStation.getName());\\n\\t\\t\\t\\t\\t\\t\\tint newLength=(int)destLength.get(chosenStation.getName())+tempConnection.getLength();\\n\\t\\t\\t\\t\\t\\t\\tdestLength.put(unStation.getName(),newLength);\\n\\t\\t\\t\\t\\t\\t\\tpreviousStations.remove(unStation);\\n\\t\\t\\t\\t\\t\\t\\tpreviousStations.put(unStation.getName(), chosenStation);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\n\\t\\t//We've found the path by now.\\n\\t\\tboolean keepLooping = true;\\n\\t\\tStation keyStation = end;\\n\\t\\tStation station;\\n\\n\\t\\t//Once we've got a path, we just \\\"unwind\\\" the path, and create a List of connections to get from the starting station to the destination station.\\n\\t\\twhile(keepLooping)\\n\\t\\t{\\n\\t\\t\\tstation = (Station)previousStations.get(keyStation.getName());\\n\\t\\t\\troute.add(0, getConnection(station, keyStation));\\n\\t\\t\\tif(start.equals(station))\\n\\t\\t\\t{\\n\\t\\t\\t\\tkeepLooping = false;\\n\\t\\t\\t}\\n\\t\\t\\tkeyStation = station;\\n\\t\\t}\\n\\n\\t\\treturn route;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"feb17c9e9dda153569b46f99817efcb4\",\n \"score\": \"0.5262023\",\n \"text\": \"@Override\\n public List<node_data> shortestPath(int src, int dest) {\\n\\n if(this.k.nodeSize() == 0) return null;\\n\\n if(src == dest) {\\n List<node_data> l1 = new ArrayList<>();\\n l1.add(this.k.getNode(src));\\n return l1;\\n }\\n // change all the tags of nodes in the graph to 0 - like never visited\\n Collection<node_data> nodesCo = this.k.getV();\\n for(node_data node : nodesCo) node.setTag(0);\\n\\n ArrayList<node_data> path = new ArrayList<>();\\n ArrayList<NodeAlgo> prevs = new ArrayList<>();\\n\\n node_data a = this.k.getNode(src);\\n node_data b = this.k.getNode(dest);\\n\\n if(a == null || b == null) return null;\\n\\n Queue<node_data> queue = new LinkedList();\\n queue.add(a);\\n a.setTag(1);\\n\\n // BFS algorithm\\n while (!queue.isEmpty()) {\\n node_data t = queue.poll();\\n if (t == b) {\\n path.add(t);\\n while(t != a) {\\n for(int i = 0; i < prevs.size(); i++) {\\n if(t.getKey() == prevs.get(i).key.getKey()) {\\n path.add(t);\\n t = prevs.get(i).prev;\\n if(t == a) {\\n return path;\\n }\\n }\\n }\\n }\\n }\\n for (node_data m : t.getNi()) {\\n if (m.getTag() == 0) {\\n NodeAlgo temp = new NodeAlgo(m, t);\\n prevs.add(temp);\\n m.setTag(1);\\n queue.add(m);\\n }\\n }\\n }\\n\\n return null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c381d093d96cf757087a214fb4d863fb\",\n \"score\": \"0.52560717\",\n \"text\": \"public ArrayList<Vertex<T>> getAdjacencies(){\\n ArrayList<Vertex<T>> adj = new ArrayList<Vertex<T>>(this.adjacents);\\n return adj;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7204d00526a0e79664775dcef954066\",\n \"score\": \"0.5255827\",\n \"text\": \"private void sSSP(int src) {\\n\\n\\t\\tQueue<Integer> bfs = new LinkedList<>();\\n\\n\\t\\tbfs.add(src);\\n\\t\\tMap<Integer, Integer> dis = new HashMap<>(); // vertex - distance from source\\n\\t\\tfor (int vertex : adjList.keySet()) {\\n\\t\\t\\tdis.put(vertex, Integer.MAX_VALUE);\\n\\t\\t}\\n\\t\\tdis.put(src, 0);\\n\\n\\t\\twhile (!bfs.isEmpty()) {\\n\\t\\t\\tint front = bfs.poll(); // vertex - 4\\n\\t\\t\\t// System.out.print(front + \\\" \\\");\\n\\n\\t\\t\\tList<Integer> neighbourList = this.adjList.get(front); // [1, 3]\\n\\n\\t\\t\\tfor (int neighbour : neighbourList) {\\n\\t\\t\\t\\tif (dis.get(neighbour) == Integer.MAX_VALUE) { // agar neigbhour infinite distance pr hai source se, so\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// it is unvisited\\n\\t\\t\\t\\t\\tbfs.add(neighbour);\\n\\t\\t\\t\\t\\tint distance = dis.get(front) + 1; // 4 ka distance + 1 = 0 + 1 = 1;\\n\\t\\t\\t\\t\\tdis.put(neighbour, distance);\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"distance of \\\" + neighbour + \\\" from source \\\" + src + \\\" is \\\" + distance);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"998af662a08a5928d2e2e1bdcbe3bbf1\",\n \"score\": \"0.5254536\",\n \"text\": \"public static void main(String[] args) {\\n generator = new Random();\\n //test1();\\n\\n ListGraph graph = CreateDirectedAcyclicGraph();\\n FrmGraph frm = new FrmGraph(graph,70);\\n\\n if ( is_undirected(graph)) {\\n System.out.println(\\\"Graph is undirected\\\");\\n }\\n else {\\n System.out.println(\\\"Graph is directed\\\");\\n }\\n\\n if ( is_acyclic_graph(graph)) {\\n System.out.println(\\\"Graph is acyclic\\\");\\n }\\n else {\\n System.out.println(\\\"Graph is cyclic\\\");\\n }\\n ShortestPath s= new ShortestPath(graph);\\n ArrayList<Integer> path;\\n\\n path= s.getPath(0,9);\\n System.out.println(\\\"Shortest PAth from 0 to 9\\\");\\n printPath(graph, path);\\n\\n path= s.getPath(3,9);\\n System.out.println(\\\"Shortest PAth from 3 to 9\\\");\\n printPath(graph, path);\\n\\n\\n path= s.getPath(3,8);\\n System.out.println(\\\"Shortest PAth from 3 to 8\\\");\\n printPath(graph, path);\\n\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8500d3c854cf6d9d34bfc6513630d326\",\n \"score\": \"0.52484435\",\n \"text\": \"public Search(){\\r\\n\\t\\tgraph = new ArrayList<Vertex>();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f51ed14c927511307fa9d0ef7747723\",\n \"score\": \"0.5248127\",\n \"text\": \"private static void Dijkstra(Graph g) {\\n Vertex src = g.verts.get(1);\\n initialize(g, src);\\n IndexedHeap<Vertex> pq = new IndexedHeap<>(g.numNodes + 1, \\n (Vertex v1, Vertex v2) -> v1.distance - v2.distance);\\n for (Vertex u : g)\\n pq.add(u);\\n while (!pq.isEmpty()) {\\n Vertex u = pq.remove();\\n u.seen = true;\\n for (Edge e : u.Adj) {\\n Vertex v = e.otherEnd(u);\\n if (!v.seen) {\\n if (relax(u, v, e))\\n pq.decreaseKey(v);\\n }\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a9d229a5e499506d07efe75a479caffd\",\n \"score\": \"0.5242002\",\n \"text\": \"ArrayList<Vertex> neighbors(Vertex v);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7b9edccac8143df7ca7d8d6d61ef7d6\",\n \"score\": \"0.5239693\",\n \"text\": \"public static void leerArchivo(int num, double p){\\r\\n int mb = 1024 * 1024;\\r\\n long beforeUsedMem=Runtime.getRuntime().totalMemory()-Runtime.getRuntime().freeMemory();\\r\\n long startTime = 0;\\r\\n long endTime=0;\\r\\n final String nombreDelArchivo = \\\"dataset-ejemplo-U=\\\"+num+\\\"-p=\\\"+p+\\\".txt\\\";\\r\\n Graph graph = new Graph(num);\\r\\n try {\\r\\n BufferedReader br = new BufferedReader(new FileReader(nombreDelArchivo));\\r\\n String lineaActual = br.readLine();\\r\\n for (int i = 1; i <= 3; i++)lineaActual = br.readLine();\\r\\n for (int i = 0; i < num ; i++){\\r\\n lineaActual = br.readLine();\\r\\n String name= \\\"\\\";\\r\\n String [] cadenaParticionada = lineaActual.split(\\\" \\\");\\r\\n if ((cadenaParticionada.length >= 4)) {\\r\\n for (int j=3; j<cadenaParticionada.length;j++) name += \\\" \\\"+cadenaParticionada[j];\\r\\n }\\r\\n int v =Integer.parseInt(cadenaParticionada[0]);\\r\\n double x = Double.parseDouble(cadenaParticionada[1]);\\r\\n double y = Double.parseDouble(cadenaParticionada[2]);\\r\\n if (v==1) graph.addNode(v,x,y,name,0);\\r\\n else graph.addNode(v,x,y,name);\\r\\n }\\r\\n\\r\\n for (int i = 1; i <= 3; i++)\\r\\n lineaActual = br.readLine();\\r\\n startTime=System.currentTimeMillis();\\r\\n lineaActual = br.readLine();\\r\\n while (lineaActual != null){\\r\\n String [] cadenaParticionada = lineaActual.split(\\\" \\\");\\r\\n int src = Integer.parseInt(cadenaParticionada[0]);\\r\\n int dest = Integer.parseInt(cadenaParticionada[1]);\\r\\n double weight = Double.parseDouble(cadenaParticionada[2]);\\r\\n if (src==1) graph.addHval(dest,weight);\\r\\n graph.addSuccesor(src,dest,weight);\\r\\n lineaActual = br.readLine();\\r\\n }\\r\\n endTime = System.currentTimeMillis();\\r\\n }\\r\\n catch(IOException ioe) {\\r\\n System.out.println(\\\"Error leyendo el archivo de entrada: \\\" + ioe.getMessage());\\r\\n }\\r\\n\\r\\n\\r\\n\\r\\n\\r\\n graph.solve(p);\\r\\n// long endTime = System.currentTimeMillis();\\r\\n\\r\\n long timeElapsed = endTime - startTime;\\r\\n\\r\\n System.out.println(\\\"Execution time in milliseconds: \\\" + timeElapsed);\\r\\n graph.reset();\\r\\n\\r\\n long afterUsedMem=Runtime.getRuntime().totalMemory()-Runtime.getRuntime().freeMemory();\\r\\n long actualMemUsed=afterUsedMem-beforeUsedMem;\\r\\n //System.out.print(actualMemUsed);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0a2852282a2df6d7ec422a710b2f88ef\",\n \"score\": \"0.5238385\",\n \"text\": \"public Test(){\\n\\t\\tgraphAdjacencyList.add( new LinkedList<Integer>() );\\t\\t//ignore 0th index to make future access more understandable\\n\\t\\tgraphAdjacencyList.add( new LinkedList<Integer>( Arrays.asList(2, 3) ) );\\n\\t\\tgraphAdjacencyList.add( new LinkedList<Integer>( Arrays.asList(1, 3, 4, 5) ) );\\n\\t\\tgraphAdjacencyList.add( new LinkedList<Integer>( Arrays.asList(1, 2, 5, 7, 8) ) );\\n\\t\\tgraphAdjacencyList.add( new LinkedList<Integer>( Arrays.asList(2, 5) ) );\\n\\t\\tgraphAdjacencyList.add( new LinkedList<Integer>( Arrays.asList(2, 3, 4, 6) ) );\\n\\t\\tgraphAdjacencyList.add( new LinkedList<Integer>( Arrays.asList(5) ) );\\n\\t\\tgraphAdjacencyList.add( new LinkedList<Integer>( Arrays.asList(3, 8) ) );\\n\\t\\tgraphAdjacencyList.add( new LinkedList<Integer>( Arrays.asList(3, 7) ) );\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"47696f3be4b16d1ba94369455f64a2b7\",\n \"score\": \"0.52290887\",\n \"text\": \"public int[] dijkstra(Nodo nodo) {\\r\\n\\t\\tList<Integer> usados = new ArrayList<Integer>();\\r\\n\\t\\tList<Integer> pendientes = new ArrayList<Integer>();\\r\\n\\t\\tint[] vectorResultado = new int[nodos.size()];\\r\\n\\t\\tint[] vectorCamino = new int[nodos.size()];\\r\\n\\r\\n\\t\\tusados.add(nodos.indexOf(nodo)); // agrego el nodo existente a la lista de usados\\r\\n\\t\\tfor (int i = 0; i < nodos.size(); i++)\\r\\n\\t\\t\\tif (nodos.get(i) != nodo) { // lleno el vector y la lista de pendientes\\r\\n\\t\\t\\t\\tvectorResultado[i] = ((MatrizAsimetrica) matrizAdyacencia).getValueAt(nodos.indexOf(nodo), i);\\r\\n\\t\\t\\t\\tpendientes.add(nodos.indexOf(nodos.get(i)));\\r\\n\\t\\t\\t}\\r\\n\\r\\n\\t\\twhile (!pendientes.isEmpty()) {\\r\\n\\t\\t\\tint pibote = buscarMin(vectorResultado, pendientes); // busco en el vector el minimo, en relacion con la lista\\r\\n\\t\\t\\tusados.add(pibote); // agrego el nodo que salio nominado a los usados\\r\\n\\t\\t\\tfor (Integer numero : pendientes)\\r\\n\\t\\t\\t\\tvectorResultado[numero] = reemplazarMinimo(vectorResultado, vectorCamino, pibote, numero);\\r\\n\\t\\t}\\r\\n\\t\\treturn vectorResultado;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fe61c8b4ac6e287d94f00f2945827b86\",\n \"score\": \"0.5228566\",\n \"text\": \"private static int distance(ArrayList<Integer>[] adj, ArrayList<Integer>[] cost, int s, int t) {\\n \\tint[] dist = new int[adj.length];\\n int[] prev = new int[adj.length];\\n for(int i = 0; i < dist.length; ++i) {\\n \\tdist[i] = Integer.MAX_VALUE;\\n \\tprev[i] = -1; \\n }\\n dist[s] = 0;\\n // TODO Java do not support ChangePriority in PriorityQueue\\n \\t// we use a HashSet to record incomplete Vertices\\n \\tPriorityQueue<Vertex> pQueue = new PriorityQueue<>();\\n \\tHashSet<Integer> set = new HashSet<>();\\n \\tfor(int v = 0; v < adj.length; ++v) {\\n \\t\\t// Although it is not necessary to add all Vertices into pQueue\\n \\t\\t// at the beginning, to prevent consistency, I still add them all.\\n \\t\\tpQueue.offer(new Vertex(v, dist[v]));\\n \\t\\tset.add(v);\\n \\t}\\n while(!set.isEmpty()) {\\n \\tVertex u = pQueue.poll();\\n \\t// TODO mark u as processed immediately\\n \\tset.remove(u.index);\\n// \\tSystem.out.print(u.index);\\n// \\tSystem.out.print(\\\": \\\");\\n \\tfor(int i = 0; i < adj[u.index].size(); ++i) {\\n \\t\\tint v = adj[u.index].get(i);\\n// \\t\\tSystem.out.print(v);\\n// \\t\\tSystem.out.print(\\\" \\\");\\n \\t\\t// TODO have to check if v processed already\\n \\t\\t// since we cannot modify Vertices in pQueue\\n \\t\\tif(set.contains(v) && dist[v] > dist[u.index] + cost[u.index].get(i)) {\\n \\t\\t\\tdist[v] = dist[u.index] + cost[u.index].get(i);\\n \\t\\t\\tprev[v] = u.index;\\n \\t\\t\\tpQueue.add(new Vertex(v, dist[v]));\\n \\t\\t}\\n \\t}\\n// \\tSystem.out.println();\\n }\\n // TODO if invalid, return -1\\n \\treturn (dist[t] >= 0 && dist[t] < Integer.MAX_VALUE)? dist[t]: -1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3538804d70336a5a1e39d30501c2ab17\",\n \"score\": \"0.5220576\",\n \"text\": \"private void dijkstra(String nodeName)\\n {\\n int i=0;\\n boolean flag=false;\\n while(i<this.listNodes.size() && !flag)\\n {\\n if(this.listNodes.get(i).getName().equalsIgnoreCase(nodeName))\\n {\\n flag=true;\\n }else\\n {\\n i++;\\n }\\n }\\n this.markedList.add(nodeName);\\n String[] aux=this.dijkstra.get(nodeName).split(\\\";\\\");\\n int value=Integer.parseInt(aux[0]);\\n String label=aux[1];\\n for (GraphEdge edge : this.listEdges.get(i)) \\n {\\n if(!this.markedList.contains(edge.getEndNode().getName()))\\n {\\n if(!this.dijkstra.get(edge.getEndNode().getName()).equalsIgnoreCase(\\\"&\\\"))\\n {\\n String aux2[]=this.dijkstra.get(edge.getEndNode().getName()).split(\\\";\\\");\\n if(Integer.parseInt(aux[0])>(value+edge.getValue()) )\\n {\\n this.dijkstra.put(edge.getEndNode().getName(), (value+edge.getValue()+\\\";\\\"+nodeName));\\n }\\n }else\\n {\\n this.dijkstra.put(edge.getEndNode().getName(), (value+edge.getValue()+\\\";\\\"+nodeName));\\n }\\n }\\n }\\n String nextNode=searchLower();\\n if(!nextNode.equals(\\\"\\\"))\\n {\\n dijkstra(nextNode);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"64f870c26dc9e69502e4fcb094ac7334\",\n \"score\": \"0.5217945\",\n \"text\": \"public Graph(File topology)\\n {\\n vertices = new ArrayList<>();\\n links = new ArrayList<>();\\n \\n try {\\n Scanner sc = new Scanner(new FileReader(topology));\\n \\n String[] lines = null, columns = null;\\n if(sc.hasNextLine())\\n \\tlines = sc.nextLine().split(\\\"; \\\");\\n if(sc.hasNextLine())\\n \\tcolumns = sc.nextLine().split(\\\"; \\\");\\n \\n for(int i = 0; i < lines.length; i++) {\\n \\tfor(int j = 0; j <= columns.length; j++) {\\n \\t\\tString vertice = i + \\\"\\\" + j;\\n \\t\\tthis.addVertice(vertice);\\n \\t\\tSystem.out.println(\\\"Vertice add: \\\"+vertice);\\n \\t\\t\\n \\t}\\n }\\n \\n for(int i = 0; i < lines.length; i++) {\\n \\tString [] line = lines[i].split(\\\" \\\");\\n \\tfor(int j = 0; j < line.length; j++) {\\n \\t\\tif(line[j].contains(\\\";\\\"))\\n \\t\\t\\tline[j]=line[j].substring(0, line[j].length()-1);\\n \\t\\tSystem.out.println(\\\"line[j] \\\"+line[j]);\\n \\t\\tif(line[j].equals(\\\"0\\\")) { //there is a link\\n \\t\\tRouter starting = this.getVertice(\\\"\\\" + j + (columns.length - i));\\n \\t\\tRouter ending = this.getVertice(\\\"\\\" + (j+1) + (columns.length - i));\\n \\t\\tthis.addAresta(starting, ending, ports[2]);\\n \\t\\tthis.addAresta(ending, starting, ports[3]); \\t\\t\\t\\n \\t\\t}\\n \\t\\tif(!line[j].equals(\\\"0\\\") && !line[j].equals(\\\"1\\\")){\\n \\t\\t\\t\\n \\t\\t\\tRouter starting = this.getVertice(\\\"\\\" + j + (columns.length - i)); \\t\\t\\t\\n \\t\\tRouter ending = this.getVertice(\\\"\\\" + (j+1) + (columns.length - i)); \\t\\t\\n \\t\\tthis.addAresta(starting, ending, ports[2]);\\n \\t\\tthis.addAresta(ending, starting, ports[3]); \\n \\t\\tstarting.getLink(ending).setDFER(Double.parseDouble(line[j]));\\n \\t\\tending.getLink(starting).setDFER(Double.parseDouble(line[j]));\\n \\t\\t}\\n \\t}\\n }\\n\\n for(int i = 0; i < columns.length; i++) {\\n \\tString [] column = columns[i].split(\\\" \\\");\\n \\tfor(int j = 0; j < column.length; j++) { \\t\\t\\n \\t\\tif(column[j].contains(\\\";\\\"))\\n \\t\\t\\tcolumn[j]=column[j].substring(0, column[j].length()-1);\\n \\t\\t\\n \\t\\tif(column[j].equals(\\\"0\\\")) { //there is a link\\n \\t\\tRouter starting = this.getVertice(j + \\\"\\\" + (columns.length - i));\\n \\t\\tRouter ending = this.getVertice(j + \\\"\\\" + (columns.length - 1 - i));\\n \\t\\tthis.addAresta(starting, ending, ports[1]);\\n \\t\\tthis.addAresta(ending, starting, ports[0]); \\t\\t\\t\\n \\t\\t}\\n \\t\\t\\n \\t\\tif(!column[j].equals(\\\"0\\\") && !column[j].equals(\\\"1\\\")){\\n \\t\\t\\tRouter starting = this.getVertice(\\\"\\\" + j + (columns.length - i));\\n \\t\\tRouter ending = this.getVertice(\\\"\\\" + j + (columns.length -1 - i));\\n \\t\\tthis.addAresta(starting, ending, ports[1]);\\n \\t\\tthis.addAresta(ending, starting, ports[0]);\\n \\t\\t\\n \\t\\tstarting.getLink(ending).setDFER(Double.parseDouble(column[j]));\\n \\t\\tending.getLink(starting).setDFER(Double.parseDouble(column[j]));\\n \\t\\t}\\n \\t}\\n }\\n\\n sc.close();\\n \\n \\n } catch(Exception ex) { \\n Logger.getLogger(Graph.class.getName()).log(Level.SEVERE, null, ex);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a000b1cae35cad1aaf1d218e32c8b598\",\n \"score\": \"0.52121097\",\n \"text\": \"public int calcLongestRoad2()\\r\\n {\\r\\n //Date startTime = new Date();\\r\\n //\\r\\n // clear the lr paths vector so that we have an accurate\\r\\n // representation. if someone cut our longest path in two\\r\\n // we won't catch it unless we clear the vector\\r\\n //\\r\\n D.ebugPrintln(\\\"CLEARING PATH DATA\\\");\\r\\n lrPaths.removeAllElements();\\r\\n \\r\\n /**\\r\\n * we're doing a depth first search of all possible road paths\\r\\n */\\r\\n SOCBoard board = game.getBoard();\\r\\n Stack pending = new Stack();\\r\\n int longest = 0;\\r\\n \\r\\n for (Enumeration e = roadNodes.elements(); e.hasMoreElements();)\\r\\n {\\r\\n Integer roadNode = (Integer) e.nextElement();\\r\\n int pathStartCoord = roadNode.intValue();\\r\\n pending.push(new NodeLenVis(pathStartCoord, 0, new Vector()));\\r\\n \\r\\n while (!pending.isEmpty())\\r\\n {\\r\\n NodeLenVis curNode = (NodeLenVis) pending.pop();\\r\\n int coord = curNode.node;\\r\\n int len = curNode.len;\\r\\n Vector visited = curNode.vis;\\r\\n boolean pathEnd = false;\\r\\n \\r\\n /**\\r\\n * check for road blocks\\r\\n */\\r\\n Enumeration pEnum = board.getPieces().elements();\\r\\n \\r\\n while (pEnum.hasMoreElements())\\r\\n {\\r\\n SOCPlayingPiece p = (SOCPlayingPiece) pEnum.nextElement();\\r\\n \\r\\n if ((len > 0) && (p.getPlayer().getPlayerNumber() != this.getPlayerNumber()) && ((p.getType() == SOCPlayingPiece.SETTLEMENT) || (p.getType() == SOCPlayingPiece.CITY)) && (p.getCoordinates() == coord))\\r\\n {\\r\\n pathEnd = true;\\r\\n \\r\\n //D.ebugPrintln(\\\"^^^ path end at \\\"+Integer.toHexString(coord));\\r\\n break;\\r\\n }\\r\\n }\\r\\n \\r\\n if (!pathEnd)\\r\\n {\\r\\n pathEnd = true;\\r\\n \\r\\n int j;\\r\\n IntPair pair;\\r\\n boolean match;\\r\\n \\r\\n j = coord - 0x11;\\r\\n pair = new IntPair(coord, j);\\r\\n match = false;\\r\\n \\r\\n if (board.isNodeOnBoard(j) && isConnectedByRoad(coord, j))\\r\\n {\\r\\n for (Enumeration ev = visited.elements();\\r\\n ev.hasMoreElements();)\\r\\n {\\r\\n IntPair vis = (IntPair) ev.nextElement();\\r\\n \\r\\n if (vis.equals(pair))\\r\\n {\\r\\n match = true;\\r\\n \\r\\n break;\\r\\n }\\r\\n }\\r\\n \\r\\n if (!match)\\r\\n {\\r\\n Vector newVis = (Vector) visited.clone();\\r\\n newVis.addElement(pair);\\r\\n pending.push(new NodeLenVis(j, len + 1, newVis));\\r\\n pathEnd = false;\\r\\n }\\r\\n }\\r\\n \\r\\n j = coord + 0x11;\\r\\n pair = new IntPair(coord, j);\\r\\n match = false;\\r\\n \\r\\n if (board.isNodeOnBoard(j) && isConnectedByRoad(coord, j))\\r\\n {\\r\\n for (Enumeration ev = visited.elements();\\r\\n ev.hasMoreElements();)\\r\\n {\\r\\n IntPair vis = (IntPair) ev.nextElement();\\r\\n \\r\\n if (vis.equals(pair))\\r\\n {\\r\\n match = true;\\r\\n \\r\\n break;\\r\\n }\\r\\n }\\r\\n \\r\\n if (!match)\\r\\n {\\r\\n Vector newVis = (Vector) visited.clone();\\r\\n newVis.addElement(pair);\\r\\n pending.push(new NodeLenVis(j, len + 1, newVis));\\r\\n pathEnd = false;\\r\\n }\\r\\n }\\r\\n \\r\\n j = (coord + 0x10) - 0x01;\\r\\n pair = new IntPair(coord, j);\\r\\n match = false;\\r\\n \\r\\n if (board.isNodeOnBoard(j) && isConnectedByRoad(coord, j))\\r\\n {\\r\\n for (Enumeration ev = visited.elements();\\r\\n ev.hasMoreElements();)\\r\\n {\\r\\n IntPair vis = (IntPair) ev.nextElement();\\r\\n \\r\\n if (vis.equals(pair))\\r\\n {\\r\\n match = true;\\r\\n \\r\\n break;\\r\\n }\\r\\n }\\r\\n \\r\\n if (!match)\\r\\n {\\r\\n Vector newVis = (Vector) visited.clone();\\r\\n newVis.addElement(pair);\\r\\n pending.push(new NodeLenVis(j, len + 1, newVis));\\r\\n pathEnd = false;\\r\\n }\\r\\n }\\r\\n \\r\\n j = coord - 0x10 + 0x01;\\r\\n pair = new IntPair(coord, j);\\r\\n match = false;\\r\\n \\r\\n if (board.isNodeOnBoard(j) && isConnectedByRoad(coord, j))\\r\\n {\\r\\n for (Enumeration ev = visited.elements();\\r\\n ev.hasMoreElements();)\\r\\n {\\r\\n IntPair vis = (IntPair) ev.nextElement();\\r\\n \\r\\n if (vis.equals(pair))\\r\\n {\\r\\n match = true;\\r\\n \\r\\n break;\\r\\n }\\r\\n }\\r\\n \\r\\n if (!match)\\r\\n {\\r\\n Vector newVis = (Vector) visited.clone();\\r\\n newVis.addElement(pair);\\r\\n pending.push(new NodeLenVis(j, len + 1, newVis));\\r\\n pathEnd = false;\\r\\n }\\r\\n }\\r\\n }\\r\\n \\r\\n if (pathEnd)\\r\\n {\\r\\n if (len > longest)\\r\\n {\\r\\n longest = len;\\r\\n }\\r\\n \\r\\n //\\r\\n // we want to store the longest path for a single set of nodes\\r\\n // check to make sure that we don't save two paths that share a node\\r\\n //\\r\\n boolean intersection;\\r\\n boolean addNewPath = true;\\r\\n Vector trash = new Vector();\\r\\n \\r\\n for (Enumeration pdEnum = lrPaths.elements();\\r\\n pdEnum.hasMoreElements();)\\r\\n {\\r\\n SOCLRPathData oldPathData = (SOCLRPathData) pdEnum.nextElement();\\r\\n D.ebugPrintln(\\\"oldPathData = \\\" + oldPathData);\\r\\n \\r\\n Vector nodePairs = oldPathData.getNodePairs();\\r\\n intersection = false;\\r\\n \\r\\n for (Enumeration ev = visited.elements();\\r\\n ev.hasMoreElements();)\\r\\n {\\r\\n IntPair vis = (IntPair) ev.nextElement();\\r\\n D.ebugPrintln(\\\"vis = \\\" + vis);\\r\\n \\r\\n for (Enumeration npev = nodePairs.elements();\\r\\n npev.hasMoreElements();)\\r\\n {\\r\\n IntPair np = (IntPair) npev.nextElement();\\r\\n D.ebugPrintln(\\\"np = \\\" + np);\\r\\n \\r\\n if (np.equals(vis))\\r\\n {\\r\\n D.ebugPrintln(\\\"oldPathData.nodePairs.contains(vis)\\\");\\r\\n intersection = true;\\r\\n \\r\\n break;\\r\\n }\\r\\n }\\r\\n \\r\\n if (intersection)\\r\\n {\\r\\n break;\\r\\n }\\r\\n }\\r\\n \\r\\n if (intersection)\\r\\n {\\r\\n //\\r\\n // only keep the longer of the two paths\\r\\n //\\r\\n if (oldPathData.getLength() < len)\\r\\n {\\r\\n D.ebugPrintln(\\\"REMOVING OLDPATHDATA\\\");\\r\\n trash.addElement(oldPathData);\\r\\n }\\r\\n else\\r\\n {\\r\\n addNewPath = false;\\r\\n D.ebugPrintln(\\\"NOT ADDING NEW PATH\\\");\\r\\n }\\r\\n }\\r\\n }\\r\\n \\r\\n if (!trash.isEmpty())\\r\\n {\\r\\n for (Enumeration trashEnum = trash.elements();\\r\\n trashEnum.hasMoreElements();)\\r\\n {\\r\\n SOCLRPathData oldPathData = (SOCLRPathData) trashEnum.nextElement();\\r\\n lrPaths.removeElement(oldPathData);\\r\\n }\\r\\n }\\r\\n \\r\\n if (addNewPath)\\r\\n {\\r\\n SOCLRPathData newPathData = new SOCLRPathData(pathStartCoord, coord, len, visited);\\r\\n D.ebugPrintln(\\\"ADDING PATH: \\\" + newPathData);\\r\\n lrPaths.addElement(newPathData);\\r\\n }\\r\\n }\\r\\n }\\r\\n }\\r\\n \\r\\n longestRoadLength = longest;\\r\\n \\r\\n //Date stopTime = new Date();\\r\\n //long elapsed = stopTime.getTime() - startTime.getTime();\\r\\n //System.out.println(\\\"LONGEST FOR \\\"+name+\\\" IS \\\"+longest+\\\" TIME = \\\"+elapsed+\\\"ms\\\");\\r\\n return longest;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"efb2334f0adb82ee05fb00f273a94d97\",\n \"score\": \"0.5209543\",\n \"text\": \"public static void shortestPaths(String a) {\\n\\t\\tNode start = adjList.get(a);\\n\\t\\tPriorityQueue<Node> pq = new PriorityQueue<Node>();\\n\\t\\tint count = 0;\\n\\n\\t\\t// Makes distance from start Node infinity except for itself, which will be 0.\\n\\t\\tfor (String i : adjList.keySet()) {\\n\\t\\t\\tNode n = adjList.get(i);\\n\\t\\t\\tn.dist = Integer.MAX_VALUE;\\n\\t\\t\\tif (n.id == start.id) {\\n\\t\\t\\t\\tn.dist = 0;\\n\\t\\t\\t}\\n\\t\\t\\tcount++;\\n\\t\\t\\tpq.add(n);\\n\\t\\t}\\n\\n\\t\\t/* After it is added to the PQ the Node with the minimum distance will be visited. If a Node\\n\\t\\t * it is connected to has not been visited, it will visit and create a cost to reach it from\\n\\t\\t * the given start Node. It also keeps track of what order the nodes were visited.\\n\\t\\t */\\n\\t\\twhile (count > 0) {\\n\\t\\t\\tNode curr = adjList.get(pq.poll().id);\\n\\t\\t\\tcurr.visited = true;\\n\\t\\t\\tcount--;\\n\\t\\t\\tLinkedList<Node> connections = curr.adjacence;\\n\\t\\t\\t\\n\\t\\t\\tfor (Node n : connections) {\\n\\t\\t\\t\\tif (n.visited == false) {\\n\\t\\t\\t\\t\\tdouble cost = curr.edgeConnections.get(n).distance;\\n\\t\\t\\t\\t\\tif (n.dist > curr.dist + cost) {\\n\\t\\t\\t\\t\\t\\tn.parent = curr; // Keeps track of order of nodes visited.\\n\\t\\t\\t\\t\\t\\tn.dist = curr.dist + cost;\\n\\t\\t\\t\\t\\t\\tpq.remove(n);\\n\\t\\t\\t\\t\\t\\tpq.add(n);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a499430378885460d7f38f736524c21d\",\n \"score\": \"0.520513\",\n \"text\": \"public void minimumPathDijkstra(String source) {\\n int sourceIndex = verticesIndexes(source);\\n int[] minimumWeights = new int[totalVertices];\\n boolean[] visited = new boolean[totalVertices];\\n\\n for (int vertexIndex = 0; vertexIndex < totalVertices; vertexIndex++) {\\n minimumWeights[vertexIndex] = Integer.MAX_VALUE;\\n visited[vertexIndex] = false;\\n }\\n\\n minimumWeights[sourceIndex] = 0;\\n int[] parents = new int[totalVertices];\\n parents[sourceIndex] = -1;\\n\\n for (int index = 0; index < totalVertices; index++) {\\n int neighbour = -1;\\n int minumum = Integer.MAX_VALUE;\\n for (int vertexIndex = 0; vertexIndex < totalVertices; vertexIndex++) {\\n if (!visited[vertexIndex] && minimumWeights[vertexIndex] < minumum) {\\n neighbour = vertexIndex;\\n minumum = minimumWeights[vertexIndex];\\n }\\n }\\n\\n visited[neighbour] = true;\\n\\n for (int vertexIndex = 0; vertexIndex < totalVertices; vertexIndex++) {\\n int edgeDistance = adjacencyMatrix[neighbour][vertexIndex];\\n if (edgeDistance > 0 && ((minumum + edgeDistance) < minimumWeights[vertexIndex])) {\\n parents[vertexIndex] = neighbour;\\n minimumWeights[vertexIndex] = minumum + edgeDistance;\\n }\\n }\\n }\\n displayMinimum(sourceIndex, minimumWeights, parents);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f4ad48d4e8b767df28cc4537419a1e53\",\n \"score\": \"0.52022773\",\n \"text\": \"public Link(long dd) // constructor\\n{ dData = dd; }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7fcf7394b0f4054bab67364b44098c5c\",\n \"score\": \"0.5199872\",\n \"text\": \"public void printPath(Dijkstra d, Graph g){\\n int e = d.getNumberLineEnd();\\n //Récupétation des chemins\\n while(e != d.getNumberLineBegin())\\n {\\n d.getStationsPath().add(g.getStations().get(e));\\n int tmp = e;\\n e = d.getParent()[e];\\n d.setDuration(d.getDuration() + g.getNetWork()[tmp][e].getWeight());\\n }\\n d.getStationsPath().add(g.getStations().get(e));\\n\\n //Inversion du liste de chemin.\\n Collections.reverse(d.getStationsPath());\\n\\n ArrayList<Station> s = new ArrayList<Station>();\\n s.add(d.getStationsPath().get(0));\\n for( int i = 1; i < d.getStationsPath().size() - 1; i++ ){\\n if( d.getStationsPath().get(i).getNumberLine() != d.getStationsPath().get(i + 1).getNumberLine() ){\\n s.add(d.getStationsPath().get(i));\\n s.add(d.getStationsPath().get(i + 1));\\n }\\n\\n }\\n s.add(d.getStationsPath().get(d.getStationsPath().size() - 1));\\n\\n //Traçage du chemin.\\n System.out.println(\\\"Vous êtes: \\\" + d.getStationsPath().get(0).getNameStation());\\n if( 2 < d.getStationsPath().size() ){\\n int x1 = d.getStationsPath().get(1).getNumberStation(), y1 = d.getStationsPath().get(2).getNumberStation();\\n int numStation = g.getNetWork()[x1][y1].getTerminus();\\n if( numStation == sNO_TERMINUS )\\n numStation = x1;\\n if( numStation == 30 ){\\n System.out.print(\\\"- Prenez la ligne 3bis \\\");\\n }else if( numStation == 70 ){\\n System.out.print(\\\"- Prenez la ligne 7bis \\\");\\n }else {\\n System.out.print(\\\"- Prenez la ligne \\\" + d.getStationsPath().get(0).getNumberLine());\\n }\\n System.out.println(\\\" direction \\\" + g.getStations().get(numStation).getNameStation());\\n }\\n else {\\n int x1 = d.getStationsPath().get(0).getNumberStation(), y1 = d.getStationsPath().get(1).getNumberStation();\\n int numStation = g.getNetWork()[x1][y1].getTerminus();\\n System.out.print(\\\"- Prenez la ligne \\\" + d.getStationsPath().get(0).getNumberLine());\\n System.out.println(\\\" direction \\\" + g.getStations().get(numStation).getNameStation());\\n }\\n\\n for( int i = 2; i < s.size() - 1; i += 2 ){\\n int x = s.get(i).getNumberStation(),\\n y = s.get(i + 1).getNumberStation();\\n int station = g.getNetWork()[x][y].getTerminus();\\n System.out.print(\\\"- A \\\" + g.getStations().get(x).getNameStation() );\\n if( station == 30 ){\\n System.out.print(\\\" prenez la ligne 3bis \\\");\\n }else if( station == 70 ){\\n System.out.print(\\\" prenez la ligne 7bis \\\");\\n }else {\\n System.out.print(\\\" prenez la ligne \\\" + g.getStations().get(x).getNumberLine());\\n }\\n if( station == sNO_TERMINUS ){\\n station = y;\\n }\\n System.out.println(\\\" direction \\\" + g.getStations().get(station).getNameStation());\\n }\\n\\n System.out.println(\\\"Vous devriez arriver à \\\" + g.getStations().get(d.getNumberLineEnd()).getNameStation() + \\\" dans \\\" + getTime(d.getDuration()));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fc08210549865ce888b55beb22a89c08\",\n \"score\": \"0.5198583\",\n \"text\": \"private AdjacencyMap(){\\n this.adjacencies = new HashMap<JOctreeKey, List<JOctreeKey>>();\\n this.nodesInfo = new HashMap<JOctreeKey, Pair<Float, Point3D>>();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5bd0a4b0133c5360a5a2b21cd106d4cd\",\n \"score\": \"0.5196397\",\n \"text\": \"public DAG(int V){\\n this.V = V;\\n this.E = 0;\\n indegree = new int[V];\\n outdegree = new int[V];\\n visited = new int[V];\\n adj = new int[V][V];\\n for(int i = 0; i<V; i++){//sets up an empty graph in 2D array\\n for(int j=0;j<V;j++){\\n adj[i][j] = 0;\\n }\\n }\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":983195,"cells":{"query_id":{"kind":"string","value":"54eb786f1ce55e3ad1f9479af2a24df8"},"query":{"kind":"string","value":"private MedianFinder medianFinder = new DynamicFieldMF(); this constructor is being created from an drop off event."},"positive_passages":{"kind":"list like","value":[{"docid":"1ced2636ab9d0cd1f25f5e8ccfe2295f","score":"0.0","text":"public ProfitCellNode(Cell cell, int seqNo) {\n this.profitability = 0;\n this.numOfEmptyTaxis = 1;\n this.midFare = 0;\n this.numOfFares = 0;\n this.cell = cell;\n this.seqNo = seqNo;\n }","title":""}],"string":"[\n {\n \"docid\": \"1ced2636ab9d0cd1f25f5e8ccfe2295f\",\n \"score\": \"0.0\",\n \"text\": \"public ProfitCellNode(Cell cell, int seqNo) {\\n this.profitability = 0;\\n this.numOfEmptyTaxis = 1;\\n this.midFare = 0;\\n this.numOfFares = 0;\\n this.cell = cell;\\n this.seqNo = seqNo;\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"b42753bde9f25e19200f1750c2ff9d93","score":"0.72373044","text":"public MedianFinder() {\n \n }","title":""},{"docid":"aa0e3871d3c53a95f1f7d62ccea1c3b0","score":"0.7215805","text":"public MedianFinder() {\r\n }","title":""},{"docid":"d2bbd34223ea573fd51a6faf3cdd000a","score":"0.707944","text":"public MedianFinder() {\n numbers = new ArrayList<>();\n currentMedian = 0;\n }","title":""},{"docid":"e8d64ca60d6c4e97d0cc41f3fedb289b","score":"0.7057858","text":"public MedianFinder2() {\n\n }","title":""},{"docid":"e73d31b229e2c3abb69afb4276a49d25","score":"0.6565174","text":"public MedianFinder() {\n this.elements = new int[50000];\n this.size = 0;\n }","title":""},{"docid":"4c43cbe9e4d0876a2c79bcb213315bb5","score":"0.6360179","text":"public MedianFinder() {\n asq = new PriorityQueue<>((a,b)->a-b);\n desq = new PriorityQueue<>((a,b)->b-a);\n }","title":""},{"docid":"bfc520e7bd4dac23800da31361445564","score":"0.6282351","text":"public MedianFinder() {\n min = new PriorityQueue<>();\n max = new PriorityQueue<>((a, b) -> b - a);\n odd = true; \n }","title":""},{"docid":"d5690ed9ca1bf4b14eacb23fbbc25afa","score":"0.62604076","text":"public MedianFinder() {\n\t\tsmallQuery = new PriorityQueue<>();\n\t\tbigQuery = new PriorityQueue<>((e1, e2) -> e2 - e1);\n\t\t/*bigQuery = new PriorityQueue(new Comparator<Integer>() {\n\t\t\t@Override\n\t\t\tpublic int compare(Integer e1, Integer e2) {\n\t\t\t\treturn e2 - e1;\n\t\t\t}\n\t\t});*/\n\t}","title":""},{"docid":"191c45a88dee0095752b107276933d52","score":"0.61403733","text":"public MedianFinder() {\n min = new PriorityQueue<>((n1, n2) -> n1 - n2);\n max = new PriorityQueue<>((n1, n2) -> n2 - n1);\n }","title":""},{"docid":"46024d0cb69095b0993b4ba549ee8ff2","score":"0.613176","text":"public MedianFinder() {\r\n small = new PriorityQueue<Integer>(Collections.reverseOrder());\r\n large = new PriorityQueue<Integer>();\r\n }","title":""},{"docid":"5e97c7f5ebb263eba7350a6150d55ca7","score":"0.60912716","text":"public MedianFinder() {\n former=new PriorityQueue<>((i1,i2)->(i2-i1));\n latter=new PriorityQueue<>();\n }","title":""},{"docid":"455a5f8635351d679d15e379e282396c","score":"0.60345715","text":"@Override\r\n\tpublic void doMedianBlur() {\n\r\n\t}","title":""},{"docid":"f4e9f9ab124ca7207ddaedb64ab6e238","score":"0.6000456","text":"@Override\n\tpublic void doMedianBlur() {\n\n\t}","title":""},{"docid":"d1912fb318d28b80bd131ef8dd7c3d3c","score":"0.5981173","text":"public Q295_Find_Median_from_Data_Stream() {\n largers = new PriorityQueue<>();\n smallers = new PriorityQueue<>(10, Collections.reverseOrder());\n }","title":""},{"docid":"22df40bbcfa382a10cf1a276870f98e4","score":"0.5972833","text":"public void calcMedian() {\n calcMedian = true;\n }","title":""},{"docid":"b5d5fa7c0650b0a39d40f54f15c00f42","score":"0.591393","text":"public MedianFinder() {\n maxHeap = new PriorityQueue<>(new Comparator<Integer>() {\n @Override\n public int compare(Integer o1, Integer o2) {\n return o2 - o1;\n }\n });\n minHeap = new PriorityQueue<>();\n }","title":""},{"docid":"2ee957fae1f1a89febb4b5628f919b51","score":"0.5861433","text":"public T GetMedian(){\r\n\t\treturn this.Median;\r\n\t}","title":""},{"docid":"1d5061d8d5a99d64ce00dcdc985dd5da","score":"0.58588696","text":"public MedianFinder() {\r\n maxHeap = new PriorityQueue<>(new Comparator<Integer>() {\r\n public int compare(Integer o1, Integer o2) {\r\n return o2.compareTo(o1);\r\n }\r\n });\r\n minHeap = new PriorityQueue<>();\r\n }","title":""},{"docid":"0124b05dbb329c952f0ca1dfd7cdc576","score":"0.5779514","text":"private double median() {\n storage = sort(storage);\n if(storageSize % 2 == 0) {\n int value0 = storage[storageSize / 2];\n int value1 = storage[(storageSize / 2) +1];\n return (double)(value0) / value1;\n } else {\n return storage[storageSize / 2];\n }\n }","title":""},{"docid":"7fa3e615bd890c6d89409c4ce681a87c","score":"0.56982","text":"public MedianFinder() {\n minHeap = new PriorityQueue<>(Collections.reverseOrder());\n maxHeap = new PriorityQueue<>();\n }","title":""},{"docid":"9e0ea48a6605c30bdca04220057407e9","score":"0.5692118","text":"public double getMedian() {\n\t\treturn median;\n\t}","title":""},{"docid":"0a42cf6b64efe14e2e8b156d0c80e5b1","score":"0.56406146","text":"public FindMedianFromDataStream() {\n minH = new PriorityQueue<Integer>();\n /* By default, Java provides min heap. For max heap, we need to pass in a appropriate comparator */\n maxH = new PriorityQueue<>(1, Comparator.reverseOrder());\n }","title":""},{"docid":"aabc75c2a7a10e122c966467d4398220","score":"0.557263","text":"public MedianTracker(AEChip chip) {\n super(chip);\n xFilter.setTauMs(tauUs / 1000f);\n yFilter.setTauMs(tauUs / 1000f);\n xStdFilter.setTauMs(tauUs / 1000f);\n yStdFilter.setTauMs(tauUs / 1000f);\n xMeanFilter.setTauMs(tauUs / 1000f);\n yMeanFilter.setTauMs(tauUs / 1000f);\n setPropertyTooltip(\"tauUs\", \"Time constant in us (microseonds) of median location lowpass filter, 0 for instantaneous\");\n }","title":""},{"docid":"ce01beb6b463bc88d6c71323a578bff6","score":"0.5415938","text":"T median();","title":""},{"docid":"7db6a792180b263a886c0e4d3b9072aa","score":"0.5360307","text":"public MED009() { }","title":""},{"docid":"3c82a164339cd92baf29cc8c6610280f","score":"0.5343605","text":"public double median() {\n if (lowerHalf.size() == upperHalf.size()) {\n return .5 * (lowerHalf.peek() + upperHalf.peek());\n } else {\n return upperHalf.peek();\n }\n }","title":""},{"docid":"29cb76a4a2f42d88f3fd304c8a1e3d20","score":"0.5308204","text":"public FindMedianFromDataStream() {\n minHeap = new PriorityQueue<>((n1, n2) -> n1 - n2);\n maxHeap = new PriorityQueue<>((n1, n2) -> n2 - n1);\n }","title":""},{"docid":"5b5230fe98dca72982b60f017808a568","score":"0.53021336","text":"private static void calculateRunningMedian() {\n\t\t\n\t\twordsPerLine = new ArrayList<Integer>();\n\t\trunningM = new ArrayList<Double>();\n\t\t\n\t\t//for each line (from linesArray)\n\t\tfor (int i = 0; i< linesArray.size(); i++){\n\t\tint count = 0;\n\t\t\n\t\t//create string Tokenizer to count words\n\t\tStringTokenizer stringTokenizer = new StringTokenizer(linesArray.get(i));\n\t \n\t\t//while there are more words\n\t while (stringTokenizer.hasMoreElements()){ \n\t \tString currentWord = ((String) stringTokenizer.nextElement()).toLowerCase();\n\t \t\n\t \t//if it is non-empty word, increase the count\n\t \tif (!currentWord.isEmpty()) { \t\n\t \t\tcount++;\n\t \t}\n\t }\n\t \n\t //add 'count' as element of wordsPerLine \n\t wordsPerLine.add(count);\n\t //find Median for elements upto i and add it to runningM \n\t \trunningM.add(findMedian (i));\n\t }\n\t \n\t \t\n\t}","title":""},{"docid":"7e14a07963b11651b132d4f3ac6a4bb0","score":"0.5287024","text":"double getMedianValue(int sampleDimension) throws InvalidSampleDimensionException;","title":""},{"docid":"25b7b3be03b6639c2ae93a0123305e59","score":"0.5240383","text":"private int medianOfMedians(int[] items, int left, int right) {\n\n // Select 5-element chunk, calculate & return the median\n if (right-left <= 5) {\n\n this.insertion.sort(items, left, right);\n return left + ((right-left) / 2);\n }\n\n // Get median for each 5-chunk of values\n int numberOfMedians = (int) Math.ceil(right/5);\n int[] medians = new int[numberOfMedians];\n\n for (int i = left; i <= right -5 ; i += 5) {\n int currentMedian = i > 0? i/5 : i;\n medians[currentMedian] = this.medianOfMedians(items, i, i+5);\n }\n\n // Select 3 median values (outter right/left and center)\n int [][] threeMedian;\n if (medians.length > 3) {\n threeMedian = new int[3][2];\n threeMedian[0] = new int[]{items[medians[0]], medians[0]};\n threeMedian[1] = new int[]{items[medians[medians.length / 2]], medians[medians.length / 2]};\n threeMedian[2] = new int[]{items[medians[medians.length - 1]], medians[medians.length - 1]};\n\n } else {\n threeMedian = new int[medians.length][2];\n for (int i = 0; i < medians.length; i++) {\n threeMedian[i] = new int[]{items[medians[i]], medians[i]};\n }\n }\n\n // Order & select center-median out of max. 3-medians\n QuickSort qSort = new QuickSort();\n qSort.sort(threeMedian);\n int center = threeMedian.length > 0? threeMedian.length / 2 : 0;\n return threeMedian[center][1];\n\n }","title":""},{"docid":"e00682af6abf52d6f07235462e0eed53","score":"0.52255934","text":"public void showMedHistPanel() {\n medHistListPanel = new MedHistListPanel(logic.getFilteredMedHistList(), logic.selectedMedHistProperty(),\n logic::setSelectedMedHist);\n middleListPanelPlaceholder.getChildren().clear();\n middleListPanelPlaceholder.getChildren().add(medHistListPanel.getRoot());\n }","title":""},{"docid":"541dcc74aec99fbd77a511704280bf32","score":"0.5133099","text":"public void medianFilter(Boolean[][] filter) {\n\t\tBufferedImage result = blankCopy();\n\n\t\tIterator<Pixel> itter = iterator();\n\t\tPixel localPixel;\n\t\t\n\t\twhile (itter.hasNext()) {\n\t\t\tlocalPixel = itter.next();\n\t\t\tmedianFilterOnce(filter, new Pixel(\n\t\t\t\t\tresult, localPixel.getX(), localPixel.getY()));\n\t\t}\n\t\tworkingImage_ = result;\n\t}","title":""},{"docid":"6297826ae927db09c045b214df1063b8","score":"0.50972486","text":"MedicationDispensePerformer createMedicationDispensePerformer();","title":""},{"docid":"a8fb0ccd3cb5362d70db1e48994cd829","score":"0.5080874","text":"private FieldFinder() {}","title":""},{"docid":"ab16f9152e13f7b41a81e2dba7dc6161","score":"0.5033585","text":"private EarthMagneticFluxDensityEstimator() { }","title":""},{"docid":"983aeac3ff03d511df031a6f21bcbd5f","score":"0.5014599","text":"private double getMedian() {\n\t\tif (leftQueue.size() == rightQueue.size()) {\n\t\t\treturn (double) (leftQueue.peek() + rightQueue.peek()) / 2;\n\t\t} else\n\t\t\treturn leftQueue.size() > rightQueue.size() ? leftQueue.peek() : rightQueue.peek();\n\t}","title":""},{"docid":"a37598bb7d1eff0ad5d0f884e496987c","score":"0.5007245","text":"public MSField(int fieldLength, double fieldDensity)\r\n\t{\r\n\t\t// sets the field variables\r\n\t\tthis.fieldLength = fieldLength;\r\n\t\tthis.fieldDensity = fieldDensity;\r\n\t\tthis.totalMines = (int) (fieldLength * fieldLength * fieldDensity); \r\n\t\tthis.correctFlags = 0;\r\n\t\tthis.totalFlags = 0;\r\n\t\tthis.field = new MSVertex[fieldLength][fieldLength];\r\n\t\tthis.graph = new ListGraph(fieldLength * fieldLength, false);\r\n\t\tpopulateField();\r\n\t\tplaceMines();\r\n\t\tsetAdjList();\r\n\t\tsetMineCount();\r\n\t}","title":""},{"docid":"0016dc885817eedd9b303909eccf48ba","score":"0.4973381","text":"private int getMedianNumber(int keyCount) {\n int medianNumber;\n if (keyCount % 2 == 1)\n medianNumber = keyCount / 2 + 1;\n else\n medianNumber = (keyCount - 1) / 2 + 1;\n return medianNumber;\n }","title":""},{"docid":"2ef4f34e33e247455d9f7761a6bce72e","score":"0.49685654","text":"public FPGASegmentFinder() {\n\t\t// TODO Auto-generated constructor stub\n\t}","title":""},{"docid":"bd118f91f2b68dfc52e986da77a94c73","score":"0.49615914","text":"public Magnifier getMagnifier(){\n \tif(magnifier == null)\n \t\tmagnifier = new QuickMagnifier(this);\n \treturn magnifier;\n }","title":""},{"docid":"9b720f3cbd87c30e1a2e110f1b950d93","score":"0.49522138","text":"public double printMedian(List<Double> array){\n double median=0;\n if (array.size()!=0){\n Collections.sort(array);\n\n int middle = array.size()/2;\n if (array.size()%2 == 1) {\n median=array.get(middle);\n } else {\n median=((array.get(middle-1)) + (array.get(middle))) / 2.0;\n }\n }\n return median;\n }","title":""},{"docid":"9fa7c95a65da412879fec77ac967019b","score":"0.4943235","text":"public Filter() {\n initComponents();\n settingValues=true;\n widthSlider.setMinimum(25);\n widthSlider.setMaximum(12000);\n offsetSlider.setMinimum(-12000);\n offsetSlider.setMaximum(12000);\n settingValues=false;\n }","title":""},{"docid":"db3fce7b23006a932ded477485be701d","score":"0.49305096","text":"public FinalField(){\n\t\t\n\t\tString[] soundArray = new String[8];\n\t\tsoundArray[0] = \"bulbBreak.wav\";\n\t\tsoundArray[1] = \"flashbang.wav\";\n\t\tsoundArray[2] = \"jump.wav\";\n\t\tsoundArray[3] = \"teleport.wav\";\n\t\tsoundArray[4] = \"bullet.wav\";\n\t\tsoundArray[5] = \"laser.wav\";\n\t\tsoundArray[6] = \"pin.wav\";\n\t\tsoundArray[7] = \"block.wav\";\n\t\tsoundEffects = new SoundDriver(soundArray);\n\t\tString[] bMusic = new String[8];\n\t\tbMusic[0] = \"Chosen.wav\";\n\t\tbMusic[1] = \"Setup.wav\";\n\t\tbMusic[2] = \"bWin.wav\";\n\t\tbMusic[3] = \"rWin.wav\";\n\t\tbMusic[4] = \"ECS.wav\";\n\t\tbMusic[5] = \"teleport.wav\";\n\t\tbMusic[6] = \"Tutorial.wav\";\n\t\tbMusic[7] = \"game.wav\";\n\t\tmusic = new SoundDriver(bMusic);\n\t\t//redPath = new Path(redHero);\n\t\tgrenade = new ArrayList<SmartBullet>();\n\t\tadditions = new ArrayList<SmartParticle>();\n\t\tredBullets = new ArrayList<SmartBullet>();\n\t\tblueBullets = new ArrayList<SmartBullet>();\n\t\ttowerBoom = new ArrayList<Effects>();\n\t\tfightGround = new Arena(false);\n\t}","title":""},{"docid":"a87c706f5526b6ea4eb4d5d3445ffe01","score":"0.4929641","text":"private double calcMedian(int[] numArray) {\n Arrays.sort(numArray);\n if (numArray.length % 2 == 0) // check if length is odd or even\n return ((double) numArray[numArray.length / 2] +\n (double) numArray[numArray.length / 2 - 1]);\n else\n return (double)numArray[numArray.length/2];\n }","title":""},{"docid":"863cc18c1a8b5c7d911aa85d95163710","score":"0.49208745","text":"public Builder setMedallion(\n java.lang.String value) {\n if (value == null) {\n throw new NullPointerException();\n }\n bitField0_ |= 0x00000001;\n medallion_ = value;\n onChanged();\n return this;\n }","title":""},{"docid":"16f0d2462836a1a128d15d57b9d38eaf","score":"0.49140263","text":"@Override\n public void init() {\n filter = LinearFilter.movingAverage(5);\n NetworkTableInstance table = NetworkTableInstance.getDefault();\n NetworkTable cameraTable = table.getTable(\"photonvision\").getSubTable(robotSettings.GOAL_CAM_NAME);\n yaw = cameraTable.getEntry(\"targetYaw\");\n size = cameraTable.getEntry(\"targetArea\");\n hasTarget = cameraTable.getEntry(\"hasTarget\");\n pitch = cameraTable.getEntry(\"targetPitch\");\n }","title":""},{"docid":"1c63c197c520e7b9898baa91e21675e6","score":"0.49116978","text":"public jpanMedicos(jpanFondo fondo,File D){\n this.jpanelFondo = fondo;\n Doctores=D;//\n Auxiliar=new Doctor();\n generarDoctores();\n iniciarComponentes();\n \n }","title":""},{"docid":"cb07fd70f231fb8afb83ceace12cc717","score":"0.490608","text":"@Override\n public void SetManipulator() {\n\n }","title":""},{"docid":"7900e91128d756e215e79225c57a90e0","score":"0.49046773","text":"public Medico() {\r\n \r\n }","title":""},{"docid":"591977f7369482a65050c65753e097ca","score":"0.49018008","text":"public ElencoMedici(){\n\t\telencoMedici = new ArrayList<Medico>();\n\t}","title":""},{"docid":"7201fe023888750b04323482753d1460","score":"0.49001336","text":"private static double computeMedian(int[] inputArray) {\n\t\tif (inputArray.length % 2 == 0) {\n\t\t\treturn (inputArray[inputArray.length / 2] + inputArray[inputArray.length / 2 + 1]) / 2.0;\n\t\t} else {\n\t\t\t// get the middle\n\t\t\treturn inputArray[inputArray.length / 2 + 1];\n\t\t}\n\t}","title":""},{"docid":"3d1917de1b3bc49bce4aebb72b1c1e73","score":"0.48863348","text":"private static double findMedian(int index){\n\n\t\t//if it is the first line\n\t\tif (index==0){\n\t\t\t//median is the words per line in the first file\n\t\t\treturn wordsPerLine.get(0);\n\t\t}\n\t\t\n\t\t//for subsequent lines\n\t\t//store the elements of wordsPerLine upto index in an array \n\t\tint[] numWords = new int[index+1];\n\t\tdouble median= 0;\n\t\t\n\t\tfor (int i = 0; i<wordsPerLine.size(); i++){ \n\t\t\tnumWords[i]= wordsPerLine.get(i);\n\t\t}\n\t\t\n\t\t//sort the array\n\t\tArrays.sort(numWords);\n\t\t\n\t\t//calcualte median from elements in numWords\n\t\tint middle = ((numWords.length) / 2);\n\t\t\n\t\t//for even-numbered list, median is the mean if two elements at middle\n\t\tif(numWords.length % 2 == 0){\n\t\t\tdouble medianA = numWords[middle];\n\t\t\tdouble medianB = numWords[middle-1];\n\t\t\tmedian = (medianA + medianB) / 2;\n\t\t}\n\t\t\n\t\t//for odd-numbered list, median is the value of element in midpoint\n\t\telse{\t\t\n\t\t\tmedian = numWords[middle];\n\t\t}\n\t\t\n\t\treturn median;\n\t}","title":""},{"docid":"392ce189ce5d69e29baf92b368aa5ebf","score":"0.48723027","text":"public interface MassSpectrometryImagingData {\n\n /**\n * Get the full m/z list that is the union of all individual m/z lists\n * from each spectrum within the dataset.\n * \n * @return List of all m/z values within the dataset\n */\n double[] getFullmzList();\n\n /**\n * Get the spatial dimensionality. 1 if MS experiment, 2 if MSI experiment \n * or 3 if 3D MSI experiment.\n * \n * @return Spatial dimensionality\n */\n int getSpatialDimensionality();\n\n /**\n * Get the dimensionality of dataset. At least 1 greater than \n * {@link MassSpectrometryImagingData#getSpatialDimensionality()} to account \n * for m/z dimension. If MS/MS or ion mobility then dimensionality is increased\n * by a further 1.\n * \n * @return Dimensionality\n */\n int getDimensionality();\n\n /**\n * Get the number of spectra per pixel with different scan properties, such \n * as ion mobility or MS/MS. For example, for travelling wave ion\n * mobility data on a Synapt G2S-i this will be 200. \n * \n * @return Number of spectra per pixel\n */\n int getNumberOfSpectraPerPixel();\n\n /**\n * Get the spectrum at (x, y).\n * \n * <p>TODO: Rethink how to get spectrum at (x, y) but an additional dimension, \n * for example with ion mobility etc.\n * \n * @param x x-coordinate\n * @param y y-coordinate\n * @return First spectrum at (x, y), or null if none\n */\n Spectrum getSpectrum(int x, int y);\n\n /**\n * Get the spectrum at (x, y, z).\n * \n * @param x x-coordinate\n * @param y y-coordinate\n * @param z z-coordinate\n * @return First spectrum at (x, y, z), or null if none\n */\n Spectrum getSpectrum(int x, int y, int z);\n\n /**\n * Get width of image in pixels.\n * \n * @return Width of image in pixels\n */\n int getWidth();\n \n /**\n * Get height of image in pixels.\n * \n * @return Height of image in pixels\n */\n int getHeight();\n \n /**\n * Get depth of image in pixels.\n * \n * @return Depth of image in pixels\n */\n int getDepth();\n\n /**\n * Get the minimum m/z that was detected within any spectrum in the dataset.\n * \n * @return Minimum m/z value\n */\n double getMinimumDetectedmz();\n \n /**\n * Get the maximum m/z that was detected within any spectrum in the dataset.\n * \n * @return Maximum m/z value\n */\n double getMaximumDetectedmz();\n \n /**\n * Get whether the MSI data is stored in processed format (discrete).\n * \n * @return true if data is discrete, false otherwise\n */\n boolean isProcessed();\n \n /**\n * Get whether the MSI data is stored in continuous format.\n * \n * @return true if data is continuous, false otherwise\n */\n boolean isContinuous();\n \n /**\n * Get the total ion count (TIC) image for the dataset by summing up all intensities \n * for each spatial coordinate within the dataset.\n * \n * @return TIC image\n */\n double[][] generateTICImage();\n}","title":""},{"docid":"f1156f372560035cb1e5e048aa76be7b","score":"0.48465276","text":"String median() {\n\t\t\tint size = tree.size();\n\t\t\tif (size%2 == 1)\n\t\t\t\treturn \"\" + select((size+1)/2);\n\t\t\tint a = select(size/2);\n\t\t\tint b = select(size/2+1);\n\t\t\tlong val = (long)a+b;\n\t\t\tif (val % 2 == 0)\n\t\t\t\treturn \"\" + val/2;\n\t\t\telse if (val > 0) {\n\t\t\t\treturn \"\" + val/2 + \".5\";\n\t\t\t} else {\n\t\t\t\treturn \"-\" + (-((val+1)/2)) + \".5\";\n\t\t\t}\n\t\t}","title":""},{"docid":"b69d2537715410ad19419a37c75b3a33","score":"0.48352215","text":"public Builder clearMedallion() {\n bitField0_ = (bitField0_ & ~0x00000001);\n medallion_ = getDefaultInstance().getMedallion();\n onChanged();\n return this;\n }","title":""},{"docid":"1cea2a01f2596b5202ef8bde08148626","score":"0.48344147","text":"static void printMedian(double[] inputs) {\r\n\t\t\tArrays.sort(inputs);\r\n\t\t\tint length = inputs.length;\r\n\t\t\tdouble median = 0;\r\n\t\t\tmedian = (length % 2 == 0) ? (inputs[length / 2] + inputs[length / 2 - 1]) / 2 : inputs[length / 2];\r\n\t\t\tStdOut.println(String.format(\"midian=%f\", median));\r\n\t\t}","title":""},{"docid":"cba2f72e06a49d1e95e7b5261352e796","score":"0.48336315","text":"public Builder setMedallionBytes(\n com.google.protobuf.ByteString value) {\n if (value == null) {\n throw new NullPointerException();\n }\n bitField0_ |= 0x00000001;\n medallion_ = value;\n onChanged();\n return this;\n }","title":""},{"docid":"595a93c9ee12aac627a6cf7b4b73309e","score":"0.48282668","text":"public FFT() {\n\t}","title":""},{"docid":"569da3f4afab321cce7680859d8a1c54","score":"0.4810903","text":"@Override protected void init() {\n super.init();\n _w.getSelectedDisperser().setValue(getDataObject().getDisperser().ordinal());\n _w.getWavelenght().setValue(_roundDouble(getDataObject().getWavelength(), 4));\n _updateScienceFOV();\n }","title":""},{"docid":"1ad8c5abe4e35969e6991039a8957fe1","score":"0.4806753","text":"MedicationDispense createMedicationDispense();","title":""},{"docid":"dafd61d1c805a2c14e2b17ccfc8121f7","score":"0.47883353","text":"public Long getMedian() {\n /*\n [1] => 1\n [1 2] => 2\n [1 2 3] => 2\n [1 1 1 1] => 1\n */\n // already cached it\n if (this.median != null) {\n return this.median;\n }\n\n if (length == 1) {\n this.median = this.elements[0];\n return this.median;\n }\n\n Vector vector;\n\n if (!this.stable) {\n // get a sorted clone\n vector = this.sorted();\n } else {\n vector = this;\n }\n\n // get the upper median, which is index length/2 for even, and length/2+1 for odd\n if (this.reversed) {\n this.median = vector.elements[length % 2 == 0 ? (length/2)-1 : length/2];\n } else {\n this.median = vector.elements[length / 2];\n }\n\n return this.median;\n }","title":""},{"docid":"f3336980b753b1b474146bb10e03aa21","score":"0.47856057","text":"private static double getMedian(int nums[]){\n int len = nums.length;\n return len%2==0 ? (nums[(len-1)/2]+nums[(len-1)/2+1])/2:nums[len/2];\n }","title":""},{"docid":"570aceba4bac5192fdfc3c0e65ce6f9b","score":"0.4768615","text":"public IvMFilter() {\r\n\r\n\t}","title":""},{"docid":"7b391d809beab19b059ccded4132393d","score":"0.47662112","text":"public FrmModifMedico(CdorModifMedico cdor) {\r\n\t\tsuper();\r\n\t\tthis.cdor = cdor;\r\n\t\tinitialize();\r\n\r\n\t}","title":""},{"docid":"1f0d2cefcedc6cf6bed82908a0b7179e","score":"0.47612837","text":"public void setMedianPath(boolean medianPath) {\n\t\tthis.medianPath = medianPath;\n\t}","title":""},{"docid":"1abd1e32c098a36c72f5c63f311c8528","score":"0.4754828","text":"public FragMilesView() {\r\n\t}","title":""},{"docid":"fd0573358f5817e89329a991d229eb97","score":"0.47538716","text":"private MFInputManager()\n {\n this.mouseListeners = new LinkedList<MFIMouseListener>();\n this.keyListeners = new LinkedList<MFIKeyListener>();\n }","title":""},{"docid":"fc49acc75e06c7aa12a85e8732452f49","score":"0.47441348","text":"public MMWMD_BasicLM_DirectFitter() {\n\t}","title":""},{"docid":"33f8f8adea7124f4bf4b50cec79bfe5e","score":"0.47407776","text":"public double findMedian() {\n\t\tif (pq1.size() == pq2.size()) {\n\t\t\treturn (pq1.peek() + pq2.peek()) / 2.0;\n\t\t} else {\n\t\t\treturn pq1.peek();\n\t\t}\n\t}","title":""},{"docid":"4ca1566fe81bf7c86b10defc906f2765","score":"0.47370362","text":"DeferredMaterial() {\n\t\t\n\t}","title":""},{"docid":"3574bd03c510e470058a4bcbdbf9e984","score":"0.4734098","text":"private static float getMedian(List<Float> values, int mid_element,\n\t\t\tint start, int end) {\n\t\tif (end - start < 1)\n\t\t\treturn -1f;\n\t\telse if (end - start == 1)\n\t\t\treturn values.get(start);\n\n\t\tint random_ind = start + (int) (Math.random() * (end - start));\n\t\tfloat temp = values.get(start);\n\t\tvalues.set(start, values.get(random_ind));\n\t\tvalues.set(random_ind, temp);\n\t\tint index = partition(values, start, end);\n\t\tif (index == mid_element) {\n\t\t\tmedian = values.get(index);\n\t\t} else if (index < mid_element) {\n\t\t\tmedian = getMedian(values, mid_element, index + 1, end);\n\t\t} else {\n\n\t\t\tmedian = getMedian(values, mid_element, start, index);\n\t\t}\n\t\treturn median;\n\t}","title":""},{"docid":"29f84a43713dbe476ae4a8a392da0eaf","score":"0.4722969","text":"public static Object $$$FldMEDICDGender(mContext m$) {\n return (3);\n }","title":""},{"docid":"c4f0c46b1134a61defbd87a9bfbfe0e6","score":"0.47164187","text":"public Medico(String nomeMedico, String especialidade) {\r\n super(nomeMedico);\r\n this.especialidade = especialidade;\r\n }","title":""},{"docid":"5c546db2cc8307b148154c9879c0e906","score":"0.47125828","text":"public static void getMedians(int[] array) {\n PriorityQueue<Integer> lowers = new PriorityQueue<Integer>(new Comparator<Integer>() {\n public int compare(Integer a , Integer b){\n return b-a;\n }\n });\n //MIN Heap for the Upper Half\n PriorityQueue<Integer> highers = new PriorityQueue<Integer>(); \n\n double[] medians = new double[array.length];\n for(int i=0;i<array.length;i++){\n int number = array[i];\n addNumber(number,lowers,highers);\n rebalance(lowers,highers);\n medians[i] = getMedian(lowers,highers);\n }\n System.out.println(Arrays.toString(medians));\n }","title":""},{"docid":"5cf755c5ac47490292939f9b27dee4df","score":"0.47060525","text":"public ImageCameraWrapper mo37539d() {\n return new ImageCameraWrapper(this.f26118a);\n }","title":""},{"docid":"d2aa485fd55b8da5333d6233a4e45790","score":"0.4705385","text":"public FIRFilter() {}","title":""},{"docid":"9d051e9dfb5006838d8ac73e6a8228cc","score":"0.47030708","text":"double caluclateMedian(ArrayList<Double> time) {\n Double medianvalue=0.0;\n Collections.sort(time);\n int med=packets%2;\n if(med==0)\n {\n medianvalue=((time.get(med))+(time.get(med-1)))/2;\n }\n else\n {\n medianvalue=time.get(med);\n }\n return medianvalue;\n\n\n }","title":""},{"docid":"fbd154c16f2331cf6af1aaafe9ef8502","score":"0.47005126","text":"Detinator createDetinator();","title":""},{"docid":"a46df7a1803e787b2746fb9750f1869f","score":"0.4699343","text":"ESMFActionFieldHalo createESMFActionFieldHalo();","title":""},{"docid":"61016b55fa5cee5379d753c57219aaec","score":"0.4698693","text":"public FaceAnalysis() {\n }","title":""},{"docid":"eeb36f7d811e511d78ab12d32b57b462","score":"0.4684712","text":"private PMF() {}","title":""},{"docid":"b96232bad40495897e5cccdd39c4a75d","score":"0.4684393","text":"public static Object $$$FldMEDPrescriptionLineInfusionSpeed(mContext m$) {\n return (38);\n }","title":""},{"docid":"346bb169aa863e7be5063ba443f9f7d3","score":"0.4683803","text":"public Key median() {\r\n if (isEmpty()) return null;\r\n if(size()==1) return root.key;\r\n Integer middle = ((root.N+1)/2);\r\n return getMedian(root, (Key) middle).key;\r\n }","title":""},{"docid":"5e8e447940c6e64df003ff1a44792faa","score":"0.4674127","text":"public interface VolatileMedianBlockTime extends MedianBlockTime { }","title":""},{"docid":"2992e9e16f793974ae18ca68e22b6402","score":"0.46695873","text":"public void UpdateMedianDelete(BinaryNode<T> node){\r\n\t\tif(this.Median==null || node==null){ //check if the median or the node is null\r\n\t\t\treturn;\r\n\t\t}\r\n\t\tBinaryNode<T>[] medianAndParent=this.Search(this.Median); //find the medain and parent\r\n\t\tBinaryNode<T> medianNode=medianAndParent[1]; //get the median\r\n\t\tboolean isEven=this.Size %2 ==0; //check if tree size is even\r\n\t\tboolean isSmaller = node.GetKey() < this.Median.GetKey();\r\n\t\tboolean isBigger = node.GetKey() > this.Median.GetKey();\r\n\t\tboolean isSame = !isSmaller && !isBigger;\r\n\t\t\r\n\t\tif((!isEven && isSmaller)||(!isEven && isSame)){\r\n\t\t\t// if tree size is odd and the inserted value is smaller or equal then the new median\r\n\t\t\t//is the succsessor \r\n\t\t\tBinaryNode<T> succsessor=medianNode.GetSuccessor();\r\n\t\t\tthis.Median=succsessor ==null ? null: succsessor.GetInfo();\r\n\t\t}\r\n\t\t\r\n\t\tif((isEven && isBigger)||(isEven && isSame)){\r\n\t\t\t// if tree size is even and the inserted value is bigger or equal then the new median\r\n\t\t\t//is the predecessor \r\n\t\t\tBinaryNode<T> predecessor=medianNode.GetPredecessor();\r\n\t\t\tthis.Median=predecessor==null? null: predecessor.GetInfo();\r\n\t\t}\r\n\t}","title":""},{"docid":"77b057ecc8e97656427e35bfd56e4795","score":"0.46689656","text":"public Mordor(){\r\n\t\tsuper();\r\n\t}","title":""},{"docid":"5c0d6aa93371c231c1e8dbd633d4f352","score":"0.46676442","text":"@Override\n\tpublic void calcularMensalidade(double fator) {\n\t\t\n\t}","title":""},{"docid":"0f8a8ff93e5b68cd0b2a9e308365f1a7","score":"0.4661233","text":"public MedicalOfficer() throws IOException {\n initComponents(); \n\n File imgfile = new File(\"..\\\\BBMS\\\\src\\\\images\\\\drop.png\");\n FileInputStream imgStream = new FileInputStream(imgfile);\n BufferedImage bi = ImageIO.read(imgStream);\n ImageIcon myImg = new ImageIcon(bi);\n this.setIconImage(myImg.getImage());\n \n Initial first = new Initial(jDesktopPane1.getSize());\n jDesktopPane1.removeAll();\n jDesktopPane1.add(first);\n first.setVisible(true);\n \n setLocationRelativeTo(null);\n\n }","title":""},{"docid":"a3fdd49723aee77bf6ff52c31d0cbc30","score":"0.46530187","text":"long getMedianMonthlyInventory();","title":""},{"docid":"68fc3e3ead51821e93495e618c265005","score":"0.46500844","text":"Medication createMedication();","title":""},{"docid":"f723ec9372f448c25684130f6c87b95b","score":"0.46328282","text":"private int median(ArrayList<Integer> values) {\n\t\tCollections.sort(values);\n\n\t\tif (values.size() % 2 == 1) {\n\t\t\treturn values.get((values.size()+1)/2-1);\n\t\t} else {\n\t\t\tint lower = values.get(values.size()/2-1);\n\t\t\tint upper = values.get(values.size()/2);\n\t\t\t\n\t\t\treturn (int) ((lower + upper) / 2.0);\n\t\t}\t\n\t}","title":""},{"docid":"a056b1d3b735c27977ec42b8183c132f","score":"0.46283773","text":"public EvMediumContainer() {\n\t}","title":""},{"docid":"1d554f2c81faeccc9649f8ec6d78426e","score":"0.46232766","text":"public double getMedianValue()\r\n {\r\n if(Double.isNaN(median))\r\n {\n @SuppressWarnings(\"unchecked\")\n final Map.Entry<Integer, Double>[] entries = cMap.entrySet().toArray(new Map.Entry[cMap.size()]);\n\n Arrays.sort(entries, new Comparator<Map.Entry<Integer,Double>>() {\n public int compare(Map.Entry<Integer,Double> e1, Map.Entry<Integer,Double> e2)\n {\n return e1.getKey().compareTo(e2.getKey());\n }\n });\n \n final double totalCount = getTotalCount();\n final double medianCount = totalCount/2.0;\n\n double count = 0;\n int i=0;\n for(i=0;i<entries.length && count<medianCount;i++)\n {\n count += entries[i].getValue();\n }\n i--;\n\n if(count==medianCount)\n median = (entries[i].getKey()+entries[i+1].getKey())/2.0;\n else\n median = entries[i].getKey();\r\n }\r\n return median;\r\n }","title":""},{"docid":"eafcc76843cda5609708cdfb4b5038ea","score":"0.4619496","text":"public final void mo28782s() {\n m23240L();\n HashMap hashMap = new HashMap(1);\n hashMap.put(MediationMetaData.KEY_VERSION, this.f21964c.f25057a);\n mo28729a(\"onhide\", (Map<String, ?>) hashMap);\n }","title":""},{"docid":"c0661d663eaf70f474dc2a91e6d9d81d","score":"0.4616945","text":"public FragmentationAnalyzer() {\r\n\r\n // create the properties object\r\n properties = new Properties();\r\n\r\n // makes sure that '.' is used as the decimal sign\r\n Locale.setDefault(Locale.US);\r\n\r\n try {\r\n //PlasticLookAndFeel.setPlasticTheme(new SkyKrupp());\r\n //UIManager.setLookAndFeel(new PlasticXPLookAndFeel());\r\n //UIManager.setLookAndFeel(new WindowsLookAndFeel());\r\n UtilitiesGUIDefaults.setLookAndFeel();\r\n } catch (IOException e) {\r\n //e.printStackTrace();\r\n // ignore error\r\n }\r\n\r\n String path = CompomicsWrapper.getJarFilePath(this.getClass().getResource(\"FragmentationAnalyzer.class\").getPath(), \"FragmentationAnalyzer\");\r\n\r\n // check for new version\r\n boolean newVersion = false;\r\n if (!path.equalsIgnoreCase(\".\")) {\r\n newVersion = checkForNewVersion();\r\n }\r\n\r\n if (!newVersion) {\r\n\r\n if (useErrorLog && !path.equalsIgnoreCase(\".\")) {\r\n try {\r\n path = path + \"/resources/conf/ErrorLog.txt\";\r\n\r\n File file = new File(path);\r\n System.setOut(new java.io.PrintStream(new FileOutputStream(file, true)));\r\n System.setErr(new java.io.PrintStream(new FileOutputStream(file, true)));\r\n\r\n // creates a new error log file if it does not exist\r\n if (!file.exists()) {\r\n file.createNewFile();\r\n\r\n FileWriter w = new FileWriter(file);\r\n BufferedWriter bw = new BufferedWriter(w);\r\n\r\n bw.close();\r\n w.close();\r\n }\r\n } catch (Exception e) {\r\n JOptionPane.showMessageDialog(\r\n null, \"An error occured when trying to create the ErrorLog.\"\r\n + \"See ../resources/conf/ErrorLog.txt for more details.\",\r\n \"Error Creating ErrorLog\", JOptionPane.ERROR_MESSAGE);\r\n Util.writeToErrorLog(\"Error when creating ErrorLog: \");\r\n e.printStackTrace();\r\n }\r\n }\r\n\r\n initComponents();\r\n\r\n this.setTitle(analyzerName + \" \" + properties.getVersion());\r\n\r\n // make the interal frame tool bars invisible\r\n spectrumPanelToolBarJInternalFrame.setVisible(false);\r\n boxPlotPanelToolBarJInternalFrame.setVisible(false);\r\n\r\n plotsAndAnalysesJScrollPane.getVerticalScrollBar().addAdjustmentListener(new AdjustmentListener() {\r\n\r\n public void adjustmentValueChanged(AdjustmentEvent e) {\r\n\r\n // this code moved the toolbars relative to the scrollpane to make\r\n // sure that they are always visible\r\n if (!e.getValueIsAdjusting()) {\r\n spectrumPanelToolBarJInternalFrame.setBounds(\r\n (int) spectrumPanelToolBarJInternalFrame.getBounds().getX(),\r\n 40 + e.getValue(),\r\n (int) spectrumPanelToolBarJInternalFrame.getBounds().getWidth(),\r\n (int) spectrumPanelToolBarJInternalFrame.getBounds().getHeight());\r\n\r\n boxPlotPanelToolBarJInternalFrame.setBounds(\r\n (int) boxPlotPanelToolBarJInternalFrame.getBounds().getX(),\r\n 40 + e.getValue(),\r\n (int) boxPlotPanelToolBarJInternalFrame.getBounds().getWidth(),\r\n (int) boxPlotPanelToolBarJInternalFrame.getBounds().getHeight());\r\n }\r\n }\r\n });\r\n\r\n jMenuBar.putClientProperty(Options.HEADER_STYLE_KEY, HeaderStyle.SINGLE);\r\n jMenuBar.putClientProperty(Options.NO_ICONS_KEY, Boolean.TRUE);\r\n\r\n // central allignment for the text in all combo boxes\r\n centrallyAllignComboBoxes();\r\n\r\n // the following lines are needed to make sure that the frame looks ok when\r\n // the scrollbars are showing (which changes the frame somewhat)\r\n while (searchSettingsJScrollPane.getViewport().getViewRect().height\r\n < searchSettingsJXTaskPaneContainer.getMinimumSize().getHeight()) {\r\n this.setPreferredSize(new Dimension(this.getWidth(), this.getHeight() + 1));\r\n pack();\r\n }\r\n\r\n while (resultsJScrollPane.getViewport().getViewRect().height\r\n < resultsJXTaskPaneContainer.getMinimumSize().getHeight()) {\r\n this.setPreferredSize(new Dimension(this.getWidth(), this.getHeight() + 1));\r\n pack();\r\n }\r\n\r\n // make sure the main frame is not too wide for the screen\r\n Dimension dim = Toolkit.getDefaultToolkit().getScreenSize();\r\n\r\n if (dim.getWidth() < this.getWidth()) {\r\n this.setPreferredSize(new Dimension(dim.width - 50, this.getPreferredSize().height));\r\n pack();\r\n }\r\n\r\n setColumnProperties();\r\n\r\n searchResultsJXTaskPane.setExpanded(false);\r\n plotsAnalysesJXTaskPane.setExpanded(false);\r\n spectraJXTaskPane.setExpanded(false);\r\n\r\n userProperties = new UserProperties(properties.getVersion());\r\n userProperties.readUserPropertiesFromFile(null);\r\n\r\n // sets the icon of the frame\r\n setIconImage(Toolkit.getDefaultToolkit().getImage(getClass().\r\n getResource(\"/no/uib/fragmentation_analyzer/icons/box_plot_small.GIF\")));\r\n\r\n setLocationRelativeTo(null);\r\n setExtendedState(Frame.MAXIMIZED_BOTH);\r\n setVisible(true);\r\n\r\n initialSizeHasBeenSet = true;\r\n\r\n plotPaneCurrentPreferredSize = plotsAndAnalysesJScrollPane.getMinimumSize();\r\n\r\n new DataSource(this, true);\r\n }\r\n }","title":""},{"docid":"7fb951bc73353a5328ec225f7d043ff3","score":"0.46156138","text":"public void UpdateMedianInsert(BinaryNode<T> node){\r\n\t\tBinaryNode<T>[] medianAndParent=this.Search(this.Median); //find the medain and parent\r\n\t\tBinaryNode<T> medianNode=medianAndParent[1]; //get the medain\r\n\t\t\r\n\t\tboolean isEven=this.Size %2 ==0; //check if tree size is even\r\n\t\tboolean isSmaller = node.GetKey() < this.Median.GetKey(); //check if the inserted is smaller than median \r\n\t\t\r\n\t\tif(isEven && isSmaller){ // if tree size is even and the inserted value is smaller then the new median\r\n\t\t\t\t\t\t\t\t\t//is the predecessor \r\n\t\t\tBinaryNode<T> predecessor=medianNode.GetPredecessor();\r\n\t\t\tthis.Median=predecessor==null? null: predecessor.GetInfo();\r\n\t\t}\r\n\t\t\r\n\t\tif(!(isEven || isSmaller)){ // if tree size is odd and the median is smaller then the new median\r\n\t\t\t\t\t\t\t\t\t//or equal then the new median is the succsessor \r\n\t\t\tBinaryNode<T> succsessor=medianNode.GetSuccessor();\r\n\t\t\tthis.Median=succsessor ==null ? null: succsessor.GetInfo();\r\n\t\t}\r\n\t}","title":""},{"docid":"cb9bfa60907bc4f290ef16d59f311070","score":"0.461306","text":"NFraction createNFraction();","title":""},{"docid":"52a08c50fabd4775586c0182f3be33d3","score":"0.46127132","text":"public void setMediationData(MediationData mediationData) {\n\t\tthis.mMediationData = mediationData;\n\t}","title":""},{"docid":"31b676d4b7f4c107c4f160e833023467","score":"0.4612037","text":"public static Object $$$FldMEDProviderFREE9(mContext m$) {\n return (29);\n }","title":""},{"docid":"4cb15881163cd77efbca870a04ce9847","score":"0.4605864","text":"private MediaState() {\n }","title":""},{"docid":"2fc9a3c657a2d4d002814e4717992814","score":"0.4593193","text":"private FinchLimits() {}","title":""}],"string":"[\n {\n \"docid\": \"b42753bde9f25e19200f1750c2ff9d93\",\n \"score\": \"0.72373044\",\n \"text\": \"public MedianFinder() {\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa0e3871d3c53a95f1f7d62ccea1c3b0\",\n \"score\": \"0.7215805\",\n \"text\": \"public MedianFinder() {\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d2bbd34223ea573fd51a6faf3cdd000a\",\n \"score\": \"0.707944\",\n \"text\": \"public MedianFinder() {\\n numbers = new ArrayList<>();\\n currentMedian = 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e8d64ca60d6c4e97d0cc41f3fedb289b\",\n \"score\": \"0.7057858\",\n \"text\": \"public MedianFinder2() {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e73d31b229e2c3abb69afb4276a49d25\",\n \"score\": \"0.6565174\",\n \"text\": \"public MedianFinder() {\\n this.elements = new int[50000];\\n this.size = 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4c43cbe9e4d0876a2c79bcb213315bb5\",\n \"score\": \"0.6360179\",\n \"text\": \"public MedianFinder() {\\n asq = new PriorityQueue<>((a,b)->a-b);\\n desq = new PriorityQueue<>((a,b)->b-a);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bfc520e7bd4dac23800da31361445564\",\n \"score\": \"0.6282351\",\n \"text\": \"public MedianFinder() {\\n min = new PriorityQueue<>();\\n max = new PriorityQueue<>((a, b) -> b - a);\\n odd = true; \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d5690ed9ca1bf4b14eacb23fbbc25afa\",\n \"score\": \"0.62604076\",\n \"text\": \"public MedianFinder() {\\n\\t\\tsmallQuery = new PriorityQueue<>();\\n\\t\\tbigQuery = new PriorityQueue<>((e1, e2) -> e2 - e1);\\n\\t\\t/*bigQuery = new PriorityQueue(new Comparator<Integer>() {\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic int compare(Integer e1, Integer e2) {\\n\\t\\t\\t\\treturn e2 - e1;\\n\\t\\t\\t}\\n\\t\\t});*/\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"191c45a88dee0095752b107276933d52\",\n \"score\": \"0.61403733\",\n \"text\": \"public MedianFinder() {\\n min = new PriorityQueue<>((n1, n2) -> n1 - n2);\\n max = new PriorityQueue<>((n1, n2) -> n2 - n1);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"46024d0cb69095b0993b4ba549ee8ff2\",\n \"score\": \"0.613176\",\n \"text\": \"public MedianFinder() {\\r\\n small = new PriorityQueue<Integer>(Collections.reverseOrder());\\r\\n large = new PriorityQueue<Integer>();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5e97c7f5ebb263eba7350a6150d55ca7\",\n \"score\": \"0.60912716\",\n \"text\": \"public MedianFinder() {\\n former=new PriorityQueue<>((i1,i2)->(i2-i1));\\n latter=new PriorityQueue<>();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"455a5f8635351d679d15e379e282396c\",\n \"score\": \"0.60345715\",\n \"text\": \"@Override\\r\\n\\tpublic void doMedianBlur() {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f4e9f9ab124ca7207ddaedb64ab6e238\",\n \"score\": \"0.6000456\",\n \"text\": \"@Override\\n\\tpublic void doMedianBlur() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d1912fb318d28b80bd131ef8dd7c3d3c\",\n \"score\": \"0.5981173\",\n \"text\": \"public Q295_Find_Median_from_Data_Stream() {\\n largers = new PriorityQueue<>();\\n smallers = new PriorityQueue<>(10, Collections.reverseOrder());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"22df40bbcfa382a10cf1a276870f98e4\",\n \"score\": \"0.5972833\",\n \"text\": \"public void calcMedian() {\\n calcMedian = true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b5d5fa7c0650b0a39d40f54f15c00f42\",\n \"score\": \"0.591393\",\n \"text\": \"public MedianFinder() {\\n maxHeap = new PriorityQueue<>(new Comparator<Integer>() {\\n @Override\\n public int compare(Integer o1, Integer o2) {\\n return o2 - o1;\\n }\\n });\\n minHeap = new PriorityQueue<>();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ee957fae1f1a89febb4b5628f919b51\",\n \"score\": \"0.5861433\",\n \"text\": \"public T GetMedian(){\\r\\n\\t\\treturn this.Median;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d5061d8d5a99d64ce00dcdc985dd5da\",\n \"score\": \"0.58588696\",\n \"text\": \"public MedianFinder() {\\r\\n maxHeap = new PriorityQueue<>(new Comparator<Integer>() {\\r\\n public int compare(Integer o1, Integer o2) {\\r\\n return o2.compareTo(o1);\\r\\n }\\r\\n });\\r\\n minHeap = new PriorityQueue<>();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0124b05dbb329c952f0ca1dfd7cdc576\",\n \"score\": \"0.5779514\",\n \"text\": \"private double median() {\\n storage = sort(storage);\\n if(storageSize % 2 == 0) {\\n int value0 = storage[storageSize / 2];\\n int value1 = storage[(storageSize / 2) +1];\\n return (double)(value0) / value1;\\n } else {\\n return storage[storageSize / 2];\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7fa3e615bd890c6d89409c4ce681a87c\",\n \"score\": \"0.56982\",\n \"text\": \"public MedianFinder() {\\n minHeap = new PriorityQueue<>(Collections.reverseOrder());\\n maxHeap = new PriorityQueue<>();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9e0ea48a6605c30bdca04220057407e9\",\n \"score\": \"0.5692118\",\n \"text\": \"public double getMedian() {\\n\\t\\treturn median;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0a42cf6b64efe14e2e8b156d0c80e5b1\",\n \"score\": \"0.56406146\",\n \"text\": \"public FindMedianFromDataStream() {\\n minH = new PriorityQueue<Integer>();\\n /* By default, Java provides min heap. For max heap, we need to pass in a appropriate comparator */\\n maxH = new PriorityQueue<>(1, Comparator.reverseOrder());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aabc75c2a7a10e122c966467d4398220\",\n \"score\": \"0.557263\",\n \"text\": \"public MedianTracker(AEChip chip) {\\n super(chip);\\n xFilter.setTauMs(tauUs / 1000f);\\n yFilter.setTauMs(tauUs / 1000f);\\n xStdFilter.setTauMs(tauUs / 1000f);\\n yStdFilter.setTauMs(tauUs / 1000f);\\n xMeanFilter.setTauMs(tauUs / 1000f);\\n yMeanFilter.setTauMs(tauUs / 1000f);\\n setPropertyTooltip(\\\"tauUs\\\", \\\"Time constant in us (microseonds) of median location lowpass filter, 0 for instantaneous\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ce01beb6b463bc88d6c71323a578bff6\",\n \"score\": \"0.5415938\",\n \"text\": \"T median();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7db6a792180b263a886c0e4d3b9072aa\",\n \"score\": \"0.5360307\",\n \"text\": \"public MED009() { }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c82a164339cd92baf29cc8c6610280f\",\n \"score\": \"0.5343605\",\n \"text\": \"public double median() {\\n if (lowerHalf.size() == upperHalf.size()) {\\n return .5 * (lowerHalf.peek() + upperHalf.peek());\\n } else {\\n return upperHalf.peek();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"29cb76a4a2f42d88f3fd304c8a1e3d20\",\n \"score\": \"0.5308204\",\n \"text\": \"public FindMedianFromDataStream() {\\n minHeap = new PriorityQueue<>((n1, n2) -> n1 - n2);\\n maxHeap = new PriorityQueue<>((n1, n2) -> n2 - n1);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5b5230fe98dca72982b60f017808a568\",\n \"score\": \"0.53021336\",\n \"text\": \"private static void calculateRunningMedian() {\\n\\t\\t\\n\\t\\twordsPerLine = new ArrayList<Integer>();\\n\\t\\trunningM = new ArrayList<Double>();\\n\\t\\t\\n\\t\\t//for each line (from linesArray)\\n\\t\\tfor (int i = 0; i< linesArray.size(); i++){\\n\\t\\tint count = 0;\\n\\t\\t\\n\\t\\t//create string Tokenizer to count words\\n\\t\\tStringTokenizer stringTokenizer = new StringTokenizer(linesArray.get(i));\\n\\t \\n\\t\\t//while there are more words\\n\\t while (stringTokenizer.hasMoreElements()){ \\n\\t \\tString currentWord = ((String) stringTokenizer.nextElement()).toLowerCase();\\n\\t \\t\\n\\t \\t//if it is non-empty word, increase the count\\n\\t \\tif (!currentWord.isEmpty()) { \\t\\n\\t \\t\\tcount++;\\n\\t \\t}\\n\\t }\\n\\t \\n\\t //add 'count' as element of wordsPerLine \\n\\t wordsPerLine.add(count);\\n\\t //find Median for elements upto i and add it to runningM \\n\\t \\trunningM.add(findMedian (i));\\n\\t }\\n\\t \\n\\t \\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7e14a07963b11651b132d4f3ac6a4bb0\",\n \"score\": \"0.5287024\",\n \"text\": \"double getMedianValue(int sampleDimension) throws InvalidSampleDimensionException;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"25b7b3be03b6639c2ae93a0123305e59\",\n \"score\": \"0.5240383\",\n \"text\": \"private int medianOfMedians(int[] items, int left, int right) {\\n\\n // Select 5-element chunk, calculate & return the median\\n if (right-left <= 5) {\\n\\n this.insertion.sort(items, left, right);\\n return left + ((right-left) / 2);\\n }\\n\\n // Get median for each 5-chunk of values\\n int numberOfMedians = (int) Math.ceil(right/5);\\n int[] medians = new int[numberOfMedians];\\n\\n for (int i = left; i <= right -5 ; i += 5) {\\n int currentMedian = i > 0? i/5 : i;\\n medians[currentMedian] = this.medianOfMedians(items, i, i+5);\\n }\\n\\n // Select 3 median values (outter right/left and center)\\n int [][] threeMedian;\\n if (medians.length > 3) {\\n threeMedian = new int[3][2];\\n threeMedian[0] = new int[]{items[medians[0]], medians[0]};\\n threeMedian[1] = new int[]{items[medians[medians.length / 2]], medians[medians.length / 2]};\\n threeMedian[2] = new int[]{items[medians[medians.length - 1]], medians[medians.length - 1]};\\n\\n } else {\\n threeMedian = new int[medians.length][2];\\n for (int i = 0; i < medians.length; i++) {\\n threeMedian[i] = new int[]{items[medians[i]], medians[i]};\\n }\\n }\\n\\n // Order & select center-median out of max. 3-medians\\n QuickSort qSort = new QuickSort();\\n qSort.sort(threeMedian);\\n int center = threeMedian.length > 0? threeMedian.length / 2 : 0;\\n return threeMedian[center][1];\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e00682af6abf52d6f07235462e0eed53\",\n \"score\": \"0.52255934\",\n \"text\": \"public void showMedHistPanel() {\\n medHistListPanel = new MedHistListPanel(logic.getFilteredMedHistList(), logic.selectedMedHistProperty(),\\n logic::setSelectedMedHist);\\n middleListPanelPlaceholder.getChildren().clear();\\n middleListPanelPlaceholder.getChildren().add(medHistListPanel.getRoot());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"541dcc74aec99fbd77a511704280bf32\",\n \"score\": \"0.5133099\",\n \"text\": \"public void medianFilter(Boolean[][] filter) {\\n\\t\\tBufferedImage result = blankCopy();\\n\\n\\t\\tIterator<Pixel> itter = iterator();\\n\\t\\tPixel localPixel;\\n\\t\\t\\n\\t\\twhile (itter.hasNext()) {\\n\\t\\t\\tlocalPixel = itter.next();\\n\\t\\t\\tmedianFilterOnce(filter, new Pixel(\\n\\t\\t\\t\\t\\tresult, localPixel.getX(), localPixel.getY()));\\n\\t\\t}\\n\\t\\tworkingImage_ = result;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6297826ae927db09c045b214df1063b8\",\n \"score\": \"0.50972486\",\n \"text\": \"MedicationDispensePerformer createMedicationDispensePerformer();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a8fb0ccd3cb5362d70db1e48994cd829\",\n \"score\": \"0.5080874\",\n \"text\": \"private FieldFinder() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ab16f9152e13f7b41a81e2dba7dc6161\",\n \"score\": \"0.5033585\",\n \"text\": \"private EarthMagneticFluxDensityEstimator() { }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"983aeac3ff03d511df031a6f21bcbd5f\",\n \"score\": \"0.5014599\",\n \"text\": \"private double getMedian() {\\n\\t\\tif (leftQueue.size() == rightQueue.size()) {\\n\\t\\t\\treturn (double) (leftQueue.peek() + rightQueue.peek()) / 2;\\n\\t\\t} else\\n\\t\\t\\treturn leftQueue.size() > rightQueue.size() ? leftQueue.peek() : rightQueue.peek();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a37598bb7d1eff0ad5d0f884e496987c\",\n \"score\": \"0.5007245\",\n \"text\": \"public MSField(int fieldLength, double fieldDensity)\\r\\n\\t{\\r\\n\\t\\t// sets the field variables\\r\\n\\t\\tthis.fieldLength = fieldLength;\\r\\n\\t\\tthis.fieldDensity = fieldDensity;\\r\\n\\t\\tthis.totalMines = (int) (fieldLength * fieldLength * fieldDensity); \\r\\n\\t\\tthis.correctFlags = 0;\\r\\n\\t\\tthis.totalFlags = 0;\\r\\n\\t\\tthis.field = new MSVertex[fieldLength][fieldLength];\\r\\n\\t\\tthis.graph = new ListGraph(fieldLength * fieldLength, false);\\r\\n\\t\\tpopulateField();\\r\\n\\t\\tplaceMines();\\r\\n\\t\\tsetAdjList();\\r\\n\\t\\tsetMineCount();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0016dc885817eedd9b303909eccf48ba\",\n \"score\": \"0.4973381\",\n \"text\": \"private int getMedianNumber(int keyCount) {\\n int medianNumber;\\n if (keyCount % 2 == 1)\\n medianNumber = keyCount / 2 + 1;\\n else\\n medianNumber = (keyCount - 1) / 2 + 1;\\n return medianNumber;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ef4f34e33e247455d9f7761a6bce72e\",\n \"score\": \"0.49685654\",\n \"text\": \"public FPGASegmentFinder() {\\n\\t\\t// TODO Auto-generated constructor stub\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bd118f91f2b68dfc52e986da77a94c73\",\n \"score\": \"0.49615914\",\n \"text\": \"public Magnifier getMagnifier(){\\n \\tif(magnifier == null)\\n \\t\\tmagnifier = new QuickMagnifier(this);\\n \\treturn magnifier;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9b720f3cbd87c30e1a2e110f1b950d93\",\n \"score\": \"0.49522138\",\n \"text\": \"public double printMedian(List<Double> array){\\n double median=0;\\n if (array.size()!=0){\\n Collections.sort(array);\\n\\n int middle = array.size()/2;\\n if (array.size()%2 == 1) {\\n median=array.get(middle);\\n } else {\\n median=((array.get(middle-1)) + (array.get(middle))) / 2.0;\\n }\\n }\\n return median;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9fa7c95a65da412879fec77ac967019b\",\n \"score\": \"0.4943235\",\n \"text\": \"public Filter() {\\n initComponents();\\n settingValues=true;\\n widthSlider.setMinimum(25);\\n widthSlider.setMaximum(12000);\\n offsetSlider.setMinimum(-12000);\\n offsetSlider.setMaximum(12000);\\n settingValues=false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"db3fce7b23006a932ded477485be701d\",\n \"score\": \"0.49305096\",\n \"text\": \"public FinalField(){\\n\\t\\t\\n\\t\\tString[] soundArray = new String[8];\\n\\t\\tsoundArray[0] = \\\"bulbBreak.wav\\\";\\n\\t\\tsoundArray[1] = \\\"flashbang.wav\\\";\\n\\t\\tsoundArray[2] = \\\"jump.wav\\\";\\n\\t\\tsoundArray[3] = \\\"teleport.wav\\\";\\n\\t\\tsoundArray[4] = \\\"bullet.wav\\\";\\n\\t\\tsoundArray[5] = \\\"laser.wav\\\";\\n\\t\\tsoundArray[6] = \\\"pin.wav\\\";\\n\\t\\tsoundArray[7] = \\\"block.wav\\\";\\n\\t\\tsoundEffects = new SoundDriver(soundArray);\\n\\t\\tString[] bMusic = new String[8];\\n\\t\\tbMusic[0] = \\\"Chosen.wav\\\";\\n\\t\\tbMusic[1] = \\\"Setup.wav\\\";\\n\\t\\tbMusic[2] = \\\"bWin.wav\\\";\\n\\t\\tbMusic[3] = \\\"rWin.wav\\\";\\n\\t\\tbMusic[4] = \\\"ECS.wav\\\";\\n\\t\\tbMusic[5] = \\\"teleport.wav\\\";\\n\\t\\tbMusic[6] = \\\"Tutorial.wav\\\";\\n\\t\\tbMusic[7] = \\\"game.wav\\\";\\n\\t\\tmusic = new SoundDriver(bMusic);\\n\\t\\t//redPath = new Path(redHero);\\n\\t\\tgrenade = new ArrayList<SmartBullet>();\\n\\t\\tadditions = new ArrayList<SmartParticle>();\\n\\t\\tredBullets = new ArrayList<SmartBullet>();\\n\\t\\tblueBullets = new ArrayList<SmartBullet>();\\n\\t\\ttowerBoom = new ArrayList<Effects>();\\n\\t\\tfightGround = new Arena(false);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a87c706f5526b6ea4eb4d5d3445ffe01\",\n \"score\": \"0.4929641\",\n \"text\": \"private double calcMedian(int[] numArray) {\\n Arrays.sort(numArray);\\n if (numArray.length % 2 == 0) // check if length is odd or even\\n return ((double) numArray[numArray.length / 2] +\\n (double) numArray[numArray.length / 2 - 1]);\\n else\\n return (double)numArray[numArray.length/2];\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"863cc18c1a8b5c7d911aa85d95163710\",\n \"score\": \"0.49208745\",\n \"text\": \"public Builder setMedallion(\\n java.lang.String value) {\\n if (value == null) {\\n throw new NullPointerException();\\n }\\n bitField0_ |= 0x00000001;\\n medallion_ = value;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"16f0d2462836a1a128d15d57b9d38eaf\",\n \"score\": \"0.49140263\",\n \"text\": \"@Override\\n public void init() {\\n filter = LinearFilter.movingAverage(5);\\n NetworkTableInstance table = NetworkTableInstance.getDefault();\\n NetworkTable cameraTable = table.getTable(\\\"photonvision\\\").getSubTable(robotSettings.GOAL_CAM_NAME);\\n yaw = cameraTable.getEntry(\\\"targetYaw\\\");\\n size = cameraTable.getEntry(\\\"targetArea\\\");\\n hasTarget = cameraTable.getEntry(\\\"hasTarget\\\");\\n pitch = cameraTable.getEntry(\\\"targetPitch\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1c63c197c520e7b9898baa91e21675e6\",\n \"score\": \"0.49116978\",\n \"text\": \"public jpanMedicos(jpanFondo fondo,File D){\\n this.jpanelFondo = fondo;\\n Doctores=D;//\\n Auxiliar=new Doctor();\\n generarDoctores();\\n iniciarComponentes();\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cb07fd70f231fb8afb83ceace12cc717\",\n \"score\": \"0.490608\",\n \"text\": \"@Override\\n public void SetManipulator() {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7900e91128d756e215e79225c57a90e0\",\n \"score\": \"0.49046773\",\n \"text\": \"public Medico() {\\r\\n \\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"591977f7369482a65050c65753e097ca\",\n \"score\": \"0.49018008\",\n \"text\": \"public ElencoMedici(){\\n\\t\\telencoMedici = new ArrayList<Medico>();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7201fe023888750b04323482753d1460\",\n \"score\": \"0.49001336\",\n \"text\": \"private static double computeMedian(int[] inputArray) {\\n\\t\\tif (inputArray.length % 2 == 0) {\\n\\t\\t\\treturn (inputArray[inputArray.length / 2] + inputArray[inputArray.length / 2 + 1]) / 2.0;\\n\\t\\t} else {\\n\\t\\t\\t// get the middle\\n\\t\\t\\treturn inputArray[inputArray.length / 2 + 1];\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3d1917de1b3bc49bce4aebb72b1c1e73\",\n \"score\": \"0.48863348\",\n \"text\": \"private static double findMedian(int index){\\n\\n\\t\\t//if it is the first line\\n\\t\\tif (index==0){\\n\\t\\t\\t//median is the words per line in the first file\\n\\t\\t\\treturn wordsPerLine.get(0);\\n\\t\\t}\\n\\t\\t\\n\\t\\t//for subsequent lines\\n\\t\\t//store the elements of wordsPerLine upto index in an array \\n\\t\\tint[] numWords = new int[index+1];\\n\\t\\tdouble median= 0;\\n\\t\\t\\n\\t\\tfor (int i = 0; i<wordsPerLine.size(); i++){ \\n\\t\\t\\tnumWords[i]= wordsPerLine.get(i);\\n\\t\\t}\\n\\t\\t\\n\\t\\t//sort the array\\n\\t\\tArrays.sort(numWords);\\n\\t\\t\\n\\t\\t//calcualte median from elements in numWords\\n\\t\\tint middle = ((numWords.length) / 2);\\n\\t\\t\\n\\t\\t//for even-numbered list, median is the mean if two elements at middle\\n\\t\\tif(numWords.length % 2 == 0){\\n\\t\\t\\tdouble medianA = numWords[middle];\\n\\t\\t\\tdouble medianB = numWords[middle-1];\\n\\t\\t\\tmedian = (medianA + medianB) / 2;\\n\\t\\t}\\n\\t\\t\\n\\t\\t//for odd-numbered list, median is the value of element in midpoint\\n\\t\\telse{\\t\\t\\n\\t\\t\\tmedian = numWords[middle];\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn median;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"392ce189ce5d69e29baf92b368aa5ebf\",\n \"score\": \"0.48723027\",\n \"text\": \"public interface MassSpectrometryImagingData {\\n\\n /**\\n * Get the full m/z list that is the union of all individual m/z lists\\n * from each spectrum within the dataset.\\n * \\n * @return List of all m/z values within the dataset\\n */\\n double[] getFullmzList();\\n\\n /**\\n * Get the spatial dimensionality. 1 if MS experiment, 2 if MSI experiment \\n * or 3 if 3D MSI experiment.\\n * \\n * @return Spatial dimensionality\\n */\\n int getSpatialDimensionality();\\n\\n /**\\n * Get the dimensionality of dataset. At least 1 greater than \\n * {@link MassSpectrometryImagingData#getSpatialDimensionality()} to account \\n * for m/z dimension. If MS/MS or ion mobility then dimensionality is increased\\n * by a further 1.\\n * \\n * @return Dimensionality\\n */\\n int getDimensionality();\\n\\n /**\\n * Get the number of spectra per pixel with different scan properties, such \\n * as ion mobility or MS/MS. For example, for travelling wave ion\\n * mobility data on a Synapt G2S-i this will be 200. \\n * \\n * @return Number of spectra per pixel\\n */\\n int getNumberOfSpectraPerPixel();\\n\\n /**\\n * Get the spectrum at (x, y).\\n * \\n * <p>TODO: Rethink how to get spectrum at (x, y) but an additional dimension, \\n * for example with ion mobility etc.\\n * \\n * @param x x-coordinate\\n * @param y y-coordinate\\n * @return First spectrum at (x, y), or null if none\\n */\\n Spectrum getSpectrum(int x, int y);\\n\\n /**\\n * Get the spectrum at (x, y, z).\\n * \\n * @param x x-coordinate\\n * @param y y-coordinate\\n * @param z z-coordinate\\n * @return First spectrum at (x, y, z), or null if none\\n */\\n Spectrum getSpectrum(int x, int y, int z);\\n\\n /**\\n * Get width of image in pixels.\\n * \\n * @return Width of image in pixels\\n */\\n int getWidth();\\n \\n /**\\n * Get height of image in pixels.\\n * \\n * @return Height of image in pixels\\n */\\n int getHeight();\\n \\n /**\\n * Get depth of image in pixels.\\n * \\n * @return Depth of image in pixels\\n */\\n int getDepth();\\n\\n /**\\n * Get the minimum m/z that was detected within any spectrum in the dataset.\\n * \\n * @return Minimum m/z value\\n */\\n double getMinimumDetectedmz();\\n \\n /**\\n * Get the maximum m/z that was detected within any spectrum in the dataset.\\n * \\n * @return Maximum m/z value\\n */\\n double getMaximumDetectedmz();\\n \\n /**\\n * Get whether the MSI data is stored in processed format (discrete).\\n * \\n * @return true if data is discrete, false otherwise\\n */\\n boolean isProcessed();\\n \\n /**\\n * Get whether the MSI data is stored in continuous format.\\n * \\n * @return true if data is continuous, false otherwise\\n */\\n boolean isContinuous();\\n \\n /**\\n * Get the total ion count (TIC) image for the dataset by summing up all intensities \\n * for each spatial coordinate within the dataset.\\n * \\n * @return TIC image\\n */\\n double[][] generateTICImage();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f1156f372560035cb1e5e048aa76be7b\",\n \"score\": \"0.48465276\",\n \"text\": \"String median() {\\n\\t\\t\\tint size = tree.size();\\n\\t\\t\\tif (size%2 == 1)\\n\\t\\t\\t\\treturn \\\"\\\" + select((size+1)/2);\\n\\t\\t\\tint a = select(size/2);\\n\\t\\t\\tint b = select(size/2+1);\\n\\t\\t\\tlong val = (long)a+b;\\n\\t\\t\\tif (val % 2 == 0)\\n\\t\\t\\t\\treturn \\\"\\\" + val/2;\\n\\t\\t\\telse if (val > 0) {\\n\\t\\t\\t\\treturn \\\"\\\" + val/2 + \\\".5\\\";\\n\\t\\t\\t} else {\\n\\t\\t\\t\\treturn \\\"-\\\" + (-((val+1)/2)) + \\\".5\\\";\\n\\t\\t\\t}\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b69d2537715410ad19419a37c75b3a33\",\n \"score\": \"0.48352215\",\n \"text\": \"public Builder clearMedallion() {\\n bitField0_ = (bitField0_ & ~0x00000001);\\n medallion_ = getDefaultInstance().getMedallion();\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1cea2a01f2596b5202ef8bde08148626\",\n \"score\": \"0.48344147\",\n \"text\": \"static void printMedian(double[] inputs) {\\r\\n\\t\\t\\tArrays.sort(inputs);\\r\\n\\t\\t\\tint length = inputs.length;\\r\\n\\t\\t\\tdouble median = 0;\\r\\n\\t\\t\\tmedian = (length % 2 == 0) ? (inputs[length / 2] + inputs[length / 2 - 1]) / 2 : inputs[length / 2];\\r\\n\\t\\t\\tStdOut.println(String.format(\\\"midian=%f\\\", median));\\r\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cba2f72e06a49d1e95e7b5261352e796\",\n \"score\": \"0.48336315\",\n \"text\": \"public Builder setMedallionBytes(\\n com.google.protobuf.ByteString value) {\\n if (value == null) {\\n throw new NullPointerException();\\n }\\n bitField0_ |= 0x00000001;\\n medallion_ = value;\\n onChanged();\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"595a93c9ee12aac627a6cf7b4b73309e\",\n \"score\": \"0.48282668\",\n \"text\": \"public FFT() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"569da3f4afab321cce7680859d8a1c54\",\n \"score\": \"0.4810903\",\n \"text\": \"@Override protected void init() {\\n super.init();\\n _w.getSelectedDisperser().setValue(getDataObject().getDisperser().ordinal());\\n _w.getWavelenght().setValue(_roundDouble(getDataObject().getWavelength(), 4));\\n _updateScienceFOV();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1ad8c5abe4e35969e6991039a8957fe1\",\n \"score\": \"0.4806753\",\n \"text\": \"MedicationDispense createMedicationDispense();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dafd61d1c805a2c14e2b17ccfc8121f7\",\n \"score\": \"0.47883353\",\n \"text\": \"public Long getMedian() {\\n /*\\n [1] => 1\\n [1 2] => 2\\n [1 2 3] => 2\\n [1 1 1 1] => 1\\n */\\n // already cached it\\n if (this.median != null) {\\n return this.median;\\n }\\n\\n if (length == 1) {\\n this.median = this.elements[0];\\n return this.median;\\n }\\n\\n Vector vector;\\n\\n if (!this.stable) {\\n // get a sorted clone\\n vector = this.sorted();\\n } else {\\n vector = this;\\n }\\n\\n // get the upper median, which is index length/2 for even, and length/2+1 for odd\\n if (this.reversed) {\\n this.median = vector.elements[length % 2 == 0 ? (length/2)-1 : length/2];\\n } else {\\n this.median = vector.elements[length / 2];\\n }\\n\\n return this.median;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f3336980b753b1b474146bb10e03aa21\",\n \"score\": \"0.47856057\",\n \"text\": \"private static double getMedian(int nums[]){\\n int len = nums.length;\\n return len%2==0 ? (nums[(len-1)/2]+nums[(len-1)/2+1])/2:nums[len/2];\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"570aceba4bac5192fdfc3c0e65ce6f9b\",\n \"score\": \"0.4768615\",\n \"text\": \"public IvMFilter() {\\r\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7b391d809beab19b059ccded4132393d\",\n \"score\": \"0.47662112\",\n \"text\": \"public FrmModifMedico(CdorModifMedico cdor) {\\r\\n\\t\\tsuper();\\r\\n\\t\\tthis.cdor = cdor;\\r\\n\\t\\tinitialize();\\r\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f0d2cefcedc6cf6bed82908a0b7179e\",\n \"score\": \"0.47612837\",\n \"text\": \"public void setMedianPath(boolean medianPath) {\\n\\t\\tthis.medianPath = medianPath;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1abd1e32c098a36c72f5c63f311c8528\",\n \"score\": \"0.4754828\",\n \"text\": \"public FragMilesView() {\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fd0573358f5817e89329a991d229eb97\",\n \"score\": \"0.47538716\",\n \"text\": \"private MFInputManager()\\n {\\n this.mouseListeners = new LinkedList<MFIMouseListener>();\\n this.keyListeners = new LinkedList<MFIKeyListener>();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fc49acc75e06c7aa12a85e8732452f49\",\n \"score\": \"0.47441348\",\n \"text\": \"public MMWMD_BasicLM_DirectFitter() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"33f8f8adea7124f4bf4b50cec79bfe5e\",\n \"score\": \"0.47407776\",\n \"text\": \"public double findMedian() {\\n\\t\\tif (pq1.size() == pq2.size()) {\\n\\t\\t\\treturn (pq1.peek() + pq2.peek()) / 2.0;\\n\\t\\t} else {\\n\\t\\t\\treturn pq1.peek();\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4ca1566fe81bf7c86b10defc906f2765\",\n \"score\": \"0.47370362\",\n \"text\": \"DeferredMaterial() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3574bd03c510e470058a4bcbdbf9e984\",\n \"score\": \"0.4734098\",\n \"text\": \"private static float getMedian(List<Float> values, int mid_element,\\n\\t\\t\\tint start, int end) {\\n\\t\\tif (end - start < 1)\\n\\t\\t\\treturn -1f;\\n\\t\\telse if (end - start == 1)\\n\\t\\t\\treturn values.get(start);\\n\\n\\t\\tint random_ind = start + (int) (Math.random() * (end - start));\\n\\t\\tfloat temp = values.get(start);\\n\\t\\tvalues.set(start, values.get(random_ind));\\n\\t\\tvalues.set(random_ind, temp);\\n\\t\\tint index = partition(values, start, end);\\n\\t\\tif (index == mid_element) {\\n\\t\\t\\tmedian = values.get(index);\\n\\t\\t} else if (index < mid_element) {\\n\\t\\t\\tmedian = getMedian(values, mid_element, index + 1, end);\\n\\t\\t} else {\\n\\n\\t\\t\\tmedian = getMedian(values, mid_element, start, index);\\n\\t\\t}\\n\\t\\treturn median;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"29f84a43713dbe476ae4a8a392da0eaf\",\n \"score\": \"0.4722969\",\n \"text\": \"public static Object $$$FldMEDICDGender(mContext m$) {\\n return (3);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c4f0c46b1134a61defbd87a9bfbfe0e6\",\n \"score\": \"0.47164187\",\n \"text\": \"public Medico(String nomeMedico, String especialidade) {\\r\\n super(nomeMedico);\\r\\n this.especialidade = especialidade;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c546db2cc8307b148154c9879c0e906\",\n \"score\": \"0.47125828\",\n \"text\": \"public static void getMedians(int[] array) {\\n PriorityQueue<Integer> lowers = new PriorityQueue<Integer>(new Comparator<Integer>() {\\n public int compare(Integer a , Integer b){\\n return b-a;\\n }\\n });\\n //MIN Heap for the Upper Half\\n PriorityQueue<Integer> highers = new PriorityQueue<Integer>(); \\n\\n double[] medians = new double[array.length];\\n for(int i=0;i<array.length;i++){\\n int number = array[i];\\n addNumber(number,lowers,highers);\\n rebalance(lowers,highers);\\n medians[i] = getMedian(lowers,highers);\\n }\\n System.out.println(Arrays.toString(medians));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5cf755c5ac47490292939f9b27dee4df\",\n \"score\": \"0.47060525\",\n \"text\": \"public ImageCameraWrapper mo37539d() {\\n return new ImageCameraWrapper(this.f26118a);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d2aa485fd55b8da5333d6233a4e45790\",\n \"score\": \"0.4705385\",\n \"text\": \"public FIRFilter() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d051e9dfb5006838d8ac73e6a8228cc\",\n \"score\": \"0.47030708\",\n \"text\": \"double caluclateMedian(ArrayList<Double> time) {\\n Double medianvalue=0.0;\\n Collections.sort(time);\\n int med=packets%2;\\n if(med==0)\\n {\\n medianvalue=((time.get(med))+(time.get(med-1)))/2;\\n }\\n else\\n {\\n medianvalue=time.get(med);\\n }\\n return medianvalue;\\n\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fbd154c16f2331cf6af1aaafe9ef8502\",\n \"score\": \"0.47005126\",\n \"text\": \"Detinator createDetinator();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a46df7a1803e787b2746fb9750f1869f\",\n \"score\": \"0.4699343\",\n \"text\": \"ESMFActionFieldHalo createESMFActionFieldHalo();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"61016b55fa5cee5379d753c57219aaec\",\n \"score\": \"0.4698693\",\n \"text\": \"public FaceAnalysis() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eeb36f7d811e511d78ab12d32b57b462\",\n \"score\": \"0.4684712\",\n \"text\": \"private PMF() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b96232bad40495897e5cccdd39c4a75d\",\n \"score\": \"0.4684393\",\n \"text\": \"public static Object $$$FldMEDPrescriptionLineInfusionSpeed(mContext m$) {\\n return (38);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"346bb169aa863e7be5063ba443f9f7d3\",\n \"score\": \"0.4683803\",\n \"text\": \"public Key median() {\\r\\n if (isEmpty()) return null;\\r\\n if(size()==1) return root.key;\\r\\n Integer middle = ((root.N+1)/2);\\r\\n return getMedian(root, (Key) middle).key;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5e8e447940c6e64df003ff1a44792faa\",\n \"score\": \"0.4674127\",\n \"text\": \"public interface VolatileMedianBlockTime extends MedianBlockTime { }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2992e9e16f793974ae18ca68e22b6402\",\n \"score\": \"0.46695873\",\n \"text\": \"public void UpdateMedianDelete(BinaryNode<T> node){\\r\\n\\t\\tif(this.Median==null || node==null){ //check if the median or the node is null\\r\\n\\t\\t\\treturn;\\r\\n\\t\\t}\\r\\n\\t\\tBinaryNode<T>[] medianAndParent=this.Search(this.Median); //find the medain and parent\\r\\n\\t\\tBinaryNode<T> medianNode=medianAndParent[1]; //get the median\\r\\n\\t\\tboolean isEven=this.Size %2 ==0; //check if tree size is even\\r\\n\\t\\tboolean isSmaller = node.GetKey() < this.Median.GetKey();\\r\\n\\t\\tboolean isBigger = node.GetKey() > this.Median.GetKey();\\r\\n\\t\\tboolean isSame = !isSmaller && !isBigger;\\r\\n\\t\\t\\r\\n\\t\\tif((!isEven && isSmaller)||(!isEven && isSame)){\\r\\n\\t\\t\\t// if tree size is odd and the inserted value is smaller or equal then the new median\\r\\n\\t\\t\\t//is the succsessor \\r\\n\\t\\t\\tBinaryNode<T> succsessor=medianNode.GetSuccessor();\\r\\n\\t\\t\\tthis.Median=succsessor ==null ? null: succsessor.GetInfo();\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tif((isEven && isBigger)||(isEven && isSame)){\\r\\n\\t\\t\\t// if tree size is even and the inserted value is bigger or equal then the new median\\r\\n\\t\\t\\t//is the predecessor \\r\\n\\t\\t\\tBinaryNode<T> predecessor=medianNode.GetPredecessor();\\r\\n\\t\\t\\tthis.Median=predecessor==null? null: predecessor.GetInfo();\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77b057ecc8e97656427e35bfd56e4795\",\n \"score\": \"0.46689656\",\n \"text\": \"public Mordor(){\\r\\n\\t\\tsuper();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c0d6aa93371c231c1e8dbd633d4f352\",\n \"score\": \"0.46676442\",\n \"text\": \"@Override\\n\\tpublic void calcularMensalidade(double fator) {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0f8a8ff93e5b68cd0b2a9e308365f1a7\",\n \"score\": \"0.4661233\",\n \"text\": \"public MedicalOfficer() throws IOException {\\n initComponents(); \\n\\n File imgfile = new File(\\\"..\\\\\\\\BBMS\\\\\\\\src\\\\\\\\images\\\\\\\\drop.png\\\");\\n FileInputStream imgStream = new FileInputStream(imgfile);\\n BufferedImage bi = ImageIO.read(imgStream);\\n ImageIcon myImg = new ImageIcon(bi);\\n this.setIconImage(myImg.getImage());\\n \\n Initial first = new Initial(jDesktopPane1.getSize());\\n jDesktopPane1.removeAll();\\n jDesktopPane1.add(first);\\n first.setVisible(true);\\n \\n setLocationRelativeTo(null);\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a3fdd49723aee77bf6ff52c31d0cbc30\",\n \"score\": \"0.46530187\",\n \"text\": \"long getMedianMonthlyInventory();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"68fc3e3ead51821e93495e618c265005\",\n \"score\": \"0.46500844\",\n \"text\": \"Medication createMedication();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f723ec9372f448c25684130f6c87b95b\",\n \"score\": \"0.46328282\",\n \"text\": \"private int median(ArrayList<Integer> values) {\\n\\t\\tCollections.sort(values);\\n\\n\\t\\tif (values.size() % 2 == 1) {\\n\\t\\t\\treturn values.get((values.size()+1)/2-1);\\n\\t\\t} else {\\n\\t\\t\\tint lower = values.get(values.size()/2-1);\\n\\t\\t\\tint upper = values.get(values.size()/2);\\n\\t\\t\\t\\n\\t\\t\\treturn (int) ((lower + upper) / 2.0);\\n\\t\\t}\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a056b1d3b735c27977ec42b8183c132f\",\n \"score\": \"0.46283773\",\n \"text\": \"public EvMediumContainer() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d554f2c81faeccc9649f8ec6d78426e\",\n \"score\": \"0.46232766\",\n \"text\": \"public double getMedianValue()\\r\\n {\\r\\n if(Double.isNaN(median))\\r\\n {\\n @SuppressWarnings(\\\"unchecked\\\")\\n final Map.Entry<Integer, Double>[] entries = cMap.entrySet().toArray(new Map.Entry[cMap.size()]);\\n\\n Arrays.sort(entries, new Comparator<Map.Entry<Integer,Double>>() {\\n public int compare(Map.Entry<Integer,Double> e1, Map.Entry<Integer,Double> e2)\\n {\\n return e1.getKey().compareTo(e2.getKey());\\n }\\n });\\n \\n final double totalCount = getTotalCount();\\n final double medianCount = totalCount/2.0;\\n\\n double count = 0;\\n int i=0;\\n for(i=0;i<entries.length && count<medianCount;i++)\\n {\\n count += entries[i].getValue();\\n }\\n i--;\\n\\n if(count==medianCount)\\n median = (entries[i].getKey()+entries[i+1].getKey())/2.0;\\n else\\n median = entries[i].getKey();\\r\\n }\\r\\n return median;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eafcc76843cda5609708cdfb4b5038ea\",\n \"score\": \"0.4619496\",\n \"text\": \"public final void mo28782s() {\\n m23240L();\\n HashMap hashMap = new HashMap(1);\\n hashMap.put(MediationMetaData.KEY_VERSION, this.f21964c.f25057a);\\n mo28729a(\\\"onhide\\\", (Map<String, ?>) hashMap);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c0661d663eaf70f474dc2a91e6d9d81d\",\n \"score\": \"0.4616945\",\n \"text\": \"public FragmentationAnalyzer() {\\r\\n\\r\\n // create the properties object\\r\\n properties = new Properties();\\r\\n\\r\\n // makes sure that '.' is used as the decimal sign\\r\\n Locale.setDefault(Locale.US);\\r\\n\\r\\n try {\\r\\n //PlasticLookAndFeel.setPlasticTheme(new SkyKrupp());\\r\\n //UIManager.setLookAndFeel(new PlasticXPLookAndFeel());\\r\\n //UIManager.setLookAndFeel(new WindowsLookAndFeel());\\r\\n UtilitiesGUIDefaults.setLookAndFeel();\\r\\n } catch (IOException e) {\\r\\n //e.printStackTrace();\\r\\n // ignore error\\r\\n }\\r\\n\\r\\n String path = CompomicsWrapper.getJarFilePath(this.getClass().getResource(\\\"FragmentationAnalyzer.class\\\").getPath(), \\\"FragmentationAnalyzer\\\");\\r\\n\\r\\n // check for new version\\r\\n boolean newVersion = false;\\r\\n if (!path.equalsIgnoreCase(\\\".\\\")) {\\r\\n newVersion = checkForNewVersion();\\r\\n }\\r\\n\\r\\n if (!newVersion) {\\r\\n\\r\\n if (useErrorLog && !path.equalsIgnoreCase(\\\".\\\")) {\\r\\n try {\\r\\n path = path + \\\"/resources/conf/ErrorLog.txt\\\";\\r\\n\\r\\n File file = new File(path);\\r\\n System.setOut(new java.io.PrintStream(new FileOutputStream(file, true)));\\r\\n System.setErr(new java.io.PrintStream(new FileOutputStream(file, true)));\\r\\n\\r\\n // creates a new error log file if it does not exist\\r\\n if (!file.exists()) {\\r\\n file.createNewFile();\\r\\n\\r\\n FileWriter w = new FileWriter(file);\\r\\n BufferedWriter bw = new BufferedWriter(w);\\r\\n\\r\\n bw.close();\\r\\n w.close();\\r\\n }\\r\\n } catch (Exception e) {\\r\\n JOptionPane.showMessageDialog(\\r\\n null, \\\"An error occured when trying to create the ErrorLog.\\\"\\r\\n + \\\"See ../resources/conf/ErrorLog.txt for more details.\\\",\\r\\n \\\"Error Creating ErrorLog\\\", JOptionPane.ERROR_MESSAGE);\\r\\n Util.writeToErrorLog(\\\"Error when creating ErrorLog: \\\");\\r\\n e.printStackTrace();\\r\\n }\\r\\n }\\r\\n\\r\\n initComponents();\\r\\n\\r\\n this.setTitle(analyzerName + \\\" \\\" + properties.getVersion());\\r\\n\\r\\n // make the interal frame tool bars invisible\\r\\n spectrumPanelToolBarJInternalFrame.setVisible(false);\\r\\n boxPlotPanelToolBarJInternalFrame.setVisible(false);\\r\\n\\r\\n plotsAndAnalysesJScrollPane.getVerticalScrollBar().addAdjustmentListener(new AdjustmentListener() {\\r\\n\\r\\n public void adjustmentValueChanged(AdjustmentEvent e) {\\r\\n\\r\\n // this code moved the toolbars relative to the scrollpane to make\\r\\n // sure that they are always visible\\r\\n if (!e.getValueIsAdjusting()) {\\r\\n spectrumPanelToolBarJInternalFrame.setBounds(\\r\\n (int) spectrumPanelToolBarJInternalFrame.getBounds().getX(),\\r\\n 40 + e.getValue(),\\r\\n (int) spectrumPanelToolBarJInternalFrame.getBounds().getWidth(),\\r\\n (int) spectrumPanelToolBarJInternalFrame.getBounds().getHeight());\\r\\n\\r\\n boxPlotPanelToolBarJInternalFrame.setBounds(\\r\\n (int) boxPlotPanelToolBarJInternalFrame.getBounds().getX(),\\r\\n 40 + e.getValue(),\\r\\n (int) boxPlotPanelToolBarJInternalFrame.getBounds().getWidth(),\\r\\n (int) boxPlotPanelToolBarJInternalFrame.getBounds().getHeight());\\r\\n }\\r\\n }\\r\\n });\\r\\n\\r\\n jMenuBar.putClientProperty(Options.HEADER_STYLE_KEY, HeaderStyle.SINGLE);\\r\\n jMenuBar.putClientProperty(Options.NO_ICONS_KEY, Boolean.TRUE);\\r\\n\\r\\n // central allignment for the text in all combo boxes\\r\\n centrallyAllignComboBoxes();\\r\\n\\r\\n // the following lines are needed to make sure that the frame looks ok when\\r\\n // the scrollbars are showing (which changes the frame somewhat)\\r\\n while (searchSettingsJScrollPane.getViewport().getViewRect().height\\r\\n < searchSettingsJXTaskPaneContainer.getMinimumSize().getHeight()) {\\r\\n this.setPreferredSize(new Dimension(this.getWidth(), this.getHeight() + 1));\\r\\n pack();\\r\\n }\\r\\n\\r\\n while (resultsJScrollPane.getViewport().getViewRect().height\\r\\n < resultsJXTaskPaneContainer.getMinimumSize().getHeight()) {\\r\\n this.setPreferredSize(new Dimension(this.getWidth(), this.getHeight() + 1));\\r\\n pack();\\r\\n }\\r\\n\\r\\n // make sure the main frame is not too wide for the screen\\r\\n Dimension dim = Toolkit.getDefaultToolkit().getScreenSize();\\r\\n\\r\\n if (dim.getWidth() < this.getWidth()) {\\r\\n this.setPreferredSize(new Dimension(dim.width - 50, this.getPreferredSize().height));\\r\\n pack();\\r\\n }\\r\\n\\r\\n setColumnProperties();\\r\\n\\r\\n searchResultsJXTaskPane.setExpanded(false);\\r\\n plotsAnalysesJXTaskPane.setExpanded(false);\\r\\n spectraJXTaskPane.setExpanded(false);\\r\\n\\r\\n userProperties = new UserProperties(properties.getVersion());\\r\\n userProperties.readUserPropertiesFromFile(null);\\r\\n\\r\\n // sets the icon of the frame\\r\\n setIconImage(Toolkit.getDefaultToolkit().getImage(getClass().\\r\\n getResource(\\\"/no/uib/fragmentation_analyzer/icons/box_plot_small.GIF\\\")));\\r\\n\\r\\n setLocationRelativeTo(null);\\r\\n setExtendedState(Frame.MAXIMIZED_BOTH);\\r\\n setVisible(true);\\r\\n\\r\\n initialSizeHasBeenSet = true;\\r\\n\\r\\n plotPaneCurrentPreferredSize = plotsAndAnalysesJScrollPane.getMinimumSize();\\r\\n\\r\\n new DataSource(this, true);\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7fb951bc73353a5328ec225f7d043ff3\",\n \"score\": \"0.46156138\",\n \"text\": \"public void UpdateMedianInsert(BinaryNode<T> node){\\r\\n\\t\\tBinaryNode<T>[] medianAndParent=this.Search(this.Median); //find the medain and parent\\r\\n\\t\\tBinaryNode<T> medianNode=medianAndParent[1]; //get the medain\\r\\n\\t\\t\\r\\n\\t\\tboolean isEven=this.Size %2 ==0; //check if tree size is even\\r\\n\\t\\tboolean isSmaller = node.GetKey() < this.Median.GetKey(); //check if the inserted is smaller than median \\r\\n\\t\\t\\r\\n\\t\\tif(isEven && isSmaller){ // if tree size is even and the inserted value is smaller then the new median\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t//is the predecessor \\r\\n\\t\\t\\tBinaryNode<T> predecessor=medianNode.GetPredecessor();\\r\\n\\t\\t\\tthis.Median=predecessor==null? null: predecessor.GetInfo();\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tif(!(isEven || isSmaller)){ // if tree size is odd and the median is smaller then the new median\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t//or equal then the new median is the succsessor \\r\\n\\t\\t\\tBinaryNode<T> succsessor=medianNode.GetSuccessor();\\r\\n\\t\\t\\tthis.Median=succsessor ==null ? null: succsessor.GetInfo();\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cb9bfa60907bc4f290ef16d59f311070\",\n \"score\": \"0.461306\",\n \"text\": \"NFraction createNFraction();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"52a08c50fabd4775586c0182f3be33d3\",\n \"score\": \"0.46127132\",\n \"text\": \"public void setMediationData(MediationData mediationData) {\\n\\t\\tthis.mMediationData = mediationData;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"31b676d4b7f4c107c4f160e833023467\",\n \"score\": \"0.4612037\",\n \"text\": \"public static Object $$$FldMEDProviderFREE9(mContext m$) {\\n return (29);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4cb15881163cd77efbca870a04ce9847\",\n \"score\": \"0.4605864\",\n \"text\": \"private MediaState() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2fc9a3c657a2d4d002814e4717992814\",\n \"score\": \"0.4593193\",\n \"text\": \"private FinchLimits() {}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":983196,"cells":{"query_id":{"kind":"string","value":"2ade80a039e2401e2e95ce2a50d3f82d"},"query":{"kind":"string","value":"Calls onBeforeLoad method in the knowledge base. Called just before onLoad. The implementation could for example register data types."},"positive_passages":{"kind":"list like","value":[{"docid":"9498ae80f37204254a60d2615d42a305","score":"0.81796795","text":"void onBeforeLoad();","title":""}],"string":"[\n {\n \"docid\": \"9498ae80f37204254a60d2615d42a305\",\n \"score\": \"0.81796795\",\n \"text\": \"void onBeforeLoad();\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"eef52e9a270ff74a19d9612715bfb246","score":"0.7279126","text":"@Override\n protected void loadDataInitial() {\n\n }","title":""},{"docid":"14b7b452a00b9bf765703352a6a1e621","score":"0.718057","text":"@Override\r\n\tprotected boolean beforeLoad() {\n\t\treturn false;\r\n\t}","title":""},{"docid":"fd10d201f94de3195fb2a36c3d0ad436","score":"0.7128392","text":"@Override\r\n\tprotected void doLoad()\r\n\t{\r\n\t}","title":""},{"docid":"c804d65a22ebfc950cd7e0a01a514b6c","score":"0.71248275","text":"public void postLoad() {\n\n }","title":""},{"docid":"d4b04750440a11815fab8f95129800f8","score":"0.71087176","text":"protected void onStartDataLoading() {\n\n\t}","title":""},{"docid":"74e2bd7eaf43891fa1754693bb1eb3f9","score":"0.70594764","text":"@Override\n\tpublic void onLoad() {\n\t}","title":""},{"docid":"613265e7fd905437a5b869adec6ad849","score":"0.69870996","text":"@Override\n\tprotected void doLoad() {\n\t}","title":""},{"docid":"0a3caeb691b20220901b6b7008ff38cf","score":"0.6913382","text":"@Override\n\tpublic boolean onPreLoad(String tag, Object... params) {\n\t\tshowLoadView();\n\t\treturn false;\n\t}","title":""},{"docid":"3b2365811b04e45156b42b80dca31f8c","score":"0.6912038","text":"protected abstract void loadInitData();","title":""},{"docid":"7ed17a7ea3d47b560c0056768b627037","score":"0.68721515","text":"public void onLoad() {\n\n\n\t}","title":""},{"docid":"d6028f5cd9c4c0bc277bb3189f21f245","score":"0.68215084","text":"public void onForceLoad() {\n this.f7647a.onForceLoad();\n }","title":""},{"docid":"7ced957310735bd6c50c57afea60dc40","score":"0.6769874","text":"@Override\r\n\tpublic void loadData() {\n\t}","title":""},{"docid":"834527278872a775a1566d0ce0fdfdfe","score":"0.66901886","text":"@Override\n\tprotected void onStart()\n\t{\n\t\tsuper.onStart();\n\t\tloadData();\n\t}","title":""},{"docid":"46f678b101641ecfc9b5a8be3ed8fe9d","score":"0.66735053","text":"@Mod.EventHandler public final void onPreLoad\t\t\t(FMLPreInitializationEvent\taEvent) {onModPreInit(aEvent);}","title":""},{"docid":"87f37ec3656e747cf57626233ca788ab","score":"0.6671307","text":"@Override\r\n public void Load() {\n super.Load();\r\n }","title":""},{"docid":"298bc7541e38216aab6b90ad38c5baab","score":"0.66666687","text":"@Override\n\tpublic void loadData() {\n\n\t}","title":""},{"docid":"a3bf2408f0fad0be77eaf34e9a3ea7d4","score":"0.6615996","text":"@Override\r\n\tprotected void load() {\n\t\t\r\n\t}","title":""},{"docid":"a3bf2408f0fad0be77eaf34e9a3ea7d4","score":"0.6615996","text":"@Override\r\n\tprotected void load() {\n\t\t\r\n\t}","title":""},{"docid":"10e27a5babfb08ae0d2e113ef91cd8b4","score":"0.6611474","text":"@Override\n\tprotected void handleLoad() {\n\t\t\n\t}","title":""},{"docid":"53ce4250180e7068b7dd58d43439dc4b","score":"0.65792483","text":"public void afterLoad(){}","title":""},{"docid":"d0f9b5b3f5e6e9d852d8ae47b488889b","score":"0.65579253","text":"@Override protected void onStartLoading() {\r\n\t\tif (mCharts != null) {\r\n\t\t\t// If we currently have a result available, deliver it\r\n\t\t\t// immediately.\r\n\t\t\tdeliverResult(mCharts);\r\n\t\t}\r\n\t\tif (mCharts == null) forceLoad();\r\n\r\n\t\t//\t\tif (takeContentChanged() || mCharts == null || configChange) {\r\n\t\t//\t\t\t// If the data has changed since the last time it was loaded\r\n\t\t//\t\t\t// or is not currently available, start a load.\r\n\t\t//\t\t\tforceLoad();\r\n\t\t//\t\t}\r\n\t}","title":""},{"docid":"872fc8d8da5cea016a46ea9221fff77b","score":"0.6525454","text":"private void initialLoad() {\n callGenreApi();\n }","title":""},{"docid":"634ed80efa6e395bea70ea611da0756f","score":"0.6513353","text":"@Override\n public void load()\n {\n }","title":""},{"docid":"2a85249732e610633df1c0e5fc34090f","score":"0.6512311","text":"public void onStartLoading() {\n this.f7647a.onStartLoading();\n }","title":""},{"docid":"4983395b96c567c017f68bf3558e410d","score":"0.6503752","text":"@Override\r\n\tprotected void load() {\n\r\n\t}","title":""},{"docid":"22621d0bf026a50df5b3fb41e9e7460a","score":"0.64969736","text":"void initBeforeSave();","title":""},{"docid":"97b6907c48a93f1201477b27f7893565","score":"0.6463653","text":"@Override\n public void load() {\n }","title":""},{"docid":"7ffcd5faf832a9ef146925855e6f502c","score":"0.6446289","text":"@Override\r\n\tprotected boolean afterLoad() {\n\t\treturn false;\r\n\t}","title":""},{"docid":"bbd298c4cd06a22f30cf9f1a183409ba","score":"0.64384925","text":"@Override\n\tpublic void preInit(FMLPreInitializationEvent event) {\n\t\tsuper.preInit(event);\n\t}","title":""},{"docid":"2859466f75125fe59b18908c02dff8b8","score":"0.64369506","text":"@Override // androidx.loader.content.Loader\n public void onForceLoad() {\n loadInternal();\n }","title":""},{"docid":"90b84c76e45e6b963b820565db35ac3b","score":"0.6433992","text":"@Override\n public void loadData() {\n return;\n }","title":""},{"docid":"62933e441e25a4601ebfdbfc906b086a","score":"0.64267516","text":"@Override\r\n\tprotected void doLoadDefault()\r\n\t{\r\n\t}","title":""},{"docid":"3a6a09956001e014e09431c34e45e22f","score":"0.6424256","text":"void onLoad();","title":""},{"docid":"3a6a09956001e014e09431c34e45e22f","score":"0.6424256","text":"void onLoad();","title":""},{"docid":"acbd7a06823f98a95121f2b14ff8db35","score":"0.64238036","text":"@Override\r\n\tprotected void lazyLoad() {\n\t\t\r\n\t}","title":""},{"docid":"815d86ed0a0db236e9f6f32972e96488","score":"0.6419053","text":"@Override\n\tprotected void load() {\n\t\t\n\t}","title":""},{"docid":"c373014c84f3da7b9eb0c646cb8d2fb2","score":"0.6387852","text":"@Override\n\tpublic void load() {\n\t\t\n\t}","title":""},{"docid":"e51b051d74deac2a0c7e6018de127bb9","score":"0.6364275","text":"public void loadData()\n {\n }","title":""},{"docid":"a6e0298714a0a023baf840905792dbba","score":"0.63567233","text":"@Override\n\tprotected void doLoadDefault() {\n\n\t}","title":""},{"docid":"87372cb51f270735dc6bc473b707e359","score":"0.63324964","text":"void onAfterLoad();","title":""},{"docid":"60088acacd49490cfb94a4cdd7d0874e","score":"0.6326815","text":"@Override\n public void onLoadComplete() {\n }","title":""},{"docid":"c3178cb5cefd89d38838c8899a0f4ccd","score":"0.6318811","text":"private synchronized void fireDataLoadInit() {\n\t\tIterator<DataLoadListener> i = _listeners.iterator();\n\t\twhile (i.hasNext()) {\n\t\t\t((DataLoadListener) i.next()).dataLoadInit();\n\t\t}\n\t}","title":""},{"docid":"d5f75e4a40a73e49db18c88d7f616d25","score":"0.6298755","text":"@Override\nprotected void load() {\n\t\n}","title":""},{"docid":"604f74e3111e3545c01e6ae876daaca6","score":"0.62821734","text":"protected boolean needPreLoad() {\n return false;\n }","title":""},{"docid":"615e32fe128f566f5f5e3d39d584924b","score":"0.62814325","text":"@Override\n\t\t\tpublic void loading() {\n\n\t\t\t}","title":""},{"docid":"fbbce6cc19f7bb9f744f32c0d2e0dc6f","score":"0.6268857","text":"@Override\r\n public void beforeLoad() {\n for (ContentDependency dependency : dependencies) {\r\n dependency.getSourceContent().load(false);\r\n }\r\n }","title":""},{"docid":"3186002c68b2a42246817e3ef2a9e404","score":"0.6255879","text":"public void onLoaded() {\n\n }","title":""},{"docid":"6f72a08eb3386202717a94c29201b222","score":"0.62456256","text":"@Override\n\tprotected void lazyLoad() {\n\n\t}","title":""},{"docid":"e442f3cfdc81b9e764ea2621bd81d161","score":"0.62262577","text":"public void loadMetaData(){\n\t}","title":""},{"docid":"b32505fb0363b6cc751fd6bcf382093e","score":"0.6203805","text":"@EventHandler\n public void preInit(FMLPreInitializationEvent e) \n {\n \tthis.proxy.preInit(e);\n }","title":""},{"docid":"e2d1614c9c9b6d78b385c01644a7fdc3","score":"0.6193327","text":"protected void load() {}","title":""},{"docid":"64f2e508f1645cfe00372697e8565a7c","score":"0.6146525","text":"@Override\n\t\t\tpublic void onLoad() {\n\t\t\t\tpage++;\n\t\t\t\tLogUtil.d(\"setOnLoadListener\" + page);\n\t\t\t\tif (page <= countPage) {// 如果加载的页数小于或等于总页数，则加载\n\t\t\t\t\tloadData();\n\t\t\t\t} else {\n\t\t\t\t\tlv_scroll.loadCompleted();\n\t\t\t\t}\n\t\t\t}","title":""},{"docid":"de203cc9507bcace44f871488b4784c3","score":"0.61293817","text":"@PostConstruct\n public void load() {\n LifecycleCounter.getInstance().incrementLoad();\n }","title":""},{"docid":"d4f3693686e37d7f4fc756a59687003b","score":"0.61236364","text":"private void preLoad() {\n getContext().setState(\"Preload\");\n if (preloader != null) {\n preloader.open(getContext());\n if (getContext().isInError()) {\n reportTransformContextError(getContext());\n } else {\n while (getContext().isNotInError() && !preloader.eof()) {\n TransactionContext txnContext = new TransactionContext(getContext());\n DataFrame frame = preloader.read(txnContext);\n preloadListeners(frame);\n preloadTransformers(frame);\n }\n }\n }\n }","title":""},{"docid":"f2f196a0dab854f06c1467f9564a3136","score":"0.6106748","text":"@Override\n\tpublic void onLoadComplete() {\n\n\t}","title":""},{"docid":"791401ed5618fd4cd6eb121d7296f6df","score":"0.6100559","text":"@Override\n\tpublic void loading() {\n\t\t\n\t}","title":""},{"docid":"b14cffacd51e1ce2462cbb7320ae9815","score":"0.60810995","text":"@Override\n\tprotected void preInilize() {\n\t\t\n\t}","title":""},{"docid":"9e93b5a50dff0799bd539d43cb7b8047","score":"0.6075557","text":"public void onPreInitialization(@Nonnull FMLPreInitializationEvent event) {\n this.registerEntitySerializers();\n\n // forcefully initialize registry early on\n ModularExplosive.getRegistry();\n\n ForgeChunkManager.setForcedChunkLoadingCallback(ICBMModification.getInstance(), (tickets, world) -> {\n });\n NetworkRegistry.INSTANCE.registerGuiHandler(ICBMModification.getInstance(), new ICBMGuiHandler());\n\n this.registerNetworkMessages();\n this.registerModularExplosives();\n }","title":""},{"docid":"ce99a23d9b6c581c1acea6e15a7a2065","score":"0.6072017","text":"@Override\n\tpublic void onLoadComplete() {\n\t\t\n\t\t\n\t\t\n\t}","title":""},{"docid":"e5cab5f0c7b2c21c2b2ee6ceb0660cb1","score":"0.6068176","text":"public LoadDataEventBean() {\n super(EventType.LOADED);\n }","title":""},{"docid":"e78e843182437e12f2845279dcada034","score":"0.6066705","text":"private void load() {\n }","title":""},{"docid":"c7c6186a5b09f463dcafd345b77b442f","score":"0.6060624","text":"public void load() {\n\t}","title":""},{"docid":"a003118a5c8e85de6e59dd84ed094f3e","score":"0.6051148","text":"public static void preInit() {\n }","title":""},{"docid":"59015548132f9ba943cac7bd044b7e4a","score":"0.6045231","text":"@Override\nprotected void isLoaded() throws Error {\n\t\n}","title":""},{"docid":"f69fc04626bc43eb04b1b4af7aca12fd","score":"0.6040998","text":"public abstract void onLoad(Princess princess);","title":""},{"docid":"3505f600b3d6c9dce91813d9a3b9c5d4","score":"0.6040362","text":"@Override\n\tpublic void onLoadComplete() {\n\t\t// TODO Auto-generated method stub\n\t\t\n\t}","title":""},{"docid":"ca85864bc37448862267a840a558c4a5","score":"0.60401976","text":"@Override\n\tprotected void onStartLoading() {\n\t\t\n\t\tif (DEBUG) {\n\t\t\tLog.i(TAG, \"== onStartLoading() ==\");\n\t\t}\n\t\t\n\t\tif (mAccounts != null) {\n\t\t\t// Deliver the previously loaded data immediately.\n\t\t\tdeliverResult(mAccounts);\n\t\t}\n\t\t\n\t\tif (!mIsObserving) {\n\t\t\tmIsObserving = true;\n\t\t}\n\t\t\n\t\t// This method is used to notify if a change has happen.\n\t\tif (takeContentChanged()) {\n\t\t\t// When our Observer detects a event it will call to\n\t\t\t// onContentChanged on this instance, this will cause that\n\t\t\t// the next call to takeContentChanged() return true.\n\t\t\t// In this case or if the current data is null we force a new \n\t\t\t// load.\n\t\t\tif (DEBUG) {\n\t\t\t\tLog.i(TAG, \"== A new change has been submit, starting force load... ==\");\n\t\t\t}\n\t\t\t\n\t\t\t// This method actually loads the data.\n\t\t\tforceLoad();\n\t\t} else if (mAccounts == null) {\n\t\t\t\n\t\t\tif (DEBUG) {\n\t\t\t\tLog.i(TAG, \"== No accounts found, starting force load. ==\");\n\t\t\t}\n\t\t\t\n\t\t\t// This method actually loads the data.\n\t\t\tforceLoad();\n\t\t\t\n\t\t}\t\t\n\t}","title":""},{"docid":"3b78da438a1fc9c6498611bda4ec23f1","score":"0.6035284","text":"public void initialize() {\r\n // Initialization is done by getPageBean()\r\n }","title":""},{"docid":"c788770bc9c988dab481a77d79cd787b","score":"0.6033304","text":"@Override\n\tpublic void onLoaded(CoronaRuntime runtime) {}","title":""},{"docid":"4a8e95520ebe0d6a6d183e37bdbced08","score":"0.6016831","text":"@Mod.EventHandler\n public void preInit(FMLPreInitializationEvent e) {\n setup.preInit(e);\n proxy.preInit(e);\n }","title":""},{"docid":"ddce4d926c7b35357f33dc2e27ac92ff","score":"0.6010866","text":"@EventHandler\n public void PreInit(FMLPreInitializationEvent event) {\n event.getModMetadata().version = Refs.fullVersionString();\n \n Logger log = event.getModLog();\n Configuration config = new Configuration(event.getSuggestedConfigurationFile());\n \n CustomTabs.init();\n // Load configs\n config.load();\n Config.setUp(config);\n config.save();\n \n Blocks.init();\n Items.init();\n \n }","title":""},{"docid":"3f8d1863338d3ce8d87a9be07c8aada6","score":"0.6006518","text":"void onBeforeReload();","title":""},{"docid":"4967494f628119c8d3a4740e09278944","score":"0.5993729","text":"@Override\r\n\tprotected void initData() {\n\r\n\t}","title":""},{"docid":"73d58b66d1669ad751adc5f175e7d158","score":"0.5990463","text":"protected abstract void load();","title":""},{"docid":"84f2a655b31a614f58594f01d44f4297","score":"0.5985926","text":"public void setOnDataLoad(\n final Code aOnDataLoad) {\n onDataLoad = aOnDataLoad;\n }","title":""},{"docid":"078446009d4696f74faa4277745d0849","score":"0.5982807","text":"public void lazyLoad(){\n\t}","title":""},{"docid":"5ad7a60a3c62d0920dff76300c36f2cc","score":"0.5980953","text":"public void onResume() {\n m_needsLoad = true;\n }","title":""},{"docid":"8867fa03d450b77702abba3be39b11ec","score":"0.59795","text":"protected void entityInit(){}","title":""},{"docid":"df953788917e046cda89584624345d1a","score":"0.5971083","text":"@Override\n protected void onStartLoading() {\n if (cursor != null) {\n deliverResult(cursor);\n }\n\n if (takeContentChanged() || cursor == null) {\n forceLoad();\n }\n }","title":""},{"docid":"5aa237d31e744d1e0729621e464fcfb2","score":"0.59699595","text":"@Override\r\n\tprotected void DataInit() {\n\r\n\t}","title":""},{"docid":"a3ad215414abf7786b89536e8f8bc7eb","score":"0.5959049","text":"@Mod.EventHandler\n public void preInit(FMLPreInitializationEvent event) {\n eventProcessor = new EventProcessor();\n LOGGER.info(\"Initialized EventProcessor!\");\n\n mixinLoader = new MixinLoader();\n LOGGER.info(\"Initialized MixinLoader!\");\n }","title":""},{"docid":"c73e0a816e960481a1bd62f7e231e73c","score":"0.5955706","text":"@Override\n\tprotected void doAfterInit() {\n\t}","title":""},{"docid":"0be90aa98da32ae1e2a72a98bcf2d08d","score":"0.5949414","text":"@Override\n public void onFirstInit() {\n }","title":""},{"docid":"c9dc40aef4e79ffe61c429b0d0d04088","score":"0.5947239","text":"public void load() {\n\t\t\n\t}","title":""},{"docid":"c9dc40aef4e79ffe61c429b0d0d04088","score":"0.5947239","text":"public void load() {\n\t\t\n\t}","title":""},{"docid":"4fd7a4c4cde3ed621cc552fadc0b3917","score":"0.59460515","text":"@Override\r\n\tpublic void preProcess(IObservationContext context)\r\n\t\t\tthrows ThinklabException {\n\t\t\r\n\t}","title":""},{"docid":"e60da201d12a992da4a8a615e7b458d6","score":"0.5946051","text":"public void preInit() {\n initBlocks();\n initItems();\n initRecipes();\n// initArmorMaterials();\n }","title":""},{"docid":"a7282ea655f52efcecd17595816536d2","score":"0.5941618","text":"@Override\n protected void onStartLoading() {\n if (mBundle == null) {\n return;\n }\n\n // If mMovieList is not empty, deliver that result. Otherwise, force a load\n if(!mMovieList.isEmpty()) {\n deliverResult(mMovieList);\n } else {\n forceLoad();\n }\n }","title":""},{"docid":"47c412f9a0ad1539c9178a06e8b52aeb","score":"0.5938091","text":"@Override\n public void init() {\n LoadTree loadTree = new LoadTree();\n this.tree1Model1.setModel(new DefaultTreeModel(loadTree.populateNodes()));\n // Perform initializations inherited from our superclass\n super.init();\n // Perform application initialization that must complete\n // *before* managed components are initialized\n // TODO - add your own initialiation code here\n\n // <editor-fold defaultstate=\"collapsed\" desc=\"Managed Component Initialization\">\n // Initialize automatically managed components\n // *Note* - this logic should NOT be modified\n try {\n _init();\n } catch (Exception e) {\n log(\"Templete Initialization Failure\", e);\n throw e instanceof FacesException ? (FacesException) e : new FacesException(e);\n }\n\n // </editor-fold>\n // Perform application initialization that must complete\n // *after* managed components are initialized\n // TODO - add your own initialization code here\n }","title":""},{"docid":"49eccf06fd203e43c450771d732a86e3","score":"0.59289974","text":"@Override\r\n\tprotected void isLoaded() throws Error {\n\t\t\r\n\t}","title":""},{"docid":"49eccf06fd203e43c450771d732a86e3","score":"0.59289974","text":"@Override\r\n\tprotected void isLoaded() throws Error {\n\t\t\r\n\t}","title":""},{"docid":"674cc3c7df1da8d156f73a1a28ae6f59","score":"0.59165055","text":"@Override\n\tpublic void InitData() {\n\n\t}","title":""},{"docid":"fc9c8f152657e70972770e36fbe5c548","score":"0.59151417","text":"@Override public void onActivityCreated(@Nullable Bundle savedInstanceState) {\n super.onActivityCreated(savedInstanceState);\n\n initializeViewModel();\n\n initializeData();\n }","title":""},{"docid":"6582e3645915fb76db0a5b38eb0803af","score":"0.59127724","text":"@Override\n public long startLoad() {\n return 0L;\n }","title":""},{"docid":"02b601a5aeb9c944c00812037972d4e5","score":"0.59107804","text":"@Override\n\tprotected void onStart() {\n\t\tsuper.onStart();\n\t\tloadDataFromCloud(); //从云端把本地没有的数据取来\n\t}","title":""},{"docid":"c0c73bcdc51a97fe8c2cf0a395a6e103","score":"0.59059757","text":"@Override\n public void initialize() {\n MetadataDictionary.initialize();\n }","title":""},{"docid":"89b8fea49d40064aceffc616029dd64b","score":"0.59053576","text":"@PreInit\n\tpublic void preInit(FMLPreInitializationEvent event) {\n\t}","title":""},{"docid":"d4249e09b1b5001237b084e02356ed0c","score":"0.5904173","text":"@Override\r\n\tpublic void afterInit() {\n\t\t\r\n\t}","title":""},{"docid":"e492a2956adc8beeced63358eac7b946","score":"0.5903973","text":"@MainThread\n public <Key> void triggerInitialLoad(final Key initialLoadKey) {\n if (mInitialized) {\n return;\n }\n mInitialized = true;\n mBackgroundThreadExecutor.execute(new Runnable() {\n @Override\n public void run() {\n if (mInvalid.get()) {\n return;\n }\n\n final List<Type> initialData =\n mDataSource.loadAfterInitial(initialLoadKey, mConfig.mPageSize);\n if (initialData != null) {\n mMainThreadExecutor.execute(new Runnable() {\n @Override\n public void run() {\n if (mInvalid.get()) {\n return;\n }\n setInitialDataAndDispatch(initialData);\n }\n });\n } else {\n freeze();\n }\n }\n });\n }","title":""},{"docid":"317f4a52940ba9413ae3b92c48102cc5","score":"0.58741677","text":"void onLoadedDataFromDatabase();","title":""}],"string":"[\n {\n \"docid\": \"eef52e9a270ff74a19d9612715bfb246\",\n \"score\": \"0.7279126\",\n \"text\": \"@Override\\n protected void loadDataInitial() {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"14b7b452a00b9bf765703352a6a1e621\",\n \"score\": \"0.718057\",\n \"text\": \"@Override\\r\\n\\tprotected boolean beforeLoad() {\\n\\t\\treturn false;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fd10d201f94de3195fb2a36c3d0ad436\",\n \"score\": \"0.7128392\",\n \"text\": \"@Override\\r\\n\\tprotected void doLoad()\\r\\n\\t{\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c804d65a22ebfc950cd7e0a01a514b6c\",\n \"score\": \"0.71248275\",\n \"text\": \"public void postLoad() {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d4b04750440a11815fab8f95129800f8\",\n \"score\": \"0.71087176\",\n \"text\": \"protected void onStartDataLoading() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"74e2bd7eaf43891fa1754693bb1eb3f9\",\n \"score\": \"0.70594764\",\n \"text\": \"@Override\\n\\tpublic void onLoad() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"613265e7fd905437a5b869adec6ad849\",\n \"score\": \"0.69870996\",\n \"text\": \"@Override\\n\\tprotected void doLoad() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0a3caeb691b20220901b6b7008ff38cf\",\n \"score\": \"0.6913382\",\n \"text\": \"@Override\\n\\tpublic boolean onPreLoad(String tag, Object... params) {\\n\\t\\tshowLoadView();\\n\\t\\treturn false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3b2365811b04e45156b42b80dca31f8c\",\n \"score\": \"0.6912038\",\n \"text\": \"protected abstract void loadInitData();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7ed17a7ea3d47b560c0056768b627037\",\n \"score\": \"0.68721515\",\n \"text\": \"public void onLoad() {\\n\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d6028f5cd9c4c0bc277bb3189f21f245\",\n \"score\": \"0.68215084\",\n \"text\": \"public void onForceLoad() {\\n this.f7647a.onForceLoad();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7ced957310735bd6c50c57afea60dc40\",\n \"score\": \"0.6769874\",\n \"text\": \"@Override\\r\\n\\tpublic void loadData() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"834527278872a775a1566d0ce0fdfdfe\",\n \"score\": \"0.66901886\",\n \"text\": \"@Override\\n\\tprotected void onStart()\\n\\t{\\n\\t\\tsuper.onStart();\\n\\t\\tloadData();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"46f678b101641ecfc9b5a8be3ed8fe9d\",\n \"score\": \"0.66735053\",\n \"text\": \"@Mod.EventHandler public final void onPreLoad\\t\\t\\t(FMLPreInitializationEvent\\taEvent) {onModPreInit(aEvent);}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"87f37ec3656e747cf57626233ca788ab\",\n \"score\": \"0.6671307\",\n \"text\": \"@Override\\r\\n public void Load() {\\n super.Load();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"298bc7541e38216aab6b90ad38c5baab\",\n \"score\": \"0.66666687\",\n \"text\": \"@Override\\n\\tpublic void loadData() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a3bf2408f0fad0be77eaf34e9a3ea7d4\",\n \"score\": \"0.6615996\",\n \"text\": \"@Override\\r\\n\\tprotected void load() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a3bf2408f0fad0be77eaf34e9a3ea7d4\",\n \"score\": \"0.6615996\",\n \"text\": \"@Override\\r\\n\\tprotected void load() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"10e27a5babfb08ae0d2e113ef91cd8b4\",\n \"score\": \"0.6611474\",\n \"text\": \"@Override\\n\\tprotected void handleLoad() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"53ce4250180e7068b7dd58d43439dc4b\",\n \"score\": \"0.65792483\",\n \"text\": \"public void afterLoad(){}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d0f9b5b3f5e6e9d852d8ae47b488889b\",\n \"score\": \"0.65579253\",\n \"text\": \"@Override protected void onStartLoading() {\\r\\n\\t\\tif (mCharts != null) {\\r\\n\\t\\t\\t// If we currently have a result available, deliver it\\r\\n\\t\\t\\t// immediately.\\r\\n\\t\\t\\tdeliverResult(mCharts);\\r\\n\\t\\t}\\r\\n\\t\\tif (mCharts == null) forceLoad();\\r\\n\\r\\n\\t\\t//\\t\\tif (takeContentChanged() || mCharts == null || configChange) {\\r\\n\\t\\t//\\t\\t\\t// If the data has changed since the last time it was loaded\\r\\n\\t\\t//\\t\\t\\t// or is not currently available, start a load.\\r\\n\\t\\t//\\t\\t\\tforceLoad();\\r\\n\\t\\t//\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"872fc8d8da5cea016a46ea9221fff77b\",\n \"score\": \"0.6525454\",\n \"text\": \"private void initialLoad() {\\n callGenreApi();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"634ed80efa6e395bea70ea611da0756f\",\n \"score\": \"0.6513353\",\n \"text\": \"@Override\\n public void load()\\n {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2a85249732e610633df1c0e5fc34090f\",\n \"score\": \"0.6512311\",\n \"text\": \"public void onStartLoading() {\\n this.f7647a.onStartLoading();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4983395b96c567c017f68bf3558e410d\",\n \"score\": \"0.6503752\",\n \"text\": \"@Override\\r\\n\\tprotected void load() {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"22621d0bf026a50df5b3fb41e9e7460a\",\n \"score\": \"0.64969736\",\n \"text\": \"void initBeforeSave();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"97b6907c48a93f1201477b27f7893565\",\n \"score\": \"0.6463653\",\n \"text\": \"@Override\\n public void load() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7ffcd5faf832a9ef146925855e6f502c\",\n \"score\": \"0.6446289\",\n \"text\": \"@Override\\r\\n\\tprotected boolean afterLoad() {\\n\\t\\treturn false;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bbd298c4cd06a22f30cf9f1a183409ba\",\n \"score\": \"0.64384925\",\n \"text\": \"@Override\\n\\tpublic void preInit(FMLPreInitializationEvent event) {\\n\\t\\tsuper.preInit(event);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2859466f75125fe59b18908c02dff8b8\",\n \"score\": \"0.64369506\",\n \"text\": \"@Override // androidx.loader.content.Loader\\n public void onForceLoad() {\\n loadInternal();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"90b84c76e45e6b963b820565db35ac3b\",\n \"score\": \"0.6433992\",\n \"text\": \"@Override\\n public void loadData() {\\n return;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"62933e441e25a4601ebfdbfc906b086a\",\n \"score\": \"0.64267516\",\n \"text\": \"@Override\\r\\n\\tprotected void doLoadDefault()\\r\\n\\t{\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3a6a09956001e014e09431c34e45e22f\",\n \"score\": \"0.6424256\",\n \"text\": \"void onLoad();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3a6a09956001e014e09431c34e45e22f\",\n \"score\": \"0.6424256\",\n \"text\": \"void onLoad();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"acbd7a06823f98a95121f2b14ff8db35\",\n \"score\": \"0.64238036\",\n \"text\": \"@Override\\r\\n\\tprotected void lazyLoad() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"815d86ed0a0db236e9f6f32972e96488\",\n \"score\": \"0.6419053\",\n \"text\": \"@Override\\n\\tprotected void load() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c373014c84f3da7b9eb0c646cb8d2fb2\",\n \"score\": \"0.6387852\",\n \"text\": \"@Override\\n\\tpublic void load() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e51b051d74deac2a0c7e6018de127bb9\",\n \"score\": \"0.6364275\",\n \"text\": \"public void loadData()\\n {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a6e0298714a0a023baf840905792dbba\",\n \"score\": \"0.63567233\",\n \"text\": \"@Override\\n\\tprotected void doLoadDefault() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"87372cb51f270735dc6bc473b707e359\",\n \"score\": \"0.63324964\",\n \"text\": \"void onAfterLoad();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"60088acacd49490cfb94a4cdd7d0874e\",\n \"score\": \"0.6326815\",\n \"text\": \"@Override\\n public void onLoadComplete() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c3178cb5cefd89d38838c8899a0f4ccd\",\n \"score\": \"0.6318811\",\n \"text\": \"private synchronized void fireDataLoadInit() {\\n\\t\\tIterator<DataLoadListener> i = _listeners.iterator();\\n\\t\\twhile (i.hasNext()) {\\n\\t\\t\\t((DataLoadListener) i.next()).dataLoadInit();\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d5f75e4a40a73e49db18c88d7f616d25\",\n \"score\": \"0.6298755\",\n \"text\": \"@Override\\nprotected void load() {\\n\\t\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"604f74e3111e3545c01e6ae876daaca6\",\n \"score\": \"0.62821734\",\n \"text\": \"protected boolean needPreLoad() {\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"615e32fe128f566f5f5e3d39d584924b\",\n \"score\": \"0.62814325\",\n \"text\": \"@Override\\n\\t\\t\\tpublic void loading() {\\n\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fbbce6cc19f7bb9f744f32c0d2e0dc6f\",\n \"score\": \"0.6268857\",\n \"text\": \"@Override\\r\\n public void beforeLoad() {\\n for (ContentDependency dependency : dependencies) {\\r\\n dependency.getSourceContent().load(false);\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3186002c68b2a42246817e3ef2a9e404\",\n \"score\": \"0.6255879\",\n \"text\": \"public void onLoaded() {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6f72a08eb3386202717a94c29201b222\",\n \"score\": \"0.62456256\",\n \"text\": \"@Override\\n\\tprotected void lazyLoad() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e442f3cfdc81b9e764ea2621bd81d161\",\n \"score\": \"0.62262577\",\n \"text\": \"public void loadMetaData(){\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b32505fb0363b6cc751fd6bcf382093e\",\n \"score\": \"0.6203805\",\n \"text\": \"@EventHandler\\n public void preInit(FMLPreInitializationEvent e) \\n {\\n \\tthis.proxy.preInit(e);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e2d1614c9c9b6d78b385c01644a7fdc3\",\n \"score\": \"0.6193327\",\n \"text\": \"protected void load() {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"64f2e508f1645cfe00372697e8565a7c\",\n \"score\": \"0.6146525\",\n \"text\": \"@Override\\n\\t\\t\\tpublic void onLoad() {\\n\\t\\t\\t\\tpage++;\\n\\t\\t\\t\\tLogUtil.d(\\\"setOnLoadListener\\\" + page);\\n\\t\\t\\t\\tif (page <= countPage) {// 如果加载的页数小于或等于总页数，则加载\\n\\t\\t\\t\\t\\tloadData();\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tlv_scroll.loadCompleted();\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"de203cc9507bcace44f871488b4784c3\",\n \"score\": \"0.61293817\",\n \"text\": \"@PostConstruct\\n public void load() {\\n LifecycleCounter.getInstance().incrementLoad();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d4f3693686e37d7f4fc756a59687003b\",\n \"score\": \"0.61236364\",\n \"text\": \"private void preLoad() {\\n getContext().setState(\\\"Preload\\\");\\n if (preloader != null) {\\n preloader.open(getContext());\\n if (getContext().isInError()) {\\n reportTransformContextError(getContext());\\n } else {\\n while (getContext().isNotInError() && !preloader.eof()) {\\n TransactionContext txnContext = new TransactionContext(getContext());\\n DataFrame frame = preloader.read(txnContext);\\n preloadListeners(frame);\\n preloadTransformers(frame);\\n }\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f2f196a0dab854f06c1467f9564a3136\",\n \"score\": \"0.6106748\",\n \"text\": \"@Override\\n\\tpublic void onLoadComplete() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"791401ed5618fd4cd6eb121d7296f6df\",\n \"score\": \"0.6100559\",\n \"text\": \"@Override\\n\\tpublic void loading() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b14cffacd51e1ce2462cbb7320ae9815\",\n \"score\": \"0.60810995\",\n \"text\": \"@Override\\n\\tprotected void preInilize() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9e93b5a50dff0799bd539d43cb7b8047\",\n \"score\": \"0.6075557\",\n \"text\": \"public void onPreInitialization(@Nonnull FMLPreInitializationEvent event) {\\n this.registerEntitySerializers();\\n\\n // forcefully initialize registry early on\\n ModularExplosive.getRegistry();\\n\\n ForgeChunkManager.setForcedChunkLoadingCallback(ICBMModification.getInstance(), (tickets, world) -> {\\n });\\n NetworkRegistry.INSTANCE.registerGuiHandler(ICBMModification.getInstance(), new ICBMGuiHandler());\\n\\n this.registerNetworkMessages();\\n this.registerModularExplosives();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ce99a23d9b6c581c1acea6e15a7a2065\",\n \"score\": \"0.6072017\",\n \"text\": \"@Override\\n\\tpublic void onLoadComplete() {\\n\\t\\t\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e5cab5f0c7b2c21c2b2ee6ceb0660cb1\",\n \"score\": \"0.6068176\",\n \"text\": \"public LoadDataEventBean() {\\n super(EventType.LOADED);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e78e843182437e12f2845279dcada034\",\n \"score\": \"0.6066705\",\n \"text\": \"private void load() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c7c6186a5b09f463dcafd345b77b442f\",\n \"score\": \"0.6060624\",\n \"text\": \"public void load() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a003118a5c8e85de6e59dd84ed094f3e\",\n \"score\": \"0.6051148\",\n \"text\": \"public static void preInit() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"59015548132f9ba943cac7bd044b7e4a\",\n \"score\": \"0.6045231\",\n \"text\": \"@Override\\nprotected void isLoaded() throws Error {\\n\\t\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f69fc04626bc43eb04b1b4af7aca12fd\",\n \"score\": \"0.6040998\",\n \"text\": \"public abstract void onLoad(Princess princess);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3505f600b3d6c9dce91813d9a3b9c5d4\",\n \"score\": \"0.6040362\",\n \"text\": \"@Override\\n\\tpublic void onLoadComplete() {\\n\\t\\t// TODO Auto-generated method stub\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ca85864bc37448862267a840a558c4a5\",\n \"score\": \"0.60401976\",\n \"text\": \"@Override\\n\\tprotected void onStartLoading() {\\n\\t\\t\\n\\t\\tif (DEBUG) {\\n\\t\\t\\tLog.i(TAG, \\\"== onStartLoading() ==\\\");\\n\\t\\t}\\n\\t\\t\\n\\t\\tif (mAccounts != null) {\\n\\t\\t\\t// Deliver the previously loaded data immediately.\\n\\t\\t\\tdeliverResult(mAccounts);\\n\\t\\t}\\n\\t\\t\\n\\t\\tif (!mIsObserving) {\\n\\t\\t\\tmIsObserving = true;\\n\\t\\t}\\n\\t\\t\\n\\t\\t// This method is used to notify if a change has happen.\\n\\t\\tif (takeContentChanged()) {\\n\\t\\t\\t// When our Observer detects a event it will call to\\n\\t\\t\\t// onContentChanged on this instance, this will cause that\\n\\t\\t\\t// the next call to takeContentChanged() return true.\\n\\t\\t\\t// In this case or if the current data is null we force a new \\n\\t\\t\\t// load.\\n\\t\\t\\tif (DEBUG) {\\n\\t\\t\\t\\tLog.i(TAG, \\\"== A new change has been submit, starting force load... ==\\\");\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t// This method actually loads the data.\\n\\t\\t\\tforceLoad();\\n\\t\\t} else if (mAccounts == null) {\\n\\t\\t\\t\\n\\t\\t\\tif (DEBUG) {\\n\\t\\t\\t\\tLog.i(TAG, \\\"== No accounts found, starting force load. ==\\\");\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t// This method actually loads the data.\\n\\t\\t\\tforceLoad();\\n\\t\\t\\t\\n\\t\\t}\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3b78da438a1fc9c6498611bda4ec23f1\",\n \"score\": \"0.6035284\",\n \"text\": \"public void initialize() {\\r\\n // Initialization is done by getPageBean()\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c788770bc9c988dab481a77d79cd787b\",\n \"score\": \"0.6033304\",\n \"text\": \"@Override\\n\\tpublic void onLoaded(CoronaRuntime runtime) {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a8e95520ebe0d6a6d183e37bdbced08\",\n \"score\": \"0.6016831\",\n \"text\": \"@Mod.EventHandler\\n public void preInit(FMLPreInitializationEvent e) {\\n setup.preInit(e);\\n proxy.preInit(e);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ddce4d926c7b35357f33dc2e27ac92ff\",\n \"score\": \"0.6010866\",\n \"text\": \"@EventHandler\\n public void PreInit(FMLPreInitializationEvent event) {\\n event.getModMetadata().version = Refs.fullVersionString();\\n \\n Logger log = event.getModLog();\\n Configuration config = new Configuration(event.getSuggestedConfigurationFile());\\n \\n CustomTabs.init();\\n // Load configs\\n config.load();\\n Config.setUp(config);\\n config.save();\\n \\n Blocks.init();\\n Items.init();\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3f8d1863338d3ce8d87a9be07c8aada6\",\n \"score\": \"0.6006518\",\n \"text\": \"void onBeforeReload();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4967494f628119c8d3a4740e09278944\",\n \"score\": \"0.5993729\",\n \"text\": \"@Override\\r\\n\\tprotected void initData() {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"73d58b66d1669ad751adc5f175e7d158\",\n \"score\": \"0.5990463\",\n \"text\": \"protected abstract void load();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"84f2a655b31a614f58594f01d44f4297\",\n \"score\": \"0.5985926\",\n \"text\": \"public void setOnDataLoad(\\n final Code aOnDataLoad) {\\n onDataLoad = aOnDataLoad;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"078446009d4696f74faa4277745d0849\",\n \"score\": \"0.5982807\",\n \"text\": \"public void lazyLoad(){\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5ad7a60a3c62d0920dff76300c36f2cc\",\n \"score\": \"0.5980953\",\n \"text\": \"public void onResume() {\\n m_needsLoad = true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8867fa03d450b77702abba3be39b11ec\",\n \"score\": \"0.59795\",\n \"text\": \"protected void entityInit(){}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"df953788917e046cda89584624345d1a\",\n \"score\": \"0.5971083\",\n \"text\": \"@Override\\n protected void onStartLoading() {\\n if (cursor != null) {\\n deliverResult(cursor);\\n }\\n\\n if (takeContentChanged() || cursor == null) {\\n forceLoad();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5aa237d31e744d1e0729621e464fcfb2\",\n \"score\": \"0.59699595\",\n \"text\": \"@Override\\r\\n\\tprotected void DataInit() {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a3ad215414abf7786b89536e8f8bc7eb\",\n \"score\": \"0.5959049\",\n \"text\": \"@Mod.EventHandler\\n public void preInit(FMLPreInitializationEvent event) {\\n eventProcessor = new EventProcessor();\\n LOGGER.info(\\\"Initialized EventProcessor!\\\");\\n\\n mixinLoader = new MixinLoader();\\n LOGGER.info(\\\"Initialized MixinLoader!\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c73e0a816e960481a1bd62f7e231e73c\",\n \"score\": \"0.5955706\",\n \"text\": \"@Override\\n\\tprotected void doAfterInit() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0be90aa98da32ae1e2a72a98bcf2d08d\",\n \"score\": \"0.5949414\",\n \"text\": \"@Override\\n public void onFirstInit() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c9dc40aef4e79ffe61c429b0d0d04088\",\n \"score\": \"0.5947239\",\n \"text\": \"public void load() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c9dc40aef4e79ffe61c429b0d0d04088\",\n \"score\": \"0.5947239\",\n \"text\": \"public void load() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4fd7a4c4cde3ed621cc552fadc0b3917\",\n \"score\": \"0.59460515\",\n \"text\": \"@Override\\r\\n\\tpublic void preProcess(IObservationContext context)\\r\\n\\t\\t\\tthrows ThinklabException {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e60da201d12a992da4a8a615e7b458d6\",\n \"score\": \"0.5946051\",\n \"text\": \"public void preInit() {\\n initBlocks();\\n initItems();\\n initRecipes();\\n// initArmorMaterials();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a7282ea655f52efcecd17595816536d2\",\n \"score\": \"0.5941618\",\n \"text\": \"@Override\\n protected void onStartLoading() {\\n if (mBundle == null) {\\n return;\\n }\\n\\n // If mMovieList is not empty, deliver that result. Otherwise, force a load\\n if(!mMovieList.isEmpty()) {\\n deliverResult(mMovieList);\\n } else {\\n forceLoad();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"47c412f9a0ad1539c9178a06e8b52aeb\",\n \"score\": \"0.5938091\",\n \"text\": \"@Override\\n public void init() {\\n LoadTree loadTree = new LoadTree();\\n this.tree1Model1.setModel(new DefaultTreeModel(loadTree.populateNodes()));\\n // Perform initializations inherited from our superclass\\n super.init();\\n // Perform application initialization that must complete\\n // *before* managed components are initialized\\n // TODO - add your own initialiation code here\\n\\n // <editor-fold defaultstate=\\\"collapsed\\\" desc=\\\"Managed Component Initialization\\\">\\n // Initialize automatically managed components\\n // *Note* - this logic should NOT be modified\\n try {\\n _init();\\n } catch (Exception e) {\\n log(\\\"Templete Initialization Failure\\\", e);\\n throw e instanceof FacesException ? (FacesException) e : new FacesException(e);\\n }\\n\\n // </editor-fold>\\n // Perform application initialization that must complete\\n // *after* managed components are initialized\\n // TODO - add your own initialization code here\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"49eccf06fd203e43c450771d732a86e3\",\n \"score\": \"0.59289974\",\n \"text\": \"@Override\\r\\n\\tprotected void isLoaded() throws Error {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"49eccf06fd203e43c450771d732a86e3\",\n \"score\": \"0.59289974\",\n \"text\": \"@Override\\r\\n\\tprotected void isLoaded() throws Error {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"674cc3c7df1da8d156f73a1a28ae6f59\",\n \"score\": \"0.59165055\",\n \"text\": \"@Override\\n\\tpublic void InitData() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fc9c8f152657e70972770e36fbe5c548\",\n \"score\": \"0.59151417\",\n \"text\": \"@Override public void onActivityCreated(@Nullable Bundle savedInstanceState) {\\n super.onActivityCreated(savedInstanceState);\\n\\n initializeViewModel();\\n\\n initializeData();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6582e3645915fb76db0a5b38eb0803af\",\n \"score\": \"0.59127724\",\n \"text\": \"@Override\\n public long startLoad() {\\n return 0L;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"02b601a5aeb9c944c00812037972d4e5\",\n \"score\": \"0.59107804\",\n \"text\": \"@Override\\n\\tprotected void onStart() {\\n\\t\\tsuper.onStart();\\n\\t\\tloadDataFromCloud(); //从云端把本地没有的数据取来\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c0c73bcdc51a97fe8c2cf0a395a6e103\",\n \"score\": \"0.59059757\",\n \"text\": \"@Override\\n public void initialize() {\\n MetadataDictionary.initialize();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"89b8fea49d40064aceffc616029dd64b\",\n \"score\": \"0.59053576\",\n \"text\": \"@PreInit\\n\\tpublic void preInit(FMLPreInitializationEvent event) {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d4249e09b1b5001237b084e02356ed0c\",\n \"score\": \"0.5904173\",\n \"text\": \"@Override\\r\\n\\tpublic void afterInit() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e492a2956adc8beeced63358eac7b946\",\n \"score\": \"0.5903973\",\n \"text\": \"@MainThread\\n public <Key> void triggerInitialLoad(final Key initialLoadKey) {\\n if (mInitialized) {\\n return;\\n }\\n mInitialized = true;\\n mBackgroundThreadExecutor.execute(new Runnable() {\\n @Override\\n public void run() {\\n if (mInvalid.get()) {\\n return;\\n }\\n\\n final List<Type> initialData =\\n mDataSource.loadAfterInitial(initialLoadKey, mConfig.mPageSize);\\n if (initialData != null) {\\n mMainThreadExecutor.execute(new Runnable() {\\n @Override\\n public void run() {\\n if (mInvalid.get()) {\\n return;\\n }\\n setInitialDataAndDispatch(initialData);\\n }\\n });\\n } else {\\n freeze();\\n }\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"317f4a52940ba9413ae3b92c48102cc5\",\n \"score\": \"0.58741677\",\n \"text\": \"void onLoadedDataFromDatabase();\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":983197,"cells":{"query_id":{"kind":"string","value":"73949628b6941364cba653f4b3f37d0c"},"query":{"kind":"string","value":"Calculates how \"far along\" a link some point is. This is expressed as a portion of the total link length. So, for example, a point right at the link's begin_node will have an offset_ratio of 0, a point in the middle will have an offset_ratio of .5, and a point at the end_node will have an offset_ratio of .5;"},"positive_passages":{"kind":"list like","value":[{"docid":"1d6bd3568687f67b470a309c3f62d9a4","score":"0.6891088","text":"public double offset_ratio(Point coords){\n\t\t//Project onto this link\n\t\tPoint proj = project(coords);\n\t\t//Determine total length of this link\n\t\tdouble totalDist = this.haversine();\n\t\t//Determine distance from begin_node to projected point\n\t\tdouble pointDist = Direction.haversine(geom.getPoint(0).x, geom.getPoint(0).y, proj.x, proj.y);\n\t\t//Express as ratio\n\t\treturn pointDist / totalDist;\n\t}","title":""}],"string":"[\n {\n \"docid\": \"1d6bd3568687f67b470a309c3f62d9a4\",\n \"score\": \"0.6891088\",\n \"text\": \"public double offset_ratio(Point coords){\\n\\t\\t//Project onto this link\\n\\t\\tPoint proj = project(coords);\\n\\t\\t//Determine total length of this link\\n\\t\\tdouble totalDist = this.haversine();\\n\\t\\t//Determine distance from begin_node to projected point\\n\\t\\tdouble pointDist = Direction.haversine(geom.getPoint(0).x, geom.getPoint(0).y, proj.x, proj.y);\\n\\t\\t//Express as ratio\\n\\t\\treturn pointDist / totalDist;\\n\\t}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"72b3a331bf01d117d44287ac72d3fcfc","score":"0.59087294","text":"protected abstract Vec3 getConnectorAnchorOffset();","title":""},{"docid":"76c0df81b1166008c0c4a1bdcfb083a0","score":"0.5481852","text":"private Pair<Link, Double> getLinkCellOffset(List<Link> links, double totalOffset, double totalLength) {\n\t\t// assume all cells the same length\n\t\tint index = Math.max(Math.min(links.size() - 1,\n\t\t\t\t(int)(links.size() * totalOffset / totalLength)), 0);\n\t\tdouble cellSize = totalLength / links.size();\n\t\t\n\t\tdouble offset = totalOffset - index * cellSize;\n\t\tLink link = links.get(index);\n\t\t\n\t\t// Monitor.out(totalOffset + \" / \" + totalLength + \" -> \" + index + \" / \" + links.size() + \" + \" + offset);\n\t\t\n\t\treturn Pair.of(link, offset);\t\t\n\t}","title":""},{"docid":"6f44baedd1c83ea40b2c66a954fa7010","score":"0.54413843","text":"public int getDistanceToEndPoint(){\n return (END - x) + (END - y) + (END - z);\n }","title":""},{"docid":"9dbee79b74b97a06b92d6ed97b094ebc","score":"0.5423982","text":"public float heuristique(Node<?> node) {\r\n\t\tif ((node.origin instanceof Dot) && (this.origin instanceof Dot)) {\r\n\t\t\treturn getDistanceFrom((Dot) node.origin, (Dot) this.origin);\r\n\t\t}\r\n\t\treturn 0;\r\n\t}","title":""},{"docid":"4712edaefac86258ed2b04a786b3d3ac","score":"0.5402257","text":"private void calculateDistance(Node node) {\r\n\t\tfloat abstractness = node.getAbstractness();\r\n\t\tfloat instability = node.getInstability();\r\n\t\tfloat distance = Math.abs(abstractness + instability - 1);\r\n\t\tnode.setDistanceFromMainSequence(distance);\r\n\t}","title":""},{"docid":"42d0f2736bb44b22210d1844e8dd83f6","score":"0.538151","text":"byte getViewDistance();","title":""},{"docid":"67c362c46d458e26d261cda3d7886ab3","score":"0.53381777","text":"public float physicalDistanceTo(SomNode node) {\n int xLeg, yLeg;\n\n xLeg = xPos - node.getXPos();\n xLeg *= xLeg;\n yLeg = yPos - node.getYPos();\n yLeg *= yLeg;\n\n return xLeg + yLeg;\n }","title":""},{"docid":"c21f8adacca022a102e172d34ee6e271","score":"0.5307882","text":"private double directDistToTarget() {\n\t\tdouble dist = 0;\n\t\t// Use pythagorean theorem to calculate distance between curPos and targetPos:\n\t\tdist = Math.sqrt(Math.pow((targetPos.getUTMEasting() - curPos.getUTMEasting()), 2) + \n\t\t\t\tMath.pow((targetPos.getUTMNorthing() - curPos.getUTMNorthing()), 2));\n\t\treturn dist;\n\t}","title":""},{"docid":"9c4844cec362c09148fc5762e2a40c76","score":"0.5294173","text":"@Override\n public double calculate(Point n1, Point n2) {\n double dx = Math.abs(n1.getX() - n2.getX());\n double dy = Math.abs(n1.getY() - n2.getY());\n return (dx + dy) + (Maths.DIAGONAL_LENGTH - 2) * Math.min(dx, dy);\n }","title":""},{"docid":"4b2c48fe2c2f6b83ae0897a900af7f89","score":"0.52872723","text":"private double relativeLength(TransientEdge edge) {\n\t\tDisk d1 = edge.getVertex1().getDisk();\n\t\tDisk d2 = edge.getVertex2().getDisk();\n\t\tdouble x1 = d1.getX();\n\t\tdouble y1 = d1.getY();\n\t\tdouble r1 = d1.getRadius();\n\t\tdouble x2 = d2.getX();\n\t\tdouble y2 = d2.getY();\n\t\tdouble r2 = d2.getRadius();\n\t\treturn distanceFactor(x1, y1, r1, x2, y2, r2);\n\t}","title":""},{"docid":"fed1a86be11949904d52e9b0248c5a48","score":"0.5258929","text":"private int estimatedDistance (AstarPosition position) {\n // erst Schritte auf der x Achse machen \n // dann Schritte auf der y Achse machen\n int destX = destinationAsNode.getPosition().getX();\n int destY = destinationAsNode.getPosition().getY();\n int nodeX = position.getX();\n int nodeY = position.getY();\n int needX = 0;\n int needY = 0;\n \n if (destX < nodeX) {\n needX = nodeX - destX;\n } else if (destX > nodeX) {\n needX = destX - nodeX;\n }\n \n if (destY < nodeY) {\n needY = nodeY - destY;\n } else if (destY > nodeY) {\n needY = destY - nodeY;\n }\n \n needX = needX * 10;\n needY = needY * 10;\n \n return needX + needY;\n }","title":""},{"docid":"a9e9b2cb2295d82d23d89e903fecceca","score":"0.5203504","text":"float getOffset();","title":""},{"docid":"d241e239e51a847324fb4743205ca87c","score":"0.51605856","text":"public float getDistance() throws IOException\n\t{\n\t\tif ((__io__pointersize == 8)) {\n\t\t\treturn __io__block.readFloat(__io__address + 256);\n\t\t} else {\n\t\t\treturn __io__block.readFloat(__io__address + 244);\n\t\t}\n\t}","title":""},{"docid":"75b0253fd1a2098645cb3d8642786008","score":"0.51594514","text":"public double lengthEdge(Point a, Point b) {\n return Math.sqrt((b.getX() - a.getX()) * (b.getX() - a.getX()) + (b.getY() - a.getY()) * (b.getY() - a.getY()));\n }","title":""},{"docid":"9728fe687edd0afc0c533f114c994af6","score":"0.51562256","text":"public Point computeAnchorLocation(Point first, Point next) {\r\n final Rectangle bounds = getBounds();\r\n return new Point(bounds.x + bounds.width / 2, bounds.y + bounds.height / 2);\r\n }","title":""},{"docid":"6fde8c364c44b022b5699ad1a17e729d","score":"0.51543","text":"private double pathDistToTarget() {\n\t\tdouble dist = 0;\n\t\tdist = Math.sqrt(Math.pow(directDistToTarget(), 2) - Math.pow(latError, 2));\n\t\t//System.out.print(\"Distance to target along path: \");\n\t\t//System.out.println(dist);\n\t\treturn dist;\n\t}","title":""},{"docid":"ec411b00fdebe481c60da5b6ecf91144","score":"0.51182455","text":"private double getDist() {\n unZoom(); // so zoom won't affect results\n ledsOn(); // so we can see\n\n if (this.targetsInView()) {\n // taken from limelight docs (equation is d = (h2-h1) / tan(a1+a2))\n return 70.25 / Math.tan(10 + table.getEntry(\"ty\").getDouble(0)); \n } else {\n return -1;\n }\n \n /**\n * the 70.25 is height of center of the circle (in the hexagon frame) in inches minus how high lens is off the groun (20 inches) (h2 - h1)\n * 10 is angle limelight lens is at (a1)\n * ty.getDouble gives the y value of the target from LL's perspective\n * -1 is a default value to return, being unsuccesful\n */ \n }","title":""},{"docid":"0c18b3ef2a408c19d19ba99a4751bada","score":"0.5108899","text":"int equivalentDirection(Direction anchor) {\n switch (anchor) {\n case TOP:\n return 2;\n case BOTTOM:\n return 3;\n case RIGHT:\n return 1;\n case LEFT:\n return 0;\n case BASELINE:\n return 0;\n }\n return 0;\n }","title":""},{"docid":"c3388200c9065cbe5ddafa57b02b913c","score":"0.5025685","text":"private static int findStraightLineDistance(int[] from, int[] goal) {\n\t\tint xsquare =(from[0] - goal[0]) * (from[0] - goal[0]) * 100;\n\t\tint ysquare = (from[1] - goal[1]) * (from[1] - goal[1]) * 100;\n\t\treturn (int) Math.sqrt( xsquare + ysquare );\n\t\t\n\t}","title":""},{"docid":"3b5b9a5069c9199a6d179fbd9c9b5e8f","score":"0.50192094","text":"public abstract double distanceAlongGeometry();","title":""},{"docid":"718470f560703b0574c5c179d7205c71","score":"0.5003657","text":"public double getDistance ();","title":""},{"docid":"074f4e7f70e985e4b2a85bc3336bc80a","score":"0.5002475","text":"private static float getLinkDensity(Element e){\n\t\tElements allA = e.getElementsByTag(\"a\");\n\t\tint textLength = e.text().length();\n\t\tint linkLength = 0;\n\t\tfor(Element a : allA){\n\t\t\tlinkLength += a.text().length();\n\t\t}\n\t\treturn linkLength/textLength;\n\t}","title":""},{"docid":"b7d661969122b2d8a458c93d2d3b2ecb","score":"0.49492168","text":"private double computeLateralErr() {\n\t\t// See \"Line defined by two points\" at \n\t\t// https://en.wikipedia.org/wiki/Distance_from_a_point_to_a_line\n\t\t// From the wikipedia equation:\n\t\t// P1 => prevPos\n\t\t// P2 => curPos\n\t\t// (x0, y0) => targetPos\n\t\t\n\t\t// P1:\n\t\t// Generate an arbitrary point to define the line (far enough away to avoid rounding errors)\n\t\tdouble x1 = curPos.getUTMEasting() + Math.cos(curPos.getMathAngle() / 180 * Math.PI) * 1000;\n\t\tdouble y1 = curPos.getUTMNorthing() + Math.sin(curPos.getMathAngle() / 180 * Math.PI) * 1000;\n\t\t\n\t\t// P2:\n\t\tdouble x2 = curPos.getUTMEasting();\n\t\tdouble y2 = curPos.getUTMNorthing();\n\t\t\n\t\t// Target\n\t\tdouble x0 = targetPos.getUTMEasting();\n\t\tdouble y0 = targetPos.getUTMNorthing();\n\t\t\n\t\t// Calculate numerator in equation: (it's a big equation...)\n\t\tdouble num = (y2 - y1) * x0;\n\t\tnum -= (x2 - x1) * y0;\n\t\tnum += x2 * y1;\n\t\tnum -= y2 * x1;\n\t\tnum = Math.abs(num);\n\t\t\n\t\t// Calculate denominator in equation:\n\t\tdouble denom = Math.pow(y2 - y1, 2.0);\n\t\tdenom += Math.pow(x2 - x1, 2.0);\n\t\tdenom = Math.sqrt(denom);\n\t\t\n\t\treturn num / denom;\n\t}","title":""},{"docid":"dcb4deed1cfd7e7d2181bb8ca13b7791","score":"0.4941889","text":"double getTotalDistance();","title":""},{"docid":"54c161ec02b26a4dcefffb7984255f9f","score":"0.4933007","text":"private static float calcDistance(float x1, float y1, float x2, float y2){\n float d = ((float) Math.sqrt((float) Math.pow((x2 - x1), 2) + (float) Math.pow((y2 - y1), 2)));\n\n return d;\n }","title":""},{"docid":"36f3fc0fb31cf22c8c8a84acebcc54c5","score":"0.49329507","text":"int getDistance(Port from, Port to);","title":""},{"docid":"41b127d8060d2572c01c7196fc559b0b","score":"0.4931462","text":"public abstract float getDistance(E source, E dest);","title":""},{"docid":"c8e4075f043e548f14d6a3d66703dbe8","score":"0.49212417","text":"public static float getDistance(float x1, float y1, float x2, float y2) { return (float) Math.sqrt(Math.pow(x1 - x2, 2) + Math.pow(y1 - y2, 2)); }","title":""},{"docid":"1c1f9391bfbe0b2d451d033e17fbdc90","score":"0.4914366","text":"public int getViewDistance();","title":""},{"docid":"105d75cc06fd6fbbc190fe1fc280220f","score":"0.49121657","text":"double getOffset();","title":""},{"docid":"105d75cc06fd6fbbc190fe1fc280220f","score":"0.49121657","text":"double getOffset();","title":""},{"docid":"bed655f78f70627013efa8701cba37da","score":"0.4893971","text":"public float getDistFromBase() { return (float) 0;}","title":""},{"docid":"f5e169998797cf258c191cccc07d46a0","score":"0.48927784","text":"public double getDistance();","title":""},{"docid":"80bad9e58e0207fb71912472f098ff75","score":"0.48891622","text":"@objid (\"7f58791a-1dec-11e2-8cad-001ec947c8cc\")\n public Dimension getOffset() {\n return this.anchorOffset;\n }","title":""},{"docid":"4cc9163dc3af5b41b8fcb55965c334a9","score":"0.48869509","text":"public abstract int following(int offset);","title":""},{"docid":"eb692dc97e43d0c5e65bd29fe9d4c2d3","score":"0.4870801","text":"private static float lonDiff(float a1, float a2) {\n float d = a1 - a2;\n if (d < 0.0f) {\n d = -d;\n }\n if (d > 180.0f) {\n d = 360.0f - d;\n }\n return d;\n }","title":""},{"docid":"289991e2ccf487a6c70e83f616f653f9","score":"0.4863593","text":"double getDistance();","title":""},{"docid":"0e8244f855f7b41d1c624127c4d4453e","score":"0.48631334","text":"public float measureStraight(GraphNode head, GraphNode tail)\n {\n \tdouble dis = 0.0f;\n \t// d2 = x2 + y2 + z2\n \t\n \tdis = Math.sqrt(Math.pow((head.col - tail.col)*_colDis, 2.0) + \n \t\t\tMath.pow((head.row - tail.row)*_rowDis, 2.0) + \n \t\t\tMath.pow((head.z - tail.z)*_zDis, 2.0) );\n\t\t\n \t\n \treturn (float)dis;\n }","title":""},{"docid":"42e6c91bbd2c8872eaf89d348f8640f0","score":"0.48516867","text":"byte getRenderDistance();","title":""},{"docid":"abd62f2600231c4c69983657adb88d6d","score":"0.48468003","text":"public static double distance(Point a, Point b)\r\n/* 20: */ {\r\n/* 21: 15 */ return a.getDistanceTo(b);\r\n/* 22: */ }","title":""},{"docid":"4e7f951c181ee04a60a8b2b39c15c4d2","score":"0.48436815","text":"public void offsetForLink(){\n\t\tbyteOffset += (sizeOfDataRec - 2);\n\t}","title":""},{"docid":"ac4a3a4e8233261999bb9e0bd68c9337","score":"0.48331478","text":"public double getDistanceToTravel() {\n double distance = Math.sqrt(Math.pow(targetY - y, 2) \n + Math.pow(targetX - x, 2));\n return distance;\n }","title":""},{"docid":"da0ffdc61c6ecd8009db4fd684b38990","score":"0.4832171","text":"public static double belowAboveGlidePath(double lat1, double lon1, double lat2, double lon2, double el1, double el2, double SlopeAngle)\n\t{\n\t\t// WGS-84 ellipsoid\n\t\tdouble a = 6378137;\n\t\tdouble b = 6356752.314245;\n\t\tdouble f = 1/298.257223563;\n\t\tdouble L = Math.toRadians(lon2-lon1);\n\t\tdouble U1 = Math.atan((1-f) * Math.tan(Math.toRadians(lat1)));\n\t\tdouble U2 = Math.atan((1-f) * Math.tan(Math.toRadians(lat2)));\n\t\tdouble sinU1 = Math.sin(U1);\n\t\tdouble cosU1 = Math.cos(U1);\n\t\tdouble sinU2 = Math.sin(U2);\n\t\tdouble cosU2 = Math.cos(U2);\n\n\t\tdouble lambda = L, lambdaP, iterLimit = 100;\n\t\tdouble sigma, cosSqAlpha, sinSigma, cosSigma, cos2SigmaM;\n\n\t\tdo\n\t\t{\n\t\t\tdouble sinLambda = Math.sin(lambda);\n\t\t\tdouble cosLambda = Math.cos(lambda);\n\t\t\tsinSigma = Math.sqrt((cosU2*sinLambda) * (cosU2*sinLambda) + (cosU1*sinU2-sinU1*cosU2*cosLambda) * (cosU1*sinU2-sinU1*cosU2*cosLambda));\n\t\t\tif (sinSigma==0) return 0; // co-incident points\n\t\t\tcosSigma = sinU1*sinU2 + cosU1*cosU2*cosLambda;\n\t\t\tsigma = Math.atan2(sinSigma, cosSigma);\n\t\t\tdouble sinAlpha = cosU1 * cosU2 * sinLambda / sinSigma;\n\t\t\tcosSqAlpha = 1 - sinAlpha*sinAlpha;\n\t\t\ttry\n\t\t\t{\n\t\t\t\tcos2SigmaM = cosSigma - 2*sinU1*sinU2/cosSqAlpha;\n\t\t\t}\n\t\t\tcatch (ArithmeticException e)\n\t\t\t{\n\t\t\t\tcos2SigmaM = 0; // equatorial line: cosSqAlpha=0\n\t\t\t}\n\t\t\tdouble C = f/16*cosSqAlpha*(4+f*(4-3*cosSqAlpha));\n\t\t\tlambdaP = lambda;\n\t\t\tlambda = L + (1-C) * f * sinAlpha * (sigma + C*sinSigma*(cos2SigmaM+C*cosSigma*(-1+2*cos2SigmaM*cos2SigmaM)));\n\t\t}\n\t\twhile (Math.abs(lambda-lambdaP) > 1e-12 && --iterLimit>0);\n\n\t\tif (iterLimit==0) return -1; // formula failed to converge\n\n\t\tdouble uSq = cosSqAlpha * (a*a - b*b) / (b*b);\n\t\tdouble A = 1 + uSq/16384*(4096+uSq*(-768+uSq*(320-175*uSq)));\n\t\tdouble B = uSq/1024 * (256+uSq*(-128+uSq*(74-47*uSq)));\n\t\tdouble deltaSigma = B*sinSigma*(cos2SigmaM+B/4*(cosSigma*(-1+2*cos2SigmaM*cos2SigmaM)-B/6*cos2SigmaM*(-3+4*sinSigma*sinSigma)*(-3+4*cos2SigmaM*cos2SigmaM)));\n\t\tdouble distance = b*A*(sigma-deltaSigma);\n\t\tdouble neededElev = Math.tan(SlopeAngle)*distance + el2; // must be at this elevation\n\t\treturn el1-neededElev;\n\t}","title":""},{"docid":"06af49a9f0b4bb8c01fb7d95468aaef9","score":"0.48298624","text":"public double measureLength()\n {\n List<Bone> leaves = new ArrayList<Bone>();\n List<Bone> all = new ArrayList<Bone>();\n _skeleton.collectBones(all);\n for (Bone b : all) {\n if (b.getChildren().length == 0) {\n leaves.add(b);\n }\n }\n double dist = 0;\n Point3d p1 = new Point3d();\n Point3d p2 = new Point3d();\n for (Bone b1 : leaves) {\n for (Bone b2 : leaves) {\n if (!b1.equals(b2)) {\n b1.getWorldPosition(p1);\n b2.getWorldPosition(p2);\n dist = Math.max(p1.distance(p2), dist);\n }\n }\n }\n System.out.println(\"### LENGTH IS \" + dist);\n return dist;\n }","title":""},{"docid":"1ef31501cf66ceeb49078b5fd7a1ff7c","score":"0.4824411","text":"public double dist(RealPoint punto){\n \n \n double dx = this.x - punto.x; //podemos acceder a punto.x porque estamos dentro de la misma clase. !!!!\n double dy = this.y - punto.y;\n double distancia = Math.sqrt(dx*dx + dy*dy);\n \n return distancia;\n }","title":""},{"docid":"92d6a4b12336a5203a8342e5dceb86db","score":"0.4815148","text":"protected abstract int calcRenderOffset(int scale, int line);","title":""},{"docid":"7093c5ce22e832626a1d77cbfcf80f81","score":"0.48098248","text":"private double Estimated_Distance(double a2){\n double h1 = 6.0;\n double h2 = 36.0;\n double a1 = 0.0;\n return (h2-h1)/Math.tan(a1+a2);\n }","title":""},{"docid":"671b8bac0e9cfb946b409e951d7656d0","score":"0.48096925","text":"public double getDistance2D(float x, float y);","title":""},{"docid":"5c7eaa12e612bcc6f11927a621be612d","score":"0.48074985","text":"public static int labelDistance(){\n return 0; //TODO codavaj!!\n }","title":""},{"docid":"8a99485a0605958b6b49d822937c8487","score":"0.48053318","text":"private double calcLength(NodeObjects first, NodeObjects second) {\r\n\t\treturn Math.sqrt(Math.pow((first.getX() - second.getX()), 2) + Math.pow((first.getY() - second.getY()), 2));\r\n\t}","title":""},{"docid":"d984939acd238df6bfa63dc01d5985d0","score":"0.4799232","text":"protected double nextDistance() {\n return location.distance(next.location);\n }","title":""},{"docid":"6efe5354b3d3ff0c96e9004540b3fc77","score":"0.47971457","text":"Block getRelative(BlockFace face, int distance);","title":""},{"docid":"9d8d7095886c92fbecfd5317ea411f56","score":"0.47938544","text":"int getDistance();","title":""},{"docid":"8e2fd9396abac49e545f166cd26b56c2","score":"0.4786566","text":"public static double getDistance(Pose start, Pose end) {\r\n\t\tdouble x1 = start.getX();\r\n\t\tdouble x2 = end.getX();\r\n\t\tdouble y1 = start.getY();\r\n\t\tdouble y2 = end.getY();\r\n\t\t\r\n\t\tdouble result = Math.sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));\r\n\t\t\r\n\t\treturn result;\r\n\t}","title":""},{"docid":"564ad477ce253dba105ad61ab45cb9cd","score":"0.47722933","text":"private int[] calcPointsToStartFrom(){\n int[] points = new int[this.anchors.size()];\n\n int MAX_QUAD_POINTS = maxLinks;\n for(int j = 0; j < anchors.size(); j++) {\n Anchor a = anchors.get(j);\n Point[] quadPoints = new Point[MAX_QUAD_POINTS];\n\n int midPointX = (this.x + a.p.x) / 2;\n int midPointY = (this.y + a.p.y) / 2;\n midPointX += curve1Amount;\n if(a.p.y > this.y) {\n midPointY += curve1Amount;\n }else{\n midPointY -= curve1Amount;\n }\n Point midPoint = new Point(midPointX, midPointY);\n Point startPoint = new Point(this.x, this.y);\n\n\n double t = 0.0;\n for (int i = 0; i < MAX_QUAD_POINTS; i++) {\n t += (1.0/MAX_QUAD_POINTS);\n Point p = this.quadTo(startPoint, midPoint, a.p, t);\n quadPoints[i] = p;\n }\n\n for(int i = 0; i <quadPoints.length; i++){\n if(quadPoints[i].distance(startPoint) < distanceFromCenter){\n points[j] += 1;\n }\n }\n } // anchors\n return points;\n }","title":""},{"docid":"7388e1faa678e0c327990877cbfe74b6","score":"0.47603768","text":"public int getDistance(Node from, Node to) throws RemoteException;","title":""},{"docid":"a7704737b0b65bfa0ad2c382f4ac8a51","score":"0.47593698","text":"private int calcDist(double lat1, double lng1, double lat2, double lng2) {\n return 20000;\n }","title":""},{"docid":"09c8aa5c6e99900318df6c02b98448b1","score":"0.47547603","text":"private float recursiveConnectedDistanceToRoot(ScoutWidget[] list, Direction direction) {\n\n if (isDistanceToRootCache(direction)) {\n return mDistToRootCache[direction.getDirection()];\n }\n Anchor anchor = getAnchor(direction);\n\n if (anchor == null || !anchor.isConnected()) {\n return Float.NaN;\n }\n float margin = anchor.getMargin();\n Anchor toAnchor = anchor.getTarget();\n\n ScoutWidget toWidget = toAnchor.getOwner();\n if (list[0] == toWidget) { // found the base return;\n return margin;\n }\n\n // if atached to the same side\n if (toAnchor.getType() == direction) {\n for (ScoutWidget scoutWidget : list) {\n if (scoutWidget == toWidget) {\n float dist = scoutWidget.recursiveConnectedDistanceToRoot(list, direction);\n scoutWidget.cacheRootDistance(direction, dist);\n return margin + dist;\n }\n }\n }\n // if atached to the other side (you will need to add the length of the widget\n if (toAnchor.getType() == direction.getOpposite()) {\n for (ScoutWidget scoutWidget : list) {\n if (scoutWidget == toWidget) {\n margin += scoutWidget.getLength(direction);\n float dist = scoutWidget.recursiveConnectedDistanceToRoot(list, direction);\n scoutWidget.cacheRootDistance(direction, dist);\n return margin + dist;\n }\n }\n }\n return Float.NaN;\n }","title":""},{"docid":"72b09ef2fb5e1bf893df2151d887611e","score":"0.47529668","text":"abstract float downFromCenter();","title":""},{"docid":"eceb8eb6a6b805eaf9797914024d12e1","score":"0.47507468","text":"public double getMinimalMatchDistance();","title":""},{"docid":"a81f721079b11291a91a66c0a42ce577","score":"0.47472018","text":"@Test\n public void testLengthCalculation() {\n Link link = FixtureProvider.getTopChannelOverloadedField().getLinks().get(0);\n assertEquals(\"Wrong link's length calculation (traced by top)\", 450, link.getLength(true));\n assertEquals(\"Wrong link's length calculation (traced by bottom)\", 430, link.getLength(false));\n }","title":""},{"docid":"7233f27b6da27e2e0f76afd1c047ce8c","score":"0.47469416","text":"public Point2f getNeighborPoint();","title":""},{"docid":"02561443fafc1bd7fcc928bb5a6a9269","score":"0.47415525","text":"public double getDistance(){\n int encoderTicks = getEncoderVal();\n int distanceInInches = encoderTicks / ticksPerInch ;\n return distanceInInches;\n }","title":""},{"docid":"4fa278911fb680d5b4066ee59832169c","score":"0.47333252","text":"private Double getScaledDelta(XMLNode node) {\n\t\tReal2 thisXY = this.getXY2();\n\t\tReal2 nodeXY = node.getXY2();\n\t\tDouble d = null;\n\t\tif (thisXY != null && nodeXY != null) { \n\t\t\tif (ComparatorType.HORIZONTAL.equals(tree.outputDistances)) {\n\t\t\t\td = thisXY.getX() - nodeXY.getX();\n\t\t\t} else if (ComparatorType.VERTICAL.equals(tree.outputDistances)) {\n\t\t\t\td = thisXY.getY() - nodeXY.getY();\n\t\t\t} else {\n\t\t\t\td = thisXY.getDistance(nodeXY);\n\t\t\t}\n\t\t\td = Util.format(Math.abs(d) / tree.maxDist, tree.decimalPlaces);\n\t\t}\n\t\treturn d;\n\t}","title":""},{"docid":"ce61aaac0230e7132910593ff7e63d48","score":"0.4712753","text":"static float distance(ScoutWidget a, ScoutWidget b) {\n\n float ax1, ax2, ay1, ay2;\n float bx1, bx2, by1, by2;\n ax1 = a.mX;\n ax2 = a.mX + a.mWidth;\n ay1 = a.mY;\n ay2 = a.mY + a.mHeight;\n if (a.isVerticalGuideline()) {\n ay1 = -10000; // make the line infinite long\n ay2 = 10000;\n }\n if (a.isHorizontalGuideline()) {\n ax1 = -10000; // make the line infinite long\n ax2 = 10000;\n }\n bx1 = b.mX;\n bx2 = b.mX + b.mWidth;\n by1 = b.mY;\n by2 = b.mY + b.mHeight;\n if (b.isVerticalGuideline()) {\n by1 = -10000; // make the line infinite long\n by2 = 10000;\n }\n if (b.isHorizontalGuideline()) {\n bx1 = -10000; // make the line infinite long\n bx2 = 10000;\n }\n float xdiff11 = Math.abs(ax1 - bx1);\n float xdiff12 = Math.abs(ax1 - bx2);\n float xdiff21 = Math.abs(ax2 - bx1);\n float xdiff22 = Math.abs(ax2 - bx2);\n\n float ydiff11 = Math.abs(ay1 - by1);\n float ydiff12 = Math.abs(ay1 - by2);\n float ydiff21 = Math.abs(ay2 - by1);\n float ydiff22 = Math.abs(ay2 - by2);\n\n float xmin = Math.min(Math.min(xdiff11, xdiff12), Math.min(xdiff21, xdiff22));\n float ymin = Math.min(Math.min(ydiff11, ydiff12), Math.min(ydiff21, ydiff22));\n\n boolean yOverlap = ay1 <= by2 && by1 <= ay2;\n boolean xOverlap = ax1 <= bx2 && bx1 <= ax2;\n float xReturn = (yOverlap) ? xmin : (float)Math.hypot(xmin, ymin);\n float yReturn = (xOverlap) ? ymin : (float)Math.hypot(xmin, ymin);\n return Math.min(xReturn, yReturn);\n }","title":""},{"docid":"6083932298e0c610ee82d4af3c99634a","score":"0.47043243","text":"private double closestPtSegmentSegment(){\n\nVector pp1 = p1.curr;\nVector pq1 = p2.curr;\nVector pp2 = rca;\nVector pq2 = rcb;\n\nVector d1 = pq1.minus(pp1);\nVector d2 = pq2.minus(pp2);\nVector r = pp1.minus(pp2);\n\ndouble t;\ndouble a = d1.dot(d1);\ndouble e = d2.dot(d2);\ndouble f = d2.dot(r);\n\ndouble c = d1.dot(r);\ndouble b = d1.dot(d2);\ndouble denom = a * e - b * b;\n\nif (denom != 0.0) {\ns = MathUtil.clamp((b * f - c * e) / denom, 0, 1);\n} else {\ns = 0.5; // give the midpoint for parallel lines\n}\nt = (b * s + f) / e;\n\nif (t < 0) {\nt = 0;\ns = MathUtil.clamp(-c / a, 0, 1);\n} else if (t > 0) {\nt = 1;\ns = MathUtil.clamp((b - c) / a, 0, 1);\n}\n\nVector c1 = pp1.plus(d1.mult(s));\nVector c2 = pp2.plus(d2.mult(t));\nVector c1mc2 = c1.minus(c2);\nreturn c1mc2.dot(c1mc2);\n}","title":""},{"docid":"7f30d22ea2d934f3576cfbe27dc7080f","score":"0.4693633","text":"protected double getDistance(Agent a) {\r\n\t\tif (currentEdge == a.currentEdge) {\r\n\t\t\treturn a.distanceOnCurrentEdge - distanceOnCurrentEdge;\r\n\t\t}\r\n\r\n\t\tif (nextEdge == a.currentEdge) {\r\n\t\t\treturn currentEdge.getLength() + a.distanceOnCurrentEdge - distanceOnCurrentEdge;\r\n\t\t}\r\n\t\treturn Double.MAX_VALUE;\r\n\t}","title":""},{"docid":"2c04f0b39602cc6220df76148b828e46","score":"0.4683971","text":"public void estimateDistanceToGoal(CellNode n) {\n \t//Your implementation here\n\t\t\tn.distanceToGoalEstimate = 0.0; //Setting this to 0.0 effectively turns A* into Dijkstra\n\t\t\tdouble x = n.getRow(); \n\t\t\tdouble y = n.getColumn();\n\t\t\t\n\t\t\tx-= this.goal.getRow();\n\t\t\tx= x*x;\n\t\t\ty-= this.goal.getColumn();\n\t\t\ty= y*y;\n\t\t\t\n\t\t\ty = Math.sqrt(x+y);\n\t\t\t\n\t\t\tn.distanceToGoalEstimate=y;\n\t\t\t\n \treturn;\n\t\t}","title":""},{"docid":"a20718a4be4d459dd778fbf859874d60","score":"0.4674901","text":"public double distanceToCoordinateCenter();","title":""},{"docid":"23795a84a90a4d2eca609a75d09929dc","score":"0.46709487","text":"public float getCommonDistance(MeasuredShape s) {\n\t\tfloat distance = 0;\n\t\tint m = Math.min(segments.length, s.segments.length);\n\t\tfor (int a = 0; a < m; a++) {\n\t\t\tif (segments[a].type != PathIterator.SEG_MOVETO\n\t\t\t\t\t&& s.segments[a].type != PathIterator.SEG_MOVETO) {\n\t\t\t\tif (equal(segments[a].data[0], s.segments[a].data[0])\n\t\t\t\t\t\t&& equal(segments[a].data[1], s.segments[a].data[1])\n\t\t\t\t\t\t&& equal(\n\t\t\t\t\t\t\t\tsegments[a].data[segments[a].data.length - 2],\n\t\t\t\t\t\t\t\ts.segments[a].data[s.segments[a].data.length - 2])\n\t\t\t\t\t\t&& equal(\n\t\t\t\t\t\t\t\tsegments[a].data[segments[a].data.length - 1],\n\t\t\t\t\t\t\t\ts.segments[a].data[s.segments[a].data.length - 1])\n\t\t\t\t\t\t&& equal(segments[a].realDistance,\n\t\t\t\t\t\t\t\ts.segments[a].realDistance)) {\n\t\t\t\t\tdistance += segments[a].realDistance;\n\t\t\t\t} else {\n\t\t\t\t\treturn distance;\n\t\t\t\t}\n\t\t\t} else if (segments[a].type == PathIterator.SEG_MOVETO\n\t\t\t\t\t&& s.segments[a].type == PathIterator.SEG_MOVETO) {\n\t\t\t\t// skip\n\t\t\t} else {\n\t\t\t\treturn distance;\n\t\t\t}\n\t\t}\n\t\treturn distance;\n\t}","title":""},{"docid":"d662b85702371e77cb18d65205e4ab8f","score":"0.4663395","text":"public int getPathWeight();","title":""},{"docid":"e202a5b1ceef91e5f2e15b74073ae74a","score":"0.465675","text":"private ListNode findMidPoint(ListNode head) {\n if (head == null || head.next == null) return head;\n ListNode slow = head, fast = head, prev = head;\n while (fast != null && fast.next != null) {\n fast = fast.next.next;\n prev = slow;\n slow = slow.next;\n }\n return prev;\n }","title":""},{"docid":"e9feb2b884cc8f659ef56a148806ddd7","score":"0.4653401","text":"@MethodDef\r\n\t\tpublic String linkWithNDistances(AbstractGraphHandler agh,\r\n\t\t\t\t@ParameterDef (name=\"Desired number of vertices\") int numberOfNodes,\r\n\t\t\t\t@ParameterDef (name=\"Offset vector (e.g.\\\"1,2\\\")\") String offsetVector) {\r\n\r\n\t\t\tString s = test(numberOfNodes);\t\r\n\t\t\tif (s != null) return s;\r\n\t\t\tInteger[] rem = TypeParser.parseIntegerArray(offsetVector);\r\n\t\t\tPolygonGenerator backGen =\r\n\t\t\t\tnew PolygonGenerator(numberOfNodes, 300, 350, 350, rem, false);\r\n\r\n\t\t\tbackGen.generate(agh);\r\n\t\t\treturn null;\t\r\n\t\t}","title":""},{"docid":"db05a54c41bc6600db04a9398288cde6","score":"0.46480843","text":"public double getLength() {\n\n return (_poRight.getX() - _poLeft.getX());// same y plain to just distance between 2 points\n\n }","title":""},{"docid":"f06ab86b8acafd4a74e4e6d072142bea","score":"0.46456382","text":"public int relMap(float loc){\n\t\tint relativeLoc = (int)(((4000 + loc) / 8000) * 128);\n\t\treturn relativeLoc;\n\t\t\n\t}","title":""},{"docid":"10874bf13022f6829dd0ed917cbe5b02","score":"0.46286038","text":"private static int getDirection(Point origin, Point point1, Point point2) {\n Point vector1 = new Point(point1.x - origin.x, point1.y - origin.y, Point.Order.SECOND);\n Point vector2 = new Point(point2.x - origin.x, point2.y - origin.y, Point.Order.SECOND);\n\n return vector1.y * vector2.x - vector1.x * vector2.y;\n }","title":""},{"docid":"ac70c13f5aed6d7a1be350af75e88580","score":"0.46285075","text":"public static void test1(Location l1, Location l2) {\n\t\tSystem.out.println(\"TEST-1\");\n//\t\tLocation topLoc = new Location(-34.36338,-71.32979,50.0);\n//\t\tLocation botLoc = new Location(-33.94507,-72.7105,10.0);\n\t\tdouble numSubdivisions=100;\n\t\tLocationVector dir = LocationUtils.vector(l1, l2);\n\t\tSystem.out.println(\"Azimuth p1 to p2: \" + dir.getAzimuth());\n\t\tdouble horzIncr = dir.getHorzDistance()/numSubdivisions;\n\t\tdouble vertIncr = dir.getVertDistance()/numSubdivisions; // minus sign because vertDist is pos up and depth is pos down\n\t\tdir.setHorzDistance(horzIncr);\n\t\tdir.setVertDistance(vertIncr);\n\t\tLocation prevLoc = l1;\n\t\tfor(int r=0;r<numSubdivisions;r++) {\n\t\t\tLocation nextLoc = LocationUtils.location(prevLoc, dir);\n\t\t\tprevLoc = nextLoc;\n\t\t}\n\t\tdouble accuracyCheck = LocationUtils.linearDistanceFast(l2, prevLoc);\n\t\tSystem.out.println(\"Distance between actual and computed bottom point = \"+(float)accuracyCheck);\n\t\tSystem.out.println(\"DeltaLat = \"+ (float)((l2.getLatitude()-prevLoc.getLatitude())*111));\n\t\tSystem.out.println(\"DeltaLon = \"+ (float)((l2.getLongitude()-prevLoc.getLongitude())*111));\n\t\tSystem.out.println(\"DeltaDepth = \"+ (float)(l2.getDepth()-prevLoc.getDepth()));\n\t\tSystem.out.println(\"\");\n\t}","title":""},{"docid":"dc3135d11022f402f24f4de1b755c1c0","score":"0.46279478","text":"private double distanceFactor(double x1, double y1, double r1, double x2, double y2, double r2) {\n\t\tdouble dx = x2 - x1;\n\t\tdouble dy = y2 - y1;\n\t\tdouble sr = r1 + r2;\n\t\treturn (dx * dx + dy * dy) / (sr * sr);\n\t}","title":""},{"docid":"d55252115d2ca9bb6dfb7e5fe346ff46","score":"0.46220863","text":"public void inferRelativeEndPosition() {\r\n int width = getParent().getWidth() - getX();\r\n if (this.mOrientation == 0) {\r\n width = getParent().getHeight() - getY();\r\n }\r\n setGuideEnd(width);\r\n }","title":""},{"docid":"a051f7b5e66ac784e199a3fa3bbd00ba","score":"0.4617227","text":"int getLonOffset();","title":""},{"docid":"a051f7b5e66ac784e199a3fa3bbd00ba","score":"0.4617227","text":"int getLonOffset();","title":""},{"docid":"a051f7b5e66ac784e199a3fa3bbd00ba","score":"0.4617227","text":"int getLonOffset();","title":""},{"docid":"a051f7b5e66ac784e199a3fa3bbd00ba","score":"0.4617227","text":"int getLonOffset();","title":""},{"docid":"fa61c05e29f7bc7d431980e37ddb5081","score":"0.46111533","text":"public double maxRelativeOffsetFromCenter() {\n return this.maxRelativeOffset;\n }","title":""},{"docid":"e4d156195a1dad55fc786496e512d18e","score":"0.46103272","text":"public int getDistanceTo(Node node) {\r\n return distanceWeights.get(node);\r\n }","title":""},{"docid":"8ec5dc7a60ec562f7506ec75868aa630","score":"0.46044135","text":"private static double distanceToPoint(Point p, int x1, int y1, int x2,\n int y2) {\n if (x1 == x2) // vertical segment?\n return (double) (Math.abs(p.x - x1)); // yes, use horizontal distance\n else if (y1 == y2) // horizontal segment?\n return (double) (Math.abs(p.y - y1)); // yes, use vertical distance\n else {\n // Here, we know that the segment is neither vertical nor\n // horizontal.\n // Compute m, the slope of the line containing the segment.\n double m = ((double) (y1 - y2)) / ((double) (x1 - x2));\n\n // Compute mperp, the slope of the line perpendicular to the\n // segment.\n double mperp = -1.0 / m;\n\n // Compute the (x, y) intersection of the line containing the\n // segment and the line that is perpendicular to the segment and that\n // contains Point p.\n double x = (((double) y1) - ((double) p.y) - (m * x1) + (mperp * p.x))\n / (mperp - m);\n double y = m * (x - x1) + y1;\n\n // Return the distance between Point p and (x, y).\n return Math.sqrt(Math.pow(p.x - x, 2) + Math.pow(p.y - y, 2));\n }\n }","title":""},{"docid":"ee29918bc277cfde038ddac4445471fc","score":"0.46017724","text":"public static final float distancePointToSegment(Point2f p, Point2f s1, Point2f s2) {\n\t\tfloat r_denomenator = (s2.getX()-s1.getX())*(s2.getX()-s1.getX()) + (s2.getY()-s1.getY())*(s2.getY()-s1.getY());\n\t\tif (r_denomenator==0f) return p.distance(s1);\n\t\tfloat r_numerator = (p.getX()-s1.getX())*(s2.getX()-s1.getX()) + (p.getY()-s1.getY())*(s2.getY()-s1.getY());\n\t\tfloat ratio = r_numerator / r_denomenator;\n\n\t\tif (ratio<=0.) {\n\t\t\treturn (float)Math.sqrt((p.getX()-s1.getX())*(p.getX()-s1.getX()) + (p.getY()-s1.getY())*(p.getY()-s1.getY()));\n\t\t}\n\n\t\tif (ratio>=1f) {\n\t\t\treturn (float)Math.sqrt((p.getX()-s2.getX())*(p.getX()-s2.getX()) + (p.getY()-s2.getY())*(p.getY()-s2.getY()));\n\t\t}\n\n\t\tfloat s = ((s1.getY()-p.getY())*(s2.getX()-s1.getX())-(s1.getX()-p.getX())*(s2.getY()-s1.getY()) ) / r_denomenator;\n\t\treturn (float)(Math.abs(s) * Math.sqrt(r_denomenator));\n\t}","title":""},{"docid":"9b52c570b990d52024925c1cfb05c0e7","score":"0.45965743","text":"protected double getDistance(Operations.MutInt a, Operations.MutInt b)\r\n/* 126: */ {\r\n/* 127:109 */ return Math.abs(a.foo - b.foo);\r\n/* 128: */ }","title":""},{"docid":"ec0605ee41d86ad19e262b84fd362579","score":"0.4591739","text":"public int calculateDistance(final int source, final int destination);","title":""},{"docid":"3cb2d5fe45ca44482d4eb9684790a00a","score":"0.4586276","text":"public double pseudoDistance(final Vector3d point) {\n\t\treturn normal.dot(point) - constant;\n\t}","title":""},{"docid":"79e34801464c60163875d98f5d6021e9","score":"0.45847622","text":"public double calcDistance(Body b) {\n double dist = Math.pow((b.xxPos - this.xxPos),2.0) + Math.pow((b.yyPos - this.yyPos),2.0);\n return Math.sqrt(dist);\n }","title":""},{"docid":"e5f5a77fd6e56262c769b46251543c7f","score":"0.45701894","text":"public double getRelDelta(double destAngle, double heading) {\n return (heading-destAngle);\n }","title":""},{"docid":"a38c9b152fd1220303ff2663bfe87198","score":"0.45630985","text":"private int getDistanceToTarget(Node node, Node target) {\n\n Optional<Edge> edge = allEdges.stream().filter(s -> s.getSource().equals(node))\n .filter(e -> e.getDest().equals(target)).findFirst();\n if (edge.isPresent()) {\n return edge.get().length();\n } else {\n throw new IllegalArgumentException(\"Error: Edge not found\");\n }\n }","title":""},{"docid":"6d4956baf7295308c9b182505feda49f","score":"0.45537877","text":"private double DistanceAngle(double LatA, double LongA, double LatB, double LongB) {\n\t\tdouble dlon = LongB - LongA;\n\t\tdouble dlat = LatB - LatA;\n\t\t/*\n\t\t * Haversine formula\n\t\t * http://www.movable-type.co.uk/scripts/GIS-FAQ-5.1.html R.W. Sinnott,\n\t\t * Virtues of the Haversine, Sky and Telescope, vol. 68, no. 2, 1984, p.\n\t\t * 159\n\t\t */\n\t\tdouble sindlat2 = SMath.sin(dlat / 2);\n\t\tdouble sindlon2 = SMath.sin(dlon / 2);\n\t\tdouble corde = sindlat2 * sindlat2 + SMath.cos(LatA) * SMath.cos(LatB) * sindlon2 * sindlon2;\n\t\tif (corde > 1)\n\t\t\tcorde = 1;\n\t\treturn 2 * SMath.asin(SMath.sqrt(corde));\n\t}","title":""},{"docid":"924444fa8f28aa1d7c48cd9c144d697a","score":"0.45535868","text":"private static double estimatedDistance(GraphDB g, long id, long endPoint) {\n return g.distance(id, endPoint);\n }","title":""},{"docid":"48822f7fe635c391924cd901e59ebe3d","score":"0.45490193","text":"void getRelPointPos (double px, double py, double pz, DVector3 result);","title":""},{"docid":"c6da9ccf44ca2f979fe3fccbdb37e72f","score":"0.45485958","text":"double getHorizToVertRatio() {\n double horizEdges = 0;\n double vertEdges = 0;\n for (Edge e : this.edgesInMaze) {\n if (e.getDest().x != e.getSrc().x) {\n horizEdges += 1;\n }\n else {\n vertEdges += 1;\n }\n }\n\n return horizEdges / vertEdges;\n }","title":""},{"docid":"4a8e39cf7c3ff4fffe6cfcce3ebc6b52","score":"0.45442906","text":"private double getPathLengthCrossingPoint(double slope_1, double z0_1, double slope_2, double z0_2) {\n double s; //path length\n s = (z0_1 - z0_2) / (slope_2 - slope_1);\n return s;\n }","title":""},{"docid":"97e4f59bbdef1f9a880e3aa67d13d623","score":"0.45429417","text":"public double getDistanceFromEncoderValues() {\n\t\tdouble leftDistance = Math.abs(leftDriveLead.getEncPosition());\n\t\tdouble rightDistance = Math.abs(rightDriveLead.getEncPosition());\n\t\tdouble robotDistance = (leftDistance + rightDistance) / 2;\n\t\treturn robotDistance;\n\t}","title":""},{"docid":"10a7eda4fa2134b1bb050ed1ad73ecc6","score":"0.45421448","text":"void getPosRelPoint (double px, double py, double pz, DVector3 result);","title":""}],"string":"[\n {\n \"docid\": \"72b3a331bf01d117d44287ac72d3fcfc\",\n \"score\": \"0.59087294\",\n \"text\": \"protected abstract Vec3 getConnectorAnchorOffset();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"76c0df81b1166008c0c4a1bdcfb083a0\",\n \"score\": \"0.5481852\",\n \"text\": \"private Pair<Link, Double> getLinkCellOffset(List<Link> links, double totalOffset, double totalLength) {\\n\\t\\t// assume all cells the same length\\n\\t\\tint index = Math.max(Math.min(links.size() - 1,\\n\\t\\t\\t\\t(int)(links.size() * totalOffset / totalLength)), 0);\\n\\t\\tdouble cellSize = totalLength / links.size();\\n\\t\\t\\n\\t\\tdouble offset = totalOffset - index * cellSize;\\n\\t\\tLink link = links.get(index);\\n\\t\\t\\n\\t\\t// Monitor.out(totalOffset + \\\" / \\\" + totalLength + \\\" -> \\\" + index + \\\" / \\\" + links.size() + \\\" + \\\" + offset);\\n\\t\\t\\n\\t\\treturn Pair.of(link, offset);\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6f44baedd1c83ea40b2c66a954fa7010\",\n \"score\": \"0.54413843\",\n \"text\": \"public int getDistanceToEndPoint(){\\n return (END - x) + (END - y) + (END - z);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9dbee79b74b97a06b92d6ed97b094ebc\",\n \"score\": \"0.5423982\",\n \"text\": \"public float heuristique(Node<?> node) {\\r\\n\\t\\tif ((node.origin instanceof Dot) && (this.origin instanceof Dot)) {\\r\\n\\t\\t\\treturn getDistanceFrom((Dot) node.origin, (Dot) this.origin);\\r\\n\\t\\t}\\r\\n\\t\\treturn 0;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4712edaefac86258ed2b04a786b3d3ac\",\n \"score\": \"0.5402257\",\n \"text\": \"private void calculateDistance(Node node) {\\r\\n\\t\\tfloat abstractness = node.getAbstractness();\\r\\n\\t\\tfloat instability = node.getInstability();\\r\\n\\t\\tfloat distance = Math.abs(abstractness + instability - 1);\\r\\n\\t\\tnode.setDistanceFromMainSequence(distance);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"42d0f2736bb44b22210d1844e8dd83f6\",\n \"score\": \"0.538151\",\n \"text\": \"byte getViewDistance();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"67c362c46d458e26d261cda3d7886ab3\",\n \"score\": \"0.53381777\",\n \"text\": \"public float physicalDistanceTo(SomNode node) {\\n int xLeg, yLeg;\\n\\n xLeg = xPos - node.getXPos();\\n xLeg *= xLeg;\\n yLeg = yPos - node.getYPos();\\n yLeg *= yLeg;\\n\\n return xLeg + yLeg;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c21f8adacca022a102e172d34ee6e271\",\n \"score\": \"0.5307882\",\n \"text\": \"private double directDistToTarget() {\\n\\t\\tdouble dist = 0;\\n\\t\\t// Use pythagorean theorem to calculate distance between curPos and targetPos:\\n\\t\\tdist = Math.sqrt(Math.pow((targetPos.getUTMEasting() - curPos.getUTMEasting()), 2) + \\n\\t\\t\\t\\tMath.pow((targetPos.getUTMNorthing() - curPos.getUTMNorthing()), 2));\\n\\t\\treturn dist;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9c4844cec362c09148fc5762e2a40c76\",\n \"score\": \"0.5294173\",\n \"text\": \"@Override\\n public double calculate(Point n1, Point n2) {\\n double dx = Math.abs(n1.getX() - n2.getX());\\n double dy = Math.abs(n1.getY() - n2.getY());\\n return (dx + dy) + (Maths.DIAGONAL_LENGTH - 2) * Math.min(dx, dy);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4b2c48fe2c2f6b83ae0897a900af7f89\",\n \"score\": \"0.52872723\",\n \"text\": \"private double relativeLength(TransientEdge edge) {\\n\\t\\tDisk d1 = edge.getVertex1().getDisk();\\n\\t\\tDisk d2 = edge.getVertex2().getDisk();\\n\\t\\tdouble x1 = d1.getX();\\n\\t\\tdouble y1 = d1.getY();\\n\\t\\tdouble r1 = d1.getRadius();\\n\\t\\tdouble x2 = d2.getX();\\n\\t\\tdouble y2 = d2.getY();\\n\\t\\tdouble r2 = d2.getRadius();\\n\\t\\treturn distanceFactor(x1, y1, r1, x2, y2, r2);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fed1a86be11949904d52e9b0248c5a48\",\n \"score\": \"0.5258929\",\n \"text\": \"private int estimatedDistance (AstarPosition position) {\\n // erst Schritte auf der x Achse machen \\n // dann Schritte auf der y Achse machen\\n int destX = destinationAsNode.getPosition().getX();\\n int destY = destinationAsNode.getPosition().getY();\\n int nodeX = position.getX();\\n int nodeY = position.getY();\\n int needX = 0;\\n int needY = 0;\\n \\n if (destX < nodeX) {\\n needX = nodeX - destX;\\n } else if (destX > nodeX) {\\n needX = destX - nodeX;\\n }\\n \\n if (destY < nodeY) {\\n needY = nodeY - destY;\\n } else if (destY > nodeY) {\\n needY = destY - nodeY;\\n }\\n \\n needX = needX * 10;\\n needY = needY * 10;\\n \\n return needX + needY;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a9e9b2cb2295d82d23d89e903fecceca\",\n \"score\": \"0.5203504\",\n \"text\": \"float getOffset();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d241e239e51a847324fb4743205ca87c\",\n \"score\": \"0.51605856\",\n \"text\": \"public float getDistance() throws IOException\\n\\t{\\n\\t\\tif ((__io__pointersize == 8)) {\\n\\t\\t\\treturn __io__block.readFloat(__io__address + 256);\\n\\t\\t} else {\\n\\t\\t\\treturn __io__block.readFloat(__io__address + 244);\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"75b0253fd1a2098645cb3d8642786008\",\n \"score\": \"0.51594514\",\n \"text\": \"public double lengthEdge(Point a, Point b) {\\n return Math.sqrt((b.getX() - a.getX()) * (b.getX() - a.getX()) + (b.getY() - a.getY()) * (b.getY() - a.getY()));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9728fe687edd0afc0c533f114c994af6\",\n \"score\": \"0.51562256\",\n \"text\": \"public Point computeAnchorLocation(Point first, Point next) {\\r\\n final Rectangle bounds = getBounds();\\r\\n return new Point(bounds.x + bounds.width / 2, bounds.y + bounds.height / 2);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6fde8c364c44b022b5699ad1a17e729d\",\n \"score\": \"0.51543\",\n \"text\": \"private double pathDistToTarget() {\\n\\t\\tdouble dist = 0;\\n\\t\\tdist = Math.sqrt(Math.pow(directDistToTarget(), 2) - Math.pow(latError, 2));\\n\\t\\t//System.out.print(\\\"Distance to target along path: \\\");\\n\\t\\t//System.out.println(dist);\\n\\t\\treturn dist;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ec411b00fdebe481c60da5b6ecf91144\",\n \"score\": \"0.51182455\",\n \"text\": \"private double getDist() {\\n unZoom(); // so zoom won't affect results\\n ledsOn(); // so we can see\\n\\n if (this.targetsInView()) {\\n // taken from limelight docs (equation is d = (h2-h1) / tan(a1+a2))\\n return 70.25 / Math.tan(10 + table.getEntry(\\\"ty\\\").getDouble(0)); \\n } else {\\n return -1;\\n }\\n \\n /**\\n * the 70.25 is height of center of the circle (in the hexagon frame) in inches minus how high lens is off the groun (20 inches) (h2 - h1)\\n * 10 is angle limelight lens is at (a1)\\n * ty.getDouble gives the y value of the target from LL's perspective\\n * -1 is a default value to return, being unsuccesful\\n */ \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0c18b3ef2a408c19d19ba99a4751bada\",\n \"score\": \"0.5108899\",\n \"text\": \"int equivalentDirection(Direction anchor) {\\n switch (anchor) {\\n case TOP:\\n return 2;\\n case BOTTOM:\\n return 3;\\n case RIGHT:\\n return 1;\\n case LEFT:\\n return 0;\\n case BASELINE:\\n return 0;\\n }\\n return 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c3388200c9065cbe5ddafa57b02b913c\",\n \"score\": \"0.5025685\",\n \"text\": \"private static int findStraightLineDistance(int[] from, int[] goal) {\\n\\t\\tint xsquare =(from[0] - goal[0]) * (from[0] - goal[0]) * 100;\\n\\t\\tint ysquare = (from[1] - goal[1]) * (from[1] - goal[1]) * 100;\\n\\t\\treturn (int) Math.sqrt( xsquare + ysquare );\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3b5b9a5069c9199a6d179fbd9c9b5e8f\",\n \"score\": \"0.50192094\",\n \"text\": \"public abstract double distanceAlongGeometry();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"718470f560703b0574c5c179d7205c71\",\n \"score\": \"0.5003657\",\n \"text\": \"public double getDistance ();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"074f4e7f70e985e4b2a85bc3336bc80a\",\n \"score\": \"0.5002475\",\n \"text\": \"private static float getLinkDensity(Element e){\\n\\t\\tElements allA = e.getElementsByTag(\\\"a\\\");\\n\\t\\tint textLength = e.text().length();\\n\\t\\tint linkLength = 0;\\n\\t\\tfor(Element a : allA){\\n\\t\\t\\tlinkLength += a.text().length();\\n\\t\\t}\\n\\t\\treturn linkLength/textLength;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b7d661969122b2d8a458c93d2d3b2ecb\",\n \"score\": \"0.49492168\",\n \"text\": \"private double computeLateralErr() {\\n\\t\\t// See \\\"Line defined by two points\\\" at \\n\\t\\t// https://en.wikipedia.org/wiki/Distance_from_a_point_to_a_line\\n\\t\\t// From the wikipedia equation:\\n\\t\\t// P1 => prevPos\\n\\t\\t// P2 => curPos\\n\\t\\t// (x0, y0) => targetPos\\n\\t\\t\\n\\t\\t// P1:\\n\\t\\t// Generate an arbitrary point to define the line (far enough away to avoid rounding errors)\\n\\t\\tdouble x1 = curPos.getUTMEasting() + Math.cos(curPos.getMathAngle() / 180 * Math.PI) * 1000;\\n\\t\\tdouble y1 = curPos.getUTMNorthing() + Math.sin(curPos.getMathAngle() / 180 * Math.PI) * 1000;\\n\\t\\t\\n\\t\\t// P2:\\n\\t\\tdouble x2 = curPos.getUTMEasting();\\n\\t\\tdouble y2 = curPos.getUTMNorthing();\\n\\t\\t\\n\\t\\t// Target\\n\\t\\tdouble x0 = targetPos.getUTMEasting();\\n\\t\\tdouble y0 = targetPos.getUTMNorthing();\\n\\t\\t\\n\\t\\t// Calculate numerator in equation: (it's a big equation...)\\n\\t\\tdouble num = (y2 - y1) * x0;\\n\\t\\tnum -= (x2 - x1) * y0;\\n\\t\\tnum += x2 * y1;\\n\\t\\tnum -= y2 * x1;\\n\\t\\tnum = Math.abs(num);\\n\\t\\t\\n\\t\\t// Calculate denominator in equation:\\n\\t\\tdouble denom = Math.pow(y2 - y1, 2.0);\\n\\t\\tdenom += Math.pow(x2 - x1, 2.0);\\n\\t\\tdenom = Math.sqrt(denom);\\n\\t\\t\\n\\t\\treturn num / denom;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dcb4deed1cfd7e7d2181bb8ca13b7791\",\n \"score\": \"0.4941889\",\n \"text\": \"double getTotalDistance();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"54c161ec02b26a4dcefffb7984255f9f\",\n \"score\": \"0.4933007\",\n \"text\": \"private static float calcDistance(float x1, float y1, float x2, float y2){\\n float d = ((float) Math.sqrt((float) Math.pow((x2 - x1), 2) + (float) Math.pow((y2 - y1), 2)));\\n\\n return d;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"36f3fc0fb31cf22c8c8a84acebcc54c5\",\n \"score\": \"0.49329507\",\n \"text\": \"int getDistance(Port from, Port to);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"41b127d8060d2572c01c7196fc559b0b\",\n \"score\": \"0.4931462\",\n \"text\": \"public abstract float getDistance(E source, E dest);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c8e4075f043e548f14d6a3d66703dbe8\",\n \"score\": \"0.49212417\",\n \"text\": \"public static float getDistance(float x1, float y1, float x2, float y2) { return (float) Math.sqrt(Math.pow(x1 - x2, 2) + Math.pow(y1 - y2, 2)); }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1c1f9391bfbe0b2d451d033e17fbdc90\",\n \"score\": \"0.4914366\",\n \"text\": \"public int getViewDistance();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"105d75cc06fd6fbbc190fe1fc280220f\",\n \"score\": \"0.49121657\",\n \"text\": \"double getOffset();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"105d75cc06fd6fbbc190fe1fc280220f\",\n \"score\": \"0.49121657\",\n \"text\": \"double getOffset();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bed655f78f70627013efa8701cba37da\",\n \"score\": \"0.4893971\",\n \"text\": \"public float getDistFromBase() { return (float) 0;}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f5e169998797cf258c191cccc07d46a0\",\n \"score\": \"0.48927784\",\n \"text\": \"public double getDistance();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80bad9e58e0207fb71912472f098ff75\",\n \"score\": \"0.48891622\",\n \"text\": \"@objid (\\\"7f58791a-1dec-11e2-8cad-001ec947c8cc\\\")\\n public Dimension getOffset() {\\n return this.anchorOffset;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4cc9163dc3af5b41b8fcb55965c334a9\",\n \"score\": \"0.48869509\",\n \"text\": \"public abstract int following(int offset);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eb692dc97e43d0c5e65bd29fe9d4c2d3\",\n \"score\": \"0.4870801\",\n \"text\": \"private static float lonDiff(float a1, float a2) {\\n float d = a1 - a2;\\n if (d < 0.0f) {\\n d = -d;\\n }\\n if (d > 180.0f) {\\n d = 360.0f - d;\\n }\\n return d;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"289991e2ccf487a6c70e83f616f653f9\",\n \"score\": \"0.4863593\",\n \"text\": \"double getDistance();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0e8244f855f7b41d1c624127c4d4453e\",\n \"score\": \"0.48631334\",\n \"text\": \"public float measureStraight(GraphNode head, GraphNode tail)\\n {\\n \\tdouble dis = 0.0f;\\n \\t// d2 = x2 + y2 + z2\\n \\t\\n \\tdis = Math.sqrt(Math.pow((head.col - tail.col)*_colDis, 2.0) + \\n \\t\\t\\tMath.pow((head.row - tail.row)*_rowDis, 2.0) + \\n \\t\\t\\tMath.pow((head.z - tail.z)*_zDis, 2.0) );\\n\\t\\t\\n \\t\\n \\treturn (float)dis;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"42e6c91bbd2c8872eaf89d348f8640f0\",\n \"score\": \"0.48516867\",\n \"text\": \"byte getRenderDistance();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"abd62f2600231c4c69983657adb88d6d\",\n \"score\": \"0.48468003\",\n \"text\": \"public static double distance(Point a, Point b)\\r\\n/* 20: */ {\\r\\n/* 21: 15 */ return a.getDistanceTo(b);\\r\\n/* 22: */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e7f951c181ee04a60a8b2b39c15c4d2\",\n \"score\": \"0.48436815\",\n \"text\": \"public void offsetForLink(){\\n\\t\\tbyteOffset += (sizeOfDataRec - 2);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ac4a3a4e8233261999bb9e0bd68c9337\",\n \"score\": \"0.48331478\",\n \"text\": \"public double getDistanceToTravel() {\\n double distance = Math.sqrt(Math.pow(targetY - y, 2) \\n + Math.pow(targetX - x, 2));\\n return distance;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"da0ffdc61c6ecd8009db4fd684b38990\",\n \"score\": \"0.4832171\",\n \"text\": \"public static double belowAboveGlidePath(double lat1, double lon1, double lat2, double lon2, double el1, double el2, double SlopeAngle)\\n\\t{\\n\\t\\t// WGS-84 ellipsoid\\n\\t\\tdouble a = 6378137;\\n\\t\\tdouble b = 6356752.314245;\\n\\t\\tdouble f = 1/298.257223563;\\n\\t\\tdouble L = Math.toRadians(lon2-lon1);\\n\\t\\tdouble U1 = Math.atan((1-f) * Math.tan(Math.toRadians(lat1)));\\n\\t\\tdouble U2 = Math.atan((1-f) * Math.tan(Math.toRadians(lat2)));\\n\\t\\tdouble sinU1 = Math.sin(U1);\\n\\t\\tdouble cosU1 = Math.cos(U1);\\n\\t\\tdouble sinU2 = Math.sin(U2);\\n\\t\\tdouble cosU2 = Math.cos(U2);\\n\\n\\t\\tdouble lambda = L, lambdaP, iterLimit = 100;\\n\\t\\tdouble sigma, cosSqAlpha, sinSigma, cosSigma, cos2SigmaM;\\n\\n\\t\\tdo\\n\\t\\t{\\n\\t\\t\\tdouble sinLambda = Math.sin(lambda);\\n\\t\\t\\tdouble cosLambda = Math.cos(lambda);\\n\\t\\t\\tsinSigma = Math.sqrt((cosU2*sinLambda) * (cosU2*sinLambda) + (cosU1*sinU2-sinU1*cosU2*cosLambda) * (cosU1*sinU2-sinU1*cosU2*cosLambda));\\n\\t\\t\\tif (sinSigma==0) return 0; // co-incident points\\n\\t\\t\\tcosSigma = sinU1*sinU2 + cosU1*cosU2*cosLambda;\\n\\t\\t\\tsigma = Math.atan2(sinSigma, cosSigma);\\n\\t\\t\\tdouble sinAlpha = cosU1 * cosU2 * sinLambda / sinSigma;\\n\\t\\t\\tcosSqAlpha = 1 - sinAlpha*sinAlpha;\\n\\t\\t\\ttry\\n\\t\\t\\t{\\n\\t\\t\\t\\tcos2SigmaM = cosSigma - 2*sinU1*sinU2/cosSqAlpha;\\n\\t\\t\\t}\\n\\t\\t\\tcatch (ArithmeticException e)\\n\\t\\t\\t{\\n\\t\\t\\t\\tcos2SigmaM = 0; // equatorial line: cosSqAlpha=0\\n\\t\\t\\t}\\n\\t\\t\\tdouble C = f/16*cosSqAlpha*(4+f*(4-3*cosSqAlpha));\\n\\t\\t\\tlambdaP = lambda;\\n\\t\\t\\tlambda = L + (1-C) * f * sinAlpha * (sigma + C*sinSigma*(cos2SigmaM+C*cosSigma*(-1+2*cos2SigmaM*cos2SigmaM)));\\n\\t\\t}\\n\\t\\twhile (Math.abs(lambda-lambdaP) > 1e-12 && --iterLimit>0);\\n\\n\\t\\tif (iterLimit==0) return -1; // formula failed to converge\\n\\n\\t\\tdouble uSq = cosSqAlpha * (a*a - b*b) / (b*b);\\n\\t\\tdouble A = 1 + uSq/16384*(4096+uSq*(-768+uSq*(320-175*uSq)));\\n\\t\\tdouble B = uSq/1024 * (256+uSq*(-128+uSq*(74-47*uSq)));\\n\\t\\tdouble deltaSigma = B*sinSigma*(cos2SigmaM+B/4*(cosSigma*(-1+2*cos2SigmaM*cos2SigmaM)-B/6*cos2SigmaM*(-3+4*sinSigma*sinSigma)*(-3+4*cos2SigmaM*cos2SigmaM)));\\n\\t\\tdouble distance = b*A*(sigma-deltaSigma);\\n\\t\\tdouble neededElev = Math.tan(SlopeAngle)*distance + el2; // must be at this elevation\\n\\t\\treturn el1-neededElev;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"06af49a9f0b4bb8c01fb7d95468aaef9\",\n \"score\": \"0.48298624\",\n \"text\": \"public double measureLength()\\n {\\n List<Bone> leaves = new ArrayList<Bone>();\\n List<Bone> all = new ArrayList<Bone>();\\n _skeleton.collectBones(all);\\n for (Bone b : all) {\\n if (b.getChildren().length == 0) {\\n leaves.add(b);\\n }\\n }\\n double dist = 0;\\n Point3d p1 = new Point3d();\\n Point3d p2 = new Point3d();\\n for (Bone b1 : leaves) {\\n for (Bone b2 : leaves) {\\n if (!b1.equals(b2)) {\\n b1.getWorldPosition(p1);\\n b2.getWorldPosition(p2);\\n dist = Math.max(p1.distance(p2), dist);\\n }\\n }\\n }\\n System.out.println(\\\"### LENGTH IS \\\" + dist);\\n return dist;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1ef31501cf66ceeb49078b5fd7a1ff7c\",\n \"score\": \"0.4824411\",\n \"text\": \"public double dist(RealPoint punto){\\n \\n \\n double dx = this.x - punto.x; //podemos acceder a punto.x porque estamos dentro de la misma clase. !!!!\\n double dy = this.y - punto.y;\\n double distancia = Math.sqrt(dx*dx + dy*dy);\\n \\n return distancia;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"92d6a4b12336a5203a8342e5dceb86db\",\n \"score\": \"0.4815148\",\n \"text\": \"protected abstract int calcRenderOffset(int scale, int line);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7093c5ce22e832626a1d77cbfcf80f81\",\n \"score\": \"0.48098248\",\n \"text\": \"private double Estimated_Distance(double a2){\\n double h1 = 6.0;\\n double h2 = 36.0;\\n double a1 = 0.0;\\n return (h2-h1)/Math.tan(a1+a2);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"671b8bac0e9cfb946b409e951d7656d0\",\n \"score\": \"0.48096925\",\n \"text\": \"public double getDistance2D(float x, float y);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c7eaa12e612bcc6f11927a621be612d\",\n \"score\": \"0.48074985\",\n \"text\": \"public static int labelDistance(){\\n return 0; //TODO codavaj!!\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8a99485a0605958b6b49d822937c8487\",\n \"score\": \"0.48053318\",\n \"text\": \"private double calcLength(NodeObjects first, NodeObjects second) {\\r\\n\\t\\treturn Math.sqrt(Math.pow((first.getX() - second.getX()), 2) + Math.pow((first.getY() - second.getY()), 2));\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d984939acd238df6bfa63dc01d5985d0\",\n \"score\": \"0.4799232\",\n \"text\": \"protected double nextDistance() {\\n return location.distance(next.location);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6efe5354b3d3ff0c96e9004540b3fc77\",\n \"score\": \"0.47971457\",\n \"text\": \"Block getRelative(BlockFace face, int distance);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d8d7095886c92fbecfd5317ea411f56\",\n \"score\": \"0.47938544\",\n \"text\": \"int getDistance();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8e2fd9396abac49e545f166cd26b56c2\",\n \"score\": \"0.4786566\",\n \"text\": \"public static double getDistance(Pose start, Pose end) {\\r\\n\\t\\tdouble x1 = start.getX();\\r\\n\\t\\tdouble x2 = end.getX();\\r\\n\\t\\tdouble y1 = start.getY();\\r\\n\\t\\tdouble y2 = end.getY();\\r\\n\\t\\t\\r\\n\\t\\tdouble result = Math.sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));\\r\\n\\t\\t\\r\\n\\t\\treturn result;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"564ad477ce253dba105ad61ab45cb9cd\",\n \"score\": \"0.47722933\",\n \"text\": \"private int[] calcPointsToStartFrom(){\\n int[] points = new int[this.anchors.size()];\\n\\n int MAX_QUAD_POINTS = maxLinks;\\n for(int j = 0; j < anchors.size(); j++) {\\n Anchor a = anchors.get(j);\\n Point[] quadPoints = new Point[MAX_QUAD_POINTS];\\n\\n int midPointX = (this.x + a.p.x) / 2;\\n int midPointY = (this.y + a.p.y) / 2;\\n midPointX += curve1Amount;\\n if(a.p.y > this.y) {\\n midPointY += curve1Amount;\\n }else{\\n midPointY -= curve1Amount;\\n }\\n Point midPoint = new Point(midPointX, midPointY);\\n Point startPoint = new Point(this.x, this.y);\\n\\n\\n double t = 0.0;\\n for (int i = 0; i < MAX_QUAD_POINTS; i++) {\\n t += (1.0/MAX_QUAD_POINTS);\\n Point p = this.quadTo(startPoint, midPoint, a.p, t);\\n quadPoints[i] = p;\\n }\\n\\n for(int i = 0; i <quadPoints.length; i++){\\n if(quadPoints[i].distance(startPoint) < distanceFromCenter){\\n points[j] += 1;\\n }\\n }\\n } // anchors\\n return points;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7388e1faa678e0c327990877cbfe74b6\",\n \"score\": \"0.47603768\",\n \"text\": \"public int getDistance(Node from, Node to) throws RemoteException;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a7704737b0b65bfa0ad2c382f4ac8a51\",\n \"score\": \"0.47593698\",\n \"text\": \"private int calcDist(double lat1, double lng1, double lat2, double lng2) {\\n return 20000;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"09c8aa5c6e99900318df6c02b98448b1\",\n \"score\": \"0.47547603\",\n \"text\": \"private float recursiveConnectedDistanceToRoot(ScoutWidget[] list, Direction direction) {\\n\\n if (isDistanceToRootCache(direction)) {\\n return mDistToRootCache[direction.getDirection()];\\n }\\n Anchor anchor = getAnchor(direction);\\n\\n if (anchor == null || !anchor.isConnected()) {\\n return Float.NaN;\\n }\\n float margin = anchor.getMargin();\\n Anchor toAnchor = anchor.getTarget();\\n\\n ScoutWidget toWidget = toAnchor.getOwner();\\n if (list[0] == toWidget) { // found the base return;\\n return margin;\\n }\\n\\n // if atached to the same side\\n if (toAnchor.getType() == direction) {\\n for (ScoutWidget scoutWidget : list) {\\n if (scoutWidget == toWidget) {\\n float dist = scoutWidget.recursiveConnectedDistanceToRoot(list, direction);\\n scoutWidget.cacheRootDistance(direction, dist);\\n return margin + dist;\\n }\\n }\\n }\\n // if atached to the other side (you will need to add the length of the widget\\n if (toAnchor.getType() == direction.getOpposite()) {\\n for (ScoutWidget scoutWidget : list) {\\n if (scoutWidget == toWidget) {\\n margin += scoutWidget.getLength(direction);\\n float dist = scoutWidget.recursiveConnectedDistanceToRoot(list, direction);\\n scoutWidget.cacheRootDistance(direction, dist);\\n return margin + dist;\\n }\\n }\\n }\\n return Float.NaN;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"72b09ef2fb5e1bf893df2151d887611e\",\n \"score\": \"0.47529668\",\n \"text\": \"abstract float downFromCenter();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eceb8eb6a6b805eaf9797914024d12e1\",\n \"score\": \"0.47507468\",\n \"text\": \"public double getMinimalMatchDistance();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a81f721079b11291a91a66c0a42ce577\",\n \"score\": \"0.47472018\",\n \"text\": \"@Test\\n public void testLengthCalculation() {\\n Link link = FixtureProvider.getTopChannelOverloadedField().getLinks().get(0);\\n assertEquals(\\\"Wrong link's length calculation (traced by top)\\\", 450, link.getLength(true));\\n assertEquals(\\\"Wrong link's length calculation (traced by bottom)\\\", 430, link.getLength(false));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7233f27b6da27e2e0f76afd1c047ce8c\",\n \"score\": \"0.47469416\",\n \"text\": \"public Point2f getNeighborPoint();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"02561443fafc1bd7fcc928bb5a6a9269\",\n \"score\": \"0.47415525\",\n \"text\": \"public double getDistance(){\\n int encoderTicks = getEncoderVal();\\n int distanceInInches = encoderTicks / ticksPerInch ;\\n return distanceInInches;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4fa278911fb680d5b4066ee59832169c\",\n \"score\": \"0.47333252\",\n \"text\": \"private Double getScaledDelta(XMLNode node) {\\n\\t\\tReal2 thisXY = this.getXY2();\\n\\t\\tReal2 nodeXY = node.getXY2();\\n\\t\\tDouble d = null;\\n\\t\\tif (thisXY != null && nodeXY != null) { \\n\\t\\t\\tif (ComparatorType.HORIZONTAL.equals(tree.outputDistances)) {\\n\\t\\t\\t\\td = thisXY.getX() - nodeXY.getX();\\n\\t\\t\\t} else if (ComparatorType.VERTICAL.equals(tree.outputDistances)) {\\n\\t\\t\\t\\td = thisXY.getY() - nodeXY.getY();\\n\\t\\t\\t} else {\\n\\t\\t\\t\\td = thisXY.getDistance(nodeXY);\\n\\t\\t\\t}\\n\\t\\t\\td = Util.format(Math.abs(d) / tree.maxDist, tree.decimalPlaces);\\n\\t\\t}\\n\\t\\treturn d;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ce61aaac0230e7132910593ff7e63d48\",\n \"score\": \"0.4712753\",\n \"text\": \"static float distance(ScoutWidget a, ScoutWidget b) {\\n\\n float ax1, ax2, ay1, ay2;\\n float bx1, bx2, by1, by2;\\n ax1 = a.mX;\\n ax2 = a.mX + a.mWidth;\\n ay1 = a.mY;\\n ay2 = a.mY + a.mHeight;\\n if (a.isVerticalGuideline()) {\\n ay1 = -10000; // make the line infinite long\\n ay2 = 10000;\\n }\\n if (a.isHorizontalGuideline()) {\\n ax1 = -10000; // make the line infinite long\\n ax2 = 10000;\\n }\\n bx1 = b.mX;\\n bx2 = b.mX + b.mWidth;\\n by1 = b.mY;\\n by2 = b.mY + b.mHeight;\\n if (b.isVerticalGuideline()) {\\n by1 = -10000; // make the line infinite long\\n by2 = 10000;\\n }\\n if (b.isHorizontalGuideline()) {\\n bx1 = -10000; // make the line infinite long\\n bx2 = 10000;\\n }\\n float xdiff11 = Math.abs(ax1 - bx1);\\n float xdiff12 = Math.abs(ax1 - bx2);\\n float xdiff21 = Math.abs(ax2 - bx1);\\n float xdiff22 = Math.abs(ax2 - bx2);\\n\\n float ydiff11 = Math.abs(ay1 - by1);\\n float ydiff12 = Math.abs(ay1 - by2);\\n float ydiff21 = Math.abs(ay2 - by1);\\n float ydiff22 = Math.abs(ay2 - by2);\\n\\n float xmin = Math.min(Math.min(xdiff11, xdiff12), Math.min(xdiff21, xdiff22));\\n float ymin = Math.min(Math.min(ydiff11, ydiff12), Math.min(ydiff21, ydiff22));\\n\\n boolean yOverlap = ay1 <= by2 && by1 <= ay2;\\n boolean xOverlap = ax1 <= bx2 && bx1 <= ax2;\\n float xReturn = (yOverlap) ? xmin : (float)Math.hypot(xmin, ymin);\\n float yReturn = (xOverlap) ? ymin : (float)Math.hypot(xmin, ymin);\\n return Math.min(xReturn, yReturn);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6083932298e0c610ee82d4af3c99634a\",\n \"score\": \"0.47043243\",\n \"text\": \"private double closestPtSegmentSegment(){\\n\\nVector pp1 = p1.curr;\\nVector pq1 = p2.curr;\\nVector pp2 = rca;\\nVector pq2 = rcb;\\n\\nVector d1 = pq1.minus(pp1);\\nVector d2 = pq2.minus(pp2);\\nVector r = pp1.minus(pp2);\\n\\ndouble t;\\ndouble a = d1.dot(d1);\\ndouble e = d2.dot(d2);\\ndouble f = d2.dot(r);\\n\\ndouble c = d1.dot(r);\\ndouble b = d1.dot(d2);\\ndouble denom = a * e - b * b;\\n\\nif (denom != 0.0) {\\ns = MathUtil.clamp((b * f - c * e) / denom, 0, 1);\\n} else {\\ns = 0.5; // give the midpoint for parallel lines\\n}\\nt = (b * s + f) / e;\\n\\nif (t < 0) {\\nt = 0;\\ns = MathUtil.clamp(-c / a, 0, 1);\\n} else if (t > 0) {\\nt = 1;\\ns = MathUtil.clamp((b - c) / a, 0, 1);\\n}\\n\\nVector c1 = pp1.plus(d1.mult(s));\\nVector c2 = pp2.plus(d2.mult(t));\\nVector c1mc2 = c1.minus(c2);\\nreturn c1mc2.dot(c1mc2);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7f30d22ea2d934f3576cfbe27dc7080f\",\n \"score\": \"0.4693633\",\n \"text\": \"protected double getDistance(Agent a) {\\r\\n\\t\\tif (currentEdge == a.currentEdge) {\\r\\n\\t\\t\\treturn a.distanceOnCurrentEdge - distanceOnCurrentEdge;\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tif (nextEdge == a.currentEdge) {\\r\\n\\t\\t\\treturn currentEdge.getLength() + a.distanceOnCurrentEdge - distanceOnCurrentEdge;\\r\\n\\t\\t}\\r\\n\\t\\treturn Double.MAX_VALUE;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c04f0b39602cc6220df76148b828e46\",\n \"score\": \"0.4683971\",\n \"text\": \"public void estimateDistanceToGoal(CellNode n) {\\n \\t//Your implementation here\\n\\t\\t\\tn.distanceToGoalEstimate = 0.0; //Setting this to 0.0 effectively turns A* into Dijkstra\\n\\t\\t\\tdouble x = n.getRow(); \\n\\t\\t\\tdouble y = n.getColumn();\\n\\t\\t\\t\\n\\t\\t\\tx-= this.goal.getRow();\\n\\t\\t\\tx= x*x;\\n\\t\\t\\ty-= this.goal.getColumn();\\n\\t\\t\\ty= y*y;\\n\\t\\t\\t\\n\\t\\t\\ty = Math.sqrt(x+y);\\n\\t\\t\\t\\n\\t\\t\\tn.distanceToGoalEstimate=y;\\n\\t\\t\\t\\n \\treturn;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a20718a4be4d459dd778fbf859874d60\",\n \"score\": \"0.4674901\",\n \"text\": \"public double distanceToCoordinateCenter();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"23795a84a90a4d2eca609a75d09929dc\",\n \"score\": \"0.46709487\",\n \"text\": \"public float getCommonDistance(MeasuredShape s) {\\n\\t\\tfloat distance = 0;\\n\\t\\tint m = Math.min(segments.length, s.segments.length);\\n\\t\\tfor (int a = 0; a < m; a++) {\\n\\t\\t\\tif (segments[a].type != PathIterator.SEG_MOVETO\\n\\t\\t\\t\\t\\t&& s.segments[a].type != PathIterator.SEG_MOVETO) {\\n\\t\\t\\t\\tif (equal(segments[a].data[0], s.segments[a].data[0])\\n\\t\\t\\t\\t\\t\\t&& equal(segments[a].data[1], s.segments[a].data[1])\\n\\t\\t\\t\\t\\t\\t&& equal(\\n\\t\\t\\t\\t\\t\\t\\t\\tsegments[a].data[segments[a].data.length - 2],\\n\\t\\t\\t\\t\\t\\t\\t\\ts.segments[a].data[s.segments[a].data.length - 2])\\n\\t\\t\\t\\t\\t\\t&& equal(\\n\\t\\t\\t\\t\\t\\t\\t\\tsegments[a].data[segments[a].data.length - 1],\\n\\t\\t\\t\\t\\t\\t\\t\\ts.segments[a].data[s.segments[a].data.length - 1])\\n\\t\\t\\t\\t\\t\\t&& equal(segments[a].realDistance,\\n\\t\\t\\t\\t\\t\\t\\t\\ts.segments[a].realDistance)) {\\n\\t\\t\\t\\t\\tdistance += segments[a].realDistance;\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\treturn distance;\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else if (segments[a].type == PathIterator.SEG_MOVETO\\n\\t\\t\\t\\t\\t&& s.segments[a].type == PathIterator.SEG_MOVETO) {\\n\\t\\t\\t\\t// skip\\n\\t\\t\\t} else {\\n\\t\\t\\t\\treturn distance;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn distance;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d662b85702371e77cb18d65205e4ab8f\",\n \"score\": \"0.4663395\",\n \"text\": \"public int getPathWeight();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e202a5b1ceef91e5f2e15b74073ae74a\",\n \"score\": \"0.465675\",\n \"text\": \"private ListNode findMidPoint(ListNode head) {\\n if (head == null || head.next == null) return head;\\n ListNode slow = head, fast = head, prev = head;\\n while (fast != null && fast.next != null) {\\n fast = fast.next.next;\\n prev = slow;\\n slow = slow.next;\\n }\\n return prev;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e9feb2b884cc8f659ef56a148806ddd7\",\n \"score\": \"0.4653401\",\n \"text\": \"@MethodDef\\r\\n\\t\\tpublic String linkWithNDistances(AbstractGraphHandler agh,\\r\\n\\t\\t\\t\\t@ParameterDef (name=\\\"Desired number of vertices\\\") int numberOfNodes,\\r\\n\\t\\t\\t\\t@ParameterDef (name=\\\"Offset vector (e.g.\\\\\\\"1,2\\\\\\\")\\\") String offsetVector) {\\r\\n\\r\\n\\t\\t\\tString s = test(numberOfNodes);\\t\\r\\n\\t\\t\\tif (s != null) return s;\\r\\n\\t\\t\\tInteger[] rem = TypeParser.parseIntegerArray(offsetVector);\\r\\n\\t\\t\\tPolygonGenerator backGen =\\r\\n\\t\\t\\t\\tnew PolygonGenerator(numberOfNodes, 300, 350, 350, rem, false);\\r\\n\\r\\n\\t\\t\\tbackGen.generate(agh);\\r\\n\\t\\t\\treturn null;\\t\\r\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"db05a54c41bc6600db04a9398288cde6\",\n \"score\": \"0.46480843\",\n \"text\": \"public double getLength() {\\n\\n return (_poRight.getX() - _poLeft.getX());// same y plain to just distance between 2 points\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f06ab86b8acafd4a74e4e6d072142bea\",\n \"score\": \"0.46456382\",\n \"text\": \"public int relMap(float loc){\\n\\t\\tint relativeLoc = (int)(((4000 + loc) / 8000) * 128);\\n\\t\\treturn relativeLoc;\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"10874bf13022f6829dd0ed917cbe5b02\",\n \"score\": \"0.46286038\",\n \"text\": \"private static int getDirection(Point origin, Point point1, Point point2) {\\n Point vector1 = new Point(point1.x - origin.x, point1.y - origin.y, Point.Order.SECOND);\\n Point vector2 = new Point(point2.x - origin.x, point2.y - origin.y, Point.Order.SECOND);\\n\\n return vector1.y * vector2.x - vector1.x * vector2.y;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ac70c13f5aed6d7a1be350af75e88580\",\n \"score\": \"0.46285075\",\n \"text\": \"public static void test1(Location l1, Location l2) {\\n\\t\\tSystem.out.println(\\\"TEST-1\\\");\\n//\\t\\tLocation topLoc = new Location(-34.36338,-71.32979,50.0);\\n//\\t\\tLocation botLoc = new Location(-33.94507,-72.7105,10.0);\\n\\t\\tdouble numSubdivisions=100;\\n\\t\\tLocationVector dir = LocationUtils.vector(l1, l2);\\n\\t\\tSystem.out.println(\\\"Azimuth p1 to p2: \\\" + dir.getAzimuth());\\n\\t\\tdouble horzIncr = dir.getHorzDistance()/numSubdivisions;\\n\\t\\tdouble vertIncr = dir.getVertDistance()/numSubdivisions; // minus sign because vertDist is pos up and depth is pos down\\n\\t\\tdir.setHorzDistance(horzIncr);\\n\\t\\tdir.setVertDistance(vertIncr);\\n\\t\\tLocation prevLoc = l1;\\n\\t\\tfor(int r=0;r<numSubdivisions;r++) {\\n\\t\\t\\tLocation nextLoc = LocationUtils.location(prevLoc, dir);\\n\\t\\t\\tprevLoc = nextLoc;\\n\\t\\t}\\n\\t\\tdouble accuracyCheck = LocationUtils.linearDistanceFast(l2, prevLoc);\\n\\t\\tSystem.out.println(\\\"Distance between actual and computed bottom point = \\\"+(float)accuracyCheck);\\n\\t\\tSystem.out.println(\\\"DeltaLat = \\\"+ (float)((l2.getLatitude()-prevLoc.getLatitude())*111));\\n\\t\\tSystem.out.println(\\\"DeltaLon = \\\"+ (float)((l2.getLongitude()-prevLoc.getLongitude())*111));\\n\\t\\tSystem.out.println(\\\"DeltaDepth = \\\"+ (float)(l2.getDepth()-prevLoc.getDepth()));\\n\\t\\tSystem.out.println(\\\"\\\");\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dc3135d11022f402f24f4de1b755c1c0\",\n \"score\": \"0.46279478\",\n \"text\": \"private double distanceFactor(double x1, double y1, double r1, double x2, double y2, double r2) {\\n\\t\\tdouble dx = x2 - x1;\\n\\t\\tdouble dy = y2 - y1;\\n\\t\\tdouble sr = r1 + r2;\\n\\t\\treturn (dx * dx + dy * dy) / (sr * sr);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d55252115d2ca9bb6dfb7e5fe346ff46\",\n \"score\": \"0.46220863\",\n \"text\": \"public void inferRelativeEndPosition() {\\r\\n int width = getParent().getWidth() - getX();\\r\\n if (this.mOrientation == 0) {\\r\\n width = getParent().getHeight() - getY();\\r\\n }\\r\\n setGuideEnd(width);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a051f7b5e66ac784e199a3fa3bbd00ba\",\n \"score\": \"0.4617227\",\n \"text\": \"int getLonOffset();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a051f7b5e66ac784e199a3fa3bbd00ba\",\n \"score\": \"0.4617227\",\n \"text\": \"int getLonOffset();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a051f7b5e66ac784e199a3fa3bbd00ba\",\n \"score\": \"0.4617227\",\n \"text\": \"int getLonOffset();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a051f7b5e66ac784e199a3fa3bbd00ba\",\n \"score\": \"0.4617227\",\n \"text\": \"int getLonOffset();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fa61c05e29f7bc7d431980e37ddb5081\",\n \"score\": \"0.46111533\",\n \"text\": \"public double maxRelativeOffsetFromCenter() {\\n return this.maxRelativeOffset;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e4d156195a1dad55fc786496e512d18e\",\n \"score\": \"0.46103272\",\n \"text\": \"public int getDistanceTo(Node node) {\\r\\n return distanceWeights.get(node);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8ec5dc7a60ec562f7506ec75868aa630\",\n \"score\": \"0.46044135\",\n \"text\": \"private static double distanceToPoint(Point p, int x1, int y1, int x2,\\n int y2) {\\n if (x1 == x2) // vertical segment?\\n return (double) (Math.abs(p.x - x1)); // yes, use horizontal distance\\n else if (y1 == y2) // horizontal segment?\\n return (double) (Math.abs(p.y - y1)); // yes, use vertical distance\\n else {\\n // Here, we know that the segment is neither vertical nor\\n // horizontal.\\n // Compute m, the slope of the line containing the segment.\\n double m = ((double) (y1 - y2)) / ((double) (x1 - x2));\\n\\n // Compute mperp, the slope of the line perpendicular to the\\n // segment.\\n double mperp = -1.0 / m;\\n\\n // Compute the (x, y) intersection of the line containing the\\n // segment and the line that is perpendicular to the segment and that\\n // contains Point p.\\n double x = (((double) y1) - ((double) p.y) - (m * x1) + (mperp * p.x))\\n / (mperp - m);\\n double y = m * (x - x1) + y1;\\n\\n // Return the distance between Point p and (x, y).\\n return Math.sqrt(Math.pow(p.x - x, 2) + Math.pow(p.y - y, 2));\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ee29918bc277cfde038ddac4445471fc\",\n \"score\": \"0.46017724\",\n \"text\": \"public static final float distancePointToSegment(Point2f p, Point2f s1, Point2f s2) {\\n\\t\\tfloat r_denomenator = (s2.getX()-s1.getX())*(s2.getX()-s1.getX()) + (s2.getY()-s1.getY())*(s2.getY()-s1.getY());\\n\\t\\tif (r_denomenator==0f) return p.distance(s1);\\n\\t\\tfloat r_numerator = (p.getX()-s1.getX())*(s2.getX()-s1.getX()) + (p.getY()-s1.getY())*(s2.getY()-s1.getY());\\n\\t\\tfloat ratio = r_numerator / r_denomenator;\\n\\n\\t\\tif (ratio<=0.) {\\n\\t\\t\\treturn (float)Math.sqrt((p.getX()-s1.getX())*(p.getX()-s1.getX()) + (p.getY()-s1.getY())*(p.getY()-s1.getY()));\\n\\t\\t}\\n\\n\\t\\tif (ratio>=1f) {\\n\\t\\t\\treturn (float)Math.sqrt((p.getX()-s2.getX())*(p.getX()-s2.getX()) + (p.getY()-s2.getY())*(p.getY()-s2.getY()));\\n\\t\\t}\\n\\n\\t\\tfloat s = ((s1.getY()-p.getY())*(s2.getX()-s1.getX())-(s1.getX()-p.getX())*(s2.getY()-s1.getY()) ) / r_denomenator;\\n\\t\\treturn (float)(Math.abs(s) * Math.sqrt(r_denomenator));\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9b52c570b990d52024925c1cfb05c0e7\",\n \"score\": \"0.45965743\",\n \"text\": \"protected double getDistance(Operations.MutInt a, Operations.MutInt b)\\r\\n/* 126: */ {\\r\\n/* 127:109 */ return Math.abs(a.foo - b.foo);\\r\\n/* 128: */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ec0605ee41d86ad19e262b84fd362579\",\n \"score\": \"0.4591739\",\n \"text\": \"public int calculateDistance(final int source, final int destination);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3cb2d5fe45ca44482d4eb9684790a00a\",\n \"score\": \"0.4586276\",\n \"text\": \"public double pseudoDistance(final Vector3d point) {\\n\\t\\treturn normal.dot(point) - constant;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"79e34801464c60163875d98f5d6021e9\",\n \"score\": \"0.45847622\",\n \"text\": \"public double calcDistance(Body b) {\\n double dist = Math.pow((b.xxPos - this.xxPos),2.0) + Math.pow((b.yyPos - this.yyPos),2.0);\\n return Math.sqrt(dist);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e5f5a77fd6e56262c769b46251543c7f\",\n \"score\": \"0.45701894\",\n \"text\": \"public double getRelDelta(double destAngle, double heading) {\\n return (heading-destAngle);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a38c9b152fd1220303ff2663bfe87198\",\n \"score\": \"0.45630985\",\n \"text\": \"private int getDistanceToTarget(Node node, Node target) {\\n\\n Optional<Edge> edge = allEdges.stream().filter(s -> s.getSource().equals(node))\\n .filter(e -> e.getDest().equals(target)).findFirst();\\n if (edge.isPresent()) {\\n return edge.get().length();\\n } else {\\n throw new IllegalArgumentException(\\\"Error: Edge not found\\\");\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6d4956baf7295308c9b182505feda49f\",\n \"score\": \"0.45537877\",\n \"text\": \"private double DistanceAngle(double LatA, double LongA, double LatB, double LongB) {\\n\\t\\tdouble dlon = LongB - LongA;\\n\\t\\tdouble dlat = LatB - LatA;\\n\\t\\t/*\\n\\t\\t * Haversine formula\\n\\t\\t * http://www.movable-type.co.uk/scripts/GIS-FAQ-5.1.html R.W. Sinnott,\\n\\t\\t * Virtues of the Haversine, Sky and Telescope, vol. 68, no. 2, 1984, p.\\n\\t\\t * 159\\n\\t\\t */\\n\\t\\tdouble sindlat2 = SMath.sin(dlat / 2);\\n\\t\\tdouble sindlon2 = SMath.sin(dlon / 2);\\n\\t\\tdouble corde = sindlat2 * sindlat2 + SMath.cos(LatA) * SMath.cos(LatB) * sindlon2 * sindlon2;\\n\\t\\tif (corde > 1)\\n\\t\\t\\tcorde = 1;\\n\\t\\treturn 2 * SMath.asin(SMath.sqrt(corde));\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"924444fa8f28aa1d7c48cd9c144d697a\",\n \"score\": \"0.45535868\",\n \"text\": \"private static double estimatedDistance(GraphDB g, long id, long endPoint) {\\n return g.distance(id, endPoint);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"48822f7fe635c391924cd901e59ebe3d\",\n \"score\": \"0.45490193\",\n \"text\": \"void getRelPointPos (double px, double py, double pz, DVector3 result);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c6da9ccf44ca2f979fe3fccbdb37e72f\",\n \"score\": \"0.45485958\",\n \"text\": \"double getHorizToVertRatio() {\\n double horizEdges = 0;\\n double vertEdges = 0;\\n for (Edge e : this.edgesInMaze) {\\n if (e.getDest().x != e.getSrc().x) {\\n horizEdges += 1;\\n }\\n else {\\n vertEdges += 1;\\n }\\n }\\n\\n return horizEdges / vertEdges;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a8e39cf7c3ff4fffe6cfcce3ebc6b52\",\n \"score\": \"0.45442906\",\n \"text\": \"private double getPathLengthCrossingPoint(double slope_1, double z0_1, double slope_2, double z0_2) {\\n double s; //path length\\n s = (z0_1 - z0_2) / (slope_2 - slope_1);\\n return s;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"97e4f59bbdef1f9a880e3aa67d13d623\",\n \"score\": \"0.45429417\",\n \"text\": \"public double getDistanceFromEncoderValues() {\\n\\t\\tdouble leftDistance = Math.abs(leftDriveLead.getEncPosition());\\n\\t\\tdouble rightDistance = Math.abs(rightDriveLead.getEncPosition());\\n\\t\\tdouble robotDistance = (leftDistance + rightDistance) / 2;\\n\\t\\treturn robotDistance;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"10a7eda4fa2134b1bb050ed1ad73ecc6\",\n \"score\": \"0.45421448\",\n \"text\": \"void getPosRelPoint (double px, double py, double pz, DVector3 result);\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":983198,"cells":{"query_id":{"kind":"string","value":"efac239cf8c7cd057e820fdc7ed771aa"},"query":{"kind":"string","value":"Gets the riesgo value for this Vtbur_infocalkubo."},"positive_passages":{"kind":"list like","value":[{"docid":"0c492dc36ae15bf01269c3f924dc758e","score":"0.72356236","text":"public java.lang.String getRiesgo() {\n return riesgo;\n }","title":""}],"string":"[\n {\n \"docid\": \"0c492dc36ae15bf01269c3f924dc758e\",\n \"score\": \"0.72356236\",\n \"text\": \"public java.lang.String getRiesgo() {\\n return riesgo;\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"ae073ed403807dd8d296c10f40274944","score":"0.6170198","text":"public String getRaza() {\r\n\t\treturn raza;\r\n\t}","title":""},{"docid":"5ab16b2eda4d1a8b0b890c8039e78168","score":"0.6009843","text":"public SiacRSoggettoRelaz getSiacRSoggettoRelaz() {\n\t\treturn this.siacRSoggettoRelaz;\n\t}","title":""},{"docid":"46d8ae3c40c955a79eaee4c294b4514d","score":"0.6006956","text":"public int getRaca() {\r\n return raca;\r\n }","title":""},{"docid":"f85ffca108d3b90b507642d57012c98c","score":"0.5894463","text":"public java.lang.String getTipoRiesgo(){\r\n return localTipoRiesgo;\r\n }","title":""},{"docid":"4d0f64ac5cda1ed6c048962cd0855bc9","score":"0.58245254","text":"public Opzioni getOpzioneRicerca() {\n /* variabili e costanti locali di lavoro */\n Opzioni opzione = null;\n Campo campo;\n Object oggetto;\n\n try { // prova ad eseguire il codice\n campo = this.getCampoOpzioni();\n oggetto = campo.getValoreElenco();\n if (oggetto instanceof Opzioni) {\n opzione = (Opzioni)oggetto;\n }// fine del blocco if\n } catch (Exception unErrore) { // intercetta l'errore\n Errore.crea(unErrore);\n } // fine del blocco try-catch\n\n /* valore di ritorno */\n return opzione;\n }","title":""},{"docid":"296a452a83c08a810b19f296b067e0c1","score":"0.57584256","text":"public void setRiesgo(java.lang.String riesgo) {\n this.riesgo = riesgo;\n }","title":""},{"docid":"b686152ce14e73fe2a42a3f38a3968b4","score":"0.5749115","text":"public String getRue() {\n\t\treturn rue;\n\t}","title":""},{"docid":"4d099517d7e17aa4129d6adaaaf0be51","score":"0.5698924","text":"public String getReco() {\n return reco;\n }","title":""},{"docid":"09adb2d05dc0cc01050acb202372565d","score":"0.5672278","text":"public int getRolagem() {\r\n return rolagem;\r\n }","title":""},{"docid":"2361b2bd2f3dfa060a36c6877e2d2b11","score":"0.56674916","text":"public java.lang.String getVchusurol() {\r\n return vchusurol;\r\n }","title":""},{"docid":"f09228e20a465678453ff0e619ec3f26","score":"0.5645783","text":"public String getKleur() {\n return kleur;\n }","title":""},{"docid":"c027357276f7baf048db69d2a5942118","score":"0.55524325","text":"public double getRaggio() {\n return raggio;\n }","title":""},{"docid":"a855fbcaa554227271531e827a25f114","score":"0.55477905","text":"public String getRamo() {\n return ramo;\n }","title":""},{"docid":"313a5be18a0d61e4c6d6c91fb030614a","score":"0.5541965","text":"public String getRuc()\n/* 75: */ {\n/* 76:191 */ return this.ruc;\n/* 77: */ }","title":""},{"docid":"93f024c5b1e8c192e85e95390bfb9ef7","score":"0.55335116","text":"public BigDecimal getRutIra()\r\n {\r\n return rutIra;\r\n }","title":""},{"docid":"d0ae2797a59707701fa84c9c9edba461","score":"0.55131954","text":"public String getBrojRacuna() {\n return brojRacuna;\n }","title":""},{"docid":"82bcef42595f62d06570d8b88b3c9dda","score":"0.5501156","text":"public String getROAD() {\n\t\treturn ROAD;\n\t}","title":""},{"docid":"3cf5a1df8896918cb32e837e2b4158e0","score":"0.5478348","text":"public String getRutIraDv()\r\n {\r\n return rutIraDv;\r\n }","title":""},{"docid":"cff2926666c5a0affbc79a858dc095a7","score":"0.5426843","text":"public double getResto() {\n return resto;\n }","title":""},{"docid":"ba0f1463c1cbfdbcc141e42bdbe790ec","score":"0.53779095","text":"public String getRango() {\n return rango;\n }","title":""},{"docid":"5670ffc4e911953310b34965f46b09f4","score":"0.53582406","text":"public String getRisco() {\n\t\treturn risco;\n\t}","title":""},{"docid":"826a6029fd5aad6cc64e361b805b6798","score":"0.53432083","text":"public Integer getReecom() {\n return reecom;\n }","title":""},{"docid":"d1e0b3a1262873c0be876585203382d5","score":"0.5339943","text":"public String toString(){\n return \"Cerchio di raggio: \" + getRaggio();\n }","title":""},{"docid":"e62b02bba5d0c6f9fd89e4dbd6b8c56d","score":"0.53156495","text":"public java.lang.String getCrol();","title":""},{"docid":"0838ddb835d203966d578cc9e5c59f77","score":"0.53128886","text":"public String getCzrmc() {\r\n return czrmc;\r\n }","title":""},{"docid":"53df49fd0aad9683b44c0b1d8944b8ba","score":"0.5302068","text":"public int getResourcenri() {\n\treturn resourcenri;\n}","title":""},{"docid":"4ed75ce3dfe79b0dd88e03b4ff9802f5","score":"0.52995485","text":"public long getRpo() {\r\n return rpo;\r\n }","title":""},{"docid":"239ad09623e7de4b83dc078523d21927","score":"0.52903867","text":"public Cri getCri() {\n return this.cri;\n }","title":""},{"docid":"5311badf87f32914a7f3d6b1b341a7ad","score":"0.5283549","text":"public java.lang.String getValor_rcp() {\n\t\treturn dataCacheEntry.getValor_rcp();\n\t}","title":""},{"docid":"3fa68c1d2c04673335075a11134bb819","score":"0.52835125","text":"public String getOreSvolte() {\n return oreSvolte;\n }","title":""},{"docid":"27b13afcf2bc6913f16d921d304203fc","score":"0.5282676","text":"public int getOvregrans()\n {\n synchronized (monitor())\n {\n check_orphaned();\n org.apache.xmlbeans.SimpleValue target = null;\n target = (org.apache.xmlbeans.SimpleValue)get_store().find_element_user(OVREGRANS$2, 0);\n if (target == null)\n {\n return 0;\n }\n return target.getIntValue();\n }\n }","title":""},{"docid":"af4d2818798519d787c735e407188df0","score":"0.5281386","text":"public CANJaguar getRearRight() \n\t{\n\t\treturn rr;\n\t}","title":""},{"docid":"44e9c5a82b91a195fd6af556dba478c5","score":"0.5275633","text":"public String getRue1() {\n\t\treturn rue1;\n\t}","title":""},{"docid":"56c3c97c068eb5e5180ab4442076c9c7","score":"0.52712077","text":"@Override\n public String toString() {\n return Arrays.toString(riesenie);\n }","title":""},{"docid":"80b107cecd037d20366f8bd32e6a8f98","score":"0.52510965","text":"public java.lang.String getRecursoURL()\r\n {\r\n return this.recursoURL;\r\n }","title":""},{"docid":"60c81a7a0667c7c078b7debf6022bb1b","score":"0.5240305","text":"public double getTirCompra() {\r\n return tirCompra;\r\n }","title":""},{"docid":"03ea3cbe4c7efb3ac86f96dfac2a48f1","score":"0.52398586","text":"Rete getRete() {\r\n return this.rete;\r\n }","title":""},{"docid":"b71e89a94c93d153528ab75201a7a4d1","score":"0.5222426","text":"public com.floreantpos.model.Recepie getRecepie() {\r\n\t\treturn recepie;\r\n\t}","title":""},{"docid":"48b0fbe5c575b033b06537cc383b41d5","score":"0.5207583","text":"public String getRebacktype() {\n return rebacktype;\n }","title":""},{"docid":"d2856a557883a07382e36785daa6c027","score":"0.5187343","text":"public java.lang.String getCalificacion_kubo() {\n return calificacion_kubo;\n }","title":""},{"docid":"474504fc30312b02ab4b8f5aa2017ede","score":"0.5182914","text":"public int getVergiOrani() {\n return vergiOrani;\n }","title":""},{"docid":"ffaa3729c76ed72a028b68389b860ff1","score":"0.5174202","text":"public java.lang.String getRecibo() {\n return recibo;\n }","title":""},{"docid":"b2b74a4936af5b3dbea4a883b0d0bd1b","score":"0.51699287","text":"public String getRutReceptor();","title":""},{"docid":"6701ed20e0215efb4e68df246a42ebab","score":"0.5154425","text":"public String toString() {\n\t\treturn Carte.VALEURS.get(this.valeur) + \"_of_\" + Carte.COULEURS.get(this.couleur);\n\t}","title":""},{"docid":"bdd9c8ca717bdd864c78b9d24f212544","score":"0.5134751","text":"public int getBrojGlasovaUzdrzani() {\n return brojGlasovaUzdrzani;\n }","title":""},{"docid":"0c53c7885f1d6c242785fd7640652599","score":"0.5130451","text":"public dataImport.StandardPoangType2.Ovregrans xgetOvregrans()\n {\n synchronized (monitor())\n {\n check_orphaned();\n dataImport.StandardPoangType2.Ovregrans target = null;\n target = (dataImport.StandardPoangType2.Ovregrans)get_store().find_element_user(OVREGRANS$2, 0);\n return target;\n }\n }","title":""},{"docid":"e01aa95c3365edb812be0e46ceecb629","score":"0.51286566","text":"public BigDecimal getCLI_RESCH_GL() {\r\n return CLI_RESCH_GL;\r\n }","title":""},{"docid":"7af3a0a786948074ef8e42cc196cc5f0","score":"0.5126068","text":"public java.lang.String getData_recibo() {\n return data_recibo;\n }","title":""},{"docid":"0b0764d7884c377cf160f2e0f7b7425e","score":"0.511978","text":"public com.guidewire.gx.com_lv_nucleus_claimstracking_gx_ClaimsTrackingModel.VehicleIncidentVehicleRU getVehicleRU() {\n return vehicleRU;\n }","title":""},{"docid":"75b60774baf6ac46372ab666a1bcb8f6","score":"0.51015913","text":"public long getBlurRad()\n {\n synchronized (monitor())\n {\n check_orphaned();\n org.apache.xmlbeans.SimpleValue target = null;\n target = (org.apache.xmlbeans.SimpleValue)get_store().find_attribute_user(BLURRAD$12);\n if (target == null)\n {\n target = (org.apache.xmlbeans.SimpleValue)get_default_attribute_value(BLURRAD$12);\n }\n if (target == null)\n {\n return 0L;\n }\n return target.getLongValue();\n }\n }","title":""},{"docid":"2cc859dcf05b80f422c7add72b767a2d","score":"0.50882465","text":"public java.lang.String getRendimiento(){\r\n return localRendimiento;\r\n }","title":""},{"docid":"9fe79bf53a7cb2a6d6a552a3961dea59","score":"0.50691885","text":"public String getClientright() {\r\n return clientright;\r\n }","title":""},{"docid":"6b8483680925fa2c05a3ab43f7e61c8a","score":"0.50633407","text":"public String getCouleur() {\r\n\t\treturn couleur;\r\n\t}","title":""},{"docid":"6b8483680925fa2c05a3ab43f7e61c8a","score":"0.50633407","text":"public String getCouleur() {\r\n\t\treturn couleur;\r\n\t}","title":""},{"docid":"ee0f40e9cf6d6e0a6c0693223307be13","score":"0.5061818","text":"public String getRiepilogo() {\n return riepilogo;\n }","title":""},{"docid":"6c31c5551f4b9b51a1d091cfde4e3ade","score":"0.50581074","text":"public String getRector(){\n\t\treturn r_name+\" \"+r_last;\n\t}","title":""},{"docid":"55c77d27e6614a7280d4ec0d2416549c","score":"0.50554216","text":"public String getRekap() {\r\n return String.format(\r\n \"Pakaian %s\\n\" + \r\n \"Bobot: %d\\n\" + \r\n \"Ukuran: %c\\n\" +\r\n\t\t\t\"Warna: %s\", \r\n super.getNama(), super.getBobot(), this.ukuran, this.warna);\r\n }","title":""},{"docid":"0cee92b2abf2837f1188cbbe072df522","score":"0.50549585","text":"private GObject getRudder() {\n\n\t\tdouble x = getWidth() / 2 - GAirplaneConstants.RUDDER_WIDTH / 2;\n\t\tdouble y = GAirplaneConstants.TOTAL_WINDOW_RATIO * getHeight() - GAirplaneConstants.RUDDER_HEIGHT;\n\t\tdouble width = GAirplaneConstants.RUDDER_WIDTH;\n\t\tdouble height = GAirplaneConstants.RUDDER_HEIGHT;\n\t\tGOval rudder = new GOval(x, y, width, height);\n\t\trudder.setFilled(true);\n\t\trudder.setFillColor(Color.BLUE);\n\t\treturn rudder;\n\t}","title":""},{"docid":"7d7fe8fb9e393990fd5a142a450a65fc","score":"0.5053261","text":"public ImageIcon getRojo() {\n return rojo;\n }","title":""},{"docid":"7d39723dd4a2fc83444c1b5f15ce6103","score":"0.5046208","text":"@Override\n\tpublic java.lang.String getDati_richiedente() {\n\t\treturn _richiestaPubblicSiti.getDati_richiedente();\n\t}","title":""},{"docid":"1e1224b86568f3a16980c65244075c33","score":"0.5045057","text":"public Nodo getRaiz() {\n return raiz;\n }","title":""},{"docid":"00fabbe7bf675ff63371508b0aff6f5c","score":"0.5042004","text":"public String getRamal() {\r\n return ramal;\r\n }","title":""},{"docid":"2af50c138ea0352ce69322c680377634","score":"0.50387734","text":"public Object getRValue() {\n return rValue;\n }","title":""},{"docid":"68db49b941ab55d38e0cddf6c1322774","score":"0.50374246","text":"public SiacDRelazTipo getSiacDRelazTipo() {\n\t\treturn this.siacDRelazTipo;\n\t}","title":""},{"docid":"8e12f7774315d802d7a8ede85fa8b78e","score":"0.5031585","text":"public java.lang.String getBur_solnum() {\n return bur_solnum;\n }","title":""},{"docid":"d9f3952feaf6a719d3301aad1f55878f","score":"0.5031422","text":"public TipoRisultato getRisultato() {\n return risultato;\n }","title":""},{"docid":"c8726cef746a4bff8be342570c334626","score":"0.5021988","text":"public String getRise()\n\t{\n\t\treturn sunrise.replace('T', ' ');\n\t}","title":""},{"docid":"469f6bf8732f8a39ce7f1da2edb49b5d","score":"0.5021181","text":"@Override\r\n\tpublic java.lang.String getCuLy() {\r\n\t\treturn _qlvtXuLyGpLienVan.getCuLy();\r\n\t}","title":""},{"docid":"9794f5fe304e549206ba5c93bd2c0e26","score":"0.501614","text":"public BigDecimal getRESCH_GL() {\r\n return RESCH_GL;\r\n }","title":""},{"docid":"9e0555753d6efff09aa9e4b1bbff36d1","score":"0.5007661","text":"public int getArmourValue() {\r\n return armourValue;\r\n }","title":""},{"docid":"1e6cd6d6453beb7b8df99df5bfc38d9b","score":"0.5006771","text":"public String getRUCEmisor();","title":""},{"docid":"153f895d35fc29f849a02c5717b76dbe","score":"0.49891222","text":"public com.besixplus.sii.objects.Cgg_veh_color getCgg_veh_color(){\n\t\treturn this.myCgg_veh_color;\n\t}","title":""},{"docid":"caa7b625f5eda42c87152a37edc14998","score":"0.49747908","text":"public BigDecimal getROLLOVER_GL() {\r\n return ROLLOVER_GL;\r\n }","title":""},{"docid":"efdfe7bd4d8d39595d72b11459a4e4b5","score":"0.4966899","text":"public java.lang.String getCORREO_ELECTRONICO(){\r\n return localCORREO_ELECTRONICO;\r\n }","title":""},{"docid":"8cddfe8450031896d9d2140befd65b70","score":"0.49626827","text":"public com.besixplus.sii.objects.Cgg_res_tramite_comite getCgg_res_tramite_comite(){\n\t\treturn this.myCgg_res_tramite_comite;\n\t}","title":""},{"docid":"1d8ff453f411249a39763ab008f44f3b","score":"0.4962291","text":"public byte getMyoRunStopReverse() {\n return myoRunStopReverse;\n }","title":""},{"docid":"ee049e4a4e7a2967ab00272e6d16dfeb","score":"0.49604493","text":"public Integer getIdTipoRecurso() {\n return idTipoRecurso;\n }","title":""},{"docid":"af8bd8f80309203b8c8ba43d988e6bc3","score":"0.49604213","text":"int getRtti();","title":""},{"docid":"0923f54b75dfb3022143f8b5133cf95a","score":"0.49554223","text":"public BigDecimal getBORROWING_GL() {\r\n return BORROWING_GL;\r\n }","title":""},{"docid":"e983a95360d258bbfe6fa05a1f572ab3","score":"0.49536642","text":"public BigDecimal getCLI_DFF_YER_REV_GL() {\r\n return CLI_DFF_YER_REV_GL;\r\n }","title":""},{"docid":"bfce694984c4445dde6370b861394078","score":"0.4952431","text":"public String getInfoOnLagnaRashi() {\n\t\treturn null;\r\n\t}","title":""},{"docid":"8cf2894e99a5fda076d06cccc1c3ba25","score":"0.4948466","text":"public int getCoraje() {\n\t\treturn this.coraje;\n\t}","title":""},{"docid":"85b087e2ed6c5ea5536dabed0bbc4779","score":"0.49464208","text":"@Override\n\tpublic String toString() {\n\t\treturn \"Rope\";\n\t}","title":""},{"docid":"c708222256cc6621a549d60b3cbf8d6a","score":"0.49464175","text":"@XmlElement(name = \"rpo_value\", required = false)\n public Long getRpoValue() {\n return rpoValue;\n }","title":""},{"docid":"3e13d76b9899766378b8b6a310323819","score":"0.49389473","text":"public synchronized String getIP_Rov() {\n return IP_Rov;\n }","title":""},{"docid":"8af9a42a3e337ca35d6e6ac8f096e5a8","score":"0.49326456","text":"@Override\n\tpublic String toString() {\n\t\treturn \"[CURSO: \" + nome + \", tempo total: \" + this.getTempoTotal() + \", Aulas: \" + this.aulas + \"]\";\n\t}","title":""},{"docid":"a1382cca6b00aa4b01bde60a7cabac2d","score":"0.49325898","text":"public java.lang.String getROADNAME() {\n return ROADNAME;\n }","title":""},{"docid":"e46d1323957901469400c1ebb16f32e5","score":"0.49322873","text":"public String getRecintoAduanero() {\r\n return recintoAduanero;\r\n }","title":""},{"docid":"f032ea93b5a3cc5145342f8f34bc3018","score":"0.49288884","text":"@Override\n\tpublic java.lang.String getRagioneSociale() {\n\t\treturn _anagrafica.getRagioneSociale();\n\t}","title":""},{"docid":"08cf8454704d9794c7590b7225becba8","score":"0.4922623","text":"public Vertice getOrigem() {\n return origem;\n }","title":""},{"docid":"76dc434205cacd091103e77ce98005dc","score":"0.49225754","text":"public String maisRico(){\n Barbaro e = null;\n for (Barbaro b : folhas) {\n if(e==null){\n e = b;\n }else{\n if(e.getTerras()<b.getTerras()){\n e=b;\n } \n }\n }\n return e.toString();\n }","title":""},{"docid":"b76569f4d789a418f76404b495b90ee2","score":"0.49223146","text":"public java.lang.String getTerminalRodoviarioOrigem() {\n return terminalRodoviarioOrigem;\n }","title":""},{"docid":"099f7d6f4092b442b8754370671b30e2","score":"0.49169445","text":"public List<Ponto> getRastro() {\r\n\treturn rastro;\r\n }","title":""},{"docid":"7a81f71763cc02a02412f20c315a8745","score":"0.49010357","text":"public Double getWeightedroe() {\n return weightedroe;\n }","title":""},{"docid":"29e18a2ab696257d62bfe1c16125a40e","score":"0.4899864","text":"public int getRa() {\n\t\treturn this.ra;\n\t}","title":""},{"docid":"f4e98b911babec13b3053557661c04b1","score":"0.48930863","text":"public double getKr() {\r\n return _kR;\r\n }","title":""},{"docid":"8a1690bed3d233e359f9e4f709a22ee5","score":"0.48870608","text":"public double getTeor_alcool() {\r\n\t\treturn teor_alcool;\r\n\t}","title":""},{"docid":"16ee47a5f4d5f8a99d2db9357c7c74b7","score":"0.48859495","text":"public Double getRataRata(){\n return rataRata;\n }","title":""},{"docid":"4f2766ae62d1a141f72d00255982bce7","score":"0.48857996","text":"public Radar getRadar() {\r\n return this.radar;\r\n }","title":""},{"docid":"ab8a380228147524169f08f7ef76dda6","score":"0.48804346","text":"public String getReintentar() {\r\n return reintentar;\r\n }","title":""}],"string":"[\n {\n \"docid\": \"ae073ed403807dd8d296c10f40274944\",\n \"score\": \"0.6170198\",\n \"text\": \"public String getRaza() {\\r\\n\\t\\treturn raza;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5ab16b2eda4d1a8b0b890c8039e78168\",\n \"score\": \"0.6009843\",\n \"text\": \"public SiacRSoggettoRelaz getSiacRSoggettoRelaz() {\\n\\t\\treturn this.siacRSoggettoRelaz;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"46d8ae3c40c955a79eaee4c294b4514d\",\n \"score\": \"0.6006956\",\n \"text\": \"public int getRaca() {\\r\\n return raca;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f85ffca108d3b90b507642d57012c98c\",\n \"score\": \"0.5894463\",\n \"text\": \"public java.lang.String getTipoRiesgo(){\\r\\n return localTipoRiesgo;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4d0f64ac5cda1ed6c048962cd0855bc9\",\n \"score\": \"0.58245254\",\n \"text\": \"public Opzioni getOpzioneRicerca() {\\n /* variabili e costanti locali di lavoro */\\n Opzioni opzione = null;\\n Campo campo;\\n Object oggetto;\\n\\n try { // prova ad eseguire il codice\\n campo = this.getCampoOpzioni();\\n oggetto = campo.getValoreElenco();\\n if (oggetto instanceof Opzioni) {\\n opzione = (Opzioni)oggetto;\\n }// fine del blocco if\\n } catch (Exception unErrore) { // intercetta l'errore\\n Errore.crea(unErrore);\\n } // fine del blocco try-catch\\n\\n /* valore di ritorno */\\n return opzione;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"296a452a83c08a810b19f296b067e0c1\",\n \"score\": \"0.57584256\",\n \"text\": \"public void setRiesgo(java.lang.String riesgo) {\\n this.riesgo = riesgo;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b686152ce14e73fe2a42a3f38a3968b4\",\n \"score\": \"0.5749115\",\n \"text\": \"public String getRue() {\\n\\t\\treturn rue;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4d099517d7e17aa4129d6adaaaf0be51\",\n \"score\": \"0.5698924\",\n \"text\": \"public String getReco() {\\n return reco;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"09adb2d05dc0cc01050acb202372565d\",\n \"score\": \"0.5672278\",\n \"text\": \"public int getRolagem() {\\r\\n return rolagem;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2361b2bd2f3dfa060a36c6877e2d2b11\",\n \"score\": \"0.56674916\",\n \"text\": \"public java.lang.String getVchusurol() {\\r\\n return vchusurol;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f09228e20a465678453ff0e619ec3f26\",\n \"score\": \"0.5645783\",\n \"text\": \"public String getKleur() {\\n return kleur;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c027357276f7baf048db69d2a5942118\",\n \"score\": \"0.55524325\",\n \"text\": \"public double getRaggio() {\\n return raggio;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a855fbcaa554227271531e827a25f114\",\n \"score\": \"0.55477905\",\n \"text\": \"public String getRamo() {\\n return ramo;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"313a5be18a0d61e4c6d6c91fb030614a\",\n \"score\": \"0.5541965\",\n \"text\": \"public String getRuc()\\n/* 75: */ {\\n/* 76:191 */ return this.ruc;\\n/* 77: */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"93f024c5b1e8c192e85e95390bfb9ef7\",\n \"score\": \"0.55335116\",\n \"text\": \"public BigDecimal getRutIra()\\r\\n {\\r\\n return rutIra;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d0ae2797a59707701fa84c9c9edba461\",\n \"score\": \"0.55131954\",\n \"text\": \"public String getBrojRacuna() {\\n return brojRacuna;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"82bcef42595f62d06570d8b88b3c9dda\",\n \"score\": \"0.5501156\",\n \"text\": \"public String getROAD() {\\n\\t\\treturn ROAD;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3cf5a1df8896918cb32e837e2b4158e0\",\n \"score\": \"0.5478348\",\n \"text\": \"public String getRutIraDv()\\r\\n {\\r\\n return rutIraDv;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cff2926666c5a0affbc79a858dc095a7\",\n \"score\": \"0.5426843\",\n \"text\": \"public double getResto() {\\n return resto;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ba0f1463c1cbfdbcc141e42bdbe790ec\",\n \"score\": \"0.53779095\",\n \"text\": \"public String getRango() {\\n return rango;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5670ffc4e911953310b34965f46b09f4\",\n \"score\": \"0.53582406\",\n \"text\": \"public String getRisco() {\\n\\t\\treturn risco;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"826a6029fd5aad6cc64e361b805b6798\",\n \"score\": \"0.53432083\",\n \"text\": \"public Integer getReecom() {\\n return reecom;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d1e0b3a1262873c0be876585203382d5\",\n \"score\": \"0.5339943\",\n \"text\": \"public String toString(){\\n return \\\"Cerchio di raggio: \\\" + getRaggio();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e62b02bba5d0c6f9fd89e4dbd6b8c56d\",\n \"score\": \"0.53156495\",\n \"text\": \"public java.lang.String getCrol();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0838ddb835d203966d578cc9e5c59f77\",\n \"score\": \"0.53128886\",\n \"text\": \"public String getCzrmc() {\\r\\n return czrmc;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"53df49fd0aad9683b44c0b1d8944b8ba\",\n \"score\": \"0.5302068\",\n \"text\": \"public int getResourcenri() {\\n\\treturn resourcenri;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4ed75ce3dfe79b0dd88e03b4ff9802f5\",\n \"score\": \"0.52995485\",\n \"text\": \"public long getRpo() {\\r\\n return rpo;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"239ad09623e7de4b83dc078523d21927\",\n \"score\": \"0.52903867\",\n \"text\": \"public Cri getCri() {\\n return this.cri;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5311badf87f32914a7f3d6b1b341a7ad\",\n \"score\": \"0.5283549\",\n \"text\": \"public java.lang.String getValor_rcp() {\\n\\t\\treturn dataCacheEntry.getValor_rcp();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3fa68c1d2c04673335075a11134bb819\",\n \"score\": \"0.52835125\",\n \"text\": \"public String getOreSvolte() {\\n return oreSvolte;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"27b13afcf2bc6913f16d921d304203fc\",\n \"score\": \"0.5282676\",\n \"text\": \"public int getOvregrans()\\n {\\n synchronized (monitor())\\n {\\n check_orphaned();\\n org.apache.xmlbeans.SimpleValue target = null;\\n target = (org.apache.xmlbeans.SimpleValue)get_store().find_element_user(OVREGRANS$2, 0);\\n if (target == null)\\n {\\n return 0;\\n }\\n return target.getIntValue();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"af4d2818798519d787c735e407188df0\",\n \"score\": \"0.5281386\",\n \"text\": \"public CANJaguar getRearRight() \\n\\t{\\n\\t\\treturn rr;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"44e9c5a82b91a195fd6af556dba478c5\",\n \"score\": \"0.5275633\",\n \"text\": \"public String getRue1() {\\n\\t\\treturn rue1;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"56c3c97c068eb5e5180ab4442076c9c7\",\n \"score\": \"0.52712077\",\n \"text\": \"@Override\\n public String toString() {\\n return Arrays.toString(riesenie);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80b107cecd037d20366f8bd32e6a8f98\",\n \"score\": \"0.52510965\",\n \"text\": \"public java.lang.String getRecursoURL()\\r\\n {\\r\\n return this.recursoURL;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"60c81a7a0667c7c078b7debf6022bb1b\",\n \"score\": \"0.5240305\",\n \"text\": \"public double getTirCompra() {\\r\\n return tirCompra;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"03ea3cbe4c7efb3ac86f96dfac2a48f1\",\n \"score\": \"0.52398586\",\n \"text\": \"Rete getRete() {\\r\\n return this.rete;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b71e89a94c93d153528ab75201a7a4d1\",\n \"score\": \"0.5222426\",\n \"text\": \"public com.floreantpos.model.Recepie getRecepie() {\\r\\n\\t\\treturn recepie;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"48b0fbe5c575b033b06537cc383b41d5\",\n \"score\": \"0.5207583\",\n \"text\": \"public String getRebacktype() {\\n return rebacktype;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d2856a557883a07382e36785daa6c027\",\n \"score\": \"0.5187343\",\n \"text\": \"public java.lang.String getCalificacion_kubo() {\\n return calificacion_kubo;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"474504fc30312b02ab4b8f5aa2017ede\",\n \"score\": \"0.5182914\",\n \"text\": \"public int getVergiOrani() {\\n return vergiOrani;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ffaa3729c76ed72a028b68389b860ff1\",\n \"score\": \"0.5174202\",\n \"text\": \"public java.lang.String getRecibo() {\\n return recibo;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b2b74a4936af5b3dbea4a883b0d0bd1b\",\n \"score\": \"0.51699287\",\n \"text\": \"public String getRutReceptor();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6701ed20e0215efb4e68df246a42ebab\",\n \"score\": \"0.5154425\",\n \"text\": \"public String toString() {\\n\\t\\treturn Carte.VALEURS.get(this.valeur) + \\\"_of_\\\" + Carte.COULEURS.get(this.couleur);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bdd9c8ca717bdd864c78b9d24f212544\",\n \"score\": \"0.5134751\",\n \"text\": \"public int getBrojGlasovaUzdrzani() {\\n return brojGlasovaUzdrzani;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0c53c7885f1d6c242785fd7640652599\",\n \"score\": \"0.5130451\",\n \"text\": \"public dataImport.StandardPoangType2.Ovregrans xgetOvregrans()\\n {\\n synchronized (monitor())\\n {\\n check_orphaned();\\n dataImport.StandardPoangType2.Ovregrans target = null;\\n target = (dataImport.StandardPoangType2.Ovregrans)get_store().find_element_user(OVREGRANS$2, 0);\\n return target;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e01aa95c3365edb812be0e46ceecb629\",\n \"score\": \"0.51286566\",\n \"text\": \"public BigDecimal getCLI_RESCH_GL() {\\r\\n return CLI_RESCH_GL;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7af3a0a786948074ef8e42cc196cc5f0\",\n \"score\": \"0.5126068\",\n \"text\": \"public java.lang.String getData_recibo() {\\n return data_recibo;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b0764d7884c377cf160f2e0f7b7425e\",\n \"score\": \"0.511978\",\n \"text\": \"public com.guidewire.gx.com_lv_nucleus_claimstracking_gx_ClaimsTrackingModel.VehicleIncidentVehicleRU getVehicleRU() {\\n return vehicleRU;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"75b60774baf6ac46372ab666a1bcb8f6\",\n \"score\": \"0.51015913\",\n \"text\": \"public long getBlurRad()\\n {\\n synchronized (monitor())\\n {\\n check_orphaned();\\n org.apache.xmlbeans.SimpleValue target = null;\\n target = (org.apache.xmlbeans.SimpleValue)get_store().find_attribute_user(BLURRAD$12);\\n if (target == null)\\n {\\n target = (org.apache.xmlbeans.SimpleValue)get_default_attribute_value(BLURRAD$12);\\n }\\n if (target == null)\\n {\\n return 0L;\\n }\\n return target.getLongValue();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2cc859dcf05b80f422c7add72b767a2d\",\n \"score\": \"0.50882465\",\n \"text\": \"public java.lang.String getRendimiento(){\\r\\n return localRendimiento;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9fe79bf53a7cb2a6d6a552a3961dea59\",\n \"score\": \"0.50691885\",\n \"text\": \"public String getClientright() {\\r\\n return clientright;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6b8483680925fa2c05a3ab43f7e61c8a\",\n \"score\": \"0.50633407\",\n \"text\": \"public String getCouleur() {\\r\\n\\t\\treturn couleur;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6b8483680925fa2c05a3ab43f7e61c8a\",\n \"score\": \"0.50633407\",\n \"text\": \"public String getCouleur() {\\r\\n\\t\\treturn couleur;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ee0f40e9cf6d6e0a6c0693223307be13\",\n \"score\": \"0.5061818\",\n \"text\": \"public String getRiepilogo() {\\n return riepilogo;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6c31c5551f4b9b51a1d091cfde4e3ade\",\n \"score\": \"0.50581074\",\n \"text\": \"public String getRector(){\\n\\t\\treturn r_name+\\\" \\\"+r_last;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"55c77d27e6614a7280d4ec0d2416549c\",\n \"score\": \"0.50554216\",\n \"text\": \"public String getRekap() {\\r\\n return String.format(\\r\\n \\\"Pakaian %s\\\\n\\\" + \\r\\n \\\"Bobot: %d\\\\n\\\" + \\r\\n \\\"Ukuran: %c\\\\n\\\" +\\r\\n\\t\\t\\t\\\"Warna: %s\\\", \\r\\n super.getNama(), super.getBobot(), this.ukuran, this.warna);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0cee92b2abf2837f1188cbbe072df522\",\n \"score\": \"0.50549585\",\n \"text\": \"private GObject getRudder() {\\n\\n\\t\\tdouble x = getWidth() / 2 - GAirplaneConstants.RUDDER_WIDTH / 2;\\n\\t\\tdouble y = GAirplaneConstants.TOTAL_WINDOW_RATIO * getHeight() - GAirplaneConstants.RUDDER_HEIGHT;\\n\\t\\tdouble width = GAirplaneConstants.RUDDER_WIDTH;\\n\\t\\tdouble height = GAirplaneConstants.RUDDER_HEIGHT;\\n\\t\\tGOval rudder = new GOval(x, y, width, height);\\n\\t\\trudder.setFilled(true);\\n\\t\\trudder.setFillColor(Color.BLUE);\\n\\t\\treturn rudder;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7d7fe8fb9e393990fd5a142a450a65fc\",\n \"score\": \"0.5053261\",\n \"text\": \"public ImageIcon getRojo() {\\n return rojo;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7d39723dd4a2fc83444c1b5f15ce6103\",\n \"score\": \"0.5046208\",\n \"text\": \"@Override\\n\\tpublic java.lang.String getDati_richiedente() {\\n\\t\\treturn _richiestaPubblicSiti.getDati_richiedente();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1e1224b86568f3a16980c65244075c33\",\n \"score\": \"0.5045057\",\n \"text\": \"public Nodo getRaiz() {\\n return raiz;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"00fabbe7bf675ff63371508b0aff6f5c\",\n \"score\": \"0.5042004\",\n \"text\": \"public String getRamal() {\\r\\n return ramal;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2af50c138ea0352ce69322c680377634\",\n \"score\": \"0.50387734\",\n \"text\": \"public Object getRValue() {\\n return rValue;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"68db49b941ab55d38e0cddf6c1322774\",\n \"score\": \"0.50374246\",\n \"text\": \"public SiacDRelazTipo getSiacDRelazTipo() {\\n\\t\\treturn this.siacDRelazTipo;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8e12f7774315d802d7a8ede85fa8b78e\",\n \"score\": \"0.5031585\",\n \"text\": \"public java.lang.String getBur_solnum() {\\n return bur_solnum;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d9f3952feaf6a719d3301aad1f55878f\",\n \"score\": \"0.5031422\",\n \"text\": \"public TipoRisultato getRisultato() {\\n return risultato;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c8726cef746a4bff8be342570c334626\",\n \"score\": \"0.5021988\",\n \"text\": \"public String getRise()\\n\\t{\\n\\t\\treturn sunrise.replace('T', ' ');\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"469f6bf8732f8a39ce7f1da2edb49b5d\",\n \"score\": \"0.5021181\",\n \"text\": \"@Override\\r\\n\\tpublic java.lang.String getCuLy() {\\r\\n\\t\\treturn _qlvtXuLyGpLienVan.getCuLy();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9794f5fe304e549206ba5c93bd2c0e26\",\n \"score\": \"0.501614\",\n \"text\": \"public BigDecimal getRESCH_GL() {\\r\\n return RESCH_GL;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9e0555753d6efff09aa9e4b1bbff36d1\",\n \"score\": \"0.5007661\",\n \"text\": \"public int getArmourValue() {\\r\\n return armourValue;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1e6cd6d6453beb7b8df99df5bfc38d9b\",\n \"score\": \"0.5006771\",\n \"text\": \"public String getRUCEmisor();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"153f895d35fc29f849a02c5717b76dbe\",\n \"score\": \"0.49891222\",\n \"text\": \"public com.besixplus.sii.objects.Cgg_veh_color getCgg_veh_color(){\\n\\t\\treturn this.myCgg_veh_color;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"caa7b625f5eda42c87152a37edc14998\",\n \"score\": \"0.49747908\",\n \"text\": \"public BigDecimal getROLLOVER_GL() {\\r\\n return ROLLOVER_GL;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"efdfe7bd4d8d39595d72b11459a4e4b5\",\n \"score\": \"0.4966899\",\n \"text\": \"public java.lang.String getCORREO_ELECTRONICO(){\\r\\n return localCORREO_ELECTRONICO;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8cddfe8450031896d9d2140befd65b70\",\n \"score\": \"0.49626827\",\n \"text\": \"public com.besixplus.sii.objects.Cgg_res_tramite_comite getCgg_res_tramite_comite(){\\n\\t\\treturn this.myCgg_res_tramite_comite;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d8ff453f411249a39763ab008f44f3b\",\n \"score\": \"0.4962291\",\n \"text\": \"public byte getMyoRunStopReverse() {\\n return myoRunStopReverse;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ee049e4a4e7a2967ab00272e6d16dfeb\",\n \"score\": \"0.49604493\",\n \"text\": \"public Integer getIdTipoRecurso() {\\n return idTipoRecurso;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"af8bd8f80309203b8c8ba43d988e6bc3\",\n \"score\": \"0.49604213\",\n \"text\": \"int getRtti();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0923f54b75dfb3022143f8b5133cf95a\",\n \"score\": \"0.49554223\",\n \"text\": \"public BigDecimal getBORROWING_GL() {\\r\\n return BORROWING_GL;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e983a95360d258bbfe6fa05a1f572ab3\",\n \"score\": \"0.49536642\",\n \"text\": \"public BigDecimal getCLI_DFF_YER_REV_GL() {\\r\\n return CLI_DFF_YER_REV_GL;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bfce694984c4445dde6370b861394078\",\n \"score\": \"0.4952431\",\n \"text\": \"public String getInfoOnLagnaRashi() {\\n\\t\\treturn null;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8cf2894e99a5fda076d06cccc1c3ba25\",\n \"score\": \"0.4948466\",\n \"text\": \"public int getCoraje() {\\n\\t\\treturn this.coraje;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"85b087e2ed6c5ea5536dabed0bbc4779\",\n \"score\": \"0.49464208\",\n \"text\": \"@Override\\n\\tpublic String toString() {\\n\\t\\treturn \\\"Rope\\\";\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c708222256cc6621a549d60b3cbf8d6a\",\n \"score\": \"0.49464175\",\n \"text\": \"@XmlElement(name = \\\"rpo_value\\\", required = false)\\n public Long getRpoValue() {\\n return rpoValue;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e13d76b9899766378b8b6a310323819\",\n \"score\": \"0.49389473\",\n \"text\": \"public synchronized String getIP_Rov() {\\n return IP_Rov;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8af9a42a3e337ca35d6e6ac8f096e5a8\",\n \"score\": \"0.49326456\",\n \"text\": \"@Override\\n\\tpublic String toString() {\\n\\t\\treturn \\\"[CURSO: \\\" + nome + \\\", tempo total: \\\" + this.getTempoTotal() + \\\", Aulas: \\\" + this.aulas + \\\"]\\\";\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a1382cca6b00aa4b01bde60a7cabac2d\",\n \"score\": \"0.49325898\",\n \"text\": \"public java.lang.String getROADNAME() {\\n return ROADNAME;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e46d1323957901469400c1ebb16f32e5\",\n \"score\": \"0.49322873\",\n \"text\": \"public String getRecintoAduanero() {\\r\\n return recintoAduanero;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f032ea93b5a3cc5145342f8f34bc3018\",\n \"score\": \"0.49288884\",\n \"text\": \"@Override\\n\\tpublic java.lang.String getRagioneSociale() {\\n\\t\\treturn _anagrafica.getRagioneSociale();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"08cf8454704d9794c7590b7225becba8\",\n \"score\": \"0.4922623\",\n \"text\": \"public Vertice getOrigem() {\\n return origem;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"76dc434205cacd091103e77ce98005dc\",\n \"score\": \"0.49225754\",\n \"text\": \"public String maisRico(){\\n Barbaro e = null;\\n for (Barbaro b : folhas) {\\n if(e==null){\\n e = b;\\n }else{\\n if(e.getTerras()<b.getTerras()){\\n e=b;\\n } \\n }\\n }\\n return e.toString();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b76569f4d789a418f76404b495b90ee2\",\n \"score\": \"0.49223146\",\n \"text\": \"public java.lang.String getTerminalRodoviarioOrigem() {\\n return terminalRodoviarioOrigem;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"099f7d6f4092b442b8754370671b30e2\",\n \"score\": \"0.49169445\",\n \"text\": \"public List<Ponto> getRastro() {\\r\\n\\treturn rastro;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7a81f71763cc02a02412f20c315a8745\",\n \"score\": \"0.49010357\",\n \"text\": \"public Double getWeightedroe() {\\n return weightedroe;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"29e18a2ab696257d62bfe1c16125a40e\",\n \"score\": \"0.4899864\",\n \"text\": \"public int getRa() {\\n\\t\\treturn this.ra;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f4e98b911babec13b3053557661c04b1\",\n \"score\": \"0.48930863\",\n \"text\": \"public double getKr() {\\r\\n return _kR;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8a1690bed3d233e359f9e4f709a22ee5\",\n \"score\": \"0.48870608\",\n \"text\": \"public double getTeor_alcool() {\\r\\n\\t\\treturn teor_alcool;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"16ee47a5f4d5f8a99d2db9357c7c74b7\",\n \"score\": \"0.48859495\",\n \"text\": \"public Double getRataRata(){\\n return rataRata;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4f2766ae62d1a141f72d00255982bce7\",\n \"score\": \"0.48857996\",\n \"text\": \"public Radar getRadar() {\\r\\n return this.radar;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ab8a380228147524169f08f7ef76dda6\",\n \"score\": \"0.48804346\",\n \"text\": \"public String getReintentar() {\\r\\n return reintentar;\\r\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":983199,"cells":{"query_id":{"kind":"string","value":"cb8321c60397014b9bedd4c1c8840fc4"},"query":{"kind":"string","value":"Scroll Down by one page"},"positive_passages":{"kind":"list like","value":[{"docid":"f60404aa2b98e8feb764cd86c27ba616","score":"0.68749034","text":"public void scrollDown() throws CalabashException {\n calabashWrapper.scrollDown();\n }","title":""}],"string":"[\n {\n \"docid\": \"f60404aa2b98e8feb764cd86c27ba616\",\n \"score\": \"0.68749034\",\n \"text\": \"public void scrollDown() throws CalabashException {\\n calabashWrapper.scrollDown();\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"8ec250ac7eef922fbd7512c20b2cb097","score":"0.75142586","text":"public void robotScrollDown() throws Exception\r\n\t{\r\n\t\tre = new Robot();\r\n\t\tre.keyPress(KeyEvent.VK_PAGE_DOWN);\r\n\t\tre.keyRelease(KeyEvent.VK_PAGE_DOWN);\r\n\t}","title":""},{"docid":"0566fc48eee5ba8eb64e08fd5eade1fa","score":"0.73593724","text":"public void scrollDown() throws Exception \r\n\t{\r\n\t\t((JavascriptExecutor) getWebDriver()).executeScript(\"scroll(0, 100);\");\r\n\t}","title":""},{"docid":"46d46778cb6273270f104eec544a2880","score":"0.7309403","text":"public /*virtual*/ void PageDown() \r\n { \r\n double delta = ViewportHeight;\r\n if (!IsPixelBased && (Orientation == Orientation.Vertical) && DoubleUtil.IsZero(delta)) \r\n {\r\n delta = 1;\r\n }\r\n SetVerticalOffsetImpl(VerticalOffset + delta); \r\n SetAnchorInformation(false /*isHorizontalOffset*/);\r\n }","title":""},{"docid":"32ed546c688a24a307fd83f797bb4d0a","score":"0.7300112","text":"protected void scrollDown()\r\n {\n\t\toImage.scrollDown();\r\n }","title":""},{"docid":"11ce62102b63fc6c01002f54d72bfc48","score":"0.7075755","text":"public void scrollDown(){\n Dimension dimension = driver.manage().window().getSize();\n int scrollStart = (int) (dimension.getHeight() * 0.8);\n int scrollEnd = (int) (dimension.getHeight() * 0.2);\n\n new TouchAction((PerformsTouchActions) driver)\n .press(PointOption.point(0, scrollStart))\n .waitAction(WaitOptions.waitOptions(Duration.ofSeconds(1)))\n .moveTo(PointOption.point(0, scrollEnd))\n .release().perform();\n\n new TouchAction((PerformsTouchActions) driver)\n .press(PointOption.point(0, scrollStart))\n .waitAction(WaitOptions.waitOptions(Duration.ofSeconds(1)))\n .moveTo(PointOption.point(0, scrollEnd))\n .release().perform();\n }","title":""},{"docid":"1f9e94b74fe607f38918a037f2e5229b","score":"0.7067477","text":"public void scrollDownOfPage(WebElement element) {\r\n waitUntilVisible(element);\r\n JavascriptExecutor js = (JavascriptExecutor) driver;\r\n js.executeScript(\"arguments[0].scrollIntoView();\", element);\r\n\r\n }","title":""},{"docid":"9e804f84db4643748780a68c80384bf0","score":"0.69934094","text":"public void scrollDownVertically() {\n\t\tlog.info(\"Scrolling down vertically...\");\n\t\texecuteScript(\"window.scrollTo(0,document.body.ScrollHeight)\");\n\t}","title":""},{"docid":"a219e371b3164449af79560131725060","score":"0.69812685","text":"public static void scrollDown(By locator){\r\n WebElement we = getDriver().findElement(locator);\r\n\r\n we.sendKeys(Keys.PAGE_DOWN);\r\n }","title":""},{"docid":"1c8bc1709dd23d4ae758747d407709d8","score":"0.6763762","text":"public void goBackward() {\r\n\t\tif (pageNumber == 1) { return; }\r\n\t\tpageNumber-- ;\r\n\t\tsetPage(pageNumber);\r\n\r\n\t}","title":""},{"docid":"ee07592947758b0f2fd28ea36a761d14","score":"0.66335785","text":"public void scrollToPageEndDynamically() {\n JavascriptExecutor js = (JavascriptExecutor) driver();\n int browserHeight = driver().manage().window().getSize().height;\n long lastHeight = (long) js.executeScript(\"return document.body.scrollHeight\");\n int scrollIterator = 1;\n while (true) {\n do {\n js.executeScript(\"window.scrollTo(0, \" + (browserHeight * scrollIterator) + \")\");\n scrollIterator++;\n waitForSeconds(ONE_SECOND);\n } while ((long) browserHeight * scrollIterator < lastHeight);\n\n long newHeight = (long) js.executeScript(\"return document.body.scrollHeight\");\n if (newHeight == lastHeight) {\n break;\n }\n lastHeight = newHeight;\n }\n }","title":""},{"docid":"0e89745293eb22beba49be242821aed4","score":"0.6481591","text":"protected void scrollToEndPage() {\n Log.i(TAG, \"scrolledReachToLast\");\n\n if (!mIsLoading) {\n mIsLoading = true;\n if (mBaseArrayAdapter != null) {\n mBaseArrayAdapter.setLoadingItems(true);\n }\n\n mCurrentPage++;\n }\n }","title":""},{"docid":"3a966c5271e824931657622d8b582562","score":"0.6349946","text":"public void scrollUp() throws Exception \r\n\t{\r\n\t\t((JavascriptExecutor) getWebDriver()).executeScript(\"scroll(0, -100);\");\r\n\t}","title":""},{"docid":"218620b77f0339a2f857931885c12d1c","score":"0.62406516","text":"public void scrollDownByPixel(int pixel) {\n\t\texecuteScript(\"window.scrollBY(0,\" + pixel + \")\");\n\t\tlog.info(\"Scrolling down by pixel...\");\n\t}","title":""},{"docid":"b5d6c5289b87b8af202bd21c720619a3","score":"0.62335426","text":"public void scrollUpVertically() {\n\t\tlog.info(\"Scrolling up vertically...\");\n\t\texecuteScript(\"window.scrollTo(0,-document.body.ScrollHeight)\");\n\t}","title":""},{"docid":"5e4148806d9bb1f8336b76c59ef86aa4","score":"0.6231882","text":"public void scrollDown(ListView<ReadOnlyTask> taskListView) {\n scrollBar = getScrollBar(taskListView);\n\n if (scrollBar == null) {\n return;\n }\n\n scrollBar.increment();\n scrollBar.increment();\n scrollBar.increment();\n scrollBar.increment();\n scrollBar.increment();\n }","title":""},{"docid":"5dfba4792bcb0f497e9e6e2090ba330b","score":"0.62246495","text":"public static void safeScrollDown() throws InterruptedException {\n Dimension size = androidDriver.manage().window().getSize();\r\n //Starting y location set to 80% of the height (near bottom)\r\n int starty = (int) (size.height * 0.77);\r\n //Ending y location set to 20% of the height (near top)\r\n int endy = (int) (size.height * 0.4);\r\n //x position set to mid-screen horizontally\r\n int startx = (int) (size.width * 0.5);\r\n\r\n Thread.sleep(2000);\r\n (new TouchAction(androidDriver))\r\n .press(PointOption.point(startx, starty))\r\n .waitAction(WaitOptions.waitOptions(Duration.ofMillis(500)))\r\n .moveTo(PointOption.point(startx, endy))\r\n .release()\r\n .perform();\r\n\r\n }","title":""},{"docid":"c384869f7b4a2d42f763c79c18f9e0ac","score":"0.62197745","text":"@Test\n public void scroll() throws InterruptedException {\n Actions actions=new Actions(driver);\n driver.get(\"http://practice.cybertekschool.com/infinite_scroll\");\n Thread.sleep(2000);\n\n //arrow down\n\n actions.sendKeys(Keys.ARROW_DOWN).pause(1000).\n sendKeys(Keys.ARROW_DOWN).pause(1000).\n sendKeys(Keys.ARROW_DOWN).pause(1000).build().perform();\n\n //arrow up\n actions.sendKeys(Keys.ARROW_UP).pause(1000).\n sendKeys(Keys.ARROW_UP).pause(1000).\n sendKeys(Keys.ARROW_UP).pause(1000).build().perform();\n //page down\n\n actions.sendKeys(Keys.PAGE_DOWN).pause(1000).\n sendKeys(Keys.PAGE_DOWN).pause(1000).\n sendKeys(Keys.PAGE_DOWN).pause(1000).build().perform();\n //page up\n actions.sendKeys(Keys.PAGE_UP).pause(1000).\n sendKeys(Keys.PAGE_UP).pause(1000).\n sendKeys(Keys.PAGE_UP).pause(1000).build().perform();\n\n\n\n\n }","title":""},{"docid":"91e4654788ad77a0752ae2eb36420091","score":"0.61900526","text":"public void scrollWondow()\n\t{\n\t\t\n\t\tJavascriptExecutor jse = (JavascriptExecutor)wd;\n\t\tjse.executeScript(\"window.scrollBy(0,-500)\", \"\");\n\t\t\n\n\t}","title":""},{"docid":"328447406a4eb17e2dbb2e649c3db90f","score":"0.6149867","text":"public void ScrollDownComplete() {\n\t\tJavascriptExecutor js = (JavascriptExecutor) driver;\n\t\ttry {\n\t\t\tThread.sleep(10000);\n\t\t} catch (InterruptedException e) {\n\t\t\t// TODO Auto-generated catch block\n\t\t\te.printStackTrace();\n\t\t}\n\t\t//System.out.println(\"Scroll down completly to load all elements...\");\n\n\t\tfor (int i = 0; i < 10; i++) {\n\n\t\t\tjs.executeScript(\"window.scrollTo(0, document.body.scrollHeight);\");\n\n\t\t}\n\t}","title":""},{"docid":"ff58ab67c9358584c9d59c6903c2030e","score":"0.61322606","text":"protected abstract void reachToEndPage(int page);","title":""},{"docid":"bca145db7595ec6b8035197e56b5ff23","score":"0.6130565","text":"@Override\n public void onScrollToLastItem() {\n currentPage++;\n loadPage(currentPage);\n }","title":""},{"docid":"171f10a4ff33b09b13d18f17cc5fd48d","score":"0.6117529","text":"public void swipeDown() {\n\n\t\tdriver.swipe(390, 1030, 390, 364, 1000);\n\t}","title":""},{"docid":"1f9314898c99d78c2f05f165c5341350","score":"0.61103535","text":"public static void scrollToBottomPage(WebDriver driver) {\n\t\tJavascriptExecutor js = (JavascriptExecutor) driver;\n\t\tjs.executeScript(\"window.scrollTo(0,Math.max(document.documentElement.scrollHeight,\"\n\t\t\t\t+ \"document.body.scrollHeight,document.documentElement.clientHeight));\");\n\t}","title":""},{"docid":"ae125da191e8cefa6539515612ad4f7f","score":"0.6085731","text":"public static void goBackOnePage() {\n driver().navigate().back();\n }","title":""},{"docid":"0c55c3d85c4a8ed5bd1627182fae1566","score":"0.6082403","text":"public void robotScrollUp() throws Exception \r\n\t{\r\n\t\tre = new Robot();\r\n\t\tre.keyPress(KeyEvent.VK_PAGE_UP);\r\n\t\tre.keyRelease(KeyEvent.VK_PAGE_UP);\r\n\t}","title":""},{"docid":"4a8446288fe6444c0622951f624b7325","score":"0.60389405","text":"public void scrollDownBillingsrulepopup() {\n getDriver().scrollToElement(getDriver().findElement(By.xpath(\"//a[contains(.,'Remove this rule')]\")));\r\n getDriver().sleep(2000);\r\n }","title":""},{"docid":"4d08e531df1cea1d89c390788eeeef03","score":"0.593325","text":"void onScrollVertical(float dy, detailType detailType);","title":""},{"docid":"e7e9562ee42a4e286edefd004a2016c3","score":"0.5928919","text":"private void scroll() {\n messagesContainer.setSelection(messagesContainer.getCount() - 1);\n }","title":""},{"docid":"9258edbb8cc0593883cc01c9432c9158","score":"0.58928674","text":"public void goToTop(View view) {\n ScrollView mainScroll = findViewById(R.id.mainScroll);\n mainScroll.post(new Runnable() {public void run() {\n mainScroll.fullScroll(View.FOCUS_UP);\n }});\n }","title":""},{"docid":"c617f08a34814819f946faaca93a248a","score":"0.5887918","text":"public static void scrollToBottomOfPage(final WebDriver driver) {\n\t\tfinal JavascriptExecutor js = (JavascriptExecutor) driver;\n\t\tjs.executeScript(\"window.scrollTo(0, document.body.scrollHeight);\");\n\t}","title":""},{"docid":"99f1ae78052bc3e42ce0db74d0d2835f","score":"0.5880314","text":"void scroll(int pixels);","title":""},{"docid":"520c0fb9358d9dfe0530e0bc5e326c45","score":"0.58782905","text":"protected abstract void reachToLastPage();","title":""},{"docid":"0e503eca60cae1f13f8e00757d2991cf","score":"0.5856939","text":"protected void scrollUp()\r\n {\n\t\toImage.scrollUp();\r\n }","title":""},{"docid":"5058c3f9a4c1b93c3e34edad1de030e3","score":"0.58517957","text":"public static void scrollToBottom(WebDriver driver)\n\t{\n\t\texecute(driver, _JS_ScrollToBottom, null);\n\t}","title":""},{"docid":"9860a8a322d1629df4fffa6cb1f5025d","score":"0.5823885","text":"public void next(View view)\n {\n if(mScrolledToBottom)\n {\n //go to next activity\n Intent intent = new Intent(this, NextActivity.class);\n startActivity(intent);\n }\n else\n {\n //check if scrollable\n if (mScrollView.fullScroll(View.FOCUS_DOWN))\n {\n mScrolledToBottom = true;\n }\n else\n {\n //go to next activity\n Intent intent = new Intent(this, NextActivity.class);\n startActivity(intent);\n }\n }\n\n }","title":""},{"docid":"cbdfd6b565a8520bc53a383d101a4c05","score":"0.58216643","text":"public abstract void scrollToFinishActivity();","title":""},{"docid":"5194aafa61257f49d5eaf042a0c5c5a1","score":"0.5816734","text":"private void scroll() {\n\t\tJavascriptExecutor js = (JavascriptExecutor) driver;\n\t\tjs.executeScript(\"javascript:window.scrollBy(250,350)\");\n\t}","title":""},{"docid":"f0bc008146b4fdeee7bc44a9e85e6f03","score":"0.5800191","text":"public void clicklastpage() {\r\n\t\tthis.lastPage.click();\r\n\t}","title":""},{"docid":"56be402706bbc3e58aba68be66a53140","score":"0.57976854","text":"public /*virtual*/ void PageUp()\r\n { \r\n double delta = ViewportHeight;\r\n if (!IsPixelBased && (Orientation == Orientation.Vertical) && DoubleUtil.IsZero(delta))\r\n {\r\n delta = 1; \r\n }\r\n SetVerticalOffsetImpl(VerticalOffset - delta); \r\n SetAnchorInformation(false /*isHorizontalOffset*/); \r\n }","title":""},{"docid":"7077e3b9ae97032113c7ff85dde63c46","score":"0.578666","text":"public boolean scroll();","title":""},{"docid":"e0f9cc8297724811a9b7b9399fa5a613","score":"0.5769588","text":"public static void scrollToBottom(WebDriver driver) {\n ((JavascriptExecutor) driver).executeScript(\"scroll(0,document.body.offsetHeight)\");\n }","title":""},{"docid":"fefc133cafdc00db76b5723ca5d893ce","score":"0.5748012","text":"public void down(int increment)\r\n {\r\n this.setYPos(this.getYPos() + increment); \r\n }","title":""},{"docid":"8e1e6924b192fd48b679657d680265f1","score":"0.5743316","text":"void downJump() {\n\t\tif (((position.y - eyeHeight.y) > level.lowestTop + 10)) {\n\t\t\tif (jumpState == JumpState.GROUNDED) {\n\t\t\t\tjumpState = JumpState.FALLING;\n\t\t\t\tposition.y -= 10;\n\t\t\t}\n\t\t}\n\t}","title":""},{"docid":"48a512ec9af607c56bf7cf18e6b3c467","score":"0.5730551","text":"public void goToPage(int page) {\n\t}","title":""},{"docid":"aad20fad77c7d2d7539572a938076202","score":"0.5722523","text":"PageElementValue<Integer> getScrollTop();","title":""},{"docid":"e7d7aa0845f75b59dba9a08ea85a824f","score":"0.57138646","text":"public void restoreScroll() {\r\n int oldX = getDescriptor().getScrollX();\r\n int oldY = getDescriptor().getScrollY();\r\n scrollViewTo(getDescriptor().getScrollX(), getDescriptor().getScrollY());\r\n setDescriptorScrolls(oldX, oldY);\r\n }","title":""},{"docid":"82b523e4d4fb15dbda5c594af87083c8","score":"0.56861013","text":"public void moveDown() {\n\t\tthis.moveY(10);\n\t}","title":""},{"docid":"1b7f843470ba3394c973c085e8675bef","score":"0.5665337","text":"public static void scrollTopToBottom(int x,int time , AndroidDriver driver)\r\n\t\t{\r\n\t\t\tclass Local {};\r\n\t\t String methodName = Local.class.getEnclosingMethod().getName();\r\n\t\t\tUniversalVariables.ScreenDimensions =driver.manage().window().getSize();\r\n\t\t\tint startY = (int)(UniversalVariables.ScreenDimensions.height *0.10);\r\n\t\t\tint endY = (int)(UniversalVariables.ScreenDimensions.height *0.90);\r\n\t\t\t\r\n\t\t\t\r\n\t\t\ttry {\r\n\t\t\t\tdriver.swipe(x, startY, x, endY, time);\r\n\t\t\t\tUniversalVariables.test.log(Status.INFO,methodName+\": performed scroll Top to Bottom\" );\r\n\t\t\t}\r\n\t\t\tcatch(Exception e)\r\n\t\t\t{\r\n\t\t\t\tUniversalVariables.test.log(Status.INFO,methodName+\": Not performed scroll Top to Bottom\" );\r\n\t\t\t}\r\n\t\t}","title":""},{"docid":"3c193658fbf9b1bb2ba8c2fd7ef96dae","score":"0.56567943","text":"public int getDownScrollY() {\n /*\n // Can't load method instructions: Load method exception: bogus opcode: 00e3 in method: com.color.view.analysis.ColorViewAnalyzer.ScrollTouchData.getDownScrollY():int, dex: \n */\n throw new UnsupportedOperationException(\"Method not decompiled: com.color.view.analysis.ColorViewAnalyzer.ScrollTouchData.getDownScrollY():int\");\n }","title":""},{"docid":"b5300975fade7f3ca16c42ee6a0a3db8","score":"0.5655521","text":"private void scrollToTop() {\n spnFlowScroll.setVvalue(0.00f);\n }","title":""},{"docid":"36e321c7a37071ba67e255b7db853c86","score":"0.5626169","text":"void nextPage();","title":""},{"docid":"19fd00a1175c0edc3d2e776dccb62882","score":"0.5625645","text":"public void moveDown(){\n position.incrementCurrentY(1);\n }","title":""},{"docid":"0b36d3b508ce533e003f92c37acace91","score":"0.5620542","text":"@Override\r\n\tpublic void scrollBy(int x, int y) {\n\r\n\t}","title":""},{"docid":"25e7b67b8d50947961ca7e658bc95864","score":"0.5616982","text":"public void scrollToBottomOfThePage(WebDriver driver,String element) {\r\n\t\ttry {\r\n\t\t\tWebElement webElement = locator.findObject(driver, element);\r\n\t\t\tJavascriptExecutor js = (JavascriptExecutor) driver;\r\n\t\t\tjs.executeScript(\"arguments[0].scrollIntoView();\", webElement);\r\n\t\t} catch (Exception e) {\r\n\t\t\te.printStackTrace();\r\n\r\n\t\t}\r\n\t}","title":""},{"docid":"d891ae43f2efe686d0b5a8cfe5c4cd5d","score":"0.5608624","text":"public void moveDown()\r\n {\r\n moveVertical(20);\r\n }","title":""},{"docid":"cb10e7ec5845cbd20d57897ca3d75bcb","score":"0.56036556","text":"public boolean scrollToTop(String name, String locator) throws Exception \n{\n\t//copy from ==> machine\n\t try\n\t {\n\t\t \t\tSystem.out.println(\"before scroll\");\n\t\t \t\t//PropertiesAndConstants.Selenium.scrollToExact(\"Recharge Amount\");\n\t\t \t\t//PropertiesAndConstants.Selenium.\n\t\t \t\t////System.out.println(\"after recharge\");\n\t\t \t//\tThread.sleep(5000);\n\t\t\t //((JavascriptExecutor) PropertiesAndConstants.Selenium).executeScript(\"window.scrollTo(0, document.body.scrollHeight)\");\n\t\t\t \tWebElement webElement = WaitForElementPresent(name, locator);\n\t\t JavascriptExecutor js = (JavascriptExecutor) PropertiesAndConstants.Selenium;\n\t\t HashMap<String, String> scrollObject = new HashMap<String, String>();\n\t\t // scrollObject.put(\"direction\", \"down\");\n\t\t scrollObject.put(\"direction\", \"down\");\n\t\t //scrollObject.put(\"element\", ((RemoteWebElement) webElement).getId());\n\t\t js.executeScript(\"mobile: scroll\", scrollObject);\n\t\t LogFunctions.LogEntry(\"Pass - to scroll at the bottom\", true);\n\t\t PropertiesAndConstants.scriptExecutionResult = \"Pass\";\n\t return true;\n\t }\n\t catch(Exception e)\n\t {\n\t\t e.printStackTrace();\n\t LogFunctions.LogEntry(\"Fail to scroll at the bottom\", false);\n\t PropertiesAndConstants.scriptExecutionResult = \"Fail\";\n\t return false;\n\t }\n}","title":""},{"docid":"5efaa5e92f1f5c6c47a0e5ba70f4d6be","score":"0.56033987","text":"public static void scrollBottomToTop(int x,int time , AndroidDriver driver)\r\n\t\t{\r\n\t\t\tclass Local {};\r\n\t\t String methodName = Local.class.getEnclosingMethod().getName();\r\n\t\tUniversalVariables.ScreenDimensions =driver.manage().window().getSize();\r\n\t\tint startY = (int)(UniversalVariables.ScreenDimensions.height *0.90);\r\n\t\tint endY = (int)(UniversalVariables.ScreenDimensions.height *0.10);\r\n\t\t\r\n\t\ttry {\r\n\t\t\tdriver.swipe(x, startY, x, endY, time);\r\n\t\t\tUniversalVariables.test.log(Status.INFO,methodName+\": performed scroll Bottom to Top\" );\r\n\t\t}\r\n\t\tcatch(Exception e)\r\n\t\t{\r\n\t\t\tUniversalVariables.test.log(Status.INFO,methodName+\": Not performed scroll Bottom to Top\" );\r\n\t\t}\r\n\t\t}","title":""},{"docid":"caa2cfe51b71bf146f483fef69943e32","score":"0.55883676","text":"public /*virtual*/ void LineDown()\r\n {\r\n SetVerticalOffsetImpl(VerticalOffset + ((Orientation == Orientation.Vertical && !IsPixelBased) ? 1.0 : ScrollViewer._scrollLineDelta)); \r\n SetAnchorInformation(false /*isHorizontalOffset*/);\r\n }","title":""},{"docid":"7b86a7dc7692a1e4abd7b09e8663363d","score":"0.5562909","text":"@Override\n\t\t\tpublic void mouseClicked(MouseEvent e) {\n\t\t\t\tpage--;\n\t\t\t\tupdatePage();\n\t\t\t}","title":""},{"docid":"23a6a9ed9bc54b290f06af8af95fa82e","score":"0.5559441","text":"public void showDownPage() {\n LOG.mo8825d(\"...showDownPage...\");\n if (this.mDownLoadPage == null) {\n this.mDownLoadPage = new PageDownLoad(this, this);\n this.mContentLayout.addView(this.mDownLoadPage.getmContentView());\n }\n Secure.putInt(getContentResolver(), \"pageInx\", 2);\n Intent intent = new Intent(\"net.sunniwell.MarqueeTextView_PAGE_CHANGED\");\n intent.putExtra(\"pageInx\", 2);\n sendBroadcast(intent);\n if (this.mEPGPage != null) {\n LOG.mo8825d(\"mEPGPage---->INVISIBLE\");\n this.mEPGPage.setVisibility(4);\n }\n if (this.mCategoryPage != null) {\n LOG.mo8825d(\"mCategoryPage---->INVISIBLE\");\n this.mCategoryPage.setVisibility(4);\n }\n if (this.mLivePage != null) {\n LOG.mo8825d(\"mLivePage---->INVISIBLE\");\n this.mLivePage.setVisibility(4);\n }\n this.mDownLoadPage.bringToFront();\n this.mDownLoadPage.onResume();\n }","title":""},{"docid":"24677e1071a63269f2adcdc9f920904c","score":"0.55508476","text":"public boolean scrollToBottom(String name, String locator) throws Exception \n{\n\t//copy from ==> machine\n\t try\n\t {\n\t\t\t //((JavascriptExecutor) PropertiesAndConstants.Selenium).executeScript(\"window.scrollTo(0, document.body.scrollHeight)\");\n\t\t\t \tWebElement webElement = WaitForElementPresent(name, locator);\n\t\t JavascriptExecutor js = (JavascriptExecutor) PropertiesAndConstants.Selenium;\n\t\t HashMap<String, String> scrollObject = new HashMap<String, String>();\n\t\t // scrollObject.put(\"direction\", \"down\");\n\t\t scrollObject.put(\"direction\", \"down\");\n\t\t //scrollObject.put(\"element\", ((RemoteWebElement) webElement).getId());\n\t\t js.executeScript(\"mobile: scroll\", scrollObject);\n\t\t LogFunctions.LogEntry(\"Pass - to scroll at the bottom\", true);\n\t\t PropertiesAndConstants.scriptExecutionResult = \"Pass\";\n\t return true;\n\t }\n\t catch(Exception e)\n\t {\n\t LogFunctions.LogEntry(\"Fail to scroll at the bottom\", false);\n\t PropertiesAndConstants.scriptExecutionResult = \"Fail\";\n\t return false;\n\t }\n}","title":""},{"docid":"e45ca6c170570d06e4971a7e6629c268","score":"0.5550592","text":"@Override\n public void onClick(View v) {\n\n int newPosition = mVelocityViewPager.getCurrentItem() - 1;\n if (newPosition > -1) {\n scrollViewPager(newPosition, true, 1, true);\n } else {\n mVelocityViewPager.setCurrentItem(0, false);\n }\n }","title":""},{"docid":"adf6fcb643b39b65e8b1d3f515af12fd","score":"0.5546955","text":"public void moveDown() {\n\t\ty -= 1;\n\t}","title":""},{"docid":"057aae02ac4bc0b95f31cbd0f16bc557","score":"0.5539647","text":"private void onTouchUpEvent(MotionEvent ev) {\n \n final int activePointerId = mActivePointerId;\n final int pointerIndex = ev.findPointerIndex(activePointerId);\n final VelocityTracker velocityTracker = mVelocityTracker;\n velocityTracker.computeCurrentVelocity(ONE_SECOND, mMaximumVelocity);\n \n final float x = ev.getX(pointerIndex);\n int velocityX = (int) velocityTracker.getXVelocity(activePointerId);\n \n final int deltaX = (int) (x - mDownMotionX);\n \n final int pageWidth = (getMeasuredWidth() - getPaddingLeft() - getPaddingRight());\n boolean isSignificantMove = Math.abs(deltaX) > (pageWidth * SIGNIFICANT_MOVE_THRESHOLD);\n \n int finalChild;\n int flipChildNum;\n \t\n if (mTouchState == TOUCH_STATE_SCROLLING) {\n \t\n mTotalMotionX += Math.abs(mLastMotionX + mLastMotionXRemainder - x);\n boolean isFling = mTotalMotionX > MIN_LENGTH_FOR_FLING &&\n Math.abs(velocityX) > mFlingThresholdVelocity;\n\n // In the case that the page is moved far to one direction and then is flung\n // in the opposite direction, we use a threshold to determine whether we should\n // just return to the starting page, or if we should skip one further.\n boolean returnToOriginalIndex = false;\n if (Math.abs(deltaX) > pageWidth * RETURN_TO_ORIGINAL_INDEX_THRESHOLD &&\n Math.signum(velocityX) != Math.signum(deltaX) && isFling) {\n returnToOriginalIndex = true;\n }\n \n // We give flings precedence over large moves, which is why we short-circuit our\n // test for a large move if a fling has been registered. That is, a large\n // move to the left and fling to the right will register as a fling to the right.\n if ((isFling && velocityX > 0) && (mFirstVisibleChildIndex > 0)) {\n \t\n \t// flip according to scroll velocity or distance\n \tif (mFlipChildNum <= -1) {\n \t\t// if user significant scroll a long distance,\n \t\t// we use distance as flip parameter. \n \t\tif (isSignificantMove) {\n \t\t\tflipChildNum = computeScrollChildNum(deltaX);\n \t\t} else {\n \t\t\tflipChildNum = computeScrollChildNumByVelocity(velocityX);\n \t\t}\n \t} else {\n \t\t// manual set flip number.\n \t\tflipChildNum = mFlipChildNum;\n \t}\n \t\n \tfinalChild = returnToOriginalIndex ? mFirstVisibleChildIndex : mFirstVisibleChildIndex - flipChildNum;\n \tif (DEBUG) {\n \t\tLogUtils.d(TAG, \"Touch up scroll to prev: state: \" + mTouchState + \" final child: \" + finalChild \n \t\t\t\t+ \" returned: \" + returnToOriginalIndex + \" first: \" + mFirstVisibleChildIndex \n \t\t\t\t+ \" flip child num: \" + flipChildNum);\n \t}\n snapToChildWithVelocity(finalChild, velocityX);\n \n } else if ((isFling && velocityX < 0) && \n \t\t(mFirstVisibleChildIndex < getMaxSnapIndex())) {\n \t\n \tif (mFlipChildNum <= -1) {\n \t\tif (isSignificantMove) {\n \t\t\tflipChildNum = computeScrollChildNum(deltaX);\n \t\t} else {\n \t\t\tflipChildNum = computeScrollChildNumByVelocity(velocityX);\n \t\t}\n \t} else {\n \t\tflipChildNum = mFlipChildNum;\n \t}\n \t\n \tfinalChild = returnToOriginalIndex ? mFirstVisibleChildIndex : mFirstVisibleChildIndex + flipChildNum;\n \tif (DEBUG) {\n \t\tLogUtils.d(TAG, \"Touch up scroll to next: state: \" + mTouchState + \" final child: \" + finalChild \n \t\t\t\t+ \" returned: \" + returnToOriginalIndex + \" first: \" + mFirstVisibleChildIndex \n \t\t\t\t+ \" flip child num: \" + flipChildNum);\n \t}\n snapToChildWithVelocity(finalChild, velocityX);\n \n } else {\n \tfinalChild = findNearestChild(getScrollX());\n \tif (DEBUG) {\n \t\tLogUtils.d(TAG, \"Alignment to index: \" + finalChild + \" velocityX: \" + velocityX);\n \t}\n \tsnapToChildWithVelocity(finalChild, velocityX);\n }\n \n } else {\n onUnhandledTap(ev);\n }\n \n mTouchState = TOUCH_STATE_REST;\n mActivePointerId = INVALID_POINTER;\n releaseVelocityTracker();\n }","title":""},{"docid":"0f77878e2bcae47ffdd6a82555d8eee7","score":"0.5538322","text":"public void endScroll() {\n /*\n // Can't load method instructions: Load method exception: bogus opcode: 00eb in method: com.color.view.analysis.ColorViewAnalyzer.endScroll():void, dex: \n */\n throw new UnsupportedOperationException(\"Method not decompiled: com.color.view.analysis.ColorViewAnalyzer.endScroll():void\");\n }","title":""},{"docid":"8266202e4598dbf8621a48f967a060db","score":"0.5518869","text":"@Override\r\n\t\tpublic void toNext() {\r\n\t\t\t// TODO Auto-generated method stub\r\n\t\t\tPage.nextPage(); //increase page counter\r\n\t\t\tif(Page.getCurrenPage() > 0 && Page.getCurrenPage() < pages.size() - 1){\r\n\t\t\t\tsetStateMiddlePage();\r\n\t\t\t}else{\r\n\t\t\t\tsetStateLastPage();\r\n\t\t\t}\r\n\t\t}","title":""},{"docid":"6333aaef65a287258e86f60aa80d2677","score":"0.5490985","text":"@Override\r\n\tpublic int getScrollY() {\n\t\treturn 0;\r\n\t}","title":""},{"docid":"c857617428dcf9c3a85634d54f324f59","score":"0.54820204","text":"public void pageLast() {\n int count = dataTable.getRowCount();\n int rows = dataTable.getRows();\n dataTable.setFirst(count - ((count % rows != 0) ? count % rows : rows));\n }","title":""},{"docid":"1592987f13cb347e893cfd7750c74b1a","score":"0.54789305","text":"@Test\r\n\tpublic void checkScrollBarActions() throws InterruptedException\r\n\t{\r\n\t\tdriver.get(\"file:///C:/Users/karthick_jaipal/Desktop/Page3.html\");\r\n\t\t//TypeCasting to access js methods\r\n\t\tJavascriptExecutor js=(JavascriptExecutor)driver;\r\n\t\t//To scrolldown with some value\r\n\t\tfor(int i=0;i<3;i++)\r\n\t\t{\r\n\t\t\tjs.executeScript(\"window.scrollBy(0,10)\");\r\n\t\t\tThread.sleep(2000);\r\n\t\t}\r\n\t\t//To scrollUp with some value\r\n\t\tfor(int i=0;i<3;i++)\r\n\t\t{\r\n\t\t\tjs.executeScript(\"window.scrollBy(10,0)\");\r\n\t\t\tThread.sleep(2000);\r\n\t\t}\r\n\r\n\t}","title":""},{"docid":"4abbdece5b4fdbbea22d7d67cf041169","score":"0.54751974","text":"@Override\r\n\tpublic void invoke(long window, double x, double y) {\n\t\tif (y == 1) {\r\n\t\t\tscrollUp = true;\r\n\t\t} else if (y == -1) {\r\n\t\t\tscrollDown = true;\r\n\t\t}\r\n\t}","title":""},{"docid":"72f5dc0e5101b9645dc5d051799152cc","score":"0.54727226","text":"void updateScroll(int x, int y) {\n // TODO Implement\n }","title":""},{"docid":"a167cdcdb21abecbb7a3b05e56851a39","score":"0.5458592","text":"@Override\n\t\t\tpublic void onPageScrollStateChanged(int arg0) {\n\t\t\t\t\n\t\t\t}","title":""},{"docid":"a167cdcdb21abecbb7a3b05e56851a39","score":"0.5458592","text":"@Override\n\t\t\tpublic void onPageScrollStateChanged(int arg0) {\n\t\t\t\t\n\t\t\t}","title":""},{"docid":"a167cdcdb21abecbb7a3b05e56851a39","score":"0.5458592","text":"@Override\n\t\t\tpublic void onPageScrollStateChanged(int arg0) {\n\t\t\t\t\n\t\t\t}","title":""},{"docid":"a167cdcdb21abecbb7a3b05e56851a39","score":"0.5458592","text":"@Override\n\t\t\tpublic void onPageScrollStateChanged(int arg0) {\n\t\t\t\t\n\t\t\t}","title":""},{"docid":"a167cdcdb21abecbb7a3b05e56851a39","score":"0.5458592","text":"@Override\n\t\t\tpublic void onPageScrollStateChanged(int arg0) {\n\t\t\t\t\n\t\t\t}","title":""},{"docid":"417ffa6f78df19ecb3f9ba1528ccc047","score":"0.5452799","text":"default AfterWhereBuilder<T> scroll() {\n\t\t\treturn scroll(DEFAULT_SCROLL_KEEP_ALIVE);\n\t\t}","title":""},{"docid":"39af467c49fedef5800c8ffdb606660c","score":"0.5441894","text":"public static void scrollToPageTop(final WebDriver driver) {\n\t\tfinal JavascriptExecutor js = (JavascriptExecutor) driver;\n\t\tjs.executeScript(\"window.scrollTo(0, 0);\");\n\t}","title":""},{"docid":"4671301394bcf871ba9cba2f03696335","score":"0.5437553","text":"public void scrollto(String text) {\n\t\tdriver.scrollTo(text);\n\t}","title":""},{"docid":"0dd4f805a286e28a11abeb24758e5877","score":"0.5435725","text":"public void onPageScrollStateChanged(int arg0) {\n\t\t\t\t\r\n\t\t\t}","title":""},{"docid":"8357f63e5fc3e9a1157b94f55cf311e6","score":"0.5422619","text":"public void onPageScrollStateChanged(int state) {\n }","title":""},{"docid":"8357f63e5fc3e9a1157b94f55cf311e6","score":"0.5422619","text":"public void onPageScrollStateChanged(int state) {\n }","title":""},{"docid":"31d7ba0e112b5a3e4fdf56c8684f5e3a","score":"0.5417588","text":"PageElementValue<Integer> getScrollHeight();","title":""},{"docid":"6e8b5735ebad24dae00452a2d8582354","score":"0.5413178","text":"public void pageNext() {\n dataTable.setFirst(dataTable.getFirst() + dataTable.getRows());\n }","title":""},{"docid":"a3605e3d96c32709c9df0e7c6b39c860","score":"0.5407744","text":"public abstract void onScroll(double delta);","title":""},{"docid":"4743d6880a03a1f611a8bfff9b33e942","score":"0.540674","text":"@Override\n public void onPageScrollStateChanged(int state) {\n\n }","title":""},{"docid":"69081374c1de50a9c4da12f4b950aab1","score":"0.54023284","text":"public void scrollToBottom() {\n\t\t\n\t\t// Calculate the size of the content panel.\n\t\tint tableHeight = 0;\n\t\tint numCells = _delegate.getNumberOfCells( this );\n\t\tint cellSpacing = _delegate.getCellSpacing(this);\n\t\tfor( int index = 0; index < numCells; index++ ) {\n\n\t\t\tint cellHeight = _delegate.getCellHeight( this, index );\n\t\t\ttableHeight += cellHeight + cellSpacing;\n\n\t\t}\n\t\t\n\t\t// Calculate the bottom of the scrolling thing.\n\t\tint now = _scrollPanel.getVerticalScrollBar().getValue();\n\t\t\n\t\t_scrollPanel.getVerticalScrollBar().setValue( now + 61 );\n\t\t\n\t\t\n\t}","title":""},{"docid":"7212ecf541ab5456a0fa82f97b3dd997","score":"0.539926","text":"public void goForward() {\r\n\t\tif (pageNumber == maxPage) { return; }\r\n\t\tpageNumber++ ;\r\n\t\tsetPage(pageNumber);\r\n\t}","title":""},{"docid":"ad711f48b1fd3721d3d12c163f580434","score":"0.53971964","text":"@Override\n\t\t\t\tpublic void onPageScrollStateChanged(int arg0) {\n\t\t\t\t\t\n\t\t\t\t}","title":""},{"docid":"75b1fce06eb618b9ea463f8a44fd94eb","score":"0.5394815","text":"@Override\n public void onPageScrollStateChanged(int state) {\n }","title":""},{"docid":"b9cb4e02b2a1b768a502f61e3adb2f86","score":"0.5392918","text":"private void scrollToPosition() {\n if (mRecentPositionStack.isEmpty()) {\n return;\n }\n Integer position = mRecentPositionStack.pop();\n mExplorerMgr.scrollToPositionWithOffset(position, 0);\n Log.i(TAG, \"scrollToPosition: \" + position);\n }","title":""},{"docid":"44f85027fbb0f6a07ca61deb7413ae9c","score":"0.5389978","text":"public void moveDown() {\n\t\tthis.y().set(y().get()+1);\n\t}","title":""},{"docid":"fee2829a8772a87e8fa326151198082d","score":"0.53884774","text":"@Override\n\t\tpublic void onPageScrollStateChanged(int arg0) {\n\t\t\t\n\t\t}","title":""},{"docid":"aefaee8f50878a04cf0a71550219b132","score":"0.5385529","text":"@Override\r\n\t\t\tpublic void onPageScrollStateChanged(int arg0) {\n\t\t\t\t\r\n\t\t\t}","title":""},{"docid":"aefaee8f50878a04cf0a71550219b132","score":"0.5385529","text":"@Override\r\n\t\t\tpublic void onPageScrollStateChanged(int arg0) {\n\t\t\t\t\r\n\t\t\t}","title":""},{"docid":"aefaee8f50878a04cf0a71550219b132","score":"0.5385529","text":"@Override\r\n\t\t\tpublic void onPageScrollStateChanged(int arg0) {\n\t\t\t\t\r\n\t\t\t}","title":""},{"docid":"8016cf16cb1fc6fc6ef03f2c849739a7","score":"0.53819543","text":"@Override\n public void scrollBy(int x, int y) {\n scrollTo(mUnboundedScrollX + x, getScrollY() + y);\n }","title":""},{"docid":"89253d1143159d128fc9c91f76089110","score":"0.53687614","text":"long getScrolledY() {\n JavascriptExecutor js = (JavascriptExecutor) driver;\n return (Long) js.executeScript(\"return window.pageYOffset;\");\n }","title":""},{"docid":"63c84ec713b28c8034453b8cbe9be009","score":"0.53686106","text":"@Override\n public void scrollManuallyTo(int x, int y) {\n final BookDummyAbstractView dummyView = BookControlCenter.Instance().getCurrentView();\n final AnimationProvider animator = getAnimationProvider();\n int pageIndex = animator.getPageToScrollTo(x, y);\n MyReadLog.i(\"scrollManuallyTo\");\n if (dummyView.canScroll(pageIndex == PAGE_POSITION_INDEX_NEXT)) {\n animator.scrollTo(x, y);\n if (animator.inProgress()) {\n drawHandler.sendEmptyMessage(DrawHandler.MESSAGE_DRAW_ANIMATION_PAGES);\n } else {\n drawHandler.sendEmptyMessage(DrawHandler.MESSAGE_DRAW_CURRENT_PAGE);\n }\n }\n }","title":""},{"docid":"a2cff857276ea14a5437bc6d52cfea02","score":"0.53680485","text":"@Override\n public void onPageScrollStateChanged(int i) {\n }","title":""}],"string":"[\n {\n \"docid\": \"8ec250ac7eef922fbd7512c20b2cb097\",\n \"score\": \"0.75142586\",\n \"text\": \"public void robotScrollDown() throws Exception\\r\\n\\t{\\r\\n\\t\\tre = new Robot();\\r\\n\\t\\tre.keyPress(KeyEvent.VK_PAGE_DOWN);\\r\\n\\t\\tre.keyRelease(KeyEvent.VK_PAGE_DOWN);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0566fc48eee5ba8eb64e08fd5eade1fa\",\n \"score\": \"0.73593724\",\n \"text\": \"public void scrollDown() throws Exception \\r\\n\\t{\\r\\n\\t\\t((JavascriptExecutor) getWebDriver()).executeScript(\\\"scroll(0, 100);\\\");\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"46d46778cb6273270f104eec544a2880\",\n \"score\": \"0.7309403\",\n \"text\": \"public /*virtual*/ void PageDown() \\r\\n { \\r\\n double delta = ViewportHeight;\\r\\n if (!IsPixelBased && (Orientation == Orientation.Vertical) && DoubleUtil.IsZero(delta)) \\r\\n {\\r\\n delta = 1;\\r\\n }\\r\\n SetVerticalOffsetImpl(VerticalOffset + delta); \\r\\n SetAnchorInformation(false /*isHorizontalOffset*/);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"32ed546c688a24a307fd83f797bb4d0a\",\n \"score\": \"0.7300112\",\n \"text\": \"protected void scrollDown()\\r\\n {\\n\\t\\toImage.scrollDown();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"11ce62102b63fc6c01002f54d72bfc48\",\n \"score\": \"0.7075755\",\n \"text\": \"public void scrollDown(){\\n Dimension dimension = driver.manage().window().getSize();\\n int scrollStart = (int) (dimension.getHeight() * 0.8);\\n int scrollEnd = (int) (dimension.getHeight() * 0.2);\\n\\n new TouchAction((PerformsTouchActions) driver)\\n .press(PointOption.point(0, scrollStart))\\n .waitAction(WaitOptions.waitOptions(Duration.ofSeconds(1)))\\n .moveTo(PointOption.point(0, scrollEnd))\\n .release().perform();\\n\\n new TouchAction((PerformsTouchActions) driver)\\n .press(PointOption.point(0, scrollStart))\\n .waitAction(WaitOptions.waitOptions(Duration.ofSeconds(1)))\\n .moveTo(PointOption.point(0, scrollEnd))\\n .release().perform();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f9e94b74fe607f38918a037f2e5229b\",\n \"score\": \"0.7067477\",\n \"text\": \"public void scrollDownOfPage(WebElement element) {\\r\\n waitUntilVisible(element);\\r\\n JavascriptExecutor js = (JavascriptExecutor) driver;\\r\\n js.executeScript(\\\"arguments[0].scrollIntoView();\\\", element);\\r\\n\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9e804f84db4643748780a68c80384bf0\",\n \"score\": \"0.69934094\",\n \"text\": \"public void scrollDownVertically() {\\n\\t\\tlog.info(\\\"Scrolling down vertically...\\\");\\n\\t\\texecuteScript(\\\"window.scrollTo(0,document.body.ScrollHeight)\\\");\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a219e371b3164449af79560131725060\",\n \"score\": \"0.69812685\",\n \"text\": \"public static void scrollDown(By locator){\\r\\n WebElement we = getDriver().findElement(locator);\\r\\n\\r\\n we.sendKeys(Keys.PAGE_DOWN);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1c8bc1709dd23d4ae758747d407709d8\",\n \"score\": \"0.6763762\",\n \"text\": \"public void goBackward() {\\r\\n\\t\\tif (pageNumber == 1) { return; }\\r\\n\\t\\tpageNumber-- ;\\r\\n\\t\\tsetPage(pageNumber);\\r\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ee07592947758b0f2fd28ea36a761d14\",\n \"score\": \"0.66335785\",\n \"text\": \"public void scrollToPageEndDynamically() {\\n JavascriptExecutor js = (JavascriptExecutor) driver();\\n int browserHeight = driver().manage().window().getSize().height;\\n long lastHeight = (long) js.executeScript(\\\"return document.body.scrollHeight\\\");\\n int scrollIterator = 1;\\n while (true) {\\n do {\\n js.executeScript(\\\"window.scrollTo(0, \\\" + (browserHeight * scrollIterator) + \\\")\\\");\\n scrollIterator++;\\n waitForSeconds(ONE_SECOND);\\n } while ((long) browserHeight * scrollIterator < lastHeight);\\n\\n long newHeight = (long) js.executeScript(\\\"return document.body.scrollHeight\\\");\\n if (newHeight == lastHeight) {\\n break;\\n }\\n lastHeight = newHeight;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0e89745293eb22beba49be242821aed4\",\n \"score\": \"0.6481591\",\n \"text\": \"protected void scrollToEndPage() {\\n Log.i(TAG, \\\"scrolledReachToLast\\\");\\n\\n if (!mIsLoading) {\\n mIsLoading = true;\\n if (mBaseArrayAdapter != null) {\\n mBaseArrayAdapter.setLoadingItems(true);\\n }\\n\\n mCurrentPage++;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3a966c5271e824931657622d8b582562\",\n \"score\": \"0.6349946\",\n \"text\": \"public void scrollUp() throws Exception \\r\\n\\t{\\r\\n\\t\\t((JavascriptExecutor) getWebDriver()).executeScript(\\\"scroll(0, -100);\\\");\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"218620b77f0339a2f857931885c12d1c\",\n \"score\": \"0.62406516\",\n \"text\": \"public void scrollDownByPixel(int pixel) {\\n\\t\\texecuteScript(\\\"window.scrollBY(0,\\\" + pixel + \\\")\\\");\\n\\t\\tlog.info(\\\"Scrolling down by pixel...\\\");\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b5d6c5289b87b8af202bd21c720619a3\",\n \"score\": \"0.62335426\",\n \"text\": \"public void scrollUpVertically() {\\n\\t\\tlog.info(\\\"Scrolling up vertically...\\\");\\n\\t\\texecuteScript(\\\"window.scrollTo(0,-document.body.ScrollHeight)\\\");\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5e4148806d9bb1f8336b76c59ef86aa4\",\n \"score\": \"0.6231882\",\n \"text\": \"public void scrollDown(ListView<ReadOnlyTask> taskListView) {\\n scrollBar = getScrollBar(taskListView);\\n\\n if (scrollBar == null) {\\n return;\\n }\\n\\n scrollBar.increment();\\n scrollBar.increment();\\n scrollBar.increment();\\n scrollBar.increment();\\n scrollBar.increment();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5dfba4792bcb0f497e9e6e2090ba330b\",\n \"score\": \"0.62246495\",\n \"text\": \"public static void safeScrollDown() throws InterruptedException {\\n Dimension size = androidDriver.manage().window().getSize();\\r\\n //Starting y location set to 80% of the height (near bottom)\\r\\n int starty = (int) (size.height * 0.77);\\r\\n //Ending y location set to 20% of the height (near top)\\r\\n int endy = (int) (size.height * 0.4);\\r\\n //x position set to mid-screen horizontally\\r\\n int startx = (int) (size.width * 0.5);\\r\\n\\r\\n Thread.sleep(2000);\\r\\n (new TouchAction(androidDriver))\\r\\n .press(PointOption.point(startx, starty))\\r\\n .waitAction(WaitOptions.waitOptions(Duration.ofMillis(500)))\\r\\n .moveTo(PointOption.point(startx, endy))\\r\\n .release()\\r\\n .perform();\\r\\n\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c384869f7b4a2d42f763c79c18f9e0ac\",\n \"score\": \"0.62197745\",\n \"text\": \"@Test\\n public void scroll() throws InterruptedException {\\n Actions actions=new Actions(driver);\\n driver.get(\\\"http://practice.cybertekschool.com/infinite_scroll\\\");\\n Thread.sleep(2000);\\n\\n //arrow down\\n\\n actions.sendKeys(Keys.ARROW_DOWN).pause(1000).\\n sendKeys(Keys.ARROW_DOWN).pause(1000).\\n sendKeys(Keys.ARROW_DOWN).pause(1000).build().perform();\\n\\n //arrow up\\n actions.sendKeys(Keys.ARROW_UP).pause(1000).\\n sendKeys(Keys.ARROW_UP).pause(1000).\\n sendKeys(Keys.ARROW_UP).pause(1000).build().perform();\\n //page down\\n\\n actions.sendKeys(Keys.PAGE_DOWN).pause(1000).\\n sendKeys(Keys.PAGE_DOWN).pause(1000).\\n sendKeys(Keys.PAGE_DOWN).pause(1000).build().perform();\\n //page up\\n actions.sendKeys(Keys.PAGE_UP).pause(1000).\\n sendKeys(Keys.PAGE_UP).pause(1000).\\n sendKeys(Keys.PAGE_UP).pause(1000).build().perform();\\n\\n\\n\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"91e4654788ad77a0752ae2eb36420091\",\n \"score\": \"0.61900526\",\n \"text\": \"public void scrollWondow()\\n\\t{\\n\\t\\t\\n\\t\\tJavascriptExecutor jse = (JavascriptExecutor)wd;\\n\\t\\tjse.executeScript(\\\"window.scrollBy(0,-500)\\\", \\\"\\\");\\n\\t\\t\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"328447406a4eb17e2dbb2e649c3db90f\",\n \"score\": \"0.6149867\",\n \"text\": \"public void ScrollDownComplete() {\\n\\t\\tJavascriptExecutor js = (JavascriptExecutor) driver;\\n\\t\\ttry {\\n\\t\\t\\tThread.sleep(10000);\\n\\t\\t} catch (InterruptedException e) {\\n\\t\\t\\t// TODO Auto-generated catch block\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t\\t//System.out.println(\\\"Scroll down completly to load all elements...\\\");\\n\\n\\t\\tfor (int i = 0; i < 10; i++) {\\n\\n\\t\\t\\tjs.executeScript(\\\"window.scrollTo(0, document.body.scrollHeight);\\\");\\n\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ff58ab67c9358584c9d59c6903c2030e\",\n \"score\": \"0.61322606\",\n \"text\": \"protected abstract void reachToEndPage(int page);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bca145db7595ec6b8035197e56b5ff23\",\n \"score\": \"0.6130565\",\n \"text\": \"@Override\\n public void onScrollToLastItem() {\\n currentPage++;\\n loadPage(currentPage);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"171f10a4ff33b09b13d18f17cc5fd48d\",\n \"score\": \"0.6117529\",\n \"text\": \"public void swipeDown() {\\n\\n\\t\\tdriver.swipe(390, 1030, 390, 364, 1000);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f9314898c99d78c2f05f165c5341350\",\n \"score\": \"0.61103535\",\n \"text\": \"public static void scrollToBottomPage(WebDriver driver) {\\n\\t\\tJavascriptExecutor js = (JavascriptExecutor) driver;\\n\\t\\tjs.executeScript(\\\"window.scrollTo(0,Math.max(document.documentElement.scrollHeight,\\\"\\n\\t\\t\\t\\t+ \\\"document.body.scrollHeight,document.documentElement.clientHeight));\\\");\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ae125da191e8cefa6539515612ad4f7f\",\n \"score\": \"0.6085731\",\n \"text\": \"public static void goBackOnePage() {\\n driver().navigate().back();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0c55c3d85c4a8ed5bd1627182fae1566\",\n \"score\": \"0.6082403\",\n \"text\": \"public void robotScrollUp() throws Exception \\r\\n\\t{\\r\\n\\t\\tre = new Robot();\\r\\n\\t\\tre.keyPress(KeyEvent.VK_PAGE_UP);\\r\\n\\t\\tre.keyRelease(KeyEvent.VK_PAGE_UP);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a8446288fe6444c0622951f624b7325\",\n \"score\": \"0.60389405\",\n \"text\": \"public void scrollDownBillingsrulepopup() {\\n getDriver().scrollToElement(getDriver().findElement(By.xpath(\\\"//a[contains(.,'Remove this rule')]\\\")));\\r\\n getDriver().sleep(2000);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4d08e531df1cea1d89c390788eeeef03\",\n \"score\": \"0.593325\",\n \"text\": \"void onScrollVertical(float dy, detailType detailType);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e7e9562ee42a4e286edefd004a2016c3\",\n \"score\": \"0.5928919\",\n \"text\": \"private void scroll() {\\n messagesContainer.setSelection(messagesContainer.getCount() - 1);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9258edbb8cc0593883cc01c9432c9158\",\n \"score\": \"0.58928674\",\n \"text\": \"public void goToTop(View view) {\\n ScrollView mainScroll = findViewById(R.id.mainScroll);\\n mainScroll.post(new Runnable() {public void run() {\\n mainScroll.fullScroll(View.FOCUS_UP);\\n }});\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c617f08a34814819f946faaca93a248a\",\n \"score\": \"0.5887918\",\n \"text\": \"public static void scrollToBottomOfPage(final WebDriver driver) {\\n\\t\\tfinal JavascriptExecutor js = (JavascriptExecutor) driver;\\n\\t\\tjs.executeScript(\\\"window.scrollTo(0, document.body.scrollHeight);\\\");\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"99f1ae78052bc3e42ce0db74d0d2835f\",\n \"score\": \"0.5880314\",\n \"text\": \"void scroll(int pixels);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"520c0fb9358d9dfe0530e0bc5e326c45\",\n \"score\": \"0.58782905\",\n \"text\": \"protected abstract void reachToLastPage();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0e503eca60cae1f13f8e00757d2991cf\",\n \"score\": \"0.5856939\",\n \"text\": \"protected void scrollUp()\\r\\n {\\n\\t\\toImage.scrollUp();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5058c3f9a4c1b93c3e34edad1de030e3\",\n \"score\": \"0.58517957\",\n \"text\": \"public static void scrollToBottom(WebDriver driver)\\n\\t{\\n\\t\\texecute(driver, _JS_ScrollToBottom, null);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9860a8a322d1629df4fffa6cb1f5025d\",\n \"score\": \"0.5823885\",\n \"text\": \"public void next(View view)\\n {\\n if(mScrolledToBottom)\\n {\\n //go to next activity\\n Intent intent = new Intent(this, NextActivity.class);\\n startActivity(intent);\\n }\\n else\\n {\\n //check if scrollable\\n if (mScrollView.fullScroll(View.FOCUS_DOWN))\\n {\\n mScrolledToBottom = true;\\n }\\n else\\n {\\n //go to next activity\\n Intent intent = new Intent(this, NextActivity.class);\\n startActivity(intent);\\n }\\n }\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cbdfd6b565a8520bc53a383d101a4c05\",\n \"score\": \"0.58216643\",\n \"text\": \"public abstract void scrollToFinishActivity();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5194aafa61257f49d5eaf042a0c5c5a1\",\n \"score\": \"0.5816734\",\n \"text\": \"private void scroll() {\\n\\t\\tJavascriptExecutor js = (JavascriptExecutor) driver;\\n\\t\\tjs.executeScript(\\\"javascript:window.scrollBy(250,350)\\\");\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f0bc008146b4fdeee7bc44a9e85e6f03\",\n \"score\": \"0.5800191\",\n \"text\": \"public void clicklastpage() {\\r\\n\\t\\tthis.lastPage.click();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"56be402706bbc3e58aba68be66a53140\",\n \"score\": \"0.57976854\",\n \"text\": \"public /*virtual*/ void PageUp()\\r\\n { \\r\\n double delta = ViewportHeight;\\r\\n if (!IsPixelBased && (Orientation == Orientation.Vertical) && DoubleUtil.IsZero(delta))\\r\\n {\\r\\n delta = 1; \\r\\n }\\r\\n SetVerticalOffsetImpl(VerticalOffset - delta); \\r\\n SetAnchorInformation(false /*isHorizontalOffset*/); \\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7077e3b9ae97032113c7ff85dde63c46\",\n \"score\": \"0.578666\",\n \"text\": \"public boolean scroll();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e0f9cc8297724811a9b7b9399fa5a613\",\n \"score\": \"0.5769588\",\n \"text\": \"public static void scrollToBottom(WebDriver driver) {\\n ((JavascriptExecutor) driver).executeScript(\\\"scroll(0,document.body.offsetHeight)\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fefc133cafdc00db76b5723ca5d893ce\",\n \"score\": \"0.5748012\",\n \"text\": \"public void down(int increment)\\r\\n {\\r\\n this.setYPos(this.getYPos() + increment); \\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8e1e6924b192fd48b679657d680265f1\",\n \"score\": \"0.5743316\",\n \"text\": \"void downJump() {\\n\\t\\tif (((position.y - eyeHeight.y) > level.lowestTop + 10)) {\\n\\t\\t\\tif (jumpState == JumpState.GROUNDED) {\\n\\t\\t\\t\\tjumpState = JumpState.FALLING;\\n\\t\\t\\t\\tposition.y -= 10;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"48a512ec9af607c56bf7cf18e6b3c467\",\n \"score\": \"0.5730551\",\n \"text\": \"public void goToPage(int page) {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aad20fad77c7d2d7539572a938076202\",\n \"score\": \"0.5722523\",\n \"text\": \"PageElementValue<Integer> getScrollTop();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e7d7aa0845f75b59dba9a08ea85a824f\",\n \"score\": \"0.57138646\",\n \"text\": \"public void restoreScroll() {\\r\\n int oldX = getDescriptor().getScrollX();\\r\\n int oldY = getDescriptor().getScrollY();\\r\\n scrollViewTo(getDescriptor().getScrollX(), getDescriptor().getScrollY());\\r\\n setDescriptorScrolls(oldX, oldY);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"82b523e4d4fb15dbda5c594af87083c8\",\n \"score\": \"0.56861013\",\n \"text\": \"public void moveDown() {\\n\\t\\tthis.moveY(10);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1b7f843470ba3394c973c085e8675bef\",\n \"score\": \"0.5665337\",\n \"text\": \"public static void scrollTopToBottom(int x,int time , AndroidDriver driver)\\r\\n\\t\\t{\\r\\n\\t\\t\\tclass Local {};\\r\\n\\t\\t String methodName = Local.class.getEnclosingMethod().getName();\\r\\n\\t\\t\\tUniversalVariables.ScreenDimensions =driver.manage().window().getSize();\\r\\n\\t\\t\\tint startY = (int)(UniversalVariables.ScreenDimensions.height *0.10);\\r\\n\\t\\t\\tint endY = (int)(UniversalVariables.ScreenDimensions.height *0.90);\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\r\\n\\t\\t\\ttry {\\r\\n\\t\\t\\t\\tdriver.swipe(x, startY, x, endY, time);\\r\\n\\t\\t\\t\\tUniversalVariables.test.log(Status.INFO,methodName+\\\": performed scroll Top to Bottom\\\" );\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tcatch(Exception e)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tUniversalVariables.test.log(Status.INFO,methodName+\\\": Not performed scroll Top to Bottom\\\" );\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c193658fbf9b1bb2ba8c2fd7ef96dae\",\n \"score\": \"0.56567943\",\n \"text\": \"public int getDownScrollY() {\\n /*\\n // Can't load method instructions: Load method exception: bogus opcode: 00e3 in method: com.color.view.analysis.ColorViewAnalyzer.ScrollTouchData.getDownScrollY():int, dex: \\n */\\n throw new UnsupportedOperationException(\\\"Method not decompiled: com.color.view.analysis.ColorViewAnalyzer.ScrollTouchData.getDownScrollY():int\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b5300975fade7f3ca16c42ee6a0a3db8\",\n \"score\": \"0.5655521\",\n \"text\": \"private void scrollToTop() {\\n spnFlowScroll.setVvalue(0.00f);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"36e321c7a37071ba67e255b7db853c86\",\n \"score\": \"0.5626169\",\n \"text\": \"void nextPage();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"19fd00a1175c0edc3d2e776dccb62882\",\n \"score\": \"0.5625645\",\n \"text\": \"public void moveDown(){\\n position.incrementCurrentY(1);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0b36d3b508ce533e003f92c37acace91\",\n \"score\": \"0.5620542\",\n \"text\": \"@Override\\r\\n\\tpublic void scrollBy(int x, int y) {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"25e7b67b8d50947961ca7e658bc95864\",\n \"score\": \"0.5616982\",\n \"text\": \"public void scrollToBottomOfThePage(WebDriver driver,String element) {\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tWebElement webElement = locator.findObject(driver, element);\\r\\n\\t\\t\\tJavascriptExecutor js = (JavascriptExecutor) driver;\\r\\n\\t\\t\\tjs.executeScript(\\\"arguments[0].scrollIntoView();\\\", webElement);\\r\\n\\t\\t} catch (Exception e) {\\r\\n\\t\\t\\te.printStackTrace();\\r\\n\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d891ae43f2efe686d0b5a8cfe5c4cd5d\",\n \"score\": \"0.5608624\",\n \"text\": \"public void moveDown()\\r\\n {\\r\\n moveVertical(20);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cb10e7ec5845cbd20d57897ca3d75bcb\",\n \"score\": \"0.56036556\",\n \"text\": \"public boolean scrollToTop(String name, String locator) throws Exception \\n{\\n\\t//copy from ==> machine\\n\\t try\\n\\t {\\n\\t\\t \\t\\tSystem.out.println(\\\"before scroll\\\");\\n\\t\\t \\t\\t//PropertiesAndConstants.Selenium.scrollToExact(\\\"Recharge Amount\\\");\\n\\t\\t \\t\\t//PropertiesAndConstants.Selenium.\\n\\t\\t \\t\\t////System.out.println(\\\"after recharge\\\");\\n\\t\\t \\t//\\tThread.sleep(5000);\\n\\t\\t\\t //((JavascriptExecutor) PropertiesAndConstants.Selenium).executeScript(\\\"window.scrollTo(0, document.body.scrollHeight)\\\");\\n\\t\\t\\t \\tWebElement webElement = WaitForElementPresent(name, locator);\\n\\t\\t JavascriptExecutor js = (JavascriptExecutor) PropertiesAndConstants.Selenium;\\n\\t\\t HashMap<String, String> scrollObject = new HashMap<String, String>();\\n\\t\\t // scrollObject.put(\\\"direction\\\", \\\"down\\\");\\n\\t\\t scrollObject.put(\\\"direction\\\", \\\"down\\\");\\n\\t\\t //scrollObject.put(\\\"element\\\", ((RemoteWebElement) webElement).getId());\\n\\t\\t js.executeScript(\\\"mobile: scroll\\\", scrollObject);\\n\\t\\t LogFunctions.LogEntry(\\\"Pass - to scroll at the bottom\\\", true);\\n\\t\\t PropertiesAndConstants.scriptExecutionResult = \\\"Pass\\\";\\n\\t return true;\\n\\t }\\n\\t catch(Exception e)\\n\\t {\\n\\t\\t e.printStackTrace();\\n\\t LogFunctions.LogEntry(\\\"Fail to scroll at the bottom\\\", false);\\n\\t PropertiesAndConstants.scriptExecutionResult = \\\"Fail\\\";\\n\\t return false;\\n\\t }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5efaa5e92f1f5c6c47a0e5ba70f4d6be\",\n \"score\": \"0.56033987\",\n \"text\": \"public static void scrollBottomToTop(int x,int time , AndroidDriver driver)\\r\\n\\t\\t{\\r\\n\\t\\t\\tclass Local {};\\r\\n\\t\\t String methodName = Local.class.getEnclosingMethod().getName();\\r\\n\\t\\tUniversalVariables.ScreenDimensions =driver.manage().window().getSize();\\r\\n\\t\\tint startY = (int)(UniversalVariables.ScreenDimensions.height *0.90);\\r\\n\\t\\tint endY = (int)(UniversalVariables.ScreenDimensions.height *0.10);\\r\\n\\t\\t\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tdriver.swipe(x, startY, x, endY, time);\\r\\n\\t\\t\\tUniversalVariables.test.log(Status.INFO,methodName+\\\": performed scroll Bottom to Top\\\" );\\r\\n\\t\\t}\\r\\n\\t\\tcatch(Exception e)\\r\\n\\t\\t{\\r\\n\\t\\t\\tUniversalVariables.test.log(Status.INFO,methodName+\\\": Not performed scroll Bottom to Top\\\" );\\r\\n\\t\\t}\\r\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"caa2cfe51b71bf146f483fef69943e32\",\n \"score\": \"0.55883676\",\n \"text\": \"public /*virtual*/ void LineDown()\\r\\n {\\r\\n SetVerticalOffsetImpl(VerticalOffset + ((Orientation == Orientation.Vertical && !IsPixelBased) ? 1.0 : ScrollViewer._scrollLineDelta)); \\r\\n SetAnchorInformation(false /*isHorizontalOffset*/);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7b86a7dc7692a1e4abd7b09e8663363d\",\n \"score\": \"0.5562909\",\n \"text\": \"@Override\\n\\t\\t\\tpublic void mouseClicked(MouseEvent e) {\\n\\t\\t\\t\\tpage--;\\n\\t\\t\\t\\tupdatePage();\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"23a6a9ed9bc54b290f06af8af95fa82e\",\n \"score\": \"0.5559441\",\n \"text\": \"public void showDownPage() {\\n LOG.mo8825d(\\\"...showDownPage...\\\");\\n if (this.mDownLoadPage == null) {\\n this.mDownLoadPage = new PageDownLoad(this, this);\\n this.mContentLayout.addView(this.mDownLoadPage.getmContentView());\\n }\\n Secure.putInt(getContentResolver(), \\\"pageInx\\\", 2);\\n Intent intent = new Intent(\\\"net.sunniwell.MarqueeTextView_PAGE_CHANGED\\\");\\n intent.putExtra(\\\"pageInx\\\", 2);\\n sendBroadcast(intent);\\n if (this.mEPGPage != null) {\\n LOG.mo8825d(\\\"mEPGPage---->INVISIBLE\\\");\\n this.mEPGPage.setVisibility(4);\\n }\\n if (this.mCategoryPage != null) {\\n LOG.mo8825d(\\\"mCategoryPage---->INVISIBLE\\\");\\n this.mCategoryPage.setVisibility(4);\\n }\\n if (this.mLivePage != null) {\\n LOG.mo8825d(\\\"mLivePage---->INVISIBLE\\\");\\n this.mLivePage.setVisibility(4);\\n }\\n this.mDownLoadPage.bringToFront();\\n this.mDownLoadPage.onResume();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"24677e1071a63269f2adcdc9f920904c\",\n \"score\": \"0.55508476\",\n \"text\": \"public boolean scrollToBottom(String name, String locator) throws Exception \\n{\\n\\t//copy from ==> machine\\n\\t try\\n\\t {\\n\\t\\t\\t //((JavascriptExecutor) PropertiesAndConstants.Selenium).executeScript(\\\"window.scrollTo(0, document.body.scrollHeight)\\\");\\n\\t\\t\\t \\tWebElement webElement = WaitForElementPresent(name, locator);\\n\\t\\t JavascriptExecutor js = (JavascriptExecutor) PropertiesAndConstants.Selenium;\\n\\t\\t HashMap<String, String> scrollObject = new HashMap<String, String>();\\n\\t\\t // scrollObject.put(\\\"direction\\\", \\\"down\\\");\\n\\t\\t scrollObject.put(\\\"direction\\\", \\\"down\\\");\\n\\t\\t //scrollObject.put(\\\"element\\\", ((RemoteWebElement) webElement).getId());\\n\\t\\t js.executeScript(\\\"mobile: scroll\\\", scrollObject);\\n\\t\\t LogFunctions.LogEntry(\\\"Pass - to scroll at the bottom\\\", true);\\n\\t\\t PropertiesAndConstants.scriptExecutionResult = \\\"Pass\\\";\\n\\t return true;\\n\\t }\\n\\t catch(Exception e)\\n\\t {\\n\\t LogFunctions.LogEntry(\\\"Fail to scroll at the bottom\\\", false);\\n\\t PropertiesAndConstants.scriptExecutionResult = \\\"Fail\\\";\\n\\t return false;\\n\\t }\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e45ca6c170570d06e4971a7e6629c268\",\n \"score\": \"0.5550592\",\n \"text\": \"@Override\\n public void onClick(View v) {\\n\\n int newPosition = mVelocityViewPager.getCurrentItem() - 1;\\n if (newPosition > -1) {\\n scrollViewPager(newPosition, true, 1, true);\\n } else {\\n mVelocityViewPager.setCurrentItem(0, false);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"adf6fcb643b39b65e8b1d3f515af12fd\",\n \"score\": \"0.5546955\",\n \"text\": \"public void moveDown() {\\n\\t\\ty -= 1;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"057aae02ac4bc0b95f31cbd0f16bc557\",\n \"score\": \"0.5539647\",\n \"text\": \"private void onTouchUpEvent(MotionEvent ev) {\\n \\n final int activePointerId = mActivePointerId;\\n final int pointerIndex = ev.findPointerIndex(activePointerId);\\n final VelocityTracker velocityTracker = mVelocityTracker;\\n velocityTracker.computeCurrentVelocity(ONE_SECOND, mMaximumVelocity);\\n \\n final float x = ev.getX(pointerIndex);\\n int velocityX = (int) velocityTracker.getXVelocity(activePointerId);\\n \\n final int deltaX = (int) (x - mDownMotionX);\\n \\n final int pageWidth = (getMeasuredWidth() - getPaddingLeft() - getPaddingRight());\\n boolean isSignificantMove = Math.abs(deltaX) > (pageWidth * SIGNIFICANT_MOVE_THRESHOLD);\\n \\n int finalChild;\\n int flipChildNum;\\n \\t\\n if (mTouchState == TOUCH_STATE_SCROLLING) {\\n \\t\\n mTotalMotionX += Math.abs(mLastMotionX + mLastMotionXRemainder - x);\\n boolean isFling = mTotalMotionX > MIN_LENGTH_FOR_FLING &&\\n Math.abs(velocityX) > mFlingThresholdVelocity;\\n\\n // In the case that the page is moved far to one direction and then is flung\\n // in the opposite direction, we use a threshold to determine whether we should\\n // just return to the starting page, or if we should skip one further.\\n boolean returnToOriginalIndex = false;\\n if (Math.abs(deltaX) > pageWidth * RETURN_TO_ORIGINAL_INDEX_THRESHOLD &&\\n Math.signum(velocityX) != Math.signum(deltaX) && isFling) {\\n returnToOriginalIndex = true;\\n }\\n \\n // We give flings precedence over large moves, which is why we short-circuit our\\n // test for a large move if a fling has been registered. That is, a large\\n // move to the left and fling to the right will register as a fling to the right.\\n if ((isFling && velocityX > 0) && (mFirstVisibleChildIndex > 0)) {\\n \\t\\n \\t// flip according to scroll velocity or distance\\n \\tif (mFlipChildNum <= -1) {\\n \\t\\t// if user significant scroll a long distance,\\n \\t\\t// we use distance as flip parameter. \\n \\t\\tif (isSignificantMove) {\\n \\t\\t\\tflipChildNum = computeScrollChildNum(deltaX);\\n \\t\\t} else {\\n \\t\\t\\tflipChildNum = computeScrollChildNumByVelocity(velocityX);\\n \\t\\t}\\n \\t} else {\\n \\t\\t// manual set flip number.\\n \\t\\tflipChildNum = mFlipChildNum;\\n \\t}\\n \\t\\n \\tfinalChild = returnToOriginalIndex ? mFirstVisibleChildIndex : mFirstVisibleChildIndex - flipChildNum;\\n \\tif (DEBUG) {\\n \\t\\tLogUtils.d(TAG, \\\"Touch up scroll to prev: state: \\\" + mTouchState + \\\" final child: \\\" + finalChild \\n \\t\\t\\t\\t+ \\\" returned: \\\" + returnToOriginalIndex + \\\" first: \\\" + mFirstVisibleChildIndex \\n \\t\\t\\t\\t+ \\\" flip child num: \\\" + flipChildNum);\\n \\t}\\n snapToChildWithVelocity(finalChild, velocityX);\\n \\n } else if ((isFling && velocityX < 0) && \\n \\t\\t(mFirstVisibleChildIndex < getMaxSnapIndex())) {\\n \\t\\n \\tif (mFlipChildNum <= -1) {\\n \\t\\tif (isSignificantMove) {\\n \\t\\t\\tflipChildNum = computeScrollChildNum(deltaX);\\n \\t\\t} else {\\n \\t\\t\\tflipChildNum = computeScrollChildNumByVelocity(velocityX);\\n \\t\\t}\\n \\t} else {\\n \\t\\tflipChildNum = mFlipChildNum;\\n \\t}\\n \\t\\n \\tfinalChild = returnToOriginalIndex ? mFirstVisibleChildIndex : mFirstVisibleChildIndex + flipChildNum;\\n \\tif (DEBUG) {\\n \\t\\tLogUtils.d(TAG, \\\"Touch up scroll to next: state: \\\" + mTouchState + \\\" final child: \\\" + finalChild \\n \\t\\t\\t\\t+ \\\" returned: \\\" + returnToOriginalIndex + \\\" first: \\\" + mFirstVisibleChildIndex \\n \\t\\t\\t\\t+ \\\" flip child num: \\\" + flipChildNum);\\n \\t}\\n snapToChildWithVelocity(finalChild, velocityX);\\n \\n } else {\\n \\tfinalChild = findNearestChild(getScrollX());\\n \\tif (DEBUG) {\\n \\t\\tLogUtils.d(TAG, \\\"Alignment to index: \\\" + finalChild + \\\" velocityX: \\\" + velocityX);\\n \\t}\\n \\tsnapToChildWithVelocity(finalChild, velocityX);\\n }\\n \\n } else {\\n onUnhandledTap(ev);\\n }\\n \\n mTouchState = TOUCH_STATE_REST;\\n mActivePointerId = INVALID_POINTER;\\n releaseVelocityTracker();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0f77878e2bcae47ffdd6a82555d8eee7\",\n \"score\": \"0.5538322\",\n \"text\": \"public void endScroll() {\\n /*\\n // Can't load method instructions: Load method exception: bogus opcode: 00eb in method: com.color.view.analysis.ColorViewAnalyzer.endScroll():void, dex: \\n */\\n throw new UnsupportedOperationException(\\\"Method not decompiled: com.color.view.analysis.ColorViewAnalyzer.endScroll():void\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8266202e4598dbf8621a48f967a060db\",\n \"score\": \"0.5518869\",\n \"text\": \"@Override\\r\\n\\t\\tpublic void toNext() {\\r\\n\\t\\t\\t// TODO Auto-generated method stub\\r\\n\\t\\t\\tPage.nextPage(); //increase page counter\\r\\n\\t\\t\\tif(Page.getCurrenPage() > 0 && Page.getCurrenPage() < pages.size() - 1){\\r\\n\\t\\t\\t\\tsetStateMiddlePage();\\r\\n\\t\\t\\t}else{\\r\\n\\t\\t\\t\\tsetStateLastPage();\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6333aaef65a287258e86f60aa80d2677\",\n \"score\": \"0.5490985\",\n \"text\": \"@Override\\r\\n\\tpublic int getScrollY() {\\n\\t\\treturn 0;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c857617428dcf9c3a85634d54f324f59\",\n \"score\": \"0.54820204\",\n \"text\": \"public void pageLast() {\\n int count = dataTable.getRowCount();\\n int rows = dataTable.getRows();\\n dataTable.setFirst(count - ((count % rows != 0) ? count % rows : rows));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1592987f13cb347e893cfd7750c74b1a\",\n \"score\": \"0.54789305\",\n \"text\": \"@Test\\r\\n\\tpublic void checkScrollBarActions() throws InterruptedException\\r\\n\\t{\\r\\n\\t\\tdriver.get(\\\"file:///C:/Users/karthick_jaipal/Desktop/Page3.html\\\");\\r\\n\\t\\t//TypeCasting to access js methods\\r\\n\\t\\tJavascriptExecutor js=(JavascriptExecutor)driver;\\r\\n\\t\\t//To scrolldown with some value\\r\\n\\t\\tfor(int i=0;i<3;i++)\\r\\n\\t\\t{\\r\\n\\t\\t\\tjs.executeScript(\\\"window.scrollBy(0,10)\\\");\\r\\n\\t\\t\\tThread.sleep(2000);\\r\\n\\t\\t}\\r\\n\\t\\t//To scrollUp with some value\\r\\n\\t\\tfor(int i=0;i<3;i++)\\r\\n\\t\\t{\\r\\n\\t\\t\\tjs.executeScript(\\\"window.scrollBy(10,0)\\\");\\r\\n\\t\\t\\tThread.sleep(2000);\\r\\n\\t\\t}\\r\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4abbdece5b4fdbbea22d7d67cf041169\",\n \"score\": \"0.54751974\",\n \"text\": \"@Override\\r\\n\\tpublic void invoke(long window, double x, double y) {\\n\\t\\tif (y == 1) {\\r\\n\\t\\t\\tscrollUp = true;\\r\\n\\t\\t} else if (y == -1) {\\r\\n\\t\\t\\tscrollDown = true;\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"72f5dc0e5101b9645dc5d051799152cc\",\n \"score\": \"0.54727226\",\n \"text\": \"void updateScroll(int x, int y) {\\n // TODO Implement\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a167cdcdb21abecbb7a3b05e56851a39\",\n \"score\": \"0.5458592\",\n \"text\": \"@Override\\n\\t\\t\\tpublic void onPageScrollStateChanged(int arg0) {\\n\\t\\t\\t\\t\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a167cdcdb21abecbb7a3b05e56851a39\",\n \"score\": \"0.5458592\",\n \"text\": \"@Override\\n\\t\\t\\tpublic void onPageScrollStateChanged(int arg0) {\\n\\t\\t\\t\\t\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a167cdcdb21abecbb7a3b05e56851a39\",\n \"score\": \"0.5458592\",\n \"text\": \"@Override\\n\\t\\t\\tpublic void onPageScrollStateChanged(int arg0) {\\n\\t\\t\\t\\t\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a167cdcdb21abecbb7a3b05e56851a39\",\n \"score\": \"0.5458592\",\n \"text\": \"@Override\\n\\t\\t\\tpublic void onPageScrollStateChanged(int arg0) {\\n\\t\\t\\t\\t\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a167cdcdb21abecbb7a3b05e56851a39\",\n \"score\": \"0.5458592\",\n \"text\": \"@Override\\n\\t\\t\\tpublic void onPageScrollStateChanged(int arg0) {\\n\\t\\t\\t\\t\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"417ffa6f78df19ecb3f9ba1528ccc047\",\n \"score\": \"0.5452799\",\n \"text\": \"default AfterWhereBuilder<T> scroll() {\\n\\t\\t\\treturn scroll(DEFAULT_SCROLL_KEEP_ALIVE);\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"39af467c49fedef5800c8ffdb606660c\",\n \"score\": \"0.5441894\",\n \"text\": \"public static void scrollToPageTop(final WebDriver driver) {\\n\\t\\tfinal JavascriptExecutor js = (JavascriptExecutor) driver;\\n\\t\\tjs.executeScript(\\\"window.scrollTo(0, 0);\\\");\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4671301394bcf871ba9cba2f03696335\",\n \"score\": \"0.5437553\",\n \"text\": \"public void scrollto(String text) {\\n\\t\\tdriver.scrollTo(text);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0dd4f805a286e28a11abeb24758e5877\",\n \"score\": \"0.5435725\",\n \"text\": \"public void onPageScrollStateChanged(int arg0) {\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8357f63e5fc3e9a1157b94f55cf311e6\",\n \"score\": \"0.5422619\",\n \"text\": \"public void onPageScrollStateChanged(int state) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8357f63e5fc3e9a1157b94f55cf311e6\",\n \"score\": \"0.5422619\",\n \"text\": \"public void onPageScrollStateChanged(int state) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"31d7ba0e112b5a3e4fdf56c8684f5e3a\",\n \"score\": \"0.5417588\",\n \"text\": \"PageElementValue<Integer> getScrollHeight();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6e8b5735ebad24dae00452a2d8582354\",\n \"score\": \"0.5413178\",\n \"text\": \"public void pageNext() {\\n dataTable.setFirst(dataTable.getFirst() + dataTable.getRows());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a3605e3d96c32709c9df0e7c6b39c860\",\n \"score\": \"0.5407744\",\n \"text\": \"public abstract void onScroll(double delta);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4743d6880a03a1f611a8bfff9b33e942\",\n \"score\": \"0.540674\",\n \"text\": \"@Override\\n public void onPageScrollStateChanged(int state) {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"69081374c1de50a9c4da12f4b950aab1\",\n \"score\": \"0.54023284\",\n \"text\": \"public void scrollToBottom() {\\n\\t\\t\\n\\t\\t// Calculate the size of the content panel.\\n\\t\\tint tableHeight = 0;\\n\\t\\tint numCells = _delegate.getNumberOfCells( this );\\n\\t\\tint cellSpacing = _delegate.getCellSpacing(this);\\n\\t\\tfor( int index = 0; index < numCells; index++ ) {\\n\\n\\t\\t\\tint cellHeight = _delegate.getCellHeight( this, index );\\n\\t\\t\\ttableHeight += cellHeight + cellSpacing;\\n\\n\\t\\t}\\n\\t\\t\\n\\t\\t// Calculate the bottom of the scrolling thing.\\n\\t\\tint now = _scrollPanel.getVerticalScrollBar().getValue();\\n\\t\\t\\n\\t\\t_scrollPanel.getVerticalScrollBar().setValue( now + 61 );\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7212ecf541ab5456a0fa82f97b3dd997\",\n \"score\": \"0.539926\",\n \"text\": \"public void goForward() {\\r\\n\\t\\tif (pageNumber == maxPage) { return; }\\r\\n\\t\\tpageNumber++ ;\\r\\n\\t\\tsetPage(pageNumber);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ad711f48b1fd3721d3d12c163f580434\",\n \"score\": \"0.53971964\",\n \"text\": \"@Override\\n\\t\\t\\t\\tpublic void onPageScrollStateChanged(int arg0) {\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"75b1fce06eb618b9ea463f8a44fd94eb\",\n \"score\": \"0.5394815\",\n \"text\": \"@Override\\n public void onPageScrollStateChanged(int state) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b9cb4e02b2a1b768a502f61e3adb2f86\",\n \"score\": \"0.5392918\",\n \"text\": \"private void scrollToPosition() {\\n if (mRecentPositionStack.isEmpty()) {\\n return;\\n }\\n Integer position = mRecentPositionStack.pop();\\n mExplorerMgr.scrollToPositionWithOffset(position, 0);\\n Log.i(TAG, \\\"scrollToPosition: \\\" + position);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"44f85027fbb0f6a07ca61deb7413ae9c\",\n \"score\": \"0.5389978\",\n \"text\": \"public void moveDown() {\\n\\t\\tthis.y().set(y().get()+1);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fee2829a8772a87e8fa326151198082d\",\n \"score\": \"0.53884774\",\n \"text\": \"@Override\\n\\t\\tpublic void onPageScrollStateChanged(int arg0) {\\n\\t\\t\\t\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aefaee8f50878a04cf0a71550219b132\",\n \"score\": \"0.5385529\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void onPageScrollStateChanged(int arg0) {\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aefaee8f50878a04cf0a71550219b132\",\n \"score\": \"0.5385529\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void onPageScrollStateChanged(int arg0) {\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aefaee8f50878a04cf0a71550219b132\",\n \"score\": \"0.5385529\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void onPageScrollStateChanged(int arg0) {\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8016cf16cb1fc6fc6ef03f2c849739a7\",\n \"score\": \"0.53819543\",\n \"text\": \"@Override\\n public void scrollBy(int x, int y) {\\n scrollTo(mUnboundedScrollX + x, getScrollY() + y);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"89253d1143159d128fc9c91f76089110\",\n \"score\": \"0.53687614\",\n \"text\": \"long getScrolledY() {\\n JavascriptExecutor js = (JavascriptExecutor) driver;\\n return (Long) js.executeScript(\\\"return window.pageYOffset;\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"63c84ec713b28c8034453b8cbe9be009\",\n \"score\": \"0.53686106\",\n \"text\": \"@Override\\n public void scrollManuallyTo(int x, int y) {\\n final BookDummyAbstractView dummyView = BookControlCenter.Instance().getCurrentView();\\n final AnimationProvider animator = getAnimationProvider();\\n int pageIndex = animator.getPageToScrollTo(x, y);\\n MyReadLog.i(\\\"scrollManuallyTo\\\");\\n if (dummyView.canScroll(pageIndex == PAGE_POSITION_INDEX_NEXT)) {\\n animator.scrollTo(x, y);\\n if (animator.inProgress()) {\\n drawHandler.sendEmptyMessage(DrawHandler.MESSAGE_DRAW_ANIMATION_PAGES);\\n } else {\\n drawHandler.sendEmptyMessage(DrawHandler.MESSAGE_DRAW_CURRENT_PAGE);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a2cff857276ea14a5437bc6d52cfea02\",\n \"score\": \"0.53680485\",\n \"text\": \"@Override\\n public void onPageScrollStateChanged(int i) {\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":9831,"numItemsPerPage":100,"numTotalItems":995064,"offset":983100,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3OTU0Nzg3Miwic3ViIjoiL2RhdGFzZXRzL250aGFrdXIvY29ybnN0YWNrLWphdmEtdjEtdGV2YXRyb24tMU0iLCJleHAiOjE3Nzk1NTE0NzIsImlzcyI6Imh0dHBzOi8vaHVnZ2luZ2ZhY2UuY28ifQ.PR9bP4eMGzOrQuuGi7RLL7utt7nuF0QwDA5l5dsY0GiUFmyn6eCL229r0HCTj4Hpm5HRkPTjIlIVSM00Iq0wBQ","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 |
|---|---|---|---|
b93636fdab992888ef2d1e801881b74c | Gets the uuid of an online player based on a partial name. | [
{
"docid": "42d9d2523435658f3c8df18e6052935b",
"score": "0.7397474",
"text": "public static UUID getID(String name) {\n UUID partial = null;\n boolean startsWith = false;\n for (Player p : Bukkit.getServer().getOnlinePlayers()) {\n if (p.getName().equalsIgnoreCase(name)) ... | [
{
"docid": "74bfc9a3f402f853fe641dc653dcf08b",
"score": "0.71191037",
"text": "public UUID getPlayerUUID(String playername) {\n Player p = getServ().getPlayer(playername);\n if (p == null) {\n OfflinePlayer po = OfflinePlayerList.get(playername.toLowerCase());\n if (p... |
c10c202ceee3aab1a72711009b1092d6 | Here to prevent the dom update when parents is Mtabs and it decide to ignore response for this class. This is for the movable feature, because we will update client first and then update server component The add moved will be called when its parent insertBefore or appndChild | [
{
"docid": "0fcad363a31d3843311b83ef58221710",
"score": "0.6022442",
"text": "protected void addMoved(Component oldparent, Page oldpg, Page newpg) {\r\n\r\n\t\tif (this.getParent() instanceof Swifttabs) {\r\n\t\t\tSwifttabs tabs = (Swifttabs) getParent();\r\n\t\t\tif (tabs.isNoResponse()) {\r\n\t\t\t\tr... | [
{
"docid": "99cc129d18c1bff2a8cac7a9e60ba2d2",
"score": "0.57432836",
"text": "@Override\r\n\tprotected boolean beforeAdd() {\n\t\treturn false;\r\n\t}",
"title": ""
},
{
"docid": "dbcc097b7735857ce0bbe1385c678146",
"score": "0.5596259",
"text": "@Override\r\n public void ... |
d5fc03fc9e2988b2941207cf7c3eea3c | List of orders ordered by best price/latest time. | [
{
"docid": "882869ca8269ff226398af406f399651",
"score": "0.0",
"text": "public interface OrderList {\n\n List<Order> asList();\n\n}",
"title": ""
}
] | [
{
"docid": "7ebc72f1cbcfec4eb14f96145c83c23e",
"score": "0.6372913",
"text": "public List<Vehicle> findAllOrderByPriceAsc() {\n return this.findAll().stream()\n .sorted(Comparator.comparingDouble(Vehicle::getPrice))\n .collect(Collectors.toList());\n }",
"title": ""
},
{
"d... |
e56389f46802410840328dfcc4584271 | repeated .CMsgDOTAAwardEventPoints.AwardPoints award_points = 1; | [
{
"docid": "0c59d311d28187068027a8e2abb21181",
"score": "0.5282099",
"text": "public Builder setAwardPoints(\n int index, DotaGcmessagesServer.CMsgDOTAAwardEventPoints.AwardPoints value) {\n if (awardPointsBuilder_ == null) {\n if (value == null) {\n throw new NullPoi... | [
{
"docid": "3a75f22f974f8bfe3b71aed413d1cdce",
"score": "0.7185706",
"text": "DotaGcmessagesServer.CMsgDOTAAwardEventPoints.AwardPoints getAwardPoints(int index);",
"title": ""
},
{
"docid": "a4d43dde2035a69143ad569777ebb2bf",
"score": "0.6083721",
"text": "java.util.List<DotaGcmessa... |
42969f281aa7d4e56f5def0305f4ac55 | To make instance of mainaction for module | [
{
"docid": "241bb4bfc56dbf9f70cf1e06621d3b2e",
"score": "0.62396663",
"text": "@Mapping(target = \"id\", expression = \"java(idGenerator.generate())\")\n\t@Mapping(target = \"module\", expression = \"java(DtoMapper.INSTANCE.toModuleDto(module))\")\n\t@Mapping(target = \"parent\", expression = \"java(nul... | [
{
"docid": "9061ce773c21646620491c7fa280545c",
"score": "0.6411695",
"text": "ModuleInvocationHandler() {\n\n }",
"title": ""
},
{
"docid": "6e966ca3cd6525c2489f234ca92df311",
"score": "0.6371074",
"text": "Module createModule();",
"title": ""
},
{
"docid": "6e966ca3cd... |
fc1ccde01722942bbef8fa0c1584b42c | BufferLayer( 638): dimensions too large 5760 x 3240 | [
{
"docid": "45de32484c2cd87cdfc601c19d527af2",
"score": "0.0",
"text": "protected int getWidth() {\n return 1920 * 3;\n }",
"title": ""
}
] | [
{
"docid": "ee47e999168421ad8343dc86e4ecf502",
"score": "0.6191955",
"text": "private interface Buffer {\n int VERTEX = 0;\n int ELEMENT = 1;\n int GLOBAL_MATRICES = 2;\n int MODEL_MATRIX1 = 3;\n int MODEL_MATRIX2 = 4;\n int MODEL_MATRIX3 = 5;\n int MODEL... |
5fcc539f8e4eaaeb8b9babfc0cbfbe18 | Comparisons of numbers on opposite sides of 0 | [
{
"docid": "8cd04acd156b532d3d5f0a7198dfc593",
"score": "0.6519709",
"text": "@Test\n void opposite() {\n assertFalse(nearlyEqual(1.000000001f, -1.0f));\n assertFalse(nearlyEqual(-1.0f, 1.000000001f));\n assertFalse(nearlyEqual(-1.000000001f, 1.0f));\n assertFalse(nearlyEqual(1.0f, -1.00000... | [
{
"docid": "b31e7a98b4779e668af8285c8d92c767",
"score": "0.6781757",
"text": "private static boolean checkOppositeSign(int a, int b) {\n if ((a ^ b) < 0)\n return true;\n //if the nos are same or both positive/negative then the xor is positive\n return false;\n }",
... |
8ec59b7b799ff3807cf4a380e5e33c48 | repeated .hr.client.appuser.StreamCouponHistory streamCouponHistoryList = 3; | [
{
"docid": "c9d1fd8c2d76a550ad4aba63e1d73f34",
"score": "0.66321164",
"text": "public hr.client.appuser.CouponCenter.StreamCouponHistory.Builder addStreamCouponHistoryListBuilder() {\n return getStreamCouponHistoryListFieldBuilder().addBuilder(\n hr.client.appuser.CouponCenter.StreamCo... | [
{
"docid": "038883dff3919813c87e05a64428643f",
"score": "0.7699786",
"text": "hr.client.appuser.CouponCenter.StreamCouponHistory getStreamCouponHistoryList(int index);",
"title": ""
},
{
"docid": "e8254de906dfa20e1d011e4036df18c6",
"score": "0.76841086",
"text": "java.util.List<hr.cl... |
9b6776c841f8c84ad43135e09a499689 | Implement this interface to receive a callback immediately after fuel injections have completed. | [
{
"docid": "057d36beaa82757d54ca2db95c999395",
"score": "0.5721561",
"text": "public interface OnFueled {\n\n /**\n * Called immediately after injections have completed\n * Should not get called twice, but potentially could get called twice\n * if you accidentally inject and ignite the sa... | [
{
"docid": "2c3fdf917851fba4653e334e8842f052",
"score": "0.654697",
"text": "@Override\n public void callbackComplete() {\n }",
"title": ""
},
{
"docid": "150c9bfe8b3899c6c530307c61eee9aa",
"score": "0.6214232",
"text": "@Override\n public void onComplete() {... |
a75c300d8d25ff5bd2a7a98f10a62099 | Remove page from the scene. | [
{
"docid": "591c5373e2c0a15a62792a8256dd46e2",
"score": "0.6295042",
"text": "public void removeSceneNodeEdges(Page pageNode) {\n\n Collection<NavigationCaseEdge> navCaseNodes = view.getNodeEdges(pageNode);\n for (NavigationCaseEdge navCaseNode : navCaseNodes) {\n try {\n ... | [
{
"docid": "71a6c02d8ad6f477ee88bc6e3b94ad7e",
"score": "0.7479418",
"text": "public void remove() {\n\t\t\tpages.get(p.page()).getLayout().removeView(im);\n\t\t\tdrawn = false;\n\t\t}",
"title": ""
},
{
"docid": "e3ae1c3c4525a467cc928f7c66d13602",
"score": "0.74712896",
"text": "pub... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "75e93cf80d889ce91adffbac517cae41",
"score": "0.0",
"text": "public List<News> findListNews(final int page, final int pagesize,\n\t\t\tfinal String sortname, final String sortorder,final HashMap<String ,Object> map) {\n\t\treturn (List)this.getHibernateTemplate().execute(\n\t\t\t\tnew Hiberna... | [
{
"docid": "ef1b6c3f597a66c59960d73eadee6f25",
"score": "0.6904447",
"text": "private void apparence()\n\t\t{\n\n\t\t}",
"title": ""
},
{
"docid": "4862518dedb9e169c3cc620e5ebe04c5",
"score": "0.6696056",
"text": "@Override\r\n\tpublic void atura() {\n\t\t\r\n\t}",
"title": ""
... |
687f5395f7bc3b2164a962338157ce86 | Method to display the contents of the stack | [
{
"docid": "b8427908f29531f3cb8294c15b21b2e1",
"score": "0.810205",
"text": "public void display(){\n System.out.print(\"Stack: \");\r\n for(int i=0; i<=topOfStack;i++)\r\n {\r\n System.out.print(theData[i]+ \" | \");\r\n }\r\n System.out.println();\r\n }... | [
{
"docid": "9b5530eaa07fb748f95b854d83e783cf",
"score": "0.8364721",
"text": "public void printStack() {\n\t\tmyStack.showList();\r\n\t\tSystem.out.println(\"\");\r\n\t}",
"title": ""
},
{
"docid": "8c2b8a839bc46187d0979bca0df61543",
"score": "0.8074395",
"text": "private void displa... |
021ff2ca1435550fbf8b966a148be0b7 | set up method to add a mountain range for each number of loops | [
{
"docid": "01746076924b36e95413646e73a083a1",
"score": "0.60517734",
"text": "private void setUpForLandscape() {\n int start;\n int end;\n int centre;\n int heightLimit = (int) (height / numberOfLoops)*6;\n\n for (int i = 0; i < numberOfLoops; i++) {\n ... | [
{
"docid": "37f93ee658945458f45c16c7c855601b",
"score": "0.5836816",
"text": "private ArrayList<int[]> fillOutNewMountainRange(ArrayList<int[]> controls, int heightLimit) {\n\n Random random = new Random();\n\n for (int i = controls.size(); i < controls.size() + 1; i++) {\n\n if... |
c9a0357df289c007602aab358a7fdcc4 | Get an existing forward log entry by id Permissions Needed: BRE_RULE_ENGINE_EVENTS_ADMIN | [
{
"docid": "bf6fde4afb41ea42f39c73da7fba04bb",
"score": "0.5370316",
"text": "public ForwardLog getBREForwardLog(String id) throws ApiException {\n Object localVarPostBody = null;\n \n // verify the required parameter 'id' is set\n if (id == null) {\n throw new ApiException(400, \"Missi... | [
{
"docid": "afc35c8fe83c4873d77c68c8757e92d0",
"score": "0.622384",
"text": "public Audittrail getById(long id);",
"title": ""
},
{
"docid": "faba100a8d32adfb89745268ec14b4a7",
"score": "0.58593726",
"text": "public LoggingEvent findById(Long id) {\r\n\t\tlog.info(\"Find by id : {}\"... |
b3943f6b9ea5b98d78d0d734a1376ac2 | Returns true if field creditSituation is set (has been assigned a value) and false otherwise | [
{
"docid": "9fb12105909fb2d683155e331b8ad00f",
"score": "0.8356471",
"text": "public boolean isSetCreditSituation() {\n return this.creditSituation != null;\n }",
"title": ""
}
] | [
{
"docid": "8eb55bdd19d87b194e1a7079524c3ef2",
"score": "0.6908822",
"text": "public boolean isCredit() {\n return BillingEnum.hasBillingBit(getBillingBits(), BillingEnum.BILL_CREDIT);\n }",
"title": ""
},
{
"docid": "85afe878542c92a3218d630277631159",
"score": "0.6819937",
... |
7cf9fb9b96819782ec3eb08591532051 | Creates a filter that matches all documents where the value of a field is an array that contains all the specified values. | [
{
"docid": "a34220b185a8b7cc93cccac504878d83",
"score": "0.49036244",
"text": "@SafeVarargs\n @SuppressWarnings(\"varargs\")\n public static <TItem> Bson all(final String fieldName, final TItem... values) {\n return all(fieldName, asList(values));\n }",
"title": ""
}
] | [
{
"docid": "7c68bb3ba8142d77a731d8c1ef01c62c",
"score": "0.5827921",
"text": "public static <TItem> Bson all(final String fieldName, final Iterable<TItem> values) {\n return new IterableOperatorFilter<>(fieldName, \"$all\", values);\n }",
"title": ""
},
{
"docid": "7e8156c56acb8b55... |
b869146eb43923c55904e78d2764905f | / Funtion to find longest common substring | [
{
"docid": "f04f998a4ab6200ac409dd02f4186fe2",
"score": "0.0",
"text": "public static int findLCS(SuffixNode node, int i1, int i2) \r\n\r\n {\r\n\r\n if (node.begin <= i1 && i1 < node.end) \r\n\r\n return 1;\r\n\r\n if (node.begin <= i2 && i2 < node.end) \r\n\r\n ... | [
{
"docid": "03283ad4faa70da5bad24c64ce656b4a",
"score": "0.76276994",
"text": "public int longestCommonSubstring(String a, String b) {\n if (a == null || a.length() == 0 || b == null || b.length() == 0) {\n return 0;\n }\n\n char[] A = a.toCharArray();\n char[] B =... |
9d511588e7269d6a1c809c2d3d871001 | Ajoute une voiture en queue de la file d'attente. | [
{
"docid": "44e6058fab3cd8e204c3055056662121",
"score": "0.0",
"text": "@Override\n\tvoid entrer(Voiture v) {\n\t\tvoitures.offer(v);\n\t\tv.sengager(this);\n\t}",
"title": ""
}
] | [
{
"docid": "dbca3b39a94ff290fbe5a55a3f2f68c9",
"score": "0.65527016",
"text": "private void addToQueue(File file)\n {\n playList.addNext(file);\n }",
"title": ""
},
{
"docid": "28e8d90968b9bce9763ad3656442e180",
"score": "0.6441704",
"text": "public void put(File file){\... |
4ea4ee489d1db41ba7050b1d6f0b8977 | / / / / | [
{
"docid": "3bab2a50e3b1925aab9a23a31df9e4db",
"score": "0.0",
"text": "public static String getCurrentTimeStamp() {\n/* 100 */ SimpleDateFormat sdfDate = new SimpleDateFormat(\"HH:mm:a\");\n/* 101 */ Date now = new Date();\n/* 102 */ return sdfDate.format(now);\n/* */ }",
"title":... | [
{
"docid": "59f1c45b36b3f96c6a39124fe7b24960",
"score": "0.59283674",
"text": "public String bentopath();",
"title": ""
},
{
"docid": "3efe9b476114de722d8d0cecb1725e5d",
"score": "0.5599143",
"text": "private void Subdivise() {\n\r\n\t}",
"title": ""
},
{
"docid": "e7eca7... |
32300646f8cd6dfda352cdb2dcde025a | Sets the last tick in the model. | [
{
"docid": "4257c40bd3c8b3b5f0afe710e3e59be2",
"score": "0.6810337",
"text": "void setEndTick(int endTick);",
"title": ""
}
] | [
{
"docid": "09f7fccc48f733563b6495206db9587c",
"score": "0.7560757",
"text": "void setLastTickPos(Vec3 pos);",
"title": ""
},
{
"docid": "48a082e723a755c8f19502d965dcb752",
"score": "0.6647233",
"text": "public void setTick(long tick) {\n this.tick = tick;\n }",
"title"... |
ec520651d89645072d9227028e6cc4fa | Set the content rating/certification | [
{
"docid": "556eff15cdfaddf3ef4f0fb1480cf113",
"score": "0.5909791",
"text": "public MovieBuilder setContentRating(String contentRating) {\n this.contentRating = contentRating;\n return this;\n }",
"title": ""
}
] | [
{
"docid": "8c6764100f4dc5bc613bf7713b967be9",
"score": "0.69757974",
"text": "public void setRating(int rating) {\n this.rating = rating;\n }",
"title": ""
},
{
"docid": "4f0a53f254bd437b22527709fb399c49",
"score": "0.69394296",
"text": "public void setRating (int rating){\r\n\t... |
461b6641be5f564d09dbb4c7a048dea5 | Converts this ListEntityTypesResponse into string format. | [
{
"docid": "d3d2fe71dd05149471ac71465a001342",
"score": "0.8176396",
"text": "@Override\r\n public String toString() {\r\n return \"ListEntityTypesResponse [\" + \"type=\" + type + \", attrs=\" + attrs + \", count=\"\r\n + count + \"]\";\r\n }",
"title": ""
}
] | [
{
"docid": "ae07fe02db0d2413df2dfb171e5b2386",
"score": "0.5956687",
"text": "java.util.List<EntityType>\n getEntityTypeList();",
"title": ""
},
{
"docid": "9e851729f7373ad95f930cb7a19aa89e",
"score": "0.5771545",
"text": "@Override\n public String toString() {\n Str... |
8f0afeaccd5c62b3a7fcce7d8119bbb6 | Collection to store memenyos | [
{
"docid": "d0228ee287c3c856d327fb2103453902",
"score": "0.0",
"text": "public CareTaker() {\n\t mementoList = new ArrayList<Memento>();\n }",
"title": ""
}
] | [
{
"docid": "53987f98a7989ccdd1b07c8539e9b3aa",
"score": "0.6650761",
"text": "protected List<DuDeObject> getInMemoryData() {\n\t\treturn this.inMemoryData;\n\t}",
"title": ""
},
{
"docid": "ce6978e6571c35c4919992a755af9b66",
"score": "0.6152827",
"text": "public RandomizedCollection(... |
00c75e96a6c795f6f7b78574ef6680a3 | Get Storage Block by index. | [
{
"docid": "7d6e1df181e2f129edf40f86c193111d",
"score": "0.78490317",
"text": "StorageBlock getStorageBlock(int blockId) throws IOException;",
"title": ""
}
] | [
{
"docid": "963624024b663fd2a41f2f284dc4538b",
"score": "0.75259686",
"text": "public Block getBlock(int index)\n {\n return blocks[index];\n }",
"title": ""
},
{
"docid": "e610e89b71a7cf7ec08ac45b8ca6e97e",
"score": "0.7317253",
"text": "public int getAt(int index) {\n retur... |
ccdb395eac6259979c04e4e67d84076f | Set the queue name. | [
{
"docid": "464a0cd268c9e4d1f2b54b40a616e8b1",
"score": "0.8094026",
"text": "public void setQueueName(String queueName) {\n this.queueName = queueName != null ? new LazyUTF8String(queueName) : null;\n }",
"title": ""
}
] | [
{
"docid": "d140b96c249f1628838a8be037976bd8",
"score": "0.7479585",
"text": "public void setQueueName(String queueName) {\n this.queueName = queueName;\n }",
"title": ""
},
{
"docid": "d140b96c249f1628838a8be037976bd8",
"score": "0.7479585",
"text": "public void setQueueNa... |
ce24b84f960f375d68de51afeaefd952 | Subinterface to encapsulate tuple of content with it's version. | [
{
"docid": "b03149dd5332a5de21e2e985319f0454",
"score": "0.6299656",
"text": "public interface VersionedContent {\n /**\n * Version of the content.\n */\n long version();\n\n /**\n * Actual content\n */\n String content();\n }",
"title": ""
}
] | [
{
"docid": "613ebd61381eaa5cf956a35d8c82abe6",
"score": "0.5819128",
"text": "public static interface Tuple {\n\n\t}",
"title": ""
},
{
"docid": "d5e57262274f973d9c2fbeebb9e84c73",
"score": "0.57854986",
"text": "public interface Header extends Tuple {\n\n /**\n * {@inheritDoc... |
b3ddd8386ac51b8a02842661cb605cc8 | bottom (float,string) property for the view bottom position. This position is relative to the view's parent. Can be either a float value or a dimension string ie 'auto' (default). Platforms: android iphone ipad, Since: 0.8 | [
{
"docid": "118f786c6b3339c1e8628efec65e7185",
"score": "0.7011343",
"text": "public native void setBottom(double bottom) /*-{\n\t\tthis.@com.pmt.wrap.titanium.ui.TableView::handler.bottom = bottom;\n\t}-*/;",
"title": ""
}
] | [
{
"docid": "00657a400daaab659666c4b5ed1020da",
"score": "0.7398621",
"text": "public float getBottom() {\n return this.bottom;\n }",
"title": ""
},
{
"docid": "b447f841ac5d94c593b0c988c6bad24c",
"score": "0.72474265",
"text": "public void setBottomHeight(float bottomHeight);",
... |
2e95dc2d882c25fc93f6497fe1e37db9 | The AdView is ready to be shown | [
{
"docid": "c060257ffa073a9eb9ece3af90b9c88c",
"score": "0.6882398",
"text": "public void onAdViewReady(AdView adView) {\n mAdView.setVisibility(View.VISIBLE);\n\n // Hides the DisplayAdActivity notifying text\n TextView view = (TextView) findViewById(R.id.de... | [
{
"docid": "c3d8a838a5d611c111cbf66857268fc0",
"score": "0.7249976",
"text": "public void onSuccessfulLoad(MobclixAdView view) \n\t{\n\t\tview.setVisibility(View.VISIBLE);\n\t}",
"title": ""
},
{
"docid": "0ee39266a4e1806a90f8afe0afd3d84c",
"score": "0.7229964",
"text": "public void ... |
9b6a72e9855619f0dcf3a20db8ddc691 | Gets the targetDiskParams value for this ConverterStorageParams. | [
{
"docid": "dae846ace7c5ef46c765ed70d5e96e5e",
"score": "0.8123661",
"text": "public com.vmware.converter.ConverterStorageParamsTargetDiskParams[] getTargetDiskParams() {\r\n return targetDiskParams;\r\n }",
"title": ""
}
] | [
{
"docid": "ffbcf2ceca3885cb9384d98ba655714e",
"score": "0.65397114",
"text": "public void setTargetDiskParams(com.vmware.converter.ConverterStorageParamsTargetDiskParams[] targetDiskParams) {\r\n this.targetDiskParams = targetDiskParams;\r\n }",
"title": ""
},
{
"docid": "62c6b20f... |
30f2262a581d399ca0e864a91948606a | If 'true', then the output is pretty printed. | [
{
"docid": "28c40ff2c8cc1db0ec6a24aa5e0f9e2b",
"score": "0.0",
"text": "public DeleteCollectionNamespacedOperatorVersion pretty(String pretty) {\n put(\"pretty\", pretty);\n return this;\n }",
"title": ""
}
] | [
{
"docid": "006a2da1060daa06f59611f90ded267c",
"score": "0.73858917",
"text": "public void setPrettyPrint(boolean val) {\n mPretty = val;\n }",
"title": ""
},
{
"docid": "89dec17c4ae84fad53c24a49d4338e60",
"score": "0.7204647",
"text": "public boolean prettyPrint() {\n ... |
65a2608c883cd34816a6290a816a0c43 | private float afwijking; // dit getal reprenteerd de hoek of draai naar/ of van de colorborder, waarmee het stuursysteem aangestuurd kan worden | [
{
"docid": "5e66c4aa05af98ee4565cf988405ccd4",
"score": "0.0",
"text": "public LijnVolger(LijnvolgerOpdracht1 lijnvolgerOpdracht1) {\n\t\tthis.opdracht1 = lijnvolgerOpdracht1;\n\t}",
"title": ""
}
] | [
{
"docid": "0a3949f2f239d519d9bc5b9bb287f1c9",
"score": "0.76030767",
"text": "public int bepaalAfwijking() {\n\t\tint afwijking;\n\t\tcolorBorder = (colorValueWhite - colorValueBlack) / 2;\n\t\tcolorValue = RedSensor.getRed();\n\t\t\n\t\tafwijking = (int) (colorValue / ((colorValueWhite - colorValueBla... |
9a57101ce8cbe1add7067853c906916e | Use this constructor for MongoDB classes as you should not define the typeClass | [
{
"docid": "241ce1730d22ebb44a6ff0518cfa9d6e",
"score": "0.0",
"text": "public FieldDatabaseMap(String fieldName, String classField, ParameterDefinitionInt<?> valueType)\n\t{\n\t\tthis.fieldName = fieldName;\n\t\tthis.classField = classField;\n\t\tthis.valueType = valueType;\n\t}",
"title": ""
}
] | [
{
"docid": "01180bd04f2e39102b50c62900ad5f21",
"score": "0.72875834",
"text": "private MongoFactory() {\n super();\n }",
"title": ""
},
{
"docid": "7cb99640e1ca904e7a2ba940f570ab41",
"score": "0.7139366",
"text": "public MongoDbPersistence(String collectionName, Class<T> do... |
56733c4210f6e21e76cfb2cc1494f656 | Find the _Fields constant that matches fieldId, throwing an exception if it is not found. | [
{
"docid": "852f42536cc459ac8196c93129302d47",
"score": "0.0",
"text": "public static _Fields findByThriftIdOrThrow(int fieldId) {\r\n _Fields fields = findByThriftId(fieldId);\r\n if (fields == null) throw new IllegalArgumentException(\"Field \" + fieldId + \" doesn't exist!\");\r\n ... | [
{
"docid": "0f0d2aece5032ba23ae36e49e573d8ed",
"score": "0.7671767",
"text": "@org.apache.thrift.annotation.Nullable\n public static _Fields findByThriftId(int fieldId) {\n switch(fieldId) {\n case 1: // NEEDS_MORE_INPUT\n return NEEDS_MORE_INPUT;\n case 2: // EX... |
a00dcc9dfde3aa44715c980f4722345f | Auto generated setter method | [
{
"docid": "b2b891af998d00e63fce71a00cf464fa",
"score": "0.0",
"text": "public void setManifestBatches(ArrayOfManifestBatch param){\r\n \r\n if (param != null){\r\n //update the setting tracker\r\n ... | [
{
"docid": "9be87f27282d43ba8419c15c20a46b50",
"score": "0.7929405",
"text": "public void set() {}",
"title": ""
},
{
"docid": "4607d6b323a85e6c8e55746f8b76a357",
"score": "0.7619289",
"text": "Setter<ENTITY, V> setter();",
"title": ""
},
{
"docid": "49c2c569aafed4d0a7ed2... |
8a8a12df2d167f3369a02364e0bfa136 | Add a many where join. | [
{
"docid": "966da1f1b934e3fdf97ed3e40b574931",
"score": "0.0",
"text": "public void add(ElPropertyDeploy elProp) {\r\n \r\n String join = elProp.getElPrefix();\r\n BeanProperty p = elProp.getBeanProperty();\r\n if (p instanceof BeanPropertyAssocMany<?>){\r\n join =... | [
{
"docid": "d87c589cd89241178e03224f2dc38ecd",
"score": "0.65551174",
"text": "public void containsMany(BeanDescriptor<?> desc, ManyWhereJoins manyWhereJoins);",
"title": ""
},
{
"docid": "257466b8b9538b61be886d2da18882d4",
"score": "0.647884",
"text": "public void containsMany(BeanD... |
1738268c342162b447570c80ec5c026e | User: ddcrichak Date: 9/22/14 | [
{
"docid": "862b2bbbf5577b02ab9473b78df0d7fd",
"score": "0.0",
"text": "@RepositoryRestResource\npublic interface VehicleRepository extends PagingAndSortingRepository<Vehicle, String>{\n @RestResource(path = \"type\", rel = \"type\")\n public Vehicle findByType(String type);\n}",
"title": ""
... | [
{
"docid": "5ab46f6ff6bf8474c1da251446e037e8",
"score": "0.6182123",
"text": "String getDateCreation();",
"title": ""
},
{
"docid": "6b6c0f62f08796dba0800136ec8cdc0e",
"score": "0.6152962",
"text": "public String getDate()\n/* */ {\n/* 51 */ return this.date;\n/* */ }",... |
d0984a2cc311c5673b4947c2d14f001c | Retrieve (or create) an interned HystrixCommandGroup instance for a given name. | [
{
"docid": "45c890f8d620450f4d2673e8315bb802",
"score": "0.70751786",
"text": "public static HystrixCommandGroupKey asKey(String name) {\n return intern.interned(name);\n }",
"title": ""
}
] | [
{
"docid": "2f184ee304745d50f3aedf861fe0a2fa",
"score": "0.66025895",
"text": "HostGroup getHostGroup(String name);",
"title": ""
},
{
"docid": "cb071d8348b3bf89be6c09f9700e57a2",
"score": "0.62265605",
"text": "public AbstractGroupNode getGroupByName(String name);",
"title": ""
... |
1e70bea124654fe17a4c701d6179d329 | This method was generated by the VisualAge for Java Access Bean SmartGuide. Warning: Modifications will be lost when this part is regenerated. | [
{
"docid": "fc573725168e0cce696915d6fc51dbd1",
"score": "0.0",
"text": "public com.hps.july.persistence.ResourceAccessBean getResource() throws java.rmi.RemoteException, javax.ejb.FinderException, javax.naming.NamingException {\n instantiateEJB();\n com.hps.july.persistence.Resource localE... | [
{
"docid": "fd7df110e087032be8c98522c4493f41",
"score": "0.6169917",
"text": "@Override\n public void otvori() {\n }",
"title": ""
},
{
"docid": "fd7df110e087032be8c98522c4493f41",
"score": "0.6169917",
"text": "@Override\n public void otvori() {\n ... |
57c9485ed1e34fd3525bd1bc131ded76 | / Changes the stamp of an object inside a snippet to be the stamp of the node replaced by the snippet. / | [
{
"docid": "0bbf31e3a6b734fc87413a45eb33923f",
"score": "0.0",
"text": "@NodeIntrinsic(ArrayPlaceholder.class)\n // @defn PiArrayNode.piArrayCastToSnippetReplaceeStamp\n public static final native Object piArrayCastToSnippetReplaceeStamp(Object object, int length);",
"title": ""
}
] | [
{
"docid": "e08ab65eeac7851a4124a2ad26dddd90",
"score": "0.5910731",
"text": "@NodeIntrinsic(Placeholder.class)\n // @defn PiNode.piCastToSnippetReplaceeStamp\n public static final native Object piCastToSnippetReplaceeStamp(Object object);",
"title": ""
},
{
"docid": "86dbf56d9593a67ec... |
ec41a003a0caa0d19d464276c63b125b | (asynchronously) Retrieve the role information. | [
{
"docid": "68c7492e813421b45ec53cc4c8956cb7",
"score": "0.0",
"text": "public com.squareup.okhttp.Call getAuthRoleAsync(String authRoleId, Boolean resolveNames, final ApiCallback<AuthRoles> callback) throws ApiException {\n\n ProgressResponseBody.ProgressListener progressListener = null;\n ... | [
{
"docid": "6bf79411ac7fd1e744f7ced5b773fdfa",
"score": "0.6865653",
"text": "@Override\r\n\tpublic List<Role> fetchrole(String role) throws Exception {\n\t\treturn userDao.findallrole(role);\r\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "46873fcbf466f4c5233de7e70d66aa0f",
"score": "0.68446... |
198c9ad5a04ae2503a0a92df4538a9f5 | Private helper method to make image buttons for the items with the provided texture (the item icon image). | [
{
"docid": "2d80fe071297a7fbdbf88300b9d7c411",
"score": "0.75878537",
"text": "private ImageButton generateItemButton(Texture image) {\n\t\tTextureRegion imgRegion = new TextureRegion(image);\n\t\tTextureRegionDrawable imgDraw = new TextureRegionDrawable(imgRegion);\n\t\treturn new ImageButton(imgDraw);... | [
{
"docid": "6ddb369b218ccdcd046ff1e4ba27a449",
"score": "0.6898992",
"text": "B itemIcon(ITEM item, Resource icon);",
"title": ""
},
{
"docid": "c06dcfa43a03293863919e77aadce89e",
"score": "0.6318193",
"text": "public static void loadItemTextures() {\n\t\tspriteTItem = ModLoader.addO... |
cc977222136a09901433e9497c277314 | counter for the Player | [
{
"docid": "18b880114dd14a799d123fec36f7ebb9",
"score": "0.0",
"text": "public PeachThief(World w, String name, Location location, List<Peach> peaches) {\n\t\tsuper(w, name+\"-Thief\"+thief_counter, location, peaches, 70, RGB.BLUE);\n\t\tthis.job = \"PeachThief\";\n\t\tthief_counter++;\n\t}",
"title... | [
{
"docid": "7f072491ac98961fcdbb2cec134312b7",
"score": "0.82250756",
"text": "public void incrementPlayers(){\n\t\tplayerCount++;\n\t}",
"title": ""
},
{
"docid": "420765f43a4594b0567ee155df3bb64b",
"score": "0.7811174",
"text": "int getPlayerCount();",
"title": ""
},
{
... |
c311066db20ba6bffc54bed6e3abc270 | Test case number: 60 /Coverage entropy=0.0 | [
{
"docid": "3b75b2c7fd7864e49a51032848aedd0c",
"score": "0.0",
"text": "@Test(timeout = 4000)\n public void test060() throws Throwable {\n int int0 = DBUtil.getOpenResultSetCount();\n assertEquals(0, int0);\n }",
"title": ""
}
] | [
{
"docid": "474568e3244a9a9f12834ec6bd55c9e9",
"score": "0.7265128",
"text": "@Test\n public void test35() throws Throwable {\n TextDirectoryLoader textDirectoryLoader0 = new TextDirectoryLoader();\n Instances instances0 = textDirectoryLoader0.getStructure();\n CostMatrix costMatrix0 =... |
327d2c987ecdc94cd3530fd98da536c4 | / renamed from: com.google.android.gms.internal.d | [
{
"docid": "97e384d467f37f4be643d3ca329dfe14",
"score": "0.587015",
"text": "public interface C1817d {\n\n /* renamed from: com.google.android.gms.internal.d.a */\n public static final class C1816a extends kp {\n private static volatile C1816a[] fM;\n public String fN;\n publi... | [
{
"docid": "b20997b286cd76adca742ea93b253853",
"score": "0.6677471",
"text": "private static void zzbu(android.content.Context r7) {\n /*\n r6 = 1;\n r0 = com.google.android.gms.p043b.C1111y.m5247b(r7);\t Catch:{ NameNotFoundException -> 0x002e }\n r1 = \"com.google.android.g... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "eb24d9d4d410a9ee8f46cec80c59e13e",
"score": "0.0",
"text": "@Override\n protected void onNewIntent(Intent intent) {\n super.onNewIntent(intent);\n Logger.d(\"MainActivity--onNewIntent\");\n setIntent(intent);\n }",
"title": ""
}
] | [
{
"docid": "d7194e467f51e022c107531d8614b6a3",
"score": "0.6905833",
"text": "@Override\r\n\tpublic void anular() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "941cb2826e3c700358fcaba402e6bb01",
"score": "0.66775143",
"text": "@Override\r\n\tpublic void hissetmek() {\n\r\n\t}",
"ti... |
a7ec30009a9492881337f3cb5a97ff4c | Clears the value of the 'NOTES' field. | [
{
"docid": "67d4c9f9b19b227e7f483872baa03da3",
"score": "0.7076856",
"text": "public org.LNDCDC_NCS_TCS.REPORTING_GROUPS.apache.nifi.LNDCDC_NCS_TCS_REPORTING_GROUPS.Builder clearNOTES() {\n NOTES = null;\n fieldSetFlags()[3] = false;\n return this;\n }",
"title": ""
}
] | [
{
"docid": "54bbe1632c1adb33e953fd51ec4d2b6c",
"score": "0.7294499",
"text": "public void setNOTES(java.lang.CharSequence value) {\n this.NOTES = value;\n }",
"title": ""
},
{
"docid": "11664020e4dfbe2aacfaa029f228b9fd",
"score": "0.65095127",
"text": "public void cleanNoteStorag... |
627015dc240b723b9bf6a07ecc929d9c | $FF: renamed from: i () boolean | [
{
"docid": "2ab31f8d6bb0bf9befc149815e876cd5",
"score": "0.0",
"text": "public boolean method_2615() {\r\n return this.field_2085;\r\n }",
"title": ""
}
] | [
{
"docid": "b955f33fcb7fe019bac2e81bfacb6be9",
"score": "0.7464909",
"text": "public abstract boolean mo54491a(int i);",
"title": ""
},
{
"docid": "6e7d4199e7a478adb27422c3a6ddc4d4",
"score": "0.7346587",
"text": "boolean hasI();",
"title": ""
},
{
"docid": "67d9b3bb5ba15... |
0a67210c35f17e3e835d272114b41a08 | Method to get employees by names | [
{
"docid": "ea45342c2c5693c525ee1b2b3c478a80",
"score": "0.74033004",
"text": "public List<Employee> getByName(List<Employee> employees, String name) {\r\n\t\tList<Employee> res= new ArrayList<Employee>();\r\n\t\ttry {\r\n\t\t\tfor(Employee emp : employees) {\r\n\t\t\t\tif(emp.getName().equalsIgnoreCase... | [
{
"docid": "53ebe5832170883babff5b06b37d6b00",
"score": "0.85725284",
"text": "List<Employee> getEmployeesByName(String name);",
"title": ""
},
{
"docid": "423480be22df63163f2499351beb0168",
"score": "0.79222965",
"text": "public List<Employee> findByName(String nm);",
"title": "... |
be1a246c8888a98e195603b9fdb4baa8 | constructs an arraylist that has the elements of the given arraylist from the start to the end | [
{
"docid": "a28536d5f8d5347bc976b3ddb209df67",
"score": "0.7001447",
"text": "<T> ArrayList<T> getElementsBetween(ArrayList<T> src, int start, int end) {\n ArrayList<T> cpArr = new ArrayList<>();\n for (int index = start; index < end; index += 1) {\n cpArr.add(src.get(index));\n }\n ret... | [
{
"docid": "32416e8d0fa7cdc795efb97d747cfc4b",
"score": "0.69170636",
"text": "private ArrayList<String> slice(ArrayList<String> list, int from , int to, int step){\n\tArrayList<String> ans = new ArrayList<String>();\n\tfor (int i = from; i < to; i += step)\n\t ans.add(list.get(i));\n\treturn ans;\n ... |
25b323c0f73a7dd31027bf7bcec7693f | Function to compute greatest common divisor using Euclidean algorithm | [
{
"docid": "d446bb714f195308c4af602ba80e4290",
"score": "0.6813238",
"text": "public static int GCD(int a, int b)\n {\n int r = 0;\n while (b > 0)\n {\n r = a % b;\n a = b;\n b = r;\n }\n return a;\n }",
"title": ""
}
] | [
{
"docid": "a0d8969f60703760ae58c0cec486a1e2",
"score": "0.7270476",
"text": "int euclideanGCD(int a, int b){\n\t\tif (a==b) return a;\n\t\tint larger = a>b ? a:b;\n\n\t\t\n\t}",
"title": ""
},
{
"docid": "a5cc823db1e8de6e139c4cd146d11010",
"score": "0.7250713",
"text": "static int g... |
69265dcb7fd93b545c5d2719fb96a618 | Using OnPause to reset icon image once it is pressed | [
{
"docid": "3947160a646dba497a606d57b619aac8",
"score": "0.0",
"text": "@Override\n\tpublic void onResume() {\n\t\t// TODO Auto-generated method stub\n\t\tsuper.onResume();\n\t\t\n\t\tfinal ImageButton tagButton = (ImageButton) findViewById(R.id.TagButton);\n\t final ImageButton searchButton = (Image... | [
{
"docid": "3167dee4a60d070660390274449c814a",
"score": "0.7037958",
"text": "private void changeIcon(){\n switch (_buttonIcon.getValue()){\n case R.drawable.ic_round_pause_circle_filled_24:\n _buttonIcon.setValue(R.drawable.ic_round_play_arrow_24);\n brea... |
4aadd453b61658656d4831e5cb662363 | Created by Administrator on 2016/3/8. | [
{
"docid": "33cb5dcbf93ef4a76c83f4decc10a5bd",
"score": "0.0",
"text": "public interface AdminDao extends JpaRepository<Admin,Long>{\n\n @Query(\"select a from Admin a where a.username = ?1\")\n public Admin findByUsername(String username);\n}",
"title": ""
}
] | [
{
"docid": "ccbad2fe39581989696edf7ff479266d",
"score": "0.6675931",
"text": "private static void somrtinhg() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "bdc1683df7d1d6b2d988cd3acab4903e",
"score": "0.61096054",
"text": "public void mo5201a() {\n }",
"t... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "1c10501dfe210d92f802481d85df27a4",
"score": "0.0",
"text": "@Override\r\n\t\tpublic void onResume() {\n\t\t\tupdateUI(getSwitchStatus());\r\n\t\t\tsuper.onResume();\r\n\t\t}",
"title": ""
}
] | [
{
"docid": "d7194e467f51e022c107531d8614b6a3",
"score": "0.6905833",
"text": "@Override\r\n\tpublic void anular() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "cdf542363f5b089e84183e3d9020935f",
"score": "0.6697644",
"text": "@Override\n\t protected void ramana() {\n\t\t\n\t}",
"ti... |
5340864a82bfa5fae2dcd52e6bfd0384 | enables user to collect reward | [
{
"docid": "1550e15b1dadeec72df4481aee1d0282",
"score": "0.5906376",
"text": "public void mouseClicked(MouseEvent e) {\n\t\t\tJOptionPane.showMessageDialog(null,//inform user that reward is collected\n\t\t\t\t \"Total Exp Collected: \"+accumExp+\".\",\n\t\t\t\t \"Reward Collected\",\n\t\t\t\t J... | [
{
"docid": "9559f357c1707da4eeb162a3757c6e0c",
"score": "0.7257135",
"text": "public void award()\n {\n totalReward += Constants.MINER_REWARD;\n System.out.println(name +\" has found a hash and total reward is= \" + totalReward);\n }",
"title": ""
},
{
"docid": "8a661dcfa... |
1a5c7dc962f664b8c16acd39fa3cdece | Method For Cancel Policy button | [
{
"docid": "f4a855fbd90934d96bcdae97f44a0ac3",
"score": "0.6921041",
"text": "public static WebElement CancelPolicybutton_flat(){\n\t\t\t\n\t\t try\n\t \t\t{\n\t\t\t element= fwait.until(ExpectedConditions.visibilityOfElementLocated(By.xpath(\"//*[@class='btn mx-button mx-name-actionButton2 btn-danger']... | [
{
"docid": "ba77b35bb6d089114543b2b023498bce",
"score": "0.7865145",
"text": "public static WebElement CancelPolicyButton(){\n \t\t\t\n \t\t try\n \t \t\t{\n \t\t\t element= fwait.until(ExpectedConditions.visibilityOfElementLocated(By.xpath(\"//*[@class='mx-dataview mx-name-dataView1 form-horizontal']/d... |
a00dcc9dfde3aa44715c980f4722345f | Auto generated setter method | [
{
"docid": "c90353343ff8b55f631a7fd17c855e08",
"score": "0.0",
"text": "public void setDATE_type0(java.lang.String param){\n \n if (org.apache.axis2.databinding.utils.ConverterUtil.convertToString(param).matches(\"\\\\d{8}\")) {\n ... | [
{
"docid": "0b7d5da34ce86a3669b4abee4a90e2df",
"score": "0.79580045",
"text": "Method getSetter();",
"title": ""
},
{
"docid": "c32d5131bbf330c6e417879c6af42e9b",
"score": "0.75098526",
"text": "@Override\r\n\tpublic void set() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "... |
d073041ac6e4174c3361fb65840ef6a4 | Attributes Constructors Public Package protected Protected Private | [
{
"docid": "1cf7f54b9bac85d542f70acc8d969f54",
"score": "0.0",
"text": "private static File parseCommandLine(String[] args) throws Exception {\n\n if (args.length == 0) {\n\n throw new Exception(\"yaml file name not specified\");\n }\n\n File f = new File(args[0]);\n\n ... | [
{
"docid": "335554397c8420d2ab97c306b390c29f",
"score": "0.77984005",
"text": "public Attributes() {\n }",
"title": ""
},
{
"docid": "db7c8c296916d3d1a0359170cd19fb6f",
"score": "0.77605474",
"text": "public Attributes()\n {\n }",
"title": ""
},
{
"docid": "ecbc5... |
165707265727889fa4917db3958362cb | runs when the user submits a query into the search view | [
{
"docid": "a444096c28a53b203c577294fd756ba2",
"score": "0.6471299",
"text": "@Override\n public boolean onQueryTextSubmit(String query) {\n addToSharedPreferences(query);\n getRecipes(query);\n return false;\n }",
"title": ""
}
] | [
{
"docid": "cf0493094ed69347f9f8c704718c9edd",
"score": "0.7366005",
"text": "@Override\n public boolean onQueryTextSubmit(String query) {\n searchData(query);\n return false;\n }",
"title": ""
},
{
"docid": "f9241ca53ab822ade13d483afa60e3d... |
3c12c8b8a43171b6657d6a285aee669d | TODO Autogenerated method stub SendActivity.sendLableTv.setText(arr1[arg2]); | [
{
"docid": "97e1733217d52b8826865776584bc734",
"score": "0.0",
"text": "@Override\r\n\t\t\tpublic void onItemClick(AdapterView<?> arg0, View arg1, int arg2,\r\n\t\t\t\t\tlong arg3) {\n\t\t\t\tfinish();\r\n\t\t\t}",
"title": ""
}
] | [
{
"docid": "1bbb3903e27aba4e7e55ffd907bf8baa",
"score": "0.59666353",
"text": "@Override\n public void onClick(DialogInterface arg0, int arg1) {\n mHZBQText.setText(items[arg1]);\n mBindPatientParment.setPatientLabelId(mList.get(arg1).getAttrCode() + \"\");\n ... |
6d04869ab8ecbba7ca67b12a419949ef | String conversion Returns a string representation of this collection. The string representation consists of a list of the collection's elements in the order they are returned by its iterator, enclosed in square brackets ("[]"). Adjacent elements are separated by the characters ", " (comma and space). Elements are conve... | [
{
"docid": "f18bcbad3092feba6264be38e3b5dbca",
"score": "0.77940047",
"text": "public String toString() {\r\n\tStringBuffer buf = new StringBuffer();\r\n\tbuf.append(\"[\");\r\n\r\n Iterator<E> i = iterator();\r\n boolean hasNext = i.hasNext();\r\n while (hasNext) {\r\n E... | [
{
"docid": "88a926639b6362f1d95673e4cdc870a8",
"score": "0.76908314",
"text": "public String toString()\n {\n StringBuffer buf = new StringBuffer();\n\n buf.append(\"[\");\n\n Iterator<E> i = iterator();\n boolean hasNext = i.hasNext();\n\n while (hasNext)\n ... |
c059620238709a8a497355c36a02c125 | Find child conductor by name. | [
{
"docid": "e92da97092c1132c5349ee12ef30060c",
"score": "0.86739814",
"text": "@Override\n public Conductor findByName(String name) {\n return children.get(name);\n }",
"title": ""
}
] | [
{
"docid": "01e5bdcd2c2402e50205b75db35146bd",
"score": "0.640088",
"text": "public BaseComponent find(String name) {\n return _find(name, getNameRoot());\n }",
"title": ""
},
{
"docid": "34eb25818b244b195723d8fd9b324fc8",
"score": "0.62985766",
"text": "@Nullable\n... |
7b54c82aa5df57c4dc89bb3901678f96 | This procedure register "observer" for the "events" (observables) in the API. It also injects the sender to use. | [
{
"docid": "2865bc53a349c69e332a3938e935358e",
"score": "0.56681174",
"text": "protected void registerHooks() {\r\n\t\tIotSender sender = new AzureIotSender();\r\n\t\tHooks.subscribe(\"add\", new AddIotCallback(sender));\r\n\t\tHooks.subscribe(\"update\", new UpdateIotCallback(sender));\r\n\t\tHooks.sub... | [
{
"docid": "c446bc88eba621a977ddc1dc485000dd",
"score": "0.7584123",
"text": "void registerObserver(EventObserver eventObserver);",
"title": ""
},
{
"docid": "dd3253f4a005f200a5c18760e8653254",
"score": "0.7135566",
"text": "void register(Observer obj);",
"title": ""
},
{
... |
bd45a5c2910094469541fa77a78d260c | following function is called to set the field values when a record is selected from the search window | [
{
"docid": "75af1d40cac6044c5a0b1a2536d51752",
"score": "0.0",
"text": "public String details() {\r\n\t\tgetNavigationPanel(3);\r\n\t\thelpDeskDept.setHidDeptCode(helpDeskDept.getDeptCode());\r\n\t\tHelpDeskDeptModel model = new HelpDeskDeptModel();\r\n\t\tmodel.initiate(context, session);\r\n\t\tmodel.... | [
{
"docid": "81ce4c0611d5eb452cca71b75e5e1a55",
"score": "0.6422933",
"text": "public void setSearch(){\n\t\tsearch();\n\t\t\t\t\t\n\t\tint startSelection=mEditor.getSelectionStart();\n\t\tint endSelection=mEditor.getSelectionEnd();\n\t\tString selectedText = mEditor.getText().toString().substring(startS... |
2afe39bf37b7961a61ae7723c0a12db7 | Release any resources (such as files or locks on other resources) associated with the response data. | [
{
"docid": "d9dbfcd19b7cf2fbd76a27bf63718d5f",
"score": "0.5694015",
"text": "public void release() throws ServerException;",
"title": ""
}
] | [
{
"docid": "974fd3e960223cf6668c3899abd41c5e",
"score": "0.70318484",
"text": "@Override\n\t\t\tpublic void releaseConnection() throws IOException\n\t\t\t{\n\t\t\t\tThrowable primaryEx = null;\n\t\t\t\ttry\n\t\t\t\t{\n\t\t\t\t\tif (stream != null)\n\t\t\t\t\t{\n\t\t\t\t\t\tstream.close();\n\t\t\t\t\t}\n... |
302383fd0241166c8ad4ddcc6d7cf048 | Generates the discrete values of a new child solution | [
{
"docid": "1733a8d1749978970c242a5064000af2",
"score": "0.67881346",
"text": "private ArrayList<Integer> childDiscVals(Solution parent1, Solution parent2)\r\n\t{\r\n\t\t// Generate discrete values\r\n\t\tArrayList<Integer> discValues = null;\r\n\t\tint discCount = discVars.size();\r\n\t\tif(discCount >... | [
{
"docid": "eea910f1c70191d2fa59d96599898fbd",
"score": "0.64562505",
"text": "private ArrayList<Double> childContVals(Solution parent1, Solution parent2)\r\n\t{\r\n\t\t// Generate discrete values\r\n\t\tArrayList<Double> contValues = null;\r\n\t\tint contCount = contVars.size();\r\n\t\tif(contCount > 0... |
b0a5827ccec8c50e386218e277618a3a | DELETE STUDENT PERMANENTLY FROM DATABASE. ISSUE AND STUDENT TABLES ARE AFFECTED | [
{
"docid": "6292b9ce1320a2a7d1cb3351ef59fc5d",
"score": "0.0",
"text": "private void deleteStudent()\n {\n int sure = JOptionPane.showConfirmDialog(null,\"Are you sure you want to remove this Student permanently ?\",\"Confirm Delete\",JOptionPane.YES_NO_OPTION);\n if(sure==JOptionPane.Y... | [
{
"docid": "9f2e74fa0074037954877266187a9762",
"score": "0.6621111",
"text": "public void clearDB(){\n try {\n st.execute(\"DROP TABLE SPATIA.DOCUMENT\");\n st.execute(\"DROP TABLE SPATIA.INVERTEDINDEX\");\n st.execute(\"DROP TABLE SPATIA.TERM\");\n st.... |
478ee88f4be0980d6ea565e0873d7183 | Build MongoDB uri and register codecs | [
{
"docid": "312517907a2f1299d826cbda80b54375",
"score": "0.46314028",
"text": "private void setupPersistenceManager() {\n final MongoClientURI uri = new MongoClientURI(\n getConfig().getString(ConfigKey.MONGODB_URI)\n );\n\n final MongoDB db = new MongoDB(uri, getClas... | [
{
"docid": "983ab057d807343b9a29072fe955d00d",
"score": "0.64154774",
"text": "public MongoClientURI(String uri, MongoClientOptions.Builder builder) {\n try {\n this.uri = uri;\n if (!uri.startsWith(PREFIX))\n throw new IllegalArgumentException(\"uri needs to ... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "c28d355fee9cea9bb30b0df7a749f162",
"score": "0.0",
"text": "@Override\n\tpublic User login(String account, String password) {\n\t\treturn null;\n\t}",
"title": ""
}
] | [
{
"docid": "d7194e467f51e022c107531d8614b6a3",
"score": "0.6905833",
"text": "@Override\r\n\tpublic void anular() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "941cb2826e3c700358fcaba402e6bb01",
"score": "0.66775143",
"text": "@Override\r\n\tpublic void hissetmek() {\n\r\n\t}",
"ti... |
7eb4da34f3ececef1f6fdc8c5f3db51a | Sets the order by clause for the request | [
{
"docid": "d1a604db20a7f0d986b894a97c336047",
"score": "0.0",
"text": "@Nonnull\n public SessionCollectionRequest orderBy(@Nonnull final String value) {\n addOrderByOption(value);\n return this;\n }",
"title": ""
}
] | [
{
"docid": "2ee32de345524958726aabf9a64f8533",
"score": "0.7866683",
"text": "public void orderBy(String orderBy){\r\n this.orderByClause = orderBy; \r\n }",
"title": ""
},
{
"docid": "4e86dab859f430e298b8a7210432407d",
"score": "0.69620085",
"text": "public String getOrde... |
518bf5364cda3c6202a1a392996f93d1 | Inflate the menu; this adds items to the action bar if it is present. | [
{
"docid": "5f76525d1fe66dc42111ecd004b29577",
"score": "0.0",
"text": "@Override\n public boolean onCreateOptionsMenu(Menu menu) {\n getMenuInflater().inflate(R.menu.toolbar_menu_share_diag, menu);\n\n\n return true;\n }",
"title": ""
}
] | [
{
"docid": "b470b12158e9a37414c1897a8fc7b04e",
"score": "0.7135346",
"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": ""
... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "b14a83634be08d1ffd96c7773186afb8",
"score": "0.0",
"text": "@Override\r\n\t\tpublic int getItemPosition(Object object) {\n\t\t\treturn super.getItemPosition(object);\r\n\t\t}",
"title": ""
}
] | [
{
"docid": "74a4209c94e08d9f5eb0b60e580f5e04",
"score": "0.68867725",
"text": "@Override\r\n\tpublic void comit() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "b645eacb329adc01490ab5013a6c4f7f",
"score": "0.67295986",
"text": "@Override\n\t\t\tpublic void perfom() {\n\n\t\t\t}",
"t... |
0cd5680a59cb3ccb427eab577234840a | / for All Add supervisor | [
{
"docid": "dd964a5d141621a6a3fb23219e9f2126",
"score": "0.5639845",
"text": "@RequestMapping(value=\"restAddsupervisors\" , method={RequestMethod.POST})\n\tpublic ResponseEntity<JsonResponse<Object>> restAddsupervisor(@RequestBody HrmsSupervisorMasterModel supervisor) \n\t{\n\t\tlogger.info(\"Method : ... | [
{
"docid": "91c6c7225d9d0b715c08049a25f65c97",
"score": "0.6489148",
"text": "public Supervisor addSupervisor() throws Exception {\n return addSupervisor(null, null, null);\n }",
"title": ""
},
{
"docid": "ee2822733ce246561bf232e89639d123",
"score": "0.6354632",
"text": "pu... |
7dc9c425c893c1d5e22b4b3a7a17bb81 | aggregate_prevote defines oracle aggregate prevote submitted by a validator in the current vote period .terra.oracle.v1beta1.AggregateExchangeRatePrevote aggregate_prevote = 1 [(.gogoproto.nullable) = false]; | [
{
"docid": "675ccd9afa959c889a3904cffa0a89a7",
"score": "0.8015518",
"text": "terra.oracle.v1beta1.Oracle.AggregateExchangeRatePrevote getAggregatePrevote();",
"title": ""
}
] | [
{
"docid": "5eafff47df634c8e48c4002aa1c592b7",
"score": "0.83955187",
"text": "public terra.oracle.v1beta1.Oracle.AggregateExchangeRatePrevote getAggregatePrevote() {\n if (aggregatePrevoteBuilder_ == null) {\n return aggregatePrevote_ == null ? terra.oracle.v1beta1.Oracle.AggregateExcha... |
3c32039ce5c5381b11d1bc8bf939118e | Calculates the amount of Defense this Legend has if it were attacked. Note: this is not just the Defense Ability a legend may have some GearItem which increases their defense amount. For a Monster, the defense amount is just the defense ability | [
{
"docid": "6c93df31e4d47dbff6d60750be954bce",
"score": "0.76404744",
"text": "@Override\n public double getDefenseAmount() {\n return this.getDefense().getAbilityValue();\n }",
"title": ""
}
] | [
{
"docid": "940654a482fe08e1b9ef5ddd5c74ca9e",
"score": "0.73899066",
"text": "public int getDefense() {\n return defense_;\n }",
"title": ""
},
{
"docid": "940654a482fe08e1b9ef5ddd5c74ca9e",
"score": "0.73899066",
"text": "public int getDefense() {\n return defens... |
5043e10fd31842d7b03273364454bd82 | Remove a game from the file | [
{
"docid": "a31708a6a95912bb08cd2cca65fd0037",
"score": "0.0",
"text": "boolean remove(String id);",
"title": ""
}
] | [
{
"docid": "75fd2308fdc68eb8082afe8f8e5b5d26",
"score": "0.71057963",
"text": "public static void removePlayer(String name){\n\n File txtFile = new File(\"stats\", name +\".txt\");\n if(txtFile.delete()){\n System.out.println(\"Deleted the file: \" + txtFile.getName());\n ... |
e4b06aa2f76cbd241615ccc0b91d90c9 | Simulate External System for teste | [
{
"docid": "631b664401dce27698584ee9843d6128",
"score": "0.0",
"text": "@Retryable(value = Exception.class, maxAttemptsExpression = \"${retry.maxAttempts}\", backoff = @Backoff(delayExpression = \"${retry.maxDelay}\"))\n\tprivate Future<Boolean> validateDocument(String document) {\n\t\tCompletableFuture... | [
{
"docid": "74a24e1108bd42f6580341c2c3888f18",
"score": "0.69163555",
"text": "private void simulate() {\n\t}",
"title": ""
},
{
"docid": "c411d14bd65afa18ac1b21ac48678817",
"score": "0.64093673",
"text": "@Test\n void demo() throws IOException, InterruptedException {\n Spa... |
0505b6b05a4e87f7f9aa2237146bf45f | referencia al siguiente nodo en la lida constructor | [
{
"docid": "ab8c7e226229ba6c51ae7cfeb69102ea",
"score": "0.0",
"text": "public Node(E e, Node<E> n) {\r\n\t\t\t\telement = e;\r\n\t\t\t\tnext = n;\r\n\t\t\t}",
"title": ""
}
] | [
{
"docid": "74fb662c098684957320c1bdff8d6e72",
"score": "0.7471184",
"text": "public Nodo(int d,Nodo n){\n dato=d;\n siguiente=n;\n \n}",
"title": ""
},
{
"docid": "267c908c031592beb2df70255191de88",
"score": "0.7377056",
"text": "public Nodo() {//Nodo nulo\r\n\t\t\tthis(nul... |
b4d4babb0a4927efeb8b4ce62a0a11c7 | clear screen by printing several empty lines | [
{
"docid": "1a320307251554beeaa1c168830ed6d9",
"score": "0.8351519",
"text": "private void clearScreen() {\n for (int i = 0; i < 70; i++)\n System.out.println();\n }",
"title": ""
}
] | [
{
"docid": "b1b3cacafa79d34531d028f5dd2e1c9c",
"score": "0.830082",
"text": "private void clearScreen() {\n for (int i = 0; i < 40; i++) {\n System.out.println();\n }\n }",
"title": ""
},
{
"docid": "3e42a49ed8de3ac4274cf6a27654951f",
"score": "0.8281083",
... |
17cea6affc2c82048f477a99e66aabb7 | optional int64 start_date = 11; | [
{
"docid": "c21938d648405c0d36c108c086bcbea0",
"score": "0.0",
"text": "@java.lang.Override\n public boolean hasStartDate() {\n return ((bitField0_ & 0x00000400) != 0);\n }",
"title": ""
}
] | [
{
"docid": "07e9b8459800c39d5d7feb15a3e71b0c",
"score": "0.71474516",
"text": "long getStartDate();",
"title": ""
},
{
"docid": "07e9b8459800c39d5d7feb15a3e71b0c",
"score": "0.71474516",
"text": "long getStartDate();",
"title": ""
},
{
"docid": "07e9b8459800c39d5d7feb15a3... |
875f2adbadf9a93d2f07d65dc7b25bb5 | Set report folder and filename will be auto generated. | [
{
"docid": "9bcdce4cb4893b08084dedf4656accaa",
"score": "0.57410026",
"text": "public void setHTMLReportFolder(String HTMLReportFolder) {\r\n this.HTMLReportFolder = HTMLReportFolder;\r\n }",
"title": ""
}
] | [
{
"docid": "48fb434e259722e0e909188823a0d8f5",
"score": "0.6622188",
"text": "@Override\r\n public void onExecutionStart() {\r\n File file = new File(utils.getProperty(HTML_REPORT_FILE));\r\n if(!file.exists()){\r\n try {\r\n FileUtils.forceMkdir(file);\r\n ... |
bcca4a982eed3d93ebd856b552d8bc8d | Validate Streaming snowpipe related config provided by config(customer's config) | [
{
"docid": "54fdba3c0a0fb51595b9b5f48b432e28",
"score": "0.691997",
"text": "public static ImmutableMap<String, String> validateStreamingSnowpipeConfig(\n final Map<String, String> inputConfig) {\n Map<String, String> invalidParams = new HashMap<>();\n\n // For snowpipe_streaming, role should... | [
{
"docid": "43e314e4ca50849d255d8786adaa8ef0",
"score": "0.6153146",
"text": "private void checkConfiguration() {\n\t\tif (this.bootstrapServers.isEmpty()) {\n\t\t\tthrow new InvalidConfigurationException(\"At least one bootstrap server must be provided.\");\n\t\t}\n\n\t\t// Check whether a topic name w... |
8db85e178817b73e01d685ee8afa8e6e | Something went wrong, because of which we can't continue, so let the user know he can try and exit, and launch the app again. | [
{
"docid": "2e53338ecc0368d5042a7fd8fd13d648",
"score": "0.0",
"text": "private void showErrorAlert()\n {\n \tAlertDialog.Builder builder = new AlertDialog.Builder(this);\n \tbuilder.setMessage(getResources().getString(R.string.app_error_str))\n \t .setCancelable(false)\n \t .... | [
{
"docid": "b3f6b1780b065bc9fe1e35dbcb3ffe39",
"score": "0.7038303",
"text": "private void restartApplication() {\n android.os.Process.killProcess(android.os.Process.myPid());\r\n System.exit(0);\r\n }",
"title": ""
},
{
"docid": "096ae9849e5cd544a5bef4a8568d5ce9",
"scor... |
f0adb5360d337b3f4a6a31e173fe98b9 | Gets the value of the isChassisNoPick property. | [
{
"docid": "cc2767afd0e202305261942e9304366e",
"score": "0.9023023",
"text": "public boolean isIsChassisNoPick() {\n return isChassisNoPick;\n }",
"title": ""
}
] | [
{
"docid": "2a5d5352f051c0f7d0e53b4311a758da",
"score": "0.78734016",
"text": "public void setIsChassisNoPick(boolean value) {\n this.isChassisNoPick = value;\n }",
"title": ""
},
{
"docid": "9f1553dcbe861c2b44ae26cd7f0c700c",
"score": "0.601264",
"text": "public boolean ge... |
981aeac5e55d0280bff149661cd60c95 | Ensure to call this if your entity is ever set dead. | [
{
"docid": "b4f1adf5f7e7fcf02c28208d3d0263d9",
"score": "0.0",
"text": "public void destroy()\r\n {\r\n }",
"title": ""
}
] | [
{
"docid": "f3264d251096ccf0a696e2f832229149",
"score": "0.70535576",
"text": "protected void setDead()\n {\n alive = false;\n if(location != null) {\n field.clear(location);\n location = null;\n field = null;\n }\n }",
"title": ""
},
{... |
6f0dbdd80ca8dff5efbe51344aef3c98 | Returns the first interestcategory in the ordered set where uuid = &63;. | [
{
"docid": "a2b1e4adeda96b9dd8cdc8c56e3424d8",
"score": "0.76680666",
"text": "public static Interestcategory fetchByUuid_First(String uuid,\n\t\tOrderByComparator<Interestcategory> orderByComparator) {\n\t\treturn getPersistence().fetchByUuid_First(uuid, orderByComparator);\n\t}",
"title": ""
}
] | [
{
"docid": "cf2e3156c53cc90d88a4ff4ff1db01ae",
"score": "0.65591186",
"text": "public static Interestcategory fetchByUuid_C_First(String uuid,\n\t\tlong companyId, OrderByComparator<Interestcategory> orderByComparator) {\n\t\treturn getPersistence()\n\t\t\t\t .fetchByUuid_C_First(uuid, companyId, orde... |
9b1cd7d49692b3ca87e9c3fbfa5fde48 | trade type BUY or SELL | [
{
"docid": "0a0e59749388b949700d444c3c78462f",
"score": "0.6495259",
"text": "@Schema(example = \"SELL\", description = \"trade type BUY or SELL\")\n public TradeTypeEnum getTradeType() {\n return tradeType;\n }",
"title": ""
}
] | [
{
"docid": "31d31de0436d2784bc4efbc6bc588f04",
"score": "0.7177399",
"text": "public String getMeTheType(){\n\t// inverse to make \n\tif(type == MarketType.BID){\n\t\treturn \"sell\";\n\t}else{\n\t\treturn \"buy\";\n\t}\n}",
"title": ""
},
{
"docid": "a1bbb818e43e1f19eb68ead6dc41aa8f",
"... |
6f6b5efe3757aed6d935b3aff77e4641 | Piilottaa tai poistaa nykyisen projektin | [
{
"docid": "178dd24c424b3da85599ca1f4f4a0a70",
"score": "0.0",
"text": "protected void hideOrRemoveCurrentProject(boolean remove) {\n Project project = selectedProject;\n Alert alert = new Alert(AlertType.CONFIRMATION, remove ? \"Poistetaanko projektin tuntikirjanpito pysyvästi?\" : \"Pois... | [
{
"docid": "1b9fdd444682e6122c4e8d5ff50b24b1",
"score": "0.6842442",
"text": "public void loppu() {\n\n /*for (Pelaaja pel : kaikkiPelaajat) {\n System.out.println(\"kirjoitetaan tiedostoon: \" + pel.annaNimi() + \", \" + pel.annaEnnatysPisteet());\n\n }*/\n tiedostohall.ki... |
6e6ac07b696369918f7d9c32afd6263a | Write code here that turns the phrase above into concrete actions | [
{
"docid": "ee52aa6b736b0b64e1c6e48f142290c6",
"score": "0.0",
"text": "@When(\"^Existing customer enters the same card or account information$\")\n\tpublic void existing_customer_enters_the_same_card_or_account_information() throws Throwable {\n\t\tthrow new PendingException();\n\t}",
"title": ""
... | [
{
"docid": "c975b67ef4a8d34bfd414060b4ee22f0",
"score": "0.702124",
"text": "void action(String action);",
"title": ""
},
{
"docid": "ede5b0bf810ac147cb2e1442fc19f7b3",
"score": "0.65348786",
"text": "@Override\n\tpublic void action() {\n\t\t\n\t}",
"title": ""
},
{
"doci... |
5010364c7021b1de8c6a8a9337f6bac6 | / Used to get the students by CSDepartment class | [
{
"docid": "f3a3375d89092167040b3ea857f944d5",
"score": "0.0",
"text": "public TreeSet<Student> getStudents(){\n \t return students;\n }",
"title": ""
}
] | [
{
"docid": "5a8fa7eb508b0e284e8aa4513f0050e2",
"score": "0.69700116",
"text": "public List<Student> getStudentsInClass(Classroom classroom);",
"title": ""
},
{
"docid": "83f97302062d43073d7990e380fbf03a",
"score": "0.67889833",
"text": "Student getStudents();",
"title": ""
},
... |
8319cfcd49f690c1197254a23c3a7e29 | Verifies the specified remote group can be updated, if necessary. | [
{
"docid": "ae40422eee8bab9b0de29895e6055f16",
"score": "0.7365647",
"text": "@SuppressWarnings(\"unchecked\")\n private void verifyUpdate(RemoteProcessGroup remoteProcessGroup, RemoteProcessGroupDTO remoteProcessGroupDto) {\n // see if the remote process group can start/stop transmitting\n ... | [
{
"docid": "89fe4fa842f8392aeb8601820bf064e4",
"score": "0.6278116",
"text": "private boolean updateGroup(int id) {\r\n\t\tGroup group = new Group();\r\n\t\tgroup.setID(id);\r\n\t\tgroup.setDescription(\"Updated Group\");\r\n\t\tgroup.setName(\"Update Test\");\r\n\t\treturn requester.updateObject(group)... |
9f228ffca88ab4e8722857b43637f94a | A good way to store a stacktrace away efficiently is to simply construct an exception. Later, if you want to inspect the stacktrace call exception.getStackTrace() which will do the slow work of resolving the stack frames to methods. | [
{
"docid": "fa3ccfa35c0ba286bfc1a7a1040e57dc",
"score": "0.5869296",
"text": "@SuppressWarnings(\"ThrowableInstanceNeverThrown\")\n private Supplier<StackTraceElement[]> keepOriginalStackTrace() {\n return new Exception()::getStackTrace;\n }",
"title": ""
}
] | [
{
"docid": "125b662a6538e7100d359534be148292",
"score": "0.6146035",
"text": "private void throwStackException() {\n try {\n throw new Exception(\"stack underflow exception\");\n } catch (Exception ex) {\n ex.printStackTrace();\n s = new Stack();\n }... |
dc0bf5b4ccfdb58df4a9a11f9f64980d | Gets all of the active users with their associated session ID. Admin function. | [
{
"docid": "942cc363a55a2ce09c880bb9b5b1a715",
"score": "0.0",
"text": "public String getAllSessionIds(String sessionId) throws AuthenticationException {\n verifySessionIdForUser(ADMIN_EMAIL, sessionId);\n\n StringBuilder sessionIds = new StringBuilder();\n sessionIds.append(\"<h3>Current Sessi... | [
{
"docid": "2ea8e4bd3c19c8277ebca428c09b25e1",
"score": "0.73089254",
"text": "public List<UserDetails> getActiveUsers() {\r\n\t\t\r\n\t\tList<UserDetails> userList =userMap.values().stream().filter(u -> u.isActive()) .collect(Collectors.toList());\r\n\t\t\r\n\t\tif(userList ==null || userList.isEmpty()... |
38292c49c000bba7a4ee49307f1de9a9 | Method to reset scores | [
{
"docid": "056270ee6c2c468a3564a8a446294c0d",
"score": "0.8071721",
"text": "private void resetScores(){\n numberRight = 0;\n numberWrong = 0;\n score = 0;\n\n SharedPreferences.Editor edit = AstroQA.prefs.edit();\n edit.putInt(\"numberRight\", numberRight);\n ... | [
{
"docid": "c8dbbc076e57f2c8ef740f264766447c",
"score": "0.89652145",
"text": "public void resetScore() {\r\n\t\tscore = 0;\r\n\t}",
"title": ""
},
{
"docid": "e86f2aa05cb9f1870593be914598418a",
"score": "0.8957344",
"text": "public void resetScore() {\n this.score = 0;\n }... |
76d709aec45750a701b1b260532fc960 | The logical id of the resource, as used in the URL for the resource. Once assigned, this value never changes. | [
{
"docid": "7cbfe2c2728185659812e3d0273ea5d1",
"score": "0.0",
"text": "@Override\n public Builder id(java.lang.String id) {\n return (Builder) super.id(id);\n }",
"title": ""
}
] | [
{
"docid": "2a2232aa358169e84882d025ae809828",
"score": "0.750502",
"text": "@Override\n\tpublic Integer getId() {\n\t\treturn resourceId;\n\t}",
"title": ""
},
{
"docid": "2df9eddc0cf3555661172b279af6c4fa",
"score": "0.7460068",
"text": "String resourceId();",
"title": ""
},
... |
430c9daf757584626c77063a7f0373ab | private long DijkstraNum = Integer.MAX_VALUE; private ArrayList DijkstraPath = new ArrayList(); | [
{
"docid": "1690ec6f43bfbe5d4a6c5e6f726968ae",
"score": "0.0",
"text": "public Node(Object value) {\n this.value = value;\n }",
"title": ""
}
] | [
{
"docid": "bcc9f0a0485d5cfe4128bf9420fe965e",
"score": "0.6299296",
"text": "private ArrayList<Node> Dijkstra(Node loc1, Node loc2) {\n\n // Initially, only the start node is known.\n dPQ.add(start);\n\n //while loop that actually runs through all possible paths.\n while (dPQ.is... |
54eb786f1ce55e3ad1f9479af2a24df8 | private MedianFinder medianFinder = new DynamicFieldMF(); this constructor is being created from an drop off event. | [
{
"docid": "1ced2636ab9d0cd1f25f5e8ccfe2295f",
"score": "0.0",
"text": "public ProfitCellNode(Cell cell, int seqNo) {\n this.profitability = 0;\n this.numOfEmptyTaxis = 1;\n this.midFare = 0;\n this.numOfFares = 0;\n this.cell = cell;\n this.seqNo = seqNo;\n ... | [
{
"docid": "b42753bde9f25e19200f1750c2ff9d93",
"score": "0.72373044",
"text": "public MedianFinder() {\n \n }",
"title": ""
},
{
"docid": "aa0e3871d3c53a95f1f7d62ccea1c3b0",
"score": "0.7215805",
"text": "public MedianFinder() {\r\n }",
"title": ""
},
{
"doci... |
2ade80a039e2401e2e95ce2a50d3f82d | Calls onBeforeLoad method in the knowledge base. Called just before onLoad. The implementation could for example register data types. | [
{
"docid": "9498ae80f37204254a60d2615d42a305",
"score": "0.81796795",
"text": "void onBeforeLoad();",
"title": ""
}
] | [
{
"docid": "eef52e9a270ff74a19d9612715bfb246",
"score": "0.7279126",
"text": "@Override\n protected void loadDataInitial() {\n\n }",
"title": ""
},
{
"docid": "14b7b452a00b9bf765703352a6a1e621",
"score": "0.718057",
"text": "@Override\r\n\tprotected boolean beforeLoad() {\n\t\t... |
73949628b6941364cba653f4b3f37d0c | Calculates how "far along" a link some point is. This is expressed as a portion of the total link length. So, for example, a point right at the link's begin_node will have an offset_ratio of 0, a point in the middle will have an offset_ratio of .5, and a point at the end_node will have an offset_ratio of .5; | [
{
"docid": "1d6bd3568687f67b470a309c3f62d9a4",
"score": "0.6891088",
"text": "public double offset_ratio(Point coords){\n\t\t//Project onto this link\n\t\tPoint proj = project(coords);\n\t\t//Determine total length of this link\n\t\tdouble totalDist = this.haversine();\n\t\t//Determine distance from beg... | [
{
"docid": "72b3a331bf01d117d44287ac72d3fcfc",
"score": "0.59087294",
"text": "protected abstract Vec3 getConnectorAnchorOffset();",
"title": ""
},
{
"docid": "76c0df81b1166008c0c4a1bdcfb083a0",
"score": "0.5481852",
"text": "private Pair<Link, Double> getLinkCellOffset(List<Link> li... |
efac239cf8c7cd057e820fdc7ed771aa | Gets the riesgo value for this Vtbur_infocalkubo. | [
{
"docid": "0c492dc36ae15bf01269c3f924dc758e",
"score": "0.72356236",
"text": "public java.lang.String getRiesgo() {\n return riesgo;\n }",
"title": ""
}
] | [
{
"docid": "ae073ed403807dd8d296c10f40274944",
"score": "0.6170198",
"text": "public String getRaza() {\r\n\t\treturn raza;\r\n\t}",
"title": ""
},
{
"docid": "5ab16b2eda4d1a8b0b890c8039e78168",
"score": "0.6009843",
"text": "public SiacRSoggettoRelaz getSiacRSoggettoRelaz() {\n\t\tr... |
cb8321c60397014b9bedd4c1c8840fc4 | Scroll Down by one page | [
{
"docid": "f60404aa2b98e8feb764cd86c27ba616",
"score": "0.68749034",
"text": "public void scrollDown() throws CalabashException {\n calabashWrapper.scrollDown();\n }",
"title": ""
}
] | [
{
"docid": "8ec250ac7eef922fbd7512c20b2cb097",
"score": "0.75142586",
"text": "public void robotScrollDown() throws Exception\r\n\t{\r\n\t\tre = new Robot();\r\n\t\tre.keyPress(KeyEvent.VK_PAGE_DOWN);\r\n\t\tre.keyRelease(KeyEvent.VK_PAGE_DOWN);\r\n\t}",
"title": ""
},
{
"docid": "0566fc48ee... |