featureGainForMaxGainRatio)) {\n featureMaxGainRatio = gainRatio;\n featureGainForMaxGainRatio = infoGain;\n bestSplitPoint = splitPoint;\n }\n }\n else {\n xxx++;\n }\n \n }\n assert(! Double.isNaN(bestSplitPoint));\n gainRatios[fi] = featureMaxGainRatio;\n splitPoints[fi] = bestSplitPoint;\n\n if (featureMaxGainRatio > maxGainRatio || (featureMaxGainRatio == maxGainRatio && featureGainForMaxGainRatio > gainForMaxGainRatio)) {\n maxGainRatio = featureMaxGainRatio;\n gainForMaxGainRatio = featureGainForMaxGainRatio;\n numSplitsForBestFeature = featureToInfo[fi].size();\n }\n }\n \n logger.info(\"label distrib:\\n\" + baseLabelDistribution);\n logger.info(\"base entropy=\" + baseEntropy + \", info gain sum=\" + infoGainSum + \", total num split points=\" + totalNumSplitPoints + \", avg info gain=\" + avgInfoGain + \", num splits with < avg gain=\" + xxx);\n \n return new Object[] {gainRatios, splitPoints, Double.valueOf(baseEntropy), \n baseLabelDistribution, Integer.valueOf(numSplitsForBestFeature)};\n }","public abstract double[] solveDual(int[][] matrix, double[] profitTable, int[] teamTable);","INDArray getBoardScores() {\n //creez un vector ce va contine aceste scoruri si va putea fi folosit la antrenare\n INDArray boardScores = Nd4j.zeros(1, size * size);\n\n //creez o copie a tablei pentru a o putea modifica\n Stone[][] boardCopy = Board.getBoard(), board = new Stone[size][size];\n\n //gasesc recursiv scorurile tablei curente\n float[][] boardScoresFloat = new float[size][size];\n //simulez o mutare a jucatorului\n int stonesNr = Board.getStonesNr();\n for(int i = 0; i < size; i++)\n for(int j = 0; j < size; j++){\n Chain chain = new Chain();\n Stone stone = new Stone(color ? \"black\" : \"white\", chain);\n stone.setPosition(i, j);\n for (int k = 0; k < boardCopy.length; k++) {\n board[k] = Arrays.copyOf(boardCopy[k], boardCopy[k].length);\n }\n int[] lib = Control.verifyLiberties(board, stone, i, j);\n if(board[i][j] == null && lib[0] + lib[1] != 0){\n int depth = 0;\n int dif = size / 2;\n boardScoresFloat[i][j] = getQScore(board, i, j, depth, depth)\n + new Random().nextInt(1000 / stonesNr) - (500 / stonesNr)\n - abs(i - dif) - abs(j - dif);\n }\n else{\n boardScoresFloat[i][j] = -5000;\n }\n }\n\n //normalizez vectorul\n //aflu norma vectorului de valori\n double sum = 0;\n for(int i = 0; i < size; i++)\n for(int j = 0; j < size; j++)\n sum += boardScoresFloat[i][j] * boardScoresFloat[i][j];\n sum = Math.sqrt(sum);\n //aplic norma\n for(int i = 0; i < size; i++)\n for(int j = 0; j < size; j++)\n boardScoresFloat[i][j] /= sum;\n\n //inserez rezultatele gasite intr-un INDArray\n int poz = 0;\n for(int i = 0; i < size; i++)\n for(int j = 0; j < size; j++){\n boardScores.putScalar(new int[]{0, poz}, boardScoresFloat[i][j]);\n poz++;\n }\n //System.out.println(boardScores);\n return boardScores;\n }","private void declareArrays() {\n int iNumTimesteps = m_oLegend.getNumberOfTimesteps(),\n i, j, k;\n \n //Create arrays to hold raw data.\n mp_fLiveTreeVolumeTotals = new double[m_iNumSpecies][iNumTimesteps + 1][m_iNumSizeClasses];\n mp_fSnagVolumeTotals = new double[m_iNumSpecies][iNumTimesteps + 1][m_iNumSizeClasses]; \n mp_iLiveTreeCounts = new long[m_iNumSpecies][iNumTimesteps + 1][m_iNumSizeClasses];\n mp_iSnagCounts = new long[m_iNumSpecies][iNumTimesteps + 1][m_iNumSizeClasses];\n mp_fLiveTreeDBHTotal = new double[m_iNumSpecies][iNumTimesteps + 1];\n mp_fSnagDBHTotal = new double[m_iNumSpecies][iNumTimesteps + 1];\n mp_fTallestLiveTrees = new float[m_iNumSpecies+1][iNumTimesteps + 1][10];\n mp_fTallestSnags = new float[m_iNumSpecies+1][iNumTimesteps + 1][10];\n \n //Initialize all values with 0s\n for (i = 0; i < mp_fTallestLiveTrees.length; i++) {\n for (j = 0; j < mp_fTallestLiveTrees[i].length; j++) {\n for (k = 0; k < mp_fTallestLiveTrees[i][j].length; k++) {\n mp_fTallestLiveTrees[i][j][k] = 0;\n mp_fTallestSnags[i][j][k] = 0;\n }\n }\n }\n \n for (i = 0; i < m_iNumSpecies; i++) {\n for (j = 0; j <= iNumTimesteps; j++) {\n mp_fLiveTreeDBHTotal[i][j] = 0;\n mp_fSnagDBHTotal[i][j] = 0;\n for (k = 0; k < m_iNumSizeClasses; k++) {\n mp_iLiveTreeCounts[i][j][k] = 0;\n mp_iSnagCounts[i][j][k] = 0;\n mp_fLiveTreeVolumeTotals[i][j][k] = 0;\n mp_fSnagVolumeTotals[i][j][k] = 0;\n }\n }\n }\n }","static void makeAllWaysCacheDistToMethod(){\n allWaysCache = new long[8][NumToCheck + 1];\n int currentDescriptor = 0;\n for (int jump = 1; jump <= 3; jump++){\n for (int j = jump; j <= NumToCheck; j += jump){\n allWaysCache[currentDescriptor][j] = 1;\n }\n currentDescriptor++;\n }\n //1,2\n addShifted(allWaysCache[3], allWaysCache[0], 3);\n addShifted(allWaysCache[3], allWaysCache[1], 3);\n cummulativeShift(allWaysCache[3], 3);\n //1,3\n addShifted(allWaysCache[4], allWaysCache[0], 4);\n addShifted(allWaysCache[4], allWaysCache[2], 4);\n cummulativeShift(allWaysCache[4], 4);\n //2,3\n addShifted(allWaysCache[5], allWaysCache[1], 5);\n addShifted(allWaysCache[5], allWaysCache[2], 5);\n cummulativeShift(allWaysCache[5], 5);\n //1,2,3\n addShifted(allWaysCache[6], allWaysCache[3], 6);\n addShifted(allWaysCache[6], allWaysCache[4], 6);\n addShifted(allWaysCache[6], allWaysCache[5], 6);\n cummulativeShift(allWaysCache[6], 6);\n\n //do I want to add them together?\n //I think I do,\n for (int i = 0; i < 6; i++){\n for (int j = 0; j <= NumToCheck; j++){\n allWaysCache[6][j] += allWaysCache[i][j];\n }\n }\n addShifted(allWaysCache[5], allWaysCache[1], 0);\n addShifted(allWaysCache[5], allWaysCache[2], 0);\n addShifted(allWaysCache[4], allWaysCache[0], 0);\n addShifted(allWaysCache[4], allWaysCache[2], 0);\n addShifted(allWaysCache[3], allWaysCache[0], 0);\n addShifted(allWaysCache[3], allWaysCache[1], 0);\n for (int i = 0; i <= 6; i++){\n allWaysCache[i][0] = 1;\n }\n\n }","public void ss(){\n for (int c=0; c < league.length;c++) {\r\n for (int t=c+1;t<league.length;t++) {\r\n score = league[c].scoregenerator();\r\n secondscore = league[t].scoregenerator();\r\n league[c].pointsfor(score);\r\n league[t].pointsfor(secondscore);\r\n\r\n if (score > secondscore){\r\n league[c].wins();\r\n league[t].losses();\r\n }\r\n else if (score == secondscore){\r\n league[c].ties();\r\n league[t].ties();\r\n }\r\n else {\r\n league[t].wins();\r\n league[c].losses();\r\n }\r\n } \r\n }\r\n for (int c=0; c < AFC.length;c++) {\r\n for (int t=c+1;t<AFC.length;t++) {\r\n score = AFC[c].scoregenerator();\r\n secondscore = AFC[t].scoregenerator();\r\n AFC[c].pointsfor(score);\r\n AFC[t].pointsfor(secondscore);\r\n\r\n if (score > secondscore){\r\n AFC[c].wins();\r\n AFC[t].losses();\r\n }\r\n else if (score == secondscore){\r\n AFC[c].ties();\r\n AFC[t].ties();\r\n }\r\n else {\r\n AFC[t].wins();\r\n AFC[c].losses();\r\n }\r\n } \r\n }\r\n for (int c=0; c < NFC.length;c++) {\r\n for (int t=c+1;t<NFC.length;t++) {\r\n score = NFC[c].scoregenerator();\r\n secondscore = NFC[t].scoregenerator();\r\n NFC[c].pointsfor(score);\r\n NFC[t].pointsfor(secondscore);\r\n\r\n if (score > secondscore){\r\n NFC[c].wins();\r\n NFC[t].losses();\r\n }\r\n else if (score == secondscore){\r\n NFC[c].ties();\r\n NFC[t].ties();\r\n }\r\n else {\r\n NFC[t].wins();\r\n NFC[c].losses();\r\n }\r\n } \r\n }\r\n for (int c=0;c<AFCeast.length;c++) {\r\n for (int t=c+1;t<AFCeast.length;t++) {\r\n score = AFCeast[c].scoregenerator();\r\n secondscore = AFCeast[t].scoregenerator();\r\n AFCeast[c].pointsfor(score);\r\n AFCeast[t].pointsfor(secondscore);\r\n\r\n if (score > secondscore){\r\n AFCeast[c].wins();\r\n AFCeast[t].losses();\r\n }\r\n else if (score == secondscore){\r\n AFCeast[c].ties();\r\n AFCeast[t].ties();\r\n }\r\n else {\r\n AFCeast[t].wins();\r\n AFCeast[c].losses();\r\n }\r\n } \r\n }\r\n for (int c=0; c < AFCnorth.length;c++) {\r\n for (int t=c+1;t<AFCnorth.length;t++) {\r\n score = AFCnorth[c].scoregenerator();\r\n secondscore = AFCnorth[t].scoregenerator();\r\n AFCnorth[c].pointsfor(score);\r\n AFCnorth[t].pointsfor(secondscore);\r\n\r\n if (score > secondscore){\r\n AFCnorth[c].wins();\r\n AFCnorth[t].losses();\r\n }\r\n else if (score == secondscore){\r\n AFCnorth[c].ties();\r\n AFCnorth[t].ties();\r\n }\r\n else {\r\n AFCnorth[t].wins();\r\n AFCnorth[c].losses();\r\n }\r\n } \r\n }\r\n for (int c=0; c < AFCsouth.length;c++) {\r\n for (int t=c+1;t<AFCsouth.length;t++) {\r\n score = AFCsouth[c].scoregenerator();\r\n secondscore = AFCsouth[t].scoregenerator();\r\n AFCsouth[c].pointsfor(score);\r\n AFCsouth[t].pointsfor(secondscore);\r\n\r\n if (score > secondscore){\r\n AFCsouth[c].wins();\r\n AFCsouth[t].losses();\r\n }\r\n else if (score == secondscore){\r\n AFCsouth[c].ties();\r\n AFCsouth[t].ties();\r\n }\r\n else {\r\n AFCsouth[t].wins();\r\n AFCsouth[c].losses();\r\n }\r\n } \r\n }\r\n for (int c=0; c < AFCwest.length;c++) {\r\n for (int t=c+1;t<AFCwest.length;t++) {\r\n score = AFCwest[c].scoregenerator();\r\n secondscore = AFCwest[t].scoregenerator();\r\n AFCwest[c].pointsfor(score);\r\n AFCwest[t].pointsfor(secondscore);\r\n\r\n if (score > secondscore){\r\n AFCwest[c].wins();\r\n AFCwest[t].losses();\r\n }\r\n else if (score == secondscore){\r\n AFCwest[c].ties();\r\n AFCwest[t].ties();\r\n }\r\n else {\r\n AFCwest[t].wins();\r\n AFCwest[c].losses();\r\n }\r\n } \r\n }\r\n for (int c=0; c < NFCeast.length;c++) {\r\n for (int t=c+1;t<NFCeast.length;t++) {\r\n score = NFCeast[c].scoregenerator();\r\n secondscore = NFCeast[t].scoregenerator();\r\n NFCeast[c].pointsfor(score);\r\n NFCeast[t].pointsfor(secondscore);\r\n\r\n if (score > secondscore){\r\n NFCeast[c].wins();\r\n NFCeast[t].losses();\r\n }\r\n else if (score == secondscore){\r\n NFCeast[c].ties();\r\n NFCeast[t].ties();\r\n }\r\n else {\r\n NFCeast[t].wins();\r\n NFCeast[c].losses();\r\n }\r\n } \r\n }\r\n for (int c=0; c < NFCnorth.length;c++) {\r\n for (int t=c+1;t<NFCnorth.length;t++) {\r\n score = NFCnorth[c].scoregenerator();\r\n secondscore = NFCnorth[t].scoregenerator();\r\n NFCnorth[c].pointsfor(score);\r\n NFCnorth[t].pointsfor(secondscore);\r\n\r\n if (score > secondscore){\r\n NFCnorth[c].wins();\r\n NFCnorth[t].losses();\r\n }\r\n else if (score == secondscore){\r\n NFCnorth[c].ties();\r\n NFCnorth[t].ties();\r\n }\r\n else {\r\n NFCnorth[t].wins();\r\n NFCnorth[c].losses();\r\n }\r\n } \r\n }\r\n for (int c=0; c < NFCsouth.length;c++) {\r\n for (int t=c+1;t<NFCsouth.length;t++) {\r\n score = NFCsouth[c].scoregenerator();\r\n secondscore = NFCsouth[t].scoregenerator();\r\n NFCsouth[c].pointsfor(score);\r\n NFCsouth[t].pointsfor(secondscore);\r\n\r\n if (score > secondscore){\r\n NFCsouth[c].wins();\r\n NFCsouth[t].losses();\r\n }\r\n else if (score == secondscore){\r\n NFCsouth[c].ties();\r\n NFCsouth[t].ties();\r\n }\r\n else {\r\n NFCsouth[t].wins();\r\n NFCsouth[c].losses();\r\n }\r\n } \r\n }\r\n for (int c=0; c < NFCwest.length;c++) {\r\n for (int t=c+1;t<NFCwest.length;t++) {\r\n score = NFCwest[c].scoregenerator();\r\n secondscore = NFCwest[t].scoregenerator();\r\n NFCwest[c].pointsfor(score);\r\n NFCwest[t].pointsfor(secondscore);\r\n\r\n if (score > secondscore){\r\n NFCwest[c].wins();\r\n NFCwest[t].losses();\r\n }\r\n else if (score == secondscore){\r\n NFCwest[c].ties();\r\n NFCwest[t].ties();\r\n }\r\n else {\r\n NFCwest[t].wins();\r\n NFCwest[c].losses();\r\n }\r\n } \r\n }\r\n\r\n for (int c=0;c<league.length;c++){\r\n System.out.println(league[c]);\r\n }\r\n System.out.println(\"...\");\r\n try\r\n {\r\n Thread.sleep(3000);\r\n }\r\n catch (Exception e)\r\n {}\r\n System.out.println(\"\\n\" + \"Now let the playoffs begin!\" + \"\\n\");\r\n\r\n for (int y=0;y<4;y++){ // These next groups of code are sorting each division, and each conference based on wins\r\n for (int p=0;p<3;p++) {\r\n int a = p+1;\r\n if (AFCeast[a].displaywins() > AFCeast[p].displaywins()){\r\n Temp = AFCeast[p];\r\n AFCeast[p] = AFCeast[a];\r\n AFCeast[a] = Temp;\r\n }\r\n else if (AFCeast[a].displaywins() == AFCeast[p].displaywins() && AFCeast[a].displaypf() > AFCeast[p].displaypf()){\r\n Temp = league[p];\r\n league[p] = league[a];\r\n league[a] = Temp;\r\n }\r\n\r\n }\r\n }\r\n // System.out.println(AFCeast[0]);\r\n\r\n afcplayoff[0] = AFCeast[0];\r\n // System.out.println(afcplayoff[0]);\r\n for (int y=0;y<4;y++){\r\n for (int p=0;p<3;p++) {\r\n int a = p+1;\r\n if (AFCnorth[a].displaywins() > AFCnorth[p].displaywins()){\r\n Temp = AFCnorth[p];\r\n AFCnorth[p] = AFCnorth[a];\r\n AFCnorth[a] = Temp;\r\n }\r\n else if (AFCnorth[a].displaywins() == AFCnorth[p].displaywins() && AFCnorth[a].displaypf() > AFCnorth[p].displaypf()){\r\n Temp = league[p];\r\n league[p] = league[a];\r\n league[a] = Temp;\r\n }\r\n\r\n }\r\n }\r\n\r\n afcplayoff[1] = AFCnorth[0];\r\n for (int y=0;y<4;y++){\r\n for (int p=0;p<3;p++) {\r\n int a = p+1;\r\n if (AFCsouth[a].displaywins() > AFCsouth[p].displaywins()){\r\n Temp = AFCsouth[p];\r\n AFCsouth[p] = AFCsouth[a];\r\n AFCsouth[a] = Temp;\r\n }\r\n else if (AFCsouth[a].displaywins() == AFCsouth[p].displaywins() && AFCsouth[a].displaypf() > AFCsouth[p].displaypf()){\r\n Temp = league[p];\r\n league[p] = league[a];\r\n league[a] = Temp;\r\n }\r\n\r\n }\r\n }\r\n\r\n afcplayoff[2] = AFCsouth[0];\r\n for (int y=0;y<4;y++){\r\n for (int p=0;p<3;p++) {\r\n int a = p+1;\r\n if (AFCwest[a].displaywins() > AFCwest[p].displaywins()){\r\n Temp = AFCwest[p];\r\n AFCwest[p] = AFCwest[a];\r\n AFCwest[a] = Temp;\r\n }\r\n else if (AFCwest[a].displaywins() == AFCwest[p].displaywins() && AFCwest[a].displaypf() > AFCwest[p].displaypf()){\r\n Temp = league[p];\r\n league[p] = league[a];\r\n league[a] = Temp;\r\n }\r\n\r\n }\r\n }\r\n\r\n afcplayoff[3] = AFCwest[0];\r\n for (int y=0;y<4;y++){\r\n for (int p=0;p<3;p++) {\r\n int a = p+1;\r\n if (NFCeast[a].displaywins() > NFCeast[p].displaywins()){\r\n Temp = NFCeast[p];\r\n NFCeast[p] = NFCeast[a];\r\n NFCeast[a] = Temp;\r\n }\r\n else if (NFCeast[a].displaywins() == NFCeast[p].displaywins() && NFCeast[a].displaypf() > NFCeast[p].displaypf()){\r\n Temp = league[p];\r\n league[p] = league[a];\r\n league[a] = Temp;\r\n }\r\n\r\n }\r\n }\r\n nfcplayoff[0] = NFCeast[0];\r\n for (int y=0;y<4;y++){\r\n for (int p=0;p<3;p++) {\r\n int a = p+1;\r\n if (NFCnorth[a].displaywins() > NFCnorth[p].displaywins()){\r\n Temp = NFCnorth[p];\r\n NFCnorth[p] = NFCnorth[a];\r\n NFCnorth[a] = Temp;\r\n }\r\n else if (NFCnorth[a].displaywins() == NFCnorth[p].displaywins() && NFCnorth[a].displaypf() > NFCnorth[p].displaypf()){\r\n Temp = league[p];\r\n league[p] = league[a];\r\n league[a] = Temp;\r\n }\r\n\r\n }\r\n }\r\n nfcplayoff[1] = NFCnorth[0];\r\n for (int y=0;y<4;y++){\r\n for (int p=0;p<3;p++) {\r\n int a = p+1;\r\n if (NFCsouth[a].displaywins() > NFCsouth[p].displaywins()){\r\n Temp = NFCsouth[p];\r\n NFCsouth[p] = NFCsouth[a];\r\n NFCsouth[a] = Temp;\r\n }\r\n else if (NFCsouth[a].displaywins() == NFCsouth[p].displaywins() && NFCsouth[a].displaypf() > NFCsouth[p].displaypf()){\r\n Temp = league[p];\r\n league[p] = league[a];\r\n league[a] = Temp;\r\n }\r\n\r\n }\r\n }\r\n nfcplayoff[2] = NFCsouth[0];\r\n for (int y=0;y<4;y++){\r\n for (int p=0;p<3;p++) {\r\n int a = p+1;\r\n if (NFCwest[a].displaywins() > NFCwest[p].displaywins()){\r\n Temp = NFCwest[p];\r\n NFCwest[p] = NFCwest[a];\r\n NFCwest[a] = Temp;\r\n }\r\n else if (NFCwest[a].displaywins() == NFCwest[p].displaywins() && NFCwest[a].displaypf() > NFCwest[p].displaypf()){\r\n Temp = league[p];\r\n league[p] = league[a];\r\n league[a] = Temp;\r\n }\r\n\r\n }\r\n }\r\n nfcplayoff[3] = NFCwest[0];\r\n for (int y=0;y<16;y++){\r\n for (int p=0;p<15;p++) {\r\n int a = p+1;\r\n if (AFC[a].displaywins() > AFC[p].displaywins()){\r\n Temp = AFC[p];\r\n AFC[p] = AFC[a];\r\n AFC[a] = Temp;\r\n }\r\n else if (AFC[a].displaywins() == AFC[p].displaywins() && AFC[a].displaypf() > AFC[p].displaypf()){\r\n Temp = AFC[p];\r\n AFC[p] = AFC[a];\r\n AFC[a] = Temp;\r\n }\r\n\r\n }\r\n }\r\n for (int y=0;y<16;y++){\r\n for (int p=0;p<15;p++) {\r\n int a = p+1;\r\n if (NFC[a].displaywins() > NFC[p].displaywins()){\r\n Temp = NFC[p];\r\n NFC[p] = NFC[a];\r\n NFC[a] = Temp;\r\n }\r\n else if (NFC[a].displaywins() == NFC[p].displaywins() && NFC[a].displaypf() > NFC[p].displaypf()){\r\n Temp = NFC[p];\r\n NFC[p] = NFC[a];\r\n NFC[a] = Temp;\r\n }\r\n\r\n }\r\n }\r\n\r\n int maxw=0;\r\n\r\n for (int x=0;x<AFC.length;x++){\r\n\r\n if ((AFC[x].displaywins() > maxw) && \r\n (AFC[x].getName() != afcplayoff[0].getName()) && \r\n (AFC[x].getName() != afcplayoff[1].getName()) && \r\n (AFC[x].getName() != afcplayoff[2].getName()) && \r\n (AFC[x].getName() != afcplayoff[3].getName()) && \r\n (AFC[x].getName() != afcplayoff[4].getName()) && \r\n (AFC[x].getName() != afcplayoff[5].getName())){\r\n maxw = AFC[x].displaywins();\r\n afcplayoff[4] = AFC[x]; \r\n }\r\n\r\n }\r\n\r\n maxw=0;\r\n for (int x=0;x<AFC.length;x++){\r\n\r\n if (AFC[x].displaywins() > maxw && \r\n AFC[x].getName() != afcplayoff[0].getName() && \r\n AFC[x].getName() != afcplayoff[1].getName() && \r\n AFC[x].getName() != afcplayoff[2].getName() && \r\n AFC[x].getName() != afcplayoff[3].getName() && \r\n AFC[x].getName() != afcplayoff[4].getName() && \r\n AFC[x].getName() != afcplayoff[5].getName()){\r\n maxw = AFC[x].displaywins();\r\n afcplayoff[5] = AFC[x]; \r\n }\r\n }\r\n\r\n maxw=0;\r\n for (int x=0;x<NFC.length;x++){\r\n if (NFC[x].displaywins() > maxw && \r\n NFC[x].getName() != nfcplayoff[0].getName() && \r\n NFC[x].getName() != nfcplayoff[1].getName() && \r\n NFC[x].getName() != nfcplayoff[2].getName() && \r\n NFC[x].getName() != nfcplayoff[3].getName() && \r\n NFC[x].getName() != nfcplayoff[4].getName() && \r\n NFC[x].getName() != nfcplayoff[5].getName()){\r\n maxw = NFC[x].displaywins();\r\n nfcplayoff[4] = NFC[x]; \r\n }\r\n }\r\n maxw=0;\r\n for (int x=0;x<NFC.length;x++){\r\n\r\n if (NFC[x].displaywins() > maxw && \r\n NFC[x].getName() != nfcplayoff[0].getName() && \r\n NFC[x].getName() != nfcplayoff[1].getName() && \r\n NFC[x].getName() != nfcplayoff[2].getName() && \r\n NFC[x].getName() != nfcplayoff[3].getName() && \r\n NFC[x].getName() != nfcplayoff[4].getName() && \r\n NFC[x].getName() != nfcplayoff[5].getName()){\r\n maxw = NFC[x].displaywins();\r\n nfcplayoff[5] = NFC[x]; \r\n }\r\n }\r\n\r\n for (int y=0;y<4;y++){\r\n for (int p=0;p<3;p++) {\r\n int a = p+1;\r\n if (afcplayoff[a].displaywins() > afcplayoff[p].displaywins()){\r\n Temp = afcplayoff[p];\r\n afcplayoff[p] = afcplayoff[a];\r\n afcplayoff[a] = Temp;\r\n }\r\n else if (afcplayoff[a].displaywins() == afcplayoff[p].displaywins() && afcplayoff[a].displaypf() > afcplayoff[p].displaypf()){\r\n Temp = afcplayoff[p];\r\n afcplayoff[p] = afcplayoff[a];\r\n afcplayoff[a] = Temp;\r\n }\r\n\r\n }\r\n }\r\n for (int c=0;c<afcplayoff.length;c++){ // Testing to see if users team made the playoffs.\r\n if(YourTeam.getName().equals(afcplayoff[c].getName()))\r\n afcplayofft = true;\r\n }\r\n\r\n for (int y=0;y<4;y++){\r\n for (int r=0;r<3;r++) {\r\n int c = r+1;\r\n if (nfcplayoff[c].displaywins() > nfcplayoff[r].displaywins()){\r\n Temp = nfcplayoff[r];\r\n nfcplayoff[r] = nfcplayoff[c];\r\n nfcplayoff[c] = Temp;\r\n }\r\n else if (nfcplayoff[c].displaywins() == nfcplayoff[r].displaywins() && nfcplayoff[c].displaypf() > nfcplayoff[r].displaypf()){\r\n Temp = nfcplayoff[r];\r\n nfcplayoff[r] = nfcplayoff[c];\r\n nfcplayoff[c] = Temp;\r\n }\r\n\r\n }\r\n }\r\n for (int c=0;c<nfcplayoff.length;c++){\r\n if(YourTeam.getName().equals(nfcplayoff[c].getName()))\r\n nfcplayofft = true;\r\n }\r\n // This shows how the playoffs will look like to the user\r\n System.out.println(\"...\" + \"\\n\" + \"Based on the regular season, here is what the first round of playoffs will look like:\" + \"\\n\");\r\n try\r\n {\r\n Thread.sleep(3000);\r\n }\r\n catch (Exception e)\r\n {}\r\n System.out.println(afcplayoff[0].getName() + \" got a bye in the first round of the playoffs for placing first in the afc.\");\r\n System.out.println(afcplayoff[1].getName() + \" also got a bye in the first round of the playoffs for placing second in the afc.\" + \"\\n\");\r\n System.out.println(nfcplayoff[0].getName() + \" got a bye in the first round of the playoffs for placing first in the nfc.\");\r\n System.out.println(nfcplayoff[1].getName() + \" also got a bye in the first round of the playoffs for placing second in the nfc.\" + \"\\n\");\r\n\r\n System.out.println(afcplayoff[2].getName());\r\n System.out.println(\" \\\\-----\\\\\");\r\n System.out.println(\" ) Winner moves on to play the \" + afcplayoff[0].getName());\r\n System.out.println(\" /-----/\");\r\n System.out.println(afcplayoff[5].getName() + \"\\n\");\r\n\r\n System.out.println(afcplayoff[3].getName());\r\n System.out.println(\" \\\\-----\\\\\");\r\n System.out.println(\" ) Winner moves onto play the \"+ afcplayoff[1].getName());\r\n System.out.println(\" /-----/\");\r\n System.out.println(afcplayoff[4].getName() + \"\\n\");\r\n\r\n System.out.println(nfcplayoff[2].getName());\r\n System.out.println(\" \\\\-----\\\\\");\r\n System.out.println(\" ) Winner moves onto play the \"+ nfcplayoff[0].getName());\r\n System.out.println(\" /-----/\");\r\n System.out.println(nfcplayoff[5].getName() + \"\\n\");\r\n\r\n System.out.println(nfcplayoff[3].getName());\r\n System.out.println(\" \\\\-----\\\\\");\r\n System.out.println(\" ) Winner moves onto play the \"+ nfcplayoff[1].getName());\r\n System.out.println(\" /-----/\");\r\n System.out.println(nfcplayoff[4].getName() + \"\\n\");\r\n\r\n System.out.println(\"...\"+ \"\\n\");\r\n\r\n try\r\n {\r\n Thread.sleep(3000);\r\n }\r\n catch (Exception e)\r\n\r\n {}\r\n }","public static void checkConsistency(){\n double[] aNormalW=new double[numberOfObjectives];\n double randomIndex=0;\n double sum=0;\n for (int row=0;row<numberOfObjectives;row++){\n for (int column=0;column<numberOfObjectives;column++){\n\n sum+=weights[column]*objectives[row][column];\n }\n df.setRoundingMode(RoundingMode.UP);\n aNormalW[row]= Double.valueOf(df.format(sum));\n sum=0;\n }\n double awtDividedByWt=0;\n for (int i=0;i<numberOfObjectives;i++){\n awtDividedByWt+=aNormalW[i]/weights[i];\n decimalFormat.setRoundingMode(RoundingMode.HALF_UP);\n Double.valueOf(decimalFormat.format(awtDividedByWt));\n }\n double reciprocalNumber=(double) 1/numberOfObjectives;\n decimalFormat.setRoundingMode(RoundingMode.UP);\n Double.valueOf(decimalFormat.format(reciprocalNumber));\n double step3=reciprocalNumber*awtDividedByWt;\n decimalFormat.setRoundingMode(RoundingMode.UP);\n double numerator=Double.valueOf(decimalFormat.format(step3))-numberOfObjectives;\n double denominator=numberOfObjectives-1;\n decimalFormat.setRoundingMode(RoundingMode.UP);\n double ci=Double.valueOf(decimalFormat.format(numerator)) /denominator;\n decimalFormat.setRoundingMode(RoundingMode.CEILING);\n System.out.println(\"Consistency Index (CI)= \"+Double.valueOf(decimalFormat.format(ci)));\n System.out.println();\n double ciDividedByRI=ci/table23(numberOfObjectives);\n decimalFormat.setRoundingMode(RoundingMode.UP);\n // Double.valueOf(df.format(ciDividedByRI));\n if (ciDividedByRI<0.10){\n randomIndex=ci/table23(numberOfObjectives);\n decimalFormat.setRoundingMode(RoundingMode.UP);\n System.out.println(\"Random Index (RI)= \"+Double.valueOf(decimalFormat.format(randomIndex)));\n System.out.println(\"degree of consistency is satisfactory !!\");\n }else {\n System.out.println(\"the AHP may not yield meaningful results !!\");\n }\n System.out.println();\n }","int compteMonstres(Soldat unites[][]);","public abstract NSMutableArray<I_WorkFlowItem> tachesObligatoires();","public static void main(String[] args) {\n int l1=1000, l2=1000;\n int[] a1=new int[l1];\n int[] a2=new int[l2];\n int[] combine = new int[l1+l2];\n\n Random r = new Random();\n for (int i=0; i<a1.length; ++i){\n a1[i]=r.nextInt(a1.length*3);\n combine[i]=a1[i];\n }\n\n for (int i=0; i<a2.length; ++i){\n a2[i]=r.nextInt(a2.length*3);\n combine[l1+i]=a2[i];\n }\n\n Arrays.sort(a1);\n Arrays.sort(a2);\n Arrays.sort(combine);\n\n cnt=0;\n int m = findByRank(a1, 0, a1.length, a2, 0, a2.length, (a1.length+a2.length)/2);\n int m2 = combine[combine.length/2-1];\n\n System.out.printf(\"m=%d, m2=%d, cnt=%d\", m, m2, cnt);\n\n\n\n }","private static int[] getTimesTable(int requiredSize, int requiredNumber) \n\t{\n\t\t// local array for the loop to amend and then return\n\t\tint [] timesArray = new int [requiredSize];\n\t\n\t\tfor (int i = 1; i <= requiredSize; i++)\n\t\t{\n\t\t\t// amends the local timesArray array\n\t\t\ttimesArray[i -1] = requiredNumber * i; \n\t\t\t//System.out.println(timesArray[i -1] = requiredNumber * i); // testing purposes so you can see the value before ammending the array\n\t\t}\n\t\t\n\t\t// returns local array as result for the main method array\n\t\treturn timesArray;\n\t}","public static void main(String[] args)\n\t{\n \n\t\tSystem.out.println(\"Enter the size of transaction array\");\n int trSize = sc.nextInt();\n\n // creating an array of provided size\n int[] transactions = new int[trSize];\n \n // get the elements of the array (in a loop)\n System.out.println(\"Enter the values of array\");\n for (int i = 0; i < transactions.length; i++) {\n transactions[i] = sc.nextInt();\n }\n // get the number of targets\n System.out.println(\"Enter the total no of targets that needs to be achieved\");\n int numTargets = sc.nextInt();\n \n // get in target one-by-one (loop)\n for (int i = 0; i < numTargets; i++) {\n \n \t// Get TargetValue\n System.out.println(\"Enter the value of target\");\n int target = sc.nextInt();\n \n int sum =0;\n for ( int j=0; j < transactions.length; j++) {\n \tsum = sum + transactions[j];\n \t\n \tif ( sum >= target) {\n \tSystem.out.println(\"Target achieved after \" + (j+1) + \" transactions\" );\n \tbreak; // break out of the innermost for loop\n \t}\n \t\n \t//we come to the last transactions, yet target is not achieved\n \tif (j == transactions.length - 1) {\n \t\tSystem.out.println( \"Given target is not achieved\");\n \t}\n \t\n }\n \n \n\t}\n\n}","private void cpu_jogada(){\n\n for(i=0;i<8;i++){\n for(j=0;j<8;j++){\n if(matriz[i][j] == jd2){\n // verificarAtaque(i,j,jd2);\n //verificarAtaque as posssibilidades de\n // ataque : defesa : aleatorio\n //ataque tem prioridade 1 - ve se tem como comer quem ataca\n //defesa tem prioridade 2 - ou movimenta a peca que esta sob ataque ou movimenta a outa para ajudar\n //aleatorio nao tem prioridade -- caso nao esteja sob ataque ou defesa\n }\n }\n }\n }","public int[] twoSum2(int[] nums, int target) {\n int max = nums[0];\n int min = max;\n // get rank\n for (int e : nums) {\n if (e > max) {\n max = e;\n }\n if (e < min) {\n min = e;\n }\n }\n // show up table\n Integer[] showUpMap = new Integer[max - min + 1];\n LinkedList[] indicesMap = new LinkedList[max - min + 1];\n for (int i = 0; i < nums.length; i++) {\n showUpMap[nums[i] - min] = 1;\n if (indicesMap[nums[i] - min] == null) {\n indicesMap[nums[i] - min] = new LinkedList<Integer>();\n }\n indicesMap[nums[i] - min].add(i);\n }\n System.out.println(Arrays.toString(showUpMap));\n System.out.println(Arrays.toString(indicesMap));\n for (int i = 0; i < showUpMap.length; i++) {\n boolean show = showUpMap[i] != null;\n if (show) {\n int a = i + min;\n int need = target - a;\n if (need - min < showUpMap.length &&\n showUpMap[need - min] != null) {\n int ai = (int) indicesMap[i].get(0);\n int bi = (int) indicesMap[need - min].get(0);\n if (ai == bi) {\n bi = (int) indicesMap[need - min].get(1);\n }\n return new int[]{ai, bi};\n }\n }\n }\n return null;\n }","double calculateGLBasicMass(int i1, int i2, int i3)\n {\n\n // Array of Glycerolipid's num of Carbon, Hydrogen repeated (for SN1 Dropdown Menu's values)\n int[] arrayGL_sn1 = {\n 5,10, 7,14, 9,18, 11,22, 13,26, 15,30, 16,32, 17,34,\n 17,32, 18,36, 18,34, 19,40, 19,38, 19,38, 19,36, 20,40,\n 20,38, 20,36, 21,44, 21,42, 21,42, 21,40, 21,40, 21,38,\n 21,36, 21,36, 21,34, 22,44, 23,48, 23,46, 23,46, 23,44,\n 23,42, 23,40, 23,38, 23,36, 24,48, 25,50, 25,48, 25,46,\n 25,44, 25,42, 25,40, 25,38, 26,52, 27,54, 27,52, 28,56, 29,58};\n\n // addCarbon array: Amount of increase in Carbon when on certain sn2 & sn3 index position\n int[] addCarbon = {\n 0, 2, 4, 6, 8, 10, 12, 13, 14, 14, 15, 15, 16, 16, 17, 17, 17,\n 18, 18, 18, 18, 18, 18, 18, 19, 20, 20, 20, 20,\t20,\t20, 21, 22,\n 22,\t22,\t22,\t22, 22, 22, 23, 24, 24, 25, 26 };\n\n // addHydrogen array: Amount of increase in Hydrogen when on certain sn2 & sn3 index position\n int[] addHydrogen = {\n 0, 2, 6, 10, 14, 18, 22, 24, 26, 24, 28, 26, 30, 28, 32, 30, 28,\n 34,\t32,\t32,\t30,\t28,\t28,\t26,\t36,\t38,\t36,\t34,\t32,\t30,\t28,\t40,\t42,\n 40,\t38,\t36,\t34,\t32,\t30,\t44,\t46,\t44,\t48,\t50 };\n\n // Get the # of C & H depending on the index position of SN1's dropdown menu\n int numOfC = arrayGL_sn1[i1 * 2], numOfH = arrayGL_sn1[i1 * 2 + 1];\n\n // Add carbon & hydrogen depending on SN2 and SN3 dropdown menu's index position\n numOfC = numOfC + addCarbon[i2] + addCarbon[i3];\n numOfH = numOfH + addHydrogen[i2] + addHydrogen[i3];\n\n /* Set Number of Carbon & Hydrogen */\n setNumC(numOfC); setNumH(numOfH);\n\n /* Set Number of Oxygen */\n\n // If SN1 Dropdown index is not O or P\n if (i1 != 11 && i1 != 12 && i1 != 18 && i1 != 19 && i1 != 28 && i1 != 29) {\n\n if (i2 == 0 && i3 == 0){ setNumO(4); }\n else if (i2 == 0 || i3 == 0) { setNumO(5); }\n else setNumO(6);\n\n // If SN1 Dropdown index is O or P\n } else {\n\n if (i2 == 0 && i3 == 0){ setNumO(3); }\n else if (i2 == 0 || i3 == 0) { setNumO(4); }\n else setNumO(5);\n }\n\n // Sets the basic mass based on the elemental composition of the monoisotopic distribution\n setMass(calculateInitialMass(getNumC(), getNumH(), getNumO(), getNumN(), getNumAg(),\n getNumLi(), getNumNa(), getNumK(), getNumCl(), getNumP(), getNumS(), getNumF()));\n\n // Return basic mass\n return getMass();\n }","public static int zeroOneKnapsack(int[] weight, int[] value, int capacity) {\n\t\tint[][] dp = new int[weight.length + 1][capacity + 1];\n\n\t\tfor (int i = 0; i < weight.length + 1 ; i++) {\n\t\t\t for (int j = 0; j < capacity + 1; j++) {\n\t\t\t\t\n\t\t\t\t // base condition for memoization\n\t\t\t\t // first row and first column for 2d matrix is initialised to 0\n\t\t\t\t // profit = 0 when number of items = 0 or bag capacity = 0 \n\t\t\t\t if (i == 0 || j == 0) { \n\t\t\t\t\t dp[i][j] = 0;\n\t\t\t\t } \n\t\t\t\t \n\t\t\t\t // weight of item under consideration is less than capacity of bag\n\t\t\t\t // value of i in 2d matrix corresponds to (i-1)th element in weight and value arrays\n\t\t\t\t // hence, weight(i-1) is compared with the corresponding matrix cell capacity(i.e.column)\n\t\t\t\t \n\t\t\t\t else if (weight[i-1] <= j){\n\t\t\t\t\t \n\t\t\t\t\t // possibility 1: when item having weight(i-1) is added to bag\n\t\t\t\t\t // item having weight(i-1) has value(i-1)\n\t\t\t\t\t // this value added to array value for (i-1)th row and (j-weight[i-1])th column\n\t\t\t\t\t // because :\n\t\t\t\t\t // 1) the total capacity reduced by weight(i-1) after deciding item inclusion\n\t\t\t\t\t // 2) total no.of elements reduced by 1 after deciding item inclusion\n\t\t\t\t\t \n\t\t\t\t\t int a = value[i-1] + dp[i-1][j-weight[i-1]];\n\t\t\t\t\t \n\t\t\t\t\t// possibility 1: when item having weight(i-1) is not added to bag\n\t\t\t\t\t// 1) the total capacity remains as is after deciding item exclusion\n\t\t\t\t\t// 2) total no.of elements reduced by 1 after deciding item exclusion\n\t\t\t\t\t \n\t\t\t\t\t int b = dp[i-1][j];\n\t\t\t\t\t \n\t\t\t\t\t // max of a and b taken to find maximum profit value \n\t\t\t\t\t dp[i][j] = Math.max(a, b);\t \n\t\t\t\t\t \n\t\t\t\t }\n\t\t\t\t \n\t\t\t\t \n\t\t\t\t // weight of item under consideration is more than capacity of bag\n\t\t\t\t // hence item having weight(i-1) is not added to bag\n\t\t\t\t else {\n\t\t\t\t\t \n\t\t\t\t\t// 1) the total capacity remains as is after deciding item exclusion\n\t\t\t\t\t// 2) total no.of elements reduced by 1 after deciding item exclusion\n\t\t\t\t\t \n\t\t\t\t\t dp[i][j] = dp[i-1][j];\n\t\t\t\t\t \n\t\t\t\t }\n\t\t\t\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn dp[weight.length][capacity];\n\t\t\n\t}","@Test\n public void testBuildGraph_FactorArr_booleanArrArr() {\n\n char[][] adjacency = new char[][]{\n {0, 0, 0, 0, 0, 0, 0, 1, 0, 0},\n {0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n {0, 1, 0, 0, 0, 0, 0, 0, 0, 0},\n {0, 0, 1, 0, 0, 0, 0, 0, 0, 0},\n {0, 0, 0, 1, 0, 0, 0, 0, 0, 0},\n {0, 0, 0, 0, 0, 0, 1, 0, 0, 0},\n {1, 0, 0, 0, 0, 0, 0, 0, 0, 0},\n {0, 0, 0, 0, 1, 0, 0, 0, 0, 0},\n {0, 0, 0, 0, 0, 1, 0, 0, 0, 0},\n {0, 0, 0, 0, 0, 0, 0, 0, 1, 0},\n };\n\n CostFunction[][] factors = new CostFunction[][]{\n {factory.buildCostFunction( new Variable[]{v[0],v[7]}, 0 )},\n {},\n {factory.buildCostFunction( new Variable[]{v[1],v[2]}, 0 )},\n {factory.buildCostFunction( new Variable[]{v[2],v[3]}, 0 )},\n {factory.buildCostFunction( new Variable[]{v[3],v[4]}, 0 ),\n factory.buildCostFunction( new Variable[]{v[1],v[3],v[4]}, 0 )},\n {factory.buildCostFunction( new Variable[]{v[1],v[5]}, 0 )},\n {factory.buildCostFunction( new Variable[]{v[2],v[6]}, 0 ),\n factory.buildCostFunction( new Variable[]{v[1],v[6],v[7]}, 0 ),\n factory.buildCostFunction( new Variable[]{v[0],v[6]}, 0 )},\n {factory.buildCostFunction( new Variable[]{v[3],v[7]}, 0 )},\n {factory.buildCostFunction( new Variable[]{v[4],v[8]}, 0 ),\n factory.buildCostFunction( new Variable[]{v[5],v[8]}, 0 ),\n factory.buildCostFunction( new Variable[]{v[0],v[8]}, 0 )},\n {factory.buildCostFunction( new Variable[]{v[2],v[5],v[9]}, 0 ),\n factory.buildCostFunction( new Variable[]{v[5],v[6],v[9]}, 0 ),\n factory.buildCostFunction( new Variable[]{v[4],v[7],v[9]}, 0 ),\n factory.buildCostFunction( new Variable[]{v[0],v[8],v[9]}, 0 )},\n };\n\n GdlFactory gf = new GdlFactory();\n UPGraph result = JunctionTreeAlgo.buildGraph(gf, factors, adjacency);\n //System.out.println(result);\n }","int countSusbset(int n, int w){\n int dp[][] = new int[n+1][w+1];\n for(int i=0;i<=n;i++){\n for(int j=0;j<=w;j++){\n //when no items are there and target sum is 0, only one empty subset is possible\n if(i == 0 && j == 0){\n dp[i][j] = 1;\n }\n //no items left and target sum is greater than 0, no set is possible\n else if(i == 0 && j > 0){\n dp[i][j] = 0; \n }\n //if target sum is 0, no matter how many items we have , only one empty subset is possible\n else if(j == 0){\n dp[i][j] = 1;\n }\n //since item > target sum, so exclude\n else if(arr[i-1] > j){\n dp[i][j] = dp[i-1][j];\n }else{\n //two cases include and exclude\n dp[i][j] = dp[i-1][j] + dp[i-1][j - arr[i-1]];\n }\n }\n }\n return dp[n][w];\n}","@SuppressWarnings(\"boxing\")\n public int[] getMatching() {\n if (this.n == -1 || this.m == -1) {\n throw new IllegalStateException(\"Graph size not specified.\");\n }\n if (this.n == 0) {\n return new int[0];\n }\n ensurePositiveWeights();\n\n // Step 0: Initialization\n this.eligibleS.clear();\n this.eligibleT.clear();\n for (Integer i = 0; i < this.n; i++) {\n this.sMatches[i] = -1;\n\n this.u[i] = this.maxWeight; // ambiguous on p. 205 of Lawler, but see p. 202\n\n // this is really first run of Step 1.0\n this.sLabels[i] = EMPTY_LABEL;\n this.eligibleS.add(i);\n }\n\n for (int j = 0; j < this.m; j++) {\n this.tMatches[j] = -1;\n\n this.v[j] = 0;\n this.pi[j] = Double.POSITIVE_INFINITY;\n\n // this is really first run of Step 1.0\n this.tLabels[j] = NO_LABEL;\n }\n\n while (true) {\n // Augment the matching until we can't augment any more given the\n // current settings of the dual variables.\n while (true) {\n // Steps 1.1-1.4: Find an augmenting path\n int lastNode = findAugmentingPath();\n if (lastNode == -1) {\n break; // no augmenting path\n }\n\n // Step 2: Augmentation\n flipPath(lastNode);\n for (int i = 0; i < this.n; i++)\n this.sLabels[i] = NO_LABEL;\n\n for (int j = 0; j < this.m; j++) {\n this.pi[j] = Double.POSITIVE_INFINITY;\n this.tLabels[j] = NO_LABEL;\n }\n\n // This is Step 1.0\n this.eligibleS.clear();\n for (int i = 0; i < this.n; i++) {\n if (this.sMatches[i] == -1) {\n this.sLabels[i] = EMPTY_LABEL;\n this.eligibleS.add(i);\n }\n }\n\n this.eligibleT.clear();\n }\n\n // Step 3: Change the dual variables\n\n // delta1 = min_i u[i]\n double delta1 = Double.POSITIVE_INFINITY;\n for (int i = 0; i < this.n; i++) {\n if (this.u[i] < delta1) {\n delta1 = this.u[i];\n }\n }\n\n // delta2 = min_{j : pi[j] > 0} pi[j]\n double delta2 = Double.POSITIVE_INFINITY;\n for (int j = 0; j < this.m; j++) {\n if ((this.pi[j] >= TOL) && (this.pi[j] < delta2)) {\n delta2 = this.pi[j];\n }\n }\n\n if (delta1 < delta2) {\n // In order to make another pi[j] equal 0, we'd need to\n // make some u[i] negative.\n break; // we have a maximum-weight matching\n }\n\n changeDualVars(delta2);\n }\n\n int[] matching = new int[this.n];\n for (int i = 0; i < this.n; i++) {\n matching[i] = this.sMatches[i];\n }\n return matching;\n }","public static void knapsackDynamicProgramming(objects[] items, int capacity, int n) \r\n { \r\n\t\t//use bubble sort to sort item by their weight\t\t\t\t\r\n\t\tfor (int i = 0; i < n-1; i++) \t\t\t\t\r\n\t\t{ \t\t \r\n\t\t\tfor (int j = 0; j < (n-i-1); j++) \t\t \r\n\t\t\t{\t\t \r\n\t\t\t\tif (items[j].weight < items[j+1].weight) \t\t \r\n\t\t\t\t{ \t\t \t\r\n\t\t\t\t\tobjects temp = items[j]; \t\t \r\n\t\t\t\t\titems[j] = items[j+1]; \t\t \r\n\t\t\t\t\titems[j+1] = temp; \t\t \t\t\t\t\t\r\n\t\t\t\t}\t\t \r\n\t\t\t}\t\t\t\t\r\n\t\t}\r\n\t\t\r\n \tif(n <= 0 || capacity <= 0)\r\n \t{\r\n \t\tSystem.out.print(\"Error capacity and object numbers can't be 0\");\r\n \t}\r\n \r\n \tint matrixTable[][] = new int[n+1][capacity+1]; \r\n \r\n \tfor (int i = 0; i <= n; i++) \r\n \t{ \r\n \t\tfor (int j = 0; j <= capacity; j++) \r\n \t\t{ \r\n \t\t\t//Preset row 0 value and column value to 0\r\n \t\t\tif (i==0 || j==0) \r\n \t {\r\n \t\t\t\tmatrixTable[i][j] = 0; \r\n \t }\r\n \r\n \t\t\t//If current row number is greater than current weight number\r\n \t\t\telse if (items[i-1].weight <= j) \r\n \t\t\t{\r\n \t\t\t\t//Compare the top value with top value plus value(use weight as the value to go left)result\r\n \t\t\t\t//and use the greatest value for the current one.\r\n \t\t\t\tmatrixTable[i][j] = Math.max(items[i-1].profit + matrixTable[i-1][j-items[i-1].weight], matrixTable[i-1][j]); \r\n \t\t\t}\r\n \t\t\t//If row number is less than current weight number just use the top value\r\n \t\t\telse \r\n \t\t\t{ \t \r\n \t\t\t\tmatrixTable[i][j] = matrixTable[i-1][j];\r\n \t\t\t}\r\n \t\t} \t\r\n \t} \r\n \t\r\n\t\tint totalProfit = matrixTable[n][capacity]; \t\t\r\n\t\tint temp = matrixTable[n][capacity];\r\n\t\tint [] itemInKnapsack = new int [n];\r\n\t\t\r\n\t\t//solving which item is in the knapsack\r\n for (int i = n; i > 0 && temp > 0; i--) { \r\n \r\n \r\n \tif (temp == matrixTable[i - 1][capacity]) \r\n \t{\r\n continue;\r\n \t}\r\n \t//if the top value is different than it is include in the knapsack\r\n else \r\n { \r\n itemInKnapsack[i-1] = items[i-1].index; //Save item number\r\n temp = temp - items[i - 1].profit; \r\n capacity = capacity - items[i - 1].weight; \r\n } \r\n } \r\n \r\n printResult(itemInKnapsack, totalProfit, 2); //Call print result\r\n }","public static int[] mucScore(LeanDocument key, LeanDocument response)\n{\n // System.out.println(\"==========================================================\");\n // System.out.println(\"Key:\\n\"+key.toStringNoSing()+\"\\n*************************\\nResponse:\\n\"+response.toStringNoSing());\n\n Iterator<TreeMap<Integer, Integer>> goldChains = key.chainIterator();\n // double mucRecall = 0.0;\n int mucRecallNom = 0;\n int mucRecallDenom = 0;\n while (goldChains.hasNext()) {\n TreeMap<Integer, Integer> keyChain = goldChains.next();\n if (keyChain.size() > 1) {\n int numInt = numIntersect(key, keyChain, response);\n\n // int numMatched = getNumMatched(key, keyChain);\n // if(numMatched>0){\n // mucRecallNom += numMatched-numInt;\n mucRecallNom += (keyChain.size() - numInt);\n // mucRecallDenom += numMatched-1;\n mucRecallDenom += keyChain.size() - 1;\n\n // System.out.println(keyChain+\"\\n\"+(keyChain.size() - numInt)+\"/\"+(keyChain.size()-1));\n // }\n }\n }\n int[] result = { mucRecallNom, mucRecallDenom };\n\n return result;\n}","public static void main(String[] args)\n {\n int[][] ints;\n int[][] ints1;\n\n\n\n\n ints = new int[][]{\n {1, 2, 3, 4, 5, 6, 7, 8, 9},\n {10, 11, 12, 13, 14, 15, 16, 17, 18},\n {19, 20, 21, 22, 23, 24, 25, 26, 27},\n {28, 29, 30, 31, 32, 33, 34, 35, 36},\n {37, 38, 39, 40, 41, 42, 43, 44, 45},\n {46, 47, 48, 49, 50, 51, 52, 53, 54},\n {55, 56, 57, 58, 59, 60, 61, 62, 63},\n {64, 65, 66, 67, 68, 69, 70, 0, 71},\n {73, 74, 75, 76, 77, 78, 79, 80, 72}\n };\n\n ints = new int[][]{\n {1,0},\n {2,3},\n };\n ints1 = new int[][]{\n {1, 2, 3},\n {4, 5, 6},\n {7, 0, 8}\n };\n\n ints1 = new int[][]{\n {1, 2, 3},\n {4, 8, 5},\n {7, 0, 6}\n };\n ints = new int[][]{\n {5, 0, 4},\n {2, 3, 8},\n {7,1,6}\n };\n ints1 = new int[][]{\n {1, 6, 4},\n {7, 0, 8},\n {2, 3, 5}\n };\n\n ints1 = new int[][]{\n {6, 0, 5},\n {8, 7, 4},\n {3, 2, 1}\n };\n ints1 = new int[][]{\n {11, 0, 4, 7},\n {2, 15, 1, 8},\n {5, 14, 9, 3},\n {13, 6, 12, 10 }\n };\n\n\n ints1 = new int[][]{\n {14, 13, 5, 3},\n {0, 1, 8, 12},\n {6, 2, 4, 10},\n {11, 9, 15, 7 }\n };\n\n ints1 = new int[][]{\n {8, 4, 7},\n {1,5,6},\n {3,2,0}\n };\n\n\n ints1 = new int[][]{\n {8, 4, 7},\n {1,5,6},\n {3,2,0}\n };\n\n\n ints = new int[][]{\n {1, 2, 3},\n {4, 6,5},\n {7, 8,0}\n };\n ints1 = new int[][]{\n {8, 4, 7},\n {1,5,6},\n {3,2,0}\n };\n ints = new int[][]{\n {1,0},\n {2,3},\n };\n System.out.println(System.currentTimeMillis());\n Board board = new Board(ints);\n Solver solution = new Solver(board);\n\n for (Board el :solution.solution())\n {\n System.out.println(el);\n }\n System.out.println(System.currentTimeMillis());\n\n\n }","public static void main(String[] args) {\n\t\tint width=35;\n\t\tint length=31;\n\t\tlong[][] dp = new long[width+1][length+1];\n\t\tdp[0][0]=0;\n\t\tfor(int i=1;i<length+1;i++){\n\t\t\tif(badCheck(0,i,0,i-1)){\n\t\t\t\tdp[0][i]=0;\n\t\t\t\tfor(int k=i+1;k<length+1;k++){\n\t\t\t\t\tdp[0][k]=0;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}else{\n\t\t\t\tdp[0][i]=1;\n\t\t\t}\n\t\t}\n\t\tfor(int i=1;i<width+1;i++){\n\t\t\tif(badCheck(i,0,i-1,0)){\n\t\t\t\tdp[i][0]=0;\n\t\t\t\tfor(int k=i+1;k<width+1;k++){\n\t\t\t\t\tdp[k][0]=0;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}else{\n\t\t\t\tdp[i][0]=1;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\t\n\t\t\n\t\tfor(int i=1;i<=width;i++){\n\t\t\tfor(int j=1;j<=length;j++){\n\t\t\t\tif(!badCheck(i-1,j,i,j)){\n\t\t\t\t\tdp[i][j]+=dp[i-1][j];\n\t\t\t\t}\n\t\t\t\tif(!badCheck(i,j-1,i,j)){\n\t\t\t\t\tdp[i][j]+=dp[i][j-1];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t//System.out.println(dp[6][6]);\n\t\t//System.out.println(dp[2][2]);\n\t\t//System.out.println(dp[1][1]);\n\t\tSystem.out.println(dp[35][31]);\n\t}","public void ruleOutPos(){\n for(int i=0;i<scores.length;i++) {\n for(int j=0;j<scores[i].length;j++) {\n scores[i][j][13] = 0;//0=pass, >0 is fail, set to pass initially\n\n //check Ns - bit crude - what to discount regions with high N\n double ns = (double) scores[i][j][14] / (double) pLens[j];\n if (ns >= minPb | ns >= minPm)//\n scores[i][j][13] += 4;\n\n //probe\n if (hasProbe){\n if (j == 1 | j == 4) {\n double perc = (double) scores[i][j][0] / (double) primers[j].length();\n if (perc >= minPb) {\n scores[i][j][12] = 1;//flag for failed % test\n scores[i][j][13] += 2;\n }\n }\n }\n //primer\n else {\n //if more than 2 mismatches in 1-4nt at 3'\n if(scores[i][j][11]>max14nt) {\n scores[i][j][13]+=1;\n }\n //use mLen (combined F and R length) initially to find initial candidates - filter later\n double perc=(double)scores[i][j][0]/(double)mLen;\n double percI=(double)scores[i][j][0]/(double)pLens[j];\n\n if(perc>=minPm | percI>=minPmI) {\n scores[i][j][12]=1;//flag for failed % test\n scores[i][j][13]+=2;\n }\n }\n }\n }//end of finding positions that prime loop\n }","private static int computeCost(int[] arr, int[] combo) {\n int [] cost = new int[combo.length];\n int startCol = 0;\n for(int i = 0; i < combo.length; i++) {\n cost[i] = getCostForPartition(arr, startCol, combo[i]);\n startCol += combo[i];\n }\n // get total cost\n int retval = 0;\n for (int value : cost) {\n retval += value;\n }\n return retval;\n }","private int[] assign(List<T> medoids, List<T> data) {\n\t\tint[] out = new int[data.size()];\n\t\tfor (int i = 0; i < data.size(); i++) {\n\t\t\tdouble bestDistance = dm.measure(data.get(i), medoids.get(0));\n\t\t\tint bestIndex = 0;\n\t\t\tfor (int j = 1; j < medoids.size(); j++) {\n\t\t\t\tdouble tmpDistance = dm.measure(data.get(i), medoids.get(j));\n\t\t\t\tif (tmpDistance < bestDistance) {\n\t\t\t\t\tbestDistance = tmpDistance;\n\t\t\t\t\tbestIndex = j;\n\t\t\t\t}\n\t\t\t}\n\t\t\tout[i] = bestIndex;\n\n\t\t}\n\t\treturn out;\n\n\t}","@Override\r\n\tpublic int challengeThree(int[] arr) {\n\t\treturn 0;\r\n\t}","Soldat[][] getUnites();","MixtureOfExperts(int nExperts){\r\n\t\twritePosteriorThreshold = 0.0;\r\n\t\testimationPosteriorThreshold = 0.0;\r\n\t\tnumberOfExperts = nExperts;\r\n\t\tlogProbOfCluster = new float[numberOfExperts];\r\n numberOfUsers = 0;\r\n \r\n\t}","public static int[][] neighborhoodSearch(float[] benefit, float[] weight, int[] knapsackWeight){\n\n /*\n Using greedy algorithm to put items in knapsacks\n */\n\n // number of items\n int itemLen = benefit.length;\n // number of knapsacks\n int knapsackLen = knapsackWeight.length;\n // key: index of item, value: benefit / weight of item\n Map<Integer, Float> benefitPerWeightToIndexMap = new TreeMap<>();\n // if item i is included in knapsack j, result[i][j] = 1, otherwise result[i][j] = 0\n int[][] result = new int[itemLen][knapsackLen];\n // initialize the map\n for (int i = 0; i < itemLen; i++) {\n benefitPerWeightToIndexMap.put(i, (benefit[i] / weight[i]));\n }\n\n // the value comparator for sorting the entrySet in the map by value in descending order (using lambda)\n Comparator<Map.Entry<Integer, Float>> valueComparator = (o1, o2) -> o2.getValue().compareTo(o1.getValue());\n // convert the map to list to sort it by value comparator\n List<Map.Entry<Integer, Float>> benefitPerWeightToIndexList = new ArrayList<>(benefitPerWeightToIndexMap.entrySet());\n benefitPerWeightToIndexList.sort(valueComparator);\n\n printBenefitPerWeightList(benefitPerWeightToIndexList);\n\n int greedyTotalBenefit = 0;\n\n // put items in list into knapsacks\n for (int j = 0; j < knapsackLen; j++) {\n // the items have been put in and ready to be delete\n List<Map.Entry<Integer, Float>> deleteList = new ArrayList<>();\n for (Map.Entry<Integer, Float> entry:\n benefitPerWeightToIndexList) {\n int i = entry.getKey();\n if (weight[i] <= knapsackWeight[j]) {\n result[i][j] = 1;\n greedyTotalBenefit += benefit[i];\n deleteList.add(entry);\n knapsackWeight[j] -= weight[i];\n }\n }\n // delete the items have been put in\n benefitPerWeightToIndexList.removeAll(deleteList);\n }\n // After greedy algorithm\n System.out.println(\"------After greedy algorithm------\");\n printKnapsackWeight(knapsackWeight);\n printItemsNotIncluded(benefitPerWeightToIndexList);\n System.out.println(\"Total benefit:\" + greedyTotalBenefit);\n printResult(result);\n\n /*\n Search neighborhood\n */\n\n int neighborTotalBenefit = greedyTotalBenefit;\n\n // traversing knapsacks\n for (int j1 = 0; j1 < knapsackLen - 1; j1++) {\n for (int j2 = j1 + 1; j2 < knapsackLen; j2++) {\n // traversing items in the two knapsacks\n for (int i1 = 0; i1 < itemLen; i1++) {\n for (int i2 = 0; i2 < itemLen; i2++) {\n // judge if item i1 and item i2 exists in knapsack j1 and j2 respectively\n if (result[i1][j1] == 1 && result[i2][j2] == 1) {\n // tempList for update benefitPerWeightToIndexList in iteration\n List<Map.Entry<Integer, Float>> tempList = new ArrayList<>(benefitPerWeightToIndexList);\n // traversing items that have not been included\n for (Map.Entry<Integer, Float> entry:\n benefitPerWeightToIndexList) {\n int i3 = entry.getKey();\n // judge if the neighborhood solution is feasible\n if (knapsackWeight[j2] + weight[i2] - weight[i1] >= 0\n && knapsackWeight[j1] + weight[i1] - weight[i3] >= 0) {\n // judge if the neighborhood solution is better\n if (neighborTotalBenefit - benefit[i2] + benefit[i3] > neighborTotalBenefit) {\n // change the current solution to the neighborhood solution\n result[i1][j1] = 0;\n result[i1][j2] = 1;\n\n result[i2][j2] = 0;\n\n result[i3][j1] = 1;\n\n tempList.remove(entry);\n int finalI2 = i2;\n tempList.add(new Map.Entry<Integer, Float>() {\n @Override\n public Integer getKey() {\n return finalI2;\n }\n\n @Override\n public Float getValue() {\n return benefit[finalI2] / weight[finalI2];\n }\n\n @Override\n public Float setValue(Float value) {\n return null;\n }\n });\n\n knapsackWeight[j1] += weight[i1] - weight[i3];\n knapsackWeight[j2] += weight[i2] - weight[i1];\n\n neighborTotalBenefit = (int) (neighborTotalBenefit - benefit[i2] + benefit[i3]);\n\n System.out.println(\"------Find a better solution------\");\n System.out.println(\"Remove item\" + i2 + \" in \" + \"knapsack\" + j2 + \", move item\" + i1 + \" from knapsack\" + j1 + \" to \" + \"knapsack\" + j2 + \" and put item\" + i3 + \" in knapsack\" + j1);\n printKnapsackWeight(knapsackWeight);\n printItemsNotIncluded(tempList);\n System.out.println(\"Total benefit:\" + neighborTotalBenefit);\n printResult(result);\n }\n }\n }\n // update the list after traversing the list\n benefitPerWeightToIndexList = tempList;\n }\n }\n }\n }\n }\n\n return result;\n }","public abstract double solve(int[][] matrix, double[] profitTable, int[] teamTable);","@Test\n public void testCreateRowIndices2(){\n int[][] a = new int[4][2];\n a[0][0] = 0;\n a[0][1] = 0;\n a[1][0] = 0;\n a[1][1] = 1;\n a[2][0] = 0;\n a[2][1] = 2;\n a[3][0] = 2;\n a[3][1] = 1;\n\n double[][] input = new double[4][3];\n\n for(int i = 0 ; i < a.length ; i++){\n input[a[i][0]][a[i][1]] = 1;\n }\n\n int[][] myIndices = HarderArrayProblems.createRowIndices(input);\n for(int i = 0 ; i < a.length ; i++){\n assertEquals(a[i][0], myIndices[i][0]);\n assertEquals(a[i][1], myIndices[i][1]);\n }\n\n }","public abstract int[] solve(double[][] costs);","public void bsetCostElements() {\n\t\t\t\n\t\t\t\n\t\tfor (int obj = 0; obj < finalLocation.length; obj++) {\n\t\t for (int time = 0; time < finalLocation[obj].length; time++) {\n\t\t\t\n\t\t bfCost[obj][time].bstorageCost=totalCostCalculation.btotalResidentCost[time][obj][finalLocation[obj][time]].bstorageCost;\n\t\t\t bfCost[obj][time].breadCost=totalCostCalculation.btotalResidentCost[time][obj][finalLocation[obj][time]].breadCost;\n\t\t\t bfCost[obj][time].bwriteCost=totalCostCalculation.btotalResidentCost[time][obj][finalLocation[obj][time]].bwriteCost;\n\t\t\t bfCost[obj][time].btranCost=totalCostCalculation.btotalResidentCost[time][obj][finalLocation[obj][time]].btranCost;\n\t\t\t \n\t\t\t //1. we calculate latency cost for two cases separately: when the object is in the hot tier or cool tier.\n\t\t\t if (finalLocation[obj][time]==0){//Object is in the cool tier\n\t\t\t\t bfCost[obj][time].bdelayCost=totalCostCalculation.btotalResidentCost[time][obj][0].bdelayCost;\n\t\t\t\t \n\t\t\t }else{// object is in both tiers and, in consequence, the latency cost of writes is the maximum latency of writing in both tiers, and the read latency is the one in hot tier.\n\t\t\t\t bfCost[obj][time].bedelCost=fc.bdelayMaxWriteReadCost(workloadGenerator.objectListRegion[obj], 1, obj, time);\n\t\t\t }\n\t\t\t \n\t\t /* 2. Here we calculate storage cost and transaction cost to make consistent data. This requires just write transaction. Since in our cost \n calculation make a computation for both read and writes.\n\t\t */\n\t\t \n\t\t if(finalLocation[obj][time]==1){//NOTE: in above cost storage, we calculate the cost of object in either in hot or cold tier. \n\t\t \t //So here we calculate the storage cost in cold tier when the object is in hot tier.\n\t\t \t bfCost[obj][time].bstorageCost=bfCost[obj][time].bstorageCost.add(totalCostCalculation.btotalResidentCost[time][obj][0].bstorageCost);\n\t\t bfCost[obj][time].bconsisCost=totalCostCalculation.btotalResidentCost[time][obj][0].bconsisCost;\n\t\t }\n\t\t\t bfCost[obj][time].bnonMigrationCost=bfCost[obj][time].bstorageCost.add(bfCost[obj][time].breadCost).add( bfCost[obj][time].bwriteCost).\n\t\t\t\t\t add(bfCost[obj][time].btranCost).add( bfCost[obj][time].bconsisCost).\n\t\t\t\t\t add(bfCost[obj][time].bdelayCost);\n\t\t\t\t\t //totalCostCalculation.btotalResidentCost[time][obj][finalLocation[obj][time]].bnonMigrationCost.add(bfCost[obj][time].bconsisCost);\n\t\t\t \n\t\t\t //3. We need to calculate just transfer cost between cold to hot tier. From hot to cold tier does not make sense because we have a copy of data in cold tier.\n\t\t if(breakPoint==1){//If breakPoint is ONE then for serving every user, the object for each time slot is transfered from Cold to Hot tier.\n\t\t \t \n\t\t }\n\t\t else if(time>0 && finalLocation[obj][time-1]==0 && finalLocation[obj][time]==1){\n\t\t\t bfCost[obj][time].bmigrationCost=totalCostCalculation.btotalMigrationCost[time][obj][finalLocation[obj][time-1]][finalLocation[obj][time]];\n\t\t\t\t}\n\t\t\t}\n\t\t}\t\t\n\t}","public int _maxProfitAssignmentSortedCollectors(int[] difficulty, int[] profit, int[] worker) {\n int n = difficulty.length;\n int [][] dp = new int [n][2]; // difficulty, profit pair (dp)\n\n for (int idx = 0; idx < n; idx ++) {\n dp [idx][0] = difficulty [idx];\n dp [idx][1] = profit [idx];\n }\n\n Arrays.sort (dp, (a, b) -> a [0] - b [0]);\n\n // sort the collectors.\n Arrays.sort (worker);\n\n int ans = 0, best = 0, idx = 0;\n for (int w : worker) {\n // compute maxima and save it for next we well to build upon the max (best) seen so far.\n while (idx < n && w >= dp [idx][0]) { // increase difficulty slowly\n best = Math.max (best, dp [idx][1]);\n idx ++;\n }\n ans += best;\n }\n return ans;\n }","public void fillHeuristicArrayTD(){\n int[] temp;\n //every var gets a score based on how many clauses it satisfies\n for(int i = 0; i< heuristicArrayTD.length; i++){\n temp=variables.clone();\n temp[i]=0;\n heuristicArrayTD[i]=testAstar(temp);\n temp[i]=1;\n heuristicArrayTD[i]+=testAstar(temp);\n }\n }","public static void main (String args[]) {\n\t\tint[][] ar = BandedArraySearch.create(13);\n\t\tnew BandedArraySolution(ar).trial();\n\t}","public static void main(String[] args) throws FileNotFoundException {\n FileReader fileReader = new FileReader(\"C:\\\\Users\\\\Stephanie\\\\Projects\\\\HackerRank\\\\src\\\\data\");\n\n Scanner sc = new Scanner(fileReader);\n DecimalFormat df = new DecimalFormat(\"##.00\");\n int n = sc.nextInt();\n\n\n sc.nextLine();\n int i, k = 0, j = 0;\n double arr[] = new double[n - 20];\n int arr_x[] = new int[n - 20];\n int miss_index[] = new int[20];\n for (i = 0; i < n; i++) {\n String temp[] = sc.nextLine().split(\"\\t\");\n\n if (temp[1].startsWith(\"Missing\")) {\n miss_index[j] = i;\n j++;\n } else {\n arr[k] = Double.parseDouble(temp[1]);\n arr_x[k] = i;\n k++;\n }\n\n }\n\n System.out.println(Arrays.toString(arr));\n System.out.println(Arrays.toString(arr_x));\n System.out.println(Arrays.toString(miss_index));\n\n double ansy, ansx, a, b, x0, x1, y0, y1;\n int temp, q1, q2, qq1, qq2;\n\n for (i = 0; i < 20; i++) {\n if (miss_index[i] < arr_x[0]) {\n System.out.println(i+\" miss_index[i]: \"+miss_index[i]+\" arr_x[0]: \"+arr_x[0]);\n x0 = arr_x[0];\n x1 = arr_x[1];\n y0 = arr[0];\n y1 = arr[1];\n\n } else if (miss_index[i] > arr_x[n - 21]) {\n x0 = arr_x[n - 21];\n x1 = arr_x[n - 22];\n y0 = arr[n - 21];\n y1 = arr[n - 22];\n\n\n } else {\n temp = 0;\n while (miss_index[i] > arr_x[temp]) {\n temp++;\n }\n x0 = arr_x[temp - 1];\n x1 = arr_x[temp];\n y0 = arr[temp - 1];\n y1 = arr[temp];\n\n }\n a = (y1 - y0) / (x1 - x0);\n b = y0 - a * x0;\n ansx = miss_index[i];\n ansy = a * ansx + b;\n System.out.println(df.format(ansy));\n }\n\n }","private int[] vtinit(ProblemData a) {\r\n\r\n\r\n int[] vector = new int[a.getProcesses().length];\r\n for (int i = 0; i < a.getProcesses().length; i++) {\r\n vector[i] = a.getProcesses()[i].getWeight();\r\n }\r\n return vector;\r\n\r\n }","private void createCase(int growFactor, Result[] myResults, int index) {\n\t\tint[] myArray1 = createArray(growFactor, growFactor-1);\n\t\tmyResults[index] = new Result(growFactor, linealSearch(myArray1, growFactor-1), binarySearch(myArray1, growFactor-1));\n\t}","public static void main(String[] args) throws IOException {\n BufferedReader f = new BufferedReader(new FileReader(\"gymnastics.in\"));\n PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter(\"gymnastics.out\")));\n\n //reads in and initializes n and k values\n StringTokenizer st = new StringTokenizer(f.readLine());\n int k = Integer.parseInt(st.nextToken());\n int n = Integer.parseInt(st.nextToken());\n //total number of possible pairs (nC2)\n int numberPairs = (factorial(n).divide(factorial(n-2).multiply(BigInteger.valueOf(2)))).intValue();\n // (2 * factorial(n-2)));\n //array of ordered arrays containing data from one cow practice session\n int[][] trials = new int[k][n];\n //array of arrays containing each pair (2 elements each)\n int[][] pairs = new int[numberPairs][2];\n\n //initializes trials array\n for(int i = 0; i < k; i++){\n st = new StringTokenizer(f.readLine());\n for(int a = 0; a < n; a++) {\n trials[i][a] = Integer.parseInt(st.nextToken());\n }\n }\n\n //initializes pairs array\n int index = 0;\n for (int i = 0; i < n; i++) {\n for (int l = i + 1; l < n; l++) {\n int[] pair = {trials[0][i], trials[0][l]};\n pairs[index] = pair;\n index = index + 1;\n }\n }\n System.out.println();\n //test function, subtracts 1 from total number of pairs each time a pair is found to be inconsistent\n for (int i = 0; i < pairs.length; i++) {\n index = 0;\n String[] checkArray = new String[k];\n for (int a = 0; a < trials.length; a++) {\n checkArray[index] = check(pairs[i][0], pairs[i][1], trials[a]);\n index = index + 1;\n }\n\n if (checkArray[0] == \"less\") {\n if (contains(checkArray, \"more\")) {\n numberPairs = numberPairs - 1;\n }\n }\n\n if (checkArray[0] == \"more\") {\n if (contains(checkArray, \"less\")) {\n numberPairs = numberPairs - 1;\n }\n }\n }\n\n out.print(numberPairs);\n out.close();\n }","static int hireAssistant(int tab[]) {\n int best = 0;\n for(int i = 0; i<tab.length; i++) {\n if(tab[i] > best)\n best = tab[i];\n }\n return best;\n }","public int _maxProfitAssignmentBest(int[] difficulty, int[] profit, int[] worker) {\n // value index reverse array\n int [] dp = new int [100001];\n\n // nice strategy to use in multi-array approach\n // using difficulty as index, profit as value.\n // (difficulty array sorted by default, effort saved)\n for (int idx = 0; idx < difficulty.length; idx ++) {\n // overwrite profit values and keep the max one. (in case of conflict)\n dp [difficulty [idx]] = Math.max (dp [difficulty [idx]], profit [idx]);\n }\n\n // maximize profits stored linearly\n for (int idx = 1; idx < dp.length; idx ++)\n dp [idx] = Math.max (dp [idx - 1], dp [idx]);\n\n // build ans\n int ans = 0;\n for (int w : worker)\n ans += dp [w];\n\n return ans;\n }","public static void main(String[] args) {\n\t\tRegularTicket[] arr = new RegularTicket[15];\n\t\t// Populates array with tickets in corresponding indices. \n\t\tcreateArray(arr);\n\t\t// Prints each ticket String representation and total profit from all tickets.\n\t\tprint(arr);\n\t}","public static void main(String[] args) {\n\t\tint[] marks = {10,20,30,60,40,50,70}; // element = 7\n\t\tint[] marks2 = new int[10]; \n\t\tmarks2[0] = 10;\n\t\tmarks2[1] = 10;\n\t\tmarks2[2] = 10;\n\t\tmarks2[3] = 10;\n\t\tmarks2[4] = 10;\n\t\tmarks2[5] = 10;\n\t\tmarks2[6] = 10;\n\t\tmarks2[7] = 10;\n\t\tmarks2[8] = 10;\n\t\tmarks2[9] = 10;\n\t\t\n\t\t// array works on index concept.\n\t\t// 7 - length of this array\n\t\t// highest index - 6\n\t\t// System.out.println(marks.length); // size = 7\n\t\t\n//\t\tfor(int i = 0; i < marks2.length; i++) {\n//\t\t\tSystem.out.println(marks2[i]);\n//\t\t}\n\t\t\n\t\tfor(int i = (marks.length-1) ; i >= 0 ;i--) {\n\t\t\tSystem.out.println(marks[i]);\n\t\t}\n\t\t\n\t\t// advantages\n\t\t// keep the collection\n\t\t// fastest available collection in any object oriented language\n\t\t// when we create array - we have to give size of that array \n\t\t// 10 of int(4) = 10*4 = 40 byte (JVM )\n\t\t\n\t\t// disavantage \n\t\t// array - we cannot chnage the size \n\t\t\n\t\t\n\t\t// multidimentional - 1D array\n\t\t// 2D array - 2 dimentions\n\t\tint[][] matrix = {{10,20},{20,30}}; // directly values \n\t\t\n\t\tint[][] matrix2 = new int[2][2]; // directly values\n\t\tmatrix2[0][0] = 10;\n\t\tmatrix2[0][1] = 20;\n\t\tmatrix2[1][0] = 20;\n\t\tmatrix2[1][1] = 30;\n\t\t\n\t\tint[][] matrix1 = new int[2][6]; // size\n\t\t// student 1 marks\n\t\tmatrix1[0][0] = 10;\n\t\tmatrix1[0][1] = 20;\n\t\tmatrix1[0][2] = 20;\n\t\tmatrix1[0][3] = 20;\n\t\tmatrix1[0][4] = 20;\n\t\tmatrix1[0][5] = 20;\n\t\t// student 2 marks\n\t\tmatrix1[1][0] = 10;\n\t\tmatrix1[1][1] = 20;\n\t\tmatrix1[1][2] = 20;\n\t\tmatrix1[1][3] = 20;\n\t\tmatrix1[1][4] = 20;\n\t\tmatrix1[1][5] = 20;\n\t\t\n\t\t\n\t\t\n\t}","@Test\n @Order(1)\n void algorithms() {\n \n Combination initialComb = new Combination();\n for (int i = 0; i < assignementProblem.getAssignmentData().getLength(); i++) {\n initialComb.add((long) i + 1);\n }\n assignementProblem.setInCombination(initialComb);\n executeAlgo(SearchTestUtil.ALGO.TABU);\n executeAlgo(SearchTestUtil.ALGO.RECUIT);\n }","short[][] productionTable();","static double reliability(vmnode vm, jobnode[] jobs, int[] assigned, int ind) {\n double pow, bw, mem;\n pow = bw = mem = 0;\n\n for (int i = 0; i < jobs.length; i++) {\n if (assigned[i] == ind) {\n pow = pow + 1.0 * jobs[i].pow;\n bw = bw + 1.0 * jobs[i].bw;\n }\n }\n pow = 0.5 * (vm.powavail * 1.0 / pow);\n bw = 0.3 * (vm.bwavail * 1.0 / bw);\n mem = 0.2 * (vm.memavail + vm.memused) / vm.memused;\n if (vm.memused == 0.0) {\n return 1000000.0;\n }\n return (pow + bw + mem);\n }","public static double ludcmp(double a[][], int indx[])\n\t\t\t{\n\tint n = a.length;\n\tint i = 0, imax = 0, j = 0, k = 0;\n\tdouble big, dum, sum, temp;\n\tdouble d = 1.0;\n\tdouble vv[] = new double[n];\n\tfor (i = 0; i < n; i++) {\n big = 0.0;\n for (j = 0; j < n; j++)\n if ((temp = Math.abs(a[i][j])) > big)\n\t\tbig = temp;\n\n\tif (big == 0.0) {\n try {\n // no non-zero largest element\n\n throw new NRException(\"Error: Singular linearized system. Computation cannot proceed.\");\n } catch (NRException ex) {\n ex.printStackTrace();\n }\n\n\t}\n\tvv[i] = 1.0 / big;\n }\n\n for (j = 0; j < n; j++) {\n\tfor (i = 0; i < j; i++) {\n sum = a[i][j];\n for (k = 0; k < i; k++)\n sum -= (a[i][k] * a[k][j]);\n a[i][j] = sum;\n\t}\n\tbig = 0.0;\n\tfor (i = j; i < n; i++) {\n sum = a[i][j];\n for (k = 0; k < j; k++)\n sum -= (a[i][k] * a[k][j]);\n a[i][j] = sum;\n\t\n if ((dum = vv[i] * Math.abs(sum)) >= big) {\n\t\tbig = dum;\n\t\timax = i;\n\t\t}\n\t}\n\tif (j != imax) {\n\t\tfor (k = 0; k < n; k++) {\n\t\tdum = a[imax][k];\n\t\ta[imax][k] = a[j][k];\n\t\ta[j][k] = dum;\n }\n d = -d;\n vv[imax] = vv[j];\n }\n\tindx[j] = imax;\n\t// replace zero values with a nigh zero value so that\n\t// we don't get any divisions by zero.\n if (a[j][j] == 0.0)\n\t a[j][j] = TINY;\n\n\tif (j != n-1) {\n\tdum = 1.0 / (a[j][j]);\n\tfor (i = j + 1; i < n; i++)\n\t a[i][j] *= dum;\n\t}\n }\n\treturn d;\n\t}","private void EvalFitness(){\r\n _FitVal=0;\r\n for(int i=0; i<7;i++)\r\n for(int j=i+1;j<8;j++){\r\n if( _Data[i]==_Data[j]) _FitVal++;\r\n if(j-i==Math.abs(_Data[i]-_Data[j])) _FitVal++;\r\n }\r\n }","public void doPartition() {\n int sum = 0;\n for (int q = 0; q < w.queryCount; q++) {\n for (int a = 0; a < w.attributeCount; a++) {\n sum += w.usageMatrix[q][a];\n }\n }\n\n if (sum == w.queryCount * w.attributeCount) {\n partitioning = new int[w.attributeCount];\n return;\n }\n\n\t\t//ArrayUtils.printArray(usageMatrix, \"Usage Matrix\", \"Query\", null);\n\t\t\n\t\t// generate candidate partitions (all possible primary partitions)\n\t\tint[][] candidatePartitions = generateCandidates(w.usageMatrix);\n\t\t//ArrayUtils.printArray(candidatePartitions, \"Number of primary partitions:\"+candidatePartitions.length, \"Partition \", null);\n\t\t\n\t\t// generate the affinity matrix and METIS input file \n\t\tint[][] matrix = affinityMatrix(candidatePartitions, w.usageMatrix);\n\t\t//ArrayUtils.printArray(matrix, \"Partition Affinity Matrix Size: \"+matrix.length, null, null);\n\t\twriteGraphFile(graphFileName, matrix);\n\t\t\n\t\t// run METIS using the graph file\n\t\ttry {\n\t\t\tProcess p = Runtime.getRuntime().exec(metisLocation+\" \"+graphFileName+\" \"+K);\n\t\t\tp.waitFor();\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(1);\n\t\t} catch (InterruptedException e) {\n\t\t\te.printStackTrace();\n\t\t} \n\t\t\n\t\t// read primary partition groups created by METIS \n\t\tint[][][] primaryPartitionGroups = readPartitionFile(candidatePartitions); // TODO exception here for too few groups or attributes...\n\t\t//for(int[][] primaryPartitionGroup: primaryPartitionGroups)\n\t\t//\tArrayUtils.printArray(primaryPartitionGroup, \"Partition Group\", \"Partition\", null);\n\t\t\n\t\t\n\t\t//int i=0;\n\t\tList<int[][]> bestLayouts = new ArrayList<int[][]>();\n\t\tfor(int[][] primaryPartitionGroup: primaryPartitionGroups){\n\t\t\tminCost = Double.MAX_VALUE;\n\t\t\t\n\t\t\t// Candidate Merging\n\t\t\t//System.out.println(\"Primary Partition Group:\"+(i+1));\n\t\t\tList<BigInteger> mergedCandidatePartitions = mergeCandidates(primaryPartitionGroup);\n\t\t\t//System.out.println(\"Number of merged partitions:\"+mergedCandidatePartitions.size());\n\t\t\t\n\t\t\t// Layout Generation\n\t\t\tgenerateLayout(mergedCandidatePartitions, primaryPartitionGroup);\n\t\t\tbestLayouts.add(bestLayout);\t\t\t\n\t\t\t//ArrayUtils.printArray(bestLayout, \"Layout:\"+(++i), null, null);\n\t\t}\n\t\t\n\t\t// Combine sub-Layouts\n\t\tList<int[][]> mergedBestLayouts = mergeAcrossLayouts(bestLayouts, bestLayouts.size());\n\t\tpartitioning = PartitioningUtils.getPartitioning(mergedBestLayouts);\n\t}","public int calculateMinimumHP(ArrayList<ArrayList<Integer>> grid) {\n\t\t\t\t int m =grid.size(), n = grid.get(0).size();\n\t\t\t\t int[][][] dp = new int[m+1][n+1][2];\n\t\t\t\t \n\t\t\t\t dp[0][0][0] = 0;\n\t\t\t\t dp[0][0][1] = 0;\n\t\t\t\t dp[0][1][0] = 1; // start with life\n\t\t\t\t dp[0][1][1] = 0; // balance life\n\t\t\t\t dp[1][0][0] = 1;\n\t\t\t\t dp[1][0][1] = 0;\n\t\t\t\t for(int i=2;i<dp[0].length;i++){\n\t\t\t\t\t dp[0][i][0] = Integer.MAX_VALUE;\n\t\t\t\t\t dp[0][i][1] = 0;\n\t\t\t\t }\n\t\t\t\t for(int i=2;i<dp.length;i++){\n\t\t\t\t\t dp[i][0][0] = Integer.MAX_VALUE;\n\t\t\t\t\t dp[i][0][1] = 0;\n\t\t\t\t }\n\t\t\t\t \n\t\t\t\t for(int i=1;i<dp.length;i++){\n\t\t\t\t\t for(int j=1;j<dp[0].length;j++){\n\t\t\t\t\t\t \n\t\t\t\t\t\t if(grid.get(i-1).get(j-1) < 0){\n\t\t\t\t\t\t\t int[] fromCell = dp[i-1][j][0]< dp[i][j-1][0]?dp[i-1][j]:dp[i][j-1];\n\t\t\t\t\t\t\t \n\t\t\t\t\t\t\t dp[i][j][0] = fromCell[0] - grid.get(i-1).get(j-1) - fromCell[1];\n\t\t\t\t\t\t\t dp[i][j][1] = fromCell[1]+ grid.get(i-1).get(j-1)>0?fromCell[1]+ grid.get(i-1).get(j-1):0;\n\t\t\t\t\t\t }else{\n\t\t\t\t\t\t\t int[] fromCell = dp[i-1][j][0]< dp[i][j-1][0]?dp[i-1][j]:dp[i][j-1];\n\t\t\t\t\t\t\t dp[i][j][0] = fromCell[0];\n\t\t\t\t\t\t\t dp[i][j][1] = fromCell[1]+grid.get(i-1).get(j-1);\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\t return dp[m][n][0];\n\t\t\t\t \n\t\t\t }","private static void setTooNear(int[][] mainArray, int firstTask, int secondTask, ArrayList<String> tooNearArray, int[] forcedList) {\r\n\t\t\r\n\t for (int count = 0 ; count < 8; count++) {\r\n\t \t\tif(forcedList[count] == firstTask) {\r\n\t \t\t\tif (count == 7) { //if machine 8, forbidden next is machine 1.\r\n\t \t\t\t\tif (isForced(count,firstTask,forcedList)) {\r\n\t \t\t\t\t\tif (isForced(count+1, secondTask, forcedList)) {\r\n\t \t\t\t\t\t\tOutputWriter.writeFile(forcedList, 0, \"No valid solution possible!\");\r\n\t \t\t\t\t\t\tSystem.exit(0);\r\n\t \t\t\t\t\t}\r\n\t \t\t\t\t\telse {\tmainArray[0][secondTask] = -1;\r\n\t \t\t\t\t\t}\r\n\t \t\t\t\t}\r\n\t \t\t\t}else {\r\n\t \t\t\t\tif (isForced(count,firstTask, forcedList)) {\r\n\t \t\t\t\t\tif (isForced(count+1, secondTask, forcedList)) {\r\n\t \t\t\t\t\t\tOutputWriter.writeFile(forcedList, 0, \"No valid solution possible!\");\r\n\t \t\t\t\t\t\tSystem.exit(0);\r\n\t \t\t\t\t\t}\r\n\t \t\t\t\t\telse {\tmainArray[count+1][secondTask] = -1;\r\n\t \t\t\t\t\t}\r\n\t \t\t\t\t}\t\t\r\n\t \t\t\t}\r\n\r\n\t \t\t}\r\n\t }\r\n\t}","private int find_bestSplit(KnowledgeBase kb, int attIndex, ArrayList<ArrayList<ArrayList<Integer>>> multiple_counters) {\r\n\t\tif(multiple_counters.size() >0){\r\n\t\t\tfloat best_Gini = calculImpurity2D(kb.getSamples().size(),multiple_counters.get(0));; // it's a minimum!!\r\n\t\t\tint index_Best_Gini =0;\r\n\t\t\tfloat tmp_gini;\r\n\t\t\tfor(int i=1;i<multiple_counters.size();i++){\r\n\t\t\t\ttmp_gini = calculImpurity2D(kb.getSamples().size(),multiple_counters.get(i));\r\n\t\t\t\tif(tmp_gini<best_Gini){\r\n\t\t\t\t\tbest_Gini = tmp_gini;\r\n\t\t\t\t\tindex_Best_Gini = i;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\treturn index_Best_Gini;\r\n\t\t}\r\n\t\treturn 0;\r\n\t\t\r\n\t\t\r\n\t}","private void coins_a2W(){\n\t\tthis.cube[4] = this.cube[17]; \n\t\tthis.cube[17] = this.cube[20];\n\t\tthis.cube[20] = this.cube[36];\n\t\tthis.cube[36] = this.cube[33];\n\t\tthis.cube[33] = this.cube[4];\n\t}","private void setupStuff() {\n\t\tm_seenNumbers = new double[featureArray.length][];\n\t\tm_Weights = new double[featureArray.length][];\n\t\tm_NumValues = new int[featureArray.length];\n\t\tm_SumOfWeights = new double[featureArray.length];\n\t\tfeatureTotals = new int[featureArray.length];\n\n\t\tfor (int i = 0; i < featureArray.length; i++) {\n\t\t\tm_NumValues[i] = 0;\n\t\t\tm_seenNumbers[i] = new double[100];\n\t\t\tm_Weights[i] = new double[100];\n\t\t}\n\n\t\t/*\n\t\t * initialize structures for probabilities of each class and of each\n\t\t * feature\n\t\t */\n\t\tclassCounts = new double[MLearner.NUMBER_CLASSES];\n\t\tprobs = new HashMap[MLearner.NUMBER_CLASSES][featureArray.length];\n\t\tRealprobs = new HashMap[MLearner.NUMBER_CLASSES][featureArray.length];\n\t\tfor (int i = 0; i < MLearner.NUMBER_CLASSES; i++) {\n\t\t\tfor (int j = 0; j < featureArray.length; j++) {\n\t\t\t\tif (featureArray[j]) {//only create if we are using that\n\t\t\t\t\t// feature\n\t\t\t\t\tprobs[i][j] = new HashMap();\n\t\t\t\t\tif (EmailInternalConfigurationWindow.isFeatureDiscrete(j)) {\n\t\t\t\t\t\tprobs[i][j].put(\"_default\", new Double(0));\n\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t}\n\t\t\tclassCounts[i] = 0;\n\t\t}\n\n\t}","public static int ruolette(ArrayList<Integer> fitvalores, ArrayList<int[]> poblacion, int semilla){ \n int totalfitnes = 0;\n int totalfitnesnuevo = 0;\n int indtablero = 0;\n int semi=semilla;\n int tpoblacion=poblacion.size();\n int []nuevofitness = new int [fitvalores.size()];\n double []nproporcion = new double [fitvalores.size()];\n ArrayList <Double> proporcion = new ArrayList<>();//proporcion j la ruleta\n ArrayList <Double> ruleta = new ArrayList<>();\n //obtener el max fitnes\n for(int i=0;i<fitvalores.size();i++){ //total de fitnes\n totalfitnes=totalfitnes+fitvalores.get(i);\n }\n \n for(int i=0;i<fitvalores.size();i++){ //poner datos en el nuevo fittnes inverso\n double pro=(tpoblacion*tpoblacion-tpoblacion)-fitvalores.get(i);\n nuevofitness[i]= (int) pro;\n // System.out.println(\"nuevo fitnes\"+nuevofitness[i]);\n } \n for(int i=0;i<fitvalores.size();i++){ //total de fitnes nuevo o inverso\n totalfitnesnuevo=(totalfitnesnuevo+nuevofitness[i]);//para que los mejores casos usen mas espacio\n }\n \n for(int i=0;i<fitvalores.size();i++){ //poner datos en el array proporcion\n double var1=nuevofitness[i];\n double var2=totalfitnesnuevo;\n double pro=var1/var2;\n nproporcion[i]=pro;\n //System.out.println(\"nueva proporcion \"+nproporcion[i]);\n } \n ruleta.add(nproporcion[0]);\n // System.out.println(\"primera propporniaso \"+nproporcion[0]);\n for(int i=1;i<fitvalores.size();i++){ //poner datos en la ruleta\n double var1=ruleta.get(i-1);\n double var2=nproporcion[i];\n ruleta.add(var1+var2);\n //System.out.println(\"ruleta \"+ruleta.get(i));\n }\n double num=randomadec(0,1,semi);\n // System.out.println(\"numero random dec \"+num); \n for(int i=0;i<fitvalores.size();i++){ //poner datos en el array proporcion\n // System.out.println(ruleta.get(i));\n if(num<ruleta.get(i)){\n indtablero=i;\n //System.out.println(\"se guardo el tablero \"+indtablero);\n break;\n }\n }\n return indtablero;//esto devuelve el indice del tablero ganador en la ruleta\n }","public static void main(String[] args) {\n\t\t// TODO Auto-generated method stub\n\n\t\tint a[] = {2,1,3,-4,-2};\n\t\t//int a[] = {1 ,2, 3, 7, 5};\n\t\tboolean found = false;\n\t\t\n\t\t//this will solve in o n^2\n\t\tfor(int i = 0 ; i < a.length ; i++){\n\t\t\tint sum = 0;\n\t\t\tfor(int j = i ; j< a.length ; j++){\n\t\t\t\tsum += a[j] ;\n\t\t\t\tif(sum == 0){\n\t\t\t\t\tfound = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\tif(found)\n\t\t\t\tbreak;\n\t\t}\n\t\t\n\t\t\n\t\t// link : https://www.youtube.com/watch?v=PSpuM9cimxA&list=PLKKfKV1b9e8ps6dD3QA5KFfHdiWj9cB1s&index=49\n\t\tSystem.out.println(found + \" found\");\n\t\tfound = false;\n\t\t//solving with O of N with the help sets\n\t\t// x + 0 = y\n\t\tSet<Integer> set = new HashSet<>();\n\t\tint sum = 0;\n\t\tfor(int element : a){\n\t\t\tset.add(sum);\n\t\t\tsum += element;\n\t\t\tif(set.contains(sum)){\n\t\t\t\tfound = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println();\n\t\tSystem.out.println(set);\n\t\t\n\t\tSystem.out.println(found + \" found\");\n\t\t\n\t\t\n\t\tfound = false;\n\t\t// when the sum of subarray is K\n\t\t\n\t\t//solving with O of N with the help sets\n\t\t//x + k = y >>>\n\t\tSet<Integer> set1 = new HashSet<>();\n\t\tint k = 12;\n\t\tint summ = 0;\n\t\tfor(int element : a){\n\t\t\tset1.add(summ);\n\t\t\tsumm += element;\n\t\t\tif(set1.contains(summ - k)){ // y - k = x(alredy presnt or not)\n\t\t\t\tfound = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(set1);\n\t\tSystem.out.println();\n\t\tSystem.out.println(found + \" found\");\n\t\t\n\t\t\n\t}","public static void main(String[] args) throws Exception {\r\n Scanner input = new Scanner(System.in);\r\n int n;\r\n // System.out.println(\"Enter the number of element\");\r\n n = input.nextInt();\r\n // System.out.println(\"here is n\"+n);\r\n int arr[] = new int[n];\r\n // System.out.println(\"Enter the element of the array\");\r\n for (int i = 0; i < n; i++) {\r\n arr[i] = input.nextInt();\r\n }\r\n int sol_arr_1[][] = new int[n][n], sol_arr_2[][] = new int[n][n];\r\n \r\n //*****intialization*****//\r\n for(int i=0;i<n;i++)\r\n {\r\n for(int j=0;j<n;j++)\r\n {\r\n sol_arr_1[i][j]=0;\r\n sol_arr_2[i][j]=0;\r\n }\r\n }\r\n //*****end*****//\r\n \r\n \r\n \r\n \r\n \r\n int k_for_j = 1;\r\n int i = 0, j = 1;\r\n for (int q = 0; q < n - 1; q++) {\r\n // System.out.println(\"q=\"+q);\r\n j = k_for_j;\r\n i=0;\r\n if (q == 0) {\r\n while (j < n) {\r\n sol_arr_1[i][j] = (arr[i] + arr[j]) % 100;\r\n sol_arr_2[i][j] = (arr[i] * arr[j]);\r\n i++;\r\n j++;\r\n }\r\n }\r\n else\r\n {\r\n while(j<n)\r\n {\r\n int color1,smog1;\r\n color1=(arr[j]+sol_arr_1[i][j-1])%100;\r\n smog1=sol_arr_2[i][j-1]+(arr[j]*sol_arr_1[i][j-1]);\r\n int color2,smog2;\r\n color2 =(sol_arr_1[i+1][j]+arr[j-2])%100;\r\n smog2=(sol_arr_1[i+1][j]*arr[j-2])+sol_arr_2[i+1][j];\r\n if(smog1>smog2)\r\n {\r\n sol_arr_1[i][j]=color2;\r\n sol_arr_2[i][j]=smog2;\r\n }\r\n else\r\n {\r\n sol_arr_1[i][j]=color1;\r\n sol_arr_2[i][j]=smog1;\r\n }\r\n i++;\r\n j++;\r\n }\r\n }\r\n k_for_j++;\r\n }\r\n System.out.println(sol_arr_2[0][n-1]);\r\n }","public void testTwoWayDistribution() {\n for(int p = 0; p < 20; p++) {\n int[] landings = new int[2];\n for(long in = 0; in < 100000; in++) {\n long longHash = FPGenerator.std64.fp(p+\"a\"+in);\n// long longHash = rand.nextLong();\n// long longHash = ArchiveUtils.doubleMurmur((p+\":\"+in).getBytes());\n landings[conhash.bucketFor(longHash, 2)]++;\n }\n// System.out.println(landings[0]+\",\"+landings[1]);\n assertTrue(\"excessive changes\",Math.abs(landings[0]-landings[1]) < 2000); \n }\n }","static long[] q3PolyMul(int maxDistanceLeft, ThreadVariables t){\n\n //precomputation is as simple as running distTo cutoff 1 with bases less than the multiplcity, and it is equivalent by wilf inversion\n\n long[] all = allWaysCache(123);\n long[] currentContains = new long[maxDistanceLeft + 1];\n System.arraycopy(all,0,currentContains,0,maxDistanceLeft + 1);\n Polynomial[] shifts = generateShiftsPolyMethod(maxDistanceLeft, t);\n //Polynomial[] correctShifts = generateShiftsHardcoded(maxDistanceLeft, t);\n //Polynomial[] shifts = correctShifts;\n for (int i = 1; i < 8; i++){\n //System.out.println(correctShifts[i]);\n System.out.println(shifts[i]);\n }\n //I think indexes could be designed so 7-index is index in other array due to symmetry of complements\n\n\n subtract(currentContains, shifts[1].productWith(allWaysCache(23), maxDistanceLeft));\n subtract(currentContains, shifts[2].productWith(allWaysCache(13), maxDistanceLeft));\n subtract(currentContains, shifts[3].productWith(allWaysCache(12), maxDistanceLeft));\n //System.out.print(\"Poly: Values after first removal: \");\n //printArray(currentContains);\n\n //it might be possible to modify these to avoid doing the last exclusion\n\n add(currentContains, shifts[4].trivialProductWith(3, maxDistanceLeft));\n add(currentContains, shifts[5].trivialProductWith(2, maxDistanceLeft));\n add(currentContains, shifts[6].trivialProductWith(1, maxDistanceLeft));\n //System.out.print(\"Poly: Values after second removal: \");\n //printArray(currentContains);\n subtract(currentContains, shifts[7].getFullArray(maxDistanceLeft));\n //System.out.println(shifts[7]);\n //System.out.print(\"Poly: final values: \");\n //printArray(currentContains);\n return currentContains;\n }","public static void main(String[] args){\n int MIN = Integer.parseInt(args[0]);\n MAX = Integer.parseInt(args[1]);\n cutoffs = new int[args.length - 2];\n cache = new ArrayList<IndexedArrayList<SuperSavvyTrieHelper2>>();\n for (int i = 2; i < args.length; i++){\n cutoffs[i - 2] = Integer.parseInt(args[i]);\n cache.add(new IndexedArrayList<SuperSavvyTrieHelper2>());\n }\n for (int i = 0; i < cutoffs.length / 2; i++){\n int temp = cutoffs[i];\n cutoffs[i] = cutoffs[cutoffs.length - 1 - i];\n cutoffs[cutoffs.length - 1 - i] = temp;\n }\n multiplicitiesUsed = new boolean[MAX + 1];\n basesUsed = new DoublyLinkedArray(MAX + 1);\n SuperSavvyTrieHelper2.setCorrespondance(basesUsed);\n /*\n long count1 = lowerRecursion(MAX, 0);\n long count2 = middleRecursion(MAX, 0);\n long count3 = upperRecursion(MAX, 0);\n long total = count1 + count2 + count3;\n System.out.printf(\"%d + %d + %d = %d\\n\", count1, count2, count3, total);\n */\n hitCounts = new long[cutoffs.length];\n missCounts = new long[cutoffs.length];\n statCollector = new StatCollector(cutoffs);\n\n long startTime = System.nanoTime();\n long[] values = new long[MAX - MIN + 1];\n for (int i = MIN; i <= MAX; i++) {\n values[i - MIN] = upperRecursionWrapper(i);\n }\n //long[] testValues = new long[] {1752443,1911046, 2067456,2249444,2429337, 2647532,2852449,3101167,3350292,3632299,3916575};\n for (int i = 0; i < values.length; i++){\n //if (testValues[i] != values[i]){\n System.out.printf(\"%d: %d\\n\", i + MIN, values[i]);\n //}\n }\n long endTime = System.nanoTime();\n System.out.printf(\"%f,\", (double)(endTime - startTime) / 1000000000.0);\n long totalMissCounts = 0;\n long totalMissWeight1 = 0;\n long totalMissWeight2 = 0;\n long totalMissWeight3 = 0;\n /*\n for (int i = 0; i < cutoffs.length; i++){\n long totalCounts = hitCounts[i] + missCounts[i];\n totalMissCounts += missCounts[i];\n totalMissWeight1 += missCounts[i] * cutoffs[i];\n totalMissWeight2 += (hitCounts[i] / missCounts[i]) * cutoffs[i];\n totalMissWeight3 += (hitCounts[i] - missCounts[i]) * cutoffs[i] * cutoffs[i];\n System.out.printf(\"\\tCache %d: %d/%d/%d (%.5f%%)\", cutoffs[i], hitCounts[i], missCounts[i], totalCounts, (double) hitCounts[i] / totalCounts);\n }\n System.out.printf(\"\\t\\tMissCounts: %d, weighted: %d, ratio: %d, diff^2: %d\\n\", totalMissCounts, totalMissWeight1, totalMissWeight2, totalMissWeight3);\n */\n statCollector.printAll();\n }","public static void main(String[] args) throws IOException {\n int max = 100000;\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\n\n N = Integer.parseInt(br.readLine());\n\n int arr[] = new int[max+1];\n\n for (int p=2; p<=99999; p++)\n {\n if (arr[p] == 0)\n { arr[p] = 1;\n for (int i=p*2; i<=max; i += p) {\n arr[i]++;\n }\n }\n }\n\n int mat[][] = new int[6][max+1];\n// for (int i = 2; i < arr.length; i++) {\n// mat[arr[i]][i] = 1;\n// }\n\n for (int i = 1; i < 6; i++) {\n for (int j = 2; j < mat[0].length; j++) {\n if(arr[j] == i) {\n mat[i][j] = mat[i][j - 1]+1;\n } else {\n mat[i][j] = mat[i][j - 1];\n }\n }\n }\n\n\n for (int i = 0; i < N; i++) {\n String str[] = br.readLine().split(\" \");\n int a = Integer.parseInt(str[0]);\n int b = Integer.parseInt(str[1]);\n int k = Integer.parseInt(str[2]);\n int ans = mat[k][b]-mat[k][a-1];\n System.out.println(ans);\n }\n }","private static Population getBestPossibleParettoOfAGS(){\n int numberOfRounds = 10;\n Population allFrontsMembers = new Population();\n\n NSGAII nsgaii = new NSGAII();\n SPEA2 spea2 = new SPEA2();\n AEMMT aemmt = new AEMMT();\n AEMMD aemmd = new AEMMD();\n MOEAD moead = new MOEAD();\n\n ProblemKnapsackFromFile problem = new ProblemKnapsackFromFile(macPathGetProblemFrom);\n progressBar = new ProgressBar((double) numberOfRounds);\n\n for (int i = 0; i < numberOfRounds; i++) {\n\n Parameters.NUMBER_OF_GENERATIONS = problem.items.size() < 100? 100 : 200;\n\n System.out.println(\"NSGAII\");\n nsgaii.runAlgorithm(problem);\n allFrontsMembers.population.addAll(nsgaii.paretto.membersAtThisFront);\n\n System.out.println(\"SPEA2\");\n spea2.runAlgorithm(problem);\n allFrontsMembers.population.addAll(spea2.paretto.membersAtThisFront);\n\n //moead.runAlgorithm(problem);\n //allFrontsMembers.population.addAll( moead.pareto.membersAtThisFront);\n\n Parameters.NUMBER_OF_GENERATIONS = 15000;\n System.out.println(\"AEMMT\");\n aemmt.runAlgorithm(problem);\n allFrontsMembers.population.addAll(aemmt.paretto.membersAtThisFront);\n\n System.out.println(\"AEMMD\");\n aemmd.runAlgorithm(problem);\n allFrontsMembers.population.addAll(aemmd.paretto.membersAtThisFront);\n\n progressBar.addJobDone();\n\n allFrontsMembers.fastNonDominatedSort();\n Problem.removeSimilar(allFrontsMembers.fronts.allFronts.get(0),problem);\n allFrontsMembers.population = allFrontsMembers.fronts.allFronts.get(0).membersAtThisFront;\n }\n\n problem.printResolutionMessage();\n //Printer.printBinaryMembers(allFrontsMembers);\n System.out.println(\"ALL FRONTS SIZE: \"+allFrontsMembers.population.size());\n\n return allFrontsMembers;\n }","public static void ComputeTables() {\n int[][] nbl2bit\n = {\n new int[]{1, 0, 0, 0}, new int[]{1, 0, 0, 1}, new int[]{1, 0, 1, 0}, new int[]{1, 0, 1, 1},\n new int[]{1, 1, 0, 0}, new int[]{1, 1, 0, 1}, new int[]{1, 1, 1, 0}, new int[]{1, 1, 1, 1},\n new int[]{-1, 0, 0, 0}, new int[]{-1, 0, 0, 1}, new int[]{-1, 0, 1, 0}, new int[]{-1, 0, 1, 1},\n new int[]{-1, 1, 0, 0}, new int[]{-1, 1, 0, 1}, new int[]{-1, 1, 1, 0}, new int[]{-1, 1, 1, 1}\n };\n\n int step, nib;\n\n /* loop over all possible steps */\n for (step = 0; step <= 48; step++) {\n /* compute the step value */\n int stepval = (int) (Math.floor(16.0 * Math.pow(11.0 / 10.0, (double) step)));\n\n\n /* loop over all nibbles and compute the difference */\n for (nib = 0; nib < 16; nib++) {\n diff_lookup[step * 16 + nib] = nbl2bit[nib][0]\n * (stepval * nbl2bit[nib][1]\n + stepval / 2 * nbl2bit[nib][2]\n + stepval / 4 * nbl2bit[nib][3]\n + stepval / 8);\n }\n }\n }","public void readSet() throws IOException {\n temps = new HashSet<String>();\n readDescription();\n // adds the words in the temporary set to the temp array\n for (String w : temps) {\n if (w.equals(\"dana\")) {\n System.out.println(w + \" was called +1\");\n }\n int v = d.getValue(w);\n arr[v]++;\n if (w.equals(\"subj\")) {\n System.out.println(w + \" was called +1\");\n System.out.println(arr[v] + \" is the number of the array of \" + w);\n }\n }\n temps = new HashSet<String>();\n readDescription();\n // does the same thing above, except since this is the second\n // description, subtract 1 from array\n for (String w : temps) {\n int v = d.getValue(w);\n arr[v]--;\n if (w.equals(\"subj\")) {\n System.out.println(w + \" was called -1\");\n System.out.println(arr[v] + \" is the number of the array of \" + w);\n }\n }\n // get the prices\n int p1 = getPrice();\n int p2 = getPrice();\n // get the answer value\n // a should be the correct answer\n // b should be the answer they choose\n int a = getAnswer();\n int b = getAnswer();\n // System.out.println(\"The correct answer is: \" + a +\n // \" The chosen answer is: \" + b);\n int y_real;\n DecimalFormat numberFormat = new DecimalFormat(\"#.####\");\n double real_ratio;\n double mturk_ratio;\n if (p1 > p2) {\n y_real = p1 - p2;\n real_ratio = (double) p1 / p2;\n } else {\n y_real = p2 - p1;\n real_ratio = (double) p2 / p1;\n }\n int pdiff;\n if (a == b) {\n pdiff = y_real;\n mturk_ratio = real_ratio;\n } else {\n pdiff = -y_real;\n mturk_ratio = 1 / real_ratio;\n }\n if (p2 > p1) {\n for (int i = 0; i < arr.length; i++) {\n arr[i] = -arr[i];\n }\n }\n w.write(pdiff + \" \");\n w.write(numberFormat.format(real_ratio) + \" \");\n w.write(numberFormat.format(mturk_ratio) + \" \");\n for (int i = 0; i < size; i++) {\n if (i != arr.length - 1) {\n w.write(arr[i] + \" \");\n } else {\n w.write(arr[i]);\n }\n }\n w.write(\"\\n\");\n arr = new int[size];\n }","public static void main(String[] args) {\n int[] array1 = {50, 39, 21, 88, 17};\n int max = 0;\n for (int value : array1) {\n if (value > max)\n max = value;\n }\n System.out.print(\"Maximum value in the array is \" + max);\n System.out.println();\n\n // Separate zeros from non-zeros in an array\n int[] array2 = {50, 0, 39, 21, 0, 0, 88, 17};\n int index = 0;\n for (int i=0; i<array2.length; i++) {\n if (array2[i] != 0){\n array2[index] = array2[i];\n index++;\n }\n }\n while ( index < array2.length ) {\n array2[index] = 0;\n index++;\n }\n System.out.println( Arrays.toString(array2) );\n\n // Find intersection of two arrays in java\n int[] x = {50, 39, 21, 88, 17};\n int[] y = {21, 13, 63, 17, 46};\n\n HashSet<Integer> xSet = new HashSet<>();\n for (int value : x) xSet.add(value);\n\n System.out.print(\"Intersection of two arrays: \");\n for (int value : y) {\n if (xSet.contains(value))\n System.out.print(value + \" \");\n }\n System.out.println();\n\n // Find continuous sub array whose sum is equal to given number\n int[] array3 = {42, 15, 12, 8, 6, 32};\n int given = 26;\n int sum;\n\n System.out.print(\"Continuous sub array whose sum is \" + given + \": \");\n for ( int i = 0; i<array3.length; i++ ) {\n sum = array3[i];\n for (int j = i+1; j < array3.length; j++) {\n sum = sum + array3[j];\n if (sum == given){\n for (int k = i; k <= j; k++)\n System.out.print(array3[k]+\" \");\n System.out.println();\n }\n else if (sum > given)\n break;\n }\n }\n\n }","static long arrayManipulation(int n, int[][] queries) {\r\n long result = 0, sum = 0;\r\n long[] arr = new long[n];\r\n for(int i = 0; i < queries.length; i++){\r\n int firstIndex = queries[i][0] - 1;\r\n int lastIndex = queries[i][1] - 1;\r\n long numberToAdd = queries[i][2];\r\n arr[firstIndex] += numberToAdd;\r\n if (lastIndex+1 < n)\r\n arr[lastIndex+1] -= numberToAdd;\r\n }\r\n\r\n for(long l : arr){\r\n sum += l;\r\n if(sum > result)\r\n result = sum;\r\n }\r\n\r\n return result;\r\n }","static void hashTestCase(int givArr[]) {\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tint mod = givArr[i] % m;\n\t\t\tarray[mod] = givArr[i];\n\t\t}\n\t}","public static void main(String[] args) {\n\t\tScanner scan=new Scanner(System.in);\n\t\tint N=scan.nextInt();\n\t\tint a=scan.nextInt();\n\t\tint b=scan.nextInt();\n\t\tint[] nums=new int[N];\n\t\tint[][] weight=new int[N][N];\n\t\tfor(int i=0;i<N;i++){\n\t\t\tnums[i]=scan.nextInt();\n\t\t\tweight[i][i]=nums[i];\n\t\t}\n\t\tfor(int i=0;i<N;i++){\n\t\t\tfor(int j=i+1;j<N;j++){\n\t\t\t\tweight[i][j]=weight[i][j-1]+nums[j];\n\t\t\t}\n\t\t}\n\t\tlong[][] dp=new long[N][N];\n\t\tfor(int i=2;i<=N;i++){//dis\n\t\t\tfor(int j=0;j<=N-i;j++){//start\n\t\t\t\tint end=j+i-1;\n\t\t\t\tlong min=Integer.MAX_VALUE;\n\t\t\t\tfor(int k=j;k<end;k++){\n\t\t\t\t\tmin=Math.min(min, dp[j][k]+dp[k+1][end]+weight[j][k]*a+weight[k+1][end]*b);\n\t\t\t\t}\n\t\t\t\tdp[j][end]=min;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(dp[0][N-1]);\n\t\tscan.close();\n\t}","public static void main(String[] args) {\n\t\t\r\n\t\t\r\n\t\tArrayOfFraction arr1= new ArrayOfFraction();\r\n\t\tarr1.add(new Fraction(3,1));\r\n\t\tarr1.add(new Fraction(4,2));\r\n\t\tarr1.add(new Fraction(5,3));\r\n\t\tarr1.add(new Fraction(6,7));\r\n\t\t\r\n\t\tfor(int i=0;i<arr1.size();i++)\r\n\t\t{\r\n\t\t\tSystem.out.println(arr1.a[i].divide());\r\n\t\t}\r\n//\t\tFraction fr1 = new Fraction();\r\n//\t\tfr1.input();\r\n//\t\tarr1.add(fr1);\r\n//\t\t\r\n//\t\tFraction fr2 = new Fraction();\r\n//\t\tfr2.input();\r\n//\t\tarr1.add(fr2);\r\n//\t\t\r\n//\t\tFraction fr3 = new Fraction();\r\n//\t\tfr3.input();\r\n//\t\tarr1.add(fr3);\r\n//\t\t\r\n//\t\tarr1.output();\r\n\t\t\r\n//\t\tSystem.out.println(\"get ra gia tri index: \"+arr1.get(0));\r\n\r\n//\t\tFraction fr4 = new Fraction();\r\n//\t\tfr4.input();\r\n//\t\tarr1.set(2,fr4 );\r\n//\t\tarr1.output();\r\n//\t\t\r\n//\t\t\r\n//\t\tFraction fr5 = new Fraction();\r\n//\t\tfr5.input();\r\n//\t\tarr1.add(1, fr5);\r\n//\t\tarr1.output();\r\n\t\t\r\n//\t\tarr1.remove(2);\r\n//\t\tarr1.output();\r\n\t\t\r\n//\t\tFraction fr6 = new Fraction();\r\n//\t\tfr6.input();\r\n//\t\tSystem.out.println(arr1.indexOf(fr6));\r\n\t\t\r\n//\t\tFraction fr7 = new Fraction();\r\n//\t\tfr7.input();\r\n//\t\tSystem.out.println(arr1.indexOf(r7));\r\n\t\t\r\n\t\t\r\n//\t\tSystem.out.println(arr1.toString());\r\n\t\t\r\n\t}","private void genProb() {\n\t\tint row;\n\t\tint column;\n\t\tint removed1;\n\t\tint removed2;\n\n\t\tfor (int i = 0; i < DIFFICULTY / 2;) {\n\t\t\trow = rand.nextInt(9);\n\t\t\tcolumn = rand.nextInt(9);\n\t\t\twhile (problem[row][column] == 0 || (row == 4 && column == 4)) {\n\t\t\t\trow = rand.nextInt(9);\n\t\t\t\tcolumn = rand.nextInt(9);\n\t\t\t}\n\n\t\t\t// Clearing random boxes.\n\t\t\tremoved1 = problem[row][column];\n\t\t\tremoved2 = problem[8 - row][8 - column];\n\t\t\tproblem[row][column] = 0;\n\t\t\tproblem[8 - row][8 - column] = 0;\n\n\t\t\tcopy(problem, comp);\n\n\t\t\tif (!solve(0, 0, 0, comp)) { // Case of unsolvable.\n\t\t\t\t// Putting back original values.\n\t\t\t\tproblem[row][column] = removed1;\n\t\t\t\tproblem[8 - row][8 - column] = removed2;\n\t\t\t} else {\n\t\t\t\tif (unique()) { // Case of solution is unique.\n\t\t\t\t\ti++;\n\t\t\t\t} else { // Case of solution is not unique.\n\t\t\t\t\t// Putting back original values.\n\t\t\t\t\tproblem[row][column] = removed1;\n\t\t\t\t\tproblem[8 - row][8 - column] = removed2;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}","public static void main(String[] args) {\n\t\tArrayList<Integer> primelist = sieve(7071);\n\t\tArrayList<Double> second = new ArrayList<Double>();\n\t\tfor(int one : primelist) \n\t\t\tsecond.add(Math.pow(one, 2));\n\t\tArrayList<Double> third = new ArrayList<Double>();\n\t\tprimelist = sieve(368);\n\t\tfor(int one : primelist)\n\t\t\tthird.add(Math.pow(one, 3));\n\t\tArrayList<Double> fourth = new ArrayList<Double>();\n\t\tprimelist = sieve(84);\n\t\tfor(int one : primelist)\n\t\t\tfourth.add(Math.pow(one, 4));\n\n\t\tArrayList<Double> possibilities = new ArrayList<Double>();\n\t\tfor (int k = fourth.size() - 1; k >=0 ; k--) {\n\t\t\tfor (int j = 0; j < third.size(); j++) {\n\t\t\t\tdouble sum = fourth.get(k) + third.get(j);\n\t\t\t\tif (sum > 50000000)\n\t\t\t\t\tbreak;\n\t\t\t\telse {\n\t\t\t\t\tfor (int i = 0; i < second.size(); i++) {\n\t\t\t\t\t\tdouble nextsum = sum + second.get(i);\n\t\t\t\t\t\tif (nextsum > 50000000)\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\t// I am not sure whether it can be proved that the sum is unique.\n\t\t\t\t\t\t\tif (!possibilities.contains(nextsum))\n\t\t\t\t\t\t\t\tpossibilities.add(nextsum);\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}\n\t\tint totalcount = possibilities.size();\n\t\tSystem.out.println(totalcount);\n\t}","public void calculateEffectiveness(){\n double[] typeEffective = new double[18];\n \n for(int i = 0; i < 18; i++){\n typeEffective[i] = tc.getEffectiveNumber(i, tc.convertType(type1));\n }\n \n if(type2 != null){\n for(int i = 0; i < 18; i++){\n typeEffective[i] *= tc.getEffectiveNumber(i, tc.convertType(type2));\n }\n }\n \n for(int i = 0; i < 18; i++){\n if(typeEffective[i] != 1){\n if(typeEffective[i] > 1){\n double[] newWeak = {i,typeEffective[i]};\n weak.add(newWeak);\n }else{\n double[] newStrong = {i,typeEffective[i]};\n strong.add(newStrong);\n }\n }\n }\n }","@Test\n public void testFactor_intArr_intArr() {\n System.out.println(\"factor\");\n int[] number = new int[]{0, 1, 2, 3, 4, 5, 6, 7, 8, 9};\n int[] weighting = new int[]{2, 1, 2, 1, 2, 1, 2, 1, 2};\n AbstractMethod instance = new AbstractMethodImpl();\n int[] expResult = new int[]{0, 1, 4, 3, 8, 5, 12, 7, 16, 9};\n int[] result = instance.factor(number, weighting);\n assertArrayEquals(expResult, result);\n\n }","private static void find_coins(int[] d, int k, int n) {\n\t\t\n\t}","public static void main(String[] args) \n {\n int[] array1 = new int[10]; // create the array object/declare variable array and initialize it with an array object\n System.out.printf(\"%s%8s%n\", \"Index1\", \"Value\"); // column headings\n //output each array element's value\n for (int counter = 0; counter < array1.length; counter++)\n System.out.printf(\"%5d%8d%n\", counter, array1[counter]);\n \n //fig 7.3: Initializing the elements of an array with an array initializer\n int[] array2 = { 32, 27, 64, 18, 95, 14, 90, 70, 60, 37 };// initializer list specifies the initial value for each element\n System.out.printf(\"%s%8s%n\", \"Index2\", \"Value\"); // column headings\n // output each array element's value\n for (int counter = 0; counter < array2.length; counter++)\n System.out.printf(\"%5d%8d%n\", counter, array2[counter]);\n \n //fig 7.4: Calculating the values to be placed into the elements of an array. \n final int ARRAY_LENGTH = 10;// declare constant\n int[] array3 = new int[ARRAY_LENGTH]; // create array \n // calculate value for each array element\n for (int counter = 0; counter < array3.length; counter++)\n array3[counter] = 2 + 2 * counter;\n System.out.printf(\"%s%8s%n\", \"Index3\", \"Value\"); // column headings \n // output each array element's value\n for (int counter = 0; counter < array3.length; counter++)\n System.out.printf(\"%5d%8d%n\", counter, array3[counter]);\n }"],"string":"[\n \"private void buildArray() throws VerificationException\\n {\\n \\tindices = new int[length];\\n \\tcommonality = new int[length];\\n \\n \\tcommonality[0] = -1;\\n \\tfor( int i=0; i<indices.length; i++ ){\\n \\t indices[i] = i;\\n \\t}\\n \\n sort();\\n }\",\n \"public static Object[] ticket_combo(int l, Set<Set<Object>> ticket_indices_powerset, Object[] all_number_subset_array, Object[] winning_number_subset_array) {\\n \\n Set<Object> curr_t = new HashSet<Object>(); //carries one ticket\\n Set<Object> set_to_buy = new HashSet<Object>(); //carries one winning combo\\n Set<Object> curr_win_combo = new HashSet<Object>(); //carries one ticket combo\\n \\n boolean has_winning = false;\\n int match_count = 0;\\n int ticket_amount_count = all_number_subset_array.length; //smallest amount of tickets needed so far\\n \\n // a combo to possibly buy\\n for(Set<Object> curr_indices_subset : ticket_indices_powerset) {\\n int curr_num_tickets_to_buy = curr_indices_subset.toArray().length;\\n if(ticket_amount_count <= curr_num_tickets_to_buy && has_winning)\\n {\\n continue;\\n }\\n //copy a winning array\\n Object[] winning_number_subset_array_copy = Arrays.copyOf(winning_number_subset_array, winning_number_subset_array.length);\\n //setup a counter of uncovered winning combos\\n int uncovered_winning_possibilities = winning_number_subset_array_copy.length;\\n Object[] curr_indices_subset_array = curr_indices_subset.toArray();\\n \\n //take each ticket in a combo\\n for(Object curr_index : curr_indices_subset_array) {\\n int curr_index_int = ((Integer) curr_index).intValue() - 1;\\n curr_t = (java.util.HashSet<java.lang.Object>) all_number_subset_array[curr_index_int];\\n \\n //see which winning combos you can cross out\\n for(int i = 0; i < winning_number_subset_array_copy.length; i++) {\\n match_count = 0;\\n curr_win_combo = (java.util.HashSet<java.lang.Object>) winning_number_subset_array[i];\\n if (winning_number_subset_array_copy[i] instanceof Integer)\\n {\\n continue;\\n }\\n \\n for(Object combo_num : curr_win_combo) {\\n for(Object ticket_num : curr_t) {\\n if(((Integer)combo_num).intValue() == ((Integer)ticket_num).intValue())\\n {\\n match_count++;\\n }\\n }\\n }\\n if(match_count >= l)\\n {\\n uncovered_winning_possibilities--;\\n winning_number_subset_array_copy[i] = 0;\\n }\\n }\\n }\\n //after ticket combo loop\\n if((uncovered_winning_possibilities == 0) && (!has_winning || (curr_num_tickets_to_buy < ticket_amount_count)))\\n {\\n has_winning = true;\\n ticket_amount_count = curr_num_tickets_to_buy;\\n set_to_buy = curr_indices_subset;\\n \\n }\\n }\\n Object[] final_ticket_indeces = set_to_buy.toArray();\\n return final_ticket_indeces;\\n }\",\n \"private int getIndex(int... elements) {\\n int index = 0;\\n for (int i = 0; i < elements.length; i++) index += elements[i] * Math.pow(universeSize, i);\\n return index;\\n }\",\n \"public static void main(String[] args) throws Exception {\\n Scanner sc = new Scanner(new FileReader(\\\"talent.in\\\"));// new InputStreamReader(System.in)); //\\n PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter(\\\"talent.out\\\")));\\n int N = sc.nextInt();\\n int minWeight = sc.nextInt();\\n int[] weight = new int[N];\\n int[] value = new int[N];\\n int totalTalent = 0;\\n for (int i = 0; i < N; i++) {\\n int wt = sc.nextInt();\\n int val = sc.nextInt();\\n weight[i] = wt;\\n value[i] = val;\\n totalTalent += val;\\n }\\n\\n // Store, for a given talent, what is the smallest weight used to achieve it?\\n int[] dp = new int[totalTalent + 1];\\n Arrays.fill(dp, (int) 1e9);\\n dp[0] = 0;\\n // the min weight to produce 0 talent is 0. However,\\n // it is necessary to make everything else big because we can only BUILD\\n // from 0\\n double bestRatio = 0;\\n for (int cow = 0; cow < N; cow++) {\\n // look at each cow, and go DOWN THROUGH THE dp array, updating the\\n // best weight achievable BEHIND US. This countercurrent motion ensures no repeated\\n // counting of a single cow's talents\\n int contribution = value[cow];\\n int wt = weight[cow];\\n for (int talent = totalTalent; talent >= 0; talent--) {\\n int boostedTalent = contribution + talent;\\n int boostedWeight = dp[talent] + wt;\\n // with the min weight of a certain talent,\\n // is it possible to get a smaller boostedWeight for a boostedTalent\\n if (boostedTalent <= totalTalent) {\\n // If we are in bounds,\\n if (boostedWeight < dp[boostedTalent]) {\\n // and the attempted team has a better weight value\\n // then update it!\\n // Initially, when everything is 1 billion, this cannot\\n // happen except for from the base cases, building outward\\n dp[boostedTalent] = boostedWeight;\\n\\n // At the same time, we can be more efficient by constantly\\n // checking if we had enough weight first of all, and\\n // second of all had a better talent/weight ratio!\\n double ratio = (double) boostedTalent / boostedWeight;\\n if (ratio > bestRatio && boostedWeight >= minWeight) {\\n bestRatio = ratio;\\n }\\n }\\n }\\n }\\n }\\n\\n out.println((int) (1000 * bestRatio));\\n out.close();\\n }\",\n \"public void\\tgetData() throws IOException{\\n\\t\\tint i,j, val;\\n\\t\\tint profitOfItems[], weight[];\\n\\t\\t\\n\\t\\tSystem.out.println(\\\"Enter the weight of the Knapsack ( must be positive):\\\");\\n\\t\\tknapsackWeight = KnapsackAlgorithmImplementation.getNumber();\\n\\t\\t\\n\\t\\tSystem.out.println(\\\"\\\\nEnter the number of items to put in knapsack ( must be positive):\\\");\\n\\t\\tnumberOfItems = KnapsackAlgorithmImplementation.getNumber();\\n\\t\\t\\n\\t\\tprofitOfItems = new int[numberOfItems + 1];\\n\\t\\tfor ( i = 1 ; i <= numberOfItems ; i++) {\\n\\t\\t\\tSystem.out.println(\\\"Enter profit of item \\\" + String.valueOf(i));\\n\\t\\t\\tprofitOfItems[i] = KnapsackAlgorithmImplementation.getNumber();\\n\\t\\t}\\t\\n\\t\\t\\n\\t\\tweight = new int[numberOfItems + 1];\\n\\t\\tfor ( i = 1 ; i <= numberOfItems ; i++) {\\n\\t\\t\\tSystem.out.println(\\\"Enter weight of item \\\" + String.valueOf(i));\\n\\t\\t\\tweight[i] = KnapsackAlgorithmImplementation.getNumber();\\n\\t\\t}\\t\\n\\t\\t\\n\\t\\tProfit = new int[numberOfItems + 1][knapsackWeight + 1];\\n\\t\\tDir\\t = new int[numberOfItems + 1][knapsackWeight + 1];\\n\\t\\t\\n\\t\\tfor ( j = 0 ; j <= knapsackWeight; j++) {\\n\\t\\t\\tProfit[0][j] = 0;\\t\\n\\t\\t}\\t\\n\\t\\tfor ( i = 0 ; i <= numberOfItems; i++) {\\n\\t\\t\\tProfit[i][0] = 0;\\t\\n\\t\\t}\\n\\t\\tfor ( i = 1 ; i <= numberOfItems; i++) { \\n\\t\\t\\tfor ( j = 1 ; j <= knapsackWeight; j++) {\\n\\t\\t\\t\\tif ( weight[i] > j) {\\n\\t\\t\\t\\t\\tProfit[i][j] = Profit[i-1][j];\\n\\t\\t\\t\\t\\tDir[i][j] = 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tval = profitOfItems[i] + Profit[i-1][j - weight[i]];\\n\\t\\t\\t\\t\\tProfit[i][j] = Find_Max( Profit[i-1][j] , val); \\n\\t\\t\\t\\t\\tif ( Profit[i][j] == val)\\n\\t\\t\\t\\t\\t\\tDir[i][j] = 2;\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\tDir[i][j] = 1;\\t\\n\\t\\t\\t\\t}\\t\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tSystem.out.println(\\\"Maximum profit that can fit in the knapsack is :\\\" + Profit[numberOfItems][knapsackWeight]);\\n\\t\\tPrint_KnapsackItems(Dir,weight);\\t\\t\\n\\t}\",\n \"static int dynamicProgramming(int problem) {\\r\\n\\t\\tint items = problems.get(problem).size();\\r\\n\\t\\tint cap = capacities.get(problem);\\r\\n\\r\\n\\t\\tint x = 0;\\r\\n\\t\\tfor(int i = 1; i < items + 1; i++, x++) {\\r\\n\\t\\t\\tweights[i] = problems.get(problem).get(x).weight;\\r\\n\\t\\t\\tprofits[i] = problems.get(problem).get(x).profit;\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tint[][] P = new int[items + 1][cap + 1];\\r\\n\\r\\n\\t\\tfor(int i = 0; i < items + 1; i++) {\\r\\n\\t\\t\\tfor(int j = 0; j < cap + 1; j++) {\\r\\n\\t\\t\\t\\tP[i][j] = -1;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tfor(int c = 0; c < cap + 1; c++) {\\r\\n\\t\\t\\tP[0][c] = 0;\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tfor(int i = 1; i < items + 1; i++) {\\r\\n\\t\\t\\tP[i][0] = 0;\\r\\n\\t\\t\\tfor(int c = 1; c < cap + 1; c++) {\\r\\n\\t\\t\\t\\tif(i >= 2 && c >= 2) {\\r\\n\\t\\t\\t\\t\\tP[i-2][c-2] = -1;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tif(weights[i] <= c && P[i-1][c-weights[i]] + profits[i] > P[i-1][c]) {\\r\\n\\t\\t\\t\\t\\tP[i][c] = P[i-1][c-weights[i]] + profits[i];\\r\\n\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\tP[i][c] = P[i-1][c];\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\treturn P[items][cap];\\r\\n\\t}\",\n \"public int[] podium(){\\n //TODO\\n int [] pod = new int[3];\\n int [] tab = Trier(this.scores);\\n int n= this.scores.length;\\n pod[2]= tab[n-1];\\n pod[1]= tab[n-2];\\n pod[0]= tab[n-3];\\n return pod;\\n \\n \\n }\",\n \"public int _maxProfitAssignmentBetter(int[] difficulty, int[] profit, int[] worker) {\\n int n = difficulty.length;\\n int [][] dp = new int [n][];\\n\\n for (int i = 0; i < n; i ++)\\n dp [i] = new int[] { difficulty[i], profit[i] };\\n\\n Arrays.sort(dp, (a, b) -> (a [0] != b [0]) ? (a [0] - b [0]) : -(a [1] - b [1]));\\n\\n int[] xs = new int[n];\\n for (int i = 0; i < n; i ++) xs [i] = dp [i][0];\\n for (int i = 1; i < n; i ++) dp[i][1] = Math.max(dp [i][1], dp [i - 1][1]);\\n\\n int ret = 0;\\n for(int w : worker){\\n int ind = Arrays.binarySearch(xs, w);\\n if (ind < 0) ind = -ind - 2;\\n if (ind >= 0)\\n ret += dp[ind][1];\\n }\\n return ret;\\n }\",\n \"public static void main(String[] args) {\\n\\t\\tint array0[] = new int[0];\\r\\n\\t\\tint array3[] = new int[3];\\r\\n\\t\\tint array5[] = new int[5];\\r\\n\\t\\tint array15[] = new int[15];\\r\\n\\t\\tint array16[] = new int[16];\\r\\n\\t\\tint array17[] = new int[17];\\r\\n\\t\\tint array19[] = new int[19];\\r\\n\\t\\tint array20[] = new int[20];\\r\\n\\t\\tint array200[] = new int[200];\\r\\n\\t\\tint array1000[] = new int[1000];\\r\\n\\r\\n\\t\\t// iX => integer with value X\\r\\n\\t\\tint i0 = 0;\\r\\n\\t\\tint i20 = 20;\\r\\n\\t\\tint i1 = 1;\\r\\n\\t\\tint i2 = 2;\\r\\n\\t\\tint i3 = 3;\\r\\n\\t\\tint i4 = 4;\\r\\n\\t\\tint i_5 = -5;\\r\\n\\t\\tint p = i2 * i_5; // p is [-10,-10]\\r\\n\\r\\n\\t\\tarray0[0] = 5; // Illegal upper bound\\r\\n\\r\\n\\t\\tarray0[1] = 5; // Illegal upper bound\\r\\n\\r\\n\\t\\tarray5[p] = 5; // Illegal lower bound\\r\\n\\r\\n\\t\\tp = 2 * i2; // p is [4,4]\\r\\n\\r\\n\\t\\tarray5[p] = 5; // Good\\r\\n\\r\\n\\t\\tp *= p; // p is [16,16]\\r\\n\\r\\n\\t\\tarray16[p] = 5; // Illegal upper bound (legal index range is 0-15)\\r\\n\\r\\n\\t\\tarray17[p] = 5; // Good\\r\\n\\r\\n\\t\\tp = i2 * i3; // p is [6,6]\\r\\n\\r\\n\\t\\tboolean b = args.length == 0;\\r\\n\\r\\n\\t\\tif (b) {\\r\\n\\t\\t\\tp = p * i3; // p is [18,18]\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\t// now p is [6,18]\\r\\n\\r\\n\\t\\tarray17[p] = 5; // Potentially illegal upper bound\\r\\n\\t\\tarray19[p] = 5; // Good\\r\\n\\r\\n\\t\\tp = 2; // p is [2,2]\\r\\n\\r\\n\\t\\tfor (int i = 0; i < 5; i++) {\\r\\n\\t\\t\\tp *= 2;\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\t// now p is [2,INF]\\r\\n\\r\\n\\t\\tarray19[p] = 5; // Potentially illegal upper bound // TODO problem\\r\\n\\r\\n\\t\\tp = p - 4; // p is [-2,INF]\\r\\n\\r\\n\\t\\tarray1000[p] = 5; // Potentially illegal lower and upper bounds\\r\\n\\r\\n\\t\\tp = 2; // p is [2,2]\\r\\n\\r\\n\\t\\tfor (int i = 0; i < 5; i++) {\\r\\n\\t\\t\\tarray3[i] = 5; // Potentially illegal upper bound\\r\\n\\t\\t\\tarray16[i] = 5; // Good\\r\\n\\t\\t\\tp *= -2;\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tint i = 5, j = 10;\\r\\n\\r\\n\\t\\tif (b) {\\r\\n\\t\\t\\ti = 15;\\r\\n\\t\\t\\tj = 20;\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\t// now i is [5,15], j is [10,20]\\r\\n\\r\\n\\t\\tif (i != j) {\\r\\n\\t\\t\\tarray16[j] = 5; // Potentially illegal upper bound\\r\\n\\t\\t} else {\\r\\n\\t\\t\\tarray16[j] = 5; // Good\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\t// p is [-INF,INF]\\r\\n\\r\\n\\t\\tarray1000[p] = 5; // Potentially illegal lower and upper bounds\\r\\n\\r\\n\\t}\",\n \"public static int[][] hgAlgorithm(double[][] array, String sumType) {\\r\\n\\t\\tdouble[][] cost = copyOf(array); // Create the cost matrix\\r\\n\\r\\n\\t\\tif (sumType.equalsIgnoreCase(\\\"max\\\")) // Then array is weight array. Must\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// change to cost.\\r\\n\\t\\t{\\r\\n\\t\\t\\tdouble maxWeight = findLargest(cost);\\r\\n\\t\\t\\tfor (int i = 0; i < cost.length; i++) // Generate cost by\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// subtracting.\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tfor (int j = 0; j < cost[i].length; j++) {\\r\\n\\t\\t\\t\\t\\tcost[i][j] = (maxWeight - cost[i][j]);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\tdouble maxCost = findLargest(cost); // Find largest cost matrix element\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// (needed for step 6).\\r\\n\\r\\n\\t\\tint[][] mask = new int[cost.length][cost[0].length]; // The mask array.\\r\\n\\t\\tint[] rowCover = new int[cost.length]; // The row covering vector.\\r\\n\\t\\tint[] colCover = new int[cost[0].length]; // The column covering vector.\\r\\n\\t\\tint[] zero_RC = new int[2]; // Position of last zero from Step 4.\\r\\n\\t\\tint step = 1;\\r\\n\\t\\tboolean done = false;\\r\\n\\t\\twhile (done == false) // main execution loop\\r\\n\\t\\t{\\r\\n\\t\\t\\tswitch (step) {\\r\\n\\t\\t\\tcase 1:\\r\\n\\t\\t\\t\\tstep = hg_step1(step, cost);\\r\\n\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase 2:\\r\\n\\t\\t\\t\\tstep = hg_step2(step, cost, mask, rowCover, colCover);\\r\\n\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase 3:\\r\\n\\t\\t\\t\\tstep = hg_step3(step, mask, colCover);\\r\\n\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase 4:\\r\\n\\t\\t\\t\\tstep = hg_step4(step, cost, mask, rowCover, colCover, zero_RC);\\r\\n\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase 5:\\r\\n\\t\\t\\t\\tstep = hg_step5(step, mask, rowCover, colCover, zero_RC);\\r\\n\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase 6:\\r\\n\\t\\t\\t\\tstep = hg_step6(step, cost, rowCover, colCover, maxCost);\\r\\n\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\tcase 7:\\r\\n\\t\\t\\t\\tdone = true;\\r\\n\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}// end while\\r\\n\\r\\n\\t\\tint[][] assignment = new int[array.length][2]; // Create the returned\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// array.\\r\\n\\t\\tfor (int i = 0; i < mask.length; i++) {\\r\\n\\t\\t\\tfor (int j = 0; j < mask[i].length; j++) {\\r\\n\\t\\t\\t\\tif (mask[i][j] == 1) {\\r\\n\\t\\t\\t\\t\\tassignment[i][0] = i;\\r\\n\\t\\t\\t\\t\\tassignment[i][1] = j;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\t// If you want to return the min or max sum, in your own main method\\r\\n\\t\\t// instead of the assignment array, then use the following code:\\r\\n\\t\\t/*\\r\\n\\t\\t * double sum = 0; for (int i=0; i<assignment.length; i++) { sum = sum +\\r\\n\\t\\t * array[assignment[i][0]][assignment[i][1]]; } return sum;\\r\\n\\t\\t */\\r\\n\\t\\t// Of course you must also change the header of the method to:\\r\\n\\t\\t// public static double hgAlgorithm (double[][] array, String sumType)\\r\\n\\r\\n\\t\\treturn assignment;\\r\\n\\t}\",\n \"void CalculateProbabilities()\\n\\t{\\n\\t int i;\\n\\t double maxfit;\\n\\t maxfit=fitness[0];\\n\\t for (i=1;i<FoodNumber;i++)\\n\\t {\\n\\t if (fitness[i]>maxfit)\\n\\t maxfit=fitness[i];\\n\\t }\\n\\n\\t for (i=0;i<FoodNumber;i++)\\n\\t {\\n\\t prob[i]=(0.9*(fitness[i]/maxfit))+0.1;\\n\\t }\\n\\n\\t}\",\n \"private int[] attdef(board current,int player)\\r\\n { \\r\\n int temp[][]=new int[100][100];\\r\\n possible_location attack = new possible_location();\\r\\n count_values attack_v = new count_values();\\r\\n \\r\\n //get good location of possible pieces\\r\\n temp=attack.list_loc(current,player); \\r\\n \\r\\n //counting values for each possible pieces\\r\\n for (int i=0;i <= temp[99][99];i++ )\\r\\n {\\r\\n temp[i][2]=attack_v.count_values(current,temp[i][0],temp[i][1],player); \\r\\n }\\r\\n \\r\\n \\r\\n \\r\\n //error handling, if there is no possible location, the computer decide a new location\\r\\n if (temp[99][99]<0)\\r\\n {\\r\\n temp[99][99] = 0;\\r\\n int i=8,j=8;\\r\\n \\r\\n while (current.board[i][j]!=0)\\r\\n {\\r\\n j++; \\r\\n \\r\\n if ((current.board[i][j]==0))\\r\\n {\\r\\n i++;\\r\\n }\\r\\n } \\r\\n \\r\\n temp[0][0]=j;\\r\\n temp[0][1]=i;\\r\\n }\\r\\n \\r\\n \\r\\n int max=0,max_V=0;\\r\\n //find the best value\\r\\n for (int i=0;i<=temp[99][99];i++)\\r\\n {\\r\\n if (max<temp[i][2])\\r\\n {\\r\\n max=temp[i][2];\\r\\n max_V=i;\\r\\n }\\r\\n else if (max==temp[i][2])\\r\\n { //if there is same highest value, the computer will random\\r\\n Random random = new Random();\\r\\n if (random.nextInt(2)==0)\\r\\n {\\r\\n max=temp[i][2];\\r\\n max_V=i; \\r\\n }\\r\\n }\\r\\n\\r\\n } \\r\\n \\r\\n //return computer's descision\\r\\n int descision[] = {temp[max_V][0],temp[max_V][1],temp[max_V][2]};\\r\\n return descision;\\r\\n \\r\\n \\r\\n }\",\n \"public static void main(String[] args) throws IOException {\\n\\t\\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\\n//\\t\\tPrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\\n\\n\\t\\tStringTokenizer st = new StringTokenizer(br.readLine());\\n\\t\\tint N= Integer.parseInt(st.nextToken());\\n\\t\\tint T= Integer.parseInt(st.nextToken());\\n\\t\\t\\n\\t\\t//for each N, three possible problem sets (P, A, G)\\n\\t\\t//and P (prep time: min), V (value)\\n\\t\\t//P <= A <= G\\n\\t\\t\\n\\t\\t//given limit T\\n\\t\\t//find max profit\\n\\t\\tint[][] v = new int[N+1][3+1];\\n\\t\\tint[][] w = new int[N+1][3+1];\\n\\t\\t\\n\\t\\t//one \\n\\t\\t\\n\\t\\tfor (int i = 1; i <= N; i++) {\\n\\t\\t\\tst = new StringTokenizer(br.readLine());\\n\\t\\t\\tfor (int j = 1; j <= 3; j++) {\\n\\t\\t\\t\\tw[i][j] = Integer.parseInt(st.nextToken());\\n\\t\\t\\t\\tv[i][j] = Integer.parseInt(st.nextToken());\\n\\t\\t\\t}\\n\\t\\t}\\n//\\t\\tfor (int i = 1; i <= N; i++) {\\n//\\t\\t\\tfor (int j = 1; j <= 3; j++) {\\n//\\t\\t\\t\\tSystem.out.println(w[i][j] + \\\" \\\"+ v[i][j]);\\n//\\t\\t\\t}\\n//\\t\\t}\\n\\t\\tint[][] dp = new int[2][T+1];\\n\\t\\t//where k looks at the kth row of the values/weight array\\n\\t\\tfor (int k = 1; k <= N; k++) {\\n\\t\\t\\tfor (int x = 0; x <= T; x++) {\\n\\t\\t\\t\\t//going through each weight and value\\n\\t\\t\\t\\tboolean ran = false;\\n\\t\\t\\t\\tfor (int a = 1; a <= 3; a++) {\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif (w[k][a] > x) {\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tran = true;\\n\\t\\t\\t\\t\\t\\tdp[1][x] = Math.max(Math.max(dp[0][x],dp[0][x-w[k][a]] + v[k][a]),dp[1][x]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (!ran) {\\n\\t\\t\\t\\t\\tdp[1][x] = dp[0][x];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tdp[0] = dp[1].clone();\\n//\\t\\t\\tfor (int[] row: dp) {\\n//\\t\\t\\t\\tfor (int m: row) {\\n//\\t\\t\\t\\t\\tSystem.out.print(m + \\\" \\\");\\n//\\t\\t\\t\\t}\\n//\\t\\t\\t\\tSystem.out.println();\\n//\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n//\\t\\tfor (int[] row: dp) {\\n//\\t\\t\\tfor (int m: row) {\\n//\\t\\t\\t\\tSystem.out.print(m + \\\" \\\");\\n//\\t\\t\\t}\\n//\\t\\t\\tSystem.out.println();\\n//\\t\\t}\\n\\t\\tSystem.out.println(dp[1][T]);\\n\\t}\",\n \"public void solucioInicial2() {\\n int grupsRecollits = 0;\\n for (int i=0; i<numCentres*helisPerCentre; ++i) {\\n Helicopter hel = new Helicopter();\\n helicopters.add(hel);\\n }\\n int indexHelic = 0;\\n int indexGrup = 0;\\n int places = 15;\\n while (indexGrup < numGrups) {\\n int trajecte[] = {-1,-1,-1};\\n for (int i=0; i < 3 && indexGrup<numGrups; ++i) {\\n Grupo grup = grups.get( indexGrup );\\n if (places - grup.getNPersonas() >= 0) {\\n places -= grup.getNPersonas();\\n trajecte[i] = indexGrup;\\n indexGrup++;\\n\\n }\\n else i = 3;\\n }\\n Helicopter helicopter = helicopters.get( indexHelic );\\n helicopter.addTrajecte( trajecte, indexHelic/helisPerCentre );\\n places = 15;\\n indexHelic++;\\n if (indexHelic == numCentres*helisPerCentre) indexHelic = 0;\\n }\\n }\",\n \"public static void main(String[] args) {\\n int[] example1 = {1, 3, 5, 7, 9, 11, 13, 15, 17, 2, 4, 6, 8, 10, 12, 14, 16, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30};\\n int target1 = 59;\\n int[] example2 = {2, 4, 6, 8, 10, 12, 14, 16, 18, 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30};\\n int target2 = 59;\\n int[] example3 = {1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 2, 4, 6, 8, 10, 12, 14, 16, 18};\\n int target3 = 34;\\n\\n int[] result1;\\n int[] result2;\\n int[] result3;\\n\\n // 1.Brute Force\\n System.out.println(\\\"Brute Force start\\\");\\n long startBF = System.currentTimeMillis();\\n result1 = twoSum_1(example1, target1);\\n result2 = twoSum_2(example2, target2);\\n result3 = twoSum_3(example3, target3);\\n println(\\\"Brute Force result1 \\\", result1);\\n println(\\\"Brute Force result2 \\\", result2);\\n println(\\\"Brute Force result3 \\\", result3);\\n System.out.println(\\\"Brute Force costs: \\\" + (System.currentTimeMillis() - startBF));\\n\\n // 2.Two Pass Hash Table\\n System.out.println(\\\"Two Pass Hash Table start\\\");\\n long startTP = System.currentTimeMillis();\\n result1 = twoSum_1(example1, target1);\\n result2 = twoSum_2(example2, target2);\\n result3 = twoSum_3(example3, target3);\\n println(\\\"Two Pass Hash Table start result1 \\\", result1);\\n println(\\\"Two Pass Hash Table start result2 \\\", result2);\\n println(\\\"Two Pass Hash Table start result3 \\\", result3);\\n System.out.println(\\\"Two Pass Hash Table costs: \\\" + (System.currentTimeMillis() - startTP));\\n\\n // 3.One Pass Hash Table\\n System.out.println(\\\"One Pass Hash Table start\\\");\\n long startOP = System.currentTimeMillis();\\n result1 = twoSum_1(example1, target1);\\n result2 = twoSum_2(example2, target2);\\n result3 = twoSum_3(example3, target3);\\n println(\\\"Two Pass Hash Table start result1 \\\", result1);\\n println(\\\"Two Pass Hash Table start result2 \\\", result2);\\n println(\\\"Two Pass Hash Table start result3 \\\", result3);\\n System.out.println(\\\"Two Pass Hash Table costs: \\\" + (System.currentTimeMillis() - startOP));\\n }\",\n \"private void makeStat(int nbrParties){\\n\\t\\tint indexTemps=0;//position à laquelle ajouter un temps de partie dans le tableaux tempsPartie\\n\\t\\twhile(nbrParties >0){//tant qu'il reste des parties à faire\\n\\n\\t\\t\\tboolean gagne=false;\\n\\t\\t\\tPlayer joueurAjouer=null;\\n\\t\\t\\tlong beforeTime=System.currentTimeMillis();\\n\\t\\t\\twhile(!gagne){//tant qu'aucun joueur n'a gagné on joue\\n\\t\\t\\t\\tjoueurAjouer=jeu.whichPlayer();\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tint value=joueurAjouer.play(jeu.getGameboard(),joueurs, null, null);\\n\\t\\t\\t\\tgagne=jeu.win(joueurAjouer);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\twhile(gagne==false &&value!=GameBoard.OK){\\n\\t\\t\\t\\t\\tvalue=joueurAjouer.play(jeu.getGameboard(),joueurs, null, null);\\n\\t\\t\\t\\t\\tgagne=jeu.win(joueurAjouer);\\n\\t\\t\\t\\t\\t\\n\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\n\\t\\t\\tlong afterTime=System.currentTimeMillis();\\n\\t\\t\\ttempsPartie[indexTemps]=afterTime-beforeTime;\\n\\t\\t\\tindexTemps++;\\n\\t\\t\\t\\n\\t\\t\\tif(joueurAjouer==joueur1){\\n\\t\\t\\t\\tif(joueur1.getNbrJoueur()==1){// signifie que c'est lui qui a commence la partie\\n\\t\\t\\t\\t\\tstatJ1[0]+=1;//on incremente le nombre de parties gagnées en tant que J1\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tstatJ1[1]+=1;//on incremente le nombre de parties gagnées en tant que J2\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tstatJ1[2]+=1;// on incremente le nombre de parties totales\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tif(joueurAjouer==joueur2){\\n\\t\\t\\t\\tif(joueur2.getNbrJoueur()==1){// signifie que c'est lui qui a commence la partie\\n\\t\\t\\t\\t\\tstatJ2[0]+=1;//on incremente le nombre de parties gagnées en tant que J1\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tstatJ2[1]+=1;//on incremente le nombre de parties gagnées en tant que J2\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tstatJ2[2]+=1;// on incremente le nombre de parties totales\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tstatJ1[3]+=Player.getNbrMurDepart()-joueur1.getNombreMur();\\n\\t\\t\\tstatJ1[4]+=joueur1.getNbrDeplacement();\\n\\t\\t\\t\\n\\t\\t\\tstatJ2[3]+=Player.getNbrMurDepart()-joueur2.getNombreMur();\\n\\t\\t\\tstatJ2[4]+=joueur2.getNbrDeplacement();\\n\\t\\t\\tresetGame();\\n\\t\\t\\tnbrParties--;\\n\\t\\t}\\n\\t\\tstatJ1[5]+=statJ1[3]+statJ1[4];\\n\\t\\tstatJ2[5]+=statJ2[3]+statJ2[4];\\n\\t}\",\n \"public void calculations(){\\n\\n int temp_size1 = fight_list.get(0).t1.members.size();\\n int[] t1_counter = new int[temp_size1 + 1]; //counter for deaths: 0, 1, 2..., party size.\\n float t1_avg = 0; //Average number of deaths.\\n\\n //We don't need to calculate for t2 right now, because t2 is just monsters.\\n //temp_size = fight_list.get(0).t2.members.size();\\n //int[] t2_counter = new int[temp_size + 1];\\n\\n for(FightResult fig : this.fight_list){\\n int i = 0;\\n while(i != fig.t1_deaths){\\n i++;\\n }\\n t1_counter[i]++;\\n t1_avg += fig.t1_deaths;\\n }//end for\\n\\n System.out.println(t1_avg);\\n System.out.println(Float.toString(t1_avg/fight_list.size()) + \\\" / \\\" + Integer.toString(temp_size1));\\n\\n String axis = \\\"# of deaths: \\\\t\\\";\\n int axis_int = 0;\\n String t1_results = \\\"Happened: \\\\t\\\";\\n for(int i : t1_counter){\\n axis += Integer.toString(axis_int++) + \\\"\\\\t\\\";\\n t1_results += Integer.toString(i) + \\\"\\\\t\\\";\\n }//end for\\n System.out.println(axis);\\n System.out.println(t1_results);\\n\\n float tpk_amount = t1_counter[temp_size1]; //by taking the size, we take the item at the end of the array. In this case, the number where everyone dies.\\n tpk_amount = (tpk_amount/fight_list.size())*100;\\n System.out.println(\\\"Probability of TPK: \\\" + Float.toString(tpk_amount) + \\\" %.\\\");\\n\\n System.out.println(\\\"\\\\n--------\\\\n\\\");\\n }\",\n \"public int[] solver(int startPlayerId, int curplayer, int[][] oneP, int[][][] memory, int count) {\\n\\r\\n int[][] one = oneP.clone(); // OnePlay Input\\r\\n int[] k; // onePlay points\\r\\n int j = curplayer;\\r\\n int[][][] m = memory.clone();\\r\\n int[] minCard = new int[3];\\r\\n int[] t;\\r\\n ArrayList<int[]> store = new ArrayList<>();\\r\\n minCard[2] = 100000;\\r\\n t = new int[3];\\r\\n for (int i = 0; i < 4; i++) { // 4 types of cards\\r\\n for (int l = 2; l < cardPerPlayer + 2; l++) {\\r\\n if (m[j][i][l] == 1 || m[j][i][l] == 2) {\\r\\n one[j][0] = i;\\r\\n one[j][1] = l;\\r\\n remove(new int[] { i, l }, m);\\r\\n if ((j + 1) % players != startPlayerId) {\\r\\n t = solver(startPlayerId, (j + 1) % players, one, m, count);\\r\\n one[(j + 1) % players][0] = t[0];\\r\\n one[(j + 1) % players][1] = t[1];\\r\\n }\\r\\n // } else if ((j + 2) % players != startPlayerId) {\\r\\n // t = solver(startPlayerId, (j + 2) % players, one, m, count);\\r\\n // one[(j + 1) % players][0] = t[0];\\r\\n // one[(j + 1) % players][1] = t[1];\\r\\n // } else if ((j + 3) % players != startPlayerId) {\\r\\n // t = solver(startPlayerId, (j + 3) % players, one, m, count);\\r\\n // one[(j + 1) % players][0] = t[0];\\r\\n // one[(j + 1) % players][1] = t[1];\\r\\n // }\\r\\n\\r\\n k = onePlay(one, startPlayerId);\\r\\n int curpoint = 0;\\r\\n if (count != cardPerPlayer - 1) { // cardPerPlayer - 1 = 12\\r\\n t = solver(k[0], k[0], new int[4][2], m, count++);\\r\\n curpoint = t[2];\\r\\n }\\r\\n\\r\\n if (k[0] == myID) {\\r\\n curpoint += k[1] + k[2] * 12;\\r\\n }\\r\\n store.add(new int[] { i, l, curpoint });\\r\\n if (curpoint < minCard[2]) {\\r\\n minCard[2] = curpoint;\\r\\n minCard[0] = i;\\r\\n minCard[1] = l;\\r\\n }\\r\\n }\\r\\n }\\r\\n }\\r\\n\\r\\n return minCard;\\r\\n }\",\n \"private double[] genHealthAndSpeed() {\\n double multiplier = genMultiplier();\\n double[] healthAndSpeed = new double[2]; //0 for health, 1 for speed\\n healthAndSpeed[0] = (100+currentDifficulty)*multiplier;\\n healthAndSpeed[1] = 2*(1+(1-multiplier));\\n return healthAndSpeed;\\n }\",\n \"public StandardSolution (long[] nums){\\n \\t\\tsequence = nums;\\n \\t\\tpartitions = new boolean[sequence.length];\\n \\t\\t\\n \\t\\tRandom rand = new Random();\\n \\t\\tfor (int i = 0; i < partitions.length; i++){\\n \\t\\t\\t// worry about seeing?\\n \\t\\t\\tpartitions[i] = rand.nextBoolean();\\n \\t\\t}\\n \\t}\",\n \"Couple[] Exchange (Couple[] v,Gift[] G) throws IOException{\\n \\n \\n int i;\\n String y;\\n int s = 0;\\n int e = 99;\\n \\n for (i = 0; i < 10; i++) {\\n \\n y = v[i].btype;\\n \\n \\n if (\\\"Generous\\\" == y) {\\n \\n if ((v[i].spend <= v[i].bd)) {\\n \\n if (v[i].spend <= v[i].m) {\\n \\n v[i].lc = v[i].lc + 1;\\n v[i].lv = v[i].lv + G[e].price;\\n v[i].spend = v[i].spend +G[e].price;\\n e--;\\n \\n }else {\\n \\n v[i].lc = v[i].lc + 1;\\n v[i].lv = v[i].lv + G[e].price;\\n v[i].spend = v[i].spend +G[e].price;\\n v[i].extra = v[i].extra + G[e].price;\\n e--;\\n \\n \\n }\\n \\n }\\n \\n }else if (\\\"Miser\\\" == y) {\\n \\n if (v[i].spend <= v[i].m) {\\n \\n v[i].spend = v[i].spend + G[s].price;\\n s++;\\n }\\n \\n \\n }else if (\\\"Geeky\\\" == y) {\\n \\n if (v[i].spend <= v[i].m) {\\n \\n v[i].spend = v[i].spend + G[s].price;\\n s++;\\n }else {\\n \\n v[i].spend = v[i].spend + G[e].price;\\n v[i].extra = v[i].extra + G[e].price;\\n \\n } \\n }\\n \\n \\n \\n }\\n\\n return v;\\n}\",\n \"public static void main(String[]args){\\n\\r\\n int []arr = new int[100];\\r\\n int []arr2 = new int[50];\\r\\n int []arr3 = {1,2,3,4,5,6,7,8};\\r\\n int number = 5;\\r\\n LogicalOp op = new LogicalOp();\\r\\n// op.writeOnArray(arr);\\r\\n\\r\\n// arr2 = op.evenArray(arr2);\\r\\n// for(int i=0;i<arr2.length;i++)\\r\\n// System.out.println(arr2[i]);\\r\\n\\r\\n //System.out.println(\\\"Mean value: \\\"+op.meanValue(arr3));\\r\\n\\r\\n// String[] arrOfStr = {\\\"ana\\\",\\\"are\\\",\\\"mere\\\",\\\"pere\\\",\\\"mere\\\"};\\r\\n// String str = \\\"mere\\\";\\r\\n// System.out.println(op.isContaingString(arrOfStr,str));\\r\\n\\r\\n// System.out.println(op.findPosition(arr3,number));\\r\\n\\r\\n //op.displayLines();\\r\\n\\r\\n// int[]modifArr = op.modifiedArr(arr3,number);\\r\\n// for(int item: modifArr)\\r\\n// System.out.print(item+\\\" \\\");\\r\\n\\r\\n\\r\\n //System.out.println(\\\"Second minimum: \\\"+op.secondMin(arr3));\\r\\n\\r\\n int[] empty = new int[arr3.length];\\r\\n empty = op.populateArray(arr3,empty);\\r\\n for(int item:empty)\\r\\n System.out.print(item+\\\" \\\");\\r\\n\\r\\n\\r\\n\\r\\n }\",\n \"public static void main(String[] args) {\\n\\n pairsSum();\\n\\n printAllSubArrays();\\n\\n tripletZero();\\n\\n // int[][] sub = subsets();\\n\\n PairsSum sum = new PairsSum();\\n int[] arr = { 10, 1, 2, 3, 4, 5, 6, 1 };\\n boolean flag = sum.almostIncreasingSequence(arr);\\n System.out.println(flag);\\n\\n String s = \\\"\\\";\\n for (int i = 0; i < 100000; i++) {\\n // s += \\\"CodefightsIsAwesome\\\";\\n }\\n long start = System.currentTimeMillis();\\n // int k = subStr(s, \\\"IsA\\\");\\n System.out.println(System.currentTimeMillis() - start);\\n // System.out.println(k);\\n\\n String[] a = { \\\"aba\\\", \\\"aa\\\", \\\"ad\\\", \\\"vcd\\\", \\\"aba\\\" };\\n String[] b = sum.allLongestStrings(a);\\n System.out.println(Arrays.deepToString(b));\\n\\n List<String> al = new ArrayList<>();\\n al.toArray();\\n\\n Map<Integer, Integer> map = new HashMap<>();\\n Set<Integer> keySet = map.keySet();\\n for (Integer integer : keySet) {\\n\\n }\\n\\n String st = reverseBracksStack(\\\"a(bc(de)f)g\\\");\\n System.out.println(st);\\n\\n int[] A = { 1, 2, 3, 2, 2, 3, 3, 33 };\\n int[] B = { 1, 2, 2, 2, 2, 3, 2, 33 };\\n\\n System.out.println(sum.isIPv4Address(\\\"2.2.34\\\"));\\n\\n Integer[] AR = { 5, 3, 6, 7, 9 };\\n int h = sum.avoidObstacles(AR);\\n System.out.println(h);\\n\\n int[][] image = { { 36, 0, 18, 9 }, { 27, 54, 9, 0 }, { 81, 63, 72, 45 } };\\n int[][] im = { { 7, 4, 0, 1 }, { 5, 6, 2, 2 }, { 6, 10, 7, 8 }, { 1, 4, 2, 0 } };\\n int[][] res = sum.boxBlur(im);\\n\\n for (int i = 0; i < res.length; i++) {\\n for (int j = 0; j < res[0].length; j++) {\\n System.out.print(res[i][j] + \\\" \\\");\\n }\\n System.out.println();\\n }\\n\\n boolean[][] ms = { { true, false, false, true }, { false, false, true, false }, { true, true, false, true } };\\n int[][] mines = sum.minesweeper(ms);\\n for (int i = 0; i < mines.length; i++) {\\n for (int j = 0; j < mines[0].length; j++) {\\n System.out.print(mines[i][j] + \\\" \\\");\\n }\\n System.out.println();\\n }\\n\\n System.out.println(sum.variableName(\\\"var_1__Int\\\"));\\n\\n System.out.println(sum.chessBoard());\\n\\n System.out.println(sum.depositProfit(100, 20, 170));\\n\\n String[] inputArray = { \\\"abc\\\", \\\"abx\\\", \\\"axx\\\", \\\"abx\\\", \\\"abc\\\" };\\n System.out.println(sum.stringsRearrangement(inputArray));\\n\\n int[][] queens = { { 1, 1 }, { 3, 2 } };\\n int[][] queries = { { 1, 1 }, { 0, 3 }, { 0, 4 }, { 3, 4 }, { 2, 0 }, { 4, 3 }, { 4, 0 } };\\n boolean[] r = sum.queensUnderAttack(5, queens, queries);\\n\\n }\",\n \"protected static Object[] calcGainRatios(InstanceList ilist, int[] instIndices, int minNumInsts)\\n {\\n int numInsts = instIndices.length;\\n Alphabet dataDict = ilist.getDataAlphabet();\\n LabelAlphabet targetDict = (LabelAlphabet) ilist.getTargetAlphabet();\\n double[] targetCounts = new double[targetDict.size()];\\n\\n // Accumulate target label counts and make sure\\n // the sum of each instance's target label is 1\\n for (int ii = 0; ii < numInsts; ii++) {\\n Instance inst = ilist.get(instIndices[ii]);\\n Labeling labeling = inst.getLabeling();\\n double labelWeightSum = 0;\\n for (int ll = 0; ll < labeling.numLocations(); ll++) {\\n int li = labeling.indexAtLocation(ll);\\n double labelWeight = labeling.valueAtLocation(ll);\\n labelWeightSum += labelWeight;\\n targetCounts[li] += labelWeight;\\n }\\n assert(Maths.almostEquals(labelWeightSum, 1));\\n }\\n\\n // Calculate the base entropy Info(D) and the the \\n // label distribution of the given instances\\n double[] targetDistribution = new double[targetDict.size()];\\n double baseEntropy = 0;\\n for (int ci = 0; ci < targetDict.size(); ci++) {\\n double p = targetCounts[ci] / numInsts;\\n targetDistribution[ci] = p;\\n if (p > 0)\\n baseEntropy -= p * Math.log(p) / log2;\\n }\\n\\n LabelVector baseLabelDistribution = new LabelVector(targetDict, targetDistribution);\\n double infoGainSum = 0;\\n int totalNumSplitPoints = 0;\\n double[] passTestTargetCounts = new double[targetDict.size()];\\n // Maps feature index -> Hashtable, and each table \\n // maps (split point) -> (info gain, split ratio)\\n HashMap[] featureToInfo = new HashMap[dataDict.size()]; \\n \\n // Go through each feature's split points in ascending order\\n for (int fi = 0; fi < dataDict.size(); fi++) {\\n \\n if ((fi+1) % 1000 == 0)\\n logger.info(\\\"at feature \\\" + (fi+1) + \\\" / \\\" + dataDict.size());\\n \\n featureToInfo[fi] = new HashMap();\\n Arrays.fill(passTestTargetCounts, 0);\\n // Sort instances on this feature's values\\n instIndices = sortInstances(ilist, instIndices, fi);\\n\\n // Iterate through the sorted instances\\n for (int ii = 0; ii < numInsts-1; ii++) {\\n Instance inst = ilist.get(instIndices[ii]);\\n Instance instPlusOne = ilist.get(instIndices[ii+1]);\\n FeatureVector fv1 = (FeatureVector) inst.getData();\\n FeatureVector fv2 = (FeatureVector) instPlusOne.getData();\\n double lower = fv1.value(fi);\\n double higher = fv2.value(fi);\\n\\n // Accumulate the label weights for instances passing the test\\n Labeling labeling = inst.getLabeling();\\n for (int ll = 0; ll < labeling.numLocations(); ll++) {\\n int li = labeling.indexAtLocation(ll);\\n double labelWeight = labeling.valueAtLocation(ll);\\n passTestTargetCounts[li] += labelWeight;\\n }\\n\\n if (Maths.almostEquals(lower, higher) || inst.getLabeling().toString().equals(instPlusOne.getLabeling().toString()))\\n continue;\\n\\n // For this (feature, spilt point) pair, calculate the \\n // info gain of using this pair to split insts into those \\n // with value of feature <= p versus > p\\n totalNumSplitPoints++;\\n double splitPoint = (lower + higher) / 2;\\n double numPassInsts = ii+1;\\n \\n // If this split point creates a partition \\n // with too few instances, ignore it\\n double numFailInsts = numInsts - numPassInsts;\\n if (numPassInsts < minNumInsts || numFailInsts < minNumInsts)\\n continue;\\n \\n // If all instances pass or fail this test, it is useless\\n double passProportion = numPassInsts / numInsts;\\n if (Maths.almostEquals(passProportion, 0) || Maths.almostEquals(passProportion, 1))\\n continue; \\n \\n // Calculate the entropy of instances passing and failing the test\\n double passEntropy = 0;\\n double failEntropy = 0;\\n double p;\\n \\n for (int ci = 0; ci < targetDict.size(); ci++) {\\n if (numPassInsts > 0) {\\n p = passTestTargetCounts[ci] / numPassInsts;\\n if (p > 0)\\n passEntropy -= p * Math.log(p) / log2;\\n }\\n if (numFailInsts > 0) {\\n double failTestTargetCount = targetCounts[ci] - passTestTargetCounts[ci];\\n p = failTestTargetCount / numFailInsts;\\n if (p > 0)\\n failEntropy -= p * Math.log(p) / log2;\\n }\\n }\\n \\n // Calculate Gain(D, T), the information gained \\n // by testing on this (feature, split-point) pair\\n double gainDT = baseEntropy \\n - passProportion * passEntropy\\n - (1-passProportion) * failEntropy; \\n infoGainSum += gainDT;\\n // Calculate Split(D, T), the split information\\n double splitDT = \\n - passProportion * Math.log(passProportion) / log2\\n - (1-passProportion) * Math.log(1-passProportion) / log2;\\n // Calculate the gain ratio\\n double gainRatio = gainDT / splitDT;\\n featureToInfo[fi].put(Double.valueOf(splitPoint),\\n new Point2D.Double(gainDT, gainRatio));\\n } // End loop through sorted instances\\n } // End loop through features\\n\\n // For each feature's split point with at least average gain, \\n // get the maximum gain ratio and the associated split point\\n // (using the info gain as tie breaker)\\n double[] gainRatios = new double[dataDict.size()];\\n double[] splitPoints = new double[dataDict.size()];\\n int numSplitsForBestFeature = 0;\\n\\n // If all feature vectors are identical or no splits are worthy, return all 0s\\n if (totalNumSplitPoints == 0 || Maths.almostEquals(infoGainSum, 0))\\n return new Object[] {gainRatios, splitPoints, Double.valueOf(baseEntropy), \\n baseLabelDistribution, Integer.valueOf(numSplitsForBestFeature)};\\n\\n double avgInfoGain = infoGainSum / totalNumSplitPoints;\\n double maxGainRatio = 0;\\n double gainForMaxGainRatio = 0; // tie breaker\\n \\n int xxx = 0;\\n \\n \\n for (int fi = 0; fi < dataDict.size(); fi++) {\\n double featureMaxGainRatio = 0;\\n double featureGainForMaxGainRatio = 0;\\n double bestSplitPoint = Double.NaN;\\n\\n for (Iterator iter = featureToInfo[fi].keySet().iterator(); iter.hasNext(); ) {\\n Object key = iter.next();\\n Point2D.Double pt = (Point2D.Double) featureToInfo[fi].get(key);\\n double splitPoint = ((Double) key).doubleValue();\\n double infoGain = pt.getX();\\n double gainRatio = pt.getY();\\n\\n if (infoGain >= avgInfoGain) {\\n if (gainRatio > featureMaxGainRatio || (gainRatio == featureMaxGainRatio && infoGain > featureGainForMaxGainRatio)) {\\n featureMaxGainRatio = gainRatio;\\n featureGainForMaxGainRatio = infoGain;\\n bestSplitPoint = splitPoint;\\n }\\n }\\n else {\\n xxx++;\\n }\\n \\n }\\n assert(! Double.isNaN(bestSplitPoint));\\n gainRatios[fi] = featureMaxGainRatio;\\n splitPoints[fi] = bestSplitPoint;\\n\\n if (featureMaxGainRatio > maxGainRatio || (featureMaxGainRatio == maxGainRatio && featureGainForMaxGainRatio > gainForMaxGainRatio)) {\\n maxGainRatio = featureMaxGainRatio;\\n gainForMaxGainRatio = featureGainForMaxGainRatio;\\n numSplitsForBestFeature = featureToInfo[fi].size();\\n }\\n }\\n \\n logger.info(\\\"label distrib:\\\\n\\\" + baseLabelDistribution);\\n logger.info(\\\"base entropy=\\\" + baseEntropy + \\\", info gain sum=\\\" + infoGainSum + \\\", total num split points=\\\" + totalNumSplitPoints + \\\", avg info gain=\\\" + avgInfoGain + \\\", num splits with < avg gain=\\\" + xxx);\\n \\n return new Object[] {gainRatios, splitPoints, Double.valueOf(baseEntropy), \\n baseLabelDistribution, Integer.valueOf(numSplitsForBestFeature)};\\n }\",\n \"public abstract double[] solveDual(int[][] matrix, double[] profitTable, int[] teamTable);\",\n \"INDArray getBoardScores() {\\n //creez un vector ce va contine aceste scoruri si va putea fi folosit la antrenare\\n INDArray boardScores = Nd4j.zeros(1, size * size);\\n\\n //creez o copie a tablei pentru a o putea modifica\\n Stone[][] boardCopy = Board.getBoard(), board = new Stone[size][size];\\n\\n //gasesc recursiv scorurile tablei curente\\n float[][] boardScoresFloat = new float[size][size];\\n //simulez o mutare a jucatorului\\n int stonesNr = Board.getStonesNr();\\n for(int i = 0; i < size; i++)\\n for(int j = 0; j < size; j++){\\n Chain chain = new Chain();\\n Stone stone = new Stone(color ? \\\"black\\\" : \\\"white\\\", chain);\\n stone.setPosition(i, j);\\n for (int k = 0; k < boardCopy.length; k++) {\\n board[k] = Arrays.copyOf(boardCopy[k], boardCopy[k].length);\\n }\\n int[] lib = Control.verifyLiberties(board, stone, i, j);\\n if(board[i][j] == null && lib[0] + lib[1] != 0){\\n int depth = 0;\\n int dif = size / 2;\\n boardScoresFloat[i][j] = getQScore(board, i, j, depth, depth)\\n + new Random().nextInt(1000 / stonesNr) - (500 / stonesNr)\\n - abs(i - dif) - abs(j - dif);\\n }\\n else{\\n boardScoresFloat[i][j] = -5000;\\n }\\n }\\n\\n //normalizez vectorul\\n //aflu norma vectorului de valori\\n double sum = 0;\\n for(int i = 0; i < size; i++)\\n for(int j = 0; j < size; j++)\\n sum += boardScoresFloat[i][j] * boardScoresFloat[i][j];\\n sum = Math.sqrt(sum);\\n //aplic norma\\n for(int i = 0; i < size; i++)\\n for(int j = 0; j < size; j++)\\n boardScoresFloat[i][j] /= sum;\\n\\n //inserez rezultatele gasite intr-un INDArray\\n int poz = 0;\\n for(int i = 0; i < size; i++)\\n for(int j = 0; j < size; j++){\\n boardScores.putScalar(new int[]{0, poz}, boardScoresFloat[i][j]);\\n poz++;\\n }\\n //System.out.println(boardScores);\\n return boardScores;\\n }\",\n \"private void declareArrays() {\\n int iNumTimesteps = m_oLegend.getNumberOfTimesteps(),\\n i, j, k;\\n \\n //Create arrays to hold raw data.\\n mp_fLiveTreeVolumeTotals = new double[m_iNumSpecies][iNumTimesteps + 1][m_iNumSizeClasses];\\n mp_fSnagVolumeTotals = new double[m_iNumSpecies][iNumTimesteps + 1][m_iNumSizeClasses]; \\n mp_iLiveTreeCounts = new long[m_iNumSpecies][iNumTimesteps + 1][m_iNumSizeClasses];\\n mp_iSnagCounts = new long[m_iNumSpecies][iNumTimesteps + 1][m_iNumSizeClasses];\\n mp_fLiveTreeDBHTotal = new double[m_iNumSpecies][iNumTimesteps + 1];\\n mp_fSnagDBHTotal = new double[m_iNumSpecies][iNumTimesteps + 1];\\n mp_fTallestLiveTrees = new float[m_iNumSpecies+1][iNumTimesteps + 1][10];\\n mp_fTallestSnags = new float[m_iNumSpecies+1][iNumTimesteps + 1][10];\\n \\n //Initialize all values with 0s\\n for (i = 0; i < mp_fTallestLiveTrees.length; i++) {\\n for (j = 0; j < mp_fTallestLiveTrees[i].length; j++) {\\n for (k = 0; k < mp_fTallestLiveTrees[i][j].length; k++) {\\n mp_fTallestLiveTrees[i][j][k] = 0;\\n mp_fTallestSnags[i][j][k] = 0;\\n }\\n }\\n }\\n \\n for (i = 0; i < m_iNumSpecies; i++) {\\n for (j = 0; j <= iNumTimesteps; j++) {\\n mp_fLiveTreeDBHTotal[i][j] = 0;\\n mp_fSnagDBHTotal[i][j] = 0;\\n for (k = 0; k < m_iNumSizeClasses; k++) {\\n mp_iLiveTreeCounts[i][j][k] = 0;\\n mp_iSnagCounts[i][j][k] = 0;\\n mp_fLiveTreeVolumeTotals[i][j][k] = 0;\\n mp_fSnagVolumeTotals[i][j][k] = 0;\\n }\\n }\\n }\\n }\",\n \"static void makeAllWaysCacheDistToMethod(){\\n allWaysCache = new long[8][NumToCheck + 1];\\n int currentDescriptor = 0;\\n for (int jump = 1; jump <= 3; jump++){\\n for (int j = jump; j <= NumToCheck; j += jump){\\n allWaysCache[currentDescriptor][j] = 1;\\n }\\n currentDescriptor++;\\n }\\n //1,2\\n addShifted(allWaysCache[3], allWaysCache[0], 3);\\n addShifted(allWaysCache[3], allWaysCache[1], 3);\\n cummulativeShift(allWaysCache[3], 3);\\n //1,3\\n addShifted(allWaysCache[4], allWaysCache[0], 4);\\n addShifted(allWaysCache[4], allWaysCache[2], 4);\\n cummulativeShift(allWaysCache[4], 4);\\n //2,3\\n addShifted(allWaysCache[5], allWaysCache[1], 5);\\n addShifted(allWaysCache[5], allWaysCache[2], 5);\\n cummulativeShift(allWaysCache[5], 5);\\n //1,2,3\\n addShifted(allWaysCache[6], allWaysCache[3], 6);\\n addShifted(allWaysCache[6], allWaysCache[4], 6);\\n addShifted(allWaysCache[6], allWaysCache[5], 6);\\n cummulativeShift(allWaysCache[6], 6);\\n\\n //do I want to add them together?\\n //I think I do,\\n for (int i = 0; i < 6; i++){\\n for (int j = 0; j <= NumToCheck; j++){\\n allWaysCache[6][j] += allWaysCache[i][j];\\n }\\n }\\n addShifted(allWaysCache[5], allWaysCache[1], 0);\\n addShifted(allWaysCache[5], allWaysCache[2], 0);\\n addShifted(allWaysCache[4], allWaysCache[0], 0);\\n addShifted(allWaysCache[4], allWaysCache[2], 0);\\n addShifted(allWaysCache[3], allWaysCache[0], 0);\\n addShifted(allWaysCache[3], allWaysCache[1], 0);\\n for (int i = 0; i <= 6; i++){\\n allWaysCache[i][0] = 1;\\n }\\n\\n }\",\n \"public void ss(){\\n for (int c=0; c < league.length;c++) {\\r\\n for (int t=c+1;t<league.length;t++) {\\r\\n score = league[c].scoregenerator();\\r\\n secondscore = league[t].scoregenerator();\\r\\n league[c].pointsfor(score);\\r\\n league[t].pointsfor(secondscore);\\r\\n\\r\\n if (score > secondscore){\\r\\n league[c].wins();\\r\\n league[t].losses();\\r\\n }\\r\\n else if (score == secondscore){\\r\\n league[c].ties();\\r\\n league[t].ties();\\r\\n }\\r\\n else {\\r\\n league[t].wins();\\r\\n league[c].losses();\\r\\n }\\r\\n } \\r\\n }\\r\\n for (int c=0; c < AFC.length;c++) {\\r\\n for (int t=c+1;t<AFC.length;t++) {\\r\\n score = AFC[c].scoregenerator();\\r\\n secondscore = AFC[t].scoregenerator();\\r\\n AFC[c].pointsfor(score);\\r\\n AFC[t].pointsfor(secondscore);\\r\\n\\r\\n if (score > secondscore){\\r\\n AFC[c].wins();\\r\\n AFC[t].losses();\\r\\n }\\r\\n else if (score == secondscore){\\r\\n AFC[c].ties();\\r\\n AFC[t].ties();\\r\\n }\\r\\n else {\\r\\n AFC[t].wins();\\r\\n AFC[c].losses();\\r\\n }\\r\\n } \\r\\n }\\r\\n for (int c=0; c < NFC.length;c++) {\\r\\n for (int t=c+1;t<NFC.length;t++) {\\r\\n score = NFC[c].scoregenerator();\\r\\n secondscore = NFC[t].scoregenerator();\\r\\n NFC[c].pointsfor(score);\\r\\n NFC[t].pointsfor(secondscore);\\r\\n\\r\\n if (score > secondscore){\\r\\n NFC[c].wins();\\r\\n NFC[t].losses();\\r\\n }\\r\\n else if (score == secondscore){\\r\\n NFC[c].ties();\\r\\n NFC[t].ties();\\r\\n }\\r\\n else {\\r\\n NFC[t].wins();\\r\\n NFC[c].losses();\\r\\n }\\r\\n } \\r\\n }\\r\\n for (int c=0;c<AFCeast.length;c++) {\\r\\n for (int t=c+1;t<AFCeast.length;t++) {\\r\\n score = AFCeast[c].scoregenerator();\\r\\n secondscore = AFCeast[t].scoregenerator();\\r\\n AFCeast[c].pointsfor(score);\\r\\n AFCeast[t].pointsfor(secondscore);\\r\\n\\r\\n if (score > secondscore){\\r\\n AFCeast[c].wins();\\r\\n AFCeast[t].losses();\\r\\n }\\r\\n else if (score == secondscore){\\r\\n AFCeast[c].ties();\\r\\n AFCeast[t].ties();\\r\\n }\\r\\n else {\\r\\n AFCeast[t].wins();\\r\\n AFCeast[c].losses();\\r\\n }\\r\\n } \\r\\n }\\r\\n for (int c=0; c < AFCnorth.length;c++) {\\r\\n for (int t=c+1;t<AFCnorth.length;t++) {\\r\\n score = AFCnorth[c].scoregenerator();\\r\\n secondscore = AFCnorth[t].scoregenerator();\\r\\n AFCnorth[c].pointsfor(score);\\r\\n AFCnorth[t].pointsfor(secondscore);\\r\\n\\r\\n if (score > secondscore){\\r\\n AFCnorth[c].wins();\\r\\n AFCnorth[t].losses();\\r\\n }\\r\\n else if (score == secondscore){\\r\\n AFCnorth[c].ties();\\r\\n AFCnorth[t].ties();\\r\\n }\\r\\n else {\\r\\n AFCnorth[t].wins();\\r\\n AFCnorth[c].losses();\\r\\n }\\r\\n } \\r\\n }\\r\\n for (int c=0; c < AFCsouth.length;c++) {\\r\\n for (int t=c+1;t<AFCsouth.length;t++) {\\r\\n score = AFCsouth[c].scoregenerator();\\r\\n secondscore = AFCsouth[t].scoregenerator();\\r\\n AFCsouth[c].pointsfor(score);\\r\\n AFCsouth[t].pointsfor(secondscore);\\r\\n\\r\\n if (score > secondscore){\\r\\n AFCsouth[c].wins();\\r\\n AFCsouth[t].losses();\\r\\n }\\r\\n else if (score == secondscore){\\r\\n AFCsouth[c].ties();\\r\\n AFCsouth[t].ties();\\r\\n }\\r\\n else {\\r\\n AFCsouth[t].wins();\\r\\n AFCsouth[c].losses();\\r\\n }\\r\\n } \\r\\n }\\r\\n for (int c=0; c < AFCwest.length;c++) {\\r\\n for (int t=c+1;t<AFCwest.length;t++) {\\r\\n score = AFCwest[c].scoregenerator();\\r\\n secondscore = AFCwest[t].scoregenerator();\\r\\n AFCwest[c].pointsfor(score);\\r\\n AFCwest[t].pointsfor(secondscore);\\r\\n\\r\\n if (score > secondscore){\\r\\n AFCwest[c].wins();\\r\\n AFCwest[t].losses();\\r\\n }\\r\\n else if (score == secondscore){\\r\\n AFCwest[c].ties();\\r\\n AFCwest[t].ties();\\r\\n }\\r\\n else {\\r\\n AFCwest[t].wins();\\r\\n AFCwest[c].losses();\\r\\n }\\r\\n } \\r\\n }\\r\\n for (int c=0; c < NFCeast.length;c++) {\\r\\n for (int t=c+1;t<NFCeast.length;t++) {\\r\\n score = NFCeast[c].scoregenerator();\\r\\n secondscore = NFCeast[t].scoregenerator();\\r\\n NFCeast[c].pointsfor(score);\\r\\n NFCeast[t].pointsfor(secondscore);\\r\\n\\r\\n if (score > secondscore){\\r\\n NFCeast[c].wins();\\r\\n NFCeast[t].losses();\\r\\n }\\r\\n else if (score == secondscore){\\r\\n NFCeast[c].ties();\\r\\n NFCeast[t].ties();\\r\\n }\\r\\n else {\\r\\n NFCeast[t].wins();\\r\\n NFCeast[c].losses();\\r\\n }\\r\\n } \\r\\n }\\r\\n for (int c=0; c < NFCnorth.length;c++) {\\r\\n for (int t=c+1;t<NFCnorth.length;t++) {\\r\\n score = NFCnorth[c].scoregenerator();\\r\\n secondscore = NFCnorth[t].scoregenerator();\\r\\n NFCnorth[c].pointsfor(score);\\r\\n NFCnorth[t].pointsfor(secondscore);\\r\\n\\r\\n if (score > secondscore){\\r\\n NFCnorth[c].wins();\\r\\n NFCnorth[t].losses();\\r\\n }\\r\\n else if (score == secondscore){\\r\\n NFCnorth[c].ties();\\r\\n NFCnorth[t].ties();\\r\\n }\\r\\n else {\\r\\n NFCnorth[t].wins();\\r\\n NFCnorth[c].losses();\\r\\n }\\r\\n } \\r\\n }\\r\\n for (int c=0; c < NFCsouth.length;c++) {\\r\\n for (int t=c+1;t<NFCsouth.length;t++) {\\r\\n score = NFCsouth[c].scoregenerator();\\r\\n secondscore = NFCsouth[t].scoregenerator();\\r\\n NFCsouth[c].pointsfor(score);\\r\\n NFCsouth[t].pointsfor(secondscore);\\r\\n\\r\\n if (score > secondscore){\\r\\n NFCsouth[c].wins();\\r\\n NFCsouth[t].losses();\\r\\n }\\r\\n else if (score == secondscore){\\r\\n NFCsouth[c].ties();\\r\\n NFCsouth[t].ties();\\r\\n }\\r\\n else {\\r\\n NFCsouth[t].wins();\\r\\n NFCsouth[c].losses();\\r\\n }\\r\\n } \\r\\n }\\r\\n for (int c=0; c < NFCwest.length;c++) {\\r\\n for (int t=c+1;t<NFCwest.length;t++) {\\r\\n score = NFCwest[c].scoregenerator();\\r\\n secondscore = NFCwest[t].scoregenerator();\\r\\n NFCwest[c].pointsfor(score);\\r\\n NFCwest[t].pointsfor(secondscore);\\r\\n\\r\\n if (score > secondscore){\\r\\n NFCwest[c].wins();\\r\\n NFCwest[t].losses();\\r\\n }\\r\\n else if (score == secondscore){\\r\\n NFCwest[c].ties();\\r\\n NFCwest[t].ties();\\r\\n }\\r\\n else {\\r\\n NFCwest[t].wins();\\r\\n NFCwest[c].losses();\\r\\n }\\r\\n } \\r\\n }\\r\\n\\r\\n for (int c=0;c<league.length;c++){\\r\\n System.out.println(league[c]);\\r\\n }\\r\\n System.out.println(\\\"...\\\");\\r\\n try\\r\\n {\\r\\n Thread.sleep(3000);\\r\\n }\\r\\n catch (Exception e)\\r\\n {}\\r\\n System.out.println(\\\"\\\\n\\\" + \\\"Now let the playoffs begin!\\\" + \\\"\\\\n\\\");\\r\\n\\r\\n for (int y=0;y<4;y++){ // These next groups of code are sorting each division, and each conference based on wins\\r\\n for (int p=0;p<3;p++) {\\r\\n int a = p+1;\\r\\n if (AFCeast[a].displaywins() > AFCeast[p].displaywins()){\\r\\n Temp = AFCeast[p];\\r\\n AFCeast[p] = AFCeast[a];\\r\\n AFCeast[a] = Temp;\\r\\n }\\r\\n else if (AFCeast[a].displaywins() == AFCeast[p].displaywins() && AFCeast[a].displaypf() > AFCeast[p].displaypf()){\\r\\n Temp = league[p];\\r\\n league[p] = league[a];\\r\\n league[a] = Temp;\\r\\n }\\r\\n\\r\\n }\\r\\n }\\r\\n // System.out.println(AFCeast[0]);\\r\\n\\r\\n afcplayoff[0] = AFCeast[0];\\r\\n // System.out.println(afcplayoff[0]);\\r\\n for (int y=0;y<4;y++){\\r\\n for (int p=0;p<3;p++) {\\r\\n int a = p+1;\\r\\n if (AFCnorth[a].displaywins() > AFCnorth[p].displaywins()){\\r\\n Temp = AFCnorth[p];\\r\\n AFCnorth[p] = AFCnorth[a];\\r\\n AFCnorth[a] = Temp;\\r\\n }\\r\\n else if (AFCnorth[a].displaywins() == AFCnorth[p].displaywins() && AFCnorth[a].displaypf() > AFCnorth[p].displaypf()){\\r\\n Temp = league[p];\\r\\n league[p] = league[a];\\r\\n league[a] = Temp;\\r\\n }\\r\\n\\r\\n }\\r\\n }\\r\\n\\r\\n afcplayoff[1] = AFCnorth[0];\\r\\n for (int y=0;y<4;y++){\\r\\n for (int p=0;p<3;p++) {\\r\\n int a = p+1;\\r\\n if (AFCsouth[a].displaywins() > AFCsouth[p].displaywins()){\\r\\n Temp = AFCsouth[p];\\r\\n AFCsouth[p] = AFCsouth[a];\\r\\n AFCsouth[a] = Temp;\\r\\n }\\r\\n else if (AFCsouth[a].displaywins() == AFCsouth[p].displaywins() && AFCsouth[a].displaypf() > AFCsouth[p].displaypf()){\\r\\n Temp = league[p];\\r\\n league[p] = league[a];\\r\\n league[a] = Temp;\\r\\n }\\r\\n\\r\\n }\\r\\n }\\r\\n\\r\\n afcplayoff[2] = AFCsouth[0];\\r\\n for (int y=0;y<4;y++){\\r\\n for (int p=0;p<3;p++) {\\r\\n int a = p+1;\\r\\n if (AFCwest[a].displaywins() > AFCwest[p].displaywins()){\\r\\n Temp = AFCwest[p];\\r\\n AFCwest[p] = AFCwest[a];\\r\\n AFCwest[a] = Temp;\\r\\n }\\r\\n else if (AFCwest[a].displaywins() == AFCwest[p].displaywins() && AFCwest[a].displaypf() > AFCwest[p].displaypf()){\\r\\n Temp = league[p];\\r\\n league[p] = league[a];\\r\\n league[a] = Temp;\\r\\n }\\r\\n\\r\\n }\\r\\n }\\r\\n\\r\\n afcplayoff[3] = AFCwest[0];\\r\\n for (int y=0;y<4;y++){\\r\\n for (int p=0;p<3;p++) {\\r\\n int a = p+1;\\r\\n if (NFCeast[a].displaywins() > NFCeast[p].displaywins()){\\r\\n Temp = NFCeast[p];\\r\\n NFCeast[p] = NFCeast[a];\\r\\n NFCeast[a] = Temp;\\r\\n }\\r\\n else if (NFCeast[a].displaywins() == NFCeast[p].displaywins() && NFCeast[a].displaypf() > NFCeast[p].displaypf()){\\r\\n Temp = league[p];\\r\\n league[p] = league[a];\\r\\n league[a] = Temp;\\r\\n }\\r\\n\\r\\n }\\r\\n }\\r\\n nfcplayoff[0] = NFCeast[0];\\r\\n for (int y=0;y<4;y++){\\r\\n for (int p=0;p<3;p++) {\\r\\n int a = p+1;\\r\\n if (NFCnorth[a].displaywins() > NFCnorth[p].displaywins()){\\r\\n Temp = NFCnorth[p];\\r\\n NFCnorth[p] = NFCnorth[a];\\r\\n NFCnorth[a] = Temp;\\r\\n }\\r\\n else if (NFCnorth[a].displaywins() == NFCnorth[p].displaywins() && NFCnorth[a].displaypf() > NFCnorth[p].displaypf()){\\r\\n Temp = league[p];\\r\\n league[p] = league[a];\\r\\n league[a] = Temp;\\r\\n }\\r\\n\\r\\n }\\r\\n }\\r\\n nfcplayoff[1] = NFCnorth[0];\\r\\n for (int y=0;y<4;y++){\\r\\n for (int p=0;p<3;p++) {\\r\\n int a = p+1;\\r\\n if (NFCsouth[a].displaywins() > NFCsouth[p].displaywins()){\\r\\n Temp = NFCsouth[p];\\r\\n NFCsouth[p] = NFCsouth[a];\\r\\n NFCsouth[a] = Temp;\\r\\n }\\r\\n else if (NFCsouth[a].displaywins() == NFCsouth[p].displaywins() && NFCsouth[a].displaypf() > NFCsouth[p].displaypf()){\\r\\n Temp = league[p];\\r\\n league[p] = league[a];\\r\\n league[a] = Temp;\\r\\n }\\r\\n\\r\\n }\\r\\n }\\r\\n nfcplayoff[2] = NFCsouth[0];\\r\\n for (int y=0;y<4;y++){\\r\\n for (int p=0;p<3;p++) {\\r\\n int a = p+1;\\r\\n if (NFCwest[a].displaywins() > NFCwest[p].displaywins()){\\r\\n Temp = NFCwest[p];\\r\\n NFCwest[p] = NFCwest[a];\\r\\n NFCwest[a] = Temp;\\r\\n }\\r\\n else if (NFCwest[a].displaywins() == NFCwest[p].displaywins() && NFCwest[a].displaypf() > NFCwest[p].displaypf()){\\r\\n Temp = league[p];\\r\\n league[p] = league[a];\\r\\n league[a] = Temp;\\r\\n }\\r\\n\\r\\n }\\r\\n }\\r\\n nfcplayoff[3] = NFCwest[0];\\r\\n for (int y=0;y<16;y++){\\r\\n for (int p=0;p<15;p++) {\\r\\n int a = p+1;\\r\\n if (AFC[a].displaywins() > AFC[p].displaywins()){\\r\\n Temp = AFC[p];\\r\\n AFC[p] = AFC[a];\\r\\n AFC[a] = Temp;\\r\\n }\\r\\n else if (AFC[a].displaywins() == AFC[p].displaywins() && AFC[a].displaypf() > AFC[p].displaypf()){\\r\\n Temp = AFC[p];\\r\\n AFC[p] = AFC[a];\\r\\n AFC[a] = Temp;\\r\\n }\\r\\n\\r\\n }\\r\\n }\\r\\n for (int y=0;y<16;y++){\\r\\n for (int p=0;p<15;p++) {\\r\\n int a = p+1;\\r\\n if (NFC[a].displaywins() > NFC[p].displaywins()){\\r\\n Temp = NFC[p];\\r\\n NFC[p] = NFC[a];\\r\\n NFC[a] = Temp;\\r\\n }\\r\\n else if (NFC[a].displaywins() == NFC[p].displaywins() && NFC[a].displaypf() > NFC[p].displaypf()){\\r\\n Temp = NFC[p];\\r\\n NFC[p] = NFC[a];\\r\\n NFC[a] = Temp;\\r\\n }\\r\\n\\r\\n }\\r\\n }\\r\\n\\r\\n int maxw=0;\\r\\n\\r\\n for (int x=0;x<AFC.length;x++){\\r\\n\\r\\n if ((AFC[x].displaywins() > maxw) && \\r\\n (AFC[x].getName() != afcplayoff[0].getName()) && \\r\\n (AFC[x].getName() != afcplayoff[1].getName()) && \\r\\n (AFC[x].getName() != afcplayoff[2].getName()) && \\r\\n (AFC[x].getName() != afcplayoff[3].getName()) && \\r\\n (AFC[x].getName() != afcplayoff[4].getName()) && \\r\\n (AFC[x].getName() != afcplayoff[5].getName())){\\r\\n maxw = AFC[x].displaywins();\\r\\n afcplayoff[4] = AFC[x]; \\r\\n }\\r\\n\\r\\n }\\r\\n\\r\\n maxw=0;\\r\\n for (int x=0;x<AFC.length;x++){\\r\\n\\r\\n if (AFC[x].displaywins() > maxw && \\r\\n AFC[x].getName() != afcplayoff[0].getName() && \\r\\n AFC[x].getName() != afcplayoff[1].getName() && \\r\\n AFC[x].getName() != afcplayoff[2].getName() && \\r\\n AFC[x].getName() != afcplayoff[3].getName() && \\r\\n AFC[x].getName() != afcplayoff[4].getName() && \\r\\n AFC[x].getName() != afcplayoff[5].getName()){\\r\\n maxw = AFC[x].displaywins();\\r\\n afcplayoff[5] = AFC[x]; \\r\\n }\\r\\n }\\r\\n\\r\\n maxw=0;\\r\\n for (int x=0;x<NFC.length;x++){\\r\\n if (NFC[x].displaywins() > maxw && \\r\\n NFC[x].getName() != nfcplayoff[0].getName() && \\r\\n NFC[x].getName() != nfcplayoff[1].getName() && \\r\\n NFC[x].getName() != nfcplayoff[2].getName() && \\r\\n NFC[x].getName() != nfcplayoff[3].getName() && \\r\\n NFC[x].getName() != nfcplayoff[4].getName() && \\r\\n NFC[x].getName() != nfcplayoff[5].getName()){\\r\\n maxw = NFC[x].displaywins();\\r\\n nfcplayoff[4] = NFC[x]; \\r\\n }\\r\\n }\\r\\n maxw=0;\\r\\n for (int x=0;x<NFC.length;x++){\\r\\n\\r\\n if (NFC[x].displaywins() > maxw && \\r\\n NFC[x].getName() != nfcplayoff[0].getName() && \\r\\n NFC[x].getName() != nfcplayoff[1].getName() && \\r\\n NFC[x].getName() != nfcplayoff[2].getName() && \\r\\n NFC[x].getName() != nfcplayoff[3].getName() && \\r\\n NFC[x].getName() != nfcplayoff[4].getName() && \\r\\n NFC[x].getName() != nfcplayoff[5].getName()){\\r\\n maxw = NFC[x].displaywins();\\r\\n nfcplayoff[5] = NFC[x]; \\r\\n }\\r\\n }\\r\\n\\r\\n for (int y=0;y<4;y++){\\r\\n for (int p=0;p<3;p++) {\\r\\n int a = p+1;\\r\\n if (afcplayoff[a].displaywins() > afcplayoff[p].displaywins()){\\r\\n Temp = afcplayoff[p];\\r\\n afcplayoff[p] = afcplayoff[a];\\r\\n afcplayoff[a] = Temp;\\r\\n }\\r\\n else if (afcplayoff[a].displaywins() == afcplayoff[p].displaywins() && afcplayoff[a].displaypf() > afcplayoff[p].displaypf()){\\r\\n Temp = afcplayoff[p];\\r\\n afcplayoff[p] = afcplayoff[a];\\r\\n afcplayoff[a] = Temp;\\r\\n }\\r\\n\\r\\n }\\r\\n }\\r\\n for (int c=0;c<afcplayoff.length;c++){ // Testing to see if users team made the playoffs.\\r\\n if(YourTeam.getName().equals(afcplayoff[c].getName()))\\r\\n afcplayofft = true;\\r\\n }\\r\\n\\r\\n for (int y=0;y<4;y++){\\r\\n for (int r=0;r<3;r++) {\\r\\n int c = r+1;\\r\\n if (nfcplayoff[c].displaywins() > nfcplayoff[r].displaywins()){\\r\\n Temp = nfcplayoff[r];\\r\\n nfcplayoff[r] = nfcplayoff[c];\\r\\n nfcplayoff[c] = Temp;\\r\\n }\\r\\n else if (nfcplayoff[c].displaywins() == nfcplayoff[r].displaywins() && nfcplayoff[c].displaypf() > nfcplayoff[r].displaypf()){\\r\\n Temp = nfcplayoff[r];\\r\\n nfcplayoff[r] = nfcplayoff[c];\\r\\n nfcplayoff[c] = Temp;\\r\\n }\\r\\n\\r\\n }\\r\\n }\\r\\n for (int c=0;c<nfcplayoff.length;c++){\\r\\n if(YourTeam.getName().equals(nfcplayoff[c].getName()))\\r\\n nfcplayofft = true;\\r\\n }\\r\\n // This shows how the playoffs will look like to the user\\r\\n System.out.println(\\\"...\\\" + \\\"\\\\n\\\" + \\\"Based on the regular season, here is what the first round of playoffs will look like:\\\" + \\\"\\\\n\\\");\\r\\n try\\r\\n {\\r\\n Thread.sleep(3000);\\r\\n }\\r\\n catch (Exception e)\\r\\n {}\\r\\n System.out.println(afcplayoff[0].getName() + \\\" got a bye in the first round of the playoffs for placing first in the afc.\\\");\\r\\n System.out.println(afcplayoff[1].getName() + \\\" also got a bye in the first round of the playoffs for placing second in the afc.\\\" + \\\"\\\\n\\\");\\r\\n System.out.println(nfcplayoff[0].getName() + \\\" got a bye in the first round of the playoffs for placing first in the nfc.\\\");\\r\\n System.out.println(nfcplayoff[1].getName() + \\\" also got a bye in the first round of the playoffs for placing second in the nfc.\\\" + \\\"\\\\n\\\");\\r\\n\\r\\n System.out.println(afcplayoff[2].getName());\\r\\n System.out.println(\\\" \\\\\\\\-----\\\\\\\\\\\");\\r\\n System.out.println(\\\" ) Winner moves on to play the \\\" + afcplayoff[0].getName());\\r\\n System.out.println(\\\" /-----/\\\");\\r\\n System.out.println(afcplayoff[5].getName() + \\\"\\\\n\\\");\\r\\n\\r\\n System.out.println(afcplayoff[3].getName());\\r\\n System.out.println(\\\" \\\\\\\\-----\\\\\\\\\\\");\\r\\n System.out.println(\\\" ) Winner moves onto play the \\\"+ afcplayoff[1].getName());\\r\\n System.out.println(\\\" /-----/\\\");\\r\\n System.out.println(afcplayoff[4].getName() + \\\"\\\\n\\\");\\r\\n\\r\\n System.out.println(nfcplayoff[2].getName());\\r\\n System.out.println(\\\" \\\\\\\\-----\\\\\\\\\\\");\\r\\n System.out.println(\\\" ) Winner moves onto play the \\\"+ nfcplayoff[0].getName());\\r\\n System.out.println(\\\" /-----/\\\");\\r\\n System.out.println(nfcplayoff[5].getName() + \\\"\\\\n\\\");\\r\\n\\r\\n System.out.println(nfcplayoff[3].getName());\\r\\n System.out.println(\\\" \\\\\\\\-----\\\\\\\\\\\");\\r\\n System.out.println(\\\" ) Winner moves onto play the \\\"+ nfcplayoff[1].getName());\\r\\n System.out.println(\\\" /-----/\\\");\\r\\n System.out.println(nfcplayoff[4].getName() + \\\"\\\\n\\\");\\r\\n\\r\\n System.out.println(\\\"...\\\"+ \\\"\\\\n\\\");\\r\\n\\r\\n try\\r\\n {\\r\\n Thread.sleep(3000);\\r\\n }\\r\\n catch (Exception e)\\r\\n\\r\\n {}\\r\\n }\",\n \"public static void checkConsistency(){\\n double[] aNormalW=new double[numberOfObjectives];\\n double randomIndex=0;\\n double sum=0;\\n for (int row=0;row<numberOfObjectives;row++){\\n for (int column=0;column<numberOfObjectives;column++){\\n\\n sum+=weights[column]*objectives[row][column];\\n }\\n df.setRoundingMode(RoundingMode.UP);\\n aNormalW[row]= Double.valueOf(df.format(sum));\\n sum=0;\\n }\\n double awtDividedByWt=0;\\n for (int i=0;i<numberOfObjectives;i++){\\n awtDividedByWt+=aNormalW[i]/weights[i];\\n decimalFormat.setRoundingMode(RoundingMode.HALF_UP);\\n Double.valueOf(decimalFormat.format(awtDividedByWt));\\n }\\n double reciprocalNumber=(double) 1/numberOfObjectives;\\n decimalFormat.setRoundingMode(RoundingMode.UP);\\n Double.valueOf(decimalFormat.format(reciprocalNumber));\\n double step3=reciprocalNumber*awtDividedByWt;\\n decimalFormat.setRoundingMode(RoundingMode.UP);\\n double numerator=Double.valueOf(decimalFormat.format(step3))-numberOfObjectives;\\n double denominator=numberOfObjectives-1;\\n decimalFormat.setRoundingMode(RoundingMode.UP);\\n double ci=Double.valueOf(decimalFormat.format(numerator)) /denominator;\\n decimalFormat.setRoundingMode(RoundingMode.CEILING);\\n System.out.println(\\\"Consistency Index (CI)= \\\"+Double.valueOf(decimalFormat.format(ci)));\\n System.out.println();\\n double ciDividedByRI=ci/table23(numberOfObjectives);\\n decimalFormat.setRoundingMode(RoundingMode.UP);\\n // Double.valueOf(df.format(ciDividedByRI));\\n if (ciDividedByRI<0.10){\\n randomIndex=ci/table23(numberOfObjectives);\\n decimalFormat.setRoundingMode(RoundingMode.UP);\\n System.out.println(\\\"Random Index (RI)= \\\"+Double.valueOf(decimalFormat.format(randomIndex)));\\n System.out.println(\\\"degree of consistency is satisfactory !!\\\");\\n }else {\\n System.out.println(\\\"the AHP may not yield meaningful results !!\\\");\\n }\\n System.out.println();\\n }\",\n \"int compteMonstres(Soldat unites[][]);\",\n \"public abstract NSMutableArray<I_WorkFlowItem> tachesObligatoires();\",\n \"public static void main(String[] args) {\\n int l1=1000, l2=1000;\\n int[] a1=new int[l1];\\n int[] a2=new int[l2];\\n int[] combine = new int[l1+l2];\\n\\n Random r = new Random();\\n for (int i=0; i<a1.length; ++i){\\n a1[i]=r.nextInt(a1.length*3);\\n combine[i]=a1[i];\\n }\\n\\n for (int i=0; i<a2.length; ++i){\\n a2[i]=r.nextInt(a2.length*3);\\n combine[l1+i]=a2[i];\\n }\\n\\n Arrays.sort(a1);\\n Arrays.sort(a2);\\n Arrays.sort(combine);\\n\\n cnt=0;\\n int m = findByRank(a1, 0, a1.length, a2, 0, a2.length, (a1.length+a2.length)/2);\\n int m2 = combine[combine.length/2-1];\\n\\n System.out.printf(\\\"m=%d, m2=%d, cnt=%d\\\", m, m2, cnt);\\n\\n\\n\\n }\",\n \"private static int[] getTimesTable(int requiredSize, int requiredNumber) \\n\\t{\\n\\t\\t// local array for the loop to amend and then return\\n\\t\\tint [] timesArray = new int [requiredSize];\\n\\t\\n\\t\\tfor (int i = 1; i <= requiredSize; i++)\\n\\t\\t{\\n\\t\\t\\t// amends the local timesArray array\\n\\t\\t\\ttimesArray[i -1] = requiredNumber * i; \\n\\t\\t\\t//System.out.println(timesArray[i -1] = requiredNumber * i); // testing purposes so you can see the value before ammending the array\\n\\t\\t}\\n\\t\\t\\n\\t\\t// returns local array as result for the main method array\\n\\t\\treturn timesArray;\\n\\t}\",\n \"public static void main(String[] args)\\n\\t{\\n \\n\\t\\tSystem.out.println(\\\"Enter the size of transaction array\\\");\\n int trSize = sc.nextInt();\\n\\n // creating an array of provided size\\n int[] transactions = new int[trSize];\\n \\n // get the elements of the array (in a loop)\\n System.out.println(\\\"Enter the values of array\\\");\\n for (int i = 0; i < transactions.length; i++) {\\n transactions[i] = sc.nextInt();\\n }\\n // get the number of targets\\n System.out.println(\\\"Enter the total no of targets that needs to be achieved\\\");\\n int numTargets = sc.nextInt();\\n \\n // get in target one-by-one (loop)\\n for (int i = 0; i < numTargets; i++) {\\n \\n \\t// Get TargetValue\\n System.out.println(\\\"Enter the value of target\\\");\\n int target = sc.nextInt();\\n \\n int sum =0;\\n for ( int j=0; j < transactions.length; j++) {\\n \\tsum = sum + transactions[j];\\n \\t\\n \\tif ( sum >= target) {\\n \\tSystem.out.println(\\\"Target achieved after \\\" + (j+1) + \\\" transactions\\\" );\\n \\tbreak; // break out of the innermost for loop\\n \\t}\\n \\t\\n \\t//we come to the last transactions, yet target is not achieved\\n \\tif (j == transactions.length - 1) {\\n \\t\\tSystem.out.println( \\\"Given target is not achieved\\\");\\n \\t}\\n \\t\\n }\\n \\n \\n\\t}\\n\\n}\",\n \"private void cpu_jogada(){\\n\\n for(i=0;i<8;i++){\\n for(j=0;j<8;j++){\\n if(matriz[i][j] == jd2){\\n // verificarAtaque(i,j,jd2);\\n //verificarAtaque as posssibilidades de\\n // ataque : defesa : aleatorio\\n //ataque tem prioridade 1 - ve se tem como comer quem ataca\\n //defesa tem prioridade 2 - ou movimenta a peca que esta sob ataque ou movimenta a outa para ajudar\\n //aleatorio nao tem prioridade -- caso nao esteja sob ataque ou defesa\\n }\\n }\\n }\\n }\",\n \"public int[] twoSum2(int[] nums, int target) {\\n int max = nums[0];\\n int min = max;\\n // get rank\\n for (int e : nums) {\\n if (e > max) {\\n max = e;\\n }\\n if (e < min) {\\n min = e;\\n }\\n }\\n // show up table\\n Integer[] showUpMap = new Integer[max - min + 1];\\n LinkedList[] indicesMap = new LinkedList[max - min + 1];\\n for (int i = 0; i < nums.length; i++) {\\n showUpMap[nums[i] - min] = 1;\\n if (indicesMap[nums[i] - min] == null) {\\n indicesMap[nums[i] - min] = new LinkedList<Integer>();\\n }\\n indicesMap[nums[i] - min].add(i);\\n }\\n System.out.println(Arrays.toString(showUpMap));\\n System.out.println(Arrays.toString(indicesMap));\\n for (int i = 0; i < showUpMap.length; i++) {\\n boolean show = showUpMap[i] != null;\\n if (show) {\\n int a = i + min;\\n int need = target - a;\\n if (need - min < showUpMap.length &&\\n showUpMap[need - min] != null) {\\n int ai = (int) indicesMap[i].get(0);\\n int bi = (int) indicesMap[need - min].get(0);\\n if (ai == bi) {\\n bi = (int) indicesMap[need - min].get(1);\\n }\\n return new int[]{ai, bi};\\n }\\n }\\n }\\n return null;\\n }\",\n \"double calculateGLBasicMass(int i1, int i2, int i3)\\n {\\n\\n // Array of Glycerolipid's num of Carbon, Hydrogen repeated (for SN1 Dropdown Menu's values)\\n int[] arrayGL_sn1 = {\\n 5,10, 7,14, 9,18, 11,22, 13,26, 15,30, 16,32, 17,34,\\n 17,32, 18,36, 18,34, 19,40, 19,38, 19,38, 19,36, 20,40,\\n 20,38, 20,36, 21,44, 21,42, 21,42, 21,40, 21,40, 21,38,\\n 21,36, 21,36, 21,34, 22,44, 23,48, 23,46, 23,46, 23,44,\\n 23,42, 23,40, 23,38, 23,36, 24,48, 25,50, 25,48, 25,46,\\n 25,44, 25,42, 25,40, 25,38, 26,52, 27,54, 27,52, 28,56, 29,58};\\n\\n // addCarbon array: Amount of increase in Carbon when on certain sn2 & sn3 index position\\n int[] addCarbon = {\\n 0, 2, 4, 6, 8, 10, 12, 13, 14, 14, 15, 15, 16, 16, 17, 17, 17,\\n 18, 18, 18, 18, 18, 18, 18, 19, 20, 20, 20, 20,\\t20,\\t20, 21, 22,\\n 22,\\t22,\\t22,\\t22, 22, 22, 23, 24, 24, 25, 26 };\\n\\n // addHydrogen array: Amount of increase in Hydrogen when on certain sn2 & sn3 index position\\n int[] addHydrogen = {\\n 0, 2, 6, 10, 14, 18, 22, 24, 26, 24, 28, 26, 30, 28, 32, 30, 28,\\n 34,\\t32,\\t32,\\t30,\\t28,\\t28,\\t26,\\t36,\\t38,\\t36,\\t34,\\t32,\\t30,\\t28,\\t40,\\t42,\\n 40,\\t38,\\t36,\\t34,\\t32,\\t30,\\t44,\\t46,\\t44,\\t48,\\t50 };\\n\\n // Get the # of C & H depending on the index position of SN1's dropdown menu\\n int numOfC = arrayGL_sn1[i1 * 2], numOfH = arrayGL_sn1[i1 * 2 + 1];\\n\\n // Add carbon & hydrogen depending on SN2 and SN3 dropdown menu's index position\\n numOfC = numOfC + addCarbon[i2] + addCarbon[i3];\\n numOfH = numOfH + addHydrogen[i2] + addHydrogen[i3];\\n\\n /* Set Number of Carbon & Hydrogen */\\n setNumC(numOfC); setNumH(numOfH);\\n\\n /* Set Number of Oxygen */\\n\\n // If SN1 Dropdown index is not O or P\\n if (i1 != 11 && i1 != 12 && i1 != 18 && i1 != 19 && i1 != 28 && i1 != 29) {\\n\\n if (i2 == 0 && i3 == 0){ setNumO(4); }\\n else if (i2 == 0 || i3 == 0) { setNumO(5); }\\n else setNumO(6);\\n\\n // If SN1 Dropdown index is O or P\\n } else {\\n\\n if (i2 == 0 && i3 == 0){ setNumO(3); }\\n else if (i2 == 0 || i3 == 0) { setNumO(4); }\\n else setNumO(5);\\n }\\n\\n // Sets the basic mass based on the elemental composition of the monoisotopic distribution\\n setMass(calculateInitialMass(getNumC(), getNumH(), getNumO(), getNumN(), getNumAg(),\\n getNumLi(), getNumNa(), getNumK(), getNumCl(), getNumP(), getNumS(), getNumF()));\\n\\n // Return basic mass\\n return getMass();\\n }\",\n \"public static int zeroOneKnapsack(int[] weight, int[] value, int capacity) {\\n\\t\\tint[][] dp = new int[weight.length + 1][capacity + 1];\\n\\n\\t\\tfor (int i = 0; i < weight.length + 1 ; i++) {\\n\\t\\t\\t for (int j = 0; j < capacity + 1; j++) {\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t // base condition for memoization\\n\\t\\t\\t\\t // first row and first column for 2d matrix is initialised to 0\\n\\t\\t\\t\\t // profit = 0 when number of items = 0 or bag capacity = 0 \\n\\t\\t\\t\\t if (i == 0 || j == 0) { \\n\\t\\t\\t\\t\\t dp[i][j] = 0;\\n\\t\\t\\t\\t } \\n\\t\\t\\t\\t \\n\\t\\t\\t\\t // weight of item under consideration is less than capacity of bag\\n\\t\\t\\t\\t // value of i in 2d matrix corresponds to (i-1)th element in weight and value arrays\\n\\t\\t\\t\\t // hence, weight(i-1) is compared with the corresponding matrix cell capacity(i.e.column)\\n\\t\\t\\t\\t \\n\\t\\t\\t\\t else if (weight[i-1] <= j){\\n\\t\\t\\t\\t\\t \\n\\t\\t\\t\\t\\t // possibility 1: when item having weight(i-1) is added to bag\\n\\t\\t\\t\\t\\t // item having weight(i-1) has value(i-1)\\n\\t\\t\\t\\t\\t // this value added to array value for (i-1)th row and (j-weight[i-1])th column\\n\\t\\t\\t\\t\\t // because :\\n\\t\\t\\t\\t\\t // 1) the total capacity reduced by weight(i-1) after deciding item inclusion\\n\\t\\t\\t\\t\\t // 2) total no.of elements reduced by 1 after deciding item inclusion\\n\\t\\t\\t\\t\\t \\n\\t\\t\\t\\t\\t int a = value[i-1] + dp[i-1][j-weight[i-1]];\\n\\t\\t\\t\\t\\t \\n\\t\\t\\t\\t\\t// possibility 1: when item having weight(i-1) is not added to bag\\n\\t\\t\\t\\t\\t// 1) the total capacity remains as is after deciding item exclusion\\n\\t\\t\\t\\t\\t// 2) total no.of elements reduced by 1 after deciding item exclusion\\n\\t\\t\\t\\t\\t \\n\\t\\t\\t\\t\\t int b = dp[i-1][j];\\n\\t\\t\\t\\t\\t \\n\\t\\t\\t\\t\\t // max of a and b taken to find maximum profit value \\n\\t\\t\\t\\t\\t dp[i][j] = Math.max(a, b);\\t \\n\\t\\t\\t\\t\\t \\n\\t\\t\\t\\t }\\n\\t\\t\\t\\t \\n\\t\\t\\t\\t \\n\\t\\t\\t\\t // weight of item under consideration is more than capacity of bag\\n\\t\\t\\t\\t // hence item having weight(i-1) is not added to bag\\n\\t\\t\\t\\t else {\\n\\t\\t\\t\\t\\t \\n\\t\\t\\t\\t\\t// 1) the total capacity remains as is after deciding item exclusion\\n\\t\\t\\t\\t\\t// 2) total no.of elements reduced by 1 after deciding item exclusion\\n\\t\\t\\t\\t\\t \\n\\t\\t\\t\\t\\t dp[i][j] = dp[i-1][j];\\n\\t\\t\\t\\t\\t \\n\\t\\t\\t\\t }\\n\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn dp[weight.length][capacity];\\n\\t\\t\\n\\t}\",\n \"@Test\\n public void testBuildGraph_FactorArr_booleanArrArr() {\\n\\n char[][] adjacency = new char[][]{\\n {0, 0, 0, 0, 0, 0, 0, 1, 0, 0},\\n {0, 0, 0, 0, 0, 0, 0, 0, 0, 0},\\n {0, 1, 0, 0, 0, 0, 0, 0, 0, 0},\\n {0, 0, 1, 0, 0, 0, 0, 0, 0, 0},\\n {0, 0, 0, 1, 0, 0, 0, 0, 0, 0},\\n {0, 0, 0, 0, 0, 0, 1, 0, 0, 0},\\n {1, 0, 0, 0, 0, 0, 0, 0, 0, 0},\\n {0, 0, 0, 0, 1, 0, 0, 0, 0, 0},\\n {0, 0, 0, 0, 0, 1, 0, 0, 0, 0},\\n {0, 0, 0, 0, 0, 0, 0, 0, 1, 0},\\n };\\n\\n CostFunction[][] factors = new CostFunction[][]{\\n {factory.buildCostFunction( new Variable[]{v[0],v[7]}, 0 )},\\n {},\\n {factory.buildCostFunction( new Variable[]{v[1],v[2]}, 0 )},\\n {factory.buildCostFunction( new Variable[]{v[2],v[3]}, 0 )},\\n {factory.buildCostFunction( new Variable[]{v[3],v[4]}, 0 ),\\n factory.buildCostFunction( new Variable[]{v[1],v[3],v[4]}, 0 )},\\n {factory.buildCostFunction( new Variable[]{v[1],v[5]}, 0 )},\\n {factory.buildCostFunction( new Variable[]{v[2],v[6]}, 0 ),\\n factory.buildCostFunction( new Variable[]{v[1],v[6],v[7]}, 0 ),\\n factory.buildCostFunction( new Variable[]{v[0],v[6]}, 0 )},\\n {factory.buildCostFunction( new Variable[]{v[3],v[7]}, 0 )},\\n {factory.buildCostFunction( new Variable[]{v[4],v[8]}, 0 ),\\n factory.buildCostFunction( new Variable[]{v[5],v[8]}, 0 ),\\n factory.buildCostFunction( new Variable[]{v[0],v[8]}, 0 )},\\n {factory.buildCostFunction( new Variable[]{v[2],v[5],v[9]}, 0 ),\\n factory.buildCostFunction( new Variable[]{v[5],v[6],v[9]}, 0 ),\\n factory.buildCostFunction( new Variable[]{v[4],v[7],v[9]}, 0 ),\\n factory.buildCostFunction( new Variable[]{v[0],v[8],v[9]}, 0 )},\\n };\\n\\n GdlFactory gf = new GdlFactory();\\n UPGraph result = JunctionTreeAlgo.buildGraph(gf, factors, adjacency);\\n //System.out.println(result);\\n }\",\n \"int countSusbset(int n, int w){\\n int dp[][] = new int[n+1][w+1];\\n for(int i=0;i<=n;i++){\\n for(int j=0;j<=w;j++){\\n //when no items are there and target sum is 0, only one empty subset is possible\\n if(i == 0 && j == 0){\\n dp[i][j] = 1;\\n }\\n //no items left and target sum is greater than 0, no set is possible\\n else if(i == 0 && j > 0){\\n dp[i][j] = 0; \\n }\\n //if target sum is 0, no matter how many items we have , only one empty subset is possible\\n else if(j == 0){\\n dp[i][j] = 1;\\n }\\n //since item > target sum, so exclude\\n else if(arr[i-1] > j){\\n dp[i][j] = dp[i-1][j];\\n }else{\\n //two cases include and exclude\\n dp[i][j] = dp[i-1][j] + dp[i-1][j - arr[i-1]];\\n }\\n }\\n }\\n return dp[n][w];\\n}\",\n \"@SuppressWarnings(\\\"boxing\\\")\\n public int[] getMatching() {\\n if (this.n == -1 || this.m == -1) {\\n throw new IllegalStateException(\\\"Graph size not specified.\\\");\\n }\\n if (this.n == 0) {\\n return new int[0];\\n }\\n ensurePositiveWeights();\\n\\n // Step 0: Initialization\\n this.eligibleS.clear();\\n this.eligibleT.clear();\\n for (Integer i = 0; i < this.n; i++) {\\n this.sMatches[i] = -1;\\n\\n this.u[i] = this.maxWeight; // ambiguous on p. 205 of Lawler, but see p. 202\\n\\n // this is really first run of Step 1.0\\n this.sLabels[i] = EMPTY_LABEL;\\n this.eligibleS.add(i);\\n }\\n\\n for (int j = 0; j < this.m; j++) {\\n this.tMatches[j] = -1;\\n\\n this.v[j] = 0;\\n this.pi[j] = Double.POSITIVE_INFINITY;\\n\\n // this is really first run of Step 1.0\\n this.tLabels[j] = NO_LABEL;\\n }\\n\\n while (true) {\\n // Augment the matching until we can't augment any more given the\\n // current settings of the dual variables.\\n while (true) {\\n // Steps 1.1-1.4: Find an augmenting path\\n int lastNode = findAugmentingPath();\\n if (lastNode == -1) {\\n break; // no augmenting path\\n }\\n\\n // Step 2: Augmentation\\n flipPath(lastNode);\\n for (int i = 0; i < this.n; i++)\\n this.sLabels[i] = NO_LABEL;\\n\\n for (int j = 0; j < this.m; j++) {\\n this.pi[j] = Double.POSITIVE_INFINITY;\\n this.tLabels[j] = NO_LABEL;\\n }\\n\\n // This is Step 1.0\\n this.eligibleS.clear();\\n for (int i = 0; i < this.n; i++) {\\n if (this.sMatches[i] == -1) {\\n this.sLabels[i] = EMPTY_LABEL;\\n this.eligibleS.add(i);\\n }\\n }\\n\\n this.eligibleT.clear();\\n }\\n\\n // Step 3: Change the dual variables\\n\\n // delta1 = min_i u[i]\\n double delta1 = Double.POSITIVE_INFINITY;\\n for (int i = 0; i < this.n; i++) {\\n if (this.u[i] < delta1) {\\n delta1 = this.u[i];\\n }\\n }\\n\\n // delta2 = min_{j : pi[j] > 0} pi[j]\\n double delta2 = Double.POSITIVE_INFINITY;\\n for (int j = 0; j < this.m; j++) {\\n if ((this.pi[j] >= TOL) && (this.pi[j] < delta2)) {\\n delta2 = this.pi[j];\\n }\\n }\\n\\n if (delta1 < delta2) {\\n // In order to make another pi[j] equal 0, we'd need to\\n // make some u[i] negative.\\n break; // we have a maximum-weight matching\\n }\\n\\n changeDualVars(delta2);\\n }\\n\\n int[] matching = new int[this.n];\\n for (int i = 0; i < this.n; i++) {\\n matching[i] = this.sMatches[i];\\n }\\n return matching;\\n }\",\n \"public static void knapsackDynamicProgramming(objects[] items, int capacity, int n) \\r\\n { \\r\\n\\t\\t//use bubble sort to sort item by their weight\\t\\t\\t\\t\\r\\n\\t\\tfor (int i = 0; i < n-1; i++) \\t\\t\\t\\t\\r\\n\\t\\t{ \\t\\t \\r\\n\\t\\t\\tfor (int j = 0; j < (n-i-1); j++) \\t\\t \\r\\n\\t\\t\\t{\\t\\t \\r\\n\\t\\t\\t\\tif (items[j].weight < items[j+1].weight) \\t\\t \\r\\n\\t\\t\\t\\t{ \\t\\t \\t\\r\\n\\t\\t\\t\\t\\tobjects temp = items[j]; \\t\\t \\r\\n\\t\\t\\t\\t\\titems[j] = items[j+1]; \\t\\t \\r\\n\\t\\t\\t\\t\\titems[j+1] = temp; \\t\\t \\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t}\\t\\t \\r\\n\\t\\t\\t}\\t\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n \\tif(n <= 0 || capacity <= 0)\\r\\n \\t{\\r\\n \\t\\tSystem.out.print(\\\"Error capacity and object numbers can't be 0\\\");\\r\\n \\t}\\r\\n \\r\\n \\tint matrixTable[][] = new int[n+1][capacity+1]; \\r\\n \\r\\n \\tfor (int i = 0; i <= n; i++) \\r\\n \\t{ \\r\\n \\t\\tfor (int j = 0; j <= capacity; j++) \\r\\n \\t\\t{ \\r\\n \\t\\t\\t//Preset row 0 value and column value to 0\\r\\n \\t\\t\\tif (i==0 || j==0) \\r\\n \\t {\\r\\n \\t\\t\\t\\tmatrixTable[i][j] = 0; \\r\\n \\t }\\r\\n \\r\\n \\t\\t\\t//If current row number is greater than current weight number\\r\\n \\t\\t\\telse if (items[i-1].weight <= j) \\r\\n \\t\\t\\t{\\r\\n \\t\\t\\t\\t//Compare the top value with top value plus value(use weight as the value to go left)result\\r\\n \\t\\t\\t\\t//and use the greatest value for the current one.\\r\\n \\t\\t\\t\\tmatrixTable[i][j] = Math.max(items[i-1].profit + matrixTable[i-1][j-items[i-1].weight], matrixTable[i-1][j]); \\r\\n \\t\\t\\t}\\r\\n \\t\\t\\t//If row number is less than current weight number just use the top value\\r\\n \\t\\t\\telse \\r\\n \\t\\t\\t{ \\t \\r\\n \\t\\t\\t\\tmatrixTable[i][j] = matrixTable[i-1][j];\\r\\n \\t\\t\\t}\\r\\n \\t\\t} \\t\\r\\n \\t} \\r\\n \\t\\r\\n\\t\\tint totalProfit = matrixTable[n][capacity]; \\t\\t\\r\\n\\t\\tint temp = matrixTable[n][capacity];\\r\\n\\t\\tint [] itemInKnapsack = new int [n];\\r\\n\\t\\t\\r\\n\\t\\t//solving which item is in the knapsack\\r\\n for (int i = n; i > 0 && temp > 0; i--) { \\r\\n \\r\\n \\r\\n \\tif (temp == matrixTable[i - 1][capacity]) \\r\\n \\t{\\r\\n continue;\\r\\n \\t}\\r\\n \\t//if the top value is different than it is include in the knapsack\\r\\n else \\r\\n { \\r\\n itemInKnapsack[i-1] = items[i-1].index; //Save item number\\r\\n temp = temp - items[i - 1].profit; \\r\\n capacity = capacity - items[i - 1].weight; \\r\\n } \\r\\n } \\r\\n \\r\\n printResult(itemInKnapsack, totalProfit, 2); //Call print result\\r\\n }\",\n \"public static int[] mucScore(LeanDocument key, LeanDocument response)\\n{\\n // System.out.println(\\\"==========================================================\\\");\\n // System.out.println(\\\"Key:\\\\n\\\"+key.toStringNoSing()+\\\"\\\\n*************************\\\\nResponse:\\\\n\\\"+response.toStringNoSing());\\n\\n Iterator<TreeMap<Integer, Integer>> goldChains = key.chainIterator();\\n // double mucRecall = 0.0;\\n int mucRecallNom = 0;\\n int mucRecallDenom = 0;\\n while (goldChains.hasNext()) {\\n TreeMap<Integer, Integer> keyChain = goldChains.next();\\n if (keyChain.size() > 1) {\\n int numInt = numIntersect(key, keyChain, response);\\n\\n // int numMatched = getNumMatched(key, keyChain);\\n // if(numMatched>0){\\n // mucRecallNom += numMatched-numInt;\\n mucRecallNom += (keyChain.size() - numInt);\\n // mucRecallDenom += numMatched-1;\\n mucRecallDenom += keyChain.size() - 1;\\n\\n // System.out.println(keyChain+\\\"\\\\n\\\"+(keyChain.size() - numInt)+\\\"/\\\"+(keyChain.size()-1));\\n // }\\n }\\n }\\n int[] result = { mucRecallNom, mucRecallDenom };\\n\\n return result;\\n}\",\n \"public static void main(String[] args)\\n {\\n int[][] ints;\\n int[][] ints1;\\n\\n\\n\\n\\n ints = new int[][]{\\n {1, 2, 3, 4, 5, 6, 7, 8, 9},\\n {10, 11, 12, 13, 14, 15, 16, 17, 18},\\n {19, 20, 21, 22, 23, 24, 25, 26, 27},\\n {28, 29, 30, 31, 32, 33, 34, 35, 36},\\n {37, 38, 39, 40, 41, 42, 43, 44, 45},\\n {46, 47, 48, 49, 50, 51, 52, 53, 54},\\n {55, 56, 57, 58, 59, 60, 61, 62, 63},\\n {64, 65, 66, 67, 68, 69, 70, 0, 71},\\n {73, 74, 75, 76, 77, 78, 79, 80, 72}\\n };\\n\\n ints = new int[][]{\\n {1,0},\\n {2,3},\\n };\\n ints1 = new int[][]{\\n {1, 2, 3},\\n {4, 5, 6},\\n {7, 0, 8}\\n };\\n\\n ints1 = new int[][]{\\n {1, 2, 3},\\n {4, 8, 5},\\n {7, 0, 6}\\n };\\n ints = new int[][]{\\n {5, 0, 4},\\n {2, 3, 8},\\n {7,1,6}\\n };\\n ints1 = new int[][]{\\n {1, 6, 4},\\n {7, 0, 8},\\n {2, 3, 5}\\n };\\n\\n ints1 = new int[][]{\\n {6, 0, 5},\\n {8, 7, 4},\\n {3, 2, 1}\\n };\\n ints1 = new int[][]{\\n {11, 0, 4, 7},\\n {2, 15, 1, 8},\\n {5, 14, 9, 3},\\n {13, 6, 12, 10 }\\n };\\n\\n\\n ints1 = new int[][]{\\n {14, 13, 5, 3},\\n {0, 1, 8, 12},\\n {6, 2, 4, 10},\\n {11, 9, 15, 7 }\\n };\\n\\n ints1 = new int[][]{\\n {8, 4, 7},\\n {1,5,6},\\n {3,2,0}\\n };\\n\\n\\n ints1 = new int[][]{\\n {8, 4, 7},\\n {1,5,6},\\n {3,2,0}\\n };\\n\\n\\n ints = new int[][]{\\n {1, 2, 3},\\n {4, 6,5},\\n {7, 8,0}\\n };\\n ints1 = new int[][]{\\n {8, 4, 7},\\n {1,5,6},\\n {3,2,0}\\n };\\n ints = new int[][]{\\n {1,0},\\n {2,3},\\n };\\n System.out.println(System.currentTimeMillis());\\n Board board = new Board(ints);\\n Solver solution = new Solver(board);\\n\\n for (Board el :solution.solution())\\n {\\n System.out.println(el);\\n }\\n System.out.println(System.currentTimeMillis());\\n\\n\\n }\",\n \"public static void main(String[] args) {\\n\\t\\tint width=35;\\n\\t\\tint length=31;\\n\\t\\tlong[][] dp = new long[width+1][length+1];\\n\\t\\tdp[0][0]=0;\\n\\t\\tfor(int i=1;i<length+1;i++){\\n\\t\\t\\tif(badCheck(0,i,0,i-1)){\\n\\t\\t\\t\\tdp[0][i]=0;\\n\\t\\t\\t\\tfor(int k=i+1;k<length+1;k++){\\n\\t\\t\\t\\t\\tdp[0][k]=0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tdp[0][i]=1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int i=1;i<width+1;i++){\\n\\t\\t\\tif(badCheck(i,0,i-1,0)){\\n\\t\\t\\t\\tdp[i][0]=0;\\n\\t\\t\\t\\tfor(int k=i+1;k<width+1;k++){\\n\\t\\t\\t\\t\\tdp[k][0]=0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tdp[i][0]=1;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t\\t\\n\\t\\tfor(int i=1;i<=width;i++){\\n\\t\\t\\tfor(int j=1;j<=length;j++){\\n\\t\\t\\t\\tif(!badCheck(i-1,j,i,j)){\\n\\t\\t\\t\\t\\tdp[i][j]+=dp[i-1][j];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(!badCheck(i,j-1,i,j)){\\n\\t\\t\\t\\t\\tdp[i][j]+=dp[i][j-1];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//System.out.println(dp[6][6]);\\n\\t\\t//System.out.println(dp[2][2]);\\n\\t\\t//System.out.println(dp[1][1]);\\n\\t\\tSystem.out.println(dp[35][31]);\\n\\t}\",\n \"public void ruleOutPos(){\\n for(int i=0;i<scores.length;i++) {\\n for(int j=0;j<scores[i].length;j++) {\\n scores[i][j][13] = 0;//0=pass, >0 is fail, set to pass initially\\n\\n //check Ns - bit crude - what to discount regions with high N\\n double ns = (double) scores[i][j][14] / (double) pLens[j];\\n if (ns >= minPb | ns >= minPm)//\\n scores[i][j][13] += 4;\\n\\n //probe\\n if (hasProbe){\\n if (j == 1 | j == 4) {\\n double perc = (double) scores[i][j][0] / (double) primers[j].length();\\n if (perc >= minPb) {\\n scores[i][j][12] = 1;//flag for failed % test\\n scores[i][j][13] += 2;\\n }\\n }\\n }\\n //primer\\n else {\\n //if more than 2 mismatches in 1-4nt at 3'\\n if(scores[i][j][11]>max14nt) {\\n scores[i][j][13]+=1;\\n }\\n //use mLen (combined F and R length) initially to find initial candidates - filter later\\n double perc=(double)scores[i][j][0]/(double)mLen;\\n double percI=(double)scores[i][j][0]/(double)pLens[j];\\n\\n if(perc>=minPm | percI>=minPmI) {\\n scores[i][j][12]=1;//flag for failed % test\\n scores[i][j][13]+=2;\\n }\\n }\\n }\\n }//end of finding positions that prime loop\\n }\",\n \"private static int computeCost(int[] arr, int[] combo) {\\n int [] cost = new int[combo.length];\\n int startCol = 0;\\n for(int i = 0; i < combo.length; i++) {\\n cost[i] = getCostForPartition(arr, startCol, combo[i]);\\n startCol += combo[i];\\n }\\n // get total cost\\n int retval = 0;\\n for (int value : cost) {\\n retval += value;\\n }\\n return retval;\\n }\",\n \"private int[] assign(List<T> medoids, List<T> data) {\\n\\t\\tint[] out = new int[data.size()];\\n\\t\\tfor (int i = 0; i < data.size(); i++) {\\n\\t\\t\\tdouble bestDistance = dm.measure(data.get(i), medoids.get(0));\\n\\t\\t\\tint bestIndex = 0;\\n\\t\\t\\tfor (int j = 1; j < medoids.size(); j++) {\\n\\t\\t\\t\\tdouble tmpDistance = dm.measure(data.get(i), medoids.get(j));\\n\\t\\t\\t\\tif (tmpDistance < bestDistance) {\\n\\t\\t\\t\\t\\tbestDistance = tmpDistance;\\n\\t\\t\\t\\t\\tbestIndex = j;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tout[i] = bestIndex;\\n\\n\\t\\t}\\n\\t\\treturn out;\\n\\n\\t}\",\n \"@Override\\r\\n\\tpublic int challengeThree(int[] arr) {\\n\\t\\treturn 0;\\r\\n\\t}\",\n \"Soldat[][] getUnites();\",\n \"MixtureOfExperts(int nExperts){\\r\\n\\t\\twritePosteriorThreshold = 0.0;\\r\\n\\t\\testimationPosteriorThreshold = 0.0;\\r\\n\\t\\tnumberOfExperts = nExperts;\\r\\n\\t\\tlogProbOfCluster = new float[numberOfExperts];\\r\\n numberOfUsers = 0;\\r\\n \\r\\n\\t}\",\n \"public static int[][] neighborhoodSearch(float[] benefit, float[] weight, int[] knapsackWeight){\\n\\n /*\\n Using greedy algorithm to put items in knapsacks\\n */\\n\\n // number of items\\n int itemLen = benefit.length;\\n // number of knapsacks\\n int knapsackLen = knapsackWeight.length;\\n // key: index of item, value: benefit / weight of item\\n Map<Integer, Float> benefitPerWeightToIndexMap = new TreeMap<>();\\n // if item i is included in knapsack j, result[i][j] = 1, otherwise result[i][j] = 0\\n int[][] result = new int[itemLen][knapsackLen];\\n // initialize the map\\n for (int i = 0; i < itemLen; i++) {\\n benefitPerWeightToIndexMap.put(i, (benefit[i] / weight[i]));\\n }\\n\\n // the value comparator for sorting the entrySet in the map by value in descending order (using lambda)\\n Comparator<Map.Entry<Integer, Float>> valueComparator = (o1, o2) -> o2.getValue().compareTo(o1.getValue());\\n // convert the map to list to sort it by value comparator\\n List<Map.Entry<Integer, Float>> benefitPerWeightToIndexList = new ArrayList<>(benefitPerWeightToIndexMap.entrySet());\\n benefitPerWeightToIndexList.sort(valueComparator);\\n\\n printBenefitPerWeightList(benefitPerWeightToIndexList);\\n\\n int greedyTotalBenefit = 0;\\n\\n // put items in list into knapsacks\\n for (int j = 0; j < knapsackLen; j++) {\\n // the items have been put in and ready to be delete\\n List<Map.Entry<Integer, Float>> deleteList = new ArrayList<>();\\n for (Map.Entry<Integer, Float> entry:\\n benefitPerWeightToIndexList) {\\n int i = entry.getKey();\\n if (weight[i] <= knapsackWeight[j]) {\\n result[i][j] = 1;\\n greedyTotalBenefit += benefit[i];\\n deleteList.add(entry);\\n knapsackWeight[j] -= weight[i];\\n }\\n }\\n // delete the items have been put in\\n benefitPerWeightToIndexList.removeAll(deleteList);\\n }\\n // After greedy algorithm\\n System.out.println(\\\"------After greedy algorithm------\\\");\\n printKnapsackWeight(knapsackWeight);\\n printItemsNotIncluded(benefitPerWeightToIndexList);\\n System.out.println(\\\"Total benefit:\\\" + greedyTotalBenefit);\\n printResult(result);\\n\\n /*\\n Search neighborhood\\n */\\n\\n int neighborTotalBenefit = greedyTotalBenefit;\\n\\n // traversing knapsacks\\n for (int j1 = 0; j1 < knapsackLen - 1; j1++) {\\n for (int j2 = j1 + 1; j2 < knapsackLen; j2++) {\\n // traversing items in the two knapsacks\\n for (int i1 = 0; i1 < itemLen; i1++) {\\n for (int i2 = 0; i2 < itemLen; i2++) {\\n // judge if item i1 and item i2 exists in knapsack j1 and j2 respectively\\n if (result[i1][j1] == 1 && result[i2][j2] == 1) {\\n // tempList for update benefitPerWeightToIndexList in iteration\\n List<Map.Entry<Integer, Float>> tempList = new ArrayList<>(benefitPerWeightToIndexList);\\n // traversing items that have not been included\\n for (Map.Entry<Integer, Float> entry:\\n benefitPerWeightToIndexList) {\\n int i3 = entry.getKey();\\n // judge if the neighborhood solution is feasible\\n if (knapsackWeight[j2] + weight[i2] - weight[i1] >= 0\\n && knapsackWeight[j1] + weight[i1] - weight[i3] >= 0) {\\n // judge if the neighborhood solution is better\\n if (neighborTotalBenefit - benefit[i2] + benefit[i3] > neighborTotalBenefit) {\\n // change the current solution to the neighborhood solution\\n result[i1][j1] = 0;\\n result[i1][j2] = 1;\\n\\n result[i2][j2] = 0;\\n\\n result[i3][j1] = 1;\\n\\n tempList.remove(entry);\\n int finalI2 = i2;\\n tempList.add(new Map.Entry<Integer, Float>() {\\n @Override\\n public Integer getKey() {\\n return finalI2;\\n }\\n\\n @Override\\n public Float getValue() {\\n return benefit[finalI2] / weight[finalI2];\\n }\\n\\n @Override\\n public Float setValue(Float value) {\\n return null;\\n }\\n });\\n\\n knapsackWeight[j1] += weight[i1] - weight[i3];\\n knapsackWeight[j2] += weight[i2] - weight[i1];\\n\\n neighborTotalBenefit = (int) (neighborTotalBenefit - benefit[i2] + benefit[i3]);\\n\\n System.out.println(\\\"------Find a better solution------\\\");\\n System.out.println(\\\"Remove item\\\" + i2 + \\\" in \\\" + \\\"knapsack\\\" + j2 + \\\", move item\\\" + i1 + \\\" from knapsack\\\" + j1 + \\\" to \\\" + \\\"knapsack\\\" + j2 + \\\" and put item\\\" + i3 + \\\" in knapsack\\\" + j1);\\n printKnapsackWeight(knapsackWeight);\\n printItemsNotIncluded(tempList);\\n System.out.println(\\\"Total benefit:\\\" + neighborTotalBenefit);\\n printResult(result);\\n }\\n }\\n }\\n // update the list after traversing the list\\n benefitPerWeightToIndexList = tempList;\\n }\\n }\\n }\\n }\\n }\\n\\n return result;\\n }\",\n \"public abstract double solve(int[][] matrix, double[] profitTable, int[] teamTable);\",\n \"@Test\\n public void testCreateRowIndices2(){\\n int[][] a = new int[4][2];\\n a[0][0] = 0;\\n a[0][1] = 0;\\n a[1][0] = 0;\\n a[1][1] = 1;\\n a[2][0] = 0;\\n a[2][1] = 2;\\n a[3][0] = 2;\\n a[3][1] = 1;\\n\\n double[][] input = new double[4][3];\\n\\n for(int i = 0 ; i < a.length ; i++){\\n input[a[i][0]][a[i][1]] = 1;\\n }\\n\\n int[][] myIndices = HarderArrayProblems.createRowIndices(input);\\n for(int i = 0 ; i < a.length ; i++){\\n assertEquals(a[i][0], myIndices[i][0]);\\n assertEquals(a[i][1], myIndices[i][1]);\\n }\\n\\n }\",\n \"public abstract int[] solve(double[][] costs);\",\n \"public void bsetCostElements() {\\n\\t\\t\\t\\n\\t\\t\\t\\n\\t\\tfor (int obj = 0; obj < finalLocation.length; obj++) {\\n\\t\\t for (int time = 0; time < finalLocation[obj].length; time++) {\\n\\t\\t\\t\\n\\t\\t bfCost[obj][time].bstorageCost=totalCostCalculation.btotalResidentCost[time][obj][finalLocation[obj][time]].bstorageCost;\\n\\t\\t\\t bfCost[obj][time].breadCost=totalCostCalculation.btotalResidentCost[time][obj][finalLocation[obj][time]].breadCost;\\n\\t\\t\\t bfCost[obj][time].bwriteCost=totalCostCalculation.btotalResidentCost[time][obj][finalLocation[obj][time]].bwriteCost;\\n\\t\\t\\t bfCost[obj][time].btranCost=totalCostCalculation.btotalResidentCost[time][obj][finalLocation[obj][time]].btranCost;\\n\\t\\t\\t \\n\\t\\t\\t //1. we calculate latency cost for two cases separately: when the object is in the hot tier or cool tier.\\n\\t\\t\\t if (finalLocation[obj][time]==0){//Object is in the cool tier\\n\\t\\t\\t\\t bfCost[obj][time].bdelayCost=totalCostCalculation.btotalResidentCost[time][obj][0].bdelayCost;\\n\\t\\t\\t\\t \\n\\t\\t\\t }else{// object is in both tiers and, in consequence, the latency cost of writes is the maximum latency of writing in both tiers, and the read latency is the one in hot tier.\\n\\t\\t\\t\\t bfCost[obj][time].bedelCost=fc.bdelayMaxWriteReadCost(workloadGenerator.objectListRegion[obj], 1, obj, time);\\n\\t\\t\\t }\\n\\t\\t\\t \\n\\t\\t /* 2. Here we calculate storage cost and transaction cost to make consistent data. This requires just write transaction. Since in our cost \\n calculation make a computation for both read and writes.\\n\\t\\t */\\n\\t\\t \\n\\t\\t if(finalLocation[obj][time]==1){//NOTE: in above cost storage, we calculate the cost of object in either in hot or cold tier. \\n\\t\\t \\t //So here we calculate the storage cost in cold tier when the object is in hot tier.\\n\\t\\t \\t bfCost[obj][time].bstorageCost=bfCost[obj][time].bstorageCost.add(totalCostCalculation.btotalResidentCost[time][obj][0].bstorageCost);\\n\\t\\t bfCost[obj][time].bconsisCost=totalCostCalculation.btotalResidentCost[time][obj][0].bconsisCost;\\n\\t\\t }\\n\\t\\t\\t bfCost[obj][time].bnonMigrationCost=bfCost[obj][time].bstorageCost.add(bfCost[obj][time].breadCost).add( bfCost[obj][time].bwriteCost).\\n\\t\\t\\t\\t\\t add(bfCost[obj][time].btranCost).add( bfCost[obj][time].bconsisCost).\\n\\t\\t\\t\\t\\t add(bfCost[obj][time].bdelayCost);\\n\\t\\t\\t\\t\\t //totalCostCalculation.btotalResidentCost[time][obj][finalLocation[obj][time]].bnonMigrationCost.add(bfCost[obj][time].bconsisCost);\\n\\t\\t\\t \\n\\t\\t\\t //3. We need to calculate just transfer cost between cold to hot tier. From hot to cold tier does not make sense because we have a copy of data in cold tier.\\n\\t\\t if(breakPoint==1){//If breakPoint is ONE then for serving every user, the object for each time slot is transfered from Cold to Hot tier.\\n\\t\\t \\t \\n\\t\\t }\\n\\t\\t else if(time>0 && finalLocation[obj][time-1]==0 && finalLocation[obj][time]==1){\\n\\t\\t\\t bfCost[obj][time].bmigrationCost=totalCostCalculation.btotalMigrationCost[time][obj][finalLocation[obj][time-1]][finalLocation[obj][time]];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\t\\t\\n\\t}\",\n \"public int _maxProfitAssignmentSortedCollectors(int[] difficulty, int[] profit, int[] worker) {\\n int n = difficulty.length;\\n int [][] dp = new int [n][2]; // difficulty, profit pair (dp)\\n\\n for (int idx = 0; idx < n; idx ++) {\\n dp [idx][0] = difficulty [idx];\\n dp [idx][1] = profit [idx];\\n }\\n\\n Arrays.sort (dp, (a, b) -> a [0] - b [0]);\\n\\n // sort the collectors.\\n Arrays.sort (worker);\\n\\n int ans = 0, best = 0, idx = 0;\\n for (int w : worker) {\\n // compute maxima and save it for next we well to build upon the max (best) seen so far.\\n while (idx < n && w >= dp [idx][0]) { // increase difficulty slowly\\n best = Math.max (best, dp [idx][1]);\\n idx ++;\\n }\\n ans += best;\\n }\\n return ans;\\n }\",\n \"public void fillHeuristicArrayTD(){\\n int[] temp;\\n //every var gets a score based on how many clauses it satisfies\\n for(int i = 0; i< heuristicArrayTD.length; i++){\\n temp=variables.clone();\\n temp[i]=0;\\n heuristicArrayTD[i]=testAstar(temp);\\n temp[i]=1;\\n heuristicArrayTD[i]+=testAstar(temp);\\n }\\n }\",\n \"public static void main (String args[]) {\\n\\t\\tint[][] ar = BandedArraySearch.create(13);\\n\\t\\tnew BandedArraySolution(ar).trial();\\n\\t}\",\n \"public static void main(String[] args) throws FileNotFoundException {\\n FileReader fileReader = new FileReader(\\\"C:\\\\\\\\Users\\\\\\\\Stephanie\\\\\\\\Projects\\\\\\\\HackerRank\\\\\\\\src\\\\\\\\data\\\");\\n\\n Scanner sc = new Scanner(fileReader);\\n DecimalFormat df = new DecimalFormat(\\\"##.00\\\");\\n int n = sc.nextInt();\\n\\n\\n sc.nextLine();\\n int i, k = 0, j = 0;\\n double arr[] = new double[n - 20];\\n int arr_x[] = new int[n - 20];\\n int miss_index[] = new int[20];\\n for (i = 0; i < n; i++) {\\n String temp[] = sc.nextLine().split(\\\"\\\\t\\\");\\n\\n if (temp[1].startsWith(\\\"Missing\\\")) {\\n miss_index[j] = i;\\n j++;\\n } else {\\n arr[k] = Double.parseDouble(temp[1]);\\n arr_x[k] = i;\\n k++;\\n }\\n\\n }\\n\\n System.out.println(Arrays.toString(arr));\\n System.out.println(Arrays.toString(arr_x));\\n System.out.println(Arrays.toString(miss_index));\\n\\n double ansy, ansx, a, b, x0, x1, y0, y1;\\n int temp, q1, q2, qq1, qq2;\\n\\n for (i = 0; i < 20; i++) {\\n if (miss_index[i] < arr_x[0]) {\\n System.out.println(i+\\\" miss_index[i]: \\\"+miss_index[i]+\\\" arr_x[0]: \\\"+arr_x[0]);\\n x0 = arr_x[0];\\n x1 = arr_x[1];\\n y0 = arr[0];\\n y1 = arr[1];\\n\\n } else if (miss_index[i] > arr_x[n - 21]) {\\n x0 = arr_x[n - 21];\\n x1 = arr_x[n - 22];\\n y0 = arr[n - 21];\\n y1 = arr[n - 22];\\n\\n\\n } else {\\n temp = 0;\\n while (miss_index[i] > arr_x[temp]) {\\n temp++;\\n }\\n x0 = arr_x[temp - 1];\\n x1 = arr_x[temp];\\n y0 = arr[temp - 1];\\n y1 = arr[temp];\\n\\n }\\n a = (y1 - y0) / (x1 - x0);\\n b = y0 - a * x0;\\n ansx = miss_index[i];\\n ansy = a * ansx + b;\\n System.out.println(df.format(ansy));\\n }\\n\\n }\",\n \"private int[] vtinit(ProblemData a) {\\r\\n\\r\\n\\r\\n int[] vector = new int[a.getProcesses().length];\\r\\n for (int i = 0; i < a.getProcesses().length; i++) {\\r\\n vector[i] = a.getProcesses()[i].getWeight();\\r\\n }\\r\\n return vector;\\r\\n\\r\\n }\",\n \"private void createCase(int growFactor, Result[] myResults, int index) {\\n\\t\\tint[] myArray1 = createArray(growFactor, growFactor-1);\\n\\t\\tmyResults[index] = new Result(growFactor, linealSearch(myArray1, growFactor-1), binarySearch(myArray1, growFactor-1));\\n\\t}\",\n \"public static void main(String[] args) throws IOException {\\n BufferedReader f = new BufferedReader(new FileReader(\\\"gymnastics.in\\\"));\\n PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter(\\\"gymnastics.out\\\")));\\n\\n //reads in and initializes n and k values\\n StringTokenizer st = new StringTokenizer(f.readLine());\\n int k = Integer.parseInt(st.nextToken());\\n int n = Integer.parseInt(st.nextToken());\\n //total number of possible pairs (nC2)\\n int numberPairs = (factorial(n).divide(factorial(n-2).multiply(BigInteger.valueOf(2)))).intValue();\\n // (2 * factorial(n-2)));\\n //array of ordered arrays containing data from one cow practice session\\n int[][] trials = new int[k][n];\\n //array of arrays containing each pair (2 elements each)\\n int[][] pairs = new int[numberPairs][2];\\n\\n //initializes trials array\\n for(int i = 0; i < k; i++){\\n st = new StringTokenizer(f.readLine());\\n for(int a = 0; a < n; a++) {\\n trials[i][a] = Integer.parseInt(st.nextToken());\\n }\\n }\\n\\n //initializes pairs array\\n int index = 0;\\n for (int i = 0; i < n; i++) {\\n for (int l = i + 1; l < n; l++) {\\n int[] pair = {trials[0][i], trials[0][l]};\\n pairs[index] = pair;\\n index = index + 1;\\n }\\n }\\n System.out.println();\\n //test function, subtracts 1 from total number of pairs each time a pair is found to be inconsistent\\n for (int i = 0; i < pairs.length; i++) {\\n index = 0;\\n String[] checkArray = new String[k];\\n for (int a = 0; a < trials.length; a++) {\\n checkArray[index] = check(pairs[i][0], pairs[i][1], trials[a]);\\n index = index + 1;\\n }\\n\\n if (checkArray[0] == \\\"less\\\") {\\n if (contains(checkArray, \\\"more\\\")) {\\n numberPairs = numberPairs - 1;\\n }\\n }\\n\\n if (checkArray[0] == \\\"more\\\") {\\n if (contains(checkArray, \\\"less\\\")) {\\n numberPairs = numberPairs - 1;\\n }\\n }\\n }\\n\\n out.print(numberPairs);\\n out.close();\\n }\",\n \"static int hireAssistant(int tab[]) {\\n int best = 0;\\n for(int i = 0; i<tab.length; i++) {\\n if(tab[i] > best)\\n best = tab[i];\\n }\\n return best;\\n }\",\n \"public int _maxProfitAssignmentBest(int[] difficulty, int[] profit, int[] worker) {\\n // value index reverse array\\n int [] dp = new int [100001];\\n\\n // nice strategy to use in multi-array approach\\n // using difficulty as index, profit as value.\\n // (difficulty array sorted by default, effort saved)\\n for (int idx = 0; idx < difficulty.length; idx ++) {\\n // overwrite profit values and keep the max one. (in case of conflict)\\n dp [difficulty [idx]] = Math.max (dp [difficulty [idx]], profit [idx]);\\n }\\n\\n // maximize profits stored linearly\\n for (int idx = 1; idx < dp.length; idx ++)\\n dp [idx] = Math.max (dp [idx - 1], dp [idx]);\\n\\n // build ans\\n int ans = 0;\\n for (int w : worker)\\n ans += dp [w];\\n\\n return ans;\\n }\",\n \"public static void main(String[] args) {\\n\\t\\tRegularTicket[] arr = new RegularTicket[15];\\n\\t\\t// Populates array with tickets in corresponding indices. \\n\\t\\tcreateArray(arr);\\n\\t\\t// Prints each ticket String representation and total profit from all tickets.\\n\\t\\tprint(arr);\\n\\t}\",\n \"public static void main(String[] args) {\\n\\t\\tint[] marks = {10,20,30,60,40,50,70}; // element = 7\\n\\t\\tint[] marks2 = new int[10]; \\n\\t\\tmarks2[0] = 10;\\n\\t\\tmarks2[1] = 10;\\n\\t\\tmarks2[2] = 10;\\n\\t\\tmarks2[3] = 10;\\n\\t\\tmarks2[4] = 10;\\n\\t\\tmarks2[5] = 10;\\n\\t\\tmarks2[6] = 10;\\n\\t\\tmarks2[7] = 10;\\n\\t\\tmarks2[8] = 10;\\n\\t\\tmarks2[9] = 10;\\n\\t\\t\\n\\t\\t// array works on index concept.\\n\\t\\t// 7 - length of this array\\n\\t\\t// highest index - 6\\n\\t\\t// System.out.println(marks.length); // size = 7\\n\\t\\t\\n//\\t\\tfor(int i = 0; i < marks2.length; i++) {\\n//\\t\\t\\tSystem.out.println(marks2[i]);\\n//\\t\\t}\\n\\t\\t\\n\\t\\tfor(int i = (marks.length-1) ; i >= 0 ;i--) {\\n\\t\\t\\tSystem.out.println(marks[i]);\\n\\t\\t}\\n\\t\\t\\n\\t\\t// advantages\\n\\t\\t// keep the collection\\n\\t\\t// fastest available collection in any object oriented language\\n\\t\\t// when we create array - we have to give size of that array \\n\\t\\t// 10 of int(4) = 10*4 = 40 byte (JVM )\\n\\t\\t\\n\\t\\t// disavantage \\n\\t\\t// array - we cannot chnage the size \\n\\t\\t\\n\\t\\t\\n\\t\\t// multidimentional - 1D array\\n\\t\\t// 2D array - 2 dimentions\\n\\t\\tint[][] matrix = {{10,20},{20,30}}; // directly values \\n\\t\\t\\n\\t\\tint[][] matrix2 = new int[2][2]; // directly values\\n\\t\\tmatrix2[0][0] = 10;\\n\\t\\tmatrix2[0][1] = 20;\\n\\t\\tmatrix2[1][0] = 20;\\n\\t\\tmatrix2[1][1] = 30;\\n\\t\\t\\n\\t\\tint[][] matrix1 = new int[2][6]; // size\\n\\t\\t// student 1 marks\\n\\t\\tmatrix1[0][0] = 10;\\n\\t\\tmatrix1[0][1] = 20;\\n\\t\\tmatrix1[0][2] = 20;\\n\\t\\tmatrix1[0][3] = 20;\\n\\t\\tmatrix1[0][4] = 20;\\n\\t\\tmatrix1[0][5] = 20;\\n\\t\\t// student 2 marks\\n\\t\\tmatrix1[1][0] = 10;\\n\\t\\tmatrix1[1][1] = 20;\\n\\t\\tmatrix1[1][2] = 20;\\n\\t\\tmatrix1[1][3] = 20;\\n\\t\\tmatrix1[1][4] = 20;\\n\\t\\tmatrix1[1][5] = 20;\\n\\t\\t\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"@Test\\n @Order(1)\\n void algorithms() {\\n \\n Combination initialComb = new Combination();\\n for (int i = 0; i < assignementProblem.getAssignmentData().getLength(); i++) {\\n initialComb.add((long) i + 1);\\n }\\n assignementProblem.setInCombination(initialComb);\\n executeAlgo(SearchTestUtil.ALGO.TABU);\\n executeAlgo(SearchTestUtil.ALGO.RECUIT);\\n }\",\n \"short[][] productionTable();\",\n \"static double reliability(vmnode vm, jobnode[] jobs, int[] assigned, int ind) {\\n double pow, bw, mem;\\n pow = bw = mem = 0;\\n\\n for (int i = 0; i < jobs.length; i++) {\\n if (assigned[i] == ind) {\\n pow = pow + 1.0 * jobs[i].pow;\\n bw = bw + 1.0 * jobs[i].bw;\\n }\\n }\\n pow = 0.5 * (vm.powavail * 1.0 / pow);\\n bw = 0.3 * (vm.bwavail * 1.0 / bw);\\n mem = 0.2 * (vm.memavail + vm.memused) / vm.memused;\\n if (vm.memused == 0.0) {\\n return 1000000.0;\\n }\\n return (pow + bw + mem);\\n }\",\n \"public static double ludcmp(double a[][], int indx[])\\n\\t\\t\\t{\\n\\tint n = a.length;\\n\\tint i = 0, imax = 0, j = 0, k = 0;\\n\\tdouble big, dum, sum, temp;\\n\\tdouble d = 1.0;\\n\\tdouble vv[] = new double[n];\\n\\tfor (i = 0; i < n; i++) {\\n big = 0.0;\\n for (j = 0; j < n; j++)\\n if ((temp = Math.abs(a[i][j])) > big)\\n\\t\\tbig = temp;\\n\\n\\tif (big == 0.0) {\\n try {\\n // no non-zero largest element\\n\\n throw new NRException(\\\"Error: Singular linearized system. Computation cannot proceed.\\\");\\n } catch (NRException ex) {\\n ex.printStackTrace();\\n }\\n\\n\\t}\\n\\tvv[i] = 1.0 / big;\\n }\\n\\n for (j = 0; j < n; j++) {\\n\\tfor (i = 0; i < j; i++) {\\n sum = a[i][j];\\n for (k = 0; k < i; k++)\\n sum -= (a[i][k] * a[k][j]);\\n a[i][j] = sum;\\n\\t}\\n\\tbig = 0.0;\\n\\tfor (i = j; i < n; i++) {\\n sum = a[i][j];\\n for (k = 0; k < j; k++)\\n sum -= (a[i][k] * a[k][j]);\\n a[i][j] = sum;\\n\\t\\n if ((dum = vv[i] * Math.abs(sum)) >= big) {\\n\\t\\tbig = dum;\\n\\t\\timax = i;\\n\\t\\t}\\n\\t}\\n\\tif (j != imax) {\\n\\t\\tfor (k = 0; k < n; k++) {\\n\\t\\tdum = a[imax][k];\\n\\t\\ta[imax][k] = a[j][k];\\n\\t\\ta[j][k] = dum;\\n }\\n d = -d;\\n vv[imax] = vv[j];\\n }\\n\\tindx[j] = imax;\\n\\t// replace zero values with a nigh zero value so that\\n\\t// we don't get any divisions by zero.\\n if (a[j][j] == 0.0)\\n\\t a[j][j] = TINY;\\n\\n\\tif (j != n-1) {\\n\\tdum = 1.0 / (a[j][j]);\\n\\tfor (i = j + 1; i < n; i++)\\n\\t a[i][j] *= dum;\\n\\t}\\n }\\n\\treturn d;\\n\\t}\",\n \"private void EvalFitness(){\\r\\n _FitVal=0;\\r\\n for(int i=0; i<7;i++)\\r\\n for(int j=i+1;j<8;j++){\\r\\n if( _Data[i]==_Data[j]) _FitVal++;\\r\\n if(j-i==Math.abs(_Data[i]-_Data[j])) _FitVal++;\\r\\n }\\r\\n }\",\n \"public void doPartition() {\\n int sum = 0;\\n for (int q = 0; q < w.queryCount; q++) {\\n for (int a = 0; a < w.attributeCount; a++) {\\n sum += w.usageMatrix[q][a];\\n }\\n }\\n\\n if (sum == w.queryCount * w.attributeCount) {\\n partitioning = new int[w.attributeCount];\\n return;\\n }\\n\\n\\t\\t//ArrayUtils.printArray(usageMatrix, \\\"Usage Matrix\\\", \\\"Query\\\", null);\\n\\t\\t\\n\\t\\t// generate candidate partitions (all possible primary partitions)\\n\\t\\tint[][] candidatePartitions = generateCandidates(w.usageMatrix);\\n\\t\\t//ArrayUtils.printArray(candidatePartitions, \\\"Number of primary partitions:\\\"+candidatePartitions.length, \\\"Partition \\\", null);\\n\\t\\t\\n\\t\\t// generate the affinity matrix and METIS input file \\n\\t\\tint[][] matrix = affinityMatrix(candidatePartitions, w.usageMatrix);\\n\\t\\t//ArrayUtils.printArray(matrix, \\\"Partition Affinity Matrix Size: \\\"+matrix.length, null, null);\\n\\t\\twriteGraphFile(graphFileName, matrix);\\n\\t\\t\\n\\t\\t// run METIS using the graph file\\n\\t\\ttry {\\n\\t\\t\\tProcess p = Runtime.getRuntime().exec(metisLocation+\\\" \\\"+graphFileName+\\\" \\\"+K);\\n\\t\\t\\tp.waitFor();\\n\\t\\t} catch (IOException e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t\\tSystem.exit(1);\\n\\t\\t} catch (InterruptedException e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t} \\n\\t\\t\\n\\t\\t// read primary partition groups created by METIS \\n\\t\\tint[][][] primaryPartitionGroups = readPartitionFile(candidatePartitions); // TODO exception here for too few groups or attributes...\\n\\t\\t//for(int[][] primaryPartitionGroup: primaryPartitionGroups)\\n\\t\\t//\\tArrayUtils.printArray(primaryPartitionGroup, \\\"Partition Group\\\", \\\"Partition\\\", null);\\n\\t\\t\\n\\t\\t\\n\\t\\t//int i=0;\\n\\t\\tList<int[][]> bestLayouts = new ArrayList<int[][]>();\\n\\t\\tfor(int[][] primaryPartitionGroup: primaryPartitionGroups){\\n\\t\\t\\tminCost = Double.MAX_VALUE;\\n\\t\\t\\t\\n\\t\\t\\t// Candidate Merging\\n\\t\\t\\t//System.out.println(\\\"Primary Partition Group:\\\"+(i+1));\\n\\t\\t\\tList<BigInteger> mergedCandidatePartitions = mergeCandidates(primaryPartitionGroup);\\n\\t\\t\\t//System.out.println(\\\"Number of merged partitions:\\\"+mergedCandidatePartitions.size());\\n\\t\\t\\t\\n\\t\\t\\t// Layout Generation\\n\\t\\t\\tgenerateLayout(mergedCandidatePartitions, primaryPartitionGroup);\\n\\t\\t\\tbestLayouts.add(bestLayout);\\t\\t\\t\\n\\t\\t\\t//ArrayUtils.printArray(bestLayout, \\\"Layout:\\\"+(++i), null, null);\\n\\t\\t}\\n\\t\\t\\n\\t\\t// Combine sub-Layouts\\n\\t\\tList<int[][]> mergedBestLayouts = mergeAcrossLayouts(bestLayouts, bestLayouts.size());\\n\\t\\tpartitioning = PartitioningUtils.getPartitioning(mergedBestLayouts);\\n\\t}\",\n \"public int calculateMinimumHP(ArrayList<ArrayList<Integer>> grid) {\\n\\t\\t\\t\\t int m =grid.size(), n = grid.get(0).size();\\n\\t\\t\\t\\t int[][][] dp = new int[m+1][n+1][2];\\n\\t\\t\\t\\t \\n\\t\\t\\t\\t dp[0][0][0] = 0;\\n\\t\\t\\t\\t dp[0][0][1] = 0;\\n\\t\\t\\t\\t dp[0][1][0] = 1; // start with life\\n\\t\\t\\t\\t dp[0][1][1] = 0; // balance life\\n\\t\\t\\t\\t dp[1][0][0] = 1;\\n\\t\\t\\t\\t dp[1][0][1] = 0;\\n\\t\\t\\t\\t for(int i=2;i<dp[0].length;i++){\\n\\t\\t\\t\\t\\t dp[0][i][0] = Integer.MAX_VALUE;\\n\\t\\t\\t\\t\\t dp[0][i][1] = 0;\\n\\t\\t\\t\\t }\\n\\t\\t\\t\\t for(int i=2;i<dp.length;i++){\\n\\t\\t\\t\\t\\t dp[i][0][0] = Integer.MAX_VALUE;\\n\\t\\t\\t\\t\\t dp[i][0][1] = 0;\\n\\t\\t\\t\\t }\\n\\t\\t\\t\\t \\n\\t\\t\\t\\t for(int i=1;i<dp.length;i++){\\n\\t\\t\\t\\t\\t for(int j=1;j<dp[0].length;j++){\\n\\t\\t\\t\\t\\t\\t \\n\\t\\t\\t\\t\\t\\t if(grid.get(i-1).get(j-1) < 0){\\n\\t\\t\\t\\t\\t\\t\\t int[] fromCell = dp[i-1][j][0]< dp[i][j-1][0]?dp[i-1][j]:dp[i][j-1];\\n\\t\\t\\t\\t\\t\\t\\t \\n\\t\\t\\t\\t\\t\\t\\t dp[i][j][0] = fromCell[0] - grid.get(i-1).get(j-1) - fromCell[1];\\n\\t\\t\\t\\t\\t\\t\\t dp[i][j][1] = fromCell[1]+ grid.get(i-1).get(j-1)>0?fromCell[1]+ grid.get(i-1).get(j-1):0;\\n\\t\\t\\t\\t\\t\\t }else{\\n\\t\\t\\t\\t\\t\\t\\t int[] fromCell = dp[i-1][j][0]< dp[i][j-1][0]?dp[i-1][j]:dp[i][j-1];\\n\\t\\t\\t\\t\\t\\t\\t dp[i][j][0] = fromCell[0];\\n\\t\\t\\t\\t\\t\\t\\t dp[i][j][1] = fromCell[1]+grid.get(i-1).get(j-1);\\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\\t return dp[m][n][0];\\n\\t\\t\\t\\t \\n\\t\\t\\t }\",\n \"private static void setTooNear(int[][] mainArray, int firstTask, int secondTask, ArrayList<String> tooNearArray, int[] forcedList) {\\r\\n\\t\\t\\r\\n\\t for (int count = 0 ; count < 8; count++) {\\r\\n\\t \\t\\tif(forcedList[count] == firstTask) {\\r\\n\\t \\t\\t\\tif (count == 7) { //if machine 8, forbidden next is machine 1.\\r\\n\\t \\t\\t\\t\\tif (isForced(count,firstTask,forcedList)) {\\r\\n\\t \\t\\t\\t\\t\\tif (isForced(count+1, secondTask, forcedList)) {\\r\\n\\t \\t\\t\\t\\t\\t\\tOutputWriter.writeFile(forcedList, 0, \\\"No valid solution possible!\\\");\\r\\n\\t \\t\\t\\t\\t\\t\\tSystem.exit(0);\\r\\n\\t \\t\\t\\t\\t\\t}\\r\\n\\t \\t\\t\\t\\t\\telse {\\tmainArray[0][secondTask] = -1;\\r\\n\\t \\t\\t\\t\\t\\t}\\r\\n\\t \\t\\t\\t\\t}\\r\\n\\t \\t\\t\\t}else {\\r\\n\\t \\t\\t\\t\\tif (isForced(count,firstTask, forcedList)) {\\r\\n\\t \\t\\t\\t\\t\\tif (isForced(count+1, secondTask, forcedList)) {\\r\\n\\t \\t\\t\\t\\t\\t\\tOutputWriter.writeFile(forcedList, 0, \\\"No valid solution possible!\\\");\\r\\n\\t \\t\\t\\t\\t\\t\\tSystem.exit(0);\\r\\n\\t \\t\\t\\t\\t\\t}\\r\\n\\t \\t\\t\\t\\t\\telse {\\tmainArray[count+1][secondTask] = -1;\\r\\n\\t \\t\\t\\t\\t\\t}\\r\\n\\t \\t\\t\\t\\t}\\t\\t\\r\\n\\t \\t\\t\\t}\\r\\n\\r\\n\\t \\t\\t}\\r\\n\\t }\\r\\n\\t}\",\n \"private int find_bestSplit(KnowledgeBase kb, int attIndex, ArrayList<ArrayList<ArrayList<Integer>>> multiple_counters) {\\r\\n\\t\\tif(multiple_counters.size() >0){\\r\\n\\t\\t\\tfloat best_Gini = calculImpurity2D(kb.getSamples().size(),multiple_counters.get(0));; // it's a minimum!!\\r\\n\\t\\t\\tint index_Best_Gini =0;\\r\\n\\t\\t\\tfloat tmp_gini;\\r\\n\\t\\t\\tfor(int i=1;i<multiple_counters.size();i++){\\r\\n\\t\\t\\t\\ttmp_gini = calculImpurity2D(kb.getSamples().size(),multiple_counters.get(i));\\r\\n\\t\\t\\t\\tif(tmp_gini<best_Gini){\\r\\n\\t\\t\\t\\t\\tbest_Gini = tmp_gini;\\r\\n\\t\\t\\t\\t\\tindex_Best_Gini = i;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\treturn index_Best_Gini;\\r\\n\\t\\t}\\r\\n\\t\\treturn 0;\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t}\",\n \"private void coins_a2W(){\\n\\t\\tthis.cube[4] = this.cube[17]; \\n\\t\\tthis.cube[17] = this.cube[20];\\n\\t\\tthis.cube[20] = this.cube[36];\\n\\t\\tthis.cube[36] = this.cube[33];\\n\\t\\tthis.cube[33] = this.cube[4];\\n\\t}\",\n \"private void setupStuff() {\\n\\t\\tm_seenNumbers = new double[featureArray.length][];\\n\\t\\tm_Weights = new double[featureArray.length][];\\n\\t\\tm_NumValues = new int[featureArray.length];\\n\\t\\tm_SumOfWeights = new double[featureArray.length];\\n\\t\\tfeatureTotals = new int[featureArray.length];\\n\\n\\t\\tfor (int i = 0; i < featureArray.length; i++) {\\n\\t\\t\\tm_NumValues[i] = 0;\\n\\t\\t\\tm_seenNumbers[i] = new double[100];\\n\\t\\t\\tm_Weights[i] = new double[100];\\n\\t\\t}\\n\\n\\t\\t/*\\n\\t\\t * initialize structures for probabilities of each class and of each\\n\\t\\t * feature\\n\\t\\t */\\n\\t\\tclassCounts = new double[MLearner.NUMBER_CLASSES];\\n\\t\\tprobs = new HashMap[MLearner.NUMBER_CLASSES][featureArray.length];\\n\\t\\tRealprobs = new HashMap[MLearner.NUMBER_CLASSES][featureArray.length];\\n\\t\\tfor (int i = 0; i < MLearner.NUMBER_CLASSES; i++) {\\n\\t\\t\\tfor (int j = 0; j < featureArray.length; j++) {\\n\\t\\t\\t\\tif (featureArray[j]) {//only create if we are using that\\n\\t\\t\\t\\t\\t// feature\\n\\t\\t\\t\\t\\tprobs[i][j] = new HashMap();\\n\\t\\t\\t\\t\\tif (EmailInternalConfigurationWindow.isFeatureDiscrete(j)) {\\n\\t\\t\\t\\t\\t\\tprobs[i][j].put(\\\"_default\\\", new Double(0));\\n\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t\\tclassCounts[i] = 0;\\n\\t\\t}\\n\\n\\t}\",\n \"public static int ruolette(ArrayList<Integer> fitvalores, ArrayList<int[]> poblacion, int semilla){ \\n int totalfitnes = 0;\\n int totalfitnesnuevo = 0;\\n int indtablero = 0;\\n int semi=semilla;\\n int tpoblacion=poblacion.size();\\n int []nuevofitness = new int [fitvalores.size()];\\n double []nproporcion = new double [fitvalores.size()];\\n ArrayList <Double> proporcion = new ArrayList<>();//proporcion j la ruleta\\n ArrayList <Double> ruleta = new ArrayList<>();\\n //obtener el max fitnes\\n for(int i=0;i<fitvalores.size();i++){ //total de fitnes\\n totalfitnes=totalfitnes+fitvalores.get(i);\\n }\\n \\n for(int i=0;i<fitvalores.size();i++){ //poner datos en el nuevo fittnes inverso\\n double pro=(tpoblacion*tpoblacion-tpoblacion)-fitvalores.get(i);\\n nuevofitness[i]= (int) pro;\\n // System.out.println(\\\"nuevo fitnes\\\"+nuevofitness[i]);\\n } \\n for(int i=0;i<fitvalores.size();i++){ //total de fitnes nuevo o inverso\\n totalfitnesnuevo=(totalfitnesnuevo+nuevofitness[i]);//para que los mejores casos usen mas espacio\\n }\\n \\n for(int i=0;i<fitvalores.size();i++){ //poner datos en el array proporcion\\n double var1=nuevofitness[i];\\n double var2=totalfitnesnuevo;\\n double pro=var1/var2;\\n nproporcion[i]=pro;\\n //System.out.println(\\\"nueva proporcion \\\"+nproporcion[i]);\\n } \\n ruleta.add(nproporcion[0]);\\n // System.out.println(\\\"primera propporniaso \\\"+nproporcion[0]);\\n for(int i=1;i<fitvalores.size();i++){ //poner datos en la ruleta\\n double var1=ruleta.get(i-1);\\n double var2=nproporcion[i];\\n ruleta.add(var1+var2);\\n //System.out.println(\\\"ruleta \\\"+ruleta.get(i));\\n }\\n double num=randomadec(0,1,semi);\\n // System.out.println(\\\"numero random dec \\\"+num); \\n for(int i=0;i<fitvalores.size();i++){ //poner datos en el array proporcion\\n // System.out.println(ruleta.get(i));\\n if(num<ruleta.get(i)){\\n indtablero=i;\\n //System.out.println(\\\"se guardo el tablero \\\"+indtablero);\\n break;\\n }\\n }\\n return indtablero;//esto devuelve el indice del tablero ganador en la ruleta\\n }\",\n \"public static void main(String[] args) {\\n\\t\\t// TODO Auto-generated method stub\\n\\n\\t\\tint a[] = {2,1,3,-4,-2};\\n\\t\\t//int a[] = {1 ,2, 3, 7, 5};\\n\\t\\tboolean found = false;\\n\\t\\t\\n\\t\\t//this will solve in o n^2\\n\\t\\tfor(int i = 0 ; i < a.length ; i++){\\n\\t\\t\\tint sum = 0;\\n\\t\\t\\tfor(int j = i ; j< a.length ; j++){\\n\\t\\t\\t\\tsum += a[j] ;\\n\\t\\t\\t\\tif(sum == 0){\\n\\t\\t\\t\\t\\tfound = true;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\tif(found)\\n\\t\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\t\\n\\t\\t\\n\\t\\t// link : https://www.youtube.com/watch?v=PSpuM9cimxA&list=PLKKfKV1b9e8ps6dD3QA5KFfHdiWj9cB1s&index=49\\n\\t\\tSystem.out.println(found + \\\" found\\\");\\n\\t\\tfound = false;\\n\\t\\t//solving with O of N with the help sets\\n\\t\\t// x + 0 = y\\n\\t\\tSet<Integer> set = new HashSet<>();\\n\\t\\tint sum = 0;\\n\\t\\tfor(int element : a){\\n\\t\\t\\tset.add(sum);\\n\\t\\t\\tsum += element;\\n\\t\\t\\tif(set.contains(sum)){\\n\\t\\t\\t\\tfound = true;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tSystem.out.println();\\n\\t\\tSystem.out.println(set);\\n\\t\\t\\n\\t\\tSystem.out.println(found + \\\" found\\\");\\n\\t\\t\\n\\t\\t\\n\\t\\tfound = false;\\n\\t\\t// when the sum of subarray is K\\n\\t\\t\\n\\t\\t//solving with O of N with the help sets\\n\\t\\t//x + k = y >>>\\n\\t\\tSet<Integer> set1 = new HashSet<>();\\n\\t\\tint k = 12;\\n\\t\\tint summ = 0;\\n\\t\\tfor(int element : a){\\n\\t\\t\\tset1.add(summ);\\n\\t\\t\\tsumm += element;\\n\\t\\t\\tif(set1.contains(summ - k)){ // y - k = x(alredy presnt or not)\\n\\t\\t\\t\\tfound = true;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tSystem.out.println(set1);\\n\\t\\tSystem.out.println();\\n\\t\\tSystem.out.println(found + \\\" found\\\");\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"public static void main(String[] args) throws Exception {\\r\\n Scanner input = new Scanner(System.in);\\r\\n int n;\\r\\n // System.out.println(\\\"Enter the number of element\\\");\\r\\n n = input.nextInt();\\r\\n // System.out.println(\\\"here is n\\\"+n);\\r\\n int arr[] = new int[n];\\r\\n // System.out.println(\\\"Enter the element of the array\\\");\\r\\n for (int i = 0; i < n; i++) {\\r\\n arr[i] = input.nextInt();\\r\\n }\\r\\n int sol_arr_1[][] = new int[n][n], sol_arr_2[][] = new int[n][n];\\r\\n \\r\\n //*****intialization*****//\\r\\n for(int i=0;i<n;i++)\\r\\n {\\r\\n for(int j=0;j<n;j++)\\r\\n {\\r\\n sol_arr_1[i][j]=0;\\r\\n sol_arr_2[i][j]=0;\\r\\n }\\r\\n }\\r\\n //*****end*****//\\r\\n \\r\\n \\r\\n \\r\\n \\r\\n \\r\\n int k_for_j = 1;\\r\\n int i = 0, j = 1;\\r\\n for (int q = 0; q < n - 1; q++) {\\r\\n // System.out.println(\\\"q=\\\"+q);\\r\\n j = k_for_j;\\r\\n i=0;\\r\\n if (q == 0) {\\r\\n while (j < n) {\\r\\n sol_arr_1[i][j] = (arr[i] + arr[j]) % 100;\\r\\n sol_arr_2[i][j] = (arr[i] * arr[j]);\\r\\n i++;\\r\\n j++;\\r\\n }\\r\\n }\\r\\n else\\r\\n {\\r\\n while(j<n)\\r\\n {\\r\\n int color1,smog1;\\r\\n color1=(arr[j]+sol_arr_1[i][j-1])%100;\\r\\n smog1=sol_arr_2[i][j-1]+(arr[j]*sol_arr_1[i][j-1]);\\r\\n int color2,smog2;\\r\\n color2 =(sol_arr_1[i+1][j]+arr[j-2])%100;\\r\\n smog2=(sol_arr_1[i+1][j]*arr[j-2])+sol_arr_2[i+1][j];\\r\\n if(smog1>smog2)\\r\\n {\\r\\n sol_arr_1[i][j]=color2;\\r\\n sol_arr_2[i][j]=smog2;\\r\\n }\\r\\n else\\r\\n {\\r\\n sol_arr_1[i][j]=color1;\\r\\n sol_arr_2[i][j]=smog1;\\r\\n }\\r\\n i++;\\r\\n j++;\\r\\n }\\r\\n }\\r\\n k_for_j++;\\r\\n }\\r\\n System.out.println(sol_arr_2[0][n-1]);\\r\\n }\",\n \"public void testTwoWayDistribution() {\\n for(int p = 0; p < 20; p++) {\\n int[] landings = new int[2];\\n for(long in = 0; in < 100000; in++) {\\n long longHash = FPGenerator.std64.fp(p+\\\"a\\\"+in);\\n// long longHash = rand.nextLong();\\n// long longHash = ArchiveUtils.doubleMurmur((p+\\\":\\\"+in).getBytes());\\n landings[conhash.bucketFor(longHash, 2)]++;\\n }\\n// System.out.println(landings[0]+\\\",\\\"+landings[1]);\\n assertTrue(\\\"excessive changes\\\",Math.abs(landings[0]-landings[1]) < 2000); \\n }\\n }\",\n \"static long[] q3PolyMul(int maxDistanceLeft, ThreadVariables t){\\n\\n //precomputation is as simple as running distTo cutoff 1 with bases less than the multiplcity, and it is equivalent by wilf inversion\\n\\n long[] all = allWaysCache(123);\\n long[] currentContains = new long[maxDistanceLeft + 1];\\n System.arraycopy(all,0,currentContains,0,maxDistanceLeft + 1);\\n Polynomial[] shifts = generateShiftsPolyMethod(maxDistanceLeft, t);\\n //Polynomial[] correctShifts = generateShiftsHardcoded(maxDistanceLeft, t);\\n //Polynomial[] shifts = correctShifts;\\n for (int i = 1; i < 8; i++){\\n //System.out.println(correctShifts[i]);\\n System.out.println(shifts[i]);\\n }\\n //I think indexes could be designed so 7-index is index in other array due to symmetry of complements\\n\\n\\n subtract(currentContains, shifts[1].productWith(allWaysCache(23), maxDistanceLeft));\\n subtract(currentContains, shifts[2].productWith(allWaysCache(13), maxDistanceLeft));\\n subtract(currentContains, shifts[3].productWith(allWaysCache(12), maxDistanceLeft));\\n //System.out.print(\\\"Poly: Values after first removal: \\\");\\n //printArray(currentContains);\\n\\n //it might be possible to modify these to avoid doing the last exclusion\\n\\n add(currentContains, shifts[4].trivialProductWith(3, maxDistanceLeft));\\n add(currentContains, shifts[5].trivialProductWith(2, maxDistanceLeft));\\n add(currentContains, shifts[6].trivialProductWith(1, maxDistanceLeft));\\n //System.out.print(\\\"Poly: Values after second removal: \\\");\\n //printArray(currentContains);\\n subtract(currentContains, shifts[7].getFullArray(maxDistanceLeft));\\n //System.out.println(shifts[7]);\\n //System.out.print(\\\"Poly: final values: \\\");\\n //printArray(currentContains);\\n return currentContains;\\n }\",\n \"public static void main(String[] args){\\n int MIN = Integer.parseInt(args[0]);\\n MAX = Integer.parseInt(args[1]);\\n cutoffs = new int[args.length - 2];\\n cache = new ArrayList<IndexedArrayList<SuperSavvyTrieHelper2>>();\\n for (int i = 2; i < args.length; i++){\\n cutoffs[i - 2] = Integer.parseInt(args[i]);\\n cache.add(new IndexedArrayList<SuperSavvyTrieHelper2>());\\n }\\n for (int i = 0; i < cutoffs.length / 2; i++){\\n int temp = cutoffs[i];\\n cutoffs[i] = cutoffs[cutoffs.length - 1 - i];\\n cutoffs[cutoffs.length - 1 - i] = temp;\\n }\\n multiplicitiesUsed = new boolean[MAX + 1];\\n basesUsed = new DoublyLinkedArray(MAX + 1);\\n SuperSavvyTrieHelper2.setCorrespondance(basesUsed);\\n /*\\n long count1 = lowerRecursion(MAX, 0);\\n long count2 = middleRecursion(MAX, 0);\\n long count3 = upperRecursion(MAX, 0);\\n long total = count1 + count2 + count3;\\n System.out.printf(\\\"%d + %d + %d = %d\\\\n\\\", count1, count2, count3, total);\\n */\\n hitCounts = new long[cutoffs.length];\\n missCounts = new long[cutoffs.length];\\n statCollector = new StatCollector(cutoffs);\\n\\n long startTime = System.nanoTime();\\n long[] values = new long[MAX - MIN + 1];\\n for (int i = MIN; i <= MAX; i++) {\\n values[i - MIN] = upperRecursionWrapper(i);\\n }\\n //long[] testValues = new long[] {1752443,1911046, 2067456,2249444,2429337, 2647532,2852449,3101167,3350292,3632299,3916575};\\n for (int i = 0; i < values.length; i++){\\n //if (testValues[i] != values[i]){\\n System.out.printf(\\\"%d: %d\\\\n\\\", i + MIN, values[i]);\\n //}\\n }\\n long endTime = System.nanoTime();\\n System.out.printf(\\\"%f,\\\", (double)(endTime - startTime) / 1000000000.0);\\n long totalMissCounts = 0;\\n long totalMissWeight1 = 0;\\n long totalMissWeight2 = 0;\\n long totalMissWeight3 = 0;\\n /*\\n for (int i = 0; i < cutoffs.length; i++){\\n long totalCounts = hitCounts[i] + missCounts[i];\\n totalMissCounts += missCounts[i];\\n totalMissWeight1 += missCounts[i] * cutoffs[i];\\n totalMissWeight2 += (hitCounts[i] / missCounts[i]) * cutoffs[i];\\n totalMissWeight3 += (hitCounts[i] - missCounts[i]) * cutoffs[i] * cutoffs[i];\\n System.out.printf(\\\"\\\\tCache %d: %d/%d/%d (%.5f%%)\\\", cutoffs[i], hitCounts[i], missCounts[i], totalCounts, (double) hitCounts[i] / totalCounts);\\n }\\n System.out.printf(\\\"\\\\t\\\\tMissCounts: %d, weighted: %d, ratio: %d, diff^2: %d\\\\n\\\", totalMissCounts, totalMissWeight1, totalMissWeight2, totalMissWeight3);\\n */\\n statCollector.printAll();\\n }\",\n \"public static void main(String[] args) throws IOException {\\n int max = 100000;\\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\\n\\n N = Integer.parseInt(br.readLine());\\n\\n int arr[] = new int[max+1];\\n\\n for (int p=2; p<=99999; p++)\\n {\\n if (arr[p] == 0)\\n { arr[p] = 1;\\n for (int i=p*2; i<=max; i += p) {\\n arr[i]++;\\n }\\n }\\n }\\n\\n int mat[][] = new int[6][max+1];\\n// for (int i = 2; i < arr.length; i++) {\\n// mat[arr[i]][i] = 1;\\n// }\\n\\n for (int i = 1; i < 6; i++) {\\n for (int j = 2; j < mat[0].length; j++) {\\n if(arr[j] == i) {\\n mat[i][j] = mat[i][j - 1]+1;\\n } else {\\n mat[i][j] = mat[i][j - 1];\\n }\\n }\\n }\\n\\n\\n for (int i = 0; i < N; i++) {\\n String str[] = br.readLine().split(\\\" \\\");\\n int a = Integer.parseInt(str[0]);\\n int b = Integer.parseInt(str[1]);\\n int k = Integer.parseInt(str[2]);\\n int ans = mat[k][b]-mat[k][a-1];\\n System.out.println(ans);\\n }\\n }\",\n \"private static Population getBestPossibleParettoOfAGS(){\\n int numberOfRounds = 10;\\n Population allFrontsMembers = new Population();\\n\\n NSGAII nsgaii = new NSGAII();\\n SPEA2 spea2 = new SPEA2();\\n AEMMT aemmt = new AEMMT();\\n AEMMD aemmd = new AEMMD();\\n MOEAD moead = new MOEAD();\\n\\n ProblemKnapsackFromFile problem = new ProblemKnapsackFromFile(macPathGetProblemFrom);\\n progressBar = new ProgressBar((double) numberOfRounds);\\n\\n for (int i = 0; i < numberOfRounds; i++) {\\n\\n Parameters.NUMBER_OF_GENERATIONS = problem.items.size() < 100? 100 : 200;\\n\\n System.out.println(\\\"NSGAII\\\");\\n nsgaii.runAlgorithm(problem);\\n allFrontsMembers.population.addAll(nsgaii.paretto.membersAtThisFront);\\n\\n System.out.println(\\\"SPEA2\\\");\\n spea2.runAlgorithm(problem);\\n allFrontsMembers.population.addAll(spea2.paretto.membersAtThisFront);\\n\\n //moead.runAlgorithm(problem);\\n //allFrontsMembers.population.addAll( moead.pareto.membersAtThisFront);\\n\\n Parameters.NUMBER_OF_GENERATIONS = 15000;\\n System.out.println(\\\"AEMMT\\\");\\n aemmt.runAlgorithm(problem);\\n allFrontsMembers.population.addAll(aemmt.paretto.membersAtThisFront);\\n\\n System.out.println(\\\"AEMMD\\\");\\n aemmd.runAlgorithm(problem);\\n allFrontsMembers.population.addAll(aemmd.paretto.membersAtThisFront);\\n\\n progressBar.addJobDone();\\n\\n allFrontsMembers.fastNonDominatedSort();\\n Problem.removeSimilar(allFrontsMembers.fronts.allFronts.get(0),problem);\\n allFrontsMembers.population = allFrontsMembers.fronts.allFronts.get(0).membersAtThisFront;\\n }\\n\\n problem.printResolutionMessage();\\n //Printer.printBinaryMembers(allFrontsMembers);\\n System.out.println(\\\"ALL FRONTS SIZE: \\\"+allFrontsMembers.population.size());\\n\\n return allFrontsMembers;\\n }\",\n \"public static void ComputeTables() {\\n int[][] nbl2bit\\n = {\\n new int[]{1, 0, 0, 0}, new int[]{1, 0, 0, 1}, new int[]{1, 0, 1, 0}, new int[]{1, 0, 1, 1},\\n new int[]{1, 1, 0, 0}, new int[]{1, 1, 0, 1}, new int[]{1, 1, 1, 0}, new int[]{1, 1, 1, 1},\\n new int[]{-1, 0, 0, 0}, new int[]{-1, 0, 0, 1}, new int[]{-1, 0, 1, 0}, new int[]{-1, 0, 1, 1},\\n new int[]{-1, 1, 0, 0}, new int[]{-1, 1, 0, 1}, new int[]{-1, 1, 1, 0}, new int[]{-1, 1, 1, 1}\\n };\\n\\n int step, nib;\\n\\n /* loop over all possible steps */\\n for (step = 0; step <= 48; step++) {\\n /* compute the step value */\\n int stepval = (int) (Math.floor(16.0 * Math.pow(11.0 / 10.0, (double) step)));\\n\\n\\n /* loop over all nibbles and compute the difference */\\n for (nib = 0; nib < 16; nib++) {\\n diff_lookup[step * 16 + nib] = nbl2bit[nib][0]\\n * (stepval * nbl2bit[nib][1]\\n + stepval / 2 * nbl2bit[nib][2]\\n + stepval / 4 * nbl2bit[nib][3]\\n + stepval / 8);\\n }\\n }\\n }\",\n \"public void readSet() throws IOException {\\n temps = new HashSet<String>();\\n readDescription();\\n // adds the words in the temporary set to the temp array\\n for (String w : temps) {\\n if (w.equals(\\\"dana\\\")) {\\n System.out.println(w + \\\" was called +1\\\");\\n }\\n int v = d.getValue(w);\\n arr[v]++;\\n if (w.equals(\\\"subj\\\")) {\\n System.out.println(w + \\\" was called +1\\\");\\n System.out.println(arr[v] + \\\" is the number of the array of \\\" + w);\\n }\\n }\\n temps = new HashSet<String>();\\n readDescription();\\n // does the same thing above, except since this is the second\\n // description, subtract 1 from array\\n for (String w : temps) {\\n int v = d.getValue(w);\\n arr[v]--;\\n if (w.equals(\\\"subj\\\")) {\\n System.out.println(w + \\\" was called -1\\\");\\n System.out.println(arr[v] + \\\" is the number of the array of \\\" + w);\\n }\\n }\\n // get the prices\\n int p1 = getPrice();\\n int p2 = getPrice();\\n // get the answer value\\n // a should be the correct answer\\n // b should be the answer they choose\\n int a = getAnswer();\\n int b = getAnswer();\\n // System.out.println(\\\"The correct answer is: \\\" + a +\\n // \\\" The chosen answer is: \\\" + b);\\n int y_real;\\n DecimalFormat numberFormat = new DecimalFormat(\\\"#.####\\\");\\n double real_ratio;\\n double mturk_ratio;\\n if (p1 > p2) {\\n y_real = p1 - p2;\\n real_ratio = (double) p1 / p2;\\n } else {\\n y_real = p2 - p1;\\n real_ratio = (double) p2 / p1;\\n }\\n int pdiff;\\n if (a == b) {\\n pdiff = y_real;\\n mturk_ratio = real_ratio;\\n } else {\\n pdiff = -y_real;\\n mturk_ratio = 1 / real_ratio;\\n }\\n if (p2 > p1) {\\n for (int i = 0; i < arr.length; i++) {\\n arr[i] = -arr[i];\\n }\\n }\\n w.write(pdiff + \\\" \\\");\\n w.write(numberFormat.format(real_ratio) + \\\" \\\");\\n w.write(numberFormat.format(mturk_ratio) + \\\" \\\");\\n for (int i = 0; i < size; i++) {\\n if (i != arr.length - 1) {\\n w.write(arr[i] + \\\" \\\");\\n } else {\\n w.write(arr[i]);\\n }\\n }\\n w.write(\\\"\\\\n\\\");\\n arr = new int[size];\\n }\",\n \"public static void main(String[] args) {\\n int[] array1 = {50, 39, 21, 88, 17};\\n int max = 0;\\n for (int value : array1) {\\n if (value > max)\\n max = value;\\n }\\n System.out.print(\\\"Maximum value in the array is \\\" + max);\\n System.out.println();\\n\\n // Separate zeros from non-zeros in an array\\n int[] array2 = {50, 0, 39, 21, 0, 0, 88, 17};\\n int index = 0;\\n for (int i=0; i<array2.length; i++) {\\n if (array2[i] != 0){\\n array2[index] = array2[i];\\n index++;\\n }\\n }\\n while ( index < array2.length ) {\\n array2[index] = 0;\\n index++;\\n }\\n System.out.println( Arrays.toString(array2) );\\n\\n // Find intersection of two arrays in java\\n int[] x = {50, 39, 21, 88, 17};\\n int[] y = {21, 13, 63, 17, 46};\\n\\n HashSet<Integer> xSet = new HashSet<>();\\n for (int value : x) xSet.add(value);\\n\\n System.out.print(\\\"Intersection of two arrays: \\\");\\n for (int value : y) {\\n if (xSet.contains(value))\\n System.out.print(value + \\\" \\\");\\n }\\n System.out.println();\\n\\n // Find continuous sub array whose sum is equal to given number\\n int[] array3 = {42, 15, 12, 8, 6, 32};\\n int given = 26;\\n int sum;\\n\\n System.out.print(\\\"Continuous sub array whose sum is \\\" + given + \\\": \\\");\\n for ( int i = 0; i<array3.length; i++ ) {\\n sum = array3[i];\\n for (int j = i+1; j < array3.length; j++) {\\n sum = sum + array3[j];\\n if (sum == given){\\n for (int k = i; k <= j; k++)\\n System.out.print(array3[k]+\\\" \\\");\\n System.out.println();\\n }\\n else if (sum > given)\\n break;\\n }\\n }\\n\\n }\",\n \"static long arrayManipulation(int n, int[][] queries) {\\r\\n long result = 0, sum = 0;\\r\\n long[] arr = new long[n];\\r\\n for(int i = 0; i < queries.length; i++){\\r\\n int firstIndex = queries[i][0] - 1;\\r\\n int lastIndex = queries[i][1] - 1;\\r\\n long numberToAdd = queries[i][2];\\r\\n arr[firstIndex] += numberToAdd;\\r\\n if (lastIndex+1 < n)\\r\\n arr[lastIndex+1] -= numberToAdd;\\r\\n }\\r\\n\\r\\n for(long l : arr){\\r\\n sum += l;\\r\\n if(sum > result)\\r\\n result = sum;\\r\\n }\\r\\n\\r\\n return result;\\r\\n }\",\n \"static void hashTestCase(int givArr[]) {\\n\\t\\tfor (int i = 0; i < m; i++) {\\n\\t\\t\\tint mod = givArr[i] % m;\\n\\t\\t\\tarray[mod] = givArr[i];\\n\\t\\t}\\n\\t}\",\n \"public static void main(String[] args) {\\n\\t\\tScanner scan=new Scanner(System.in);\\n\\t\\tint N=scan.nextInt();\\n\\t\\tint a=scan.nextInt();\\n\\t\\tint b=scan.nextInt();\\n\\t\\tint[] nums=new int[N];\\n\\t\\tint[][] weight=new int[N][N];\\n\\t\\tfor(int i=0;i<N;i++){\\n\\t\\t\\tnums[i]=scan.nextInt();\\n\\t\\t\\tweight[i][i]=nums[i];\\n\\t\\t}\\n\\t\\tfor(int i=0;i<N;i++){\\n\\t\\t\\tfor(int j=i+1;j<N;j++){\\n\\t\\t\\t\\tweight[i][j]=weight[i][j-1]+nums[j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tlong[][] dp=new long[N][N];\\n\\t\\tfor(int i=2;i<=N;i++){//dis\\n\\t\\t\\tfor(int j=0;j<=N-i;j++){//start\\n\\t\\t\\t\\tint end=j+i-1;\\n\\t\\t\\t\\tlong min=Integer.MAX_VALUE;\\n\\t\\t\\t\\tfor(int k=j;k<end;k++){\\n\\t\\t\\t\\t\\tmin=Math.min(min, dp[j][k]+dp[k+1][end]+weight[j][k]*a+weight[k+1][end]*b);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tdp[j][end]=min;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tSystem.out.println(dp[0][N-1]);\\n\\t\\tscan.close();\\n\\t}\",\n \"public static void main(String[] args) {\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t\\tArrayOfFraction arr1= new ArrayOfFraction();\\r\\n\\t\\tarr1.add(new Fraction(3,1));\\r\\n\\t\\tarr1.add(new Fraction(4,2));\\r\\n\\t\\tarr1.add(new Fraction(5,3));\\r\\n\\t\\tarr1.add(new Fraction(6,7));\\r\\n\\t\\t\\r\\n\\t\\tfor(int i=0;i<arr1.size();i++)\\r\\n\\t\\t{\\r\\n\\t\\t\\tSystem.out.println(arr1.a[i].divide());\\r\\n\\t\\t}\\r\\n//\\t\\tFraction fr1 = new Fraction();\\r\\n//\\t\\tfr1.input();\\r\\n//\\t\\tarr1.add(fr1);\\r\\n//\\t\\t\\r\\n//\\t\\tFraction fr2 = new Fraction();\\r\\n//\\t\\tfr2.input();\\r\\n//\\t\\tarr1.add(fr2);\\r\\n//\\t\\t\\r\\n//\\t\\tFraction fr3 = new Fraction();\\r\\n//\\t\\tfr3.input();\\r\\n//\\t\\tarr1.add(fr3);\\r\\n//\\t\\t\\r\\n//\\t\\tarr1.output();\\r\\n\\t\\t\\r\\n//\\t\\tSystem.out.println(\\\"get ra gia tri index: \\\"+arr1.get(0));\\r\\n\\r\\n//\\t\\tFraction fr4 = new Fraction();\\r\\n//\\t\\tfr4.input();\\r\\n//\\t\\tarr1.set(2,fr4 );\\r\\n//\\t\\tarr1.output();\\r\\n//\\t\\t\\r\\n//\\t\\t\\r\\n//\\t\\tFraction fr5 = new Fraction();\\r\\n//\\t\\tfr5.input();\\r\\n//\\t\\tarr1.add(1, fr5);\\r\\n//\\t\\tarr1.output();\\r\\n\\t\\t\\r\\n//\\t\\tarr1.remove(2);\\r\\n//\\t\\tarr1.output();\\r\\n\\t\\t\\r\\n//\\t\\tFraction fr6 = new Fraction();\\r\\n//\\t\\tfr6.input();\\r\\n//\\t\\tSystem.out.println(arr1.indexOf(fr6));\\r\\n\\t\\t\\r\\n//\\t\\tFraction fr7 = new Fraction();\\r\\n//\\t\\tfr7.input();\\r\\n//\\t\\tSystem.out.println(arr1.indexOf(r7));\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n//\\t\\tSystem.out.println(arr1.toString());\\r\\n\\t\\t\\r\\n\\t}\",\n \"private void genProb() {\\n\\t\\tint row;\\n\\t\\tint column;\\n\\t\\tint removed1;\\n\\t\\tint removed2;\\n\\n\\t\\tfor (int i = 0; i < DIFFICULTY / 2;) {\\n\\t\\t\\trow = rand.nextInt(9);\\n\\t\\t\\tcolumn = rand.nextInt(9);\\n\\t\\t\\twhile (problem[row][column] == 0 || (row == 4 && column == 4)) {\\n\\t\\t\\t\\trow = rand.nextInt(9);\\n\\t\\t\\t\\tcolumn = rand.nextInt(9);\\n\\t\\t\\t}\\n\\n\\t\\t\\t// Clearing random boxes.\\n\\t\\t\\tremoved1 = problem[row][column];\\n\\t\\t\\tremoved2 = problem[8 - row][8 - column];\\n\\t\\t\\tproblem[row][column] = 0;\\n\\t\\t\\tproblem[8 - row][8 - column] = 0;\\n\\n\\t\\t\\tcopy(problem, comp);\\n\\n\\t\\t\\tif (!solve(0, 0, 0, comp)) { // Case of unsolvable.\\n\\t\\t\\t\\t// Putting back original values.\\n\\t\\t\\t\\tproblem[row][column] = removed1;\\n\\t\\t\\t\\tproblem[8 - row][8 - column] = removed2;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tif (unique()) { // Case of solution is unique.\\n\\t\\t\\t\\t\\ti++;\\n\\t\\t\\t\\t} else { // Case of solution is not unique.\\n\\t\\t\\t\\t\\t// Putting back original values.\\n\\t\\t\\t\\t\\tproblem[row][column] = removed1;\\n\\t\\t\\t\\t\\tproblem[8 - row][8 - column] = removed2;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"public static void main(String[] args) {\\n\\t\\tArrayList<Integer> primelist = sieve(7071);\\n\\t\\tArrayList<Double> second = new ArrayList<Double>();\\n\\t\\tfor(int one : primelist) \\n\\t\\t\\tsecond.add(Math.pow(one, 2));\\n\\t\\tArrayList<Double> third = new ArrayList<Double>();\\n\\t\\tprimelist = sieve(368);\\n\\t\\tfor(int one : primelist)\\n\\t\\t\\tthird.add(Math.pow(one, 3));\\n\\t\\tArrayList<Double> fourth = new ArrayList<Double>();\\n\\t\\tprimelist = sieve(84);\\n\\t\\tfor(int one : primelist)\\n\\t\\t\\tfourth.add(Math.pow(one, 4));\\n\\n\\t\\tArrayList<Double> possibilities = new ArrayList<Double>();\\n\\t\\tfor (int k = fourth.size() - 1; k >=0 ; k--) {\\n\\t\\t\\tfor (int j = 0; j < third.size(); j++) {\\n\\t\\t\\t\\tdouble sum = fourth.get(k) + third.get(j);\\n\\t\\t\\t\\tif (sum > 50000000)\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tfor (int i = 0; i < second.size(); i++) {\\n\\t\\t\\t\\t\\t\\tdouble nextsum = sum + second.get(i);\\n\\t\\t\\t\\t\\t\\tif (nextsum > 50000000)\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\t\\t// I am not sure whether it can be proved that the sum is unique.\\n\\t\\t\\t\\t\\t\\t\\tif (!possibilities.contains(nextsum))\\n\\t\\t\\t\\t\\t\\t\\t\\tpossibilities.add(nextsum);\\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}\\n\\t\\tint totalcount = possibilities.size();\\n\\t\\tSystem.out.println(totalcount);\\n\\t}\",\n \"public void calculateEffectiveness(){\\n double[] typeEffective = new double[18];\\n \\n for(int i = 0; i < 18; i++){\\n typeEffective[i] = tc.getEffectiveNumber(i, tc.convertType(type1));\\n }\\n \\n if(type2 != null){\\n for(int i = 0; i < 18; i++){\\n typeEffective[i] *= tc.getEffectiveNumber(i, tc.convertType(type2));\\n }\\n }\\n \\n for(int i = 0; i < 18; i++){\\n if(typeEffective[i] != 1){\\n if(typeEffective[i] > 1){\\n double[] newWeak = {i,typeEffective[i]};\\n weak.add(newWeak);\\n }else{\\n double[] newStrong = {i,typeEffective[i]};\\n strong.add(newStrong);\\n }\\n }\\n }\\n }\",\n \"@Test\\n public void testFactor_intArr_intArr() {\\n System.out.println(\\\"factor\\\");\\n int[] number = new int[]{0, 1, 2, 3, 4, 5, 6, 7, 8, 9};\\n int[] weighting = new int[]{2, 1, 2, 1, 2, 1, 2, 1, 2};\\n AbstractMethod instance = new AbstractMethodImpl();\\n int[] expResult = new int[]{0, 1, 4, 3, 8, 5, 12, 7, 16, 9};\\n int[] result = instance.factor(number, weighting);\\n assertArrayEquals(expResult, result);\\n\\n }\",\n \"private static void find_coins(int[] d, int k, int n) {\\n\\t\\t\\n\\t}\",\n \"public static void main(String[] args) \\n {\\n int[] array1 = new int[10]; // create the array object/declare variable array and initialize it with an array object\\n System.out.printf(\\\"%s%8s%n\\\", \\\"Index1\\\", \\\"Value\\\"); // column headings\\n //output each array element's value\\n for (int counter = 0; counter < array1.length; counter++)\\n System.out.printf(\\\"%5d%8d%n\\\", counter, array1[counter]);\\n \\n //fig 7.3: Initializing the elements of an array with an array initializer\\n int[] array2 = { 32, 27, 64, 18, 95, 14, 90, 70, 60, 37 };// initializer list specifies the initial value for each element\\n System.out.printf(\\\"%s%8s%n\\\", \\\"Index2\\\", \\\"Value\\\"); // column headings\\n // output each array element's value\\n for (int counter = 0; counter < array2.length; counter++)\\n System.out.printf(\\\"%5d%8d%n\\\", counter, array2[counter]);\\n \\n //fig 7.4: Calculating the values to be placed into the elements of an array. \\n final int ARRAY_LENGTH = 10;// declare constant\\n int[] array3 = new int[ARRAY_LENGTH]; // create array \\n // calculate value for each array element\\n for (int counter = 0; counter < array3.length; counter++)\\n array3[counter] = 2 + 2 * counter;\\n System.out.printf(\\\"%s%8s%n\\\", \\\"Index3\\\", \\\"Value\\\"); // column headings \\n // output each array element's value\\n for (int counter = 0; counter < array3.length; counter++)\\n System.out.printf(\\\"%5d%8d%n\\\", counter, array3[counter]);\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.5661348","0.55741626","0.5551597","0.55431396","0.55388886","0.553581","0.5500462","0.5494798","0.54739","0.5432241","0.5417037","0.53727186","0.53550833","0.53529763","0.5311245","0.52881646","0.52619565","0.5260917","0.5254436","0.52511024","0.5244527","0.52437174","0.5242457","0.5217711","0.5212873","0.51961637","0.51792264","0.5177254","0.5176823","0.51712716","0.5164753","0.51572835","0.514308","0.51293373","0.5125508","0.5118507","0.5109598","0.51070064","0.5093574","0.50897753","0.50846785","0.5084131","0.5083072","0.5080775","0.50805783","0.50744516","0.50734895","0.50692755","0.50683767","0.50639415","0.5060889","0.5060427","0.50581497","0.50556","0.5051615","0.5048557","0.50463885","0.504507","0.5044551","0.50404334","0.5039978","0.5038317","0.5026038","0.50254637","0.5025342","0.50236183","0.50212604","0.5018753","0.50178885","0.5015065","0.5011741","0.5011493","0.5009919","0.50097656","0.5003648","0.5001959","0.49960414","0.499426","0.49937922","0.49935728","0.49921975","0.49909917","0.49894848","0.49846682","0.4983365","0.49821046","0.49801543","0.49793172","0.49782088","0.49725902","0.49723402","0.4971883","0.49694797","0.49694663","0.4968446","0.49636364","0.4962779","0.4962444","0.4956971","0.49508545"],"string":"[\n \"0.5661348\",\n \"0.55741626\",\n \"0.5551597\",\n \"0.55431396\",\n \"0.55388886\",\n \"0.553581\",\n \"0.5500462\",\n \"0.5494798\",\n \"0.54739\",\n \"0.5432241\",\n \"0.5417037\",\n \"0.53727186\",\n \"0.53550833\",\n \"0.53529763\",\n \"0.5311245\",\n \"0.52881646\",\n \"0.52619565\",\n \"0.5260917\",\n \"0.5254436\",\n \"0.52511024\",\n \"0.5244527\",\n \"0.52437174\",\n \"0.5242457\",\n \"0.5217711\",\n \"0.5212873\",\n \"0.51961637\",\n \"0.51792264\",\n \"0.5177254\",\n \"0.5176823\",\n \"0.51712716\",\n \"0.5164753\",\n \"0.51572835\",\n \"0.514308\",\n \"0.51293373\",\n \"0.5125508\",\n \"0.5118507\",\n \"0.5109598\",\n \"0.51070064\",\n \"0.5093574\",\n \"0.50897753\",\n \"0.50846785\",\n \"0.5084131\",\n \"0.5083072\",\n \"0.5080775\",\n \"0.50805783\",\n \"0.50744516\",\n \"0.50734895\",\n \"0.50692755\",\n \"0.50683767\",\n \"0.50639415\",\n \"0.5060889\",\n \"0.5060427\",\n \"0.50581497\",\n \"0.50556\",\n \"0.5051615\",\n \"0.5048557\",\n \"0.50463885\",\n \"0.504507\",\n \"0.5044551\",\n \"0.50404334\",\n \"0.5039978\",\n \"0.5038317\",\n \"0.5026038\",\n \"0.50254637\",\n \"0.5025342\",\n \"0.50236183\",\n \"0.50212604\",\n \"0.5018753\",\n \"0.50178885\",\n \"0.5015065\",\n \"0.5011741\",\n \"0.5011493\",\n \"0.5009919\",\n \"0.50097656\",\n \"0.5003648\",\n \"0.5001959\",\n \"0.49960414\",\n \"0.499426\",\n \"0.49937922\",\n \"0.49935728\",\n \"0.49921975\",\n \"0.49909917\",\n \"0.49894848\",\n \"0.49846682\",\n \"0.4983365\",\n \"0.49821046\",\n \"0.49801543\",\n \"0.49793172\",\n \"0.49782088\",\n \"0.49725902\",\n \"0.49723402\",\n \"0.4971883\",\n \"0.49694797\",\n \"0.49694663\",\n \"0.4968446\",\n \"0.49636364\",\n \"0.4962779\",\n \"0.4962444\",\n \"0.4956971\",\n \"0.49508545\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.5275454"},"document_rank":{"kind":"string","value":"16"}}},{"rowIdx":27386,"cells":{"query":{"kind":"string","value":"Gets jaxb context data."},"document":{"kind":"string","value":"@Test\n void getJaxbContextData(SoftAssertions softly) {\n ComparatorJaxbContextDataProvider target = new ComparatorJaxbContextDataProvider();\n Collection<JaxbContextData> actual = target.getJaxbContextData();\n softly.assertThat(actual)\n .containsExactly(new JaxbContextData(ObjectFactory.class.getPackage()));\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["private JAXBContext getJaxContext()\n {\n JAXBContext jc = null;\n \n try\n {\n jc = JAXBContext.newInstance(\"generated\");\n }\n catch (JAXBException e)\n {\n e.printStackTrace();\n }\n return jc;\n }","public Object getPayload(JAXBContext context);","com.google.protobuf.ByteString\n getContextBytes();","Map<String, Object> getContext();","public final Object getContextInfo() {\n return this.info;\n }","public com.google.protobuf.ByteString getContext() {\n return context_;\n }","public com.google.protobuf.ByteString getContext() {\n return context_;\n }","public String getContext() { return context; }","public String getContext() {\n return context;\n }","public String getContext() {\n return context;\n }","public String getContext() {\n return context;\n }","com.google.protobuf.ByteString getContext();","public static Context getContext(){\n return appContext;\n }","public Object getContextObject() {\n return context;\n }","public String getContext() {\n\t\treturn context;\n\t}","public String getContext() {\r\n\t\treturn context;\r\n\t}","public org.apache.axis2.context.xsd.ServiceContext getServiceContext(){\n return localServiceContext;\n }","public Context getContext() {\n return context;\n }","@Override\r\n\tpublic Context getContext() {\r\n\t\treturn this.context;\r\n\t}","public org.apache.axis2.context.xsd.ConfigurationContext getConfigurationContext(){\n return localConfigurationContext;\n }","public static JAXBContext getJAXBContext() throws JAXBException {\n synchronized (ContextUtils.class) {\n if (jaxbContext == null) {\n jaxbContext =\n JAXBContext.newInstance(\n WSA_OBJECT_FACTORY.getClass().getPackage().getName(),\n WSA_OBJECT_FACTORY.getClass().getClassLoader());\n }\n }\n return jaxbContext;\n }","public Context getContext() {\n\t\treturn context;\n\t}","public Context getContext() {\r\n\t\treturn context;\r\n\t}","@JsonProperty(\"context\")\n public Context getContext() {\n return context;\n }","Context getContext();","public static BundleContext getContext() {\n return context;\n }","public org.apache.axis2.context.xsd.ConfigurationContext getRootContext(){\n return localRootContext;\n }","public static Context getContext() {\n\t\treturn context;\n\t}","public static Context getContext() {\n\t\treturn context;\n\t}","public Map<String, Object> context() {\n return unmodifiableMap(context);\n }","protected RestContext getContext() {\n\t\tif (context.get() == null)\n\t\t\tthrow new InternalServerError(\"RestContext object not set on resource.\");\n\t\treturn context.get();\n\t}","ContextBucket getContext() {\n\treturn context;\n }","public Map<String, Object> clientContext() {\n return clientContext;\n }","@Override\n public Context getContext() {\n return this.getApplicationContext();\n }","@java.lang.Override public int getContextValue() {\n return context_;\n }","@java.lang.Override public int getContextValue() {\n return context_;\n }","public Context getContext() {\n return this.mService.mContext;\n }","public com.google.protobuf.ByteString\n getContextBytes() {\n java.lang.Object ref = context_;\n if (ref instanceof String) {\n com.google.protobuf.ByteString b = \n com.google.protobuf.ByteString.copyFromUtf8(\n (java.lang.String) ref);\n context_ = b;\n return b;\n } else {\n return (com.google.protobuf.ByteString) ref;\n }\n }","public ContextRequest getContext() {\n\t\treturn context;\n\t}","public com.google.protobuf.ByteString\n getContextBytes() {\n java.lang.Object ref = context_;\n if (ref instanceof java.lang.String) {\n com.google.protobuf.ByteString b = \n com.google.protobuf.ByteString.copyFromUtf8(\n (java.lang.String) ref);\n context_ = b;\n return b;\n } else {\n return (com.google.protobuf.ByteString) ref;\n }\n }","String getContextPath() {\n return contextPath;\n }","Context getContext() {\n Context context = mContextRef.get();\n return context != null ? context : AppUtil.getAppContext();\n }","public ConfigContext getConfigContext() {\n\n return (ConfigContext)getSource();\n\n }","public static String getTestdataContext() {\r\n if (testdataContext == null) {\r\n testdataContext = PropertiesProvider.getInstance().getProperty(\"testdata.context\", \"/testdata\");\r\n }\r\n return testdataContext;\r\n }","public Attributes getContextAttributes() {\r\n return this.atts;\r\n }","public java.lang.String getContext() {\n java.lang.Object ref = context_;\n if (ref instanceof java.lang.String) {\n return (java.lang.String) ref;\n } else {\n com.google.protobuf.ByteString bs = \n (com.google.protobuf.ByteString) ref;\n java.lang.String s = bs.toStringUtf8();\n context_ = s;\n return s;\n }\n }","public static BundleContext getBundleContext()\r\n {\r\n return bundleContext;\r\n }","protected static JAXBContext getJaxbContext(Class<?> clazz) {\n\t\tJAXBContext jaxbContext = jaxbContexts.get(clazz);\n\t\tif (jaxbContext == null) {\n\t\t\ttry {\n\t\t\t\tjaxbContext = JAXBContext.newInstance(clazz, CollectionWrapper.class);\n\t\t\t\tjaxbContexts.putIfAbsent(clazz, jaxbContext);\n\t\t\t} catch (JAXBException ex) {\n\t\t\t\tthrow new SystemException(ex, \"不能为类 [{0}]创建JAXBContext: {1}\", clazz, ex.getMessage());\n\t\t\t}\n\t\t}\n\t\treturn jaxbContext;\n\t}","public static Context getResourceContext() {\n return context;\n }","ApplicationContext getAppCtx();","public PortletContext getPortletContext ()\n {\n \treturn config.getPortletContext();\n }","java.lang.String getContext();","public java.lang.String getContext() {\n java.lang.Object ref = context_;\n if (!(ref instanceof java.lang.String)) {\n com.google.protobuf.ByteString bs =\n (com.google.protobuf.ByteString) ref;\n java.lang.String s = bs.toStringUtf8();\n context_ = s;\n return s;\n } else {\n return (java.lang.String) ref;\n }\n }","public IRuntimeContext getContext() {\n return fContext;\n }","public Context getContext() {\n\t\treturn null;\n\t}","public static Context getContext() {\n if (sContext == null) {\n throw new RuntimeException(APPLICATION_CONTEXT_IS_NULL);\n }\n return sContext;\n }","public ComponentContext getContext()\n\t{\n\t\treturn context;\n\t}","Context context();","Context context();","public String getContextProperty() {\n return _contextProperty;\n }","protected abstract JAXBContext getJAXBContext(Class[] classes, ClassLoaderResolver clr) throws JAXBException;","public cl_context getContext() {\r\n return context;\r\n }","public Object getConnectionContext() {\n return connectionContext;\n }","public Context getContext() {\n return this.mContext;\n }","public Context getContext() {\n return this.mContext;\n }","public Context getContext() {\n\t\treturn ctx;\n\t}","public IContextInformation getContextInformation()\n {\n return null;\n }","private Context getContext() {\n return mContext;\n }","private Context getContext() {\n return mContext;\n }","@Override\n\tpublic String getContextPath() {\n\t\treturn contextPath;\n\t}","public static Map<String, Object> getJsonldContext() {\n if (jsonldContext == null) {\n jsonldContext = new HashMap<String, Object>();\n Map<String, String> map = get().getNsPrefixMap();\n for (Map.Entry<String, String> entry : map.entrySet()) {\n jsonldContext.put(entry.getKey(), entry.getValue());\n }\n }\n return jsonldContext;\n }","public String getContext() {\n\t\treturn this.getClass().getSimpleName();\n\t}","public String getContextString();","public NamespaceContext getNamespaceContext() {\n LOGGER.entering(JsonXmlStreamReader.class.getName(), \"getNamespaceContext\");\n NamespaceContext result = new JsonNamespaceContext();\n LOGGER.exiting(JsonXmlStreamReader.class.getName(), \"getNamespaceContext\", result);\n return result;\n }","public ContextNode getContextNode();","public Context getContext() {\n return mContext;\n }","public ActionBeanContext getContext() {\r\n return context;\r\n }","public Context getContext() {\n\t\treturn mContext;\n\t}","public ServletContext getContext() {\r\n\t\treturn new ContextWrapper(getEvent().getServletContext());\r\n\t}","public UserContext getUserContext();","protected AbstractApplicationContext getServicesContext() {\r\n\t\treturn this.servicesContext;\r\n\t}","public static Context getAppContext() {\n return _BaseApplication.context;\n }","public Context getContext() {\n return contextMain;\n }","public org.omg.CORBA.Context read_Context() {\n throw new org.omg.CORBA.NO_IMPLEMENT();\n }","public String getOperationContext() {\n return this.operationContext;\n }","public String getOperationContext() {\n return this.operationContext;\n }","public static Context getContext() {\n\t\treturn instance;\n\t}","@Override\r\n\tpublic Context getContext() {\n\t\treturn null;\r\n\t}","public Context getContext() {\n return this;\n }","CTX_Context getContext();","public ModuleContext getContext() {\r\n return context;\r\n }","public UsersResourceContext getContext() {\n return _context;\n }","@Override\r\n\tpublic Context getContext()\r\n\t{\n\t\treturn this.getActivity().getApplicationContext();\r\n\t}","public BackingMapManagerContext getContext();","public Context getApplicationContext();","private Context getApplicationContext() {\n\t\treturn this.cordova.getActivity().getApplicationContext();\n\t}","private Context getApplicationContext() {\n\t\treturn this.cordova.getActivity().getApplicationContext();\n\t}","private static synchronized JAXBContext context(Class<? extends Object> clazz) throws JAXBException {\r\n\t\tif(jaxbContext == null){\r\n\t\t\tjaxbContext = JAXBContext.newInstance(new Class[]{clazz});\r\n\t\t\tclasses.add(clazz);\r\n\t\t}\r\n\t\telse if(!classes.contains(clazz)){\r\n\t\t\ttry{\r\n\t\t\t\tclasses.add(clazz);\r\n\t\t\t\tjaxbContext = JAXBContext.newInstance(classes.toArray(new Class[classes.size()]));\r\n\t\t\t}\r\n\t\t\tcatch(JAXBException e){\r\n\t\t\t\tclasses.remove(clazz);\r\n\t\t\t\tthrow e;\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn jaxbContext;\r\n\t}","public static ApplicationContext getApplicationContext() {\n return appContext;\n }","private Context getThreadContext() throws NamingException {\n final ThreadContext threadContext = ThreadContext.getThreadContext();\n if (skipEjbContext(threadContext)) {\n return ContextBindings.getClassLoader();\n }\n final Context context = threadContext.getBeanContext().getJndiEnc();\n return context;\n }"],"string":"[\n \"private JAXBContext getJaxContext()\\n {\\n JAXBContext jc = null;\\n \\n try\\n {\\n jc = JAXBContext.newInstance(\\\"generated\\\");\\n }\\n catch (JAXBException e)\\n {\\n e.printStackTrace();\\n }\\n return jc;\\n }\",\n \"public Object getPayload(JAXBContext context);\",\n \"com.google.protobuf.ByteString\\n getContextBytes();\",\n \"Map<String, Object> getContext();\",\n \"public final Object getContextInfo() {\\n return this.info;\\n }\",\n \"public com.google.protobuf.ByteString getContext() {\\n return context_;\\n }\",\n \"public com.google.protobuf.ByteString getContext() {\\n return context_;\\n }\",\n \"public String getContext() { return context; }\",\n \"public String getContext() {\\n return context;\\n }\",\n \"public String getContext() {\\n return context;\\n }\",\n \"public String getContext() {\\n return context;\\n }\",\n \"com.google.protobuf.ByteString getContext();\",\n \"public static Context getContext(){\\n return appContext;\\n }\",\n \"public Object getContextObject() {\\n return context;\\n }\",\n \"public String getContext() {\\n\\t\\treturn context;\\n\\t}\",\n \"public String getContext() {\\r\\n\\t\\treturn context;\\r\\n\\t}\",\n \"public org.apache.axis2.context.xsd.ServiceContext getServiceContext(){\\n return localServiceContext;\\n }\",\n \"public Context getContext() {\\n return context;\\n }\",\n \"@Override\\r\\n\\tpublic Context getContext() {\\r\\n\\t\\treturn this.context;\\r\\n\\t}\",\n \"public org.apache.axis2.context.xsd.ConfigurationContext getConfigurationContext(){\\n return localConfigurationContext;\\n }\",\n \"public static JAXBContext getJAXBContext() throws JAXBException {\\n synchronized (ContextUtils.class) {\\n if (jaxbContext == null) {\\n jaxbContext =\\n JAXBContext.newInstance(\\n WSA_OBJECT_FACTORY.getClass().getPackage().getName(),\\n WSA_OBJECT_FACTORY.getClass().getClassLoader());\\n }\\n }\\n return jaxbContext;\\n }\",\n \"public Context getContext() {\\n\\t\\treturn context;\\n\\t}\",\n \"public Context getContext() {\\r\\n\\t\\treturn context;\\r\\n\\t}\",\n \"@JsonProperty(\\\"context\\\")\\n public Context getContext() {\\n return context;\\n }\",\n \"Context getContext();\",\n \"public static BundleContext getContext() {\\n return context;\\n }\",\n \"public org.apache.axis2.context.xsd.ConfigurationContext getRootContext(){\\n return localRootContext;\\n }\",\n \"public static Context getContext() {\\n\\t\\treturn context;\\n\\t}\",\n \"public static Context getContext() {\\n\\t\\treturn context;\\n\\t}\",\n \"public Map<String, Object> context() {\\n return unmodifiableMap(context);\\n }\",\n \"protected RestContext getContext() {\\n\\t\\tif (context.get() == null)\\n\\t\\t\\tthrow new InternalServerError(\\\"RestContext object not set on resource.\\\");\\n\\t\\treturn context.get();\\n\\t}\",\n \"ContextBucket getContext() {\\n\\treturn context;\\n }\",\n \"public Map<String, Object> clientContext() {\\n return clientContext;\\n }\",\n \"@Override\\n public Context getContext() {\\n return this.getApplicationContext();\\n }\",\n \"@java.lang.Override public int getContextValue() {\\n return context_;\\n }\",\n \"@java.lang.Override public int getContextValue() {\\n return context_;\\n }\",\n \"public Context getContext() {\\n return this.mService.mContext;\\n }\",\n \"public com.google.protobuf.ByteString\\n getContextBytes() {\\n java.lang.Object ref = context_;\\n if (ref instanceof String) {\\n com.google.protobuf.ByteString b = \\n com.google.protobuf.ByteString.copyFromUtf8(\\n (java.lang.String) ref);\\n context_ = b;\\n return b;\\n } else {\\n return (com.google.protobuf.ByteString) ref;\\n }\\n }\",\n \"public ContextRequest getContext() {\\n\\t\\treturn context;\\n\\t}\",\n \"public com.google.protobuf.ByteString\\n getContextBytes() {\\n java.lang.Object ref = context_;\\n if (ref instanceof java.lang.String) {\\n com.google.protobuf.ByteString b = \\n com.google.protobuf.ByteString.copyFromUtf8(\\n (java.lang.String) ref);\\n context_ = b;\\n return b;\\n } else {\\n return (com.google.protobuf.ByteString) ref;\\n }\\n }\",\n \"String getContextPath() {\\n return contextPath;\\n }\",\n \"Context getContext() {\\n Context context = mContextRef.get();\\n return context != null ? context : AppUtil.getAppContext();\\n }\",\n \"public ConfigContext getConfigContext() {\\n\\n return (ConfigContext)getSource();\\n\\n }\",\n \"public static String getTestdataContext() {\\r\\n if (testdataContext == null) {\\r\\n testdataContext = PropertiesProvider.getInstance().getProperty(\\\"testdata.context\\\", \\\"/testdata\\\");\\r\\n }\\r\\n return testdataContext;\\r\\n }\",\n \"public Attributes getContextAttributes() {\\r\\n return this.atts;\\r\\n }\",\n \"public java.lang.String getContext() {\\n java.lang.Object ref = context_;\\n if (ref instanceof java.lang.String) {\\n return (java.lang.String) ref;\\n } else {\\n com.google.protobuf.ByteString bs = \\n (com.google.protobuf.ByteString) ref;\\n java.lang.String s = bs.toStringUtf8();\\n context_ = s;\\n return s;\\n }\\n }\",\n \"public static BundleContext getBundleContext()\\r\\n {\\r\\n return bundleContext;\\r\\n }\",\n \"protected static JAXBContext getJaxbContext(Class<?> clazz) {\\n\\t\\tJAXBContext jaxbContext = jaxbContexts.get(clazz);\\n\\t\\tif (jaxbContext == null) {\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tjaxbContext = JAXBContext.newInstance(clazz, CollectionWrapper.class);\\n\\t\\t\\t\\tjaxbContexts.putIfAbsent(clazz, jaxbContext);\\n\\t\\t\\t} catch (JAXBException ex) {\\n\\t\\t\\t\\tthrow new SystemException(ex, \\\"不能为类 [{0}]创建JAXBContext: {1}\\\", clazz, ex.getMessage());\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn jaxbContext;\\n\\t}\",\n \"public static Context getResourceContext() {\\n return context;\\n }\",\n \"ApplicationContext getAppCtx();\",\n \"public PortletContext getPortletContext ()\\n {\\n \\treturn config.getPortletContext();\\n }\",\n \"java.lang.String getContext();\",\n \"public java.lang.String getContext() {\\n java.lang.Object ref = context_;\\n if (!(ref instanceof java.lang.String)) {\\n com.google.protobuf.ByteString bs =\\n (com.google.protobuf.ByteString) ref;\\n java.lang.String s = bs.toStringUtf8();\\n context_ = s;\\n return s;\\n } else {\\n return (java.lang.String) ref;\\n }\\n }\",\n \"public IRuntimeContext getContext() {\\n return fContext;\\n }\",\n \"public Context getContext() {\\n\\t\\treturn null;\\n\\t}\",\n \"public static Context getContext() {\\n if (sContext == null) {\\n throw new RuntimeException(APPLICATION_CONTEXT_IS_NULL);\\n }\\n return sContext;\\n }\",\n \"public ComponentContext getContext()\\n\\t{\\n\\t\\treturn context;\\n\\t}\",\n \"Context context();\",\n \"Context context();\",\n \"public String getContextProperty() {\\n return _contextProperty;\\n }\",\n \"protected abstract JAXBContext getJAXBContext(Class[] classes, ClassLoaderResolver clr) throws JAXBException;\",\n \"public cl_context getContext() {\\r\\n return context;\\r\\n }\",\n \"public Object getConnectionContext() {\\n return connectionContext;\\n }\",\n \"public Context getContext() {\\n return this.mContext;\\n }\",\n \"public Context getContext() {\\n return this.mContext;\\n }\",\n \"public Context getContext() {\\n\\t\\treturn ctx;\\n\\t}\",\n \"public IContextInformation getContextInformation()\\n {\\n return null;\\n }\",\n \"private Context getContext() {\\n return mContext;\\n }\",\n \"private Context getContext() {\\n return mContext;\\n }\",\n \"@Override\\n\\tpublic String getContextPath() {\\n\\t\\treturn contextPath;\\n\\t}\",\n \"public static Map<String, Object> getJsonldContext() {\\n if (jsonldContext == null) {\\n jsonldContext = new HashMap<String, Object>();\\n Map<String, String> map = get().getNsPrefixMap();\\n for (Map.Entry<String, String> entry : map.entrySet()) {\\n jsonldContext.put(entry.getKey(), entry.getValue());\\n }\\n }\\n return jsonldContext;\\n }\",\n \"public String getContext() {\\n\\t\\treturn this.getClass().getSimpleName();\\n\\t}\",\n \"public String getContextString();\",\n \"public NamespaceContext getNamespaceContext() {\\n LOGGER.entering(JsonXmlStreamReader.class.getName(), \\\"getNamespaceContext\\\");\\n NamespaceContext result = new JsonNamespaceContext();\\n LOGGER.exiting(JsonXmlStreamReader.class.getName(), \\\"getNamespaceContext\\\", result);\\n return result;\\n }\",\n \"public ContextNode getContextNode();\",\n \"public Context getContext() {\\n return mContext;\\n }\",\n \"public ActionBeanContext getContext() {\\r\\n return context;\\r\\n }\",\n \"public Context getContext() {\\n\\t\\treturn mContext;\\n\\t}\",\n \"public ServletContext getContext() {\\r\\n\\t\\treturn new ContextWrapper(getEvent().getServletContext());\\r\\n\\t}\",\n \"public UserContext getUserContext();\",\n \"protected AbstractApplicationContext getServicesContext() {\\r\\n\\t\\treturn this.servicesContext;\\r\\n\\t}\",\n \"public static Context getAppContext() {\\n return _BaseApplication.context;\\n }\",\n \"public Context getContext() {\\n return contextMain;\\n }\",\n \"public org.omg.CORBA.Context read_Context() {\\n throw new org.omg.CORBA.NO_IMPLEMENT();\\n }\",\n \"public String getOperationContext() {\\n return this.operationContext;\\n }\",\n \"public String getOperationContext() {\\n return this.operationContext;\\n }\",\n \"public static Context getContext() {\\n\\t\\treturn instance;\\n\\t}\",\n \"@Override\\r\\n\\tpublic Context getContext() {\\n\\t\\treturn null;\\r\\n\\t}\",\n \"public Context getContext() {\\n return this;\\n }\",\n \"CTX_Context getContext();\",\n \"public ModuleContext getContext() {\\r\\n return context;\\r\\n }\",\n \"public UsersResourceContext getContext() {\\n return _context;\\n }\",\n \"@Override\\r\\n\\tpublic Context getContext()\\r\\n\\t{\\n\\t\\treturn this.getActivity().getApplicationContext();\\r\\n\\t}\",\n \"public BackingMapManagerContext getContext();\",\n \"public Context getApplicationContext();\",\n \"private Context getApplicationContext() {\\n\\t\\treturn this.cordova.getActivity().getApplicationContext();\\n\\t}\",\n \"private Context getApplicationContext() {\\n\\t\\treturn this.cordova.getActivity().getApplicationContext();\\n\\t}\",\n \"private static synchronized JAXBContext context(Class<? extends Object> clazz) throws JAXBException {\\r\\n\\t\\tif(jaxbContext == null){\\r\\n\\t\\t\\tjaxbContext = JAXBContext.newInstance(new Class[]{clazz});\\r\\n\\t\\t\\tclasses.add(clazz);\\r\\n\\t\\t}\\r\\n\\t\\telse if(!classes.contains(clazz)){\\r\\n\\t\\t\\ttry{\\r\\n\\t\\t\\t\\tclasses.add(clazz);\\r\\n\\t\\t\\t\\tjaxbContext = JAXBContext.newInstance(classes.toArray(new Class[classes.size()]));\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tcatch(JAXBException e){\\r\\n\\t\\t\\t\\tclasses.remove(clazz);\\r\\n\\t\\t\\t\\tthrow e;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\treturn jaxbContext;\\r\\n\\t}\",\n \"public static ApplicationContext getApplicationContext() {\\n return appContext;\\n }\",\n \"private Context getThreadContext() throws NamingException {\\n final ThreadContext threadContext = ThreadContext.getThreadContext();\\n if (skipEjbContext(threadContext)) {\\n return ContextBindings.getClassLoader();\\n }\\n final Context context = threadContext.getBeanContext().getJndiEnc();\\n return context;\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6841471","0.664883","0.6500057","0.6495569","0.629308","0.6238154","0.62332904","0.6204135","0.61953574","0.61953574","0.61953574","0.61879784","0.6119424","0.611207","0.6103814","0.6098982","0.6069671","0.60670257","0.60236675","0.60156196","0.5991049","0.59689707","0.5967854","0.5952034","0.59445834","0.5944032","0.59336615","0.5926761","0.5926761","0.588842","0.5847091","0.5837154","0.58234054","0.5819379","0.5809338","0.57750595","0.57594216","0.57451475","0.57415414","0.5725264","0.57061213","0.57058054","0.5695599","0.56629837","0.5660658","0.5642409","0.56393653","0.56298196","0.56138104","0.5599594","0.558859","0.55755347","0.557199","0.55664074","0.5565519","0.5545166","0.5520894","0.55173653","0.55173653","0.5515966","0.5503507","0.54963386","0.54779655","0.5448752","0.5448752","0.54460746","0.544565","0.54347783","0.54347783","0.5433211","0.5412489","0.5395388","0.5383475","0.5368761","0.53604406","0.53446317","0.53414935","0.53378","0.53286827","0.53263116","0.53257537","0.5319118","0.5313854","0.5311458","0.5310907","0.5310907","0.53068227","0.53009224","0.5298678","0.5291281","0.52852136","0.52796423","0.52774966","0.52718836","0.5266752","0.5262696","0.5262696","0.52588403","0.5245831","0.5244035"],"string":"[\n \"0.6841471\",\n \"0.664883\",\n \"0.6500057\",\n \"0.6495569\",\n \"0.629308\",\n \"0.6238154\",\n \"0.62332904\",\n \"0.6204135\",\n \"0.61953574\",\n \"0.61953574\",\n \"0.61953574\",\n \"0.61879784\",\n \"0.6119424\",\n \"0.611207\",\n \"0.6103814\",\n \"0.6098982\",\n \"0.6069671\",\n \"0.60670257\",\n \"0.60236675\",\n \"0.60156196\",\n \"0.5991049\",\n \"0.59689707\",\n \"0.5967854\",\n \"0.5952034\",\n \"0.59445834\",\n \"0.5944032\",\n \"0.59336615\",\n \"0.5926761\",\n \"0.5926761\",\n \"0.588842\",\n \"0.5847091\",\n \"0.5837154\",\n \"0.58234054\",\n \"0.5819379\",\n \"0.5809338\",\n \"0.57750595\",\n \"0.57594216\",\n \"0.57451475\",\n \"0.57415414\",\n \"0.5725264\",\n \"0.57061213\",\n \"0.57058054\",\n \"0.5695599\",\n \"0.56629837\",\n \"0.5660658\",\n \"0.5642409\",\n \"0.56393653\",\n \"0.56298196\",\n \"0.56138104\",\n \"0.5599594\",\n \"0.558859\",\n \"0.55755347\",\n \"0.557199\",\n \"0.55664074\",\n \"0.5565519\",\n \"0.5545166\",\n \"0.5520894\",\n \"0.55173653\",\n \"0.55173653\",\n \"0.5515966\",\n \"0.5503507\",\n \"0.54963386\",\n \"0.54779655\",\n \"0.5448752\",\n \"0.5448752\",\n \"0.54460746\",\n \"0.544565\",\n \"0.54347783\",\n \"0.54347783\",\n \"0.5433211\",\n \"0.5412489\",\n \"0.5395388\",\n \"0.5383475\",\n \"0.5368761\",\n \"0.53604406\",\n \"0.53446317\",\n \"0.53414935\",\n \"0.53378\",\n \"0.53286827\",\n \"0.53263116\",\n \"0.53257537\",\n \"0.5319118\",\n \"0.5313854\",\n \"0.5311458\",\n \"0.5310907\",\n \"0.5310907\",\n \"0.53068227\",\n \"0.53009224\",\n \"0.5298678\",\n \"0.5291281\",\n \"0.52852136\",\n \"0.52796423\",\n \"0.52774966\",\n \"0.52718836\",\n \"0.5266752\",\n \"0.5262696\",\n \"0.5262696\",\n \"0.52588403\",\n \"0.5245831\",\n \"0.5244035\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.53532803"},"document_rank":{"kind":"string","value":"75"}}},{"rowIdx":27387,"cells":{"query":{"kind":"string","value":"old data include method below, there is comment"},"document":{"kind":"string","value":"public void scandb_book_info(String table_name) {\n sql = \" SELECT * from \" + table_name + \";\";\n\n try {\n result = statement.executeQuery(sql);\n while (result.next()) {\n set_book_info(result.getInt(\"id\"), result.getString(\"name\"), result.getString(\"url\"));\n\n }\n } catch (SQLException e) {\n e.printStackTrace();\n }\n\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["protected void loadData()\n {\n }","public void setIncludes(String includes)\n {\n this.includes = includes;\n }","@Override\n\tprotected void getData() {\n\t\t\n\t}","protected abstract void loadData();","private void parseData() {\n\t\t\r\n\t}","@Override\r\n\tpublic void crawl_data() {\n\t\t\r\n\t}","@Override\r\n\tpublic void updateData() {\n\t\t\r\n\t}","private void addSampleData() {\r\n }","public abstract void loadData();","public abstract void loadData();","@Override\n\tpublic void queryData() {\n\t\t\n\t}","private static void includeExtract(IASTPreprocessorIncludeStatement include) {\n\t\tvxlFragment.append(VxlManager.includeDirective(StringProcessor.processString(include.getName().toString())));\n\t}","@Override\r\n\tprotected void InitData() {\n\t\t\r\n\t}","@Override\r\n\tprotected void initData() {\n\t\t\r\n\t}","@Override\r\n\tprotected void initData() {\n\t\t\r\n\t}","@Override\r\n\tprotected void initData() {\n\t\t\r\n\t}","@Override\r\n\tprotected void initData() {\n\t\t\r\n\t}","@Override\r\n\tprotected void initData() {\n\t\t\r\n\t}","@Override\r\n\tprotected void initData() {\n\t\t\r\n\t}","@Override\n\tprotected void initdata() {\n\n\t}","@Override\n\tpublic void getData() {\n\t\t\n\t}","void loadData();","void loadData();","@Override\r\n\tprotected void initData() {\n\r\n\t}","@Override\n\tprotected void initData() {\n\n\t}","@Override\n\tprotected void initData() {\n\n\t}","public void Data(){\n\t\t\t\t\t\t\n\t\t\t\t\t}","private static void parseInclude(Document doc) throws XPathExpressionException, IOException, SAXException {\n NodeList nodeList = (NodeList) XPATH_SERVER_INCLUDE.evaluate(doc, XPathConstants.NODESET);\n\n for (int i = 0; i < nodeList.getLength(); i++) {\n String nodeValue = nodeList.item(i).getAttributes().getNamedItem(\"location\").getNodeValue();\n\n if (!nodeValue.isEmpty()) {\n Document docIncl = getIncludeDoc(nodeValue);\n\n if (docIncl != null) {\n parseApplication(docIncl, XPATH_SERVER_APPLICATION);\n parseApplication(docIncl, XPATH_SERVER_WEB_APPLICATION);\n parseApplication(docIncl, XPATH_SERVER_ENTERPRISE_APPLICATION);\n // handle nested include elements\n parseInclude(docIncl);\n }\n }\n }\n }","@Override\n\tprotected void initData() {\n\t\t\n\t}","void include(Set<S> segments);","void addingGlobalData() {\n\n }","private ProcessedDynamicData( ) {\r\n super();\r\n }","private void Initialized_Data() {\n\t\t\r\n\t}","void addData();","private RowData() {\n initFields();\n }","@Override\n\tprotected void getDataFromUCF() {\n\n\t}","@Override\r\n\tprotected void load() {\n\t\t\r\n\t}","public void setIncluded(boolean included);","public String[] getIncludes()\n {\n return m_includes;\n }","@Override\n\tprotected void getDataRefresh() {\n\t\t\n\t}","public Agg include(Object value) {\n attrList.put(\"include\", value);\n return this;\n }","@Override\n protected void initData() {\n }","@Override\n protected void initData() {\n }","protected abstract void retrievedata();","@Override\n\t\tvoid loadData() throws IOException {\n\t\t\tsuper.loadData();\n\t\t}","private void loadData(){\n\t\t \n\t\t model.getDataVector().clear();\n\t\t ArrayList<Person> personList = DataBase.getInstance().getPersonList();\n\t\t for(Person person : personList){\n\t\t\t addRow(person.toBasicInfoStringArray());\n\t\t }\n\t\t \n\t }","@Override\n\tprotected void load() {\n\n\t}","@Override\n\tprotected void load() {\n\n\t}","@Override\n\tprotected void load() {\n\t\t\n\t}","@Override\n\tprotected void load() {\n\t\t\n\t}","@Override\n\tprotected void load() {\n\t\t\n\t}","@Override\n\tprotected void initData(){\n\t\tsuper.initData();\n\t}","protected MergeSpellingData()\r\n\t{\r\n\t}","void populateData();","@Override\n\tvoid putData() {\n\t\tSystem.out.println(\"Brand : \"+brand);\n\t\tSystem.out.println(\"Model : \"+model);\n\t\tSystem.out.println(\"Year of manufacture : \"+year_of_manufacture);\n\t\tSystem.out.println(\"CC : \"+cc);\n\t}","public boolean isIncludeMetaData() {\n\t\treturn includeMetaData;\n\t}","public abstract boolean promulgationDataDefined();","private void handleInclude() {\n definedGrammar.include(getGrammar(getAbsPath()));\n }","@Override\r\n protected void fetchData() {\n\r\n }","private void addData() {\n Details d1 = new Details(\"Arpitha\", \"+91-9448907664\", \"25/05/1997\");\n Details d2 = new Details(\"Abhijith\", \"+91-993602342\", \"05/10/1992\");\n details.add(d1);\n details.add(d2);\n }","@Parameters()\n\tpublic static Collection<Object[]> data() {\n\t\treturn Arrays.asList(new Object[][] { { Oldfile_empty, Newfile }, { Oldfile, Newfile_empty },\n\t\t\t\t{ Oldfile_empty, Newfile_empty } });\n\t}","@Override\n public RavenJObject getAdditionalData() {\n return additionalData;\n }","protected boolean isIncluded(String name) {\r\n return (this.includeRE == null) ? true : this.includeRE.match(name);\r\n }","private void InitData() {\n\t}","public static void populateData() {\n\n }","public boolean isIncludeMetaData() {\n\t\t\treturn includeMetaData;\n\t\t}","public void setIncludes( List<IncludeClasses> includes )\n {\n this.includes = includes;\n }","public boolean getIncluded();","public boolean isData() {return true; }","@Test\n public void fieldInclude() throws Exception {\n Document doc = new Document();\n DocumentBuilder builder = new DocumentBuilder(doc);\n\n // We can use an INCLUDE field to import a portion of another document in the local file system.\n // The bookmark from the other document that we reference with this field contains this imported portion.\n FieldInclude field = (FieldInclude) builder.insertField(FieldType.FIELD_INCLUDE, true);\n field.setSourceFullName(getMyDir() + \"Bookmarks.docx\");\n field.setBookmarkName(\"MyBookmark1\");\n field.setLockFields(false);\n field.setTextConverter(\"Microsoft Word\");\n\n Assert.assertTrue(field.getFieldCode().matches(\" INCLUDE .* MyBookmark1 \\\\\\\\c \\\"Microsoft Word\\\"\"));\n\n doc.updateFields();\n doc.save(getArtifactsDir() + \"Field.INCLUDE.docx\");\n //ExEnd\n\n doc = new Document(getArtifactsDir() + \"Field.INCLUDE.docx\");\n field = (FieldInclude) doc.getRange().getFields().get(0);\n\n Assert.assertEquals(FieldType.FIELD_INCLUDE, field.getType());\n Assert.assertEquals(\"First bookmark.\", field.getResult());\n Assert.assertTrue(field.getFieldCode().matches(\" INCLUDE .* MyBookmark1 \\\\\\\\c \\\"Microsoft Word\\\"\"));\n\n Assert.assertEquals(getMyDir() + \"Bookmarks.docx\", field.getSourceFullName());\n Assert.assertEquals(\"MyBookmark1\", field.getBookmarkName());\n Assert.assertFalse(field.getLockFields());\n Assert.assertEquals(\"Microsoft Word\", field.getTextConverter());\n }","public interface loadDataService {\n public List<Row> getComboContent( String sType,String comboType, Map<String,String[]> parameterMap , usersInfo loggedUser) throws Exception;\n public Result getGridContent(PagingObject po, String gridType,Map<String,String[]> parameterMap,String searchText , usersInfo loggedUser,String statusID,String from,String where ) throws Exception;\n public List<listInfo> loadStrukturList(String partID,long langID) throws Exception;\n public finalInfo getOrgInfo(long treeID) throws Exception;\n public categoryFinalInfo getCategoryInfo(long treeID) throws Exception;\n public carriersInfo getCariesInfo(long carryID) throws Exception;\n public carriersInfo getOrganizationInfo(long carryID) throws Exception;\n public List<contact> getOrgContacts(long treeID) throws Exception;\n public person getEmployeeInfo( long empId) throws Exception;\n public List<examples> getExamplesInfo(long exmpID,String langID) throws Exception;\n public List<contact> getPersonContact(long perID) throws Exception;\n public List<docList> loadQRphoto(Connection con, long exmplID,long picType) throws Exception;\n public List<docList> loadPhoto(Connection con, long exmplID,long picType) throws Exception;\n public List<docList> getExamplesPictures(Connection cc, long relID, long relType) throws Exception;\n public List<examples> getExamplesOperation(Connection cc, long relID, long langID) throws Exception;\n public int checkUser(String uName) throws Exception;\n public int checkDictRecord(String text, int dictType,String org,String pos) throws Exception ;\n public usersInfo loadUserInfo(String pID) throws Exception;\n public List<person> loadEmpList( int OrgID) throws Exception;\n public List<Row> getSelectContent( String type, Map<String, String[]> parameterMap , usersInfo loggedUser) throws Exception;\n public List<subjElement> getADVSearchMenuList(String partID) throws Exception;\n public String getADVInfo(String paramID,String paramVal,String val,String cond,String typ)throws Exception;\n public List<listInfo> loadComboForAdvancedSearch(String prmID,long parametr) throws Exception;\n public List<docList> loadRightPanelPhoto(long realID, int iType) throws Exception;\n public List<categoryFinalInfo> getCategoryStructure(long catID, int id) throws Exception;\n}","private void include(\r\n @CheckForNull String parent, int line,\r\n @Nonnull String name, boolean quoted, boolean next)\r\n throws IOException,\r\n LexerException {\r\n if (name.startsWith(\"/\")) {\r\n VirtualFile file = filesystem.getFile(name);\r\n if (include(file))\r\n return;\r\n StringBuilder buf = new StringBuilder();\r\n buf.append(\"File not found: \").append(name);\r\n error(line, 0, buf.toString());\r\n return;\r\n }\r\n\r\n VirtualFile pdir = null;\r\n if (quoted) {\r\n if (parent != null) {\r\n VirtualFile pfile = filesystem.getFile(parent);\r\n pdir = pfile.getParentFile();\r\n }\r\n if (pdir != null) {\r\n VirtualFile ifile = pdir.getChildFile(name);\r\n if (include(ifile))\r\n return;\r\n }\r\n if (include(quoteincludepath, name))\r\n return;\r\n } else {\r\n int idx = name.indexOf('/');\r\n if (idx != -1) {\r\n String frameworkName = name.substring(0, idx);\r\n String headerName = name.substring(idx + 1);\r\n String headerPath = frameworkName + \".framework/Headers/\" + headerName;\r\n if (include(frameworkspath, headerPath))\r\n return;\r\n }\r\n }\r\n\r\n if (include(sysincludepath, name))\r\n return;\r\n\r\n StringBuilder buf = new StringBuilder();\r\n buf.append(\"File not found: \").append(name);\r\n buf.append(\" in\");\r\n if (quoted) {\r\n buf.append(\" .\").append('(').append(pdir).append(')');\r\n for (String dir : quoteincludepath)\r\n buf.append(\" \").append(dir);\r\n }\r\n for (String dir : sysincludepath)\r\n buf.append(\" \").append(dir);\r\n error(line, 0, buf.toString());\r\n }","@Override\n public void DataIsInserted() {\n }","private XIncluder() {}","boolean hasData2();","boolean hasData2();","final void getData() {\n\t\t//The final method can't be overriden\n\t}","private void addDataForListView() {\n \t\n \tif(loadable)\n \t{\t\n \tloadable = false;\n \tdirection = BACKWARD;\n \tstrUrl = Url.composeHotPageUrl(type_id, class_id, last_id);\n \trequestData();\n \t}\n\t}","public void updateData() {}","protected void initDataFields() {\r\n //this module doesn't require any data fields\r\n }","private void verificaData() {\n\t\t\n\t}","public boolean isIncluded(IResource included) {\n ensureInitialized();\n String mapKey = getMapKey(included);\n List<String> result = mIncludedBy.get(mapKey);\n if (result == null) {\n String name = getResourceName(included);\n if (!name.equals(mapKey)) {\n result = mIncludedBy.get(name);\n }\n }\n\n return result != null && result.size() > 0;\n }","public AddData() {\n\t\tsuper();\n\t\tfilled = false;\n\t}","private void setIncludedBy(String includer, List<String> included) {\n for (String target : included) {\n List<String> list = mIncludedBy.get(target);\n if (list == null) {\n list = new ArrayList<String>(2); // We don't expect many includes\n mIncludedBy.put(target, list);\n }\n if (!list.contains(includer)) {\n list.add(includer);\n }\n }\n }","@Override\n public void load() {\n }","@Override\n\tpublic void initData() {\n\n\n\n\t}","@VisibleForTesting\n /* package */ void setIncluded(String includer, List<String> included, boolean detectCycles) {\n // Remove previously linked inverse mappings\n List<String> oldIncludes = mIncludes.get(includer);\n if (oldIncludes != null && oldIncludes.size() > 0) {\n for (String includee : oldIncludes) {\n List<String> includers = mIncludedBy.get(includee);\n if (includers != null) {\n includers.remove(includer);\n }\n }\n }\n\n mIncludes.put(includer, included);\n // Reverse mapping: for included items, point back to including file\n setIncludedBy(includer, included);\n\n if (detectCycles) {\n detectCycles(includer);\n }\n }","@Override\n\tpublic void processData() {\n\t\t\n\t}","@java.lang.Override\n public boolean hasData() {\n return data_ != null;\n }","private boolean importSolrConfigData() {\n\t\treturn importData(\"/solr/solr.impex\");\n\t}","private boolean includePrimaryKeyColumns() {\n\t\treturn false;\r\n\t}","private boolean addData(HeaderEntry he, DataRecord dr) {\n if (getSizeLeft() > (4 + dr.getData().length)) {\n\n //write the header\n byte[] headerEntry = he.getHeader();\n\n serialize[headerPointer] = headerEntry[0];\n serialize[headerPointer + 1] = headerEntry[1];\n serialize[headerPointer + 2] = headerEntry[2];\n serialize[headerPointer + 3] = headerEntry[3];\n\n headerPointer += 4;\n \n //write the datas\n byte[] dataRecord = dr.getData();\n\n int sum = 0;\n for (int i = dataRecord.length - 1; i >= 0; i--) {\n serialize[datasPointer - sum] = dataRecord[i];\n sum++;\n }\n\n datasPointer -= sum;\n return true;\n }\n return false;\n }","abstract void initializeNeededData();","private void loadData()\r\n\t{\r\n\t\taddProduct(\"Area\", \"Education\");\r\n\t\taddProduct(\"Area\", \"Environment\");\r\n\t\taddProduct(\"Area\", \"Health\");\r\n\r\n\t\taddProduct(\"Domain\", \"Documentation\");\r\n\t\taddProduct(\"Domain\", \"Project Activity\");\r\n\t\taddProduct(\"Domain\", \"Technology\");\r\n\r\n\t\taddProduct(\"City\", \"Bangalore\");\r\n\t\taddProduct(\"City\", \"Hyderabad\");\r\n\t\taddProduct(\"City\", \"Lucknow\");\r\n\r\n\t\taddProduct(\"Activity_Type\", \"Onsite\");\r\n\t\taddProduct(\"Activity_Type\", \"Offsite\");\r\n\r\n\t}","@Override\r\n\tprotected void initSelfData() {\n\t\t\r\n\t}","@Override\r\n\tprotected void initSelfData() {\n\t\t\r\n\t}","public TransferAllDetails include() {\n return this.include;\n }","@java.lang.Override\n public boolean hasData() {\n return data_ != null;\n }","@Override\r\n public void dataAdded(DataSet data) {\n rebuildColumns();\r\n }","@Override\n public boolean addDataSourceInfo(DataSource ds) {\n return false;\n }","@Override\r\n\t\tpublic BatchArgumentBuilder addData(Document data) {\n\t\t\tthrow new UnsupportedOperationException(\"Not implemented yet.\");\r\n\t\t}"],"string":"[\n \"protected void loadData()\\n {\\n }\",\n \"public void setIncludes(String includes)\\n {\\n this.includes = includes;\\n }\",\n \"@Override\\n\\tprotected void getData() {\\n\\t\\t\\n\\t}\",\n \"protected abstract void loadData();\",\n \"private void parseData() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tpublic void crawl_data() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tpublic void updateData() {\\n\\t\\t\\r\\n\\t}\",\n \"private void addSampleData() {\\r\\n }\",\n \"public abstract void loadData();\",\n \"public abstract void loadData();\",\n \"@Override\\n\\tpublic void queryData() {\\n\\t\\t\\n\\t}\",\n \"private static void includeExtract(IASTPreprocessorIncludeStatement include) {\\n\\t\\tvxlFragment.append(VxlManager.includeDirective(StringProcessor.processString(include.getName().toString())));\\n\\t}\",\n \"@Override\\r\\n\\tprotected void InitData() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tprotected void initData() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tprotected void initData() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tprotected void initData() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tprotected void initData() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tprotected void initData() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tprotected void initData() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\n\\tprotected void initdata() {\\n\\n\\t}\",\n \"@Override\\n\\tpublic void getData() {\\n\\t\\t\\n\\t}\",\n \"void loadData();\",\n \"void loadData();\",\n \"@Override\\r\\n\\tprotected void initData() {\\n\\r\\n\\t}\",\n \"@Override\\n\\tprotected void initData() {\\n\\n\\t}\",\n \"@Override\\n\\tprotected void initData() {\\n\\n\\t}\",\n \"public void Data(){\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t}\",\n \"private static void parseInclude(Document doc) throws XPathExpressionException, IOException, SAXException {\\n NodeList nodeList = (NodeList) XPATH_SERVER_INCLUDE.evaluate(doc, XPathConstants.NODESET);\\n\\n for (int i = 0; i < nodeList.getLength(); i++) {\\n String nodeValue = nodeList.item(i).getAttributes().getNamedItem(\\\"location\\\").getNodeValue();\\n\\n if (!nodeValue.isEmpty()) {\\n Document docIncl = getIncludeDoc(nodeValue);\\n\\n if (docIncl != null) {\\n parseApplication(docIncl, XPATH_SERVER_APPLICATION);\\n parseApplication(docIncl, XPATH_SERVER_WEB_APPLICATION);\\n parseApplication(docIncl, XPATH_SERVER_ENTERPRISE_APPLICATION);\\n // handle nested include elements\\n parseInclude(docIncl);\\n }\\n }\\n }\\n }\",\n \"@Override\\n\\tprotected void initData() {\\n\\t\\t\\n\\t}\",\n \"void include(Set<S> segments);\",\n \"void addingGlobalData() {\\n\\n }\",\n \"private ProcessedDynamicData( ) {\\r\\n super();\\r\\n }\",\n \"private void Initialized_Data() {\\n\\t\\t\\r\\n\\t}\",\n \"void addData();\",\n \"private RowData() {\\n initFields();\\n }\",\n \"@Override\\n\\tprotected void getDataFromUCF() {\\n\\n\\t}\",\n \"@Override\\r\\n\\tprotected void load() {\\n\\t\\t\\r\\n\\t}\",\n \"public void setIncluded(boolean included);\",\n \"public String[] getIncludes()\\n {\\n return m_includes;\\n }\",\n \"@Override\\n\\tprotected void getDataRefresh() {\\n\\t\\t\\n\\t}\",\n \"public Agg include(Object value) {\\n attrList.put(\\\"include\\\", value);\\n return this;\\n }\",\n \"@Override\\n protected void initData() {\\n }\",\n \"@Override\\n protected void initData() {\\n }\",\n \"protected abstract void retrievedata();\",\n \"@Override\\n\\t\\tvoid loadData() throws IOException {\\n\\t\\t\\tsuper.loadData();\\n\\t\\t}\",\n \"private void loadData(){\\n\\t\\t \\n\\t\\t model.getDataVector().clear();\\n\\t\\t ArrayList<Person> personList = DataBase.getInstance().getPersonList();\\n\\t\\t for(Person person : personList){\\n\\t\\t\\t addRow(person.toBasicInfoStringArray());\\n\\t\\t }\\n\\t\\t \\n\\t }\",\n \"@Override\\n\\tprotected void load() {\\n\\n\\t}\",\n \"@Override\\n\\tprotected void load() {\\n\\n\\t}\",\n \"@Override\\n\\tprotected void load() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tprotected void load() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tprotected void load() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tprotected void initData(){\\n\\t\\tsuper.initData();\\n\\t}\",\n \"protected MergeSpellingData()\\r\\n\\t{\\r\\n\\t}\",\n \"void populateData();\",\n \"@Override\\n\\tvoid putData() {\\n\\t\\tSystem.out.println(\\\"Brand : \\\"+brand);\\n\\t\\tSystem.out.println(\\\"Model : \\\"+model);\\n\\t\\tSystem.out.println(\\\"Year of manufacture : \\\"+year_of_manufacture);\\n\\t\\tSystem.out.println(\\\"CC : \\\"+cc);\\n\\t}\",\n \"public boolean isIncludeMetaData() {\\n\\t\\treturn includeMetaData;\\n\\t}\",\n \"public abstract boolean promulgationDataDefined();\",\n \"private void handleInclude() {\\n definedGrammar.include(getGrammar(getAbsPath()));\\n }\",\n \"@Override\\r\\n protected void fetchData() {\\n\\r\\n }\",\n \"private void addData() {\\n Details d1 = new Details(\\\"Arpitha\\\", \\\"+91-9448907664\\\", \\\"25/05/1997\\\");\\n Details d2 = new Details(\\\"Abhijith\\\", \\\"+91-993602342\\\", \\\"05/10/1992\\\");\\n details.add(d1);\\n details.add(d2);\\n }\",\n \"@Parameters()\\n\\tpublic static Collection<Object[]> data() {\\n\\t\\treturn Arrays.asList(new Object[][] { { Oldfile_empty, Newfile }, { Oldfile, Newfile_empty },\\n\\t\\t\\t\\t{ Oldfile_empty, Newfile_empty } });\\n\\t}\",\n \"@Override\\n public RavenJObject getAdditionalData() {\\n return additionalData;\\n }\",\n \"protected boolean isIncluded(String name) {\\r\\n return (this.includeRE == null) ? true : this.includeRE.match(name);\\r\\n }\",\n \"private void InitData() {\\n\\t}\",\n \"public static void populateData() {\\n\\n }\",\n \"public boolean isIncludeMetaData() {\\n\\t\\t\\treturn includeMetaData;\\n\\t\\t}\",\n \"public void setIncludes( List<IncludeClasses> includes )\\n {\\n this.includes = includes;\\n }\",\n \"public boolean getIncluded();\",\n \"public boolean isData() {return true; }\",\n \"@Test\\n public void fieldInclude() throws Exception {\\n Document doc = new Document();\\n DocumentBuilder builder = new DocumentBuilder(doc);\\n\\n // We can use an INCLUDE field to import a portion of another document in the local file system.\\n // The bookmark from the other document that we reference with this field contains this imported portion.\\n FieldInclude field = (FieldInclude) builder.insertField(FieldType.FIELD_INCLUDE, true);\\n field.setSourceFullName(getMyDir() + \\\"Bookmarks.docx\\\");\\n field.setBookmarkName(\\\"MyBookmark1\\\");\\n field.setLockFields(false);\\n field.setTextConverter(\\\"Microsoft Word\\\");\\n\\n Assert.assertTrue(field.getFieldCode().matches(\\\" INCLUDE .* MyBookmark1 \\\\\\\\\\\\\\\\c \\\\\\\"Microsoft Word\\\\\\\"\\\"));\\n\\n doc.updateFields();\\n doc.save(getArtifactsDir() + \\\"Field.INCLUDE.docx\\\");\\n //ExEnd\\n\\n doc = new Document(getArtifactsDir() + \\\"Field.INCLUDE.docx\\\");\\n field = (FieldInclude) doc.getRange().getFields().get(0);\\n\\n Assert.assertEquals(FieldType.FIELD_INCLUDE, field.getType());\\n Assert.assertEquals(\\\"First bookmark.\\\", field.getResult());\\n Assert.assertTrue(field.getFieldCode().matches(\\\" INCLUDE .* MyBookmark1 \\\\\\\\\\\\\\\\c \\\\\\\"Microsoft Word\\\\\\\"\\\"));\\n\\n Assert.assertEquals(getMyDir() + \\\"Bookmarks.docx\\\", field.getSourceFullName());\\n Assert.assertEquals(\\\"MyBookmark1\\\", field.getBookmarkName());\\n Assert.assertFalse(field.getLockFields());\\n Assert.assertEquals(\\\"Microsoft Word\\\", field.getTextConverter());\\n }\",\n \"public interface loadDataService {\\n public List<Row> getComboContent( String sType,String comboType, Map<String,String[]> parameterMap , usersInfo loggedUser) throws Exception;\\n public Result getGridContent(PagingObject po, String gridType,Map<String,String[]> parameterMap,String searchText , usersInfo loggedUser,String statusID,String from,String where ) throws Exception;\\n public List<listInfo> loadStrukturList(String partID,long langID) throws Exception;\\n public finalInfo getOrgInfo(long treeID) throws Exception;\\n public categoryFinalInfo getCategoryInfo(long treeID) throws Exception;\\n public carriersInfo getCariesInfo(long carryID) throws Exception;\\n public carriersInfo getOrganizationInfo(long carryID) throws Exception;\\n public List<contact> getOrgContacts(long treeID) throws Exception;\\n public person getEmployeeInfo( long empId) throws Exception;\\n public List<examples> getExamplesInfo(long exmpID,String langID) throws Exception;\\n public List<contact> getPersonContact(long perID) throws Exception;\\n public List<docList> loadQRphoto(Connection con, long exmplID,long picType) throws Exception;\\n public List<docList> loadPhoto(Connection con, long exmplID,long picType) throws Exception;\\n public List<docList> getExamplesPictures(Connection cc, long relID, long relType) throws Exception;\\n public List<examples> getExamplesOperation(Connection cc, long relID, long langID) throws Exception;\\n public int checkUser(String uName) throws Exception;\\n public int checkDictRecord(String text, int dictType,String org,String pos) throws Exception ;\\n public usersInfo loadUserInfo(String pID) throws Exception;\\n public List<person> loadEmpList( int OrgID) throws Exception;\\n public List<Row> getSelectContent( String type, Map<String, String[]> parameterMap , usersInfo loggedUser) throws Exception;\\n public List<subjElement> getADVSearchMenuList(String partID) throws Exception;\\n public String getADVInfo(String paramID,String paramVal,String val,String cond,String typ)throws Exception;\\n public List<listInfo> loadComboForAdvancedSearch(String prmID,long parametr) throws Exception;\\n public List<docList> loadRightPanelPhoto(long realID, int iType) throws Exception;\\n public List<categoryFinalInfo> getCategoryStructure(long catID, int id) throws Exception;\\n}\",\n \"private void include(\\r\\n @CheckForNull String parent, int line,\\r\\n @Nonnull String name, boolean quoted, boolean next)\\r\\n throws IOException,\\r\\n LexerException {\\r\\n if (name.startsWith(\\\"/\\\")) {\\r\\n VirtualFile file = filesystem.getFile(name);\\r\\n if (include(file))\\r\\n return;\\r\\n StringBuilder buf = new StringBuilder();\\r\\n buf.append(\\\"File not found: \\\").append(name);\\r\\n error(line, 0, buf.toString());\\r\\n return;\\r\\n }\\r\\n\\r\\n VirtualFile pdir = null;\\r\\n if (quoted) {\\r\\n if (parent != null) {\\r\\n VirtualFile pfile = filesystem.getFile(parent);\\r\\n pdir = pfile.getParentFile();\\r\\n }\\r\\n if (pdir != null) {\\r\\n VirtualFile ifile = pdir.getChildFile(name);\\r\\n if (include(ifile))\\r\\n return;\\r\\n }\\r\\n if (include(quoteincludepath, name))\\r\\n return;\\r\\n } else {\\r\\n int idx = name.indexOf('/');\\r\\n if (idx != -1) {\\r\\n String frameworkName = name.substring(0, idx);\\r\\n String headerName = name.substring(idx + 1);\\r\\n String headerPath = frameworkName + \\\".framework/Headers/\\\" + headerName;\\r\\n if (include(frameworkspath, headerPath))\\r\\n return;\\r\\n }\\r\\n }\\r\\n\\r\\n if (include(sysincludepath, name))\\r\\n return;\\r\\n\\r\\n StringBuilder buf = new StringBuilder();\\r\\n buf.append(\\\"File not found: \\\").append(name);\\r\\n buf.append(\\\" in\\\");\\r\\n if (quoted) {\\r\\n buf.append(\\\" .\\\").append('(').append(pdir).append(')');\\r\\n for (String dir : quoteincludepath)\\r\\n buf.append(\\\" \\\").append(dir);\\r\\n }\\r\\n for (String dir : sysincludepath)\\r\\n buf.append(\\\" \\\").append(dir);\\r\\n error(line, 0, buf.toString());\\r\\n }\",\n \"@Override\\n public void DataIsInserted() {\\n }\",\n \"private XIncluder() {}\",\n \"boolean hasData2();\",\n \"boolean hasData2();\",\n \"final void getData() {\\n\\t\\t//The final method can't be overriden\\n\\t}\",\n \"private void addDataForListView() {\\n \\t\\n \\tif(loadable)\\n \\t{\\t\\n \\tloadable = false;\\n \\tdirection = BACKWARD;\\n \\tstrUrl = Url.composeHotPageUrl(type_id, class_id, last_id);\\n \\trequestData();\\n \\t}\\n\\t}\",\n \"public void updateData() {}\",\n \"protected void initDataFields() {\\r\\n //this module doesn't require any data fields\\r\\n }\",\n \"private void verificaData() {\\n\\t\\t\\n\\t}\",\n \"public boolean isIncluded(IResource included) {\\n ensureInitialized();\\n String mapKey = getMapKey(included);\\n List<String> result = mIncludedBy.get(mapKey);\\n if (result == null) {\\n String name = getResourceName(included);\\n if (!name.equals(mapKey)) {\\n result = mIncludedBy.get(name);\\n }\\n }\\n\\n return result != null && result.size() > 0;\\n }\",\n \"public AddData() {\\n\\t\\tsuper();\\n\\t\\tfilled = false;\\n\\t}\",\n \"private void setIncludedBy(String includer, List<String> included) {\\n for (String target : included) {\\n List<String> list = mIncludedBy.get(target);\\n if (list == null) {\\n list = new ArrayList<String>(2); // We don't expect many includes\\n mIncludedBy.put(target, list);\\n }\\n if (!list.contains(includer)) {\\n list.add(includer);\\n }\\n }\\n }\",\n \"@Override\\n public void load() {\\n }\",\n \"@Override\\n\\tpublic void initData() {\\n\\n\\n\\n\\t}\",\n \"@VisibleForTesting\\n /* package */ void setIncluded(String includer, List<String> included, boolean detectCycles) {\\n // Remove previously linked inverse mappings\\n List<String> oldIncludes = mIncludes.get(includer);\\n if (oldIncludes != null && oldIncludes.size() > 0) {\\n for (String includee : oldIncludes) {\\n List<String> includers = mIncludedBy.get(includee);\\n if (includers != null) {\\n includers.remove(includer);\\n }\\n }\\n }\\n\\n mIncludes.put(includer, included);\\n // Reverse mapping: for included items, point back to including file\\n setIncludedBy(includer, included);\\n\\n if (detectCycles) {\\n detectCycles(includer);\\n }\\n }\",\n \"@Override\\n\\tpublic void processData() {\\n\\t\\t\\n\\t}\",\n \"@java.lang.Override\\n public boolean hasData() {\\n return data_ != null;\\n }\",\n \"private boolean importSolrConfigData() {\\n\\t\\treturn importData(\\\"/solr/solr.impex\\\");\\n\\t}\",\n \"private boolean includePrimaryKeyColumns() {\\n\\t\\treturn false;\\r\\n\\t}\",\n \"private boolean addData(HeaderEntry he, DataRecord dr) {\\n if (getSizeLeft() > (4 + dr.getData().length)) {\\n\\n //write the header\\n byte[] headerEntry = he.getHeader();\\n\\n serialize[headerPointer] = headerEntry[0];\\n serialize[headerPointer + 1] = headerEntry[1];\\n serialize[headerPointer + 2] = headerEntry[2];\\n serialize[headerPointer + 3] = headerEntry[3];\\n\\n headerPointer += 4;\\n \\n //write the datas\\n byte[] dataRecord = dr.getData();\\n\\n int sum = 0;\\n for (int i = dataRecord.length - 1; i >= 0; i--) {\\n serialize[datasPointer - sum] = dataRecord[i];\\n sum++;\\n }\\n\\n datasPointer -= sum;\\n return true;\\n }\\n return false;\\n }\",\n \"abstract void initializeNeededData();\",\n \"private void loadData()\\r\\n\\t{\\r\\n\\t\\taddProduct(\\\"Area\\\", \\\"Education\\\");\\r\\n\\t\\taddProduct(\\\"Area\\\", \\\"Environment\\\");\\r\\n\\t\\taddProduct(\\\"Area\\\", \\\"Health\\\");\\r\\n\\r\\n\\t\\taddProduct(\\\"Domain\\\", \\\"Documentation\\\");\\r\\n\\t\\taddProduct(\\\"Domain\\\", \\\"Project Activity\\\");\\r\\n\\t\\taddProduct(\\\"Domain\\\", \\\"Technology\\\");\\r\\n\\r\\n\\t\\taddProduct(\\\"City\\\", \\\"Bangalore\\\");\\r\\n\\t\\taddProduct(\\\"City\\\", \\\"Hyderabad\\\");\\r\\n\\t\\taddProduct(\\\"City\\\", \\\"Lucknow\\\");\\r\\n\\r\\n\\t\\taddProduct(\\\"Activity_Type\\\", \\\"Onsite\\\");\\r\\n\\t\\taddProduct(\\\"Activity_Type\\\", \\\"Offsite\\\");\\r\\n\\r\\n\\t}\",\n \"@Override\\r\\n\\tprotected void initSelfData() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tprotected void initSelfData() {\\n\\t\\t\\r\\n\\t}\",\n \"public TransferAllDetails include() {\\n return this.include;\\n }\",\n \"@java.lang.Override\\n public boolean hasData() {\\n return data_ != null;\\n }\",\n \"@Override\\r\\n public void dataAdded(DataSet data) {\\n rebuildColumns();\\r\\n }\",\n \"@Override\\n public boolean addDataSourceInfo(DataSource ds) {\\n return false;\\n }\",\n \"@Override\\r\\n\\t\\tpublic BatchArgumentBuilder addData(Document data) {\\n\\t\\t\\tthrow new UnsupportedOperationException(\\\"Not implemented yet.\\\");\\r\\n\\t\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6139704","0.570362","0.56979764","0.56438124","0.54716027","0.5469597","0.5439888","0.54363495","0.5430885","0.5430885","0.54282075","0.5379788","0.532639","0.53243023","0.53243023","0.53243023","0.53243023","0.53243023","0.53243023","0.53006124","0.526728","0.5261604","0.5261604","0.5259672","0.52490807","0.52490807","0.5246264","0.52361035","0.5232745","0.52069265","0.52036077","0.5199397","0.5195691","0.51909983","0.5185827","0.51837415","0.517547","0.51457727","0.51389736","0.51355964","0.51326025","0.51318467","0.51318467","0.5130048","0.5118303","0.511448","0.51135784","0.51135784","0.51009536","0.51009536","0.51009536","0.5099717","0.5095692","0.5094492","0.50819975","0.5080738","0.50796103","0.5077596","0.50652534","0.50638247","0.5061386","0.50546366","0.5052656","0.50458854","0.5044398","0.50391954","0.50318885","0.5028146","0.50278866","0.50194436","0.50084937","0.49962768","0.49949387","0.4990025","0.49856523","0.49856523","0.49847266","0.49774522","0.49755433","0.49676347","0.4964477","0.4962617","0.49563965","0.49530107","0.49530065","0.4951887","0.4943538","0.4939647","0.49363184","0.49265403","0.49238637","0.49232993","0.4911226","0.49081802","0.48965758","0.48965758","0.48944494","0.4893584","0.4892326","0.48900658","0.48836106"],"string":"[\n \"0.6139704\",\n \"0.570362\",\n \"0.56979764\",\n \"0.56438124\",\n \"0.54716027\",\n \"0.5469597\",\n \"0.5439888\",\n \"0.54363495\",\n \"0.5430885\",\n \"0.5430885\",\n \"0.54282075\",\n \"0.5379788\",\n \"0.532639\",\n \"0.53243023\",\n \"0.53243023\",\n \"0.53243023\",\n \"0.53243023\",\n \"0.53243023\",\n \"0.53243023\",\n \"0.53006124\",\n \"0.526728\",\n \"0.5261604\",\n \"0.5261604\",\n \"0.5259672\",\n \"0.52490807\",\n \"0.52490807\",\n \"0.5246264\",\n \"0.52361035\",\n \"0.5232745\",\n \"0.52069265\",\n \"0.52036077\",\n \"0.5199397\",\n \"0.5195691\",\n \"0.51909983\",\n \"0.5185827\",\n \"0.51837415\",\n \"0.517547\",\n \"0.51457727\",\n \"0.51389736\",\n \"0.51355964\",\n \"0.51326025\",\n \"0.51318467\",\n \"0.51318467\",\n \"0.5130048\",\n \"0.5118303\",\n \"0.511448\",\n \"0.51135784\",\n \"0.51135784\",\n \"0.51009536\",\n \"0.51009536\",\n \"0.51009536\",\n \"0.5099717\",\n \"0.5095692\",\n \"0.5094492\",\n \"0.50819975\",\n \"0.5080738\",\n \"0.50796103\",\n \"0.5077596\",\n \"0.50652534\",\n \"0.50638247\",\n \"0.5061386\",\n \"0.50546366\",\n \"0.5052656\",\n \"0.50458854\",\n \"0.5044398\",\n \"0.50391954\",\n \"0.50318885\",\n \"0.5028146\",\n \"0.50278866\",\n \"0.50194436\",\n \"0.50084937\",\n \"0.49962768\",\n \"0.49949387\",\n \"0.4990025\",\n \"0.49856523\",\n \"0.49856523\",\n \"0.49847266\",\n \"0.49774522\",\n \"0.49755433\",\n \"0.49676347\",\n \"0.4964477\",\n \"0.4962617\",\n \"0.49563965\",\n \"0.49530107\",\n \"0.49530065\",\n \"0.4951887\",\n \"0.4943538\",\n \"0.4939647\",\n \"0.49363184\",\n \"0.49265403\",\n \"0.49238637\",\n \"0.49232993\",\n \"0.4911226\",\n \"0.49081802\",\n \"0.48965758\",\n \"0.48965758\",\n \"0.48944494\",\n \"0.4893584\",\n \"0.4892326\",\n \"0.48900658\",\n \"0.48836106\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":27388,"cells":{"query":{"kind":"string","value":"constructor init the Buttons of the StartMenu"},"document":{"kind":"string","value":"@Override\n public final void initButtons(int x, int y, int addy){\n \n String data = s_datapath;\n addButton(data + \"SM_NeuesSpiel\" + s_typ, x, y, 1);\n addButton(data + \"OM_SpielSpeichern\" + s_typ, x, y + addy, 2);\n addButton(data + \"SM_SpielLaden\" + s_typ, x, y + addy * 2, 3);\n //addButton(data,x, y + addy*3, 4);\n addButton(data + \"Menu_Element_Blank\" + s_typ, x,/*715*/ y + addy * 4, 5);\n addButton(data + \"SM_SpielBeenden\" + s_typ, x,/*845*/ y + addy * 5, 6);\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["public void initMenu() {\n\t\t\r\n\t\treturnToGame = new JButton(\"Return to Game\");\r\n\t\treturnToGame.setBounds(900, 900, 0, 0);\r\n\t\treturnToGame.setBackground(Color.BLACK);\r\n\t\treturnToGame.setForeground(Color.WHITE);\r\n\t\treturnToGame.setVisible(false);\r\n\t\treturnToGame.addActionListener(this);\r\n\t\t\r\n\t\treturnToStart = new JButton(\"Main Menu\");\r\n\t\treturnToStart.setBounds(900, 900, 0, 0);\r\n\t\treturnToStart.setBackground(Color.BLACK);\r\n\t\treturnToStart.setForeground(Color.WHITE);\r\n\t\treturnToStart.setVisible(false);\r\n\t\treturnToStart.addActionListener(this);\r\n\t\t\r\n\t\t//add(menubackground);\r\n\t\tadd(returnToGame);\r\n\t\tadd(returnToStart);\r\n\t}","public StartMenu(){\n\t\tmenu.setTitle(\"COP4331 Spring '14 - Battle Ship!\");\n\t\t\n\t\t//startGame JButton will begin a new game\n\t\tstartEasyGame = new JButton(\"Start Easy Game\");\n\t\tstartEasyGame.addActionListener(new ActionListener(){\n\t\t\tpublic void actionPerformed(ActionEvent arg0) {\n\t\t\t\tsetSkill(0);\n\t\t\t\tplay = true;\n\t\t\t}\n\t\t});\n\t\t\n\t\tstartAdvancedGame = new JButton(\"Start Advanced Game\");\n\t\tstartAdvancedGame.addActionListener(new ActionListener(){\n\t\t\tpublic void actionPerformed(ActionEvent arg0) {\n\t\t\t\tsetSkill(1);\n\t\t\t\tplay = true;\n\t\t\t}\n\t\t});\n\t\t\n\t\t\t\n\t\t//exitGame JButton will end the program\n\t\texitGame = new JButton(\"Exit Game\");\n\t\texitGame.addActionListener(new ActionListener(){\n\t\t\tpublic void actionPerformed(ActionEvent arg0){\n\t\t\t\tclose = true;\n\t\t\t}\n\t\t});\n\t\t\n\t\tmenu.add(startEasyGame);\n\t\tmenu.add(startAdvancedGame);\n\t\tmenu.add(exitGame);\t\t\n\t}","public Menu getStartMenu() {\n Menu menu = new Menu(new Point(475, 0), 672-475, 320, 8, 1, new Cursor(new Point(0, 7)), \"exit\");\n Button PokedexButton = new Button(new Point(475, 0), 672-475, 40, \"Pokédex\", new Point(0, 7), \"Pokédex\");\n Button PokemonButton = new Button(new Point(475, 40), 672-475, 40, \"Pokémon\", new Point(0, 6), \"Pokémon\");\n Button BagButton = new Button(new Point(475, 80), 672-475, 40, \"Bag\", new Point(0, 5), \"Bag\");\n Button PokenavButton = new Button(new Point(475, 120), 672-475, 40, \"Pokénav\", new Point(0, 4), \"Pokénav\");\n Button PlayerButton = new Button(new Point(475, 160), 672-475, 40, trainer.getName(), new Point(0, 3), trainer.getName());\n Button SaveButton = new Button(new Point(475, 200), 672-475, 40, \"save\", new Point(0, 2), \"Save\");\n Button OptionButton = new Button(new Point(475, 240), 672-475, 40, \"add_menu_other\", new Point(0, 1), \"Options\");\n Button ExitButton = new Button(new Point(475, 280), 672-475, 40, \"exit\", new Point(0, 0), \"exit\");\n menu.addButton(PokedexButton);\n menu.addButton(PokemonButton);\n menu.addButton(BagButton);\n menu.addButton(PokenavButton);\n menu.addButton(PlayerButton);\n menu.addButton(SaveButton);\n menu.addButton(OptionButton);\n menu.addButton(ExitButton);\n menu.getButton(menu.getCursor().getPos()).Highlight();\n return menu;\n }","public startingMenu() {\r\n initComponents();\r\n }","public MainMenuScreen(MainController controller) {\n this.controller = controller;\n startButton = new Button(\"start_button\", new SpriteBatch());\n optionsButton = new Button(\"options_button\", new SpriteBatch());\n topButton = new Button(\"top_button\", new SpriteBatch());\n exitButton = new Button(\"exit_button\", new SpriteBatch());\n }","public void addMenuItems()\n\t{\n\t\tstartButton = new JButton(\"Start\");\n\t\tstartButton.setLayout(null);\n\t\tstartButton.setBounds(350, 225, 100, 50);\n\t\t\n\t\toptionsButton = new JButton(\"Options\");\n\t\toptionsButton.setLayout(null);\n\t\toptionsButton.setBounds(350, 275, 100, 50);\n\t\t\n\t\texitButton = new JButton(\"Exit\");\n\t\texitButton.setLayout(null);\n\t\texitButton.setBounds(350, 375, 100, 50);\n\t\texitButton.setActionCommand(\"exit\");\n\t\texitButton.addActionListener((ActionListener) this);\n\t\t\n\t\tmainMenuPanel.add(startButton);\n\t\tmainMenuPanel.add(optionsButton);\n\t\tmainMenuPanel.add(startButton);\n\t}","private void initMenu() {\n\t\tloadImage();\r\n\t\t// Add listeners to buttons\r\n\t\tstartGame.addActionListener(new StartGameListener());\r\n\t\texitGame.addActionListener(new ExitGameListener());\r\n\t\t// Setting buttons in the middle of the screen\r\n\t\tsetLayout(new GridBagLayout());\r\n\t\tGridBagConstraints gbc = new GridBagConstraints();\r\n\t\tgbc.gridx = 0;\r\n\t\tgbc.gridy = 0;\r\n\t\tadd(startGame, gbc);\r\n\r\n\t\tgbc.gridx = 0;\r\n\t\tgbc.gridy = 1;\r\n\t\t// Resize \"exitGame\" button to \"startGame\" button size\r\n\t\texitGame.setPreferredSize(startGame.getPreferredSize());\r\n\t\t// Set insets between two buttons in 100 px\r\n\t\tgbc.insets = new Insets(100, 0, 0, 0);\r\n\t\tadd(exitGame, gbc);\r\n\t}","private void initButtons() {\r\n\t\texitGameButton\t\t= game.screenHelper.createTextButton(BUTTON_EXIT_GAME_TEXT, BUTTON_EXIT_GAME_MOUSEOVER_TEXT, menuText);\r\n\t\tcancelExitButton\t= game.screenHelper.createTextButton(BUTTON_CANCEL_EXIT_TEXT, BUTTON_CANCEL_EXIT_MOUSEOVER_TEXT, menuText);\r\n\t\tcancelExitButton.addListener(new ChangeScreenInputListener(new MenuScreenChangeCommand()));\r\n\t\t// Event Listeners \r\n\t\t// TODO: clean up this giant piece of shitty code.\r\n\t\t\r\n\t\texitGameButton.addListener(new InputListener() {\r\n\t\t\tpublic boolean touchDown (InputEvent event, float x, float y, int pointer, int button) {\r\n\t\t\t\texitGame();\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\t\t});\r\n\t}","public void init() {\r\n\r\n add(btnUn);\r\n add(btnDeux);\r\n add(btnTrois);\r\n add(btnQuatre);\r\n add(btnCinq);\r\n\r\n btnUn.setBounds(120, 120, 100, 75);\r\n btnDeux.setBounds(120, 310, 100, 75);\r\n btnDeux.setTransferHandler(new TransferHandler(\"icon\"));\r\n btnTrois.setBounds(360, 310, 100, 75);\r\n btnQuatre.setBounds(160, 600, 100, 75);\r\n btnQuatre.setTransferHandler(new TransferHandler(\"icon\"));\r\n btnCinq.setBounds(360, 600, 100, 75);\r\n\r\n }","public void initializeMenuItems() {\n\t\tuserMenuButton = new MenuButton();\n\t\tmenu1 = new MenuItem(bundle.getString(\"mVmenu1\")); //\n\t\tmenu2 = new MenuItem(bundle.getString(\"mVmenu2\")); //\n\t}","private void init(){\r\n\t\tImageIcon newTaskImg = new ImageIcon(\"resources/images/New.png\");\r\n\t\tImageIcon pauseImg = new ImageIcon(\"resources/images/Pause.png\");\r\n\t\tImageIcon resumeImg = new ImageIcon (\"resources/images/Begin.png\");\r\n\t\tImageIcon stopImg = new ImageIcon(\"resources/images/Stop.png\");\r\n\t\tImageIcon removeImg = new ImageIcon(\"resources/images/Remove.gif\");\r\n\t\tImageIcon shareImg = new ImageIcon(\"resources/images/Share.png\");\r\n\t\tImageIcon inboxImg = new ImageIcon(\"resources/images/Inbox.png\");\r\n\t\t\r\n\t\tnewTask = new JButton(newTaskImg);\r\n\t\tnewTask.setToolTipText(\"New Task\");\r\n\t\tpause = new JButton (pauseImg);\r\n\t\tpause.setToolTipText(\"Pause\");\r\n\t\trestart = new JButton (resumeImg);\r\n\t\trestart.setToolTipText(\"Restart\");\r\n\t\tstop = new JButton(stopImg);\r\n\t\tstop.setToolTipText(\"Stop\");\r\n\t\tremove = new JButton(removeImg);\r\n\t\tremove.setToolTipText(\"Remove\");\r\n\t\tshare = new JButton(shareImg);\r\n\t\tshare.setToolTipText(\"Share\");\r\n\t\tinbox = new JButton(inboxImg);\r\n\t\tinbox.setToolTipText(\"Inbox\");\r\n\t\t\r\n\t}","public void init() {\n Assets.init();\n titleAnimation = new Animation(Assets.titleMoving, 180);\n startButton = new MenuButton((game.getWidth()/2 - 100), 220, 100, 200, MenuButtonType.START, this);\n highscoreButton = new MenuButton((game.getWidth()/2 - 100), 370, 100, 200, MenuButtonType.HIGHSCORE, this);\n backButton = new NavigationButton(37, 720, 120, 60, NavigationButton.NavButtonType.BACK, this.getGame());\n tutorialButton = new MenuButton((game.getWidth()/2 - 100), 520, 100, 200, MenuButtonType.INSTRUCTIONS, this);\n \n showTutorial = false;\n }","@Override\n public void initialiseButtons() {\n resumeButton = new Button(buttonLeft, resumeButtonTop, buttonRight, resumeButtonBottom, Assets.resume);\n restartButton = new Button(buttonLeft, restartButtonTop, buttonRight, restartButtonBottom, Assets.restart);\n instructionsButton = new Button(buttonLeft, instructionsButtonTop, buttonRight, instructionsButtonBottom, Assets.instructions);\n quitButton = new Button(buttonLeft, quitButtonTop, buttonRight, quitButtonBottom, Assets.quit);\n backArrowButton = new Button(-8,-10,120,100, Assets.backArrowButton);\n saveGameButton = new Button(buttonLeft,saveGameButtonTop,buttonRight,saveGameButtonBottom,Assets.saveGame);\n }","private void initializeFeatures() {\n\t\tint buttonLength = 2*super.getXLength()/3;\n\t\tint buttonHeight = super.getYLength()/6;\n\t\tint startX = super.getXPos() + super.getXLength()/2 - buttonLength/2; \n\t\tint startY = super.getYPos() + super.getYLength()/2 - buttonHeight/2;\n\t\tint spacingBetweenButtons = 10; \n\t\tstart = new StartButton(parent,startX,startY,buttonLength,buttonHeight);\n\t\tinstructions = new InstructionsButton(parent,startX,startY + spacingBetweenButtons+buttonHeight,buttonLength,buttonHeight);\n\t\tquit = new QuitButton(parent,startX,startY + 2*(buttonHeight + spacingBetweenButtons),buttonLength,buttonHeight);\n\t}","private void configureButtons() {\n\n backToMenu = new JButton(\"Menu\");\n if(isWatching){\n backToMenu.setBounds(575, 270, 100, 50);\n }\n else{\n backToMenu.setBounds(30, 800, 100, 50);\n }\n backToMenu.setFont(new Font(\"Broadway\", Font.PLAIN, 20));\n backToMenu.setBackground(Color.RED);\n backToMenu.setFocusable(false);\n backToMenu.addActionListener(this);\n add(backToMenu);\n }","public MenuButton getStartButton() {\n return startButton;\n }","protected void init(){\n ac = new ButtonEventManager(this);\n \n nameField = new JTextField();\n \n done = new JButton(\"DONE\");\n back = new JButton(\"MAIN MENU\");\n quit = new JButton(\"QUIT\");\n \n done.setActionCommand(\"go to game menu after saving\");\n back.setActionCommand(\"go to the main menu\");\n quit.setActionCommand(\"quit the game\");\n \n Font font = new Font(\"Arial\", Font.PLAIN, 10);\n \n nameField.setFont(font);\n \n nameField.setBounds(2 * this.getWidth() / 3 - buttonWidth / 2, (int)(0.4 * this.getHeight() - textFieldHeight / 2), buttonWidth, textFieldHeight);\n \n done.setBounds((this.getWidth() / 2 - buttonWidth) / 2, (int)(0.7 * this.getHeight() - buttonHeight / 2), buttonWidth, buttonHeight);\n back.setBounds((this.getWidth() - buttonWidth) / 2, (int)(0.7 * this.getHeight() - buttonHeight / 2), buttonWidth, buttonHeight);\n quit.setBounds(3 * (this.getWidth() - buttonWidth) / 2, (int)(0.7 * this.getHeight() - buttonHeight / 2), buttonWidth, buttonHeight);\n \n done.addActionListener(ac);\n back.addActionListener(ac);\n quit.addActionListener(ac);\n \n add(nameField);\n \n add(done);\n add(back);\n add(quit);\n }","public void initMenu(){\n\t}","private void createButton(){\n addButton();\n addStartButton();\n }","public void init()\n {\n Container screen = getContentPane();\n buttonPanel.setLayout(new BoxLayout(buttonPanel, BoxLayout.Y_AXIS));\n buttonPanel.add(attackButton);\n attackButton.setBackground(Color.WHITE);\n buttonPanel.add(defendButton);\n buttonPanel.add(fireButton);\n buttonPanel.add(iceButton);\n buttonPanel.add(hPotionButton);\n buttonPanel.add(mPotionButton);\n attackButton.addActionListener(this);\n defendButton.addActionListener(this);\n hPotionButton.addActionListener(this);\n mPotionButton.addActionListener(this);\n fireButton.addActionListener(this);\n iceButton.addActionListener(this);\n offScreen = new BufferedImage(500,500, BufferedImage.TYPE_INT_RGB);\n add(buttonPanel, BorderLayout.EAST);\n }","public abstract void initButton(int buttonIndex);","public void startMenu() {\n setTitle(\"Nier Protomata\");\n setSize(ICoord.LAST_COL + ICoord.ADD_SIZE,\n ICoord.LAST_ROW + ICoord.ADD_SIZE);\n \n setButton();\n }","private void createButtons() {\n\tTexture startGameTex = new Texture(\n\t\tGdx.files.internal(\"assets/data/menu/menu_start.png\"));\n\tTexture plane_p1_tex = new Texture(\n\t\tGdx.files.internal(\"assets/data/menu/menu_player1.png\"));\n\tTexture plane_p2_tex = new Texture(\n\t\tGdx.files.internal(\"assets/data/menu/menu_player2.png\"));\n\n\tplayButton = new Button(\"\", font, 0, 0, new TextureRegion(startGameTex,\n\t\t0, 0, 161, 20), new TextureRegion(startGameTex, 0, 0, 161, 20),\n\t\tnew ScreenSwitchHandler(Screen.GAME));\n\tplaneButton_p1 = new Button(\"\", font, 0, 0, new TextureRegion(\n\t\tplane_p1_tex, 0, 0, 161, 20), new TextureRegion(plane_p1_tex,\n\t\t0, 0, 161, 20), new ScreenSwitchHandler(Screen.PLANE_P1));\n\tplaneButton_p2 = new Button(\"\", font, 0, 0, new TextureRegion(\n\t\tplane_p2_tex, 0, 0, 161, 20), new TextureRegion(plane_p2_tex,\n\t\t0, 0, 161, 20), new ScreenSwitchHandler(Screen.PLANE_P2));\n\toptionsButton = new Button(\"Options\", font, new ScreenSwitchHandler(\n\t\tScreen.OPTIONS));\n\texitButton = new Button(\"Exit\", font, new ButtonHandler() {\n\t @Override\n\t public void onClick() {\n\t\tGdx.app.exit();\n\t }\n\n\t @Override\n\t public void onRelease() {\n\t\t// TODO Auto-generated method stub\n\n\t }\n\t});\n }","private void init()\n {\n btnUser.setOnAction(buttonHandler);\n btnHome.setOnAction(event -> changeScene(\"store/fxml/home/home.fxml\"));\n btnCategories.setOnAction(event -> changeScene(\"store/fxml/category/categories.fxml\"));\n btnTopApps.setOnAction(buttonHandler);\n btnPurchased.setOnAction(buttonHandler);\n btnMenu.setOnAction(buttonHandler);\n btnSearch.setOnAction(buttonHandler);\n btnFeatured.setOnAction(buttonHandler);\n\n itmLogout = new MenuItem(\"Logout\");\n itmAddApp = new MenuItem(\"Add app\");\n itmUsers = new MenuItem(\"Manage users\");\n itmCategories = new MenuItem(\"Manage categories\");\n\n itmAddApp.setOnAction(itemHandler);\n itmLogout.setOnAction(itemHandler);\n itmUsers.setOnAction(itemHandler);\n itmCategories.setOnAction(itemHandler);\n\n if (user.getId() != null)\n {\n btnMenu.setVisible(true);\n if (user.getAdmin())\n btnMenu.getItems().addAll(itmAddApp, itmCategories, itmUsers, itmLogout);\n else\n btnMenu.getItems().add(itmLogout);\n\n ImageView imageView = new ImageView(user.getPicture());\n imageView.setFitHeight(25);\n imageView.setFitWidth(25);\n\n btnUser.setText(user.getUsername());\n }\n else\n btnMenu.setVisible(false);\n }","public void initGui()\n {\n StringTranslate var1 = StringTranslate.getInstance();\n int var2 = this.func_73907_g();\n\n for (int var3 = 0; var3 < this.options.keyBindings.length; ++var3)\n {\n this.controlList.add(new GuiSmallButton(var3, var2 + var3 % 2 * 160, this.height / 6 + 24 * (var3 >> 1), 70, 20, this.options.getOptionDisplayString(var3)));\n }\n\n this.controlList.add(new GuiButton(200, this.width / 2 - 100, this.height / 6 + 168, var1.translateKey(\"gui.done\")));\n this.screenTitle = var1.translateKey(\"controls.minimap.title\");\n }","private void initButtons() {\n HBox buttons = new HBox(50);\n yes = new Button(\"Yes!\");\n no = new Button(\"No!\");\n buttons.getChildren().addAll(yes,no);\n buttons.setAlignment(Pos.CENTER);\n root.getChildren().addAll(buttons);\n }","private void setButtons(JPanel menuContent) {\r\n\t \t \r\n \tJButton button_start = new JButton(start);\r\n \tbutton_start.setText(\"button_start\");\r\n\t \tbutton_start.setLocation(450, 300);\r\n\t\tbutton_start.setSize(405, 50);\r\n\t\tbutton_start.setBorderPainted(false);\r\n\t\tbutton_start.setFocusPainted(false);\r\n\t\tbutton_start.setContentAreaFilled(false);\r\n\t\tbutton_start.setCursor(new Cursor(Cursor.HAND_CURSOR));\r\n\t\tbutton_start.addActionListener(new ActionListener() {\r\n\t\t\t@Override\r\n\t\t\tpublic void actionPerformed(ActionEvent e) {\r\n\t\t\t\t// TODO Auto-generated method stub\r\n\t\t\t\tbutton_press.playSound(BUTTON_PRESS);\r\n\t\t\t}\r\n\t\t});\r\n\t\t\r\n\t \t \r\n\t \tJButton button_howto = new JButton(howto);\r\n\t \tbutton_howto.setText(\"button_howto\");\r\n\t \tbutton_howto.setLocation(450, 360);\r\n\t \tbutton_howto.setSize(405, 50);\r\n\t \tbutton_howto.setBorderPainted(false);\r\n\t \tbutton_howto.setFocusPainted(false);\r\n\t \tbutton_howto.setContentAreaFilled(false);\r\n\t \tbutton_howto.setCursor(new Cursor(Cursor.HAND_CURSOR));\r\n\t \tbutton_howto.addActionListener(new ActionListener() {\r\n\t\t\t@Override\r\n\t\t\tpublic void actionPerformed(ActionEvent e) {\r\n\t\t\t\t// TODO Auto-generated method stub\r\n\t\t\t\tbutton_press.playSound(BUTTON_PRESS);\r\n\t\t\t}\r\n\t\t});\r\n\t \t\r\n\t \tJButton button_options = new JButton(options);\r\n\t \tbutton_options.setText(\"button_options\");\r\n\t \tbutton_options.setLocation(450, 420);\r\n\t \tbutton_options.setSize(405, 50);\r\n\t \tbutton_options.setBorderPainted(false);\r\n\t \tbutton_options.setFocusPainted(false);\r\n\t \tbutton_options.setContentAreaFilled(false);\r\n\t \tbutton_options.setCursor(new Cursor(Cursor.HAND_CURSOR));\r\n\t \tbutton_options.addActionListener(new ActionListener() {\r\n\t\t\t@Override\r\n\t\t\tpublic void actionPerformed(ActionEvent e) {\r\n\t\t\t\t// TODO Auto-generated method stub\r\n\t\t\t\tbutton_press.playSound(BUTTON_PRESS);\r\n\t\t\t}\r\n\t\t});\r\n\t\t\r\n\t \tJButton button_lboards = new JButton(lboards);\r\n\t \tbutton_lboards.setText(\"button_lboards\");\r\n\t \tbutton_lboards.setLocation(450, 480);\r\n\t \tbutton_lboards.setSize(405, 50);\r\n\t \tbutton_lboards.setBorderPainted(false);\r\n\t \tbutton_lboards.setFocusPainted(false);\r\n\t \tbutton_lboards.setContentAreaFilled(false);\r\n\t \tbutton_lboards.setCursor(new Cursor(Cursor.HAND_CURSOR));\r\n\t \tbutton_lboards.addActionListener(new ActionListener() {\r\n\t\t\t@Override\r\n\t\t\tpublic void actionPerformed(ActionEvent e) {\r\n\t\t\t\t// TODO Auto-generated method stub\r\n\t\t\t\tbutton_press.playSound(BUTTON_PRESS);\r\n\t\t\t}\r\n\t\t});\r\n\t \t\r\n\t \tJButton button_exit = new JButton(exit);\r\n\t \tbutton_exit.setText(\"button_exit\");\r\n\t \tbutton_exit.setLocation(450, 540);\r\n\t \tbutton_exit.setSize(405, 50);\r\n\t \tbutton_exit.setBorderPainted(false);\r\n\t \tbutton_exit.setFocusPainted(false);\r\n\t \tbutton_exit.setContentAreaFilled(false);\r\n\t \tbutton_exit.setCursor(new Cursor(Cursor.HAND_CURSOR));\r\n\t \tbutton_exit.addActionListener(new ActionListener() {\r\n\t\t\t@Override\r\n\t\t\tpublic void actionPerformed(ActionEvent e) {\r\n\t\t\t\t// TODO Auto-generated method stub\r\n\t\t\t\tbutton_press.playSound(BUTTON_PRESS);\r\n\t\t\t}\r\n\t\t});\r\n\t \t\r\n\t \t//adds the buttons to the JPanel\r\n\t menuContent.add(button_start);\r\n\t menuContent.add(button_howto);\r\n\t menuContent.add(button_options);\r\n\t menuContent.add(button_lboards);\r\n\t menuContent.add(button_exit);\r\n\t\t\r\n\t}","public menu() {\n initComponents();\n }","public menu() {\n initComponents();\n }","private void setButtons()\n\t{\n\t\tstartSim = new JButton(\"Start Sim\");\n\t\tstartSim.addActionListener(this);\n\t\tpauseSim = new JButton(\"Pause Sim\");\n\t\tpauseSim.addActionListener(this);\n\t\taddEat = new JButton(\"Add Eatery\");\n\t\taddEat.addActionListener(this);\n\t\tsubEat = new JButton(\"Subtract Eatery\");\n\t\tsubEat.addActionListener(this);\n\t\taddCash = new JButton(\"Add Cashier\");\n\t\taddCash.addActionListener(this);\n\t\tsubCash = new JButton(\"Subtract Cashier\");\n\t\tsubCash.addActionListener(this);\n\t}","private void init() {\n\t\t\n\t\t// Buttons\n\t\tendButton = new JButton(\"Spiel beenden\");\n\t\tendButton.setBackground(Color.white);\n\t\tendButton.setForeground(Color.black);\n\t\tendButton.setFont(endButton.getFont().deriveFont(20.0f));\n\t\tendButton.setBorder(BorderFactory.createStrokeBorder(new BasicStroke(1.5f), Color.black));\n\t\t\n\t\tanleitungButton = new JButton(\"Anleitung\");\n\t\tanleitungButton.setBackground(endButton.getBackground());\n\t\tanleitungButton.setForeground(endButton.getForeground());\n\t\tanleitungButton.setFont(endButton.getFont());\n\t\tanleitungButton.setBorder(endButton.getBorder());\n\t\t\n\t\tbackButton = new JButton(\"zurück\");\n\t\tbackButton.setBackground(endButton.getBackground());\n\t\tbackButton.setForeground(endButton.getForeground());\n\t\tbackButton.setFont(endButton.getFont());\n\t\tbackButton.setBorder(endButton.getBorder());\n\t\t\n\t\tbuttonPanel = new JPanel(new GridLayout(3, 1, 0, 50));\n\t\tbuttonPanel.add(endButton);\n\t\tbuttonPanel.add(anleitungButton);\n\t\tbuttonPanel.add(backButton);\n\t\tbuttonPanel.setBackground(Color.red.darker());\n\t\t\n\t\tgetContentPane().setLayout(new BorderLayout(40, 40));\n\t\tgetContentPane().add(buttonPanel, BorderLayout.CENTER);\n\t\tgetContentPane().add(new JLabel(), BorderLayout.NORTH);\n\t\tgetContentPane().add(new JLabel(), BorderLayout.SOUTH);\n\t\tgetContentPane().add(new JLabel(), BorderLayout.WEST);\n\t\tgetContentPane().add(new JLabel(), BorderLayout.EAST);\n\t\tgetContentPane().setBackground(buttonPanel.getBackground());\n\t\t\n\t\t// ACTIONLISTENER\n\t\tendButton.addActionListener(new ActionListener() {\n\t\t\t\n\t\t\t@Override\n\t\t\tpublic void actionPerformed(ActionEvent e) {\n\t\t\t\tdispose();\n\t\t\t\tSystem.exit(0);\n\t\t\t\tcancelGameandGoBackToHome(e);\t\t\t\n\t\t\t}\n\t\t});\n\t\t\n\t\tanleitungButton.addActionListener(new ActionListener() {\n\t\t\t\n\t\t\t@Override\n\t\t\tpublic void actionPerformed(ActionEvent e) {\n\t\t\t\tdispose();\n\t\t\t\topenAnleitung(e);\n\t\t\t}\n\t\t});\n\t\t\n\t\tbackButton.addActionListener(new ActionListener() {\n\t\t\t\n\t\t\t@Override\n\t\t\tpublic void actionPerformed(ActionEvent e) {\n\t\t\t\tdispose();\n\t\t\t\tbackToGame(e);\t\t\t\t\t\n\t\t\t}\n\t\t});\n\t}","private void buttonInitiation() {\n submit = new JButton(\"Submit\");\n submit.setBounds(105, 250, 90, 25);\n this.add(submit);\n goBack = new JButton(\"Return to Main Menu\");\n goBack.setBounds(205, 250, 200, 25);\n this.add(goBack);\n }","private void initialize() {\r\n\r\n // add default buttons\r\n addButton(getToggleButton(),\"toggle\");\r\n addButton(getFinishButton(),\"finish\");\r\n addButton(getCancelButton(),\"cancel\");\r\n addActionListener(new ActionListener() {\r\n\r\n public void actionPerformed(ActionEvent e) {\r\n String cmd = e.getActionCommand();\r\n if(\"toggle\".equalsIgnoreCase(cmd)) change();\r\n else if(\"finish\".equalsIgnoreCase(cmd)) finish();\r\n else if(\"cancel\".equalsIgnoreCase(cmd)) cancel();\r\n }\r\n\r\n });\r\n\r\n }","public Menu_Ingreso() {\n initComponents();\n setLocationRelativeTo(null);\n }","public void init(){\n\t\tsetBackground(Color.green);\n\t\tmsg = \"Let's Play\";\n//\t\tmsg1 = \"Your Frinds Choice\";\n\t\tSystem.out.println(cpu);\n\t\tb1 = new Button(\"Stone\");\n\t\tb2 = new Button(\"Paper\");\n\t\tb3 = new Button(\"Seaser\");\n\t\tb1.addActionListener(this);\n\t\tb2.addActionListener(this);\n\t\tb3.addActionListener(this);\n\t\tadd(b1);\n\t\tadd(b2);\n\t\tadd(b3);\n\t}","public void initializeButtons(){\n\t\t\tplay.setBounds(40,90,280,30);\n\t\t\tadd(play);\n\t\t\tplay.addActionListener(new PlayGame());\n\t\t\tplay.setVisible(true);\n\t\t\t\n\t\t\tenterquestion.setBounds(40,140,280,30);\n\t\t\tadd(enterquestion);\n\t\t\tenterquestion.addActionListener(new EnterQuestion());\n\t\t\tenterquestion.setVisible(true);\n\t\t\t\n\t\t\tdirections.setBounds(40,190,280,30);\n\t\t\tadd(directions);\n\t\t\tdirections.addActionListener(new Instructor());\n\t\t\tdirections.setVisible(true);\n\t\t\t\n\t\t\t\n\t\t}","public Primary(){\r\n\t\tsuper(\"Welcome to Louis' Sushi bar!!!!\"); \r\n\t\tsetLayout(new FlowLayout());\r\n\t\tsetDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);\r\n\t\tsetSize(500, 200);\r\n\t\tsetVisible(true);\r\n\t\t\r\n\t\t\r\n//this is initailizing all the JLabels and buttons and adding an action listener to the buttons, here is here create the buttons for the different menus\r\n\t\tContinue = new JLabel(\"LOUIS' SHUSHI BAR, PRESS which menu you you would like to go to \");\r\n\t\tsushimenu = new JButton(\"SUSHI MENU\");\r\n\t\tsushimenu.addActionListener(this);\r\n\t\tmeatmenu = new JButton(\"MEAT MENU\");\r\n\t\tmeatmenu.addActionListener(this);\r\n\t\tsoupsaladmenu = new JButton(\"SOUP MENU\");\r\n\t\tsoupsaladmenu.addActionListener(this);\r\n\t\tadd (Continue);\r\n\t\tadd (sushimenu);\r\n\t\tadd (meatmenu);\r\n\t\tadd(soupsaladmenu);\r\n\t\r\n\t}","public static void initPauseMenu() {\n pausemenu.setBounds(0, 0, Display.WIDTH, Display.HEIGHT);\n pausemenu.setOpaque(false);\n\n pausemenu_resume_btn.setBounds(250, 210, 300, 50);\n pausemenu_resume_btn.setFont(main_menu_button_font);\n pausemenu_resume_btn.setFocusPainted(false);\n pausemenu_resume_btn.setOpaque(false);\n pausemenu_resume_btn.setBorderPainted(false);\n pausemenu_resume_btn.addActionListener(e -> game.resume());\n\n pausemenu_settings_btn.setBounds(250, 270, 300, 50);\n pausemenu_settings_btn.setFont(main_menu_button_font);\n pausemenu_settings_btn.setFocusPainted(false);\n pausemenu_settings_btn.setOpaque(false);\n pausemenu_settings_btn.setBorderPainted(false);\n pausemenu_settings_btn.addActionListener(e -> {\n options_menu.remove(options_back_button_tomainmenu);\n options_menu.add(options_back_button_topausemenu);\n PanelSlide.slideToLeft(pausemenu, options_menu, -1, -1);\n });\n\n pausemenu_quit_btn.setBounds(250, 330, 300, 50);\n pausemenu_quit_btn.setFont(main_menu_button_font);\n pausemenu_quit_btn.setFocusPainted(false);\n pausemenu_quit_btn.setOpaque(false);\n pausemenu_quit_btn.setBorderPainted(false);\n pausemenu_quit_btn.addActionListener(e -> {\n int pane = JOptionPane.showOptionDialog(null, \"Ana menüye dönmek istediğinize emin misiniz?\",\n \"Ana Menüye Dön\", JOptionPane.DEFAULT_OPTION, JOptionPane.QUESTION_MESSAGE, null, singleplayer_menu_yesno, 1);\n if (pane == 0) {\n main_menu.forward();\n }\n });\n\n pausemenu.add(pausemenu_resume_btn);\n pausemenu.add(pausemenu_settings_btn);\n pausemenu.add(pausemenu_quit_btn);\n }","public Menu() {\n initComponents();\n }","public Menu() {\n initComponents();\n }","public Menu() {\n initComponents();\n }","private void initComponents() {\n\t\tbtn_pause =new JButton(\"暂停游戏\");\n\t\tbtn_continue =new JButton(\"继续游戏\");\n\t\tbtn_restart =new JButton(\"重新开始\");\n\t\tbtn_rank =new JButton(\"游戏排行\");\n\t\tbtn_admin =new JButton(\"后台管理\");\n\t\t\n\t\t\n\t\t//给按钮设置单击监听\n\t\tbtn_pause.addActionListener(this);\n\t\tbtn_continue.addActionListener(this);\n\t\tbtn_restart.addActionListener(this);\n\t\tbtn_rank.addActionListener(this);\n\t\tbtn_admin.addActionListener(this);\n\t}","private void prepare()\r\n {\r\n MenuButton menubutton = new MenuButton();\r\n addObject(menubutton, 268, 406);\r\n Tittle tittle2 = new Tittle();\r\n addObject(tittle2, 544, 422);\r\n Exit exit2 = new Exit();\r\n addObject(exit2, 863, 427);\r\n tittle2.setLocation(545, 401);\r\n exit2.setLocation(848, 414);\r\n tittle2.setLocation(545, 411);\r\n }","public Menu_Train() {\n initComponents();\n }","public OptionPanel(Main w) {\r\n\t\tthis.w = w;\r\n\t\tstartButton = new JButton();\r\n\t\texitButton = new JButton();\r\n\t\t\r\n\t}","public MenuTamu() {\n initComponents();\n \n }","private void initBtnsArray()\r\n {\r\n for (int i = 0; i < this.buttons.length; i++)\r\n this.buttons[i] = new Button(\"Button #\" + i);\r\n }","private void initCommandButtons(char[] levelLetters) {\n\t\tthis.btnTopFirst = (Button) findViewById(R.id.buttonTopFirst);\n\t\tthis.btnTopSecond = (Button) findViewById(R.id.buttonTopSecond);\n\t\tthis.btnTopThird = (Button) findViewById(R.id.buttonTopThird);\n\t\tthis.btnTopFourth = (Button) findViewById(R.id.buttonTopFourth);\n\n\t\tthis.btnBotFirst = (Button) findViewById(R.id.buttonBotFirst);\n\t\tthis.btnBotSecond = (Button) findViewById(R.id.buttonBotSecond);\n\t\tthis.btnBotThird = (Button) findViewById(R.id.buttonBotThird);\n\t\tthis.btnBotFourth = (Button) findViewById(R.id.buttonBotFourth);\n\t\tthis.letterButtons = new Button[] { btnBotFirst, btnBotSecond,\n\t\t\t\tbtnBotThird, btnBotFourth, btnTopFirst, btnTopSecond,\n\t\t\t\tbtnTopThird, btnTopFourth };\n\t\tthis.btnEndWord = (Button) findViewById(R.id.btnEndWord);\n\n\t\t// End word should be disabled by default\n\t\tthis.btnEndWord.setEnabled(false);\n\n\t\t// Populate level letters\n\t\tint index = 0;\n\t\tfor (Button btn : this.letterButtons) {\n\t\t\tbtn.setText(\"\" + levelLetters[index]);\n\t\t\tindex++;\n\t\t}\n\t}","public MainMenu() {\n super();\n }","public ScreenMainMenu() {\n\t\tsuper(AdapterInputMainMenu.class);\n\t\tobj.add(new MainMenuInteractObjTest<>(gRef,200,200,new Rectangle(0,0,32,32)));\n\t\tChartset.detect(\"resources\\\\Charts\");\n\t}","public MainMenu() {\n initComponents();\n }","public MainMenu() {\n initComponents();\n }","public MainMenu() {\n initComponents();\n }","private void initMenu() {\n \n JMenuBar menuBar = new JMenuBar();\n \n JMenu commands = new JMenu(\"Commands\");\n \n JMenuItem add = new JMenuItem(\"Add\");\n add.addActionListener((ActionEvent e) -> {\n changeState(\"Add\");\n });\n commands.add(add);\n \n JMenuItem search = new JMenuItem(\"Search\");\n search.addActionListener((ActionEvent e) -> {\n changeState(\"Search\");\n });\n commands.add(search);\n \n JMenuItem quit = new JMenuItem(\"Quit\");\n quit.addActionListener((ActionEvent e) -> {\n System.out.println(\"QUITING\");\n System.exit(0);\n });\n commands.add(quit);\n \n menuBar.add(commands);\n \n setJMenuBar(menuBar);\n }","public PauseMenu() {\r\n\t\tinitialize();\r\n\t}","private void createBeginningButtons() {\n\t createStartButtons(myResources.getString(\"game1\"), 0, 0);\n\t\tcreateStartButtons(myResources.getString(\"game2\"), 0, 1);\n\t\tcreateStartButtons(myResources.getString(\"game3\"), 0, 2);\n\t\tcreateStartButtons(myResources.getString(\"game4\"), 0, 3);\n\t\tcreateStartButtons(myResources.getString(\"game5\"), 0, 4);\n\t\tcreateInstructionButton();\n\t\tcreateStartingLabel();\n\t\tcreateGridSizeButton();\n }","public menu() {\n initComponents();\n this.setLocationRelativeTo(null);\n }","public MenuBangunRuang() {\n initComponents();\n }","private void init_buttons(){\r\n /**\r\n * BOTON NUEVO\r\n */\r\n im_tool1.setOnMouseClicked((MouseEvent mouseEvent) -> {\r\n if(mouseEvent.getButton().equals(MouseButton.PRIMARY)){\r\n if(mouseEvent.getClickCount() > 0){\r\n botonInicio();\r\n botonNuevo();\r\n }\r\n }\r\n });\r\n /**\r\n * BOTON EDITAR\r\n */\r\n im_tool2.setOnMouseClicked((MouseEvent mouseEvent) -> {\r\n if(mouseEvent.getButton().equals(MouseButton.PRIMARY)){\r\n if(mouseEvent.getClickCount() > 0){\r\n botonEditar();\r\n }\r\n }\r\n });\r\n /**\r\n * BOTON GUARDAR\r\n */\r\n im_tool3.setOnMouseClicked((MouseEvent mouseEvent) -> {\r\n if(mouseEvent.getButton().equals(MouseButton.PRIMARY)){\r\n if(mouseEvent.getClickCount() > 0){\r\n botonGuardar();\r\n }\r\n }\r\n }); \r\n /**\r\n * BOTON ELIMINAR\r\n */\r\n im_tool4.setOnMouseClicked((MouseEvent mouseEvent) -> {\r\n if(mouseEvent.getButton().equals(MouseButton.PRIMARY)){\r\n if(mouseEvent.getClickCount() > 0){\r\n botonEliminar();\r\n }\r\n }\r\n });\r\n /**\r\n * BOTON IMPRIMIR\r\n */\r\n im_tool5.setOnMouseClicked((MouseEvent mouseEvent) -> {\r\n if(mouseEvent.getButton().equals(MouseButton.PRIMARY)){\r\n if(mouseEvent.getClickCount() > 0){ \r\n botonImprimir();\r\n }\r\n }\r\n });\r\n /**\r\n * BOTON REGRESAR\r\n */\r\n im_tool6.setOnMouseClicked((MouseEvent mouseEvent) -> {\r\n if(mouseEvent.getButton().equals(MouseButton.PRIMARY)){\r\n if(mouseEvent.getClickCount() > 0){\r\n botonInicio();\r\n }\r\n }\r\n });\r\n /**\r\n * BOTON POR ASIGNAR\r\n */\r\n im_tool7.setOnMouseClicked((MouseEvent mouseEvent) -> {\r\n if(mouseEvent.getButton().equals(MouseButton.PRIMARY)){\r\n if(mouseEvent.getClickCount() > 0){\r\n //\r\n }\r\n }\r\n });\r\n /**\r\n * BOTON NOTAS DE CREDITO\r\n */\r\n im_tool8.setOnMouseClicked((MouseEvent mouseEvent) -> {\r\n if(mouseEvent.getButton().equals(MouseButton.PRIMARY)){\r\n if(mouseEvent.getClickCount() > 0){\r\n //\r\n }\r\n }\r\n });\r\n /**\r\n * BOTON DEVOLUCION\r\n */\r\n im_tool9.setOnMouseClicked((MouseEvent mouseEvent) -> {\r\n if(mouseEvent.getButton().equals(MouseButton.PRIMARY)){\r\n if(mouseEvent.getClickCount() > 0){\r\n //\r\n }\r\n }\r\n });\r\n /**\r\n * BOTON BUSCAR\r\n */\r\n im_tool12.setOnMouseClicked((MouseEvent mouseEvent) -> {\r\n if(mouseEvent.getButton().equals(MouseButton.PRIMARY)){\r\n switch (mouseEvent.getClickCount()){\r\n case 1:\r\n botonInicio();\r\n botonBuscar();\r\n break;\r\n case 2:\r\n Datos.setIdButton(2003041);\r\n Gui.getInstance().showBusqueda(\"Busqueda\"); \r\n break;\r\n }\r\n }\r\n });\r\n /**\r\n * SELECCION EN LA TABLA\r\n */\r\n tb_guias.setOnMouseClicked((MouseEvent mouseEvent) -> {\r\n if(mouseEvent.getButton().equals(MouseButton.PRIMARY)){\r\n if(mouseEvent.getClickCount() > 0){\r\n if ((tb_guias.getItems() != null) && (!tb_guias.getItems().isEmpty()))\r\n selectedRowGuide();\r\n }\r\n }\r\n }); \r\n /**\r\n * metodo para mostrar buscar el nro de guia\r\n * param: ENTER O TAB\r\n */\r\n tf_nroguia.setOnKeyReleased((KeyEvent ke) -> {\r\n if (ke.getCode().equals(KeyCode.ENTER)){\r\n //Valida que el evento se haya generado en el campo de busqueda\r\n if(((Node)ke.getSource()).getId().equals(\"tf_nroguia\")){\r\n //Solicita los datos y envia la Respuesta a imprimirse en la Pantalla\r\n Datos.setLog_cguias(new log_CGuias()); \r\n boolean boo = Ln.getInstance().check_log_CGuias_rela_caja(tf_nroguia.getText()); \r\n numGuias = 0;\r\n if(boo){\r\n Datos.setRep_log_cguias(Ln.getInstance().find_log_CGuias(tf_nroguia.getText(), \"\", \"ncaja\", Integer.parseInt(rows)));\r\n loadTable(Datos.getRep_log_cguias()); \r\n }\r\n else{\r\n change_im_val(0, im_checkg); \r\n Gui.getInstance().showMessage(\"El Nro. de \" + ScreenName + \" NO existe!\", \"A\");\r\n tf_nroguia.requestFocus();\r\n }\r\n }\r\n }\r\n });\r\n /**\r\n * metodo para mostrar buscar el nro de guia\r\n * param: ENTER O TAB\r\n */\r\n tf_nrorguia.setOnKeyReleased((KeyEvent ke) -> {\r\n if (ke.getCode().equals(KeyCode.ENTER)){\r\n //Valida que el evento se haya generado en el campo de busqueda\r\n if(((Node)ke.getSource()).getId().equals(\"tf_nrorguia\")){\r\n //Solicita los datos y envia la Respuesta a imprimirse en la Pantalla\r\n boolean booa = true; \r\n if(booa){\r\n boolean booc = Ln.getInstance().check_log_CGuias_caja(tf_nrorguia.getText()); \r\n if(booc){\r\n change_im_val(0, im_checkg); \r\n Gui.getInstance().showMessage(\"El Nro. de Guia ya esta relacionado!\", \"A\");\r\n tf_nrorguia.requestFocus();\r\n }\r\n else{\r\n for (int i = 0; i < log_guide_guia.size(); i++) {\r\n if(tf_nrorguia.getText().equals(tb_guias.getItems().get(i).getGuias())){\r\n booa = false;\r\n Gui.getInstance().showMessage(\"El Nro. de Guia ya esta relacionado!\", \"A\");\r\n tf_nrorguia.requestFocus();\r\n break;\r\n }\r\n } \r\n if(booa){\r\n log_Guide_rel_inv guide_carga = new log_Guide_rel_inv();\r\n\r\n List<Fxp_Archguid_gfc> data = \r\n Ln.getList_log_Archguid_gfc(Ln.getInstance().find_Archguid_gfc(tf_nrorguia.getText()));\r\n\r\n if (data.get(0).getStat_guia().equals(\"X\")\r\n || data.get(0).getStat_guia().equals(\"C\")){\r\n guide_carga.setNumorden(String.valueOf((log_guide_guia.size() + 1)));\r\n guide_carga.setGuias(tf_nrorguia.getText());\r\n guide_carga.setNumfact(data.get(0).getNumfact());\r\n guide_carga.setNumclie(data.get(0).getNumclie());\r\n\r\n if (data.get(0).getStat_guia().equals(\"A\")){\r\n if (tipoOperacion == 1)\r\n guide_carga.setStat_guia(null);\r\n else\r\n guide_carga.setStat_guia(data.get(0).getStat_guia());\r\n }\r\n else{\r\n guide_carga.setStat_guia(null);\r\n }\r\n \r\n \r\n log_guide_guia.add(guide_carga);\r\n\r\n loadTableGuide_guias();\r\n change_im_val(200, im_checkg); \r\n\r\n numFactCarga = numFactCarga + data.get(0).getNumfact();\r\n numClieCarga = numClieCarga + data.get(0).getNumclie();\r\n\r\n tf_nrorguia.setText(\"\");\r\n }else{\r\n if (data.get(0).getStat_guia().equals(\"\")){\r\n Gui.getInstance().showMessage(\"El Nro. de Guia NO tiene relación de Guia de Carga!\", \"A\");\r\n }\r\n else{\r\n Gui.getInstance().showMessage(\"El Nro. de Guia ya esta relacionado!\", \"A\");\r\n }\r\n tf_nrorguia.requestFocus();\r\n }\r\n \r\n }\r\n }\r\n }\r\n else{\r\n change_im_val(0, im_checkg); \r\n Gui.getInstance().showMessage(\"El Nro. de Guia NO existe!\", \"A\");\r\n tf_nrorguia.requestFocus();\r\n }\r\n }\r\n }\r\n });\r\n }","public DropMainMenu() {\n initComponents();\n }","private void buttonInit() {\n panel.add(createButton);\n panel.add(editButton);\n panel.add(changeButton);\n createButton.addActionListener(this);\n editButton.addActionListener(this);\n changeButton.addActionListener(this);\n submitNewUser.addActionListener(this);\n editAccTypeBtn.addActionListener(this);\n changePassBtn.addActionListener(this);\n }","public Component startButton() {\n startButton = new JButton(\"Start\");\n setFocusable(false);\n return startButton;\n }","public StartupOptions() {\n initComponents();\n done.addActionListener(Seasonality.bi);\n\n }","public ButtonMenuPanelBuyer() {\n initComponents();\n }","private void initToolbar() {\n\t\tButton nextStep = new Button(\"Next Step\");\n\t\tnextStep.setOnMouseClicked(new EventHandler<Event>() {\n\t\t\t@Override\n\t\t\tpublic void handle(Event event) {\n\t\t\t\tcontrol.performOneStep();\n\t\t\t}\n\t\t});\n\t\tthis.getItems().add(nextStep);\n\n\t\t// Make and set Start Button\n\t\tButton startButton = new Button(\"Start Game\");\n\t\tstartButton.setOnMouseClicked(new EventHandler<Event>() {\n\n\t\t\t@Override\n\t\t\tpublic void handle(Event event) {\n\t\t\t\tcontrol.startGame();\n\t\t\t}\n\t\t});\n\t\tthis.getItems().add(startButton);\n\n\t\t// Make and set Pause Button\n\t\tButton pauseButton = new Button(\"Pause Game\");\n\t\tpauseButton.setOnMouseClicked(new EventHandler<Event>() {\n\n\t\t\t@Override\n\t\t\tpublic void handle(Event event) {\n\t\t\t\tcontrol.pauseGame();\n\t\t\t}\n\t\t});\n\t\tthis.getItems().add(pauseButton);\n\n\t\t//Text Field for GameSpeed\n\t\tText gameSpeedText = new Text(\"Delay between steps: \" + initialSpeed +\"ms\");\n\t\tthis.getItems().add(gameSpeedText);\n\t\t\n\t\t//Make and add Slider for GameSpeed control\n\t\tSlider gameSpeedSlider = new Slider(10, 250, initialSpeed);\n\t\tcontrol.setGameSpeed(initialSpeed);\n\t\t\n\t\tgameSpeedSlider.valueProperty().addListener(\n\t\t (observable, oldvalue, newvalue) ->\n\t\t {\n\t\t int i = newvalue.intValue();\n\t\t //This sets the delay in the controller\n\t\t control.setGameSpeed(i);\n\t\t //Text Label that displays delay\n\t\t gameSpeedText.setText(\"Delay between steps: \" + i +\"ms\");\n\t\t } );\n\t\t\n\t\tthis.getItems().add(gameSpeedSlider);\n\t\n\t\t\n\t\t\n\t}","private void initAction() {\n\t\timg_back.setOnClickListener(this);\n\t\tbtn_delete.setOnClickListener(this);\n\t\tbtn_update.setOnClickListener(this);\n\t}","public void initGui()\n {\n StringTranslate var2 = StringTranslate.getInstance();\n int var4 = this.height / 4 + 48;\n\n this.controlList.add(new GuiButton(1, this.width / 2 - 100, var4 + 24 * 1, \"Offline Mode\"));\n this.controlList.add(new GuiButton(2, this.width / 2 - 100, var4, \"Online Mode\"));\n\n this.controlList.add(new GuiButton(3, this.width / 2 - 100, var4 + 48, var2.translateKey(\"menu.mods\")));\n\t\tthis.controlList.add(new GuiButton(0, this.width / 2 - 100, var4 + 72 + 12, 98, 20, var2.translateKey(\"menu.options\")));\n\t\tthis.controlList.add(new GuiButton(4, this.width / 2 + 2, var4 + 72 + 12, 98, 20, var2.translateKey(\"menu.quit\")));\n this.controlList.add(new GuiButtonLanguage(5, this.width / 2 - 124, var4 + 72 + 12));\n }","public void initGui()\n {\n this.buttonList.clear();\n this.multilineMessage = this.fontRendererObj.listFormattedStringToWidth(this.message.getFormattedText(), this.width - 50);\n this.field_175353_i = this.multilineMessage.size() * this.fontRendererObj.FONT_HEIGHT;\n this.buttonList.add(new GuiButton(0, this.width / 2 - 100, this.height / 2 + this.field_175353_i / 2 + this.fontRendererObj.FONT_HEIGHT, I18n.format(\"gui.toMenu\", new Object[0])));\n if(!TabGUI.openTabGUI) return;\n this.buttonList.add(new GuiButton(1, this.width / 2 - 100, this.height / 2 + 20 + this.field_175353_i / 2 + this.fontRendererObj.FONT_HEIGHT, 100, 20, \"Reconnect\"));\n this.buttonList.add(new GuiButton(2, this.width / 2, this.height / 2 + 20 + this.field_175353_i / 2 + this.fontRendererObj.FONT_HEIGHT, 100, 20, \"Random Alt\"));\n }","public void init() {\n\t\tMenu menu = new Menu();\n\t\tmenu.register();\n\n\t\t// Application.getInstance().getGUILog().showMessage(\"Show a popup the proper\n\t\t// way !\");\n\n\t\t// final ActionsConfiguratorsManager manager =\n\t\t// ActionsConfiguratorsManager.getInstance();\n\n\t\t// final MDAction action = new ExampleAction();\n\t\t// Adding action to main menu\n\t\t// manager.addMainMenuConfigurator(new MainMenuConfigurator(action));\n\t\t// Adding action to main toolbar\n\t\t// manager.addMainToolbarConfigurator(new MainToolbarConfigurator(action));\n\n\t\t// pluginDir = getDescriptor().getPluginDirectory().getPath();\n\n\t\t// Creating submenu in the MagicDraw main menu\n\t\t// ActionsConfiguratorsManager manager =\n\t\t// ActionsConfiguratorsManager.getInstance();\n\t\t// manager.addMainMenuConfigurator(new\n\t\t// MainMenuConfigurator(getSubmenuActions()));\n\n\t\t/**\n\t\t * @Todo: load project options (@see myplugin.generator.options.ProjectOptions)\n\t\t * from ProjectOptions.xml and take ejb generator options\n\t\t */\n\n\t\t// for test purpose only:\n\t\t// GeneratorOptions ejbOptions = new GeneratorOptions(\"c:/temp\", \"ejbclass\",\n\t\t// \"templates\", \"{0}.java\", true, \"ejb\");\n\t\t// ProjectOptions.getProjectOptions().getGeneratorOptions().put(\"EJBGenerator\",\n\t\t// ejbOptions);\n\n\t\t// ejbOptions.setTemplateDir(pluginDir + File.separator +\n\t\t// ejbOptions.getTemplateDir()); //apsolutna putanja\n\t}","private void buttonInit(){\n for(int i=0; i < 3; i++){\n choice[i] = new JButton();\n\n }\n choice[0].setText(\"10x10 / 8 bombs\");\n choice[0].setBackground(new Color(86, 160, 189));\n\n\n choice[0].addActionListener(l-> makeGamePanel(10, 8));\n\n choice[1].setText(\"15x15 / 30 bombs\");\n choice[1].setBackground(new Color(238, 160, 160));\n\n\n choice[1].addActionListener(l-> makeGamePanel(15,30));\n\n choice[2].setText(\"24x24 / 70 bombs\");\n choice[2].setBackground(new Color(253, 230, 122));\n choice[2].setFont(new Font(Font.MONOSPACED, Font.BOLD, 30));\n choice[2].setForeground(new Color(45, 68, 73));\n\n choice[2].addActionListener(l-> makeGamePanel(24,70));\n\n this.add(choice[0], BorderLayout.LINE_START); this.add(choice[1], BorderLayout.LINE_END); this.add(choice[2], BorderLayout.CENTER);\n }","public vistaMenu() {\n initComponents();\n this.setLocationRelativeTo(null);\n }","public MenuKullanimi()\n {\n initComponents();\n setLocationRelativeTo(null);\n }","public Tela_Menu2() {\n initComponents();\n }","public Menus() {\n initComponents();\n }","private ButtonPane()\r\n\t\t\t{ super(new String[]{\"OK\",\"Cancel\"},1,2); }","@FXML\n private void initialize(){\n\n //set default button\n chooseDirectoryButton.setDefaultButton(true);\n\n //Disable both button on start up\n startWatcherButton.setDisable(true);\n stopWatcherButton.setDisable(true);\n }","public UIMenu() {\n initComponents();\n setLocationRelativeTo(null);\n background.requestFocusInWindow();\n createButtonMode.setVisible(false);\n loginButtonMode.setVisible(false);\n repassword.setVisible(false);\n inputRePass.setVisible(false);\n }","@Override\n\tpublic void initGui()\n {\n this.controlList.clear();\n //Keyboard.enableRepeatEvents(true);\n\n int var1 = (this.width - this.bookImageWidth) / 2;\n int var2 = (this.height - this.bookImageHeight - 40) / 2;\n this.controlList.add(this.buttonNextPage = new GuiButtonNextPage(1, var1 + 120, var2 + 154, true));\n this.controlList.add(this.buttonPreviousPage = new GuiButtonNextPage(2, var1 + 38, var2 + 154, false));\n this.controlList.add(this.buttonIndex = new GuiButtonNextPage(8, var1 + 28, var2 + 10, false));\n this.controlList.add(this.buttonMenu1 = new GuiButtonSelect(3, var1 + 35, var2 + 30, 110, 20, \"\"));\n this.controlList.add(this.buttonMenu2 = new GuiButtonSelect(4, var1 + 35, var2 + 55, 110, 20, \"\"));\n this.controlList.add(this.buttonMenu3 = new GuiButtonSelect(5, var1 + 35, var2 + 80, 110, 20, \"\"));\n this.controlList.add(this.buttonMenu4 = new GuiButtonSelect(6, var1 + 35, var2 + 105, 110, 20, \"\"));\n this.controlList.add(this.buttonMenu5 = new GuiButtonSelect(7, var1 + 35, var2 + 130, 110, 20, \"\"));\n this.controlList.add(this.bookmark = new GuiButtonBookmark(9, var1 + 142, var2 + 7, false));\n this.updateButtons();\n }","public void setStartButton(JButton startButton) {\n\t\tthis.startButton = startButton;\n\t}","public void initialize() {\n\t\tbombLabel.setText(\"Flag: \" + game.getFlagCounter() + \"/\" + game.getNumOfBombs());\n\t\ttimerLabel.setText(\"Time: \" + 0);\n\t\tboard.getStyleClass().add(\"grid\");\n\t\tbtnArray = new Button[game.getHeight()][game.getWidth()];\n\t\tfor (int x = 0; x < game.getHeight(); x++) {\n\t\t\tfor (int y = 0; y < game.getWidth(); y++) {\n\t\t\t\tButton btn = new Button(\"\");\n\t\t\t\tbtnArray[x][y] = btn;\n\t\t\t\tbtn.setMaxSize(50, 50);\n\t\t\t\tbtn.setMinSize(50, 50);\n\t\t\t\t//Add Button to the board (GridPane)\n\t\t\t\tboard.add(btn, x, y);\n\t\t\t\tbtn.setId(x + \" . \" + y);\n\t\t\t\tbtn.setOnMouseClicked(e -> TileClicked(e));\n\t\t\t}\n\t\t}\n\t}","@Override\n\tprotected void InitButtonListener() {\n\t\tLayoutTop.setOnClickListener(new View.OnClickListener() {\n\t\t\t\n\t\t\t@Override\n\t\t\tpublic void onClick(View v) {\n\t\t\t\t// TODO Auto-generated method stub\n\t\t\t\tClickOption();\n\t\t\t\t\n\t\t\t}\n\t\t});\n\t}","public void InitializeMenu(){\n\t\tmnbBar = new JMenuBar();\n\t\tmnuFile = new JMenu(\"File\");\n\t\tmnuFormat = new JMenu(\"Format\");\n\t\tmniOpen = new JMenuItem(\"Open\");\n\t\tmniExit = new JMenuItem(\"Exit\");\n\t\tmniSave = new JMenuItem(\"Save\");\n\t\tmniSaveAs = new JMenuItem(\"Save as\");\n\t\tmniSaveAs.setMnemonic(KeyEvent.VK_A);\n\t\tmniSave.setMnemonic(KeyEvent.VK_S);\n\t\tmniChangeBgColor = new JMenuItem(\"Change Backgroud Color\");\n\t\tmniChangeFontColor = new JMenuItem(\"Change Font Color\");\n\t\t//them menu item vao menu file\n\t\tmnuFile.add(mniOpen);\n\t\tmnuFile.addSeparator();\n\t\tmnuFile.add(mniExit);\n\t\tmnuFile.add(mniSaveAs);\n\t\tmnuFile.add(mniSave);\n\t\t//them menu item vao menu format\n\t\tmnuFormat.add(mniChangeBgColor);\n\t\tmnuFormat.addSeparator();\n\t\tmnuFormat.add(mniChangeFontColor);\n\t\t//them menu file va menu format vao menu bar\n\t\tmnbBar.add(mnuFile);\n\t\tmnbBar.add(mnuFormat);\n\t\t//thiet lap menubar thanh menu chinh cua frame\n\t\tsetJMenuBar(mnbBar);\n\t}","public void setMenu() {\n\t \n\t\ttop = new JPanel(new FlowLayout(FlowLayout.LEFT));\n\t add(top, BorderLayout.CENTER);\n\t \n\t lPro = new JLabel(\"Projects: \");\n\t top.add(lPro);\n\t \n\t cPro = new JComboBox();\n\t getProject();\n\t\ttop.add(cPro);\n\t\t\n\t\tview = new JButton(\"View Sample\");\n\t\ttop.add(view);\n\t\t\n\t\tbottom = new JPanel(new FlowLayout(FlowLayout.CENTER));\n\t\tadd(bottom, BorderLayout.SOUTH);\n\t\t\n\t\tcancel = new JButton(\"Cancel\");\n\t\tbottom.add(cancel);\n\t\t\n\t\tdownload = new JButton(\"Download\");\n\t\tbottom.add(download);\n\t\t\n\t\tsetActionListener();\t\n\t}","public menuAddStasiun() {\n initComponents();\n }","public void initPlayerMenu() {\n Font f = new Font(\"Helvetica\", Font.BOLD, 16);\n\n menuPanel = new JPanel();\n menuPanel.setPreferredSize(new Dimension(buttonWidth, buttonHeight));\n menuPanel.setLayout(null);\n\n menuBar = new JMenuBar();\n menuBar.setPreferredSize(new Dimension(buttonWidth, buttonHeight));\n menuBar.setBounds(0, 0, buttonWidth, buttonHeight);\n menuBar.setLayout(null);\n\n playerMenu = new JMenu();\n playerMenu.setText(\"Players\");\n playerMenu.setFont(f);\n playerMenu.setBounds(0, 0, buttonWidth, buttonHeight);\n playerMenu.setBackground(new Color(0xeaf1f7));\n playerMenu.setHorizontalTextPosition(SwingConstants.CENTER);\n playerMenu.setOpaque(true);\n playerMenu.setBorder(BorderFactory.createBevelBorder(0));\n\n menuBar.add(playerMenu);\n menuPanel.add(menuBar);\n }","public MenuPrincipal() {\n\t\tinitComponents();\n\t\tbtnSplines.setVisible(false);\n\t\tbtnEcuacionesNolineales.addActionListener(new ActionListener() {\n\n\t\t\t@Override\n\t\t\tpublic void actionPerformed(ActionEvent e) {\n\t\t\t\tGestorInterfazPrincipal.iniciarUnidad1();\n\t\t\t}\n\t\t});\n\t\tbtnSistemasdeEcuaciones.addActionListener(new ActionListener() {\n\n\t\t\t@Override\n\t\t\tpublic void actionPerformed(ActionEvent arg0) {\n\t\t\t\tGestorInterfazPrincipal.iniciarSistemasEcuaciones();\n\t\t\t}\n\t\t});\n\t\tbtnGraficador.addActionListener(new ActionListener() {\n\n\t\t\t@Override\n\t\t\tpublic void actionPerformed(ActionEvent arg0) {\n\t\t\t\tGestorInterfazPrincipal.iniciarGraficador();\n\t\t\t}\n\t\t});\n\t\tbtnInterpolacion.addActionListener(new ActionListener() {\n\n\t\t\t@Override\n\t\t\tpublic void actionPerformed(ActionEvent arg0) {\n\t\t\t\tGestorInterfazPrincipal.iniciarInterpolacion();\n\t\t\t}\n\t\t});\n\t\tbtnDiferenciacion.addActionListener(new ActionListener() {\n\t\t\t\n\t\t\t@Override\n\t\t\tpublic void actionPerformed(ActionEvent arg0) {\n\t\t\t\tGestorInterfazPrincipal.iniciarDiferenciacion();\n\t\t\t}\n\t\t});\n\t\tbtnIntegracion.addActionListener(new ActionListener() {\n\t\t\t\n\t\t\t@Override\n\t\t\tpublic void actionPerformed(ActionEvent arg0) {\n\t\t\t\tGestorInterfazPrincipal.iniciarIntegracion();\n\t\t\t}\n\t\t});\n\n\t}","private void initNodeListe() {\n\t\t\n\t\tbtnAddTransaction = new JFXButton();\n\t\tbtnAddTransaction.setButtonType(JFXButton.ButtonType.RAISED);\n\t\tbtnAddTransaction.getStyleClass()\n\t\t\t\t.addAll(\"RoundButton\", \"NeutralButton\");\n\t\tbtnOutgo = new JFXButton(\"D\");\n\t\tbtnOutgo.setButtonType(JFXButton.ButtonType.RAISED);\n\t\tbtnOutgo.getStyleClass().addAll(\"RoundButton\", \"RedButton\");\n\t\tbtnIncome = new JFXButton(\"R\");\n\t\tbtnIncome.setButtonType(JFXButton.ButtonType.RAISED);\n\t\tbtnIncome.getStyleClass().addAll(\"RoundButton\", \"GreenButton\");\n\t\t\n\t\tnodeAjout.addAnimatedNode(btnAddTransaction);\n\t\tnodeAjout.addAnimatedNode(btnOutgo);\n\t\tnodeAjout.addAnimatedNode(btnIncome);\n\t\tnodeAjout.setSpacing(5d);\n\t\tnodeAjout.setRotate(180);\n\t\t\n\t\tImageView image = new ImageView(new Image(\n\t\t\t\tgetClass().getResourceAsStream(\"/gui/Image/add.png\")));\n\t\timage.setFitWidth(20);\n\t\timage.setFitHeight(20);\n\t\tbtnAddTransaction.setGraphic(image);\n\t\t\n\t}","public PlayerScheduleMenu() {\n initComponents();\n }","public MenuButtons(String nameOfButton) {\n Text text = new Text(nameOfButton);\n text.setFont(Font.font(null, FontWeight.BOLD, 18));\n text.setFill(Color.WHITESMOKE);\n\n //A rectangle that will be a part of the button\n Rectangle rectangle = new Rectangle(250,30);\n rectangle.setOpacity(0.3);\n rectangle.setFill(Color.BLUE);\n\n setAlignment(Pos.CENTER_LEFT);\n getChildren().addAll(rectangle, text);\n\n setOnMouseEntered(e -> {\n rectangle.setTranslateX(5);\n text.setTranslateX(5);\n rectangle.setFill(Color.DARKBLUE);\n });\n\n setOnMouseExited(e -> {\n rectangle.setTranslateX(0);\n text.setTranslateX(0);\n rectangle.setFill(Color.BLUE);\n });\n\n DropShadow shadowEffect = new DropShadow();\n shadowEffect.setInput(new Glow());\n\n setOnMousePressed(e -> setEffect(shadowEffect));\n setOnMouseReleased(e -> setEffect(null));\n }","private void init() {\n setBackground(LIGHT_GRAY);\n Box layout = new Box(BoxLayout.Y_AXIS);\n\n jump = createButton(\"Jump\", null);\n exit = createButton(\"Exit!\", null);\n fly = createButton(\"Fly\", null);\n Jfloat = createButton(\"Float\", null);\n layout.add(Box.createRigidArea(new Dimension(0, 150)));\n layout.add(jump);\n layout.add(Box.createRigidArea(new Dimension(0, 25)));\n layout.add(Jfloat);\n layout.add(Box.createRigidArea(new Dimension(0, 25)));\n layout.add(fly);\n layout.add(Box.createRigidArea(new Dimension(0, 25)));\n layout.add(exit);\n add(layout);\n }","public StartScreen() {\n initComponents();\n }","public Menu2() {\n initComponents();\n }","public LinkButton() {\n\t\tsuper();\n\t\tinit();\n\t}","private void initMenu()\n {\n bar = new JMenuBar();\n fileMenu = new JMenu(\"File\");\n crawlerMenu = new JMenu(\"Crawler\"); \n aboutMenu = new JMenu(\"About\");\n \n bar.add(fileMenu);\n bar.add(crawlerMenu);\n bar.add(aboutMenu);\n \n exit = new JMenuItem(\"Exit\");\n preferences = new JMenuItem(\"Preferences\");\n author = new JMenuItem(\"Author\");\n startCrawlerItem = new JMenuItem(\"Start\");\n stopCrawlerItem = new JMenuItem(\"Stop\");\n newIndexItem = new JMenuItem(\"New index\");\n openIndexItem = new JMenuItem(\"Open index\");\n \n stopCrawlerItem.setEnabled(false);\n \n fileMenu.add(newIndexItem);\n fileMenu.add(openIndexItem);\n fileMenu.add(exit);\n aboutMenu.add(author);\n crawlerMenu.add(startCrawlerItem);\n crawlerMenu.add(stopCrawlerItem);\n crawlerMenu.add(preferences);\n \n author.addActionListener(this);\n preferences.addActionListener(this);\n exit.addActionListener(this);\n startCrawlerItem.addActionListener(this);\n stopCrawlerItem.addActionListener(this);\n newIndexItem.addActionListener(this);\n openIndexItem.addActionListener(this);\n \n frame.setJMenuBar(bar);\n }","private void startButtonAction(){\n scoreboard.setStartAction(event->initControl());\n }","private void initUI() {\n tvQuote = (TextView) findViewById(R.id.tvQuote);\n tvBeginButton = (TextView) findViewById(R.id.tvBeginButton);\n\n tvBeginButton.setOnClickListener(this);\n\n loadBackground();\n }","private void initEvent() {\n\t\tmBtnPower.setOnClickListener(this);\n\t\tmBtnProfile.setOnClickListener(this);\n\t\tmBtnArea.setOnClickListener(this);\n\t\tmBtnSkipTime.setOnClickListener(this);\n\t\tmBtnFrequencyPoint.setOnClickListener(this);\n\t\tmBtnAlgorithm.setOnClickListener(this);\n\t}","public OptionsMenu() {\n initComponents();\n }","@Override\r\n\tpublic void initGui() {\r\n\t final int buttonSize = SIZE_X - 10;\r\n\r\n\t _curScrollValue = 0;\r\n\t buttonList.clear();\r\n\t _selectedList.clear();\r\n\r\n\t _deleteButton = new GuiButton(0, (width - buttonSize) / 2, (height + SIZE_Y) / 2 + 12, buttonSize, 20, \"Delete Selected Waypoints\");\r\n\t \r\n\t // load the saved waypoint data to initialize this gui\r\n\t UltraTeleportWaypoint.load();\r\n\t}","public frameMenu() {\n initComponents();\n }"],"string":"[\n \"public void initMenu() {\\n\\t\\t\\r\\n\\t\\treturnToGame = new JButton(\\\"Return to Game\\\");\\r\\n\\t\\treturnToGame.setBounds(900, 900, 0, 0);\\r\\n\\t\\treturnToGame.setBackground(Color.BLACK);\\r\\n\\t\\treturnToGame.setForeground(Color.WHITE);\\r\\n\\t\\treturnToGame.setVisible(false);\\r\\n\\t\\treturnToGame.addActionListener(this);\\r\\n\\t\\t\\r\\n\\t\\treturnToStart = new JButton(\\\"Main Menu\\\");\\r\\n\\t\\treturnToStart.setBounds(900, 900, 0, 0);\\r\\n\\t\\treturnToStart.setBackground(Color.BLACK);\\r\\n\\t\\treturnToStart.setForeground(Color.WHITE);\\r\\n\\t\\treturnToStart.setVisible(false);\\r\\n\\t\\treturnToStart.addActionListener(this);\\r\\n\\t\\t\\r\\n\\t\\t//add(menubackground);\\r\\n\\t\\tadd(returnToGame);\\r\\n\\t\\tadd(returnToStart);\\r\\n\\t}\",\n \"public StartMenu(){\\n\\t\\tmenu.setTitle(\\\"COP4331 Spring '14 - Battle Ship!\\\");\\n\\t\\t\\n\\t\\t//startGame JButton will begin a new game\\n\\t\\tstartEasyGame = new JButton(\\\"Start Easy Game\\\");\\n\\t\\tstartEasyGame.addActionListener(new ActionListener(){\\n\\t\\t\\tpublic void actionPerformed(ActionEvent arg0) {\\n\\t\\t\\t\\tsetSkill(0);\\n\\t\\t\\t\\tplay = true;\\n\\t\\t\\t}\\n\\t\\t});\\n\\t\\t\\n\\t\\tstartAdvancedGame = new JButton(\\\"Start Advanced Game\\\");\\n\\t\\tstartAdvancedGame.addActionListener(new ActionListener(){\\n\\t\\t\\tpublic void actionPerformed(ActionEvent arg0) {\\n\\t\\t\\t\\tsetSkill(1);\\n\\t\\t\\t\\tplay = true;\\n\\t\\t\\t}\\n\\t\\t});\\n\\t\\t\\n\\t\\t\\t\\n\\t\\t//exitGame JButton will end the program\\n\\t\\texitGame = new JButton(\\\"Exit Game\\\");\\n\\t\\texitGame.addActionListener(new ActionListener(){\\n\\t\\t\\tpublic void actionPerformed(ActionEvent arg0){\\n\\t\\t\\t\\tclose = true;\\n\\t\\t\\t}\\n\\t\\t});\\n\\t\\t\\n\\t\\tmenu.add(startEasyGame);\\n\\t\\tmenu.add(startAdvancedGame);\\n\\t\\tmenu.add(exitGame);\\t\\t\\n\\t}\",\n \"public Menu getStartMenu() {\\n Menu menu = new Menu(new Point(475, 0), 672-475, 320, 8, 1, new Cursor(new Point(0, 7)), \\\"exit\\\");\\n Button PokedexButton = new Button(new Point(475, 0), 672-475, 40, \\\"Pokédex\\\", new Point(0, 7), \\\"Pokédex\\\");\\n Button PokemonButton = new Button(new Point(475, 40), 672-475, 40, \\\"Pokémon\\\", new Point(0, 6), \\\"Pokémon\\\");\\n Button BagButton = new Button(new Point(475, 80), 672-475, 40, \\\"Bag\\\", new Point(0, 5), \\\"Bag\\\");\\n Button PokenavButton = new Button(new Point(475, 120), 672-475, 40, \\\"Pokénav\\\", new Point(0, 4), \\\"Pokénav\\\");\\n Button PlayerButton = new Button(new Point(475, 160), 672-475, 40, trainer.getName(), new Point(0, 3), trainer.getName());\\n Button SaveButton = new Button(new Point(475, 200), 672-475, 40, \\\"save\\\", new Point(0, 2), \\\"Save\\\");\\n Button OptionButton = new Button(new Point(475, 240), 672-475, 40, \\\"add_menu_other\\\", new Point(0, 1), \\\"Options\\\");\\n Button ExitButton = new Button(new Point(475, 280), 672-475, 40, \\\"exit\\\", new Point(0, 0), \\\"exit\\\");\\n menu.addButton(PokedexButton);\\n menu.addButton(PokemonButton);\\n menu.addButton(BagButton);\\n menu.addButton(PokenavButton);\\n menu.addButton(PlayerButton);\\n menu.addButton(SaveButton);\\n menu.addButton(OptionButton);\\n menu.addButton(ExitButton);\\n menu.getButton(menu.getCursor().getPos()).Highlight();\\n return menu;\\n }\",\n \"public startingMenu() {\\r\\n initComponents();\\r\\n }\",\n \"public MainMenuScreen(MainController controller) {\\n this.controller = controller;\\n startButton = new Button(\\\"start_button\\\", new SpriteBatch());\\n optionsButton = new Button(\\\"options_button\\\", new SpriteBatch());\\n topButton = new Button(\\\"top_button\\\", new SpriteBatch());\\n exitButton = new Button(\\\"exit_button\\\", new SpriteBatch());\\n }\",\n \"public void addMenuItems()\\n\\t{\\n\\t\\tstartButton = new JButton(\\\"Start\\\");\\n\\t\\tstartButton.setLayout(null);\\n\\t\\tstartButton.setBounds(350, 225, 100, 50);\\n\\t\\t\\n\\t\\toptionsButton = new JButton(\\\"Options\\\");\\n\\t\\toptionsButton.setLayout(null);\\n\\t\\toptionsButton.setBounds(350, 275, 100, 50);\\n\\t\\t\\n\\t\\texitButton = new JButton(\\\"Exit\\\");\\n\\t\\texitButton.setLayout(null);\\n\\t\\texitButton.setBounds(350, 375, 100, 50);\\n\\t\\texitButton.setActionCommand(\\\"exit\\\");\\n\\t\\texitButton.addActionListener((ActionListener) this);\\n\\t\\t\\n\\t\\tmainMenuPanel.add(startButton);\\n\\t\\tmainMenuPanel.add(optionsButton);\\n\\t\\tmainMenuPanel.add(startButton);\\n\\t}\",\n \"private void initMenu() {\\n\\t\\tloadImage();\\r\\n\\t\\t// Add listeners to buttons\\r\\n\\t\\tstartGame.addActionListener(new StartGameListener());\\r\\n\\t\\texitGame.addActionListener(new ExitGameListener());\\r\\n\\t\\t// Setting buttons in the middle of the screen\\r\\n\\t\\tsetLayout(new GridBagLayout());\\r\\n\\t\\tGridBagConstraints gbc = new GridBagConstraints();\\r\\n\\t\\tgbc.gridx = 0;\\r\\n\\t\\tgbc.gridy = 0;\\r\\n\\t\\tadd(startGame, gbc);\\r\\n\\r\\n\\t\\tgbc.gridx = 0;\\r\\n\\t\\tgbc.gridy = 1;\\r\\n\\t\\t// Resize \\\"exitGame\\\" button to \\\"startGame\\\" button size\\r\\n\\t\\texitGame.setPreferredSize(startGame.getPreferredSize());\\r\\n\\t\\t// Set insets between two buttons in 100 px\\r\\n\\t\\tgbc.insets = new Insets(100, 0, 0, 0);\\r\\n\\t\\tadd(exitGame, gbc);\\r\\n\\t}\",\n \"private void initButtons() {\\r\\n\\t\\texitGameButton\\t\\t= game.screenHelper.createTextButton(BUTTON_EXIT_GAME_TEXT, BUTTON_EXIT_GAME_MOUSEOVER_TEXT, menuText);\\r\\n\\t\\tcancelExitButton\\t= game.screenHelper.createTextButton(BUTTON_CANCEL_EXIT_TEXT, BUTTON_CANCEL_EXIT_MOUSEOVER_TEXT, menuText);\\r\\n\\t\\tcancelExitButton.addListener(new ChangeScreenInputListener(new MenuScreenChangeCommand()));\\r\\n\\t\\t// Event Listeners \\r\\n\\t\\t// TODO: clean up this giant piece of shitty code.\\r\\n\\t\\t\\r\\n\\t\\texitGameButton.addListener(new InputListener() {\\r\\n\\t\\t\\tpublic boolean touchDown (InputEvent event, float x, float y, int pointer, int button) {\\r\\n\\t\\t\\t\\texitGame();\\r\\n\\t\\t\\t\\treturn false;\\r\\n\\t\\t\\t}\\r\\n\\t\\t});\\r\\n\\t}\",\n \"public void init() {\\r\\n\\r\\n add(btnUn);\\r\\n add(btnDeux);\\r\\n add(btnTrois);\\r\\n add(btnQuatre);\\r\\n add(btnCinq);\\r\\n\\r\\n btnUn.setBounds(120, 120, 100, 75);\\r\\n btnDeux.setBounds(120, 310, 100, 75);\\r\\n btnDeux.setTransferHandler(new TransferHandler(\\\"icon\\\"));\\r\\n btnTrois.setBounds(360, 310, 100, 75);\\r\\n btnQuatre.setBounds(160, 600, 100, 75);\\r\\n btnQuatre.setTransferHandler(new TransferHandler(\\\"icon\\\"));\\r\\n btnCinq.setBounds(360, 600, 100, 75);\\r\\n\\r\\n }\",\n \"public void initializeMenuItems() {\\n\\t\\tuserMenuButton = new MenuButton();\\n\\t\\tmenu1 = new MenuItem(bundle.getString(\\\"mVmenu1\\\")); //\\n\\t\\tmenu2 = new MenuItem(bundle.getString(\\\"mVmenu2\\\")); //\\n\\t}\",\n \"private void init(){\\r\\n\\t\\tImageIcon newTaskImg = new ImageIcon(\\\"resources/images/New.png\\\");\\r\\n\\t\\tImageIcon pauseImg = new ImageIcon(\\\"resources/images/Pause.png\\\");\\r\\n\\t\\tImageIcon resumeImg = new ImageIcon (\\\"resources/images/Begin.png\\\");\\r\\n\\t\\tImageIcon stopImg = new ImageIcon(\\\"resources/images/Stop.png\\\");\\r\\n\\t\\tImageIcon removeImg = new ImageIcon(\\\"resources/images/Remove.gif\\\");\\r\\n\\t\\tImageIcon shareImg = new ImageIcon(\\\"resources/images/Share.png\\\");\\r\\n\\t\\tImageIcon inboxImg = new ImageIcon(\\\"resources/images/Inbox.png\\\");\\r\\n\\t\\t\\r\\n\\t\\tnewTask = new JButton(newTaskImg);\\r\\n\\t\\tnewTask.setToolTipText(\\\"New Task\\\");\\r\\n\\t\\tpause = new JButton (pauseImg);\\r\\n\\t\\tpause.setToolTipText(\\\"Pause\\\");\\r\\n\\t\\trestart = new JButton (resumeImg);\\r\\n\\t\\trestart.setToolTipText(\\\"Restart\\\");\\r\\n\\t\\tstop = new JButton(stopImg);\\r\\n\\t\\tstop.setToolTipText(\\\"Stop\\\");\\r\\n\\t\\tremove = new JButton(removeImg);\\r\\n\\t\\tremove.setToolTipText(\\\"Remove\\\");\\r\\n\\t\\tshare = new JButton(shareImg);\\r\\n\\t\\tshare.setToolTipText(\\\"Share\\\");\\r\\n\\t\\tinbox = new JButton(inboxImg);\\r\\n\\t\\tinbox.setToolTipText(\\\"Inbox\\\");\\r\\n\\t\\t\\r\\n\\t}\",\n \"public void init() {\\n Assets.init();\\n titleAnimation = new Animation(Assets.titleMoving, 180);\\n startButton = new MenuButton((game.getWidth()/2 - 100), 220, 100, 200, MenuButtonType.START, this);\\n highscoreButton = new MenuButton((game.getWidth()/2 - 100), 370, 100, 200, MenuButtonType.HIGHSCORE, this);\\n backButton = new NavigationButton(37, 720, 120, 60, NavigationButton.NavButtonType.BACK, this.getGame());\\n tutorialButton = new MenuButton((game.getWidth()/2 - 100), 520, 100, 200, MenuButtonType.INSTRUCTIONS, this);\\n \\n showTutorial = false;\\n }\",\n \"@Override\\n public void initialiseButtons() {\\n resumeButton = new Button(buttonLeft, resumeButtonTop, buttonRight, resumeButtonBottom, Assets.resume);\\n restartButton = new Button(buttonLeft, restartButtonTop, buttonRight, restartButtonBottom, Assets.restart);\\n instructionsButton = new Button(buttonLeft, instructionsButtonTop, buttonRight, instructionsButtonBottom, Assets.instructions);\\n quitButton = new Button(buttonLeft, quitButtonTop, buttonRight, quitButtonBottom, Assets.quit);\\n backArrowButton = new Button(-8,-10,120,100, Assets.backArrowButton);\\n saveGameButton = new Button(buttonLeft,saveGameButtonTop,buttonRight,saveGameButtonBottom,Assets.saveGame);\\n }\",\n \"private void initializeFeatures() {\\n\\t\\tint buttonLength = 2*super.getXLength()/3;\\n\\t\\tint buttonHeight = super.getYLength()/6;\\n\\t\\tint startX = super.getXPos() + super.getXLength()/2 - buttonLength/2; \\n\\t\\tint startY = super.getYPos() + super.getYLength()/2 - buttonHeight/2;\\n\\t\\tint spacingBetweenButtons = 10; \\n\\t\\tstart = new StartButton(parent,startX,startY,buttonLength,buttonHeight);\\n\\t\\tinstructions = new InstructionsButton(parent,startX,startY + spacingBetweenButtons+buttonHeight,buttonLength,buttonHeight);\\n\\t\\tquit = new QuitButton(parent,startX,startY + 2*(buttonHeight + spacingBetweenButtons),buttonLength,buttonHeight);\\n\\t}\",\n \"private void configureButtons() {\\n\\n backToMenu = new JButton(\\\"Menu\\\");\\n if(isWatching){\\n backToMenu.setBounds(575, 270, 100, 50);\\n }\\n else{\\n backToMenu.setBounds(30, 800, 100, 50);\\n }\\n backToMenu.setFont(new Font(\\\"Broadway\\\", Font.PLAIN, 20));\\n backToMenu.setBackground(Color.RED);\\n backToMenu.setFocusable(false);\\n backToMenu.addActionListener(this);\\n add(backToMenu);\\n }\",\n \"public MenuButton getStartButton() {\\n return startButton;\\n }\",\n \"protected void init(){\\n ac = new ButtonEventManager(this);\\n \\n nameField = new JTextField();\\n \\n done = new JButton(\\\"DONE\\\");\\n back = new JButton(\\\"MAIN MENU\\\");\\n quit = new JButton(\\\"QUIT\\\");\\n \\n done.setActionCommand(\\\"go to game menu after saving\\\");\\n back.setActionCommand(\\\"go to the main menu\\\");\\n quit.setActionCommand(\\\"quit the game\\\");\\n \\n Font font = new Font(\\\"Arial\\\", Font.PLAIN, 10);\\n \\n nameField.setFont(font);\\n \\n nameField.setBounds(2 * this.getWidth() / 3 - buttonWidth / 2, (int)(0.4 * this.getHeight() - textFieldHeight / 2), buttonWidth, textFieldHeight);\\n \\n done.setBounds((this.getWidth() / 2 - buttonWidth) / 2, (int)(0.7 * this.getHeight() - buttonHeight / 2), buttonWidth, buttonHeight);\\n back.setBounds((this.getWidth() - buttonWidth) / 2, (int)(0.7 * this.getHeight() - buttonHeight / 2), buttonWidth, buttonHeight);\\n quit.setBounds(3 * (this.getWidth() - buttonWidth) / 2, (int)(0.7 * this.getHeight() - buttonHeight / 2), buttonWidth, buttonHeight);\\n \\n done.addActionListener(ac);\\n back.addActionListener(ac);\\n quit.addActionListener(ac);\\n \\n add(nameField);\\n \\n add(done);\\n add(back);\\n add(quit);\\n }\",\n \"public void initMenu(){\\n\\t}\",\n \"private void createButton(){\\n addButton();\\n addStartButton();\\n }\",\n \"public void init()\\n {\\n Container screen = getContentPane();\\n buttonPanel.setLayout(new BoxLayout(buttonPanel, BoxLayout.Y_AXIS));\\n buttonPanel.add(attackButton);\\n attackButton.setBackground(Color.WHITE);\\n buttonPanel.add(defendButton);\\n buttonPanel.add(fireButton);\\n buttonPanel.add(iceButton);\\n buttonPanel.add(hPotionButton);\\n buttonPanel.add(mPotionButton);\\n attackButton.addActionListener(this);\\n defendButton.addActionListener(this);\\n hPotionButton.addActionListener(this);\\n mPotionButton.addActionListener(this);\\n fireButton.addActionListener(this);\\n iceButton.addActionListener(this);\\n offScreen = new BufferedImage(500,500, BufferedImage.TYPE_INT_RGB);\\n add(buttonPanel, BorderLayout.EAST);\\n }\",\n \"public abstract void initButton(int buttonIndex);\",\n \"public void startMenu() {\\n setTitle(\\\"Nier Protomata\\\");\\n setSize(ICoord.LAST_COL + ICoord.ADD_SIZE,\\n ICoord.LAST_ROW + ICoord.ADD_SIZE);\\n \\n setButton();\\n }\",\n \"private void createButtons() {\\n\\tTexture startGameTex = new Texture(\\n\\t\\tGdx.files.internal(\\\"assets/data/menu/menu_start.png\\\"));\\n\\tTexture plane_p1_tex = new Texture(\\n\\t\\tGdx.files.internal(\\\"assets/data/menu/menu_player1.png\\\"));\\n\\tTexture plane_p2_tex = new Texture(\\n\\t\\tGdx.files.internal(\\\"assets/data/menu/menu_player2.png\\\"));\\n\\n\\tplayButton = new Button(\\\"\\\", font, 0, 0, new TextureRegion(startGameTex,\\n\\t\\t0, 0, 161, 20), new TextureRegion(startGameTex, 0, 0, 161, 20),\\n\\t\\tnew ScreenSwitchHandler(Screen.GAME));\\n\\tplaneButton_p1 = new Button(\\\"\\\", font, 0, 0, new TextureRegion(\\n\\t\\tplane_p1_tex, 0, 0, 161, 20), new TextureRegion(plane_p1_tex,\\n\\t\\t0, 0, 161, 20), new ScreenSwitchHandler(Screen.PLANE_P1));\\n\\tplaneButton_p2 = new Button(\\\"\\\", font, 0, 0, new TextureRegion(\\n\\t\\tplane_p2_tex, 0, 0, 161, 20), new TextureRegion(plane_p2_tex,\\n\\t\\t0, 0, 161, 20), new ScreenSwitchHandler(Screen.PLANE_P2));\\n\\toptionsButton = new Button(\\\"Options\\\", font, new ScreenSwitchHandler(\\n\\t\\tScreen.OPTIONS));\\n\\texitButton = new Button(\\\"Exit\\\", font, new ButtonHandler() {\\n\\t @Override\\n\\t public void onClick() {\\n\\t\\tGdx.app.exit();\\n\\t }\\n\\n\\t @Override\\n\\t public void onRelease() {\\n\\t\\t// TODO Auto-generated method stub\\n\\n\\t }\\n\\t});\\n }\",\n \"private void init()\\n {\\n btnUser.setOnAction(buttonHandler);\\n btnHome.setOnAction(event -> changeScene(\\\"store/fxml/home/home.fxml\\\"));\\n btnCategories.setOnAction(event -> changeScene(\\\"store/fxml/category/categories.fxml\\\"));\\n btnTopApps.setOnAction(buttonHandler);\\n btnPurchased.setOnAction(buttonHandler);\\n btnMenu.setOnAction(buttonHandler);\\n btnSearch.setOnAction(buttonHandler);\\n btnFeatured.setOnAction(buttonHandler);\\n\\n itmLogout = new MenuItem(\\\"Logout\\\");\\n itmAddApp = new MenuItem(\\\"Add app\\\");\\n itmUsers = new MenuItem(\\\"Manage users\\\");\\n itmCategories = new MenuItem(\\\"Manage categories\\\");\\n\\n itmAddApp.setOnAction(itemHandler);\\n itmLogout.setOnAction(itemHandler);\\n itmUsers.setOnAction(itemHandler);\\n itmCategories.setOnAction(itemHandler);\\n\\n if (user.getId() != null)\\n {\\n btnMenu.setVisible(true);\\n if (user.getAdmin())\\n btnMenu.getItems().addAll(itmAddApp, itmCategories, itmUsers, itmLogout);\\n else\\n btnMenu.getItems().add(itmLogout);\\n\\n ImageView imageView = new ImageView(user.getPicture());\\n imageView.setFitHeight(25);\\n imageView.setFitWidth(25);\\n\\n btnUser.setText(user.getUsername());\\n }\\n else\\n btnMenu.setVisible(false);\\n }\",\n \"public void initGui()\\n {\\n StringTranslate var1 = StringTranslate.getInstance();\\n int var2 = this.func_73907_g();\\n\\n for (int var3 = 0; var3 < this.options.keyBindings.length; ++var3)\\n {\\n this.controlList.add(new GuiSmallButton(var3, var2 + var3 % 2 * 160, this.height / 6 + 24 * (var3 >> 1), 70, 20, this.options.getOptionDisplayString(var3)));\\n }\\n\\n this.controlList.add(new GuiButton(200, this.width / 2 - 100, this.height / 6 + 168, var1.translateKey(\\\"gui.done\\\")));\\n this.screenTitle = var1.translateKey(\\\"controls.minimap.title\\\");\\n }\",\n \"private void initButtons() {\\n HBox buttons = new HBox(50);\\n yes = new Button(\\\"Yes!\\\");\\n no = new Button(\\\"No!\\\");\\n buttons.getChildren().addAll(yes,no);\\n buttons.setAlignment(Pos.CENTER);\\n root.getChildren().addAll(buttons);\\n }\",\n \"private void setButtons(JPanel menuContent) {\\r\\n\\t \\t \\r\\n \\tJButton button_start = new JButton(start);\\r\\n \\tbutton_start.setText(\\\"button_start\\\");\\r\\n\\t \\tbutton_start.setLocation(450, 300);\\r\\n\\t\\tbutton_start.setSize(405, 50);\\r\\n\\t\\tbutton_start.setBorderPainted(false);\\r\\n\\t\\tbutton_start.setFocusPainted(false);\\r\\n\\t\\tbutton_start.setContentAreaFilled(false);\\r\\n\\t\\tbutton_start.setCursor(new Cursor(Cursor.HAND_CURSOR));\\r\\n\\t\\tbutton_start.addActionListener(new ActionListener() {\\r\\n\\t\\t\\t@Override\\r\\n\\t\\t\\tpublic void actionPerformed(ActionEvent e) {\\r\\n\\t\\t\\t\\t// TODO Auto-generated method stub\\r\\n\\t\\t\\t\\tbutton_press.playSound(BUTTON_PRESS);\\r\\n\\t\\t\\t}\\r\\n\\t\\t});\\r\\n\\t\\t\\r\\n\\t \\t \\r\\n\\t \\tJButton button_howto = new JButton(howto);\\r\\n\\t \\tbutton_howto.setText(\\\"button_howto\\\");\\r\\n\\t \\tbutton_howto.setLocation(450, 360);\\r\\n\\t \\tbutton_howto.setSize(405, 50);\\r\\n\\t \\tbutton_howto.setBorderPainted(false);\\r\\n\\t \\tbutton_howto.setFocusPainted(false);\\r\\n\\t \\tbutton_howto.setContentAreaFilled(false);\\r\\n\\t \\tbutton_howto.setCursor(new Cursor(Cursor.HAND_CURSOR));\\r\\n\\t \\tbutton_howto.addActionListener(new ActionListener() {\\r\\n\\t\\t\\t@Override\\r\\n\\t\\t\\tpublic void actionPerformed(ActionEvent e) {\\r\\n\\t\\t\\t\\t// TODO Auto-generated method stub\\r\\n\\t\\t\\t\\tbutton_press.playSound(BUTTON_PRESS);\\r\\n\\t\\t\\t}\\r\\n\\t\\t});\\r\\n\\t \\t\\r\\n\\t \\tJButton button_options = new JButton(options);\\r\\n\\t \\tbutton_options.setText(\\\"button_options\\\");\\r\\n\\t \\tbutton_options.setLocation(450, 420);\\r\\n\\t \\tbutton_options.setSize(405, 50);\\r\\n\\t \\tbutton_options.setBorderPainted(false);\\r\\n\\t \\tbutton_options.setFocusPainted(false);\\r\\n\\t \\tbutton_options.setContentAreaFilled(false);\\r\\n\\t \\tbutton_options.setCursor(new Cursor(Cursor.HAND_CURSOR));\\r\\n\\t \\tbutton_options.addActionListener(new ActionListener() {\\r\\n\\t\\t\\t@Override\\r\\n\\t\\t\\tpublic void actionPerformed(ActionEvent e) {\\r\\n\\t\\t\\t\\t// TODO Auto-generated method stub\\r\\n\\t\\t\\t\\tbutton_press.playSound(BUTTON_PRESS);\\r\\n\\t\\t\\t}\\r\\n\\t\\t});\\r\\n\\t\\t\\r\\n\\t \\tJButton button_lboards = new JButton(lboards);\\r\\n\\t \\tbutton_lboards.setText(\\\"button_lboards\\\");\\r\\n\\t \\tbutton_lboards.setLocation(450, 480);\\r\\n\\t \\tbutton_lboards.setSize(405, 50);\\r\\n\\t \\tbutton_lboards.setBorderPainted(false);\\r\\n\\t \\tbutton_lboards.setFocusPainted(false);\\r\\n\\t \\tbutton_lboards.setContentAreaFilled(false);\\r\\n\\t \\tbutton_lboards.setCursor(new Cursor(Cursor.HAND_CURSOR));\\r\\n\\t \\tbutton_lboards.addActionListener(new ActionListener() {\\r\\n\\t\\t\\t@Override\\r\\n\\t\\t\\tpublic void actionPerformed(ActionEvent e) {\\r\\n\\t\\t\\t\\t// TODO Auto-generated method stub\\r\\n\\t\\t\\t\\tbutton_press.playSound(BUTTON_PRESS);\\r\\n\\t\\t\\t}\\r\\n\\t\\t});\\r\\n\\t \\t\\r\\n\\t \\tJButton button_exit = new JButton(exit);\\r\\n\\t \\tbutton_exit.setText(\\\"button_exit\\\");\\r\\n\\t \\tbutton_exit.setLocation(450, 540);\\r\\n\\t \\tbutton_exit.setSize(405, 50);\\r\\n\\t \\tbutton_exit.setBorderPainted(false);\\r\\n\\t \\tbutton_exit.setFocusPainted(false);\\r\\n\\t \\tbutton_exit.setContentAreaFilled(false);\\r\\n\\t \\tbutton_exit.setCursor(new Cursor(Cursor.HAND_CURSOR));\\r\\n\\t \\tbutton_exit.addActionListener(new ActionListener() {\\r\\n\\t\\t\\t@Override\\r\\n\\t\\t\\tpublic void actionPerformed(ActionEvent e) {\\r\\n\\t\\t\\t\\t// TODO Auto-generated method stub\\r\\n\\t\\t\\t\\tbutton_press.playSound(BUTTON_PRESS);\\r\\n\\t\\t\\t}\\r\\n\\t\\t});\\r\\n\\t \\t\\r\\n\\t \\t//adds the buttons to the JPanel\\r\\n\\t menuContent.add(button_start);\\r\\n\\t menuContent.add(button_howto);\\r\\n\\t menuContent.add(button_options);\\r\\n\\t menuContent.add(button_lboards);\\r\\n\\t menuContent.add(button_exit);\\r\\n\\t\\t\\r\\n\\t}\",\n \"public menu() {\\n initComponents();\\n }\",\n \"public menu() {\\n initComponents();\\n }\",\n \"private void setButtons()\\n\\t{\\n\\t\\tstartSim = new JButton(\\\"Start Sim\\\");\\n\\t\\tstartSim.addActionListener(this);\\n\\t\\tpauseSim = new JButton(\\\"Pause Sim\\\");\\n\\t\\tpauseSim.addActionListener(this);\\n\\t\\taddEat = new JButton(\\\"Add Eatery\\\");\\n\\t\\taddEat.addActionListener(this);\\n\\t\\tsubEat = new JButton(\\\"Subtract Eatery\\\");\\n\\t\\tsubEat.addActionListener(this);\\n\\t\\taddCash = new JButton(\\\"Add Cashier\\\");\\n\\t\\taddCash.addActionListener(this);\\n\\t\\tsubCash = new JButton(\\\"Subtract Cashier\\\");\\n\\t\\tsubCash.addActionListener(this);\\n\\t}\",\n \"private void init() {\\n\\t\\t\\n\\t\\t// Buttons\\n\\t\\tendButton = new JButton(\\\"Spiel beenden\\\");\\n\\t\\tendButton.setBackground(Color.white);\\n\\t\\tendButton.setForeground(Color.black);\\n\\t\\tendButton.setFont(endButton.getFont().deriveFont(20.0f));\\n\\t\\tendButton.setBorder(BorderFactory.createStrokeBorder(new BasicStroke(1.5f), Color.black));\\n\\t\\t\\n\\t\\tanleitungButton = new JButton(\\\"Anleitung\\\");\\n\\t\\tanleitungButton.setBackground(endButton.getBackground());\\n\\t\\tanleitungButton.setForeground(endButton.getForeground());\\n\\t\\tanleitungButton.setFont(endButton.getFont());\\n\\t\\tanleitungButton.setBorder(endButton.getBorder());\\n\\t\\t\\n\\t\\tbackButton = new JButton(\\\"zurück\\\");\\n\\t\\tbackButton.setBackground(endButton.getBackground());\\n\\t\\tbackButton.setForeground(endButton.getForeground());\\n\\t\\tbackButton.setFont(endButton.getFont());\\n\\t\\tbackButton.setBorder(endButton.getBorder());\\n\\t\\t\\n\\t\\tbuttonPanel = new JPanel(new GridLayout(3, 1, 0, 50));\\n\\t\\tbuttonPanel.add(endButton);\\n\\t\\tbuttonPanel.add(anleitungButton);\\n\\t\\tbuttonPanel.add(backButton);\\n\\t\\tbuttonPanel.setBackground(Color.red.darker());\\n\\t\\t\\n\\t\\tgetContentPane().setLayout(new BorderLayout(40, 40));\\n\\t\\tgetContentPane().add(buttonPanel, BorderLayout.CENTER);\\n\\t\\tgetContentPane().add(new JLabel(), BorderLayout.NORTH);\\n\\t\\tgetContentPane().add(new JLabel(), BorderLayout.SOUTH);\\n\\t\\tgetContentPane().add(new JLabel(), BorderLayout.WEST);\\n\\t\\tgetContentPane().add(new JLabel(), BorderLayout.EAST);\\n\\t\\tgetContentPane().setBackground(buttonPanel.getBackground());\\n\\t\\t\\n\\t\\t// ACTIONLISTENER\\n\\t\\tendButton.addActionListener(new ActionListener() {\\n\\t\\t\\t\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic void actionPerformed(ActionEvent e) {\\n\\t\\t\\t\\tdispose();\\n\\t\\t\\t\\tSystem.exit(0);\\n\\t\\t\\t\\tcancelGameandGoBackToHome(e);\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t});\\n\\t\\t\\n\\t\\tanleitungButton.addActionListener(new ActionListener() {\\n\\t\\t\\t\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic void actionPerformed(ActionEvent e) {\\n\\t\\t\\t\\tdispose();\\n\\t\\t\\t\\topenAnleitung(e);\\n\\t\\t\\t}\\n\\t\\t});\\n\\t\\t\\n\\t\\tbackButton.addActionListener(new ActionListener() {\\n\\t\\t\\t\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic void actionPerformed(ActionEvent e) {\\n\\t\\t\\t\\tdispose();\\n\\t\\t\\t\\tbackToGame(e);\\t\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t});\\n\\t}\",\n \"private void buttonInitiation() {\\n submit = new JButton(\\\"Submit\\\");\\n submit.setBounds(105, 250, 90, 25);\\n this.add(submit);\\n goBack = new JButton(\\\"Return to Main Menu\\\");\\n goBack.setBounds(205, 250, 200, 25);\\n this.add(goBack);\\n }\",\n \"private void initialize() {\\r\\n\\r\\n // add default buttons\\r\\n addButton(getToggleButton(),\\\"toggle\\\");\\r\\n addButton(getFinishButton(),\\\"finish\\\");\\r\\n addButton(getCancelButton(),\\\"cancel\\\");\\r\\n addActionListener(new ActionListener() {\\r\\n\\r\\n public void actionPerformed(ActionEvent e) {\\r\\n String cmd = e.getActionCommand();\\r\\n if(\\\"toggle\\\".equalsIgnoreCase(cmd)) change();\\r\\n else if(\\\"finish\\\".equalsIgnoreCase(cmd)) finish();\\r\\n else if(\\\"cancel\\\".equalsIgnoreCase(cmd)) cancel();\\r\\n }\\r\\n\\r\\n });\\r\\n\\r\\n }\",\n \"public Menu_Ingreso() {\\n initComponents();\\n setLocationRelativeTo(null);\\n }\",\n \"public void init(){\\n\\t\\tsetBackground(Color.green);\\n\\t\\tmsg = \\\"Let's Play\\\";\\n//\\t\\tmsg1 = \\\"Your Frinds Choice\\\";\\n\\t\\tSystem.out.println(cpu);\\n\\t\\tb1 = new Button(\\\"Stone\\\");\\n\\t\\tb2 = new Button(\\\"Paper\\\");\\n\\t\\tb3 = new Button(\\\"Seaser\\\");\\n\\t\\tb1.addActionListener(this);\\n\\t\\tb2.addActionListener(this);\\n\\t\\tb3.addActionListener(this);\\n\\t\\tadd(b1);\\n\\t\\tadd(b2);\\n\\t\\tadd(b3);\\n\\t}\",\n \"public void initializeButtons(){\\n\\t\\t\\tplay.setBounds(40,90,280,30);\\n\\t\\t\\tadd(play);\\n\\t\\t\\tplay.addActionListener(new PlayGame());\\n\\t\\t\\tplay.setVisible(true);\\n\\t\\t\\t\\n\\t\\t\\tenterquestion.setBounds(40,140,280,30);\\n\\t\\t\\tadd(enterquestion);\\n\\t\\t\\tenterquestion.addActionListener(new EnterQuestion());\\n\\t\\t\\tenterquestion.setVisible(true);\\n\\t\\t\\t\\n\\t\\t\\tdirections.setBounds(40,190,280,30);\\n\\t\\t\\tadd(directions);\\n\\t\\t\\tdirections.addActionListener(new Instructor());\\n\\t\\t\\tdirections.setVisible(true);\\n\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t}\",\n \"public Primary(){\\r\\n\\t\\tsuper(\\\"Welcome to Louis' Sushi bar!!!!\\\"); \\r\\n\\t\\tsetLayout(new FlowLayout());\\r\\n\\t\\tsetDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);\\r\\n\\t\\tsetSize(500, 200);\\r\\n\\t\\tsetVisible(true);\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n//this is initailizing all the JLabels and buttons and adding an action listener to the buttons, here is here create the buttons for the different menus\\r\\n\\t\\tContinue = new JLabel(\\\"LOUIS' SHUSHI BAR, PRESS which menu you you would like to go to \\\");\\r\\n\\t\\tsushimenu = new JButton(\\\"SUSHI MENU\\\");\\r\\n\\t\\tsushimenu.addActionListener(this);\\r\\n\\t\\tmeatmenu = new JButton(\\\"MEAT MENU\\\");\\r\\n\\t\\tmeatmenu.addActionListener(this);\\r\\n\\t\\tsoupsaladmenu = new JButton(\\\"SOUP MENU\\\");\\r\\n\\t\\tsoupsaladmenu.addActionListener(this);\\r\\n\\t\\tadd (Continue);\\r\\n\\t\\tadd (sushimenu);\\r\\n\\t\\tadd (meatmenu);\\r\\n\\t\\tadd(soupsaladmenu);\\r\\n\\t\\r\\n\\t}\",\n \"public static void initPauseMenu() {\\n pausemenu.setBounds(0, 0, Display.WIDTH, Display.HEIGHT);\\n pausemenu.setOpaque(false);\\n\\n pausemenu_resume_btn.setBounds(250, 210, 300, 50);\\n pausemenu_resume_btn.setFont(main_menu_button_font);\\n pausemenu_resume_btn.setFocusPainted(false);\\n pausemenu_resume_btn.setOpaque(false);\\n pausemenu_resume_btn.setBorderPainted(false);\\n pausemenu_resume_btn.addActionListener(e -> game.resume());\\n\\n pausemenu_settings_btn.setBounds(250, 270, 300, 50);\\n pausemenu_settings_btn.setFont(main_menu_button_font);\\n pausemenu_settings_btn.setFocusPainted(false);\\n pausemenu_settings_btn.setOpaque(false);\\n pausemenu_settings_btn.setBorderPainted(false);\\n pausemenu_settings_btn.addActionListener(e -> {\\n options_menu.remove(options_back_button_tomainmenu);\\n options_menu.add(options_back_button_topausemenu);\\n PanelSlide.slideToLeft(pausemenu, options_menu, -1, -1);\\n });\\n\\n pausemenu_quit_btn.setBounds(250, 330, 300, 50);\\n pausemenu_quit_btn.setFont(main_menu_button_font);\\n pausemenu_quit_btn.setFocusPainted(false);\\n pausemenu_quit_btn.setOpaque(false);\\n pausemenu_quit_btn.setBorderPainted(false);\\n pausemenu_quit_btn.addActionListener(e -> {\\n int pane = JOptionPane.showOptionDialog(null, \\\"Ana menüye dönmek istediğinize emin misiniz?\\\",\\n \\\"Ana Menüye Dön\\\", JOptionPane.DEFAULT_OPTION, JOptionPane.QUESTION_MESSAGE, null, singleplayer_menu_yesno, 1);\\n if (pane == 0) {\\n main_menu.forward();\\n }\\n });\\n\\n pausemenu.add(pausemenu_resume_btn);\\n pausemenu.add(pausemenu_settings_btn);\\n pausemenu.add(pausemenu_quit_btn);\\n }\",\n \"public Menu() {\\n initComponents();\\n }\",\n \"public Menu() {\\n initComponents();\\n }\",\n \"public Menu() {\\n initComponents();\\n }\",\n \"private void initComponents() {\\n\\t\\tbtn_pause =new JButton(\\\"暂停游戏\\\");\\n\\t\\tbtn_continue =new JButton(\\\"继续游戏\\\");\\n\\t\\tbtn_restart =new JButton(\\\"重新开始\\\");\\n\\t\\tbtn_rank =new JButton(\\\"游戏排行\\\");\\n\\t\\tbtn_admin =new JButton(\\\"后台管理\\\");\\n\\t\\t\\n\\t\\t\\n\\t\\t//给按钮设置单击监听\\n\\t\\tbtn_pause.addActionListener(this);\\n\\t\\tbtn_continue.addActionListener(this);\\n\\t\\tbtn_restart.addActionListener(this);\\n\\t\\tbtn_rank.addActionListener(this);\\n\\t\\tbtn_admin.addActionListener(this);\\n\\t}\",\n \"private void prepare()\\r\\n {\\r\\n MenuButton menubutton = new MenuButton();\\r\\n addObject(menubutton, 268, 406);\\r\\n Tittle tittle2 = new Tittle();\\r\\n addObject(tittle2, 544, 422);\\r\\n Exit exit2 = new Exit();\\r\\n addObject(exit2, 863, 427);\\r\\n tittle2.setLocation(545, 401);\\r\\n exit2.setLocation(848, 414);\\r\\n tittle2.setLocation(545, 411);\\r\\n }\",\n \"public Menu_Train() {\\n initComponents();\\n }\",\n \"public OptionPanel(Main w) {\\r\\n\\t\\tthis.w = w;\\r\\n\\t\\tstartButton = new JButton();\\r\\n\\t\\texitButton = new JButton();\\r\\n\\t\\t\\r\\n\\t}\",\n \"public MenuTamu() {\\n initComponents();\\n \\n }\",\n \"private void initBtnsArray()\\r\\n {\\r\\n for (int i = 0; i < this.buttons.length; i++)\\r\\n this.buttons[i] = new Button(\\\"Button #\\\" + i);\\r\\n }\",\n \"private void initCommandButtons(char[] levelLetters) {\\n\\t\\tthis.btnTopFirst = (Button) findViewById(R.id.buttonTopFirst);\\n\\t\\tthis.btnTopSecond = (Button) findViewById(R.id.buttonTopSecond);\\n\\t\\tthis.btnTopThird = (Button) findViewById(R.id.buttonTopThird);\\n\\t\\tthis.btnTopFourth = (Button) findViewById(R.id.buttonTopFourth);\\n\\n\\t\\tthis.btnBotFirst = (Button) findViewById(R.id.buttonBotFirst);\\n\\t\\tthis.btnBotSecond = (Button) findViewById(R.id.buttonBotSecond);\\n\\t\\tthis.btnBotThird = (Button) findViewById(R.id.buttonBotThird);\\n\\t\\tthis.btnBotFourth = (Button) findViewById(R.id.buttonBotFourth);\\n\\t\\tthis.letterButtons = new Button[] { btnBotFirst, btnBotSecond,\\n\\t\\t\\t\\tbtnBotThird, btnBotFourth, btnTopFirst, btnTopSecond,\\n\\t\\t\\t\\tbtnTopThird, btnTopFourth };\\n\\t\\tthis.btnEndWord = (Button) findViewById(R.id.btnEndWord);\\n\\n\\t\\t// End word should be disabled by default\\n\\t\\tthis.btnEndWord.setEnabled(false);\\n\\n\\t\\t// Populate level letters\\n\\t\\tint index = 0;\\n\\t\\tfor (Button btn : this.letterButtons) {\\n\\t\\t\\tbtn.setText(\\\"\\\" + levelLetters[index]);\\n\\t\\t\\tindex++;\\n\\t\\t}\\n\\t}\",\n \"public MainMenu() {\\n super();\\n }\",\n \"public ScreenMainMenu() {\\n\\t\\tsuper(AdapterInputMainMenu.class);\\n\\t\\tobj.add(new MainMenuInteractObjTest<>(gRef,200,200,new Rectangle(0,0,32,32)));\\n\\t\\tChartset.detect(\\\"resources\\\\\\\\Charts\\\");\\n\\t}\",\n \"public MainMenu() {\\n initComponents();\\n }\",\n \"public MainMenu() {\\n initComponents();\\n }\",\n \"public MainMenu() {\\n initComponents();\\n }\",\n \"private void initMenu() {\\n \\n JMenuBar menuBar = new JMenuBar();\\n \\n JMenu commands = new JMenu(\\\"Commands\\\");\\n \\n JMenuItem add = new JMenuItem(\\\"Add\\\");\\n add.addActionListener((ActionEvent e) -> {\\n changeState(\\\"Add\\\");\\n });\\n commands.add(add);\\n \\n JMenuItem search = new JMenuItem(\\\"Search\\\");\\n search.addActionListener((ActionEvent e) -> {\\n changeState(\\\"Search\\\");\\n });\\n commands.add(search);\\n \\n JMenuItem quit = new JMenuItem(\\\"Quit\\\");\\n quit.addActionListener((ActionEvent e) -> {\\n System.out.println(\\\"QUITING\\\");\\n System.exit(0);\\n });\\n commands.add(quit);\\n \\n menuBar.add(commands);\\n \\n setJMenuBar(menuBar);\\n }\",\n \"public PauseMenu() {\\r\\n\\t\\tinitialize();\\r\\n\\t}\",\n \"private void createBeginningButtons() {\\n\\t createStartButtons(myResources.getString(\\\"game1\\\"), 0, 0);\\n\\t\\tcreateStartButtons(myResources.getString(\\\"game2\\\"), 0, 1);\\n\\t\\tcreateStartButtons(myResources.getString(\\\"game3\\\"), 0, 2);\\n\\t\\tcreateStartButtons(myResources.getString(\\\"game4\\\"), 0, 3);\\n\\t\\tcreateStartButtons(myResources.getString(\\\"game5\\\"), 0, 4);\\n\\t\\tcreateInstructionButton();\\n\\t\\tcreateStartingLabel();\\n\\t\\tcreateGridSizeButton();\\n }\",\n \"public menu() {\\n initComponents();\\n this.setLocationRelativeTo(null);\\n }\",\n \"public MenuBangunRuang() {\\n initComponents();\\n }\",\n \"private void init_buttons(){\\r\\n /**\\r\\n * BOTON NUEVO\\r\\n */\\r\\n im_tool1.setOnMouseClicked((MouseEvent mouseEvent) -> {\\r\\n if(mouseEvent.getButton().equals(MouseButton.PRIMARY)){\\r\\n if(mouseEvent.getClickCount() > 0){\\r\\n botonInicio();\\r\\n botonNuevo();\\r\\n }\\r\\n }\\r\\n });\\r\\n /**\\r\\n * BOTON EDITAR\\r\\n */\\r\\n im_tool2.setOnMouseClicked((MouseEvent mouseEvent) -> {\\r\\n if(mouseEvent.getButton().equals(MouseButton.PRIMARY)){\\r\\n if(mouseEvent.getClickCount() > 0){\\r\\n botonEditar();\\r\\n }\\r\\n }\\r\\n });\\r\\n /**\\r\\n * BOTON GUARDAR\\r\\n */\\r\\n im_tool3.setOnMouseClicked((MouseEvent mouseEvent) -> {\\r\\n if(mouseEvent.getButton().equals(MouseButton.PRIMARY)){\\r\\n if(mouseEvent.getClickCount() > 0){\\r\\n botonGuardar();\\r\\n }\\r\\n }\\r\\n }); \\r\\n /**\\r\\n * BOTON ELIMINAR\\r\\n */\\r\\n im_tool4.setOnMouseClicked((MouseEvent mouseEvent) -> {\\r\\n if(mouseEvent.getButton().equals(MouseButton.PRIMARY)){\\r\\n if(mouseEvent.getClickCount() > 0){\\r\\n botonEliminar();\\r\\n }\\r\\n }\\r\\n });\\r\\n /**\\r\\n * BOTON IMPRIMIR\\r\\n */\\r\\n im_tool5.setOnMouseClicked((MouseEvent mouseEvent) -> {\\r\\n if(mouseEvent.getButton().equals(MouseButton.PRIMARY)){\\r\\n if(mouseEvent.getClickCount() > 0){ \\r\\n botonImprimir();\\r\\n }\\r\\n }\\r\\n });\\r\\n /**\\r\\n * BOTON REGRESAR\\r\\n */\\r\\n im_tool6.setOnMouseClicked((MouseEvent mouseEvent) -> {\\r\\n if(mouseEvent.getButton().equals(MouseButton.PRIMARY)){\\r\\n if(mouseEvent.getClickCount() > 0){\\r\\n botonInicio();\\r\\n }\\r\\n }\\r\\n });\\r\\n /**\\r\\n * BOTON POR ASIGNAR\\r\\n */\\r\\n im_tool7.setOnMouseClicked((MouseEvent mouseEvent) -> {\\r\\n if(mouseEvent.getButton().equals(MouseButton.PRIMARY)){\\r\\n if(mouseEvent.getClickCount() > 0){\\r\\n //\\r\\n }\\r\\n }\\r\\n });\\r\\n /**\\r\\n * BOTON NOTAS DE CREDITO\\r\\n */\\r\\n im_tool8.setOnMouseClicked((MouseEvent mouseEvent) -> {\\r\\n if(mouseEvent.getButton().equals(MouseButton.PRIMARY)){\\r\\n if(mouseEvent.getClickCount() > 0){\\r\\n //\\r\\n }\\r\\n }\\r\\n });\\r\\n /**\\r\\n * BOTON DEVOLUCION\\r\\n */\\r\\n im_tool9.setOnMouseClicked((MouseEvent mouseEvent) -> {\\r\\n if(mouseEvent.getButton().equals(MouseButton.PRIMARY)){\\r\\n if(mouseEvent.getClickCount() > 0){\\r\\n //\\r\\n }\\r\\n }\\r\\n });\\r\\n /**\\r\\n * BOTON BUSCAR\\r\\n */\\r\\n im_tool12.setOnMouseClicked((MouseEvent mouseEvent) -> {\\r\\n if(mouseEvent.getButton().equals(MouseButton.PRIMARY)){\\r\\n switch (mouseEvent.getClickCount()){\\r\\n case 1:\\r\\n botonInicio();\\r\\n botonBuscar();\\r\\n break;\\r\\n case 2:\\r\\n Datos.setIdButton(2003041);\\r\\n Gui.getInstance().showBusqueda(\\\"Busqueda\\\"); \\r\\n break;\\r\\n }\\r\\n }\\r\\n });\\r\\n /**\\r\\n * SELECCION EN LA TABLA\\r\\n */\\r\\n tb_guias.setOnMouseClicked((MouseEvent mouseEvent) -> {\\r\\n if(mouseEvent.getButton().equals(MouseButton.PRIMARY)){\\r\\n if(mouseEvent.getClickCount() > 0){\\r\\n if ((tb_guias.getItems() != null) && (!tb_guias.getItems().isEmpty()))\\r\\n selectedRowGuide();\\r\\n }\\r\\n }\\r\\n }); \\r\\n /**\\r\\n * metodo para mostrar buscar el nro de guia\\r\\n * param: ENTER O TAB\\r\\n */\\r\\n tf_nroguia.setOnKeyReleased((KeyEvent ke) -> {\\r\\n if (ke.getCode().equals(KeyCode.ENTER)){\\r\\n //Valida que el evento se haya generado en el campo de busqueda\\r\\n if(((Node)ke.getSource()).getId().equals(\\\"tf_nroguia\\\")){\\r\\n //Solicita los datos y envia la Respuesta a imprimirse en la Pantalla\\r\\n Datos.setLog_cguias(new log_CGuias()); \\r\\n boolean boo = Ln.getInstance().check_log_CGuias_rela_caja(tf_nroguia.getText()); \\r\\n numGuias = 0;\\r\\n if(boo){\\r\\n Datos.setRep_log_cguias(Ln.getInstance().find_log_CGuias(tf_nroguia.getText(), \\\"\\\", \\\"ncaja\\\", Integer.parseInt(rows)));\\r\\n loadTable(Datos.getRep_log_cguias()); \\r\\n }\\r\\n else{\\r\\n change_im_val(0, im_checkg); \\r\\n Gui.getInstance().showMessage(\\\"El Nro. de \\\" + ScreenName + \\\" NO existe!\\\", \\\"A\\\");\\r\\n tf_nroguia.requestFocus();\\r\\n }\\r\\n }\\r\\n }\\r\\n });\\r\\n /**\\r\\n * metodo para mostrar buscar el nro de guia\\r\\n * param: ENTER O TAB\\r\\n */\\r\\n tf_nrorguia.setOnKeyReleased((KeyEvent ke) -> {\\r\\n if (ke.getCode().equals(KeyCode.ENTER)){\\r\\n //Valida que el evento se haya generado en el campo de busqueda\\r\\n if(((Node)ke.getSource()).getId().equals(\\\"tf_nrorguia\\\")){\\r\\n //Solicita los datos y envia la Respuesta a imprimirse en la Pantalla\\r\\n boolean booa = true; \\r\\n if(booa){\\r\\n boolean booc = Ln.getInstance().check_log_CGuias_caja(tf_nrorguia.getText()); \\r\\n if(booc){\\r\\n change_im_val(0, im_checkg); \\r\\n Gui.getInstance().showMessage(\\\"El Nro. de Guia ya esta relacionado!\\\", \\\"A\\\");\\r\\n tf_nrorguia.requestFocus();\\r\\n }\\r\\n else{\\r\\n for (int i = 0; i < log_guide_guia.size(); i++) {\\r\\n if(tf_nrorguia.getText().equals(tb_guias.getItems().get(i).getGuias())){\\r\\n booa = false;\\r\\n Gui.getInstance().showMessage(\\\"El Nro. de Guia ya esta relacionado!\\\", \\\"A\\\");\\r\\n tf_nrorguia.requestFocus();\\r\\n break;\\r\\n }\\r\\n } \\r\\n if(booa){\\r\\n log_Guide_rel_inv guide_carga = new log_Guide_rel_inv();\\r\\n\\r\\n List<Fxp_Archguid_gfc> data = \\r\\n Ln.getList_log_Archguid_gfc(Ln.getInstance().find_Archguid_gfc(tf_nrorguia.getText()));\\r\\n\\r\\n if (data.get(0).getStat_guia().equals(\\\"X\\\")\\r\\n || data.get(0).getStat_guia().equals(\\\"C\\\")){\\r\\n guide_carga.setNumorden(String.valueOf((log_guide_guia.size() + 1)));\\r\\n guide_carga.setGuias(tf_nrorguia.getText());\\r\\n guide_carga.setNumfact(data.get(0).getNumfact());\\r\\n guide_carga.setNumclie(data.get(0).getNumclie());\\r\\n\\r\\n if (data.get(0).getStat_guia().equals(\\\"A\\\")){\\r\\n if (tipoOperacion == 1)\\r\\n guide_carga.setStat_guia(null);\\r\\n else\\r\\n guide_carga.setStat_guia(data.get(0).getStat_guia());\\r\\n }\\r\\n else{\\r\\n guide_carga.setStat_guia(null);\\r\\n }\\r\\n \\r\\n \\r\\n log_guide_guia.add(guide_carga);\\r\\n\\r\\n loadTableGuide_guias();\\r\\n change_im_val(200, im_checkg); \\r\\n\\r\\n numFactCarga = numFactCarga + data.get(0).getNumfact();\\r\\n numClieCarga = numClieCarga + data.get(0).getNumclie();\\r\\n\\r\\n tf_nrorguia.setText(\\\"\\\");\\r\\n }else{\\r\\n if (data.get(0).getStat_guia().equals(\\\"\\\")){\\r\\n Gui.getInstance().showMessage(\\\"El Nro. de Guia NO tiene relación de Guia de Carga!\\\", \\\"A\\\");\\r\\n }\\r\\n else{\\r\\n Gui.getInstance().showMessage(\\\"El Nro. de Guia ya esta relacionado!\\\", \\\"A\\\");\\r\\n }\\r\\n tf_nrorguia.requestFocus();\\r\\n }\\r\\n \\r\\n }\\r\\n }\\r\\n }\\r\\n else{\\r\\n change_im_val(0, im_checkg); \\r\\n Gui.getInstance().showMessage(\\\"El Nro. de Guia NO existe!\\\", \\\"A\\\");\\r\\n tf_nrorguia.requestFocus();\\r\\n }\\r\\n }\\r\\n }\\r\\n });\\r\\n }\",\n \"public DropMainMenu() {\\n initComponents();\\n }\",\n \"private void buttonInit() {\\n panel.add(createButton);\\n panel.add(editButton);\\n panel.add(changeButton);\\n createButton.addActionListener(this);\\n editButton.addActionListener(this);\\n changeButton.addActionListener(this);\\n submitNewUser.addActionListener(this);\\n editAccTypeBtn.addActionListener(this);\\n changePassBtn.addActionListener(this);\\n }\",\n \"public Component startButton() {\\n startButton = new JButton(\\\"Start\\\");\\n setFocusable(false);\\n return startButton;\\n }\",\n \"public StartupOptions() {\\n initComponents();\\n done.addActionListener(Seasonality.bi);\\n\\n }\",\n \"public ButtonMenuPanelBuyer() {\\n initComponents();\\n }\",\n \"private void initToolbar() {\\n\\t\\tButton nextStep = new Button(\\\"Next Step\\\");\\n\\t\\tnextStep.setOnMouseClicked(new EventHandler<Event>() {\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic void handle(Event event) {\\n\\t\\t\\t\\tcontrol.performOneStep();\\n\\t\\t\\t}\\n\\t\\t});\\n\\t\\tthis.getItems().add(nextStep);\\n\\n\\t\\t// Make and set Start Button\\n\\t\\tButton startButton = new Button(\\\"Start Game\\\");\\n\\t\\tstartButton.setOnMouseClicked(new EventHandler<Event>() {\\n\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic void handle(Event event) {\\n\\t\\t\\t\\tcontrol.startGame();\\n\\t\\t\\t}\\n\\t\\t});\\n\\t\\tthis.getItems().add(startButton);\\n\\n\\t\\t// Make and set Pause Button\\n\\t\\tButton pauseButton = new Button(\\\"Pause Game\\\");\\n\\t\\tpauseButton.setOnMouseClicked(new EventHandler<Event>() {\\n\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic void handle(Event event) {\\n\\t\\t\\t\\tcontrol.pauseGame();\\n\\t\\t\\t}\\n\\t\\t});\\n\\t\\tthis.getItems().add(pauseButton);\\n\\n\\t\\t//Text Field for GameSpeed\\n\\t\\tText gameSpeedText = new Text(\\\"Delay between steps: \\\" + initialSpeed +\\\"ms\\\");\\n\\t\\tthis.getItems().add(gameSpeedText);\\n\\t\\t\\n\\t\\t//Make and add Slider for GameSpeed control\\n\\t\\tSlider gameSpeedSlider = new Slider(10, 250, initialSpeed);\\n\\t\\tcontrol.setGameSpeed(initialSpeed);\\n\\t\\t\\n\\t\\tgameSpeedSlider.valueProperty().addListener(\\n\\t\\t (observable, oldvalue, newvalue) ->\\n\\t\\t {\\n\\t\\t int i = newvalue.intValue();\\n\\t\\t //This sets the delay in the controller\\n\\t\\t control.setGameSpeed(i);\\n\\t\\t //Text Label that displays delay\\n\\t\\t gameSpeedText.setText(\\\"Delay between steps: \\\" + i +\\\"ms\\\");\\n\\t\\t } );\\n\\t\\t\\n\\t\\tthis.getItems().add(gameSpeedSlider);\\n\\t\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"private void initAction() {\\n\\t\\timg_back.setOnClickListener(this);\\n\\t\\tbtn_delete.setOnClickListener(this);\\n\\t\\tbtn_update.setOnClickListener(this);\\n\\t}\",\n \"public void initGui()\\n {\\n StringTranslate var2 = StringTranslate.getInstance();\\n int var4 = this.height / 4 + 48;\\n\\n this.controlList.add(new GuiButton(1, this.width / 2 - 100, var4 + 24 * 1, \\\"Offline Mode\\\"));\\n this.controlList.add(new GuiButton(2, this.width / 2 - 100, var4, \\\"Online Mode\\\"));\\n\\n this.controlList.add(new GuiButton(3, this.width / 2 - 100, var4 + 48, var2.translateKey(\\\"menu.mods\\\")));\\n\\t\\tthis.controlList.add(new GuiButton(0, this.width / 2 - 100, var4 + 72 + 12, 98, 20, var2.translateKey(\\\"menu.options\\\")));\\n\\t\\tthis.controlList.add(new GuiButton(4, this.width / 2 + 2, var4 + 72 + 12, 98, 20, var2.translateKey(\\\"menu.quit\\\")));\\n this.controlList.add(new GuiButtonLanguage(5, this.width / 2 - 124, var4 + 72 + 12));\\n }\",\n \"public void initGui()\\n {\\n this.buttonList.clear();\\n this.multilineMessage = this.fontRendererObj.listFormattedStringToWidth(this.message.getFormattedText(), this.width - 50);\\n this.field_175353_i = this.multilineMessage.size() * this.fontRendererObj.FONT_HEIGHT;\\n this.buttonList.add(new GuiButton(0, this.width / 2 - 100, this.height / 2 + this.field_175353_i / 2 + this.fontRendererObj.FONT_HEIGHT, I18n.format(\\\"gui.toMenu\\\", new Object[0])));\\n if(!TabGUI.openTabGUI) return;\\n this.buttonList.add(new GuiButton(1, this.width / 2 - 100, this.height / 2 + 20 + this.field_175353_i / 2 + this.fontRendererObj.FONT_HEIGHT, 100, 20, \\\"Reconnect\\\"));\\n this.buttonList.add(new GuiButton(2, this.width / 2, this.height / 2 + 20 + this.field_175353_i / 2 + this.fontRendererObj.FONT_HEIGHT, 100, 20, \\\"Random Alt\\\"));\\n }\",\n \"public void init() {\\n\\t\\tMenu menu = new Menu();\\n\\t\\tmenu.register();\\n\\n\\t\\t// Application.getInstance().getGUILog().showMessage(\\\"Show a popup the proper\\n\\t\\t// way !\\\");\\n\\n\\t\\t// final ActionsConfiguratorsManager manager =\\n\\t\\t// ActionsConfiguratorsManager.getInstance();\\n\\n\\t\\t// final MDAction action = new ExampleAction();\\n\\t\\t// Adding action to main menu\\n\\t\\t// manager.addMainMenuConfigurator(new MainMenuConfigurator(action));\\n\\t\\t// Adding action to main toolbar\\n\\t\\t// manager.addMainToolbarConfigurator(new MainToolbarConfigurator(action));\\n\\n\\t\\t// pluginDir = getDescriptor().getPluginDirectory().getPath();\\n\\n\\t\\t// Creating submenu in the MagicDraw main menu\\n\\t\\t// ActionsConfiguratorsManager manager =\\n\\t\\t// ActionsConfiguratorsManager.getInstance();\\n\\t\\t// manager.addMainMenuConfigurator(new\\n\\t\\t// MainMenuConfigurator(getSubmenuActions()));\\n\\n\\t\\t/**\\n\\t\\t * @Todo: load project options (@see myplugin.generator.options.ProjectOptions)\\n\\t\\t * from ProjectOptions.xml and take ejb generator options\\n\\t\\t */\\n\\n\\t\\t// for test purpose only:\\n\\t\\t// GeneratorOptions ejbOptions = new GeneratorOptions(\\\"c:/temp\\\", \\\"ejbclass\\\",\\n\\t\\t// \\\"templates\\\", \\\"{0}.java\\\", true, \\\"ejb\\\");\\n\\t\\t// ProjectOptions.getProjectOptions().getGeneratorOptions().put(\\\"EJBGenerator\\\",\\n\\t\\t// ejbOptions);\\n\\n\\t\\t// ejbOptions.setTemplateDir(pluginDir + File.separator +\\n\\t\\t// ejbOptions.getTemplateDir()); //apsolutna putanja\\n\\t}\",\n \"private void buttonInit(){\\n for(int i=0; i < 3; i++){\\n choice[i] = new JButton();\\n\\n }\\n choice[0].setText(\\\"10x10 / 8 bombs\\\");\\n choice[0].setBackground(new Color(86, 160, 189));\\n\\n\\n choice[0].addActionListener(l-> makeGamePanel(10, 8));\\n\\n choice[1].setText(\\\"15x15 / 30 bombs\\\");\\n choice[1].setBackground(new Color(238, 160, 160));\\n\\n\\n choice[1].addActionListener(l-> makeGamePanel(15,30));\\n\\n choice[2].setText(\\\"24x24 / 70 bombs\\\");\\n choice[2].setBackground(new Color(253, 230, 122));\\n choice[2].setFont(new Font(Font.MONOSPACED, Font.BOLD, 30));\\n choice[2].setForeground(new Color(45, 68, 73));\\n\\n choice[2].addActionListener(l-> makeGamePanel(24,70));\\n\\n this.add(choice[0], BorderLayout.LINE_START); this.add(choice[1], BorderLayout.LINE_END); this.add(choice[2], BorderLayout.CENTER);\\n }\",\n \"public vistaMenu() {\\n initComponents();\\n this.setLocationRelativeTo(null);\\n }\",\n \"public MenuKullanimi()\\n {\\n initComponents();\\n setLocationRelativeTo(null);\\n }\",\n \"public Tela_Menu2() {\\n initComponents();\\n }\",\n \"public Menus() {\\n initComponents();\\n }\",\n \"private ButtonPane()\\r\\n\\t\\t\\t{ super(new String[]{\\\"OK\\\",\\\"Cancel\\\"},1,2); }\",\n \"@FXML\\n private void initialize(){\\n\\n //set default button\\n chooseDirectoryButton.setDefaultButton(true);\\n\\n //Disable both button on start up\\n startWatcherButton.setDisable(true);\\n stopWatcherButton.setDisable(true);\\n }\",\n \"public UIMenu() {\\n initComponents();\\n setLocationRelativeTo(null);\\n background.requestFocusInWindow();\\n createButtonMode.setVisible(false);\\n loginButtonMode.setVisible(false);\\n repassword.setVisible(false);\\n inputRePass.setVisible(false);\\n }\",\n \"@Override\\n\\tpublic void initGui()\\n {\\n this.controlList.clear();\\n //Keyboard.enableRepeatEvents(true);\\n\\n int var1 = (this.width - this.bookImageWidth) / 2;\\n int var2 = (this.height - this.bookImageHeight - 40) / 2;\\n this.controlList.add(this.buttonNextPage = new GuiButtonNextPage(1, var1 + 120, var2 + 154, true));\\n this.controlList.add(this.buttonPreviousPage = new GuiButtonNextPage(2, var1 + 38, var2 + 154, false));\\n this.controlList.add(this.buttonIndex = new GuiButtonNextPage(8, var1 + 28, var2 + 10, false));\\n this.controlList.add(this.buttonMenu1 = new GuiButtonSelect(3, var1 + 35, var2 + 30, 110, 20, \\\"\\\"));\\n this.controlList.add(this.buttonMenu2 = new GuiButtonSelect(4, var1 + 35, var2 + 55, 110, 20, \\\"\\\"));\\n this.controlList.add(this.buttonMenu3 = new GuiButtonSelect(5, var1 + 35, var2 + 80, 110, 20, \\\"\\\"));\\n this.controlList.add(this.buttonMenu4 = new GuiButtonSelect(6, var1 + 35, var2 + 105, 110, 20, \\\"\\\"));\\n this.controlList.add(this.buttonMenu5 = new GuiButtonSelect(7, var1 + 35, var2 + 130, 110, 20, \\\"\\\"));\\n this.controlList.add(this.bookmark = new GuiButtonBookmark(9, var1 + 142, var2 + 7, false));\\n this.updateButtons();\\n }\",\n \"public void setStartButton(JButton startButton) {\\n\\t\\tthis.startButton = startButton;\\n\\t}\",\n \"public void initialize() {\\n\\t\\tbombLabel.setText(\\\"Flag: \\\" + game.getFlagCounter() + \\\"/\\\" + game.getNumOfBombs());\\n\\t\\ttimerLabel.setText(\\\"Time: \\\" + 0);\\n\\t\\tboard.getStyleClass().add(\\\"grid\\\");\\n\\t\\tbtnArray = new Button[game.getHeight()][game.getWidth()];\\n\\t\\tfor (int x = 0; x < game.getHeight(); x++) {\\n\\t\\t\\tfor (int y = 0; y < game.getWidth(); y++) {\\n\\t\\t\\t\\tButton btn = new Button(\\\"\\\");\\n\\t\\t\\t\\tbtnArray[x][y] = btn;\\n\\t\\t\\t\\tbtn.setMaxSize(50, 50);\\n\\t\\t\\t\\tbtn.setMinSize(50, 50);\\n\\t\\t\\t\\t//Add Button to the board (GridPane)\\n\\t\\t\\t\\tboard.add(btn, x, y);\\n\\t\\t\\t\\tbtn.setId(x + \\\" . \\\" + y);\\n\\t\\t\\t\\tbtn.setOnMouseClicked(e -> TileClicked(e));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"@Override\\n\\tprotected void InitButtonListener() {\\n\\t\\tLayoutTop.setOnClickListener(new View.OnClickListener() {\\n\\t\\t\\t\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic void onClick(View v) {\\n\\t\\t\\t\\t// TODO Auto-generated method stub\\n\\t\\t\\t\\tClickOption();\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t});\\n\\t}\",\n \"public void InitializeMenu(){\\n\\t\\tmnbBar = new JMenuBar();\\n\\t\\tmnuFile = new JMenu(\\\"File\\\");\\n\\t\\tmnuFormat = new JMenu(\\\"Format\\\");\\n\\t\\tmniOpen = new JMenuItem(\\\"Open\\\");\\n\\t\\tmniExit = new JMenuItem(\\\"Exit\\\");\\n\\t\\tmniSave = new JMenuItem(\\\"Save\\\");\\n\\t\\tmniSaveAs = new JMenuItem(\\\"Save as\\\");\\n\\t\\tmniSaveAs.setMnemonic(KeyEvent.VK_A);\\n\\t\\tmniSave.setMnemonic(KeyEvent.VK_S);\\n\\t\\tmniChangeBgColor = new JMenuItem(\\\"Change Backgroud Color\\\");\\n\\t\\tmniChangeFontColor = new JMenuItem(\\\"Change Font Color\\\");\\n\\t\\t//them menu item vao menu file\\n\\t\\tmnuFile.add(mniOpen);\\n\\t\\tmnuFile.addSeparator();\\n\\t\\tmnuFile.add(mniExit);\\n\\t\\tmnuFile.add(mniSaveAs);\\n\\t\\tmnuFile.add(mniSave);\\n\\t\\t//them menu item vao menu format\\n\\t\\tmnuFormat.add(mniChangeBgColor);\\n\\t\\tmnuFormat.addSeparator();\\n\\t\\tmnuFormat.add(mniChangeFontColor);\\n\\t\\t//them menu file va menu format vao menu bar\\n\\t\\tmnbBar.add(mnuFile);\\n\\t\\tmnbBar.add(mnuFormat);\\n\\t\\t//thiet lap menubar thanh menu chinh cua frame\\n\\t\\tsetJMenuBar(mnbBar);\\n\\t}\",\n \"public void setMenu() {\\n\\t \\n\\t\\ttop = new JPanel(new FlowLayout(FlowLayout.LEFT));\\n\\t add(top, BorderLayout.CENTER);\\n\\t \\n\\t lPro = new JLabel(\\\"Projects: \\\");\\n\\t top.add(lPro);\\n\\t \\n\\t cPro = new JComboBox();\\n\\t getProject();\\n\\t\\ttop.add(cPro);\\n\\t\\t\\n\\t\\tview = new JButton(\\\"View Sample\\\");\\n\\t\\ttop.add(view);\\n\\t\\t\\n\\t\\tbottom = new JPanel(new FlowLayout(FlowLayout.CENTER));\\n\\t\\tadd(bottom, BorderLayout.SOUTH);\\n\\t\\t\\n\\t\\tcancel = new JButton(\\\"Cancel\\\");\\n\\t\\tbottom.add(cancel);\\n\\t\\t\\n\\t\\tdownload = new JButton(\\\"Download\\\");\\n\\t\\tbottom.add(download);\\n\\t\\t\\n\\t\\tsetActionListener();\\t\\n\\t}\",\n \"public menuAddStasiun() {\\n initComponents();\\n }\",\n \"public void initPlayerMenu() {\\n Font f = new Font(\\\"Helvetica\\\", Font.BOLD, 16);\\n\\n menuPanel = new JPanel();\\n menuPanel.setPreferredSize(new Dimension(buttonWidth, buttonHeight));\\n menuPanel.setLayout(null);\\n\\n menuBar = new JMenuBar();\\n menuBar.setPreferredSize(new Dimension(buttonWidth, buttonHeight));\\n menuBar.setBounds(0, 0, buttonWidth, buttonHeight);\\n menuBar.setLayout(null);\\n\\n playerMenu = new JMenu();\\n playerMenu.setText(\\\"Players\\\");\\n playerMenu.setFont(f);\\n playerMenu.setBounds(0, 0, buttonWidth, buttonHeight);\\n playerMenu.setBackground(new Color(0xeaf1f7));\\n playerMenu.setHorizontalTextPosition(SwingConstants.CENTER);\\n playerMenu.setOpaque(true);\\n playerMenu.setBorder(BorderFactory.createBevelBorder(0));\\n\\n menuBar.add(playerMenu);\\n menuPanel.add(menuBar);\\n }\",\n \"public MenuPrincipal() {\\n\\t\\tinitComponents();\\n\\t\\tbtnSplines.setVisible(false);\\n\\t\\tbtnEcuacionesNolineales.addActionListener(new ActionListener() {\\n\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic void actionPerformed(ActionEvent e) {\\n\\t\\t\\t\\tGestorInterfazPrincipal.iniciarUnidad1();\\n\\t\\t\\t}\\n\\t\\t});\\n\\t\\tbtnSistemasdeEcuaciones.addActionListener(new ActionListener() {\\n\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic void actionPerformed(ActionEvent arg0) {\\n\\t\\t\\t\\tGestorInterfazPrincipal.iniciarSistemasEcuaciones();\\n\\t\\t\\t}\\n\\t\\t});\\n\\t\\tbtnGraficador.addActionListener(new ActionListener() {\\n\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic void actionPerformed(ActionEvent arg0) {\\n\\t\\t\\t\\tGestorInterfazPrincipal.iniciarGraficador();\\n\\t\\t\\t}\\n\\t\\t});\\n\\t\\tbtnInterpolacion.addActionListener(new ActionListener() {\\n\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic void actionPerformed(ActionEvent arg0) {\\n\\t\\t\\t\\tGestorInterfazPrincipal.iniciarInterpolacion();\\n\\t\\t\\t}\\n\\t\\t});\\n\\t\\tbtnDiferenciacion.addActionListener(new ActionListener() {\\n\\t\\t\\t\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic void actionPerformed(ActionEvent arg0) {\\n\\t\\t\\t\\tGestorInterfazPrincipal.iniciarDiferenciacion();\\n\\t\\t\\t}\\n\\t\\t});\\n\\t\\tbtnIntegracion.addActionListener(new ActionListener() {\\n\\t\\t\\t\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic void actionPerformed(ActionEvent arg0) {\\n\\t\\t\\t\\tGestorInterfazPrincipal.iniciarIntegracion();\\n\\t\\t\\t}\\n\\t\\t});\\n\\n\\t}\",\n \"private void initNodeListe() {\\n\\t\\t\\n\\t\\tbtnAddTransaction = new JFXButton();\\n\\t\\tbtnAddTransaction.setButtonType(JFXButton.ButtonType.RAISED);\\n\\t\\tbtnAddTransaction.getStyleClass()\\n\\t\\t\\t\\t.addAll(\\\"RoundButton\\\", \\\"NeutralButton\\\");\\n\\t\\tbtnOutgo = new JFXButton(\\\"D\\\");\\n\\t\\tbtnOutgo.setButtonType(JFXButton.ButtonType.RAISED);\\n\\t\\tbtnOutgo.getStyleClass().addAll(\\\"RoundButton\\\", \\\"RedButton\\\");\\n\\t\\tbtnIncome = new JFXButton(\\\"R\\\");\\n\\t\\tbtnIncome.setButtonType(JFXButton.ButtonType.RAISED);\\n\\t\\tbtnIncome.getStyleClass().addAll(\\\"RoundButton\\\", \\\"GreenButton\\\");\\n\\t\\t\\n\\t\\tnodeAjout.addAnimatedNode(btnAddTransaction);\\n\\t\\tnodeAjout.addAnimatedNode(btnOutgo);\\n\\t\\tnodeAjout.addAnimatedNode(btnIncome);\\n\\t\\tnodeAjout.setSpacing(5d);\\n\\t\\tnodeAjout.setRotate(180);\\n\\t\\t\\n\\t\\tImageView image = new ImageView(new Image(\\n\\t\\t\\t\\tgetClass().getResourceAsStream(\\\"/gui/Image/add.png\\\")));\\n\\t\\timage.setFitWidth(20);\\n\\t\\timage.setFitHeight(20);\\n\\t\\tbtnAddTransaction.setGraphic(image);\\n\\t\\t\\n\\t}\",\n \"public PlayerScheduleMenu() {\\n initComponents();\\n }\",\n \"public MenuButtons(String nameOfButton) {\\n Text text = new Text(nameOfButton);\\n text.setFont(Font.font(null, FontWeight.BOLD, 18));\\n text.setFill(Color.WHITESMOKE);\\n\\n //A rectangle that will be a part of the button\\n Rectangle rectangle = new Rectangle(250,30);\\n rectangle.setOpacity(0.3);\\n rectangle.setFill(Color.BLUE);\\n\\n setAlignment(Pos.CENTER_LEFT);\\n getChildren().addAll(rectangle, text);\\n\\n setOnMouseEntered(e -> {\\n rectangle.setTranslateX(5);\\n text.setTranslateX(5);\\n rectangle.setFill(Color.DARKBLUE);\\n });\\n\\n setOnMouseExited(e -> {\\n rectangle.setTranslateX(0);\\n text.setTranslateX(0);\\n rectangle.setFill(Color.BLUE);\\n });\\n\\n DropShadow shadowEffect = new DropShadow();\\n shadowEffect.setInput(new Glow());\\n\\n setOnMousePressed(e -> setEffect(shadowEffect));\\n setOnMouseReleased(e -> setEffect(null));\\n }\",\n \"private void init() {\\n setBackground(LIGHT_GRAY);\\n Box layout = new Box(BoxLayout.Y_AXIS);\\n\\n jump = createButton(\\\"Jump\\\", null);\\n exit = createButton(\\\"Exit!\\\", null);\\n fly = createButton(\\\"Fly\\\", null);\\n Jfloat = createButton(\\\"Float\\\", null);\\n layout.add(Box.createRigidArea(new Dimension(0, 150)));\\n layout.add(jump);\\n layout.add(Box.createRigidArea(new Dimension(0, 25)));\\n layout.add(Jfloat);\\n layout.add(Box.createRigidArea(new Dimension(0, 25)));\\n layout.add(fly);\\n layout.add(Box.createRigidArea(new Dimension(0, 25)));\\n layout.add(exit);\\n add(layout);\\n }\",\n \"public StartScreen() {\\n initComponents();\\n }\",\n \"public Menu2() {\\n initComponents();\\n }\",\n \"public LinkButton() {\\n\\t\\tsuper();\\n\\t\\tinit();\\n\\t}\",\n \"private void initMenu()\\n {\\n bar = new JMenuBar();\\n fileMenu = new JMenu(\\\"File\\\");\\n crawlerMenu = new JMenu(\\\"Crawler\\\"); \\n aboutMenu = new JMenu(\\\"About\\\");\\n \\n bar.add(fileMenu);\\n bar.add(crawlerMenu);\\n bar.add(aboutMenu);\\n \\n exit = new JMenuItem(\\\"Exit\\\");\\n preferences = new JMenuItem(\\\"Preferences\\\");\\n author = new JMenuItem(\\\"Author\\\");\\n startCrawlerItem = new JMenuItem(\\\"Start\\\");\\n stopCrawlerItem = new JMenuItem(\\\"Stop\\\");\\n newIndexItem = new JMenuItem(\\\"New index\\\");\\n openIndexItem = new JMenuItem(\\\"Open index\\\");\\n \\n stopCrawlerItem.setEnabled(false);\\n \\n fileMenu.add(newIndexItem);\\n fileMenu.add(openIndexItem);\\n fileMenu.add(exit);\\n aboutMenu.add(author);\\n crawlerMenu.add(startCrawlerItem);\\n crawlerMenu.add(stopCrawlerItem);\\n crawlerMenu.add(preferences);\\n \\n author.addActionListener(this);\\n preferences.addActionListener(this);\\n exit.addActionListener(this);\\n startCrawlerItem.addActionListener(this);\\n stopCrawlerItem.addActionListener(this);\\n newIndexItem.addActionListener(this);\\n openIndexItem.addActionListener(this);\\n \\n frame.setJMenuBar(bar);\\n }\",\n \"private void startButtonAction(){\\n scoreboard.setStartAction(event->initControl());\\n }\",\n \"private void initUI() {\\n tvQuote = (TextView) findViewById(R.id.tvQuote);\\n tvBeginButton = (TextView) findViewById(R.id.tvBeginButton);\\n\\n tvBeginButton.setOnClickListener(this);\\n\\n loadBackground();\\n }\",\n \"private void initEvent() {\\n\\t\\tmBtnPower.setOnClickListener(this);\\n\\t\\tmBtnProfile.setOnClickListener(this);\\n\\t\\tmBtnArea.setOnClickListener(this);\\n\\t\\tmBtnSkipTime.setOnClickListener(this);\\n\\t\\tmBtnFrequencyPoint.setOnClickListener(this);\\n\\t\\tmBtnAlgorithm.setOnClickListener(this);\\n\\t}\",\n \"public OptionsMenu() {\\n initComponents();\\n }\",\n \"@Override\\r\\n\\tpublic void initGui() {\\r\\n\\t final int buttonSize = SIZE_X - 10;\\r\\n\\r\\n\\t _curScrollValue = 0;\\r\\n\\t buttonList.clear();\\r\\n\\t _selectedList.clear();\\r\\n\\r\\n\\t _deleteButton = new GuiButton(0, (width - buttonSize) / 2, (height + SIZE_Y) / 2 + 12, buttonSize, 20, \\\"Delete Selected Waypoints\\\");\\r\\n\\t \\r\\n\\t // load the saved waypoint data to initialize this gui\\r\\n\\t UltraTeleportWaypoint.load();\\r\\n\\t}\",\n \"public frameMenu() {\\n initComponents();\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7706423","0.748784","0.73391783","0.72927845","0.7196089","0.71318763","0.7069379","0.7053129","0.7037119","0.6958277","0.6920505","0.6889352","0.6835056","0.68298167","0.6813985","0.67969644","0.6793507","0.6788672","0.67333007","0.67274106","0.67176706","0.6713738","0.6701132","0.6695852","0.6682144","0.667927","0.66726136","0.66670895","0.66670895","0.6665597","0.6657112","0.6646992","0.66355354","0.6633335","0.66133803","0.659002","0.6586526","0.656341","0.6555393","0.6555393","0.6555393","0.6546907","0.6543888","0.6537658","0.6523497","0.65134543","0.64979875","0.6493138","0.64913565","0.64820653","0.64762646","0.64762646","0.64762646","0.64761525","0.6472286","0.6470756","0.645518","0.64547217","0.64513683","0.64496905","0.64469","0.6430535","0.64284354","0.6425725","0.64205694","0.64178747","0.6415213","0.6413855","0.6409131","0.6385608","0.6380498","0.63793623","0.63754934","0.63571143","0.63556886","0.6345384","0.6334663","0.633172","0.63268906","0.63255465","0.63237494","0.6321298","0.63186747","0.63118154","0.6309753","0.62840515","0.6276774","0.6271568","0.6266508","0.6264212","0.6257976","0.62544894","0.6250585","0.6249131","0.62487507","0.6244321","0.6237359","0.622901","0.6225349","0.62203866"],"string":"[\n \"0.7706423\",\n \"0.748784\",\n \"0.73391783\",\n \"0.72927845\",\n \"0.7196089\",\n \"0.71318763\",\n \"0.7069379\",\n \"0.7053129\",\n \"0.7037119\",\n \"0.6958277\",\n \"0.6920505\",\n \"0.6889352\",\n \"0.6835056\",\n \"0.68298167\",\n \"0.6813985\",\n \"0.67969644\",\n \"0.6793507\",\n \"0.6788672\",\n \"0.67333007\",\n \"0.67274106\",\n \"0.67176706\",\n \"0.6713738\",\n \"0.6701132\",\n \"0.6695852\",\n \"0.6682144\",\n \"0.667927\",\n \"0.66726136\",\n \"0.66670895\",\n \"0.66670895\",\n \"0.6665597\",\n \"0.6657112\",\n \"0.6646992\",\n \"0.66355354\",\n \"0.6633335\",\n \"0.66133803\",\n \"0.659002\",\n \"0.6586526\",\n \"0.656341\",\n \"0.6555393\",\n \"0.6555393\",\n \"0.6555393\",\n \"0.6546907\",\n \"0.6543888\",\n \"0.6537658\",\n \"0.6523497\",\n \"0.65134543\",\n \"0.64979875\",\n \"0.6493138\",\n \"0.64913565\",\n \"0.64820653\",\n \"0.64762646\",\n \"0.64762646\",\n \"0.64762646\",\n \"0.64761525\",\n \"0.6472286\",\n \"0.6470756\",\n \"0.645518\",\n \"0.64547217\",\n \"0.64513683\",\n \"0.64496905\",\n \"0.64469\",\n \"0.6430535\",\n \"0.64284354\",\n \"0.6425725\",\n \"0.64205694\",\n \"0.64178747\",\n \"0.6415213\",\n \"0.6413855\",\n \"0.6409131\",\n \"0.6385608\",\n \"0.6380498\",\n \"0.63793623\",\n \"0.63754934\",\n \"0.63571143\",\n \"0.63556886\",\n \"0.6345384\",\n \"0.6334663\",\n \"0.633172\",\n \"0.63268906\",\n \"0.63255465\",\n \"0.63237494\",\n \"0.6321298\",\n \"0.63186747\",\n \"0.63118154\",\n \"0.6309753\",\n \"0.62840515\",\n \"0.6276774\",\n \"0.6271568\",\n \"0.6266508\",\n \"0.6264212\",\n \"0.6257976\",\n \"0.62544894\",\n \"0.6250585\",\n \"0.6249131\",\n \"0.62487507\",\n \"0.6244321\",\n \"0.6237359\",\n \"0.622901\",\n \"0.6225349\",\n \"0.62203866\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.6580768"},"document_rank":{"kind":"string","value":"37"}}},{"rowIdx":27389,"cells":{"query":{"kind":"string","value":"/ Here the function tries to get the solution path. Since the Nodes are connected. We take the goal node and use the method getParent() until we arrive at the startNode. The path is printed to output."},"document":{"kind":"string","value":"private void solutionPath(Node n){\n ArrayList<String> num = new ArrayList<>();\n num.add(n.getDigit().getDigitString());\n Node node = n.getParent();\n\n while(true){\n\n if(node == startNode){\n num.add(node.getDigit().getDigitString());\n break;\n }else{\n num.add(node.getDigit().getDigitString());\n }\n\n node = node.getParent();\n }\n\n int size = num.size();\n int index = size-1;\n\n for(int i=0; i<size; i++){\n if(index == 0){\n System.out.println(num.get(index));\n break;\n }\n System.out.print(num.get(index)+\",\");\n index--;\n }\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["public List<Node> findPath(Vector2i start, Vector2i goal) {\n\t\tList<Node> openList = new ArrayList<Node>(); //All possible Nodes(tiles) that could be shortest path\n\t\tList<Node> closedList = new ArrayList<Node>(); //All no longer considered Nodes(tiles)\n\t\tNode current = new Node(start,null, 0, getDistance(start, goal)); //Current Node that is being considered(first tile)\n\t\topenList.add(current);\n\t\twhile(openList.size() > 0) {\n\t\t\tCollections.sort(openList, nodeSorter); // will sort open list based on what's specified in the comparator\n\t\t\tcurrent = openList.get(0); // sets current Node to first possible element in openList\n\t\t\tif(current.tile.equals(goal)) {\n\t\t\t\tList<Node> path = new ArrayList<Node>(); //adds the nodes that make the path \n\t\t\t\twhile(current.parent != null) { //retraces steps from finish back to start\n\t\t\t\t\tpath.add(current); // add current node to list\n\t\t\t\t\tcurrent = current.parent; //sets current node to previous node to strace path back to start\n\t\t\t\t}\n\t\t\t\topenList.clear(); //erases from memory since algorithm is finished, ensures performance is not affected since garbage collection may not be called\n\t\t\t\tclosedList.clear();\n\t\t\t\treturn path; //returns the desired result shortest/quickest path\n\t\t\t}\n\t\t\topenList.remove(current); //if current Node is not part of path to goal remove\n\t\t\tclosedList.add(current); //and puts it in closedList, because it's not used\n\t\t\tfor(int i = 0; i < 9; i++ ) { //8-adjacent tile possibilities\n\t\t\t\tif(i == 4) continue; //index 4 is the middle tile (tile player currently stands on), no reason to check it\n\t\t\t\tint x = (int)current.tile.getX();\n\t\t\t\tint y = (int)current.tile.getY();\n\t\t\t\tint xi = (i % 3) - 1; //will be either -1, 0 or 1\n\t\t\t\tint yi = (i / 3) - 1; // sets up a coordinate position for Nodes (tiles)\n\t\t\t\tTile at = getTile(x + xi, y + yi); // at tile be all surrounding tiles when iteration is run\n\t\t\t\tif(at == null) continue; //if empty tile skip it\n\t\t\t\tif(at.solid()) continue; //if solid cant pass through so skip/ don't consider this tile\n\t\t\t\tVector2i a = new Vector2i(x + xi, y + yi); //Same thing as node(tile), but changed to a vector\n\t\t\t\tdouble gCost = current.gCost + (getDistance(current.tile, a) == 1 ? 1 : 0.95); //*calculates only adjacent nodes* current tile (initial start is 0) plus distance between current tile to tile being considered (a)\n\t\t\t\tdouble hCost = getDistance(a, goal);\t\t\t\t\t\t\t\t// conditional piece above for gCost makes a more realist chasing, because without it mob will NOT use diagonals because higher gCost\n\t\t\t\tNode node = new Node(a, current, gCost, hCost);\n\t\t\t\tif(vecInList(closedList, a) && gCost >= node.gCost) continue; //is node has already been checked \n\t\t\t\tif(!vecInList(openList, a) || gCost < node.gCost) openList.add(node);\n\t\t\t}\n\t\t}\n\t\tclosedList.clear(); //clear the list, openList will have already been clear if no path was found\n\t\treturn null; //a default return if no possible path was found\n\t}","@Override\n List<NodeData> pathFind() throws NoPathException {\n System.out.println(\"Starting Scenic\");\n\n frontier.add(start);\n\n while(!frontier.isEmpty()) {\n StarNode current = frontier.getLast();\n frontier.removeLast(); // pop the priority queue\n if(current.getXCoord() == goal.getXCoord() && current.getYCoord() == goal.getYCoord()) {\n // If we are at the goal, we need to backtrack through the shortest path\n System.out.println(\"At target!\");\n finalList.add(current); // we have to add the goal to the path before we start backtracking\n while(!(current.getXCoord() == start.getXCoord() && current.getYCoord() == start.getYCoord())) {\n finalList.add(current.getPreviousNode());\n current = current.getPreviousNode();\n System.out.println(current.getNodeID());\n }\n return finalList;\n }\n else {\n // we need to get all the neighbor nodes, identify their costs, and put them into the queue\n LinkedList<StarNode> neighbors = current.getNeighbors();\n // we also need to remove the previous node from the list of neighbors because we do not want to backtrack\n neighbors.remove(current.getPreviousNode());\n\n for (StarNode newnode : neighbors) {\n int nodePlace = this.listContainsId(frontier, newnode);\n if(nodePlace > -1) {\n if (frontier.get(nodePlace).getF() > actionCost(newnode) + distanceToGo(newnode, goal)) {\n System.out.println(\"Here\");\n frontier.remove(frontier.get(nodePlace));\n newnode.setPreviousNode(current);\n frontier.add(newnode);\n newnode.setF(actionCost(newnode) + distanceToGo(newnode, goal));\n }\n }\n else {\n newnode.setPreviousNode(current);\n frontier.add(newnode);\n newnode.setF(actionCost(newnode) + distanceToGo(newnode, goal));\n }\n\n // This fixes the problem with infinitely looping elevators (I hope)\n if(current.getNodeType().equals(\"ELEV\") && newnode.getNodeType().equals(\"ELEV\")) {\n for (Iterator<StarNode> iterator = newnode.neighbors.iterator(); iterator.hasNext();) {\n StarNode newneighbor = iterator.next();\n if (newneighbor.getNodeType().equals(\"ELEV\")) {\n // Remove the current element from the iterator and the list.\n iterator.remove();\n }\n }\n }\n if(current.getNodeType().equals(\"STAI\") && newnode.getNodeType().equals(\"STAI\")) {\n for (Iterator<StarNode> iterator = newnode.neighbors.iterator(); iterator.hasNext();) {\n StarNode newneighbor = iterator.next();\n if (newneighbor.getNodeType().equals(\"STAI\")) {\n // Remove the current element from the iterator and the list.\n iterator.remove();\n }\n }\n }\n // this is where the node is put in the right place in the queue\n Collections.sort(frontier);\n }\n }\n }\n throw new NoPathException(start.getLongName(), goal.getLongName());\n }","private void printPath() {\n // generate and print the shortest path.\n if (this == this.previous) {\n graphPathRef.add(this);\n } else if (this.previous == null) {\n System.out.print(\"\");\n } else {\n graphPathRef.add(this);\n this.previous.printPath();\n }\n }","public Iterable<Board> solution() {\n\t\tif (goal == null)\n\t\t\treturn null;\n\t\telse {\n\t\t\tfinal Stack<Board> trace = new Stack<Board>();\n\t\t\tSearchNode iter = goal;\n\t\t\twhile (iter != null) {\n\t\t\t\ttrace.push(iter.getBoard());\n\t\t\t\titer = iter.getParent();\n\t\t\t}\n\t\t\treturn trace;\n\t\t}\n\t}","public Stack<Node> findPath(Node initial_node, Node end_node) {\r\n\r\n // TODO: check for hardcoded value 3\r\n int size = 3;\r\n boolean is_start_node = true;\r\n\r\n PriorityList priority_list = new PriorityList();\r\n LinkedList linked_list = new LinkedList();\r\n\r\n // Initialise start node\r\n initial_node.total_path_cost = 0;\r\n initial_node.cost_estimated_to_goal_node = initial_node.pathCost(end_node);\r\n initial_node.parent_node_in_path = null;\r\n priority_list.add(initial_node);\r\n\r\n // Begin exploration of grid map\r\n while (!priority_list.isEmpty()) {\r\n\r\n // Get node from head of list\r\n Node node = (Node) priority_list.removeFirst();\r\n\r\n // Determine if node is Start node\r\n if (node == initial_node)\r\n is_start_node = true;\r\n else\r\n is_start_node = false;\r\n\r\n ((Node) node).setFacing();\r\n\r\n // Determine if node is goal node\r\n if (node == end_node) {\r\n return constructPath(end_node);\r\n }\r\n\r\n // Get list of node neighbours\r\n List neighbors_list = node.getNeighbors();\r\n\r\n // Iterate through list of node neighbours\r\n for (int i = 0; i < neighbors_list.size(); i++) {\r\n\r\n // Extract neighbour node information\r\n Node node_neighbour = (Node) neighbors_list.get(i);\r\n boolean isOpen = priority_list.contains(node_neighbour);\r\n boolean isClosed = linked_list.contains(node_neighbour);\r\n boolean isObs = (node_neighbour).isObs();\r\n int clearance = node_neighbour.getClearance();\r\n float total_path_cost = node.getCost(node_neighbour, end_node, is_start_node) + 1;\r\n\r\n // Check 1. if node neighbours have not been explored OR 2. if shorter path to\r\n // neighbour node exists\r\n if ((!isOpen && !isClosed) || total_path_cost < node_neighbour.total_path_cost) {\r\n node_neighbour.parent_node_in_path = node;\r\n node_neighbour.total_path_cost = total_path_cost;\r\n node_neighbour.cost_estimated_to_goal_node = node_neighbour.pathCost(end_node);\r\n\r\n // Add neighbour node to priority_list if 1. node not in\r\n // priority_list/linked_list AND 2.\r\n // robot can reach\r\n if (!isOpen && !isObs && size == clearance) {\r\n priority_list.add(node_neighbour);\r\n }\r\n }\r\n }\r\n linked_list.add(node);\r\n }\r\n\r\n // priority_list empty; no path found\r\n\r\n return new Stack<Node>();\r\n }","@Override\n\tpublic void solve() {\n\t\tlong startTime = System.nanoTime();\n\n\t\twhile(!unvisitedPM.isEmpty()){\n\t\t\tProblemModel current = findCheapestNode();\n\t\n\t\t\tfor(ProblemModel pm : current.getSubNodes()){\n\t\t\n\t\t\t\tif(!visited.contains(pm) && !unvisitedPM.contains(pm)){\n\t\t\t\t\t\n\t\t\t\t\tunvisitedPM.add(pm);\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\tif(current.getSideStart().isEmpty()){\n\t\t\t\tSystem.out.print( \"\\n\"+ \"StartSide Runners: \");\n\t\t\t\tfor(Integer r: current.getSideStart()){\n\t\t\t\t\tSystem.out.print( \" \" +r) ;\n\t\t\t\t}\n\t\t\t\tSystem.out.print( \"\\n\" + \"EndSide Runners: \");\n\t\t\t\tfor(Integer r: current.getSideEnd()){\n\t\t\t\t\tSystem.out.print( \" \" + r);\n\t\t\t\t}\n\n\t\t\t\tprintPathTaken(current);\n\t\t\t\tSystem.out.print( \"\\n\" + \"------------done--------------\");\n\t\t\t\tlong endTime = System.nanoTime();\n\t\t\t\tlong duration = ((endTime - startTime)/1000000);\n\t\t\t\tSystem.out.print( \"\\n\" + \"-AS1 Time taken: \" + duration + \"ms\");\n\t\t\t\t\n\t\t\t\t\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\tvisited.add(current);\n\t\t\n\t\t}\n\t\t\n\n\t}","private Stack<MapLocation> returnPath(MapLocation goal, MapLocation start) {\n\t\tStack<MapLocation> path = new Stack<MapLocation>();\n\n\t\tMapLocation iter = goal;\n\t\twhile (iter.cameFrom != null) {\n\t\t\tpath.add(iter.cameFrom);\n\t\t\titer = iter.cameFrom;\n\t\t}\n\t\t// to remove start\n\n\t\tif (path.isEmpty()) {\n\t\t\treturn path;\n\t\t}\n\n\t\tpath.pop();\n\n\t\treturn path;\n\t}","private static ArrayList<Connection> pathFindDijkstra(Graph graph, int start, int goal) {\n\t\tNodeRecord startRecord = new NodeRecord();\r\n\t\tstartRecord.setNode(start);\r\n\t\tstartRecord.setConnection(null);\r\n\t\tstartRecord.setCostSoFar(0);\r\n\t\tstartRecord.setCategory(OPEN);\r\n\t\t\r\n\t\tArrayList<NodeRecord> open = new ArrayList<NodeRecord>();\r\n\t\tArrayList<NodeRecord> close = new ArrayList<NodeRecord>();\r\n\t\topen.add(startRecord);\r\n\t\tNodeRecord current = null;\r\n\t\tdouble endNodeCost = 0;\r\n\t\twhile(open.size() > 0){\r\n\t\t\tcurrent = getSmallestCSFElementFromList(open);\r\n\t\t\tif(current.getNode() == goal){\r\n\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t\tGraphNode node = graph.getNodeById(current.getNode());\r\n\t\t\tArrayList<Connection> connections = node.getConnection();\r\n\t\t\tfor( Connection connection :connections){\r\n\t\t\t\t// get the cost estimate for end node\r\n\t\t\t\tint endNode = connection.getToNode();\r\n\t\t\t\tendNodeCost = current.getCostSoFar() + connection.getCost();\r\n\t\t\t\tNodeRecord endNodeRecord = new NodeRecord();\r\n\t\t\t\t// if node is closed skip it\r\n\t\t\t\tif(listContains(close, endNode))\r\n\t\t\t\t\tcontinue;\r\n\t\t\t\t// or if the node is in open list\r\n\t\t\t\telse if (listContains(open,endNode)){\r\n\t\t\t\t\tendNodeRecord = findInList(open, endNode);\r\n\t\t\t\t\t// print\r\n\t\t\t\t\t// if we didn't get shorter route then skip\r\n\t\t\t\t\tif(endNodeRecord.getCostSoFar() <= endNodeCost) {\r\n\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\t// else node is not visited yet\r\n\t\t\t\telse {\r\n\t\t\t\t\tendNodeRecord = new NodeRecord();\r\n\t\t\t\t\tendNodeRecord.setNode(endNode);\r\n\t\t\t\t}\r\n\t\t\t\t//update the node\r\n\t\t\t\tendNodeRecord.setCostSoFar(endNodeCost);\r\n\t\t\t\tendNodeRecord.setConnection(connection);\r\n\t\t\t\t// add it to open list\r\n\t\t\t\tif(!listContains(open, endNode)){\r\n\t\t\t\t\topen.add(endNodeRecord);\r\n\t\t\t\t}\r\n\t\t\t}// end of for loop for connection\r\n\t\t\topen.remove(current);\r\n\t\t\tclose.add(current);\r\n\t\t}// end of while loop for open list\r\n\t\tif(current.getNode() != goal)\r\n\t\t\treturn null;\r\n\t\telse { //get the path\r\n\t\t\tArrayList<Connection> path = new ArrayList<>();\r\n\t\t\twhile(current.getNode() != start){\r\n\t\t\t\tpath.add(current.getConnection());\r\n\t\t\t\tint newNode = current.getConnection().getFromNode();\r\n\t\t\t\tcurrent = findInList(close, newNode);\r\n\t\t\t}\r\n\t\t\tCollections.reverse(path);\r\n\t\t\treturn path;\r\n\t\t}\r\n\t}","private String solutionPath(State goal)\n\t{\n\t\t// TODO \n\t\t\n\t\treturn null; \n\t}","public List<Pair<Integer, Integer>> preparePath(Pair<Integer, Integer> goal) {\n var path = new LinkedList<Pair<Integer, Integer>>();\n path.add(goal);\n var parent = goal.getParent();\n while(parent != null) {\n path.addFirst(parent);\n parent = parent.getParent();\n }\n path.removeLast();\n return path;\n }","public Path getShortestPath() {\n\t\tNodeRecord startRecord = new NodeRecord(start, null, 0.0f, (float) heuristic.estimate(start), Category.OPEN);\n\n\t\t// Initialize the open list\n\t\tPathFindingList open = new PathFindingList();\n\t\topen.addRecordByEstimatedTotalCost(startRecord);\n\t\trecords.set(Integer.parseInt(startRecord.node.id), startRecord);\n\t\tNodeRecord current = null;\n\t\t\n\t\t// Iterate through processing each node\n\t\twhile (!open.isEmpty()) {\n\t\t\t// Find smallest element in the open list using estimatedTotalCost\n\t\t\tcurrent = open.getSmallestNodeRecordByEstimatedTotalCost();\n\n\t\t\t// If its the goal node, terminate\n\t\t\tif (current.node.equals(end)) break;\n\n\t\t\t// Otherwise get its outgoing connections\n\t\t\tArrayList<DefaultWeightedEdge> connections = g.getConnections(current.node);\n\t\t\t\n\t\t\t// Loop through each connection\n\t\t\tfor (DefaultWeightedEdge connection : connections) {\n\t\t\t\t// Get the cost and other information for end node\n\t\t\t Vertex endNode = g.graph.getEdgeTarget(connection);\n\t\t\t int endNodeRecordIndex = Integer.parseInt(endNode.id);\n NodeRecord endNodeRecord = records.get(endNodeRecordIndex); // this is potentially null but we handle it\n\t\t\t\tdouble newEndNodeCost = current.costSoFar + g.graph.getEdgeWeight(connection);\n\t\t\t\tdouble endNodeHeuristic = 0;\n\t\t\t\t\n\t\t\t\t// if node is closed we may have to skip, or remove it from closed list\t\n\t\t\t\tif( endNodeRecord != null && endNodeRecord.category == Category.CLOSED ){ \n\t\t\t\t\t// Find the record corresponding to the endNode\n\t\t\t\t\tendNodeRecord = records.get(endNodeRecordIndex);\n\n\t\t\t\t\t// If we didn't find a shorter route, skip\n\t\t\t\t\tif (endNodeRecord.costSoFar <= newEndNodeCost) continue;\n\n\t\t\t\t\t// Otherwise remove it from closed list\n\t\t\t\t\trecords.get(endNodeRecordIndex).category = Category.OPEN;\n\n\t\t\t\t\t// Use node's old cost values to calculate its heuristic to save computation\n\t\t\t\t\tendNodeHeuristic = endNodeRecord.estimatedTotalCost - endNodeRecord.costSoFar;\n\n\t\t\t\t// Skip if node is open and we've not found a better route\n\t\t\t\t} else if( endNodeRecord != null && endNodeRecord.category == Category.OPEN ){ \n\t\t\t\t\t// Here we find the record in the open list corresponding to the endNode\n\t\t\t\t\tendNodeRecord = records.get(endNodeRecordIndex);\n\n\t\t\t\t\t// If our route isn't better, skip\n\t\t\t\t\tif (endNodeRecord.costSoFar <= newEndNodeCost) continue;\n\n\t\t\t\t\t// Use the node's old cost values to calculate its heuristic to save computation\n\t\t\t\t\tendNodeHeuristic = endNodeRecord.estimatedTotalCost - endNodeRecord.costSoFar;\n\n\t\t\t\t// Otherwise we know we've got an unvisited node, so make a new record\n\t\t\t\t} else { // if endNodeRecord.category == Category.UNVISITED\n\t\t\t\t endNodeRecord = new NodeRecord();\n\t\t\t\t\tendNodeRecord.node = endNode;\n\t\t\t\t\trecords.set(endNodeRecordIndex, endNodeRecord);\n\n\t\t\t\t\t// Need to calculate heuristic since this is new\n\t\t\t\t\tendNodeHeuristic = heuristic.estimate(endNode);\n\t\t\t\t}\n\t\t\t\t\n\n\t\t\t\t// We're here if we need to update the node\n\t\t\t\t// update the cost, estimate, and connection\n\t\t\t\tendNodeRecord.costSoFar = newEndNodeCost;\n\t\t\t\tendNodeRecord.edge = connection;\n\t\t\t\tendNodeRecord.estimatedTotalCost = newEndNodeCost + endNodeHeuristic;\n\n\t\t\t\t// Add it to the open list\n\t\t\t\tif ( endNodeRecord.category != Category.OPEN ) {\n\t\t\t\t\topen.addRecordByEstimatedTotalCost(endNodeRecord);\n\t\t\t\t\tendNodeRecord.category = Category.OPEN;\n\t\t\t\t\trecords.set(endNodeRecordIndex, endNodeRecord);\n\t\t\t\t}\n\n\t\t\t}\n\t\t\t\n\t\t\t// We’ve finished looking at the connections for\n\t\t\t// the current node, so add it to the closed list\n\t\t\t// and remove it from the open list\n\t\t\topen.removeRecord(current);\n\t\t\tcurrent.category = Category.CLOSED;\n\t\t\trecords.set(Integer.parseInt(current.node.id), current);\n\t\t}\n\t\t\n\t\t// We’re here if we’ve either found the goal, or\n\t\t// if we’ve no more nodes to search, find which.\n\t\tif (!current.node.equals(end)) {\n\t\t\t// Ran out of nodes without finding the goal, no solution\n\t\t\treturn null;\n\t\t} else {\n\t\t // Compile the list of connections in the path\n\t\t\tArrayList<DefaultWeightedEdge> path = new ArrayList<>();\n\n\t\t\twhile (!current.node.equals(start)) {\n\t\t\t\tpath.add(current.edge);\n\t\t\t\t// Set current (NodeRecord) to is source.\n\t\t\t\tcurrent = records.get( Integer.parseInt(g.graph.getEdgeSource(current.edge).id) );\n\t\t\t}\n\n\t\t\t// Reverse the path, and return it\n\t\t\tCollections.reverse(path);\n\t\t\treturn new Path(g, path);\n\t\t}\n\n\t}","@Override\r\n public Set<List<String>> findAllPaths(int sourceId, int targetId, int reachability) {\r\n //all paths found\r\n Set<List<String>> allPaths = new HashSet<List<String>>();\r\n //collects path in one iteration\r\n Set<List<String>> newPathsCollector = new HashSet<List<String>>();\r\n //same as the solution but with inverted edges\r\n Set<List<String>> tmpPathsToTarget = new HashSet<List<String>>();\r\n //final solution\r\n Set<List<String>> pathsToTarget = new HashSet<List<String>>();\r\n \r\n String[] statementTokens = null; \r\n Set<Integer> allProcessedNodes = new HashSet<Integer>(); //to avoid duplicates\r\n List<String> statementsFound = new ArrayList<String>();\r\n \r\n for (int i = 0; i < reachability; i++) {\r\n if (i == 0) { \r\n Collection<String> inEdges = jungCompleteGraph.getInEdges(sourceId);\r\n for (String inEdge: inEdges) {\r\n \r\n statementsFound = new ArrayList<String>();\r\n statementTokens = inEdge.split(\"->\");\r\n int inNodeId = Integer.parseInt(statementTokens[0]);\r\n //allProcessedNodes.add(inNodeId); \r\n //Incoming nodes are reversed\r\n statementsFound.add(new StringBuilder(inEdge).reverse().toString());\r\n allPaths.add(statementsFound);\r\n if (inNodeId == targetId) tmpPathsToTarget.add(statementsFound);\r\n }\r\n \r\n Collection<String> outEdges = jungCompleteGraph.getOutEdges(sourceId);\r\n \r\n for (String outEdge: outEdges) {\r\n \r\n statementsFound = new ArrayList<String>();\r\n statementTokens = outEdge.split(\"->\");\r\n int outNodeId = Integer.parseInt(statementTokens[2]);\r\n statementsFound.add(outEdge);\r\n allPaths.add(statementsFound);\r\n if (outNodeId == targetId) tmpPathsToTarget.add(statementsFound);\r\n \r\n }\r\n \r\n } else {\r\n newPathsCollector = new HashSet<List<String>>();\r\n\r\n for (List<String> statements: allPaths) {\r\n allProcessedNodes = new HashSet<Integer>(); //to avoid duplicates\r\n int lastNodeInPath = 0;\r\n \r\n for (String predicate: statements) {\r\n if (predicate.contains(\">-\")) {\r\n statementTokens = predicate.split(\">-\");\r\n allProcessedNodes.add(Integer.parseInt(\r\n new StringBuilder(statementTokens[0]).reverse().toString()));\r\n allProcessedNodes.add(Integer.parseInt(\r\n new StringBuilder(statementTokens[2]).reverse().toString()));\r\n lastNodeInPath = Integer.parseInt(\r\n new StringBuilder(statementTokens[2]).reverse().toString());\r\n } else {\r\n statementTokens = predicate.split(\"->\"); \r\n allProcessedNodes.add(Integer.parseInt(statementTokens[0]));\r\n allProcessedNodes.add(Integer.parseInt(statementTokens[2]));\r\n lastNodeInPath = Integer.parseInt(statementTokens[2]);\r\n }\r\n }\r\n \r\n Collection<String> inEdges = jungCompleteGraph.getInEdges(lastNodeInPath);\r\n for (String inEdge: inEdges) {\r\n \r\n statementsFound = new ArrayList<String>();\r\n statementsFound.addAll(statements);\r\n statementTokens = inEdge.split(\"->\");\r\n int inNodeId = Integer.parseInt(statementTokens[0]);\r\n if (allProcessedNodes.contains(inNodeId)) continue;\r\n \r\n //Incoming nodes are reversed \r\n statementsFound.add(new StringBuilder(inEdge).reverse().toString());\r\n newPathsCollector.add(statementsFound);\r\n if (inNodeId == targetId) tmpPathsToTarget.add(statementsFound);\r\n \r\n }\r\n \r\n Collection<String> outEdges = jungCompleteGraph.getOutEdges(lastNodeInPath);\r\n for (String outEdge: outEdges) {\r\n \r\n statementsFound = new ArrayList<String>();\r\n statementsFound.addAll(statements);\r\n statementTokens = outEdge.split(\"->\");\r\n int outNodeId = Integer.parseInt(statementTokens[2]);\r\n if (allProcessedNodes.contains(outNodeId)) continue;\r\n \r\n //Incoming nodes are reversed \r\n statementsFound.add(outEdge);\r\n newPathsCollector.add(statementsFound);\r\n if (outNodeId == targetId) tmpPathsToTarget.add(statementsFound);\r\n }\r\n }\r\n allPaths.addAll(newPathsCollector);\r\n }\r\n \r\n //System.out.println(\"*****End of iteration \" + i);\r\n //System.out.println(\"#SIZE OF allPaths: \" + allPaths.size());\r\n int numItems = 0;\r\n for (List<String> currList: allPaths) {\r\n numItems = numItems + currList.size();\r\n }\r\n //System.out.println(\"#NUMBER OF ELEMS OF ALL LISTS: \" + numItems);\r\n //System.out.println(\"#SIZE OF tmpPathsToTarget : \" + tmpPathsToTarget.size());\r\n }\r\n \r\n //We need to reverse back all the predicates\r\n for (List<String> statements: tmpPathsToTarget) { \r\n List<String> fixedStatements = new ArrayList<String>(); \r\n for (int i = 0; i < statements.size(); i++) { \r\n String statement = statements.get(i); \r\n if (statement.contains(\">-\")) {\r\n fixedStatements.add(new StringBuilder(statement).reverse().toString());\r\n } else {\r\n fixedStatements.add(statement);\r\n } \r\n }\r\n pathsToTarget.add(fixedStatements);\r\n }\r\n return pathsToTarget;\r\n }","private void printPath(int currentVertex, int[] parents) {\n // Base case : Source node has been processed \n if (currentVertex == NO_PARENT) {\n return;\n }\n printPath(parents[currentVertex], parents);\n System.out.print(currentVertex + \" \");\n }","ArrayList<Node> DFSIter( Graph graph, final Node start, final Node end)\n {\n boolean visited[] = new boolean[graph.numNodes];\n Stack<Node> stack = new Stack<Node>();\n Map< Node,Node> parentPath = new HashMap< Node,Node>(); \n stack.push(start);\n\n while ( !stack.isEmpty() )\n {\n Node currNode = stack.pop();\n // end loop when goal node is found\n if ( currNode == end )\n break;\n // If node has already been visited, skip it\n if ( visited[currNode.id] )\n continue;\n else\n {\n visited[currNode.id] = true;\n int numEdges = currNode.connectedNodes.size();\n\n for ( int i = 0; i < numEdges; i++ )\n {\n Node edgeNode = currNode.connectedNodes.get(i);\n if ( !visited[edgeNode.id] )\n {\n stack.push( edgeNode );\n parentPath.put( edgeNode, currNode);\n }\n }\n \n }\n }\n\n ArrayList<Node> path = new ArrayList<Node>();\n Node currNode = end;\n while ( currNode != null )\n {\n path.add(0, currNode);\n currNode = parentPath.get(currNode);\n }\n\n return path;\n }","private LinkedList<Node> backtraceFromGoal(Node Target, Node Start) {\n LinkedList<Node> pathList = new LinkedList<>();\n\n pathList.add(Target);\n Node currentNode = null;\n /*ЕСЛИ финишная ячейка помечена\n ТО\n перейти в финишную ячейку\n ЦИКЛ\n выбрать среди соседних ячейку, помеченную числом на 1 меньше числа в текущей ячейке\n перейти в выбранную ячейку и добавить её к пути\n ПОКА текущая ячейка — не стартовая\n ВОЗВРАТ путь найден\n ИНАЧЕ\n ВОЗВРАТ путь не найден*/\n\n\n return pathList;\n }","public List<node_info> shortestPath(int src, int dest);","public Stack<Point> shortestPath() {\n\t\tresetVisited();\n\t\tStack <Point> shortestPath = new Stack<Point>();\n\t\tprev = new HashMap<Point,Point>();\n\t\tCompass[] direction = Compass.values();\n\t\tQueue <Point> path = new LinkedList<Point>();\n\t\tpath.add(playerStart);\n\t\twhile(!path.isEmpty()) {\n\t\t\tPoint current = path.poll();\n\t\t\tfor (Compass pointing: direction) {\n\t\t\t\tif (current.equals(goal)) {\n\t\t\t\t\tshortestPath.push(current);\n\t\t\t\t\twhile (prev.containsKey(shortestPath.peek()) && !shortestPath.peek().equals(playerStart)){\n\t\t\t\t\t\tshortestPath.push(prev.get(shortestPath.peek()));\n\t\t\t\t\t}\n\t\t\t\t\treturn shortestPath;\n\t\t\t\t}\n\t\t\t\tint nextW = (int)current.getX() + pointing.mapX;\n\t\t\t\tint nextH = (int)current.getY() + pointing.mapY;\n\t\t\t\tPoint nextPoint = new Point(nextW, nextH);\n\t\t\t\tif (arrayBounds(nextW, width) && arrayBounds (nextH, height) && maze[nextW][nextH] == 0 && !visited.contains(nextPoint)) {\n\t\t\t\t\tpath.add(nextPoint);\n\t\t\t\t\tvisited.add(nextPoint);\n\t\t\t\t\tprev.put(nextPoint, current);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn shortestPath;\t\t\n\t}","public void shortestPathList() {\n Cell cell = maze.getGrid()[r - 1][r - 1];\n\n parents.add(cell);\n\n while (cell.getParent() != null) {\n parents.add(cell.getParent());\n cell = cell.getParent();\n }\n\n Collections.reverse(parents);\n }","private void printSolution(int startVertex, double[] distances, int[] parents) {\n int nVertices = distances.length;\n System.out.print(\"Vertex\\t Distance\\tPath\");\n\n for (int vertexIndex = 0; vertexIndex < nVertices; vertexIndex++) {\n if (vertexIndex != startVertex) {\n System.out.print(\"\\n\" + startVertex + \" -> \");\n System.out.print(vertexIndex + \" \\t\\t \");\n System.out.print(distances[vertexIndex] + \"\\t\\t\");\n printPath(vertexIndex, parents);\n }\n }\n }","private List<Pair<Integer, Integer>> getBestPath(Pair<Integer, Integer> curLocation, Pair<Integer, Integer> dest) {\n\t\tList<Pair<Integer, Integer>> path = new LinkedList<Pair<Integer, Integer>>();\n\t\t\n\t\t\n\t\tNode current = new Node(curLocation.getX(), curLocation.getY(), getHitProbability(curLocation.getX(), curLocation.getY()));\n\t\tNode target = new Node(dest.getX(), dest.getY(), getHitProbability(dest.getX(), dest.getY()));\n\t\tList<Node> openSet = new ArrayList<>();\n List<Node> closedSet = new ArrayList<>();\n \n \n while (true) {\n openSet.remove(current);\n List<Node> adjacent = getAdjacentNodes(current, closedSet, target);\n\n // Find the adjacent node with the lowest heuristic cost.\n for (Node neighbor : adjacent) {\n \tboolean inOpenset = false;\n \tList<Node> openSetCopy = new ArrayList<>(openSet);\n \tfor (Node node : openSetCopy) {\n \t\tif (neighbor.equals(node)) {\n \t\t\tinOpenset = true;\n \t\t\tif (neighbor.getAccumulatedCost() < node.getAccumulatedCost()) {\n \t\t\t\topenSet.remove(node);\n \t\t\t\topenSet.add(neighbor);\n \t\t\t}\n \t\t}\n \t}\n \t\n \tif (!inOpenset) {\n \t\topenSet.add(neighbor);\n \t}\n }\n\n // Exit search if done.\n if (openSet.isEmpty()) {\n System.out.printf(\"Target (%d, %d) is unreachable from position (%d, %d).\\n\",\n target.getX(), target.getY(), curLocation.getX(), curLocation.getY());\n return null;\n } else if (/*isAdjacent(current, target)*/ current.equals(target)) {\n break;\n }\n\n // This node has been explored now.\n closedSet.add(current);\n\n // Find the next open node with the lowest cost.\n Node next = openSet.get(0);\n for (Node node : openSet) {\n if (node.getCost(target) < next.getCost(target)) {\n next = node;\n }\n }\n// System.out.println(\"Moving to node: \" + current);\n current = next;\n }\n \n // Rebuild the path using the node parents\n path.add(new Pair<Integer, Integer>(curLocation.getX(), curLocation.getY()));\n while(current.getParent() != null) {\n \tcurrent = current.getParent();\n \tpath.add(0, new Pair<Integer, Integer>(current.getX(), current.getY()));\n }\n \n if (path.size() > 1) {\n \tpath.remove(0);\n }\n \n\t\treturn path;\n\t}","@Override\n public List<node_data> shortestPath(int src, int dest) {\n reset();\n for (node_data node : G.getV()) {\n node.setWeight(Double.POSITIVE_INFINITY);\n }\n\n DWGraph_DS.Node currentNode = (DWGraph_DS.Node) G.getNode(src);\n currentNode.setWeight(0);\n PriorityQueue<node_data> unvisitedNodes = new PriorityQueue(G.nodeSize(), weightComperator);\n unvisitedNodes.addAll(G.getV());\n HashMap<Integer, node_data> parent = new HashMap<>();\n parent.put(src, null);\n\n while (currentNode.getWeight() != Double.POSITIVE_INFINITY) {\n if (G.getNode(dest).getTag() == 1) {\n break;\n }\n for (edge_data edge : G.getE(currentNode.getKey())) {\n DWGraph_DS.Node neighbor = (DWGraph_DS.Node) G.getNode(edge.getDest());\n double tmpWeight = currentNode.getWeight() + edge.getWeight();\n if (tmpWeight < neighbor.getWeight()) {\n neighbor.setWeight(tmpWeight);\n unvisitedNodes.remove(neighbor);\n unvisitedNodes.add(neighbor);\n parent.put(neighbor.getKey(), currentNode);\n }\n }\n currentNode.setTag(1);\n if(currentNode.getKey()==dest) break;\n unvisitedNodes.remove(currentNode);\n currentNode = (DWGraph_DS.Node) unvisitedNodes.poll();\n }\n /*\n Rebuild the path list\n */\n if (!parent.keySet().contains(dest)) return null;\n List<node_data> pathList = new ArrayList<>();\n currentNode = (DWGraph_DS.Node) G.getNode(dest);\n while (parent.get(currentNode.getKey()) != null) {\n pathList.add(currentNode);\n currentNode = (DWGraph_DS.Node) parent.get(currentNode.getKey());\n }\n Collections.reverse(pathList);\n return pathList;\n }","public List<Node> find(Node start, Node finish){\n reachable.add(start);\n this.finish = finish;\n\n while(!reachable.isEmpty()){\n // Select a node from the reachable list\n // If we've reached the end, return the list of nodes in our path\n \n Node node = selectNode(reachable);\n if(node.isEqual(finish)){\n return getPath(node);\n }\n\n // Otherwise, remove the new node from the reachable list, and add it to the \n // visited list so we don't look at a node more than necessary. Build a list of the\n // nodes that are adjacent to our current node.\n \n reachable.remove(node);\n visited.add(node);\n List<Node> adjacent = getAdjacent(node);\n\n // If the current node has adjacent nodes, and if we haven't looked at those nodes before,\n // add those nodes to the reachable list. If the node's cost is lower than 1+the cost to reach it,\n // make the node's parent the previous node and set the cost\n if(!adjacent.isEmpty()) {\n for (Node n : adjacent) {\n if (!reachable.contains(n)&&!visited.contains(n)) {\n reachable.add(n);\n }\n if (node.getCostEstimated() + 1 <= n.getCostEstimated()) {\n n.setParent(node);\n n.setCostEstimated(node.getCostEstimated() + 1);\n }\n }\n }\n }\n return null;\n }","private void computePath(){\n LinkedStack<T> reversePath = new LinkedStack<T>();\n // adding end vertex to reversePath\n T current = end; // first node is the end one\n while (!current.equals(start)){\n reversePath.push(current); // adding current to path\n current = closestPredecessor[vertexIndex(current)]; // changing to closest predecessor to current\n }\n reversePath.push(current); // adding the start vertex\n \n while (!reversePath.isEmpty()){\n path.enqueue(reversePath.pop());\n }\n }","public List<Node> findPath(Node start);","public String getShortestPath(int goal) throws Throwable {\n if (goal < 0) {\n return \"There is no path\";\n }\n Queue<Integer> stack = new Queue<>(new Integer[10]); \n int previous = path[goal];\n if (previous == -1) {\n return \"There is no path\";\n }\n while (previous != 0) {\n stack.push(previous);\n previous = path[previous];\n }\n String ret = \"0 > \";\n while (!stack.isEmpty()) {\n ret = ret + (stack.poll() + \" > \");\n }\n return \"\" + ret + goal;\n }","private void computeShortestPath(){\n T current = start;\n boolean atEnd = false;\n while (!unvisited.isEmpty()&& !atEnd){\n int currentIndex = vertexIndex(current);\n LinkedList<T> neighbors = getUnvisitedNeighbors(current); // getting unvisited neighbors\n \n //what is this doing here???\n if (neighbors.isEmpty()){\n \n }\n \n // looping through to find distances from start to neighbors\n for (T neighbor : neighbors){ \n int neighborIndex = vertexIndex(neighbor); \n int d = distances[currentIndex] + getEdgeWeight(current, neighbor);\n \n if (d < distances[neighborIndex]){ // if this distance is less than previous distance\n distances[neighborIndex] = d;\n closestPredecessor[neighborIndex] = current; // now closest predecessor is current\n }\n }\n \n if (current.equals(end)){\n atEnd = true;\n }\n else{\n // finding unvisited node that is closest to start node\n T min = getMinUnvisited();\n if (min != null){\n unvisited.remove(min); // remove minimum neighbor from unvisited\n visited.add(min); // add minimum neighbor to visited\n current = min;\n }\n }\n }\n computePath();\n totalDistance = distances[vertexIndex(end)];\n }","void print_path(int[]parent,int[]dist,int s)\n {\n System.out.println(); \n \n //path from s to all other vertices\n \n for(int i=0;i<parent.length;i++)\n {\n System.out.println(\"From \"+s+\" to \"+i);\n System.out.print(\"path: \");\n print_node(parent,i);\n System.out.print(\"END\");\n if(dist[i]==INF)\n System.out.println(\" cost=INF\"); \n else\n System.out.println(\" cost=\"+dist[i]);\n\n }\n \n \n System.out.println();\n \n\n \n }","public Iterable<Board> solution()\n {\n Stack<Board> solution = new Stack<Board>();\n \n // for case where initial board is goal board\n if (moves == 0) {\n solution.push(goalNode.board);\n return solution;\n }\n\n step = goalNode;\n \n // add chain of previous node from goal node \n while (step != null) {\n solution.push(step.board);\n step = step.prev;\n }\n \n return solution;\n }","public Iterator<Node> findPath() throws GraphException{\n\t\t\n\t\t// create a start and end node\n\t\tNode begin = this.graph.getNode(this.start);\n\t\tNode finish = this.graph.getNode(this.end);\n\t\t// check to make sure a path exits between these nodes\n\t\tboolean test = findPath(begin, finish);\n\t\tif(test){\n\t\t\t// reset the variables of the map that were changed by invoking the findPath helper method\n\t\t\tthis.testLine = \"Luka<3<3\";\n\t\t\tthis.changeCount = -1;\n\t\t\t//return the iterator over the Stack of the Map that was modified by the findPath helper method\n\t\t\treturn this.S.iterator();\n\t\t}\n\t\t// return null if a path does not exist\n\t\treturn null;\n\t}","public void printPath() {\n System.out.print(\"Path: \");\n for (int i = 0; i < parents.size(); i++) {\n Cell cell = parents.get(i);\n System.out.print(\" (\" + cell.x + \",\" + cell.y + \") \");\n }\n System.out.println(\"\\nVisited cells: \" + visitedCells);\n System.out.println(\"Length of Path: \" + parents.size());\n }","public void shortestPathsNodes() {\n for (int sourceNode = 0; sourceNode < wordGraph.V(); sourceNode++) {\n BreadthFirstDirectedPaths bfs = new BreadthFirstDirectedPaths(wordGraph, sourceNode);\n\n for (int goalNode = 0; goalNode < wordGraph.V(); goalNode++) {\n Iterable<Integer> shortestPath = bfs.pathTo(goalNode);\n int pathLength = -1;\n if (shortestPath != null) {\n for (int edge : shortestPath) {\n pathLength++;\n }\n }\n if (pathLength != -1) {\n }\n System.out.println(pathLength);\n }\n }\n }","public static List<CampusGraph.Edges<String, String>> findPath(CampusGraph<String, String> cg, String start, String destination) {\n if (cg == null || start == null || destination == null) {\n throw new IllegalArgumentException();\n }\n Queue<String> visitedNodes = new LinkedList<>();\n Map<String, List<CampusGraph.Edges<String, String>>> paths = new HashMap<>();\n visitedNodes.add(start); // Add start to Q\n paths.put(start, new LinkedList<>()); // Add start->[] to M (start mapped to an empty list)\n\n while (!visitedNodes.isEmpty()) {\n String currentNode = visitedNodes.remove();\n if (currentNode.equals(destination)) { // found the path\n return paths.get(currentNode);\n } else {\n List<CampusGraph.Edges<String, String>> neighbors = cg.getAllChildren(currentNode);\n neighbors.sort(new Comparator<CampusGraph.Edges<String, String>>() {\n @Override\n public int compare(CampusGraph.Edges<String, String> o1, CampusGraph.Edges<String, String> o2) {\n int cmpEndNode = o1.getEndTag().compareTo(o2.getEndTag());\n if (cmpEndNode == 0) {\n return o1.getEdgeLabel().compareTo(o2.getEdgeLabel());\n }\n return cmpEndNode;\n }\n }); // ascending list. Sort characters and books names all at once??\n\n for (CampusGraph.Edges<String, String> e: neighbors) {\n String neighbor = e.getEndTag();\n if (!paths.containsKey(neighbor)) { // i.e. if the neighbor is unvisited\n List<CampusGraph.Edges<String, String>> pathCopy = new LinkedList<>(paths.get(currentNode));\n pathCopy.add(e);\n paths.put(neighbor, pathCopy); // add the path exclusive to this neighbor\n visitedNodes.add(neighbor); // then, mark the neighbor as visited\n }\n }\n }\n }\n return null; // No destination found\n }","protected LinkedList<IVertex<String>> getPath(IVertex<String> target) {\n\n LinkedList<IVertex<String>> path = new LinkedList<IVertex<String>>();\n\n IVertex<String> step = target;\n\n // check if a path exists\n if (predecessors.get(step) == null) {\n return null;\n }\n path.add(step);\n while (predecessors.get(step) != null) {\n step = predecessors.get(step);\n path.add(step);\n }\n // Put it into the correct order\n Collections.reverse(path);\n return path;\n }","private Queue<Position> pathToClosest(MyAgentState state, Position start, int goal) {\n\t\tQueue<Position> frontier = new LinkedList<Position>();\n\t\tSet<String> enqueued = new HashSet<String>();\n\t\tMap<Position, Position> preceedes = new HashMap<Position, Position>();\n\t\tfrontier.add(start);\n\t\tenqueued.add(start.toString());\n\n\t\twhile (!frontier.isEmpty()) {\n\t\t\tPosition pos = frontier.remove();\n\t\t\tif (state.getTileData(pos) == goal) {\n\t\t\t\treturn toQueue(preceedes, pos, start);\n\t\t\t}\n\t\t\t\n\t\t\tfor (Position neighbour : pos.neighbours()) {\n\t\t\t\tif (!enqueued.contains(neighbour.toString()) && state.getTileData(neighbour) != state.WALL) {\n\t\t\t\t\tpreceedes.put(neighbour, pos);\n\t\t\t\t\tfrontier.add(neighbour);\n\t\t\t\t\tenqueued.add(neighbour.toString());\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn null;\n\t}","@Nullable\n public VertexPath<V> findAnyVertexPath(@Nonnull DirectedGraph<V, A> graph,\n V start, V goal) {\n Deque<V> vertices = new ArrayDeque<>();\n BackLinkWithArrow<V, A> current = breadthFirstSearch(graph, start, goal);\n if (current == null) {\n return null;\n }\n for (BackLinkWithArrow<V, A> i = current; i != null; i = i.parent) {\n vertices.addFirst(i.vertex);\n }\n return new VertexPath<>(vertices);\n }","private static boolean getPath(int startRow, int startColumn, String[][] Map, String outputFile, String inputFile) {\n\t\tQueue<Node> q = new LinkedList<Node>();\t\t\t\t\r\n\t\t\r\n\t\t//Sets the Start Node Row and Column values.\r\n\t\tNode Start = new Node(startRow + \" \" + startColumn);\r\n\t\tStart.column = startColumn;\r\n\t\tStart.row = startRow;\r\n\t\t\r\n\t\t//This is the up, left, right, and down coordinates for searching neighboring items.\r\n\t\tint[]dx = {0, 0, -1, 1};\r\n\t\tint[]dy = {-1, 1, 0, 0};\r\n\t\t\r\n\r\n\t\t//Adds the Start Node to the Queue.\r\n\t\tq.add(Start);\r\n\t\twhile(q.size() > 0)\r\n\t\t{\r\n\t\t\t//This takes the first item in the Queue for comparing and looking at its neighbors.\r\n\t\t\tNode x = q.poll();\r\n\t\t\t\r\n\t\t\tif(x.visited != 1)\r\n\t\t\t{\r\n\t\t\t\t\r\n\t\t\t//If the current node is the Goal, then it retraces it's steps (cameFrom) and prints out the path onto the 2d array named Map.\r\n\t\t\tif (Map[x.row][x.column].compareTo(\"G\") == 0)\r\n\t\t\t\t\t{\r\n\t\t\t\t\twhile (x.cameFrom != null)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tif (Map[x.row][x.column].compareTo(\"G\") != 0)\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\tMap[x.row][x.column] = \".\";\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tx = x.cameFrom;\r\n\t\t\t\t\t}\t\t\t\t\t\r\n\t\t\t\t\ttry {\r\n\t\t\t\t\t\t//Here is where it writes the solution and maze to a text file.\r\n\t\t\t\t\t\tFile file = new File(outputFile);\r\n\r\n\t\t\t\t\t\tif (!file.exists()) {\r\n\t\t\t\t\t\t\tfile.createNewFile();\r\n\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\tFileWriter fw = new FileWriter(file.getAbsoluteFile());\r\n\t\t\t\t\t\tBufferedWriter bw = new BufferedWriter(fw);\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tFile text = new File(inputFile);\r\n\t\t\t\t\t\tScanner rowColumn;\r\n\t\t\t\t\t\ttry {\r\n\t\t\t\t\t\t\trowColumn = new Scanner(text);\r\n\t\t\t\t\t\t\tString row = rowColumn.next();\r\n\t\t\t\t\t\t\tString row2 = rowColumn.next();\r\n\t\t\t\t\t\t\tbw.write(row + \" \" + row2 + \"\\n\");\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t} catch (FileNotFoundException e) {\r\n\t\t\t\t\t\t\t// TODO Auto-generated catch block\r\n\t\t\t\t\t\t\te.printStackTrace();\r\n\t\t\t\t\t\t}\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tfor(int i = 0; i < Map.length; i++)\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\tfor(int j = 0; j < Map[0].length; j++)\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tbw.write(Map[i][j]);\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\tbw.write(\"\\n\");\r\n\t\t\t\t\t\t}\t\t\t\t\t\t\r\n\t\t\t\t\t\tbw.close();\r\n\r\n\t\t\t\t\t} catch (IOException e) {\r\n\t\t\t\t\t\te.printStackTrace();\r\n\t\t\t\t\t}\r\n\t\t\t\t\t\r\n\t\t\t\t\treturn true;\r\n\t\t\t\t\t}\r\n\t\t\t\r\n\t\t\t//This checks the up, left, right, and down values of the current Node.\r\n\t\t\tfor(int i = 0; i < 4; i++)\r\n\t\t\t{\r\n\t\t\t\tint yy = x.row + dx[i];\r\n\t\t\t\tint xx = x.column + dy[i];\r\n\t\t\t\r\n\t\t\t\tif(xx >= 1 && yy >= 1)\r\n\t\t\t\t{\r\n\t\t\t\t\r\n\t\t\t\t\tif(Map[yy][xx].compareTo(\" \") == 0 && Map[yy][xx].compareTo(\"X\") != 0 && (x.visited != 1) || Map[yy][xx].compareTo(\"G\") == 0)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tboolean on = true;\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t//This checks the Queue and makes sure the current item isn't in there. \r\n\t\t\t\t\t\t//If it is, then it turns off the switch. \r\n\t\t\t\t\t\tfor(Node I: q)\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\tif (I.column == xx && I.row == yy)\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\ton = false;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tif (on == true)\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t//If a node hasn't been looked at yet, it creates a node for it and adds it to the Queue. \r\n\t\t\t\t\t\tNode Neighbor = new Node(yy + \" \" + xx);\r\n\t\t\t\t\t\tNeighbor.column = xx;\r\n\t\t\t\t\t\tNeighbor.row = yy;\r\n\t\t\t\t\t\tNeighbor.cameFrom = x;\r\n\t\t\t\t\t\tq.add(Neighbor);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\t//Turns the switch back on after the ForEach loop\r\n\t\t\t\t\t\ton = true;\t\t\t\t\t\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t}\r\n\t\t\t\r\n\t\t\t//Here is where I'm trying to check if all the Nodes in the Queue have been visited,\r\n\t\t\t//If so, then it will return false because there is no path. Not currently working though. \r\n\t\t\tx.visited = 1;\r\n\t\t\tint counter = 0;\r\n\t\t\tfor(Node temp: q)\r\n\t\t\t{\r\n\t\t\t\tif (temp.visited == 1)\r\n\t\t\t\t\t{\r\n\t\t\t\t\tcounter++;\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t}\r\n\t\t\t\tif (q.size() == counter)\r\n\t\t\t\t\t{\r\n\t\t\t\t\treturn false;\r\n\t\t\t\t\t}\r\n\t\t\t}\r\n\t}\t\t\r\n\t\treturn false;\r\n\t}","private HashMap<String, Integer> getShortestPathBetweenDifferentNodes(Node start, Node end) {\n HashMap<Node, Node> parentChildMap = new HashMap<>();\n parentChildMap.put(start, null);\n\n // Shortest path between nodes\n HashMap<Node, Integer> shortestPathMap = new HashMap<>();\n\n for (Node node : getNodes()) {\n if (node == start)\n shortestPathMap.put(start, 0);\n else shortestPathMap.put(node, Integer.MAX_VALUE);\n }\n\n for (Edge edge : start.getEdges()) {\n shortestPathMap.put(edge.getDestination(), edge.getWeight());\n parentChildMap.put(edge.getDestination(), start);\n }\n\n while (true) {\n Node currentNode = closestUnvisitedNeighbour(shortestPathMap);\n\n if (currentNode == null) {\n return null;\n }\n\n // Save path to nearest unvisited node\n if (currentNode == end) {\n Node child = end;\n String path = end.getName();\n while (true) {\n Node parent = parentChildMap.get(child);\n if (parent == null) {\n break;\n }\n\n // Create path using previous(parent) and current(child) node\n path = parent.getName() + \"\" + path;\n child = parent;\n }\n HashMap<String,Integer> hm= new HashMap<>();\n hm.put(path, shortestPathMap.get(end));\n return hm;\n }\n currentNode.visit();\n\n // Go trough edges and find nearest\n for (Edge edge : currentNode.getEdges()) {\n if (edge.getDestination().isVisited())\n continue;\n\n if (shortestPathMap.get(currentNode) + edge.getWeight() < shortestPathMap.get(edge.getDestination())) {\n shortestPathMap.put(edge.getDestination(), shortestPathMap.get(currentNode) + edge.getWeight());\n parentChildMap.put(edge.getDestination(), currentNode);\n }\n }\n }\n }","private void findPath(int current){\r\n // remove current from OPEN\r\n int index = insideArray(_openSet,current);\r\n if(index == -1){\r\n System.out.println(\"findPath method returns -1.\");\r\n }\r\n _openSet.remove(index);\r\n\r\n // add current to CLOSED\r\n _closedSet.add(current);\r\n\r\n // if current is the target node\r\n if(current == _endIndex){\r\n return;\r\n }\r\n\r\n int neighborNum = _map.get_grid(current).get_neighborNum();\r\n int[] neighbors = _map.get_grid(current).get_neighbors();\r\n\r\n //for each neighbor of the current node\r\n for(int i=0;i<neighborNum;i++){\r\n Grid neighborGrid = _map.get_grid(neighbors[i]);\r\n // if neighbor is not traversable or neighbor is in CLOSED\r\n // SKIP THIS NEIGHBOR\r\n if(!neighborGrid.get_type().equals(\"|\") && insideArray(_closedSet,neighbors[i]) == -1){\r\n int currentNeighborF = neighborGrid.get_Fnum();\r\n int neighborF = findF(neighbors[i]);\r\n if(neighborF < currentNeighborF || insideArray(_closedSet,neighbors[i]) == -1){\r\n neighborGrid.set_Fnum(neighborF);\r\n neighborGrid.set_parent(current);\r\n if(insideArray(_closedSet,neighbors[i]) == -1){\r\n _openSet.add(neighbors[i]);\r\n }\r\n }\r\n }\r\n }\r\n int currentIndex = smallestF();\r\n // RECURSIVE CALL\r\n findPath(_map.get_grid(_openSet.get(currentIndex)).get_index());\r\n }","private List<Edge<T>> getPath(T target) {\n List<Edge<T>> path = new LinkedList<>();\n T step = target;\n // check if a path exists\n if (predecessors.get(step) == null) {\n return path;\n }\n while (predecessors.get(step) != null) {\n T endVertex = step;\n step = predecessors.get(step);\n T startVertex = step;\n path.add(getEdge(startVertex, endVertex));\n }\n // Put it into the correct order\n Collections.reverse(path);\n return path;\n }","public LinkedList<GraphNode> getPath(GraphNode startNode, GraphNode goalNode, boolean useStairs) throws PathNotFoundException {\n return currentPathingAlgorithm.findPath(startNode, goalNode, useStairs);\n }","public void printShortestPath() {\n Cell[][] grid = maze.getGrid();\n\n for (int i = 0; i <= r; i++) {\n // Rows: This loop needs to iterate r times since there are r rows\n for (int j = 0; j < r; j++) {\n Cell currentCell;\n if (i == r) { // If it is on the last row, print the bottom row of the cells\n currentCell = grid[i - 1][j];\n System.out.print(currentCell.bottomRow());\n } else { // If it's not on the last row, print the top row of the cells\n currentCell = grid[i][j];\n System.out.print(currentCell.topRow());\n }\n }\n System.out.print(\"+\");\n System.out.println();\n\n // This loop only needs to iterate r-1 times since there is only r-1 \"|\" rows\n if (i != r) {\n for (int k = 0; k < r; k++) {\n Cell currentCell = grid[i][k];\n if ((i == 0 && k == 0))\n System.out.print(currentCell.zeroDistanceColumn2());\n else if (parents.contains(currentCell))\n System.out.print(currentCell.zeroDistanceColumn2());\n else\n System.out.print(currentCell.distanceColumn2());\n }\n System.out.print(\"|\");\n System.out.println();\n }\n }\n }","public List<Node> getShortestPathToDestination(Node destination) {\n List<Node> path = new ArrayList<Node>();\n\n\n\n for (Node node = destination; node != null; node = node.previous){\n Log.i(\"bbb\", \"get path \"+node._waypointName);\n path.add(node);\n }\n\n // reverse path to get correct order\n Collections.reverse(path);\n return path;\n }","private void goForSolution(MinPQ<Node> hq) {\n\t\tNode current = hq.delMin();\n\t\tif (current.board.isGoal()) {\n\t\t\tif (hq == orig) {\n\t\t\t\tresult = new ArrayList<>();\n\t\t\t\twhile (current != null) {\n\t\t\t\t\tresult.add(0, current.board);\n\t\t\t\t\tcurrent = current.parent;\n\t\t\t\t}\n\t\t\t}\n\t\t\tsolved = true;\n\t\t\treturn;\n\t\t}\n\n\t\tfor (Board neighbour : current.board.neighbors()) {\n\t\t\tif (current.parent == null || !neighbour.equals(current.parent.board)) {\n\t\t\t\thq.insert(new Node(neighbour, current.moves + 1, current));\n\t\t\t}\n\t\t}\n\t}","private static void findShortestPath(ArrayList<WeightedEdge> edges, int start, int dest, int nNodes) {\n int costs[] = new int[nNodes];\n int parents[] = new int[nNodes];\n boolean doneWithNode[] = new boolean[nNodes];\n\n // cost[i] has the cost of getting to node number i or is UNKNOWN if no cost figure out yet.\n // parent[i] contains the parent (or the way) we got to node i.\n // done[i] is true if we've already worked on all the children of node i.\n\n // Initialize the arrays.\n for (int i = 0; i<nNodes; i++) {\n costs[i] = UNKNOWN;\n parents[i] = UNKNOWN;\n doneWithNode[i] = false;\n }\n\n int node = start; // This is the node we are working on. Let's start with start node.\n costs[node] = 0; // The cost of getting to the start node is 0!\n\n // While not done processing all the nodes...\n\n // Loop through all the edges (edges array list).\n // Skip those edges whose source is doesn't match the node we're working on.\n\n // For edge (that has source of current node) figure out potential to\n // get it. (How much does it cost to get to node we're on? Add to\n // that the cost of the edge. That's the new price to set to dest of edge.\n\n // Is that a new low cost for that dest edge node?\n // Or is the dest edge node cost currently UNKNOWN? That means we have no cost.\n // If so, store the cost. Store the parent.\n\n // Once done with all the edges, mark the current node as\n // done being processed.\n doneWithNode[node] = true;\n\n // Get next node to work on.\n node = getLowestCostUnprocessedNode(costs, doneWithNode);\n\n // Done with while loop\n\n for (int i=0; i<parents.length; i++) {\n System.out.println(\"Node: \" + i + \" Cost: \" + costs[i] + \" Backtrace Parent: \" + parents[i]);\n }\n\n backtrace(dest, parents);\n }","private PathCostFlow findCheapestPath(int start, int end, double max_flow) throws Exception {\n if (getNode(start) == null || getNode(end) == null\n || !getNode(start).isSource() || getNode(end).isSource()) {\n throw new IllegalArgumentException(\"start must be the index of a source and end must be the index of a sink\");\n }\n double amount = Math.min(Math.min(getNode(start).getResidualCapacity(),\n getNode(end).getResidualCapacity()), max_flow);\n\n boolean[] visited = new boolean[n];\n int[] parent = new int[n];\n for (int i = 0; i < n; i++) {\n parent[i] = -1;\n }\n double[] cost = new double[n];\n for (int i = 0; i < n; i++) {\n cost[i] = Integer.MAX_VALUE;\n }\n cost[start] = 0;\n\n PriorityQueue<IndexCostTuple> queue = new PriorityQueue<IndexCostTuple>();\n queue.add(new IndexCostTuple(start, 0));\n\n while (!queue.isEmpty()) {\n IndexCostTuple current = queue.poll();\n\n // we found the target node\n if (current.getIndex() == end) {\n ArrayList<Integer> path = new ArrayList<Integer>();\n path.add(new Integer(end));\n while (path.get(path.size() - 1) != start) {\n path.add(parent[path.get(path.size() - 1)]);\n }\n Collections.reverse(path);\n if ((path.get(0) != start) || (path.get(path.size() - 1) != end)) {\n throw new Exception(\"I fucked up coding Dijkstra's\");\n }\n return new PathCostFlow(path, cost[end], amount);\n }\n\n // iterate through all possible neighbors of the current node\n for (int i = 0; i < n; i++) {\n SingleEdge e = matrix[current.getIndex()][i];\n if ((!visited[i]) && (e != null)\n && (current.getCost() + e.getCost(amount) < cost[i])) {\n cost[i] = current.getCost() + e.getCost(amount);\n parent[i] = current.getIndex();\n\n // update the entry for this node in the queue\n IndexCostTuple newCost = new IndexCostTuple(i, cost[i]);\n queue.remove(newCost);\n queue.add(newCost);\n }\n }\n visited[current.getIndex()] = true;\n }\n\n return null; //the target node was unreachable\n }","private List<Node> getIntermediatePath(final Node source, final Node target) {\n if (P[source.id][target.id] == null) {\n return new ArrayList<Node>();\n }\n final List<Node> path = new ArrayList<Node>();\n path.addAll(getIntermediatePath(source, P[source.id][target.id]));\n path.add(P[source.id][target.id]);\n path.addAll(getIntermediatePath(P[source.id][target.id], target));\n return path;\n }","public Square[] buildPath(GameBoard board, Player player) {\n\n // flag to check if we hit a goal location\n boolean goalVertex = false;\n\n // Queue of vertices to be checked\n Queue<Vertex> q = new LinkedList<Vertex>();\n\n // set each vertex to have a distance of -1\n for ( int i = 0; i < graph.length; i++ )\n graph[i] = new Vertex(i,-1);\n\n // get the start location, i.e. the player's location\n Vertex start = \n squareToVertex(board.getPlayerLoc(player.getPlayerNo()));\n start.dist = 0;\n q.add(start);\n\n // while there are still vertices to check\n while ( !goalVertex ) {\n\n // get the vertex and remove it;\n // we don't want to look at it again\n Vertex v = q.remove();\n\n // check if this vertex is at a goal row\n switch ( player.getPlayerNo() ) {\n case 0: if ( v.graphLoc >= 72 ) \n goalVertex = true; break;\n case 1: if ( v.graphLoc <= 8 ) \n goalVertex = true; break;\n case 2: if ( (v.graphLoc+1) % GameBoard.COLUMNS == 0 )\n goalVertex = true; break;\n case 3: if ( v.graphLoc % GameBoard.COLUMNS == 0 )\n goalVertex = true; break;\n }\n\n // if we're at a goal vertex, we don't need to calculate\n // its neighboors\n if ( !goalVertex ) {\n\n // retrieve all reachable ajacencies\n Square[] adjacencies = reachableAdjacentSquares\n (board, vertexToSquare(v, board), player.getPlayerNo());\n\n // for each adjacency...\n for ( Square s : adjacencies ) {\n\n // convert to graph location\n Vertex adjacent = squareToVertex(s); \n\n // modify the vertex if it hasn't been modified\n if ( adjacent.dist < 0 ) {\n adjacent.dist = v.dist+1;\n adjacent.path = v;\n q.add(adjacent);\n }\n }\n\n }\n else\n return returnPath(v,board);\n \n }\n // should never get here\n return null;\n }","private void identifySuccessors(T node, T goal, Set<T> goals, Queue<T> open, Set<T> closed, Map<T, T> parentMap,\n Map<T, Double> fMap, Map<T, Double> gMap, Map<T, Double> hMap) {\n // get all neighbors to the current node\n Collection<T> neighbors = findNeighbors(node, parentMap);\n\n double d;\n double ng;\n for (T neighbor : neighbors) {\n // jump in the direction of our neighbor\n T jumpNode = jump(neighbor, node, goals);\n\n // don't add a node we have already gotten to quicker\n if (jumpNode == null || closed.contains(jumpNode)) continue;\n\n // determine the jumpNode's distance from the start along the current path\n d = graph.getDistance(jumpNode, node);\n ng = gMap.getOrDefault(node, 0d) + d;\n\n // if the node has already been opened and this is a shorter path, update it\n // if it hasn't been opened, mark as open and update it\n if (!open.contains(jumpNode) || ng < gMap.getOrDefault(jumpNode, 0d)) {\n gMap.put(jumpNode, ng);\n hMap.put(jumpNode, graph.getHeuristicDistance(jumpNode, goal));\n fMap.put(jumpNode, gMap.getOrDefault(jumpNode, 0d) + hMap.getOrDefault(jumpNode, 0d));\n //System.out.println(\"jumpNode: \" + jumpNode.x + \",\" + jumpNode.y + \" f: \" + fMap.get(jumpNode));\n parentMap.put(jumpNode, node);\n\n if (!open.contains(jumpNode)) {\n open.offer(jumpNode);\n }\n }\n }\n }","Path getPathFromNodeTo(Node destination);","@Override\n public List dijkstrasShortestPath(T start, T end) {\n Vertex<T> origin = new Vertex<>(start);\n Vertex<T> destination = new Vertex<>(end);\n List<Vertex<T>> path;\n\n settledNodes = new HashSet<>();\n unSettledNodes = new HashSet<>();\n distancesBetweenNodes = new HashMap<>();\n predecessors = new HashMap<>();\n\n distancesBetweenNodes.put(origin,0);\n unSettledNodes.add(origin);\n\n while(unSettledNodes.size() > 0){\n Vertex<T> minimumWeightedVertex = getMinimum(unSettledNodes);\n settledNodes.add(minimumWeightedVertex);\n unSettledNodes.remove(minimumWeightedVertex);\n findMinimumDistance(minimumWeightedVertex);\n }\n path = getPath(destination);\n return path;\n\n }","public ArrayList<Vertex> findPath() {\n \n //if we've already been through findPath, then just return it\n if (solutionCalculated) {\n return solution;\n }\n \n //instantiate path\n solution = new ArrayList<Vertex>();\n \n //create boolean array of visited nodes (default: false)\n boolean[] visited = new boolean[arrayOfVertices.length];\n \n //(for testing)\n NavigateMaze.drawMaze(getVertices());\n \n //call dfs\n dfs(visited, arrayOfVertices[0], \n arrayOfVertices[arrayOfVertices.length - 1]);\n \n //update solutionCalculated to true\n solutionCalculated = true;\n \n //return solution\n return solution;\n \n }","public KnightNode getPathByBFS(KnightNode startNode,\n\t\t\tKnightNode finishNode) {\n\t\tif (startNode == null) {\n\t\t\tthrow new IllegalArgumentException(\"start node shouldn't be null!\");\n\t\t}\n\n\t\tif (finishNode == null) {\n\t\t\tthrow new IllegalArgumentException(\"finish node shouldn't be null!\");\n\t\t}\n\n\t\tQueue<KnightNode> queue = new LinkedList<KnightNode>();\n\n\t\t// step 0\n\t\tstartNode.isUsed = true;\n\t\tqueue.add(startNode);\n\t\n\t\twhile (!queue.isEmpty()) {\n\t\t\t// get next node from head of queue\n\t\t\tKnightNode tmpNode = queue.remove();\n\t\t\tSet<KnightNode> childNodes = tmpNode.availableMoves;\n\t\t\tfor (KnightNode tmpChild : childNodes) {\n\t\t\t\ttmpChild = findNode(tmpChild.x, tmpChild.y);\n\t\t\t\t// check if we have already been here\n\t\t\t\tif (!tmpChild.isUsed) {\n\t\t\t\t\ttmpChild.root = tmpNode;\n\t\t\t\t\ttmpChild.isUsed = true;\n\t\t\t\t\tqueue.add(tmpChild);\n\n\t\t\t\t\tif (tmpChild.equals(finishNode)) {\n\t\t\t\t\t\t// we have found our short path\n\t\t\t\t\t\treturn tmpChild;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\n\t\t// path is not exist\n\t\treturn null;\n\t}","private LinkedList<Node> aStarPath() throws PathNotFoundException {\n\n // Set of nodes already evaluated\n List<Node> closedSet = new ArrayList<Node>();\n\n // Set of nodes visited, but not evaluated\n List<Node> openSet = new ArrayList<Node>();\n openSet.add(start);\n\n\n // Map of node with shortest path leading to it\n Map<Node, Node> cameFrom = new HashMap<>();\n\n // Map of cost of navigating from start to node\n Map<Node, Double> costFromStart = new HashMap<>();\n costFromStart.put(start, 0.0);\n\n // Map of cost of navigating path from start to end through node\n Map<Node, Double> costThrough = new HashMap<>();\n costThrough.put(start, heuristic(start, end));\n\n while (!openSet.isEmpty()){\n\n Node current = lowestCostThrough(openSet, costThrough);\n\n if(current.equals(end)){\n return reconstructPath(cameFrom, current);\n }\n\n openSet.remove(current);\n closedSet.add(current);\n\n for(Node neighbor: current.getNodes()) {\n if (closedSet.contains(neighbor)) {\n continue;\n }\n\n double tentativeCost = costFromStart.get(current) + distanceBetween(current, neighbor);\n\n if (!openSet.contains(neighbor)) { // found new neighbor\n openSet.add(neighbor);\n } else if (tentativeCost >= costFromStart.get(neighbor)) { // not a better path\n continue;\n }\n\n cameFrom.put(neighbor, current);\n costFromStart.put(neighbor, tentativeCost);\n costThrough.put(neighbor, tentativeCost + heuristic(neighbor, end));\n\n }\n }\n // no path\n throw pathNotFound;\n }","public LinkedList<City> getPath(City target) {\r\n\r\n\t\tLinkedList<City> path = new LinkedList<City>();\r\n \t\tCity step = target;\r\n\t\t// check if a path exists\r\n\t\tif (predecessors.get(step) == null) {\r\n\t\t\treturn null;\r\n\t\t}\r\n\t\tpath.add(step);\r\n\t\twhile (predecessors.get(step) != null) {\r\n\t\t\tstep = predecessors.get(step);\r\n\t\t\tpath.add(step);\r\n\t\t}\r\n\t\t// Put it into the correct order\r\n\t\tCollections.reverse(path);\r\n\t\treturn path;\r\n\t}","public LinkedList<Vertex> getPath(Vertex target) {\n LinkedList<Vertex> path = new LinkedList<Vertex>();\n Vertex step = target;\n // check if a path exists\n if (predecessors.get(step) == null) {\n return null;\n }\n path.add(step);\n while (predecessors.get(step) != null) {\n step = predecessors.get(step);\n path.add(step);\n }\n // Put it into the correct order\n Collections.reverse(path);\n return path;\n }","public static void main(String[] args) {\n Graph graph = new Graph();\n graph.addEdge(0, 1);\n graph.addEdge(0, 4);\n\n graph.addEdge(1,0);\n graph.addEdge(1,5);\n graph.addEdge(1,2);\n graph.addEdge(2,1);\n graph.addEdge(2,6);\n graph.addEdge(2,3);\n\n graph.addEdge(3,2);\n graph.addEdge(3,7);\n\n graph.addEdge(7,3);\n graph.addEdge(7,6);\n graph.addEdge(7,11);\n\n graph.addEdge(5,1);\n graph.addEdge(5,9);\n graph.addEdge(5,6);\n graph.addEdge(5,4);\n\n graph.addEdge(9,8);\n graph.addEdge(9,5);\n graph.addEdge(9,13);\n graph.addEdge(9,10);\n\n graph.addEdge(13,17);\n graph.addEdge(13,14);\n graph.addEdge(13,9);\n graph.addEdge(13,12);\n\n graph.addEdge(4,0);\n graph.addEdge(4,5);\n graph.addEdge(4,8);\n graph.addEdge(8,4);\n graph.addEdge(8,12);\n graph.addEdge(8,9);\n graph.addEdge(12,8);\n graph.addEdge(12,16);\n graph.addEdge(12,13);\n graph.addEdge(16,12);\n graph.addEdge(16,17);\n graph.addEdge(17,13);\n graph.addEdge(17,16);\n graph.addEdge(17,18);\n\n graph.addEdge(18,17);\n graph.addEdge(18,14);\n graph.addEdge(18,19);\n\n graph.addEdge(19,18);\n graph.addEdge(19,15);\n LinkedList<Integer> visited = new LinkedList();\n List<ArrayList<Integer>> paths = new ArrayList<ArrayList<Integer>>();\n int currentNode = START;\n visited.add(START);\n new searchEasy().findAllPaths(graph, visited, paths, currentNode);\n for(ArrayList<Integer> path : paths){\n for (Integer node : path) {\n System.out.print(node);\n System.out.print(\" \");\n }\n System.out.println();\n }\n }","@Override\n public void solve(Problem p) {\n Queue queue = new LinkedList();\n queue.add(p);\n closeList.add(p);\n\n while (!queue.isEmpty()) {\n\n Problem node = (Problem) queue.remove();\n if (node.isAnswer()) {\n printPath(node);\n return;\n }\n// System.out.println(node);\n node.generateNodes();\n nodesExpanded++;\n for (Iterator<Problem> it = node.nodes.iterator(); it.hasNext();) {\n nodesSeen++;\n Problem problem = it.next();\n if (closeList.contains(problem)) {\n continue;\n }\n problem.visited = true;\n problem.distanceTraveled = node.distanceTraveled + 1;\n// System.out.println(problem.distanceTraveled);\n// System.out.println(problem);\n queue.add(problem);\n closeList.add(problem);\n }\n maxNodes = Math.max(maxNodes, queue.size());\n }\n \n }","public static void getShortestPath()\r\n\t{\r\n\t\tScanner scan = new Scanner(System.in); //instance for input declared\r\n\t\tSystem.out.print(\"\\nPlease enter the Source node for shortest path: \");\r\n\t\tint src = scan.nextInt() - 1;\r\n\t\twhile(src < 0 || src > routers-1)\r\n {\r\n\t\t\tSystem.out.println(\"The entered source node is out of range, please enter again: \"); // Printing error\r\n\t\t\tsrc = scan.nextInt() - 1;\t//re-input source\r\n\t\t}\r\n\t\t\r\n\t\tSystem.out.print(\"Please enter the destination node for shortest path: \");\r\n\t\tint dest = scan.nextInt() - 1;\r\n\t\twhile(dest < 0 || dest > routers-1)\r\n {\r\n\t\t\tSystem.out.println(\"The entered destination node is out of range, please enter again: \"); // Printing error\r\n\t\t\tdest = scan.nextInt() - 1;\t//re-input destination\r\n\t\t}\r\n\t\t\r\n\t\tconnectNetwork(src, dest, true);\r\n\t}","public Iterable<Board> solution() {\n if (!isSolvable())\n return null;\n Stack<Board> solution = new Stack<Board>();\n for (Node s = goal; s != null; s = s.previousNode)\n solution.push(s.board);\n return solution;\n }","public List<Vertex> shortestPath(Vertex start, Vertex end) {\r\n\t\tMap<Vertex, Vertex> backRefs = new HashMap<Vertex, Vertex>();\r\n\r\n\t\t// Create a queue for BFS\r\n\t\tQueue<Vertex> queue = new LinkedList<Vertex>();\r\n\r\n\t\t// Mark the current node as visited and enqueue it. Use backRef as\r\n\t\t// visited set\r\n\t\tqueue.offer(start);\r\n\t\tbackRefs.put(start, null);\r\n\r\n\t\tVertex currentNode;\r\n\t\tSet<Vertex> neighbors;\r\n\r\n\t\twhile (queue.size() != 0) { // or !queue.isEmpty()\r\n\t\t\t// Dequeue a vertex from queue and print it\r\n\t\t\tcurrentNode = queue.poll();\r\n\r\n\t\t\tif (currentNode.equals(end)) {\r\n\t\t\t\tbreak;\r\n\t\t\t}\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\tneighbors = currentNode.getNeighbors();\r\n\r\n\t\t\tfor (Vertex n : neighbors) {\r\n\t\t\t\tif (!backRefs.containsKey(n)) {\r\n\t\t\t\t\tqueue.offer(n);\r\n\t\t\t\t\tbackRefs.put(n, currentNode);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tif (!backRefs.containsKey(end))\r\n\t\t\treturn null;\r\n\r\n\t\tList<Vertex> path = new ArrayList<Vertex>();\r\n\t\tcurrentNode = end;\r\n\r\n\t\twhile (currentNode != null) {\r\n\t\t\tpath.add(currentNode);\r\n\t\t\tcurrentNode = backRefs.get(currentNode);\r\n\t\t}\r\n\r\n\t\tCollections.reverse(path);\r\n\r\n\t\treturn path;\r\n\t}","public void printSolution(Node solution_node)\n\t{\n\t\tArrayList<String> steps = new ArrayList<String>();\n\n\t\twhile (solution_node.parent != null) {\n\t\t\tsteps.add(\"Fill \" + solution_node.action.to + \" with water from \" + \n\t\t\t\t\tsolution_node.action.from + \" (ie. \" + solution_node.action.quantity + \" jugs)\" + \n\t\t\t\t\t\" New state: \" + solution_node.state [0] + \",\" + solution_node.state[1]);\n\n\t\t\tsolution_node = solution_node.parent;\n\t\t} \n\n\t\tSystem.out.println(\"Steps:\");\n\n\t\tsteps.add(\"4 gallon jug has \" + solution_node.state[0] + \" gallons and 3 gallon jug has \" + \n\t\t\t\t\tsolution_node.state[1] + \" gallons\");\n\n\t\twhile (steps.size() > 0) {\n\t\t\tString curr = steps.remove(steps.size() - 1);\n\t\t\tSystem.out.println(curr);\n\t\t}\n\t}","public static List<Vec2i> solve(int[][] grid, Vec2i start, Vec2i goal, Heuristic h){\n if(h == null){ //if null replace with default heuristic\n h = new Heuristic() {\n @Override\n\n public double eval(Vec2i loc) {\n double dx = (loc.x - goal.x);\n double dy = (loc.y - goal.y);\n return Math.sqrt(dx*dx + dy*dy);\n }\n };\n }\n\n PriorityQueue<GridLocation> edge = new PriorityQueue<GridLocation>(10, AStarGrid::compareGridLocations);\n edge.add(new GridLocation(start,0));\n\n Map<Vec2i, Vec2i> cameFrom = new HashMap<Vec2i, Vec2i>();\n Map<Vec2i, Double> g = new HashMap<Vec2i, Double>(); //distance to node\n g.put(start,0.0);\n Map<Vec2i, Double> f = new HashMap<Vec2i, Double>(); //distance from start to goal through this node\n f.put(start,h.eval(start));\n //f = g + h\n\n while(!edge.isEmpty()){\n\n Vec2i current = edge.poll().loc;\n if(current.x == goal.x && current.y == goal.y){\n return reconstructPath(cameFrom, current);\n }\n\n LinkedList<Vec2i> neighbors = new LinkedList<Vec2i>();\n if(current.x != 0 && grid[current.x - 1][current.y] == 0)\n neighbors.add(new Vec2i(current.x - 1,current.y));\n if(current.x != grid.length-1 && grid[current.x + 1][current.y] == 0)\n neighbors.add(new Vec2i(current.x + 1,current.y));\n if(current.y != 0 && grid[current.x][current.y - 1] == 0)\n neighbors.add(new Vec2i(current.x,current.y - 1));\n if(current.y != grid[0].length-1 && grid[current.x][current.y + 1] == 0)\n neighbors.add(new Vec2i(current.x,current.y + 1));\n\n\n for(Vec2i neighbor: neighbors){\n double score = g.get(current) + 1;\n if(!g.containsKey(neighbor) || score < g.get(neighbor)){\n cameFrom.put(neighbor,current);\n g.put(neighbor, score);\n f.put(neighbor, score + h.eval(neighbor));\n if(!edge.contains(neighbor)){\n edge.add(new GridLocation(neighbor,score + h.eval(neighbor)));\n }\n }\n }\n }\n //No path was found\n return null;\n }","private List<List<Edge>> walker(String sourceNode, String destNode, List<Edge> currentPath, List<List<Edge>> paths) {\n if (currentPath == null) {\n currentPath = new ArrayList<>();\n }\n if (paths == null) {\n paths = new ArrayList<>();\n }\n\n if (sourceNode.equals(destNode)) {\n return paths;\n }\n\n\n// List<Edge> edges = findByNodeA(sourceNode);\n List<Edge> edges = allEdges.stream().filter(edge -> edge.nodeA.equals(sourceNode)).collect(Collectors.toList());\n\n\n for (Edge edge : edges) {\n if (!currentPath.contains(edge)&&!containsBidirectionalRef(currentPath,edge)) {\n List<Edge> forkPath = (List<Edge>) ((ArrayList<Edge>) currentPath).clone();\n\n forkPath.add(edge);\n\n if (edge.getNodeB().equals(destNode)) {\n paths.add(forkPath);\n } else {\n walker(edge.getNodeB(), destNode,forkPath,paths);\n }\n }\n }\n\n return paths;\n }","public Node getGoal(){\n return goal;\n }","public KnightNode getPathByDFS(KnightNode startNode,\n\t\t\tKnightNode finishNode) {\n\t\tif (startNode == null) {\n\t\t\tthrow new IllegalArgumentException(\"start node shouldn't be null!\");\n\t\t}\n\n\t\tif (finishNode == null) {\n\t\t\tthrow new IllegalArgumentException(\"finish node shouldn't be null!\");\n\t\t}\n\n\t\tDeque<KnightNode> stack = new LinkedList<KnightNode>();\n\n\t\t// step 0\n\t\tstartNode.isUsed = true;\n\t\tstack.add(startNode);\n\n\t\tnodes.remove(startNode);\n\t\tnodes.add(startNode);\n\n\t\twhile (!stack.isEmpty()) {\n\t\t\t// get next node from head of queue\n\t\t\tKnightNode tmpNode = stack.getLast();\n\t\t\tSet<KnightNode> childNodes = tmpNode.availableMoves;\n\t\t\tfor (KnightNode tmpChild : childNodes) {\n\t\t\t\ttmpChild = findNode(tmpChild.x, tmpChild.y);\n\t\t\t\t// check if we have already been here\n\t\t\t\tif (!tmpChild.isUsed) {\n\t\t\t\t\ttmpChild.root = tmpNode;\n\t\t\t\t\ttmpChild.isUsed = true;\n\t\t\t\t\tstack.add(tmpChild);\n\n\t\t\t\t\tif (tmpChild.equals(finishNode)) {\n\t\t\t\t\t\t// we have found our short path\n\t\t\t\t\t\treturn tmpChild;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\n\t\t// path is not exist\n\t\treturn null;\n\t}","public List<GeographicPoint> dijkstra(GeographicPoint start, \n\t\t\t\t\t\t\t\t\t\t GeographicPoint goal, Consumer<GeographicPoint> nodeSearched)\n\t{\n\t\t// TODO: Implement this method in WEEK 4\n\n\t\t// Hook for visualization. See writeup.\n\t\t//nodeSearched.accept(next.getLocation());\n\t\t\n\t\t//initialize distance of each MapNode from start to infinity\n\t\t\n\t\tSet<GeographicPoint> visited = new HashSet<GeographicPoint>();\n\t\tPriorityQueue<MapNode> queue = new PriorityQueue<MapNode>();\n\t\tHashMap<GeographicPoint, List<GeographicPoint>> path = new HashMap<GeographicPoint, List<GeographicPoint>>();\n\t\tint count = 0;\n\t\t\n\t\tif (!map.containsKey(start) || !map.containsKey(goal))\n\t\t\treturn null;\n\t\t\n\t\tfor (GeographicPoint temp : map.keySet())\n\t\t\tpath.put(temp, new ArrayList<GeographicPoint>());\n\t\t\n\t\tMapNode startNode = map.get(start);\n\t\tstartNode.setTimeToStart(0.0);\n\t\tstartNode.setDistanceToStart(0.0);\n\t\tqueue.add(startNode);\n\t\t\n\t\twhile (!queue.isEmpty()) {\n\t\t\tMapNode currNode = queue.poll();\n\t\t\tnodeSearched.accept(currNode.getLocation());\n\t\t\t\n\t\t\tif (!visited.contains(currNode.getLocation())) {\n\t\t\t\tvisited.add(currNode.getLocation());\n\t\t\t\tcount++;\n\t\t\t\t\n\t\t\t\tif (currNode.getLocation().equals(goal))\n\t\t\t\t\tbreak;\n\t\t\t\t\n\t\t\t\tHashMap<MapEdge, GeographicPoint> neighbours = currNode.getNeighbours();\n\t\t\t\tfor (MapEdge edge : neighbours.keySet()) {\n\t\t\t\t\t\n\t\t\t\t\tif (!visited.contains(edge.getEnd())) {\n\t\t\t\t\t\t\n\t\t\t\t\t\tMapNode addNode = map.get(neighbours.get(edge));\n\t\t\t\t\t\tdouble tempTime = currNode.getTimeToStart() + ((edge.getDistance())/(edge.getSpeedLimit()));\n\t\t\t\t\t\t\n\t\t\t\t\t\tif (tempTime < addNode.getTimeToStart()) {\n\t\t\t\t\t\t\taddNode.setTimeToStart(tempTime);\n\t\t\t\t\t\t\tqueue.add(addNode);\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tList<GeographicPoint> temp = path.get(neighbours.get(edge));\n\t\t\t\t\t\t\ttemp.add(currNode.getLocation());\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\tSystem.out.println(\"Dijkstra: \" + count);\n\t\treturn backTrack(path,goal);\n\t}","public ArrayList<SearchNode> search(Problem p) {\n\tfrontier = new NodeQueue();\t// The frontier is a queue of expanded SearchNodes not processed yet\n\texplored = new HashSet<SearchNode>();\t/// The explored set is a set of nodes that have been processed \n\tGridPos startState = (GridPos) p.getInitialState();\t// The start state is given\n\tfrontier.addNodeToFront(new SearchNode(startState));\t// Initialize the frontier with the start state \n\n\t\n\tpath = new ArrayList<SearchNode>();\t// Path will be empty until we find the goal\n\t\t\n\n\n\twhile(!frontier.isEmpty()){\n\n\t SearchNode s = frontier.removeFirst(); \n\t GridPos g = s.getState(); \n\n\t if ( p.isGoalState(g) ) {\n\t\tpath = s.getPathFromRoot();\t\n\t\tbreak; \n\t }\n\t \n\t explored.add(s); \t \n\t ArrayList<GridPos> childStates = p.getReachableStatesFrom(g);\n\n\t while(!childStates.isEmpty()){\n\n\t\tSearchNode child = new SearchNode(childStates.get(0), s); \n\n\t\tif(!explored.contains(child) && !frontier.contains(child)){\n\n\t\t if ( p.isGoalState(child.getState()) ) {\n\t\t\n\t\t\tpath = child.getPathFromRoot();\t\n\t\t\treturn path; \n\t\t }\n\n\t\t if(insertFront) \n\t\t\tfrontier.addNodeToFront(child); \t\t \t\t\n\t\t else\t\n\t\t\tfrontier.addNodeToBack(child); \t \n\n\n\n\t\t}\n\n\t\tchildStates.remove(0);\n\t }\t \n\t}\n\n\n\treturn path;\n\n }","public LinkedList<Move> search1() {\r\n\r\n while (!paths.isEmpty()) {\r\n\r\n if (logger.isDebugEnabled())\r\n logger.debug(printPathCosts());\r\n\r\n LinkedList<Move> path = paths.first();\r\n if (logger.isDebugEnabled())\r\n logger.debug(\"First path is \" + path);\r\n\r\n if (!paths.remove(path)) {\r\n throw new RuntimeException(\"Failed to remove path\");\r\n }\r\n\r\n Node currentNode = path.getLast().destination;\r\n if (logger.isDebugEnabled())\r\n logger.debug(\"Last site on path is \" + currentNode);\r\n\r\n if (closed.contains(currentNode)) {\r\n if (logger.isDebugEnabled())\r\n logger.debug(\"Site \" + currentNode + \" was closed.\");\r\n continue;\r\n }\r\n if (currentNode.isAtTarget(target)) {\r\n return path;\r\n }\r\n\r\n closed.add(currentNode);\r\n\r\n Move lastMove = path.getLast();\r\n if ( !(lastMove instanceof InitialMove) ) {\r\n currentNode = transformCurrentNode(lastMove);\r\n }\r\n\r\n Set<Move> successors = successors(currentNode);\r\n for (Move y : successors) {\r\n LinkedList<Move> successor = new LinkedList<Move>(path);\r\n y.pathCost = successor.getLast().pathCost + y.edgeCost;\r\n successor.add(y);\r\n paths.add(successor);\r\n if (logger.isDebugEnabled())\r\n logger.debug(\"Added successor \" + y);\r\n nodeExpansionCounter ++;\r\n }\r\n }\r\n\r\n return null;\r\n }","@Override\n\tpublic List<node_data> shortestPath(int src, int dest) {\n\t\tList<node_data> ans = new ArrayList<>();\n\t\tthis.shortestPathDist(src, dest);\n\t\tif(this.GA.getNode(src).getWeight() == Integer.MAX_VALUE || this.GA.getNode(dest).getWeight() == Integer.MAX_VALUE){\n\t\t\tSystem.out.print(\"There is not a path between the nodes.\");\n\t\t\treturn null;\n\t\t}\n\t\tgraph copied = this.copy();\n\t\ttransPose(copied);\n\t\tnode_data first = copied.getNode(dest);\n\t\tans.add(first);\n\t\twhile (first.getKey() != src) {\n\t\t\tCollection<edge_data> temp = copied.getE(first.getKey());\n\t\t\tdouble check= first.getWeight();\n\t\t\tif(temp!=null) {\n\t\t\t\tfor (edge_data edge : temp) {\n\t\t\t\t\tif (copied.getNode(edge.getDest()).getWeight() + edge.getWeight() == check) {\n\t\t\t\t\t\tfirst = copied.getNode(edge.getDest());\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tans.add(first);\n\t\t}\n\t\tList<node_data> ans2 = new ArrayList<>();\n\t\tfor (int i = ans.size()-1;i>=0;i--){\n\t\t\tans2.add(ans.get(i));\n\t\t}\n\t\treturn ans2;\n\t}","public Iterable<Board> solution()\n {\n Iterable<Board> result = null;\n if (isSolvable()) {\n result = shortestPath;\n }\n return result;\n }","public void printMST() {\n\t\t\n\t\tString mstPath = \"\";\n\t\t\n\t\t/**Stores the parent child hierarchy*/\n\t\tint distance[] = new int[this.vertices];\n\t\t\n\t\t/**Stores all the vertices with their distances from source vertex*/\n\t\tMap<Integer, Integer> map = new HashMap<Integer, Integer>();\n\t\tmap.put(0, 0);\n\t\t\n\t\tfor(int i = 1; i < vertices; i++){\n\t\t\tmap.put(i, Integer.MAX_VALUE);\n\t\t}\n\t\t\n\t\tfor(int i = 0; i < vertices; i++){\n\t\t\t\n\t\t\tInteger minVertex = extractMin(map), minValue = map.get(minVertex);\n\t\t\tdistance[minVertex] = minValue;\n\t\t\t\n\t\t\tmstPath += minVertex + \" --> \";\n\t\t\t\n\t\t\t/**Removing min vertex from map*/\n\t\t\tmap.remove(minVertex);\n\t\t\t\n\t\t\t/**Exploring edges of min vertex*/\n\t\t\tArrayList<GraphEdge> edges = this.adjList[minVertex];\n\t\t\tfor(GraphEdge edge : edges){\n\t\t\t\tif(map.containsKey(edge.destination)){\n\t\t\t\t\tif(map.get(edge.destination) > distance[edge.source] + edge.weight){\n\t\t\t\t\t\tmap.put(edge.destination, distance[edge.source] + edge.weight);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tSystem.out.println(mstPath);\n\t}","@Override\n public List<node_info> shortestPath(int src, int dest) {\n int counter=0;//counter for index of listPath\n List<node_info> listPath=new ArrayList<node_info>();//The reverse list that is returned\n List<node_info> listResult=new ArrayList<node_info>();//the returned list\n if(!DijkstraHelp(src,dest)) return null;//if there is no path from src to dest\n if(src==dest) {\n listPath.add(this.ga.getNode(src));\n return listPath;\n }\n //the other case:\n node_info d=this.ga.getNode(dest);\n listPath.add(counter,d);//insert the dest in order to go from destination to source\n //counter++;\n weighted_graph gCopy=copy();\n Iterator<node_info> it=gCopy.getV().iterator();//run on the whole graph\n while(it.hasNext()){\n if(listPath.get(counter).getKey()==src) break;//if we finished\n if(gCopy.getV(listPath.get(counter).getKey()).contains(it.next())) {//remove the nodes that we were already checked if\n //they need to be insert to listPath\n continue;\n }\n Iterator<node_info> currentIt=gCopy.getV(listPath.get(counter).getKey()).iterator();//iterator on the ni-list of the\n //last node were insert to the listPath\n if(currentIt!=null) {\n node_info min=null;\n while (currentIt.hasNext()){\n node_info currentLoop=currentIt.next();\n if(currentLoop.getTag()+gCopy.getEdge(listPath.get(counter).getKey(),currentLoop.getKey())==\n listPath.get(counter).getTag()){//check if this is the node that appropriate to the shortest path\n min=currentLoop;\n }\n }\n listPath.add(min);//insert to listPath\n counter++;\n }\n }\n for(int i=listPath.size()-1;i>=0;i--){\n listResult.add(listPath.size()-i-1,listPath.get(i));//reverse the list\n }\n return listResult;\n }","public ArrayList<Vertex> getPath(Vertex target) {\n\t\tArrayList<Vertex> path = new ArrayList<Vertex>();\n\t\tVertex step = target;\n\t\t// check if a path exists\n\t\tif (predecessors.get(step) == null) {\n\t\t\treturn null;\n\t\t}\n\t\tpath.add(step);\n\t\twhile (predecessors.get(step) != null) {\n\t\t\tstep = predecessors.get(step);\n\t\t\tpath.add(step);\n\t\t}\n\t\t// Put it into the correct order\n\t\tCollections.reverse(path);\n\n\n\t\tVertex current=null;\n\t\tVertex next=null;\n\t\tint length = path.size();\n\t\tfor(int i=0;i<length-1;i++){\n current = path.get(i);\n\t\t\t next = path.get(i+1);\n\t\t\tif(!rapid && (nodeColor_map.get(current.getName()).equalsIgnoreCase(\"dB\")||\n\t\t\t\t\tnodeColor_map.get(next.getName()).equalsIgnoreCase(\"dB\")))\n\t\t\t\trapid = true;\n\t\t\troute_length+= edge_length_map.get(new Pair(current,next));\n\t\t}\n\n\t\treturn path;\n\t}","@Override\r\n public List<T> breadthFirstPath(T start, T end) {\r\n\r\n Vertex<T> startV = vertices.get(start);\r\n Vertex<T> endV = vertices.get(end);\r\n\r\n LinkedList<Vertex<T>> vertexList = new LinkedList<>();\r\n //Set<Vertex<T>> visited = new HashSet<>();\r\n ArrayList<Vertex<T>> visited = new ArrayList<>();\r\n\r\n LinkedList<Vertex<T>> pred = new LinkedList<>();\r\n int currIndex = 0;\r\n\r\n pred.add(null);\r\n\r\n vertexList.add(startV);\r\n visited.add(startV);\r\n\r\n LinkedList<T> path = new LinkedList<>();\r\n\r\n if (breadthFirstSearch(start, end) == false) {\r\n path = new LinkedList<>();\r\n return path;\r\n } else {\r\n while (vertexList.size() > 0) {\r\n Vertex<T> next = vertexList.poll();\r\n if(next == null){\r\n continue;\r\n }\r\n if (next == endV) {\r\n path.add(endV.getValue());\r\n break;\r\n }\r\n for (Vertex<T> neighbor : next.getNeighbors()) {\r\n if (!visited.contains(neighbor)) {\r\n pred.add(next);\r\n visited.add(neighbor);\r\n vertexList.add(neighbor);\r\n }\r\n }\r\n currIndex++;\r\n //path.add(next.getValue());\r\n\r\n }\r\n while (currIndex != 0) {\r\n Vertex<T> parent = pred.get(currIndex);\r\n path.add(parent.getValue());\r\n currIndex = visited.indexOf(parent);\r\n }\r\n }\r\n Collections.reverse(path);\r\n return path;\r\n }","public static void connectNetwork(int src, int dest, boolean printPath)\r\n\t{\r\n\t\tint v = routers;\r\n\t\t\r\n\t\tint parent[] = new int[v];//parent node array\r\n\t\tint dist[] = new int[v];// distance array\r\n\t\tboolean visited[] = new boolean[v];// visited will be either true or false\r\n\t\t\r\n\t\t// initialize parent, distance arrays\r\n\t\tfor (int i = 0; i < v; i++ ) { \r\n\t\t\tvisited[i] = false;\r\n\t\t\tparent[i] = -1;\r\n\t\t\tdist[i] = Integer.MAX_VALUE;\r\n\t\t}\r\n\t\t\r\n\t\t// initialize the source distance as zero\r\n\t\tdist[src] = 0;\r\n\t\t\r\n\t\t// get minimum edge from the unvisited nodes\r\n\t\tfor (int count = 0; count < v-1; count++) { // loop for all v nodes\r\n\t\t\t\r\n\t\t\tint start = -1;\r\n\t\t\tint min = Integer.MAX_VALUE;\r\n\t\t\t\r\n\t\t\tfor (int i = 0; i < v; i++) {\r\n\t\t\t\tif (visited[i] == false && dist[i] < min) {\r\n\t\t\t\t\tmin = dist[i];\r\n\t\t\t\t\tstart = i;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t// minimum distance is computed for all connected edges\r\n\t\t\tif (start == -1) \r\n\t\t\t\tbreak;\r\n\t\t\t\r\n\t\t\t// update the current node as visited\r\n\t\t\tvisited[start] = true;\r\n\t\t\t\r\n\t\t\t// update all adjacent nodes' distance array\r\n\t\t\tfor (int end = 0; end < v; end++) {\r\n\t\t\t\tif ((visited[end] != true) && (graph[start][end] != -1) &&\r\n\t\t\t\t\t\t(dist[start] != Integer.MAX_VALUE) &&\r\n\t\t\t\t\t\t(dist[start] + graph[start][end] < dist[end])) {\r\n\t\t\t\t\t\r\n\t\t\t\t\tdist[end] = dist[start] + graph[start][end];\r\n\t\t\t\t\t\r\n\t\t\t\t\t// start node is the parent node in BFS tree\r\n\t\t\t\t\tparent[end] = start;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t\r\n\t\t}\r\n\t\t\r\n\t\tSystem.out.println();\r\n\t\t\r\n\t\tif (dest != -1) {\r\n\t\t\t\r\n\t\t\t// Case#4: shortest path between source and destination nodes \r\n\t\t\tif (parent[dest] == -1) {\r\n\t\t\t\tSystem.out.println(\"There is no path from \" + (src+1) + \" to \" + (dest+1) + \" exists.\");\r\n\t\t\t} else {\r\n\t\t\t\tSystem.out.println(\"Shortest distance from \" + (src+1) + \" to \" + (dest+1) + \" is: \" + dist[dest]);\r\n\t\t\t\tSystem.out.print(\"Corresponding Shortest Path is: \");\r\n\t\t\t\tprintNodes(parent, parent[dest], src);\r\n\t\t\t\tSystem.out.println(dest+1);\r\n\t\t\t}\r\n\t\t\t\r\n\t\t} else {\r\n\t\t\t\r\n System.out.println(\"The Shortest Distance from node you entered, \"+ (src+1) + \" are\\n\");\r\n //Printing shortest path length\r\n\t\t\tSystem.out.println(\"Destination\\tDistance\\n========================\");\r\n for (int i = 0; i < v; i++) {\r\n System.out.println(\"\\t\"+ (i+1) + \"\\t \"+ dist[i]); // Printing the node number and distance\r\n }\r\n \r\n\t\t\tif (printPath == true) {\r\n\t\t\t\t\r\n\t\t\t\t// case#2: Print all shortest paths from source node\r\n\t\t\t\tfor (int i = 0; i < v; i++) {\r\n\t\t\t\t\tif (i == src)\r\n\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\telse if (parent[i] == -1) {\r\n\t\t\t\t\t\tSystem.out.println(\"Shortest path from \" + (src+1) + \" to \" + (i+1) + \" doesn't exist.\");\r\n\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t}\r\n\t\t\t\t\t\r\n\t\t\t\t\tSystem.out.print(\"Shortest Path from \" + (src+1) + \" to \" + (i+1) + \" is: \");\r\n\t\t\t\t\tprintNodes(parent, parent[i], src);\r\n\t\t\t\t\tSystem.out.println(i+1);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\t}","private NodePath<T> collectPathNodes( WeightedGraph<T> graph, Object startNodeId, Object endNodeId ) {\n\t\tArrayDeque<Node<T>> deque = new ArrayDeque<>( searchNodes.size() );\n\t\tNode<T> startNode = graph.getNode( startNodeId );\n\t\tNode<T> endNode = graph.getNode( endNodeId );\n\t\tSearchNode<T> node = getSearchNode( endNode );\n\n\t\t//\tkeep this before we flush the maps\n\t\tfinal int finalDistance = node.getDistance();\n\n\t\t//\twalk backwards through the \"previous\" links\n\t\tdo {\n\t\t\tdeque.push( node.getNode() );\n\t\t}\n\t\twhile ( (node = getSearchNode( node.getPrevious() )) != null && ! node.equals( startNode ) );\n\t\tdeque.push( startNode );\n\n\t\tclearSearchNodes();\n\t\treturn new NodePath<>( new ArrayList<>( deque ), finalDistance );\n\t}","private void findPath1(List<Coordinate> path) {\n\n // records the start coordinate in a specific sequence.\n ArrayList<Coordinate> starts = new ArrayList<>();\n // records the end coordinate in a specific sequence.\n ArrayList<Coordinate> ends = new ArrayList<>();\n // records the total cost of the path in a specific sequence.\n ArrayList<Integer> cost = new ArrayList<>();\n\n for (Coordinate o1 : originCells) {\n for (Coordinate d1 : destCells) {\n Graph graph = new Graph(getEdge(map));\n graph.dijkstra(o1);\n graph.printPath(d1);\n starts.add(o1);\n ends.add(d1);\n cost.add(graph.getPathCost(d1));\n }\n }\n int index = getMinIndex(cost);\n\n Graph graph = new Graph(getEdge(map));\n graph.dijkstra(starts.get(index));\n graph.printPath(ends.get(index));\n for (Graph.Node node : graph.getPathReference()) {\n path.add(node.coordinate);\n }\n setSuccess(path);\n }","public void dfsPrint(Node start){\n Stack<Node> stack = new Stack<>();\n Set<Node> visited = new HashSet<>(); //we can use integer for better space\n\n stack.push(start);\n while (!stack.isEmpty()){\n Node curr = stack.pop();\n if(!visited.contains(curr)){\n visited.add(curr);\n //do something\n }\n for(Node n: curr.adj){\n if(!visited.contains(n)){\n stack.push(n);\n }\n }\n }\n }","public void solve() {\n /** To solve the traveling salesman problem:\n * Set up the graph, choose a starting node, then call the recursive backtracking method and pass it the starting node.\n */\n\n // We need to pass a starting node to recursive backtracking method\n Node startNode = null;\n\n // Grab a node, any node...\n for( Node n : graph.nodes() ) {\n startNode = n;\n break;\n }\n\n // Visit the first node\n startNode.visit();\n\n // Add first node to the route\n this.route[0] = startNode;\n\n // Pass the number of choices made\n int nchoices = 1;\n\n // Recursive backtracking\n explore(startNode, nchoices );\n\n\n }","ShortestPath(UndirectedWeightedGraph graph, String startNodeId, String endNodeId) throws NotFoundNodeException {\r\n\t\t\r\n\t\tif (!graph.containsNode(startNodeId)) {\r\n\t\t\tthrow new NotFoundNodeException(graph, startNodeId);\r\n\t\t}\t\t\r\n\t\tif (!graph.containsNode(endNodeId)) {\r\n\t\t\tthrow new NotFoundNodeException(graph, endNodeId);\r\n\t\t}\t\r\n\r\n\t\tsrc = startNodeId;\r\n\t\tdst = endNodeId;\r\n\t\t\r\n\t\tif (endNodeId.equals(startNodeId)) {\r\n\t\t\tlength = 0;\r\n\t\t\tnumOfPath = 1;\r\n\t\t\tArrayList<String> path = new ArrayList<String>();\r\n\t\t\tpath.add(startNodeId);\r\n\t\t\tpathList.add(path);\r\n\t\t}\r\n\t\telse {\r\n\t\t\t// create a HashMap of updated distance from the starting node to every node\r\n\t\t\t// initially it is 0, inf, inf, inf, ...\r\n\t\t\tHashMap<String, Double> distance = new HashMap<String, Double>();\t\r\n\t\t\tfor (String nodeId : graph.getNodeList().keySet()) {\r\n\t\t\t\tif (nodeId.equals(startNodeId)) {\r\n\t\t\t\t\t// the starting node will always have 0 distance from itself\r\n\t\t\t\t\tdistance.put(nodeId, 0.0);\r\n\t\t\t\t}\r\n\t\t\t\telse {\r\n\t\t\t\t\t// the others have initial distance is infinity\r\n\t\t\t\t\tdistance.put(nodeId, Double.MAX_VALUE);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t// a HashMap of preceding node of each node\r\n\t\t\tHashMap<String, HashSet<String>> precedence = new HashMap<String, HashSet<String>>();\r\n\t\t\tfor (String nodeId : graph.getNodeList().keySet()) {\r\n\t\t\t\tif ( nodeId.equals(startNodeId) ) {\r\n\t\t\t\t\tprecedence.put(nodeId, null);\t// the start node will have no preceding node\r\n\t\t\t\t}\r\n\t\t\t\telse { \r\n\t\t\t\t\tprecedence.put(nodeId, new HashSet<String>());\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t//\r\n\t\t\tSet<String> unvisitedNode = new HashSet<String>();\r\n\t\t\tfor (String nodeId : graph.getNodeList().keySet()) {\r\n\t\t\t\tunvisitedNode.add(nodeId);\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\tdouble minUnvisitedLength;\r\n\t\t\tString minUnvisitedNode;\r\n\t\t\t// run loop while not all node is visited\r\n\t\t\twhile ( unvisitedNode.size() != 0 ) {\r\n\t\t\t\t// find the unvisited node with minimum current distance in distance list\r\n\t\t\t\tminUnvisitedLength = Double.MAX_VALUE;\r\n\t\t\t\tminUnvisitedNode = \"\";\r\n\t\t\t\tfor (String nodeId : unvisitedNode) {\r\n\t\t\t\t\tif (distance.get(nodeId) < minUnvisitedLength) {\r\n\t\t\t\t\t\tminUnvisitedNode = nodeId;\r\n\t\t\t\t\t\tminUnvisitedLength = distance.get(nodeId); \r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\t// if there are no node that can be visited from the unvisitedNode, break the loop \r\n\t\t\t\tif (minUnvisitedLength == Double.MAX_VALUE) {\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\t\t\t\r\n\t\t\t\t\r\n\t\t\t\t// remove the node from unvisitedNode\r\n\t\t\t\tunvisitedNode.remove(minUnvisitedNode);\r\n\t\t\t\t\r\n\t\t\t\t// update the distance of its neighbors\r\n\t\t\t\tfor (Node neighborNode : graph.getNodeList().get(minUnvisitedNode).getNeighbors().keySet()) {\r\n\t\t\t\t\tdouble distanceFromTheMinNode = distance.get(minUnvisitedNode) + graph.getNodeList().get(minUnvisitedNode).getNeighbors().get(neighborNode).getWeight();\r\n\t\t\t\t\t// if the distance of the neighbor can be shorter from the current node, change \r\n\t\t\t\t\t// its details in distance and precedence\r\n\t\t\t\t\tif ( distanceFromTheMinNode < distance.get(neighborNode.getId()) ) {\r\n\t\t\t\t\t\tdistance.replace(neighborNode.getId(), distanceFromTheMinNode);\r\n\t\t\t\t\t\t// renew the precedence of the neighbor node\r\n\t\t\t\t\t\tprecedence.put(neighborNode.getId(), new HashSet<String>());\r\n\t\t\t\t\t\tprecedence.get(neighborNode.getId()).add(minUnvisitedNode);\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse if (distanceFromTheMinNode == distance.get(neighborNode.getId())) {\r\n\t\t\t\t\t\t// unlike dijkstra's algorithm, multiple path should be update into the precedence\r\n\t\t\t\t\t\t// if from another node the distance is the same, add it to the precedence\r\n\t\t\t\t\t\tprecedence.get(neighborNode.getId()).add(minUnvisitedNode);\r\n\t\t\t\t\t}\r\n\t\t\t\t}\t\t\t\r\n\t\t\t\t\r\n\t\t\t\t// if the current node in the process is the end node, we can stop the while loop here\r\n\t\t\t\tif (minUnvisitedNode == endNodeId) {\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t\t\t\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t\r\n\t\t\t\r\n\t\t\tif (distance.get(endNodeId) == Double.MAX_VALUE) {\r\n\t\t\t\t// in case there is no shortest path between the 2 nodes\r\n\t\t\t\tlength = 0;\r\n\t\t\t\tnumOfPath = 0;\r\n\t\t\t\tpathList = null;\r\n\t\t\t}\r\n\t\t\telse {\r\n\t\t\t\t// other wise we have these information\r\n\t\t\t\tlength = distance.get(endNodeId);\r\n\t\t\t\t//numOfPath = this.getNumPath(precedence, startNodeId, endNodeId);\r\n\t\t\t\tpathList = this.findPathList(precedence, startNodeId, endNodeId);\r\n\t\t\t\tnumOfPath = pathList.size();\r\n\t\t\t}\r\n\t\t\t\r\n\t\t}\t// END ELSE\t\t\r\n\t}","@Override\n\tpublic boolean findPath(PathfindingNode start, PathfindingNode end, ArrayList<PathfindingNode> path) \n\t{\n\t\tpath.clear();\n\t\t\n\t\t_visited.clear();\n\t\t_toVisit.clear();\n\t\t_parents.clear();\n\t\t_costsFromStart.clear();\n\t\t_totalCosts.clear();\n\n\t\t_costsFromStart.put(start, 0);\n\t\t_toVisit.add(start);\n\t\t_parents.put(start, null);\n\t\t\n\t\twhile (!_toVisit.isEmpty() && !_toVisit.contains(end))\n\t\t{\n\t\t\tPathfindingNode m = _toVisit.remove();\n\t\t\t\n\t\t\tint mCost = _costsFromStart.get(m);\n\t\t\t\n\t\t\tfor (int i = 0; i < m.getNeighbors().size(); ++i)\n\t\t\t{\n\t\t\t\tPathfindingNodeEdge n = m.getNeighbors().get(i);\n\t\t\t\tif (n.getNeighbor() != null && !_visited.contains(n.getNeighbor()))\n\t\t\t\t{\n\t\t\t\t\tint costFromSource = mCost + n.getCost();\n\t\t\t\t\tint totalCost = costFromSource + _estimator.estimate(n.getNeighbor(), end);\n\t\t\t\t\tif (!_toVisit.contains(n.getNeighbor()) || totalCost < _totalCosts.get(n.getNeighbor()))\n\t\t\t\t\t{\n\t\t\t\t\t\t_parents.put(n.getNeighbor(), m);\n\t\t\t\t\t\t_costsFromStart.put(n.getNeighbor(), costFromSource);\n\t\t\t\t\t\t_totalCosts.put(n.getNeighbor(), totalCost);\n\t\t\t\t\t\tif (_toVisit.contains(n.getNeighbor()))\n\t\t\t\t\t\t\t_toVisit.remove(n.getNeighbor());\n\t\t\t\t\t\t_toVisit.add(n.getNeighbor());\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\t_visited.add(m);\n\t\t}\n\t\t\n\t\tif (_toVisit.contains(end))\n\t\t{\n\t\t\t_reversePath.clear();\n\t\t\t\n\t\t\tPathfindingNode current = end;\n\t\t\twhile (current != null)\n\t\t\t{\n\t\t\t\t_reversePath.push(current);\n\t\t\t\tcurrent = _parents.get(current);\n\t\t\t}\n\t\t\t\n\t\t\twhile (!_reversePath.isEmpty())\n\t\t\t\tpath.add(_reversePath.pop());\n\t\t\t\n\t\t\treturn true;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tpath.add(start);\n\t\t\treturn false;\n\t\t}\n\t}","private Board DLS(Board start, Board goal, int depth) {\n Board found = null;\n // Paso base: Si start es la solucion y esta en el ultimo nivel, regresa\n if((depth == 0) && start.equals(goal)) {\n return start;\n }\n // Si el nivel aun no es el ultimo, se obtienen los nodos hijos\n // y se vuelve a llamar la funcion en ellos\n else if(depth > 0) {\n // Obtiene los nodos hijos\n // Todas las posibles configuraciones del tablero que se pueden\n // hacer a partir de la actual\n ArrayList<Board> children = start.expand();\n\n expandedNodes++;\n\n // Para cada hijo vuelve a hacer lo mismo\n for(Board child : children) {\n found = DLS(child, goal, depth - 1);\n if(found != null)\n return found;\n }\n }\n return null;\n }","public String getParentNode()\r\n\t{\r\n\t\tif (roadBelongingType.equals(\"inbound\"))\r\n\t\t{\r\n\t\t\treturn endNode;\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\treturn startNode;\r\n\t\t}\r\n\t}","public Iterator trip() {\n\t\tStack path = new Stack();\n\t\ttry {\n\t\t\t// initializes path to the stack of nodes from starting point to end\n\t\t\t// point\n\t\t\tpath = path(BusLines, BusLines.getNode(start), BusLines.getNode(dest));\n\n\t\t\t// checks if there is a path, otherwise return null\n\t\t\tif (path == null) {\n\t\t\t\treturn null;\n\t\t\t} else {\n\t\t\t\treturn path.iterator();\n\t\t\t}\n\t\t} catch (GraphException e) {\n\t\t\tSystem.out.println(\"Error: the path does not exists.\");\n\t\t}\n\t\treturn null;\n\n\t}","protected String printablePath(IVertex<String> target){\n\n String lineout = \"\";\n\n LinkedList<IVertex<String>> path = this.getPath(target);\n\n IVertex<String> previous = null;\n\n IVertex<String> next = null;\n\n if(path!=null) {\n Iterator<IVertex<String>> it = path.iterator();\n\n while (it.hasNext()) {\n\n previous = next;\n\n next = it.next();\n\n IWeightedEdge<String> prevedge = null;\n\n if(previous!=null && next!=null){\n prevedge = this.weightedGraph.getEdge(previous,next);\n }\n\n if(prevedge!=null)\n lineout+= \" \" +prevedge.getWeight() + \" \";\n\n lineout += \" \" + next.getValue() + \" \";\n }\n }\n return lineout;\n }","@Override\n\tpublic boolean traverse(INode startNode, INode destinationNode) {\n\t\tif (isNeighbors(startNode, destinationNode) == true) {\n\t\t\tint zähler = 0;\n\t\t\tString result = \"\";\n\t\t\tMatrixNode startListNode = (MatrixNode) startNode;\n\t\t\tQueue<MatrixNode> queue = new ArrayDeque<>();\n\t\t\tqueue.add(startListNode);\n\t\t\tstartListNode.mark();\n\t\t\twhile (!queue.isEmpty()) { // solange queue nicht leer ist\n\t\t\t\t// erstes Element von der queue nehmen\n\t\t\t\tMatrixNode node = (MatrixNode) queue.poll();\n\t\t\t\tif (node.equals(destinationNode)) {\n\t\t\t\t\tSystem.out.println(\"Zähler: \" + zähler);\n\t\t\t\t\treturn true; // testen, ob Ziel-Knoten gefunden\n\t\t\t\t}\n\t\t\t\tfor (int i = 0; i < nodes.size(); i++) {\n\t\t\t\t\tif (isNeighbors(node, nodes.get(i))) {\n\t\t\t\t\t\tif (!((MatrixNode) nodes.get(i)).getMark()) {\n\t\t\t\t\t\t\tqueue.add((MatrixNode) nodes.get(i));\n\t\t\t\t\t\t\t((MatrixNode) nodes.get(i)).mark();\n\t\t\t\t\t\t\tresult += node.getName() + \"-\" + nodes.get(i).getName();\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tzähler++;\n\t\t\t\tSystem.out.println(result + \"||\");\n\t\t\t}\n\t\t}\n\t\treturn false; // Knoten kann nicht erreicht werden\n\t}","private List<Edge<String>> getPath(Vertex<String> end,\n Vertex<String> start) {\n if (graph.label(end) != null) {\n List<Edge<String>> path = new ArrayList<>();\n\n Vertex<String> cur = end;\n Edge<String> road;\n while (cur != start) {\n road = (Edge<String>) graph.label(cur); // unchecked cast ok\n path.add(road);\n cur = graph.from(road);\n }\n return path;\n }\n return null;\n }","private void printPath(LinkedList<String> visited) {\r\n\r\n if (flag == false) {\r\n System.out.println(\"Yes there exists a path between \" + START + \" and \" + END);\r\n }\r\n for (String node : visited) { //creating for loop to print the nodes stored in visited array \r\n System.out.print(node);\r\n System.out.print(\" \");\r\n }\r\n System.out.println();\r\n }","public String getOutput() {\n TopologicalOrderIterator<String, DefaultEdge> iterator =\n new TopologicalOrderIterator<>(steps, Comparator.comparing((String x) -> x));\n\n // Traverse the DAG and store each vertex to a StringBuilder\n // to output once traversal is completed\n StringBuilder sb = new StringBuilder();\n while (iterator.hasNext()) {\n sb.append(iterator.next());\n }\n\n return sb.toString();\n }","private Queue<T> backtrace(T node, Map<T, T> parentMap) {\n LinkedList<T> path = new LinkedList<>();\n path.add(node);\n\n int previousX, previousY, currentX, currentY;\n int dx, dy;\n int steps;\n T temp;\n while (parentMap.containsKey(node)) {\n previousX = parentMap.get(node).x;\n previousY = parentMap.get(node).y;\n currentX = node.x;\n currentY = node.y;\n steps = Integer.max(Math.abs(previousX - currentX), Math.abs(previousY - currentY));\n dx = Integer.compare(previousX, currentX);\n dy = Integer.compare(previousY, currentY);\n\n temp = node;\n for (int i = 0; i < steps; i++) {\n temp = graph.getNode(temp.x + dx, temp.y + dy);\n path.addFirst(temp);\n }\n\n node = parentMap.get(node);\n }\n return path;\n }","public static ArrayList<GraphNode> getPathTo(\n GraphNode startNode,\n GraphNode targetNode,\n int optimizeFor\n ) {\n PriorityQueue<GraphNodeWrapper> openList = new PriorityQueue<>(new GraphNodeWrapperComparator(targetNode));\n HashSet<GraphNode> closedSet = new HashSet<>();\n HashMap<GraphNode, Float> distanceToStart = new HashMap<>();\n distanceToStart.put(startNode, 0.f);\n\n GraphNodeWrapper startNodeWrapper = new GraphNodeWrapper(startNode);\n openList.add(startNodeWrapper);\n\n GraphNodeDistance graphNodeDistance = new GraphNodeDistance(optimizeFor);\n\n do {\n GraphNodeWrapper currentNode = openList.poll();\n assert currentNode != null;\n\n if (currentNode.graphNode.equals(targetNode)) {\n return currentNode.toList();\n }\n\n closedSet.add(currentNode.graphNode);\n\n expandNode(currentNode, openList, closedSet, distanceToStart, targetNode, graphNodeDistance);\n } while (!openList.isEmpty());\n\n return null;\n }","private static LinkedList<Node> getRevesredPath(Node targetNode){\n LinkedList<Node> arr = new LinkedList<>();\n arr.add(targetNode);\n while(targetNode.pathFromSouce !=null){\n// System.out.println(targetNode);\n// System.out.println(targetNode.pathFromSouce);\n arr.add(targetNode.pathFromSouce);\n targetNode = targetNode.pathFromSouce;\n }\n return arr;\n }","public LinkedList<Pair<DirType, Location>> getMove(int curX, int curY) {\n // find the shortest path to each coin from this current position (we don't actually care about\n // coins that we don't have a path to)\n // then, find the shortest path from each of those coins to each other coin\n\n // then, we want all Hamiltonian paths (and all subpaths?) Traveling Salesman Problem\n // i.e. we care about paths for as long as the number of steps it takes to complete\n // is less than or equal to the number of turns we have remaining\n\n // convert the Location[][] we have into David and Austin's LocationsToNode\n LocationsToNode graph = new LocationsToNode(maze);\n // knownCoins are ONLY the coins we have paths to. we will calculate the\n // shortest paths later. there are repeat calculations below.\n LinkedList<Node> coins = bfsFindCoins(graph, curX, curY);\n for (Node coinFrom : coins) {\n Location coinFromLoc = graph.getLocation(coinFrom);\n LinkedList<LinkedList<Location>> pathsToOthers = new LinkedList<LinkedList<Location>>();\n for (Node coinTo : coins) {\n Location coinToLoc = graph.getLocation(coinTo);\n LinkedList<Location> path = getShortestPath(coinFrom, coinTo, graph);\n pathsToOthers.add(path);\n }\n paths.put(coinFromLoc,pathsToOthers);\n }\n\n // calculating all possible Hamiltonian paths....\n // this is A LOT of paths we're talking about\n // i.e. we want every path that visits every single coin\n // so if we know 20 coins, starting at point 1, we have 19 choices\n // for the second point, 18 for the third, and so on (this is on the order of\n // n! total paths without dynamic programming, and might be too much brute force)\n // https://en.wikipedia.org/wiki/Hamiltonian_path#Properties\n // https://en.wikipedia.org/wiki/Travelling_salesman_problem#Heuristic_and_approximation_algorithms\n // https://stackoverflow.com/questions/16555978/example-of-a-factorial-time-algorithm-o-n\n // then, we will decide which Hamiltonian is the best for the number of\n // moves we have available to us\n\n // instead, i am going to try only calculating the paths we can actually make with our current number\n // of turns because we want the most coins in the fewest turns\n\n // WE ONLY CARE ABOUT THE LONGEST (COIN) PATH WITH THE SAME NUMBER OF TURNS\n\n return new LinkedList<Pair<DirType, Location>>();\n }","private List<Path> expandExecution(Path input) {\n\t\tList<Path> childInputs = new ArrayList<>(); //store the paths generated from given path\n\t\t\n\t\t//search from the top node which have not been searched before\n\t\tfor(int j = input.bound; j < input.path.size() - 1; j++){\n\t\t\tdouble[] probabilityArray = cfg.getTransition_matrix().getRow(input.path.get(j));\n\t\t\tfor(int i = 0; i < probabilityArray.length; i++){\n\t\t\t\t//the node been visited before only have two situation:1.has been searched,2.the path contains it in the workList \n\t\t\t\tif(probabilityArray[i] > 0 && i != input.path.get(j + 1) && unvisited.contains(i)){\n\t\t\t\t\tList<Integer> tempPath = new ArrayList<>();\n\t\t\t\t\tfor(int index = 0; index < j + 1; index++)\n\t\t\t\t\t\ttempPath.add(input.path.get(index));\n\t\t\t\t\ttempPath.add(i);\n\t\t\t\t\t\n\t\t\t\t\tPath newInput = new Path(tempPath, j + 1);\n\t\t\t\t\tchildInputs.add(newInput);\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\treturn childInputs;\n\t}","public List<List<Integer>> allPathsSourceTarget(int[][] graph) {\n \n boolean[] visited = new boolean[graph.length];\n \n List<Integer> paths = new ArrayList();\n paths.add(0);\n \n List<List<Integer>> allPaths = new ArrayList();\n \n dfs(0,graph.length-1, paths,allPaths,visited,graph);\n \n return allPaths;\n }","private void printPath( Vertex dest )\n {\n if( dest.prev != null )\n {\n printPath( dest.prev );\n // System.out.print( \" to \" );\n }\n System.out.print( dest.name +\" \" );\n }","private void findBestPath(){\n\t\t// The method will try to find the best path for every starting point and will use the minimum\n\t\tfor(int start = 0; start < this.getDimension(); start++){\n\t\t\tfindBestPath(start);\t\n\t\t}\t\n\t}","protected static void printPath(int[] thePath) {\r\n\t\t\r\n\t\tint[] orderedPath = new int[thePath.length];\r\n\t\r\n\t\tfor (int i = 0; i < thePath.length; i++)\r\n\t\t\torderedPath[i] = -1;\r\n\t\r\n\t\torderedPath[0] = myEndPole;\r\n\t\tint i = myEndPole;\r\n\t\tint j = 1;\r\n\t \r\n\t\twhile (true && j < orderedPath.length) {\t\r\n\t\t\tif (thePath[i] == -1 && i == START_POLE)\r\n\t\t\t\tbreak;\r\n\t\t\torderedPath[j] = thePath[i];\t\r\n\t\t\ti = thePath[i];\r\n\t\t\tj++;\r\n\t\t}\r\n\t\r\n\t\tSystem.out.print(\"The Shortest Path is \");\r\n\t\r\n\t\tfor (i = orderedPath.length - 1; i >= 0; i--) {\r\n\t\t\tif (orderedPath[i] == -1)\r\n\t\t\t\tcontinue;\r\n\t\t\tif (i == 0) {\r\n\t\t\t\tSystem.out.print((orderedPath[i] + 1));\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\t\t\tSystem.out.print((orderedPath[i] + 1) + \" -> \");\r\n\t\t}\r\n\r\n\t\tSystem.out.println();\r\n\t\tSystem.out.println();\r\n\t}","public static int p413ComputeShortestPathNumber(Vertex start, Vertex end){\n\t Queue<Vertex> queue=new LinkedList<Vertex>();\n\t Map<Vertex, Status> statusMap=new HashMap<Vertex, Status>();\n\t Map<Vertex, Integer> levelMap=new HashMap<Vertex, Integer>();\n\t List<List<Vertex>> allLevelList=new LinkedList<List<Vertex>>();\n\t \n\t queue.offer(start);\n\t statusMap.put(start, Status.Queued);\n\t levelMap.put(start, 0);\n\t \n\t Vertex vertex;\n\t int lastLevel=-1;\n\t List<Vertex> levelList = null;\n\t\twhile ((vertex = queue.poll()) != null) {\n\t\t\tint currentLevel = levelMap.get(vertex);\n\n\t\t\tif (currentLevel != lastLevel) {\n\t\t\t\tlastLevel = currentLevel;\n\t\t\t\tlevelList = new LinkedList<Vertex>();\n\n\t\t\t\tallLevelList.add(levelList);\n\t\t\t}\n\n\t\t\tlevelList.add(vertex);\n\n\t\t\tif (vertex.equals(end)) {\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tSet<Vertex> adjacentVertexes = vertex.getAdjacentVertexes();\n\t\t\tfor (Iterator iterator = adjacentVertexes.iterator(); iterator.hasNext();) {\n\t\t\t\tVertex adjacent = (Vertex) iterator.next();\n\n\t\t\t\tif (statusMap.get(adjacent) == null) {\n\t\t\t\t\tqueue.offer(adjacent);\n\t\t\t\t\tstatusMap.put(adjacent, Status.Queued);\n\t\t\t\t\tlevelMap.put(adjacent, currentLevel + 1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t \n\t int max=Integer.MIN_VALUE;\n\t List<Vertex> targetList=new LinkedList<Vertex>();\n\t targetList.add(end);\n\t for(int index=lastLevel-1;index>0;index--){\n\t\t List<Vertex> lastLevelList = allLevelList.get(index);\n\t\t List<Vertex> tmpList=new LinkedList<Vertex>();\n\n\t\t int count=0;\n\t\t for (Iterator iterator = lastLevelList.iterator(); iterator.hasNext();) {\n\t\t\t\tVertex lastLevelVertex = (Vertex) iterator.next();\n\t\t\t\tfor (Iterator iterator2 = targetList.iterator(); iterator2.hasNext();) {\n\t\t\t\t\tVertex vertex2 = (Vertex) iterator2.next();\n\t\t\t\t\tif(lastLevelVertex.getAdjacentVertexes().contains(vertex2)){\n\t\t\t\t\t count++;\n\t\t\t\t\t tmpList.add(lastLevelVertex);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t}\n\t\t }\n\t\t \n\t\t targetList=tmpList;\n\t\t \n\t\t if(count>max){\n\t\t \tmax=count;\n\t\t }\n\t }\n\t \n\t return max;\n\t}","@Nullable\n private NodeWithCost<V, A> findShortestPath(@Nonnull DirectedGraph<V, A> graph,\n V start, V goal, @Nonnull ToDoubleFunction<A> costf) {\n PriorityQueue< NodeWithCost<V, A>> frontier = new PriorityQueue<>(61);\n Map<V, NodeWithCost<V, A>> frontierMap = new HashMap<>(61);\n // Size of explored is the expected number of nextArrows that we need to explore.\n Set<V> explored = new HashSet<>(61);\n return doFindShortestPath(start, frontier, frontierMap, goal, explored, graph, costf);\n }"],"string":"[\n \"public List<Node> findPath(Vector2i start, Vector2i goal) {\\n\\t\\tList<Node> openList = new ArrayList<Node>(); //All possible Nodes(tiles) that could be shortest path\\n\\t\\tList<Node> closedList = new ArrayList<Node>(); //All no longer considered Nodes(tiles)\\n\\t\\tNode current = new Node(start,null, 0, getDistance(start, goal)); //Current Node that is being considered(first tile)\\n\\t\\topenList.add(current);\\n\\t\\twhile(openList.size() > 0) {\\n\\t\\t\\tCollections.sort(openList, nodeSorter); // will sort open list based on what's specified in the comparator\\n\\t\\t\\tcurrent = openList.get(0); // sets current Node to first possible element in openList\\n\\t\\t\\tif(current.tile.equals(goal)) {\\n\\t\\t\\t\\tList<Node> path = new ArrayList<Node>(); //adds the nodes that make the path \\n\\t\\t\\t\\twhile(current.parent != null) { //retraces steps from finish back to start\\n\\t\\t\\t\\t\\tpath.add(current); // add current node to list\\n\\t\\t\\t\\t\\tcurrent = current.parent; //sets current node to previous node to strace path back to start\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\topenList.clear(); //erases from memory since algorithm is finished, ensures performance is not affected since garbage collection may not be called\\n\\t\\t\\t\\tclosedList.clear();\\n\\t\\t\\t\\treturn path; //returns the desired result shortest/quickest path\\n\\t\\t\\t}\\n\\t\\t\\topenList.remove(current); //if current Node is not part of path to goal remove\\n\\t\\t\\tclosedList.add(current); //and puts it in closedList, because it's not used\\n\\t\\t\\tfor(int i = 0; i < 9; i++ ) { //8-adjacent tile possibilities\\n\\t\\t\\t\\tif(i == 4) continue; //index 4 is the middle tile (tile player currently stands on), no reason to check it\\n\\t\\t\\t\\tint x = (int)current.tile.getX();\\n\\t\\t\\t\\tint y = (int)current.tile.getY();\\n\\t\\t\\t\\tint xi = (i % 3) - 1; //will be either -1, 0 or 1\\n\\t\\t\\t\\tint yi = (i / 3) - 1; // sets up a coordinate position for Nodes (tiles)\\n\\t\\t\\t\\tTile at = getTile(x + xi, y + yi); // at tile be all surrounding tiles when iteration is run\\n\\t\\t\\t\\tif(at == null) continue; //if empty tile skip it\\n\\t\\t\\t\\tif(at.solid()) continue; //if solid cant pass through so skip/ don't consider this tile\\n\\t\\t\\t\\tVector2i a = new Vector2i(x + xi, y + yi); //Same thing as node(tile), but changed to a vector\\n\\t\\t\\t\\tdouble gCost = current.gCost + (getDistance(current.tile, a) == 1 ? 1 : 0.95); //*calculates only adjacent nodes* current tile (initial start is 0) plus distance between current tile to tile being considered (a)\\n\\t\\t\\t\\tdouble hCost = getDistance(a, goal);\\t\\t\\t\\t\\t\\t\\t\\t// conditional piece above for gCost makes a more realist chasing, because without it mob will NOT use diagonals because higher gCost\\n\\t\\t\\t\\tNode node = new Node(a, current, gCost, hCost);\\n\\t\\t\\t\\tif(vecInList(closedList, a) && gCost >= node.gCost) continue; //is node has already been checked \\n\\t\\t\\t\\tif(!vecInList(openList, a) || gCost < node.gCost) openList.add(node);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tclosedList.clear(); //clear the list, openList will have already been clear if no path was found\\n\\t\\treturn null; //a default return if no possible path was found\\n\\t}\",\n \"@Override\\n List<NodeData> pathFind() throws NoPathException {\\n System.out.println(\\\"Starting Scenic\\\");\\n\\n frontier.add(start);\\n\\n while(!frontier.isEmpty()) {\\n StarNode current = frontier.getLast();\\n frontier.removeLast(); // pop the priority queue\\n if(current.getXCoord() == goal.getXCoord() && current.getYCoord() == goal.getYCoord()) {\\n // If we are at the goal, we need to backtrack through the shortest path\\n System.out.println(\\\"At target!\\\");\\n finalList.add(current); // we have to add the goal to the path before we start backtracking\\n while(!(current.getXCoord() == start.getXCoord() && current.getYCoord() == start.getYCoord())) {\\n finalList.add(current.getPreviousNode());\\n current = current.getPreviousNode();\\n System.out.println(current.getNodeID());\\n }\\n return finalList;\\n }\\n else {\\n // we need to get all the neighbor nodes, identify their costs, and put them into the queue\\n LinkedList<StarNode> neighbors = current.getNeighbors();\\n // we also need to remove the previous node from the list of neighbors because we do not want to backtrack\\n neighbors.remove(current.getPreviousNode());\\n\\n for (StarNode newnode : neighbors) {\\n int nodePlace = this.listContainsId(frontier, newnode);\\n if(nodePlace > -1) {\\n if (frontier.get(nodePlace).getF() > actionCost(newnode) + distanceToGo(newnode, goal)) {\\n System.out.println(\\\"Here\\\");\\n frontier.remove(frontier.get(nodePlace));\\n newnode.setPreviousNode(current);\\n frontier.add(newnode);\\n newnode.setF(actionCost(newnode) + distanceToGo(newnode, goal));\\n }\\n }\\n else {\\n newnode.setPreviousNode(current);\\n frontier.add(newnode);\\n newnode.setF(actionCost(newnode) + distanceToGo(newnode, goal));\\n }\\n\\n // This fixes the problem with infinitely looping elevators (I hope)\\n if(current.getNodeType().equals(\\\"ELEV\\\") && newnode.getNodeType().equals(\\\"ELEV\\\")) {\\n for (Iterator<StarNode> iterator = newnode.neighbors.iterator(); iterator.hasNext();) {\\n StarNode newneighbor = iterator.next();\\n if (newneighbor.getNodeType().equals(\\\"ELEV\\\")) {\\n // Remove the current element from the iterator and the list.\\n iterator.remove();\\n }\\n }\\n }\\n if(current.getNodeType().equals(\\\"STAI\\\") && newnode.getNodeType().equals(\\\"STAI\\\")) {\\n for (Iterator<StarNode> iterator = newnode.neighbors.iterator(); iterator.hasNext();) {\\n StarNode newneighbor = iterator.next();\\n if (newneighbor.getNodeType().equals(\\\"STAI\\\")) {\\n // Remove the current element from the iterator and the list.\\n iterator.remove();\\n }\\n }\\n }\\n // this is where the node is put in the right place in the queue\\n Collections.sort(frontier);\\n }\\n }\\n }\\n throw new NoPathException(start.getLongName(), goal.getLongName());\\n }\",\n \"private void printPath() {\\n // generate and print the shortest path.\\n if (this == this.previous) {\\n graphPathRef.add(this);\\n } else if (this.previous == null) {\\n System.out.print(\\\"\\\");\\n } else {\\n graphPathRef.add(this);\\n this.previous.printPath();\\n }\\n }\",\n \"public Iterable<Board> solution() {\\n\\t\\tif (goal == null)\\n\\t\\t\\treturn null;\\n\\t\\telse {\\n\\t\\t\\tfinal Stack<Board> trace = new Stack<Board>();\\n\\t\\t\\tSearchNode iter = goal;\\n\\t\\t\\twhile (iter != null) {\\n\\t\\t\\t\\ttrace.push(iter.getBoard());\\n\\t\\t\\t\\titer = iter.getParent();\\n\\t\\t\\t}\\n\\t\\t\\treturn trace;\\n\\t\\t}\\n\\t}\",\n \"public Stack<Node> findPath(Node initial_node, Node end_node) {\\r\\n\\r\\n // TODO: check for hardcoded value 3\\r\\n int size = 3;\\r\\n boolean is_start_node = true;\\r\\n\\r\\n PriorityList priority_list = new PriorityList();\\r\\n LinkedList linked_list = new LinkedList();\\r\\n\\r\\n // Initialise start node\\r\\n initial_node.total_path_cost = 0;\\r\\n initial_node.cost_estimated_to_goal_node = initial_node.pathCost(end_node);\\r\\n initial_node.parent_node_in_path = null;\\r\\n priority_list.add(initial_node);\\r\\n\\r\\n // Begin exploration of grid map\\r\\n while (!priority_list.isEmpty()) {\\r\\n\\r\\n // Get node from head of list\\r\\n Node node = (Node) priority_list.removeFirst();\\r\\n\\r\\n // Determine if node is Start node\\r\\n if (node == initial_node)\\r\\n is_start_node = true;\\r\\n else\\r\\n is_start_node = false;\\r\\n\\r\\n ((Node) node).setFacing();\\r\\n\\r\\n // Determine if node is goal node\\r\\n if (node == end_node) {\\r\\n return constructPath(end_node);\\r\\n }\\r\\n\\r\\n // Get list of node neighbours\\r\\n List neighbors_list = node.getNeighbors();\\r\\n\\r\\n // Iterate through list of node neighbours\\r\\n for (int i = 0; i < neighbors_list.size(); i++) {\\r\\n\\r\\n // Extract neighbour node information\\r\\n Node node_neighbour = (Node) neighbors_list.get(i);\\r\\n boolean isOpen = priority_list.contains(node_neighbour);\\r\\n boolean isClosed = linked_list.contains(node_neighbour);\\r\\n boolean isObs = (node_neighbour).isObs();\\r\\n int clearance = node_neighbour.getClearance();\\r\\n float total_path_cost = node.getCost(node_neighbour, end_node, is_start_node) + 1;\\r\\n\\r\\n // Check 1. if node neighbours have not been explored OR 2. if shorter path to\\r\\n // neighbour node exists\\r\\n if ((!isOpen && !isClosed) || total_path_cost < node_neighbour.total_path_cost) {\\r\\n node_neighbour.parent_node_in_path = node;\\r\\n node_neighbour.total_path_cost = total_path_cost;\\r\\n node_neighbour.cost_estimated_to_goal_node = node_neighbour.pathCost(end_node);\\r\\n\\r\\n // Add neighbour node to priority_list if 1. node not in\\r\\n // priority_list/linked_list AND 2.\\r\\n // robot can reach\\r\\n if (!isOpen && !isObs && size == clearance) {\\r\\n priority_list.add(node_neighbour);\\r\\n }\\r\\n }\\r\\n }\\r\\n linked_list.add(node);\\r\\n }\\r\\n\\r\\n // priority_list empty; no path found\\r\\n\\r\\n return new Stack<Node>();\\r\\n }\",\n \"@Override\\n\\tpublic void solve() {\\n\\t\\tlong startTime = System.nanoTime();\\n\\n\\t\\twhile(!unvisitedPM.isEmpty()){\\n\\t\\t\\tProblemModel current = findCheapestNode();\\n\\t\\n\\t\\t\\tfor(ProblemModel pm : current.getSubNodes()){\\n\\t\\t\\n\\t\\t\\t\\tif(!visited.contains(pm) && !unvisitedPM.contains(pm)){\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tunvisitedPM.add(pm);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tif(current.getSideStart().isEmpty()){\\n\\t\\t\\t\\tSystem.out.print( \\\"\\\\n\\\"+ \\\"StartSide Runners: \\\");\\n\\t\\t\\t\\tfor(Integer r: current.getSideStart()){\\n\\t\\t\\t\\t\\tSystem.out.print( \\\" \\\" +r) ;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tSystem.out.print( \\\"\\\\n\\\" + \\\"EndSide Runners: \\\");\\n\\t\\t\\t\\tfor(Integer r: current.getSideEnd()){\\n\\t\\t\\t\\t\\tSystem.out.print( \\\" \\\" + r);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tprintPathTaken(current);\\n\\t\\t\\t\\tSystem.out.print( \\\"\\\\n\\\" + \\\"------------done--------------\\\");\\n\\t\\t\\t\\tlong endTime = System.nanoTime();\\n\\t\\t\\t\\tlong duration = ((endTime - startTime)/1000000);\\n\\t\\t\\t\\tSystem.out.print( \\\"\\\\n\\\" + \\\"-AS1 Time taken: \\\" + duration + \\\"ms\\\");\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tvisited.add(current);\\n\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\n\\t}\",\n \"private Stack<MapLocation> returnPath(MapLocation goal, MapLocation start) {\\n\\t\\tStack<MapLocation> path = new Stack<MapLocation>();\\n\\n\\t\\tMapLocation iter = goal;\\n\\t\\twhile (iter.cameFrom != null) {\\n\\t\\t\\tpath.add(iter.cameFrom);\\n\\t\\t\\titer = iter.cameFrom;\\n\\t\\t}\\n\\t\\t// to remove start\\n\\n\\t\\tif (path.isEmpty()) {\\n\\t\\t\\treturn path;\\n\\t\\t}\\n\\n\\t\\tpath.pop();\\n\\n\\t\\treturn path;\\n\\t}\",\n \"private static ArrayList<Connection> pathFindDijkstra(Graph graph, int start, int goal) {\\n\\t\\tNodeRecord startRecord = new NodeRecord();\\r\\n\\t\\tstartRecord.setNode(start);\\r\\n\\t\\tstartRecord.setConnection(null);\\r\\n\\t\\tstartRecord.setCostSoFar(0);\\r\\n\\t\\tstartRecord.setCategory(OPEN);\\r\\n\\t\\t\\r\\n\\t\\tArrayList<NodeRecord> open = new ArrayList<NodeRecord>();\\r\\n\\t\\tArrayList<NodeRecord> close = new ArrayList<NodeRecord>();\\r\\n\\t\\topen.add(startRecord);\\r\\n\\t\\tNodeRecord current = null;\\r\\n\\t\\tdouble endNodeCost = 0;\\r\\n\\t\\twhile(open.size() > 0){\\r\\n\\t\\t\\tcurrent = getSmallestCSFElementFromList(open);\\r\\n\\t\\t\\tif(current.getNode() == goal){\\r\\n\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tGraphNode node = graph.getNodeById(current.getNode());\\r\\n\\t\\t\\tArrayList<Connection> connections = node.getConnection();\\r\\n\\t\\t\\tfor( Connection connection :connections){\\r\\n\\t\\t\\t\\t// get the cost estimate for end node\\r\\n\\t\\t\\t\\tint endNode = connection.getToNode();\\r\\n\\t\\t\\t\\tendNodeCost = current.getCostSoFar() + connection.getCost();\\r\\n\\t\\t\\t\\tNodeRecord endNodeRecord = new NodeRecord();\\r\\n\\t\\t\\t\\t// if node is closed skip it\\r\\n\\t\\t\\t\\tif(listContains(close, endNode))\\r\\n\\t\\t\\t\\t\\tcontinue;\\r\\n\\t\\t\\t\\t// or if the node is in open list\\r\\n\\t\\t\\t\\telse if (listContains(open,endNode)){\\r\\n\\t\\t\\t\\t\\tendNodeRecord = findInList(open, endNode);\\r\\n\\t\\t\\t\\t\\t// print\\r\\n\\t\\t\\t\\t\\t// if we didn't get shorter route then skip\\r\\n\\t\\t\\t\\t\\tif(endNodeRecord.getCostSoFar() <= endNodeCost) {\\r\\n\\t\\t\\t\\t\\t\\tcontinue;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t// else node is not visited yet\\r\\n\\t\\t\\t\\telse {\\r\\n\\t\\t\\t\\t\\tendNodeRecord = new NodeRecord();\\r\\n\\t\\t\\t\\t\\tendNodeRecord.setNode(endNode);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t//update the node\\r\\n\\t\\t\\t\\tendNodeRecord.setCostSoFar(endNodeCost);\\r\\n\\t\\t\\t\\tendNodeRecord.setConnection(connection);\\r\\n\\t\\t\\t\\t// add it to open list\\r\\n\\t\\t\\t\\tif(!listContains(open, endNode)){\\r\\n\\t\\t\\t\\t\\topen.add(endNodeRecord);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}// end of for loop for connection\\r\\n\\t\\t\\topen.remove(current);\\r\\n\\t\\t\\tclose.add(current);\\r\\n\\t\\t}// end of while loop for open list\\r\\n\\t\\tif(current.getNode() != goal)\\r\\n\\t\\t\\treturn null;\\r\\n\\t\\telse { //get the path\\r\\n\\t\\t\\tArrayList<Connection> path = new ArrayList<>();\\r\\n\\t\\t\\twhile(current.getNode() != start){\\r\\n\\t\\t\\t\\tpath.add(current.getConnection());\\r\\n\\t\\t\\t\\tint newNode = current.getConnection().getFromNode();\\r\\n\\t\\t\\t\\tcurrent = findInList(close, newNode);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tCollections.reverse(path);\\r\\n\\t\\t\\treturn path;\\r\\n\\t\\t}\\r\\n\\t}\",\n \"private String solutionPath(State goal)\\n\\t{\\n\\t\\t// TODO \\n\\t\\t\\n\\t\\treturn null; \\n\\t}\",\n \"public List<Pair<Integer, Integer>> preparePath(Pair<Integer, Integer> goal) {\\n var path = new LinkedList<Pair<Integer, Integer>>();\\n path.add(goal);\\n var parent = goal.getParent();\\n while(parent != null) {\\n path.addFirst(parent);\\n parent = parent.getParent();\\n }\\n path.removeLast();\\n return path;\\n }\",\n \"public Path getShortestPath() {\\n\\t\\tNodeRecord startRecord = new NodeRecord(start, null, 0.0f, (float) heuristic.estimate(start), Category.OPEN);\\n\\n\\t\\t// Initialize the open list\\n\\t\\tPathFindingList open = new PathFindingList();\\n\\t\\topen.addRecordByEstimatedTotalCost(startRecord);\\n\\t\\trecords.set(Integer.parseInt(startRecord.node.id), startRecord);\\n\\t\\tNodeRecord current = null;\\n\\t\\t\\n\\t\\t// Iterate through processing each node\\n\\t\\twhile (!open.isEmpty()) {\\n\\t\\t\\t// Find smallest element in the open list using estimatedTotalCost\\n\\t\\t\\tcurrent = open.getSmallestNodeRecordByEstimatedTotalCost();\\n\\n\\t\\t\\t// If its the goal node, terminate\\n\\t\\t\\tif (current.node.equals(end)) break;\\n\\n\\t\\t\\t// Otherwise get its outgoing connections\\n\\t\\t\\tArrayList<DefaultWeightedEdge> connections = g.getConnections(current.node);\\n\\t\\t\\t\\n\\t\\t\\t// Loop through each connection\\n\\t\\t\\tfor (DefaultWeightedEdge connection : connections) {\\n\\t\\t\\t\\t// Get the cost and other information for end node\\n\\t\\t\\t Vertex endNode = g.graph.getEdgeTarget(connection);\\n\\t\\t\\t int endNodeRecordIndex = Integer.parseInt(endNode.id);\\n NodeRecord endNodeRecord = records.get(endNodeRecordIndex); // this is potentially null but we handle it\\n\\t\\t\\t\\tdouble newEndNodeCost = current.costSoFar + g.graph.getEdgeWeight(connection);\\n\\t\\t\\t\\tdouble endNodeHeuristic = 0;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// if node is closed we may have to skip, or remove it from closed list\\t\\n\\t\\t\\t\\tif( endNodeRecord != null && endNodeRecord.category == Category.CLOSED ){ \\n\\t\\t\\t\\t\\t// Find the record corresponding to the endNode\\n\\t\\t\\t\\t\\tendNodeRecord = records.get(endNodeRecordIndex);\\n\\n\\t\\t\\t\\t\\t// If we didn't find a shorter route, skip\\n\\t\\t\\t\\t\\tif (endNodeRecord.costSoFar <= newEndNodeCost) continue;\\n\\n\\t\\t\\t\\t\\t// Otherwise remove it from closed list\\n\\t\\t\\t\\t\\trecords.get(endNodeRecordIndex).category = Category.OPEN;\\n\\n\\t\\t\\t\\t\\t// Use node's old cost values to calculate its heuristic to save computation\\n\\t\\t\\t\\t\\tendNodeHeuristic = endNodeRecord.estimatedTotalCost - endNodeRecord.costSoFar;\\n\\n\\t\\t\\t\\t// Skip if node is open and we've not found a better route\\n\\t\\t\\t\\t} else if( endNodeRecord != null && endNodeRecord.category == Category.OPEN ){ \\n\\t\\t\\t\\t\\t// Here we find the record in the open list corresponding to the endNode\\n\\t\\t\\t\\t\\tendNodeRecord = records.get(endNodeRecordIndex);\\n\\n\\t\\t\\t\\t\\t// If our route isn't better, skip\\n\\t\\t\\t\\t\\tif (endNodeRecord.costSoFar <= newEndNodeCost) continue;\\n\\n\\t\\t\\t\\t\\t// Use the node's old cost values to calculate its heuristic to save computation\\n\\t\\t\\t\\t\\tendNodeHeuristic = endNodeRecord.estimatedTotalCost - endNodeRecord.costSoFar;\\n\\n\\t\\t\\t\\t// Otherwise we know we've got an unvisited node, so make a new record\\n\\t\\t\\t\\t} else { // if endNodeRecord.category == Category.UNVISITED\\n\\t\\t\\t\\t endNodeRecord = new NodeRecord();\\n\\t\\t\\t\\t\\tendNodeRecord.node = endNode;\\n\\t\\t\\t\\t\\trecords.set(endNodeRecordIndex, endNodeRecord);\\n\\n\\t\\t\\t\\t\\t// Need to calculate heuristic since this is new\\n\\t\\t\\t\\t\\tendNodeHeuristic = heuristic.estimate(endNode);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\n\\t\\t\\t\\t// We're here if we need to update the node\\n\\t\\t\\t\\t// update the cost, estimate, and connection\\n\\t\\t\\t\\tendNodeRecord.costSoFar = newEndNodeCost;\\n\\t\\t\\t\\tendNodeRecord.edge = connection;\\n\\t\\t\\t\\tendNodeRecord.estimatedTotalCost = newEndNodeCost + endNodeHeuristic;\\n\\n\\t\\t\\t\\t// Add it to the open list\\n\\t\\t\\t\\tif ( endNodeRecord.category != Category.OPEN ) {\\n\\t\\t\\t\\t\\topen.addRecordByEstimatedTotalCost(endNodeRecord);\\n\\t\\t\\t\\t\\tendNodeRecord.category = Category.OPEN;\\n\\t\\t\\t\\t\\trecords.set(endNodeRecordIndex, endNodeRecord);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t// We’ve finished looking at the connections for\\n\\t\\t\\t// the current node, so add it to the closed list\\n\\t\\t\\t// and remove it from the open list\\n\\t\\t\\topen.removeRecord(current);\\n\\t\\t\\tcurrent.category = Category.CLOSED;\\n\\t\\t\\trecords.set(Integer.parseInt(current.node.id), current);\\n\\t\\t}\\n\\t\\t\\n\\t\\t// We’re here if we’ve either found the goal, or\\n\\t\\t// if we’ve no more nodes to search, find which.\\n\\t\\tif (!current.node.equals(end)) {\\n\\t\\t\\t// Ran out of nodes without finding the goal, no solution\\n\\t\\t\\treturn null;\\n\\t\\t} else {\\n\\t\\t // Compile the list of connections in the path\\n\\t\\t\\tArrayList<DefaultWeightedEdge> path = new ArrayList<>();\\n\\n\\t\\t\\twhile (!current.node.equals(start)) {\\n\\t\\t\\t\\tpath.add(current.edge);\\n\\t\\t\\t\\t// Set current (NodeRecord) to is source.\\n\\t\\t\\t\\tcurrent = records.get( Integer.parseInt(g.graph.getEdgeSource(current.edge).id) );\\n\\t\\t\\t}\\n\\n\\t\\t\\t// Reverse the path, and return it\\n\\t\\t\\tCollections.reverse(path);\\n\\t\\t\\treturn new Path(g, path);\\n\\t\\t}\\n\\n\\t}\",\n \"@Override\\r\\n public Set<List<String>> findAllPaths(int sourceId, int targetId, int reachability) {\\r\\n //all paths found\\r\\n Set<List<String>> allPaths = new HashSet<List<String>>();\\r\\n //collects path in one iteration\\r\\n Set<List<String>> newPathsCollector = new HashSet<List<String>>();\\r\\n //same as the solution but with inverted edges\\r\\n Set<List<String>> tmpPathsToTarget = new HashSet<List<String>>();\\r\\n //final solution\\r\\n Set<List<String>> pathsToTarget = new HashSet<List<String>>();\\r\\n \\r\\n String[] statementTokens = null; \\r\\n Set<Integer> allProcessedNodes = new HashSet<Integer>(); //to avoid duplicates\\r\\n List<String> statementsFound = new ArrayList<String>();\\r\\n \\r\\n for (int i = 0; i < reachability; i++) {\\r\\n if (i == 0) { \\r\\n Collection<String> inEdges = jungCompleteGraph.getInEdges(sourceId);\\r\\n for (String inEdge: inEdges) {\\r\\n \\r\\n statementsFound = new ArrayList<String>();\\r\\n statementTokens = inEdge.split(\\\"->\\\");\\r\\n int inNodeId = Integer.parseInt(statementTokens[0]);\\r\\n //allProcessedNodes.add(inNodeId); \\r\\n //Incoming nodes are reversed\\r\\n statementsFound.add(new StringBuilder(inEdge).reverse().toString());\\r\\n allPaths.add(statementsFound);\\r\\n if (inNodeId == targetId) tmpPathsToTarget.add(statementsFound);\\r\\n }\\r\\n \\r\\n Collection<String> outEdges = jungCompleteGraph.getOutEdges(sourceId);\\r\\n \\r\\n for (String outEdge: outEdges) {\\r\\n \\r\\n statementsFound = new ArrayList<String>();\\r\\n statementTokens = outEdge.split(\\\"->\\\");\\r\\n int outNodeId = Integer.parseInt(statementTokens[2]);\\r\\n statementsFound.add(outEdge);\\r\\n allPaths.add(statementsFound);\\r\\n if (outNodeId == targetId) tmpPathsToTarget.add(statementsFound);\\r\\n \\r\\n }\\r\\n \\r\\n } else {\\r\\n newPathsCollector = new HashSet<List<String>>();\\r\\n\\r\\n for (List<String> statements: allPaths) {\\r\\n allProcessedNodes = new HashSet<Integer>(); //to avoid duplicates\\r\\n int lastNodeInPath = 0;\\r\\n \\r\\n for (String predicate: statements) {\\r\\n if (predicate.contains(\\\">-\\\")) {\\r\\n statementTokens = predicate.split(\\\">-\\\");\\r\\n allProcessedNodes.add(Integer.parseInt(\\r\\n new StringBuilder(statementTokens[0]).reverse().toString()));\\r\\n allProcessedNodes.add(Integer.parseInt(\\r\\n new StringBuilder(statementTokens[2]).reverse().toString()));\\r\\n lastNodeInPath = Integer.parseInt(\\r\\n new StringBuilder(statementTokens[2]).reverse().toString());\\r\\n } else {\\r\\n statementTokens = predicate.split(\\\"->\\\"); \\r\\n allProcessedNodes.add(Integer.parseInt(statementTokens[0]));\\r\\n allProcessedNodes.add(Integer.parseInt(statementTokens[2]));\\r\\n lastNodeInPath = Integer.parseInt(statementTokens[2]);\\r\\n }\\r\\n }\\r\\n \\r\\n Collection<String> inEdges = jungCompleteGraph.getInEdges(lastNodeInPath);\\r\\n for (String inEdge: inEdges) {\\r\\n \\r\\n statementsFound = new ArrayList<String>();\\r\\n statementsFound.addAll(statements);\\r\\n statementTokens = inEdge.split(\\\"->\\\");\\r\\n int inNodeId = Integer.parseInt(statementTokens[0]);\\r\\n if (allProcessedNodes.contains(inNodeId)) continue;\\r\\n \\r\\n //Incoming nodes are reversed \\r\\n statementsFound.add(new StringBuilder(inEdge).reverse().toString());\\r\\n newPathsCollector.add(statementsFound);\\r\\n if (inNodeId == targetId) tmpPathsToTarget.add(statementsFound);\\r\\n \\r\\n }\\r\\n \\r\\n Collection<String> outEdges = jungCompleteGraph.getOutEdges(lastNodeInPath);\\r\\n for (String outEdge: outEdges) {\\r\\n \\r\\n statementsFound = new ArrayList<String>();\\r\\n statementsFound.addAll(statements);\\r\\n statementTokens = outEdge.split(\\\"->\\\");\\r\\n int outNodeId = Integer.parseInt(statementTokens[2]);\\r\\n if (allProcessedNodes.contains(outNodeId)) continue;\\r\\n \\r\\n //Incoming nodes are reversed \\r\\n statementsFound.add(outEdge);\\r\\n newPathsCollector.add(statementsFound);\\r\\n if (outNodeId == targetId) tmpPathsToTarget.add(statementsFound);\\r\\n }\\r\\n }\\r\\n allPaths.addAll(newPathsCollector);\\r\\n }\\r\\n \\r\\n //System.out.println(\\\"*****End of iteration \\\" + i);\\r\\n //System.out.println(\\\"#SIZE OF allPaths: \\\" + allPaths.size());\\r\\n int numItems = 0;\\r\\n for (List<String> currList: allPaths) {\\r\\n numItems = numItems + currList.size();\\r\\n }\\r\\n //System.out.println(\\\"#NUMBER OF ELEMS OF ALL LISTS: \\\" + numItems);\\r\\n //System.out.println(\\\"#SIZE OF tmpPathsToTarget : \\\" + tmpPathsToTarget.size());\\r\\n }\\r\\n \\r\\n //We need to reverse back all the predicates\\r\\n for (List<String> statements: tmpPathsToTarget) { \\r\\n List<String> fixedStatements = new ArrayList<String>(); \\r\\n for (int i = 0; i < statements.size(); i++) { \\r\\n String statement = statements.get(i); \\r\\n if (statement.contains(\\\">-\\\")) {\\r\\n fixedStatements.add(new StringBuilder(statement).reverse().toString());\\r\\n } else {\\r\\n fixedStatements.add(statement);\\r\\n } \\r\\n }\\r\\n pathsToTarget.add(fixedStatements);\\r\\n }\\r\\n return pathsToTarget;\\r\\n }\",\n \"private void printPath(int currentVertex, int[] parents) {\\n // Base case : Source node has been processed \\n if (currentVertex == NO_PARENT) {\\n return;\\n }\\n printPath(parents[currentVertex], parents);\\n System.out.print(currentVertex + \\\" \\\");\\n }\",\n \"ArrayList<Node> DFSIter( Graph graph, final Node start, final Node end)\\n {\\n boolean visited[] = new boolean[graph.numNodes];\\n Stack<Node> stack = new Stack<Node>();\\n Map< Node,Node> parentPath = new HashMap< Node,Node>(); \\n stack.push(start);\\n\\n while ( !stack.isEmpty() )\\n {\\n Node currNode = stack.pop();\\n // end loop when goal node is found\\n if ( currNode == end )\\n break;\\n // If node has already been visited, skip it\\n if ( visited[currNode.id] )\\n continue;\\n else\\n {\\n visited[currNode.id] = true;\\n int numEdges = currNode.connectedNodes.size();\\n\\n for ( int i = 0; i < numEdges; i++ )\\n {\\n Node edgeNode = currNode.connectedNodes.get(i);\\n if ( !visited[edgeNode.id] )\\n {\\n stack.push( edgeNode );\\n parentPath.put( edgeNode, currNode);\\n }\\n }\\n \\n }\\n }\\n\\n ArrayList<Node> path = new ArrayList<Node>();\\n Node currNode = end;\\n while ( currNode != null )\\n {\\n path.add(0, currNode);\\n currNode = parentPath.get(currNode);\\n }\\n\\n return path;\\n }\",\n \"private LinkedList<Node> backtraceFromGoal(Node Target, Node Start) {\\n LinkedList<Node> pathList = new LinkedList<>();\\n\\n pathList.add(Target);\\n Node currentNode = null;\\n /*ЕСЛИ финишная ячейка помечена\\n ТО\\n перейти в финишную ячейку\\n ЦИКЛ\\n выбрать среди соседних ячейку, помеченную числом на 1 меньше числа в текущей ячейке\\n перейти в выбранную ячейку и добавить её к пути\\n ПОКА текущая ячейка — не стартовая\\n ВОЗВРАТ путь найден\\n ИНАЧЕ\\n ВОЗВРАТ путь не найден*/\\n\\n\\n return pathList;\\n }\",\n \"public List<node_info> shortestPath(int src, int dest);\",\n \"public Stack<Point> shortestPath() {\\n\\t\\tresetVisited();\\n\\t\\tStack <Point> shortestPath = new Stack<Point>();\\n\\t\\tprev = new HashMap<Point,Point>();\\n\\t\\tCompass[] direction = Compass.values();\\n\\t\\tQueue <Point> path = new LinkedList<Point>();\\n\\t\\tpath.add(playerStart);\\n\\t\\twhile(!path.isEmpty()) {\\n\\t\\t\\tPoint current = path.poll();\\n\\t\\t\\tfor (Compass pointing: direction) {\\n\\t\\t\\t\\tif (current.equals(goal)) {\\n\\t\\t\\t\\t\\tshortestPath.push(current);\\n\\t\\t\\t\\t\\twhile (prev.containsKey(shortestPath.peek()) && !shortestPath.peek().equals(playerStart)){\\n\\t\\t\\t\\t\\t\\tshortestPath.push(prev.get(shortestPath.peek()));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\treturn shortestPath;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tint nextW = (int)current.getX() + pointing.mapX;\\n\\t\\t\\t\\tint nextH = (int)current.getY() + pointing.mapY;\\n\\t\\t\\t\\tPoint nextPoint = new Point(nextW, nextH);\\n\\t\\t\\t\\tif (arrayBounds(nextW, width) && arrayBounds (nextH, height) && maze[nextW][nextH] == 0 && !visited.contains(nextPoint)) {\\n\\t\\t\\t\\t\\tpath.add(nextPoint);\\n\\t\\t\\t\\t\\tvisited.add(nextPoint);\\n\\t\\t\\t\\t\\tprev.put(nextPoint, current);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn shortestPath;\\t\\t\\n\\t}\",\n \"public void shortestPathList() {\\n Cell cell = maze.getGrid()[r - 1][r - 1];\\n\\n parents.add(cell);\\n\\n while (cell.getParent() != null) {\\n parents.add(cell.getParent());\\n cell = cell.getParent();\\n }\\n\\n Collections.reverse(parents);\\n }\",\n \"private void printSolution(int startVertex, double[] distances, int[] parents) {\\n int nVertices = distances.length;\\n System.out.print(\\\"Vertex\\\\t Distance\\\\tPath\\\");\\n\\n for (int vertexIndex = 0; vertexIndex < nVertices; vertexIndex++) {\\n if (vertexIndex != startVertex) {\\n System.out.print(\\\"\\\\n\\\" + startVertex + \\\" -> \\\");\\n System.out.print(vertexIndex + \\\" \\\\t\\\\t \\\");\\n System.out.print(distances[vertexIndex] + \\\"\\\\t\\\\t\\\");\\n printPath(vertexIndex, parents);\\n }\\n }\\n }\",\n \"private List<Pair<Integer, Integer>> getBestPath(Pair<Integer, Integer> curLocation, Pair<Integer, Integer> dest) {\\n\\t\\tList<Pair<Integer, Integer>> path = new LinkedList<Pair<Integer, Integer>>();\\n\\t\\t\\n\\t\\t\\n\\t\\tNode current = new Node(curLocation.getX(), curLocation.getY(), getHitProbability(curLocation.getX(), curLocation.getY()));\\n\\t\\tNode target = new Node(dest.getX(), dest.getY(), getHitProbability(dest.getX(), dest.getY()));\\n\\t\\tList<Node> openSet = new ArrayList<>();\\n List<Node> closedSet = new ArrayList<>();\\n \\n \\n while (true) {\\n openSet.remove(current);\\n List<Node> adjacent = getAdjacentNodes(current, closedSet, target);\\n\\n // Find the adjacent node with the lowest heuristic cost.\\n for (Node neighbor : adjacent) {\\n \\tboolean inOpenset = false;\\n \\tList<Node> openSetCopy = new ArrayList<>(openSet);\\n \\tfor (Node node : openSetCopy) {\\n \\t\\tif (neighbor.equals(node)) {\\n \\t\\t\\tinOpenset = true;\\n \\t\\t\\tif (neighbor.getAccumulatedCost() < node.getAccumulatedCost()) {\\n \\t\\t\\t\\topenSet.remove(node);\\n \\t\\t\\t\\topenSet.add(neighbor);\\n \\t\\t\\t}\\n \\t\\t}\\n \\t}\\n \\t\\n \\tif (!inOpenset) {\\n \\t\\topenSet.add(neighbor);\\n \\t}\\n }\\n\\n // Exit search if done.\\n if (openSet.isEmpty()) {\\n System.out.printf(\\\"Target (%d, %d) is unreachable from position (%d, %d).\\\\n\\\",\\n target.getX(), target.getY(), curLocation.getX(), curLocation.getY());\\n return null;\\n } else if (/*isAdjacent(current, target)*/ current.equals(target)) {\\n break;\\n }\\n\\n // This node has been explored now.\\n closedSet.add(current);\\n\\n // Find the next open node with the lowest cost.\\n Node next = openSet.get(0);\\n for (Node node : openSet) {\\n if (node.getCost(target) < next.getCost(target)) {\\n next = node;\\n }\\n }\\n// System.out.println(\\\"Moving to node: \\\" + current);\\n current = next;\\n }\\n \\n // Rebuild the path using the node parents\\n path.add(new Pair<Integer, Integer>(curLocation.getX(), curLocation.getY()));\\n while(current.getParent() != null) {\\n \\tcurrent = current.getParent();\\n \\tpath.add(0, new Pair<Integer, Integer>(current.getX(), current.getY()));\\n }\\n \\n if (path.size() > 1) {\\n \\tpath.remove(0);\\n }\\n \\n\\t\\treturn path;\\n\\t}\",\n \"@Override\\n public List<node_data> shortestPath(int src, int dest) {\\n reset();\\n for (node_data node : G.getV()) {\\n node.setWeight(Double.POSITIVE_INFINITY);\\n }\\n\\n DWGraph_DS.Node currentNode = (DWGraph_DS.Node) G.getNode(src);\\n currentNode.setWeight(0);\\n PriorityQueue<node_data> unvisitedNodes = new PriorityQueue(G.nodeSize(), weightComperator);\\n unvisitedNodes.addAll(G.getV());\\n HashMap<Integer, node_data> parent = new HashMap<>();\\n parent.put(src, null);\\n\\n while (currentNode.getWeight() != Double.POSITIVE_INFINITY) {\\n if (G.getNode(dest).getTag() == 1) {\\n break;\\n }\\n for (edge_data edge : G.getE(currentNode.getKey())) {\\n DWGraph_DS.Node neighbor = (DWGraph_DS.Node) G.getNode(edge.getDest());\\n double tmpWeight = currentNode.getWeight() + edge.getWeight();\\n if (tmpWeight < neighbor.getWeight()) {\\n neighbor.setWeight(tmpWeight);\\n unvisitedNodes.remove(neighbor);\\n unvisitedNodes.add(neighbor);\\n parent.put(neighbor.getKey(), currentNode);\\n }\\n }\\n currentNode.setTag(1);\\n if(currentNode.getKey()==dest) break;\\n unvisitedNodes.remove(currentNode);\\n currentNode = (DWGraph_DS.Node) unvisitedNodes.poll();\\n }\\n /*\\n Rebuild the path list\\n */\\n if (!parent.keySet().contains(dest)) return null;\\n List<node_data> pathList = new ArrayList<>();\\n currentNode = (DWGraph_DS.Node) G.getNode(dest);\\n while (parent.get(currentNode.getKey()) != null) {\\n pathList.add(currentNode);\\n currentNode = (DWGraph_DS.Node) parent.get(currentNode.getKey());\\n }\\n Collections.reverse(pathList);\\n return pathList;\\n }\",\n \"public List<Node> find(Node start, Node finish){\\n reachable.add(start);\\n this.finish = finish;\\n\\n while(!reachable.isEmpty()){\\n // Select a node from the reachable list\\n // If we've reached the end, return the list of nodes in our path\\n \\n Node node = selectNode(reachable);\\n if(node.isEqual(finish)){\\n return getPath(node);\\n }\\n\\n // Otherwise, remove the new node from the reachable list, and add it to the \\n // visited list so we don't look at a node more than necessary. Build a list of the\\n // nodes that are adjacent to our current node.\\n \\n reachable.remove(node);\\n visited.add(node);\\n List<Node> adjacent = getAdjacent(node);\\n\\n // If the current node has adjacent nodes, and if we haven't looked at those nodes before,\\n // add those nodes to the reachable list. If the node's cost is lower than 1+the cost to reach it,\\n // make the node's parent the previous node and set the cost\\n if(!adjacent.isEmpty()) {\\n for (Node n : adjacent) {\\n if (!reachable.contains(n)&&!visited.contains(n)) {\\n reachable.add(n);\\n }\\n if (node.getCostEstimated() + 1 <= n.getCostEstimated()) {\\n n.setParent(node);\\n n.setCostEstimated(node.getCostEstimated() + 1);\\n }\\n }\\n }\\n }\\n return null;\\n }\",\n \"private void computePath(){\\n LinkedStack<T> reversePath = new LinkedStack<T>();\\n // adding end vertex to reversePath\\n T current = end; // first node is the end one\\n while (!current.equals(start)){\\n reversePath.push(current); // adding current to path\\n current = closestPredecessor[vertexIndex(current)]; // changing to closest predecessor to current\\n }\\n reversePath.push(current); // adding the start vertex\\n \\n while (!reversePath.isEmpty()){\\n path.enqueue(reversePath.pop());\\n }\\n }\",\n \"public List<Node> findPath(Node start);\",\n \"public String getShortestPath(int goal) throws Throwable {\\n if (goal < 0) {\\n return \\\"There is no path\\\";\\n }\\n Queue<Integer> stack = new Queue<>(new Integer[10]); \\n int previous = path[goal];\\n if (previous == -1) {\\n return \\\"There is no path\\\";\\n }\\n while (previous != 0) {\\n stack.push(previous);\\n previous = path[previous];\\n }\\n String ret = \\\"0 > \\\";\\n while (!stack.isEmpty()) {\\n ret = ret + (stack.poll() + \\\" > \\\");\\n }\\n return \\\"\\\" + ret + goal;\\n }\",\n \"private void computeShortestPath(){\\n T current = start;\\n boolean atEnd = false;\\n while (!unvisited.isEmpty()&& !atEnd){\\n int currentIndex = vertexIndex(current);\\n LinkedList<T> neighbors = getUnvisitedNeighbors(current); // getting unvisited neighbors\\n \\n //what is this doing here???\\n if (neighbors.isEmpty()){\\n \\n }\\n \\n // looping through to find distances from start to neighbors\\n for (T neighbor : neighbors){ \\n int neighborIndex = vertexIndex(neighbor); \\n int d = distances[currentIndex] + getEdgeWeight(current, neighbor);\\n \\n if (d < distances[neighborIndex]){ // if this distance is less than previous distance\\n distances[neighborIndex] = d;\\n closestPredecessor[neighborIndex] = current; // now closest predecessor is current\\n }\\n }\\n \\n if (current.equals(end)){\\n atEnd = true;\\n }\\n else{\\n // finding unvisited node that is closest to start node\\n T min = getMinUnvisited();\\n if (min != null){\\n unvisited.remove(min); // remove minimum neighbor from unvisited\\n visited.add(min); // add minimum neighbor to visited\\n current = min;\\n }\\n }\\n }\\n computePath();\\n totalDistance = distances[vertexIndex(end)];\\n }\",\n \"void print_path(int[]parent,int[]dist,int s)\\n {\\n System.out.println(); \\n \\n //path from s to all other vertices\\n \\n for(int i=0;i<parent.length;i++)\\n {\\n System.out.println(\\\"From \\\"+s+\\\" to \\\"+i);\\n System.out.print(\\\"path: \\\");\\n print_node(parent,i);\\n System.out.print(\\\"END\\\");\\n if(dist[i]==INF)\\n System.out.println(\\\" cost=INF\\\"); \\n else\\n System.out.println(\\\" cost=\\\"+dist[i]);\\n\\n }\\n \\n \\n System.out.println();\\n \\n\\n \\n }\",\n \"public Iterable<Board> solution()\\n {\\n Stack<Board> solution = new Stack<Board>();\\n \\n // for case where initial board is goal board\\n if (moves == 0) {\\n solution.push(goalNode.board);\\n return solution;\\n }\\n\\n step = goalNode;\\n \\n // add chain of previous node from goal node \\n while (step != null) {\\n solution.push(step.board);\\n step = step.prev;\\n }\\n \\n return solution;\\n }\",\n \"public Iterator<Node> findPath() throws GraphException{\\n\\t\\t\\n\\t\\t// create a start and end node\\n\\t\\tNode begin = this.graph.getNode(this.start);\\n\\t\\tNode finish = this.graph.getNode(this.end);\\n\\t\\t// check to make sure a path exits between these nodes\\n\\t\\tboolean test = findPath(begin, finish);\\n\\t\\tif(test){\\n\\t\\t\\t// reset the variables of the map that were changed by invoking the findPath helper method\\n\\t\\t\\tthis.testLine = \\\"Luka<3<3\\\";\\n\\t\\t\\tthis.changeCount = -1;\\n\\t\\t\\t//return the iterator over the Stack of the Map that was modified by the findPath helper method\\n\\t\\t\\treturn this.S.iterator();\\n\\t\\t}\\n\\t\\t// return null if a path does not exist\\n\\t\\treturn null;\\n\\t}\",\n \"public void printPath() {\\n System.out.print(\\\"Path: \\\");\\n for (int i = 0; i < parents.size(); i++) {\\n Cell cell = parents.get(i);\\n System.out.print(\\\" (\\\" + cell.x + \\\",\\\" + cell.y + \\\") \\\");\\n }\\n System.out.println(\\\"\\\\nVisited cells: \\\" + visitedCells);\\n System.out.println(\\\"Length of Path: \\\" + parents.size());\\n }\",\n \"public void shortestPathsNodes() {\\n for (int sourceNode = 0; sourceNode < wordGraph.V(); sourceNode++) {\\n BreadthFirstDirectedPaths bfs = new BreadthFirstDirectedPaths(wordGraph, sourceNode);\\n\\n for (int goalNode = 0; goalNode < wordGraph.V(); goalNode++) {\\n Iterable<Integer> shortestPath = bfs.pathTo(goalNode);\\n int pathLength = -1;\\n if (shortestPath != null) {\\n for (int edge : shortestPath) {\\n pathLength++;\\n }\\n }\\n if (pathLength != -1) {\\n }\\n System.out.println(pathLength);\\n }\\n }\\n }\",\n \"public static List<CampusGraph.Edges<String, String>> findPath(CampusGraph<String, String> cg, String start, String destination) {\\n if (cg == null || start == null || destination == null) {\\n throw new IllegalArgumentException();\\n }\\n Queue<String> visitedNodes = new LinkedList<>();\\n Map<String, List<CampusGraph.Edges<String, String>>> paths = new HashMap<>();\\n visitedNodes.add(start); // Add start to Q\\n paths.put(start, new LinkedList<>()); // Add start->[] to M (start mapped to an empty list)\\n\\n while (!visitedNodes.isEmpty()) {\\n String currentNode = visitedNodes.remove();\\n if (currentNode.equals(destination)) { // found the path\\n return paths.get(currentNode);\\n } else {\\n List<CampusGraph.Edges<String, String>> neighbors = cg.getAllChildren(currentNode);\\n neighbors.sort(new Comparator<CampusGraph.Edges<String, String>>() {\\n @Override\\n public int compare(CampusGraph.Edges<String, String> o1, CampusGraph.Edges<String, String> o2) {\\n int cmpEndNode = o1.getEndTag().compareTo(o2.getEndTag());\\n if (cmpEndNode == 0) {\\n return o1.getEdgeLabel().compareTo(o2.getEdgeLabel());\\n }\\n return cmpEndNode;\\n }\\n }); // ascending list. Sort characters and books names all at once??\\n\\n for (CampusGraph.Edges<String, String> e: neighbors) {\\n String neighbor = e.getEndTag();\\n if (!paths.containsKey(neighbor)) { // i.e. if the neighbor is unvisited\\n List<CampusGraph.Edges<String, String>> pathCopy = new LinkedList<>(paths.get(currentNode));\\n pathCopy.add(e);\\n paths.put(neighbor, pathCopy); // add the path exclusive to this neighbor\\n visitedNodes.add(neighbor); // then, mark the neighbor as visited\\n }\\n }\\n }\\n }\\n return null; // No destination found\\n }\",\n \"protected LinkedList<IVertex<String>> getPath(IVertex<String> target) {\\n\\n LinkedList<IVertex<String>> path = new LinkedList<IVertex<String>>();\\n\\n IVertex<String> step = target;\\n\\n // check if a path exists\\n if (predecessors.get(step) == null) {\\n return null;\\n }\\n path.add(step);\\n while (predecessors.get(step) != null) {\\n step = predecessors.get(step);\\n path.add(step);\\n }\\n // Put it into the correct order\\n Collections.reverse(path);\\n return path;\\n }\",\n \"private Queue<Position> pathToClosest(MyAgentState state, Position start, int goal) {\\n\\t\\tQueue<Position> frontier = new LinkedList<Position>();\\n\\t\\tSet<String> enqueued = new HashSet<String>();\\n\\t\\tMap<Position, Position> preceedes = new HashMap<Position, Position>();\\n\\t\\tfrontier.add(start);\\n\\t\\tenqueued.add(start.toString());\\n\\n\\t\\twhile (!frontier.isEmpty()) {\\n\\t\\t\\tPosition pos = frontier.remove();\\n\\t\\t\\tif (state.getTileData(pos) == goal) {\\n\\t\\t\\t\\treturn toQueue(preceedes, pos, start);\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tfor (Position neighbour : pos.neighbours()) {\\n\\t\\t\\t\\tif (!enqueued.contains(neighbour.toString()) && state.getTileData(neighbour) != state.WALL) {\\n\\t\\t\\t\\t\\tpreceedes.put(neighbour, pos);\\n\\t\\t\\t\\t\\tfrontier.add(neighbour);\\n\\t\\t\\t\\t\\tenqueued.add(neighbour.toString());\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn null;\\n\\t}\",\n \"@Nullable\\n public VertexPath<V> findAnyVertexPath(@Nonnull DirectedGraph<V, A> graph,\\n V start, V goal) {\\n Deque<V> vertices = new ArrayDeque<>();\\n BackLinkWithArrow<V, A> current = breadthFirstSearch(graph, start, goal);\\n if (current == null) {\\n return null;\\n }\\n for (BackLinkWithArrow<V, A> i = current; i != null; i = i.parent) {\\n vertices.addFirst(i.vertex);\\n }\\n return new VertexPath<>(vertices);\\n }\",\n \"private static boolean getPath(int startRow, int startColumn, String[][] Map, String outputFile, String inputFile) {\\n\\t\\tQueue<Node> q = new LinkedList<Node>();\\t\\t\\t\\t\\r\\n\\t\\t\\r\\n\\t\\t//Sets the Start Node Row and Column values.\\r\\n\\t\\tNode Start = new Node(startRow + \\\" \\\" + startColumn);\\r\\n\\t\\tStart.column = startColumn;\\r\\n\\t\\tStart.row = startRow;\\r\\n\\t\\t\\r\\n\\t\\t//This is the up, left, right, and down coordinates for searching neighboring items.\\r\\n\\t\\tint[]dx = {0, 0, -1, 1};\\r\\n\\t\\tint[]dy = {-1, 1, 0, 0};\\r\\n\\t\\t\\r\\n\\r\\n\\t\\t//Adds the Start Node to the Queue.\\r\\n\\t\\tq.add(Start);\\r\\n\\t\\twhile(q.size() > 0)\\r\\n\\t\\t{\\r\\n\\t\\t\\t//This takes the first item in the Queue for comparing and looking at its neighbors.\\r\\n\\t\\t\\tNode x = q.poll();\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tif(x.visited != 1)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t//If the current node is the Goal, then it retraces it's steps (cameFrom) and prints out the path onto the 2d array named Map.\\r\\n\\t\\t\\tif (Map[x.row][x.column].compareTo(\\\"G\\\") == 0)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\twhile (x.cameFrom != null)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tif (Map[x.row][x.column].compareTo(\\\"G\\\") != 0)\\r\\n\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tMap[x.row][x.column] = \\\".\\\";\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\tx = x.cameFrom;\\r\\n\\t\\t\\t\\t\\t}\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\ttry {\\r\\n\\t\\t\\t\\t\\t\\t//Here is where it writes the solution and maze to a text file.\\r\\n\\t\\t\\t\\t\\t\\tFile file = new File(outputFile);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\tif (!file.exists()) {\\r\\n\\t\\t\\t\\t\\t\\t\\tfile.createNewFile();\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\tFileWriter fw = new FileWriter(file.getAbsoluteFile());\\r\\n\\t\\t\\t\\t\\t\\tBufferedWriter bw = new BufferedWriter(fw);\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tFile text = new File(inputFile);\\r\\n\\t\\t\\t\\t\\t\\tScanner rowColumn;\\r\\n\\t\\t\\t\\t\\t\\ttry {\\r\\n\\t\\t\\t\\t\\t\\t\\trowColumn = new Scanner(text);\\r\\n\\t\\t\\t\\t\\t\\t\\tString row = rowColumn.next();\\r\\n\\t\\t\\t\\t\\t\\t\\tString row2 = rowColumn.next();\\r\\n\\t\\t\\t\\t\\t\\t\\tbw.write(row + \\\" \\\" + row2 + \\\"\\\\n\\\");\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t} catch (FileNotFoundException e) {\\r\\n\\t\\t\\t\\t\\t\\t\\t// TODO Auto-generated catch block\\r\\n\\t\\t\\t\\t\\t\\t\\te.printStackTrace();\\r\\n\\t\\t\\t\\t\\t\\t}\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tfor(int i = 0; i < Map.length; i++)\\r\\n\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\tfor(int j = 0; j < Map[0].length; j++)\\r\\n\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tbw.write(Map[i][j]);\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\tbw.write(\\\"\\\\n\\\");\\r\\n\\t\\t\\t\\t\\t\\t}\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tbw.close();\\r\\n\\r\\n\\t\\t\\t\\t\\t} catch (IOException e) {\\r\\n\\t\\t\\t\\t\\t\\te.printStackTrace();\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\treturn true;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//This checks the up, left, right, and down values of the current Node.\\r\\n\\t\\t\\tfor(int i = 0; i < 4; i++)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tint yy = x.row + dx[i];\\r\\n\\t\\t\\t\\tint xx = x.column + dy[i];\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\tif(xx >= 1 && yy >= 1)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tif(Map[yy][xx].compareTo(\\\" \\\") == 0 && Map[yy][xx].compareTo(\\\"X\\\") != 0 && (x.visited != 1) || Map[yy][xx].compareTo(\\\"G\\\") == 0)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tboolean on = true;\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t//This checks the Queue and makes sure the current item isn't in there. \\r\\n\\t\\t\\t\\t\\t\\t//If it is, then it turns off the switch. \\r\\n\\t\\t\\t\\t\\t\\tfor(Node I: q)\\r\\n\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tif (I.column == xx && I.row == yy)\\r\\n\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\ton = false;\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\tif (on == true)\\r\\n\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t//If a node hasn't been looked at yet, it creates a node for it and adds it to the Queue. \\r\\n\\t\\t\\t\\t\\t\\tNode Neighbor = new Node(yy + \\\" \\\" + xx);\\r\\n\\t\\t\\t\\t\\t\\tNeighbor.column = xx;\\r\\n\\t\\t\\t\\t\\t\\tNeighbor.row = yy;\\r\\n\\t\\t\\t\\t\\t\\tNeighbor.cameFrom = x;\\r\\n\\t\\t\\t\\t\\t\\tq.add(Neighbor);\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t//Turns the switch back on after the ForEach loop\\r\\n\\t\\t\\t\\t\\t\\ton = true;\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//Here is where I'm trying to check if all the Nodes in the Queue have been visited,\\r\\n\\t\\t\\t//If so, then it will return false because there is no path. Not currently working though. \\r\\n\\t\\t\\tx.visited = 1;\\r\\n\\t\\t\\tint counter = 0;\\r\\n\\t\\t\\tfor(Node temp: q)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tif (temp.visited == 1)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tcounter++;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tif (q.size() == counter)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\treturn false;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t}\\t\\t\\r\\n\\t\\treturn false;\\r\\n\\t}\",\n \"private HashMap<String, Integer> getShortestPathBetweenDifferentNodes(Node start, Node end) {\\n HashMap<Node, Node> parentChildMap = new HashMap<>();\\n parentChildMap.put(start, null);\\n\\n // Shortest path between nodes\\n HashMap<Node, Integer> shortestPathMap = new HashMap<>();\\n\\n for (Node node : getNodes()) {\\n if (node == start)\\n shortestPathMap.put(start, 0);\\n else shortestPathMap.put(node, Integer.MAX_VALUE);\\n }\\n\\n for (Edge edge : start.getEdges()) {\\n shortestPathMap.put(edge.getDestination(), edge.getWeight());\\n parentChildMap.put(edge.getDestination(), start);\\n }\\n\\n while (true) {\\n Node currentNode = closestUnvisitedNeighbour(shortestPathMap);\\n\\n if (currentNode == null) {\\n return null;\\n }\\n\\n // Save path to nearest unvisited node\\n if (currentNode == end) {\\n Node child = end;\\n String path = end.getName();\\n while (true) {\\n Node parent = parentChildMap.get(child);\\n if (parent == null) {\\n break;\\n }\\n\\n // Create path using previous(parent) and current(child) node\\n path = parent.getName() + \\\"\\\" + path;\\n child = parent;\\n }\\n HashMap<String,Integer> hm= new HashMap<>();\\n hm.put(path, shortestPathMap.get(end));\\n return hm;\\n }\\n currentNode.visit();\\n\\n // Go trough edges and find nearest\\n for (Edge edge : currentNode.getEdges()) {\\n if (edge.getDestination().isVisited())\\n continue;\\n\\n if (shortestPathMap.get(currentNode) + edge.getWeight() < shortestPathMap.get(edge.getDestination())) {\\n shortestPathMap.put(edge.getDestination(), shortestPathMap.get(currentNode) + edge.getWeight());\\n parentChildMap.put(edge.getDestination(), currentNode);\\n }\\n }\\n }\\n }\",\n \"private void findPath(int current){\\r\\n // remove current from OPEN\\r\\n int index = insideArray(_openSet,current);\\r\\n if(index == -1){\\r\\n System.out.println(\\\"findPath method returns -1.\\\");\\r\\n }\\r\\n _openSet.remove(index);\\r\\n\\r\\n // add current to CLOSED\\r\\n _closedSet.add(current);\\r\\n\\r\\n // if current is the target node\\r\\n if(current == _endIndex){\\r\\n return;\\r\\n }\\r\\n\\r\\n int neighborNum = _map.get_grid(current).get_neighborNum();\\r\\n int[] neighbors = _map.get_grid(current).get_neighbors();\\r\\n\\r\\n //for each neighbor of the current node\\r\\n for(int i=0;i<neighborNum;i++){\\r\\n Grid neighborGrid = _map.get_grid(neighbors[i]);\\r\\n // if neighbor is not traversable or neighbor is in CLOSED\\r\\n // SKIP THIS NEIGHBOR\\r\\n if(!neighborGrid.get_type().equals(\\\"|\\\") && insideArray(_closedSet,neighbors[i]) == -1){\\r\\n int currentNeighborF = neighborGrid.get_Fnum();\\r\\n int neighborF = findF(neighbors[i]);\\r\\n if(neighborF < currentNeighborF || insideArray(_closedSet,neighbors[i]) == -1){\\r\\n neighborGrid.set_Fnum(neighborF);\\r\\n neighborGrid.set_parent(current);\\r\\n if(insideArray(_closedSet,neighbors[i]) == -1){\\r\\n _openSet.add(neighbors[i]);\\r\\n }\\r\\n }\\r\\n }\\r\\n }\\r\\n int currentIndex = smallestF();\\r\\n // RECURSIVE CALL\\r\\n findPath(_map.get_grid(_openSet.get(currentIndex)).get_index());\\r\\n }\",\n \"private List<Edge<T>> getPath(T target) {\\n List<Edge<T>> path = new LinkedList<>();\\n T step = target;\\n // check if a path exists\\n if (predecessors.get(step) == null) {\\n return path;\\n }\\n while (predecessors.get(step) != null) {\\n T endVertex = step;\\n step = predecessors.get(step);\\n T startVertex = step;\\n path.add(getEdge(startVertex, endVertex));\\n }\\n // Put it into the correct order\\n Collections.reverse(path);\\n return path;\\n }\",\n \"public LinkedList<GraphNode> getPath(GraphNode startNode, GraphNode goalNode, boolean useStairs) throws PathNotFoundException {\\n return currentPathingAlgorithm.findPath(startNode, goalNode, useStairs);\\n }\",\n \"public void printShortestPath() {\\n Cell[][] grid = maze.getGrid();\\n\\n for (int i = 0; i <= r; i++) {\\n // Rows: This loop needs to iterate r times since there are r rows\\n for (int j = 0; j < r; j++) {\\n Cell currentCell;\\n if (i == r) { // If it is on the last row, print the bottom row of the cells\\n currentCell = grid[i - 1][j];\\n System.out.print(currentCell.bottomRow());\\n } else { // If it's not on the last row, print the top row of the cells\\n currentCell = grid[i][j];\\n System.out.print(currentCell.topRow());\\n }\\n }\\n System.out.print(\\\"+\\\");\\n System.out.println();\\n\\n // This loop only needs to iterate r-1 times since there is only r-1 \\\"|\\\" rows\\n if (i != r) {\\n for (int k = 0; k < r; k++) {\\n Cell currentCell = grid[i][k];\\n if ((i == 0 && k == 0))\\n System.out.print(currentCell.zeroDistanceColumn2());\\n else if (parents.contains(currentCell))\\n System.out.print(currentCell.zeroDistanceColumn2());\\n else\\n System.out.print(currentCell.distanceColumn2());\\n }\\n System.out.print(\\\"|\\\");\\n System.out.println();\\n }\\n }\\n }\",\n \"public List<Node> getShortestPathToDestination(Node destination) {\\n List<Node> path = new ArrayList<Node>();\\n\\n\\n\\n for (Node node = destination; node != null; node = node.previous){\\n Log.i(\\\"bbb\\\", \\\"get path \\\"+node._waypointName);\\n path.add(node);\\n }\\n\\n // reverse path to get correct order\\n Collections.reverse(path);\\n return path;\\n }\",\n \"private void goForSolution(MinPQ<Node> hq) {\\n\\t\\tNode current = hq.delMin();\\n\\t\\tif (current.board.isGoal()) {\\n\\t\\t\\tif (hq == orig) {\\n\\t\\t\\t\\tresult = new ArrayList<>();\\n\\t\\t\\t\\twhile (current != null) {\\n\\t\\t\\t\\t\\tresult.add(0, current.board);\\n\\t\\t\\t\\t\\tcurrent = current.parent;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tsolved = true;\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\n\\t\\tfor (Board neighbour : current.board.neighbors()) {\\n\\t\\t\\tif (current.parent == null || !neighbour.equals(current.parent.board)) {\\n\\t\\t\\t\\thq.insert(new Node(neighbour, current.moves + 1, current));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"private static void findShortestPath(ArrayList<WeightedEdge> edges, int start, int dest, int nNodes) {\\n int costs[] = new int[nNodes];\\n int parents[] = new int[nNodes];\\n boolean doneWithNode[] = new boolean[nNodes];\\n\\n // cost[i] has the cost of getting to node number i or is UNKNOWN if no cost figure out yet.\\n // parent[i] contains the parent (or the way) we got to node i.\\n // done[i] is true if we've already worked on all the children of node i.\\n\\n // Initialize the arrays.\\n for (int i = 0; i<nNodes; i++) {\\n costs[i] = UNKNOWN;\\n parents[i] = UNKNOWN;\\n doneWithNode[i] = false;\\n }\\n\\n int node = start; // This is the node we are working on. Let's start with start node.\\n costs[node] = 0; // The cost of getting to the start node is 0!\\n\\n // While not done processing all the nodes...\\n\\n // Loop through all the edges (edges array list).\\n // Skip those edges whose source is doesn't match the node we're working on.\\n\\n // For edge (that has source of current node) figure out potential to\\n // get it. (How much does it cost to get to node we're on? Add to\\n // that the cost of the edge. That's the new price to set to dest of edge.\\n\\n // Is that a new low cost for that dest edge node?\\n // Or is the dest edge node cost currently UNKNOWN? That means we have no cost.\\n // If so, store the cost. Store the parent.\\n\\n // Once done with all the edges, mark the current node as\\n // done being processed.\\n doneWithNode[node] = true;\\n\\n // Get next node to work on.\\n node = getLowestCostUnprocessedNode(costs, doneWithNode);\\n\\n // Done with while loop\\n\\n for (int i=0; i<parents.length; i++) {\\n System.out.println(\\\"Node: \\\" + i + \\\" Cost: \\\" + costs[i] + \\\" Backtrace Parent: \\\" + parents[i]);\\n }\\n\\n backtrace(dest, parents);\\n }\",\n \"private PathCostFlow findCheapestPath(int start, int end, double max_flow) throws Exception {\\n if (getNode(start) == null || getNode(end) == null\\n || !getNode(start).isSource() || getNode(end).isSource()) {\\n throw new IllegalArgumentException(\\\"start must be the index of a source and end must be the index of a sink\\\");\\n }\\n double amount = Math.min(Math.min(getNode(start).getResidualCapacity(),\\n getNode(end).getResidualCapacity()), max_flow);\\n\\n boolean[] visited = new boolean[n];\\n int[] parent = new int[n];\\n for (int i = 0; i < n; i++) {\\n parent[i] = -1;\\n }\\n double[] cost = new double[n];\\n for (int i = 0; i < n; i++) {\\n cost[i] = Integer.MAX_VALUE;\\n }\\n cost[start] = 0;\\n\\n PriorityQueue<IndexCostTuple> queue = new PriorityQueue<IndexCostTuple>();\\n queue.add(new IndexCostTuple(start, 0));\\n\\n while (!queue.isEmpty()) {\\n IndexCostTuple current = queue.poll();\\n\\n // we found the target node\\n if (current.getIndex() == end) {\\n ArrayList<Integer> path = new ArrayList<Integer>();\\n path.add(new Integer(end));\\n while (path.get(path.size() - 1) != start) {\\n path.add(parent[path.get(path.size() - 1)]);\\n }\\n Collections.reverse(path);\\n if ((path.get(0) != start) || (path.get(path.size() - 1) != end)) {\\n throw new Exception(\\\"I fucked up coding Dijkstra's\\\");\\n }\\n return new PathCostFlow(path, cost[end], amount);\\n }\\n\\n // iterate through all possible neighbors of the current node\\n for (int i = 0; i < n; i++) {\\n SingleEdge e = matrix[current.getIndex()][i];\\n if ((!visited[i]) && (e != null)\\n && (current.getCost() + e.getCost(amount) < cost[i])) {\\n cost[i] = current.getCost() + e.getCost(amount);\\n parent[i] = current.getIndex();\\n\\n // update the entry for this node in the queue\\n IndexCostTuple newCost = new IndexCostTuple(i, cost[i]);\\n queue.remove(newCost);\\n queue.add(newCost);\\n }\\n }\\n visited[current.getIndex()] = true;\\n }\\n\\n return null; //the target node was unreachable\\n }\",\n \"private List<Node> getIntermediatePath(final Node source, final Node target) {\\n if (P[source.id][target.id] == null) {\\n return new ArrayList<Node>();\\n }\\n final List<Node> path = new ArrayList<Node>();\\n path.addAll(getIntermediatePath(source, P[source.id][target.id]));\\n path.add(P[source.id][target.id]);\\n path.addAll(getIntermediatePath(P[source.id][target.id], target));\\n return path;\\n }\",\n \"public Square[] buildPath(GameBoard board, Player player) {\\n\\n // flag to check if we hit a goal location\\n boolean goalVertex = false;\\n\\n // Queue of vertices to be checked\\n Queue<Vertex> q = new LinkedList<Vertex>();\\n\\n // set each vertex to have a distance of -1\\n for ( int i = 0; i < graph.length; i++ )\\n graph[i] = new Vertex(i,-1);\\n\\n // get the start location, i.e. the player's location\\n Vertex start = \\n squareToVertex(board.getPlayerLoc(player.getPlayerNo()));\\n start.dist = 0;\\n q.add(start);\\n\\n // while there are still vertices to check\\n while ( !goalVertex ) {\\n\\n // get the vertex and remove it;\\n // we don't want to look at it again\\n Vertex v = q.remove();\\n\\n // check if this vertex is at a goal row\\n switch ( player.getPlayerNo() ) {\\n case 0: if ( v.graphLoc >= 72 ) \\n goalVertex = true; break;\\n case 1: if ( v.graphLoc <= 8 ) \\n goalVertex = true; break;\\n case 2: if ( (v.graphLoc+1) % GameBoard.COLUMNS == 0 )\\n goalVertex = true; break;\\n case 3: if ( v.graphLoc % GameBoard.COLUMNS == 0 )\\n goalVertex = true; break;\\n }\\n\\n // if we're at a goal vertex, we don't need to calculate\\n // its neighboors\\n if ( !goalVertex ) {\\n\\n // retrieve all reachable ajacencies\\n Square[] adjacencies = reachableAdjacentSquares\\n (board, vertexToSquare(v, board), player.getPlayerNo());\\n\\n // for each adjacency...\\n for ( Square s : adjacencies ) {\\n\\n // convert to graph location\\n Vertex adjacent = squareToVertex(s); \\n\\n // modify the vertex if it hasn't been modified\\n if ( adjacent.dist < 0 ) {\\n adjacent.dist = v.dist+1;\\n adjacent.path = v;\\n q.add(adjacent);\\n }\\n }\\n\\n }\\n else\\n return returnPath(v,board);\\n \\n }\\n // should never get here\\n return null;\\n }\",\n \"private void identifySuccessors(T node, T goal, Set<T> goals, Queue<T> open, Set<T> closed, Map<T, T> parentMap,\\n Map<T, Double> fMap, Map<T, Double> gMap, Map<T, Double> hMap) {\\n // get all neighbors to the current node\\n Collection<T> neighbors = findNeighbors(node, parentMap);\\n\\n double d;\\n double ng;\\n for (T neighbor : neighbors) {\\n // jump in the direction of our neighbor\\n T jumpNode = jump(neighbor, node, goals);\\n\\n // don't add a node we have already gotten to quicker\\n if (jumpNode == null || closed.contains(jumpNode)) continue;\\n\\n // determine the jumpNode's distance from the start along the current path\\n d = graph.getDistance(jumpNode, node);\\n ng = gMap.getOrDefault(node, 0d) + d;\\n\\n // if the node has already been opened and this is a shorter path, update it\\n // if it hasn't been opened, mark as open and update it\\n if (!open.contains(jumpNode) || ng < gMap.getOrDefault(jumpNode, 0d)) {\\n gMap.put(jumpNode, ng);\\n hMap.put(jumpNode, graph.getHeuristicDistance(jumpNode, goal));\\n fMap.put(jumpNode, gMap.getOrDefault(jumpNode, 0d) + hMap.getOrDefault(jumpNode, 0d));\\n //System.out.println(\\\"jumpNode: \\\" + jumpNode.x + \\\",\\\" + jumpNode.y + \\\" f: \\\" + fMap.get(jumpNode));\\n parentMap.put(jumpNode, node);\\n\\n if (!open.contains(jumpNode)) {\\n open.offer(jumpNode);\\n }\\n }\\n }\\n }\",\n \"Path getPathFromNodeTo(Node destination);\",\n \"@Override\\n public List dijkstrasShortestPath(T start, T end) {\\n Vertex<T> origin = new Vertex<>(start);\\n Vertex<T> destination = new Vertex<>(end);\\n List<Vertex<T>> path;\\n\\n settledNodes = new HashSet<>();\\n unSettledNodes = new HashSet<>();\\n distancesBetweenNodes = new HashMap<>();\\n predecessors = new HashMap<>();\\n\\n distancesBetweenNodes.put(origin,0);\\n unSettledNodes.add(origin);\\n\\n while(unSettledNodes.size() > 0){\\n Vertex<T> minimumWeightedVertex = getMinimum(unSettledNodes);\\n settledNodes.add(minimumWeightedVertex);\\n unSettledNodes.remove(minimumWeightedVertex);\\n findMinimumDistance(minimumWeightedVertex);\\n }\\n path = getPath(destination);\\n return path;\\n\\n }\",\n \"public ArrayList<Vertex> findPath() {\\n \\n //if we've already been through findPath, then just return it\\n if (solutionCalculated) {\\n return solution;\\n }\\n \\n //instantiate path\\n solution = new ArrayList<Vertex>();\\n \\n //create boolean array of visited nodes (default: false)\\n boolean[] visited = new boolean[arrayOfVertices.length];\\n \\n //(for testing)\\n NavigateMaze.drawMaze(getVertices());\\n \\n //call dfs\\n dfs(visited, arrayOfVertices[0], \\n arrayOfVertices[arrayOfVertices.length - 1]);\\n \\n //update solutionCalculated to true\\n solutionCalculated = true;\\n \\n //return solution\\n return solution;\\n \\n }\",\n \"public KnightNode getPathByBFS(KnightNode startNode,\\n\\t\\t\\tKnightNode finishNode) {\\n\\t\\tif (startNode == null) {\\n\\t\\t\\tthrow new IllegalArgumentException(\\\"start node shouldn't be null!\\\");\\n\\t\\t}\\n\\n\\t\\tif (finishNode == null) {\\n\\t\\t\\tthrow new IllegalArgumentException(\\\"finish node shouldn't be null!\\\");\\n\\t\\t}\\n\\n\\t\\tQueue<KnightNode> queue = new LinkedList<KnightNode>();\\n\\n\\t\\t// step 0\\n\\t\\tstartNode.isUsed = true;\\n\\t\\tqueue.add(startNode);\\n\\t\\n\\t\\twhile (!queue.isEmpty()) {\\n\\t\\t\\t// get next node from head of queue\\n\\t\\t\\tKnightNode tmpNode = queue.remove();\\n\\t\\t\\tSet<KnightNode> childNodes = tmpNode.availableMoves;\\n\\t\\t\\tfor (KnightNode tmpChild : childNodes) {\\n\\t\\t\\t\\ttmpChild = findNode(tmpChild.x, tmpChild.y);\\n\\t\\t\\t\\t// check if we have already been here\\n\\t\\t\\t\\tif (!tmpChild.isUsed) {\\n\\t\\t\\t\\t\\ttmpChild.root = tmpNode;\\n\\t\\t\\t\\t\\ttmpChild.isUsed = true;\\n\\t\\t\\t\\t\\tqueue.add(tmpChild);\\n\\n\\t\\t\\t\\t\\tif (tmpChild.equals(finishNode)) {\\n\\t\\t\\t\\t\\t\\t// we have found our short path\\n\\t\\t\\t\\t\\t\\treturn tmpChild;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t\\t// path is not exist\\n\\t\\treturn null;\\n\\t}\",\n \"private LinkedList<Node> aStarPath() throws PathNotFoundException {\\n\\n // Set of nodes already evaluated\\n List<Node> closedSet = new ArrayList<Node>();\\n\\n // Set of nodes visited, but not evaluated\\n List<Node> openSet = new ArrayList<Node>();\\n openSet.add(start);\\n\\n\\n // Map of node with shortest path leading to it\\n Map<Node, Node> cameFrom = new HashMap<>();\\n\\n // Map of cost of navigating from start to node\\n Map<Node, Double> costFromStart = new HashMap<>();\\n costFromStart.put(start, 0.0);\\n\\n // Map of cost of navigating path from start to end through node\\n Map<Node, Double> costThrough = new HashMap<>();\\n costThrough.put(start, heuristic(start, end));\\n\\n while (!openSet.isEmpty()){\\n\\n Node current = lowestCostThrough(openSet, costThrough);\\n\\n if(current.equals(end)){\\n return reconstructPath(cameFrom, current);\\n }\\n\\n openSet.remove(current);\\n closedSet.add(current);\\n\\n for(Node neighbor: current.getNodes()) {\\n if (closedSet.contains(neighbor)) {\\n continue;\\n }\\n\\n double tentativeCost = costFromStart.get(current) + distanceBetween(current, neighbor);\\n\\n if (!openSet.contains(neighbor)) { // found new neighbor\\n openSet.add(neighbor);\\n } else if (tentativeCost >= costFromStart.get(neighbor)) { // not a better path\\n continue;\\n }\\n\\n cameFrom.put(neighbor, current);\\n costFromStart.put(neighbor, tentativeCost);\\n costThrough.put(neighbor, tentativeCost + heuristic(neighbor, end));\\n\\n }\\n }\\n // no path\\n throw pathNotFound;\\n }\",\n \"public LinkedList<City> getPath(City target) {\\r\\n\\r\\n\\t\\tLinkedList<City> path = new LinkedList<City>();\\r\\n \\t\\tCity step = target;\\r\\n\\t\\t// check if a path exists\\r\\n\\t\\tif (predecessors.get(step) == null) {\\r\\n\\t\\t\\treturn null;\\r\\n\\t\\t}\\r\\n\\t\\tpath.add(step);\\r\\n\\t\\twhile (predecessors.get(step) != null) {\\r\\n\\t\\t\\tstep = predecessors.get(step);\\r\\n\\t\\t\\tpath.add(step);\\r\\n\\t\\t}\\r\\n\\t\\t// Put it into the correct order\\r\\n\\t\\tCollections.reverse(path);\\r\\n\\t\\treturn path;\\r\\n\\t}\",\n \"public LinkedList<Vertex> getPath(Vertex target) {\\n LinkedList<Vertex> path = new LinkedList<Vertex>();\\n Vertex step = target;\\n // check if a path exists\\n if (predecessors.get(step) == null) {\\n return null;\\n }\\n path.add(step);\\n while (predecessors.get(step) != null) {\\n step = predecessors.get(step);\\n path.add(step);\\n }\\n // Put it into the correct order\\n Collections.reverse(path);\\n return path;\\n }\",\n \"public static void main(String[] args) {\\n Graph graph = new Graph();\\n graph.addEdge(0, 1);\\n graph.addEdge(0, 4);\\n\\n graph.addEdge(1,0);\\n graph.addEdge(1,5);\\n graph.addEdge(1,2);\\n graph.addEdge(2,1);\\n graph.addEdge(2,6);\\n graph.addEdge(2,3);\\n\\n graph.addEdge(3,2);\\n graph.addEdge(3,7);\\n\\n graph.addEdge(7,3);\\n graph.addEdge(7,6);\\n graph.addEdge(7,11);\\n\\n graph.addEdge(5,1);\\n graph.addEdge(5,9);\\n graph.addEdge(5,6);\\n graph.addEdge(5,4);\\n\\n graph.addEdge(9,8);\\n graph.addEdge(9,5);\\n graph.addEdge(9,13);\\n graph.addEdge(9,10);\\n\\n graph.addEdge(13,17);\\n graph.addEdge(13,14);\\n graph.addEdge(13,9);\\n graph.addEdge(13,12);\\n\\n graph.addEdge(4,0);\\n graph.addEdge(4,5);\\n graph.addEdge(4,8);\\n graph.addEdge(8,4);\\n graph.addEdge(8,12);\\n graph.addEdge(8,9);\\n graph.addEdge(12,8);\\n graph.addEdge(12,16);\\n graph.addEdge(12,13);\\n graph.addEdge(16,12);\\n graph.addEdge(16,17);\\n graph.addEdge(17,13);\\n graph.addEdge(17,16);\\n graph.addEdge(17,18);\\n\\n graph.addEdge(18,17);\\n graph.addEdge(18,14);\\n graph.addEdge(18,19);\\n\\n graph.addEdge(19,18);\\n graph.addEdge(19,15);\\n LinkedList<Integer> visited = new LinkedList();\\n List<ArrayList<Integer>> paths = new ArrayList<ArrayList<Integer>>();\\n int currentNode = START;\\n visited.add(START);\\n new searchEasy().findAllPaths(graph, visited, paths, currentNode);\\n for(ArrayList<Integer> path : paths){\\n for (Integer node : path) {\\n System.out.print(node);\\n System.out.print(\\\" \\\");\\n }\\n System.out.println();\\n }\\n }\",\n \"@Override\\n public void solve(Problem p) {\\n Queue queue = new LinkedList();\\n queue.add(p);\\n closeList.add(p);\\n\\n while (!queue.isEmpty()) {\\n\\n Problem node = (Problem) queue.remove();\\n if (node.isAnswer()) {\\n printPath(node);\\n return;\\n }\\n// System.out.println(node);\\n node.generateNodes();\\n nodesExpanded++;\\n for (Iterator<Problem> it = node.nodes.iterator(); it.hasNext();) {\\n nodesSeen++;\\n Problem problem = it.next();\\n if (closeList.contains(problem)) {\\n continue;\\n }\\n problem.visited = true;\\n problem.distanceTraveled = node.distanceTraveled + 1;\\n// System.out.println(problem.distanceTraveled);\\n// System.out.println(problem);\\n queue.add(problem);\\n closeList.add(problem);\\n }\\n maxNodes = Math.max(maxNodes, queue.size());\\n }\\n \\n }\",\n \"public static void getShortestPath()\\r\\n\\t{\\r\\n\\t\\tScanner scan = new Scanner(System.in); //instance for input declared\\r\\n\\t\\tSystem.out.print(\\\"\\\\nPlease enter the Source node for shortest path: \\\");\\r\\n\\t\\tint src = scan.nextInt() - 1;\\r\\n\\t\\twhile(src < 0 || src > routers-1)\\r\\n {\\r\\n\\t\\t\\tSystem.out.println(\\\"The entered source node is out of range, please enter again: \\\"); // Printing error\\r\\n\\t\\t\\tsrc = scan.nextInt() - 1;\\t//re-input source\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tSystem.out.print(\\\"Please enter the destination node for shortest path: \\\");\\r\\n\\t\\tint dest = scan.nextInt() - 1;\\r\\n\\t\\twhile(dest < 0 || dest > routers-1)\\r\\n {\\r\\n\\t\\t\\tSystem.out.println(\\\"The entered destination node is out of range, please enter again: \\\"); // Printing error\\r\\n\\t\\t\\tdest = scan.nextInt() - 1;\\t//re-input destination\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tconnectNetwork(src, dest, true);\\r\\n\\t}\",\n \"public Iterable<Board> solution() {\\n if (!isSolvable())\\n return null;\\n Stack<Board> solution = new Stack<Board>();\\n for (Node s = goal; s != null; s = s.previousNode)\\n solution.push(s.board);\\n return solution;\\n }\",\n \"public List<Vertex> shortestPath(Vertex start, Vertex end) {\\r\\n\\t\\tMap<Vertex, Vertex> backRefs = new HashMap<Vertex, Vertex>();\\r\\n\\r\\n\\t\\t// Create a queue for BFS\\r\\n\\t\\tQueue<Vertex> queue = new LinkedList<Vertex>();\\r\\n\\r\\n\\t\\t// Mark the current node as visited and enqueue it. Use backRef as\\r\\n\\t\\t// visited set\\r\\n\\t\\tqueue.offer(start);\\r\\n\\t\\tbackRefs.put(start, null);\\r\\n\\r\\n\\t\\tVertex currentNode;\\r\\n\\t\\tSet<Vertex> neighbors;\\r\\n\\r\\n\\t\\twhile (queue.size() != 0) { // or !queue.isEmpty()\\r\\n\\t\\t\\t// Dequeue a vertex from queue and print it\\r\\n\\t\\t\\tcurrentNode = queue.poll();\\r\\n\\r\\n\\t\\t\\tif (currentNode.equals(end)) {\\r\\n\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t}\\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\\tneighbors = currentNode.getNeighbors();\\r\\n\\r\\n\\t\\t\\tfor (Vertex n : neighbors) {\\r\\n\\t\\t\\t\\tif (!backRefs.containsKey(n)) {\\r\\n\\t\\t\\t\\t\\tqueue.offer(n);\\r\\n\\t\\t\\t\\t\\tbackRefs.put(n, currentNode);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tif (!backRefs.containsKey(end))\\r\\n\\t\\t\\treturn null;\\r\\n\\r\\n\\t\\tList<Vertex> path = new ArrayList<Vertex>();\\r\\n\\t\\tcurrentNode = end;\\r\\n\\r\\n\\t\\twhile (currentNode != null) {\\r\\n\\t\\t\\tpath.add(currentNode);\\r\\n\\t\\t\\tcurrentNode = backRefs.get(currentNode);\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tCollections.reverse(path);\\r\\n\\r\\n\\t\\treturn path;\\r\\n\\t}\",\n \"public void printSolution(Node solution_node)\\n\\t{\\n\\t\\tArrayList<String> steps = new ArrayList<String>();\\n\\n\\t\\twhile (solution_node.parent != null) {\\n\\t\\t\\tsteps.add(\\\"Fill \\\" + solution_node.action.to + \\\" with water from \\\" + \\n\\t\\t\\t\\t\\tsolution_node.action.from + \\\" (ie. \\\" + solution_node.action.quantity + \\\" jugs)\\\" + \\n\\t\\t\\t\\t\\t\\\" New state: \\\" + solution_node.state [0] + \\\",\\\" + solution_node.state[1]);\\n\\n\\t\\t\\tsolution_node = solution_node.parent;\\n\\t\\t} \\n\\n\\t\\tSystem.out.println(\\\"Steps:\\\");\\n\\n\\t\\tsteps.add(\\\"4 gallon jug has \\\" + solution_node.state[0] + \\\" gallons and 3 gallon jug has \\\" + \\n\\t\\t\\t\\t\\tsolution_node.state[1] + \\\" gallons\\\");\\n\\n\\t\\twhile (steps.size() > 0) {\\n\\t\\t\\tString curr = steps.remove(steps.size() - 1);\\n\\t\\t\\tSystem.out.println(curr);\\n\\t\\t}\\n\\t}\",\n \"public static List<Vec2i> solve(int[][] grid, Vec2i start, Vec2i goal, Heuristic h){\\n if(h == null){ //if null replace with default heuristic\\n h = new Heuristic() {\\n @Override\\n\\n public double eval(Vec2i loc) {\\n double dx = (loc.x - goal.x);\\n double dy = (loc.y - goal.y);\\n return Math.sqrt(dx*dx + dy*dy);\\n }\\n };\\n }\\n\\n PriorityQueue<GridLocation> edge = new PriorityQueue<GridLocation>(10, AStarGrid::compareGridLocations);\\n edge.add(new GridLocation(start,0));\\n\\n Map<Vec2i, Vec2i> cameFrom = new HashMap<Vec2i, Vec2i>();\\n Map<Vec2i, Double> g = new HashMap<Vec2i, Double>(); //distance to node\\n g.put(start,0.0);\\n Map<Vec2i, Double> f = new HashMap<Vec2i, Double>(); //distance from start to goal through this node\\n f.put(start,h.eval(start));\\n //f = g + h\\n\\n while(!edge.isEmpty()){\\n\\n Vec2i current = edge.poll().loc;\\n if(current.x == goal.x && current.y == goal.y){\\n return reconstructPath(cameFrom, current);\\n }\\n\\n LinkedList<Vec2i> neighbors = new LinkedList<Vec2i>();\\n if(current.x != 0 && grid[current.x - 1][current.y] == 0)\\n neighbors.add(new Vec2i(current.x - 1,current.y));\\n if(current.x != grid.length-1 && grid[current.x + 1][current.y] == 0)\\n neighbors.add(new Vec2i(current.x + 1,current.y));\\n if(current.y != 0 && grid[current.x][current.y - 1] == 0)\\n neighbors.add(new Vec2i(current.x,current.y - 1));\\n if(current.y != grid[0].length-1 && grid[current.x][current.y + 1] == 0)\\n neighbors.add(new Vec2i(current.x,current.y + 1));\\n\\n\\n for(Vec2i neighbor: neighbors){\\n double score = g.get(current) + 1;\\n if(!g.containsKey(neighbor) || score < g.get(neighbor)){\\n cameFrom.put(neighbor,current);\\n g.put(neighbor, score);\\n f.put(neighbor, score + h.eval(neighbor));\\n if(!edge.contains(neighbor)){\\n edge.add(new GridLocation(neighbor,score + h.eval(neighbor)));\\n }\\n }\\n }\\n }\\n //No path was found\\n return null;\\n }\",\n \"private List<List<Edge>> walker(String sourceNode, String destNode, List<Edge> currentPath, List<List<Edge>> paths) {\\n if (currentPath == null) {\\n currentPath = new ArrayList<>();\\n }\\n if (paths == null) {\\n paths = new ArrayList<>();\\n }\\n\\n if (sourceNode.equals(destNode)) {\\n return paths;\\n }\\n\\n\\n// List<Edge> edges = findByNodeA(sourceNode);\\n List<Edge> edges = allEdges.stream().filter(edge -> edge.nodeA.equals(sourceNode)).collect(Collectors.toList());\\n\\n\\n for (Edge edge : edges) {\\n if (!currentPath.contains(edge)&&!containsBidirectionalRef(currentPath,edge)) {\\n List<Edge> forkPath = (List<Edge>) ((ArrayList<Edge>) currentPath).clone();\\n\\n forkPath.add(edge);\\n\\n if (edge.getNodeB().equals(destNode)) {\\n paths.add(forkPath);\\n } else {\\n walker(edge.getNodeB(), destNode,forkPath,paths);\\n }\\n }\\n }\\n\\n return paths;\\n }\",\n \"public Node getGoal(){\\n return goal;\\n }\",\n \"public KnightNode getPathByDFS(KnightNode startNode,\\n\\t\\t\\tKnightNode finishNode) {\\n\\t\\tif (startNode == null) {\\n\\t\\t\\tthrow new IllegalArgumentException(\\\"start node shouldn't be null!\\\");\\n\\t\\t}\\n\\n\\t\\tif (finishNode == null) {\\n\\t\\t\\tthrow new IllegalArgumentException(\\\"finish node shouldn't be null!\\\");\\n\\t\\t}\\n\\n\\t\\tDeque<KnightNode> stack = new LinkedList<KnightNode>();\\n\\n\\t\\t// step 0\\n\\t\\tstartNode.isUsed = true;\\n\\t\\tstack.add(startNode);\\n\\n\\t\\tnodes.remove(startNode);\\n\\t\\tnodes.add(startNode);\\n\\n\\t\\twhile (!stack.isEmpty()) {\\n\\t\\t\\t// get next node from head of queue\\n\\t\\t\\tKnightNode tmpNode = stack.getLast();\\n\\t\\t\\tSet<KnightNode> childNodes = tmpNode.availableMoves;\\n\\t\\t\\tfor (KnightNode tmpChild : childNodes) {\\n\\t\\t\\t\\ttmpChild = findNode(tmpChild.x, tmpChild.y);\\n\\t\\t\\t\\t// check if we have already been here\\n\\t\\t\\t\\tif (!tmpChild.isUsed) {\\n\\t\\t\\t\\t\\ttmpChild.root = tmpNode;\\n\\t\\t\\t\\t\\ttmpChild.isUsed = true;\\n\\t\\t\\t\\t\\tstack.add(tmpChild);\\n\\n\\t\\t\\t\\t\\tif (tmpChild.equals(finishNode)) {\\n\\t\\t\\t\\t\\t\\t// we have found our short path\\n\\t\\t\\t\\t\\t\\treturn tmpChild;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t\\t// path is not exist\\n\\t\\treturn null;\\n\\t}\",\n \"public List<GeographicPoint> dijkstra(GeographicPoint start, \\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t GeographicPoint goal, Consumer<GeographicPoint> nodeSearched)\\n\\t{\\n\\t\\t// TODO: Implement this method in WEEK 4\\n\\n\\t\\t// Hook for visualization. See writeup.\\n\\t\\t//nodeSearched.accept(next.getLocation());\\n\\t\\t\\n\\t\\t//initialize distance of each MapNode from start to infinity\\n\\t\\t\\n\\t\\tSet<GeographicPoint> visited = new HashSet<GeographicPoint>();\\n\\t\\tPriorityQueue<MapNode> queue = new PriorityQueue<MapNode>();\\n\\t\\tHashMap<GeographicPoint, List<GeographicPoint>> path = new HashMap<GeographicPoint, List<GeographicPoint>>();\\n\\t\\tint count = 0;\\n\\t\\t\\n\\t\\tif (!map.containsKey(start) || !map.containsKey(goal))\\n\\t\\t\\treturn null;\\n\\t\\t\\n\\t\\tfor (GeographicPoint temp : map.keySet())\\n\\t\\t\\tpath.put(temp, new ArrayList<GeographicPoint>());\\n\\t\\t\\n\\t\\tMapNode startNode = map.get(start);\\n\\t\\tstartNode.setTimeToStart(0.0);\\n\\t\\tstartNode.setDistanceToStart(0.0);\\n\\t\\tqueue.add(startNode);\\n\\t\\t\\n\\t\\twhile (!queue.isEmpty()) {\\n\\t\\t\\tMapNode currNode = queue.poll();\\n\\t\\t\\tnodeSearched.accept(currNode.getLocation());\\n\\t\\t\\t\\n\\t\\t\\tif (!visited.contains(currNode.getLocation())) {\\n\\t\\t\\t\\tvisited.add(currNode.getLocation());\\n\\t\\t\\t\\tcount++;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif (currNode.getLocation().equals(goal))\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tHashMap<MapEdge, GeographicPoint> neighbours = currNode.getNeighbours();\\n\\t\\t\\t\\tfor (MapEdge edge : neighbours.keySet()) {\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif (!visited.contains(edge.getEnd())) {\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\tMapNode addNode = map.get(neighbours.get(edge));\\n\\t\\t\\t\\t\\t\\tdouble tempTime = currNode.getTimeToStart() + ((edge.getDistance())/(edge.getSpeedLimit()));\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\tif (tempTime < addNode.getTimeToStart()) {\\n\\t\\t\\t\\t\\t\\t\\taddNode.setTimeToStart(tempTime);\\n\\t\\t\\t\\t\\t\\t\\tqueue.add(addNode);\\n\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\tList<GeographicPoint> temp = path.get(neighbours.get(edge));\\n\\t\\t\\t\\t\\t\\t\\ttemp.add(currNode.getLocation());\\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\\tSystem.out.println(\\\"Dijkstra: \\\" + count);\\n\\t\\treturn backTrack(path,goal);\\n\\t}\",\n \"public ArrayList<SearchNode> search(Problem p) {\\n\\tfrontier = new NodeQueue();\\t// The frontier is a queue of expanded SearchNodes not processed yet\\n\\texplored = new HashSet<SearchNode>();\\t/// The explored set is a set of nodes that have been processed \\n\\tGridPos startState = (GridPos) p.getInitialState();\\t// The start state is given\\n\\tfrontier.addNodeToFront(new SearchNode(startState));\\t// Initialize the frontier with the start state \\n\\n\\t\\n\\tpath = new ArrayList<SearchNode>();\\t// Path will be empty until we find the goal\\n\\t\\t\\n\\n\\n\\twhile(!frontier.isEmpty()){\\n\\n\\t SearchNode s = frontier.removeFirst(); \\n\\t GridPos g = s.getState(); \\n\\n\\t if ( p.isGoalState(g) ) {\\n\\t\\tpath = s.getPathFromRoot();\\t\\n\\t\\tbreak; \\n\\t }\\n\\t \\n\\t explored.add(s); \\t \\n\\t ArrayList<GridPos> childStates = p.getReachableStatesFrom(g);\\n\\n\\t while(!childStates.isEmpty()){\\n\\n\\t\\tSearchNode child = new SearchNode(childStates.get(0), s); \\n\\n\\t\\tif(!explored.contains(child) && !frontier.contains(child)){\\n\\n\\t\\t if ( p.isGoalState(child.getState()) ) {\\n\\t\\t\\n\\t\\t\\tpath = child.getPathFromRoot();\\t\\n\\t\\t\\treturn path; \\n\\t\\t }\\n\\n\\t\\t if(insertFront) \\n\\t\\t\\tfrontier.addNodeToFront(child); \\t\\t \\t\\t\\n\\t\\t else\\t\\n\\t\\t\\tfrontier.addNodeToBack(child); \\t \\n\\n\\n\\n\\t\\t}\\n\\n\\t\\tchildStates.remove(0);\\n\\t }\\t \\n\\t}\\n\\n\\n\\treturn path;\\n\\n }\",\n \"public LinkedList<Move> search1() {\\r\\n\\r\\n while (!paths.isEmpty()) {\\r\\n\\r\\n if (logger.isDebugEnabled())\\r\\n logger.debug(printPathCosts());\\r\\n\\r\\n LinkedList<Move> path = paths.first();\\r\\n if (logger.isDebugEnabled())\\r\\n logger.debug(\\\"First path is \\\" + path);\\r\\n\\r\\n if (!paths.remove(path)) {\\r\\n throw new RuntimeException(\\\"Failed to remove path\\\");\\r\\n }\\r\\n\\r\\n Node currentNode = path.getLast().destination;\\r\\n if (logger.isDebugEnabled())\\r\\n logger.debug(\\\"Last site on path is \\\" + currentNode);\\r\\n\\r\\n if (closed.contains(currentNode)) {\\r\\n if (logger.isDebugEnabled())\\r\\n logger.debug(\\\"Site \\\" + currentNode + \\\" was closed.\\\");\\r\\n continue;\\r\\n }\\r\\n if (currentNode.isAtTarget(target)) {\\r\\n return path;\\r\\n }\\r\\n\\r\\n closed.add(currentNode);\\r\\n\\r\\n Move lastMove = path.getLast();\\r\\n if ( !(lastMove instanceof InitialMove) ) {\\r\\n currentNode = transformCurrentNode(lastMove);\\r\\n }\\r\\n\\r\\n Set<Move> successors = successors(currentNode);\\r\\n for (Move y : successors) {\\r\\n LinkedList<Move> successor = new LinkedList<Move>(path);\\r\\n y.pathCost = successor.getLast().pathCost + y.edgeCost;\\r\\n successor.add(y);\\r\\n paths.add(successor);\\r\\n if (logger.isDebugEnabled())\\r\\n logger.debug(\\\"Added successor \\\" + y);\\r\\n nodeExpansionCounter ++;\\r\\n }\\r\\n }\\r\\n\\r\\n return null;\\r\\n }\",\n \"@Override\\n\\tpublic List<node_data> shortestPath(int src, int dest) {\\n\\t\\tList<node_data> ans = new ArrayList<>();\\n\\t\\tthis.shortestPathDist(src, dest);\\n\\t\\tif(this.GA.getNode(src).getWeight() == Integer.MAX_VALUE || this.GA.getNode(dest).getWeight() == Integer.MAX_VALUE){\\n\\t\\t\\tSystem.out.print(\\\"There is not a path between the nodes.\\\");\\n\\t\\t\\treturn null;\\n\\t\\t}\\n\\t\\tgraph copied = this.copy();\\n\\t\\ttransPose(copied);\\n\\t\\tnode_data first = copied.getNode(dest);\\n\\t\\tans.add(first);\\n\\t\\twhile (first.getKey() != src) {\\n\\t\\t\\tCollection<edge_data> temp = copied.getE(first.getKey());\\n\\t\\t\\tdouble check= first.getWeight();\\n\\t\\t\\tif(temp!=null) {\\n\\t\\t\\t\\tfor (edge_data edge : temp) {\\n\\t\\t\\t\\t\\tif (copied.getNode(edge.getDest()).getWeight() + edge.getWeight() == check) {\\n\\t\\t\\t\\t\\t\\tfirst = copied.getNode(edge.getDest());\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tans.add(first);\\n\\t\\t}\\n\\t\\tList<node_data> ans2 = new ArrayList<>();\\n\\t\\tfor (int i = ans.size()-1;i>=0;i--){\\n\\t\\t\\tans2.add(ans.get(i));\\n\\t\\t}\\n\\t\\treturn ans2;\\n\\t}\",\n \"public Iterable<Board> solution()\\n {\\n Iterable<Board> result = null;\\n if (isSolvable()) {\\n result = shortestPath;\\n }\\n return result;\\n }\",\n \"public void printMST() {\\n\\t\\t\\n\\t\\tString mstPath = \\\"\\\";\\n\\t\\t\\n\\t\\t/**Stores the parent child hierarchy*/\\n\\t\\tint distance[] = new int[this.vertices];\\n\\t\\t\\n\\t\\t/**Stores all the vertices with their distances from source vertex*/\\n\\t\\tMap<Integer, Integer> map = new HashMap<Integer, Integer>();\\n\\t\\tmap.put(0, 0);\\n\\t\\t\\n\\t\\tfor(int i = 1; i < vertices; i++){\\n\\t\\t\\tmap.put(i, Integer.MAX_VALUE);\\n\\t\\t}\\n\\t\\t\\n\\t\\tfor(int i = 0; i < vertices; i++){\\n\\t\\t\\t\\n\\t\\t\\tInteger minVertex = extractMin(map), minValue = map.get(minVertex);\\n\\t\\t\\tdistance[minVertex] = minValue;\\n\\t\\t\\t\\n\\t\\t\\tmstPath += minVertex + \\\" --> \\\";\\n\\t\\t\\t\\n\\t\\t\\t/**Removing min vertex from map*/\\n\\t\\t\\tmap.remove(minVertex);\\n\\t\\t\\t\\n\\t\\t\\t/**Exploring edges of min vertex*/\\n\\t\\t\\tArrayList<GraphEdge> edges = this.adjList[minVertex];\\n\\t\\t\\tfor(GraphEdge edge : edges){\\n\\t\\t\\t\\tif(map.containsKey(edge.destination)){\\n\\t\\t\\t\\t\\tif(map.get(edge.destination) > distance[edge.source] + edge.weight){\\n\\t\\t\\t\\t\\t\\tmap.put(edge.destination, distance[edge.source] + edge.weight);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tSystem.out.println(mstPath);\\n\\t}\",\n \"@Override\\n public List<node_info> shortestPath(int src, int dest) {\\n int counter=0;//counter for index of listPath\\n List<node_info> listPath=new ArrayList<node_info>();//The reverse list that is returned\\n List<node_info> listResult=new ArrayList<node_info>();//the returned list\\n if(!DijkstraHelp(src,dest)) return null;//if there is no path from src to dest\\n if(src==dest) {\\n listPath.add(this.ga.getNode(src));\\n return listPath;\\n }\\n //the other case:\\n node_info d=this.ga.getNode(dest);\\n listPath.add(counter,d);//insert the dest in order to go from destination to source\\n //counter++;\\n weighted_graph gCopy=copy();\\n Iterator<node_info> it=gCopy.getV().iterator();//run on the whole graph\\n while(it.hasNext()){\\n if(listPath.get(counter).getKey()==src) break;//if we finished\\n if(gCopy.getV(listPath.get(counter).getKey()).contains(it.next())) {//remove the nodes that we were already checked if\\n //they need to be insert to listPath\\n continue;\\n }\\n Iterator<node_info> currentIt=gCopy.getV(listPath.get(counter).getKey()).iterator();//iterator on the ni-list of the\\n //last node were insert to the listPath\\n if(currentIt!=null) {\\n node_info min=null;\\n while (currentIt.hasNext()){\\n node_info currentLoop=currentIt.next();\\n if(currentLoop.getTag()+gCopy.getEdge(listPath.get(counter).getKey(),currentLoop.getKey())==\\n listPath.get(counter).getTag()){//check if this is the node that appropriate to the shortest path\\n min=currentLoop;\\n }\\n }\\n listPath.add(min);//insert to listPath\\n counter++;\\n }\\n }\\n for(int i=listPath.size()-1;i>=0;i--){\\n listResult.add(listPath.size()-i-1,listPath.get(i));//reverse the list\\n }\\n return listResult;\\n }\",\n \"public ArrayList<Vertex> getPath(Vertex target) {\\n\\t\\tArrayList<Vertex> path = new ArrayList<Vertex>();\\n\\t\\tVertex step = target;\\n\\t\\t// check if a path exists\\n\\t\\tif (predecessors.get(step) == null) {\\n\\t\\t\\treturn null;\\n\\t\\t}\\n\\t\\tpath.add(step);\\n\\t\\twhile (predecessors.get(step) != null) {\\n\\t\\t\\tstep = predecessors.get(step);\\n\\t\\t\\tpath.add(step);\\n\\t\\t}\\n\\t\\t// Put it into the correct order\\n\\t\\tCollections.reverse(path);\\n\\n\\n\\t\\tVertex current=null;\\n\\t\\tVertex next=null;\\n\\t\\tint length = path.size();\\n\\t\\tfor(int i=0;i<length-1;i++){\\n current = path.get(i);\\n\\t\\t\\t next = path.get(i+1);\\n\\t\\t\\tif(!rapid && (nodeColor_map.get(current.getName()).equalsIgnoreCase(\\\"dB\\\")||\\n\\t\\t\\t\\t\\tnodeColor_map.get(next.getName()).equalsIgnoreCase(\\\"dB\\\")))\\n\\t\\t\\t\\trapid = true;\\n\\t\\t\\troute_length+= edge_length_map.get(new Pair(current,next));\\n\\t\\t}\\n\\n\\t\\treturn path;\\n\\t}\",\n \"@Override\\r\\n public List<T> breadthFirstPath(T start, T end) {\\r\\n\\r\\n Vertex<T> startV = vertices.get(start);\\r\\n Vertex<T> endV = vertices.get(end);\\r\\n\\r\\n LinkedList<Vertex<T>> vertexList = new LinkedList<>();\\r\\n //Set<Vertex<T>> visited = new HashSet<>();\\r\\n ArrayList<Vertex<T>> visited = new ArrayList<>();\\r\\n\\r\\n LinkedList<Vertex<T>> pred = new LinkedList<>();\\r\\n int currIndex = 0;\\r\\n\\r\\n pred.add(null);\\r\\n\\r\\n vertexList.add(startV);\\r\\n visited.add(startV);\\r\\n\\r\\n LinkedList<T> path = new LinkedList<>();\\r\\n\\r\\n if (breadthFirstSearch(start, end) == false) {\\r\\n path = new LinkedList<>();\\r\\n return path;\\r\\n } else {\\r\\n while (vertexList.size() > 0) {\\r\\n Vertex<T> next = vertexList.poll();\\r\\n if(next == null){\\r\\n continue;\\r\\n }\\r\\n if (next == endV) {\\r\\n path.add(endV.getValue());\\r\\n break;\\r\\n }\\r\\n for (Vertex<T> neighbor : next.getNeighbors()) {\\r\\n if (!visited.contains(neighbor)) {\\r\\n pred.add(next);\\r\\n visited.add(neighbor);\\r\\n vertexList.add(neighbor);\\r\\n }\\r\\n }\\r\\n currIndex++;\\r\\n //path.add(next.getValue());\\r\\n\\r\\n }\\r\\n while (currIndex != 0) {\\r\\n Vertex<T> parent = pred.get(currIndex);\\r\\n path.add(parent.getValue());\\r\\n currIndex = visited.indexOf(parent);\\r\\n }\\r\\n }\\r\\n Collections.reverse(path);\\r\\n return path;\\r\\n }\",\n \"public static void connectNetwork(int src, int dest, boolean printPath)\\r\\n\\t{\\r\\n\\t\\tint v = routers;\\r\\n\\t\\t\\r\\n\\t\\tint parent[] = new int[v];//parent node array\\r\\n\\t\\tint dist[] = new int[v];// distance array\\r\\n\\t\\tboolean visited[] = new boolean[v];// visited will be either true or false\\r\\n\\t\\t\\r\\n\\t\\t// initialize parent, distance arrays\\r\\n\\t\\tfor (int i = 0; i < v; i++ ) { \\r\\n\\t\\t\\tvisited[i] = false;\\r\\n\\t\\t\\tparent[i] = -1;\\r\\n\\t\\t\\tdist[i] = Integer.MAX_VALUE;\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\t// initialize the source distance as zero\\r\\n\\t\\tdist[src] = 0;\\r\\n\\t\\t\\r\\n\\t\\t// get minimum edge from the unvisited nodes\\r\\n\\t\\tfor (int count = 0; count < v-1; count++) { // loop for all v nodes\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tint start = -1;\\r\\n\\t\\t\\tint min = Integer.MAX_VALUE;\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tfor (int i = 0; i < v; i++) {\\r\\n\\t\\t\\t\\tif (visited[i] == false && dist[i] < min) {\\r\\n\\t\\t\\t\\t\\tmin = dist[i];\\r\\n\\t\\t\\t\\t\\tstart = i;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t// minimum distance is computed for all connected edges\\r\\n\\t\\t\\tif (start == -1) \\r\\n\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t// update the current node as visited\\r\\n\\t\\t\\tvisited[start] = true;\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t// update all adjacent nodes' distance array\\r\\n\\t\\t\\tfor (int end = 0; end < v; end++) {\\r\\n\\t\\t\\t\\tif ((visited[end] != true) && (graph[start][end] != -1) &&\\r\\n\\t\\t\\t\\t\\t\\t(dist[start] != Integer.MAX_VALUE) &&\\r\\n\\t\\t\\t\\t\\t\\t(dist[start] + graph[start][end] < dist[end])) {\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tdist[end] = dist[start] + graph[start][end];\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t// start node is the parent node in BFS tree\\r\\n\\t\\t\\t\\t\\tparent[end] = start;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tSystem.out.println();\\r\\n\\t\\t\\r\\n\\t\\tif (dest != -1) {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t// Case#4: shortest path between source and destination nodes \\r\\n\\t\\t\\tif (parent[dest] == -1) {\\r\\n\\t\\t\\t\\tSystem.out.println(\\\"There is no path from \\\" + (src+1) + \\\" to \\\" + (dest+1) + \\\" exists.\\\");\\r\\n\\t\\t\\t} else {\\r\\n\\t\\t\\t\\tSystem.out.println(\\\"Shortest distance from \\\" + (src+1) + \\\" to \\\" + (dest+1) + \\\" is: \\\" + dist[dest]);\\r\\n\\t\\t\\t\\tSystem.out.print(\\\"Corresponding Shortest Path is: \\\");\\r\\n\\t\\t\\t\\tprintNodes(parent, parent[dest], src);\\r\\n\\t\\t\\t\\tSystem.out.println(dest+1);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t} else {\\r\\n\\t\\t\\t\\r\\n System.out.println(\\\"The Shortest Distance from node you entered, \\\"+ (src+1) + \\\" are\\\\n\\\");\\r\\n //Printing shortest path length\\r\\n\\t\\t\\tSystem.out.println(\\\"Destination\\\\tDistance\\\\n========================\\\");\\r\\n for (int i = 0; i < v; i++) {\\r\\n System.out.println(\\\"\\\\t\\\"+ (i+1) + \\\"\\\\t \\\"+ dist[i]); // Printing the node number and distance\\r\\n }\\r\\n \\r\\n\\t\\t\\tif (printPath == true) {\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t// case#2: Print all shortest paths from source node\\r\\n\\t\\t\\t\\tfor (int i = 0; i < v; i++) {\\r\\n\\t\\t\\t\\t\\tif (i == src)\\r\\n\\t\\t\\t\\t\\t\\tcontinue;\\r\\n\\t\\t\\t\\t\\telse if (parent[i] == -1) {\\r\\n\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"Shortest path from \\\" + (src+1) + \\\" to \\\" + (i+1) + \\\" doesn't exist.\\\");\\r\\n\\t\\t\\t\\t\\t\\tcontinue;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tSystem.out.print(\\\"Shortest Path from \\\" + (src+1) + \\\" to \\\" + (i+1) + \\\" is: \\\");\\r\\n\\t\\t\\t\\t\\tprintNodes(parent, parent[i], src);\\r\\n\\t\\t\\t\\t\\tSystem.out.println(i+1);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t}\",\n \"private NodePath<T> collectPathNodes( WeightedGraph<T> graph, Object startNodeId, Object endNodeId ) {\\n\\t\\tArrayDeque<Node<T>> deque = new ArrayDeque<>( searchNodes.size() );\\n\\t\\tNode<T> startNode = graph.getNode( startNodeId );\\n\\t\\tNode<T> endNode = graph.getNode( endNodeId );\\n\\t\\tSearchNode<T> node = getSearchNode( endNode );\\n\\n\\t\\t//\\tkeep this before we flush the maps\\n\\t\\tfinal int finalDistance = node.getDistance();\\n\\n\\t\\t//\\twalk backwards through the \\\"previous\\\" links\\n\\t\\tdo {\\n\\t\\t\\tdeque.push( node.getNode() );\\n\\t\\t}\\n\\t\\twhile ( (node = getSearchNode( node.getPrevious() )) != null && ! node.equals( startNode ) );\\n\\t\\tdeque.push( startNode );\\n\\n\\t\\tclearSearchNodes();\\n\\t\\treturn new NodePath<>( new ArrayList<>( deque ), finalDistance );\\n\\t}\",\n \"private void findPath1(List<Coordinate> path) {\\n\\n // records the start coordinate in a specific sequence.\\n ArrayList<Coordinate> starts = new ArrayList<>();\\n // records the end coordinate in a specific sequence.\\n ArrayList<Coordinate> ends = new ArrayList<>();\\n // records the total cost of the path in a specific sequence.\\n ArrayList<Integer> cost = new ArrayList<>();\\n\\n for (Coordinate o1 : originCells) {\\n for (Coordinate d1 : destCells) {\\n Graph graph = new Graph(getEdge(map));\\n graph.dijkstra(o1);\\n graph.printPath(d1);\\n starts.add(o1);\\n ends.add(d1);\\n cost.add(graph.getPathCost(d1));\\n }\\n }\\n int index = getMinIndex(cost);\\n\\n Graph graph = new Graph(getEdge(map));\\n graph.dijkstra(starts.get(index));\\n graph.printPath(ends.get(index));\\n for (Graph.Node node : graph.getPathReference()) {\\n path.add(node.coordinate);\\n }\\n setSuccess(path);\\n }\",\n \"public void dfsPrint(Node start){\\n Stack<Node> stack = new Stack<>();\\n Set<Node> visited = new HashSet<>(); //we can use integer for better space\\n\\n stack.push(start);\\n while (!stack.isEmpty()){\\n Node curr = stack.pop();\\n if(!visited.contains(curr)){\\n visited.add(curr);\\n //do something\\n }\\n for(Node n: curr.adj){\\n if(!visited.contains(n)){\\n stack.push(n);\\n }\\n }\\n }\\n }\",\n \"public void solve() {\\n /** To solve the traveling salesman problem:\\n * Set up the graph, choose a starting node, then call the recursive backtracking method and pass it the starting node.\\n */\\n\\n // We need to pass a starting node to recursive backtracking method\\n Node startNode = null;\\n\\n // Grab a node, any node...\\n for( Node n : graph.nodes() ) {\\n startNode = n;\\n break;\\n }\\n\\n // Visit the first node\\n startNode.visit();\\n\\n // Add first node to the route\\n this.route[0] = startNode;\\n\\n // Pass the number of choices made\\n int nchoices = 1;\\n\\n // Recursive backtracking\\n explore(startNode, nchoices );\\n\\n\\n }\",\n \"ShortestPath(UndirectedWeightedGraph graph, String startNodeId, String endNodeId) throws NotFoundNodeException {\\r\\n\\t\\t\\r\\n\\t\\tif (!graph.containsNode(startNodeId)) {\\r\\n\\t\\t\\tthrow new NotFoundNodeException(graph, startNodeId);\\r\\n\\t\\t}\\t\\t\\r\\n\\t\\tif (!graph.containsNode(endNodeId)) {\\r\\n\\t\\t\\tthrow new NotFoundNodeException(graph, endNodeId);\\r\\n\\t\\t}\\t\\r\\n\\r\\n\\t\\tsrc = startNodeId;\\r\\n\\t\\tdst = endNodeId;\\r\\n\\t\\t\\r\\n\\t\\tif (endNodeId.equals(startNodeId)) {\\r\\n\\t\\t\\tlength = 0;\\r\\n\\t\\t\\tnumOfPath = 1;\\r\\n\\t\\t\\tArrayList<String> path = new ArrayList<String>();\\r\\n\\t\\t\\tpath.add(startNodeId);\\r\\n\\t\\t\\tpathList.add(path);\\r\\n\\t\\t}\\r\\n\\t\\telse {\\r\\n\\t\\t\\t// create a HashMap of updated distance from the starting node to every node\\r\\n\\t\\t\\t// initially it is 0, inf, inf, inf, ...\\r\\n\\t\\t\\tHashMap<String, Double> distance = new HashMap<String, Double>();\\t\\r\\n\\t\\t\\tfor (String nodeId : graph.getNodeList().keySet()) {\\r\\n\\t\\t\\t\\tif (nodeId.equals(startNodeId)) {\\r\\n\\t\\t\\t\\t\\t// the starting node will always have 0 distance from itself\\r\\n\\t\\t\\t\\t\\tdistance.put(nodeId, 0.0);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\telse {\\r\\n\\t\\t\\t\\t\\t// the others have initial distance is infinity\\r\\n\\t\\t\\t\\t\\tdistance.put(nodeId, Double.MAX_VALUE);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t// a HashMap of preceding node of each node\\r\\n\\t\\t\\tHashMap<String, HashSet<String>> precedence = new HashMap<String, HashSet<String>>();\\r\\n\\t\\t\\tfor (String nodeId : graph.getNodeList().keySet()) {\\r\\n\\t\\t\\t\\tif ( nodeId.equals(startNodeId) ) {\\r\\n\\t\\t\\t\\t\\tprecedence.put(nodeId, null);\\t// the start node will have no preceding node\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\telse { \\r\\n\\t\\t\\t\\t\\tprecedence.put(nodeId, new HashSet<String>());\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//\\r\\n\\t\\t\\tSet<String> unvisitedNode = new HashSet<String>();\\r\\n\\t\\t\\tfor (String nodeId : graph.getNodeList().keySet()) {\\r\\n\\t\\t\\t\\tunvisitedNode.add(nodeId);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tdouble minUnvisitedLength;\\r\\n\\t\\t\\tString minUnvisitedNode;\\r\\n\\t\\t\\t// run loop while not all node is visited\\r\\n\\t\\t\\twhile ( unvisitedNode.size() != 0 ) {\\r\\n\\t\\t\\t\\t// find the unvisited node with minimum current distance in distance list\\r\\n\\t\\t\\t\\tminUnvisitedLength = Double.MAX_VALUE;\\r\\n\\t\\t\\t\\tminUnvisitedNode = \\\"\\\";\\r\\n\\t\\t\\t\\tfor (String nodeId : unvisitedNode) {\\r\\n\\t\\t\\t\\t\\tif (distance.get(nodeId) < minUnvisitedLength) {\\r\\n\\t\\t\\t\\t\\t\\tminUnvisitedNode = nodeId;\\r\\n\\t\\t\\t\\t\\t\\tminUnvisitedLength = distance.get(nodeId); \\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t// if there are no node that can be visited from the unvisitedNode, break the loop \\r\\n\\t\\t\\t\\tif (minUnvisitedLength == Double.MAX_VALUE) {\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t}\\t\\t\\t\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t// remove the node from unvisitedNode\\r\\n\\t\\t\\t\\tunvisitedNode.remove(minUnvisitedNode);\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t// update the distance of its neighbors\\r\\n\\t\\t\\t\\tfor (Node neighborNode : graph.getNodeList().get(minUnvisitedNode).getNeighbors().keySet()) {\\r\\n\\t\\t\\t\\t\\tdouble distanceFromTheMinNode = distance.get(minUnvisitedNode) + graph.getNodeList().get(minUnvisitedNode).getNeighbors().get(neighborNode).getWeight();\\r\\n\\t\\t\\t\\t\\t// if the distance of the neighbor can be shorter from the current node, change \\r\\n\\t\\t\\t\\t\\t// its details in distance and precedence\\r\\n\\t\\t\\t\\t\\tif ( distanceFromTheMinNode < distance.get(neighborNode.getId()) ) {\\r\\n\\t\\t\\t\\t\\t\\tdistance.replace(neighborNode.getId(), distanceFromTheMinNode);\\r\\n\\t\\t\\t\\t\\t\\t// renew the precedence of the neighbor node\\r\\n\\t\\t\\t\\t\\t\\tprecedence.put(neighborNode.getId(), new HashSet<String>());\\r\\n\\t\\t\\t\\t\\t\\tprecedence.get(neighborNode.getId()).add(minUnvisitedNode);\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\telse if (distanceFromTheMinNode == distance.get(neighborNode.getId())) {\\r\\n\\t\\t\\t\\t\\t\\t// unlike dijkstra's algorithm, multiple path should be update into the precedence\\r\\n\\t\\t\\t\\t\\t\\t// if from another node the distance is the same, add it to the precedence\\r\\n\\t\\t\\t\\t\\t\\tprecedence.get(neighborNode.getId()).add(minUnvisitedNode);\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\t\\t\\t\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t// if the current node in the process is the end node, we can stop the while loop here\\r\\n\\t\\t\\t\\tif (minUnvisitedNode == endNodeId) {\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tif (distance.get(endNodeId) == Double.MAX_VALUE) {\\r\\n\\t\\t\\t\\t// in case there is no shortest path between the 2 nodes\\r\\n\\t\\t\\t\\tlength = 0;\\r\\n\\t\\t\\t\\tnumOfPath = 0;\\r\\n\\t\\t\\t\\tpathList = null;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse {\\r\\n\\t\\t\\t\\t// other wise we have these information\\r\\n\\t\\t\\t\\tlength = distance.get(endNodeId);\\r\\n\\t\\t\\t\\t//numOfPath = this.getNumPath(precedence, startNodeId, endNodeId);\\r\\n\\t\\t\\t\\tpathList = this.findPathList(precedence, startNodeId, endNodeId);\\r\\n\\t\\t\\t\\tnumOfPath = pathList.size();\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t}\\t// END ELSE\\t\\t\\r\\n\\t}\",\n \"@Override\\n\\tpublic boolean findPath(PathfindingNode start, PathfindingNode end, ArrayList<PathfindingNode> path) \\n\\t{\\n\\t\\tpath.clear();\\n\\t\\t\\n\\t\\t_visited.clear();\\n\\t\\t_toVisit.clear();\\n\\t\\t_parents.clear();\\n\\t\\t_costsFromStart.clear();\\n\\t\\t_totalCosts.clear();\\n\\n\\t\\t_costsFromStart.put(start, 0);\\n\\t\\t_toVisit.add(start);\\n\\t\\t_parents.put(start, null);\\n\\t\\t\\n\\t\\twhile (!_toVisit.isEmpty() && !_toVisit.contains(end))\\n\\t\\t{\\n\\t\\t\\tPathfindingNode m = _toVisit.remove();\\n\\t\\t\\t\\n\\t\\t\\tint mCost = _costsFromStart.get(m);\\n\\t\\t\\t\\n\\t\\t\\tfor (int i = 0; i < m.getNeighbors().size(); ++i)\\n\\t\\t\\t{\\n\\t\\t\\t\\tPathfindingNodeEdge n = m.getNeighbors().get(i);\\n\\t\\t\\t\\tif (n.getNeighbor() != null && !_visited.contains(n.getNeighbor()))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tint costFromSource = mCost + n.getCost();\\n\\t\\t\\t\\t\\tint totalCost = costFromSource + _estimator.estimate(n.getNeighbor(), end);\\n\\t\\t\\t\\t\\tif (!_toVisit.contains(n.getNeighbor()) || totalCost < _totalCosts.get(n.getNeighbor()))\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t_parents.put(n.getNeighbor(), m);\\n\\t\\t\\t\\t\\t\\t_costsFromStart.put(n.getNeighbor(), costFromSource);\\n\\t\\t\\t\\t\\t\\t_totalCosts.put(n.getNeighbor(), totalCost);\\n\\t\\t\\t\\t\\t\\tif (_toVisit.contains(n.getNeighbor()))\\n\\t\\t\\t\\t\\t\\t\\t_toVisit.remove(n.getNeighbor());\\n\\t\\t\\t\\t\\t\\t_toVisit.add(n.getNeighbor());\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t_visited.add(m);\\n\\t\\t}\\n\\t\\t\\n\\t\\tif (_toVisit.contains(end))\\n\\t\\t{\\n\\t\\t\\t_reversePath.clear();\\n\\t\\t\\t\\n\\t\\t\\tPathfindingNode current = end;\\n\\t\\t\\twhile (current != null)\\n\\t\\t\\t{\\n\\t\\t\\t\\t_reversePath.push(current);\\n\\t\\t\\t\\tcurrent = _parents.get(current);\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\twhile (!_reversePath.isEmpty())\\n\\t\\t\\t\\tpath.add(_reversePath.pop());\\n\\t\\t\\t\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tpath.add(start);\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t}\",\n \"private Board DLS(Board start, Board goal, int depth) {\\n Board found = null;\\n // Paso base: Si start es la solucion y esta en el ultimo nivel, regresa\\n if((depth == 0) && start.equals(goal)) {\\n return start;\\n }\\n // Si el nivel aun no es el ultimo, se obtienen los nodos hijos\\n // y se vuelve a llamar la funcion en ellos\\n else if(depth > 0) {\\n // Obtiene los nodos hijos\\n // Todas las posibles configuraciones del tablero que se pueden\\n // hacer a partir de la actual\\n ArrayList<Board> children = start.expand();\\n\\n expandedNodes++;\\n\\n // Para cada hijo vuelve a hacer lo mismo\\n for(Board child : children) {\\n found = DLS(child, goal, depth - 1);\\n if(found != null)\\n return found;\\n }\\n }\\n return null;\\n }\",\n \"public String getParentNode()\\r\\n\\t{\\r\\n\\t\\tif (roadBelongingType.equals(\\\"inbound\\\"))\\r\\n\\t\\t{\\r\\n\\t\\t\\treturn endNode;\\r\\n\\t\\t}\\r\\n\\t\\telse\\r\\n\\t\\t{\\r\\n\\t\\t\\treturn startNode;\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public Iterator trip() {\\n\\t\\tStack path = new Stack();\\n\\t\\ttry {\\n\\t\\t\\t// initializes path to the stack of nodes from starting point to end\\n\\t\\t\\t// point\\n\\t\\t\\tpath = path(BusLines, BusLines.getNode(start), BusLines.getNode(dest));\\n\\n\\t\\t\\t// checks if there is a path, otherwise return null\\n\\t\\t\\tif (path == null) {\\n\\t\\t\\t\\treturn null;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\treturn path.iterator();\\n\\t\\t\\t}\\n\\t\\t} catch (GraphException e) {\\n\\t\\t\\tSystem.out.println(\\\"Error: the path does not exists.\\\");\\n\\t\\t}\\n\\t\\treturn null;\\n\\n\\t}\",\n \"protected String printablePath(IVertex<String> target){\\n\\n String lineout = \\\"\\\";\\n\\n LinkedList<IVertex<String>> path = this.getPath(target);\\n\\n IVertex<String> previous = null;\\n\\n IVertex<String> next = null;\\n\\n if(path!=null) {\\n Iterator<IVertex<String>> it = path.iterator();\\n\\n while (it.hasNext()) {\\n\\n previous = next;\\n\\n next = it.next();\\n\\n IWeightedEdge<String> prevedge = null;\\n\\n if(previous!=null && next!=null){\\n prevedge = this.weightedGraph.getEdge(previous,next);\\n }\\n\\n if(prevedge!=null)\\n lineout+= \\\" \\\" +prevedge.getWeight() + \\\" \\\";\\n\\n lineout += \\\" \\\" + next.getValue() + \\\" \\\";\\n }\\n }\\n return lineout;\\n }\",\n \"@Override\\n\\tpublic boolean traverse(INode startNode, INode destinationNode) {\\n\\t\\tif (isNeighbors(startNode, destinationNode) == true) {\\n\\t\\t\\tint zähler = 0;\\n\\t\\t\\tString result = \\\"\\\";\\n\\t\\t\\tMatrixNode startListNode = (MatrixNode) startNode;\\n\\t\\t\\tQueue<MatrixNode> queue = new ArrayDeque<>();\\n\\t\\t\\tqueue.add(startListNode);\\n\\t\\t\\tstartListNode.mark();\\n\\t\\t\\twhile (!queue.isEmpty()) { // solange queue nicht leer ist\\n\\t\\t\\t\\t// erstes Element von der queue nehmen\\n\\t\\t\\t\\tMatrixNode node = (MatrixNode) queue.poll();\\n\\t\\t\\t\\tif (node.equals(destinationNode)) {\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"Zähler: \\\" + zähler);\\n\\t\\t\\t\\t\\treturn true; // testen, ob Ziel-Knoten gefunden\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor (int i = 0; i < nodes.size(); i++) {\\n\\t\\t\\t\\t\\tif (isNeighbors(node, nodes.get(i))) {\\n\\t\\t\\t\\t\\t\\tif (!((MatrixNode) nodes.get(i)).getMark()) {\\n\\t\\t\\t\\t\\t\\t\\tqueue.add((MatrixNode) nodes.get(i));\\n\\t\\t\\t\\t\\t\\t\\t((MatrixNode) nodes.get(i)).mark();\\n\\t\\t\\t\\t\\t\\t\\tresult += node.getName() + \\\"-\\\" + nodes.get(i).getName();\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tzähler++;\\n\\t\\t\\t\\tSystem.out.println(result + \\\"||\\\");\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn false; // Knoten kann nicht erreicht werden\\n\\t}\",\n \"private List<Edge<String>> getPath(Vertex<String> end,\\n Vertex<String> start) {\\n if (graph.label(end) != null) {\\n List<Edge<String>> path = new ArrayList<>();\\n\\n Vertex<String> cur = end;\\n Edge<String> road;\\n while (cur != start) {\\n road = (Edge<String>) graph.label(cur); // unchecked cast ok\\n path.add(road);\\n cur = graph.from(road);\\n }\\n return path;\\n }\\n return null;\\n }\",\n \"private void printPath(LinkedList<String> visited) {\\r\\n\\r\\n if (flag == false) {\\r\\n System.out.println(\\\"Yes there exists a path between \\\" + START + \\\" and \\\" + END);\\r\\n }\\r\\n for (String node : visited) { //creating for loop to print the nodes stored in visited array \\r\\n System.out.print(node);\\r\\n System.out.print(\\\" \\\");\\r\\n }\\r\\n System.out.println();\\r\\n }\",\n \"public String getOutput() {\\n TopologicalOrderIterator<String, DefaultEdge> iterator =\\n new TopologicalOrderIterator<>(steps, Comparator.comparing((String x) -> x));\\n\\n // Traverse the DAG and store each vertex to a StringBuilder\\n // to output once traversal is completed\\n StringBuilder sb = new StringBuilder();\\n while (iterator.hasNext()) {\\n sb.append(iterator.next());\\n }\\n\\n return sb.toString();\\n }\",\n \"private Queue<T> backtrace(T node, Map<T, T> parentMap) {\\n LinkedList<T> path = new LinkedList<>();\\n path.add(node);\\n\\n int previousX, previousY, currentX, currentY;\\n int dx, dy;\\n int steps;\\n T temp;\\n while (parentMap.containsKey(node)) {\\n previousX = parentMap.get(node).x;\\n previousY = parentMap.get(node).y;\\n currentX = node.x;\\n currentY = node.y;\\n steps = Integer.max(Math.abs(previousX - currentX), Math.abs(previousY - currentY));\\n dx = Integer.compare(previousX, currentX);\\n dy = Integer.compare(previousY, currentY);\\n\\n temp = node;\\n for (int i = 0; i < steps; i++) {\\n temp = graph.getNode(temp.x + dx, temp.y + dy);\\n path.addFirst(temp);\\n }\\n\\n node = parentMap.get(node);\\n }\\n return path;\\n }\",\n \"public static ArrayList<GraphNode> getPathTo(\\n GraphNode startNode,\\n GraphNode targetNode,\\n int optimizeFor\\n ) {\\n PriorityQueue<GraphNodeWrapper> openList = new PriorityQueue<>(new GraphNodeWrapperComparator(targetNode));\\n HashSet<GraphNode> closedSet = new HashSet<>();\\n HashMap<GraphNode, Float> distanceToStart = new HashMap<>();\\n distanceToStart.put(startNode, 0.f);\\n\\n GraphNodeWrapper startNodeWrapper = new GraphNodeWrapper(startNode);\\n openList.add(startNodeWrapper);\\n\\n GraphNodeDistance graphNodeDistance = new GraphNodeDistance(optimizeFor);\\n\\n do {\\n GraphNodeWrapper currentNode = openList.poll();\\n assert currentNode != null;\\n\\n if (currentNode.graphNode.equals(targetNode)) {\\n return currentNode.toList();\\n }\\n\\n closedSet.add(currentNode.graphNode);\\n\\n expandNode(currentNode, openList, closedSet, distanceToStart, targetNode, graphNodeDistance);\\n } while (!openList.isEmpty());\\n\\n return null;\\n }\",\n \"private static LinkedList<Node> getRevesredPath(Node targetNode){\\n LinkedList<Node> arr = new LinkedList<>();\\n arr.add(targetNode);\\n while(targetNode.pathFromSouce !=null){\\n// System.out.println(targetNode);\\n// System.out.println(targetNode.pathFromSouce);\\n arr.add(targetNode.pathFromSouce);\\n targetNode = targetNode.pathFromSouce;\\n }\\n return arr;\\n }\",\n \"public LinkedList<Pair<DirType, Location>> getMove(int curX, int curY) {\\n // find the shortest path to each coin from this current position (we don't actually care about\\n // coins that we don't have a path to)\\n // then, find the shortest path from each of those coins to each other coin\\n\\n // then, we want all Hamiltonian paths (and all subpaths?) Traveling Salesman Problem\\n // i.e. we care about paths for as long as the number of steps it takes to complete\\n // is less than or equal to the number of turns we have remaining\\n\\n // convert the Location[][] we have into David and Austin's LocationsToNode\\n LocationsToNode graph = new LocationsToNode(maze);\\n // knownCoins are ONLY the coins we have paths to. we will calculate the\\n // shortest paths later. there are repeat calculations below.\\n LinkedList<Node> coins = bfsFindCoins(graph, curX, curY);\\n for (Node coinFrom : coins) {\\n Location coinFromLoc = graph.getLocation(coinFrom);\\n LinkedList<LinkedList<Location>> pathsToOthers = new LinkedList<LinkedList<Location>>();\\n for (Node coinTo : coins) {\\n Location coinToLoc = graph.getLocation(coinTo);\\n LinkedList<Location> path = getShortestPath(coinFrom, coinTo, graph);\\n pathsToOthers.add(path);\\n }\\n paths.put(coinFromLoc,pathsToOthers);\\n }\\n\\n // calculating all possible Hamiltonian paths....\\n // this is A LOT of paths we're talking about\\n // i.e. we want every path that visits every single coin\\n // so if we know 20 coins, starting at point 1, we have 19 choices\\n // for the second point, 18 for the third, and so on (this is on the order of\\n // n! total paths without dynamic programming, and might be too much brute force)\\n // https://en.wikipedia.org/wiki/Hamiltonian_path#Properties\\n // https://en.wikipedia.org/wiki/Travelling_salesman_problem#Heuristic_and_approximation_algorithms\\n // https://stackoverflow.com/questions/16555978/example-of-a-factorial-time-algorithm-o-n\\n // then, we will decide which Hamiltonian is the best for the number of\\n // moves we have available to us\\n\\n // instead, i am going to try only calculating the paths we can actually make with our current number\\n // of turns because we want the most coins in the fewest turns\\n\\n // WE ONLY CARE ABOUT THE LONGEST (COIN) PATH WITH THE SAME NUMBER OF TURNS\\n\\n return new LinkedList<Pair<DirType, Location>>();\\n }\",\n \"private List<Path> expandExecution(Path input) {\\n\\t\\tList<Path> childInputs = new ArrayList<>(); //store the paths generated from given path\\n\\t\\t\\n\\t\\t//search from the top node which have not been searched before\\n\\t\\tfor(int j = input.bound; j < input.path.size() - 1; j++){\\n\\t\\t\\tdouble[] probabilityArray = cfg.getTransition_matrix().getRow(input.path.get(j));\\n\\t\\t\\tfor(int i = 0; i < probabilityArray.length; i++){\\n\\t\\t\\t\\t//the node been visited before only have two situation:1.has been searched,2.the path contains it in the workList \\n\\t\\t\\t\\tif(probabilityArray[i] > 0 && i != input.path.get(j + 1) && unvisited.contains(i)){\\n\\t\\t\\t\\t\\tList<Integer> tempPath = new ArrayList<>();\\n\\t\\t\\t\\t\\tfor(int index = 0; index < j + 1; index++)\\n\\t\\t\\t\\t\\t\\ttempPath.add(input.path.get(index));\\n\\t\\t\\t\\t\\ttempPath.add(i);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tPath newInput = new Path(tempPath, j + 1);\\n\\t\\t\\t\\t\\tchildInputs.add(newInput);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn childInputs;\\n\\t}\",\n \"public List<List<Integer>> allPathsSourceTarget(int[][] graph) {\\n \\n boolean[] visited = new boolean[graph.length];\\n \\n List<Integer> paths = new ArrayList();\\n paths.add(0);\\n \\n List<List<Integer>> allPaths = new ArrayList();\\n \\n dfs(0,graph.length-1, paths,allPaths,visited,graph);\\n \\n return allPaths;\\n }\",\n \"private void printPath( Vertex dest )\\n {\\n if( dest.prev != null )\\n {\\n printPath( dest.prev );\\n // System.out.print( \\\" to \\\" );\\n }\\n System.out.print( dest.name +\\\" \\\" );\\n }\",\n \"private void findBestPath(){\\n\\t\\t// The method will try to find the best path for every starting point and will use the minimum\\n\\t\\tfor(int start = 0; start < this.getDimension(); start++){\\n\\t\\t\\tfindBestPath(start);\\t\\n\\t\\t}\\t\\n\\t}\",\n \"protected static void printPath(int[] thePath) {\\r\\n\\t\\t\\r\\n\\t\\tint[] orderedPath = new int[thePath.length];\\r\\n\\t\\r\\n\\t\\tfor (int i = 0; i < thePath.length; i++)\\r\\n\\t\\t\\torderedPath[i] = -1;\\r\\n\\t\\r\\n\\t\\torderedPath[0] = myEndPole;\\r\\n\\t\\tint i = myEndPole;\\r\\n\\t\\tint j = 1;\\r\\n\\t \\r\\n\\t\\twhile (true && j < orderedPath.length) {\\t\\r\\n\\t\\t\\tif (thePath[i] == -1 && i == START_POLE)\\r\\n\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\torderedPath[j] = thePath[i];\\t\\r\\n\\t\\t\\ti = thePath[i];\\r\\n\\t\\t\\tj++;\\r\\n\\t\\t}\\r\\n\\t\\r\\n\\t\\tSystem.out.print(\\\"The Shortest Path is \\\");\\r\\n\\t\\r\\n\\t\\tfor (i = orderedPath.length - 1; i >= 0; i--) {\\r\\n\\t\\t\\tif (orderedPath[i] == -1)\\r\\n\\t\\t\\t\\tcontinue;\\r\\n\\t\\t\\tif (i == 0) {\\r\\n\\t\\t\\t\\tSystem.out.print((orderedPath[i] + 1));\\r\\n\\t\\t\\t\\tcontinue;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tSystem.out.print((orderedPath[i] + 1) + \\\" -> \\\");\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tSystem.out.println();\\r\\n\\t\\tSystem.out.println();\\r\\n\\t}\",\n \"public static int p413ComputeShortestPathNumber(Vertex start, Vertex end){\\n\\t Queue<Vertex> queue=new LinkedList<Vertex>();\\n\\t Map<Vertex, Status> statusMap=new HashMap<Vertex, Status>();\\n\\t Map<Vertex, Integer> levelMap=new HashMap<Vertex, Integer>();\\n\\t List<List<Vertex>> allLevelList=new LinkedList<List<Vertex>>();\\n\\t \\n\\t queue.offer(start);\\n\\t statusMap.put(start, Status.Queued);\\n\\t levelMap.put(start, 0);\\n\\t \\n\\t Vertex vertex;\\n\\t int lastLevel=-1;\\n\\t List<Vertex> levelList = null;\\n\\t\\twhile ((vertex = queue.poll()) != null) {\\n\\t\\t\\tint currentLevel = levelMap.get(vertex);\\n\\n\\t\\t\\tif (currentLevel != lastLevel) {\\n\\t\\t\\t\\tlastLevel = currentLevel;\\n\\t\\t\\t\\tlevelList = new LinkedList<Vertex>();\\n\\n\\t\\t\\t\\tallLevelList.add(levelList);\\n\\t\\t\\t}\\n\\n\\t\\t\\tlevelList.add(vertex);\\n\\n\\t\\t\\tif (vertex.equals(end)) {\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\n\\t\\t\\tSet<Vertex> adjacentVertexes = vertex.getAdjacentVertexes();\\n\\t\\t\\tfor (Iterator iterator = adjacentVertexes.iterator(); iterator.hasNext();) {\\n\\t\\t\\t\\tVertex adjacent = (Vertex) iterator.next();\\n\\n\\t\\t\\t\\tif (statusMap.get(adjacent) == null) {\\n\\t\\t\\t\\t\\tqueue.offer(adjacent);\\n\\t\\t\\t\\t\\tstatusMap.put(adjacent, Status.Queued);\\n\\t\\t\\t\\t\\tlevelMap.put(adjacent, currentLevel + 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t \\n\\t int max=Integer.MIN_VALUE;\\n\\t List<Vertex> targetList=new LinkedList<Vertex>();\\n\\t targetList.add(end);\\n\\t for(int index=lastLevel-1;index>0;index--){\\n\\t\\t List<Vertex> lastLevelList = allLevelList.get(index);\\n\\t\\t List<Vertex> tmpList=new LinkedList<Vertex>();\\n\\n\\t\\t int count=0;\\n\\t\\t for (Iterator iterator = lastLevelList.iterator(); iterator.hasNext();) {\\n\\t\\t\\t\\tVertex lastLevelVertex = (Vertex) iterator.next();\\n\\t\\t\\t\\tfor (Iterator iterator2 = targetList.iterator(); iterator2.hasNext();) {\\n\\t\\t\\t\\t\\tVertex vertex2 = (Vertex) iterator2.next();\\n\\t\\t\\t\\t\\tif(lastLevelVertex.getAdjacentVertexes().contains(vertex2)){\\n\\t\\t\\t\\t\\t count++;\\n\\t\\t\\t\\t\\t tmpList.add(lastLevelVertex);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t}\\n\\t\\t }\\n\\t\\t \\n\\t\\t targetList=tmpList;\\n\\t\\t \\n\\t\\t if(count>max){\\n\\t\\t \\tmax=count;\\n\\t\\t }\\n\\t }\\n\\t \\n\\t return max;\\n\\t}\",\n \"@Nullable\\n private NodeWithCost<V, A> findShortestPath(@Nonnull DirectedGraph<V, A> graph,\\n V start, V goal, @Nonnull ToDoubleFunction<A> costf) {\\n PriorityQueue< NodeWithCost<V, A>> frontier = new PriorityQueue<>(61);\\n Map<V, NodeWithCost<V, A>> frontierMap = new HashMap<>(61);\\n // Size of explored is the expected number of nextArrows that we need to explore.\\n Set<V> explored = new HashSet<>(61);\\n return doFindShortestPath(start, frontier, frontierMap, goal, explored, graph, costf);\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7252731","0.68260264","0.6671419","0.66349065","0.66123354","0.6603679","0.6580846","0.65430224","0.6503828","0.6497051","0.64705145","0.6415798","0.6354924","0.6301623","0.62661606","0.6257092","0.6247333","0.6240979","0.62342954","0.6218692","0.6201339","0.61822736","0.61638755","0.6161555","0.615784","0.6138375","0.6133091","0.6125515","0.60950845","0.6085662","0.60761076","0.60759735","0.60746396","0.60578084","0.6057716","0.6049612","0.60491455","0.6041605","0.60329497","0.6028114","0.60175735","0.60131395","0.59889805","0.5967705","0.59585255","0.5923653","0.59173286","0.591711","0.59079725","0.5907154","0.5892662","0.5886021","0.5880837","0.5878566","0.5874012","0.5869622","0.5866186","0.5860932","0.58500445","0.5849529","0.58494806","0.58487463","0.5843069","0.58416235","0.58367574","0.5833183","0.58330417","0.58325326","0.58245397","0.5819622","0.5815147","0.5782093","0.576774","0.57615197","0.5757075","0.575676","0.57487386","0.5747141","0.57447153","0.573635","0.5730695","0.5728213","0.5721447","0.5717148","0.5715856","0.56990594","0.56988406","0.56945676","0.5693827","0.5693351","0.56831473","0.5678301","0.56759375","0.56749934","0.56735426","0.56707615","0.56660664","0.5662439","0.565879","0.5650343"],"string":"[\n \"0.7252731\",\n \"0.68260264\",\n \"0.6671419\",\n \"0.66349065\",\n \"0.66123354\",\n \"0.6603679\",\n \"0.6580846\",\n \"0.65430224\",\n \"0.6503828\",\n \"0.6497051\",\n \"0.64705145\",\n \"0.6415798\",\n \"0.6354924\",\n \"0.6301623\",\n \"0.62661606\",\n \"0.6257092\",\n \"0.6247333\",\n \"0.6240979\",\n \"0.62342954\",\n \"0.6218692\",\n \"0.6201339\",\n \"0.61822736\",\n \"0.61638755\",\n \"0.6161555\",\n \"0.615784\",\n \"0.6138375\",\n \"0.6133091\",\n \"0.6125515\",\n \"0.60950845\",\n \"0.6085662\",\n \"0.60761076\",\n \"0.60759735\",\n \"0.60746396\",\n \"0.60578084\",\n \"0.6057716\",\n \"0.6049612\",\n \"0.60491455\",\n \"0.6041605\",\n \"0.60329497\",\n \"0.6028114\",\n \"0.60175735\",\n \"0.60131395\",\n \"0.59889805\",\n \"0.5967705\",\n \"0.59585255\",\n \"0.5923653\",\n \"0.59173286\",\n \"0.591711\",\n \"0.59079725\",\n \"0.5907154\",\n \"0.5892662\",\n \"0.5886021\",\n \"0.5880837\",\n \"0.5878566\",\n \"0.5874012\",\n \"0.5869622\",\n \"0.5866186\",\n \"0.5860932\",\n \"0.58500445\",\n \"0.5849529\",\n \"0.58494806\",\n \"0.58487463\",\n \"0.5843069\",\n \"0.58416235\",\n \"0.58367574\",\n \"0.5833183\",\n \"0.58330417\",\n \"0.58325326\",\n \"0.58245397\",\n \"0.5819622\",\n \"0.5815147\",\n \"0.5782093\",\n \"0.576774\",\n \"0.57615197\",\n \"0.5757075\",\n \"0.575676\",\n \"0.57487386\",\n \"0.5747141\",\n \"0.57447153\",\n \"0.573635\",\n \"0.5730695\",\n \"0.5728213\",\n \"0.5721447\",\n \"0.5717148\",\n \"0.5715856\",\n \"0.56990594\",\n \"0.56988406\",\n \"0.56945676\",\n \"0.5693827\",\n \"0.5693351\",\n \"0.56831473\",\n \"0.5678301\",\n \"0.56759375\",\n \"0.56749934\",\n \"0.56735426\",\n \"0.56707615\",\n \"0.56660664\",\n \"0.5662439\",\n \"0.565879\",\n \"0.5650343\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.6826425"},"document_rank":{"kind":"string","value":"1"}}},{"rowIdx":27390,"cells":{"query":{"kind":"string","value":"/ Here we take the expanded nodes and print it."},"document":{"kind":"string","value":"private void printExpanded(Queue<Node> expanded){\n\n ArrayList<String> nodes = new ArrayList<>();\n\n for(Node s : expanded){\n if(s != null){\n nodes.add(s.getDigit().getDigitString());\n }\n }\n\n\n if (forbidden.size() == 0){\n\n int size = nodes.size();\n int index = 0;\n\n for(int m=0; m<size; m++){\n if(index == size - 1){\n\n System.out.print(nodes.get(index));\n break;\n }\n\n System.out.print(nodes.get(index)+\",\");\n index++;\n }\n }else{\n\n nodes.removeAll(forbidden);\n int size = nodes.size();\n int index = 0;\n\n for(int m=0; m<size; m++){\n if(index == size - 1){\n\n System.out.print(nodes.get(index));\n break;\n }\n\n System.out.print(nodes.get(index)+\",\");\n index++;\n }\n }\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["public void printTree() {\n Object[] nodeArray = this.toArray();\n for (int i = 0; i < nodeArray.length; i++) {\n System.out.println(nodeArray[i]);\n }\n }","public void tree()\n\t{\n\t\tIterable<Position<FileElement>> toPrint = fileSystem.PreOrder();\n\t\tfor (Position<FileElement> p : toPrint)\n\t\t{\n\t\t\tint depth = fileSystem.getDepth(p);\n\t\t\tfor (int i = 0; i < depth; i++)\n\t\t\t{\n\t\t\t\tSystem.out.print(\" \");\n\t\t\t}\n\t\t\tSystem.out.println(p.getValue());\n\t\t}\n\t}","private void printFullTree()\r\n {\r\n System.out.println(fullXmlTree.toString());\r\n }","private void printTree(Tree parse) {\n \t\tparse.pennPrint();\n \t}","public void printNodes() {\n\t\tprintNodes(root);\n\n\t}","public void printAll() {\n\t\tNode node = root;\n\t\twhile (node != null) {\n\t\t\tSystem.out.println(node.data);\n\t\t\tnode = node.left;\n\t\t}\n\t}","public void printTree() {\n\t\tSystem.out.println(printHelp(root));\r\n\t\t\r\n\t}","public void printTreeNodes(){\n logger.trace(\"Name: \"+this.getName());\n for(int i=0;i<this.getChildCount();i++){\n SearchBaseNode node = (SearchBaseNode) this.getChildAt(i);\n node.printTreeNodes();\n }\n }","private void printTree(Tree parse) {\n\t\tparse.pennPrint();\n\t}","public void printTree() {\n printTreeHelper(root);\n }","public void displayNodes() {\n Node node = this.head;\n StringBuilder sb = new StringBuilder();\n while (node != null) {\n sb.append(node.data).append(\" \");\n node = node.next;\n };\n\n System.out.println(sb.toString());\n }","@Override\n public void printTree() {\n System.out.println(\"node with char: \" + this.getChar() + \" and key: \" + this.getKey());\n int i = 0;\n for(IABTNode node : this.sons) {\n if(!node.isNull()) {\n System.out.print(\"Son \" + i + \" :\");\n node.printTree();\n }\n i++;\n }\n }","public void printOut() {\n\t\tif(root.left != null) {\n\t\t\tprintOut(root.left);\n\t\t}\n\t\t\n\t\tSystem.out.println(root.element);\n\t\t\n\t\tif(root.right != null) {\n\t\t\tprintOut(root.right);\n\t\t}\n\t}","public static String printTree()\r\n {\r\n String result = \"\";\r\n for (String s: tree.toArrayList())\r\n result = result + \" \" + s;\r\n return result;\r\n }","void Print() {\r\n\r\n AVLTreeNode node = root;\r\n\r\n printInorder(node);\r\n\r\n }","void printNode() {\n\t\tint j;\n\t\tSystem.out.print(\"[\");\n\t\tfor (j = 0; j <= lastindex; j++) {\n\n\t\t\tif (j == 0)\n\t\t\t\tSystem.out.print (\" * \");\n\t\t\telse\n\t\t\t\tSystem.out.print(keys[j] + \" * \");\n\n\t\t\tif (j == lastindex)\n\t\t\t\tSystem.out.print (\"]\");\n\t\t}\n\t}","public void printNode(Node n);","public void print()\n {\n for (Node curr = first; curr != null; curr = curr.next)\n System.out.print(curr.val + \" \");\n System.out.println();\n }","public void printTree() {\r\n\t if (expressionRoot == null) {\r\n\t return;\r\n\t }\r\n if (expressionRoot.right != null) {\r\n printTree(expressionRoot.right, true, \"\");\r\n }\r\n System.out.println(expressionRoot.data);\r\n if (expressionRoot.left != null) {\r\n printTree(expressionRoot.left, false, \"\");\r\n }\r\n }","public void printNodes(){\n for(int i =0; i<n;i++)\n System.out.print(key[i]+\" \");\n System.out.println(isLeaf);\n if (!isLeaf){\n for(int i =0; i<=n;i++){\n c[i].printNodes();\n }\n }\n }","private static void PrintNode(Node n, String prefix, int depth) {\r\n\r\n\t\ttry {\r\n\t\t\tSystem.out.print(\"\\n\" + Pad(depth) + \"[\" + n.getNodeName());\r\n\t\t\tNamedNodeMap m = n.getAttributes();\r\n\t\t\tfor (int i = 0; m != null && i < m.getLength(); i++) {\r\n\t\t\t\tNode item = m.item(i);\r\n\t\t\t\tSystem.out.print(\" \" + item.getNodeName() + \"=\"\r\n\t\t\t\t\t\t+ item.getNodeValue());\r\n\t\t\t}\r\n\t\t\tSystem.out.print(\"] \");\r\n\r\n\t\t\tboolean has_text = false;\r\n\t\t\tif (n.getNodeType() == Node.TEXT_NODE) {\r\n\t\t\t\thas_text = true;\r\n\t\t\t\tString valn = n.getNodeValue().trim();\r\n\t\t\t\tif (valn.length() > 0)\r\n\t\t\t\t\tSystem.out.print(\"\\n\" + Pad(depth) + \" \\\"\" + valn + \"\\\"\");\r\n\t\t\t}\r\n\r\n\t\t\tNodeList cn = n.getChildNodes();\r\n\r\n\t\t\tfor (int i = 0; cn != null && i < cn.getLength(); i++) {\r\n\t\t\t\tNode item = cn.item(i);\r\n\t\t\t\tif (item.getNodeType() == Node.TEXT_NODE) {\r\n\t\t\t\t\tString val = item.getNodeValue().trim();\r\n\t\t\t\t\tif (val.length() > 0)\r\n\t\t\t\t\t\tSystem.out.print(\"\\n\" + Pad(depth) + val + \"\\\"\");\r\n\t\t\t\t} else\r\n\t\t\t\t\tPrintNode(item, prefix, depth + 2);\r\n\t\t\t}\r\n\t\t} catch (Exception e) {\r\n\t\t\tSystem.out.println(Pad(depth) + \"Exception e: \");\r\n\t\t}\r\n\t}","public void printTree(){ \n System.out.format(\"The suffix tree for S = %s is: %n\",this.text); \n this.print(0, this.root); \n }","public void print(){\n NodeD tmp = this.head;\n\n while(tmp!=null){\n System.out.println(tmp.getObject().asString());\n tmp = tmp.getNext();\n }\n }","public void printAst(){\n explore(ctx);\n }","public void printNodes() {\n\t\tNode currentNode = headNode;\n\t\tif(currentNode==null) {\n\t\t\tSystem.out.println(\" The Node is Null\");\n\t\t\treturn;\n\t\t} else {\n\t\t\tSystem.out.print(\" \"+ currentNode.getData());\n\t\t\twhile(currentNode.getNextNode()!=null) {\n\t\t\t\tcurrentNode = currentNode.getNextNode();\n\t\t\t\tSystem.out.print(\"=> \"+ currentNode.getData());\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t}","private static void print(ArrayList<Node<BinaryTreeNode<Integer>>> n) {\n\t\tfor(int i=0; i<n.size(); i++) {\n\t\t\tNode<BinaryTreeNode<Integer>> head = n.get(i);\n\t\t\twhile(head != null) {\n\t\t\t\tSystem.out.print(head.data.data+\" \");\n\t\t\t\thead = head.next;\n\t\t\t}\n\t\t\tSystem.out.println();\n\t\t}\n\t}","public void print()\n\t{\n\t\tDNode tem=first;\n\t\tSystem.out.print(tem.distance+\" \");\n\t\twhile(tem.nextDNode!=null)\n\t\t{\n\t\t\ttem=tem.nextDNode;\n\t\t\tSystem.out.print(tem.distance+\" \");\n\t\t}\n\t\tSystem.out.println();\n\t}","public void printAllNodes() {\n\t\tNode current = head;\n\n\t\twhile( current != null ) {\n\t\t\tSystem.out.println(current.data);\n\t\t\tcurrent = current.next;\n\t\t}\n\t}","public String printTree() {\n printSideways();\n return \"\";\n }","public void print() {\n\t\tprint(root);\n\t}","public void print(){\n inorderTraversal(this.root);\n }","public void printSubNodes(int depth) {\r\n super.printSubNodes(depth);\r\n\r\n if (orderByList != null) {\r\n printLabel(depth, \"orderByList: \");\r\n orderByList.treePrint(depth + 1);\r\n }\r\n if (offset != null) {\r\n printLabel(depth, \"offset: \");\r\n offset.treePrint(depth + 1);\r\n }\r\n if (fetchFirst != null) {\r\n printLabel(depth, \"fetchFirst: \");\r\n fetchFirst.treePrint(depth + 1);\r\n }\r\n }","public void summarize () {\n\n TreeNodeVisitor visitor = new TreeNodeVisitor();\n traversal (visitor);\n visitor.log();\n \n }","public void print() {\n\t\ttraversePreOrder(root, 0);\n\t}","public void printTree() {\r\n printTree(overallRoot, 0);\r\n }","private static void printNode(@Nonnull Node<OWLClass> node) {\n DefaultPrefixManager pm = new DefaultPrefixManager(null, null, \"http://owl.man.ac.uk/2005/07/sssw/people#\");\n // Print out a node as a list of class names in curly brackets\n for (Iterator<OWLClass> it = node.getEntities().iterator(); it.hasNext();) {\n OWLClass cls = it.next();\n // User a prefix manager to provide a slightly nicer shorter name\n String shortForm = pm.getShortForm(cls);\n\n System.out.println(\"Short Name: \"+shortForm);\n //assertNotNull(shortForm);\n }\n }","private void printNode() {\n System.out.println(\"value:\" + value + \" next:\" + nextNode);\n }","static void postorderPrint(TreeNode node) {\n if (node == null)\n return;\n\n Iterator iter = node.getChildren().iterator();\n while (iter.hasNext()) {\n postorderPrint((TreeNode) iter.next());\n }\n System.out.print(\" \" + node.data);\n }","public void PrintMe() {\n\t\t/* AST NODE TYPE = AST EXP NIL */\n\t\t/**********************************/\n\t\tSystem.out.print(\"AST NODE: EXP_EXP\\n\");\n\n\t\t/*****************************/\n\t\t/* RECURSIVELY PRINT exp ... */\n\t\t/*****************************/\n\t\tif (exp != null) exp.PrintMe();\n\n\t\t/*********************************/\n\t\t/* Print to AST GRAPHIZ DOT file */\n\t\t/*********************************/\n\t\tAST_GRAPHVIZ.getInstance().logNode(\n\t\t\tSerialNumber,\n \"(exp)\");\n \n\t\t/****************************************/\n\t\t/* PRINT Edges to AST GRAPHVIZ DOT file */\n\t\t/****************************************/\n\t\tAST_GRAPHVIZ.getInstance().logEdge(SerialNumber, exp.SerialNumber);\n\n\t}","static void preorderPrint(TreeNode node) {\n if (node == null)\n return;\n\n System.out.print(\" \" + node.data);\n Iterator iter = node.getChildren().iterator();\n while (iter.hasNext()) {\n preorderPrint((TreeNode) iter.next());\n }\n }","public void print()\r\n {\r\n print(root);\r\n }","void print() {\t\r\n\t\tIterator<Elemento> e = t.iterator();\r\n\t\twhile(e.hasNext())\r\n\t\t\te.next().print();\r\n\t}","@Override\n\tpublic void printNode() {\n\t\tSystem.out.println(\"------Args_list------\");\n\t\te.printNode();\n\t\tif(a!=null)\n\t\t\ta.printNode();\n\t\t\n\t}","private void printTree(AvlNode<E> node){\n if(node != null){\n printTree(node.left);\n System.out.print(node.value);\n System.out.print(\" \");\n printTree(node.right);\n }\n }","public void display() {\n ITree.Node root = this.createNode(0);\n TreePrinter.printNode(root);\n }","public void prettyPrintTree() {\r\n\t\tSystem.out.print(\"prettyPrintTree starting\");\r\n\t\tfor (int i = 0; i <= this.getTreeDepth(); i++) {\r\n\t\t\tprettyPrintTree(root, 0, i);\r\n\t\t\tSystem.out.println();\r\n\t\t}\r\n\t}","private void printTree( BinaryNode<AnyType> t )\r\n\t{\r\n\t\tif( t != null )\r\n\t\t{\t\t\t\r\n\t\t\tprintTree( t.left );\r\n\t\t\tSystem.out.print( t.element+\" \");\r\n\t\t\tprintTree( t.right );\r\n\t\t}\r\n\t}","public void postOrderPrint() {\n\t\tpostOrderPrint(root);\n\t\tSystem.out.println();\n\t}","private void printTree(BinaryNode<AnyType> t) {\r\n\t\tif (t != null) {\r\n\t\t\tprintTree(t.left);\r\n\t\t\tSystem.out.println(t.element);\r\n\t\t\tprintTree(t.right);\r\n\t\t}\r\n\t}","public void print() {\n\t\tSystem.out.println(\"DECISION TREE\");\n\t\tString indent = \" \";\n\t\tprint(root, indent, \"\");\n\t}","public void printInOrder() { // not to be changed\n\t\tprintInOrder(root);\n\t}","public void print(){\n if (isLeaf){\n for(int i =0; i<n;i++)\n System.out.print(key[i]+\" \");\n System.out.println();\n }\n else{\n for(int i =0; i<n;i++){\n c[i].print();\n System.out.print(key[i]+\" \");\n }\n c[n].print();\n }\n }","public void print() {\r\n\t\tif(isEmpty()) {\r\n\t\t\tSystem.out.printf(\"%s is Empty%n\", name);\r\n\t\t\treturn;\r\n\t\t}\r\n\t\tSystem.out.printf(\"%s: %n\", name);\r\n\t\tNode<E> current = first;//node to traverse the list\r\n\t\t\r\n\t\twhile(current != null) {\r\n\t\t\tSystem.out.printf(\"%d \", current.data);\r\n\t\t\tcurrent = current.next;\r\n\t\t}\r\n\t\tSystem.out.println();\r\n\t}","public static void display(Node root){\r\n String str = \"[\"+root.data+\"] -> \";\r\n for(Node child : root.children){\r\n str += child.data + \", \";\r\n }\r\n System.out.println(str + \" . \");\r\n \r\n for(int i=0; i<root.children.size(); i++){\r\n Node child = root.children.get(i);\r\n display(child);\r\n }\r\n }","public static String printTree()\n {\n \tString tree = \"\";\n ArrayList<String> letters = converter.toArrayList();\n for(int i = 0; i < letters.size(); i++)\n {\n tree += letters.get(i);\n if(i + 1 < letters.size())\n \t tree += \" \";\n }\n \n return tree;\n }","protected void printTree(){\n if (this.leftNode != null){\n leftNode.printTree();\n }\n System.out.println(value);\n\n if (this.rightNode != null){\n rightNode.printTree();\n }\n }","static void printTree(AbstractNode root) throws IOException {\n if (root == null) {\n return;\n }\n System.out.println(root.toString());\n if(root.getTypeNode() == 0) {\n ConscellNode nextNode = (ConscellNode)root;\n printTree(nextNode.getFirst());\n printTree(nextNode.getNext());\n }\n }","public void levelOrderPrint() {\n\t\tlevelOrderPrint(root);\n\t}","public void displayNode() {\n\t\t\tSystem.out.println(\"{ \" + data + \" } \");\n\t\t}","public void printLDR() {\n if(!empty()) {\n printLDRNodes(root);\n System.out.println();\n }\n }","public void PrintMe(){\r\n\t\t/* AST NODE TYPE = AST SUBSCRIPT VAR */\r\n\t\t/*************************************/\r\n\t\tSystem.out.print(\"AST NODE PAREN EXP\\n\");\r\n \r\n\t\t\r\n\t\t/***************************************/\r\n\t\t/* PRINT Node to AST GRAPHVIZ DOT file */\r\n\t\t/***************************************/\r\n\t\tAST_GRAPHVIZ.getInstance().logNode(\r\n\t\t\tSerialNumber,\r\n\t\t\t\"(exp)\");\r\n\t\tif (e != null) AST_GRAPHVIZ.getInstance().logEdge(SerialNumber,e.SerialNumber);\r\n \r\n }","public void printTopView() {\r\n\t\tfinal ArrayList<Integer> nodeDataList = new ArrayList<>();\r\n\r\n\t\tgetLeftChildren(rootNode.left, nodeDataList);\r\n\t\tnodeDataList.add(rootNode.data);\r\n\t\tgetRightChildren(rootNode.right, nodeDataList);\r\n\r\n\t\tSystem.out.println(\"Printing Top View\");\r\n\r\n\t\tnodeDataList.forEach(nodeData -> {\r\n\t\t\tSystem.out.print(nodeData + \" \");\r\n\t\t});\r\n\t}","public void printInfo() {\n\t\tString nodeType = \"\";\n\t\tif (nextLayerNodes.size() == 0) {\n\t\t\tnodeType = \"Output Node\";\n\t\t} else if (prevLayerNodes.size() == 0) {\n\t\t\tnodeType = \"Input Node\";\n\t\t} else {\n\t\t\tnodeType = \"Hidden Node\";\n\t\t}\n\t\tSystem.out.printf(\"%n-----Node Values %s-----%n\", nodeType);\n\t\tSystem.out.printf(\"\tNumber of nodes in next layer: %d%n\", nextLayerNodes.size());\n\t\tSystem.out.printf(\"\tNumber of nodes in prev layer: %d%n\", prevLayerNodes.size());\n\t\tSystem.out.printf(\"\tNext Layer Node Weights:%n\");\n\t\tNode[] nextLayer = new Node[nextLayerNodes.keySet().toArray().length];\n\t\tfor (int i = 0; i < nextLayer.length; i++) {\n\t\t\tnextLayer[i] = (Node) nextLayerNodes.keySet().toArray()[i];\n\t\t}\n\t\tfor (int i = 0; i < nextLayerNodes.size(); i++) {\n\t\t\tSystem.out.printf(\"\t\t# %f%n\", nextLayerNodes.get(nextLayer[i]));\n\t\t}\n\t\tSystem.out.printf(\"%n\tPartial err partial out = %f%n%n\", getPartialErrPartialOut());\n\t}","public void printAll() {\n Node node = head;\n\n while (node != null) {\n System.out.println(node.getStudent());\n node = node.getLink();\n }\n System.out.println();\n }","public static void print()\r\n\t {\r\n\t\t Node n = head; \r\n\t\t\t\r\n\t\t\twhile(n!=null)\r\n\t\t\t{\r\n\t\t\t\tSystem.out.print(n.data+\" \");\r\n\t\t\t\r\n\t\t\t\tn=n.next;\r\n\t\t\t\t\r\n\t\t\t}\r\n\t }","public void print(){\r\n\t\t\tNode temp = this.head;\r\n\t\t\twhile(temp!=null){\r\n\t\t\t\tSystem.out.print(\"| prev=\"+temp.prev+\", val=\"+temp.val+\", next=\"+temp.next+\" |\");\r\n\t\t\t\ttemp = temp.next;\r\n\t\t\t}\r\n\t\t\tSystem.out.println();\r\n\t\t}","private void printInOrder(TreeNode N) {\n\t\tSystem.out.print(\"(\");\n\t\tif (N!=null) {\n\t\t\tprintInOrder(N.getLeftChild());\n\t\t\tSystem.out.print(N.getIsUsed());\n\t\t\tprintInOrder(N.getRightChild());\n\n\t\t}\n\t\tSystem.out.print(\")\");\n\t}","void printNodesWithEdges()\n {\n for ( int i = 0; i < this.numNodes; i++ )\n {\n Node currNode = this.nodeList.get(i);\n System.out.println(\"Node id: \" + currNode.id );\n \n int numEdges = currNode.connectedNodes.size();\n for ( int j = 0; j < numEdges; j++ )\n {\n Node currEdge = currNode.connectedNodes.get(j);\n System.out.print(currEdge.id + \",\");\n }\n\n System.out.println();\n } \n\n \n }","public void print(Node node) \n{\n PrintWriter w = new PrintWriter(new OutputStreamWriter(System.out), true);\n print(node, w);\n}","public void printGraphStructure() {\n\t\tSystem.out.println(\"Vector size \" + nodes.size());\n\t\tSystem.out.println(\"Nodes: \"+ this.getSize());\n\t\tfor (int i=0; i<nodes.size(); i++) {\n\t\t\tSystem.out.print(\"pos \"+i+\": \");\n\t\t\tNode<T> node = nodes.get(i);\n\t\t\tSystem.out.print(node.data+\" -- \");\n\t\t\tIterator<EDEdge<W>> it = node.lEdges.listIterator();\n\t\t\twhile (it.hasNext()) {\n\t\t\t\tEDEdge<W> e = it.next();\n\t\t\t\tSystem.out.print(\"(\"+e.getSource()+\",\"+e.getTarget()+\", \"+e.getWeight()+\")->\" );\n\t\t\t}\n\t\t\tSystem.out.println();\n\t\t}\n\t}","void printNodes(){\n\t\tfor(int i=0;i<Table.length;i++){\r\n\t\t\tfor(StockNode t=Table[i];t!=null;t=t.next){\r\n\t\t\t\tSystem.out.println(t.stockName+\":\"+t.stockValue+\" \"+t.transactions);\t\r\n\t\t\t}\r\n\t\t}\r\n\t}","private void print(Node x) {\n\t\tif (x == null) return;\n\t\tprint(x.getLeft());\n\t\tSystem.out.println(x);\n\t\tprint(x.getRight());\n\t}","@Override\r\n public String toString() {\r\n Queue<List<Node>> queue = new LinkedList<List<Node>>();\r\n queue.add(Arrays.asList(root));\r\n StringBuilder sb = new StringBuilder();\r\n while (!queue.isEmpty()) {\r\n Queue<List<Node>> nextQueue = new LinkedList<List<Node>>();\r\n while (!queue.isEmpty()) {\r\n List<Node> nodes = queue.remove();\r\n sb.append('{');\r\n Iterator<Node> it = nodes.iterator();\r\n while (it.hasNext()) {\r\n Node node = it.next();\r\n sb.append(node.toString());\r\n if (it.hasNext())\r\n sb.append(\", \");\r\n if (node instanceof BPTree.InternalNode)\r\n nextQueue.add(((InternalNode) node).children);\r\n }\r\n sb.append('}');\r\n if (!queue.isEmpty())\r\n sb.append(\", \");\r\n else {\r\n sb.append('\\n');\r\n }\r\n }\r\n queue = nextQueue;\r\n }\r\n return sb.toString();\r\n }","public void printTree(Node n) {\r\n\t\tif( !n.isNil ) {\r\n\t\t\tSystem.out.print(\"Key: \" + n.key + \" c: \" + n.color + \" p: \" + n.p + \" v: \"+ n.val + \" mv: \" + n.maxval + \"\\t\\tleft.key: \" + n.left.key + \"\\t\\tright.key: \" + n.right.key + \"\\n\");\r\n\t\t\tprintTree(n.left);\r\n\t\t\tprintTree(n.right);\r\n\t\t}\r\n\t}","void print() {\n Node current = this;\n while (current != null) {\n System.out.format(\"%d \", current.value);\n current = current.next;\n }\n System.out.println();\n }","@Override\n public String print() {\n ArrayList<K> inorderTraverse = inOrdorTraverseBST();\n \n System.out.print(\"In ascending order: \");\n for (int i=0; i<inorderTraverse.size(); i++) {\n System.out.print(inorderTraverse.get(i)+\" \");\n }\n System.out.println(\"\");\n return \"\";\n }","public void printDLR() {\n if(!empty()) {\n printDLRNodes(root);\n System.out.println();\n }\n }","@Override\n\t\tpublic String toString() {\n\t\t\tStringBuilder sb = new StringBuilder();\n\t\t\tpreOrderTraverse(expression.root, 1, sb);\n\t\t\treturn sb.toString();\n\t\t}","public void print_list() {\n \t \n \t//define current node as\n \t node<Type> current_node = new node<>();\n \t \n \t //now keep for loop and print the answer\n \t current_node = head;\n \t \n \t //print first element\n \t System.out.println(current_node.show_element());\n \t \n \t //now run for loop\n \t for (int i = 1 ; i <= len - 1 ; i ++) {\n \t\t \n \t\t //change current node\n \t\t current_node = current_node.show_next();\n \t\t \n \t\t //just print the answer\n \t\t System.out.println(current_node.show_element());\n \t }\n }","@Override\n public String toString() { // display subtree in order traversal\n String output = \"[\";\n LinkedList<Node<T>> q = new LinkedList<>();\n q.add(this);\n while(!q.isEmpty()) {\n Node<T> next = q.removeFirst();\n if(next.leftChild != null) q.add(next.leftChild);\n if(next.rightChild != null) q.add(next.rightChild);\n output += next.data.toString();\n if(!q.isEmpty()) output += \", \";\n }\n return output + \"]\";\n }","void printLevelOrder() {\n TreeNode2 nextLevelRoot = this;\n while (nextLevelRoot != null) {\n TreeNode2 current = nextLevelRoot;\n nextLevelRoot = null;\n while (current != null) {\n System.out.print(current.val + \" \");\n if (nextLevelRoot == null) {\n if (current.left != null)\n nextLevelRoot = current.left;\n else if (current.right != null)\n nextLevelRoot = current.right;\n }\n current = current.next;\n }\n System.out.println();\n }\n }","public void PrintMe()\r\n\t{\r\n\t\t/************************************/\r\n\t\t/* AST NODE TYPE = EXP NIL AST NODE */\r\n\t\t/************************************/\r\n\t\tSystem.out.print(\"AST NODE EXP NIL\\n\");\r\n\r\n\t\t\r\n\t\t/*********************************/\r\n\t\t/* Print to AST GRAPHIZ DOT file */\r\n\t\t/*********************************/\r\n\t\tAST_GRAPHVIZ.getInstance().logNode(\r\n\t\t\tSerialNumber,\r\n\t\t\t\"EXP\\nNIL\");\r\n\t\t\t\r\n\t}","private static String printNode(Node node) {\n\t\tif (node instanceof TextNode) {\n\t\t\tTextNode textNode = (TextNode) node;\n\t\t\treturn addEscapes(\n\t\t\t\t\ttextNode.getText(),\n\t\t\t\t\tEscapableArrays.textEscapable(),\n\t\t\t\t\tParserDelimiters.ESCAPE_DELIMITER.getValue()\n\t\t\t);\n\t\t}\n\t\t\n\t\tif (node instanceof ForLoopNode) {\n\t\t\treturn printForLoopNode((ForLoopNode) node);\n\t\t}\n\t\t\n\t\tif (node instanceof EchoNode) {\n\t\t\treturn printEchoNode((EchoNode) node);\n\t\t}\n\t\t\n\t\treturn \"\";\n\t}","public void print() {\n\t\tNode temp = head;\n\n\t\tif(temp == null) {\n\t\t\treturn;\n\t\t} \n\n\t\twhile(temp.next != null) {\n\t\t\tSystem.out.print(temp.data + \"->\");\n\t\t\ttemp = temp.next;\n\t\t}\n\t\tSystem.out.println(temp.data);\n\t}","private void echo(Node n) {\n\t outputIndentation();\n\t int type = n.getNodeType();\n\n\t switch (type) {\n\t case Node.ATTRIBUTE_NODE:\n\t out.print(\"ATTR:\");\n\t printlnCommon(n);\n\t break;\n\n\t case Node.CDATA_SECTION_NODE:\n\t out.print(\"CDATA:\");\n\t printlnCommon(n);\n\t break;\n\n\t case Node.COMMENT_NODE:\n\t out.print(\"COMM:\");\n\t printlnCommon(n);\n\t break;\n\n\t case Node.DOCUMENT_FRAGMENT_NODE:\n\t out.print(\"DOC_FRAG:\");\n\t printlnCommon(n);\n\t break;\n\n\t case Node.DOCUMENT_NODE:\n\t out.print(\"DOC:\");\n\t printlnCommon(n);\n\t break;\n\n\t case Node.DOCUMENT_TYPE_NODE:\n\t out.print(\"DOC_TYPE:\");\n\t printlnCommon(n);\n\t NamedNodeMap nodeMap = ((DocumentType)n).getEntities();\n\t indent += 2;\n\t for (int i = 0; i < nodeMap.getLength(); i++) {\n\t Entity entity = (Entity)nodeMap.item(i);\n\t echo(entity);\n\t }\n\t indent -= 2;\n\t break;\n\n\t case Node.ELEMENT_NODE:\n\t out.print(\"ELEM:\");\n\t printlnCommon(n);\n\n\t NamedNodeMap atts = n.getAttributes();\n\t indent += 2;\n\t for (int i = 0; i < atts.getLength(); i++) {\n\t Node att = atts.item(i);\n\t echo(att);\n\t }\n\t indent -= 2;\n\t break;\n\n\t case Node.ENTITY_NODE:\n\t out.print(\"ENT:\");\n\t printlnCommon(n);\n\t break;\n\n\t case Node.ENTITY_REFERENCE_NODE:\n\t out.print(\"ENT_REF:\");\n\t printlnCommon(n);\n\t break;\n\n\t case Node.NOTATION_NODE:\n\t out.print(\"NOTATION:\");\n\t printlnCommon(n);\n\t break;\n\n\t case Node.PROCESSING_INSTRUCTION_NODE:\n\t out.print(\"PROC_INST:\");\n\t printlnCommon(n);\n\t break;\n\n\t case Node.TEXT_NODE:\n\t out.print(\"TEXT:\");\n\t printlnCommon(n);\n\t break;\n\n\t default:\n\t out.print(\"UNSUPPORTED NODE: \" + type);\n\t printlnCommon(n);\n\t break;\n\t }\n\n\t indent++;\n\t for (Node child = n.getFirstChild(); child != null;\n\t child = child.getNextSibling()) {\n\t echo(child);\n\t }\n\t indent--;\n\t}","@Override\r\npublic void Display(int depth) {\n\tSystem.out.println(\"-\"+depth);\r\n children.forEach(com->com.Display(depth+2));\r\n }","public void print() {\r\n\r\n Node currentNode = this.head;\r\n while (currentNode != null) {\r\n System.out.print(currentNode.data + \" \");\r\n currentNode = currentNode.next;\r\n }\r\n\r\n }","public void displayNode() // display ourself\n\t{\n\t\tSystem.out.print('{');\n\t\tSystem.out.print(iData);\n\t\t\n\t\tSystem.out.print(\"} \");\n\t}","String showAllNodes();","public void print(){\n String res = \"\" + this.number;\n for(Edge edge: edges){\n res += \" \" + edge.toString() + \" \";\n }\n System.out.println(res.trim());\n }","public void print() {\n\t\tIntNode curr;\n\t\tfor (curr = head; curr != null; curr = curr.next) {\n\t\t\tSystem.out.print(curr.key + \" \");\n\t\t}\n\t\tSystem.out.println();\n\t}","public void printNode(){\r\n // make an appropriately lengthed array of formatting\r\n // to separate rows/space coordinates\r\n String[] separators = new String[puzzleSize + 2];\r\n separators[0] = \"\\n((\";\r\n for (int i=0; i<puzzleSize; i++)\r\n separators[i+1] = \") (\";\r\n separators[puzzleSize+1] = \"))\";\r\n // print the rows\r\n for (int i = 0; i<puzzleSize; i++){\r\n System.out.print(separators[i]);\r\n for (int j = 0; j<puzzleSize; j++){\r\n System.out.print(this.state[i][j]);\r\n if (j<puzzleSize-1)\r\n System.out.print(\" \");\r\n }\r\n }\r\n // print the space's coordinates\r\n int x = (int)this.space.getX();\r\n int y = (int)this.space.getY();\r\n System.out.print(separators[puzzleSize] + x + \" \" + y + separators[puzzleSize+1]);\r\n }","public void printList() {\n\t\tNode tnode = head;\n\t\twhile (tnode != null) {\n\t\t\tSystem.out.print(tnode.data + \"->\");\n\t\t\ttnode = tnode.next;\n\t\t}\n\t}","void printpopulateInorderSucc(Node t){\n\t\n\n}","public abstract List<Node> expand();","public void show() {\n\n\t\tNode n = head;\n\t\twhile (n.next != null) {\n\t\t\t//logger.info(n.data);\n\t\t\tn = n.next;\n\t\t}\n\t\t//logger.info(n.data);\n\n\t}","void printPostorder() { \n\t\tprintPostorder(root);\n\t}","public void print() {\n\t\tint i = 1;\n\t\tfor (String s: g.keySet()) {\n\t\t\tSystem.out.print(\"Element: \" + i++ + \" \" + s + \" --> \");\n\t\t\tfor (String k: g.get(s)) {\n\t\t\t\tSystem.out.print(k + \" ### \");\n\t\t\t}\n\t\t\tSystem.out.println();\n\t\t}\n\t}","public void printGraph()\n {\n Iterator<T> nodeIterator = nodeList.keySet().iterator();\n \n while (nodeIterator.hasNext())\n {\n GraphNode curr = nodeList.get(nodeIterator.next());\n \n while (curr != null)\n {\n System.out.print(curr.nodeId+\"(\"+curr.parentDist+\")\"+\"->\");\n curr = curr.next;\n }\n System.out.print(\"Null\");\n System.out.println();\n }\n }","public void print(Node node, PrintWriter w)\n{\n print(node, 0, w);\n}"],"string":"[\n \"public void printTree() {\\n Object[] nodeArray = this.toArray();\\n for (int i = 0; i < nodeArray.length; i++) {\\n System.out.println(nodeArray[i]);\\n }\\n }\",\n \"public void tree()\\n\\t{\\n\\t\\tIterable<Position<FileElement>> toPrint = fileSystem.PreOrder();\\n\\t\\tfor (Position<FileElement> p : toPrint)\\n\\t\\t{\\n\\t\\t\\tint depth = fileSystem.getDepth(p);\\n\\t\\t\\tfor (int i = 0; i < depth; i++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tSystem.out.print(\\\" \\\");\\n\\t\\t\\t}\\n\\t\\t\\tSystem.out.println(p.getValue());\\n\\t\\t}\\n\\t}\",\n \"private void printFullTree()\\r\\n {\\r\\n System.out.println(fullXmlTree.toString());\\r\\n }\",\n \"private void printTree(Tree parse) {\\n \\t\\tparse.pennPrint();\\n \\t}\",\n \"public void printNodes() {\\n\\t\\tprintNodes(root);\\n\\n\\t}\",\n \"public void printAll() {\\n\\t\\tNode node = root;\\n\\t\\twhile (node != null) {\\n\\t\\t\\tSystem.out.println(node.data);\\n\\t\\t\\tnode = node.left;\\n\\t\\t}\\n\\t}\",\n \"public void printTree() {\\n\\t\\tSystem.out.println(printHelp(root));\\r\\n\\t\\t\\r\\n\\t}\",\n \"public void printTreeNodes(){\\n logger.trace(\\\"Name: \\\"+this.getName());\\n for(int i=0;i<this.getChildCount();i++){\\n SearchBaseNode node = (SearchBaseNode) this.getChildAt(i);\\n node.printTreeNodes();\\n }\\n }\",\n \"private void printTree(Tree parse) {\\n\\t\\tparse.pennPrint();\\n\\t}\",\n \"public void printTree() {\\n printTreeHelper(root);\\n }\",\n \"public void displayNodes() {\\n Node node = this.head;\\n StringBuilder sb = new StringBuilder();\\n while (node != null) {\\n sb.append(node.data).append(\\\" \\\");\\n node = node.next;\\n };\\n\\n System.out.println(sb.toString());\\n }\",\n \"@Override\\n public void printTree() {\\n System.out.println(\\\"node with char: \\\" + this.getChar() + \\\" and key: \\\" + this.getKey());\\n int i = 0;\\n for(IABTNode node : this.sons) {\\n if(!node.isNull()) {\\n System.out.print(\\\"Son \\\" + i + \\\" :\\\");\\n node.printTree();\\n }\\n i++;\\n }\\n }\",\n \"public void printOut() {\\n\\t\\tif(root.left != null) {\\n\\t\\t\\tprintOut(root.left);\\n\\t\\t}\\n\\t\\t\\n\\t\\tSystem.out.println(root.element);\\n\\t\\t\\n\\t\\tif(root.right != null) {\\n\\t\\t\\tprintOut(root.right);\\n\\t\\t}\\n\\t}\",\n \"public static String printTree()\\r\\n {\\r\\n String result = \\\"\\\";\\r\\n for (String s: tree.toArrayList())\\r\\n result = result + \\\" \\\" + s;\\r\\n return result;\\r\\n }\",\n \"void Print() {\\r\\n\\r\\n AVLTreeNode node = root;\\r\\n\\r\\n printInorder(node);\\r\\n\\r\\n }\",\n \"void printNode() {\\n\\t\\tint j;\\n\\t\\tSystem.out.print(\\\"[\\\");\\n\\t\\tfor (j = 0; j <= lastindex; j++) {\\n\\n\\t\\t\\tif (j == 0)\\n\\t\\t\\t\\tSystem.out.print (\\\" * \\\");\\n\\t\\t\\telse\\n\\t\\t\\t\\tSystem.out.print(keys[j] + \\\" * \\\");\\n\\n\\t\\t\\tif (j == lastindex)\\n\\t\\t\\t\\tSystem.out.print (\\\"]\\\");\\n\\t\\t}\\n\\t}\",\n \"public void printNode(Node n);\",\n \"public void print()\\n {\\n for (Node curr = first; curr != null; curr = curr.next)\\n System.out.print(curr.val + \\\" \\\");\\n System.out.println();\\n }\",\n \"public void printTree() {\\r\\n\\t if (expressionRoot == null) {\\r\\n\\t return;\\r\\n\\t }\\r\\n if (expressionRoot.right != null) {\\r\\n printTree(expressionRoot.right, true, \\\"\\\");\\r\\n }\\r\\n System.out.println(expressionRoot.data);\\r\\n if (expressionRoot.left != null) {\\r\\n printTree(expressionRoot.left, false, \\\"\\\");\\r\\n }\\r\\n }\",\n \"public void printNodes(){\\n for(int i =0; i<n;i++)\\n System.out.print(key[i]+\\\" \\\");\\n System.out.println(isLeaf);\\n if (!isLeaf){\\n for(int i =0; i<=n;i++){\\n c[i].printNodes();\\n }\\n }\\n }\",\n \"private static void PrintNode(Node n, String prefix, int depth) {\\r\\n\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tSystem.out.print(\\\"\\\\n\\\" + Pad(depth) + \\\"[\\\" + n.getNodeName());\\r\\n\\t\\t\\tNamedNodeMap m = n.getAttributes();\\r\\n\\t\\t\\tfor (int i = 0; m != null && i < m.getLength(); i++) {\\r\\n\\t\\t\\t\\tNode item = m.item(i);\\r\\n\\t\\t\\t\\tSystem.out.print(\\\" \\\" + item.getNodeName() + \\\"=\\\"\\r\\n\\t\\t\\t\\t\\t\\t+ item.getNodeValue());\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tSystem.out.print(\\\"] \\\");\\r\\n\\r\\n\\t\\t\\tboolean has_text = false;\\r\\n\\t\\t\\tif (n.getNodeType() == Node.TEXT_NODE) {\\r\\n\\t\\t\\t\\thas_text = true;\\r\\n\\t\\t\\t\\tString valn = n.getNodeValue().trim();\\r\\n\\t\\t\\t\\tif (valn.length() > 0)\\r\\n\\t\\t\\t\\t\\tSystem.out.print(\\\"\\\\n\\\" + Pad(depth) + \\\" \\\\\\\"\\\" + valn + \\\"\\\\\\\"\\\");\\r\\n\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\tNodeList cn = n.getChildNodes();\\r\\n\\r\\n\\t\\t\\tfor (int i = 0; cn != null && i < cn.getLength(); i++) {\\r\\n\\t\\t\\t\\tNode item = cn.item(i);\\r\\n\\t\\t\\t\\tif (item.getNodeType() == Node.TEXT_NODE) {\\r\\n\\t\\t\\t\\t\\tString val = item.getNodeValue().trim();\\r\\n\\t\\t\\t\\t\\tif (val.length() > 0)\\r\\n\\t\\t\\t\\t\\t\\tSystem.out.print(\\\"\\\\n\\\" + Pad(depth) + val + \\\"\\\\\\\"\\\");\\r\\n\\t\\t\\t\\t} else\\r\\n\\t\\t\\t\\t\\tPrintNode(item, prefix, depth + 2);\\r\\n\\t\\t\\t}\\r\\n\\t\\t} catch (Exception e) {\\r\\n\\t\\t\\tSystem.out.println(Pad(depth) + \\\"Exception e: \\\");\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public void printTree(){ \\n System.out.format(\\\"The suffix tree for S = %s is: %n\\\",this.text); \\n this.print(0, this.root); \\n }\",\n \"public void print(){\\n NodeD tmp = this.head;\\n\\n while(tmp!=null){\\n System.out.println(tmp.getObject().asString());\\n tmp = tmp.getNext();\\n }\\n }\",\n \"public void printAst(){\\n explore(ctx);\\n }\",\n \"public void printNodes() {\\n\\t\\tNode currentNode = headNode;\\n\\t\\tif(currentNode==null) {\\n\\t\\t\\tSystem.out.println(\\\" The Node is Null\\\");\\n\\t\\t\\treturn;\\n\\t\\t} else {\\n\\t\\t\\tSystem.out.print(\\\" \\\"+ currentNode.getData());\\n\\t\\t\\twhile(currentNode.getNextNode()!=null) {\\n\\t\\t\\t\\tcurrentNode = currentNode.getNextNode();\\n\\t\\t\\t\\tSystem.out.print(\\\"=> \\\"+ currentNode.getData());\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"private static void print(ArrayList<Node<BinaryTreeNode<Integer>>> n) {\\n\\t\\tfor(int i=0; i<n.size(); i++) {\\n\\t\\t\\tNode<BinaryTreeNode<Integer>> head = n.get(i);\\n\\t\\t\\twhile(head != null) {\\n\\t\\t\\t\\tSystem.out.print(head.data.data+\\\" \\\");\\n\\t\\t\\t\\thead = head.next;\\n\\t\\t\\t}\\n\\t\\t\\tSystem.out.println();\\n\\t\\t}\\n\\t}\",\n \"public void print()\\n\\t{\\n\\t\\tDNode tem=first;\\n\\t\\tSystem.out.print(tem.distance+\\\" \\\");\\n\\t\\twhile(tem.nextDNode!=null)\\n\\t\\t{\\n\\t\\t\\ttem=tem.nextDNode;\\n\\t\\t\\tSystem.out.print(tem.distance+\\\" \\\");\\n\\t\\t}\\n\\t\\tSystem.out.println();\\n\\t}\",\n \"public void printAllNodes() {\\n\\t\\tNode current = head;\\n\\n\\t\\twhile( current != null ) {\\n\\t\\t\\tSystem.out.println(current.data);\\n\\t\\t\\tcurrent = current.next;\\n\\t\\t}\\n\\t}\",\n \"public String printTree() {\\n printSideways();\\n return \\\"\\\";\\n }\",\n \"public void print() {\\n\\t\\tprint(root);\\n\\t}\",\n \"public void print(){\\n inorderTraversal(this.root);\\n }\",\n \"public void printSubNodes(int depth) {\\r\\n super.printSubNodes(depth);\\r\\n\\r\\n if (orderByList != null) {\\r\\n printLabel(depth, \\\"orderByList: \\\");\\r\\n orderByList.treePrint(depth + 1);\\r\\n }\\r\\n if (offset != null) {\\r\\n printLabel(depth, \\\"offset: \\\");\\r\\n offset.treePrint(depth + 1);\\r\\n }\\r\\n if (fetchFirst != null) {\\r\\n printLabel(depth, \\\"fetchFirst: \\\");\\r\\n fetchFirst.treePrint(depth + 1);\\r\\n }\\r\\n }\",\n \"public void summarize () {\\n\\n TreeNodeVisitor visitor = new TreeNodeVisitor();\\n traversal (visitor);\\n visitor.log();\\n \\n }\",\n \"public void print() {\\n\\t\\ttraversePreOrder(root, 0);\\n\\t}\",\n \"public void printTree() {\\r\\n printTree(overallRoot, 0);\\r\\n }\",\n \"private static void printNode(@Nonnull Node<OWLClass> node) {\\n DefaultPrefixManager pm = new DefaultPrefixManager(null, null, \\\"http://owl.man.ac.uk/2005/07/sssw/people#\\\");\\n // Print out a node as a list of class names in curly brackets\\n for (Iterator<OWLClass> it = node.getEntities().iterator(); it.hasNext();) {\\n OWLClass cls = it.next();\\n // User a prefix manager to provide a slightly nicer shorter name\\n String shortForm = pm.getShortForm(cls);\\n\\n System.out.println(\\\"Short Name: \\\"+shortForm);\\n //assertNotNull(shortForm);\\n }\\n }\",\n \"private void printNode() {\\n System.out.println(\\\"value:\\\" + value + \\\" next:\\\" + nextNode);\\n }\",\n \"static void postorderPrint(TreeNode node) {\\n if (node == null)\\n return;\\n\\n Iterator iter = node.getChildren().iterator();\\n while (iter.hasNext()) {\\n postorderPrint((TreeNode) iter.next());\\n }\\n System.out.print(\\\" \\\" + node.data);\\n }\",\n \"public void PrintMe() {\\n\\t\\t/* AST NODE TYPE = AST EXP NIL */\\n\\t\\t/**********************************/\\n\\t\\tSystem.out.print(\\\"AST NODE: EXP_EXP\\\\n\\\");\\n\\n\\t\\t/*****************************/\\n\\t\\t/* RECURSIVELY PRINT exp ... */\\n\\t\\t/*****************************/\\n\\t\\tif (exp != null) exp.PrintMe();\\n\\n\\t\\t/*********************************/\\n\\t\\t/* Print to AST GRAPHIZ DOT file */\\n\\t\\t/*********************************/\\n\\t\\tAST_GRAPHVIZ.getInstance().logNode(\\n\\t\\t\\tSerialNumber,\\n \\\"(exp)\\\");\\n \\n\\t\\t/****************************************/\\n\\t\\t/* PRINT Edges to AST GRAPHVIZ DOT file */\\n\\t\\t/****************************************/\\n\\t\\tAST_GRAPHVIZ.getInstance().logEdge(SerialNumber, exp.SerialNumber);\\n\\n\\t}\",\n \"static void preorderPrint(TreeNode node) {\\n if (node == null)\\n return;\\n\\n System.out.print(\\\" \\\" + node.data);\\n Iterator iter = node.getChildren().iterator();\\n while (iter.hasNext()) {\\n preorderPrint((TreeNode) iter.next());\\n }\\n }\",\n \"public void print()\\r\\n {\\r\\n print(root);\\r\\n }\",\n \"void print() {\\t\\r\\n\\t\\tIterator<Elemento> e = t.iterator();\\r\\n\\t\\twhile(e.hasNext())\\r\\n\\t\\t\\te.next().print();\\r\\n\\t}\",\n \"@Override\\n\\tpublic void printNode() {\\n\\t\\tSystem.out.println(\\\"------Args_list------\\\");\\n\\t\\te.printNode();\\n\\t\\tif(a!=null)\\n\\t\\t\\ta.printNode();\\n\\t\\t\\n\\t}\",\n \"private void printTree(AvlNode<E> node){\\n if(node != null){\\n printTree(node.left);\\n System.out.print(node.value);\\n System.out.print(\\\" \\\");\\n printTree(node.right);\\n }\\n }\",\n \"public void display() {\\n ITree.Node root = this.createNode(0);\\n TreePrinter.printNode(root);\\n }\",\n \"public void prettyPrintTree() {\\r\\n\\t\\tSystem.out.print(\\\"prettyPrintTree starting\\\");\\r\\n\\t\\tfor (int i = 0; i <= this.getTreeDepth(); i++) {\\r\\n\\t\\t\\tprettyPrintTree(root, 0, i);\\r\\n\\t\\t\\tSystem.out.println();\\r\\n\\t\\t}\\r\\n\\t}\",\n \"private void printTree( BinaryNode<AnyType> t )\\r\\n\\t{\\r\\n\\t\\tif( t != null )\\r\\n\\t\\t{\\t\\t\\t\\r\\n\\t\\t\\tprintTree( t.left );\\r\\n\\t\\t\\tSystem.out.print( t.element+\\\" \\\");\\r\\n\\t\\t\\tprintTree( t.right );\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public void postOrderPrint() {\\n\\t\\tpostOrderPrint(root);\\n\\t\\tSystem.out.println();\\n\\t}\",\n \"private void printTree(BinaryNode<AnyType> t) {\\r\\n\\t\\tif (t != null) {\\r\\n\\t\\t\\tprintTree(t.left);\\r\\n\\t\\t\\tSystem.out.println(t.element);\\r\\n\\t\\t\\tprintTree(t.right);\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public void print() {\\n\\t\\tSystem.out.println(\\\"DECISION TREE\\\");\\n\\t\\tString indent = \\\" \\\";\\n\\t\\tprint(root, indent, \\\"\\\");\\n\\t}\",\n \"public void printInOrder() { // not to be changed\\n\\t\\tprintInOrder(root);\\n\\t}\",\n \"public void print(){\\n if (isLeaf){\\n for(int i =0; i<n;i++)\\n System.out.print(key[i]+\\\" \\\");\\n System.out.println();\\n }\\n else{\\n for(int i =0; i<n;i++){\\n c[i].print();\\n System.out.print(key[i]+\\\" \\\");\\n }\\n c[n].print();\\n }\\n }\",\n \"public void print() {\\r\\n\\t\\tif(isEmpty()) {\\r\\n\\t\\t\\tSystem.out.printf(\\\"%s is Empty%n\\\", name);\\r\\n\\t\\t\\treturn;\\r\\n\\t\\t}\\r\\n\\t\\tSystem.out.printf(\\\"%s: %n\\\", name);\\r\\n\\t\\tNode<E> current = first;//node to traverse the list\\r\\n\\t\\t\\r\\n\\t\\twhile(current != null) {\\r\\n\\t\\t\\tSystem.out.printf(\\\"%d \\\", current.data);\\r\\n\\t\\t\\tcurrent = current.next;\\r\\n\\t\\t}\\r\\n\\t\\tSystem.out.println();\\r\\n\\t}\",\n \"public static void display(Node root){\\r\\n String str = \\\"[\\\"+root.data+\\\"] -> \\\";\\r\\n for(Node child : root.children){\\r\\n str += child.data + \\\", \\\";\\r\\n }\\r\\n System.out.println(str + \\\" . \\\");\\r\\n \\r\\n for(int i=0; i<root.children.size(); i++){\\r\\n Node child = root.children.get(i);\\r\\n display(child);\\r\\n }\\r\\n }\",\n \"public static String printTree()\\n {\\n \\tString tree = \\\"\\\";\\n ArrayList<String> letters = converter.toArrayList();\\n for(int i = 0; i < letters.size(); i++)\\n {\\n tree += letters.get(i);\\n if(i + 1 < letters.size())\\n \\t tree += \\\" \\\";\\n }\\n \\n return tree;\\n }\",\n \"protected void printTree(){\\n if (this.leftNode != null){\\n leftNode.printTree();\\n }\\n System.out.println(value);\\n\\n if (this.rightNode != null){\\n rightNode.printTree();\\n }\\n }\",\n \"static void printTree(AbstractNode root) throws IOException {\\n if (root == null) {\\n return;\\n }\\n System.out.println(root.toString());\\n if(root.getTypeNode() == 0) {\\n ConscellNode nextNode = (ConscellNode)root;\\n printTree(nextNode.getFirst());\\n printTree(nextNode.getNext());\\n }\\n }\",\n \"public void levelOrderPrint() {\\n\\t\\tlevelOrderPrint(root);\\n\\t}\",\n \"public void displayNode() {\\n\\t\\t\\tSystem.out.println(\\\"{ \\\" + data + \\\" } \\\");\\n\\t\\t}\",\n \"public void printLDR() {\\n if(!empty()) {\\n printLDRNodes(root);\\n System.out.println();\\n }\\n }\",\n \"public void PrintMe(){\\r\\n\\t\\t/* AST NODE TYPE = AST SUBSCRIPT VAR */\\r\\n\\t\\t/*************************************/\\r\\n\\t\\tSystem.out.print(\\\"AST NODE PAREN EXP\\\\n\\\");\\r\\n \\r\\n\\t\\t\\r\\n\\t\\t/***************************************/\\r\\n\\t\\t/* PRINT Node to AST GRAPHVIZ DOT file */\\r\\n\\t\\t/***************************************/\\r\\n\\t\\tAST_GRAPHVIZ.getInstance().logNode(\\r\\n\\t\\t\\tSerialNumber,\\r\\n\\t\\t\\t\\\"(exp)\\\");\\r\\n\\t\\tif (e != null) AST_GRAPHVIZ.getInstance().logEdge(SerialNumber,e.SerialNumber);\\r\\n \\r\\n }\",\n \"public void printTopView() {\\r\\n\\t\\tfinal ArrayList<Integer> nodeDataList = new ArrayList<>();\\r\\n\\r\\n\\t\\tgetLeftChildren(rootNode.left, nodeDataList);\\r\\n\\t\\tnodeDataList.add(rootNode.data);\\r\\n\\t\\tgetRightChildren(rootNode.right, nodeDataList);\\r\\n\\r\\n\\t\\tSystem.out.println(\\\"Printing Top View\\\");\\r\\n\\r\\n\\t\\tnodeDataList.forEach(nodeData -> {\\r\\n\\t\\t\\tSystem.out.print(nodeData + \\\" \\\");\\r\\n\\t\\t});\\r\\n\\t}\",\n \"public void printInfo() {\\n\\t\\tString nodeType = \\\"\\\";\\n\\t\\tif (nextLayerNodes.size() == 0) {\\n\\t\\t\\tnodeType = \\\"Output Node\\\";\\n\\t\\t} else if (prevLayerNodes.size() == 0) {\\n\\t\\t\\tnodeType = \\\"Input Node\\\";\\n\\t\\t} else {\\n\\t\\t\\tnodeType = \\\"Hidden Node\\\";\\n\\t\\t}\\n\\t\\tSystem.out.printf(\\\"%n-----Node Values %s-----%n\\\", nodeType);\\n\\t\\tSystem.out.printf(\\\"\\tNumber of nodes in next layer: %d%n\\\", nextLayerNodes.size());\\n\\t\\tSystem.out.printf(\\\"\\tNumber of nodes in prev layer: %d%n\\\", prevLayerNodes.size());\\n\\t\\tSystem.out.printf(\\\"\\tNext Layer Node Weights:%n\\\");\\n\\t\\tNode[] nextLayer = new Node[nextLayerNodes.keySet().toArray().length];\\n\\t\\tfor (int i = 0; i < nextLayer.length; i++) {\\n\\t\\t\\tnextLayer[i] = (Node) nextLayerNodes.keySet().toArray()[i];\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < nextLayerNodes.size(); i++) {\\n\\t\\t\\tSystem.out.printf(\\\"\\t\\t# %f%n\\\", nextLayerNodes.get(nextLayer[i]));\\n\\t\\t}\\n\\t\\tSystem.out.printf(\\\"%n\\tPartial err partial out = %f%n%n\\\", getPartialErrPartialOut());\\n\\t}\",\n \"public void printAll() {\\n Node node = head;\\n\\n while (node != null) {\\n System.out.println(node.getStudent());\\n node = node.getLink();\\n }\\n System.out.println();\\n }\",\n \"public static void print()\\r\\n\\t {\\r\\n\\t\\t Node n = head; \\r\\n\\t\\t\\t\\r\\n\\t\\t\\twhile(n!=null)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tSystem.out.print(n.data+\\\" \\\");\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\tn=n.next;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\\r\\n\\t }\",\n \"public void print(){\\r\\n\\t\\t\\tNode temp = this.head;\\r\\n\\t\\t\\twhile(temp!=null){\\r\\n\\t\\t\\t\\tSystem.out.print(\\\"| prev=\\\"+temp.prev+\\\", val=\\\"+temp.val+\\\", next=\\\"+temp.next+\\\" |\\\");\\r\\n\\t\\t\\t\\ttemp = temp.next;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tSystem.out.println();\\r\\n\\t\\t}\",\n \"private void printInOrder(TreeNode N) {\\n\\t\\tSystem.out.print(\\\"(\\\");\\n\\t\\tif (N!=null) {\\n\\t\\t\\tprintInOrder(N.getLeftChild());\\n\\t\\t\\tSystem.out.print(N.getIsUsed());\\n\\t\\t\\tprintInOrder(N.getRightChild());\\n\\n\\t\\t}\\n\\t\\tSystem.out.print(\\\")\\\");\\n\\t}\",\n \"void printNodesWithEdges()\\n {\\n for ( int i = 0; i < this.numNodes; i++ )\\n {\\n Node currNode = this.nodeList.get(i);\\n System.out.println(\\\"Node id: \\\" + currNode.id );\\n \\n int numEdges = currNode.connectedNodes.size();\\n for ( int j = 0; j < numEdges; j++ )\\n {\\n Node currEdge = currNode.connectedNodes.get(j);\\n System.out.print(currEdge.id + \\\",\\\");\\n }\\n\\n System.out.println();\\n } \\n\\n \\n }\",\n \"public void print(Node node) \\n{\\n PrintWriter w = new PrintWriter(new OutputStreamWriter(System.out), true);\\n print(node, w);\\n}\",\n \"public void printGraphStructure() {\\n\\t\\tSystem.out.println(\\\"Vector size \\\" + nodes.size());\\n\\t\\tSystem.out.println(\\\"Nodes: \\\"+ this.getSize());\\n\\t\\tfor (int i=0; i<nodes.size(); i++) {\\n\\t\\t\\tSystem.out.print(\\\"pos \\\"+i+\\\": \\\");\\n\\t\\t\\tNode<T> node = nodes.get(i);\\n\\t\\t\\tSystem.out.print(node.data+\\\" -- \\\");\\n\\t\\t\\tIterator<EDEdge<W>> it = node.lEdges.listIterator();\\n\\t\\t\\twhile (it.hasNext()) {\\n\\t\\t\\t\\tEDEdge<W> e = it.next();\\n\\t\\t\\t\\tSystem.out.print(\\\"(\\\"+e.getSource()+\\\",\\\"+e.getTarget()+\\\", \\\"+e.getWeight()+\\\")->\\\" );\\n\\t\\t\\t}\\n\\t\\t\\tSystem.out.println();\\n\\t\\t}\\n\\t}\",\n \"void printNodes(){\\n\\t\\tfor(int i=0;i<Table.length;i++){\\r\\n\\t\\t\\tfor(StockNode t=Table[i];t!=null;t=t.next){\\r\\n\\t\\t\\t\\tSystem.out.println(t.stockName+\\\":\\\"+t.stockValue+\\\" \\\"+t.transactions);\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t}\",\n \"private void print(Node x) {\\n\\t\\tif (x == null) return;\\n\\t\\tprint(x.getLeft());\\n\\t\\tSystem.out.println(x);\\n\\t\\tprint(x.getRight());\\n\\t}\",\n \"@Override\\r\\n public String toString() {\\r\\n Queue<List<Node>> queue = new LinkedList<List<Node>>();\\r\\n queue.add(Arrays.asList(root));\\r\\n StringBuilder sb = new StringBuilder();\\r\\n while (!queue.isEmpty()) {\\r\\n Queue<List<Node>> nextQueue = new LinkedList<List<Node>>();\\r\\n while (!queue.isEmpty()) {\\r\\n List<Node> nodes = queue.remove();\\r\\n sb.append('{');\\r\\n Iterator<Node> it = nodes.iterator();\\r\\n while (it.hasNext()) {\\r\\n Node node = it.next();\\r\\n sb.append(node.toString());\\r\\n if (it.hasNext())\\r\\n sb.append(\\\", \\\");\\r\\n if (node instanceof BPTree.InternalNode)\\r\\n nextQueue.add(((InternalNode) node).children);\\r\\n }\\r\\n sb.append('}');\\r\\n if (!queue.isEmpty())\\r\\n sb.append(\\\", \\\");\\r\\n else {\\r\\n sb.append('\\\\n');\\r\\n }\\r\\n }\\r\\n queue = nextQueue;\\r\\n }\\r\\n return sb.toString();\\r\\n }\",\n \"public void printTree(Node n) {\\r\\n\\t\\tif( !n.isNil ) {\\r\\n\\t\\t\\tSystem.out.print(\\\"Key: \\\" + n.key + \\\" c: \\\" + n.color + \\\" p: \\\" + n.p + \\\" v: \\\"+ n.val + \\\" mv: \\\" + n.maxval + \\\"\\\\t\\\\tleft.key: \\\" + n.left.key + \\\"\\\\t\\\\tright.key: \\\" + n.right.key + \\\"\\\\n\\\");\\r\\n\\t\\t\\tprintTree(n.left);\\r\\n\\t\\t\\tprintTree(n.right);\\r\\n\\t\\t}\\r\\n\\t}\",\n \"void print() {\\n Node current = this;\\n while (current != null) {\\n System.out.format(\\\"%d \\\", current.value);\\n current = current.next;\\n }\\n System.out.println();\\n }\",\n \"@Override\\n public String print() {\\n ArrayList<K> inorderTraverse = inOrdorTraverseBST();\\n \\n System.out.print(\\\"In ascending order: \\\");\\n for (int i=0; i<inorderTraverse.size(); i++) {\\n System.out.print(inorderTraverse.get(i)+\\\" \\\");\\n }\\n System.out.println(\\\"\\\");\\n return \\\"\\\";\\n }\",\n \"public void printDLR() {\\n if(!empty()) {\\n printDLRNodes(root);\\n System.out.println();\\n }\\n }\",\n \"@Override\\n\\t\\tpublic String toString() {\\n\\t\\t\\tStringBuilder sb = new StringBuilder();\\n\\t\\t\\tpreOrderTraverse(expression.root, 1, sb);\\n\\t\\t\\treturn sb.toString();\\n\\t\\t}\",\n \"public void print_list() {\\n \\t \\n \\t//define current node as\\n \\t node<Type> current_node = new node<>();\\n \\t \\n \\t //now keep for loop and print the answer\\n \\t current_node = head;\\n \\t \\n \\t //print first element\\n \\t System.out.println(current_node.show_element());\\n \\t \\n \\t //now run for loop\\n \\t for (int i = 1 ; i <= len - 1 ; i ++) {\\n \\t\\t \\n \\t\\t //change current node\\n \\t\\t current_node = current_node.show_next();\\n \\t\\t \\n \\t\\t //just print the answer\\n \\t\\t System.out.println(current_node.show_element());\\n \\t }\\n }\",\n \"@Override\\n public String toString() { // display subtree in order traversal\\n String output = \\\"[\\\";\\n LinkedList<Node<T>> q = new LinkedList<>();\\n q.add(this);\\n while(!q.isEmpty()) {\\n Node<T> next = q.removeFirst();\\n if(next.leftChild != null) q.add(next.leftChild);\\n if(next.rightChild != null) q.add(next.rightChild);\\n output += next.data.toString();\\n if(!q.isEmpty()) output += \\\", \\\";\\n }\\n return output + \\\"]\\\";\\n }\",\n \"void printLevelOrder() {\\n TreeNode2 nextLevelRoot = this;\\n while (nextLevelRoot != null) {\\n TreeNode2 current = nextLevelRoot;\\n nextLevelRoot = null;\\n while (current != null) {\\n System.out.print(current.val + \\\" \\\");\\n if (nextLevelRoot == null) {\\n if (current.left != null)\\n nextLevelRoot = current.left;\\n else if (current.right != null)\\n nextLevelRoot = current.right;\\n }\\n current = current.next;\\n }\\n System.out.println();\\n }\\n }\",\n \"public void PrintMe()\\r\\n\\t{\\r\\n\\t\\t/************************************/\\r\\n\\t\\t/* AST NODE TYPE = EXP NIL AST NODE */\\r\\n\\t\\t/************************************/\\r\\n\\t\\tSystem.out.print(\\\"AST NODE EXP NIL\\\\n\\\");\\r\\n\\r\\n\\t\\t\\r\\n\\t\\t/*********************************/\\r\\n\\t\\t/* Print to AST GRAPHIZ DOT file */\\r\\n\\t\\t/*********************************/\\r\\n\\t\\tAST_GRAPHVIZ.getInstance().logNode(\\r\\n\\t\\t\\tSerialNumber,\\r\\n\\t\\t\\t\\\"EXP\\\\nNIL\\\");\\r\\n\\t\\t\\t\\r\\n\\t}\",\n \"private static String printNode(Node node) {\\n\\t\\tif (node instanceof TextNode) {\\n\\t\\t\\tTextNode textNode = (TextNode) node;\\n\\t\\t\\treturn addEscapes(\\n\\t\\t\\t\\t\\ttextNode.getText(),\\n\\t\\t\\t\\t\\tEscapableArrays.textEscapable(),\\n\\t\\t\\t\\t\\tParserDelimiters.ESCAPE_DELIMITER.getValue()\\n\\t\\t\\t);\\n\\t\\t}\\n\\t\\t\\n\\t\\tif (node instanceof ForLoopNode) {\\n\\t\\t\\treturn printForLoopNode((ForLoopNode) node);\\n\\t\\t}\\n\\t\\t\\n\\t\\tif (node instanceof EchoNode) {\\n\\t\\t\\treturn printEchoNode((EchoNode) node);\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn \\\"\\\";\\n\\t}\",\n \"public void print() {\\n\\t\\tNode temp = head;\\n\\n\\t\\tif(temp == null) {\\n\\t\\t\\treturn;\\n\\t\\t} \\n\\n\\t\\twhile(temp.next != null) {\\n\\t\\t\\tSystem.out.print(temp.data + \\\"->\\\");\\n\\t\\t\\ttemp = temp.next;\\n\\t\\t}\\n\\t\\tSystem.out.println(temp.data);\\n\\t}\",\n \"private void echo(Node n) {\\n\\t outputIndentation();\\n\\t int type = n.getNodeType();\\n\\n\\t switch (type) {\\n\\t case Node.ATTRIBUTE_NODE:\\n\\t out.print(\\\"ATTR:\\\");\\n\\t printlnCommon(n);\\n\\t break;\\n\\n\\t case Node.CDATA_SECTION_NODE:\\n\\t out.print(\\\"CDATA:\\\");\\n\\t printlnCommon(n);\\n\\t break;\\n\\n\\t case Node.COMMENT_NODE:\\n\\t out.print(\\\"COMM:\\\");\\n\\t printlnCommon(n);\\n\\t break;\\n\\n\\t case Node.DOCUMENT_FRAGMENT_NODE:\\n\\t out.print(\\\"DOC_FRAG:\\\");\\n\\t printlnCommon(n);\\n\\t break;\\n\\n\\t case Node.DOCUMENT_NODE:\\n\\t out.print(\\\"DOC:\\\");\\n\\t printlnCommon(n);\\n\\t break;\\n\\n\\t case Node.DOCUMENT_TYPE_NODE:\\n\\t out.print(\\\"DOC_TYPE:\\\");\\n\\t printlnCommon(n);\\n\\t NamedNodeMap nodeMap = ((DocumentType)n).getEntities();\\n\\t indent += 2;\\n\\t for (int i = 0; i < nodeMap.getLength(); i++) {\\n\\t Entity entity = (Entity)nodeMap.item(i);\\n\\t echo(entity);\\n\\t }\\n\\t indent -= 2;\\n\\t break;\\n\\n\\t case Node.ELEMENT_NODE:\\n\\t out.print(\\\"ELEM:\\\");\\n\\t printlnCommon(n);\\n\\n\\t NamedNodeMap atts = n.getAttributes();\\n\\t indent += 2;\\n\\t for (int i = 0; i < atts.getLength(); i++) {\\n\\t Node att = atts.item(i);\\n\\t echo(att);\\n\\t }\\n\\t indent -= 2;\\n\\t break;\\n\\n\\t case Node.ENTITY_NODE:\\n\\t out.print(\\\"ENT:\\\");\\n\\t printlnCommon(n);\\n\\t break;\\n\\n\\t case Node.ENTITY_REFERENCE_NODE:\\n\\t out.print(\\\"ENT_REF:\\\");\\n\\t printlnCommon(n);\\n\\t break;\\n\\n\\t case Node.NOTATION_NODE:\\n\\t out.print(\\\"NOTATION:\\\");\\n\\t printlnCommon(n);\\n\\t break;\\n\\n\\t case Node.PROCESSING_INSTRUCTION_NODE:\\n\\t out.print(\\\"PROC_INST:\\\");\\n\\t printlnCommon(n);\\n\\t break;\\n\\n\\t case Node.TEXT_NODE:\\n\\t out.print(\\\"TEXT:\\\");\\n\\t printlnCommon(n);\\n\\t break;\\n\\n\\t default:\\n\\t out.print(\\\"UNSUPPORTED NODE: \\\" + type);\\n\\t printlnCommon(n);\\n\\t break;\\n\\t }\\n\\n\\t indent++;\\n\\t for (Node child = n.getFirstChild(); child != null;\\n\\t child = child.getNextSibling()) {\\n\\t echo(child);\\n\\t }\\n\\t indent--;\\n\\t}\",\n \"@Override\\r\\npublic void Display(int depth) {\\n\\tSystem.out.println(\\\"-\\\"+depth);\\r\\n children.forEach(com->com.Display(depth+2));\\r\\n }\",\n \"public void print() {\\r\\n\\r\\n Node currentNode = this.head;\\r\\n while (currentNode != null) {\\r\\n System.out.print(currentNode.data + \\\" \\\");\\r\\n currentNode = currentNode.next;\\r\\n }\\r\\n\\r\\n }\",\n \"public void displayNode() // display ourself\\n\\t{\\n\\t\\tSystem.out.print('{');\\n\\t\\tSystem.out.print(iData);\\n\\t\\t\\n\\t\\tSystem.out.print(\\\"} \\\");\\n\\t}\",\n \"String showAllNodes();\",\n \"public void print(){\\n String res = \\\"\\\" + this.number;\\n for(Edge edge: edges){\\n res += \\\" \\\" + edge.toString() + \\\" \\\";\\n }\\n System.out.println(res.trim());\\n }\",\n \"public void print() {\\n\\t\\tIntNode curr;\\n\\t\\tfor (curr = head; curr != null; curr = curr.next) {\\n\\t\\t\\tSystem.out.print(curr.key + \\\" \\\");\\n\\t\\t}\\n\\t\\tSystem.out.println();\\n\\t}\",\n \"public void printNode(){\\r\\n // make an appropriately lengthed array of formatting\\r\\n // to separate rows/space coordinates\\r\\n String[] separators = new String[puzzleSize + 2];\\r\\n separators[0] = \\\"\\\\n((\\\";\\r\\n for (int i=0; i<puzzleSize; i++)\\r\\n separators[i+1] = \\\") (\\\";\\r\\n separators[puzzleSize+1] = \\\"))\\\";\\r\\n // print the rows\\r\\n for (int i = 0; i<puzzleSize; i++){\\r\\n System.out.print(separators[i]);\\r\\n for (int j = 0; j<puzzleSize; j++){\\r\\n System.out.print(this.state[i][j]);\\r\\n if (j<puzzleSize-1)\\r\\n System.out.print(\\\" \\\");\\r\\n }\\r\\n }\\r\\n // print the space's coordinates\\r\\n int x = (int)this.space.getX();\\r\\n int y = (int)this.space.getY();\\r\\n System.out.print(separators[puzzleSize] + x + \\\" \\\" + y + separators[puzzleSize+1]);\\r\\n }\",\n \"public void printList() {\\n\\t\\tNode tnode = head;\\n\\t\\twhile (tnode != null) {\\n\\t\\t\\tSystem.out.print(tnode.data + \\\"->\\\");\\n\\t\\t\\ttnode = tnode.next;\\n\\t\\t}\\n\\t}\",\n \"void printpopulateInorderSucc(Node t){\\n\\t\\n\\n}\",\n \"public abstract List<Node> expand();\",\n \"public void show() {\\n\\n\\t\\tNode n = head;\\n\\t\\twhile (n.next != null) {\\n\\t\\t\\t//logger.info(n.data);\\n\\t\\t\\tn = n.next;\\n\\t\\t}\\n\\t\\t//logger.info(n.data);\\n\\n\\t}\",\n \"void printPostorder() { \\n\\t\\tprintPostorder(root);\\n\\t}\",\n \"public void print() {\\n\\t\\tint i = 1;\\n\\t\\tfor (String s: g.keySet()) {\\n\\t\\t\\tSystem.out.print(\\\"Element: \\\" + i++ + \\\" \\\" + s + \\\" --> \\\");\\n\\t\\t\\tfor (String k: g.get(s)) {\\n\\t\\t\\t\\tSystem.out.print(k + \\\" ### \\\");\\n\\t\\t\\t}\\n\\t\\t\\tSystem.out.println();\\n\\t\\t}\\n\\t}\",\n \"public void printGraph()\\n {\\n Iterator<T> nodeIterator = nodeList.keySet().iterator();\\n \\n while (nodeIterator.hasNext())\\n {\\n GraphNode curr = nodeList.get(nodeIterator.next());\\n \\n while (curr != null)\\n {\\n System.out.print(curr.nodeId+\\\"(\\\"+curr.parentDist+\\\")\\\"+\\\"->\\\");\\n curr = curr.next;\\n }\\n System.out.print(\\\"Null\\\");\\n System.out.println();\\n }\\n }\",\n \"public void print(Node node, PrintWriter w)\\n{\\n print(node, 0, w);\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.75091845","0.7240713","0.71894604","0.70823896","0.7065136","0.706287","0.7039093","0.6979379","0.69171613","0.6915615","0.6894241","0.6880421","0.6855082","0.6846921","0.6829338","0.6819054","0.68090576","0.67836213","0.6773025","0.67710125","0.6757601","0.674866","0.6733039","0.6723227","0.6713387","0.6659839","0.66587305","0.6650472","0.66494155","0.66379553","0.6632483","0.66287947","0.6613763","0.6612235","0.65946496","0.65937734","0.6582802","0.6575682","0.6565965","0.6561957","0.6541086","0.6527261","0.6526091","0.6521472","0.64987785","0.6489991","0.6482849","0.64769375","0.6472585","0.6466965","0.6461414","0.6456195","0.6453549","0.6451633","0.64495826","0.6442533","0.6438339","0.6431009","0.6429392","0.6428141","0.6426455","0.64216673","0.6419693","0.6418471","0.6414064","0.64101976","0.6404691","0.64043987","0.6403127","0.63773793","0.6376441","0.6362495","0.6361775","0.6360222","0.63577706","0.6357732","0.6349285","0.6348226","0.6345307","0.63434243","0.6338806","0.63349533","0.63304853","0.63279706","0.63182604","0.63103515","0.6307593","0.6290412","0.6286285","0.62795484","0.6273416","0.6269881","0.626576","0.6263821","0.62551665","0.6250373","0.624927","0.62434417","0.62429106","0.62410915"],"string":"[\n \"0.75091845\",\n \"0.7240713\",\n \"0.71894604\",\n \"0.70823896\",\n \"0.7065136\",\n \"0.706287\",\n \"0.7039093\",\n \"0.6979379\",\n \"0.69171613\",\n \"0.6915615\",\n \"0.6894241\",\n \"0.6880421\",\n \"0.6855082\",\n \"0.6846921\",\n \"0.6829338\",\n \"0.6819054\",\n \"0.68090576\",\n \"0.67836213\",\n \"0.6773025\",\n \"0.67710125\",\n \"0.6757601\",\n \"0.674866\",\n \"0.6733039\",\n \"0.6723227\",\n \"0.6713387\",\n \"0.6659839\",\n \"0.66587305\",\n \"0.6650472\",\n \"0.66494155\",\n \"0.66379553\",\n \"0.6632483\",\n \"0.66287947\",\n \"0.6613763\",\n \"0.6612235\",\n \"0.65946496\",\n \"0.65937734\",\n \"0.6582802\",\n \"0.6575682\",\n \"0.6565965\",\n \"0.6561957\",\n \"0.6541086\",\n \"0.6527261\",\n \"0.6526091\",\n \"0.6521472\",\n \"0.64987785\",\n \"0.6489991\",\n \"0.6482849\",\n \"0.64769375\",\n \"0.6472585\",\n \"0.6466965\",\n \"0.6461414\",\n \"0.6456195\",\n \"0.6453549\",\n \"0.6451633\",\n \"0.64495826\",\n \"0.6442533\",\n \"0.6438339\",\n \"0.6431009\",\n \"0.6429392\",\n \"0.6428141\",\n \"0.6426455\",\n \"0.64216673\",\n \"0.6419693\",\n \"0.6418471\",\n \"0.6414064\",\n \"0.64101976\",\n \"0.6404691\",\n \"0.64043987\",\n \"0.6403127\",\n \"0.63773793\",\n \"0.6376441\",\n \"0.6362495\",\n \"0.6361775\",\n \"0.6360222\",\n \"0.63577706\",\n \"0.6357732\",\n \"0.6349285\",\n \"0.6348226\",\n \"0.6345307\",\n \"0.63434243\",\n \"0.6338806\",\n \"0.63349533\",\n \"0.63304853\",\n \"0.63279706\",\n \"0.63182604\",\n \"0.63103515\",\n \"0.6307593\",\n \"0.6290412\",\n \"0.6286285\",\n \"0.62795484\",\n \"0.6273416\",\n \"0.6269881\",\n \"0.626576\",\n \"0.6263821\",\n \"0.62551665\",\n \"0.6250373\",\n \"0.624927\",\n \"0.62434417\",\n \"0.62429106\",\n \"0.62410915\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.7714829"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":27391,"cells":{"query":{"kind":"string","value":"/ Here we temporarily make the children. No parentchild connections are made here. This is a helper function to cycleCheck"},"document":{"kind":"string","value":"private ArrayList<String> makeChildren(Node current) {\n\n ArrayList<String> current_children = new ArrayList<>();\n\n if (current != null && current.getDigit().last_changed != 0) {\n //-1 child first digit\n if ((Integer.parseInt(current.getDigit().getFirst_digit()) - 1 >= 0)) {\n String child_node = current.getDigit().decreaseFirstDigit();\n current_children.add(child_node);\n }\n\n //+1 child first digit\n if ((Integer.parseInt(current.getDigit().getFirst_digit()) + 1 <= 9)) {\n String child_node = current.getDigit().increaseFirstDigit();\n current_children.add(child_node);\n }\n }\n\n if (current != null && current.getDigit().last_changed != 1) {\n //-1 child\n if ((Integer.parseInt(current.getDigit().getSecond_digit()) - 1 >= 0)) {\n String child_node = current.getDigit().decreaseSecondDigit();\n current_children.add(child_node);\n }\n\n //+1 child\n if ((Integer.parseInt(current.getDigit().getSecond_digit()) + 1 <= 9)) {\n String child_node = current.getDigit().increaseSecondDigit();\n current_children.add(child_node);\n }\n }\n\n if (current != null && current.getDigit().last_changed != 2) {\n //-1 child\n if ((Integer.parseInt(current.getDigit().getThird_digit()) - 1 >= 0)) {\n String child_node = current.getDigit().decreaseThirdDigit();\n current_children.add(child_node);\n }\n //+1 child\n if ((Integer.parseInt(current.getDigit().getThird_digit()) + 1 <= 9)) {\n String child_node = current.getDigit().increaseThirdDigit();\n current_children.add(child_node);\n }\n }\n return current_children;\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["private void createChildren() {\n\t\t\n\t\tfor(int i=0;i<horizontal;i++) {\n\t\t\t\n\t\t\tAction a = new Action(i);\n\t\t\tif(!gameOver && actionIsValid(a)) {\n\t\t\t\t\n\t\t\t\tPlayer otherPlayer;\n\t\t\t\t\n\t\t\t\tif(player == Player.PLAYER_BLUE) {\n\t\t\t\t\totherPlayer = Player.PLAYER_RED;\n\t\t\t\t}else {\n\t\t\t\t\totherPlayer = Player.PLAYER_BLUE;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tPosition newPosition;\n\t\t\t\tnewPosition = new Position(a, ++moveCounter, otherPlayer, this);\n\t\t\t\tchildren.add(newPosition);\t\n\t\t\t}\n\t\t}\n\t}","public static void computeChildren() {\n\t\tArrayList<BNNode> children = new ArrayList<BNNode>();\n\t\t// For each node, build an array of children by checking which nodes have it as a parent.\n\t\tfor (BNNode node : nodes) {\n\t\t\tchildren.clear();\n\t\t\tfor (BNNode node2 : nodes) {\n\t\t\t\tif (node == node2)\n\t\t\t\t\tcontinue;\n\t\t\t\tfor (BNNode node3 : node2.parents)\n\t\t\t\t\tif (node3 == node)\n\t\t\t\t\t\tchildren.add(node2);\n\t\t\t}\n\t\t\tnode.children = new BNNode[children.size()];\n\t\t\tnode.children = (BNNode[]) children.toArray(node.children);\n\t\t}\n\t}","public void reloadChildren() {\n // clear children list. If later none get created, then there shouldn't be any\n clearChildren();\n // check if budgetAccount has sub budgets\n List<BudgetAccountBE> subBudgets = refAcc.getDirectSubBudgets();\n int childCount = subBudgets.size();\n // only act, if referenceAccount has sub budgets\n if (childCount > 0) {\n int newLevel = hierarchyLevel + 1;\n // differentiate isLast for children\n for (int index = 0; index < childCount; index++) {\n BudgetAccountTableRow newRow = BudgetAccountTableRow.getInstance(parentActivity);\n children.add(newRow);\n newRow.init(budgetListener, subBudgets.get(index), (index == childCount -1), newLevel);\n }\n }\n }","public void growthCycle() {\n\t\tboolean doMore = true;\n\t\tdo {\n\t\t\tdoMore = false;\n\t\t\tgrower = planter;\n\t\t\tCollections.shuffle(grower, random);\n\t\t\tplanter = new ArrayList<Room>();\n\t\t\tfor(Room room : grower) {\n\t\t\t\tif(rooms.size() >= size.maxRooms) {\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif(room.plantChildren(this)) {\n\t\t\t\t\t//System.out.println(\"Added side room.\");\n\t\t\t\t\tdoMore = true;\n\t\t\t\t}\n\t\t\t} \n\t\t} while(doMore);\t\t\n\t\t//DoomlikeDungeons.profiler.endTask(\"Adding Rooms (growthCycle)\");\n\t}","public void selectParents1() {\n // Create a new parent list for this reproductive cycle. Let the garbage\n // handler dispose of the old list, if there was one.\n switch (Defines.parentAlgo) {\n case Defines.PA_RANDOM:\n this.parents = this.selectParentsRandom();\n break;\n\n case Defines.PA_ROULETTE:\n this.parents = this.selectParentsRoulette();\n break;\n\n case Defines.PA_TOURNAMENT:\n this.parents = this.selectParentsTournament();\n break;\n }\n// this.howGoodAreParents();\n }","@Override\r\n\tpublic void makeChildcare() {\n\t\t\r\n\t}","public void init$Children() {\n }","public void init$Children() {\n }","public void init$Children() {\n }","public static void checkCycleSample() {\n Node ll1_5 = new Node(1, new Node(2, new Node(3, new Node(4, new Node(5, null)))));\n\n Node ll1_2 = new Node(1, new Node(2, null));\n Node ll3_4 = new Node(3, new Node(4, null));\n Node ll5_6 = new Node(5, new Node(6, null));\n ll1_2.nextNode.nextNode = ll3_4;\n ll3_4.nextNode.nextNode = ll5_6;\n ll5_6.nextNode.nextNode = ll1_2;\n\n ll1_2.checkCycle();\n ll1_5.checkCycle();\n }","protected void prepareToExecuteChildren()\n \t{\n \t\tcollectExecutableElements();\n \t}","public void selectParents() {\n // Create a new parent list for this reproductive cycle. Let the garbage\n // handler dispose of the old list, if there was one.\n switch (Defines.parentAlgo) {\n case Defines.PA_RANDOM:\n this.parents = this.selectParentsRandom();\n break;\n\n case Defines.PA_ROULETTE:\n this.parents = this.selectParentsRoulette();\n break;\n\n case Defines.PA_TOURNAMENT:\n this.parents = this.selectParentsTournament();\n break;\n }\n// this.howGoodAreParents();\n }","public void rebuild() {\n\t\tif (!divided) {\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tint totalChildren = 0;\n\t\tfor (QuadTreeNode<E> q : nodes) {\n\t\t\t// If there is a divided child then we cant do anything\n\t\t\tif (q.isDivided()) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t\n\t\t\ttotalChildren += q.numPoints();\n\t\t}\n\t\t\n\t\t// If the sum of all the children contained in the sub nodes\n\t\t// is greater than allowed then we cant do anything\n\t\tif (totalChildren > QUADTREE_NODE_CAPACITY) {\n\t\t\treturn;\n\t\t}\n\t\t\n\t\t// Add all the nodes from the children to this node then remvoe the nodes\n\t\tpoints = new HashMap<Point, E>();\n\t\tfor (QuadTreeNode<E> q : nodes) {\n\t\t\tpoints.putAll(q.points);\n\t\t}\n\t\t\n\t\tnodes.clear();\n\t\tdivided = false;\n\t}","public DynamicModelPart buildChildrenUsingSeeds() {\n this.children.parallelStream().forEach(child -> {\n child.buildUsingSeeds();\n });\n return this;\n }","public void testGetChildren() throws IOException {\n FileObject fobj = getFileObject(testFile);\n FileObject parent = fobj.getParent();\n parent = parent.createFolder(\"parent\");\n File pFile = getFile(parent);\n for (int i = 0; i < 10; i++) {\n assertTrue(new File(pFile, \"file\" + i).createNewFile());\n assertTrue(new File(pFile, \"fold\" + i).mkdir());\n }\n monitor.reset();\n FileObject[] children = parent.getChildren();\n //20 x children, 1 x File.listFiles \n monitor.getResults().assertResult(21, StatFiles.ALL);\n monitor.getResults().assertResult(21, StatFiles.READ);\n //second time\n monitor.reset();\n children = parent.getChildren();\n monitor.getResults().assertResult(0, StatFiles.ALL);\n }","private Node constructInternal(List<Node> children){\r\n\r\n // Base case: root found\r\n if(children.size() == 1){\r\n return children.get(0);\r\n }\r\n\r\n // Generate parents\r\n boolean odd = children.size() % 2 != 0;\r\n for(int i = 1; i < children.size(); i += 2){\r\n Node left = children.get(i-1);\r\n Node right = children.get(i);\r\n Node parent = new Node(Utility.SHA512(left.hash + right.hash), left, right);\r\n children.add(parent);\r\n }\r\n\r\n // If the number of nodes is odd, \"inherit\" the remaining child node (no hash needed)\r\n if(odd){\r\n children.add(children.get(children.size() - 1));\r\n }\r\n return constructInternal(children);\r\n }","private static ArrayList<MMT> generateChildren(Board currentBoard, String mPlayer, boolean ifChildMax, int depthToGo){\n\t\t//System.out.println(\"generate children! depth to go is \" + depthToGo);\n\t\tif (depthToGo == 0)\n\t\t\treturn null;\n\t\tArrayList<MMT> childLst = new ArrayList<MMT>();\n\t\tfor (int j = 0; j<Board.getNumCol(); j++){\n\t\t\tBoard childBoard = new Board(currentBoard);\n\t\t\tboolean success = childBoard.fillBoard(j, getCurrentNodePiece(mPlayer, ifChildMax));\n\t\t\t//Board.printBoard(childBoard);\n\t\t\t//System.out.println(\"score for this board: \" + Eval.evalBoard(childBoard, mPlayer));\n\t\t\t//if valid move, then add board\n\t\t\tif (success){\n\t\t\t\t//set depth to 0 (to stop) if someone wins or tie\n\t\t\t\tint depth;\n\t\t\t\tif (Eval.checkTie(childBoard) || Eval.ifHumanWon(childBoard) ||\n\t\t\t\t\t\tEval.ifPCWon(childBoard)){\n\t\t\t\t\tdepth = 0;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tdepth = depthToGo -1;\n\t\t\t\t\t//depth = depthToGo; //depth not reduced at constructor\n\t\t\t\tMMT child = new MMT(childBoard, depth, mPlayer, ifChildMax, j);\n\t\t\t\tchildLst.add(child);\n\t\t\t}\n\t\t}\n\t\tif (childLst.size() == 0)\n\t\t\treturn null;\n\t\treturn childLst;\n\t}","public void resetParents() {\r\n }","public void init$Children() {\n children = new ASTNode[1];\n }","public void testGetChildrenCaches() throws IOException {\n FileObject fobj = getFileObject(testFile);\n FileObject parent = fobj.getParent();\n List<FileObject> l = new ArrayList<FileObject>();\n parent = parent.createFolder(\"parent\");\n for (int i = 0; i < 20; i++) {\n l.add(parent.createData(\"file\" + i + \".txt\"));\n }\n\n monitor.reset();\n //20 x FileObject + 1 File.listFiles\n FileObject[] children = parent.getChildren();\n monitor.getResults().assertResult(1, StatFiles.ALL);\n monitor.getResults().assertResult(1, StatFiles.READ);\n for (FileObject ch : children) {\n assertNull(\"No sibling\", FileUtil.findBrother(ch, \"exe\"));\n }\n monitor.getResults().assertResult(1, StatFiles.ALL);\n monitor.getResults().assertResult(1, StatFiles.READ);\n }","public DynamicModelPart buildChildren() {\n this.children.parallelStream().forEach(child -> {\n child.build();\n });\n return this;\n }","private void initSubNodes()\n {\n children = createSubNodes(false);\n attributes = createSubNodes(true);\n }","void buildHeap() {\n for (int i = parent(size - 1); i >= 0; i--) {\n percolateDown(i);\n }\n }","void buildHeap() {\n\tfor(int i=parent(size-1); i>=0; i--) {\n\t percolateDown(i);\n\t}\n }","private void compose() {\n for(Group group : inputGroupList){\n if(group.getGroups().size() > 0){\n LinkedList<Integer> upperGroups = group.getGroups();\n for(int i = 0; i < upperGroups.size(); i++){\n int id = upperGroups.get(i);\n Group upper = findById(id);\n upper.addChild(group);\n }\n } else{\n root.addChild(group);\n }\n }\n for(Address adr : inputAddressList){\n if(adr.getGroups().size() > 0){\n LinkedList<Integer> upperGroups = adr.getGroups();\n for(int i = 0; i < upperGroups.size(); i++){\n int id = upperGroups.get(i);\n Group upper = findById(id);\n upper.addChild(adr);\n adr.addParent(upper);\n }\n } else{\n root.addChild(adr);\n }\n }\n\n assert(root.getChildren().size() > 0);\n }","private void mapChildren(SortedSet<Integer> parents) {\n\n\t\tIterator<Integer> iterator = parents.iterator();\n\t\twhile (iterator.hasNext()) {\n\t\t\tint next = iterator.next();\n\t\t\tthis.children.put(next, new ArrayList<Integer>());\n\n\t\t}\n\t\t// save the parent of every id in par and check if they are contained in\n\t\t// parent list\n\n\t\tfor (int i : this.idMap.keySet()) {\n\n\t\t\tint par = Integer.parseInt(this.idMap.get(i).get(1));\n\t\t\tthis.children.get(par).add(i);\n\n\t\t}\n\n\t}","public void finalizeChildren() {\n finalizeAllNestedChildren(this);\n }","private boolean helperDFS(Node current){\n\n if(expandedNode.size() == 999){\n //limit has been reached. jump out of recursion.\n expandedNode.add(current);\n System.out.println(\"No solution found.\");\n printExpanded(expandedNode);\n System.exit(0);\n return false;\n }\n\n boolean b = cycleCheck(current,expandedNode);\n\n if(!b){\n expandedNode.add(current);\n }else{\n return false;\n }\n\n if(current.getDigit().getDigitString().equals(goalNode.getDigit().getDigitString())){\n //goal reached.\n //expandedNode.add(current);\n solutionPath(current);\n printExpanded(expandedNode);\n System.exit(0);\n }\n\n //Now make the children.\n\n if(!forbidden.contains(current.getDigit().getDigitString())){\n\n if(current.getDigit().last_changed != 0){\n\n if ((Integer.parseInt(current.getDigit().getFirst_digit()) - 1 >= 0)) {\n Node child_node = new Node(current.getDigit().decreaseFirstDigit());\n child_node.setParent(current);\n child_node.getDigit().setLastChanged(0);\n if(!forbidden.contains(child_node.getDigit().getDigitString()) && helperDFS(child_node)){\n return true;\n }\n }\n\n //+1 child first digit\n if ((Integer.parseInt(current.getDigit().getFirst_digit()) + 1 <= 9)) {\n Node child_node = new Node(current.getDigit().increaseFirstDigit());\n child_node.setParent(current);\n child_node.getDigit().setLastChanged(0);\n if(!forbidden.contains(child_node.getDigit().getDigitString()) && helperDFS(child_node)){\n return true;\n }\n }\n }\n\n if(current.getDigit().last_changed != 1){\n if ((Integer.parseInt(current.getDigit().getSecond_digit()) - 1 >= 0)) {\n Node child_node = new Node(current.getDigit().decreaseSecondDigit());\n child_node.setParent(current);\n child_node.getDigit().setLastChanged(1);\n if(!forbidden.contains(child_node.getDigit().getDigitString()) && helperDFS(child_node)){\n return true;\n }\n }\n\n //+1 child\n if ((Integer.parseInt(current.getDigit().getSecond_digit()) + 1 <= 9)) {\n Node child_node = new Node(current.getDigit().increaseSecondDigit());\n child_node.setParent(current);\n child_node.getDigit().setLastChanged(1);\n if(!forbidden.contains(child_node.getDigit().getDigitString()) && helperDFS(child_node)){\n return true;\n }\n }\n }\n\n if(current.getDigit().last_changed != 2){\n if ((Integer.parseInt(current.getDigit().getThird_digit()) - 1 >= 0)) {\n Node child_node = new Node(current.getDigit().decreaseThirdDigit());\n child_node.setParent(current);\n child_node.getDigit().setLastChanged(2);\n if(!forbidden.contains(child_node.getDigit().getDigitString()) && helperDFS(child_node)){\n return true;\n }\n }\n //+1 child\n if ((Integer.parseInt(current.getDigit().getThird_digit()) + 1 <= 9)) {\n Node child_node = new Node(current.getDigit().increaseThirdDigit());\n child_node.setParent(current);\n child_node.getDigit().setLastChanged(2);\n if(!forbidden.contains(child_node.getDigit().getDigitString()) && helperDFS(child_node)){\n return true;\n }\n }\n }\n }\n return false;\n }","private boolean isAcyclic() {\n boolean visited[] = new boolean[getNumNodes()];\n boolean noCycle = true;\n int list[] = new int[getNumNodes() + 1];\n int index = 0;\n int lastIndex = 1;\n list[0] = randomParent;\n visited[randomParent] = true;\n while (index < lastIndex && noCycle) {\n int currentNode = list[index];\n int i = 1;\n\n // verify parents of current node\n while ((i < parentMatrix[currentNode][0]) && noCycle) {\n if (!visited[parentMatrix[currentNode][i]]) {\n if (parentMatrix[currentNode][i] != randomChild) {\n list[lastIndex] = parentMatrix[currentNode][i];\n lastIndex++;\n }\n else {\n noCycle = false;\n }\n visited[parentMatrix[currentNode][i]] = true;\n } // end of if(visited)\n i++;\n }\n index++;\n }\n //System.out.println(\"\\tnoCycle:\"+noCycle);\n return noCycle;\n }","void updateAllParentsBelow();","public void setChildren(Node[][] graph){\n if(inBounds(row+1, col+1)) {\n if (graph[row + 1][col + 1].getType() != '0')\n children.add(graph[row + 1][col + 1]);\n }\n if(inBounds(row, col+1)){\n if (graph[row][col + 1].getType() != '0')\n children.add(graph[row][col + 1]);\n }\n if(inBounds(row-1, col+1)) {\n if (graph[row - 1][col + 1].getType() != '0')\n children.add(graph[row - 1][col + 1]);\n }\n if(inBounds(row+1, col)) {\n if (graph[row + 1][col].getType() != '0')\n children.add(graph[row + 1][col]);\n }\n if(inBounds(row-1, col)) {\n if (graph[row - 1][col].getType() != '0')\n children.add(graph[row - 1][col]);\n }\n if(inBounds(row+1, col-1)) {\n if (graph[row + 1][col - 1].getType() != '0')\n children.add(graph[row + 1][col - 1]);\n }\n if(inBounds(row, col-1)) {\n if (graph[row][col - 1].getType() != '0')\n children.add(graph[row][col - 1]);\n }\n if(inBounds(row-1, col-1)) {\n if (graph[row - 1][col - 1].getType() != '0')\n children.add(graph[row - 1][col - 1]);\n }\n }","protected int numChildren() {\r\n return 3;\r\n }","public void init$Children() {\n children = new ASTNode[3];\n setChild(new List(), 1);\n setChild(new List(), 2);\n }","private void MakeParentChildLink() {\n\n //Hier wordt de hoogte van elke rij opgeslagen\n heightList = new ArrayList<>();\n\n for(Slot slot: slots) {\n int slotCenterY = slot.getCenterY() / 10;\n int slotCenterX = slot.getCenterX() / 10;\n\n // Als de Z gelijk is aan nul weten we dat het slot zich op de grond bevindt\n if (slot.getZ() == 0) {\n //initialisatie (if grondslot get(slotcenterY) geen value heeft maak een value new Hashmap)\n grondSlots.computeIfAbsent(slotCenterY, s -> new HashMap<>());\n\n //Er zijn ook input en output slots dus enkel bij storage\n if (slot.getType().equals(Slot.SlotType.STORAGE)) {\n grondSlots.get(slotCenterY).put(slotCenterX, slot);\n\n }\n } else {\n Slot child = grondSlots.get(slotCenterY).get(slotCenterX);\n // we stijgen telkens tot op de hoogste z\n for (int i = 1; i < slot.getZ(); i++) {\n child = child.getParent();\n }\n //Als we de child gevonden hebben zetten we de link\n slot.setChild(child);\n child.setParent(slot);\n }\n\n //Wanneer het slot gevuld is in een hashmap steken\n if (slot.getItem() != null)\n itemSlotLocation.put(slot.getItem().getId(), slot);\n }\n\n for(HashMap<Integer, Slot> row : grondSlots.values()){\n heightList.add(GeneralMeasures.hoogteBezetting(new HashSet<>(row.values())));\n }\n }","private void subdivide() {\n if (!hasChildren) {\n hasChildren = true;\n this.children = new QuadtreeNodeChildren(this);\n } else {\n return;\n }\n }","private void shrinkComponents() {\n List<List<XGraph.XVertex>> components = getComponents();\n XGraph.XVertex componentVertices[] = new XGraph.XVertex[components.size()];\n\n int index = 0;\n //create or assign component\n for (List<XGraph.XVertex> component : components) {\n //if the size of the component is 1 then there is no need to create a new component group.\n componentVertices[index++] = component.size() == 1 ? component.get(0) :\n graph.getNewComponent();\n }\n index = 0;\n //Add edges\n for (XGraph.XVertex component : componentVertices) {\n //Disable vertex and edges of the children and get minimum edge\n Hashtable<Integer, XGraph.XEdge> minEdges = new Hashtable<>();\n //Process all child vertices only if this is a new component\n if (components.get(index).size() > 1) {\n for (XGraph.XVertex vertex : components.get(index++)) {\n getMinEdges(vertex, minEdges);\n vertex.disable();\n }\n } else {\n index++;\n getMinEdges(component, minEdges);\n }\n for (Map.Entry<Integer, XGraph.XEdge> edgeEntry : minEdges.entrySet()) {\n XGraph.XEdge minEdge = edgeEntry.getValue();\n XGraph.XVertex toVertex = componentVertices[scc.getComponentNo(minEdge.toVertex())];\n //Edge already there in original graph no need to add\n if (toVertex == minEdge.toVertex() && component == minEdge.fromVertex()) {\n continue;\n }\n //Need to create a new edge\n minEdge.disable();\n //Avoid loopback\n if (toVertex.isComponent() && toVertex != minEdge.toVertex()) {\n minEdge = new XGraph.XEdge(component, toVertex, minEdge.getWeight(), minEdge);\n } else {\n minEdge = new XGraph.XEdge(component, toVertex, minEdge.getWeight(), minEdge.getOriginal());\n }\n component.addEdge(minEdge);\n toVertex.addRevEdge(minEdge);\n }\n }\n }","protected void createTree() {\n\n\t\tint nextPlayer = opponent;\n\n\t\tQueue<Node> treeQueue = new LinkedList<Node>();\n\t\tWinChecker winCheck = new WinChecker();\n\n\t\ttreeQueue.add(parent);\n\n\t\twhile (!treeQueue.isEmpty()) {\n\t\t\tNode currentNode = treeQueue.poll();\n\n\t\t\tif (currentNode.getMove().Row != -1\n\t\t\t\t\t&& currentNode.getMove().Col != -1) {\n\t\t\t\tgb.updateBoard(currentNode.getMove());\n\n\t\t\t\tif (winCheck.getWin(gb) >= 0) {\n\t\t\t\t\tgb.revertBoard(currentNode.getMove());\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tgb.revertBoard(currentNode.getMove());\n\t\t\t}\n\n\t\t\t// Restricting the depth to which we will create the tree\n\t\t\tif (currentNode.getPly() > 2) {\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tfor (List<Hexagon> tempList : this.gb.getBoard()) {\n\t\t\t\tfor (Hexagon tempHex : tempList) {\n\n\t\t\t\t\tif (tempHex == null) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (tempHex.getValue() == EMPTY) {\n\n\t\t\t\t\t\tif (currentNode.getPly() % 2 == 0) {\n\t\t\t\t\t\t\tnextPlayer = opponent;\n\t\t\t\t\t\t} else if (currentNode.getPly() % 2 == 1) {\n\t\t\t\t\t\t\tnextPlayer = player;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tMove nextMove = new Move(nextPlayer, false,\n\t\t\t\t\t\t\t\ttempHex.getRow(), tempHex.getColumn());\n\n\t\t\t\t\t\tNode newNode = new Node(currentNode.getPly() + 1,\n\t\t\t\t\t\t\t\tnextMove);\n\t\t\t\t\t\tnewNode.setParent(currentNode);\n\n\t\t\t\t\t\tcurrentNode.children.add(newNode);\n\n\t\t\t\t\t\ttreeQueue.add(newNode);\n\t\t\t\t\t\ttempHex.setValue(EMPTY);\n\t\t\t\t\t}// End of if statement\n\n\t\t\t\t}// End of inner ForLoop\n\t\t\t}// End of outer ForLoop\n\n\t\t\t// currentNode.printChildren();\n\n\t\t}// End of While Loop\n\n\t}","public void setChildrenParent ()\r\n {\r\n if (logger.isFineEnabled()) {\r\n logger.fine(\"setChildrenParent of \" + this);\r\n }\r\n\r\n // Make all children point to this node as parent\r\n for (TreeNode node : children) {\r\n node.setParent(this);\r\n node.setChildrenParent(); // Recursively\r\n }\r\n }","private void connectAll()\n {\n\t\tint i = 0;\n\t\tint j = 1;\n\t\twhile (i < getNodes().size()) {\n\t\t\twhile (j < getNodes().size()) {\n\t\t\t\tLineEdge l = new LineEdge(false);\n\t\t\t\tl.setStart(getNodes().get(i));\n\t\t\t\tl.setEnd(getNodes().get(j));\n\t\t\t\taddEdge(l);\n\t\t\t\tj++;\n\t\t\t}\n\t\t\ti++; j = i+1;\n\t\t}\n\n }","private void freezeChildNavControl()\n\t{\n\t\t//freeze nav controls\n\t\tnavPanel.freezeNavControls();\n\t\tfor (TablePanel childPanel : SubTablePanels.values()) {\n\t\t\tchildPanel.freezeChildNavControl();\n\t\t}\n\t}","public Node(int numberChildren){\n board = new Board();\n children = new Node[numberChildren];\n }","protected void makeChild(FHeapNode y, FHeapNode x)\r\n { \r\n y.left.right = y.right;\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t// remove y from root list of heap\r\n y.right.left = y.left;\r\n \r\n y.parent = x;\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t// make y a child of x\r\n\r\n if (x.child == null)\r\n\t\t{\r\n x.child = y;\r\n y.right = y;\r\n y.left = y;\r\n } \r\n\t\telse\r\n\t\t{\r\n y.left = x.child;\r\n y.right = x.child.right;\r\n x.child.right = y;\r\n y.right.left = y;\r\n }\t\t\t\r\n x.degree++;\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t// increase degree[x] \r\n y.childCut = false;\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t// set childCut[y] to false\r\n }","private void createChildrenNodes(ChessGameNode rootNode) {\r\n\t\tBoardState nextState;\r\n\t\tChessGameNode newNode;\r\n\t\tchar currentPlayer = rootNode.getPlayer();\r\n\r\n\t\tgenerateLegalMovesPlayer(currentPlayer);\r\n\t\trootNode.allocateSpaceForChildren(this.moveList.length);\r\n\r\n\t\tfor (int i = 0; i < this.moveList.length; i++) {\r\n\t\t\tif (this.moveList[i] != null) {\r\n\t\t\t\tnextState = makeMove(rootNode, this.moveList[i]);\r\n\t\t\t\tif (currentPlayer == 'w') {\r\n\t\t\t\t\tnewNode = new ChessGameNode(nextState, 'b', this.moveList[i]);\r\n\t\t\t\t\tnewNode.setValue();\r\n\t\t\t\t} else {\r\n\t\t\t\t\tnewNode = new ChessGameNode(nextState, 'w', this.moveList[i]);\t\r\n\t\t\t\t\tnewNode.setValue();\r\n\t\t\t\t}\r\n\t\t\t\trootNode.setChildrenNode(i, newNode);\r\n\t\t\t}\r\n\t\t}\r\n\t}","public void init$Children() {\n children = new ASTNode[2];\n setChild(new List(), 1);\n }","@Override\n protected void refreshChildren() {\n }","public void createChild (GenericTreeNode<String> daddy)\r\n\t{\r\n\t\t\tList < GenericTreeNode<String> > child= daddy.getChildren();\r\n\t\t\r\n\t\tif (daddy.getData().equalsIgnoreCase(\"next.CommonProfile.Dashboard_SI\")){\r\n\t\t\tchild.add(new GenericTreeNode<String>(\"next.SupportFunctionality.VoiceRecogFunctionality\"));\r\n\t\t\tchild.add(new GenericTreeNode<String>(\"next.Admin.Admin_Principal\"));\r\n\t\t\tchild.add(new GenericTreeNode<String>(\"next.Client.Client_Principal\"));\t\r\n\t\t\tchild.add(new GenericTreeNode<String>(\"next.Member.Member_Principal\"));\t\r\n\t\t}\r\n\t\telse if (daddy.getData().equalsIgnoreCase(\"next.CommonProfile.Dashboard_SU\")){\r\n\t\t\tchild.add(new GenericTreeNode<String>(\"next.SupportFunctionality.VoiceRecogFunctionality\"));\r\n\t\t\t//child.add(new GenericTreeNode<String>(\"next.CommonProfile.DashboardPrincipal\"));\t\r\n\t\t}\r\n\t\telse if (daddy.getData().equalsIgnoreCase(\"next.Admin.Admin_Principal\")){\r\n\t\t\tchild.add(new GenericTreeNode<String>(\"next.CommonProfile.PersonalInfo\"));\r\n\t\t\tchild.add(new GenericTreeNode<String>(\"next.CommonProfile.Products\"));\r\n\t\t\tchild.add(new GenericTreeNode<String>(\"next.Admin.Business_Rules\"));\r\n\t\t\tchild.add(new GenericTreeNode<String>(\"next.view.support.CustomList\"));\r\n\t\t\tchild.add(new GenericTreeNode<String>(\"next.SupportFunctionality.VoiceRecogFunctionality\"));\r\n\t\t}\r\n\t\telse if (daddy.getData().equalsIgnoreCase(\"next.view.support.CustomList\")){\r\n\t\t\tchild.add(new GenericTreeNode<String>(\"next.SupportFunctionality.VoiceRecogFunctionality\"));\r\n\t\t\tchild.add(new GenericTreeNode<String>(\"next.SupportFunctionality.MapsFunctionality\"));\r\n\t\t\t\r\n\t\t}else if (daddy.getData().equalsIgnoreCase(\"next.SupportFunctionality.MapsFunctionality\")){\r\n\t\t\tchild.add(new GenericTreeNode<String>(\"next.SupportFunctionality.VoiceRecogFunctionality\"));\r\n\t\t\t\r\n\t\t\t\r\n\t\t}\r\n\r\n\t\tdaddy.setChildren(child);\r\n\t\t for (GenericTreeNode<String> node : daddy.getChildren()) {\r\n\t\t\t createChild (node);\r\n\t }\r\n\t}","public void init$Children() {\n children = new ASTNode[3];\n setChild(new List(), 1);\n setChild(new Opt(), 2);\n }","private void constructTree() {\r\n\t\tsortLeaves();\r\n\t\tNode currentNode;\r\n\t\tint index = 0;\r\n\t\t\tdo{\r\n\t\t\t\t// Create a new node with the next two least frequent nodes as its children\r\n\t\t\t\tcurrentNode = new Node(this.treeNodes[0], this.treeNodes[1]); \r\n\t\t\t\taddNewNode(currentNode);\r\n\t\t\t}\r\n\t\t\twhile (this.treeNodes.length > 1); // Until there is only one root node\r\n\t\t\tthis.rootNode = currentNode;\r\n\t\t\tindex++;\r\n\t}","@Override\n public void prepare() {\n leftChild.prepare();\n rightChild.prepare();\n\n // Use the parent class' helper-function to prepare the schema.\n prepareSchemaStats();\n\n /** if the join is an anti or semi join, must change the schema to that of the left child*/\n if (joinType == JoinType.ANTIJOIN || joinType == JoinType.SEMIJOIN) {\n schema = leftChild.getSchema();\n sem_ant = true;\n outer = false;\n }\n /** If the join type is an outer, sets state variables and creates the null-pad tuple*/\n else if (joinType == JoinType.LEFT_OUTER || joinType == JoinType.RIGHT_OUTER) {\n outer = true;\n sem_ant = false;\n if (joinType == JoinType.LEFT_OUTER)\n nullPad = new TupleLiteral(rightChild.getSchema().numColumns());\n else {\n nullPad = new TupleLiteral(leftChild.getSchema().numColumns());\n }\n }\n /** if the join is an inner join*/\n else {\n sem_ant = false;\n outer = false;\n }\n \n // We obtain the cost of our children\n PlanCost lChildCost = leftChild.getCost();\n PlanCost rChildCost = rightChild.getCost();\n \n // Our base number of tuples is the two tuples multiplied together\n float totalTuples = lChildCost.numTuples * rChildCost.numTuples;\n \n // If we have a predicate, we multiply by this value\n if (predicate != null) {\n // We use a selectivity estimator if necessary\n float selValue = SelectivityEstimator.estimateSelectivity(\n predicate, \n schema, \n stats);\n \n // Anti-joins will have the opposite of our estimated selectivity\n if (joinType == JoinType.ANTIJOIN || \n joinType == JoinType.SEMIJOIN) {\n selValue = 1 - selValue;\n }\n totalTuples *= selValue;\n }\n // Outer joins require extra nodes for their bounds\n if (joinType == JoinType.LEFT_OUTER) {\n totalTuples += lChildCost.numTuples;\n }\n else if (joinType == JoinType.RIGHT_OUTER) {\n totalTuples += rChildCost.numTuples;\n }\n \n cost = new PlanCost(\n // We have our total number of tuples\n totalTuples,\n // Our overall tuple size is now the size of the two\n // tuples added together\n lChildCost.tupleSize + rChildCost.tupleSize,\n // Our CPU cost is the cost of going through every tuple\n // on the right child for every tuple on the left\n // and for computing both tables\n lChildCost.numTuples * rChildCost.numTuples + lChildCost.cpuCost + rChildCost.cpuCost,\n // Our block cost is the cost of going through the blocks\n // in the two children\n lChildCost.numBlockIOs + rChildCost.numBlockIOs);\n }","protected abstract void childManager(ForkManager child_, double time_);","public final void markChildrenLayoutNecessary() {\n setStatusBits(CHILDREN_LAYOUT_NECESSARY_BIT);\n }","protected void addChildrenNodes(List<DFNode> fringe, DFNode parentNode, List<ActionStatePair> children) {\n Object[] childrenArray = children.toArray();\n\n for (int i = 0; i < childrenArray.length; i++) {\n ActionStatePair actionState = (ActionStatePair) childrenArray[i];\n CCAction action = (CCAction) actionState.action;\t\t\t\t\t\t\t//get the action component\n CCState childState = actionState.state;\t\t\t\t\t\t\t//get the state component\n DFNode childNode = new DFNode(childState, parentNode, action);\t//create new child node\n this.addChild(fringe, childNode);\t\t\t\t\t\t\t//add child node to end of fringe\n this.nodeVisited++;\n }\n }","static void setupLCA() {\n maxDepth = 0;\n depth = new int[N]; // store the depth of each node\n firstParents = new int[N]; // the immediate parent\n firstParents[0] = 0;\n depth[0] = 0;\n dfs(0);\n int power = 1;\n // Increase the power higher until we go over the maxDepth\n // This will be one more than we need\n while (1 << power <= maxDepth) {\n power++;\n }\n parent = new int[power][N]; // go up 2^power from node i of N\n // Now, use that initial information acquired from the dfs to build\n // base cases of the sparse tables!\n for (int node = 0; node < N; node++) {\n parent[0][node] = firstParents[node];\n }\n // Necessary to set everything else to zero for now, so\n // that we never get confused if we are out of bounds\n\n // Must fill it up with -1's\n for (int p = 1; p < parent.length; p++) {\n for (int i = 0; i < N; i++) {\n parent[p][i] = -1;\n }\n }\n // p represents going up by 1 << p\n for (int p = 1; p < parent.length; p++) {\n for (int node = 0; node < N; node++) {\n if (parent[p - 1][node] != -1) {\n int myParent = parent[p - 1][node];\n parent[p][node] = parent[p-1][myParent];\n }\n }\n }\n }","private void setParentBounds() {\n GraphRepresentation baseGraph = graphRepresentationFactory.getBaseGraph();\n\n Iterator<Task> iterator = tasks.iterator();\n while (iterator.hasNext()) {\n Task nextTask = iterator.next();\n List<Integer> nextTaskParents = baseGraph.getParents(nextTask.getIdentifier());\n nextTask.setParentBound(nextTaskParents.size());\n }\n }","public LG(){\n\t\tchildren = new LinkedHashMap<Loop, LinkedHashSet<Loop>>();\n\t\tparent = new LinkedHashMap<Loop, Loop>();\n\t\tloops = new LinkedHashSet<Loop>();\n\t\tloopCounter = new LinkedHashMap<Loop, Integer>();\n\t}","void expandChilds() {\n\t\t\tenumAndExpand(this.parentItem);\n\t\t}","private void sink(int i) {\n if (2*i > N)\n return;\n int maxChild = 2*i;\n if (maxChild < N && compare(maxChild, maxChild+1) < 0)\n maxChild++;\n if (compare(maxChild, i) > 0) {\n swap(maxChild, i);\n sink(maxChild);\n }\n }","private void initializeGraphAsEmpty() {\n int max = getNumNodes();\n\n parentMatrix = new int[getNumNodes()][max];\n childMatrix = new int[getNumNodes()][max];\n\n for (int i = 0; i < getNumNodes(); i++) {\n parentMatrix[i][0] = 1; //set first node\n childMatrix[i][0] = 1;\n }\n\n for (int i = 0; i < getNumNodes(); i++) {\n for (int j = 1; j < max; j++) {\n parentMatrix[i][j] = -5; //set first node\n childMatrix[i][j] = -5;\n }\n }\n }","void depend(int parentID, int childID){\n check(parentID, childID);\n nodes_[childID].parent_ = parentID;\n nodes_[parentID].addChild(childID);\n }","public void assignAllSiblings(){\n \n List<Informacion> pasos=ejemplo.getListaPasos();\n for(Informacion info:pasos){\n if(info.getElemento().split(\" \").length>1){\n assignSiblings(info.getElemento().split(\" \"));\n } \n }\n }","public void setChildren(List<BTreeNode<E>> newChildren) {\n\t\t//not adding in order, but does not matter because list is empty, and you will only call this method when the children are in order\n\t\tchildren.addAll(newChildren);\n\t\tfor (BTreeNode<E> child: newChildren) {\n\t\t\tchild.parent = this;\n\t\t}\n\t}","protected void childrenChanged() {\n proxyGroup.childrenChanged();\n }","public void releaseChildren() {\n if (children != null) {\n unloadChildren();\n\n children.unload();\n children = null;\n }\n }","void loadChilds() throws ApplicationException {\n\t\t\t// iterate over childs\n\t\t\tGenericIterator list = element.getChildren();\n\t\t\twhile (list.hasNext()) {\n\t\t\t\tnew Item(this.parentItem, (GenericObjectNode) list.next());\n\t\t\t}\n\t\t}","private void recursiveCreateChildren(IFolder parentFolder, int depth) throws CoreException {\n \t\t//create TREE_WIDTH files\n \t\tfor (int i = 0; i < TREE_WIDTH; i++) {\n \t\t\tIFile file = parentFolder.getFile(createString(10));\n \t\t\tfile.create(new ByteArrayInputStream(createBytes(5000)), IResource.NONE, getMonitor());\n \t\t}\n \t\tif (depth <= 0)\n \t\t\treturn;\n \t\t//create TREE_WIDTH folders\n \t\tfor (int i = 0; i < TREE_WIDTH; i++) {\n \t\t\tIFolder folder = parentFolder.getFolder(createString(6));\n \t\t\tfolder.create(IResource.NONE, true, getMonitor());\n \t\t\trecursiveCreateChildren(folder, depth - 1);\n \t\t}\n \t}","private void buildParentTransformAndSourceNode(TransformNode transformNode, Map<String, Object> parentsIdMap) {\n for (Map.Entry<String, Object> entry : parentsIdMap.entrySet()) {\n String tmpNodeId = entry.getKey();\n //heads shouldn't have self dependency id in it\n if (heads.contains(tmpNodeId)\n && this.sourceNodes.containsKey(tmpNodeId)) {\n transformNode.getParents().add(this.sourceNodes.get(tmpNodeId));\n } else if (heads.contains(tmpNodeId)\n && !this.sourceNodes.containsKey(tmpNodeId)\n && !this.staticTable.contains(tmpNodeId)) {\n Map<String, Object> sourceNodeConfMap = new HashMap<>();\n sourceNodeConfMap.put(\"id\", tmpNodeId);\n sourceNodeConfMap.put(\"name\", tmpNodeId);\n sourceNodeConfMap.put(\"schedule_time\", this.scheduleTime);\n SourceNode sourceNode = createHdfsSourceNode(tmpNodeId, sourceNodeConfMap);\n transformNode.getParents().add(sourceNode);\n this.sourceNodes.put(tmpNodeId, sourceNode);\n LOGGER.info(String.format(\"Added source node %s\", tmpNodeId));\n } else if (!heads.contains(tmpNodeId)\n && !this.tmpTransformNodesMap.containsKey(tmpNodeId)\n && !this.staticTable.contains(tmpNodeId)) {\n transformNode.getParents().add(this.traverseBuildNodes(tmpNodeId));\n } else if (!heads.contains(tmpNodeId)\n && this.tmpTransformNodesMap.containsKey(tmpNodeId)\n && !this.staticTable.contains(tmpNodeId)) {\n transformNode.getParents().add(this.tmpTransformNodesMap.get(tmpNodeId));\n }\n\n }\n }","private void connectToParent(RevCommit m) throws Exception\n\t{\n\t\tGraphDatabaseService service = DBConnection.getService();\n\t\ttry (Transaction tx = service.beginTx())\n\t\t{\n\t\t\tResult result = service.execute( \"match (n {\"+CommitNode._hash+\": '\"+getCommitId(m)+\"'}) return n\" );\n\t\t\tIterator<Node> nodes = result.columnAs( \"n\" );\n\n\t\t\tfor(Node commit_node : IteratorUtil.asIterable(nodes))\n\t\t\t{\n\t\t\t\tList<String> parent_ids = commit_parents_list.get(getCommitId(m));\n\t\t\t\tfor(String s : parent_ids)\n\t\t\t\t{\n\t\t\t\t\tif(!commit_parents_list.keySet().contains(s))\n\t\t\t\t\t{\t//unknown parent, the node is not going to exist. If we attempt to create the rel, the transaction will be aborted. Let's ignore this.\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tResult candidate_parents_results = service.execute( \"match (n {\"+CommitNode._hash+\" : '\"+s+\"'}) return n\" );\n\t\t\t\t\tIterator<Node> candidate_parent_nodes = candidate_parents_results.columnAs( \"n\" );\n\n\t\t\t\t\tfor(Node p : IteratorUtil.asIterable(candidate_parent_nodes))\n\t\t\t\t\t{\n\t\t\t\t\t\ttry\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tRelationship new_rel = p.createRelationshipTo(commit_node,CommitNode.Relationships.NEXT);\n\t\t\t\t\t\t\tif(new_rel == null)\n\t\t\t\t\t\t\t\tSystem.err.println(\"Couldn't connect commit \" + getCommitId(m) + \" with \" +s);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcatch(Exception e)\n\t\t\t\t\t\t{\t//shut up\n\t\t\t\t\t\t\tSystem.err.println(\"Failted to connect commit node to parent - silently continuing : \\nCommits (child) : \"+getCommitId(m) + \" with (parent) : \" +s);\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\tresult.close();\n\t\t\ttx.success();\n\t\t}\n\t\tcatch(Exception e)\n\t\t{\n\t\t\tSystem.err.println(\"failed to create relationship between commits and their parents.\" + e.getMessage());\n\t\t}\n\t}","protected void initializeChild() {\n\t}","public void clickTravellersChildrenDec() {\n\t\ttravellersChildDec.click();\n\t}","public void makeComplete() {\n\t\t// A complete graph has N(N-1)/2 edges. Create an ArrayList for those\n\t\t// for performance.\n\t\tint n = nodeArray.size();\n\t\tthis.edges = new ArrayList<Edge>(n * (n - 1) / 2);\n\n\t\t// Connect every node to the others\n\t\tfor (int i = 0; i < nodeArray.size(); i++) {\n\t\t\tfor (int k = i + 1; k < nodeArray.size(); k++) {\n\n\t\t\t\tEdge edge = new Edge(nodeArray.get(i), nodeArray.get(k));\n\t\t\t\tedges.add(edge);\n\t\t\t}\n\t\t}\n\t}","private void makeContextsRecursive(ContextTreeNode contextNode) {\n \n TaxonomyContext context = contextNode.getContext();\n Node contextRootNode = context.getRootNode();\n int i = 0;\n \n Transaction tx = beginTx();\n if (contextRootNode.getProperty(\"name\").equals(LIFE_NODE_NAME) == false) {\n \n System.out.println(\"making indices for \" + contextRootNode.getProperty(\"name\"));\n \n for (Node n : PREFTAXCHILDOF_TRAVERSAL.traverse(contextRootNode).nodes()) {\n addToPreferredIndexes(n, context);\n \n i++;\n if (i % 100000 == 0)\n System.out.println(i);\n }\n }\n tx.success();\n tx.finish();\n \n // now move on to all children\n for (ContextTreeNode childNode : contextNode.getChildren())\n makeContextsRecursive(childNode);\n \n }","private void GreedySearch(){\n\n Queue<Node> expanded = new LinkedList<>();\n ArrayList<Node> fringe = new ArrayList<>();\n ArrayList<Node> fringeTemp = new ArrayList<>();\n\n\n Node current = startNode;\n\n while(expanded.size() < 1000){\n\n if(current.getDigit().getDigitString().equals(goalNode.getDigit().getDigitString())){\n //goal is reached.\n solutionPath(current);\n expanded.add(current);\n printExpanded(expanded);\n System.exit(0);\n }\n\n\n boolean b = cycleCheck(current,expanded);\n\n if(!b) {\n expanded.add(current);\n }\n\n if(!b){\n\n if(current.getDigit().last_changed != 0){\n\n if ((Integer.parseInt(current.getDigit().getFirst_digit()) - 1 >= 0)) {\n Node child_node = new Node(current.getDigit().decreaseFirstDigit());\n child_node.setParent(current);\n child_node.getDigit().setLastChanged(0);\n\n if(!forbidden.contains(child_node.getDigit().getDigitString())){\n fringe.add(child_node);\n }\n }\n\n //+1 child first digit\n if ((Integer.parseInt(current.getDigit().getFirst_digit()) + 1 <= 9)) {\n Node child_node = new Node(current.getDigit().increaseFirstDigit());\n child_node.setParent(current);\n child_node.getDigit().setLastChanged(0);\n if(!forbidden.contains(child_node.getDigit().getDigitString())){\n fringe.add(child_node);\n }\n\n }\n }\n\n if(current.getDigit().last_changed != 1){\n\n if ((Integer.parseInt(current.getDigit().getSecond_digit()) - 1 >= 0)) {\n Node child_node = new Node(current.getDigit().decreaseSecondDigit());\n child_node.setParent(current);\n child_node.getDigit().setLastChanged(1);\n if(!forbidden.contains(child_node.getDigit().getDigitString())){\n fringe.add(child_node);\n }\n }\n\n //+1 child\n if ((Integer.parseInt(current.getDigit().getSecond_digit()) + 1 <= 9)) {\n Node child_node = new Node(current.getDigit().increaseSecondDigit());\n child_node.setParent(current);\n child_node.getDigit().setLastChanged(1);\n if(!forbidden.contains(child_node.getDigit().getDigitString())){\n fringe.add(child_node);\n }\n }\n }\n\n if(current.getDigit().last_changed != 2){\n if ((Integer.parseInt(current.getDigit().getThird_digit()) - 1 >= 0)) {\n Node child_node = new Node(current.getDigit().decreaseThirdDigit());\n child_node.setParent(current);\n child_node.getDigit().setLastChanged(2);\n if(!forbidden.contains(child_node.getDigit().getDigitString())){\n fringe.add(child_node);\n }\n }\n //+1 child\n if ((Integer.parseInt(current.getDigit().getThird_digit()) + 1 <= 9)) {\n Node child_node = new Node(current.getDigit().increaseThirdDigit());\n child_node.setParent(current);\n child_node.getDigit().setLastChanged(2);\n if(!forbidden.contains(child_node.getDigit().getDigitString())){\n fringe.add(child_node);\n }\n }\n }\n\n }\n\n\n\n for(Node n : fringe){\n heuristicSetter(n);\n\n }\n\n fringeTemp.addAll(fringe);\n //now all the nodes in fringe have the heuristic value.\n //We can get the last added minm\n Node minm;\n if(fringeTemp.size() != 0){\n minm = fringeTemp.get(0);\n }else{\n break;\n }\n for(int i = 1; i<fringeTemp.size(); i++){\n if(fringeTemp.get(i).getHeuristic() <= minm.getHeuristic()){\n minm = fringeTemp.get(i);\n }\n }\n\n //now we have the minm for the next stage.\n current = minm;\n fringeTemp.remove(minm);\n fringe.clear();\n }\n\n //While loop ends\n System.out.println(\"No solution found.\");\n printExpanded(expanded);\n\n\n\n }","public void crossover(){\n \t\n \t//int cut2 = ((NODELENGTH * 3 + 1) / 3) + cut;\n \tfor (int g = 0; g < (wallpapers.size() - 1); g += 2){\n \t\tint cut = getCutPoint();\n \t\tint[] parent1 = wallpapers.get(g);\n \t\tint[] parent2 = wallpapers.get(g + 1);\n \t\t\n \t\tint[] child1 = new int[parent1.length];\n \t\tint[] child2 = new int[parent2.length];\n \t\tfor (int i = 0; i < (cut); i++){\n \t\t\tchild1[i] = parent1[i];\n \t\t\tchild2[i] = parent2[i];\n \t\t}\n \t\tfor (int j = cut; j < parent1.length; j++){\n \t\t\tchild1[j] = parent2[j];\n \t\t\tchild2[j] = parent1[j];\n \t\t}\n \t\t\n \t\t\n \t\twallpapers.set(g, child1);\n \t\twallpapers.set(g + 1, child2);\n \t}\n \tfor (int d = 0; d < (wallpapers.size() * 2); d++){\n \t\tif (d < wallpapers.size()){\n \t\t\ttemp_wallpapers.add(wallpapers.get(d));\n \t\t}\n \t\telse {\n \t\t\ttemp_wallpapers.add(node());\n \t\t}\n \t}\n \twallpapers.clear();\n \tfor (int u = 0; u < temp_wallpapers.size(); u++){\n\t\t\twallpapers.add(u, temp_wallpapers.get(u));\n\t\t}\n \ttemp_wallpapers.clear();\n }","private void performCreates()\n {\n // Create entities. We have to loop possibly many times to create the entities\n // because we have to set the FKs. It's\n // possible that the source for a FK is a FK from yet another EI. We don't\n // want to copy a FK until we know that the source for a FK has been\n // properly set. We also want to make sure we set the FK's for the EIs that\n // have been excluded/deleted before we copy FKs for the included/created.\n int debugCnt = 0; // We'll keep a counter in case we get an infinite loop.\n\n // creatingEntities will be true for as long as we think we need to create more entities.\n boolean creatingEntities = true;\n while ( creatingEntities )\n {\n // We'll hope that we're done creating entities after this iteration. If we\n // find we need to create more then we'll turn it back on.\n creatingEntities = false;\n\n if ( debugCnt++ > 100 )\n throw new ZeidonException(\"Internal error: too many times creating entities.\");\n\n for ( ViewImpl view : viewList )\n {\n ObjectInstance oi = view.getObjectInstance();\n\n for ( final EntityInstanceImpl ei : oi.getEntities() )\n {\n if ( ! requiresCreate( ei ) )\n continue;\n\n assert ! ei.getEntityDef().isDerivedPath();\n\n if ( ! createInstance( view, ei ) )\n creatingEntities = true; // We weren't able to create ei. Try again later.\n }\n }\n } // while creatingEntities...\n }","public void updateChildNodes() {\n\t\tList<FTNonLeafNode> nodesToRemove = new ArrayList<FTNonLeafNode>();\n\t\tfor (FTNonLeafNode intermediateNode : intermediateNodes.values()) {\n\t\t\tList<FTNode> childNodesToRemove = new ArrayList<FTNode>();\n\t\t\tfor (String childName : intermediateNode.childNodes.keySet()) {\n\t\t\t\tif (intermediateNodes.containsKey(childName)) {\n\t\t\t\t\t// update child node if it has child node\n\t\t\t\t\tFTNonLeafNode childNode = intermediateNodes.get(childName);\n\t\t\t\t\tif ((childNode instanceof FTOrNode) || (childNode instanceof FTAndNode)) {\n\t\t\t\t\t\tintermediateNode.addChildNode(childName, intermediateNodes.get(childName));\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\t// if parent node is an OR node\n\t\t\t\t\t\t// remove this child\n\t\t\t\t\t\tif (intermediateNode instanceof FTOrNode) {\n\t\t\t\t\t\t\tchildNodesToRemove.add(childNode);\n\t\t\t\t\t\t\tnodesToRemove.add(childNode);\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// if parent node is an AND node\n\t\t\t\t\t\t// remove the parent node and child node\n\t\t\t\t\t\t// and set their values to false in case they are referenced by other nodes\n\t\t\t\t\t\telse if (intermediateNode instanceof FTAndNode) {\n\t\t\t\t\t\t\tnodesToRemove.add(intermediateNode);\n\t\t\t\t\t\t\tnodesToRemove.add(childNode);\n\t\t\t\t\t\t\t// mark the nodes as they are not getting removed till after the loop\n\t\t\t\t\t\t\tintermediateNode.resolved = true;\n\t\t\t\t\t\t\tintermediateNode.nodeValue = false;\n\t\t\t\t\t\t\tchildNode.resolved = true;\n\t\t\t\t\t\t\tchildNode.nodeValue = false;\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\tintermediateNode.removeChildNodes(childNodesToRemove);\n\t\t\t// if no child node left for this intermediate node,\n\t\t\t// then its parent node should remove this intermediate node as well\n\t\t}\n\t\t// remove the no child nodes\n\t\tfor (FTNonLeafNode node : nodesToRemove) {\n\t\t\tintermediateNodes.remove(node.nodeName);\n\t\t}\n\t}","private void recreateWorkerTree(TransactionalClient transaction) throws Exception {\n String workerPath = paths.worker(workerId);\n if (curatorFramework.checkExists().forPath(workerPath) != null) {\n transaction.deletePathWithChildrenIfNeeded(workerPath);\n }\n\n // create availability and assignments directories\n transaction.createPath(paths.worker(workerId));\n transaction.createPath(paths.availableJobs(workerId));\n transaction.createPath(paths.assignedJobs(workerId));\n\n // register work pooled jobs\n for (DistributedJob job : availableJobs) {\n transaction.createPath(paths.availableJob(workerId, job.getJobId()));\n }\n }","public void resetVisited() {\r\n\t\tvisited = false;\r\n\t\tfor (ASTNode child : getChildren()) {\r\n\t\t\tif (!visited)\r\n\t\t\t\tcontinue;\r\n\t\t\tchild.resetVisited();\r\n\t\t}\r\n\t}","private boolean cycleCheck(Node current, Queue<Node> expanded){\n\n if( expanded.size() == 0){\n return false; //Because current is root\n }\n\n for(Node nodeInExpanded : expanded){\n\n if(current!=null && current.getDigit().getDigitString().equals(nodeInExpanded.getDigit().getDigitString())){\n //the digits are same so we check children.\n\n ArrayList<String> currentChildren = makeChildren(current);\n ArrayList<String> childrenOfExpanded = makeChildren(nodeInExpanded);\n\n int size;\n\n if(currentChildren.size() > childrenOfExpanded.size() ){\n size = childrenOfExpanded.size();\n }else if(currentChildren.size() < childrenOfExpanded.size()){\n size = currentChildren.size();\n }else{\n size = childrenOfExpanded.size();\n }\n /*\n I use the modulus operator so that I dont get a ArrayIndexOut of Bounds\n */\n\n if( currentChildren.size() == childrenOfExpanded.size()\n && currentChildren.get(0%size).equals(childrenOfExpanded.get(0%size))\n && currentChildren.get(1%size).equals(childrenOfExpanded.get(1%size))\n && currentChildren.get(2%size).equals(childrenOfExpanded.get(2%size))\n && currentChildren.get(3%size).equals(childrenOfExpanded.get(3%size))\n ){\n return true;\n }\n }\n }\n\n return false;\n }","private void addEdge() {\n childMatrix[randomParent][childMatrix[randomParent][0]] = randomChild;\n childMatrix[randomParent][0]++;\n parentMatrix[randomChild][parentMatrix[randomChild][0]] = randomParent;\n parentMatrix[randomChild][0]++;\n }","public void ignoreChildren() {\r\n this.isIgnoreChildren = true;\r\n }","private void connectToAll() {\n for (AStarNode node : getNodes()) {\n node.resetConnection();\n for (AStarNode connect : getNodes()) {\n if (isValid(node, connect)) {\n node.connect(connect);\n }\n }\n }\n }","private static Parent[] makeParents() {\n\t\treturn null;\n\t}","private ParentEntityNode cToCOwnerCheckLeveOneHavingParentOrChildren(String entityId, LosConfigDetails owner, // NOSONAR\n\t\t\tLosConfigDetails affilated, String commercialSuffix, List<String> iterationChildIds, List<String> entityIds, // NOSONAR\n\t\t\tList<ParentEntityNode> treeData, List<String> levelTwoChildIds) {// NOSONAR\n\t\tList<ParentEntityNode> levelOneData = getParentDataReverseOrder(entityIds);\n\t\tlevelOneData.stream().forEach(removeExisting -> cToCOwnerIfOwnedIsPresentChangeToOwner(entityId, owner,\n\t\t\t\ttreeData, levelTwoChildIds, removeExisting));\n\t\tif (!levelTwoChildIds.isEmpty()) {\n\t\t\tlevelTwoCToCOwnerGetComEntitySetAsAffiliated(entityId, owner, affilated, commercialSuffix, // NOSONAR\n\t\t\t\t\titerationChildIds, entityIds, treeData, levelTwoChildIds);// NOSONAR\n\t\t}\n\t\treturn entityRelationshipTreeServiceImpl.createTreeFromParent(treeData, entityId);\n\t}","protected void constructLevelRelations( Callback c, int parent, int child ){\n String childID = getPartitionID( child );\n String parentID = getPartitionID( parent );\n List parents = new ArrayList(1);\n parents.add( parentID );\n c.cbParents( childID, parents );\n\n }","private void initChildList() {\n if (childList == null) {\n childList = new ArrayList<>();\n }\n }","private void reEstablishConnections() {\n// System.out.println(\"Impossible to create overlay, starting over...\");\n for (NodeRecord node : registeredNodes.values()) {\n node.getNodesToConnectToList().clear();\n node.resetNumberOfConnections();\n }\n createOverlay();\n }","protected void siftDown() {\r\n\t\tint parent = 0, child = (parent << 1) + 1;// preguntar porque 0 y no 1\r\n\t\t\r\n\t\twhile (child < theHeap.size()) {\r\n\t\t\tif (child < theHeap.size() - 1\r\n\t\t\t\t\t&& compare(theHeap.get(child), theHeap.get(child + 1)) > 0)\r\n\t\t\t\tchild++; // child is the right child (child = (2 * parent) + 2)\r\n\t\t\tif (compare(theHeap.get(child), theHeap.get(parent)) >= 0)\r\n\t\t\t\tbreak;\r\n\t\t\tswap(parent, child);\r\n\t\t\tparent = child;\r\n\t\t\tchild = (parent << 1) + 1; // => child = (2 * parent) + 1\r\n\t\t}\r\n\t}","protected void makeTheTree(){\n\n structure.getRootNode().branchList.add(structure.getNode11());\n structure.getRootNode().branchList.add(structure.getNode12());\n structure.getRootNode().branchList.add(structure.getNode13());\n\n structure.getNode11().branchList.add(structure.getNode111());\n structure.getNode11().branchList.add(structure.getNode112());\n structure.getNode11().branchList.add(structure.getNode113());\n\n structure.getNode13().branchList.add(structure.getNode131());\n\n structure.getNode112().branchList.add(structure.getNode1121());\n\n }","ArrayList<Cell> getChildren(Integer[][] level){\n int[][] values={{0,1},{0,-1},{1,0},{-1,0}};\n ArrayList<Cell> children = new ArrayList<>();\n for (int i = 0; i < values.length; i++){\n if (isLegalMove(this.getI()+values[i][0], this.getJ()+values[i][1],level)){\n children.add(new Cell(this.getI()+values[i][0], this.getJ()+values[i][1]));\n }\n }\n //the code below achieves the same goal; still here for clarity\n\n// if (isLegalMove(this.getI(), this.getJ()+1, level)) {\n// children.add(new Cell(this.getI(), this.getJ()+1));\n// }\n// if (isLegalMove(this.getI(), this.getJ()-1, level)) {\n// children.add(new Cell(this.getI(), this.getJ()-1));\n// }\n// if (isLegalMove(this.getI()+1, this.getJ(), level)) {\n// children.add(new Cell(this.getI()+1, this.getJ()));\n// }\n// if (isLegalMove(this.getI()-1, this.getJ(), level)) {\n// children.add(new Cell(this.getI()-1, this.getJ()));\n// }\n return children;\n }","public void checkConnections() {\n Boolean updateCanvas = false;\n\n // Find new connections set within a node and creates them\n for (DrawableNode node : nodes) {\n if (node instanceof LogicNode) {\n String src = ((LogicNode) node).getLogic().getLogic();\n\n for (DrawableNode endNode : getNodes()) {\n int nodeConnectionType = NodeConnection.NO_CONNECTION;\n\n // Here we are checked to see if any connections are linked from this LogicNode\n if (src.contains(\"run(\\\"\" + endNode.getContainedText() + \"\\\"\") ||\n src.contains(\"runAndWait(\\\"\" + endNode.getContainedText() + \"\\\"\") ||\n src.contains(\"runAndJoin(\\\"\" + endNode.getContainedText() + \"\\\"\")) {\n nodeConnectionType = NodeConnection.DYNAMIC_CONNECTION;\n } else if (src.contains(\"getNode(\\\"\" + endNode.getContainedText() + \"\\\"\")) {\n nodeConnectionType = NodeConnection.GET_NODE_CONNECTION;\n }\n\n // If we find a possible connection and it doesn't already exist, we create that connection with the correct type\n if (!connectionExists(node, endNode) && nodeConnectionType != -1) {\n NodeConnection newConnection = new NodeConnection(node, endNode, nodeConnectionType);\n connections.add(newConnection);\n updateCanvas = true;\n }\n }\n } else if (node instanceof TestCaseNode) {\n String src = ((TestCaseNode) node).getLogic().getLogic();\n\n for (DrawableNode endNode : getNodes()) {\n int nodeConnectionType = NodeConnection.NO_CONNECTION;\n\n // Here we are checked to see if any connections are linked from this TestCaseNode\n if (src.contains(\"run(\\\"\" + endNode.getContainedText() + \"\\\"\") ||\n src.contains(\"runAndWait(\\\"\" + endNode.getContainedText() + \"\\\"\") ||\n src.contains(\"runAndJoin(\\\"\" + endNode.getContainedText() + \"\\\"\")) {\n nodeConnectionType = NodeConnection.DYNAMIC_CONNECTION;\n } else if (src.contains(\"getNode(\\\"\" + endNode.getContainedText() + \"\\\"\")) {\n nodeConnectionType = NodeConnection.GET_NODE_CONNECTION;\n }\n\n // If we find a possible connection and it doesn't already exist, we create that connection with the correct type\n if (!connectionExists(node, endNode) && nodeConnectionType != -1) {\n NodeConnection newConnection = new NodeConnection(node, endNode, nodeConnectionType);\n connections.add(newConnection);\n updateCanvas = true;\n }\n }\n } else if (node instanceof SwitchNode) {\n List<Switch> aSwitches = ((SwitchNode) node).getSwitches();\n\n for (DrawableNode endNode : getNodes()) {\n Boolean createConnection = false;\n Boolean enabledConnection = false;\n\n for (Switch aSwitch : aSwitches) {\n if ((aSwitch.getTarget().equals(endNode.getContainedText()))) {\n enabledConnection = aSwitch.isEnabled();\n createConnection = true;\n }\n }\n\n if (createConnection && !connectionExists(node, endNode)) {\n Integer connectionType = NodeConnection.DYNAMIC_CONNECTION;\n if (!enabledConnection) {\n connectionType = NodeConnection.DISABLED_CONNECTION;\n }\n\n NodeConnection newConnection = new NodeConnection(node, endNode, connectionType);\n connections.add(newConnection);\n updateCanvas = true;\n }\n }\n } else if (node instanceof TriggerNode) {\n List<Trigger> triggers = ((TriggerNode) node).getTriggers();\n\n for (Trigger trigger : triggers) {\n String watchName = trigger.getWatch();\n\n for (DrawableNode endNode : getNodes()) {\n Boolean createConnection = false;\n\n if (watchName.equals(endNode.getContainedText())) {\n createConnection = true;\n }\n\n // This connection has the start and end the other way around, the target is specified in the trigger but\n // we want it to look like the watched node is connecting to the trigger as that is the order that they are run\n if (createConnection && !connectionExists(endNode, node)) {\n NodeConnection newConnection = new NodeConnection(endNode, node, NodeConnection.TRIGGER_CONNECTION);\n connections.add(newConnection);\n updateCanvas = true;\n }\n }\n }\n }\n\n // Find connection that are set using the Next node input box\n if (node != null && !node.getNextNodeToRun().isEmpty()) {\n for (DrawableNode endNode : getNodes()) {\n if (node.getNextNodeToRun().equals(endNode.getContainedText())) {\n if (!connectionExists(node, endNode)) {\n NodeConnection newConnection = new NodeConnection(node, endNode, NodeConnection.MAIN_CONNECTION);\n connections.add(newConnection);\n updateCanvas = true;\n }\n }\n }\n }\n }\n\n // Checks old connections and removes ones that don't exist\n List<NodeConnection> listToRemove = new ArrayList<>();\n List<NodeConnection> connectionsLoopTemp = new ArrayList<>(); // We make a copy the list here so that we can the original while iterating over this one\n connectionsLoopTemp.addAll(connections);\n for (NodeConnection nodeConnection : connectionsLoopTemp) {\n if (nodeConnection.getConnectionType().equals(NodeConnection.DYNAMIC_CONNECTION)) {\n if (nodeConnection.getConnectionStart() instanceof LogicNode) {\n if (!((LogicNode) nodeConnection.getConnectionStart()).getLogic().getLogic().contains(\"run(\\\"\" + nodeConnection.getConnectionEnd().getContainedText() + \"\\\"\")) {\n if (!((LogicNode) nodeConnection.getConnectionStart()).getLogic().getLogic().contains(\"runAndWait(\\\"\" + nodeConnection.getConnectionEnd().getContainedText() + \"\\\"\")) {\n if (!((LogicNode) nodeConnection.getConnectionStart()).getLogic().getLogic().contains(\"runAndJoin(\\\"\" + nodeConnection.getConnectionEnd().getContainedText() + \"\\\"\")) {\n if (!((LogicNode) nodeConnection.getConnectionStart()).getLogic().getLogic().contains(\"getNode(\\\"\" + nodeConnection.getConnectionEnd().getContainedText() + \"\\\"\")) {\n listToRemove.add(nodeConnection);\n updateCanvas = true;\n }\n }\n }\n }\n } else if (nodeConnection.getConnectionStart() instanceof TestCaseNode) {\n if (!((TestCaseNode) nodeConnection.getConnectionStart()).getLogic().getLogic().contains(\"run(\\\"\" + nodeConnection.getConnectionEnd().getContainedText() + \"\\\"\")) {\n if (!((TestCaseNode) nodeConnection.getConnectionStart()).getLogic().getLogic().contains(\"runAndWait(\\\"\" + nodeConnection.getConnectionEnd().getContainedText() + \"\\\"\")) {\n if (!((TestCaseNode) nodeConnection.getConnectionStart()).getLogic().getLogic().contains(\"runAndJoin(\\\"\" + nodeConnection.getConnectionEnd().getContainedText() + \"\\\"\")) {\n if (!((TestCaseNode) nodeConnection.getConnectionStart()).getLogic().getLogic().contains(\"getNode(\\\"\" + nodeConnection.getConnectionEnd().getContainedText() + \"\\\"\")) {\n listToRemove.add(nodeConnection);\n updateCanvas = true;\n }\n }\n }\n }\n } else if (nodeConnection.getConnectionStart() instanceof SwitchNode) {\n List<Switch> aSwitches = ((SwitchNode) nodeConnection.getConnectionStart()).getSwitches();\n String endContainedText = nodeConnection.getConnectionEnd().getContainedText();\n Integer removeCount = 0;\n for (Switch aSwitch : aSwitches) {\n if ((!aSwitch.getTarget().equals(endContainedText) || !aSwitch.isEnabled())) {\n removeCount++;\n }\n }\n\n if (removeCount.equals(aSwitches.size())) {\n // Create a disabled connection between these two nodes to give appearance of toggling\n NodeConnection newConnection = new NodeConnection(nodeConnection.getConnectionStart(), nodeConnection.getConnectionEnd(), NodeConnection.DISABLED_CONNECTION);\n connections.add(newConnection);\n\n listToRemove.add(nodeConnection);\n updateCanvas = true;\n }\n }\n } else if (nodeConnection.getConnectionType().equals(NodeConnection.TRIGGER_CONNECTION)) {\n if (nodeConnection.getConnectionEnd() instanceof TriggerNode) { // Here the start and end connections are reversed\n List<Trigger> triggers = ((TriggerNode) nodeConnection.getConnectionEnd()).getTriggers();\n String endContainedText = nodeConnection.getConnectionStart().getContainedText();\n Integer removeCount = 0;\n for (Trigger trigger : triggers) {\n if ((!trigger.getWatch().equals(endContainedText))) {\n removeCount++;\n }\n }\n\n if (removeCount.equals(triggers.size())) {\n listToRemove.add(nodeConnection);\n updateCanvas = true;\n }\n }\n } else if (nodeConnection.getConnectionType().equals(NodeConnection.GET_NODE_CONNECTION)) {\n if (nodeConnection.getConnectionStart() instanceof LogicNode) {\n if (!((LogicNode) nodeConnection.getConnectionStart()).getLogic().getLogic().contains(\"getNode(\\\"\" + nodeConnection.getConnectionEnd().getContainedText() + \"\\\"\")) {\n listToRemove.add(nodeConnection);\n updateCanvas = true;\n }\n } else if (nodeConnection.getConnectionStart() instanceof TestCaseNode) {\n if (!((TestCaseNode) nodeConnection.getConnectionStart()).getLogic().getLogic().contains(\"getNode(\\\"\" + nodeConnection.getConnectionEnd().getContainedText() + \"\\\"\")) {\n listToRemove.add(nodeConnection);\n updateCanvas = true;\n }\n }\n } else if (nodeConnection.getConnectionType().equals(NodeConnection.DISABLED_CONNECTION)) {\n if (nodeConnection.getConnectionStart() instanceof SwitchNode) {\n List<Switch> aSwitches = ((SwitchNode) nodeConnection.getConnectionStart()).getSwitches();\n String endContainedText = nodeConnection.getConnectionEnd().getContainedText();\n Integer removeCount = 0;\n for (Switch aSwitch : aSwitches) {\n if ((!aSwitch.getTarget().equals(endContainedText) || aSwitch.isEnabled())) {\n removeCount++;\n }\n }\n\n if (removeCount.equals(aSwitches.size())) {\n // Create an enabled connection between these two nodes to give appearance of toggling\n NodeConnection newConnection = new NodeConnection(nodeConnection.getConnectionStart(), nodeConnection.getConnectionEnd(), NodeConnection.DYNAMIC_CONNECTION);\n connections.add(newConnection);\n\n listToRemove.add(nodeConnection);\n updateCanvas = true;\n }\n }\n }\n\n if (nodeConnection.getConnectionType().equals(NodeConnection.MAIN_CONNECTION)) {\n if (!nodeConnection.getConnectionStart().getNextNodeToRun().equals(nodeConnection.getConnectionEnd().getContainedText())) {\n listToRemove.add(nodeConnection);\n updateCanvas = true;\n }\n }\n }\n\n connections.removeAll(listToRemove);\n if (updateCanvas) {\n Controller.getInstance().updateCanvasControllerLater();\n }\n }","public void removeChildren() {\r\n this.children.clear();\r\n childNum = 0;\r\n }","public void RecursiveExpansion() throws TreeTooBigException {\r\n int transIndex; //Index to count transitions\r\n int[] newMarkup; //markup used to create new node\r\n boolean aTransitionIsEnabled = false; //To check for deadlock\r\n //Attribute used for assessing whether a node has occured before\r\n boolean repeatedNode = false; \r\n \r\n boolean allOmegas = false;\r\n \r\n boolean[] enabledTransitions = \r\n tree.dataLayer.getTransitionEnabledStatusArray(markup);\r\n\r\n //For each transition\r\n for (int i = 0; i < enabledTransitions.length; i++) {\r\n if (enabledTransitions[i] == true) {\r\n //Set transArray of to true for this index\r\n transArray[i] = true;\r\n \r\n //System.out.println(\"\\n Transition \" + i + \" Enabled\" );\r\n aTransitionIsEnabled = true;\r\n \r\n //print (\"\\n Old Markup is :\", markup);//debug\r\n \r\n //Fire transition to produce new markup vector\r\n newMarkup = fire(i);\r\n \r\n //print (\"\\n New Markup is :\", newMarkup);//debug\r\n \r\n //Check for safeness. If any of places have > 1 token set variable.\r\n for (int j = 0; j < newMarkup.length; j++) {\r\n if (newMarkup[j] > 1 || newMarkup[j] == -1) {\r\n tree.moreThanOneToken = true;\r\n break;\r\n }\r\n } \r\n \r\n //Create a new node using the new markup vector and attach it to\r\n //the current node as a child.\r\n children[i] = \r\n new myNode(newMarkup, this, tree, depth + 1);\r\n \r\n /* Now need to (a) check if any omegas (represented by -1) need to \r\n * be inserted in the markup vector of the new node, and (b) if the \r\n * resulting markup vector has appeared anywhere else in the tree. \r\n * We must do (a) before (b) as we need to know if the new node \r\n * contains any omegas to be able to compare it with existing nodes. \r\n */ \r\n allOmegas = children[i].InsertOmegas();\r\n \r\n //check if the resulting markup vector has occured anywhere else in the tree\r\n repeatedNode = (tree.root).FindMarkup(children[i]);\r\n \r\n if (tree.nodeCount >= Pipe.MAX_NODES && !tree.tooBig) {\r\n tree.tooBig = true;\r\n throw new TreeTooBigException();\r\n }\r\n \r\n if (!repeatedNode && !allOmegas) {\r\n children[i].RecursiveExpansion();\r\n }\r\n }\r\n }\r\n \r\n if (!aTransitionIsEnabled) {\r\n System.err.println(\"No transition enabled\");\r\n if (!tree.noEnabledTransitions || tree.pathToDeadlock.length < depth-1) {\r\n RecordDeadlockPath();\r\n tree.noEnabledTransitions = true;\r\n } else {\r\n System.err.println(\"Deadlocked node found, but path is not shorter\"\r\n + \" than current path.\");\r\n }\r\n } else {\r\n //System.out.println(\"Transitions enabled.\");\r\n }\r\n }","public void makeCircular() {\n\t\t// write your code for makeCircular using the specification above\n\t\tNode noderef = head; \n\t\tif (this.size()==1){\n\t\t\tnoderef.next = head;\n\t\t\treturn;\n\t\t}\n\t\tif(this.size()==0){\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tfor(int counter=0; counter < this.size()-1; counter++){\n\t\t\tnoderef = noderef.next;\n\t\t}\n\t\tnoderef.next = head; \n\t}","public static void Execute ()\n\t{\n\t\tReceiveCollection (SpawnCrawler (target));\n\t\t\n\t\tList<String> initialCollection = overCollection;\n\t\t\n\t\tif ( ! initialCollection.isEmpty ())\n\t\t{\n\t\t\n\t\t\tfor (String collected : initialCollection)\n\t\t\t{\n\t\t\t\t\n\t\t\t\tif (collected.contains (\"http\"))\n\t\t\t\t\tReceiveCollection (SpawnCrawler (collected));\n\t\t\t\telse\n\t\t\t\t\tReceiveCollection (SpawnCrawler (target + collected));\n\t\t\t\t\n\t\t\t}\n\t\t\n\t\t}\n\t\t\n\t\t/*\n\t\t * Several loops should commence here where the system reiteratively goes over all the newly acquired URLs\n\t\t * so it may extend itself beyond the first and second depth.\n\t\t * However this process should be halted once it reaches a certain configurable depth.\n\t\t */\n\t\tint depth = 0;\n\t\tint newFoundings = 0;\n\t\t\n\t\tdepthLoop: while (depth <= MAX_DEPTH)\n\t\t{\n\t\t\t\n\t\t\tfor (String collected : overCollection)\n\t\t\t{\n\t\t\t\t\n\t\t\t\tif (collected.contains (\"http\"))\n\t\t\t\t\tSpawnCrawler (collected);\n\t\t\t\telse\n\t\t\t\t\tSpawnCrawler (target + collected);\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\tif (newFoundings <= 0)\n\t\t\t\tbreak depthLoop;\n\t\t\t\n\t\t\tdepth++;\n\t\t\t\t\t\t\n\t\t}\n\t\t\n\t}","public abstract Graph getChildren(String parentHash);","protected void startChildStateReflector() {\n\t\tif (!destroy) {\n\t\t\tlogger().debug(\"Starting Child State Reflector.\");\n\t\t\tchildStateReflector.start();\n\t\t}\n\t}","private static void finalizeAllNestedChildren(SapODataColumnMetadata children) {\n if (children.containsChild()) {\n children.getChildList().forEach(SapODataColumnMetadata::finalizeAllNestedChildren);\n }\n\n children.isChildListComplete = true;\n }","public void testGetCachedChild() {\n FileObject fobj = getFileObject(testFile);\n FileObject parent = fobj.getParent();\n monitor.reset();\n FileObject[] childs = parent.getChildren();\n monitor.getResults().assertResult(1, StatFiles.ALL);\n monitor.getResults().assertResult(1, StatFiles.READ);\n //second time\n monitor.reset();\n childs = parent.getChildren();\n monitor.getResults().assertResult(0, StatFiles.ALL);\n }","public void determinePartitions( Callback c ){\n mCurrentDepth = 0;\n GraphNode node;\n GraphNode child;\n int depth = 0;\n List levelList = new java.util.LinkedList();\n int i = 0;\n //they contain those nodes whose parents have not been traversed as yet\n //but the BFS did it.\n List orphans = new java.util.LinkedList();\n\n\n //set the depth of the dummy root as 0\n mRoot.setDepth( mCurrentDepth );\n\n mQueue.addLast( mRoot );\n\n while( !mQueue.isEmpty() ){\n node = (GraphNode)mQueue.getFirst();\n depth = node.getDepth();\n if( mCurrentDepth < depth ){\n\n if( mCurrentDepth > 0 ){\n //we are done with one level!\n constructPartitions( c, levelList, mCurrentDepth );\n }\n\n\n //a new level starts\n mCurrentDepth++;\n levelList.clear();\n }\n mLogger.log( \"Adding to level \" + mCurrentDepth + \" \" + node.getID(),\n LogManager.DEBUG_MESSAGE_LEVEL);\n levelList.add( node );\n\n //look at the orphans first to see if any\n //of the dependency has changed or not.\n /*it = orphans.iterator();\n while(it.hasNext()){\n child = (GraphNode)it.next();\n if(child.parentsBlack()){\n child.setDepth(depth + 1);\n System.out.println(\"Set depth of \" + child.getID() + \" to \" + child.getDepth());\n\n child.traversed();\n mQueue.addLast(child);\n }\n\n //remove the child from the orphan\n it.remove();\n }*/\n\n\n node.setColor( GraphNode.BLACK_COLOR );\n for( Iterator it = node.getChildren().iterator(); it.hasNext(); ){\n child = (GraphNode)it.next();\n if(!child.isColor( GraphNode.GRAY_COLOR ) &&\n child.parentsColored( GraphNode.BLACK_COLOR )){\n mLogger.log( \"Adding to queue \" + child.getID(),\n LogManager.DEBUG_MESSAGE_LEVEL );\n child.setDepth( depth + 1 );\n child.setColor( GraphNode.GRAY_COLOR );\n mQueue.addLast( child );\n }\n /*else if(!child.isTraversed() && !child.parentsBlack()){\n //we have to do the bumping effect\n System.out.println(\"Bumping child \" + child);\n orphans.add(child);\n }*/\n }\n node = (GraphNode)mQueue.removeFirst();\n mLogger.log( \"Removed \" + node.getID(),\n LogManager.DEBUG_MESSAGE_LEVEL);\n }\n\n //handle the last level of the BFS\n constructPartitions( c, levelList, mCurrentDepth );\n\n\n //all the partitions are dependant sequentially\n for( i = mCurrentDepth; i > 1; i-- ){\n constructLevelRelations( c, i - 1, i );\n\n }\n\n done( c );\n }","protected void populateChildren() throws MessagingException\n {\n connect();\n \n Folder[] sub = store.getDefaultFolder().list();\n addChildren(sub, 0);\n }"],"string":"[\n \"private void createChildren() {\\n\\t\\t\\n\\t\\tfor(int i=0;i<horizontal;i++) {\\n\\t\\t\\t\\n\\t\\t\\tAction a = new Action(i);\\n\\t\\t\\tif(!gameOver && actionIsValid(a)) {\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tPlayer otherPlayer;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(player == Player.PLAYER_BLUE) {\\n\\t\\t\\t\\t\\totherPlayer = Player.PLAYER_RED;\\n\\t\\t\\t\\t}else {\\n\\t\\t\\t\\t\\totherPlayer = Player.PLAYER_BLUE;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tPosition newPosition;\\n\\t\\t\\t\\tnewPosition = new Position(a, ++moveCounter, otherPlayer, this);\\n\\t\\t\\t\\tchildren.add(newPosition);\\t\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"public static void computeChildren() {\\n\\t\\tArrayList<BNNode> children = new ArrayList<BNNode>();\\n\\t\\t// For each node, build an array of children by checking which nodes have it as a parent.\\n\\t\\tfor (BNNode node : nodes) {\\n\\t\\t\\tchildren.clear();\\n\\t\\t\\tfor (BNNode node2 : nodes) {\\n\\t\\t\\t\\tif (node == node2)\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\tfor (BNNode node3 : node2.parents)\\n\\t\\t\\t\\t\\tif (node3 == node)\\n\\t\\t\\t\\t\\t\\tchildren.add(node2);\\n\\t\\t\\t}\\n\\t\\t\\tnode.children = new BNNode[children.size()];\\n\\t\\t\\tnode.children = (BNNode[]) children.toArray(node.children);\\n\\t\\t}\\n\\t}\",\n \"public void reloadChildren() {\\n // clear children list. If later none get created, then there shouldn't be any\\n clearChildren();\\n // check if budgetAccount has sub budgets\\n List<BudgetAccountBE> subBudgets = refAcc.getDirectSubBudgets();\\n int childCount = subBudgets.size();\\n // only act, if referenceAccount has sub budgets\\n if (childCount > 0) {\\n int newLevel = hierarchyLevel + 1;\\n // differentiate isLast for children\\n for (int index = 0; index < childCount; index++) {\\n BudgetAccountTableRow newRow = BudgetAccountTableRow.getInstance(parentActivity);\\n children.add(newRow);\\n newRow.init(budgetListener, subBudgets.get(index), (index == childCount -1), newLevel);\\n }\\n }\\n }\",\n \"public void growthCycle() {\\n\\t\\tboolean doMore = true;\\n\\t\\tdo {\\n\\t\\t\\tdoMore = false;\\n\\t\\t\\tgrower = planter;\\n\\t\\t\\tCollections.shuffle(grower, random);\\n\\t\\t\\tplanter = new ArrayList<Room>();\\n\\t\\t\\tfor(Room room : grower) {\\n\\t\\t\\t\\tif(rooms.size() >= size.maxRooms) {\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(room.plantChildren(this)) {\\n\\t\\t\\t\\t\\t//System.out.println(\\\"Added side room.\\\");\\n\\t\\t\\t\\t\\tdoMore = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t} \\n\\t\\t} while(doMore);\\t\\t\\n\\t\\t//DoomlikeDungeons.profiler.endTask(\\\"Adding Rooms (growthCycle)\\\");\\n\\t}\",\n \"public void selectParents1() {\\n // Create a new parent list for this reproductive cycle. Let the garbage\\n // handler dispose of the old list, if there was one.\\n switch (Defines.parentAlgo) {\\n case Defines.PA_RANDOM:\\n this.parents = this.selectParentsRandom();\\n break;\\n\\n case Defines.PA_ROULETTE:\\n this.parents = this.selectParentsRoulette();\\n break;\\n\\n case Defines.PA_TOURNAMENT:\\n this.parents = this.selectParentsTournament();\\n break;\\n }\\n// this.howGoodAreParents();\\n }\",\n \"@Override\\r\\n\\tpublic void makeChildcare() {\\n\\t\\t\\r\\n\\t}\",\n \"public void init$Children() {\\n }\",\n \"public void init$Children() {\\n }\",\n \"public void init$Children() {\\n }\",\n \"public static void checkCycleSample() {\\n Node ll1_5 = new Node(1, new Node(2, new Node(3, new Node(4, new Node(5, null)))));\\n\\n Node ll1_2 = new Node(1, new Node(2, null));\\n Node ll3_4 = new Node(3, new Node(4, null));\\n Node ll5_6 = new Node(5, new Node(6, null));\\n ll1_2.nextNode.nextNode = ll3_4;\\n ll3_4.nextNode.nextNode = ll5_6;\\n ll5_6.nextNode.nextNode = ll1_2;\\n\\n ll1_2.checkCycle();\\n ll1_5.checkCycle();\\n }\",\n \"protected void prepareToExecuteChildren()\\n \\t{\\n \\t\\tcollectExecutableElements();\\n \\t}\",\n \"public void selectParents() {\\n // Create a new parent list for this reproductive cycle. Let the garbage\\n // handler dispose of the old list, if there was one.\\n switch (Defines.parentAlgo) {\\n case Defines.PA_RANDOM:\\n this.parents = this.selectParentsRandom();\\n break;\\n\\n case Defines.PA_ROULETTE:\\n this.parents = this.selectParentsRoulette();\\n break;\\n\\n case Defines.PA_TOURNAMENT:\\n this.parents = this.selectParentsTournament();\\n break;\\n }\\n// this.howGoodAreParents();\\n }\",\n \"public void rebuild() {\\n\\t\\tif (!divided) {\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\t\\n\\t\\tint totalChildren = 0;\\n\\t\\tfor (QuadTreeNode<E> q : nodes) {\\n\\t\\t\\t// If there is a divided child then we cant do anything\\n\\t\\t\\tif (q.isDivided()) {\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\ttotalChildren += q.numPoints();\\n\\t\\t}\\n\\t\\t\\n\\t\\t// If the sum of all the children contained in the sub nodes\\n\\t\\t// is greater than allowed then we cant do anything\\n\\t\\tif (totalChildren > QUADTREE_NODE_CAPACITY) {\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\t\\n\\t\\t// Add all the nodes from the children to this node then remvoe the nodes\\n\\t\\tpoints = new HashMap<Point, E>();\\n\\t\\tfor (QuadTreeNode<E> q : nodes) {\\n\\t\\t\\tpoints.putAll(q.points);\\n\\t\\t}\\n\\t\\t\\n\\t\\tnodes.clear();\\n\\t\\tdivided = false;\\n\\t}\",\n \"public DynamicModelPart buildChildrenUsingSeeds() {\\n this.children.parallelStream().forEach(child -> {\\n child.buildUsingSeeds();\\n });\\n return this;\\n }\",\n \"public void testGetChildren() throws IOException {\\n FileObject fobj = getFileObject(testFile);\\n FileObject parent = fobj.getParent();\\n parent = parent.createFolder(\\\"parent\\\");\\n File pFile = getFile(parent);\\n for (int i = 0; i < 10; i++) {\\n assertTrue(new File(pFile, \\\"file\\\" + i).createNewFile());\\n assertTrue(new File(pFile, \\\"fold\\\" + i).mkdir());\\n }\\n monitor.reset();\\n FileObject[] children = parent.getChildren();\\n //20 x children, 1 x File.listFiles \\n monitor.getResults().assertResult(21, StatFiles.ALL);\\n monitor.getResults().assertResult(21, StatFiles.READ);\\n //second time\\n monitor.reset();\\n children = parent.getChildren();\\n monitor.getResults().assertResult(0, StatFiles.ALL);\\n }\",\n \"private Node constructInternal(List<Node> children){\\r\\n\\r\\n // Base case: root found\\r\\n if(children.size() == 1){\\r\\n return children.get(0);\\r\\n }\\r\\n\\r\\n // Generate parents\\r\\n boolean odd = children.size() % 2 != 0;\\r\\n for(int i = 1; i < children.size(); i += 2){\\r\\n Node left = children.get(i-1);\\r\\n Node right = children.get(i);\\r\\n Node parent = new Node(Utility.SHA512(left.hash + right.hash), left, right);\\r\\n children.add(parent);\\r\\n }\\r\\n\\r\\n // If the number of nodes is odd, \\\"inherit\\\" the remaining child node (no hash needed)\\r\\n if(odd){\\r\\n children.add(children.get(children.size() - 1));\\r\\n }\\r\\n return constructInternal(children);\\r\\n }\",\n \"private static ArrayList<MMT> generateChildren(Board currentBoard, String mPlayer, boolean ifChildMax, int depthToGo){\\n\\t\\t//System.out.println(\\\"generate children! depth to go is \\\" + depthToGo);\\n\\t\\tif (depthToGo == 0)\\n\\t\\t\\treturn null;\\n\\t\\tArrayList<MMT> childLst = new ArrayList<MMT>();\\n\\t\\tfor (int j = 0; j<Board.getNumCol(); j++){\\n\\t\\t\\tBoard childBoard = new Board(currentBoard);\\n\\t\\t\\tboolean success = childBoard.fillBoard(j, getCurrentNodePiece(mPlayer, ifChildMax));\\n\\t\\t\\t//Board.printBoard(childBoard);\\n\\t\\t\\t//System.out.println(\\\"score for this board: \\\" + Eval.evalBoard(childBoard, mPlayer));\\n\\t\\t\\t//if valid move, then add board\\n\\t\\t\\tif (success){\\n\\t\\t\\t\\t//set depth to 0 (to stop) if someone wins or tie\\n\\t\\t\\t\\tint depth;\\n\\t\\t\\t\\tif (Eval.checkTie(childBoard) || Eval.ifHumanWon(childBoard) ||\\n\\t\\t\\t\\t\\t\\tEval.ifPCWon(childBoard)){\\n\\t\\t\\t\\t\\tdepth = 0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\tdepth = depthToGo -1;\\n\\t\\t\\t\\t\\t//depth = depthToGo; //depth not reduced at constructor\\n\\t\\t\\t\\tMMT child = new MMT(childBoard, depth, mPlayer, ifChildMax, j);\\n\\t\\t\\t\\tchildLst.add(child);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (childLst.size() == 0)\\n\\t\\t\\treturn null;\\n\\t\\treturn childLst;\\n\\t}\",\n \"public void resetParents() {\\r\\n }\",\n \"public void init$Children() {\\n children = new ASTNode[1];\\n }\",\n \"public void testGetChildrenCaches() throws IOException {\\n FileObject fobj = getFileObject(testFile);\\n FileObject parent = fobj.getParent();\\n List<FileObject> l = new ArrayList<FileObject>();\\n parent = parent.createFolder(\\\"parent\\\");\\n for (int i = 0; i < 20; i++) {\\n l.add(parent.createData(\\\"file\\\" + i + \\\".txt\\\"));\\n }\\n\\n monitor.reset();\\n //20 x FileObject + 1 File.listFiles\\n FileObject[] children = parent.getChildren();\\n monitor.getResults().assertResult(1, StatFiles.ALL);\\n monitor.getResults().assertResult(1, StatFiles.READ);\\n for (FileObject ch : children) {\\n assertNull(\\\"No sibling\\\", FileUtil.findBrother(ch, \\\"exe\\\"));\\n }\\n monitor.getResults().assertResult(1, StatFiles.ALL);\\n monitor.getResults().assertResult(1, StatFiles.READ);\\n }\",\n \"public DynamicModelPart buildChildren() {\\n this.children.parallelStream().forEach(child -> {\\n child.build();\\n });\\n return this;\\n }\",\n \"private void initSubNodes()\\n {\\n children = createSubNodes(false);\\n attributes = createSubNodes(true);\\n }\",\n \"void buildHeap() {\\n for (int i = parent(size - 1); i >= 0; i--) {\\n percolateDown(i);\\n }\\n }\",\n \"void buildHeap() {\\n\\tfor(int i=parent(size-1); i>=0; i--) {\\n\\t percolateDown(i);\\n\\t}\\n }\",\n \"private void compose() {\\n for(Group group : inputGroupList){\\n if(group.getGroups().size() > 0){\\n LinkedList<Integer> upperGroups = group.getGroups();\\n for(int i = 0; i < upperGroups.size(); i++){\\n int id = upperGroups.get(i);\\n Group upper = findById(id);\\n upper.addChild(group);\\n }\\n } else{\\n root.addChild(group);\\n }\\n }\\n for(Address adr : inputAddressList){\\n if(adr.getGroups().size() > 0){\\n LinkedList<Integer> upperGroups = adr.getGroups();\\n for(int i = 0; i < upperGroups.size(); i++){\\n int id = upperGroups.get(i);\\n Group upper = findById(id);\\n upper.addChild(adr);\\n adr.addParent(upper);\\n }\\n } else{\\n root.addChild(adr);\\n }\\n }\\n\\n assert(root.getChildren().size() > 0);\\n }\",\n \"private void mapChildren(SortedSet<Integer> parents) {\\n\\n\\t\\tIterator<Integer> iterator = parents.iterator();\\n\\t\\twhile (iterator.hasNext()) {\\n\\t\\t\\tint next = iterator.next();\\n\\t\\t\\tthis.children.put(next, new ArrayList<Integer>());\\n\\n\\t\\t}\\n\\t\\t// save the parent of every id in par and check if they are contained in\\n\\t\\t// parent list\\n\\n\\t\\tfor (int i : this.idMap.keySet()) {\\n\\n\\t\\t\\tint par = Integer.parseInt(this.idMap.get(i).get(1));\\n\\t\\t\\tthis.children.get(par).add(i);\\n\\n\\t\\t}\\n\\n\\t}\",\n \"public void finalizeChildren() {\\n finalizeAllNestedChildren(this);\\n }\",\n \"private boolean helperDFS(Node current){\\n\\n if(expandedNode.size() == 999){\\n //limit has been reached. jump out of recursion.\\n expandedNode.add(current);\\n System.out.println(\\\"No solution found.\\\");\\n printExpanded(expandedNode);\\n System.exit(0);\\n return false;\\n }\\n\\n boolean b = cycleCheck(current,expandedNode);\\n\\n if(!b){\\n expandedNode.add(current);\\n }else{\\n return false;\\n }\\n\\n if(current.getDigit().getDigitString().equals(goalNode.getDigit().getDigitString())){\\n //goal reached.\\n //expandedNode.add(current);\\n solutionPath(current);\\n printExpanded(expandedNode);\\n System.exit(0);\\n }\\n\\n //Now make the children.\\n\\n if(!forbidden.contains(current.getDigit().getDigitString())){\\n\\n if(current.getDigit().last_changed != 0){\\n\\n if ((Integer.parseInt(current.getDigit().getFirst_digit()) - 1 >= 0)) {\\n Node child_node = new Node(current.getDigit().decreaseFirstDigit());\\n child_node.setParent(current);\\n child_node.getDigit().setLastChanged(0);\\n if(!forbidden.contains(child_node.getDigit().getDigitString()) && helperDFS(child_node)){\\n return true;\\n }\\n }\\n\\n //+1 child first digit\\n if ((Integer.parseInt(current.getDigit().getFirst_digit()) + 1 <= 9)) {\\n Node child_node = new Node(current.getDigit().increaseFirstDigit());\\n child_node.setParent(current);\\n child_node.getDigit().setLastChanged(0);\\n if(!forbidden.contains(child_node.getDigit().getDigitString()) && helperDFS(child_node)){\\n return true;\\n }\\n }\\n }\\n\\n if(current.getDigit().last_changed != 1){\\n if ((Integer.parseInt(current.getDigit().getSecond_digit()) - 1 >= 0)) {\\n Node child_node = new Node(current.getDigit().decreaseSecondDigit());\\n child_node.setParent(current);\\n child_node.getDigit().setLastChanged(1);\\n if(!forbidden.contains(child_node.getDigit().getDigitString()) && helperDFS(child_node)){\\n return true;\\n }\\n }\\n\\n //+1 child\\n if ((Integer.parseInt(current.getDigit().getSecond_digit()) + 1 <= 9)) {\\n Node child_node = new Node(current.getDigit().increaseSecondDigit());\\n child_node.setParent(current);\\n child_node.getDigit().setLastChanged(1);\\n if(!forbidden.contains(child_node.getDigit().getDigitString()) && helperDFS(child_node)){\\n return true;\\n }\\n }\\n }\\n\\n if(current.getDigit().last_changed != 2){\\n if ((Integer.parseInt(current.getDigit().getThird_digit()) - 1 >= 0)) {\\n Node child_node = new Node(current.getDigit().decreaseThirdDigit());\\n child_node.setParent(current);\\n child_node.getDigit().setLastChanged(2);\\n if(!forbidden.contains(child_node.getDigit().getDigitString()) && helperDFS(child_node)){\\n return true;\\n }\\n }\\n //+1 child\\n if ((Integer.parseInt(current.getDigit().getThird_digit()) + 1 <= 9)) {\\n Node child_node = new Node(current.getDigit().increaseThirdDigit());\\n child_node.setParent(current);\\n child_node.getDigit().setLastChanged(2);\\n if(!forbidden.contains(child_node.getDigit().getDigitString()) && helperDFS(child_node)){\\n return true;\\n }\\n }\\n }\\n }\\n return false;\\n }\",\n \"private boolean isAcyclic() {\\n boolean visited[] = new boolean[getNumNodes()];\\n boolean noCycle = true;\\n int list[] = new int[getNumNodes() + 1];\\n int index = 0;\\n int lastIndex = 1;\\n list[0] = randomParent;\\n visited[randomParent] = true;\\n while (index < lastIndex && noCycle) {\\n int currentNode = list[index];\\n int i = 1;\\n\\n // verify parents of current node\\n while ((i < parentMatrix[currentNode][0]) && noCycle) {\\n if (!visited[parentMatrix[currentNode][i]]) {\\n if (parentMatrix[currentNode][i] != randomChild) {\\n list[lastIndex] = parentMatrix[currentNode][i];\\n lastIndex++;\\n }\\n else {\\n noCycle = false;\\n }\\n visited[parentMatrix[currentNode][i]] = true;\\n } // end of if(visited)\\n i++;\\n }\\n index++;\\n }\\n //System.out.println(\\\"\\\\tnoCycle:\\\"+noCycle);\\n return noCycle;\\n }\",\n \"void updateAllParentsBelow();\",\n \"public void setChildren(Node[][] graph){\\n if(inBounds(row+1, col+1)) {\\n if (graph[row + 1][col + 1].getType() != '0')\\n children.add(graph[row + 1][col + 1]);\\n }\\n if(inBounds(row, col+1)){\\n if (graph[row][col + 1].getType() != '0')\\n children.add(graph[row][col + 1]);\\n }\\n if(inBounds(row-1, col+1)) {\\n if (graph[row - 1][col + 1].getType() != '0')\\n children.add(graph[row - 1][col + 1]);\\n }\\n if(inBounds(row+1, col)) {\\n if (graph[row + 1][col].getType() != '0')\\n children.add(graph[row + 1][col]);\\n }\\n if(inBounds(row-1, col)) {\\n if (graph[row - 1][col].getType() != '0')\\n children.add(graph[row - 1][col]);\\n }\\n if(inBounds(row+1, col-1)) {\\n if (graph[row + 1][col - 1].getType() != '0')\\n children.add(graph[row + 1][col - 1]);\\n }\\n if(inBounds(row, col-1)) {\\n if (graph[row][col - 1].getType() != '0')\\n children.add(graph[row][col - 1]);\\n }\\n if(inBounds(row-1, col-1)) {\\n if (graph[row - 1][col - 1].getType() != '0')\\n children.add(graph[row - 1][col - 1]);\\n }\\n }\",\n \"protected int numChildren() {\\r\\n return 3;\\r\\n }\",\n \"public void init$Children() {\\n children = new ASTNode[3];\\n setChild(new List(), 1);\\n setChild(new List(), 2);\\n }\",\n \"private void MakeParentChildLink() {\\n\\n //Hier wordt de hoogte van elke rij opgeslagen\\n heightList = new ArrayList<>();\\n\\n for(Slot slot: slots) {\\n int slotCenterY = slot.getCenterY() / 10;\\n int slotCenterX = slot.getCenterX() / 10;\\n\\n // Als de Z gelijk is aan nul weten we dat het slot zich op de grond bevindt\\n if (slot.getZ() == 0) {\\n //initialisatie (if grondslot get(slotcenterY) geen value heeft maak een value new Hashmap)\\n grondSlots.computeIfAbsent(slotCenterY, s -> new HashMap<>());\\n\\n //Er zijn ook input en output slots dus enkel bij storage\\n if (slot.getType().equals(Slot.SlotType.STORAGE)) {\\n grondSlots.get(slotCenterY).put(slotCenterX, slot);\\n\\n }\\n } else {\\n Slot child = grondSlots.get(slotCenterY).get(slotCenterX);\\n // we stijgen telkens tot op de hoogste z\\n for (int i = 1; i < slot.getZ(); i++) {\\n child = child.getParent();\\n }\\n //Als we de child gevonden hebben zetten we de link\\n slot.setChild(child);\\n child.setParent(slot);\\n }\\n\\n //Wanneer het slot gevuld is in een hashmap steken\\n if (slot.getItem() != null)\\n itemSlotLocation.put(slot.getItem().getId(), slot);\\n }\\n\\n for(HashMap<Integer, Slot> row : grondSlots.values()){\\n heightList.add(GeneralMeasures.hoogteBezetting(new HashSet<>(row.values())));\\n }\\n }\",\n \"private void subdivide() {\\n if (!hasChildren) {\\n hasChildren = true;\\n this.children = new QuadtreeNodeChildren(this);\\n } else {\\n return;\\n }\\n }\",\n \"private void shrinkComponents() {\\n List<List<XGraph.XVertex>> components = getComponents();\\n XGraph.XVertex componentVertices[] = new XGraph.XVertex[components.size()];\\n\\n int index = 0;\\n //create or assign component\\n for (List<XGraph.XVertex> component : components) {\\n //if the size of the component is 1 then there is no need to create a new component group.\\n componentVertices[index++] = component.size() == 1 ? component.get(0) :\\n graph.getNewComponent();\\n }\\n index = 0;\\n //Add edges\\n for (XGraph.XVertex component : componentVertices) {\\n //Disable vertex and edges of the children and get minimum edge\\n Hashtable<Integer, XGraph.XEdge> minEdges = new Hashtable<>();\\n //Process all child vertices only if this is a new component\\n if (components.get(index).size() > 1) {\\n for (XGraph.XVertex vertex : components.get(index++)) {\\n getMinEdges(vertex, minEdges);\\n vertex.disable();\\n }\\n } else {\\n index++;\\n getMinEdges(component, minEdges);\\n }\\n for (Map.Entry<Integer, XGraph.XEdge> edgeEntry : minEdges.entrySet()) {\\n XGraph.XEdge minEdge = edgeEntry.getValue();\\n XGraph.XVertex toVertex = componentVertices[scc.getComponentNo(minEdge.toVertex())];\\n //Edge already there in original graph no need to add\\n if (toVertex == minEdge.toVertex() && component == minEdge.fromVertex()) {\\n continue;\\n }\\n //Need to create a new edge\\n minEdge.disable();\\n //Avoid loopback\\n if (toVertex.isComponent() && toVertex != minEdge.toVertex()) {\\n minEdge = new XGraph.XEdge(component, toVertex, minEdge.getWeight(), minEdge);\\n } else {\\n minEdge = new XGraph.XEdge(component, toVertex, minEdge.getWeight(), minEdge.getOriginal());\\n }\\n component.addEdge(minEdge);\\n toVertex.addRevEdge(minEdge);\\n }\\n }\\n }\",\n \"protected void createTree() {\\n\\n\\t\\tint nextPlayer = opponent;\\n\\n\\t\\tQueue<Node> treeQueue = new LinkedList<Node>();\\n\\t\\tWinChecker winCheck = new WinChecker();\\n\\n\\t\\ttreeQueue.add(parent);\\n\\n\\t\\twhile (!treeQueue.isEmpty()) {\\n\\t\\t\\tNode currentNode = treeQueue.poll();\\n\\n\\t\\t\\tif (currentNode.getMove().Row != -1\\n\\t\\t\\t\\t\\t&& currentNode.getMove().Col != -1) {\\n\\t\\t\\t\\tgb.updateBoard(currentNode.getMove());\\n\\n\\t\\t\\t\\tif (winCheck.getWin(gb) >= 0) {\\n\\t\\t\\t\\t\\tgb.revertBoard(currentNode.getMove());\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tgb.revertBoard(currentNode.getMove());\\n\\t\\t\\t}\\n\\n\\t\\t\\t// Restricting the depth to which we will create the tree\\n\\t\\t\\tif (currentNode.getPly() > 2) {\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor (List<Hexagon> tempList : this.gb.getBoard()) {\\n\\t\\t\\t\\tfor (Hexagon tempHex : tempList) {\\n\\n\\t\\t\\t\\t\\tif (tempHex == null) {\\n\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif (tempHex.getValue() == EMPTY) {\\n\\n\\t\\t\\t\\t\\t\\tif (currentNode.getPly() % 2 == 0) {\\n\\t\\t\\t\\t\\t\\t\\tnextPlayer = opponent;\\n\\t\\t\\t\\t\\t\\t} else if (currentNode.getPly() % 2 == 1) {\\n\\t\\t\\t\\t\\t\\t\\tnextPlayer = player;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tMove nextMove = new Move(nextPlayer, false,\\n\\t\\t\\t\\t\\t\\t\\t\\ttempHex.getRow(), tempHex.getColumn());\\n\\n\\t\\t\\t\\t\\t\\tNode newNode = new Node(currentNode.getPly() + 1,\\n\\t\\t\\t\\t\\t\\t\\t\\tnextMove);\\n\\t\\t\\t\\t\\t\\tnewNode.setParent(currentNode);\\n\\n\\t\\t\\t\\t\\t\\tcurrentNode.children.add(newNode);\\n\\n\\t\\t\\t\\t\\t\\ttreeQueue.add(newNode);\\n\\t\\t\\t\\t\\t\\ttempHex.setValue(EMPTY);\\n\\t\\t\\t\\t\\t}// End of if statement\\n\\n\\t\\t\\t\\t}// End of inner ForLoop\\n\\t\\t\\t}// End of outer ForLoop\\n\\n\\t\\t\\t// currentNode.printChildren();\\n\\n\\t\\t}// End of While Loop\\n\\n\\t}\",\n \"public void setChildrenParent ()\\r\\n {\\r\\n if (logger.isFineEnabled()) {\\r\\n logger.fine(\\\"setChildrenParent of \\\" + this);\\r\\n }\\r\\n\\r\\n // Make all children point to this node as parent\\r\\n for (TreeNode node : children) {\\r\\n node.setParent(this);\\r\\n node.setChildrenParent(); // Recursively\\r\\n }\\r\\n }\",\n \"private void connectAll()\\n {\\n\\t\\tint i = 0;\\n\\t\\tint j = 1;\\n\\t\\twhile (i < getNodes().size()) {\\n\\t\\t\\twhile (j < getNodes().size()) {\\n\\t\\t\\t\\tLineEdge l = new LineEdge(false);\\n\\t\\t\\t\\tl.setStart(getNodes().get(i));\\n\\t\\t\\t\\tl.setEnd(getNodes().get(j));\\n\\t\\t\\t\\taddEdge(l);\\n\\t\\t\\t\\tj++;\\n\\t\\t\\t}\\n\\t\\t\\ti++; j = i+1;\\n\\t\\t}\\n\\n }\",\n \"private void freezeChildNavControl()\\n\\t{\\n\\t\\t//freeze nav controls\\n\\t\\tnavPanel.freezeNavControls();\\n\\t\\tfor (TablePanel childPanel : SubTablePanels.values()) {\\n\\t\\t\\tchildPanel.freezeChildNavControl();\\n\\t\\t}\\n\\t}\",\n \"public Node(int numberChildren){\\n board = new Board();\\n children = new Node[numberChildren];\\n }\",\n \"protected void makeChild(FHeapNode y, FHeapNode x)\\r\\n { \\r\\n y.left.right = y.right;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// remove y from root list of heap\\r\\n y.right.left = y.left;\\r\\n \\r\\n y.parent = x;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// make y a child of x\\r\\n\\r\\n if (x.child == null)\\r\\n\\t\\t{\\r\\n x.child = y;\\r\\n y.right = y;\\r\\n y.left = y;\\r\\n } \\r\\n\\t\\telse\\r\\n\\t\\t{\\r\\n y.left = x.child;\\r\\n y.right = x.child.right;\\r\\n x.child.right = y;\\r\\n y.right.left = y;\\r\\n }\\t\\t\\t\\r\\n x.degree++;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// increase degree[x] \\r\\n y.childCut = false;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// set childCut[y] to false\\r\\n }\",\n \"private void createChildrenNodes(ChessGameNode rootNode) {\\r\\n\\t\\tBoardState nextState;\\r\\n\\t\\tChessGameNode newNode;\\r\\n\\t\\tchar currentPlayer = rootNode.getPlayer();\\r\\n\\r\\n\\t\\tgenerateLegalMovesPlayer(currentPlayer);\\r\\n\\t\\trootNode.allocateSpaceForChildren(this.moveList.length);\\r\\n\\r\\n\\t\\tfor (int i = 0; i < this.moveList.length; i++) {\\r\\n\\t\\t\\tif (this.moveList[i] != null) {\\r\\n\\t\\t\\t\\tnextState = makeMove(rootNode, this.moveList[i]);\\r\\n\\t\\t\\t\\tif (currentPlayer == 'w') {\\r\\n\\t\\t\\t\\t\\tnewNode = new ChessGameNode(nextState, 'b', this.moveList[i]);\\r\\n\\t\\t\\t\\t\\tnewNode.setValue();\\r\\n\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\tnewNode = new ChessGameNode(nextState, 'w', this.moveList[i]);\\t\\r\\n\\t\\t\\t\\t\\tnewNode.setValue();\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\trootNode.setChildrenNode(i, newNode);\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public void init$Children() {\\n children = new ASTNode[2];\\n setChild(new List(), 1);\\n }\",\n \"@Override\\n protected void refreshChildren() {\\n }\",\n \"public void createChild (GenericTreeNode<String> daddy)\\r\\n\\t{\\r\\n\\t\\t\\tList < GenericTreeNode<String> > child= daddy.getChildren();\\r\\n\\t\\t\\r\\n\\t\\tif (daddy.getData().equalsIgnoreCase(\\\"next.CommonProfile.Dashboard_SI\\\")){\\r\\n\\t\\t\\tchild.add(new GenericTreeNode<String>(\\\"next.SupportFunctionality.VoiceRecogFunctionality\\\"));\\r\\n\\t\\t\\tchild.add(new GenericTreeNode<String>(\\\"next.Admin.Admin_Principal\\\"));\\r\\n\\t\\t\\tchild.add(new GenericTreeNode<String>(\\\"next.Client.Client_Principal\\\"));\\t\\r\\n\\t\\t\\tchild.add(new GenericTreeNode<String>(\\\"next.Member.Member_Principal\\\"));\\t\\r\\n\\t\\t}\\r\\n\\t\\telse if (daddy.getData().equalsIgnoreCase(\\\"next.CommonProfile.Dashboard_SU\\\")){\\r\\n\\t\\t\\tchild.add(new GenericTreeNode<String>(\\\"next.SupportFunctionality.VoiceRecogFunctionality\\\"));\\r\\n\\t\\t\\t//child.add(new GenericTreeNode<String>(\\\"next.CommonProfile.DashboardPrincipal\\\"));\\t\\r\\n\\t\\t}\\r\\n\\t\\telse if (daddy.getData().equalsIgnoreCase(\\\"next.Admin.Admin_Principal\\\")){\\r\\n\\t\\t\\tchild.add(new GenericTreeNode<String>(\\\"next.CommonProfile.PersonalInfo\\\"));\\r\\n\\t\\t\\tchild.add(new GenericTreeNode<String>(\\\"next.CommonProfile.Products\\\"));\\r\\n\\t\\t\\tchild.add(new GenericTreeNode<String>(\\\"next.Admin.Business_Rules\\\"));\\r\\n\\t\\t\\tchild.add(new GenericTreeNode<String>(\\\"next.view.support.CustomList\\\"));\\r\\n\\t\\t\\tchild.add(new GenericTreeNode<String>(\\\"next.SupportFunctionality.VoiceRecogFunctionality\\\"));\\r\\n\\t\\t}\\r\\n\\t\\telse if (daddy.getData().equalsIgnoreCase(\\\"next.view.support.CustomList\\\")){\\r\\n\\t\\t\\tchild.add(new GenericTreeNode<String>(\\\"next.SupportFunctionality.VoiceRecogFunctionality\\\"));\\r\\n\\t\\t\\tchild.add(new GenericTreeNode<String>(\\\"next.SupportFunctionality.MapsFunctionality\\\"));\\r\\n\\t\\t\\t\\r\\n\\t\\t}else if (daddy.getData().equalsIgnoreCase(\\\"next.SupportFunctionality.MapsFunctionality\\\")){\\r\\n\\t\\t\\tchild.add(new GenericTreeNode<String>(\\\"next.SupportFunctionality.VoiceRecogFunctionality\\\"));\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tdaddy.setChildren(child);\\r\\n\\t\\t for (GenericTreeNode<String> node : daddy.getChildren()) {\\r\\n\\t\\t\\t createChild (node);\\r\\n\\t }\\r\\n\\t}\",\n \"public void init$Children() {\\n children = new ASTNode[3];\\n setChild(new List(), 1);\\n setChild(new Opt(), 2);\\n }\",\n \"private void constructTree() {\\r\\n\\t\\tsortLeaves();\\r\\n\\t\\tNode currentNode;\\r\\n\\t\\tint index = 0;\\r\\n\\t\\t\\tdo{\\r\\n\\t\\t\\t\\t// Create a new node with the next two least frequent nodes as its children\\r\\n\\t\\t\\t\\tcurrentNode = new Node(this.treeNodes[0], this.treeNodes[1]); \\r\\n\\t\\t\\t\\taddNewNode(currentNode);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\twhile (this.treeNodes.length > 1); // Until there is only one root node\\r\\n\\t\\t\\tthis.rootNode = currentNode;\\r\\n\\t\\t\\tindex++;\\r\\n\\t}\",\n \"@Override\\n public void prepare() {\\n leftChild.prepare();\\n rightChild.prepare();\\n\\n // Use the parent class' helper-function to prepare the schema.\\n prepareSchemaStats();\\n\\n /** if the join is an anti or semi join, must change the schema to that of the left child*/\\n if (joinType == JoinType.ANTIJOIN || joinType == JoinType.SEMIJOIN) {\\n schema = leftChild.getSchema();\\n sem_ant = true;\\n outer = false;\\n }\\n /** If the join type is an outer, sets state variables and creates the null-pad tuple*/\\n else if (joinType == JoinType.LEFT_OUTER || joinType == JoinType.RIGHT_OUTER) {\\n outer = true;\\n sem_ant = false;\\n if (joinType == JoinType.LEFT_OUTER)\\n nullPad = new TupleLiteral(rightChild.getSchema().numColumns());\\n else {\\n nullPad = new TupleLiteral(leftChild.getSchema().numColumns());\\n }\\n }\\n /** if the join is an inner join*/\\n else {\\n sem_ant = false;\\n outer = false;\\n }\\n \\n // We obtain the cost of our children\\n PlanCost lChildCost = leftChild.getCost();\\n PlanCost rChildCost = rightChild.getCost();\\n \\n // Our base number of tuples is the two tuples multiplied together\\n float totalTuples = lChildCost.numTuples * rChildCost.numTuples;\\n \\n // If we have a predicate, we multiply by this value\\n if (predicate != null) {\\n // We use a selectivity estimator if necessary\\n float selValue = SelectivityEstimator.estimateSelectivity(\\n predicate, \\n schema, \\n stats);\\n \\n // Anti-joins will have the opposite of our estimated selectivity\\n if (joinType == JoinType.ANTIJOIN || \\n joinType == JoinType.SEMIJOIN) {\\n selValue = 1 - selValue;\\n }\\n totalTuples *= selValue;\\n }\\n // Outer joins require extra nodes for their bounds\\n if (joinType == JoinType.LEFT_OUTER) {\\n totalTuples += lChildCost.numTuples;\\n }\\n else if (joinType == JoinType.RIGHT_OUTER) {\\n totalTuples += rChildCost.numTuples;\\n }\\n \\n cost = new PlanCost(\\n // We have our total number of tuples\\n totalTuples,\\n // Our overall tuple size is now the size of the two\\n // tuples added together\\n lChildCost.tupleSize + rChildCost.tupleSize,\\n // Our CPU cost is the cost of going through every tuple\\n // on the right child for every tuple on the left\\n // and for computing both tables\\n lChildCost.numTuples * rChildCost.numTuples + lChildCost.cpuCost + rChildCost.cpuCost,\\n // Our block cost is the cost of going through the blocks\\n // in the two children\\n lChildCost.numBlockIOs + rChildCost.numBlockIOs);\\n }\",\n \"protected abstract void childManager(ForkManager child_, double time_);\",\n \"public final void markChildrenLayoutNecessary() {\\n setStatusBits(CHILDREN_LAYOUT_NECESSARY_BIT);\\n }\",\n \"protected void addChildrenNodes(List<DFNode> fringe, DFNode parentNode, List<ActionStatePair> children) {\\n Object[] childrenArray = children.toArray();\\n\\n for (int i = 0; i < childrenArray.length; i++) {\\n ActionStatePair actionState = (ActionStatePair) childrenArray[i];\\n CCAction action = (CCAction) actionState.action;\\t\\t\\t\\t\\t\\t\\t//get the action component\\n CCState childState = actionState.state;\\t\\t\\t\\t\\t\\t\\t//get the state component\\n DFNode childNode = new DFNode(childState, parentNode, action);\\t//create new child node\\n this.addChild(fringe, childNode);\\t\\t\\t\\t\\t\\t\\t//add child node to end of fringe\\n this.nodeVisited++;\\n }\\n }\",\n \"static void setupLCA() {\\n maxDepth = 0;\\n depth = new int[N]; // store the depth of each node\\n firstParents = new int[N]; // the immediate parent\\n firstParents[0] = 0;\\n depth[0] = 0;\\n dfs(0);\\n int power = 1;\\n // Increase the power higher until we go over the maxDepth\\n // This will be one more than we need\\n while (1 << power <= maxDepth) {\\n power++;\\n }\\n parent = new int[power][N]; // go up 2^power from node i of N\\n // Now, use that initial information acquired from the dfs to build\\n // base cases of the sparse tables!\\n for (int node = 0; node < N; node++) {\\n parent[0][node] = firstParents[node];\\n }\\n // Necessary to set everything else to zero for now, so\\n // that we never get confused if we are out of bounds\\n\\n // Must fill it up with -1's\\n for (int p = 1; p < parent.length; p++) {\\n for (int i = 0; i < N; i++) {\\n parent[p][i] = -1;\\n }\\n }\\n // p represents going up by 1 << p\\n for (int p = 1; p < parent.length; p++) {\\n for (int node = 0; node < N; node++) {\\n if (parent[p - 1][node] != -1) {\\n int myParent = parent[p - 1][node];\\n parent[p][node] = parent[p-1][myParent];\\n }\\n }\\n }\\n }\",\n \"private void setParentBounds() {\\n GraphRepresentation baseGraph = graphRepresentationFactory.getBaseGraph();\\n\\n Iterator<Task> iterator = tasks.iterator();\\n while (iterator.hasNext()) {\\n Task nextTask = iterator.next();\\n List<Integer> nextTaskParents = baseGraph.getParents(nextTask.getIdentifier());\\n nextTask.setParentBound(nextTaskParents.size());\\n }\\n }\",\n \"public LG(){\\n\\t\\tchildren = new LinkedHashMap<Loop, LinkedHashSet<Loop>>();\\n\\t\\tparent = new LinkedHashMap<Loop, Loop>();\\n\\t\\tloops = new LinkedHashSet<Loop>();\\n\\t\\tloopCounter = new LinkedHashMap<Loop, Integer>();\\n\\t}\",\n \"void expandChilds() {\\n\\t\\t\\tenumAndExpand(this.parentItem);\\n\\t\\t}\",\n \"private void sink(int i) {\\n if (2*i > N)\\n return;\\n int maxChild = 2*i;\\n if (maxChild < N && compare(maxChild, maxChild+1) < 0)\\n maxChild++;\\n if (compare(maxChild, i) > 0) {\\n swap(maxChild, i);\\n sink(maxChild);\\n }\\n }\",\n \"private void initializeGraphAsEmpty() {\\n int max = getNumNodes();\\n\\n parentMatrix = new int[getNumNodes()][max];\\n childMatrix = new int[getNumNodes()][max];\\n\\n for (int i = 0; i < getNumNodes(); i++) {\\n parentMatrix[i][0] = 1; //set first node\\n childMatrix[i][0] = 1;\\n }\\n\\n for (int i = 0; i < getNumNodes(); i++) {\\n for (int j = 1; j < max; j++) {\\n parentMatrix[i][j] = -5; //set first node\\n childMatrix[i][j] = -5;\\n }\\n }\\n }\",\n \"void depend(int parentID, int childID){\\n check(parentID, childID);\\n nodes_[childID].parent_ = parentID;\\n nodes_[parentID].addChild(childID);\\n }\",\n \"public void assignAllSiblings(){\\n \\n List<Informacion> pasos=ejemplo.getListaPasos();\\n for(Informacion info:pasos){\\n if(info.getElemento().split(\\\" \\\").length>1){\\n assignSiblings(info.getElemento().split(\\\" \\\"));\\n } \\n }\\n }\",\n \"public void setChildren(List<BTreeNode<E>> newChildren) {\\n\\t\\t//not adding in order, but does not matter because list is empty, and you will only call this method when the children are in order\\n\\t\\tchildren.addAll(newChildren);\\n\\t\\tfor (BTreeNode<E> child: newChildren) {\\n\\t\\t\\tchild.parent = this;\\n\\t\\t}\\n\\t}\",\n \"protected void childrenChanged() {\\n proxyGroup.childrenChanged();\\n }\",\n \"public void releaseChildren() {\\n if (children != null) {\\n unloadChildren();\\n\\n children.unload();\\n children = null;\\n }\\n }\",\n \"void loadChilds() throws ApplicationException {\\n\\t\\t\\t// iterate over childs\\n\\t\\t\\tGenericIterator list = element.getChildren();\\n\\t\\t\\twhile (list.hasNext()) {\\n\\t\\t\\t\\tnew Item(this.parentItem, (GenericObjectNode) list.next());\\n\\t\\t\\t}\\n\\t\\t}\",\n \"private void recursiveCreateChildren(IFolder parentFolder, int depth) throws CoreException {\\n \\t\\t//create TREE_WIDTH files\\n \\t\\tfor (int i = 0; i < TREE_WIDTH; i++) {\\n \\t\\t\\tIFile file = parentFolder.getFile(createString(10));\\n \\t\\t\\tfile.create(new ByteArrayInputStream(createBytes(5000)), IResource.NONE, getMonitor());\\n \\t\\t}\\n \\t\\tif (depth <= 0)\\n \\t\\t\\treturn;\\n \\t\\t//create TREE_WIDTH folders\\n \\t\\tfor (int i = 0; i < TREE_WIDTH; i++) {\\n \\t\\t\\tIFolder folder = parentFolder.getFolder(createString(6));\\n \\t\\t\\tfolder.create(IResource.NONE, true, getMonitor());\\n \\t\\t\\trecursiveCreateChildren(folder, depth - 1);\\n \\t\\t}\\n \\t}\",\n \"private void buildParentTransformAndSourceNode(TransformNode transformNode, Map<String, Object> parentsIdMap) {\\n for (Map.Entry<String, Object> entry : parentsIdMap.entrySet()) {\\n String tmpNodeId = entry.getKey();\\n //heads shouldn't have self dependency id in it\\n if (heads.contains(tmpNodeId)\\n && this.sourceNodes.containsKey(tmpNodeId)) {\\n transformNode.getParents().add(this.sourceNodes.get(tmpNodeId));\\n } else if (heads.contains(tmpNodeId)\\n && !this.sourceNodes.containsKey(tmpNodeId)\\n && !this.staticTable.contains(tmpNodeId)) {\\n Map<String, Object> sourceNodeConfMap = new HashMap<>();\\n sourceNodeConfMap.put(\\\"id\\\", tmpNodeId);\\n sourceNodeConfMap.put(\\\"name\\\", tmpNodeId);\\n sourceNodeConfMap.put(\\\"schedule_time\\\", this.scheduleTime);\\n SourceNode sourceNode = createHdfsSourceNode(tmpNodeId, sourceNodeConfMap);\\n transformNode.getParents().add(sourceNode);\\n this.sourceNodes.put(tmpNodeId, sourceNode);\\n LOGGER.info(String.format(\\\"Added source node %s\\\", tmpNodeId));\\n } else if (!heads.contains(tmpNodeId)\\n && !this.tmpTransformNodesMap.containsKey(tmpNodeId)\\n && !this.staticTable.contains(tmpNodeId)) {\\n transformNode.getParents().add(this.traverseBuildNodes(tmpNodeId));\\n } else if (!heads.contains(tmpNodeId)\\n && this.tmpTransformNodesMap.containsKey(tmpNodeId)\\n && !this.staticTable.contains(tmpNodeId)) {\\n transformNode.getParents().add(this.tmpTransformNodesMap.get(tmpNodeId));\\n }\\n\\n }\\n }\",\n \"private void connectToParent(RevCommit m) throws Exception\\n\\t{\\n\\t\\tGraphDatabaseService service = DBConnection.getService();\\n\\t\\ttry (Transaction tx = service.beginTx())\\n\\t\\t{\\n\\t\\t\\tResult result = service.execute( \\\"match (n {\\\"+CommitNode._hash+\\\": '\\\"+getCommitId(m)+\\\"'}) return n\\\" );\\n\\t\\t\\tIterator<Node> nodes = result.columnAs( \\\"n\\\" );\\n\\n\\t\\t\\tfor(Node commit_node : IteratorUtil.asIterable(nodes))\\n\\t\\t\\t{\\n\\t\\t\\t\\tList<String> parent_ids = commit_parents_list.get(getCommitId(m));\\n\\t\\t\\t\\tfor(String s : parent_ids)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif(!commit_parents_list.keySet().contains(s))\\n\\t\\t\\t\\t\\t{\\t//unknown parent, the node is not going to exist. If we attempt to create the rel, the transaction will be aborted. Let's ignore this.\\n\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tResult candidate_parents_results = service.execute( \\\"match (n {\\\"+CommitNode._hash+\\\" : '\\\"+s+\\\"'}) return n\\\" );\\n\\t\\t\\t\\t\\tIterator<Node> candidate_parent_nodes = candidate_parents_results.columnAs( \\\"n\\\" );\\n\\n\\t\\t\\t\\t\\tfor(Node p : IteratorUtil.asIterable(candidate_parent_nodes))\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\ttry\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tRelationship new_rel = p.createRelationshipTo(commit_node,CommitNode.Relationships.NEXT);\\n\\t\\t\\t\\t\\t\\t\\tif(new_rel == null)\\n\\t\\t\\t\\t\\t\\t\\t\\tSystem.err.println(\\\"Couldn't connect commit \\\" + getCommitId(m) + \\\" with \\\" +s);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tcatch(Exception e)\\n\\t\\t\\t\\t\\t\\t{\\t//shut up\\n\\t\\t\\t\\t\\t\\t\\tSystem.err.println(\\\"Failted to connect commit node to parent - silently continuing : \\\\nCommits (child) : \\\"+getCommitId(m) + \\\" with (parent) : \\\" +s);\\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\\tresult.close();\\n\\t\\t\\ttx.success();\\n\\t\\t}\\n\\t\\tcatch(Exception e)\\n\\t\\t{\\n\\t\\t\\tSystem.err.println(\\\"failed to create relationship between commits and their parents.\\\" + e.getMessage());\\n\\t\\t}\\n\\t}\",\n \"protected void initializeChild() {\\n\\t}\",\n \"public void clickTravellersChildrenDec() {\\n\\t\\ttravellersChildDec.click();\\n\\t}\",\n \"public void makeComplete() {\\n\\t\\t// A complete graph has N(N-1)/2 edges. Create an ArrayList for those\\n\\t\\t// for performance.\\n\\t\\tint n = nodeArray.size();\\n\\t\\tthis.edges = new ArrayList<Edge>(n * (n - 1) / 2);\\n\\n\\t\\t// Connect every node to the others\\n\\t\\tfor (int i = 0; i < nodeArray.size(); i++) {\\n\\t\\t\\tfor (int k = i + 1; k < nodeArray.size(); k++) {\\n\\n\\t\\t\\t\\tEdge edge = new Edge(nodeArray.get(i), nodeArray.get(k));\\n\\t\\t\\t\\tedges.add(edge);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"private void makeContextsRecursive(ContextTreeNode contextNode) {\\n \\n TaxonomyContext context = contextNode.getContext();\\n Node contextRootNode = context.getRootNode();\\n int i = 0;\\n \\n Transaction tx = beginTx();\\n if (contextRootNode.getProperty(\\\"name\\\").equals(LIFE_NODE_NAME) == false) {\\n \\n System.out.println(\\\"making indices for \\\" + contextRootNode.getProperty(\\\"name\\\"));\\n \\n for (Node n : PREFTAXCHILDOF_TRAVERSAL.traverse(contextRootNode).nodes()) {\\n addToPreferredIndexes(n, context);\\n \\n i++;\\n if (i % 100000 == 0)\\n System.out.println(i);\\n }\\n }\\n tx.success();\\n tx.finish();\\n \\n // now move on to all children\\n for (ContextTreeNode childNode : contextNode.getChildren())\\n makeContextsRecursive(childNode);\\n \\n }\",\n \"private void GreedySearch(){\\n\\n Queue<Node> expanded = new LinkedList<>();\\n ArrayList<Node> fringe = new ArrayList<>();\\n ArrayList<Node> fringeTemp = new ArrayList<>();\\n\\n\\n Node current = startNode;\\n\\n while(expanded.size() < 1000){\\n\\n if(current.getDigit().getDigitString().equals(goalNode.getDigit().getDigitString())){\\n //goal is reached.\\n solutionPath(current);\\n expanded.add(current);\\n printExpanded(expanded);\\n System.exit(0);\\n }\\n\\n\\n boolean b = cycleCheck(current,expanded);\\n\\n if(!b) {\\n expanded.add(current);\\n }\\n\\n if(!b){\\n\\n if(current.getDigit().last_changed != 0){\\n\\n if ((Integer.parseInt(current.getDigit().getFirst_digit()) - 1 >= 0)) {\\n Node child_node = new Node(current.getDigit().decreaseFirstDigit());\\n child_node.setParent(current);\\n child_node.getDigit().setLastChanged(0);\\n\\n if(!forbidden.contains(child_node.getDigit().getDigitString())){\\n fringe.add(child_node);\\n }\\n }\\n\\n //+1 child first digit\\n if ((Integer.parseInt(current.getDigit().getFirst_digit()) + 1 <= 9)) {\\n Node child_node = new Node(current.getDigit().increaseFirstDigit());\\n child_node.setParent(current);\\n child_node.getDigit().setLastChanged(0);\\n if(!forbidden.contains(child_node.getDigit().getDigitString())){\\n fringe.add(child_node);\\n }\\n\\n }\\n }\\n\\n if(current.getDigit().last_changed != 1){\\n\\n if ((Integer.parseInt(current.getDigit().getSecond_digit()) - 1 >= 0)) {\\n Node child_node = new Node(current.getDigit().decreaseSecondDigit());\\n child_node.setParent(current);\\n child_node.getDigit().setLastChanged(1);\\n if(!forbidden.contains(child_node.getDigit().getDigitString())){\\n fringe.add(child_node);\\n }\\n }\\n\\n //+1 child\\n if ((Integer.parseInt(current.getDigit().getSecond_digit()) + 1 <= 9)) {\\n Node child_node = new Node(current.getDigit().increaseSecondDigit());\\n child_node.setParent(current);\\n child_node.getDigit().setLastChanged(1);\\n if(!forbidden.contains(child_node.getDigit().getDigitString())){\\n fringe.add(child_node);\\n }\\n }\\n }\\n\\n if(current.getDigit().last_changed != 2){\\n if ((Integer.parseInt(current.getDigit().getThird_digit()) - 1 >= 0)) {\\n Node child_node = new Node(current.getDigit().decreaseThirdDigit());\\n child_node.setParent(current);\\n child_node.getDigit().setLastChanged(2);\\n if(!forbidden.contains(child_node.getDigit().getDigitString())){\\n fringe.add(child_node);\\n }\\n }\\n //+1 child\\n if ((Integer.parseInt(current.getDigit().getThird_digit()) + 1 <= 9)) {\\n Node child_node = new Node(current.getDigit().increaseThirdDigit());\\n child_node.setParent(current);\\n child_node.getDigit().setLastChanged(2);\\n if(!forbidden.contains(child_node.getDigit().getDigitString())){\\n fringe.add(child_node);\\n }\\n }\\n }\\n\\n }\\n\\n\\n\\n for(Node n : fringe){\\n heuristicSetter(n);\\n\\n }\\n\\n fringeTemp.addAll(fringe);\\n //now all the nodes in fringe have the heuristic value.\\n //We can get the last added minm\\n Node minm;\\n if(fringeTemp.size() != 0){\\n minm = fringeTemp.get(0);\\n }else{\\n break;\\n }\\n for(int i = 1; i<fringeTemp.size(); i++){\\n if(fringeTemp.get(i).getHeuristic() <= minm.getHeuristic()){\\n minm = fringeTemp.get(i);\\n }\\n }\\n\\n //now we have the minm for the next stage.\\n current = minm;\\n fringeTemp.remove(minm);\\n fringe.clear();\\n }\\n\\n //While loop ends\\n System.out.println(\\\"No solution found.\\\");\\n printExpanded(expanded);\\n\\n\\n\\n }\",\n \"public void crossover(){\\n \\t\\n \\t//int cut2 = ((NODELENGTH * 3 + 1) / 3) + cut;\\n \\tfor (int g = 0; g < (wallpapers.size() - 1); g += 2){\\n \\t\\tint cut = getCutPoint();\\n \\t\\tint[] parent1 = wallpapers.get(g);\\n \\t\\tint[] parent2 = wallpapers.get(g + 1);\\n \\t\\t\\n \\t\\tint[] child1 = new int[parent1.length];\\n \\t\\tint[] child2 = new int[parent2.length];\\n \\t\\tfor (int i = 0; i < (cut); i++){\\n \\t\\t\\tchild1[i] = parent1[i];\\n \\t\\t\\tchild2[i] = parent2[i];\\n \\t\\t}\\n \\t\\tfor (int j = cut; j < parent1.length; j++){\\n \\t\\t\\tchild1[j] = parent2[j];\\n \\t\\t\\tchild2[j] = parent1[j];\\n \\t\\t}\\n \\t\\t\\n \\t\\t\\n \\t\\twallpapers.set(g, child1);\\n \\t\\twallpapers.set(g + 1, child2);\\n \\t}\\n \\tfor (int d = 0; d < (wallpapers.size() * 2); d++){\\n \\t\\tif (d < wallpapers.size()){\\n \\t\\t\\ttemp_wallpapers.add(wallpapers.get(d));\\n \\t\\t}\\n \\t\\telse {\\n \\t\\t\\ttemp_wallpapers.add(node());\\n \\t\\t}\\n \\t}\\n \\twallpapers.clear();\\n \\tfor (int u = 0; u < temp_wallpapers.size(); u++){\\n\\t\\t\\twallpapers.add(u, temp_wallpapers.get(u));\\n\\t\\t}\\n \\ttemp_wallpapers.clear();\\n }\",\n \"private void performCreates()\\n {\\n // Create entities. We have to loop possibly many times to create the entities\\n // because we have to set the FKs. It's\\n // possible that the source for a FK is a FK from yet another EI. We don't\\n // want to copy a FK until we know that the source for a FK has been\\n // properly set. We also want to make sure we set the FK's for the EIs that\\n // have been excluded/deleted before we copy FKs for the included/created.\\n int debugCnt = 0; // We'll keep a counter in case we get an infinite loop.\\n\\n // creatingEntities will be true for as long as we think we need to create more entities.\\n boolean creatingEntities = true;\\n while ( creatingEntities )\\n {\\n // We'll hope that we're done creating entities after this iteration. If we\\n // find we need to create more then we'll turn it back on.\\n creatingEntities = false;\\n\\n if ( debugCnt++ > 100 )\\n throw new ZeidonException(\\\"Internal error: too many times creating entities.\\\");\\n\\n for ( ViewImpl view : viewList )\\n {\\n ObjectInstance oi = view.getObjectInstance();\\n\\n for ( final EntityInstanceImpl ei : oi.getEntities() )\\n {\\n if ( ! requiresCreate( ei ) )\\n continue;\\n\\n assert ! ei.getEntityDef().isDerivedPath();\\n\\n if ( ! createInstance( view, ei ) )\\n creatingEntities = true; // We weren't able to create ei. Try again later.\\n }\\n }\\n } // while creatingEntities...\\n }\",\n \"public void updateChildNodes() {\\n\\t\\tList<FTNonLeafNode> nodesToRemove = new ArrayList<FTNonLeafNode>();\\n\\t\\tfor (FTNonLeafNode intermediateNode : intermediateNodes.values()) {\\n\\t\\t\\tList<FTNode> childNodesToRemove = new ArrayList<FTNode>();\\n\\t\\t\\tfor (String childName : intermediateNode.childNodes.keySet()) {\\n\\t\\t\\t\\tif (intermediateNodes.containsKey(childName)) {\\n\\t\\t\\t\\t\\t// update child node if it has child node\\n\\t\\t\\t\\t\\tFTNonLeafNode childNode = intermediateNodes.get(childName);\\n\\t\\t\\t\\t\\tif ((childNode instanceof FTOrNode) || (childNode instanceof FTAndNode)) {\\n\\t\\t\\t\\t\\t\\tintermediateNode.addChildNode(childName, intermediateNodes.get(childName));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\t// if parent node is an OR node\\n\\t\\t\\t\\t\\t\\t// remove this child\\n\\t\\t\\t\\t\\t\\tif (intermediateNode instanceof FTOrNode) {\\n\\t\\t\\t\\t\\t\\t\\tchildNodesToRemove.add(childNode);\\n\\t\\t\\t\\t\\t\\t\\tnodesToRemove.add(childNode);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t// if parent node is an AND node\\n\\t\\t\\t\\t\\t\\t// remove the parent node and child node\\n\\t\\t\\t\\t\\t\\t// and set their values to false in case they are referenced by other nodes\\n\\t\\t\\t\\t\\t\\telse if (intermediateNode instanceof FTAndNode) {\\n\\t\\t\\t\\t\\t\\t\\tnodesToRemove.add(intermediateNode);\\n\\t\\t\\t\\t\\t\\t\\tnodesToRemove.add(childNode);\\n\\t\\t\\t\\t\\t\\t\\t// mark the nodes as they are not getting removed till after the loop\\n\\t\\t\\t\\t\\t\\t\\tintermediateNode.resolved = true;\\n\\t\\t\\t\\t\\t\\t\\tintermediateNode.nodeValue = false;\\n\\t\\t\\t\\t\\t\\t\\tchildNode.resolved = true;\\n\\t\\t\\t\\t\\t\\t\\tchildNode.nodeValue = false;\\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\\tintermediateNode.removeChildNodes(childNodesToRemove);\\n\\t\\t\\t// if no child node left for this intermediate node,\\n\\t\\t\\t// then its parent node should remove this intermediate node as well\\n\\t\\t}\\n\\t\\t// remove the no child nodes\\n\\t\\tfor (FTNonLeafNode node : nodesToRemove) {\\n\\t\\t\\tintermediateNodes.remove(node.nodeName);\\n\\t\\t}\\n\\t}\",\n \"private void recreateWorkerTree(TransactionalClient transaction) throws Exception {\\n String workerPath = paths.worker(workerId);\\n if (curatorFramework.checkExists().forPath(workerPath) != null) {\\n transaction.deletePathWithChildrenIfNeeded(workerPath);\\n }\\n\\n // create availability and assignments directories\\n transaction.createPath(paths.worker(workerId));\\n transaction.createPath(paths.availableJobs(workerId));\\n transaction.createPath(paths.assignedJobs(workerId));\\n\\n // register work pooled jobs\\n for (DistributedJob job : availableJobs) {\\n transaction.createPath(paths.availableJob(workerId, job.getJobId()));\\n }\\n }\",\n \"public void resetVisited() {\\r\\n\\t\\tvisited = false;\\r\\n\\t\\tfor (ASTNode child : getChildren()) {\\r\\n\\t\\t\\tif (!visited)\\r\\n\\t\\t\\t\\tcontinue;\\r\\n\\t\\t\\tchild.resetVisited();\\r\\n\\t\\t}\\r\\n\\t}\",\n \"private boolean cycleCheck(Node current, Queue<Node> expanded){\\n\\n if( expanded.size() == 0){\\n return false; //Because current is root\\n }\\n\\n for(Node nodeInExpanded : expanded){\\n\\n if(current!=null && current.getDigit().getDigitString().equals(nodeInExpanded.getDigit().getDigitString())){\\n //the digits are same so we check children.\\n\\n ArrayList<String> currentChildren = makeChildren(current);\\n ArrayList<String> childrenOfExpanded = makeChildren(nodeInExpanded);\\n\\n int size;\\n\\n if(currentChildren.size() > childrenOfExpanded.size() ){\\n size = childrenOfExpanded.size();\\n }else if(currentChildren.size() < childrenOfExpanded.size()){\\n size = currentChildren.size();\\n }else{\\n size = childrenOfExpanded.size();\\n }\\n /*\\n I use the modulus operator so that I dont get a ArrayIndexOut of Bounds\\n */\\n\\n if( currentChildren.size() == childrenOfExpanded.size()\\n && currentChildren.get(0%size).equals(childrenOfExpanded.get(0%size))\\n && currentChildren.get(1%size).equals(childrenOfExpanded.get(1%size))\\n && currentChildren.get(2%size).equals(childrenOfExpanded.get(2%size))\\n && currentChildren.get(3%size).equals(childrenOfExpanded.get(3%size))\\n ){\\n return true;\\n }\\n }\\n }\\n\\n return false;\\n }\",\n \"private void addEdge() {\\n childMatrix[randomParent][childMatrix[randomParent][0]] = randomChild;\\n childMatrix[randomParent][0]++;\\n parentMatrix[randomChild][parentMatrix[randomChild][0]] = randomParent;\\n parentMatrix[randomChild][0]++;\\n }\",\n \"public void ignoreChildren() {\\r\\n this.isIgnoreChildren = true;\\r\\n }\",\n \"private void connectToAll() {\\n for (AStarNode node : getNodes()) {\\n node.resetConnection();\\n for (AStarNode connect : getNodes()) {\\n if (isValid(node, connect)) {\\n node.connect(connect);\\n }\\n }\\n }\\n }\",\n \"private static Parent[] makeParents() {\\n\\t\\treturn null;\\n\\t}\",\n \"private ParentEntityNode cToCOwnerCheckLeveOneHavingParentOrChildren(String entityId, LosConfigDetails owner, // NOSONAR\\n\\t\\t\\tLosConfigDetails affilated, String commercialSuffix, List<String> iterationChildIds, List<String> entityIds, // NOSONAR\\n\\t\\t\\tList<ParentEntityNode> treeData, List<String> levelTwoChildIds) {// NOSONAR\\n\\t\\tList<ParentEntityNode> levelOneData = getParentDataReverseOrder(entityIds);\\n\\t\\tlevelOneData.stream().forEach(removeExisting -> cToCOwnerIfOwnedIsPresentChangeToOwner(entityId, owner,\\n\\t\\t\\t\\ttreeData, levelTwoChildIds, removeExisting));\\n\\t\\tif (!levelTwoChildIds.isEmpty()) {\\n\\t\\t\\tlevelTwoCToCOwnerGetComEntitySetAsAffiliated(entityId, owner, affilated, commercialSuffix, // NOSONAR\\n\\t\\t\\t\\t\\titerationChildIds, entityIds, treeData, levelTwoChildIds);// NOSONAR\\n\\t\\t}\\n\\t\\treturn entityRelationshipTreeServiceImpl.createTreeFromParent(treeData, entityId);\\n\\t}\",\n \"protected void constructLevelRelations( Callback c, int parent, int child ){\\n String childID = getPartitionID( child );\\n String parentID = getPartitionID( parent );\\n List parents = new ArrayList(1);\\n parents.add( parentID );\\n c.cbParents( childID, parents );\\n\\n }\",\n \"private void initChildList() {\\n if (childList == null) {\\n childList = new ArrayList<>();\\n }\\n }\",\n \"private void reEstablishConnections() {\\n// System.out.println(\\\"Impossible to create overlay, starting over...\\\");\\n for (NodeRecord node : registeredNodes.values()) {\\n node.getNodesToConnectToList().clear();\\n node.resetNumberOfConnections();\\n }\\n createOverlay();\\n }\",\n \"protected void siftDown() {\\r\\n\\t\\tint parent = 0, child = (parent << 1) + 1;// preguntar porque 0 y no 1\\r\\n\\t\\t\\r\\n\\t\\twhile (child < theHeap.size()) {\\r\\n\\t\\t\\tif (child < theHeap.size() - 1\\r\\n\\t\\t\\t\\t\\t&& compare(theHeap.get(child), theHeap.get(child + 1)) > 0)\\r\\n\\t\\t\\t\\tchild++; // child is the right child (child = (2 * parent) + 2)\\r\\n\\t\\t\\tif (compare(theHeap.get(child), theHeap.get(parent)) >= 0)\\r\\n\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\tswap(parent, child);\\r\\n\\t\\t\\tparent = child;\\r\\n\\t\\t\\tchild = (parent << 1) + 1; // => child = (2 * parent) + 1\\r\\n\\t\\t}\\r\\n\\t}\",\n \"protected void makeTheTree(){\\n\\n structure.getRootNode().branchList.add(structure.getNode11());\\n structure.getRootNode().branchList.add(structure.getNode12());\\n structure.getRootNode().branchList.add(structure.getNode13());\\n\\n structure.getNode11().branchList.add(structure.getNode111());\\n structure.getNode11().branchList.add(structure.getNode112());\\n structure.getNode11().branchList.add(structure.getNode113());\\n\\n structure.getNode13().branchList.add(structure.getNode131());\\n\\n structure.getNode112().branchList.add(structure.getNode1121());\\n\\n }\",\n \"ArrayList<Cell> getChildren(Integer[][] level){\\n int[][] values={{0,1},{0,-1},{1,0},{-1,0}};\\n ArrayList<Cell> children = new ArrayList<>();\\n for (int i = 0; i < values.length; i++){\\n if (isLegalMove(this.getI()+values[i][0], this.getJ()+values[i][1],level)){\\n children.add(new Cell(this.getI()+values[i][0], this.getJ()+values[i][1]));\\n }\\n }\\n //the code below achieves the same goal; still here for clarity\\n\\n// if (isLegalMove(this.getI(), this.getJ()+1, level)) {\\n// children.add(new Cell(this.getI(), this.getJ()+1));\\n// }\\n// if (isLegalMove(this.getI(), this.getJ()-1, level)) {\\n// children.add(new Cell(this.getI(), this.getJ()-1));\\n// }\\n// if (isLegalMove(this.getI()+1, this.getJ(), level)) {\\n// children.add(new Cell(this.getI()+1, this.getJ()));\\n// }\\n// if (isLegalMove(this.getI()-1, this.getJ(), level)) {\\n// children.add(new Cell(this.getI()-1, this.getJ()));\\n// }\\n return children;\\n }\",\n \"public void checkConnections() {\\n Boolean updateCanvas = false;\\n\\n // Find new connections set within a node and creates them\\n for (DrawableNode node : nodes) {\\n if (node instanceof LogicNode) {\\n String src = ((LogicNode) node).getLogic().getLogic();\\n\\n for (DrawableNode endNode : getNodes()) {\\n int nodeConnectionType = NodeConnection.NO_CONNECTION;\\n\\n // Here we are checked to see if any connections are linked from this LogicNode\\n if (src.contains(\\\"run(\\\\\\\"\\\" + endNode.getContainedText() + \\\"\\\\\\\"\\\") ||\\n src.contains(\\\"runAndWait(\\\\\\\"\\\" + endNode.getContainedText() + \\\"\\\\\\\"\\\") ||\\n src.contains(\\\"runAndJoin(\\\\\\\"\\\" + endNode.getContainedText() + \\\"\\\\\\\"\\\")) {\\n nodeConnectionType = NodeConnection.DYNAMIC_CONNECTION;\\n } else if (src.contains(\\\"getNode(\\\\\\\"\\\" + endNode.getContainedText() + \\\"\\\\\\\"\\\")) {\\n nodeConnectionType = NodeConnection.GET_NODE_CONNECTION;\\n }\\n\\n // If we find a possible connection and it doesn't already exist, we create that connection with the correct type\\n if (!connectionExists(node, endNode) && nodeConnectionType != -1) {\\n NodeConnection newConnection = new NodeConnection(node, endNode, nodeConnectionType);\\n connections.add(newConnection);\\n updateCanvas = true;\\n }\\n }\\n } else if (node instanceof TestCaseNode) {\\n String src = ((TestCaseNode) node).getLogic().getLogic();\\n\\n for (DrawableNode endNode : getNodes()) {\\n int nodeConnectionType = NodeConnection.NO_CONNECTION;\\n\\n // Here we are checked to see if any connections are linked from this TestCaseNode\\n if (src.contains(\\\"run(\\\\\\\"\\\" + endNode.getContainedText() + \\\"\\\\\\\"\\\") ||\\n src.contains(\\\"runAndWait(\\\\\\\"\\\" + endNode.getContainedText() + \\\"\\\\\\\"\\\") ||\\n src.contains(\\\"runAndJoin(\\\\\\\"\\\" + endNode.getContainedText() + \\\"\\\\\\\"\\\")) {\\n nodeConnectionType = NodeConnection.DYNAMIC_CONNECTION;\\n } else if (src.contains(\\\"getNode(\\\\\\\"\\\" + endNode.getContainedText() + \\\"\\\\\\\"\\\")) {\\n nodeConnectionType = NodeConnection.GET_NODE_CONNECTION;\\n }\\n\\n // If we find a possible connection and it doesn't already exist, we create that connection with the correct type\\n if (!connectionExists(node, endNode) && nodeConnectionType != -1) {\\n NodeConnection newConnection = new NodeConnection(node, endNode, nodeConnectionType);\\n connections.add(newConnection);\\n updateCanvas = true;\\n }\\n }\\n } else if (node instanceof SwitchNode) {\\n List<Switch> aSwitches = ((SwitchNode) node).getSwitches();\\n\\n for (DrawableNode endNode : getNodes()) {\\n Boolean createConnection = false;\\n Boolean enabledConnection = false;\\n\\n for (Switch aSwitch : aSwitches) {\\n if ((aSwitch.getTarget().equals(endNode.getContainedText()))) {\\n enabledConnection = aSwitch.isEnabled();\\n createConnection = true;\\n }\\n }\\n\\n if (createConnection && !connectionExists(node, endNode)) {\\n Integer connectionType = NodeConnection.DYNAMIC_CONNECTION;\\n if (!enabledConnection) {\\n connectionType = NodeConnection.DISABLED_CONNECTION;\\n }\\n\\n NodeConnection newConnection = new NodeConnection(node, endNode, connectionType);\\n connections.add(newConnection);\\n updateCanvas = true;\\n }\\n }\\n } else if (node instanceof TriggerNode) {\\n List<Trigger> triggers = ((TriggerNode) node).getTriggers();\\n\\n for (Trigger trigger : triggers) {\\n String watchName = trigger.getWatch();\\n\\n for (DrawableNode endNode : getNodes()) {\\n Boolean createConnection = false;\\n\\n if (watchName.equals(endNode.getContainedText())) {\\n createConnection = true;\\n }\\n\\n // This connection has the start and end the other way around, the target is specified in the trigger but\\n // we want it to look like the watched node is connecting to the trigger as that is the order that they are run\\n if (createConnection && !connectionExists(endNode, node)) {\\n NodeConnection newConnection = new NodeConnection(endNode, node, NodeConnection.TRIGGER_CONNECTION);\\n connections.add(newConnection);\\n updateCanvas = true;\\n }\\n }\\n }\\n }\\n\\n // Find connection that are set using the Next node input box\\n if (node != null && !node.getNextNodeToRun().isEmpty()) {\\n for (DrawableNode endNode : getNodes()) {\\n if (node.getNextNodeToRun().equals(endNode.getContainedText())) {\\n if (!connectionExists(node, endNode)) {\\n NodeConnection newConnection = new NodeConnection(node, endNode, NodeConnection.MAIN_CONNECTION);\\n connections.add(newConnection);\\n updateCanvas = true;\\n }\\n }\\n }\\n }\\n }\\n\\n // Checks old connections and removes ones that don't exist\\n List<NodeConnection> listToRemove = new ArrayList<>();\\n List<NodeConnection> connectionsLoopTemp = new ArrayList<>(); // We make a copy the list here so that we can the original while iterating over this one\\n connectionsLoopTemp.addAll(connections);\\n for (NodeConnection nodeConnection : connectionsLoopTemp) {\\n if (nodeConnection.getConnectionType().equals(NodeConnection.DYNAMIC_CONNECTION)) {\\n if (nodeConnection.getConnectionStart() instanceof LogicNode) {\\n if (!((LogicNode) nodeConnection.getConnectionStart()).getLogic().getLogic().contains(\\\"run(\\\\\\\"\\\" + nodeConnection.getConnectionEnd().getContainedText() + \\\"\\\\\\\"\\\")) {\\n if (!((LogicNode) nodeConnection.getConnectionStart()).getLogic().getLogic().contains(\\\"runAndWait(\\\\\\\"\\\" + nodeConnection.getConnectionEnd().getContainedText() + \\\"\\\\\\\"\\\")) {\\n if (!((LogicNode) nodeConnection.getConnectionStart()).getLogic().getLogic().contains(\\\"runAndJoin(\\\\\\\"\\\" + nodeConnection.getConnectionEnd().getContainedText() + \\\"\\\\\\\"\\\")) {\\n if (!((LogicNode) nodeConnection.getConnectionStart()).getLogic().getLogic().contains(\\\"getNode(\\\\\\\"\\\" + nodeConnection.getConnectionEnd().getContainedText() + \\\"\\\\\\\"\\\")) {\\n listToRemove.add(nodeConnection);\\n updateCanvas = true;\\n }\\n }\\n }\\n }\\n } else if (nodeConnection.getConnectionStart() instanceof TestCaseNode) {\\n if (!((TestCaseNode) nodeConnection.getConnectionStart()).getLogic().getLogic().contains(\\\"run(\\\\\\\"\\\" + nodeConnection.getConnectionEnd().getContainedText() + \\\"\\\\\\\"\\\")) {\\n if (!((TestCaseNode) nodeConnection.getConnectionStart()).getLogic().getLogic().contains(\\\"runAndWait(\\\\\\\"\\\" + nodeConnection.getConnectionEnd().getContainedText() + \\\"\\\\\\\"\\\")) {\\n if (!((TestCaseNode) nodeConnection.getConnectionStart()).getLogic().getLogic().contains(\\\"runAndJoin(\\\\\\\"\\\" + nodeConnection.getConnectionEnd().getContainedText() + \\\"\\\\\\\"\\\")) {\\n if (!((TestCaseNode) nodeConnection.getConnectionStart()).getLogic().getLogic().contains(\\\"getNode(\\\\\\\"\\\" + nodeConnection.getConnectionEnd().getContainedText() + \\\"\\\\\\\"\\\")) {\\n listToRemove.add(nodeConnection);\\n updateCanvas = true;\\n }\\n }\\n }\\n }\\n } else if (nodeConnection.getConnectionStart() instanceof SwitchNode) {\\n List<Switch> aSwitches = ((SwitchNode) nodeConnection.getConnectionStart()).getSwitches();\\n String endContainedText = nodeConnection.getConnectionEnd().getContainedText();\\n Integer removeCount = 0;\\n for (Switch aSwitch : aSwitches) {\\n if ((!aSwitch.getTarget().equals(endContainedText) || !aSwitch.isEnabled())) {\\n removeCount++;\\n }\\n }\\n\\n if (removeCount.equals(aSwitches.size())) {\\n // Create a disabled connection between these two nodes to give appearance of toggling\\n NodeConnection newConnection = new NodeConnection(nodeConnection.getConnectionStart(), nodeConnection.getConnectionEnd(), NodeConnection.DISABLED_CONNECTION);\\n connections.add(newConnection);\\n\\n listToRemove.add(nodeConnection);\\n updateCanvas = true;\\n }\\n }\\n } else if (nodeConnection.getConnectionType().equals(NodeConnection.TRIGGER_CONNECTION)) {\\n if (nodeConnection.getConnectionEnd() instanceof TriggerNode) { // Here the start and end connections are reversed\\n List<Trigger> triggers = ((TriggerNode) nodeConnection.getConnectionEnd()).getTriggers();\\n String endContainedText = nodeConnection.getConnectionStart().getContainedText();\\n Integer removeCount = 0;\\n for (Trigger trigger : triggers) {\\n if ((!trigger.getWatch().equals(endContainedText))) {\\n removeCount++;\\n }\\n }\\n\\n if (removeCount.equals(triggers.size())) {\\n listToRemove.add(nodeConnection);\\n updateCanvas = true;\\n }\\n }\\n } else if (nodeConnection.getConnectionType().equals(NodeConnection.GET_NODE_CONNECTION)) {\\n if (nodeConnection.getConnectionStart() instanceof LogicNode) {\\n if (!((LogicNode) nodeConnection.getConnectionStart()).getLogic().getLogic().contains(\\\"getNode(\\\\\\\"\\\" + nodeConnection.getConnectionEnd().getContainedText() + \\\"\\\\\\\"\\\")) {\\n listToRemove.add(nodeConnection);\\n updateCanvas = true;\\n }\\n } else if (nodeConnection.getConnectionStart() instanceof TestCaseNode) {\\n if (!((TestCaseNode) nodeConnection.getConnectionStart()).getLogic().getLogic().contains(\\\"getNode(\\\\\\\"\\\" + nodeConnection.getConnectionEnd().getContainedText() + \\\"\\\\\\\"\\\")) {\\n listToRemove.add(nodeConnection);\\n updateCanvas = true;\\n }\\n }\\n } else if (nodeConnection.getConnectionType().equals(NodeConnection.DISABLED_CONNECTION)) {\\n if (nodeConnection.getConnectionStart() instanceof SwitchNode) {\\n List<Switch> aSwitches = ((SwitchNode) nodeConnection.getConnectionStart()).getSwitches();\\n String endContainedText = nodeConnection.getConnectionEnd().getContainedText();\\n Integer removeCount = 0;\\n for (Switch aSwitch : aSwitches) {\\n if ((!aSwitch.getTarget().equals(endContainedText) || aSwitch.isEnabled())) {\\n removeCount++;\\n }\\n }\\n\\n if (removeCount.equals(aSwitches.size())) {\\n // Create an enabled connection between these two nodes to give appearance of toggling\\n NodeConnection newConnection = new NodeConnection(nodeConnection.getConnectionStart(), nodeConnection.getConnectionEnd(), NodeConnection.DYNAMIC_CONNECTION);\\n connections.add(newConnection);\\n\\n listToRemove.add(nodeConnection);\\n updateCanvas = true;\\n }\\n }\\n }\\n\\n if (nodeConnection.getConnectionType().equals(NodeConnection.MAIN_CONNECTION)) {\\n if (!nodeConnection.getConnectionStart().getNextNodeToRun().equals(nodeConnection.getConnectionEnd().getContainedText())) {\\n listToRemove.add(nodeConnection);\\n updateCanvas = true;\\n }\\n }\\n }\\n\\n connections.removeAll(listToRemove);\\n if (updateCanvas) {\\n Controller.getInstance().updateCanvasControllerLater();\\n }\\n }\",\n \"public void removeChildren() {\\r\\n this.children.clear();\\r\\n childNum = 0;\\r\\n }\",\n \"public void RecursiveExpansion() throws TreeTooBigException {\\r\\n int transIndex; //Index to count transitions\\r\\n int[] newMarkup; //markup used to create new node\\r\\n boolean aTransitionIsEnabled = false; //To check for deadlock\\r\\n //Attribute used for assessing whether a node has occured before\\r\\n boolean repeatedNode = false; \\r\\n \\r\\n boolean allOmegas = false;\\r\\n \\r\\n boolean[] enabledTransitions = \\r\\n tree.dataLayer.getTransitionEnabledStatusArray(markup);\\r\\n\\r\\n //For each transition\\r\\n for (int i = 0; i < enabledTransitions.length; i++) {\\r\\n if (enabledTransitions[i] == true) {\\r\\n //Set transArray of to true for this index\\r\\n transArray[i] = true;\\r\\n \\r\\n //System.out.println(\\\"\\\\n Transition \\\" + i + \\\" Enabled\\\" );\\r\\n aTransitionIsEnabled = true;\\r\\n \\r\\n //print (\\\"\\\\n Old Markup is :\\\", markup);//debug\\r\\n \\r\\n //Fire transition to produce new markup vector\\r\\n newMarkup = fire(i);\\r\\n \\r\\n //print (\\\"\\\\n New Markup is :\\\", newMarkup);//debug\\r\\n \\r\\n //Check for safeness. If any of places have > 1 token set variable.\\r\\n for (int j = 0; j < newMarkup.length; j++) {\\r\\n if (newMarkup[j] > 1 || newMarkup[j] == -1) {\\r\\n tree.moreThanOneToken = true;\\r\\n break;\\r\\n }\\r\\n } \\r\\n \\r\\n //Create a new node using the new markup vector and attach it to\\r\\n //the current node as a child.\\r\\n children[i] = \\r\\n new myNode(newMarkup, this, tree, depth + 1);\\r\\n \\r\\n /* Now need to (a) check if any omegas (represented by -1) need to \\r\\n * be inserted in the markup vector of the new node, and (b) if the \\r\\n * resulting markup vector has appeared anywhere else in the tree. \\r\\n * We must do (a) before (b) as we need to know if the new node \\r\\n * contains any omegas to be able to compare it with existing nodes. \\r\\n */ \\r\\n allOmegas = children[i].InsertOmegas();\\r\\n \\r\\n //check if the resulting markup vector has occured anywhere else in the tree\\r\\n repeatedNode = (tree.root).FindMarkup(children[i]);\\r\\n \\r\\n if (tree.nodeCount >= Pipe.MAX_NODES && !tree.tooBig) {\\r\\n tree.tooBig = true;\\r\\n throw new TreeTooBigException();\\r\\n }\\r\\n \\r\\n if (!repeatedNode && !allOmegas) {\\r\\n children[i].RecursiveExpansion();\\r\\n }\\r\\n }\\r\\n }\\r\\n \\r\\n if (!aTransitionIsEnabled) {\\r\\n System.err.println(\\\"No transition enabled\\\");\\r\\n if (!tree.noEnabledTransitions || tree.pathToDeadlock.length < depth-1) {\\r\\n RecordDeadlockPath();\\r\\n tree.noEnabledTransitions = true;\\r\\n } else {\\r\\n System.err.println(\\\"Deadlocked node found, but path is not shorter\\\"\\r\\n + \\\" than current path.\\\");\\r\\n }\\r\\n } else {\\r\\n //System.out.println(\\\"Transitions enabled.\\\");\\r\\n }\\r\\n }\",\n \"public void makeCircular() {\\n\\t\\t// write your code for makeCircular using the specification above\\n\\t\\tNode noderef = head; \\n\\t\\tif (this.size()==1){\\n\\t\\t\\tnoderef.next = head;\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tif(this.size()==0){\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\t\\n\\t\\tfor(int counter=0; counter < this.size()-1; counter++){\\n\\t\\t\\tnoderef = noderef.next;\\n\\t\\t}\\n\\t\\tnoderef.next = head; \\n\\t}\",\n \"public static void Execute ()\\n\\t{\\n\\t\\tReceiveCollection (SpawnCrawler (target));\\n\\t\\t\\n\\t\\tList<String> initialCollection = overCollection;\\n\\t\\t\\n\\t\\tif ( ! initialCollection.isEmpty ())\\n\\t\\t{\\n\\t\\t\\n\\t\\t\\tfor (String collected : initialCollection)\\n\\t\\t\\t{\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif (collected.contains (\\\"http\\\"))\\n\\t\\t\\t\\t\\tReceiveCollection (SpawnCrawler (collected));\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\tReceiveCollection (SpawnCrawler (target + collected));\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t\\t/*\\n\\t\\t * Several loops should commence here where the system reiteratively goes over all the newly acquired URLs\\n\\t\\t * so it may extend itself beyond the first and second depth.\\n\\t\\t * However this process should be halted once it reaches a certain configurable depth.\\n\\t\\t */\\n\\t\\tint depth = 0;\\n\\t\\tint newFoundings = 0;\\n\\t\\t\\n\\t\\tdepthLoop: while (depth <= MAX_DEPTH)\\n\\t\\t{\\n\\t\\t\\t\\n\\t\\t\\tfor (String collected : overCollection)\\n\\t\\t\\t{\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif (collected.contains (\\\"http\\\"))\\n\\t\\t\\t\\t\\tSpawnCrawler (collected);\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\tSpawnCrawler (target + collected);\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tif (newFoundings <= 0)\\n\\t\\t\\t\\tbreak depthLoop;\\n\\t\\t\\t\\n\\t\\t\\tdepth++;\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t}\",\n \"public abstract Graph getChildren(String parentHash);\",\n \"protected void startChildStateReflector() {\\n\\t\\tif (!destroy) {\\n\\t\\t\\tlogger().debug(\\\"Starting Child State Reflector.\\\");\\n\\t\\t\\tchildStateReflector.start();\\n\\t\\t}\\n\\t}\",\n \"private static void finalizeAllNestedChildren(SapODataColumnMetadata children) {\\n if (children.containsChild()) {\\n children.getChildList().forEach(SapODataColumnMetadata::finalizeAllNestedChildren);\\n }\\n\\n children.isChildListComplete = true;\\n }\",\n \"public void testGetCachedChild() {\\n FileObject fobj = getFileObject(testFile);\\n FileObject parent = fobj.getParent();\\n monitor.reset();\\n FileObject[] childs = parent.getChildren();\\n monitor.getResults().assertResult(1, StatFiles.ALL);\\n monitor.getResults().assertResult(1, StatFiles.READ);\\n //second time\\n monitor.reset();\\n childs = parent.getChildren();\\n monitor.getResults().assertResult(0, StatFiles.ALL);\\n }\",\n \"public void determinePartitions( Callback c ){\\n mCurrentDepth = 0;\\n GraphNode node;\\n GraphNode child;\\n int depth = 0;\\n List levelList = new java.util.LinkedList();\\n int i = 0;\\n //they contain those nodes whose parents have not been traversed as yet\\n //but the BFS did it.\\n List orphans = new java.util.LinkedList();\\n\\n\\n //set the depth of the dummy root as 0\\n mRoot.setDepth( mCurrentDepth );\\n\\n mQueue.addLast( mRoot );\\n\\n while( !mQueue.isEmpty() ){\\n node = (GraphNode)mQueue.getFirst();\\n depth = node.getDepth();\\n if( mCurrentDepth < depth ){\\n\\n if( mCurrentDepth > 0 ){\\n //we are done with one level!\\n constructPartitions( c, levelList, mCurrentDepth );\\n }\\n\\n\\n //a new level starts\\n mCurrentDepth++;\\n levelList.clear();\\n }\\n mLogger.log( \\\"Adding to level \\\" + mCurrentDepth + \\\" \\\" + node.getID(),\\n LogManager.DEBUG_MESSAGE_LEVEL);\\n levelList.add( node );\\n\\n //look at the orphans first to see if any\\n //of the dependency has changed or not.\\n /*it = orphans.iterator();\\n while(it.hasNext()){\\n child = (GraphNode)it.next();\\n if(child.parentsBlack()){\\n child.setDepth(depth + 1);\\n System.out.println(\\\"Set depth of \\\" + child.getID() + \\\" to \\\" + child.getDepth());\\n\\n child.traversed();\\n mQueue.addLast(child);\\n }\\n\\n //remove the child from the orphan\\n it.remove();\\n }*/\\n\\n\\n node.setColor( GraphNode.BLACK_COLOR );\\n for( Iterator it = node.getChildren().iterator(); it.hasNext(); ){\\n child = (GraphNode)it.next();\\n if(!child.isColor( GraphNode.GRAY_COLOR ) &&\\n child.parentsColored( GraphNode.BLACK_COLOR )){\\n mLogger.log( \\\"Adding to queue \\\" + child.getID(),\\n LogManager.DEBUG_MESSAGE_LEVEL );\\n child.setDepth( depth + 1 );\\n child.setColor( GraphNode.GRAY_COLOR );\\n mQueue.addLast( child );\\n }\\n /*else if(!child.isTraversed() && !child.parentsBlack()){\\n //we have to do the bumping effect\\n System.out.println(\\\"Bumping child \\\" + child);\\n orphans.add(child);\\n }*/\\n }\\n node = (GraphNode)mQueue.removeFirst();\\n mLogger.log( \\\"Removed \\\" + node.getID(),\\n LogManager.DEBUG_MESSAGE_LEVEL);\\n }\\n\\n //handle the last level of the BFS\\n constructPartitions( c, levelList, mCurrentDepth );\\n\\n\\n //all the partitions are dependant sequentially\\n for( i = mCurrentDepth; i > 1; i-- ){\\n constructLevelRelations( c, i - 1, i );\\n\\n }\\n\\n done( c );\\n }\",\n \"protected void populateChildren() throws MessagingException\\n {\\n connect();\\n \\n Folder[] sub = store.getDefaultFolder().list();\\n addChildren(sub, 0);\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6246335","0.6222769","0.6081489","0.56986165","0.5600083","0.5569997","0.55359197","0.55359197","0.55359197","0.5526154","0.55173075","0.55170625","0.55154157","0.5506944","0.55060697","0.5481505","0.5470102","0.543657","0.54289436","0.53934395","0.53933096","0.5366557","0.5366008","0.53643256","0.53536147","0.5346488","0.5328569","0.5309447","0.53080904","0.5304909","0.53013253","0.52967966","0.52753943","0.52657396","0.5260304","0.5259068","0.5243762","0.5242207","0.52374077","0.5222034","0.52163166","0.52129674","0.5197791","0.5188824","0.51777154","0.51700985","0.51670736","0.5146432","0.5146313","0.51380324","0.5137737","0.51323605","0.51252514","0.510822","0.50934494","0.50908244","0.50832343","0.5076913","0.5066503","0.503239","0.5026901","0.50194544","0.501518","0.5002765","0.5000687","0.49993864","0.49956444","0.49927035","0.499181","0.49880955","0.4987924","0.49877083","0.4984614","0.49758604","0.4972971","0.49716043","0.497156","0.49680758","0.4967079","0.49670643","0.49641535","0.4963071","0.4959312","0.49503493","0.4943218","0.49389863","0.49327952","0.49299666","0.4922729","0.49199775","0.49197388","0.49195832","0.49061808","0.49024254","0.48972064","0.48934314","0.4888498","0.4884109","0.4884084","0.48834738"],"string":"[\n \"0.6246335\",\n \"0.6222769\",\n \"0.6081489\",\n \"0.56986165\",\n \"0.5600083\",\n \"0.5569997\",\n \"0.55359197\",\n \"0.55359197\",\n \"0.55359197\",\n \"0.5526154\",\n \"0.55173075\",\n \"0.55170625\",\n \"0.55154157\",\n \"0.5506944\",\n \"0.55060697\",\n \"0.5481505\",\n \"0.5470102\",\n \"0.543657\",\n \"0.54289436\",\n \"0.53934395\",\n \"0.53933096\",\n \"0.5366557\",\n \"0.5366008\",\n \"0.53643256\",\n \"0.53536147\",\n \"0.5346488\",\n \"0.5328569\",\n \"0.5309447\",\n \"0.53080904\",\n \"0.5304909\",\n \"0.53013253\",\n \"0.52967966\",\n \"0.52753943\",\n \"0.52657396\",\n \"0.5260304\",\n \"0.5259068\",\n \"0.5243762\",\n \"0.5242207\",\n \"0.52374077\",\n \"0.5222034\",\n \"0.52163166\",\n \"0.52129674\",\n \"0.5197791\",\n \"0.5188824\",\n \"0.51777154\",\n \"0.51700985\",\n \"0.51670736\",\n \"0.5146432\",\n \"0.5146313\",\n \"0.51380324\",\n \"0.5137737\",\n \"0.51323605\",\n \"0.51252514\",\n \"0.510822\",\n \"0.50934494\",\n \"0.50908244\",\n \"0.50832343\",\n \"0.5076913\",\n \"0.5066503\",\n \"0.503239\",\n \"0.5026901\",\n \"0.50194544\",\n \"0.501518\",\n \"0.5002765\",\n \"0.5000687\",\n \"0.49993864\",\n \"0.49956444\",\n \"0.49927035\",\n \"0.499181\",\n \"0.49880955\",\n \"0.4987924\",\n \"0.49877083\",\n \"0.4984614\",\n \"0.49758604\",\n \"0.4972971\",\n \"0.49716043\",\n \"0.497156\",\n \"0.49680758\",\n \"0.4967079\",\n \"0.49670643\",\n \"0.49641535\",\n \"0.4963071\",\n \"0.4959312\",\n \"0.49503493\",\n \"0.4943218\",\n \"0.49389863\",\n \"0.49327952\",\n \"0.49299666\",\n \"0.4922729\",\n \"0.49199775\",\n \"0.49197388\",\n \"0.49195832\",\n \"0.49061808\",\n \"0.49024254\",\n \"0.48972064\",\n \"0.48934314\",\n \"0.4888498\",\n \"0.4884109\",\n \"0.4884084\",\n \"0.48834738\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.5201133"},"document_rank":{"kind":"string","value":"42"}}},{"rowIdx":27392,"cells":{"query":{"kind":"string","value":"/ Here I check for cycles."},"document":{"kind":"string","value":"private boolean cycleCheck(Node current, Queue<Node> expanded){\n\n if( expanded.size() == 0){\n return false; //Because current is root\n }\n\n for(Node nodeInExpanded : expanded){\n\n if(current!=null && current.getDigit().getDigitString().equals(nodeInExpanded.getDigit().getDigitString())){\n //the digits are same so we check children.\n\n ArrayList<String> currentChildren = makeChildren(current);\n ArrayList<String> childrenOfExpanded = makeChildren(nodeInExpanded);\n\n int size;\n\n if(currentChildren.size() > childrenOfExpanded.size() ){\n size = childrenOfExpanded.size();\n }else if(currentChildren.size() < childrenOfExpanded.size()){\n size = currentChildren.size();\n }else{\n size = childrenOfExpanded.size();\n }\n /*\n I use the modulus operator so that I dont get a ArrayIndexOut of Bounds\n */\n\n if( currentChildren.size() == childrenOfExpanded.size()\n && currentChildren.get(0%size).equals(childrenOfExpanded.get(0%size))\n && currentChildren.get(1%size).equals(childrenOfExpanded.get(1%size))\n && currentChildren.get(2%size).equals(childrenOfExpanded.get(2%size))\n && currentChildren.get(3%size).equals(childrenOfExpanded.get(3%size))\n ){\n return true;\n }\n }\n }\n\n return false;\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["private Boolean checkCycle() {\n Node slow = this;\n Node fast = this;\n while (fast.nextNode != null && fast.nextNode.nextNode != null) {\n fast = fast.nextNode.nextNode;\n slow = slow.nextNode;\n if (fast == slow) {\n System.out.println(\"contains cycle\");\n return true;\n }\n }\n System.out.println(\"non-cycle\");\n return false;\n }","public static void checkCycleSample() {\n Node ll1_5 = new Node(1, new Node(2, new Node(3, new Node(4, new Node(5, null)))));\n\n Node ll1_2 = new Node(1, new Node(2, null));\n Node ll3_4 = new Node(3, new Node(4, null));\n Node ll5_6 = new Node(5, new Node(6, null));\n ll1_2.nextNode.nextNode = ll3_4;\n ll3_4.nextNode.nextNode = ll5_6;\n ll5_6.nextNode.nextNode = ll1_2;\n\n ll1_2.checkCycle();\n ll1_5.checkCycle();\n }","@SuppressWarnings(\"unchecked\")\r\n private static void cycleTests() throws CALExecutorException {\r\n \r\n final ImmutableDirectedGraph<Integer> noCycles = ImmutableDirectedGraph\r\n .makeGraph(\r\n Collections.<Integer>emptyList(),\r\n Arrays.asList(Pair.make(1, 2), Pair.make(2, 3), Pair.make(1, 3)),\r\n executionContext);\r\n \r\n final ImmutableDirectedGraph<Integer> lengthOneCycle = ImmutableDirectedGraph\r\n .makeGraph(\r\n Collections.<Integer>emptyList(),\r\n Arrays.asList(Pair.make(1, 1)),\r\n executionContext);\r\n \r\n final ImmutableDirectedGraph<Integer> lengthTwoCycle = ImmutableDirectedGraph\r\n .makeGraph(\r\n Collections.<Integer>emptyList(),\r\n Arrays.asList(Pair.make(1, 2), Pair.make(2, 1)),\r\n executionContext);\r\n \r\n System.out.println(\"noCycle.findCycle(): \" + noCycles.findCycle());\r\n System.out.println(\"oneCycle.findCycle(): \" + lengthOneCycle.findCycle());\r\n System.out.println(\"twoCycle.findCycle(): \" + lengthTwoCycle.findCycle());\r\n }","private boolean checkCycle() {\n for (int i = 0; i < 26; i++) {\n color[i] = 0;\n }\n for (int i = 0; i < 26; i++) {\n if (color[i] != -1 && BFS(i)) return true;\n }\n return false;\n }","public boolean detectCycles()\n {\n try {\n execute(null, null);\n } catch (CycleDetectedException ex) {\n return true;\n }\n\n return false;\n }","private static boolean isCycle(Graph graph) {\n for (int i = 0; i < graph.edges.length; ++i) {\n int x = graph.find(graph.edges[i][0]);\n int y = graph.find(graph.edges[i][1]);\n\n // if both subsets are same, then there is cycle in graph.\n if (x == y) {\n // for edge 2-0 : parent of 0 is 2 == 2 and so we detected a cycle\n return true;\n }\n // keep doing union/merge of sets\n graph.union(x, y);\n }\n return false;\n }","int isCycle( Graph graph){\n int parent[] = new int[graph.V]; \n \n // Initialize all subsets as single element sets \n for (int i=0; i<graph.V; ++i) \n parent[i]=-1; \n \n // Iterate through all edges of graph, find subset of both vertices of every edge, if both subsets are same, then there is cycle in graph. \n for (int i = 0; i < graph.E; ++i){ \n int x = graph.find(parent, graph.edge[i].src); \n int y = graph.find(parent, graph.edge[i].dest); \n \n if (x == y) \n return 1; \n \n graph.Union(parent, x, y); \n } \n return 0; \n }","private boolean hasCycle()\r\n {\r\n boolean passed = false;\r\n for(Field.RadioData dst=radioList; dst!=null; dst=dst.next)\r\n {\r\n if(dst==radioList && passed) return true;\r\n passed = true;\r\n }\r\n return false;\r\n }","private boolean hasCycle1() {\n\t\tNode slow = head;\n\t\tNode fast = head;\n\t\t\n\t\twhile (fast != null && fast.next != null) {\n\t\t\tslow = slow.next;\n\t\t\tfast = fast.next.next;\n\t\t\tif(slow == fast) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}","private boolean hasCycle() {\n\t\tNode n = head;\n\t\tSet<Node> nodeSeen = new HashSet<>();\n\t\twhile (nodeSeen != null) {\n\t\t\tif (nodeSeen.contains(n)) {\n\t\t\t\treturn true;\n\t\t\t} else {\n\t\t\t\tnodeSeen.add(n);\n\t\t\t}\n\t\t\tn = n.next;\n\t\t}\n\t\treturn false;\n\t}","boolean cycle() {\n int j;\t\t\t\t\t\t// If cycle detected report as negative edge weight cycle.\n for (j = 0; j < e; ++j)\n if (d[edges.get(j).u] + edges.get(j).w < d[edges.get(j).v])\n return false;\n return true;\n }","boolean detectCycleUndirected(ArrayList<Integer> G[]) {\n\t\tint[] vis = new int[G.length];\n\t\tfor (int i = 0; i < G.length; i++) {\n\t\t\tif (vis[i] == 0) {\n\t\t\t\tif (detectCycleUtil(G, i, vis, -1))\n\t\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}","boolean hasCycle() {\n if (head == null){\n return false;\n }\n Node slow = head;\n Node fast = head;\n while (slow != null && fast != null && fast.next != null){\n slow = slow.next;\n fast = fast.next.next;\n if (slow == fast){\n return true;\n }\n }\n return false;\n }","private void treatCycles(SDFGraph graph) throws InvalidExpressionException {\r\n\t\tList<Set<SDFAbstractVertex>> cycles = new ArrayList<Set<SDFAbstractVertex>>();\r\n\t\tCycleDetector<SDFAbstractVertex, SDFEdge> detector = new CycleDetector<SDFAbstractVertex, SDFEdge>(\r\n\t\t\t\tgraph);\r\n\t\tList<SDFAbstractVertex> vertices = new ArrayList<SDFAbstractVertex>(\r\n\t\t\t\tgraph.vertexSet());\r\n\t\twhile (vertices.size() > 0) {\r\n\t\t\tSDFAbstractVertex vertex = vertices.get(0);\r\n\t\t\tSet<SDFAbstractVertex> cycle = detector\r\n\t\t\t\t\t.findCyclesContainingVertex(vertex);\r\n\t\t\tif (cycle.size() > 0) {\r\n\t\t\t\tvertices.removeAll(cycle);\r\n\t\t\t\tcycles.add(cycle);\r\n\t\t\t}\r\n\t\t\tvertices.remove(vertex);\r\n\t\t}\r\n\r\n\t\tfor (Set<SDFAbstractVertex> cycle : cycles) {\r\n\t\t\tint gcd = gcdOfVerticesVrb(cycle);\r\n\t\t\tif (gcd > 1 && !(graph instanceof PSDFGraph)) {\r\n\t\t\t\tcopyCycle(graph, cycle, gcd);\r\n\t\t\t} else if (!(graph instanceof PSDFGraph)) {\r\n\t\t\t\ttreatPSDFCycles(graph, cycle);\r\n\t\t\t}\r\n\t\t}\r\n\t\t// SDFIterator sdfIterator = new SDFIterator(graph);\r\n\t\t// List<SDFAbstractVertex> orderedList = new\r\n\t\t// ArrayList<SDFAbstractVertex>();\r\n\t\t// while (sdfIterator.hasNext()) {\r\n\t\t// SDFAbstractVertex current = sdfIterator.next();\r\n\t\t// orderedList.add(current);\r\n\t\t// if (current instanceof SDFRoundBufferVertex) {\r\n\t\t// int nbTokens = 0;\r\n\t\t// for (SDFEdge edgeData : graph.outgoingEdgesOf(current)) {\r\n\t\t// nbTokens = edgeData.getProd().intValue();\r\n\t\t// }\r\n\t\t// for (int i = orderedList.size() - 1; i >= 0; i--) {\r\n\t\t// if (graph.getAllEdges(orderedList.get(i), current).size() == 1) {\r\n\t\t// if (nbTokens <= 0) {\r\n\t\t// graph.removeAllEdges(orderedList.get(i), current);\r\n\t\t// } else {\r\n\t\t// for (SDFEdge thisEdge : graph.getAllEdges(\r\n\t\t// orderedList.get(i), current)) {\r\n\t\t// nbTokens = nbTokens\r\n\t\t// - thisEdge.getProd().intValue();\r\n\t\t// }\r\n\t\t// }\r\n\t\t// }\r\n\t\t// }\r\n\t\t// // traiter le roundBuffer pour le supprimer\r\n\t\t// if (graph.incomingEdgesOf(current).size() == 1\r\n\t\t// && graph.outgoingEdgesOf(current).size() == 1) {\r\n\t\t// SDFAbstractVertex source = ((SDFEdge) graph\r\n\t\t// .incomingEdgesOf(current).toArray()[0]).getSource();\r\n\t\t// SDFEdge oldEdge = ((SDFEdge) graph.incomingEdgesOf(current)\r\n\t\t// .toArray()[0]);\r\n\t\t// SDFAbstractVertex target = ((SDFEdge) graph\r\n\t\t// .outgoingEdgesOf(current).toArray()[0]).getTarget();\r\n\t\t// SDFEdge refEdge = ((SDFEdge) graph.outgoingEdgesOf(current)\r\n\t\t// .toArray()[0]);\r\n\t\t// SDFEdge newEdge = graph.addEdge(source, target);\r\n\t\t// newEdge.copyProperties(refEdge);\r\n\t\t// graph.removeEdge(refEdge);\r\n\t\t// graph.removeEdge(oldEdge);\r\n\t\t// graph.removeVertex(current);\r\n\t\t// orderedList.remove(current);\r\n\t\t// } else if (graph.incomingEdgesOf(current).size() == 1\r\n\t\t// && graph.outgoingEdgesOf(current).size() > 1) {\r\n\t\t//\r\n\t\t// } else if (graph.incomingEdgesOf(current).size() > 1\r\n\t\t// && graph.outgoingEdgesOf(current).size() == 1) {\r\n\t\t//\r\n\t\t// }\r\n\t\t// }\r\n\t\t// }\r\n\t\t/*\r\n\t\t * { CycleDetector<SDFAbstractVertex, SDFEdge> detect = new\r\n\t\t * CycleDetector<SDFAbstractVertex, SDFEdge>( graph);\r\n\t\t * List<SDFAbstractVertex> vert = new ArrayList<SDFAbstractVertex>(\r\n\t\t * graph.vertexSet()); while (vert.size() > 0) { SDFAbstractVertex\r\n\t\t * vertex = vert.get(0); Set<SDFAbstractVertex> cycle = detect\r\n\t\t * .findCyclesContainingVertex(vertex); if (cycle.size() > 0) {\r\n\t\t * vert.removeAll(cycle); cycles.add(cycle); } vert.remove(vertex); } }\r\n\t\t */\r\n\r\n\t\treturn;\r\n\t}","public static boolean hasCycle( IntNode head ) {\r\n\t\r\n\t\tfor( IntNode cursor = head; cursor != null; cursor = cursor.link ) {\r\n\t\t\t// otherwise should return false if the list is acyclic\r\n\t\t\tif( cursor.link == null )\r\n\t\t\t\treturn false;\r\n\t\t}\r\n\t\t// should return true if it is cyclic\r\n\t\treturn true;\r\n\t\t\r\n\t}","public ListNode detectCycle(ListNode head) {\n if (null == head || null == head.next) return null;\n ListNode cur = head.next, runner = head.next.next;\n while (null != runner && null != runner.next & cur != runner) {\n cur = cur.next;\n runner = runner.next.next;\n }\n if (cur == runner) {\n cur = head;\n while (runner != cur) {\n cur = cur.next;\n runner = runner.next;\n }\n return cur;\n }\n return null;\n }","public ListNode detectCycle(ListNode head) {\n ListNode walker = head;\n ListNode runner = head;\n \n while(runner != null && runner.next != null) {\n runner = runner.next.next;\n walker = walker.next;\n \n if (runner == walker) {\n while(walker != head) {\n head = head.next;\n walker = walker.next;\n }\n \n return head;\n }\n }\n \n return null;\n }","public boolean hasCycle() {\r\n\t\tSet<Vertex> visited = new HashSet<Vertex>();\r\n\t\tSet<Vertex> path = new HashSet<Vertex>();\r\n\r\n\t\t// Call the helper function to detect cycle for all vertices one by one\r\n\t\tfor (int i = 0; i < N; ++i)\r\n\t\t\tif (detectCycle(this.vertices[i], visited, path))\r\n\t\t\t\treturn true;\r\n\r\n\t\treturn false;\r\n\t}","public void DFS2() {\n boolean[] visited = new boolean[numVertices];\n int[] predecessors = new int[numVertices];\n for (int i = 0; i < numVertices; i++) {\n if (visited[i] == false && hasCycle(0, visited, predecessors)) {\n System.out.println(\"Cycle has found\");\n return;\n }\n }\n System.out.println(\"No cycle found in the graph\");\n }","@Test\n public void TestIfNoCycle() {\n final int NUMBER_OF_ELEMENTS = 100;\n TripleList<Integer> tripleList = new TripleList<>();\n for (int i = 0; i < NUMBER_OF_ELEMENTS; ++i) {\n tripleList.add(i);\n }\n /**\n * Created 2 TripleLists, first jumps every single element, another\n * every two elements, in out case every two elements means every\n * NextElement*\n */\n TripleList<Integer> tripleListEverySingleNode = tripleList;\n TripleList<Integer> tripleListEveryTwoNodes = tripleList.getNext();\n for (int i = 0; i < NUMBER_OF_ELEMENTS * NUMBER_OF_ELEMENTS; ++i) {\n Assert.assertNotSame(tripleListEverySingleNode, tripleListEveryTwoNodes);\n //JumpToNextElement(ref tripleListEverySingleNode);\n if (null == tripleListEveryTwoNodes.getNext()) {\n // if list has end means there are no cycles\n break;\n } else {\n tripleListEveryTwoNodes = tripleListEveryTwoNodes.getNext();\n }\n }\n }","public static void main(String args[])\n {\n LinkedList list = new LinkedList();\n\n list.add(1);\n list.add(2);\n list.add(3);\n list.add(4);\n list.add(5);\n\n // loop\n list.head.next.next.next = list.head;\n\n System.out.println(list.hasCycle());\n }","static boolean hasCycle(Node head) {\n\t\t\n\t\tif(head == null) return false;\n\t\t\n\t\t//Using the concept of one pointer moving faster than another, since at some point both will meet \n\t\t//at the same point and close a cycle (if any).\n\t\tNode slowPointerNode = head;\n\t\tNode fastPointerNode = head.getNext();\n\t\t\n\t\twhile(fastPointerNode != null && fastPointerNode.getNext() != null) {\n\t\t\tif(slowPointerNode == fastPointerNode) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tslowPointerNode = slowPointerNode.getNext();\n\t\t\tfastPointerNode = fastPointerNode.getNext().getNext();\n\t\t}\n\t\t\n\t\treturn false;\n\t}","@Test\n void findCycle() {\n Map<String, Set<String>> nonCyclicGraph = Map.of(\n \"0\", Set.of(\"a\", \"b\", \"c\"),\n \"a\", Set.of(\"0\", \"a2\", \"a3\"),\n \"a2\", Set.of(\"a\"),\n \"a3\", Set.of(\"a\"),\n \"b\", Set.of(\"0\", \"b2\"),\n \"b2\", Set.of(\"b\"),\n \"c\", Set.of(\"0\")\n );\n assertThat(solution.findCycle(nonCyclicGraph)).isFalse();\n\n // 0\n // / | \\\n // a b c\n // /\\ | /\n // a2 a3 b2\n Map<String, Set<String>> cyclicGraph = Map.of(\n \"0\", Set.of(\"a\", \"b\", \"c\"),\n \"a\", Set.of(\"0\", \"a2\", \"a3\"),\n \"a2\", Set.of(\"a\"),\n \"a3\", Set.of(\"a\"),\n \"b\", Set.of(\"0\", \"b2\"),\n \"b2\", Set.of(\"b\"),\n \"c\", Set.of(\"0\", \"b2\")\n );\n assertThat(solution.findCycle(cyclicGraph)).isTrue();\n }","public static boolean hasCycle(ListNode node) {\n\t\treturn true;\n\t}","boolean isCycle(SimpleVertex simpleVertex, int length) {\n\n\t\twhile (count != length) {\n\t\t\tif (simpleVertex.isVisited == false) {\n\t\t\t\tsimpleVertex.isVisited = true;\n\t\t\t\tcount++;\n\t\t\t\tSystem.out.print(simpleVertex.Vertexname + \" \");\n\t\t\t\tfor (int i = 0; i < simpleVertex.neighborhood.size(); i++) {\n\n\t\t\t\t\tSimpleEdge node = simpleVertex.neighborhood.get(i);\n\t\t\t\t\tif (node.one.Vertexname == node.two.Vertexname) {\n\n\t\t\t\t\t\tSystem.out.println(\"here ---------------\");\n\t\t\t\t\t\tflag = true;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\t\tisCycle(node.two, length);\n\t\t\t\t}\n\n\t\t\t} else {\n\t\t\t\treturn true;\n\n\t\t\t}\n\t\t}\n\t\treturn flag;\n\n\t}","private void findCycles(ClassDecl decl, String className, int numClasses){\n\t //base case: our decl is null, return and break out of this method\n if (decl == null) {\n return;\n }\n //base case: if numClasses is 0 and we see the name, its a cycle, throw error\n else if(numClasses == 0 || decl.name.equals(className)) {\n errorMsg.error(decl.pos, \"Circular reference found: \" + decl.name);\n }\n else { //recursive case, call findCycles on the remaining links\n findCycles(decl.superLink, className, numClasses - 1);\n }\n }","public void findLoop(NodeLoop first){\n ArrayList<String> ids = new ArrayList<String>();\n NodeLoop cur = first;\n\n //Finds Loop, if cur.next=null there was no loop\n while(cur.next!=null){\n\n //Found Cycle\n if(ids.contains(cur.id)){\n System.out.println(\"Cycle Found, Begins at \" + cur.id);\n break;\n }\n\n //Add current id to list of id's\n ids.add(cur.id);\n cur = cur.next;\n }\n\n //If no cycle found\n if(cur.next==null){\n System.out.println(\"No Cycle's Found\");\n }\n\n }","public boolean hasCycle(ListNode head) {\n if(head == null || head.next == null){\n return false;\n }\n\n ListNode p1 = head.next;\n ListNode p2 = head.next.next;\n while(p1 != null && p2 != null){\n if(p1 == p2){\n return true;\n }\n p1 = p1.next;\n p2 = p2.next;\n if(p2 != null){\n p2 = p2.next;\n }\n }\n return false;\n }","@Test\n public void testVerifyLoopTerminatesWhenCycleFound() throws Exception {\n // Add more mocking detail to our dependencies first.\n // ----------------------------------------------------\n\n DepChaser sut = createSut();\n\n // First mock our dependencyMap to know about variables a thru f\n when(_dependencyMap.keySet()).thenReturn(new HashSet<>(Arrays.asList(\"a\", \"b\", \"c\", \"d\", \"e\", \"f\")));\n\n // ----------------------------------------------------------------------------------\n // we're going to make it so it takes 2 iterations in DepChaser to handle a thru f\n // ----------------------------------------------------------------------------------\n\n // The 1st time, our mocked checker is going to checkout no cycles in a, b, c variables\n ChildrenDependencyChecker checker1 = mock(ChildrenDependencyChecker.class);\n Exception exception = new Exception(\"fake exception\");\n when(checker1.run()).thenThrow(exception);\n\n when(_dependencyCheckerFactory.create(\"a\", _dependencyMap, new HashSet<>())).thenReturn(checker1);\n\n Assert.assertFalse(sut.validateNoDependencyCycles());\n verify(checker1, times(1)).run();\n\n // Verify no variables were verified\n Assert.assertEquals(new HashSet<>(), sut.getVerifiedVariables());\n // Verify the _dependencyCheckerFactory was only called once.\n verify(_dependencyCheckerFactory, times(1)).create(\"a\", _dependencyMap, new HashSet<>());\n verifyNoMoreInteractions(_dependencyCheckerFactory);\n }","static\tListNode listCycle(ListNode a){\n if(a==null || a.next==null || a.next.next==null){\r\n return null;\r\n }\r\n boolean cycleExists = false;\r\n ListNode fast = a.next.next;\r\n ListNode slow = a;\r\n while(slow.next!=null && fast.next !=null && fast.next.next!=null){\r\n if(fast==slow){\r\n //return cycleSize;\r\n //cycleExists = true;\r\n //break;\r\n return fast;\r\n }else{\r\n \r\n fast = fast.next.next;\r\n slow = slow.next;\r\n }\r\n\r\n }\r\n \r\n return null;\r\n\t}","boolean isCyclic() {\n\n // if we are processing the course currently that is a cyclic graph and we can't\n // do all the courses\n if (processed) {\n return false;\n }\n\n // if we already visited the course and no cycle was found then we can return\n if (visited) {\n return true;\n }\n //else we set the course and visited\n visited = true;\n\n //we then loop through all the prerequisites performing the same check\n for (Course preCourse : pre) {\n if (preCourse.isCyclic()) {\n return true;\n }\n }\n\n //if we arrive here then we have gone through all the combinations and there is no cyclic graph\n visited = false;\n processed = true;\n return false;\n }","public static void main(String[] args) {\n\t\tLinkedListCycle obj = new LinkedListCycle();\n\t\tListNode node1 = obj.new ListNode(1);\n\t\tListNode node2 = obj.new ListNode(2);\n\t\tListNode node3 = obj.new ListNode(3);\n\t\tListNode node4 = obj.new ListNode(4);\n\t\tListNode node5 = obj.new ListNode(5);\n\t\tListNode node6 = obj.new ListNode(6);\n\t\tListNode node7 = obj.new ListNode(7);\n\t\tnode1.next = node2;\n\t\tnode2.next = node3;\n\t\tnode3.next = node4;\n\t\tnode4.next = node5;\n\t\tnode5.next = node6;\n\t\tnode6.next = node7;\n\t\tnode7.next = node2;\n\t\tSystem.out.println(obj.hasCycle(node1));\n\t}","public boolean checkCyclesRecursive(Integer blockID, LinkedList<Integer> visited){\n System.out.println(\"cc: (block \" + blockID + \") visited: \" + visited);\n if(visited.contains(blockID)){\n return false;\n }\n visited.add(blockID);\n\n /*for (Con connection : this.connections) {\n if(connection.src == blockID){\n LinkedList<Integer> new_visited = new LinkedList(visited);\n if(checkCyclesRecursive(connection.dst, new_visited) == false){\n return false;\n }\n }\n }*/\n\n for(Type output : this.getBlockByID(blockID).outputs)\n {\n /*if(output.getFirstDstID() != -1) {\n LinkedList<Integer> new_visited = new LinkedList(visited);\n if(checkCyclesRecursive(output.getFirstDstID(), new_visited) == false){\n return false;\n }\n }*/\n for (Integer id : output.getAllDstID()) {\n LinkedList<Integer> new_visited = new LinkedList(visited);\n if(checkCyclesRecursive(id, new_visited) == false){\n return false;\n } \n }\n }\n return true;\n }","public static void main(String[] args) {\n ArrayList<Integer> input = new ArrayList<>(Arrays.asList(1, 2, -1, 2, 2));\n System.out.println(\"has Cycle : \" + CycleCircularArray.hasCycle(input));\n input = new ArrayList<>(Arrays.asList(2, 2, -1, 2));\n System.out.println(\"has Cycle : \" + CycleCircularArray.hasCycle(input));\n input = new ArrayList<>(Arrays.asList(2, 1, -1, -2));\n System.out.println(\"has Cycle : \" + CycleCircularArray.hasCycle(input));\n }","public boolean hasCycle(Node<T> first) {\n Iterator itOne = this.iterator();\n Iterator itTwo = this.iterator();\n try {\n while (true) {\n T one = (T) itOne.next();\n itTwo.next();\n T two = (T) itTwo.next();\n if (one.equals(two)) {\n return true;\n }\n }\n } catch (NullPointerException ex) {\n ex.printStackTrace();\n }\n return false;\n }","private boolean containsCycle(TransactionId tid) {\n HashSet<TransactionId> visited = new HashSet<TransactionId>();\n LinkedList<TransactionId> queue = new LinkedList<TransactionId>();\n\n queue.add(tid);\n\n while (!(queue.isEmpty())) {\n TransactionId cur = queue.remove();\n if (visited.contains(cur)) {\n return true;\n }\n\n visited.add(cur);\n\n if (this.dependencyMap.containsKey(cur) && !(this.dependencyMap.get(cur).isEmpty())) {\n Iterator<TransactionId> it = this.dependencyMap.get(cur).iterator();\n while (it.hasNext()) {\n queue.add(it.next());\n }\n }\n }\n\n return false;\n }","public Set<V> findCycles()\n {\n // ProbeIterator can't be used to handle this case,\n // so use StrongConnectivityAlgorithm instead.\n StrongConnectivityAlgorithm<V, E> inspector =\n new KosarajuStrongConnectivityInspector<>(graph);\n List<Set<V>> components = inspector.stronglyConnectedSets();\n\n // A vertex participates in a cycle if either of the following is\n // true: (a) it is in a component whose size is greater than 1\n // or (b) it is a self-loop\n\n Set<V> set = new LinkedHashSet<>();\n for (Set<V> component : components) {\n if (component.size() > 1) {\n // cycle\n set.addAll(component);\n } else {\n V v = component.iterator().next();\n if (graph.containsEdge(v, v)) {\n // self-loop\n set.add(v);\n }\n }\n }\n\n return set;\n }","private static boolean checkEulerCicleGraph() {// es cycle o es tour\r\n\t\tfor (int i = 0; i < V; i++) {\r\n\t\t\tif (outdeg[i] % 2 == 1) {\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn true;\r\n\t}","public boolean hasCycle(ListNode head) {\n ListNode p1 = head;\n ListNode p2 = head;\n while (p2 != null && p2.next != null) {\n \tp1 = p1.next;\n \tif (p2.next != null) {\n \t\tp2 = p2.next.next;\n \t}\n \tif (p1 == p2) {\n \t\treturn true;\n \t}\n }\n return false;\n }","public void logicCycles()throws Exception\r\n\t{\r\n\t\t\r\n\t\twhile(isSolved() == false)\r\n\t\t{\r\n\t\t\tint changesMade = 0;\r\n\t\t\tdo\r\n\t\t\t{\r\n\t\t\t\tchangesMade = 0;\r\n\t\t\t\tchangesMade += logic1();\r\n\t\t\t\tchangesMade += logic2();\r\n\t\t\t\tchangesMade += logic3();\r\n\t\t\t\tchangesMade += logic4();\r\n\t\t\t\tif(errorFound())\r\n\t\t\t\t\tbreak;\r\n\t\t\t}while(changesMade != 0);\r\n\t\r\n\t\t}\t\t\t\r\n\t\t\r\n\t}","boolean findCycleUtil(int i, boolean[] visited, boolean[] recStack, LinkedList<Integer>[] g) {\n if (recStack[i]) {\n return true;\n }\n if (visited[i]) {\n return false;\n }\n visited[i] = true;\n recStack[i] = true;\n for (int c : g[i]) {\n if (findCycleUtil(c, visited, recStack, g)) {\n return true;\n }\n }\n recStack[i] = false;\n return false;\n }","public boolean isCycle(int V, ArrayList<ArrayList<Integer>> adj)\n {\n boolean visited[] = new boolean[V];\n Arrays.fill(visited, false);\n \n for(int i = 0;i<V;i++)\n {\n if(!visited[i] && isCyclicU(i, V, visited, adj))\n return true;\n }\n \n return false;\n \n }","public boolean hasCycle(int g) {\n\t\t//TODO\n\t}","public ListNode detectCycle(ListNode head) {\n\t\tListNode fast,slow;\n\t\tfast=slow=head;\n\t\twhile(fast!=null & fast.next()!=null) {\n\t\t\tfast=fast.next().next();\n\t\t\tslow=slow.next();\t\t\n\t\t\t//First meet\n\t\t\tif (fast==slow) {\t\t\t\t\t\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t//Put slow at head ,they meet after k-m steps\n\t\tslow=head;\n\t\twhile(slow!=fast) {\n\t\t\tfast=fast.next();\n\t\t\tslow=slow.next();\n\t\t}\n\t\treturn slow;\n\t}","public ListNode detectCycle(ListNode head) {\n if (head == null || head.next == null) return null;\n ListNode slow = head;\n ListNode fast = head;\n while (fast != null && fast.next != null) {\n slow = slow.next;\n fast = fast.next.next;\n if (fast == slow) {\n ListNode slow2 = head;\n while (slow != slow2) {\n slow = slow.next;\n slow2 = slow2.next;\n }\n return slow;\n }\n }\n return null;\n }","public boolean hasCycle(ListNode head) {\n if(head == null || head.next == null){\n return false;\n }\n Set<ListNode> nodes = new HashSet<ListNode>();\n ListNode cur = head;\n while(cur != null){\n if(nodes.contains(cur)){\n return true;\n }\n nodes.add(cur);\n cur = cur.next;\n }\n return false;\n }","public boolean isFirstCycle() {\n return cycle == 0;\n }","public static boolean hasCycle1(ListNode head) {\n Set<ListNode> visited = new HashSet<>();\n\n while (head != null) {\n if (visited.contains(head)) {\n return true;\n }\n visited.add(head);\n head = head.next;\n }\n\n return false;\n }","int hasCycle(Node head) {\n\t// If list is null\n\tif(head == null) {\n\t\t// No cycle\n\t\treturn 0;\n\t}\n\n\tSet<Node> visitedNodes = new HashSet<Node>();\n\t\n\tNode current = head;\n\n\t// Loop through the list\n\twhile(current != null) {\n\t\t// If we have seen this node befor\n\t\tif(visitedNodes.contains(current)) {\n\t\t\treturn 1;\n\t\t}\n\n\t\t// Add it to the set\n\t\tvisitedNodes.add(current);\n\n\t\t// Update current\n\t\tcurrent = current.next;\n\t}\n\n\t// If we get here, there are no cycles\n\treturn 0;\n}","boolean hasCycle(Node head) {\n node = head;\n //h.add(node.data);//just add the first one //node = node.next; //get to the next one where we, at 2nd best case, will Find Cycle\n while (node.next != null){\n if ( h.contains(node.data) ){\n return true;\n }else {\n h.add(node.data);\n }\n node = node.next;\n }\n return false;\n }","@Test public void testPublic13() {\n Graph<Integer> graph= TestGraphs.testGraph4();\n int i;\n\n for (i= 0; i < 4; i++)\n assertTrue(graph.isInCycle(i));\n\n assertFalse(graph.isInCycle(4));\n }","public ListNode detectCycle(ListNode head) {\n\n\t\tListNode fast = head;\n\t\tListNode slow = head;\n\n\t\twhile (fast != null && fast.next != null) {\n\t\t\tfast = fast.next.next;\n\t\t\tslow = slow.next;\n\t\t\tif (slow == fast) {\n\t\t\t\tListNode slow2 = head;\n\t\t\t\twhile (slow2 != slow) {\n\t\t\t\t\tslow2 = slow2.next;\n\t\t\t\t\tslow = slow.next;\n\t\t\t\t}\n\t\t\t\treturn slow;\n\t\t\t}\n\t\t}\n\t\treturn null;\n\t}","public boolean hasCycle2(ListNode head) {\n if (head == null || head.next == null) {\n return false;\n }\n\n ListNode p1 = head;\n ListNode p2 = head.next.next;\n\n while (p2 != null && p2.next != null) {\n p1 = p1.next;\n p2 = p2.next.next;\n\n if (p1 == p2) {\n return true;\n }\n }\n\n return false;\n }","public static boolean cycleInGraph(int[][] edges) {\n int numberOfNodes = edges.length;\n int[] colors = new int[numberOfNodes]; // By default, 0 (WHITE)\n\n for (int i = 0; i < numberOfNodes; i++) {\n\n if (colors[i] != WHITE) // If already visited/finished.\n continue;\n\n boolean isCycle = traverseAndMarkColor(edges, i, colors);\n\n if (isCycle)\n return true;\n }\n return false;\n }","private static boolean findCyclesInSCC(\n ARGState pStartState,\n ARGState pCurrentState,\n Set<ARGState> pBlockedSet,\n SetMultimap<ARGState, ARGState> pBlockedMap,\n Deque<ARGState> pStack,\n List<List<ARGState>> pAllCycles,\n Set<ARGState> pExcludeSet) {\n\n if (pExcludeSet.contains(pCurrentState)) {\n // Do not regard nodes which were deliberately put into a set of excluded states\n return false;\n }\n\n boolean foundCycle = false;\n pStack.push(pCurrentState);\n pBlockedSet.add(pCurrentState);\n\n for (ARGState successor : pCurrentState.getChildren()) {\n // If the successor is equal to the startState, a cycle has been found.\n // Store contents of stack in the final result.\n if (successor.equals(pStartState)) {\n List<ARGState> cycle = new ArrayList<>();\n pStack.push(pStartState);\n cycle.addAll(pStack);\n Collections.reverse(cycle);\n pStack.pop();\n pAllCycles.add(cycle);\n foundCycle = true;\n } else if (!pBlockedSet.contains(successor)) {\n // Explore this successor only if it is not already in the blocked set.\n boolean gotCycle =\n findCyclesInSCC(\n pStartState, successor, pBlockedSet, pBlockedMap, pStack, pAllCycles, pExcludeSet);\n foundCycle = foundCycle || gotCycle;\n }\n }\n\n if (foundCycle) {\n unblock(pCurrentState, pBlockedSet, pBlockedMap);\n } else {\n for (ARGState s : pCurrentState.getChildren()) {\n pBlockedMap.put(s, pCurrentState);\n }\n }\n pStack.pop();\n\n return foundCycle;\n }","boolean isCycleUndirected(SimpleVertex simpleVertex, SimpleVertex parent) {\n\t\tsimpleVertex.parent = parent;\n\n\t\twhile (true) {\n\t\t\tif (simpleVertex.isVisited == false) {\n\t\t\t\tsimpleVertex.isVisited = true;\n\t\t\t\tSystem.out.print(simpleVertex.Vertexname + \" \");\n\t\t\t\tfor (int i = 0; i < simpleVertex.neighborhood.size(); i++) {\n\n\t\t\t\t\tSimpleEdge node = simpleVertex.neighborhood.get(i);\n\t\t\t\t\tnode.EdgeVisited = true;\n\t\t\t\t\t/*\n\t\t\t\t\t * if(simpleVertex.isVisited==node.two.isVisited){\n\t\t\t\t\t * System.out.println(\"cycle present\"); flagUndirected=true; return\n\t\t\t\t\t * flagUndirected; }\n\t\t\t\t\t */\n\n\t\t\t\t\tif (simpleVertex.parent != null && node.two.Vertexname == simpleVertex.parent.Vertexname)\n\t\t\t\t\t\tSystem.out.println(\"skip\");\n\t\t\t\t\telse if (node.two.isVisited == true) {\n\t\t\t\t\t\tSystem.out.println(\"Graph contains a cycle\");\n\t\t\t\t\t\tflagUndirected = true;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tisCycleUndirected(node.two, simpleVertex);\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\tbreak;\n\t\t}\n\t\treturn flagUndirected;\n\n\t}","@Test\n public void shouldThrowCyclicDependencyExceptionIfACycleIsDetected_DownstreamOfCurrentWasUpstreamOfCurrentAtSomePoint() {\n String grandParent = \"grandParent\";\n String parent = \"parent\";\n String child = \"child\";\n String currentPipeline = \"current\";\n ValueStreamMap graph = new ValueStreamMap(currentPipeline, null);\n graph.addDownstreamNode(new PipelineDependencyNode(child, child), currentPipeline);\n graph.addDownstreamNode(new PipelineDependencyNode(grandParent, grandParent), child);\n graph.addUpstreamNode(new PipelineDependencyNode(parent, parent), null, currentPipeline);\n graph.addUpstreamNode(new PipelineDependencyNode(grandParent, grandParent), null, parent);\n graph.addUpstreamMaterialNode(new SCMDependencyNode(\"g\",\"g\",\"git\") , null, grandParent, new MaterialRevision(null));\n graph.addUpstreamMaterialNode(new SCMDependencyNode(\"g\",\"g\",\"git\") , null, parent, new MaterialRevision(null));\n\n assertThat(graph.hasCycle(), is(true));\n }","@Test\n public void cyclicalGraphs1Test() throws Exception {\n // NOTE: we can't use the parser to create a circular graph because\n // vector clocks are partially ordered and do not admit cycles. So we\n // have to create circular graphs manually.\n ChainsTraceGraph g1 = new ChainsTraceGraph();\n List<EventNode> g1Nodes = addNodesToGraph(g1, new String[] { \"a\", \"a\",\n \"a\" });\n // Create a loop in g1, with 3 nodes\n g1Nodes.get(0).addTransition(g1Nodes.get(1), Event.defTimeRelationStr);\n g1Nodes.get(1).addTransition(g1Nodes.get(2), Event.defTimeRelationStr);\n g1Nodes.get(2).addTransition(g1Nodes.get(0), Event.defTimeRelationStr);\n exportTestGraph(g1, 0);\n\n ChainsTraceGraph g2 = new ChainsTraceGraph();\n List<EventNode> g2Nodes = addNodesToGraph(g2, new String[] { \"a\", \"a\" });\n // Create a loop in g2, with 2 nodes\n g2Nodes.get(0).addTransition(g2Nodes.get(1), Event.defTimeRelationStr);\n g2Nodes.get(1).addTransition(g2Nodes.get(0), Event.defTimeRelationStr);\n exportTestGraph(g2, 1);\n\n testKEqual(g1Nodes.get(0), g2Nodes.get(0), 1);\n testKEqual(g1Nodes.get(0), g2Nodes.get(0), 2);\n testKEqual(g1Nodes.get(0), g2Nodes.get(0), 3);\n testKEqual(g1Nodes.get(0), g2Nodes.get(0), 4);\n\n ChainsTraceGraph g3 = new ChainsTraceGraph();\n List<EventNode> g3Nodes = addNodesToGraph(g2, new String[] { \"a\" });\n // Create a loop in g3, from a to itself\n g3Nodes.get(0).addTransition(g3Nodes.get(0), Event.defTimeRelationStr);\n exportTestGraph(g3, 2);\n\n testKEqual(g3Nodes.get(0), g2Nodes.get(0), 1);\n testKEqual(g3Nodes.get(0), g2Nodes.get(0), 2);\n testKEqual(g3Nodes.get(0), g2Nodes.get(0), 3);\n\n ChainsTraceGraph g4 = new ChainsTraceGraph();\n List<EventNode> g4Nodes = addNodesToGraph(g2, new String[] { \"a\" });\n exportTestGraph(g4, 2);\n\n testKEqual(g4Nodes.get(0), g2Nodes.get(0), 1);\n testNotKEqual(g4Nodes.get(0), g2Nodes.get(0), 2);\n testNotKEqual(g4Nodes.get(0), g2Nodes.get(0), 3);\n testNotKEqual(g4Nodes.get(0), g2Nodes.get(0), 4);\n }","public boolean hasCycle(ListNode head) {\n\t\tListNode fast,slow;\n\t\tfast=slow=head;\n\t\twhile(fast!=null & fast.next()!=null) {\n\t\t\tfast=fast.next().next();\n\t\t\tslow=slow.next();\n\t\t\t//Meet at a point\n\t\t\tif (fast==slow) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t\t\n\t}","public boolean hasCycle(ListNode head) {\n if (head == null) {\n return false;\n }\n ListNode slow = head;\n ListNode fast = head;\n \n while (slow != null) {\n slow = slow.next;\n if (fast != null && fast.next != null) {\n fast = fast.next.next;\n } else {\n return false;\n }\n if (slow == fast)\n return true;\n }\n return false;\n }","static boolean isCorrectCycle(Vertex v, LinkedList<Vertex> cycle, int print) {\r\n\r\n boolean ret = true;\r\n\r\n if (print > 1)\r\n System.out.println(\"Checking cycle with vertex \" + v + \": \" + cycle);\r\n\r\n // check for invalid parameters\r\n if (v == null || cycle == null || cycle.isEmpty()) {\r\n if (print > 0)\r\n System.out.println(\"null or empty parameter, no check\");\r\n return false;\r\n }\r\n\r\n // check for too short cycles, 4 is minimum (v-x-y-v)\r\n if (cycle.size() < 4) {\r\n if (print > 0)\r\n System.out.println(\"too short cycle: \" + cycle.size());\r\n ret = false;\r\n }\r\n\r\n // check for correct first and last in cycle\r\n if (cycle.getFirst() != v) {\r\n if (print > 0)\r\n System.out.println(\"Wrong first vertex \" + cycle.getFirst());\r\n ret = false;\r\n }\r\n if (cycle.getLast() != v) {\r\n if (print > 0)\r\n System.out.println(\"Wrong last vertex \" + cycle.getLast());\r\n ret = false;\r\n }\r\n\r\n // extra: check if first and last are different (other than v)\r\n\r\n // check that all successive vertices in list are adjacent in graph\r\n\r\n ListIterator<Vertex> li = cycle.listIterator();\r\n Vertex prev = null;\r\n while (li.hasNext()) {\r\n Vertex w = li.next();\r\n if (prev != null && ! prev.isAdjacent(w)) {\r\n if (print > 0)\r\n System.out.println(\"No edge between \" + prev + \" and \" + w);\r\n ret = false;\r\n }\r\n // check that v is not in the middle of cycle\r\n if (prev != null && li.hasNext() && w == v) {\r\n if (print > 0)\r\n System.out.println(\"Required vertex \" + v + \" in the middle of cycle\");\r\n ret = false;\r\n }\r\n\r\n prev = w;\r\n } // while\r\n\r\n if (print > 1 && ret)\r\n System.out.println(\"Valid cycle\");\r\n\r\n return ret;\r\n\r\n }","public boolean hasSelfLoops();","public boolean hasCycle(ListNode head) {\r\n\t\tListNode fast = head;\r\n\t\tListNode slow = head;\r\n\r\n\t\twhile (fast != null && fast.next != null) {\r\n\t\t\tslow = slow.next;\r\n\t\t\tfast = fast.next.next;\r\n\r\n\t\t\tif (slow == fast) {\r\n\t\t\t\treturn true;\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn true;\r\n\t}","public boolean reducible() {\n if (dfsTree.back.isEmpty()) {\n return true;\n }\n int size = controlFlow.transitions.length;\n boolean[] loopEnters = dfsTree.loopEnters;\n TIntHashSet[] cycleIncomings = new TIntHashSet[size];\n // really this may be array, since dfs already ensures no duplicates\n TIntArrayList[] nonCycleIncomings = new TIntArrayList[size];\n int[] collapsedTo = new int[size];\n int[] queue = new int[size];\n int top;\n for (int i = 0; i < size; i++) {\n if (loopEnters[i]) {\n cycleIncomings[i] = new TIntHashSet();\n }\n nonCycleIncomings[i] = new TIntArrayList();\n collapsedTo[i] = i;\n }\n\n // from whom back connections\n for (Edge edge : dfsTree.back) {\n cycleIncomings[edge.to].add(edge.from);\n }\n // from whom ordinary connections\n for (Edge edge : dfsTree.nonBack) {\n nonCycleIncomings[edge.to].add(edge.from);\n }\n\n for (int w = size - 1; w >= 0 ; w--) {\n top = 0;\n // NB - it is modified later!\n TIntHashSet p = cycleIncomings[w];\n if (p == null) {\n continue;\n }\n TIntIterator iter = p.iterator();\n while (iter.hasNext()) {\n queue[top++] = iter.next();\n }\n\n while (top > 0) {\n int x = queue[--top];\n TIntArrayList incoming = nonCycleIncomings[x];\n for (int i = 0; i < incoming.size(); i++) {\n int y1 = collapsedTo[incoming.getQuick(i)];\n if (!dfsTree.isDescendant(y1, w)) {\n return false;\n }\n if (y1 != w && p.add(y1)) {\n queue[top++] = y1;\n }\n }\n }\n\n iter = p.iterator();\n while (iter.hasNext()) {\n collapsedTo[iter.next()] = w;\n }\n }\n\n return true;\n }","private boolean findCycles(int v, int s, Vector<Integer>[] adjList)\n {\n boolean f = false;\n this.stack.add(v);\n this.blocked[v] = true;\n\n for (int i = 0; i < adjList[v].size(); i++) {\n int w = adjList[v].get(i);\n // found cycle\n if (w == s) {\n Vector cycle = new Vector();\n for (int j = 0; j < this.stack.size(); j++) {\n int index = this.stack.get(j).intValue();\n cycle.add(this.graphNodes[index]);\n }\n this.cycles.add(cycle);\n\n\n // we hard-limit the cycle number to 10k!!\n if (this.cycles.size() > 10000) {\n break;\n }\n\n f = true;\n }\n else if (!this.blocked[w]) {\n if (this.findCycles(w, s, adjList)) {\n f = true;\n }\n }\n }\n\n if (f) {\n this.unblock(v);\n }\n else {\n for (int i = 0; i < adjList[v].size(); i++) {\n int w = ((Integer) adjList[v].get(i)).intValue();\n if (!this.B[w].contains(new Integer(v))) {\n this.B[w].add(new Integer(v));\n }\n }\n }\n\n this.stack.remove(new Integer(v));\n return f;\n }","boolean detectCycledirected(ArrayList<Integer> G[]) {\n\t\tint[] vis = new int[G.length];\n\t\tint[] ancestor = new int[G.length];\n\t\tfor (int i = 0; i < G.length; i++) {\n\t\t\tif (vis[i] == 0) {\n\t\t\t\tif (detectCycleUtil(G, i, vis, ancestor))\n\t\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}","public ListNode detectCycle(ListNode head){\n if(head == null) return null;\n\n Set<ListNode> visitedNodes = new HashSet<>();\n ListNode currNode = head;\n while(currNode != null) {\n if(visitedNodes.contains(currNode)){\n return currNode;\n }\n visitedNodes.add(currNode);\n currNode = currNode.next;\n }\n return null;\n }","public DirectedCycle(Digraph G) {\n onStack = new boolean[G.V()];\n marked = new boolean[G.V()];\n edgeTo = new int[G.V()];\n\n //Cycle through each vertex to see if it is in a cycle\n for (int v = 0; v < G.V(); v++) {\n if (marked[v] == false) {\n dfs(G, v);\n }\n }\n }","protected boolean hasCycle(Map<Object, Object> data) {\n return Boolean.TRUE == data.get(DATA_CLOSURE_CYCLIC); \n }","private boolean hasNoCycle(int node, int[] color, int[][] graph) {\n if (color[node] > 0)\n return color[node] == 2;\n\n color[node] = 1;\n for (int nei : graph[node]) {\n if (color[nei] == 2)\n continue;\n if (color[nei] == 1 || !hasNoCycle(nei, color, graph))\n return false;\n }\n\n color[node] = 2;\n return true;\n }","private void runLoopCheck(HashMap<IconMain, Set<IconMain>> connections, IconMain iconFrom) {\n visited.add(iconFrom);\n if (connections.containsKey(iconFrom)) {\n Set<IconMain> set = connections.get(iconFrom);\n\n for (IconMain iconTo : set) {\n while (!iconTo.iconType.equals(\")\")) {\n if (visited.contains(iconTo)) {\n break;\n }\n runLoopCheck(connections, iconTo);\n }\n visited.add(iconTo);\n }\n }\n }","@Override\n public void cycle(long cycle) {\n\n boolean previousState = state();\n\n manageDIV();\n\n incTIMAIfChange(previousState);\n }","public static ListNode detectCycle2(ListNode head){\n if(head == null) return null;\n\n ListNode intersectNode = getIntersection(head);\n if(intersectNode == null) return null;\n\n ListNode currNode = head;\n while(currNode != intersectNode) {\n currNode = currNode.next;\n intersectNode = intersectNode.next;\n }\n return intersectNode;\n }","public int getCycles();","void find_negative_cycle(){\n \t\n \tfor(int j = 0; j<E ; j++)\n\t\t{\n\t\t\trelax(edge[j].src, edge[j].destination, edge[j].weight);\n\t\t}\n \tfor(int i = 0; i<V ; i++)\n\t\t{\n \t\tif(x[i] != dist[i])\n\t\t\t{\n \t\t\tNegCycle = true;\n\t\t\t\tSystem.out.println(\"Negative Cycle Found \");\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n }","@Test public void testPublic11() {\n Graph<Character> graph= TestGraphs.testGraph3();\n\n for (Character ch : graph.getVertices())\n assertFalse(graph.isInCycle(ch));\n }","private boolean isAcyclic() {\n boolean visited[] = new boolean[getNumNodes()];\n boolean noCycle = true;\n int list[] = new int[getNumNodes() + 1];\n int index = 0;\n int lastIndex = 1;\n list[0] = randomParent;\n visited[randomParent] = true;\n while (index < lastIndex && noCycle) {\n int currentNode = list[index];\n int i = 1;\n\n // verify parents of current node\n while ((i < parentMatrix[currentNode][0]) && noCycle) {\n if (!visited[parentMatrix[currentNode][i]]) {\n if (parentMatrix[currentNode][i] != randomChild) {\n list[lastIndex] = parentMatrix[currentNode][i];\n lastIndex++;\n }\n else {\n noCycle = false;\n }\n visited[parentMatrix[currentNode][i]] = true;\n } // end of if(visited)\n i++;\n }\n index++;\n }\n //System.out.println(\"\\tnoCycle:\"+noCycle);\n return noCycle;\n }","private static FunctionCycle findCycleWithBrentsInternal(IntUnaryOperator func, int x0) {\n\n int power = 1;\n int lam = 1;\n\n int t = x0;\n int h = func.applyAsInt(x0);\n\n // 'lam' will be equal to cycle length at the end of iteration\n while (t != h) {\n if (power == lam) {\n t = h;\n power *= 2;\n lam = 0;\n }\n\n h = func.applyAsInt(h);\n ++lam;\n }\n\n final int cycleLength = lam;\n\n t = x0;\n h = x0;\n\n // find star point for cycle\n for (int i = 0; i < lam; ++i) {\n h = func.applyAsInt(h);\n }\n\n while (t != h) {\n t = func.applyAsInt(t);\n h = func.applyAsInt(h);\n }\n\n return new FunctionCycle(t, cycleLength);\n }","private static Boolean detectLoop(Node head2) {\n\t\tHashSet<Node> s = new HashSet<Node>();\n\t\twhile (head2 != null) {\n\t\t\tif (s.contains(head2))\n\t\t\t\treturn true;\n\t\t\ts.add(head2);\n\t\t\thead2 = head2.next;\n\t\t}\n\t\treturn false;\n\t}","public Iterable<Integer> cycle(){\n return cycle;\n }","public static boolean hasCycle2(ListNode head) {\n if (head == null) return false;\n ListNode slow = head;\n ListNode fast = head;\n\n while ((fast.next != null) && (fast.next.next != null)) {\n fast = fast.next.next;\n slow = slow.next;\n if (fast == slow) { //Meet point\n return true;\n }\n }\n return false;\n }","public boolean detect_cycle_directed_util(int v,boolean visited[], boolean curr_visited[]) {\n\t\t\n\t\tvisited[v]=true;\n\t\tcurr_visited[v]=true;\n\t\t\n\t\t\n\t\tfor(int neighbour:adj[v]) {\n\t\t\t\n\t\t\tif(curr_visited[neighbour]) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\telse if(!visited[neighbour]&&detect_cycle_directed_util(neighbour,visited,curr_visited)) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\t\n\t\tcurr_visited[v]=false;\n\t\t\n\t\treturn false;\n\t\t\n\t}","public void removeGraphCycles() {\n\t\tMap<Integer, MovingFObject> map = sc.getInitPos();\r\n\t\tint[] cycleCount = new int[map.size()];\r\n\t\tforComplexMotion = new boolean[map.size()];\r\n\t\t//count cycles\r\n\t\tfor(int i = 0; i < map.size(); i++) {\r\n\t\t\tfor(int j = 0; j < map.size(); j++) {\r\n\t\t\t\tif(i != j) {\r\n\t\t\t\t\tif(graph[i][j] && graph[j][i]) {\r\n\t\t\t\t\t\tcycleCount[i]++;\r\n\t\t\t\t\t\tcycleCount[j]++;\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\t//remove fobjects from linear motion planning\r\n\t\tboolean hasCycles = true;\r\n\t\twhile(hasCycles) {\r\n\t\t\tint max = 0;\r\n\t\t\tint maxIndex = -1;\r\n\t\t\tfor(int i = 0; i < cycleCount.length; i++) {\r\n\t\t\t\tif(cycleCount[i] > max) {\r\n\t\t\t\t\tmax = cycleCount[i];\r\n\t\t\t\t\tmaxIndex = i;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tif(maxIndex == -1) {\r\n\t\t\t\thasCycles = false;\r\n\t\t\t}\r\n\t\t\telse {\r\n\t\t\t\tcycleCount[maxIndex] = 0;\r\n\t\t\t\tforComplexMotion[maxIndex] = true;\r\n\t\t\t\tfor(int i = 0; i < cycleCount.length; i++) {\r\n\t\t\t\t\tgraph[maxIndex][i] = false;\r\n\t\t\t\t\tgraph[i][maxIndex] = false;\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t\t\r\n\t\t}\r\n\t\t\r\n\t}","@Test\n public void shouldThrowCyclicDependencyExceptionIfACycleIsDetected_CycleDetectedInUpstreamNodes() {\n\n String a = \"A\";\n String b = \"B\";\n String c = \"C\";\n ValueStreamMap graph = new ValueStreamMap(b, null);\n graph.addUpstreamNode(new PipelineDependencyNode(a, a), null, b);\n graph.addUpstreamMaterialNode(new SCMDependencyNode(\"g\",\"g\",\"git\"), null, a, new MaterialRevision(null));\n graph.addDownstreamNode(new PipelineDependencyNode(a, a), b);\n graph.addDownstreamNode(new PipelineDependencyNode(c, c), a);\n\n assertThat(graph.hasCycle(), is(true));\n }","private void checkNoCycles(List<JpsModule> component) {\n if (component.size() > 1) {\n StringBuilder message = new StringBuilder();\n message.append(\"Found circular module dependency: \")\n .append(component.size())\n .append(\" modules\");\n for (JpsModule module : component) {\n message.append(\" \").append(module.getName());\n }\n logger.error(message.toString());\n }\n }","static long GetCycleCount() {\n\t\treturn System.currentTimeMillis();\n\t}","public static void main(String[] args) { \n \tA016_DetectAndRemoveLoopLinkedList list = new A016_DetectAndRemoveLoopLinkedList(); \n \tNode head = new Node(50); \n head.next = new Node(20); \n head.next.next = new Node(15); \n head.next.next.next = new Node(4); \n head.next.next.next.next = new Node(10); \n \n // Creating a loop for testing \n head.next.next.next.next.next = head.next.next; \n list.detectAndRemoveLoop(head); \n while (head != null) { \n System.out.print(head.data + \" \"); \n head = head.next; \n }\n \n// \n// ListNode head1 = new ListNode(50); \n// head1.next = new ListNode(20); \n// head1.next.next = new ListNode(15); \n// head1.next.next.next = new ListNode(4); \n// head1.next.next.next.next = new ListNode(10); \n// \n// // Creating a loop for testing \n// head1.next.next.next.next.next = head1.next.next; \n// System.out.println(detectCycle(head1));\n \n \n ListNode head1 = new ListNode(1);\n ListNode second = new ListNode(2);\n ListNode third = new ListNode(3);\n ListNode fourth = new ListNode(4);\n\t\thead1.next = second;\n\t\tsecond.next = third;\n\t\tthird.next = fourth;\n\t\tfourth.next = second;\n\t\tListNode aaa = detectCycle(head1);\n\t\twhile (head1 != null) {\n\t\t\tSystem.out.print(head1.val + \" \");\n\t\t\thead1 = head1.next;\n\t\t}\n\t}","@Test public void testPublic12() {\n Graph<Integer> graph= new Graph<Integer>();\n int i;\n\n // note this adds the adjacent vertices in the process\n for (i= 0; i < 10; i++)\n graph.addEdge(i, i + 1, 1);\n graph.addEdge(10, 0, 1);\n\n for (Integer vertex : graph.getVertices())\n assertTrue(graph.isInCycle(vertex));\n }","@Test\n public void cyclicalGraphs3Test() throws Exception {\n // Test graphs with multiple loops. g1 has two different loops, which\n // have to be correctly matched to g2 -- which is build in a different\n // order but is topologically identical to g1.\n\n ChainsTraceGraph g1 = new ChainsTraceGraph();\n List<EventNode> g1Nodes = addNodesToGraph(g1, new String[] { \"a\", \"b\",\n \"c\", \"d\", \"b\", \"c\" });\n\n // Create loop1 in g1, with the first 4 nodes.\n g1Nodes.get(0).addTransition(g1Nodes.get(1), Event.defTimeRelationStr);\n g1Nodes.get(1).addTransition(g1Nodes.get(2), Event.defTimeRelationStr);\n g1Nodes.get(2).addTransition(g1Nodes.get(3), Event.defTimeRelationStr);\n g1Nodes.get(3).addTransition(g1Nodes.get(0), Event.defTimeRelationStr);\n\n // Create loop2 in g1, with the last 2 nodes, plus the initial node.\n g1Nodes.get(0).addTransition(g1Nodes.get(4), Event.defTimeRelationStr);\n g1Nodes.get(4).addTransition(g1Nodes.get(5), Event.defTimeRelationStr);\n g1Nodes.get(5).addTransition(g1Nodes.get(0), Event.defTimeRelationStr);\n\n exportTestGraph(g1, 0);\n\n // //////////////////\n // Now create g2, by generating the two identical loops in the reverse\n // order.\n\n ChainsTraceGraph g2 = new ChainsTraceGraph();\n List<EventNode> g2Nodes = addNodesToGraph(g2, new String[] { \"a\", \"b\",\n \"c\", \"d\", \"b\", \"c\" });\n\n // Create loop2 in g2, with the last 2 nodes, plus the initial node.\n g2Nodes.get(0).addTransition(g2Nodes.get(4), Event.defTimeRelationStr);\n g2Nodes.get(4).addTransition(g2Nodes.get(5), Event.defTimeRelationStr);\n g2Nodes.get(5).addTransition(g2Nodes.get(0), Event.defTimeRelationStr);\n\n // Create loop1 in g2, with the first 4 nodes.\n g2Nodes.get(0).addTransition(g2Nodes.get(1), Event.defTimeRelationStr);\n g2Nodes.get(1).addTransition(g2Nodes.get(2), Event.defTimeRelationStr);\n g2Nodes.get(2).addTransition(g2Nodes.get(3), Event.defTimeRelationStr);\n g2Nodes.get(3).addTransition(g2Nodes.get(0), Event.defTimeRelationStr);\n\n exportTestGraph(g2, 1);\n\n // //////////////////\n // Now test that the two graphs are identical for all k starting at the\n // initial node.\n\n for (int k = 1; k < 7; k++) {\n testKEqual(g1Nodes.get(0), g2Nodes.get(0), k);\n }\n }","public boolean IsCyclic() {\r\n\t\tHashMap<String, Boolean> processed = new HashMap<>();\r\n\t\tLinkedList<Pair> queue = new LinkedList<>();\r\n\r\n\t\tArrayList<String> vnames = new ArrayList<>(vces.keySet());\r\n\t\tfor (String vname : vnames) {\r\n\t\t\tif (processed.containsKey(vname)) {\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\r\n\t\t\tPair rootpair = new Pair(vname, vname);\r\n\t\t\tqueue.addLast(rootpair);\r\n\t\t\twhile (queue.size() != 0) {\r\n\t\t\t\t// 1. removeFirst\r\n\t\t\t\tPair rp = queue.removeFirst();\r\n\r\n\t\t\t\t// 2. check if processed, mark if not\r\n\t\t\t\tif (processed.containsKey(rp.vname)) {\r\n\t\t\t\t\tSystem.out.println(rp.vname + \" via \" + rp.psf);\r\n\t\t\t\t\treturn true;\r\n\t\t\t\t}\r\n\t\t\t\tprocessed.put(rp.vname, true);\r\n\r\n\t\t\t\t// 3. Check, if an edge is found\r\n\t\t\t\tSystem.out.println(rp.vname + \" via \" + rp.psf);\r\n\r\n\t\t\t\t// 4. Add the unprocessed nbrs back\r\n\t\t\t\tArrayList<String> nbrnames = new ArrayList<>(rp.vtx.nbrs.keySet());\r\n\t\t\t\tfor (String nbrname : nbrnames) {\r\n\t\t\t\t\tif (!processed.containsKey(nbrname)) {\r\n\t\t\t\t\t\tPair np = new Pair(nbrname, rp.psf + nbrname);\r\n\t\t\t\t\t\tqueue.addLast(np);\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\treturn false;\r\n\t}","@Test\n public void testVerifyLoopInvokesDependenciesProperlyWhenNoCycles() throws Exception {\n // ----------------------------------------------------\n // Add more mocking detail to our dependencies first.\n // ----------------------------------------------------\n\n DepChaser sut = createSut();\n\n // First mock our dependencyMap to know about variables a thru f\n when(_dependencyMap.keySet()).thenReturn(new HashSet<>(Arrays.asList(\"a\", \"b\", \"c\", \"d\", \"e\", \"f\")));\n\n // ----------------------------------------------------------------------------------\n // we're going to make it so it takes 2 iterations in DepChaser to handle a thru f\n // ----------------------------------------------------------------------------------\n\n // The 1st time, our mocked checker is going to checkout no cycles in a, b, c variables\n ChildrenDependencyChecker checker1 = mockChildrenDependencyChecker(Arrays.asList(\"a\", \"b\", \"c\"));\n // The 2nd time, our mocked checker is going to checkout no cycles in d, e, f variables\n ChildrenDependencyChecker checker2 = mockChildrenDependencyChecker(Arrays.asList(\"d\", \"e\", \"f\"));\n\n when(_dependencyCheckerFactory.create(\"a\", _dependencyMap, new HashSet<>())).thenReturn(checker1);\n when(_dependencyCheckerFactory.create(\"d\", _dependencyMap, new HashSet<>(Arrays.asList(\"a\", \"b\", \"c\")))).thenReturn(checker2);\n\n Assert.assertTrue(sut.validateNoDependencyCycles());\n verify(checker1, times(1)).run();\n verify(checker2, times(1)).run();\n\n // Verify all variables were verified\n Assert.assertEquals(_dependencyMap.keySet(), sut.getVerifiedVariables());\n }","public boolean detectCyclesContainingVertex(V v)\n {\n try {\n execute(null, v);\n } catch (CycleDetectedException ex) {\n return true;\n }\n\n return false;\n }","public boolean hasCycle(int nodeIndex, int[][] graph, boolean[] visited, boolean[] onStack,\n boolean[] onCycle) {\n\n if (onCycle[nodeIndex]) {\n return true;\n }\n visited[nodeIndex] = true;\n onStack[nodeIndex] = true;\n boolean cycle = false;\n for (int neighbor : graph[nodeIndex]) {\n if (onCycle[neighbor]) {\n cycle = true;\n continue;\n }\n if (!visited[neighbor]) {\n if (hasCycle(neighbor, graph, visited, onStack, onCycle)) {\n onCycle[neighbor] = true;\n cycle = true;\n }\n } else {\n if (onStack[neighbor]) {\n onCycle[neighbor] = true;\n cycle = true;\n }\n }\n }\n onStack[nodeIndex] = false;\n return cycle;\n }","public static void main(String[] args) {\n\t\tNode test = new Node(1);\n\t\t\n\t\tlogger.info(String.valueOf(hasCycle(test)));\n\t\t\n\t\t//Test second list - 1 -> 2 -> 3 -> 2 -> 3 [...]\n\t\tNode head = new Node(1);\n\t\tNode next = new Node(2);\n\t head.setNext(next); \n\t head.getNext().setNext(new Node(3));\n\t head.getNext().getNext().setNext(next);\n\t \n\t logger.info(String.valueOf(hasCycle(head)));\n\t}","static Boolean detectloop(Node Header){\n Node slow_pointer = Header;\n Node fast_pointer = Header;\n while(slow_pointer!=null && fast_pointer!=null && fast_pointer.link!=null){\n slow_pointer=slow_pointer.link;\n fast_pointer=fast_pointer.link.link;\n if(slow_pointer==fast_pointer){\n return true;\n }\n }\n return false;\n }","public static Node findCycle(Node head) {\n if (head == null) return head;\n\n Node slow = head;\n Node fast = head.next;\n while (fast != null && fast.next != null) {\n if (fast == slow) break;\n slow = slow.next;\n fast = fast.next.next;\n }\n\n if (fast == slow) {\n slow = head;\n while (slow != fast.next) {\n slow = slow.next;\n fast = fast.next;\n }\n return fast.next;\n } else {\n return null;\n }\n }","public boolean\n checkCycle(int nd, ArrayList<ArrayList<Integer>> adj,\n cycleHelper cyHlp) {\n // insert into stack\n cyHlp.isStack[nd] = true;\n for (int it : adj.get(nd)) {\n // if next node is visited\n if (cyHlp.visited[it] == true) {\n // if the node is in stack then cycle is found\n if (cyHlp.isStack[it] == true) return true;\n continue;\n }\n cyHlp.visited[it] = true;\n if (checkCycle(it, adj, cyHlp)) return true;\n }\n // removing from stack\n cyHlp.isStack[nd] = false;\n return false;\n }","public int getCycle() {\n return cycle;\n }","private static boolean checkAndAddDependency(int trans_id, int independent_trans_id) {\n List<Integer> txnsInCycle = new ArrayList<Integer>();\n txnsInCycle.add(trans_id);\n if (DeadlockHandler.isThereACycleInGraph(trans_id, independent_trans_id, txnsInCycle)) {\n // System.out.println(\"List contents are\" + txnsInCycle.toString());\n long youngestTxnTime = transactions.get(txnsInCycle.get(0)).getStartTime();\n Integer youngestTxnId = txnsInCycle.get(0);\n for (Integer t : txnsInCycle) {\n if (youngestTxnTime < transactions.get(t).getStartTime()) {\n youngestTxnTime = transactions.get(t).getStartTime();\n youngestTxnId = t;\n }\n }\n\n\n\n System.out.println(\"Cycle in graph. DEADLOCK\");\n System.out.println(\"Aborted : T\" + youngestTxnId);\n releaseResources(youngestTxnId);\n clearWaitingOperations();\n if (youngestTxnId != trans_id && youngestTxnId != independent_trans_id) {\n DeadlockHandler.addDependencyEdge(independent_trans_id, trans_id);\n return true;\n }\n\n\n\n return false;\n\n }\n\n else {\n\n // if edge exists we don't need to do anything\n if (!DeadlockHandler.ifThereIsAnEdgeFromT1toT2(trans_id, independent_trans_id)) {\n\n // System.out.println(\"checkAndAddDependency::Edge is not present\");\n // System.out.println(\"checkAndAddDependency::Add dependency edge\");\n // no deadlock hence we can add the edge\n DeadlockHandler.addDependencyEdge(independent_trans_id, trans_id);\n }\n }\n\n return true;\n }","private boolean cyclicUpdate() {\n if (cyclicUpdate_EM()) {\n mUpdate = 0;\n return true;\n }\n return false;\n }"],"string":"[\n \"private Boolean checkCycle() {\\n Node slow = this;\\n Node fast = this;\\n while (fast.nextNode != null && fast.nextNode.nextNode != null) {\\n fast = fast.nextNode.nextNode;\\n slow = slow.nextNode;\\n if (fast == slow) {\\n System.out.println(\\\"contains cycle\\\");\\n return true;\\n }\\n }\\n System.out.println(\\\"non-cycle\\\");\\n return false;\\n }\",\n \"public static void checkCycleSample() {\\n Node ll1_5 = new Node(1, new Node(2, new Node(3, new Node(4, new Node(5, null)))));\\n\\n Node ll1_2 = new Node(1, new Node(2, null));\\n Node ll3_4 = new Node(3, new Node(4, null));\\n Node ll5_6 = new Node(5, new Node(6, null));\\n ll1_2.nextNode.nextNode = ll3_4;\\n ll3_4.nextNode.nextNode = ll5_6;\\n ll5_6.nextNode.nextNode = ll1_2;\\n\\n ll1_2.checkCycle();\\n ll1_5.checkCycle();\\n }\",\n \"@SuppressWarnings(\\\"unchecked\\\")\\r\\n private static void cycleTests() throws CALExecutorException {\\r\\n \\r\\n final ImmutableDirectedGraph<Integer> noCycles = ImmutableDirectedGraph\\r\\n .makeGraph(\\r\\n Collections.<Integer>emptyList(),\\r\\n Arrays.asList(Pair.make(1, 2), Pair.make(2, 3), Pair.make(1, 3)),\\r\\n executionContext);\\r\\n \\r\\n final ImmutableDirectedGraph<Integer> lengthOneCycle = ImmutableDirectedGraph\\r\\n .makeGraph(\\r\\n Collections.<Integer>emptyList(),\\r\\n Arrays.asList(Pair.make(1, 1)),\\r\\n executionContext);\\r\\n \\r\\n final ImmutableDirectedGraph<Integer> lengthTwoCycle = ImmutableDirectedGraph\\r\\n .makeGraph(\\r\\n Collections.<Integer>emptyList(),\\r\\n Arrays.asList(Pair.make(1, 2), Pair.make(2, 1)),\\r\\n executionContext);\\r\\n \\r\\n System.out.println(\\\"noCycle.findCycle(): \\\" + noCycles.findCycle());\\r\\n System.out.println(\\\"oneCycle.findCycle(): \\\" + lengthOneCycle.findCycle());\\r\\n System.out.println(\\\"twoCycle.findCycle(): \\\" + lengthTwoCycle.findCycle());\\r\\n }\",\n \"private boolean checkCycle() {\\n for (int i = 0; i < 26; i++) {\\n color[i] = 0;\\n }\\n for (int i = 0; i < 26; i++) {\\n if (color[i] != -1 && BFS(i)) return true;\\n }\\n return false;\\n }\",\n \"public boolean detectCycles()\\n {\\n try {\\n execute(null, null);\\n } catch (CycleDetectedException ex) {\\n return true;\\n }\\n\\n return false;\\n }\",\n \"private static boolean isCycle(Graph graph) {\\n for (int i = 0; i < graph.edges.length; ++i) {\\n int x = graph.find(graph.edges[i][0]);\\n int y = graph.find(graph.edges[i][1]);\\n\\n // if both subsets are same, then there is cycle in graph.\\n if (x == y) {\\n // for edge 2-0 : parent of 0 is 2 == 2 and so we detected a cycle\\n return true;\\n }\\n // keep doing union/merge of sets\\n graph.union(x, y);\\n }\\n return false;\\n }\",\n \"int isCycle( Graph graph){\\n int parent[] = new int[graph.V]; \\n \\n // Initialize all subsets as single element sets \\n for (int i=0; i<graph.V; ++i) \\n parent[i]=-1; \\n \\n // Iterate through all edges of graph, find subset of both vertices of every edge, if both subsets are same, then there is cycle in graph. \\n for (int i = 0; i < graph.E; ++i){ \\n int x = graph.find(parent, graph.edge[i].src); \\n int y = graph.find(parent, graph.edge[i].dest); \\n \\n if (x == y) \\n return 1; \\n \\n graph.Union(parent, x, y); \\n } \\n return 0; \\n }\",\n \"private boolean hasCycle()\\r\\n {\\r\\n boolean passed = false;\\r\\n for(Field.RadioData dst=radioList; dst!=null; dst=dst.next)\\r\\n {\\r\\n if(dst==radioList && passed) return true;\\r\\n passed = true;\\r\\n }\\r\\n return false;\\r\\n }\",\n \"private boolean hasCycle1() {\\n\\t\\tNode slow = head;\\n\\t\\tNode fast = head;\\n\\t\\t\\n\\t\\twhile (fast != null && fast.next != null) {\\n\\t\\t\\tslow = slow.next;\\n\\t\\t\\tfast = fast.next.next;\\n\\t\\t\\tif(slow == fast) {\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn false;\\n\\t}\",\n \"private boolean hasCycle() {\\n\\t\\tNode n = head;\\n\\t\\tSet<Node> nodeSeen = new HashSet<>();\\n\\t\\twhile (nodeSeen != null) {\\n\\t\\t\\tif (nodeSeen.contains(n)) {\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tnodeSeen.add(n);\\n\\t\\t\\t}\\n\\t\\t\\tn = n.next;\\n\\t\\t}\\n\\t\\treturn false;\\n\\t}\",\n \"boolean cycle() {\\n int j;\\t\\t\\t\\t\\t\\t// If cycle detected report as negative edge weight cycle.\\n for (j = 0; j < e; ++j)\\n if (d[edges.get(j).u] + edges.get(j).w < d[edges.get(j).v])\\n return false;\\n return true;\\n }\",\n \"boolean detectCycleUndirected(ArrayList<Integer> G[]) {\\n\\t\\tint[] vis = new int[G.length];\\n\\t\\tfor (int i = 0; i < G.length; i++) {\\n\\t\\t\\tif (vis[i] == 0) {\\n\\t\\t\\t\\tif (detectCycleUtil(G, i, vis, -1))\\n\\t\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn false;\\n\\t}\",\n \"boolean hasCycle() {\\n if (head == null){\\n return false;\\n }\\n Node slow = head;\\n Node fast = head;\\n while (slow != null && fast != null && fast.next != null){\\n slow = slow.next;\\n fast = fast.next.next;\\n if (slow == fast){\\n return true;\\n }\\n }\\n return false;\\n }\",\n \"private void treatCycles(SDFGraph graph) throws InvalidExpressionException {\\r\\n\\t\\tList<Set<SDFAbstractVertex>> cycles = new ArrayList<Set<SDFAbstractVertex>>();\\r\\n\\t\\tCycleDetector<SDFAbstractVertex, SDFEdge> detector = new CycleDetector<SDFAbstractVertex, SDFEdge>(\\r\\n\\t\\t\\t\\tgraph);\\r\\n\\t\\tList<SDFAbstractVertex> vertices = new ArrayList<SDFAbstractVertex>(\\r\\n\\t\\t\\t\\tgraph.vertexSet());\\r\\n\\t\\twhile (vertices.size() > 0) {\\r\\n\\t\\t\\tSDFAbstractVertex vertex = vertices.get(0);\\r\\n\\t\\t\\tSet<SDFAbstractVertex> cycle = detector\\r\\n\\t\\t\\t\\t\\t.findCyclesContainingVertex(vertex);\\r\\n\\t\\t\\tif (cycle.size() > 0) {\\r\\n\\t\\t\\t\\tvertices.removeAll(cycle);\\r\\n\\t\\t\\t\\tcycles.add(cycle);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tvertices.remove(vertex);\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tfor (Set<SDFAbstractVertex> cycle : cycles) {\\r\\n\\t\\t\\tint gcd = gcdOfVerticesVrb(cycle);\\r\\n\\t\\t\\tif (gcd > 1 && !(graph instanceof PSDFGraph)) {\\r\\n\\t\\t\\t\\tcopyCycle(graph, cycle, gcd);\\r\\n\\t\\t\\t} else if (!(graph instanceof PSDFGraph)) {\\r\\n\\t\\t\\t\\ttreatPSDFCycles(graph, cycle);\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\t// SDFIterator sdfIterator = new SDFIterator(graph);\\r\\n\\t\\t// List<SDFAbstractVertex> orderedList = new\\r\\n\\t\\t// ArrayList<SDFAbstractVertex>();\\r\\n\\t\\t// while (sdfIterator.hasNext()) {\\r\\n\\t\\t// SDFAbstractVertex current = sdfIterator.next();\\r\\n\\t\\t// orderedList.add(current);\\r\\n\\t\\t// if (current instanceof SDFRoundBufferVertex) {\\r\\n\\t\\t// int nbTokens = 0;\\r\\n\\t\\t// for (SDFEdge edgeData : graph.outgoingEdgesOf(current)) {\\r\\n\\t\\t// nbTokens = edgeData.getProd().intValue();\\r\\n\\t\\t// }\\r\\n\\t\\t// for (int i = orderedList.size() - 1; i >= 0; i--) {\\r\\n\\t\\t// if (graph.getAllEdges(orderedList.get(i), current).size() == 1) {\\r\\n\\t\\t// if (nbTokens <= 0) {\\r\\n\\t\\t// graph.removeAllEdges(orderedList.get(i), current);\\r\\n\\t\\t// } else {\\r\\n\\t\\t// for (SDFEdge thisEdge : graph.getAllEdges(\\r\\n\\t\\t// orderedList.get(i), current)) {\\r\\n\\t\\t// nbTokens = nbTokens\\r\\n\\t\\t// - thisEdge.getProd().intValue();\\r\\n\\t\\t// }\\r\\n\\t\\t// }\\r\\n\\t\\t// }\\r\\n\\t\\t// }\\r\\n\\t\\t// // traiter le roundBuffer pour le supprimer\\r\\n\\t\\t// if (graph.incomingEdgesOf(current).size() == 1\\r\\n\\t\\t// && graph.outgoingEdgesOf(current).size() == 1) {\\r\\n\\t\\t// SDFAbstractVertex source = ((SDFEdge) graph\\r\\n\\t\\t// .incomingEdgesOf(current).toArray()[0]).getSource();\\r\\n\\t\\t// SDFEdge oldEdge = ((SDFEdge) graph.incomingEdgesOf(current)\\r\\n\\t\\t// .toArray()[0]);\\r\\n\\t\\t// SDFAbstractVertex target = ((SDFEdge) graph\\r\\n\\t\\t// .outgoingEdgesOf(current).toArray()[0]).getTarget();\\r\\n\\t\\t// SDFEdge refEdge = ((SDFEdge) graph.outgoingEdgesOf(current)\\r\\n\\t\\t// .toArray()[0]);\\r\\n\\t\\t// SDFEdge newEdge = graph.addEdge(source, target);\\r\\n\\t\\t// newEdge.copyProperties(refEdge);\\r\\n\\t\\t// graph.removeEdge(refEdge);\\r\\n\\t\\t// graph.removeEdge(oldEdge);\\r\\n\\t\\t// graph.removeVertex(current);\\r\\n\\t\\t// orderedList.remove(current);\\r\\n\\t\\t// } else if (graph.incomingEdgesOf(current).size() == 1\\r\\n\\t\\t// && graph.outgoingEdgesOf(current).size() > 1) {\\r\\n\\t\\t//\\r\\n\\t\\t// } else if (graph.incomingEdgesOf(current).size() > 1\\r\\n\\t\\t// && graph.outgoingEdgesOf(current).size() == 1) {\\r\\n\\t\\t//\\r\\n\\t\\t// }\\r\\n\\t\\t// }\\r\\n\\t\\t// }\\r\\n\\t\\t/*\\r\\n\\t\\t * { CycleDetector<SDFAbstractVertex, SDFEdge> detect = new\\r\\n\\t\\t * CycleDetector<SDFAbstractVertex, SDFEdge>( graph);\\r\\n\\t\\t * List<SDFAbstractVertex> vert = new ArrayList<SDFAbstractVertex>(\\r\\n\\t\\t * graph.vertexSet()); while (vert.size() > 0) { SDFAbstractVertex\\r\\n\\t\\t * vertex = vert.get(0); Set<SDFAbstractVertex> cycle = detect\\r\\n\\t\\t * .findCyclesContainingVertex(vertex); if (cycle.size() > 0) {\\r\\n\\t\\t * vert.removeAll(cycle); cycles.add(cycle); } vert.remove(vertex); } }\\r\\n\\t\\t */\\r\\n\\r\\n\\t\\treturn;\\r\\n\\t}\",\n \"public static boolean hasCycle( IntNode head ) {\\r\\n\\t\\r\\n\\t\\tfor( IntNode cursor = head; cursor != null; cursor = cursor.link ) {\\r\\n\\t\\t\\t// otherwise should return false if the list is acyclic\\r\\n\\t\\t\\tif( cursor.link == null )\\r\\n\\t\\t\\t\\treturn false;\\r\\n\\t\\t}\\r\\n\\t\\t// should return true if it is cyclic\\r\\n\\t\\treturn true;\\r\\n\\t\\t\\r\\n\\t}\",\n \"public ListNode detectCycle(ListNode head) {\\n if (null == head || null == head.next) return null;\\n ListNode cur = head.next, runner = head.next.next;\\n while (null != runner && null != runner.next & cur != runner) {\\n cur = cur.next;\\n runner = runner.next.next;\\n }\\n if (cur == runner) {\\n cur = head;\\n while (runner != cur) {\\n cur = cur.next;\\n runner = runner.next;\\n }\\n return cur;\\n }\\n return null;\\n }\",\n \"public ListNode detectCycle(ListNode head) {\\n ListNode walker = head;\\n ListNode runner = head;\\n \\n while(runner != null && runner.next != null) {\\n runner = runner.next.next;\\n walker = walker.next;\\n \\n if (runner == walker) {\\n while(walker != head) {\\n head = head.next;\\n walker = walker.next;\\n }\\n \\n return head;\\n }\\n }\\n \\n return null;\\n }\",\n \"public boolean hasCycle() {\\r\\n\\t\\tSet<Vertex> visited = new HashSet<Vertex>();\\r\\n\\t\\tSet<Vertex> path = new HashSet<Vertex>();\\r\\n\\r\\n\\t\\t// Call the helper function to detect cycle for all vertices one by one\\r\\n\\t\\tfor (int i = 0; i < N; ++i)\\r\\n\\t\\t\\tif (detectCycle(this.vertices[i], visited, path))\\r\\n\\t\\t\\t\\treturn true;\\r\\n\\r\\n\\t\\treturn false;\\r\\n\\t}\",\n \"public void DFS2() {\\n boolean[] visited = new boolean[numVertices];\\n int[] predecessors = new int[numVertices];\\n for (int i = 0; i < numVertices; i++) {\\n if (visited[i] == false && hasCycle(0, visited, predecessors)) {\\n System.out.println(\\\"Cycle has found\\\");\\n return;\\n }\\n }\\n System.out.println(\\\"No cycle found in the graph\\\");\\n }\",\n \"@Test\\n public void TestIfNoCycle() {\\n final int NUMBER_OF_ELEMENTS = 100;\\n TripleList<Integer> tripleList = new TripleList<>();\\n for (int i = 0; i < NUMBER_OF_ELEMENTS; ++i) {\\n tripleList.add(i);\\n }\\n /**\\n * Created 2 TripleLists, first jumps every single element, another\\n * every two elements, in out case every two elements means every\\n * NextElement*\\n */\\n TripleList<Integer> tripleListEverySingleNode = tripleList;\\n TripleList<Integer> tripleListEveryTwoNodes = tripleList.getNext();\\n for (int i = 0; i < NUMBER_OF_ELEMENTS * NUMBER_OF_ELEMENTS; ++i) {\\n Assert.assertNotSame(tripleListEverySingleNode, tripleListEveryTwoNodes);\\n //JumpToNextElement(ref tripleListEverySingleNode);\\n if (null == tripleListEveryTwoNodes.getNext()) {\\n // if list has end means there are no cycles\\n break;\\n } else {\\n tripleListEveryTwoNodes = tripleListEveryTwoNodes.getNext();\\n }\\n }\\n }\",\n \"public static void main(String args[])\\n {\\n LinkedList list = new LinkedList();\\n\\n list.add(1);\\n list.add(2);\\n list.add(3);\\n list.add(4);\\n list.add(5);\\n\\n // loop\\n list.head.next.next.next = list.head;\\n\\n System.out.println(list.hasCycle());\\n }\",\n \"static boolean hasCycle(Node head) {\\n\\t\\t\\n\\t\\tif(head == null) return false;\\n\\t\\t\\n\\t\\t//Using the concept of one pointer moving faster than another, since at some point both will meet \\n\\t\\t//at the same point and close a cycle (if any).\\n\\t\\tNode slowPointerNode = head;\\n\\t\\tNode fastPointerNode = head.getNext();\\n\\t\\t\\n\\t\\twhile(fastPointerNode != null && fastPointerNode.getNext() != null) {\\n\\t\\t\\tif(slowPointerNode == fastPointerNode) {\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t\\tslowPointerNode = slowPointerNode.getNext();\\n\\t\\t\\tfastPointerNode = fastPointerNode.getNext().getNext();\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn false;\\n\\t}\",\n \"@Test\\n void findCycle() {\\n Map<String, Set<String>> nonCyclicGraph = Map.of(\\n \\\"0\\\", Set.of(\\\"a\\\", \\\"b\\\", \\\"c\\\"),\\n \\\"a\\\", Set.of(\\\"0\\\", \\\"a2\\\", \\\"a3\\\"),\\n \\\"a2\\\", Set.of(\\\"a\\\"),\\n \\\"a3\\\", Set.of(\\\"a\\\"),\\n \\\"b\\\", Set.of(\\\"0\\\", \\\"b2\\\"),\\n \\\"b2\\\", Set.of(\\\"b\\\"),\\n \\\"c\\\", Set.of(\\\"0\\\")\\n );\\n assertThat(solution.findCycle(nonCyclicGraph)).isFalse();\\n\\n // 0\\n // / | \\\\\\n // a b c\\n // /\\\\ | /\\n // a2 a3 b2\\n Map<String, Set<String>> cyclicGraph = Map.of(\\n \\\"0\\\", Set.of(\\\"a\\\", \\\"b\\\", \\\"c\\\"),\\n \\\"a\\\", Set.of(\\\"0\\\", \\\"a2\\\", \\\"a3\\\"),\\n \\\"a2\\\", Set.of(\\\"a\\\"),\\n \\\"a3\\\", Set.of(\\\"a\\\"),\\n \\\"b\\\", Set.of(\\\"0\\\", \\\"b2\\\"),\\n \\\"b2\\\", Set.of(\\\"b\\\"),\\n \\\"c\\\", Set.of(\\\"0\\\", \\\"b2\\\")\\n );\\n assertThat(solution.findCycle(cyclicGraph)).isTrue();\\n }\",\n \"public static boolean hasCycle(ListNode node) {\\n\\t\\treturn true;\\n\\t}\",\n \"boolean isCycle(SimpleVertex simpleVertex, int length) {\\n\\n\\t\\twhile (count != length) {\\n\\t\\t\\tif (simpleVertex.isVisited == false) {\\n\\t\\t\\t\\tsimpleVertex.isVisited = true;\\n\\t\\t\\t\\tcount++;\\n\\t\\t\\t\\tSystem.out.print(simpleVertex.Vertexname + \\\" \\\");\\n\\t\\t\\t\\tfor (int i = 0; i < simpleVertex.neighborhood.size(); i++) {\\n\\n\\t\\t\\t\\t\\tSimpleEdge node = simpleVertex.neighborhood.get(i);\\n\\t\\t\\t\\t\\tif (node.one.Vertexname == node.two.Vertexname) {\\n\\n\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"here ---------------\\\");\\n\\t\\t\\t\\t\\t\\tflag = true;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tisCycle(node.two, length);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t} else {\\n\\t\\t\\t\\treturn true;\\n\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn flag;\\n\\n\\t}\",\n \"private void findCycles(ClassDecl decl, String className, int numClasses){\\n\\t //base case: our decl is null, return and break out of this method\\n if (decl == null) {\\n return;\\n }\\n //base case: if numClasses is 0 and we see the name, its a cycle, throw error\\n else if(numClasses == 0 || decl.name.equals(className)) {\\n errorMsg.error(decl.pos, \\\"Circular reference found: \\\" + decl.name);\\n }\\n else { //recursive case, call findCycles on the remaining links\\n findCycles(decl.superLink, className, numClasses - 1);\\n }\\n }\",\n \"public void findLoop(NodeLoop first){\\n ArrayList<String> ids = new ArrayList<String>();\\n NodeLoop cur = first;\\n\\n //Finds Loop, if cur.next=null there was no loop\\n while(cur.next!=null){\\n\\n //Found Cycle\\n if(ids.contains(cur.id)){\\n System.out.println(\\\"Cycle Found, Begins at \\\" + cur.id);\\n break;\\n }\\n\\n //Add current id to list of id's\\n ids.add(cur.id);\\n cur = cur.next;\\n }\\n\\n //If no cycle found\\n if(cur.next==null){\\n System.out.println(\\\"No Cycle's Found\\\");\\n }\\n\\n }\",\n \"public boolean hasCycle(ListNode head) {\\n if(head == null || head.next == null){\\n return false;\\n }\\n\\n ListNode p1 = head.next;\\n ListNode p2 = head.next.next;\\n while(p1 != null && p2 != null){\\n if(p1 == p2){\\n return true;\\n }\\n p1 = p1.next;\\n p2 = p2.next;\\n if(p2 != null){\\n p2 = p2.next;\\n }\\n }\\n return false;\\n }\",\n \"@Test\\n public void testVerifyLoopTerminatesWhenCycleFound() throws Exception {\\n // Add more mocking detail to our dependencies first.\\n // ----------------------------------------------------\\n\\n DepChaser sut = createSut();\\n\\n // First mock our dependencyMap to know about variables a thru f\\n when(_dependencyMap.keySet()).thenReturn(new HashSet<>(Arrays.asList(\\\"a\\\", \\\"b\\\", \\\"c\\\", \\\"d\\\", \\\"e\\\", \\\"f\\\")));\\n\\n // ----------------------------------------------------------------------------------\\n // we're going to make it so it takes 2 iterations in DepChaser to handle a thru f\\n // ----------------------------------------------------------------------------------\\n\\n // The 1st time, our mocked checker is going to checkout no cycles in a, b, c variables\\n ChildrenDependencyChecker checker1 = mock(ChildrenDependencyChecker.class);\\n Exception exception = new Exception(\\\"fake exception\\\");\\n when(checker1.run()).thenThrow(exception);\\n\\n when(_dependencyCheckerFactory.create(\\\"a\\\", _dependencyMap, new HashSet<>())).thenReturn(checker1);\\n\\n Assert.assertFalse(sut.validateNoDependencyCycles());\\n verify(checker1, times(1)).run();\\n\\n // Verify no variables were verified\\n Assert.assertEquals(new HashSet<>(), sut.getVerifiedVariables());\\n // Verify the _dependencyCheckerFactory was only called once.\\n verify(_dependencyCheckerFactory, times(1)).create(\\\"a\\\", _dependencyMap, new HashSet<>());\\n verifyNoMoreInteractions(_dependencyCheckerFactory);\\n }\",\n \"static\\tListNode listCycle(ListNode a){\\n if(a==null || a.next==null || a.next.next==null){\\r\\n return null;\\r\\n }\\r\\n boolean cycleExists = false;\\r\\n ListNode fast = a.next.next;\\r\\n ListNode slow = a;\\r\\n while(slow.next!=null && fast.next !=null && fast.next.next!=null){\\r\\n if(fast==slow){\\r\\n //return cycleSize;\\r\\n //cycleExists = true;\\r\\n //break;\\r\\n return fast;\\r\\n }else{\\r\\n \\r\\n fast = fast.next.next;\\r\\n slow = slow.next;\\r\\n }\\r\\n\\r\\n }\\r\\n \\r\\n return null;\\r\\n\\t}\",\n \"boolean isCyclic() {\\n\\n // if we are processing the course currently that is a cyclic graph and we can't\\n // do all the courses\\n if (processed) {\\n return false;\\n }\\n\\n // if we already visited the course and no cycle was found then we can return\\n if (visited) {\\n return true;\\n }\\n //else we set the course and visited\\n visited = true;\\n\\n //we then loop through all the prerequisites performing the same check\\n for (Course preCourse : pre) {\\n if (preCourse.isCyclic()) {\\n return true;\\n }\\n }\\n\\n //if we arrive here then we have gone through all the combinations and there is no cyclic graph\\n visited = false;\\n processed = true;\\n return false;\\n }\",\n \"public static void main(String[] args) {\\n\\t\\tLinkedListCycle obj = new LinkedListCycle();\\n\\t\\tListNode node1 = obj.new ListNode(1);\\n\\t\\tListNode node2 = obj.new ListNode(2);\\n\\t\\tListNode node3 = obj.new ListNode(3);\\n\\t\\tListNode node4 = obj.new ListNode(4);\\n\\t\\tListNode node5 = obj.new ListNode(5);\\n\\t\\tListNode node6 = obj.new ListNode(6);\\n\\t\\tListNode node7 = obj.new ListNode(7);\\n\\t\\tnode1.next = node2;\\n\\t\\tnode2.next = node3;\\n\\t\\tnode3.next = node4;\\n\\t\\tnode4.next = node5;\\n\\t\\tnode5.next = node6;\\n\\t\\tnode6.next = node7;\\n\\t\\tnode7.next = node2;\\n\\t\\tSystem.out.println(obj.hasCycle(node1));\\n\\t}\",\n \"public boolean checkCyclesRecursive(Integer blockID, LinkedList<Integer> visited){\\n System.out.println(\\\"cc: (block \\\" + blockID + \\\") visited: \\\" + visited);\\n if(visited.contains(blockID)){\\n return false;\\n }\\n visited.add(blockID);\\n\\n /*for (Con connection : this.connections) {\\n if(connection.src == blockID){\\n LinkedList<Integer> new_visited = new LinkedList(visited);\\n if(checkCyclesRecursive(connection.dst, new_visited) == false){\\n return false;\\n }\\n }\\n }*/\\n\\n for(Type output : this.getBlockByID(blockID).outputs)\\n {\\n /*if(output.getFirstDstID() != -1) {\\n LinkedList<Integer> new_visited = new LinkedList(visited);\\n if(checkCyclesRecursive(output.getFirstDstID(), new_visited) == false){\\n return false;\\n }\\n }*/\\n for (Integer id : output.getAllDstID()) {\\n LinkedList<Integer> new_visited = new LinkedList(visited);\\n if(checkCyclesRecursive(id, new_visited) == false){\\n return false;\\n } \\n }\\n }\\n return true;\\n }\",\n \"public static void main(String[] args) {\\n ArrayList<Integer> input = new ArrayList<>(Arrays.asList(1, 2, -1, 2, 2));\\n System.out.println(\\\"has Cycle : \\\" + CycleCircularArray.hasCycle(input));\\n input = new ArrayList<>(Arrays.asList(2, 2, -1, 2));\\n System.out.println(\\\"has Cycle : \\\" + CycleCircularArray.hasCycle(input));\\n input = new ArrayList<>(Arrays.asList(2, 1, -1, -2));\\n System.out.println(\\\"has Cycle : \\\" + CycleCircularArray.hasCycle(input));\\n }\",\n \"public boolean hasCycle(Node<T> first) {\\n Iterator itOne = this.iterator();\\n Iterator itTwo = this.iterator();\\n try {\\n while (true) {\\n T one = (T) itOne.next();\\n itTwo.next();\\n T two = (T) itTwo.next();\\n if (one.equals(two)) {\\n return true;\\n }\\n }\\n } catch (NullPointerException ex) {\\n ex.printStackTrace();\\n }\\n return false;\\n }\",\n \"private boolean containsCycle(TransactionId tid) {\\n HashSet<TransactionId> visited = new HashSet<TransactionId>();\\n LinkedList<TransactionId> queue = new LinkedList<TransactionId>();\\n\\n queue.add(tid);\\n\\n while (!(queue.isEmpty())) {\\n TransactionId cur = queue.remove();\\n if (visited.contains(cur)) {\\n return true;\\n }\\n\\n visited.add(cur);\\n\\n if (this.dependencyMap.containsKey(cur) && !(this.dependencyMap.get(cur).isEmpty())) {\\n Iterator<TransactionId> it = this.dependencyMap.get(cur).iterator();\\n while (it.hasNext()) {\\n queue.add(it.next());\\n }\\n }\\n }\\n\\n return false;\\n }\",\n \"public Set<V> findCycles()\\n {\\n // ProbeIterator can't be used to handle this case,\\n // so use StrongConnectivityAlgorithm instead.\\n StrongConnectivityAlgorithm<V, E> inspector =\\n new KosarajuStrongConnectivityInspector<>(graph);\\n List<Set<V>> components = inspector.stronglyConnectedSets();\\n\\n // A vertex participates in a cycle if either of the following is\\n // true: (a) it is in a component whose size is greater than 1\\n // or (b) it is a self-loop\\n\\n Set<V> set = new LinkedHashSet<>();\\n for (Set<V> component : components) {\\n if (component.size() > 1) {\\n // cycle\\n set.addAll(component);\\n } else {\\n V v = component.iterator().next();\\n if (graph.containsEdge(v, v)) {\\n // self-loop\\n set.add(v);\\n }\\n }\\n }\\n\\n return set;\\n }\",\n \"private static boolean checkEulerCicleGraph() {// es cycle o es tour\\r\\n\\t\\tfor (int i = 0; i < V; i++) {\\r\\n\\t\\t\\tif (outdeg[i] % 2 == 1) {\\r\\n\\t\\t\\t\\treturn false;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\treturn true;\\r\\n\\t}\",\n \"public boolean hasCycle(ListNode head) {\\n ListNode p1 = head;\\n ListNode p2 = head;\\n while (p2 != null && p2.next != null) {\\n \\tp1 = p1.next;\\n \\tif (p2.next != null) {\\n \\t\\tp2 = p2.next.next;\\n \\t}\\n \\tif (p1 == p2) {\\n \\t\\treturn true;\\n \\t}\\n }\\n return false;\\n }\",\n \"public void logicCycles()throws Exception\\r\\n\\t{\\r\\n\\t\\t\\r\\n\\t\\twhile(isSolved() == false)\\r\\n\\t\\t{\\r\\n\\t\\t\\tint changesMade = 0;\\r\\n\\t\\t\\tdo\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tchangesMade = 0;\\r\\n\\t\\t\\t\\tchangesMade += logic1();\\r\\n\\t\\t\\t\\tchangesMade += logic2();\\r\\n\\t\\t\\t\\tchangesMade += logic3();\\r\\n\\t\\t\\t\\tchangesMade += logic4();\\r\\n\\t\\t\\t\\tif(errorFound())\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t}while(changesMade != 0);\\r\\n\\t\\r\\n\\t\\t}\\t\\t\\t\\r\\n\\t\\t\\r\\n\\t}\",\n \"boolean findCycleUtil(int i, boolean[] visited, boolean[] recStack, LinkedList<Integer>[] g) {\\n if (recStack[i]) {\\n return true;\\n }\\n if (visited[i]) {\\n return false;\\n }\\n visited[i] = true;\\n recStack[i] = true;\\n for (int c : g[i]) {\\n if (findCycleUtil(c, visited, recStack, g)) {\\n return true;\\n }\\n }\\n recStack[i] = false;\\n return false;\\n }\",\n \"public boolean isCycle(int V, ArrayList<ArrayList<Integer>> adj)\\n {\\n boolean visited[] = new boolean[V];\\n Arrays.fill(visited, false);\\n \\n for(int i = 0;i<V;i++)\\n {\\n if(!visited[i] && isCyclicU(i, V, visited, adj))\\n return true;\\n }\\n \\n return false;\\n \\n }\",\n \"public boolean hasCycle(int g) {\\n\\t\\t//TODO\\n\\t}\",\n \"public ListNode detectCycle(ListNode head) {\\n\\t\\tListNode fast,slow;\\n\\t\\tfast=slow=head;\\n\\t\\twhile(fast!=null & fast.next()!=null) {\\n\\t\\t\\tfast=fast.next().next();\\n\\t\\t\\tslow=slow.next();\\t\\t\\n\\t\\t\\t//First meet\\n\\t\\t\\tif (fast==slow) {\\t\\t\\t\\t\\t\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//Put slow at head ,they meet after k-m steps\\n\\t\\tslow=head;\\n\\t\\twhile(slow!=fast) {\\n\\t\\t\\tfast=fast.next();\\n\\t\\t\\tslow=slow.next();\\n\\t\\t}\\n\\t\\treturn slow;\\n\\t}\",\n \"public ListNode detectCycle(ListNode head) {\\n if (head == null || head.next == null) return null;\\n ListNode slow = head;\\n ListNode fast = head;\\n while (fast != null && fast.next != null) {\\n slow = slow.next;\\n fast = fast.next.next;\\n if (fast == slow) {\\n ListNode slow2 = head;\\n while (slow != slow2) {\\n slow = slow.next;\\n slow2 = slow2.next;\\n }\\n return slow;\\n }\\n }\\n return null;\\n }\",\n \"public boolean hasCycle(ListNode head) {\\n if(head == null || head.next == null){\\n return false;\\n }\\n Set<ListNode> nodes = new HashSet<ListNode>();\\n ListNode cur = head;\\n while(cur != null){\\n if(nodes.contains(cur)){\\n return true;\\n }\\n nodes.add(cur);\\n cur = cur.next;\\n }\\n return false;\\n }\",\n \"public boolean isFirstCycle() {\\n return cycle == 0;\\n }\",\n \"public static boolean hasCycle1(ListNode head) {\\n Set<ListNode> visited = new HashSet<>();\\n\\n while (head != null) {\\n if (visited.contains(head)) {\\n return true;\\n }\\n visited.add(head);\\n head = head.next;\\n }\\n\\n return false;\\n }\",\n \"int hasCycle(Node head) {\\n\\t// If list is null\\n\\tif(head == null) {\\n\\t\\t// No cycle\\n\\t\\treturn 0;\\n\\t}\\n\\n\\tSet<Node> visitedNodes = new HashSet<Node>();\\n\\t\\n\\tNode current = head;\\n\\n\\t// Loop through the list\\n\\twhile(current != null) {\\n\\t\\t// If we have seen this node befor\\n\\t\\tif(visitedNodes.contains(current)) {\\n\\t\\t\\treturn 1;\\n\\t\\t}\\n\\n\\t\\t// Add it to the set\\n\\t\\tvisitedNodes.add(current);\\n\\n\\t\\t// Update current\\n\\t\\tcurrent = current.next;\\n\\t}\\n\\n\\t// If we get here, there are no cycles\\n\\treturn 0;\\n}\",\n \"boolean hasCycle(Node head) {\\n node = head;\\n //h.add(node.data);//just add the first one //node = node.next; //get to the next one where we, at 2nd best case, will Find Cycle\\n while (node.next != null){\\n if ( h.contains(node.data) ){\\n return true;\\n }else {\\n h.add(node.data);\\n }\\n node = node.next;\\n }\\n return false;\\n }\",\n \"@Test public void testPublic13() {\\n Graph<Integer> graph= TestGraphs.testGraph4();\\n int i;\\n\\n for (i= 0; i < 4; i++)\\n assertTrue(graph.isInCycle(i));\\n\\n assertFalse(graph.isInCycle(4));\\n }\",\n \"public ListNode detectCycle(ListNode head) {\\n\\n\\t\\tListNode fast = head;\\n\\t\\tListNode slow = head;\\n\\n\\t\\twhile (fast != null && fast.next != null) {\\n\\t\\t\\tfast = fast.next.next;\\n\\t\\t\\tslow = slow.next;\\n\\t\\t\\tif (slow == fast) {\\n\\t\\t\\t\\tListNode slow2 = head;\\n\\t\\t\\t\\twhile (slow2 != slow) {\\n\\t\\t\\t\\t\\tslow2 = slow2.next;\\n\\t\\t\\t\\t\\tslow = slow.next;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn slow;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn null;\\n\\t}\",\n \"public boolean hasCycle2(ListNode head) {\\n if (head == null || head.next == null) {\\n return false;\\n }\\n\\n ListNode p1 = head;\\n ListNode p2 = head.next.next;\\n\\n while (p2 != null && p2.next != null) {\\n p1 = p1.next;\\n p2 = p2.next.next;\\n\\n if (p1 == p2) {\\n return true;\\n }\\n }\\n\\n return false;\\n }\",\n \"public static boolean cycleInGraph(int[][] edges) {\\n int numberOfNodes = edges.length;\\n int[] colors = new int[numberOfNodes]; // By default, 0 (WHITE)\\n\\n for (int i = 0; i < numberOfNodes; i++) {\\n\\n if (colors[i] != WHITE) // If already visited/finished.\\n continue;\\n\\n boolean isCycle = traverseAndMarkColor(edges, i, colors);\\n\\n if (isCycle)\\n return true;\\n }\\n return false;\\n }\",\n \"private static boolean findCyclesInSCC(\\n ARGState pStartState,\\n ARGState pCurrentState,\\n Set<ARGState> pBlockedSet,\\n SetMultimap<ARGState, ARGState> pBlockedMap,\\n Deque<ARGState> pStack,\\n List<List<ARGState>> pAllCycles,\\n Set<ARGState> pExcludeSet) {\\n\\n if (pExcludeSet.contains(pCurrentState)) {\\n // Do not regard nodes which were deliberately put into a set of excluded states\\n return false;\\n }\\n\\n boolean foundCycle = false;\\n pStack.push(pCurrentState);\\n pBlockedSet.add(pCurrentState);\\n\\n for (ARGState successor : pCurrentState.getChildren()) {\\n // If the successor is equal to the startState, a cycle has been found.\\n // Store contents of stack in the final result.\\n if (successor.equals(pStartState)) {\\n List<ARGState> cycle = new ArrayList<>();\\n pStack.push(pStartState);\\n cycle.addAll(pStack);\\n Collections.reverse(cycle);\\n pStack.pop();\\n pAllCycles.add(cycle);\\n foundCycle = true;\\n } else if (!pBlockedSet.contains(successor)) {\\n // Explore this successor only if it is not already in the blocked set.\\n boolean gotCycle =\\n findCyclesInSCC(\\n pStartState, successor, pBlockedSet, pBlockedMap, pStack, pAllCycles, pExcludeSet);\\n foundCycle = foundCycle || gotCycle;\\n }\\n }\\n\\n if (foundCycle) {\\n unblock(pCurrentState, pBlockedSet, pBlockedMap);\\n } else {\\n for (ARGState s : pCurrentState.getChildren()) {\\n pBlockedMap.put(s, pCurrentState);\\n }\\n }\\n pStack.pop();\\n\\n return foundCycle;\\n }\",\n \"boolean isCycleUndirected(SimpleVertex simpleVertex, SimpleVertex parent) {\\n\\t\\tsimpleVertex.parent = parent;\\n\\n\\t\\twhile (true) {\\n\\t\\t\\tif (simpleVertex.isVisited == false) {\\n\\t\\t\\t\\tsimpleVertex.isVisited = true;\\n\\t\\t\\t\\tSystem.out.print(simpleVertex.Vertexname + \\\" \\\");\\n\\t\\t\\t\\tfor (int i = 0; i < simpleVertex.neighborhood.size(); i++) {\\n\\n\\t\\t\\t\\t\\tSimpleEdge node = simpleVertex.neighborhood.get(i);\\n\\t\\t\\t\\t\\tnode.EdgeVisited = true;\\n\\t\\t\\t\\t\\t/*\\n\\t\\t\\t\\t\\t * if(simpleVertex.isVisited==node.two.isVisited){\\n\\t\\t\\t\\t\\t * System.out.println(\\\"cycle present\\\"); flagUndirected=true; return\\n\\t\\t\\t\\t\\t * flagUndirected; }\\n\\t\\t\\t\\t\\t */\\n\\n\\t\\t\\t\\t\\tif (simpleVertex.parent != null && node.two.Vertexname == simpleVertex.parent.Vertexname)\\n\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"skip\\\");\\n\\t\\t\\t\\t\\telse if (node.two.isVisited == true) {\\n\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"Graph contains a cycle\\\");\\n\\t\\t\\t\\t\\t\\tflagUndirected = true;\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tisCycleUndirected(node.two, simpleVertex);\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\treturn flagUndirected;\\n\\n\\t}\",\n \"@Test\\n public void shouldThrowCyclicDependencyExceptionIfACycleIsDetected_DownstreamOfCurrentWasUpstreamOfCurrentAtSomePoint() {\\n String grandParent = \\\"grandParent\\\";\\n String parent = \\\"parent\\\";\\n String child = \\\"child\\\";\\n String currentPipeline = \\\"current\\\";\\n ValueStreamMap graph = new ValueStreamMap(currentPipeline, null);\\n graph.addDownstreamNode(new PipelineDependencyNode(child, child), currentPipeline);\\n graph.addDownstreamNode(new PipelineDependencyNode(grandParent, grandParent), child);\\n graph.addUpstreamNode(new PipelineDependencyNode(parent, parent), null, currentPipeline);\\n graph.addUpstreamNode(new PipelineDependencyNode(grandParent, grandParent), null, parent);\\n graph.addUpstreamMaterialNode(new SCMDependencyNode(\\\"g\\\",\\\"g\\\",\\\"git\\\") , null, grandParent, new MaterialRevision(null));\\n graph.addUpstreamMaterialNode(new SCMDependencyNode(\\\"g\\\",\\\"g\\\",\\\"git\\\") , null, parent, new MaterialRevision(null));\\n\\n assertThat(graph.hasCycle(), is(true));\\n }\",\n \"@Test\\n public void cyclicalGraphs1Test() throws Exception {\\n // NOTE: we can't use the parser to create a circular graph because\\n // vector clocks are partially ordered and do not admit cycles. So we\\n // have to create circular graphs manually.\\n ChainsTraceGraph g1 = new ChainsTraceGraph();\\n List<EventNode> g1Nodes = addNodesToGraph(g1, new String[] { \\\"a\\\", \\\"a\\\",\\n \\\"a\\\" });\\n // Create a loop in g1, with 3 nodes\\n g1Nodes.get(0).addTransition(g1Nodes.get(1), Event.defTimeRelationStr);\\n g1Nodes.get(1).addTransition(g1Nodes.get(2), Event.defTimeRelationStr);\\n g1Nodes.get(2).addTransition(g1Nodes.get(0), Event.defTimeRelationStr);\\n exportTestGraph(g1, 0);\\n\\n ChainsTraceGraph g2 = new ChainsTraceGraph();\\n List<EventNode> g2Nodes = addNodesToGraph(g2, new String[] { \\\"a\\\", \\\"a\\\" });\\n // Create a loop in g2, with 2 nodes\\n g2Nodes.get(0).addTransition(g2Nodes.get(1), Event.defTimeRelationStr);\\n g2Nodes.get(1).addTransition(g2Nodes.get(0), Event.defTimeRelationStr);\\n exportTestGraph(g2, 1);\\n\\n testKEqual(g1Nodes.get(0), g2Nodes.get(0), 1);\\n testKEqual(g1Nodes.get(0), g2Nodes.get(0), 2);\\n testKEqual(g1Nodes.get(0), g2Nodes.get(0), 3);\\n testKEqual(g1Nodes.get(0), g2Nodes.get(0), 4);\\n\\n ChainsTraceGraph g3 = new ChainsTraceGraph();\\n List<EventNode> g3Nodes = addNodesToGraph(g2, new String[] { \\\"a\\\" });\\n // Create a loop in g3, from a to itself\\n g3Nodes.get(0).addTransition(g3Nodes.get(0), Event.defTimeRelationStr);\\n exportTestGraph(g3, 2);\\n\\n testKEqual(g3Nodes.get(0), g2Nodes.get(0), 1);\\n testKEqual(g3Nodes.get(0), g2Nodes.get(0), 2);\\n testKEqual(g3Nodes.get(0), g2Nodes.get(0), 3);\\n\\n ChainsTraceGraph g4 = new ChainsTraceGraph();\\n List<EventNode> g4Nodes = addNodesToGraph(g2, new String[] { \\\"a\\\" });\\n exportTestGraph(g4, 2);\\n\\n testKEqual(g4Nodes.get(0), g2Nodes.get(0), 1);\\n testNotKEqual(g4Nodes.get(0), g2Nodes.get(0), 2);\\n testNotKEqual(g4Nodes.get(0), g2Nodes.get(0), 3);\\n testNotKEqual(g4Nodes.get(0), g2Nodes.get(0), 4);\\n }\",\n \"public boolean hasCycle(ListNode head) {\\n\\t\\tListNode fast,slow;\\n\\t\\tfast=slow=head;\\n\\t\\twhile(fast!=null & fast.next()!=null) {\\n\\t\\t\\tfast=fast.next().next();\\n\\t\\t\\tslow=slow.next();\\n\\t\\t\\t//Meet at a point\\n\\t\\t\\tif (fast==slow) {\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn false;\\n\\t\\t\\n\\t}\",\n \"public boolean hasCycle(ListNode head) {\\n if (head == null) {\\n return false;\\n }\\n ListNode slow = head;\\n ListNode fast = head;\\n \\n while (slow != null) {\\n slow = slow.next;\\n if (fast != null && fast.next != null) {\\n fast = fast.next.next;\\n } else {\\n return false;\\n }\\n if (slow == fast)\\n return true;\\n }\\n return false;\\n }\",\n \"static boolean isCorrectCycle(Vertex v, LinkedList<Vertex> cycle, int print) {\\r\\n\\r\\n boolean ret = true;\\r\\n\\r\\n if (print > 1)\\r\\n System.out.println(\\\"Checking cycle with vertex \\\" + v + \\\": \\\" + cycle);\\r\\n\\r\\n // check for invalid parameters\\r\\n if (v == null || cycle == null || cycle.isEmpty()) {\\r\\n if (print > 0)\\r\\n System.out.println(\\\"null or empty parameter, no check\\\");\\r\\n return false;\\r\\n }\\r\\n\\r\\n // check for too short cycles, 4 is minimum (v-x-y-v)\\r\\n if (cycle.size() < 4) {\\r\\n if (print > 0)\\r\\n System.out.println(\\\"too short cycle: \\\" + cycle.size());\\r\\n ret = false;\\r\\n }\\r\\n\\r\\n // check for correct first and last in cycle\\r\\n if (cycle.getFirst() != v) {\\r\\n if (print > 0)\\r\\n System.out.println(\\\"Wrong first vertex \\\" + cycle.getFirst());\\r\\n ret = false;\\r\\n }\\r\\n if (cycle.getLast() != v) {\\r\\n if (print > 0)\\r\\n System.out.println(\\\"Wrong last vertex \\\" + cycle.getLast());\\r\\n ret = false;\\r\\n }\\r\\n\\r\\n // extra: check if first and last are different (other than v)\\r\\n\\r\\n // check that all successive vertices in list are adjacent in graph\\r\\n\\r\\n ListIterator<Vertex> li = cycle.listIterator();\\r\\n Vertex prev = null;\\r\\n while (li.hasNext()) {\\r\\n Vertex w = li.next();\\r\\n if (prev != null && ! prev.isAdjacent(w)) {\\r\\n if (print > 0)\\r\\n System.out.println(\\\"No edge between \\\" + prev + \\\" and \\\" + w);\\r\\n ret = false;\\r\\n }\\r\\n // check that v is not in the middle of cycle\\r\\n if (prev != null && li.hasNext() && w == v) {\\r\\n if (print > 0)\\r\\n System.out.println(\\\"Required vertex \\\" + v + \\\" in the middle of cycle\\\");\\r\\n ret = false;\\r\\n }\\r\\n\\r\\n prev = w;\\r\\n } // while\\r\\n\\r\\n if (print > 1 && ret)\\r\\n System.out.println(\\\"Valid cycle\\\");\\r\\n\\r\\n return ret;\\r\\n\\r\\n }\",\n \"public boolean hasSelfLoops();\",\n \"public boolean hasCycle(ListNode head) {\\r\\n\\t\\tListNode fast = head;\\r\\n\\t\\tListNode slow = head;\\r\\n\\r\\n\\t\\twhile (fast != null && fast.next != null) {\\r\\n\\t\\t\\tslow = slow.next;\\r\\n\\t\\t\\tfast = fast.next.next;\\r\\n\\r\\n\\t\\t\\tif (slow == fast) {\\r\\n\\t\\t\\t\\treturn true;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\treturn true;\\r\\n\\t}\",\n \"public boolean reducible() {\\n if (dfsTree.back.isEmpty()) {\\n return true;\\n }\\n int size = controlFlow.transitions.length;\\n boolean[] loopEnters = dfsTree.loopEnters;\\n TIntHashSet[] cycleIncomings = new TIntHashSet[size];\\n // really this may be array, since dfs already ensures no duplicates\\n TIntArrayList[] nonCycleIncomings = new TIntArrayList[size];\\n int[] collapsedTo = new int[size];\\n int[] queue = new int[size];\\n int top;\\n for (int i = 0; i < size; i++) {\\n if (loopEnters[i]) {\\n cycleIncomings[i] = new TIntHashSet();\\n }\\n nonCycleIncomings[i] = new TIntArrayList();\\n collapsedTo[i] = i;\\n }\\n\\n // from whom back connections\\n for (Edge edge : dfsTree.back) {\\n cycleIncomings[edge.to].add(edge.from);\\n }\\n // from whom ordinary connections\\n for (Edge edge : dfsTree.nonBack) {\\n nonCycleIncomings[edge.to].add(edge.from);\\n }\\n\\n for (int w = size - 1; w >= 0 ; w--) {\\n top = 0;\\n // NB - it is modified later!\\n TIntHashSet p = cycleIncomings[w];\\n if (p == null) {\\n continue;\\n }\\n TIntIterator iter = p.iterator();\\n while (iter.hasNext()) {\\n queue[top++] = iter.next();\\n }\\n\\n while (top > 0) {\\n int x = queue[--top];\\n TIntArrayList incoming = nonCycleIncomings[x];\\n for (int i = 0; i < incoming.size(); i++) {\\n int y1 = collapsedTo[incoming.getQuick(i)];\\n if (!dfsTree.isDescendant(y1, w)) {\\n return false;\\n }\\n if (y1 != w && p.add(y1)) {\\n queue[top++] = y1;\\n }\\n }\\n }\\n\\n iter = p.iterator();\\n while (iter.hasNext()) {\\n collapsedTo[iter.next()] = w;\\n }\\n }\\n\\n return true;\\n }\",\n \"private boolean findCycles(int v, int s, Vector<Integer>[] adjList)\\n {\\n boolean f = false;\\n this.stack.add(v);\\n this.blocked[v] = true;\\n\\n for (int i = 0; i < adjList[v].size(); i++) {\\n int w = adjList[v].get(i);\\n // found cycle\\n if (w == s) {\\n Vector cycle = new Vector();\\n for (int j = 0; j < this.stack.size(); j++) {\\n int index = this.stack.get(j).intValue();\\n cycle.add(this.graphNodes[index]);\\n }\\n this.cycles.add(cycle);\\n\\n\\n // we hard-limit the cycle number to 10k!!\\n if (this.cycles.size() > 10000) {\\n break;\\n }\\n\\n f = true;\\n }\\n else if (!this.blocked[w]) {\\n if (this.findCycles(w, s, adjList)) {\\n f = true;\\n }\\n }\\n }\\n\\n if (f) {\\n this.unblock(v);\\n }\\n else {\\n for (int i = 0; i < adjList[v].size(); i++) {\\n int w = ((Integer) adjList[v].get(i)).intValue();\\n if (!this.B[w].contains(new Integer(v))) {\\n this.B[w].add(new Integer(v));\\n }\\n }\\n }\\n\\n this.stack.remove(new Integer(v));\\n return f;\\n }\",\n \"boolean detectCycledirected(ArrayList<Integer> G[]) {\\n\\t\\tint[] vis = new int[G.length];\\n\\t\\tint[] ancestor = new int[G.length];\\n\\t\\tfor (int i = 0; i < G.length; i++) {\\n\\t\\t\\tif (vis[i] == 0) {\\n\\t\\t\\t\\tif (detectCycleUtil(G, i, vis, ancestor))\\n\\t\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn false;\\n\\t}\",\n \"public ListNode detectCycle(ListNode head){\\n if(head == null) return null;\\n\\n Set<ListNode> visitedNodes = new HashSet<>();\\n ListNode currNode = head;\\n while(currNode != null) {\\n if(visitedNodes.contains(currNode)){\\n return currNode;\\n }\\n visitedNodes.add(currNode);\\n currNode = currNode.next;\\n }\\n return null;\\n }\",\n \"public DirectedCycle(Digraph G) {\\n onStack = new boolean[G.V()];\\n marked = new boolean[G.V()];\\n edgeTo = new int[G.V()];\\n\\n //Cycle through each vertex to see if it is in a cycle\\n for (int v = 0; v < G.V(); v++) {\\n if (marked[v] == false) {\\n dfs(G, v);\\n }\\n }\\n }\",\n \"protected boolean hasCycle(Map<Object, Object> data) {\\n return Boolean.TRUE == data.get(DATA_CLOSURE_CYCLIC); \\n }\",\n \"private boolean hasNoCycle(int node, int[] color, int[][] graph) {\\n if (color[node] > 0)\\n return color[node] == 2;\\n\\n color[node] = 1;\\n for (int nei : graph[node]) {\\n if (color[nei] == 2)\\n continue;\\n if (color[nei] == 1 || !hasNoCycle(nei, color, graph))\\n return false;\\n }\\n\\n color[node] = 2;\\n return true;\\n }\",\n \"private void runLoopCheck(HashMap<IconMain, Set<IconMain>> connections, IconMain iconFrom) {\\n visited.add(iconFrom);\\n if (connections.containsKey(iconFrom)) {\\n Set<IconMain> set = connections.get(iconFrom);\\n\\n for (IconMain iconTo : set) {\\n while (!iconTo.iconType.equals(\\\")\\\")) {\\n if (visited.contains(iconTo)) {\\n break;\\n }\\n runLoopCheck(connections, iconTo);\\n }\\n visited.add(iconTo);\\n }\\n }\\n }\",\n \"@Override\\n public void cycle(long cycle) {\\n\\n boolean previousState = state();\\n\\n manageDIV();\\n\\n incTIMAIfChange(previousState);\\n }\",\n \"public static ListNode detectCycle2(ListNode head){\\n if(head == null) return null;\\n\\n ListNode intersectNode = getIntersection(head);\\n if(intersectNode == null) return null;\\n\\n ListNode currNode = head;\\n while(currNode != intersectNode) {\\n currNode = currNode.next;\\n intersectNode = intersectNode.next;\\n }\\n return intersectNode;\\n }\",\n \"public int getCycles();\",\n \"void find_negative_cycle(){\\n \\t\\n \\tfor(int j = 0; j<E ; j++)\\n\\t\\t{\\n\\t\\t\\trelax(edge[j].src, edge[j].destination, edge[j].weight);\\n\\t\\t}\\n \\tfor(int i = 0; i<V ; i++)\\n\\t\\t{\\n \\t\\tif(x[i] != dist[i])\\n\\t\\t\\t{\\n \\t\\t\\tNegCycle = true;\\n\\t\\t\\t\\tSystem.out.println(\\\"Negative Cycle Found \\\");\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n }\",\n \"@Test public void testPublic11() {\\n Graph<Character> graph= TestGraphs.testGraph3();\\n\\n for (Character ch : graph.getVertices())\\n assertFalse(graph.isInCycle(ch));\\n }\",\n \"private boolean isAcyclic() {\\n boolean visited[] = new boolean[getNumNodes()];\\n boolean noCycle = true;\\n int list[] = new int[getNumNodes() + 1];\\n int index = 0;\\n int lastIndex = 1;\\n list[0] = randomParent;\\n visited[randomParent] = true;\\n while (index < lastIndex && noCycle) {\\n int currentNode = list[index];\\n int i = 1;\\n\\n // verify parents of current node\\n while ((i < parentMatrix[currentNode][0]) && noCycle) {\\n if (!visited[parentMatrix[currentNode][i]]) {\\n if (parentMatrix[currentNode][i] != randomChild) {\\n list[lastIndex] = parentMatrix[currentNode][i];\\n lastIndex++;\\n }\\n else {\\n noCycle = false;\\n }\\n visited[parentMatrix[currentNode][i]] = true;\\n } // end of if(visited)\\n i++;\\n }\\n index++;\\n }\\n //System.out.println(\\\"\\\\tnoCycle:\\\"+noCycle);\\n return noCycle;\\n }\",\n \"private static FunctionCycle findCycleWithBrentsInternal(IntUnaryOperator func, int x0) {\\n\\n int power = 1;\\n int lam = 1;\\n\\n int t = x0;\\n int h = func.applyAsInt(x0);\\n\\n // 'lam' will be equal to cycle length at the end of iteration\\n while (t != h) {\\n if (power == lam) {\\n t = h;\\n power *= 2;\\n lam = 0;\\n }\\n\\n h = func.applyAsInt(h);\\n ++lam;\\n }\\n\\n final int cycleLength = lam;\\n\\n t = x0;\\n h = x0;\\n\\n // find star point for cycle\\n for (int i = 0; i < lam; ++i) {\\n h = func.applyAsInt(h);\\n }\\n\\n while (t != h) {\\n t = func.applyAsInt(t);\\n h = func.applyAsInt(h);\\n }\\n\\n return new FunctionCycle(t, cycleLength);\\n }\",\n \"private static Boolean detectLoop(Node head2) {\\n\\t\\tHashSet<Node> s = new HashSet<Node>();\\n\\t\\twhile (head2 != null) {\\n\\t\\t\\tif (s.contains(head2))\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\ts.add(head2);\\n\\t\\t\\thead2 = head2.next;\\n\\t\\t}\\n\\t\\treturn false;\\n\\t}\",\n \"public Iterable<Integer> cycle(){\\n return cycle;\\n }\",\n \"public static boolean hasCycle2(ListNode head) {\\n if (head == null) return false;\\n ListNode slow = head;\\n ListNode fast = head;\\n\\n while ((fast.next != null) && (fast.next.next != null)) {\\n fast = fast.next.next;\\n slow = slow.next;\\n if (fast == slow) { //Meet point\\n return true;\\n }\\n }\\n return false;\\n }\",\n \"public boolean detect_cycle_directed_util(int v,boolean visited[], boolean curr_visited[]) {\\n\\t\\t\\n\\t\\tvisited[v]=true;\\n\\t\\tcurr_visited[v]=true;\\n\\t\\t\\n\\t\\t\\n\\t\\tfor(int neighbour:adj[v]) {\\n\\t\\t\\t\\n\\t\\t\\tif(curr_visited[neighbour]) {\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t\\telse if(!visited[neighbour]&&detect_cycle_directed_util(neighbour,visited,curr_visited)) {\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t\\tcurr_visited[v]=false;\\n\\t\\t\\n\\t\\treturn false;\\n\\t\\t\\n\\t}\",\n \"public void removeGraphCycles() {\\n\\t\\tMap<Integer, MovingFObject> map = sc.getInitPos();\\r\\n\\t\\tint[] cycleCount = new int[map.size()];\\r\\n\\t\\tforComplexMotion = new boolean[map.size()];\\r\\n\\t\\t//count cycles\\r\\n\\t\\tfor(int i = 0; i < map.size(); i++) {\\r\\n\\t\\t\\tfor(int j = 0; j < map.size(); j++) {\\r\\n\\t\\t\\t\\tif(i != j) {\\r\\n\\t\\t\\t\\t\\tif(graph[i][j] && graph[j][i]) {\\r\\n\\t\\t\\t\\t\\t\\tcycleCount[i]++;\\r\\n\\t\\t\\t\\t\\t\\tcycleCount[j]++;\\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\\t//remove fobjects from linear motion planning\\r\\n\\t\\tboolean hasCycles = true;\\r\\n\\t\\twhile(hasCycles) {\\r\\n\\t\\t\\tint max = 0;\\r\\n\\t\\t\\tint maxIndex = -1;\\r\\n\\t\\t\\tfor(int i = 0; i < cycleCount.length; i++) {\\r\\n\\t\\t\\t\\tif(cycleCount[i] > max) {\\r\\n\\t\\t\\t\\t\\tmax = cycleCount[i];\\r\\n\\t\\t\\t\\t\\tmaxIndex = i;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tif(maxIndex == -1) {\\r\\n\\t\\t\\t\\thasCycles = false;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse {\\r\\n\\t\\t\\t\\tcycleCount[maxIndex] = 0;\\r\\n\\t\\t\\t\\tforComplexMotion[maxIndex] = true;\\r\\n\\t\\t\\t\\tfor(int i = 0; i < cycleCount.length; i++) {\\r\\n\\t\\t\\t\\t\\tgraph[maxIndex][i] = false;\\r\\n\\t\\t\\t\\t\\tgraph[i][maxIndex] = false;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t}\",\n \"@Test\\n public void shouldThrowCyclicDependencyExceptionIfACycleIsDetected_CycleDetectedInUpstreamNodes() {\\n\\n String a = \\\"A\\\";\\n String b = \\\"B\\\";\\n String c = \\\"C\\\";\\n ValueStreamMap graph = new ValueStreamMap(b, null);\\n graph.addUpstreamNode(new PipelineDependencyNode(a, a), null, b);\\n graph.addUpstreamMaterialNode(new SCMDependencyNode(\\\"g\\\",\\\"g\\\",\\\"git\\\"), null, a, new MaterialRevision(null));\\n graph.addDownstreamNode(new PipelineDependencyNode(a, a), b);\\n graph.addDownstreamNode(new PipelineDependencyNode(c, c), a);\\n\\n assertThat(graph.hasCycle(), is(true));\\n }\",\n \"private void checkNoCycles(List<JpsModule> component) {\\n if (component.size() > 1) {\\n StringBuilder message = new StringBuilder();\\n message.append(\\\"Found circular module dependency: \\\")\\n .append(component.size())\\n .append(\\\" modules\\\");\\n for (JpsModule module : component) {\\n message.append(\\\" \\\").append(module.getName());\\n }\\n logger.error(message.toString());\\n }\\n }\",\n \"static long GetCycleCount() {\\n\\t\\treturn System.currentTimeMillis();\\n\\t}\",\n \"public static void main(String[] args) { \\n \\tA016_DetectAndRemoveLoopLinkedList list = new A016_DetectAndRemoveLoopLinkedList(); \\n \\tNode head = new Node(50); \\n head.next = new Node(20); \\n head.next.next = new Node(15); \\n head.next.next.next = new Node(4); \\n head.next.next.next.next = new Node(10); \\n \\n // Creating a loop for testing \\n head.next.next.next.next.next = head.next.next; \\n list.detectAndRemoveLoop(head); \\n while (head != null) { \\n System.out.print(head.data + \\\" \\\"); \\n head = head.next; \\n }\\n \\n// \\n// ListNode head1 = new ListNode(50); \\n// head1.next = new ListNode(20); \\n// head1.next.next = new ListNode(15); \\n// head1.next.next.next = new ListNode(4); \\n// head1.next.next.next.next = new ListNode(10); \\n// \\n// // Creating a loop for testing \\n// head1.next.next.next.next.next = head1.next.next; \\n// System.out.println(detectCycle(head1));\\n \\n \\n ListNode head1 = new ListNode(1);\\n ListNode second = new ListNode(2);\\n ListNode third = new ListNode(3);\\n ListNode fourth = new ListNode(4);\\n\\t\\thead1.next = second;\\n\\t\\tsecond.next = third;\\n\\t\\tthird.next = fourth;\\n\\t\\tfourth.next = second;\\n\\t\\tListNode aaa = detectCycle(head1);\\n\\t\\twhile (head1 != null) {\\n\\t\\t\\tSystem.out.print(head1.val + \\\" \\\");\\n\\t\\t\\thead1 = head1.next;\\n\\t\\t}\\n\\t}\",\n \"@Test public void testPublic12() {\\n Graph<Integer> graph= new Graph<Integer>();\\n int i;\\n\\n // note this adds the adjacent vertices in the process\\n for (i= 0; i < 10; i++)\\n graph.addEdge(i, i + 1, 1);\\n graph.addEdge(10, 0, 1);\\n\\n for (Integer vertex : graph.getVertices())\\n assertTrue(graph.isInCycle(vertex));\\n }\",\n \"@Test\\n public void cyclicalGraphs3Test() throws Exception {\\n // Test graphs with multiple loops. g1 has two different loops, which\\n // have to be correctly matched to g2 -- which is build in a different\\n // order but is topologically identical to g1.\\n\\n ChainsTraceGraph g1 = new ChainsTraceGraph();\\n List<EventNode> g1Nodes = addNodesToGraph(g1, new String[] { \\\"a\\\", \\\"b\\\",\\n \\\"c\\\", \\\"d\\\", \\\"b\\\", \\\"c\\\" });\\n\\n // Create loop1 in g1, with the first 4 nodes.\\n g1Nodes.get(0).addTransition(g1Nodes.get(1), Event.defTimeRelationStr);\\n g1Nodes.get(1).addTransition(g1Nodes.get(2), Event.defTimeRelationStr);\\n g1Nodes.get(2).addTransition(g1Nodes.get(3), Event.defTimeRelationStr);\\n g1Nodes.get(3).addTransition(g1Nodes.get(0), Event.defTimeRelationStr);\\n\\n // Create loop2 in g1, with the last 2 nodes, plus the initial node.\\n g1Nodes.get(0).addTransition(g1Nodes.get(4), Event.defTimeRelationStr);\\n g1Nodes.get(4).addTransition(g1Nodes.get(5), Event.defTimeRelationStr);\\n g1Nodes.get(5).addTransition(g1Nodes.get(0), Event.defTimeRelationStr);\\n\\n exportTestGraph(g1, 0);\\n\\n // //////////////////\\n // Now create g2, by generating the two identical loops in the reverse\\n // order.\\n\\n ChainsTraceGraph g2 = new ChainsTraceGraph();\\n List<EventNode> g2Nodes = addNodesToGraph(g2, new String[] { \\\"a\\\", \\\"b\\\",\\n \\\"c\\\", \\\"d\\\", \\\"b\\\", \\\"c\\\" });\\n\\n // Create loop2 in g2, with the last 2 nodes, plus the initial node.\\n g2Nodes.get(0).addTransition(g2Nodes.get(4), Event.defTimeRelationStr);\\n g2Nodes.get(4).addTransition(g2Nodes.get(5), Event.defTimeRelationStr);\\n g2Nodes.get(5).addTransition(g2Nodes.get(0), Event.defTimeRelationStr);\\n\\n // Create loop1 in g2, with the first 4 nodes.\\n g2Nodes.get(0).addTransition(g2Nodes.get(1), Event.defTimeRelationStr);\\n g2Nodes.get(1).addTransition(g2Nodes.get(2), Event.defTimeRelationStr);\\n g2Nodes.get(2).addTransition(g2Nodes.get(3), Event.defTimeRelationStr);\\n g2Nodes.get(3).addTransition(g2Nodes.get(0), Event.defTimeRelationStr);\\n\\n exportTestGraph(g2, 1);\\n\\n // //////////////////\\n // Now test that the two graphs are identical for all k starting at the\\n // initial node.\\n\\n for (int k = 1; k < 7; k++) {\\n testKEqual(g1Nodes.get(0), g2Nodes.get(0), k);\\n }\\n }\",\n \"public boolean IsCyclic() {\\r\\n\\t\\tHashMap<String, Boolean> processed = new HashMap<>();\\r\\n\\t\\tLinkedList<Pair> queue = new LinkedList<>();\\r\\n\\r\\n\\t\\tArrayList<String> vnames = new ArrayList<>(vces.keySet());\\r\\n\\t\\tfor (String vname : vnames) {\\r\\n\\t\\t\\tif (processed.containsKey(vname)) {\\r\\n\\t\\t\\t\\tcontinue;\\r\\n\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\tPair rootpair = new Pair(vname, vname);\\r\\n\\t\\t\\tqueue.addLast(rootpair);\\r\\n\\t\\t\\twhile (queue.size() != 0) {\\r\\n\\t\\t\\t\\t// 1. removeFirst\\r\\n\\t\\t\\t\\tPair rp = queue.removeFirst();\\r\\n\\r\\n\\t\\t\\t\\t// 2. check if processed, mark if not\\r\\n\\t\\t\\t\\tif (processed.containsKey(rp.vname)) {\\r\\n\\t\\t\\t\\t\\tSystem.out.println(rp.vname + \\\" via \\\" + rp.psf);\\r\\n\\t\\t\\t\\t\\treturn true;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tprocessed.put(rp.vname, true);\\r\\n\\r\\n\\t\\t\\t\\t// 3. Check, if an edge is found\\r\\n\\t\\t\\t\\tSystem.out.println(rp.vname + \\\" via \\\" + rp.psf);\\r\\n\\r\\n\\t\\t\\t\\t// 4. Add the unprocessed nbrs back\\r\\n\\t\\t\\t\\tArrayList<String> nbrnames = new ArrayList<>(rp.vtx.nbrs.keySet());\\r\\n\\t\\t\\t\\tfor (String nbrname : nbrnames) {\\r\\n\\t\\t\\t\\t\\tif (!processed.containsKey(nbrname)) {\\r\\n\\t\\t\\t\\t\\t\\tPair np = new Pair(nbrname, rp.psf + nbrname);\\r\\n\\t\\t\\t\\t\\t\\tqueue.addLast(np);\\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\\treturn false;\\r\\n\\t}\",\n \"@Test\\n public void testVerifyLoopInvokesDependenciesProperlyWhenNoCycles() throws Exception {\\n // ----------------------------------------------------\\n // Add more mocking detail to our dependencies first.\\n // ----------------------------------------------------\\n\\n DepChaser sut = createSut();\\n\\n // First mock our dependencyMap to know about variables a thru f\\n when(_dependencyMap.keySet()).thenReturn(new HashSet<>(Arrays.asList(\\\"a\\\", \\\"b\\\", \\\"c\\\", \\\"d\\\", \\\"e\\\", \\\"f\\\")));\\n\\n // ----------------------------------------------------------------------------------\\n // we're going to make it so it takes 2 iterations in DepChaser to handle a thru f\\n // ----------------------------------------------------------------------------------\\n\\n // The 1st time, our mocked checker is going to checkout no cycles in a, b, c variables\\n ChildrenDependencyChecker checker1 = mockChildrenDependencyChecker(Arrays.asList(\\\"a\\\", \\\"b\\\", \\\"c\\\"));\\n // The 2nd time, our mocked checker is going to checkout no cycles in d, e, f variables\\n ChildrenDependencyChecker checker2 = mockChildrenDependencyChecker(Arrays.asList(\\\"d\\\", \\\"e\\\", \\\"f\\\"));\\n\\n when(_dependencyCheckerFactory.create(\\\"a\\\", _dependencyMap, new HashSet<>())).thenReturn(checker1);\\n when(_dependencyCheckerFactory.create(\\\"d\\\", _dependencyMap, new HashSet<>(Arrays.asList(\\\"a\\\", \\\"b\\\", \\\"c\\\")))).thenReturn(checker2);\\n\\n Assert.assertTrue(sut.validateNoDependencyCycles());\\n verify(checker1, times(1)).run();\\n verify(checker2, times(1)).run();\\n\\n // Verify all variables were verified\\n Assert.assertEquals(_dependencyMap.keySet(), sut.getVerifiedVariables());\\n }\",\n \"public boolean detectCyclesContainingVertex(V v)\\n {\\n try {\\n execute(null, v);\\n } catch (CycleDetectedException ex) {\\n return true;\\n }\\n\\n return false;\\n }\",\n \"public boolean hasCycle(int nodeIndex, int[][] graph, boolean[] visited, boolean[] onStack,\\n boolean[] onCycle) {\\n\\n if (onCycle[nodeIndex]) {\\n return true;\\n }\\n visited[nodeIndex] = true;\\n onStack[nodeIndex] = true;\\n boolean cycle = false;\\n for (int neighbor : graph[nodeIndex]) {\\n if (onCycle[neighbor]) {\\n cycle = true;\\n continue;\\n }\\n if (!visited[neighbor]) {\\n if (hasCycle(neighbor, graph, visited, onStack, onCycle)) {\\n onCycle[neighbor] = true;\\n cycle = true;\\n }\\n } else {\\n if (onStack[neighbor]) {\\n onCycle[neighbor] = true;\\n cycle = true;\\n }\\n }\\n }\\n onStack[nodeIndex] = false;\\n return cycle;\\n }\",\n \"public static void main(String[] args) {\\n\\t\\tNode test = new Node(1);\\n\\t\\t\\n\\t\\tlogger.info(String.valueOf(hasCycle(test)));\\n\\t\\t\\n\\t\\t//Test second list - 1 -> 2 -> 3 -> 2 -> 3 [...]\\n\\t\\tNode head = new Node(1);\\n\\t\\tNode next = new Node(2);\\n\\t head.setNext(next); \\n\\t head.getNext().setNext(new Node(3));\\n\\t head.getNext().getNext().setNext(next);\\n\\t \\n\\t logger.info(String.valueOf(hasCycle(head)));\\n\\t}\",\n \"static Boolean detectloop(Node Header){\\n Node slow_pointer = Header;\\n Node fast_pointer = Header;\\n while(slow_pointer!=null && fast_pointer!=null && fast_pointer.link!=null){\\n slow_pointer=slow_pointer.link;\\n fast_pointer=fast_pointer.link.link;\\n if(slow_pointer==fast_pointer){\\n return true;\\n }\\n }\\n return false;\\n }\",\n \"public static Node findCycle(Node head) {\\n if (head == null) return head;\\n\\n Node slow = head;\\n Node fast = head.next;\\n while (fast != null && fast.next != null) {\\n if (fast == slow) break;\\n slow = slow.next;\\n fast = fast.next.next;\\n }\\n\\n if (fast == slow) {\\n slow = head;\\n while (slow != fast.next) {\\n slow = slow.next;\\n fast = fast.next;\\n }\\n return fast.next;\\n } else {\\n return null;\\n }\\n }\",\n \"public boolean\\n checkCycle(int nd, ArrayList<ArrayList<Integer>> adj,\\n cycleHelper cyHlp) {\\n // insert into stack\\n cyHlp.isStack[nd] = true;\\n for (int it : adj.get(nd)) {\\n // if next node is visited\\n if (cyHlp.visited[it] == true) {\\n // if the node is in stack then cycle is found\\n if (cyHlp.isStack[it] == true) return true;\\n continue;\\n }\\n cyHlp.visited[it] = true;\\n if (checkCycle(it, adj, cyHlp)) return true;\\n }\\n // removing from stack\\n cyHlp.isStack[nd] = false;\\n return false;\\n }\",\n \"public int getCycle() {\\n return cycle;\\n }\",\n \"private static boolean checkAndAddDependency(int trans_id, int independent_trans_id) {\\n List<Integer> txnsInCycle = new ArrayList<Integer>();\\n txnsInCycle.add(trans_id);\\n if (DeadlockHandler.isThereACycleInGraph(trans_id, independent_trans_id, txnsInCycle)) {\\n // System.out.println(\\\"List contents are\\\" + txnsInCycle.toString());\\n long youngestTxnTime = transactions.get(txnsInCycle.get(0)).getStartTime();\\n Integer youngestTxnId = txnsInCycle.get(0);\\n for (Integer t : txnsInCycle) {\\n if (youngestTxnTime < transactions.get(t).getStartTime()) {\\n youngestTxnTime = transactions.get(t).getStartTime();\\n youngestTxnId = t;\\n }\\n }\\n\\n\\n\\n System.out.println(\\\"Cycle in graph. DEADLOCK\\\");\\n System.out.println(\\\"Aborted : T\\\" + youngestTxnId);\\n releaseResources(youngestTxnId);\\n clearWaitingOperations();\\n if (youngestTxnId != trans_id && youngestTxnId != independent_trans_id) {\\n DeadlockHandler.addDependencyEdge(independent_trans_id, trans_id);\\n return true;\\n }\\n\\n\\n\\n return false;\\n\\n }\\n\\n else {\\n\\n // if edge exists we don't need to do anything\\n if (!DeadlockHandler.ifThereIsAnEdgeFromT1toT2(trans_id, independent_trans_id)) {\\n\\n // System.out.println(\\\"checkAndAddDependency::Edge is not present\\\");\\n // System.out.println(\\\"checkAndAddDependency::Add dependency edge\\\");\\n // no deadlock hence we can add the edge\\n DeadlockHandler.addDependencyEdge(independent_trans_id, trans_id);\\n }\\n }\\n\\n return true;\\n }\",\n \"private boolean cyclicUpdate() {\\n if (cyclicUpdate_EM()) {\\n mUpdate = 0;\\n return true;\\n }\\n return false;\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.8022661","0.7582115","0.7467581","0.7309301","0.6859185","0.68320376","0.683162","0.6827226","0.6763716","0.6718021","0.67077047","0.6691687","0.6690034","0.66510946","0.6608548","0.6603222","0.65824634","0.6558572","0.65290487","0.65054256","0.65023834","0.6500697","0.6500684","0.64944255","0.6486089","0.6445302","0.6427609","0.64174277","0.6416923","0.6395746","0.639233","0.6375804","0.6359081","0.6348536","0.6321289","0.63179356","0.63144106","0.63083905","0.6257694","0.622836","0.62242967","0.6222032","0.62157273","0.6206252","0.6205957","0.61885244","0.61714894","0.6166482","0.6165543","0.6146918","0.61438555","0.6142055","0.61392045","0.61090255","0.61029917","0.6095814","0.60957247","0.6085907","0.6076359","0.60628957","0.6057711","0.6052785","0.60459083","0.6035189","0.6035187","0.6030533","0.603052","0.6024488","0.60010093","0.5995891","0.59947646","0.5981797","0.597952","0.59698707","0.59671175","0.5966458","0.5961987","0.5945979","0.59356195","0.59205526","0.5917618","0.5916112","0.59108174","0.5906424","0.590178","0.58617556","0.585161","0.58499044","0.5819596","0.5775902","0.57723796","0.5766202","0.575949","0.5756602","0.5752004","0.57468534","0.57373345","0.5735446","0.5721357","0.57019126"],"string":"[\n \"0.8022661\",\n \"0.7582115\",\n \"0.7467581\",\n \"0.7309301\",\n \"0.6859185\",\n \"0.68320376\",\n \"0.683162\",\n \"0.6827226\",\n \"0.6763716\",\n \"0.6718021\",\n \"0.67077047\",\n \"0.6691687\",\n \"0.6690034\",\n \"0.66510946\",\n \"0.6608548\",\n \"0.6603222\",\n \"0.65824634\",\n \"0.6558572\",\n \"0.65290487\",\n \"0.65054256\",\n \"0.65023834\",\n \"0.6500697\",\n \"0.6500684\",\n \"0.64944255\",\n \"0.6486089\",\n \"0.6445302\",\n \"0.6427609\",\n \"0.64174277\",\n \"0.6416923\",\n \"0.6395746\",\n \"0.639233\",\n \"0.6375804\",\n \"0.6359081\",\n \"0.6348536\",\n \"0.6321289\",\n \"0.63179356\",\n \"0.63144106\",\n \"0.63083905\",\n \"0.6257694\",\n \"0.622836\",\n \"0.62242967\",\n \"0.6222032\",\n \"0.62157273\",\n \"0.6206252\",\n \"0.6205957\",\n \"0.61885244\",\n \"0.61714894\",\n \"0.6166482\",\n \"0.6165543\",\n \"0.6146918\",\n \"0.61438555\",\n \"0.6142055\",\n \"0.61392045\",\n \"0.61090255\",\n \"0.61029917\",\n \"0.6095814\",\n \"0.60957247\",\n \"0.6085907\",\n \"0.6076359\",\n \"0.60628957\",\n \"0.6057711\",\n \"0.6052785\",\n \"0.60459083\",\n \"0.6035189\",\n \"0.6035187\",\n \"0.6030533\",\n \"0.603052\",\n \"0.6024488\",\n \"0.60010093\",\n \"0.5995891\",\n \"0.59947646\",\n \"0.5981797\",\n \"0.597952\",\n \"0.59698707\",\n \"0.59671175\",\n \"0.5966458\",\n \"0.5961987\",\n \"0.5945979\",\n \"0.59356195\",\n \"0.59205526\",\n \"0.5917618\",\n \"0.5916112\",\n \"0.59108174\",\n \"0.5906424\",\n \"0.590178\",\n \"0.58617556\",\n \"0.585161\",\n \"0.58499044\",\n \"0.5819596\",\n \"0.5775902\",\n \"0.57723796\",\n \"0.5766202\",\n \"0.575949\",\n \"0.5756602\",\n \"0.5752004\",\n \"0.57468534\",\n \"0.57373345\",\n \"0.5735446\",\n \"0.5721357\",\n \"0.57019126\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.58040166"},"document_rank":{"kind":"string","value":"89"}}},{"rowIdx":27393,"cells":{"query":{"kind":"string","value":"/ This function performs the main functionality for the DFS."},"document":{"kind":"string","value":"private boolean helperDFS(Node current){\n\n if(expandedNode.size() == 999){\n //limit has been reached. jump out of recursion.\n expandedNode.add(current);\n System.out.println(\"No solution found.\");\n printExpanded(expandedNode);\n System.exit(0);\n return false;\n }\n\n boolean b = cycleCheck(current,expandedNode);\n\n if(!b){\n expandedNode.add(current);\n }else{\n return false;\n }\n\n if(current.getDigit().getDigitString().equals(goalNode.getDigit().getDigitString())){\n //goal reached.\n //expandedNode.add(current);\n solutionPath(current);\n printExpanded(expandedNode);\n System.exit(0);\n }\n\n //Now make the children.\n\n if(!forbidden.contains(current.getDigit().getDigitString())){\n\n if(current.getDigit().last_changed != 0){\n\n if ((Integer.parseInt(current.getDigit().getFirst_digit()) - 1 >= 0)) {\n Node child_node = new Node(current.getDigit().decreaseFirstDigit());\n child_node.setParent(current);\n child_node.getDigit().setLastChanged(0);\n if(!forbidden.contains(child_node.getDigit().getDigitString()) && helperDFS(child_node)){\n return true;\n }\n }\n\n //+1 child first digit\n if ((Integer.parseInt(current.getDigit().getFirst_digit()) + 1 <= 9)) {\n Node child_node = new Node(current.getDigit().increaseFirstDigit());\n child_node.setParent(current);\n child_node.getDigit().setLastChanged(0);\n if(!forbidden.contains(child_node.getDigit().getDigitString()) && helperDFS(child_node)){\n return true;\n }\n }\n }\n\n if(current.getDigit().last_changed != 1){\n if ((Integer.parseInt(current.getDigit().getSecond_digit()) - 1 >= 0)) {\n Node child_node = new Node(current.getDigit().decreaseSecondDigit());\n child_node.setParent(current);\n child_node.getDigit().setLastChanged(1);\n if(!forbidden.contains(child_node.getDigit().getDigitString()) && helperDFS(child_node)){\n return true;\n }\n }\n\n //+1 child\n if ((Integer.parseInt(current.getDigit().getSecond_digit()) + 1 <= 9)) {\n Node child_node = new Node(current.getDigit().increaseSecondDigit());\n child_node.setParent(current);\n child_node.getDigit().setLastChanged(1);\n if(!forbidden.contains(child_node.getDigit().getDigitString()) && helperDFS(child_node)){\n return true;\n }\n }\n }\n\n if(current.getDigit().last_changed != 2){\n if ((Integer.parseInt(current.getDigit().getThird_digit()) - 1 >= 0)) {\n Node child_node = new Node(current.getDigit().decreaseThirdDigit());\n child_node.setParent(current);\n child_node.getDigit().setLastChanged(2);\n if(!forbidden.contains(child_node.getDigit().getDigitString()) && helperDFS(child_node)){\n return true;\n }\n }\n //+1 child\n if ((Integer.parseInt(current.getDigit().getThird_digit()) + 1 <= 9)) {\n Node child_node = new Node(current.getDigit().increaseThirdDigit());\n child_node.setParent(current);\n child_node.getDigit().setLastChanged(2);\n if(!forbidden.contains(child_node.getDigit().getDigitString()) && helperDFS(child_node)){\n return true;\n }\n }\n }\n }\n return false;\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["void DFS() {\n \t\n \t// Mark all the vertices as not visited(set as false by default in java) \n \tboolean visited[] = new boolean[V];\n \t\n \t// Call the recursive helper function to print DFS traversal \n // starting from all vertices one by one \n \tfor (int i=0; i<V; i++) { \n \t\t if (visited[i] == false)\n \t\t\t DFSUtil(i, visited);\n \t}\n }","private void DFS() {\n\t\tfor(Node node: nodeList) {\r\n\t\t\tif(!node.isVisited())\r\n\t\t\t\tdfsVisit(node);\r\n\t\t}\r\n\t}","public void DFS() {\r\n for (int i = 0; i < vertexNum; i++) {\r\n DFS(i);\r\n }\r\n }","void dfs(){\n // start from the index 0\n for (int vertex=0; vertex<v; vertex++){\n // check visited or not\n if (visited[vertex]==false){\n Explore(vertex);\n }\n }\n }","public void DFS() {\r\n\t\tSet<Vertex> visited = new HashSet<Vertex>();\r\n\r\n\t\t// Create a stack for DFS\r\n\t\tStack<Vertex> stack = new Stack<Vertex>();\r\n\r\n\t\tDFS(this.vertices[3], visited, stack); // DFS starting with 40\r\n\r\n\t\t// Call the helper function to print DFS traversal\r\n\t\t// starting from all vertices one by one\r\n\t\tfor (int i = 0; i < N; ++i)\r\n\t\t\tif (!visited.contains(this.vertices[i]))\r\n\t\t\t\tDFS(this.vertices[i], visited, stack);\r\n\t}","@Override\n public void dfs() {\n\n }","public void dfs() {\n int currentVertexIndex = 0;\r\n dfsStack.push(0);\r\n vertexList[0].wasVisited = true;\r\n System.out.println(vertexList[dfsStack.peek()]);\r\n while (dfsStack.top != -1) {\r\n\r\n\r\n currentVertexIndex = this.getAdjUnvisitedVert(dfsStack.peek());\r\n if (currentVertexIndex != -1) {\r\n dfsStack.push(currentVertexIndex);\r\n vertexList[currentVertexIndex].wasVisited = true;\r\n System.out.println(vertexList[dfsStack.peek()]);\r\n\r\n\r\n } else {\r\n currentVertexIndex = dfsStack.pop();\r\n\r\n }\r\n }\r\n// reset wasVisted\r\n for (Vertex x : vertexList) {\r\n x.wasVisited = false;\r\n }\r\n }","public static void main(String[] args){\n GraphDFS graphDFS = new GraphDFS(20);\n graphDFS.addNode('A');\n graphDFS.addNode('B');\n graphDFS.addNode('D');\n graphDFS.addNode('C');\n graphDFS.addNode('E');\n graphDFS.addNode('F');\n\n graphDFS.addEdge(0, 1);\n graphDFS.addEdge(1, 2);\n graphDFS.addEdge(0, 3);\n graphDFS.addEdge(3, 4);\n graphDFS.addEdge(4, 5);\n graphDFS.addEdge(1, 5);\n\n graphDFS.dfsTraversal();\n }","public void dfs (String input)\r\n\t {\r\n\t\t \tNode root_dfs = new Node (input);\r\n\t\t \tNode current = new Node(root_dfs.getState());\r\n\t\t \t\r\n\t\t\tArrayList<String> visited = new ArrayList<String>();\r\n\t\t\tArrayList<String> children = new ArrayList<String>();\r\n\t\t\tStack<Node> stack_dfs = new Stack<Node>();\r\n\t\t\t\r\n\t\t\tint nodes_popped = 0;\r\n\t\t\tint stack_max_size = 0;\r\n\t\t\tint stack_size = 0;\r\n\t\t\tcurrent.cost = 0;\r\n\t\t\t\r\n\t\t\tgoal_dfs = isGoal(current.getState());\r\n\t\t\t\r\n\t\t\twhile(!goal_dfs)\r\n\t\t\t{\r\n\t\t\t\tvisited.add(current.getState());\r\n\t\t\t\tchildren = Successor.findChildren(current.getState());\r\n\t\t\t\t\r\n\t\t\t\tfor (String a : children)\r\n\t\t\t\t{\r\n\t\t\t\t\t\r\n\t\t\t\t\tif (visited.contains(a))\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t}\r\n\t\t\t\t\t\r\n\t\t\t\t\t\tNode nino = new Node(a);\r\n\t\t\t\t\t\tcurrent.children_nodes.add(nino);\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tint cost = isCost(current.getState(), nino.getState());\r\n\t\t\t\t\t\tnino.cost = cost;\r\n\t\t\t\t\t\tnino.parent = current;\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t// Repeated state check\r\n\t\t\t\t\t\tif (!stack_dfs.contains(nino))\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\tstack_dfs.add(nino);\r\n\t\t\t\t\t\t\tstack_size++;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\t// Popping off the stack. LIFO architecture\r\n\t\t\t\tcurrent = stack_dfs.pop();\r\n\t\t\t\tnodes_popped++;\r\n\t\t\t\t\r\n\t\t\t\tif (stack_size > stack_max_size)\r\n\t\t\t\t{\r\n\t\t\t\t\tstack_max_size = stack_size;\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\tstack_size--;\r\n\t\t\t\tgoal_dfs = isGoal(current.getState());\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\tgoal_dfs = false;\r\n\t\t\tSystem.out.println(\"DFS Solved!!\");\r\n\t\t\tSolution.performSolution(current, root_dfs, nodes_popped, stack_max_size);\r\n\t }","public static void main(String[] args) {\n\n /*\n * Given below directed graph, show the DFS and BFS traversal and print the paths\n * it took throughout the traversal of the graph\n *\n * (D)--(F)\n * /\n * (B)--(E)\n * /\n * (A)\n * \\\n * (C)--(G)\n *\n * Do Breadth First Search and Depth First Search, conclude on the trade offs\n * between the two traversal\n */\n\n // Initialize the graph here and its edges\n Graphs graph = new Graphs();\n graph.addNode('A', new Node('A'));\n graph.addNode('B', new Node('B'));\n graph.addNode('C', new Node('C'));\n graph.addNode('D', new Node('D'));\n graph.addNode('E', new Node('E'));\n graph.addNode('F', new Node('F'));\n graph.addNode('G', new Node('G'));\n\n graph.addEdge('A','B');\n graph.addEdge('B','D');\n graph.addEdge('D','F');\n graph.addEdge('B','E');\n graph.addEdge('A','C');\n graph.addEdge('C','G');\n\n // Initialize the list of paths\n ArrayList<String> traversedNodes;\n // Do a DFS on the graph\n traversedNodes = graph.depthFirstSearch('A','G');\n System.out.println(\"Traversal in DFS:\");\n // Print all of the paths\n for(String path : traversedNodes) {\n System.out.println(path);\n }\n\n // Do a BFS on the graph\n traversedNodes = graph.breadthFirstSearch('A','G');\n System.out.println(\"\\nTraversal in BFS:\");\n // Print all of the paths\n for(String path : traversedNodes) {\n System.out.println(path);\n }\n\n }","public static void main(String[] args) {\n\t\tDeepFirstSearchGraph main = new DeepFirstSearchGraph();\n\t\tGraph g = main.new Graph(4);\n\t\tg.addEdge(0, 1);\n\t\tg.addEdge(0, 2);\n\t\tg.addEdge(1, 2);\n\t\tg.addEdge(2, 0);\n\t\tg.addEdge(2, 3);\n\t\tg.addEdge(3, 3);\n\t\t\n\t\tint vertexToBegin = 2;\n\t\tSystem.out.println(\"Doing DFS starting from vertex: \"+vertexToBegin);\n\t\tg.DFS(vertexToBegin);\n\t}","public DFS()\n {\n\n\n writeLock = lock.writeLock();\n readLock = lock.readLock();\n\n recoverINodes();\n\n createDir(\"/\"); // add a root if it does not exist .\n\n }","public void dfs() {\n\t\tfor (Vertice v : vertices) {\n\t\t\tv.setVisited(false);\n\t\t}\n\t\tfor (Vertice v : vertices) {\n\t\t\tif (!v.getVisited()) {\n\t\t\t\tVisitar(v, -1);\n\t\t\t}\n\t\t}\n\t}","private static void iddfs(State curr, int depth) {\n for(int i = 0; i <= depth; i++) {\r\n\r\n if(curr.isGoalState()) \r\n System.out.println(i+\":\"+curr.getOrderedPair()+\" Goal\");//initial is goal state\r\n else\r\n System.out.println(i+\":\"+curr.getOrderedPair());//initial\r\n\r\n curr.close.add(curr);\r\n State currState = curr;\r\n while(!currState.isGoalState()) {\r\n if(currState.depth < i)\r\n curr.buildStack(currState.getSuccessors(currState));\r\n System.out.print(i+\":\");\r\n curr.printHelp(currState, 5);\r\n if(!curr.open.isEmpty()) {\r\n currState = curr.open.get(curr.open.size()-1);\r\n curr.close.add(curr.open.remove(curr.open.size()-1));\r\n } else {\r\n break;\r\n }\r\n }\r\n\r\n if(currState.isGoalState()) {\r\n System.out.println(i+\":\"+currState.getOrderedPair() + \" Goal\");\r\n curr.printPath(currState);\r\n return;\r\n }\r\n curr.open.clear(); curr.close.clear();\r\n }\r\n }","public static void main(String[] args) {\n Graph graph = new Graph(16);\n graph.addEdge(0,1);\n graph.addEdge(1,2);\n graph.addEdge(2,3);\n graph.addEdge(3,4);\n graph.addEdge(4,5);\n graph.addEdge(5,6);\n graph.addEdge(6,7);\n graph.addEdge(8,9);\n graph.addEdge(9,10);\n graph.addEdge(10,11);\n graph.addEdge(11,12);\n graph.addEdge(13,14);\n graph.addEdge(14,15);\n graph.addEdge(15,0);\n graph.addEdge(0,8);\n graph.addEdge(1,10);\n graph.addEdge(2,9);\n graph.addEdge(3,11);\n graph.addEdge(3,14);\n graph.addEdge(4,7);\n graph.addEdge(4,13);\n graph.addEdge(5,8);\n graph.addEdge(5,15);\n graph.printGraph();\n System.out.println(\"DFS Traversal\");\n graph.DFS(3);\n System.out.println();\n System.out.println(\"BFS Traversal\");\n graph.BFS(3);\n// System.out.println();\n// for (int i=0; i<graph.vertices; i++)\n// {\n// if(graph.visited[i]!=true)\n// {\n// graph.DFS(i);\n// }\n// }\n\n }","private static void dfsComponents() {\r\n\t\tprintThis(\"Standard DFS Demo (the input graph must be UNDIRECTED)\");\r\n\t\tfor (int i = 0; i < V; i++) { // for each vertex i in [0..V-1]\r\n\t\t\tif (dfs_num[i] == DFS_WHITE) { // if that vertex is not visited yet\r\n\t\t\t\tSystem.out.printf(\"Component %d:\", ++numComp);\r\n\t\t\t\tdfs(i);\r\n\t\t\t\tSystem.out.printf(\"\\n\");\r\n\t\t\t}\r\n\t\t}\r\n\t\tSystem.out.printf(\"There are %d connected components\\n\", numComp);\r\n\t}","public void Main(){\n\t\t\n\t\tfillSFG();\n\t\tboolean[] visited = new boolean[AdjMatrix.length];\n\t\tLinkedList<Integer> pathdump = new LinkedList<Integer>();\n\t\textractForwardPaths(startNode, endNode, startNode, visited, pathdump);\n\t\textractLoops();\n\t\tgetForwardGains();\n\t\tgetLoopGains();\n\t\tprintForwardPaths();\n\t\tSystem.out.println(\"----------------------------------------------\");\n\t\tprintLoops();\n\t\t\n\t\t\n\t\tcalculateDeltas();\n\t\tcalculateTotalGain();\n\t\tprintDeltasAndTotalGain();\n\t\t\n\t\tfor (int i = 1; i < nonTouching.length; i++) {\n\t\t\tSystem.out.println(\"Level = \"+i);\n\t\t\tfor (int j = 0; j < nonTouching[i].size(); j++) {\n\t\t\t\tLinkedList<Integer> dump = new LinkedList<Integer>();\n\t\t\t\tdump = nonTouching[i].get(j);\n\t\t\t\tfor (int k = 0; k < dump.size(); k++) {\n\t\t\t\t\tSystem.out.print(dump.get(k)+\" \");\n\t\t\t\t}\n\t\t\t\tSystem.out.println();\n\t\t\t}\n\t\t\tSystem.out.println(\"************************************************\");\n\t\t}\n\t\t\n\t\tProgramWindow.getInstance().showResults(forwardPaths,forwardGains,loops,loopGains,deltas,TotalGain,nonTouching);\n\t}","public void depthFirstSearch() {\n List<Vertex> visited = new ArrayList<Vertex>();\r\n // start the recursive depth first search on the current vertex\r\n this.dfs(visited);\r\n }","public static void main(String[] args) \n\t throws IOException {\n\t Scanner sc = new Scanner(System.in);\n\t System.out.print(\"Enter graph input file name: \");\n\t String file = sc.nextLine();\n\t DFS graph = new DFS(file);\n\t System.out.println(\"The Graph Information is\");\n\t graph.print();\n\t System.out.println(\"The DFS Algorithm\");\n\t graph.dfs();\n\t graph.path(\"A\",\"N\");\n\t }","public static void main(String[] args) {\r\n \r\n Graph X=new Graph();\r\n \r\n X.GenerateGraph();\r\n \r\n \r\n X.DisplayGraph();\r\n // System.out.println(\"Printing Stack\");\r\n // X.DFS();\r\n \r\n // System.out.println(X.AdjList.get(3).neighbours);\r\n \r\n // ArrayList<Vertex> A=new ArrayList();\r\n \r\n X.BFS();\r\n \r\n X.TraceBack();\r\n }","@Override\n public void traverse()\n {\n System.out.print(\"DFS Tree: \");\n DFSHelper(root);\n System.out.println();\n }","public static void main(String[] args){\n Graph g = new Graph(13);\n //add vortexes and edges to construct the graph\n g.addEdge(0,1);\n g.addEdge(0,2);\n g.addEdge(0,6);\n g.addEdge(0,5);\n g.addEdge(6,4);\n g.addEdge(4,3);\n g.addEdge(4,5);\n g.addEdge(3,5);\n g.addEdge(7,8);\n g.addEdge(9,10);\n g.addEdge(9,11);\n g.addEdge(9,12);\n g.addEdge(11,12);\n\n //create a DepthFirstSearch object\n BreadthFirstSearch DFS = new BreadthFirstSearch(g,0);\n\n System.out.println(\"7 and 0 is connected: \"+ DFS.marked(7));\n System.out.println(\"10 and 0 is connected: \"+ DFS.marked(10));\n System.out.println(\"6 and 0 is connected: \"+ DFS.marked(6));\n System.out.println(\"4 and 0 is connected: \"+ DFS.marked(0));\n System.out.println(\"12 and 0 is connected: \"+ DFS.marked(12));\n\n System.out.println(DFS.count()+\" vortexes connect with the vortex 0.\");\n\n }","public static void main(String[] args) {\n\n Main tree = new Main();\n tree.node = new Node(1);\n tree.node.lt = new Node(2);\n tree.node.lt.lt = new Node(4);\n tree.node.lt.rt = new Node(5);\n\n tree.node.rt = new Node(3);\n tree.node.rt.lt = new Node(6);\n tree.node.rt.rt = new Node(7);\n\n tree.DFS(tree.node);\n }","public static void main(String[] args) {\n\n BDNode a = new BDNode(\"A\");\n BDNode b = new BDNode(\"B\");\n BDNode c = new BDNode(\"C\");\n BDNode d = new BDNode(\"D\");\n BDNode e = new BDNode(\"E\");\n\n a.link(b);\n a.link(d);\n b.link(a);\n b.link(c);\n b.link(e);\n c.link(b);\n c.link(d);\n d.link(a);\n d.link(c);\n d.link(e);\n e.link(b);\n e.link(d);\n\n BDNode target = e;\n\n/*\n // BFS\n Queue<BDNode> queue = new LinkedList<>();\n queue.offer(a);\n\n while(!queue.isEmpty()) {\n BDNode n = queue.poll();\n n.visit();\n System.out.println(n); // 찾는 여정 출력\n\n if(n.equals(target)) {\n System.out.println(\"BFS Found! \" + n);\n break;\n }\n\n for (BDNode l : n.links) {\n if(l.isVisited()) continue;\n if (queue.contains(l)) continue;\n queue.offer(l);\n }\n\n // 위랑 같은 표현\n// n.links.stream()\n// .filter(l -> !queue.contains(l))\n// .forEach(queue::offer);\n }\n*/\n\n // DFS\n Stack<BDNode> stack = new Stack<>();\n stack.push(a);\n\n while(!stack.isEmpty()) {\n BDNode n = stack.pop();\n n.visit();\n System.out.println(n); // 찾는 여정 출력\n\n if (n.equals(target)) {\n System.out.println(\"DFS Found! \" + n);\n break;\n }\n\n for (BDNode l : n.links) {\n if (l.isVisited()) continue;\n if (stack.contains(l)) continue;\n\n stack.push(l);\n }\n }\n\n\n }","public static void main(String[] args)\r\n {\n PontoArticulacaoDFS graph = new PontoArticulacaoDFS();\r\n\r\n // Run DFS to find any articulation points (and biconnected components).\r\n graph.doArticulationPointDFS();\r\n\r\n // Display the results of the DFS.\r\n graph.showResults();\r\n }","private static void dfs(State curr) {\n curr.buildStack(curr.getSuccessors(curr));\r\n \r\n if(curr.isGoalState()) \r\n System.out.println(curr.getOrderedPair()+\" Goal\");//initial is goal state\r\n else\r\n System.out.println(curr.getOrderedPair());//initial\r\n \r\n curr.close.add(curr);\r\n while(!curr.open.isEmpty()&&!curr.isGoalState()) {\r\n curr.buildStack(curr.getSuccessors(curr));\r\n curr.printHelp(curr, 4);\r\n curr = curr.open.get(curr.open.size()-1);\r\n curr.close.add(curr.open.remove(curr.open.size()-1));\r\n }\r\n \r\n if(curr.isGoalState()) {\r\n System.out.println(curr.getOrderedPair() + \" Goal\");\r\n curr.printPath(curr);\r\n }\r\n }","void DFS(int v) {\n // Mark all the vertices as not visited(set as\n // false by default in java)\n boolean visited[] = new boolean[V];\n\n // Call the recursive helper function to print DFS traversal\n DFSUtil(v, visited);\n }","public static void run(State curr_state, int option, int depth) {\n switch(option) {\r\n case 3:\r\n bfs(curr_state);\r\n break;\r\n case 4:\r\n dfs(curr_state);\r\n break;\r\n case 5:\r\n iddfs(curr_state, depth);\r\n break;\r\n default:\r\n }\r\n }","public static void main(String[] args) {\n\n\t\tScanner sc = new Scanner(System.in);\n\t\tint V = sc.nextInt();\n\t\tint E = sc.nextInt();\n\n\t\tList<Integer>[]adjList = new ArrayList[10010];\n\t\tList<Integer>[]reverseAdjList = new ArrayList[10010];\n\n\t\tList<List<Integer>>scc = new ArrayList<List<Integer>>();\n\t\tint visited[] = new int[10010];\n\n\t\tfor(int i = 1 ; i <= V ; i++){\n\t\t\tadjList[i] = new ArrayList<Integer>();\n\t\t\treverseAdjList[i] = new ArrayList<Integer>();\n\t\t}\n\n\t\tfor(int i = 1 ; i <= E ; i++){\n\n\t\t\tint start = sc.nextInt();\n\t\t\tint end = sc.nextInt();\n\t\t\tadjList[start].add(end);\n\t\t\treverseAdjList[end].add(start);\n\t\t}\n\n\n\t\t//선작업 DFS 스택에 담음.\n\t\tStack <Integer>stack = new Stack<Integer>();\n\t\tfor(int i = 1 ; i <= V ; i++){\n\t\t\tif(visited[i] == 0){\n\t\t\t\tdfs(i,visited,stack,adjList);\n\t\t\t}\n\t\t}\n\n\n\t\t//후작업 역 DFS\n\t\tvisited = new int[10010];\n\n\t\tint r = 0;\n\t\twhile(!stack.isEmpty()){\n\n\t\t\tint here = stack.peek();\n\t\t\tstack.pop();\n\t\t\tif(visited[here] == 1){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tscc.add(new ArrayList<Integer>());\n\t\t\t++r;\n\t\t\treverseDFS(here, r-1, visited, scc, reverseAdjList);\n\n\t\t}\n\n\t\tSystem.out.println(r);\n\t\tfor(int i = 0 ; i < r ; i++){\n\t\t\tList <Integer>temp = scc.get(i);\n\t\t\tCollections.sort(temp);\n\t\t}\n\n\t\tscc.sort(new Comparator<List<Integer>>() {\n\t\t\t@Override\n\t\t\tpublic int compare(List<Integer> o1, List<Integer> o2) {\n\t\t\t\t// TODO Auto-generated method stub\n\t\t\t\tif(o1.get(0)< o2.get(0)){\n\t\t\t\t\treturn -1;\n\t\t\t\t}else if(o1.get(0) > o2.get(0)){\n\t\t\t\t\treturn 1;\n\t\t\t\t}\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t});\n\n\t\t\tfor(List <Integer>list : scc){\n\t\t\t\tfor(int i = 0 ; i < list.size() ; i++){\n\t\t\t\t\tSystem.out.print(list.get(i) + \" \");\n\t\t\t\t}\n\t\t\t\tSystem.out.println(\"-1\");\n\t\t\t}\n\n\t}","@Override\r\n\tpublic void DFS() {\r\n\t\tvertices.forEach((E e, Vertex<E> u) -> {\r\n\t\t\tu.setColor(Color.WHITE);\r\n\t\t\tu.setPredecessor(null);\r\n\t\t});\r\n\t\tDFStime = 0;\r\n\t\tvertices.forEach((E e, Vertex<E> u) -> {\r\n\t\t\tif(u.getColor() == Color.WHITE) {\r\n\t\t\t\tDFSVisit(u);\r\n\t\t\t}\r\n\t\t});\r\n\t}","public static void main(String[] args) {\n\t\tVector<Edge> edges = GraphReader.readFromFile(\"/tmp/tinyG.txt\",2);\r\n\t\tGraph G = new Graph(edges);\r\n int s = Integer.parseInt(\"1\");\r\n DepthFirstSearch search = new DepthFirstSearch(G.getNodeNum());\r\n Path res = search.dfs(G, s);\r\n res.packetToJson();\r\n //System.out.print(\"success!\");\r\n }","static void dfs(int u) { // DFS for normal usage: as graph traversal\r\n\t\t\t\t\t\t\t\t// algorithm\r\n\t\tSystem.out.printf(\" %d\", u); // this vertex is visited\r\n\t\tdfs_num[u] = DFS_BLACK; // important step: we mark this vertex as\r\n\t\t\t\t\t\t\t\t// visited\r\n\t\tfor (int j = 0; j < AdjList[u].size(); j++) {\r\n\t\t\tEdge v = AdjList[u].get(j); // v is a (neighbor,\r\n\t\t\t\t\t\t\t\t\t\t// weight) pair\r\n\t\t\tif (dfs_num[v.to] == DFS_WHITE) // important check to avoid\r\n\t\t\t\t\t\t\t\t\t\t\t// cycle\r\n\t\t\t\tdfs(v.to); // recursively visits unvisited neighbors v of\r\n\t\t\t\t\t\t\t// vertex u\r\n\t\t}\r\n\t}","private void DepthFirstSearch(Node current){\n helperDFS( current );\n }","@Override\r\n\tpublic void DFS(E src) {\r\n\t\tif(containsVertex(src)) {\r\n\t\t\tvertices.forEach((E e, Vertex<E> u) -> {\r\n\t\t\t\tu.setDiscovered(0);\r\n\t\t\t\tu.setFinished(0);\r\n\t\t\t\tu.setColor(Color.WHITE);\r\n\t\t\t\tu.setPredecessor(null);\r\n\t\t\t});\r\n\t\t\tDFStime = 1;\r\n\t\t\tVertex<E> s = vertices.get(src);\r\n\t\t\ts.setColor(Color.GRAY);\r\n\t\t\ts.setDiscovered(DFStime);\r\n\t\t\t//s.predecessor is already null so skip that step\r\n\t\t\tStack<Vertex<E>> stack = new Stack<>();\r\n\t\t\tstack.push(s);\r\n\t\t\twhile(!stack.isEmpty()) {\r\n\t\t\t\tVertex<E> u = stack.pop();\r\n\t\t\t\tArrayList<Edge<E>> adj = adjacencyLists.get(u.getElement());\r\n\t\t\t\tfor(Edge<E> ale: adj) {\r\n\t\t\t\t\tVertex<E> v = vertices.get(ale.getDst());\r\n\t\t\t\t\tif(v.getColor() == Color.WHITE) {\r\n\t\t\t\t\t\tDFStime++;\r\n\t\t\t\t\t\tv.setColor(Color.GRAY);\r\n\t\t\t\t\t\tv.setDiscovered(DFStime);\r\n\t\t\t\t\t\tv.setPredecessor(u);\r\n\t\t\t\t\t\tstack.push(v);\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\tu.setColor(Color.BLACK);\r\n\t\t\t\tDFStime++;\r\n\t\t\t\tu.setFinished(DFStime);\r\n\t\t\t}\r\n\t\t}\r\n\t}","private void dfs(String source) {\n visited.add(source);\n\n System.out.println(source);\n\n for (Object vertex : graph.get(source)) {\n if (!visited.contains(vertex))\n dfs((String) vertex);\n }\n }","void DFS(Node root) {\n\t\tStack<Node> s = new Stack<Node>();\n\t\ts.add(root);\n\n\t\twhile(!s.isEmpty()) {\n\t\t\tNode n = s.pop();\n\t\t\tif (n != null) {\n\t\t\t\tSystem.out.print(n.data + \",\");\n\t\t\t\ts.push(n.right);\n\t\t\t\ts.push(n.left);\n\t\t\t}\n\t\t}\n\t}","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\tStringTokenizer st = new StringTokenizer(br.readLine());\n\t\tN = Integer.parseInt(st.nextToken());\n\t\t\n\t\tint size = 1;\n\t\twhile(max_node > size) {\n\t\t\tsize *= 2;\n\t\t\tmax_level++;\n\t\t}\n\t\t\n\t\tfor(int i=0; i<= N; i++)\n\t\t{\n\t\t\tadj.add(new ArrayList<>());\n\t\t}\n\t\t\n\t\tint dx=0, dy=0, dz = 0;\n\t\tfor(int i=1; i<= N-1; i++)\n\t\t{\n\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\tdx = Integer.parseInt(st.nextToken());\n\t\t\tdy = Integer.parseInt(st.nextToken());\n\t\t\tadj.get(dx).add(dy);\n\t\t\tadj.get(dy).add(dx);\n\t\t}\n\t\t\n\t\tdepth[0] = -1;\n\t\tdfs(1,0);\n\t\t\n\t\tst = new StringTokenizer(br.readLine());\n\t\tM = Integer.parseInt(st.nextToken());\n\t\tfor(int i=1; i<= M; i++)\n\t\t{\n\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\tdx = Integer.parseInt(st.nextToken());\n\t\t\tdy = Integer.parseInt(st.nextToken());\n\t\t\tdz = Integer.parseInt(st.nextToken());\n\t\t\tcurDepth = -1; result = -1;\n\t\t\t\n\t\t\tquery(dx, dy);\n\t\t\tquery(dx, dz);\n\t\t\tquery(dy, dz);\n\t\t\t\n\t\t\tbw.write(result+\"\\n\");\n\t\t}\n\t\tbw.flush();\n\t}","public static void main(String[] args) {\n\n\n TreeNode mainTree = new TreeNode(50);\n TreeNode node2 = new TreeNode(17);\n TreeNode node3 = new TreeNode(12);\n TreeNode node4 = new TreeNode(23);\n TreeNode node5 = new TreeNode(14);\n TreeNode node6 = new TreeNode(54);\n TreeNode node7 = new TreeNode(72);\n TreeNode node8 = new TreeNode(67);\n TreeNode node9 = new TreeNode(19);\n TreeNode node10= new TreeNode(24);\n TreeNode node11 = new TreeNode(76);\n TreeNode node13 = new TreeNode(9);\n mainTree.left = node2;\n mainTree.right = node7;\n node2.left = node3;\n node2.right = node4;\n node4.left = node9;\n node4.right = node10;\n node3.left = node13;\n node3.right = node5;\n node7.left = node6;\n node7.right = node11;\n node6.right = node8;\n\n DepthFirstSearch.DFS(mainTree);\n }","public static void main(String[] args) {\n Graph graph = new Graph();\n graph.addEdge(0, 1);\n graph.addEdge(0, 4);\n\n graph.addEdge(1,0);\n graph.addEdge(1,5);\n graph.addEdge(1,2);\n graph.addEdge(2,1);\n graph.addEdge(2,6);\n graph.addEdge(2,3);\n\n graph.addEdge(3,2);\n graph.addEdge(3,7);\n\n graph.addEdge(7,3);\n graph.addEdge(7,6);\n graph.addEdge(7,11);\n\n graph.addEdge(5,1);\n graph.addEdge(5,9);\n graph.addEdge(5,6);\n graph.addEdge(5,4);\n\n graph.addEdge(9,8);\n graph.addEdge(9,5);\n graph.addEdge(9,13);\n graph.addEdge(9,10);\n\n graph.addEdge(13,17);\n graph.addEdge(13,14);\n graph.addEdge(13,9);\n graph.addEdge(13,12);\n\n graph.addEdge(4,0);\n graph.addEdge(4,5);\n graph.addEdge(4,8);\n graph.addEdge(8,4);\n graph.addEdge(8,12);\n graph.addEdge(8,9);\n graph.addEdge(12,8);\n graph.addEdge(12,16);\n graph.addEdge(12,13);\n graph.addEdge(16,12);\n graph.addEdge(16,17);\n graph.addEdge(17,13);\n graph.addEdge(17,16);\n graph.addEdge(17,18);\n\n graph.addEdge(18,17);\n graph.addEdge(18,14);\n graph.addEdge(18,19);\n\n graph.addEdge(19,18);\n graph.addEdge(19,15);\n LinkedList<Integer> visited = new LinkedList();\n List<ArrayList<Integer>> paths = new ArrayList<ArrayList<Integer>>();\n int currentNode = START;\n visited.add(START);\n new searchEasy().findAllPaths(graph, visited, paths, currentNode);\n for(ArrayList<Integer> path : paths){\n for (Integer node : path) {\n System.out.print(node);\n System.out.print(\" \");\n }\n System.out.println();\n }\n }","void DFSUtil(int v, boolean visited[]) {\n\t\t\tvisited[v] = true;\n\t\t\tSystem.out.println(v +\" \");\n\t\t\t\n\t\t\t//Recur all the vertices adjacents to this vertex\n\t\t\tIterator<Integer> i = adj[v].listIterator();\n\t\t\twhile(i.hasNext()) {\n\t\t\t\tint node = i.next();\n\t\t\t\tif(!visited[node]) {\n\t\t\t\t\tDFSUtil(node, visited);\n\t\t\t\t}\n\t\t\t}\n\t\t}","static void DFS(int Node)\n {\n\n visit[Node] = true;\n for (int i = 1; i < ver+1; i++) {\n\n\n if (map[Node][i] == 1 && visit[i] == false) {\n DFS(i);\n }\n\n }\n\n\n }","public static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n \n\t\tint n=sc.nextInt();\n \n for(int i=0;i<=n;i++)\n adj.add(new ArrayList<Integer>());\n\n for(int i=1;i<n;i++){\n int a=sc.nextInt();\n int b=sc.nextInt();\n adj.get(a).add(b);\n adj.get(b).add(a);\n }\n \n maxD=-1;\n dfs(1,0);\n \n //Arrays.fill(vis,0);\n for(int i=0;i<=n;i++) vis[i]=0;\n maxD=-1;\n dfs(maxNode,0);\n \n System.out.println(maxD);\n sc.close();\n\n\t}","public void topologicalSort() {\n\t\tboolean[] visited = new boolean[edges.length];\n\n\t\tfor (int i = 0; i < visited.length; i++) {\n\t\t\tif (visited[i] == false) {\n\t\t\t\tdfs(i, visited);\n\t\t\t}\n\t\t}\n\n\t}","public String DFS(int g) {\n\t\t//TODO\n\t}","public void solve() throws IOException {\n int n = ni(); \n int ax = ni(), ay = ni(), bx = ni(), by = ni(), cx = ni(), cy = ni(); \n boolean[][] visited = new boolean[n + 1][n + 1];\n if (dfs(n,ax,ay,bx,by,cx,cy,visited))\n System.out.println(\"YES\");\n else\n System.out.println(\"NO\");\n }","private static void dfs(int idx, boolean[] visited, boolean[] isbreak) {\n\t\tif(idx==N) {\n\t\t\t//System.out.println(\"����������\");\n\t\t\tint cnt=0;\n\t\t\tfor(int i=0; i<N; i++) {\n\t\t\t\tif(isbreak[i]) cnt++; \n\t\t\t}\n\t\t\tans=Math.max(ans, cnt);\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tif(isbreak[idx]) {\n\t\t\tdfs(idx+1, visited, isbreak); return;\n\t\t}\n\t\t\n\t\tboolean flag = false;\n\t\tfor(int i=0; i<N; i++) {\n\t\t\t//System.out.println(\"i:\"+i);\n\t\t\tif(i==idx) continue;\n\t\t\t\n\t\t\tif(!isbreak[i]) {\n\t\t\t\tflag=true;\n\t\t\t\t/*System.out.println(i+\"�� ģ��\");\n\t\t\t\tSystem.out.println(\"ġ����\");\n\t\t\t\tSystem.out.println(list.get(idx).inner+\" \"+list.get(idx).weight);\n\t\t\t\tSystem.out.println(list.get(i).inner+\" \"+list.get(i).weight);*/\n\t\t\t\tlist.get(idx).inner-=list.get(i).weight;\n\t\t\t\tlist.get(i).inner-=list.get(idx).weight;\n\t\t\t\t/*System.out.println(\"ġ����\");\n\t\t\t\tSystem.out.println(list.get(idx).inner+\" \"+list.get(idx).weight);\n\t\t\t\tSystem.out.println(list.get(i).inner+\" \"+list.get(i).weight);*/\n\t\t\t\tif(list.get(i).inner <= 0) isbreak[i]=true;\n\t\t\t\tif(list.get(idx).inner <= 0) isbreak[idx]=true;\n\t\t\t\t\n\n\t\t\t\tdfs(idx+1,visited,isbreak);\n\t\t\t\t\n\t\t\t\tlist.get(idx).inner+=list.get(i).weight;\n\t\t\t\tlist.get(i).inner+=list.get(idx).weight;\n\t\t\t\tif(list.get(i).inner > 0) isbreak[i]=false;\n\t\t\t\tif(list.get(idx).inner > 0) isbreak[idx]=false;\n\t\t\t}\n\t\t}\n\t\tif(!flag) {\n\t\t\tint cnt=0;\n\t\t\tfor(int i=0; i<N; i++) {\n\t\t\t\tif(isbreak[i]) cnt++; \n\t\t\t}\n\t\t\tans=Math.max(ans, cnt);\n\t\t\treturn;\n\t\t}\n\t\t\n\t}","public MyArrayList<MyArrayList<Node>> DFS() {\n t = 0;\n for (int i = 0; i < nodes.size(); i++) {\n Node node = nodes.get(i);\n // reset all nodes in the graph to the initial DFS state\n node.setColor(Color.WHITE);\n node.setD(0);\n node.setF(0);\n node.setParent(null);\n }\n MyArrayList<MyArrayList<Node>> components = new MyArrayList<>();\n for (int i = 0; i < nodes.size(); i++) {\n Node node = nodes.get(i);\n if (node.getColor() == Color.WHITE) {\n // each time we start from a vertex here we are starting a new DFS component\n MyArrayList<Node> component = new MyArrayList<>();\n dfsVisit(node, component);\n components.add(component);\n }\n }\n return components;\n }","public static void main(String[] args) {\n ArrayList<Integer> arr = new ArrayList<Integer>(); //각 영역의 넓이를 저장할 ArrayList 생성\n AdjMatrics_DFS b = new AdjMatrics_DFS();\n int[][] map = {{1,1,1,0,1},\n {1,1,0,0,1},\n {1,0,1,1,0},\n {0,0,1,1,1},\n {0,0,1,1,1}};\n boolean[][] check = new boolean[map.length][map[0].length]; //방문한 곳을 체크하기 위한 배열 행렬 생성\n\n for(int i=0; i<map.length; i++) {\n //System.out.println(\"다음 찾기 시작\");\n //(0,0) 부터 탐색 시작 후 1을 만나면 넓이 구하기 시작\n for(int j=0; j<map[i].length; j++) {\n if(map[i][j] == 1) {\n b.dfs(i,j,check,map);\n arr.add(cnt);\n cnt = 1;\n }\n // 아닌경우 continue\n else\n continue;\n }\n }\n //\tSystem.out.println(\"프로그램 종료\");\n System.out.println(\"arr : \"+ arr);\n }","public static void main(String[] args) {\n\t\tint answer = 0;\r\n\t\t\t\t\r\n\t\tScanner sc = new Scanner(System.in);\r\n\t\tint t = sc.nextInt();\r\n\t\t\r\n\t\t\r\n\t\twhile (t>0) {\r\n\t\t\tint n = sc.nextInt();\r\n\t\t\tint[] arr = new int[n+1];\r\n\t\t\tboolean[] visited = new boolean[n+1]; \r\n\t\t\tt--;\r\n\t\t\tfor(int i=1;i<=n;i++) {\r\n\t\t\t\tarr[i] = sc.nextInt();\r\n\t\t\t\tvisited[i] = false;\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\tfor(int i=1;i<=n;i++) {\r\n\t\t\t\tif (visited[i]==false) {\r\n\t\t\t\t\tdfs(arr,visited,i);\r\n\t\t\t\t\tanswer ++;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tSystem.out.println(answer);\r\n\t\t\tanswer = 0;\r\n\t\t}\r\n\t\t\r\n\t}","void dfs(SimpleVertex simpleVertex) {\n\n\t\twhile (true) {\n\t\t\tif (simpleVertex.isVisited == false) {\n\t\t\t\tsimpleVertex.isVisited = true;\n\t\t\t\tSystem.out.print(simpleVertex.Vertexname + \" \");\n\t\t\t\tfor (int i = 0; i < simpleVertex.neighborhood.size(); i++) {\n\t\t\t\t\tSimpleEdge node = simpleVertex.neighborhood.get(i);\n\n\t\t\t\t\tdfs(node.two);\n\t\t\t\t}\n\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\n\t}","void DFS(int v) {\n\t\t\tboolean visited[] = new boolean[number_of_vertices];\n\t\t\t\n\t\t\t//in case that the vertex are not connected, I need to make DFS for all\n\t\t\t//available vertex and checking before if they are not visited\n\t\t\tfor(int i = 0 ; i < number_of_vertices; i++) {\n\t\t\t\tif(visited[i] == false)\n\t\t\t\t\tDFSUtil(v, visited);\n\t\t\t}\n\t\t}","public void dfs (int start) {\n vertexList[start].wasVisited = true; // mark it\n print(start); stack.push(start);\n while (!stack.isEmpty()) {\n int b = getNextUnvisitedNeighbor(stack.peek());\n if (b==-1) stack.pop(); // no unvisited neighbor;\n else {\n vertexList[b].wasVisited = true;\n print(b); stack.push(b);\n }\n }\n // clear wasVisited marks\n }","private void DFS(Vertex x) {\r\n\t\tseen[vertices.indexOf(x)] = true;\r\n\t\tSystem.out.print(x.label + \" \");\r\n\t\tfor (int i = 0; i < x.outList.size(); i++) {\r\n\t\t\tif (!seen[vertices.indexOf(x.outList.get(i).vertex)]) {\r\n\t\t\t\tDFS(x);\r\n\t\t\t}\r\n\t\t}\r\n\t}","public static void main(String[] args) {\n\t\tint[][] edges = {{0,1},{1,2},{1,3},{4,5}};\n\t\tGraph graph = createAdjacencyList(edges, true);\n\t\tSystem.out.println(\"Number of connected graphs(Adjacency List) unDirected : \"+getNumberOfConnectedComponents(graph));\n\t\tSystem.out.println(\"Number of connected graphs(Adjacency List) Directed: \"+getNumberOfConnectedComponents(createAdjacencyList(edges, false)));\n\t\t\n\t\t//Shortest Distance & path\n\t\tint[][] edgesW = {{0,1,1},{1,2,4},{2,3,1},{0,3,3},{0,4,1},{4,3,1}};\n\t\tgraph = createAdjacencyList(edgesW, true);\n\t\tSystem.out.println(\"Shortest distance : \"+ getShortestDistance(graph, 0, 3));\n\t\t\n\t\t//Graph represented in Adjacency Matrix\n\t\tint[][] adjacencyMatrix = {{0,1,0,0,1,0},{1,0,1,1,0,0},{0,1,0,1,0,0},{0,1,0,0,0,0},{0,0,0,0,0,0},{0,0,0,0,0,0}};\n\t\t\n\t\t// Connected components or Friends circle\n\t\tSystem.out.println(\"Number of connected graphs(Adjacency Matrix) unDirected Recursive: \"+getNumberOfConnectedComponents(adjacencyMatrix));\n\t\tSystem.out.println(\"Number of connected graphs(Adjacency Matrix) unDirected Iterative: \"+getNumberOfConnectedComponents(adjacencyMatrix));\n\n\t\tSystem.out.println(\"Shortest distance : \"+ getShortestDistance(adjacencyMatrix, 0, 3));\n\t\t\n\t\t// Number of Islands\n\t\tint[][] islandGrid = {{1,1,0,1},{0,1,0,0},{0,0,1,1},{0,1,1,0}};\n\t\tSystem.out.println(\"Number of islands Recursive: \"+ getNumberOfIslands(islandGrid));\n\t\t// re-initialize\n\t\tint[][] islandGridIterative = {{1,1,0,0},{0,1,0,0},{0,0,1,1},{0,1,1,0}};\n\t\tSystem.out.println(\"Number of islands Iterative: \"+ getNumberOfIslandsIterative(islandGridIterative));\n\n\n\t}","void DFSUtil(int v, boolean visited[]) {\n \t// Mark the current node as visited and print it \n visited[v] = true; \n System.out.print(v + \" \"); \n \n for(int w: adj[v]) \n \tif (!visited[w]) { \n \t\tDFSUtil(w, visited);\n \t}\n }","public void dfs(Vertex<T> start) {\n\t\t\t// DFS uses Stack data structure\n\t\t\tStack<Vertex<T>> stack = new Stack<Vertex<T>>();\n\t\t\tstart.visited = true;\n\t\t\tstack.push(start);\n\t\t\tprintNode(start);\n\t\t\twhile (!stack.isEmpty()) {\n\t\t\t\tVertex<T> n = stack.peek();\n\t\t\t\tVertex<T> child = getUnvisitedChildren(n);\n\t\t\t\tif (child != null) {\n\t\t\t\t\tchild.visited = true;\n\t\t\t\t\tstack.push(child);\n\t\t\t\t\tprintNode(child);\n\t\t\t\t} else {\n\t\t\t\t\tstack.pop();\n\t\t\t\t}\n\t\t\t}\n\t\t}","public void dfs()\n{\n Stack s=new Stack();\n s.push(this.rootNode);\n rootNode.visited=true;\n printNode(rootNode);\n while(!s.isEmpty())\n {\n Node n=(Node)s.peek();\n Node child=getUnvisitedChildNode(n);\n if(child!=null)\n {\n child.visited=true;\n printNode(child);\n s.push(child);\n }\n else\n {\n s.pop();\n }\n }\n //Clear visited property of nodes\n clearNodes();\n}","static void graphCheck(int u) {\n\t\tdfs_num[u] = DFS_GRAY; // color this as DFS_GRAY (temp)\r\n\t\tfor (int j = 0; j < (int) AdjList[u].size(); j++) {\r\n\t\t\tEdge v = AdjList[u].get(j);\r\n\t\t\tif (dfs_num[v.to] == DFS_WHITE) { // Tree Edge, DFS_GRAY to\r\n\t\t\t\t\t\t\t\t\t\t\t\t// DFS_WHITE\r\n\t\t\t\tdfs_parent[v.to] = u; // parent of this children is me\r\n\t\t\t\tgraphCheck(v.to);\r\n\t\t\t} else if (dfs_num[v.to] == DFS_GRAY) { // DFS_GRAY to DFS_GRAY\r\n\t\t\t\tif (v.to == dfs_parent[u]) // to differentiate these two\r\n\t\t\t\t\t\t\t\t\t\t\t// cases\r\n\t\t\t\t\tSystem.out.printf(\" Bidirectional (%d, %d) - (%d, %d)\\n\",\r\n\t\t\t\t\t\t\tu, v.to, v.to, u);\r\n\t\t\t\telse\r\n\t\t\t\t\t// la mas usada pillar si tiene un ciclo\r\n\t\t\t\t\tSystem.out.printf(\" Back Edge (%d, %d) (Cycle)\\n\", u, v.to);\r\n\t\t\t} else if (dfs_num[v.to] == DFS_BLACK) // DFS_GRAY to DFS_BLACK\r\n\t\t\t\tSystem.out.printf(\" Forward/Cross Edge (%d, %d)\\n\", u, v.to);\r\n\t\t}\r\n\t\tdfs_num[u] = DFS_BLACK; // despues de la recursion DFS_BLACK (DONE)\r\n\t}","private static void dfsRecursive(Node node) {\n\t\t//if the node state isn't undiscovered it has already been accounted for\n\t\tif(node == null || node.state != Node.State.UNDISCOVERED) {\n\t\t\treturn;\n\t\t}\n\t\tnode.state = Node.State.DISCOVERED;\n\n\t\t//process node\n\t\tSystem.out.print(node.name + \" -> \");\n\t\t\n\t\tfor(Edge e : node.edges) {\n\t\t\tdfsRecursive(e.getNeighbor(node));\n\t\t}\n\t\t\t\n\t\t//finished with this node\n\t\tnode.state = Node.State.COMPLETE;\n\t}","public void depthFirstSearch(Node vertex){\n vertex.visited = true;\n if(vertex.row == row_size-1 && vertex.col == col_size-1){\n while(!dfs_stack.isEmpty()){\n exitPath +=dfs_stack.peek(); \n dfs_stack.pop();\n } \n }\n if(vertex.north!=null && vertex.north.visited==false){\n dfs_stack.push(\"N\");\n vertex.depthFirstSearch(vertex.north);\n }\n if(vertex.south!=null && vertex.south.visited==false){\n dfs_stack.push(\"S\");\n vertex.depthFirstSearch(vertex.south);\n }\n if(vertex.west !=null && vertex.west.visited ==false){\n dfs_stack.push(\"W\");\n vertex.depthFirstSearch(vertex.west);\n }\n if(vertex.east !=null && vertex.east.visited==false){\n dfs_stack.push(\"E\");\n vertex.depthFirstSearch(vertex.east);\n }\n if (!dfs_stack.isEmpty()){\n dfs_stack.pop();\n }\n return;\n }","static void dfs(Node current, Set<Node> visited) {\n System.out.print(\"Node \" + current.val + \", \");\n\n // adds the current node to the set of already visited nodes\n visited.add(current);\n\n // loops over the neighbours of the current node\n for (Node neighbour: current.neighbours) {\n\n // if the neighbour has not been already visited\n if (! visited.contains(neighbour)) {\n\n // recursively processes the neighbour\n dfs(neighbour, visited);\n }\n }\n }","public static void main(String[] args) {\n\n G g = new G(6, true, new int[][] { {0, 1}, {1, 2}, {2, 3}, {3, 4}, {4, 0}, {3, 5} });\n\n g.print();\n g.dfs();\n g.bfs();\n\n System.out.println();\n System.out.println();\n\n // 1 -> 2\n // 0 / \\/\n // \\ 4 -> 3 -> 5\n\n G gDirected = new G(6, false, new int[][] { {0, 1}, {1, 2}, {2, 3}, {3, 5}, {0, 4}, {4, 3} });\n\n gDirected.print();\n gDirected.dfs();\n gDirected.bfs();\n gDirected.topoSort();\n }","static void floodfill() {\r\n\t\tprintThis(\"Flood Fill Demo (the input graph must be UNDIRECTED)\");\r\n\t\tnumComp = 0;\r\n\t\tdfs_num = new int[V];\r\n\t\tArrays.fill(dfs_num, DFS_WHITE);\r\n\t\tfor (int i = 0; i < V; i++)\r\n\t\t\tif (dfs_num[i] == DFS_WHITE)\r\n\t\t\t\tfloodfill(i, ++numComp);\r\n\t\tfor (int i = 0; i < V; i++)\r\n\t\t\tSystem.out.printf(\"Vertex %d has color %d\\n\", i, dfs_num[i]);\r\n\t}","public static void depthFirstSearchIterative(ArrayList<Node> graph) {\n\t\tSystem.out.println(\"DFS Iterative:\");\n\t\tif(graph.size() == 0) {\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tGraphUtils.cleanGraph(graph);\n\n\t\tDeque<Node> stack = new ArrayDeque<Node>();\n\t\tfor(Node node : graph) {\n\t\t\tif(node.state != Node.State.UNDISCOVERED) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tnode.state = Node.State.DISCOVERED;\n\t\t\tstack.push(node);\n\t\t\twhile(!stack.isEmpty()) {\n\t\t\t\tnode = stack.pop();\n\t\t\t\t\n\t\t\t\t//process node\n\t\t\t\tSystem.out.print(node.name + \" -> \");\n\t\t\t\t\n\t\t\t\tfor(Edge e : node.edges) {\n\t\t\t\t\t//process edge\n\t\t\t\t\tNode neighbor = e.getNeighbor(node);\n\t\t\t\t\t\n\t\t\t\t\t//first time we see this node it gets added to the stack for later processing\n\t\t\t\t\tif(neighbor.state == Node.State.UNDISCOVERED) {\n\t\t\t\t\t\tneighbor.state = Node.State.DISCOVERED;\n\t\t\t\t\t\tstack.push(neighbor);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t//finished with this node\n\t\t\t\tnode.state = Node.State.COMPLETE;\n\t\t\t}\n\t\t}\n\t\tSystem.out.println();\n\t\tGraphUtils.cleanGraph(graph);\n\t}","private void doDFSRecursive(int vertex) {\n markVisited(vertex);\n\n for (Integer adjacentVertex : graph.getAdjacentVertices(vertex)) {\n if (!isVisitedNode(adjacentVertex)) {\n System.out.print(adjacentVertex + \" \");\n doDFSRecursive(adjacentVertex);\n }\n }\n }","public static void main(String[] args) {\n\t\tBFS breadFirstSearch = new BFS();\n\n\t\t// creating an object of class DFS\n\t\tDFS depthFirstSearch = new DFS();\n\n\t\tchar choice, opt;\n\t\tScanner in = new Scanner(System.in);\n\n\t\tdo {\n\t\t\tSystem.out.println(\"Enter your choice of search\");\n\t\t\tSystem.out.println(\"Press 'b' for breadth first search\");\n\t\t\tSystem.out.println(\"Press 'd' for depth first search\");\n\t\t\tchoice = Character.toLowerCase(in.next().charAt(0));\n\n\t\t\t// creating a set of vertices\n\t\t\tVertex vertex1 = new Vertex(1);\n\t\t\tVertex vertex2 = new Vertex(2);\n\t\t\tVertex vertex3 = new Vertex(3);\n\t\t\tVertex vertex4 = new Vertex(4);\n\t\t\tVertex vertex5 = new Vertex(5);\n\n\t\t\t// connecting the vertices to each other to make the graph\n\t\t\tvertex1.addNeighbourVertex(vertex2);\n\t\t\tvertex1.addNeighbourVertex(vertex4);\n\t\t\tvertex4.addNeighbourVertex(vertex5);\n\t\t\tvertex2.addNeighbourVertex(vertex3);\n\n\n\t\t\tswitch (choice) {\n\t\t\tcase 'd' : \n\t\t\t\t// start the depth first search starting from vertex1\n\t\t\t\tdepthFirstSearch.iterativeDFS(vertex1); break;\n\n\t\t\tcase 'b':\n\t\t\t\t// start the breadth first search starting from vertex1\n\t\t\t\tbreadFirstSearch.bfs(vertex1); break;\n\n\t\t\tdefault: System.out.println(\"wrong input\");\n\t\t\t}\n\n\t\t\tSystem.out.println(\"Want to continue (y/n)\");\n\t\t\topt = Character.toLowerCase(in.next().charAt(0));\n\t\t} while (opt == 'y');\n\t\tin.close();\n\t}","private void dfsVisit(Node node) {\n\t\tStack<Node>stack = new Stack<>();\r\n\t\tstack.push(node); //add source node to queue\r\n\t\twhile(!stack.isEmpty()) {\r\n\t\t\tNode presentNode = stack.pop();\r\n\t\t\tpresentNode.setVisited(true);\r\n\t\t\tSystem.out.print(presentNode.getName()+\" \");\r\n\t\t\tfor(Node neighbor: presentNode.getNeighbors()) { //for each neighbor of present node\r\n\t\t\t\tif(!neighbor.isVisited()) { //if neighbor is not visited then add it to queue\r\n\t\t\t\t\tstack.push(neighbor);\r\n\t\t\t\t\tneighbor.setVisited(true);\r\n\t\t\t\t}\r\n\t\t\t}//end of for loop\r\n\t\t}//end of while loop\r\n\t\t\r\n\t}","public static void main(String[] args) {\n\t\tGraph graph = new Graph();\n\t\tgraph.addEdge(1, 2);\n\t\tgraph.addEdge(1, 3);\n\t\tgraph.addEdge(1, 3);\n\t\tgraph.addEdge(2, 5);\n\t\tgraph.addEdge(2, 6);\n\t\tgraph.addEdge(5, 9);\n\t\tgraph.addEdge(5, 10);\n\t\tgraph.addEdge(4, 7);\n\t\tgraph.addEdge(4, 8);\n\t\tgraph.addEdge(7, 11);\n\t\tgraph.addEdge(7, 12);\n\t\tgraph.addVertex(0);\n\t\tgraph.addVertex(13);\n\t\tgraph.addVertex(14);\n\n\t\t// vertex 0, 13 and 14 are single nodes\n\n\t\tTraversalBfsDfs bfs = new TraversalBfsDfs();\n\t\tbfs.runBFS(graph);\n\t\tbfs.runDFS(graph);\n\n\t}","void DFS(int v, boolean visited[]) {\n visited[v] = true;\n connected++;\n //LinkedList Iterator to Recursively traverse all adjacent nodes of v\n Iterator<Integer> itr = adj[v].listIterator();\n\n while(itr.hasNext()) {\n int x = itr.next();\n if(visited[x] == false)\n DFS(x,visited);\n }\n }","public static void main(String args[]) {\n int V = 4;\n Graph g = new Graph(V);\n g.addEdge(0, 1);\n g.addEdge(0, 2);\n g.addEdge(1, 2);\n g.addEdge(2, 0);\n g.addEdge(2, 3);\n g.addEdge(3, 3);\n\n int src = 1;\n int dest = 3;\n boolean[] visited = new boolean[V];\n\n // To store the complete path between source and destination\n Stack<Integer> path1 = new Stack<>();\n\n if (hasPathDFS(g, src, dest, visited, path1)) {\n System.out.println(\"There is a path from \" + src + \" to \" + dest);\n System.out.println(\"The complete path is \" + path1);\n } else System.out.println(\"There is no path from \" + src + \" to \" + dest);\n\n src = 3;\n dest = 1;\n // To store the complete path between source and destination\n Stack<Integer> path2 = new Stack<>();\n\n if (hasPathDFS(g, src, dest, visited, path2)) System.out.println(\"There is a path from \" + src + \" to \" + dest);\n else System.out.println(\"There is no path from \" + src + \" to \" + dest);\n\n // total number of nodes in the graph (labeled from 0 to 7)\n int n = 8;\n\n // List of graph edges as per the above diagram\n Graph g2 = new Graph(n);\n /**\n * There is a path from 1 to 3\n * The complete path is [1, 2, 3]\n * There is no path from 3 to 1\n * There is a path from 0 to 7\n * The complete path is [0, 3, 4, 6, 7]\n */\n\n g2.addEdge(0, 3);\n g2.addEdge(1, 0);\n g2.addEdge(1, 2);\n g2.addEdge(1, 4);\n g2.addEdge(2, 7);\n g2.addEdge(3, 4);\n g2.addEdge(3, 5);\n g2.addEdge(4, 3);\n g2.addEdge(4, 6);\n g2.addEdge(5, 6);\n g2.addEdge(6, 7);\n\n // source and destination vertex\n src = 0;\n dest = 7;\n\n // To store the complete path between source and destination\n Stack<Integer> path = new Stack<>();\n boolean[] visited2 = new boolean[n];\n\n if (hasPathDFS(g2, src, dest, visited2, path)) {\n System.out.println(\"There is a path from \" + src + \" to \" + dest);\n System.out.println(\"The complete path is \" + path);\n } else System.out.println(\"There is no path from \" + src + \" to \" + dest);\n\n\n }","public static void main(String[] args) {\n\t\tlong start=System.currentTimeMillis();\r\n\r\n\t\tGraph g = new Graph(9);\r\n\t\tg.addEdge(0, 1);\r\n\t\tg.addEdge(1, 2);\r\n\t\tg.addEdge(1, 3);\r\n\t\tg.addEdge(2, 4);\r\n\t\tg.addEdge(2, 3);\r\n\t\tg.addEdge(3, 4);\r\n\t\tg.addEdge(3, 5);\r\n\t\tg.addEdge(5, 6);\r\n\t\tg.addEdge(5, 7);\r\n\t\tg.addEdge(6, 8);\r\n\t\t//g.dfs();\r\n\t\t//0 1 3 5 7 6 8 4 2 0.004초\r\n\t\t//g.bfs();\r\n\t\t//0 1 2 3 4 5 6 7 8 0.006초\r\n\t\tg.dfsR(); \r\n\t\t//0 1 2 3 4 5 6 7 8 0.004초 \r\n\t\t\r\n\t\t\r\n\t\tlong end = System.currentTimeMillis();\r\n\t\tSystem.out.println(\" 실행 시간 : \" + (end - start)/1000.0 + \"초\");\r\n\t\t\r\n\t\r\n\t}","void DFS(int head) {\n //visited boolean array maintained to keep track of visited nodes and to avoid infinite looping\n boolean visited[] = new boolean[V+1];\n if(visited[head] == false)\n DFS(head,visited);\n\n System.out.println(V-connected);\n }","public void dfs(DSAGraphVertex vx, DSAStack visited, DSAQueue queue)\n\t{\n\t\ttry {\n\t\t\tif(vx != null) //base case if it's null end recursion\n\t\t\t{\n\t\t\t\tvisited.push(vx); //push onto visited stack\n\n\t\t\t\tIterator<DSAGraphVertex> itr = vx.getAdjacent().iterator();\n\n\t\t\t\tdo{\n\t\t\t\t\twhile (itr.hasNext())\n\t\t\t\t\t{\n\t\t\t\t\t\tvx = itr.next();\n\t\t\t\t\t\tif(!vx.getVisited()) //if not visited traverse here\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tqueue.enqueue(vx); //adds to output queue\n\t\t\t\t\t\t\tvx.setVisited(); //sets to visited\n\t\t\t\t\t\t\tdfs(vx, visited, queue);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tvisited.pop();\n\n\t\t\t\t} while(!visited.isEmpty());\n\t\t\t}\n\t\t}\n\t\tcatch (IllegalArgumentException e) //catches empty stack exceptions\n\t\t{\n\t\t\t//System.out.println(e.getMessage());\n\t\t}\n\n\t}","public void run() {\n BFS();\n printBFS();\n shortestPathList();\n printShortestPath();\n printPath();\n }","private void dfs(Node s, HashSet<Integer> visited) {\n\t\tif(visited.contains(s.id)) {\n\t\t\treturn;\n\t\t}\n\t\tSystem.out.println(s.id);\n\t\tvisited.add(s.id);\n\t\tfor(Node n :s.adj) {\n\t\t\tdfs(n,visited);\n\t\t}\n\t}","@Override\n\tpublic void run() {\n\t\tMap<Integer, Location> possibleStartLocations = possibleStartLocations();\n\n\t\tfor(Entry<Integer, Location> startLocation : possibleStartLocations.entrySet()) {\n\t\t\t// Add startLocation to visited locations\n\t\t\tMap<Integer, Location> visitedLocations = new HashMap<Integer, Location>();\n\t\t\tvisitedLocations.put(startLocation.getKey(), startLocation.getValue());\n\t\t\t\n\t\t\t// Add startLocation to visited order\n\t\t\tList<Location> visitedOrder = new LinkedList<Location>();\n\t\t\tvisitedOrder.add(startLocation.getValue());\n\t\t\t\n\t\t\t// Start the recursion for the following start node\n\t\t\tfindSolution(startLocation, startLocation, visitedLocations, visitedOrder, 0);\n\t\t}\n\t}","private void propagateFeatures () {\n Logger.log(\"Propagating invocations through the Call Graph - DFS\");\n Set<SootMethod> calculated = new HashSet<SootMethod>();\n Chain<SootClass> classes = Scene.v().getApplicationClasses();\n SootClass c = null;\n SootMethod m = null;\n try {\n for (SootClass sclass : classes) {\n c = sclass;\n List<SootMethod> methods = sclass.getMethods();\n for (SootMethod method : methods) {\n m = method;\n if (!calculated.contains(method)) {\n propagateFeatures(method, calculated);\n }\n }\n }\n } catch (Exception e) {\n // handling\n }\n }","static void dfs(int[][] G){\n\t\tStack<Integer> s = new Stack<Integer>();\n\t\tfor (int ver_start=0; ver_start<N; ver_start++){\n\t\t\tif (visited[ver_start]) continue;\n\t\t\ts.push(ver_start);\n\t\t\tvisited[ver_start] = true;\n\n\t\t\twhile(!s.isEmpty()){\n\t\t\t\tint vertex = s.pop();\n\t\t\t\tSystem.out.print((vertex+1) + \" \");\n\t\t\t\tfor (int i=0; i<N; i++){\n\t\t\t\t\tif (G[vertex][i] == 1 && !visited[i]){\n\t\t\t\t\t\t// find neigbor of current vertex and not visited\n\t\t\t\t\t\t// add into the stack\n\t\t\t\t\t\ts.push(i);\n\t\t\t\t\t\tvisited[i] = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tSystem.out.println();\n\t\t}\n\t}","void DFSUtil(int v, boolean visited[]) {\n // Mark the current node as visited and print it\n visited [v] = true;\n System.out.print(v + \" \");\n\n // Recur for all the vertices adjacent to this vertex\n Iterator<Integer> i = adj [v].listIterator();\n while (i.hasNext()) {\n int n = i.next();\n if (!visited [n])\n DFSUtil(n, visited);\n }\n }","public void dft() {\r\n\t\tHashMap<String, Boolean> processed = new HashMap<>();\r\n\t\tLinkedList<Pair> stack = new LinkedList<>();\r\n\r\n\t\tArrayList<String> vnames = new ArrayList<>(vces.keySet());\r\n\t\tfor (String vname : vnames) {\r\n\t\t\tif (processed.containsKey(vname)) {\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\r\n\t\t\tPair rootpair = new Pair(vname, vname);\r\n\t\t\tstack.addFirst(rootpair);\r\n\t\t\twhile (stack.size() != 0) {\r\n\t\t\t\t// 1. removeFirst\r\n\t\t\t\tPair rp = stack.removeFirst();\r\n\r\n\t\t\t\t// 2. check if processed, mark if not\r\n\t\t\t\tif (processed.containsKey(rp.vname)) {\r\n\t\t\t\t\tcontinue;\r\n\t\t\t\t}\r\n\t\t\t\tprocessed.put(rp.vname, true);\r\n\r\n\t\t\t\t// 3. Check, if an edge is found\r\n\t\t\t\tSystem.out.println(rp.vname + \" via \" + rp.psf);\r\n\r\n\t\t\t\t// 4. Add the unprocessed nbrs back\r\n\t\t\t\tArrayList<String> nbrnames = new ArrayList<>(rp.vtx.nbrs.keySet());\r\n\t\t\t\tfor (String nbrname : nbrnames) {\r\n\t\t\t\t\tif (!processed.containsKey(nbrname)) {\r\n\t\t\t\t\t\tPair np = new Pair(nbrname, rp.psf + nbrname);\r\n\t\t\t\t\t\tstack.addFirst(np);\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}","public void dfs (Node node) {\r\n\t\t\r\n\t\tSystem.out.print(node.data+\" \");\r\n\t\tList<Node> adding = node.getPartners();\r\n\t\tnode.visited = true;\r\n\t\t\tfor(int loop=0; loop<adding.size(); loop++) {\r\n\t\t\t\tNode n = adding.get(loop);\r\n\t\t\t\t\tif (n!=null && !n.visited) {\r\n\t\t\t\t\t\tdfs(n);\r\n\t\t\t\t\t} // if loop ends here\r\n\t\t\t\t\t\r\n\t\t\t} // for loop ends here\r\n\t\t\r\n\t}","void DFSearch(BFSNode n){\n\t\tn.discovered=true;\r\n\t\tSystem.out.print(\" discovered\");\r\n\t\tn.preProcessNode();\r\n\t\tfor( Integer edg: n.edges){\r\n\t\t\tn.processEdge(edg);\r\n\t\t\tif(!nodes[edg].discovered){\r\n\t\t\t\tnodes[edg].parent = n; \r\n\t\t\t\tnodes[edg].depth = n.depth +1;\r\n\t\t\t\t\r\n\t\t\t\tSystem.out.print(\"{new track with parent [\"+ nodes[edg].parent.value+\"] }\");\r\n\t\t\t\tDFSearch(nodes[edg]);\r\n\t\t\t}\r\n\t\t\telse{\r\n\t\t\t\tif(nodes[edg] != n.parent){\r\n\t\t\t\t\tSystem.out.print(\"{LOOP}\");\r\n\t\t\t\t\tif(nodes[edg].depth < n.reachableLimit.depth){\r\n\t\t\t\t\t\tn.reachableLimit = nodes[edg];\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\telse{\r\n\t\t\t\t\tSystem.out.print(\"{second visit}\");\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\tSystem.out.println(\"back from node [ \"+n.value +\" ]\");\r\n\t\tn.postProcessNode();\r\n\t\tn.processed = true;\r\n\t\t\r\n\t}","private void DFS(Vertex start, Set<Vertex> visited, Stack<Vertex> stack) {\r\n\t\t// if(visited.contains(start)) return;\r\n\r\n\t\t// Mark the current node as visited and push it\r\n\t\tvisited.add(start);\r\n\t\tstack.push(start);\r\n\r\n\t\tVertex currentNode;\r\n\t\tSet<Vertex> neighbors;\r\n\r\n\t\twhile (stack.size() > 0) {\r\n\t\t\t// Pop a vertex from stack and print it\r\n\t\t\tcurrentNode = stack.pop();\r\n\r\n\t\t\tSystem.out.print(currentNode + \" \");\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\tneighbors = currentNode.getNeighbors();\r\n\r\n\t\t\tfor (Vertex n : neighbors) {\r\n\t\t\t\tif (!visited.contains(n)) {\r\n\t\t\t\t\tvisited.add(n);\r\n\t\t\t\t\tstack.push(n);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}","private static void DFS(int v, int CC, UndirectedGraphAPI graph) {\n\t\tcolor[v] = GRAY;\n\t\tidArray[v] = CC;\n\t\tArrayList<Edge> list = graph.getAdj()[v];\n\t\tfor(Edge edge : list){\n\t\t\tint w = edge.getOtherVertex(v);\n\t\t\tif(color[w] == WHITE){\n\t\t\t\tcount++;\n\t\t\t\tDFS(w, CC, graph);\n\t\t\t}\n\t\t}\n\t\tcolor[v] = BLACK;\n\t}","public void depthFirstTraverse() {\n\t\tInteger first = (Integer) edges.keySet().toArray()[0];\n\t\t// track whether vertex was visited\n\t\tHashMap<Integer, Boolean> visited = buildVisited();\n\t\tdepthFirstTraverse(first, visited);\n\t}","public static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint tc = sc.nextInt();\n\t\tfor (int T = 0; T < tc; T++) {\n\t\t\tint V = sc.nextInt();\n\t\t\tint E = sc.nextInt();\n\t\t\tint[][] graph = new int[V][V];\n\t\t\tfor (int i = 0; i < E; i++) {\n\t\t\t\tint start = sc.nextInt();\n\t\t\t\tint end = sc.nextInt();\n\t\t\t\tgraph[start][end] = 1;\n\t\t\t\t// graph[end][start] = 1;\n\t\t\t}\n\n\t\t\tfront = 0;\n\t\t\tstack = new int[V];\n\t\t\tjava.util.Arrays.fill(stack, -1);\n\t\t\tvisited = new int[V];\n\t\t\tfound = false;\n\t\t\tint src = 0;\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\tfor (int i = 0; i < V; i++) {\n\t\t\t\t\n\t\t\t\tif(found == false && visited[i] ==0){\n\t\t\t\t\tstack[front++] = i;\n\t\t\t\t\tDFS(graph,i);\n\t\t\t\t}\n\t\t\t\tif(found == true)\n\t\t\t\t\tbreak;\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\tif(found == true){\n\t\t\t\tSystem.out.println(\"Found\");\n\t\t\t\tfor (int j = 0; j < front; j++) {\n\t\t\t\t\tSystem.out.println(stack[j]);\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tSystem.out.println(\"Not Found\");\n\t\t\t}\n\t\t}\n\t}","public void doDfsIterative(Graph g, int s) {\n boolean[] myVisited = new boolean[8];\n Stack<Integer> stack = new Stack<>();\n stack.push(s);\n myVisited[s] = true;\n while (!stack.isEmpty()) {\n int top = stack.pop();\n System.out.print(\"[\" + top + \"] \");\n for (int e : g.adj[top]) {\n if (!myVisited[e]) {\n stack.push(e);\n myVisited[e] = true;\n }\n }\n }\n\n }","public static void main(String[] args) {\n SearchTree search = new SearchTree(new Node(INITIAL_STATE), GOAL_STATE);\n long startTime = System.currentTimeMillis();\n\n search.breadthFirstSearch();\n// search.depthFirstSearch();\n// search.iterativeDeepening(10);\n\n long finishTime = System.currentTimeMillis();\n long totalTime = finishTime - startTime;\n System.out.println(\"\\n[Elapsed time: \" + totalTime + \" milliseconds]\");\n System.out.println(\"========================================================\");\n }","static void iterativeDfs(Node startingNode) {\n Set<Node> markedAsVisited = new HashSet<>();\n\n // creates a stack for piling up the nodes to visit\n ArrayDeque<Node> toBeVisited = new ArrayDeque<>();\n\n // sets the starting node as to be visited\n toBeVisited.push(startingNode);\n\n // adds the starting node to the set of marked as visited nodes\n markedAsVisited.add(startingNode);\n\n // while there nodes to visit\n while (!toBeVisited.isEmpty()) {\n\n // gets the current node\n Node current = toBeVisited.pop();\n\n // processes the node\n System.out.print(\"Node \" + current.val + \", \");\n\n // loops over the neighbours of the current node\n for (Node neighbour: current.neighbours) {\n\n // if the neighbour has not been already visited\n if (! markedAsVisited.contains(neighbour)) {\n\n // adds the neighbour to the ones to be visited\n toBeVisited.push(neighbour);\n\n // adds the neighbour to the set of marked as visited nodes\n markedAsVisited.add(neighbour);\n }\n }\n }\n }","public static void main(String[]args) throws Exception{\n\t\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\r\n\t\tint n = Integer.parseInt(br.readLine());\r\n\t\tint m = Integer.parseInt(br.readLine());\r\n\t\tarr = new int[n+1][n+1];\r\n\t\tvisited = new boolean[n+1];\r\n\t\t\r\n\t\tStringTokenizer st;\r\n\t\tfor(int i=0; i<m; i++) {\r\n\t\t\tst = new StringTokenizer(br.readLine());\r\n\t\t\tint f = Integer.parseInt(st.nextToken());\r\n\t\t\tint b = Integer.parseInt(st.nextToken());\r\n\t\t\tarr[f][b] = 1;\r\n\t\t\tarr[b][f] = 1;\t\t\t\r\n\t\t}\r\n\t\t\r\n\t\t\r\n\t\tdfs(1);\r\n\t\tSystem.out.println(result);\r\n\t}","public static void main(String[] args) {\nDGraph g=new DGraph();\r\nDirectedDFS d=new DirectedDFS(g);\r\nfor(Iterator<Integer> i=d.preorder.iterator();i.hasNext();)\r\n{\r\n\tSystem.out.print(i.next()+\" \");\r\n}\r\nSystem.out.println();\r\nfor(Iterator<Integer> i=d.postorder.iterator();i.hasNext();)\r\n{\r\n\tSystem.out.print(i.next()+\" \");\r\n}\r\nSystem.out.println();\r\n\r\n/*for(Iterator i=d.topologicalorder.iterator();i.hasNext();)\r\n{\r\n\tSystem.out.print(i.next()+\" \");\r\n}\r\nSystem.out.println();*/\r\n\r\n\r\n\tfor(int w:d.reversepost())\r\n\t\tSystem.out.print(w+\" \");\r\n\t//System.out.println(d.topologicalorder.pop());\r\n\t}","@Test\n public void dfsRecursiveTest() {\n Map<String, List<String>> graph = new HashMap<>();\n graph.put(\"A\", Lists.newArrayList(\"B\", \"S\"));\n graph.put(\"B\", Lists.newArrayList(\"A\"));\n graph.put(\"C\", Lists.newArrayList(\"D\", \"E\", \"F\", \"S\"));\n graph.put(\"D\", Lists.newArrayList(\"C\"));\n graph.put(\"E\", Lists.newArrayList(\"C\", \"H\"));\n graph.put(\"F\", Lists.newArrayList(\"C\", \"G\"));\n graph.put(\"G\", Lists.newArrayList(\"F\", \"H\", \"S\"));\n graph.put(\"H\", Lists.newArrayList(\"E\", \"G\"));\n graph.put(\"S\", Lists.newArrayList(\"A\", \"C\", \"G\"));\n\n List<String> traversal = new DFSRecursive().runDFS(\"A\", graph);\n\n Assert.assertEquals(Lists.newArrayList(\"A\", \"B\", \"S\", \"C\", \"D\", \"E\", \"H\", \"G\", \"F\"), traversal);\n }","private void visitDFS(Dot node, Set< Dot > visited ) {\n\n board.getNeighbors( node ).forEach( nbr -> {\n if ( !visited.contains( nbr ) ) {\n visited.add( nbr );\n visitDFS( nbr, visited );\n }\n } );\n }","private static void dfs(int x, int y) {\n arr[x][y] = 1;\n area++;\n \n for(int i=0; i<4; i++) {\n int nx = x + dx[i];\n int ny = y + dy[i];\n \n if(0 <= nx && nx < m && 0 <= ny && ny < n) {\n if(arr[nx][ny] == 0)\n dfs(nx, ny);\n }\n }\n\t\t\n\t}","private static void initTopologicalSortDFS(int V) {\r\n\t\t// // make sure that the given graph is DAG\r\n\t\tprintThis(\"Topological Sort (the input graph must be DAG)\");\r\n\t\ttopoSort = new ArrayList<Integer>();\r\n\t\ttopoSort.clear();\r\n\t\tdfs_num = new int[V];\r\n\t\tArrays.fill(dfs_num, DFS_WHITE);\r\n\r\n\t\tfor (int i = 0; i < V; i++)\r\n\t\t\t// this part is the same as finding CCs\r\n\t\t\tif (dfs_num[i] == DFS_WHITE)\r\n\t\t\t\t// asi se hace todo el topological\r\n\t\t\t\ttopologicalSortDFS(i);\r\n\t\tCollections.reverse(topoSort);\r\n\t\t// reverse topoSort\r\n\t\tfor (int i = 0; i < topoSort.size(); i++)\r\n\t\t\t// or you can simply read\r\n\t\t\tSystem.out.printf(\" %d\", topoSort.get(i));\r\n\t\t// the content of `topoSort' backwards\r\n\t\tSystem.out.printf(\"\\n\");\r\n\t}","private void dfs(int y, int x, boolean[][] visited, Set<String> results, BoggleBoard board,\n\t\t\tTST.BacktrackTraverser<Integer> bt) {\n\t\tif (bt.hasValue()) {\n\t\t\tString word = appendU(bt.getWord());\n\t\t\tif (bt.getValue() > 0) {\n\t\t\t\tresults.add(word);\n\t\t\t}\n\t\t}\n\n\t\t// Check every unused nearby grid.\n\t\t// Only continue on grid if there's some word down the TST.\n\t\tfor (int[] dir : directions) {\n\t\t\tint[] moved = move(y, x, dir);\n\t\t\tif (!inBound(moved, board)) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (visited[moved[0]][moved[1]]) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tchar singleLetter = board.getLetter(moved[0], moved[1]);\n\t\t\tif (!bt.hasDown(singleLetter)) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tvisited[moved[0]][moved[1]] = true;\n\t\t\tbt.down(singleLetter);\n\t\t\tdfs(moved[0], moved[1], visited, results, board, bt);\n\t\t\tbt.up();\n\t\t\tvisited[moved[0]][moved[1]] = false;\n\t\t}\n\t}","private void dfs(DigrafoAristaPonderada G, int v) {\n enPila[v] = true;\n marcado[v] = true;\n for (AristaDirigida a : G.ady(v)) {\n int w = a.hacia();\n\n // short circuit if directed ciclo found\n if (ciclo != null) return;\n\n //found new vertex, so recur\n else if (!marcado[w]) {\n aristaHacia[w] = a;\n dfs(G, w);\n }\n\n // trace back directed ciclo\n else if (enPila[w]) {\n ciclo = new Pila<AristaDirigida>();\n while (a.desde() != w) {\n ciclo.push(a);\n a = aristaHacia[a.desde()];\n }\n ciclo.push(a);\n return;\n }\n }\n\n enPila[v] = false;\n }","public DepthFirstSearch(Graph graph) throws Exception {\n\n this.graph = graph;\n int n = graph.getNumV();\n\n parent = new int[n];\n Arrays.fill( parent , -1);\n\n visited = new boolean[n];\n Arrays.fill( visited , false );\n\n discoveryOrder = new int[n];\n finishOrder = new int[n];\n\n for (int i = 0; i < n; i++) {\n if (!visited[i])\n depthFirstSearch(i);\n }\n\n }","public void DFS(int current) {\r\n if (vertexList.get(current).isVisited) {\r\n return;\r\n }\r\n visit(current);\r\n int next = nextNeighbour(current);\r\n while (next != -1) {\r\n DFS(next);\r\n next = nextNeighbour(current);\r\n }\r\n }","public List<Graph> search() {\n\n long start = System.currentTimeMillis();\n TetradLogger.getInstance().log(\"info\", \"Starting ION Search.\");\n logGraphs(\"\\nInitial Pags: \", this.input);\n TetradLogger.getInstance().log(\"info\", \"Transfering local information.\");\n long steps = System.currentTimeMillis();\n\n /*\n * Step 1 - Create the empty graph\n */\n List<Node> varNodes = new ArrayList<>();\n for (String varName : variables) {\n varNodes.add(new GraphNode(varName));\n }\n Graph graph = new EdgeListGraph(varNodes);\n\n /*\n * Step 2 - Transfer local information from the PAGs (adjacencies\n * and edge orientations)\n */\n // transfers edges from each graph and finds definite noncolliders\n transferLocal(graph);\n // adds edges for variables never jointly measured\n for (NodePair pair : nonIntersection(graph)) {\n graph.addEdge(new Edge(pair.getFirst(), pair.getSecond(), Endpoint.CIRCLE, Endpoint.CIRCLE));\n }\n TetradLogger.getInstance().log(\"info\", \"Steps 1-2: \" + (System.currentTimeMillis() - steps) / 1000. + \"s\");\n System.out.println(\"step2\");\n System.out.println(graph);\n\n /*\n * Step 3\n *\n * Branch and prune step that blocks problematic undirectedPaths, possibly d-connecting undirectedPaths\n */\n steps = System.currentTimeMillis();\n Queue<Graph> searchPags = new LinkedList<>();\n // place graph constructed in step 2 into the queue\n searchPags.offer(graph);\n // get d-separations and d-connections\n List<Set<IonIndependenceFacts>> sepAndAssoc = findSepAndAssoc(graph);\n this.separations = sepAndAssoc.get(0);\n this.associations = sepAndAssoc.get(1);\n Map<Collection<Node>, List<PossibleDConnectingPath>> paths;\n// Queue<Graph> step3PagsSet = new LinkedList<Graph>();\n HashSet<Graph> step3PagsSet = new HashSet<>();\n Set<Graph> reject = new HashSet<>();\n // if no d-separations, nothing left to search\n if (separations.isEmpty()) {\n // makes orientations preventing definite noncolliders from becoming colliders\n // do final orientations\n// doFinalOrientation(graph);\n step3PagsSet.add(graph);\n }\n // sets length to iterate once if search over path lengths not enabled, otherwise set to 2\n int numNodes = graph.getNumNodes();\n int pl = numNodes - 1;\n if (pathLengthSearch) {\n pl = 2;\n }\n // iterates over path length, then adjacencies\n for (int l = pl; l < numNodes; l++) {\n if (pathLengthSearch) {\n TetradLogger.getInstance().log(\"info\", \"Braching over path lengths: \" + l + \" of \" + (numNodes - 1));\n }\n int seps = separations.size();\n int currentSep = 1;\n int numAdjacencies = separations.size();\n for (IonIndependenceFacts fact : separations) {\n if (adjacencySearch) {\n TetradLogger.getInstance().log(\"info\", \"Braching over path nonadjacencies: \" + currentSep + \" of \" + numAdjacencies);\n }\n seps--;\n // uses two queues to keep up with which PAGs are being iterated and which have been\n // accepted to be iterated over in the next iteration of the above for loop\n searchPags.addAll(step3PagsSet);\n recGraphs.add(searchPags.size());\n step3PagsSet.clear();\n while (!searchPags.isEmpty()) {\n System.out.println(\"ION Step 3 size: \" + searchPags.size());\n double currentUsage = Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory();\n if (currentUsage > maxMemory) maxMemory = currentUsage;\n // deques first PAG from searchPags\n Graph pag = searchPags.poll();\n // Part 3.a - finds possibly d-connecting undirectedPaths between each pair of nodes\n // known to be d-separated\n List<PossibleDConnectingPath> dConnections = new ArrayList<>();\n // checks to see if looping over adjacencies\n if (adjacencySearch) {\n for (Collection<Node> conditions : fact.getZ()) {\n // checks to see if looping over path lengths\n if (pathLengthSearch) {\n dConnections.addAll(PossibleDConnectingPath.findDConnectingPathsOfLength\n (pag, fact.getX(), fact.getY(), conditions, l));\n } else {\n dConnections.addAll(PossibleDConnectingPath.findDConnectingPaths\n (pag, fact.getX(), fact.getY(), conditions));\n }\n }\n } else {\n for (IonIndependenceFacts allfact : separations) {\n for (Collection<Node> conditions : allfact.getZ()) {\n // checks to see if looping over path lengths\n if (pathLengthSearch) {\n dConnections.addAll(PossibleDConnectingPath.findDConnectingPathsOfLength\n (pag, allfact.getX(), allfact.getY(), conditions, l));\n } else {\n dConnections.addAll(PossibleDConnectingPath.findDConnectingPaths\n (pag, allfact.getX(), allfact.getY(), conditions));\n }\n }\n }\n }\n // accept PAG go to next PAG if no possibly d-connecting undirectedPaths\n if (dConnections.isEmpty()) {\n// doFinalOrientation(pag);\n// Graph p = screenForKnowledge(pag);\n// if (p != null) step3PagsSet.add(p);\n step3PagsSet.add(pag);\n continue;\n }\n // maps conditioning sets to list of possibly d-connecting undirectedPaths\n paths = new HashMap<>();\n for (PossibleDConnectingPath path : dConnections) {\n List<PossibleDConnectingPath> p = paths.get(path.getConditions());\n if (p == null) {\n p = new LinkedList<>();\n }\n p.add(path);\n paths.put(path.getConditions(), p);\n }\n // Part 3.b - finds minimal graphical changes to block possibly d-connecting undirectedPaths\n List<Set<GraphChange>> possibleChanges = new ArrayList<>();\n for (Set<GraphChange> changes : findChanges(paths)) {\n Set<GraphChange> newChanges = new HashSet<>();\n for (GraphChange gc : changes) {\n boolean okay = true;\n for (Triple collider : gc.getColliders()) {\n\n if (pag.isUnderlineTriple(collider.getX(), collider.getY(), collider.getZ())) {\n okay = false;\n break;\n }\n\n }\n if (!okay) {\n continue;\n }\n for (Triple collider : gc.getNoncolliders()) {\n if (pag.isDefCollider(collider.getX(), collider.getY(), collider.getZ())) {\n okay = false;\n break;\n }\n }\n if (okay) {\n newChanges.add(gc);\n }\n }\n if (!newChanges.isEmpty()) {\n possibleChanges.add(newChanges);\n } else {\n possibleChanges.clear();\n break;\n }\n }\n float starthitset = System.currentTimeMillis();\n Collection<GraphChange> hittingSets = IonHittingSet.findHittingSet(possibleChanges);\n recHitTimes.add((System.currentTimeMillis() - starthitset) / 1000.);\n // Part 3.c - checks the newly constructed graphs from 3.b and rejects those that\n // cycles or produce independencies known not to occur from the input PAGs or\n // include undirectedPaths from definite nonancestors\n for (GraphChange gc : hittingSets) {\n boolean badhittingset = false;\n for (Edge edge : gc.getRemoves()) {\n Node node1 = edge.getNode1();\n Node node2 = edge.getNode2();\n Set<Triple> triples = new HashSet<>();\n triples.addAll(gc.getColliders());\n triples.addAll(gc.getNoncolliders());\n if (triples.size() != (gc.getColliders().size() + gc.getNoncolliders().size())) {\n badhittingset = true;\n break;\n }\n for (Triple triple : triples) {\n if (node1.equals(triple.getY())) {\n if (node2.equals(triple.getX()) ||\n node2.equals(triple.getZ())) {\n badhittingset = true;\n break;\n }\n }\n if (node2.equals(triple.getY())) {\n if (node1.equals(triple.getX()) ||\n node1.equals(triple.getZ())) {\n badhittingset = true;\n break;\n }\n }\n }\n if (badhittingset) {\n break;\n }\n for (NodePair pair : gc.getOrients()) {\n if ((node1.equals(pair.getFirst()) && node2.equals(pair.getSecond())) ||\n (node2.equals(pair.getFirst()) && node1.equals(pair.getSecond()))) {\n badhittingset = true;\n break;\n }\n }\n if (badhittingset) {\n break;\n }\n }\n if (!badhittingset) {\n for (NodePair pair : gc.getOrients()) {\n for (Triple triple : gc.getNoncolliders()) {\n if (pair.getSecond().equals(triple.getY())) {\n if (pair.getFirst().equals(triple.getX()) &&\n pag.getEndpoint(triple.getZ(), triple.getY()).equals(Endpoint.ARROW)) {\n badhittingset = true;\n break;\n\n }\n if (pair.getFirst().equals(triple.getZ()) &&\n pag.getEndpoint(triple.getX(), triple.getY()).equals(Endpoint.ARROW)) {\n badhittingset = true;\n break;\n }\n }\n if (badhittingset) {\n break;\n }\n }\n if (badhittingset) {\n break;\n }\n }\n }\n if (badhittingset) {\n continue;\n }\n Graph changed = gc.applyTo(pag);\n // if graph change has already been rejected move on to next graph\n if (reject.contains(changed)) {\n continue;\n }\n // if graph change has already been accepted move on to next graph\n if (step3PagsSet.contains(changed)) {\n continue;\n }\n // reject if null, predicts false independencies or has cycle\n if (predictsFalseIndependence(associations, changed)\n || changed.existsDirectedCycle()) {\n reject.add(changed);\n }\n // makes orientations preventing definite noncolliders from becoming colliders\n // do final orientations\n// doFinalOrientation(changed);\n // now add graph to queue\n\n// Graph p = screenForKnowledge(changed);\n// if (p != null) step3PagsSet.add(p);\n step3PagsSet.add(changed);\n }\n }\n // exits loop if not looping over adjacencies\n if (!adjacencySearch) {\n break;\n }\n }\n }\n TetradLogger.getInstance().log(\"info\", \"Step 3: \" + (System.currentTimeMillis() - steps) / 1000. + \"s\");\n Queue<Graph> step3Pags = new LinkedList<>(step3PagsSet);\n\n /*\n * Step 4\n *\n * Finds redundant undirectedPaths and uses this information to expand the list\n * of possible graphs\n */\n steps = System.currentTimeMillis();\n Map<Edge, Boolean> necEdges;\n Set<Graph> outputPags = new HashSet<>();\n\n while (!step3Pags.isEmpty()) {\n Graph pag = step3Pags.poll();\n necEdges = new HashMap<>();\n // Step 4.a - if x and y are known to be unconditionally associated and there is\n // exactly one trek between them, mark each edge on that trek as necessary and\n // make the tiples on the trek definite noncolliders\n // initially mark each edge as not necessary\n for (Edge edge : pag.getEdges()) {\n necEdges.put(edge, false);\n }\n // look for unconditional associations\n for (IonIndependenceFacts fact : associations) {\n for (List<Node> nodes : fact.getZ()) {\n if (nodes.isEmpty()) {\n List<List<Node>> treks = treks(pag, fact.x, fact.y);\n if (treks.size() == 1) {\n List<Node> trek = treks.get(0);\n List<Triple> triples = new ArrayList<>();\n for (int i = 1; i < trek.size(); i++) {\n // marks each edge in trek as necessary\n necEdges.put(pag.getEdge(trek.get(i - 1), trek.get(i)), true);\n if (i == 1) {\n continue;\n }\n // makes each triple a noncollider\n pag.addUnderlineTriple(trek.get(i - 2), trek.get(i - 1), trek.get(i));\n }\n }\n // stop looping once the empty set is found\n break;\n }\n }\n }\n // Part 4.b - branches by generating graphs for every combination of removing\n // redundant undirectedPaths\n boolean elimTreks;\n // checks to see if removing redundant undirectedPaths eliminates every trek between\n // two variables known to be nconditionally assoicated\n List<Graph> possRemovePags = possRemove(pag, necEdges);\n double currentUsage = Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory();\n if (currentUsage > maxMemory) maxMemory = currentUsage;\n for (Graph newPag : possRemovePags) {\n elimTreks = false;\n // looks for unconditional associations\n for (IonIndependenceFacts fact : associations) {\n for (List<Node> nodes : fact.getZ()) {\n if (nodes.isEmpty()) {\n if (treks(newPag, fact.x, fact.y).isEmpty()) {\n elimTreks = true;\n }\n // stop looping once the empty set is found\n break;\n }\n }\n }\n // add new PAG to output unless a necessary trek has been eliminated\n if (!elimTreks) {\n outputPags.add(newPag);\n }\n }\n }\n outputPags = removeMoreSpecific(outputPags);\n// outputPags = applyKnowledge(outputPags);\n\n TetradLogger.getInstance().log(\"info\", \"Step 4: \" + (System.currentTimeMillis() - steps) / 1000. + \"s\");\n\n /*\n * Step 5\n *\n * Generate the Markov equivalence classes for graphs and accept only\n * those that do not predict false d-separations\n */\n steps = System.currentTimeMillis();\n Set<Graph> outputSet = new HashSet<>();\n for (Graph pag : outputPags) {\n Set<Triple> unshieldedPossibleColliders = new HashSet<>();\n for (Triple triple : getPossibleTriples(pag)) {\n if (!pag.isAdjacentTo(triple.getX(), triple.getZ())) {\n unshieldedPossibleColliders.add(triple);\n }\n }\n\n PowerSet<Triple> pset = new PowerSet<>(unshieldedPossibleColliders);\n for (Set<Triple> set : pset) {\n Graph newGraph = new EdgeListGraph(pag);\n for (Triple triple : set) {\n newGraph.setEndpoint(triple.getX(), triple.getY(), Endpoint.ARROW);\n newGraph.setEndpoint(triple.getZ(), triple.getY(), Endpoint.ARROW);\n }\n doFinalOrientation(newGraph);\n }\n for (Graph outputPag : finalResult) {\n if (!predictsFalseIndependence(associations, outputPag)) {\n Set<Triple> underlineTriples = new HashSet<>(outputPag.getUnderLines());\n for (Triple triple : underlineTriples) {\n outputPag.removeUnderlineTriple(triple.getX(), triple.getY(), triple.getZ());\n }\n outputSet.add(outputPag);\n }\n }\n }\n\n// outputSet = applyKnowledge(outputSet);\n outputSet = checkPaths(outputSet);\n\n output.addAll(outputSet);\n TetradLogger.getInstance().log(\"info\", \"Step 5: \" + (System.currentTimeMillis() - steps) / 1000. + \"s\");\n runtime = ((System.currentTimeMillis() - start) / 1000.);\n logGraphs(\"\\nReturning output (\" + output.size() + \" Graphs):\", output);\n double currentUsage = Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory();\n if (currentUsage > maxMemory) maxMemory = currentUsage;\n return output;\n }","private void DFSUtil(graph copy,node_data n) {\n\t\tn.setTag(1);\n\t\tCollection<edge_data> temp = copy.getE(n.getKey());\n\t\tif (temp != null) {\n\t\t\tfor (edge_data edge : temp) {\n\t\t\t\tif (copy.getNode(edge.getDest()) != null && copy.getE(edge.getDest()) != null && copy.getNode(edge.getDest()).getTag() == 0) {\n\t\t\t\t\tDFSUtil(copy,copy.getNode(edge.getDest()));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}"],"string":"[\n \"void DFS() {\\n \\t\\n \\t// Mark all the vertices as not visited(set as false by default in java) \\n \\tboolean visited[] = new boolean[V];\\n \\t\\n \\t// Call the recursive helper function to print DFS traversal \\n // starting from all vertices one by one \\n \\tfor (int i=0; i<V; i++) { \\n \\t\\t if (visited[i] == false)\\n \\t\\t\\t DFSUtil(i, visited);\\n \\t}\\n }\",\n \"private void DFS() {\\n\\t\\tfor(Node node: nodeList) {\\r\\n\\t\\t\\tif(!node.isVisited())\\r\\n\\t\\t\\t\\tdfsVisit(node);\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public void DFS() {\\r\\n for (int i = 0; i < vertexNum; i++) {\\r\\n DFS(i);\\r\\n }\\r\\n }\",\n \"void dfs(){\\n // start from the index 0\\n for (int vertex=0; vertex<v; vertex++){\\n // check visited or not\\n if (visited[vertex]==false){\\n Explore(vertex);\\n }\\n }\\n }\",\n \"public void DFS() {\\r\\n\\t\\tSet<Vertex> visited = new HashSet<Vertex>();\\r\\n\\r\\n\\t\\t// Create a stack for DFS\\r\\n\\t\\tStack<Vertex> stack = new Stack<Vertex>();\\r\\n\\r\\n\\t\\tDFS(this.vertices[3], visited, stack); // DFS starting with 40\\r\\n\\r\\n\\t\\t// Call the helper function to print DFS traversal\\r\\n\\t\\t// starting from all vertices one by one\\r\\n\\t\\tfor (int i = 0; i < N; ++i)\\r\\n\\t\\t\\tif (!visited.contains(this.vertices[i]))\\r\\n\\t\\t\\t\\tDFS(this.vertices[i], visited, stack);\\r\\n\\t}\",\n \"@Override\\n public void dfs() {\\n\\n }\",\n \"public void dfs() {\\n int currentVertexIndex = 0;\\r\\n dfsStack.push(0);\\r\\n vertexList[0].wasVisited = true;\\r\\n System.out.println(vertexList[dfsStack.peek()]);\\r\\n while (dfsStack.top != -1) {\\r\\n\\r\\n\\r\\n currentVertexIndex = this.getAdjUnvisitedVert(dfsStack.peek());\\r\\n if (currentVertexIndex != -1) {\\r\\n dfsStack.push(currentVertexIndex);\\r\\n vertexList[currentVertexIndex].wasVisited = true;\\r\\n System.out.println(vertexList[dfsStack.peek()]);\\r\\n\\r\\n\\r\\n } else {\\r\\n currentVertexIndex = dfsStack.pop();\\r\\n\\r\\n }\\r\\n }\\r\\n// reset wasVisted\\r\\n for (Vertex x : vertexList) {\\r\\n x.wasVisited = false;\\r\\n }\\r\\n }\",\n \"public static void main(String[] args){\\n GraphDFS graphDFS = new GraphDFS(20);\\n graphDFS.addNode('A');\\n graphDFS.addNode('B');\\n graphDFS.addNode('D');\\n graphDFS.addNode('C');\\n graphDFS.addNode('E');\\n graphDFS.addNode('F');\\n\\n graphDFS.addEdge(0, 1);\\n graphDFS.addEdge(1, 2);\\n graphDFS.addEdge(0, 3);\\n graphDFS.addEdge(3, 4);\\n graphDFS.addEdge(4, 5);\\n graphDFS.addEdge(1, 5);\\n\\n graphDFS.dfsTraversal();\\n }\",\n \"public void dfs (String input)\\r\\n\\t {\\r\\n\\t\\t \\tNode root_dfs = new Node (input);\\r\\n\\t\\t \\tNode current = new Node(root_dfs.getState());\\r\\n\\t\\t \\t\\r\\n\\t\\t\\tArrayList<String> visited = new ArrayList<String>();\\r\\n\\t\\t\\tArrayList<String> children = new ArrayList<String>();\\r\\n\\t\\t\\tStack<Node> stack_dfs = new Stack<Node>();\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tint nodes_popped = 0;\\r\\n\\t\\t\\tint stack_max_size = 0;\\r\\n\\t\\t\\tint stack_size = 0;\\r\\n\\t\\t\\tcurrent.cost = 0;\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tgoal_dfs = isGoal(current.getState());\\r\\n\\t\\t\\t\\r\\n\\t\\t\\twhile(!goal_dfs)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tvisited.add(current.getState());\\r\\n\\t\\t\\t\\tchildren = Successor.findChildren(current.getState());\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tfor (String a : children)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tif (visited.contains(a))\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tcontinue;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tNode nino = new Node(a);\\r\\n\\t\\t\\t\\t\\t\\tcurrent.children_nodes.add(nino);\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tint cost = isCost(current.getState(), nino.getState());\\r\\n\\t\\t\\t\\t\\t\\tnino.cost = cost;\\r\\n\\t\\t\\t\\t\\t\\tnino.parent = current;\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t// Repeated state check\\r\\n\\t\\t\\t\\t\\t\\tif (!stack_dfs.contains(nino))\\r\\n\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\tstack_dfs.add(nino);\\r\\n\\t\\t\\t\\t\\t\\t\\tstack_size++;\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t// Popping off the stack. LIFO architecture\\r\\n\\t\\t\\t\\tcurrent = stack_dfs.pop();\\r\\n\\t\\t\\t\\tnodes_popped++;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif (stack_size > stack_max_size)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tstack_max_size = stack_size;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tstack_size--;\\r\\n\\t\\t\\t\\tgoal_dfs = isGoal(current.getState());\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tgoal_dfs = false;\\r\\n\\t\\t\\tSystem.out.println(\\\"DFS Solved!!\\\");\\r\\n\\t\\t\\tSolution.performSolution(current, root_dfs, nodes_popped, stack_max_size);\\r\\n\\t }\",\n \"public static void main(String[] args) {\\n\\n /*\\n * Given below directed graph, show the DFS and BFS traversal and print the paths\\n * it took throughout the traversal of the graph\\n *\\n * (D)--(F)\\n * /\\n * (B)--(E)\\n * /\\n * (A)\\n * \\\\\\n * (C)--(G)\\n *\\n * Do Breadth First Search and Depth First Search, conclude on the trade offs\\n * between the two traversal\\n */\\n\\n // Initialize the graph here and its edges\\n Graphs graph = new Graphs();\\n graph.addNode('A', new Node('A'));\\n graph.addNode('B', new Node('B'));\\n graph.addNode('C', new Node('C'));\\n graph.addNode('D', new Node('D'));\\n graph.addNode('E', new Node('E'));\\n graph.addNode('F', new Node('F'));\\n graph.addNode('G', new Node('G'));\\n\\n graph.addEdge('A','B');\\n graph.addEdge('B','D');\\n graph.addEdge('D','F');\\n graph.addEdge('B','E');\\n graph.addEdge('A','C');\\n graph.addEdge('C','G');\\n\\n // Initialize the list of paths\\n ArrayList<String> traversedNodes;\\n // Do a DFS on the graph\\n traversedNodes = graph.depthFirstSearch('A','G');\\n System.out.println(\\\"Traversal in DFS:\\\");\\n // Print all of the paths\\n for(String path : traversedNodes) {\\n System.out.println(path);\\n }\\n\\n // Do a BFS on the graph\\n traversedNodes = graph.breadthFirstSearch('A','G');\\n System.out.println(\\\"\\\\nTraversal in BFS:\\\");\\n // Print all of the paths\\n for(String path : traversedNodes) {\\n System.out.println(path);\\n }\\n\\n }\",\n \"public static void main(String[] args) {\\n\\t\\tDeepFirstSearchGraph main = new DeepFirstSearchGraph();\\n\\t\\tGraph g = main.new Graph(4);\\n\\t\\tg.addEdge(0, 1);\\n\\t\\tg.addEdge(0, 2);\\n\\t\\tg.addEdge(1, 2);\\n\\t\\tg.addEdge(2, 0);\\n\\t\\tg.addEdge(2, 3);\\n\\t\\tg.addEdge(3, 3);\\n\\t\\t\\n\\t\\tint vertexToBegin = 2;\\n\\t\\tSystem.out.println(\\\"Doing DFS starting from vertex: \\\"+vertexToBegin);\\n\\t\\tg.DFS(vertexToBegin);\\n\\t}\",\n \"public DFS()\\n {\\n\\n\\n writeLock = lock.writeLock();\\n readLock = lock.readLock();\\n\\n recoverINodes();\\n\\n createDir(\\\"/\\\"); // add a root if it does not exist .\\n\\n }\",\n \"public void dfs() {\\n\\t\\tfor (Vertice v : vertices) {\\n\\t\\t\\tv.setVisited(false);\\n\\t\\t}\\n\\t\\tfor (Vertice v : vertices) {\\n\\t\\t\\tif (!v.getVisited()) {\\n\\t\\t\\t\\tVisitar(v, -1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"private static void iddfs(State curr, int depth) {\\n for(int i = 0; i <= depth; i++) {\\r\\n\\r\\n if(curr.isGoalState()) \\r\\n System.out.println(i+\\\":\\\"+curr.getOrderedPair()+\\\" Goal\\\");//initial is goal state\\r\\n else\\r\\n System.out.println(i+\\\":\\\"+curr.getOrderedPair());//initial\\r\\n\\r\\n curr.close.add(curr);\\r\\n State currState = curr;\\r\\n while(!currState.isGoalState()) {\\r\\n if(currState.depth < i)\\r\\n curr.buildStack(currState.getSuccessors(currState));\\r\\n System.out.print(i+\\\":\\\");\\r\\n curr.printHelp(currState, 5);\\r\\n if(!curr.open.isEmpty()) {\\r\\n currState = curr.open.get(curr.open.size()-1);\\r\\n curr.close.add(curr.open.remove(curr.open.size()-1));\\r\\n } else {\\r\\n break;\\r\\n }\\r\\n }\\r\\n\\r\\n if(currState.isGoalState()) {\\r\\n System.out.println(i+\\\":\\\"+currState.getOrderedPair() + \\\" Goal\\\");\\r\\n curr.printPath(currState);\\r\\n return;\\r\\n }\\r\\n curr.open.clear(); curr.close.clear();\\r\\n }\\r\\n }\",\n \"public static void main(String[] args) {\\n Graph graph = new Graph(16);\\n graph.addEdge(0,1);\\n graph.addEdge(1,2);\\n graph.addEdge(2,3);\\n graph.addEdge(3,4);\\n graph.addEdge(4,5);\\n graph.addEdge(5,6);\\n graph.addEdge(6,7);\\n graph.addEdge(8,9);\\n graph.addEdge(9,10);\\n graph.addEdge(10,11);\\n graph.addEdge(11,12);\\n graph.addEdge(13,14);\\n graph.addEdge(14,15);\\n graph.addEdge(15,0);\\n graph.addEdge(0,8);\\n graph.addEdge(1,10);\\n graph.addEdge(2,9);\\n graph.addEdge(3,11);\\n graph.addEdge(3,14);\\n graph.addEdge(4,7);\\n graph.addEdge(4,13);\\n graph.addEdge(5,8);\\n graph.addEdge(5,15);\\n graph.printGraph();\\n System.out.println(\\\"DFS Traversal\\\");\\n graph.DFS(3);\\n System.out.println();\\n System.out.println(\\\"BFS Traversal\\\");\\n graph.BFS(3);\\n// System.out.println();\\n// for (int i=0; i<graph.vertices; i++)\\n// {\\n// if(graph.visited[i]!=true)\\n// {\\n// graph.DFS(i);\\n// }\\n// }\\n\\n }\",\n \"private static void dfsComponents() {\\r\\n\\t\\tprintThis(\\\"Standard DFS Demo (the input graph must be UNDIRECTED)\\\");\\r\\n\\t\\tfor (int i = 0; i < V; i++) { // for each vertex i in [0..V-1]\\r\\n\\t\\t\\tif (dfs_num[i] == DFS_WHITE) { // if that vertex is not visited yet\\r\\n\\t\\t\\t\\tSystem.out.printf(\\\"Component %d:\\\", ++numComp);\\r\\n\\t\\t\\t\\tdfs(i);\\r\\n\\t\\t\\t\\tSystem.out.printf(\\\"\\\\n\\\");\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\tSystem.out.printf(\\\"There are %d connected components\\\\n\\\", numComp);\\r\\n\\t}\",\n \"public void Main(){\\n\\t\\t\\n\\t\\tfillSFG();\\n\\t\\tboolean[] visited = new boolean[AdjMatrix.length];\\n\\t\\tLinkedList<Integer> pathdump = new LinkedList<Integer>();\\n\\t\\textractForwardPaths(startNode, endNode, startNode, visited, pathdump);\\n\\t\\textractLoops();\\n\\t\\tgetForwardGains();\\n\\t\\tgetLoopGains();\\n\\t\\tprintForwardPaths();\\n\\t\\tSystem.out.println(\\\"----------------------------------------------\\\");\\n\\t\\tprintLoops();\\n\\t\\t\\n\\t\\t\\n\\t\\tcalculateDeltas();\\n\\t\\tcalculateTotalGain();\\n\\t\\tprintDeltasAndTotalGain();\\n\\t\\t\\n\\t\\tfor (int i = 1; i < nonTouching.length; i++) {\\n\\t\\t\\tSystem.out.println(\\\"Level = \\\"+i);\\n\\t\\t\\tfor (int j = 0; j < nonTouching[i].size(); j++) {\\n\\t\\t\\t\\tLinkedList<Integer> dump = new LinkedList<Integer>();\\n\\t\\t\\t\\tdump = nonTouching[i].get(j);\\n\\t\\t\\t\\tfor (int k = 0; k < dump.size(); k++) {\\n\\t\\t\\t\\t\\tSystem.out.print(dump.get(k)+\\\" \\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tSystem.out.println();\\n\\t\\t\\t}\\n\\t\\t\\tSystem.out.println(\\\"************************************************\\\");\\n\\t\\t}\\n\\t\\t\\n\\t\\tProgramWindow.getInstance().showResults(forwardPaths,forwardGains,loops,loopGains,deltas,TotalGain,nonTouching);\\n\\t}\",\n \"public void depthFirstSearch() {\\n List<Vertex> visited = new ArrayList<Vertex>();\\r\\n // start the recursive depth first search on the current vertex\\r\\n this.dfs(visited);\\r\\n }\",\n \"public static void main(String[] args) \\n\\t throws IOException {\\n\\t Scanner sc = new Scanner(System.in);\\n\\t System.out.print(\\\"Enter graph input file name: \\\");\\n\\t String file = sc.nextLine();\\n\\t DFS graph = new DFS(file);\\n\\t System.out.println(\\\"The Graph Information is\\\");\\n\\t graph.print();\\n\\t System.out.println(\\\"The DFS Algorithm\\\");\\n\\t graph.dfs();\\n\\t graph.path(\\\"A\\\",\\\"N\\\");\\n\\t }\",\n \"public static void main(String[] args) {\\r\\n \\r\\n Graph X=new Graph();\\r\\n \\r\\n X.GenerateGraph();\\r\\n \\r\\n \\r\\n X.DisplayGraph();\\r\\n // System.out.println(\\\"Printing Stack\\\");\\r\\n // X.DFS();\\r\\n \\r\\n // System.out.println(X.AdjList.get(3).neighbours);\\r\\n \\r\\n // ArrayList<Vertex> A=new ArrayList();\\r\\n \\r\\n X.BFS();\\r\\n \\r\\n X.TraceBack();\\r\\n }\",\n \"@Override\\n public void traverse()\\n {\\n System.out.print(\\\"DFS Tree: \\\");\\n DFSHelper(root);\\n System.out.println();\\n }\",\n \"public static void main(String[] args){\\n Graph g = new Graph(13);\\n //add vortexes and edges to construct the graph\\n g.addEdge(0,1);\\n g.addEdge(0,2);\\n g.addEdge(0,6);\\n g.addEdge(0,5);\\n g.addEdge(6,4);\\n g.addEdge(4,3);\\n g.addEdge(4,5);\\n g.addEdge(3,5);\\n g.addEdge(7,8);\\n g.addEdge(9,10);\\n g.addEdge(9,11);\\n g.addEdge(9,12);\\n g.addEdge(11,12);\\n\\n //create a DepthFirstSearch object\\n BreadthFirstSearch DFS = new BreadthFirstSearch(g,0);\\n\\n System.out.println(\\\"7 and 0 is connected: \\\"+ DFS.marked(7));\\n System.out.println(\\\"10 and 0 is connected: \\\"+ DFS.marked(10));\\n System.out.println(\\\"6 and 0 is connected: \\\"+ DFS.marked(6));\\n System.out.println(\\\"4 and 0 is connected: \\\"+ DFS.marked(0));\\n System.out.println(\\\"12 and 0 is connected: \\\"+ DFS.marked(12));\\n\\n System.out.println(DFS.count()+\\\" vortexes connect with the vortex 0.\\\");\\n\\n }\",\n \"public static void main(String[] args) {\\n\\n Main tree = new Main();\\n tree.node = new Node(1);\\n tree.node.lt = new Node(2);\\n tree.node.lt.lt = new Node(4);\\n tree.node.lt.rt = new Node(5);\\n\\n tree.node.rt = new Node(3);\\n tree.node.rt.lt = new Node(6);\\n tree.node.rt.rt = new Node(7);\\n\\n tree.DFS(tree.node);\\n }\",\n \"public static void main(String[] args) {\\n\\n BDNode a = new BDNode(\\\"A\\\");\\n BDNode b = new BDNode(\\\"B\\\");\\n BDNode c = new BDNode(\\\"C\\\");\\n BDNode d = new BDNode(\\\"D\\\");\\n BDNode e = new BDNode(\\\"E\\\");\\n\\n a.link(b);\\n a.link(d);\\n b.link(a);\\n b.link(c);\\n b.link(e);\\n c.link(b);\\n c.link(d);\\n d.link(a);\\n d.link(c);\\n d.link(e);\\n e.link(b);\\n e.link(d);\\n\\n BDNode target = e;\\n\\n/*\\n // BFS\\n Queue<BDNode> queue = new LinkedList<>();\\n queue.offer(a);\\n\\n while(!queue.isEmpty()) {\\n BDNode n = queue.poll();\\n n.visit();\\n System.out.println(n); // 찾는 여정 출력\\n\\n if(n.equals(target)) {\\n System.out.println(\\\"BFS Found! \\\" + n);\\n break;\\n }\\n\\n for (BDNode l : n.links) {\\n if(l.isVisited()) continue;\\n if (queue.contains(l)) continue;\\n queue.offer(l);\\n }\\n\\n // 위랑 같은 표현\\n// n.links.stream()\\n// .filter(l -> !queue.contains(l))\\n// .forEach(queue::offer);\\n }\\n*/\\n\\n // DFS\\n Stack<BDNode> stack = new Stack<>();\\n stack.push(a);\\n\\n while(!stack.isEmpty()) {\\n BDNode n = stack.pop();\\n n.visit();\\n System.out.println(n); // 찾는 여정 출력\\n\\n if (n.equals(target)) {\\n System.out.println(\\\"DFS Found! \\\" + n);\\n break;\\n }\\n\\n for (BDNode l : n.links) {\\n if (l.isVisited()) continue;\\n if (stack.contains(l)) continue;\\n\\n stack.push(l);\\n }\\n }\\n\\n\\n }\",\n \"public static void main(String[] args)\\r\\n {\\n PontoArticulacaoDFS graph = new PontoArticulacaoDFS();\\r\\n\\r\\n // Run DFS to find any articulation points (and biconnected components).\\r\\n graph.doArticulationPointDFS();\\r\\n\\r\\n // Display the results of the DFS.\\r\\n graph.showResults();\\r\\n }\",\n \"private static void dfs(State curr) {\\n curr.buildStack(curr.getSuccessors(curr));\\r\\n \\r\\n if(curr.isGoalState()) \\r\\n System.out.println(curr.getOrderedPair()+\\\" Goal\\\");//initial is goal state\\r\\n else\\r\\n System.out.println(curr.getOrderedPair());//initial\\r\\n \\r\\n curr.close.add(curr);\\r\\n while(!curr.open.isEmpty()&&!curr.isGoalState()) {\\r\\n curr.buildStack(curr.getSuccessors(curr));\\r\\n curr.printHelp(curr, 4);\\r\\n curr = curr.open.get(curr.open.size()-1);\\r\\n curr.close.add(curr.open.remove(curr.open.size()-1));\\r\\n }\\r\\n \\r\\n if(curr.isGoalState()) {\\r\\n System.out.println(curr.getOrderedPair() + \\\" Goal\\\");\\r\\n curr.printPath(curr);\\r\\n }\\r\\n }\",\n \"void DFS(int v) {\\n // Mark all the vertices as not visited(set as\\n // false by default in java)\\n boolean visited[] = new boolean[V];\\n\\n // Call the recursive helper function to print DFS traversal\\n DFSUtil(v, visited);\\n }\",\n \"public static void run(State curr_state, int option, int depth) {\\n switch(option) {\\r\\n case 3:\\r\\n bfs(curr_state);\\r\\n break;\\r\\n case 4:\\r\\n dfs(curr_state);\\r\\n break;\\r\\n case 5:\\r\\n iddfs(curr_state, depth);\\r\\n break;\\r\\n default:\\r\\n }\\r\\n }\",\n \"public static void main(String[] args) {\\n\\n\\t\\tScanner sc = new Scanner(System.in);\\n\\t\\tint V = sc.nextInt();\\n\\t\\tint E = sc.nextInt();\\n\\n\\t\\tList<Integer>[]adjList = new ArrayList[10010];\\n\\t\\tList<Integer>[]reverseAdjList = new ArrayList[10010];\\n\\n\\t\\tList<List<Integer>>scc = new ArrayList<List<Integer>>();\\n\\t\\tint visited[] = new int[10010];\\n\\n\\t\\tfor(int i = 1 ; i <= V ; i++){\\n\\t\\t\\tadjList[i] = new ArrayList<Integer>();\\n\\t\\t\\treverseAdjList[i] = new ArrayList<Integer>();\\n\\t\\t}\\n\\n\\t\\tfor(int i = 1 ; i <= E ; i++){\\n\\n\\t\\t\\tint start = sc.nextInt();\\n\\t\\t\\tint end = sc.nextInt();\\n\\t\\t\\tadjList[start].add(end);\\n\\t\\t\\treverseAdjList[end].add(start);\\n\\t\\t}\\n\\n\\n\\t\\t//선작업 DFS 스택에 담음.\\n\\t\\tStack <Integer>stack = new Stack<Integer>();\\n\\t\\tfor(int i = 1 ; i <= V ; i++){\\n\\t\\t\\tif(visited[i] == 0){\\n\\t\\t\\t\\tdfs(i,visited,stack,adjList);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\n\\t\\t//후작업 역 DFS\\n\\t\\tvisited = new int[10010];\\n\\n\\t\\tint r = 0;\\n\\t\\twhile(!stack.isEmpty()){\\n\\n\\t\\t\\tint here = stack.peek();\\n\\t\\t\\tstack.pop();\\n\\t\\t\\tif(visited[here] == 1){\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tscc.add(new ArrayList<Integer>());\\n\\t\\t\\t++r;\\n\\t\\t\\treverseDFS(here, r-1, visited, scc, reverseAdjList);\\n\\n\\t\\t}\\n\\n\\t\\tSystem.out.println(r);\\n\\t\\tfor(int i = 0 ; i < r ; i++){\\n\\t\\t\\tList <Integer>temp = scc.get(i);\\n\\t\\t\\tCollections.sort(temp);\\n\\t\\t}\\n\\n\\t\\tscc.sort(new Comparator<List<Integer>>() {\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic int compare(List<Integer> o1, List<Integer> o2) {\\n\\t\\t\\t\\t// TODO Auto-generated method stub\\n\\t\\t\\t\\tif(o1.get(0)< o2.get(0)){\\n\\t\\t\\t\\t\\treturn -1;\\n\\t\\t\\t\\t}else if(o1.get(0) > o2.get(0)){\\n\\t\\t\\t\\t\\treturn 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn 0;\\n\\t\\t\\t}\\n\\t\\t});\\n\\n\\t\\t\\tfor(List <Integer>list : scc){\\n\\t\\t\\t\\tfor(int i = 0 ; i < list.size() ; i++){\\n\\t\\t\\t\\t\\tSystem.out.print(list.get(i) + \\\" \\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tSystem.out.println(\\\"-1\\\");\\n\\t\\t\\t}\\n\\n\\t}\",\n \"@Override\\r\\n\\tpublic void DFS() {\\r\\n\\t\\tvertices.forEach((E e, Vertex<E> u) -> {\\r\\n\\t\\t\\tu.setColor(Color.WHITE);\\r\\n\\t\\t\\tu.setPredecessor(null);\\r\\n\\t\\t});\\r\\n\\t\\tDFStime = 0;\\r\\n\\t\\tvertices.forEach((E e, Vertex<E> u) -> {\\r\\n\\t\\t\\tif(u.getColor() == Color.WHITE) {\\r\\n\\t\\t\\t\\tDFSVisit(u);\\r\\n\\t\\t\\t}\\r\\n\\t\\t});\\r\\n\\t}\",\n \"public static void main(String[] args) {\\n\\t\\tVector<Edge> edges = GraphReader.readFromFile(\\\"/tmp/tinyG.txt\\\",2);\\r\\n\\t\\tGraph G = new Graph(edges);\\r\\n int s = Integer.parseInt(\\\"1\\\");\\r\\n DepthFirstSearch search = new DepthFirstSearch(G.getNodeNum());\\r\\n Path res = search.dfs(G, s);\\r\\n res.packetToJson();\\r\\n //System.out.print(\\\"success!\\\");\\r\\n }\",\n \"static void dfs(int u) { // DFS for normal usage: as graph traversal\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t// algorithm\\r\\n\\t\\tSystem.out.printf(\\\" %d\\\", u); // this vertex is visited\\r\\n\\t\\tdfs_num[u] = DFS_BLACK; // important step: we mark this vertex as\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t// visited\\r\\n\\t\\tfor (int j = 0; j < AdjList[u].size(); j++) {\\r\\n\\t\\t\\tEdge v = AdjList[u].get(j); // v is a (neighbor,\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// weight) pair\\r\\n\\t\\t\\tif (dfs_num[v.to] == DFS_WHITE) // important check to avoid\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// cycle\\r\\n\\t\\t\\t\\tdfs(v.to); // recursively visits unvisited neighbors v of\\r\\n\\t\\t\\t\\t\\t\\t\\t// vertex u\\r\\n\\t\\t}\\r\\n\\t}\",\n \"private void DepthFirstSearch(Node current){\\n helperDFS( current );\\n }\",\n \"@Override\\r\\n\\tpublic void DFS(E src) {\\r\\n\\t\\tif(containsVertex(src)) {\\r\\n\\t\\t\\tvertices.forEach((E e, Vertex<E> u) -> {\\r\\n\\t\\t\\t\\tu.setDiscovered(0);\\r\\n\\t\\t\\t\\tu.setFinished(0);\\r\\n\\t\\t\\t\\tu.setColor(Color.WHITE);\\r\\n\\t\\t\\t\\tu.setPredecessor(null);\\r\\n\\t\\t\\t});\\r\\n\\t\\t\\tDFStime = 1;\\r\\n\\t\\t\\tVertex<E> s = vertices.get(src);\\r\\n\\t\\t\\ts.setColor(Color.GRAY);\\r\\n\\t\\t\\ts.setDiscovered(DFStime);\\r\\n\\t\\t\\t//s.predecessor is already null so skip that step\\r\\n\\t\\t\\tStack<Vertex<E>> stack = new Stack<>();\\r\\n\\t\\t\\tstack.push(s);\\r\\n\\t\\t\\twhile(!stack.isEmpty()) {\\r\\n\\t\\t\\t\\tVertex<E> u = stack.pop();\\r\\n\\t\\t\\t\\tArrayList<Edge<E>> adj = adjacencyLists.get(u.getElement());\\r\\n\\t\\t\\t\\tfor(Edge<E> ale: adj) {\\r\\n\\t\\t\\t\\t\\tVertex<E> v = vertices.get(ale.getDst());\\r\\n\\t\\t\\t\\t\\tif(v.getColor() == Color.WHITE) {\\r\\n\\t\\t\\t\\t\\t\\tDFStime++;\\r\\n\\t\\t\\t\\t\\t\\tv.setColor(Color.GRAY);\\r\\n\\t\\t\\t\\t\\t\\tv.setDiscovered(DFStime);\\r\\n\\t\\t\\t\\t\\t\\tv.setPredecessor(u);\\r\\n\\t\\t\\t\\t\\t\\tstack.push(v);\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tu.setColor(Color.BLACK);\\r\\n\\t\\t\\t\\tDFStime++;\\r\\n\\t\\t\\t\\tu.setFinished(DFStime);\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t}\",\n \"private void dfs(String source) {\\n visited.add(source);\\n\\n System.out.println(source);\\n\\n for (Object vertex : graph.get(source)) {\\n if (!visited.contains(vertex))\\n dfs((String) vertex);\\n }\\n }\",\n \"void DFS(Node root) {\\n\\t\\tStack<Node> s = new Stack<Node>();\\n\\t\\ts.add(root);\\n\\n\\t\\twhile(!s.isEmpty()) {\\n\\t\\t\\tNode n = s.pop();\\n\\t\\t\\tif (n != null) {\\n\\t\\t\\t\\tSystem.out.print(n.data + \\\",\\\");\\n\\t\\t\\t\\ts.push(n.right);\\n\\t\\t\\t\\ts.push(n.left);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"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\\tStringTokenizer st = new StringTokenizer(br.readLine());\\n\\t\\tN = Integer.parseInt(st.nextToken());\\n\\t\\t\\n\\t\\tint size = 1;\\n\\t\\twhile(max_node > size) {\\n\\t\\t\\tsize *= 2;\\n\\t\\t\\tmax_level++;\\n\\t\\t}\\n\\t\\t\\n\\t\\tfor(int i=0; i<= N; i++)\\n\\t\\t{\\n\\t\\t\\tadj.add(new ArrayList<>());\\n\\t\\t}\\n\\t\\t\\n\\t\\tint dx=0, dy=0, dz = 0;\\n\\t\\tfor(int i=1; i<= N-1; i++)\\n\\t\\t{\\n\\t\\t\\tst = new StringTokenizer(br.readLine());\\n\\t\\t\\tdx = Integer.parseInt(st.nextToken());\\n\\t\\t\\tdy = Integer.parseInt(st.nextToken());\\n\\t\\t\\tadj.get(dx).add(dy);\\n\\t\\t\\tadj.get(dy).add(dx);\\n\\t\\t}\\n\\t\\t\\n\\t\\tdepth[0] = -1;\\n\\t\\tdfs(1,0);\\n\\t\\t\\n\\t\\tst = new StringTokenizer(br.readLine());\\n\\t\\tM = Integer.parseInt(st.nextToken());\\n\\t\\tfor(int i=1; i<= M; i++)\\n\\t\\t{\\n\\t\\t\\tst = new StringTokenizer(br.readLine());\\n\\t\\t\\tdx = Integer.parseInt(st.nextToken());\\n\\t\\t\\tdy = Integer.parseInt(st.nextToken());\\n\\t\\t\\tdz = Integer.parseInt(st.nextToken());\\n\\t\\t\\tcurDepth = -1; result = -1;\\n\\t\\t\\t\\n\\t\\t\\tquery(dx, dy);\\n\\t\\t\\tquery(dx, dz);\\n\\t\\t\\tquery(dy, dz);\\n\\t\\t\\t\\n\\t\\t\\tbw.write(result+\\\"\\\\n\\\");\\n\\t\\t}\\n\\t\\tbw.flush();\\n\\t}\",\n \"public static void main(String[] args) {\\n\\n\\n TreeNode mainTree = new TreeNode(50);\\n TreeNode node2 = new TreeNode(17);\\n TreeNode node3 = new TreeNode(12);\\n TreeNode node4 = new TreeNode(23);\\n TreeNode node5 = new TreeNode(14);\\n TreeNode node6 = new TreeNode(54);\\n TreeNode node7 = new TreeNode(72);\\n TreeNode node8 = new TreeNode(67);\\n TreeNode node9 = new TreeNode(19);\\n TreeNode node10= new TreeNode(24);\\n TreeNode node11 = new TreeNode(76);\\n TreeNode node13 = new TreeNode(9);\\n mainTree.left = node2;\\n mainTree.right = node7;\\n node2.left = node3;\\n node2.right = node4;\\n node4.left = node9;\\n node4.right = node10;\\n node3.left = node13;\\n node3.right = node5;\\n node7.left = node6;\\n node7.right = node11;\\n node6.right = node8;\\n\\n DepthFirstSearch.DFS(mainTree);\\n }\",\n \"public static void main(String[] args) {\\n Graph graph = new Graph();\\n graph.addEdge(0, 1);\\n graph.addEdge(0, 4);\\n\\n graph.addEdge(1,0);\\n graph.addEdge(1,5);\\n graph.addEdge(1,2);\\n graph.addEdge(2,1);\\n graph.addEdge(2,6);\\n graph.addEdge(2,3);\\n\\n graph.addEdge(3,2);\\n graph.addEdge(3,7);\\n\\n graph.addEdge(7,3);\\n graph.addEdge(7,6);\\n graph.addEdge(7,11);\\n\\n graph.addEdge(5,1);\\n graph.addEdge(5,9);\\n graph.addEdge(5,6);\\n graph.addEdge(5,4);\\n\\n graph.addEdge(9,8);\\n graph.addEdge(9,5);\\n graph.addEdge(9,13);\\n graph.addEdge(9,10);\\n\\n graph.addEdge(13,17);\\n graph.addEdge(13,14);\\n graph.addEdge(13,9);\\n graph.addEdge(13,12);\\n\\n graph.addEdge(4,0);\\n graph.addEdge(4,5);\\n graph.addEdge(4,8);\\n graph.addEdge(8,4);\\n graph.addEdge(8,12);\\n graph.addEdge(8,9);\\n graph.addEdge(12,8);\\n graph.addEdge(12,16);\\n graph.addEdge(12,13);\\n graph.addEdge(16,12);\\n graph.addEdge(16,17);\\n graph.addEdge(17,13);\\n graph.addEdge(17,16);\\n graph.addEdge(17,18);\\n\\n graph.addEdge(18,17);\\n graph.addEdge(18,14);\\n graph.addEdge(18,19);\\n\\n graph.addEdge(19,18);\\n graph.addEdge(19,15);\\n LinkedList<Integer> visited = new LinkedList();\\n List<ArrayList<Integer>> paths = new ArrayList<ArrayList<Integer>>();\\n int currentNode = START;\\n visited.add(START);\\n new searchEasy().findAllPaths(graph, visited, paths, currentNode);\\n for(ArrayList<Integer> path : paths){\\n for (Integer node : path) {\\n System.out.print(node);\\n System.out.print(\\\" \\\");\\n }\\n System.out.println();\\n }\\n }\",\n \"void DFSUtil(int v, boolean visited[]) {\\n\\t\\t\\tvisited[v] = true;\\n\\t\\t\\tSystem.out.println(v +\\\" \\\");\\n\\t\\t\\t\\n\\t\\t\\t//Recur all the vertices adjacents to this vertex\\n\\t\\t\\tIterator<Integer> i = adj[v].listIterator();\\n\\t\\t\\twhile(i.hasNext()) {\\n\\t\\t\\t\\tint node = i.next();\\n\\t\\t\\t\\tif(!visited[node]) {\\n\\t\\t\\t\\t\\tDFSUtil(node, visited);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\",\n \"static void DFS(int Node)\\n {\\n\\n visit[Node] = true;\\n for (int i = 1; i < ver+1; i++) {\\n\\n\\n if (map[Node][i] == 1 && visit[i] == false) {\\n DFS(i);\\n }\\n\\n }\\n\\n\\n }\",\n \"public static void main(String[] args) {\\n\\t\\tScanner sc = new Scanner(System.in);\\n \\n\\t\\tint n=sc.nextInt();\\n \\n for(int i=0;i<=n;i++)\\n adj.add(new ArrayList<Integer>());\\n\\n for(int i=1;i<n;i++){\\n int a=sc.nextInt();\\n int b=sc.nextInt();\\n adj.get(a).add(b);\\n adj.get(b).add(a);\\n }\\n \\n maxD=-1;\\n dfs(1,0);\\n \\n //Arrays.fill(vis,0);\\n for(int i=0;i<=n;i++) vis[i]=0;\\n maxD=-1;\\n dfs(maxNode,0);\\n \\n System.out.println(maxD);\\n sc.close();\\n\\n\\t}\",\n \"public void topologicalSort() {\\n\\t\\tboolean[] visited = new boolean[edges.length];\\n\\n\\t\\tfor (int i = 0; i < visited.length; i++) {\\n\\t\\t\\tif (visited[i] == false) {\\n\\t\\t\\t\\tdfs(i, visited);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t}\",\n \"public String DFS(int g) {\\n\\t\\t//TODO\\n\\t}\",\n \"public void solve() throws IOException {\\n int n = ni(); \\n int ax = ni(), ay = ni(), bx = ni(), by = ni(), cx = ni(), cy = ni(); \\n boolean[][] visited = new boolean[n + 1][n + 1];\\n if (dfs(n,ax,ay,bx,by,cx,cy,visited))\\n System.out.println(\\\"YES\\\");\\n else\\n System.out.println(\\\"NO\\\");\\n }\",\n \"private static void dfs(int idx, boolean[] visited, boolean[] isbreak) {\\n\\t\\tif(idx==N) {\\n\\t\\t\\t//System.out.println(\\\"����������\\\");\\n\\t\\t\\tint cnt=0;\\n\\t\\t\\tfor(int i=0; i<N; i++) {\\n\\t\\t\\t\\tif(isbreak[i]) cnt++; \\n\\t\\t\\t}\\n\\t\\t\\tans=Math.max(ans, cnt);\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\t\\n\\t\\tif(isbreak[idx]) {\\n\\t\\t\\tdfs(idx+1, visited, isbreak); return;\\n\\t\\t}\\n\\t\\t\\n\\t\\tboolean flag = false;\\n\\t\\tfor(int i=0; i<N; i++) {\\n\\t\\t\\t//System.out.println(\\\"i:\\\"+i);\\n\\t\\t\\tif(i==idx) continue;\\n\\t\\t\\t\\n\\t\\t\\tif(!isbreak[i]) {\\n\\t\\t\\t\\tflag=true;\\n\\t\\t\\t\\t/*System.out.println(i+\\\"�� ģ��\\\");\\n\\t\\t\\t\\tSystem.out.println(\\\"ġ����\\\");\\n\\t\\t\\t\\tSystem.out.println(list.get(idx).inner+\\\" \\\"+list.get(idx).weight);\\n\\t\\t\\t\\tSystem.out.println(list.get(i).inner+\\\" \\\"+list.get(i).weight);*/\\n\\t\\t\\t\\tlist.get(idx).inner-=list.get(i).weight;\\n\\t\\t\\t\\tlist.get(i).inner-=list.get(idx).weight;\\n\\t\\t\\t\\t/*System.out.println(\\\"ġ����\\\");\\n\\t\\t\\t\\tSystem.out.println(list.get(idx).inner+\\\" \\\"+list.get(idx).weight);\\n\\t\\t\\t\\tSystem.out.println(list.get(i).inner+\\\" \\\"+list.get(i).weight);*/\\n\\t\\t\\t\\tif(list.get(i).inner <= 0) isbreak[i]=true;\\n\\t\\t\\t\\tif(list.get(idx).inner <= 0) isbreak[idx]=true;\\n\\t\\t\\t\\t\\n\\n\\t\\t\\t\\tdfs(idx+1,visited,isbreak);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tlist.get(idx).inner+=list.get(i).weight;\\n\\t\\t\\t\\tlist.get(i).inner+=list.get(idx).weight;\\n\\t\\t\\t\\tif(list.get(i).inner > 0) isbreak[i]=false;\\n\\t\\t\\t\\tif(list.get(idx).inner > 0) isbreak[idx]=false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(!flag) {\\n\\t\\t\\tint cnt=0;\\n\\t\\t\\tfor(int i=0; i<N; i++) {\\n\\t\\t\\t\\tif(isbreak[i]) cnt++; \\n\\t\\t\\t}\\n\\t\\t\\tans=Math.max(ans, cnt);\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\t\\n\\t}\",\n \"public MyArrayList<MyArrayList<Node>> DFS() {\\n t = 0;\\n for (int i = 0; i < nodes.size(); i++) {\\n Node node = nodes.get(i);\\n // reset all nodes in the graph to the initial DFS state\\n node.setColor(Color.WHITE);\\n node.setD(0);\\n node.setF(0);\\n node.setParent(null);\\n }\\n MyArrayList<MyArrayList<Node>> components = new MyArrayList<>();\\n for (int i = 0; i < nodes.size(); i++) {\\n Node node = nodes.get(i);\\n if (node.getColor() == Color.WHITE) {\\n // each time we start from a vertex here we are starting a new DFS component\\n MyArrayList<Node> component = new MyArrayList<>();\\n dfsVisit(node, component);\\n components.add(component);\\n }\\n }\\n return components;\\n }\",\n \"public static void main(String[] args) {\\n ArrayList<Integer> arr = new ArrayList<Integer>(); //각 영역의 넓이를 저장할 ArrayList 생성\\n AdjMatrics_DFS b = new AdjMatrics_DFS();\\n int[][] map = {{1,1,1,0,1},\\n {1,1,0,0,1},\\n {1,0,1,1,0},\\n {0,0,1,1,1},\\n {0,0,1,1,1}};\\n boolean[][] check = new boolean[map.length][map[0].length]; //방문한 곳을 체크하기 위한 배열 행렬 생성\\n\\n for(int i=0; i<map.length; i++) {\\n //System.out.println(\\\"다음 찾기 시작\\\");\\n //(0,0) 부터 탐색 시작 후 1을 만나면 넓이 구하기 시작\\n for(int j=0; j<map[i].length; j++) {\\n if(map[i][j] == 1) {\\n b.dfs(i,j,check,map);\\n arr.add(cnt);\\n cnt = 1;\\n }\\n // 아닌경우 continue\\n else\\n continue;\\n }\\n }\\n //\\tSystem.out.println(\\\"프로그램 종료\\\");\\n System.out.println(\\\"arr : \\\"+ arr);\\n }\",\n \"public static void main(String[] args) {\\n\\t\\tint answer = 0;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\tScanner sc = new Scanner(System.in);\\r\\n\\t\\tint t = sc.nextInt();\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t\\twhile (t>0) {\\r\\n\\t\\t\\tint n = sc.nextInt();\\r\\n\\t\\t\\tint[] arr = new int[n+1];\\r\\n\\t\\t\\tboolean[] visited = new boolean[n+1]; \\r\\n\\t\\t\\tt--;\\r\\n\\t\\t\\tfor(int i=1;i<=n;i++) {\\r\\n\\t\\t\\t\\tarr[i] = sc.nextInt();\\r\\n\\t\\t\\t\\tvisited[i] = false;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tfor(int i=1;i<=n;i++) {\\r\\n\\t\\t\\t\\tif (visited[i]==false) {\\r\\n\\t\\t\\t\\t\\tdfs(arr,visited,i);\\r\\n\\t\\t\\t\\t\\tanswer ++;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tSystem.out.println(answer);\\r\\n\\t\\t\\tanswer = 0;\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t}\",\n \"void dfs(SimpleVertex simpleVertex) {\\n\\n\\t\\twhile (true) {\\n\\t\\t\\tif (simpleVertex.isVisited == false) {\\n\\t\\t\\t\\tsimpleVertex.isVisited = true;\\n\\t\\t\\t\\tSystem.out.print(simpleVertex.Vertexname + \\\" \\\");\\n\\t\\t\\t\\tfor (int i = 0; i < simpleVertex.neighborhood.size(); i++) {\\n\\t\\t\\t\\t\\tSimpleEdge node = simpleVertex.neighborhood.get(i);\\n\\n\\t\\t\\t\\t\\tdfs(node.two);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\n\\t}\",\n \"void DFS(int v) {\\n\\t\\t\\tboolean visited[] = new boolean[number_of_vertices];\\n\\t\\t\\t\\n\\t\\t\\t//in case that the vertex are not connected, I need to make DFS for all\\n\\t\\t\\t//available vertex and checking before if they are not visited\\n\\t\\t\\tfor(int i = 0 ; i < number_of_vertices; i++) {\\n\\t\\t\\t\\tif(visited[i] == false)\\n\\t\\t\\t\\t\\tDFSUtil(v, visited);\\n\\t\\t\\t}\\n\\t\\t}\",\n \"public void dfs (int start) {\\n vertexList[start].wasVisited = true; // mark it\\n print(start); stack.push(start);\\n while (!stack.isEmpty()) {\\n int b = getNextUnvisitedNeighbor(stack.peek());\\n if (b==-1) stack.pop(); // no unvisited neighbor;\\n else {\\n vertexList[b].wasVisited = true;\\n print(b); stack.push(b);\\n }\\n }\\n // clear wasVisited marks\\n }\",\n \"private void DFS(Vertex x) {\\r\\n\\t\\tseen[vertices.indexOf(x)] = true;\\r\\n\\t\\tSystem.out.print(x.label + \\\" \\\");\\r\\n\\t\\tfor (int i = 0; i < x.outList.size(); i++) {\\r\\n\\t\\t\\tif (!seen[vertices.indexOf(x.outList.get(i).vertex)]) {\\r\\n\\t\\t\\t\\tDFS(x);\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public static void main(String[] args) {\\n\\t\\tint[][] edges = {{0,1},{1,2},{1,3},{4,5}};\\n\\t\\tGraph graph = createAdjacencyList(edges, true);\\n\\t\\tSystem.out.println(\\\"Number of connected graphs(Adjacency List) unDirected : \\\"+getNumberOfConnectedComponents(graph));\\n\\t\\tSystem.out.println(\\\"Number of connected graphs(Adjacency List) Directed: \\\"+getNumberOfConnectedComponents(createAdjacencyList(edges, false)));\\n\\t\\t\\n\\t\\t//Shortest Distance & path\\n\\t\\tint[][] edgesW = {{0,1,1},{1,2,4},{2,3,1},{0,3,3},{0,4,1},{4,3,1}};\\n\\t\\tgraph = createAdjacencyList(edgesW, true);\\n\\t\\tSystem.out.println(\\\"Shortest distance : \\\"+ getShortestDistance(graph, 0, 3));\\n\\t\\t\\n\\t\\t//Graph represented in Adjacency Matrix\\n\\t\\tint[][] adjacencyMatrix = {{0,1,0,0,1,0},{1,0,1,1,0,0},{0,1,0,1,0,0},{0,1,0,0,0,0},{0,0,0,0,0,0},{0,0,0,0,0,0}};\\n\\t\\t\\n\\t\\t// Connected components or Friends circle\\n\\t\\tSystem.out.println(\\\"Number of connected graphs(Adjacency Matrix) unDirected Recursive: \\\"+getNumberOfConnectedComponents(adjacencyMatrix));\\n\\t\\tSystem.out.println(\\\"Number of connected graphs(Adjacency Matrix) unDirected Iterative: \\\"+getNumberOfConnectedComponents(adjacencyMatrix));\\n\\n\\t\\tSystem.out.println(\\\"Shortest distance : \\\"+ getShortestDistance(adjacencyMatrix, 0, 3));\\n\\t\\t\\n\\t\\t// Number of Islands\\n\\t\\tint[][] islandGrid = {{1,1,0,1},{0,1,0,0},{0,0,1,1},{0,1,1,0}};\\n\\t\\tSystem.out.println(\\\"Number of islands Recursive: \\\"+ getNumberOfIslands(islandGrid));\\n\\t\\t// re-initialize\\n\\t\\tint[][] islandGridIterative = {{1,1,0,0},{0,1,0,0},{0,0,1,1},{0,1,1,0}};\\n\\t\\tSystem.out.println(\\\"Number of islands Iterative: \\\"+ getNumberOfIslandsIterative(islandGridIterative));\\n\\n\\n\\t}\",\n \"void DFSUtil(int v, boolean visited[]) {\\n \\t// Mark the current node as visited and print it \\n visited[v] = true; \\n System.out.print(v + \\\" \\\"); \\n \\n for(int w: adj[v]) \\n \\tif (!visited[w]) { \\n \\t\\tDFSUtil(w, visited);\\n \\t}\\n }\",\n \"public void dfs(Vertex<T> start) {\\n\\t\\t\\t// DFS uses Stack data structure\\n\\t\\t\\tStack<Vertex<T>> stack = new Stack<Vertex<T>>();\\n\\t\\t\\tstart.visited = true;\\n\\t\\t\\tstack.push(start);\\n\\t\\t\\tprintNode(start);\\n\\t\\t\\twhile (!stack.isEmpty()) {\\n\\t\\t\\t\\tVertex<T> n = stack.peek();\\n\\t\\t\\t\\tVertex<T> child = getUnvisitedChildren(n);\\n\\t\\t\\t\\tif (child != null) {\\n\\t\\t\\t\\t\\tchild.visited = true;\\n\\t\\t\\t\\t\\tstack.push(child);\\n\\t\\t\\t\\t\\tprintNode(child);\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tstack.pop();\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\",\n \"public void dfs()\\n{\\n Stack s=new Stack();\\n s.push(this.rootNode);\\n rootNode.visited=true;\\n printNode(rootNode);\\n while(!s.isEmpty())\\n {\\n Node n=(Node)s.peek();\\n Node child=getUnvisitedChildNode(n);\\n if(child!=null)\\n {\\n child.visited=true;\\n printNode(child);\\n s.push(child);\\n }\\n else\\n {\\n s.pop();\\n }\\n }\\n //Clear visited property of nodes\\n clearNodes();\\n}\",\n \"static void graphCheck(int u) {\\n\\t\\tdfs_num[u] = DFS_GRAY; // color this as DFS_GRAY (temp)\\r\\n\\t\\tfor (int j = 0; j < (int) AdjList[u].size(); j++) {\\r\\n\\t\\t\\tEdge v = AdjList[u].get(j);\\r\\n\\t\\t\\tif (dfs_num[v.to] == DFS_WHITE) { // Tree Edge, DFS_GRAY to\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// DFS_WHITE\\r\\n\\t\\t\\t\\tdfs_parent[v.to] = u; // parent of this children is me\\r\\n\\t\\t\\t\\tgraphCheck(v.to);\\r\\n\\t\\t\\t} else if (dfs_num[v.to] == DFS_GRAY) { // DFS_GRAY to DFS_GRAY\\r\\n\\t\\t\\t\\tif (v.to == dfs_parent[u]) // to differentiate these two\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// cases\\r\\n\\t\\t\\t\\t\\tSystem.out.printf(\\\" Bidirectional (%d, %d) - (%d, %d)\\\\n\\\",\\r\\n\\t\\t\\t\\t\\t\\t\\tu, v.to, v.to, u);\\r\\n\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t\\t// la mas usada pillar si tiene un ciclo\\r\\n\\t\\t\\t\\t\\tSystem.out.printf(\\\" Back Edge (%d, %d) (Cycle)\\\\n\\\", u, v.to);\\r\\n\\t\\t\\t} else if (dfs_num[v.to] == DFS_BLACK) // DFS_GRAY to DFS_BLACK\\r\\n\\t\\t\\t\\tSystem.out.printf(\\\" Forward/Cross Edge (%d, %d)\\\\n\\\", u, v.to);\\r\\n\\t\\t}\\r\\n\\t\\tdfs_num[u] = DFS_BLACK; // despues de la recursion DFS_BLACK (DONE)\\r\\n\\t}\",\n \"private static void dfsRecursive(Node node) {\\n\\t\\t//if the node state isn't undiscovered it has already been accounted for\\n\\t\\tif(node == null || node.state != Node.State.UNDISCOVERED) {\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tnode.state = Node.State.DISCOVERED;\\n\\n\\t\\t//process node\\n\\t\\tSystem.out.print(node.name + \\\" -> \\\");\\n\\t\\t\\n\\t\\tfor(Edge e : node.edges) {\\n\\t\\t\\tdfsRecursive(e.getNeighbor(node));\\n\\t\\t}\\n\\t\\t\\t\\n\\t\\t//finished with this node\\n\\t\\tnode.state = Node.State.COMPLETE;\\n\\t}\",\n \"public void depthFirstSearch(Node vertex){\\n vertex.visited = true;\\n if(vertex.row == row_size-1 && vertex.col == col_size-1){\\n while(!dfs_stack.isEmpty()){\\n exitPath +=dfs_stack.peek(); \\n dfs_stack.pop();\\n } \\n }\\n if(vertex.north!=null && vertex.north.visited==false){\\n dfs_stack.push(\\\"N\\\");\\n vertex.depthFirstSearch(vertex.north);\\n }\\n if(vertex.south!=null && vertex.south.visited==false){\\n dfs_stack.push(\\\"S\\\");\\n vertex.depthFirstSearch(vertex.south);\\n }\\n if(vertex.west !=null && vertex.west.visited ==false){\\n dfs_stack.push(\\\"W\\\");\\n vertex.depthFirstSearch(vertex.west);\\n }\\n if(vertex.east !=null && vertex.east.visited==false){\\n dfs_stack.push(\\\"E\\\");\\n vertex.depthFirstSearch(vertex.east);\\n }\\n if (!dfs_stack.isEmpty()){\\n dfs_stack.pop();\\n }\\n return;\\n }\",\n \"static void dfs(Node current, Set<Node> visited) {\\n System.out.print(\\\"Node \\\" + current.val + \\\", \\\");\\n\\n // adds the current node to the set of already visited nodes\\n visited.add(current);\\n\\n // loops over the neighbours of the current node\\n for (Node neighbour: current.neighbours) {\\n\\n // if the neighbour has not been already visited\\n if (! visited.contains(neighbour)) {\\n\\n // recursively processes the neighbour\\n dfs(neighbour, visited);\\n }\\n }\\n }\",\n \"public static void main(String[] args) {\\n\\n G g = new G(6, true, new int[][] { {0, 1}, {1, 2}, {2, 3}, {3, 4}, {4, 0}, {3, 5} });\\n\\n g.print();\\n g.dfs();\\n g.bfs();\\n\\n System.out.println();\\n System.out.println();\\n\\n // 1 -> 2\\n // 0 / \\\\/\\n // \\\\ 4 -> 3 -> 5\\n\\n G gDirected = new G(6, false, new int[][] { {0, 1}, {1, 2}, {2, 3}, {3, 5}, {0, 4}, {4, 3} });\\n\\n gDirected.print();\\n gDirected.dfs();\\n gDirected.bfs();\\n gDirected.topoSort();\\n }\",\n \"static void floodfill() {\\r\\n\\t\\tprintThis(\\\"Flood Fill Demo (the input graph must be UNDIRECTED)\\\");\\r\\n\\t\\tnumComp = 0;\\r\\n\\t\\tdfs_num = new int[V];\\r\\n\\t\\tArrays.fill(dfs_num, DFS_WHITE);\\r\\n\\t\\tfor (int i = 0; i < V; i++)\\r\\n\\t\\t\\tif (dfs_num[i] == DFS_WHITE)\\r\\n\\t\\t\\t\\tfloodfill(i, ++numComp);\\r\\n\\t\\tfor (int i = 0; i < V; i++)\\r\\n\\t\\t\\tSystem.out.printf(\\\"Vertex %d has color %d\\\\n\\\", i, dfs_num[i]);\\r\\n\\t}\",\n \"public static void depthFirstSearchIterative(ArrayList<Node> graph) {\\n\\t\\tSystem.out.println(\\\"DFS Iterative:\\\");\\n\\t\\tif(graph.size() == 0) {\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\t\\n\\t\\tGraphUtils.cleanGraph(graph);\\n\\n\\t\\tDeque<Node> stack = new ArrayDeque<Node>();\\n\\t\\tfor(Node node : graph) {\\n\\t\\t\\tif(node.state != Node.State.UNDISCOVERED) {\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tnode.state = Node.State.DISCOVERED;\\n\\t\\t\\tstack.push(node);\\n\\t\\t\\twhile(!stack.isEmpty()) {\\n\\t\\t\\t\\tnode = stack.pop();\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t//process node\\n\\t\\t\\t\\tSystem.out.print(node.name + \\\" -> \\\");\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tfor(Edge e : node.edges) {\\n\\t\\t\\t\\t\\t//process edge\\n\\t\\t\\t\\t\\tNode neighbor = e.getNeighbor(node);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t//first time we see this node it gets added to the stack for later processing\\n\\t\\t\\t\\t\\tif(neighbor.state == Node.State.UNDISCOVERED) {\\n\\t\\t\\t\\t\\t\\tneighbor.state = Node.State.DISCOVERED;\\n\\t\\t\\t\\t\\t\\tstack.push(neighbor);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t//finished with this node\\n\\t\\t\\t\\tnode.state = Node.State.COMPLETE;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tSystem.out.println();\\n\\t\\tGraphUtils.cleanGraph(graph);\\n\\t}\",\n \"private void doDFSRecursive(int vertex) {\\n markVisited(vertex);\\n\\n for (Integer adjacentVertex : graph.getAdjacentVertices(vertex)) {\\n if (!isVisitedNode(adjacentVertex)) {\\n System.out.print(adjacentVertex + \\\" \\\");\\n doDFSRecursive(adjacentVertex);\\n }\\n }\\n }\",\n \"public static void main(String[] args) {\\n\\t\\tBFS breadFirstSearch = new BFS();\\n\\n\\t\\t// creating an object of class DFS\\n\\t\\tDFS depthFirstSearch = new DFS();\\n\\n\\t\\tchar choice, opt;\\n\\t\\tScanner in = new Scanner(System.in);\\n\\n\\t\\tdo {\\n\\t\\t\\tSystem.out.println(\\\"Enter your choice of search\\\");\\n\\t\\t\\tSystem.out.println(\\\"Press 'b' for breadth first search\\\");\\n\\t\\t\\tSystem.out.println(\\\"Press 'd' for depth first search\\\");\\n\\t\\t\\tchoice = Character.toLowerCase(in.next().charAt(0));\\n\\n\\t\\t\\t// creating a set of vertices\\n\\t\\t\\tVertex vertex1 = new Vertex(1);\\n\\t\\t\\tVertex vertex2 = new Vertex(2);\\n\\t\\t\\tVertex vertex3 = new Vertex(3);\\n\\t\\t\\tVertex vertex4 = new Vertex(4);\\n\\t\\t\\tVertex vertex5 = new Vertex(5);\\n\\n\\t\\t\\t// connecting the vertices to each other to make the graph\\n\\t\\t\\tvertex1.addNeighbourVertex(vertex2);\\n\\t\\t\\tvertex1.addNeighbourVertex(vertex4);\\n\\t\\t\\tvertex4.addNeighbourVertex(vertex5);\\n\\t\\t\\tvertex2.addNeighbourVertex(vertex3);\\n\\n\\n\\t\\t\\tswitch (choice) {\\n\\t\\t\\tcase 'd' : \\n\\t\\t\\t\\t// start the depth first search starting from vertex1\\n\\t\\t\\t\\tdepthFirstSearch.iterativeDFS(vertex1); break;\\n\\n\\t\\t\\tcase 'b':\\n\\t\\t\\t\\t// start the breadth first search starting from vertex1\\n\\t\\t\\t\\tbreadFirstSearch.bfs(vertex1); break;\\n\\n\\t\\t\\tdefault: System.out.println(\\\"wrong input\\\");\\n\\t\\t\\t}\\n\\n\\t\\t\\tSystem.out.println(\\\"Want to continue (y/n)\\\");\\n\\t\\t\\topt = Character.toLowerCase(in.next().charAt(0));\\n\\t\\t} while (opt == 'y');\\n\\t\\tin.close();\\n\\t}\",\n \"private void dfsVisit(Node node) {\\n\\t\\tStack<Node>stack = new Stack<>();\\r\\n\\t\\tstack.push(node); //add source node to queue\\r\\n\\t\\twhile(!stack.isEmpty()) {\\r\\n\\t\\t\\tNode presentNode = stack.pop();\\r\\n\\t\\t\\tpresentNode.setVisited(true);\\r\\n\\t\\t\\tSystem.out.print(presentNode.getName()+\\\" \\\");\\r\\n\\t\\t\\tfor(Node neighbor: presentNode.getNeighbors()) { //for each neighbor of present node\\r\\n\\t\\t\\t\\tif(!neighbor.isVisited()) { //if neighbor is not visited then add it to queue\\r\\n\\t\\t\\t\\t\\tstack.push(neighbor);\\r\\n\\t\\t\\t\\t\\tneighbor.setVisited(true);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}//end of for loop\\r\\n\\t\\t}//end of while loop\\r\\n\\t\\t\\r\\n\\t}\",\n \"public static void main(String[] args) {\\n\\t\\tGraph graph = new Graph();\\n\\t\\tgraph.addEdge(1, 2);\\n\\t\\tgraph.addEdge(1, 3);\\n\\t\\tgraph.addEdge(1, 3);\\n\\t\\tgraph.addEdge(2, 5);\\n\\t\\tgraph.addEdge(2, 6);\\n\\t\\tgraph.addEdge(5, 9);\\n\\t\\tgraph.addEdge(5, 10);\\n\\t\\tgraph.addEdge(4, 7);\\n\\t\\tgraph.addEdge(4, 8);\\n\\t\\tgraph.addEdge(7, 11);\\n\\t\\tgraph.addEdge(7, 12);\\n\\t\\tgraph.addVertex(0);\\n\\t\\tgraph.addVertex(13);\\n\\t\\tgraph.addVertex(14);\\n\\n\\t\\t// vertex 0, 13 and 14 are single nodes\\n\\n\\t\\tTraversalBfsDfs bfs = new TraversalBfsDfs();\\n\\t\\tbfs.runBFS(graph);\\n\\t\\tbfs.runDFS(graph);\\n\\n\\t}\",\n \"void DFS(int v, boolean visited[]) {\\n visited[v] = true;\\n connected++;\\n //LinkedList Iterator to Recursively traverse all adjacent nodes of v\\n Iterator<Integer> itr = adj[v].listIterator();\\n\\n while(itr.hasNext()) {\\n int x = itr.next();\\n if(visited[x] == false)\\n DFS(x,visited);\\n }\\n }\",\n \"public static void main(String args[]) {\\n int V = 4;\\n Graph g = new Graph(V);\\n g.addEdge(0, 1);\\n g.addEdge(0, 2);\\n g.addEdge(1, 2);\\n g.addEdge(2, 0);\\n g.addEdge(2, 3);\\n g.addEdge(3, 3);\\n\\n int src = 1;\\n int dest = 3;\\n boolean[] visited = new boolean[V];\\n\\n // To store the complete path between source and destination\\n Stack<Integer> path1 = new Stack<>();\\n\\n if (hasPathDFS(g, src, dest, visited, path1)) {\\n System.out.println(\\\"There is a path from \\\" + src + \\\" to \\\" + dest);\\n System.out.println(\\\"The complete path is \\\" + path1);\\n } else System.out.println(\\\"There is no path from \\\" + src + \\\" to \\\" + dest);\\n\\n src = 3;\\n dest = 1;\\n // To store the complete path between source and destination\\n Stack<Integer> path2 = new Stack<>();\\n\\n if (hasPathDFS(g, src, dest, visited, path2)) System.out.println(\\\"There is a path from \\\" + src + \\\" to \\\" + dest);\\n else System.out.println(\\\"There is no path from \\\" + src + \\\" to \\\" + dest);\\n\\n // total number of nodes in the graph (labeled from 0 to 7)\\n int n = 8;\\n\\n // List of graph edges as per the above diagram\\n Graph g2 = new Graph(n);\\n /**\\n * There is a path from 1 to 3\\n * The complete path is [1, 2, 3]\\n * There is no path from 3 to 1\\n * There is a path from 0 to 7\\n * The complete path is [0, 3, 4, 6, 7]\\n */\\n\\n g2.addEdge(0, 3);\\n g2.addEdge(1, 0);\\n g2.addEdge(1, 2);\\n g2.addEdge(1, 4);\\n g2.addEdge(2, 7);\\n g2.addEdge(3, 4);\\n g2.addEdge(3, 5);\\n g2.addEdge(4, 3);\\n g2.addEdge(4, 6);\\n g2.addEdge(5, 6);\\n g2.addEdge(6, 7);\\n\\n // source and destination vertex\\n src = 0;\\n dest = 7;\\n\\n // To store the complete path between source and destination\\n Stack<Integer> path = new Stack<>();\\n boolean[] visited2 = new boolean[n];\\n\\n if (hasPathDFS(g2, src, dest, visited2, path)) {\\n System.out.println(\\\"There is a path from \\\" + src + \\\" to \\\" + dest);\\n System.out.println(\\\"The complete path is \\\" + path);\\n } else System.out.println(\\\"There is no path from \\\" + src + \\\" to \\\" + dest);\\n\\n\\n }\",\n \"public static void main(String[] args) {\\n\\t\\tlong start=System.currentTimeMillis();\\r\\n\\r\\n\\t\\tGraph g = new Graph(9);\\r\\n\\t\\tg.addEdge(0, 1);\\r\\n\\t\\tg.addEdge(1, 2);\\r\\n\\t\\tg.addEdge(1, 3);\\r\\n\\t\\tg.addEdge(2, 4);\\r\\n\\t\\tg.addEdge(2, 3);\\r\\n\\t\\tg.addEdge(3, 4);\\r\\n\\t\\tg.addEdge(3, 5);\\r\\n\\t\\tg.addEdge(5, 6);\\r\\n\\t\\tg.addEdge(5, 7);\\r\\n\\t\\tg.addEdge(6, 8);\\r\\n\\t\\t//g.dfs();\\r\\n\\t\\t//0 1 3 5 7 6 8 4 2 0.004초\\r\\n\\t\\t//g.bfs();\\r\\n\\t\\t//0 1 2 3 4 5 6 7 8 0.006초\\r\\n\\t\\tg.dfsR(); \\r\\n\\t\\t//0 1 2 3 4 5 6 7 8 0.004초 \\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t\\tlong end = System.currentTimeMillis();\\r\\n\\t\\tSystem.out.println(\\\" 실행 시간 : \\\" + (end - start)/1000.0 + \\\"초\\\");\\r\\n\\t\\t\\r\\n\\t\\r\\n\\t}\",\n \"void DFS(int head) {\\n //visited boolean array maintained to keep track of visited nodes and to avoid infinite looping\\n boolean visited[] = new boolean[V+1];\\n if(visited[head] == false)\\n DFS(head,visited);\\n\\n System.out.println(V-connected);\\n }\",\n \"public void dfs(DSAGraphVertex vx, DSAStack visited, DSAQueue queue)\\n\\t{\\n\\t\\ttry {\\n\\t\\t\\tif(vx != null) //base case if it's null end recursion\\n\\t\\t\\t{\\n\\t\\t\\t\\tvisited.push(vx); //push onto visited stack\\n\\n\\t\\t\\t\\tIterator<DSAGraphVertex> itr = vx.getAdjacent().iterator();\\n\\n\\t\\t\\t\\tdo{\\n\\t\\t\\t\\t\\twhile (itr.hasNext())\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tvx = itr.next();\\n\\t\\t\\t\\t\\t\\tif(!vx.getVisited()) //if not visited traverse here\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tqueue.enqueue(vx); //adds to output queue\\n\\t\\t\\t\\t\\t\\t\\tvx.setVisited(); //sets to visited\\n\\t\\t\\t\\t\\t\\t\\tdfs(vx, visited, queue);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tvisited.pop();\\n\\n\\t\\t\\t\\t} while(!visited.isEmpty());\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcatch (IllegalArgumentException e) //catches empty stack exceptions\\n\\t\\t{\\n\\t\\t\\t//System.out.println(e.getMessage());\\n\\t\\t}\\n\\n\\t}\",\n \"public void run() {\\n BFS();\\n printBFS();\\n shortestPathList();\\n printShortestPath();\\n printPath();\\n }\",\n \"private void dfs(Node s, HashSet<Integer> visited) {\\n\\t\\tif(visited.contains(s.id)) {\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tSystem.out.println(s.id);\\n\\t\\tvisited.add(s.id);\\n\\t\\tfor(Node n :s.adj) {\\n\\t\\t\\tdfs(n,visited);\\n\\t\\t}\\n\\t}\",\n \"@Override\\n\\tpublic void run() {\\n\\t\\tMap<Integer, Location> possibleStartLocations = possibleStartLocations();\\n\\n\\t\\tfor(Entry<Integer, Location> startLocation : possibleStartLocations.entrySet()) {\\n\\t\\t\\t// Add startLocation to visited locations\\n\\t\\t\\tMap<Integer, Location> visitedLocations = new HashMap<Integer, Location>();\\n\\t\\t\\tvisitedLocations.put(startLocation.getKey(), startLocation.getValue());\\n\\t\\t\\t\\n\\t\\t\\t// Add startLocation to visited order\\n\\t\\t\\tList<Location> visitedOrder = new LinkedList<Location>();\\n\\t\\t\\tvisitedOrder.add(startLocation.getValue());\\n\\t\\t\\t\\n\\t\\t\\t// Start the recursion for the following start node\\n\\t\\t\\tfindSolution(startLocation, startLocation, visitedLocations, visitedOrder, 0);\\n\\t\\t}\\n\\t}\",\n \"private void propagateFeatures () {\\n Logger.log(\\\"Propagating invocations through the Call Graph - DFS\\\");\\n Set<SootMethod> calculated = new HashSet<SootMethod>();\\n Chain<SootClass> classes = Scene.v().getApplicationClasses();\\n SootClass c = null;\\n SootMethod m = null;\\n try {\\n for (SootClass sclass : classes) {\\n c = sclass;\\n List<SootMethod> methods = sclass.getMethods();\\n for (SootMethod method : methods) {\\n m = method;\\n if (!calculated.contains(method)) {\\n propagateFeatures(method, calculated);\\n }\\n }\\n }\\n } catch (Exception e) {\\n // handling\\n }\\n }\",\n \"static void dfs(int[][] G){\\n\\t\\tStack<Integer> s = new Stack<Integer>();\\n\\t\\tfor (int ver_start=0; ver_start<N; ver_start++){\\n\\t\\t\\tif (visited[ver_start]) continue;\\n\\t\\t\\ts.push(ver_start);\\n\\t\\t\\tvisited[ver_start] = true;\\n\\n\\t\\t\\twhile(!s.isEmpty()){\\n\\t\\t\\t\\tint vertex = s.pop();\\n\\t\\t\\t\\tSystem.out.print((vertex+1) + \\\" \\\");\\n\\t\\t\\t\\tfor (int i=0; i<N; i++){\\n\\t\\t\\t\\t\\tif (G[vertex][i] == 1 && !visited[i]){\\n\\t\\t\\t\\t\\t\\t// find neigbor of current vertex and not visited\\n\\t\\t\\t\\t\\t\\t// add into the stack\\n\\t\\t\\t\\t\\t\\ts.push(i);\\n\\t\\t\\t\\t\\t\\tvisited[i] = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tSystem.out.println();\\n\\t\\t}\\n\\t}\",\n \"void DFSUtil(int v, boolean visited[]) {\\n // Mark the current node as visited and print it\\n visited [v] = true;\\n System.out.print(v + \\\" \\\");\\n\\n // Recur for all the vertices adjacent to this vertex\\n Iterator<Integer> i = adj [v].listIterator();\\n while (i.hasNext()) {\\n int n = i.next();\\n if (!visited [n])\\n DFSUtil(n, visited);\\n }\\n }\",\n \"public void dft() {\\r\\n\\t\\tHashMap<String, Boolean> processed = new HashMap<>();\\r\\n\\t\\tLinkedList<Pair> stack = new LinkedList<>();\\r\\n\\r\\n\\t\\tArrayList<String> vnames = new ArrayList<>(vces.keySet());\\r\\n\\t\\tfor (String vname : vnames) {\\r\\n\\t\\t\\tif (processed.containsKey(vname)) {\\r\\n\\t\\t\\t\\tcontinue;\\r\\n\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\tPair rootpair = new Pair(vname, vname);\\r\\n\\t\\t\\tstack.addFirst(rootpair);\\r\\n\\t\\t\\twhile (stack.size() != 0) {\\r\\n\\t\\t\\t\\t// 1. removeFirst\\r\\n\\t\\t\\t\\tPair rp = stack.removeFirst();\\r\\n\\r\\n\\t\\t\\t\\t// 2. check if processed, mark if not\\r\\n\\t\\t\\t\\tif (processed.containsKey(rp.vname)) {\\r\\n\\t\\t\\t\\t\\tcontinue;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tprocessed.put(rp.vname, true);\\r\\n\\r\\n\\t\\t\\t\\t// 3. Check, if an edge is found\\r\\n\\t\\t\\t\\tSystem.out.println(rp.vname + \\\" via \\\" + rp.psf);\\r\\n\\r\\n\\t\\t\\t\\t// 4. Add the unprocessed nbrs back\\r\\n\\t\\t\\t\\tArrayList<String> nbrnames = new ArrayList<>(rp.vtx.nbrs.keySet());\\r\\n\\t\\t\\t\\tfor (String nbrname : nbrnames) {\\r\\n\\t\\t\\t\\t\\tif (!processed.containsKey(nbrname)) {\\r\\n\\t\\t\\t\\t\\t\\tPair np = new Pair(nbrname, rp.psf + nbrname);\\r\\n\\t\\t\\t\\t\\t\\tstack.addFirst(np);\\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}\",\n \"public void dfs (Node node) {\\r\\n\\t\\t\\r\\n\\t\\tSystem.out.print(node.data+\\\" \\\");\\r\\n\\t\\tList<Node> adding = node.getPartners();\\r\\n\\t\\tnode.visited = true;\\r\\n\\t\\t\\tfor(int loop=0; loop<adding.size(); loop++) {\\r\\n\\t\\t\\t\\tNode n = adding.get(loop);\\r\\n\\t\\t\\t\\t\\tif (n!=null && !n.visited) {\\r\\n\\t\\t\\t\\t\\t\\tdfs(n);\\r\\n\\t\\t\\t\\t\\t} // if loop ends here\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t} // for loop ends here\\r\\n\\t\\t\\r\\n\\t}\",\n \"void DFSearch(BFSNode n){\\n\\t\\tn.discovered=true;\\r\\n\\t\\tSystem.out.print(\\\" discovered\\\");\\r\\n\\t\\tn.preProcessNode();\\r\\n\\t\\tfor( Integer edg: n.edges){\\r\\n\\t\\t\\tn.processEdge(edg);\\r\\n\\t\\t\\tif(!nodes[edg].discovered){\\r\\n\\t\\t\\t\\tnodes[edg].parent = n; \\r\\n\\t\\t\\t\\tnodes[edg].depth = n.depth +1;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tSystem.out.print(\\\"{new track with parent [\\\"+ nodes[edg].parent.value+\\\"] }\\\");\\r\\n\\t\\t\\t\\tDFSearch(nodes[edg]);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse{\\r\\n\\t\\t\\t\\tif(nodes[edg] != n.parent){\\r\\n\\t\\t\\t\\t\\tSystem.out.print(\\\"{LOOP}\\\");\\r\\n\\t\\t\\t\\t\\tif(nodes[edg].depth < n.reachableLimit.depth){\\r\\n\\t\\t\\t\\t\\t\\tn.reachableLimit = nodes[edg];\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\telse{\\r\\n\\t\\t\\t\\t\\tSystem.out.print(\\\"{second visit}\\\");\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\tSystem.out.println(\\\"back from node [ \\\"+n.value +\\\" ]\\\");\\r\\n\\t\\tn.postProcessNode();\\r\\n\\t\\tn.processed = true;\\r\\n\\t\\t\\r\\n\\t}\",\n \"private void DFS(Vertex start, Set<Vertex> visited, Stack<Vertex> stack) {\\r\\n\\t\\t// if(visited.contains(start)) return;\\r\\n\\r\\n\\t\\t// Mark the current node as visited and push it\\r\\n\\t\\tvisited.add(start);\\r\\n\\t\\tstack.push(start);\\r\\n\\r\\n\\t\\tVertex currentNode;\\r\\n\\t\\tSet<Vertex> neighbors;\\r\\n\\r\\n\\t\\twhile (stack.size() > 0) {\\r\\n\\t\\t\\t// Pop a vertex from stack and print it\\r\\n\\t\\t\\tcurrentNode = stack.pop();\\r\\n\\r\\n\\t\\t\\tSystem.out.print(currentNode + \\\" \\\");\\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\\tneighbors = currentNode.getNeighbors();\\r\\n\\r\\n\\t\\t\\tfor (Vertex n : neighbors) {\\r\\n\\t\\t\\t\\tif (!visited.contains(n)) {\\r\\n\\t\\t\\t\\t\\tvisited.add(n);\\r\\n\\t\\t\\t\\t\\tstack.push(n);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t}\",\n \"private static void DFS(int v, int CC, UndirectedGraphAPI graph) {\\n\\t\\tcolor[v] = GRAY;\\n\\t\\tidArray[v] = CC;\\n\\t\\tArrayList<Edge> list = graph.getAdj()[v];\\n\\t\\tfor(Edge edge : list){\\n\\t\\t\\tint w = edge.getOtherVertex(v);\\n\\t\\t\\tif(color[w] == WHITE){\\n\\t\\t\\t\\tcount++;\\n\\t\\t\\t\\tDFS(w, CC, graph);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcolor[v] = BLACK;\\n\\t}\",\n \"public void depthFirstTraverse() {\\n\\t\\tInteger first = (Integer) edges.keySet().toArray()[0];\\n\\t\\t// track whether vertex was visited\\n\\t\\tHashMap<Integer, Boolean> visited = buildVisited();\\n\\t\\tdepthFirstTraverse(first, visited);\\n\\t}\",\n \"public static void main(String[] args) {\\n\\t\\tScanner sc = new Scanner(System.in);\\n\\t\\tint tc = sc.nextInt();\\n\\t\\tfor (int T = 0; T < tc; T++) {\\n\\t\\t\\tint V = sc.nextInt();\\n\\t\\t\\tint E = sc.nextInt();\\n\\t\\t\\tint[][] graph = new int[V][V];\\n\\t\\t\\tfor (int i = 0; i < E; i++) {\\n\\t\\t\\t\\tint start = sc.nextInt();\\n\\t\\t\\t\\tint end = sc.nextInt();\\n\\t\\t\\t\\tgraph[start][end] = 1;\\n\\t\\t\\t\\t// graph[end][start] = 1;\\n\\t\\t\\t}\\n\\n\\t\\t\\tfront = 0;\\n\\t\\t\\tstack = new int[V];\\n\\t\\t\\tjava.util.Arrays.fill(stack, -1);\\n\\t\\t\\tvisited = new int[V];\\n\\t\\t\\tfound = false;\\n\\t\\t\\tint src = 0;\\n\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t\\tfor (int i = 0; i < V; i++) {\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(found == false && visited[i] ==0){\\n\\t\\t\\t\\t\\tstack[front++] = i;\\n\\t\\t\\t\\t\\tDFS(graph,i);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(found == true)\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t\\tif(found == true){\\n\\t\\t\\t\\tSystem.out.println(\\\"Found\\\");\\n\\t\\t\\t\\tfor (int j = 0; j < front; j++) {\\n\\t\\t\\t\\t\\tSystem.out.println(stack[j]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tSystem.out.println(\\\"Not Found\\\");\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"public void doDfsIterative(Graph g, int s) {\\n boolean[] myVisited = new boolean[8];\\n Stack<Integer> stack = new Stack<>();\\n stack.push(s);\\n myVisited[s] = true;\\n while (!stack.isEmpty()) {\\n int top = stack.pop();\\n System.out.print(\\\"[\\\" + top + \\\"] \\\");\\n for (int e : g.adj[top]) {\\n if (!myVisited[e]) {\\n stack.push(e);\\n myVisited[e] = true;\\n }\\n }\\n }\\n\\n }\",\n \"public static void main(String[] args) {\\n SearchTree search = new SearchTree(new Node(INITIAL_STATE), GOAL_STATE);\\n long startTime = System.currentTimeMillis();\\n\\n search.breadthFirstSearch();\\n// search.depthFirstSearch();\\n// search.iterativeDeepening(10);\\n\\n long finishTime = System.currentTimeMillis();\\n long totalTime = finishTime - startTime;\\n System.out.println(\\\"\\\\n[Elapsed time: \\\" + totalTime + \\\" milliseconds]\\\");\\n System.out.println(\\\"========================================================\\\");\\n }\",\n \"static void iterativeDfs(Node startingNode) {\\n Set<Node> markedAsVisited = new HashSet<>();\\n\\n // creates a stack for piling up the nodes to visit\\n ArrayDeque<Node> toBeVisited = new ArrayDeque<>();\\n\\n // sets the starting node as to be visited\\n toBeVisited.push(startingNode);\\n\\n // adds the starting node to the set of marked as visited nodes\\n markedAsVisited.add(startingNode);\\n\\n // while there nodes to visit\\n while (!toBeVisited.isEmpty()) {\\n\\n // gets the current node\\n Node current = toBeVisited.pop();\\n\\n // processes the node\\n System.out.print(\\\"Node \\\" + current.val + \\\", \\\");\\n\\n // loops over the neighbours of the current node\\n for (Node neighbour: current.neighbours) {\\n\\n // if the neighbour has not been already visited\\n if (! markedAsVisited.contains(neighbour)) {\\n\\n // adds the neighbour to the ones to be visited\\n toBeVisited.push(neighbour);\\n\\n // adds the neighbour to the set of marked as visited nodes\\n markedAsVisited.add(neighbour);\\n }\\n }\\n }\\n }\",\n \"public static void main(String[]args) throws Exception{\\n\\t\\tBufferedReader br = new BufferedReader(new InputStreamReader(System.in));\\r\\n\\t\\tint n = Integer.parseInt(br.readLine());\\r\\n\\t\\tint m = Integer.parseInt(br.readLine());\\r\\n\\t\\tarr = new int[n+1][n+1];\\r\\n\\t\\tvisited = new boolean[n+1];\\r\\n\\t\\t\\r\\n\\t\\tStringTokenizer st;\\r\\n\\t\\tfor(int i=0; i<m; i++) {\\r\\n\\t\\t\\tst = new StringTokenizer(br.readLine());\\r\\n\\t\\t\\tint f = Integer.parseInt(st.nextToken());\\r\\n\\t\\t\\tint b = Integer.parseInt(st.nextToken());\\r\\n\\t\\t\\tarr[f][b] = 1;\\r\\n\\t\\t\\tarr[b][f] = 1;\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t\\tdfs(1);\\r\\n\\t\\tSystem.out.println(result);\\r\\n\\t}\",\n \"public static void main(String[] args) {\\nDGraph g=new DGraph();\\r\\nDirectedDFS d=new DirectedDFS(g);\\r\\nfor(Iterator<Integer> i=d.preorder.iterator();i.hasNext();)\\r\\n{\\r\\n\\tSystem.out.print(i.next()+\\\" \\\");\\r\\n}\\r\\nSystem.out.println();\\r\\nfor(Iterator<Integer> i=d.postorder.iterator();i.hasNext();)\\r\\n{\\r\\n\\tSystem.out.print(i.next()+\\\" \\\");\\r\\n}\\r\\nSystem.out.println();\\r\\n\\r\\n/*for(Iterator i=d.topologicalorder.iterator();i.hasNext();)\\r\\n{\\r\\n\\tSystem.out.print(i.next()+\\\" \\\");\\r\\n}\\r\\nSystem.out.println();*/\\r\\n\\r\\n\\r\\n\\tfor(int w:d.reversepost())\\r\\n\\t\\tSystem.out.print(w+\\\" \\\");\\r\\n\\t//System.out.println(d.topologicalorder.pop());\\r\\n\\t}\",\n \"@Test\\n public void dfsRecursiveTest() {\\n Map<String, List<String>> graph = new HashMap<>();\\n graph.put(\\\"A\\\", Lists.newArrayList(\\\"B\\\", \\\"S\\\"));\\n graph.put(\\\"B\\\", Lists.newArrayList(\\\"A\\\"));\\n graph.put(\\\"C\\\", Lists.newArrayList(\\\"D\\\", \\\"E\\\", \\\"F\\\", \\\"S\\\"));\\n graph.put(\\\"D\\\", Lists.newArrayList(\\\"C\\\"));\\n graph.put(\\\"E\\\", Lists.newArrayList(\\\"C\\\", \\\"H\\\"));\\n graph.put(\\\"F\\\", Lists.newArrayList(\\\"C\\\", \\\"G\\\"));\\n graph.put(\\\"G\\\", Lists.newArrayList(\\\"F\\\", \\\"H\\\", \\\"S\\\"));\\n graph.put(\\\"H\\\", Lists.newArrayList(\\\"E\\\", \\\"G\\\"));\\n graph.put(\\\"S\\\", Lists.newArrayList(\\\"A\\\", \\\"C\\\", \\\"G\\\"));\\n\\n List<String> traversal = new DFSRecursive().runDFS(\\\"A\\\", graph);\\n\\n Assert.assertEquals(Lists.newArrayList(\\\"A\\\", \\\"B\\\", \\\"S\\\", \\\"C\\\", \\\"D\\\", \\\"E\\\", \\\"H\\\", \\\"G\\\", \\\"F\\\"), traversal);\\n }\",\n \"private void visitDFS(Dot node, Set< Dot > visited ) {\\n\\n board.getNeighbors( node ).forEach( nbr -> {\\n if ( !visited.contains( nbr ) ) {\\n visited.add( nbr );\\n visitDFS( nbr, visited );\\n }\\n } );\\n }\",\n \"private static void dfs(int x, int y) {\\n arr[x][y] = 1;\\n area++;\\n \\n for(int i=0; i<4; i++) {\\n int nx = x + dx[i];\\n int ny = y + dy[i];\\n \\n if(0 <= nx && nx < m && 0 <= ny && ny < n) {\\n if(arr[nx][ny] == 0)\\n dfs(nx, ny);\\n }\\n }\\n\\t\\t\\n\\t}\",\n \"private static void initTopologicalSortDFS(int V) {\\r\\n\\t\\t// // make sure that the given graph is DAG\\r\\n\\t\\tprintThis(\\\"Topological Sort (the input graph must be DAG)\\\");\\r\\n\\t\\ttopoSort = new ArrayList<Integer>();\\r\\n\\t\\ttopoSort.clear();\\r\\n\\t\\tdfs_num = new int[V];\\r\\n\\t\\tArrays.fill(dfs_num, DFS_WHITE);\\r\\n\\r\\n\\t\\tfor (int i = 0; i < V; i++)\\r\\n\\t\\t\\t// this part is the same as finding CCs\\r\\n\\t\\t\\tif (dfs_num[i] == DFS_WHITE)\\r\\n\\t\\t\\t\\t// asi se hace todo el topological\\r\\n\\t\\t\\t\\ttopologicalSortDFS(i);\\r\\n\\t\\tCollections.reverse(topoSort);\\r\\n\\t\\t// reverse topoSort\\r\\n\\t\\tfor (int i = 0; i < topoSort.size(); i++)\\r\\n\\t\\t\\t// or you can simply read\\r\\n\\t\\t\\tSystem.out.printf(\\\" %d\\\", topoSort.get(i));\\r\\n\\t\\t// the content of `topoSort' backwards\\r\\n\\t\\tSystem.out.printf(\\\"\\\\n\\\");\\r\\n\\t}\",\n \"private void dfs(int y, int x, boolean[][] visited, Set<String> results, BoggleBoard board,\\n\\t\\t\\tTST.BacktrackTraverser<Integer> bt) {\\n\\t\\tif (bt.hasValue()) {\\n\\t\\t\\tString word = appendU(bt.getWord());\\n\\t\\t\\tif (bt.getValue() > 0) {\\n\\t\\t\\t\\tresults.add(word);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t// Check every unused nearby grid.\\n\\t\\t// Only continue on grid if there's some word down the TST.\\n\\t\\tfor (int[] dir : directions) {\\n\\t\\t\\tint[] moved = move(y, x, dir);\\n\\t\\t\\tif (!inBound(moved, board)) {\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tif (visited[moved[0]][moved[1]]) {\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tchar singleLetter = board.getLetter(moved[0], moved[1]);\\n\\t\\t\\tif (!bt.hasDown(singleLetter)) {\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tvisited[moved[0]][moved[1]] = true;\\n\\t\\t\\tbt.down(singleLetter);\\n\\t\\t\\tdfs(moved[0], moved[1], visited, results, board, bt);\\n\\t\\t\\tbt.up();\\n\\t\\t\\tvisited[moved[0]][moved[1]] = false;\\n\\t\\t}\\n\\t}\",\n \"private void dfs(DigrafoAristaPonderada G, int v) {\\n enPila[v] = true;\\n marcado[v] = true;\\n for (AristaDirigida a : G.ady(v)) {\\n int w = a.hacia();\\n\\n // short circuit if directed ciclo found\\n if (ciclo != null) return;\\n\\n //found new vertex, so recur\\n else if (!marcado[w]) {\\n aristaHacia[w] = a;\\n dfs(G, w);\\n }\\n\\n // trace back directed ciclo\\n else if (enPila[w]) {\\n ciclo = new Pila<AristaDirigida>();\\n while (a.desde() != w) {\\n ciclo.push(a);\\n a = aristaHacia[a.desde()];\\n }\\n ciclo.push(a);\\n return;\\n }\\n }\\n\\n enPila[v] = false;\\n }\",\n \"public DepthFirstSearch(Graph graph) throws Exception {\\n\\n this.graph = graph;\\n int n = graph.getNumV();\\n\\n parent = new int[n];\\n Arrays.fill( parent , -1);\\n\\n visited = new boolean[n];\\n Arrays.fill( visited , false );\\n\\n discoveryOrder = new int[n];\\n finishOrder = new int[n];\\n\\n for (int i = 0; i < n; i++) {\\n if (!visited[i])\\n depthFirstSearch(i);\\n }\\n\\n }\",\n \"public void DFS(int current) {\\r\\n if (vertexList.get(current).isVisited) {\\r\\n return;\\r\\n }\\r\\n visit(current);\\r\\n int next = nextNeighbour(current);\\r\\n while (next != -1) {\\r\\n DFS(next);\\r\\n next = nextNeighbour(current);\\r\\n }\\r\\n }\",\n \"public List<Graph> search() {\\n\\n long start = System.currentTimeMillis();\\n TetradLogger.getInstance().log(\\\"info\\\", \\\"Starting ION Search.\\\");\\n logGraphs(\\\"\\\\nInitial Pags: \\\", this.input);\\n TetradLogger.getInstance().log(\\\"info\\\", \\\"Transfering local information.\\\");\\n long steps = System.currentTimeMillis();\\n\\n /*\\n * Step 1 - Create the empty graph\\n */\\n List<Node> varNodes = new ArrayList<>();\\n for (String varName : variables) {\\n varNodes.add(new GraphNode(varName));\\n }\\n Graph graph = new EdgeListGraph(varNodes);\\n\\n /*\\n * Step 2 - Transfer local information from the PAGs (adjacencies\\n * and edge orientations)\\n */\\n // transfers edges from each graph and finds definite noncolliders\\n transferLocal(graph);\\n // adds edges for variables never jointly measured\\n for (NodePair pair : nonIntersection(graph)) {\\n graph.addEdge(new Edge(pair.getFirst(), pair.getSecond(), Endpoint.CIRCLE, Endpoint.CIRCLE));\\n }\\n TetradLogger.getInstance().log(\\\"info\\\", \\\"Steps 1-2: \\\" + (System.currentTimeMillis() - steps) / 1000. + \\\"s\\\");\\n System.out.println(\\\"step2\\\");\\n System.out.println(graph);\\n\\n /*\\n * Step 3\\n *\\n * Branch and prune step that blocks problematic undirectedPaths, possibly d-connecting undirectedPaths\\n */\\n steps = System.currentTimeMillis();\\n Queue<Graph> searchPags = new LinkedList<>();\\n // place graph constructed in step 2 into the queue\\n searchPags.offer(graph);\\n // get d-separations and d-connections\\n List<Set<IonIndependenceFacts>> sepAndAssoc = findSepAndAssoc(graph);\\n this.separations = sepAndAssoc.get(0);\\n this.associations = sepAndAssoc.get(1);\\n Map<Collection<Node>, List<PossibleDConnectingPath>> paths;\\n// Queue<Graph> step3PagsSet = new LinkedList<Graph>();\\n HashSet<Graph> step3PagsSet = new HashSet<>();\\n Set<Graph> reject = new HashSet<>();\\n // if no d-separations, nothing left to search\\n if (separations.isEmpty()) {\\n // makes orientations preventing definite noncolliders from becoming colliders\\n // do final orientations\\n// doFinalOrientation(graph);\\n step3PagsSet.add(graph);\\n }\\n // sets length to iterate once if search over path lengths not enabled, otherwise set to 2\\n int numNodes = graph.getNumNodes();\\n int pl = numNodes - 1;\\n if (pathLengthSearch) {\\n pl = 2;\\n }\\n // iterates over path length, then adjacencies\\n for (int l = pl; l < numNodes; l++) {\\n if (pathLengthSearch) {\\n TetradLogger.getInstance().log(\\\"info\\\", \\\"Braching over path lengths: \\\" + l + \\\" of \\\" + (numNodes - 1));\\n }\\n int seps = separations.size();\\n int currentSep = 1;\\n int numAdjacencies = separations.size();\\n for (IonIndependenceFacts fact : separations) {\\n if (adjacencySearch) {\\n TetradLogger.getInstance().log(\\\"info\\\", \\\"Braching over path nonadjacencies: \\\" + currentSep + \\\" of \\\" + numAdjacencies);\\n }\\n seps--;\\n // uses two queues to keep up with which PAGs are being iterated and which have been\\n // accepted to be iterated over in the next iteration of the above for loop\\n searchPags.addAll(step3PagsSet);\\n recGraphs.add(searchPags.size());\\n step3PagsSet.clear();\\n while (!searchPags.isEmpty()) {\\n System.out.println(\\\"ION Step 3 size: \\\" + searchPags.size());\\n double currentUsage = Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory();\\n if (currentUsage > maxMemory) maxMemory = currentUsage;\\n // deques first PAG from searchPags\\n Graph pag = searchPags.poll();\\n // Part 3.a - finds possibly d-connecting undirectedPaths between each pair of nodes\\n // known to be d-separated\\n List<PossibleDConnectingPath> dConnections = new ArrayList<>();\\n // checks to see if looping over adjacencies\\n if (adjacencySearch) {\\n for (Collection<Node> conditions : fact.getZ()) {\\n // checks to see if looping over path lengths\\n if (pathLengthSearch) {\\n dConnections.addAll(PossibleDConnectingPath.findDConnectingPathsOfLength\\n (pag, fact.getX(), fact.getY(), conditions, l));\\n } else {\\n dConnections.addAll(PossibleDConnectingPath.findDConnectingPaths\\n (pag, fact.getX(), fact.getY(), conditions));\\n }\\n }\\n } else {\\n for (IonIndependenceFacts allfact : separations) {\\n for (Collection<Node> conditions : allfact.getZ()) {\\n // checks to see if looping over path lengths\\n if (pathLengthSearch) {\\n dConnections.addAll(PossibleDConnectingPath.findDConnectingPathsOfLength\\n (pag, allfact.getX(), allfact.getY(), conditions, l));\\n } else {\\n dConnections.addAll(PossibleDConnectingPath.findDConnectingPaths\\n (pag, allfact.getX(), allfact.getY(), conditions));\\n }\\n }\\n }\\n }\\n // accept PAG go to next PAG if no possibly d-connecting undirectedPaths\\n if (dConnections.isEmpty()) {\\n// doFinalOrientation(pag);\\n// Graph p = screenForKnowledge(pag);\\n// if (p != null) step3PagsSet.add(p);\\n step3PagsSet.add(pag);\\n continue;\\n }\\n // maps conditioning sets to list of possibly d-connecting undirectedPaths\\n paths = new HashMap<>();\\n for (PossibleDConnectingPath path : dConnections) {\\n List<PossibleDConnectingPath> p = paths.get(path.getConditions());\\n if (p == null) {\\n p = new LinkedList<>();\\n }\\n p.add(path);\\n paths.put(path.getConditions(), p);\\n }\\n // Part 3.b - finds minimal graphical changes to block possibly d-connecting undirectedPaths\\n List<Set<GraphChange>> possibleChanges = new ArrayList<>();\\n for (Set<GraphChange> changes : findChanges(paths)) {\\n Set<GraphChange> newChanges = new HashSet<>();\\n for (GraphChange gc : changes) {\\n boolean okay = true;\\n for (Triple collider : gc.getColliders()) {\\n\\n if (pag.isUnderlineTriple(collider.getX(), collider.getY(), collider.getZ())) {\\n okay = false;\\n break;\\n }\\n\\n }\\n if (!okay) {\\n continue;\\n }\\n for (Triple collider : gc.getNoncolliders()) {\\n if (pag.isDefCollider(collider.getX(), collider.getY(), collider.getZ())) {\\n okay = false;\\n break;\\n }\\n }\\n if (okay) {\\n newChanges.add(gc);\\n }\\n }\\n if (!newChanges.isEmpty()) {\\n possibleChanges.add(newChanges);\\n } else {\\n possibleChanges.clear();\\n break;\\n }\\n }\\n float starthitset = System.currentTimeMillis();\\n Collection<GraphChange> hittingSets = IonHittingSet.findHittingSet(possibleChanges);\\n recHitTimes.add((System.currentTimeMillis() - starthitset) / 1000.);\\n // Part 3.c - checks the newly constructed graphs from 3.b and rejects those that\\n // cycles or produce independencies known not to occur from the input PAGs or\\n // include undirectedPaths from definite nonancestors\\n for (GraphChange gc : hittingSets) {\\n boolean badhittingset = false;\\n for (Edge edge : gc.getRemoves()) {\\n Node node1 = edge.getNode1();\\n Node node2 = edge.getNode2();\\n Set<Triple> triples = new HashSet<>();\\n triples.addAll(gc.getColliders());\\n triples.addAll(gc.getNoncolliders());\\n if (triples.size() != (gc.getColliders().size() + gc.getNoncolliders().size())) {\\n badhittingset = true;\\n break;\\n }\\n for (Triple triple : triples) {\\n if (node1.equals(triple.getY())) {\\n if (node2.equals(triple.getX()) ||\\n node2.equals(triple.getZ())) {\\n badhittingset = true;\\n break;\\n }\\n }\\n if (node2.equals(triple.getY())) {\\n if (node1.equals(triple.getX()) ||\\n node1.equals(triple.getZ())) {\\n badhittingset = true;\\n break;\\n }\\n }\\n }\\n if (badhittingset) {\\n break;\\n }\\n for (NodePair pair : gc.getOrients()) {\\n if ((node1.equals(pair.getFirst()) && node2.equals(pair.getSecond())) ||\\n (node2.equals(pair.getFirst()) && node1.equals(pair.getSecond()))) {\\n badhittingset = true;\\n break;\\n }\\n }\\n if (badhittingset) {\\n break;\\n }\\n }\\n if (!badhittingset) {\\n for (NodePair pair : gc.getOrients()) {\\n for (Triple triple : gc.getNoncolliders()) {\\n if (pair.getSecond().equals(triple.getY())) {\\n if (pair.getFirst().equals(triple.getX()) &&\\n pag.getEndpoint(triple.getZ(), triple.getY()).equals(Endpoint.ARROW)) {\\n badhittingset = true;\\n break;\\n\\n }\\n if (pair.getFirst().equals(triple.getZ()) &&\\n pag.getEndpoint(triple.getX(), triple.getY()).equals(Endpoint.ARROW)) {\\n badhittingset = true;\\n break;\\n }\\n }\\n if (badhittingset) {\\n break;\\n }\\n }\\n if (badhittingset) {\\n break;\\n }\\n }\\n }\\n if (badhittingset) {\\n continue;\\n }\\n Graph changed = gc.applyTo(pag);\\n // if graph change has already been rejected move on to next graph\\n if (reject.contains(changed)) {\\n continue;\\n }\\n // if graph change has already been accepted move on to next graph\\n if (step3PagsSet.contains(changed)) {\\n continue;\\n }\\n // reject if null, predicts false independencies or has cycle\\n if (predictsFalseIndependence(associations, changed)\\n || changed.existsDirectedCycle()) {\\n reject.add(changed);\\n }\\n // makes orientations preventing definite noncolliders from becoming colliders\\n // do final orientations\\n// doFinalOrientation(changed);\\n // now add graph to queue\\n\\n// Graph p = screenForKnowledge(changed);\\n// if (p != null) step3PagsSet.add(p);\\n step3PagsSet.add(changed);\\n }\\n }\\n // exits loop if not looping over adjacencies\\n if (!adjacencySearch) {\\n break;\\n }\\n }\\n }\\n TetradLogger.getInstance().log(\\\"info\\\", \\\"Step 3: \\\" + (System.currentTimeMillis() - steps) / 1000. + \\\"s\\\");\\n Queue<Graph> step3Pags = new LinkedList<>(step3PagsSet);\\n\\n /*\\n * Step 4\\n *\\n * Finds redundant undirectedPaths and uses this information to expand the list\\n * of possible graphs\\n */\\n steps = System.currentTimeMillis();\\n Map<Edge, Boolean> necEdges;\\n Set<Graph> outputPags = new HashSet<>();\\n\\n while (!step3Pags.isEmpty()) {\\n Graph pag = step3Pags.poll();\\n necEdges = new HashMap<>();\\n // Step 4.a - if x and y are known to be unconditionally associated and there is\\n // exactly one trek between them, mark each edge on that trek as necessary and\\n // make the tiples on the trek definite noncolliders\\n // initially mark each edge as not necessary\\n for (Edge edge : pag.getEdges()) {\\n necEdges.put(edge, false);\\n }\\n // look for unconditional associations\\n for (IonIndependenceFacts fact : associations) {\\n for (List<Node> nodes : fact.getZ()) {\\n if (nodes.isEmpty()) {\\n List<List<Node>> treks = treks(pag, fact.x, fact.y);\\n if (treks.size() == 1) {\\n List<Node> trek = treks.get(0);\\n List<Triple> triples = new ArrayList<>();\\n for (int i = 1; i < trek.size(); i++) {\\n // marks each edge in trek as necessary\\n necEdges.put(pag.getEdge(trek.get(i - 1), trek.get(i)), true);\\n if (i == 1) {\\n continue;\\n }\\n // makes each triple a noncollider\\n pag.addUnderlineTriple(trek.get(i - 2), trek.get(i - 1), trek.get(i));\\n }\\n }\\n // stop looping once the empty set is found\\n break;\\n }\\n }\\n }\\n // Part 4.b - branches by generating graphs for every combination of removing\\n // redundant undirectedPaths\\n boolean elimTreks;\\n // checks to see if removing redundant undirectedPaths eliminates every trek between\\n // two variables known to be nconditionally assoicated\\n List<Graph> possRemovePags = possRemove(pag, necEdges);\\n double currentUsage = Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory();\\n if (currentUsage > maxMemory) maxMemory = currentUsage;\\n for (Graph newPag : possRemovePags) {\\n elimTreks = false;\\n // looks for unconditional associations\\n for (IonIndependenceFacts fact : associations) {\\n for (List<Node> nodes : fact.getZ()) {\\n if (nodes.isEmpty()) {\\n if (treks(newPag, fact.x, fact.y).isEmpty()) {\\n elimTreks = true;\\n }\\n // stop looping once the empty set is found\\n break;\\n }\\n }\\n }\\n // add new PAG to output unless a necessary trek has been eliminated\\n if (!elimTreks) {\\n outputPags.add(newPag);\\n }\\n }\\n }\\n outputPags = removeMoreSpecific(outputPags);\\n// outputPags = applyKnowledge(outputPags);\\n\\n TetradLogger.getInstance().log(\\\"info\\\", \\\"Step 4: \\\" + (System.currentTimeMillis() - steps) / 1000. + \\\"s\\\");\\n\\n /*\\n * Step 5\\n *\\n * Generate the Markov equivalence classes for graphs and accept only\\n * those that do not predict false d-separations\\n */\\n steps = System.currentTimeMillis();\\n Set<Graph> outputSet = new HashSet<>();\\n for (Graph pag : outputPags) {\\n Set<Triple> unshieldedPossibleColliders = new HashSet<>();\\n for (Triple triple : getPossibleTriples(pag)) {\\n if (!pag.isAdjacentTo(triple.getX(), triple.getZ())) {\\n unshieldedPossibleColliders.add(triple);\\n }\\n }\\n\\n PowerSet<Triple> pset = new PowerSet<>(unshieldedPossibleColliders);\\n for (Set<Triple> set : pset) {\\n Graph newGraph = new EdgeListGraph(pag);\\n for (Triple triple : set) {\\n newGraph.setEndpoint(triple.getX(), triple.getY(), Endpoint.ARROW);\\n newGraph.setEndpoint(triple.getZ(), triple.getY(), Endpoint.ARROW);\\n }\\n doFinalOrientation(newGraph);\\n }\\n for (Graph outputPag : finalResult) {\\n if (!predictsFalseIndependence(associations, outputPag)) {\\n Set<Triple> underlineTriples = new HashSet<>(outputPag.getUnderLines());\\n for (Triple triple : underlineTriples) {\\n outputPag.removeUnderlineTriple(triple.getX(), triple.getY(), triple.getZ());\\n }\\n outputSet.add(outputPag);\\n }\\n }\\n }\\n\\n// outputSet = applyKnowledge(outputSet);\\n outputSet = checkPaths(outputSet);\\n\\n output.addAll(outputSet);\\n TetradLogger.getInstance().log(\\\"info\\\", \\\"Step 5: \\\" + (System.currentTimeMillis() - steps) / 1000. + \\\"s\\\");\\n runtime = ((System.currentTimeMillis() - start) / 1000.);\\n logGraphs(\\\"\\\\nReturning output (\\\" + output.size() + \\\" Graphs):\\\", output);\\n double currentUsage = Runtime.getRuntime().totalMemory() - Runtime.getRuntime().freeMemory();\\n if (currentUsage > maxMemory) maxMemory = currentUsage;\\n return output;\\n }\",\n \"private void DFSUtil(graph copy,node_data n) {\\n\\t\\tn.setTag(1);\\n\\t\\tCollection<edge_data> temp = copy.getE(n.getKey());\\n\\t\\tif (temp != null) {\\n\\t\\t\\tfor (edge_data edge : temp) {\\n\\t\\t\\t\\tif (copy.getNode(edge.getDest()) != null && copy.getE(edge.getDest()) != null && copy.getNode(edge.getDest()).getTag() == 0) {\\n\\t\\t\\t\\t\\tDFSUtil(copy,copy.getNode(edge.getDest()));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.76480645","0.75557256","0.7514414","0.75062317","0.7277212","0.722608","0.71571517","0.7138194","0.70538133","0.70303774","0.70216507","0.69316167","0.6903866","0.6777672","0.6751997","0.666118","0.6642507","0.66257745","0.66136944","0.6573592","0.6553742","0.6490299","0.6486661","0.64843905","0.6421139","0.64176893","0.6415082","0.6414339","0.6409833","0.6392282","0.63917553","0.63909006","0.63859344","0.6368357","0.6365523","0.63288003","0.63187116","0.63016355","0.629122","0.626981","0.6264088","0.6243234","0.6242771","0.6225692","0.6222645","0.6218422","0.6213417","0.62085396","0.620829","0.6206026","0.620104","0.61991847","0.619887","0.61966085","0.619219","0.6186088","0.6184306","0.6177821","0.6161032","0.61573994","0.61543983","0.6148236","0.6147814","0.61474466","0.61404324","0.61388874","0.6126991","0.6126839","0.6119121","0.6112212","0.610974","0.61091924","0.6103688","0.6097381","0.609469","0.608696","0.60832524","0.6070563","0.6066946","0.6034068","0.60292995","0.6028764","0.59892863","0.598253","0.5975264","0.59737855","0.59701514","0.5964948","0.59642196","0.59608155","0.5945742","0.5942332","0.593592","0.59311056","0.5930674","0.5907694","0.5904561","0.5897388","0.5894465","0.58826244","0.5875073"],"string":"[\n \"0.76480645\",\n \"0.75557256\",\n \"0.7514414\",\n \"0.75062317\",\n \"0.7277212\",\n \"0.722608\",\n \"0.71571517\",\n \"0.7138194\",\n \"0.70538133\",\n \"0.70303774\",\n \"0.70216507\",\n \"0.69316167\",\n \"0.6903866\",\n \"0.6777672\",\n \"0.6751997\",\n \"0.666118\",\n \"0.6642507\",\n \"0.66257745\",\n \"0.66136944\",\n \"0.6573592\",\n \"0.6553742\",\n \"0.6490299\",\n \"0.6486661\",\n \"0.64843905\",\n \"0.6421139\",\n \"0.64176893\",\n \"0.6415082\",\n \"0.6414339\",\n \"0.6409833\",\n \"0.6392282\",\n \"0.63917553\",\n \"0.63909006\",\n \"0.63859344\",\n \"0.6368357\",\n \"0.6365523\",\n \"0.63288003\",\n \"0.63187116\",\n \"0.63016355\",\n \"0.629122\",\n \"0.626981\",\n \"0.6264088\",\n \"0.6243234\",\n \"0.6242771\",\n \"0.6225692\",\n \"0.6222645\",\n \"0.6218422\",\n \"0.6213417\",\n \"0.62085396\",\n \"0.620829\",\n \"0.6206026\",\n \"0.620104\",\n \"0.61991847\",\n \"0.619887\",\n \"0.61966085\",\n \"0.619219\",\n \"0.6186088\",\n \"0.6184306\",\n \"0.6177821\",\n \"0.6161032\",\n \"0.61573994\",\n \"0.61543983\",\n \"0.6148236\",\n \"0.6147814\",\n \"0.61474466\",\n \"0.61404324\",\n \"0.61388874\",\n \"0.6126991\",\n \"0.6126839\",\n \"0.6119121\",\n \"0.6112212\",\n \"0.610974\",\n \"0.61091924\",\n \"0.6103688\",\n \"0.6097381\",\n \"0.609469\",\n \"0.608696\",\n \"0.60832524\",\n \"0.6070563\",\n \"0.6066946\",\n \"0.6034068\",\n \"0.60292995\",\n \"0.6028764\",\n \"0.59892863\",\n \"0.598253\",\n \"0.5975264\",\n \"0.59737855\",\n \"0.59701514\",\n \"0.5964948\",\n \"0.59642196\",\n \"0.59608155\",\n \"0.5945742\",\n \"0.5942332\",\n \"0.593592\",\n \"0.59311056\",\n \"0.5930674\",\n \"0.5907694\",\n \"0.5904561\",\n \"0.5897388\",\n \"0.5894465\",\n \"0.58826244\",\n \"0.5875073\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":27394,"cells":{"query":{"kind":"string","value":"need a function that returns. So that some states can cancel out and thus no stackoverflow."},"document":{"kind":"string","value":"private void DepthFirstSearch(Node current){\n helperDFS( current );\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["@Override\n public Boolean call() throws Exception {\n return this.state22();\n }","protected abstract List breakOutOfStateStack();","private Object getState() {\n\treturn null;\r\n}","private static int runStateOf(int c) { return c & ~CAPACITY; }","public E pollBack();","@Override\n\tpublic void returncode(int statecode) {\n\n\t}","CalculationResult goInfinite();","@Override\r\n public FlowState call() {\r\n // TODO: We should not need? to pass the flowState because this flow is already known (reapplying same values???)\r\n FlowState flowState = getFlowState();\r\n if ( flowState == null ) {\r\n throw new FlowException(\"No flowState with id:\", getExistingFlowStateLookupKey());\r\n } else {\r\n return getFlowManagementWithCheck().continueFlowState(getExistingFlowStateLookupKey(), true, this.getInitialFlowState());\r\n }\r\n }","OperationalState operationalState();","OperationalState operationalState();","public boolean get_return(){\n return local_return;\n }","private void cancelHeavyLifting()\n {\n }","public boolean c()\r\n/* 36: */ {\r\n/* 37:51 */ return false;\r\n/* 38: */ }","State getState();","State getState();","State getState();","State getState();","void checkReturnSt (int ln) {\r\n if (!return_type.isVoid ())\r\n OzcError.needReturnSt (ln);\r\n else \r\n need_return = true;\r\n }","boolean test() {\n return false; // REPLACE WITH SOLUTION\n }","void mo15871a(StateT statet);","public void cancel() {\n/* 170 */ throw new RuntimeException(\"Stub!\");\n/* */ }","@Override\n\tpublic void stateMachineAbort() {\n\t}","@Override\n\tpublic void stateMachineAbort() {\n\n\t}","@Override\n\tpublic void stateMachineAbort() {\n\n\t}","@Override\n\tpublic void stateMachineAbort() {\n\n\t}","@Override\n\tpublic void stateMachineAbort() {\n\n\t}","Object getState();","void markReturning();","private static <TResult> TResult m832b(C0741g<TResult> gVar) {\n if (gVar.mo9481b()) {\n return gVar.mo9483d();\n }\n if (gVar.mo9482c()) {\n throw new CancellationException(\"Task is already canceled\");\n }\n throw new ExecutionException(gVar.mo9484e());\n }","@FunctionalInterface\npublic interface HasBeenCancelledFactory extends Function<WebContext, Boolean> {\n}","public void cancelMethod1(){\n return;\n\n }","static void ret() {\n\t\tcurColor = callStack[--size];\n\t}","public void returningToTrue(){\n Closure enclosingFunction = findEnclosingFunction();\n if (enclosingFunction != null){\n Closure currentClosure = this;\n while (currentClosure != enclosingFunction){\n if (!currentClosure.isReturning()){\n currentClosure.returning = true;\n }\n currentClosure = currentClosure.getParent();\n }\n enclosingFunction.returning = true;\n }\n }","StateT getState();","public boolean isLegOut()\n{\n if (jumpState == 1)\n return true;\n return false;\n}","public boolean isInterruptible() {\n/* 31 */ return true;\n/* */ }","public boolean c()\r\n/* 56: */ {\r\n/* 57: 77 */ return false;\r\n/* 58: */ }","int remains();","int getStateValue2();","private static Map popFromStack(SessionState state)\n\t{\n\t\tMap current_stack_frame = null;\n\t\tStack operations_stack = (Stack) state.getAttribute(STATE_SUSPENDED_OPERATIONS_STACK);\n\t\tif(operations_stack == null)\n\t\t{\n\t\t\toperations_stack = new Stack();\n\t\t\tstate.setAttribute(STATE_SUSPENDED_OPERATIONS_STACK, operations_stack);\n\t\t}\n\t\tif(! operations_stack.isEmpty())\n\t\t{\n\t\t\tcurrent_stack_frame = (Map) operations_stack.pop();\n\t\t\tif(operations_stack.isEmpty())\n\t\t\t{\n\t\t\t\tString canceled = (String) current_stack_frame.get(STATE_HELPER_CANCELED_BY_USER);\n\t\t\t\tif(canceled != null)\n\t\t\t\t{\n\t\t\t\t\tstate.setAttribute(STATE_HELPER_CANCELED_BY_USER, canceled);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn current_stack_frame;\n\n\t}","public void popState();","abstract public boolean RequestToExit(Object fromHere);","public void noReturnOnVoid() {\n\t\treturn;\n\t}","public void excavate();","protected int handlePrevious(int position) {\n/* 289 */ throw new RuntimeException(\"Stub!\");\n/* */ }","@SuppressWarnings(\"resource\")\n\tpublic synchronized void advance() {\n\t\t/*\n\t\t * Do not advance the state machine if it is still valid. This is a convenience to application code\n\t\t * that can now try to advance the state machine redundantly without it getting costly.\n\t\t * \n\t\t * Here we have to be careful. We cannot just read valid() flag as that would create reactive dependency\n\t\t * that would be invalidated a few lines below when the valid() flag is set to true.\n\t\t * Such immediate invalidation would force another controlling (outer) reactive computation to run immediately after the current one ends.\n\t\t * While such overhead is common in reactive code and it is usually acceptable, it can be very wasteful here in some important use cases,\n\t\t * for example in ReactiveLazy where it would double compute cost of all reactive computations that read new/changed ReactiveLazy.\n\t\t *\n\t\t * We cannot just check for non-null trigger either as that would make the check completely non-reactive.\n\t\t * The controlling (outer) computation wouldn't run again when the state is invalidated and advancement would stop forever.\n\t\t *\n\t\t * Instead of creating dependency on the full valid() flag, we will reactively depend only on trigger state.\n\t\t * The difference is that trigger state only tracks validity of the last controlled (inner) computation\n\t\t * while the valid() flag tracks all current and future state of the whole reactive state machine.\n\t\t * Trigger state can change only in one direction from not fired to fired while valid() changes both ways.\n\t\t * This reduction in the scope of the dependency is sufficient to avoid redundant reactive computations\n\t\t * while keeping the dependency wide enough to ensure the state machine appears to be fully reactive.\n\t\t * \n\t\t * Trigger itself is of course non-reactive, because it is a low-level reactive primitive.\n\t\t * So how do we depend on its state? We will read valid() flag but only after we have already set it to true.\n\t\t * This breaks the basic principle of reactive programming that dependencies are recorded before reads,\n\t\t * but it is safe here, because it is equivalent to a scenario, in which another thread advances the state machine\n\t\t * and the current thread executed shortly afterwards, reads the valid() flag (which is true), and returns without advancing.\n\t\t * \n\t\t * This solution is so efficient that a lot of code can just blindly advance all the time without ever checking valid().\n\t\t * This may be actually more performant thanks to the reduced dependency optimization.\n\t\t */\n\t\tif (trigger != null) {\n\t\t\t/*\n\t\t\t * If the trigger is non-null, then valid() is true and we can just return without advancing.\n\t\t\t * We will record dependency on valid() to ensure that the controlling (outer) computation\n\t\t\t * tries to advance the state machine again when valid() becomes false.\n\t\t\t */\n\t\t\tvalid.get();\n\t\t\treturn;\n\t\t}\n\t\tReactiveScope scope = OwnerTrace.of(new ReactiveScope())\n\t\t\t.parent(this)\n\t\t\t.target();\n\t\tif (pins != null)\n\t\t\tscope.pins(pins);\n\t\tpins = null;\n\t\ttry (CloseableScope computation = scope.enter()) {\n\t\t\tReactiveValue<T> value = ReactiveValue.capture(supplier);\n\t\t\t/*\n\t\t\t * We will be sending two invalidations to the controlling reactive computation.\n\t\t\t * We will first discourage redundant advancement by setting valid() to true.\n\t\t\t * Only then we set the output. This prevents unnecessary attempts to advance the state machine.\n\t\t\t */\n\t\t\tvalid.set(true);\n\t\t\toutput.value(value);\n\t\t}\n\t\t/*\n\t\t * As mentioned above, we will create dependency on valid() to ensure the controlling (outer) computation\n\t\t * tries to advance again when the current state is invalidated, i.e. when valid() is set to false.\n\t\t * We have to do this after setting valid() to true above to avoid immediately invalidating current computation.\n\t\t * We also have to do it before arming the trigger, because trigger could fire immediately (inline)\n\t\t * and such firing involves setting valid() to false, by which time the dependency on valid() must already exist.\n\t\t * We have to be additionally careful not to create the dependency inside the controlled (inner) computation.\n\t\t */\n\t\tvalid.get();\n\t\tif (scope.blocked())\n\t\t\tpins = scope.pins();\n\t\ttrigger = OwnerTrace\n\t\t\t.of(new ReactiveTrigger()\n\t\t\t\t.callback(this::invalidate))\n\t\t\t.parent(this)\n\t\t\t.target();\n\t\t/*\n\t\t * Arming the trigger can cause it to fire immediately.\n\t\t * We don't worry about that, because our invalidation callback is very fast and non-conflicting.\n\t\t */\n\t\ttrigger.arm(scope.versions());\n\t}","public boolean eliminateLoop(){ return false; }","int getState();","int getState();","int getState();","int getState();","int getState();","int getState();","public boolean checkExplosiveState () { return isExploding;}","@Override\n\tprotected Object run() {\n\t\treturn null;\n\t}","public State state();","public void doSomething(){\n return;\n }","void nextState();","public boolean willNotBeResurrected() {\n return state == State.FRESH || state == State.ERROR;\n }","@Override\n public TurnState getNextState() { return new Finalize(); }","@Override\n protected BDDState handleFunctionReturnEdge(\n CFunctionReturnEdge cfaEdge, CFunctionCall summaryExpr, String outerFunctionName) {\n BDDState newState = state;\n\n // set result of function equal to variable on left side\n final Partition partition = varClass.getPartitionForEdge(cfaEdge);\n\n // handle assignments like \"y = f(x);\"\n if (summaryExpr instanceof CFunctionCallAssignmentStatement) {\n final String returnVar =\n cfaEdge.getFunctionEntry().getReturnVariable().orElseThrow().getQualifiedName();\n CFunctionCallAssignmentStatement cAssignment = (CFunctionCallAssignmentStatement) summaryExpr;\n CExpression lhs = cAssignment.getLeftHandSide();\n final int size = bvComputer.getBitsize(partition, lhs.getExpressionType());\n\n // make variable (predicate) for LEFT SIDE of assignment,\n // delete variable, if it was used before, this is done with an existential operator\n final Region[] var =\n predmgr.createPredicate(\n scopeVar(lhs), lhs.getExpressionType(), cfaEdge.getSuccessor(), size, precision);\n newState = newState.forget(var);\n\n // make region (predicate) for RIGHT SIDE\n final Region[] retVar =\n predmgr.createPredicate(\n returnVar,\n summaryExpr.getFunctionCallExpression().getExpressionType(),\n cfaEdge.getSuccessor(),\n size,\n precision);\n newState = newState.addAssignment(var, retVar);\n\n // remove returnVar from state,\n // all other function-variables were removed earlier (see handleReturnStatementEdge()).\n // --> now the state does not contain any variable from scope of called function.\n if (predmgr.getTrackedVars().contains(returnVar)) {\n newState = newState.forget(predmgr.createPredicateWithoutPrecisionCheck(returnVar));\n }\n\n } else {\n assert summaryExpr instanceof CFunctionCallStatement; // no assignment, nothing to do\n }\n\n return newState;\n }","public boolean finish() {\n/* 465 */ return finish(false);\n/* */ }","public Object call() throws Exception{\n return null;\n }","public abstract MachineState getInitialState();","protected S state() {\n return state;\n }","State takeAction(State state);","public boolean isCancellable()\r\n/* 64: */ {\r\n/* 65:101 */ return this.result == null;\r\n/* 66: */ }","void cancel();","void cancel();","void cancel();","void cancel();","void cancel();","@Override\n // TODO implement call() for expert mode using minimax\n public Integer call() throws Exception {\n Integer val = 0;\n Thread.sleep(150);\n return val;\n }","S getInitialState();","public abstract boolean esComestible();","public int get_return(){\r\n return local_return;\r\n }","public boolean isVoid()\r\n/* 146: */ {\r\n/* 147:177 */ return false;\r\n/* 148: */ }","@Override\n public AbstractState getWrappedState() {\n return null;\n }","void cancelProduction();","PowerState getState();","public void onRestorePendingState() {\n }","@Override\n\tpublic void comeBackToWork() {\n\t\t\n\t}","Object completeExternalFunctionEvaluation() {\n\t\tRTObject returnedObj = null;\r\n\t\twhile (evaluationStack.size() > originalEvaluationStackHeight) {\r\n\t\t\tRTObject poppedObj = popEvaluationStack();\r\n\t\t\tif (returnedObj == null)\r\n\t\t\t\treturnedObj = poppedObj;\r\n\t\t}\r\n\r\n\t\t// Restore our own state\r\n\t\tcallStack = originalCallstack;\r\n\t\toriginalCallstack = null;\r\n\t\toriginalEvaluationStackHeight = 0;\r\n\t\t\r\n\t\t// Restore the callstack that the variablesState uses\r\n\t\tvariablesState.setCallStack(callStack);\r\n\r\n\t\t// What did we get back?\r\n\t\tif (returnedObj != null) {\r\n\t\t\tif (returnedObj instanceof Void)\r\n\t\t\t\treturn null;\r\n\r\n\t\t\t// Some kind of value, if not void\r\n\t\t\tValue<?> returnVal = null;\r\n\r\n\t\t\tif (returnedObj instanceof Value)\r\n\t\t\t\treturnVal = (Value<?>) returnedObj;\r\n\r\n\t\t\t// DivertTargets get returned as the string of components\r\n\t\t\t// (rather than a Path, which isn't public)\r\n\t\t\tif (returnVal.getValueType() == ValueType.DivertTarget) {\r\n\t\t\t\treturn returnVal.getValueObject().toString();\r\n\t\t\t}\r\n\r\n\t\t\t// Other types can just have their exact object type:\r\n\t\t\t// int, float, string. VariablePointers get returned as strings.\r\n\t\t\treturn returnVal.getValueObject();\r\n\t\t}\r\n\r\n\t\treturn null;\r\n\t}","long getStateChange();","final boolean init_stacks()\r\n{\r\n stateptr = -1;\r\n val_init();\r\n return true;\r\n}","public boolean isJumping(){\n if (jumpState == 2)\n return true;\n return false;\n\n}","void beforeState();","private static boolean isDone0(Object result)\r\n/* 74: */ {\r\n/* 75:110 */ return (result != null) && (result != UNCANCELLABLE);\r\n/* 76: */ }","public abstract boolean cancel();","@Override\n\tpublic <R> R traceExit(R result) {\n\t\treturn null;\n\t}","protected String doVerifyState() {\n\t\treturn null;\n\t}","public boolean b()\r\n {\r\n return false;\r\n }","int getStateValue1();","@Override\r\n\tpublic boolean voidIt() {\n\t\treturn false;\r\n\t}","int getStateValue();","int getStateValue();","int getStateValue();","public abstract boolean cancelable();","LabState state();","public boolean nextState() {\n\t\treturn false;\n\t}","@Override\r\n public Serializable createStaticState() {\r\n return this.m_func.createStaticState();\r\n }"],"string":"[\n \"@Override\\n public Boolean call() throws Exception {\\n return this.state22();\\n }\",\n \"protected abstract List breakOutOfStateStack();\",\n \"private Object getState() {\\n\\treturn null;\\r\\n}\",\n \"private static int runStateOf(int c) { return c & ~CAPACITY; }\",\n \"public E pollBack();\",\n \"@Override\\n\\tpublic void returncode(int statecode) {\\n\\n\\t}\",\n \"CalculationResult goInfinite();\",\n \"@Override\\r\\n public FlowState call() {\\r\\n // TODO: We should not need? to pass the flowState because this flow is already known (reapplying same values???)\\r\\n FlowState flowState = getFlowState();\\r\\n if ( flowState == null ) {\\r\\n throw new FlowException(\\\"No flowState with id:\\\", getExistingFlowStateLookupKey());\\r\\n } else {\\r\\n return getFlowManagementWithCheck().continueFlowState(getExistingFlowStateLookupKey(), true, this.getInitialFlowState());\\r\\n }\\r\\n }\",\n \"OperationalState operationalState();\",\n \"OperationalState operationalState();\",\n \"public boolean get_return(){\\n return local_return;\\n }\",\n \"private void cancelHeavyLifting()\\n {\\n }\",\n \"public boolean c()\\r\\n/* 36: */ {\\r\\n/* 37:51 */ return false;\\r\\n/* 38: */ }\",\n \"State getState();\",\n \"State getState();\",\n \"State getState();\",\n \"State getState();\",\n \"void checkReturnSt (int ln) {\\r\\n if (!return_type.isVoid ())\\r\\n OzcError.needReturnSt (ln);\\r\\n else \\r\\n need_return = true;\\r\\n }\",\n \"boolean test() {\\n return false; // REPLACE WITH SOLUTION\\n }\",\n \"void mo15871a(StateT statet);\",\n \"public void cancel() {\\n/* 170 */ throw new RuntimeException(\\\"Stub!\\\");\\n/* */ }\",\n \"@Override\\n\\tpublic void stateMachineAbort() {\\n\\t}\",\n \"@Override\\n\\tpublic void stateMachineAbort() {\\n\\n\\t}\",\n \"@Override\\n\\tpublic void stateMachineAbort() {\\n\\n\\t}\",\n \"@Override\\n\\tpublic void stateMachineAbort() {\\n\\n\\t}\",\n \"@Override\\n\\tpublic void stateMachineAbort() {\\n\\n\\t}\",\n \"Object getState();\",\n \"void markReturning();\",\n \"private static <TResult> TResult m832b(C0741g<TResult> gVar) {\\n if (gVar.mo9481b()) {\\n return gVar.mo9483d();\\n }\\n if (gVar.mo9482c()) {\\n throw new CancellationException(\\\"Task is already canceled\\\");\\n }\\n throw new ExecutionException(gVar.mo9484e());\\n }\",\n \"@FunctionalInterface\\npublic interface HasBeenCancelledFactory extends Function<WebContext, Boolean> {\\n}\",\n \"public void cancelMethod1(){\\n return;\\n\\n }\",\n \"static void ret() {\\n\\t\\tcurColor = callStack[--size];\\n\\t}\",\n \"public void returningToTrue(){\\n Closure enclosingFunction = findEnclosingFunction();\\n if (enclosingFunction != null){\\n Closure currentClosure = this;\\n while (currentClosure != enclosingFunction){\\n if (!currentClosure.isReturning()){\\n currentClosure.returning = true;\\n }\\n currentClosure = currentClosure.getParent();\\n }\\n enclosingFunction.returning = true;\\n }\\n }\",\n \"StateT getState();\",\n \"public boolean isLegOut()\\n{\\n if (jumpState == 1)\\n return true;\\n return false;\\n}\",\n \"public boolean isInterruptible() {\\n/* 31 */ return true;\\n/* */ }\",\n \"public boolean c()\\r\\n/* 56: */ {\\r\\n/* 57: 77 */ return false;\\r\\n/* 58: */ }\",\n \"int remains();\",\n \"int getStateValue2();\",\n \"private static Map popFromStack(SessionState state)\\n\\t{\\n\\t\\tMap current_stack_frame = null;\\n\\t\\tStack operations_stack = (Stack) state.getAttribute(STATE_SUSPENDED_OPERATIONS_STACK);\\n\\t\\tif(operations_stack == null)\\n\\t\\t{\\n\\t\\t\\toperations_stack = new Stack();\\n\\t\\t\\tstate.setAttribute(STATE_SUSPENDED_OPERATIONS_STACK, operations_stack);\\n\\t\\t}\\n\\t\\tif(! operations_stack.isEmpty())\\n\\t\\t{\\n\\t\\t\\tcurrent_stack_frame = (Map) operations_stack.pop();\\n\\t\\t\\tif(operations_stack.isEmpty())\\n\\t\\t\\t{\\n\\t\\t\\t\\tString canceled = (String) current_stack_frame.get(STATE_HELPER_CANCELED_BY_USER);\\n\\t\\t\\t\\tif(canceled != null)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tstate.setAttribute(STATE_HELPER_CANCELED_BY_USER, canceled);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn current_stack_frame;\\n\\n\\t}\",\n \"public void popState();\",\n \"abstract public boolean RequestToExit(Object fromHere);\",\n \"public void noReturnOnVoid() {\\n\\t\\treturn;\\n\\t}\",\n \"public void excavate();\",\n \"protected int handlePrevious(int position) {\\n/* 289 */ throw new RuntimeException(\\\"Stub!\\\");\\n/* */ }\",\n \"@SuppressWarnings(\\\"resource\\\")\\n\\tpublic synchronized void advance() {\\n\\t\\t/*\\n\\t\\t * Do not advance the state machine if it is still valid. This is a convenience to application code\\n\\t\\t * that can now try to advance the state machine redundantly without it getting costly.\\n\\t\\t * \\n\\t\\t * Here we have to be careful. We cannot just read valid() flag as that would create reactive dependency\\n\\t\\t * that would be invalidated a few lines below when the valid() flag is set to true.\\n\\t\\t * Such immediate invalidation would force another controlling (outer) reactive computation to run immediately after the current one ends.\\n\\t\\t * While such overhead is common in reactive code and it is usually acceptable, it can be very wasteful here in some important use cases,\\n\\t\\t * for example in ReactiveLazy where it would double compute cost of all reactive computations that read new/changed ReactiveLazy.\\n\\t\\t *\\n\\t\\t * We cannot just check for non-null trigger either as that would make the check completely non-reactive.\\n\\t\\t * The controlling (outer) computation wouldn't run again when the state is invalidated and advancement would stop forever.\\n\\t\\t *\\n\\t\\t * Instead of creating dependency on the full valid() flag, we will reactively depend only on trigger state.\\n\\t\\t * The difference is that trigger state only tracks validity of the last controlled (inner) computation\\n\\t\\t * while the valid() flag tracks all current and future state of the whole reactive state machine.\\n\\t\\t * Trigger state can change only in one direction from not fired to fired while valid() changes both ways.\\n\\t\\t * This reduction in the scope of the dependency is sufficient to avoid redundant reactive computations\\n\\t\\t * while keeping the dependency wide enough to ensure the state machine appears to be fully reactive.\\n\\t\\t * \\n\\t\\t * Trigger itself is of course non-reactive, because it is a low-level reactive primitive.\\n\\t\\t * So how do we depend on its state? We will read valid() flag but only after we have already set it to true.\\n\\t\\t * This breaks the basic principle of reactive programming that dependencies are recorded before reads,\\n\\t\\t * but it is safe here, because it is equivalent to a scenario, in which another thread advances the state machine\\n\\t\\t * and the current thread executed shortly afterwards, reads the valid() flag (which is true), and returns without advancing.\\n\\t\\t * \\n\\t\\t * This solution is so efficient that a lot of code can just blindly advance all the time without ever checking valid().\\n\\t\\t * This may be actually more performant thanks to the reduced dependency optimization.\\n\\t\\t */\\n\\t\\tif (trigger != null) {\\n\\t\\t\\t/*\\n\\t\\t\\t * If the trigger is non-null, then valid() is true and we can just return without advancing.\\n\\t\\t\\t * We will record dependency on valid() to ensure that the controlling (outer) computation\\n\\t\\t\\t * tries to advance the state machine again when valid() becomes false.\\n\\t\\t\\t */\\n\\t\\t\\tvalid.get();\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tReactiveScope scope = OwnerTrace.of(new ReactiveScope())\\n\\t\\t\\t.parent(this)\\n\\t\\t\\t.target();\\n\\t\\tif (pins != null)\\n\\t\\t\\tscope.pins(pins);\\n\\t\\tpins = null;\\n\\t\\ttry (CloseableScope computation = scope.enter()) {\\n\\t\\t\\tReactiveValue<T> value = ReactiveValue.capture(supplier);\\n\\t\\t\\t/*\\n\\t\\t\\t * We will be sending two invalidations to the controlling reactive computation.\\n\\t\\t\\t * We will first discourage redundant advancement by setting valid() to true.\\n\\t\\t\\t * Only then we set the output. This prevents unnecessary attempts to advance the state machine.\\n\\t\\t\\t */\\n\\t\\t\\tvalid.set(true);\\n\\t\\t\\toutput.value(value);\\n\\t\\t}\\n\\t\\t/*\\n\\t\\t * As mentioned above, we will create dependency on valid() to ensure the controlling (outer) computation\\n\\t\\t * tries to advance again when the current state is invalidated, i.e. when valid() is set to false.\\n\\t\\t * We have to do this after setting valid() to true above to avoid immediately invalidating current computation.\\n\\t\\t * We also have to do it before arming the trigger, because trigger could fire immediately (inline)\\n\\t\\t * and such firing involves setting valid() to false, by which time the dependency on valid() must already exist.\\n\\t\\t * We have to be additionally careful not to create the dependency inside the controlled (inner) computation.\\n\\t\\t */\\n\\t\\tvalid.get();\\n\\t\\tif (scope.blocked())\\n\\t\\t\\tpins = scope.pins();\\n\\t\\ttrigger = OwnerTrace\\n\\t\\t\\t.of(new ReactiveTrigger()\\n\\t\\t\\t\\t.callback(this::invalidate))\\n\\t\\t\\t.parent(this)\\n\\t\\t\\t.target();\\n\\t\\t/*\\n\\t\\t * Arming the trigger can cause it to fire immediately.\\n\\t\\t * We don't worry about that, because our invalidation callback is very fast and non-conflicting.\\n\\t\\t */\\n\\t\\ttrigger.arm(scope.versions());\\n\\t}\",\n \"public boolean eliminateLoop(){ return false; }\",\n \"int getState();\",\n \"int getState();\",\n \"int getState();\",\n \"int getState();\",\n \"int getState();\",\n \"int getState();\",\n \"public boolean checkExplosiveState () { return isExploding;}\",\n \"@Override\\n\\tprotected Object run() {\\n\\t\\treturn null;\\n\\t}\",\n \"public State state();\",\n \"public void doSomething(){\\n return;\\n }\",\n \"void nextState();\",\n \"public boolean willNotBeResurrected() {\\n return state == State.FRESH || state == State.ERROR;\\n }\",\n \"@Override\\n public TurnState getNextState() { return new Finalize(); }\",\n \"@Override\\n protected BDDState handleFunctionReturnEdge(\\n CFunctionReturnEdge cfaEdge, CFunctionCall summaryExpr, String outerFunctionName) {\\n BDDState newState = state;\\n\\n // set result of function equal to variable on left side\\n final Partition partition = varClass.getPartitionForEdge(cfaEdge);\\n\\n // handle assignments like \\\"y = f(x);\\\"\\n if (summaryExpr instanceof CFunctionCallAssignmentStatement) {\\n final String returnVar =\\n cfaEdge.getFunctionEntry().getReturnVariable().orElseThrow().getQualifiedName();\\n CFunctionCallAssignmentStatement cAssignment = (CFunctionCallAssignmentStatement) summaryExpr;\\n CExpression lhs = cAssignment.getLeftHandSide();\\n final int size = bvComputer.getBitsize(partition, lhs.getExpressionType());\\n\\n // make variable (predicate) for LEFT SIDE of assignment,\\n // delete variable, if it was used before, this is done with an existential operator\\n final Region[] var =\\n predmgr.createPredicate(\\n scopeVar(lhs), lhs.getExpressionType(), cfaEdge.getSuccessor(), size, precision);\\n newState = newState.forget(var);\\n\\n // make region (predicate) for RIGHT SIDE\\n final Region[] retVar =\\n predmgr.createPredicate(\\n returnVar,\\n summaryExpr.getFunctionCallExpression().getExpressionType(),\\n cfaEdge.getSuccessor(),\\n size,\\n precision);\\n newState = newState.addAssignment(var, retVar);\\n\\n // remove returnVar from state,\\n // all other function-variables were removed earlier (see handleReturnStatementEdge()).\\n // --> now the state does not contain any variable from scope of called function.\\n if (predmgr.getTrackedVars().contains(returnVar)) {\\n newState = newState.forget(predmgr.createPredicateWithoutPrecisionCheck(returnVar));\\n }\\n\\n } else {\\n assert summaryExpr instanceof CFunctionCallStatement; // no assignment, nothing to do\\n }\\n\\n return newState;\\n }\",\n \"public boolean finish() {\\n/* 465 */ return finish(false);\\n/* */ }\",\n \"public Object call() throws Exception{\\n return null;\\n }\",\n \"public abstract MachineState getInitialState();\",\n \"protected S state() {\\n return state;\\n }\",\n \"State takeAction(State state);\",\n \"public boolean isCancellable()\\r\\n/* 64: */ {\\r\\n/* 65:101 */ return this.result == null;\\r\\n/* 66: */ }\",\n \"void cancel();\",\n \"void cancel();\",\n \"void cancel();\",\n \"void cancel();\",\n \"void cancel();\",\n \"@Override\\n // TODO implement call() for expert mode using minimax\\n public Integer call() throws Exception {\\n Integer val = 0;\\n Thread.sleep(150);\\n return val;\\n }\",\n \"S getInitialState();\",\n \"public abstract boolean esComestible();\",\n \"public int get_return(){\\r\\n return local_return;\\r\\n }\",\n \"public boolean isVoid()\\r\\n/* 146: */ {\\r\\n/* 147:177 */ return false;\\r\\n/* 148: */ }\",\n \"@Override\\n public AbstractState getWrappedState() {\\n return null;\\n }\",\n \"void cancelProduction();\",\n \"PowerState getState();\",\n \"public void onRestorePendingState() {\\n }\",\n \"@Override\\n\\tpublic void comeBackToWork() {\\n\\t\\t\\n\\t}\",\n \"Object completeExternalFunctionEvaluation() {\\n\\t\\tRTObject returnedObj = null;\\r\\n\\t\\twhile (evaluationStack.size() > originalEvaluationStackHeight) {\\r\\n\\t\\t\\tRTObject poppedObj = popEvaluationStack();\\r\\n\\t\\t\\tif (returnedObj == null)\\r\\n\\t\\t\\t\\treturnedObj = poppedObj;\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\t// Restore our own state\\r\\n\\t\\tcallStack = originalCallstack;\\r\\n\\t\\toriginalCallstack = null;\\r\\n\\t\\toriginalEvaluationStackHeight = 0;\\r\\n\\t\\t\\r\\n\\t\\t// Restore the callstack that the variablesState uses\\r\\n\\t\\tvariablesState.setCallStack(callStack);\\r\\n\\r\\n\\t\\t// What did we get back?\\r\\n\\t\\tif (returnedObj != null) {\\r\\n\\t\\t\\tif (returnedObj instanceof Void)\\r\\n\\t\\t\\t\\treturn null;\\r\\n\\r\\n\\t\\t\\t// Some kind of value, if not void\\r\\n\\t\\t\\tValue<?> returnVal = null;\\r\\n\\r\\n\\t\\t\\tif (returnedObj instanceof Value)\\r\\n\\t\\t\\t\\treturnVal = (Value<?>) returnedObj;\\r\\n\\r\\n\\t\\t\\t// DivertTargets get returned as the string of components\\r\\n\\t\\t\\t// (rather than a Path, which isn't public)\\r\\n\\t\\t\\tif (returnVal.getValueType() == ValueType.DivertTarget) {\\r\\n\\t\\t\\t\\treturn returnVal.getValueObject().toString();\\r\\n\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t// Other types can just have their exact object type:\\r\\n\\t\\t\\t// int, float, string. VariablePointers get returned as strings.\\r\\n\\t\\t\\treturn returnVal.getValueObject();\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\treturn null;\\r\\n\\t}\",\n \"long getStateChange();\",\n \"final boolean init_stacks()\\r\\n{\\r\\n stateptr = -1;\\r\\n val_init();\\r\\n return true;\\r\\n}\",\n \"public boolean isJumping(){\\n if (jumpState == 2)\\n return true;\\n return false;\\n\\n}\",\n \"void beforeState();\",\n \"private static boolean isDone0(Object result)\\r\\n/* 74: */ {\\r\\n/* 75:110 */ return (result != null) && (result != UNCANCELLABLE);\\r\\n/* 76: */ }\",\n \"public abstract boolean cancel();\",\n \"@Override\\n\\tpublic <R> R traceExit(R result) {\\n\\t\\treturn null;\\n\\t}\",\n \"protected String doVerifyState() {\\n\\t\\treturn null;\\n\\t}\",\n \"public boolean b()\\r\\n {\\r\\n return false;\\r\\n }\",\n \"int getStateValue1();\",\n \"@Override\\r\\n\\tpublic boolean voidIt() {\\n\\t\\treturn false;\\r\\n\\t}\",\n \"int getStateValue();\",\n \"int getStateValue();\",\n \"int getStateValue();\",\n \"public abstract boolean cancelable();\",\n \"LabState state();\",\n \"public boolean nextState() {\\n\\t\\treturn false;\\n\\t}\",\n \"@Override\\r\\n public Serializable createStaticState() {\\r\\n return this.m_func.createStaticState();\\r\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6374901","0.6343056","0.6179897","0.59843194","0.5812559","0.5794001","0.57540935","0.5715684","0.57061565","0.57061565","0.5623487","0.5617053","0.5574859","0.5499765","0.5499765","0.5499765","0.5499765","0.548147","0.5471886","0.5469918","0.5456608","0.5456435","0.5452493","0.5452493","0.5452493","0.5452493","0.5426839","0.54211867","0.5417564","0.54173183","0.54099387","0.54043025","0.53974193","0.5385345","0.53843915","0.5383661","0.53828746","0.5382659","0.53611183","0.5358387","0.53503025","0.5339883","0.5330812","0.5327506","0.5327442","0.5327405","0.532634","0.53196543","0.53196543","0.53196543","0.53196543","0.53196543","0.53196543","0.53192544","0.5316764","0.5316175","0.53070676","0.5300255","0.52991897","0.5258898","0.52541596","0.5240589","0.5235181","0.52327085","0.52290654","0.5223655","0.52172345","0.52150244","0.52150244","0.52150244","0.52150244","0.52150244","0.5213765","0.52117455","0.5200029","0.5195332","0.5195095","0.51913697","0.518827","0.5186323","0.5180747","0.5179844","0.5177969","0.5176007","0.5166894","0.5157766","0.51562643","0.5155228","0.5146983","0.5144682","0.5134074","0.5132542","0.5127287","0.51227856","0.5122682","0.5122682","0.5122682","0.51208115","0.5117033","0.5115688","0.5113211"],"string":"[\n \"0.6374901\",\n \"0.6343056\",\n \"0.6179897\",\n \"0.59843194\",\n \"0.5812559\",\n \"0.5794001\",\n \"0.57540935\",\n \"0.5715684\",\n \"0.57061565\",\n \"0.57061565\",\n \"0.5623487\",\n \"0.5617053\",\n \"0.5574859\",\n \"0.5499765\",\n \"0.5499765\",\n \"0.5499765\",\n \"0.5499765\",\n \"0.548147\",\n \"0.5471886\",\n \"0.5469918\",\n \"0.5456608\",\n \"0.5456435\",\n \"0.5452493\",\n \"0.5452493\",\n \"0.5452493\",\n \"0.5452493\",\n \"0.5426839\",\n \"0.54211867\",\n \"0.5417564\",\n \"0.54173183\",\n \"0.54099387\",\n \"0.54043025\",\n \"0.53974193\",\n \"0.5385345\",\n \"0.53843915\",\n \"0.5383661\",\n \"0.53828746\",\n \"0.5382659\",\n \"0.53611183\",\n \"0.5358387\",\n \"0.53503025\",\n \"0.5339883\",\n \"0.5330812\",\n \"0.5327506\",\n \"0.5327442\",\n \"0.5327405\",\n \"0.532634\",\n \"0.53196543\",\n \"0.53196543\",\n \"0.53196543\",\n \"0.53196543\",\n \"0.53196543\",\n \"0.53196543\",\n \"0.53192544\",\n \"0.5316764\",\n \"0.5316175\",\n \"0.53070676\",\n \"0.5300255\",\n \"0.52991897\",\n \"0.5258898\",\n \"0.52541596\",\n \"0.5240589\",\n \"0.5235181\",\n \"0.52327085\",\n \"0.52290654\",\n \"0.5223655\",\n \"0.52172345\",\n \"0.52150244\",\n \"0.52150244\",\n \"0.52150244\",\n \"0.52150244\",\n \"0.52150244\",\n \"0.5213765\",\n \"0.52117455\",\n \"0.5200029\",\n \"0.5195332\",\n \"0.5195095\",\n \"0.51913697\",\n \"0.518827\",\n \"0.5186323\",\n \"0.5180747\",\n \"0.5179844\",\n \"0.5177969\",\n \"0.5176007\",\n \"0.5166894\",\n \"0.5157766\",\n \"0.51562643\",\n \"0.5155228\",\n \"0.5146983\",\n \"0.5144682\",\n \"0.5134074\",\n \"0.5132542\",\n \"0.5127287\",\n \"0.51227856\",\n \"0.5122682\",\n \"0.5122682\",\n \"0.5122682\",\n \"0.51208115\",\n \"0.5117033\",\n \"0.5115688\",\n \"0.5113211\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":27395,"cells":{"query":{"kind":"string","value":"sets the heuristic of the node passed."},"document":{"kind":"string","value":"private void heuristicSetter(Node node){\n int goalNodeFirstDigit = Integer.parseInt(goalNode.getDigit().getFirst_digit());\n int goalNodeSecondDigit = Integer.parseInt(goalNode.getDigit().getSecond_digit());\n int goalNodeThirdDigit = Integer.parseInt(goalNode.getDigit().getThird_digit());\n\n int nodeFirstDigit = Integer.parseInt(node.getDigit().getFirst_digit());\n int nodeSecondDigit = Integer.parseInt(node.getDigit().getSecond_digit());\n int nodeThirdDigit = Integer.parseInt(node.getDigit().getThird_digit());\n\n int heuristic = Math.abs(goalNodeFirstDigit - nodeFirstDigit)+\n Math.abs(goalNodeSecondDigit - nodeSecondDigit)+\n Math.abs(goalNodeThirdDigit - nodeThirdDigit);\n\n node.setHeuristic(heuristic);\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["public void setHeuristic(int heuristic) {\n\t\tthis.heuristic = heuristic;\n\t}","public void setAStarHeuristic(AStarHeuristic heuristic)\n\t{\n\t\t_estimator = heuristic;\n\t}","public void setHeuristic(int h) {\n\t\t\tthis.heuristique = h;\n\t\t}","public void setHeuristics(Heuristic h,Heuristic totalFunction){\n\t\t_h = h;\n\t\t_totalFunction = totalFunction;\n\t}","void setNode(String path, Node node)\n throws ProcessingException;","public void setH(Node destination){\n\t\t\n\t\th=calculateH(destination);\n\t}","public Node(Coordinate coordinate, int heuristic) {\n\t\tthis.coordinate = coordinate;\n\t\tthis.heuristic = heuristic;\n\t\tthis.next = null;\n\t}","@PortedFrom(file = \"Taxonomy.h\", name = \"setVisited\")\n public void setVisited(TaxonomyVertex node) {\n node.setChecked(visitedLabel);\n }","void setNode(int nodeId, double lat, double lon);","public abstract void setNodes();","private void setNode(DefaultMutableTreeNode node){\n\t\t\n\t\tthis.node = node;\n\t\t\n\t}","void setNode(int nodeId, double lat, double lon, double ele);","public void changingNeighbor() {\n }","public boolean setHeauristics(String s) {\n if (s.equals(\"error\")) {\n JOptionPane.showMessageDialog(this, \"Select heuristic!\", \"error\", JOptionPane.ERROR_MESSAGE);\n return false;\n }\n Square finish = getStartOrFinish('f');\n Vertex finishVertex = new Vertex(finish.getXcoor(), finish.getYcoor());\n finish.setV(finishVertex);\n for (Square[] square : squares) {\n for (Square square1 : square) {\n if (square1 != finish) {\n square1.setV(new Vertex(square1.getXcoor(), square1.getYcoor(), s, finishVertex));\n }\n }\n }\n return true;\n }","public void setNeighbor(Directions dir, Field neighbor){\n neighbors[dir.ordinal()] = neighbor;\n }","public void setCorrespondingNode(MinesNode node) {\r\n\t\tcorrespondingNode = node;\r\n\t}","private final void setShortestDistance(_Node node, int distance)\r\n {\r\n unsettledNodes.remove(node);\r\n shortestDistances.put(node, distance);\r\n\t\tunsettledNodes.add(node); \r\n }","void setMaze(IMaze maze);","public void sethVal(Node goal, int heuristic){\n switch (heuristic){\n case 0: //Euclidean distance\n case 4:\n System.out.println(\"Euclidean distance\");\n euclidean(goal, heuristic);\n break;\n case 1: //Manhattan\n System.out.println(\"Manhattan distance\");\n manhattan(goal);\n break;\n case 2:\n case 3:\n diagonal(goal, heuristic);\n break;\n }\n }","public void setNode(ResidentNode node) {\r\n\t\tthis.node = node;\r\n//\t\tif (this.node != null && this.node.getMFrag() != null) {\r\n//\t\t\tthis.mebn = this.node.getMFrag().getMultiEntityBayesianNetwork();\r\n//\t\t}\r\n\t}","public void setGT(TreeNode node)\r\n\t\t{\r\n\t\t\tthis.gThan = node;\r\n\t\t}","void setBestIncoming(E edge);","public Node setTopNode(Node node);","public boolean setWeightsAndHeuristics(String s) {\n if (s.equals(\"error\")) {\n JOptionPane.showMessageDialog(this, \"Select heuristic!\", \"error\", JOptionPane.ERROR_MESSAGE);\n return false;\n }\n Square finish = getStartOrFinish('f');\n Vertex finishVertex = new Vertex(finish.getXcoor(), finish.getYcoor(), 0, s, finish.getV());\n finish.setV(finishVertex);\n for (Square[] square : squares) {\n for (Square q : square) {\n int i = 1;\n try {\n i = Integer.parseInt(q.getText());\n } catch (NumberFormatException e) {\n }\n if (q != finish) {\n q.setV(new Vertex(q.getXcoor(), q.getYcoor(), i, s, finishVertex));\n }\n }\n }\n return true;\n }","public void reset()\n {\n reset(this.map, this.heuristic, this.neighborSelector);\n }","public void setFirstNode(byte[] hash)\n {\n if (!this.isInitialized)\n {\n this.initialize();\n }\n this.firstNode = hash;\n this.firstNodeHeight = this.maxHeight;\n this.isFinished = true;\n }","public void setGraphicsNode(GraphicsNode node) {\n/* 94 */ if (node == null) {\n/* 95 */ throw new IllegalArgumentException();\n/* */ }\n/* */ \n/* 98 */ this.node = node;\n/* */ }","protected abstract void setTile( int tile, int x, int y );","private void astarSetup(AStarNode end){\n\tfor(AStarNode node : getNodes()){\n node.setVisited(false);\n node.setFound(false);\n node.updateDist(Float.POSITIVE_INFINITY);\n\t}\n }","public synchronized void setNode(String path, Node node)\n throws ProcessingException {\n if ( path == null || path.equals(\"/\")) {\n data = DOMUtil.createDocument();\n data.appendChild(data.createElementNS(null, \"context\"));\n data.getFirstChild().appendChild(data.importNode(node, true));\n } else {\n path = this.createPath(path); \n Node removeNode = DOMUtil.selectSingleNode(data, path, this.xpathProcessor);\n removeNode.getParentNode().replaceChild(data.importNode(node, true), removeNode);\n }\n }","public void setGoal(Point point) {\n mGoal = point;\n }","public void setG(Node parent, int moveCost){\n\t\tg=calculateG(parent, moveCost);\n\t}","public Heuristic() {\n this(HeuristicUtils.defaultValues);\n }","protected void setFitness(float fit)\t{\tfitness = fit;\t\t}","void setValueOfNode(String path, String value)\n throws ProcessingException;","@AbstractCustomGlobal.GlobalMethod(menuText=\"Set Threshold Probability\")\n public void setThreshold() {\n if(Tools.getGlobalTime()!=0){\n JOptionPane.showMessageDialog(null, \"You can change this probability only when the simulation start\",\"Alert\", JOptionPane.INFORMATION_MESSAGE);\n return;\n }\n String answer = JOptionPane.showInputDialog(null, \"Set the probability that a node can be selected to run.\");\n // Show an information message\n try{\n double k = Double.parseDouble(answer);\n Iterator<Node> it = Tools.getNodeList().iterator();\n while(it.hasNext()){\n Node n = it.next();\n if(n.getClass() == MSNode.class){\n MSNode n1 = (MSNode)n;\n n1.setThresholdProbability(k);\n }\n if(n.getClass() == MS2Node.class){\n MS2Node n1 = (MS2Node)n;\n n1.setThresholdProbability(k);\n }\n }\n JOptionPane.showMessageDialog(null, \"Well done you have set this value:\"+k,\"Notice\", JOptionPane.INFORMATION_MESSAGE);\n }catch(NumberFormatException e){\n JOptionPane.showMessageDialog(null, \"You must insert a valid double \", \"Alert\", JOptionPane.INFORMATION_MESSAGE);\n }\n }","public void initialize() {\n for (Location apu : this.locations) {\n Node next = new Node(apu.toString());\n this.cells.add(next);\n }\n \n for (Node helper : this.cells) {\n Location next = (Location)this.locations.searchWithString(helper.toString()).getOlio();\n LinkedList<Target> targets = next.getTargets();\n for (Target finder : targets) {\n Node added = this.path.search(finder.getName());\n added.setCoords(finder.getX(), finder.getY());\n helper.addEdge(new Edge(added, finder.getDistance()));\n }\n }\n \n this.startCell = this.path.search(this.source);\n this.goalCell = this.path.search(this.destination);\n \n /**\n * Kun lähtö ja maali on asetettu, voidaan laskea jokaiselle solmulle arvio etäisyydestä maaliin.\n */\n this.setHeuristics();\n }","public void setNodeA(int x){\n this.nodeA = x;\n }","public abstract void setSelectedNode(String n);","public void setToOriginals(){\n\t\t//set all occupied nodes as empty\n\t\tif(nodeStatus == Status.occupied){\n\t\t\tsetAsEmpty();\n\t\t}\n\t\t//if the node had a unit end on it, reset that value\n\t\tif(ended == true){\n\t\t\tended=false;\n\t\t}\n\t\tf=0;\n\t\tg=0;\n\t\th=0;\n\t}","public void makeSet(T e){\n\t\tnodes.put(e, new Node<T>(e));\r\n\t}","public void setNode(String node)\n {\n this.node = node;\n }","public void setp(Node n) {\n\t\tp = n;\n\t}","public void setEdge(int start, int target){\n\t\tthis.graph.elementAt(start).insert(target);\n\t}","public void setHijoIzq (nodeTree pHIzq){\n this._hIzq=pHIzq;\n }","public void testSetGoalLocation() {\n test = new Location(9, 9);\n assertEquals(test, maze1.getGoalLocation());\n \n test = new Location(1, 1);\n maze1.setGoalLocation(test);\n assertEquals(test, maze1.getGoalLocation());\n \n test = new Location(2, 2);\n maze1.setCell(test, MazeCell.WALL);\n maze1.setGoalLocation(test);\n assertEquals(test, maze1.getGoalLocation());\n \n \n }","void setFirst(Node node) {\n this.first = node;\n }","public final void setFirst(Node n) {\n set(n);\n }","public void setCurrentNode(int node) {\n\t\tthis.currentNode = node;\n\t}","void setLowNode(Node n){\n low = n;\n }","public void setNode_1(String node_1);","@Override\n\tpublic void setNodeInfo(String path, Object obj) {\n\t\treentrantReadWriteLock.readLock().lock();\n\t\ttry {\n\t\t\tzookeeper.setData(path, SomeUtil.getByte(obj),\n\t\t\t\t\t-1);\n\t\t} catch (Exception e) {\n\t\t\tlog.error(\"更新跟节点数据异常！\", e);\n\t\t} finally {\n\t\t\treentrantReadWriteLock.readLock().unlock();\n\t\t}\n\t}","public void setTreeSearch(Player tree){\n t = tree;\n\n // e = new EvaluationFunction1(t);\n }","public void setGoal(int sx, int sy) {\n mGoal = new Point(sx, sy);\n }","private void _setPoint(int index, DataPoint point) {\n ntree.set(index, point);\n ensureDistances();\n }","@Override\n public void set(int i, Node<T> e)\n {\n super.set(i, e);\n if(i == 0) \n {\n lastNode.setNext(firstNode);\n updateFirstNode();\n }\n else if(i == size - 1) lastNode = e;\n }","public void setHijoDer (nodeTree pHDer){\n this._hDer=pHDer;\n }","public abstract void setPoint(Point p);","public void setNode(String node) {\n this.node = node;\n }","private void setCellVisited(Cell cell) {\n\n\t\tif (!isIn(cell))\n\t\t\treturn;\n\n\t\tint r = cell.r;\n\t\tint c = cell.c;\n\t\tif (maze.type == HEX) {\n\t\t\tc = c - (r + 1) / 2;\n\t\t}\n\t\ttry {\n\t\t\tvisited[r][c] = true;\n\t\t} catch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}","public void setNeighborSelector(NeighborSelector neighborSelector)\n {\n this.neighborSelector = neighborSelector;\n }","public KadNode setNode(Node node) {\r\n\t\tthis.node = node;\r\n\t\treturn this;\r\n\t}","public void setNode_5(String node_5);","public void setPathway(PathwayHolder p)\r\n\t{\n\t}","void setCost(double cost);","@Override\r\n public void execute() {\r\n if (newSource != null) {\r\n edge.setSource(newSource);\r\n } else if (newTarget != null) {\r\n edge.setTarget(newTarget);\r\n }\r\n }","public void setHomeScore(int h);","void setRoadway(org.landxml.schema.landXML11.RoadwayDocument.Roadway roadway);","public abstract Piece setLocation(int row, int column);","public void settInn(T element){\n Node temp = new Node(element);\n temp.neste = hode.neste;\n temp.neste.forrige = temp;\n temp.forrige = hode;\n hode.neste = temp;\n elementer++;\n\n\n }","public abstract void setInternal(int head, int ct, int t, int arm, int leg);","public void setPath(Path inputPath) {\n path = inputPath;\n node = path.getNodes().getFirst();\n }","public void setLink( IntNode _node ) {\r\n\t\t\tlink = _node;\r\n\t\t}","public void setVisited()\n {\n visited = true;\n }","public void setNewGraph() {\n\tresetHints();\r\n Random random = new Random();\r\n if (graphMode == 1) {\r\n if (selectedSize == 1) {\r\n currentGraph = chromaticManager.calculate(random.nextInt(myInformation.smallGraph) + 1, -1);\r\n }\r\n if (selectedSize == 2) {\r\n currentGraph = chromaticManager.calculate(random.nextInt(myInformation.middleGraph - myInformation.smallGraph) + myInformation.smallGraph + 1, -1);\r\n }\r\n if (selectedSize == 3) {\r\n currentGraph = chromaticManager.calculate(random.nextInt(myInformation.bigGraph - myInformation.middleGraph) + myInformation.middleGraph + 1, -1);\r\n }\r\n }\r\n if (graphMode == 2) {\r\n currentGraph = chromaticManager.calculate(myGraph);\r\n }\r\n if (graphMode == 3) {\r\n try {\r\n stackPane.getChildren().removeAll(textFieldHBox, backPane);\r\n myVertices = Integer.parseInt(textFieldVertices.getText());\r\n myEdges = Integer.parseInt(textFieldEdges.getText());\r\n currentGraph = chromaticManager.calculate(myVertices, myEdges);\r\n setDisplay(currentGraph);\r\n } catch (NumberFormatException e) {\r\n\r\n }\r\n }\r\n threadPoolExecutor.execute(() -> {\r\n NewForce newForce = new NewForce();\r\n currentGraph.setCNumer(newForce.doNewForce(currentGraph,currentGraph.getUpperBound(),currentGraph.getLowerBound()));\r\n });\r\n }","public void setPriorNode(Node<T> prior) {\n\t\t\titsPrior = prior;\n }","public void setAsStartingPoint() {\n\t\tnodeStatus = Status.occupied;\n\t}","void setLeader(Genome leader);","public void setEdge(Student curr, Student neighbor, Integer price) {\n curr.setNeighborAndPrice(neighbor, price);\n }","void setFitnessScore(double score){\n fitnessScore = score;\n }","public void setVisited(int v) {\n visited.set(v, true);\n nodeEnum.add(v);\n }","public void setEdgeCost(int from, int to, double newCost) {\n //make sure the nodes given are valid\n assert (from < nodeVector.size()) && (to < nodeVector.size()) :\n \"<SparseGraph::SetEdgeCost>: invalid index\";\n\n //visit each neighbour and erase any edges leading to this node\n ListIterator<edge_type> it = edgeListVector.get(from).listIterator();\n while (it.hasNext()) {\n edge_type curEdge = it.next();\n if (curEdge.getTo() == to) {\n curEdge.setCost(newCost);\n break;\n }\n }\n }","double setCost(double cost);","public void setLT(TreeNode node)\r\n\t\t{\r\n\t\t\tthis.lThan = node;\r\n\t\t}","private void setNeighbors() {\n\t\tfor (int i = 0; i < getNumRows(); i++) {\n\t\t\tfor (int j = 0; j < getNumCols(); j++) {\n\t\t\t\tCell c = getCurrentGrid()[i][j];\n\t\t\t\tsetNeighborsForCell(c);\n\t\t\t}\n\t\t}\n\t}","public void setFitness(int newFitness) {\n fitness = newFitness;\n }","void setRoute(Shape route);","public void setTreeNode(TreeNode treeNode) {\n this.treeNode = treeNode;\n }","public void setNodeVistied(boolean nodeVisit){\r\n\t \tthis.nodeVisited = nodeVisit;\r\n\t }","public void setFirst(Node first)\n {\n this.first = first;\n }","public void setParent(IAVLNode node);","public void setParent(IAVLNode node);","private void setHighScore(int hs) {\n setStat(hs, highScore);\n }","public void setProblem(AbstractSearchProblem<S> p) {\n problem = p;\n }","public void setX(int node, int x) {\n if (x != xs[node])\n invalid[node] = true;\n xs[node] = x;\n }","void setTile(Tile tile) {\n _tile = tile;\n }","public void setAdj(Tile adjTile, int sideIndex){\r\n adjTiles[sideIndex] = adjTile;\r\n }","public void setVisited(final Profile profile){\n\t\tpartnerboerseVerwaltung.visit(profile, new AsyncCallback<Void>() {\n\t\t\t@Override\n\t\t\tpublic void onFailure(Throwable caught) {\n\t\t\t}\n\t\t\t@Override\n\t\t\tpublic void onSuccess(Void result) {\n\t\t\t}\n\t\t});\n\t}","public void setVisited(Boolean b){\n visited = b;\n }","public void setDest(Point dest){\n System.out.println(\"hit\");\n this.dest = dest;\n }"],"string":"[\n \"public void setHeuristic(int heuristic) {\\n\\t\\tthis.heuristic = heuristic;\\n\\t}\",\n \"public void setAStarHeuristic(AStarHeuristic heuristic)\\n\\t{\\n\\t\\t_estimator = heuristic;\\n\\t}\",\n \"public void setHeuristic(int h) {\\n\\t\\t\\tthis.heuristique = h;\\n\\t\\t}\",\n \"public void setHeuristics(Heuristic h,Heuristic totalFunction){\\n\\t\\t_h = h;\\n\\t\\t_totalFunction = totalFunction;\\n\\t}\",\n \"void setNode(String path, Node node)\\n throws ProcessingException;\",\n \"public void setH(Node destination){\\n\\t\\t\\n\\t\\th=calculateH(destination);\\n\\t}\",\n \"public Node(Coordinate coordinate, int heuristic) {\\n\\t\\tthis.coordinate = coordinate;\\n\\t\\tthis.heuristic = heuristic;\\n\\t\\tthis.next = null;\\n\\t}\",\n \"@PortedFrom(file = \\\"Taxonomy.h\\\", name = \\\"setVisited\\\")\\n public void setVisited(TaxonomyVertex node) {\\n node.setChecked(visitedLabel);\\n }\",\n \"void setNode(int nodeId, double lat, double lon);\",\n \"public abstract void setNodes();\",\n \"private void setNode(DefaultMutableTreeNode node){\\n\\t\\t\\n\\t\\tthis.node = node;\\n\\t\\t\\n\\t}\",\n \"void setNode(int nodeId, double lat, double lon, double ele);\",\n \"public void changingNeighbor() {\\n }\",\n \"public boolean setHeauristics(String s) {\\n if (s.equals(\\\"error\\\")) {\\n JOptionPane.showMessageDialog(this, \\\"Select heuristic!\\\", \\\"error\\\", JOptionPane.ERROR_MESSAGE);\\n return false;\\n }\\n Square finish = getStartOrFinish('f');\\n Vertex finishVertex = new Vertex(finish.getXcoor(), finish.getYcoor());\\n finish.setV(finishVertex);\\n for (Square[] square : squares) {\\n for (Square square1 : square) {\\n if (square1 != finish) {\\n square1.setV(new Vertex(square1.getXcoor(), square1.getYcoor(), s, finishVertex));\\n }\\n }\\n }\\n return true;\\n }\",\n \"public void setNeighbor(Directions dir, Field neighbor){\\n neighbors[dir.ordinal()] = neighbor;\\n }\",\n \"public void setCorrespondingNode(MinesNode node) {\\r\\n\\t\\tcorrespondingNode = node;\\r\\n\\t}\",\n \"private final void setShortestDistance(_Node node, int distance)\\r\\n {\\r\\n unsettledNodes.remove(node);\\r\\n shortestDistances.put(node, distance);\\r\\n\\t\\tunsettledNodes.add(node); \\r\\n }\",\n \"void setMaze(IMaze maze);\",\n \"public void sethVal(Node goal, int heuristic){\\n switch (heuristic){\\n case 0: //Euclidean distance\\n case 4:\\n System.out.println(\\\"Euclidean distance\\\");\\n euclidean(goal, heuristic);\\n break;\\n case 1: //Manhattan\\n System.out.println(\\\"Manhattan distance\\\");\\n manhattan(goal);\\n break;\\n case 2:\\n case 3:\\n diagonal(goal, heuristic);\\n break;\\n }\\n }\",\n \"public void setNode(ResidentNode node) {\\r\\n\\t\\tthis.node = node;\\r\\n//\\t\\tif (this.node != null && this.node.getMFrag() != null) {\\r\\n//\\t\\t\\tthis.mebn = this.node.getMFrag().getMultiEntityBayesianNetwork();\\r\\n//\\t\\t}\\r\\n\\t}\",\n \"public void setGT(TreeNode node)\\r\\n\\t\\t{\\r\\n\\t\\t\\tthis.gThan = node;\\r\\n\\t\\t}\",\n \"void setBestIncoming(E edge);\",\n \"public Node setTopNode(Node node);\",\n \"public boolean setWeightsAndHeuristics(String s) {\\n if (s.equals(\\\"error\\\")) {\\n JOptionPane.showMessageDialog(this, \\\"Select heuristic!\\\", \\\"error\\\", JOptionPane.ERROR_MESSAGE);\\n return false;\\n }\\n Square finish = getStartOrFinish('f');\\n Vertex finishVertex = new Vertex(finish.getXcoor(), finish.getYcoor(), 0, s, finish.getV());\\n finish.setV(finishVertex);\\n for (Square[] square : squares) {\\n for (Square q : square) {\\n int i = 1;\\n try {\\n i = Integer.parseInt(q.getText());\\n } catch (NumberFormatException e) {\\n }\\n if (q != finish) {\\n q.setV(new Vertex(q.getXcoor(), q.getYcoor(), i, s, finishVertex));\\n }\\n }\\n }\\n return true;\\n }\",\n \"public void reset()\\n {\\n reset(this.map, this.heuristic, this.neighborSelector);\\n }\",\n \"public void setFirstNode(byte[] hash)\\n {\\n if (!this.isInitialized)\\n {\\n this.initialize();\\n }\\n this.firstNode = hash;\\n this.firstNodeHeight = this.maxHeight;\\n this.isFinished = true;\\n }\",\n \"public void setGraphicsNode(GraphicsNode node) {\\n/* 94 */ if (node == null) {\\n/* 95 */ throw new IllegalArgumentException();\\n/* */ }\\n/* */ \\n/* 98 */ this.node = node;\\n/* */ }\",\n \"protected abstract void setTile( int tile, int x, int y );\",\n \"private void astarSetup(AStarNode end){\\n\\tfor(AStarNode node : getNodes()){\\n node.setVisited(false);\\n node.setFound(false);\\n node.updateDist(Float.POSITIVE_INFINITY);\\n\\t}\\n }\",\n \"public synchronized void setNode(String path, Node node)\\n throws ProcessingException {\\n if ( path == null || path.equals(\\\"/\\\")) {\\n data = DOMUtil.createDocument();\\n data.appendChild(data.createElementNS(null, \\\"context\\\"));\\n data.getFirstChild().appendChild(data.importNode(node, true));\\n } else {\\n path = this.createPath(path); \\n Node removeNode = DOMUtil.selectSingleNode(data, path, this.xpathProcessor);\\n removeNode.getParentNode().replaceChild(data.importNode(node, true), removeNode);\\n }\\n }\",\n \"public void setGoal(Point point) {\\n mGoal = point;\\n }\",\n \"public void setG(Node parent, int moveCost){\\n\\t\\tg=calculateG(parent, moveCost);\\n\\t}\",\n \"public Heuristic() {\\n this(HeuristicUtils.defaultValues);\\n }\",\n \"protected void setFitness(float fit)\\t{\\tfitness = fit;\\t\\t}\",\n \"void setValueOfNode(String path, String value)\\n throws ProcessingException;\",\n \"@AbstractCustomGlobal.GlobalMethod(menuText=\\\"Set Threshold Probability\\\")\\n public void setThreshold() {\\n if(Tools.getGlobalTime()!=0){\\n JOptionPane.showMessageDialog(null, \\\"You can change this probability only when the simulation start\\\",\\\"Alert\\\", JOptionPane.INFORMATION_MESSAGE);\\n return;\\n }\\n String answer = JOptionPane.showInputDialog(null, \\\"Set the probability that a node can be selected to run.\\\");\\n // Show an information message\\n try{\\n double k = Double.parseDouble(answer);\\n Iterator<Node> it = Tools.getNodeList().iterator();\\n while(it.hasNext()){\\n Node n = it.next();\\n if(n.getClass() == MSNode.class){\\n MSNode n1 = (MSNode)n;\\n n1.setThresholdProbability(k);\\n }\\n if(n.getClass() == MS2Node.class){\\n MS2Node n1 = (MS2Node)n;\\n n1.setThresholdProbability(k);\\n }\\n }\\n JOptionPane.showMessageDialog(null, \\\"Well done you have set this value:\\\"+k,\\\"Notice\\\", JOptionPane.INFORMATION_MESSAGE);\\n }catch(NumberFormatException e){\\n JOptionPane.showMessageDialog(null, \\\"You must insert a valid double \\\", \\\"Alert\\\", JOptionPane.INFORMATION_MESSAGE);\\n }\\n }\",\n \"public void initialize() {\\n for (Location apu : this.locations) {\\n Node next = new Node(apu.toString());\\n this.cells.add(next);\\n }\\n \\n for (Node helper : this.cells) {\\n Location next = (Location)this.locations.searchWithString(helper.toString()).getOlio();\\n LinkedList<Target> targets = next.getTargets();\\n for (Target finder : targets) {\\n Node added = this.path.search(finder.getName());\\n added.setCoords(finder.getX(), finder.getY());\\n helper.addEdge(new Edge(added, finder.getDistance()));\\n }\\n }\\n \\n this.startCell = this.path.search(this.source);\\n this.goalCell = this.path.search(this.destination);\\n \\n /**\\n * Kun lähtö ja maali on asetettu, voidaan laskea jokaiselle solmulle arvio etäisyydestä maaliin.\\n */\\n this.setHeuristics();\\n }\",\n \"public void setNodeA(int x){\\n this.nodeA = x;\\n }\",\n \"public abstract void setSelectedNode(String n);\",\n \"public void setToOriginals(){\\n\\t\\t//set all occupied nodes as empty\\n\\t\\tif(nodeStatus == Status.occupied){\\n\\t\\t\\tsetAsEmpty();\\n\\t\\t}\\n\\t\\t//if the node had a unit end on it, reset that value\\n\\t\\tif(ended == true){\\n\\t\\t\\tended=false;\\n\\t\\t}\\n\\t\\tf=0;\\n\\t\\tg=0;\\n\\t\\th=0;\\n\\t}\",\n \"public void makeSet(T e){\\n\\t\\tnodes.put(e, new Node<T>(e));\\r\\n\\t}\",\n \"public void setNode(String node)\\n {\\n this.node = node;\\n }\",\n \"public void setp(Node n) {\\n\\t\\tp = n;\\n\\t}\",\n \"public void setEdge(int start, int target){\\n\\t\\tthis.graph.elementAt(start).insert(target);\\n\\t}\",\n \"public void setHijoIzq (nodeTree pHIzq){\\n this._hIzq=pHIzq;\\n }\",\n \"public void testSetGoalLocation() {\\n test = new Location(9, 9);\\n assertEquals(test, maze1.getGoalLocation());\\n \\n test = new Location(1, 1);\\n maze1.setGoalLocation(test);\\n assertEquals(test, maze1.getGoalLocation());\\n \\n test = new Location(2, 2);\\n maze1.setCell(test, MazeCell.WALL);\\n maze1.setGoalLocation(test);\\n assertEquals(test, maze1.getGoalLocation());\\n \\n \\n }\",\n \"void setFirst(Node node) {\\n this.first = node;\\n }\",\n \"public final void setFirst(Node n) {\\n set(n);\\n }\",\n \"public void setCurrentNode(int node) {\\n\\t\\tthis.currentNode = node;\\n\\t}\",\n \"void setLowNode(Node n){\\n low = n;\\n }\",\n \"public void setNode_1(String node_1);\",\n \"@Override\\n\\tpublic void setNodeInfo(String path, Object obj) {\\n\\t\\treentrantReadWriteLock.readLock().lock();\\n\\t\\ttry {\\n\\t\\t\\tzookeeper.setData(path, SomeUtil.getByte(obj),\\n\\t\\t\\t\\t\\t-1);\\n\\t\\t} catch (Exception e) {\\n\\t\\t\\tlog.error(\\\"更新跟节点数据异常！\\\", e);\\n\\t\\t} finally {\\n\\t\\t\\treentrantReadWriteLock.readLock().unlock();\\n\\t\\t}\\n\\t}\",\n \"public void setTreeSearch(Player tree){\\n t = tree;\\n\\n // e = new EvaluationFunction1(t);\\n }\",\n \"public void setGoal(int sx, int sy) {\\n mGoal = new Point(sx, sy);\\n }\",\n \"private void _setPoint(int index, DataPoint point) {\\n ntree.set(index, point);\\n ensureDistances();\\n }\",\n \"@Override\\n public void set(int i, Node<T> e)\\n {\\n super.set(i, e);\\n if(i == 0) \\n {\\n lastNode.setNext(firstNode);\\n updateFirstNode();\\n }\\n else if(i == size - 1) lastNode = e;\\n }\",\n \"public void setHijoDer (nodeTree pHDer){\\n this._hDer=pHDer;\\n }\",\n \"public abstract void setPoint(Point p);\",\n \"public void setNode(String node) {\\n this.node = node;\\n }\",\n \"private void setCellVisited(Cell cell) {\\n\\n\\t\\tif (!isIn(cell))\\n\\t\\t\\treturn;\\n\\n\\t\\tint r = cell.r;\\n\\t\\tint c = cell.c;\\n\\t\\tif (maze.type == HEX) {\\n\\t\\t\\tc = c - (r + 1) / 2;\\n\\t\\t}\\n\\t\\ttry {\\n\\t\\t\\tvisited[r][c] = true;\\n\\t\\t} catch (Exception e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t}\",\n \"public void setNeighborSelector(NeighborSelector neighborSelector)\\n {\\n this.neighborSelector = neighborSelector;\\n }\",\n \"public KadNode setNode(Node node) {\\r\\n\\t\\tthis.node = node;\\r\\n\\t\\treturn this;\\r\\n\\t}\",\n \"public void setNode_5(String node_5);\",\n \"public void setPathway(PathwayHolder p)\\r\\n\\t{\\n\\t}\",\n \"void setCost(double cost);\",\n \"@Override\\r\\n public void execute() {\\r\\n if (newSource != null) {\\r\\n edge.setSource(newSource);\\r\\n } else if (newTarget != null) {\\r\\n edge.setTarget(newTarget);\\r\\n }\\r\\n }\",\n \"public void setHomeScore(int h);\",\n \"void setRoadway(org.landxml.schema.landXML11.RoadwayDocument.Roadway roadway);\",\n \"public abstract Piece setLocation(int row, int column);\",\n \"public void settInn(T element){\\n Node temp = new Node(element);\\n temp.neste = hode.neste;\\n temp.neste.forrige = temp;\\n temp.forrige = hode;\\n hode.neste = temp;\\n elementer++;\\n\\n\\n }\",\n \"public abstract void setInternal(int head, int ct, int t, int arm, int leg);\",\n \"public void setPath(Path inputPath) {\\n path = inputPath;\\n node = path.getNodes().getFirst();\\n }\",\n \"public void setLink( IntNode _node ) {\\r\\n\\t\\t\\tlink = _node;\\r\\n\\t\\t}\",\n \"public void setVisited()\\n {\\n visited = true;\\n }\",\n \"public void setNewGraph() {\\n\\tresetHints();\\r\\n Random random = new Random();\\r\\n if (graphMode == 1) {\\r\\n if (selectedSize == 1) {\\r\\n currentGraph = chromaticManager.calculate(random.nextInt(myInformation.smallGraph) + 1, -1);\\r\\n }\\r\\n if (selectedSize == 2) {\\r\\n currentGraph = chromaticManager.calculate(random.nextInt(myInformation.middleGraph - myInformation.smallGraph) + myInformation.smallGraph + 1, -1);\\r\\n }\\r\\n if (selectedSize == 3) {\\r\\n currentGraph = chromaticManager.calculate(random.nextInt(myInformation.bigGraph - myInformation.middleGraph) + myInformation.middleGraph + 1, -1);\\r\\n }\\r\\n }\\r\\n if (graphMode == 2) {\\r\\n currentGraph = chromaticManager.calculate(myGraph);\\r\\n }\\r\\n if (graphMode == 3) {\\r\\n try {\\r\\n stackPane.getChildren().removeAll(textFieldHBox, backPane);\\r\\n myVertices = Integer.parseInt(textFieldVertices.getText());\\r\\n myEdges = Integer.parseInt(textFieldEdges.getText());\\r\\n currentGraph = chromaticManager.calculate(myVertices, myEdges);\\r\\n setDisplay(currentGraph);\\r\\n } catch (NumberFormatException e) {\\r\\n\\r\\n }\\r\\n }\\r\\n threadPoolExecutor.execute(() -> {\\r\\n NewForce newForce = new NewForce();\\r\\n currentGraph.setCNumer(newForce.doNewForce(currentGraph,currentGraph.getUpperBound(),currentGraph.getLowerBound()));\\r\\n });\\r\\n }\",\n \"public void setPriorNode(Node<T> prior) {\\n\\t\\t\\titsPrior = prior;\\n }\",\n \"public void setAsStartingPoint() {\\n\\t\\tnodeStatus = Status.occupied;\\n\\t}\",\n \"void setLeader(Genome leader);\",\n \"public void setEdge(Student curr, Student neighbor, Integer price) {\\n curr.setNeighborAndPrice(neighbor, price);\\n }\",\n \"void setFitnessScore(double score){\\n fitnessScore = score;\\n }\",\n \"public void setVisited(int v) {\\n visited.set(v, true);\\n nodeEnum.add(v);\\n }\",\n \"public void setEdgeCost(int from, int to, double newCost) {\\n //make sure the nodes given are valid\\n assert (from < nodeVector.size()) && (to < nodeVector.size()) :\\n \\\"<SparseGraph::SetEdgeCost>: invalid index\\\";\\n\\n //visit each neighbour and erase any edges leading to this node\\n ListIterator<edge_type> it = edgeListVector.get(from).listIterator();\\n while (it.hasNext()) {\\n edge_type curEdge = it.next();\\n if (curEdge.getTo() == to) {\\n curEdge.setCost(newCost);\\n break;\\n }\\n }\\n }\",\n \"double setCost(double cost);\",\n \"public void setLT(TreeNode node)\\r\\n\\t\\t{\\r\\n\\t\\t\\tthis.lThan = node;\\r\\n\\t\\t}\",\n \"private void setNeighbors() {\\n\\t\\tfor (int i = 0; i < getNumRows(); i++) {\\n\\t\\t\\tfor (int j = 0; j < getNumCols(); j++) {\\n\\t\\t\\t\\tCell c = getCurrentGrid()[i][j];\\n\\t\\t\\t\\tsetNeighborsForCell(c);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"public void setFitness(int newFitness) {\\n fitness = newFitness;\\n }\",\n \"void setRoute(Shape route);\",\n \"public void setTreeNode(TreeNode treeNode) {\\n this.treeNode = treeNode;\\n }\",\n \"public void setNodeVistied(boolean nodeVisit){\\r\\n\\t \\tthis.nodeVisited = nodeVisit;\\r\\n\\t }\",\n \"public void setFirst(Node first)\\n {\\n this.first = first;\\n }\",\n \"public void setParent(IAVLNode node);\",\n \"public void setParent(IAVLNode node);\",\n \"private void setHighScore(int hs) {\\n setStat(hs, highScore);\\n }\",\n \"public void setProblem(AbstractSearchProblem<S> p) {\\n problem = p;\\n }\",\n \"public void setX(int node, int x) {\\n if (x != xs[node])\\n invalid[node] = true;\\n xs[node] = x;\\n }\",\n \"void setTile(Tile tile) {\\n _tile = tile;\\n }\",\n \"public void setAdj(Tile adjTile, int sideIndex){\\r\\n adjTiles[sideIndex] = adjTile;\\r\\n }\",\n \"public void setVisited(final Profile profile){\\n\\t\\tpartnerboerseVerwaltung.visit(profile, new AsyncCallback<Void>() {\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic void onFailure(Throwable caught) {\\n\\t\\t\\t}\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic void onSuccess(Void result) {\\n\\t\\t\\t}\\n\\t\\t});\\n\\t}\",\n \"public void setVisited(Boolean b){\\n visited = b;\\n }\",\n \"public void setDest(Point dest){\\n System.out.println(\\\"hit\\\");\\n this.dest = dest;\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7458475","0.7067843","0.66975325","0.6607452","0.6063322","0.58320844","0.5741439","0.5738452","0.5724705","0.5718298","0.5676771","0.56604266","0.55995935","0.5574674","0.5560622","0.5529921","0.5517654","0.55060416","0.54573745","0.53933114","0.53358066","0.53084284","0.5296653","0.5296443","0.5281675","0.52657956","0.52499175","0.52437276","0.5235059","0.5228803","0.51869357","0.51782393","0.5174365","0.5168021","0.5154193","0.51541793","0.5142971","0.51409644","0.51378775","0.51270044","0.51116127","0.51052463","0.509228","0.50794864","0.50717276","0.50693715","0.5062966","0.5059167","0.50581133","0.50299776","0.5015193","0.501399","0.498863","0.4981454","0.49635163","0.49518982","0.49443293","0.4924532","0.4923531","0.49218363","0.49217978","0.4920544","0.4917906","0.49127105","0.4911888","0.4909737","0.4904745","0.49039128","0.4897353","0.48967218","0.48892924","0.48818845","0.48801035","0.4879112","0.48765406","0.48525268","0.4852214","0.48503125","0.48436043","0.48430243","0.4840206","0.48334792","0.4830706","0.48289815","0.4819435","0.48150557","0.48139805","0.4813929","0.48132262","0.48035368","0.47847104","0.47847104","0.47753716","0.47725523","0.47647387","0.4758961","0.4754411","0.47421765","0.47398677","0.4736391"],"string":"[\n \"0.7458475\",\n \"0.7067843\",\n \"0.66975325\",\n \"0.6607452\",\n \"0.6063322\",\n \"0.58320844\",\n \"0.5741439\",\n \"0.5738452\",\n \"0.5724705\",\n \"0.5718298\",\n \"0.5676771\",\n \"0.56604266\",\n \"0.55995935\",\n \"0.5574674\",\n \"0.5560622\",\n \"0.5529921\",\n \"0.5517654\",\n \"0.55060416\",\n \"0.54573745\",\n \"0.53933114\",\n \"0.53358066\",\n \"0.53084284\",\n \"0.5296653\",\n \"0.5296443\",\n \"0.5281675\",\n \"0.52657956\",\n \"0.52499175\",\n \"0.52437276\",\n \"0.5235059\",\n \"0.5228803\",\n \"0.51869357\",\n \"0.51782393\",\n \"0.5174365\",\n \"0.5168021\",\n \"0.5154193\",\n \"0.51541793\",\n \"0.5142971\",\n \"0.51409644\",\n \"0.51378775\",\n \"0.51270044\",\n \"0.51116127\",\n \"0.51052463\",\n \"0.509228\",\n \"0.50794864\",\n \"0.50717276\",\n \"0.50693715\",\n \"0.5062966\",\n \"0.5059167\",\n \"0.50581133\",\n \"0.50299776\",\n \"0.5015193\",\n \"0.501399\",\n \"0.498863\",\n \"0.4981454\",\n \"0.49635163\",\n \"0.49518982\",\n \"0.49443293\",\n \"0.4924532\",\n \"0.4923531\",\n \"0.49218363\",\n \"0.49217978\",\n \"0.4920544\",\n \"0.4917906\",\n \"0.49127105\",\n \"0.4911888\",\n \"0.4909737\",\n \"0.4904745\",\n \"0.49039128\",\n \"0.4897353\",\n \"0.48967218\",\n \"0.48892924\",\n \"0.48818845\",\n \"0.48801035\",\n \"0.4879112\",\n \"0.48765406\",\n \"0.48525268\",\n \"0.4852214\",\n \"0.48503125\",\n \"0.48436043\",\n \"0.48430243\",\n \"0.4840206\",\n \"0.48334792\",\n \"0.4830706\",\n \"0.48289815\",\n \"0.4819435\",\n \"0.48150557\",\n \"0.48139805\",\n \"0.4813929\",\n \"0.48132262\",\n \"0.48035368\",\n \"0.47847104\",\n \"0.47847104\",\n \"0.47753716\",\n \"0.47725523\",\n \"0.47647387\",\n \"0.4758961\",\n \"0.4754411\",\n \"0.47421765\",\n \"0.47398677\",\n \"0.4736391\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.77933234"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":27396,"cells":{"query":{"kind":"string","value":"/ The greedy algorithm selects the best out of the children. There should be a loop. During each iteration, take the node make its children. Perfrom goal check, cycle check"},"document":{"kind":"string","value":"private void GreedySearch(){\n\n Queue<Node> expanded = new LinkedList<>();\n ArrayList<Node> fringe = new ArrayList<>();\n ArrayList<Node> fringeTemp = new ArrayList<>();\n\n\n Node current = startNode;\n\n while(expanded.size() < 1000){\n\n if(current.getDigit().getDigitString().equals(goalNode.getDigit().getDigitString())){\n //goal is reached.\n solutionPath(current);\n expanded.add(current);\n printExpanded(expanded);\n System.exit(0);\n }\n\n\n boolean b = cycleCheck(current,expanded);\n\n if(!b) {\n expanded.add(current);\n }\n\n if(!b){\n\n if(current.getDigit().last_changed != 0){\n\n if ((Integer.parseInt(current.getDigit().getFirst_digit()) - 1 >= 0)) {\n Node child_node = new Node(current.getDigit().decreaseFirstDigit());\n child_node.setParent(current);\n child_node.getDigit().setLastChanged(0);\n\n if(!forbidden.contains(child_node.getDigit().getDigitString())){\n fringe.add(child_node);\n }\n }\n\n //+1 child first digit\n if ((Integer.parseInt(current.getDigit().getFirst_digit()) + 1 <= 9)) {\n Node child_node = new Node(current.getDigit().increaseFirstDigit());\n child_node.setParent(current);\n child_node.getDigit().setLastChanged(0);\n if(!forbidden.contains(child_node.getDigit().getDigitString())){\n fringe.add(child_node);\n }\n\n }\n }\n\n if(current.getDigit().last_changed != 1){\n\n if ((Integer.parseInt(current.getDigit().getSecond_digit()) - 1 >= 0)) {\n Node child_node = new Node(current.getDigit().decreaseSecondDigit());\n child_node.setParent(current);\n child_node.getDigit().setLastChanged(1);\n if(!forbidden.contains(child_node.getDigit().getDigitString())){\n fringe.add(child_node);\n }\n }\n\n //+1 child\n if ((Integer.parseInt(current.getDigit().getSecond_digit()) + 1 <= 9)) {\n Node child_node = new Node(current.getDigit().increaseSecondDigit());\n child_node.setParent(current);\n child_node.getDigit().setLastChanged(1);\n if(!forbidden.contains(child_node.getDigit().getDigitString())){\n fringe.add(child_node);\n }\n }\n }\n\n if(current.getDigit().last_changed != 2){\n if ((Integer.parseInt(current.getDigit().getThird_digit()) - 1 >= 0)) {\n Node child_node = new Node(current.getDigit().decreaseThirdDigit());\n child_node.setParent(current);\n child_node.getDigit().setLastChanged(2);\n if(!forbidden.contains(child_node.getDigit().getDigitString())){\n fringe.add(child_node);\n }\n }\n //+1 child\n if ((Integer.parseInt(current.getDigit().getThird_digit()) + 1 <= 9)) {\n Node child_node = new Node(current.getDigit().increaseThirdDigit());\n child_node.setParent(current);\n child_node.getDigit().setLastChanged(2);\n if(!forbidden.contains(child_node.getDigit().getDigitString())){\n fringe.add(child_node);\n }\n }\n }\n\n }\n\n\n\n for(Node n : fringe){\n heuristicSetter(n);\n\n }\n\n fringeTemp.addAll(fringe);\n //now all the nodes in fringe have the heuristic value.\n //We can get the last added minm\n Node minm;\n if(fringeTemp.size() != 0){\n minm = fringeTemp.get(0);\n }else{\n break;\n }\n for(int i = 1; i<fringeTemp.size(); i++){\n if(fringeTemp.get(i).getHeuristic() <= minm.getHeuristic()){\n minm = fringeTemp.get(i);\n }\n }\n\n //now we have the minm for the next stage.\n current = minm;\n fringeTemp.remove(minm);\n fringe.clear();\n }\n\n //While loop ends\n System.out.println(\"No solution found.\");\n printExpanded(expanded);\n\n\n\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["public void greedyBFS(String input)\r\n\t{\r\n\t\tNode root_gbfs = new Node (input);\r\n\t\tNode current = new Node(root_gbfs.getState());\r\n\t\t\r\n\t\tNodeComparator gbfs_comparator = new NodeComparator();\r\n\t\tPriorityQueue<Node> queue_gbfs = new PriorityQueue<Node>(12, gbfs_comparator);\r\n\t\tArrayList<String> visited = new ArrayList<String>();\r\n\t\tArrayList<String> children = new ArrayList<String>();\r\n\t\t\r\n\t\tint nodes_popped = 0;\r\n\t\tint pqueue_max_size = 0;\r\n\t\tint pq_size = 0;\r\n\t\t\r\n\t\tcurrent.cost = 0;\r\n\t\tcurrent.total_cost = 0;\r\n\t\t\r\n\t\twhile(!goal_gbfs)\r\n\t\t{\r\n\t\t\tvisited.add(current.getState());\r\n\t\t\tchildren = Successor.findChildren(current.getState());\r\n\t\t\t\r\n\t\t\tfor (String a : children)\r\n\t\t\t{\r\n\t\t\t\t\r\n\t\t\t\tif (visited.contains(a))\r\n\t\t\t\t{\r\n\t\t\t\t\tcontinue;\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\t\r\n\t\t\t\t\tNode nino = new Node(a);\r\n\t\t\t\t\tcurrent.children_nodes.add(nino);\r\n\t\t\t\t\tvisited.add(nino.getState());\r\n\t\t\t\t\t\r\n\t\t\t\t\tint cost = isCost(current.getState(), nino.getState());\r\n\t\t\t\t\tnino.cost = cost;\r\n\t\t\t\t\tnino.parent = current;\r\n\t\t\t\t\tint greedy_cost = greedybfsCost(nino.getState(), root_gbfs.getState());\r\n\t\t\t\t\tnino.setTotalCost(greedy_cost);\r\n\t\t\t\t\t\r\n\t\t\t\t\tif (!queue_gbfs.contains(nino))\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tqueue_gbfs.add(nino);\r\n\t\t\t\t\t\tpq_size++;\r\n\t\t\t\t\t}\r\n\t\t\t\t\t\r\n\t\t\t\t\t// Repeated State checking. Removing the same node from PQ if the path cost is less then the current one \r\n\t\t\t\t\telse if (queue_gbfs.contains(nino))\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tfor (Node original : queue_gbfs)\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\tif (original.equals(nino))\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tNode copy = original;\r\n\t\t\t\t\t\t\t\tif (nino.getTotalCost() < copy.getTotalCost())\r\n\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\tqueue_gbfs.remove(copy);\r\n\t\t\t\t\t\t\t\t\tqueue_gbfs.add(nino);\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t\t\r\n\t\t\t\t\t\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\tcurrent = queue_gbfs.poll();\r\n\t\t\tnodes_popped++;\r\n\t\t\t\r\n\t\t\tif (pq_size > pqueue_max_size)\r\n\t\t\t{\r\n\t\t\t\tpqueue_max_size = pq_size;\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\tpq_size--;\r\n\t\t\tgoal_gbfs = isGoal(current.getState());\r\n\t\t\t\r\n\t\t}\r\n\t\t\r\n\t\tgoal_gbfs = false;\r\n\t\tSystem.out.println(\"GBFS Solved!!\");\r\n\t\tSolution.performSolution(current, root_gbfs, nodes_popped, pqueue_max_size);\r\n\t}","private boolean helperDFS(Node current){\n\n if(expandedNode.size() == 999){\n //limit has been reached. jump out of recursion.\n expandedNode.add(current);\n System.out.println(\"No solution found.\");\n printExpanded(expandedNode);\n System.exit(0);\n return false;\n }\n\n boolean b = cycleCheck(current,expandedNode);\n\n if(!b){\n expandedNode.add(current);\n }else{\n return false;\n }\n\n if(current.getDigit().getDigitString().equals(goalNode.getDigit().getDigitString())){\n //goal reached.\n //expandedNode.add(current);\n solutionPath(current);\n printExpanded(expandedNode);\n System.exit(0);\n }\n\n //Now make the children.\n\n if(!forbidden.contains(current.getDigit().getDigitString())){\n\n if(current.getDigit().last_changed != 0){\n\n if ((Integer.parseInt(current.getDigit().getFirst_digit()) - 1 >= 0)) {\n Node child_node = new Node(current.getDigit().decreaseFirstDigit());\n child_node.setParent(current);\n child_node.getDigit().setLastChanged(0);\n if(!forbidden.contains(child_node.getDigit().getDigitString()) && helperDFS(child_node)){\n return true;\n }\n }\n\n //+1 child first digit\n if ((Integer.parseInt(current.getDigit().getFirst_digit()) + 1 <= 9)) {\n Node child_node = new Node(current.getDigit().increaseFirstDigit());\n child_node.setParent(current);\n child_node.getDigit().setLastChanged(0);\n if(!forbidden.contains(child_node.getDigit().getDigitString()) && helperDFS(child_node)){\n return true;\n }\n }\n }\n\n if(current.getDigit().last_changed != 1){\n if ((Integer.parseInt(current.getDigit().getSecond_digit()) - 1 >= 0)) {\n Node child_node = new Node(current.getDigit().decreaseSecondDigit());\n child_node.setParent(current);\n child_node.getDigit().setLastChanged(1);\n if(!forbidden.contains(child_node.getDigit().getDigitString()) && helperDFS(child_node)){\n return true;\n }\n }\n\n //+1 child\n if ((Integer.parseInt(current.getDigit().getSecond_digit()) + 1 <= 9)) {\n Node child_node = new Node(current.getDigit().increaseSecondDigit());\n child_node.setParent(current);\n child_node.getDigit().setLastChanged(1);\n if(!forbidden.contains(child_node.getDigit().getDigitString()) && helperDFS(child_node)){\n return true;\n }\n }\n }\n\n if(current.getDigit().last_changed != 2){\n if ((Integer.parseInt(current.getDigit().getThird_digit()) - 1 >= 0)) {\n Node child_node = new Node(current.getDigit().decreaseThirdDigit());\n child_node.setParent(current);\n child_node.getDigit().setLastChanged(2);\n if(!forbidden.contains(child_node.getDigit().getDigitString()) && helperDFS(child_node)){\n return true;\n }\n }\n //+1 child\n if ((Integer.parseInt(current.getDigit().getThird_digit()) + 1 <= 9)) {\n Node child_node = new Node(current.getDigit().increaseThirdDigit());\n child_node.setParent(current);\n child_node.getDigit().setLastChanged(2);\n if(!forbidden.contains(child_node.getDigit().getDigitString()) && helperDFS(child_node)){\n return true;\n }\n }\n }\n }\n return false;\n }","int solve(int p, int current) {\n int id = getId(p, current);\n if (p >= 0 && memo.containsKey(id)) {\n return memo.get(id);\n }\n List<Integer> adjList = adj.get(current);\n int n = adjList.size();\n if (n == 0) {\n throw new RuntimeException();\n }\n if ((n == 2 && p >= 0) || (n == 1 && p < 0)) {\n // should cut the nodes under current\n int ans = getDepth(p, current) - 1;\n // System.out.println(\"ans(\" + p + \",\" + current + \")=\" + ans);\n memo.put(id, ans);\n return ans;\n }\n if (n == 1) {\n // System.out.println(\"ans(\" + p + \",\" + current + \")=nochild\");\n return 0;\n }\n int ans = Integer.MAX_VALUE;\n\n for (int i = 0; i < n; i++) {\n int a = adjList.get(i);\n if (a == p) {\n continue;\n }\n for (int j = i + 1; j < n; j++) {\n int b = adjList.get(j);\n if (b == p) {\n continue;\n }\n // try a & b combo\n int tmp = solve(current, a);\n tmp += solve(current, b);\n for (int k = 0; k < n; k++) {\n int c = adjList.get(k);\n if (c != a && c != b && c != p) {\n tmp += getDepth(current, c);\n }\n }\n ans = Math.min(ans, tmp);\n }\n }\n memo.put(id, ans);\n // System.out.println(\"ans(\" + p + \",\" + current + \")=\" + ans);\n return ans;\n }","private void gameTree(MinimaxNode<GameState> currentNode, int depth, int oIndex){\n currentNode.setNodeIndex(oIndex); \n if (depth == 0) {\n return;\n }\n else{\n if (currentNode.getState().isDead(oIndex)){ //checks to see if current player is dead, if so, just skips their moves\n int newIndex = (oIndex + 1) % currentNode.getState().getNrPlayers();\n/* if(oIndex == 3){\n newIndex = 0;\n }\n else{\n newIndex = oIndex + 1;\n }*/\n gameTree(currentNode, depth-1, newIndex);\n }\n else{\n //this if statement sets up chance nodes, if the target has been met it will create 5 children nodes with randomly generated new target postitions \n if(!currentNode.getState().hasTarget()){\n currentNode.setChanceNode();\n for(int i = 1; i <= 5; i++){\n try{\n GameState newState = (GameState)currentNode.getState().clone();\n newState.chooseNextTarget();\n MinimaxNode<GameState> childNode = new MinimaxNode(newState);\n childNode.setProbability(0.2);\n currentNode.addChild(childNode); \n }\n catch (CloneNotSupportedException e){\n System.out.println(\"Clone not excepted\");\n }\n \n }\n for (int i = 0; i < currentNode.getNumberOfChildren(); i++){\n gameTree(currentNode.getChildren().get(i), depth, oIndex);\n }\n\n }\n else{\n List<Integer> options = new ArrayList();\n for (int i = 1; i <= 4; i++) {\n if (currentNode.getState().isLegalMove(oIndex, i)){\n options.add(i);\n }\n }\n for (int i = 0; i < options.size(); i++){\n try{\n GameState newState = (GameState)currentNode.getState().clone();\n newState.setOrientation(oIndex, options.get(i));\n newState.updatePlayerPosition(oIndex);\n MinimaxNode<GameState> childNode = new MinimaxNode(newState);\n currentNode.addChild(childNode);\n }\n catch (CloneNotSupportedException e){\n System.out.println(\"Clone not excepted\");\n }\n }\n int newIndex = (oIndex + 1) % currentNode.getState().getNrPlayers();\n /* if(oIndex == 3){\n newIndex = 0;\n }\n else{\n newIndex = oIndex + 1;\n }*/\n for (int i = 0; i < currentNode.getNumberOfChildren(); i++){\n gameTree(currentNode.getChildren().get(i), depth-1, newIndex);\n }\n } \n } \n }\n }","private void treeBreadthFirstTraversal() {\n Node currNode = root;\n java.util.LinkedList<Node> queue = new java.util.LinkedList<Node>();\n\n // Highlights the first Node.\n queueNodeSelectAnimation(currNode, \"Exploring \" + currNode.key,\n AnimationParameters.ANIM_TIME);\n\n // Explores Nodes until the queue is empty.\n while (true) {\n\n // Marks that this Node's children should be explored.\n for (int i = 0; i < getNumChildren(); ++i) {\n if (currNode.children[i] != null) {\n queue.addLast(currNode.children[i]);\n queueQueueAddAnimation(currNode.children[i],\n \"Queueing \" + currNode.children[i].key,\n AnimationParameters.ANIM_TIME);\n\n }\n }\n\n // Pops the next Node from the queue.\n if (!queue.isEmpty()) {\n currNode = queue.pop();\n queueListPopAnimation(\"Popped \" + currNode.key,\n AnimationParameters.ANIM_TIME);\n queueNodeSelectAnimation(currNode, \"Exploring \" + currNode.key,\n AnimationParameters.ANIM_TIME);\n\n }\n // If the queue is empty, breaks.\n else break;\n\n }\n }","private static ArrayList<MMT> generateChildren(Board currentBoard, String mPlayer, boolean ifChildMax, int depthToGo){\n\t\t//System.out.println(\"generate children! depth to go is \" + depthToGo);\n\t\tif (depthToGo == 0)\n\t\t\treturn null;\n\t\tArrayList<MMT> childLst = new ArrayList<MMT>();\n\t\tfor (int j = 0; j<Board.getNumCol(); j++){\n\t\t\tBoard childBoard = new Board(currentBoard);\n\t\t\tboolean success = childBoard.fillBoard(j, getCurrentNodePiece(mPlayer, ifChildMax));\n\t\t\t//Board.printBoard(childBoard);\n\t\t\t//System.out.println(\"score for this board: \" + Eval.evalBoard(childBoard, mPlayer));\n\t\t\t//if valid move, then add board\n\t\t\tif (success){\n\t\t\t\t//set depth to 0 (to stop) if someone wins or tie\n\t\t\t\tint depth;\n\t\t\t\tif (Eval.checkTie(childBoard) || Eval.ifHumanWon(childBoard) ||\n\t\t\t\t\t\tEval.ifPCWon(childBoard)){\n\t\t\t\t\tdepth = 0;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tdepth = depthToGo -1;\n\t\t\t\t\t//depth = depthToGo; //depth not reduced at constructor\n\t\t\t\tMMT child = new MMT(childBoard, depth, mPlayer, ifChildMax, j);\n\t\t\t\tchildLst.add(child);\n\t\t\t}\n\t\t}\n\t\tif (childLst.size() == 0)\n\t\t\treturn null;\n\t\treturn childLst;\n\t}","public void aEstrella2 (String input)\r\n\t{\r\n\t\tNode root_aEstrella2 = new Node (input);\r\n\t\tNode current = new Node(root_aEstrella2.getState());\r\n\t\t\r\n\t\tHeuristicComparator aEstrella_comparator = new HeuristicComparator();\r\n\t\tPriorityQueue<Node> queue_gbfs = new PriorityQueue<Node>(12, aEstrella_comparator);\r\n\t\tArrayList<String> visited = new ArrayList<String>();\r\n\t\tArrayList<String> children = new ArrayList<String>();\r\n\t\t\r\n\t\tint nodes_popped = 0;\r\n\t\tint pqueue_max_size = 0;\r\n\t\tint pq_size = 0;\r\n\t\t\r\n\t\tcurrent.cost = 0;\r\n\t\t\r\n\t\twhile(!goal_aEstrella2)\r\n\t\t{\r\n\t\t\tvisited.add(current.getState());\r\n\t\t\tchildren = Successor.findChildren(current.getState());\r\n\t\t\t\r\n\t\t\tfor (String a : children)\r\n\t\t\t{\r\n\t\t\t\t\r\n\t\t\t\tif (visited.contains(a))\r\n\t\t\t\t{\r\n\t\t\t\t\tcontinue;\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\t\r\n\t\t\t\t\tNode nino = new Node(a);\r\n\t\t\t\t\tcurrent.children_nodes.add(nino);\r\n\t\t\t\t\tvisited.add(nino.getState());\r\n\t\t\t\t\t\r\n\t\t\t\t\tint cost = isCost(current.getState(), nino.getState());\r\n\t\t\t\t\tnino.cost = cost;\r\n\t\t\t\t\tnino.parent = current;\r\n\t\t\t\t\tint manhattanD = manhattanDistance(nino.getState(), root_aEstrella2.getState());\r\n\t\t\t\t\tnino.setTotalCost(nino.parent.getTotalCost() + nino.cost);\r\n\t\t\t\t\t\r\n\t\t\t\t\t// f(n) = g(n) + h(n)\r\n\t\t\t\t\tnino.setHeuristicCost(nino.getTotalCost() + manhattanD);\r\n\t\t\t\t\t\r\n\t\t\t\t\tif (!queue_gbfs.contains(nino))\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tqueue_gbfs.add(nino);\r\n\t\t\t\t\t\tpq_size++;\r\n\t\t\t\t\t}\r\n\t\t\t\t\t\r\n\t\t\t\t\t// Repeated State checking. Removing the same node from PQ if the path cost is less then the current one \r\n\t\t\t\t\telse if (queue_gbfs.contains(nino))\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tfor (Node original : queue_gbfs)\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\tif (original.equals(nino))\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tNode copy = original;\r\n\t\t\t\t\t\t\t\tif (nino.getHeuristicCost() < copy.getHeuristicCost())\r\n\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\tqueue_gbfs.remove(copy);\r\n\t\t\t\t\t\t\t\t\tqueue_gbfs.add(nino);\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t\t\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\tcurrent = queue_gbfs.poll();\r\n\t\t\tnodes_popped++;\r\n\t\t\t\r\n\t\t\tif (pq_size > pqueue_max_size)\r\n\t\t\t{\r\n\t\t\t\tpqueue_max_size = pq_size;\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\tpq_size--;\r\n\t\t\tgoal_aEstrella2 = isGoal(current.getState());\r\n\t\t\t\r\n\t\t}\r\n\t\t\r\n\t\tgoal_aEstrella2 = false;\r\n\t\tSystem.out.println(\"A*2 Solved!!\");\r\n\t\tSolution.performSolution(current, root_aEstrella2, nodes_popped, pqueue_max_size);\r\n\t}","private ProblemModel findCheapestNode(){\n\t\tProblemModel ret = unvisitedPM.peek();\n\t\t\n\t\tfor(ProblemModel p : unvisitedPM){ \n\t\t\t//f(s) = depth + cost to make this move\n\t\t\tif(p.getCost() + p.getDepth() <= ret.getCost() + ret.getDepth()) ret = p;\n\t\t}\n\t\tunvisitedPM.remove(ret);\n\t\treturn ret;\n\t}","public static Tree solve() {\n Scanner scan = new Scanner(System.in);\n int n = scan.nextInt();\n\n int[] arrayNode = new int[n + 1];\n for (int i = 1; i <= n; i++) {\n arrayNode[i] = scan.nextInt();\n }\n\n Color[] arrayColor = new Color[n + 1];\n for (int i = 1; i <= n; i++) {\n if (scan.nextInt() == 0) {\n arrayColor[i] = Color.RED;\n } else {\n arrayColor[i] = Color.GREEN;\n }\n }\n\n List<Integer>[] adjacentsList = new List[n + 1];\n for (int i = 1; i <= n; i++) {\n adjacentsList[i] = new ArrayList<Integer>();\n }\n\n for (int i = 0; i < n - 1; i++) {\n int x = scan.nextInt();\n int y = scan.nextInt();\n\n adjacentsList[x].add(y);\n adjacentsList[y].add(x);\n }\n\n scan.close();\n\n List<Integer>[] childrenList = new List[n + 1];\n for (int i = 1; i <= n; i++) {\n childrenList[i] = new ArrayList<Integer>();\n }\n\n int[] depths = new int[n + 1];\n boolean[] visited = new boolean[n + 1];\n\n Queue<Integer> queue = new LinkedList<Integer>();\n depths[1] = 0;\n queue.offer(1);\n while (!queue.isEmpty()) {\n int head = queue.poll();\n\n if (visited[head]) {\n continue;\n }\n visited[head] = true;\n\n for (int adjacent : adjacentsList[head]) {\n if (!visited[adjacent]) {\n childrenList[head].add(adjacent);\n depths[adjacent] = depths[head] + 1;\n queue.offer(adjacent);\n }\n }\n }\n\n Tree[] nodes = new Tree[n + 1];\n for (int i = 1; i <= n; i++) {\n if (childrenList[i].isEmpty()) {\n nodes[i] = new TreeLeaf(arrayNode[i], arrayColor[i], depths[i]);\n } else {\n nodes[i] = new TreeNode(arrayNode[i], arrayColor[i], depths[i]);\n }\n }\n for (int i = 1; i <= n; i++) {\n for (int child : childrenList[i]) {\n ((TreeNode) nodes[i]).addChild(nodes[child]);\n }\n }\n return nodes[1];\n }","public void ids (String input, int limit)\r\n\t\t{\r\n\t\t\tNode root_ids= new Node (input);\r\n\t\t\tNode current = new Node(root_ids.getState());\r\n\t\t\t\r\n\t\t\tArrayList<String> visited = new ArrayList<String>();\r\n\t\t\tArrayList<String> children = new ArrayList<String>();\r\n\t\t\tStack<Node> stack_dfs = new Stack<Node>();\r\n\t\t\t\r\n\t\t\tint nodes_popped = 0;\r\n\t\t\tint stack_max_size = 0;\r\n\t\t\tint stack_max_total = 0;\r\n\t\t\tint depth = 0;\r\n\t\t\t\r\n\t\t\tcurrent.cost = 0;\r\n\t\t\tcurrent.depth = 0;\r\n\t\t\t\r\n\t\t\tgoal_ids = isGoal(current.getState());\r\n\t\t\t\r\n\t\t\twhile(depth <= limit)\r\n\t\t\t{\r\n\t\t\t\tif (goal_ids == true)\r\n\t\t\t\t{\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\t// Clear the visited array for backtracking purposes\r\n\t\t\t\tvisited.clear();\r\n\t\t\t\t\r\n\t\t\t\twhile(!goal_ids)\r\n\t\t\t\t{\r\n\t\t\t\t\tvisited.add(current.getState());\r\n\t\t\t\t\tchildren = Successor.findChildren(current.getState());\r\n\t\t\t\t\r\n\t\t\t\t\t// Depth limit check. This loop never runs if the node depth is greater then the limit\r\n\t\t\t\t\tif (current.getDepth() < limit)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tfor (String a : children)\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\tif (visited.contains(a))\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tNode nino = new Node(a);\r\n\t\t\t\t\t\t\tcurrent.children_nodes.add(nino);\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tint cost = isCost(current.getState(), nino.getState());\r\n\t\t\t\t\t\t\tnino.cost = cost;\r\n\t\t\t\t\t\t\tnino.parent = current;\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t// Repeated state check\r\n\t\t\t\t\t\t\tif (!stack_dfs.contains(nino))\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tstack_dfs.add(nino);\r\n\t\t\t\t\t\t\t\tstack_max_size++;\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t\t\r\n\t\t\t\t\tif (current.getDepth() >= limit - 1)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tint copy = stack_max_size;\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tif (copy > stack_max_total)\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\tstack_max_total = copy;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t}\r\n\t\t\t\t\t\r\n\t\t\t\t\tdepth++;\r\n\t\t\t\t\t\r\n\t\t\t\t\t// If there is no solution found at the depth limit, return no solution\r\n\t\t\t\t\tif (stack_dfs.empty() == true)\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\tSolution.noSolution(limit);\t\r\n\t\t\t\t\t\t\treturn;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\r\n\t\t\t\t\tcurrent = stack_dfs.pop();\r\n\t\t\t\t\t\r\n\t\t\t\t\t// Set depth of node so it can be checked in next iteration\r\n\t\t\t\t\tcurrent.setDepth(current.parent.getDepth() + 1);\r\n\t\t\t\t\tnodes_popped++;\r\n\t\t\t\t\tstack_max_size--;\r\n\t\t\t\t\tgoal_ids = isGoal(current.getState());\r\n\t\t\t\t\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\tgoal_ids = false;\r\n\t\t\tSystem.out.println(\"IDS Solved!!\");\r\n\t\t\t\r\n\t\t\tif (stack_max_total > stack_max_size)\r\n\t\t\t{\r\n\t\t\t\tstack_max_size = stack_max_total;\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\tSolution.performSolution(current, root_ids, nodes_popped, stack_max_size);\r\n\t\t}","public void aEstrella (String input)\r\n\t{\r\n\t\tNode root_aEstrella = new Node (input);\r\n\t\tNode current = new Node(root_aEstrella.getState());\r\n\t\t\r\n\t\tHeuristicComparator aEstrella_comparator = new HeuristicComparator();\r\n\t\tPriorityQueue<Node> queue_gbfs = new PriorityQueue<Node>(12, aEstrella_comparator);\r\n\t\tArrayList<String> visited = new ArrayList<String>();\r\n\t\tArrayList<String> children = new ArrayList<String>();\r\n\t\t\r\n\t\tint nodes_popped = 0;\r\n\t\tint pqueue_max_size = 0;\r\n\t\tint pq_size = 0;\r\n\t\t\r\n\t\tcurrent.cost = 0;\r\n\t\tcurrent.setTotalCost(0);\r\n\t\t\r\n\t\twhile(!goal_aEstrella)\r\n\t\t{\r\n\t\t\tvisited.add(current.getState());\r\n\t\t\tchildren = Successor.findChildren(current.getState());\r\n\t\t\t\r\n\t\t\tfor (String a : children)\r\n\t\t\t{\r\n\t\t\t\t\r\n\t\t\t\tif (visited.contains(a))\r\n\t\t\t\t{\r\n\t\t\t\t\tcontinue;\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\t\r\n\t\t\t\t\tNode nino = new Node(a);\r\n\t\t\t\t\tcurrent.children_nodes.add(nino);\r\n\t\t\t\t\tvisited.add(nino.getState());\r\n\t\t\t\t\t\r\n\t\t\t\t\tint cost = isCost(current.getState(), nino.getState());\r\n\t\t\t\t\tnino.cost = cost;\r\n\t\t\t\t\tnino.parent = current;\r\n\t\t\t\t\tint greedy_cost = greedybfsCost(nino.getState(), root_aEstrella.getState());\r\n\t\t\t\t\tnino.setTotalCost(nino.parent.getTotalCost() + nino.cost);\r\n\t\t\t\t\t\r\n\t\t\t\t\t// f(n) = g(n) + h(n)\r\n\t\t\t\t\tnino.setHeuristicCost(nino.getTotalCost() + greedy_cost);\r\n\t\t\t\t\t\r\n\t\t\t\t\tif (!queue_gbfs.contains(nino))\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tqueue_gbfs.add(nino);\r\n\t\t\t\t\t\tpq_size++;\r\n\t\t\t\t\t}\r\n\t\t\t\t\t\r\n\t\t\t\t\t// Repeated State checking. Removing the same node from PQ if the path cost is less then the current one \r\n\t\t\t\t\telse if (queue_gbfs.contains(nino))\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tfor (Node original : queue_gbfs)\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\tif (original.equals(nino))\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tNode copy = original;\r\n\t\t\t\t\t\t\t\tif (nino.getHeuristicCost() < copy.getHeuristicCost())\r\n\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\tqueue_gbfs.remove(copy);\r\n\t\t\t\t\t\t\t\t\tqueue_gbfs.add(nino);\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t\t\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\tcurrent = queue_gbfs.poll();\r\n\t\t\tnodes_popped++;\r\n\t\t\t\r\n\t\t\tif (pq_size > pqueue_max_size)\r\n\t\t\t{\r\n\t\t\t\tpqueue_max_size = pq_size;\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\tpq_size--;\r\n\t\t\tgoal_aEstrella = isGoal(current.getState());\r\n\t\t\t\r\n\t\t}\r\n\t\t\r\n\t\tgoal_aEstrella = false;\r\n\t\tSystem.out.println(\"A* Solved!!\");\r\n\t\tSolution.performSolution(current, root_aEstrella, nodes_popped, pqueue_max_size);\r\n\t}","public static void computeChildren() {\n\t\tArrayList<BNNode> children = new ArrayList<BNNode>();\n\t\t// For each node, build an array of children by checking which nodes have it as a parent.\n\t\tfor (BNNode node : nodes) {\n\t\t\tchildren.clear();\n\t\t\tfor (BNNode node2 : nodes) {\n\t\t\t\tif (node == node2)\n\t\t\t\t\tcontinue;\n\t\t\t\tfor (BNNode node3 : node2.parents)\n\t\t\t\t\tif (node3 == node)\n\t\t\t\t\t\tchildren.add(node2);\n\t\t\t}\n\t\t\tnode.children = new BNNode[children.size()];\n\t\t\tnode.children = (BNNode[]) children.toArray(node.children);\n\t\t}\n\t}","@Override\n\tpublic void run() {\n\t\tMap<Integer, Integer> roots = new TreeMap<Integer, Integer>();\n\t\t\n\t\tEdge[] edges = new Edge[this.edges.length];\n\t\tint n, weight, relevantEdges, root, lowerBound = 0;\n\t\n\t\t// Sort edges by weight.\n\t\tquickSort(0, this.edges.length - 1);\n\t\n\t\t// Compute initial lower bound (best k - 1 edges).\n\t\t// Choosing the cheapest k - 1 edges is not very intelligent. There is no guarantee\n\t\t// that this subset of edges even induces a subgraph over the initial graph.\n\t\t// TODO: Find a better initial lower bound.\n\t\tfor (int i = 0; i < solution.length; i++) {\n\t\t\tlowerBound += this.edges[i].weight;\n\t\t}\n\t\n\t\t// Iterate over all nodes in the graph and run Prim's algorithm\n\t\t// until k - 1 edges are fixed.\n\t\t// As all induced subgraphs have k nodes and are connected according to Prim, they\n\t\t// are candidate solutions and thus submitted.\n\t\tfor (root = 0; root < taken.length; root++) {\n\t\t\ttaken = new boolean[taken.length];\n\t\t\tSystem.arraycopy(this.edges, 0, edges, 0, this.edges.length);\n\n\t\t\ttaken[root] = true;\n\t\t\tn = 0;\n\t\t\tweight = 0;\n\t\t\trelevantEdges = this.edges.length;\n\n\t\t\twhile (n < solution.length) { \n\t\t\t\tfor (int i = 0; i < relevantEdges; i++) {\n\t\t\t\t\t// XOR to check if connected and no circle.\n\t\t\t\t\tif (taken[edges[i].node1] ^ taken[edges[i].node2]) {\n\t\t\t\t\t\ttaken[taken[edges[i].node1] ? edges[i].node2 : edges[i].node1] = true;\n\t\t\t\t\t\tsolution[n++] = edges[i];\n\t\t\t\t\t\tweight += edges[i].weight;\n\t\t\t\t\t\tSystem.arraycopy(edges, i + 1, edges, i, --relevantEdges - i);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\t// Check for circle.\n\t\t\t\t\telse if (taken[edges[i].node1]) {\n\t\t\t\t\t\tSystem.arraycopy(edges, i + 1, edges, i, --relevantEdges - i);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t// Sum up what we've just collected and submit this\n\t\t\t// solution to the framework.\n\t\t\tHashSet<Edge> set = new HashSet<Edge>(solution.length);\n\t\t\tfor (int i = 0; i < solution.length; i++) {\n\t\t\t\tset.add(solution[i]);\n\t\t\t}\n\t\t\tsetSolution(weight, set);\n\t\t\troots.put(weight, root);\n\t\t}\n\n\t\t// Now for the real business, let's do some Branch-and-Bound. Roots of \"k Prim Spanning Trees\"\n\t\t// are enumerated by weight to increase our chances to obtain the kMST earlier.\n\t\tfor (int item : roots.values()) {\n\t\t\ttaken = new boolean[taken.length];\n\t\t\tSystem.arraycopy(this.edges, 0, edges, 0, this.edges.length);\n\t\t\ttaken[item] = true;\n\t\t\tbranchAndBound(edges, solution.length, 0, lowerBound);\n\t\t}\n\t}","@Override\n List<NodeData> pathFind() throws NoPathException {\n System.out.println(\"Starting Scenic\");\n\n frontier.add(start);\n\n while(!frontier.isEmpty()) {\n StarNode current = frontier.getLast();\n frontier.removeLast(); // pop the priority queue\n if(current.getXCoord() == goal.getXCoord() && current.getYCoord() == goal.getYCoord()) {\n // If we are at the goal, we need to backtrack through the shortest path\n System.out.println(\"At target!\");\n finalList.add(current); // we have to add the goal to the path before we start backtracking\n while(!(current.getXCoord() == start.getXCoord() && current.getYCoord() == start.getYCoord())) {\n finalList.add(current.getPreviousNode());\n current = current.getPreviousNode();\n System.out.println(current.getNodeID());\n }\n return finalList;\n }\n else {\n // we need to get all the neighbor nodes, identify their costs, and put them into the queue\n LinkedList<StarNode> neighbors = current.getNeighbors();\n // we also need to remove the previous node from the list of neighbors because we do not want to backtrack\n neighbors.remove(current.getPreviousNode());\n\n for (StarNode newnode : neighbors) {\n int nodePlace = this.listContainsId(frontier, newnode);\n if(nodePlace > -1) {\n if (frontier.get(nodePlace).getF() > actionCost(newnode) + distanceToGo(newnode, goal)) {\n System.out.println(\"Here\");\n frontier.remove(frontier.get(nodePlace));\n newnode.setPreviousNode(current);\n frontier.add(newnode);\n newnode.setF(actionCost(newnode) + distanceToGo(newnode, goal));\n }\n }\n else {\n newnode.setPreviousNode(current);\n frontier.add(newnode);\n newnode.setF(actionCost(newnode) + distanceToGo(newnode, goal));\n }\n\n // This fixes the problem with infinitely looping elevators (I hope)\n if(current.getNodeType().equals(\"ELEV\") && newnode.getNodeType().equals(\"ELEV\")) {\n for (Iterator<StarNode> iterator = newnode.neighbors.iterator(); iterator.hasNext();) {\n StarNode newneighbor = iterator.next();\n if (newneighbor.getNodeType().equals(\"ELEV\")) {\n // Remove the current element from the iterator and the list.\n iterator.remove();\n }\n }\n }\n if(current.getNodeType().equals(\"STAI\") && newnode.getNodeType().equals(\"STAI\")) {\n for (Iterator<StarNode> iterator = newnode.neighbors.iterator(); iterator.hasNext();) {\n StarNode newneighbor = iterator.next();\n if (newneighbor.getNodeType().equals(\"STAI\")) {\n // Remove the current element from the iterator and the list.\n iterator.remove();\n }\n }\n }\n // this is where the node is put in the right place in the queue\n Collections.sort(frontier);\n }\n }\n }\n throw new NoPathException(start.getLongName(), goal.getLongName());\n }","protected void createTree() {\n\n\t\tint nextPlayer = opponent;\n\n\t\tQueue<Node> treeQueue = new LinkedList<Node>();\n\t\tWinChecker winCheck = new WinChecker();\n\n\t\ttreeQueue.add(parent);\n\n\t\twhile (!treeQueue.isEmpty()) {\n\t\t\tNode currentNode = treeQueue.poll();\n\n\t\t\tif (currentNode.getMove().Row != -1\n\t\t\t\t\t&& currentNode.getMove().Col != -1) {\n\t\t\t\tgb.updateBoard(currentNode.getMove());\n\n\t\t\t\tif (winCheck.getWin(gb) >= 0) {\n\t\t\t\t\tgb.revertBoard(currentNode.getMove());\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tgb.revertBoard(currentNode.getMove());\n\t\t\t}\n\n\t\t\t// Restricting the depth to which we will create the tree\n\t\t\tif (currentNode.getPly() > 2) {\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tfor (List<Hexagon> tempList : this.gb.getBoard()) {\n\t\t\t\tfor (Hexagon tempHex : tempList) {\n\n\t\t\t\t\tif (tempHex == null) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (tempHex.getValue() == EMPTY) {\n\n\t\t\t\t\t\tif (currentNode.getPly() % 2 == 0) {\n\t\t\t\t\t\t\tnextPlayer = opponent;\n\t\t\t\t\t\t} else if (currentNode.getPly() % 2 == 1) {\n\t\t\t\t\t\t\tnextPlayer = player;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tMove nextMove = new Move(nextPlayer, false,\n\t\t\t\t\t\t\t\ttempHex.getRow(), tempHex.getColumn());\n\n\t\t\t\t\t\tNode newNode = new Node(currentNode.getPly() + 1,\n\t\t\t\t\t\t\t\tnextMove);\n\t\t\t\t\t\tnewNode.setParent(currentNode);\n\n\t\t\t\t\t\tcurrentNode.children.add(newNode);\n\n\t\t\t\t\t\ttreeQueue.add(newNode);\n\t\t\t\t\t\ttempHex.setValue(EMPTY);\n\t\t\t\t\t}// End of if statement\n\n\t\t\t\t}// End of inner ForLoop\n\t\t\t}// End of outer ForLoop\n\n\t\t\t// currentNode.printChildren();\n\n\t\t}// End of While Loop\n\n\t}","public void RecursiveExpansion() throws TreeTooBigException {\r\n int transIndex; //Index to count transitions\r\n int[] newMarkup; //markup used to create new node\r\n boolean aTransitionIsEnabled = false; //To check for deadlock\r\n //Attribute used for assessing whether a node has occured before\r\n boolean repeatedNode = false; \r\n \r\n boolean allOmegas = false;\r\n \r\n boolean[] enabledTransitions = \r\n tree.dataLayer.getTransitionEnabledStatusArray(markup);\r\n\r\n //For each transition\r\n for (int i = 0; i < enabledTransitions.length; i++) {\r\n if (enabledTransitions[i] == true) {\r\n //Set transArray of to true for this index\r\n transArray[i] = true;\r\n \r\n //System.out.println(\"\\n Transition \" + i + \" Enabled\" );\r\n aTransitionIsEnabled = true;\r\n \r\n //print (\"\\n Old Markup is :\", markup);//debug\r\n \r\n //Fire transition to produce new markup vector\r\n newMarkup = fire(i);\r\n \r\n //print (\"\\n New Markup is :\", newMarkup);//debug\r\n \r\n //Check for safeness. If any of places have > 1 token set variable.\r\n for (int j = 0; j < newMarkup.length; j++) {\r\n if (newMarkup[j] > 1 || newMarkup[j] == -1) {\r\n tree.moreThanOneToken = true;\r\n break;\r\n }\r\n } \r\n \r\n //Create a new node using the new markup vector and attach it to\r\n //the current node as a child.\r\n children[i] = \r\n new myNode(newMarkup, this, tree, depth + 1);\r\n \r\n /* Now need to (a) check if any omegas (represented by -1) need to \r\n * be inserted in the markup vector of the new node, and (b) if the \r\n * resulting markup vector has appeared anywhere else in the tree. \r\n * We must do (a) before (b) as we need to know if the new node \r\n * contains any omegas to be able to compare it with existing nodes. \r\n */ \r\n allOmegas = children[i].InsertOmegas();\r\n \r\n //check if the resulting markup vector has occured anywhere else in the tree\r\n repeatedNode = (tree.root).FindMarkup(children[i]);\r\n \r\n if (tree.nodeCount >= Pipe.MAX_NODES && !tree.tooBig) {\r\n tree.tooBig = true;\r\n throw new TreeTooBigException();\r\n }\r\n \r\n if (!repeatedNode && !allOmegas) {\r\n children[i].RecursiveExpansion();\r\n }\r\n }\r\n }\r\n \r\n if (!aTransitionIsEnabled) {\r\n System.err.println(\"No transition enabled\");\r\n if (!tree.noEnabledTransitions || tree.pathToDeadlock.length < depth-1) {\r\n RecordDeadlockPath();\r\n tree.noEnabledTransitions = true;\r\n } else {\r\n System.err.println(\"Deadlocked node found, but path is not shorter\"\r\n + \" than current path.\");\r\n }\r\n } else {\r\n //System.out.println(\"Transitions enabled.\");\r\n }\r\n }","public Node solve()\n\t{\n\t\t// Initial problem state\n\t\tint[] initial_state = {0, 0};\n\n\t\t// Current node under consideration\n\t\tNode curr_node = new Node(initial_state, null, null);\n\n\t\t// List of frontier nodes at each iteration\n\t\t// Manipulated as a queue\n\t\tthis.frontier = new ArrayList<Node>();\n\n\t\t// List of nodes already explored\n\t\t// They are excluded from expanded frontier nodes at each iteration\n\t\tthis.explored = new ArrayList<int[]>();\n\n\t\tfrontier.add(curr_node);\n\n\t\twhile (true) {\n\t\t\t// If we have exhausted our frontier \n\t\t\t// we have no solution\n\t\t\tif (frontier.size() == 0) {\n\t\t\t\treturn null;\n\t\t\t}\n \n // Pop new node from frontier to consider\n\t\t\tcurr_node = frontier.remove(0);\n \n\t\t // Add chosen node to explored list if not already there\n\t\t\tif(!this.inExplored(curr_node.state)) {\n\t\t\t\texplored.add(curr_node.state);\t\t\t\t\n\t\t\t}\n\n // List of actions that can be applied based on the state\n // and the description of the problem\n\t\t\tAction[] actions = this.getFeasibleActions(curr_node.state);\n\n // Apply our transition model to generate child nodes \n // from current node\n\t\t\tfor (Action action : actions) {\n\t\t\t\tNode child = this.getChildNode(curr_node, action);\t\t\n\t\t\t\t\n\t\t\t\tif (!this.inFrontier(child) && !this.inExplored(child.state)) {\n\t\t\t\t\tif (this.isGoal(child.state)) {\n\t\t\t\t\t\treturn child;\n\t\t\t\t\t}\n\t\t\t\t\tfrontier.add(child);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}","public boolean bestFirstSearch() {\n\t\twhile(!soloution){\n\t\t\tif(open.isEmpty()){\n\t\t\t\tSystem.out.println(\"No more choices to explore\");\n\t\t\t\tSystem.out.println(\"SolutionId: \" + solutionId);\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\t//chooses the most optimal X\n\t\t\tNode x = popNode();\n\t\t\tclosed.add(x);\n\t\t\tSystem.out.println(\"X:\\t\\t\" + x.state + \" \" + x.h + \" + \" + x.g + \" = \" + x.f);\n\t\t\t//checks if it is a soulution\n\t\t\tif(solution(x)){\n\t\t\t\tSystem.out.println(\"SOLUTION:\\t\" + x.state);\n\t\t\t\tSystem.out.println(\"nodes created: \" + open.size() + closed.size());\n\t\t\t\tprintSolution(x);\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\t//handles the possible moves from the state x\n\t\t\tsucc = generateAllSuccesors(x);\n\t\t\tfor (Node s : succ) {\n\t\t\t\t//if this state already exist, we will use the node keeping it instead\n\t\t\t\tNode old = findOld(s);\n\t\t\t\tif(old != null)\n\t\t\t\t\ts = old;\n\t\t\t\t//makes the new node a child of x\n\t\t\t\tx.kids.add(s);\n\t\t\t\t//if its a new state it will be inserted to open after evaluation\n\t\t\t\tif(!open.contains(s) && !closed.contains(s)){\n\t\t\t\t\tattachAndEval(s,x);\n\t\t\t\t\tinsert(s);\n\t\t\t\t}\n\t\t\t\t//if its an old node and x is a better parent it will be evalueted again.\n\t\t\t\telse if(x.g + arcCost(x, s) < s.g){\n\t\t\t\t\tattachAndEval(s, x);\n\t\t\t\t\tif(closed.contains(s)){\n\t\t\t\t\t\t//if its closed all children will be evaluated with the new score of \"s\"\n\t\t\t\t\t\tpropagatePathImprovements(s);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}","private List<Path> expandExecution(Path input) {\n\t\tList<Path> childInputs = new ArrayList<>(); //store the paths generated from given path\n\t\t\n\t\t//search from the top node which have not been searched before\n\t\tfor(int j = input.bound; j < input.path.size() - 1; j++){\n\t\t\tdouble[] probabilityArray = cfg.getTransition_matrix().getRow(input.path.get(j));\n\t\t\tfor(int i = 0; i < probabilityArray.length; i++){\n\t\t\t\t//the node been visited before only have two situation:1.has been searched,2.the path contains it in the workList \n\t\t\t\tif(probabilityArray[i] > 0 && i != input.path.get(j + 1) && unvisited.contains(i)){\n\t\t\t\t\tList<Integer> tempPath = new ArrayList<>();\n\t\t\t\t\tfor(int index = 0; index < j + 1; index++)\n\t\t\t\t\t\ttempPath.add(input.path.get(index));\n\t\t\t\t\ttempPath.add(i);\n\t\t\t\t\t\n\t\t\t\t\tPath newInput = new Path(tempPath, j + 1);\n\t\t\t\t\tchildInputs.add(newInput);\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\treturn childInputs;\n\t}","private int evaluateChildren() {\n if (PRINT_PROGRESS) {\n System.out.println(\"Evaled:\"+boardsEvaluated);\n }\n if (this.children == null || this.children.isEmpty()) { // Exit case: Node is a leaf\n return evaluateBoard(this.board);\n }\n \n int bestEval = Integer.MIN_VALUE;\n for (final BoardTree child : this.children) {\n child.evaluation = child.evaluateChildren();\n if (child.evaluation > bestEval) {\n bestEval = child.evaluation;\n }\n }\n return bestEval;\n }","public static void bfs (String input)\r\n\t{\r\n\t\tNode root_bfs = new Node (input);\r\n\t\tNode current = new Node(root_bfs.getState());\r\n\t\t\r\n\t\tArrayList<String> visited = new ArrayList<String>();\r\n\t\tArrayList<String> children = new ArrayList<String>();\r\n\t\tQueue<Node> queue_bfs = new LinkedList<Node>();\r\n\t\t\r\n\t\tint nodes_popped = 0;\r\n\t\tint queue_max_size = 0;\r\n\t\tint queue_size = 0;\r\n\t\tcurrent.cost = 0;\r\n\t\t\r\n\t\t// Initial check for goal state\r\n\t\tgoal_bfs = isGoal(current.getState());\r\n\t\t\r\n\t\twhile(!goal_bfs)\r\n\t\t{\r\n\t\t\t// Add the current node to the visited array\r\n\t\t\tvisited.add(current.getState());\r\n\t\t\t// Get the nodes children from the successor function\r\n\t\t\tchildren = Successor.findChildren(current.getState());\r\n\t\t\t\r\n\t\t\tfor (String a : children)\r\n\t\t\t{\r\n\t\t\t\t// State checking, don't add already visited nodes to the queue\r\n\t\t\t\tif (visited.contains(a))\r\n\t\t\t\t{\r\n\t\t\t\t\tcontinue;\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\t\t// Create child node from the children array and add it to the current node\r\n\t\t\t\t\tNode nino = new Node(a);\r\n\t\t\t\t\tcurrent.children_nodes.add(nino);\r\n\t\t\t\t\t\r\n\t\t\t\t\t// Obtaining the path cost\r\n\t\t\t\t\tint cost = isCost(current.getState(), nino.getState());\r\n\t\t\t\t\tnino.cost = cost;\r\n\t\t\t\t\tnino.parent = current;\r\n\t\t\t\t\t\r\n\t\t\t\t\t// State check and adding the child to the queue. Increasing size counter\r\n\t\t\t\t\tif (!queue_bfs.contains(nino))\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tqueue_bfs.add(nino);\r\n\t\t\t\t\t\tqueue_size++;\r\n\t\t\t\t\t}\r\n\t\t\t\t\t\r\n\t\t\t\t\t\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t// Pop a node off the queue\r\n\t\t\tcurrent = queue_bfs.poll();\r\n\t\t\tnodes_popped++;\r\n\t\t\t\r\n\t\t\t// Added this because my queue size variable was always one off based on where my goal check is\r\n\t\t\tif (queue_size > queue_max_size)\r\n\t\t\t{\r\n\t\t\t\tqueue_max_size = queue_size;\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t// Decrease queue size because a node has been popped and check for goal state\r\n\t\t\tqueue_size--;\r\n\t\t\tgoal_bfs = isGoal(current.getState());\r\n\t\t\t\r\n\t\t}\r\n\t\t\r\n\t\t// Now that a solution has been found, set the boolean back to false for another run\r\n\t\tgoal_bfs = false;\r\n\t\tSystem.out.println(\"BFS Solved!!\");\r\n\t\t\r\n\t\t// Send metrics to be printed to the console\r\n\t\tSolution.performSolution(current, root_bfs, nodes_popped, queue_max_size);\r\n\t\t\t\r\n\t}","public void dfs (String input)\r\n\t {\r\n\t\t \tNode root_dfs = new Node (input);\r\n\t\t \tNode current = new Node(root_dfs.getState());\r\n\t\t \t\r\n\t\t\tArrayList<String> visited = new ArrayList<String>();\r\n\t\t\tArrayList<String> children = new ArrayList<String>();\r\n\t\t\tStack<Node> stack_dfs = new Stack<Node>();\r\n\t\t\t\r\n\t\t\tint nodes_popped = 0;\r\n\t\t\tint stack_max_size = 0;\r\n\t\t\tint stack_size = 0;\r\n\t\t\tcurrent.cost = 0;\r\n\t\t\t\r\n\t\t\tgoal_dfs = isGoal(current.getState());\r\n\t\t\t\r\n\t\t\twhile(!goal_dfs)\r\n\t\t\t{\r\n\t\t\t\tvisited.add(current.getState());\r\n\t\t\t\tchildren = Successor.findChildren(current.getState());\r\n\t\t\t\t\r\n\t\t\t\tfor (String a : children)\r\n\t\t\t\t{\r\n\t\t\t\t\t\r\n\t\t\t\t\tif (visited.contains(a))\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tcontinue;\r\n\t\t\t\t\t}\r\n\t\t\t\t\t\r\n\t\t\t\t\t\tNode nino = new Node(a);\r\n\t\t\t\t\t\tcurrent.children_nodes.add(nino);\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tint cost = isCost(current.getState(), nino.getState());\r\n\t\t\t\t\t\tnino.cost = cost;\r\n\t\t\t\t\t\tnino.parent = current;\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t// Repeated state check\r\n\t\t\t\t\t\tif (!stack_dfs.contains(nino))\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\tstack_dfs.add(nino);\r\n\t\t\t\t\t\t\tstack_size++;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\t// Popping off the stack. LIFO architecture\r\n\t\t\t\tcurrent = stack_dfs.pop();\r\n\t\t\t\tnodes_popped++;\r\n\t\t\t\t\r\n\t\t\t\tif (stack_size > stack_max_size)\r\n\t\t\t\t{\r\n\t\t\t\t\tstack_max_size = stack_size;\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\tstack_size--;\r\n\t\t\t\tgoal_dfs = isGoal(current.getState());\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\tgoal_dfs = false;\r\n\t\t\tSystem.out.println(\"DFS Solved!!\");\r\n\t\t\tSolution.performSolution(current, root_dfs, nodes_popped, stack_max_size);\r\n\t }","private static BoardNode startGreedyDepthFirst(int steps, BoardNode node){\n count = 1;\n return greedyDepthFirst(steps, node);\n }","public ReturnClass astar_algo(){\n long start=System.nanoTime();\n TreeStar node=new TreeStar(variables,0);\n openList.push(node);\n\n while (!openList.isEmpty())\n {\n\n TreeStar temp= openList.pollLast(); //pop the highest scoring node in openList\n refreshUsage(temp.variables); //uses the current node variables to update usageArray\n\n if((System.nanoTime()-start)/1000000000>=maxTime){\n System.out.println(\"time limit reached\");\n ReturnClass returnClass= new ReturnClass(temp.variables,temp.score,false);\n return returnClass;\n }\n\n if(temp.score==nbC){\n System.out.println(\"solution trouvée !\");\n printArray(temp.variables);\n ReturnClass returnClass= new ReturnClass(temp.variables,temp.score,true);\n return returnClass;\n }\n\n int bestVar=0;\n if(heuristic.equals(\"TD Heuristic\")){\n bestVar= chooseVTD(); //get the highest scoring unused var to use it in children\n }\n else if(heuristic.equals(\"TD-long heuristic\")){\n bestVar=chooseVTD();\n }\n else if(heuristic.equals(\"Partial-diff Heuristic\")){\n bestVar= chooseVDiff(temp.variables); //get the highest scoring unused var to use it in children\n }\n else {\n bestVar= chooseVDiff(temp.variables);\n }\n\n\n TreeStar node1= nextVar(temp.variables, 0,bestVar,temp.profondeur+1);\n TreeStar node2= nextVar(temp.variables, 1,bestVar,temp.profondeur+1);\n\n if(node1!=null){\n addToOpenList(node1);\n addToOpenList(node2);\n }\n }\n\n System.out.println(\"solution non trouvée\");\n return null;\n }","private int heuristic(Node node, int currentDepth) {\n\n int ef, w1 = 1, w2 = 1, w3 = 0, w4 = 10, w5 = 1, w6 = 35, e1 = 0, e2 = 0, e3 = 0, e4 = 0, e5 = 0, e6 = 0;\n\n int ourSeedsInStore = node.getBoard().getSeedsInStore(ourSide);\n int oppSeedsInStore = node.getBoard().getSeedsInStore(ourSide.opposite());\n\n\n // hardcode fix.\n int parentOurSeedsInStore = 0;\n int parentOppSeedsInStore = 0;\n int parentMove = 0;\n int parentOurSeedsInHouse = 0;\n int parentOppSeedsInHouse = 0;\n\n if (currentDepth != 1) {\n parentOurSeedsInStore = node.getParent().getBoard().getSeedsInStore(ourSide);\n parentOppSeedsInStore = node.getParent().getBoard().getSeedsInStore(ourSide.opposite());\n parentMove = node.getName();\n parentOurSeedsInHouse = node.getParent().getBoard().getSeeds(ourSide, parentMove);\n parentOppSeedsInHouse = node.getParent().getBoard().getSeeds(ourSide.opposite(), parentMove);\n }\n\n int ourFreeHouse = 0;\n int oppFreeHouse = 0;\n int ourSeeds = ourSeedsInStore;\n int oppSeeds = oppSeedsInStore;\n\n int asdf1 = ourSeedsInStore - parentOurSeedsInStore;\n int asdf2 = oppSeedsInStore - parentOppSeedsInStore;\n\n e6 = asdf1 - asdf2;\n\n for (int i = 1; i <= 7; i++) {\n ourSeeds += node.getBoard().getSeeds(ourSide, i);\n oppSeeds += node.getBoard().getSeeds(ourSide.opposite(), i);\n }\n\n for (int i = 1; i <= 7; i++) {\n if (node.getBoard().getSeeds(ourSide, i) == 0)\n ourFreeHouse++;\n if (node.getBoard().getSeeds(ourSide.opposite(), i) == 0)\n oppFreeHouse++;\n }\n\n e1 = ourSeeds - oppSeeds;\n e2 = ourFreeHouse - oppFreeHouse;\n\n // hardcode fix.\n if (currentDepth != 1) {\n if (node.getParent().getPlayerSide() == this.getOurSide()) {\n // if last move puts seed into store\n if ((parentMove + parentOurSeedsInHouse) % 8 == 0) {\n e4 = 1;\n e3 = (parentMove + parentOurSeedsInHouse) / 8;\n } else if (parentMove + parentOurSeedsInStore > 8) {\n e4 = 0;\n e3 = (parentMove + parentOurSeedsInStore) / 8;\n }\n\n for (int i = 1; i <= 7; i++) {\n int parentOurSeedsInCurrentHouse = node.getParent().getBoard().getSeeds(ourSide, i);\n int parentOppSeedsInFrontHouse = node.getParent().getBoard().getSeeds(ourSide.opposite(), 8 - i);\n int oppSeedsInFrontHouse = node.getBoard().getSeeds(ourSide.opposite(), 8 - i);\n // if there's no seed in current house && there is seed right in front of us\n if ((parentOurSeedsInCurrentHouse == 0 || parentOurSeedsInCurrentHouse == 15) && parentOppSeedsInFrontHouse != 0 && oppSeedsInFrontHouse == 0) {\n if (currentDepth != 2) {\n if (node.getParent().getParent().getPlayerSide() == this.getOurSide()) {\n w5 = 5;\n e5 = parentOppSeedsInFrontHouse;\n break;\n }\n }\n e5 = parentOppSeedsInFrontHouse;\n break;\n }\n\n }\n } else if (node.getParent().getPlayerSide() == this.getOurSide().opposite()) {\n\n if (parentMove + parentOppSeedsInHouse == 8) {\n e4 = -1;\n e3 = -1 * (parentMove + parentOppSeedsInHouse) / 8;\n } else if (parentMove + parentOppSeedsInStore > 8) {\n e4 = 0;\n e3 = -(parentMove + parentOppSeedsInStore) / 8;\n }\n\n\n for (int i = 1; i <= 7; i++) {\n int parentOppSeedsInCurrentHouse = node.getParent().getBoard().getSeeds(ourSide.opposite(), i);\n int parentOurSeedsInFrontHouse = node.getParent().getBoard().getSeeds(ourSide, 8 - i);\n int oppSeedsInCurrentHouse = node.getBoard().getSeeds(ourSide, 8 - i);\n\n if ((parentOppSeedsInCurrentHouse == 0 || parentOppSeedsInCurrentHouse == 15) && parentOurSeedsInFrontHouse != 0 && oppSeedsInCurrentHouse == 0) {\n if (currentDepth != 2) {\n if (node.getParent().getParent().getPlayerSide() == this.getOurSide()) {\n w5 = 5;\n e5 = -parentOurSeedsInFrontHouse;\n break;\n }\n }\n w5 = 5;\n e5 = -parentOurSeedsInFrontHouse;\n break;\n }\n }\n }\n }\n ef = w1 * e1 + w2 * e2 + w3 * e3 + w4 * e4 + w5 * e5 + w6 * e6;\n return ef;\n }","public static ArrayList<Node> getChildren(Node current) {\r\n\r\n ArrayList<Node> OpChild = new ArrayList<Node>();\r\n if (current.getParentMove() == null) current.setParentMove(\"\");\r\n if (current.getDirection()==null) current.setDirection(\"\");\r\n int i_Zero = 0, j_Zero = 0;\r\n int[][] CurrState = current.mat;\r\n /*\r\n explain for the fucntions\r\n the function get node and the list. check the border and the parent.\r\n swap the state matrix and then create Node with state mat.\r\n set to the node the cost the direction iterazit and it to the list.\r\n after that add it to the list.\r\n */\r\n\r\n DobleLeft(current, OpChild);\r\n DoubleUp(current, OpChild);\r\n\r\n DoubleRight(current, OpChild);\r\n DoubleDown(current, CurrState, OpChild);\r\n// for the first zero\r\n leftMove(current, current.zero1[0], current.zero1[1], OpChild);\r\n upMove(current, current.zero1[0], current.zero1[1], OpChild);\r\n rightMove(current, current.zero1[0], current.zero1[1], OpChild);\r\n downMove(current, current.zero1[0], current.zero1[1], OpChild);\r\n // check if has 2 zeros\r\n if (current.zero2[0]!=-1) {\r\n leftMove(current, current.zero2[0], current.zero2[1], OpChild);\r\n upMove(current, current.zero2[0], current.zero2[1], OpChild);\r\n rightMove(current, current.zero2[0], current.zero2[1], OpChild);\r\n downMove(current, current.zero2[0], current.zero2[1], OpChild);\r\n\r\n }\r\n return OpChild;\r\n }","private MoveTree generateTree() {\n\n\t\tArrayList<MoveTree> leaves = new ArrayList<>();\n\n\t\tMoveTree tree = new MoveTree(Main.getSWController().getGame().getCurrentGameState());\n\t\tleaves.add(tree);\n\n\t\tfinal Flag flag = new Flag(), finished = new Flag();\n\n\t\tTimer timer = new Timer(true);\n\t\ttimer.schedule(new TimerTask() {\n\t\t\t@Override\n\t\t\tpublic void run() {\n\t\t\t\tsynchronized (flag) {\n\t\t\t\t\tif (!finished.value)\n\t\t\t\t\t\tflag.value = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}, 9000);\n\n\t\twhile (true) {\n\t\t\tArrayList<MoveTree> newLeaves = new ArrayList<>();\n\t\t\tfor (MoveTree leaf : leaves) {\n\t\t\t\tGameState state = leaf.getState();\n\t\t\t\tPlayer currentPlayer = state.getPlayer();\n\n\t\t\t\tfor (Card handcard : currentPlayer.getHand()) {\n\t\t\t\t\tBuildCapability capability = Main.getSWController().getPlayerController().canBuild(currentPlayer, handcard, state);\n\t\t\t\t\tswitch (capability) {\n\t\t\t\t\tcase FREE:\n\t\t\t\t\tcase OWN_RESOURCE:\n\t\t\t\t\t\tMove move = new Move(handcard, Action.BUILD);\n\t\t\t\t\t\tMoveTree newTree = new MoveTree(move, doMove(move, currentPlayer, state));\n\t\t\t\t\t\tnewLeaves.add(newTree);\n\t\t\t\t\t\tleaf.addChild(newTree);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase TRADE:\n\t\t\t\t\t\tTradeOption trade = Main.getSWController().getPlayerController().getTradeOptions(currentPlayer, handcard.getRequired(), state).get(0);\n\t\t\t\t\t\tMove tradeMove = new Move(handcard, Action.BUILD);\n\t\t\t\t\t\ttradeMove.setTradeOption(trade);\n\t\t\t\t\t\tMoveTree newTree2 = new MoveTree(tradeMove, doMove(tradeMove, currentPlayer, state));\n\t\t\t\t\t\tnewLeaves.add(newTree2);\n\t\t\t\t\t\tleaf.addChild(newTree2);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tdefault:\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (currentPlayer.getBoard().nextSlot() != -1) {\n\t\t\t\t\t\tArrayList<Resource> slotRequirements = new ArrayList<>(Arrays.asList(currentPlayer.getBoard().getNextSlotRequirement()));\n\t\t\t\t\t\tcapability = Main.getSWController().getPlayerController().hasResources(currentPlayer, slotRequirements, state);\n\t\t\t\t\t\tswitch (capability) {\n\t\t\t\t\t\tcase OWN_RESOURCE:\n\t\t\t\t\t\t\tMove move = new Move(handcard, Action.PLACE_SLOT);\n\t\t\t\t\t\t\tMoveTree newTree = new MoveTree(move, doMove(move, currentPlayer, state));\n\t\t\t\t\t\t\tnewLeaves.add(newTree);\n\t\t\t\t\t\t\tleaf.addChild(newTree);\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tcase TRADE:\n\t\t\t\t\t\t\tTradeOption trade = Main.getSWController().getPlayerController().getTradeOptions(currentPlayer, slotRequirements, state).get(0);\n\t\t\t\t\t\t\tMove tradeMove = new Move(handcard, Action.PLACE_SLOT);\n\t\t\t\t\t\t\ttradeMove.setTradeOption(trade);\n\t\t\t\t\t\t\tMoveTree newTree2 = new MoveTree(tradeMove, doMove(tradeMove, currentPlayer, state));\n\t\t\t\t\t\t\tnewLeaves.add(newTree2);\n\t\t\t\t\t\t\tleaf.addChild(newTree2);\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tMove sellmove = new Move(handcard, Action.SELL);\n\t\t\t\t\tMoveTree selltree = new MoveTree(sellmove, doMove(sellmove, currentPlayer, state));\n\t\t\t\t\tnewLeaves.add(selltree);\n\t\t\t\t\tleaf.addChild(selltree);\n \n\t\t\t\t\tif (!currentPlayer.isOlympiaUsed() && !Main.getSWController().getCardController().hasCard(currentPlayer, handcard.getInternalName())) {\n\t\t\t\t\t\tMove olympiamove = new Move(handcard, Action.OLYMPIA);\n\t\t\t\t\t\tMoveTree olympiatree = new MoveTree(olympiamove, doMove(olympiamove, currentPlayer, state));\n\t\t\t\t\t\tnewLeaves.add(olympiatree);\n\t\t\t\t\t\tleaf.addChild(olympiatree);\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tsynchronized (flag) {\n\t\t\t\t\tif (flag.value) {\n\t\t\t\t\t\tfor (MoveTree child : leaves)\n\t\t\t\t\t\t\tchild.getChildren().clear();\n\t\t\t\t\t\treturn tree;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tboolean breakAfterwards = false;\n\n\t\t\tfor (MoveTree newLeaf : newLeaves) {\n\t\t\t\tfor (Player player : newLeaf.getState().getPlayers()) {\n\t\t\t\t\tif (player.isMausoleum()) {\n\t\t\t\t\t\tCard card = getHalikarnassusCard(player, newLeaf.getState().getTrash(), newLeaf.getState());\n\t\t\t\t\t\tif (card == null)\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\tnewLeaf.getState().getTrash().remove(card);\n\t\t\t\t\t\tplayer.getBoard().addCard(card);\n\t\t\t\t\t\tif (card.getEffects() != null)\n\t\t\t\t\t\t\tfor (Effect effect : card.getEffects())\n\t\t\t\t\t\t\t\tif (effect.getType() == EffectType.WHEN_PLAYED)\n\t\t\t\t\t\t\t\t\teffect.run(player, Main.getSWController().getGame());\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tnewLeaf.getState().setCurrentPlayer((newLeaf.getState().getCurrentPlayer() + 1) % newLeaf.getState().getPlayers().size());\n\n\t\t\t\tif (newLeaf.getState().getCurrentPlayer() == newLeaf.getState().getFirstPlayer()) {\n\t\t\t\t\tif (newLeaf.getState().getRound() < GameController.NUM_ROUNDS)\n\t\t\t\t\t\tMain.getSWController().getGameController().nextRound(Main.getSWController().getGame(), newLeaf.getState());\n\t\t\t\t\telse // stop look-ahead at the end of age\n\t\t\t\t\t\tbreakAfterwards = true;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tleaves.clear();\n\t\t\tleaves.addAll(newLeaves);\n\n\t\t\tif (breakAfterwards)\n\t\t\t\tbreak;\n\t\t}\n\n\t\tfinished.value = true;\n\n\t\treturn tree;\n\t}","public static void generateTree(Node root){\n\n // If we hit the winning position or a draw, stop generating (Exit condition)\n if(defaultEvaluator.evaluate(root.getBoard()) != 0 || root.getBoard().getTurnNumber() == 9)\n return;\n\n // Else, keep generating recursively\n\n // Step0-Determine the turn player.\n GamePiece turnPlayer;\n if (root.getBoard().isXTurn()) {\n turnPlayer = GamePiece.X;\n }\n else {\n turnPlayer = GamePiece.O;\n }\n\n // Step1-generate a new board for every child of root\n int parentalBranches = root.getChildren().length;\n int childrenBranches = parentalBranches - 1;\n for(int i=0; i<parentalBranches; ++i){\n\n root.getChildren()[i] = new Node(childrenBranches);\n root.getChildren()[i].setBoard((Board)(root.getBoard().clone()));\n\n }\n\n // Step2-Place the pieces\n int childIndex=0;\n int placement = 0;\n while(childIndex<parentalBranches){\n\n try{\n\n root.getChildren()[childIndex].getBoard().set(placement %3, placement /3, turnPlayer);\n childIndex++;\n\n }catch(GridAlreadyChosenException ex){}\n placement++;\n\n }\n\n // Step3-Let the recursive madness begin. Call generateTree() on each child\n for (int i=0; i<parentalBranches; ++i)\n generateTree(root.getChildren()[i]);\n\n\n }","private boolean cycleCheck(Node current, Queue<Node> expanded){\n\n if( expanded.size() == 0){\n return false; //Because current is root\n }\n\n for(Node nodeInExpanded : expanded){\n\n if(current!=null && current.getDigit().getDigitString().equals(nodeInExpanded.getDigit().getDigitString())){\n //the digits are same so we check children.\n\n ArrayList<String> currentChildren = makeChildren(current);\n ArrayList<String> childrenOfExpanded = makeChildren(nodeInExpanded);\n\n int size;\n\n if(currentChildren.size() > childrenOfExpanded.size() ){\n size = childrenOfExpanded.size();\n }else if(currentChildren.size() < childrenOfExpanded.size()){\n size = currentChildren.size();\n }else{\n size = childrenOfExpanded.size();\n }\n /*\n I use the modulus operator so that I dont get a ArrayIndexOut of Bounds\n */\n\n if( currentChildren.size() == childrenOfExpanded.size()\n && currentChildren.get(0%size).equals(childrenOfExpanded.get(0%size))\n && currentChildren.get(1%size).equals(childrenOfExpanded.get(1%size))\n && currentChildren.get(2%size).equals(childrenOfExpanded.get(2%size))\n && currentChildren.get(3%size).equals(childrenOfExpanded.get(3%size))\n ){\n return true;\n }\n }\n }\n\n return false;\n }","public MoveNode ab(PentagoBoardState pbs,int myscore, int alpha, int beta,int amimaxplayer, int depth,int requireddepth){\n\n int bestmovescore;\n PentagoMove bestmove;\n\n ArrayList<PentagoMove> legalmoves = pbs.getAllLegalMoves();\n Collections.shuffle(legalmoves); //helps avoid worst run time if all good moves are at the end of array list\n\n MoveNode moveNode =new MoveNode(new PentagoMove(0,0,0,0,0),0);\n\n if (depth==requireddepth){\n bestmovescore= evaluate(pbs);\n moveNode.MyMove = null;\n moveNode.value = evaluate(pbs);\n return moveNode;\n\n }\n else if (pbs.getWinner() != Board.NOBODY){ //check win since we are at leafnode\n bestmovescore= evaluate(pbs);\n moveNode.MyMove = null;\n int movescore = evaluate(pbs);\n if (movescore<-1200000){\n moveNode.value = -999999999; //assign loss value\n } //Losing Move\n else if (movescore>1200000){\n moveNode.value = 999999999; //assign win value\n } // Winning Move\n return moveNode;\n\n }\n //do max player\n if (amimaxplayer ==1){\n int currentvalue = -999999999;\n PentagoMove currentmove =legalmoves.get(0);\n MoveNode currentmovenode = new MoveNode(currentmove,currentvalue);\n for (int i = 0; i < legalmoves.size(); i++) {\n PentagoBoardState newboard = (PentagoBoardState) pbs.clone();\n PentagoMove movetoprocess = legalmoves.get(i);\n newboard.processMove(movetoprocess);\n\n\n MoveNode scoreAfterMove = ab(newboard, currentvalue, alpha, beta, 0, depth + 1, requireddepth); // run recursion till leaf node or depth reached\n if (scoreAfterMove.value > currentvalue) { //see if current best value is lower than the new value if so replace\n currentvalue = scoreAfterMove.value;\n currentmove = movetoprocess;\n currentmovenode.value = currentvalue;\n currentmovenode.MyMove = currentmove;\n\n //System.out.println(\"I am max plyaer at depth:\" + depth + \"\\n current move is: \" + currentmove + \"\\ncurrentvalue is: \" + currentvalue);\n\n }\n\n alpha = Math.max(alpha,currentvalue);\n if (alpha>=beta){ // break loop if alpha more than beta\n //System.out.println(\"Get pruned my alpha is \" + alpha + \" my beta is \" + beta );\n break;\n }\n }\n //System.out.println(\"I am max plyaer at depth:\" + depth + \"\\n current move is: \" + currentmove + \"\\ncurrentvalue is: \" + currentvalue+\" my alpha is \" + alpha + \" my beta is \" + beta);\n\n return currentmovenode;\n }\n //do min player\n else if (amimaxplayer==0){\n int currentvalue = 999999999;\n PentagoMove currentmove =legalmoves.get(0);\n MoveNode currentmovenode = new MoveNode(currentmove,currentvalue);\n for (int i = 0; i < legalmoves.size(); i++) {\n PentagoBoardState newboard = (PentagoBoardState) pbs.clone();\n PentagoMove movetoprocess = legalmoves.get(i);\n newboard.processMove(movetoprocess);\n\n MoveNode scoreAfterMove = ab(newboard, currentvalue, alpha, beta, 1, depth + 1, requireddepth);\n if (scoreAfterMove.value < currentvalue) {\n currentvalue = scoreAfterMove.value;\n currentmove = movetoprocess;\n currentmovenode.value = currentvalue;\n currentmovenode.MyMove = currentmove;\n //System.out.println(\"I am min plyaer at depth:\" + depth + \"\\n current move is: \" + currentmove + \"\\ncurrentvalue is: \" + currentvalue);\n }\n beta = Math.min(beta,currentvalue);\n if (alpha>=beta){\n //System.out.println(\"Get pruned my alpha is \" + alpha + \" my beta is \" + beta );\n break;\n }\n }\n return currentmovenode;\n }\n //System.out.println(\"move val \" + moveNode.value);\n return moveNode;\n }","private void getAllNodesBreadthFirstSearch(List<Expression> nodesList)\n/* */ {\n/* 156 */ int indx = 0;\n/* 157 */ nodesList.add(this);\n/* */ \n/* 159 */ while (indx < nodesList.size()) {\n/* 160 */ Expression node = (Expression)nodesList.get(indx++);\n/* 161 */ for (Expression child : node.childs) {\n/* 162 */ nodesList.add(child);\n/* */ }\n/* */ }\n/* */ }","public static void main(String[] args) {\n\t\tScanner sc=new Scanner(System.in);\n\t\tn=sc.nextInt();\n\t\t\n\t\tint [][]arr=new int[n][n];\n\t\tint xShark=0;\n\t\tint yShark=0;\n\t\tint size=2;\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tfor(int j=0;j<n;j++) {\n\t\t\t\tarr[i][j]=sc.nextInt();\n\t\t\t\tif(arr[i][j]==9) {\n\t\t\t\t\txShark=i;\n\t\t\t\t\tyShark=j;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint go=0;\n\t\tint eat=0;\n\t\twhile(true) {\n\t\t\tList<Node> list=new ArrayList<>();\n\t\t\tnarr=new int[n][n];\n\t\t\tint min=Integer.MAX_VALUE;\n\t\t\t\n\t\t\tcanGo(arr, xShark, yShark, size);\n\t\t\tSystem.out.println();\n\t\t\tfor(int i=0;i<n;i++) {\n\t\t\t\tfor(int j=0;j<n;j++)System.out.print(narr[i][j]);\n\t\t\t\tSystem.out.println();\n\t\t\t}\n\t\t\tfor(int i=0;i<n;i++) {\n\t\t\t\tfor(int j=0;j<n;j++) {\n\t\t\t\t\tif(narr[i][j]>0) {\n\t\t\t\t\t\tlist.add(new Node(i,j,narr[i][j]));\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\t\n\t\t\t//System.out.println(\"s\"+list.size());\n\t\t\t\n\t\t\t\n\t\t\tif(list.isEmpty())break;\n\t\t\tCollections.sort(list);\n\t\t\tNode N=list.get(0);\n\t\t\t//System.out.println(xShark+\" \"+yShark+\" \"+go);\n\t\t\tarr[xShark][yShark]=0;\n\t\t\txShark=N.x;\n\t\t\tyShark=N.y;\n\t\t\tarr[xShark][yShark]=9;\n\t\t\tgo+=N.distance;\n\t\t\teat++;\n\t\t\tif(eat==size) {\n\t\t\t\teat=0;\n\t\t\t\tsize++;\n\t\t\t}\n\t\t\t/*System.out.println(xShark+\" \"+yShark+\" \"+go);\n\t\t\tfor(int i=0;i<n;i++) {\n\t\t\t\tfor(int j=0;j<n;j++)System.out.print(arr[i][j]);\n\t\t\t\tSystem.out.println();\n\t\t\t}\n\t\t\tfor(int i=0;i<list.size();i++)System.out.println(list.get(i).toString());*/\n\t\t\t//System.out.println();\n\t\t}\n\t\tSystem.out.println(go);\n\t\t\n\t\t\n\t\t\n\t\t\n\t}","private void makeTree(HashMap<Instance, Bag> instanceBags,\n ArrayList<Instance> all, boolean stopOnFirstPositiveLeaf) {\n\n Random r = new Random(getSeed());\n\n AlgorithmConfiguration settings = getSettings();\n\n ArrayList<TreeNode> toSplit = new ArrayList<TreeNode>();\n\n root = new TreeNode(null, all);\n toSplit.add(root);\n numLeaves = 0;\n\n while (toSplit.size() > 0) {\n\n // The next two lines are here solely to reproduce the results from the\n // paper\n // (i.e. so that the same random number sequence is used.\n int nextIndex = Math.min(1, toSplit.size());\n nextIndex = r.nextInt(nextIndex);\n\n TreeNode next = toSplit.remove(nextIndex);\n if (next == null) {\n continue;\n }\n\n if (next.isPurePositive(instanceBags)) {\n next.makeLeafNode(true);\n ArrayList<String> deactivated = new ArrayList<String>();\n next.deactivateRelatedInstances(instanceBags, deactivated);\n\n if (m_Debug && deactivated.size() > 0) {\n Bag.printDeactivatedInstances(deactivated);\n }\n\n // Need to re-calculate scores if positive leaf has been\n // created\n for (TreeNode n : toSplit) {\n n.removeDeactivatedInstances(instanceBags);\n n.calculateNodeScore(instanceBags, m_unbiasedEstimate,\n m_kBEPPConstant, m_useBagCount, m_bagInstanceMultiplier);\n }\n\n if (stopOnFirstPositiveLeaf && deactivated.size() > 0) {\n return;\n }\n\n } else if (next.isPureNegative(instanceBags)) {\n next.makeLeafNode(false);\n } else {\n next.splitInstances(instanceBags, settings, r, m_Debug);\n if (!next.isLeafNode()) {\n if (next.split.isNominal) {\n TreeNode[] nominals = next.nominals();\n for (TreeNode nominal : nominals) {\n nominal.calculateNodeScore(instanceBags, m_unbiasedEstimate,\n m_kBEPPConstant, m_useBagCount, m_bagInstanceMultiplier);\n toSplit.add(nominal);\n }\n } else {\n next.left().calculateNodeScore(instanceBags, m_unbiasedEstimate,\n m_kBEPPConstant, m_useBagCount, m_bagInstanceMultiplier);\n toSplit.add(next.left());\n next.right().calculateNodeScore(instanceBags, m_unbiasedEstimate,\n m_kBEPPConstant, m_useBagCount, m_bagInstanceMultiplier);\n toSplit.add(next.right());\n }\n } else {\n // Need to re-calculate scores if positive leaf has been\n // created\n if (next.isPositiveLeaf()) {\n for (TreeNode n : toSplit) {\n n.removeDeactivatedInstances(instanceBags);\n n.calculateNodeScore(instanceBags, m_unbiasedEstimate,\n m_kBEPPConstant, m_useBagCount, m_bagInstanceMultiplier);\n }\n\n if (stopOnFirstPositiveLeaf) {\n return;\n }\n }\n }\n }\n\n // Increment number of leaves if necessary\n if (next.isLeafNode()) {\n numLeaves++;\n }\n\n // Re-evaluate the best next node, because we've most likely\n // added new nodes or disabled bags\n Comparator<TreeNode> sh = Collections\n .reverseOrder(new NextSplitHeuristic());\n Collections.sort(toSplit, sh);\n }\n\n if (m_Debug) {\n System.out.println(root.render(1, instanceBags));\n }\n }","public Node newAlphaBeta(Node node, boolean isMaximizing, Node[][] gameBoard,int playerID,int depth,boolean searchOnce) throws InterruptedException {\n\t\tif(depth==0) //node equals terminal node origin ***************************\n\t\t{\n\n\t\t\t\n\t\t\treturn node; //return heuristic value accumulated Score\n\t\t}\n\t\t\n\t\tif(isMaximizing == true)//max\n\t\t{\n\t\t\t\n\t\t\tNode[][] copyOne = new Node[gameBoard.length][gameBoard.length];\n\t\t\tint enescore=0;\n\t\t\tint nodesRx = 0;\n\t\t\tint nodesRy = 0;\n\t\t\tNode temNode = node;\n\t\t\t//opponent score\n\t\t\tif(node!=null)\n\t\t\t{\tenescore = node.enemy;\n\t\t\tnodesRx = node.maxrecordSearchedX;\n\t\t\tnodesRy = node.maxrecordSearchedY;}\n\t\t\t\n\t\t for (int i = 0; i < gameBoard.length; i++) {\n\t\t \tfor(int j =0;j<gameBoard.length;j++)\n\t\t \t{\t\n\t\t \t\tNode temp = new Node(gameBoard[i][j].getScore(),gameBoard[i][j].getX(),gameBoard[i][j].getY(),gameBoard[i][j].getOwnership());\n\t\t \t\tcopyOne[i][j]=temp;\n\t\t \t}\n\t\t }\n\t\t \n\t\t \n\t\t\tPriorityQueue<Node> playerOneChildrenList = new PriorityQueue<Node>(Collections.reverseOrder()); //use priorityQueue,acsending or disacsending.\n\t\t\tQueue<Node> waitList = new LinkedList<Node>();\n\t\t\tboolean walkable = false;\n\t\t\t\n\t\t\t\tfor(int i = 0;i<gameBoard.length;i++)\n\t\t\t\t{\n\t\t\t\t\tfor(int j =0;j<gameBoard.length;j++)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(copyOne[i][j].getOwnership()==0)\n\t\t\t\t\t\t{\n\t\t\t\t\t\twaitList.add(new Node(copyOne[i][j].getScore(),i,j,playerID));//everyPosition through the 2D array\n\t\t\t\t\t\twalkable = true;\n\t\t\t\t//\t\tcounter++;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\n\t\t\tif(walkable == false)\n\t\t\t{\n\t\t\t\treturn node;\n\t\t\t}\n\t\t\t\n\t\t\tint waitSize = waitList.size();\n\t\t\t\n\t\t\t\n\t\t\tfor(int l = 0;l<waitSize;l++)\n\t\t\t{\n\t\t\t\t\n\t\t\t\tNode[][] newCopy = new Node[gameBoard.length][gameBoard.length];\n\t\t\t\tNode temT = temNode;\n\t\t\t for (int i = 0; i < gameBoard.length; i++) {\n\t\t\t \tfor(int j =0;j<gameBoard.length;j++)\n\t\t\t \t{\t\n\t\t\t \t\tNode temp = new Node(copyOne[i][j].getScore(),copyOne[i][j].getX(),copyOne[i][j].getY(),copyOne[i][j].getOwnership());\n\t\t\t \t\tnewCopy[i][j]=temp;\n\t\t\t \t}\n\t\t\t }\n\t\t\t \n\t\t\t\tNode takenNode =waitList.poll();\n\t\t\t\tcounter++;\n\t\t\t\ttakenNode.setAccumulated(newCopy[takenNode.getX()][takenNode.getY()].getScore());\n\t\t\t\ttakenNode.enemy = 0;\n\t\t\t\tnewCopy[takenNode.getX()][takenNode.getY()].setOwnership(playerID);\n\t\t\t\tboolean connected = false;\n\t\t\t\tfor(int i = 0;i<dx.length;i++)\n\t\t\t\t{\n\t\t\t\t\t\tint newX = takenNode.getX()+dx[i];\n\t\t\t\t\t\tint newY = takenNode.getY()+dy[i];\n\t\t\t\t\t\tif((newX>=0&&newX<gameBoard.length)&&(newY>=0&&newY<gameBoard.length))\n\t\t\t\t\t\t{\n\t\t\t\t\t\tif(newCopy[newX][newY].getOwnership()==playerID)\n\t\t\t\t\t\t{\n\t\t\n\t\t\t\t\t\t\tconnected = true;\n\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\tif(connected == true)\n\t\t\t\t{\n\n\t\t\t\t\tfor(int i = 0;i<dx.length;i++)\n\t\t\t\t\t{\n\t\t\n\t\t\t\t\t\t\tint newX = takenNode.getX()+dx[i];\n\t\t\t\t\t\t\tint newY = takenNode.getY()+dy[i];\n\t\t\t\t\t\t\tif((newX>=0&&newX<gameBoard.length)&&(newY>=0&&newY<gameBoard.length))\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif(newCopy[newX][newY].getOwnership()!=playerID&&newCopy[newX][newY].getOwnership()!=0)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tthis.eatOpponent(newCopy, playerID, newX, newY);\n\t\t\n\t\t\t\t\t\t\t\ttakenNode.setAccumulated(takenNode.getAccumulated()+newCopy[newX][newY].getScore());\n\t\t\t\t\t\t\t\tenescore-=newCopy[newX][newY].getScore();\n\t\t\t\t\t\t\t\ttakenNode.enemy = enescore;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\n\t\t\t\t\t}\n\t\t\t\t}\n\t\n\t\t\t\tif(depth==1)\n\t\t\t\t{\n\t\n\t\t\t\t\ttakenNode.setAccumulated(node.getAccumulated()+takenNode.getAccumulated());\n\n\t\t\t\t}\n\t\n\n\t\t\t\tint opponentID = 0;\n\t\t\t\tif(playerID == 1)\n\t\t\t\t{\n\t\t\t\t\topponentID = 2;\n\t\t\t\t}else if(playerID == 2)\n\t\t\t\t{\n\t\t\t\t\topponentID = 1;\n\t\t\t\t}\n\t\t\t\tif(playerOneChildrenList.isEmpty()==false)\n\t\t\t\t{\n\t\t\t\t\t//\tSystem.out.println(\"asdas\");\n\t\t\t//\t\tSystem.out.println(\"A depth: \"+depth);\n\t\t\t\t//\tThread.sleep(300);\n\t\t\t\t\t\tNode minValueNode = newAlphaBeta(takenNode,false,newCopy, opponentID, depth-1,true);\n\t\t\t\t\t\tcounter++;\n\t\t\t\t\t\n\t\t\t\t\t\t\n\n\n\t\t\t\t\t\t\tif(node!=null)\n\t\t\t\t\t\t\t{\tminValueNode.parentNode = new Node(node.getAccumulated(),node.getX(),node.getY(),node.getOwnership());\n\t\t\t\t\t\t\tif(this.beta!=null)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif(minValueNode.getAccumulated()<this.alpha.getAccumulated())\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t//\tSystem.out.println(\"break l should be \"+waitSize+\" now: \"+l);\n\t\t\t\t\t\t\t\tplayerOneChildrenList.add(minValueNode);\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t//node.noPoll = true;\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tplayerOneChildrenList.add(minValueNode);\n\t\t\t\t\t\t\tcontinue;\n\t\n\t\t\t\t\t//\t}\n\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t//\tSystem.out.println(\"B depth: \"+depth);\n\t\t\t\t\t//Thread.sleep(300);\n\t\t\t\t\trecordDepth = depth;\n\t\t\t\t\tNode minValueNode = newAlphaBeta(takenNode,false,newCopy, opponentID, depth-1,false);\n\t\t\t\t\t//this.alpha = minValueNode;\n\t\t\t\t\t\n\t\t\t\t\tcounter++;\n\t\t\t\t\t//playeroneNode++;\n\t\t\t\t\tif(node!=null)\n\t\t\t\t\t{\tminValueNode.parentNode = new Node(node.getAccumulated(),node.getX(),node.getY(),node.getOwnership());\n\t\t\t\t\tif(this.beta!=null)\n\t\t\t\t\t{\n\t\t\t\t\tif(minValueNode.getAccumulated()>this.beta.getAccumulated())\n\t\t\t\t\t{\n\t\t\t\t\t//\tSystem.out.println(\"break l should be \"+waitSize+\" now: \"+l);\n\t\t\t\t\t\tplayerOneChildrenList.add(minValueNode);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t//node.noPoll = true;\n\t\t\t\t\t\t\n\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\t}\n\t\t\t\t\tplayerOneChildrenList.add(minValueNode);\n\t\t\n\t\t\t\t\t\tif(depth == recordDepth)\n\t\t\t\t\t\t{\n\t\t\t//\t\t\t\tSystem.out.println(\"setting alpha\");\n\t\t\t\t\t\t\t//Thread.sleep(300);\n\t\t\t\t\n\t\t\t\t\t\t\t\tthis.alpha = minValueNode;\n\t\t\t//\t\t\tSystem.out.println(\"alpha once: \"+this.alpha.getAccumulated());\n\t\t\t\t\t//\tThread.sleep(5000);\n\t\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\n\t\t\tif(playerOneChildrenList.peek().parentNode!=null||node!=null)\n\t\t\t{\n\t\t\t//\tSystem.out.println(\"returning: \"+playerOneChildrenList.peek().getAccumulated());\n\t\t\t//\tSystem.out.println(500);\n\t\t\tplayerOneChildrenList.peek().parentNode.setAccumulated(playerOneChildrenList.peek().getAccumulated());\n\t\t\tplayerOneChildrenList.peek().parentNode.noPoll = playerOneChildrenList.peek().noPoll;\n\n\t\t\treturn playerOneChildrenList.poll().parentNode;\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tplayerOneChildrenList.peek().nodeExpanded = counter;\n\t\t\t\treturn playerOneChildrenList.poll();\n\t\t\t}\n\t\t\n\t\t}else\n\t\tif(isMaximizing == false)//min\n\t\t{\n\t\t\tNode[][] copyOne = new Node[gameBoard.length][gameBoard.length];\n\t\t\tint currentEnescore = node.enemy;\n\t\t\tint nodesRx = node.maxrecordSearchedX;\n\t\t\tint nodesRy = node.maxrecordSearchedY;\n\t\t\tNode temNode = node;\n\t\t for (int i = 0; i < gameBoard.length; i++) {\n\t\t \tfor(int j =0;j<gameBoard.length;j++)\n\t\t \t{\t\n\t\t \t\tNode temp = new Node(gameBoard[i][j].getScore(),gameBoard[i][j].getX(),gameBoard[i][j].getY(),gameBoard[i][j].getOwnership());\n\t\t \t copyOne[i][j]=temp;\n\t\t \t}\n\t\t }\n\t\t\tPriorityQueue<Node> playerTwoChildrenList = new PriorityQueue<Node>(); \n\t\t\tQueue<Node> waitList = new LinkedList<Node>();\n\t\t\tboolean walkable = false;\n\t\n\t\t\t\tfor(int i = 0;i<gameBoard.length;i++)\n\t\t\t\t{\n\t\t\t\t\tfor(int j =0;j<gameBoard.length;j++)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(copyOne[i][j].getOwnership()==0)\n\t\t\t\t\t\t{\n\t\t\t\t\t\twaitList.add(new Node(copyOne[i][j].getScore(),i,j,playerID));//everyPosition through the 2D array\n\t\t\t\t\t\twalkable = true;\n\t\t\t\t//\t\tcounter++;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\n\t\t\tif(walkable == false)\n\t\t\t{\n\t\t\t\treturn node;\n\t\t\t}\n\t\t\t\n\t\t\tint waitSize = waitList.size();\n\n\t\t\tfor(int l = 0;l<waitSize;l++)\n\t\t\t{\n\n\t\t\t\tNode[][] newCopy = new Node[gameBoard.length][gameBoard.length];\n\t\t\t\tNode temT = temNode;\n\t\t\t for (int i = 0; i < gameBoard.length; i++) {\n\t\t\t \tfor(int j =0;j<gameBoard.length;j++)\n\t\t\t \t{\t\n\t\t\t \t\tNode temp = new Node(copyOne[i][j].getScore(),copyOne[i][j].getX(),copyOne[i][j].getY(),copyOne[i][j].getOwnership());\n\t\t\t \t\tnewCopy[i][j]=temp;\n\t\t\t \t}\n\t\t\t }\n\n\t\t\t\tNode takenNode = waitList.poll();\n\t\t\t\tcounter++;\n\t\t\t\tnewCopy[takenNode.getX()][takenNode.getY()].setOwnership(playerID);\n\t\t\n\t\t\t\ttakenNode.setAccumulated(node.getAccumulated());\n\n\t\t\t\ttakenNode.enemy= currentEnescore+newCopy[takenNode.getX()][takenNode.getY()].getScore();\n\t\t\t\t\n\t\t\t\tboolean connected = false;\n\t\t\t\tfor(int i = 0;i<dx.length;i++)\n\t\t\t\t{\n\t\n\t\t\t\t\t\tint newX = takenNode.getX()+dx[i];\n\t\t\t\t\t\tint newY = takenNode.getY()+dy[i];\n\t\t\t\t\t\tif((newX>=0&&newX<gameBoard.length)&&(newY>=0&&newY<gameBoard.length))\n\t\t\t\t\t\t{\n\t\t\t\t\t\tif(newCopy[newX][newY].getOwnership()==playerID)\n\t\t\t\t\t\t{\n\t\t\t\t\n\t\t\t\t\t\t\tconnected = true;\n\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\tif(connected == true)\n\t\t\t\t{\n\t\t\t\n\t\t\t\t\tfor(int i = 0;i<dx.length;i++)\n\t\t\t\t\t{\n\t\t\n\t\t\t\t\t\t\tint newX = takenNode.getX()+dx[i];\n\t\t\t\t\t\t\tint newY = takenNode.getY()+dy[i];\n\t\t\t\t\t\t\tif((newX>=0&&newX<gameBoard.length)&&(newY>=0&&newY<gameBoard.length))\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif(newCopy[newX][newY].getOwnership()!=playerID&&newCopy[newX][newY].getOwnership()!=0)\n\t\t\t\t\t\t\t{\n\t\t\t\t\t\t\t\tthis.eatOpponent(newCopy, playerID, newX, newY);\n\t\t\t\t\t\t\t\ttakenNode.setAccumulated(takenNode.getAccumulated()-newCopy[newX][newY].getScore());\t\n\t\t\t\t\t\t\t\ttakenNode.enemy+=newCopy[newX][newY].getScore();\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tint opponentID = 0;\n\t\t\t\tif(playerID == 1)\n\t\t\t\t{\n\t\t\t\t\topponentID = 2;\n\t\t\t\t}else if(playerID == 2)\n\t\t\t\t{\n\t\t\t\t\topponentID = 1;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(playerTwoChildrenList.isEmpty()==false)\n\t\t\t\t{\n\t\t\t//\t\tSystem.out.println(\" C depth: \"+depth);\n\t\t\t\t//\tThread.sleep(300);\n\t\t\t\t\t\tNode maxValueNode = newAlphaBeta(takenNode,true,newCopy, opponentID, depth-1,true);\n\t\t\t\t\t\tcounter++;\n\t\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\t//playeroneNode++;\n\t\t\t\t\t\tmaxValueNode.parentNode = new Node(node.getAccumulated(),node.getX(),node.getY(),node.getOwnership());\n\t\t\t\t\t\tif(this.alpha!=null)\n\t\t\t\t\t\t{\n\t\t\t\t//\t\tSystem.out.println(maxValueNode.getAccumulated()+\" \"+this.alpha.getAccumulated());\n\t\t\t\t\t//\tThread.sleep(5000);\n\t\t\t\t\t\tif(maxValueNode.getAccumulated()<this.alpha.getAccumulated())\n\t\t\t\t\t\t{\n\t\t\t\t\t//\t\tSystem.out.println(\"break l should be \"+waitSize+\" now: \"+l);\n\t\t\t\t\t\t\tplayerTwoChildrenList.add(maxValueNode);\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t//node.noPoll = true;\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\t\tplayerTwoChildrenList.add(maxValueNode);\n\t\t\t\t\t//\tif(maxValueNode.noPoll == true)\n\t\t\t\t\t//\t{\n\t\t\t\t\t//\t\tSystem.out.println(\"the discard value: \"+maxValueNode.getAccumulated()+\" compareTo: \"+this.alpha.getAccumulated());\n\t\t\t\t\t//\t\tbreak;\n\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\t\t\n\t\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t//\tSystem.out.println(\" D depth: \"+depth);\n\t\t\t\t//\tThread.sleep(300);\n\t\t\t\t\tNode maxValueNode = newAlphaBeta(takenNode,true,newCopy, opponentID, depth-1,false);\n\t\t\t\t\tcounter++;\n\t\t\t\t\t\n\t\t\t\t\tmaxValueNode.parentNode = new Node(node.getAccumulated(),node.getX(),node.getY(),node.getOwnership());\n\t\t\t\t\tif(this.alpha!=null)\n\t\t\t\t\t{\n\t\t\t\t\tif(maxValueNode.getAccumulated()<this.alpha.getAccumulated())\n\t\t\t\t\t{\n\t\t\t\t\t//\tSystem.out.println(\"break l should be \"+waitSize+\" now: \"+l);\n\t\t\t\t\t\tplayerTwoChildrenList.add(maxValueNode);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t//node.noPoll = true;\n\t\t\t\t\t\t\n\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif(depth == recordDepth-1)\n\t\t\t\t\t{\n\t\t//\t\t\t\tSystem.out.println(\"setting alpha\");\n\t\t\t\t\t\t//Thread.sleep(300);\n\t\t\t\n\t\t\t\t\t\t\tthis.beta = maxValueNode;\n\t\t\t\t\t\t\tSystem.out.println(\"beta: \"+this.beta.getAccumulated());\n\t\t\t\t\t\t\t//Thread.sleep(5000);\n\t\t//\t\t\tSystem.out.println(\"alpha once: \"+this.alpha.getAccumulated());\n\t\t\t\t//\tThread.sleep(5000);\n\t\t\t\t\t}\n\t\t\t\t\tplayerTwoChildrenList.add(maxValueNode);\n\t\t\t\t//\tif(maxValueNode.noPoll == true)\n\t\t\t\t//\t{\n\t\t\t\t//\t\t\n\t\t\t\t//\t\tbreak;\n\t\t\t\t//\t}\n\t\t\t\t}\n\t\t\t\n\t\t\t}\n\t\t\tplayerTwoChildrenList.peek().parentNode.setAccumulated(playerTwoChildrenList.peek().getAccumulated());\n\n\t\t\treturn playerTwoChildrenList.poll().parentNode;\n\t\t}\n\t\treturn null;\n\t\n\t}","private List<Double> MinimaxAlgorithm(MinimaxNode<GameState> node, int dataCount){\n if(node.getNumberOfChildren() == 0){ //checks to see if terminal node\n List<Double> heuristics = new ArrayList();\n heuristics.addAll(calculateHeuristic(node.getState()));\n return heuristics;\n }\n else{ //will maximise all the scores for each player.\n double value = Double.NEGATIVE_INFINITY;\n double checkValue;\n int bestMove;\n List<Double> heuristics = new ArrayList();\n if(node.getIfChanceNode()){ //checks if current node is a chance node, if so, times \n for (int i = 0; i < node.getChildren().size(); i++){\n List<Double> tempHeuristics = new ArrayList();\n tempHeuristics.addAll(MinimaxAlgorithm(node.getChildren().get(i),dataCount+1));\n checkValue = node.getChildren().get(i).getProbability() * tempHeuristics.get(node.getNodeIndex());\n value = Math.max(value, checkValue);//maximises the score.\n if(checkValue == value){\n heuristics.addAll(tempHeuristics); \n }\n if(dataCount == 0){//checks if this is the root node\n if(checkValue == value){\n MinimaxPlayer.optimalMoves = node.getChildren().get(i).getState().getOrientation(node.getNodeIndex()); \n }\n } \n }\n }\n else{\n for (int i = 0; i < node.getChildren().size(); i++){\n List<Double> tempHeuristics = new ArrayList();\n tempHeuristics.addAll(MinimaxAlgorithm(node.getChildren().get(i),dataCount+1));\n checkValue = tempHeuristics.get(node.getNodeIndex());\n value = Math.max(value, checkValue);//maximises the score.\n if(checkValue == value){\n heuristics.addAll(tempHeuristics); \n }\n if(dataCount == 0){//checks if this is the root node\n if(checkValue == value){\n MinimaxPlayer.optimalMoves = node.getChildren().get(i).getState().getOrientation(node.getNodeIndex()); \n }\n } \n } \n }\n return heuristics;\n } \n }","public static void main(String[] args) {\n\n BDNode a = new BDNode(\"A\");\n BDNode b = new BDNode(\"B\");\n BDNode c = new BDNode(\"C\");\n BDNode d = new BDNode(\"D\");\n BDNode e = new BDNode(\"E\");\n\n a.link(b);\n a.link(d);\n b.link(a);\n b.link(c);\n b.link(e);\n c.link(b);\n c.link(d);\n d.link(a);\n d.link(c);\n d.link(e);\n e.link(b);\n e.link(d);\n\n BDNode target = e;\n\n/*\n // BFS\n Queue<BDNode> queue = new LinkedList<>();\n queue.offer(a);\n\n while(!queue.isEmpty()) {\n BDNode n = queue.poll();\n n.visit();\n System.out.println(n); // 찾는 여정 출력\n\n if(n.equals(target)) {\n System.out.println(\"BFS Found! \" + n);\n break;\n }\n\n for (BDNode l : n.links) {\n if(l.isVisited()) continue;\n if (queue.contains(l)) continue;\n queue.offer(l);\n }\n\n // 위랑 같은 표현\n// n.links.stream()\n// .filter(l -> !queue.contains(l))\n// .forEach(queue::offer);\n }\n*/\n\n // DFS\n Stack<BDNode> stack = new Stack<>();\n stack.push(a);\n\n while(!stack.isEmpty()) {\n BDNode n = stack.pop();\n n.visit();\n System.out.println(n); // 찾는 여정 출력\n\n if (n.equals(target)) {\n System.out.println(\"DFS Found! \" + n);\n break;\n }\n\n for (BDNode l : n.links) {\n if (l.isVisited()) continue;\n if (stack.contains(l)) continue;\n\n stack.push(l);\n }\n }\n\n\n }","private void depthFirstSearch(Slot start, ArrayList<Pair<Slot, Slot>> moves, HashMap<Slot, Slot> parents) {\n boolean[][] visitedSlots = new boolean[Board.MAX_ROW][Board.MAX_COLUMN];\n\n setSlotsAsNotVisited(visitedSlots);\n\n Stack<Slot> dfsStack = new Stack<>();\n int color = start.getColor();\n\n dfsStack.push(start);\n Slot previous = start;\n\n boardObject.setSlotColor(boardObject.getSlot(start.getRow(), start.getColumn()), Slot.EMPTY);\n\n while (!dfsStack.empty()) {\n Pair<Slot, Slot> next;\n Slot current = dfsStack.pop();\n\n if (!visitedSlots[current.getRow()][current.getColumn()] && !current.equals(previous)) {\n if (!current.equals(start)) {\n visitedSlots[current.getRow()][current.getColumn()] = true;\n }\n\n next = new Pair<>(start, current);\n\n moves.add(next);\n }\n\n Slot up = getUp(current);\n Slot down = getDown(current);\n Slot left = getLeft(current);\n Slot right = getRight(current);\n\n if (left != null && !visitedSlots[left.getRow()][left.getColumn()]) {\n if (!isChild(current, left, parents)) {\n dfsStack.push(left);\n parents.put(left, current);\n }\n }\n\n if (down != null && !visitedSlots[down.getRow()][down.getColumn()]) {\n if (!isChild(current, down, parents)) {\n dfsStack.push(down);\n parents.put(down, current);\n }\n }\n\n if (right != null && !visitedSlots[right.getRow()][right.getColumn()]) {\n if (!isChild(current, right, parents)) {\n dfsStack.push(right);\n parents.put(right, current);\n }\n }\n\n if (up != null && !visitedSlots[up.getRow()][up.getColumn()]) {\n if (!isChild(current, up, parents)) {\n dfsStack.push(up);\n parents.put(up, current);\n }\n }\n\n previous = current;\n }\n\n boardObject.setSlotColor(boardObject.getSlot(start.getRow(), start.getColumn()), color);\n }","private ArrayList<String> makeChildren(Node current) {\n\n ArrayList<String> current_children = new ArrayList<>();\n\n if (current != null && current.getDigit().last_changed != 0) {\n //-1 child first digit\n if ((Integer.parseInt(current.getDigit().getFirst_digit()) - 1 >= 0)) {\n String child_node = current.getDigit().decreaseFirstDigit();\n current_children.add(child_node);\n }\n\n //+1 child first digit\n if ((Integer.parseInt(current.getDigit().getFirst_digit()) + 1 <= 9)) {\n String child_node = current.getDigit().increaseFirstDigit();\n current_children.add(child_node);\n }\n }\n\n if (current != null && current.getDigit().last_changed != 1) {\n //-1 child\n if ((Integer.parseInt(current.getDigit().getSecond_digit()) - 1 >= 0)) {\n String child_node = current.getDigit().decreaseSecondDigit();\n current_children.add(child_node);\n }\n\n //+1 child\n if ((Integer.parseInt(current.getDigit().getSecond_digit()) + 1 <= 9)) {\n String child_node = current.getDigit().increaseSecondDigit();\n current_children.add(child_node);\n }\n }\n\n if (current != null && current.getDigit().last_changed != 2) {\n //-1 child\n if ((Integer.parseInt(current.getDigit().getThird_digit()) - 1 >= 0)) {\n String child_node = current.getDigit().decreaseThirdDigit();\n current_children.add(child_node);\n }\n //+1 child\n if ((Integer.parseInt(current.getDigit().getThird_digit()) + 1 <= 9)) {\n String child_node = current.getDigit().increaseThirdDigit();\n current_children.add(child_node);\n }\n }\n return current_children;\n }","private void expandTree(TreeNode tn,Set<Condition> conds)\n{\n List<RuleInstance> rules = tn.getRules();\n double tot = rules.size();\n if (tot <= 1) return;\n if (conds == null || conds.isEmpty()) return;\n\n Condition best = null;\n List<RuleInstance> bestp = null;\n List<RuleInstance> bestf = null;\n double bestv = 0;\n\n for (Condition c : conds) {\n List<RuleInstance> pr = new ArrayList<RuleInstance>();\n List<RuleInstance> fr = new ArrayList<RuleInstance>();\n for (RuleInstance ri : rules) {\n\t if (c.match(ri)) pr.add(ri);\n\t else fr.add(ri);\n }\n if (pr.size() == 0 || fr.size() == 0) continue;\n double vp = pr.size() / tot;\n double vf = fr.size() / tot;\n double e = - vp * Math.log(vp) - vf * Math.log(vf);\n if (e > bestv) {\n\t best = c;\n\t bestp = pr;\n\t bestf = fr;\n }\n }\n\n if (best == null) return;\n\n tn.setCondition(best,bestp,bestf);\n expandTree(tn.getPassTree(),conds);\n expandTree(tn.getFailTree(),conds);\n}","static boolean bfs(TreeNode root) {\n Queue<TreeNode> queue = new LinkedList<TreeNode>();\n queue.add(root);\n while (!queue.isEmpty()) {\n TreeNode node = (TreeNode) queue.remove();\n if (node == null)\n continue;\n System.out.println(\"Checking node \" + node.data);\n if (isGoal(node)) {\n System.out.println(\"\\nFound goal node \" + node.data);\n return true;\n }\n queue.addAll(node.getChildren());\n // dump(queue);\n }\n return false;\n }","private void bfs() {\n\t\tQueue<Node> q = new ArrayDeque<>();\n\t\tq.add(treeNodes.get(0));\n\t\twhile (!q.isEmpty()) {\n\t\t\tint size = q.size();\n\t\t\tfor (int i = 0; i < size; i++) {\n\t\t\t\tNode curr = q.poll();\n\t\t\t\ttime += curr.informTime;\n\t\t\t\tSet<Node> nextNodes = curr.nextNodes;\n\t\t\t\tif (nextNodes == null || curr.id == treeNodes.get(0).id)\n\t\t\t\t\tcontinue;\n\t\t\t\tfor (Node node : nextNodes) {\n\t\t\t\t\tq.add(node);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t}","public List<T> wantedNodesIterative(Predicate<T> p) {\n //PART 4 \n if(root == null){\n return null;\n }\n LinkedList<TreeNode<T>> stack = new LinkedList<>();\n stack.add(root);\n \n List<T> wantedNodes =new LinkedList<>();\n TreeNode<T> current;\n \n while(!stack.isEmpty()){\n current = stack.pop();\n if(p.check(current.data)){\n wantedNodes.add(current.data);\n }\n if(current.right != null){\n stack.addFirst(current.right);\n }\n if(current.left != null){\n stack.addFirst(current.left);\n }\n }\n return wantedNodes;\n }","private static void greedyTime(Person curPerson, Map<String, Person> persons) throws FileNotFoundException {\n\t\tclass DisComparator implements Comparator<Person> {\n\t\t\tpublic int compare(Person a, Person b) {\n\t\t\t\treturn a.getEstDistTime() - b.getEstDistTime();\n\t\t\t} \n\t\t}\n\t\t\n\t\tPriorityQueue<Person> pqueue = new PriorityQueue<Person>(persons.size(), new DisComparator());\t\t\n\t\tpqueue.add(curPerson);\n\t\t\n\t\touterloop:\n\t\twhile(!pqueue.isEmpty()) {\n\t\t\tcurPerson = pqueue.poll();\n\t\t\t\n\t\t\tArrayList<Person> children = curPerson.getConnected();\n\t\t\tPerson child;\n\t\t\tfor(int i = 0; i < children.size(); i++) {\n\t\t\t\tchild = children.get(i);\n\t\t\t\tif(!child.getMarked()) {\n\t\t\t\t\tchild.setRoute(curPerson);\n\t\t\t\t\tchild.setMarked();\n\t\t\t\t\tif(child.getName().equals(\"Noah\")) {\t//check when generated\n\t\t\t\t\t\tcurPerson = child;\n\t\t\t\t\t\tbreak outerloop;\n\t\t\t\t\t}\n\t\t\t\t\tpqueue.add(child);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\n\t\toutputResult(curPerson, \"Greedy.time.result.txt\");\n\t}","static int downToZero(Node root) {\n /*\n * Write your code here.\n */\n Queue<Node> queue = new PriorityQueue<>();\n queue.add(root);\n int min = 100001;\n while (!queue.isEmpty()){\n Node current = queue.poll();\n if(current.value <= 4){\n if (current.value == 4){\n min = current.depth + 3;\n return min;\n }\n min = current.depth+current.value;\n return min;\n }\n Node toAdd1 = new Node(current.value-1, current.depth+1);\n queue.add(toAdd1);\n for(int i = 2; i<=Math.sqrt(current.value); i++){\n if(current.value%i==0){\n Node toAdd = new Node(current.value/i, current.depth+1);\n queue.add(toAdd);\n }\n }\n }\n return min;\n }","private int optimize() {\n\t\t// items: Items sorted by value-to-weight ratio for linear relaxation\n\t\t// t: the decision vector being tested at each node\n\t\t// ws, vs, is, bs: stacks of weight, value, item id, whether bring item\n\t\t// p: stack pointer; i, b, weight, value: loop caches; best: max search\n\t\t// ss: stack size: Always <=2 children on stack for <=n-1 parents\n\t\tItem[] items = new Item[n];\n\t\tint ss = 2 * n;\n\t\tint[] itemsSorted = new int[n], t = new int[n], ws = new int[ss],\n\t\t\tvs = new int[ss], is = new int[ss], bs = new int[ss];\n\t\tint i, b, weight, value, best = 0, p = 0;\n\n\t\tfor (int j = 0; j < n; j++)\n\t\t\titems[j] = new Item(j);\n\t\tArrays.sort(items);\n\t\tfor (int j = 0; j < n; j++)\n\t\t\titemsSorted[j] = items[j].i();\n\t\titems = null; // For garbage collection.\n\n\t\t// Push item 0 onto the stack with and without bringing it.\n\t\tws[p] = 0; vs[p] = 0; is[p] = 0; bs[p] = 1; p++;\n\t\tws[p] = 0; vs[p] = 0; is[p] = 0; bs[p] = 0; p++;\n\n\t\twhile (p > 0) {\n\t\t\tp--; // Pop the latest item off the stack\n\t\t\ti = is[p]; b = bs[p];\n\t\t\tweight = ws[p] + w[i] * b;\n\t\t\tif (weight > k)\n\t\t\t\tcontinue;\n\t\t\tvalue = vs[p] + v[i] * b;\n\t\t\tif (bound(i, weight, value, itemsSorted) < best)\n\t\t\t\tcontinue;\n\t\t\tbest = Math.max(value, best);\n\t\t\tt[i] = b;\n\t\t\tif (i < n - 1) { // Push children onto stack w/ & w/o bringing item\n\t\t\t\tws[p] = weight; vs[p] = value; is[p] = i + 1; bs[p] = 1; p++;\n\t\t\t\tws[p] = weight; vs[p] = value; is[p] = i + 1; bs[p] = 0; p++;\n\t\t\t}\n\t\t\telse if (value >= best)\n\t\t\t\tSystem.arraycopy(t, 0, x, 0, n);\n\t\t}\n\t\treturn best;\n\t}","private void sink(int i) {\n if (2*i > N)\n return;\n int maxChild = 2*i;\n if (maxChild < N && compare(maxChild, maxChild+1) < 0)\n maxChild++;\n if (compare(maxChild, i) > 0) {\n swap(maxChild, i);\n sink(maxChild);\n }\n }","private static void dfsBribe(int n, List<Integer>[] ch, long[] w) {\n if (ch[n].size() == 0){\n In[n] = w[n];\n OutD[n] = Long.MAX_VALUE;\n OutU[n] = 0;\n }\n //recurrance case: non.leaf, do dfs for all subordinates then calculate In, OutUp & OutDown.\n else{\n for (int c:ch[n])\n dfsBribe(c, ch, w); //running once for each child thereby O(N)\n In[n] = w[n];\n for (int c:ch[n]){ //O(N) running time\n In[n] += OutU[c];\n OutU[n] += Math.min(In[c], OutD[c]);\n OutD[n] += Math.min(In[c], OutD[c]);\n }\n OutD[n] += delta(n, ch); //add delta for no in Children\n }\n\n }","private Node selectAndExpandNewNode() {\n // Start at the root\n Node node = root;\n\n // Iterate down the tree until reaching a goal state\n while (node.getState().getPos() < problemSpec.getN()) {\n // Get the best action from the current node using UCT\n Action action = selectBestAction(node);\n\n // Simulate a single action\n FromStateSimulator FSS = new FromStateSimulator(problemSpec);\n FSS.setStartState(node.getState(), stepsDone + node.getStepsFromRoot());\n FSS.step(action);\n State newState = FSS.getCurrentState();\n\n // Get the node representing the outcome of the transition\n Node child = node.childWithStateAction(newState, action);\n\n // If this outcome node has not been added to the tree, add it\n if (child == null) {\n Node newNode = new Node(newState, FSS.getSteps());\n newNode.setParentNodeAndAction(node, action);\n node.addChildNode(newNode);\n\n // Return this new node\n return newNode;\n }\n\n // Now repeat the process using this child node\n node = child;\n }\n\n return node;\n }","public AttackTreeNode buildNextChild(AttackTreeNode activeChild) {\n \n AttackTreeNode nextNode = null;\n \n // AttackParameter has no children...\n \n return nextNode;\n }","public NCRPNode select() {\n\t\t\t\n\t\t\t//dim number of children + 1 (unallocated mass) \n\t\t\tdouble[] weights = new double[children.size() + 1];\n\t \n\t\t\t//weight of unallocated probability mass\n\t\t\tweights[0] = gamma / (gamma + customers);\n\t\t\t\n\t\t\t//calc weight for each child based on the number of customers on them\n\t\t\tint i = 1;\n\t\t\tfor (NCRPNode child: children) {\n\t\t\t\tweights[i] = (double) child.customers / (gamma + customers);\n\t\t\t\ti++;\n\t\t\t}\n\n\t\t\t//sample a child with higher weight\n\t\t\tint choice = random.nextDiscrete(weights);\n\t\t\t//if unallocated mass is sampled, create a new child\n\t\t\tif (choice == 0) {\n\t\t\t\treturn(addChild());\n\t\t\t}\n\t\t\telse {\n\t\t\t\treturn children.get(choice - 1);\n\t\t\t}\n\t\t}","@Override\n\tpublic void solve() {\n\t\tlong startTime = System.nanoTime();\n\n\t\twhile(!unvisitedPM.isEmpty()){\n\t\t\tProblemModel current = findCheapestNode();\n\t\n\t\t\tfor(ProblemModel pm : current.getSubNodes()){\n\t\t\n\t\t\t\tif(!visited.contains(pm) && !unvisitedPM.contains(pm)){\n\t\t\t\t\t\n\t\t\t\t\tunvisitedPM.add(pm);\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\tif(current.getSideStart().isEmpty()){\n\t\t\t\tSystem.out.print( \"\\n\"+ \"StartSide Runners: \");\n\t\t\t\tfor(Integer r: current.getSideStart()){\n\t\t\t\t\tSystem.out.print( \" \" +r) ;\n\t\t\t\t}\n\t\t\t\tSystem.out.print( \"\\n\" + \"EndSide Runners: \");\n\t\t\t\tfor(Integer r: current.getSideEnd()){\n\t\t\t\t\tSystem.out.print( \" \" + r);\n\t\t\t\t}\n\n\t\t\t\tprintPathTaken(current);\n\t\t\t\tSystem.out.print( \"\\n\" + \"------------done--------------\");\n\t\t\t\tlong endTime = System.nanoTime();\n\t\t\t\tlong duration = ((endTime - startTime)/1000000);\n\t\t\t\tSystem.out.print( \"\\n\" + \"-AS1 Time taken: \" + duration + \"ms\");\n\t\t\t\t\n\t\t\t\t\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\tvisited.add(current);\n\t\t\n\t\t}\n\t\t\n\n\t}","public static LinkedList<LinkedList<String>> getNextLevel(Graph G, LinkedList<LinkedList<String>> Parents, boolean sharon) {\r\n\t\tLinkedList<LinkedList<String>> Children = new LinkedList<LinkedList<String>>();\r\n\t\tLinkedList<String> Pi, Pj, u;\r\n\t\tfor (int i=0; i<Parents.size(); i++) {\r\n\t\t\tPi = Parents.get(i);\r\n\t\t\tfor (int j=i+1; j<Parents.size(); j++) {\r\n\t\t\t\tPj = Parents.get(j);\r\n\t\t\t\t\r\n\t\t\t\tboolean generateChild = true;\r\n\t\t\t\t\r\n\t\t\t\tif (Pj.size()>1) {\r\n\t\t\t\t\tfor (int k = 0; k<Pj.size()-1; k++) {\r\n\t\t\t\t\t\tif (Pi.get(k)!=Pj.get(k)) {\r\n\t\t\t\t\t\t\tgenerateChild = false;\r\n\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\tif (generateChild && sharon && G.hasEdge(Pi.get(Pi.size()-1), Pj.get(Pj.size()-1))) {\r\n\t\t\t\t\tgenerateChild = false;\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\tif (generateChild) {\r\n\t\t\t\t\tu = new LinkedList<String>();\r\n\t\t\t\t\tfor (int n=0; n<Pi.size(); n++) {\r\n\t\t\t\t\t\tu.add(Pi.get(n));\r\n\t\t\t\t\t}\r\n\t\t\t\t\tu.add(Pj.get(Pj.size()-1));\r\n\t\t\t\t\t//System.err.println(\"added \" + u);\r\n\t\t\t\t\tChildren.add(u);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn Children;\r\n\t}","static boolean dfs(TreeNode root) {\n Stack<TreeNode> stack = new Stack<TreeNode>();\n stack.push(root);\n while (!stack.isEmpty()) {\n TreeNode node = (TreeNode) stack.pop();\n if (node == null)\n continue;\n\n System.out.println(\"Checking node \" + node.data);\n if (isGoal(node)) {\n System.out.println(\"\\nFound goal node \" + node.data);\n return true;\n }\n stack.addAll(node.getChildren());\n // dump(stack);\n }\n return false;\n }","private void expandNode() {\r\n\t\t\t// Dijkstra's algorithm to handle separately\r\n\t\t\tif (dijkstra.isSelected()) {\r\n\t\t\t\tCell u;\r\n\t\t\t\t// 11: while Q is not empty:\r\n\t\t\t\tif (graph.isEmpty()) {\r\n\t\t\t\t\treturn;\r\n\t\t\t\t}\r\n\t\t\t\t// 12: u := vertex in Q (graph) with smallest distance in dist[]\r\n\t\t\t\t// ;\r\n\t\t\t\t// 13: remove u from Q (graph);\r\n\t\t\t\tu = graph.remove(0);\r\n\t\t\t\t// Add vertex u in closed set\r\n\t\t\t\tclosedSet.add(u);\r\n\t\t\t\t// If target has been found ...\r\n\t\t\t\tif (u.row == targetPos.row && u.col == targetPos.col) {\r\n\t\t\t\t\tfound = true;\r\n\t\t\t\t\treturn;\r\n\t\t\t\t}\r\n\t\t\t\t// Counts nodes that have expanded.\r\n\t\t\t\texpanded++;\r\n\t\t\t\t// Update the color of the cell\r\n\t\t\t\tgrid[u.row][u.col] = CLOSED;\r\n\t\t\t\t// 14: if dist[u] = infinity:\r\n\t\t\t\tif (u.dist == INFINITY) {\r\n\t\t\t\t\t// ... then there is no solution.\r\n\t\t\t\t\t// 15: break;\r\n\t\t\t\t\treturn;\r\n\t\t\t\t\t// 16: end if\r\n\t\t\t\t}\r\n\t\t\t\t// Create the neighbors of u\r\n\t\t\t\tArrayList<Cell> neighbors = createSuccesors(u, false);\r\n\t\t\t\t// 18: for each neighbor v of u:\r\n\t\t\t\tfor (Cell v : neighbors) {\r\n\t\t\t\t\t// 20: alt := dist[u] + dist_between(u, v) ;\r\n\t\t\t\t\tint alt = u.dist + distBetween(u, v);\r\n\t\t\t\t\t// 21: if alt < dist[v]:\r\n\t\t\t\t\tif (alt < v.dist) {\r\n\t\t\t\t\t\t// 22: dist[v] := alt ;\r\n\t\t\t\t\t\tv.dist = alt;\r\n\t\t\t\t\t\t// 23: previous[v] := u ;\r\n\t\t\t\t\t\tv.prev = u;\r\n\t\t\t\t\t\t// Update the color of the cell\r\n\t\t\t\t\t\tgrid[v.row][v.col] = FRONTIER;\r\n\t\t\t\t\t\t// 24: decrease-key v in Q;\r\n\t\t\t\t\t\t// (sort list of nodes with respect to dist)\r\n\t\t\t\t\t\tCollections.sort(graph, new CellComparatorByDist());\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\t// The handling of the other four algorithms\r\n\t\t\t} else {\r\n\t\t\t\tCell current;\r\n\t\t\t\tif (dfs.isSelected() || bfs.isSelected()) {\r\n\t\t\t\t\t// Here is the 3rd step of the algorithms DFS and BFS\r\n\t\t\t\t\t// 3. Remove the first state, Si, from OPEN SET ...\r\n\t\t\t\t\tcurrent = openSet.remove(0);\r\n\t\t\t\t} else {\r\n\t\t\t\t\t// Here is the 3rd step of the algorithms A* and Greedy\r\n\t\t\t\t\t// 3. Remove the first state, Si, from OPEN SET,\r\n\t\t\t\t\t// for which f(Si) ≤ f(Sj) for all other\r\n\t\t\t\t\t// open states Sj ...\r\n\t\t\t\t\t// (sort first OPEN SET list with respect to 'f')\r\n\t\t\t\t\tCollections.sort(openSet, new CellComparatorByF());\r\n\t\t\t\t\tcurrent = openSet.remove(0);\r\n\t\t\t\t}\r\n\t\t\t\t// ... and add it to CLOSED SET.\r\n\t\t\t\tclosedSet.add(0, current);\r\n\t\t\t\t// Update the color of the cell\r\n\t\t\t\tgrid[current.row][current.col] = CLOSED;\r\n\t\t\t\t// If the selected node is the target ...\r\n\t\t\t\tif (current.row == targetPos.row && current.col == targetPos.col) {\r\n\t\t\t\t\t// ... then terminate etc\r\n\t\t\t\t\tCell last = targetPos;\r\n\t\t\t\t\tlast.prev = current.prev;\r\n\t\t\t\t\tclosedSet.add(last);\r\n\t\t\t\t\tfound = true;\r\n\t\t\t\t\treturn;\r\n\t\t\t\t}\r\n\t\t\t\t// Count nodes that have been expanded.\r\n\t\t\t\texpanded++;\r\n\t\t\t\t// Here is the 4rd step of the algorithms\r\n\t\t\t\t// 4. Create the successors of Si, based on actions\r\n\t\t\t\t// that can be implemented on Si.\r\n\t\t\t\t// Each successor has a pointer to the Si, as its predecessor.\r\n\t\t\t\t// In the case of DFS and BFS algorithms, successors should not\r\n\t\t\t\t// belong neither to the OPEN SET nor the CLOSED SET.\r\n\t\t\t\tArrayList<Cell> succesors;\r\n\t\t\t\tsuccesors = createSuccesors(current, false);\r\n\t\t\t\t// Here is the 5th step of the algorithms\r\n\t\t\t\t// 5. For each successor of Si, ...\r\n\t\t\t\tfor (Cell cell : succesors) {\r\n\t\t\t\t\t// ... if we are running DFS ...\r\n\t\t\t\t\tif (dfs.isSelected()) {\r\n\t\t\t\t\t\t// ... add the successor at the beginning of the list\r\n\t\t\t\t\t\t// OPEN SET\r\n\t\t\t\t\t\topenSet.add(0, cell);\r\n\t\t\t\t\t\t// Update the color of the cell\r\n\t\t\t\t\t\tgrid[cell.row][cell.col] = FRONTIER;\r\n\t\t\t\t\t\t// ... if we are runnig BFS ...\r\n\t\t\t\t\t} else if (bfs.isSelected()) {\r\n\t\t\t\t\t\t// ... add the successor at the end of the list OPEN SET\r\n\t\t\t\t\t\topenSet.add(cell);\r\n\t\t\t\t\t\t// Update the color of the cell\r\n\t\t\t\t\t\tgrid[cell.row][cell.col] = FRONTIER;\r\n\t\t\t\t\t\t// ... if we are running A* or Greedy algorithms (step 5\r\n\t\t\t\t\t\t// of A* algorithm) ...\r\n\t\t\t\t\t} else if (aStar.isSelected() || guloso.isSelected()) {\r\n\t\t\t\t\t\t// ... calculate the value f(Sj) ...\r\n\t\t\t\t\t\tint dxg = current.col - cell.col;\r\n\t\t\t\t\t\tint dyg = current.row - cell.row;\r\n\t\t\t\t\t\tint dxh = targetPos.col - cell.col;\r\n\t\t\t\t\t\tint dyh = targetPos.row - cell.row;\r\n\t\t\t\t\t\tif (diagonal.isSelected()) {\r\n\t\t\t\t\t\t\t// with diagonal movements\r\n\t\t\t\t\t\t\t// calculate 1000 times the Euclidean distance\r\n\t\t\t\t\t\t\tif (guloso.isSelected()) {\r\n\t\t\t\t\t\t\t\t// especially for the Greedy ...\r\n\t\t\t\t\t\t\t\tcell.g = 0;\r\n\t\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t\tcell.g = current.g + (int) ((double) 1000 * Math.sqrt(dxg * dxg + dyg * dyg));\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\tcell.h = (int) ((double) 1000 * Math.sqrt(dxh * dxh + dyh * dyh));\r\n\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t// without diagonal movements\r\n\t\t\t\t\t\t\t// calculate Manhattan distances\r\n\t\t\t\t\t\t\tif (guloso.isSelected()) {\r\n\t\t\t\t\t\t\t\t// especially for the Greedy ...\r\n\t\t\t\t\t\t\t\tcell.g = 0;\r\n\t\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t\tcell.g = current.g + Math.abs(dxg) + Math.abs(dyg);\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\tcell.h = Math.abs(dxh) + Math.abs(dyh);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tcell.f = cell.g + cell.h;\r\n\t\t\t\t\t\t// ... If Sj is neither in the OPEN SET nor in the\r\n\t\t\t\t\t\t// CLOSED SET states ...\r\n\t\t\t\t\t\tint openIndex = isInList(openSet, cell);\r\n\t\t\t\t\t\tint closedIndex = isInList(closedSet, cell);\r\n\t\t\t\t\t\tif (openIndex == -1 && closedIndex == -1) {\r\n\t\t\t\t\t\t\t// ... then add Sj in the OPEN SET ...\r\n\t\t\t\t\t\t\t// ... evaluated as f(Sj)\r\n\t\t\t\t\t\t\topenSet.add(cell);\r\n\t\t\t\t\t\t\t// Update the color of the cell\r\n\t\t\t\t\t\t\tgrid[cell.row][cell.col] = FRONTIER;\r\n\t\t\t\t\t\t\t// Else ...\r\n\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t// ... if already belongs to the OPEN SET, then ...\r\n\t\t\t\t\t\t\tif (openIndex > -1) {\r\n\t\t\t\t\t\t\t\t// ... compare the new value assessment with the\r\n\t\t\t\t\t\t\t\t// old one.\r\n\t\t\t\t\t\t\t\t// If old <= new ...\r\n\t\t\t\t\t\t\t\tif (openSet.get(openIndex).f <= cell.f) {\r\n\t\t\t\t\t\t\t\t\t// ... then eject the new node with state\r\n\t\t\t\t\t\t\t\t\t// Sj.\r\n\t\t\t\t\t\t\t\t\t// (ie do nothing for this node).\r\n\t\t\t\t\t\t\t\t\t// Else, ...\r\n\t\t\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t\t\t// ... remove the element (Sj, old) from the\r\n\t\t\t\t\t\t\t\t\t// list\r\n\t\t\t\t\t\t\t\t\t// to which it belongs ...\r\n\t\t\t\t\t\t\t\t\topenSet.remove(openIndex);\r\n\t\t\t\t\t\t\t\t\t// ... and add the item (Sj, new) to the\r\n\t\t\t\t\t\t\t\t\t// OPEN SET.\r\n\t\t\t\t\t\t\t\t\topenSet.add(cell);\r\n\t\t\t\t\t\t\t\t\t// Update the color of the cell\r\n\t\t\t\t\t\t\t\t\tgrid[cell.row][cell.col] = FRONTIER;\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t// ... if already belongs to the CLOSED SET,\r\n\t\t\t\t\t\t\t\t// then ...\r\n\t\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t\t// ... compare the new value assessment with the\r\n\t\t\t\t\t\t\t\t// old one.\r\n\t\t\t\t\t\t\t\t// If old <= new ...\r\n\t\t\t\t\t\t\t\tif (closedSet.get(closedIndex).f <= cell.f) {\r\n\t\t\t\t\t\t\t\t\t// ... then eject the new node with state\r\n\t\t\t\t\t\t\t\t\t// Sj.\r\n\t\t\t\t\t\t\t\t\t// (ie do nothing for this node).\r\n\t\t\t\t\t\t\t\t\t// Else, ...\r\n\t\t\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t\t\t// ... remove the element (Sj, old) from the\r\n\t\t\t\t\t\t\t\t\t// list\r\n\t\t\t\t\t\t\t\t\t// to which it belongs ...\r\n\t\t\t\t\t\t\t\t\tclosedSet.remove(closedIndex);\r\n\t\t\t\t\t\t\t\t\t// ... and add the item (Sj, new) to the\r\n\t\t\t\t\t\t\t\t\t// OPEN SET.\r\n\t\t\t\t\t\t\t\t\topenSet.add(cell);\r\n\t\t\t\t\t\t\t\t\t// Update the color of the cell\r\n\t\t\t\t\t\t\t\t\tgrid[cell.row][cell.col] = FRONTIER;\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}","public void selectParents1() {\n // Create a new parent list for this reproductive cycle. Let the garbage\n // handler dispose of the old list, if there was one.\n switch (Defines.parentAlgo) {\n case Defines.PA_RANDOM:\n this.parents = this.selectParentsRandom();\n break;\n\n case Defines.PA_ROULETTE:\n this.parents = this.selectParentsRoulette();\n break;\n\n case Defines.PA_TOURNAMENT:\n this.parents = this.selectParentsTournament();\n break;\n }\n// this.howGoodAreParents();\n }","public void growthCycle() {\n\t\tboolean doMore = true;\n\t\tdo {\n\t\t\tdoMore = false;\n\t\t\tgrower = planter;\n\t\t\tCollections.shuffle(grower, random);\n\t\t\tplanter = new ArrayList<Room>();\n\t\t\tfor(Room room : grower) {\n\t\t\t\tif(rooms.size() >= size.maxRooms) {\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif(room.plantChildren(this)) {\n\t\t\t\t\t//System.out.println(\"Added side room.\");\n\t\t\t\t\tdoMore = true;\n\t\t\t\t}\n\t\t\t} \n\t\t} while(doMore);\t\t\n\t\t//DoomlikeDungeons.profiler.endTask(\"Adding Rooms (growthCycle)\");\n\t}","public void selectParents() {\n // Create a new parent list for this reproductive cycle. Let the garbage\n // handler dispose of the old list, if there was one.\n switch (Defines.parentAlgo) {\n case Defines.PA_RANDOM:\n this.parents = this.selectParentsRandom();\n break;\n\n case Defines.PA_ROULETTE:\n this.parents = this.selectParentsRoulette();\n break;\n\n case Defines.PA_TOURNAMENT:\n this.parents = this.selectParentsTournament();\n break;\n }\n// this.howGoodAreParents();\n }","protected void siftDown() {\r\n\t\tint parent = 0, child = (parent << 1) + 1;// preguntar porque 0 y no 1\r\n\t\t\r\n\t\twhile (child < theHeap.size()) {\r\n\t\t\tif (child < theHeap.size() - 1\r\n\t\t\t\t\t&& compare(theHeap.get(child), theHeap.get(child + 1)) > 0)\r\n\t\t\t\tchild++; // child is the right child (child = (2 * parent) + 2)\r\n\t\t\tif (compare(theHeap.get(child), theHeap.get(parent)) >= 0)\r\n\t\t\t\tbreak;\r\n\t\t\tswap(parent, child);\r\n\t\t\tparent = child;\r\n\t\t\tchild = (parent << 1) + 1; // => child = (2 * parent) + 1\r\n\t\t}\r\n\t}","ArrayList<Cell> getChildren(Integer[][] level){\n int[][] values={{0,1},{0,-1},{1,0},{-1,0}};\n ArrayList<Cell> children = new ArrayList<>();\n for (int i = 0; i < values.length; i++){\n if (isLegalMove(this.getI()+values[i][0], this.getJ()+values[i][1],level)){\n children.add(new Cell(this.getI()+values[i][0], this.getJ()+values[i][1]));\n }\n }\n //the code below achieves the same goal; still here for clarity\n\n// if (isLegalMove(this.getI(), this.getJ()+1, level)) {\n// children.add(new Cell(this.getI(), this.getJ()+1));\n// }\n// if (isLegalMove(this.getI(), this.getJ()-1, level)) {\n// children.add(new Cell(this.getI(), this.getJ()-1));\n// }\n// if (isLegalMove(this.getI()+1, this.getJ(), level)) {\n// children.add(new Cell(this.getI()+1, this.getJ()));\n// }\n// if (isLegalMove(this.getI()-1, this.getJ(), level)) {\n// children.add(new Cell(this.getI()-1, this.getJ()));\n// }\n return children;\n }","public static void breedAll() {\n int a, b; //Pointers to select parents\n\n //While loop to ensure full carrying capacity of population\n while (Population.size() <= maxPop) {\n //Sorts by Fitness level first\n sortByFitlvl();\n\n //Selects Two Random Parents\n a = (int) (Math.abs(Utilities.sharpGauss(4)) * Population.size());\n b = (int) (Math.abs(Utilities.sharpGauss(4)) * Population.size());\n //System.out.println(a+\"\\t\"+b+\"\\t\"+Population.size());\n\n // Between 1-2 children\n int children = rand.nextInt(2)+1;\n for (int i = 0; i < children; i++) {\n Population.add(Breeder.breed(Population.get(a), Population.get(b), 0.1));\n }\n\n //sortByFitlvl();\n }\n\n if (debug)\n printPopulation(true);\n }","private Board DLS(Board start, Board goal, int depth) {\n Board found = null;\n // Paso base: Si start es la solucion y esta en el ultimo nivel, regresa\n if((depth == 0) && start.equals(goal)) {\n return start;\n }\n // Si el nivel aun no es el ultimo, se obtienen los nodos hijos\n // y se vuelve a llamar la funcion en ellos\n else if(depth > 0) {\n // Obtiene los nodos hijos\n // Todas las posibles configuraciones del tablero que se pueden\n // hacer a partir de la actual\n ArrayList<Board> children = start.expand();\n\n expandedNodes++;\n\n // Para cada hijo vuelve a hacer lo mismo\n for(Board child : children) {\n found = DLS(child, goal, depth - 1);\n if(found != null)\n return found;\n }\n }\n return null;\n }","private void doRecurse(String destNodeType, List<List<EdgeType>> keepPaths,\r\n\t\t\t List<List<EdgeType>> testPaths, int maxLength)\r\n {\r\n\tfor (final List<EdgeType> path : testPaths)\r\n\t{\r\n\t // If the last element in this path has a matching\r\n\t // destNodeType, then we found a suitable path. Add it to\r\n\t // the \"keep\" list.\r\n\t if (path.get(path.size()-1).getDestType().equals(destNodeType))\r\n\t\tkeepPaths.add(path);\r\n\t else if (maxLength > 0)\r\n\t\t// We don't have a match. If we haven't reached our\r\n\t\t// maximum length, recurse one level and keep looking.\r\n\t\tdoRecurse(destNodeType, keepPaths,\r\n\t\t\t buildLongerPaths(path), maxLength-1);\r\n\t}\r\n }","private static void findOptimalTree(int i, int j, int[][] nodeMatrix) {\n\t\tif(i!=j){\n\t\t\tint root = nodeMatrix[i][j];\n\t\t\tSystem.out.println(\" root for \"+i+\" to \"+j+\" elements would be \"+root);\n\t\t\tfindOptimalTree(i, root-1, nodeMatrix);\n\t\t\tfindOptimalTree(root+1, j, nodeMatrix);\n\t\t}\n\t}","public void bfs(Pair<Integer, Integer> current, Pair<Integer, Integer> goal) {\n var visited = new HashSet<Pair<Integer, Integer>>(300);\n var queue = new LinkedList<Pair<Integer, Integer>>();\n \n visited.add(current);\n queue.add(current);\n \n while (!queue.isEmpty()) {\n var toVisit = queue.poll();\n if (goal.equals(toVisit)) {\n goal.setParent(toVisit);\n toVisit.setChild(goal);\n break;\n }\n var neighbors = Utils.getNeighbors(toVisit);\n neighbors.forEach(p -> {\n // only move through SAFE tiles!\n // unless the neighbor is goal node!\n if (p.equals(goal) ||\n (!visited.contains(p) &&\n grid[p.getA()][p.getB()].getTileTypes().contains(Tile.SAFE)))\n {\n visited.add(p);\n p.setParent(toVisit);\n toVisit.setChild(p);\n queue.add(p);\n }\n });\n }\n }","public boolean reducible() {\n if (dfsTree.back.isEmpty()) {\n return true;\n }\n int size = controlFlow.transitions.length;\n boolean[] loopEnters = dfsTree.loopEnters;\n TIntHashSet[] cycleIncomings = new TIntHashSet[size];\n // really this may be array, since dfs already ensures no duplicates\n TIntArrayList[] nonCycleIncomings = new TIntArrayList[size];\n int[] collapsedTo = new int[size];\n int[] queue = new int[size];\n int top;\n for (int i = 0; i < size; i++) {\n if (loopEnters[i]) {\n cycleIncomings[i] = new TIntHashSet();\n }\n nonCycleIncomings[i] = new TIntArrayList();\n collapsedTo[i] = i;\n }\n\n // from whom back connections\n for (Edge edge : dfsTree.back) {\n cycleIncomings[edge.to].add(edge.from);\n }\n // from whom ordinary connections\n for (Edge edge : dfsTree.nonBack) {\n nonCycleIncomings[edge.to].add(edge.from);\n }\n\n for (int w = size - 1; w >= 0 ; w--) {\n top = 0;\n // NB - it is modified later!\n TIntHashSet p = cycleIncomings[w];\n if (p == null) {\n continue;\n }\n TIntIterator iter = p.iterator();\n while (iter.hasNext()) {\n queue[top++] = iter.next();\n }\n\n while (top > 0) {\n int x = queue[--top];\n TIntArrayList incoming = nonCycleIncomings[x];\n for (int i = 0; i < incoming.size(); i++) {\n int y1 = collapsedTo[incoming.getQuick(i)];\n if (!dfsTree.isDescendant(y1, w)) {\n return false;\n }\n if (y1 != w && p.add(y1)) {\n queue[top++] = y1;\n }\n }\n }\n\n iter = p.iterator();\n while (iter.hasNext()) {\n collapsedTo[iter.next()] = w;\n }\n }\n\n return true;\n }","public static void main(String[] args) {\n\t\tArrayList<Robot> robots = new ArrayList<>();\n\t\tArrayList<Node> nodes = new ArrayList<>();\n\t\t//This allows for different home and feeder locations\n\t\tNode redFeeder = new Node(0, 10, 4, true);\n\t\tNode yelFeeder = new Node(0, 5, 10, false);\n\t\tNode home = new Node(0, 0, 0, true);\n\n\t\t//Insert the nodes listed from the homework\n\t\tnodes.add(new Node(1, 2, 2, true));\n\t\tnodes.add(new Node(2, 1, 5, false));\n\t\tnodes.add(new Node(3, 3, 7, true));\n\t\tnodes.add(new Node(4, 5, 9, false));\n\t\tnodes.add(new Node(5, 7, 3, true));\n\t\tnodes.add(new Node(6, 8, 1, true));\n\t\tnodes.add(new Node(7, 8, 5, true));\n\t\tnodes.add(new Node(8, 4, 6, false));\n\t\tnodes.add(new Node(9, 6, 8, false));\n\t\tnodes.add(new Node(10, 9, 7, false));\n\n\t\t//Set counter for while loop later\n\t\tint counter = 1;\n\n\t\t//Create initial 10 parents\n\t\tfor (int i = 0; i < 10; i++) {\n\t\t\trobots.add(new Robot());\n\n\t\t\t//Set the home and feeders\n\t\t\trobots.get(i).setHome(home.getX(), home.getY());\n\t\t\trobots.get(i).setRedFeeder(redFeeder.getX(), redFeeder.getY());\n\t\t\trobots.get(i).setYellowFeeder(yelFeeder.getX(), yelFeeder.getY());\n\n\t\t\t//Create a temp node list to shuffle\n\t\t\tArrayList<Node> tempNodes = nodes;\n\t\t\tCollections.shuffle(tempNodes);\n\n\t\t\t//Iterate through and add the nodes based on the value not the reference (caused lots of issues before\n\t\t\t//I figured that out\n\t\t\tfor (int j = 0; j < 10; j++)\n\t\t\t\trobots.get(i).in(new Node(tempNodes.get(j).getE(), tempNodes.get(j).getX(),\n\t\t\t\t\t\ttempNodes.get(j).getY(), tempNodes.get(j).isRed()));\n\t\t}\n\n\t\t//Go for 300k iterations, can be changed on a whim\n\t\twhile (counter <= 300000) {\n\n\t\t\t//Output every 10k iterations, can be changed\n\t\t\tif (counter % 10000 == 0) {\n\t\t\t\tSystem.out.println(\"Loop \" + (counter));\n\t\t\t\tfor (Robot r : robots) {\n\t\t\t\t\tr.printNodes();\n\t\t\t\t\tSystem.out.println(\" - \" + r.calcTotalDist());\n\t\t\t\t}\n\n\t\t\t\tSystem.out.println();\n\t\t\t}\n\n\t\t\tint size = robots.size();\n\t\t\t//Create children based on two parents and add them to the robots list\n\t\t\tfor (int i = 0; i < size; i += 2) {\n\t\t\t\tint x = ThreadLocalRandom.current().nextInt(1, 8);\n\t\t\t\tRobot temp = robots.get(i).getFirstHalf(x);\n\t\t\t\ttemp.addSecondHalf(robots.get(i + 1), x);\n\n\t\t\t\ttemp.setHome(home.getX(), home.getY());\n\t\t\t\ttemp.setRedFeeder(redFeeder.getX(), redFeeder.getY());\n\t\t\t\ttemp.setYellowFeeder(yelFeeder.getX(), yelFeeder.getY());\n\n\t\t\t\trobots.add(temp);\n\t\t\t}\n\n\t\t\t//Sort the list of robots based on the Comparator that uses the totalDistance\n\t\t\tCollections.sort(robots);\n\n\t\t\t//Remove the last 5 (largest) items from the list\n\t\t\tfor (int i = robots.size() - 1; i > 9; i--) {\n\t\t\t\trobots.remove(i);\n\t\t\t}\n\n\t\t\t//Shuffle the list again to hope for totally random stuff\n\t\t\tCollections.shuffle(robots);\n\t\t\tcounter++;\n\t\t}\n\n\t\t//Irrelevant but useful in testing\n\t\treturn;\n\t}","private void percolateDown(int index) {\n int childLevel = NUM_CHILDREN * index + 1;\r\n if (childLevel < length) {\r\n int smallestChild = childLevel;\r\n for (int n = 0; n < NUM_CHILDREN; n++) {\r\n int childIndex = childLevel + n;\r\n if (childIndex < length && heap[smallestChild].compareTo(heap[childIndex]) > 0) {\r\n smallestChild = childIndex;\r\n }\r\n }\r\n // now we have the smallest child, swap it with root and recurse4, 5\r\n if (heap[smallestChild].compareTo(heap[index]) < 0) {\r\n swap(smallestChild, index);\r\n percolateDown(smallestChild);\r\n }\r\n }\r\n }","private PersistentLinkedList<T> pop() {\n //the latest element won't become empty\n int index = this.treeSize - 1;\n Node<T> newRoot = new Node<>(branchingFactor);\n\n Node<T> currentNode = this.root;\n Node<T> currentNewNode = newRoot;\n\n ArrayList<Node<T>> newNodes = new ArrayList<>();\n newNodes.add(newRoot);\n ArrayList<Integer> newNodesIndices = new ArrayList<>();\n\n for (int b = base; b > 1; b = b / branchingFactor) {\n TraverseData traverseData = traverseOneLevel(\n new TraverseData(currentNode, currentNewNode, newRoot, index, b));\n currentNode = traverseData.currentNode;\n currentNewNode = traverseData.currentNewNode;\n newNodes.add(currentNewNode);\n newNodesIndices.add(index / b);\n index = traverseData.index;\n }\n newNodesIndices.add(index);\n\n for (int i = 0; i < branchingFactor && i < index; i++) {\n currentNewNode.set(i, currentNode.get(i));\n }\n currentNewNode.set(index, null);\n\n if (index == 0) {\n int latestIndex = newNodes.size() - 2;\n newNodes.get(latestIndex).set(newNodesIndices.get(latestIndex), null);\n\n for (int i = latestIndex; i > 0; i--) {\n if (newNodesIndices.get(i) == 0) {\n newNodes.get(i - 1).set(newNodesIndices.get(i - 1), null);\n } else {\n break;\n }\n }\n }\n\n if (newNodes.size() > 1) {\n int nonNullChildren = 0;\n for (Node<T> child : newRoot.children) {\n if (child != null) {\n nonNullChildren++;\n }\n }\n if (nonNullChildren == 1) { //need new root\n newRoot = newRoot.get(0);\n return new PersistentLinkedList<>(newRoot, this.branchingFactor, this.depth - 1,\n this.base / branchingFactor, this.treeSize - 1, unusedTreeIndices,\n indexCorrespondingToTheFirstElement, indexCorrespondingToTheLatestElement);\n }\n }\n return new PersistentLinkedList<>(newRoot, this.branchingFactor, this.depth, this.base,\n this.treeSize - 1, unusedTreeIndices, indexCorrespondingToTheFirstElement,\n indexCorrespondingToTheLatestElement);\n }","private int alphaBetaMinimax (GameTreeNode node, int alpha, int beta, boolean isMax, Map<GameTreeNode, Integer> visited) {\n\n if(node.remaining == 0) {\n //System.out.println(\"Terminal State: Up : Score \" + node.score);\n return node.score;\n }\n if(visited.containsKey(node)) {\n //System.out.println(\"Memoized State: Up : Score \" + visited.get(node));\n return visited.get(node);\n }\n \n \n if(isMax) {\n int minimaxScore = Integer.MIN_VALUE;\n for(int i = 0; i < MAX_REMOVAL; i++) {\n \n GameTreeNode expandingChild = node.generateChild(1 + i);\n \n if(expandingChild == null) {\n break;\n }\n \n //System.out.println(\"Remaining \" + node.remaining + \" Down\");\n //\n minimaxScore = Math.max(minimaxScore, alphaBetaMinimax(expandingChild, alpha, beta, false, visited));\n alpha = Math.max(alpha, minimaxScore);\n //\n //System.out.println(\"Remaining \" + node.remaining + \" Up : Score: \" + minimaxScore);\n //\n if(beta <= alpha) {\n //System.out.println(\"Pruning: \" + node.remaining + \" child index \" + i+1);\n break;\n }\n }\n visited.put(node, minimaxScore);\n node.score = minimaxScore;\n return minimaxScore;\n }\n else {\n int minimaxScore = Integer.MAX_VALUE;\n for(int i = 0; i < MAX_REMOVAL; i++) {\n \n GameTreeNode expandingChild = node.generateChild(1 + i);\n if(expandingChild == null) {\n break;\n }\n //\n \n //\n //System.out.println(\"Remaining \" + node.remaining + \" Down\");\n //\n minimaxScore = Math.min(minimaxScore, alphaBetaMinimax(expandingChild, alpha, beta, true, visited));\n beta = Math.min(beta, minimaxScore);\n //\n //System.out.println(\"Remaining \" + node.remaining + \" Up : Score: \" + minimaxScore);\n //\n if(beta <= alpha) {\n //System.out.println(\"Pruning: \" + node.remaining + \" child index \" + i+1);\n break;\n }\n }\n visited.put(node, minimaxScore);\n node.score = minimaxScore;\n return minimaxScore;\n }\n }","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\tStringTokenizer st = new StringTokenizer(br.readLine());\n\t\tN = Integer.parseInt(st.nextToken());\n\t\t\n\t\tint size = 1;\n\t\twhile(max_node > size) {\n\t\t\tsize *= 2;\n\t\t\tmax_level++;\n\t\t}\n\t\t\n\t\tfor(int i=0; i<= N; i++)\n\t\t{\n\t\t\tadj.add(new ArrayList<>());\n\t\t}\n\t\t\n\t\tint dx=0, dy=0, dz = 0;\n\t\tfor(int i=1; i<= N-1; i++)\n\t\t{\n\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\tdx = Integer.parseInt(st.nextToken());\n\t\t\tdy = Integer.parseInt(st.nextToken());\n\t\t\tadj.get(dx).add(dy);\n\t\t\tadj.get(dy).add(dx);\n\t\t}\n\t\t\n\t\tdepth[0] = -1;\n\t\tdfs(1,0);\n\t\t\n\t\tst = new StringTokenizer(br.readLine());\n\t\tM = Integer.parseInt(st.nextToken());\n\t\tfor(int i=1; i<= M; i++)\n\t\t{\n\t\t\tst = new StringTokenizer(br.readLine());\n\t\t\tdx = Integer.parseInt(st.nextToken());\n\t\t\tdy = Integer.parseInt(st.nextToken());\n\t\t\tdz = Integer.parseInt(st.nextToken());\n\t\t\tcurDepth = -1; result = -1;\n\t\t\t\n\t\t\tquery(dx, dy);\n\t\t\tquery(dx, dz);\n\t\t\tquery(dy, dz);\n\t\t\t\n\t\t\tbw.write(result+\"\\n\");\n\t\t}\n\t\tbw.flush();\n\t}","GameTreeNode (int remaining, int action, boolean isMax) {\n this.remaining = remaining; //Stones Left\n this.action = action; //Actions Taken\n this.isMax = isMax; \n children = new ArrayList<>(); //Children\n score = -1; //Utility Score\n \n if(this.remaining == 0 && isMax) {\n score = 0;\n }\n else {\n score = 1;\n }\n }","public ArrayList<PentagoGame> nextPossibleMoves() {\n ArrayList<PentagoGame> children = new ArrayList<>();\n for(int i = 0; i < 6; i++) { // for each row I can place a piece\n for(int j = 0; j < 6; j++) { // for each column\n for(int k = 0; k < 4; k++ ) { // for each board to rotate\n for(int d = 0; d < 2; d ++) {// for each direction to rotate\n boolean leftRotate = false;\n if(d == 0) {\n leftRotate = true;\n }\n Move move = new Move(i, j, k, leftRotate);\n if(validMove(whosTurn(), move)) {\n PentagoGame tempGame = new PentagoGame(this);\n tempGame.playPiece(whosTurn(), move);\n tempGame.rotateBoard(whosTurn(), move);\n tempGame.turnOver();\n move.setGameState(tempGame);\n move.setUtility(calulateUtility(move));\n // todo\n children.add(tempGame);\n }\n }\n }\n }\n }\n\n return children;\n }","node GrowthTreeGen(int maxdepth){\n\t\tint i;\n\t\tbyte a;\n\t\tnode t, p;\n\t\tif(maxdepth == 0) // to the limit then choose a terminal\n\t\t{\n\t\t\ti = IRandom(0, gltcard - 1);\n\t\t\tt = new node(glterminal[i].name, VOIDVALUE);\n\t\t\treturn t;\n\t\t} \n\t\telse // choosing from function and terminal\n\t\t {\n\t\t\ti = IRandom(0, gltermcard - 1);\n\t\t\tt = new node(glterm[i].name, VOIDVALUE);\n\t\t\tif(glterm[i].arity > 0) // if it is function\n\t\t\t{\n\t\t\t\tt.children = GrowthTreeGen(maxdepth - 1);\n\t\t\t\tp = t.children;\n\t\t\t\tfor(a = 1; a < glterm[i].arity; a++) {\n\t\t\t\t\tp.sibling = GrowthTreeGen(maxdepth - 1);\n\t\t\t\t\tp = p.sibling;\n\t\t\t\t}\n\t\t\t\tp.sibling = null;\n\t\t\t}\n\t\t\treturn t;\n\t\t}\n\t}","public abstract int getMaxChildren();","@Override\n \tpublic Solution solve() {\n \t\tfor (int i = 0; i < n; i++) {\n \t\t\tnest[i] = generator.getSolution();\n \t\t}\n \n \t\tfor (int t = 0; t < maxGeneration; t++) { // While (t<MaxGeneration) or\n \t\t\t\t\t\t\t\t\t\t\t\t\t// (stop criterion)\n \t\t\t// Get a cuckoo randomly (say, i) and replace its solution by\n \t\t\t// performing random operations;\n \t\t\tint i = r.nextInt(n);\n \t\t\tSolution randomNest = nest[i];\n \t\t\t//FIXME: randomNest = solutionModifier.modify(nest[i]);\n \n \t\t\t// Evaluate its quality/fitness\n \t\t\tint fi = randomNest.f();\n \n \t\t\t// Choose a nest among n (say, j) randomly;\n \t\t\tint j = r.nextInt(n);\n \t\t\tint fj = f[j];\n \n \t\t\tif (fi > fj) {\n \t\t\t\tnest[i] = randomNest;\n \t\t\t\tf[i] = fi;\n \t\t\t}\n \n \t\t\tsort();\n \t\t\t// A fraction (pa) of the worse nests are abandoned and new ones are built;\n\t\t\tfor(i = n-toAbandon; i<n; i++) {\n \t\t\t\tnest[i] = generator.getSolution();\n \t\t\t}\n \t\t\t\n \t\t\t// Rank the solutions/nests and find the current best;\n \t\t\tsort();\n \t\t}\n \n \t\treturn nest[0];\n \t}","void buildHeap() {\n\tfor(int i=parent(size-1); i>=0; i--) {\n\t percolateDown(i);\n\t}\n }","public static Goal[] createEverythingGoals() {\n\t\t// [ & ] <--- rootGoal1\n\t\t// / / \\ \\\n\t\t// P T E M\n\t\t//\n\t\tCompositeGoal rootGoal1 = new CompositeGoal(CompositeGoal.and);\n\t\trootGoal1.addChild(new PuzzleGoal());\n\t\trootGoal1.addChild(new TreasureGoal());\n\t\trootGoal1.addChild(new EnemiesGoal());\n\t\trootGoal1.addChild(new MazeGoal());\n\t\t\n\t\t\n\t\tCompositeGoal subGoal1 = new CompositeGoal(CompositeGoal.and);\n\t\tsubGoal1.addChild(new EnemiesGoal());\n\t\tsubGoal1.addChild(new TreasureGoal());\n\t\tsubGoal1.addChild(new MazeGoal());\n\t\t\n\t\tCompositeGoal subGoal2 = new CompositeGoal(CompositeGoal.and);\n\t\tsubGoal2.addChild(new PuzzleGoal());\n\t\tsubGoal2.addChild(new TreasureGoal());\n\t\tsubGoal2.addChild(subGoal1);\n\t\t\n\t\t// [ | ] <--- rootGoal2\n\t\t// / \\\n\t\t// I [ & ] <---- subGoal2\n\t\t// / | \\\n\t\t// P T [ & ] <---- subGoal1\n\t\t// /|\\\n\t\t// E T M\n\t\tCompositeGoal rootGoal2 = new CompositeGoal(CompositeGoal.or);\n\t\trootGoal2.addChild(new ImpossibleGoal());\n\t\trootGoal2.addChild(subGoal2);\n\n\t\t\n\t\tString goalString = \"\"\n\t\t\t+ \" { \\\"goal\\\": \\\"AND\\\", \\\"subgoals\\\":\\n\"\n\t\t\t+ \" [ { \\\"goal\\\": \\\"exit\\\" },\\n\"\n\t\t\t+ \" { \\\"goal\\\": \\\"AND\\\", \\\"subgoals\\\":\\n\"\n\t\t\t+ \" [ {\\\"goal\\\": \\\"treasure\\\" },\\n\"\n\t\t\t+ \" { \\\"goal\\\": \\\"AND\\\", \\\"subgoals\\\":\\n\"\n\t\t\t+ \" [ {\\\"goal\\\": \\\"enemies\\\" },\\n\"\n\t\t\t+ \" {\\\"goal\\\": \\\"boulders\\\" }\\n\"\n\t\t\t+ \" ]\\n\"\n\t\t\t+ \" }\\n\"\n\t\t\t+ \" ]\\n\"\n\t\t\t+ \" }\\n\"\n\t\t\t+ \" ]\\n\"\n\t\t\t+ \" }\\n\";\n\t\t\n\t\tJSONObject json = new JSONObject(new JSONTokener(goalString));\n\t\tGoal goal3 = Goal.createGoal(json);\n\t\t\n\t\treturn new Goal[]{ rootGoal1, rootGoal2, goal3 };\n\t}","private static void greedyRisk(Person curPerson, Map<String, Person> persons) throws FileNotFoundException {\n\t\tclass DisComparator implements Comparator<Person> {\n\t\t\tpublic int compare(Person a, Person b) {\n\t\t\t\treturn a.getEstDistRisk() - b.getEstDistRisk();\n\t\t\t} \n\t\t}\n\t\t\n\t\tPriorityQueue<Person> pqueue = new PriorityQueue<Person>(persons.size(), new DisComparator());\t\t\n\t\tpqueue.add(curPerson);\n\t\t\n\t\touterloop:\n\t\twhile(!pqueue.isEmpty()) {\n\t\t\tcurPerson = pqueue.poll();\t\n\t\t\t\n\t\t\tArrayList<Person> children = curPerson.getConnected();\n\t\t\tPerson child;\n\t\t\tfor(int i = 0; i < children.size(); i++) {\n\t\t\t\tchild = children.get(i);\n\t\t\t\tif(!child.getMarked()) {\n\t\t\t\t\tchild.setRoute(curPerson);\n\t\t\t\t\tchild.setMarked();\n\t\t\t\t\tif(child.getName().equals(\"Noah\")) {\t//check when generated\n\t\t\t\t\t\tcurPerson = child;\n\t\t\t\t\t\tbreak outerloop;\n\t\t\t\t\t}\n\t\t\t\t\tpqueue.add(child);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\toutputResult(curPerson, \"Greedy.risk.result.txt\");\n\t}","private void phaseOne(){\r\n\r\n\t\twhile (allNodes.size() < endSize){\r\n\r\n\t\t\ttry (Transaction tx = graphDb.beginTx()){\r\n\t\t\t\t//Pick a random node from allNodes\r\n\t\t\t\tint idx = random.nextInt(allNodes.size());\r\n\t\t\t\tNode node = allNodes.get(idx);\r\n\r\n\t\t\t\t//Get all relationships of node\t\t\t\t\r\n\t\t\t\tIterable<Relationship> ite = node.getRelationships(Direction.BOTH);\r\n\t\t\t\tList<Relationship> tempRels = new ArrayList<Relationship>();\r\n\r\n\t\t\t\t//Pick one of the relationships uniformly at random.\r\n\t\t\t\tfor (Relationship rel : ite){\r\n\t\t\t\t\ttempRels.add(rel);\r\n\t\t\t\t}\r\n\r\n\t\t\t\tidx = random.nextInt(tempRels.size());\r\n\t\t\t\tRelationship rel = tempRels.get(idx);\r\n\t\t\t\tNode neighbour = rel.getOtherNode(node);\r\n\r\n\t\t\t\t//Add the neighbour to allNodes\r\n\t\t\t\tif (!allNodes.contains(neighbour)){\r\n\t\t\t\t\tallNodes.add(neighbour);\r\n\t\t\t\t}\r\n\r\n\t\t\t\ttx.success();\r\n\r\n\t\t\t}\r\n\t\t}\r\n\t\t//If reached here, then phase one completed successfully.\r\n\t\treturn;\r\n\t}","public void determinePartitions( Callback c ){\n mCurrentDepth = 0;\n GraphNode node;\n GraphNode child;\n int depth = 0;\n List levelList = new java.util.LinkedList();\n int i = 0;\n //they contain those nodes whose parents have not been traversed as yet\n //but the BFS did it.\n List orphans = new java.util.LinkedList();\n\n\n //set the depth of the dummy root as 0\n mRoot.setDepth( mCurrentDepth );\n\n mQueue.addLast( mRoot );\n\n while( !mQueue.isEmpty() ){\n node = (GraphNode)mQueue.getFirst();\n depth = node.getDepth();\n if( mCurrentDepth < depth ){\n\n if( mCurrentDepth > 0 ){\n //we are done with one level!\n constructPartitions( c, levelList, mCurrentDepth );\n }\n\n\n //a new level starts\n mCurrentDepth++;\n levelList.clear();\n }\n mLogger.log( \"Adding to level \" + mCurrentDepth + \" \" + node.getID(),\n LogManager.DEBUG_MESSAGE_LEVEL);\n levelList.add( node );\n\n //look at the orphans first to see if any\n //of the dependency has changed or not.\n /*it = orphans.iterator();\n while(it.hasNext()){\n child = (GraphNode)it.next();\n if(child.parentsBlack()){\n child.setDepth(depth + 1);\n System.out.println(\"Set depth of \" + child.getID() + \" to \" + child.getDepth());\n\n child.traversed();\n mQueue.addLast(child);\n }\n\n //remove the child from the orphan\n it.remove();\n }*/\n\n\n node.setColor( GraphNode.BLACK_COLOR );\n for( Iterator it = node.getChildren().iterator(); it.hasNext(); ){\n child = (GraphNode)it.next();\n if(!child.isColor( GraphNode.GRAY_COLOR ) &&\n child.parentsColored( GraphNode.BLACK_COLOR )){\n mLogger.log( \"Adding to queue \" + child.getID(),\n LogManager.DEBUG_MESSAGE_LEVEL );\n child.setDepth( depth + 1 );\n child.setColor( GraphNode.GRAY_COLOR );\n mQueue.addLast( child );\n }\n /*else if(!child.isTraversed() && !child.parentsBlack()){\n //we have to do the bumping effect\n System.out.println(\"Bumping child \" + child);\n orphans.add(child);\n }*/\n }\n node = (GraphNode)mQueue.removeFirst();\n mLogger.log( \"Removed \" + node.getID(),\n LogManager.DEBUG_MESSAGE_LEVEL);\n }\n\n //handle the last level of the BFS\n constructPartitions( c, levelList, mCurrentDepth );\n\n\n //all the partitions are dependant sequentially\n for( i = mCurrentDepth; i > 1; i-- ){\n constructLevelRelations( c, i - 1, i );\n\n }\n\n done( c );\n }","public ArrayList<UUSearchNode> getSuccessors() {\n\n ArrayList<UUSearchNode> successors = new ArrayList<UUSearchNode>();//this will be returned\n ArrayList<CannibalNode> helper = new ArrayList<CannibalNode>();\n\n if (this.state[2]==1){ //if the boat is on the starting shore\n helper.add(new CannibalNode(this.state[0] - 2, this.state[1],\n this.state[2] - 1, this.depth + 1)); //subtracting <201>\n helper.add(new CannibalNode(this.state[0], this.state[1] - 2,\n this.state[2] - 1, this.depth + 1)); //subtracting <021>\n helper.add(new CannibalNode(this.state[0] - 1, this.state[1] - 1,\n this.state[2] - 1, this.depth + 1)); //subtracting <111>\n helper.add(new CannibalNode(this.state[0] - 1, this.state[1],\n this.state[2] - 1, this.depth + 1)); //subtracting <101>\n helper.add(new CannibalNode(this.state[0], this.state[1] - 1,\n this.state[2] - 1, this.depth + 1)); //subtracting <011>\n }else{ //if the boat is on the opposite shore\n helper.add(new CannibalNode(this.state[0] + 2, this.state[1],\n this.state[2] + 1, this.depth + 1)); //adding <201>\n helper.add(new CannibalNode(this.state[0], this.state[1] + 2,\n this.state[2] + 1, this.depth + 1)); //adding <021>\n helper.add(new CannibalNode(this.state[0] + 1, this.state[1] + 1,\n this.state[2] + 1, this.depth + 1)); //adding <111>\n helper.add(new CannibalNode(this.state[0] + 1, this.state[1],\n this.state[2] + 1, this.depth + 1)); //adding <101>\n helper.add(new CannibalNode(this.state[0], this.state[1] + 1,\n this.state[2] + 1, this.depth + 1)); //adding <011>\n }\n\n //now we check for feasibility and legality\n for(CannibalNode n : helper){\n if(isFeasibleState(n.state) && isLegalState(n.state)){\n successors.add(n);\n }\n }\n return successors;\n }","private TakTree<TakPiece> treeBuilder(TakTree<TakPiece> tree, Point startingPoint, ArrayList<Point> visited){\n if(containsWinningPath(visited)){\n // Did white or black win?\n if(getTop(startingPoint).isWhite()){\n whiteWins = true;\n } else {\n blackWins = true;\n }\n\n // return our tree because this is certainly a leaf node\n return tree;\n }\n\n Point right = new Point(startingPoint.x + 1, startingPoint.y);\n Point left = new Point(startingPoint.x - 1, startingPoint.y);\n Point up = new Point(startingPoint.x, startingPoint.y - 1);\n Point down = new Point(startingPoint.x, startingPoint.y + 1);\n\n\n // Check for backtracking right\n if(isValidAndSimilar(right, startingPoint) && !visitedContains(visited, right)){\n // Create new subtree with our right as root\n TakTree<TakPiece> treeToAttach = new TakTree<>();\n treeToAttach.addRoot(getTop(right));\n //Add this position to the visited array\n visited.add(right);\n // Attach subtree to right position\n tree.attachRight(treeBuilder(treeToAttach, right, visited));\n }\n\n // Try to build left subtree\n if(isValidAndSimilar(left, startingPoint) && !visitedContains(visited, left)){\n // Create new subtree with our right as root\n TakTree<TakPiece> treeToAttach = new TakTree<>();\n treeToAttach.addRoot(getTop(left));\n //Add this position to the visited array\n visited.add(left);\n // Attach subtree to right position\n tree.attachLeft(treeBuilder(treeToAttach, left, visited));\n }\n\n // Try to build up subtree\n if(isValidAndSimilar(up, startingPoint) && !visitedContains(visited, up)){\n // Create new subtree with our right as root\n TakTree<TakPiece> treeToAttach = new TakTree<>();\n treeToAttach.addRoot(getTop(up));\n //Add this position to the visited array\n visited.add(up);\n // Attach subtree to right position\n tree.attachUp(treeBuilder(treeToAttach, up, visited));\n }\n\n // Try to build down subtree\n if(isValidAndSimilar(down, startingPoint) && !visitedContains(visited, down)){\n\n // Create new subtree with our right as root\n TakTree<TakPiece> treeToAttach = new TakTree<>();\n treeToAttach.addRoot(getTop(down));\n //Add this position to the visited array\n visited.add(down);\n // Attach subtree to right position\n tree.attachDown(treeBuilder(treeToAttach, down, visited));\n }\n\n return tree;\n }","public ArrayList<Edge> Prim (String s){\n Node Start = nodeMap.get(s);\n mst = new ArrayList<>();\n HashMap<String, String> inserted = new HashMap<String, String>();\n ArrayList<Edge> failed = new ArrayList<Edge>();\n PriorityQueue<Edge> pq = new PriorityQueue<Edge>();\n ArrayList<Edge> ed = new ArrayList<Edge>(edgeMap.values());\n Edge first = ed.get(0);\n mst.add(first);\n inserted.put(first.w, first.w);\n inserted.put(first.v, first.v);\n\n priorityEdgeInsert(pq, first);\n\n while (inserted.size() <= edges() && pq.size() != 0){ //O(E log(V))\n //runs for E checking the possible V, where the number of V is devided each time, or log(V), giving ELog(V)\n Edge e = pq.poll();\n String w = inserted.get(e.w);\n String v = inserted.get(e.v);\n\n if ((w == null) ^ (v == null)){\n priorityEdgeInsert(pq, e);\n for(Edge f : failed){\n if(f.v == e.v || f.v == e.w || f.w == e.v || f.w == e.w){\n\n }\n else{\n pq.add(f);\n }\n }\n failed.clear();\n mst.add(e);\n inserted.put(e.w, e.w); //only puts one, the null one is hashed to a meaningless spot\n inserted.put(e.v, e.v);\n }\n else if ((w == null) && (v == null) ){\n failed.add(e);\n }\n else if (!(w == null) && !(v == null) ){\n failed.remove(e);\n pq.remove(e);\n }\n else if (e == null){\n System.out.println(\"HOW?\"); //should never happen.\n }\n }\n return mst;\n }","public static void main(String[] args) {\n\t\tint array[]={2,3,4,6};\n\t\tint n=array.length;\n\t\tint maximum=Integer.MIN_VALUE;\n\t\tint minimum=Integer.MAX_VALUE;\n\t\tfor(int i:array)\n\t\t{\n\t\t\tif(i>maximum)\n\t\t\t\tmaximum=i;\n\t\t\tif(i<minimum)\n\t\t\t\tminimum=i;\n\t\t}\n\t\t\n\t\tint mark[]=new int[maximum+2];\n\t\tint value[]=new int[maximum+2];\n\t\tfor(int i=0;i<n;i++)\n\t\t{\n\t\t\tmark[array[i]]=1; // marking ki exist karta hai no need to search in the array.\n\t\t\tvalue[array[i]]=1; //har value se ek fbt to banega hi (1 node ka)\n\t\t}\n\t\tint ans=0;\n\t\tfor(int i=minimum;i<=maximum;i++){\n\t\t\tif(mark[i]==1) // element is present in the array.// we have found the first factor now find 2nd factor.\n\t\t\t{\n\t\t// find the multiples of arr[i] which are less than max value and also less than its square\n\t\t\tfor(int j=i+i ;j<=maximum && j/i<=i;j=j+i)\n\t\t\t{\n\t\t\t\tif(mark[j]==1 && mark[j/i]==1) // i is the first factor and j/i is the 2nd factor.j is the product that serves as root.\n\t\t\t\t{\n\t\t\t\t\t// value =all combination of left child with right child.\n\t\t\t\t\tvalue[j]=value[j] + (value[i] * value[j/i]);\n\t\t\t\t\t\n\t\t\t\t\t// if the 2 child are not same then one more orientation.\n\t\t\t\t\tif(i!=(j/i))\n\t\t\t\t\t\tvalue[j]=value[j] + (value[i] * value[j/i]);\n\t\t\t\t}\n\t\t\t}\n\t\t\t}\n\t\t\tans=ans+value[i];\n\t\t}\n\t\tSystem.out.println(ans);\n\t}","public void breadthFirstTraversal() {\n beginAnimation();\n treeBreadthFirstTraversal();\n stopAnimation();\n\n }","public ArrayList<SearchNode> search(Problem p) {\n\tfrontier = new NodeQueue();\t// The frontier is a queue of expanded SearchNodes not processed yet\n\texplored = new HashSet<SearchNode>();\t/// The explored set is a set of nodes that have been processed \n\tGridPos startState = (GridPos) p.getInitialState();\t// The start state is given\n\tfrontier.addNodeToFront(new SearchNode(startState));\t// Initialize the frontier with the start state \n\n\t\n\tpath = new ArrayList<SearchNode>();\t// Path will be empty until we find the goal\n\t\t\n\n\n\twhile(!frontier.isEmpty()){\n\n\t SearchNode s = frontier.removeFirst(); \n\t GridPos g = s.getState(); \n\n\t if ( p.isGoalState(g) ) {\n\t\tpath = s.getPathFromRoot();\t\n\t\tbreak; \n\t }\n\t \n\t explored.add(s); \t \n\t ArrayList<GridPos> childStates = p.getReachableStatesFrom(g);\n\n\t while(!childStates.isEmpty()){\n\n\t\tSearchNode child = new SearchNode(childStates.get(0), s); \n\n\t\tif(!explored.contains(child) && !frontier.contains(child)){\n\n\t\t if ( p.isGoalState(child.getState()) ) {\n\t\t\n\t\t\tpath = child.getPathFromRoot();\t\n\t\t\treturn path; \n\t\t }\n\n\t\t if(insertFront) \n\t\t\tfrontier.addNodeToFront(child); \t\t \t\t\n\t\t else\t\n\t\t\tfrontier.addNodeToBack(child); \t \n\n\n\n\t\t}\n\n\t\tchildStates.remove(0);\n\t }\t \n\t}\n\n\n\treturn path;\n\n }","public void bfs()\n{\n Queue q=new LinkedList();\n q.add(this.rootNode);\n printNode(this.rootNode);\n rootNode.visited=true;\n while(!q.isEmpty())\n {\n Node n=(Node)q.remove();\n Node child=null;\n while((child=getUnvisitedChildNode(n))!=null)\n {\n child.visited=true;\n printNode(child);\n q.add(child);\n }\n }\n //Clear visited property of nodes\n clearNodes();\n}","public List<Node> findPath(Vector2i start, Vector2i goal) {\n\t\tList<Node> openList = new ArrayList<Node>(); //All possible Nodes(tiles) that could be shortest path\n\t\tList<Node> closedList = new ArrayList<Node>(); //All no longer considered Nodes(tiles)\n\t\tNode current = new Node(start,null, 0, getDistance(start, goal)); //Current Node that is being considered(first tile)\n\t\topenList.add(current);\n\t\twhile(openList.size() > 0) {\n\t\t\tCollections.sort(openList, nodeSorter); // will sort open list based on what's specified in the comparator\n\t\t\tcurrent = openList.get(0); // sets current Node to first possible element in openList\n\t\t\tif(current.tile.equals(goal)) {\n\t\t\t\tList<Node> path = new ArrayList<Node>(); //adds the nodes that make the path \n\t\t\t\twhile(current.parent != null) { //retraces steps from finish back to start\n\t\t\t\t\tpath.add(current); // add current node to list\n\t\t\t\t\tcurrent = current.parent; //sets current node to previous node to strace path back to start\n\t\t\t\t}\n\t\t\t\topenList.clear(); //erases from memory since algorithm is finished, ensures performance is not affected since garbage collection may not be called\n\t\t\t\tclosedList.clear();\n\t\t\t\treturn path; //returns the desired result shortest/quickest path\n\t\t\t}\n\t\t\topenList.remove(current); //if current Node is not part of path to goal remove\n\t\t\tclosedList.add(current); //and puts it in closedList, because it's not used\n\t\t\tfor(int i = 0; i < 9; i++ ) { //8-adjacent tile possibilities\n\t\t\t\tif(i == 4) continue; //index 4 is the middle tile (tile player currently stands on), no reason to check it\n\t\t\t\tint x = (int)current.tile.getX();\n\t\t\t\tint y = (int)current.tile.getY();\n\t\t\t\tint xi = (i % 3) - 1; //will be either -1, 0 or 1\n\t\t\t\tint yi = (i / 3) - 1; // sets up a coordinate position for Nodes (tiles)\n\t\t\t\tTile at = getTile(x + xi, y + yi); // at tile be all surrounding tiles when iteration is run\n\t\t\t\tif(at == null) continue; //if empty tile skip it\n\t\t\t\tif(at.solid()) continue; //if solid cant pass through so skip/ don't consider this tile\n\t\t\t\tVector2i a = new Vector2i(x + xi, y + yi); //Same thing as node(tile), but changed to a vector\n\t\t\t\tdouble gCost = current.gCost + (getDistance(current.tile, a) == 1 ? 1 : 0.95); //*calculates only adjacent nodes* current tile (initial start is 0) plus distance between current tile to tile being considered (a)\n\t\t\t\tdouble hCost = getDistance(a, goal);\t\t\t\t\t\t\t\t// conditional piece above for gCost makes a more realist chasing, because without it mob will NOT use diagonals because higher gCost\n\t\t\t\tNode node = new Node(a, current, gCost, hCost);\n\t\t\t\tif(vecInList(closedList, a) && gCost >= node.gCost) continue; //is node has already been checked \n\t\t\t\tif(!vecInList(openList, a) || gCost < node.gCost) openList.add(node);\n\t\t\t}\n\t\t}\n\t\tclosedList.clear(); //clear the list, openList will have already been clear if no path was found\n\t\treturn null; //a default return if no possible path was found\n\t}","public List<Integer> findMinHeightTrees(int n, int[][] edges) {\n List<Integer> ans = new ArrayList<>();\n if (n == 0) return ans;\n if (n == 1) {\n ans.add(0);\n return ans;\n }\n if (n == 2) {\n ans.add(0);\n ans.add(1);\n return ans;\n }\n\n //build graph\n List<Integer>[] graph = new ArrayList[n];\n for (int i = 0; i < n; i++) {\n graph[i] = new ArrayList<>();\n }\n for (int i = 0; i < edges.length; i++) {\n int v1 = edges[i][0];\n int v2 = edges[i][1];\n\n graph[v1].add(v2);\n graph[v2].add(v1);\n }\n\n //initial leaves\n List<Integer> leaves = new ArrayList<>();\n for (int i = 0; i < n; i++) {\n if (graph[i].size() == 1) {\n leaves.add(i);\n }\n }\n\n int count = n;\n\n while (count > 2) {\n int leasize = leaves.size();\n count -= leasize;\n List<Integer> newleaves = new ArrayList<Integer>();\n for (int i = 0; i < leasize; i++) {\n int leavenode = leaves.get(i);\n int verToleave = graph[leavenode].get(0);\n graph[verToleave].remove(Integer.valueOf(leavenode));\n if (graph[verToleave].size() == 1) {\n newleaves.add(verToleave);\n }\n }\n\n leaves = newleaves;\n }\n return leaves;\n\n\n }","public int findSpanningTree(List<Graph.Edge> edges) {\n while (!isSpanningTree()) {\n toZeroWeightGraph();\n shrinkComponents();\n }\n return populateEdges(edges);\n }","private Node constructInternal(List<Node> children){\r\n\r\n // Base case: root found\r\n if(children.size() == 1){\r\n return children.get(0);\r\n }\r\n\r\n // Generate parents\r\n boolean odd = children.size() % 2 != 0;\r\n for(int i = 1; i < children.size(); i += 2){\r\n Node left = children.get(i-1);\r\n Node right = children.get(i);\r\n Node parent = new Node(Utility.SHA512(left.hash + right.hash), left, right);\r\n children.add(parent);\r\n }\r\n\r\n // If the number of nodes is odd, \"inherit\" the remaining child node (no hash needed)\r\n if(odd){\r\n children.add(children.get(children.size() - 1));\r\n }\r\n return constructInternal(children);\r\n }","void buildHeap() {\n for (int i = parent(size - 1); i >= 0; i--) {\n percolateDown(i);\n }\n }","private List<Pair<Integer, Integer>> getBestPath(Pair<Integer, Integer> curLocation, Pair<Integer, Integer> dest) {\n\t\tList<Pair<Integer, Integer>> path = new LinkedList<Pair<Integer, Integer>>();\n\t\t\n\t\t\n\t\tNode current = new Node(curLocation.getX(), curLocation.getY(), getHitProbability(curLocation.getX(), curLocation.getY()));\n\t\tNode target = new Node(dest.getX(), dest.getY(), getHitProbability(dest.getX(), dest.getY()));\n\t\tList<Node> openSet = new ArrayList<>();\n List<Node> closedSet = new ArrayList<>();\n \n \n while (true) {\n openSet.remove(current);\n List<Node> adjacent = getAdjacentNodes(current, closedSet, target);\n\n // Find the adjacent node with the lowest heuristic cost.\n for (Node neighbor : adjacent) {\n \tboolean inOpenset = false;\n \tList<Node> openSetCopy = new ArrayList<>(openSet);\n \tfor (Node node : openSetCopy) {\n \t\tif (neighbor.equals(node)) {\n \t\t\tinOpenset = true;\n \t\t\tif (neighbor.getAccumulatedCost() < node.getAccumulatedCost()) {\n \t\t\t\topenSet.remove(node);\n \t\t\t\topenSet.add(neighbor);\n \t\t\t}\n \t\t}\n \t}\n \t\n \tif (!inOpenset) {\n \t\topenSet.add(neighbor);\n \t}\n }\n\n // Exit search if done.\n if (openSet.isEmpty()) {\n System.out.printf(\"Target (%d, %d) is unreachable from position (%d, %d).\\n\",\n target.getX(), target.getY(), curLocation.getX(), curLocation.getY());\n return null;\n } else if (/*isAdjacent(current, target)*/ current.equals(target)) {\n break;\n }\n\n // This node has been explored now.\n closedSet.add(current);\n\n // Find the next open node with the lowest cost.\n Node next = openSet.get(0);\n for (Node node : openSet) {\n if (node.getCost(target) < next.getCost(target)) {\n next = node;\n }\n }\n// System.out.println(\"Moving to node: \" + current);\n current = next;\n }\n \n // Rebuild the path using the node parents\n path.add(new Pair<Integer, Integer>(curLocation.getX(), curLocation.getY()));\n while(current.getParent() != null) {\n \tcurrent = current.getParent();\n \tpath.add(0, new Pair<Integer, Integer>(current.getX(), current.getY()));\n }\n \n if (path.size() > 1) {\n \tpath.remove(0);\n }\n \n\t\treturn path;\n\t}","public List<Integer> findMinHeightTrees(int n, int[][] edges) {\n\n // edge list\n // Create adjacency list\n // find nodes with edge degree\n // fill a queue with edge degree one\n // do the bfs and keep marking their heights in the path\n // as we go along and find a node with lesser possible heights, update heights\n // of that node and keep updating in consequent nodes\n\n // edge case - disconnected tree\n\n List<List<Integer>> adjList = new ArrayList<>();\n\n createAdjList(n, edges, adjList);\n\n // Revise - How to print a list?\n System.out.println(Arrays.toString(adjList.toArray()));\n\n int[] edgeDegree = new int[n];\n int[] heights = new int[n];\n for (int[] edge:\n edges) {\n edgeDegree[edge[0]]++;\n edgeDegree[edge[1]]++;\n }\n\n System.out.println(\"edgeDegree\");\n System.out.println(Arrays.toString(edgeDegree));\n\n Queue<Integer> bfsQ = new LinkedList<>();\n boolean[] visited = new boolean[n];\n for (int i = 0; i < edgeDegree.length; i++) {\n if (edgeDegree[i] == 1) {\n bfsQ.add(i);\n heights[i] = 1;\n break;\n }\n }\n\n int maxHeight = Integer.MIN_VALUE;\n while (!bfsQ.isEmpty()) {\n Integer vertex = bfsQ.poll();\n visited[vertex] = true;\n System.out.println(\"Out from queue\");\n int heightParentVertex = heights[vertex];\n maxHeight = Math.max(maxHeight, heightParentVertex);\n List<Integer> adjNodes = adjList.get(vertex);\n for (Integer adjNode:\n adjNodes) {\n if (!visited[adjNode]) {\n heights[adjNode] = heightParentVertex+1;\n bfsQ.add(adjNode);\n }\n }\n }\n\n List<Integer> ans = new ArrayList<>();\n System.out.println(\"maxHeight\");\n System.out.println(maxHeight);\n\n // if even\n for (int i = 0; i < n; i++) {\n if ( heights[i] == ((maxHeight / 2) + 1)) {\n ans.add(i);\n } else if (maxHeight % 2 == 0 && heights[i] == maxHeight / 2) {\n ans.add(i);\n }\n }\n\n return ans;\n }","private BinaryTree<Character> constructTree(){\n if(pq.size() == 1) return pq.poll().data;\n if(pq.size() == 0) return null;\n // Poll the lowest two trees, combine them, then stick them back in the queue.\n Helper<BinaryTree<Character>> temp0 = pq.poll(), temp1 = pq.poll(),\n result = new Helper<>(temp0.priority + temp1.priority, new BinaryTree<>(temp0.data, null , temp1.data));\n pq.add(result);\n // Call again to keep constructing.\n return constructTree();\n }","public ArrayList<State> childStates(){\n boolean hasExpanded = false;\n this.childStates = new ArrayList<>();\n Successor successor = new Successor(); //for calling the successors functions\n //cases for this\n for (int i = 0; i < boardRows ; i++) {\n for (int j = 0; j < boardColumns; j++) {\n if(!hasExpanded){\n if(currentBoardState[i][j] == 0){\n\n if( i - 1 >= 0){\n //call moveDown()\n //System.out.println(i + \" \" + j);\n //System.out.println(\"calling moveDown()\");\n State newState = successor.moveDown(i, j, this.getCurrentBoardState(), this.getGoalBoardState());\n\n //newState.printBoard();\n childStates.add(newState);\n }\n\n if( i + 1 <= boardRows-1){\n //call moveUp()\n //System.out.println(i + \" \" + j);\n //System.out.println(\"calling moveUp()\");\n //this.printBoard();\n State newState = successor.moveUp(i, j, this.getCurrentBoardState(), this.getGoalBoardState());\n //newState.printBoard();\n childStates.add(newState);\n }\n\n if(j - 1 >= 0){\n //System.out.println(i + \" \" + j);\n //System.out.println(\"calling moveRight()\");\n //this.printBoard();\n State newState = successor.moveRIght(i, j, this.getCurrentBoardState(), this.getGoalBoardState());\n //newState.printBoard();\n childStates.add(newState);\n }\n\n if( j + 1 <= boardColumns - 1){\n //System.out.println(i + \" \" + j);\n //System.out.println(\"calling moveLeft()\");\n //this.printBoard();\n State newState = successor.moveLeft(i,j,this.getCurrentBoardState(), this.getGoalBoardState());\n //newState.printBoard();\n childStates.add(newState);\n }\n hasExpanded = true;\n }\n }\n }\n }\n return childStates;\n }","public void addToNextMoves(GameTile[][] visibleMap) {\r\n\t\t\r\n\t\t//Breadth First Search Code\r\n//\t\tWumpusState state = new WumpusState(visibleMap, playerX, playerY, wumpusX, wumpusY);\r\n\r\n\t\tQueue<WumpusState> queue = new LinkedList<WumpusState>();\t\t\t\t//use the queue in the same way\t\r\n\t\tHashMap<String, Boolean> visitedStates = new HashMap<String, Boolean>();\t//add all children to the queue, \r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t//add all the children to the hash and set values to true.\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t//once all the children have been visited, generate children sequentially for the children that already been added \r\n\t\tWumpusState state = new WumpusState(visibleMap, playerX, playerY);\r\n\t\tlong nodesExpanded = 0;\r\n\t\t\r\n\t\tqueue.add(state);\r\n\t\twhile(!queue.isEmpty()) {\r\n\t\t\tWumpusState currentState = queue.remove();\r\n\t\t\tSystem.out.println(currentState.toString());\r\n\t\t\tif(currentState.getPlayerX() == 4 && currentState.getPlayerY() == 1) {\r\n\t\t\t\tnodesExpanded = visitedStates.size();\r\n\t\t\t\tSystem.out.println(\"Nodes Expanded: \"+nodesExpanded);\r\n\t\t\t\tArrayList<AgentAction> actions = currentState.getAllActions();\r\n\t\t\t\tfor(int i=1;i<actions.size(); i++) {\r\n\t\t\t\t\tSystem.out.println(actions.get(i));\r\n\t\t\t\t\tnextMoves.add(actions.get(i));\r\n\t\t\t\t}\r\n\t\t\t\tnextMoves.add(AgentAction.declareVictory);\r\n\t\t\t\treturn;\r\n\t\t\t}\r\n\t\t\tif(visitedStates.containsKey(currentState.toString())) {\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\t\t\telse {\r\n\t\t\t\tvisitedStates.put(currentState.toString(), true);\r\n\t\t\t\tWumpusState[] childrenOfCurrentChild = currentState.generateChildrenStates();\r\n\t\t\t\tfor(int j=0; j<childrenOfCurrentChild.length; j++) {\r\n\t\t\t\t\tif(childrenOfCurrentChild[j]!=null) {\r\n\t\t\t\t\t\tqueue.add(childrenOfCurrentChild[j]);\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\t\r\n\t}","private void maximize(Node node) {\n // maximize:\n double max = Tree.MININT;\n List<Node> children = node.getChildren();\n \n// if(children.isEmpty()){\n// return;\n// }\n \n //String values = \"\";\n for (Node child : children) {\n if (child.getMove().getRating() > max) {\n max = child.getMove().getRating();\n }\n // values += \"\" + child.getMove().getRating() + \", \";\n }\n // set value\n // System.out.println(\"setting value for next parent (maximize): \" + max + \" (all values: \" + values + \")\");\n\n node.getMove().setRating(max);\n }","private void constructTree() {\r\n\t\tsortLeaves();\r\n\t\tNode currentNode;\r\n\t\tint index = 0;\r\n\t\t\tdo{\r\n\t\t\t\t// Create a new node with the next two least frequent nodes as its children\r\n\t\t\t\tcurrentNode = new Node(this.treeNodes[0], this.treeNodes[1]); \r\n\t\t\t\taddNewNode(currentNode);\r\n\t\t\t}\r\n\t\t\twhile (this.treeNodes.length > 1); // Until there is only one root node\r\n\t\t\tthis.rootNode = currentNode;\r\n\t\t\tindex++;\r\n\t}","public AttackTreeNode buildNextChild(AttackTreeNode activeChild) {\n \n return null;\n }"],"string":"[\n \"public void greedyBFS(String input)\\r\\n\\t{\\r\\n\\t\\tNode root_gbfs = new Node (input);\\r\\n\\t\\tNode current = new Node(root_gbfs.getState());\\r\\n\\t\\t\\r\\n\\t\\tNodeComparator gbfs_comparator = new NodeComparator();\\r\\n\\t\\tPriorityQueue<Node> queue_gbfs = new PriorityQueue<Node>(12, gbfs_comparator);\\r\\n\\t\\tArrayList<String> visited = new ArrayList<String>();\\r\\n\\t\\tArrayList<String> children = new ArrayList<String>();\\r\\n\\t\\t\\r\\n\\t\\tint nodes_popped = 0;\\r\\n\\t\\tint pqueue_max_size = 0;\\r\\n\\t\\tint pq_size = 0;\\r\\n\\t\\t\\r\\n\\t\\tcurrent.cost = 0;\\r\\n\\t\\tcurrent.total_cost = 0;\\r\\n\\t\\t\\r\\n\\t\\twhile(!goal_gbfs)\\r\\n\\t\\t{\\r\\n\\t\\t\\tvisited.add(current.getState());\\r\\n\\t\\t\\tchildren = Successor.findChildren(current.getState());\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tfor (String a : children)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif (visited.contains(a))\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tcontinue;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tNode nino = new Node(a);\\r\\n\\t\\t\\t\\t\\tcurrent.children_nodes.add(nino);\\r\\n\\t\\t\\t\\t\\tvisited.add(nino.getState());\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tint cost = isCost(current.getState(), nino.getState());\\r\\n\\t\\t\\t\\t\\tnino.cost = cost;\\r\\n\\t\\t\\t\\t\\tnino.parent = current;\\r\\n\\t\\t\\t\\t\\tint greedy_cost = greedybfsCost(nino.getState(), root_gbfs.getState());\\r\\n\\t\\t\\t\\t\\tnino.setTotalCost(greedy_cost);\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tif (!queue_gbfs.contains(nino))\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tqueue_gbfs.add(nino);\\r\\n\\t\\t\\t\\t\\t\\tpq_size++;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t// Repeated State checking. Removing the same node from PQ if the path cost is less then the current one \\r\\n\\t\\t\\t\\t\\telse if (queue_gbfs.contains(nino))\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tfor (Node original : queue_gbfs)\\r\\n\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\tif (original.equals(nino))\\r\\n\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tNode copy = original;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tif (nino.getTotalCost() < copy.getTotalCost())\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tqueue_gbfs.remove(copy);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tqueue_gbfs.add(nino);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tcurrent = queue_gbfs.poll();\\r\\n\\t\\t\\tnodes_popped++;\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tif (pq_size > pqueue_max_size)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tpqueue_max_size = pq_size;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tpq_size--;\\r\\n\\t\\t\\tgoal_gbfs = isGoal(current.getState());\\r\\n\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tgoal_gbfs = false;\\r\\n\\t\\tSystem.out.println(\\\"GBFS Solved!!\\\");\\r\\n\\t\\tSolution.performSolution(current, root_gbfs, nodes_popped, pqueue_max_size);\\r\\n\\t}\",\n \"private boolean helperDFS(Node current){\\n\\n if(expandedNode.size() == 999){\\n //limit has been reached. jump out of recursion.\\n expandedNode.add(current);\\n System.out.println(\\\"No solution found.\\\");\\n printExpanded(expandedNode);\\n System.exit(0);\\n return false;\\n }\\n\\n boolean b = cycleCheck(current,expandedNode);\\n\\n if(!b){\\n expandedNode.add(current);\\n }else{\\n return false;\\n }\\n\\n if(current.getDigit().getDigitString().equals(goalNode.getDigit().getDigitString())){\\n //goal reached.\\n //expandedNode.add(current);\\n solutionPath(current);\\n printExpanded(expandedNode);\\n System.exit(0);\\n }\\n\\n //Now make the children.\\n\\n if(!forbidden.contains(current.getDigit().getDigitString())){\\n\\n if(current.getDigit().last_changed != 0){\\n\\n if ((Integer.parseInt(current.getDigit().getFirst_digit()) - 1 >= 0)) {\\n Node child_node = new Node(current.getDigit().decreaseFirstDigit());\\n child_node.setParent(current);\\n child_node.getDigit().setLastChanged(0);\\n if(!forbidden.contains(child_node.getDigit().getDigitString()) && helperDFS(child_node)){\\n return true;\\n }\\n }\\n\\n //+1 child first digit\\n if ((Integer.parseInt(current.getDigit().getFirst_digit()) + 1 <= 9)) {\\n Node child_node = new Node(current.getDigit().increaseFirstDigit());\\n child_node.setParent(current);\\n child_node.getDigit().setLastChanged(0);\\n if(!forbidden.contains(child_node.getDigit().getDigitString()) && helperDFS(child_node)){\\n return true;\\n }\\n }\\n }\\n\\n if(current.getDigit().last_changed != 1){\\n if ((Integer.parseInt(current.getDigit().getSecond_digit()) - 1 >= 0)) {\\n Node child_node = new Node(current.getDigit().decreaseSecondDigit());\\n child_node.setParent(current);\\n child_node.getDigit().setLastChanged(1);\\n if(!forbidden.contains(child_node.getDigit().getDigitString()) && helperDFS(child_node)){\\n return true;\\n }\\n }\\n\\n //+1 child\\n if ((Integer.parseInt(current.getDigit().getSecond_digit()) + 1 <= 9)) {\\n Node child_node = new Node(current.getDigit().increaseSecondDigit());\\n child_node.setParent(current);\\n child_node.getDigit().setLastChanged(1);\\n if(!forbidden.contains(child_node.getDigit().getDigitString()) && helperDFS(child_node)){\\n return true;\\n }\\n }\\n }\\n\\n if(current.getDigit().last_changed != 2){\\n if ((Integer.parseInt(current.getDigit().getThird_digit()) - 1 >= 0)) {\\n Node child_node = new Node(current.getDigit().decreaseThirdDigit());\\n child_node.setParent(current);\\n child_node.getDigit().setLastChanged(2);\\n if(!forbidden.contains(child_node.getDigit().getDigitString()) && helperDFS(child_node)){\\n return true;\\n }\\n }\\n //+1 child\\n if ((Integer.parseInt(current.getDigit().getThird_digit()) + 1 <= 9)) {\\n Node child_node = new Node(current.getDigit().increaseThirdDigit());\\n child_node.setParent(current);\\n child_node.getDigit().setLastChanged(2);\\n if(!forbidden.contains(child_node.getDigit().getDigitString()) && helperDFS(child_node)){\\n return true;\\n }\\n }\\n }\\n }\\n return false;\\n }\",\n \"int solve(int p, int current) {\\n int id = getId(p, current);\\n if (p >= 0 && memo.containsKey(id)) {\\n return memo.get(id);\\n }\\n List<Integer> adjList = adj.get(current);\\n int n = adjList.size();\\n if (n == 0) {\\n throw new RuntimeException();\\n }\\n if ((n == 2 && p >= 0) || (n == 1 && p < 0)) {\\n // should cut the nodes under current\\n int ans = getDepth(p, current) - 1;\\n // System.out.println(\\\"ans(\\\" + p + \\\",\\\" + current + \\\")=\\\" + ans);\\n memo.put(id, ans);\\n return ans;\\n }\\n if (n == 1) {\\n // System.out.println(\\\"ans(\\\" + p + \\\",\\\" + current + \\\")=nochild\\\");\\n return 0;\\n }\\n int ans = Integer.MAX_VALUE;\\n\\n for (int i = 0; i < n; i++) {\\n int a = adjList.get(i);\\n if (a == p) {\\n continue;\\n }\\n for (int j = i + 1; j < n; j++) {\\n int b = adjList.get(j);\\n if (b == p) {\\n continue;\\n }\\n // try a & b combo\\n int tmp = solve(current, a);\\n tmp += solve(current, b);\\n for (int k = 0; k < n; k++) {\\n int c = adjList.get(k);\\n if (c != a && c != b && c != p) {\\n tmp += getDepth(current, c);\\n }\\n }\\n ans = Math.min(ans, tmp);\\n }\\n }\\n memo.put(id, ans);\\n // System.out.println(\\\"ans(\\\" + p + \\\",\\\" + current + \\\")=\\\" + ans);\\n return ans;\\n }\",\n \"private void gameTree(MinimaxNode<GameState> currentNode, int depth, int oIndex){\\n currentNode.setNodeIndex(oIndex); \\n if (depth == 0) {\\n return;\\n }\\n else{\\n if (currentNode.getState().isDead(oIndex)){ //checks to see if current player is dead, if so, just skips their moves\\n int newIndex = (oIndex + 1) % currentNode.getState().getNrPlayers();\\n/* if(oIndex == 3){\\n newIndex = 0;\\n }\\n else{\\n newIndex = oIndex + 1;\\n }*/\\n gameTree(currentNode, depth-1, newIndex);\\n }\\n else{\\n //this if statement sets up chance nodes, if the target has been met it will create 5 children nodes with randomly generated new target postitions \\n if(!currentNode.getState().hasTarget()){\\n currentNode.setChanceNode();\\n for(int i = 1; i <= 5; i++){\\n try{\\n GameState newState = (GameState)currentNode.getState().clone();\\n newState.chooseNextTarget();\\n MinimaxNode<GameState> childNode = new MinimaxNode(newState);\\n childNode.setProbability(0.2);\\n currentNode.addChild(childNode); \\n }\\n catch (CloneNotSupportedException e){\\n System.out.println(\\\"Clone not excepted\\\");\\n }\\n \\n }\\n for (int i = 0; i < currentNode.getNumberOfChildren(); i++){\\n gameTree(currentNode.getChildren().get(i), depth, oIndex);\\n }\\n\\n }\\n else{\\n List<Integer> options = new ArrayList();\\n for (int i = 1; i <= 4; i++) {\\n if (currentNode.getState().isLegalMove(oIndex, i)){\\n options.add(i);\\n }\\n }\\n for (int i = 0; i < options.size(); i++){\\n try{\\n GameState newState = (GameState)currentNode.getState().clone();\\n newState.setOrientation(oIndex, options.get(i));\\n newState.updatePlayerPosition(oIndex);\\n MinimaxNode<GameState> childNode = new MinimaxNode(newState);\\n currentNode.addChild(childNode);\\n }\\n catch (CloneNotSupportedException e){\\n System.out.println(\\\"Clone not excepted\\\");\\n }\\n }\\n int newIndex = (oIndex + 1) % currentNode.getState().getNrPlayers();\\n /* if(oIndex == 3){\\n newIndex = 0;\\n }\\n else{\\n newIndex = oIndex + 1;\\n }*/\\n for (int i = 0; i < currentNode.getNumberOfChildren(); i++){\\n gameTree(currentNode.getChildren().get(i), depth-1, newIndex);\\n }\\n } \\n } \\n }\\n }\",\n \"private void treeBreadthFirstTraversal() {\\n Node currNode = root;\\n java.util.LinkedList<Node> queue = new java.util.LinkedList<Node>();\\n\\n // Highlights the first Node.\\n queueNodeSelectAnimation(currNode, \\\"Exploring \\\" + currNode.key,\\n AnimationParameters.ANIM_TIME);\\n\\n // Explores Nodes until the queue is empty.\\n while (true) {\\n\\n // Marks that this Node's children should be explored.\\n for (int i = 0; i < getNumChildren(); ++i) {\\n if (currNode.children[i] != null) {\\n queue.addLast(currNode.children[i]);\\n queueQueueAddAnimation(currNode.children[i],\\n \\\"Queueing \\\" + currNode.children[i].key,\\n AnimationParameters.ANIM_TIME);\\n\\n }\\n }\\n\\n // Pops the next Node from the queue.\\n if (!queue.isEmpty()) {\\n currNode = queue.pop();\\n queueListPopAnimation(\\\"Popped \\\" + currNode.key,\\n AnimationParameters.ANIM_TIME);\\n queueNodeSelectAnimation(currNode, \\\"Exploring \\\" + currNode.key,\\n AnimationParameters.ANIM_TIME);\\n\\n }\\n // If the queue is empty, breaks.\\n else break;\\n\\n }\\n }\",\n \"private static ArrayList<MMT> generateChildren(Board currentBoard, String mPlayer, boolean ifChildMax, int depthToGo){\\n\\t\\t//System.out.println(\\\"generate children! depth to go is \\\" + depthToGo);\\n\\t\\tif (depthToGo == 0)\\n\\t\\t\\treturn null;\\n\\t\\tArrayList<MMT> childLst = new ArrayList<MMT>();\\n\\t\\tfor (int j = 0; j<Board.getNumCol(); j++){\\n\\t\\t\\tBoard childBoard = new Board(currentBoard);\\n\\t\\t\\tboolean success = childBoard.fillBoard(j, getCurrentNodePiece(mPlayer, ifChildMax));\\n\\t\\t\\t//Board.printBoard(childBoard);\\n\\t\\t\\t//System.out.println(\\\"score for this board: \\\" + Eval.evalBoard(childBoard, mPlayer));\\n\\t\\t\\t//if valid move, then add board\\n\\t\\t\\tif (success){\\n\\t\\t\\t\\t//set depth to 0 (to stop) if someone wins or tie\\n\\t\\t\\t\\tint depth;\\n\\t\\t\\t\\tif (Eval.checkTie(childBoard) || Eval.ifHumanWon(childBoard) ||\\n\\t\\t\\t\\t\\t\\tEval.ifPCWon(childBoard)){\\n\\t\\t\\t\\t\\tdepth = 0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\tdepth = depthToGo -1;\\n\\t\\t\\t\\t\\t//depth = depthToGo; //depth not reduced at constructor\\n\\t\\t\\t\\tMMT child = new MMT(childBoard, depth, mPlayer, ifChildMax, j);\\n\\t\\t\\t\\tchildLst.add(child);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (childLst.size() == 0)\\n\\t\\t\\treturn null;\\n\\t\\treturn childLst;\\n\\t}\",\n \"public void aEstrella2 (String input)\\r\\n\\t{\\r\\n\\t\\tNode root_aEstrella2 = new Node (input);\\r\\n\\t\\tNode current = new Node(root_aEstrella2.getState());\\r\\n\\t\\t\\r\\n\\t\\tHeuristicComparator aEstrella_comparator = new HeuristicComparator();\\r\\n\\t\\tPriorityQueue<Node> queue_gbfs = new PriorityQueue<Node>(12, aEstrella_comparator);\\r\\n\\t\\tArrayList<String> visited = new ArrayList<String>();\\r\\n\\t\\tArrayList<String> children = new ArrayList<String>();\\r\\n\\t\\t\\r\\n\\t\\tint nodes_popped = 0;\\r\\n\\t\\tint pqueue_max_size = 0;\\r\\n\\t\\tint pq_size = 0;\\r\\n\\t\\t\\r\\n\\t\\tcurrent.cost = 0;\\r\\n\\t\\t\\r\\n\\t\\twhile(!goal_aEstrella2)\\r\\n\\t\\t{\\r\\n\\t\\t\\tvisited.add(current.getState());\\r\\n\\t\\t\\tchildren = Successor.findChildren(current.getState());\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tfor (String a : children)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif (visited.contains(a))\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tcontinue;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tNode nino = new Node(a);\\r\\n\\t\\t\\t\\t\\tcurrent.children_nodes.add(nino);\\r\\n\\t\\t\\t\\t\\tvisited.add(nino.getState());\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tint cost = isCost(current.getState(), nino.getState());\\r\\n\\t\\t\\t\\t\\tnino.cost = cost;\\r\\n\\t\\t\\t\\t\\tnino.parent = current;\\r\\n\\t\\t\\t\\t\\tint manhattanD = manhattanDistance(nino.getState(), root_aEstrella2.getState());\\r\\n\\t\\t\\t\\t\\tnino.setTotalCost(nino.parent.getTotalCost() + nino.cost);\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t// f(n) = g(n) + h(n)\\r\\n\\t\\t\\t\\t\\tnino.setHeuristicCost(nino.getTotalCost() + manhattanD);\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tif (!queue_gbfs.contains(nino))\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tqueue_gbfs.add(nino);\\r\\n\\t\\t\\t\\t\\t\\tpq_size++;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t// Repeated State checking. Removing the same node from PQ if the path cost is less then the current one \\r\\n\\t\\t\\t\\t\\telse if (queue_gbfs.contains(nino))\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tfor (Node original : queue_gbfs)\\r\\n\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\tif (original.equals(nino))\\r\\n\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tNode copy = original;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tif (nino.getHeuristicCost() < copy.getHeuristicCost())\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tqueue_gbfs.remove(copy);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tqueue_gbfs.add(nino);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tcurrent = queue_gbfs.poll();\\r\\n\\t\\t\\tnodes_popped++;\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tif (pq_size > pqueue_max_size)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tpqueue_max_size = pq_size;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tpq_size--;\\r\\n\\t\\t\\tgoal_aEstrella2 = isGoal(current.getState());\\r\\n\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tgoal_aEstrella2 = false;\\r\\n\\t\\tSystem.out.println(\\\"A*2 Solved!!\\\");\\r\\n\\t\\tSolution.performSolution(current, root_aEstrella2, nodes_popped, pqueue_max_size);\\r\\n\\t}\",\n \"private ProblemModel findCheapestNode(){\\n\\t\\tProblemModel ret = unvisitedPM.peek();\\n\\t\\t\\n\\t\\tfor(ProblemModel p : unvisitedPM){ \\n\\t\\t\\t//f(s) = depth + cost to make this move\\n\\t\\t\\tif(p.getCost() + p.getDepth() <= ret.getCost() + ret.getDepth()) ret = p;\\n\\t\\t}\\n\\t\\tunvisitedPM.remove(ret);\\n\\t\\treturn ret;\\n\\t}\",\n \"public static Tree solve() {\\n Scanner scan = new Scanner(System.in);\\n int n = scan.nextInt();\\n\\n int[] arrayNode = new int[n + 1];\\n for (int i = 1; i <= n; i++) {\\n arrayNode[i] = scan.nextInt();\\n }\\n\\n Color[] arrayColor = new Color[n + 1];\\n for (int i = 1; i <= n; i++) {\\n if (scan.nextInt() == 0) {\\n arrayColor[i] = Color.RED;\\n } else {\\n arrayColor[i] = Color.GREEN;\\n }\\n }\\n\\n List<Integer>[] adjacentsList = new List[n + 1];\\n for (int i = 1; i <= n; i++) {\\n adjacentsList[i] = new ArrayList<Integer>();\\n }\\n\\n for (int i = 0; i < n - 1; i++) {\\n int x = scan.nextInt();\\n int y = scan.nextInt();\\n\\n adjacentsList[x].add(y);\\n adjacentsList[y].add(x);\\n }\\n\\n scan.close();\\n\\n List<Integer>[] childrenList = new List[n + 1];\\n for (int i = 1; i <= n; i++) {\\n childrenList[i] = new ArrayList<Integer>();\\n }\\n\\n int[] depths = new int[n + 1];\\n boolean[] visited = new boolean[n + 1];\\n\\n Queue<Integer> queue = new LinkedList<Integer>();\\n depths[1] = 0;\\n queue.offer(1);\\n while (!queue.isEmpty()) {\\n int head = queue.poll();\\n\\n if (visited[head]) {\\n continue;\\n }\\n visited[head] = true;\\n\\n for (int adjacent : adjacentsList[head]) {\\n if (!visited[adjacent]) {\\n childrenList[head].add(adjacent);\\n depths[adjacent] = depths[head] + 1;\\n queue.offer(adjacent);\\n }\\n }\\n }\\n\\n Tree[] nodes = new Tree[n + 1];\\n for (int i = 1; i <= n; i++) {\\n if (childrenList[i].isEmpty()) {\\n nodes[i] = new TreeLeaf(arrayNode[i], arrayColor[i], depths[i]);\\n } else {\\n nodes[i] = new TreeNode(arrayNode[i], arrayColor[i], depths[i]);\\n }\\n }\\n for (int i = 1; i <= n; i++) {\\n for (int child : childrenList[i]) {\\n ((TreeNode) nodes[i]).addChild(nodes[child]);\\n }\\n }\\n return nodes[1];\\n }\",\n \"public void ids (String input, int limit)\\r\\n\\t\\t{\\r\\n\\t\\t\\tNode root_ids= new Node (input);\\r\\n\\t\\t\\tNode current = new Node(root_ids.getState());\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tArrayList<String> visited = new ArrayList<String>();\\r\\n\\t\\t\\tArrayList<String> children = new ArrayList<String>();\\r\\n\\t\\t\\tStack<Node> stack_dfs = new Stack<Node>();\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tint nodes_popped = 0;\\r\\n\\t\\t\\tint stack_max_size = 0;\\r\\n\\t\\t\\tint stack_max_total = 0;\\r\\n\\t\\t\\tint depth = 0;\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tcurrent.cost = 0;\\r\\n\\t\\t\\tcurrent.depth = 0;\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tgoal_ids = isGoal(current.getState());\\r\\n\\t\\t\\t\\r\\n\\t\\t\\twhile(depth <= limit)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tif (goal_ids == true)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t// Clear the visited array for backtracking purposes\\r\\n\\t\\t\\t\\tvisited.clear();\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\twhile(!goal_ids)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tvisited.add(current.getState());\\r\\n\\t\\t\\t\\t\\tchildren = Successor.findChildren(current.getState());\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t// Depth limit check. This loop never runs if the node depth is greater then the limit\\r\\n\\t\\t\\t\\t\\tif (current.getDepth() < limit)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tfor (String a : children)\\r\\n\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\tif (visited.contains(a))\\r\\n\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tcontinue;\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tNode nino = new Node(a);\\r\\n\\t\\t\\t\\t\\t\\t\\tcurrent.children_nodes.add(nino);\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tint cost = isCost(current.getState(), nino.getState());\\r\\n\\t\\t\\t\\t\\t\\t\\tnino.cost = cost;\\r\\n\\t\\t\\t\\t\\t\\t\\tnino.parent = current;\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t// Repeated state check\\r\\n\\t\\t\\t\\t\\t\\t\\tif (!stack_dfs.contains(nino))\\r\\n\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tstack_dfs.add(nino);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tstack_max_size++;\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tif (current.getDepth() >= limit - 1)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tint copy = stack_max_size;\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tif (copy > stack_max_total)\\r\\n\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\tstack_max_total = copy;\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tdepth++;\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t// If there is no solution found at the depth limit, return no solution\\r\\n\\t\\t\\t\\t\\tif (stack_dfs.empty() == true)\\r\\n\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\tSolution.noSolution(limit);\\t\\r\\n\\t\\t\\t\\t\\t\\t\\treturn;\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tcurrent = stack_dfs.pop();\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t// Set depth of node so it can be checked in next iteration\\r\\n\\t\\t\\t\\t\\tcurrent.setDepth(current.parent.getDepth() + 1);\\r\\n\\t\\t\\t\\t\\tnodes_popped++;\\r\\n\\t\\t\\t\\t\\tstack_max_size--;\\r\\n\\t\\t\\t\\t\\tgoal_ids = isGoal(current.getState());\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tgoal_ids = false;\\r\\n\\t\\t\\tSystem.out.println(\\\"IDS Solved!!\\\");\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tif (stack_max_total > stack_max_size)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tstack_max_size = stack_max_total;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tSolution.performSolution(current, root_ids, nodes_popped, stack_max_size);\\r\\n\\t\\t}\",\n \"public void aEstrella (String input)\\r\\n\\t{\\r\\n\\t\\tNode root_aEstrella = new Node (input);\\r\\n\\t\\tNode current = new Node(root_aEstrella.getState());\\r\\n\\t\\t\\r\\n\\t\\tHeuristicComparator aEstrella_comparator = new HeuristicComparator();\\r\\n\\t\\tPriorityQueue<Node> queue_gbfs = new PriorityQueue<Node>(12, aEstrella_comparator);\\r\\n\\t\\tArrayList<String> visited = new ArrayList<String>();\\r\\n\\t\\tArrayList<String> children = new ArrayList<String>();\\r\\n\\t\\t\\r\\n\\t\\tint nodes_popped = 0;\\r\\n\\t\\tint pqueue_max_size = 0;\\r\\n\\t\\tint pq_size = 0;\\r\\n\\t\\t\\r\\n\\t\\tcurrent.cost = 0;\\r\\n\\t\\tcurrent.setTotalCost(0);\\r\\n\\t\\t\\r\\n\\t\\twhile(!goal_aEstrella)\\r\\n\\t\\t{\\r\\n\\t\\t\\tvisited.add(current.getState());\\r\\n\\t\\t\\tchildren = Successor.findChildren(current.getState());\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tfor (String a : children)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif (visited.contains(a))\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tcontinue;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tNode nino = new Node(a);\\r\\n\\t\\t\\t\\t\\tcurrent.children_nodes.add(nino);\\r\\n\\t\\t\\t\\t\\tvisited.add(nino.getState());\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tint cost = isCost(current.getState(), nino.getState());\\r\\n\\t\\t\\t\\t\\tnino.cost = cost;\\r\\n\\t\\t\\t\\t\\tnino.parent = current;\\r\\n\\t\\t\\t\\t\\tint greedy_cost = greedybfsCost(nino.getState(), root_aEstrella.getState());\\r\\n\\t\\t\\t\\t\\tnino.setTotalCost(nino.parent.getTotalCost() + nino.cost);\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t// f(n) = g(n) + h(n)\\r\\n\\t\\t\\t\\t\\tnino.setHeuristicCost(nino.getTotalCost() + greedy_cost);\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tif (!queue_gbfs.contains(nino))\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tqueue_gbfs.add(nino);\\r\\n\\t\\t\\t\\t\\t\\tpq_size++;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t// Repeated State checking. Removing the same node from PQ if the path cost is less then the current one \\r\\n\\t\\t\\t\\t\\telse if (queue_gbfs.contains(nino))\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tfor (Node original : queue_gbfs)\\r\\n\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\tif (original.equals(nino))\\r\\n\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tNode copy = original;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tif (nino.getHeuristicCost() < copy.getHeuristicCost())\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tqueue_gbfs.remove(copy);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tqueue_gbfs.add(nino);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tcurrent = queue_gbfs.poll();\\r\\n\\t\\t\\tnodes_popped++;\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tif (pq_size > pqueue_max_size)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tpqueue_max_size = pq_size;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tpq_size--;\\r\\n\\t\\t\\tgoal_aEstrella = isGoal(current.getState());\\r\\n\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tgoal_aEstrella = false;\\r\\n\\t\\tSystem.out.println(\\\"A* Solved!!\\\");\\r\\n\\t\\tSolution.performSolution(current, root_aEstrella, nodes_popped, pqueue_max_size);\\r\\n\\t}\",\n \"public static void computeChildren() {\\n\\t\\tArrayList<BNNode> children = new ArrayList<BNNode>();\\n\\t\\t// For each node, build an array of children by checking which nodes have it as a parent.\\n\\t\\tfor (BNNode node : nodes) {\\n\\t\\t\\tchildren.clear();\\n\\t\\t\\tfor (BNNode node2 : nodes) {\\n\\t\\t\\t\\tif (node == node2)\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\tfor (BNNode node3 : node2.parents)\\n\\t\\t\\t\\t\\tif (node3 == node)\\n\\t\\t\\t\\t\\t\\tchildren.add(node2);\\n\\t\\t\\t}\\n\\t\\t\\tnode.children = new BNNode[children.size()];\\n\\t\\t\\tnode.children = (BNNode[]) children.toArray(node.children);\\n\\t\\t}\\n\\t}\",\n \"@Override\\n\\tpublic void run() {\\n\\t\\tMap<Integer, Integer> roots = new TreeMap<Integer, Integer>();\\n\\t\\t\\n\\t\\tEdge[] edges = new Edge[this.edges.length];\\n\\t\\tint n, weight, relevantEdges, root, lowerBound = 0;\\n\\t\\n\\t\\t// Sort edges by weight.\\n\\t\\tquickSort(0, this.edges.length - 1);\\n\\t\\n\\t\\t// Compute initial lower bound (best k - 1 edges).\\n\\t\\t// Choosing the cheapest k - 1 edges is not very intelligent. There is no guarantee\\n\\t\\t// that this subset of edges even induces a subgraph over the initial graph.\\n\\t\\t// TODO: Find a better initial lower bound.\\n\\t\\tfor (int i = 0; i < solution.length; i++) {\\n\\t\\t\\tlowerBound += this.edges[i].weight;\\n\\t\\t}\\n\\t\\n\\t\\t// Iterate over all nodes in the graph and run Prim's algorithm\\n\\t\\t// until k - 1 edges are fixed.\\n\\t\\t// As all induced subgraphs have k nodes and are connected according to Prim, they\\n\\t\\t// are candidate solutions and thus submitted.\\n\\t\\tfor (root = 0; root < taken.length; root++) {\\n\\t\\t\\ttaken = new boolean[taken.length];\\n\\t\\t\\tSystem.arraycopy(this.edges, 0, edges, 0, this.edges.length);\\n\\n\\t\\t\\ttaken[root] = true;\\n\\t\\t\\tn = 0;\\n\\t\\t\\tweight = 0;\\n\\t\\t\\trelevantEdges = this.edges.length;\\n\\n\\t\\t\\twhile (n < solution.length) { \\n\\t\\t\\t\\tfor (int i = 0; i < relevantEdges; i++) {\\n\\t\\t\\t\\t\\t// XOR to check if connected and no circle.\\n\\t\\t\\t\\t\\tif (taken[edges[i].node1] ^ taken[edges[i].node2]) {\\n\\t\\t\\t\\t\\t\\ttaken[taken[edges[i].node1] ? edges[i].node2 : edges[i].node1] = true;\\n\\t\\t\\t\\t\\t\\tsolution[n++] = edges[i];\\n\\t\\t\\t\\t\\t\\tweight += edges[i].weight;\\n\\t\\t\\t\\t\\t\\tSystem.arraycopy(edges, i + 1, edges, i, --relevantEdges - i);\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t// Check for circle.\\n\\t\\t\\t\\t\\telse if (taken[edges[i].node1]) {\\n\\t\\t\\t\\t\\t\\tSystem.arraycopy(edges, i + 1, edges, i, --relevantEdges - i);\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t// Sum up what we've just collected and submit this\\n\\t\\t\\t// solution to the framework.\\n\\t\\t\\tHashSet<Edge> set = new HashSet<Edge>(solution.length);\\n\\t\\t\\tfor (int i = 0; i < solution.length; i++) {\\n\\t\\t\\t\\tset.add(solution[i]);\\n\\t\\t\\t}\\n\\t\\t\\tsetSolution(weight, set);\\n\\t\\t\\troots.put(weight, root);\\n\\t\\t}\\n\\n\\t\\t// Now for the real business, let's do some Branch-and-Bound. Roots of \\\"k Prim Spanning Trees\\\"\\n\\t\\t// are enumerated by weight to increase our chances to obtain the kMST earlier.\\n\\t\\tfor (int item : roots.values()) {\\n\\t\\t\\ttaken = new boolean[taken.length];\\n\\t\\t\\tSystem.arraycopy(this.edges, 0, edges, 0, this.edges.length);\\n\\t\\t\\ttaken[item] = true;\\n\\t\\t\\tbranchAndBound(edges, solution.length, 0, lowerBound);\\n\\t\\t}\\n\\t}\",\n \"@Override\\n List<NodeData> pathFind() throws NoPathException {\\n System.out.println(\\\"Starting Scenic\\\");\\n\\n frontier.add(start);\\n\\n while(!frontier.isEmpty()) {\\n StarNode current = frontier.getLast();\\n frontier.removeLast(); // pop the priority queue\\n if(current.getXCoord() == goal.getXCoord() && current.getYCoord() == goal.getYCoord()) {\\n // If we are at the goal, we need to backtrack through the shortest path\\n System.out.println(\\\"At target!\\\");\\n finalList.add(current); // we have to add the goal to the path before we start backtracking\\n while(!(current.getXCoord() == start.getXCoord() && current.getYCoord() == start.getYCoord())) {\\n finalList.add(current.getPreviousNode());\\n current = current.getPreviousNode();\\n System.out.println(current.getNodeID());\\n }\\n return finalList;\\n }\\n else {\\n // we need to get all the neighbor nodes, identify their costs, and put them into the queue\\n LinkedList<StarNode> neighbors = current.getNeighbors();\\n // we also need to remove the previous node from the list of neighbors because we do not want to backtrack\\n neighbors.remove(current.getPreviousNode());\\n\\n for (StarNode newnode : neighbors) {\\n int nodePlace = this.listContainsId(frontier, newnode);\\n if(nodePlace > -1) {\\n if (frontier.get(nodePlace).getF() > actionCost(newnode) + distanceToGo(newnode, goal)) {\\n System.out.println(\\\"Here\\\");\\n frontier.remove(frontier.get(nodePlace));\\n newnode.setPreviousNode(current);\\n frontier.add(newnode);\\n newnode.setF(actionCost(newnode) + distanceToGo(newnode, goal));\\n }\\n }\\n else {\\n newnode.setPreviousNode(current);\\n frontier.add(newnode);\\n newnode.setF(actionCost(newnode) + distanceToGo(newnode, goal));\\n }\\n\\n // This fixes the problem with infinitely looping elevators (I hope)\\n if(current.getNodeType().equals(\\\"ELEV\\\") && newnode.getNodeType().equals(\\\"ELEV\\\")) {\\n for (Iterator<StarNode> iterator = newnode.neighbors.iterator(); iterator.hasNext();) {\\n StarNode newneighbor = iterator.next();\\n if (newneighbor.getNodeType().equals(\\\"ELEV\\\")) {\\n // Remove the current element from the iterator and the list.\\n iterator.remove();\\n }\\n }\\n }\\n if(current.getNodeType().equals(\\\"STAI\\\") && newnode.getNodeType().equals(\\\"STAI\\\")) {\\n for (Iterator<StarNode> iterator = newnode.neighbors.iterator(); iterator.hasNext();) {\\n StarNode newneighbor = iterator.next();\\n if (newneighbor.getNodeType().equals(\\\"STAI\\\")) {\\n // Remove the current element from the iterator and the list.\\n iterator.remove();\\n }\\n }\\n }\\n // this is where the node is put in the right place in the queue\\n Collections.sort(frontier);\\n }\\n }\\n }\\n throw new NoPathException(start.getLongName(), goal.getLongName());\\n }\",\n \"protected void createTree() {\\n\\n\\t\\tint nextPlayer = opponent;\\n\\n\\t\\tQueue<Node> treeQueue = new LinkedList<Node>();\\n\\t\\tWinChecker winCheck = new WinChecker();\\n\\n\\t\\ttreeQueue.add(parent);\\n\\n\\t\\twhile (!treeQueue.isEmpty()) {\\n\\t\\t\\tNode currentNode = treeQueue.poll();\\n\\n\\t\\t\\tif (currentNode.getMove().Row != -1\\n\\t\\t\\t\\t\\t&& currentNode.getMove().Col != -1) {\\n\\t\\t\\t\\tgb.updateBoard(currentNode.getMove());\\n\\n\\t\\t\\t\\tif (winCheck.getWin(gb) >= 0) {\\n\\t\\t\\t\\t\\tgb.revertBoard(currentNode.getMove());\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tgb.revertBoard(currentNode.getMove());\\n\\t\\t\\t}\\n\\n\\t\\t\\t// Restricting the depth to which we will create the tree\\n\\t\\t\\tif (currentNode.getPly() > 2) {\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor (List<Hexagon> tempList : this.gb.getBoard()) {\\n\\t\\t\\t\\tfor (Hexagon tempHex : tempList) {\\n\\n\\t\\t\\t\\t\\tif (tempHex == null) {\\n\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif (tempHex.getValue() == EMPTY) {\\n\\n\\t\\t\\t\\t\\t\\tif (currentNode.getPly() % 2 == 0) {\\n\\t\\t\\t\\t\\t\\t\\tnextPlayer = opponent;\\n\\t\\t\\t\\t\\t\\t} else if (currentNode.getPly() % 2 == 1) {\\n\\t\\t\\t\\t\\t\\t\\tnextPlayer = player;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tMove nextMove = new Move(nextPlayer, false,\\n\\t\\t\\t\\t\\t\\t\\t\\ttempHex.getRow(), tempHex.getColumn());\\n\\n\\t\\t\\t\\t\\t\\tNode newNode = new Node(currentNode.getPly() + 1,\\n\\t\\t\\t\\t\\t\\t\\t\\tnextMove);\\n\\t\\t\\t\\t\\t\\tnewNode.setParent(currentNode);\\n\\n\\t\\t\\t\\t\\t\\tcurrentNode.children.add(newNode);\\n\\n\\t\\t\\t\\t\\t\\ttreeQueue.add(newNode);\\n\\t\\t\\t\\t\\t\\ttempHex.setValue(EMPTY);\\n\\t\\t\\t\\t\\t}// End of if statement\\n\\n\\t\\t\\t\\t}// End of inner ForLoop\\n\\t\\t\\t}// End of outer ForLoop\\n\\n\\t\\t\\t// currentNode.printChildren();\\n\\n\\t\\t}// End of While Loop\\n\\n\\t}\",\n \"public void RecursiveExpansion() throws TreeTooBigException {\\r\\n int transIndex; //Index to count transitions\\r\\n int[] newMarkup; //markup used to create new node\\r\\n boolean aTransitionIsEnabled = false; //To check for deadlock\\r\\n //Attribute used for assessing whether a node has occured before\\r\\n boolean repeatedNode = false; \\r\\n \\r\\n boolean allOmegas = false;\\r\\n \\r\\n boolean[] enabledTransitions = \\r\\n tree.dataLayer.getTransitionEnabledStatusArray(markup);\\r\\n\\r\\n //For each transition\\r\\n for (int i = 0; i < enabledTransitions.length; i++) {\\r\\n if (enabledTransitions[i] == true) {\\r\\n //Set transArray of to true for this index\\r\\n transArray[i] = true;\\r\\n \\r\\n //System.out.println(\\\"\\\\n Transition \\\" + i + \\\" Enabled\\\" );\\r\\n aTransitionIsEnabled = true;\\r\\n \\r\\n //print (\\\"\\\\n Old Markup is :\\\", markup);//debug\\r\\n \\r\\n //Fire transition to produce new markup vector\\r\\n newMarkup = fire(i);\\r\\n \\r\\n //print (\\\"\\\\n New Markup is :\\\", newMarkup);//debug\\r\\n \\r\\n //Check for safeness. If any of places have > 1 token set variable.\\r\\n for (int j = 0; j < newMarkup.length; j++) {\\r\\n if (newMarkup[j] > 1 || newMarkup[j] == -1) {\\r\\n tree.moreThanOneToken = true;\\r\\n break;\\r\\n }\\r\\n } \\r\\n \\r\\n //Create a new node using the new markup vector and attach it to\\r\\n //the current node as a child.\\r\\n children[i] = \\r\\n new myNode(newMarkup, this, tree, depth + 1);\\r\\n \\r\\n /* Now need to (a) check if any omegas (represented by -1) need to \\r\\n * be inserted in the markup vector of the new node, and (b) if the \\r\\n * resulting markup vector has appeared anywhere else in the tree. \\r\\n * We must do (a) before (b) as we need to know if the new node \\r\\n * contains any omegas to be able to compare it with existing nodes. \\r\\n */ \\r\\n allOmegas = children[i].InsertOmegas();\\r\\n \\r\\n //check if the resulting markup vector has occured anywhere else in the tree\\r\\n repeatedNode = (tree.root).FindMarkup(children[i]);\\r\\n \\r\\n if (tree.nodeCount >= Pipe.MAX_NODES && !tree.tooBig) {\\r\\n tree.tooBig = true;\\r\\n throw new TreeTooBigException();\\r\\n }\\r\\n \\r\\n if (!repeatedNode && !allOmegas) {\\r\\n children[i].RecursiveExpansion();\\r\\n }\\r\\n }\\r\\n }\\r\\n \\r\\n if (!aTransitionIsEnabled) {\\r\\n System.err.println(\\\"No transition enabled\\\");\\r\\n if (!tree.noEnabledTransitions || tree.pathToDeadlock.length < depth-1) {\\r\\n RecordDeadlockPath();\\r\\n tree.noEnabledTransitions = true;\\r\\n } else {\\r\\n System.err.println(\\\"Deadlocked node found, but path is not shorter\\\"\\r\\n + \\\" than current path.\\\");\\r\\n }\\r\\n } else {\\r\\n //System.out.println(\\\"Transitions enabled.\\\");\\r\\n }\\r\\n }\",\n \"public Node solve()\\n\\t{\\n\\t\\t// Initial problem state\\n\\t\\tint[] initial_state = {0, 0};\\n\\n\\t\\t// Current node under consideration\\n\\t\\tNode curr_node = new Node(initial_state, null, null);\\n\\n\\t\\t// List of frontier nodes at each iteration\\n\\t\\t// Manipulated as a queue\\n\\t\\tthis.frontier = new ArrayList<Node>();\\n\\n\\t\\t// List of nodes already explored\\n\\t\\t// They are excluded from expanded frontier nodes at each iteration\\n\\t\\tthis.explored = new ArrayList<int[]>();\\n\\n\\t\\tfrontier.add(curr_node);\\n\\n\\t\\twhile (true) {\\n\\t\\t\\t// If we have exhausted our frontier \\n\\t\\t\\t// we have no solution\\n\\t\\t\\tif (frontier.size() == 0) {\\n\\t\\t\\t\\treturn null;\\n\\t\\t\\t}\\n \\n // Pop new node from frontier to consider\\n\\t\\t\\tcurr_node = frontier.remove(0);\\n \\n\\t\\t // Add chosen node to explored list if not already there\\n\\t\\t\\tif(!this.inExplored(curr_node.state)) {\\n\\t\\t\\t\\texplored.add(curr_node.state);\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\n // List of actions that can be applied based on the state\\n // and the description of the problem\\n\\t\\t\\tAction[] actions = this.getFeasibleActions(curr_node.state);\\n\\n // Apply our transition model to generate child nodes \\n // from current node\\n\\t\\t\\tfor (Action action : actions) {\\n\\t\\t\\t\\tNode child = this.getChildNode(curr_node, action);\\t\\t\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif (!this.inFrontier(child) && !this.inExplored(child.state)) {\\n\\t\\t\\t\\t\\tif (this.isGoal(child.state)) {\\n\\t\\t\\t\\t\\t\\treturn child;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tfrontier.add(child);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"public boolean bestFirstSearch() {\\n\\t\\twhile(!soloution){\\n\\t\\t\\tif(open.isEmpty()){\\n\\t\\t\\t\\tSystem.out.println(\\\"No more choices to explore\\\");\\n\\t\\t\\t\\tSystem.out.println(\\\"SolutionId: \\\" + solutionId);\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t}\\n\\t\\t\\t//chooses the most optimal X\\n\\t\\t\\tNode x = popNode();\\n\\t\\t\\tclosed.add(x);\\n\\t\\t\\tSystem.out.println(\\\"X:\\\\t\\\\t\\\" + x.state + \\\" \\\" + x.h + \\\" + \\\" + x.g + \\\" = \\\" + x.f);\\n\\t\\t\\t//checks if it is a soulution\\n\\t\\t\\tif(solution(x)){\\n\\t\\t\\t\\tSystem.out.println(\\\"SOLUTION:\\\\t\\\" + x.state);\\n\\t\\t\\t\\tSystem.out.println(\\\"nodes created: \\\" + open.size() + closed.size());\\n\\t\\t\\t\\tprintSolution(x);\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t\\t//handles the possible moves from the state x\\n\\t\\t\\tsucc = generateAllSuccesors(x);\\n\\t\\t\\tfor (Node s : succ) {\\n\\t\\t\\t\\t//if this state already exist, we will use the node keeping it instead\\n\\t\\t\\t\\tNode old = findOld(s);\\n\\t\\t\\t\\tif(old != null)\\n\\t\\t\\t\\t\\ts = old;\\n\\t\\t\\t\\t//makes the new node a child of x\\n\\t\\t\\t\\tx.kids.add(s);\\n\\t\\t\\t\\t//if its a new state it will be inserted to open after evaluation\\n\\t\\t\\t\\tif(!open.contains(s) && !closed.contains(s)){\\n\\t\\t\\t\\t\\tattachAndEval(s,x);\\n\\t\\t\\t\\t\\tinsert(s);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t//if its an old node and x is a better parent it will be evalueted again.\\n\\t\\t\\t\\telse if(x.g + arcCost(x, s) < s.g){\\n\\t\\t\\t\\t\\tattachAndEval(s, x);\\n\\t\\t\\t\\t\\tif(closed.contains(s)){\\n\\t\\t\\t\\t\\t\\t//if its closed all children will be evaluated with the new score of \\\"s\\\"\\n\\t\\t\\t\\t\\t\\tpropagatePathImprovements(s);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn true;\\n\\t}\",\n \"private List<Path> expandExecution(Path input) {\\n\\t\\tList<Path> childInputs = new ArrayList<>(); //store the paths generated from given path\\n\\t\\t\\n\\t\\t//search from the top node which have not been searched before\\n\\t\\tfor(int j = input.bound; j < input.path.size() - 1; j++){\\n\\t\\t\\tdouble[] probabilityArray = cfg.getTransition_matrix().getRow(input.path.get(j));\\n\\t\\t\\tfor(int i = 0; i < probabilityArray.length; i++){\\n\\t\\t\\t\\t//the node been visited before only have two situation:1.has been searched,2.the path contains it in the workList \\n\\t\\t\\t\\tif(probabilityArray[i] > 0 && i != input.path.get(j + 1) && unvisited.contains(i)){\\n\\t\\t\\t\\t\\tList<Integer> tempPath = new ArrayList<>();\\n\\t\\t\\t\\t\\tfor(int index = 0; index < j + 1; index++)\\n\\t\\t\\t\\t\\t\\ttempPath.add(input.path.get(index));\\n\\t\\t\\t\\t\\ttempPath.add(i);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tPath newInput = new Path(tempPath, j + 1);\\n\\t\\t\\t\\t\\tchildInputs.add(newInput);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn childInputs;\\n\\t}\",\n \"private int evaluateChildren() {\\n if (PRINT_PROGRESS) {\\n System.out.println(\\\"Evaled:\\\"+boardsEvaluated);\\n }\\n if (this.children == null || this.children.isEmpty()) { // Exit case: Node is a leaf\\n return evaluateBoard(this.board);\\n }\\n \\n int bestEval = Integer.MIN_VALUE;\\n for (final BoardTree child : this.children) {\\n child.evaluation = child.evaluateChildren();\\n if (child.evaluation > bestEval) {\\n bestEval = child.evaluation;\\n }\\n }\\n return bestEval;\\n }\",\n \"public static void bfs (String input)\\r\\n\\t{\\r\\n\\t\\tNode root_bfs = new Node (input);\\r\\n\\t\\tNode current = new Node(root_bfs.getState());\\r\\n\\t\\t\\r\\n\\t\\tArrayList<String> visited = new ArrayList<String>();\\r\\n\\t\\tArrayList<String> children = new ArrayList<String>();\\r\\n\\t\\tQueue<Node> queue_bfs = new LinkedList<Node>();\\r\\n\\t\\t\\r\\n\\t\\tint nodes_popped = 0;\\r\\n\\t\\tint queue_max_size = 0;\\r\\n\\t\\tint queue_size = 0;\\r\\n\\t\\tcurrent.cost = 0;\\r\\n\\t\\t\\r\\n\\t\\t// Initial check for goal state\\r\\n\\t\\tgoal_bfs = isGoal(current.getState());\\r\\n\\t\\t\\r\\n\\t\\twhile(!goal_bfs)\\r\\n\\t\\t{\\r\\n\\t\\t\\t// Add the current node to the visited array\\r\\n\\t\\t\\tvisited.add(current.getState());\\r\\n\\t\\t\\t// Get the nodes children from the successor function\\r\\n\\t\\t\\tchildren = Successor.findChildren(current.getState());\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tfor (String a : children)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\t// State checking, don't add already visited nodes to the queue\\r\\n\\t\\t\\t\\tif (visited.contains(a))\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tcontinue;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t// Create child node from the children array and add it to the current node\\r\\n\\t\\t\\t\\t\\tNode nino = new Node(a);\\r\\n\\t\\t\\t\\t\\tcurrent.children_nodes.add(nino);\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t// Obtaining the path cost\\r\\n\\t\\t\\t\\t\\tint cost = isCost(current.getState(), nino.getState());\\r\\n\\t\\t\\t\\t\\tnino.cost = cost;\\r\\n\\t\\t\\t\\t\\tnino.parent = current;\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t// State check and adding the child to the queue. Increasing size counter\\r\\n\\t\\t\\t\\t\\tif (!queue_bfs.contains(nino))\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tqueue_bfs.add(nino);\\r\\n\\t\\t\\t\\t\\t\\tqueue_size++;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t// Pop a node off the queue\\r\\n\\t\\t\\tcurrent = queue_bfs.poll();\\r\\n\\t\\t\\tnodes_popped++;\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t// Added this because my queue size variable was always one off based on where my goal check is\\r\\n\\t\\t\\tif (queue_size > queue_max_size)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tqueue_max_size = queue_size;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t// Decrease queue size because a node has been popped and check for goal state\\r\\n\\t\\t\\tqueue_size--;\\r\\n\\t\\t\\tgoal_bfs = isGoal(current.getState());\\r\\n\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\t// Now that a solution has been found, set the boolean back to false for another run\\r\\n\\t\\tgoal_bfs = false;\\r\\n\\t\\tSystem.out.println(\\\"BFS Solved!!\\\");\\r\\n\\t\\t\\r\\n\\t\\t// Send metrics to be printed to the console\\r\\n\\t\\tSolution.performSolution(current, root_bfs, nodes_popped, queue_max_size);\\r\\n\\t\\t\\t\\r\\n\\t}\",\n \"public void dfs (String input)\\r\\n\\t {\\r\\n\\t\\t \\tNode root_dfs = new Node (input);\\r\\n\\t\\t \\tNode current = new Node(root_dfs.getState());\\r\\n\\t\\t \\t\\r\\n\\t\\t\\tArrayList<String> visited = new ArrayList<String>();\\r\\n\\t\\t\\tArrayList<String> children = new ArrayList<String>();\\r\\n\\t\\t\\tStack<Node> stack_dfs = new Stack<Node>();\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tint nodes_popped = 0;\\r\\n\\t\\t\\tint stack_max_size = 0;\\r\\n\\t\\t\\tint stack_size = 0;\\r\\n\\t\\t\\tcurrent.cost = 0;\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tgoal_dfs = isGoal(current.getState());\\r\\n\\t\\t\\t\\r\\n\\t\\t\\twhile(!goal_dfs)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tvisited.add(current.getState());\\r\\n\\t\\t\\t\\tchildren = Successor.findChildren(current.getState());\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tfor (String a : children)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tif (visited.contains(a))\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tcontinue;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tNode nino = new Node(a);\\r\\n\\t\\t\\t\\t\\t\\tcurrent.children_nodes.add(nino);\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tint cost = isCost(current.getState(), nino.getState());\\r\\n\\t\\t\\t\\t\\t\\tnino.cost = cost;\\r\\n\\t\\t\\t\\t\\t\\tnino.parent = current;\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t// Repeated state check\\r\\n\\t\\t\\t\\t\\t\\tif (!stack_dfs.contains(nino))\\r\\n\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\tstack_dfs.add(nino);\\r\\n\\t\\t\\t\\t\\t\\t\\tstack_size++;\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t// Popping off the stack. LIFO architecture\\r\\n\\t\\t\\t\\tcurrent = stack_dfs.pop();\\r\\n\\t\\t\\t\\tnodes_popped++;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif (stack_size > stack_max_size)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tstack_max_size = stack_size;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tstack_size--;\\r\\n\\t\\t\\t\\tgoal_dfs = isGoal(current.getState());\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tgoal_dfs = false;\\r\\n\\t\\t\\tSystem.out.println(\\\"DFS Solved!!\\\");\\r\\n\\t\\t\\tSolution.performSolution(current, root_dfs, nodes_popped, stack_max_size);\\r\\n\\t }\",\n \"private static BoardNode startGreedyDepthFirst(int steps, BoardNode node){\\n count = 1;\\n return greedyDepthFirst(steps, node);\\n }\",\n \"public ReturnClass astar_algo(){\\n long start=System.nanoTime();\\n TreeStar node=new TreeStar(variables,0);\\n openList.push(node);\\n\\n while (!openList.isEmpty())\\n {\\n\\n TreeStar temp= openList.pollLast(); //pop the highest scoring node in openList\\n refreshUsage(temp.variables); //uses the current node variables to update usageArray\\n\\n if((System.nanoTime()-start)/1000000000>=maxTime){\\n System.out.println(\\\"time limit reached\\\");\\n ReturnClass returnClass= new ReturnClass(temp.variables,temp.score,false);\\n return returnClass;\\n }\\n\\n if(temp.score==nbC){\\n System.out.println(\\\"solution trouvée !\\\");\\n printArray(temp.variables);\\n ReturnClass returnClass= new ReturnClass(temp.variables,temp.score,true);\\n return returnClass;\\n }\\n\\n int bestVar=0;\\n if(heuristic.equals(\\\"TD Heuristic\\\")){\\n bestVar= chooseVTD(); //get the highest scoring unused var to use it in children\\n }\\n else if(heuristic.equals(\\\"TD-long heuristic\\\")){\\n bestVar=chooseVTD();\\n }\\n else if(heuristic.equals(\\\"Partial-diff Heuristic\\\")){\\n bestVar= chooseVDiff(temp.variables); //get the highest scoring unused var to use it in children\\n }\\n else {\\n bestVar= chooseVDiff(temp.variables);\\n }\\n\\n\\n TreeStar node1= nextVar(temp.variables, 0,bestVar,temp.profondeur+1);\\n TreeStar node2= nextVar(temp.variables, 1,bestVar,temp.profondeur+1);\\n\\n if(node1!=null){\\n addToOpenList(node1);\\n addToOpenList(node2);\\n }\\n }\\n\\n System.out.println(\\\"solution non trouvée\\\");\\n return null;\\n }\",\n \"private int heuristic(Node node, int currentDepth) {\\n\\n int ef, w1 = 1, w2 = 1, w3 = 0, w4 = 10, w5 = 1, w6 = 35, e1 = 0, e2 = 0, e3 = 0, e4 = 0, e5 = 0, e6 = 0;\\n\\n int ourSeedsInStore = node.getBoard().getSeedsInStore(ourSide);\\n int oppSeedsInStore = node.getBoard().getSeedsInStore(ourSide.opposite());\\n\\n\\n // hardcode fix.\\n int parentOurSeedsInStore = 0;\\n int parentOppSeedsInStore = 0;\\n int parentMove = 0;\\n int parentOurSeedsInHouse = 0;\\n int parentOppSeedsInHouse = 0;\\n\\n if (currentDepth != 1) {\\n parentOurSeedsInStore = node.getParent().getBoard().getSeedsInStore(ourSide);\\n parentOppSeedsInStore = node.getParent().getBoard().getSeedsInStore(ourSide.opposite());\\n parentMove = node.getName();\\n parentOurSeedsInHouse = node.getParent().getBoard().getSeeds(ourSide, parentMove);\\n parentOppSeedsInHouse = node.getParent().getBoard().getSeeds(ourSide.opposite(), parentMove);\\n }\\n\\n int ourFreeHouse = 0;\\n int oppFreeHouse = 0;\\n int ourSeeds = ourSeedsInStore;\\n int oppSeeds = oppSeedsInStore;\\n\\n int asdf1 = ourSeedsInStore - parentOurSeedsInStore;\\n int asdf2 = oppSeedsInStore - parentOppSeedsInStore;\\n\\n e6 = asdf1 - asdf2;\\n\\n for (int i = 1; i <= 7; i++) {\\n ourSeeds += node.getBoard().getSeeds(ourSide, i);\\n oppSeeds += node.getBoard().getSeeds(ourSide.opposite(), i);\\n }\\n\\n for (int i = 1; i <= 7; i++) {\\n if (node.getBoard().getSeeds(ourSide, i) == 0)\\n ourFreeHouse++;\\n if (node.getBoard().getSeeds(ourSide.opposite(), i) == 0)\\n oppFreeHouse++;\\n }\\n\\n e1 = ourSeeds - oppSeeds;\\n e2 = ourFreeHouse - oppFreeHouse;\\n\\n // hardcode fix.\\n if (currentDepth != 1) {\\n if (node.getParent().getPlayerSide() == this.getOurSide()) {\\n // if last move puts seed into store\\n if ((parentMove + parentOurSeedsInHouse) % 8 == 0) {\\n e4 = 1;\\n e3 = (parentMove + parentOurSeedsInHouse) / 8;\\n } else if (parentMove + parentOurSeedsInStore > 8) {\\n e4 = 0;\\n e3 = (parentMove + parentOurSeedsInStore) / 8;\\n }\\n\\n for (int i = 1; i <= 7; i++) {\\n int parentOurSeedsInCurrentHouse = node.getParent().getBoard().getSeeds(ourSide, i);\\n int parentOppSeedsInFrontHouse = node.getParent().getBoard().getSeeds(ourSide.opposite(), 8 - i);\\n int oppSeedsInFrontHouse = node.getBoard().getSeeds(ourSide.opposite(), 8 - i);\\n // if there's no seed in current house && there is seed right in front of us\\n if ((parentOurSeedsInCurrentHouse == 0 || parentOurSeedsInCurrentHouse == 15) && parentOppSeedsInFrontHouse != 0 && oppSeedsInFrontHouse == 0) {\\n if (currentDepth != 2) {\\n if (node.getParent().getParent().getPlayerSide() == this.getOurSide()) {\\n w5 = 5;\\n e5 = parentOppSeedsInFrontHouse;\\n break;\\n }\\n }\\n e5 = parentOppSeedsInFrontHouse;\\n break;\\n }\\n\\n }\\n } else if (node.getParent().getPlayerSide() == this.getOurSide().opposite()) {\\n\\n if (parentMove + parentOppSeedsInHouse == 8) {\\n e4 = -1;\\n e3 = -1 * (parentMove + parentOppSeedsInHouse) / 8;\\n } else if (parentMove + parentOppSeedsInStore > 8) {\\n e4 = 0;\\n e3 = -(parentMove + parentOppSeedsInStore) / 8;\\n }\\n\\n\\n for (int i = 1; i <= 7; i++) {\\n int parentOppSeedsInCurrentHouse = node.getParent().getBoard().getSeeds(ourSide.opposite(), i);\\n int parentOurSeedsInFrontHouse = node.getParent().getBoard().getSeeds(ourSide, 8 - i);\\n int oppSeedsInCurrentHouse = node.getBoard().getSeeds(ourSide, 8 - i);\\n\\n if ((parentOppSeedsInCurrentHouse == 0 || parentOppSeedsInCurrentHouse == 15) && parentOurSeedsInFrontHouse != 0 && oppSeedsInCurrentHouse == 0) {\\n if (currentDepth != 2) {\\n if (node.getParent().getParent().getPlayerSide() == this.getOurSide()) {\\n w5 = 5;\\n e5 = -parentOurSeedsInFrontHouse;\\n break;\\n }\\n }\\n w5 = 5;\\n e5 = -parentOurSeedsInFrontHouse;\\n break;\\n }\\n }\\n }\\n }\\n ef = w1 * e1 + w2 * e2 + w3 * e3 + w4 * e4 + w5 * e5 + w6 * e6;\\n return ef;\\n }\",\n \"public static ArrayList<Node> getChildren(Node current) {\\r\\n\\r\\n ArrayList<Node> OpChild = new ArrayList<Node>();\\r\\n if (current.getParentMove() == null) current.setParentMove(\\\"\\\");\\r\\n if (current.getDirection()==null) current.setDirection(\\\"\\\");\\r\\n int i_Zero = 0, j_Zero = 0;\\r\\n int[][] CurrState = current.mat;\\r\\n /*\\r\\n explain for the fucntions\\r\\n the function get node and the list. check the border and the parent.\\r\\n swap the state matrix and then create Node with state mat.\\r\\n set to the node the cost the direction iterazit and it to the list.\\r\\n after that add it to the list.\\r\\n */\\r\\n\\r\\n DobleLeft(current, OpChild);\\r\\n DoubleUp(current, OpChild);\\r\\n\\r\\n DoubleRight(current, OpChild);\\r\\n DoubleDown(current, CurrState, OpChild);\\r\\n// for the first zero\\r\\n leftMove(current, current.zero1[0], current.zero1[1], OpChild);\\r\\n upMove(current, current.zero1[0], current.zero1[1], OpChild);\\r\\n rightMove(current, current.zero1[0], current.zero1[1], OpChild);\\r\\n downMove(current, current.zero1[0], current.zero1[1], OpChild);\\r\\n // check if has 2 zeros\\r\\n if (current.zero2[0]!=-1) {\\r\\n leftMove(current, current.zero2[0], current.zero2[1], OpChild);\\r\\n upMove(current, current.zero2[0], current.zero2[1], OpChild);\\r\\n rightMove(current, current.zero2[0], current.zero2[1], OpChild);\\r\\n downMove(current, current.zero2[0], current.zero2[1], OpChild);\\r\\n\\r\\n }\\r\\n return OpChild;\\r\\n }\",\n \"private MoveTree generateTree() {\\n\\n\\t\\tArrayList<MoveTree> leaves = new ArrayList<>();\\n\\n\\t\\tMoveTree tree = new MoveTree(Main.getSWController().getGame().getCurrentGameState());\\n\\t\\tleaves.add(tree);\\n\\n\\t\\tfinal Flag flag = new Flag(), finished = new Flag();\\n\\n\\t\\tTimer timer = new Timer(true);\\n\\t\\ttimer.schedule(new TimerTask() {\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic void run() {\\n\\t\\t\\t\\tsynchronized (flag) {\\n\\t\\t\\t\\t\\tif (!finished.value)\\n\\t\\t\\t\\t\\t\\tflag.value = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}, 9000);\\n\\n\\t\\twhile (true) {\\n\\t\\t\\tArrayList<MoveTree> newLeaves = new ArrayList<>();\\n\\t\\t\\tfor (MoveTree leaf : leaves) {\\n\\t\\t\\t\\tGameState state = leaf.getState();\\n\\t\\t\\t\\tPlayer currentPlayer = state.getPlayer();\\n\\n\\t\\t\\t\\tfor (Card handcard : currentPlayer.getHand()) {\\n\\t\\t\\t\\t\\tBuildCapability capability = Main.getSWController().getPlayerController().canBuild(currentPlayer, handcard, state);\\n\\t\\t\\t\\t\\tswitch (capability) {\\n\\t\\t\\t\\t\\tcase FREE:\\n\\t\\t\\t\\t\\tcase OWN_RESOURCE:\\n\\t\\t\\t\\t\\t\\tMove move = new Move(handcard, Action.BUILD);\\n\\t\\t\\t\\t\\t\\tMoveTree newTree = new MoveTree(move, doMove(move, currentPlayer, state));\\n\\t\\t\\t\\t\\t\\tnewLeaves.add(newTree);\\n\\t\\t\\t\\t\\t\\tleaf.addChild(newTree);\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\tcase TRADE:\\n\\t\\t\\t\\t\\t\\tTradeOption trade = Main.getSWController().getPlayerController().getTradeOptions(currentPlayer, handcard.getRequired(), state).get(0);\\n\\t\\t\\t\\t\\t\\tMove tradeMove = new Move(handcard, Action.BUILD);\\n\\t\\t\\t\\t\\t\\ttradeMove.setTradeOption(trade);\\n\\t\\t\\t\\t\\t\\tMoveTree newTree2 = new MoveTree(tradeMove, doMove(tradeMove, currentPlayer, state));\\n\\t\\t\\t\\t\\t\\tnewLeaves.add(newTree2);\\n\\t\\t\\t\\t\\t\\tleaf.addChild(newTree2);\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\tdefault:\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif (currentPlayer.getBoard().nextSlot() != -1) {\\n\\t\\t\\t\\t\\t\\tArrayList<Resource> slotRequirements = new ArrayList<>(Arrays.asList(currentPlayer.getBoard().getNextSlotRequirement()));\\n\\t\\t\\t\\t\\t\\tcapability = Main.getSWController().getPlayerController().hasResources(currentPlayer, slotRequirements, state);\\n\\t\\t\\t\\t\\t\\tswitch (capability) {\\n\\t\\t\\t\\t\\t\\tcase OWN_RESOURCE:\\n\\t\\t\\t\\t\\t\\t\\tMove move = new Move(handcard, Action.PLACE_SLOT);\\n\\t\\t\\t\\t\\t\\t\\tMoveTree newTree = new MoveTree(move, doMove(move, currentPlayer, state));\\n\\t\\t\\t\\t\\t\\t\\tnewLeaves.add(newTree);\\n\\t\\t\\t\\t\\t\\t\\tleaf.addChild(newTree);\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\tcase TRADE:\\n\\t\\t\\t\\t\\t\\t\\tTradeOption trade = Main.getSWController().getPlayerController().getTradeOptions(currentPlayer, slotRequirements, state).get(0);\\n\\t\\t\\t\\t\\t\\t\\tMove tradeMove = new Move(handcard, Action.PLACE_SLOT);\\n\\t\\t\\t\\t\\t\\t\\ttradeMove.setTradeOption(trade);\\n\\t\\t\\t\\t\\t\\t\\tMoveTree newTree2 = new MoveTree(tradeMove, doMove(tradeMove, currentPlayer, state));\\n\\t\\t\\t\\t\\t\\t\\tnewLeaves.add(newTree2);\\n\\t\\t\\t\\t\\t\\t\\tleaf.addChild(newTree2);\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\tdefault:\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tMove sellmove = new Move(handcard, Action.SELL);\\n\\t\\t\\t\\t\\tMoveTree selltree = new MoveTree(sellmove, doMove(sellmove, currentPlayer, state));\\n\\t\\t\\t\\t\\tnewLeaves.add(selltree);\\n\\t\\t\\t\\t\\tleaf.addChild(selltree);\\n \\n\\t\\t\\t\\t\\tif (!currentPlayer.isOlympiaUsed() && !Main.getSWController().getCardController().hasCard(currentPlayer, handcard.getInternalName())) {\\n\\t\\t\\t\\t\\t\\tMove olympiamove = new Move(handcard, Action.OLYMPIA);\\n\\t\\t\\t\\t\\t\\tMoveTree olympiatree = new MoveTree(olympiamove, doMove(olympiamove, currentPlayer, state));\\n\\t\\t\\t\\t\\t\\tnewLeaves.add(olympiatree);\\n\\t\\t\\t\\t\\t\\tleaf.addChild(olympiatree);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tsynchronized (flag) {\\n\\t\\t\\t\\t\\tif (flag.value) {\\n\\t\\t\\t\\t\\t\\tfor (MoveTree child : leaves)\\n\\t\\t\\t\\t\\t\\t\\tchild.getChildren().clear();\\n\\t\\t\\t\\t\\t\\treturn tree;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tboolean breakAfterwards = false;\\n\\n\\t\\t\\tfor (MoveTree newLeaf : newLeaves) {\\n\\t\\t\\t\\tfor (Player player : newLeaf.getState().getPlayers()) {\\n\\t\\t\\t\\t\\tif (player.isMausoleum()) {\\n\\t\\t\\t\\t\\t\\tCard card = getHalikarnassusCard(player, newLeaf.getState().getTrash(), newLeaf.getState());\\n\\t\\t\\t\\t\\t\\tif (card == null)\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\tnewLeaf.getState().getTrash().remove(card);\\n\\t\\t\\t\\t\\t\\tplayer.getBoard().addCard(card);\\n\\t\\t\\t\\t\\t\\tif (card.getEffects() != null)\\n\\t\\t\\t\\t\\t\\t\\tfor (Effect effect : card.getEffects())\\n\\t\\t\\t\\t\\t\\t\\t\\tif (effect.getType() == EffectType.WHEN_PLAYED)\\n\\t\\t\\t\\t\\t\\t\\t\\t\\teffect.run(player, Main.getSWController().getGame());\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tnewLeaf.getState().setCurrentPlayer((newLeaf.getState().getCurrentPlayer() + 1) % newLeaf.getState().getPlayers().size());\\n\\n\\t\\t\\t\\tif (newLeaf.getState().getCurrentPlayer() == newLeaf.getState().getFirstPlayer()) {\\n\\t\\t\\t\\t\\tif (newLeaf.getState().getRound() < GameController.NUM_ROUNDS)\\n\\t\\t\\t\\t\\t\\tMain.getSWController().getGameController().nextRound(Main.getSWController().getGame(), newLeaf.getState());\\n\\t\\t\\t\\t\\telse // stop look-ahead at the end of age\\n\\t\\t\\t\\t\\t\\tbreakAfterwards = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tleaves.clear();\\n\\t\\t\\tleaves.addAll(newLeaves);\\n\\n\\t\\t\\tif (breakAfterwards)\\n\\t\\t\\t\\tbreak;\\n\\t\\t}\\n\\n\\t\\tfinished.value = true;\\n\\n\\t\\treturn tree;\\n\\t}\",\n \"public static void generateTree(Node root){\\n\\n // If we hit the winning position or a draw, stop generating (Exit condition)\\n if(defaultEvaluator.evaluate(root.getBoard()) != 0 || root.getBoard().getTurnNumber() == 9)\\n return;\\n\\n // Else, keep generating recursively\\n\\n // Step0-Determine the turn player.\\n GamePiece turnPlayer;\\n if (root.getBoard().isXTurn()) {\\n turnPlayer = GamePiece.X;\\n }\\n else {\\n turnPlayer = GamePiece.O;\\n }\\n\\n // Step1-generate a new board for every child of root\\n int parentalBranches = root.getChildren().length;\\n int childrenBranches = parentalBranches - 1;\\n for(int i=0; i<parentalBranches; ++i){\\n\\n root.getChildren()[i] = new Node(childrenBranches);\\n root.getChildren()[i].setBoard((Board)(root.getBoard().clone()));\\n\\n }\\n\\n // Step2-Place the pieces\\n int childIndex=0;\\n int placement = 0;\\n while(childIndex<parentalBranches){\\n\\n try{\\n\\n root.getChildren()[childIndex].getBoard().set(placement %3, placement /3, turnPlayer);\\n childIndex++;\\n\\n }catch(GridAlreadyChosenException ex){}\\n placement++;\\n\\n }\\n\\n // Step3-Let the recursive madness begin. Call generateTree() on each child\\n for (int i=0; i<parentalBranches; ++i)\\n generateTree(root.getChildren()[i]);\\n\\n\\n }\",\n \"private boolean cycleCheck(Node current, Queue<Node> expanded){\\n\\n if( expanded.size() == 0){\\n return false; //Because current is root\\n }\\n\\n for(Node nodeInExpanded : expanded){\\n\\n if(current!=null && current.getDigit().getDigitString().equals(nodeInExpanded.getDigit().getDigitString())){\\n //the digits are same so we check children.\\n\\n ArrayList<String> currentChildren = makeChildren(current);\\n ArrayList<String> childrenOfExpanded = makeChildren(nodeInExpanded);\\n\\n int size;\\n\\n if(currentChildren.size() > childrenOfExpanded.size() ){\\n size = childrenOfExpanded.size();\\n }else if(currentChildren.size() < childrenOfExpanded.size()){\\n size = currentChildren.size();\\n }else{\\n size = childrenOfExpanded.size();\\n }\\n /*\\n I use the modulus operator so that I dont get a ArrayIndexOut of Bounds\\n */\\n\\n if( currentChildren.size() == childrenOfExpanded.size()\\n && currentChildren.get(0%size).equals(childrenOfExpanded.get(0%size))\\n && currentChildren.get(1%size).equals(childrenOfExpanded.get(1%size))\\n && currentChildren.get(2%size).equals(childrenOfExpanded.get(2%size))\\n && currentChildren.get(3%size).equals(childrenOfExpanded.get(3%size))\\n ){\\n return true;\\n }\\n }\\n }\\n\\n return false;\\n }\",\n \"public MoveNode ab(PentagoBoardState pbs,int myscore, int alpha, int beta,int amimaxplayer, int depth,int requireddepth){\\n\\n int bestmovescore;\\n PentagoMove bestmove;\\n\\n ArrayList<PentagoMove> legalmoves = pbs.getAllLegalMoves();\\n Collections.shuffle(legalmoves); //helps avoid worst run time if all good moves are at the end of array list\\n\\n MoveNode moveNode =new MoveNode(new PentagoMove(0,0,0,0,0),0);\\n\\n if (depth==requireddepth){\\n bestmovescore= evaluate(pbs);\\n moveNode.MyMove = null;\\n moveNode.value = evaluate(pbs);\\n return moveNode;\\n\\n }\\n else if (pbs.getWinner() != Board.NOBODY){ //check win since we are at leafnode\\n bestmovescore= evaluate(pbs);\\n moveNode.MyMove = null;\\n int movescore = evaluate(pbs);\\n if (movescore<-1200000){\\n moveNode.value = -999999999; //assign loss value\\n } //Losing Move\\n else if (movescore>1200000){\\n moveNode.value = 999999999; //assign win value\\n } // Winning Move\\n return moveNode;\\n\\n }\\n //do max player\\n if (amimaxplayer ==1){\\n int currentvalue = -999999999;\\n PentagoMove currentmove =legalmoves.get(0);\\n MoveNode currentmovenode = new MoveNode(currentmove,currentvalue);\\n for (int i = 0; i < legalmoves.size(); i++) {\\n PentagoBoardState newboard = (PentagoBoardState) pbs.clone();\\n PentagoMove movetoprocess = legalmoves.get(i);\\n newboard.processMove(movetoprocess);\\n\\n\\n MoveNode scoreAfterMove = ab(newboard, currentvalue, alpha, beta, 0, depth + 1, requireddepth); // run recursion till leaf node or depth reached\\n if (scoreAfterMove.value > currentvalue) { //see if current best value is lower than the new value if so replace\\n currentvalue = scoreAfterMove.value;\\n currentmove = movetoprocess;\\n currentmovenode.value = currentvalue;\\n currentmovenode.MyMove = currentmove;\\n\\n //System.out.println(\\\"I am max plyaer at depth:\\\" + depth + \\\"\\\\n current move is: \\\" + currentmove + \\\"\\\\ncurrentvalue is: \\\" + currentvalue);\\n\\n }\\n\\n alpha = Math.max(alpha,currentvalue);\\n if (alpha>=beta){ // break loop if alpha more than beta\\n //System.out.println(\\\"Get pruned my alpha is \\\" + alpha + \\\" my beta is \\\" + beta );\\n break;\\n }\\n }\\n //System.out.println(\\\"I am max plyaer at depth:\\\" + depth + \\\"\\\\n current move is: \\\" + currentmove + \\\"\\\\ncurrentvalue is: \\\" + currentvalue+\\\" my alpha is \\\" + alpha + \\\" my beta is \\\" + beta);\\n\\n return currentmovenode;\\n }\\n //do min player\\n else if (amimaxplayer==0){\\n int currentvalue = 999999999;\\n PentagoMove currentmove =legalmoves.get(0);\\n MoveNode currentmovenode = new MoveNode(currentmove,currentvalue);\\n for (int i = 0; i < legalmoves.size(); i++) {\\n PentagoBoardState newboard = (PentagoBoardState) pbs.clone();\\n PentagoMove movetoprocess = legalmoves.get(i);\\n newboard.processMove(movetoprocess);\\n\\n MoveNode scoreAfterMove = ab(newboard, currentvalue, alpha, beta, 1, depth + 1, requireddepth);\\n if (scoreAfterMove.value < currentvalue) {\\n currentvalue = scoreAfterMove.value;\\n currentmove = movetoprocess;\\n currentmovenode.value = currentvalue;\\n currentmovenode.MyMove = currentmove;\\n //System.out.println(\\\"I am min plyaer at depth:\\\" + depth + \\\"\\\\n current move is: \\\" + currentmove + \\\"\\\\ncurrentvalue is: \\\" + currentvalue);\\n }\\n beta = Math.min(beta,currentvalue);\\n if (alpha>=beta){\\n //System.out.println(\\\"Get pruned my alpha is \\\" + alpha + \\\" my beta is \\\" + beta );\\n break;\\n }\\n }\\n return currentmovenode;\\n }\\n //System.out.println(\\\"move val \\\" + moveNode.value);\\n return moveNode;\\n }\",\n \"private void getAllNodesBreadthFirstSearch(List<Expression> nodesList)\\n/* */ {\\n/* 156 */ int indx = 0;\\n/* 157 */ nodesList.add(this);\\n/* */ \\n/* 159 */ while (indx < nodesList.size()) {\\n/* 160 */ Expression node = (Expression)nodesList.get(indx++);\\n/* 161 */ for (Expression child : node.childs) {\\n/* 162 */ nodesList.add(child);\\n/* */ }\\n/* */ }\\n/* */ }\",\n \"public static void main(String[] args) {\\n\\t\\tScanner sc=new Scanner(System.in);\\n\\t\\tn=sc.nextInt();\\n\\t\\t\\n\\t\\tint [][]arr=new int[n][n];\\n\\t\\tint xShark=0;\\n\\t\\tint yShark=0;\\n\\t\\tint size=2;\\n\\t\\tfor(int i=0;i<n;i++) {\\n\\t\\t\\tfor(int j=0;j<n;j++) {\\n\\t\\t\\t\\tarr[i][j]=sc.nextInt();\\n\\t\\t\\t\\tif(arr[i][j]==9) {\\n\\t\\t\\t\\t\\txShark=i;\\n\\t\\t\\t\\t\\tyShark=j;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint go=0;\\n\\t\\tint eat=0;\\n\\t\\twhile(true) {\\n\\t\\t\\tList<Node> list=new ArrayList<>();\\n\\t\\t\\tnarr=new int[n][n];\\n\\t\\t\\tint min=Integer.MAX_VALUE;\\n\\t\\t\\t\\n\\t\\t\\tcanGo(arr, xShark, yShark, size);\\n\\t\\t\\tSystem.out.println();\\n\\t\\t\\tfor(int i=0;i<n;i++) {\\n\\t\\t\\t\\tfor(int j=0;j<n;j++)System.out.print(narr[i][j]);\\n\\t\\t\\t\\tSystem.out.println();\\n\\t\\t\\t}\\n\\t\\t\\tfor(int i=0;i<n;i++) {\\n\\t\\t\\t\\tfor(int j=0;j<n;j++) {\\n\\t\\t\\t\\t\\tif(narr[i][j]>0) {\\n\\t\\t\\t\\t\\t\\tlist.add(new Node(i,j,narr[i][j]));\\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\\t\\n\\t\\t\\t//System.out.println(\\\"s\\\"+list.size());\\n\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t\\tif(list.isEmpty())break;\\n\\t\\t\\tCollections.sort(list);\\n\\t\\t\\tNode N=list.get(0);\\n\\t\\t\\t//System.out.println(xShark+\\\" \\\"+yShark+\\\" \\\"+go);\\n\\t\\t\\tarr[xShark][yShark]=0;\\n\\t\\t\\txShark=N.x;\\n\\t\\t\\tyShark=N.y;\\n\\t\\t\\tarr[xShark][yShark]=9;\\n\\t\\t\\tgo+=N.distance;\\n\\t\\t\\teat++;\\n\\t\\t\\tif(eat==size) {\\n\\t\\t\\t\\teat=0;\\n\\t\\t\\t\\tsize++;\\n\\t\\t\\t}\\n\\t\\t\\t/*System.out.println(xShark+\\\" \\\"+yShark+\\\" \\\"+go);\\n\\t\\t\\tfor(int i=0;i<n;i++) {\\n\\t\\t\\t\\tfor(int j=0;j<n;j++)System.out.print(arr[i][j]);\\n\\t\\t\\t\\tSystem.out.println();\\n\\t\\t\\t}\\n\\t\\t\\tfor(int i=0;i<list.size();i++)System.out.println(list.get(i).toString());*/\\n\\t\\t\\t//System.out.println();\\n\\t\\t}\\n\\t\\tSystem.out.println(go);\\n\\t\\t\\n\\t\\t\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"private void makeTree(HashMap<Instance, Bag> instanceBags,\\n ArrayList<Instance> all, boolean stopOnFirstPositiveLeaf) {\\n\\n Random r = new Random(getSeed());\\n\\n AlgorithmConfiguration settings = getSettings();\\n\\n ArrayList<TreeNode> toSplit = new ArrayList<TreeNode>();\\n\\n root = new TreeNode(null, all);\\n toSplit.add(root);\\n numLeaves = 0;\\n\\n while (toSplit.size() > 0) {\\n\\n // The next two lines are here solely to reproduce the results from the\\n // paper\\n // (i.e. so that the same random number sequence is used.\\n int nextIndex = Math.min(1, toSplit.size());\\n nextIndex = r.nextInt(nextIndex);\\n\\n TreeNode next = toSplit.remove(nextIndex);\\n if (next == null) {\\n continue;\\n }\\n\\n if (next.isPurePositive(instanceBags)) {\\n next.makeLeafNode(true);\\n ArrayList<String> deactivated = new ArrayList<String>();\\n next.deactivateRelatedInstances(instanceBags, deactivated);\\n\\n if (m_Debug && deactivated.size() > 0) {\\n Bag.printDeactivatedInstances(deactivated);\\n }\\n\\n // Need to re-calculate scores if positive leaf has been\\n // created\\n for (TreeNode n : toSplit) {\\n n.removeDeactivatedInstances(instanceBags);\\n n.calculateNodeScore(instanceBags, m_unbiasedEstimate,\\n m_kBEPPConstant, m_useBagCount, m_bagInstanceMultiplier);\\n }\\n\\n if (stopOnFirstPositiveLeaf && deactivated.size() > 0) {\\n return;\\n }\\n\\n } else if (next.isPureNegative(instanceBags)) {\\n next.makeLeafNode(false);\\n } else {\\n next.splitInstances(instanceBags, settings, r, m_Debug);\\n if (!next.isLeafNode()) {\\n if (next.split.isNominal) {\\n TreeNode[] nominals = next.nominals();\\n for (TreeNode nominal : nominals) {\\n nominal.calculateNodeScore(instanceBags, m_unbiasedEstimate,\\n m_kBEPPConstant, m_useBagCount, m_bagInstanceMultiplier);\\n toSplit.add(nominal);\\n }\\n } else {\\n next.left().calculateNodeScore(instanceBags, m_unbiasedEstimate,\\n m_kBEPPConstant, m_useBagCount, m_bagInstanceMultiplier);\\n toSplit.add(next.left());\\n next.right().calculateNodeScore(instanceBags, m_unbiasedEstimate,\\n m_kBEPPConstant, m_useBagCount, m_bagInstanceMultiplier);\\n toSplit.add(next.right());\\n }\\n } else {\\n // Need to re-calculate scores if positive leaf has been\\n // created\\n if (next.isPositiveLeaf()) {\\n for (TreeNode n : toSplit) {\\n n.removeDeactivatedInstances(instanceBags);\\n n.calculateNodeScore(instanceBags, m_unbiasedEstimate,\\n m_kBEPPConstant, m_useBagCount, m_bagInstanceMultiplier);\\n }\\n\\n if (stopOnFirstPositiveLeaf) {\\n return;\\n }\\n }\\n }\\n }\\n\\n // Increment number of leaves if necessary\\n if (next.isLeafNode()) {\\n numLeaves++;\\n }\\n\\n // Re-evaluate the best next node, because we've most likely\\n // added new nodes or disabled bags\\n Comparator<TreeNode> sh = Collections\\n .reverseOrder(new NextSplitHeuristic());\\n Collections.sort(toSplit, sh);\\n }\\n\\n if (m_Debug) {\\n System.out.println(root.render(1, instanceBags));\\n }\\n }\",\n \"public Node newAlphaBeta(Node node, boolean isMaximizing, Node[][] gameBoard,int playerID,int depth,boolean searchOnce) throws InterruptedException {\\n\\t\\tif(depth==0) //node equals terminal node origin ***************************\\n\\t\\t{\\n\\n\\t\\t\\t\\n\\t\\t\\treturn node; //return heuristic value accumulated Score\\n\\t\\t}\\n\\t\\t\\n\\t\\tif(isMaximizing == true)//max\\n\\t\\t{\\n\\t\\t\\t\\n\\t\\t\\tNode[][] copyOne = new Node[gameBoard.length][gameBoard.length];\\n\\t\\t\\tint enescore=0;\\n\\t\\t\\tint nodesRx = 0;\\n\\t\\t\\tint nodesRy = 0;\\n\\t\\t\\tNode temNode = node;\\n\\t\\t\\t//opponent score\\n\\t\\t\\tif(node!=null)\\n\\t\\t\\t{\\tenescore = node.enemy;\\n\\t\\t\\tnodesRx = node.maxrecordSearchedX;\\n\\t\\t\\tnodesRy = node.maxrecordSearchedY;}\\n\\t\\t\\t\\n\\t\\t for (int i = 0; i < gameBoard.length; i++) {\\n\\t\\t \\tfor(int j =0;j<gameBoard.length;j++)\\n\\t\\t \\t{\\t\\n\\t\\t \\t\\tNode temp = new Node(gameBoard[i][j].getScore(),gameBoard[i][j].getX(),gameBoard[i][j].getY(),gameBoard[i][j].getOwnership());\\n\\t\\t \\t\\tcopyOne[i][j]=temp;\\n\\t\\t \\t}\\n\\t\\t }\\n\\t\\t \\n\\t\\t \\n\\t\\t\\tPriorityQueue<Node> playerOneChildrenList = new PriorityQueue<Node>(Collections.reverseOrder()); //use priorityQueue,acsending or disacsending.\\n\\t\\t\\tQueue<Node> waitList = new LinkedList<Node>();\\n\\t\\t\\tboolean walkable = false;\\n\\t\\t\\t\\n\\t\\t\\t\\tfor(int i = 0;i<gameBoard.length;i++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tfor(int j =0;j<gameBoard.length;j++)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tif(copyOne[i][j].getOwnership()==0)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\twaitList.add(new Node(copyOne[i][j].getScore(),i,j,playerID));//everyPosition through the 2D array\\n\\t\\t\\t\\t\\t\\twalkable = true;\\n\\t\\t\\t\\t//\\t\\tcounter++;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\n\\t\\t\\tif(walkable == false)\\n\\t\\t\\t{\\n\\t\\t\\t\\treturn node;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tint waitSize = waitList.size();\\n\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t\\tfor(int l = 0;l<waitSize;l++)\\n\\t\\t\\t{\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tNode[][] newCopy = new Node[gameBoard.length][gameBoard.length];\\n\\t\\t\\t\\tNode temT = temNode;\\n\\t\\t\\t for (int i = 0; i < gameBoard.length; i++) {\\n\\t\\t\\t \\tfor(int j =0;j<gameBoard.length;j++)\\n\\t\\t\\t \\t{\\t\\n\\t\\t\\t \\t\\tNode temp = new Node(copyOne[i][j].getScore(),copyOne[i][j].getX(),copyOne[i][j].getY(),copyOne[i][j].getOwnership());\\n\\t\\t\\t \\t\\tnewCopy[i][j]=temp;\\n\\t\\t\\t \\t}\\n\\t\\t\\t }\\n\\t\\t\\t \\n\\t\\t\\t\\tNode takenNode =waitList.poll();\\n\\t\\t\\t\\tcounter++;\\n\\t\\t\\t\\ttakenNode.setAccumulated(newCopy[takenNode.getX()][takenNode.getY()].getScore());\\n\\t\\t\\t\\ttakenNode.enemy = 0;\\n\\t\\t\\t\\tnewCopy[takenNode.getX()][takenNode.getY()].setOwnership(playerID);\\n\\t\\t\\t\\tboolean connected = false;\\n\\t\\t\\t\\tfor(int i = 0;i<dx.length;i++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tint newX = takenNode.getX()+dx[i];\\n\\t\\t\\t\\t\\t\\tint newY = takenNode.getY()+dy[i];\\n\\t\\t\\t\\t\\t\\tif((newX>=0&&newX<gameBoard.length)&&(newY>=0&&newY<gameBoard.length))\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tif(newCopy[newX][newY].getOwnership()==playerID)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\n\\t\\t\\t\\t\\t\\t\\tconnected = true;\\n\\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\\tif(connected == true)\\n\\t\\t\\t\\t{\\n\\n\\t\\t\\t\\t\\tfor(int i = 0;i<dx.length;i++)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\n\\t\\t\\t\\t\\t\\t\\tint newX = takenNode.getX()+dx[i];\\n\\t\\t\\t\\t\\t\\t\\tint newY = takenNode.getY()+dy[i];\\n\\t\\t\\t\\t\\t\\t\\tif((newX>=0&&newX<gameBoard.length)&&(newY>=0&&newY<gameBoard.length))\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tif(newCopy[newX][newY].getOwnership()!=playerID&&newCopy[newX][newY].getOwnership()!=0)\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\tthis.eatOpponent(newCopy, playerID, newX, newY);\\n\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t\\ttakenNode.setAccumulated(takenNode.getAccumulated()+newCopy[newX][newY].getScore());\\n\\t\\t\\t\\t\\t\\t\\t\\tenescore-=newCopy[newX][newY].getScore();\\n\\t\\t\\t\\t\\t\\t\\t\\ttakenNode.enemy = enescore;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\n\\t\\t\\t\\tif(depth==1)\\n\\t\\t\\t\\t{\\n\\t\\n\\t\\t\\t\\t\\ttakenNode.setAccumulated(node.getAccumulated()+takenNode.getAccumulated());\\n\\n\\t\\t\\t\\t}\\n\\t\\n\\n\\t\\t\\t\\tint opponentID = 0;\\n\\t\\t\\t\\tif(playerID == 1)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\topponentID = 2;\\n\\t\\t\\t\\t}else if(playerID == 2)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\topponentID = 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(playerOneChildrenList.isEmpty()==false)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t//\\tSystem.out.println(\\\"asdas\\\");\\n\\t\\t\\t//\\t\\tSystem.out.println(\\\"A depth: \\\"+depth);\\n\\t\\t\\t\\t//\\tThread.sleep(300);\\n\\t\\t\\t\\t\\t\\tNode minValueNode = newAlphaBeta(takenNode,false,newCopy, opponentID, depth-1,true);\\n\\t\\t\\t\\t\\t\\tcounter++;\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\n\\n\\n\\t\\t\\t\\t\\t\\t\\tif(node!=null)\\n\\t\\t\\t\\t\\t\\t\\t{\\tminValueNode.parentNode = new Node(node.getAccumulated(),node.getX(),node.getY(),node.getOwnership());\\n\\t\\t\\t\\t\\t\\t\\tif(this.beta!=null)\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tif(minValueNode.getAccumulated()<this.alpha.getAccumulated())\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t//\\tSystem.out.println(\\\"break l should be \\\"+waitSize+\\\" now: \\\"+l);\\n\\t\\t\\t\\t\\t\\t\\t\\tplayerOneChildrenList.add(minValueNode);\\n\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t\\t\\t//node.noPoll = true;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\tplayerOneChildrenList.add(minValueNode);\\n\\t\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\n\\t\\t\\t\\t\\t//\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t//\\tSystem.out.println(\\\"B depth: \\\"+depth);\\n\\t\\t\\t\\t\\t//Thread.sleep(300);\\n\\t\\t\\t\\t\\trecordDepth = depth;\\n\\t\\t\\t\\t\\tNode minValueNode = newAlphaBeta(takenNode,false,newCopy, opponentID, depth-1,false);\\n\\t\\t\\t\\t\\t//this.alpha = minValueNode;\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tcounter++;\\n\\t\\t\\t\\t\\t//playeroneNode++;\\n\\t\\t\\t\\t\\tif(node!=null)\\n\\t\\t\\t\\t\\t{\\tminValueNode.parentNode = new Node(node.getAccumulated(),node.getX(),node.getY(),node.getOwnership());\\n\\t\\t\\t\\t\\tif(this.beta!=null)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif(minValueNode.getAccumulated()>this.beta.getAccumulated())\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t//\\tSystem.out.println(\\\"break l should be \\\"+waitSize+\\\" now: \\\"+l);\\n\\t\\t\\t\\t\\t\\tplayerOneChildrenList.add(minValueNode);\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t//node.noPoll = true;\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tplayerOneChildrenList.add(minValueNode);\\n\\t\\t\\n\\t\\t\\t\\t\\t\\tif(depth == recordDepth)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t//\\t\\t\\t\\tSystem.out.println(\\\"setting alpha\\\");\\n\\t\\t\\t\\t\\t\\t\\t//Thread.sleep(300);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t\\tthis.alpha = minValueNode;\\n\\t\\t\\t//\\t\\t\\tSystem.out.println(\\\"alpha once: \\\"+this.alpha.getAccumulated());\\n\\t\\t\\t\\t\\t//\\tThread.sleep(5000);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(playerOneChildrenList.peek().parentNode!=null||node!=null)\\n\\t\\t\\t{\\n\\t\\t\\t//\\tSystem.out.println(\\\"returning: \\\"+playerOneChildrenList.peek().getAccumulated());\\n\\t\\t\\t//\\tSystem.out.println(500);\\n\\t\\t\\tplayerOneChildrenList.peek().parentNode.setAccumulated(playerOneChildrenList.peek().getAccumulated());\\n\\t\\t\\tplayerOneChildrenList.peek().parentNode.noPoll = playerOneChildrenList.peek().noPoll;\\n\\n\\t\\t\\treturn playerOneChildrenList.poll().parentNode;\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\tplayerOneChildrenList.peek().nodeExpanded = counter;\\n\\t\\t\\t\\treturn playerOneChildrenList.poll();\\n\\t\\t\\t}\\n\\t\\t\\n\\t\\t}else\\n\\t\\tif(isMaximizing == false)//min\\n\\t\\t{\\n\\t\\t\\tNode[][] copyOne = new Node[gameBoard.length][gameBoard.length];\\n\\t\\t\\tint currentEnescore = node.enemy;\\n\\t\\t\\tint nodesRx = node.maxrecordSearchedX;\\n\\t\\t\\tint nodesRy = node.maxrecordSearchedY;\\n\\t\\t\\tNode temNode = node;\\n\\t\\t for (int i = 0; i < gameBoard.length; i++) {\\n\\t\\t \\tfor(int j =0;j<gameBoard.length;j++)\\n\\t\\t \\t{\\t\\n\\t\\t \\t\\tNode temp = new Node(gameBoard[i][j].getScore(),gameBoard[i][j].getX(),gameBoard[i][j].getY(),gameBoard[i][j].getOwnership());\\n\\t\\t \\t copyOne[i][j]=temp;\\n\\t\\t \\t}\\n\\t\\t }\\n\\t\\t\\tPriorityQueue<Node> playerTwoChildrenList = new PriorityQueue<Node>(); \\n\\t\\t\\tQueue<Node> waitList = new LinkedList<Node>();\\n\\t\\t\\tboolean walkable = false;\\n\\t\\n\\t\\t\\t\\tfor(int i = 0;i<gameBoard.length;i++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tfor(int j =0;j<gameBoard.length;j++)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tif(copyOne[i][j].getOwnership()==0)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\twaitList.add(new Node(copyOne[i][j].getScore(),i,j,playerID));//everyPosition through the 2D array\\n\\t\\t\\t\\t\\t\\twalkable = true;\\n\\t\\t\\t\\t//\\t\\tcounter++;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\n\\t\\t\\tif(walkable == false)\\n\\t\\t\\t{\\n\\t\\t\\t\\treturn node;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tint waitSize = waitList.size();\\n\\n\\t\\t\\tfor(int l = 0;l<waitSize;l++)\\n\\t\\t\\t{\\n\\n\\t\\t\\t\\tNode[][] newCopy = new Node[gameBoard.length][gameBoard.length];\\n\\t\\t\\t\\tNode temT = temNode;\\n\\t\\t\\t for (int i = 0; i < gameBoard.length; i++) {\\n\\t\\t\\t \\tfor(int j =0;j<gameBoard.length;j++)\\n\\t\\t\\t \\t{\\t\\n\\t\\t\\t \\t\\tNode temp = new Node(copyOne[i][j].getScore(),copyOne[i][j].getX(),copyOne[i][j].getY(),copyOne[i][j].getOwnership());\\n\\t\\t\\t \\t\\tnewCopy[i][j]=temp;\\n\\t\\t\\t \\t}\\n\\t\\t\\t }\\n\\n\\t\\t\\t\\tNode takenNode = waitList.poll();\\n\\t\\t\\t\\tcounter++;\\n\\t\\t\\t\\tnewCopy[takenNode.getX()][takenNode.getY()].setOwnership(playerID);\\n\\t\\t\\n\\t\\t\\t\\ttakenNode.setAccumulated(node.getAccumulated());\\n\\n\\t\\t\\t\\ttakenNode.enemy= currentEnescore+newCopy[takenNode.getX()][takenNode.getY()].getScore();\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tboolean connected = false;\\n\\t\\t\\t\\tfor(int i = 0;i<dx.length;i++)\\n\\t\\t\\t\\t{\\n\\t\\n\\t\\t\\t\\t\\t\\tint newX = takenNode.getX()+dx[i];\\n\\t\\t\\t\\t\\t\\tint newY = takenNode.getY()+dy[i];\\n\\t\\t\\t\\t\\t\\tif((newX>=0&&newX<gameBoard.length)&&(newY>=0&&newY<gameBoard.length))\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tif(newCopy[newX][newY].getOwnership()==playerID)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\tconnected = true;\\n\\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\\tif(connected == true)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\n\\t\\t\\t\\t\\tfor(int i = 0;i<dx.length;i++)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\n\\t\\t\\t\\t\\t\\t\\tint newX = takenNode.getX()+dx[i];\\n\\t\\t\\t\\t\\t\\t\\tint newY = takenNode.getY()+dy[i];\\n\\t\\t\\t\\t\\t\\t\\tif((newX>=0&&newX<gameBoard.length)&&(newY>=0&&newY<gameBoard.length))\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tif(newCopy[newX][newY].getOwnership()!=playerID&&newCopy[newX][newY].getOwnership()!=0)\\n\\t\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\t\\tthis.eatOpponent(newCopy, playerID, newX, newY);\\n\\t\\t\\t\\t\\t\\t\\t\\ttakenNode.setAccumulated(takenNode.getAccumulated()-newCopy[newX][newY].getScore());\\t\\n\\t\\t\\t\\t\\t\\t\\t\\ttakenNode.enemy+=newCopy[newX][newY].getScore();\\n\\t\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tint opponentID = 0;\\n\\t\\t\\t\\tif(playerID == 1)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\topponentID = 2;\\n\\t\\t\\t\\t}else if(playerID == 2)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\topponentID = 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(playerTwoChildrenList.isEmpty()==false)\\n\\t\\t\\t\\t{\\n\\t\\t\\t//\\t\\tSystem.out.println(\\\" C depth: \\\"+depth);\\n\\t\\t\\t\\t//\\tThread.sleep(300);\\n\\t\\t\\t\\t\\t\\tNode maxValueNode = newAlphaBeta(takenNode,true,newCopy, opponentID, depth-1,true);\\n\\t\\t\\t\\t\\t\\tcounter++;\\n\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t//playeroneNode++;\\n\\t\\t\\t\\t\\t\\tmaxValueNode.parentNode = new Node(node.getAccumulated(),node.getX(),node.getY(),node.getOwnership());\\n\\t\\t\\t\\t\\t\\tif(this.alpha!=null)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t//\\t\\tSystem.out.println(maxValueNode.getAccumulated()+\\\" \\\"+this.alpha.getAccumulated());\\n\\t\\t\\t\\t\\t//\\tThread.sleep(5000);\\n\\t\\t\\t\\t\\t\\tif(maxValueNode.getAccumulated()<this.alpha.getAccumulated())\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t//\\t\\tSystem.out.println(\\\"break l should be \\\"+waitSize+\\\" now: \\\"+l);\\n\\t\\t\\t\\t\\t\\t\\tplayerTwoChildrenList.add(maxValueNode);\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t\\t//node.noPoll = true;\\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\\t\\tplayerTwoChildrenList.add(maxValueNode);\\n\\t\\t\\t\\t\\t//\\tif(maxValueNode.noPoll == true)\\n\\t\\t\\t\\t\\t//\\t{\\n\\t\\t\\t\\t\\t//\\t\\tSystem.out.println(\\\"the discard value: \\\"+maxValueNode.getAccumulated()+\\\" compareTo: \\\"+this.alpha.getAccumulated());\\n\\t\\t\\t\\t\\t//\\t\\tbreak;\\n\\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\\t\\t\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t//\\tSystem.out.println(\\\" D depth: \\\"+depth);\\n\\t\\t\\t\\t//\\tThread.sleep(300);\\n\\t\\t\\t\\t\\tNode maxValueNode = newAlphaBeta(takenNode,true,newCopy, opponentID, depth-1,false);\\n\\t\\t\\t\\t\\tcounter++;\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tmaxValueNode.parentNode = new Node(node.getAccumulated(),node.getX(),node.getY(),node.getOwnership());\\n\\t\\t\\t\\t\\tif(this.alpha!=null)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif(maxValueNode.getAccumulated()<this.alpha.getAccumulated())\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t//\\tSystem.out.println(\\\"break l should be \\\"+waitSize+\\\" now: \\\"+l);\\n\\t\\t\\t\\t\\t\\tplayerTwoChildrenList.add(maxValueNode);\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t//node.noPoll = true;\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif(depth == recordDepth-1)\\n\\t\\t\\t\\t\\t{\\n\\t\\t//\\t\\t\\t\\tSystem.out.println(\\\"setting alpha\\\");\\n\\t\\t\\t\\t\\t\\t//Thread.sleep(300);\\n\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\tthis.beta = maxValueNode;\\n\\t\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"beta: \\\"+this.beta.getAccumulated());\\n\\t\\t\\t\\t\\t\\t\\t//Thread.sleep(5000);\\n\\t\\t//\\t\\t\\tSystem.out.println(\\\"alpha once: \\\"+this.alpha.getAccumulated());\\n\\t\\t\\t\\t//\\tThread.sleep(5000);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tplayerTwoChildrenList.add(maxValueNode);\\n\\t\\t\\t\\t//\\tif(maxValueNode.noPoll == true)\\n\\t\\t\\t\\t//\\t{\\n\\t\\t\\t\\t//\\t\\t\\n\\t\\t\\t\\t//\\t\\tbreak;\\n\\t\\t\\t\\t//\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\tplayerTwoChildrenList.peek().parentNode.setAccumulated(playerTwoChildrenList.peek().getAccumulated());\\n\\n\\t\\t\\treturn playerTwoChildrenList.poll().parentNode;\\n\\t\\t}\\n\\t\\treturn null;\\n\\t\\n\\t}\",\n \"private List<Double> MinimaxAlgorithm(MinimaxNode<GameState> node, int dataCount){\\n if(node.getNumberOfChildren() == 0){ //checks to see if terminal node\\n List<Double> heuristics = new ArrayList();\\n heuristics.addAll(calculateHeuristic(node.getState()));\\n return heuristics;\\n }\\n else{ //will maximise all the scores for each player.\\n double value = Double.NEGATIVE_INFINITY;\\n double checkValue;\\n int bestMove;\\n List<Double> heuristics = new ArrayList();\\n if(node.getIfChanceNode()){ //checks if current node is a chance node, if so, times \\n for (int i = 0; i < node.getChildren().size(); i++){\\n List<Double> tempHeuristics = new ArrayList();\\n tempHeuristics.addAll(MinimaxAlgorithm(node.getChildren().get(i),dataCount+1));\\n checkValue = node.getChildren().get(i).getProbability() * tempHeuristics.get(node.getNodeIndex());\\n value = Math.max(value, checkValue);//maximises the score.\\n if(checkValue == value){\\n heuristics.addAll(tempHeuristics); \\n }\\n if(dataCount == 0){//checks if this is the root node\\n if(checkValue == value){\\n MinimaxPlayer.optimalMoves = node.getChildren().get(i).getState().getOrientation(node.getNodeIndex()); \\n }\\n } \\n }\\n }\\n else{\\n for (int i = 0; i < node.getChildren().size(); i++){\\n List<Double> tempHeuristics = new ArrayList();\\n tempHeuristics.addAll(MinimaxAlgorithm(node.getChildren().get(i),dataCount+1));\\n checkValue = tempHeuristics.get(node.getNodeIndex());\\n value = Math.max(value, checkValue);//maximises the score.\\n if(checkValue == value){\\n heuristics.addAll(tempHeuristics); \\n }\\n if(dataCount == 0){//checks if this is the root node\\n if(checkValue == value){\\n MinimaxPlayer.optimalMoves = node.getChildren().get(i).getState().getOrientation(node.getNodeIndex()); \\n }\\n } \\n } \\n }\\n return heuristics;\\n } \\n }\",\n \"public static void main(String[] args) {\\n\\n BDNode a = new BDNode(\\\"A\\\");\\n BDNode b = new BDNode(\\\"B\\\");\\n BDNode c = new BDNode(\\\"C\\\");\\n BDNode d = new BDNode(\\\"D\\\");\\n BDNode e = new BDNode(\\\"E\\\");\\n\\n a.link(b);\\n a.link(d);\\n b.link(a);\\n b.link(c);\\n b.link(e);\\n c.link(b);\\n c.link(d);\\n d.link(a);\\n d.link(c);\\n d.link(e);\\n e.link(b);\\n e.link(d);\\n\\n BDNode target = e;\\n\\n/*\\n // BFS\\n Queue<BDNode> queue = new LinkedList<>();\\n queue.offer(a);\\n\\n while(!queue.isEmpty()) {\\n BDNode n = queue.poll();\\n n.visit();\\n System.out.println(n); // 찾는 여정 출력\\n\\n if(n.equals(target)) {\\n System.out.println(\\\"BFS Found! \\\" + n);\\n break;\\n }\\n\\n for (BDNode l : n.links) {\\n if(l.isVisited()) continue;\\n if (queue.contains(l)) continue;\\n queue.offer(l);\\n }\\n\\n // 위랑 같은 표현\\n// n.links.stream()\\n// .filter(l -> !queue.contains(l))\\n// .forEach(queue::offer);\\n }\\n*/\\n\\n // DFS\\n Stack<BDNode> stack = new Stack<>();\\n stack.push(a);\\n\\n while(!stack.isEmpty()) {\\n BDNode n = stack.pop();\\n n.visit();\\n System.out.println(n); // 찾는 여정 출력\\n\\n if (n.equals(target)) {\\n System.out.println(\\\"DFS Found! \\\" + n);\\n break;\\n }\\n\\n for (BDNode l : n.links) {\\n if (l.isVisited()) continue;\\n if (stack.contains(l)) continue;\\n\\n stack.push(l);\\n }\\n }\\n\\n\\n }\",\n \"private void depthFirstSearch(Slot start, ArrayList<Pair<Slot, Slot>> moves, HashMap<Slot, Slot> parents) {\\n boolean[][] visitedSlots = new boolean[Board.MAX_ROW][Board.MAX_COLUMN];\\n\\n setSlotsAsNotVisited(visitedSlots);\\n\\n Stack<Slot> dfsStack = new Stack<>();\\n int color = start.getColor();\\n\\n dfsStack.push(start);\\n Slot previous = start;\\n\\n boardObject.setSlotColor(boardObject.getSlot(start.getRow(), start.getColumn()), Slot.EMPTY);\\n\\n while (!dfsStack.empty()) {\\n Pair<Slot, Slot> next;\\n Slot current = dfsStack.pop();\\n\\n if (!visitedSlots[current.getRow()][current.getColumn()] && !current.equals(previous)) {\\n if (!current.equals(start)) {\\n visitedSlots[current.getRow()][current.getColumn()] = true;\\n }\\n\\n next = new Pair<>(start, current);\\n\\n moves.add(next);\\n }\\n\\n Slot up = getUp(current);\\n Slot down = getDown(current);\\n Slot left = getLeft(current);\\n Slot right = getRight(current);\\n\\n if (left != null && !visitedSlots[left.getRow()][left.getColumn()]) {\\n if (!isChild(current, left, parents)) {\\n dfsStack.push(left);\\n parents.put(left, current);\\n }\\n }\\n\\n if (down != null && !visitedSlots[down.getRow()][down.getColumn()]) {\\n if (!isChild(current, down, parents)) {\\n dfsStack.push(down);\\n parents.put(down, current);\\n }\\n }\\n\\n if (right != null && !visitedSlots[right.getRow()][right.getColumn()]) {\\n if (!isChild(current, right, parents)) {\\n dfsStack.push(right);\\n parents.put(right, current);\\n }\\n }\\n\\n if (up != null && !visitedSlots[up.getRow()][up.getColumn()]) {\\n if (!isChild(current, up, parents)) {\\n dfsStack.push(up);\\n parents.put(up, current);\\n }\\n }\\n\\n previous = current;\\n }\\n\\n boardObject.setSlotColor(boardObject.getSlot(start.getRow(), start.getColumn()), color);\\n }\",\n \"private ArrayList<String> makeChildren(Node current) {\\n\\n ArrayList<String> current_children = new ArrayList<>();\\n\\n if (current != null && current.getDigit().last_changed != 0) {\\n //-1 child first digit\\n if ((Integer.parseInt(current.getDigit().getFirst_digit()) - 1 >= 0)) {\\n String child_node = current.getDigit().decreaseFirstDigit();\\n current_children.add(child_node);\\n }\\n\\n //+1 child first digit\\n if ((Integer.parseInt(current.getDigit().getFirst_digit()) + 1 <= 9)) {\\n String child_node = current.getDigit().increaseFirstDigit();\\n current_children.add(child_node);\\n }\\n }\\n\\n if (current != null && current.getDigit().last_changed != 1) {\\n //-1 child\\n if ((Integer.parseInt(current.getDigit().getSecond_digit()) - 1 >= 0)) {\\n String child_node = current.getDigit().decreaseSecondDigit();\\n current_children.add(child_node);\\n }\\n\\n //+1 child\\n if ((Integer.parseInt(current.getDigit().getSecond_digit()) + 1 <= 9)) {\\n String child_node = current.getDigit().increaseSecondDigit();\\n current_children.add(child_node);\\n }\\n }\\n\\n if (current != null && current.getDigit().last_changed != 2) {\\n //-1 child\\n if ((Integer.parseInt(current.getDigit().getThird_digit()) - 1 >= 0)) {\\n String child_node = current.getDigit().decreaseThirdDigit();\\n current_children.add(child_node);\\n }\\n //+1 child\\n if ((Integer.parseInt(current.getDigit().getThird_digit()) + 1 <= 9)) {\\n String child_node = current.getDigit().increaseThirdDigit();\\n current_children.add(child_node);\\n }\\n }\\n return current_children;\\n }\",\n \"private void expandTree(TreeNode tn,Set<Condition> conds)\\n{\\n List<RuleInstance> rules = tn.getRules();\\n double tot = rules.size();\\n if (tot <= 1) return;\\n if (conds == null || conds.isEmpty()) return;\\n\\n Condition best = null;\\n List<RuleInstance> bestp = null;\\n List<RuleInstance> bestf = null;\\n double bestv = 0;\\n\\n for (Condition c : conds) {\\n List<RuleInstance> pr = new ArrayList<RuleInstance>();\\n List<RuleInstance> fr = new ArrayList<RuleInstance>();\\n for (RuleInstance ri : rules) {\\n\\t if (c.match(ri)) pr.add(ri);\\n\\t else fr.add(ri);\\n }\\n if (pr.size() == 0 || fr.size() == 0) continue;\\n double vp = pr.size() / tot;\\n double vf = fr.size() / tot;\\n double e = - vp * Math.log(vp) - vf * Math.log(vf);\\n if (e > bestv) {\\n\\t best = c;\\n\\t bestp = pr;\\n\\t bestf = fr;\\n }\\n }\\n\\n if (best == null) return;\\n\\n tn.setCondition(best,bestp,bestf);\\n expandTree(tn.getPassTree(),conds);\\n expandTree(tn.getFailTree(),conds);\\n}\",\n \"static boolean bfs(TreeNode root) {\\n Queue<TreeNode> queue = new LinkedList<TreeNode>();\\n queue.add(root);\\n while (!queue.isEmpty()) {\\n TreeNode node = (TreeNode) queue.remove();\\n if (node == null)\\n continue;\\n System.out.println(\\\"Checking node \\\" + node.data);\\n if (isGoal(node)) {\\n System.out.println(\\\"\\\\nFound goal node \\\" + node.data);\\n return true;\\n }\\n queue.addAll(node.getChildren());\\n // dump(queue);\\n }\\n return false;\\n }\",\n \"private void bfs() {\\n\\t\\tQueue<Node> q = new ArrayDeque<>();\\n\\t\\tq.add(treeNodes.get(0));\\n\\t\\twhile (!q.isEmpty()) {\\n\\t\\t\\tint size = q.size();\\n\\t\\t\\tfor (int i = 0; i < size; i++) {\\n\\t\\t\\t\\tNode curr = q.poll();\\n\\t\\t\\t\\ttime += curr.informTime;\\n\\t\\t\\t\\tSet<Node> nextNodes = curr.nextNodes;\\n\\t\\t\\t\\tif (nextNodes == null || curr.id == treeNodes.get(0).id)\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\tfor (Node node : nextNodes) {\\n\\t\\t\\t\\t\\tq.add(node);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t}\",\n \"public List<T> wantedNodesIterative(Predicate<T> p) {\\n //PART 4 \\n if(root == null){\\n return null;\\n }\\n LinkedList<TreeNode<T>> stack = new LinkedList<>();\\n stack.add(root);\\n \\n List<T> wantedNodes =new LinkedList<>();\\n TreeNode<T> current;\\n \\n while(!stack.isEmpty()){\\n current = stack.pop();\\n if(p.check(current.data)){\\n wantedNodes.add(current.data);\\n }\\n if(current.right != null){\\n stack.addFirst(current.right);\\n }\\n if(current.left != null){\\n stack.addFirst(current.left);\\n }\\n }\\n return wantedNodes;\\n }\",\n \"private static void greedyTime(Person curPerson, Map<String, Person> persons) throws FileNotFoundException {\\n\\t\\tclass DisComparator implements Comparator<Person> {\\n\\t\\t\\tpublic int compare(Person a, Person b) {\\n\\t\\t\\t\\treturn a.getEstDistTime() - b.getEstDistTime();\\n\\t\\t\\t} \\n\\t\\t}\\n\\t\\t\\n\\t\\tPriorityQueue<Person> pqueue = new PriorityQueue<Person>(persons.size(), new DisComparator());\\t\\t\\n\\t\\tpqueue.add(curPerson);\\n\\t\\t\\n\\t\\touterloop:\\n\\t\\twhile(!pqueue.isEmpty()) {\\n\\t\\t\\tcurPerson = pqueue.poll();\\n\\t\\t\\t\\n\\t\\t\\tArrayList<Person> children = curPerson.getConnected();\\n\\t\\t\\tPerson child;\\n\\t\\t\\tfor(int i = 0; i < children.size(); i++) {\\n\\t\\t\\t\\tchild = children.get(i);\\n\\t\\t\\t\\tif(!child.getMarked()) {\\n\\t\\t\\t\\t\\tchild.setRoute(curPerson);\\n\\t\\t\\t\\t\\tchild.setMarked();\\n\\t\\t\\t\\t\\tif(child.getName().equals(\\\"Noah\\\")) {\\t//check when generated\\n\\t\\t\\t\\t\\t\\tcurPerson = child;\\n\\t\\t\\t\\t\\t\\tbreak outerloop;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tpqueue.add(child);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\n\\t\\toutputResult(curPerson, \\\"Greedy.time.result.txt\\\");\\n\\t}\",\n \"static int downToZero(Node root) {\\n /*\\n * Write your code here.\\n */\\n Queue<Node> queue = new PriorityQueue<>();\\n queue.add(root);\\n int min = 100001;\\n while (!queue.isEmpty()){\\n Node current = queue.poll();\\n if(current.value <= 4){\\n if (current.value == 4){\\n min = current.depth + 3;\\n return min;\\n }\\n min = current.depth+current.value;\\n return min;\\n }\\n Node toAdd1 = new Node(current.value-1, current.depth+1);\\n queue.add(toAdd1);\\n for(int i = 2; i<=Math.sqrt(current.value); i++){\\n if(current.value%i==0){\\n Node toAdd = new Node(current.value/i, current.depth+1);\\n queue.add(toAdd);\\n }\\n }\\n }\\n return min;\\n }\",\n \"private int optimize() {\\n\\t\\t// items: Items sorted by value-to-weight ratio for linear relaxation\\n\\t\\t// t: the decision vector being tested at each node\\n\\t\\t// ws, vs, is, bs: stacks of weight, value, item id, whether bring item\\n\\t\\t// p: stack pointer; i, b, weight, value: loop caches; best: max search\\n\\t\\t// ss: stack size: Always <=2 children on stack for <=n-1 parents\\n\\t\\tItem[] items = new Item[n];\\n\\t\\tint ss = 2 * n;\\n\\t\\tint[] itemsSorted = new int[n], t = new int[n], ws = new int[ss],\\n\\t\\t\\tvs = new int[ss], is = new int[ss], bs = new int[ss];\\n\\t\\tint i, b, weight, value, best = 0, p = 0;\\n\\n\\t\\tfor (int j = 0; j < n; j++)\\n\\t\\t\\titems[j] = new Item(j);\\n\\t\\tArrays.sort(items);\\n\\t\\tfor (int j = 0; j < n; j++)\\n\\t\\t\\titemsSorted[j] = items[j].i();\\n\\t\\titems = null; // For garbage collection.\\n\\n\\t\\t// Push item 0 onto the stack with and without bringing it.\\n\\t\\tws[p] = 0; vs[p] = 0; is[p] = 0; bs[p] = 1; p++;\\n\\t\\tws[p] = 0; vs[p] = 0; is[p] = 0; bs[p] = 0; p++;\\n\\n\\t\\twhile (p > 0) {\\n\\t\\t\\tp--; // Pop the latest item off the stack\\n\\t\\t\\ti = is[p]; b = bs[p];\\n\\t\\t\\tweight = ws[p] + w[i] * b;\\n\\t\\t\\tif (weight > k)\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\tvalue = vs[p] + v[i] * b;\\n\\t\\t\\tif (bound(i, weight, value, itemsSorted) < best)\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\tbest = Math.max(value, best);\\n\\t\\t\\tt[i] = b;\\n\\t\\t\\tif (i < n - 1) { // Push children onto stack w/ & w/o bringing item\\n\\t\\t\\t\\tws[p] = weight; vs[p] = value; is[p] = i + 1; bs[p] = 1; p++;\\n\\t\\t\\t\\tws[p] = weight; vs[p] = value; is[p] = i + 1; bs[p] = 0; p++;\\n\\t\\t\\t}\\n\\t\\t\\telse if (value >= best)\\n\\t\\t\\t\\tSystem.arraycopy(t, 0, x, 0, n);\\n\\t\\t}\\n\\t\\treturn best;\\n\\t}\",\n \"private void sink(int i) {\\n if (2*i > N)\\n return;\\n int maxChild = 2*i;\\n if (maxChild < N && compare(maxChild, maxChild+1) < 0)\\n maxChild++;\\n if (compare(maxChild, i) > 0) {\\n swap(maxChild, i);\\n sink(maxChild);\\n }\\n }\",\n \"private static void dfsBribe(int n, List<Integer>[] ch, long[] w) {\\n if (ch[n].size() == 0){\\n In[n] = w[n];\\n OutD[n] = Long.MAX_VALUE;\\n OutU[n] = 0;\\n }\\n //recurrance case: non.leaf, do dfs for all subordinates then calculate In, OutUp & OutDown.\\n else{\\n for (int c:ch[n])\\n dfsBribe(c, ch, w); //running once for each child thereby O(N)\\n In[n] = w[n];\\n for (int c:ch[n]){ //O(N) running time\\n In[n] += OutU[c];\\n OutU[n] += Math.min(In[c], OutD[c]);\\n OutD[n] += Math.min(In[c], OutD[c]);\\n }\\n OutD[n] += delta(n, ch); //add delta for no in Children\\n }\\n\\n }\",\n \"private Node selectAndExpandNewNode() {\\n // Start at the root\\n Node node = root;\\n\\n // Iterate down the tree until reaching a goal state\\n while (node.getState().getPos() < problemSpec.getN()) {\\n // Get the best action from the current node using UCT\\n Action action = selectBestAction(node);\\n\\n // Simulate a single action\\n FromStateSimulator FSS = new FromStateSimulator(problemSpec);\\n FSS.setStartState(node.getState(), stepsDone + node.getStepsFromRoot());\\n FSS.step(action);\\n State newState = FSS.getCurrentState();\\n\\n // Get the node representing the outcome of the transition\\n Node child = node.childWithStateAction(newState, action);\\n\\n // If this outcome node has not been added to the tree, add it\\n if (child == null) {\\n Node newNode = new Node(newState, FSS.getSteps());\\n newNode.setParentNodeAndAction(node, action);\\n node.addChildNode(newNode);\\n\\n // Return this new node\\n return newNode;\\n }\\n\\n // Now repeat the process using this child node\\n node = child;\\n }\\n\\n return node;\\n }\",\n \"public AttackTreeNode buildNextChild(AttackTreeNode activeChild) {\\n \\n AttackTreeNode nextNode = null;\\n \\n // AttackParameter has no children...\\n \\n return nextNode;\\n }\",\n \"public NCRPNode select() {\\n\\t\\t\\t\\n\\t\\t\\t//dim number of children + 1 (unallocated mass) \\n\\t\\t\\tdouble[] weights = new double[children.size() + 1];\\n\\t \\n\\t\\t\\t//weight of unallocated probability mass\\n\\t\\t\\tweights[0] = gamma / (gamma + customers);\\n\\t\\t\\t\\n\\t\\t\\t//calc weight for each child based on the number of customers on them\\n\\t\\t\\tint i = 1;\\n\\t\\t\\tfor (NCRPNode child: children) {\\n\\t\\t\\t\\tweights[i] = (double) child.customers / (gamma + customers);\\n\\t\\t\\t\\ti++;\\n\\t\\t\\t}\\n\\n\\t\\t\\t//sample a child with higher weight\\n\\t\\t\\tint choice = random.nextDiscrete(weights);\\n\\t\\t\\t//if unallocated mass is sampled, create a new child\\n\\t\\t\\tif (choice == 0) {\\n\\t\\t\\t\\treturn(addChild());\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\treturn children.get(choice - 1);\\n\\t\\t\\t}\\n\\t\\t}\",\n \"@Override\\n\\tpublic void solve() {\\n\\t\\tlong startTime = System.nanoTime();\\n\\n\\t\\twhile(!unvisitedPM.isEmpty()){\\n\\t\\t\\tProblemModel current = findCheapestNode();\\n\\t\\n\\t\\t\\tfor(ProblemModel pm : current.getSubNodes()){\\n\\t\\t\\n\\t\\t\\t\\tif(!visited.contains(pm) && !unvisitedPM.contains(pm)){\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tunvisitedPM.add(pm);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tif(current.getSideStart().isEmpty()){\\n\\t\\t\\t\\tSystem.out.print( \\\"\\\\n\\\"+ \\\"StartSide Runners: \\\");\\n\\t\\t\\t\\tfor(Integer r: current.getSideStart()){\\n\\t\\t\\t\\t\\tSystem.out.print( \\\" \\\" +r) ;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tSystem.out.print( \\\"\\\\n\\\" + \\\"EndSide Runners: \\\");\\n\\t\\t\\t\\tfor(Integer r: current.getSideEnd()){\\n\\t\\t\\t\\t\\tSystem.out.print( \\\" \\\" + r);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tprintPathTaken(current);\\n\\t\\t\\t\\tSystem.out.print( \\\"\\\\n\\\" + \\\"------------done--------------\\\");\\n\\t\\t\\t\\tlong endTime = System.nanoTime();\\n\\t\\t\\t\\tlong duration = ((endTime - startTime)/1000000);\\n\\t\\t\\t\\tSystem.out.print( \\\"\\\\n\\\" + \\\"-AS1 Time taken: \\\" + duration + \\\"ms\\\");\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tvisited.add(current);\\n\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\n\\t}\",\n \"public static LinkedList<LinkedList<String>> getNextLevel(Graph G, LinkedList<LinkedList<String>> Parents, boolean sharon) {\\r\\n\\t\\tLinkedList<LinkedList<String>> Children = new LinkedList<LinkedList<String>>();\\r\\n\\t\\tLinkedList<String> Pi, Pj, u;\\r\\n\\t\\tfor (int i=0; i<Parents.size(); i++) {\\r\\n\\t\\t\\tPi = Parents.get(i);\\r\\n\\t\\t\\tfor (int j=i+1; j<Parents.size(); j++) {\\r\\n\\t\\t\\t\\tPj = Parents.get(j);\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tboolean generateChild = true;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif (Pj.size()>1) {\\r\\n\\t\\t\\t\\t\\tfor (int k = 0; k<Pj.size()-1; k++) {\\r\\n\\t\\t\\t\\t\\t\\tif (Pi.get(k)!=Pj.get(k)) {\\r\\n\\t\\t\\t\\t\\t\\t\\tgenerateChild = false;\\r\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif (generateChild && sharon && G.hasEdge(Pi.get(Pi.size()-1), Pj.get(Pj.size()-1))) {\\r\\n\\t\\t\\t\\t\\tgenerateChild = false;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif (generateChild) {\\r\\n\\t\\t\\t\\t\\tu = new LinkedList<String>();\\r\\n\\t\\t\\t\\t\\tfor (int n=0; n<Pi.size(); n++) {\\r\\n\\t\\t\\t\\t\\t\\tu.add(Pi.get(n));\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\tu.add(Pj.get(Pj.size()-1));\\r\\n\\t\\t\\t\\t\\t//System.err.println(\\\"added \\\" + u);\\r\\n\\t\\t\\t\\t\\tChildren.add(u);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\treturn Children;\\r\\n\\t}\",\n \"static boolean dfs(TreeNode root) {\\n Stack<TreeNode> stack = new Stack<TreeNode>();\\n stack.push(root);\\n while (!stack.isEmpty()) {\\n TreeNode node = (TreeNode) stack.pop();\\n if (node == null)\\n continue;\\n\\n System.out.println(\\\"Checking node \\\" + node.data);\\n if (isGoal(node)) {\\n System.out.println(\\\"\\\\nFound goal node \\\" + node.data);\\n return true;\\n }\\n stack.addAll(node.getChildren());\\n // dump(stack);\\n }\\n return false;\\n }\",\n \"private void expandNode() {\\r\\n\\t\\t\\t// Dijkstra's algorithm to handle separately\\r\\n\\t\\t\\tif (dijkstra.isSelected()) {\\r\\n\\t\\t\\t\\tCell u;\\r\\n\\t\\t\\t\\t// 11: while Q is not empty:\\r\\n\\t\\t\\t\\tif (graph.isEmpty()) {\\r\\n\\t\\t\\t\\t\\treturn;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t// 12: u := vertex in Q (graph) with smallest distance in dist[]\\r\\n\\t\\t\\t\\t// ;\\r\\n\\t\\t\\t\\t// 13: remove u from Q (graph);\\r\\n\\t\\t\\t\\tu = graph.remove(0);\\r\\n\\t\\t\\t\\t// Add vertex u in closed set\\r\\n\\t\\t\\t\\tclosedSet.add(u);\\r\\n\\t\\t\\t\\t// If target has been found ...\\r\\n\\t\\t\\t\\tif (u.row == targetPos.row && u.col == targetPos.col) {\\r\\n\\t\\t\\t\\t\\tfound = true;\\r\\n\\t\\t\\t\\t\\treturn;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t// Counts nodes that have expanded.\\r\\n\\t\\t\\t\\texpanded++;\\r\\n\\t\\t\\t\\t// Update the color of the cell\\r\\n\\t\\t\\t\\tgrid[u.row][u.col] = CLOSED;\\r\\n\\t\\t\\t\\t// 14: if dist[u] = infinity:\\r\\n\\t\\t\\t\\tif (u.dist == INFINITY) {\\r\\n\\t\\t\\t\\t\\t// ... then there is no solution.\\r\\n\\t\\t\\t\\t\\t// 15: break;\\r\\n\\t\\t\\t\\t\\treturn;\\r\\n\\t\\t\\t\\t\\t// 16: end if\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t// Create the neighbors of u\\r\\n\\t\\t\\t\\tArrayList<Cell> neighbors = createSuccesors(u, false);\\r\\n\\t\\t\\t\\t// 18: for each neighbor v of u:\\r\\n\\t\\t\\t\\tfor (Cell v : neighbors) {\\r\\n\\t\\t\\t\\t\\t// 20: alt := dist[u] + dist_between(u, v) ;\\r\\n\\t\\t\\t\\t\\tint alt = u.dist + distBetween(u, v);\\r\\n\\t\\t\\t\\t\\t// 21: if alt < dist[v]:\\r\\n\\t\\t\\t\\t\\tif (alt < v.dist) {\\r\\n\\t\\t\\t\\t\\t\\t// 22: dist[v] := alt ;\\r\\n\\t\\t\\t\\t\\t\\tv.dist = alt;\\r\\n\\t\\t\\t\\t\\t\\t// 23: previous[v] := u ;\\r\\n\\t\\t\\t\\t\\t\\tv.prev = u;\\r\\n\\t\\t\\t\\t\\t\\t// Update the color of the cell\\r\\n\\t\\t\\t\\t\\t\\tgrid[v.row][v.col] = FRONTIER;\\r\\n\\t\\t\\t\\t\\t\\t// 24: decrease-key v in Q;\\r\\n\\t\\t\\t\\t\\t\\t// (sort list of nodes with respect to dist)\\r\\n\\t\\t\\t\\t\\t\\tCollections.sort(graph, new CellComparatorByDist());\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t// The handling of the other four algorithms\\r\\n\\t\\t\\t} else {\\r\\n\\t\\t\\t\\tCell current;\\r\\n\\t\\t\\t\\tif (dfs.isSelected() || bfs.isSelected()) {\\r\\n\\t\\t\\t\\t\\t// Here is the 3rd step of the algorithms DFS and BFS\\r\\n\\t\\t\\t\\t\\t// 3. Remove the first state, Si, from OPEN SET ...\\r\\n\\t\\t\\t\\t\\tcurrent = openSet.remove(0);\\r\\n\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\t// Here is the 3rd step of the algorithms A* and Greedy\\r\\n\\t\\t\\t\\t\\t// 3. Remove the first state, Si, from OPEN SET,\\r\\n\\t\\t\\t\\t\\t// for which f(Si) ≤ f(Sj) for all other\\r\\n\\t\\t\\t\\t\\t// open states Sj ...\\r\\n\\t\\t\\t\\t\\t// (sort first OPEN SET list with respect to 'f')\\r\\n\\t\\t\\t\\t\\tCollections.sort(openSet, new CellComparatorByF());\\r\\n\\t\\t\\t\\t\\tcurrent = openSet.remove(0);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t// ... and add it to CLOSED SET.\\r\\n\\t\\t\\t\\tclosedSet.add(0, current);\\r\\n\\t\\t\\t\\t// Update the color of the cell\\r\\n\\t\\t\\t\\tgrid[current.row][current.col] = CLOSED;\\r\\n\\t\\t\\t\\t// If the selected node is the target ...\\r\\n\\t\\t\\t\\tif (current.row == targetPos.row && current.col == targetPos.col) {\\r\\n\\t\\t\\t\\t\\t// ... then terminate etc\\r\\n\\t\\t\\t\\t\\tCell last = targetPos;\\r\\n\\t\\t\\t\\t\\tlast.prev = current.prev;\\r\\n\\t\\t\\t\\t\\tclosedSet.add(last);\\r\\n\\t\\t\\t\\t\\tfound = true;\\r\\n\\t\\t\\t\\t\\treturn;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t// Count nodes that have been expanded.\\r\\n\\t\\t\\t\\texpanded++;\\r\\n\\t\\t\\t\\t// Here is the 4rd step of the algorithms\\r\\n\\t\\t\\t\\t// 4. Create the successors of Si, based on actions\\r\\n\\t\\t\\t\\t// that can be implemented on Si.\\r\\n\\t\\t\\t\\t// Each successor has a pointer to the Si, as its predecessor.\\r\\n\\t\\t\\t\\t// In the case of DFS and BFS algorithms, successors should not\\r\\n\\t\\t\\t\\t// belong neither to the OPEN SET nor the CLOSED SET.\\r\\n\\t\\t\\t\\tArrayList<Cell> succesors;\\r\\n\\t\\t\\t\\tsuccesors = createSuccesors(current, false);\\r\\n\\t\\t\\t\\t// Here is the 5th step of the algorithms\\r\\n\\t\\t\\t\\t// 5. For each successor of Si, ...\\r\\n\\t\\t\\t\\tfor (Cell cell : succesors) {\\r\\n\\t\\t\\t\\t\\t// ... if we are running DFS ...\\r\\n\\t\\t\\t\\t\\tif (dfs.isSelected()) {\\r\\n\\t\\t\\t\\t\\t\\t// ... add the successor at the beginning of the list\\r\\n\\t\\t\\t\\t\\t\\t// OPEN SET\\r\\n\\t\\t\\t\\t\\t\\topenSet.add(0, cell);\\r\\n\\t\\t\\t\\t\\t\\t// Update the color of the cell\\r\\n\\t\\t\\t\\t\\t\\tgrid[cell.row][cell.col] = FRONTIER;\\r\\n\\t\\t\\t\\t\\t\\t// ... if we are runnig BFS ...\\r\\n\\t\\t\\t\\t\\t} else if (bfs.isSelected()) {\\r\\n\\t\\t\\t\\t\\t\\t// ... add the successor at the end of the list OPEN SET\\r\\n\\t\\t\\t\\t\\t\\topenSet.add(cell);\\r\\n\\t\\t\\t\\t\\t\\t// Update the color of the cell\\r\\n\\t\\t\\t\\t\\t\\tgrid[cell.row][cell.col] = FRONTIER;\\r\\n\\t\\t\\t\\t\\t\\t// ... if we are running A* or Greedy algorithms (step 5\\r\\n\\t\\t\\t\\t\\t\\t// of A* algorithm) ...\\r\\n\\t\\t\\t\\t\\t} else if (aStar.isSelected() || guloso.isSelected()) {\\r\\n\\t\\t\\t\\t\\t\\t// ... calculate the value f(Sj) ...\\r\\n\\t\\t\\t\\t\\t\\tint dxg = current.col - cell.col;\\r\\n\\t\\t\\t\\t\\t\\tint dyg = current.row - cell.row;\\r\\n\\t\\t\\t\\t\\t\\tint dxh = targetPos.col - cell.col;\\r\\n\\t\\t\\t\\t\\t\\tint dyh = targetPos.row - cell.row;\\r\\n\\t\\t\\t\\t\\t\\tif (diagonal.isSelected()) {\\r\\n\\t\\t\\t\\t\\t\\t\\t// with diagonal movements\\r\\n\\t\\t\\t\\t\\t\\t\\t// calculate 1000 times the Euclidean distance\\r\\n\\t\\t\\t\\t\\t\\t\\tif (guloso.isSelected()) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t// especially for the Greedy ...\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tcell.g = 0;\\r\\n\\t\\t\\t\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tcell.g = current.g + (int) ((double) 1000 * Math.sqrt(dxg * dxg + dyg * dyg));\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\tcell.h = (int) ((double) 1000 * Math.sqrt(dxh * dxh + dyh * dyh));\\r\\n\\t\\t\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\t\\t\\t// without diagonal movements\\r\\n\\t\\t\\t\\t\\t\\t\\t// calculate Manhattan distances\\r\\n\\t\\t\\t\\t\\t\\t\\tif (guloso.isSelected()) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t// especially for the Greedy ...\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tcell.g = 0;\\r\\n\\t\\t\\t\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tcell.g = current.g + Math.abs(dxg) + Math.abs(dyg);\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\tcell.h = Math.abs(dxh) + Math.abs(dyh);\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\tcell.f = cell.g + cell.h;\\r\\n\\t\\t\\t\\t\\t\\t// ... If Sj is neither in the OPEN SET nor in the\\r\\n\\t\\t\\t\\t\\t\\t// CLOSED SET states ...\\r\\n\\t\\t\\t\\t\\t\\tint openIndex = isInList(openSet, cell);\\r\\n\\t\\t\\t\\t\\t\\tint closedIndex = isInList(closedSet, cell);\\r\\n\\t\\t\\t\\t\\t\\tif (openIndex == -1 && closedIndex == -1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t// ... then add Sj in the OPEN SET ...\\r\\n\\t\\t\\t\\t\\t\\t\\t// ... evaluated as f(Sj)\\r\\n\\t\\t\\t\\t\\t\\t\\topenSet.add(cell);\\r\\n\\t\\t\\t\\t\\t\\t\\t// Update the color of the cell\\r\\n\\t\\t\\t\\t\\t\\t\\tgrid[cell.row][cell.col] = FRONTIER;\\r\\n\\t\\t\\t\\t\\t\\t\\t// Else ...\\r\\n\\t\\t\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\t\\t\\t// ... if already belongs to the OPEN SET, then ...\\r\\n\\t\\t\\t\\t\\t\\t\\tif (openIndex > -1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t// ... compare the new value assessment with the\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t// old one.\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t// If old <= new ...\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tif (openSet.get(openIndex).f <= cell.f) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// ... then eject the new node with state\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// Sj.\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// (ie do nothing for this node).\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// Else, ...\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// ... remove the element (Sj, old) from the\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// list\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// to which it belongs ...\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\topenSet.remove(openIndex);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// ... and add the item (Sj, new) to the\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// OPEN SET.\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\topenSet.add(cell);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// Update the color of the cell\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tgrid[cell.row][cell.col] = FRONTIER;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t// ... if already belongs to the CLOSED SET,\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t// then ...\\r\\n\\t\\t\\t\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t// ... compare the new value assessment with the\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t// old one.\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t// If old <= new ...\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tif (closedSet.get(closedIndex).f <= cell.f) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// ... then eject the new node with state\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// Sj.\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// (ie do nothing for this node).\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// Else, ...\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// ... remove the element (Sj, old) from the\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// list\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// to which it belongs ...\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tclosedSet.remove(closedIndex);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// ... and add the item (Sj, new) to the\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// OPEN SET.\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\topenSet.add(cell);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// Update the color of the cell\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tgrid[cell.row][cell.col] = FRONTIER;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\",\n \"public void selectParents1() {\\n // Create a new parent list for this reproductive cycle. Let the garbage\\n // handler dispose of the old list, if there was one.\\n switch (Defines.parentAlgo) {\\n case Defines.PA_RANDOM:\\n this.parents = this.selectParentsRandom();\\n break;\\n\\n case Defines.PA_ROULETTE:\\n this.parents = this.selectParentsRoulette();\\n break;\\n\\n case Defines.PA_TOURNAMENT:\\n this.parents = this.selectParentsTournament();\\n break;\\n }\\n// this.howGoodAreParents();\\n }\",\n \"public void growthCycle() {\\n\\t\\tboolean doMore = true;\\n\\t\\tdo {\\n\\t\\t\\tdoMore = false;\\n\\t\\t\\tgrower = planter;\\n\\t\\t\\tCollections.shuffle(grower, random);\\n\\t\\t\\tplanter = new ArrayList<Room>();\\n\\t\\t\\tfor(Room room : grower) {\\n\\t\\t\\t\\tif(rooms.size() >= size.maxRooms) {\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(room.plantChildren(this)) {\\n\\t\\t\\t\\t\\t//System.out.println(\\\"Added side room.\\\");\\n\\t\\t\\t\\t\\tdoMore = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t} \\n\\t\\t} while(doMore);\\t\\t\\n\\t\\t//DoomlikeDungeons.profiler.endTask(\\\"Adding Rooms (growthCycle)\\\");\\n\\t}\",\n \"public void selectParents() {\\n // Create a new parent list for this reproductive cycle. Let the garbage\\n // handler dispose of the old list, if there was one.\\n switch (Defines.parentAlgo) {\\n case Defines.PA_RANDOM:\\n this.parents = this.selectParentsRandom();\\n break;\\n\\n case Defines.PA_ROULETTE:\\n this.parents = this.selectParentsRoulette();\\n break;\\n\\n case Defines.PA_TOURNAMENT:\\n this.parents = this.selectParentsTournament();\\n break;\\n }\\n// this.howGoodAreParents();\\n }\",\n \"protected void siftDown() {\\r\\n\\t\\tint parent = 0, child = (parent << 1) + 1;// preguntar porque 0 y no 1\\r\\n\\t\\t\\r\\n\\t\\twhile (child < theHeap.size()) {\\r\\n\\t\\t\\tif (child < theHeap.size() - 1\\r\\n\\t\\t\\t\\t\\t&& compare(theHeap.get(child), theHeap.get(child + 1)) > 0)\\r\\n\\t\\t\\t\\tchild++; // child is the right child (child = (2 * parent) + 2)\\r\\n\\t\\t\\tif (compare(theHeap.get(child), theHeap.get(parent)) >= 0)\\r\\n\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\tswap(parent, child);\\r\\n\\t\\t\\tparent = child;\\r\\n\\t\\t\\tchild = (parent << 1) + 1; // => child = (2 * parent) + 1\\r\\n\\t\\t}\\r\\n\\t}\",\n \"ArrayList<Cell> getChildren(Integer[][] level){\\n int[][] values={{0,1},{0,-1},{1,0},{-1,0}};\\n ArrayList<Cell> children = new ArrayList<>();\\n for (int i = 0; i < values.length; i++){\\n if (isLegalMove(this.getI()+values[i][0], this.getJ()+values[i][1],level)){\\n children.add(new Cell(this.getI()+values[i][0], this.getJ()+values[i][1]));\\n }\\n }\\n //the code below achieves the same goal; still here for clarity\\n\\n// if (isLegalMove(this.getI(), this.getJ()+1, level)) {\\n// children.add(new Cell(this.getI(), this.getJ()+1));\\n// }\\n// if (isLegalMove(this.getI(), this.getJ()-1, level)) {\\n// children.add(new Cell(this.getI(), this.getJ()-1));\\n// }\\n// if (isLegalMove(this.getI()+1, this.getJ(), level)) {\\n// children.add(new Cell(this.getI()+1, this.getJ()));\\n// }\\n// if (isLegalMove(this.getI()-1, this.getJ(), level)) {\\n// children.add(new Cell(this.getI()-1, this.getJ()));\\n// }\\n return children;\\n }\",\n \"public static void breedAll() {\\n int a, b; //Pointers to select parents\\n\\n //While loop to ensure full carrying capacity of population\\n while (Population.size() <= maxPop) {\\n //Sorts by Fitness level first\\n sortByFitlvl();\\n\\n //Selects Two Random Parents\\n a = (int) (Math.abs(Utilities.sharpGauss(4)) * Population.size());\\n b = (int) (Math.abs(Utilities.sharpGauss(4)) * Population.size());\\n //System.out.println(a+\\\"\\\\t\\\"+b+\\\"\\\\t\\\"+Population.size());\\n\\n // Between 1-2 children\\n int children = rand.nextInt(2)+1;\\n for (int i = 0; i < children; i++) {\\n Population.add(Breeder.breed(Population.get(a), Population.get(b), 0.1));\\n }\\n\\n //sortByFitlvl();\\n }\\n\\n if (debug)\\n printPopulation(true);\\n }\",\n \"private Board DLS(Board start, Board goal, int depth) {\\n Board found = null;\\n // Paso base: Si start es la solucion y esta en el ultimo nivel, regresa\\n if((depth == 0) && start.equals(goal)) {\\n return start;\\n }\\n // Si el nivel aun no es el ultimo, se obtienen los nodos hijos\\n // y se vuelve a llamar la funcion en ellos\\n else if(depth > 0) {\\n // Obtiene los nodos hijos\\n // Todas las posibles configuraciones del tablero que se pueden\\n // hacer a partir de la actual\\n ArrayList<Board> children = start.expand();\\n\\n expandedNodes++;\\n\\n // Para cada hijo vuelve a hacer lo mismo\\n for(Board child : children) {\\n found = DLS(child, goal, depth - 1);\\n if(found != null)\\n return found;\\n }\\n }\\n return null;\\n }\",\n \"private void doRecurse(String destNodeType, List<List<EdgeType>> keepPaths,\\r\\n\\t\\t\\t List<List<EdgeType>> testPaths, int maxLength)\\r\\n {\\r\\n\\tfor (final List<EdgeType> path : testPaths)\\r\\n\\t{\\r\\n\\t // If the last element in this path has a matching\\r\\n\\t // destNodeType, then we found a suitable path. Add it to\\r\\n\\t // the \\\"keep\\\" list.\\r\\n\\t if (path.get(path.size()-1).getDestType().equals(destNodeType))\\r\\n\\t\\tkeepPaths.add(path);\\r\\n\\t else if (maxLength > 0)\\r\\n\\t\\t// We don't have a match. If we haven't reached our\\r\\n\\t\\t// maximum length, recurse one level and keep looking.\\r\\n\\t\\tdoRecurse(destNodeType, keepPaths,\\r\\n\\t\\t\\t buildLongerPaths(path), maxLength-1);\\r\\n\\t}\\r\\n }\",\n \"private static void findOptimalTree(int i, int j, int[][] nodeMatrix) {\\n\\t\\tif(i!=j){\\n\\t\\t\\tint root = nodeMatrix[i][j];\\n\\t\\t\\tSystem.out.println(\\\" root for \\\"+i+\\\" to \\\"+j+\\\" elements would be \\\"+root);\\n\\t\\t\\tfindOptimalTree(i, root-1, nodeMatrix);\\n\\t\\t\\tfindOptimalTree(root+1, j, nodeMatrix);\\n\\t\\t}\\n\\t}\",\n \"public void bfs(Pair<Integer, Integer> current, Pair<Integer, Integer> goal) {\\n var visited = new HashSet<Pair<Integer, Integer>>(300);\\n var queue = new LinkedList<Pair<Integer, Integer>>();\\n \\n visited.add(current);\\n queue.add(current);\\n \\n while (!queue.isEmpty()) {\\n var toVisit = queue.poll();\\n if (goal.equals(toVisit)) {\\n goal.setParent(toVisit);\\n toVisit.setChild(goal);\\n break;\\n }\\n var neighbors = Utils.getNeighbors(toVisit);\\n neighbors.forEach(p -> {\\n // only move through SAFE tiles!\\n // unless the neighbor is goal node!\\n if (p.equals(goal) ||\\n (!visited.contains(p) &&\\n grid[p.getA()][p.getB()].getTileTypes().contains(Tile.SAFE)))\\n {\\n visited.add(p);\\n p.setParent(toVisit);\\n toVisit.setChild(p);\\n queue.add(p);\\n }\\n });\\n }\\n }\",\n \"public boolean reducible() {\\n if (dfsTree.back.isEmpty()) {\\n return true;\\n }\\n int size = controlFlow.transitions.length;\\n boolean[] loopEnters = dfsTree.loopEnters;\\n TIntHashSet[] cycleIncomings = new TIntHashSet[size];\\n // really this may be array, since dfs already ensures no duplicates\\n TIntArrayList[] nonCycleIncomings = new TIntArrayList[size];\\n int[] collapsedTo = new int[size];\\n int[] queue = new int[size];\\n int top;\\n for (int i = 0; i < size; i++) {\\n if (loopEnters[i]) {\\n cycleIncomings[i] = new TIntHashSet();\\n }\\n nonCycleIncomings[i] = new TIntArrayList();\\n collapsedTo[i] = i;\\n }\\n\\n // from whom back connections\\n for (Edge edge : dfsTree.back) {\\n cycleIncomings[edge.to].add(edge.from);\\n }\\n // from whom ordinary connections\\n for (Edge edge : dfsTree.nonBack) {\\n nonCycleIncomings[edge.to].add(edge.from);\\n }\\n\\n for (int w = size - 1; w >= 0 ; w--) {\\n top = 0;\\n // NB - it is modified later!\\n TIntHashSet p = cycleIncomings[w];\\n if (p == null) {\\n continue;\\n }\\n TIntIterator iter = p.iterator();\\n while (iter.hasNext()) {\\n queue[top++] = iter.next();\\n }\\n\\n while (top > 0) {\\n int x = queue[--top];\\n TIntArrayList incoming = nonCycleIncomings[x];\\n for (int i = 0; i < incoming.size(); i++) {\\n int y1 = collapsedTo[incoming.getQuick(i)];\\n if (!dfsTree.isDescendant(y1, w)) {\\n return false;\\n }\\n if (y1 != w && p.add(y1)) {\\n queue[top++] = y1;\\n }\\n }\\n }\\n\\n iter = p.iterator();\\n while (iter.hasNext()) {\\n collapsedTo[iter.next()] = w;\\n }\\n }\\n\\n return true;\\n }\",\n \"public static void main(String[] args) {\\n\\t\\tArrayList<Robot> robots = new ArrayList<>();\\n\\t\\tArrayList<Node> nodes = new ArrayList<>();\\n\\t\\t//This allows for different home and feeder locations\\n\\t\\tNode redFeeder = new Node(0, 10, 4, true);\\n\\t\\tNode yelFeeder = new Node(0, 5, 10, false);\\n\\t\\tNode home = new Node(0, 0, 0, true);\\n\\n\\t\\t//Insert the nodes listed from the homework\\n\\t\\tnodes.add(new Node(1, 2, 2, true));\\n\\t\\tnodes.add(new Node(2, 1, 5, false));\\n\\t\\tnodes.add(new Node(3, 3, 7, true));\\n\\t\\tnodes.add(new Node(4, 5, 9, false));\\n\\t\\tnodes.add(new Node(5, 7, 3, true));\\n\\t\\tnodes.add(new Node(6, 8, 1, true));\\n\\t\\tnodes.add(new Node(7, 8, 5, true));\\n\\t\\tnodes.add(new Node(8, 4, 6, false));\\n\\t\\tnodes.add(new Node(9, 6, 8, false));\\n\\t\\tnodes.add(new Node(10, 9, 7, false));\\n\\n\\t\\t//Set counter for while loop later\\n\\t\\tint counter = 1;\\n\\n\\t\\t//Create initial 10 parents\\n\\t\\tfor (int i = 0; i < 10; i++) {\\n\\t\\t\\trobots.add(new Robot());\\n\\n\\t\\t\\t//Set the home and feeders\\n\\t\\t\\trobots.get(i).setHome(home.getX(), home.getY());\\n\\t\\t\\trobots.get(i).setRedFeeder(redFeeder.getX(), redFeeder.getY());\\n\\t\\t\\trobots.get(i).setYellowFeeder(yelFeeder.getX(), yelFeeder.getY());\\n\\n\\t\\t\\t//Create a temp node list to shuffle\\n\\t\\t\\tArrayList<Node> tempNodes = nodes;\\n\\t\\t\\tCollections.shuffle(tempNodes);\\n\\n\\t\\t\\t//Iterate through and add the nodes based on the value not the reference (caused lots of issues before\\n\\t\\t\\t//I figured that out\\n\\t\\t\\tfor (int j = 0; j < 10; j++)\\n\\t\\t\\t\\trobots.get(i).in(new Node(tempNodes.get(j).getE(), tempNodes.get(j).getX(),\\n\\t\\t\\t\\t\\t\\ttempNodes.get(j).getY(), tempNodes.get(j).isRed()));\\n\\t\\t}\\n\\n\\t\\t//Go for 300k iterations, can be changed on a whim\\n\\t\\twhile (counter <= 300000) {\\n\\n\\t\\t\\t//Output every 10k iterations, can be changed\\n\\t\\t\\tif (counter % 10000 == 0) {\\n\\t\\t\\t\\tSystem.out.println(\\\"Loop \\\" + (counter));\\n\\t\\t\\t\\tfor (Robot r : robots) {\\n\\t\\t\\t\\t\\tr.printNodes();\\n\\t\\t\\t\\t\\tSystem.out.println(\\\" - \\\" + r.calcTotalDist());\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tSystem.out.println();\\n\\t\\t\\t}\\n\\n\\t\\t\\tint size = robots.size();\\n\\t\\t\\t//Create children based on two parents and add them to the robots list\\n\\t\\t\\tfor (int i = 0; i < size; i += 2) {\\n\\t\\t\\t\\tint x = ThreadLocalRandom.current().nextInt(1, 8);\\n\\t\\t\\t\\tRobot temp = robots.get(i).getFirstHalf(x);\\n\\t\\t\\t\\ttemp.addSecondHalf(robots.get(i + 1), x);\\n\\n\\t\\t\\t\\ttemp.setHome(home.getX(), home.getY());\\n\\t\\t\\t\\ttemp.setRedFeeder(redFeeder.getX(), redFeeder.getY());\\n\\t\\t\\t\\ttemp.setYellowFeeder(yelFeeder.getX(), yelFeeder.getY());\\n\\n\\t\\t\\t\\trobots.add(temp);\\n\\t\\t\\t}\\n\\n\\t\\t\\t//Sort the list of robots based on the Comparator that uses the totalDistance\\n\\t\\t\\tCollections.sort(robots);\\n\\n\\t\\t\\t//Remove the last 5 (largest) items from the list\\n\\t\\t\\tfor (int i = robots.size() - 1; i > 9; i--) {\\n\\t\\t\\t\\trobots.remove(i);\\n\\t\\t\\t}\\n\\n\\t\\t\\t//Shuffle the list again to hope for totally random stuff\\n\\t\\t\\tCollections.shuffle(robots);\\n\\t\\t\\tcounter++;\\n\\t\\t}\\n\\n\\t\\t//Irrelevant but useful in testing\\n\\t\\treturn;\\n\\t}\",\n \"private void percolateDown(int index) {\\n int childLevel = NUM_CHILDREN * index + 1;\\r\\n if (childLevel < length) {\\r\\n int smallestChild = childLevel;\\r\\n for (int n = 0; n < NUM_CHILDREN; n++) {\\r\\n int childIndex = childLevel + n;\\r\\n if (childIndex < length && heap[smallestChild].compareTo(heap[childIndex]) > 0) {\\r\\n smallestChild = childIndex;\\r\\n }\\r\\n }\\r\\n // now we have the smallest child, swap it with root and recurse4, 5\\r\\n if (heap[smallestChild].compareTo(heap[index]) < 0) {\\r\\n swap(smallestChild, index);\\r\\n percolateDown(smallestChild);\\r\\n }\\r\\n }\\r\\n }\",\n \"private PersistentLinkedList<T> pop() {\\n //the latest element won't become empty\\n int index = this.treeSize - 1;\\n Node<T> newRoot = new Node<>(branchingFactor);\\n\\n Node<T> currentNode = this.root;\\n Node<T> currentNewNode = newRoot;\\n\\n ArrayList<Node<T>> newNodes = new ArrayList<>();\\n newNodes.add(newRoot);\\n ArrayList<Integer> newNodesIndices = new ArrayList<>();\\n\\n for (int b = base; b > 1; b = b / branchingFactor) {\\n TraverseData traverseData = traverseOneLevel(\\n new TraverseData(currentNode, currentNewNode, newRoot, index, b));\\n currentNode = traverseData.currentNode;\\n currentNewNode = traverseData.currentNewNode;\\n newNodes.add(currentNewNode);\\n newNodesIndices.add(index / b);\\n index = traverseData.index;\\n }\\n newNodesIndices.add(index);\\n\\n for (int i = 0; i < branchingFactor && i < index; i++) {\\n currentNewNode.set(i, currentNode.get(i));\\n }\\n currentNewNode.set(index, null);\\n\\n if (index == 0) {\\n int latestIndex = newNodes.size() - 2;\\n newNodes.get(latestIndex).set(newNodesIndices.get(latestIndex), null);\\n\\n for (int i = latestIndex; i > 0; i--) {\\n if (newNodesIndices.get(i) == 0) {\\n newNodes.get(i - 1).set(newNodesIndices.get(i - 1), null);\\n } else {\\n break;\\n }\\n }\\n }\\n\\n if (newNodes.size() > 1) {\\n int nonNullChildren = 0;\\n for (Node<T> child : newRoot.children) {\\n if (child != null) {\\n nonNullChildren++;\\n }\\n }\\n if (nonNullChildren == 1) { //need new root\\n newRoot = newRoot.get(0);\\n return new PersistentLinkedList<>(newRoot, this.branchingFactor, this.depth - 1,\\n this.base / branchingFactor, this.treeSize - 1, unusedTreeIndices,\\n indexCorrespondingToTheFirstElement, indexCorrespondingToTheLatestElement);\\n }\\n }\\n return new PersistentLinkedList<>(newRoot, this.branchingFactor, this.depth, this.base,\\n this.treeSize - 1, unusedTreeIndices, indexCorrespondingToTheFirstElement,\\n indexCorrespondingToTheLatestElement);\\n }\",\n \"private int alphaBetaMinimax (GameTreeNode node, int alpha, int beta, boolean isMax, Map<GameTreeNode, Integer> visited) {\\n\\n if(node.remaining == 0) {\\n //System.out.println(\\\"Terminal State: Up : Score \\\" + node.score);\\n return node.score;\\n }\\n if(visited.containsKey(node)) {\\n //System.out.println(\\\"Memoized State: Up : Score \\\" + visited.get(node));\\n return visited.get(node);\\n }\\n \\n \\n if(isMax) {\\n int minimaxScore = Integer.MIN_VALUE;\\n for(int i = 0; i < MAX_REMOVAL; i++) {\\n \\n GameTreeNode expandingChild = node.generateChild(1 + i);\\n \\n if(expandingChild == null) {\\n break;\\n }\\n \\n //System.out.println(\\\"Remaining \\\" + node.remaining + \\\" Down\\\");\\n //\\n minimaxScore = Math.max(minimaxScore, alphaBetaMinimax(expandingChild, alpha, beta, false, visited));\\n alpha = Math.max(alpha, minimaxScore);\\n //\\n //System.out.println(\\\"Remaining \\\" + node.remaining + \\\" Up : Score: \\\" + minimaxScore);\\n //\\n if(beta <= alpha) {\\n //System.out.println(\\\"Pruning: \\\" + node.remaining + \\\" child index \\\" + i+1);\\n break;\\n }\\n }\\n visited.put(node, minimaxScore);\\n node.score = minimaxScore;\\n return minimaxScore;\\n }\\n else {\\n int minimaxScore = Integer.MAX_VALUE;\\n for(int i = 0; i < MAX_REMOVAL; i++) {\\n \\n GameTreeNode expandingChild = node.generateChild(1 + i);\\n if(expandingChild == null) {\\n break;\\n }\\n //\\n \\n //\\n //System.out.println(\\\"Remaining \\\" + node.remaining + \\\" Down\\\");\\n //\\n minimaxScore = Math.min(minimaxScore, alphaBetaMinimax(expandingChild, alpha, beta, true, visited));\\n beta = Math.min(beta, minimaxScore);\\n //\\n //System.out.println(\\\"Remaining \\\" + node.remaining + \\\" Up : Score: \\\" + minimaxScore);\\n //\\n if(beta <= alpha) {\\n //System.out.println(\\\"Pruning: \\\" + node.remaining + \\\" child index \\\" + i+1);\\n break;\\n }\\n }\\n visited.put(node, minimaxScore);\\n node.score = minimaxScore;\\n return minimaxScore;\\n }\\n }\",\n \"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\\tStringTokenizer st = new StringTokenizer(br.readLine());\\n\\t\\tN = Integer.parseInt(st.nextToken());\\n\\t\\t\\n\\t\\tint size = 1;\\n\\t\\twhile(max_node > size) {\\n\\t\\t\\tsize *= 2;\\n\\t\\t\\tmax_level++;\\n\\t\\t}\\n\\t\\t\\n\\t\\tfor(int i=0; i<= N; i++)\\n\\t\\t{\\n\\t\\t\\tadj.add(new ArrayList<>());\\n\\t\\t}\\n\\t\\t\\n\\t\\tint dx=0, dy=0, dz = 0;\\n\\t\\tfor(int i=1; i<= N-1; i++)\\n\\t\\t{\\n\\t\\t\\tst = new StringTokenizer(br.readLine());\\n\\t\\t\\tdx = Integer.parseInt(st.nextToken());\\n\\t\\t\\tdy = Integer.parseInt(st.nextToken());\\n\\t\\t\\tadj.get(dx).add(dy);\\n\\t\\t\\tadj.get(dy).add(dx);\\n\\t\\t}\\n\\t\\t\\n\\t\\tdepth[0] = -1;\\n\\t\\tdfs(1,0);\\n\\t\\t\\n\\t\\tst = new StringTokenizer(br.readLine());\\n\\t\\tM = Integer.parseInt(st.nextToken());\\n\\t\\tfor(int i=1; i<= M; i++)\\n\\t\\t{\\n\\t\\t\\tst = new StringTokenizer(br.readLine());\\n\\t\\t\\tdx = Integer.parseInt(st.nextToken());\\n\\t\\t\\tdy = Integer.parseInt(st.nextToken());\\n\\t\\t\\tdz = Integer.parseInt(st.nextToken());\\n\\t\\t\\tcurDepth = -1; result = -1;\\n\\t\\t\\t\\n\\t\\t\\tquery(dx, dy);\\n\\t\\t\\tquery(dx, dz);\\n\\t\\t\\tquery(dy, dz);\\n\\t\\t\\t\\n\\t\\t\\tbw.write(result+\\\"\\\\n\\\");\\n\\t\\t}\\n\\t\\tbw.flush();\\n\\t}\",\n \"GameTreeNode (int remaining, int action, boolean isMax) {\\n this.remaining = remaining; //Stones Left\\n this.action = action; //Actions Taken\\n this.isMax = isMax; \\n children = new ArrayList<>(); //Children\\n score = -1; //Utility Score\\n \\n if(this.remaining == 0 && isMax) {\\n score = 0;\\n }\\n else {\\n score = 1;\\n }\\n }\",\n \"public ArrayList<PentagoGame> nextPossibleMoves() {\\n ArrayList<PentagoGame> children = new ArrayList<>();\\n for(int i = 0; i < 6; i++) { // for each row I can place a piece\\n for(int j = 0; j < 6; j++) { // for each column\\n for(int k = 0; k < 4; k++ ) { // for each board to rotate\\n for(int d = 0; d < 2; d ++) {// for each direction to rotate\\n boolean leftRotate = false;\\n if(d == 0) {\\n leftRotate = true;\\n }\\n Move move = new Move(i, j, k, leftRotate);\\n if(validMove(whosTurn(), move)) {\\n PentagoGame tempGame = new PentagoGame(this);\\n tempGame.playPiece(whosTurn(), move);\\n tempGame.rotateBoard(whosTurn(), move);\\n tempGame.turnOver();\\n move.setGameState(tempGame);\\n move.setUtility(calulateUtility(move));\\n // todo\\n children.add(tempGame);\\n }\\n }\\n }\\n }\\n }\\n\\n return children;\\n }\",\n \"node GrowthTreeGen(int maxdepth){\\n\\t\\tint i;\\n\\t\\tbyte a;\\n\\t\\tnode t, p;\\n\\t\\tif(maxdepth == 0) // to the limit then choose a terminal\\n\\t\\t{\\n\\t\\t\\ti = IRandom(0, gltcard - 1);\\n\\t\\t\\tt = new node(glterminal[i].name, VOIDVALUE);\\n\\t\\t\\treturn t;\\n\\t\\t} \\n\\t\\telse // choosing from function and terminal\\n\\t\\t {\\n\\t\\t\\ti = IRandom(0, gltermcard - 1);\\n\\t\\t\\tt = new node(glterm[i].name, VOIDVALUE);\\n\\t\\t\\tif(glterm[i].arity > 0) // if it is function\\n\\t\\t\\t{\\n\\t\\t\\t\\tt.children = GrowthTreeGen(maxdepth - 1);\\n\\t\\t\\t\\tp = t.children;\\n\\t\\t\\t\\tfor(a = 1; a < glterm[i].arity; a++) {\\n\\t\\t\\t\\t\\tp.sibling = GrowthTreeGen(maxdepth - 1);\\n\\t\\t\\t\\t\\tp = p.sibling;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tp.sibling = null;\\n\\t\\t\\t}\\n\\t\\t\\treturn t;\\n\\t\\t}\\n\\t}\",\n \"public abstract int getMaxChildren();\",\n \"@Override\\n \\tpublic Solution solve() {\\n \\t\\tfor (int i = 0; i < n; i++) {\\n \\t\\t\\tnest[i] = generator.getSolution();\\n \\t\\t}\\n \\n \\t\\tfor (int t = 0; t < maxGeneration; t++) { // While (t<MaxGeneration) or\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// (stop criterion)\\n \\t\\t\\t// Get a cuckoo randomly (say, i) and replace its solution by\\n \\t\\t\\t// performing random operations;\\n \\t\\t\\tint i = r.nextInt(n);\\n \\t\\t\\tSolution randomNest = nest[i];\\n \\t\\t\\t//FIXME: randomNest = solutionModifier.modify(nest[i]);\\n \\n \\t\\t\\t// Evaluate its quality/fitness\\n \\t\\t\\tint fi = randomNest.f();\\n \\n \\t\\t\\t// Choose a nest among n (say, j) randomly;\\n \\t\\t\\tint j = r.nextInt(n);\\n \\t\\t\\tint fj = f[j];\\n \\n \\t\\t\\tif (fi > fj) {\\n \\t\\t\\t\\tnest[i] = randomNest;\\n \\t\\t\\t\\tf[i] = fi;\\n \\t\\t\\t}\\n \\n \\t\\t\\tsort();\\n \\t\\t\\t// A fraction (pa) of the worse nests are abandoned and new ones are built;\\n\\t\\t\\tfor(i = n-toAbandon; i<n; i++) {\\n \\t\\t\\t\\tnest[i] = generator.getSolution();\\n \\t\\t\\t}\\n \\t\\t\\t\\n \\t\\t\\t// Rank the solutions/nests and find the current best;\\n \\t\\t\\tsort();\\n \\t\\t}\\n \\n \\t\\treturn nest[0];\\n \\t}\",\n \"void buildHeap() {\\n\\tfor(int i=parent(size-1); i>=0; i--) {\\n\\t percolateDown(i);\\n\\t}\\n }\",\n \"public static Goal[] createEverythingGoals() {\\n\\t\\t// [ & ] <--- rootGoal1\\n\\t\\t// / / \\\\ \\\\\\n\\t\\t// P T E M\\n\\t\\t//\\n\\t\\tCompositeGoal rootGoal1 = new CompositeGoal(CompositeGoal.and);\\n\\t\\trootGoal1.addChild(new PuzzleGoal());\\n\\t\\trootGoal1.addChild(new TreasureGoal());\\n\\t\\trootGoal1.addChild(new EnemiesGoal());\\n\\t\\trootGoal1.addChild(new MazeGoal());\\n\\t\\t\\n\\t\\t\\n\\t\\tCompositeGoal subGoal1 = new CompositeGoal(CompositeGoal.and);\\n\\t\\tsubGoal1.addChild(new EnemiesGoal());\\n\\t\\tsubGoal1.addChild(new TreasureGoal());\\n\\t\\tsubGoal1.addChild(new MazeGoal());\\n\\t\\t\\n\\t\\tCompositeGoal subGoal2 = new CompositeGoal(CompositeGoal.and);\\n\\t\\tsubGoal2.addChild(new PuzzleGoal());\\n\\t\\tsubGoal2.addChild(new TreasureGoal());\\n\\t\\tsubGoal2.addChild(subGoal1);\\n\\t\\t\\n\\t\\t// [ | ] <--- rootGoal2\\n\\t\\t// / \\\\\\n\\t\\t// I [ & ] <---- subGoal2\\n\\t\\t// / | \\\\\\n\\t\\t// P T [ & ] <---- subGoal1\\n\\t\\t// /|\\\\\\n\\t\\t// E T M\\n\\t\\tCompositeGoal rootGoal2 = new CompositeGoal(CompositeGoal.or);\\n\\t\\trootGoal2.addChild(new ImpossibleGoal());\\n\\t\\trootGoal2.addChild(subGoal2);\\n\\n\\t\\t\\n\\t\\tString goalString = \\\"\\\"\\n\\t\\t\\t+ \\\" { \\\\\\\"goal\\\\\\\": \\\\\\\"AND\\\\\\\", \\\\\\\"subgoals\\\\\\\":\\\\n\\\"\\n\\t\\t\\t+ \\\" [ { \\\\\\\"goal\\\\\\\": \\\\\\\"exit\\\\\\\" },\\\\n\\\"\\n\\t\\t\\t+ \\\" { \\\\\\\"goal\\\\\\\": \\\\\\\"AND\\\\\\\", \\\\\\\"subgoals\\\\\\\":\\\\n\\\"\\n\\t\\t\\t+ \\\" [ {\\\\\\\"goal\\\\\\\": \\\\\\\"treasure\\\\\\\" },\\\\n\\\"\\n\\t\\t\\t+ \\\" { \\\\\\\"goal\\\\\\\": \\\\\\\"AND\\\\\\\", \\\\\\\"subgoals\\\\\\\":\\\\n\\\"\\n\\t\\t\\t+ \\\" [ {\\\\\\\"goal\\\\\\\": \\\\\\\"enemies\\\\\\\" },\\\\n\\\"\\n\\t\\t\\t+ \\\" {\\\\\\\"goal\\\\\\\": \\\\\\\"boulders\\\\\\\" }\\\\n\\\"\\n\\t\\t\\t+ \\\" ]\\\\n\\\"\\n\\t\\t\\t+ \\\" }\\\\n\\\"\\n\\t\\t\\t+ \\\" ]\\\\n\\\"\\n\\t\\t\\t+ \\\" }\\\\n\\\"\\n\\t\\t\\t+ \\\" ]\\\\n\\\"\\n\\t\\t\\t+ \\\" }\\\\n\\\";\\n\\t\\t\\n\\t\\tJSONObject json = new JSONObject(new JSONTokener(goalString));\\n\\t\\tGoal goal3 = Goal.createGoal(json);\\n\\t\\t\\n\\t\\treturn new Goal[]{ rootGoal1, rootGoal2, goal3 };\\n\\t}\",\n \"private static void greedyRisk(Person curPerson, Map<String, Person> persons) throws FileNotFoundException {\\n\\t\\tclass DisComparator implements Comparator<Person> {\\n\\t\\t\\tpublic int compare(Person a, Person b) {\\n\\t\\t\\t\\treturn a.getEstDistRisk() - b.getEstDistRisk();\\n\\t\\t\\t} \\n\\t\\t}\\n\\t\\t\\n\\t\\tPriorityQueue<Person> pqueue = new PriorityQueue<Person>(persons.size(), new DisComparator());\\t\\t\\n\\t\\tpqueue.add(curPerson);\\n\\t\\t\\n\\t\\touterloop:\\n\\t\\twhile(!pqueue.isEmpty()) {\\n\\t\\t\\tcurPerson = pqueue.poll();\\t\\n\\t\\t\\t\\n\\t\\t\\tArrayList<Person> children = curPerson.getConnected();\\n\\t\\t\\tPerson child;\\n\\t\\t\\tfor(int i = 0; i < children.size(); i++) {\\n\\t\\t\\t\\tchild = children.get(i);\\n\\t\\t\\t\\tif(!child.getMarked()) {\\n\\t\\t\\t\\t\\tchild.setRoute(curPerson);\\n\\t\\t\\t\\t\\tchild.setMarked();\\n\\t\\t\\t\\t\\tif(child.getName().equals(\\\"Noah\\\")) {\\t//check when generated\\n\\t\\t\\t\\t\\t\\tcurPerson = child;\\n\\t\\t\\t\\t\\t\\tbreak outerloop;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tpqueue.add(child);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\toutputResult(curPerson, \\\"Greedy.risk.result.txt\\\");\\n\\t}\",\n \"private void phaseOne(){\\r\\n\\r\\n\\t\\twhile (allNodes.size() < endSize){\\r\\n\\r\\n\\t\\t\\ttry (Transaction tx = graphDb.beginTx()){\\r\\n\\t\\t\\t\\t//Pick a random node from allNodes\\r\\n\\t\\t\\t\\tint idx = random.nextInt(allNodes.size());\\r\\n\\t\\t\\t\\tNode node = allNodes.get(idx);\\r\\n\\r\\n\\t\\t\\t\\t//Get all relationships of node\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tIterable<Relationship> ite = node.getRelationships(Direction.BOTH);\\r\\n\\t\\t\\t\\tList<Relationship> tempRels = new ArrayList<Relationship>();\\r\\n\\r\\n\\t\\t\\t\\t//Pick one of the relationships uniformly at random.\\r\\n\\t\\t\\t\\tfor (Relationship rel : ite){\\r\\n\\t\\t\\t\\t\\ttempRels.add(rel);\\r\\n\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\tidx = random.nextInt(tempRels.size());\\r\\n\\t\\t\\t\\tRelationship rel = tempRels.get(idx);\\r\\n\\t\\t\\t\\tNode neighbour = rel.getOtherNode(node);\\r\\n\\r\\n\\t\\t\\t\\t//Add the neighbour to allNodes\\r\\n\\t\\t\\t\\tif (!allNodes.contains(neighbour)){\\r\\n\\t\\t\\t\\t\\tallNodes.add(neighbour);\\r\\n\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\ttx.success();\\r\\n\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\t//If reached here, then phase one completed successfully.\\r\\n\\t\\treturn;\\r\\n\\t}\",\n \"public void determinePartitions( Callback c ){\\n mCurrentDepth = 0;\\n GraphNode node;\\n GraphNode child;\\n int depth = 0;\\n List levelList = new java.util.LinkedList();\\n int i = 0;\\n //they contain those nodes whose parents have not been traversed as yet\\n //but the BFS did it.\\n List orphans = new java.util.LinkedList();\\n\\n\\n //set the depth of the dummy root as 0\\n mRoot.setDepth( mCurrentDepth );\\n\\n mQueue.addLast( mRoot );\\n\\n while( !mQueue.isEmpty() ){\\n node = (GraphNode)mQueue.getFirst();\\n depth = node.getDepth();\\n if( mCurrentDepth < depth ){\\n\\n if( mCurrentDepth > 0 ){\\n //we are done with one level!\\n constructPartitions( c, levelList, mCurrentDepth );\\n }\\n\\n\\n //a new level starts\\n mCurrentDepth++;\\n levelList.clear();\\n }\\n mLogger.log( \\\"Adding to level \\\" + mCurrentDepth + \\\" \\\" + node.getID(),\\n LogManager.DEBUG_MESSAGE_LEVEL);\\n levelList.add( node );\\n\\n //look at the orphans first to see if any\\n //of the dependency has changed or not.\\n /*it = orphans.iterator();\\n while(it.hasNext()){\\n child = (GraphNode)it.next();\\n if(child.parentsBlack()){\\n child.setDepth(depth + 1);\\n System.out.println(\\\"Set depth of \\\" + child.getID() + \\\" to \\\" + child.getDepth());\\n\\n child.traversed();\\n mQueue.addLast(child);\\n }\\n\\n //remove the child from the orphan\\n it.remove();\\n }*/\\n\\n\\n node.setColor( GraphNode.BLACK_COLOR );\\n for( Iterator it = node.getChildren().iterator(); it.hasNext(); ){\\n child = (GraphNode)it.next();\\n if(!child.isColor( GraphNode.GRAY_COLOR ) &&\\n child.parentsColored( GraphNode.BLACK_COLOR )){\\n mLogger.log( \\\"Adding to queue \\\" + child.getID(),\\n LogManager.DEBUG_MESSAGE_LEVEL );\\n child.setDepth( depth + 1 );\\n child.setColor( GraphNode.GRAY_COLOR );\\n mQueue.addLast( child );\\n }\\n /*else if(!child.isTraversed() && !child.parentsBlack()){\\n //we have to do the bumping effect\\n System.out.println(\\\"Bumping child \\\" + child);\\n orphans.add(child);\\n }*/\\n }\\n node = (GraphNode)mQueue.removeFirst();\\n mLogger.log( \\\"Removed \\\" + node.getID(),\\n LogManager.DEBUG_MESSAGE_LEVEL);\\n }\\n\\n //handle the last level of the BFS\\n constructPartitions( c, levelList, mCurrentDepth );\\n\\n\\n //all the partitions are dependant sequentially\\n for( i = mCurrentDepth; i > 1; i-- ){\\n constructLevelRelations( c, i - 1, i );\\n\\n }\\n\\n done( c );\\n }\",\n \"public ArrayList<UUSearchNode> getSuccessors() {\\n\\n ArrayList<UUSearchNode> successors = new ArrayList<UUSearchNode>();//this will be returned\\n ArrayList<CannibalNode> helper = new ArrayList<CannibalNode>();\\n\\n if (this.state[2]==1){ //if the boat is on the starting shore\\n helper.add(new CannibalNode(this.state[0] - 2, this.state[1],\\n this.state[2] - 1, this.depth + 1)); //subtracting <201>\\n helper.add(new CannibalNode(this.state[0], this.state[1] - 2,\\n this.state[2] - 1, this.depth + 1)); //subtracting <021>\\n helper.add(new CannibalNode(this.state[0] - 1, this.state[1] - 1,\\n this.state[2] - 1, this.depth + 1)); //subtracting <111>\\n helper.add(new CannibalNode(this.state[0] - 1, this.state[1],\\n this.state[2] - 1, this.depth + 1)); //subtracting <101>\\n helper.add(new CannibalNode(this.state[0], this.state[1] - 1,\\n this.state[2] - 1, this.depth + 1)); //subtracting <011>\\n }else{ //if the boat is on the opposite shore\\n helper.add(new CannibalNode(this.state[0] + 2, this.state[1],\\n this.state[2] + 1, this.depth + 1)); //adding <201>\\n helper.add(new CannibalNode(this.state[0], this.state[1] + 2,\\n this.state[2] + 1, this.depth + 1)); //adding <021>\\n helper.add(new CannibalNode(this.state[0] + 1, this.state[1] + 1,\\n this.state[2] + 1, this.depth + 1)); //adding <111>\\n helper.add(new CannibalNode(this.state[0] + 1, this.state[1],\\n this.state[2] + 1, this.depth + 1)); //adding <101>\\n helper.add(new CannibalNode(this.state[0], this.state[1] + 1,\\n this.state[2] + 1, this.depth + 1)); //adding <011>\\n }\\n\\n //now we check for feasibility and legality\\n for(CannibalNode n : helper){\\n if(isFeasibleState(n.state) && isLegalState(n.state)){\\n successors.add(n);\\n }\\n }\\n return successors;\\n }\",\n \"private TakTree<TakPiece> treeBuilder(TakTree<TakPiece> tree, Point startingPoint, ArrayList<Point> visited){\\n if(containsWinningPath(visited)){\\n // Did white or black win?\\n if(getTop(startingPoint).isWhite()){\\n whiteWins = true;\\n } else {\\n blackWins = true;\\n }\\n\\n // return our tree because this is certainly a leaf node\\n return tree;\\n }\\n\\n Point right = new Point(startingPoint.x + 1, startingPoint.y);\\n Point left = new Point(startingPoint.x - 1, startingPoint.y);\\n Point up = new Point(startingPoint.x, startingPoint.y - 1);\\n Point down = new Point(startingPoint.x, startingPoint.y + 1);\\n\\n\\n // Check for backtracking right\\n if(isValidAndSimilar(right, startingPoint) && !visitedContains(visited, right)){\\n // Create new subtree with our right as root\\n TakTree<TakPiece> treeToAttach = new TakTree<>();\\n treeToAttach.addRoot(getTop(right));\\n //Add this position to the visited array\\n visited.add(right);\\n // Attach subtree to right position\\n tree.attachRight(treeBuilder(treeToAttach, right, visited));\\n }\\n\\n // Try to build left subtree\\n if(isValidAndSimilar(left, startingPoint) && !visitedContains(visited, left)){\\n // Create new subtree with our right as root\\n TakTree<TakPiece> treeToAttach = new TakTree<>();\\n treeToAttach.addRoot(getTop(left));\\n //Add this position to the visited array\\n visited.add(left);\\n // Attach subtree to right position\\n tree.attachLeft(treeBuilder(treeToAttach, left, visited));\\n }\\n\\n // Try to build up subtree\\n if(isValidAndSimilar(up, startingPoint) && !visitedContains(visited, up)){\\n // Create new subtree with our right as root\\n TakTree<TakPiece> treeToAttach = new TakTree<>();\\n treeToAttach.addRoot(getTop(up));\\n //Add this position to the visited array\\n visited.add(up);\\n // Attach subtree to right position\\n tree.attachUp(treeBuilder(treeToAttach, up, visited));\\n }\\n\\n // Try to build down subtree\\n if(isValidAndSimilar(down, startingPoint) && !visitedContains(visited, down)){\\n\\n // Create new subtree with our right as root\\n TakTree<TakPiece> treeToAttach = new TakTree<>();\\n treeToAttach.addRoot(getTop(down));\\n //Add this position to the visited array\\n visited.add(down);\\n // Attach subtree to right position\\n tree.attachDown(treeBuilder(treeToAttach, down, visited));\\n }\\n\\n return tree;\\n }\",\n \"public ArrayList<Edge> Prim (String s){\\n Node Start = nodeMap.get(s);\\n mst = new ArrayList<>();\\n HashMap<String, String> inserted = new HashMap<String, String>();\\n ArrayList<Edge> failed = new ArrayList<Edge>();\\n PriorityQueue<Edge> pq = new PriorityQueue<Edge>();\\n ArrayList<Edge> ed = new ArrayList<Edge>(edgeMap.values());\\n Edge first = ed.get(0);\\n mst.add(first);\\n inserted.put(first.w, first.w);\\n inserted.put(first.v, first.v);\\n\\n priorityEdgeInsert(pq, first);\\n\\n while (inserted.size() <= edges() && pq.size() != 0){ //O(E log(V))\\n //runs for E checking the possible V, where the number of V is devided each time, or log(V), giving ELog(V)\\n Edge e = pq.poll();\\n String w = inserted.get(e.w);\\n String v = inserted.get(e.v);\\n\\n if ((w == null) ^ (v == null)){\\n priorityEdgeInsert(pq, e);\\n for(Edge f : failed){\\n if(f.v == e.v || f.v == e.w || f.w == e.v || f.w == e.w){\\n\\n }\\n else{\\n pq.add(f);\\n }\\n }\\n failed.clear();\\n mst.add(e);\\n inserted.put(e.w, e.w); //only puts one, the null one is hashed to a meaningless spot\\n inserted.put(e.v, e.v);\\n }\\n else if ((w == null) && (v == null) ){\\n failed.add(e);\\n }\\n else if (!(w == null) && !(v == null) ){\\n failed.remove(e);\\n pq.remove(e);\\n }\\n else if (e == null){\\n System.out.println(\\\"HOW?\\\"); //should never happen.\\n }\\n }\\n return mst;\\n }\",\n \"public static void main(String[] args) {\\n\\t\\tint array[]={2,3,4,6};\\n\\t\\tint n=array.length;\\n\\t\\tint maximum=Integer.MIN_VALUE;\\n\\t\\tint minimum=Integer.MAX_VALUE;\\n\\t\\tfor(int i:array)\\n\\t\\t{\\n\\t\\t\\tif(i>maximum)\\n\\t\\t\\t\\tmaximum=i;\\n\\t\\t\\tif(i<minimum)\\n\\t\\t\\t\\tminimum=i;\\n\\t\\t}\\n\\t\\t\\n\\t\\tint mark[]=new int[maximum+2];\\n\\t\\tint value[]=new int[maximum+2];\\n\\t\\tfor(int i=0;i<n;i++)\\n\\t\\t{\\n\\t\\t\\tmark[array[i]]=1; // marking ki exist karta hai no need to search in the array.\\n\\t\\t\\tvalue[array[i]]=1; //har value se ek fbt to banega hi (1 node ka)\\n\\t\\t}\\n\\t\\tint ans=0;\\n\\t\\tfor(int i=minimum;i<=maximum;i++){\\n\\t\\t\\tif(mark[i]==1) // element is present in the array.// we have found the first factor now find 2nd factor.\\n\\t\\t\\t{\\n\\t\\t// find the multiples of arr[i] which are less than max value and also less than its square\\n\\t\\t\\tfor(int j=i+i ;j<=maximum && j/i<=i;j=j+i)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(mark[j]==1 && mark[j/i]==1) // i is the first factor and j/i is the 2nd factor.j is the product that serves as root.\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t// value =all combination of left child with right child.\\n\\t\\t\\t\\t\\tvalue[j]=value[j] + (value[i] * value[j/i]);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// if the 2 child are not same then one more orientation.\\n\\t\\t\\t\\t\\tif(i!=(j/i))\\n\\t\\t\\t\\t\\t\\tvalue[j]=value[j] + (value[i] * value[j/i]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tans=ans+value[i];\\n\\t\\t}\\n\\t\\tSystem.out.println(ans);\\n\\t}\",\n \"public void breadthFirstTraversal() {\\n beginAnimation();\\n treeBreadthFirstTraversal();\\n stopAnimation();\\n\\n }\",\n \"public ArrayList<SearchNode> search(Problem p) {\\n\\tfrontier = new NodeQueue();\\t// The frontier is a queue of expanded SearchNodes not processed yet\\n\\texplored = new HashSet<SearchNode>();\\t/// The explored set is a set of nodes that have been processed \\n\\tGridPos startState = (GridPos) p.getInitialState();\\t// The start state is given\\n\\tfrontier.addNodeToFront(new SearchNode(startState));\\t// Initialize the frontier with the start state \\n\\n\\t\\n\\tpath = new ArrayList<SearchNode>();\\t// Path will be empty until we find the goal\\n\\t\\t\\n\\n\\n\\twhile(!frontier.isEmpty()){\\n\\n\\t SearchNode s = frontier.removeFirst(); \\n\\t GridPos g = s.getState(); \\n\\n\\t if ( p.isGoalState(g) ) {\\n\\t\\tpath = s.getPathFromRoot();\\t\\n\\t\\tbreak; \\n\\t }\\n\\t \\n\\t explored.add(s); \\t \\n\\t ArrayList<GridPos> childStates = p.getReachableStatesFrom(g);\\n\\n\\t while(!childStates.isEmpty()){\\n\\n\\t\\tSearchNode child = new SearchNode(childStates.get(0), s); \\n\\n\\t\\tif(!explored.contains(child) && !frontier.contains(child)){\\n\\n\\t\\t if ( p.isGoalState(child.getState()) ) {\\n\\t\\t\\n\\t\\t\\tpath = child.getPathFromRoot();\\t\\n\\t\\t\\treturn path; \\n\\t\\t }\\n\\n\\t\\t if(insertFront) \\n\\t\\t\\tfrontier.addNodeToFront(child); \\t\\t \\t\\t\\n\\t\\t else\\t\\n\\t\\t\\tfrontier.addNodeToBack(child); \\t \\n\\n\\n\\n\\t\\t}\\n\\n\\t\\tchildStates.remove(0);\\n\\t }\\t \\n\\t}\\n\\n\\n\\treturn path;\\n\\n }\",\n \"public void bfs()\\n{\\n Queue q=new LinkedList();\\n q.add(this.rootNode);\\n printNode(this.rootNode);\\n rootNode.visited=true;\\n while(!q.isEmpty())\\n {\\n Node n=(Node)q.remove();\\n Node child=null;\\n while((child=getUnvisitedChildNode(n))!=null)\\n {\\n child.visited=true;\\n printNode(child);\\n q.add(child);\\n }\\n }\\n //Clear visited property of nodes\\n clearNodes();\\n}\",\n \"public List<Node> findPath(Vector2i start, Vector2i goal) {\\n\\t\\tList<Node> openList = new ArrayList<Node>(); //All possible Nodes(tiles) that could be shortest path\\n\\t\\tList<Node> closedList = new ArrayList<Node>(); //All no longer considered Nodes(tiles)\\n\\t\\tNode current = new Node(start,null, 0, getDistance(start, goal)); //Current Node that is being considered(first tile)\\n\\t\\topenList.add(current);\\n\\t\\twhile(openList.size() > 0) {\\n\\t\\t\\tCollections.sort(openList, nodeSorter); // will sort open list based on what's specified in the comparator\\n\\t\\t\\tcurrent = openList.get(0); // sets current Node to first possible element in openList\\n\\t\\t\\tif(current.tile.equals(goal)) {\\n\\t\\t\\t\\tList<Node> path = new ArrayList<Node>(); //adds the nodes that make the path \\n\\t\\t\\t\\twhile(current.parent != null) { //retraces steps from finish back to start\\n\\t\\t\\t\\t\\tpath.add(current); // add current node to list\\n\\t\\t\\t\\t\\tcurrent = current.parent; //sets current node to previous node to strace path back to start\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\topenList.clear(); //erases from memory since algorithm is finished, ensures performance is not affected since garbage collection may not be called\\n\\t\\t\\t\\tclosedList.clear();\\n\\t\\t\\t\\treturn path; //returns the desired result shortest/quickest path\\n\\t\\t\\t}\\n\\t\\t\\topenList.remove(current); //if current Node is not part of path to goal remove\\n\\t\\t\\tclosedList.add(current); //and puts it in closedList, because it's not used\\n\\t\\t\\tfor(int i = 0; i < 9; i++ ) { //8-adjacent tile possibilities\\n\\t\\t\\t\\tif(i == 4) continue; //index 4 is the middle tile (tile player currently stands on), no reason to check it\\n\\t\\t\\t\\tint x = (int)current.tile.getX();\\n\\t\\t\\t\\tint y = (int)current.tile.getY();\\n\\t\\t\\t\\tint xi = (i % 3) - 1; //will be either -1, 0 or 1\\n\\t\\t\\t\\tint yi = (i / 3) - 1; // sets up a coordinate position for Nodes (tiles)\\n\\t\\t\\t\\tTile at = getTile(x + xi, y + yi); // at tile be all surrounding tiles when iteration is run\\n\\t\\t\\t\\tif(at == null) continue; //if empty tile skip it\\n\\t\\t\\t\\tif(at.solid()) continue; //if solid cant pass through so skip/ don't consider this tile\\n\\t\\t\\t\\tVector2i a = new Vector2i(x + xi, y + yi); //Same thing as node(tile), but changed to a vector\\n\\t\\t\\t\\tdouble gCost = current.gCost + (getDistance(current.tile, a) == 1 ? 1 : 0.95); //*calculates only adjacent nodes* current tile (initial start is 0) plus distance between current tile to tile being considered (a)\\n\\t\\t\\t\\tdouble hCost = getDistance(a, goal);\\t\\t\\t\\t\\t\\t\\t\\t// conditional piece above for gCost makes a more realist chasing, because without it mob will NOT use diagonals because higher gCost\\n\\t\\t\\t\\tNode node = new Node(a, current, gCost, hCost);\\n\\t\\t\\t\\tif(vecInList(closedList, a) && gCost >= node.gCost) continue; //is node has already been checked \\n\\t\\t\\t\\tif(!vecInList(openList, a) || gCost < node.gCost) openList.add(node);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tclosedList.clear(); //clear the list, openList will have already been clear if no path was found\\n\\t\\treturn null; //a default return if no possible path was found\\n\\t}\",\n \"public List<Integer> findMinHeightTrees(int n, int[][] edges) {\\n List<Integer> ans = new ArrayList<>();\\n if (n == 0) return ans;\\n if (n == 1) {\\n ans.add(0);\\n return ans;\\n }\\n if (n == 2) {\\n ans.add(0);\\n ans.add(1);\\n return ans;\\n }\\n\\n //build graph\\n List<Integer>[] graph = new ArrayList[n];\\n for (int i = 0; i < n; i++) {\\n graph[i] = new ArrayList<>();\\n }\\n for (int i = 0; i < edges.length; i++) {\\n int v1 = edges[i][0];\\n int v2 = edges[i][1];\\n\\n graph[v1].add(v2);\\n graph[v2].add(v1);\\n }\\n\\n //initial leaves\\n List<Integer> leaves = new ArrayList<>();\\n for (int i = 0; i < n; i++) {\\n if (graph[i].size() == 1) {\\n leaves.add(i);\\n }\\n }\\n\\n int count = n;\\n\\n while (count > 2) {\\n int leasize = leaves.size();\\n count -= leasize;\\n List<Integer> newleaves = new ArrayList<Integer>();\\n for (int i = 0; i < leasize; i++) {\\n int leavenode = leaves.get(i);\\n int verToleave = graph[leavenode].get(0);\\n graph[verToleave].remove(Integer.valueOf(leavenode));\\n if (graph[verToleave].size() == 1) {\\n newleaves.add(verToleave);\\n }\\n }\\n\\n leaves = newleaves;\\n }\\n return leaves;\\n\\n\\n }\",\n \"public int findSpanningTree(List<Graph.Edge> edges) {\\n while (!isSpanningTree()) {\\n toZeroWeightGraph();\\n shrinkComponents();\\n }\\n return populateEdges(edges);\\n }\",\n \"private Node constructInternal(List<Node> children){\\r\\n\\r\\n // Base case: root found\\r\\n if(children.size() == 1){\\r\\n return children.get(0);\\r\\n }\\r\\n\\r\\n // Generate parents\\r\\n boolean odd = children.size() % 2 != 0;\\r\\n for(int i = 1; i < children.size(); i += 2){\\r\\n Node left = children.get(i-1);\\r\\n Node right = children.get(i);\\r\\n Node parent = new Node(Utility.SHA512(left.hash + right.hash), left, right);\\r\\n children.add(parent);\\r\\n }\\r\\n\\r\\n // If the number of nodes is odd, \\\"inherit\\\" the remaining child node (no hash needed)\\r\\n if(odd){\\r\\n children.add(children.get(children.size() - 1));\\r\\n }\\r\\n return constructInternal(children);\\r\\n }\",\n \"void buildHeap() {\\n for (int i = parent(size - 1); i >= 0; i--) {\\n percolateDown(i);\\n }\\n }\",\n \"private List<Pair<Integer, Integer>> getBestPath(Pair<Integer, Integer> curLocation, Pair<Integer, Integer> dest) {\\n\\t\\tList<Pair<Integer, Integer>> path = new LinkedList<Pair<Integer, Integer>>();\\n\\t\\t\\n\\t\\t\\n\\t\\tNode current = new Node(curLocation.getX(), curLocation.getY(), getHitProbability(curLocation.getX(), curLocation.getY()));\\n\\t\\tNode target = new Node(dest.getX(), dest.getY(), getHitProbability(dest.getX(), dest.getY()));\\n\\t\\tList<Node> openSet = new ArrayList<>();\\n List<Node> closedSet = new ArrayList<>();\\n \\n \\n while (true) {\\n openSet.remove(current);\\n List<Node> adjacent = getAdjacentNodes(current, closedSet, target);\\n\\n // Find the adjacent node with the lowest heuristic cost.\\n for (Node neighbor : adjacent) {\\n \\tboolean inOpenset = false;\\n \\tList<Node> openSetCopy = new ArrayList<>(openSet);\\n \\tfor (Node node : openSetCopy) {\\n \\t\\tif (neighbor.equals(node)) {\\n \\t\\t\\tinOpenset = true;\\n \\t\\t\\tif (neighbor.getAccumulatedCost() < node.getAccumulatedCost()) {\\n \\t\\t\\t\\topenSet.remove(node);\\n \\t\\t\\t\\topenSet.add(neighbor);\\n \\t\\t\\t}\\n \\t\\t}\\n \\t}\\n \\t\\n \\tif (!inOpenset) {\\n \\t\\topenSet.add(neighbor);\\n \\t}\\n }\\n\\n // Exit search if done.\\n if (openSet.isEmpty()) {\\n System.out.printf(\\\"Target (%d, %d) is unreachable from position (%d, %d).\\\\n\\\",\\n target.getX(), target.getY(), curLocation.getX(), curLocation.getY());\\n return null;\\n } else if (/*isAdjacent(current, target)*/ current.equals(target)) {\\n break;\\n }\\n\\n // This node has been explored now.\\n closedSet.add(current);\\n\\n // Find the next open node with the lowest cost.\\n Node next = openSet.get(0);\\n for (Node node : openSet) {\\n if (node.getCost(target) < next.getCost(target)) {\\n next = node;\\n }\\n }\\n// System.out.println(\\\"Moving to node: \\\" + current);\\n current = next;\\n }\\n \\n // Rebuild the path using the node parents\\n path.add(new Pair<Integer, Integer>(curLocation.getX(), curLocation.getY()));\\n while(current.getParent() != null) {\\n \\tcurrent = current.getParent();\\n \\tpath.add(0, new Pair<Integer, Integer>(current.getX(), current.getY()));\\n }\\n \\n if (path.size() > 1) {\\n \\tpath.remove(0);\\n }\\n \\n\\t\\treturn path;\\n\\t}\",\n \"public List<Integer> findMinHeightTrees(int n, int[][] edges) {\\n\\n // edge list\\n // Create adjacency list\\n // find nodes with edge degree\\n // fill a queue with edge degree one\\n // do the bfs and keep marking their heights in the path\\n // as we go along and find a node with lesser possible heights, update heights\\n // of that node and keep updating in consequent nodes\\n\\n // edge case - disconnected tree\\n\\n List<List<Integer>> adjList = new ArrayList<>();\\n\\n createAdjList(n, edges, adjList);\\n\\n // Revise - How to print a list?\\n System.out.println(Arrays.toString(adjList.toArray()));\\n\\n int[] edgeDegree = new int[n];\\n int[] heights = new int[n];\\n for (int[] edge:\\n edges) {\\n edgeDegree[edge[0]]++;\\n edgeDegree[edge[1]]++;\\n }\\n\\n System.out.println(\\\"edgeDegree\\\");\\n System.out.println(Arrays.toString(edgeDegree));\\n\\n Queue<Integer> bfsQ = new LinkedList<>();\\n boolean[] visited = new boolean[n];\\n for (int i = 0; i < edgeDegree.length; i++) {\\n if (edgeDegree[i] == 1) {\\n bfsQ.add(i);\\n heights[i] = 1;\\n break;\\n }\\n }\\n\\n int maxHeight = Integer.MIN_VALUE;\\n while (!bfsQ.isEmpty()) {\\n Integer vertex = bfsQ.poll();\\n visited[vertex] = true;\\n System.out.println(\\\"Out from queue\\\");\\n int heightParentVertex = heights[vertex];\\n maxHeight = Math.max(maxHeight, heightParentVertex);\\n List<Integer> adjNodes = adjList.get(vertex);\\n for (Integer adjNode:\\n adjNodes) {\\n if (!visited[adjNode]) {\\n heights[adjNode] = heightParentVertex+1;\\n bfsQ.add(adjNode);\\n }\\n }\\n }\\n\\n List<Integer> ans = new ArrayList<>();\\n System.out.println(\\\"maxHeight\\\");\\n System.out.println(maxHeight);\\n\\n // if even\\n for (int i = 0; i < n; i++) {\\n if ( heights[i] == ((maxHeight / 2) + 1)) {\\n ans.add(i);\\n } else if (maxHeight % 2 == 0 && heights[i] == maxHeight / 2) {\\n ans.add(i);\\n }\\n }\\n\\n return ans;\\n }\",\n \"private BinaryTree<Character> constructTree(){\\n if(pq.size() == 1) return pq.poll().data;\\n if(pq.size() == 0) return null;\\n // Poll the lowest two trees, combine them, then stick them back in the queue.\\n Helper<BinaryTree<Character>> temp0 = pq.poll(), temp1 = pq.poll(),\\n result = new Helper<>(temp0.priority + temp1.priority, new BinaryTree<>(temp0.data, null , temp1.data));\\n pq.add(result);\\n // Call again to keep constructing.\\n return constructTree();\\n }\",\n \"public ArrayList<State> childStates(){\\n boolean hasExpanded = false;\\n this.childStates = new ArrayList<>();\\n Successor successor = new Successor(); //for calling the successors functions\\n //cases for this\\n for (int i = 0; i < boardRows ; i++) {\\n for (int j = 0; j < boardColumns; j++) {\\n if(!hasExpanded){\\n if(currentBoardState[i][j] == 0){\\n\\n if( i - 1 >= 0){\\n //call moveDown()\\n //System.out.println(i + \\\" \\\" + j);\\n //System.out.println(\\\"calling moveDown()\\\");\\n State newState = successor.moveDown(i, j, this.getCurrentBoardState(), this.getGoalBoardState());\\n\\n //newState.printBoard();\\n childStates.add(newState);\\n }\\n\\n if( i + 1 <= boardRows-1){\\n //call moveUp()\\n //System.out.println(i + \\\" \\\" + j);\\n //System.out.println(\\\"calling moveUp()\\\");\\n //this.printBoard();\\n State newState = successor.moveUp(i, j, this.getCurrentBoardState(), this.getGoalBoardState());\\n //newState.printBoard();\\n childStates.add(newState);\\n }\\n\\n if(j - 1 >= 0){\\n //System.out.println(i + \\\" \\\" + j);\\n //System.out.println(\\\"calling moveRight()\\\");\\n //this.printBoard();\\n State newState = successor.moveRIght(i, j, this.getCurrentBoardState(), this.getGoalBoardState());\\n //newState.printBoard();\\n childStates.add(newState);\\n }\\n\\n if( j + 1 <= boardColumns - 1){\\n //System.out.println(i + \\\" \\\" + j);\\n //System.out.println(\\\"calling moveLeft()\\\");\\n //this.printBoard();\\n State newState = successor.moveLeft(i,j,this.getCurrentBoardState(), this.getGoalBoardState());\\n //newState.printBoard();\\n childStates.add(newState);\\n }\\n hasExpanded = true;\\n }\\n }\\n }\\n }\\n return childStates;\\n }\",\n \"public void addToNextMoves(GameTile[][] visibleMap) {\\r\\n\\t\\t\\r\\n\\t\\t//Breadth First Search Code\\r\\n//\\t\\tWumpusState state = new WumpusState(visibleMap, playerX, playerY, wumpusX, wumpusY);\\r\\n\\r\\n\\t\\tQueue<WumpusState> queue = new LinkedList<WumpusState>();\\t\\t\\t\\t//use the queue in the same way\\t\\r\\n\\t\\tHashMap<String, Boolean> visitedStates = new HashMap<String, Boolean>();\\t//add all children to the queue, \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//add all the children to the hash and set values to true.\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//once all the children have been visited, generate children sequentially for the children that already been added \\r\\n\\t\\tWumpusState state = new WumpusState(visibleMap, playerX, playerY);\\r\\n\\t\\tlong nodesExpanded = 0;\\r\\n\\t\\t\\r\\n\\t\\tqueue.add(state);\\r\\n\\t\\twhile(!queue.isEmpty()) {\\r\\n\\t\\t\\tWumpusState currentState = queue.remove();\\r\\n\\t\\t\\tSystem.out.println(currentState.toString());\\r\\n\\t\\t\\tif(currentState.getPlayerX() == 4 && currentState.getPlayerY() == 1) {\\r\\n\\t\\t\\t\\tnodesExpanded = visitedStates.size();\\r\\n\\t\\t\\t\\tSystem.out.println(\\\"Nodes Expanded: \\\"+nodesExpanded);\\r\\n\\t\\t\\t\\tArrayList<AgentAction> actions = currentState.getAllActions();\\r\\n\\t\\t\\t\\tfor(int i=1;i<actions.size(); i++) {\\r\\n\\t\\t\\t\\t\\tSystem.out.println(actions.get(i));\\r\\n\\t\\t\\t\\t\\tnextMoves.add(actions.get(i));\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tnextMoves.add(AgentAction.declareVictory);\\r\\n\\t\\t\\t\\treturn;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tif(visitedStates.containsKey(currentState.toString())) {\\r\\n\\t\\t\\t\\tcontinue;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse {\\r\\n\\t\\t\\t\\tvisitedStates.put(currentState.toString(), true);\\r\\n\\t\\t\\t\\tWumpusState[] childrenOfCurrentChild = currentState.generateChildrenStates();\\r\\n\\t\\t\\t\\tfor(int j=0; j<childrenOfCurrentChild.length; j++) {\\r\\n\\t\\t\\t\\t\\tif(childrenOfCurrentChild[j]!=null) {\\r\\n\\t\\t\\t\\t\\t\\tqueue.add(childrenOfCurrentChild[j]);\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\t\\r\\n\\t}\",\n \"private void maximize(Node node) {\\n // maximize:\\n double max = Tree.MININT;\\n List<Node> children = node.getChildren();\\n \\n// if(children.isEmpty()){\\n// return;\\n// }\\n \\n //String values = \\\"\\\";\\n for (Node child : children) {\\n if (child.getMove().getRating() > max) {\\n max = child.getMove().getRating();\\n }\\n // values += \\\"\\\" + child.getMove().getRating() + \\\", \\\";\\n }\\n // set value\\n // System.out.println(\\\"setting value for next parent (maximize): \\\" + max + \\\" (all values: \\\" + values + \\\")\\\");\\n\\n node.getMove().setRating(max);\\n }\",\n \"private void constructTree() {\\r\\n\\t\\tsortLeaves();\\r\\n\\t\\tNode currentNode;\\r\\n\\t\\tint index = 0;\\r\\n\\t\\t\\tdo{\\r\\n\\t\\t\\t\\t// Create a new node with the next two least frequent nodes as its children\\r\\n\\t\\t\\t\\tcurrentNode = new Node(this.treeNodes[0], this.treeNodes[1]); \\r\\n\\t\\t\\t\\taddNewNode(currentNode);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\twhile (this.treeNodes.length > 1); // Until there is only one root node\\r\\n\\t\\t\\tthis.rootNode = currentNode;\\r\\n\\t\\t\\tindex++;\\r\\n\\t}\",\n \"public AttackTreeNode buildNextChild(AttackTreeNode activeChild) {\\n \\n return null;\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.68561","0.66838115","0.64369076","0.62570703","0.6249718","0.6213673","0.6053108","0.60517704","0.6046425","0.60363895","0.60311365","0.5989149","0.59789205","0.5899618","0.5888914","0.58667064","0.5839533","0.58271617","0.5823444","0.5815419","0.57463825","0.57324743","0.5727203","0.57262874","0.5698704","0.5668818","0.5661886","0.56463116","0.56235296","0.56102055","0.55988246","0.5597657","0.55958915","0.5591335","0.55842024","0.5580522","0.55758554","0.5567347","0.5565173","0.55507797","0.55374867","0.552076","0.55180764","0.5494779","0.54756457","0.54753053","0.5473173","0.5469236","0.5458522","0.54495424","0.5447358","0.5435036","0.5433914","0.54331565","0.54306847","0.54304236","0.5421675","0.5419478","0.54039943","0.53994036","0.5392353","0.539223","0.53783303","0.537403","0.5373771","0.5371963","0.5369919","0.53690666","0.53583944","0.5355651","0.53501785","0.5349088","0.5344868","0.53429306","0.5334368","0.53293234","0.53264743","0.5308435","0.5306574","0.5284507","0.5280632","0.5275806","0.5267481","0.526677","0.5264777","0.52637535","0.52629566","0.526179","0.5260129","0.5259739","0.5256556","0.5247091","0.52452886","0.5244668","0.52390134","0.523247","0.52294","0.5225302","0.5223841","0.52211374"],"string":"[\n \"0.68561\",\n \"0.66838115\",\n \"0.64369076\",\n \"0.62570703\",\n \"0.6249718\",\n \"0.6213673\",\n \"0.6053108\",\n \"0.60517704\",\n \"0.6046425\",\n \"0.60363895\",\n \"0.60311365\",\n \"0.5989149\",\n \"0.59789205\",\n \"0.5899618\",\n \"0.5888914\",\n \"0.58667064\",\n \"0.5839533\",\n \"0.58271617\",\n \"0.5823444\",\n \"0.5815419\",\n \"0.57463825\",\n \"0.57324743\",\n \"0.5727203\",\n \"0.57262874\",\n \"0.5698704\",\n \"0.5668818\",\n \"0.5661886\",\n \"0.56463116\",\n \"0.56235296\",\n \"0.56102055\",\n \"0.55988246\",\n \"0.5597657\",\n \"0.55958915\",\n \"0.5591335\",\n \"0.55842024\",\n \"0.5580522\",\n \"0.55758554\",\n \"0.5567347\",\n \"0.5565173\",\n \"0.55507797\",\n \"0.55374867\",\n \"0.552076\",\n \"0.55180764\",\n \"0.5494779\",\n \"0.54756457\",\n \"0.54753053\",\n \"0.5473173\",\n \"0.5469236\",\n \"0.5458522\",\n \"0.54495424\",\n \"0.5447358\",\n \"0.5435036\",\n \"0.5433914\",\n \"0.54331565\",\n \"0.54306847\",\n \"0.54304236\",\n \"0.5421675\",\n \"0.5419478\",\n \"0.54039943\",\n \"0.53994036\",\n \"0.5392353\",\n \"0.539223\",\n \"0.53783303\",\n \"0.537403\",\n \"0.5373771\",\n \"0.5371963\",\n \"0.5369919\",\n \"0.53690666\",\n \"0.53583944\",\n \"0.5355651\",\n \"0.53501785\",\n \"0.5349088\",\n \"0.5344868\",\n \"0.53429306\",\n \"0.5334368\",\n \"0.53293234\",\n \"0.53264743\",\n \"0.5308435\",\n \"0.5306574\",\n \"0.5284507\",\n \"0.5280632\",\n \"0.5275806\",\n \"0.5267481\",\n \"0.526677\",\n \"0.5264777\",\n \"0.52637535\",\n \"0.52629566\",\n \"0.526179\",\n \"0.5260129\",\n \"0.5259739\",\n \"0.5256556\",\n \"0.5247091\",\n \"0.52452886\",\n \"0.5244668\",\n \"0.52390134\",\n \"0.523247\",\n \"0.52294\",\n \"0.5225302\",\n \"0.5223841\",\n \"0.52211374\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.7819133"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":27397,"cells":{"query":{"kind":"string","value":"read the file and take information about start,goal and forbidden"},"document":{"kind":"string","value":"public static void main(String[] args) throws FileNotFoundException {\n ThreeDigits threeDigits = new ThreeDigits();\n String filename = args[1];\n\n File myFile = new File(filename);\n Scanner reader = new Scanner(myFile);\n\n threeDigits.startNode = new Node(reader.nextLine());\n threeDigits.goalNode = new Node(reader.nextLine());\n\n if (reader.hasNextLine()) {\n\n String num = reader.nextLine();\n threeDigits.forbidden.addAll(Arrays.asList(num.split(\",\")));\n\n }\n\n if(threeDigits.startNode.getDigit().getDigitString().equals(threeDigits.goalNode.getDigit().getDigitString())){\n System.out.println(\"No solution found\");\n System.out.print(threeDigits.startNode.getDigit().getDigitString());\n System.exit(0);\n }\n\n ArrayList<String> childrenOfStart = new ArrayList<>();\n childrenOfStart = threeDigits.makeChildren(threeDigits.startNode);\n\n childrenOfStart.removeAll(threeDigits.forbidden);\n\n if(childrenOfStart.size() == 0){\n System.out.println(\"No solution found.\");\n System.out.println(threeDigits.startNode.getDigit().getDigitString());\n System.exit(0);\n }else{\n threeDigits.performSearch(args[0]);\n }\n\n\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["private void extractFile() {\n try (BufferedReader buffered_reader = new BufferedReader(new FileReader(source_file))) {\n String line;\n while((line = buffered_reader.readLine()) != null) {\n String spaceEscaped = line.replace(\" \", \"\");\n //file was read, each line is one of the elements of the file_read_lines list\n //line 0 is keyword \"TELL\"\n //line 1 is the knowledge base\n //line 2 is the keyword \"ASK\"\n //line 3 is the query\n file_read_lines.add(spaceEscaped);\n }\n\n //generate list of Horn clauses (raw) from the KB raw sentence\n //replace \\/ by |\n String kbLine = file_read_lines.get(1).replace(\"\\\\/\", \"|\");\n rawClauses = Arrays.asList(kbLine.split(\";\"));\n //query - a propositional symbol\n query = file_read_lines.get(3);\n } catch (IOException e) {\n //Return error if file cannot be opened\n error = true;\n System.out.println(source_file.toString() + \" is not found!\");\n }\n }","public void readPairs(String fileName) {\n BufferedReader r = null;\n try {\n r = new BufferedReader(new InputStreamReader(new FileInputStream(fileName)));\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n while (true) {\n String line = null;\n try {\n line = r.readLine();\n } catch (IOException e) {\n e.printStackTrace();\n }\n if (line == null) {\n break;\n }\n assert line.length() == 11; // indatakoll, om man kör med assertions på\n String start = line.substring(0, 5);\n String goal = line.substring(6, 11);\n\n int s = words.indexOf(start);\n int v = words.indexOf(goal);\n\n shortestPathPairs(s, v);\n }\n\n }","public AnalysePSRFile(File file) throws IOException {\n ReadFileToString str = new ReadFileToString();\n str.read(file);\n StringTokenizer tok = new StringTokenizer(str.outputString,\"\\n\");\n boolean notfound = true;\n int count = 4;\n while(notfound && tok.hasMoreTokens()) {\n String line = tok.nextToken();\n if(line.indexOf(startKeyword) >= 0) \n count--;\n if(count == 0)\n notfound = false;\n }\n if(!notfound) {\n Temperature = getTemperature(tok);\n getMoleFractionHeader(tok);\n getMoleFractions(tok);\n int n = namesV.size();\n namesS = new String[n];\n molefractionsD = new Double[n];\n for(int i=0;i<n;i++) {\n namesS[i] = (String) namesV.elementAt(i);\n molefractionsD[i] = (Double) molefractionsV.elementAt(i);\n }\n } else {\n throw new IOException(\"PSR file incomplete: Begin not found in \\n \" + file.toString() );\n }\n \n }","public void readTheFile() {\n \t\terrorMap.clear();\n \n \t\tBufferedReader br;\n \t\tString nextLine;\n \t\tString[] header = null;\n \t\tArrayList<String> lines = new ArrayList<String>();\n \t\ttry {\n \t\t\tlogger.debug(\"{} loading file: {} \", getName(), RobotNX100Controller.class.getResource(\"motoman_error_code.txt\").getPath());\n \n \t\t\tbr = new BufferedReader(new FileReader(RobotNX100Controller.class.getResource(\"motoman_error_code.txt\").getPath()));\n \t\t\twhile (((nextLine = br.readLine()) != null) && (nextLine.length() > 0)) {\n \t\t\t\tif (nextLine.startsWith(\"Code\")) {\n \t\t\t\t\theader = nextLine.split(\"[, \\t][, \\t]*\");\n \t\t\t\t} else if (!nextLine.startsWith(\"#\"))\n \t\t\t\t\tlines.add(nextLine);\n \t\t\t}\n \t\t\tbr.close();\n \t\t} catch (FileNotFoundException fnfe) {\n \t\t\t// we do not want to interrupt processing because error map file not set.\n \t\t\tlogger.warn(\"Can not find the Error Message file {} for {}. Only Error code will be reported.\",\n \t\t\t\t\tgetErrorCodeFilename(), getName());\n \t\t\tlogger.warn(\"caused by \" + fnfe.getMessage(), fnfe);\n \t\t\tbr = null;\n \t\t\treturn;\n \t\t} catch (IOException ioe) {\n \t\t\t// we do not want to interrupt processing because error map file not set.\n \t\t\tlogger.warn(\"Can not find the Error Message file {} for {}. Only Error code will be reported.\",\n \t\t\t\t\tgetErrorCodeFilename(), getName());\n \t\t\tlogger.error(\"caused by \" + ioe.getMessage(), ioe);\n \t\t\tbr = null;\n \t\t\treturn;\n \t\t}\n \n \t\tnumberOfRows = lines.size();\n \t\tlogger.debug(\"the file contained \" + numberOfRows + \" lines\");\n \t\tint nColumns = new StringTokenizer(lines.get(0), \"\\t\").countTokens();\n \t\tlogger.debug(\"each line should contain \" + nColumns + \" numbers\");\n \t\tkeys = new ArrayList<String>();\n \t\tif (header != null) {\n \t\t\tfor (int i = 1; i < nColumns; i++) {\n \t\t\t\terrorMap.put(header[0], header[i]);\n \t\t\t}\n \t\t\tkeys.add(header[0]);\n \t\t}\n \n \t\tfor (int i = 0; i < numberOfRows; i++) {\n \t\t\tnextLine = lines.get(i);\n \t\t\tString[] thisLine = nextLine.split(\"[\\t][\\t]*\");\n \t\t\tfor (int j = 0; j < thisLine.length; j++)\n \t\t\t\terrorMap.put(thisLine[0], thisLine[j]);\n \t\t\tkeys.add(thisLine[0]);\n \t\t}\n \t}","private void posRead() throws IOException {\n\t\tFile file = new File(fullFileName());\n\t\tString line;\n\t\tBufferedReader reader = new BufferedReader(new FileReader(file));\n\t\tStringBuffer fileText = new StringBuffer();\n\t\twhile((line = reader.readLine()) != null) {\n\t\t\tStringTokenizer st = new StringTokenizer(line);\n\t\t\twhile (st.hasMoreTokens()) {\n \t\tString tokenAndPos = st.nextToken();\n \t\tint slashIndex = tokenAndPos.lastIndexOf('/');\n \t\tif (slashIndex <= 0) throw new IOException(\"invalid data\");\n \t\tString token = tokenAndPos.substring(0,slashIndex);\n \t\tString pos = tokenAndPos.substring(1+slashIndex).intern();\n \t\tint start = this.length();\n \t\tthis.append(token);\n \t\tif (st.hasMoreTokens())\n \t\t\tthis.append(\" \");\n \t\telse\n \t\t\tthis.append(\" \\n\");\n \t\tint end = this.length();\n \t\tSpan span = new Span(start,end);\n \t\tthis.annotate(\"token\", span, new FeatureSet());\n \t\tthis.annotate(\"constit\", span, new FeatureSet(\"cat\", pos));\n \t}\n\t\t}\n\t}","public String parseSrc() throws Exception{\n\t\tr = new FileReader(userArg); \r\n\t\tst = new StreamTokenizer(r);\r\n\t\t st.eolIsSignificant(true);\r\n\t\t st.commentChar(46);\r\n\t\t st.whitespaceChars(9, 9);\r\n\t\t st.whitespaceChars(32, 32);\r\n\t\t st.wordChars(39, 39);\r\n\t\t st.wordChars(44, 44);\r\n\t\t \r\n\t\t //first we check for a specified start address\r\n\t\t while (InstructionsRead < 2) {\r\n\t\t \tif (st.sval != null) {\r\n\t\t \t\tInstructionsRead++;\r\n\t\t \t\tif (st.sval.equals(\"START\")) {\r\n\t\t \t\twhile(st.ttype != StreamTokenizer.TT_NUMBER) {\r\n\t\t \t\t\tst.nextToken();\r\n\t\t \t\t}\r\n\t\t \t\tDDnval = st.nval;\r\n\t\t \t\tstartAddress = Integer.parseInt(\"\" + DDnval.intValue(), 16);\r\n\t\t \t\tlocctr = startAddress;\r\n\t\t \t\tsLocctr = Integer.toHexString(locctr.intValue());\r\n\t\t \t\tif (sLocctr.length() == 1) {\r\n\t\t \t\t\tSystem.out.println(\"locctr: 000\" + Integer.toHexString(locctr.intValue()));\r\n\t\t \t\t}\r\n\t\t \t\telse if (sLocctr.length() == 2) {\r\n\t\t \t\t\tSystem.out.println(\"locctr: 00\" + Integer.toHexString(locctr.intValue()));\r\n\t\t \t\t}\r\n\t\t \t\telse if (sLocctr.length() == 3 ) {\r\n\t\t \t\t\tSystem.out.println(\"locctr: 0\" + Integer.toHexString(locctr.intValue()));\r\n\t\t \t\t}\r\n\t\t \t\telse {\r\n\t\t \t\t\tSystem.out.println(\"locctr: \" + Integer.toHexString(locctr.intValue()));\r\n\t\t \t\t}\r\n\t\t \t\t//writer.write(\"\" + locctr); //should write to IF, not working yet 2/15/2011\r\n\t\t \t\tstartSpecified = true;\r\n\t\t \t\t}\r\n\t\t \t\telse if (!st.sval.equals(\"START\") && InstructionsRead < 2) { //this should be the program name, also could allow for label here potentially...\r\n\t\t \t\t\t//this is the name of the program\r\n\t\t \t\t\t//search SYMTAB for label etc. \r\n\t\t \t\t\tname = st.sval;\r\n\t\t \t\t}\r\n\t\t \t}\r\n\t\t st.nextToken();\r\n\t\t }\r\n\t\t if (!startSpecified) {\r\n\t\t \tstartAddress = 0;\r\n\t\t \tlocctr = startAddress;\r\n\t\t }\r\n\t\t startAddress2 = startAddress;\r\n\t\t /*\r\n\t\t ATW = Integer.toHexString(startAddress2.intValue());\r\n\t\t \r\n\t\t for (int i = 0; i<(6-ATW.length()); i++){\r\n\t\t \tmyWriter.write(\"0\");\r\n\t\t }\r\n\t\t myWriter.write(ATW);\r\n\t\t myWriter.newLine();//end of line for now; in ReadIF when this line is read and translated to object code, the program length will be tacked on the end\r\n\t\t */\r\n\t\t \r\n\t\t //Now that startAddress has been established, we move on to the main parsing loop\r\n\t\t while (st.ttype != StreamTokenizer.TT_EOF) { //starts parsing to end of file\r\n\t\t \t//System.out.println(\"Stuck in eof\");\r\n\t\t \t//iLocctr = locctr.intValue();\r\n\t\t \tinstFound = false;\r\n\t\t \topcodeDone = false;\r\n\t\t \tlabelDone = false;\r\n\t\t \tmoveOn = true;\r\n\t\t \t//constantCaseW = false;\r\n\t\t \tconstantCaseB = false;\r\n\t\t \txfound = false;\r\n\t\t \tcfound = false;\r\n\t\t \t\r\n\t\t \tInstructionsRead = 0; //init InsRead to 0 at the start of each line\r\n\t\t \tSystem.out.println(\"new line\");\r\n\t\t \tSystem.out.println(\"Ins read: \" + InstructionsRead);\r\n\t\t \tsLocctr = Integer.toHexString(locctr.intValue());\r\n\t \t\tif (sLocctr.length() == 1) {\r\n\t \t\t\tSystem.out.println(\"locctr: 000\" + Integer.toHexString(locctr.intValue()));\r\n\t \t\t}\r\n\t \t\telse if (sLocctr.length() == 2) {\r\n\t \t\t\tSystem.out.println(\"locctr: 00\" + Integer.toHexString(locctr.intValue()));\r\n\t \t\t}\r\n\t \t\telse if (sLocctr.length() == 3 ) {\r\n\t \t\t\tSystem.out.println(\"locctr: 0\" + Integer.toHexString(locctr.intValue()));\r\n\t \t\t}\r\n\t \t\telse {\r\n\t \t\t\tSystem.out.println(\"locctr: \" + Integer.toHexString(locctr.intValue()));\r\n\t \t\t}\r\n\t\t \tif (foundEnd()) {\r\n\t\t \t\tbreak;\r\n\t\t \t}\r\n\t\t \twhile (st.ttype != StreamTokenizer.TT_EOL) {//breaks up parsing by lines so that InstructionsRead will be a useful count\r\n\t\t \t\t\r\n\t\t \t\tmoveOn = true;\r\n\t\t \t\tif (st.ttype == StreamTokenizer.TT_WORD) { \r\n\t\t \t\t\tInstructionsRead++;\r\n\t\t \t\t\tSystem.out.println(st.sval);\r\n\t\t \t\t\tSystem.out.println(\"Instructions Read: \" + InstructionsRead);\r\n\t\t \t\t\tif (foundEnd()) {\r\n\t\t \t\t\t\tbreak;\r\n\t\t \t\t\t}\r\n\t\t \t\t\t/*\r\n\t\t \t\t\t * The whole instructinsread control architecture doesn't quite work, because\r\n\t\t \t\t\t * the ST doesn't count the whitespace it reads in. This is by design because\r\n\t\t \t\t\t * the prof specified that whitespace is non-regulated and thus we cannot\r\n\t\t \t\t\t * predict exactly how many instances of char dec value 32 (space) will appear\r\n\t\t \t\t\t * before and/or between the label/instruction/operand 'fields'. \r\n\t\t \t\t\t * \r\n\t\t \t\t\t * What we could try alternatively is to structure the control around'\r\n\t\t \t\t\t * the optab, since it it static and populated pre-runtime. The schema might\r\n\t\t \t\t\t * go something like this: first convert whatever the sval or nval is to string.\r\n\t\t \t\t\t * Then call the optab.searchOpcode method with the resultant string as the input\r\n\t\t \t\t\t * parameter. If the string is in optab then it is an instruction and the ST is in the\r\n\t\t \t\t\t * instruction 'field' and boolean foundInst is set to true. If it is not in optab AND a boolean variable foundInst which resets to\r\n\t\t \t\t\t * false at the beginning of each new line is still false, then it is a label being declared in the label 'field'\r\n\t\t \t\t\t * If it is not in the optab AND foundInst is true, then the ST is at the operand 'field'.\r\n\t\t \t\t\t * This should work even if the prof has a crappy line with just a label declaration and no instruction or operand, because there\r\n\t\t \t\t\t * definitely cannot be an operand without an instruction...\r\n\t\t \t\t\t */\r\n\t\t \t\t\tif (instFound){\r\n\t\t \t\t\t\tprocessOperand(st);\r\n\t\t \t\t\t}\r\n\t\t \t\t\tif (!instFound) {//this is either label or instruction field\r\n\t\t \t\t\t\t//before anything, search optab to see if this might be the opcode\r\n\t\t \t\t\t\t//if it is an opcode, send it to the opcode processing function\r\n\t\t \t\t\t\tif (st.sval.equals(\"WORD\") || st.sval.equals(\"BYTE\")){//these are the directives... not technically instructions, but they go in the instruction field\r\n\t\t \t\t\t\t\tresCount = 0;\r\n\t\t \t\t\t\t\tif (st.sval.equals(\"WORD\")){\r\n\t\t \t\t\t\t\t\tif (hexDigitCount >= 55){\r\n\t\t \t\t\t\t\t\t\tnewTHandle();\r\n\t\t \t\t\t\t\t\t}\r\n\t\t \t\t\t\t\t\thexDigitCount += 6;\r\n\t\t \t\t\t\t\t}\r\n\t\t \t\t\t\t\tif (st.sval.equals(\"BYTE\")){\r\n\t\t \t\t\t\t\t\tconstantCaseB = true;\r\n\t\t \t\t\t\t\t}\r\n\t\t \t\t\t\t\tinstFound = true;\r\n\t\t \t\t\t\t\tprocessOpcode(st);\r\n\t\t \t\t\t\t}\r\n\t\t \t\t\t\telse if (st.sval.equals(\"RESW\") || st.sval.equals(\"RESB\")){//these are the directives... not technically instructions, but they go in the instruction field\r\n\t\t \t\t\t\t\tresCount++;\r\n\t\t \t\t\t\t\tnewTHandle();\r\n\t\t \t\t\t\t\tinstFound = true;\r\n\t\t \t\t\t\t\tprocessOpcode(st);\r\n\t\t \t\t\t\t}\r\n\t\t \t\t\t\telse if (optab.searchOpcode(st.sval)) {//if true this is the instruction\r\n\t\t \t\t\t\t\tresCount = 0;\r\n\t\t \t\t\t\t\tif (hexDigitCount >= 55){\r\n\t \t\t\t\t\t\t\tnewTHandle();\r\n\t \t\t\t\t\t\t}\r\n\t\t \t\t\t\t\thexDigitCount += 6;\r\n\t\t \t\t\t\t\tinstFound = true;\r\n\t\t \t\t\t\t\tprocessOpcode(st);\r\n\t\t \t\t\t\t\t//InstructionsRead++;\r\n\t\t \t\t\t\t}\r\n\t\t \t\t\t\telse {//otherwise this is the label\r\n\t\t \t\t\t\t\tprocessLabel(st);\r\n\t\t \t\t\t\t}\r\n\t\t \t\t\t\t\r\n\t\t \t\t\t\t\r\n\t\t \t\t\t\t\r\n\t\t \t\t\t}\r\n\t\t \t\t\t//else{ //if instFound is true, this must be the operand field\r\n\t\t \t\t\t\t\r\n\t\t \t\t\t\t//processOperand(st);\r\n\t\t \t\t\t//}\r\n\t\t \t\t\t//if (InstructionsRead == 3) {//this is the operand field\r\n\t\t \t\t\t\t//processOperand();\r\n\t\t \t\t\t\t\r\n\t\t \t\t\t//}\r\n\t\t \t\t}\r\n\t\t \t\t\r\n\t\t \t\tif (st.ttype == StreamTokenizer.TT_NUMBER) {\r\n\t\t \t\t\tInstructionsRead++;\r\n\t\t \t\t\tif (!instFound) {//this is either label or instruction field\r\n\t\t \t\t\t\t//before anything, search optab to see if this might be the opcode\r\n\t\t \t\t\t\t//if it is an opcode, send it to the opcode processing function\r\n\t\t \t\t\t\tif (NtoString(st.nval).equals(\"WORD\") || NtoString(st.nval).equals(\"BYTE\")){//these are the directives... not technically instructions, but they go in the instruction field\r\n\t\t \t\t\t\t\tresCount = 0;\r\n\t\t \t\t\t\t\tif (NtoString(st.nval).equals(\"WORD\")){\r\n\t\t \t\t\t\t\t\tif (hexDigitCount >= 55){\r\n\t\t \t\t\t\t\t\t\tnewTHandle();\r\n\t\t \t\t\t\t\t\t}\r\n\t\t \t\t\t\t\t\thexDigitCount += 6;\r\n\t\t \t\t\t\t\t}\r\n\t\t \t\t\t\t\tif (NtoString(st.nval).equals(\"BYTE\")){\r\n\t\t \t\t\t\t\t\tconstantCaseB = true;\r\n\t\t \t\t\t\t\t}\r\n\t\t \t\t\t\t\tinstFound = true;\r\n\t\t \t\t\t\t\tprocessOpcodeN(st);\r\n\t\t \t\t\t\t}\r\n\t\t \t\t\t\tif (NtoString(st.nval).equals(\"RESW\") || NtoString(st.nval).equals(\"RESB\")){//these are the directives... not technically instructions, but they go in the instruction field\r\n\t\t \t\t\t\t\tresCount++;\r\n\t\t \t\t\t\t\tnewTHandle();\r\n\t\t \t\t\t\t\tinstFound = true;\r\n\t\t \t\t\t\t\tprocessOpcodeN(st);\r\n\t\t \t\t\t\t}\r\n\t\t \t\t\t\telse if (optab.searchOpcode(\"\" + st.nval)) {\r\n\t\t \t\t\t\t\tresCount = 0;\r\n\t\t \t\t\t\t\tif (hexDigitCount >= 55){\r\n\t \t\t\t\t\t\t\tnewTHandle();\r\n\t \t\t\t\t\t\t}\r\n\t\t \t\t\t\t\thexDigitCount += 6;\r\n\t\t \t\t\t\t\tinstFound = true;\r\n\t\t \t\t\t\t\tprocessOpcodeN(st);\r\n\t\t \t\t\t\t\t//InstructionsRead++;\r\n\t\t \t\t\t\t}\r\n\t\t \t\t\t\telse {\r\n\t\t \t\t\t\t\tprocessLabelN(st);\r\n\t\t \t\t\t\t}\r\n\t\t \t\t\t\t\r\n\t\t \t\t\t}\r\n\t\t \t\t\telse{ //this is the operand field\r\n\t\t \t\t\t\tprocessOperandN(st);\r\n\t\t \t\t\t}\r\n\t\t \t\t}\r\n\t\t \t\t\r\n\t\t \tif (moveOn){\r\n\t\t \tst.nextToken(); //read next token in current line\r\n\t\t \t}\r\n\t\t \t}\r\n\t\t \t////write line just finished to IF eventually\r\n\t\t if (moveOn){\r\n\t\t st.nextToken(); //read first token of next line\t\r\n\t\t }\r\n\t\t }\r\n\t\t programLength = (locctr - startAddress); \r\n\t\t programLength2 = programLength;\r\n\t\t System.out.println(\" !!prgmlngth2:\" + Integer.toHexString(programLength2.intValue()));\r\n\t\t /*\r\n\t\t sProgramLength = Integer.toHexString(programLength2.intValue());\r\n\t\t for (int i = 0; i<(6-sProgramLength.length()); i++){\r\n\t\t \tmyWriter.write(\"0\");\r\n\t\t }\r\n\t\t myWriter.write(sProgramLength);\r\n\t\t myWriter.close();\r\n\t\t ////myWriter.close();\r\n\t\t \r\n\t\t */\r\n\t\t r.close();\r\n\t\t System.out.println(\"?????!?!?!?!?ALPHA?!?!?!?!?!??!?!?!\");\r\n\t\t if (hexDigitCount/2 < 16){\r\n\t\t \tlineLength.add(\"0\" + Integer.toHexString(hexDigitCount/2));\r\n\t\t }\r\n\t\t else{\r\n\t\t lineLength.add(Integer.toHexString(hexDigitCount/2));\r\n\t\t }\r\n\t\t for (int i = 0; i<lineLength.size(); i++){\r\n\t\t System.out.println(lineLength.get(i));\r\n\t\t }\r\n\t\t // System.out.println(hexDigitCount);\r\n\t\t ReadIF pass2 = new ReadIF(this.optab,this.symtab,this.startAddress2,this.programLength2,this.name,this.lineLength,this.userArg);\r\n\t\t return st.sval;\r\n\t\t \r\n\t\t\r\n\r\n\t}","public void readFromFile() {\n\n\t}","private void checkFile() {\n \ttry {\n \t\tdata = new BufferedReader(\n \t\t\t\t new FileReader(textFile));\n \t\t\n \t}\n \tcatch(FileNotFoundException e)\n \t{\n \t\tSystem.out.println(\"The mentioned File is not found.\");\n System.out.println(\"\");\n\t\t\tSystem.exit(1);\n\t\t} catch (Exception ex) {\n\t\t\tSystem.out.println(\"The following error occured while reading the file.\");\n\t\t\tex.printStackTrace();\n\t\t\tSystem.exit(2);\n\t\t}\n }","public List<CorruptionIndex> readFromFile(String filePath){\n return null;\n }","public void read() {\n String line = \"\";\n int counter = 0;\n try {\n input = new BufferedReader(new FileReader(file));\n while (line != null) {\n if (!(line.equals(\"arglebargle\"))) {//not a default\n names.add(line);\n }\n }\n input.close();\n }\n catch (IOException e) {\n }\n }","public void parseFile() {\n File file = new File(inputFile);\n try {\n Scanner scan = new Scanner(file);\n\n while (scan.hasNextLine()) {\n String line = scan.nextLine();\n line = line.replaceAll(\"\\\\s+\", \" \").trim();\n\n if (line.isEmpty()) {\n continue;\n }\n // System.out.println(line);\n String cmd = line.split(\" \")[0];\n String lineWithoutCmd = line.replaceFirst(cmd, \"\").trim();\n // System.out.println(lineWithoutCmd);\n\n // The fields following each command\n String[] fields;\n\n switch (cmd) {\n case (\"add\"):\n fields = lineWithoutCmd.split(\"<SEP>\");\n fields[0] = fields[0].trim();\n fields[1] = fields[1].trim();\n fields[2] = fields[2].trim();\n add(fields);\n break;\n case (\"delete\"):\n\n fields = split(lineWithoutCmd);\n delete(fields[0], fields[1]);\n break;\n case (\"print\"):\n if (lineWithoutCmd.equals(\"ratings\")) {\n printRatings();\n break;\n }\n fields = split(lineWithoutCmd);\n\n print(fields[0], fields[1]);\n\n break;\n case (\"list\"):\n // need to check if it is the movie or reviewer\n fields = split(lineWithoutCmd);\n list(fields[0], fields[1]);\n break;\n case (\"similar\"):\n // need to check if it is the movie or reviewer\n fields = split(lineWithoutCmd);\n similar(fields[0], fields[1]);\n break;\n default:\n break;\n }\n\n }\n\n }\n catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n }","public void readInput(String fileName){\n\n BufferedReader reader;\n try {\n reader = new BufferedReader(new FileReader(fileName));\n String line = reader.readLine(); //read first line\n int numLine =1; //keep track the number of line\n while (line != null) {\n String[] tokens = line.trim().split(\"\\\\s+\"); //split line into token\n if(numLine==1){ //for the first line\n intersection = Integer.parseInt(tokens[0]); //set the number of intersection\n roadways = Integer.parseInt(tokens[1]); // set the number of roadways\n coor = new Coordinates[intersection];\n g = new Graph(intersection);//create a graph\n line = reader.readLine();\n numLine++;\n }\n else if(numLine>1&&numLine<intersection+2){ //for all intersection\n while(numLine>1&&numLine<intersection+2){\n tokens = line.trim().split(\"\\\\s+\");\n coor[Integer.parseInt(tokens[0])] = new Coordinates(Integer.parseInt(tokens[1]),Integer.parseInt(tokens[2])); //add into coor array to keep track the coor of intersection\n line = reader.readLine();\n numLine++;\n }\n }\n else if(numLine ==intersection+2){ //skip the space line\n line = reader.readLine();\n numLine++;\n while(numLine<roadways+intersection+3){ // for all the roadways, only include the number of roadways mention in the first line\n tokens = line.trim().split(\"\\\\s+\");\n int fst = Integer.parseInt(tokens[0]);\n int snd = Integer.parseInt(tokens[1]);\n g.addEgde(fst,snd,coor[fst].distTo(coor[snd]));\n line = reader.readLine();\n numLine++;\n }\n }\n else if(numLine >= roadways+intersection+3)\n break;\n }\n reader.close();\n } catch (FileNotFoundException e){\n e.printStackTrace();\n } catch (IOException e) {\n e.printStackTrace();\n }\n }","private void readFromFile(){\n\t\t\n\t\ttry {\n\t\t\tFile file=new File(\"controller.txt\");\n\t\t\tFileInputStream fin;\n\t\t\tfin = new FileInputStream(file);\n\t\t\tDataInputStream din=new DataInputStream(fin);\n\t\t\tBufferedReader br=new BufferedReader(new InputStreamReader(din));\n\t\t\t\n\t\t\tfor(int i=0; i<2; i++){\n\t\t\t\tif(i==0)\n\t\t\t\t\tcodedUserName=br.readLine();\n\t\t\t\telse \n\t\t\t\t\tcodedPassword=br.readLine();\n\t\t\t}\n\t\t\t\n\t\t} catch (FileNotFoundException e) {\n\t\t\t// TODO Auto-generated catch block\n\t\t\te.printStackTrace();\n\t\t} catch (IOException e) {\n\t\t\t// TODO Auto-generated catch block\n\t\t\te.printStackTrace();\n\t\t}\n\t\t\n\t}","public int[] readBasicInfo() throws IOException\n\t{\n\t\t//Creates a FileReader and BufferedReader to read from the file that you pass it\n\t\tFileReader fr = new FileReader(path);\n\t\tBufferedReader textReader = new BufferedReader(fr);\n\t\t\n\t\t//Creates a new array to read the first line of data to (is an array because need to convert to int list)\n\t\tString textData;\n\t\t\n\t\t//Reads the first line of the text file into the array\n\t\ttextData = textReader.readLine();\n\t\t\n\t\tint[] data = new int[5];\n\t\t//Create a holding variable that will help to convert the String list over to an int list\n\t\tString[] tempList = new String[6];\n\t\t//List of deliminations that will be parsed out of the read strings in the string list that the function is passed\n\t\tString delims = \"[,()]+\";\n\t\t//Splits the strings from the file by the parenthesis and the commas\n\t\ttempList = textData.split(delims);\n\t\tfor (int i = 1; i < tempList.length; i++)\n\t\t\tdata[i-1] = Integer.parseInt(tempList[i]);\n\t\t\n\t\t//Returns the array containing the first line of the text file\n\t\treturn data;\n\t}","TraceList read(File file) throws IOException;","private boolean readFile(String fileName) {\n Message msg = new Message();\n FileInputStream fis;\n InputStreamReader isr;\n BufferedReader br;\n int depCount = 0;\n int depIndex = 0;\n float xIndex = 0;\n float yIndex = 0;\n int dist = 0;\n int capacity = 0;\n File file = new File(fileName);\n\n try {\n //open the requested file\n fis = new FileInputStream(file);\n isr = new InputStreamReader(fis);\n br = new BufferedReader(isr);\n } catch (Exception e) {\n System.err.println(\"File is not present \" + file);\n\n return false;\n }\n\n String line;\n StringTokenizer st = null;\n\n try {\n br.readLine(); // skip text labels\n line = br.readLine(); // depot constraints\n st = new StringTokenizer(line);\n\n // skip text labels\n br.readLine();\n } catch (IOException ex) {\n System.err.println(\"Error reading depot file: \" + fileName + \": \" +\n ex);\n }\n\n try {\n depCount = Integer.parseInt(st.nextToken().trim());\n dist = Integer.parseInt(st.nextToken().trim());\n capacity = Integer.parseInt(st.nextToken().trim());\n } catch (NumberFormatException ex) {\n System.err.println(\"Error processing depot constraint info: \" + ex);\n }\n\n //process depots\n for (int i = 0; i < depCount; i++) {\n try {\n line = br.readLine();\n st = new StringTokenizer(line);\n } catch (IOException ex) {\n System.err.println(\"Error reading depot file: \" + fileName +\n \": \" + ex);\n }\n\n //read the depot information\n try {\n depIndex = Integer.parseInt(st.nextToken().trim());\n xIndex = Float.parseFloat(st.nextToken().trim());\n yIndex = Float.parseFloat(st.nextToken().trim());\n } catch (NumberFormatException ex) {\n System.err.println(\"Error processing depot coordinate info: \" +\n ex);\n }\n\n // build the message\n msg.addArgument(IndexTag, \"\" + depIndex);\n msg.addArgument(XCoordTag, \"\" + xIndex);\n msg.addArgument(YCoordTag, \"\" + yIndex);\n }\n\n //save max distance and capacity\n if (dist == 0) { //if no max distance, set to a large number...\n dist = 999999999;\n }\n\n if (capacity == 0) { //if there is no maximum capacity, set it to a very large number\n capacity = 999999999;\n }\n\n // build the message\n msg.addArgument(NumberOfDepotsTag, \"\" + depCount);\n msg.addArgument(MaxCapacityTag, \"\" + capacity);\n msg.addArgument(MaxDistanceTag, \"\" + dist);\n msg.addArgument(FileNameTag, fileName);\n\n zAdapt.setProblemConstraints(msg);\n\n return true;\n }","public void fileRead() {\n\t\tString a, b;\n\t\t\n\t\twhile (input.hasNext()) {\n\t\t\ta = input.next();\n\t\t\tb = input.next();\n\t\t\tSystem.out.printf(\"%s %s\\n\", a, b);\n\t\t}\n\t}","Points(String filepath){\n readPointsFile(filepath); //dengan file points.txt\n }","private static void fileRead(String file) {\n\t\ttry {\n\t\t\tBufferedReader br = new BufferedReader(new FileReader(file));\n\t\t\tString line = \"\";\n\t\t\twhile((line=br.readLine())!=null) {\n\t\t\t\tString data[] = line.split(\"\\\\t\");\n\t\t\t\tint id = Integer.parseInt(data[0]);\n\t\t\t\tint groundTruth = Integer.parseInt(data[1]);\n\t\t\t\tactualClusters.put(id, groundTruth);\n\t\t\t\tArrayList<Double> temp = new ArrayList<>();\n\t\t\t\tfor(int i=2;i<data.length;i++) {\n\t\t\t\t\ttemp.add(Double.parseDouble(data[i]));\n\t\t\t\t}\n\t\t\t\tcols = data.length-2;\n\t\t\t\tgeneAttributes.put(id, temp);\n\t\t\t\tallClusters.add(id+\"\");\n\t\t\t\ttotalGenes++;\n\t\t\t}\n\t\t\ttotalCluster = totalGenes;\n\t\t\tbr.close();\n\t\t} catch(Exception e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}","public static void main(String[] args) throws IOException {\n\t\t\n\t\tString folder = \"/Users/haopeng/Dropbox/research/2nd/Usecase/Yanlei/\";\n\t\tString fileName = \"P0_2324.txt\";\n\t\t\n\t\tFileReader reader = new FileReader(folder + fileName, 20000000);\n\t\treader.parseFile();\n\t\t\n\t\t//reader.printValues(reader.getServerName(), \"ServerName\");\n\t\t//reader.printValues(reader.getCommand(), \"Command\");\n\t\t//reader.printValues(reader.getTimestamp(), \"Timestamp\"); \n\t\t//reader.printValues(reader.getPath(), \"Path\");\n\t\treader.printValues(reader.getMethod(), \"Method\");\n\t}","public static void main(String[] args) throws FileNotFoundException {\n\t\tSkipList<String, Rectangle> list = new SkipList<String, Rectangle>();\n\t\tString file = args[0];\n\t\tScanner scan = new Scanner(new File(file));\n\t\t// FileProcessor fp = new FileProcessor();\n\t\t// fp.fileParser(line);\n\t\ttry {\n\t\t\tString lineReader = \"\";\n\t\t\twhile (scan.hasNextLine()) {\n\t\t\t\tlineReader = scan.nextLine();\n\t\t\t\t// regex string delimeter we need to figure out to get rid of excess whitespace\n\t\t\t\t// between parameters in text file\n\t\t\t\tString CMD = lineReader.trim();\n\t\t\t\tString[] lineCMD = CMD.split(\"\\\\s+\");\n\t\t\t\t// switch statement for all situations\n\t\t\t\tswitch (lineCMD[0]) {\n\t\t\t\tcase \"insert\":\n\t\t\t\t\tString name = lineCMD[1];\n\t\t\t\t\tint xCord = Integer.parseInt(lineCMD[2]);\n\t\t\t\t\tint yCord = Integer.parseInt(lineCMD[3]);\n\t\t\t\t\tint width = Integer.parseInt(lineCMD[4]);\n\t\t\t\t\tint height = Integer.parseInt(lineCMD[5]);\n\t\t\t\t\tRectangle rect = new Rectangle(name, xCord, yCord, width, height);\n\t\t\t\t\tKVPair<String, Rectangle> item = new KVPair<String, Rectangle>(name, rect);\n\t\t\t\t\tif (width <= 0 || height <= 0 || (xCord + width > 1024) || (xCord + width < 0)\n\t\t\t\t\t\t\t|| (yCord + height > 1024) || (yCord + height < 0) || (xCord < 0) || (yCord < 0)) {\n\t\t\t\t\t\tSystem.out.println(\"Rectangle rejected: (\" + name + \", \" + xCord + \", \" + yCord + \", \" + width\n\t\t\t\t\t\t\t\t+ \", \" + height + \")\");\n\t\t\t\t\t} else {\n\t\t\t\t\t\tlist.insert(name, rect);\n\t\t\t\t\t\tSystem.out.println(\"Rectangle Inserted: (\" + name + \", \" + xCord + \", \" + yCord + \", \" + width\n\t\t\t\t\t\t\t\t+ \", \" + height + \")\");\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase \"remove\":\n\t\t\t\t\t// System.out.println(scan.nextLine());\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase \"regionsearch\":\n\t\t\t\t\t// System.out.println(scan.nextLine());\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase \"intersections\":\n\t\t\t\t\t// System.out.println(scan.nextLine());\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase \"search\":\n\t\t\t\t\t// System.out.println(scan.nextLine());\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase \"dump\":\n\t\t\t\t\tSystem.out.println(\"SkipList dump: \");\n\t\t\t\t\tbreak;\n\n\t\t\t\t}\n\t\t\t\tSystem.out.println(lineCMD[0]);\n\t\t\t}\n\t\t}\n\t\t// line = scan.nextLine();\n\t\tcatch (Exception e) {\n\t\t\te.printStackTrace();\n\t\t}\n\n\t\t// String line = scan.nextLine();\n\t\t// System.out.println(line);\n\t\t// System.out.println(file);\n\t\t// fileParser(file);\n\t\t// Rectangle1 rect = new Rectangle1();\n\n\t}","private ArrayList<String> parseFile(String file_name){ // extract each line from file AS string (stopList)\r\n ArrayList<String> list = new ArrayList<>();\r\n Scanner scanner = null;\r\n try{\r\n scanner = new Scanner(new BufferedReader(new FileReader(file_name)));\r\n while (scanner.hasNextLine())\r\n {\r\n list.add(scanner.nextLine());\r\n }\r\n }\r\n catch (Exception e ){ System.out.println(\"Error reading file -> \"+e.getMessage()); }\r\n finally {\r\n if(scanner != null ){scanner.close();} // close the file\r\n }\r\n return list;\r\n }","private void loadInformation(){\n\t\ttry{\n\t\t\tFileReader fr = new FileReader(\"SpaceProgramGaussDistribution.txt\");\n\t\t\tBufferedReader br = new BufferedReader(fr);\n\t\t\tScanner sc = new Scanner(br);\n\t\t\t\n\t\t\tString info = \"\";\n\t\t\t\n\t\t\twhile(sc.hasNextLine()){\n\t\t\t\tinfo += sc.nextLine();\n\t\t\t}\n\t\t\t\n\t\t\tString split[] = info.split(\"#\");\n\t\t\t\n\t\t\tfor(int i = 0; i < split.length; i++){\n\t\t\t\tpopulationInfo += split[i]+\"\\n\";\n\t\t\t}\n\t\t\tsc.close();\n\t\t\tbr.close();\n\t\t\tfr.close();\n\t\t\t\n\t\t}catch(Exception e){\n\t\t\tSystem.out.println(\"File not found: SpaceProgramGaussDistribution.txt\");\n\t\t}\n\t}","private void readFile() {\r\n\t\tScanner sc = null; \r\n\t\ttry {\r\n\t\t\tsc = new Scanner(inputFile);\t\r\n\t\t\twhile(sc.hasNextLine()){\r\n\t\t\t\tgrade.add(sc.nextLine());\r\n\t } \r\n\t\t}\r\n\t\tcatch (FileNotFoundException e) {\r\n\t\t\te.printStackTrace();\r\n\t\t}\r\n\t\tfinally {\r\n\t\t\tsc.close();\r\n\t\t}\t\t\r\n\t}","@SuppressWarnings(\"AccessingNonPublicFieldOfAnotherObject\")\n\t// Accessing final fields of a private inner class that is not exported\n\tprivate void processFile(boolean initial)\n\t{\n\t\tlog(Level.INFO, \"Processing MOTD file \" + f.getPath());\n\t\tBufferedReader in = null;\n\t\tMessage curr = null;\n\t\tfinal LinkedList<Message> stack = new LinkedList<Message>();\n\n\t\ttry\n\t\t{\n\t\t\tin = new BufferedReader(new FileReader(f));\n\n\t\t\twhile (in.ready())\n\t\t\t{\n\t\t\t\tString line = in.readLine().trim();\n\n\t\t\t\tif (line.charAt(0) == '#') continue;\n\t\t\t\tif (line.equals(\"[Message]\"))\n\t\t\t\t{\n\t\t\t\t\tif (curr != null) stack.push(curr);\n\t\t\t\t\tcurr = new Message();\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tif (curr == null) continue;\n\t\t\t\tint div = line.indexOf('=');\n\t\t\t\tif (div == -1) continue;\n\n\t\t\t\tString field = line.substring(0,div).toLowerCase();\n\t\t\t\tString value = line.substring(div+1);\n\n\t\t\t\tif (field.equals(\"id\"))\n\t\t\t\t{\n\t\t\t\t\tcurr.id = Integer.parseInt(value);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (initial) continue; // We only care for ids in initial pass\n\t\t\t\tif (field.equals(\"active\"))\n\t\t\t\t{\n\t\t\t\t\tcurr.active = Boolean.valueOf(value);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (field.equals(\"title\"))\n\t\t\t\t{\n\t\t\t\t\tcurr.title = value;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (field.equals(\"short\"))\n\t\t\t\t{\n\t\t\t\t\tcurr.mshort = value;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (field.equals(\"long\"))\n\t\t\t\t{\n\t\t\t\t\tcurr.mlong = value;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (field.equals(\"from\"))\n\t\t\t\t{\n//\t\t\t\t\tcurr.from = new Date(value).getTime();\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (field.equals(\"to\"))\n\t\t\t\t{\n//\t\t\t\t\tcurr.to = new Date(value).getTime();\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (field.equals(\"posterid\"))\n\t\t\t\t{\n\t\t\t\t\tcurr.poster_uid = value;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (field.equals(\"postername\"))\n\t\t\t\t{\n\t\t\t\t\tcurr.poster_name = value;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (field.equals(\"showunix\")) continue;\n\n\t\t\t\tlog(Level.WARNING, \"Unknown Field '\" + field + \"'\");\n\t\t\t}\n\t\t}\n\t\tcatch (IOException ex)\n\t\t{\n\t\t\tlog(Level.WARNING, ex);\n\t\t}\n\t\tcatch (Throwable ex)\n\t\t{\n\t\t\tlog(Level.SEVERE, ex.getMessage());\n\t\t}\n\t\tfinally\n\t\t{\n\t\t\ttry\n\t\t\t{\n\t\t\t\tin.close();\n\t\t\t}\n\t\t\tcatch (IOException ex)\n\t\t\t{\n\t\t\t}\n\t\t}\n\n\t\tif (curr != null) stack.push(curr);\n\t\tlastModified = f.lastModified();\n\n\t\tif (initial)\n\t\t{\n\t\t\tif (stack.size() > 0) lastId = stack.getLast().id;\n\t\t\treturn;\n\t\t}\n\t\tfor (Message m : stack)\n\t\t{\n\t\t\tif (m.id > lastId)\n\t\t\t{\n\t\t\t\tlog(Level.INFO, \"Sending MOTD Notice #\" + m.id);\n\t\t\t\tgetInstance().message(channel, m.toString());\n\t\t\t\tlastId = m.id;\n\t\t\t}\n\t\t}\n\t}","public void readFile()\r\n\t{\r\n\t\t\r\n\t\ttry\r\n\t\t{\r\n\t\t\tx = new Scanner(new File(\"clean vipr measles results.txt\"));\r\n\t\t\t\r\n\t\t\twhile (x.hasNext())\r\n\t\t\t{\r\n\t\t\t\tString a = x.next();\r\n\t\t\t\tString b = x.next();\r\n\t\t\t\tString c = x.next();\r\n\t\t\t\t\r\n\t\t\t\tSystem.out.printf(\"%s %s %s \\n\\n\", a,b,c);\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\tx.close();\r\n\t\t}\r\n\t\tcatch (Exception e)\r\n\t\t{\r\n\t\t\tSystem.out.println(\"file not found\");\r\n\t\t}\r\n\t\r\n\t}","public String read(String user, String action) throws FileNotFoundException, IOException {\r\n\t\tString filename = user + \".txt\";\r\n \tString absoluteFilePath = \"\";\r\n\t\tString workingDirectory = System.getProperty(\"user.dir\");\r\n\t\tArrayList<String> create = new ArrayList<String>();\r\n\t\tArrayList<String> logged = new ArrayList<String>();\r\n\t\tArrayList<String> updated = new ArrayList<String>();\r\n\t\tArrayList<String> removed = new ArrayList<String>();\r\n\t\t\r\n\t\t\r\n\t\t//absoluteFilePath = workingDirectory + System.getProperty(\"file.separator\") + filename;\r\n\t\tabsoluteFilePath = workingDirectory + File.separator + filename;\r\n\t\ttry(BufferedReader br = new BufferedReader(new FileReader(absoluteFilePath))) {\r\n\t\t StringBuilder sb = new StringBuilder();\r\n\t\t String line = br.readLine();\r\n\t\t \r\n\t\t while (line != null) {\r\n\t\t \t\r\n\t\t \t\r\n\t\t \tString arr[] = line.split(\" \");\r\n\t\t \tString firstWord = arr[0];\r\n\t\t \tif(firstWord.equals(\"'Created\"))\r\n\t\t {\r\n\t\t \t\r\n\t\t \tcreate.add(line);\r\n\t\t \t\r\n\t\t }\r\n\t\t \t\r\n\t\t \telse if(firstWord.equals(\"'Logged\"))\r\n\t\t {\r\n\t\t \t\r\n\t\t \tlogged.add(line);\r\n\t\t \t\r\n\t\t }\r\n\t\t \t\r\n\t\t \telse if(firstWord.equals(\"'Updated\"))\r\n\t\t {\r\n\t\t \t\r\n\t\t \tupdated.add(line);\r\n\t\t \t\r\n\t\t }\r\n\t\t \t\r\n\t\t \telse if(firstWord.equals(\"'Removed\"))\r\n\t\t {\r\n\t\t \t\r\n\t\t \tremoved.add(line);\r\n\t\t \t\r\n\t\t }\r\n\t\t \t\r\n\t\t \r\n\t\t line = br.readLine();\r\n \r\n\t\t }\r\n\t\t \r\n\t\t \r\n\t\t if(action==\"logged\")\r\n\t\t {\r\n\t\t for(String d : logged)\r\n\t\t {\r\n\t\t \tsb.append(\"<p style='font-size: 80%'>\");\r\n\t\t\t sb.append(d);\r\n\t\t\t sb.append(\"</p>\");\r\n\t\t }\r\n\t\t }\r\n\t\t \r\n\t\t \r\n\t\t else if(action==\"create\")\r\n\t {\r\n\t\t for(String d : create)\r\n\t\t {\r\n\t\t \tsb.append(\"<p style='font-size: 80%'>\");\r\n\t\t\t sb.append(d);\r\n\t\t\t sb.append(\"</p>\");\r\n\t\t \t\r\n\t\t }\r\n\t } \r\n\t\t \r\n\t\r\n\t\t else if(action==\"update\")\r\n\t {\r\n\t\t for(String d : updated)\r\n\t\t {\r\n\t\t \tsb.append(\"<p style='font-size: 80%'>\");\r\n\t\t\t sb.append(d);\r\n\t\t\t sb.append(\"</p>\");\r\n\t\r\n\t\t }\r\n\t }\r\n\t\t \r\n\t\t \r\n\t\t \r\n\t\t else if(action==\"remove\") \r\n\t\t {\r\n\t\t for(String d : removed)\r\n\t\t {\r\n\t\t \tsb.append(\"<p style='font-size: 80%'>\");\r\n\t\t\t sb.append(d);\r\n\t\t\t sb.append(\"</p>\");\r\n\t\r\n\t\t }\r\n\t\t }\r\n\t\t \r\n\t\t \r\n\t\t String everything = sb.toString();\r\n\t\t return everything;\r\n\t\t} \r\n\t}","public void readFile();","public Set<ContextualActivity> read() {\n Set<ContextualActivity> defaultActivities = new HashSet<ContextualActivity>();\n try {\n\n Scanner s = new Scanner(input);\n while (s.hasNextLine()) {\n // verb, noun, locations, times, duration\n String infos[] = (s.nextLine()).split(\",\");\n\n Set<String> locations = new HashSet<String>();\n Collections.addAll(locations, infos[2].split(Cons.ENTRY_SEPARATOR_REG));\n\n Set<TimeOfDay> times = new HashSet<TimeOfDay>();\n for (String tm : infos[3].split(Cons.ENTRY_SEPARATOR_REG)) {\n try {\n times.add(TimeOfDay.valueOf(tm.toUpperCase()));\n }\n catch (Exception e){\n }\n }\n\n defaultActivities.add(new DefaultActivity(infos[0], infos[1], locations, times, infos[4]));\n }\n\n return defaultActivities;\n } catch (Exception e) {\n e.printStackTrace();\n }\n return defaultActivities;\n }","private void checkMaze(File inputFile) throws FileNotFoundException\r\n ,IllegalStateException {\r\n boolean hasStart=false,hasGoal=false;\r\n Scanner readFile= new Scanner(inputFile);\r\n String line;\r\n char c;\r\n while(readFile.hasNextLine()){\r\n line= readFile.nextLine();\r\n for(int i=0;i<line.length();i++){\r\n c=line.charAt(i);\r\n\r\n if (c!='S'&&c!='G'&&c!='*'&&c!=' ')\r\n throw new IllegalStateException(\r\n \"File holds invalid symbols\");\r\n if(c==START)\r\n hasStart=true;\r\n if(c==GOAL)\r\n hasGoal=true;\r\n }\r\n }\r\n\r\n if(!hasStart||!hasGoal)\r\n throw new IllegalStateException(\"Maze missing necessary values\");\r\n\r\n readFile.close();\r\n }","boolean input(String filename){\n\t\tScanner in = null;\n\t\tString word;\n\t\ttry {\t\t\t\n\t\t\tin=new Scanner(new BufferedReader(new FileReader(filename)));\n\t\t\t//in=new Scanner(new FileReader(filename));\n\t\t\tif(in.hasNext())\n\t\t\t\tword=in.next();\n\t\t\telse return false;\n\t\t\tif(word.equals(\"//tokens\")){\n\t\t\t\tif(in.hasNext())\n\t\t\t\t\tword=in.next();\n\t\t\t\twhile(!word.equals(\"//reserved\")){\t\t\t\t\t\n\t\t\t\t\tString token_name= word;\n\t\t\t\t\tif(in.hasNext())\n\t\t\t\t\t\tword=in.next();\n\t\t\t\t\telse return false;\n\t\t\t\t\tString token_RE=word;\n\t\t\t\t\tRegexPattern ptn=new RegexPattern(token_name,token_RE);\t\t//to be modified\n\t\t\t\t\ttable_pt.add(ptn);\n\t\t\t\t\tif(in.hasNext())\n\t\t\t\t\t\tword=in.next();\n\t\t\t\t\telse return false;\n\t\t\t\t}\n\t\t\t\tif(in.hasNext())\n\t\t\t\t\tword=in.next();\n\t\t\t\twhile(!word.equals(\"//operator\")){\t\t\t\t\t\n\t\t\t\t\tString name= word;\n\t\t\t\t\tif(in.hasNext())\n\t\t\t\t\t\tword=in.next();\n\t\t\t\t\telse return false;\n\t\t\t\t\tString value=word;\n\t\t\t\t\tReservedWord res=new ReservedWord(name,value);\t\t\n\t\t\t\t\ttable_res.add(res);\n\t\t\t\t\tif(in.hasNext())\n\t\t\t\t\t\tword=in.next();\n\t\t\t\t\telse return false;\n\t\t\t\t}\n\t\t\t\tif(in.hasNext())\n\t\t\t\t\tword=in.next();\n\t\t\t\twhile(!word.equals(\"//end\")){\t\t\t\t\t\n\t\t\t\t\tString name= word;\n\t\t\t\t\tif(in.hasNext())\n\t\t\t\t\t\tword=in.next();\n\t\t\t\t\telse return false;\n\t\t\t\t\tString value=word;\n\t\t\t\t\tReservedWord rsv=new ReservedWord(name,value);\t\t\n\t\t\t\t\ttable_res.add(rsv);\n\t\t\t\t\ttable_op.add(rsv);\n\t\t\t\t\tif(in.hasNext())\n\t\t\t\t\t\tword=in.next();\n\t\t\t\t\telse return false;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\telse return false;\n\t\t} catch (FileNotFoundException e) {\n\t\t\te.printStackTrace();\t\t\t\n\t\t}finally{\n\t\t\tin.close();\n\t\t}\n\t\treturn true;\t\t\n\t}","public static void main(String[] args) throws IOException {\n\n fileReader(\"endpoints1.txt\", \"endpoints2.txt\");\n\n /* First Test Case Completed with Correct Files */\n\n /*===============================================/*\n\n /* Second Test Case With Valid and Invalid Files */\n\n// fileReader(\"endpoints1.txt\", \"invalidpoints.txt\");\n\n /* Second Test Case Completed with one Invalid File */\n\n /*===============================================/*\n\n /* Third Test Case With Invalid Files */\n\n// fileReader(\"invalidpoints.txt\", \"endpoints2.txt\");\n\n /* Third Test Case Completed with Invalid File */\n\n }","public static void readLocations() throws ProgressionException\n\t{\n\t\t//File file = GeoDis_GUI.inputfile;\n\t\t//infilename = file.getPath();\n\t\t//System.err.println(file.getPath());\n\t\t//infile = new TextInputStream(file.getPath());\n\t\tlogfile.print(\"\\nReading geographical locations ...\");\n\t\tinfile = new TextInputStream(GeoDis.infilename);\n\t\t\n\t\tdataName = infile.readLine(); \n\t\t//System.err.println (dataName);\n \t\n\t\tnumLocations = infile.readInt(); \n\t\t//System.err.println(numLocations);\n\t\n\t\n\t\tlocationName = new String[numLocations]; \n\t\tsampleSize = new int[numLocations]; \n\t\tLatitude = new double[numLocations]; \n\t\tLongitude = new double[numLocations]; \n\t\t\n\t\tfor(j = 0; j < numLocations; j++)\n\t\t{\n\t\t\t//trash = infile.readLine(); // read the \\n character in PC's\n\t\t\t\n\t\t\tlocationName[j] = infile.readLine(); \n\n\t\t\tif (locationName[j].length() == 0)\t\t\t\n\t\t\t\tlocationName[j] = infile.readLine(); \n\t\t\t\n\t\t\tsampleSize[j] = infile.readInt();\n\n\n\t\t\tif (usingDecimalDegrees) \n\t\t\t{\n\t\t\t\tLatitude[j] = infile.readFloat();\n\t\t\t\tLongitude[j] = infile.readFloat();\n\t\t\t}\t\n\n\t\t\telse\n\t\t\t{\n\t\t\t\tlat_deg = infile.readInt();\n\t\t\t\tlat_min = infile.readInt();\n\t\t\t\tlat_sec = infile.readInt();\n\t\t\t\tlat_coor = infile.readWord();\n\t\t\t\tlon_deg = infile.readInt();\n\t\t\t\tlon_min = infile.readInt();\t\t\t\t\n\t\t\t\tlon_sec = infile.readInt();\n\t\t\t\tlon_coor = infile.readWord();\n\t\t\t\n\t\t\t\t//System.err.println (sampleSize[j] + \" \" + lat_deg + \" \" + lat_min + \" \" + lat_sec + \" \" + lat_coor + \" \" + \n\t\t\t\t //lon_deg + \" \" + lon_min + \" \" + lon_sec + \" \" + lon_coor);\n\t\t\t\t\n\t\t\t\tdec_lat = (double)lat_deg + ((double)lat_min/60.0) + ((double)lat_sec/3600.0);\n\t\t\t\tdec_lon = (double)lon_deg + ((double)lon_min/60.0) + ((double)lon_sec/3600.0);\n\t\t\t\t\n\n\t\t\t\tif (lat_coor.equalsIgnoreCase(\"N\"))\n\t\t\t\t\tLatitude[j] = dec_lat;\n\t\t\t\telse if (lat_coor.equalsIgnoreCase(\"S\"))\n\t\t\t\t\tLatitude[j] = -1.0 * dec_lat; \n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tStringBuffer str = new StringBuffer();\n\t\t\t\t\tstr.append(\"The letter for the latitude is neither N nor S.\");\n\t\t\t\t\tstr.append(\"\\nNote that latitude should come before longitude.\");\n\t\t\t\t\tif(!Mediator.isCommandLineApp()){\n\t\t\t\t\t\tJOptionPane.showMessageDialog(frame,\"The letter for the latitude is neither N nor S.\" + \n\t\t \t\t\t\"\\n Note that latitude should come before longitude\",\n \t\t\t\"GeoDis warning\", JOptionPane.WARNING_MESSAGE);\n\t\t\t\t \t\t//frame.dispose();\t\t\t\t\n\t\t\t\t\t\t//System.exit(0);\n\t\t\t\t\t\tthrow new ProgressionException(str.toString());\n\t\t\t\t\t} else {\n\t\t\t\t\t\tstr.append(\"[GeoDis]\\n\");\n\t\t\t\t\t\tMediator.writeError(str.toString());\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t\n\n\t\t\t\tif (lon_coor.equalsIgnoreCase(\"E\"))\n\t\t\t\t\tLongitude[j] = dec_lon;\n\t\t\t\telse if (lon_coor.equalsIgnoreCase(\"W\"))\n\t\t\t\t\tLongitude[j] = -1.0 * dec_lon;\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tStringBuffer str = new StringBuffer();\n\t\t\t\t\tstr.append(\"The letter for the longitude is neither E nor W.\");\n\t\t\t\t\tstr.append(\"\\nNote that latitude should come before longitude.\");\n\t\t\t\t\tif(!Mediator.isCommandLineApp()){\n\t\t\t\t\t\tJOptionPane.showMessageDialog(frame,\"The letter for the longitude is neither E nor W.\" + \n\t\t \t\t\t\"\\n See that latitude come first than longitude\",\n \t\t\t\"GeoDis warning\", JOptionPane.WARNING_MESSAGE);\n\t\t\t\t \t\t//frame.dispose();\t\t\t\t\n\t\t\t\t\t\t//System.exit(0);\n\t\t\t\t\t\tthrow new ProgressionException(str.toString());\n\t\t\t\t\t} else {\n\t\t\t\t\t\tstr.append(\"[GeoDis]\\n\");\n\t\t\t\t\t\tMediator.writeError(str.toString());\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif (locationName[i] == null || sampleSize[i] <= 0 || Latitude[j] > 90 || Latitude[j]< -90 || Longitude[j] < -180 || Longitude[j] > 180) \n\t\t\t{\n\t\t\t\t\n\t\t\t\tif (locationName[i] == null)\n\t\t\t\t\tif(!Mediator.isCommandLineApp()){\n\t\t\t\t\t\tSystem.err.println (\"\\nlocationName [i] == null\");\n\t\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif (sampleSize[i] <= 0)\n\t\t\t\t\tif(!Mediator.isCommandLineApp()){\n\t\t\t\t\t\tSystem.err.println (\"\\nsampleSize[i] <= 0\");\n\t\t\t\t\t}\n\n\t\t\t\tif (Latitude[j] > 90)\n\t\t\t\t\tif(!Mediator.isCommandLineApp()){\n\t\t\t\t\t\tSystem.err.println (\"\\nLatitude[j] > 90\");\n\t\t\t\t\t}\n\n\t\t\t\tif (Latitude[j]< -90)\n\t\t\t\t\tif(!Mediator.isCommandLineApp()){\n\t\t\t\t\t\tSystem.err.println (\"\\nLatitude[j]< -90\");\n\t\t\t\t\t}\n\n\t\t\t\tif (Longitude[j] < -180)\n\t\t\t\t\tif(!Mediator.isCommandLineApp()){\n\t\t\t\t\t\tSystem.err.println (\"\\nLongitude[j] < -180\");\n\t\t\t\t\t}\n\n\t\t\t\tif (Longitude[j] > 180)\n\t\t\t\t\tif(!Mediator.isCommandLineApp()){\n\t\t\t\t\t\tSystem.err.println (\"\\nLongitude[j] > 180\");\n\t\t\t\t\t}\n\n\t\t\t\tStringBuffer str = new StringBuffer();\n\t\t\t\tstr.append(\"There was an error reading the population description\");\n\t\t\t\tstr.append(\"\\nor its coordinates. If your coordinates are in decimal degrees, have you checked that box?\");\n\t\t\t\tif(!Mediator.isCommandLineApp()){\n\t\t\t\t\tJOptionPane.showMessageDialog(frame,\"There was an error reading the population description\" +\n\t\t\t\t\t\t\"\\nor its coordinates. If your coordinates are in decimal degrees, have you checked that box?\",\n \"GeoDis warning\", JOptionPane.WARNING_MESSAGE);\n\t\t\t\t\t//frame.dispose();\t\t\t\t\n\t\t\t\t\t//System.exit(0);\n\t\t\t\t\tthrow new ProgressionException(str.toString());\n\t\t\t\t} else {\n\t\t\t\t\tstr.append(\"[GeoDis]\\n\");\n\t\t\t\t\tMediator.writeError(str.toString());\n\t\t\t\t}\n\t\t\t}\n\t\t\tlogfile.print(\"\\nreading \" + locationName[j] + \" \" + sampleSize[j] + \" \");\n\t\t\tlogfile.printf(\" %6.4f\",Latitude[j]);\n\t\t\tlogfile.printf(\" %6.4f\",Longitude[j]);\n\t\t\t//System.err.println (locationName[j]);\n\t\t\t//System.err.println(sampleSize[j] + \" \" + Latitude[j] + \" \" + Longitude[j]);\t\t\t\n\t\t}\n\n\t \t/* TRANSFORM DEGREES TO RADIANS */\n\t\tfor(j = 0; j < numLocations; j++)\n\t\t{\n\t\t\tLatitude[j] *= D2R;\n\t\t\tLongitude[j] *= D2R;\n\t\t} \n\t\tlogfile.println(\"\\nOK\");\n\n \t}","public static void main(String[] args) {\n String timestamp;\n TrafficSnapshotHolder counter = new TrafficSnapshotHolder();\n try (FileReader fr = new FileReader(\"data/traffic1.txt\");\n BufferedReader br = new BufferedReader(fr)) {\n while ((timestamp = br.readLine()) != null) {\n counter.add(extractInfo(timestamp));\n }\n }\n catch (FileNotFoundException e) {\n e.printStackTrace();\n }\n catch (IOException e) {\n e.printStackTrace();\n }\n if(counter.isEmpty()){\n System.out.println(\"File at location is empty, please check file\");\n System.exit(0);\n }\n counter.processSnapshots();\n }","public void fileInformation(String filePath){\n File myFile = new File(filePath);\n if (myFile.exists()) {\n System.out.println(\"File name: \"+myFile.getName());\n System.out.println(\"Absolute path: \"+ myFile.getAbsolutePath());\n System.out.println(\"Writeable: \"+myFile.canWrite());\n System.out.println(\"Readable: \"+myFile.canRead());\n System.out.println(\"File size in bytes: \"+myFile.length());\n } else {\n System.out.println(\"File does not exists\");\n }\n }","public static void ReadAchievements()\n {\n try\n {\n BufferedReader file = new BufferedReader(new FileReader(achievements_file_name));\n int actualLine = 0, nb_achievements_done = 0;\n while(actualLine<Achievement.NB_ACHIEVEMENTS)\n {\n boolean currentValue = Utilities.IntToBool(Integer.parseInt(file.readLine()));\n Achievement.achievements_done[actualLine] = currentValue;\n if(currentValue)\n nb_achievements_done++;\n actualLine++;\n }\n file.close();\n Achievement.nb_achievements_done = nb_achievements_done;\n Achievement.CheckAllAchievements();\n } \n catch (Exception e) { SaveAchievements(); }\n }","public String check_loginFile(){\n String text=\"\";\n try{\n FileInputStream fileInputStream=context.openFileInput(Constant.LOGIN_FILE);\n Scanner obj=new Scanner(fileInputStream);\n obj.useDelimiter(\",\");\n while(obj.hasNext())\n text=obj.next();\n obj.close();\n fileInputStream.close();\n }\n catch (FileNotFoundException e){\n //Constant.IS_CREATE_DATABASE=false;\n //Message.logMessages(\"FILE: \",String.valueOf(Constant.IS_CREATE_DATABASE));\n return \"not logged in\";\n }\n catch (Exception e){\n Message.logMessages(\"ERROR: \",e.toString());\n }\n return text;\n }","private static void info ( File f ) {\n\tString nume = f . getName () ;\n\tif( f.isFile () )\n\tSystem.out.println ( \" Fisier : \" + nume ) ;\n\telse\n\tif( f.isDirectory () )\n\tSystem.out.println ( \" Director : \" + nume ) ;\n\tSystem.out.println (\n\t\" Cale absoluta : \" + f.getAbsolutePath () +\n\t\" \\n Poate citi : \" + f.canRead () +\n\t\" \\n Poate scrie : \" + f.canWrite () +\n\t\" \\n Parinte : \" + f.getParent () +\n\t\" \\n Cale : \" + f.getPath () +\n\t\" \\n Lungime : \" + f.length () +\n\t\" \\n Data ultimei modificari : \" +\n\tnew Date ( f.lastModified () ) ) ;\n\tSystem.out.println ( \" --------------\" ) ;\n\t}","public void readFile(File file){\n try{\n scan = new Scanner(file);\n while(scan.hasNextLine()){\n String line = scan.nextLine();\n if(line.startsWith(\"//\")){\n continue;\n }\n process(line);\n }\n }catch(IOException e){\n Alert alert = new Alert(AlertType.INFORMATION);\n alert.setTitle(\"\");\n alert.setHeaderText(null);\n alert.setContentText(\"Oops the input was not read properly\");\n alert.showAndWait();\n e.printStackTrace();\n }catch(NullPointerException e){\n Alert alert = new Alert(AlertType.INFORMATION);\n alert.setTitle(\"\");\n alert.setHeaderText(null);\n alert.setContentText(\"Oops the input was not read properly\");\n alert.showAndWait();\n e.printStackTrace();\n \n }\n }","private void parse() throws IOException {\n\n\t\tStats statsObject = new Stats();\n\n\t\tstatsObject.setProcessName(process);\n\n\t\tList<String> lines = Files.readAllLines(Paths.get(filename), Charset.defaultCharset());\n\n\t\tPattern timePattern = Pattern.compile(\"((\\\\d+)-)*(\\\\d+)\\\\W((\\\\d+):)*(\\\\d+)\\\\.(\\\\d+)\");\n\n\t\tSystem.out.println(filename+\" \"+lines.get(0));\n\t\tMatcher matcher = timePattern.matcher(lines.get(0));\n\t\twhile (matcher.find()) {\n\t\t\tstatsObject.setStartTime(matcher.group(0));\n\t\t\tbreak;\n\t\t}\n\n\t\tmatcher = timePattern.matcher(lines.get(lines.size() - 1));\n\t\twhile (matcher.find()) {\n\t\t\tstatsObject.setEndTime(matcher.group(0));\n\t\t\tbreak;\n\t\t}\n\t\tString error = new String();\n\t\tfor (String line : lines) {\n\n\t\t\tif (line.startsWith(\"[\")) {\n\t\t\t\tif (!error.isEmpty()) {\n\t\t\t\t\tstatsObject.addError(error);\n\t\t\t\t\terror = \"\";\n\t\t\t\t}\n\n\t\t\t\tif (line.contains(\"Number of records processed: \")) {\n\n\t\t\t\t\tPattern numberPattern = Pattern.compile(\"\\\\d+\");\n\t\t\t\t\tmatcher = numberPattern.matcher(line);\n\t\t\t\t\t\n\t\t\t\t\tString numberOfRecordsProcessed = \"N/A\";\n\t\t\t\t\t\n\t\t\t\t\twhile (matcher.find()) {\n\t\t\t\t\t\tnumberOfRecordsProcessed = matcher.group();\n\t\t\t\t\t}\n\t\t\t\t\tstatsObject.setRecordsProcessed(numberOfRecordsProcessed);\n\n\t\t\t\t}\n\n\t\t\t\telse if (line.contains(\"WARNING\")) {\n\t\t\t\t\tif (line.contains(\"MISSING Property\")) {\n\t\t\t\t\t\tstatsObject.incrementErrorCounter();\n\t\t\t\t\t\tstatsObject.addError(line);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tstatsObject.incrementWarningCounter();\n\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t} else if (line.contains(\"Exception\") || (line.contains(\"Error\"))) {\n\t\t\t\tif (!error.isEmpty()) {\n\t\t\t\t\tstatsObject.addError(error);\n\t\t\t\t\terror = \"\";\n\t\t\t\t}\n\t\t\t\tstatsObject.incrementErrorCounter();\n\t\t\t\terror = error + line;\n\t\t\t} else {\n\t\t\t\terror = error + line ;\n\t\t\t}\n\n\t\t}\n\t\t// reader.close();\n\t\tif (statsObject.getErrorCounter() > 0) {\n\t\t\tstatsObject.setStatus(\"Failure\");\n\t\t}\n\n\t\tPattern pattern = Pattern.compile(\"\\\\d\\\\d\\\\d\\\\d\\\\d\\\\d\\\\d\\\\d\");\n\t\tmatcher = pattern.matcher(filename);\n\t\tString date = null;\n\t\twhile (matcher.find()) {\n\t\t\tdate = matcher.group(0);\n\t\t\tbreak;\n\t\t}\n\t\tboolean saveSuccessful = OutputManipulator.addToStatFile(username, process, date, statsObject);\n\n\t\tif (saveSuccessful) {\n\t\t\tFileParseScheduler.addSuccessfulParsedFileName(username, process, filename);\n\t\t}\n\n\t\tFileParseScheduler.removeLatestKilledThreads(process + filename);\n\t}","public List<List<String>> read () {\n List<List<String>> information = new ArrayList<>();\n try (BufferedReader br = new BufferedReader(new FileReader(path))) {\n int aux = 0;\n while ((line = br.readLine()) != null) {\n String[] data = line.split(split_on);\n List<String> helper = new ArrayList<>();\n helper.add(data[0]);\n helper.add(data[1]);\n information.add(helper);\n }\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n } catch (IOException e) {\n e.printStackTrace();\n } finally {\n if (br != null) {\n try {\n br.close();\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n }\n return information;\n }","public void readFile(File file) {\n\ttry (BufferedReader br = new BufferedReader(new FileReader(file)))\n\t{\n\n\t\tString sCurrentLine;\n\t\tString [] lineElements;\n\t\t\n\t\t// read the headlines\n\t\tsCurrentLine = br.readLine();\n\t\tlineElements = sCurrentLine.split(\"\\\\s+\");\n\t\tnumVertices = Integer.parseInt(lineElements[1]);\n\t\tsCurrentLine = br.readLine();\n\t\tlineElements = sCurrentLine.split(\"\\\\s+\");\n\t\tnumPaths = Integer.parseInt(lineElements[1]);\n\t\tsCurrentLine = br.readLine();\n\t\tlineElements = sCurrentLine.split(\"\\\\s+\");\n\t\ttmax = Double.parseDouble(lineElements[1]);\n\t\t\n//\t\tSystem.out.println(numVertices + \", \" + numPaths + \", \" + tmax);\n\n\t\t/* read benefits1 */\n\t\tint index = 0;\n\t\twhile ((sCurrentLine = br.readLine()) != null) {\n//\t\t\t\tSystem.out.println(sCurrentLine);\n\t\t\tlineElements = sCurrentLine.split(\"\\\\s+\");\n\t\t\tdouble x = Double.parseDouble(lineElements[0]);\n\t\t\tdouble y = Double.parseDouble(lineElements[1]);\n\t\t\tList<Double> scores = new ArrayList<Double>();\n\t\t\tfor (int i = 2; i < lineElements.length; i++) {\n\t\t\t\tdouble score = Double.parseDouble(lineElements[i]);\n\t\t\t\tscores.add(new Double(score));\n\t\t\t}\n\t\t\tPOI POI = new POI(index, x, y, scores);\n\t\t\t//POI.printMe();\n\t\t\t\n\t\t\tvertices.add(POI);\n\t\t\tindex ++;\n\t\t}\n\t\t\n\t\t// create the arcs and the graph\n\t\tfor (int i = 0; i < vertices.size(); i++) {\n\t\t\tfor (int j = 0; j < vertices.size(); j++) {\n\t\t\t\tArc arc = new Arc(vertices.get(i), vertices.get(j));\n\t\t\t\tarcs.add(arc);\n\t\t\t\tgraph.put(new Tuple2<POI, POI>(vertices.get(i), vertices.get(j)), arc);\n\t\t\t}\n\t\t}\n\t} catch (IOException e) {\n\t\te.printStackTrace();\n\t}\n}","private static String readParseOutput(String fileName, int mode) throws IOException {\n\t\tStringBuffer stringBuffer = new StringBuffer();\n\t\tStringBuffer errorBuffer = new StringBuffer();\n\t\tFileReader fileReader = new FileReader(fileName);\n\t\tBufferedReader bufferedReader = new BufferedReader(fileReader);\n\t\tScanner fileScanner = new Scanner(bufferedReader);\n\t\tint fileStage = 0;\n\n\t\twhile (fileScanner.hasNextLine()) {\n\t\t\tString s = fileScanner.nextLine();\n\n\t\t\tif (s.equals(\"** Basic block: 0 **\")) {\n\t\t\t\tfileStage = 0;\n\t\t\t}\n\t\t\t// Beginning of Live Range info\n\t\t\telse if (s.startsWith(\"<<---- Live Ranges ---->>\")) {\n\t\t\t\tfileStage = 1;\n\t\t\t}\n\t\t\t// uninitialized variable warning\n\t\t\telse if (s.startsWith(\"WARNING: possible uninitialized local variable index\")) {\n\t\t\t\tfileStage = 2;\n\t\t\t}\n\t\t\telse if (s.startsWith(\"<<---- Optimized code ---->>\")) {\n\t\t\t\tfileStage = 3;\n\t\t\t}\n\n\t\t\t// store instruction, ignoring instruction number\n\t\t\tif (fileStage == 0) {\t\t// CFG, only look at pred/succ info\n\t\t\t\tif (mode == 0 && s.contains(\"Successors\")) {\n\t\t\t\t\tstringBuffer.append(s + \"\\n\");\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (fileStage == 1) {\t\t// Live range, ignore instruction\n\t\t\t\tif (mode > 0) {\n\t\t\t\t\tint idx = s.indexOf(\":\");\n\t\t\t\t\tif (idx > 3)\n\t\t\t\t\t\tstringBuffer.append(s.substring(0, idx-3));\n\t\t\t\t\telse\n\t\t\t\t\t\tstringBuffer.append(s);\n\t\t\t\t\tstringBuffer.append(\"\\n\");\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (fileStage == 2) {\t\t// Look at all warnings\n\t\t\t\tif (mode == 2 && s.contains(\"uninitialized\")) {\n\t\t\t\t\tstringBuffer.append(s + \"\\n\");\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (fileStage == 3) {\t\t\t// Opt code, ignore instruction #\n\t\t\t\tif (mode == 3) {\n\t\t\t\t\tint idx = s.indexOf(\":\");\n\t\t\t\t\tstringBuffer.append(s.substring(idx+1));\n\t\t\t\t\tstringBuffer.append(\"\\n\");\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfileScanner.close();\n\t\tString result;\n\t\tresult = stringBuffer.toString() + \"\\n\";\n\t\treturn result;\n\t}","public void checkFile() {\n\t\tFile file = new File(\"src/Project11Problem1Alternative/names.txt\");\n\t\tSystem.out.println(file.exists() ? \"Exists!\" : \"Doesn't exist!\");\n\t\tSystem.out.println(file.canRead() ? \"Can read!\" : \"Can't read!\");\n\t\tSystem.out.println(file.canWrite() ? \"Can write!\" : \"Can't write!\");\n\t\tSystem.out.println(\"Name: \" + file.getName());\n\t\tSystem.out.println(\"Path: \" + file.getPath());\n\t\tSystem.out.println(\"Size: \" + file.length() + \" bytes\");\n\t}","public int readTrials() throws Exception\n {\n return fileHandler.readInt(file);\n }","public NexusReaderDistances(String filePath) throws IOException, NexusFormatException {\n\n BufferedReader bufferedReader = null;\n FileReader fileReader = null;\n try {\n fileReader = new FileReader(filePath);\n bufferedReader = new BufferedReader(fileReader);\n\n int state = 0; //0=start of file, 1=after #NEXUS. 2=inside block\n boolean commentMode = false;\n TreeMap<Integer, String> blockLines = null;\n String blockName = null;\n Matcher beginBlockMatcher = Pattern.compile(\"^(?i)BEGIN ([A-Z]+);\").matcher(\"\");\n String line = bufferedReader.readLine();\n int lineNumber = 0;\n while (line != null) {\n lineNumber++;\n line = line.trim();\n //end multiline comments\n if (commentMode) {\n int endIndex = line.indexOf(\"]\");\n if (endIndex == -1) {\n line = bufferedReader.readLine();\n continue;\n } else {\n line = line.substring(endIndex);\n commentMode = false;\n }\n }\n //remove one line comments\n line = line.replaceAll(\"\\\\[.*]\", \"\");\n //remove multi line comments\n int startIndex = line.indexOf(\"[\");\n if (startIndex != -1) {\n line = line.substring(0, startIndex);\n commentMode = true;\n }\n //skip emtpy lines\n if (line.isEmpty()) {\n line = bufferedReader.readLine();\n continue;\n }\n\n //===read lines===\n switch (state) { //0=start of file, 1=after #NEXUS. 2=inside block\n case 0:\n if (!line.equalsIgnoreCase(\"#NEXUS\")) {\n throw new NexusFormatException(\"File must start with #NEXUS. Line: \" + lineNumber);\n } else {\n state++;\n }\n break;\n case 1:\n beginBlockMatcher.reset(line);\n if (beginBlockMatcher.matches()) {\n blockLines = new TreeMap<Integer, String>();\n blockName = beginBlockMatcher.group(1);\n state++;\n } else {\n throw new NexusFormatException(\"Error parsing BEGIN statement. Line \" + lineNumber);\n }\n break;\n case 2:\n if (line.equalsIgnoreCase(\"END;\")) {\n makeBlock(blockName, blockLines);\n state--;\n } else {\n blockLines.put(lineNumber, line);\n }\n break;\n default:\n throw new RuntimeException(\"NexusReader reached illegal state: \" + state);\n }\n\n line = bufferedReader.readLine();\n }\n if (state == 2) {\n throw new NexusFormatException(\"Didn't close block at end of file.\");\n }\n if (state == 0) {\n throw new NexusFormatException(\"File seems empty.\");\n }\n\n bufferedReader.close();\n\n } catch (IOException e) {\n if (bufferedReader != null) {\n bufferedReader.close();\n }\n if (fileReader != null) {\n fileReader.close();\n }\n throw e;\n } catch (NexusFormatException e) {\n if (bufferedReader != null) {\n bufferedReader.close();\n }\n if (fileReader != null) {\n fileReader.close();\n }\n throw e;\n }\n }","public static void main(String[] args) {\n Path file = Paths.get (\"courses.txt\");\n// line n1\n /* Assume the courses.txt is accessible.\n Which code fragment can be inserted at line n1 to enable the code to print the content of the*/\n //courses.txt file?\n /* A. List<String> fc = Files.list(file);\n fc.stream().forEach (s - > System.out.println(s));\n B. Stream<String> fc = Files.readAllLines (file);\n fc.forEach (s - > System.out.println(s));\n // C. List<String> fc = readAllLines(file);\n //fc.stream().forEach (s - > System.out.println(s));\n D. Stream<String> fc = Files.lines (file);///answer\n fc.forEach (s - > System.out.println(s));*/\n }","static void read()\n\t\t{\n\n\n\t\t\tString content=new String();\n\t\t\ttry {\n\t\t\t\tFile file=new File(\"Dic.txt\");\n\t\t\t\tScanner scan=new Scanner(file);\n\t\t\t\twhile(scan.hasNextLine()) {\n\t\t\t\t\tcontent=scan.nextLine();\n\t\t\t\t//\tSystem.out.println(content);\n\n\t\t\t\t//\tString [] array=content.split(\" \");\n\t\t\t\t\tlist.add(content.trim());\n\n\t\t\t\t}\n\t\t\t\tscan.close(); \n\t\t\t}\n\t\t\tcatch (Exception e) {\n\t\t\t\tSystem.out.println(e);\n\t\t\t}\n\n\n\t\t}","private void ReadFile(String filePath) throws IOException{\n File file = new File(filePath);\n BufferedReader b = new BufferedReader(new FileReader(file));\n int lineNumber = 1;\n String line = \"\";\n line = b.readLine();\n while (line != null) {\n // analyze the line only when it is not empty and it is not a comment\n String trimLine = line.toString().trim();\n if(trimLine.length() != 0 && !trimLine.substring(0, 1).equals(\"/\") && !trimLine.substring(0, 1).equals(\"#\")){\n // line.toString().trim(): eliminate heading and tailing whitespaces\n // but add one whitespace to the end of the string to facilitate token manipulation\n // under the circumstances that there is only one token on one line, e.g. main\n AnalyzeByLine(line.toString().trim() + \" \", lineNumber);\n }\n lineNumber++;\n line = b.readLine();\n }\n arrL.add(new Token(\"end of file\", 255, lineNumber));\n// for(int i = 0; i < arrL.size(); i++){\n// System.out.println(arrL.get(i).getCharacters() + \" \" + arrL.get(i).getValue() + \" \" + arrL.get(i).getLineNum());\n// }\n }","public static void main(String[] args) throws FileNotFoundException, IOException {\n FileInputStream fis=new FileInputStream(\"g:/data/info.txt\");\r\n //step-2 (read the data from stream)\r\n int n=fis.available(); //it gives you no of bytes available for reading in stream\r\n System.out.println(\"Total Bytes Available : \"+n);\r\n byte b[]=new byte[n];\r\n fis.read(b); //will take 1st byte from stream and store to b[0], 2nd to b[1], 3rd to b[2]\r\n //converting bytes to String\r\n String st=new String(b);\r\n System.out.println(st);\r\n //step-3 (close the stream)\r\n fis.close();\r\n }","public MapMessage processFile(File file) {\r\n\t\ttry {\r\n\r\n\t\t\tScanner input = new Scanner(file);\r\n\r\n\t\t\twhile (input.hasNext()) {\r\n\t\t\t\tString line = input.nextLine();\r\n\t\t\t\tif (!line.isEmpty()) {\r\n\t\t\t\t\tfileContent.append(line).append(\"\\n\");\r\n\t\t\t\t}\r\n\t\t\t}\r\n\r\n\t\t\tinput.close();\r\n\r\n\t\t} catch (FileNotFoundException ex) {\r\n\t\t\tex.printStackTrace();\r\n\t\t}\r\n\t\tMapMessage mapMessage = validateMap(fileContent.toString());\r\n\t\treturn mapMessage;\r\n\t}","private void readWeaponsFromFile(File file) throws IllegalStateException {\n\t\ttry {\n\t\t\tScanner fileScanner = new Scanner(file);\n\t\t\tboolean rangeMinB = false, rangeMaxB = false;\n\t\t\twhile (fileScanner.hasNext() && !(rangeMaxB && rangeMinB)) {\n\t\t\t\tString line = fileScanner.nextLine();\n\t\t\t\tif (line.equals(CHANCE_RANGE_MIN)) {\n\t\t\t\t\trangeMin = Integer.parseInt(fileScanner.nextLine());\n\t\t\t\t\trangeMinB = true;\n\t\t\t\t}\n\t\t\t\telse if (line.equals(CHANCE_RANGE_MAX)) {\n\t\t\t\t\trangeMax = Integer.parseInt(fileScanner.nextLine());\n\t\t\t\t\trangeMaxB = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\twhile (fileScanner.hasNext()) {\n\t\t\t\tString line = fileScanner.nextLine();\n\t\t\t\tif (line.equals(START_WEAPON)) {\n\t\t\t\t\treadWeapon(fileScanner);\n\t\t\t\t}\n\t\t\t}\n\t\t\tfileScanner.close();\n\t\t} catch (FileNotFoundException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\n\t\tint bottomRange = rangeMin;\n\t\twhile (bottomRange != rangeMax) {\n\t\t\tint tempBottomRange = bottomRange;\n\t\t\tfor (Weapon weapon: weapons) {\n\t\t\t\tif (weapon.spawnRangeMin == bottomRange) {\n\t\t\t\t\tbottomRange = weapon.spawnRangeMax;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (tempBottomRange == bottomRange) {\n\t\t\t\tthrow new IllegalStateException(\"There is a gap in the ranges of the weapons loaded from \" + file.getAbsolutePath());\n\t\t\t}\n\t\t}\n\t}","public static void processFile(File f) throws Exception {\n\t\ttry {\r\n\t\t\tBufferedReader bufRead = new BufferedReader(new InputStreamReader(\r\n\t\t\t\t\tnew FileInputStream(f)));\r\n\t\t\tString S1 = \"\";\r\n\t\t\twhile ((S1 = bufRead.readLine()) != null) {\r\n\t\t\t\t//System.out.println(S1);\r\n\t\t\t\tgetPubTypes(S1);\r\n\t\t\t\t//System.out.println();\r\n\t\t\t}\r\n\t\t\tbufRead.close();\r\n\t\t} catch (IOException ioe) {\r\n\t\t\tSystem.out.println(\"Something is wrong with reading file! \"\r\n\t\t\t\t\t+ \"Can't find the appropriate file!\");\r\n\t\t}\r\n\r\n\t\t// return allDiseases;\r\n\r\n\t}","public ScanReplace(String file, String startDir)\n {\n confFileName = file;\n startPath = Paths.get(startDir);\n fileSpec = \"*.*\";\n\n ReadConfig();\n\n System.out.println(\"Directory,Filename,Line Number, Sub Line Number, Matching Line\");\n FindFiles(startPath.toAbsolutePath());\n\n SummaryReport();\n }","public static Map<String, Integer> getStartingPositions(File file)\n\t\t\tthrows IOException, FileNotFoundException {\n\t\tMap<String, Integer> startPositions = new HashMap<String, Integer>();\n\t\ttry {\n\t\t\tString line;\n\t\t\tBufferedReader in;\n\t\t\tString extension = PdbHelper.getFileExtension(file);\n\t\t\tif (extension.equals(\"gz\")) {\n\t\t\t\tin = new BufferedReader(new InputStreamReader(\n\t\t\t\t\t\tnew GZIPInputStream(new FileInputStream(file))));\n\t\t\t} else {\n\t\t\t\tin = new BufferedReader(new FileReader(file));\n\t\t\t}\n\n\t\t\twhile ((line = in.readLine()) != null) {\n\t\t\t\tif (line.startsWith(\"DBREF \") || line.startsWith(\"DBREF1\")) {\n\t\t\t\t\tString chainLabel = line.substring(13 - 1, 13);\n\t\t\t\t\tint seqBegin = Integer.parseInt(line.substring(15 - 1, 18)\n\t\t\t\t\t\t\t.trim());\n\t\t\t\t\tstartPositions.put(chainLabel, seqBegin);\n\t\t\t\t\tif (line.startsWith(\"SEQADV \")) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tin.close();\n\t\t} catch (IOException e) {\n\t\t\tSystem.out.println(e);\n\t\t}\n\t\treturn startPositions;\n\t}","public static void load(Context context) throws IOException {\n // read the file\n String raw = File.readFile(\"vaccine.txt\", context);\n\n // clear the map and load contents of file into the map\n map.clear();\n for (String line : raw.split(\"\\n\")) {\n if (line.equals(\"\")) {\n continue;\n }\n String[] data = line.split(\",\");\n if (data[0].equals(\"\") || data.length != 3) {\n continue;\n }\n map.put(data[0], Boolean.getBoolean(data[1]));\n dateMap.put(data[0], data[2]);\n }\n }","public void readFile(String file)\n\t{\t\n\t\tfindPieces(file);\n\t}","public String readConquestFile(String filePath) {\n try {\n File inputMap = new File(filePath);\n String returnString;\n inputReader = new BufferedReader(new FileReader(inputMap));\n returnString=this.getGuiParameters(inputReader);\n if(!returnString.equals(\"SUCCESS\")) {\n return returnString;\n }\n String inputLine;\n int lineCounter = 6;\n while ((inputLine = inputReader.readLine()) != null) {\n if (lineCounter == 6) {\n if (inputLine.equals(\"[Continents]\")) {\n returnString= this.readContinentList(inputReader);\n if (!returnString.equals(\"SUCCESS\")) {\n return \"ONE OR MORE DUPLICATE CONTINENTS ENCOUNTERED\";\n }\n } else {\n return \"THE MAP FORMAT IS WRONG\";\n }\n lineCounter++;\n }\n returnString = this.readCountryList(inputReader);\n if (!returnString.equals(\"SUCCESS\")) {\n return returnString;\n }\n lineCounter++;\n }\n if(validator.isFullyLinked()) {\n returnString = \"SUCCESS\";\n } else {\n returnString = \"The Countries are not properly linked to each other\";\n }\n return returnString;\n }catch (FileNotFoundException e) {\n return \"THE FILE NOT FOUND\";\n }catch (IOException e) {\n return \"ERROR IN READING THE SPECIFIED FILE\";\n }\n }","public boolean readFile(){\n\t\tboolean counter=false;\n\t\t\ttry {\n\t FileReader reader = new FileReader(readFile);\n\t BufferedReader bufferedReader = new BufferedReader(reader);\n\t \n\t String line;\n\t \n\t while ((line = bufferedReader.readLine()) != null) {\n\t \tStringTokenizer st = new StringTokenizer(line,SEPARATOR);\n\t\t if (st.nextToken().equals(user) && st.nextToken().equals(password)) {\n\t\t \tcounter=true;\n\t\t \treturn counter;\n\t\t }\n\t\t else break;\n\t }\n\t reader.close();\n\t \n\t } catch (IOException e) {\n\t e.printStackTrace();\n\t }\n\t\t return counter;\n\t}","public boolean ParseExcellon(String fileName, DrillList drillList, DrillToolMap drillToolMap)\n {\n ILogWriter log= new ConsoleLogWriter();\n f=new FileOpration();\n f.Open(fileName);\n String s;\n s=SkipComments();\n if (s.compareTo(\"M48\")!=0)\n {\n log.Writeln(\"begin of header not found\");\n return false;\n }\n log.Writeln(s+\"\\t//header found at \"+f.getIndex());\n s=f.Readln();\n while (s.lastIndexOf(\";FILE_FORMAT=\")==-1)\n {\n s=f.Readln();\n if (s==null) return false;\n }\n log.Writeln(s+\"\\t//found decimal point position declaration at \"+ f.getIndex());\n try {\n digBeforePoint = Integer.parseInt(s.substring(s.lastIndexOf('=')+1,s.lastIndexOf(':')));\n log.Writeln(\"\\tamount of digts before point is setted to \"+digBeforePoint);\n int digAfterPointStartPosition=s.lastIndexOf(':')+1;\n digAfterPoint= Integer.parseInt(s.substring(digAfterPointStartPosition,s.indexOf(' ',digAfterPointStartPosition)));\n log.Writeln(\"\\tamount of digts after point is setted to \"+digAfterPoint);\n }\n catch (NumberFormatException | IndexOutOfBoundsException exc)\n {\n log.Writeln(\"invalid decimal point position declaration\");\n f.Close();\n return false;\n }\n /*catch (IndexOutOfBoundsException exc)\n {\n log.Writeln(\"invalid decimal point position declaration\");\n f.Close();\n return false;\n }*/\n s=SkipComments();\n switch (s.toUpperCase())\n {\n case \"METRIC\":\n metric=true;\n break;\n case \"INCH\":\n metric=false;\n break;\n default:\n log.Writeln(\"the type of measurement system not found\");\n return false;\n }\n log.Writeln(s+\"\\t//the type of measurement system found at \"+f.getIndex());\n log.Writeln(\"\\t the type of measurement system is setted to \"+ (metric?\"METRIC\":\"INCH\"));\n do\n {\n s=SkipComments();\n log.Writeln(s);\n if (s.charAt(0)=='%') break;\n try\n {\n String toolName = s.substring(0, s.indexOf('C'));\n double toolDiam=Double.parseDouble(s.substring(s.indexOf('C')+1));\n drillToolMap.AddTool(toolName,toolDiam);\n log.Writeln(\"\\t\"+toolName+\" with diameter \"+toolDiam+\" found at \"+f.getIndex());\n\n }\n catch (NumberFormatException | IndexOutOfBoundsException exc)\n {\n log.Writeln(\"invalid tool declaration at \"+f.getIndex());\n f.Close();\n return false;\n }\n\n } while (s.charAt(0)!='%');\n log.Writeln(\"end of header found at \"+f.getIndex());\n s = SkipComments();\n do {\n if (s==null)\n {\n log.Writeln(\"parsing completed without footer at \"+f.getIndex());\n f.Close();\n return false;\n }\n if (s.compareTo(\"T00\")==0)\n {\n log.Writeln(\"\\tFooter found at \"+f.getIndex());\n s = SkipComments();\n log.Writeln(s);\n if (s.compareTo(\"M30\")==0)\n {\n log.Writeln(\"\\tEnd of file found at \"+f.getIndex());\n f.Close();\n log.Writeln(\"\\tPARSING COMPLETED\");\n return true;\n }\n log.Writeln(\"parsing completed without footer at \"+f.getIndex());\n f.Close();\n return false;\n }\n log.Writeln(s);\n if (drillToolMap.GetToolDiam(s) == -1) {\n log.Writeln(\"invalid tool name found at \" + f.getIndex());\n f.Close();\n return false;\n }\n DrillFrame df=new DrillFrame();\n df.setDrillDiam(drillToolMap.GetToolDiam(s));\n log.Writeln(\"\\ttool \"+s+\" frame with tool diameter \"+ df.getDrillDiam()+\" found at \"+f.getIndex());\n double x=0,y=0;\n do\n {\n s=SkipComments();\n log.Writeln(s);\n try\n {\n String tempX=\"\",tempY=\"\";\n if (s.indexOf('X')!=-1)\n {\n if (s.indexOf('Y')!=-1)\n {\n tempX = s.substring(s.indexOf('X') + 1, s.indexOf('Y'));\n tempY = s.substring(s.indexOf('Y') + 1);\n }\n else\n {\n tempX = s.substring(s.indexOf('X') + 1);\n }\n }\n else\n {\n if (s.indexOf('Y')!=-1)\n {\n tempY = s.substring(s.indexOf('Y') + 1);\n }\n else\n {\n drillList.Add(df);\n break;\n }\n\n }\n if (tempX!=\"\")\n x=Double.parseDouble(tempX)/Math.pow(10,digAfterPoint);\n if (tempY!=\"\")\n y=Double.parseDouble(tempY)/Math.pow(10,digAfterPoint);\n df.addPoint(x,y);\n log.Writeln(\"\\tpoint (\"+Double.toString(x)+\",\"+Double.toString(y)+\") found at \"+f.getIndex());\n }\n catch (NumberFormatException | IndexOutOfBoundsException exc)\n {\n log.Writeln(\"invalid coordinate at \"+f.getIndex());\n f.Close();\n return false;\n }\n\n }while(true);\n }while (true);\n\n\n //f.Close();\n //return true;\n }","boolean hasCompleteFile();","private void readMetaData() throws AreaFileException {\r\n \r\n int i;\r\n// hasReadData = false;\r\n\r\n// if (! fileok) {\r\n// throw new AreaFileException(\"Error reading AreaFile directory\");\r\n// }\r\n\r\n dir = new int[AD_DIRSIZE];\r\n\r\n for (i=0; i < AD_DIRSIZE; i++) {\r\n try { dir[i] = af.readInt();\r\n } catch (IOException e) {\r\n status = -1;\r\n throw new AreaFileException(\"Error reading AreaFile directory:\" + e);\r\n }\r\n }\r\n position += AD_DIRSIZE * 4;\r\n\r\n // see if the directory needs to be byte-flipped\r\n\r\n if (dir[AD_VERSION] != VERSION_NUMBER) {\r\n McIDASUtil.flip(dir,0,19);\r\n // check again\r\n if (dir[AD_VERSION] != VERSION_NUMBER)\r\n throw new AreaFileException(\r\n \"Invalid version number - probably not an AREA file\");\r\n // word 20 may contain characters -- if small integer, flip it...\r\n if ( (dir[20] & 0xffff) == 0) McIDASUtil.flip(dir,20,20);\r\n McIDASUtil.flip(dir,21,23);\r\n // words 24-31 contain memo field\r\n McIDASUtil.flip(dir,32,50);\r\n // words 51-2 contain cal info\r\n McIDASUtil.flip(dir,53,55);\r\n // word 56 contains original source type (ascii)\r\n McIDASUtil.flip(dir,57,63);\r\n flipwords = true;\r\n }\r\n\r\n areaDirectory = new AreaDirectory(dir);\r\n\r\n // pull together some values needed by other methods\r\n navLoc = dir[AD_NAVOFFSET];\r\n calLoc = dir[AD_CALOFFSET];\r\n auxLoc = dir[AD_AUXOFFSET];\r\n datLoc = dir[AD_DATAOFFSET];\r\n numBands = dir[AD_NUMBANDS];\r\n linePrefixLength = \r\n dir[AD_DOCLENGTH] + dir[AD_CALLENGTH] + dir[AD_LEVLENGTH];\r\n if (dir[AD_VALCODE] != 0) linePrefixLength = linePrefixLength + 4;\r\n if (linePrefixLength != dir[AD_PFXSIZE]) \r\n throw new AreaFileException(\"Invalid line prefix length in AREA file.\");\r\n lineDataLength = numBands * dir[AD_NUMELEMS] * dir[AD_DATAWIDTH];\r\n lineLength = linePrefixLength + lineDataLength;\r\n numberLines = dir[AD_NUMLINES];\r\n\r\n if (datLoc > 0 && datLoc != McIDASUtil.MCMISSING) {\r\n navbytes = datLoc - navLoc;\r\n calbytes = datLoc - calLoc;\r\n auxbytes = datLoc - auxLoc;\r\n }\r\n if (auxLoc > 0 && auxLoc != McIDASUtil.MCMISSING) {\r\n navbytes = auxLoc - navLoc;\r\n calbytes = auxLoc - calLoc;\r\n }\r\n\r\n if (calLoc > 0 && calLoc != McIDASUtil.MCMISSING ) {\r\n navbytes = calLoc - navLoc;\r\n }\r\n\r\n\r\n // Read in nav block\r\n if (navLoc > 0 && navbytes > 0) {\r\n nav = new int[navbytes/4];\r\n newPosition = (long) navLoc;\r\n skipByteCount = (int) (newPosition - position);\r\n try {\r\n af.skipBytes(skipByteCount);\r\n } catch (IOException e) {\r\n status = -1;\r\n throw new AreaFileException(\"Error skipping AreaFile bytes: \" + e);\r\n }\r\n for (i=0; i<navbytes/4; i++) {\r\n try {\r\n nav[i] = af.readInt();\r\n } catch (IOException e) {\r\n status = -1;\r\n throw new AreaFileException(\"Error reading AreaFile navigation:\"+e);\r\n }\r\n }\r\n if (flipwords){\r\n flipnav(nav);\r\n }\r\n position = navLoc + navbytes;\r\n }\r\n\r\n // Read in cal block\r\n if (calLoc > 0 && calbytes > 0) {\r\n cal = new int[calbytes/4];\r\n newPosition = (long)calLoc;\r\n skipByteCount = (int) (newPosition - position);\r\n try {\r\n af.skipBytes(skipByteCount);\r\n } catch (IOException e) {\r\n status = -1;\r\n throw new AreaFileException(\"Error skipping AreaFile bytes: \" + e);\r\n }\r\n for (i=0; i<calbytes/4; i++) {\r\n try { \r\n cal[i] = af.readInt();\r\n } catch (IOException e) {\r\n status = -1;\r\n throw new AreaFileException(\"Error reading AreaFile calibration:\"+e);\r\n }\r\n }\r\n // if (flipwords) flipcal(cal);\r\n position = calLoc + calbytes;\r\n }\r\n\r\n // Read in aux block\r\n if (auxLoc > 0 && auxbytes > 0){\r\n aux = new int[auxbytes/4];\r\n newPosition = (long) auxLoc;\r\n skipByteCount = (int) (newPosition - position);\r\n try{\r\n af.skipBytes(skipByteCount);\r\n }catch (IOException e){\r\n status = -1;\r\n throw new AreaFileException(\"Error skipping AreaFile bytes: \" + e);\r\n }\r\n for (i = 0; i < auxbytes/4; i++){\r\n try{\r\n aux[i] = af.readInt();\r\n }catch (IOException e){\r\n status = -1;\r\n throw new AreaFileException(\"Error reading AreaFile aux block:\" + e);\r\n }\r\n }\r\n position = auxLoc + auxbytes;\r\n }\r\n\r\n // now return the Dir, as requested...\r\n status = 1;\r\n return;\r\n }","void readMap()\n {\n try {\n FileReader\t\tmapFile = new FileReader(file);\n StringBuffer\tbuf = new StringBuffer();\n int\t\t\t\tread;\n boolean\t\t\tdone = false;\n \n while (!done)\n {\n read = mapFile.read();\n if (read == -1)\n done = true;\n else\n buf.append((char) read);\n }\n \n mapFile.close();\n \n parseMap(buf.toString());\n \n } catch (Exception e) {\n ErrorHandler.displayError(\"Could not read the map file data.\", ErrorHandler.ERR_OPEN_FAIL);\n }\n }","private boolean canRead() {\n\t\treturn fileStatus;\n\t}","public Index[] readIndexes(File file){\t\t\n\t\ttry{\n\t\t\tFileReader reader = new FileReader(file);\n\t\t\tBufferedReader buff = new BufferedReader(reader);\n\n\t\t\tboolean eof = false;\t\t//stores if the end of the file (eof) has been reached\n\t\t\tint numberOfRecords = 0;\n\n\t\t\t/**\n\t\t\t * @mastery achieves SL mastery factor 6 with the while loop\n\t\t\t */\n\t\t\twhile(!eof){\n\t\t\t\tString line = buff.readLine();\n\n\t\t\t\t/**\n\t\t\t\t * @mastery achieves SL mastery factor 4 with the if/else selection block\n\t\t\t\t */\n\t\t\t\tif(line == null){\n\t\t\t\t\teof = true;\t\t//the end of the file has been reached\n\t\t\t\t} else {\n\t\t\t\t\tnumberOfRecords++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tbuff.close();\n\n\t\t\tIndex[] indexes = new Index[numberOfRecords];\n\n\t\t\tFileReader reader2 = new FileReader(file);\n\t\t\tBufferedReader buff2 = new BufferedReader(reader2);\n\n\t\t\tfor(int i=0;i<numberOfRecords;i++){\n\t\t\t\tString line = buff2.readLine();\n\t\t\t\tindexes[i] = new Index(line);\n\t\t\t}\n\n\t\t\tArrays.sort(indexes);\n\t\t\tbuff.close();\n\t\t\treader.close();\n\t\t\tbuff2.close();\n\t\t\treader2.close();\n\t\t\t\n\t\t\treturn indexes;\n\n\t\t} catch (Exception e){\n\t\t\treturn null;\n\t\t}\n\t}","public abstract void readFromFile( ) throws Exception;","public static void main(String[] args) throws IOException {\n\t\tPath filePath = Paths.get(\"/home/SLKTECHLABS/tarun.patel/git/DemoSlk/countline.txt\");\n\t\t \n\t\tmakeHiddenFile();\n\t\t\n\t}","private void parseFile(String fileName) {\n\t\ttry {\n\t\t\tBufferedReader bufferedReader = new BufferedReader(new FileReader(fileName));\n\t\t\tString line;\n\t\t\tint counter = 0;\n\t\t\tString lastMethod = null;\n\t\t\t\n\t\t\twhile ((line = bufferedReader.readLine()) != null) {\n\t\t\t\t\n\t\t\t\t// Logic for method consolidation\n\t\t\t\tif (line.contains(\"Method Call\")) {\n\t\t\t\t\tlastMethod = line.substring(line.indexOf(\"target=\")+7);\n\t\t\t\t\tlastMethod = lastMethod.substring(lastMethod.indexOf('#')+1).replace(\"\\\"\",\"\").trim();\n\t\t\t\t\tlastMethod = lastMethod + \":\" + counter++;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\tif (line.contains(\"Field Write\")) {\n\t\t\t\t\tString[] tokens = line.split(\",\");\n\t\t\t\t\t\n\t\t\t\t\tString object = tokens[4].substring(tokens[4].indexOf(\"=\") + 1).replace(\"\\\"\", \"\").trim();\n\t\t\t\t\tString field = tokens[5].substring(0, tokens[5].indexOf(\"=\")).replace(\"\\\"\", \"\").trim();\n\t\t\t\t\tString value = tokens[5].substring(tokens[5].indexOf(\"=\") + 1).replace(\"\\\"\", \"\").trim();\n\t\t\t\t\tString fld = object.replace(\"/\", \".\") + \".\" + field;\n\t\t\t\t\tevents.add(new Event(fld, value, lastMethod));\n\t\t\t\t\t\n\t\t\t\t\tallFields.add(fld);\n\t\t\t\t}\n//\t\t\t\tif (line.contains(\"Method Returned\")) {\n//\t\t\t\t\t//operations for this method ended\n//\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\tbufferedReader.close();\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\t}","public void readtabs(File f) {\r\n \tString str = new String();\r\n try{\r\n BufferedReader br = new BufferedReader(new FileReader(f.getAbsolutePath()));\r\n str = br.readLine();\r\n \r\n while((str = br.readLine()) != null){\r\n //str = str.replaceAll(\";\", \"\");\r\n String info[] = str.split(\";\");\r\n if(f.getName().equals(\"mdl_chat_messages.txt\")){\r\n \t//chat message id; chatid; userid; groupid; system; message; timestamp;\r\n \tmobileact ma = new mobileact(info[2].trim(), info[6].trim(), \"Chat Message\", info[5]);\r\n \tmobact.add(ma);\r\n }else if(f.getName().equals(\"mdl_forum_posts.txt\")){\r\n \t//id; discussion; parent; userid; created; modified; mailed; subject; message; \r\n \t//messageformat; messagetrust; attachment; totalscore; mailnow; \r\n \tmobileact ma = new mobileact(info[3].trim(), info[5].trim(), \"Forum Posts\", info[8].trim());\r\n \tmobact.add(ma);\r\n }else if(f.getName().equals(\"mdl_quiz_attempts.txt\")){\r\n \t//id; quiz; userid; attempt; uniqueid; layout; currentpage; \r\n \t//preview; state; timestart; timefinish; timemodified; timecheckstate; \r\n \t//sumgrades; needsupgradetonewqe; \r\n \tmobileact ma = new mobileact(info[2].trim(), info[11].trim(), \"Attempt Quiz\", info[8].trim());\r\n \tmobact.add(ma);\r\n }\r\n }\r\n br.close();\r\n }catch(Exception e){\r\n JOptionPane.showMessageDialog(null, \"read moodle log file failed.\", \"System Message\", JOptionPane.ERROR_MESSAGE);\r\n }\r\n }","public void getUserData()\n\t{\n\t\tint count; //Loop counter\n\t\tString pathname = filename;\n\t\t\n\t\tString div = \",\"; //Used to divide info.\n\t\tString [] userArray; //To hold divided info.\n\t\t\n\t\ttry {\n FileReader reader = new FileReader(pathname);\n BufferedReader bufferedReader = new BufferedReader(reader);\n \n String line;\n \n //While getting each line of the data file, BUT stops when USER data found.\n //Loop through each line and determine which user data to choose.\n while ((line = bufferedReader.readLine()) != null) {\n // System.out.println(\"User Data in file: \" + line);\n \n System.out.println(\"Checking User name in line of data ...\");\n \n //This divides the info in the data file into an array.\n userArray = line.split(div); \n \n \n if (User.equals(userArray[0]))\n \t{\n \t\tSystem.out.println(\"User Found: \" + User);\n \t\tuser_line = line;\n \t\t//Assigning data to class variables.\n \t\tUserPassword = userArray[1].trim(); //Assigning the password.\n \t\tDevice_ID = Integer.parseInt(userArray[2].trim()); //Assigning device ID.\n \t\tisLost = (Integer.parseInt(userArray[3].trim()) == 0) ? false : true;\n \t\t\n \t\t//This reads out information.\n \t\tfor (count = 0; count < userArray.length; count++)\n {\n \t\t\tSystem.out.println(\"INFO: \" + userArray[count]);\n }\n \t\tbreak;\n \t}\n System.out.println(\"========================================\");\n }\n reader.close();\n \n } catch (IOException e) {\n e.printStackTrace();\n }\n\t}","UploadInfo advancedUpload(AdvanceFile file);","public void readCategoryFile(File file) {\n\ttry (BufferedReader br = new BufferedReader(new FileReader(file)))\n\t{\n\t\tString sCurrentLine;\n\t\tString [] lineElements;\n\t\t\n\t\tint row = 0;\n\t\twhile ((sCurrentLine = br.readLine()) != null) {\n\t\t\t//System.out.println(sCurrentLine);\n\t\t\t\n\t\t\tlineElements = sCurrentLine.split(\"\\\\s+\");\n\t\t\t//System.out.println(lineElements.length);\n\t\t\tfor (int column = 0; column < lineElements.length; column++) {\t\t\n\t\t\t\t//System.out.println(column);\n\t\t\t\tint category = Integer.parseInt(lineElements[column]);\n\t\t\t\t//System.out.println(vertices.size());\n\t\t\t\tPOI v1 = vertices.get(row);\n\t\t\t\tPOI v2 = vertices.get(column);\n\t\t\t\t\n\t\t\t\tArc arc = getArc(v1, v2);\n\t\t\t\tif (!distMtx) {\n\t\t\t\t\tdouble distance = v1.distanceTo(v2);\n\t\t\t\t\tif (data == Dataset.VERBEECK) {\n\t\t\t\t\t\tdistance = distance / 5.0;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tdistance = distance / 10.0;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tarc.setLength(distance);\n\t\t\t\t}\n\t\t\t\tarc.setCategory(category);\n\t\t\t\tif (distConstraint) {\n\t\t\t\t\tarc.setSpeedTable(allOneSpeedTable);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tarc.setSpeedTable(speedTables.get(category));\n\t\t\t\t}\t\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\trow ++;\n\t\t}\n\t} catch (IOException e) {\n\t\te.printStackTrace();\n\t}\n}","private void ReadTextFile(String FilePath) {\n\t\t\n\t\t\n\t}","private List<String> findAnts(String inputFileName) {\n\nList<String> lines = new ArrayList<>();\ntry {\nBufferedReader br = new BufferedReader(new FileReader(inputFileName));\nString line = br.readLine();\nwhile (line != null) {\nlines.add(line);\nline = br.readLine();\n}\n} catch (Exception e) {\n\n}\n\nchar[] splitLineByLetterOrDigit;\nList<String> saveAnts = new ArrayList<>();\n\nfor (int k = 0; k < lines.size(); k++) {\nString singleLine = lines.get(k);\nsplitLineByLetterOrDigit = singleLine.toCharArray();\nfor (int i = 0; i < splitLineByLetterOrDigit.length; i++) {\nif (Character.isLetter(splitLineByLetterOrDigit[i])) {\n// first is row\nsaveAnts.add(String.format(\"%d %d %s\", k, i, splitLineByLetterOrDigit[i]));\n}\n}\n}\n\nreturn saveAnts;\n}","public static void main(String[] args) {\n\t\tFile f= new File(\"E://workplace/BigFileRead/src/data/itcont.txt\");\r\n\t\ttry {\r\n\t\t\tBufferedReader b=new BufferedReader(new FileReader(f));\r\n\t\t\tString readLine=\"\";\r\n\t\t\t\r\n\t\t\t//得到总行数\r\n\t\t\tInstant lineCountStart=Instant.now();//当前时间\r\n\t\t\tint lines=0;\r\n\t\t\tInstant nameStart=Instant.now();\r\n\t\t\tArrayList<String> names=new ArrayList<String>();\r\n\t\t\t//得到第432个和第43243个名字\r\n\t\t\tArrayList<Integer> indexs=new ArrayList<>();\r\n\t\t\t\r\n\t\t\tindexs.add(1);\r\n\t\t\tindexs.add(433);\r\n\t\t\tindexs.add(43244);\r\n\t\t\t//计算每个月的捐赠量\r\n\t\t\tInstant donationsStart=Instant.now();\r\n\t\t\tArrayList<String> dates=new ArrayList<String>();\r\n\t\t\t//计算每一个名字的出现次数\r\n\t\t\tInstant commonNamesStart=Instant.now();\r\n\t\t\tArrayList<String> firstNames=new ArrayList<String>();\r\n\t\t\tSystem.out.println(\"start read file using input stream!\");\r\n\t\t\ttry {\r\n\t\t\t\twhile((readLine=b.readLine())!=null){\r\n\t\t\t\tlines++;\r\n\t\t\t\t//得到所有的名字\r\n\t\t\t\tString array1[]=readLine.split(\"\\\\s*\\\\|s*\");\r\n\t\t\t\tString name=array1[7];\r\n\t\t\t\tnames.add(name);\r\n\t\t\t\tif(indexs.contains(lines)){\r\n\t\t\t\t\tSystem.out.println(\"names:\"+names.get(lines-1)+\"at index: \"+(lines-1));\r\n\t\t\t\t\t\r\n\t\t\t\t}\r\n\t\t\t\tif (name.contains(\", \")){\r\n\t\t\t\t\tString array2[]=(name.split(\",\"));\r\n\t\t\t\t\tString firstHalfOfName=array2[1].trim();\r\n\t\t\t\t\tif(firstHalfOfName!=\"undefined\"||!firstHalfOfName.isEmpty()){\r\n\t\t\t\t\t\tif(firstHalfOfName.contains(\" \")){\r\n\t\t\t\t\t\t\tString array3[]=(name.split(\" \"));\r\n\t\t\t\t\t\t\tString firstName=array3[0].trim();\r\n\t\t\t\t\t\t\tfirstNames.add(firstName);\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\telse{\r\n\t\t\t\t\t\t\tfirstNames.add(firstHalfOfName);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\tString rawDate=array1[4];\r\n\t\t\t\tString year=rawDate.substring(0,4);\r\n\t\t\t\tString month=rawDate.substring(4,6);\r\n\t\t\t\tString formatDate=month+\"-\"+year;\r\n\t\t\t\tdates.add(formatDate);\r\n\t\t\t\t}\r\n\t\t\t} catch (IOException e) {\r\n\t\t\t\t// TODO Auto-generated catch block\r\n\t\t\t\te.printStackTrace();\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\tInstant namesEnd=Instant.now();\r\n\t\t\tlong timeElapseNames=Duration.between(nameStart, namesEnd).toMillis();\r\n\t\t\tSystem.out.println(\"names time :\"+timeElapseNames+\"ms\");\r\n\t\t\tSystem.out.println(\"total lines :\"+lines);\r\n\t\t\t\r\n\t\t\tInstant lineCountsEnd=Instant.now();\r\n\t\t\tlong timeElapselineCounts=Duration.between(lineCountStart, lineCountsEnd).toMillis();\r\n\t\t\tSystem.out.println(\"lines time :\"+timeElapseNames+\"ms\");\r\n\t\t\t\r\n\t\t\tHashMap<String, Integer> dateMap=new HashMap<String, Integer>();\r\n\t\t\tfor(String date:dates){\r\n\t\t\t\tInteger count =dateMap.get(date);\r\n\t\t\t\tif(count==null){\r\n\t\t\t\t\tdateMap.put(date, 1);\r\n\t\t\t\t}\r\n\t\t\t\telse{\r\n\t\t\t\t\tdateMap.put(date, count+1);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tfor (Map.Entry<String, Integer> entry :dateMap.entrySet()){\r\n\t\t\t\tString key=entry.getKey();\r\n\t\t\t\tInteger value=entry.getValue();\r\n\t\t\t\tSystem.out.println(\"Donations per month and year: \"+key+\" and donation count: \"+value);\r\n\t\t\t}\r\n\t\t\tInstant donationEnd=Instant.now();\r\n\t\t\tlong timeElapsedDonations=Duration.between(donationsStart, donationEnd).toMillis();\r\n\t\t\tSystem.out.println(\"Donation time: \"+timeElapsedDonations+\" ms\");\r\n\t\t\t\t\r\n\t\t\tHashMap<String, Integer> map=new HashMap<String, Integer>();\r\n\t\t\tfor(String name : firstNames){\r\n\t\t\t\tInteger count =dateMap.get(name);\r\n\t\t\t\tif(count==null){\r\n\t\t\t\t\tmap.put(name, 1);\r\n\t\t\t\t}\r\n\t\t\t\telse{\r\n\t\t\t\t\tmap.put(name, count+1);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tLinkedList<Entry<String, Integer>> list =new LinkedList<>(map.entrySet());\r\n\t\t\t\r\n\t\t\tCollections.sort(list,new Comparator<Map.Entry<String, Integer>>() {\r\n\t\t\t\t@Override\r\n\t\t\t\tpublic int compare(Map.Entry<String, Integer> o1, Map.Entry<String, Integer> o2) {\r\n\t\t\t\t\t// TODO Auto-generated method stub\r\n\t\t\t\t\treturn (o2.getValue()).compareTo(o1.getValue());\r\n\t\t\t\t}\r\n\t\t\t});\r\n\t\t\t\r\n\t\t\tSystem.out.println(\"The most Common first name is: \"+list.get(0).getKey()+\" and it occurs: \"+list.get(0).getValue()+\" time.\");\r\n\t\t\tInstant commonNameEnd=Instant.now();\r\n\t\t\tlong timeElapseCommonName =Duration.between(commonNamesStart, commonNameEnd).toMillis();\r\n\t\t\tSystem.out.println(\"most common name time: \"+timeElapseCommonName+\" ms\");\r\n\t\t} catch (FileNotFoundException e) { \r\n\t\t\te.printStackTrace();\r\n\t\t}\r\n\t}","String[] getActivities(String filepath) throws ParserConfigurationException, SAXException, IOException;","protected abstract void readFile();","private void readFromFile() {\n\t\tPath filePath = Paths.get(inputFile);\n\n\t\ttry (BufferedReader reader = Files.newBufferedReader(filePath,\n\t\t\t\tCharset.forName(\"UTF-8\"));) {\n\t\t\tString line = null;\n\n\t\t\twhile ((line = reader.readLine()) != null) {\n\t\t\t\tString[] splitLine = line.split(\",\");\n\t\t\t\tcurrentGen.setValue(Integer.parseInt(splitLine[0]),\n\t\t\t\t\t\tInteger.parseInt(splitLine[1]), true);\n\t\t\t}\n\t\t} catch (IOException e) {\n\t\t\tSystem.out.println(\"Could not find file provided.\");\n\t\t}\n\t}","public int importOnlyFnaBitSequences(String filename, int start, int end) {\n int currentKID = 0;\n int result = 0;\n// String currName = null;\n boolean store = false;\n SuperString seq = new SuperString();\n try (BufferedReader br = new BufferedReader(new FileReader(filename))) {\n\n for (String line; (line = br.readLine()) != null; ) {\n if (line.charAt(0) == '>'){\n if (currentKID >= start) {\n if (seq.length() > 0) {\n// System.err.print(\"KID\\t\"+currentKID+\"\\thas length\\t\"+seq.length());\n storeOnlyBitSequence(currentKID, seq);\n } else {\n sequenceLength.add(0);\n exceptionsArr.add(new HashMap<Integer,Character>());\n }\n result++;\n seq = new SuperString();\n// currName = line.trim().substring(1);\n store = true;\n }\n currentKID++;\n } else if (store) {\n seq.addAndTrim(line);\n }\n if (currentKID >= end) break;\n }\n } catch (FileNotFoundException e) {\n e.printStackTrace();\n } catch (IOException e) {\n e.printStackTrace();\n }\n\n return result;\n }","public void parseFile(){\n try{\n BufferedReader br = new BufferedReader(new FileReader(\"ElevatorConfig.txt\"));\n \n String fileRead;\n \n totalSimulatedTime = 1000;\n Integer.parseInt(br.readLine());\n simulatedSecondRate = 30;\n Integer.parseInt(br.readLine());\n \n for (int onFloor = 0; onFloor< 5; onFloor++){\n \n fileRead = br.readLine(); \n String[] tokenize = fileRead.split(\";\");\n for (int i = 0; i < tokenize.length; i++){\n String[] floorArrayContent = tokenize[i].split(\" \");\n \n int destinationFloor = Integer.parseInt(floorArrayContent[1]);\n int numPassengers = Integer.parseInt(floorArrayContent[0]);\n int timePeriod = Integer.parseInt(floorArrayContent[2]);\n passengerArrivals.get(onFloor).add(new PassengerArrival(numPassengers, destinationFloor, timePeriod));\n }\n }\n \n br.close();\n \n } catch(FileNotFoundException e){ \n System.out.println(e);\n } catch(IOException ioe){\n ioe.printStackTrace();\n }\n\n }","public static void startup() {\n\t\tString thisLine;\n\t\tString currentName = \"\";\n\t\tboolean next = true;\n\n\t\t// DEBUG\n\t\t// System.out.println(\"entered here\");\n\n\t\t// Loop across the arguments\n\n\t\t// Open the file for reading\n\t\ttry {\n\t\t\tBufferedReader br = new BufferedReader(new FileReader(GIGA_WORD));\n\t\t\twhile ((thisLine = br.readLine()) != null) {\n\t\t\t\tString str = thisLine.trim();// .replaceAll(\"(\\\\r|\\\\n)\", \"\");\n\t\t\t\tString[] wordNumber = str.split(\"[ ]{2,}\");\n\t\t\t\tString word = wordNumber[0].toLowerCase();\n\t\t\t\tint cnt = Integer.parseInt(wordNumber[1]);\n\t\t\t\tgigaMap.put(word, cnt);\n\t\t\t}\n\t\t\tbr.close();\n\t\t\tbr = null;\n\t\t\tbr = new BufferedReader(new FileReader(FILE_NAME));\n\t\t\twhile ((thisLine = br.readLine()) != null) {\n\t\t\t\tString str = thisLine.trim();// replaceAll(\"(\\\\r|\\\\n)\", \"\");\n\t\t\t\tif (str.equals(\"[Term]\")) {\n\t\t\t\t\tnext = true;\n\t\t\t\t}\n\t\t\t\tif (str.startsWith(\"name:\")) {\n\t\t\t\t\tif (next) {\n\t\t\t\t\t\tcurrentName = str.replaceAll(\"name: \", \"\");\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (str.startsWith(\"synonym:\")) {\n\t\t\t\t\tif (str.contains(\"EXACT\") || str.contains(\"NARROW\")) {\n\t\t\t\t\t\t// synonym..\n\t\t\t\t\t\tPattern pattern = Pattern\n\t\t\t\t\t\t\t\t.compile(\"synonym:.*\\\"(.*)\\\".*\");\n\t\t\t\t\t\tMatcher matcher = pattern.matcher(str);\n\t\t\t\t\t\t// DEBUG\n\t\t\t\t\t\t// System.err.println(str);\n\t\t\t\t\t\tif (matcher.find()) {\n\t\t\t\t\t\t\tString syno = matcher.group(1);\n\t\t\t\t\t\t\tif (!currentName.equals(\"\")) {\n\t\t\t\t\t\t\t\t// System.err.format(\"%s:%s.\\n\", currentName,\n\t\t\t\t\t\t\t\t// syno);\n\n\t\t\t\t\t\t\t\tadd(currentName, syno);\n\t\t\t\t\t\t\t\tadd(syno, currentName);\n\t\t\t\t\t\t\t\trecursiveAddSyno(currentName, syno);\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\t\tbr.close();\n\t\t\tbr = null;\n\t\t} catch (IOException e) {\n\t\t\tSystem.err.println(\"Error: \" + e);\n\t\t}\n\t}","public static void processInput() throws IOException {\r\n\t\t\r\n\t\t//Out statement let user know the input file is being read\t\r\n\t\tScanner scnr;\r\n\t\tString[] splitString;\r\n\t\t\r\n\t\tFile file = new File(\"Project_04_Input01.txt\");\r\n\t\tscnr = new Scanner(file);\r\n\t\t\r\n\t\tSystem.out.println(\"Reading data from \" + file + \"...\");\r\n\t\t\r\n\t\twhile(scnr.hasNextLine()) {\r\n\t\t\tString line = scnr.nextLine();\r\n\t\t\tsplitString = line.split(\",\");\r\n\r\n\t\t\tif (splitString[0].contains(\"STUDENT\")) {\r\n\t\t\t\t\r\n\t\t\t\t// Call processStudentData\r\n\t\t\t\tprocessStudentData(splitString);\r\n\t\t\t\tSystem.out.println(\"'STUDENT' has been found in the file.\");\r\n\r\n\t\t\t} // End if\r\n\t\t\t\r\n\t\t\telse if (splitString[0].contains(\"GRADEITEM\") ) {\r\n\t\t\t\t\r\n\t\t\t\t// Call processGradeItemData\r\n\t\t\t\tprocessGradeItemData(splitString);\r\n\t\t\t\tSystem.out.println(\"'GRADEITEM' has been found in the file.\");\r\n\t\t\t\t\r\n\t\t\t} // End if\r\n\t\t} // End while\r\n\t\t\r\n\t\t// Close the file\r\n\t\tscnr.close();\r\n\t\t\t\r\n\t}","public void service_psy (Personne p) throws FileNotFoundException\r\n\t{\r\n\t\r\n\t\t\r\n\t\t \t\tString [] info_psy=null ;\r\n\t\t \t\tString [] cle_valeur=null;\r\n\t\t \t\tboolean spec,adr;\r\n\t\t \t\tFileInputStream f=new FileInputStream(\"C://Users/Azaiez Hamed/Desktop/workspace/Projet de programmation/src/Medecin.txt\");\r\n\t\t \t\ttry {\r\n\t\t \t\t\tBufferedReader reader =new BufferedReader (new InputStreamReader(f,\"UTF-8\"));\r\n\t\t \t\t\tString line=reader.readLine();\r\n\t\t \t\t\twhile(line!=null){\r\n\t\t \t\t\t\tinfo_psy=line.split(\"\\t\\t\\t\");\r\n\t\t \t\t\t\tspec=false;adr=false;\r\n\t\t \t\t\t\tfor(int i=0;i<info_psy.length;i++)\r\n\t\t \t\t\t\t{\r\n\t\t \t\t\t\t\t cle_valeur=info_psy[i].split(\":\");\r\n\t\t\t\t\t\t if ((cle_valeur[0].equals(\"specialite\"))&& (cle_valeur[1].equals(\"psy\")))\r\n\t\t\t\t\t\t \t spec=true;\r\n\t\t\t\t\t\t if ((cle_valeur[0].equals(\"gouvernerat\"))&&(cle_valeur[1].equals(p.getGouvernerat())))\r\n\t\t \t\t\t\t\t \tadr=true;\r\n\t\t\t\t\t\t}\r\n\t\t \t\t\t\tif (spec && adr) {\r\n\t\t \t\t\t\t\t System.out.println(\"voilà toutes les informations du psy, veuillez lui contacter immédiatement **\");\r\n\t\t \t\t\t\t\t System.out.println(line);return;}\r\n\t\t \t\t\t\telse\r\n\t\t \t\t\t\t line=reader.readLine();\r\n\t\t \t\t\t\t }\r\n\t\t \t\t }\r\n\t\t \t\t \tcatch(IOException e){e.printStackTrace();}\r\n\t\t \t\t System.out.println(\"Pas de psy trouvé dans votre gouvernerat\");\r\n\t}","private void readFile (String file, Visitor visitor) throws Exception {\n\t\tFileReader fr = new FileReader (file);\n\t\tBufferedReader reader = new BufferedReader (fr);\n\n\t\tSystem.out.println (\"Reading file \" + file);\n\n\t\tint count = 0;\n\t\tfor (String line; (line = reader.readLine()) != null;) {\n\t\t\tif (count++ % 10000 == 0) System.out.println (line);\n\t\t\tvisitor.visit (line);\n\n\t\t\tif (count >= LIMIT) break;\n\t\t}\n\n\t\tSystem.out.println (\"Done\");\n\n\t\treader.close();\n\t\tfr.close();\n\t}","public static void main(String[] args){\n\t\ttry{\n\t\t\tFileReader fr=new FileReader(\"C:\\\\Users\\\\bharathi\\\\Desktop\\\\Hello\\\\new.txt\");\n\t\t\tbr = new BufferedReader(fr);\n\t\t\tSystem.out.println(\"reading lins from the file.... \"+br.readLine());\n\t\t}catch(Exception e){}\n\t}","private void logLineFromTasksFile(File cgf) {\n String str;\n if (LOG.isDebugEnabled()) {\n try (BufferedReader inl =\n new BufferedReader(new InputStreamReader(new FileInputStream(cgf\n + \"/tasks\"), \"UTF-8\"))) {\n str = inl.readLine();\n if (str != null) {\n LOG.debug(\"First line in cgroup tasks file: {} {}\", cgf, str);\n }\n } catch (IOException e) {\n LOG.warn(\"Failed to read cgroup tasks file. \", e);\n }\n }\n }","public boolean readDataFile();","void findCogs(File input, int mode, Mappings map){\n int lineNum=0;\n\n BufferedReader reader;\n try {\n Path path =Paths.get(input.getAbsolutePath());\n System.out.println(\"Path: \"+input.getAbsolutePath());\n reader = Files.newBufferedReader(path,ENCODING);\n String line = null;\n while ((line = reader.readLine()) != null) {\n lineNum++;\n \n if(lineNum==1){\n String[] gensize=line.split(\" \");\n String c=gensize[gensize.length-1];\n System.out.println(\"String c COG: \"+c);\n String [] coord=c.split(\"\\\\.\\\\.\");\n System.out.println(\"coord size: \"+coord.length);\n minCoordinate=Integer.parseInt(coord[0]);\n maxCoordinate=Integer.parseInt(coord[1]);\n }\n \n if(lineNum>3){\n String[] st=line.split(\"\\t\");\n String[] coord=st[0].split(\"\\\\..\");\n int x=Integer.parseInt(coord[0]), y=Integer.parseInt(coord[1]);\n\n String cogName=\"\";\n if(mode==0){\n String pattern = \"(^COG)(\\\\d+)(\\\\D+)\";\n \n if(st[7].contains(\",\"))\n st[7]=st[7].split(\",\")[0];\n cogName=st[7].replaceAll(pattern, \"$1$2\");\n }\n else{\n cogName=st[3];\n }\n\n Triplet<Integer,Integer,String> t=new Triplet<Integer,Integer,String>(x,y,cogName);\n cogs.add(t);\n\n if(map.geneOgMapping.containsKey(cogName))\n ancogs.add(t);\n }\n }\n reader.close();\n }catch(IOException ioe)\n {\n System.err.println(\"IOException: \" + ioe.getMessage());\n }\n }","public static void loadProgramData() {\n\r\n try {\r\n File f = new File(\"DetailsOfVaccination.txt.txt\"); //Accessing the file\r\n Scanner read = new Scanner(f);\r\n while (read.hasNextLine()) { //Print data in the file line by line\r\n String data = read.nextLine();\r\n System.out.println(data);\r\n }\r\n read.close();\r\n }\r\n catch (FileNotFoundException e) { //Runs if there was an error\r\n System.out.println(\"An error occurred while reading data from the file.\");\r\n e.printStackTrace();\r\n }\r\n }","public static void main(String[] args) {\n\t\t\ttry(FileReader fr = new FileReader(\"Numbers2.txt\");\n\t\t\t\tBufferedReader br= new BufferedReader(fr); )\n\t\t\t{\n\t\t\t\t\n\t\t\t\tint index=0;\n//\t\t\t\tThis is one way to read code from txt file\n\t\t\t\twhile(br.ready()) {\n\t\t\t\t\tSystem.out.print(++index+\":\");\n\t\t\t\t\tSystem.out.println(br.readLine());\t\n\t\t\t\t}\n\t\t\t}\n\t\t\tcatch(FileNotFoundException e){\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\t\n\t\t\tcatch(IOException e){\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\t\t\n\t\t\tfinally {\n\t\t\tSystem.out.println(\"Ended..\");\n\t\t\t\t\n\t\t\t}\n\t\t}","@Override\n public FileStatus getFileStatus(File file) {\n\treturn null;\n }","public long getFileIndex(){\n \tString fileName=file.getName();\n// \tSystem.out.println(\"fileName:\"+fileName);\n \tfinal long start = Long.parseLong(fileName.substring(0,\n\t\t\t\tfileName.length() - FILE_SUFFIX.length()));\n// \tSystem.out.println(\"start:\"+start);\n \treturn start;\n }","private void read() {\n\n\t\t\t\tString road=getActivity().getFilesDir().getAbsolutePath()+\"product\"+\".txt\";\n\n\t\t\t\ttry {\n\t\t\t\t\tFile file = new File(road); \n\t\t\t\t\tFileInputStream fis = new FileInputStream(file); \n\t\t\t\t\tint length = fis.available(); \n\t\t\t\t\tbyte [] buffer = new byte[length]; \n\t\t\t\t\tfis.read(buffer); \n\t\t\t\t\tString res1 = EncodingUtils.getString(buffer, \"UTF-8\"); \n\t\t\t\t\tfis.close(); \n\t\t\t\t\tjson(res1.toString());\n\t\t\t\t} catch (IOException e) {\n\t\t\t\t\t// TODO Auto-generated catch block\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t} \n\t\t\t}","private void processInput()\n{\n File f1 = input_file;\n\n try (BufferedReader br = new BufferedReader(new FileReader(f1))) {\n List<DylockLockEntry> ents = new ArrayList<DylockLockEntry>();\n List<DylockLockEntry> lents = new ArrayList<DylockLockEntry>();\n double ltime = 0;\n double ntime = 0;\n for ( ; ; ) {\n\t String ln = br.readLine(); \n\t if (ln == null) break;\n\t if (ln.startsWith(\"ENDBLOCK\")) {\n\t processBlock(lents);\n\t List<DylockLockEntry> xents = lents;\n\t lents = ents;\n\t ents = xents;\n\t ltime = ntime;\n\t ntime = 0;\n\t }\n\t else {\n\t DylockLockEntry ent = new DylockLockEntry(this,ln);\n\t double t0 = ent.getTime();\n\t if (t0 <= ltime) lents.add(ent);\n\t else {\n\t if (t0 > ntime) ntime = t0;\n\t ents.add(ent);\n\t }\n\t }\n }\n processBlock(ents);\n }\n catch (IOException e) {\n System.err.println(\"DYLOCK: Problem reading input file: \" + e);\n }\n}","public void getInformation() throws IOException {\n\t\tList<Fire> listFeux = new ArrayList<Fire>();\n\t listFeux = this.collectData();\n\t \n\t if(this.previousIntensity > this.real_intensity) {\n\t \tthis.previousIntensity = this.real_intensity;\n\t }\n\t\t\n\t\tthis.alerte.resetIntensity();\t//on reset l'intensite\n\t\tthis.real_intensity = 0;\n\t\t\n\t for (Fire feu: listFeux) {\t\t//on recalcul l'intensite\n\t \tfor (CoordEntity coord: feu.getLocation()) {\n\t\t \tif ( (Math.abs(coord.getX() - this.localisation.x) < this.range) &&\n\t\t \t\t\t(Math.abs(coord.getY() - this.localisation.y) < this.range) ) {\n\t\t \t\tint intensity = this.getIntensityFromFire(feu);\n\t\t \t\tthis.addRealIntensity(intensity);\n\t\t \t\tif (this.isDetectable(feu) == true) {\n\t\t \t\t\tSystem.out.println(\"Detectable\");\n\t\t\t \t\tif (this.applyErrors() == true) {\n\t\t\t \t\t\tthis.alerte.setIntensity(intensity);\t\n\t\t\t \t\t}\n\t\t \t\t}\n\t }\t\t\n\t }\n\t }\n\t System.err.println(previousIntensity + \"/\" + this.real_intensity + \"/\" + this.alerte.getIntensity() );\n\t\t if (this.alerte.getIntensity() > previousIntensity) {\n\t\t \tthis.previousIntensity = this.real_intensity;\t//on recupere l'intensite mesuree precedement\n\t\t \tSystem.err.println(\"Alarme\");\n\t\t \tthis.triggerAlarm();\t//si il y a eu aggravation de l'etat du feu\n\t\t }\n\t}","void visitFile(File file);","public static void getInputFileData(){\n\t\t\t\n\t\t\t// editable fields\n\t\t\t\n\t\t\tString directDistanceFile = \"../data/direct_distance_1.txt\";\n\t\t\tString graphInputFile = \"../data/graph_input_1.txt\";\n\t\t\t\n\t\t\t\n\t\t\t// end of editable fields\n\t\t\t\n\t\t\t\n\t\t\tFile file1 = new File(directDistanceFile);\n\t\t\tFile file2 = new File(graphInputFile);\n\t\t\tfiles.add(file1);\n\t\t\tfiles.add(file2);\n\t\t\t\n\t\t\t/*// Directory where data files are\n\t\t\tPath dataPath = Paths.get(\"../data\");\n\t\t\t\n\t\t\tString path = dataPath.toAbsolutePath().toString();\n\t\t\t\n\t\t\tFile dir = new File (path);\n\t\t\t\t\t\n\t\t\tif (dir.listFiles() == null){\n\t\t\t\t\n\t\t\t\tSystem.out.println(\"WARNING: No files found.\");\n\n\t\t\t} else if (dir.listFiles() != null && dir.listFiles().length == 2) {\n\t\t\n\t\t\t\tfor (File file : dir.listFiles()){\n\t\t\t\t\ttry {\n\t\t\t\t\t\tfiles.add(file.getName());\n\t\t\t\t\t} catch(Exception e) {\n\t\t\t\t\t\te.printStackTrace();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\n\t\t\t} else {\n\t\t\t\t\n\t\t\t\tSystem.out.println(\"WARNING: Data folder may only contain two files: direct_distance and\"\n\t\t\t\t\t\t+ \" graph_input. Please modify contents accordingly before proceeding for alorithm to execute.\");\n\t\t\t\t\n\t\t\t}\n\t\t\t*/\n\t\t\t\n\t\t\tfor (File file: files){\n\t\t\t\ttry {\n\t\t\t\t\t\n\t\t\t\t\t// store direct distances in a hashmap\n\t\t\t\t\tif (file.toString().contains(\"distance\")){\n\t\t\t\t\t\t\n\t\t\t\t\t\t//FileReader fileReader = new FileReader(dataPath.toString() + \"/\" + file);\n\t\t\t\t\t\tFileReader fileReader = new FileReader(file);\n\t\t\t\t BufferedReader reader = new BufferedReader(fileReader);\n\t\t\t\t String line = null;\n\t\t\t\t \n\t\t\t\t while ((line = reader.readLine()) != null) {\n\t\t\t\t \t\n\t\t\t\t \tStringBuilder num = new StringBuilder();\n\t\t\t\t \tStringBuilder str = new StringBuilder();\n\t\t\t\t \n\t\t\t\t \tfor(char c : line.toCharArray()){\n\t\t\t\t \t\t//find the distance\n\t\t\t\t if(Character.isDigit(c)){\n\t\t\t\t num.append(c);\n\t\t\t\t } \n\t\t\t\t //find the associated letter\n\t\t\t\t else if(Character.isLetter(c)){\n\t\t\t\t str.append(c); \n\t\t\t\t }\n\t\t\t\t \t}\n\t\t\t\t \t\n\t\t\t\t \t// add values into hashmap\n\t\t\t\t \tdistance.put(str.toString(), Integer.parseInt(num.toString()));\n\t\t\t\t \t\n\t\t\t\t }\n\t\t\t\t \n\t\t\t\t reader.close(); // close the reader\n\t\t\t\t\t\t\n\t\t\t\t\t\t//System.out.println(distance);\n\t\t\t\t \n\t\t\t\t } \n\t\t\t\t\t\n\t\t\t\t\t// store inputs in a \n\t\t\t\t\telse if (file.toString().contains(\"input\")){\n\t\t\t\t\t\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t//FileReader fileReader = new FileReader(dataPath.toString() + \"/\" + file);\n\t\t\t\t\t\tFileReader fileReader = new FileReader(file);\n\t\t\t\t BufferedReader reader = new BufferedReader(fileReader);\n\t\t\t\t \n\t\t\t\t String line = null;\n\t\t\t\t \n\t\t\t\t int x=0; // keeps track of line to add\n\t\t\t\t \n\t\t\t\t \n\t\t\t\t while ((line = reader.readLine()) != null) {\n\t\t\t\t \tString[] values = line.split(\"\\\\s+\");\n\t\t\t\t \t\n\t\t\t\t \t\n\t\t\t\t \t if (matrix == null) {\n\t\t\t\t \t\t //instantiate matrix\n\t\t\t\t matrix = new String[widthOfArray = values.length]\n\t\t\t\t \t\t \t\t\t[lenghtOfArray = values.length];\n\t\t\t\t }\n\t\t\t\t \t\n\t\t\t\t \t\n\t\t\t\t \t// add values into the matrix\n\t\t\t\t \tfor (int i=0; i < values.length; i++){\n\t\t\t\t \t\t\n\t\t\t\t \t\tmatrix[i][x] = values[i];\n\t\t\t\t \t\t\n\t\t\t\t \t}\n\t\t\t\t \t\n\t\t\t\t \tx++; // next line\n\t\t\t\t \t\n\t\t\t\t \t\n\t\t\t\t }\n\t\t\t\t \n\t\t\t\t reader.close(); // close the reader\n\t\t\t\t\t\t\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t// Store input combinations in a hashmap\n\t\t\t\t\tint y=1; \n\t\t\t\t\twhile (y < lenghtOfArray){\n\t\t\t\t\t\t\n\t\t\t\t\t\tinputNodes.add(matrix[0][y]);\n\t\t\t\t\t\t\n\t\t\t\t\t\tfor (int i=1; i < widthOfArray; i++){\n\t\t\t\t\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tStringBuilder str = new StringBuilder();\n\t\t\t\t\t\t\tstr.append(matrix[0][y]);\n\t\t\t\t\t\t\tstr.append(matrix[i][0]);\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tint inputValue = Integer.parseInt(matrix[i][y]);\n\n\t\t\t\t\t\t\tif (inputValue > 0){\n\t\t\t\t\t\t\t\tinputMap.put(str.toString(), inputValue);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t}\n\t\t\t\t\t\t\n\t\t\t\t\t\ty++;\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t} catch (Exception e) {\n\t\t\t\t\tSystem.out.println(\"WARNING: Please check: \"+ file.toString() + \". It was not found.\");\n\t\t\t\t} \n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t}","public HashMap readFile(String filePath, HashMap source){\n\t\tArrayList<String> temp1 = new ArrayList<String>();\n\t\tArrayList<String> temp2 = new ArrayList<String>();\n\t\tBufferedReader br = null;\n\t\t\n\t\ttry {\n\t\t\tString sCurrentLine;\n\t\t\t\n\t\t\t// \"Users/Jasmine/Documents/Eclipse/CacheDictionary/src/english.txt\"\n\t\t\tbr = new BufferedReader(new FileReader(filePath)); \n\t\t\t\n\t\t\t//str.matches(\".*\\\\d+.*\"); ==> string that contains numbers\n\t\t\t//.matches(\"[a-zA-Z]+\"); ==> string that only contains letter\n\t\t\twhile ((sCurrentLine = br.readLine()) != null) {\n\t\t\t\t\n\t\t\t\t/*\n\t\t\t\t * if the source file itself is not one word per line, we need to split the string\n\t\t\t\t * only letter(not single) will be stored in the array\n\t\t\t\t */\n\t\t\t\t//\n\t\t\t\tif(sCurrentLine.matches(\".*([ \\t]).*\")){ //check if the current line is a single word or not\n\t\t\t\t\ttemp1.add(sCurrentLine);\n\t\t\t\t}\n\t\t\t\telse if(sCurrentLine.matches(\"[a-zA-Z]+\") && sCurrentLine.length()>1){\n\t\t\t\t\ttemp2.add(sCurrentLine);\n\t\t\t\t}\n\t\t\t}// end of while loop\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t} finally {\n\t\t\ttry {\n\t\t\t\tif (br != null)br.close();\n\t\t\t} catch (IOException ex) {\n\t\t\t\tex.printStackTrace();\n\t\t\t}\n\t\t}\n\n\t\tif(!temp1.isEmpty()){\n\t\t\tfor(int i = 0; i< temp1.size(); i++){\n\t\t\t\tString thisLine[] = temp1.get(i).split(\" \");\n\t\t\t\t//for each word in this line\n\t\t\t\tfor(int j = 0; j < thisLine.length; j++){\n\t\t\t\t\t//if it is a valid word\n\t\t\t\t\tif(thisLine[j].matches(\"[a-zA-Z]+\") && thisLine[j].length()>1 ){\n\t\t\t\t\t\tif( source.get(thisLine[j]) == null){\n\t\t\t\t\t\t\tsource.put(thisLine[j].toLowerCase(),thisLine[j].toLowerCase());\n\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\n\t\t\t\t\t} // end of if current word i valid\t\n\t\t\t\t}\n\t\t\t}\t\n\t\t} // end of temp1\n\t\t\n\t\tif(!temp2.isEmpty()){\n\t\t\tfor(int i = 0; i< temp2.size(); i++){\n\t\t\t\tif(temp2.get(i).matches(\"[a-zA-Z]+\") && temp2.get(i).length()>1){\n\t\t\t\t\tif(source.get(temp2.get(i)) == null){\n\t\t\t\t\t\tsource.put(temp2.get(i).toLowerCase(),temp2.get(i).toLowerCase());\n\t\t\t\t\t}\n\t\t\t\t\t\t\t\n\t\t\t\t} \n\t\t\t}\n\t\t\t\n\t\t}\n\t\treturn source;\n\t}","@Override\n\tpublic boolean readData(File file) {\n return file.exists();\n\t}","public static void getProblem(String filename){\r\n String line = \"\";\r\n try {\r\n //Get the problem instance\r\n reader = new BufferedReader(new FileReader(filename));\r\n line = reader.readLine();\r\n\r\n //Assume the first line contains the Universe\r\n inString = line.split(\",\");\r\n\r\n for (int i = 0; i < inString.length; i++) {\r\n universe.add(Integer.parseInt(inString[i]));\r\n }\r\n Collections.sort(universe);\r\n System.out.println(\"Universe:\" + universe);\r\n\r\n //Gather in the sets\r\n line = reader.readLine();\r\n while (line != null){\r\n inString = line.split(\",\");\r\n for (int i = 0; i < inString.length; i++) {\r\n set.add(Integer.parseInt(inString[i]));\r\n }\r\n //System.out.println(\"Set: \" + set);\r\n sets.add(set);\r\n set = new ArrayList<Integer>();\r\n line = reader.readLine();\r\n\r\n //Create a blank pheromone\r\n pheremones.add(0);\r\n visited.add(0);\r\n }\r\n System.out.println(\"Sets: \" + sets);\r\n\r\n //Create the pheremones\r\n //System.out.println(\"PheremoneSize: \" + pheremones.size());\r\n\r\n //Set the degradation\r\n //degrade = generationSize/2;\r\n\r\n }catch(FileNotFoundException e){System.out.println(\"File Not Found : \" + filename);}\r\n catch(Exception e){\r\n System.out.println(\"ERROR in getProblem\");\r\n System.out.println(\"File Name: \" + filename);\r\n System.out.println(\"Universe: \" + universe);\r\n System.out.println(\"Line: \" + line);\r\n System.out.println(\"InString: \" + inString.toString());\r\n System.out.println();\r\n System.out.println(e.toString());\r\n }\r\n }","protected abstract void parseFile(File f) throws IOException;"],"string":"[\n \"private void extractFile() {\\n try (BufferedReader buffered_reader = new BufferedReader(new FileReader(source_file))) {\\n String line;\\n while((line = buffered_reader.readLine()) != null) {\\n String spaceEscaped = line.replace(\\\" \\\", \\\"\\\");\\n //file was read, each line is one of the elements of the file_read_lines list\\n //line 0 is keyword \\\"TELL\\\"\\n //line 1 is the knowledge base\\n //line 2 is the keyword \\\"ASK\\\"\\n //line 3 is the query\\n file_read_lines.add(spaceEscaped);\\n }\\n\\n //generate list of Horn clauses (raw) from the KB raw sentence\\n //replace \\\\/ by |\\n String kbLine = file_read_lines.get(1).replace(\\\"\\\\\\\\/\\\", \\\"|\\\");\\n rawClauses = Arrays.asList(kbLine.split(\\\";\\\"));\\n //query - a propositional symbol\\n query = file_read_lines.get(3);\\n } catch (IOException e) {\\n //Return error if file cannot be opened\\n error = true;\\n System.out.println(source_file.toString() + \\\" is not found!\\\");\\n }\\n }\",\n \"public void readPairs(String fileName) {\\n BufferedReader r = null;\\n try {\\n r = new BufferedReader(new InputStreamReader(new FileInputStream(fileName)));\\n } catch (FileNotFoundException e) {\\n e.printStackTrace();\\n }\\n while (true) {\\n String line = null;\\n try {\\n line = r.readLine();\\n } catch (IOException e) {\\n e.printStackTrace();\\n }\\n if (line == null) {\\n break;\\n }\\n assert line.length() == 11; // indatakoll, om man kör med assertions på\\n String start = line.substring(0, 5);\\n String goal = line.substring(6, 11);\\n\\n int s = words.indexOf(start);\\n int v = words.indexOf(goal);\\n\\n shortestPathPairs(s, v);\\n }\\n\\n }\",\n \"public AnalysePSRFile(File file) throws IOException {\\n ReadFileToString str = new ReadFileToString();\\n str.read(file);\\n StringTokenizer tok = new StringTokenizer(str.outputString,\\\"\\\\n\\\");\\n boolean notfound = true;\\n int count = 4;\\n while(notfound && tok.hasMoreTokens()) {\\n String line = tok.nextToken();\\n if(line.indexOf(startKeyword) >= 0) \\n count--;\\n if(count == 0)\\n notfound = false;\\n }\\n if(!notfound) {\\n Temperature = getTemperature(tok);\\n getMoleFractionHeader(tok);\\n getMoleFractions(tok);\\n int n = namesV.size();\\n namesS = new String[n];\\n molefractionsD = new Double[n];\\n for(int i=0;i<n;i++) {\\n namesS[i] = (String) namesV.elementAt(i);\\n molefractionsD[i] = (Double) molefractionsV.elementAt(i);\\n }\\n } else {\\n throw new IOException(\\\"PSR file incomplete: Begin not found in \\\\n \\\" + file.toString() );\\n }\\n \\n }\",\n \"public void readTheFile() {\\n \\t\\terrorMap.clear();\\n \\n \\t\\tBufferedReader br;\\n \\t\\tString nextLine;\\n \\t\\tString[] header = null;\\n \\t\\tArrayList<String> lines = new ArrayList<String>();\\n \\t\\ttry {\\n \\t\\t\\tlogger.debug(\\\"{} loading file: {} \\\", getName(), RobotNX100Controller.class.getResource(\\\"motoman_error_code.txt\\\").getPath());\\n \\n \\t\\t\\tbr = new BufferedReader(new FileReader(RobotNX100Controller.class.getResource(\\\"motoman_error_code.txt\\\").getPath()));\\n \\t\\t\\twhile (((nextLine = br.readLine()) != null) && (nextLine.length() > 0)) {\\n \\t\\t\\t\\tif (nextLine.startsWith(\\\"Code\\\")) {\\n \\t\\t\\t\\t\\theader = nextLine.split(\\\"[, \\\\t][, \\\\t]*\\\");\\n \\t\\t\\t\\t} else if (!nextLine.startsWith(\\\"#\\\"))\\n \\t\\t\\t\\t\\tlines.add(nextLine);\\n \\t\\t\\t}\\n \\t\\t\\tbr.close();\\n \\t\\t} catch (FileNotFoundException fnfe) {\\n \\t\\t\\t// we do not want to interrupt processing because error map file not set.\\n \\t\\t\\tlogger.warn(\\\"Can not find the Error Message file {} for {}. Only Error code will be reported.\\\",\\n \\t\\t\\t\\t\\tgetErrorCodeFilename(), getName());\\n \\t\\t\\tlogger.warn(\\\"caused by \\\" + fnfe.getMessage(), fnfe);\\n \\t\\t\\tbr = null;\\n \\t\\t\\treturn;\\n \\t\\t} catch (IOException ioe) {\\n \\t\\t\\t// we do not want to interrupt processing because error map file not set.\\n \\t\\t\\tlogger.warn(\\\"Can not find the Error Message file {} for {}. Only Error code will be reported.\\\",\\n \\t\\t\\t\\t\\tgetErrorCodeFilename(), getName());\\n \\t\\t\\tlogger.error(\\\"caused by \\\" + ioe.getMessage(), ioe);\\n \\t\\t\\tbr = null;\\n \\t\\t\\treturn;\\n \\t\\t}\\n \\n \\t\\tnumberOfRows = lines.size();\\n \\t\\tlogger.debug(\\\"the file contained \\\" + numberOfRows + \\\" lines\\\");\\n \\t\\tint nColumns = new StringTokenizer(lines.get(0), \\\"\\\\t\\\").countTokens();\\n \\t\\tlogger.debug(\\\"each line should contain \\\" + nColumns + \\\" numbers\\\");\\n \\t\\tkeys = new ArrayList<String>();\\n \\t\\tif (header != null) {\\n \\t\\t\\tfor (int i = 1; i < nColumns; i++) {\\n \\t\\t\\t\\terrorMap.put(header[0], header[i]);\\n \\t\\t\\t}\\n \\t\\t\\tkeys.add(header[0]);\\n \\t\\t}\\n \\n \\t\\tfor (int i = 0; i < numberOfRows; i++) {\\n \\t\\t\\tnextLine = lines.get(i);\\n \\t\\t\\tString[] thisLine = nextLine.split(\\\"[\\\\t][\\\\t]*\\\");\\n \\t\\t\\tfor (int j = 0; j < thisLine.length; j++)\\n \\t\\t\\t\\terrorMap.put(thisLine[0], thisLine[j]);\\n \\t\\t\\tkeys.add(thisLine[0]);\\n \\t\\t}\\n \\t}\",\n \"private void posRead() throws IOException {\\n\\t\\tFile file = new File(fullFileName());\\n\\t\\tString line;\\n\\t\\tBufferedReader reader = new BufferedReader(new FileReader(file));\\n\\t\\tStringBuffer fileText = new StringBuffer();\\n\\t\\twhile((line = reader.readLine()) != null) {\\n\\t\\t\\tStringTokenizer st = new StringTokenizer(line);\\n\\t\\t\\twhile (st.hasMoreTokens()) {\\n \\t\\tString tokenAndPos = st.nextToken();\\n \\t\\tint slashIndex = tokenAndPos.lastIndexOf('/');\\n \\t\\tif (slashIndex <= 0) throw new IOException(\\\"invalid data\\\");\\n \\t\\tString token = tokenAndPos.substring(0,slashIndex);\\n \\t\\tString pos = tokenAndPos.substring(1+slashIndex).intern();\\n \\t\\tint start = this.length();\\n \\t\\tthis.append(token);\\n \\t\\tif (st.hasMoreTokens())\\n \\t\\t\\tthis.append(\\\" \\\");\\n \\t\\telse\\n \\t\\t\\tthis.append(\\\" \\\\n\\\");\\n \\t\\tint end = this.length();\\n \\t\\tSpan span = new Span(start,end);\\n \\t\\tthis.annotate(\\\"token\\\", span, new FeatureSet());\\n \\t\\tthis.annotate(\\\"constit\\\", span, new FeatureSet(\\\"cat\\\", pos));\\n \\t}\\n\\t\\t}\\n\\t}\",\n \"public String parseSrc() throws Exception{\\n\\t\\tr = new FileReader(userArg); \\r\\n\\t\\tst = new StreamTokenizer(r);\\r\\n\\t\\t st.eolIsSignificant(true);\\r\\n\\t\\t st.commentChar(46);\\r\\n\\t\\t st.whitespaceChars(9, 9);\\r\\n\\t\\t st.whitespaceChars(32, 32);\\r\\n\\t\\t st.wordChars(39, 39);\\r\\n\\t\\t st.wordChars(44, 44);\\r\\n\\t\\t \\r\\n\\t\\t //first we check for a specified start address\\r\\n\\t\\t while (InstructionsRead < 2) {\\r\\n\\t\\t \\tif (st.sval != null) {\\r\\n\\t\\t \\t\\tInstructionsRead++;\\r\\n\\t\\t \\t\\tif (st.sval.equals(\\\"START\\\")) {\\r\\n\\t\\t \\t\\twhile(st.ttype != StreamTokenizer.TT_NUMBER) {\\r\\n\\t\\t \\t\\t\\tst.nextToken();\\r\\n\\t\\t \\t\\t}\\r\\n\\t\\t \\t\\tDDnval = st.nval;\\r\\n\\t\\t \\t\\tstartAddress = Integer.parseInt(\\\"\\\" + DDnval.intValue(), 16);\\r\\n\\t\\t \\t\\tlocctr = startAddress;\\r\\n\\t\\t \\t\\tsLocctr = Integer.toHexString(locctr.intValue());\\r\\n\\t\\t \\t\\tif (sLocctr.length() == 1) {\\r\\n\\t\\t \\t\\t\\tSystem.out.println(\\\"locctr: 000\\\" + Integer.toHexString(locctr.intValue()));\\r\\n\\t\\t \\t\\t}\\r\\n\\t\\t \\t\\telse if (sLocctr.length() == 2) {\\r\\n\\t\\t \\t\\t\\tSystem.out.println(\\\"locctr: 00\\\" + Integer.toHexString(locctr.intValue()));\\r\\n\\t\\t \\t\\t}\\r\\n\\t\\t \\t\\telse if (sLocctr.length() == 3 ) {\\r\\n\\t\\t \\t\\t\\tSystem.out.println(\\\"locctr: 0\\\" + Integer.toHexString(locctr.intValue()));\\r\\n\\t\\t \\t\\t}\\r\\n\\t\\t \\t\\telse {\\r\\n\\t\\t \\t\\t\\tSystem.out.println(\\\"locctr: \\\" + Integer.toHexString(locctr.intValue()));\\r\\n\\t\\t \\t\\t}\\r\\n\\t\\t \\t\\t//writer.write(\\\"\\\" + locctr); //should write to IF, not working yet 2/15/2011\\r\\n\\t\\t \\t\\tstartSpecified = true;\\r\\n\\t\\t \\t\\t}\\r\\n\\t\\t \\t\\telse if (!st.sval.equals(\\\"START\\\") && InstructionsRead < 2) { //this should be the program name, also could allow for label here potentially...\\r\\n\\t\\t \\t\\t\\t//this is the name of the program\\r\\n\\t\\t \\t\\t\\t//search SYMTAB for label etc. \\r\\n\\t\\t \\t\\t\\tname = st.sval;\\r\\n\\t\\t \\t\\t}\\r\\n\\t\\t \\t}\\r\\n\\t\\t st.nextToken();\\r\\n\\t\\t }\\r\\n\\t\\t if (!startSpecified) {\\r\\n\\t\\t \\tstartAddress = 0;\\r\\n\\t\\t \\tlocctr = startAddress;\\r\\n\\t\\t }\\r\\n\\t\\t startAddress2 = startAddress;\\r\\n\\t\\t /*\\r\\n\\t\\t ATW = Integer.toHexString(startAddress2.intValue());\\r\\n\\t\\t \\r\\n\\t\\t for (int i = 0; i<(6-ATW.length()); i++){\\r\\n\\t\\t \\tmyWriter.write(\\\"0\\\");\\r\\n\\t\\t }\\r\\n\\t\\t myWriter.write(ATW);\\r\\n\\t\\t myWriter.newLine();//end of line for now; in ReadIF when this line is read and translated to object code, the program length will be tacked on the end\\r\\n\\t\\t */\\r\\n\\t\\t \\r\\n\\t\\t //Now that startAddress has been established, we move on to the main parsing loop\\r\\n\\t\\t while (st.ttype != StreamTokenizer.TT_EOF) { //starts parsing to end of file\\r\\n\\t\\t \\t//System.out.println(\\\"Stuck in eof\\\");\\r\\n\\t\\t \\t//iLocctr = locctr.intValue();\\r\\n\\t\\t \\tinstFound = false;\\r\\n\\t\\t \\topcodeDone = false;\\r\\n\\t\\t \\tlabelDone = false;\\r\\n\\t\\t \\tmoveOn = true;\\r\\n\\t\\t \\t//constantCaseW = false;\\r\\n\\t\\t \\tconstantCaseB = false;\\r\\n\\t\\t \\txfound = false;\\r\\n\\t\\t \\tcfound = false;\\r\\n\\t\\t \\t\\r\\n\\t\\t \\tInstructionsRead = 0; //init InsRead to 0 at the start of each line\\r\\n\\t\\t \\tSystem.out.println(\\\"new line\\\");\\r\\n\\t\\t \\tSystem.out.println(\\\"Ins read: \\\" + InstructionsRead);\\r\\n\\t\\t \\tsLocctr = Integer.toHexString(locctr.intValue());\\r\\n\\t \\t\\tif (sLocctr.length() == 1) {\\r\\n\\t \\t\\t\\tSystem.out.println(\\\"locctr: 000\\\" + Integer.toHexString(locctr.intValue()));\\r\\n\\t \\t\\t}\\r\\n\\t \\t\\telse if (sLocctr.length() == 2) {\\r\\n\\t \\t\\t\\tSystem.out.println(\\\"locctr: 00\\\" + Integer.toHexString(locctr.intValue()));\\r\\n\\t \\t\\t}\\r\\n\\t \\t\\telse if (sLocctr.length() == 3 ) {\\r\\n\\t \\t\\t\\tSystem.out.println(\\\"locctr: 0\\\" + Integer.toHexString(locctr.intValue()));\\r\\n\\t \\t\\t}\\r\\n\\t \\t\\telse {\\r\\n\\t \\t\\t\\tSystem.out.println(\\\"locctr: \\\" + Integer.toHexString(locctr.intValue()));\\r\\n\\t \\t\\t}\\r\\n\\t\\t \\tif (foundEnd()) {\\r\\n\\t\\t \\t\\tbreak;\\r\\n\\t\\t \\t}\\r\\n\\t\\t \\twhile (st.ttype != StreamTokenizer.TT_EOL) {//breaks up parsing by lines so that InstructionsRead will be a useful count\\r\\n\\t\\t \\t\\t\\r\\n\\t\\t \\t\\tmoveOn = true;\\r\\n\\t\\t \\t\\tif (st.ttype == StreamTokenizer.TT_WORD) { \\r\\n\\t\\t \\t\\t\\tInstructionsRead++;\\r\\n\\t\\t \\t\\t\\tSystem.out.println(st.sval);\\r\\n\\t\\t \\t\\t\\tSystem.out.println(\\\"Instructions Read: \\\" + InstructionsRead);\\r\\n\\t\\t \\t\\t\\tif (foundEnd()) {\\r\\n\\t\\t \\t\\t\\t\\tbreak;\\r\\n\\t\\t \\t\\t\\t}\\r\\n\\t\\t \\t\\t\\t/*\\r\\n\\t\\t \\t\\t\\t * The whole instructinsread control architecture doesn't quite work, because\\r\\n\\t\\t \\t\\t\\t * the ST doesn't count the whitespace it reads in. This is by design because\\r\\n\\t\\t \\t\\t\\t * the prof specified that whitespace is non-regulated and thus we cannot\\r\\n\\t\\t \\t\\t\\t * predict exactly how many instances of char dec value 32 (space) will appear\\r\\n\\t\\t \\t\\t\\t * before and/or between the label/instruction/operand 'fields'. \\r\\n\\t\\t \\t\\t\\t * \\r\\n\\t\\t \\t\\t\\t * What we could try alternatively is to structure the control around'\\r\\n\\t\\t \\t\\t\\t * the optab, since it it static and populated pre-runtime. The schema might\\r\\n\\t\\t \\t\\t\\t * go something like this: first convert whatever the sval or nval is to string.\\r\\n\\t\\t \\t\\t\\t * Then call the optab.searchOpcode method with the resultant string as the input\\r\\n\\t\\t \\t\\t\\t * parameter. If the string is in optab then it is an instruction and the ST is in the\\r\\n\\t\\t \\t\\t\\t * instruction 'field' and boolean foundInst is set to true. If it is not in optab AND a boolean variable foundInst which resets to\\r\\n\\t\\t \\t\\t\\t * false at the beginning of each new line is still false, then it is a label being declared in the label 'field'\\r\\n\\t\\t \\t\\t\\t * If it is not in the optab AND foundInst is true, then the ST is at the operand 'field'.\\r\\n\\t\\t \\t\\t\\t * This should work even if the prof has a crappy line with just a label declaration and no instruction or operand, because there\\r\\n\\t\\t \\t\\t\\t * definitely cannot be an operand without an instruction...\\r\\n\\t\\t \\t\\t\\t */\\r\\n\\t\\t \\t\\t\\tif (instFound){\\r\\n\\t\\t \\t\\t\\t\\tprocessOperand(st);\\r\\n\\t\\t \\t\\t\\t}\\r\\n\\t\\t \\t\\t\\tif (!instFound) {//this is either label or instruction field\\r\\n\\t\\t \\t\\t\\t\\t//before anything, search optab to see if this might be the opcode\\r\\n\\t\\t \\t\\t\\t\\t//if it is an opcode, send it to the opcode processing function\\r\\n\\t\\t \\t\\t\\t\\tif (st.sval.equals(\\\"WORD\\\") || st.sval.equals(\\\"BYTE\\\")){//these are the directives... not technically instructions, but they go in the instruction field\\r\\n\\t\\t \\t\\t\\t\\t\\tresCount = 0;\\r\\n\\t\\t \\t\\t\\t\\t\\tif (st.sval.equals(\\\"WORD\\\")){\\r\\n\\t\\t \\t\\t\\t\\t\\t\\tif (hexDigitCount >= 55){\\r\\n\\t\\t \\t\\t\\t\\t\\t\\t\\tnewTHandle();\\r\\n\\t\\t \\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t \\t\\t\\t\\t\\t\\thexDigitCount += 6;\\r\\n\\t\\t \\t\\t\\t\\t\\t}\\r\\n\\t\\t \\t\\t\\t\\t\\tif (st.sval.equals(\\\"BYTE\\\")){\\r\\n\\t\\t \\t\\t\\t\\t\\t\\tconstantCaseB = true;\\r\\n\\t\\t \\t\\t\\t\\t\\t}\\r\\n\\t\\t \\t\\t\\t\\t\\tinstFound = true;\\r\\n\\t\\t \\t\\t\\t\\t\\tprocessOpcode(st);\\r\\n\\t\\t \\t\\t\\t\\t}\\r\\n\\t\\t \\t\\t\\t\\telse if (st.sval.equals(\\\"RESW\\\") || st.sval.equals(\\\"RESB\\\")){//these are the directives... not technically instructions, but they go in the instruction field\\r\\n\\t\\t \\t\\t\\t\\t\\tresCount++;\\r\\n\\t\\t \\t\\t\\t\\t\\tnewTHandle();\\r\\n\\t\\t \\t\\t\\t\\t\\tinstFound = true;\\r\\n\\t\\t \\t\\t\\t\\t\\tprocessOpcode(st);\\r\\n\\t\\t \\t\\t\\t\\t}\\r\\n\\t\\t \\t\\t\\t\\telse if (optab.searchOpcode(st.sval)) {//if true this is the instruction\\r\\n\\t\\t \\t\\t\\t\\t\\tresCount = 0;\\r\\n\\t\\t \\t\\t\\t\\t\\tif (hexDigitCount >= 55){\\r\\n\\t \\t\\t\\t\\t\\t\\t\\tnewTHandle();\\r\\n\\t \\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t \\t\\t\\t\\t\\thexDigitCount += 6;\\r\\n\\t\\t \\t\\t\\t\\t\\tinstFound = true;\\r\\n\\t\\t \\t\\t\\t\\t\\tprocessOpcode(st);\\r\\n\\t\\t \\t\\t\\t\\t\\t//InstructionsRead++;\\r\\n\\t\\t \\t\\t\\t\\t}\\r\\n\\t\\t \\t\\t\\t\\telse {//otherwise this is the label\\r\\n\\t\\t \\t\\t\\t\\t\\tprocessLabel(st);\\r\\n\\t\\t \\t\\t\\t\\t}\\r\\n\\t\\t \\t\\t\\t\\t\\r\\n\\t\\t \\t\\t\\t\\t\\r\\n\\t\\t \\t\\t\\t\\t\\r\\n\\t\\t \\t\\t\\t}\\r\\n\\t\\t \\t\\t\\t//else{ //if instFound is true, this must be the operand field\\r\\n\\t\\t \\t\\t\\t\\t\\r\\n\\t\\t \\t\\t\\t\\t//processOperand(st);\\r\\n\\t\\t \\t\\t\\t//}\\r\\n\\t\\t \\t\\t\\t//if (InstructionsRead == 3) {//this is the operand field\\r\\n\\t\\t \\t\\t\\t\\t//processOperand();\\r\\n\\t\\t \\t\\t\\t\\t\\r\\n\\t\\t \\t\\t\\t//}\\r\\n\\t\\t \\t\\t}\\r\\n\\t\\t \\t\\t\\r\\n\\t\\t \\t\\tif (st.ttype == StreamTokenizer.TT_NUMBER) {\\r\\n\\t\\t \\t\\t\\tInstructionsRead++;\\r\\n\\t\\t \\t\\t\\tif (!instFound) {//this is either label or instruction field\\r\\n\\t\\t \\t\\t\\t\\t//before anything, search optab to see if this might be the opcode\\r\\n\\t\\t \\t\\t\\t\\t//if it is an opcode, send it to the opcode processing function\\r\\n\\t\\t \\t\\t\\t\\tif (NtoString(st.nval).equals(\\\"WORD\\\") || NtoString(st.nval).equals(\\\"BYTE\\\")){//these are the directives... not technically instructions, but they go in the instruction field\\r\\n\\t\\t \\t\\t\\t\\t\\tresCount = 0;\\r\\n\\t\\t \\t\\t\\t\\t\\tif (NtoString(st.nval).equals(\\\"WORD\\\")){\\r\\n\\t\\t \\t\\t\\t\\t\\t\\tif (hexDigitCount >= 55){\\r\\n\\t\\t \\t\\t\\t\\t\\t\\t\\tnewTHandle();\\r\\n\\t\\t \\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t \\t\\t\\t\\t\\t\\thexDigitCount += 6;\\r\\n\\t\\t \\t\\t\\t\\t\\t}\\r\\n\\t\\t \\t\\t\\t\\t\\tif (NtoString(st.nval).equals(\\\"BYTE\\\")){\\r\\n\\t\\t \\t\\t\\t\\t\\t\\tconstantCaseB = true;\\r\\n\\t\\t \\t\\t\\t\\t\\t}\\r\\n\\t\\t \\t\\t\\t\\t\\tinstFound = true;\\r\\n\\t\\t \\t\\t\\t\\t\\tprocessOpcodeN(st);\\r\\n\\t\\t \\t\\t\\t\\t}\\r\\n\\t\\t \\t\\t\\t\\tif (NtoString(st.nval).equals(\\\"RESW\\\") || NtoString(st.nval).equals(\\\"RESB\\\")){//these are the directives... not technically instructions, but they go in the instruction field\\r\\n\\t\\t \\t\\t\\t\\t\\tresCount++;\\r\\n\\t\\t \\t\\t\\t\\t\\tnewTHandle();\\r\\n\\t\\t \\t\\t\\t\\t\\tinstFound = true;\\r\\n\\t\\t \\t\\t\\t\\t\\tprocessOpcodeN(st);\\r\\n\\t\\t \\t\\t\\t\\t}\\r\\n\\t\\t \\t\\t\\t\\telse if (optab.searchOpcode(\\\"\\\" + st.nval)) {\\r\\n\\t\\t \\t\\t\\t\\t\\tresCount = 0;\\r\\n\\t\\t \\t\\t\\t\\t\\tif (hexDigitCount >= 55){\\r\\n\\t \\t\\t\\t\\t\\t\\t\\tnewTHandle();\\r\\n\\t \\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t \\t\\t\\t\\t\\thexDigitCount += 6;\\r\\n\\t\\t \\t\\t\\t\\t\\tinstFound = true;\\r\\n\\t\\t \\t\\t\\t\\t\\tprocessOpcodeN(st);\\r\\n\\t\\t \\t\\t\\t\\t\\t//InstructionsRead++;\\r\\n\\t\\t \\t\\t\\t\\t}\\r\\n\\t\\t \\t\\t\\t\\telse {\\r\\n\\t\\t \\t\\t\\t\\t\\tprocessLabelN(st);\\r\\n\\t\\t \\t\\t\\t\\t}\\r\\n\\t\\t \\t\\t\\t\\t\\r\\n\\t\\t \\t\\t\\t}\\r\\n\\t\\t \\t\\t\\telse{ //this is the operand field\\r\\n\\t\\t \\t\\t\\t\\tprocessOperandN(st);\\r\\n\\t\\t \\t\\t\\t}\\r\\n\\t\\t \\t\\t}\\r\\n\\t\\t \\t\\t\\r\\n\\t\\t \\tif (moveOn){\\r\\n\\t\\t \\tst.nextToken(); //read next token in current line\\r\\n\\t\\t \\t}\\r\\n\\t\\t \\t}\\r\\n\\t\\t \\t////write line just finished to IF eventually\\r\\n\\t\\t if (moveOn){\\r\\n\\t\\t st.nextToken(); //read first token of next line\\t\\r\\n\\t\\t }\\r\\n\\t\\t }\\r\\n\\t\\t programLength = (locctr - startAddress); \\r\\n\\t\\t programLength2 = programLength;\\r\\n\\t\\t System.out.println(\\\" !!prgmlngth2:\\\" + Integer.toHexString(programLength2.intValue()));\\r\\n\\t\\t /*\\r\\n\\t\\t sProgramLength = Integer.toHexString(programLength2.intValue());\\r\\n\\t\\t for (int i = 0; i<(6-sProgramLength.length()); i++){\\r\\n\\t\\t \\tmyWriter.write(\\\"0\\\");\\r\\n\\t\\t }\\r\\n\\t\\t myWriter.write(sProgramLength);\\r\\n\\t\\t myWriter.close();\\r\\n\\t\\t ////myWriter.close();\\r\\n\\t\\t \\r\\n\\t\\t */\\r\\n\\t\\t r.close();\\r\\n\\t\\t System.out.println(\\\"?????!?!?!?!?ALPHA?!?!?!?!?!??!?!?!\\\");\\r\\n\\t\\t if (hexDigitCount/2 < 16){\\r\\n\\t\\t \\tlineLength.add(\\\"0\\\" + Integer.toHexString(hexDigitCount/2));\\r\\n\\t\\t }\\r\\n\\t\\t else{\\r\\n\\t\\t lineLength.add(Integer.toHexString(hexDigitCount/2));\\r\\n\\t\\t }\\r\\n\\t\\t for (int i = 0; i<lineLength.size(); i++){\\r\\n\\t\\t System.out.println(lineLength.get(i));\\r\\n\\t\\t }\\r\\n\\t\\t // System.out.println(hexDigitCount);\\r\\n\\t\\t ReadIF pass2 = new ReadIF(this.optab,this.symtab,this.startAddress2,this.programLength2,this.name,this.lineLength,this.userArg);\\r\\n\\t\\t return st.sval;\\r\\n\\t\\t \\r\\n\\t\\t\\r\\n\\r\\n\\t}\",\n \"public void readFromFile() {\\n\\n\\t}\",\n \"private void checkFile() {\\n \\ttry {\\n \\t\\tdata = new BufferedReader(\\n \\t\\t\\t\\t new FileReader(textFile));\\n \\t\\t\\n \\t}\\n \\tcatch(FileNotFoundException e)\\n \\t{\\n \\t\\tSystem.out.println(\\\"The mentioned File is not found.\\\");\\n System.out.println(\\\"\\\");\\n\\t\\t\\tSystem.exit(1);\\n\\t\\t} catch (Exception ex) {\\n\\t\\t\\tSystem.out.println(\\\"The following error occured while reading the file.\\\");\\n\\t\\t\\tex.printStackTrace();\\n\\t\\t\\tSystem.exit(2);\\n\\t\\t}\\n }\",\n \"public List<CorruptionIndex> readFromFile(String filePath){\\n return null;\\n }\",\n \"public void read() {\\n String line = \\\"\\\";\\n int counter = 0;\\n try {\\n input = new BufferedReader(new FileReader(file));\\n while (line != null) {\\n if (!(line.equals(\\\"arglebargle\\\"))) {//not a default\\n names.add(line);\\n }\\n }\\n input.close();\\n }\\n catch (IOException e) {\\n }\\n }\",\n \"public void parseFile() {\\n File file = new File(inputFile);\\n try {\\n Scanner scan = new Scanner(file);\\n\\n while (scan.hasNextLine()) {\\n String line = scan.nextLine();\\n line = line.replaceAll(\\\"\\\\\\\\s+\\\", \\\" \\\").trim();\\n\\n if (line.isEmpty()) {\\n continue;\\n }\\n // System.out.println(line);\\n String cmd = line.split(\\\" \\\")[0];\\n String lineWithoutCmd = line.replaceFirst(cmd, \\\"\\\").trim();\\n // System.out.println(lineWithoutCmd);\\n\\n // The fields following each command\\n String[] fields;\\n\\n switch (cmd) {\\n case (\\\"add\\\"):\\n fields = lineWithoutCmd.split(\\\"<SEP>\\\");\\n fields[0] = fields[0].trim();\\n fields[1] = fields[1].trim();\\n fields[2] = fields[2].trim();\\n add(fields);\\n break;\\n case (\\\"delete\\\"):\\n\\n fields = split(lineWithoutCmd);\\n delete(fields[0], fields[1]);\\n break;\\n case (\\\"print\\\"):\\n if (lineWithoutCmd.equals(\\\"ratings\\\")) {\\n printRatings();\\n break;\\n }\\n fields = split(lineWithoutCmd);\\n\\n print(fields[0], fields[1]);\\n\\n break;\\n case (\\\"list\\\"):\\n // need to check if it is the movie or reviewer\\n fields = split(lineWithoutCmd);\\n list(fields[0], fields[1]);\\n break;\\n case (\\\"similar\\\"):\\n // need to check if it is the movie or reviewer\\n fields = split(lineWithoutCmd);\\n similar(fields[0], fields[1]);\\n break;\\n default:\\n break;\\n }\\n\\n }\\n\\n }\\n catch (FileNotFoundException e) {\\n e.printStackTrace();\\n }\\n }\",\n \"public void readInput(String fileName){\\n\\n BufferedReader reader;\\n try {\\n reader = new BufferedReader(new FileReader(fileName));\\n String line = reader.readLine(); //read first line\\n int numLine =1; //keep track the number of line\\n while (line != null) {\\n String[] tokens = line.trim().split(\\\"\\\\\\\\s+\\\"); //split line into token\\n if(numLine==1){ //for the first line\\n intersection = Integer.parseInt(tokens[0]); //set the number of intersection\\n roadways = Integer.parseInt(tokens[1]); // set the number of roadways\\n coor = new Coordinates[intersection];\\n g = new Graph(intersection);//create a graph\\n line = reader.readLine();\\n numLine++;\\n }\\n else if(numLine>1&&numLine<intersection+2){ //for all intersection\\n while(numLine>1&&numLine<intersection+2){\\n tokens = line.trim().split(\\\"\\\\\\\\s+\\\");\\n coor[Integer.parseInt(tokens[0])] = new Coordinates(Integer.parseInt(tokens[1]),Integer.parseInt(tokens[2])); //add into coor array to keep track the coor of intersection\\n line = reader.readLine();\\n numLine++;\\n }\\n }\\n else if(numLine ==intersection+2){ //skip the space line\\n line = reader.readLine();\\n numLine++;\\n while(numLine<roadways+intersection+3){ // for all the roadways, only include the number of roadways mention in the first line\\n tokens = line.trim().split(\\\"\\\\\\\\s+\\\");\\n int fst = Integer.parseInt(tokens[0]);\\n int snd = Integer.parseInt(tokens[1]);\\n g.addEgde(fst,snd,coor[fst].distTo(coor[snd]));\\n line = reader.readLine();\\n numLine++;\\n }\\n }\\n else if(numLine >= roadways+intersection+3)\\n break;\\n }\\n reader.close();\\n } catch (FileNotFoundException e){\\n e.printStackTrace();\\n } catch (IOException e) {\\n e.printStackTrace();\\n }\\n }\",\n \"private void readFromFile(){\\n\\t\\t\\n\\t\\ttry {\\n\\t\\t\\tFile file=new File(\\\"controller.txt\\\");\\n\\t\\t\\tFileInputStream fin;\\n\\t\\t\\tfin = new FileInputStream(file);\\n\\t\\t\\tDataInputStream din=new DataInputStream(fin);\\n\\t\\t\\tBufferedReader br=new BufferedReader(new InputStreamReader(din));\\n\\t\\t\\t\\n\\t\\t\\tfor(int i=0; i<2; i++){\\n\\t\\t\\t\\tif(i==0)\\n\\t\\t\\t\\t\\tcodedUserName=br.readLine();\\n\\t\\t\\t\\telse \\n\\t\\t\\t\\t\\tcodedPassword=br.readLine();\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t} catch (FileNotFoundException e) {\\n\\t\\t\\t// TODO Auto-generated catch block\\n\\t\\t\\te.printStackTrace();\\n\\t\\t} catch (IOException e) {\\n\\t\\t\\t// TODO Auto-generated catch block\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t\\t\\n\\t}\",\n \"public int[] readBasicInfo() throws IOException\\n\\t{\\n\\t\\t//Creates a FileReader and BufferedReader to read from the file that you pass it\\n\\t\\tFileReader fr = new FileReader(path);\\n\\t\\tBufferedReader textReader = new BufferedReader(fr);\\n\\t\\t\\n\\t\\t//Creates a new array to read the first line of data to (is an array because need to convert to int list)\\n\\t\\tString textData;\\n\\t\\t\\n\\t\\t//Reads the first line of the text file into the array\\n\\t\\ttextData = textReader.readLine();\\n\\t\\t\\n\\t\\tint[] data = new int[5];\\n\\t\\t//Create a holding variable that will help to convert the String list over to an int list\\n\\t\\tString[] tempList = new String[6];\\n\\t\\t//List of deliminations that will be parsed out of the read strings in the string list that the function is passed\\n\\t\\tString delims = \\\"[,()]+\\\";\\n\\t\\t//Splits the strings from the file by the parenthesis and the commas\\n\\t\\ttempList = textData.split(delims);\\n\\t\\tfor (int i = 1; i < tempList.length; i++)\\n\\t\\t\\tdata[i-1] = Integer.parseInt(tempList[i]);\\n\\t\\t\\n\\t\\t//Returns the array containing the first line of the text file\\n\\t\\treturn data;\\n\\t}\",\n \"TraceList read(File file) throws IOException;\",\n \"private boolean readFile(String fileName) {\\n Message msg = new Message();\\n FileInputStream fis;\\n InputStreamReader isr;\\n BufferedReader br;\\n int depCount = 0;\\n int depIndex = 0;\\n float xIndex = 0;\\n float yIndex = 0;\\n int dist = 0;\\n int capacity = 0;\\n File file = new File(fileName);\\n\\n try {\\n //open the requested file\\n fis = new FileInputStream(file);\\n isr = new InputStreamReader(fis);\\n br = new BufferedReader(isr);\\n } catch (Exception e) {\\n System.err.println(\\\"File is not present \\\" + file);\\n\\n return false;\\n }\\n\\n String line;\\n StringTokenizer st = null;\\n\\n try {\\n br.readLine(); // skip text labels\\n line = br.readLine(); // depot constraints\\n st = new StringTokenizer(line);\\n\\n // skip text labels\\n br.readLine();\\n } catch (IOException ex) {\\n System.err.println(\\\"Error reading depot file: \\\" + fileName + \\\": \\\" +\\n ex);\\n }\\n\\n try {\\n depCount = Integer.parseInt(st.nextToken().trim());\\n dist = Integer.parseInt(st.nextToken().trim());\\n capacity = Integer.parseInt(st.nextToken().trim());\\n } catch (NumberFormatException ex) {\\n System.err.println(\\\"Error processing depot constraint info: \\\" + ex);\\n }\\n\\n //process depots\\n for (int i = 0; i < depCount; i++) {\\n try {\\n line = br.readLine();\\n st = new StringTokenizer(line);\\n } catch (IOException ex) {\\n System.err.println(\\\"Error reading depot file: \\\" + fileName +\\n \\\": \\\" + ex);\\n }\\n\\n //read the depot information\\n try {\\n depIndex = Integer.parseInt(st.nextToken().trim());\\n xIndex = Float.parseFloat(st.nextToken().trim());\\n yIndex = Float.parseFloat(st.nextToken().trim());\\n } catch (NumberFormatException ex) {\\n System.err.println(\\\"Error processing depot coordinate info: \\\" +\\n ex);\\n }\\n\\n // build the message\\n msg.addArgument(IndexTag, \\\"\\\" + depIndex);\\n msg.addArgument(XCoordTag, \\\"\\\" + xIndex);\\n msg.addArgument(YCoordTag, \\\"\\\" + yIndex);\\n }\\n\\n //save max distance and capacity\\n if (dist == 0) { //if no max distance, set to a large number...\\n dist = 999999999;\\n }\\n\\n if (capacity == 0) { //if there is no maximum capacity, set it to a very large number\\n capacity = 999999999;\\n }\\n\\n // build the message\\n msg.addArgument(NumberOfDepotsTag, \\\"\\\" + depCount);\\n msg.addArgument(MaxCapacityTag, \\\"\\\" + capacity);\\n msg.addArgument(MaxDistanceTag, \\\"\\\" + dist);\\n msg.addArgument(FileNameTag, fileName);\\n\\n zAdapt.setProblemConstraints(msg);\\n\\n return true;\\n }\",\n \"public void fileRead() {\\n\\t\\tString a, b;\\n\\t\\t\\n\\t\\twhile (input.hasNext()) {\\n\\t\\t\\ta = input.next();\\n\\t\\t\\tb = input.next();\\n\\t\\t\\tSystem.out.printf(\\\"%s %s\\\\n\\\", a, b);\\n\\t\\t}\\n\\t}\",\n \"Points(String filepath){\\n readPointsFile(filepath); //dengan file points.txt\\n }\",\n \"private static void fileRead(String file) {\\n\\t\\ttry {\\n\\t\\t\\tBufferedReader br = new BufferedReader(new FileReader(file));\\n\\t\\t\\tString line = \\\"\\\";\\n\\t\\t\\twhile((line=br.readLine())!=null) {\\n\\t\\t\\t\\tString data[] = line.split(\\\"\\\\\\\\t\\\");\\n\\t\\t\\t\\tint id = Integer.parseInt(data[0]);\\n\\t\\t\\t\\tint groundTruth = Integer.parseInt(data[1]);\\n\\t\\t\\t\\tactualClusters.put(id, groundTruth);\\n\\t\\t\\t\\tArrayList<Double> temp = new ArrayList<>();\\n\\t\\t\\t\\tfor(int i=2;i<data.length;i++) {\\n\\t\\t\\t\\t\\ttemp.add(Double.parseDouble(data[i]));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcols = data.length-2;\\n\\t\\t\\t\\tgeneAttributes.put(id, temp);\\n\\t\\t\\t\\tallClusters.add(id+\\\"\\\");\\n\\t\\t\\t\\ttotalGenes++;\\n\\t\\t\\t}\\n\\t\\t\\ttotalCluster = totalGenes;\\n\\t\\t\\tbr.close();\\n\\t\\t} catch(Exception e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t}\",\n \"public static void main(String[] args) throws IOException {\\n\\t\\t\\n\\t\\tString folder = \\\"/Users/haopeng/Dropbox/research/2nd/Usecase/Yanlei/\\\";\\n\\t\\tString fileName = \\\"P0_2324.txt\\\";\\n\\t\\t\\n\\t\\tFileReader reader = new FileReader(folder + fileName, 20000000);\\n\\t\\treader.parseFile();\\n\\t\\t\\n\\t\\t//reader.printValues(reader.getServerName(), \\\"ServerName\\\");\\n\\t\\t//reader.printValues(reader.getCommand(), \\\"Command\\\");\\n\\t\\t//reader.printValues(reader.getTimestamp(), \\\"Timestamp\\\"); \\n\\t\\t//reader.printValues(reader.getPath(), \\\"Path\\\");\\n\\t\\treader.printValues(reader.getMethod(), \\\"Method\\\");\\n\\t}\",\n \"public static void main(String[] args) throws FileNotFoundException {\\n\\t\\tSkipList<String, Rectangle> list = new SkipList<String, Rectangle>();\\n\\t\\tString file = args[0];\\n\\t\\tScanner scan = new Scanner(new File(file));\\n\\t\\t// FileProcessor fp = new FileProcessor();\\n\\t\\t// fp.fileParser(line);\\n\\t\\ttry {\\n\\t\\t\\tString lineReader = \\\"\\\";\\n\\t\\t\\twhile (scan.hasNextLine()) {\\n\\t\\t\\t\\tlineReader = scan.nextLine();\\n\\t\\t\\t\\t// regex string delimeter we need to figure out to get rid of excess whitespace\\n\\t\\t\\t\\t// between parameters in text file\\n\\t\\t\\t\\tString CMD = lineReader.trim();\\n\\t\\t\\t\\tString[] lineCMD = CMD.split(\\\"\\\\\\\\s+\\\");\\n\\t\\t\\t\\t// switch statement for all situations\\n\\t\\t\\t\\tswitch (lineCMD[0]) {\\n\\t\\t\\t\\tcase \\\"insert\\\":\\n\\t\\t\\t\\t\\tString name = lineCMD[1];\\n\\t\\t\\t\\t\\tint xCord = Integer.parseInt(lineCMD[2]);\\n\\t\\t\\t\\t\\tint yCord = Integer.parseInt(lineCMD[3]);\\n\\t\\t\\t\\t\\tint width = Integer.parseInt(lineCMD[4]);\\n\\t\\t\\t\\t\\tint height = Integer.parseInt(lineCMD[5]);\\n\\t\\t\\t\\t\\tRectangle rect = new Rectangle(name, xCord, yCord, width, height);\\n\\t\\t\\t\\t\\tKVPair<String, Rectangle> item = new KVPair<String, Rectangle>(name, rect);\\n\\t\\t\\t\\t\\tif (width <= 0 || height <= 0 || (xCord + width > 1024) || (xCord + width < 0)\\n\\t\\t\\t\\t\\t\\t\\t|| (yCord + height > 1024) || (yCord + height < 0) || (xCord < 0) || (yCord < 0)) {\\n\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"Rectangle rejected: (\\\" + name + \\\", \\\" + xCord + \\\", \\\" + yCord + \\\", \\\" + width\\n\\t\\t\\t\\t\\t\\t\\t\\t+ \\\", \\\" + height + \\\")\\\");\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tlist.insert(name, rect);\\n\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"Rectangle Inserted: (\\\" + name + \\\", \\\" + xCord + \\\", \\\" + yCord + \\\", \\\" + width\\n\\t\\t\\t\\t\\t\\t\\t\\t+ \\\", \\\" + height + \\\")\\\");\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\t\\tcase \\\"remove\\\":\\n\\t\\t\\t\\t\\t// System.out.println(scan.nextLine());\\n\\t\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\t\\tcase \\\"regionsearch\\\":\\n\\t\\t\\t\\t\\t// System.out.println(scan.nextLine());\\n\\t\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\t\\tcase \\\"intersections\\\":\\n\\t\\t\\t\\t\\t// System.out.println(scan.nextLine());\\n\\t\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\t\\tcase \\\"search\\\":\\n\\t\\t\\t\\t\\t// System.out.println(scan.nextLine());\\n\\t\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\t\\tcase \\\"dump\\\":\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"SkipList dump: \\\");\\n\\t\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tSystem.out.println(lineCMD[0]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t// line = scan.nextLine();\\n\\t\\tcatch (Exception e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\n\\t\\t// String line = scan.nextLine();\\n\\t\\t// System.out.println(line);\\n\\t\\t// System.out.println(file);\\n\\t\\t// fileParser(file);\\n\\t\\t// Rectangle1 rect = new Rectangle1();\\n\\n\\t}\",\n \"private ArrayList<String> parseFile(String file_name){ // extract each line from file AS string (stopList)\\r\\n ArrayList<String> list = new ArrayList<>();\\r\\n Scanner scanner = null;\\r\\n try{\\r\\n scanner = new Scanner(new BufferedReader(new FileReader(file_name)));\\r\\n while (scanner.hasNextLine())\\r\\n {\\r\\n list.add(scanner.nextLine());\\r\\n }\\r\\n }\\r\\n catch (Exception e ){ System.out.println(\\\"Error reading file -> \\\"+e.getMessage()); }\\r\\n finally {\\r\\n if(scanner != null ){scanner.close();} // close the file\\r\\n }\\r\\n return list;\\r\\n }\",\n \"private void loadInformation(){\\n\\t\\ttry{\\n\\t\\t\\tFileReader fr = new FileReader(\\\"SpaceProgramGaussDistribution.txt\\\");\\n\\t\\t\\tBufferedReader br = new BufferedReader(fr);\\n\\t\\t\\tScanner sc = new Scanner(br);\\n\\t\\t\\t\\n\\t\\t\\tString info = \\\"\\\";\\n\\t\\t\\t\\n\\t\\t\\twhile(sc.hasNextLine()){\\n\\t\\t\\t\\tinfo += sc.nextLine();\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tString split[] = info.split(\\\"#\\\");\\n\\t\\t\\t\\n\\t\\t\\tfor(int i = 0; i < split.length; i++){\\n\\t\\t\\t\\tpopulationInfo += split[i]+\\\"\\\\n\\\";\\n\\t\\t\\t}\\n\\t\\t\\tsc.close();\\n\\t\\t\\tbr.close();\\n\\t\\t\\tfr.close();\\n\\t\\t\\t\\n\\t\\t}catch(Exception e){\\n\\t\\t\\tSystem.out.println(\\\"File not found: SpaceProgramGaussDistribution.txt\\\");\\n\\t\\t}\\n\\t}\",\n \"private void readFile() {\\r\\n\\t\\tScanner sc = null; \\r\\n\\t\\ttry {\\r\\n\\t\\t\\tsc = new Scanner(inputFile);\\t\\r\\n\\t\\t\\twhile(sc.hasNextLine()){\\r\\n\\t\\t\\t\\tgrade.add(sc.nextLine());\\r\\n\\t } \\r\\n\\t\\t}\\r\\n\\t\\tcatch (FileNotFoundException e) {\\r\\n\\t\\t\\te.printStackTrace();\\r\\n\\t\\t}\\r\\n\\t\\tfinally {\\r\\n\\t\\t\\tsc.close();\\r\\n\\t\\t}\\t\\t\\r\\n\\t}\",\n \"@SuppressWarnings(\\\"AccessingNonPublicFieldOfAnotherObject\\\")\\n\\t// Accessing final fields of a private inner class that is not exported\\n\\tprivate void processFile(boolean initial)\\n\\t{\\n\\t\\tlog(Level.INFO, \\\"Processing MOTD file \\\" + f.getPath());\\n\\t\\tBufferedReader in = null;\\n\\t\\tMessage curr = null;\\n\\t\\tfinal LinkedList<Message> stack = new LinkedList<Message>();\\n\\n\\t\\ttry\\n\\t\\t{\\n\\t\\t\\tin = new BufferedReader(new FileReader(f));\\n\\n\\t\\t\\twhile (in.ready())\\n\\t\\t\\t{\\n\\t\\t\\t\\tString line = in.readLine().trim();\\n\\n\\t\\t\\t\\tif (line.charAt(0) == '#') continue;\\n\\t\\t\\t\\tif (line.equals(\\\"[Message]\\\"))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif (curr != null) stack.push(curr);\\n\\t\\t\\t\\t\\tcurr = new Message();\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif (curr == null) continue;\\n\\t\\t\\t\\tint div = line.indexOf('=');\\n\\t\\t\\t\\tif (div == -1) continue;\\n\\n\\t\\t\\t\\tString field = line.substring(0,div).toLowerCase();\\n\\t\\t\\t\\tString value = line.substring(div+1);\\n\\n\\t\\t\\t\\tif (field.equals(\\\"id\\\"))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tcurr.id = Integer.parseInt(value);\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (initial) continue; // We only care for ids in initial pass\\n\\t\\t\\t\\tif (field.equals(\\\"active\\\"))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tcurr.active = Boolean.valueOf(value);\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (field.equals(\\\"title\\\"))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tcurr.title = value;\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (field.equals(\\\"short\\\"))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tcurr.mshort = value;\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (field.equals(\\\"long\\\"))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tcurr.mlong = value;\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (field.equals(\\\"from\\\"))\\n\\t\\t\\t\\t{\\n//\\t\\t\\t\\t\\tcurr.from = new Date(value).getTime();\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (field.equals(\\\"to\\\"))\\n\\t\\t\\t\\t{\\n//\\t\\t\\t\\t\\tcurr.to = new Date(value).getTime();\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (field.equals(\\\"posterid\\\"))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tcurr.poster_uid = value;\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (field.equals(\\\"postername\\\"))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tcurr.poster_name = value;\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (field.equals(\\\"showunix\\\")) continue;\\n\\n\\t\\t\\t\\tlog(Level.WARNING, \\\"Unknown Field '\\\" + field + \\\"'\\\");\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcatch (IOException ex)\\n\\t\\t{\\n\\t\\t\\tlog(Level.WARNING, ex);\\n\\t\\t}\\n\\t\\tcatch (Throwable ex)\\n\\t\\t{\\n\\t\\t\\tlog(Level.SEVERE, ex.getMessage());\\n\\t\\t}\\n\\t\\tfinally\\n\\t\\t{\\n\\t\\t\\ttry\\n\\t\\t\\t{\\n\\t\\t\\t\\tin.close();\\n\\t\\t\\t}\\n\\t\\t\\tcatch (IOException ex)\\n\\t\\t\\t{\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif (curr != null) stack.push(curr);\\n\\t\\tlastModified = f.lastModified();\\n\\n\\t\\tif (initial)\\n\\t\\t{\\n\\t\\t\\tif (stack.size() > 0) lastId = stack.getLast().id;\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tfor (Message m : stack)\\n\\t\\t{\\n\\t\\t\\tif (m.id > lastId)\\n\\t\\t\\t{\\n\\t\\t\\t\\tlog(Level.INFO, \\\"Sending MOTD Notice #\\\" + m.id);\\n\\t\\t\\t\\tgetInstance().message(channel, m.toString());\\n\\t\\t\\t\\tlastId = m.id;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"public void readFile()\\r\\n\\t{\\r\\n\\t\\t\\r\\n\\t\\ttry\\r\\n\\t\\t{\\r\\n\\t\\t\\tx = new Scanner(new File(\\\"clean vipr measles results.txt\\\"));\\r\\n\\t\\t\\t\\r\\n\\t\\t\\twhile (x.hasNext())\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tString a = x.next();\\r\\n\\t\\t\\t\\tString b = x.next();\\r\\n\\t\\t\\t\\tString c = x.next();\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tSystem.out.printf(\\\"%s %s %s \\\\n\\\\n\\\", a,b,c);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tx.close();\\r\\n\\t\\t}\\r\\n\\t\\tcatch (Exception e)\\r\\n\\t\\t{\\r\\n\\t\\t\\tSystem.out.println(\\\"file not found\\\");\\r\\n\\t\\t}\\r\\n\\t\\r\\n\\t}\",\n \"public String read(String user, String action) throws FileNotFoundException, IOException {\\r\\n\\t\\tString filename = user + \\\".txt\\\";\\r\\n \\tString absoluteFilePath = \\\"\\\";\\r\\n\\t\\tString workingDirectory = System.getProperty(\\\"user.dir\\\");\\r\\n\\t\\tArrayList<String> create = new ArrayList<String>();\\r\\n\\t\\tArrayList<String> logged = new ArrayList<String>();\\r\\n\\t\\tArrayList<String> updated = new ArrayList<String>();\\r\\n\\t\\tArrayList<String> removed = new ArrayList<String>();\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t\\t//absoluteFilePath = workingDirectory + System.getProperty(\\\"file.separator\\\") + filename;\\r\\n\\t\\tabsoluteFilePath = workingDirectory + File.separator + filename;\\r\\n\\t\\ttry(BufferedReader br = new BufferedReader(new FileReader(absoluteFilePath))) {\\r\\n\\t\\t StringBuilder sb = new StringBuilder();\\r\\n\\t\\t String line = br.readLine();\\r\\n\\t\\t \\r\\n\\t\\t while (line != null) {\\r\\n\\t\\t \\t\\r\\n\\t\\t \\t\\r\\n\\t\\t \\tString arr[] = line.split(\\\" \\\");\\r\\n\\t\\t \\tString firstWord = arr[0];\\r\\n\\t\\t \\tif(firstWord.equals(\\\"'Created\\\"))\\r\\n\\t\\t {\\r\\n\\t\\t \\t\\r\\n\\t\\t \\tcreate.add(line);\\r\\n\\t\\t \\t\\r\\n\\t\\t }\\r\\n\\t\\t \\t\\r\\n\\t\\t \\telse if(firstWord.equals(\\\"'Logged\\\"))\\r\\n\\t\\t {\\r\\n\\t\\t \\t\\r\\n\\t\\t \\tlogged.add(line);\\r\\n\\t\\t \\t\\r\\n\\t\\t }\\r\\n\\t\\t \\t\\r\\n\\t\\t \\telse if(firstWord.equals(\\\"'Updated\\\"))\\r\\n\\t\\t {\\r\\n\\t\\t \\t\\r\\n\\t\\t \\tupdated.add(line);\\r\\n\\t\\t \\t\\r\\n\\t\\t }\\r\\n\\t\\t \\t\\r\\n\\t\\t \\telse if(firstWord.equals(\\\"'Removed\\\"))\\r\\n\\t\\t {\\r\\n\\t\\t \\t\\r\\n\\t\\t \\tremoved.add(line);\\r\\n\\t\\t \\t\\r\\n\\t\\t }\\r\\n\\t\\t \\t\\r\\n\\t\\t \\r\\n\\t\\t line = br.readLine();\\r\\n \\r\\n\\t\\t }\\r\\n\\t\\t \\r\\n\\t\\t \\r\\n\\t\\t if(action==\\\"logged\\\")\\r\\n\\t\\t {\\r\\n\\t\\t for(String d : logged)\\r\\n\\t\\t {\\r\\n\\t\\t \\tsb.append(\\\"<p style='font-size: 80%'>\\\");\\r\\n\\t\\t\\t sb.append(d);\\r\\n\\t\\t\\t sb.append(\\\"</p>\\\");\\r\\n\\t\\t }\\r\\n\\t\\t }\\r\\n\\t\\t \\r\\n\\t\\t \\r\\n\\t\\t else if(action==\\\"create\\\")\\r\\n\\t {\\r\\n\\t\\t for(String d : create)\\r\\n\\t\\t {\\r\\n\\t\\t \\tsb.append(\\\"<p style='font-size: 80%'>\\\");\\r\\n\\t\\t\\t sb.append(d);\\r\\n\\t\\t\\t sb.append(\\\"</p>\\\");\\r\\n\\t\\t \\t\\r\\n\\t\\t }\\r\\n\\t } \\r\\n\\t\\t \\r\\n\\t\\r\\n\\t\\t else if(action==\\\"update\\\")\\r\\n\\t {\\r\\n\\t\\t for(String d : updated)\\r\\n\\t\\t {\\r\\n\\t\\t \\tsb.append(\\\"<p style='font-size: 80%'>\\\");\\r\\n\\t\\t\\t sb.append(d);\\r\\n\\t\\t\\t sb.append(\\\"</p>\\\");\\r\\n\\t\\r\\n\\t\\t }\\r\\n\\t }\\r\\n\\t\\t \\r\\n\\t\\t \\r\\n\\t\\t \\r\\n\\t\\t else if(action==\\\"remove\\\") \\r\\n\\t\\t {\\r\\n\\t\\t for(String d : removed)\\r\\n\\t\\t {\\r\\n\\t\\t \\tsb.append(\\\"<p style='font-size: 80%'>\\\");\\r\\n\\t\\t\\t sb.append(d);\\r\\n\\t\\t\\t sb.append(\\\"</p>\\\");\\r\\n\\t\\r\\n\\t\\t }\\r\\n\\t\\t }\\r\\n\\t\\t \\r\\n\\t\\t \\r\\n\\t\\t String everything = sb.toString();\\r\\n\\t\\t return everything;\\r\\n\\t\\t} \\r\\n\\t}\",\n \"public void readFile();\",\n \"public Set<ContextualActivity> read() {\\n Set<ContextualActivity> defaultActivities = new HashSet<ContextualActivity>();\\n try {\\n\\n Scanner s = new Scanner(input);\\n while (s.hasNextLine()) {\\n // verb, noun, locations, times, duration\\n String infos[] = (s.nextLine()).split(\\\",\\\");\\n\\n Set<String> locations = new HashSet<String>();\\n Collections.addAll(locations, infos[2].split(Cons.ENTRY_SEPARATOR_REG));\\n\\n Set<TimeOfDay> times = new HashSet<TimeOfDay>();\\n for (String tm : infos[3].split(Cons.ENTRY_SEPARATOR_REG)) {\\n try {\\n times.add(TimeOfDay.valueOf(tm.toUpperCase()));\\n }\\n catch (Exception e){\\n }\\n }\\n\\n defaultActivities.add(new DefaultActivity(infos[0], infos[1], locations, times, infos[4]));\\n }\\n\\n return defaultActivities;\\n } catch (Exception e) {\\n e.printStackTrace();\\n }\\n return defaultActivities;\\n }\",\n \"private void checkMaze(File inputFile) throws FileNotFoundException\\r\\n ,IllegalStateException {\\r\\n boolean hasStart=false,hasGoal=false;\\r\\n Scanner readFile= new Scanner(inputFile);\\r\\n String line;\\r\\n char c;\\r\\n while(readFile.hasNextLine()){\\r\\n line= readFile.nextLine();\\r\\n for(int i=0;i<line.length();i++){\\r\\n c=line.charAt(i);\\r\\n\\r\\n if (c!='S'&&c!='G'&&c!='*'&&c!=' ')\\r\\n throw new IllegalStateException(\\r\\n \\\"File holds invalid symbols\\\");\\r\\n if(c==START)\\r\\n hasStart=true;\\r\\n if(c==GOAL)\\r\\n hasGoal=true;\\r\\n }\\r\\n }\\r\\n\\r\\n if(!hasStart||!hasGoal)\\r\\n throw new IllegalStateException(\\\"Maze missing necessary values\\\");\\r\\n\\r\\n readFile.close();\\r\\n }\",\n \"boolean input(String filename){\\n\\t\\tScanner in = null;\\n\\t\\tString word;\\n\\t\\ttry {\\t\\t\\t\\n\\t\\t\\tin=new Scanner(new BufferedReader(new FileReader(filename)));\\n\\t\\t\\t//in=new Scanner(new FileReader(filename));\\n\\t\\t\\tif(in.hasNext())\\n\\t\\t\\t\\tword=in.next();\\n\\t\\t\\telse return false;\\n\\t\\t\\tif(word.equals(\\\"//tokens\\\")){\\n\\t\\t\\t\\tif(in.hasNext())\\n\\t\\t\\t\\t\\tword=in.next();\\n\\t\\t\\t\\twhile(!word.equals(\\\"//reserved\\\")){\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tString token_name= word;\\n\\t\\t\\t\\t\\tif(in.hasNext())\\n\\t\\t\\t\\t\\t\\tword=in.next();\\n\\t\\t\\t\\t\\telse return false;\\n\\t\\t\\t\\t\\tString token_RE=word;\\n\\t\\t\\t\\t\\tRegexPattern ptn=new RegexPattern(token_name,token_RE);\\t\\t//to be modified\\n\\t\\t\\t\\t\\ttable_pt.add(ptn);\\n\\t\\t\\t\\t\\tif(in.hasNext())\\n\\t\\t\\t\\t\\t\\tword=in.next();\\n\\t\\t\\t\\t\\telse return false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(in.hasNext())\\n\\t\\t\\t\\t\\tword=in.next();\\n\\t\\t\\t\\twhile(!word.equals(\\\"//operator\\\")){\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tString name= word;\\n\\t\\t\\t\\t\\tif(in.hasNext())\\n\\t\\t\\t\\t\\t\\tword=in.next();\\n\\t\\t\\t\\t\\telse return false;\\n\\t\\t\\t\\t\\tString value=word;\\n\\t\\t\\t\\t\\tReservedWord res=new ReservedWord(name,value);\\t\\t\\n\\t\\t\\t\\t\\ttable_res.add(res);\\n\\t\\t\\t\\t\\tif(in.hasNext())\\n\\t\\t\\t\\t\\t\\tword=in.next();\\n\\t\\t\\t\\t\\telse return false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(in.hasNext())\\n\\t\\t\\t\\t\\tword=in.next();\\n\\t\\t\\t\\twhile(!word.equals(\\\"//end\\\")){\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tString name= word;\\n\\t\\t\\t\\t\\tif(in.hasNext())\\n\\t\\t\\t\\t\\t\\tword=in.next();\\n\\t\\t\\t\\t\\telse return false;\\n\\t\\t\\t\\t\\tString value=word;\\n\\t\\t\\t\\t\\tReservedWord rsv=new ReservedWord(name,value);\\t\\t\\n\\t\\t\\t\\t\\ttable_res.add(rsv);\\n\\t\\t\\t\\t\\ttable_op.add(rsv);\\n\\t\\t\\t\\t\\tif(in.hasNext())\\n\\t\\t\\t\\t\\t\\tword=in.next();\\n\\t\\t\\t\\t\\telse return false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\telse return false;\\n\\t\\t} catch (FileNotFoundException e) {\\n\\t\\t\\te.printStackTrace();\\t\\t\\t\\n\\t\\t}finally{\\n\\t\\t\\tin.close();\\n\\t\\t}\\n\\t\\treturn true;\\t\\t\\n\\t}\",\n \"public static void main(String[] args) throws IOException {\\n\\n fileReader(\\\"endpoints1.txt\\\", \\\"endpoints2.txt\\\");\\n\\n /* First Test Case Completed with Correct Files */\\n\\n /*===============================================/*\\n\\n /* Second Test Case With Valid and Invalid Files */\\n\\n// fileReader(\\\"endpoints1.txt\\\", \\\"invalidpoints.txt\\\");\\n\\n /* Second Test Case Completed with one Invalid File */\\n\\n /*===============================================/*\\n\\n /* Third Test Case With Invalid Files */\\n\\n// fileReader(\\\"invalidpoints.txt\\\", \\\"endpoints2.txt\\\");\\n\\n /* Third Test Case Completed with Invalid File */\\n\\n }\",\n \"public static void readLocations() throws ProgressionException\\n\\t{\\n\\t\\t//File file = GeoDis_GUI.inputfile;\\n\\t\\t//infilename = file.getPath();\\n\\t\\t//System.err.println(file.getPath());\\n\\t\\t//infile = new TextInputStream(file.getPath());\\n\\t\\tlogfile.print(\\\"\\\\nReading geographical locations ...\\\");\\n\\t\\tinfile = new TextInputStream(GeoDis.infilename);\\n\\t\\t\\n\\t\\tdataName = infile.readLine(); \\n\\t\\t//System.err.println (dataName);\\n \\t\\n\\t\\tnumLocations = infile.readInt(); \\n\\t\\t//System.err.println(numLocations);\\n\\t\\n\\t\\n\\t\\tlocationName = new String[numLocations]; \\n\\t\\tsampleSize = new int[numLocations]; \\n\\t\\tLatitude = new double[numLocations]; \\n\\t\\tLongitude = new double[numLocations]; \\n\\t\\t\\n\\t\\tfor(j = 0; j < numLocations; j++)\\n\\t\\t{\\n\\t\\t\\t//trash = infile.readLine(); // read the \\\\n character in PC's\\n\\t\\t\\t\\n\\t\\t\\tlocationName[j] = infile.readLine(); \\n\\n\\t\\t\\tif (locationName[j].length() == 0)\\t\\t\\t\\n\\t\\t\\t\\tlocationName[j] = infile.readLine(); \\n\\t\\t\\t\\n\\t\\t\\tsampleSize[j] = infile.readInt();\\n\\n\\n\\t\\t\\tif (usingDecimalDegrees) \\n\\t\\t\\t{\\n\\t\\t\\t\\tLatitude[j] = infile.readFloat();\\n\\t\\t\\t\\tLongitude[j] = infile.readFloat();\\n\\t\\t\\t}\\t\\n\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\tlat_deg = infile.readInt();\\n\\t\\t\\t\\tlat_min = infile.readInt();\\n\\t\\t\\t\\tlat_sec = infile.readInt();\\n\\t\\t\\t\\tlat_coor = infile.readWord();\\n\\t\\t\\t\\tlon_deg = infile.readInt();\\n\\t\\t\\t\\tlon_min = infile.readInt();\\t\\t\\t\\t\\n\\t\\t\\t\\tlon_sec = infile.readInt();\\n\\t\\t\\t\\tlon_coor = infile.readWord();\\n\\t\\t\\t\\n\\t\\t\\t\\t//System.err.println (sampleSize[j] + \\\" \\\" + lat_deg + \\\" \\\" + lat_min + \\\" \\\" + lat_sec + \\\" \\\" + lat_coor + \\\" \\\" + \\n\\t\\t\\t\\t //lon_deg + \\\" \\\" + lon_min + \\\" \\\" + lon_sec + \\\" \\\" + lon_coor);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tdec_lat = (double)lat_deg + ((double)lat_min/60.0) + ((double)lat_sec/3600.0);\\n\\t\\t\\t\\tdec_lon = (double)lon_deg + ((double)lon_min/60.0) + ((double)lon_sec/3600.0);\\n\\t\\t\\t\\t\\n\\n\\t\\t\\t\\tif (lat_coor.equalsIgnoreCase(\\\"N\\\"))\\n\\t\\t\\t\\t\\tLatitude[j] = dec_lat;\\n\\t\\t\\t\\telse if (lat_coor.equalsIgnoreCase(\\\"S\\\"))\\n\\t\\t\\t\\t\\tLatitude[j] = -1.0 * dec_lat; \\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tStringBuffer str = new StringBuffer();\\n\\t\\t\\t\\t\\tstr.append(\\\"The letter for the latitude is neither N nor S.\\\");\\n\\t\\t\\t\\t\\tstr.append(\\\"\\\\nNote that latitude should come before longitude.\\\");\\n\\t\\t\\t\\t\\tif(!Mediator.isCommandLineApp()){\\n\\t\\t\\t\\t\\t\\tJOptionPane.showMessageDialog(frame,\\\"The letter for the latitude is neither N nor S.\\\" + \\n\\t\\t \\t\\t\\t\\\"\\\\n Note that latitude should come before longitude\\\",\\n \\t\\t\\t\\\"GeoDis warning\\\", JOptionPane.WARNING_MESSAGE);\\n\\t\\t\\t\\t \\t\\t//frame.dispose();\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t//System.exit(0);\\n\\t\\t\\t\\t\\t\\tthrow new ProgressionException(str.toString());\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tstr.append(\\\"[GeoDis]\\\\n\\\");\\n\\t\\t\\t\\t\\t\\tMediator.writeError(str.toString());\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t\\n\\n\\t\\t\\t\\tif (lon_coor.equalsIgnoreCase(\\\"E\\\"))\\n\\t\\t\\t\\t\\tLongitude[j] = dec_lon;\\n\\t\\t\\t\\telse if (lon_coor.equalsIgnoreCase(\\\"W\\\"))\\n\\t\\t\\t\\t\\tLongitude[j] = -1.0 * dec_lon;\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tStringBuffer str = new StringBuffer();\\n\\t\\t\\t\\t\\tstr.append(\\\"The letter for the longitude is neither E nor W.\\\");\\n\\t\\t\\t\\t\\tstr.append(\\\"\\\\nNote that latitude should come before longitude.\\\");\\n\\t\\t\\t\\t\\tif(!Mediator.isCommandLineApp()){\\n\\t\\t\\t\\t\\t\\tJOptionPane.showMessageDialog(frame,\\\"The letter for the longitude is neither E nor W.\\\" + \\n\\t\\t \\t\\t\\t\\\"\\\\n See that latitude come first than longitude\\\",\\n \\t\\t\\t\\\"GeoDis warning\\\", JOptionPane.WARNING_MESSAGE);\\n\\t\\t\\t\\t \\t\\t//frame.dispose();\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t//System.exit(0);\\n\\t\\t\\t\\t\\t\\tthrow new ProgressionException(str.toString());\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tstr.append(\\\"[GeoDis]\\\\n\\\");\\n\\t\\t\\t\\t\\t\\tMediator.writeError(str.toString());\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tif (locationName[i] == null || sampleSize[i] <= 0 || Latitude[j] > 90 || Latitude[j]< -90 || Longitude[j] < -180 || Longitude[j] > 180) \\n\\t\\t\\t{\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif (locationName[i] == null)\\n\\t\\t\\t\\t\\tif(!Mediator.isCommandLineApp()){\\n\\t\\t\\t\\t\\t\\tSystem.err.println (\\\"\\\\nlocationName [i] == null\\\");\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif (sampleSize[i] <= 0)\\n\\t\\t\\t\\t\\tif(!Mediator.isCommandLineApp()){\\n\\t\\t\\t\\t\\t\\tSystem.err.println (\\\"\\\\nsampleSize[i] <= 0\\\");\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif (Latitude[j] > 90)\\n\\t\\t\\t\\t\\tif(!Mediator.isCommandLineApp()){\\n\\t\\t\\t\\t\\t\\tSystem.err.println (\\\"\\\\nLatitude[j] > 90\\\");\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif (Latitude[j]< -90)\\n\\t\\t\\t\\t\\tif(!Mediator.isCommandLineApp()){\\n\\t\\t\\t\\t\\t\\tSystem.err.println (\\\"\\\\nLatitude[j]< -90\\\");\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif (Longitude[j] < -180)\\n\\t\\t\\t\\t\\tif(!Mediator.isCommandLineApp()){\\n\\t\\t\\t\\t\\t\\tSystem.err.println (\\\"\\\\nLongitude[j] < -180\\\");\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif (Longitude[j] > 180)\\n\\t\\t\\t\\t\\tif(!Mediator.isCommandLineApp()){\\n\\t\\t\\t\\t\\t\\tSystem.err.println (\\\"\\\\nLongitude[j] > 180\\\");\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tStringBuffer str = new StringBuffer();\\n\\t\\t\\t\\tstr.append(\\\"There was an error reading the population description\\\");\\n\\t\\t\\t\\tstr.append(\\\"\\\\nor its coordinates. If your coordinates are in decimal degrees, have you checked that box?\\\");\\n\\t\\t\\t\\tif(!Mediator.isCommandLineApp()){\\n\\t\\t\\t\\t\\tJOptionPane.showMessageDialog(frame,\\\"There was an error reading the population description\\\" +\\n\\t\\t\\t\\t\\t\\t\\\"\\\\nor its coordinates. If your coordinates are in decimal degrees, have you checked that box?\\\",\\n \\\"GeoDis warning\\\", JOptionPane.WARNING_MESSAGE);\\n\\t\\t\\t\\t\\t//frame.dispose();\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t//System.exit(0);\\n\\t\\t\\t\\t\\tthrow new ProgressionException(str.toString());\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tstr.append(\\\"[GeoDis]\\\\n\\\");\\n\\t\\t\\t\\t\\tMediator.writeError(str.toString());\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tlogfile.print(\\\"\\\\nreading \\\" + locationName[j] + \\\" \\\" + sampleSize[j] + \\\" \\\");\\n\\t\\t\\tlogfile.printf(\\\" %6.4f\\\",Latitude[j]);\\n\\t\\t\\tlogfile.printf(\\\" %6.4f\\\",Longitude[j]);\\n\\t\\t\\t//System.err.println (locationName[j]);\\n\\t\\t\\t//System.err.println(sampleSize[j] + \\\" \\\" + Latitude[j] + \\\" \\\" + Longitude[j]);\\t\\t\\t\\n\\t\\t}\\n\\n\\t \\t/* TRANSFORM DEGREES TO RADIANS */\\n\\t\\tfor(j = 0; j < numLocations; j++)\\n\\t\\t{\\n\\t\\t\\tLatitude[j] *= D2R;\\n\\t\\t\\tLongitude[j] *= D2R;\\n\\t\\t} \\n\\t\\tlogfile.println(\\\"\\\\nOK\\\");\\n\\n \\t}\",\n \"public static void main(String[] args) {\\n String timestamp;\\n TrafficSnapshotHolder counter = new TrafficSnapshotHolder();\\n try (FileReader fr = new FileReader(\\\"data/traffic1.txt\\\");\\n BufferedReader br = new BufferedReader(fr)) {\\n while ((timestamp = br.readLine()) != null) {\\n counter.add(extractInfo(timestamp));\\n }\\n }\\n catch (FileNotFoundException e) {\\n e.printStackTrace();\\n }\\n catch (IOException e) {\\n e.printStackTrace();\\n }\\n if(counter.isEmpty()){\\n System.out.println(\\\"File at location is empty, please check file\\\");\\n System.exit(0);\\n }\\n counter.processSnapshots();\\n }\",\n \"public void fileInformation(String filePath){\\n File myFile = new File(filePath);\\n if (myFile.exists()) {\\n System.out.println(\\\"File name: \\\"+myFile.getName());\\n System.out.println(\\\"Absolute path: \\\"+ myFile.getAbsolutePath());\\n System.out.println(\\\"Writeable: \\\"+myFile.canWrite());\\n System.out.println(\\\"Readable: \\\"+myFile.canRead());\\n System.out.println(\\\"File size in bytes: \\\"+myFile.length());\\n } else {\\n System.out.println(\\\"File does not exists\\\");\\n }\\n }\",\n \"public static void ReadAchievements()\\n {\\n try\\n {\\n BufferedReader file = new BufferedReader(new FileReader(achievements_file_name));\\n int actualLine = 0, nb_achievements_done = 0;\\n while(actualLine<Achievement.NB_ACHIEVEMENTS)\\n {\\n boolean currentValue = Utilities.IntToBool(Integer.parseInt(file.readLine()));\\n Achievement.achievements_done[actualLine] = currentValue;\\n if(currentValue)\\n nb_achievements_done++;\\n actualLine++;\\n }\\n file.close();\\n Achievement.nb_achievements_done = nb_achievements_done;\\n Achievement.CheckAllAchievements();\\n } \\n catch (Exception e) { SaveAchievements(); }\\n }\",\n \"public String check_loginFile(){\\n String text=\\\"\\\";\\n try{\\n FileInputStream fileInputStream=context.openFileInput(Constant.LOGIN_FILE);\\n Scanner obj=new Scanner(fileInputStream);\\n obj.useDelimiter(\\\",\\\");\\n while(obj.hasNext())\\n text=obj.next();\\n obj.close();\\n fileInputStream.close();\\n }\\n catch (FileNotFoundException e){\\n //Constant.IS_CREATE_DATABASE=false;\\n //Message.logMessages(\\\"FILE: \\\",String.valueOf(Constant.IS_CREATE_DATABASE));\\n return \\\"not logged in\\\";\\n }\\n catch (Exception e){\\n Message.logMessages(\\\"ERROR: \\\",e.toString());\\n }\\n return text;\\n }\",\n \"private static void info ( File f ) {\\n\\tString nume = f . getName () ;\\n\\tif( f.isFile () )\\n\\tSystem.out.println ( \\\" Fisier : \\\" + nume ) ;\\n\\telse\\n\\tif( f.isDirectory () )\\n\\tSystem.out.println ( \\\" Director : \\\" + nume ) ;\\n\\tSystem.out.println (\\n\\t\\\" Cale absoluta : \\\" + f.getAbsolutePath () +\\n\\t\\\" \\\\n Poate citi : \\\" + f.canRead () +\\n\\t\\\" \\\\n Poate scrie : \\\" + f.canWrite () +\\n\\t\\\" \\\\n Parinte : \\\" + f.getParent () +\\n\\t\\\" \\\\n Cale : \\\" + f.getPath () +\\n\\t\\\" \\\\n Lungime : \\\" + f.length () +\\n\\t\\\" \\\\n Data ultimei modificari : \\\" +\\n\\tnew Date ( f.lastModified () ) ) ;\\n\\tSystem.out.println ( \\\" --------------\\\" ) ;\\n\\t}\",\n \"public void readFile(File file){\\n try{\\n scan = new Scanner(file);\\n while(scan.hasNextLine()){\\n String line = scan.nextLine();\\n if(line.startsWith(\\\"//\\\")){\\n continue;\\n }\\n process(line);\\n }\\n }catch(IOException e){\\n Alert alert = new Alert(AlertType.INFORMATION);\\n alert.setTitle(\\\"\\\");\\n alert.setHeaderText(null);\\n alert.setContentText(\\\"Oops the input was not read properly\\\");\\n alert.showAndWait();\\n e.printStackTrace();\\n }catch(NullPointerException e){\\n Alert alert = new Alert(AlertType.INFORMATION);\\n alert.setTitle(\\\"\\\");\\n alert.setHeaderText(null);\\n alert.setContentText(\\\"Oops the input was not read properly\\\");\\n alert.showAndWait();\\n e.printStackTrace();\\n \\n }\\n }\",\n \"private void parse() throws IOException {\\n\\n\\t\\tStats statsObject = new Stats();\\n\\n\\t\\tstatsObject.setProcessName(process);\\n\\n\\t\\tList<String> lines = Files.readAllLines(Paths.get(filename), Charset.defaultCharset());\\n\\n\\t\\tPattern timePattern = Pattern.compile(\\\"((\\\\\\\\d+)-)*(\\\\\\\\d+)\\\\\\\\W((\\\\\\\\d+):)*(\\\\\\\\d+)\\\\\\\\.(\\\\\\\\d+)\\\");\\n\\n\\t\\tSystem.out.println(filename+\\\" \\\"+lines.get(0));\\n\\t\\tMatcher matcher = timePattern.matcher(lines.get(0));\\n\\t\\twhile (matcher.find()) {\\n\\t\\t\\tstatsObject.setStartTime(matcher.group(0));\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\n\\t\\tmatcher = timePattern.matcher(lines.get(lines.size() - 1));\\n\\t\\twhile (matcher.find()) {\\n\\t\\t\\tstatsObject.setEndTime(matcher.group(0));\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tString error = new String();\\n\\t\\tfor (String line : lines) {\\n\\n\\t\\t\\tif (line.startsWith(\\\"[\\\")) {\\n\\t\\t\\t\\tif (!error.isEmpty()) {\\n\\t\\t\\t\\t\\tstatsObject.addError(error);\\n\\t\\t\\t\\t\\terror = \\\"\\\";\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif (line.contains(\\\"Number of records processed: \\\")) {\\n\\n\\t\\t\\t\\t\\tPattern numberPattern = Pattern.compile(\\\"\\\\\\\\d+\\\");\\n\\t\\t\\t\\t\\tmatcher = numberPattern.matcher(line);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tString numberOfRecordsProcessed = \\\"N/A\\\";\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\twhile (matcher.find()) {\\n\\t\\t\\t\\t\\t\\tnumberOfRecordsProcessed = matcher.group();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tstatsObject.setRecordsProcessed(numberOfRecordsProcessed);\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\telse if (line.contains(\\\"WARNING\\\")) {\\n\\t\\t\\t\\t\\tif (line.contains(\\\"MISSING Property\\\")) {\\n\\t\\t\\t\\t\\t\\tstatsObject.incrementErrorCounter();\\n\\t\\t\\t\\t\\t\\tstatsObject.addError(line);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tstatsObject.incrementWarningCounter();\\n\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t} else if (line.contains(\\\"Exception\\\") || (line.contains(\\\"Error\\\"))) {\\n\\t\\t\\t\\tif (!error.isEmpty()) {\\n\\t\\t\\t\\t\\tstatsObject.addError(error);\\n\\t\\t\\t\\t\\terror = \\\"\\\";\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tstatsObject.incrementErrorCounter();\\n\\t\\t\\t\\terror = error + line;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\terror = error + line ;\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\t\\t// reader.close();\\n\\t\\tif (statsObject.getErrorCounter() > 0) {\\n\\t\\t\\tstatsObject.setStatus(\\\"Failure\\\");\\n\\t\\t}\\n\\n\\t\\tPattern pattern = Pattern.compile(\\\"\\\\\\\\d\\\\\\\\d\\\\\\\\d\\\\\\\\d\\\\\\\\d\\\\\\\\d\\\\\\\\d\\\\\\\\d\\\");\\n\\t\\tmatcher = pattern.matcher(filename);\\n\\t\\tString date = null;\\n\\t\\twhile (matcher.find()) {\\n\\t\\t\\tdate = matcher.group(0);\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tboolean saveSuccessful = OutputManipulator.addToStatFile(username, process, date, statsObject);\\n\\n\\t\\tif (saveSuccessful) {\\n\\t\\t\\tFileParseScheduler.addSuccessfulParsedFileName(username, process, filename);\\n\\t\\t}\\n\\n\\t\\tFileParseScheduler.removeLatestKilledThreads(process + filename);\\n\\t}\",\n \"public List<List<String>> read () {\\n List<List<String>> information = new ArrayList<>();\\n try (BufferedReader br = new BufferedReader(new FileReader(path))) {\\n int aux = 0;\\n while ((line = br.readLine()) != null) {\\n String[] data = line.split(split_on);\\n List<String> helper = new ArrayList<>();\\n helper.add(data[0]);\\n helper.add(data[1]);\\n information.add(helper);\\n }\\n } catch (FileNotFoundException e) {\\n e.printStackTrace();\\n } catch (IOException e) {\\n e.printStackTrace();\\n } finally {\\n if (br != null) {\\n try {\\n br.close();\\n } catch (IOException e) {\\n e.printStackTrace();\\n }\\n }\\n }\\n return information;\\n }\",\n \"public void readFile(File file) {\\n\\ttry (BufferedReader br = new BufferedReader(new FileReader(file)))\\n\\t{\\n\\n\\t\\tString sCurrentLine;\\n\\t\\tString [] lineElements;\\n\\t\\t\\n\\t\\t// read the headlines\\n\\t\\tsCurrentLine = br.readLine();\\n\\t\\tlineElements = sCurrentLine.split(\\\"\\\\\\\\s+\\\");\\n\\t\\tnumVertices = Integer.parseInt(lineElements[1]);\\n\\t\\tsCurrentLine = br.readLine();\\n\\t\\tlineElements = sCurrentLine.split(\\\"\\\\\\\\s+\\\");\\n\\t\\tnumPaths = Integer.parseInt(lineElements[1]);\\n\\t\\tsCurrentLine = br.readLine();\\n\\t\\tlineElements = sCurrentLine.split(\\\"\\\\\\\\s+\\\");\\n\\t\\ttmax = Double.parseDouble(lineElements[1]);\\n\\t\\t\\n//\\t\\tSystem.out.println(numVertices + \\\", \\\" + numPaths + \\\", \\\" + tmax);\\n\\n\\t\\t/* read benefits1 */\\n\\t\\tint index = 0;\\n\\t\\twhile ((sCurrentLine = br.readLine()) != null) {\\n//\\t\\t\\t\\tSystem.out.println(sCurrentLine);\\n\\t\\t\\tlineElements = sCurrentLine.split(\\\"\\\\\\\\s+\\\");\\n\\t\\t\\tdouble x = Double.parseDouble(lineElements[0]);\\n\\t\\t\\tdouble y = Double.parseDouble(lineElements[1]);\\n\\t\\t\\tList<Double> scores = new ArrayList<Double>();\\n\\t\\t\\tfor (int i = 2; i < lineElements.length; i++) {\\n\\t\\t\\t\\tdouble score = Double.parseDouble(lineElements[i]);\\n\\t\\t\\t\\tscores.add(new Double(score));\\n\\t\\t\\t}\\n\\t\\t\\tPOI POI = new POI(index, x, y, scores);\\n\\t\\t\\t//POI.printMe();\\n\\t\\t\\t\\n\\t\\t\\tvertices.add(POI);\\n\\t\\t\\tindex ++;\\n\\t\\t}\\n\\t\\t\\n\\t\\t// create the arcs and the graph\\n\\t\\tfor (int i = 0; i < vertices.size(); i++) {\\n\\t\\t\\tfor (int j = 0; j < vertices.size(); j++) {\\n\\t\\t\\t\\tArc arc = new Arc(vertices.get(i), vertices.get(j));\\n\\t\\t\\t\\tarcs.add(arc);\\n\\t\\t\\t\\tgraph.put(new Tuple2<POI, POI>(vertices.get(i), vertices.get(j)), arc);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t} catch (IOException e) {\\n\\t\\te.printStackTrace();\\n\\t}\\n}\",\n \"private static String readParseOutput(String fileName, int mode) throws IOException {\\n\\t\\tStringBuffer stringBuffer = new StringBuffer();\\n\\t\\tStringBuffer errorBuffer = new StringBuffer();\\n\\t\\tFileReader fileReader = new FileReader(fileName);\\n\\t\\tBufferedReader bufferedReader = new BufferedReader(fileReader);\\n\\t\\tScanner fileScanner = new Scanner(bufferedReader);\\n\\t\\tint fileStage = 0;\\n\\n\\t\\twhile (fileScanner.hasNextLine()) {\\n\\t\\t\\tString s = fileScanner.nextLine();\\n\\n\\t\\t\\tif (s.equals(\\\"** Basic block: 0 **\\\")) {\\n\\t\\t\\t\\tfileStage = 0;\\n\\t\\t\\t}\\n\\t\\t\\t// Beginning of Live Range info\\n\\t\\t\\telse if (s.startsWith(\\\"<<---- Live Ranges ---->>\\\")) {\\n\\t\\t\\t\\tfileStage = 1;\\n\\t\\t\\t}\\n\\t\\t\\t// uninitialized variable warning\\n\\t\\t\\telse if (s.startsWith(\\\"WARNING: possible uninitialized local variable index\\\")) {\\n\\t\\t\\t\\tfileStage = 2;\\n\\t\\t\\t}\\n\\t\\t\\telse if (s.startsWith(\\\"<<---- Optimized code ---->>\\\")) {\\n\\t\\t\\t\\tfileStage = 3;\\n\\t\\t\\t}\\n\\n\\t\\t\\t// store instruction, ignoring instruction number\\n\\t\\t\\tif (fileStage == 0) {\\t\\t// CFG, only look at pred/succ info\\n\\t\\t\\t\\tif (mode == 0 && s.contains(\\\"Successors\\\")) {\\n\\t\\t\\t\\t\\tstringBuffer.append(s + \\\"\\\\n\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse if (fileStage == 1) {\\t\\t// Live range, ignore instruction\\n\\t\\t\\t\\tif (mode > 0) {\\n\\t\\t\\t\\t\\tint idx = s.indexOf(\\\":\\\");\\n\\t\\t\\t\\t\\tif (idx > 3)\\n\\t\\t\\t\\t\\t\\tstringBuffer.append(s.substring(0, idx-3));\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\tstringBuffer.append(s);\\n\\t\\t\\t\\t\\tstringBuffer.append(\\\"\\\\n\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse if (fileStage == 2) {\\t\\t// Look at all warnings\\n\\t\\t\\t\\tif (mode == 2 && s.contains(\\\"uninitialized\\\")) {\\n\\t\\t\\t\\t\\tstringBuffer.append(s + \\\"\\\\n\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse if (fileStage == 3) {\\t\\t\\t// Opt code, ignore instruction #\\n\\t\\t\\t\\tif (mode == 3) {\\n\\t\\t\\t\\t\\tint idx = s.indexOf(\\\":\\\");\\n\\t\\t\\t\\t\\tstringBuffer.append(s.substring(idx+1));\\n\\t\\t\\t\\t\\tstringBuffer.append(\\\"\\\\n\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfileScanner.close();\\n\\t\\tString result;\\n\\t\\tresult = stringBuffer.toString() + \\\"\\\\n\\\";\\n\\t\\treturn result;\\n\\t}\",\n \"public void checkFile() {\\n\\t\\tFile file = new File(\\\"src/Project11Problem1Alternative/names.txt\\\");\\n\\t\\tSystem.out.println(file.exists() ? \\\"Exists!\\\" : \\\"Doesn't exist!\\\");\\n\\t\\tSystem.out.println(file.canRead() ? \\\"Can read!\\\" : \\\"Can't read!\\\");\\n\\t\\tSystem.out.println(file.canWrite() ? \\\"Can write!\\\" : \\\"Can't write!\\\");\\n\\t\\tSystem.out.println(\\\"Name: \\\" + file.getName());\\n\\t\\tSystem.out.println(\\\"Path: \\\" + file.getPath());\\n\\t\\tSystem.out.println(\\\"Size: \\\" + file.length() + \\\" bytes\\\");\\n\\t}\",\n \"public int readTrials() throws Exception\\n {\\n return fileHandler.readInt(file);\\n }\",\n \"public NexusReaderDistances(String filePath) throws IOException, NexusFormatException {\\n\\n BufferedReader bufferedReader = null;\\n FileReader fileReader = null;\\n try {\\n fileReader = new FileReader(filePath);\\n bufferedReader = new BufferedReader(fileReader);\\n\\n int state = 0; //0=start of file, 1=after #NEXUS. 2=inside block\\n boolean commentMode = false;\\n TreeMap<Integer, String> blockLines = null;\\n String blockName = null;\\n Matcher beginBlockMatcher = Pattern.compile(\\\"^(?i)BEGIN ([A-Z]+);\\\").matcher(\\\"\\\");\\n String line = bufferedReader.readLine();\\n int lineNumber = 0;\\n while (line != null) {\\n lineNumber++;\\n line = line.trim();\\n //end multiline comments\\n if (commentMode) {\\n int endIndex = line.indexOf(\\\"]\\\");\\n if (endIndex == -1) {\\n line = bufferedReader.readLine();\\n continue;\\n } else {\\n line = line.substring(endIndex);\\n commentMode = false;\\n }\\n }\\n //remove one line comments\\n line = line.replaceAll(\\\"\\\\\\\\[.*]\\\", \\\"\\\");\\n //remove multi line comments\\n int startIndex = line.indexOf(\\\"[\\\");\\n if (startIndex != -1) {\\n line = line.substring(0, startIndex);\\n commentMode = true;\\n }\\n //skip emtpy lines\\n if (line.isEmpty()) {\\n line = bufferedReader.readLine();\\n continue;\\n }\\n\\n //===read lines===\\n switch (state) { //0=start of file, 1=after #NEXUS. 2=inside block\\n case 0:\\n if (!line.equalsIgnoreCase(\\\"#NEXUS\\\")) {\\n throw new NexusFormatException(\\\"File must start with #NEXUS. Line: \\\" + lineNumber);\\n } else {\\n state++;\\n }\\n break;\\n case 1:\\n beginBlockMatcher.reset(line);\\n if (beginBlockMatcher.matches()) {\\n blockLines = new TreeMap<Integer, String>();\\n blockName = beginBlockMatcher.group(1);\\n state++;\\n } else {\\n throw new NexusFormatException(\\\"Error parsing BEGIN statement. Line \\\" + lineNumber);\\n }\\n break;\\n case 2:\\n if (line.equalsIgnoreCase(\\\"END;\\\")) {\\n makeBlock(blockName, blockLines);\\n state--;\\n } else {\\n blockLines.put(lineNumber, line);\\n }\\n break;\\n default:\\n throw new RuntimeException(\\\"NexusReader reached illegal state: \\\" + state);\\n }\\n\\n line = bufferedReader.readLine();\\n }\\n if (state == 2) {\\n throw new NexusFormatException(\\\"Didn't close block at end of file.\\\");\\n }\\n if (state == 0) {\\n throw new NexusFormatException(\\\"File seems empty.\\\");\\n }\\n\\n bufferedReader.close();\\n\\n } catch (IOException e) {\\n if (bufferedReader != null) {\\n bufferedReader.close();\\n }\\n if (fileReader != null) {\\n fileReader.close();\\n }\\n throw e;\\n } catch (NexusFormatException e) {\\n if (bufferedReader != null) {\\n bufferedReader.close();\\n }\\n if (fileReader != null) {\\n fileReader.close();\\n }\\n throw e;\\n }\\n }\",\n \"public static void main(String[] args) {\\n Path file = Paths.get (\\\"courses.txt\\\");\\n// line n1\\n /* Assume the courses.txt is accessible.\\n Which code fragment can be inserted at line n1 to enable the code to print the content of the*/\\n //courses.txt file?\\n /* A. List<String> fc = Files.list(file);\\n fc.stream().forEach (s - > System.out.println(s));\\n B. Stream<String> fc = Files.readAllLines (file);\\n fc.forEach (s - > System.out.println(s));\\n // C. List<String> fc = readAllLines(file);\\n //fc.stream().forEach (s - > System.out.println(s));\\n D. Stream<String> fc = Files.lines (file);///answer\\n fc.forEach (s - > System.out.println(s));*/\\n }\",\n \"static void read()\\n\\t\\t{\\n\\n\\n\\t\\t\\tString content=new String();\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tFile file=new File(\\\"Dic.txt\\\");\\n\\t\\t\\t\\tScanner scan=new Scanner(file);\\n\\t\\t\\t\\twhile(scan.hasNextLine()) {\\n\\t\\t\\t\\t\\tcontent=scan.nextLine();\\n\\t\\t\\t\\t//\\tSystem.out.println(content);\\n\\n\\t\\t\\t\\t//\\tString [] array=content.split(\\\" \\\");\\n\\t\\t\\t\\t\\tlist.add(content.trim());\\n\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tscan.close(); \\n\\t\\t\\t}\\n\\t\\t\\tcatch (Exception e) {\\n\\t\\t\\t\\tSystem.out.println(e);\\n\\t\\t\\t}\\n\\n\\n\\t\\t}\",\n \"private void ReadFile(String filePath) throws IOException{\\n File file = new File(filePath);\\n BufferedReader b = new BufferedReader(new FileReader(file));\\n int lineNumber = 1;\\n String line = \\\"\\\";\\n line = b.readLine();\\n while (line != null) {\\n // analyze the line only when it is not empty and it is not a comment\\n String trimLine = line.toString().trim();\\n if(trimLine.length() != 0 && !trimLine.substring(0, 1).equals(\\\"/\\\") && !trimLine.substring(0, 1).equals(\\\"#\\\")){\\n // line.toString().trim(): eliminate heading and tailing whitespaces\\n // but add one whitespace to the end of the string to facilitate token manipulation\\n // under the circumstances that there is only one token on one line, e.g. main\\n AnalyzeByLine(line.toString().trim() + \\\" \\\", lineNumber);\\n }\\n lineNumber++;\\n line = b.readLine();\\n }\\n arrL.add(new Token(\\\"end of file\\\", 255, lineNumber));\\n// for(int i = 0; i < arrL.size(); i++){\\n// System.out.println(arrL.get(i).getCharacters() + \\\" \\\" + arrL.get(i).getValue() + \\\" \\\" + arrL.get(i).getLineNum());\\n// }\\n }\",\n \"public static void main(String[] args) throws FileNotFoundException, IOException {\\n FileInputStream fis=new FileInputStream(\\\"g:/data/info.txt\\\");\\r\\n //step-2 (read the data from stream)\\r\\n int n=fis.available(); //it gives you no of bytes available for reading in stream\\r\\n System.out.println(\\\"Total Bytes Available : \\\"+n);\\r\\n byte b[]=new byte[n];\\r\\n fis.read(b); //will take 1st byte from stream and store to b[0], 2nd to b[1], 3rd to b[2]\\r\\n //converting bytes to String\\r\\n String st=new String(b);\\r\\n System.out.println(st);\\r\\n //step-3 (close the stream)\\r\\n fis.close();\\r\\n }\",\n \"public MapMessage processFile(File file) {\\r\\n\\t\\ttry {\\r\\n\\r\\n\\t\\t\\tScanner input = new Scanner(file);\\r\\n\\r\\n\\t\\t\\twhile (input.hasNext()) {\\r\\n\\t\\t\\t\\tString line = input.nextLine();\\r\\n\\t\\t\\t\\tif (!line.isEmpty()) {\\r\\n\\t\\t\\t\\t\\tfileContent.append(line).append(\\\"\\\\n\\\");\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\tinput.close();\\r\\n\\r\\n\\t\\t} catch (FileNotFoundException ex) {\\r\\n\\t\\t\\tex.printStackTrace();\\r\\n\\t\\t}\\r\\n\\t\\tMapMessage mapMessage = validateMap(fileContent.toString());\\r\\n\\t\\treturn mapMessage;\\r\\n\\t}\",\n \"private void readWeaponsFromFile(File file) throws IllegalStateException {\\n\\t\\ttry {\\n\\t\\t\\tScanner fileScanner = new Scanner(file);\\n\\t\\t\\tboolean rangeMinB = false, rangeMaxB = false;\\n\\t\\t\\twhile (fileScanner.hasNext() && !(rangeMaxB && rangeMinB)) {\\n\\t\\t\\t\\tString line = fileScanner.nextLine();\\n\\t\\t\\t\\tif (line.equals(CHANCE_RANGE_MIN)) {\\n\\t\\t\\t\\t\\trangeMin = Integer.parseInt(fileScanner.nextLine());\\n\\t\\t\\t\\t\\trangeMinB = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (line.equals(CHANCE_RANGE_MAX)) {\\n\\t\\t\\t\\t\\trangeMax = Integer.parseInt(fileScanner.nextLine());\\n\\t\\t\\t\\t\\trangeMaxB = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\twhile (fileScanner.hasNext()) {\\n\\t\\t\\t\\tString line = fileScanner.nextLine();\\n\\t\\t\\t\\tif (line.equals(START_WEAPON)) {\\n\\t\\t\\t\\t\\treadWeapon(fileScanner);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tfileScanner.close();\\n\\t\\t} catch (FileNotFoundException e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\n\\t\\tint bottomRange = rangeMin;\\n\\t\\twhile (bottomRange != rangeMax) {\\n\\t\\t\\tint tempBottomRange = bottomRange;\\n\\t\\t\\tfor (Weapon weapon: weapons) {\\n\\t\\t\\t\\tif (weapon.spawnRangeMin == bottomRange) {\\n\\t\\t\\t\\t\\tbottomRange = weapon.spawnRangeMax;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (tempBottomRange == bottomRange) {\\n\\t\\t\\t\\tthrow new IllegalStateException(\\\"There is a gap in the ranges of the weapons loaded from \\\" + file.getAbsolutePath());\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"public static void processFile(File f) throws Exception {\\n\\t\\ttry {\\r\\n\\t\\t\\tBufferedReader bufRead = new BufferedReader(new InputStreamReader(\\r\\n\\t\\t\\t\\t\\tnew FileInputStream(f)));\\r\\n\\t\\t\\tString S1 = \\\"\\\";\\r\\n\\t\\t\\twhile ((S1 = bufRead.readLine()) != null) {\\r\\n\\t\\t\\t\\t//System.out.println(S1);\\r\\n\\t\\t\\t\\tgetPubTypes(S1);\\r\\n\\t\\t\\t\\t//System.out.println();\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tbufRead.close();\\r\\n\\t\\t} catch (IOException ioe) {\\r\\n\\t\\t\\tSystem.out.println(\\\"Something is wrong with reading file! \\\"\\r\\n\\t\\t\\t\\t\\t+ \\\"Can't find the appropriate file!\\\");\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\t// return allDiseases;\\r\\n\\r\\n\\t}\",\n \"public ScanReplace(String file, String startDir)\\n {\\n confFileName = file;\\n startPath = Paths.get(startDir);\\n fileSpec = \\\"*.*\\\";\\n\\n ReadConfig();\\n\\n System.out.println(\\\"Directory,Filename,Line Number, Sub Line Number, Matching Line\\\");\\n FindFiles(startPath.toAbsolutePath());\\n\\n SummaryReport();\\n }\",\n \"public static Map<String, Integer> getStartingPositions(File file)\\n\\t\\t\\tthrows IOException, FileNotFoundException {\\n\\t\\tMap<String, Integer> startPositions = new HashMap<String, Integer>();\\n\\t\\ttry {\\n\\t\\t\\tString line;\\n\\t\\t\\tBufferedReader in;\\n\\t\\t\\tString extension = PdbHelper.getFileExtension(file);\\n\\t\\t\\tif (extension.equals(\\\"gz\\\")) {\\n\\t\\t\\t\\tin = new BufferedReader(new InputStreamReader(\\n\\t\\t\\t\\t\\t\\tnew GZIPInputStream(new FileInputStream(file))));\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tin = new BufferedReader(new FileReader(file));\\n\\t\\t\\t}\\n\\n\\t\\t\\twhile ((line = in.readLine()) != null) {\\n\\t\\t\\t\\tif (line.startsWith(\\\"DBREF \\\") || line.startsWith(\\\"DBREF1\\\")) {\\n\\t\\t\\t\\t\\tString chainLabel = line.substring(13 - 1, 13);\\n\\t\\t\\t\\t\\tint seqBegin = Integer.parseInt(line.substring(15 - 1, 18)\\n\\t\\t\\t\\t\\t\\t\\t.trim());\\n\\t\\t\\t\\t\\tstartPositions.put(chainLabel, seqBegin);\\n\\t\\t\\t\\t\\tif (line.startsWith(\\\"SEQADV \\\")) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tin.close();\\n\\t\\t} catch (IOException e) {\\n\\t\\t\\tSystem.out.println(e);\\n\\t\\t}\\n\\t\\treturn startPositions;\\n\\t}\",\n \"public static void load(Context context) throws IOException {\\n // read the file\\n String raw = File.readFile(\\\"vaccine.txt\\\", context);\\n\\n // clear the map and load contents of file into the map\\n map.clear();\\n for (String line : raw.split(\\\"\\\\n\\\")) {\\n if (line.equals(\\\"\\\")) {\\n continue;\\n }\\n String[] data = line.split(\\\",\\\");\\n if (data[0].equals(\\\"\\\") || data.length != 3) {\\n continue;\\n }\\n map.put(data[0], Boolean.getBoolean(data[1]));\\n dateMap.put(data[0], data[2]);\\n }\\n }\",\n \"public void readFile(String file)\\n\\t{\\t\\n\\t\\tfindPieces(file);\\n\\t}\",\n \"public String readConquestFile(String filePath) {\\n try {\\n File inputMap = new File(filePath);\\n String returnString;\\n inputReader = new BufferedReader(new FileReader(inputMap));\\n returnString=this.getGuiParameters(inputReader);\\n if(!returnString.equals(\\\"SUCCESS\\\")) {\\n return returnString;\\n }\\n String inputLine;\\n int lineCounter = 6;\\n while ((inputLine = inputReader.readLine()) != null) {\\n if (lineCounter == 6) {\\n if (inputLine.equals(\\\"[Continents]\\\")) {\\n returnString= this.readContinentList(inputReader);\\n if (!returnString.equals(\\\"SUCCESS\\\")) {\\n return \\\"ONE OR MORE DUPLICATE CONTINENTS ENCOUNTERED\\\";\\n }\\n } else {\\n return \\\"THE MAP FORMAT IS WRONG\\\";\\n }\\n lineCounter++;\\n }\\n returnString = this.readCountryList(inputReader);\\n if (!returnString.equals(\\\"SUCCESS\\\")) {\\n return returnString;\\n }\\n lineCounter++;\\n }\\n if(validator.isFullyLinked()) {\\n returnString = \\\"SUCCESS\\\";\\n } else {\\n returnString = \\\"The Countries are not properly linked to each other\\\";\\n }\\n return returnString;\\n }catch (FileNotFoundException e) {\\n return \\\"THE FILE NOT FOUND\\\";\\n }catch (IOException e) {\\n return \\\"ERROR IN READING THE SPECIFIED FILE\\\";\\n }\\n }\",\n \"public boolean readFile(){\\n\\t\\tboolean counter=false;\\n\\t\\t\\ttry {\\n\\t FileReader reader = new FileReader(readFile);\\n\\t BufferedReader bufferedReader = new BufferedReader(reader);\\n\\t \\n\\t String line;\\n\\t \\n\\t while ((line = bufferedReader.readLine()) != null) {\\n\\t \\tStringTokenizer st = new StringTokenizer(line,SEPARATOR);\\n\\t\\t if (st.nextToken().equals(user) && st.nextToken().equals(password)) {\\n\\t\\t \\tcounter=true;\\n\\t\\t \\treturn counter;\\n\\t\\t }\\n\\t\\t else break;\\n\\t }\\n\\t reader.close();\\n\\t \\n\\t } catch (IOException e) {\\n\\t e.printStackTrace();\\n\\t }\\n\\t\\t return counter;\\n\\t}\",\n \"public boolean ParseExcellon(String fileName, DrillList drillList, DrillToolMap drillToolMap)\\n {\\n ILogWriter log= new ConsoleLogWriter();\\n f=new FileOpration();\\n f.Open(fileName);\\n String s;\\n s=SkipComments();\\n if (s.compareTo(\\\"M48\\\")!=0)\\n {\\n log.Writeln(\\\"begin of header not found\\\");\\n return false;\\n }\\n log.Writeln(s+\\\"\\\\t//header found at \\\"+f.getIndex());\\n s=f.Readln();\\n while (s.lastIndexOf(\\\";FILE_FORMAT=\\\")==-1)\\n {\\n s=f.Readln();\\n if (s==null) return false;\\n }\\n log.Writeln(s+\\\"\\\\t//found decimal point position declaration at \\\"+ f.getIndex());\\n try {\\n digBeforePoint = Integer.parseInt(s.substring(s.lastIndexOf('=')+1,s.lastIndexOf(':')));\\n log.Writeln(\\\"\\\\tamount of digts before point is setted to \\\"+digBeforePoint);\\n int digAfterPointStartPosition=s.lastIndexOf(':')+1;\\n digAfterPoint= Integer.parseInt(s.substring(digAfterPointStartPosition,s.indexOf(' ',digAfterPointStartPosition)));\\n log.Writeln(\\\"\\\\tamount of digts after point is setted to \\\"+digAfterPoint);\\n }\\n catch (NumberFormatException | IndexOutOfBoundsException exc)\\n {\\n log.Writeln(\\\"invalid decimal point position declaration\\\");\\n f.Close();\\n return false;\\n }\\n /*catch (IndexOutOfBoundsException exc)\\n {\\n log.Writeln(\\\"invalid decimal point position declaration\\\");\\n f.Close();\\n return false;\\n }*/\\n s=SkipComments();\\n switch (s.toUpperCase())\\n {\\n case \\\"METRIC\\\":\\n metric=true;\\n break;\\n case \\\"INCH\\\":\\n metric=false;\\n break;\\n default:\\n log.Writeln(\\\"the type of measurement system not found\\\");\\n return false;\\n }\\n log.Writeln(s+\\\"\\\\t//the type of measurement system found at \\\"+f.getIndex());\\n log.Writeln(\\\"\\\\t the type of measurement system is setted to \\\"+ (metric?\\\"METRIC\\\":\\\"INCH\\\"));\\n do\\n {\\n s=SkipComments();\\n log.Writeln(s);\\n if (s.charAt(0)=='%') break;\\n try\\n {\\n String toolName = s.substring(0, s.indexOf('C'));\\n double toolDiam=Double.parseDouble(s.substring(s.indexOf('C')+1));\\n drillToolMap.AddTool(toolName,toolDiam);\\n log.Writeln(\\\"\\\\t\\\"+toolName+\\\" with diameter \\\"+toolDiam+\\\" found at \\\"+f.getIndex());\\n\\n }\\n catch (NumberFormatException | IndexOutOfBoundsException exc)\\n {\\n log.Writeln(\\\"invalid tool declaration at \\\"+f.getIndex());\\n f.Close();\\n return false;\\n }\\n\\n } while (s.charAt(0)!='%');\\n log.Writeln(\\\"end of header found at \\\"+f.getIndex());\\n s = SkipComments();\\n do {\\n if (s==null)\\n {\\n log.Writeln(\\\"parsing completed without footer at \\\"+f.getIndex());\\n f.Close();\\n return false;\\n }\\n if (s.compareTo(\\\"T00\\\")==0)\\n {\\n log.Writeln(\\\"\\\\tFooter found at \\\"+f.getIndex());\\n s = SkipComments();\\n log.Writeln(s);\\n if (s.compareTo(\\\"M30\\\")==0)\\n {\\n log.Writeln(\\\"\\\\tEnd of file found at \\\"+f.getIndex());\\n f.Close();\\n log.Writeln(\\\"\\\\tPARSING COMPLETED\\\");\\n return true;\\n }\\n log.Writeln(\\\"parsing completed without footer at \\\"+f.getIndex());\\n f.Close();\\n return false;\\n }\\n log.Writeln(s);\\n if (drillToolMap.GetToolDiam(s) == -1) {\\n log.Writeln(\\\"invalid tool name found at \\\" + f.getIndex());\\n f.Close();\\n return false;\\n }\\n DrillFrame df=new DrillFrame();\\n df.setDrillDiam(drillToolMap.GetToolDiam(s));\\n log.Writeln(\\\"\\\\ttool \\\"+s+\\\" frame with tool diameter \\\"+ df.getDrillDiam()+\\\" found at \\\"+f.getIndex());\\n double x=0,y=0;\\n do\\n {\\n s=SkipComments();\\n log.Writeln(s);\\n try\\n {\\n String tempX=\\\"\\\",tempY=\\\"\\\";\\n if (s.indexOf('X')!=-1)\\n {\\n if (s.indexOf('Y')!=-1)\\n {\\n tempX = s.substring(s.indexOf('X') + 1, s.indexOf('Y'));\\n tempY = s.substring(s.indexOf('Y') + 1);\\n }\\n else\\n {\\n tempX = s.substring(s.indexOf('X') + 1);\\n }\\n }\\n else\\n {\\n if (s.indexOf('Y')!=-1)\\n {\\n tempY = s.substring(s.indexOf('Y') + 1);\\n }\\n else\\n {\\n drillList.Add(df);\\n break;\\n }\\n\\n }\\n if (tempX!=\\\"\\\")\\n x=Double.parseDouble(tempX)/Math.pow(10,digAfterPoint);\\n if (tempY!=\\\"\\\")\\n y=Double.parseDouble(tempY)/Math.pow(10,digAfterPoint);\\n df.addPoint(x,y);\\n log.Writeln(\\\"\\\\tpoint (\\\"+Double.toString(x)+\\\",\\\"+Double.toString(y)+\\\") found at \\\"+f.getIndex());\\n }\\n catch (NumberFormatException | IndexOutOfBoundsException exc)\\n {\\n log.Writeln(\\\"invalid coordinate at \\\"+f.getIndex());\\n f.Close();\\n return false;\\n }\\n\\n }while(true);\\n }while (true);\\n\\n\\n //f.Close();\\n //return true;\\n }\",\n \"boolean hasCompleteFile();\",\n \"private void readMetaData() throws AreaFileException {\\r\\n \\r\\n int i;\\r\\n// hasReadData = false;\\r\\n\\r\\n// if (! fileok) {\\r\\n// throw new AreaFileException(\\\"Error reading AreaFile directory\\\");\\r\\n// }\\r\\n\\r\\n dir = new int[AD_DIRSIZE];\\r\\n\\r\\n for (i=0; i < AD_DIRSIZE; i++) {\\r\\n try { dir[i] = af.readInt();\\r\\n } catch (IOException e) {\\r\\n status = -1;\\r\\n throw new AreaFileException(\\\"Error reading AreaFile directory:\\\" + e);\\r\\n }\\r\\n }\\r\\n position += AD_DIRSIZE * 4;\\r\\n\\r\\n // see if the directory needs to be byte-flipped\\r\\n\\r\\n if (dir[AD_VERSION] != VERSION_NUMBER) {\\r\\n McIDASUtil.flip(dir,0,19);\\r\\n // check again\\r\\n if (dir[AD_VERSION] != VERSION_NUMBER)\\r\\n throw new AreaFileException(\\r\\n \\\"Invalid version number - probably not an AREA file\\\");\\r\\n // word 20 may contain characters -- if small integer, flip it...\\r\\n if ( (dir[20] & 0xffff) == 0) McIDASUtil.flip(dir,20,20);\\r\\n McIDASUtil.flip(dir,21,23);\\r\\n // words 24-31 contain memo field\\r\\n McIDASUtil.flip(dir,32,50);\\r\\n // words 51-2 contain cal info\\r\\n McIDASUtil.flip(dir,53,55);\\r\\n // word 56 contains original source type (ascii)\\r\\n McIDASUtil.flip(dir,57,63);\\r\\n flipwords = true;\\r\\n }\\r\\n\\r\\n areaDirectory = new AreaDirectory(dir);\\r\\n\\r\\n // pull together some values needed by other methods\\r\\n navLoc = dir[AD_NAVOFFSET];\\r\\n calLoc = dir[AD_CALOFFSET];\\r\\n auxLoc = dir[AD_AUXOFFSET];\\r\\n datLoc = dir[AD_DATAOFFSET];\\r\\n numBands = dir[AD_NUMBANDS];\\r\\n linePrefixLength = \\r\\n dir[AD_DOCLENGTH] + dir[AD_CALLENGTH] + dir[AD_LEVLENGTH];\\r\\n if (dir[AD_VALCODE] != 0) linePrefixLength = linePrefixLength + 4;\\r\\n if (linePrefixLength != dir[AD_PFXSIZE]) \\r\\n throw new AreaFileException(\\\"Invalid line prefix length in AREA file.\\\");\\r\\n lineDataLength = numBands * dir[AD_NUMELEMS] * dir[AD_DATAWIDTH];\\r\\n lineLength = linePrefixLength + lineDataLength;\\r\\n numberLines = dir[AD_NUMLINES];\\r\\n\\r\\n if (datLoc > 0 && datLoc != McIDASUtil.MCMISSING) {\\r\\n navbytes = datLoc - navLoc;\\r\\n calbytes = datLoc - calLoc;\\r\\n auxbytes = datLoc - auxLoc;\\r\\n }\\r\\n if (auxLoc > 0 && auxLoc != McIDASUtil.MCMISSING) {\\r\\n navbytes = auxLoc - navLoc;\\r\\n calbytes = auxLoc - calLoc;\\r\\n }\\r\\n\\r\\n if (calLoc > 0 && calLoc != McIDASUtil.MCMISSING ) {\\r\\n navbytes = calLoc - navLoc;\\r\\n }\\r\\n\\r\\n\\r\\n // Read in nav block\\r\\n if (navLoc > 0 && navbytes > 0) {\\r\\n nav = new int[navbytes/4];\\r\\n newPosition = (long) navLoc;\\r\\n skipByteCount = (int) (newPosition - position);\\r\\n try {\\r\\n af.skipBytes(skipByteCount);\\r\\n } catch (IOException e) {\\r\\n status = -1;\\r\\n throw new AreaFileException(\\\"Error skipping AreaFile bytes: \\\" + e);\\r\\n }\\r\\n for (i=0; i<navbytes/4; i++) {\\r\\n try {\\r\\n nav[i] = af.readInt();\\r\\n } catch (IOException e) {\\r\\n status = -1;\\r\\n throw new AreaFileException(\\\"Error reading AreaFile navigation:\\\"+e);\\r\\n }\\r\\n }\\r\\n if (flipwords){\\r\\n flipnav(nav);\\r\\n }\\r\\n position = navLoc + navbytes;\\r\\n }\\r\\n\\r\\n // Read in cal block\\r\\n if (calLoc > 0 && calbytes > 0) {\\r\\n cal = new int[calbytes/4];\\r\\n newPosition = (long)calLoc;\\r\\n skipByteCount = (int) (newPosition - position);\\r\\n try {\\r\\n af.skipBytes(skipByteCount);\\r\\n } catch (IOException e) {\\r\\n status = -1;\\r\\n throw new AreaFileException(\\\"Error skipping AreaFile bytes: \\\" + e);\\r\\n }\\r\\n for (i=0; i<calbytes/4; i++) {\\r\\n try { \\r\\n cal[i] = af.readInt();\\r\\n } catch (IOException e) {\\r\\n status = -1;\\r\\n throw new AreaFileException(\\\"Error reading AreaFile calibration:\\\"+e);\\r\\n }\\r\\n }\\r\\n // if (flipwords) flipcal(cal);\\r\\n position = calLoc + calbytes;\\r\\n }\\r\\n\\r\\n // Read in aux block\\r\\n if (auxLoc > 0 && auxbytes > 0){\\r\\n aux = new int[auxbytes/4];\\r\\n newPosition = (long) auxLoc;\\r\\n skipByteCount = (int) (newPosition - position);\\r\\n try{\\r\\n af.skipBytes(skipByteCount);\\r\\n }catch (IOException e){\\r\\n status = -1;\\r\\n throw new AreaFileException(\\\"Error skipping AreaFile bytes: \\\" + e);\\r\\n }\\r\\n for (i = 0; i < auxbytes/4; i++){\\r\\n try{\\r\\n aux[i] = af.readInt();\\r\\n }catch (IOException e){\\r\\n status = -1;\\r\\n throw new AreaFileException(\\\"Error reading AreaFile aux block:\\\" + e);\\r\\n }\\r\\n }\\r\\n position = auxLoc + auxbytes;\\r\\n }\\r\\n\\r\\n // now return the Dir, as requested...\\r\\n status = 1;\\r\\n return;\\r\\n }\",\n \"void readMap()\\n {\\n try {\\n FileReader\\t\\tmapFile = new FileReader(file);\\n StringBuffer\\tbuf = new StringBuffer();\\n int\\t\\t\\t\\tread;\\n boolean\\t\\t\\tdone = false;\\n \\n while (!done)\\n {\\n read = mapFile.read();\\n if (read == -1)\\n done = true;\\n else\\n buf.append((char) read);\\n }\\n \\n mapFile.close();\\n \\n parseMap(buf.toString());\\n \\n } catch (Exception e) {\\n ErrorHandler.displayError(\\\"Could not read the map file data.\\\", ErrorHandler.ERR_OPEN_FAIL);\\n }\\n }\",\n \"private boolean canRead() {\\n\\t\\treturn fileStatus;\\n\\t}\",\n \"public Index[] readIndexes(File file){\\t\\t\\n\\t\\ttry{\\n\\t\\t\\tFileReader reader = new FileReader(file);\\n\\t\\t\\tBufferedReader buff = new BufferedReader(reader);\\n\\n\\t\\t\\tboolean eof = false;\\t\\t//stores if the end of the file (eof) has been reached\\n\\t\\t\\tint numberOfRecords = 0;\\n\\n\\t\\t\\t/**\\n\\t\\t\\t * @mastery achieves SL mastery factor 6 with the while loop\\n\\t\\t\\t */\\n\\t\\t\\twhile(!eof){\\n\\t\\t\\t\\tString line = buff.readLine();\\n\\n\\t\\t\\t\\t/**\\n\\t\\t\\t\\t * @mastery achieves SL mastery factor 4 with the if/else selection block\\n\\t\\t\\t\\t */\\n\\t\\t\\t\\tif(line == null){\\n\\t\\t\\t\\t\\teof = true;\\t\\t//the end of the file has been reached\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tnumberOfRecords++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tbuff.close();\\n\\n\\t\\t\\tIndex[] indexes = new Index[numberOfRecords];\\n\\n\\t\\t\\tFileReader reader2 = new FileReader(file);\\n\\t\\t\\tBufferedReader buff2 = new BufferedReader(reader2);\\n\\n\\t\\t\\tfor(int i=0;i<numberOfRecords;i++){\\n\\t\\t\\t\\tString line = buff2.readLine();\\n\\t\\t\\t\\tindexes[i] = new Index(line);\\n\\t\\t\\t}\\n\\n\\t\\t\\tArrays.sort(indexes);\\n\\t\\t\\tbuff.close();\\n\\t\\t\\treader.close();\\n\\t\\t\\tbuff2.close();\\n\\t\\t\\treader2.close();\\n\\t\\t\\t\\n\\t\\t\\treturn indexes;\\n\\n\\t\\t} catch (Exception e){\\n\\t\\t\\treturn null;\\n\\t\\t}\\n\\t}\",\n \"public abstract void readFromFile( ) throws Exception;\",\n \"public static void main(String[] args) throws IOException {\\n\\t\\tPath filePath = Paths.get(\\\"/home/SLKTECHLABS/tarun.patel/git/DemoSlk/countline.txt\\\");\\n\\t\\t \\n\\t\\tmakeHiddenFile();\\n\\t\\t\\n\\t}\",\n \"private void parseFile(String fileName) {\\n\\t\\ttry {\\n\\t\\t\\tBufferedReader bufferedReader = new BufferedReader(new FileReader(fileName));\\n\\t\\t\\tString line;\\n\\t\\t\\tint counter = 0;\\n\\t\\t\\tString lastMethod = null;\\n\\t\\t\\t\\n\\t\\t\\twhile ((line = bufferedReader.readLine()) != null) {\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Logic for method consolidation\\n\\t\\t\\t\\tif (line.contains(\\\"Method Call\\\")) {\\n\\t\\t\\t\\t\\tlastMethod = line.substring(line.indexOf(\\\"target=\\\")+7);\\n\\t\\t\\t\\t\\tlastMethod = lastMethod.substring(lastMethod.indexOf('#')+1).replace(\\\"\\\\\\\"\\\",\\\"\\\").trim();\\n\\t\\t\\t\\t\\tlastMethod = lastMethod + \\\":\\\" + counter++;\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (line.contains(\\\"Field Write\\\")) {\\n\\t\\t\\t\\t\\tString[] tokens = line.split(\\\",\\\");\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tString object = tokens[4].substring(tokens[4].indexOf(\\\"=\\\") + 1).replace(\\\"\\\\\\\"\\\", \\\"\\\").trim();\\n\\t\\t\\t\\t\\tString field = tokens[5].substring(0, tokens[5].indexOf(\\\"=\\\")).replace(\\\"\\\\\\\"\\\", \\\"\\\").trim();\\n\\t\\t\\t\\t\\tString value = tokens[5].substring(tokens[5].indexOf(\\\"=\\\") + 1).replace(\\\"\\\\\\\"\\\", \\\"\\\").trim();\\n\\t\\t\\t\\t\\tString fld = object.replace(\\\"/\\\", \\\".\\\") + \\\".\\\" + field;\\n\\t\\t\\t\\t\\tevents.add(new Event(fld, value, lastMethod));\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tallFields.add(fld);\\n\\t\\t\\t\\t}\\n//\\t\\t\\t\\tif (line.contains(\\\"Method Returned\\\")) {\\n//\\t\\t\\t\\t\\t//operations for this method ended\\n//\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\tbufferedReader.close();\\n\\t\\t} catch (IOException e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\t}\",\n \"public void readtabs(File f) {\\r\\n \\tString str = new String();\\r\\n try{\\r\\n BufferedReader br = new BufferedReader(new FileReader(f.getAbsolutePath()));\\r\\n str = br.readLine();\\r\\n \\r\\n while((str = br.readLine()) != null){\\r\\n //str = str.replaceAll(\\\";\\\", \\\"\\\");\\r\\n String info[] = str.split(\\\";\\\");\\r\\n if(f.getName().equals(\\\"mdl_chat_messages.txt\\\")){\\r\\n \\t//chat message id; chatid; userid; groupid; system; message; timestamp;\\r\\n \\tmobileact ma = new mobileact(info[2].trim(), info[6].trim(), \\\"Chat Message\\\", info[5]);\\r\\n \\tmobact.add(ma);\\r\\n }else if(f.getName().equals(\\\"mdl_forum_posts.txt\\\")){\\r\\n \\t//id; discussion; parent; userid; created; modified; mailed; subject; message; \\r\\n \\t//messageformat; messagetrust; attachment; totalscore; mailnow; \\r\\n \\tmobileact ma = new mobileact(info[3].trim(), info[5].trim(), \\\"Forum Posts\\\", info[8].trim());\\r\\n \\tmobact.add(ma);\\r\\n }else if(f.getName().equals(\\\"mdl_quiz_attempts.txt\\\")){\\r\\n \\t//id; quiz; userid; attempt; uniqueid; layout; currentpage; \\r\\n \\t//preview; state; timestart; timefinish; timemodified; timecheckstate; \\r\\n \\t//sumgrades; needsupgradetonewqe; \\r\\n \\tmobileact ma = new mobileact(info[2].trim(), info[11].trim(), \\\"Attempt Quiz\\\", info[8].trim());\\r\\n \\tmobact.add(ma);\\r\\n }\\r\\n }\\r\\n br.close();\\r\\n }catch(Exception e){\\r\\n JOptionPane.showMessageDialog(null, \\\"read moodle log file failed.\\\", \\\"System Message\\\", JOptionPane.ERROR_MESSAGE);\\r\\n }\\r\\n }\",\n \"public void getUserData()\\n\\t{\\n\\t\\tint count; //Loop counter\\n\\t\\tString pathname = filename;\\n\\t\\t\\n\\t\\tString div = \\\",\\\"; //Used to divide info.\\n\\t\\tString [] userArray; //To hold divided info.\\n\\t\\t\\n\\t\\ttry {\\n FileReader reader = new FileReader(pathname);\\n BufferedReader bufferedReader = new BufferedReader(reader);\\n \\n String line;\\n \\n //While getting each line of the data file, BUT stops when USER data found.\\n //Loop through each line and determine which user data to choose.\\n while ((line = bufferedReader.readLine()) != null) {\\n // System.out.println(\\\"User Data in file: \\\" + line);\\n \\n System.out.println(\\\"Checking User name in line of data ...\\\");\\n \\n //This divides the info in the data file into an array.\\n userArray = line.split(div); \\n \\n \\n if (User.equals(userArray[0]))\\n \\t{\\n \\t\\tSystem.out.println(\\\"User Found: \\\" + User);\\n \\t\\tuser_line = line;\\n \\t\\t//Assigning data to class variables.\\n \\t\\tUserPassword = userArray[1].trim(); //Assigning the password.\\n \\t\\tDevice_ID = Integer.parseInt(userArray[2].trim()); //Assigning device ID.\\n \\t\\tisLost = (Integer.parseInt(userArray[3].trim()) == 0) ? false : true;\\n \\t\\t\\n \\t\\t//This reads out information.\\n \\t\\tfor (count = 0; count < userArray.length; count++)\\n {\\n \\t\\t\\tSystem.out.println(\\\"INFO: \\\" + userArray[count]);\\n }\\n \\t\\tbreak;\\n \\t}\\n System.out.println(\\\"========================================\\\");\\n }\\n reader.close();\\n \\n } catch (IOException e) {\\n e.printStackTrace();\\n }\\n\\t}\",\n \"UploadInfo advancedUpload(AdvanceFile file);\",\n \"public void readCategoryFile(File file) {\\n\\ttry (BufferedReader br = new BufferedReader(new FileReader(file)))\\n\\t{\\n\\t\\tString sCurrentLine;\\n\\t\\tString [] lineElements;\\n\\t\\t\\n\\t\\tint row = 0;\\n\\t\\twhile ((sCurrentLine = br.readLine()) != null) {\\n\\t\\t\\t//System.out.println(sCurrentLine);\\n\\t\\t\\t\\n\\t\\t\\tlineElements = sCurrentLine.split(\\\"\\\\\\\\s+\\\");\\n\\t\\t\\t//System.out.println(lineElements.length);\\n\\t\\t\\tfor (int column = 0; column < lineElements.length; column++) {\\t\\t\\n\\t\\t\\t\\t//System.out.println(column);\\n\\t\\t\\t\\tint category = Integer.parseInt(lineElements[column]);\\n\\t\\t\\t\\t//System.out.println(vertices.size());\\n\\t\\t\\t\\tPOI v1 = vertices.get(row);\\n\\t\\t\\t\\tPOI v2 = vertices.get(column);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tArc arc = getArc(v1, v2);\\n\\t\\t\\t\\tif (!distMtx) {\\n\\t\\t\\t\\t\\tdouble distance = v1.distanceTo(v2);\\n\\t\\t\\t\\t\\tif (data == Dataset.VERBEECK) {\\n\\t\\t\\t\\t\\t\\tdistance = distance / 5.0;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tdistance = distance / 10.0;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tarc.setLength(distance);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tarc.setCategory(category);\\n\\t\\t\\t\\tif (distConstraint) {\\n\\t\\t\\t\\t\\tarc.setSpeedTable(allOneSpeedTable);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tarc.setSpeedTable(speedTables.get(category));\\n\\t\\t\\t\\t}\\t\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\trow ++;\\n\\t\\t}\\n\\t} catch (IOException e) {\\n\\t\\te.printStackTrace();\\n\\t}\\n}\",\n \"private void ReadTextFile(String FilePath) {\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"private List<String> findAnts(String inputFileName) {\\n\\nList<String> lines = new ArrayList<>();\\ntry {\\nBufferedReader br = new BufferedReader(new FileReader(inputFileName));\\nString line = br.readLine();\\nwhile (line != null) {\\nlines.add(line);\\nline = br.readLine();\\n}\\n} catch (Exception e) {\\n\\n}\\n\\nchar[] splitLineByLetterOrDigit;\\nList<String> saveAnts = new ArrayList<>();\\n\\nfor (int k = 0; k < lines.size(); k++) {\\nString singleLine = lines.get(k);\\nsplitLineByLetterOrDigit = singleLine.toCharArray();\\nfor (int i = 0; i < splitLineByLetterOrDigit.length; i++) {\\nif (Character.isLetter(splitLineByLetterOrDigit[i])) {\\n// first is row\\nsaveAnts.add(String.format(\\\"%d %d %s\\\", k, i, splitLineByLetterOrDigit[i]));\\n}\\n}\\n}\\n\\nreturn saveAnts;\\n}\",\n \"public static void main(String[] args) {\\n\\t\\tFile f= new File(\\\"E://workplace/BigFileRead/src/data/itcont.txt\\\");\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tBufferedReader b=new BufferedReader(new FileReader(f));\\r\\n\\t\\t\\tString readLine=\\\"\\\";\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//得到总行数\\r\\n\\t\\t\\tInstant lineCountStart=Instant.now();//当前时间\\r\\n\\t\\t\\tint lines=0;\\r\\n\\t\\t\\tInstant nameStart=Instant.now();\\r\\n\\t\\t\\tArrayList<String> names=new ArrayList<String>();\\r\\n\\t\\t\\t//得到第432个和第43243个名字\\r\\n\\t\\t\\tArrayList<Integer> indexs=new ArrayList<>();\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tindexs.add(1);\\r\\n\\t\\t\\tindexs.add(433);\\r\\n\\t\\t\\tindexs.add(43244);\\r\\n\\t\\t\\t//计算每个月的捐赠量\\r\\n\\t\\t\\tInstant donationsStart=Instant.now();\\r\\n\\t\\t\\tArrayList<String> dates=new ArrayList<String>();\\r\\n\\t\\t\\t//计算每一个名字的出现次数\\r\\n\\t\\t\\tInstant commonNamesStart=Instant.now();\\r\\n\\t\\t\\tArrayList<String> firstNames=new ArrayList<String>();\\r\\n\\t\\t\\tSystem.out.println(\\\"start read file using input stream!\\\");\\r\\n\\t\\t\\ttry {\\r\\n\\t\\t\\t\\twhile((readLine=b.readLine())!=null){\\r\\n\\t\\t\\t\\tlines++;\\r\\n\\t\\t\\t\\t//得到所有的名字\\r\\n\\t\\t\\t\\tString array1[]=readLine.split(\\\"\\\\\\\\s*\\\\\\\\|s*\\\");\\r\\n\\t\\t\\t\\tString name=array1[7];\\r\\n\\t\\t\\t\\tnames.add(name);\\r\\n\\t\\t\\t\\tif(indexs.contains(lines)){\\r\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"names:\\\"+names.get(lines-1)+\\\"at index: \\\"+(lines-1));\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tif (name.contains(\\\", \\\")){\\r\\n\\t\\t\\t\\t\\tString array2[]=(name.split(\\\",\\\"));\\r\\n\\t\\t\\t\\t\\tString firstHalfOfName=array2[1].trim();\\r\\n\\t\\t\\t\\t\\tif(firstHalfOfName!=\\\"undefined\\\"||!firstHalfOfName.isEmpty()){\\r\\n\\t\\t\\t\\t\\t\\tif(firstHalfOfName.contains(\\\" \\\")){\\r\\n\\t\\t\\t\\t\\t\\t\\tString array3[]=(name.split(\\\" \\\"));\\r\\n\\t\\t\\t\\t\\t\\t\\tString firstName=array3[0].trim();\\r\\n\\t\\t\\t\\t\\t\\t\\tfirstNames.add(firstName);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\telse{\\r\\n\\t\\t\\t\\t\\t\\t\\tfirstNames.add(firstHalfOfName);\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tString rawDate=array1[4];\\r\\n\\t\\t\\t\\tString year=rawDate.substring(0,4);\\r\\n\\t\\t\\t\\tString month=rawDate.substring(4,6);\\r\\n\\t\\t\\t\\tString formatDate=month+\\\"-\\\"+year;\\r\\n\\t\\t\\t\\tdates.add(formatDate);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t} catch (IOException e) {\\r\\n\\t\\t\\t\\t// TODO Auto-generated catch block\\r\\n\\t\\t\\t\\te.printStackTrace();\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tInstant namesEnd=Instant.now();\\r\\n\\t\\t\\tlong timeElapseNames=Duration.between(nameStart, namesEnd).toMillis();\\r\\n\\t\\t\\tSystem.out.println(\\\"names time :\\\"+timeElapseNames+\\\"ms\\\");\\r\\n\\t\\t\\tSystem.out.println(\\\"total lines :\\\"+lines);\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tInstant lineCountsEnd=Instant.now();\\r\\n\\t\\t\\tlong timeElapselineCounts=Duration.between(lineCountStart, lineCountsEnd).toMillis();\\r\\n\\t\\t\\tSystem.out.println(\\\"lines time :\\\"+timeElapseNames+\\\"ms\\\");\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tHashMap<String, Integer> dateMap=new HashMap<String, Integer>();\\r\\n\\t\\t\\tfor(String date:dates){\\r\\n\\t\\t\\t\\tInteger count =dateMap.get(date);\\r\\n\\t\\t\\t\\tif(count==null){\\r\\n\\t\\t\\t\\t\\tdateMap.put(date, 1);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\telse{\\r\\n\\t\\t\\t\\t\\tdateMap.put(date, count+1);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tfor (Map.Entry<String, Integer> entry :dateMap.entrySet()){\\r\\n\\t\\t\\t\\tString key=entry.getKey();\\r\\n\\t\\t\\t\\tInteger value=entry.getValue();\\r\\n\\t\\t\\t\\tSystem.out.println(\\\"Donations per month and year: \\\"+key+\\\" and donation count: \\\"+value);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tInstant donationEnd=Instant.now();\\r\\n\\t\\t\\tlong timeElapsedDonations=Duration.between(donationsStart, donationEnd).toMillis();\\r\\n\\t\\t\\tSystem.out.println(\\\"Donation time: \\\"+timeElapsedDonations+\\\" ms\\\");\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\tHashMap<String, Integer> map=new HashMap<String, Integer>();\\r\\n\\t\\t\\tfor(String name : firstNames){\\r\\n\\t\\t\\t\\tInteger count =dateMap.get(name);\\r\\n\\t\\t\\t\\tif(count==null){\\r\\n\\t\\t\\t\\t\\tmap.put(name, 1);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\telse{\\r\\n\\t\\t\\t\\t\\tmap.put(name, count+1);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tLinkedList<Entry<String, Integer>> list =new LinkedList<>(map.entrySet());\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tCollections.sort(list,new Comparator<Map.Entry<String, Integer>>() {\\r\\n\\t\\t\\t\\t@Override\\r\\n\\t\\t\\t\\tpublic int compare(Map.Entry<String, Integer> o1, Map.Entry<String, Integer> o2) {\\r\\n\\t\\t\\t\\t\\t// TODO Auto-generated method stub\\r\\n\\t\\t\\t\\t\\treturn (o2.getValue()).compareTo(o1.getValue());\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t});\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tSystem.out.println(\\\"The most Common first name is: \\\"+list.get(0).getKey()+\\\" and it occurs: \\\"+list.get(0).getValue()+\\\" time.\\\");\\r\\n\\t\\t\\tInstant commonNameEnd=Instant.now();\\r\\n\\t\\t\\tlong timeElapseCommonName =Duration.between(commonNamesStart, commonNameEnd).toMillis();\\r\\n\\t\\t\\tSystem.out.println(\\\"most common name time: \\\"+timeElapseCommonName+\\\" ms\\\");\\r\\n\\t\\t} catch (FileNotFoundException e) { \\r\\n\\t\\t\\te.printStackTrace();\\r\\n\\t\\t}\\r\\n\\t}\",\n \"String[] getActivities(String filepath) throws ParserConfigurationException, SAXException, IOException;\",\n \"protected abstract void readFile();\",\n \"private void readFromFile() {\\n\\t\\tPath filePath = Paths.get(inputFile);\\n\\n\\t\\ttry (BufferedReader reader = Files.newBufferedReader(filePath,\\n\\t\\t\\t\\tCharset.forName(\\\"UTF-8\\\"));) {\\n\\t\\t\\tString line = null;\\n\\n\\t\\t\\twhile ((line = reader.readLine()) != null) {\\n\\t\\t\\t\\tString[] splitLine = line.split(\\\",\\\");\\n\\t\\t\\t\\tcurrentGen.setValue(Integer.parseInt(splitLine[0]),\\n\\t\\t\\t\\t\\t\\tInteger.parseInt(splitLine[1]), true);\\n\\t\\t\\t}\\n\\t\\t} catch (IOException e) {\\n\\t\\t\\tSystem.out.println(\\\"Could not find file provided.\\\");\\n\\t\\t}\\n\\t}\",\n \"public int importOnlyFnaBitSequences(String filename, int start, int end) {\\n int currentKID = 0;\\n int result = 0;\\n// String currName = null;\\n boolean store = false;\\n SuperString seq = new SuperString();\\n try (BufferedReader br = new BufferedReader(new FileReader(filename))) {\\n\\n for (String line; (line = br.readLine()) != null; ) {\\n if (line.charAt(0) == '>'){\\n if (currentKID >= start) {\\n if (seq.length() > 0) {\\n// System.err.print(\\\"KID\\\\t\\\"+currentKID+\\\"\\\\thas length\\\\t\\\"+seq.length());\\n storeOnlyBitSequence(currentKID, seq);\\n } else {\\n sequenceLength.add(0);\\n exceptionsArr.add(new HashMap<Integer,Character>());\\n }\\n result++;\\n seq = new SuperString();\\n// currName = line.trim().substring(1);\\n store = true;\\n }\\n currentKID++;\\n } else if (store) {\\n seq.addAndTrim(line);\\n }\\n if (currentKID >= end) break;\\n }\\n } catch (FileNotFoundException e) {\\n e.printStackTrace();\\n } catch (IOException e) {\\n e.printStackTrace();\\n }\\n\\n return result;\\n }\",\n \"public void parseFile(){\\n try{\\n BufferedReader br = new BufferedReader(new FileReader(\\\"ElevatorConfig.txt\\\"));\\n \\n String fileRead;\\n \\n totalSimulatedTime = 1000;\\n Integer.parseInt(br.readLine());\\n simulatedSecondRate = 30;\\n Integer.parseInt(br.readLine());\\n \\n for (int onFloor = 0; onFloor< 5; onFloor++){\\n \\n fileRead = br.readLine(); \\n String[] tokenize = fileRead.split(\\\";\\\");\\n for (int i = 0; i < tokenize.length; i++){\\n String[] floorArrayContent = tokenize[i].split(\\\" \\\");\\n \\n int destinationFloor = Integer.parseInt(floorArrayContent[1]);\\n int numPassengers = Integer.parseInt(floorArrayContent[0]);\\n int timePeriod = Integer.parseInt(floorArrayContent[2]);\\n passengerArrivals.get(onFloor).add(new PassengerArrival(numPassengers, destinationFloor, timePeriod));\\n }\\n }\\n \\n br.close();\\n \\n } catch(FileNotFoundException e){ \\n System.out.println(e);\\n } catch(IOException ioe){\\n ioe.printStackTrace();\\n }\\n\\n }\",\n \"public static void startup() {\\n\\t\\tString thisLine;\\n\\t\\tString currentName = \\\"\\\";\\n\\t\\tboolean next = true;\\n\\n\\t\\t// DEBUG\\n\\t\\t// System.out.println(\\\"entered here\\\");\\n\\n\\t\\t// Loop across the arguments\\n\\n\\t\\t// Open the file for reading\\n\\t\\ttry {\\n\\t\\t\\tBufferedReader br = new BufferedReader(new FileReader(GIGA_WORD));\\n\\t\\t\\twhile ((thisLine = br.readLine()) != null) {\\n\\t\\t\\t\\tString str = thisLine.trim();// .replaceAll(\\\"(\\\\\\\\r|\\\\\\\\n)\\\", \\\"\\\");\\n\\t\\t\\t\\tString[] wordNumber = str.split(\\\"[ ]{2,}\\\");\\n\\t\\t\\t\\tString word = wordNumber[0].toLowerCase();\\n\\t\\t\\t\\tint cnt = Integer.parseInt(wordNumber[1]);\\n\\t\\t\\t\\tgigaMap.put(word, cnt);\\n\\t\\t\\t}\\n\\t\\t\\tbr.close();\\n\\t\\t\\tbr = null;\\n\\t\\t\\tbr = new BufferedReader(new FileReader(FILE_NAME));\\n\\t\\t\\twhile ((thisLine = br.readLine()) != null) {\\n\\t\\t\\t\\tString str = thisLine.trim();// replaceAll(\\\"(\\\\\\\\r|\\\\\\\\n)\\\", \\\"\\\");\\n\\t\\t\\t\\tif (str.equals(\\\"[Term]\\\")) {\\n\\t\\t\\t\\t\\tnext = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (str.startsWith(\\\"name:\\\")) {\\n\\t\\t\\t\\t\\tif (next) {\\n\\t\\t\\t\\t\\t\\tcurrentName = str.replaceAll(\\\"name: \\\", \\\"\\\");\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (str.startsWith(\\\"synonym:\\\")) {\\n\\t\\t\\t\\t\\tif (str.contains(\\\"EXACT\\\") || str.contains(\\\"NARROW\\\")) {\\n\\t\\t\\t\\t\\t\\t// synonym..\\n\\t\\t\\t\\t\\t\\tPattern pattern = Pattern\\n\\t\\t\\t\\t\\t\\t\\t\\t.compile(\\\"synonym:.*\\\\\\\"(.*)\\\\\\\".*\\\");\\n\\t\\t\\t\\t\\t\\tMatcher matcher = pattern.matcher(str);\\n\\t\\t\\t\\t\\t\\t// DEBUG\\n\\t\\t\\t\\t\\t\\t// System.err.println(str);\\n\\t\\t\\t\\t\\t\\tif (matcher.find()) {\\n\\t\\t\\t\\t\\t\\t\\tString syno = matcher.group(1);\\n\\t\\t\\t\\t\\t\\t\\tif (!currentName.equals(\\\"\\\")) {\\n\\t\\t\\t\\t\\t\\t\\t\\t// System.err.format(\\\"%s:%s.\\\\n\\\", currentName,\\n\\t\\t\\t\\t\\t\\t\\t\\t// syno);\\n\\n\\t\\t\\t\\t\\t\\t\\t\\tadd(currentName, syno);\\n\\t\\t\\t\\t\\t\\t\\t\\tadd(syno, currentName);\\n\\t\\t\\t\\t\\t\\t\\t\\trecursiveAddSyno(currentName, syno);\\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\\t\\tbr.close();\\n\\t\\t\\tbr = null;\\n\\t\\t} catch (IOException e) {\\n\\t\\t\\tSystem.err.println(\\\"Error: \\\" + e);\\n\\t\\t}\\n\\t}\",\n \"public static void processInput() throws IOException {\\r\\n\\t\\t\\r\\n\\t\\t//Out statement let user know the input file is being read\\t\\r\\n\\t\\tScanner scnr;\\r\\n\\t\\tString[] splitString;\\r\\n\\t\\t\\r\\n\\t\\tFile file = new File(\\\"Project_04_Input01.txt\\\");\\r\\n\\t\\tscnr = new Scanner(file);\\r\\n\\t\\t\\r\\n\\t\\tSystem.out.println(\\\"Reading data from \\\" + file + \\\"...\\\");\\r\\n\\t\\t\\r\\n\\t\\twhile(scnr.hasNextLine()) {\\r\\n\\t\\t\\tString line = scnr.nextLine();\\r\\n\\t\\t\\tsplitString = line.split(\\\",\\\");\\r\\n\\r\\n\\t\\t\\tif (splitString[0].contains(\\\"STUDENT\\\")) {\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t// Call processStudentData\\r\\n\\t\\t\\t\\tprocessStudentData(splitString);\\r\\n\\t\\t\\t\\tSystem.out.println(\\\"'STUDENT' has been found in the file.\\\");\\r\\n\\r\\n\\t\\t\\t} // End if\\r\\n\\t\\t\\t\\r\\n\\t\\t\\telse if (splitString[0].contains(\\\"GRADEITEM\\\") ) {\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t// Call processGradeItemData\\r\\n\\t\\t\\t\\tprocessGradeItemData(splitString);\\r\\n\\t\\t\\t\\tSystem.out.println(\\\"'GRADEITEM' has been found in the file.\\\");\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t} // End if\\r\\n\\t\\t} // End while\\r\\n\\t\\t\\r\\n\\t\\t// Close the file\\r\\n\\t\\tscnr.close();\\r\\n\\t\\t\\t\\r\\n\\t}\",\n \"public void service_psy (Personne p) throws FileNotFoundException\\r\\n\\t{\\r\\n\\t\\r\\n\\t\\t\\r\\n\\t\\t \\t\\tString [] info_psy=null ;\\r\\n\\t\\t \\t\\tString [] cle_valeur=null;\\r\\n\\t\\t \\t\\tboolean spec,adr;\\r\\n\\t\\t \\t\\tFileInputStream f=new FileInputStream(\\\"C://Users/Azaiez Hamed/Desktop/workspace/Projet de programmation/src/Medecin.txt\\\");\\r\\n\\t\\t \\t\\ttry {\\r\\n\\t\\t \\t\\t\\tBufferedReader reader =new BufferedReader (new InputStreamReader(f,\\\"UTF-8\\\"));\\r\\n\\t\\t \\t\\t\\tString line=reader.readLine();\\r\\n\\t\\t \\t\\t\\twhile(line!=null){\\r\\n\\t\\t \\t\\t\\t\\tinfo_psy=line.split(\\\"\\\\t\\\\t\\\\t\\\");\\r\\n\\t\\t \\t\\t\\t\\tspec=false;adr=false;\\r\\n\\t\\t \\t\\t\\t\\tfor(int i=0;i<info_psy.length;i++)\\r\\n\\t\\t \\t\\t\\t\\t{\\r\\n\\t\\t \\t\\t\\t\\t\\t cle_valeur=info_psy[i].split(\\\":\\\");\\r\\n\\t\\t\\t\\t\\t\\t if ((cle_valeur[0].equals(\\\"specialite\\\"))&& (cle_valeur[1].equals(\\\"psy\\\")))\\r\\n\\t\\t\\t\\t\\t\\t \\t spec=true;\\r\\n\\t\\t\\t\\t\\t\\t if ((cle_valeur[0].equals(\\\"gouvernerat\\\"))&&(cle_valeur[1].equals(p.getGouvernerat())))\\r\\n\\t\\t \\t\\t\\t\\t\\t \\tadr=true;\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t \\t\\t\\t\\tif (spec && adr) {\\r\\n\\t\\t \\t\\t\\t\\t\\t System.out.println(\\\"voilà toutes les informations du psy, veuillez lui contacter immédiatement **\\\");\\r\\n\\t\\t \\t\\t\\t\\t\\t System.out.println(line);return;}\\r\\n\\t\\t \\t\\t\\t\\telse\\r\\n\\t\\t \\t\\t\\t\\t line=reader.readLine();\\r\\n\\t\\t \\t\\t\\t\\t }\\r\\n\\t\\t \\t\\t }\\r\\n\\t\\t \\t\\t \\tcatch(IOException e){e.printStackTrace();}\\r\\n\\t\\t \\t\\t System.out.println(\\\"Pas de psy trouvé dans votre gouvernerat\\\");\\r\\n\\t}\",\n \"private void readFile (String file, Visitor visitor) throws Exception {\\n\\t\\tFileReader fr = new FileReader (file);\\n\\t\\tBufferedReader reader = new BufferedReader (fr);\\n\\n\\t\\tSystem.out.println (\\\"Reading file \\\" + file);\\n\\n\\t\\tint count = 0;\\n\\t\\tfor (String line; (line = reader.readLine()) != null;) {\\n\\t\\t\\tif (count++ % 10000 == 0) System.out.println (line);\\n\\t\\t\\tvisitor.visit (line);\\n\\n\\t\\t\\tif (count >= LIMIT) break;\\n\\t\\t}\\n\\n\\t\\tSystem.out.println (\\\"Done\\\");\\n\\n\\t\\treader.close();\\n\\t\\tfr.close();\\n\\t}\",\n \"public static void main(String[] args){\\n\\t\\ttry{\\n\\t\\t\\tFileReader fr=new FileReader(\\\"C:\\\\\\\\Users\\\\\\\\bharathi\\\\\\\\Desktop\\\\\\\\Hello\\\\\\\\new.txt\\\");\\n\\t\\t\\tbr = new BufferedReader(fr);\\n\\t\\t\\tSystem.out.println(\\\"reading lins from the file.... \\\"+br.readLine());\\n\\t\\t}catch(Exception e){}\\n\\t}\",\n \"private void logLineFromTasksFile(File cgf) {\\n String str;\\n if (LOG.isDebugEnabled()) {\\n try (BufferedReader inl =\\n new BufferedReader(new InputStreamReader(new FileInputStream(cgf\\n + \\\"/tasks\\\"), \\\"UTF-8\\\"))) {\\n str = inl.readLine();\\n if (str != null) {\\n LOG.debug(\\\"First line in cgroup tasks file: {} {}\\\", cgf, str);\\n }\\n } catch (IOException e) {\\n LOG.warn(\\\"Failed to read cgroup tasks file. \\\", e);\\n }\\n }\\n }\",\n \"public boolean readDataFile();\",\n \"void findCogs(File input, int mode, Mappings map){\\n int lineNum=0;\\n\\n BufferedReader reader;\\n try {\\n Path path =Paths.get(input.getAbsolutePath());\\n System.out.println(\\\"Path: \\\"+input.getAbsolutePath());\\n reader = Files.newBufferedReader(path,ENCODING);\\n String line = null;\\n while ((line = reader.readLine()) != null) {\\n lineNum++;\\n \\n if(lineNum==1){\\n String[] gensize=line.split(\\\" \\\");\\n String c=gensize[gensize.length-1];\\n System.out.println(\\\"String c COG: \\\"+c);\\n String [] coord=c.split(\\\"\\\\\\\\.\\\\\\\\.\\\");\\n System.out.println(\\\"coord size: \\\"+coord.length);\\n minCoordinate=Integer.parseInt(coord[0]);\\n maxCoordinate=Integer.parseInt(coord[1]);\\n }\\n \\n if(lineNum>3){\\n String[] st=line.split(\\\"\\\\t\\\");\\n String[] coord=st[0].split(\\\"\\\\\\\\..\\\");\\n int x=Integer.parseInt(coord[0]), y=Integer.parseInt(coord[1]);\\n\\n String cogName=\\\"\\\";\\n if(mode==0){\\n String pattern = \\\"(^COG)(\\\\\\\\d+)(\\\\\\\\D+)\\\";\\n \\n if(st[7].contains(\\\",\\\"))\\n st[7]=st[7].split(\\\",\\\")[0];\\n cogName=st[7].replaceAll(pattern, \\\"$1$2\\\");\\n }\\n else{\\n cogName=st[3];\\n }\\n\\n Triplet<Integer,Integer,String> t=new Triplet<Integer,Integer,String>(x,y,cogName);\\n cogs.add(t);\\n\\n if(map.geneOgMapping.containsKey(cogName))\\n ancogs.add(t);\\n }\\n }\\n reader.close();\\n }catch(IOException ioe)\\n {\\n System.err.println(\\\"IOException: \\\" + ioe.getMessage());\\n }\\n }\",\n \"public static void loadProgramData() {\\n\\r\\n try {\\r\\n File f = new File(\\\"DetailsOfVaccination.txt.txt\\\"); //Accessing the file\\r\\n Scanner read = new Scanner(f);\\r\\n while (read.hasNextLine()) { //Print data in the file line by line\\r\\n String data = read.nextLine();\\r\\n System.out.println(data);\\r\\n }\\r\\n read.close();\\r\\n }\\r\\n catch (FileNotFoundException e) { //Runs if there was an error\\r\\n System.out.println(\\\"An error occurred while reading data from the file.\\\");\\r\\n e.printStackTrace();\\r\\n }\\r\\n }\",\n \"public static void main(String[] args) {\\n\\t\\t\\ttry(FileReader fr = new FileReader(\\\"Numbers2.txt\\\");\\n\\t\\t\\t\\tBufferedReader br= new BufferedReader(fr); )\\n\\t\\t\\t{\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tint index=0;\\n//\\t\\t\\t\\tThis is one way to read code from txt file\\n\\t\\t\\t\\twhile(br.ready()) {\\n\\t\\t\\t\\t\\tSystem.out.print(++index+\\\":\\\");\\n\\t\\t\\t\\t\\tSystem.out.println(br.readLine());\\t\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tcatch(FileNotFoundException e){\\n\\t\\t\\t\\te.printStackTrace();\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tcatch(IOException e){\\n\\t\\t\\t\\te.printStackTrace();\\n\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\tfinally {\\n\\t\\t\\tSystem.out.println(\\\"Ended..\\\");\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t}\",\n \"@Override\\n public FileStatus getFileStatus(File file) {\\n\\treturn null;\\n }\",\n \"public long getFileIndex(){\\n \\tString fileName=file.getName();\\n// \\tSystem.out.println(\\\"fileName:\\\"+fileName);\\n \\tfinal long start = Long.parseLong(fileName.substring(0,\\n\\t\\t\\t\\tfileName.length() - FILE_SUFFIX.length()));\\n// \\tSystem.out.println(\\\"start:\\\"+start);\\n \\treturn start;\\n }\",\n \"private void read() {\\n\\n\\t\\t\\t\\tString road=getActivity().getFilesDir().getAbsolutePath()+\\\"product\\\"+\\\".txt\\\";\\n\\n\\t\\t\\t\\ttry {\\n\\t\\t\\t\\t\\tFile file = new File(road); \\n\\t\\t\\t\\t\\tFileInputStream fis = new FileInputStream(file); \\n\\t\\t\\t\\t\\tint length = fis.available(); \\n\\t\\t\\t\\t\\tbyte [] buffer = new byte[length]; \\n\\t\\t\\t\\t\\tfis.read(buffer); \\n\\t\\t\\t\\t\\tString res1 = EncodingUtils.getString(buffer, \\\"UTF-8\\\"); \\n\\t\\t\\t\\t\\tfis.close(); \\n\\t\\t\\t\\t\\tjson(res1.toString());\\n\\t\\t\\t\\t} catch (IOException e) {\\n\\t\\t\\t\\t\\t// TODO Auto-generated catch block\\n\\t\\t\\t\\t\\te.printStackTrace();\\n\\t\\t\\t\\t} \\n\\t\\t\\t}\",\n \"private void processInput()\\n{\\n File f1 = input_file;\\n\\n try (BufferedReader br = new BufferedReader(new FileReader(f1))) {\\n List<DylockLockEntry> ents = new ArrayList<DylockLockEntry>();\\n List<DylockLockEntry> lents = new ArrayList<DylockLockEntry>();\\n double ltime = 0;\\n double ntime = 0;\\n for ( ; ; ) {\\n\\t String ln = br.readLine(); \\n\\t if (ln == null) break;\\n\\t if (ln.startsWith(\\\"ENDBLOCK\\\")) {\\n\\t processBlock(lents);\\n\\t List<DylockLockEntry> xents = lents;\\n\\t lents = ents;\\n\\t ents = xents;\\n\\t ltime = ntime;\\n\\t ntime = 0;\\n\\t }\\n\\t else {\\n\\t DylockLockEntry ent = new DylockLockEntry(this,ln);\\n\\t double t0 = ent.getTime();\\n\\t if (t0 <= ltime) lents.add(ent);\\n\\t else {\\n\\t if (t0 > ntime) ntime = t0;\\n\\t ents.add(ent);\\n\\t }\\n\\t }\\n }\\n processBlock(ents);\\n }\\n catch (IOException e) {\\n System.err.println(\\\"DYLOCK: Problem reading input file: \\\" + e);\\n }\\n}\",\n \"public void getInformation() throws IOException {\\n\\t\\tList<Fire> listFeux = new ArrayList<Fire>();\\n\\t listFeux = this.collectData();\\n\\t \\n\\t if(this.previousIntensity > this.real_intensity) {\\n\\t \\tthis.previousIntensity = this.real_intensity;\\n\\t }\\n\\t\\t\\n\\t\\tthis.alerte.resetIntensity();\\t//on reset l'intensite\\n\\t\\tthis.real_intensity = 0;\\n\\t\\t\\n\\t for (Fire feu: listFeux) {\\t\\t//on recalcul l'intensite\\n\\t \\tfor (CoordEntity coord: feu.getLocation()) {\\n\\t\\t \\tif ( (Math.abs(coord.getX() - this.localisation.x) < this.range) &&\\n\\t\\t \\t\\t\\t(Math.abs(coord.getY() - this.localisation.y) < this.range) ) {\\n\\t\\t \\t\\tint intensity = this.getIntensityFromFire(feu);\\n\\t\\t \\t\\tthis.addRealIntensity(intensity);\\n\\t\\t \\t\\tif (this.isDetectable(feu) == true) {\\n\\t\\t \\t\\t\\tSystem.out.println(\\\"Detectable\\\");\\n\\t\\t\\t \\t\\tif (this.applyErrors() == true) {\\n\\t\\t\\t \\t\\t\\tthis.alerte.setIntensity(intensity);\\t\\n\\t\\t\\t \\t\\t}\\n\\t\\t \\t\\t}\\n\\t }\\t\\t\\n\\t }\\n\\t }\\n\\t System.err.println(previousIntensity + \\\"/\\\" + this.real_intensity + \\\"/\\\" + this.alerte.getIntensity() );\\n\\t\\t if (this.alerte.getIntensity() > previousIntensity) {\\n\\t\\t \\tthis.previousIntensity = this.real_intensity;\\t//on recupere l'intensite mesuree precedement\\n\\t\\t \\tSystem.err.println(\\\"Alarme\\\");\\n\\t\\t \\tthis.triggerAlarm();\\t//si il y a eu aggravation de l'etat du feu\\n\\t\\t }\\n\\t}\",\n \"void visitFile(File file);\",\n \"public static void getInputFileData(){\\n\\t\\t\\t\\n\\t\\t\\t// editable fields\\n\\t\\t\\t\\n\\t\\t\\tString directDistanceFile = \\\"../data/direct_distance_1.txt\\\";\\n\\t\\t\\tString graphInputFile = \\\"../data/graph_input_1.txt\\\";\\n\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t\\t// end of editable fields\\n\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t\\tFile file1 = new File(directDistanceFile);\\n\\t\\t\\tFile file2 = new File(graphInputFile);\\n\\t\\t\\tfiles.add(file1);\\n\\t\\t\\tfiles.add(file2);\\n\\t\\t\\t\\n\\t\\t\\t/*// Directory where data files are\\n\\t\\t\\tPath dataPath = Paths.get(\\\"../data\\\");\\n\\t\\t\\t\\n\\t\\t\\tString path = dataPath.toAbsolutePath().toString();\\n\\t\\t\\t\\n\\t\\t\\tFile dir = new File (path);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\tif (dir.listFiles() == null){\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tSystem.out.println(\\\"WARNING: No files found.\\\");\\n\\n\\t\\t\\t} else if (dir.listFiles() != null && dir.listFiles().length == 2) {\\n\\t\\t\\n\\t\\t\\t\\tfor (File file : dir.listFiles()){\\n\\t\\t\\t\\t\\ttry {\\n\\t\\t\\t\\t\\t\\tfiles.add(file.getName());\\n\\t\\t\\t\\t\\t} catch(Exception e) {\\n\\t\\t\\t\\t\\t\\te.printStackTrace();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t} else {\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tSystem.out.println(\\\"WARNING: Data folder may only contain two files: direct_distance and\\\"\\n\\t\\t\\t\\t\\t\\t+ \\\" graph_input. Please modify contents accordingly before proceeding for alorithm to execute.\\\");\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\t*/\\n\\t\\t\\t\\n\\t\\t\\tfor (File file: files){\\n\\t\\t\\t\\ttry {\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// store direct distances in a hashmap\\n\\t\\t\\t\\t\\tif (file.toString().contains(\\\"distance\\\")){\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t//FileReader fileReader = new FileReader(dataPath.toString() + \\\"/\\\" + file);\\n\\t\\t\\t\\t\\t\\tFileReader fileReader = new FileReader(file);\\n\\t\\t\\t\\t BufferedReader reader = new BufferedReader(fileReader);\\n\\t\\t\\t\\t String line = null;\\n\\t\\t\\t\\t \\n\\t\\t\\t\\t while ((line = reader.readLine()) != null) {\\n\\t\\t\\t\\t \\t\\n\\t\\t\\t\\t \\tStringBuilder num = new StringBuilder();\\n\\t\\t\\t\\t \\tStringBuilder str = new StringBuilder();\\n\\t\\t\\t\\t \\n\\t\\t\\t\\t \\tfor(char c : line.toCharArray()){\\n\\t\\t\\t\\t \\t\\t//find the distance\\n\\t\\t\\t\\t if(Character.isDigit(c)){\\n\\t\\t\\t\\t num.append(c);\\n\\t\\t\\t\\t } \\n\\t\\t\\t\\t //find the associated letter\\n\\t\\t\\t\\t else if(Character.isLetter(c)){\\n\\t\\t\\t\\t str.append(c); \\n\\t\\t\\t\\t }\\n\\t\\t\\t\\t \\t}\\n\\t\\t\\t\\t \\t\\n\\t\\t\\t\\t \\t// add values into hashmap\\n\\t\\t\\t\\t \\tdistance.put(str.toString(), Integer.parseInt(num.toString()));\\n\\t\\t\\t\\t \\t\\n\\t\\t\\t\\t }\\n\\t\\t\\t\\t \\n\\t\\t\\t\\t reader.close(); // close the reader\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t//System.out.println(distance);\\n\\t\\t\\t\\t \\n\\t\\t\\t\\t } \\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// store inputs in a \\n\\t\\t\\t\\t\\telse if (file.toString().contains(\\\"input\\\")){\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t//FileReader fileReader = new FileReader(dataPath.toString() + \\\"/\\\" + file);\\n\\t\\t\\t\\t\\t\\tFileReader fileReader = new FileReader(file);\\n\\t\\t\\t\\t BufferedReader reader = new BufferedReader(fileReader);\\n\\t\\t\\t\\t \\n\\t\\t\\t\\t String line = null;\\n\\t\\t\\t\\t \\n\\t\\t\\t\\t int x=0; // keeps track of line to add\\n\\t\\t\\t\\t \\n\\t\\t\\t\\t \\n\\t\\t\\t\\t while ((line = reader.readLine()) != null) {\\n\\t\\t\\t\\t \\tString[] values = line.split(\\\"\\\\\\\\s+\\\");\\n\\t\\t\\t\\t \\t\\n\\t\\t\\t\\t \\t\\n\\t\\t\\t\\t \\t if (matrix == null) {\\n\\t\\t\\t\\t \\t\\t //instantiate matrix\\n\\t\\t\\t\\t matrix = new String[widthOfArray = values.length]\\n\\t\\t\\t\\t \\t\\t \\t\\t\\t[lenghtOfArray = values.length];\\n\\t\\t\\t\\t }\\n\\t\\t\\t\\t \\t\\n\\t\\t\\t\\t \\t\\n\\t\\t\\t\\t \\t// add values into the matrix\\n\\t\\t\\t\\t \\tfor (int i=0; i < values.length; i++){\\n\\t\\t\\t\\t \\t\\t\\n\\t\\t\\t\\t \\t\\tmatrix[i][x] = values[i];\\n\\t\\t\\t\\t \\t\\t\\n\\t\\t\\t\\t \\t}\\n\\t\\t\\t\\t \\t\\n\\t\\t\\t\\t \\tx++; // next line\\n\\t\\t\\t\\t \\t\\n\\t\\t\\t\\t \\t\\n\\t\\t\\t\\t }\\n\\t\\t\\t\\t \\n\\t\\t\\t\\t reader.close(); // close the reader\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Store input combinations in a hashmap\\n\\t\\t\\t\\t\\tint y=1; \\n\\t\\t\\t\\t\\twhile (y < lenghtOfArray){\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\tinputNodes.add(matrix[0][y]);\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\tfor (int i=1; i < widthOfArray; i++){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\tStringBuilder str = new StringBuilder();\\n\\t\\t\\t\\t\\t\\t\\tstr.append(matrix[0][y]);\\n\\t\\t\\t\\t\\t\\t\\tstr.append(matrix[i][0]);\\n\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\tint inputValue = Integer.parseInt(matrix[i][y]);\\n\\n\\t\\t\\t\\t\\t\\t\\tif (inputValue > 0){\\n\\t\\t\\t\\t\\t\\t\\t\\tinputMap.put(str.toString(), inputValue);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\ty++;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t} catch (Exception e) {\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"WARNING: Please check: \\\"+ file.toString() + \\\". It was not found.\\\");\\n\\t\\t\\t\\t} \\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t}\",\n \"public HashMap readFile(String filePath, HashMap source){\\n\\t\\tArrayList<String> temp1 = new ArrayList<String>();\\n\\t\\tArrayList<String> temp2 = new ArrayList<String>();\\n\\t\\tBufferedReader br = null;\\n\\t\\t\\n\\t\\ttry {\\n\\t\\t\\tString sCurrentLine;\\n\\t\\t\\t\\n\\t\\t\\t// \\\"Users/Jasmine/Documents/Eclipse/CacheDictionary/src/english.txt\\\"\\n\\t\\t\\tbr = new BufferedReader(new FileReader(filePath)); \\n\\t\\t\\t\\n\\t\\t\\t//str.matches(\\\".*\\\\\\\\d+.*\\\"); ==> string that contains numbers\\n\\t\\t\\t//.matches(\\\"[a-zA-Z]+\\\"); ==> string that only contains letter\\n\\t\\t\\twhile ((sCurrentLine = br.readLine()) != null) {\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t/*\\n\\t\\t\\t\\t * if the source file itself is not one word per line, we need to split the string\\n\\t\\t\\t\\t * only letter(not single) will be stored in the array\\n\\t\\t\\t\\t */\\n\\t\\t\\t\\t//\\n\\t\\t\\t\\tif(sCurrentLine.matches(\\\".*([ \\\\t]).*\\\")){ //check if the current line is a single word or not\\n\\t\\t\\t\\t\\ttemp1.add(sCurrentLine);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if(sCurrentLine.matches(\\\"[a-zA-Z]+\\\") && sCurrentLine.length()>1){\\n\\t\\t\\t\\t\\ttemp2.add(sCurrentLine);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}// end of while loop\\n\\t\\t} catch (IOException e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t} finally {\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tif (br != null)br.close();\\n\\t\\t\\t} catch (IOException ex) {\\n\\t\\t\\t\\tex.printStackTrace();\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(!temp1.isEmpty()){\\n\\t\\t\\tfor(int i = 0; i< temp1.size(); i++){\\n\\t\\t\\t\\tString thisLine[] = temp1.get(i).split(\\\" \\\");\\n\\t\\t\\t\\t//for each word in this line\\n\\t\\t\\t\\tfor(int j = 0; j < thisLine.length; j++){\\n\\t\\t\\t\\t\\t//if it is a valid word\\n\\t\\t\\t\\t\\tif(thisLine[j].matches(\\\"[a-zA-Z]+\\\") && thisLine[j].length()>1 ){\\n\\t\\t\\t\\t\\t\\tif( source.get(thisLine[j]) == null){\\n\\t\\t\\t\\t\\t\\t\\tsource.put(thisLine[j].toLowerCase(),thisLine[j].toLowerCase());\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t} // end of if current word i valid\\t\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\t\\n\\t\\t} // end of temp1\\n\\t\\t\\n\\t\\tif(!temp2.isEmpty()){\\n\\t\\t\\tfor(int i = 0; i< temp2.size(); i++){\\n\\t\\t\\t\\tif(temp2.get(i).matches(\\\"[a-zA-Z]+\\\") && temp2.get(i).length()>1){\\n\\t\\t\\t\\t\\tif(source.get(temp2.get(i)) == null){\\n\\t\\t\\t\\t\\t\\tsource.put(temp2.get(i).toLowerCase(),temp2.get(i).toLowerCase());\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t} \\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\treturn source;\\n\\t}\",\n \"@Override\\n\\tpublic boolean readData(File file) {\\n return file.exists();\\n\\t}\",\n \"public static void getProblem(String filename){\\r\\n String line = \\\"\\\";\\r\\n try {\\r\\n //Get the problem instance\\r\\n reader = new BufferedReader(new FileReader(filename));\\r\\n line = reader.readLine();\\r\\n\\r\\n //Assume the first line contains the Universe\\r\\n inString = line.split(\\\",\\\");\\r\\n\\r\\n for (int i = 0; i < inString.length; i++) {\\r\\n universe.add(Integer.parseInt(inString[i]));\\r\\n }\\r\\n Collections.sort(universe);\\r\\n System.out.println(\\\"Universe:\\\" + universe);\\r\\n\\r\\n //Gather in the sets\\r\\n line = reader.readLine();\\r\\n while (line != null){\\r\\n inString = line.split(\\\",\\\");\\r\\n for (int i = 0; i < inString.length; i++) {\\r\\n set.add(Integer.parseInt(inString[i]));\\r\\n }\\r\\n //System.out.println(\\\"Set: \\\" + set);\\r\\n sets.add(set);\\r\\n set = new ArrayList<Integer>();\\r\\n line = reader.readLine();\\r\\n\\r\\n //Create a blank pheromone\\r\\n pheremones.add(0);\\r\\n visited.add(0);\\r\\n }\\r\\n System.out.println(\\\"Sets: \\\" + sets);\\r\\n\\r\\n //Create the pheremones\\r\\n //System.out.println(\\\"PheremoneSize: \\\" + pheremones.size());\\r\\n\\r\\n //Set the degradation\\r\\n //degrade = generationSize/2;\\r\\n\\r\\n }catch(FileNotFoundException e){System.out.println(\\\"File Not Found : \\\" + filename);}\\r\\n catch(Exception e){\\r\\n System.out.println(\\\"ERROR in getProblem\\\");\\r\\n System.out.println(\\\"File Name: \\\" + filename);\\r\\n System.out.println(\\\"Universe: \\\" + universe);\\r\\n System.out.println(\\\"Line: \\\" + line);\\r\\n System.out.println(\\\"InString: \\\" + inString.toString());\\r\\n System.out.println();\\r\\n System.out.println(e.toString());\\r\\n }\\r\\n }\",\n \"protected abstract void parseFile(File f) throws IOException;\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.5580772","0.5543112","0.54212064","0.54078823","0.5372267","0.5369949","0.5281969","0.5267081","0.5252606","0.52332395","0.52244395","0.52021086","0.5095645","0.50758034","0.504734","0.5046121","0.5032622","0.5024921","0.49841657","0.4968902","0.49462947","0.49412695","0.49406514","0.4934994","0.49316248","0.49251842","0.49171263","0.49166185","0.49131998","0.49087882","0.48844603","0.48844185","0.48639613","0.48612502","0.48607317","0.48575708","0.4852044","0.48463884","0.4838917","0.48316303","0.4823876","0.48165536","0.48159692","0.48036125","0.48007125","0.4783051","0.47748205","0.4764675","0.4755972","0.4754935","0.47496253","0.47471243","0.4741252","0.4727775","0.47249174","0.47208646","0.4720562","0.4719158","0.47174776","0.47137776","0.47136134","0.47107384","0.47094902","0.4709392","0.47037894","0.47036004","0.47012866","0.46933153","0.46931544","0.46880865","0.4686868","0.4686737","0.46847472","0.4681092","0.46721983","0.46708474","0.4653625","0.4653141","0.46530074","0.46494687","0.46469542","0.46441355","0.46438685","0.46420863","0.46396264","0.46380225","0.4636802","0.463658","0.46340996","0.46244523","0.46228918","0.46224517","0.46127766","0.46109208","0.46037295","0.46022475","0.45983526","0.4594904","0.4594127","0.45921662","0.45900863"],"string":"[\n \"0.5580772\",\n \"0.5543112\",\n \"0.54212064\",\n \"0.54078823\",\n \"0.5372267\",\n \"0.5369949\",\n \"0.5281969\",\n \"0.5267081\",\n \"0.5252606\",\n \"0.52332395\",\n \"0.52244395\",\n \"0.52021086\",\n \"0.5095645\",\n \"0.50758034\",\n \"0.504734\",\n \"0.5046121\",\n \"0.5032622\",\n \"0.5024921\",\n \"0.49841657\",\n \"0.4968902\",\n \"0.49462947\",\n \"0.49412695\",\n \"0.49406514\",\n \"0.4934994\",\n \"0.49316248\",\n \"0.49251842\",\n \"0.49171263\",\n \"0.49166185\",\n \"0.49131998\",\n \"0.49087882\",\n \"0.48844603\",\n \"0.48844185\",\n \"0.48639613\",\n \"0.48612502\",\n \"0.48607317\",\n \"0.48575708\",\n \"0.4852044\",\n \"0.48463884\",\n \"0.4838917\",\n \"0.48316303\",\n \"0.4823876\",\n \"0.48165536\",\n \"0.48159692\",\n \"0.48036125\",\n \"0.48007125\",\n \"0.4783051\",\n \"0.47748205\",\n \"0.4764675\",\n \"0.4755972\",\n \"0.4754935\",\n \"0.47496253\",\n \"0.47471243\",\n \"0.4741252\",\n \"0.4727775\",\n \"0.47249174\",\n \"0.47208646\",\n \"0.4720562\",\n \"0.4719158\",\n \"0.47174776\",\n \"0.47137776\",\n \"0.47136134\",\n \"0.47107384\",\n \"0.47094902\",\n \"0.4709392\",\n \"0.47037894\",\n \"0.47036004\",\n \"0.47012866\",\n \"0.46933153\",\n \"0.46931544\",\n \"0.46880865\",\n \"0.4686868\",\n \"0.4686737\",\n \"0.46847472\",\n \"0.4681092\",\n \"0.46721983\",\n \"0.46708474\",\n \"0.4653625\",\n \"0.4653141\",\n \"0.46530074\",\n \"0.46494687\",\n \"0.46469542\",\n \"0.46441355\",\n \"0.46438685\",\n \"0.46420863\",\n \"0.46396264\",\n \"0.46380225\",\n \"0.4636802\",\n \"0.463658\",\n \"0.46340996\",\n \"0.46244523\",\n \"0.46228918\",\n \"0.46224517\",\n \"0.46127766\",\n \"0.46109208\",\n \"0.46037295\",\n \"0.46022475\",\n \"0.45983526\",\n \"0.4594904\",\n \"0.4594127\",\n \"0.45921662\",\n \"0.45900863\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":27398,"cells":{"query":{"kind":"string","value":"Created by Timothy Foster on 25 Jul 2016."},"document":{"kind":"string","value":"public interface IGuessingGamePlayer {\n int nextGuess() throws NumberFormatException;\n}"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["@Override\n public void perish() {\n \n }","@Override\n\tpublic void grabar() {\n\t\t\n\t}","@Override\n\tpublic void comer() {\n\t\t\n\t}","private stendhal() {\n\t}","public final void mo51373a() {\n }","@Override\r\n\tpublic void comer() \r\n\t{\n\t\t\r\n\t}","@Override\r\n\tpublic void bicar() {\n\t\t\r\n\t}","@Override\r\n\tpublic void bicar() {\n\t\t\r\n\t}","@Override\r\n\tpublic void tires() {\n\t\t\r\n\t}","@Override\n\tpublic void entrenar() {\n\t\t\n\t}","@Override\r\n\tpublic void dormir() {\n\t\t\r\n\t}","@Override\n\tpublic void nadar() {\n\t\t\n\t}","@Override\n public int describeContents() { return 0; }","public void gored() {\n\t\t\n\t}","@Override\n\tprotected void getExras() {\n\n\t}","@Override\n\tpublic void anular() {\n\n\t}","@Override\n\tprotected void interr() {\n\t}","@Override\n\tpublic void sacrifier() {\n\t\t\n\t}","@Override\n\tpublic void gravarBd() {\n\t\t\n\t}","@Override\n\tpublic void ligar() {\n\t\t\n\t}","@Override\r\n\tpublic void rozmnozovat() {\n\t}","public void mo38117a() {\n }","@Override\n\tprotected void initialize() {\n\t\t\n\t}","@Override\n\tprotected void initialize() {\n\t\t\n\t}","@Override\n\tpublic void init() {\n\t\t\n\t}","@Override\n\tpublic void init() {\n\t\t\n\t}","@Override\n\tpublic void init() {\n\t\t\n\t}","@Override\n\tpublic void init() {\n\t\t\n\t}","@Override\n\tpublic void init() {\n\t\t\n\t}","@Override\n public void init() {\n\n }","@Override\r\n\t\t\tpublic void annadir() {\n\r\n\t\t\t}","@Override\r\n\t\tpublic void init() {\n\t\t\t\r\n\t\t}","private void poetries() {\n\n\t}","@Override\r\n\tpublic void anularFact() {\n\t\t\r\n\t}","@Override\n public void func_104112_b() {\n \n }","@Override\n protected void initialize() {\n }","@Override\n protected void initialize() {\n }","@Override\n protected void initialize() {\n }","@Override\n protected void initialize() {\n }","@Override\n protected void initialize() {\n }","@Override\n protected void initialize() {\n }","@Override\r\n\tpublic void dibujar() {\n\t\t\r\n\t}","@Override\r\n\tpublic void dibujar() {\n\t\t\r\n\t}","@Override\n\tpublic void one() {\n\t\t\n\t}","private Rekenhulp()\n\t{\n\t}","@Override\n\tpublic void jugar() {\n\t\t\n\t}","@Override\n protected void initialize() {\n\n \n }","public void mo4359a() {\n }","@Override\n\tpublic void einkaufen() {\n\t}","private void m50366E() {\n }","@Override\n public void init() {\n }","@Override\n\tpublic void debite() {\n\t\t\n\t}","@Override\n\tprotected void initialize() {\n\n\t}","protected boolean func_70814_o() { return true; }","@Override\n public void init() {}","@Override\r\n\tprotected void doF4() {\n\t\t\r\n\t}","@Override\n\tpublic void nghe() {\n\n\t}","@Override public int describeContents() { return 0; }","@Override\r\n\tprotected void initialize() {\r\n\t\t\r\n\t\t\r\n\t}","@Override\n void init() {\n }","@Override\n protected void initialize() \n {\n \n }","@Override\r\n\tpublic void init() {}","private static void cajas() {\n\t\t\n\t}","@Override\n protected void getExras() {\n }","@Override\n protected void init() {\n }","protected MetadataUGWD() {/* intentionally empty block */}","@Override\n\tpublic int mettreAJour() {\n\t\treturn 0;\n\t}","@Override\r\n\tpublic void publierEnchere() {\n\t\t\r\n\t}","@Override\n public int getOrder() {\n return 0;\n }","@Override\n\tpublic void init() {\n\n\t}","@Override\n\tpublic void init() {\n\n\t}","@Override\n\tpublic void init() {\n\n\t}","@Override\r\n\tpublic void init() {\n\t\t\r\n\t}","@Override\r\n\tpublic void init() {\n\t\t\r\n\t}","@Override\r\n\tpublic void init() {\n\t\t\r\n\t}","@Override\n public void memoria() {\n \n }","@Override\r\n\tpublic void init() {\n\r\n\t}","@Override\r\n\tpublic void init() {\n\r\n\t}","@Override\r\n\tpublic void init() {\n\r\n\t}","@Override\r\n\t\t\tpublic void ayuda() {\n\r\n\t\t\t}","@Override\n public void init() {\n\n }","@Override\n public void init() {\n\n }","public void mo55254a() {\n }","public void mo55254a() {\n }","public void mo55254a() {\n }","public void mo55254a() {\n }","public void mo55254a() {\n }","public void mo55254a() {\n }","public void mo55254a() {\n }","@Override\n\tprotected void initialize() {\n\t}","@Override\n\tprotected void initialize() {\n\t}","@Override\n public int getSize() {\n return 1;\n }","@Override\r\n\tpublic void init()\r\n\t{\n\t}","@Override\n public int getOrder() {\n return 4;\n }","@Override\n public void initialize() { \n }","@Override\n\tpublic void init() {\n\t}","@Override\r\n\tprotected void initialize() {\n\r\n\t}","Petunia() {\r\n\t\t}","Constructor() {\r\n\t\t \r\n\t }","@Override\n\tpublic void init()\n\t{\n\n\t}","private TMCourse() {\n\t}"],"string":"[\n \"@Override\\n public void perish() {\\n \\n }\",\n \"@Override\\n\\tpublic void grabar() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tpublic void comer() {\\n\\t\\t\\n\\t}\",\n \"private stendhal() {\\n\\t}\",\n \"public final void mo51373a() {\\n }\",\n \"@Override\\r\\n\\tpublic void comer() \\r\\n\\t{\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tpublic void bicar() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tpublic void bicar() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tpublic void tires() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\n\\tpublic void entrenar() {\\n\\t\\t\\n\\t}\",\n \"@Override\\r\\n\\tpublic void dormir() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\n\\tpublic void nadar() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n public int describeContents() { return 0; }\",\n \"public void gored() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tprotected void getExras() {\\n\\n\\t}\",\n \"@Override\\n\\tpublic void anular() {\\n\\n\\t}\",\n \"@Override\\n\\tprotected void interr() {\\n\\t}\",\n \"@Override\\n\\tpublic void sacrifier() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tpublic void gravarBd() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tpublic void ligar() {\\n\\t\\t\\n\\t}\",\n \"@Override\\r\\n\\tpublic void rozmnozovat() {\\n\\t}\",\n \"public void mo38117a() {\\n }\",\n \"@Override\\n\\tprotected void initialize() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tprotected void initialize() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n public void init() {\\n\\n }\",\n \"@Override\\r\\n\\t\\t\\tpublic void annadir() {\\n\\r\\n\\t\\t\\t}\",\n \"@Override\\r\\n\\t\\tpublic void init() {\\n\\t\\t\\t\\r\\n\\t\\t}\",\n \"private void poetries() {\\n\\n\\t}\",\n \"@Override\\r\\n\\tpublic void anularFact() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\n public void func_104112_b() {\\n \\n }\",\n \"@Override\\n protected void initialize() {\\n }\",\n \"@Override\\n protected void initialize() {\\n }\",\n \"@Override\\n protected void initialize() {\\n }\",\n \"@Override\\n protected void initialize() {\\n }\",\n \"@Override\\n protected void initialize() {\\n }\",\n \"@Override\\n protected void initialize() {\\n }\",\n \"@Override\\r\\n\\tpublic void dibujar() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tpublic void dibujar() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\n\\tpublic void one() {\\n\\t\\t\\n\\t}\",\n \"private Rekenhulp()\\n\\t{\\n\\t}\",\n \"@Override\\n\\tpublic void jugar() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n protected void initialize() {\\n\\n \\n }\",\n \"public void mo4359a() {\\n }\",\n \"@Override\\n\\tpublic void einkaufen() {\\n\\t}\",\n \"private void m50366E() {\\n }\",\n \"@Override\\n public void init() {\\n }\",\n \"@Override\\n\\tpublic void debite() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tprotected void initialize() {\\n\\n\\t}\",\n \"protected boolean func_70814_o() { return true; }\",\n \"@Override\\n public void init() {}\",\n \"@Override\\r\\n\\tprotected void doF4() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\n\\tpublic void nghe() {\\n\\n\\t}\",\n \"@Override public int describeContents() { return 0; }\",\n \"@Override\\r\\n\\tprotected void initialize() {\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\n void init() {\\n }\",\n \"@Override\\n protected void initialize() \\n {\\n \\n }\",\n \"@Override\\r\\n\\tpublic void init() {}\",\n \"private static void cajas() {\\n\\t\\t\\n\\t}\",\n \"@Override\\n protected void getExras() {\\n }\",\n \"@Override\\n protected void init() {\\n }\",\n \"protected MetadataUGWD() {/* intentionally empty block */}\",\n \"@Override\\n\\tpublic int mettreAJour() {\\n\\t\\treturn 0;\\n\\t}\",\n \"@Override\\r\\n\\tpublic void publierEnchere() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\n public int getOrder() {\\n return 0;\\n }\",\n \"@Override\\n\\tpublic void init() {\\n\\n\\t}\",\n \"@Override\\n\\tpublic void init() {\\n\\n\\t}\",\n \"@Override\\n\\tpublic void init() {\\n\\n\\t}\",\n \"@Override\\r\\n\\tpublic void init() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tpublic void init() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tpublic void init() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\n public void memoria() {\\n \\n }\",\n \"@Override\\r\\n\\tpublic void init() {\\n\\r\\n\\t}\",\n \"@Override\\r\\n\\tpublic void init() {\\n\\r\\n\\t}\",\n \"@Override\\r\\n\\tpublic void init() {\\n\\r\\n\\t}\",\n \"@Override\\r\\n\\t\\t\\tpublic void ayuda() {\\n\\r\\n\\t\\t\\t}\",\n \"@Override\\n public void init() {\\n\\n }\",\n \"@Override\\n public void init() {\\n\\n }\",\n \"public void mo55254a() {\\n }\",\n \"public void mo55254a() {\\n }\",\n \"public void mo55254a() {\\n }\",\n \"public void mo55254a() {\\n }\",\n \"public void mo55254a() {\\n }\",\n \"public void mo55254a() {\\n }\",\n \"public void mo55254a() {\\n }\",\n \"@Override\\n\\tprotected void initialize() {\\n\\t}\",\n \"@Override\\n\\tprotected void initialize() {\\n\\t}\",\n \"@Override\\n public int getSize() {\\n return 1;\\n }\",\n \"@Override\\r\\n\\tpublic void init()\\r\\n\\t{\\n\\t}\",\n \"@Override\\n public int getOrder() {\\n return 4;\\n }\",\n \"@Override\\n public void initialize() { \\n }\",\n \"@Override\\n\\tpublic void init() {\\n\\t}\",\n \"@Override\\r\\n\\tprotected void initialize() {\\n\\r\\n\\t}\",\n \"Petunia() {\\r\\n\\t\\t}\",\n \"Constructor() {\\r\\n\\t\\t \\r\\n\\t }\",\n \"@Override\\n\\tpublic void init()\\n\\t{\\n\\n\\t}\",\n \"private TMCourse() {\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.60571116","0.6012129","0.59049565","0.58367926","0.58117336","0.57942146","0.57780886","0.57780886","0.57749665","0.5743262","0.5688063","0.5628502","0.5624226","0.56157595","0.55905956","0.5589926","0.5585916","0.5560103","0.5544365","0.5535738","0.5528637","0.55191684","0.55076665","0.55076665","0.550035","0.550035","0.550035","0.550035","0.550035","0.5498052","0.54837674","0.5483236","0.54812634","0.5475228","0.5463963","0.54618615","0.54618615","0.54618615","0.54618615","0.54618615","0.54618615","0.54607546","0.54607546","0.54605293","0.5452121","0.5448632","0.5438972","0.54376584","0.5428451","0.54254264","0.54191715","0.54111433","0.54085004","0.5406602","0.53947973","0.53865296","0.5384798","0.5380517","0.53744256","0.5371086","0.53686184","0.536737","0.53613603","0.5359872","0.5357869","0.5349262","0.5344098","0.534282","0.5337908","0.53352636","0.53352636","0.53352636","0.5330325","0.5330325","0.5330325","0.53297865","0.5313178","0.5313178","0.5313178","0.53127","0.53109735","0.53109735","0.5310777","0.5310777","0.5310777","0.5310777","0.5310777","0.5310777","0.5310777","0.5302257","0.5302257","0.529833","0.52971154","0.5296888","0.52913606","0.5282039","0.5271197","0.526911","0.5268466","0.5259177","0.5255089"],"string":"[\n \"0.60571116\",\n \"0.6012129\",\n \"0.59049565\",\n \"0.58367926\",\n \"0.58117336\",\n \"0.57942146\",\n \"0.57780886\",\n \"0.57780886\",\n \"0.57749665\",\n \"0.5743262\",\n \"0.5688063\",\n \"0.5628502\",\n \"0.5624226\",\n \"0.56157595\",\n \"0.55905956\",\n \"0.5589926\",\n \"0.5585916\",\n \"0.5560103\",\n \"0.5544365\",\n \"0.5535738\",\n \"0.5528637\",\n \"0.55191684\",\n \"0.55076665\",\n \"0.55076665\",\n \"0.550035\",\n \"0.550035\",\n \"0.550035\",\n \"0.550035\",\n \"0.550035\",\n \"0.5498052\",\n \"0.54837674\",\n \"0.5483236\",\n \"0.54812634\",\n \"0.5475228\",\n \"0.5463963\",\n \"0.54618615\",\n \"0.54618615\",\n \"0.54618615\",\n \"0.54618615\",\n \"0.54618615\",\n \"0.54618615\",\n \"0.54607546\",\n \"0.54607546\",\n \"0.54605293\",\n \"0.5452121\",\n \"0.5448632\",\n \"0.5438972\",\n \"0.54376584\",\n \"0.5428451\",\n \"0.54254264\",\n \"0.54191715\",\n \"0.54111433\",\n \"0.54085004\",\n \"0.5406602\",\n \"0.53947973\",\n \"0.53865296\",\n \"0.5384798\",\n \"0.5380517\",\n \"0.53744256\",\n \"0.5371086\",\n \"0.53686184\",\n \"0.536737\",\n \"0.53613603\",\n \"0.5359872\",\n \"0.5357869\",\n \"0.5349262\",\n \"0.5344098\",\n \"0.534282\",\n \"0.5337908\",\n \"0.53352636\",\n \"0.53352636\",\n \"0.53352636\",\n \"0.5330325\",\n \"0.5330325\",\n \"0.5330325\",\n \"0.53297865\",\n \"0.5313178\",\n \"0.5313178\",\n \"0.5313178\",\n \"0.53127\",\n \"0.53109735\",\n \"0.53109735\",\n \"0.5310777\",\n \"0.5310777\",\n \"0.5310777\",\n \"0.5310777\",\n \"0.5310777\",\n \"0.5310777\",\n \"0.5310777\",\n \"0.5302257\",\n \"0.5302257\",\n \"0.529833\",\n \"0.52971154\",\n \"0.5296888\",\n \"0.52913606\",\n \"0.5282039\",\n \"0.5271197\",\n \"0.526911\",\n \"0.5268466\",\n \"0.5259177\",\n \"0.5255089\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":27399,"cells":{"query":{"kind":"string","value":"creates a new wizard"},"document":{"kind":"string","value":"public NewReviewWizard() {\n super();\n setNeedsProgressMonitor(true);\n setWindowTitle(\"New Review\");\n setHelpAvailable(false);\n }"},"metadata":{"kind":"string","value":"{\n \"objective\": {\n \"self\": [],\n \"paired\": [],\n \"triplet\": [\n [\n \"query\",\n \"document\",\n \"negatives\"\n ]\n ]\n }\n}"},"negatives":{"kind":"list like","value":["protected abstract AbstractPerfCakeEditWizard createWizard(IStructuredSelection selection);","static public Wizard createWizard (){\n System.out.println(\"Enter the name of your wizard : \");\n Scanner sc = new Scanner(System.in);\n String nameCharacter = sc.next();\n\n // enter and get the HP value of the character\n System.out.println(\"Enter the healpoint of your wizard : \");\n Scanner scan = new Scanner(System.in);\n String healPointCharacter = scan.next();\n int hpCharacter = Integer.parseInt(healPointCharacter);\n\n // get the power value\n System.out.println(\"Enter the power of your wizard : \");\n Scanner sca = new Scanner(System.in);\n String powerCharacter = sca.next();\n int pcCharacter = Integer.parseInt(powerCharacter);\n\n\n // get the initiative (turn order)\n System.out.println(\"Enter the initiative of your wizard : \");\n Scanner scann = new Scanner(System.in);\n String initiativeCharacter = scann.next();\n int iniCharacter = Integer.parseInt(initiativeCharacter);\n\n System.out.println(\"Enter the wizard damage value of your wizard : \");\n Scanner scanS = new Scanner(System.in);\n String wizardDamage = scann.next();\n int wiz = Integer.parseInt(wizardDamage);\n\n Wizard createWizard = new Wizard(nameCharacter, pcCharacter, hpCharacter, iniCharacter, wiz);\n System.out.println(\"Your wizard has been created with success!\");\n\n return createWizard;\n }","public void testWizards() {\n // open new file wizard\n NewFileWizardOperator nfwo = NewFileWizardOperator.invoke();\n nfwo.selectProject(\"SampleProject\");\n nfwo.selectCategory(\"Java\");\n nfwo.selectFileType(\"Java Class\");\n // go to next page\n nfwo.next();\n // create operator for the next page\n NewJavaFileNameLocationStepOperator nfnlso = new NewJavaFileNameLocationStepOperator();\n nfnlso.txtObjectName().typeText(\"MyNewClass\");\n // finish wizard\n //nfnlso.finish();\n // cancel wizard\n nfnlso.cancel();\n }","@Override\n\tpublic void create(IWizardEntity entity, WizardRunner runner) {\n\t\t\n\t}","private void createWizard(String persoName, String persoImage, int persoLife, int attack) {\n\t\tpersoList.add(new Wizard(persoName, persoImage, persoLife, attack));\n\t}","public void addPages() {\n\t\t\n\t\tProjectUtils projectUtils = new ProjectUtils();\n\t\tIProject proj = projectUtils.getProject(selection);\n\t\t\n\t\t\n\t\t\n\t\tDb db = loadDBParams();\n\t\tDBConnection dbConn = new DBConnection();\n\t\tConnection connection = null;\n\t\t\n\t\t\n\t\ttry {\n\t\t\tconnection = dbConn.loadDriver(proj.getLocation()+\"/\"+db.getDriverClassPath(), db.getDriverClass(), db.getDatabaseURL(), db.getUserName(), db.getPassWord());\n\t\t} catch (MalformedURLException e) {\n\t\t\te.printStackTrace();\n\t\t} catch (InstantiationException e) {\n\t\t\te.printStackTrace();\n\t\t} catch (IllegalAccessException e) {\n\t\t\te.printStackTrace();\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\t\n\t\t\n\t\tpage = new SmartNewWizardPage(selection, connection, proj.getLocation().toString());\n\t\taddPage(page);\n\n\t}","public IWizard getWizard();","public void testGenericWizards() {\n // open new project wizard\n NewProjectWizardOperator npwo = NewProjectWizardOperator.invoke();\n npwo.selectCategory(\"Java Web\");\n npwo.selectProject(\"Web Application\");\n npwo.next();\n // create operator for next page\n WizardOperator wo = new WizardOperator(\"Web Application\");\n JTextFieldOperator txtName = new JTextFieldOperator((JTextField) new JLabelOperator(wo, \"Project Name:\").getLabelFor());\n txtName.clearText();\n txtName.typeText(\"MyApp\");\n wo.cancel();\n }","public void addPages() {\n\t\twizardPage = new WizardNewProjectCreationPage(\n\t\t\"NewExampleComSiteProject\");\n\t\twizardPage.setDescription(\"Create a new Example.com Site Project.\");\n\t\twizardPage.setTitle(\"New Example.com Site Project\");\n\t\taddPage(wizardPage);\n\t}","public void setWizard(IWizard newWizard);","public NewPageWizard(IXWikiSpace sapce)\n {\n super();\n setWindowTitle(\"Add New Page...\");\n setNeedsProgressMonitor(false);\n this.space = sapce;\n }","@Override\r\n\tpublic void addPages() {\n\t\tprojectPage = new NewProjectWizardPage();\r\n\t\taddPage(projectPage);\r\n\t}","protected IFlowControl createWizard( InputStream in ){\r\n\t\tXMLWizardBuilder<T> builder = new XMLWizardBuilder<T>( in );\r\n\t\ttry{\r\n\t\t\tbuilder.build( this);\r\n\t\t}\r\n\t\tcatch( Exception ex ){\r\n\t\t\tex.printStackTrace();\r\n\t\t\treturn null;\r\n\t\t}\r\n\t\tflow = new FlowControl(); \r\n\t\tsuper.setFlow(flow);\r\n\t\treturn flow;\r\n\t}","public NewTestWizardPage() {\n\t\tsuper(true, \"New Groovy Test Settings\");\n\n\t\tsetTitle(\"Groovy Test Class\");\n\t\tsetDescription(\"Create a new Groovy unit test class\");\n\t}","public void addPages() {\n //super.addPages(); //<--- notice we're overriding here\n mainPage = new NewTargetWizardPage(\"newFilePage1\", getSelection());//$NON-NLS-1$\n mainPage.setTitle(TITLE);\n mainPage.setDescription(DESCRIPTION); \n addPage(mainPage);\n }","public NewTargetFileWizard() {\n super();\n }","public void addPages() {\n\t\tpage = new NewTotoriWizardPage(selection);\n\t\taddPage(page);\n\t}","public void testRegisterWizardPanel() {\n System.out.println(\"registerWizardPanel\");\n Object id = null;\n WizardPanelDescriptor panel = null;\n Wizard instance = new Wizard();\n instance.registerWizardPanel(id, panel);\n }","public WizardModel(){ \n wp = new HashMap<Object,WizardPanelDescriptor>();\n step = 1;\n }","public AddValidatorWizard() {\n super();\n initPages();\n setWindowTitle(Messages.title_newValidator);\n }","Page createPage();","public AbstractWizardPage()\n {\n super(true);\n }","public NewEntryWizard()\n {\n setNeedsProgressMonitor( true );\n }","@Override\n\tpublic void addPages() {\n\t\t_fileWizard = new NewPlotFilenameWizardPage(selection);\n\t\t_scaleWizard = new ScaleWizardPage(selection);\n\t\t_coastWizard = new CoastWizardPage(selection);\n\t\t_gridWizard = new GridWizardPage(selection);\n\n\t\t// check there's ETOPO data before we add the page\n\t\t_etopoWizard = new ETOPOWizardPage(selection);\n\n\t\taddPage(_fileWizard);\n\t\taddPage(_scaleWizard);\n\t\taddPage(_coastWizard);\n\t\taddPage(_gridWizard);\n\t\tif (_etopoWizard.isAvailable())\n\t\t\taddPage(_etopoWizard);\n\t}","public CartogramWizard ()\n\t{\n\t\n\t\t// Set the window parameters.\n\t\tthis.setTitle(AppContext.shortProgramName + \" _ Cartogram Wizard\");\n\t\tthis.setSize(640, 480);\n\t\tthis.setLocation(30, 40);\n\t\tthis.setResizable(false);\n\t\tthis.setLayout(null);\n\t\t//this.setModal(true);\n\t\tthis.setDefaultCloseOperation(DO_NOTHING_ON_CLOSE);\n\t\tthis.addWindowListener(new CartogramWizardWindowListener());\n\t\t\n\t\t\n\t\t// Adding the cartogram wizard to the app context.\n\t\tAppContext.cartogramWizard = this;\n\t\t\n\t\t\n\t\t// Add icon panel at the left of the wizard window.\n\t\t// This panel contains the ScapeToad icon.\n\t\tif (mScapeToadIconPanel == null)\n\t\t{\n\t\t\tmScapeToadIconPanel = new ScapeToadIconPanel(this);\n\t\t}\n\t\t\n\t\tmScapeToadIconPanel.setLocation(30, 90);\n\t\tthis.add(mScapeToadIconPanel);\n\t\t\n\t\t\n\t\t\n\t\t// Add title panel.\n\t\tCartogramWizardTitlePanel titlePanel =\n\t\t\tnew CartogramWizardTitlePanel(this);\n\t\t\n\t\ttitlePanel.setLocation(30, 20);\n\t\tthis.add(titlePanel);\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t// Add icon panel at the left of the wizard window.\n\t\t// This panel contains the ScapeToad icon.\n\t\tmWizardStepIconPanel = new WizardStepIconPanel(this);\n\t\tmWizardStepIconPanel.setLocation(380, 20);\n\t\tthis.add(mWizardStepIconPanel);\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t// Ajouter l'introduction au wizard.\n\t\t// Explication des étapes à suivre :\n\t\t// 1. Sélectionner la couche des polygones (master layer).\n\t\t// 2. Sélectionner l'information statistique.\n\t\t// 3. Sélection des couches à transformer simultanément.\n\t\t\n\t\tmPanelZero = new CartogramWizardPanelZero(this);\n\t\tthis.getContentPane().add(mPanelZero);\n\t\t\n\t\tmCurrentStep = 0;\n\t\t\n\t\t\n\t\t\n\t\t// Add the running panel which is already created.\n\t\tmRunningPanel.setVisible(false);\n\t\tthis.add(mRunningPanel);\n\t\t\n\t\t\n\t\t// Add the finished panel which is already created.\n\t\tmFinishedPanel.setVisible(false);\n\t\tthis.add(mFinishedPanel);\n\t\t\n\t\t\t\t\n\t\t// Add the Cancel button.\n\t\tmCancelButton = new JButton(\"Cancel\");\n\t\tmCancelButton.setLocation(30, 404);\n\t\tmCancelButton.setSize(100, 26);\n\t\tmCancelButton.addActionListener(new CartogramWizardCloseAction());\n\t\tthis.getContentPane().add(mCancelButton);\n\t\t\n\t\t\n\t}","@Override\n public void addPages() {\n super.addPages();\n page1 = new NewReviewWizardPage();\n addPage(page1);\n }","@Override\r\n\t\tpublic void create() {\n\t\t\tsuper.create();\r\n\t\t\tsuper.getOKButton().setEnabled(false);\r\n\t\t\tsuper.setTitle(Messages.MoveUnitsWizardPage1_Topolog__2);\r\n\t\t\tsuper.setMessage(Messages.MoveUnitsWizardPage1_Select_a_name_source_folder_and_a_);\r\n\t\t\tsuper.getShell().setText(Messages.MoveUnitsWizardPage1_Topolog__2);\r\n\t\t}","public Reqif10ModelWizardInitialObjectCreationPage(String pageId) {\r\n \t\t\tsuper(pageId);\r\n \t\t}","private Wizard(final FXFinder javafxFinder) {\n this.javafxFinder = javafxFinder;\n wizard = new JFrame(\"Apache SIS setup\");\n final Container content = wizard.getContentPane();\n content.setLayout(new BorderLayout());\n /*\n * Back, Next, Cancel button.\n */\n { // For keeping variables in a local scope.\n final Box buttons = Box.createHorizontalBox();\n buttons.setBorder(new EmptyBorder(9, 12, 9, 15)); // Top, left, bottom, right.\n backButton = createButton(buttons, BACK); buttons.add(Box.createHorizontalStrut(10));\n nextButton = createButton(buttons, NEXT); buttons.add(Box.createHorizontalStrut(30));\n cancelButton = createButton(buttons, CANCEL);\n backButton.setEnabled(false);\n\n final JPanel bottom = new JPanel(new BorderLayout());\n bottom.add(new JSeparator(), BorderLayout.NORTH);\n bottom.add(buttons, java.awt.BorderLayout.EAST);\n content.add(bottom, BorderLayout.SOUTH);\n }\n /*\n * Navigation panel on the left side with the following titles\n * (currently shown page is highlighted):\n *\n * - Introduction\n * - Download\n * - Set directory\n * - Summary\n */\n final WizardPage[] pages = WizardPage.values();\n {\n titles = new JLabel[pages.length];\n final EmptyBorder padding = new EmptyBorder(3, 0, 3, 0);\n final Box summary = Box.createVerticalBox();\n for (int i=0; i<pages.length; i++) {\n final String title = (i == 0 ? SELECTED_TITLE_BULLET : TITLE_BULLET) + pages[i].title;\n final JLabel label = new JLabel(title, JLabel.LEFT);\n label.setForeground(i == 0 ? SELECTED_TITLE_COLOR : TITLE_COLOR);\n label.setBorder(padding);\n summary.add(titles[i] = label);\n }\n final JPanel pane = new JPanel();\n pane.setBackground(new Color(169, 204, 227));\n pane.setBorder(new EmptyBorder(40, 15, 9, 24)); // Top, left, bottom, right.\n pane.add(summary);\n content.add(pane, BorderLayout.WEST);\n }\n /*\n * The main content where text is shown, together with download button, directory chooser, etc.\n * The content of each page is created by `createPage(…)`. They all have in common to start with\n * a description text formatted in HTML.\n */\n {\n final Font font = new Font(Font.SERIF, Font.PLAIN, 14);\n javafxPath = new JLabel();\n javafxPath.setBorder(JAVAFX_PATH_BORDER);\n javafxPathError = new JLabel();\n javafxPathError.setForeground(Color.RED);\n javafxPathError.setFont(font);\n inflateProgress = new JProgressBar();\n cardPanel = new JPanel(new CardLayout());\n cardPanel.setBorder(new EmptyBorder(30, 30, 9, 30)); // Top, left, bottom, right.\n cardPanel.setBackground(Color.WHITE);\n for (final WizardPage page : pages) {\n cardPanel.add(createPage(page, font), page.name());\n // The initially visible component is the first added.\n }\n currentPage = pages[0];\n content.add(cardPanel, BorderLayout.CENTER);\n }\n wizard.setSize(WIDTH, 500); // Must be before `setLocationRelativeTo(…)`.\n wizard.setResizable(false);\n wizard.setLocationRelativeTo(null);\n wizard.addWindowListener(new WindowAdapter() {\n @Override public void windowClosing(WindowEvent event) {\n javafxFinder.cancel();\n }\n });\n }","public void addPages() {\t\t\n\t\tpage1 = new Opera2ActionsTransformationWizardPage1(selection, operaModel);\n\t\taddPage(page1);\t\n\t}","@Override\n\tpublic void createControl(Composite parent) {\n\t\tComposite container = new Composite(parent, SWT.NULL);\n\n\t\tsetControl(container);\n\n\t\tString username = \"\";\n\t\tString password = \"\";\n\t\ttry {\n\t\t\tString[] array = window.ds.getURI().getUserInfo().split(\":\");\n\t\t\tusername = array[0];\n\t\t\tpassword = array[1];\n\t\t} catch (Exception e) {\n\t\t}\n\n\t\tLabel lblUsername = new Label(container, SWT.NONE);\n\t\tlblUsername.setBounds(10, 52, 75, 13);\n\t\tlblUsername.setText(\"Username\");\n\n\t\tusernameText = new Text(container, SWT.BORDER);\n\t\tusernameText.setText(username);\n\t\tusernameText.addModifyListener(new ModifyListener() {\n\t\t\t@Override\n\t\t\tpublic void modifyText(ModifyEvent arg0) {\n\t\t\t\tgetWizard().getContainer().updateButtons();\n\t\t\t}\n\t\t});\n\n\t\tusernameText.setBounds(10, 71, 187, 19);\n\t\tusernameText.setFocus();\n\n\t\tLabel lblPassword = new Label(container, SWT.NONE);\n\t\tlblPassword.setBounds(10, 96, 75, 13);\n\t\tlblPassword.setText(\"Password\");\n\n\t\tpasswordText = new Text(container, SWT.BORDER | SWT.PASSWORD);\n\t\tpasswordText.setText(password);\n\t\tpasswordText.addModifyListener(new ModifyListener() {\n\t\t\t@Override\n\t\t\tpublic void modifyText(ModifyEvent arg0) {\n\t\t\t\tgetWizard().getContainer().updateButtons();\n\t\t\t}\n\t\t});\n\n\t\tpasswordText.setBounds(10, 115, 187, 19);\n\t\tControl[] list = null;\n\t\t\n\t\tif (window.ds.usesComponent(IUserCreation.class)) {\n\t\t\tbtnCreateAnNew = new Button(container, SWT.NONE);\n\t\t\tbtnCreateAnNew.addSelectionListener(new SelectionAdapter() {\n\t\t\t\t@Override\n\t\t\t\tpublic void widgetSelected(SelectionEvent e) {\n\t\t\t\t\tLOG.info(\"Create an account\");\n\t\t\t\t\tSignInWithAuthenticationWizard wizard = (SignInWithAuthenticationWizard) getWizard();\n\t\t\t\t\twizard.getWizardDialog().close();\n\t\t\t\t\twindow.newUserAction.run();\n\t\t\t\t\tLOG.info(\"Create an account 2\");\n\t\t\t\t}\n\t\t\t});\n\t\t\tbtnCreateAnNew.setBounds(10, 10, 152, 25);\n\t\t\tbtnCreateAnNew.setText(\"Create a new account\");\n\t\t\tlist = new Control[] { btnCreateAnNew, usernameText,\n\t\t\t\t\tpasswordText };\n\t\t\tcontainer.setTabList(list);\n\t\t} else {\n\t\t\tlist = new Control[] { usernameText,\n\t\t\t\t\tpasswordText };\n\t\t\tcontainer.setTabList(list);\n\t\t}\n\n\t\t\n\t\t\n\t}","public void createProbleemWizard() throws InstantiationException,\n\t\t\tIllegalAccessException {\n\n\t\tif (getMelding().getProbleem() != null) {\n\t\t\tmodelRepository.evictObject(getMelding().getProbleem());\n\t\t}\n\t\tprobleem = null;\n\t\tif (\"bord\".equals(probleemType)) {\n\n\t\t\tif (trajectType.endsWith(\"Route\")) {\n\t\t\t\tprobleem = (Probleem) modelRepository.createObject(\n\t\t\t\t\t\t\"RouteBordProbleem\", null);\n\n\t\t\t} else if (trajectType.contains(\"Netwerk\")) {\n\t\t\t\tprobleem = (Probleem) modelRepository.createObject(\n\t\t\t\t\t\t\"NetwerkBordProbleem\", null);\n\n\t\t\t}\n\n\t\t} else if (\"ander\".equals(probleemType)) {\n\n\t\t\tif (trajectType.endsWith(\"Route\")) {\n\t\t\t\tprobleem = (Probleem) modelRepository.createObject(\n\t\t\t\t\t\t\"RouteAnderProbleem\", null);\n\n\t\t\t} else if (trajectType.contains(\"Netwerk\")) {\n\t\t\t\tprobleem = (Probleem) modelRepository.createObject(\n\t\t\t\t\t\t\"NetwerkAnderProbleem\", null);\n\t\t\t}\n\t\t}\n\t\tgetMelding().setProbleem(probleem);\n\t}","public TutorialStep1() {\n\n }","private void convert(IProject project, AcceleoProjectWizard wizard, IProgressMonitor monitor) {\n \t\tString projectName = wizard.newProjectPage.getProjectName();\n \t\tString generatorName = this.computeGeneratorName(projectName);\n \n \t\tAcceleoProject acceleoProject = AcceleowizardmodelFactory.eINSTANCE.createAcceleoProject();\n \t\tacceleoProject.setName(projectName);\n \t\tacceleoProject.setGeneratorName(generatorName);\n \n \t\tList<AcceleoModule> allModules = this.newAcceleoModulesCreationPage.getAllModules();\n \t\tfor (AcceleoModule acceleoModule : allModules) {\n \t\t\tString parentFolder = acceleoModule.getParentFolder();\n \n \t\t\tIProject moduleProject = ResourcesPlugin.getWorkspace().getRoot().getProject(\n \t\t\t\t\tacceleoModule.getProjectName());\n \t\t\tif (moduleProject.exists() && moduleProject.isAccessible()\n \t\t\t\t\t&& acceleoModule.getModuleElement() != null\n \t\t\t\t\t&& acceleoModule.getModuleElement().isIsMain()) {\n \t\t\t\tIPath parentFolderPath = new Path(parentFolder);\n \t\t\t\tIFolder folder = moduleProject.getFolder(parentFolderPath.removeFirstSegments(1));\n \t\t\t\tacceleoProject.getExportedPackages().add(\n \t\t\t\t\t\tfolder.getProjectRelativePath().removeFirstSegments(1).toString().replaceAll(\"/\", //$NON-NLS-1$\n \t\t\t\t\t\t\t\t\"\\\\.\")); //$NON-NLS-1$\n \t\t\t}\n \t\t}\n \t\t// Prepare Ant folder\n \t\tIFolder antTasksFolder = project.getFolder(\"tasks\"); //$NON-NLS-1$\n \t\tif (!antTasksFolder.exists()) {\n \t\t\ttry {\n \t\t\t\tantTasksFolder.create(true, false, monitor);\n \t\t\t} catch (CoreException e) {\n \t\t\t\tAcceleoUIActivator.log(e, true);\n \t\t\t}\n \t\t}\n \n \t\t// Generate files\n \t\ttry {\n \t\t\tIProjectDescription description = project.getDescription();\n \t\t\tString[] natureIds = new String[] {IAcceleoConstants.ACCELEO_NATURE_ID,\n \t\t\t\t\tIAcceleoConstants.PLUGIN_NATURE_ID, IAcceleoConstants.JAVA_NATURE_ID, };\n \t\t\tdescription.setNatureIds(natureIds);\n \t\t\tproject.setDescription(description, monitor);\n \t\t} catch (CoreException e) {\n \t\t\tAcceleoUIActivator.log(e, true);\n \t\t}\n \t\tmonitor.beginTask(AcceleoUIMessages.getString(\"AcceleoNewProjectWizard.Monitor\"), 100); //$NON-NLS-1$\n \t\tmonitor.worked(10);\n \t\tAcceleoUIGenerator.getDefault().generateProjectSettings(acceleoProject, project);\n \t\tmonitor.worked(10);\n \t\tAcceleoUIGenerator.getDefault().generateProjectClasspath(acceleoProject, project);\n \t\tmonitor.worked(10);\n \t\tAcceleoUIGenerator.getDefault().generateProjectManifest(acceleoProject, project);\n \t\tmonitor.worked(10);\n \t\tAcceleoUIGenerator.getDefault().generateBuildProperties(acceleoProject, project);\n \t\tmonitor.worked(10);\n \t\tAcceleoUIGenerator.getDefault().generateActivator(acceleoProject, project);\n \n \t\tfor (AcceleoModule acceleoModule : allModules) {\n \t\t\tmonitor.worked(10);\n \t\t\tString parentFolder = acceleoModule.getParentFolder();\n \n \t\t\tIProject moduleProject = ResourcesPlugin.getWorkspace().getRoot().getProject(\n \t\t\t\t\tacceleoModule.getProjectName());\n \t\t\tif (moduleProject.exists() && moduleProject.isAccessible()) {\n \t\t\t\tIPath parentFolderPath = new Path(parentFolder);\n \t\t\t\tIFolder folder = moduleProject.getFolder(parentFolderPath.removeFirstSegments(1));\n \t\t\t\tAcceleoUIGenerator.getDefault().generateAcceleoModule(acceleoModule, folder);\n \n \t\t\t\tif (acceleoModule.isIsInitialized()) {\n \t\t\t\t\tString initializationKind = acceleoModule.getInitializationKind();\n \t\t\t\t\tIAcceleoInitializationStrategy strategy = null;\n \t\t\t\t\tList<IAcceleoInitializationStrategy> initializationStrategy = AcceleoInitializationStrategyUtils\n \t\t\t\t\t\t\t.getInitializationStrategy();\n \t\t\t\t\tfor (IAcceleoInitializationStrategy iAcceleoInitializationStrategy : initializationStrategy) {\n \t\t\t\t\t\tif (iAcceleoInitializationStrategy.getDescription() != null\n \t\t\t\t\t\t\t\t&& iAcceleoInitializationStrategy.getDescription().equals(initializationKind)) {\n \t\t\t\t\t\t\tstrategy = iAcceleoInitializationStrategy;\n \t\t\t\t\t\t\tbreak;\n \t\t\t\t\t\t}\n \t\t\t\t\t}\n \n \t\t\t\t\tIFile file = folder.getFile(acceleoModule.getName()\n \t\t\t\t\t\t\t+ \".\" + IAcceleoConstants.MTL_FILE_EXTENSION); //$NON-NLS-1$\n \t\t\t\t\tIFile exampleFile = ResourcesPlugin.getWorkspace().getRoot().getFile(\n \t\t\t\t\t\t\tnew Path(acceleoModule.getInitializationPath()));\n \n \t\t\t\t\tString moduleElementKind = IAcceleoInitializationStrategy.TEMPLATE_KIND;\n \t\t\t\t\tif (acceleoModule.getModuleElement().getKind().equals(ModuleElementKind.QUERY)) {\n \t\t\t\t\t\tmoduleElementKind = IAcceleoInitializationStrategy.QUERY_KIND;\n \t\t\t\t\t}\n \n \t\t\t\t\tif (strategy != null && file.exists()) {\n \t\t\t\t\t\ttry {\n \t\t\t\t\t\t\tstrategy.configure(moduleElementKind, acceleoModule.getModuleElement()\n \t\t\t\t\t\t\t\t\t.isGenerateFile(), acceleoModule.getModuleElement().isIsMain(),\n \t\t\t\t\t\t\t\t\tacceleoModule.isGenerateDocumentation());\n \t\t\t\t\t\t\tString content = strategy.getContent(exampleFile, acceleoModule.getName(),\n \t\t\t\t\t\t\t\t\tacceleoModule.getMetamodelURIs(), acceleoModule.getModuleElement()\n \t\t\t\t\t\t\t\t\t\t\t.getParameterType());\n \t\t\t\t\t\t\tByteArrayInputStream javaStream = new ByteArrayInputStream(content\n \t\t\t\t\t\t\t\t\t.getBytes(\"UTF8\")); //$NON-NLS-1$\n \t\t\t\t\t\t\tfile.setContents(javaStream, true, false, new NullProgressMonitor());\n \t\t\t\t\t\t} catch (CoreException e) {\n \t\t\t\t\t\t\tAcceleoUIActivator.log(e, true);\n \t\t\t\t\t\t} catch (UnsupportedEncodingException e) {\n \t\t\t\t\t\t\tAcceleoUIActivator.log(e, true);\n \t\t\t\t\t\t}\n \t\t\t\t\t}\n \t\t\t\t}\n \t\t\t}\n \n \t\t}\n \n \t}","protected DummyWizardPage()\n {\n super( \"\" ); //$NON-NLS-1$\n setTitle( Messages.getString( \"NewEntryWizard.NoConnectonSelected\" ) ); //$NON-NLS-1$\n setDescription( Messages.getString( \"NewEntryWizard.NoConnectonSelectedDescription\" ) ); //$NON-NLS-1$\n setImageDescriptor( BrowserCommonActivator.getDefault().getImageDescriptor(\n BrowserCommonConstants.IMG_ENTRY_WIZARD ) );\n setPageComplete( true );\n }","public TableEditorWizard(Table table) {\t\n\t\tcreateDialog(table);\n\t}","public ButtonWizard(DialogueSystem system) {\n this.system = system;\n currentAction = new JLabel();\n currentJoint = new JLabel();\n }","public void clickCreate() {\n\t\tbtnCreate.click();\n\t}","private void addNewConnection() {\n\t\t IWizard wizard = new NewJmxConnectionWizard();\n\t\t WizardDialog dialog = new WizardDialog(PlatformUI.getWorkbench().getActiveWorkbenchWindow().getShell(), wizard);\n\t\t dialog.open();\n\t\t\n\t}","private void newProject()\n\t{\n\t\tnew FenetreCreationProjet();\n\t}","@Override\n\tpublic void create() {\n\t\tAssets.load();\n\t\t\n\t\t//creo pantallas y cargo por defecto menuPrincipal\n\t\tscreenJuego = new JuegoScreen(this);\n\t\tmenuPrincipal = new MenuPrincipal(this);\n\t\tsetScreen(menuPrincipal);\n\t}","public WizardsTest(String testName) {\n super(testName);\n }","public GuidedWizardPanel()\r\n\t{\t\r\n\t\tVerticalPanel panel = new VerticalPanel();\r\n\t\t\r\n\t\twizardPanel = new WizardPanel(panelList, groupLabels);\r\n\t\twizardPanel.addSaveListener(this);\r\n\t\tpanel.add(wizardPanel);\r\n\r\n\t\t// set up listener relationships\r\n\t\tsolvingForPanel.addSolvingForListener(powerPanel);\r\n\t\tsolvingForPanel.addSolvingForListener(perGroupSampleSizePanel);\r\n\t\tsolvingForPanel.addSolvingForListener(resultsPanel);\r\n\t\t// listeners for outcome measures\r\n\t\toutcomesPanel.addOutcomesListener(hypothesisIndependentPanel);\r\n\t\toutcomesPanel.addOutcomesListener(hypothesisRepeatedPanel);\r\n\t\toutcomesPanel.addOutcomesListener(meanDifferencesIndependentPanel);\r\n\t\toutcomesPanel.addOutcomesListener(meanDifferencesPanel);\r\n\t\toutcomesPanel.addOutcomesListener(variabilityIndependentPanel);\r\n\t\toutcomesPanel.addOutcomesListener(variabilityRepeatedPanel);\r\n\t\toutcomesPanel.addOutcomesListener(variabilityCovariateOutcomePanel);\r\n\t\t// listeners for predictor information\r\n\t\tcatPredictorsPanel.addPredictorsListener(relativeGroupSizePanel);\r\n\t\tcatPredictorsPanel.addPredictorsListener(hypothesisIndependentPanel);\r\n\t\tcatPredictorsPanel.addPredictorsListener(hypothesisRepeatedPanel);\r\n\t\tcatPredictorsPanel.addPredictorsListener(meanDifferencesIndependentPanel);\r\n\t\tcatPredictorsPanel.addPredictorsListener(meanDifferencesPanel);\r\n\t\t// listeners for relative group sizes\r\n\t\trelativeGroupSizePanel.addRelativeGroupSizeListener(hypothesisIndependentPanel);\r\n\t\trelativeGroupSizePanel.addRelativeGroupSizeListener(hypothesisRepeatedPanel);\r\n\t\t// listeners for baseline covariates\r\n\t\tcovariatePanel.addCovariateListener(meanDifferencesIndependentPanel);\r\n\t\tcovariatePanel.addCovariateListener(meanDifferencesPanel);\r\n\t\t// TODO: covariatePanel.addCovariateListener(meanDifferencesRepeatedPanel);\r\n\t\tcovariatePanel.addCovariateListener(hypothesisIndependentPanel);\r\n\t\tcovariatePanel.addCovariateListener(hypothesisRepeatedPanel);\r\n\t\tcovariatePanel.addCovariateListener(variabilityIndependentPanel);\r\n\t\t// TODO: covariatePanel.addCovariateListener(variabilityRepeatedPanel);\r\n\t\tcovariatePanel.addCovariateListener(variabilityCovariatePanel);\r\n\t\tcovariatePanel.addCovariateListener(variabilityCovariateOutcomePanel);\r\n\t\tcovariatePanel.addCovariateListener(optionsTestsPanel);\r\n\t\tcovariatePanel.addCovariateListener(optionsPowerMethodsPanel);\r\n\t\t// listeners for repeated measures \r\n\t\trepeatedMeasuresPanel.addRepeatedMeasuresListener(hypothesisIndependentPanel);\r\n\t\trepeatedMeasuresPanel.addRepeatedMeasuresListener(hypothesisRepeatedPanel);\r\n\t\t// listeners for hypotheses\r\n\t\thypothesisIndependentPanel.addHypothesisListener(meanDifferencesIndependentPanel);\r\n\t\thypothesisRepeatedPanel.addHypothesisListener(meanDifferencesRepeatedPanel);\r\n\t\t// group size listeners\r\n\t\trelativeGroupSizePanel.addRelativeGroupSizeListener(hypothesisIndependentPanel);\r\n\t\t// variability listeners\r\n\t\tvariabilityIndependentPanel.addVariabilityListener(variabilityCovariateOutcomePanel);\r\n\t\tvariabilityCovariatePanel.addVariabilityListener(variabilityCovariateOutcomePanel);\r\n\t\toptionsDisplayPanel.addChartOptionsListener(resultsPanel);\r\n\t\t// callbacks to fill in the power curve options screen\r\n\t\talphaPanel.addAlphaListener(optionsDisplayPanel);\r\n\t\toptionsTestsPanel.addTestListener(optionsDisplayPanel);\r\n\t\toptionsPowerMethodsPanel.addPowerMethodListener(optionsDisplayPanel);\r\n\t\toptionsPowerMethodsPanel.addQuantileListener(optionsDisplayPanel);\r\n\t\toptionsPowerMethodsPanel.addQuantileCheckboxListener(optionsDisplayPanel);\r\n\t\toptionsPowerMethodsPanel.addPowerCheckboxListener(optionsDisplayPanel);\r\n\t\tmeanDifferencesScalePanel.addBetaScaleListener(optionsDisplayPanel);\r\n\t\tperGroupSampleSizePanel.addPerGroupSampleSizeListener(optionsDisplayPanel);\r\n\t\trelativeGroupSizePanel.addRelativeGroupSizeListener(optionsDisplayPanel);\r\n\t\tvariabilityScalePanel.addSigmaScaleListener(optionsDisplayPanel);\r\n\t\t// initialize\r\n\t\tinitWidget(panel);\r\n\t}","private void challengeStartNew() {\n FragmentManager fm = getSupportFragmentManager();\n FragmentNewChallenge newChallenge = FragmentNewChallenge.newInstance(\"Titel\");\n newChallenge.show(fm, \"fragment_start_new_challenge\");\n }","public SelectProjectWizardPage build() {\r\n return new SelectProjectWizardPage(this);\r\n }","public String create() {\n\n if (log.isDebugEnabled()) {\n log.debug(\"create()\");\n }\n FacesContext context = FacesContext.getCurrentInstance();\n StringBuffer sb = registration(context);\n sb.append(\"?action=Create\");\n forward(context, sb.toString());\n return (null);\n\n }","public CreateAccount() {\n initComponents();\n selectionall();\n }","NewAccountPage openNewAccountPage();","public static AddNewScheduleDialog createInstance(int quantity){\n AddNewScheduleDialog frag = new AddNewScheduleDialog();\n frag.quantity = quantity;\n return frag;\n }","@Override\n public List<UpdatableItem> createPopup() {\n final List<UpdatableItem> items = new ArrayList<UpdatableItem>();\n \n /* host wizard */\n final MyMenuItem newHostWizardItem =\n new MyMenuItem(Tools.getString(\"EmptyBrowser.NewHostWizard\"),\n HOST_ICON,\n null,\n new AccessMode(ConfigData.AccessType.RO, false),\n new AccessMode(ConfigData.AccessType.RO, false)) {\n private static final long serialVersionUID = 1L;\n \n @Override\n public String enablePredicate() {\n return null;\n }\n \n @Override\n public void action() {\n final AddHostDialog dialog = new AddHostDialog(new Host());\n dialog.showDialogs();\n }\n };\n items.add(newHostWizardItem);\n Tools.getGUIData().registerAddHostButton(newHostWizardItem);\n return items;\n }","@Test(groups=\"smokesuits\",retryAnalyzer =com.crm.autodesk.GenericUtility.RetryAnalyzer.class )\n\tpublic void CreateLeadTest() throws Throwable {\n\t\tHomePage homepage = new HomePage(driver);\n\t\thomepage.clickOnLead();\n\t\t// navigate to create lead\n\t\tLeadPage leadp = new LeadPage(driver);\n\t\t// click on create lead\n\t\tleadp.clickCreateLeadImg();\n\t\tleadp.clickCancel();\n\t\t\n\t}","@Override\n public Step createStep(int position) {\n switch (position) {\n case 0:\n // FIRST FRAGMENT OF STEPPER: DETAILS //\n final StepperDetails step1 = new StepperDetails();\n Bundle b1 = new Bundle();\n b1.putInt(CURRENT_STEP_POSITION_KEY, position);\n step1.setArguments(b1);\n return step1;\n case 1:\n // SECOND FRAGMENT OF STEPPER: MOUNT DEVICE //\n final StepperMountDevice step2 = new StepperMountDevice();\n Bundle b2 = new Bundle();\n b2.putInt(CURRENT_STEP_POSITION_KEY, position);\n step2.setArguments(b2);\n return step2;\n case 2:\n // THIRD FRAGMENT OF STEPPER: CALIBRATION INFO //\n final StepperCalibration step3 = new StepperCalibration();\n Bundle b3 = new Bundle();\n b3.putInt(CURRENT_STEP_POSITION_KEY, position);\n step3.setArguments(b3);\n return step3;\n }\n return null;\n }","public CreateProjectPanel() {\n isFinished = true;\n }","private void createFirstPage() {\n BooleanSupplier showWelcomePage = () -> !FirstRunStatus.shouldSkipWelcomePage();\n mPages.add(new FirstRunPage<>(SigninFirstRunFragment.class, showWelcomePage));\n mFreProgressStates.add(MobileFreProgress.WELCOME_SHOWN);\n mPagerAdapter = new FirstRunPagerAdapter(FirstRunActivity.this, mPages);\n mPager.setAdapter(mPagerAdapter);\n // Other pages will be created by createPostNativeAndPoliciesPageSequence() after\n // native and policy service have been initialized.\n }","public String actionCreateNew() {\r\n \t\tsetBook(new Book());\r\n \t\treturn \"new\";\r\n \t}","public Reqif10ModelWizardNewFileCreationPage(String pageId, IStructuredSelection selection) {\r\n \t\t\tsuper(pageId, selection);\r\n \t\t}","public ProjectWizardModel(WizardDescriptor wiz, String wizType) {\n super(wiz,wizType);\n }","public interface IWizardPage extends IDialogPage {\r\n\t/**\r\n\t * Returns whether the next page could be displayed.\r\n\t *\r\n\t * @return <code>true</code> if the next page could be displayed,\r\n\t * and <code>false</code> otherwise\r\n\t */\r\n\tpublic boolean canFlipToNextPage();\r\n\r\n\t/**\r\n\t * Returns this page's name.\r\n\t *\r\n\t * @return the name of this page\r\n\t */\r\n\tpublic String getName();\r\n\r\n\t/**\r\n\t * Returns the wizard page that would to be shown if the user was to\r\n\t * press the Next button.\r\n\t *\r\n\t * @return the next wizard page, or <code>null</code> if none\r\n\t */\r\n\tpublic IWizardPage getNextPage();\r\n\r\n\t/**\r\n\t * Returns the wizard page that would to be shown if the user was to\r\n\t * press the Back button.\r\n\t *\r\n\t * @return the previous wizard page, or <code>null</code> if none\r\n\t */\r\n\tpublic IWizardPage getPreviousPage();\r\n\r\n\t/**\r\n\t * Returns the wizard that hosts this wizard page.\r\n\t *\r\n\t * @return the wizard, or <code>null</code> if this page has not been\r\n\t * added to any wizard\r\n\t * @see #setWizard\r\n\t */\r\n\tpublic IWizard getWizard();\r\n\r\n\t/**\r\n\t * Returns whether this page is complete or not.\r\n\t * <p>\r\n\t * This information is typically used by the wizard to decide\r\n\t * when it is okay to finish.\r\n\t * </p>\r\n\t *\r\n\t * @return <code>true</code> if this page is complete, and\r\n\t * <code>false</code> otherwise\r\n\t */\r\n\tpublic boolean isPageComplete();\r\n\r\n\t/**\r\n\t * Sets the wizard page that would typically be shown\r\n\t * if the user was to press the Back button.\r\n\t * <p>\r\n\t * This method is called by the container.\r\n\t * </p>\r\n\t *\r\n\t * @param page the previous wizard page\r\n\t */\r\n\tpublic void setPreviousPage(IWizardPage page);\r\n\r\n\t/**\r\n\t * Sets the wizard that hosts this wizard page.\r\n\t * Once established, a page's wizard cannot be changed\r\n\t * to a different wizard.\r\n\t *\r\n\t * @param newWizard the wizard\r\n\t * @see #getWizard\r\n\t */\r\n\tpublic void setWizard(IWizard newWizard);\r\n}","public String createQuiz() {\n quiz = quizEJB.createQuiz(quiz);\n quizList = quizEJB.listQuiz();\n FacesContext.getCurrentInstance().addMessage(\"successForm:successInput\", new FacesMessage(FacesMessage.SEVERITY_INFO, \"Success\", \"New record added successfully\"));\n return \"quiz-list.xhtml\";\n }","CdapCreateAppStep createCdapCreateAppStep();","public NewReactionAcquisitionWizardPage() {\n\t\tsuper(\"SpectrumWizardPage\");\n\t\tsetTitle(\"Predicted from MEDEA wizard\");\n\t\tsetDescription(\"This wizard specifies he name of the file of the\" +\n\t\t\t\t\"predicted reaction. It is need to have into this folder other \" +\n\t\t\t\t\"folder with the name: -\");\n\t}","@Override\r\n\tpublic void createControl(Composite parent) {\n\t\t\r\n\t\tComposite container = new Composite(parent, SWT.NONE);\r\n\t\tGridData gd = new GridData(GridData.FILL_HORIZONTAL);\r\n\t\tcontainer.setLayout(new GridLayout(2, false));\r\n\t\t\r\n\t\tLabel nameLabel = new Label(container, SWT.NULL);\r\n\t\tnameText = new Text(container, SWT.BORDER | SWT.SINGLE);\r\n\t\tnameLabel.setText(BundleInternationalization.getString(\"NameLabel\")+\":\");\r\n\t\tnameText.setLayoutData(gd);\r\n\t\t// Listener to validate the project name when user finishes writing\r\n\t\tnameText.addModifyListener(new ModifyListener() {\r\n\t\t\tpublic void modifyText(ModifyEvent e) {\r\n\t\t\t\twizardChanged();\r\n\t\t\t}\r\n\t\t});\r\n\t\t\r\n\t\tLabel descriptionLabel = new Label(container, SWT.NULL);\r\n\t\tdescriptionText = new Text(container, SWT.BORDER | SWT.SINGLE);\r\n\t\tdescriptionLabel.setText(BundleInternationalization.getString(\"DescriptionLabel\")+\":\");\r\n\t\tdescriptionText.setLayoutData(gd);\r\n\t\t// Listener to validate the project description when user finishes writing\r\n\t\tdescriptionText.addModifyListener(new ModifyListener() {\r\n\t\t\tpublic void modifyText(ModifyEvent e) {\r\n\t\t\t\twizardChanged();\r\n\t\t\t}\r\n\t\t});\t\t\r\n\t\t\r\n\t\tLabel startDateLabel = new Label(container, SWT.NULL);\r\n\t\tstartDateText = new DateTime(container, SWT.DATE | SWT.BORDER | SWT.SINGLE);\r\n\t\tstartDateLabel.setText(BundleInternationalization.getString(\"StartDateLabel\")+\":\");\t\r\n\t\tstartDateText.setLayoutData(gd);\r\n\t\t\r\n\r\n\t\tLabel endDateLabel = new Label(container, SWT.NULL);\r\n\t\tendDateText = new DateTime(container, SWT.DATE | SWT.BORDER | SWT.SINGLE);\r\n\t\tendDateLabel.setText(BundleInternationalization.getString(\"EndDateLabel\")+\":\");\t\r\n\t\tendDateText.setLayoutData(gd);\r\n\t\t\r\n\t\tLabel budgetLabel = new Label(container, SWT.NULL);\r\n\t\tbudgetText = new Text(container, SWT.BORDER | SWT.SINGLE);\r\n\t\tbudgetLabel.setText(BundleInternationalization.getString(\"BudgetLabel\")+\":\");\r\n\t\tbudgetText.setLayoutData(gd);\r\n\t\tbudgetText.addListener (SWT.Verify, new Listener () {\r\n public void handleEvent (Event event) {\r\n \tvalidateDouble(event);\r\n }\r\n\t\t}); \r\n\t\tbudgetText.addModifyListener(new ModifyListener() {\r\n\t\t\tpublic void modifyText(ModifyEvent e) {\r\n\t\t\t\twizardChanged();\r\n\t\t\t}\r\n\t\t});\r\n\t\t\r\n\t\tLabel quantityLinesLabel = new Label(container, SWT.NULL);\r\n\t\tquantityLinesText = new Text(container, SWT.BORDER | SWT.SINGLE);\r\n\t\tquantityLinesLabel.setText(BundleInternationalization.getString(\"NumberCodeLinesLabel\")+\":\");\r\n\t\tquantityLinesText.setLayoutData(gd);\r\n\t\tquantityLinesText.addListener (SWT.Verify, new Listener () {\r\n public void handleEvent (Event event) {\r\n \tvalidateInt(event);\r\n }\r\n\r\n\t\t});\r\n\t\tquantityLinesText.addModifyListener(new ModifyListener() {\r\n\t\t\tpublic void modifyText(ModifyEvent e) {\r\n\t\t\t\twizardChanged();\r\n\t\t\t}\r\n\t\t});\r\n\t\t\r\n\t\tLabel domainLabel = new Label(container, SWT.NULL);\r\n\t\tdomainText = new Text(container, SWT.BORDER | SWT.SINGLE);\r\n\t\tdomainLabel.setText(BundleInternationalization.getString(\"DomainLabel\")+\":\");\r\n\t\tdomainText.setLayoutData(gd);\r\n\t\t// Listener to validate the domain text when user finishes writing\r\n\t\tdomainText.addModifyListener(new ModifyListener() {\r\n\t\t\tpublic void modifyText(ModifyEvent e) {\r\n\t\t\t\twizardChanged();\r\n\t\t\t}\r\n\t\t});\r\n\t\t\r\n\t\tLabel progLanguageLabel = new Label(container, SWT.NULL);\r\n\t\tprogLanguageCombo = new Combo(container, SWT.DROP_DOWN | SWT.READ_ONLY);\r\n\t\tprogLanguageLabel.setText(BundleInternationalization.getString(\"ProgrammingLanguageLabel\")+\":\");\r\n\t\t// progLanguageCombo.setLayoutData(gd);\t\r\n\t\tprogLanguageCombo.setItems (new String [] {\"Java\", \"Ada\", \"C++\", \"C#\", \"Cobol\", \"ASP\", \"JSP\"});\r\n\t\tprogLanguageCombo.addSelectionListener(new SelectionAdapter() {\r\n\t\t\t@Override\r\n\t\t\tpublic void widgetSelected(SelectionEvent e) {\r\n\t\t\t\twizardChanged();\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t});\r\n\t\t\r\n\t\tLabel estimatedHoursLabel = new Label(container, SWT.NULL);\r\n\t\testimatedHoursText = new Text(container, SWT.BORDER | SWT.SINGLE);\r\n\t\testimatedHoursLabel.setText(BundleInternationalization.getString(\"EstimatedHoursLabel\")+\":\");\r\n\t\testimatedHoursText.setLayoutData(gd);\r\n\t\testimatedHoursText.addListener (SWT.Verify, new Listener () {\r\n public void handleEvent (Event event) {\r\n \tvalidateInt(event);\r\n }\r\n\r\n\t\t});\r\n\t\testimatedHoursText.addModifyListener(new ModifyListener() {\r\n\t\t\tpublic void modifyText(ModifyEvent e) {\r\n\t\t\t\twizardChanged();\r\n\t\t\t}\r\n\t\t});\r\n\t\t\r\n\t\twizardChanged();\r\n\t\tsetControl(container);\r\n\r\n\t}","public ProjectWizardModel(WizardDescriptor wiz) {\n this(wiz, PROJECT_WIZARD_TYPE );\n }","public void initialize(TemplateWizard wiz) {\n this.wizard = wiz;\n }","public WizardPanel(String wizardTitle, String wizardDescription, Icon wizardIcon, Icon welcomeIcon, Dimension wizarddimensions,\n\t\t\tJLabel welcomeLabel) {\n\t\tthis.wizardIcon = wizardIcon;\n\t\tthis.welcomeTitle = wizardTitle;\n\t\tthis.welcomeDescription = wizardDescription;\n\t\twelcomePage = new WizardWelcomePanel(welcomeTitle, welcomeDescription, welcomeIcon, welcomeLabel);\n\t\tthis.finishedPage = new WizardFinishPanel();\n\t\tfinishedPage.setIcon(welcomeIcon);\n\t\ttry {\n\t\t\tjbInit();\n\t\t} catch (Exception ex) {\n\t\t\tex.printStackTrace();\n\t\t}\n\t}","private void createRoutine() {\n String s = (String) JOptionPane.showInputDialog(\n this,\n \"Name the new routine:\",\n \"Create new\",\n JOptionPane.PLAIN_MESSAGE,\n null, null, null);\n\n if (s != null) {\n Routine r = new Routine(s);\n collection.add(r);\n listModel.addElement(r);\n list.setSelectedValue(r, true);\n new WorkoutsFrame(r);\n }\n }","public void create(){}","public StepsFragment() {\n }","public void saveAndCreateNew() throws Exception {\n\t\topenPrimaryButtonDropdown();\n\t\tgetControl(\"saveAndCreateNewButton\").click();\n\t}","public void goToCreate(View view) {\n Intent intent = new Intent(this, CreateAccountActivity.class);\n startActivity(intent);\n }","public WizardEngine(GameOptions go) {\r\n\t\tsuper();\r\n\t\tthis.go = go;\r\n\t\tcardFinder = new WizardCardFinder();\r\n\t\t//cardFinder = new PokerCardFinder();\r\n\t}","public CreateAccountPanel() {\n initComponents();\n initializeDateChooser();\n }","public LandingPage registerNewAccount(){\n\t\taction.WaitForWebElement(linkRegisterNewAccount)\n\t\t\t .Click(linkRegisterNewAccount);\n\t\treturn this;\n\t}","@Override\n public String createRecord(String creatingPage) {\n return creatingPage;\n }","protected void creaPagine() {\n Pagina pag;\n Pannello pan;\n\n try { // prova ad eseguire il codice\n\n /* crea la pagina e aggiunge campi e pannelli */\n pag = this.addPagina(\"generale\");\n\n pan = PannelloFactory.orizzontale(this);\n pan.add(Cam.data);\n pan.add(Cam.importo.get());\n pan.add(Cam.note.get());\n pag.add(pan);\n\n } catch (Exception unErrore) { // intercetta l'errore\n Errore.crea(unErrore);\n }// fine del blocco try-catch\n\n }","private void setupCreateCourse() {\n\t\tmakeButton(\"Create Course\", (ActionEvent e) -> {\n\t\t\ttry {\n\t\t\t\tString[] inputs = getInputs(new String[] { \"Name:\", \"Number:\" });\n\t\t\t\tif (inputs == null)\n\t\t\t\t\treturn;\n\n\t\t\t\tint num = Integer.parseInt(inputs[1]);\n\t\t\t\tadCon.createCourse(inputs[0], num);\n\t\t\t\tupdateCourses();\n\t\t\t} catch (NumberFormatException ex) {\n\t\t\t\tJOptionPane.showMessageDialog(getRootPane(), \"Course number must be a number\", \"Error\",\n\t\t\t\t\t\tJOptionPane.OK_OPTION);\n\t\t\t}\n\t\t});\n\t}","public ElegirTipoBienWizard(String locale)\r\n {\r\n \t this.locale=locale;\r\n try{\r\n initComponents();\r\n renombrarComponentes();\r\n \r\n } catch (Exception e){\r\n logger.error(\"Error al importar actividades economicas\",e);\r\n }\r\n }","@Override\n public void storeSettings(WizardDescriptor wiz) {\n wiz.putProperty(NewDetectorWizardAction.PROP_NAME_CREATE_VIA_TEMPLATE, getComponent().getViaDetectorTemplate().isSelected());\n wiz.putProperty(PROP_NAME_DETECTOR_NAME, getComponent().getDetectorName().getText());\n wiz.putProperty(PROP_NAME_DETECTOR_DESCRIPTION, getComponent().getDetectorDescription().getText());\n wiz.putProperty(WizardDescriptor.PROP_ERROR_MESSAGE, null);\n }","private void doCreateNewPartner() {\n Scanner sc = new Scanner(System.in);\n System.out.println(\"***Hors Management System:: System Administration:: Create new partner\");\n Partner partner = new Partner();\n System.out.print(\"Enter partner username:\");\n partner.setName(sc.nextLine().trim());\n System.out.print(\"Enter partner password;\");\n partner.setPassword(sc.nextLine().trim());\n\n Set<ConstraintViolation<Partner>> constraintViolations = validator.validate(partner);\n\n if (constraintViolations.isEmpty()) {\n partner = partnerControllerRemote.createNewPartner(partner);\n System.out.println(\"New partner created successfully\");\n } else {\n showInputDataValidationErrorsForPartner(constraintViolations);\n }\n\n }","@FXML\n private void goToCreateProgram(ActionEvent event) throws IOException {\n\n CreateProgramController createProgramController = new CreateProgramController();\n Program programEntity = createProgramController.openView(event);\n createProgram.setSelected(false);\n if (programEntity != null && programListController != null)\n {\n if (programListController.listOfPrograms != null)\n {\n programListController.listOfPrograms.add(programEntity);\n programListController.updateProgramList();\n UsermanagementUtilities.setFeedback(event,\"The program was created\",true);\n }\n } else {\n UsermanagementUtilities.setFeedback(event,\"The program was not created\",false);\n }\n }","public BJADWizard<T> getWizard()\n {\n return this.wizard;\n }","private void AddNewScenario(HttpServletRequest request, HttpServletResponse response) {\n XMLTree.getInstance().AddNewScenario();\n }","public void testGetDialog() {\n System.out.println(\"getDialog\");\n Wizard instance = new Wizard();\n JDialog result = instance.getDialog();\n assertNotNull(result);\n }","Dashboard createDashboard();","public void switchToCreateAccount() {\r\n\t\tlayout.show(this, \"createPane\");\r\n\t\trevalidate();\r\n\t\trepaint();\r\n\t}","protected void createPages() {\n\t\tcreateIntroEditor();\n\t\tcreatePageMainEditor();\n\t\tcreatePageController();\n\t\tcreateCssEditor();\n\t\tcreatePageTextEditor();\n\t\trefreshPageMainEditor();\n\t\trefreshPageControllerEditor();\n\t\trefreshCssEditor();\n\t\tsetDirty(false);\n\t}","public boolean createLesson() {\n\t\treturn false;\n\t}","protected void setWizard(BJADWizard<T> wizard)\n {\n this.wizard = wizard;\n }","public JaxWsClientCreator(Project project, WizardDescriptor wiz) {\n this.project = project;\n this.wiz = wiz;\n }","public void create() {\n\t\t\n\t}","public WizardPanel(String wizardTitle, String wizardDescription, Icon wizardIcon, Icon welcomeIcon,\n\t\t\tDimension wizarddimensions) {\n\t\tthis(wizardTitle, wizardDescription, wizardIcon, welcomeIcon, wizarddimensions, null);\n\t}","public SlingHttpResponse createPage(String pageLabel, String pageTitle, String parentPath, String templatePath, int... expectedStatus)\n throws ClientException {\n FormEntityBuilder feb = FormEntityBuilder.create()\n .addParameter(\"cmd\", CMD_CREATE_PAGE)\n .addParameter(\"parentPath\", parentPath)\n .addParameter(\"label\", pageLabel)\n .addParameter(\"title\", pageTitle)\n .addParameter(\"template\", templatePath);\n\n return executeWCMCommand(CMD_CREATE_PAGE, feb, expectedStatus);\n }","public void widgetSelected(SelectionEvent arg0) {\n\t\t\t\tIWorkbenchWizard wizard = new BasicNewProjectResourceWizard();\r\n\t\t\t\twizard.init(PlatformUI.getWorkbench(), new TreeSelection());\r\n\t\t\t\tWizardDialog dialog = new WizardDialog(getShell(), wizard);\r\n\t\t\t\tdialog.open();\r\n\t\t\t\tif (outputChooserTreeViewer.getTree().getItemCount() == 1) {\t\t\t\t\t\r\n\t\t\t\t\tvalidatePage();\r\n\t\t\t\t}\r\n\t\t\t}","@Command\n public void nuevaMateria() {\n\t\t\n\t\tWindow window = (Window)Executions.createComponents(\n \"/WEB-INF/include/Mantenimiento/Materias/vtnMaterias.zul\", null, null);\n window.doModal();\n }","FORM createFORM();","public boolean[] showLinearWizard(List<Admin> admins, AdminService adminService) {\n\n // define pages to show\n Wizard wizard = new Wizard();\n wizard.setTitle(\"System Setup Configuration\");\n\n // --- page 1\n int row = 0;\n\n GridPane page1Grid = new GridPane();\n page1Grid.setVgap(10);\n page1Grid.setHgap(10);\n\n ObservableList<String> adminNames = FXCollections.observableArrayList();\n ChoiceBox<String> allAdmins = new ChoiceBox<>(adminNames);\n\n if (!admins.isEmpty()) {\n page1Grid.add(new Label(\"All Admins :\"), 0, row);\n for (Admin a : admins) {\n adminNames.add(a.getAdminName());\n }\n page1Grid.add(allAdmins, 1, row++);\n }\n\n page1Grid.add(new Label(\"Admin :\"), 0, row);\n final TextField userTF = createTextField(\"adminName\");\n page1Grid.add(userTF, 1, row++);\n\n page1Grid.add(new Label(\"Password :\"), 0, row);\n final TextField passTF = createTextField(\"password\");\n // Set initial state\n passTF.setManaged(false);\n passTF.setVisible(false);\n page1Grid.add(passTF, 1, row);\n\n final PasswordField passPF = new PasswordField();\n passPF.setId(\"password\");\n GridPane.setHgrow(passPF, Priority.ALWAYS);\n page1Grid.add(passPF, 1, row);\n\n CheckBox checkBox = new CheckBox(\"Show/Hide password\");\n page1Grid.add(checkBox, 1, ++row);\n\n // Bind properties. Toggle textField and passwordField\n // visibility and manageability properties mutually when checkbox's state is changed.\n // Because we want to display only one component (textField or passwordField)\n // on the scene at a time.\n passTF.managedProperty().bind(checkBox.selectedProperty());\n passTF.visibleProperty().bind(checkBox.selectedProperty());\n\n passPF.managedProperty().bind(checkBox.selectedProperty().not());\n passPF.visibleProperty().bind(checkBox.selectedProperty().not());\n\n // Bind the textField and passwordField text values bidirectionally.\n passTF.textProperty().bindBidirectional(passPF.textProperty());\n\n WizardPane page1 = new WizardPane() {\n\n @Override\n public void onEnteringPage(Wizard wizard) {\n if (!admins.isEmpty()) {\n System.out.println(\"Skipped!\");\n } else {\n for (ButtonType type : getButtonTypes()) {\n if (type.getButtonData().equals(ButtonBar.ButtonData.NEXT_FORWARD)) {\n Node next = lookupButton(type);\n Platform.runLater(() -> next.setDisable(true));\n userTF.textProperty().addListener((observable, oldValue, newValue) -> next.setDisable(newValue.trim().isEmpty() || passPF.getText().isEmpty()));\n passPF.textProperty().addListener((observable, oldValue, newValue) -> next.setDisable(newValue.trim().isEmpty() || userTF.getText().isEmpty()));\n } else if (type.getButtonData().equals(ButtonBar.ButtonData.CANCEL_CLOSE)) {\n Node cancel = lookupButton(type);\n Platform.runLater(() -> cancel.setVisible(false));\n } else if (type.getButtonData().equals(ButtonBar.ButtonData.BACK_PREVIOUS)) {\n Node previous = lookupButton(type);\n Platform.runLater(() -> previous.setVisible(false));\n }\n }\n }\n }\n\n @Override\n public void onExitingPage(Wizard wizard) {\n\n String adminName = (String) wizard.getSettings().get(\"adminName\");\n String pass = (String) wizard.getSettings().get(\"password\");\n\n Validation validation = new Validation();\n if (!admins.isEmpty() && adminName.isEmpty() && pass.isEmpty()) {\n System.out.println(\"Skipped!\");\n } else {\n if (validation.emptyValidation(userTF, \"Admin\", adminName.isEmpty()) &&\n validation.emptyValidation(passTF, \"Password\", pass.isEmpty())) {\n //save\n if (adminNames.isEmpty()) {\n Admin admin = new Admin();\n admin.setAdminName(adminName);\n admin.setPassword(pass);\n\n adminService.save(admin);\n\n adminNames.add(adminName);\n admins.add(admin);\n } else {\n for (Admin existingAdmin : admins) {\n //update\n if (!existingAdmin.getAdminName().equals(adminName) || !existingAdmin.getPassword().equals(pass)) {\n boolean yesIdo = CommonUtils.confirmMessage(\"Are you Sure?\", \"Warning: Admin Credentials Changed! \", \"Do you really want to update Admin Details?\");\n if (yesIdo) {\n existingAdmin.setAdminName(adminName);\n existingAdmin.setPassword(pass);\n adminService.update(existingAdmin);\n } else {\n userTF.setText(existingAdmin.getAdminName());\n passTF.setText(existingAdmin.getPassword());\n }\n break;\n }\n }\n }\n } else {\n wizard.getSettings().put(\"adminName\", \"\");\n }\n }\n }\n };\n String adminHeaderTest;\n if (admins.isEmpty()) {\n adminHeaderTest = \"No Admin Found. \\nPlease add new Admin Details.\";\n } else {\n adminHeaderTest = \"Admin Details!\";\n }\n page1.setHeaderText(adminHeaderTest);\n page1.setContent(page1Grid);\n\n allAdmins.getSelectionModel().\n\n selectedIndexProperty().\n\n addListener((observableValue, oldIndex, newIndex) ->\n\n {\n if (newIndex != null) {\n Admin existingAdmin = adminService.findByAdminName(allAdmins.getItems().get((Integer) newIndex));\n userTF.setText(existingAdmin.getAdminName());\n passTF.setText(existingAdmin.getPassword());\n }\n });\n\n GridPane page3Grid = new GridPane();\n page3Grid.setVgap(10);\n page3Grid.setHgap(10);\n\n ImageView imageView = new ImageView();\n imageView.setFitHeight(100);\n imageView.setPreserveRatio(true);\n imageView.setImage(CommonUtils.getLogoImage());\n imageView.setSmooth(true);\n\n page3Grid.add(imageView, 0, 0, 1, 3);\n\n page3Grid.add(new\n\n Label(\"Name :\"), 1, 0);\n page3Grid.add(new\n\n Label(\"Address:\"), 1, 1);\n page3Grid.add(new\n\n Label(\"Contact:\"), 1, 2);\n\n\n ChoiceBox<String> systemNameCB = new ChoiceBox<>(systemNames);\n systemNameCB.setId(\"churchName\");\n GridPane.setHgrow(systemNameCB, Priority.ALWAYS);\n systemNameCB.getSelectionModel().select(ConfigReader.getSystemIndex());\n page3Grid.add(systemNameCB, 2, 0);\n\n TextField systemAddress = createTextField(\"churchAddress\");\n systemAddress.setPromptText(\"Eg. Kalanki, Kathmandu\");\n systemAddress.setText(ConfigReader.getSystemAddress());\n page3Grid.add(systemAddress, 2, 1);\n\n TextField systemContact = createTextField(\"churchContact\");\n systemContact.setPromptText(\"Eg. 01-4XXXXXX\");\n systemContact.setText(ConfigReader.getSystemContact());\n page3Grid.add(systemContact, 2, 2);\n\n // --- page 3\n WizardPane page3 = new WizardPane();\n page3.setHeaderText(\"Church Details!\");\n\n page3.setContentText(\"Please provide Church Name and photo!\\nNote: Changes will be active after Restart only.\");\n page3.setContent(page3Grid);\n\n ButtonType photoDialogButton = new ButtonType(\"Change Logo\", ButtonBar.ButtonData.HELP_2);\n page3.getButtonTypes().\n\n add(photoDialogButton);\n\n Button photoButton = (Button) page3.lookupButton(photoDialogButton);\n photoButton.setStyle(\"-fx-background-color: DODGERBLUE;\");\n photoButton.setTextFill(Color.WHITE);\n photoButton.addEventFilter(ActionEvent.ACTION, actionEvent ->\n\n {\n actionEvent.consume(); // stop hello.dialog from closing\n getImage();\n imageView.setImage(CommonUtils.getLogoImage());\n });\n\n // create wizard\n wizard.setFlow(new Wizard.LinearFlow(page1, page3));\n\n // show wizard and wait for response\n wizard.showAndWait().\n\n ifPresent(result ->\n\n {\n if (result == ButtonType.FINISH) {\n try {\n String[] currentChurchDetails = new String[]{String.valueOf(ConfigReader.getSystemIndex()), ConfigReader.getSystemAddress(), ConfigReader.getSystemContact()};\n String[] newChurchDetails = new String[]{String.valueOf(systemNameCB.getSelectionModel().getSelectedIndex()), systemAddress.getText(), systemContact.getText()};\n if (!Arrays.equals(currentChurchDetails, newChurchDetails)) {\n ConfigReader.setSystemDetails(newChurchDetails);\n churchDetailsChanged[1] = true;\n }\n } catch (IOException e) {\n e.printStackTrace();\n }\n }\n });\n\n return churchDetailsChanged;\n }","private void toCreateAcc() {\n Intent intent = new Intent(this, WelcomeActivity.class);\n startActivity(intent);\n }","public static void createNewLeague()\n\t{\n\t\t//put code to get input from end-user here.\n\t\t//generateFixtures(leagueName, teamAmount, homeAndAway, winPoints, drawPoints, lossPoints, teamNames);\n\t}","public Create_Course() {\n initComponents();\n comboBoxLec();\n comboBoxDep();\n }","private void actionNewProject ()\r\n\t{\r\n\t\ttry\r\n\t\t{\r\n\t\t\tDataController.scenarioNewProject();\r\n\r\n\t\t\thelperDisplayProjectFiles();\r\n\r\n\t\t\t//---- Change button icon\r\n\t\t\tImageIcon iconButton = FormUtils.getIconResource(FormStyle.RESOURCE_PATH_ICO_VIEW_SAMPLES);\r\n\r\n\t\t\tmainFormLink.getComponentToolbar().getComponentButtonViewSamples().setIcon(iconButton);\r\n\t\t\tmainFormLink.getComponentToolbar().getComponentButtonViewSamples().setActionCommand(FormMainHandlerCommands.AC_VIEW_SAMPLES_ON);\r\n\t\t\tmainFormLink.getComponentToolbar().getComponentButtonViewSamples().setToolTipText(\"View detected samples\");\r\n\r\n\t\t\tmainFormLink.reset();\r\n\t\t}\r\n\t\tcatch (ExceptionMessage e)\r\n\t\t{\r\n\t\t\tExceptionHandler.processException(e);\r\n\t\t}\r\n\t}"],"string":"[\n \"protected abstract AbstractPerfCakeEditWizard createWizard(IStructuredSelection selection);\",\n \"static public Wizard createWizard (){\\n System.out.println(\\\"Enter the name of your wizard : \\\");\\n Scanner sc = new Scanner(System.in);\\n String nameCharacter = sc.next();\\n\\n // enter and get the HP value of the character\\n System.out.println(\\\"Enter the healpoint of your wizard : \\\");\\n Scanner scan = new Scanner(System.in);\\n String healPointCharacter = scan.next();\\n int hpCharacter = Integer.parseInt(healPointCharacter);\\n\\n // get the power value\\n System.out.println(\\\"Enter the power of your wizard : \\\");\\n Scanner sca = new Scanner(System.in);\\n String powerCharacter = sca.next();\\n int pcCharacter = Integer.parseInt(powerCharacter);\\n\\n\\n // get the initiative (turn order)\\n System.out.println(\\\"Enter the initiative of your wizard : \\\");\\n Scanner scann = new Scanner(System.in);\\n String initiativeCharacter = scann.next();\\n int iniCharacter = Integer.parseInt(initiativeCharacter);\\n\\n System.out.println(\\\"Enter the wizard damage value of your wizard : \\\");\\n Scanner scanS = new Scanner(System.in);\\n String wizardDamage = scann.next();\\n int wiz = Integer.parseInt(wizardDamage);\\n\\n Wizard createWizard = new Wizard(nameCharacter, pcCharacter, hpCharacter, iniCharacter, wiz);\\n System.out.println(\\\"Your wizard has been created with success!\\\");\\n\\n return createWizard;\\n }\",\n \"public void testWizards() {\\n // open new file wizard\\n NewFileWizardOperator nfwo = NewFileWizardOperator.invoke();\\n nfwo.selectProject(\\\"SampleProject\\\");\\n nfwo.selectCategory(\\\"Java\\\");\\n nfwo.selectFileType(\\\"Java Class\\\");\\n // go to next page\\n nfwo.next();\\n // create operator for the next page\\n NewJavaFileNameLocationStepOperator nfnlso = new NewJavaFileNameLocationStepOperator();\\n nfnlso.txtObjectName().typeText(\\\"MyNewClass\\\");\\n // finish wizard\\n //nfnlso.finish();\\n // cancel wizard\\n nfnlso.cancel();\\n }\",\n \"@Override\\n\\tpublic void create(IWizardEntity entity, WizardRunner runner) {\\n\\t\\t\\n\\t}\",\n \"private void createWizard(String persoName, String persoImage, int persoLife, int attack) {\\n\\t\\tpersoList.add(new Wizard(persoName, persoImage, persoLife, attack));\\n\\t}\",\n \"public void addPages() {\\n\\t\\t\\n\\t\\tProjectUtils projectUtils = new ProjectUtils();\\n\\t\\tIProject proj = projectUtils.getProject(selection);\\n\\t\\t\\n\\t\\t\\n\\t\\t\\n\\t\\tDb db = loadDBParams();\\n\\t\\tDBConnection dbConn = new DBConnection();\\n\\t\\tConnection connection = null;\\n\\t\\t\\n\\t\\t\\n\\t\\ttry {\\n\\t\\t\\tconnection = dbConn.loadDriver(proj.getLocation()+\\\"/\\\"+db.getDriverClassPath(), db.getDriverClass(), db.getDatabaseURL(), db.getUserName(), db.getPassWord());\\n\\t\\t} catch (MalformedURLException e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t} catch (InstantiationException e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t} catch (IllegalAccessException e) {\\n\\t\\t\\te.printStackTrace();\\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\\t\\n\\t\\t\\n\\t\\tpage = new SmartNewWizardPage(selection, connection, proj.getLocation().toString());\\n\\t\\taddPage(page);\\n\\n\\t}\",\n \"public IWizard getWizard();\",\n \"public void testGenericWizards() {\\n // open new project wizard\\n NewProjectWizardOperator npwo = NewProjectWizardOperator.invoke();\\n npwo.selectCategory(\\\"Java Web\\\");\\n npwo.selectProject(\\\"Web Application\\\");\\n npwo.next();\\n // create operator for next page\\n WizardOperator wo = new WizardOperator(\\\"Web Application\\\");\\n JTextFieldOperator txtName = new JTextFieldOperator((JTextField) new JLabelOperator(wo, \\\"Project Name:\\\").getLabelFor());\\n txtName.clearText();\\n txtName.typeText(\\\"MyApp\\\");\\n wo.cancel();\\n }\",\n \"public void addPages() {\\n\\t\\twizardPage = new WizardNewProjectCreationPage(\\n\\t\\t\\\"NewExampleComSiteProject\\\");\\n\\t\\twizardPage.setDescription(\\\"Create a new Example.com Site Project.\\\");\\n\\t\\twizardPage.setTitle(\\\"New Example.com Site Project\\\");\\n\\t\\taddPage(wizardPage);\\n\\t}\",\n \"public void setWizard(IWizard newWizard);\",\n \"public NewPageWizard(IXWikiSpace sapce)\\n {\\n super();\\n setWindowTitle(\\\"Add New Page...\\\");\\n setNeedsProgressMonitor(false);\\n this.space = sapce;\\n }\",\n \"@Override\\r\\n\\tpublic void addPages() {\\n\\t\\tprojectPage = new NewProjectWizardPage();\\r\\n\\t\\taddPage(projectPage);\\r\\n\\t}\",\n \"protected IFlowControl createWizard( InputStream in ){\\r\\n\\t\\tXMLWizardBuilder<T> builder = new XMLWizardBuilder<T>( in );\\r\\n\\t\\ttry{\\r\\n\\t\\t\\tbuilder.build( this);\\r\\n\\t\\t}\\r\\n\\t\\tcatch( Exception ex ){\\r\\n\\t\\t\\tex.printStackTrace();\\r\\n\\t\\t\\treturn null;\\r\\n\\t\\t}\\r\\n\\t\\tflow = new FlowControl(); \\r\\n\\t\\tsuper.setFlow(flow);\\r\\n\\t\\treturn flow;\\r\\n\\t}\",\n \"public NewTestWizardPage() {\\n\\t\\tsuper(true, \\\"New Groovy Test Settings\\\");\\n\\n\\t\\tsetTitle(\\\"Groovy Test Class\\\");\\n\\t\\tsetDescription(\\\"Create a new Groovy unit test class\\\");\\n\\t}\",\n \"public void addPages() {\\n //super.addPages(); //<--- notice we're overriding here\\n mainPage = new NewTargetWizardPage(\\\"newFilePage1\\\", getSelection());//$NON-NLS-1$\\n mainPage.setTitle(TITLE);\\n mainPage.setDescription(DESCRIPTION); \\n addPage(mainPage);\\n }\",\n \"public NewTargetFileWizard() {\\n super();\\n }\",\n \"public void addPages() {\\n\\t\\tpage = new NewTotoriWizardPage(selection);\\n\\t\\taddPage(page);\\n\\t}\",\n \"public void testRegisterWizardPanel() {\\n System.out.println(\\\"registerWizardPanel\\\");\\n Object id = null;\\n WizardPanelDescriptor panel = null;\\n Wizard instance = new Wizard();\\n instance.registerWizardPanel(id, panel);\\n }\",\n \"public WizardModel(){ \\n wp = new HashMap<Object,WizardPanelDescriptor>();\\n step = 1;\\n }\",\n \"public AddValidatorWizard() {\\n super();\\n initPages();\\n setWindowTitle(Messages.title_newValidator);\\n }\",\n \"Page createPage();\",\n \"public AbstractWizardPage()\\n {\\n super(true);\\n }\",\n \"public NewEntryWizard()\\n {\\n setNeedsProgressMonitor( true );\\n }\",\n \"@Override\\n\\tpublic void addPages() {\\n\\t\\t_fileWizard = new NewPlotFilenameWizardPage(selection);\\n\\t\\t_scaleWizard = new ScaleWizardPage(selection);\\n\\t\\t_coastWizard = new CoastWizardPage(selection);\\n\\t\\t_gridWizard = new GridWizardPage(selection);\\n\\n\\t\\t// check there's ETOPO data before we add the page\\n\\t\\t_etopoWizard = new ETOPOWizardPage(selection);\\n\\n\\t\\taddPage(_fileWizard);\\n\\t\\taddPage(_scaleWizard);\\n\\t\\taddPage(_coastWizard);\\n\\t\\taddPage(_gridWizard);\\n\\t\\tif (_etopoWizard.isAvailable())\\n\\t\\t\\taddPage(_etopoWizard);\\n\\t}\",\n \"public CartogramWizard ()\\n\\t{\\n\\t\\n\\t\\t// Set the window parameters.\\n\\t\\tthis.setTitle(AppContext.shortProgramName + \\\" _ Cartogram Wizard\\\");\\n\\t\\tthis.setSize(640, 480);\\n\\t\\tthis.setLocation(30, 40);\\n\\t\\tthis.setResizable(false);\\n\\t\\tthis.setLayout(null);\\n\\t\\t//this.setModal(true);\\n\\t\\tthis.setDefaultCloseOperation(DO_NOTHING_ON_CLOSE);\\n\\t\\tthis.addWindowListener(new CartogramWizardWindowListener());\\n\\t\\t\\n\\t\\t\\n\\t\\t// Adding the cartogram wizard to the app context.\\n\\t\\tAppContext.cartogramWizard = this;\\n\\t\\t\\n\\t\\t\\n\\t\\t// Add icon panel at the left of the wizard window.\\n\\t\\t// This panel contains the ScapeToad icon.\\n\\t\\tif (mScapeToadIconPanel == null)\\n\\t\\t{\\n\\t\\t\\tmScapeToadIconPanel = new ScapeToadIconPanel(this);\\n\\t\\t}\\n\\t\\t\\n\\t\\tmScapeToadIconPanel.setLocation(30, 90);\\n\\t\\tthis.add(mScapeToadIconPanel);\\n\\t\\t\\n\\t\\t\\n\\t\\t\\n\\t\\t// Add title panel.\\n\\t\\tCartogramWizardTitlePanel titlePanel =\\n\\t\\t\\tnew CartogramWizardTitlePanel(this);\\n\\t\\t\\n\\t\\ttitlePanel.setLocation(30, 20);\\n\\t\\tthis.add(titlePanel);\\n\\t\\t\\n\\t\\t\\n\\t\\t\\n\\t\\t\\n\\t\\t// Add icon panel at the left of the wizard window.\\n\\t\\t// This panel contains the ScapeToad icon.\\n\\t\\tmWizardStepIconPanel = new WizardStepIconPanel(this);\\n\\t\\tmWizardStepIconPanel.setLocation(380, 20);\\n\\t\\tthis.add(mWizardStepIconPanel);\\n\\t\\t\\n\\t\\t\\n\\t\\t\\n\\t\\t\\n\\t\\t// Ajouter l'introduction au wizard.\\n\\t\\t// Explication des étapes à suivre :\\n\\t\\t// 1. Sélectionner la couche des polygones (master layer).\\n\\t\\t// 2. Sélectionner l'information statistique.\\n\\t\\t// 3. Sélection des couches à transformer simultanément.\\n\\t\\t\\n\\t\\tmPanelZero = new CartogramWizardPanelZero(this);\\n\\t\\tthis.getContentPane().add(mPanelZero);\\n\\t\\t\\n\\t\\tmCurrentStep = 0;\\n\\t\\t\\n\\t\\t\\n\\t\\t\\n\\t\\t// Add the running panel which is already created.\\n\\t\\tmRunningPanel.setVisible(false);\\n\\t\\tthis.add(mRunningPanel);\\n\\t\\t\\n\\t\\t\\n\\t\\t// Add the finished panel which is already created.\\n\\t\\tmFinishedPanel.setVisible(false);\\n\\t\\tthis.add(mFinishedPanel);\\n\\t\\t\\n\\t\\t\\t\\t\\n\\t\\t// Add the Cancel button.\\n\\t\\tmCancelButton = new JButton(\\\"Cancel\\\");\\n\\t\\tmCancelButton.setLocation(30, 404);\\n\\t\\tmCancelButton.setSize(100, 26);\\n\\t\\tmCancelButton.addActionListener(new CartogramWizardCloseAction());\\n\\t\\tthis.getContentPane().add(mCancelButton);\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"@Override\\n public void addPages() {\\n super.addPages();\\n page1 = new NewReviewWizardPage();\\n addPage(page1);\\n }\",\n \"@Override\\r\\n\\t\\tpublic void create() {\\n\\t\\t\\tsuper.create();\\r\\n\\t\\t\\tsuper.getOKButton().setEnabled(false);\\r\\n\\t\\t\\tsuper.setTitle(Messages.MoveUnitsWizardPage1_Topolog__2);\\r\\n\\t\\t\\tsuper.setMessage(Messages.MoveUnitsWizardPage1_Select_a_name_source_folder_and_a_);\\r\\n\\t\\t\\tsuper.getShell().setText(Messages.MoveUnitsWizardPage1_Topolog__2);\\r\\n\\t\\t}\",\n \"public Reqif10ModelWizardInitialObjectCreationPage(String pageId) {\\r\\n \\t\\t\\tsuper(pageId);\\r\\n \\t\\t}\",\n \"private Wizard(final FXFinder javafxFinder) {\\n this.javafxFinder = javafxFinder;\\n wizard = new JFrame(\\\"Apache SIS setup\\\");\\n final Container content = wizard.getContentPane();\\n content.setLayout(new BorderLayout());\\n /*\\n * Back, Next, Cancel button.\\n */\\n { // For keeping variables in a local scope.\\n final Box buttons = Box.createHorizontalBox();\\n buttons.setBorder(new EmptyBorder(9, 12, 9, 15)); // Top, left, bottom, right.\\n backButton = createButton(buttons, BACK); buttons.add(Box.createHorizontalStrut(10));\\n nextButton = createButton(buttons, NEXT); buttons.add(Box.createHorizontalStrut(30));\\n cancelButton = createButton(buttons, CANCEL);\\n backButton.setEnabled(false);\\n\\n final JPanel bottom = new JPanel(new BorderLayout());\\n bottom.add(new JSeparator(), BorderLayout.NORTH);\\n bottom.add(buttons, java.awt.BorderLayout.EAST);\\n content.add(bottom, BorderLayout.SOUTH);\\n }\\n /*\\n * Navigation panel on the left side with the following titles\\n * (currently shown page is highlighted):\\n *\\n * - Introduction\\n * - Download\\n * - Set directory\\n * - Summary\\n */\\n final WizardPage[] pages = WizardPage.values();\\n {\\n titles = new JLabel[pages.length];\\n final EmptyBorder padding = new EmptyBorder(3, 0, 3, 0);\\n final Box summary = Box.createVerticalBox();\\n for (int i=0; i<pages.length; i++) {\\n final String title = (i == 0 ? SELECTED_TITLE_BULLET : TITLE_BULLET) + pages[i].title;\\n final JLabel label = new JLabel(title, JLabel.LEFT);\\n label.setForeground(i == 0 ? SELECTED_TITLE_COLOR : TITLE_COLOR);\\n label.setBorder(padding);\\n summary.add(titles[i] = label);\\n }\\n final JPanel pane = new JPanel();\\n pane.setBackground(new Color(169, 204, 227));\\n pane.setBorder(new EmptyBorder(40, 15, 9, 24)); // Top, left, bottom, right.\\n pane.add(summary);\\n content.add(pane, BorderLayout.WEST);\\n }\\n /*\\n * The main content where text is shown, together with download button, directory chooser, etc.\\n * The content of each page is created by `createPage(…)`. They all have in common to start with\\n * a description text formatted in HTML.\\n */\\n {\\n final Font font = new Font(Font.SERIF, Font.PLAIN, 14);\\n javafxPath = new JLabel();\\n javafxPath.setBorder(JAVAFX_PATH_BORDER);\\n javafxPathError = new JLabel();\\n javafxPathError.setForeground(Color.RED);\\n javafxPathError.setFont(font);\\n inflateProgress = new JProgressBar();\\n cardPanel = new JPanel(new CardLayout());\\n cardPanel.setBorder(new EmptyBorder(30, 30, 9, 30)); // Top, left, bottom, right.\\n cardPanel.setBackground(Color.WHITE);\\n for (final WizardPage page : pages) {\\n cardPanel.add(createPage(page, font), page.name());\\n // The initially visible component is the first added.\\n }\\n currentPage = pages[0];\\n content.add(cardPanel, BorderLayout.CENTER);\\n }\\n wizard.setSize(WIDTH, 500); // Must be before `setLocationRelativeTo(…)`.\\n wizard.setResizable(false);\\n wizard.setLocationRelativeTo(null);\\n wizard.addWindowListener(new WindowAdapter() {\\n @Override public void windowClosing(WindowEvent event) {\\n javafxFinder.cancel();\\n }\\n });\\n }\",\n \"public void addPages() {\\t\\t\\n\\t\\tpage1 = new Opera2ActionsTransformationWizardPage1(selection, operaModel);\\n\\t\\taddPage(page1);\\t\\n\\t}\",\n \"@Override\\n\\tpublic void createControl(Composite parent) {\\n\\t\\tComposite container = new Composite(parent, SWT.NULL);\\n\\n\\t\\tsetControl(container);\\n\\n\\t\\tString username = \\\"\\\";\\n\\t\\tString password = \\\"\\\";\\n\\t\\ttry {\\n\\t\\t\\tString[] array = window.ds.getURI().getUserInfo().split(\\\":\\\");\\n\\t\\t\\tusername = array[0];\\n\\t\\t\\tpassword = array[1];\\n\\t\\t} catch (Exception e) {\\n\\t\\t}\\n\\n\\t\\tLabel lblUsername = new Label(container, SWT.NONE);\\n\\t\\tlblUsername.setBounds(10, 52, 75, 13);\\n\\t\\tlblUsername.setText(\\\"Username\\\");\\n\\n\\t\\tusernameText = new Text(container, SWT.BORDER);\\n\\t\\tusernameText.setText(username);\\n\\t\\tusernameText.addModifyListener(new ModifyListener() {\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic void modifyText(ModifyEvent arg0) {\\n\\t\\t\\t\\tgetWizard().getContainer().updateButtons();\\n\\t\\t\\t}\\n\\t\\t});\\n\\n\\t\\tusernameText.setBounds(10, 71, 187, 19);\\n\\t\\tusernameText.setFocus();\\n\\n\\t\\tLabel lblPassword = new Label(container, SWT.NONE);\\n\\t\\tlblPassword.setBounds(10, 96, 75, 13);\\n\\t\\tlblPassword.setText(\\\"Password\\\");\\n\\n\\t\\tpasswordText = new Text(container, SWT.BORDER | SWT.PASSWORD);\\n\\t\\tpasswordText.setText(password);\\n\\t\\tpasswordText.addModifyListener(new ModifyListener() {\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic void modifyText(ModifyEvent arg0) {\\n\\t\\t\\t\\tgetWizard().getContainer().updateButtons();\\n\\t\\t\\t}\\n\\t\\t});\\n\\n\\t\\tpasswordText.setBounds(10, 115, 187, 19);\\n\\t\\tControl[] list = null;\\n\\t\\t\\n\\t\\tif (window.ds.usesComponent(IUserCreation.class)) {\\n\\t\\t\\tbtnCreateAnNew = new Button(container, SWT.NONE);\\n\\t\\t\\tbtnCreateAnNew.addSelectionListener(new SelectionAdapter() {\\n\\t\\t\\t\\t@Override\\n\\t\\t\\t\\tpublic void widgetSelected(SelectionEvent e) {\\n\\t\\t\\t\\t\\tLOG.info(\\\"Create an account\\\");\\n\\t\\t\\t\\t\\tSignInWithAuthenticationWizard wizard = (SignInWithAuthenticationWizard) getWizard();\\n\\t\\t\\t\\t\\twizard.getWizardDialog().close();\\n\\t\\t\\t\\t\\twindow.newUserAction.run();\\n\\t\\t\\t\\t\\tLOG.info(\\\"Create an account 2\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t});\\n\\t\\t\\tbtnCreateAnNew.setBounds(10, 10, 152, 25);\\n\\t\\t\\tbtnCreateAnNew.setText(\\\"Create a new account\\\");\\n\\t\\t\\tlist = new Control[] { btnCreateAnNew, usernameText,\\n\\t\\t\\t\\t\\tpasswordText };\\n\\t\\t\\tcontainer.setTabList(list);\\n\\t\\t} else {\\n\\t\\t\\tlist = new Control[] { usernameText,\\n\\t\\t\\t\\t\\tpasswordText };\\n\\t\\t\\tcontainer.setTabList(list);\\n\\t\\t}\\n\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"public void createProbleemWizard() throws InstantiationException,\\n\\t\\t\\tIllegalAccessException {\\n\\n\\t\\tif (getMelding().getProbleem() != null) {\\n\\t\\t\\tmodelRepository.evictObject(getMelding().getProbleem());\\n\\t\\t}\\n\\t\\tprobleem = null;\\n\\t\\tif (\\\"bord\\\".equals(probleemType)) {\\n\\n\\t\\t\\tif (trajectType.endsWith(\\\"Route\\\")) {\\n\\t\\t\\t\\tprobleem = (Probleem) modelRepository.createObject(\\n\\t\\t\\t\\t\\t\\t\\\"RouteBordProbleem\\\", null);\\n\\n\\t\\t\\t} else if (trajectType.contains(\\\"Netwerk\\\")) {\\n\\t\\t\\t\\tprobleem = (Probleem) modelRepository.createObject(\\n\\t\\t\\t\\t\\t\\t\\\"NetwerkBordProbleem\\\", null);\\n\\n\\t\\t\\t}\\n\\n\\t\\t} else if (\\\"ander\\\".equals(probleemType)) {\\n\\n\\t\\t\\tif (trajectType.endsWith(\\\"Route\\\")) {\\n\\t\\t\\t\\tprobleem = (Probleem) modelRepository.createObject(\\n\\t\\t\\t\\t\\t\\t\\\"RouteAnderProbleem\\\", null);\\n\\n\\t\\t\\t} else if (trajectType.contains(\\\"Netwerk\\\")) {\\n\\t\\t\\t\\tprobleem = (Probleem) modelRepository.createObject(\\n\\t\\t\\t\\t\\t\\t\\\"NetwerkAnderProbleem\\\", null);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tgetMelding().setProbleem(probleem);\\n\\t}\",\n \"public TutorialStep1() {\\n\\n }\",\n \"private void convert(IProject project, AcceleoProjectWizard wizard, IProgressMonitor monitor) {\\n \\t\\tString projectName = wizard.newProjectPage.getProjectName();\\n \\t\\tString generatorName = this.computeGeneratorName(projectName);\\n \\n \\t\\tAcceleoProject acceleoProject = AcceleowizardmodelFactory.eINSTANCE.createAcceleoProject();\\n \\t\\tacceleoProject.setName(projectName);\\n \\t\\tacceleoProject.setGeneratorName(generatorName);\\n \\n \\t\\tList<AcceleoModule> allModules = this.newAcceleoModulesCreationPage.getAllModules();\\n \\t\\tfor (AcceleoModule acceleoModule : allModules) {\\n \\t\\t\\tString parentFolder = acceleoModule.getParentFolder();\\n \\n \\t\\t\\tIProject moduleProject = ResourcesPlugin.getWorkspace().getRoot().getProject(\\n \\t\\t\\t\\t\\tacceleoModule.getProjectName());\\n \\t\\t\\tif (moduleProject.exists() && moduleProject.isAccessible()\\n \\t\\t\\t\\t\\t&& acceleoModule.getModuleElement() != null\\n \\t\\t\\t\\t\\t&& acceleoModule.getModuleElement().isIsMain()) {\\n \\t\\t\\t\\tIPath parentFolderPath = new Path(parentFolder);\\n \\t\\t\\t\\tIFolder folder = moduleProject.getFolder(parentFolderPath.removeFirstSegments(1));\\n \\t\\t\\t\\tacceleoProject.getExportedPackages().add(\\n \\t\\t\\t\\t\\t\\tfolder.getProjectRelativePath().removeFirstSegments(1).toString().replaceAll(\\\"/\\\", //$NON-NLS-1$\\n \\t\\t\\t\\t\\t\\t\\t\\t\\\"\\\\\\\\.\\\")); //$NON-NLS-1$\\n \\t\\t\\t}\\n \\t\\t}\\n \\t\\t// Prepare Ant folder\\n \\t\\tIFolder antTasksFolder = project.getFolder(\\\"tasks\\\"); //$NON-NLS-1$\\n \\t\\tif (!antTasksFolder.exists()) {\\n \\t\\t\\ttry {\\n \\t\\t\\t\\tantTasksFolder.create(true, false, monitor);\\n \\t\\t\\t} catch (CoreException e) {\\n \\t\\t\\t\\tAcceleoUIActivator.log(e, true);\\n \\t\\t\\t}\\n \\t\\t}\\n \\n \\t\\t// Generate files\\n \\t\\ttry {\\n \\t\\t\\tIProjectDescription description = project.getDescription();\\n \\t\\t\\tString[] natureIds = new String[] {IAcceleoConstants.ACCELEO_NATURE_ID,\\n \\t\\t\\t\\t\\tIAcceleoConstants.PLUGIN_NATURE_ID, IAcceleoConstants.JAVA_NATURE_ID, };\\n \\t\\t\\tdescription.setNatureIds(natureIds);\\n \\t\\t\\tproject.setDescription(description, monitor);\\n \\t\\t} catch (CoreException e) {\\n \\t\\t\\tAcceleoUIActivator.log(e, true);\\n \\t\\t}\\n \\t\\tmonitor.beginTask(AcceleoUIMessages.getString(\\\"AcceleoNewProjectWizard.Monitor\\\"), 100); //$NON-NLS-1$\\n \\t\\tmonitor.worked(10);\\n \\t\\tAcceleoUIGenerator.getDefault().generateProjectSettings(acceleoProject, project);\\n \\t\\tmonitor.worked(10);\\n \\t\\tAcceleoUIGenerator.getDefault().generateProjectClasspath(acceleoProject, project);\\n \\t\\tmonitor.worked(10);\\n \\t\\tAcceleoUIGenerator.getDefault().generateProjectManifest(acceleoProject, project);\\n \\t\\tmonitor.worked(10);\\n \\t\\tAcceleoUIGenerator.getDefault().generateBuildProperties(acceleoProject, project);\\n \\t\\tmonitor.worked(10);\\n \\t\\tAcceleoUIGenerator.getDefault().generateActivator(acceleoProject, project);\\n \\n \\t\\tfor (AcceleoModule acceleoModule : allModules) {\\n \\t\\t\\tmonitor.worked(10);\\n \\t\\t\\tString parentFolder = acceleoModule.getParentFolder();\\n \\n \\t\\t\\tIProject moduleProject = ResourcesPlugin.getWorkspace().getRoot().getProject(\\n \\t\\t\\t\\t\\tacceleoModule.getProjectName());\\n \\t\\t\\tif (moduleProject.exists() && moduleProject.isAccessible()) {\\n \\t\\t\\t\\tIPath parentFolderPath = new Path(parentFolder);\\n \\t\\t\\t\\tIFolder folder = moduleProject.getFolder(parentFolderPath.removeFirstSegments(1));\\n \\t\\t\\t\\tAcceleoUIGenerator.getDefault().generateAcceleoModule(acceleoModule, folder);\\n \\n \\t\\t\\t\\tif (acceleoModule.isIsInitialized()) {\\n \\t\\t\\t\\t\\tString initializationKind = acceleoModule.getInitializationKind();\\n \\t\\t\\t\\t\\tIAcceleoInitializationStrategy strategy = null;\\n \\t\\t\\t\\t\\tList<IAcceleoInitializationStrategy> initializationStrategy = AcceleoInitializationStrategyUtils\\n \\t\\t\\t\\t\\t\\t\\t.getInitializationStrategy();\\n \\t\\t\\t\\t\\tfor (IAcceleoInitializationStrategy iAcceleoInitializationStrategy : initializationStrategy) {\\n \\t\\t\\t\\t\\t\\tif (iAcceleoInitializationStrategy.getDescription() != null\\n \\t\\t\\t\\t\\t\\t\\t\\t&& iAcceleoInitializationStrategy.getDescription().equals(initializationKind)) {\\n \\t\\t\\t\\t\\t\\t\\tstrategy = iAcceleoInitializationStrategy;\\n \\t\\t\\t\\t\\t\\t\\tbreak;\\n \\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t}\\n \\n \\t\\t\\t\\t\\tIFile file = folder.getFile(acceleoModule.getName()\\n \\t\\t\\t\\t\\t\\t\\t+ \\\".\\\" + IAcceleoConstants.MTL_FILE_EXTENSION); //$NON-NLS-1$\\n \\t\\t\\t\\t\\tIFile exampleFile = ResourcesPlugin.getWorkspace().getRoot().getFile(\\n \\t\\t\\t\\t\\t\\t\\tnew Path(acceleoModule.getInitializationPath()));\\n \\n \\t\\t\\t\\t\\tString moduleElementKind = IAcceleoInitializationStrategy.TEMPLATE_KIND;\\n \\t\\t\\t\\t\\tif (acceleoModule.getModuleElement().getKind().equals(ModuleElementKind.QUERY)) {\\n \\t\\t\\t\\t\\t\\tmoduleElementKind = IAcceleoInitializationStrategy.QUERY_KIND;\\n \\t\\t\\t\\t\\t}\\n \\n \\t\\t\\t\\t\\tif (strategy != null && file.exists()) {\\n \\t\\t\\t\\t\\t\\ttry {\\n \\t\\t\\t\\t\\t\\t\\tstrategy.configure(moduleElementKind, acceleoModule.getModuleElement()\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t.isGenerateFile(), acceleoModule.getModuleElement().isIsMain(),\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tacceleoModule.isGenerateDocumentation());\\n \\t\\t\\t\\t\\t\\t\\tString content = strategy.getContent(exampleFile, acceleoModule.getName(),\\n \\t\\t\\t\\t\\t\\t\\t\\t\\tacceleoModule.getMetamodelURIs(), acceleoModule.getModuleElement()\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t.getParameterType());\\n \\t\\t\\t\\t\\t\\t\\tByteArrayInputStream javaStream = new ByteArrayInputStream(content\\n \\t\\t\\t\\t\\t\\t\\t\\t\\t.getBytes(\\\"UTF8\\\")); //$NON-NLS-1$\\n \\t\\t\\t\\t\\t\\t\\tfile.setContents(javaStream, true, false, new NullProgressMonitor());\\n \\t\\t\\t\\t\\t\\t} catch (CoreException e) {\\n \\t\\t\\t\\t\\t\\t\\tAcceleoUIActivator.log(e, true);\\n \\t\\t\\t\\t\\t\\t} catch (UnsupportedEncodingException e) {\\n \\t\\t\\t\\t\\t\\t\\tAcceleoUIActivator.log(e, true);\\n \\t\\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t}\\n \\t\\t\\t}\\n \\n \\t\\t}\\n \\n \\t}\",\n \"protected DummyWizardPage()\\n {\\n super( \\\"\\\" ); //$NON-NLS-1$\\n setTitle( Messages.getString( \\\"NewEntryWizard.NoConnectonSelected\\\" ) ); //$NON-NLS-1$\\n setDescription( Messages.getString( \\\"NewEntryWizard.NoConnectonSelectedDescription\\\" ) ); //$NON-NLS-1$\\n setImageDescriptor( BrowserCommonActivator.getDefault().getImageDescriptor(\\n BrowserCommonConstants.IMG_ENTRY_WIZARD ) );\\n setPageComplete( true );\\n }\",\n \"public TableEditorWizard(Table table) {\\t\\n\\t\\tcreateDialog(table);\\n\\t}\",\n \"public ButtonWizard(DialogueSystem system) {\\n this.system = system;\\n currentAction = new JLabel();\\n currentJoint = new JLabel();\\n }\",\n \"public void clickCreate() {\\n\\t\\tbtnCreate.click();\\n\\t}\",\n \"private void addNewConnection() {\\n\\t\\t IWizard wizard = new NewJmxConnectionWizard();\\n\\t\\t WizardDialog dialog = new WizardDialog(PlatformUI.getWorkbench().getActiveWorkbenchWindow().getShell(), wizard);\\n\\t\\t dialog.open();\\n\\t\\t\\n\\t}\",\n \"private void newProject()\\n\\t{\\n\\t\\tnew FenetreCreationProjet();\\n\\t}\",\n \"@Override\\n\\tpublic void create() {\\n\\t\\tAssets.load();\\n\\t\\t\\n\\t\\t//creo pantallas y cargo por defecto menuPrincipal\\n\\t\\tscreenJuego = new JuegoScreen(this);\\n\\t\\tmenuPrincipal = new MenuPrincipal(this);\\n\\t\\tsetScreen(menuPrincipal);\\n\\t}\",\n \"public WizardsTest(String testName) {\\n super(testName);\\n }\",\n \"public GuidedWizardPanel()\\r\\n\\t{\\t\\r\\n\\t\\tVerticalPanel panel = new VerticalPanel();\\r\\n\\t\\t\\r\\n\\t\\twizardPanel = new WizardPanel(panelList, groupLabels);\\r\\n\\t\\twizardPanel.addSaveListener(this);\\r\\n\\t\\tpanel.add(wizardPanel);\\r\\n\\r\\n\\t\\t// set up listener relationships\\r\\n\\t\\tsolvingForPanel.addSolvingForListener(powerPanel);\\r\\n\\t\\tsolvingForPanel.addSolvingForListener(perGroupSampleSizePanel);\\r\\n\\t\\tsolvingForPanel.addSolvingForListener(resultsPanel);\\r\\n\\t\\t// listeners for outcome measures\\r\\n\\t\\toutcomesPanel.addOutcomesListener(hypothesisIndependentPanel);\\r\\n\\t\\toutcomesPanel.addOutcomesListener(hypothesisRepeatedPanel);\\r\\n\\t\\toutcomesPanel.addOutcomesListener(meanDifferencesIndependentPanel);\\r\\n\\t\\toutcomesPanel.addOutcomesListener(meanDifferencesPanel);\\r\\n\\t\\toutcomesPanel.addOutcomesListener(variabilityIndependentPanel);\\r\\n\\t\\toutcomesPanel.addOutcomesListener(variabilityRepeatedPanel);\\r\\n\\t\\toutcomesPanel.addOutcomesListener(variabilityCovariateOutcomePanel);\\r\\n\\t\\t// listeners for predictor information\\r\\n\\t\\tcatPredictorsPanel.addPredictorsListener(relativeGroupSizePanel);\\r\\n\\t\\tcatPredictorsPanel.addPredictorsListener(hypothesisIndependentPanel);\\r\\n\\t\\tcatPredictorsPanel.addPredictorsListener(hypothesisRepeatedPanel);\\r\\n\\t\\tcatPredictorsPanel.addPredictorsListener(meanDifferencesIndependentPanel);\\r\\n\\t\\tcatPredictorsPanel.addPredictorsListener(meanDifferencesPanel);\\r\\n\\t\\t// listeners for relative group sizes\\r\\n\\t\\trelativeGroupSizePanel.addRelativeGroupSizeListener(hypothesisIndependentPanel);\\r\\n\\t\\trelativeGroupSizePanel.addRelativeGroupSizeListener(hypothesisRepeatedPanel);\\r\\n\\t\\t// listeners for baseline covariates\\r\\n\\t\\tcovariatePanel.addCovariateListener(meanDifferencesIndependentPanel);\\r\\n\\t\\tcovariatePanel.addCovariateListener(meanDifferencesPanel);\\r\\n\\t\\t// TODO: covariatePanel.addCovariateListener(meanDifferencesRepeatedPanel);\\r\\n\\t\\tcovariatePanel.addCovariateListener(hypothesisIndependentPanel);\\r\\n\\t\\tcovariatePanel.addCovariateListener(hypothesisRepeatedPanel);\\r\\n\\t\\tcovariatePanel.addCovariateListener(variabilityIndependentPanel);\\r\\n\\t\\t// TODO: covariatePanel.addCovariateListener(variabilityRepeatedPanel);\\r\\n\\t\\tcovariatePanel.addCovariateListener(variabilityCovariatePanel);\\r\\n\\t\\tcovariatePanel.addCovariateListener(variabilityCovariateOutcomePanel);\\r\\n\\t\\tcovariatePanel.addCovariateListener(optionsTestsPanel);\\r\\n\\t\\tcovariatePanel.addCovariateListener(optionsPowerMethodsPanel);\\r\\n\\t\\t// listeners for repeated measures \\r\\n\\t\\trepeatedMeasuresPanel.addRepeatedMeasuresListener(hypothesisIndependentPanel);\\r\\n\\t\\trepeatedMeasuresPanel.addRepeatedMeasuresListener(hypothesisRepeatedPanel);\\r\\n\\t\\t// listeners for hypotheses\\r\\n\\t\\thypothesisIndependentPanel.addHypothesisListener(meanDifferencesIndependentPanel);\\r\\n\\t\\thypothesisRepeatedPanel.addHypothesisListener(meanDifferencesRepeatedPanel);\\r\\n\\t\\t// group size listeners\\r\\n\\t\\trelativeGroupSizePanel.addRelativeGroupSizeListener(hypothesisIndependentPanel);\\r\\n\\t\\t// variability listeners\\r\\n\\t\\tvariabilityIndependentPanel.addVariabilityListener(variabilityCovariateOutcomePanel);\\r\\n\\t\\tvariabilityCovariatePanel.addVariabilityListener(variabilityCovariateOutcomePanel);\\r\\n\\t\\toptionsDisplayPanel.addChartOptionsListener(resultsPanel);\\r\\n\\t\\t// callbacks to fill in the power curve options screen\\r\\n\\t\\talphaPanel.addAlphaListener(optionsDisplayPanel);\\r\\n\\t\\toptionsTestsPanel.addTestListener(optionsDisplayPanel);\\r\\n\\t\\toptionsPowerMethodsPanel.addPowerMethodListener(optionsDisplayPanel);\\r\\n\\t\\toptionsPowerMethodsPanel.addQuantileListener(optionsDisplayPanel);\\r\\n\\t\\toptionsPowerMethodsPanel.addQuantileCheckboxListener(optionsDisplayPanel);\\r\\n\\t\\toptionsPowerMethodsPanel.addPowerCheckboxListener(optionsDisplayPanel);\\r\\n\\t\\tmeanDifferencesScalePanel.addBetaScaleListener(optionsDisplayPanel);\\r\\n\\t\\tperGroupSampleSizePanel.addPerGroupSampleSizeListener(optionsDisplayPanel);\\r\\n\\t\\trelativeGroupSizePanel.addRelativeGroupSizeListener(optionsDisplayPanel);\\r\\n\\t\\tvariabilityScalePanel.addSigmaScaleListener(optionsDisplayPanel);\\r\\n\\t\\t// initialize\\r\\n\\t\\tinitWidget(panel);\\r\\n\\t}\",\n \"private void challengeStartNew() {\\n FragmentManager fm = getSupportFragmentManager();\\n FragmentNewChallenge newChallenge = FragmentNewChallenge.newInstance(\\\"Titel\\\");\\n newChallenge.show(fm, \\\"fragment_start_new_challenge\\\");\\n }\",\n \"public SelectProjectWizardPage build() {\\r\\n return new SelectProjectWizardPage(this);\\r\\n }\",\n \"public String create() {\\n\\n if (log.isDebugEnabled()) {\\n log.debug(\\\"create()\\\");\\n }\\n FacesContext context = FacesContext.getCurrentInstance();\\n StringBuffer sb = registration(context);\\n sb.append(\\\"?action=Create\\\");\\n forward(context, sb.toString());\\n return (null);\\n\\n }\",\n \"public CreateAccount() {\\n initComponents();\\n selectionall();\\n }\",\n \"NewAccountPage openNewAccountPage();\",\n \"public static AddNewScheduleDialog createInstance(int quantity){\\n AddNewScheduleDialog frag = new AddNewScheduleDialog();\\n frag.quantity = quantity;\\n return frag;\\n }\",\n \"@Override\\n public List<UpdatableItem> createPopup() {\\n final List<UpdatableItem> items = new ArrayList<UpdatableItem>();\\n \\n /* host wizard */\\n final MyMenuItem newHostWizardItem =\\n new MyMenuItem(Tools.getString(\\\"EmptyBrowser.NewHostWizard\\\"),\\n HOST_ICON,\\n null,\\n new AccessMode(ConfigData.AccessType.RO, false),\\n new AccessMode(ConfigData.AccessType.RO, false)) {\\n private static final long serialVersionUID = 1L;\\n \\n @Override\\n public String enablePredicate() {\\n return null;\\n }\\n \\n @Override\\n public void action() {\\n final AddHostDialog dialog = new AddHostDialog(new Host());\\n dialog.showDialogs();\\n }\\n };\\n items.add(newHostWizardItem);\\n Tools.getGUIData().registerAddHostButton(newHostWizardItem);\\n return items;\\n }\",\n \"@Test(groups=\\\"smokesuits\\\",retryAnalyzer =com.crm.autodesk.GenericUtility.RetryAnalyzer.class )\\n\\tpublic void CreateLeadTest() throws Throwable {\\n\\t\\tHomePage homepage = new HomePage(driver);\\n\\t\\thomepage.clickOnLead();\\n\\t\\t// navigate to create lead\\n\\t\\tLeadPage leadp = new LeadPage(driver);\\n\\t\\t// click on create lead\\n\\t\\tleadp.clickCreateLeadImg();\\n\\t\\tleadp.clickCancel();\\n\\t\\t\\n\\t}\",\n \"@Override\\n public Step createStep(int position) {\\n switch (position) {\\n case 0:\\n // FIRST FRAGMENT OF STEPPER: DETAILS //\\n final StepperDetails step1 = new StepperDetails();\\n Bundle b1 = new Bundle();\\n b1.putInt(CURRENT_STEP_POSITION_KEY, position);\\n step1.setArguments(b1);\\n return step1;\\n case 1:\\n // SECOND FRAGMENT OF STEPPER: MOUNT DEVICE //\\n final StepperMountDevice step2 = new StepperMountDevice();\\n Bundle b2 = new Bundle();\\n b2.putInt(CURRENT_STEP_POSITION_KEY, position);\\n step2.setArguments(b2);\\n return step2;\\n case 2:\\n // THIRD FRAGMENT OF STEPPER: CALIBRATION INFO //\\n final StepperCalibration step3 = new StepperCalibration();\\n Bundle b3 = new Bundle();\\n b3.putInt(CURRENT_STEP_POSITION_KEY, position);\\n step3.setArguments(b3);\\n return step3;\\n }\\n return null;\\n }\",\n \"public CreateProjectPanel() {\\n isFinished = true;\\n }\",\n \"private void createFirstPage() {\\n BooleanSupplier showWelcomePage = () -> !FirstRunStatus.shouldSkipWelcomePage();\\n mPages.add(new FirstRunPage<>(SigninFirstRunFragment.class, showWelcomePage));\\n mFreProgressStates.add(MobileFreProgress.WELCOME_SHOWN);\\n mPagerAdapter = new FirstRunPagerAdapter(FirstRunActivity.this, mPages);\\n mPager.setAdapter(mPagerAdapter);\\n // Other pages will be created by createPostNativeAndPoliciesPageSequence() after\\n // native and policy service have been initialized.\\n }\",\n \"public String actionCreateNew() {\\r\\n \\t\\tsetBook(new Book());\\r\\n \\t\\treturn \\\"new\\\";\\r\\n \\t}\",\n \"public Reqif10ModelWizardNewFileCreationPage(String pageId, IStructuredSelection selection) {\\r\\n \\t\\t\\tsuper(pageId, selection);\\r\\n \\t\\t}\",\n \"public ProjectWizardModel(WizardDescriptor wiz, String wizType) {\\n super(wiz,wizType);\\n }\",\n \"public interface IWizardPage extends IDialogPage {\\r\\n\\t/**\\r\\n\\t * Returns whether the next page could be displayed.\\r\\n\\t *\\r\\n\\t * @return <code>true</code> if the next page could be displayed,\\r\\n\\t * and <code>false</code> otherwise\\r\\n\\t */\\r\\n\\tpublic boolean canFlipToNextPage();\\r\\n\\r\\n\\t/**\\r\\n\\t * Returns this page's name.\\r\\n\\t *\\r\\n\\t * @return the name of this page\\r\\n\\t */\\r\\n\\tpublic String getName();\\r\\n\\r\\n\\t/**\\r\\n\\t * Returns the wizard page that would to be shown if the user was to\\r\\n\\t * press the Next button.\\r\\n\\t *\\r\\n\\t * @return the next wizard page, or <code>null</code> if none\\r\\n\\t */\\r\\n\\tpublic IWizardPage getNextPage();\\r\\n\\r\\n\\t/**\\r\\n\\t * Returns the wizard page that would to be shown if the user was to\\r\\n\\t * press the Back button.\\r\\n\\t *\\r\\n\\t * @return the previous wizard page, or <code>null</code> if none\\r\\n\\t */\\r\\n\\tpublic IWizardPage getPreviousPage();\\r\\n\\r\\n\\t/**\\r\\n\\t * Returns the wizard that hosts this wizard page.\\r\\n\\t *\\r\\n\\t * @return the wizard, or <code>null</code> if this page has not been\\r\\n\\t * added to any wizard\\r\\n\\t * @see #setWizard\\r\\n\\t */\\r\\n\\tpublic IWizard getWizard();\\r\\n\\r\\n\\t/**\\r\\n\\t * Returns whether this page is complete or not.\\r\\n\\t * <p>\\r\\n\\t * This information is typically used by the wizard to decide\\r\\n\\t * when it is okay to finish.\\r\\n\\t * </p>\\r\\n\\t *\\r\\n\\t * @return <code>true</code> if this page is complete, and\\r\\n\\t * <code>false</code> otherwise\\r\\n\\t */\\r\\n\\tpublic boolean isPageComplete();\\r\\n\\r\\n\\t/**\\r\\n\\t * Sets the wizard page that would typically be shown\\r\\n\\t * if the user was to press the Back button.\\r\\n\\t * <p>\\r\\n\\t * This method is called by the container.\\r\\n\\t * </p>\\r\\n\\t *\\r\\n\\t * @param page the previous wizard page\\r\\n\\t */\\r\\n\\tpublic void setPreviousPage(IWizardPage page);\\r\\n\\r\\n\\t/**\\r\\n\\t * Sets the wizard that hosts this wizard page.\\r\\n\\t * Once established, a page's wizard cannot be changed\\r\\n\\t * to a different wizard.\\r\\n\\t *\\r\\n\\t * @param newWizard the wizard\\r\\n\\t * @see #getWizard\\r\\n\\t */\\r\\n\\tpublic void setWizard(IWizard newWizard);\\r\\n}\",\n \"public String createQuiz() {\\n quiz = quizEJB.createQuiz(quiz);\\n quizList = quizEJB.listQuiz();\\n FacesContext.getCurrentInstance().addMessage(\\\"successForm:successInput\\\", new FacesMessage(FacesMessage.SEVERITY_INFO, \\\"Success\\\", \\\"New record added successfully\\\"));\\n return \\\"quiz-list.xhtml\\\";\\n }\",\n \"CdapCreateAppStep createCdapCreateAppStep();\",\n \"public NewReactionAcquisitionWizardPage() {\\n\\t\\tsuper(\\\"SpectrumWizardPage\\\");\\n\\t\\tsetTitle(\\\"Predicted from MEDEA wizard\\\");\\n\\t\\tsetDescription(\\\"This wizard specifies he name of the file of the\\\" +\\n\\t\\t\\t\\t\\\"predicted reaction. It is need to have into this folder other \\\" +\\n\\t\\t\\t\\t\\\"folder with the name: -\\\");\\n\\t}\",\n \"@Override\\r\\n\\tpublic void createControl(Composite parent) {\\n\\t\\t\\r\\n\\t\\tComposite container = new Composite(parent, SWT.NONE);\\r\\n\\t\\tGridData gd = new GridData(GridData.FILL_HORIZONTAL);\\r\\n\\t\\tcontainer.setLayout(new GridLayout(2, false));\\r\\n\\t\\t\\r\\n\\t\\tLabel nameLabel = new Label(container, SWT.NULL);\\r\\n\\t\\tnameText = new Text(container, SWT.BORDER | SWT.SINGLE);\\r\\n\\t\\tnameLabel.setText(BundleInternationalization.getString(\\\"NameLabel\\\")+\\\":\\\");\\r\\n\\t\\tnameText.setLayoutData(gd);\\r\\n\\t\\t// Listener to validate the project name when user finishes writing\\r\\n\\t\\tnameText.addModifyListener(new ModifyListener() {\\r\\n\\t\\t\\tpublic void modifyText(ModifyEvent e) {\\r\\n\\t\\t\\t\\twizardChanged();\\r\\n\\t\\t\\t}\\r\\n\\t\\t});\\r\\n\\t\\t\\r\\n\\t\\tLabel descriptionLabel = new Label(container, SWT.NULL);\\r\\n\\t\\tdescriptionText = new Text(container, SWT.BORDER | SWT.SINGLE);\\r\\n\\t\\tdescriptionLabel.setText(BundleInternationalization.getString(\\\"DescriptionLabel\\\")+\\\":\\\");\\r\\n\\t\\tdescriptionText.setLayoutData(gd);\\r\\n\\t\\t// Listener to validate the project description when user finishes writing\\r\\n\\t\\tdescriptionText.addModifyListener(new ModifyListener() {\\r\\n\\t\\t\\tpublic void modifyText(ModifyEvent e) {\\r\\n\\t\\t\\t\\twizardChanged();\\r\\n\\t\\t\\t}\\r\\n\\t\\t});\\t\\t\\r\\n\\t\\t\\r\\n\\t\\tLabel startDateLabel = new Label(container, SWT.NULL);\\r\\n\\t\\tstartDateText = new DateTime(container, SWT.DATE | SWT.BORDER | SWT.SINGLE);\\r\\n\\t\\tstartDateLabel.setText(BundleInternationalization.getString(\\\"StartDateLabel\\\")+\\\":\\\");\\t\\r\\n\\t\\tstartDateText.setLayoutData(gd);\\r\\n\\t\\t\\r\\n\\r\\n\\t\\tLabel endDateLabel = new Label(container, SWT.NULL);\\r\\n\\t\\tendDateText = new DateTime(container, SWT.DATE | SWT.BORDER | SWT.SINGLE);\\r\\n\\t\\tendDateLabel.setText(BundleInternationalization.getString(\\\"EndDateLabel\\\")+\\\":\\\");\\t\\r\\n\\t\\tendDateText.setLayoutData(gd);\\r\\n\\t\\t\\r\\n\\t\\tLabel budgetLabel = new Label(container, SWT.NULL);\\r\\n\\t\\tbudgetText = new Text(container, SWT.BORDER | SWT.SINGLE);\\r\\n\\t\\tbudgetLabel.setText(BundleInternationalization.getString(\\\"BudgetLabel\\\")+\\\":\\\");\\r\\n\\t\\tbudgetText.setLayoutData(gd);\\r\\n\\t\\tbudgetText.addListener (SWT.Verify, new Listener () {\\r\\n public void handleEvent (Event event) {\\r\\n \\tvalidateDouble(event);\\r\\n }\\r\\n\\t\\t}); \\r\\n\\t\\tbudgetText.addModifyListener(new ModifyListener() {\\r\\n\\t\\t\\tpublic void modifyText(ModifyEvent e) {\\r\\n\\t\\t\\t\\twizardChanged();\\r\\n\\t\\t\\t}\\r\\n\\t\\t});\\r\\n\\t\\t\\r\\n\\t\\tLabel quantityLinesLabel = new Label(container, SWT.NULL);\\r\\n\\t\\tquantityLinesText = new Text(container, SWT.BORDER | SWT.SINGLE);\\r\\n\\t\\tquantityLinesLabel.setText(BundleInternationalization.getString(\\\"NumberCodeLinesLabel\\\")+\\\":\\\");\\r\\n\\t\\tquantityLinesText.setLayoutData(gd);\\r\\n\\t\\tquantityLinesText.addListener (SWT.Verify, new Listener () {\\r\\n public void handleEvent (Event event) {\\r\\n \\tvalidateInt(event);\\r\\n }\\r\\n\\r\\n\\t\\t});\\r\\n\\t\\tquantityLinesText.addModifyListener(new ModifyListener() {\\r\\n\\t\\t\\tpublic void modifyText(ModifyEvent e) {\\r\\n\\t\\t\\t\\twizardChanged();\\r\\n\\t\\t\\t}\\r\\n\\t\\t});\\r\\n\\t\\t\\r\\n\\t\\tLabel domainLabel = new Label(container, SWT.NULL);\\r\\n\\t\\tdomainText = new Text(container, SWT.BORDER | SWT.SINGLE);\\r\\n\\t\\tdomainLabel.setText(BundleInternationalization.getString(\\\"DomainLabel\\\")+\\\":\\\");\\r\\n\\t\\tdomainText.setLayoutData(gd);\\r\\n\\t\\t// Listener to validate the domain text when user finishes writing\\r\\n\\t\\tdomainText.addModifyListener(new ModifyListener() {\\r\\n\\t\\t\\tpublic void modifyText(ModifyEvent e) {\\r\\n\\t\\t\\t\\twizardChanged();\\r\\n\\t\\t\\t}\\r\\n\\t\\t});\\r\\n\\t\\t\\r\\n\\t\\tLabel progLanguageLabel = new Label(container, SWT.NULL);\\r\\n\\t\\tprogLanguageCombo = new Combo(container, SWT.DROP_DOWN | SWT.READ_ONLY);\\r\\n\\t\\tprogLanguageLabel.setText(BundleInternationalization.getString(\\\"ProgrammingLanguageLabel\\\")+\\\":\\\");\\r\\n\\t\\t// progLanguageCombo.setLayoutData(gd);\\t\\r\\n\\t\\tprogLanguageCombo.setItems (new String [] {\\\"Java\\\", \\\"Ada\\\", \\\"C++\\\", \\\"C#\\\", \\\"Cobol\\\", \\\"ASP\\\", \\\"JSP\\\"});\\r\\n\\t\\tprogLanguageCombo.addSelectionListener(new SelectionAdapter() {\\r\\n\\t\\t\\t@Override\\r\\n\\t\\t\\tpublic void widgetSelected(SelectionEvent e) {\\r\\n\\t\\t\\t\\twizardChanged();\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t});\\r\\n\\t\\t\\r\\n\\t\\tLabel estimatedHoursLabel = new Label(container, SWT.NULL);\\r\\n\\t\\testimatedHoursText = new Text(container, SWT.BORDER | SWT.SINGLE);\\r\\n\\t\\testimatedHoursLabel.setText(BundleInternationalization.getString(\\\"EstimatedHoursLabel\\\")+\\\":\\\");\\r\\n\\t\\testimatedHoursText.setLayoutData(gd);\\r\\n\\t\\testimatedHoursText.addListener (SWT.Verify, new Listener () {\\r\\n public void handleEvent (Event event) {\\r\\n \\tvalidateInt(event);\\r\\n }\\r\\n\\r\\n\\t\\t});\\r\\n\\t\\testimatedHoursText.addModifyListener(new ModifyListener() {\\r\\n\\t\\t\\tpublic void modifyText(ModifyEvent e) {\\r\\n\\t\\t\\t\\twizardChanged();\\r\\n\\t\\t\\t}\\r\\n\\t\\t});\\r\\n\\t\\t\\r\\n\\t\\twizardChanged();\\r\\n\\t\\tsetControl(container);\\r\\n\\r\\n\\t}\",\n \"public ProjectWizardModel(WizardDescriptor wiz) {\\n this(wiz, PROJECT_WIZARD_TYPE );\\n }\",\n \"public void initialize(TemplateWizard wiz) {\\n this.wizard = wiz;\\n }\",\n \"public WizardPanel(String wizardTitle, String wizardDescription, Icon wizardIcon, Icon welcomeIcon, Dimension wizarddimensions,\\n\\t\\t\\tJLabel welcomeLabel) {\\n\\t\\tthis.wizardIcon = wizardIcon;\\n\\t\\tthis.welcomeTitle = wizardTitle;\\n\\t\\tthis.welcomeDescription = wizardDescription;\\n\\t\\twelcomePage = new WizardWelcomePanel(welcomeTitle, welcomeDescription, welcomeIcon, welcomeLabel);\\n\\t\\tthis.finishedPage = new WizardFinishPanel();\\n\\t\\tfinishedPage.setIcon(welcomeIcon);\\n\\t\\ttry {\\n\\t\\t\\tjbInit();\\n\\t\\t} catch (Exception ex) {\\n\\t\\t\\tex.printStackTrace();\\n\\t\\t}\\n\\t}\",\n \"private void createRoutine() {\\n String s = (String) JOptionPane.showInputDialog(\\n this,\\n \\\"Name the new routine:\\\",\\n \\\"Create new\\\",\\n JOptionPane.PLAIN_MESSAGE,\\n null, null, null);\\n\\n if (s != null) {\\n Routine r = new Routine(s);\\n collection.add(r);\\n listModel.addElement(r);\\n list.setSelectedValue(r, true);\\n new WorkoutsFrame(r);\\n }\\n }\",\n \"public void create(){}\",\n \"public StepsFragment() {\\n }\",\n \"public void saveAndCreateNew() throws Exception {\\n\\t\\topenPrimaryButtonDropdown();\\n\\t\\tgetControl(\\\"saveAndCreateNewButton\\\").click();\\n\\t}\",\n \"public void goToCreate(View view) {\\n Intent intent = new Intent(this, CreateAccountActivity.class);\\n startActivity(intent);\\n }\",\n \"public WizardEngine(GameOptions go) {\\r\\n\\t\\tsuper();\\r\\n\\t\\tthis.go = go;\\r\\n\\t\\tcardFinder = new WizardCardFinder();\\r\\n\\t\\t//cardFinder = new PokerCardFinder();\\r\\n\\t}\",\n \"public CreateAccountPanel() {\\n initComponents();\\n initializeDateChooser();\\n }\",\n \"public LandingPage registerNewAccount(){\\n\\t\\taction.WaitForWebElement(linkRegisterNewAccount)\\n\\t\\t\\t .Click(linkRegisterNewAccount);\\n\\t\\treturn this;\\n\\t}\",\n \"@Override\\n public String createRecord(String creatingPage) {\\n return creatingPage;\\n }\",\n \"protected void creaPagine() {\\n Pagina pag;\\n Pannello pan;\\n\\n try { // prova ad eseguire il codice\\n\\n /* crea la pagina e aggiunge campi e pannelli */\\n pag = this.addPagina(\\\"generale\\\");\\n\\n pan = PannelloFactory.orizzontale(this);\\n pan.add(Cam.data);\\n pan.add(Cam.importo.get());\\n pan.add(Cam.note.get());\\n pag.add(pan);\\n\\n } catch (Exception unErrore) { // intercetta l'errore\\n Errore.crea(unErrore);\\n }// fine del blocco try-catch\\n\\n }\",\n \"private void setupCreateCourse() {\\n\\t\\tmakeButton(\\\"Create Course\\\", (ActionEvent e) -> {\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tString[] inputs = getInputs(new String[] { \\\"Name:\\\", \\\"Number:\\\" });\\n\\t\\t\\t\\tif (inputs == null)\\n\\t\\t\\t\\t\\treturn;\\n\\n\\t\\t\\t\\tint num = Integer.parseInt(inputs[1]);\\n\\t\\t\\t\\tadCon.createCourse(inputs[0], num);\\n\\t\\t\\t\\tupdateCourses();\\n\\t\\t\\t} catch (NumberFormatException ex) {\\n\\t\\t\\t\\tJOptionPane.showMessageDialog(getRootPane(), \\\"Course number must be a number\\\", \\\"Error\\\",\\n\\t\\t\\t\\t\\t\\tJOptionPane.OK_OPTION);\\n\\t\\t\\t}\\n\\t\\t});\\n\\t}\",\n \"public ElegirTipoBienWizard(String locale)\\r\\n {\\r\\n \\t this.locale=locale;\\r\\n try{\\r\\n initComponents();\\r\\n renombrarComponentes();\\r\\n \\r\\n } catch (Exception e){\\r\\n logger.error(\\\"Error al importar actividades economicas\\\",e);\\r\\n }\\r\\n }\",\n \"@Override\\n public void storeSettings(WizardDescriptor wiz) {\\n wiz.putProperty(NewDetectorWizardAction.PROP_NAME_CREATE_VIA_TEMPLATE, getComponent().getViaDetectorTemplate().isSelected());\\n wiz.putProperty(PROP_NAME_DETECTOR_NAME, getComponent().getDetectorName().getText());\\n wiz.putProperty(PROP_NAME_DETECTOR_DESCRIPTION, getComponent().getDetectorDescription().getText());\\n wiz.putProperty(WizardDescriptor.PROP_ERROR_MESSAGE, null);\\n }\",\n \"private void doCreateNewPartner() {\\n Scanner sc = new Scanner(System.in);\\n System.out.println(\\\"***Hors Management System:: System Administration:: Create new partner\\\");\\n Partner partner = new Partner();\\n System.out.print(\\\"Enter partner username:\\\");\\n partner.setName(sc.nextLine().trim());\\n System.out.print(\\\"Enter partner password;\\\");\\n partner.setPassword(sc.nextLine().trim());\\n\\n Set<ConstraintViolation<Partner>> constraintViolations = validator.validate(partner);\\n\\n if (constraintViolations.isEmpty()) {\\n partner = partnerControllerRemote.createNewPartner(partner);\\n System.out.println(\\\"New partner created successfully\\\");\\n } else {\\n showInputDataValidationErrorsForPartner(constraintViolations);\\n }\\n\\n }\",\n \"@FXML\\n private void goToCreateProgram(ActionEvent event) throws IOException {\\n\\n CreateProgramController createProgramController = new CreateProgramController();\\n Program programEntity = createProgramController.openView(event);\\n createProgram.setSelected(false);\\n if (programEntity != null && programListController != null)\\n {\\n if (programListController.listOfPrograms != null)\\n {\\n programListController.listOfPrograms.add(programEntity);\\n programListController.updateProgramList();\\n UsermanagementUtilities.setFeedback(event,\\\"The program was created\\\",true);\\n }\\n } else {\\n UsermanagementUtilities.setFeedback(event,\\\"The program was not created\\\",false);\\n }\\n }\",\n \"public BJADWizard<T> getWizard()\\n {\\n return this.wizard;\\n }\",\n \"private void AddNewScenario(HttpServletRequest request, HttpServletResponse response) {\\n XMLTree.getInstance().AddNewScenario();\\n }\",\n \"public void testGetDialog() {\\n System.out.println(\\\"getDialog\\\");\\n Wizard instance = new Wizard();\\n JDialog result = instance.getDialog();\\n assertNotNull(result);\\n }\",\n \"Dashboard createDashboard();\",\n \"public void switchToCreateAccount() {\\r\\n\\t\\tlayout.show(this, \\\"createPane\\\");\\r\\n\\t\\trevalidate();\\r\\n\\t\\trepaint();\\r\\n\\t}\",\n \"protected void createPages() {\\n\\t\\tcreateIntroEditor();\\n\\t\\tcreatePageMainEditor();\\n\\t\\tcreatePageController();\\n\\t\\tcreateCssEditor();\\n\\t\\tcreatePageTextEditor();\\n\\t\\trefreshPageMainEditor();\\n\\t\\trefreshPageControllerEditor();\\n\\t\\trefreshCssEditor();\\n\\t\\tsetDirty(false);\\n\\t}\",\n \"public boolean createLesson() {\\n\\t\\treturn false;\\n\\t}\",\n \"protected void setWizard(BJADWizard<T> wizard)\\n {\\n this.wizard = wizard;\\n }\",\n \"public JaxWsClientCreator(Project project, WizardDescriptor wiz) {\\n this.project = project;\\n this.wiz = wiz;\\n }\",\n \"public void create() {\\n\\t\\t\\n\\t}\",\n \"public WizardPanel(String wizardTitle, String wizardDescription, Icon wizardIcon, Icon welcomeIcon,\\n\\t\\t\\tDimension wizarddimensions) {\\n\\t\\tthis(wizardTitle, wizardDescription, wizardIcon, welcomeIcon, wizarddimensions, null);\\n\\t}\",\n \"public SlingHttpResponse createPage(String pageLabel, String pageTitle, String parentPath, String templatePath, int... expectedStatus)\\n throws ClientException {\\n FormEntityBuilder feb = FormEntityBuilder.create()\\n .addParameter(\\\"cmd\\\", CMD_CREATE_PAGE)\\n .addParameter(\\\"parentPath\\\", parentPath)\\n .addParameter(\\\"label\\\", pageLabel)\\n .addParameter(\\\"title\\\", pageTitle)\\n .addParameter(\\\"template\\\", templatePath);\\n\\n return executeWCMCommand(CMD_CREATE_PAGE, feb, expectedStatus);\\n }\",\n \"public void widgetSelected(SelectionEvent arg0) {\\n\\t\\t\\t\\tIWorkbenchWizard wizard = new BasicNewProjectResourceWizard();\\r\\n\\t\\t\\t\\twizard.init(PlatformUI.getWorkbench(), new TreeSelection());\\r\\n\\t\\t\\t\\tWizardDialog dialog = new WizardDialog(getShell(), wizard);\\r\\n\\t\\t\\t\\tdialog.open();\\r\\n\\t\\t\\t\\tif (outputChooserTreeViewer.getTree().getItemCount() == 1) {\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tvalidatePage();\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\",\n \"@Command\\n public void nuevaMateria() {\\n\\t\\t\\n\\t\\tWindow window = (Window)Executions.createComponents(\\n \\\"/WEB-INF/include/Mantenimiento/Materias/vtnMaterias.zul\\\", null, null);\\n window.doModal();\\n }\",\n \"FORM createFORM();\",\n \"public boolean[] showLinearWizard(List<Admin> admins, AdminService adminService) {\\n\\n // define pages to show\\n Wizard wizard = new Wizard();\\n wizard.setTitle(\\\"System Setup Configuration\\\");\\n\\n // --- page 1\\n int row = 0;\\n\\n GridPane page1Grid = new GridPane();\\n page1Grid.setVgap(10);\\n page1Grid.setHgap(10);\\n\\n ObservableList<String> adminNames = FXCollections.observableArrayList();\\n ChoiceBox<String> allAdmins = new ChoiceBox<>(adminNames);\\n\\n if (!admins.isEmpty()) {\\n page1Grid.add(new Label(\\\"All Admins :\\\"), 0, row);\\n for (Admin a : admins) {\\n adminNames.add(a.getAdminName());\\n }\\n page1Grid.add(allAdmins, 1, row++);\\n }\\n\\n page1Grid.add(new Label(\\\"Admin :\\\"), 0, row);\\n final TextField userTF = createTextField(\\\"adminName\\\");\\n page1Grid.add(userTF, 1, row++);\\n\\n page1Grid.add(new Label(\\\"Password :\\\"), 0, row);\\n final TextField passTF = createTextField(\\\"password\\\");\\n // Set initial state\\n passTF.setManaged(false);\\n passTF.setVisible(false);\\n page1Grid.add(passTF, 1, row);\\n\\n final PasswordField passPF = new PasswordField();\\n passPF.setId(\\\"password\\\");\\n GridPane.setHgrow(passPF, Priority.ALWAYS);\\n page1Grid.add(passPF, 1, row);\\n\\n CheckBox checkBox = new CheckBox(\\\"Show/Hide password\\\");\\n page1Grid.add(checkBox, 1, ++row);\\n\\n // Bind properties. Toggle textField and passwordField\\n // visibility and manageability properties mutually when checkbox's state is changed.\\n // Because we want to display only one component (textField or passwordField)\\n // on the scene at a time.\\n passTF.managedProperty().bind(checkBox.selectedProperty());\\n passTF.visibleProperty().bind(checkBox.selectedProperty());\\n\\n passPF.managedProperty().bind(checkBox.selectedProperty().not());\\n passPF.visibleProperty().bind(checkBox.selectedProperty().not());\\n\\n // Bind the textField and passwordField text values bidirectionally.\\n passTF.textProperty().bindBidirectional(passPF.textProperty());\\n\\n WizardPane page1 = new WizardPane() {\\n\\n @Override\\n public void onEnteringPage(Wizard wizard) {\\n if (!admins.isEmpty()) {\\n System.out.println(\\\"Skipped!\\\");\\n } else {\\n for (ButtonType type : getButtonTypes()) {\\n if (type.getButtonData().equals(ButtonBar.ButtonData.NEXT_FORWARD)) {\\n Node next = lookupButton(type);\\n Platform.runLater(() -> next.setDisable(true));\\n userTF.textProperty().addListener((observable, oldValue, newValue) -> next.setDisable(newValue.trim().isEmpty() || passPF.getText().isEmpty()));\\n passPF.textProperty().addListener((observable, oldValue, newValue) -> next.setDisable(newValue.trim().isEmpty() || userTF.getText().isEmpty()));\\n } else if (type.getButtonData().equals(ButtonBar.ButtonData.CANCEL_CLOSE)) {\\n Node cancel = lookupButton(type);\\n Platform.runLater(() -> cancel.setVisible(false));\\n } else if (type.getButtonData().equals(ButtonBar.ButtonData.BACK_PREVIOUS)) {\\n Node previous = lookupButton(type);\\n Platform.runLater(() -> previous.setVisible(false));\\n }\\n }\\n }\\n }\\n\\n @Override\\n public void onExitingPage(Wizard wizard) {\\n\\n String adminName = (String) wizard.getSettings().get(\\\"adminName\\\");\\n String pass = (String) wizard.getSettings().get(\\\"password\\\");\\n\\n Validation validation = new Validation();\\n if (!admins.isEmpty() && adminName.isEmpty() && pass.isEmpty()) {\\n System.out.println(\\\"Skipped!\\\");\\n } else {\\n if (validation.emptyValidation(userTF, \\\"Admin\\\", adminName.isEmpty()) &&\\n validation.emptyValidation(passTF, \\\"Password\\\", pass.isEmpty())) {\\n //save\\n if (adminNames.isEmpty()) {\\n Admin admin = new Admin();\\n admin.setAdminName(adminName);\\n admin.setPassword(pass);\\n\\n adminService.save(admin);\\n\\n adminNames.add(adminName);\\n admins.add(admin);\\n } else {\\n for (Admin existingAdmin : admins) {\\n //update\\n if (!existingAdmin.getAdminName().equals(adminName) || !existingAdmin.getPassword().equals(pass)) {\\n boolean yesIdo = CommonUtils.confirmMessage(\\\"Are you Sure?\\\", \\\"Warning: Admin Credentials Changed! \\\", \\\"Do you really want to update Admin Details?\\\");\\n if (yesIdo) {\\n existingAdmin.setAdminName(adminName);\\n existingAdmin.setPassword(pass);\\n adminService.update(existingAdmin);\\n } else {\\n userTF.setText(existingAdmin.getAdminName());\\n passTF.setText(existingAdmin.getPassword());\\n }\\n break;\\n }\\n }\\n }\\n } else {\\n wizard.getSettings().put(\\\"adminName\\\", \\\"\\\");\\n }\\n }\\n }\\n };\\n String adminHeaderTest;\\n if (admins.isEmpty()) {\\n adminHeaderTest = \\\"No Admin Found. \\\\nPlease add new Admin Details.\\\";\\n } else {\\n adminHeaderTest = \\\"Admin Details!\\\";\\n }\\n page1.setHeaderText(adminHeaderTest);\\n page1.setContent(page1Grid);\\n\\n allAdmins.getSelectionModel().\\n\\n selectedIndexProperty().\\n\\n addListener((observableValue, oldIndex, newIndex) ->\\n\\n {\\n if (newIndex != null) {\\n Admin existingAdmin = adminService.findByAdminName(allAdmins.getItems().get((Integer) newIndex));\\n userTF.setText(existingAdmin.getAdminName());\\n passTF.setText(existingAdmin.getPassword());\\n }\\n });\\n\\n GridPane page3Grid = new GridPane();\\n page3Grid.setVgap(10);\\n page3Grid.setHgap(10);\\n\\n ImageView imageView = new ImageView();\\n imageView.setFitHeight(100);\\n imageView.setPreserveRatio(true);\\n imageView.setImage(CommonUtils.getLogoImage());\\n imageView.setSmooth(true);\\n\\n page3Grid.add(imageView, 0, 0, 1, 3);\\n\\n page3Grid.add(new\\n\\n Label(\\\"Name :\\\"), 1, 0);\\n page3Grid.add(new\\n\\n Label(\\\"Address:\\\"), 1, 1);\\n page3Grid.add(new\\n\\n Label(\\\"Contact:\\\"), 1, 2);\\n\\n\\n ChoiceBox<String> systemNameCB = new ChoiceBox<>(systemNames);\\n systemNameCB.setId(\\\"churchName\\\");\\n GridPane.setHgrow(systemNameCB, Priority.ALWAYS);\\n systemNameCB.getSelectionModel().select(ConfigReader.getSystemIndex());\\n page3Grid.add(systemNameCB, 2, 0);\\n\\n TextField systemAddress = createTextField(\\\"churchAddress\\\");\\n systemAddress.setPromptText(\\\"Eg. Kalanki, Kathmandu\\\");\\n systemAddress.setText(ConfigReader.getSystemAddress());\\n page3Grid.add(systemAddress, 2, 1);\\n\\n TextField systemContact = createTextField(\\\"churchContact\\\");\\n systemContact.setPromptText(\\\"Eg. 01-4XXXXXX\\\");\\n systemContact.setText(ConfigReader.getSystemContact());\\n page3Grid.add(systemContact, 2, 2);\\n\\n // --- page 3\\n WizardPane page3 = new WizardPane();\\n page3.setHeaderText(\\\"Church Details!\\\");\\n\\n page3.setContentText(\\\"Please provide Church Name and photo!\\\\nNote: Changes will be active after Restart only.\\\");\\n page3.setContent(page3Grid);\\n\\n ButtonType photoDialogButton = new ButtonType(\\\"Change Logo\\\", ButtonBar.ButtonData.HELP_2);\\n page3.getButtonTypes().\\n\\n add(photoDialogButton);\\n\\n Button photoButton = (Button) page3.lookupButton(photoDialogButton);\\n photoButton.setStyle(\\\"-fx-background-color: DODGERBLUE;\\\");\\n photoButton.setTextFill(Color.WHITE);\\n photoButton.addEventFilter(ActionEvent.ACTION, actionEvent ->\\n\\n {\\n actionEvent.consume(); // stop hello.dialog from closing\\n getImage();\\n imageView.setImage(CommonUtils.getLogoImage());\\n });\\n\\n // create wizard\\n wizard.setFlow(new Wizard.LinearFlow(page1, page3));\\n\\n // show wizard and wait for response\\n wizard.showAndWait().\\n\\n ifPresent(result ->\\n\\n {\\n if (result == ButtonType.FINISH) {\\n try {\\n String[] currentChurchDetails = new String[]{String.valueOf(ConfigReader.getSystemIndex()), ConfigReader.getSystemAddress(), ConfigReader.getSystemContact()};\\n String[] newChurchDetails = new String[]{String.valueOf(systemNameCB.getSelectionModel().getSelectedIndex()), systemAddress.getText(), systemContact.getText()};\\n if (!Arrays.equals(currentChurchDetails, newChurchDetails)) {\\n ConfigReader.setSystemDetails(newChurchDetails);\\n churchDetailsChanged[1] = true;\\n }\\n } catch (IOException e) {\\n e.printStackTrace();\\n }\\n }\\n });\\n\\n return churchDetailsChanged;\\n }\",\n \"private void toCreateAcc() {\\n Intent intent = new Intent(this, WelcomeActivity.class);\\n startActivity(intent);\\n }\",\n \"public static void createNewLeague()\\n\\t{\\n\\t\\t//put code to get input from end-user here.\\n\\t\\t//generateFixtures(leagueName, teamAmount, homeAndAway, winPoints, drawPoints, lossPoints, teamNames);\\n\\t}\",\n \"public Create_Course() {\\n initComponents();\\n comboBoxLec();\\n comboBoxDep();\\n }\",\n \"private void actionNewProject ()\\r\\n\\t{\\r\\n\\t\\ttry\\r\\n\\t\\t{\\r\\n\\t\\t\\tDataController.scenarioNewProject();\\r\\n\\r\\n\\t\\t\\thelperDisplayProjectFiles();\\r\\n\\r\\n\\t\\t\\t//---- Change button icon\\r\\n\\t\\t\\tImageIcon iconButton = FormUtils.getIconResource(FormStyle.RESOURCE_PATH_ICO_VIEW_SAMPLES);\\r\\n\\r\\n\\t\\t\\tmainFormLink.getComponentToolbar().getComponentButtonViewSamples().setIcon(iconButton);\\r\\n\\t\\t\\tmainFormLink.getComponentToolbar().getComponentButtonViewSamples().setActionCommand(FormMainHandlerCommands.AC_VIEW_SAMPLES_ON);\\r\\n\\t\\t\\tmainFormLink.getComponentToolbar().getComponentButtonViewSamples().setToolTipText(\\\"View detected samples\\\");\\r\\n\\r\\n\\t\\t\\tmainFormLink.reset();\\r\\n\\t\\t}\\r\\n\\t\\tcatch (ExceptionMessage e)\\r\\n\\t\\t{\\r\\n\\t\\t\\tExceptionHandler.processException(e);\\r\\n\\t\\t}\\r\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6949543","0.68756926","0.6706814","0.6687967","0.6602528","0.6525941","0.6505783","0.645814","0.6402296","0.62814623","0.6261516","0.6247386","0.62305826","0.6167935","0.6166846","0.6135973","0.6132156","0.61190283","0.611149","0.60869133","0.60696","0.6061443","0.5999429","0.59338415","0.5880532","0.58769375","0.58588564","0.58473915","0.5818905","0.5818328","0.57426006","0.57400197","0.57328486","0.5695062","0.5672288","0.56336725","0.5590503","0.5571821","0.5566422","0.5491026","0.5482755","0.54712784","0.54570866","0.5448823","0.544873","0.54255635","0.54191685","0.5410261","0.5395943","0.5387732","0.5372938","0.5319536","0.53187114","0.5316841","0.52979934","0.5294797","0.5287357","0.5239968","0.5239596","0.5218207","0.52171844","0.5208878","0.52059007","0.5205245","0.52035123","0.52018607","0.5198844","0.51899177","0.51846343","0.518289","0.51817673","0.5179425","0.516515","0.5155294","0.51476884","0.51469195","0.51465","0.5137089","0.51297665","0.5127288","0.5121544","0.5109006","0.51088345","0.51069236","0.510632","0.51024514","0.5101751","0.5097638","0.5087167","0.5075351","0.5074651","0.5074078","0.5072502","0.5071247","0.5068944","0.50678194","0.50527173","0.5047814","0.5045599","0.50400597"],"string":"[\n \"0.6949543\",\n \"0.68756926\",\n \"0.6706814\",\n \"0.6687967\",\n \"0.6602528\",\n \"0.6525941\",\n \"0.6505783\",\n \"0.645814\",\n \"0.6402296\",\n \"0.62814623\",\n \"0.6261516\",\n \"0.6247386\",\n \"0.62305826\",\n \"0.6167935\",\n \"0.6166846\",\n \"0.6135973\",\n \"0.6132156\",\n \"0.61190283\",\n \"0.611149\",\n \"0.60869133\",\n \"0.60696\",\n \"0.6061443\",\n \"0.5999429\",\n \"0.59338415\",\n \"0.5880532\",\n \"0.58769375\",\n \"0.58588564\",\n \"0.58473915\",\n \"0.5818905\",\n \"0.5818328\",\n \"0.57426006\",\n \"0.57400197\",\n \"0.57328486\",\n \"0.5695062\",\n \"0.5672288\",\n \"0.56336725\",\n \"0.5590503\",\n \"0.5571821\",\n \"0.5566422\",\n \"0.5491026\",\n \"0.5482755\",\n \"0.54712784\",\n \"0.54570866\",\n \"0.5448823\",\n \"0.544873\",\n \"0.54255635\",\n \"0.54191685\",\n \"0.5410261\",\n \"0.5395943\",\n \"0.5387732\",\n \"0.5372938\",\n \"0.5319536\",\n \"0.53187114\",\n \"0.5316841\",\n \"0.52979934\",\n \"0.5294797\",\n \"0.5287357\",\n \"0.5239968\",\n \"0.5239596\",\n \"0.5218207\",\n \"0.52171844\",\n \"0.5208878\",\n \"0.52059007\",\n \"0.5205245\",\n \"0.52035123\",\n \"0.52018607\",\n \"0.5198844\",\n \"0.51899177\",\n \"0.51846343\",\n \"0.518289\",\n \"0.51817673\",\n \"0.5179425\",\n \"0.516515\",\n \"0.5155294\",\n \"0.51476884\",\n \"0.51469195\",\n \"0.51465\",\n \"0.5137089\",\n \"0.51297665\",\n \"0.5127288\",\n \"0.5121544\",\n \"0.5109006\",\n \"0.51088345\",\n \"0.51069236\",\n \"0.510632\",\n \"0.51024514\",\n \"0.5101751\",\n \"0.5097638\",\n \"0.5087167\",\n \"0.5075351\",\n \"0.5074651\",\n \"0.5074078\",\n \"0.5072502\",\n \"0.5071247\",\n \"0.5068944\",\n \"0.50678194\",\n \"0.50527173\",\n \"0.5047814\",\n \"0.5045599\",\n \"0.50400597\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.60789233"},"document_rank":{"kind":"string","value":"20"}}}],"truncated":false,"partial":true},"paginationData":{"pageIndex":273,"numItemsPerPage":100,"numTotalItems":136513,"offset":27300,"length":100}},"jwt":"eyJhbGciOiJFZERTQSIsImtpZCI6IjVHZDBvd0g5MTM2eDZjc1FvbE1zcktNWUZoRVFoUm5PVVVybEpjOUhaUEEifQ.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sInJlcG9JZHMiOlsiNjc1Mzc3Mjk2YzBkMWNiNGEwNmY5MzlkIl0sImlhdCI6MTc5MDg0OTkxMywianRpIjoiOWY0OWJlZGItMTI0NS00YjM1LWEyYmUtMTc5YzUwNGRmZDc0Iiwic3ViIjoiL2RhdGFzZXRzL25vbWljLWFpL2Nvcm5zdGFjay1qYXZhLXYxIiwiZXhwIjoxNzkwODUzNTEzLCJpc3MiOiJodHRwczovL2h1Z2dpbmdmYWNlLmNvIn0.GLHpM_o_kyvSXxO_Q72fnl7kvjxHAiVS4mhu30OlyBN6FU6Ivr5TcMq2Wc3fBrjNtusaAv8TGOQ5vqivcU0pCw","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":136513,"numBytesParquet":1558040430}]},"discussionsStats":{"closed":0,"open":1,"total":1},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
query stringlengths 7 33.1k | document stringlengths 7 335k | metadata dict | negatives listlengths 3 101 | negative_scores listlengths 3 101 | document_score stringlengths 3 10 | document_rank stringclasses 102
values |
|---|---|---|---|---|---|---|
private String stop; private String run; | public StatusEndPoint(String id) {
super(id);
System.out.println("id = " + id);
// System.out.println("stop = " + stop);
// System.out.println("run = " + run);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public String stop()\r\n {\r\n return \"{ \\\"action\\\": \\\"stop\\\" }\";\r\n }",
"@Override\npublic String stop() {\n\treturn \"the Truck has stopped\";\n}",
"public Stop(String name) {\n this.name = name;\n }",
"public boolean getAllowStop();",
"public void stop(){\n stop... | [
"0.6369963",
"0.6330678",
"0.6189379",
"0.60898036",
"0.6075603",
"0.60719126",
"0.604269",
"0.5981552",
"0.59720564",
"0.59550595",
"0.59173375",
"0.5864645",
"0.5851681",
"0.58180463",
"0.5815192",
"0.58028024",
"0.57894605",
"0.5770054",
"0.5769192",
"0.5769192",
"0.576919... | 0.0 | -1 |
Simply should not fail and return something. | @Test
public void testCreateDocumentChecksumFromContent() throws IOException {
String content = "Some content";
CachedInputStream is =
new CachedStreamFactory(1024, 1024).newInputStream(content);
Doc doc = new Doc("N/A", is);
MD5DocumentChecksummer cs = new MD5Documen... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"boolean getPossiblyBad();",
"@Override\n boolean canFail() {\n return true;\n }",
"boolean isFail();",
"boolean isFailure();",
"@Override\n\t\t\t\tpublic void doFail() {\n\t\t\t\t}",
"public boolean needsProblem();",
"boolean hasPossiblyBad();",
"static void return_unconditionally(String... | [
"0.7106674",
"0.7016902",
"0.70101345",
"0.70043266",
"0.6755166",
"0.6563591",
"0.65042853",
"0.64964217",
"0.6443713",
"0.639487",
"0.6383219",
"0.6361692",
"0.6309689",
"0.6302902",
"0.6223239",
"0.62038815",
"0.61624336",
"0.61477894",
"0.6137916",
"0.6121422",
"0.6098090... | 0.0 | -1 |
Simply should not fail and return something. | @Test
public void testCreateDocumentChecksumFromMeta() throws IOException {
CachedInputStream is =
new CachedStreamFactory(1024, 1024).newInputStream();
Doc doc = new Doc("N/A", is);
doc.getMetadata().add("field1", "value1.1", "value1.2");
doc.getMetadata().add("field... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"boolean getPossiblyBad();",
"@Override\n boolean canFail() {\n return true;\n }",
"boolean isFail();",
"boolean isFailure();",
"@Override\n\t\t\t\tpublic void doFail() {\n\t\t\t\t}",
"public boolean needsProblem();",
"boolean hasPossiblyBad();",
"static void return_unconditionally(String... | [
"0.71075034",
"0.701807",
"0.7010935",
"0.70053214",
"0.6755728",
"0.6563681",
"0.65047634",
"0.64954984",
"0.6442642",
"0.6395718",
"0.63832814",
"0.6360624",
"0.63099146",
"0.6301524",
"0.6222979",
"0.6201706",
"0.616339",
"0.61467016",
"0.6138464",
"0.6121988",
"0.60990244... | 0.0 | -1 |
Simply should not fail and return something. | @Test
@Deprecated
public void testCreateDocumentChecksumFromMetaDeprecated()
throws IOException {
CachedInputStream is =
new CachedStreamFactory(1024, 1024).newInputStream();
Doc doc = new Doc("N/A", is);
doc.getMetadata().add("field1", "value1.1", "value1.2")... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"boolean getPossiblyBad();",
"@Override\n boolean canFail() {\n return true;\n }",
"boolean isFail();",
"boolean isFailure();",
"@Override\n\t\t\t\tpublic void doFail() {\n\t\t\t\t}",
"public boolean needsProblem();",
"boolean hasPossiblyBad();",
"static void return_unconditionally(String... | [
"0.7106674",
"0.7016902",
"0.70101345",
"0.70043266",
"0.6755166",
"0.6563591",
"0.65042853",
"0.64964217",
"0.6443713",
"0.639487",
"0.6383219",
"0.6361692",
"0.6309689",
"0.6302902",
"0.6223239",
"0.62038815",
"0.61624336",
"0.61477894",
"0.6137916",
"0.6121422",
"0.6098090... | 0.0 | -1 |
Constructor for node that sets all the data. | public Node(String data, Node next, Node prev) {
this.data = data;
this.next = next;
this.prev = prev;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private Node( T data_ )\n {\n data = data_;\n parent = this;\n }",
"public Node(T data) {this.data = data;}",
"public Node(Object data) {\n\t\t\tthis.data = data;\n\t\t}",
"public Node(T data) {\n this(data, null, null, null);\n }",
"public Node(){\n\n\... | [
"0.72843635",
"0.71100765",
"0.70307475",
"0.7018912",
"0.6928194",
"0.69191253",
"0.6915738",
"0.6889563",
"0.6880367",
"0.68614393",
"0.6851548",
"0.6804839",
"0.67967",
"0.6785931",
"0.6774557",
"0.67672604",
"0.67603403",
"0.67271364",
"0.66946244",
"0.66853493",
"0.66706... | 0.0 | -1 |
Getter for next node. | public Node getNext() {
return next;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public Node getNext() { return next; }",
"public DNode getNext() { return next; }",
"public node getNext() {\n\t\t\treturn next;\n\t\t}",
"public Node<E> getNext() { return next; }",
"public Node getNextNode() {\n return nextNode;\n }",
"public LLNode<T> getNext() {\n return next;\n }",
"Node<T... | [
"0.8390598",
"0.8321453",
"0.8295639",
"0.8260686",
"0.82429385",
"0.82372594",
"0.8223965",
"0.82182163",
"0.8214762",
"0.8214731",
"0.82101434",
"0.8208476",
"0.8208476",
"0.8190305",
"0.817502",
"0.817502",
"0.8141064",
"0.8135736",
"0.8122429",
"0.811924",
"0.8094795",
... | 0.82168937 | 8 |
Setter for next node. | public void setNext(Node next) {
this.next = next;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void setNext(Node<E> next) { this.next = next; }",
"public void setNext(Node n) { next = n; }",
"public void setNext(Node next){\n\t\tthis.next = next;\n\t}",
"public void setNextNode(Node nextNode) {\n this.nextNode = nextNode;\n }",
"public void setNextNode(Node<T> next) {\n itsNext... | [
"0.8342445",
"0.8319406",
"0.826054",
"0.81856114",
"0.8183229",
"0.81703496",
"0.81660825",
"0.81629014",
"0.81414485",
"0.81235063",
"0.8085059",
"0.80717313",
"0.8061669",
"0.80172503",
"0.79935217",
"0.79841757",
"0.7953313",
"0.79465",
"0.79315907",
"0.79232574",
"0.7907... | 0.8170205 | 6 |
Getter for Previous node in the list. | public Node getPrev() {
return prev;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public node getPrevious() {\n\t\t\treturn previous;\n\t\t}",
"public Node getPrevious() {\n return previous;\n }",
"public Node getPrev()\r\n\t{\r\n\t\treturn prev;\r\n\t}",
"public Node getPrev()\n {\n return this.prev;\n }",
"public DoublyLinkedNode<E> getPrevious() {\n ... | [
"0.8843789",
"0.87889",
"0.87716115",
"0.8759016",
"0.8619982",
"0.86135626",
"0.8596417",
"0.8559983",
"0.85481393",
"0.854293",
"0.85094887",
"0.8487676",
"0.8418937",
"0.8415477",
"0.8409887",
"0.8370842",
"0.829932",
"0.8277712",
"0.8222902",
"0.8207123",
"0.8005482",
"... | 0.8703741 | 4 |
Setter for previous node. | public void setPrev(Node prev) {
this.prev = prev;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void setPrevious(Node<T> previous) {\r\n this.previous = previous;\r\n }",
"public Node setPrevNode(Node node);",
"public void setPrev(Node<T> prev) {\n\t\tthis.prev = prev;\n\t}",
"public void setPrev(Node prev)\r\n\t{\r\n\t\tthis.prev = prev;\r\n\t}",
"public void setPrevNode(Nod... | [
"0.8674817",
"0.8620083",
"0.86005926",
"0.8502014",
"0.84892076",
"0.8433329",
"0.8382148",
"0.82613224",
"0.8185784",
"0.81610805",
"0.8077892",
"0.80712694",
"0.80158293",
"0.8006401",
"0.79686564",
"0.79251254",
"0.7916708",
"0.78860104",
"0.7861295",
"0.78393525",
"0.775... | 0.8581396 | 3 |
/ AI Types 1 = Smart 2 = Random | public TicTacToeAI(String brainFileLocation, int type) {
game = null;
this.brainLocation = brainFileLocation;
this.aiType = type;
//Initialize a new long term and short term memory
longTermMemory = new HashMap<>();
shortTermMemory = new ArrayList<String>();
//L... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private Card aiRequestLogic()\n {\n Random randomCard = new Random(); // A placeholder is set aside for generating a random integer.\n return hand.get(randomCard.nextInt(hand.size())); // A card at a randomized index will be returned.\n }",
"public abstract void randomize();",
"private void... | [
"0.65205616",
"0.6455896",
"0.6418166",
"0.63306665",
"0.629475",
"0.62851787",
"0.62550277",
"0.6198587",
"0.6181326",
"0.6171185",
"0.6063036",
"0.6056062",
"0.59899867",
"0.59567076",
"0.5936694",
"0.5921451",
"0.5916746",
"0.59002846",
"0.5838939",
"0.58384115",
"0.583644... | 0.0 | -1 |
Return a move based on the current board configuration | public synchronized String computeMove() {
if (game == null) {
System.err.println("CODE ERROR: AI is not attached to a game.");
return "0,0";
}
char[] board = (char[]) game.getStateAsObject();
//Choose a smart move if that AI is set to "Smart" or if the random v... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public abstract Move getMove(Board board);",
"private int getSmartMove(char[] boardConfig) {\n\n ArrayList<Integer> emptySpaces = getEmptySpaces(boardConfig);\n\n double bestScore = -1;\n String bestChoice = \"\";\n int move = 0;\n\n //Loop through each empty space on the board... | [
"0.7437685",
"0.7326363",
"0.68912184",
"0.68906075",
"0.6842904",
"0.68356663",
"0.6817478",
"0.67824656",
"0.67610204",
"0.6721933",
"0.6704862",
"0.6667476",
"0.66611284",
"0.6613201",
"0.66114",
"0.65858454",
"0.6585437",
"0.65771693",
"0.65412563",
"0.6534774",
"0.649311... | 0.6531827 | 20 |
Return a random move based on the available spaces | private int getRandomMove(char[] boardConfig) {
ArrayList<Integer> emptySpaces = getEmptySpaces(boardConfig);
int random = (int) (Math.random() * emptySpaces.size());
int randomSpace = emptySpaces.get(random);
char currentPlayer = (game.getPlayer() == 0) ? 'X' : 'O';
char[] temp... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private int Rand_Move() {\n\t\tRandom r = new Random();\n\t\tint move = NO_MOVE;\n\t\tdo{\n\t\t\tmove = r.nextInt(9);\n\t\t}while(square_empty[move] == false);\n\t\treturn move;\n\t}",
"private void randomMove() {\n }",
"public int randomMove()\r\n {\r\n r = new Random();\r\n x = r.nextInt(... | [
"0.7857806",
"0.7526575",
"0.74671704",
"0.74649173",
"0.7458852",
"0.7271986",
"0.7185866",
"0.71555036",
"0.7013415",
"0.699517",
"0.6953338",
"0.69054574",
"0.6892935",
"0.6889608",
"0.6870371",
"0.6837374",
"0.6822215",
"0.67848",
"0.67609656",
"0.67608833",
"0.6676824",
... | 0.7286806 | 5 |
/ Return the optimal move for the current empty spaces if the possible moves are in the long term memory. Otherwise choose a random move. | private int getSmartMove(char[] boardConfig) {
ArrayList<Integer> emptySpaces = getEmptySpaces(boardConfig);
double bestScore = -1;
String bestChoice = "";
int move = 0;
//Loop through each empty space on the board
for (Integer emptySpace : emptySpaces) {
i... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"Move getBestMove() {\n //System.out.println(\"AI chooses: \" + m.toString());\n return moves.get((int) (Math.random() * moves.size()));\n }",
"public void performMove() {\n\t\tfor (int x = 0; x <= size-1; x++)\n\t\t\tfor (int y = 0; y <= size-1; y++)\n\t\t\t\tlocalBoard[y][x] = 0;\n\t\t\n\t\t//r... | [
"0.71696544",
"0.6840756",
"0.6811112",
"0.6758936",
"0.67464465",
"0.6734174",
"0.6638513",
"0.6575392",
"0.65339756",
"0.65117276",
"0.64103866",
"0.6375238",
"0.6297857",
"0.62813514",
"0.6230882",
"0.6214935",
"0.6214179",
"0.62011236",
"0.61824214",
"0.6146412",
"0.61372... | 0.694898 | 1 |
/ Input: the current board Output: an ArrayList containing all of the empty spots on the board | private ArrayList<Integer> getEmptySpaces(char[] board) {
ArrayList<Integer> emptySpaces = new ArrayList<>();
for (int i = 0; i < board.length; i++) {
if (board[i] == ' ') {
emptySpaces.add(i);
}
}
return emptySpaces;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public ArrayList<Tile> getEmptyTiles(){\n\t\tArrayList<Tile> emptyTiles = new ArrayList<Tile>();\n\t\tArrayList<Tile> boardTiles = getAllBoardTiles();\n\t\tfor (Tile tile : boardTiles) {\n\t\t\tif(tile.getPiece()== null && tile.getColor1()== PrimaryColor.BLACK) {\n\t\t\t\temptyTiles.add(tile);\n\t\t\t}\n\t\t}\n\t\... | [
"0.73431057",
"0.7143795",
"0.71135354",
"0.7107761",
"0.71047485",
"0.70340407",
"0.68229574",
"0.680377",
"0.6791804",
"0.6780762",
"0.67398286",
"0.66870683",
"0.6634945",
"0.656488",
"0.6560722",
"0.65537894",
"0.6524856",
"0.6500448",
"0.6480006",
"0.6436721",
"0.6422956... | 0.66953534 | 11 |
Link the AI to the current game | public void attachGame(Game g) {
game = (TicTacToeGame) g;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private void playAI (int actualAI) {\n }",
"public void startGame(){\n\n AgentAddress coordinatorAddressPre = getAgentWithRole(\"investment_game\", \"tout_le_monde\", \"coordinator\");\n\n if (coordinatorAddressPre==null){\n Coordinator coordinator = new Coordinator();\n\n ... | [
"0.6398667",
"0.6259176",
"0.61975896",
"0.6192805",
"0.61565304",
"0.6065297",
"0.6062759",
"0.60625035",
"0.6018016",
"0.59761703",
"0.5937144",
"0.5934206",
"0.59321",
"0.59314317",
"0.58840644",
"0.58323836",
"0.58161205",
"0.58161205",
"0.58161205",
"0.58158386",
"0.5807... | 0.54766566 | 81 |
/ Input: the current board Output: an string representation of the referenced board state | private String boardToString(char[] board) {
String boardString = "";
for (char aBoard : board) boardString += aBoard;
return boardString.replaceAll(" ", "_");
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public String dumpState() {\n StringBuilder out = new StringBuilder();\n out.append(currentPlayer);\n for (int i = 0; i < board.length; ++i)\n out.append(\" \" + board[i]);\n\n return out.toString();\n }",
"public String getStateOfBoard()\n {\n // This function is used to print state of... | [
"0.7754882",
"0.744507",
"0.7330105",
"0.7292678",
"0.706085",
"0.70298314",
"0.7026795",
"0.69535774",
"0.6942798",
"0.6880832",
"0.6868008",
"0.68422353",
"0.6837344",
"0.6779664",
"0.6772159",
"0.67457414",
"0.67455757",
"0.6745046",
"0.67377025",
"0.66982865",
"0.6629163"... | 0.0 | -1 |
Given the result of the game, give each move made either a reward or punishment | private void rememberGame(char result) {
char playerPiece = game.getPlayer() == 0 ? 'H' : 'A';
if (result == playerPiece) {
wins++;
} else if (result == 'T') {
ties++;
} else {
losses++;
}
// Loop through the short term memory and ad... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n public void noteNewTurn()\n {\n if ( traceStats && stateMachine.getInstanceId() == 1 )\n {\n ForwardDeadReckonLegalMoveInfo[] masterList = stateMachine.getFullPropNet().getMasterMoveList();\n for(int i = 0; i < bestResponseScores.length; i++)\n {\n float best = -Float.MAX_... | [
"0.6254587",
"0.6194907",
"0.6126895",
"0.61254114",
"0.59846234",
"0.59139806",
"0.5882312",
"0.5874581",
"0.5863343",
"0.5842919",
"0.58288944",
"0.57816213",
"0.57767427",
"0.5776478",
"0.5776448",
"0.5749248",
"0.57268167",
"0.56999105",
"0.569595",
"0.56411767",
"0.56392... | 0.5242913 | 77 |
Inform AI who the winner is result is either (H)ome win, (A)way win, (T)ie | @Override
public synchronized void postWinner(char result) {
rememberGame(result);
//Increase the heat (decrease randomness) as more games are played
if (heat < heatMax && gamesPlayed % 50 == 0) heat++;
gamesPlayed++;
game = null; // No longer playing a game though.
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void tellPlayerResult(int winner) {\n\t}",
"public int winner() {\n if(humanPlayerHits == 17) {\n return 1;\n }\n if(computerPlayerHits == 17){\n return 2;\n }\n return 0;\n }",
"private static void winnerOrTie()\n\t{\n\t\t//Check each row for ... | [
"0.7473112",
"0.7211351",
"0.70625156",
"0.6983686",
"0.6948988",
"0.693532",
"0.692072",
"0.68828005",
"0.68686295",
"0.6865958",
"0.6858123",
"0.68339866",
"0.68231773",
"0.68225276",
"0.6816511",
"0.68103933",
"0.6807445",
"0.6805201",
"0.6803354",
"0.6803209",
"0.6748097"... | 0.0 | -1 |
Shutdown the AI allowing it to save its learned experience | @Override
public synchronized void end() {
System.out.println("Wins: " + wins + " Ties: " + ties + " Losses: " + losses + " Name: " + brainLocation + " Heat:" + heat);
saveMemory();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void shutdown() {\n mGameHandler.shutdown();\n mTerminalNetwork.terminate();\n }",
"public void stopTrainingMode() {\n\t\t\r\n\t}",
"public void shutDown() {\n isStarted = false;\n logger.info(\"[GAME] shut down\");\n }",
"private void shutdown(){\n\t\ttry{\n\t\t\tMai... | [
"0.70055",
"0.6884663",
"0.6868683",
"0.67499155",
"0.67471373",
"0.66654956",
"0.66647846",
"0.6656888",
"0.6618424",
"0.6614583",
"0.6610583",
"0.65857047",
"0.6558745",
"0.6553822",
"0.65507025",
"0.65422857",
"0.6534022",
"0.6524655",
"0.6465975",
"0.6446135",
"0.64423335... | 0.0 | -1 |
Serialize the long term memory object to a file | private void saveMemory() {
try {
File varTmpDir = new File("data/" + brainLocation + ".ser");
if (!varTmpDir.exists()) {
varTmpDir.createNewFile();
}
FileOutputStream fileOut = new FileOutputStream(varTmpDir);
ObjectOutputStream out = ... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void serialize() {\n FileOutputStream fileOutput = null;\n ObjectOutputStream outStream = null;\n // attempts to write the object to a file\n try {\n clearFile();\n fileOutput = new FileOutputStream(data);\n outStream = new ObjectOutputStream(file... | [
"0.6990989",
"0.68375444",
"0.6682146",
"0.6646784",
"0.6532085",
"0.6520243",
"0.6493477",
"0.64759487",
"0.64145714",
"0.64097005",
"0.6393149",
"0.63260007",
"0.63051486",
"0.62918025",
"0.6279077",
"0.6270747",
"0.6248124",
"0.61784655",
"0.61630696",
"0.6131955",
"0.6124... | 0.7050866 | 0 |
Load the serialized memory from a file. If the file doesn't exist, create it. | private void loadMemory() {
try {
File varTmpDir = new File("data/" + brainLocation + ".ser");
if (varTmpDir.exists()) {
FileInputStream fileIn = new FileInputStream(varTmpDir);
ObjectInputStream in = new ObjectInputStream(fileIn);
longTerm... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public Object loadFromFile(String fileName) {\n\t Object obj = null;\n\t try{\n\t\t FileInputStream FIS = new FileInputStream((defaultPath+\"\\\\\" + fileName));\n\t\t ObjectInputStream onjIn = new ObjectInputStream(FIS);\n\t\t obj = onjIn.readObject();\n\t } catch (NoSuchFileException e){\n\t\t saveTo... | [
"0.6286914",
"0.6272416",
"0.61801565",
"0.6177695",
"0.61447364",
"0.61086273",
"0.60986733",
"0.6090153",
"0.60397685",
"0.5996801",
"0.59695226",
"0.5931803",
"0.59171474",
"0.5897448",
"0.57825875",
"0.5775248",
"0.57692224",
"0.5760158",
"0.5756674",
"0.57294565",
"0.572... | 0.626707 | 2 |
Update the counts of a specific long term memory | public void updateLongTermMemory(String board, int wins, int ties, int losses) {
BoardRecord stm = longTermMemory.get(board);
stm.setWins(wins);
stm.setTies(ties);
stm.setLosses(losses);
longTermMemory.replace(board, stm);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public synchronized void updateMemory(){\n \tint memory = Math.round(System.getRuntime().totalMemory()/System.getRuntime().freeMemory());\n \tstore(new DisplayableData(\"memory\", \"M\"+memory+\"%\", memory));\n }",
"@SuppressWarnings(\"deprecation\")\n private void updateResourceCounters() {\n upda... | [
"0.6660036",
"0.61332273",
"0.59868675",
"0.59372574",
"0.58567405",
"0.58271635",
"0.58128035",
"0.57339114",
"0.57297313",
"0.57154524",
"0.5710903",
"0.5709188",
"0.5672283",
"0.5653198",
"0.56523454",
"0.56366694",
"0.55535626",
"0.5488108",
"0.548535",
"0.5476312",
"0.54... | 0.54710066 | 20 |
Print the value in a long term memory | private void getLongTermMemory(String board) {
BoardRecord stm = longTermMemory.get(board);
System.out.println(stm.getWins());
System.out.println(stm.getTies());
System.out.println(stm.getLosses());
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void print()\n {\n StringBuffer buffer = new StringBuffer();\n for (int i = 0; i < memorySize; i++)\n {\n buffer.append(mainMemory[i]);\n }\n System.out.println(buffer.toString());\n }",
"public void smem_print_store(StringBuilder return_val) throws Soar... | [
"0.65877354",
"0.64525825",
"0.6425168",
"0.63983923",
"0.6305268",
"0.615572",
"0.611622",
"0.60744315",
"0.6061534",
"0.6011434",
"0.5941939",
"0.59335047",
"0.5906248",
"0.5889627",
"0.5864824",
"0.58416516",
"0.5836772",
"0.58331203",
"0.5831319",
"0.5831319",
"0.5826006"... | 0.6144963 | 6 |
It formulates a new path when the agent is done with its previous one. | public void findNewAStarPath(PedSimCity state) {
RouteData route = new RouteData();
route.origin = originNode.getID();
route.destination = destinationNode.getID();
// originNode = PedSimCity.nodesMap.get(9406);
// destinationNode = PedSimCity.nodesMap.get(4456);
if (UserParameters.empiricalABM) {
Sys... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void finalizePath(){\n\t\tif(getCompletePath()||temp.isEmpty())\n\t\t\treturn;//path has already been finalized or there is no path defined\n\t\telse{\n\t\t\tint LastPos=temp.peekLast().getPos();\n\t\t\tint d = currentPath.getDirection(LastPos);\n\t\t\tPathType type = Map.createPathTileOfType(d,caseEdge);\n... | [
"0.7234013",
"0.66378725",
"0.6504491",
"0.6450179",
"0.63537586",
"0.63157415",
"0.6201582",
"0.61919385",
"0.6134449",
"0.6103762",
"0.6026457",
"0.59080315",
"0.59074277",
"0.5850241",
"0.5795253",
"0.57616204",
"0.5736046",
"0.57192826",
"0.5708641",
"0.5703777",
"0.57030... | 0.5830018 | 14 |
This is called every tick by the scheduler. It moves the agent along the path. | @Override
public void step(SimState state)
{
PedSimCity stateSchedule = (PedSimCity) state;
minutesSoFar += UserParameters.minutesPerStep;
if (UserParameters.activityBased && minutesSoFar == UserParameters.endingHour) {
System.out.println("End of the day - calling finish");
stateSchedule.finish();
}
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void move() {\n\n\tGrid<Actor> gr = getGrid();\n\tif (gr == null) {\n\n\t return;\n\t}\n\n\tLocation loc = getLocation();\n\tif (gr.isValid(next)) {\n\n\t setDirection(loc.getDirectionToward(next));\n\t moveTo(next);\n\n\t int counter = dirCounter.get(getDirection());\n\t dirCounter.put(getDi... | [
"0.7059321",
"0.69565356",
"0.68175936",
"0.68081236",
"0.68018603",
"0.67860985",
"0.67068726",
"0.6681601",
"0.66618353",
"0.6653907",
"0.6568021",
"0.65518355",
"0.65489924",
"0.65440214",
"0.65292037",
"0.6514056",
"0.65106416",
"0.65069014",
"0.64986235",
"0.6480785",
"0... | 0.0 | -1 |
Transition to the next edge in the path | void transitionToNextEdge(double residualMove) {
// update the counter for where the index on the path is
indexOnPath += pathDirection;
// check to make sure the Agent has not reached the end of the path already
// depends on where you're going!
if ((pathDirection > 0 && indexOnPath >= path.size()) || (path... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"protected void next() {\n\t\t// Next node\n\t\tnode = path.remove(0);\n\t\ttransition(NavigatorState.ROTATE_TO);\n\t}",
"private void selectNextPath(boolean inc) {\n\t\tif (this.allPathsList.size() < 1)\n\t\t\treturn;\n\t\tList<GraphPath<PathwayVertexRep, DefaultEdge>> paths = this.allPathsList.get(this.allPaths... | [
"0.7252566",
"0.6821686",
"0.6330777",
"0.61816376",
"0.6159228",
"0.61315405",
"0.6060969",
"0.6042948",
"0.5997076",
"0.59740156",
"0.5919283",
"0.5913824",
"0.5903942",
"0.58859944",
"0.5877571",
"0.58580816",
"0.5849799",
"0.58418167",
"0.5787682",
"0.5782554",
"0.5743922... | 0.7956939 | 0 |
Sets the Agent up to proceed along an Edge. | void setupEdge(EdgeGraph edge) {
if (UserParameters.socialInteraction) updateCrowdness(edge);
currentEdge = edge;
//transform GeomPlanarGraphEdge in Linestring
LineString line = edge.getLine();
//index the Linestring
segment = new LengthIndexedLine(line);
startIndex = segment.getStartIndex();
endIndex ... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"protected void setup(){\n\n\t\tsuper.setup();\n\n\t\tfinal Object[] args = getArguments();\n\t\tif(args!=null && args[0]!=null && args[1]!=null){\n\t\t\tdeployAgent((Environment) args[0],(EntityType)args[1]);\n\t\t}else{\n\t\t\tSystem.err.println(\"Malfunction during parameter's loading of agent\"+ this.getClass()... | [
"0.6291797",
"0.5766119",
"0.5751221",
"0.57245517",
"0.57113016",
"0.5710157",
"0.5689873",
"0.56653833",
"0.56620437",
"0.5645107",
"0.56423026",
"0.5624952",
"0.55713433",
"0.5558551",
"0.5557259",
"0.5548124",
"0.55245894",
"0.5495834",
"0.54957837",
"0.5456445",
"0.54268... | 0.7328203 | 0 |
It moves the agent to the given coordinates. | public void updatePosition(Coordinate c) {
pointMoveTo.setCoordinate(c);
PedSimCity.agents.setGeometryLocation(agentLocation, pointMoveTo);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void move() {\n\t\tmoveX();\n\t\tmoveY();\n\t}",
"public void move() {\n\t\tGrid<Actor> gr = getGrid();\n\t\tif (gr == null) {\n\t\t\treturn;\n\t\t}\n\t\tLocation loc = getLocation();\n\t\tLocation next = loc.getAdjacentLocation(getDirection());\n\t\t\n\t\tLocation next2 = next.getAdjacentLocation(getDire... | [
"0.71339065",
"0.6963379",
"0.68941045",
"0.68855697",
"0.6862072",
"0.6859203",
"0.6858495",
"0.68132794",
"0.68072164",
"0.6796319",
"0.6795778",
"0.6792442",
"0.67909664",
"0.67763126",
"0.67666596",
"0.67306554",
"0.67171633",
"0.6704896",
"0.66894996",
"0.66856563",
"0.6... | 0.6268962 | 80 |
It updates the volumes on a given edge, on the basis of the agent's route choice model. | void updateEdgeData(EdgeGraph edge) {
edge = PedSimCity.edgesMap.get(edge.getID()); //in case it was a subgraph edge
if (UserParameters.empiricalABM) edge.densities.replace(agp.groupName, edge.densities.get(agp.groupName)+1);
else edge.densities.replace(ap.routeChoice, edge.densities.get(ap.routeChoice)+1);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void updateCrowdness(EdgeGraph newEdge) {\n\t\tif (currentEdge != null) {\n\t\t\tArrayList<Pedestrian> currentVolume = PedSimCity.edgesVolume.get(currentEdge);\n\t\t\tcurrentVolume.remove(this);\n\t\t}\n\n\t\t// update new edge traffic\n\t\tif (PedSimCity.edgesVolume.get(newEdge) == null) PedSimCity.edgesVo... | [
"0.5847958",
"0.55869496",
"0.5501072",
"0.5473177",
"0.5394926",
"0.5393179",
"0.5365799",
"0.53326833",
"0.5331536",
"0.5319934",
"0.5252718",
"0.5208703",
"0.5156453",
"0.50916773",
"0.50753117",
"0.5067313",
"0.50571555",
"0.4978622",
"0.49463823",
"0.49328616",
"0.492293... | 0.63549745 | 0 |
It returns the geometry representing agent location | public MasonGeometry getGeometry() {return agentLocation;} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"Geometry getGeometry();",
"public AreaGeometry getGeometry() {\n return this.geometry;\n }",
"public PlaceGeometry getGeometry() {\n return geometry;\n }",
"public GeoOrigin getGeoOrigin();",
"public GridLocation getLocation();",
"public geo_location getLocation() {\n return _p... | [
"0.6915802",
"0.63575715",
"0.6230512",
"0.61473405",
"0.60812384",
"0.60618794",
"0.6046632",
"0.60291487",
"0.60019493",
"0.59939545",
"0.5957237",
"0.5946694",
"0.5911702",
"0.5878252",
"0.587438",
"0.5873447",
"0.5859106",
"0.584013",
"0.5808647",
"0.580755",
"0.5798784",... | 0.8686108 | 0 |
It select the route choice model and it calls the path formulation algorithm | public void selectRouteChoice()
{
RoutePlanner planner = new RoutePlanner();
this.sequence = ap.listSequences.get(numTrips);
// only minimisation
if (ap.routeChoice.equals("DS")) newPath = planner.roadDistance(originNode, destinationNode, ap);
else if (ap.routeChoice.equals("AC")) newPath = planner.angularCh... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void findNewAStarPath(PedSimCity state) {\n\n\t\tRouteData route = new RouteData();\n\t\troute.origin = originNode.getID();\n\t\troute.destination = destinationNode.getID();\n\t\t//\t\toriginNode = PedSimCity.nodesMap.get(9406);\n\t\t//\t\tdestinationNode = PedSimCity.nodesMap.get(4456);\n\n\t\tif (UserPara... | [
"0.6437227",
"0.6226352",
"0.6193227",
"0.60500073",
"0.5939259",
"0.5916624",
"0.5880344",
"0.58478427",
"0.5832727",
"0.58221316",
"0.5705578",
"0.5701128",
"0.56924736",
"0.5664431",
"0.56237835",
"0.5610023",
"0.55915874",
"0.55879134",
"0.5564051",
"0.5543681",
"0.553654... | 0.7780745 | 0 |
It computes the agents' speed | double progress(double val)
{
return val * linkDirection;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public double getSpeed();",
"double getSpeed();",
"protected long travel() {\n\n return Math.round(((1 / Factory.VERTEX_PER_METER_RATIO) / (this.speed / 3.6)) * 1000);\n }",
"public void calcSpeed(){\r\n Random rand = new Random();\r\n tire = rand.nextInt(10)+1;\r\n engine = ra... | [
"0.6754982",
"0.6750929",
"0.67089045",
"0.66360086",
"0.6623297",
"0.66072196",
"0.6510198",
"0.6507167",
"0.65004814",
"0.6454249",
"0.6450234",
"0.64472026",
"0.641602",
"0.63918614",
"0.6389906",
"0.6383413",
"0.6383413",
"0.6383413",
"0.6383413",
"0.6383413",
"0.6383413"... | 0.0 | -1 |
It makes the agent move along the computed route | public void keepWalking() {
// move along the current segment
if (UserParameters.socialInteraction) speed = progressSocial(moveRate);
else speed = progress(moveRate);
currentIndex += speed;
// check to see if the progress has taken the current index beyond its goal
// given the direction of movement. If so,... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void move() {\n\n if (_currentFloor == Floor.FIRST) {\n _directionOfTravel = DirectionOfTravel.UP;\n }\n if (_currentFloor == Floor.SEVENTH) {\n _directionOfTravel = DirectionOfTravel.DOWN;\n }\n\n\n if (_directionOfTravel == DirectionOfTravel.UP) {\n... | [
"0.72984105",
"0.71370465",
"0.7055927",
"0.70434135",
"0.69800705",
"0.69718593",
"0.6908271",
"0.6893375",
"0.6758387",
"0.6756284",
"0.67559296",
"0.67340696",
"0.66973794",
"0.66956717",
"0.66908157",
"0.6671399",
"0.6660531",
"0.6647472",
"0.66422725",
"0.6629346",
"0.66... | 0.0 | -1 |
clean up on old edge | public void updateCrowdness(EdgeGraph newEdge) {
if (currentEdge != null) {
ArrayList<Pedestrian> currentVolume = PedSimCity.edgesVolume.get(currentEdge);
currentVolume.remove(this);
}
// update new edge traffic
if (PedSimCity.edgesVolume.get(newEdge) == null) PedSimCity.edgesVolume.put(newEdge, new Arra... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private void clean() {\n // TODO: Your code here.\n for (Long id : vertices()) {\n if (adj.get(id).size() == 1) {\n adj.remove(id);\n }\n }\n }",
"private void clean() {\n nodesToRemove.clear();\n edgesToRemove.clear();\n }",
"privat... | [
"0.72632575",
"0.69673824",
"0.6934367",
"0.68585795",
"0.66869366",
"0.6672074",
"0.65085834",
"0.6436976",
"0.6354367",
"0.6339832",
"0.6339832",
"0.6316334",
"0.62722164",
"0.62454444",
"0.6232163",
"0.6172433",
"0.6155709",
"0.6155709",
"0.6153174",
"0.6147106",
"0.611394... | 0.0 | -1 |
A utility function to check if the given character is operand | private static boolean isOperand(char ch) {
return (ch >= 'a' && ch <= 'z') || (ch >= 'A' && ch <= 'Z');
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"boolean operator(Character input){\r\n //detects operands\r\n if(input == '^'||input == '-'||input == '+'||input == '/'||input == '*'|| input =='('|| input ==')'){\r\n return true;\r\n }\r\n else\r\n return false;\r\n }",
"public static boolean checkOperator(S... | [
"0.80983895",
"0.80913067",
"0.8091049",
"0.8021369",
"0.7934937",
"0.79305017",
"0.79152375",
"0.7911901",
"0.79022646",
"0.7876445",
"0.7858984",
"0.78504336",
"0.7791002",
"0.77500355",
"0.7745211",
"0.77186036",
"0.7653191",
"0.7650521",
"0.7554993",
"0.75278795",
"0.7464... | 0.8052691 | 3 |
Test that, once the queue eclipses the configure size limit, calls to journal more data are rejected. | @Test
public void testQueueLimiting() throws Exception {
// Block the underlying fake proxy from actually completing any calls.
DelayAnswer delayer = new DelayAnswer(LOG);
Mockito.doAnswer(delayer).when(mockProxy).journal(
Mockito.<RequestInfo>any(),
Mockito.eq(1L), Mockito.eq(1L),
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Test\n public void testEnsureBufferSizeExpandsToBeyondMaxBufferSize() {\n assertEnsureBufferSizeExpandsToMaxBufferSize(true);\n }",
"private void raiseLimitException() {\n\t\t\tthrow new DataBufferLimitException(\"Exceeded limit on max bytes to buffer : \" + getMaxInMemorySize());\n\t\t}",
"@Over... | [
"0.65991145",
"0.65122545",
"0.64931136",
"0.64005196",
"0.6302009",
"0.6280919",
"0.5996313",
"0.59666634",
"0.58924556",
"0.5823115",
"0.5820635",
"0.5787166",
"0.5761012",
"0.5748183",
"0.5745549",
"0.57410055",
"0.5716088",
"0.57092386",
"0.57081765",
"0.570437",
"0.56982... | 0.7568555 | 0 |
Test that, if the remote node gets unsynchronized (eg some edits were missed or the node rebooted), the client stops sending edits until the next roll. Test for HDFS3726. | @Test
public void testStopSendingEditsWhenOutOfSync() throws Exception {
Mockito.doThrow(new IOException("injected error"))
.when(mockProxy).journal(
Mockito.<RequestInfo>any(),
Mockito.eq(1L), Mockito.eq(1L),
Mockito.eq(1), Mockito.same(FAKE_DATA));
try {
ch.sendEdits(1L,... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Test\n\tpublic void testServerReplicaLeavingDuringWrite() throws Exception {\n\t\tfinal KeyValueServer server = new KeyValueServer();\n\t\tArrayList<String> files = populateServer(server);\n\t\tfinal long TIMEOUT = 100;\n\t\tthis.err = false;\n\t\t//We can make a fake client that blocks in its write then make sur... | [
"0.65554065",
"0.6385915",
"0.60428077",
"0.59956723",
"0.5916765",
"0.590722",
"0.58935595",
"0.5867984",
"0.5866431",
"0.5812901",
"0.57881486",
"0.57633954",
"0.5751304",
"0.57085246",
"0.5692372",
"0.56606334",
"0.5658153",
"0.56519043",
"0.563446",
"0.5582188",
"0.557505... | 0.63657403 | 2 |
get bean by bean name | public static <T> T getBean(String beanName) {
return (T) applicationContext.getBean(beanName);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public Object getBean(String name) {\n Object bean = beanMap.get(name);\n if (bean == null) {\n throw new IllegalArgumentException(\"there is no bean with name \" + name);\n }\n\n return bean;\n }",
"public static Object getBean(String name) {\r\n\t\tWebApplicationContex... | [
"0.79964346",
"0.786159",
"0.77600926",
"0.76266176",
"0.75355107",
"0.7450493",
"0.7419184",
"0.7288232",
"0.7136635",
"0.71234405",
"0.7065102",
"0.67924273",
"0.6779629",
"0.6707856",
"0.67021966",
"0.6622216",
"0.66143364",
"0.6528129",
"0.6440731",
"0.6407061",
"0.636274... | 0.6773485 | 13 |
get interface all subclass by interface class type | public static String[] getBeanNamesForType(Class clazz) {
return applicationContext.getBeanNamesForType(clazz);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public Collection<ClassTranslator> getInterfaces();",
"private static Class<?>[] getAllInterfacesForClass(Class<?> clazz) {\n return getAllInterfacesForClass(clazz, null);\n }",
"TypeInfo[] interfaces();",
"Set<Interface> getInterfaces();",
"<T> IList<T> getImplementingObjects(Class<T> interfaceT... | [
"0.6878797",
"0.67680293",
"0.6599951",
"0.6560383",
"0.6541091",
"0.64673764",
"0.6310602",
"0.61826444",
"0.6175833",
"0.61224127",
"0.6109677",
"0.6109677",
"0.60940444",
"0.60816187",
"0.6065243",
"0.60587126",
"0.6011333",
"0.6007515",
"0.59966296",
"0.591689",
"0.590667... | 0.0 | -1 |
get bean class by bean name | public static Class<?> getType(String beanName) {
return applicationContext.getType(beanName);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static Object getBean(String name) {\r\n\t\tWebApplicationContext wac = ContextLoader.getCurrentWebApplicationContext();\r\n\t\treturn wac.getBean(name);\r\n\t}",
"public <T> T getBean(String beanName, Class<T> ofType) throws CouldNotResolveBeanException;",
"public Object findBean(String beanName) {\n\t... | [
"0.6871323",
"0.67342687",
"0.6710013",
"0.6689754",
"0.66291994",
"0.6628337",
"0.66251165",
"0.66244644",
"0.64513314",
"0.6440585",
"0.6439291",
"0.6438513",
"0.64070725",
"0.63580227",
"0.63564754",
"0.6269657",
"0.6238258",
"0.62295604",
"0.62163204",
"0.62156665",
"0.61... | 0.6861701 | 1 |
get bean by bean name | public static <T> T getBean(String beanName, Class<? extends Annotation> annotationType) {
T t = (T) applicationContext.getBean(beanName);
if (!t.getClass().isAnnotationPresent(annotationType)) {
throw new NoSuchBeanDefinitionException("Resources don't exist.");
}
return t;
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public Object getBean(String name) {\n Object bean = beanMap.get(name);\n if (bean == null) {\n throw new IllegalArgumentException(\"there is no bean with name \" + name);\n }\n\n return bean;\n }",
"public static Object getBean(String name) {\r\n\t\tWebApplicationContex... | [
"0.7995118",
"0.78612924",
"0.77599835",
"0.76259434",
"0.7534363",
"0.74506",
"0.74193335",
"0.728913",
"0.7136137",
"0.71225464",
"0.7064616",
"0.6793508",
"0.67810076",
"0.6772993",
"0.6707734",
"0.6703208",
"0.6624315",
"0.6612891",
"0.6528349",
"0.6440455",
"0.64074963",... | 0.54494375 | 71 |
/ Using the Observable.lift() method you can perform multiple queries without breaking method chaining. Observable.lift() requires an Operator parameter which are available via db.select(sql).parameterOperator().getXXX() db.select(sql).parameterListOperator().getXXX() db.select(sql).dependsOnOperator().getXXX() db.upda... | public static void main(String[] args) {
Database db = Database.from("jdbc:mysql://127.0.0.1:3306/alarm_user", "root", "");
Observable<Integer> score = Observable
// parameters for coming update
.just(4, "FRED")
// update Fred's score to 4
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Test\n public void example() {\n Func1<Integer, Observable<Integer>> db1 = param -> Observable.range(1, param);\n\n // ws-kald som funktion der returner en Observable\n Func1<Integer, Observable<Integer>> ws1 = param -> Observable.just(param);\n\n // ws-kald som funktion der returne... | [
"0.58075345",
"0.544267",
"0.5085378",
"0.50321555",
"0.5011454",
"0.49489313",
"0.4844218",
"0.4842796",
"0.47734678",
"0.47468552",
"0.47328648",
"0.4727003",
"0.47255653",
"0.47017977",
"0.46715808",
"0.46607605",
"0.46524936",
"0.4637129",
"0.4606826",
"0.45846593",
"0.45... | 0.60537094 | 0 |
Processes requests for both HTTP GET and POST methods. | protected void doGet(HttpServletRequest request, HttpServletResponse response)
throws ServletException, IOException {
ArrayList<Integer> selectedClassrooms = new ArrayList<>();
for(String val: request.getParameterValues("selected")) {
selectedClassrooms.add(Integer.pars... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n protected void doPost(final HttpServletRequest req, final HttpServletResponse resp) throws ServletException, IOException {\n final String method = req.getParameter(METHOD);\n if (GET.equals(method)) {\n doGet(req, resp);\n } else {\n resp.setStatus(HttpServletResponse.SC_METHOD_NOT_... | [
"0.7005406",
"0.66572356",
"0.6604074",
"0.65101326",
"0.64464515",
"0.64432913",
"0.6439602",
"0.64311135",
"0.642902",
"0.6425377",
"0.6425377",
"0.6420841",
"0.6420841",
"0.6420841",
"0.6417446",
"0.64133376",
"0.64133376",
"0.6399404",
"0.6395047",
"0.6395047",
"0.6393712... | 0.0 | -1 |
TODO Autogenerated method stub | @Override
public void run() {
isAlive = false;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\r\n\tpublic void comer() \r\n\t{\n\t\t\r\n\t}",
"@Override\n\tpublic void comer() {\n\t\t\n\t}",
"@Override\n public void perish() {\n \n }",
"@Override\r\n\t\t\tpublic void annadir() {\n\r\n\t\t\t}",
"@Override\n\tpublic void anular() {\n\n\t}",
"@Override\n\tprotected void getExr... | [
"0.6671074",
"0.6567672",
"0.6523024",
"0.6481211",
"0.6477082",
"0.64591026",
"0.64127725",
"0.63762105",
"0.6276059",
"0.6254286",
"0.623686",
"0.6223679",
"0.6201336",
"0.61950207",
"0.61950207",
"0.61922914",
"0.6186996",
"0.6173591",
"0.61327106",
"0.61285484",
"0.608016... | 0.0 | -1 |
go through each moveable object | private void setNodeConnectors(){
for (MoveableObject moveableObject : gameObjects.getMoveableObjectsList()) {
// if the hashmap doesn't contain that radius then make the nodes
if (!nodeMap.containsKey(moveableObject.getObjectRadius())){
bufferedStationaryObstacles =... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private boolean updateMovingObjects(double elapsedSeconds) {\n for(Movable movingObj : engine.getMovingObjects()){\n double dx = 0, dy = 0;\n switch (movingObj.getFacing()){\n case UP:\n dy -= movingObj.getSpeed() * GRID_SIZE * elapsedSeconds;\n ... | [
"0.66834337",
"0.66012746",
"0.65674216",
"0.6537636",
"0.64115244",
"0.6395218",
"0.63849676",
"0.6315673",
"0.6312731",
"0.6312251",
"0.6310383",
"0.63078076",
"0.6302739",
"0.6263179",
"0.62549436",
"0.6204251",
"0.61909366",
"0.61547506",
"0.6113787",
"0.60943073",
"0.609... | 0.0 | -1 |
go through the hashmap and get the appropriate nodeConnector | public ArrayList<KPoint> getPathPoints(KPoint startPoint, KPoint endPoint, int objectRadius){
double maxConnectionDistanceFromStartAndEndPointsToObstacles = maxConnectionDistanceBetweenObstacles;
NodeConnector node = (NodeConnector) nodeMap.get(objectRadius);
ArrayList<PathBlockingObstacle> ob... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"Connector getConnector(int index);",
"Map getConnectionManagerMap();",
"private Client findClient() {\n if ( key != null )\n return clientConnections.getConnection(key);\n else { //use keyCluster to find client\n return clientConnections.getConnection( keyCl... | [
"0.593699",
"0.58908296",
"0.55760074",
"0.5493732",
"0.54519373",
"0.54414",
"0.53177005",
"0.5274909",
"0.5224858",
"0.520134",
"0.51994604",
"0.51178753",
"0.5104916",
"0.50763035",
"0.5069218",
"0.5044898",
"0.50070083",
"0.5003873",
"0.49984083",
"0.49937895",
"0.4981857... | 0.0 | -1 |
repeat for each moveable object | public void moveObjectsAlongPath(){
for (int i=0; i<gameObjects.getMoveableObjectsList().size(); i++){
MoveableObject movingOb = gameObjects.getMoveableObjectsList().get(i);
if (movingOb.getPathDestination()!=null ){
KPoint... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void move() {\r\n\t\tmoveCount++;\r\n\t}",
"@Override\n\tpublic void makeNextMove() \n\t{\n\t}",
"private void randomMove() {\n }",
"public void move() {\r\n\t\tthis.swim();\r\n\t\tthis.swim();\r\n\t\tthis.swim();\r\n\t\tthis.swim();\r\n\t\tthis.swim();\r\n\t\tthis.swim();\r\n\t\tthis.swim();\r\n\t... | [
"0.68882495",
"0.6840661",
"0.6706359",
"0.66982454",
"0.66090673",
"0.6584404",
"0.6485088",
"0.6456513",
"0.6454904",
"0.6416398",
"0.6394383",
"0.63820475",
"0.6368092",
"0.6293158",
"0.628855",
"0.62820023",
"0.62696534",
"0.62653804",
"0.6255368",
"0.62419343",
"0.621733... | 0.6169385 | 25 |
test for drawing the obstacles | public ArrayList<PathBlockingObstacle> getStationaryObstacles(){
ArrayList<PathBlockingObstacle> obstacles = (ArrayList)obstaclesMap.get(gameObjects.getMoveableObjectsList().get(0).getObjectRadius());
return obstacles;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private void drawObstacle(Graphics2D g2){\n\t\tif( obstacleExists() ){\n\t\t\t// Get the overlay screen position of the obstacle.\n\t\t\tPoint scr_obs_top = overlayPoint(toScaledX(getObstacleDistance()+getDefaultTHR()), toScaledY(-getObstacleHeight()));\n\t\t\tPoint scr_obs_bottom = overlayPoint(toScaledX(getObsta... | [
"0.68571174",
"0.670964",
"0.6704004",
"0.6563452",
"0.6550401",
"0.6353997",
"0.6352511",
"0.63402575",
"0.6318694",
"0.6220697",
"0.6212439",
"0.61992645",
"0.619027",
"0.61693597",
"0.6167369",
"0.61605895",
"0.61225724",
"0.61056197",
"0.6085746",
"0.60483754",
"0.6043756... | 0.0 | -1 |
The LocalDate represents a date in ISO format (yyyyMMdd) without time. | public static void main(String[] args) {
LocalDate localDate = LocalDate.now();
System.out.println("LocalDate: " + localDate);
System.out.println(LocalDate.of(2019, 04, 16));
System.out.println(LocalDate.parse("2019-04-16"));
////////////////////////////////////////////////////////
LocalDate tomorrow =... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"LocalDate getDate();",
"Date date(LocalDate date);",
"public LocalDate getDate() {\n return date;\n }",
"@Override\n public LocalDate getDate() {\n return null;\n }",
"public LocalDate getDate() {\n return date;\n }",
"public LocalDate getDate() {\n return date;\n }",... | [
"0.73936325",
"0.71881515",
"0.67838955",
"0.6727861",
"0.6691928",
"0.6691928",
"0.6549875",
"0.6479021",
"0.6359533",
"0.62193185",
"0.6185043",
"0.6180954",
"0.6170521",
"0.6147574",
"0.6138134",
"0.60839957",
"0.6068309",
"0.6066844",
"0.6002054",
"0.59912103",
"0.5974744... | 0.0 | -1 |
TODO Autogenerated method stub | public static void main(String[] args) {
Thread t = new Thread(new MyRunnable1());// 新建状态
t.start();// 就绪状态
try {
t.sleep(5000);
} catch (Exception e) {
e.printStackTrace();
}
new MyRunnable1().setStop();// 线程停止
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\r\n\tpublic void comer() \r\n\t{\n\t\t\r\n\t}",
"@Override\n\tpublic void comer() {\n\t\t\n\t}",
"@Override\n public void perish() {\n \n }",
"@Override\r\n\t\t\tpublic void annadir() {\n\r\n\t\t\t}",
"@Override\n\tpublic void anular() {\n\n\t}",
"@Override\n\tprotected void getExr... | [
"0.6671074",
"0.6567672",
"0.6523024",
"0.6481211",
"0.6477082",
"0.64591026",
"0.64127725",
"0.63762105",
"0.6276059",
"0.6254286",
"0.623686",
"0.6223679",
"0.6201336",
"0.61950207",
"0.61950207",
"0.61922914",
"0.6186996",
"0.6173591",
"0.61327106",
"0.61285484",
"0.608016... | 0.0 | -1 |
creating a parameterized constructor | Student4(int i, String n) {
id = i;
name = n;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"Constructor<T> newConstructor();",
"DefaultConstructor(int a){}",
"HxMethod createConstructor(final String... parameterTypes);",
"defaultConstructor(){}",
"public Generic(){\n\t\tthis(null);\n\t}",
"T newInstance(Object... args);",
"public ParameterizedInstantiateFactory() {\r\n super();\r\n ... | [
"0.7219093",
"0.70234513",
"0.693673",
"0.6885861",
"0.68138236",
"0.67968607",
"0.6698335",
"0.66839397",
"0.66606253",
"0.6649937",
"0.6626583",
"0.65138125",
"0.64808506",
"0.63760394",
"0.6372293",
"0.6348277",
"0.6320196",
"0.6310452",
"0.62995434",
"0.6286599",
"0.62548... | 0.0 | -1 |
creating a parameterized constructor | Student4(int i, String n, int t) {
id = i;
name = n;
age = t;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"Constructor<T> newConstructor();",
"DefaultConstructor(int a){}",
"HxMethod createConstructor(final String... parameterTypes);",
"defaultConstructor(){}",
"public Generic(){\n\t\tthis(null);\n\t}",
"T newInstance(Object... args);",
"public ParameterizedInstantiateFactory() {\r\n super();\r\n ... | [
"0.7219093",
"0.70234513",
"0.693673",
"0.6885861",
"0.68138236",
"0.67968607",
"0.6698335",
"0.66839397",
"0.66606253",
"0.6649937",
"0.6626583",
"0.65138125",
"0.64808506",
"0.63760394",
"0.6372293",
"0.6348277",
"0.6320196",
"0.6310452",
"0.62995434",
"0.6286599",
"0.62548... | 0.0 | -1 |
method to display the values | void display() {
System.out.println(id + " " + name + " " + age);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void displayValues()\n {\n \tSystem.out.println(\"The name of a bicycle is \"+name);\n \tSystem.out.println(\"The cost of a bicycle is \"+cost);\n \tSystem.out.println(\"The total numer of gears \"+gears);\n \t\n \t\n }",
"public void printValues() {\n\t\tfor (int i = 0; i < 7; i++) {... | [
"0.8289284",
"0.7809706",
"0.7770151",
"0.75643086",
"0.7482198",
"0.74327594",
"0.7338533",
"0.7313772",
"0.72396016",
"0.7081672",
"0.70516",
"0.7014946",
"0.6997404",
"0.6991467",
"0.6978281",
"0.69335806",
"0.6930144",
"0.69300115",
"0.69255114",
"0.6920068",
"0.69186103"... | 0.6854468 | 35 |
creating objects and passing values | public static void main(String args[]) {
Student4 s1 = new Student4(111, "Karan");
//Log.info("Test");
Student4 s2 = new Student4(222, "Aryan", 23);
//calling method to display the values of object
s1.display();
s2.display();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Test\n public void Constructor_ObjectValues_InstanceCreated() {\n\t\ttry {\n Position position = make_PositionWithIntegerPoints(xCoordinate, yCoordinate, direction);\n Surface surface = make_SurfaceWithGivenDimensions(xDimension, yDimension);\n\t\t\tRover rover = make_RoverWithObjectValue... | [
"0.70574325",
"0.65297747",
"0.63541913",
"0.6248974",
"0.6234699",
"0.6212324",
"0.6087354",
"0.6065963",
"0.6024975",
"0.59997845",
"0.598354",
"0.5980574",
"0.5914344",
"0.5884554",
"0.5880936",
"0.58716017",
"0.58390015",
"0.5825988",
"0.58125186",
"0.58063745",
"0.580259... | 0.0 | -1 |
Save a tree on a file. | public static Tree saveTree(Tree tree, String outFile) {
if (tree == null) throw new NullPointerException("tree: null");
if (outFile == null) throw new NullPointerException("outFile: null");
TreeBuilder.saveTree(tree.tb, outFile);
return tree;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private void saveTree(File saveFile) throws FileNotFoundException {\r\n\t\tPrintStream ps = new PrintStream(saveFile); // Prepare to output to save file\r\n\t\tsaveTree(ps, getRootNode());\r\n\t\tps.close(); // Close the save file\r\n\t}",
"public void saveTree(String filename) {\r\n\t\ttry { // Try saving tree\... | [
"0.79049844",
"0.7726581",
"0.7363603",
"0.7152008",
"0.6981818",
"0.6805854",
"0.66211295",
"0.65460956",
"0.6503389",
"0.64902663",
"0.642824",
"0.6399494",
"0.6309287",
"0.62664175",
"0.6248563",
"0.6242364",
"0.6038461",
"0.60299736",
"0.6019368",
"0.59962636",
"0.5992856... | 0.7161307 | 3 |
Load a tree from a file. | public static Tree loadTree(String inFile) {
if (inFile == null) throw new NullPointerException("inFile: null");
TreeBuilder tb = TreeBuilder.loadTree(inFile);
return tb == null ? null : new Tree(tb);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private static DecisionTree loadTree(File file) throws FileNotFoundException {\r\n\t\tScanner scan = new Scanner(file); // Read from file\r\n\t\t// First line of file is question at root node\r\n\t\tDecisionTree dt = new DecisionTree(scan.nextLine());\r\n\t\tBinaryNode<String> root = dt.getRootNode();\r\n\t\tfillT... | [
"0.7695734",
"0.7525982",
"0.72663635",
"0.69762564",
"0.6559921",
"0.64634305",
"0.6453183",
"0.6371325",
"0.63195574",
"0.6309153",
"0.6249276",
"0.62193036",
"0.6186765",
"0.61075854",
"0.6096798",
"0.60933864",
"0.6069449",
"0.5928384",
"0.5919075",
"0.5860208",
"0.582713... | 0.72693294 | 2 |
Implemented equality among trees. Not sure it will work. | @Override
public int hashCode() {
final int prime = 31;
int result = 1;
result = prime * result + ((tb == null) ? 0 : tb.hashCode());
return result;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public boolean equal(Tree T) {\n if(T.count() != count()) {\n return false;\n } else {\n return equalNodes(root,T.root);\n }\n }",
"@Override\r\n\tpublic boolean isEqual(Node node) {\n\t\treturn false;\r\n\t}",
"public void equalsCheck() {\n System.out.print... | [
"0.75099313",
"0.73878944",
"0.7298092",
"0.72963464",
"0.7279593",
"0.7029307",
"0.7002929",
"0.69921356",
"0.69844985",
"0.6982037",
"0.6971012",
"0.69054735",
"0.6839839",
"0.67785144",
"0.676822",
"0.67384255",
"0.67266405",
"0.67156124",
"0.6715256",
"0.6699898",
"0.6656... | 0.0 | -1 |
standard:: using one basic beginning method to get the input, call the recursive and return the final result using another void return type of the same name as the overloading and recursive down to the road basic interface with final return type Note: in the basic interface we only need one parameter, i.e. the root | ArrayList< LinkedList< Node > > levellist(Node root)
{
//results contain all the linkedlists containing all the nodes on each level of the tree
ArrayList< LinkedList< Node > > results = new ArrayList< LinkedList< Node > > ();
//basic condition for the following built-in calling of recursive
levellist(root, results,... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void work(RootNode root) throws Exception;",
"protected abstract void traverse();",
"public static void main(String[] args) {\n\n TreeNode node1 = new TreeNode(1);\n TreeNode node2 = new TreeNode(2);\n TreeNode node3 = new TreeNode(3);\n TreeNode node4 = new TreeNode(4);\n ... | [
"0.6035457",
"0.5744705",
"0.5684813",
"0.56583077",
"0.55165994",
"0.54646844",
"0.54209334",
"0.5408751",
"0.53461057",
"0.531973",
"0.52993774",
"0.5289165",
"0.5279782",
"0.52788985",
"0.5276386",
"0.5272718",
"0.5223957",
"0.5223774",
"0.52173275",
"0.5210888",
"0.515058... | 0.5073134 | 26 |
following interface with void type in this overloaded function we need three parameters passed from the basic GUI interface | void levelList(Node root, ArrayList< LinkedList< Node > > results, int level)
{
if(root == null) return; // base case: the outlet of the recursive
LinkedList<Node> list = null; // initialize list with null, i.e. we did not create it yet
//because we use the DFS therefore we must pass the level as one of the parame... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public abstract void actionPerformed(GuiButton guiButton);",
"@Override\n\tpublic void guiTinNhan() {\n\n\t}",
"public interface GUI {\n\n /**\n * Adds a MouseListener to the GUI.\n * @param mouseListener added to the GUI.\n */\n void addMouseListener(MouseListener mouseListener);\n\n /**\... | [
"0.63986534",
"0.63522017",
"0.62565607",
"0.6122353",
"0.6058947",
"0.6008733",
"0.59794164",
"0.59765404",
"0.59593165",
"0.5941216",
"0.5938274",
"0.59082323",
"0.58889914",
"0.5884556",
"0.587794",
"0.5876319",
"0.587236",
"0.58506465",
"0.5836368",
"0.5818087",
"0.581720... | 0.0 | -1 |
////////////////////////////////////////////////////////////////////////// End of custom mappings ////////////////////////////////////////////////////////////////////////// | public Patient() {
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void mapping() {\n\t\t\n\t}",
"public abstract AnnotationMap mo30683d();",
"private static void createTypeMap() {\n\n }",
"@Override\n public String mapping() {\n return StringUtils.lines(\n \"foo.bar.Baz -> foo.bar.Baz:\", \" java.lang.Object f1 -> a\", \" java.lang.String f2 -> a\");... | [
"0.75489783",
"0.66221595",
"0.6476321",
"0.6307363",
"0.6257793",
"0.62155",
"0.6187813",
"0.6177484",
"0.6171128",
"0.6156901",
"0.6155117",
"0.6143827",
"0.61408734",
"0.61392754",
"0.61139",
"0.6081774",
"0.60649604",
"0.60533124",
"0.6039588",
"0.60379934",
"0.6037088",
... | 0.0 | -1 |
TODO: Warning this method won't work in the case the id fields are not set | @Override
public boolean equals(Object object) {
if (!(object instanceof Patient)) {
return false;
}
Patient other = (Patient) object;
if (this.id == null && other.id == null && this != other) {
return false;
}
if ((this.id == null && other.id ... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private void setId(Integer id) { this.id = id; }",
"private Integer getId() { return this.id; }",
"public void setId(int id){ this.id = id; }",
"public void setId(Long id) {this.id = id;}",
"public void setId(Long id) {this.id = id;}",
"public void setID(String idIn) {this.id = idIn;}",
"public void se... | [
"0.68948644",
"0.6837785",
"0.67038405",
"0.6639133",
"0.6639133",
"0.65911627",
"0.6576973",
"0.6576973",
"0.6573157",
"0.6573157",
"0.6573157",
"0.6573157",
"0.6573157",
"0.6573157",
"0.65598476",
"0.65598476",
"0.6543178",
"0.6523156",
"0.65143406",
"0.6486455",
"0.6475413... | 0.0 | -1 |
Created by kburkhardt on 1/24/15. | public interface GameServerState<Data> extends ServerState {
void setId(int id);
int getId();
Data getClusterEntry();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n public void perish() {\n \n }",
"@Override\n\tpublic void grabar() {\n\t\t\n\t}",
"@Override\n\tpublic void comer() {\n\t\t\n\t}",
"private stendhal() {\n\t}",
"@Override\n\tpublic void sacrifier() {\n\t\t\n\t}",
"@Override\n\tprotected void interr() {\n\t}",
"public final void... | [
"0.58455807",
"0.5791059",
"0.56601936",
"0.56469935",
"0.5614285",
"0.56104904",
"0.5599285",
"0.55924106",
"0.55674386",
"0.55674386",
"0.55114466",
"0.55092025",
"0.55092025",
"0.55092025",
"0.55092025",
"0.55092025",
"0.54906726",
"0.54901785",
"0.54890007",
"0.54823345",
... | 0.0 | -1 |
Specify the base URL to the RESTful web service | @Test
public void Solution() {
RestAssured.baseURI = baseUrl;
RestAssured.useRelaxedHTTPSValidation();
JsonPath jsonpath = RestAssured.get("/comments?postId=40").body().jsonPath();
// get the jsonResponse list
List<Object> jsonResponse = jsonpath.getList("$");
assertEquals(jsonResponse.size(), 5);
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n\tprotected String getHttpBaseUrl() {\n\t\treturn this.properties.getHttpUrlBase();\n\t}",
"public abstract String getBaseURL();",
"private static String getBaseUrl() {\n StringBuilder url = new StringBuilder();\n url.append(getProtocol());\n url.append(getHost());\n url.... | [
"0.7228045",
"0.69052815",
"0.679907",
"0.6798727",
"0.67873746",
"0.67425233",
"0.67407423",
"0.67308515",
"0.67306757",
"0.6651933",
"0.6629259",
"0.6582385",
"0.6582385",
"0.6571985",
"0.6567037",
"0.6555146",
"0.65542257",
"0.6554184",
"0.6522676",
"0.65026265",
"0.643887... | 0.0 | -1 |
leggo le cartelle del fascicolo da Esb | private static CartelleAvvisiResponseType getBPSCartelleResponse( Fascicolo fascicolo) throws Exception {
CartellaAvvisiRequestType bpCartelleRequest = new CartellaAvvisiRequestType();
bpCartelleRequest.setTipologiaRichiesta(MessagesClass.getMessage("TIPOLOGIA_DOCUMENTI_TUTTI").trim()) ;
bpCartelleRequ... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public Carta(char s,int v)\r\n {\r\n valore = v;\r\n \r\n nome = \"\";\r\n \r\n codice = valore;\r\n \r\n Potenziale = new ConcurrentSkipListMap();\r\n \r\n ValoriPotenziale = new ConcurrentSkipListMap(); \r\n \r\n /*\r\n COM... | [
"0.64965993",
"0.63475794",
"0.6071892",
"0.59902084",
"0.59268296",
"0.58813554",
"0.5866403",
"0.58645874",
"0.5864464",
"0.58471006",
"0.58403885",
"0.58092964",
"0.57910997",
"0.57863027",
"0.57845944",
"0.5782026",
"0.5768458",
"0.57677424",
"0.5764929",
"0.5759331",
"0.... | 0.0 | -1 |
fine modifica_problema_transazioni 13/10/2014 inizio modifica_08/10/2014 | private static RataType[] getRataTypeFromBPSDettaglioCartellaResponse( DettaglioCartellaAvvisoResponse response) {
RataType[] result = new RataType[0];
//inizio modifica FASCICOLO_2.1
if (response.getCartellaAvviso().getPianoRateOrigine()!=null ) {
it.equitalia.dettagliocartellaavviso.wsdl.RataT... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private void affichageDateFin() {\r\n\t\tif (dateFinComptage!=null){\r\n\t\t\tSystem.out.println(\"Le comptage est clos depuis le \"+ DateUtils.format(dateFinComptage));\r\n\t\t\tif (nbElements==0){\r\n\t\t\t\tSystem.out.println(\"Le comptage est clos mais n'a pas d'éléments. Le comptage est en anomalie.\");\r\n\t... | [
"0.63138115",
"0.61593735",
"0.6148405",
"0.61025596",
"0.6027052",
"0.601694",
"0.59608024",
"0.59608024",
"0.5942456",
"0.59305406",
"0.5925967",
"0.59226716",
"0.5914946",
"0.59015316",
"0.58988583",
"0.58805734",
"0.58701247",
"0.5860164",
"0.5838158",
"0.58349526",
"0.58... | 0.0 | -1 |
inizio modifica mail 08/10/2014 10:38 | private static DocumentoType[] getDocumentoTypeFromBPSDettaglioCartellaResponse( DettaglioCartellaAvvisoResponse response) {
it.equitalia.dettagliocartellaavviso.wsdl.DocumentoType bpelDocumentoType = response.getCartellaAvviso().getDocumento();
DocumentoType[] result = new DocumentoType[1];
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"String getExpirationtMailBody( );",
"private void sendMailLogInfo() {\n\t\tif (mChangedInfoList.size() == 0) {\n\t\t\treturn;\n\t\t}\n\t\t// 1.导出信息\n\t\tString content = dumpLogInfoWithHtml();\n\t\t\n\t\t// 2. 更新收件人与标题\n\t\tmMailSender.updateMailToAndCc(mMailReceivers, mMailCcReceivers);\n\t\t\n\t\tLogger.printl... | [
"0.61524236",
"0.6069111",
"0.60064083",
"0.59422064",
"0.5914998",
"0.58934075",
"0.58036035",
"0.5742891",
"0.5705776",
"0.5616124",
"0.55663157",
"0.55623126",
"0.5508319",
"0.55073684",
"0.55038464",
"0.549713",
"0.54942375",
"0.54898345",
"0.5484559",
"0.54812974",
"0.54... | 0.0 | -1 |
fine modifica mail 08/10/2014 10:38 | static DettaglioCartellaAvvisoResponse getBPSDettaglioCartellaResponse( DettaglioCartellaAvvisoRequest request) throws Exception {
DettaglioCartellaAvvisoResponse response;
DettaglioCartellaAvvisoPortTypeProxy proxy = new DettaglioCartellaAvvisoPortTypeProxy( MessagesClass.getMessage("DETTAGLIO_CARTELLA_ESB_ENDPO... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"String getExpirationtMailBody( );",
"private void sendMailLogInfo() {\n\t\tif (mChangedInfoList.size() == 0) {\n\t\t\treturn;\n\t\t}\n\t\t// 1.导出信息\n\t\tString content = dumpLogInfoWithHtml();\n\t\t\n\t\t// 2. 更新收件人与标题\n\t\tmMailSender.updateMailToAndCc(mMailReceivers, mMailCcReceivers);\n\t\t\n\t\tLogger.printl... | [
"0.6177004",
"0.5998088",
"0.59333694",
"0.5903529",
"0.58537203",
"0.5843268",
"0.5829064",
"0.565341",
"0.5625269",
"0.5580289",
"0.5561994",
"0.54921716",
"0.54894125",
"0.54842556",
"0.5481108",
"0.5474427",
"0.5470838",
"0.5466647",
"0.54569787",
"0.54441786",
"0.5437276... | 0.0 | -1 |
INIZIO Fascicolo 2.1 20150507 | private static EnteType getEnteConcedentePianoRateazione(
it.equitalia.dettagliocartellaavviso.wsdl.PianoRateazioneType typeResponse) {
EnteType res = new EnteType();
res.setDescrizione(typeResponse.getEnteConcedente().getDescrizione());
res.setCodiceEnte(typeResponse.getEnteConcedente().getCodiceEnte()... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private static void cajas() {\n\t\t\n\t}",
"void mo1507n();",
"public void mo38117a() {\n }",
"public void mo6081a() {\n }",
"public void mo4359a() {\n }",
"public void mo55254a() {\n }",
"public void mo55254a() {\n }",
"public void mo55254a() {\n }",
"publ... | [
"0.65501523",
"0.6183705",
"0.6172345",
"0.61172104",
"0.6071212",
"0.6045922",
"0.6045922",
"0.6045922",
"0.6045922",
"0.6045922",
"0.6045922",
"0.6045922",
"0.60153335",
"0.5968837",
"0.5945011",
"0.59353817",
"0.5929287",
"0.5911117",
"0.5907389",
"0.59065586",
"0.59024006... | 0.0 | -1 |
FINE Fascicolo 2.1 20150507 inizio ModDocumentiAssociati | private static IdentificativoDocumentoType[] getDocumentiAssociatiPianoRateazione( it.equitalia.dettagliocartellaavviso.wsdl.PianoRateazioneType typeResponse) {
it.equitalia.dettagliocartellaavviso.wsdl.IdentificativoDocumentoType[] documentoAssociatoTypeResponse = typeResponse.getDocumentoAssociato();
Identifica... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public interface CfgDocument extends com.hps.july.persistence.Document, com.ibm.ivj.ejb.runtime.CopyHelper {\n\n\n\n\t/**\n\t * Get accessor for persistent attribute: savconfigidold\n\t */\n\tpublic int getSavconfigidold() throws java.rmi.RemoteException;\n\t/**\n\t * Set accessor for persistent attribute: savconf... | [
"0.6121743",
"0.5891941",
"0.5883054",
"0.5864749",
"0.58620495",
"0.58490896",
"0.5790398",
"0.5768333",
"0.5732173",
"0.57151896",
"0.5686522",
"0.5666772",
"0.56655824",
"0.5631346",
"0.5574874",
"0.55697006",
"0.5554917",
"0.5539498",
"0.55361015",
"0.5508285",
"0.5506769... | 0.0 | -1 |
TODO Autogenerated method stub | @Override
public void keyReleased(KeyEvent e) {
int keyCode = e.getKeyCode();
if (keyCode == KeyEvent.VK_SPACE)
System.exit(0);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\r\n\tpublic void comer() \r\n\t{\n\t\t\r\n\t}",
"@Override\n\tpublic void comer() {\n\t\t\n\t}",
"@Override\n public void perish() {\n \n }",
"@Override\r\n\t\t\tpublic void annadir() {\n\r\n\t\t\t}",
"@Override\n\tpublic void anular() {\n\n\t}",
"@Override\n\tprotected void getExr... | [
"0.6671074",
"0.6567672",
"0.6523024",
"0.6481211",
"0.6477082",
"0.64591026",
"0.64127725",
"0.63762105",
"0.6276059",
"0.6254286",
"0.623686",
"0.6223679",
"0.6201336",
"0.61950207",
"0.61950207",
"0.61922914",
"0.6186996",
"0.6173591",
"0.61327106",
"0.61285484",
"0.608016... | 0.0 | -1 |
TODO Autogenerated method stub | @Override
public void keyTyped(KeyEvent e) {
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\r\n\tpublic void comer() \r\n\t{\n\t\t\r\n\t}",
"@Override\n\tpublic void comer() {\n\t\t\n\t}",
"@Override\n public void perish() {\n \n }",
"@Override\r\n\t\t\tpublic void annadir() {\n\r\n\t\t\t}",
"@Override\n\tpublic void anular() {\n\n\t}",
"@Override\n\tprotected void getExr... | [
"0.66713095",
"0.6567948",
"0.652319",
"0.648097",
"0.64770466",
"0.64586824",
"0.64132667",
"0.6376419",
"0.62759",
"0.62545097",
"0.62371093",
"0.62237984",
"0.6201738",
"0.619477",
"0.619477",
"0.61924416",
"0.61872935",
"0.6173417",
"0.613289",
"0.6127952",
"0.6080854",
... | 0.0 | -1 |
Method to initialize Logger with the command BasicConfigurator.configure() and to set its level. | public static void initializeLogger(Level level) {
ClassLoader loader = Thread.currentThread().getContextClassLoader();
URL url = loader.getResource("resources/log4j.xml");
PropertyConfigurator.configure(url);
Logger logger = Logger.getLogger(BaseActivator.class);
logger.setLevel(level);
logger.info("... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"protected void initLogger() {\n initLogger(\"DEBUG\");\n }",
"private void initLogger() {\n\t\ttry {\n\t\t\tjava.util.logging.Logger rootLogger = java.util.logging.Logger.getLogger(\"\");\n\t\t\trootLogger.setUseParentHandlers(false);\n\t\t\tHandler csvFileHandler = new FileHandler(\"logger/log.csv\", ... | [
"0.6689497",
"0.6681561",
"0.66710705",
"0.6651389",
"0.6594059",
"0.6572551",
"0.65362304",
"0.651357",
"0.65063775",
"0.65015465",
"0.6493587",
"0.63954234",
"0.63636607",
"0.6358183",
"0.62839895",
"0.6271482",
"0.62675685",
"0.626665",
"0.6261692",
"0.6198976",
"0.6193958... | 0.67737234 | 0 |
Method to get information if logger is initialized. | public static boolean loggerIsInitialized() {
return loggerIsInitialized;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public boolean logInfo()\r\n {\r\n return infoLevelHandler.getBoolean();\r\n }",
"private static void _logInfo ()\n {\n System.err.println (\"Logging is enabled using \" + log.getClass ().getName ());\n }",
"static public boolean isLogging()\n {\n return GetInstance().m_bLog;\n }... | [
"0.6664043",
"0.64602417",
"0.6438265",
"0.63996834",
"0.6359927",
"0.6357873",
"0.6329416",
"0.6329416",
"0.6329416",
"0.6329416",
"0.63289094",
"0.621924",
"0.6195906",
"0.61644983",
"0.61326087",
"0.6132392",
"0.6116723",
"0.611672",
"0.609686",
"0.6092904",
"0.6061661",
... | 0.7144459 | 0 |
Method to choose the articles should be saving in the bag according the business rules. | public String chooseArticlesPackage(Bag bag) {
StringBuilder result = new StringBuilder();
double countWeightBag=0;
if(bag.getArticles() != null) {
bag.setArticles(orderArticles(bag.getArticles()));
int position=0;
int countArticles = 0;
while(countWeightBag<bag.getCapacit... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void saveArticlesList();",
"public Article save(Article article);",
"private boolean saveData() {\n // get data from input controls\n collectDataFromUI();\n\n if (!validateData()) return false;\n\n boolean isTransfer = mCommon.transactionEntity.getTransactionType().equals(Tra... | [
"0.5610241",
"0.54518723",
"0.5235617",
"0.51539737",
"0.5147993",
"0.50872564",
"0.5083981",
"0.50445807",
"0.5023662",
"0.49780244",
"0.49702287",
"0.49584982",
"0.49335268",
"0.49208653",
"0.49139953",
"0.490096",
"0.49002793",
"0.48890278",
"0.48764122",
"0.48634726",
"0.... | 0.0 | -1 |
Method to order the articles for analizing each one, so take the decisition of the articles bring in bag. | private List<Article> orderArticles(List<Article> things){
Comparator<Article> comparatorPrizes = new Comparator<Article>() {
public int compare(Article x, Article y) {
return (int) (x.getPrize() - y.getPrize());
}
};
Collections.sort(things,comparatorPrizes);
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private void sortEntities(){\n for (int i = 1; i < sorted.size; i++) {\n for(int j = i ; j > 0 ; j--){\n \tEntity e1 = sorted.get(j);\n \tEntity e2 = sorted.get(j-1);\n if(getRL(e1) < getRL(e2)){\n sorted.set(j, e2);\n sor... | [
"0.60410684",
"0.59956723",
"0.59458756",
"0.583357",
"0.5767155",
"0.5711642",
"0.56232727",
"0.55985063",
"0.55979586",
"0.55874187",
"0.543234",
"0.54294276",
"0.53926784",
"0.5381414",
"0.53752685",
"0.53720593",
"0.5367483",
"0.53539354",
"0.53316844",
"0.5317036",
"0.52... | 0.68575495 | 0 |
Interval at which the news should be collected. No news within this interval will be collected. This is in Minutes / / Class constructor for RSS parser. / / ID of the source that is being parsed / Recognizable Name of the source that is being parsed / Accessible URL of the source | public RssParser(int _SourceID, String _SourceName, String _SrcURL, int _ReadInterval)
{
SourceID = _SourceID;
SourceName = _SourceName;
Src_URL = _SrcURL;
ReadInterval = _ReadInterval;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public int getInterval() { return _interval; }",
"public SourceRecord(Integer id, String url, String name, Short invalid, Long lastUpdateTime, Long lastFetchTime, Short autoFetchInterval, String basePath) {\n super(Source.SOURCE);\n\n set(0, id);\n set(1, url);\n set(2, name);\n ... | [
"0.55621874",
"0.5536951",
"0.5411229",
"0.5259436",
"0.5256928",
"0.52357477",
"0.5231611",
"0.5201289",
"0.5184466",
"0.51359737",
"0.5132839",
"0.5110152",
"0.5074536",
"0.5044714",
"0.5042041",
"0.50379074",
"0.5013031",
"0.49804315",
"0.4979164",
"0.49747318",
"0.497329"... | 0.68212944 | 0 |
/ / Parse RSS feeds but only one URL at a time. Notice the function only has a single source URL in args. / Parsing multiple source URI has to be done via loop in the calling function. / | public void PopulateRSSData()
{
try
{
URL Feed = ParseRSSFromFeed();
ParseRSS(Feed);
}
catch(java.net.MalformedURLException exp)
{
String message = exp.getMessage();
System.out.println(message);
}
catch(com.romet... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public URL ParseRSSFromFeed() throws java.net.MalformedURLException\n {\n URL feedUrl = new URL(Src_URL);\n return feedUrl;\n }",
"public List<LinkDetails> scrapeRSSPageForLinks(String rssUrl) {\n\t\tString description = \"\";\n\t\tString title = \"\";\n\t\tString link = \"\";\n\t\tString pub... | [
"0.69046986",
"0.65805674",
"0.6246149",
"0.6024916",
"0.600455",
"0.59115267",
"0.5872272",
"0.5772476",
"0.5771507",
"0.5753881",
"0.5634839",
"0.56343263",
"0.56238735",
"0.5615778",
"0.5574957",
"0.55691755",
"0.5554161",
"0.5536199",
"0.5526821",
"0.5525043",
"0.5495744"... | 0.65198725 | 2 |
/ / Return source URL from the given string. / | public URL ParseRSSFromFeed() throws java.net.MalformedURLException
{
URL feedUrl = new URL(Src_URL);
return feedUrl;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public String getUrl(final String sourceURL) {\n\n String result = null;\n\n if (sourceURL == null) {\n // if only one URL is configured, \"default URL\" should mean that\n // URL.\n List<String> urls = descriptor().getUrls();\n if (!urls.isEmpty()) {\n ... | [
"0.69550294",
"0.6820826",
"0.6820826",
"0.6820826",
"0.6820826",
"0.6820826",
"0.68058455",
"0.68058455",
"0.68058455",
"0.68058455",
"0.68058455",
"0.68058455",
"0.66520625",
"0.65738666",
"0.6533551",
"0.65140945",
"0.6494836",
"0.64634305",
"0.64284575",
"0.6428314",
"0.6... | 0.0 | -1 |
/ / Parse RSS from the input URL and insert to DB. / / RSS feed URL | public void ParseRSS(URL feedUrl) throws com.rometools.rome.io.FeedException, java.io.IOException {
//TODO: EVERY THING HERE SHOULD BE IN A TRANSACTION
List<String> HashFields = new ArrayList<>();
SyndFeedInput input = new SyndFeedInput();
SyndFeed feed = input.build(new XmlReader(feedUr... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public URL ParseRSSFromFeed() throws java.net.MalformedURLException\n {\n URL feedUrl = new URL(Src_URL);\n return feedUrl;\n }",
"public void PopulateRSSData()\n {\n try\n {\n URL Feed = ParseRSSFromFeed();\n ParseRSS(Feed);\n }\n catch(ja... | [
"0.6959614",
"0.6898664",
"0.67438",
"0.6496058",
"0.6477775",
"0.62868774",
"0.62531036",
"0.6247518",
"0.61168456",
"0.6023782",
"0.5967723",
"0.59606135",
"0.58757323",
"0.58617777",
"0.58349127",
"0.5826652",
"0.5826206",
"0.575102",
"0.5749206",
"0.5734009",
"0.57313734"... | 0.6881146 | 2 |
/ / Insert the parsed RSS fields (Individual Fields Specific) to DB. / / Class containing all parsed values | public void InsertToDB(RSSFields RssFieldValues, int ChannelID) throws java.sql.SQLException
{
String SQLQuery = "INSERT INTO tbl_ex_RSSData " +
" (SourceID, ChannelInstanceID, Title, Link, Description,PublishedDate,UpdatedDate, ParsedDate, Hash) " +
" ... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void PopulateRSSData()\n {\n try\n {\n URL Feed = ParseRSSFromFeed();\n ParseRSS(Feed);\n }\n catch(java.net.MalformedURLException exp)\n {\n String message = exp.getMessage();\n System.out.println(message);\n }\n ... | [
"0.61580324",
"0.5749993",
"0.54414856",
"0.5254157",
"0.5201817",
"0.51893395",
"0.5069257",
"0.50674003",
"0.50623953",
"0.5042099",
"0.50344926",
"0.50231296",
"0.501948",
"0.49955225",
"0.49757916",
"0.49554634",
"0.49366093",
"0.49243394",
"0.49241367",
"0.48519573",
"0.... | 0.5708017 | 2 |
/ / Insert the parsed RSS fields (Channel Specifics) to DB. / / Class containing all parsed values for channel specific data | public int InsertChannelDetails(RSSChannelElements ChannelElements) throws java.sql.SQLException
{
String SQLQuery = "INSERT INTO tbl_ex_channeldetails " +
" (SourceID, AuthorName, Language, PublishedDate, WebMaster, LastBuildDate, ManagingEditor, Generator, Description) "... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void ParseRSS(URL feedUrl) throws com.rometools.rome.io.FeedException, java.io.IOException {\n //TODO: EVERY THING HERE SHOULD BE IN A TRANSACTION\n List<String> HashFields = new ArrayList<>();\n SyndFeedInput input = new SyndFeedInput();\n SyndFeed feed = input.build(new XmlRead... | [
"0.6648855",
"0.62885463",
"0.6230488",
"0.61157876",
"0.5583709",
"0.5302745",
"0.5246573",
"0.52407354",
"0.5179852",
"0.5114815",
"0.51018476",
"0.4998882",
"0.49852285",
"0.4953471",
"0.49506631",
"0.49451917",
"0.48825562",
"0.48614934",
"0.48165137",
"0.4805462",
"0.478... | 0.51533395 | 9 |
Create an independent copy of this JSON member. | public JsonMember copy() {
return new JsonMember(name, value.copy());
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public JsonFactory copy()\n/* */ {\n/* 324 */ _checkInvalidCopy(JsonFactory.class);\n/* */ \n/* 326 */ return new JsonFactory(this, null);\n/* */ }",
"@SuppressWarnings(\"unchecked\")\n @Override\n public <T extends JsonNode> T deepCopy() { return (T) this; }",
"public He... | [
"0.6518772",
"0.5967288",
"0.59662026",
"0.5787729",
"0.5778709",
"0.5711762",
"0.5687242",
"0.56691307",
"0.5663928",
"0.56497574",
"0.56295407",
"0.5622642",
"0.5622604",
"0.56200916",
"0.55804497",
"0.55768555",
"0.5573292",
"0.55479026",
"0.55453193",
"0.5503251",
"0.5496... | 0.837041 | 0 |
uwi solution (ideas: created 2d array if we wanna keep things together like here difficulty profit. Monolith array approach.) | public int _maxProfitAssignmentBetter(int[] difficulty, int[] profit, int[] worker) {
int n = difficulty.length;
int [][] dp = new int [n][];
for (int i = 0; i < n; i ++)
dp [i] = new int[] { difficulty[i], profit[i] };
Arrays.sort(dp, (a, b) -> (a [0] != b [0]) ? (a [0] - ... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static void main(String[] args) { \r\n int[][] a = new int[3][5]; // прямоугольный массив\r\n int size1 = a.length;\r\n int size2 = a[0].length;\r\n int[][] b = new int[3][]; // массив переменной длины (тут - треугольный)\r\n b[0] = new int[1];\r\n b[1] = new... | [
"0.6106231",
"0.6083643",
"0.6067454",
"0.59514195",
"0.5936942",
"0.5873287",
"0.58613163",
"0.5814743",
"0.58097625",
"0.580849",
"0.5793755",
"0.578277",
"0.5769761",
"0.57694197",
"0.57693076",
"0.57388145",
"0.5736039",
"0.5733333",
"0.5720896",
"0.57055694",
"0.56939787... | 0.0 | -1 |
we can use the first dimension of 2d array as index of 1d array itself use the other dimension as values. (optimized monolith approach) | public int _maxProfitAssignmentBest(int[] difficulty, int[] profit, int[] worker) {
// value index reverse array
int [] dp = new int [100001];
// nice strategy to use in multi-array approach
// using difficulty as index, profit as value.
// (difficulty array sorted by default, e... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static void main(String[] args) { \r\n int[][] a = new int[3][5]; // прямоугольный массив\r\n int size1 = a.length;\r\n int size2 = a[0].length;\r\n int[][] b = new int[3][]; // массив переменной длины (тут - треугольный)\r\n b[0] = new int[1];\r\n b[1] = new... | [
"0.6236481",
"0.61202514",
"0.5996663",
"0.5735107",
"0.57283896",
"0.5681327",
"0.5627206",
"0.56223404",
"0.5601616",
"0.55920273",
"0.55790454",
"0.55749685",
"0.5562486",
"0.55511606",
"0.55037206",
"0.5490395",
"0.54409057",
"0.54161805",
"0.5411116",
"0.5408849",
"0.539... | 0.0 | -1 |
we can optimize while collection. Build forward during the Collection time. (optimized monolith approach) | public int _maxProfitAssignmentSortedCollectors(int[] difficulty, int[] profit, int[] worker) {
int n = difficulty.length;
int [][] dp = new int [n][2]; // difficulty, profit pair (dp)
for (int idx = 0; idx < n; idx ++) {
dp [idx][0] = difficulty [idx];
dp [idx][1] = pro... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@SuppressWarnings(\"serial\")\r\n\tprivate void fcbuild() {\n\t\tfor (int i = 0; i < keys.size(); i++) {\r\n\t\t\tString s = keys.get(i);\r\n\t\t\tfc.add(new ArrayList<String>() {\r\n\t\t\t\t{\r\n\t\t\t\t\tadd(sharedV.get(s).get(0));\r\n\t\t\t\t\tadd(s);\r\n\t\t\t\t}\r\n\t\t\t});\r\n\t\t}\r\n\r\n\t\tfor (int i = 0... | [
"0.59323645",
"0.5700556",
"0.55240124",
"0.52680767",
"0.5250331",
"0.51783586",
"0.5167583",
"0.51598936",
"0.5149548",
"0.50912684",
"0.50867754",
"0.5041359",
"0.5040846",
"0.50114423",
"0.5007294",
"0.5006007",
"0.49995074",
"0.4998849",
"0.49722576",
"0.49718934",
"0.49... | 0.0 | -1 |
my approach similar to uwi. (ideas: created a third array indexes to store the relation between difficulty and profit. Distributed arrays approach.) | public int _maxProfitAssignment(int[] difficulty, int[] profit, int[] worker) {
Integer [] indexes = new Integer [difficulty.length];
for (int idx = 0; idx < indexes.length; idx ++) indexes [idx] = idx;
Arrays.sort(indexes, (a, b) -> difficulty [a] != difficulty [b] ?
difficulty... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private void buildArray() throws VerificationException\n {\n \tindices = new int[length];\n \tcommonality = new int[length];\n \n \tcommonality[0] = -1;\n \tfor( int i=0; i<indices.length; i++ ){\n \t indices[i] = i;\n \t}\n \n sort();\n }",
"public static Object[] ticket_combo(int l, Set<Set<... | [
"0.5661348",
"0.55741626",
"0.5551597",
"0.55431396",
"0.55388886",
"0.553581",
"0.5500462",
"0.5494798",
"0.54739",
"0.5432241",
"0.5417037",
"0.53727186",
"0.53550833",
"0.53529763",
"0.5311245",
"0.52881646",
"0.52619565",
"0.5260917",
"0.5254436",
"0.52511024",
"0.5244527... | 0.5275454 | 16 |
Gets jaxb context data. | @Test
void getJaxbContextData(SoftAssertions softly) {
ComparatorJaxbContextDataProvider target = new ComparatorJaxbContextDataProvider();
Collection<JaxbContextData> actual = target.getJaxbContextData();
softly.assertThat(actual)
.containsExactly(new JaxbContextData(ObjectFactory.class.getPackage... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private JAXBContext getJaxContext()\n {\n JAXBContext jc = null;\n \n try\n {\n jc = JAXBContext.newInstance(\"generated\");\n }\n catch (JAXBException e)\n {\n e.printStackTrace();\n }\n return jc;\n }",
"pub... | [
"0.6841471",
"0.664883",
"0.6500057",
"0.6495569",
"0.629308",
"0.6238154",
"0.62332904",
"0.6204135",
"0.61953574",
"0.61953574",
"0.61953574",
"0.61879784",
"0.6119424",
"0.611207",
"0.6103814",
"0.6098982",
"0.6069671",
"0.60670257",
"0.60236675",
"0.60156196",
"0.5991049"... | 0.53532803 | 75 |
old data include method below, there is comment | public void scandb_book_info(String table_name) {
sql = " SELECT * from " + table_name + ";";
try {
result = statement.executeQuery(sql);
while (result.next()) {
set_book_info(result.getInt("id"), result.getString("name"), result.getString("url"));
}... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"protected void loadData()\n {\n }",
"public void setIncludes(String includes)\n {\n this.includes = includes;\n }",
"@Override\n\tprotected void getData() {\n\t\t\n\t}",
"protected abstract void loadData();",
"private void parseData() {\n\t\t\r\n\t}",
"@Override\r\n\tpublic void crawl_data() {\n\t... | [
"0.6139704",
"0.570362",
"0.56979764",
"0.56438124",
"0.54716027",
"0.5469597",
"0.5439888",
"0.54363495",
"0.5430885",
"0.5430885",
"0.54282075",
"0.5379788",
"0.532639",
"0.53243023",
"0.53243023",
"0.53243023",
"0.53243023",
"0.53243023",
"0.53243023",
"0.53006124",
"0.526... | 0.0 | -1 |
constructor init the Buttons of the StartMenu | @Override
public final void initButtons(int x, int y, int addy){
String data = s_datapath;
addButton(data + "SM_NeuesSpiel" + s_typ, x, y, 1);
addButton(data + "OM_SpielSpeichern" + s_typ, x, y + addy, 2);
addButton(data + "SM_SpielLaden" + s_typ, x, y + addy * 2, 3);
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void initMenu() {\n\t\t\r\n\t\treturnToGame = new JButton(\"Return to Game\");\r\n\t\treturnToGame.setBounds(900, 900, 0, 0);\r\n\t\treturnToGame.setBackground(Color.BLACK);\r\n\t\treturnToGame.setForeground(Color.WHITE);\r\n\t\treturnToGame.setVisible(false);\r\n\t\treturnToGame.addActionListener(this);\r\... | [
"0.7706423",
"0.748784",
"0.73391783",
"0.72927845",
"0.7196089",
"0.71318763",
"0.7069379",
"0.7053129",
"0.7037119",
"0.6958277",
"0.6920505",
"0.6889352",
"0.6835056",
"0.68298167",
"0.6813985",
"0.67969644",
"0.6793507",
"0.6788672",
"0.67333007",
"0.67274106",
"0.6717670... | 0.6580768 | 37 |
/ Here the function tries to get the solution path. Since the Nodes are connected. We take the goal node and use the method getParent() until we arrive at the startNode. The path is printed to output. | private void solutionPath(Node n){
ArrayList<String> num = new ArrayList<>();
num.add(n.getDigit().getDigitString());
Node node = n.getParent();
while(true){
if(node == startNode){
num.add(node.getDigit().getDigitString());
break;
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public List<Node> findPath(Vector2i start, Vector2i goal) {\n\t\tList<Node> openList = new ArrayList<Node>(); //All possible Nodes(tiles) that could be shortest path\n\t\tList<Node> closedList = new ArrayList<Node>(); //All no longer considered Nodes(tiles)\n\t\tNode current = new Node(start,null, 0, getDistance(s... | [
"0.7252731",
"0.68260264",
"0.6671419",
"0.66349065",
"0.66123354",
"0.6603679",
"0.6580846",
"0.65430224",
"0.6503828",
"0.6497051",
"0.64705145",
"0.6415798",
"0.6354924",
"0.6301623",
"0.62661606",
"0.6257092",
"0.6247333",
"0.6240979",
"0.62342954",
"0.6218692",
"0.620133... | 0.6826425 | 1 |
/ Here we take the expanded nodes and print it. | private void printExpanded(Queue<Node> expanded){
ArrayList<String> nodes = new ArrayList<>();
for(Node s : expanded){
if(s != null){
nodes.add(s.getDigit().getDigitString());
}
}
if (forbidden.size() == 0){
int size = nodes.size()... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void printTree() {\n Object[] nodeArray = this.toArray();\n for (int i = 0; i < nodeArray.length; i++) {\n System.out.println(nodeArray[i]);\n }\n }",
"public void tree()\n\t{\n\t\tIterable<Position<FileElement>> toPrint = fileSystem.PreOrder();\n\t\tfor (Pos... | [
"0.75091845",
"0.7240713",
"0.71894604",
"0.70823896",
"0.7065136",
"0.706287",
"0.7039093",
"0.6979379",
"0.69171613",
"0.6915615",
"0.6894241",
"0.6880421",
"0.6855082",
"0.6846921",
"0.6829338",
"0.6819054",
"0.68090576",
"0.67836213",
"0.6773025",
"0.67710125",
"0.6757601... | 0.7714829 | 0 |
/ Here we temporarily make the children. No parentchild connections are made here. This is a helper function to cycleCheck | private ArrayList<String> makeChildren(Node current) {
ArrayList<String> current_children = new ArrayList<>();
if (current != null && current.getDigit().last_changed != 0) {
//-1 child first digit
if ((Integer.parseInt(current.getDigit().getFirst_digit()) - 1 >= 0)) {
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private void createChildren() {\n\t\t\n\t\tfor(int i=0;i<horizontal;i++) {\n\t\t\t\n\t\t\tAction a = new Action(i);\n\t\t\tif(!gameOver && actionIsValid(a)) {\n\t\t\t\t\n\t\t\t\tPlayer otherPlayer;\n\t\t\t\t\n\t\t\t\tif(player == Player.PLAYER_BLUE) {\n\t\t\t\t\totherPlayer = Player.PLAYER_RED;\n\t\t\t\t}else {\n\... | [
"0.6246335",
"0.6222769",
"0.6081489",
"0.56986165",
"0.5600083",
"0.5569997",
"0.55359197",
"0.55359197",
"0.55359197",
"0.5526154",
"0.55173075",
"0.55170625",
"0.55154157",
"0.5506944",
"0.55060697",
"0.5481505",
"0.5470102",
"0.543657",
"0.54289436",
"0.53934395",
"0.5393... | 0.5201133 | 42 |
/ Here I check for cycles. | private boolean cycleCheck(Node current, Queue<Node> expanded){
if( expanded.size() == 0){
return false; //Because current is root
}
for(Node nodeInExpanded : expanded){
if(current!=null && current.getDigit().getDigitString().equals(nodeInExpanded.getDigit().getDigitSt... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private Boolean checkCycle() {\n Node slow = this;\n Node fast = this;\n while (fast.nextNode != null && fast.nextNode.nextNode != null) {\n fast = fast.nextNode.nextNode;\n slow = slow.nextNode;\n if (fast == slow) {\n ... | [
"0.8022661",
"0.7582115",
"0.7467581",
"0.7309301",
"0.6859185",
"0.68320376",
"0.683162",
"0.6827226",
"0.6763716",
"0.6718021",
"0.67077047",
"0.6691687",
"0.6690034",
"0.66510946",
"0.6608548",
"0.6603222",
"0.65824634",
"0.6558572",
"0.65290487",
"0.65054256",
"0.65023834... | 0.58040166 | 89 |
/ This function performs the main functionality for the DFS. | private boolean helperDFS(Node current){
if(expandedNode.size() == 999){
//limit has been reached. jump out of recursion.
expandedNode.add(current);
System.out.println("No solution found.");
printExpanded(expandedNode);
System.exit(0);
ret... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"void DFS() {\n \t\n \t// Mark all the vertices as not visited(set as false by default in java) \n \tboolean visited[] = new boolean[V];\n \t\n \t// Call the recursive helper function to print DFS traversal \n // starting from all vertices one by one \n \tfor (int i=0; i<V; i++) { \n \t... | [
"0.76480645",
"0.75557256",
"0.7514414",
"0.75062317",
"0.7277212",
"0.722608",
"0.71571517",
"0.7138194",
"0.70538133",
"0.70303774",
"0.70216507",
"0.69316167",
"0.6903866",
"0.6777672",
"0.6751997",
"0.666118",
"0.6642507",
"0.66257745",
"0.66136944",
"0.6573592",
"0.65537... | 0.0 | -1 |
need a function that returns. So that some states can cancel out and thus no stackoverflow. | private void DepthFirstSearch(Node current){
helperDFS( current );
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n public Boolean call() throws Exception {\n return this.state22();\n }",
"protected abstract List breakOutOfStateStack();",
"private Object getState() {\n\treturn null;\r\n}",
"private static int runStateOf(int c) { return c & ~CAPACITY; }",
"public E pollBack();",
"@Override\... | [
"0.6374901",
"0.6343056",
"0.6179897",
"0.59843194",
"0.5812559",
"0.5794001",
"0.57540935",
"0.5715684",
"0.57061565",
"0.57061565",
"0.5623487",
"0.5617053",
"0.5574859",
"0.5499765",
"0.5499765",
"0.5499765",
"0.5499765",
"0.548147",
"0.5471886",
"0.5469918",
"0.5456608",
... | 0.0 | -1 |
sets the heuristic of the node passed. | private void heuristicSetter(Node node){
int goalNodeFirstDigit = Integer.parseInt(goalNode.getDigit().getFirst_digit());
int goalNodeSecondDigit = Integer.parseInt(goalNode.getDigit().getSecond_digit());
int goalNodeThirdDigit = Integer.parseInt(goalNode.getDigit().getThird_digit());
i... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void setHeuristic(int heuristic) {\n\t\tthis.heuristic = heuristic;\n\t}",
"public void setAStarHeuristic(AStarHeuristic heuristic)\n\t{\n\t\t_estimator = heuristic;\n\t}",
"public void setHeuristic(int h) {\n\t\t\tthis.heuristique = h;\n\t\t}",
"public void setHeuristics(Heuristic h,Heuristic totalFu... | [
"0.7458475",
"0.7067843",
"0.66975325",
"0.6607452",
"0.6063322",
"0.58320844",
"0.5741439",
"0.5738452",
"0.5724705",
"0.5718298",
"0.5676771",
"0.56604266",
"0.55995935",
"0.5574674",
"0.5560622",
"0.5529921",
"0.5517654",
"0.55060416",
"0.54573745",
"0.53933114",
"0.533580... | 0.77933234 | 0 |
/ The greedy algorithm selects the best out of the children. There should be a loop. During each iteration, take the node make its children. Perfrom goal check, cycle check | private void GreedySearch(){
Queue<Node> expanded = new LinkedList<>();
ArrayList<Node> fringe = new ArrayList<>();
ArrayList<Node> fringeTemp = new ArrayList<>();
Node current = startNode;
while(expanded.size() < 1000){
if(current.getDigit().getDigitString().equ... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void greedyBFS(String input)\r\n\t{\r\n\t\tNode root_gbfs = new Node (input);\r\n\t\tNode current = new Node(root_gbfs.getState());\r\n\t\t\r\n\t\tNodeComparator gbfs_comparator = new NodeComparator();\r\n\t\tPriorityQueue<Node> queue_gbfs = new PriorityQueue<Node>(12, gbfs_comparator);\r\n\t\tArrayList<Str... | [
"0.68561",
"0.66838115",
"0.64369076",
"0.62570703",
"0.6249718",
"0.6213673",
"0.6053108",
"0.60517704",
"0.6046425",
"0.60363895",
"0.60311365",
"0.5989149",
"0.59789205",
"0.5899618",
"0.5888914",
"0.58667064",
"0.5839533",
"0.58271617",
"0.5823444",
"0.5815419",
"0.574638... | 0.7819133 | 0 |
read the file and take information about start,goal and forbidden | public static void main(String[] args) throws FileNotFoundException {
ThreeDigits threeDigits = new ThreeDigits();
String filename = args[1];
File myFile = new File(filename);
Scanner reader = new Scanner(myFile);
threeDigits.startNode = new Node(reader.nextLine());
thr... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private void extractFile() {\n try (BufferedReader buffered_reader = new BufferedReader(new FileReader(source_file))) {\n String line;\n while((line = buffered_reader.readLine()) != null) {\n String spaceEscaped = line.replace(\" \", \"\");\n //file was re... | [
"0.5580772",
"0.5543112",
"0.54212064",
"0.54078823",
"0.5372267",
"0.5369949",
"0.5281969",
"0.5267081",
"0.5252606",
"0.52332395",
"0.52244395",
"0.52021086",
"0.5095645",
"0.50758034",
"0.504734",
"0.5046121",
"0.5032622",
"0.5024921",
"0.49841657",
"0.4968902",
"0.4946294... | 0.0 | -1 |
Created by Timothy Foster on 25 Jul 2016. | public interface IGuessingGamePlayer {
int nextGuess() throws NumberFormatException;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n public void perish() {\n \n }",
"@Override\n\tpublic void grabar() {\n\t\t\n\t}",
"@Override\n\tpublic void comer() {\n\t\t\n\t}",
"private stendhal() {\n\t}",
"public final void mo51373a() {\n }",
"@Override\r\n\tpublic void comer() \r\n\t{\n\t\t\r\n\t}",
"@Override\r\n... | [
"0.60571116",
"0.6012129",
"0.59049565",
"0.58367926",
"0.58117336",
"0.57942146",
"0.57780886",
"0.57780886",
"0.57749665",
"0.5743262",
"0.5688063",
"0.5628502",
"0.5624226",
"0.56157595",
"0.55905956",
"0.5589926",
"0.5585916",
"0.5560103",
"0.5544365",
"0.5535738",
"0.552... | 0.0 | -1 |
creates a new wizard | public NewReviewWizard() {
super();
setNeedsProgressMonitor(true);
setWindowTitle("New Review");
setHelpAvailable(false);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"protected abstract AbstractPerfCakeEditWizard createWizard(IStructuredSelection selection);",
"static public Wizard createWizard (){\n System.out.println(\"Enter the name of your wizard : \");\n Scanner sc = new Scanner(System.in);\n String nameCharacter = sc.next();\n\n // enter and ... | [
"0.6949543",
"0.68756926",
"0.6706814",
"0.6687967",
"0.6602528",
"0.6525941",
"0.6505783",
"0.645814",
"0.6402296",
"0.62814623",
"0.6261516",
"0.6247386",
"0.62305826",
"0.6167935",
"0.6166846",
"0.6135973",
"0.6132156",
"0.61190283",
"0.611149",
"0.60869133",
"0.60696",
... | 0.60789233 | 20 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.