0) {\\n zzsm.zzJb();\\n zzIX++;\\n }\\n zzsm.zzms(zzc);\\n zzc = this.zzbvh == null ? 0 : this.zzbvh.length;\\n int[] iArr2 = new int[(zzIX + zzc)];\\n if (zzc != 0) {\\n System.arraycopy(this.zzbvh, 0, iArr2, 0, zzc);\\n }\\n while (zzc < iArr2.length) {\\n iArr2[zzc] = zzsm.zzJb();\\n zzc++;\\n }\\n this.zzbvh = iArr2;\\n zzsm.zzmr(zzmq);\\n continue;\\n case 168:\\n this.zzbuT = zzsm.zzJa();\\n continue;\\n case 176:\\n this.zzbvi = zzsm.zzJa();\\n continue;\\n default:\\n if (!zza(zzsm, zzIX)) {\\n break;\\n }\\n continue;\\n }\\n }\\n return this;\\n }\",\n \"public void compress() {\\n\\t\\tSpaceship sp = getTheSpaceship();\\n\\t\\tsp.contractDoor();\\n\\t}\",\n \"public zza mergeFrom(zzsm zzsm) throws IOException {\\n while (true) {\\n int zzIX = zzsm.zzIX();\\n int zzc;\\n String[] strArr;\\n int zzmq;\\n switch (zzIX) {\\n case 0:\\n break;\\n case 10:\\n zzc = zzsx.zzc(zzsm, 10);\\n zzIX = this.zzbuI == null ? 0 : this.zzbuI.length;\\n strArr = new String[(zzc + zzIX)];\\n if (zzIX != 0) {\\n System.arraycopy(this.zzbuI, 0, strArr, 0, zzIX);\\n }\\n while (zzIX < strArr.length - 1) {\\n strArr[zzIX] = zzsm.readString();\\n zzsm.zzIX();\\n zzIX++;\\n }\\n strArr[zzIX] = zzsm.readString();\\n this.zzbuI = strArr;\\n continue;\\n case 18:\\n zzc = zzsx.zzc(zzsm, 18);\\n zzIX = this.zzbuJ == null ? 0 : this.zzbuJ.length;\\n strArr = new String[(zzc + zzIX)];\\n if (zzIX != 0) {\\n System.arraycopy(this.zzbuJ, 0, strArr, 0, zzIX);\\n }\\n while (zzIX < strArr.length - 1) {\\n strArr[zzIX] = zzsm.readString();\\n zzsm.zzIX();\\n zzIX++;\\n }\\n strArr[zzIX] = zzsm.readString();\\n this.zzbuJ = strArr;\\n continue;\\n case 24:\\n zzc = zzsx.zzc(zzsm, 24);\\n zzIX = this.zzbuK == null ? 0 : this.zzbuK.length;\\n int[] iArr = new int[(zzc + zzIX)];\\n if (zzIX != 0) {\\n System.arraycopy(this.zzbuK, 0, iArr, 0, zzIX);\\n }\\n while (zzIX < iArr.length - 1) {\\n iArr[zzIX] = zzsm.zzJb();\\n zzsm.zzIX();\\n zzIX++;\\n }\\n iArr[zzIX] = zzsm.zzJb();\\n this.zzbuK = iArr;\\n continue;\\n case 26:\\n zzmq = zzsm.zzmq(zzsm.zzJf());\\n zzc = zzsm.getPosition();\\n zzIX = 0;\\n while (zzsm.zzJk() > 0) {\\n zzsm.zzJb();\\n zzIX++;\\n }\\n zzsm.zzms(zzc);\\n zzc = this.zzbuK == null ? 0 : this.zzbuK.length;\\n int[] iArr2 = new int[(zzIX + zzc)];\\n if (zzc != 0) {\\n System.arraycopy(this.zzbuK, 0, iArr2, 0, zzc);\\n }\\n while (zzc < iArr2.length) {\\n iArr2[zzc] = zzsm.zzJb();\\n zzc++;\\n }\\n this.zzbuK = iArr2;\\n zzsm.zzmr(zzmq);\\n continue;\\n case 32:\\n zzc = zzsx.zzc(zzsm, 32);\\n zzIX = this.zzbuL == null ? 0 : this.zzbuL.length;\\n long[] jArr = new long[(zzc + zzIX)];\\n if (zzIX != 0) {\\n System.arraycopy(this.zzbuL, 0, jArr, 0, zzIX);\\n }\\n while (zzIX < jArr.length - 1) {\\n jArr[zzIX] = zzsm.zzJa();\\n zzsm.zzIX();\\n zzIX++;\\n }\\n jArr[zzIX] = zzsm.zzJa();\\n this.zzbuL = jArr;\\n continue;\\n case 34:\\n zzmq = zzsm.zzmq(zzsm.zzJf());\\n zzc = zzsm.getPosition();\\n zzIX = 0;\\n while (zzsm.zzJk() > 0) {\\n zzsm.zzJa();\\n zzIX++;\\n }\\n zzsm.zzms(zzc);\\n zzc = this.zzbuL == null ? 0 : this.zzbuL.length;\\n long[] jArr2 = new long[(zzIX + zzc)];\\n if (zzc != 0) {\\n System.arraycopy(this.zzbuL, 0, jArr2, 0, zzc);\\n }\\n while (zzc < jArr2.length) {\\n jArr2[zzc] = zzsm.zzJa();\\n zzc++;\\n }\\n this.zzbuL = jArr2;\\n zzsm.zzmr(zzmq);\\n continue;\\n default:\\n if (!zza(zzsm, zzIX)) {\\n break;\\n }\\n continue;\\n }\\n }\\n return this;\\n }\",\n \"public static void compress(ByteBuffer bbInput, ByteBuffer bbOutput, StringBuilder information, long[] time) throws IOException\\r\\n {\\r\\n long startTime = System.currentTimeMillis(); \\r\\n \\r\\n Arithmetic arithmetic = new Arithmetic();\\r\\n \\r\\n while(bbInput.remaining() > 0)\\r\\n {\\r\\n byte b = bbInput.get();\\r\\n arithmetic.add(b);\\r\\n }\\r\\n \\r\\n TreeMap<Byte, Range> rangeTable = arithmetic.set();\\r\\n \\r\\n //System.out.println(rangeTable.size());\\r\\n \\r\\n bbOutput.putInt(rangeTable.size());\\r\\n for (Entry<Byte, Range> e : rangeTable.entrySet())\\r\\n {\\r\\n bbOutput.put(e.getKey().byteValue());\\r\\n bbOutput.putLong(e.getValue().count);\\r\\n //System.out.println((char) e.getKey().byteValue() + \\\":\\\" + e.getValue().count + \\\" \\\" + (int) e.getValue().high + \\\" \\\" + (int) e.getValue().low);\\r\\n }\\r\\n \\r\\n int rangeTableCount = bbInput.position();\\r\\n bbOutput.putInt(rangeTableCount);\\r\\n \\r\\n if (rangeTableCount > (Math.pow(2,16)))\\r\\n {\\r\\n information.append(\\\"FATAL ERROR: Cannot compress block larger than 2^16 - 1\\\");\\r\\n return;\\r\\n }\\r\\n \\r\\n bbInput.position(0);\\r\\n \\r\\n //System.out.println(rangeTableCount);\\r\\n\\r\\n char low = 0;\\r\\n char high = 0xFFFF;\\r\\n short underflow_bits = 0;\\r\\n\\r\\n BitWriter bitWriter = new BitWriter(bbOutput);\\r\\n\\r\\n //Range testRange = arithmetic.rangeTable.get((byte)'B');\\r\\n //System.out.println((char)'B' + \\\" \\\" + testRange.count + \\\" \\\" + (int) testRange.high + \\\" \\\" + (int) testRange.low);\\r\\n \\r\\n while(bbInput.remaining() > 0)\\r\\n {\\r\\n byte b = bbInput.get();\\r\\n Range range = rangeTable.get(b);\\r\\n \\r\\n long diff;\\r\\n diff = (long) (high - low) + 1;\\r\\n char temphigh = (char) ((diff * range.high) / rangeTableCount - 1);\\r\\n high = (char) (low + temphigh);\\r\\n char templow = (char) ((diff * range.low) / rangeTableCount);\\r\\n low = (char) (low + templow);\\r\\n \\r\\n boolean shiftingComplete = false;\\r\\n while (!shiftingComplete)\\r\\n {\\r\\n // TEST1: Test if most significant bit match, shift them out.\\r\\n if ((high & 0x8000) == (low & 0x8000))\\r\\n {\\r\\n bitWriter.put((high & 0x8000) != 0);//!=\\r\\n while (underflow_bits > 0)\\r\\n {\\r\\n bitWriter.put((~high & 0x8000) != 0);\\r\\n underflow_bits--;\\r\\n }\\r\\n low <<= 1;\\r\\n high <<= 1;\\r\\n high |= 1;\\r\\n }\\r\\n // TEST2: Test for potential underflow if most significant digits don't match and\\r\\n // second most significant digits are one apart.\\r\\n else if ((low & 0x4000) != 0 && (!((high & 0x4000) != 0)))\\r\\n {\\r\\n underflow_bits += 1;\\r\\n low &= 0x3fff;\\r\\n high |= 0x4000;\\r\\n \\r\\n low <<= 1;\\r\\n high <<= 1;\\r\\n high |= 1;\\r\\n }\\r\\n // ELSE: COMPLETE\\r\\n else\\r\\n {\\r\\n shiftingComplete = true;\\r\\n }\\r\\n }\\r\\n }\\r\\n \\r\\n bitWriter.put((low & 0x4000) != 0);\\r\\n underflow_bits++;\\r\\n while (underflow_bits-- > 0)\\r\\n {\\r\\n bitWriter.put((~low & 0x4000) != 0);\\r\\n }\\r\\n\\r\\n bitWriter.finish();\\r\\n \\r\\n long endTime = System.currentTimeMillis();\\r\\n time[0] += (endTime - startTime);\\r\\n }\",\n \"public DatasetCompression compression() {\\n return this.innerTypeProperties() == null ? null : this.innerTypeProperties().compression();\\n }\",\n \"public void union(int i, int j) {\\n\\n int root1 = find(i);\\n int root2 = find(j);\\n\\n if (root2 == root1)\\n return;\\n\\n if (_rank[root1] > _rank[root2]) {\\n _parent[root2] = root1;\\n } else if (_rank[root2] > _rank[root1]) {\\n _parent[root1] = root2;\\n } else {\\n _parent[root2] = root1;\\n _rank[root1]++;\\n }\\n }\",\n \"private void compressArchive() throws Exception {\\n\\t\\tif (logger.isDebugEnabled()) {\\n\\t\\t\\tlogger.debug(\\\"Compressing archive: \\\" + path);\\n\\t\\t}\\n\\n\\t\\tFileOutputStream fout = new FileOutputStream(path + \\\".gz\\\");\\n\\t\\tGZIPOutputStream gout = new GZIPOutputStream(fout);\\n\\t\\tFileInputStream fin = new FileInputStream(path);\\n\\t\\tbyte[] buf = new byte[blockSize];\\n\\t\\tint len;\\n\\t\\twhile ((len = fin.read(buf)) > 0) {\\n\\t\\t\\tgout.write(buf, 0, len);\\n\\t\\t}\\n\\t\\tfin.close();\\n\\n\\t\\t// flush and close gzip file\\n\\t\\tgout.finish();\\n\\t\\tgout.close();\\n\\n\\t\\t// unlink original archive\\n\\t\\tFile file = new File(path);\\n\\t\\tfile.delete();\\n\\t}\",\n \"final public void GroupOrUnionGraphPattern(Exp stack) throws ParseException {\\n Exp temp, res;\\n res = GroupGraphPattern();\\n label_36:\\n while (true) {\\n switch ((jj_ntk==-1)?jj_ntk():jj_ntk) {\\n case UNION:\\n case OR:\\n ;\\n break;\\n default:\\n jj_la1[179] = jj_gen;\\n break label_36;\\n }\\n switch ((jj_ntk==-1)?jj_ntk():jj_ntk) {\\n case UNION:\\n jj_consume_token(UNION);\\n break;\\n case OR:\\n jj_consume_token(OR);\\n deprecated(\\\"or\\\",\\\"union\\\");\\n break;\\n default:\\n jj_la1[180] = jj_gen;\\n jj_consume_token(-1);\\n throw new ParseException();\\n }\\n temp = res;\\n res = Or.create();\\n res.add(temp);\\n temp = GroupGraphPattern();\\n res.add(temp);\\n }\\n stack.add(res);\\n }\",\n \"public boolean supportsUnionAll() {\\n \\t\\treturn false;\\n \\t}\",\n \"public static void codeAllImages(Args args) throws FileNotFoundException, IOException{\\n BufferedImage tempI=null, tempP=null;\\n BufferedImage[] codeOut = null;\\n FileOutputStream fos = new FileOutputStream(args.output);\\n ZipOutputStream zipOS = new ZipOutputStream(fos);\\n int j = 0;\\n //Iterate through all the images dividing them into frameP or frameI\\n for(int i= 0; i < imageNames.size(); i++){ \\n //j is a counter of the gop\\n if(j >= (args.gop)){\\n j=0;\\n }\\n if(j==0){\\n // Frame I\\n tempI = imageDict.get(imageNames.get(i));\\n imgToZip(tempI, i, zipOS, \\\"image_coded_\\\");\\n }else{\\n //Frame P\\n codeOut = createCodedImg(tempI, imageDict.get(imageNames.get(i)), args.thresh, args.tileSize, args.seekRange, args.comparator);\\n imgToZip(codeOut[0], i, zipOS, \\\"image_coded_\\\");\\n tempI = codeOut[1];\\n //showImage(tempP);\\n }\\n j++;\\n }\\n //Get the gop, its always the first position of the coded data\\n dataList.get(0).gop = args.gop;\\n //Store into a .gz file all the info of every tile of every image, info that is stored into our dataList\\n try {\\n FileOutputStream out = new FileOutputStream(\\\"codedData.gz\\\");\\n GZIPOutputStream gos = new GZIPOutputStream(out);\\n ObjectOutputStream oos = new ObjectOutputStream(gos);\\n oos.writeObject(dataList);\\n oos.flush();\\n gos.flush();\\n out.flush();\\n \\n oos.close();\\n gos.close();\\n out.close();\\n } catch (Exception e) {\\n System.out.println(\\\"Problem serializing: \\\" + e);\\n }\\n \\n FileInputStream fis = new FileInputStream(\\\"codedData.gz\\\");\\n ZipEntry e = new ZipEntry(\\\"codedData.gz\\\");\\n zipOS.putNextEntry(e);\\n\\n byte[] bytes = new byte[1024];\\n int length;\\n while ((length = fis.read(bytes)) >= 0) {\\n zipOS.write(bytes, 0, length);\\n }\\n zipOS.closeEntry();\\n fis.close();\\n zipOS.finish(); //Good practice!\\n zipOS.close();\\n }\",\n \"private void compress(Node nodo) {\\n Node parent = nodo.getParent();\\n\\n Node left = parent.getLeftNode();\\n Node right = parent.getRightNode();\\n\\n int left_reference = left.getReference();\\n ArrayList<Integer> left_content = this.fm.read(left_reference); this.in_counter++;\\n\\n int right_reference = right.getReference();\\n ArrayList<Integer> right_content = this.fm.read(right_reference); this.in_counter++;\\n if(this.debug)\\n System.out.println(\\\"ExtHash::compress >> hay \\\" + (right_content.get(0) + left_content.get(0)) + \\\" elementos, de un maximo de \\\" + this.B);\\n\\n // en caso de que sea posible juntar las paginas.\\n if(right_content.get(0) + left_content.get(0) < B-2) {\\n total_active_block--;\\n\\n if(this.debug)\\n System.out.println(\\\"ExtHash::compress >> ambas paginas se pueden fusionar\\\");\\n\\n ArrayList<Integer> new_content = new ArrayList<>();\\n new_content.add(right_content.get(0) + left_content.get(0));\\n\\n for(int i=1; i<= left_content.get(0); i++)\\n new_content.add(left_content.get(i));\\n\\n for(int i=1; i<= right_content.get(0); i++)\\n new_content.add(right_content.get(i));\\n\\n parent.activateReference(true);\\n parent.setReference(left_reference);\\n // referencia derecha dejarla en las referencias en desuso.\\n\\n this.fm.write(new_content, left_reference); this.out_counter++;\\n }\\n }\",\n \"private PriorityQueue<Edge> _getKruskalTree(boolean input)\\n{\\n PriorityQueue<Edge> completeTree = new PriorityQueue<Edge>();\\n for (int loop = 0;\\n loop < this.nVerts;\\n loop++\\n ) {\\n for (int innerLoop = 0;\\n innerLoop < this.adjMat[loop].length;\\n innerLoop++\\n ) {\\n /*\\n * Once we identify a weighted edge, we find its position in the\\n * minimum priority queue.\\n */\\n int edgeDistance = this.adjMat[loop][innerLoop];\\n if (INFINITY == edgeDistance) {\\n continue;\\n }\\n completeTree.add(new Edge(loop, innerLoop, edgeDistance));\\n }\\n }\\n if (true == input) {\\n return completeTree;\\n }\\n /*\\n * Once we have the queue, we can display the tree and see how much it\\n * weighs.\\n * Now we make a set of vertices for UnionFind{}. This will help us to find\\n * cycles.\\n */\\n UnionFind union = new UnionFind(this.nVerts);\\n PriorityQueue<Edge> output = new PriorityQueue<Edge>();\\n while (0 != completeTree.size()) {\\n /*\\n * We know that the completeTree will include each edge twice, so we can\\n * skip the next item. It will be the same edge.\\n */\\n Edge nextEdge = completeTree.remove();\\n if (union.find(nextEdge.srcVert) == union.find(nextEdge.destVert)) {\\n continue;\\n }\\n union.union(nextEdge.srcVert, nextEdge.destVert);\\n output.add(nextEdge);\\n }\\n return output;\\n}\",\n \"public void setCompression( boolean compress ) {\\n this .compression = compress;\\n }\",\n \"@Test\\n public void testUnionOnSchemaCastOnByteArray() throws Exception {\\n PigServer pig = new PigServer(Util.getLocalTestMode());\\n String query =\\n \\\" l1 = load '\\\" + INP_FILE_2NUMS + \\\"' as (i, j);\\\"\\n + \\\" f1 = foreach l1 generate (int)i, (int)j;\\\"\\n + \\\"u = union onschema f1, l1;\\\"\\n ; \\n Util.registerMultiLineQuery(pig, query);\\n Iterator<Tuple> it = pig.openIterator(\\\"u\\\");\\n \\n List<Tuple> expectedRes = \\n Util.getTuplesFromConstantTupleStrings(\\n new String[] {\\n \\\"(1,2)\\\",\\n \\\"(5,3)\\\",\\n \\\"(1,2)\\\",\\n \\\"(5,3)\\\"\\n });\\n Util.checkQueryOutputsAfterSort(it, expectedRes);\\n\\n }\",\n \"public void writeSmall(byte[] b) {\\n if (b.length<12)\\n try {\\n throw new IOException();\\n } catch (IOException e) {\\n e.printStackTrace();\\n }\\n //Write compressed array//\\n int i=0;\\n for (; i< 12 ; i++) //maze dimensions + start/goal\\n write(b[i]);\\n while (i<b.length){\\n byte cell=b[i++];\\n for (int j =0 ; j<7; j++){\\n if (i<b.length)\\n cell=(byte)((cell<<1)|b[i++]);\\n else\\n cell=(byte)((cell << 1));\\n }\\n write(cell);\\n }\\n }\",\n \"public void flush() {\\n\\r\\n int inflatedSize = buffer.position();\\r\\n deflator.setInput(buffer.getBuffer(), 0, inflatedSize);\\r\\n deflator.finish();\\r\\n int deflatedSize = deflator.deflate(compressionBuffer.array());\\r\\n deflator.reset();\\r\\n\\r\\n try {\\r\\n outputStream.writeInt(deflatedSize);\\r\\n outputStream.writeInt(inflatedSize);\\r\\n outputStream.write(compressionBuffer.array(), 0, deflatedSize);\\r\\n }\\r\\n catch (IOException e) {\\r\\n throw new RuntimeException(\\\"Failed to write compressed data to stream\\\", e);\\r\\n }\\r\\n\\r\\n buffer.clear();\\r\\n compressionBuffer.clear();\\r\\n }\",\n \"@Test\\n public void compressAndDecompress() throws IOException {\\n byte[] compressed = Utils.compress(\\\"123a\\\");\\n String decompressed = Utils.decompress(compressed);\\n Assert.assertEquals(\\\"123a\\\", decompressed);\\n }\",\n \"private String buildUnionOut(Stream strm){\\n\\t\\tInteger i = 0;\\n\\t\\tString str = genTableStr + strm.getName() + \\\"_starqlout\\\"+\\\" AS WCACHE\\\\r\\\\n\\\";\\n\\t\\tstr += \\\"select * from (mergeunion '\\\";\\n\\t\\twhile (i < outNum){\\n\\t\\t\\ti++;\\n\\t\\t\\tstr += strm.getName() + \\\"_starqlout_\\\"+i;\\t\\t\\t\\n\\t\\t\\tif(i < outNum)\\n\\t\\t\\t\\tstr += \\\",\\\";\\n\\t\\t}\\n\\t\\tstr += \\t\\\"' cols:timestamp);\\\\r\\\\n\\\";\\n\\t\\treturn str;\\n\\t}\",\n \"public org.apache.gora.cascading.test.storage.TestRow getUnionRecursive() {\\n return unionRecursive;\\n }\",\n \"@Test\\n public void testUnionOnSchemaByteArrayConversions() throws Exception {\\n PigServer pig = new PigServer(Util.getLocalTestMode());\\n String query =\\n \\\" l1 = load '\\\" + INP_FILE_2NUM_1CHAR_1BAG + \\\"' as \\\" \\n + \\\" (i : bytearray, x : bytearray, j : bytearray \\\" \\n + \\\", b : bytearray); \\\"\\n + \\\"l2 = load '\\\" + INP_FILE_2NUM_1CHAR_1BAG + \\\"' as \\\" \\n + \\\" (i : long, c : chararray, j : int \\\" \\n + \\\", b : bag { t : tuple (c1 : int, c2 : chararray)} ); \\\"\\n + \\\"u = union onSchema l1, l2;\\\"\\n ; \\n Util.registerMultiLineQuery(pig, query);\\n pig.explain(\\\"u\\\", System.out);\\n\\n Iterator<Tuple> it = pig.openIterator(\\\"u\\\");\\n \\n List<Tuple> expectedRes = \\n Util.getTuplesFromConstantTupleStrings(\\n new String[] {\\n \\\"(1L,null,2,{(1,'a'),(1,'b')},'abc')\\\",\\n \\\"(1L,'abc',2,{(1,'a'),(1,'b')},null)\\\",\\n \\\"(5L,null,3,{(2,'a'),(2,'b')},'def')\\\",\\n \\\"(5L,'def',3,{(2,'a'),(2,'b')},null)\\\", \\n });\\n //update expectedRes to use bytearray instead of chararray in 2nd field\\n for(Tuple t : expectedRes){\\n if(t.get(1) != null){\\n t.set(1, new DataByteArray(t.get(1).toString()));\\n }\\n }\\n Util.checkQueryOutputsAfterSort(it, expectedRes);\\n }\",\n \"@Test\\n public void testUnionOnSchemaInputUdfs() throws Exception {\\n PigServer pig = new PigServer(Util.getLocalTestMode());\\n String query =\\n \\\" l1 = load '\\\" + INP_FILE_2NUMS + \\\"' as (i : int, j : chararray);\\\"\\n + \\\"l2 = load '\\\" + INP_FILE_2NUMS + \\\"' as (i : int, j : chararray);\\\"\\n + \\\"f1 = foreach l1 generate i, CONCAT(j,j) as cj, \\\" +\\n \\t\\t\\\"org.apache.pig.test.TestUnionOnSchema\\\\\\\\$UDFTupleNullSchema(i,j) as uo;\\\"\\n + \\\"u = union onschema f1, l2;\\\"\\n ; \\n Util.registerMultiLineQuery(pig, query);\\n\\n Schema sch = pig.dumpSchema(\\\"u\\\");\\n String expectedSch = \\\"{i: int,cj: chararray,uo: (),j: chararray}\\\";\\n Assert.assertTrue( expectedSch.equals( sch.toString() ) );\\n \\n\\n Iterator<Tuple> it = pig.openIterator(\\\"u\\\");\\n List<Tuple> expectedRes = \\n Util.getTuplesFromConstantTupleStrings(\\n new String[] {\\n \\\"(1,null,null,'2')\\\",\\n \\\"(5,null,null,'3')\\\",\\n \\\"(1,'22',(1,'2'),null)\\\",\\n \\\"(5,'33',(5,'3'),null)\\\"\\n });\\n Util.checkQueryOutputsAfterSort(it, expectedRes);\\n\\n }\",\n \"@Override\\n public SetI union(SetI other) {\\n Set o;\\n\\n if (!(other instanceof Set)) {\\n // Different Set impl. Convertion needed.\\n // Will impact performance.\\n o = Set.fromAnotherImpl(other);\\n }\\n else {\\n o = (Set) other;\\n }\\n\\n int[] newArr = new int[count + o.count];\\n int i = 0, j = 0, k = 0;\\n\\n // Merge sorted arrays.\\n while (i < count && j < o.count) {\\n // Skip duplicated elements.\\n if (contains(o.arr[j])) {\\n ++j;\\n }\\n else if (arr[i] < o.arr[j]) {\\n newArr[k++] = arr[i++];\\n }\\n else {\\n newArr[k++] = o.arr[j++];\\n }\\n }\\n\\n while (i < count) {\\n newArr[k++] = arr[i++];\\n }\\n\\n while (j < o.count) {\\n // Skip duplicated elements.\\n if (!contains(o.arr[j])) {\\n newArr[k++] = o.arr[j];\\n }\\n ++j;\\n }\\n\\n return new Set(newArr, k);\\n }\",\n \"public org.apache.gora.cascading.test.storage.TestRow getUnionRecursive() {\\n return unionRecursive;\\n }\",\n \"private final <K, V> int zza(T r7, byte[] r8, int r9, int r10, int r11, int r12, long r13, com.google.android.gms.internal.clearcut.zzay r15) throws java.io.IOException {\\n /*\\n r6 = this;\\n r12 = zzmh;\\n r11 = r6.zzae(r11);\\n r0 = r12.getObject(r7, r13);\\n r1 = r6.zzmz;\\n r1 = r1.zzi(r0);\\n if (r1 == 0) goto L_0x0021;\\n L_0x0012:\\n r1 = r6.zzmz;\\n r1 = r1.zzk(r11);\\n r2 = r6.zzmz;\\n r2.zzb(r1, r0);\\n r12.putObject(r7, r13, r1);\\n r0 = r1;\\n L_0x0021:\\n r7 = r6.zzmz;\\n r7 = r7.zzl(r11);\\n r11 = r6.zzmz;\\n r11 = r11.zzg(r0);\\n r9 = com.google.android.gms.internal.clearcut.zzax.zza(r8, r9, r15);\\n r12 = r15.zzfd;\\n if (r12 < 0) goto L_0x0094;\\n L_0x0035:\\n r13 = r10 - r9;\\n if (r12 > r13) goto L_0x0094;\\n L_0x0039:\\n r12 = r12 + r9;\\n r13 = r7.zzmc;\\n r14 = r7.zzdu;\\n L_0x003e:\\n if (r9 >= r12) goto L_0x0089;\\n L_0x0040:\\n r0 = r9 + 1;\\n r9 = r8[r9];\\n if (r9 >= 0) goto L_0x004c;\\n L_0x0046:\\n r0 = com.google.android.gms.internal.clearcut.zzax.zza(r9, r8, r0, r15);\\n r9 = r15.zzfd;\\n L_0x004c:\\n r1 = r0;\\n r0 = r9 >>> 3;\\n r2 = r9 & 7;\\n switch(r0) {\\n case 1: goto L_0x006f;\\n case 2: goto L_0x0055;\\n default: goto L_0x0054;\\n };\\n L_0x0054:\\n goto L_0x0084;\\n L_0x0055:\\n r0 = r7.zzmd;\\n r0 = r0.zzel();\\n if (r2 != r0) goto L_0x0084;\\n L_0x005d:\\n r3 = r7.zzmd;\\n r9 = r7.zzdu;\\n r4 = r9.getClass();\\n r0 = r8;\\n r2 = r10;\\n r5 = r15;\\n r9 = zza(r0, r1, r2, r3, r4, r5);\\n r14 = r15.zzff;\\n goto L_0x003e;\\n L_0x006f:\\n r0 = r7.zzmb;\\n r0 = r0.zzel();\\n if (r2 != r0) goto L_0x0084;\\n L_0x0077:\\n r3 = r7.zzmb;\\n r4 = 0;\\n r0 = r8;\\n r2 = r10;\\n r5 = r15;\\n r9 = zza(r0, r1, r2, r3, r4, r5);\\n r13 = r15.zzff;\\n goto L_0x003e;\\n L_0x0084:\\n r9 = com.google.android.gms.internal.clearcut.zzax.zza(r9, r8, r1, r10, r15);\\n goto L_0x003e;\\n L_0x0089:\\n if (r9 != r12) goto L_0x008f;\\n L_0x008b:\\n r11.put(r13, r14);\\n return r12;\\n L_0x008f:\\n r7 = com.google.android.gms.internal.clearcut.zzco.zzbo();\\n throw r7;\\n L_0x0094:\\n r7 = com.google.android.gms.internal.clearcut.zzco.zzbl();\\n throw r7;\\n */\\n throw new UnsupportedOperationException(\\\"Method not decompiled: com.google.android.gms.internal.clearcut.zzds.zza(java.lang.Object, byte[], int, int, int, int, long, com.google.android.gms.internal.clearcut.zzay):int\\\");\\n }\",\n \"@Test\\n public void testUnionOnSchemaSameSchema() throws Exception {\\n PigServer pig = new PigServer(Util.getLocalTestMode());\\n String query =\\n \\\" l1 = load '\\\" + INP_FILE_2NUMS + \\\"' as (i : int, j : int);\\\"\\n + \\\"l2 = load '\\\" + INP_FILE_2NUMS + \\\"' as (i : int, j : int);\\\"\\n + \\\"u = union onschema l1, l2;\\\"\\n ; \\n Util.registerMultiLineQuery(pig, query);\\n Schema expectedSch = Utils.getSchemaFromString(\\\"i: int, j: int\\\");\\n Schema sch = pig.dumpSchema(\\\"u\\\");\\n assertEquals(\\\"Checking expected schema\\\",sch, expectedSch);\\n Iterator<Tuple> it = pig.openIterator(\\\"u\\\");\\n \\n List<Tuple> expectedRes = \\n Util.getTuplesFromConstantTupleStrings(\\n new String[] {\\n \\\"(1,2)\\\",\\n \\\"(5,3)\\\",\\n \\\"(1,2)\\\",\\n \\\"(5,3)\\\"\\n });\\n Util.checkQueryOutputsAfterSort(it, expectedRes);\\n\\n }\",\n \"@Test void testInterpretUnion() {\\n rootSchema.add(\\\"simple\\\", new ScannableTableTest.SimpleTable());\\n final String sql = \\\"select * from \\\\\\\"simple\\\\\\\"\\\\n\\\"\\n + \\\"union\\\\n\\\"\\n + \\\"select * from \\\\\\\"simple\\\\\\\"\\\";\\n sql(sql).returnsRowsUnordered(\\\"[0]\\\", \\\"[10]\\\", \\\"[20]\\\", \\\"[30]\\\");\\n }\",\n \"public int compress(InputStream in, OutputStream out, boolean force) throws IOException {\\n int walk = 0; // Temp storage for incoming byte from read file\\n int walkCount = 0; // Number of total bits read\\n char codeCheck = ' '; // Used as a key to find the code in the code map\\n String[] codeMap = HuffEncoder.encoding(); // Stores the character codes, copied from HuffEncode\\n String s2b = \\\"\\\"; // Temp string storage \\n int codeLen = 0; // Temp storage for code length (array storage)\\n BitInputStream bitIn = new BitInputStream(in); \\n BitOutputStream bitOut = new BitOutputStream(out);\\n\\n // Writes the code array at the top of the file. It first writes the number of bits in the code, then \\n // the code itself. In the decode proccess, the code length is first read, then the code is read using the length\\n // as a guide.\\n // A space at top of file ensures the following is the array, and the file will correctly decompress\\n out.write(32);\\n for (int i = 0; i < codeMap.length; i++) {\\n // Value of the character\\n s2b = codeMap[i];\\n // If null, make it zero\\n if(s2b == null){\\n s2b = \\\"0\\\";\\n }\\n // Record length of code\\n codeLen = s2b.length();\\n // Write the length of the code, to use for decoding\\n bitOut.writeBits(8, codeLen);\\n // Write the value of the character\\n for (int j = 0; j < s2b.length(); j++) {\\n bitOut.writeBits(1, Integer.valueOf(s2b.charAt(j)));\\n }\\n }\\n\\n // Reads in a byte from the file, converts it to a character, then uses that \\n // caracter to look up the huffman code. The huffman code is writen to the new \\n // file.\\n try {\\n while(true){\\n // Read first eight bits\\n walk = bitIn.read();\\n // -1 means the stream has reached the end\\n if(walk == -1){break;}\\n // convert the binary to a character\\n codeCheck = (char) walk;\\n // find the huff code for the character\\n s2b = codeMap[codeCheck];\\n // write the code to new file\\n for (int i = 0; i < s2b.length(); i++) {\\n bitOut.writeBits(1, Integer.valueOf(s2b.charAt(i)));\\n }\\n walkCount += 8; // Number of bits read\\n }\\n bitIn.close();\\n bitOut.close();\\n return walkCount; \\n } catch (IOException e) {\\n bitIn.close();\\n bitOut.close();\\n throw e;\\n }\\n }\",\n \"public static void compress(String inFile) throws Exception{\\n IO.Compressor compressor = new IO.Compressor(inFile);\\n char[] charArray = compressor.getCharacters();\\n Trie dictionary = new Trie();\\n int num = 0; char ch;\\n \\n for(int i=0; i<charArray.length; ){\\n\\tString str = dictionary.find(charArray, i);\\n\\tdictionary.add(str);\\n\\tnum = dictionary.getIndex(str);\\n\\tch = dictionary.getChar(str);\\n compressor.encode(num, ch);\\n i += str.length();\\n\\n }//end for loop\\n\\n compressor.done();\\n\\n }\",\n \"@Test\\n public void testCompressionNegative()\\n {\\n int size = 2049;\\n byte[] orginalBytes = new byte[size];\\n byte[] lessBytes = StateUtils.compress(orginalBytes);\\n lessBytes[1] = (byte) 3;\\n try\\n {\\n byte[] moreBytes = StateUtils.decompress(lessBytes);\\n Assertions.assertFalse(Arrays.equals(moreBytes, orginalBytes));\\n }\\n catch (Exception e)\\n {\\n // do nothing\\n }\\n }\",\n \"private void applyCompression( Step s ) throws VerificationException\\n {\\n final int oldLength = length; // Remember the old length for verif.\\n \\n // First, move the grammar text aside.\\n int len = s.len;\\n short t[] = new short[len];\\n System.arraycopy( text, s.occurences[0], t, 0, len );\\n \\n boolean deleted[] = new boolean[length];\\n \\n // Now assign a new variable and replace all occurences.\\n short variable = nextcode++;\\n \\n int a[] = s.occurences;\\n \\n for( int i=0; i<a.length; i++ ){\\n replace( a[i], len, variable, deleted );\\n }\\n \\n int j = 0;\\n for( int i=0; i<length; i++ ){\\n if( !deleted[i] ){\\n // Before the first deleted character this copies the\\n // character onto itself. This is harmless.\\n text[j++] = text[i];\\n }\\n }\\n length = j;\\n \\n // Separate the previous stuff from the grammar rule that follows.\\n text[length++] = STOP;\\n \\n // Add the new grammar rule.\\n System.arraycopy( t, 0, text, length, len );\\n length += len;\\n text[length] = STOP;\\n \\n // Re-initialize the indices array, and sort it again.\\n // TODO: do this in a more subtle manner.\\n for( int i=0; i<length; i++ ){\\n indices[i] = i;\\n }\\n sort();\\n \\n if( doVerification ){\\n int gain = s.getGain();\\n \\n if( length+gain != oldLength ){\\n System.out.println( \\\"Error: predicted gain was \\\" + gain + \\\", but realized gain is \\\" + (oldLength-length) );\\n }\\n }\\n }\",\n \"public ZYSet<ElementType> union(ZYSet<ElementType> otherSet){\\n ZYSet<ElementType> result = new ZYArraySet<ElementType>();\\n for(ElementType e :this){\\n result.add(e);\\n }\\n for(ElementType e :otherSet){\\n result.add(e);\\n }\\n \\n return result;\\n }\",\n \"void Union( int x, int y){\\n\\n int i = root(x);\\n int j = root(y);\\n if (i == j) return;\\n if (rank[i] > rank[j]) { id[j] = i; rank[i] += rank[j]; }\\n else { id[i] = j; rank[j] += rank[i]; }\\n }\",\n \"void union(int a, int b) {\\n int aParent = find(a); // find parent of a\\n int bParent = find(b); // find parent of b\\n\\n // here we are everytime setting the parent of a_set as b_set in union\\n // set the parent of all a as parent of b\\n childToParentMap.put(aParent, bParent);\\n }\",\n \"public static Point2D[] CompressionRegion(Point2D[] vertices, double angle) {\\r\\n Point2D[] finalVertices = null;\\r\\n double NA = (NAdepth - minY) * 0.8;\\r\\n// System.out.println(\\\"NA: \\\" + NA);\\r\\n double newNA = minY + NA;\\r\\n double angleA;\\r\\n if (angle > 0.5) {\\r\\n angleA = angle;\\r\\n } else {\\r\\n angleA = 0.0;\\r\\n }\\r\\n\\r\\n //triangle: if both leftmost and rightmost corners are above the NADepth line\\r\\n if (leftmost.y > newNA && rightmost.y > newNA) {\\r\\n// System.out.println(\\\"case 1\\\");\\r\\n double x1 = NA / Math.tan(angleA * Math.PI / 180);\\r\\n double x2 = NA / Math.tan((90 - angleA) * Math.PI / 180);\\r\\n int[] xcoord = new int[3];\\r\\n int[] ycoord = new int[3];\\r\\n xcoord[0] = (int) topmost.x;\\r\\n xcoord[1] = (int) (topmost.x - x1);\\r\\n xcoord[2] = (int) (topmost.x + x2);\\r\\n ycoord[0] = (int) topmost.y;\\r\\n ycoord[1] = (int) newNA;\\r\\n ycoord[2] = (int) newNA;\\r\\n Point2D[] polyVertices = {new Point2D(xcoord[0], ycoord[0]), new Point2D(xcoord[1], ycoord[1]), new Point2D(xcoord[2], ycoord[2])};\\r\\n finalVertices = polyVertices;\\r\\n } //quadrilateral: if either point is below NADepth line(@ CASES FOR LEFT AND RIGHT MOST POINTS)\\r\\n else if (leftmost.y <= newNA && rightmost.y >= newNA) {\\r\\n double x2 = NA / Math.tan((90 - angleA) * Math.PI / 180);\\r\\n double x3 = (newNA - leftmost.y) / Math.tan((90 - angleA) * Math.PI / 180);\\r\\n// System.out.println(\\\" lx: \\\" + leftmost.x + \\\" ly: \\\" + leftmost.y + \\\"na\\\" + newNA);\\r\\n// System.out.println(\\\"x3: \\\" + x3);\\r\\n int[] xcoord = new int[4];\\r\\n int[] ycoord = new int[4];\\r\\n xcoord[0] = (int) topmost.x;\\r\\n xcoord[1] = (int) leftmost.x;\\r\\n xcoord[2] = (int) (leftmost.x + x3);\\r\\n xcoord[3] = (int) (topmost.x + x2);\\r\\n\\r\\n ycoord[0] = (int) topmost.y;\\r\\n ycoord[1] = (int) leftmost.y;\\r\\n ycoord[2] = (int) newNA;\\r\\n ycoord[3] = (int) newNA;\\r\\n Point2D[] polyVertices = {new Point2D(xcoord[0], ycoord[0]), new Point2D(xcoord[1], ycoord[1]), new Point2D(xcoord[2], ycoord[2]), new Point2D(xcoord[3], ycoord[3])};\\r\\n finalVertices = polyVertices;\\r\\n\\r\\n } else if (leftmost.y >= newNA && rightmost.y <= newNA) {\\r\\n double x1 = NA / Math.tan(angleA * Math.PI / 180);\\r\\n double x3 = (newNA - rightmost.y) / Math.tan(angleA * Math.PI / 180);\\r\\n// System.out.println(\\\" lx: \\\" + leftmost.x + \\\" ly: \\\" + leftmost.y + \\\"na\\\" + newNA);\\r\\n// System.out.println(\\\"x3: \\\" + x3);\\r\\n int[] xcoord = new int[4];\\r\\n int[] ycoord = new int[4];\\r\\n xcoord[0] = (int) topmost.x;\\r\\n xcoord[1] = (int) (topmost.x - x1);\\r\\n xcoord[2] = (int) (rightmost.x - x3);\\r\\n xcoord[3] = (int) rightmost.x;\\r\\n\\r\\n ycoord[0] = (int) topmost.y;\\r\\n ycoord[1] = (int) newNA;\\r\\n ycoord[2] = (int) newNA;\\r\\n ycoord[3] = (int) rightmost.y;\\r\\n Point2D[] polyVertices = {new Point2D(xcoord[0], ycoord[0]), new Point2D(xcoord[1], ycoord[1]), new Point2D(xcoord[2], ycoord[2]), new Point2D(xcoord[3], ycoord[3])};\\r\\n finalVertices = polyVertices;\\r\\n\\r\\n } //pentagon: if both points are below NADepth line\\r\\n else if (leftmost.y < newNA && rightmost.y < newNA) {\\r\\n double x3 = (newNA - leftmost.y) / Math.tan((90 - angleA) * Math.PI / 180);\\r\\n double x4 = (newNA - rightmost.y) / Math.tan(angleA * Math.PI / 180);\\r\\n// System.out.println(\\\" lx: \\\" + leftmost.x + \\\" ly: \\\" + leftmost.y + \\\"na\\\" + newNA);\\r\\n// System.out.println(\\\"x3: \\\" + x3);\\r\\n\\r\\n if (angle < 0.5) {\\r\\n int[] xcoord = new int[4];\\r\\n int[] ycoord = new int[4];\\r\\n xcoord[0] = (int) rightmost.x;\\r\\n xcoord[1] = (int) leftmost.x;\\r\\n xcoord[2] = (int) leftmost.x;\\r\\n xcoord[3] = (int) rightmost.x;\\r\\n\\r\\n ycoord[0] = (int) topmost.y;\\r\\n ycoord[1] = (int) topmost.y;\\r\\n ycoord[2] = (int) newNA;\\r\\n ycoord[3] = (int) newNA;\\r\\n Point2D[] polyVertices = {new Point2D(xcoord[0], ycoord[0]), new Point2D(xcoord[1], ycoord[1]), new Point2D(xcoord[2], ycoord[2]), new Point2D(xcoord[3], ycoord[3])};\\r\\n finalVertices = polyVertices;\\r\\n\\r\\n } else {\\r\\n int[] xcoord = new int[5];\\r\\n int[] ycoord = new int[5];\\r\\n xcoord[0] = (int) topmost.x;\\r\\n xcoord[1] = (int) leftmost.x;\\r\\n xcoord[2] = (int) (leftmost.x + x3);\\r\\n xcoord[3] = (int) (rightmost.x - x4);\\r\\n xcoord[4] = (int) rightmost.x;\\r\\n\\r\\n ycoord[0] = (int) topmost.y;\\r\\n ycoord[1] = (int) leftmost.y;\\r\\n ycoord[2] = (int) newNA;\\r\\n ycoord[3] = (int) newNA;\\r\\n ycoord[4] = (int) rightmost.y;\\r\\n Point2D[] polyVertices = {new Point2D(xcoord[0], ycoord[0]), new Point2D(xcoord[1], ycoord[1]), new Point2D(xcoord[2], ycoord[2]), new Point2D(xcoord[3], ycoord[3]), new Point2D(xcoord[4], ycoord[4])};\\r\\n finalVertices = polyVertices;\\r\\n\\r\\n }\\r\\n }\\r\\n return finalVertices;\\r\\n }\",\n \"public PipeUnion<T> getUnion();\",\n \"static\\nint\\nprintUnion(\\nint\\narr1[], \\nint\\narr2[], \\nint\\nm, \\nint\\nn) \\n\\n{ \\n\\nint\\ni = \\n0\\n, j = \\n0\\n; \\n\\nwhile\\n(i < m && j < n) \\n\\n{ \\n\\nif\\n(arr1[i] < arr2[j]) \\n\\nSystem.out.print(arr1[i++]+\\n\\\" \\\"\\n); \\n\\nelse\\nif\\n(arr2[j] < arr1[i]) \\n\\nSystem.out.print(arr2[j++]+\\n\\\" \\\"\\n); \\n\\nelse\\n\\n{ \\n\\nSystem.out.print(arr2[j++]+\\n\\\" \\\"\\n); \\n\\ni++; \\n\\n} \\n\\n} \\n\\n\\n/* Print remaining elements of \\n\\nthe larger array */\\n\\nwhile\\n(i < m) \\n\\nSystem.out.print(arr1[i++]+\\n\\\" \\\"\\n); \\n\\nwhile\\n(j < n) \\n\\nSystem.out.print(arr2[j++]+\\n\\\" \\\"\\n); \\n\\n\\nreturn\\n0\\n; \\n\\n}\",\n \"private static Type[] compress(Type... types) {\\n\\t\\tint n=types.length;\\n\\t\\tint found=0;\\n\\t\\tfor (int i=0; i<n; i++) {\\n\\t\\t\\tType t=types[i];\\n\\t\\t\\tif ((t==null)||(t instanceof Nothing)) {\\n\\t\\t\\t\\ttypes[i]=null;\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tfound++;\\n\\t\\t\\tfor (int j=0; j<i; j++) {\\n\\t\\t\\t\\t// try to eliminate already contained types\\n\\t\\t\\t\\tType jt=types[j];\\n\\t\\t\\t\\tif ((jt!=null)&&jt.contains(t)) {\\n\\t\\t\\t\\t\\ttypes[i]=null;\\n\\t\\t\\t\\t\\tfound--;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (found==n) return types; // no compression needed\\n\\t\\t\\n\\t\\tType[] nts=new Type[found];\\n\\t\\tfound=0;\\n\\t\\tfor (int i=0; i<n; i++) {\\n\\t\\t\\tType t=types[i];\\n\\t\\t\\tif (t==null) continue;\\n\\t\\t\\tnts[found++]=t;\\n\\t\\t}\\n\\t\\tif (found!=nts.length) throw new RuntimeException(\\\"This shouldn't happen! found=\\\"+found+ \\\" nts.length=\\\"+nts.length);\\n\\t\\treturn nts;\\t\\t\\n\\t}\",\n \"public TailoredImage uncompress() {\\n\\t\\t\\tsetPrimaryImg(snappyUnCompress(getPrimaryImg()));\\n\\t\\t\\tsetBlockImg(snappyUnCompress(getBlockImg()));\\n\\t\\t\\treturn this;\\n\\t\\t}\",\n \"public static void main(String[] args) throws IOException {\\n BufferedReader buffRead = new BufferedReader(new FileReader(\\\"/home/hsnavarro/IdeaProjects/Aula 1/src/input\\\"));\\n FileOutputStream output = new FileOutputStream(\\\"src/output\\\", true);\\n String s = \\\"\\\";\\n s = buffRead.readLine().toLowerCase();\\n System.out.println(s);\\n CifraCesar c = new CifraCesar(0, s, true);\\n c.getInfo();\\n int[] freq = new int[26];\\n for (int i = 0; i < 26; ++i) freq[i] = 0;\\n for (int i = 0; i < c.criptografada.length(); i++) {\\n freq[c.criptografada.charAt(i) - 97]++;\\n }\\n Huffman h = new Huffman(freq, c.criptografada);\\n h.printHuffman();\\n h.descriptografiaHuffman();\\n System.out.println(\\\"huffman: \\\" + h.descriptoHuffman);\\n CifraCesar d = new CifraCesar(h.criptoAnalisis(), h.descriptoHuffman, false);\\n\\n System.out.println(d.descriptografada);\\n System.out.println(d.descriptografada);\\n\\n System.out.println(\\\"Comparando:\\\");\\n System.out.println(\\\"Antes da compressão:\\\" + s.length());\\n\\n byte inp = 0;\\n int cnt = 0;\\n for (int i = 0; i < h.criptografada.length(); i++) {\\n int idx = i % 8;\\n if (h.criptografada.charAt(i) == '1') inp += (1 << (7 - idx));\\n if (idx == 7) {\\n cnt++;\\n output.write(inp);\\n inp = 0;\\n }\\n }\\n if(h.criptografada.length() % 8 != 0){\\n cnt++;\\n output.write(inp);\\n }\\n System.out.println(\\\"Depois da compressão:\\\" + cnt);\\n buffRead.close();\\n output.close();\\n }\",\n \"public void union(int p, int q) {\\n\\t\\tint i = root(p);\\n\\t\\tint j = root(q);\\n//\\t\\tid[i] = j; instead of this do below improvement\\n\\t\\tif (sz[i] < sz[j]) {\\n\\t\\t\\tid[i] = j;\\n\\t\\t\\tsz[j] += sz[i];\\n\\t\\t} else {\\n\\t\\t\\tid[j] = i;\\n\\t\\t\\tsz[i] += sz[j];\\n\\t\\t}\\n\\t}\",\n \"void decode(){\\n int bit = -1; // next bit from compressed file: 0 or 1. no more bit: -1\\r\\n int k = 0; // index to the Huffman tree array; k = 0 is the root of tree\\r\\n int n = 0; // number of symbols decoded, stop the while loop when n == filesize\\r\\n int numBits = 0; // number of bits in the compressed file\\r\\n FileOutputStream file = null;\\r\\n try {\\r\\n file = new FileOutputStream(\\\"uncompressed.txt\\\");\\r\\n } catch (FileNotFoundException ex) {\\r\\n System.err.println(\\\"Could not open file to write to.\\\");\\r\\n }\\r\\n while ((bit = inputBit()) >= 0){\\r\\n k = codetree[k][bit];\\r\\n numBits++;\\r\\n if (codetree[k][0] == 0){ // leaf\\r\\n try {\\r\\n file.write(codetree[k][1]);\\r\\n } catch (IOException ex) {\\r\\n System.err.println(\\\"Failed to write to file.\\\");\\r\\n }\\r\\n System.out.write(codetree[k][1]);\\r\\n if (n++ == filesize) break; // ignore any additional bits\\r\\n k = 0;\\r\\n }\\r\\n }\\r\\n System.out.printf(\\\"\\\\n\\\\n------------------------------\\\\n\\\" +\\r\\n \\\"%d bytes in uncompressed file.\\\\n\\\", filesize);\\r\\n System.out.printf(\\\"%d bytes in compressed file.\\\\n\\\", numBits / 8);\\r\\n System.out.printf(\\\"Compression ratio of %f.\\\", (double)numBits / (double)filesize);\\r\\n System.out.flush();\\r\\n }\",\n \"public Maze(byte[] arr)\\n {\\n try {\\n\\n int rowSizeInt;\\n int colSizeInt;\\n int entryRowInt;\\n int entryColInt;\\n int exitRowInt;\\n int exitColInt;\\n\\n byte[] RowSizeBytes = Arrays.copyOfRange(arr, 0, 4);\\n byte[] ColSizeBytes = Arrays.copyOfRange(arr, 4, 8);\\n\\n byte[] StartRowBytes = Arrays.copyOfRange(arr, 8, 12);\\n byte[] StartColBytes = Arrays.copyOfRange(arr, 12, 16);\\n\\n byte[] EndRowBytes = Arrays.copyOfRange(arr, 16, 20);\\n byte[] EndColBytes = Arrays.copyOfRange(arr, 20, 24);\\n\\n rowSizeInt = ByteBuffer.wrap(RowSizeBytes).getInt();\\n colSizeInt = ByteBuffer.wrap(ColSizeBytes).getInt();\\n entryRowInt = ByteBuffer.wrap(StartRowBytes).getInt();\\n entryColInt = ByteBuffer.wrap(StartColBytes).getInt();\\n exitRowInt = ByteBuffer.wrap(EndRowBytes).getInt();\\n exitColInt = ByteBuffer.wrap(EndColBytes).getInt();\\n\\n this.data = new int[rowSizeInt][colSizeInt];\\n\\n //Sets the visual int matrix\\n int byteArrIndex = 24;\\n for (int i = 0; i < rowSizeInt; i++)\\n {\\n for (int j = 0; j < colSizeInt; j++)\\n {\\n this.data[i][j] = arr[byteArrIndex++];\\n }\\n }\\n\\n this.PositionMatrix = new Position[rowSizeInt / 2 + 1][colSizeInt / 2 + 1];\\n int counter = 0;\\n for (int i = 0; i < rowSizeInt / 2 + 1; i++)\\n {\\n for (int j = 0; j < colSizeInt / 2 + 1; j++)\\n {\\n this.PositionMatrix[i][j] = new Position(i, j);\\n this.PositionMatrix[i][j].setId(counter);\\n counter++;\\n }\\n }\\n\\n this.data[entryRowInt * 2][entryColInt * 2] = 0;\\n this.data[exitRowInt * 2][exitColInt * 2] = 0;\\n\\n intToPositionArr(this.PositionMatrix, data);\\n\\n this.data[entryRowInt * 2][entryColInt * 2] = 83;\\n this.data[exitRowInt * 2][exitColInt * 2] = 69;\\n\\n this.entry = PositionMatrix[entryRowInt][entryColInt];\\n this.exit = PositionMatrix[exitRowInt][exitColInt];\\n }\\n\\n catch (Exception e)\\n {\\n e.printStackTrace();\\n }\\n }\",\n \"public void union(Node a, Node b) {\\n Node set1 = find(a);\\n Node set2 = find(b);\\n\\n if (set1 != set2) {\\n // Limits the worst case runtime of a find to O(log N)\\n if (set1.getSize() < set2.getSize()) {\\n set2.setParent(set1);\\n set1.setSize(set1.getSize() + set2.getSize());\\n }\\n else {\\n set1.setParent(set2);\\n set2.setSize(set1.getSize() + set2.getSize());\\n }\\n }\\n }\",\n \"private static void compressStream(Map<Byte, byte[]> dictionary,\\n OutputStream outs) throws IOException {\\n int current_pos = 0;\\n byte[] byteStream = new byte[dictionary.size()*2];\\n boolean patternExistTwice = false;\\n for (Byte key : dictionary.keySet()) {\\n patternExistTwice =\\n doesPatternExistTwice(dictionary, dictionary.get(key));\\n\\n // If the pattern already exists twice in the dictionary then it is\\n // definitely the end of the dictionary\\n if (patternExistTwice && key == dictionary.size()) {\\n if (dictionary.get(key).length == 1) {\\n byteStream[current_pos] = 0;\\n current_pos++;\\n } else {\\n int realKey =\\n getKeyOfSubstring(dictionary, dictionary.get(key));\\n byteStream[current_pos] = (byte) realKey;\\n current_pos++;\\n }\\n byteStream[current_pos] = Util.getLastByte(dictionary.get(key));\\n current_pos++;\\n break;\\n }\\n\\n // Write Node number following by last byte of the corresponding\\n // value.\\n else {\\n if (dictionary.get(key).length == 1) {\\n byteStream[current_pos] = 0;\\n current_pos++;\\n } else {\\n int realKey =\\n getKeyOfSubstring(dictionary, dictionary.get(key));\\n byteStream[current_pos] = (byte) realKey;\\n current_pos++;\\n }\\n byteStream[current_pos] = Util.getLastByte(dictionary.get(key));\\n current_pos++;\\n }\\n }\\n\\n outs.write(byteStream);\\n }\",\n \"void Union(subset [] subsets, int x , int y ){ \\n\\t\\tint xroot = find(subsets, x); \\n\\t int yroot = find(subsets, y); \\n\\t \\n\\t\\tif (subsets[xroot].rank < subsets[yroot].rank) \\n\\t\\t\\tsubsets[xroot].parent = yroot; \\n\\t\\telse if (subsets[yroot].rank < subsets[xroot].rank) \\n\\t\\t\\tsubsets[yroot].parent = xroot; \\n\\t\\telse{ \\n\\t\\t\\tsubsets[xroot].parent = yroot; \\n\\t\\t\\tsubsets[yroot].rank++; \\n\\t\\t} \\n\\t}\",\n \"@Test\\n\\t public void test_Union_Set_Same() throws Exception{\\n\\t\\t int[] setarray1= new int[]{1,2,3};\\n\\t\\t int[] setarray2= new int[]{1,2,3};\\n\\t\\t SET set = new SET(setarray1);\\n\\t\\t int returnedArrOperation[] =set.Union(setarray1,setarray2); \\n\\t\\t int []expectedArr = new int[] {1,2,3};\\n\\t\\t Assert.assertArrayEquals( expectedArr, returnedArrOperation );\\n\\t }\",\n \"@Test\\n public void testUnionOnSchemaAdditionalColumn() throws Exception {\\n PigServer pig = new PigServer(Util.getLocalTestMode());\\n String query =\\n \\\" l1 = load '\\\" + INP_FILE_2NUMS + \\\"' as (i : int, j : int);\\\"\\n + \\\"l2 = load '\\\" + INP_FILE_2NUM_1CHAR_1BAG + \\\"' as \\\" \\n + \\\" (i : long, c : chararray, j : int \\\" \\n + \\\", b : bag { t : tuple (c1 : int, c2 : chararray)}\\\" \\n + \\\", t : tuple (tc1 : int, tc2 : chararray) );\\\"\\n + \\\"l3 = load '\\\" + INP_FILE_EMPTY + \\\"' as (i : int, x : long);\\\"\\n + \\\"u = union onschema l1, l2, l3;\\\"\\n ; \\n Util.registerMultiLineQuery(pig, query);\\n pig.explain(\\\"u\\\", System.out);\\n\\n Iterator<Tuple> it = pig.openIterator(\\\"u\\\");\\n \\n List<Tuple> expectedRes = \\n Util.getTuplesFromConstantTupleStrings(\\n new String[] {\\n \\\"(1L,2,null,null,null,null)\\\",\\n \\\"(5L,3,null,null,null,null)\\\",\\n \\\"(1L,2,'abc',{(1,'a'),(1,'b')},(1,'c'),null)\\\",\\n \\\"(5L,3,'def',{(2,'a'),(2,'b')},(2,'c'),null)\\\",\\n\\n });\\n Util.checkQueryOutputsAfterSort(it, expectedRes);\\n }\",\n \"@Deprecated\\n/* */ public void addCompression() {\\n/* 162 */ List<COSName> filters = getFilters();\\n/* 163 */ if (filters == null)\\n/* */ {\\n/* 165 */ if (this.stream.getLength() > 0L) {\\n/* */ \\n/* 167 */ OutputStream out = null;\\n/* */ \\n/* */ try {\\n/* 170 */ byte[] bytes = IOUtils.toByteArray((InputStream)this.stream.createInputStream());\\n/* 171 */ out = this.stream.createOutputStream((COSBase)COSName.FLATE_DECODE);\\n/* 172 */ out.write(bytes);\\n/* */ }\\n/* 174 */ catch (IOException e) {\\n/* */ \\n/* */ \\n/* 177 */ throw new RuntimeException(e);\\n/* */ }\\n/* */ finally {\\n/* */ \\n/* 181 */ IOUtils.closeQuietly(out);\\n/* */ }\\n/* */ \\n/* */ } else {\\n/* */ \\n/* 186 */ filters = new ArrayList<COSName>();\\n/* 187 */ filters.add(COSName.FLATE_DECODE);\\n/* 188 */ setFilters(filters);\\n/* */ } \\n/* */ }\\n/* */ }\",\n \"List<CompressResult> compress(Path input, Path output, int maxSizeInMB) throws IOException;\",\n \"@Test\\n public void compress1() throws IOException {\\n byte[] compressed = Utils.compress(null);\\n Assert.assertEquals(compressed.length, 0);\\n }\",\n \"public abstract void zza(T t, zzjl zzjl) throws IOException;\",\n \"void union(int a, int b) {\\n\\t\\tif (a==9 && b==4){\\r\\n\\t\\tSystem.out.println(\\\"DEBUGGING 9 AND 4\\\");\\r\\n\\t\\tSystem.out.println(\\\"size of A: \\\"+ sizeOf(a));\\r\\n\\t\\tSystem.out.println(\\\"size of B: \\\"+ sizeOf(b));\\r\\n\\t\\t}\\r\\n\\t\\tint rootB = getRoot(b); // N array access\\r\\n\\t\\tint rootA = getRoot(a); // N array access\\r\\n\\t\\tif (rootA==rootB)return;\\r\\n\\r\\n\\t\\tif (sizeOf(rootA)<sizeOf(rootB)){\\r\\n\\t\\t\\tidNode[rootA] = rootB; // 1 array access\\r\\n\\t\\t}\\r\\n\\t\\telse{\\r\\n\\t\\t\\tidNode[rootB] = rootA; // 1 array access\\r\\n\\t\\t}\\r\\n\\t}\",\n \"protected void or(final EWAHCompressedBitmap a,\\n\\t\\t\\tfinal BitmapStorage container) {\\n\\t\\tfinal EWAHIterator i = a.getEWAHIterator();\\n\\t\\tfinal EWAHIterator j = getEWAHIterator();\\n\\t\\tif (!(i.hasNext() && j.hasNext())) {// this never happens...\\n\\t\\t\\tcontainer.setSizeInBits(sizeInBits());\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\t// at this point, this is safe:\\n\\t\\tBufferedRunningLengthWord rlwi =\\n\\t\\t\\t\\tnew BufferedRunningLengthWord(i.next());\\n\\t\\tBufferedRunningLengthWord rlwj =\\n\\t\\t\\t\\tnew BufferedRunningLengthWord(j.next());\\n\\t\\t// RunningLength;\\n\\t\\twhile (true) {\\n\\t\\t\\tfinal boolean i_is_prey = rlwi.size() < rlwj.size();\\n\\t\\t\\tfinal BufferedRunningLengthWord prey = i_is_prey ? rlwi : rlwj;\\n\\t\\t\\tfinal BufferedRunningLengthWord predator = i_is_prey ? rlwj : rlwi;\\n\\t\\t\\tif (prey.getRunningBit() == false) {\\n\\t\\t\\t\\tfinal long predatorrl = predator.getRunningLength();\\n\\t\\t\\t\\tfinal long preyrl = prey.getRunningLength();\\n\\t\\t\\t\\tfinal long tobediscarded =\\n\\t\\t\\t\\t\\t\\t(predatorrl >= preyrl) ? preyrl : predatorrl;\\n\\t\\t\\t\\tcontainer.addStreamOfEmptyWords(predator.getRunningBit(),\\n\\t\\t\\t\\t\\t\\ttobediscarded);\\n\\t\\t\\t\\tfinal long dw_predator =\\n\\t\\t\\t\\t\\t\\tpredator.dirtywordoffset\\n\\t\\t\\t\\t\\t\\t\\t\\t+ (i_is_prey ? j.dirtyWords() : i.dirtyWords());\\n\\t\\t\\t\\tcontainer.addStreamOfDirtyWords(\\n\\t\\t\\t\\t\\t\\ti_is_prey ? j.buffer() : i.buffer(), dw_predator,\\n\\t\\t\\t\\t\\t\\tpreyrl - tobediscarded);\\n\\t\\t\\t\\tpredator.discardFirstWords(preyrl);\\n\\t\\t\\t\\tprey.discardFirstWords(preyrl);\\n\\t\\t\\t\\tprey.RunningLength = 0;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\t// we have a stream of 1x11\\n\\t\\t\\t\\tcontainer.addStreamOfEmptyWords(true, prey.RunningLength);\\n\\t\\t\\t\\tpredator.discardFirstWords(prey.RunningLength);\\n\\t\\t\\t\\tprey.RunningLength = 0;\\n\\t\\t\\t}\\n\\t\\t\\tlong predatorrl = predator.getRunningLength();\\n\\t\\t\\tif (predatorrl > 0) {\\n\\t\\t\\t\\tif (predator.getRunningBit() == false) {\\n\\t\\t\\t\\t\\tfinal long nbre_dirty_prey = prey.getNumberOfLiteralWords();\\n\\t\\t\\t\\t\\tfinal long tobediscarded =\\n\\t\\t\\t\\t\\t\\t\\t(predatorrl >= nbre_dirty_prey) ? nbre_dirty_prey\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t: predatorrl;\\n\\t\\t\\t\\t\\tfinal long dw_prey =\\n\\t\\t\\t\\t\\t\\t\\tprey.dirtywordoffset\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t+ (i_is_prey ? i.dirtyWords() : j\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t.dirtyWords());\\n\\t\\t\\t\\t\\tpredator.discardFirstWords(tobediscarded);\\n\\t\\t\\t\\t\\tprey.discardFirstWords(tobediscarded);\\n\\t\\t\\t\\t\\tcontainer.addStreamOfDirtyWords(\\n\\t\\t\\t\\t\\t\\t\\ti_is_prey ? i.buffer() : j.buffer(), dw_prey,\\n\\t\\t\\t\\t\\t\\t\\ttobediscarded);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tfinal long nbre_dirty_prey = prey.getNumberOfLiteralWords();\\n\\t\\t\\t\\t\\tfinal long tobediscarded =\\n\\t\\t\\t\\t\\t\\t\\t(predatorrl >= nbre_dirty_prey) ? nbre_dirty_prey\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t: predatorrl;\\n\\t\\t\\t\\t\\tcontainer.addStreamOfEmptyWords(true, tobediscarded);\\n\\t\\t\\t\\t\\tpredator.discardFirstWords(tobediscarded);\\n\\t\\t\\t\\t\\tprey.discardFirstWords(tobediscarded);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t// all that is left to do now is to OR the dirty words\\n\\t\\t\\tfinal long nbre_dirty_prey = prey.getNumberOfLiteralWords();\\n\\t\\t\\tif (nbre_dirty_prey > 0) {\\n\\t\\t\\t\\tfor (int k = 0; k < nbre_dirty_prey; ++k) {\\n\\t\\t\\t\\t\\tif (i_is_prey)\\n\\t\\t\\t\\t\\t\\tcontainer.add(i.buffer()[prey.dirtywordoffset\\n\\t\\t\\t\\t\\t\\t\\t\\t+ i.dirtyWords() + k]\\n\\t\\t\\t\\t\\t\\t\\t\\t| j.buffer()[predator.dirtywordoffset\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ j.dirtyWords() + k]);\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\tcontainer.add(i.buffer()[predator.dirtywordoffset\\n\\t\\t\\t\\t\\t\\t\\t\\t+ i.dirtyWords() + k]\\n\\t\\t\\t\\t\\t\\t\\t\\t| j.buffer()[prey.dirtywordoffset\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t+ j.dirtyWords() + k]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tpredator.discardFirstWords(nbre_dirty_prey);\\n\\t\\t\\t}\\n\\t\\t\\tif (i_is_prey) {\\n\\t\\t\\t\\tif (!i.hasNext()) {\\n\\t\\t\\t\\t\\trlwi = null;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\trlwi.reset(i.next());// = new\\n\\t\\t\\t\\t// BufferedRunningLengthWord(i.next());\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tif (!j.hasNext()) {\\n\\t\\t\\t\\t\\trlwj = null;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\trlwj.reset(j.next());// = new\\n\\t\\t\\t\\t// BufferedRunningLengthWord(\\n\\t\\t\\t\\t// j.next());\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (rlwi != null)\\n\\t\\t\\tdischarge(rlwi, i, container);\\n\\t\\tif (rlwj != null)\\n\\t\\t\\tdischarge(rlwj, j, container);\\n\\t\\tcontainer.setSizeInBits(Math.max(sizeInBits(), a.sizeInBits()));\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6078011","0.5770655","0.5617805","0.5239181","0.52080214","0.51984406","0.5041264","0.5038277","0.5012343","0.49760485","0.49601242","0.4949983","0.49269795","0.49177694","0.4912341","0.4854456","0.48174682","0.47809237","0.47483322","0.47452906","0.47368667","0.47256485","0.47195032","0.47193572","0.47104612","0.4709311","0.47049668","0.46999016","0.46851635","0.46606052","0.46541464","0.46536666","0.4637351","0.46307114","0.45820534","0.45649213","0.45600134","0.45571312","0.45542684","0.45353505","0.4527238","0.4526588","0.45264915","0.45257026","0.4522161","0.45201236","0.45196328","0.45171812","0.45141172","0.44948992","0.44948903","0.44869217","0.44868225","0.44866842","0.44826144","0.4476671","0.4475553","0.44621503","0.44614726","0.44603837","0.44527698","0.4450494","0.44379774","0.44262877","0.44262102","0.4405389","0.44031993","0.43982926","0.43960556","0.4391486","0.4387746","0.4374688","0.43702808","0.436323","0.43603405","0.43596706","0.43591478","0.43535215","0.43494353","0.43492338","0.4343366","0.43380052","0.4334791","0.43318617","0.43306318","0.43233606","0.4320021","0.43172273","0.43095303","0.43028298","0.43004245","0.42988634","0.42974356","0.429355","0.42856866","0.42816418","0.42813623","0.42789423","0.4273836","0.42639676"],"string":"[\n \"0.6078011\",\n \"0.5770655\",\n \"0.5617805\",\n \"0.5239181\",\n \"0.52080214\",\n \"0.51984406\",\n \"0.5041264\",\n \"0.5038277\",\n \"0.5012343\",\n \"0.49760485\",\n \"0.49601242\",\n \"0.4949983\",\n \"0.49269795\",\n \"0.49177694\",\n \"0.4912341\",\n \"0.4854456\",\n \"0.48174682\",\n \"0.47809237\",\n \"0.47483322\",\n \"0.47452906\",\n \"0.47368667\",\n \"0.47256485\",\n \"0.47195032\",\n \"0.47193572\",\n \"0.47104612\",\n \"0.4709311\",\n \"0.47049668\",\n \"0.46999016\",\n \"0.46851635\",\n \"0.46606052\",\n \"0.46541464\",\n \"0.46536666\",\n \"0.4637351\",\n \"0.46307114\",\n \"0.45820534\",\n \"0.45649213\",\n \"0.45600134\",\n \"0.45571312\",\n \"0.45542684\",\n \"0.45353505\",\n \"0.4527238\",\n \"0.4526588\",\n \"0.45264915\",\n \"0.45257026\",\n \"0.4522161\",\n \"0.45201236\",\n \"0.45196328\",\n \"0.45171812\",\n \"0.45141172\",\n \"0.44948992\",\n \"0.44948903\",\n \"0.44869217\",\n \"0.44868225\",\n \"0.44866842\",\n \"0.44826144\",\n \"0.4476671\",\n \"0.4475553\",\n \"0.44621503\",\n \"0.44614726\",\n \"0.44603837\",\n \"0.44527698\",\n \"0.4450494\",\n \"0.44379774\",\n \"0.44262877\",\n \"0.44262102\",\n \"0.4405389\",\n \"0.44031993\",\n \"0.43982926\",\n \"0.43960556\",\n \"0.4391486\",\n \"0.4387746\",\n \"0.4374688\",\n \"0.43702808\",\n \"0.436323\",\n \"0.43603405\",\n \"0.43596706\",\n \"0.43591478\",\n \"0.43535215\",\n \"0.43494353\",\n \"0.43492338\",\n \"0.4343366\",\n \"0.43380052\",\n \"0.4334791\",\n \"0.43318617\",\n \"0.43306318\",\n \"0.43233606\",\n \"0.4320021\",\n \"0.43172273\",\n \"0.43095303\",\n \"0.43028298\",\n \"0.43004245\",\n \"0.42988634\",\n \"0.42974356\",\n \"0.429355\",\n \"0.42856866\",\n \"0.42816418\",\n \"0.42813623\",\n \"0.42789423\",\n \"0.4273836\",\n \"0.42639676\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.70544344"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":38179,"cells":{"query":{"kind":"string","value":"METHOD 3: UnionByHeight This method runs unionbyheight to solve the maze. This is of type nonreturn."},"document":{"kind":"string","value":"public static void mazeHeight(){\n\t\tint n = 10;\t\n\n\t\tdsf S = new dsf(n*n);\n\t\tMaze three = new Maze(n);\n\n\t\tRandom random;\n\t\tint sets = n*n;\t//number of sets in the DSF\n\t\tint randomNumber;\n\t\tint randomDirection;\n\t\tint row;\n\t\tint col;\n\n\t\tchar upperRight; \t//bottom or right\n\n\t\tS.print();\n\n\t\twhile(sets > 1){\n\t\t\trandom = new Random();\n\t\t\trandomNumber = random.nextInt((n*n) - 1);\n\t\t\t//System.out.println(\"RANDOM NUMBER: \"+randomNumber);\n\t\t\trow = randomNumber /n;\t//SWITCHED\n\t\t\tcol = randomNumber %n;\t//SWITCHED\n\t\t\trandomDirection = random.nextInt(2);\n\t\t\tString direct;\n\t\t\tif(randomDirection == 0)\n\t\t\t\tdirect = \"upper\";\n\t\t\telse\n\t\t\t\tdirect = \"right\";\n\t\t\t//System.out.println(\"RANDOM DIRECTI0N: \"+direct);\n\t\t\tupperRight = three.direction(randomDirection);\n\n\t\t\tif(upperRight == 'u'){\n\t\t\t\tif((randomNumber) < ((n*n)-n)){\n\t\t\t\t\tSystem.out.println(\"Sets: \"+sets);\n\t\t\t\t\tif(S.find(randomNumber) != S.find(randomNumber + n)){\n\t\t\t\t\t\tS.unionByHeight(randomNumber, randomNumber+n);\n\t\t\t\t\t\tthree.remove_wall(col, row, 'u');\n\t\t\t\t\t\tS.print();\n\t\t\t\t\t\tsets--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(upperRight == 'r'){\n\t\t\t\tif(((randomNumber)%(n*n)) != n-1){\n\t\t\t\t\tif(S.find(randomNumber) != S.find(randomNumber+1)){\n\t\t\t\t\t\tS.unionByHeight(randomNumber, randomNumber+1);\n\t\t\t\t\t\tthree.remove_wall(col, row, 'r');\n\t\t\t\t\t\tS.print();\n\t\t\t\t\t\tsets--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tbuildAdjacencyList(three, n);\n\t\tuserSelection_SolveMaze(n);\n\n\n\t\tStdDraw.show(0);\n\t\tthree.draw();\n\t\tthree.printCellNumbers();\t\n\t}"},"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 static void mazeUnion(){\n\n\t\tint n = 10;\t\n\n\t\tdsf S = new dsf(n*n);\n\t\tMaze one = new Maze(n);\n\n\t\tRandom random;\n\t\tint sets = n*n;\t//number of sets in the DSF\n\t\tint randomNumber;\n\t\tint randomDirection;\n\t\tint row;\n\t\tint col;\n\n\t\tchar upperRight; \t//bottom or right\n\n\t\tS.print();\n\n\t\twhile(sets > 1){\n\t\t\trandom = new Random();\n\t\t\trandomNumber = random.nextInt((n*n) - 1);\n\t\t\tSystem.out.println(\"RANDOM NUMBER: \"+randomNumber);\n\t\t\trow = randomNumber /n;\t//SWITCHED\n\t\t\tcol = randomNumber %n;\t//SWITCHED\n\t\t\trandomDirection = random.nextInt(2);\n\t\t\tString direct;\n\t\t\tif(randomDirection == 0)\n\t\t\t\tdirect = \"upper\";\n\t\t\telse\n\t\t\t\tdirect = \"right\";\n\t\t\tSystem.out.println(\"RANDOM DIRECTI0N: \"+direct);\n\t\t\tupperRight = one.direction(randomDirection);\n\n\t\t\tif(upperRight == 'u'){\n\t\t\t\tif((randomNumber) < ((n*n)-n)){\n\t\t\t\t\tSystem.out.println(\"Sets: \"+sets);\n\t\t\t\t\tif(S.find(randomNumber+n) != S.find(randomNumber)){\n\t\t\t\t\t\tS.union(randomNumber+n, randomNumber);\n\t\t\t\t\t\tone.remove_wall(col, row, 'u');\n\t\t\t\t\t\tS.print();\n\t\t\t\t\t\tsets--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(upperRight == 'r'){\n\t\t\t\tif(((randomNumber)%(n*n)) != n-1){\n\t\t\t\t\tif(S.findAndCompress(randomNumber) != S.findAndCompress(randomNumber+1)){\n\t\t\t\t\t\tS.union(randomNumber, randomNumber+1);\n\t\t\t\t\t\tone.remove_wall(col, row, 'r');\n\t\t\t\t\t\t//S.print();\n\t\t\t\t\t\tsets--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tStdDraw.show(0);\n\t\tone.draw();\n\t\tone.printCellNumbers();\n\t\t\n\t\tbuildAdjacencyList(one, n);\n\t\tuserSelection_SolveMaze(n);\n\n\t}","public static void unionPathCompression(){\n\t\tint n = 10;\t\n\n\t\tdsf S = new dsf(n*n);\n\t\tMaze two = new Maze(n);\n\n\t\tRandom random;\n\t\tint sets = n*n;\t//number of sets in the DSF\n\t\tint randomNumber;\n\t\tint randomDirection;\n\t\tint row;\n\t\tint col;\n\n\t\tchar upperRight; \t//bottom or right\n\n\t\tS.print();\n\n\t\twhile(sets > 1){\n\t\t\trandom = new Random();\n\t\t\trandomNumber = random.nextInt((n*n) - 1);\n\t\t\t//System.out.println(\"RANDOM NUMBER: \"+randomNumber);\n\t\t\trow = randomNumber /n;\t//SWITCHED\n\t\t\tcol = randomNumber %n;\t//SWITCHED\n\t\t\trandomDirection = random.nextInt(2);\n\t\t\tString direct;\n\t\t\tif(randomDirection == 0)\n\t\t\t\tdirect = \"upper\";\n\t\t\telse\n\t\t\t\tdirect = \"right\";\n\t\t\tSystem.out.println(\"RANDOM DIRECTI0N: \"+direct);\n\t\t\tupperRight = two.direction(randomDirection);\n\n\t\t\tif(upperRight == 'u'){\n\t\t\t\tif((randomNumber) < ((n*n)-n)){\n\t\t\t\t\tSystem.out.println(\"Sets: \"+sets);\n\t\t\t\t\tif(S.findAndCompress(randomNumber+n) != S.findAndCompress(randomNumber)){\n\t\t\t\t\t\tS.union(randomNumber+n, randomNumber);\n\t\t\t\t\t\ttwo.remove_wall(col, row, 'u');\n\t\t\t\t\t\tS.print();\n\t\t\t\t\t\tsets--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(upperRight == 'r'){\n\t\t\t\tif(((randomNumber)%(n*n)) != n-1){\n\t\t\t\t\tif(S.findAndCompress(randomNumber) != S.findAndCompress(randomNumber+1)){\n\t\t\t\t\t\tS.union(randomNumber, randomNumber+1);\n\t\t\t\t\t\ttwo.remove_wall(col, row, 'r');\n\t\t\t\t\t\tS.print();\n\t\t\t\t\t\tsets--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tbuildAdjacencyList(two, n);\n\t\tuserSelection_SolveMaze(n);\n\n\n\t\tStdDraw.show(0);\n\t\ttwo.draw();\n\t\ttwo.printCellNumbers();\n\t}","void union(int x,int y){\n int xRoot=find(x),yRoot=find(y);\n if(xRoot==yRoot)return;\n if(rank[xRoot]<rank[yRoot])\n parent[xRoot]=yRoot;\n else if(rank[xRoot]>rank[yRoot])\n parent[yRoot]=xRoot;\n else{\n parent[yRoot]=xRoot;\n rank[xRoot]=rank[xRoot]+1;\n }\n --totalSets;\n }","public void union(int p, int q){\r\n\t\tint rootP = root(p);\r\n\t\tint rootQ = root(q);\r\n\t\t\r\n\t\tif(rootP == rootQ) return;\r\n\t\t// Calculate height of tree and then link the root of smaller tree to root of larger tree\r\n\t\t\r\n\t\tif(size[rootP] < size[rootQ]) {\r\n\t\t\tid[rootP] = rootQ;\r\n\t\t\tsize[rootQ] = size[rootQ] + size[rootP];\r\n\t\t}\r\n\t\telse {\r\n\t\t\tid[rootQ] = rootP;\r\n\t\t\tsize[rootP] = size[rootQ] + size[rootP];\r\n\t\t}\r\n\t}","public void union(String p, String q) {\n if(p.equals(q)) return;\n String rootP = findRoot(p);\n String rootQ = findRoot(q);\n // skip if both users are already part of the same tree.\n if(rootP.equals(rootQ)) return;\n\n int newHeight = treesHeight.get(rootP) + treesHeight.get(rootQ);\n // Keep track of the highest tree.\n highestHeight = Math.max(highestHeight, newHeight);\n\n if (treesHeight.get(rootP) > treesHeight.get(rootQ)) {\n usersMap.put(rootQ, rootP);\n treesHeight.put(rootP, newHeight);\n }\n else {\n usersMap.put(rootP, rootQ);\n treesHeight.put(rootQ, newHeight);\n }\n }","@Override\n public void union(int root1, int root2) {\n // TODO: Implement the union-by-rank algorithm for disjoint set\n if (s[root1]>-1 || s[root2]>-1 ) throw new IllegalArgumentException(\"Impossible to union because one of the roots is already dependant\");\n if( s[root2] < s[root1]){ // root2 is deeper\n s[root1] = root2;// Make root2 new root\n } \n else{\n if(s[root1] == s[root2]) s[ root1 ]--; // Update height if same\n s[root2] = root1; // Make root1 new root\n }\n }","public void union(int i, int j) {\n\tint p = findRoot(i);\n\tint q = findRoot(j);\n\t\n\tif (p == q) return;\n\t\n\tif (size[p] < size[q]) { //pick the smallest tree and append it to the bigger tree\n\t root[p] = q;\n\t size[p] += size[q];\n\t} else {\n\t root[q] = p;\n\t size[q] += size[p];\n\t}\n }","void union(int x, int y) {\n\n // **** set the modes in the parents array ****\n if (parents[x] == 0)\n parents[x] = x;\n\n if (parents[y] == 0)\n parents[y] = y;\n\n // **** update the representative element of each set ****\n if (parents[x] != 0 || parents[y] != 0) {\n\n // **** get the low and high from these nodes ****\n int high = Math.max(parents[x], parents[y]);\n int low = Math.min(parents[x], parents[y]);\n\n // ???? ????\n System.out.println(\"union <<< high: \" + high + \" low: \" + low);\n\n // **** update to point to the proper representative ****\n for (int i = 0; i < parents.length; i++) {\n if (parents[i] == high)\n parents[i] = low;\n }\n }\n }","public void createMaze(int rows, int cols) {\n\t\t\n\t\tint total = rows*cols;\n\t\tDisjSets ds = new DisjSets(total); //Create an object of the disjoint set class\n\t\t \n\t\tList<List<Node>> maze = new ArrayList<List<Node>>();\n\t\t \n\t\tmaze = initializeMaze(rows, cols, maze); //Initialize the maze\n\t\t \n\t\tRandom rand = new Random();\n\t\t \n\t\twhile(ds.find(0) != ds.find(total - 1)) {\n\t\t\t \n\t\t\tint currRow = rand.nextInt(rows); //Random row number\n\t\t\tint currCol = rand.nextInt(cols); //Random column number\n\t\t\tNode currNode = maze.get(currRow).get(currCol); //Current node(cell)\n\t\t\tint currValue = currNode.value;\n\t\t\t \n\t\t\tint root1 = ds.find(currValue); //Find on current node(cell)\n\t\t\tint root2;\n\t\t\tboolean removeHorizontal = false;\n\t\t\t \n\t\t\tif(currValue == total - 1) {\n\t\t\t\tcontinue; //Don't do anything if the current cell is the bottom-rightmost cell\n\t\t\t}\n\t\t\t \n\t\t\tif(currRow == rows - 1) {\n\t\t\t\t//Last row -- can only break the right wall, can't break the wall to the bottom \n\t\t\t\troot2 = ds.find(currValue + 1);\n\t\t\t} else if(currCol == cols - 1) {\n\t\t\t\t//Last column -- can only break the wall to the bottom, can't break the right wall \n\t\t\t\troot2 = ds.find(currValue + cols);\n\t\t\t\tremoveHorizontal = true;\n\t\t\t} else {\n\t\t\t\t//Neither last row nor last column\n\t\t\t\t//Randomly select either right wall or wall to the bottom to break\n\t\t\t\tboolean selectRight;\n\t\t\t\tselectRight = rand.nextBoolean();\n\t\t\t\t \n\t\t\t\tif(selectRight) {\n\t\t\t\t\troot2 = ds.find(currValue + 1);\n\t\t\t\t} else {\n\t\t\t\t\troot2 = ds.find(currValue + cols);\n\t\t\t\t\tremoveHorizontal = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\t//Finds resulted in different sets\n\t\t\tif(root1 != root2) {\n\t\t\t\t \n\t\t\t\tds.union(root1, root2); //Take union of the two sets\n\t\t\t\t \n\t\t\t\tif(removeHorizontal) {\n\t\t\t\t\tcurrNode.horizontal = false; //Break the horizontal wall\n\t\t\t\t} else {\n\t\t\t\t\tcurrNode.vertical = false; //Break the vertical wall\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\t//Leave the bottom right corner open\n\t\tNode destination = maze.get(rows - 1).get(cols - 1);\n\t\tdestination.horizontal = false;\n\t\tdestination.vertical = false;\n\t\t \n\t\tprintMaze(rows, cols, maze); //Print the final maze\n\t}","@Test\n public void testMatchLimitOneBottomUp() throws Exception {\n\n HepProgramBuilder programBuilder = HepProgram.builder();\n programBuilder.addMatchLimit( 1 );\n programBuilder.addMatchOrder( HepMatchOrder.BOTTOM_UP );\n programBuilder.addRuleInstance( UnionToDistinctRule.INSTANCE );\n\n checkPlanning( programBuilder.build(), UNION_TREE );\n }","public void union(int p, int q) {\n\t\tint i = find(p);\n\t\tint j = find(q);\n\t\tif (i == j)\n\t\t\treturn;\n\t\t\n\t\t// make shorter root point to taller one\n\t\tif (height[i] < height[j]) parent[i] = j;\n\t else if (height[i] > height[j]) parent[j] = i;\n\t else {\n\t \tparent[j] = i;\n\t height[i]++;\n\t }\n\t\tcount--;\n\t}","public static void mazeSize(){\n\t\tint n = 10;\t\n\n\t\tdsf S = new dsf(n*n);\n\t\tMaze four = new Maze(n);\n\n\t\tRandom random;\n\t\tint sets = n*n;\t//number of sets in the DSF\n\t\tint randomNumber;\n\t\tint randomDirection;\n\t\tint row;\n\t\tint col;\n\n\t\tchar upperRight; \t//bottom or right\n\n\t\tS.print();\n\n\t\twhile(sets > 1){\n\t\t\trandom = new Random();\n\t\t\trandomNumber = random.nextInt((n*n) - 1);\n\t\t\t//System.out.println(\"RANDOM NUMBER: \"+randomNumber);\n\t\t\trow = randomNumber /n;\t//SWITCHED\n\t\t\tcol = randomNumber %n;\t//SWITCHED\n\t\t\trandomDirection = random.nextInt(2);\n\t\t\tString direct = null;\n\t\t\tif(randomDirection == 0)\n\t\t\t\tdirect = \"upper\";\n\t\t\tif(randomDirection == 1)\n\t\t\t\tdirect = \"right\";\n\t\t\t//System.out.println(\"RANDOM DIRECTI0N: \"+direct);\n\t\t\tupperRight = four.direction(randomDirection);\n\n\t\t\tif(upperRight == 'u'){\n\t\t\t\tif((randomNumber) < ((n*n)-n)){\n\t\t\t\t\t//System.out.println(\"Sets: \"+sets);\n\t\t\t\t\tif(S.find(randomNumber) != S.find(randomNumber + n)){\n\t\t\t\t\t\tS.unionBySize(randomNumber, randomNumber+n);\n\t\t\t\t\t\tfour.remove_wall(col, row, 'u');\n\t\t\t\t\t\t//S.print();\n\t\t\t\t\t\tsets--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(upperRight == 'r'){\n\t\t\t\tif(((randomNumber)%(n*n)) != n-1){\n\t\t\t\t\tif(S.find(randomNumber) != S.find(randomNumber+1)){\n\t\t\t\t\t\tS.unionBySize(randomNumber, randomNumber+1);\n\t\t\t\t\t\tfour.remove_wall(col, row, 'r');\n\t\t\t\t\t\t//S.print();\n\t\t\t\t\t\tsets--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tbuildAdjacencyList(four, n);\n\t\tuserSelection_SolveMaze(n);\n\n\n\t\tStdDraw.show(0);\n\t\tfour.draw();\n\t\tfour.printCellNumbers();\t\n\t}","public void union(BlastGraph<HitVertex, ValueEdge> graphToUnion) {\n\t\tfor (HitVertex hv : graphToUnion.getVertices()) {\n\t\t\tthis.addVertex(hv);\n\t\t}\n\n\t\tfor (ValueEdge ve : graphToUnion.getEdges()) {\n\t\t\tthis.addEdge(ve, graphToUnion.getEndpoints(ve));\n\t\t}\n\t}","public static void sizePathCompression(){\n\t\tint n = 10;\t\n\n\t\tdsf S = new dsf(n*n);\n\t\tMaze five = new Maze(n);\n\n\t\tRandom random;\n\t\tint sets = n*n;\t//number of sets in the DSF\n\t\tint randomNumber;\n\t\tint randomDirection;\n\t\tint row;\n\t\tint col;\n\n\t\tchar upperRight; \t//bottom or right\n\n\t\tS.print();\n\n\t\twhile(sets > 1){\n\t\t\trandom = new Random();\n\t\t\trandomNumber = random.nextInt((n*n) - 1);\n\t\t\t//System.out.println(\"RANDOM NUMBER: \"+randomNumber);\n\t\t\trow = randomNumber /n;\t//SWITCHED\n\t\t\tcol = randomNumber %n;\t//SWITCHED\n\t\t\trandomDirection = random.nextInt(2);\n\t\t\tString direct;\n\t\t\tif(randomDirection == 0)\n\t\t\t\tdirect = \"upper\";\n\t\t\telse\n\t\t\t\tdirect = \"right\";\n\t\t\t//System.out.println(\"RANDOM DIRECTI0N: \"+direct);\n\t\t\tupperRight = five.direction(randomDirection);\n\n\t\t\tif(upperRight == 'u'){\n\t\t\t\tif((randomNumber) < ((n*n)-n)){\n\t\t\t\t\tSystem.out.println(\"Sets: \"+sets);\n\t\t\t\t\tif(S.findAndCompress(randomNumber) != S.findAndCompress(randomNumber + n)){\n\t\t\t\t\t\tS.unionBySize(randomNumber+n, randomNumber);\n\t\t\t\t\t\tfive.remove_wall(col, row, 'u');\n\t\t\t\t\t\t//S.print();\n\t\t\t\t\t\tsets--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(upperRight == 'r'){\n\t\t\t\tif(((randomNumber)%(n*n)) != n-1){\n\t\t\t\t\tif(S.findAndCompress(randomNumber) != S.findAndCompress(randomNumber+1)){\n\t\t\t\t\t\tS.unionBySize(randomNumber, randomNumber+1);\n\t\t\t\t\t\tfive.remove_wall(col, row, 'r');\n\t\t\t\t\t\tS.print();\n\t\t\t\t\t\tsets--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tbuildAdjacencyList(five, n);\n\t\tuserSelection_SolveMaze(n);\n\n\t\tStdDraw.show(0);\n\t\tfive.draw();\n\t\tfive.printCellNumbers();\t\n\t}","public void union(T x, T y) {\n\t\tassert (_parents.containsKey(x));\n\t\tassert (_parents.containsKey(y));\n\n\t\tx = find(x);\n\t\ty = find(y);\n\n\t\tif (x == y) {\n\t\t\treturn;\n\t\t}\n\n\t\tint xRank = _ranks.get(x);\n\t\tint yRank = _ranks.get(y);\n\n\t\tif (xRank < yRank) {\n\t\t\t_parents.put(x, y);\n\t\t} else if (xRank > yRank) {\n\t\t\t_parents.put(y, x);\n\t\t} else {\n\t\t\t_parents.put(y, x);\n\t\t\t_ranks.put(x, xRank + 1);\n\t\t}\n\n\t\t_numSets--;\n\t}","public org.apache.gora.cascading.test.storage.TestRow.Builder clearUnionRecursive() {\n unionRecursive = null;\n fieldSetFlags()[3] = false;\n return this;\n }","public void union(int first, int second){\n int firstId = find(first);\n int secondId = find(second);\n //Check if these are already connected\n if(firstId == secondId){\n return;\n }\n if(size[firstId] < size[secondId]){\n size[secondId]+=size[firstId];\n grid[first] = secondId;\n }\n else {\n size[firstId]+=size[secondId];\n grid[second] = firstId;\n }\n --numOfComponents;\n }","void Union( int x, int y){\n\n int i = root(x);\n int j = root(y);\n if (i == j) return;\n if (rank[i] > rank[j]) { id[j] = i; rank[i] += rank[j]; }\n else { id[i] = j; rank[j] += rank[i]; }\n }","public void union(int p, int q)\n {\n int i = root(p);\n int j = root(q);\n if ( i == j ) return;\n \n if ( sz[i] < sz[j] ) { \n // i is no longer a root, so we don't need to update the size\n id[i] = j; sz[j] += sz[i];\n }\n else {\n id[j] = i; sz[i] += sz[j]; \n } \n }","public void union(int p, int q)\n {\n int i = this.root(p);\n int j = this.root(q);\n if (i == j) return;\n\n if (this.size[i] < this.size[j])\n {\n this.parent[i] = j;\n this.size[j] += this.size[i];\n }\n else\n {\n this.parent[j] = i;\n this.size[i] += this.size[j];\n }\n }","public void quickUnion(int p, int q) {\n int pid = find(p);\n int qid = find(q);\n if (pid == qid) return;\n //compare two value's height\n //if two height is same just need add 1 in parent root\n if (height[p] == height[q]) {\n id[pid] = qid;\n height[qid]++;\n } else if (height[p] < height[q]) {\n id[pid] = qid;\n } else {\n id[qid] = pid;\n }\n\n }","public void updateUnionArea() {\n this.mBlurUnionRect.setEmpty();\n for (Map.Entry<View, HwBlurEntity> entityEntry : this.mTargetViews.entrySet()) {\n View targetView = entityEntry.getKey();\n HwBlurEntity blurEntity = entityEntry.getValue();\n if (targetView.isShown() && blurEntity.isEnabled()) {\n Rect targetViewRect = new Rect();\n targetView.getGlobalVisibleRect(targetViewRect);\n blurEntity.setTargetViewRect(targetViewRect);\n this.mBlurUnionRect.union(targetViewRect);\n }\n targetView.invalidate();\n }\n initBitmapAndCanvas();\n }","public void open(int row, int col) {\n check(row, col);\n if (!isOpen(row, col)) {\n sites[row - 1][col - 1] = true;\n openSites++;\n\n int index = index(row, col);\n if (row == gridDimension) {\n unionFind.union(index, bottomRoot);\n\n if (gridDimension == 1){\n unionFind.union(index, topRoot);\n fullSites.union(index, topRoot);\n }\n else if (isOpen(row - 1, col)) {\n unionFind.union(index(row - 1, col), index);\n fullSites.union(index(row - 1, col), index);\n }\n }\n else if (row == 1) {\n unionFind.union(index, topRoot);\n fullSites.union(index, topRoot);\n\n if (isOpen(row + 1, col)) {\n unionFind.union(index(row + 1, col), index);\n fullSites.union(index(row + 1, col), index);\n }\n }\n\n else {\n if (isOpen(row + 1, col)) {\n unionFind.union(index(row + 1, col), index);\n fullSites.union(index(row + 1, col), index);\n }\n\n if (isOpen(row - 1, col)) {\n unionFind.union(index(row - 1, col), index);\n fullSites.union(index(row - 1, col), index);\n }\n }\n\n\n\n if (col > 1) {\n if (isOpen(row, col - 1)) {\n unionFind.union(index(row, col - 1), index);\n fullSites.union(index(row, col - 1), index);\n }\n }\n\n if (col < gridDimension) {\n if (isOpen(row, col + 1)) {\n unionFind.union(index(row, col + 1), index);\n fullSites.union(index(row, col + 1), index);\n }\n }\n }\n }","public void union(Node a, Node b) {\n Node set1 = find(a);\n Node set2 = find(b);\n\n if (set1 != set2) {\n // Limits the worst case runtime of a find to O(log N)\n if (set1.getSize() < set2.getSize()) {\n set2.setParent(set1);\n set1.setSize(set1.getSize() + set2.getSize());\n }\n else {\n set1.setParent(set2);\n set2.setSize(set1.getSize() + set2.getSize());\n }\n }\n }","void union(int a, int b) {\n\t\tif (a==9 && b==4){\r\n\t\tSystem.out.println(\"DEBUGGING 9 AND 4\");\r\n\t\tSystem.out.println(\"size of A: \"+ sizeOf(a));\r\n\t\tSystem.out.println(\"size of B: \"+ sizeOf(b));\r\n\t\t}\r\n\t\tint rootB = getRoot(b); // N array access\r\n\t\tint rootA = getRoot(a); // N array access\r\n\t\tif (rootA==rootB)return;\r\n\r\n\t\tif (sizeOf(rootA)<sizeOf(rootB)){\r\n\t\t\tidNode[rootA] = rootB; // 1 array access\r\n\t\t}\r\n\t\telse{\r\n\t\t\tidNode[rootB] = rootA; // 1 array access\r\n\t\t}\r\n\t}","public org.apache.gora.cascading.test.storage.TestRow getUnionRecursive() {\n return unionRecursive;\n }","public void union(int p, int q) {\n\t\tint i = root(p);\n\t\tint j = root(q);\n//\t\tid[i] = j; instead of this do below improvement\n\t\tif (sz[i] < sz[j]) {\n\t\t\tid[i] = j;\n\t\t\tsz[j] += sz[i];\n\t\t} else {\n\t\t\tid[j] = i;\n\t\t\tsz[i] += sz[j];\n\t\t}\n\t}","public org.apache.gora.cascading.test.storage.TestRow getUnionRecursive() {\n return unionRecursive;\n }","public void union(int i, int j) {\n\n int root1 = find(i);\n int root2 = find(j);\n\n if (root2 == root1)\n return;\n\n if (_rank[root1] > _rank[root2]) {\n _parent[root2] = root1;\n } else if (_rank[root2] > _rank[root1]) {\n _parent[root1] = root2;\n } else {\n _parent[root2] = root1;\n _rank[root1]++;\n }\n }","@Test\n\tpublic void testUnion5() {\n\n\t\tint[] arr = {};\n\t\tSLLSet listObj2 = new SLLSet(arr);\n\t\tint[] uni2 = { 0, 2, 3 };\n\t\tSLLSet listObj7 = new SLLSet(uni2);\n\t\tSLLSet listObj8 = listObj2.union(listObj7);\n\n\t\tString expected = \"0, 2, 3\";\n\t\tint expectedSize = 3;\n\n\t\tassertEquals(expectedSize, listObj8.getSize());\n\t\tassertEquals(expected, listObj8.toString());\n\n\t}","public void setUnionForBody(NodeUnion<? extends ClassBodyNode> body) throws NullPointerException;","public void open(int row, int col) {\n if (isOpen(row, col)) return;\n grid[row - 1][col - 1] = true;\n ++openSites;\n\n // Transform the row and the column into an appropriate index\n // because the quick union class uses a one-dimensional array.\n final int currentSiteIndex = toIndex(row, col);\n\n // The topmost row must be connected to the virtual top.\n if (row == 1) {\n mainUnion.union(virtualTopId, currentSiteIndex);\n backwashAwareUnion.union(virtualTopId, currentSiteIndex);\n }\n // The bottommost row must be connected to virtual the bottom.\n if (row == size) mainUnion.union(virtualBottomId, currentSiteIndex);\n\n // Connect all neighbors of the current site if and only if the neighbors are open.\n if (row > 1 && isOpen(row - 1, col)) {\n final int topNeighborIndex = toIndex(row - 1, col);\n mainUnion.union(topNeighborIndex, currentSiteIndex);\n backwashAwareUnion.union(topNeighborIndex, currentSiteIndex);\n }\n\n if (row < size && isOpen(row + 1, col)) {\n final int bottomNeighborIndex = toIndex(row + 1, col);\n mainUnion.union(bottomNeighborIndex, currentSiteIndex);\n backwashAwareUnion.union(bottomNeighborIndex, currentSiteIndex);\n }\n\n if (col > 1 && isOpen(row, col - 1)) {\n final int leftNeighborIndex = toIndex(row, col - 1);\n mainUnion.union(leftNeighborIndex, currentSiteIndex);\n backwashAwareUnion.union(leftNeighborIndex, currentSiteIndex);\n }\n\n if (col < size && isOpen(row, col + 1)) {\n final int rightNeighborIndex = toIndex(row, col + 1);\n mainUnion.union(rightNeighborIndex, currentSiteIndex);\n backwashAwareUnion.union(rightNeighborIndex, currentSiteIndex);\n }\n }","public final void mT__79() throws RecognitionException {\n try {\n int _type = T__79;\n int _channel = DEFAULT_TOKEN_CHANNEL;\n // InternalMyDsl.g:77:7: ( 'union' )\n // InternalMyDsl.g:77:9: 'union'\n {\n match(\"union\"); \n\n\n }\n\n state.type = _type;\n state.channel = _channel;\n }\n finally {\n }\n }","BUnion createBUnion();","public void setUnionRecursive(org.apache.gora.cascading.test.storage.TestRow value) {\n this.unionRecursive = value;\n setDirty(3);\n }","public static void unionFind(int[][] doubleArray, int dimensions, UnionFind uf)\n {\n int count = 0;\n while (count != dimensions)\n {\n for (int column = 0; column < dimensions; column++) {\n if (uf.find(count, (dimensions*dimensions - 1 - column)) == true)\n {\n uf.printArray();\n StdOut.println();\n StdOut.println(\"Drip, drip.\");\n return;\n }\n }\n count++;\n }\n StdOut.println(\"No drip, drip.\");\n }","public static void union(String a, String b) {\r\n int root1 = find(a);\r\n int root2 = find(b);\r\n if (root1 == root2)return;\r\n if(size.get(root1) < size.get(root2)){size.set(root2, size.get(root2)+size.get(root1)); position.set(root1, root2);}\r\n else {size.set(root1, size.get(root1)+size.get(root2)); position.set(root2, root1);}\r\n }","@Test\r\n public void testCreateUnion_thisIsEmpty() {\r\n Tour tourA = new Tour();\r\n Tour tourB = new Tour(new int[][]{{12, 12}});\r\n Tour result = tourA.createUnion(tourB);\r\n Tour expected = new Tour(new int[][]{{12, 12}});\r\n assertTrue(result.toString(), expected.isEqual(result));\r\n }","public int union(int u, int v) {\n int p1 = find(u), p2 = find(v);\n if (p1 == p2) {\n return p1;\n }\n int s1 = _sizes[p1], s2 = _sizes[p2];\n if (s1 > s2) {\n _sizes[p1] += s2;\n// int i = 1;\n// while (s2 > 0) {\n// if (_parents[i] == p2) {\n// _parents[i] = p1;\n// s2 -= 1;\n// }\n// i += 1;\n// }\n _parents[p2] = p1;\n return s1;\n } else {\n _sizes[p2] += s1;\n// int j = 1;\n// while (s1 > 0) {\n// if (_parents[j] == p1) {\n// _parents[j] = p2;\n// s1 -= 1;\n// }\n// j += 1;\n// }\n _parents[p1] = p2;\n return s2;\n }\n }","void union(int a, int b) {\n int aParent = find(a); // find parent of a\n int bParent = find(b); // find parent of b\n\n // here we are everytime setting the parent of a_set as b_set in union\n // set the parent of all a as parent of b\n childToParentMap.put(aParent, bParent);\n }","public org.apache.gora.cascading.test.storage.TestRow.Builder setUnionRecursive(org.apache.gora.cascading.test.storage.TestRow value) {\n validate(fields()[3], value);\n this.unionRecursive = value;\n fieldSetFlags()[3] = true;\n return this; \n }","public static List canMerge(GameBoard gb) {\r\n\t\tList fullCol = new ArrayList();\r\n\t\tList fullRow = new ArrayList();\r\n\t\tList direction = new ArrayList();\r\n\t\tfor (int i = 1; i < 5; i++) {\r\n\t\t\tfullCol.add(gb.getColumn(i));\r\n\t\t\tfullRow.add(gb.getRow(i));\r\n\t\t} //return list of directions that can merge\r\n\t\t//check up\r\n\t\tList temp = new ArrayList();\r\n\t\tfor (int i = 1; i < 5; i++) {\r\n\t\t\ttemp.add(merge(gb.getColumn(i)));\r\n\t\t}\r\n\t\tif (!temp.equals(fullCol)) {direction.add(new Integer(1));}\r\n\t\t//check down\r\n\t\ttemp = new ArrayList();\r\n\t\tfor (int i = 1; i < 5; i++) {\r\n\t\t\t//first reverse column you receive \r\n\t\t\tList temp1 = new ArrayList();\r\n\t\t\tList temp2 = new ArrayList();\r\n\t\t\tfor (int j = 0; j < 4; j++) {temp1.add(gb.getColumn(i).get(3-j));}\r\n\t\t\ttemp1 = merge(temp1);\r\n\t\t\t//undo reverse\r\n\t\t\tfor (int k = 0; k < 4; k++) {temp2.add(temp1.get(3-k));}\r\n\t\t\ttemp.add(temp2);\r\n\t\t}\r\n\t\tif (!temp.equals(fullCol)) {direction.add(new Integer(2));}\r\n\t\t//check left\r\n\t\ttemp = new ArrayList();\r\n\t\tfor (int i = 1; i < 5; i++) {\r\n\t\t\ttemp.add(merge(gb.getRow(i)));\r\n\t\t}\r\n\t\tif (!temp.equals(fullRow)) {direction.add(new Integer(3));}\r\n\t\t//check right\r\n\t\ttemp = new ArrayList();\r\n\t\tfor (int i = 1; i < 5; i++) {\r\n\t\t\t//first reverse row you receive \r\n\t\t\tList temp1 = new ArrayList();\r\n\t\t\tList temp2 = new ArrayList();\r\n\t\t\tfor (int j = 0; j < 4; j++) {temp1.add(gb.getRow(i).get(3-j));}\r\n\t\t\ttemp1 = merge(temp1);\r\n\t\t\t//undo reverse\r\n\t\t\tfor (int k = 0; k < 4; k++) {temp2.add(temp1.get(3-k));}\r\n\t\t\ttemp.add(temp2);\r\n\t\t}\r\n\t\tif (!temp.equals(fullRow)) {direction.add(new Integer(4));}\r\n\t\treturn direction;\r\n\t}","void union(int p, int q) {}","public static ArrayList<ArrayList<String>> unionD(String table1Name, String table2Name){\n\t\tArrayList<ArrayList<String>> union = new ArrayList<ArrayList<String>>();\r\n\t\t//these will hold the data from the input tables\r\n\t\tArrayList<ArrayList<String>> columns1 = new ArrayList<ArrayList<String>>();\r\n\t\tArrayList<ArrayList<String>> columns2 = new ArrayList<ArrayList<String>>();\r\n\t\t//find the input tables in the database list\r\n\t\tfor (int i = 0; i < tables.size(); i++) {\r\n\t\t\tif (tables.get(i).getName().equals(table1Name)) {\r\n\t\t\t\tcolumns1 = new ArrayList<ArrayList<String>>(tables.get(i).datas);\r\n\t\t\t}\r\n\t\t\tif (tables.get(i).getName().equals(table2Name)) {\r\n\t\t\t\tcolumns2 = new ArrayList<ArrayList<String>>(tables.get(i).datas);\r\n\t\t\t}\r\n\t\t}\r\n\t\t//check if the tables are union compatable\r\n\t\tif (columns1.size() != columns2.size()) {\r\n\t\t\tSystem.out.println(\"Unable to perform union - unnequal number of columns.\");\r\n\t\t}\r\n\t\telse {\t//only continue if they are union compatable\r\n\t\t\t//true if all columns have the same type\r\n\t\t\tint sameTypes = 1;\r\n\t\t\tint type1 = 0;\r\n\t\t\tint type2 = 0;\r\n\t\t\t//a max char value of -1 indicates the type is integer\r\n\t\t\tfor (int j = 0; j < columns1.size(); j++) {\r\n\t\t\t\ttype1 = Integer.valueOf(new String(columns1.get(j).get(1)));\r\n\t\t\t\ttype2 = Integer.valueOf(columns2.get(j).get(1));\r\n\t\t\t\tif (type1 > 0) { type1 = 1; }\r\n\t\t\t\telse if (type1 < 0) { type1 = -1; }\r\n\t\t\t\tif (type2 > 0) { type2 = 1; }\r\n\t\t\t\telse if (type2 < 0) { type2 = -1; }\r\n\t\t\t\t//if the types were not equal, don't continue\r\n\t\t\t\tif (type1 != type2) {\r\n\t\t\t\t\tSystem.out.println(\"Unable to perform union - incompatible types.\");\r\n\t\t\t\t}\r\n\t\t\t\telse {\t//continue if the types are equal\r\n\t\t\t\t\t\t//create new columns holding the name from the first table and the greatest char max\r\n\t\t\t\t\tArrayList<String> newColumn = new ArrayList<String>();\r\n\t\t\t\t\tint largestChar = 0;\r\n\t\t\t\t\tif (type1 != -1) {\t//if they aren't integers\r\n\t\t\t\t\t\t//find the largest max char value\r\n\t\t\t\t\t\tif (Integer.parseInt(columns1.get(j).get(1)) >= Integer.parseInt(columns2.get(j).get(1))) {\r\n\t\t\t\t\t\t\tlargestChar = Integer.parseInt(new String(columns1.get(j).get(1)));\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\telse { \r\n\t\t\t\t\t\t\tlargestChar = Integer.parseInt(columns2.get(j).get(1)); \r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t\t//keep the type as integer\r\n\t\t\t\t\telse { \r\n\t\t\t\t\t\tlargestChar = -1; \r\n\t\t\t\t\t}\r\n\t\t\t\t\t\t//use the name from the first table and largest char max\r\n\t\t\t\t\tnewColumn.add(new String(columns1.get(j).get(0)));\r\n\t\t\t\t\tnewColumn.add(String.valueOf(largestChar));\r\n\t\t\t\t\tunion.add(newColumn);\r\n\t\t\t\t\t//check if there are equal rows to avoid duplicates\r\n\t\t\t\t\tint colCount = 0;\r\n\t\t\t\t\tfor (int n = 2; n < columns1.get(colCount).size(); n++) {\t//for each row in table1\r\n\t\t\t\t\t\tunion.get(j).add(new String(columns1.get(j).get(n)));\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\t\t\r\n\t\t\tfor(int t = 2; t<columns2.get(0).size(); t++){\t//column2 row\r\n\t\t\t\tboolean completeUniqe = true;\r\n\t\t\t\tfor(int p = 2; p < union.get(0).size(); p++){// rows of union\r\n\t\t\t\t\tint sameCount = 0;\r\n\t\t\t\t\tfor(int u = 0; u<union.size(); u++){//columns of union\r\n\t\t\t\t\t\tif(columns2.get(u).get(t).equals(union.get(u).get(p))){\r\n\t\t\t\t\t\t\tsameCount++;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t\tSystem.out.println(sameCount);\r\n\t\t\t\t\tif(sameCount == union.size()){\r\n\t\t\t\t\t\tcompleteUniqe = false;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\tif(completeUniqe){\r\n\t\t\t\t\tfor(int u = 0; u<union.size(); u++){//columns of union\r\n\t\t\t\t\t\tunion.get(u).add(new String(columns2.get(u).get(t)));\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn union;\r\n\t}","public void union(Vertex v1, Vertex v2) {\n\n // find the two vertices' path root\n Vertex r1 = find(v1);\n Vertex r2 = find(v2);\n\n // if the two roots are equal, just return\n if(r1.equals(r2)){\n return;\n } else if(r1.getSize()>r2.getSize()){\n // if the r1 path size is greater than r2\n // just change the vertex 2's root to vertex 1\n r2.setRoot(r1);\n // increment the size of r1 set\n r1.setSize(r2.getSize());\n } else {\n r1.setRoot(r2);\n r2.setSize(r1.getSize());\n }\n \n }","public NodeUnion<? extends ClassBodyNode> getUnionForBody();","int[] union(int s1,int t1,int s2,int t2)\r\n\t{\r\n\t\tint [] st=new int[2];\r\n\t\t//Please fill in the program here\r\n\t\tst[0] = incCapacity();\r\n\t\taddEdge(st[0], epssymbol, s1);\r\n\t\taddEdge(st[0], epssymbol, s2);\r\n\t\tst[1] = incCapacity();\r\n\t\taddEdge(t1, epssymbol, st[1]);\r\n\t\taddEdge(t2, epssymbol, st[1]);\r\n\r\n\t\treturn st;\r\n\t}","public T union( T obj1, T obj2 )\n {\n // Find the root of each object; if either is not contained, the root\n // value will be null, and we throw an exception.\n Node root1 = getRoot(nodes.get(obj1));\n Node root2 = getRoot(nodes.get(obj2));\n if ( root1 == null && root2 == null )\n throw new NoSuchElementException( \"Sets do not contain either object: \" + obj1 + \", \" + obj2 );\n if ( root1 == null )\n throw new NoSuchElementException( \"Sets do not contain object: \" + obj1 );\n if ( root2 == null )\n throw new NoSuchElementException( \"Sets do not contain object: \" + obj2 );\n // If already were in same set, just return data from the root of that\n // set.\n if ( root1 == root2 )\n return root1.data;\n // If not already, then doing union reduces overall number of sets.\n numSets-- ;\n // We use root2 as the new parent if either (a) the trees containing\n // both inputs have same rank and a \"coin toss\" settles on this case,\n // or (b) the tree containing obj1 has lower rank.\n if ( ( root1.rank == root2.rank && Math.random() < 0.5 ) || root1.rank < root2.rank )\n {\n // When we link root1 to root2, size of set under root2 inreases.\n root1.parent = root2;\n root2.size += root1.size;\n \n // When we union two sets of same rank, new root gets higher rank.\n if ( root1.rank == root2.rank )\n root2.rank++ ;\n \n return root2.data;\n }\n else\n // We use root1 as the new parent if either (a) the trees containing\n // both inputs have same rank and a \"coin toss\" settles on this\n // case, or (b) the tree containing obj2 has lower rank.\n {\n // When we link root1 to root2, size of set under root2 inreases.\n root2.parent = root1;\n root1.size += root2.size;\n \n // When we union two sets of same rank, new root gets higher rank.\n if ( root1.rank == root2.rank )\n root1.rank++ ;\n \n return root1.data;\n }\n }","void union(int [] parent, int x, int y)\n\t\t{\n\t\t\tint x_set_parent = find(parent, x);\n\t\t\tint y_set_parent = find(parent, y);\n\t\t\tparent[y_set_parent] = x_set_parent;\n\t\t}","public void union(Shape s);","private void union_Cells(int c1, int c2) {\r\n\t\twhile (cells[c1] >= 0)\r\n\t\t\tc1 = cells[c1];\r\n\t\twhile (cells[c2] >= 0)\r\n\t\t\tc2 = cells[c2];\r\n\r\n\t\t// the depth of the tree with c2 is deepper than Tc1, Tc1 attach to Tc2\r\n\t\tif (cells[c1] > cells[c2]) {\r\n\t\t\tcells[c1] = c2;\r\n\t\t} else {\r\n\t\t\tif (cells[c1] == cells[c2])\r\n\t\t\t\tcells[c1]--;\r\n\t\t\tcells[c2] = c1;\r\n\t\t}\r\n\t}","public static void main( String [ ] args )\r\n {\r\n \r\n \t\r\n \t\r\n \tint maze_row=0;\r\n \tint maze_column=0;\r\n \t\r\n\t\t\r\n\t\tScanner type = new Scanner(System.in);\r\n\t\t\r\n\t\t\r\n\t\tdo\r\n\t\t\t{\r\n\t\t\ttry \r\n\t\t\t\r\n\t\t\t{\r\n\t\t\t\tSystem.out.print(\"Please enter number of row between 1 and 20: \");\r\n\t\t\t\tmaze_row = Integer.valueOf(type.next());\r\n\t\t\t}\r\n\t\t\tcatch (NumberFormatException e)\r\n\t\t\t{\r\n\t\t\t\t//System.out.println(\"Input didn't match with the requirement: Try Again\");\r\n\t\t\t\tmaze_row=21;\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t\t}\r\n\t\twhile(maze_row>20 || maze_row<1);\r\n\t\tdo\r\n\t\t{\r\n\t\ttry \r\n\t\t\r\n\t\t{\r\n\t\t\tSystem.out.print(\"Please enter number of column between 1 and 20: \");\r\n\t\t\tmaze_column = Integer.valueOf(type.next());\r\n\t\t}\r\n\t\tcatch (NumberFormatException e)\r\n\t\t{\r\n\t\t\t//System.out.println(\"Input didn't match with the requirement: Try Again\");\r\n\t\t\tmaze_column=21;\r\n\t\t\t\t\r\n\t\t}\r\n\t\t}\r\n\twhile(maze_column>20 ||maze_column<1);\r\n\t\t\r\n\t\ttype.close();\r\n\t\tSystem.out.println();\r\n \tcreateMaze(maze_row,maze_column);\r\n \tshowMaze();\r\n \t\r\n \t\r\n \t\r\n \t\r\n \t\r\n \t\r\n \t\r\n \t\r\n \t/* int NumElements = 128;\r\n int NumInSameSet = 16;\r\n\r\n DisjSets ds = new DisjSets( NumElements );\r\n int set1, set2;\r\n\r\n for( int k = 1; k < NumInSameSet; k *= 2 )\r\n {\r\n for( int j = 0; j + k < NumElements; j += 2 * k )\r\n {\r\n set1 = ds.find( j );\r\n set2 = ds.find( j + k );\r\n ds.union( set1, set2 );\r\n }\r\n }\r\n\r\n for( int i = 0; i < NumElements; i++ )\r\n {\r\n System.out.print( ds.find( i )+ \"*\" );\r\n if( i % NumInSameSet == NumInSameSet - 1 )\r\n System.out.println( );\r\n }\r\n System.out.println( );*/\r\n }","void Union(subset [] subsets, int x , int y ){ \n\t\tint xroot = find(subsets, x); \n\t int yroot = find(subsets, y); \n\t \n\t\tif (subsets[xroot].rank < subsets[yroot].rank) \n\t\t\tsubsets[xroot].parent = yroot; \n\t\telse if (subsets[yroot].rank < subsets[xroot].rank) \n\t\t\tsubsets[yroot].parent = xroot; \n\t\telse{ \n\t\t\tsubsets[xroot].parent = yroot; \n\t\t\tsubsets[yroot].rank++; \n\t\t} \n\t}","List<ProtocolPo> queryByUnion(ProtocolPo query);","private void addUpBlock(Position p, TETile te,\n int len, int leftWid, int rightWid) {\n int x = p.x;\n int y = p.y;\n for (int j = y; j < y + len; j += 1) {\n for (int i = x - leftWid; i < x + rightWid + 1; i += 1) {\n world[i][j] = te;\n }\n }\n }","public Iteratable<IRNode> bottomUp(IRNode subtree);","public static void union(int u, int v) {\n\t\tu = root(u); // optimizations\n\t\tv = root(v); // to make find faster\n\t\tif (u == v) return; // already in same component\n\t\t\n\t\tif (size[u] >= size[v]) {\n\t\t\tp[v] = u;\n\t\t\tsize[u] += size[v];\n\t\t} else {\n\t\t\tp[u] = v;\n\t\t\tsize[v] += size[u];\n\t\t}\n\t}","void Union(int parent[], int x, int y){ \n int xset = find(parent, x); \n int yset = find(parent, y); \n parent[xset] = yset; \n }","static void builtVertical(Room one, Room two, WorldFrame world) {\n Random ran = world.rand();\n int len;\n int y;\n int smallestRWallX = Math.min(one.rEdge(), two.rEdge());\n int largestX = Math.max(one.getX(), two.getX());\n if (one.tWall() < two.getY()) {\n len = two.getY() - one.tWall();\n y = one.tWall();\n } else if (two.tWall() < one.getY()) { // two.TWall() < one.getY()\n len = one.getY() - two.tWall();\n y = two.tWall();\n } else {\n return;\n\n }\n int x = RandomUtils.uniform(ran, largestX, smallestRWallX + 1);\n\n\n if (len > 0) {\n world.hallwaysSet().add(new Hallway(x, y, Direction.UP, len, world));\n }\n }","public Bag union(Bag u) {\n return u;\n }","private void BuildUp(int towerToBuild, int towerTarget, int bottomSize) {\n\t\t\n\t\tint notTowerTarget = getOtherTower(towerToBuild,towerTarget);\n\n\t\twhile( towerSet.TopBlock(towerToBuild) > 1 ) {\n\t\t\tif(towerSet.TopBlock(towerTarget) == towerSet.TopBlock(towerToBuild) - 1) {\n\t\t\t\ttowerSet.MoveBlock(towerTarget,towerToBuild);\n\t\t\t\tturnNumber++;\n\t\t\t\tSystem.out.println(this.toString());\n\t\t\t}\n\t\t\telse if(towerSet.TopBlock(notTowerTarget) == towerSet.TopBlock(towerToBuild) - 1) {\n\t\t\t\ttowerSet.MoveBlock(notTowerTarget,towerToBuild);\n\t\t\t\tturnNumber++;\n\t\t\t\tSystem.out.println(this.toString());\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif(towerSet.TopBlock(towerTarget) == 1 ) {\n\t\t\t\t\tthis.BreakDown(towerTarget, towerToBuild, towerSet.TopBlock(towerToBuild) - 1);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tthis.BreakDown(notTowerTarget, towerToBuild, towerSet.TopBlock(towerToBuild) - 1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}","public void union(int p, int q) {\n int i = root(p);\n int j = root(q);\n \n if( i == j) {\n return;\n }\n \n id[i] = j;\n count--;\n }","private void parseTerrain(Region region, ByteBuffer mapBuffer, int x, int y, Set<Integer> downHeights) {\n\t\tint[][][] attributes = new int[4][64][64];\n\n\t\tfor (int height = 0; height < 4; height++) {\n\t\t\tfor (int localX = 0; localX < 64; localX++) {\n\t\t\t\tfor (int localY = 0; localY < 64; localY++) {\n\t\t\t\t\twhile (true) {\n\t\t\t\t\t\tint attributeId = mapBuffer.get() & 0xFF;\n\t\t\t\t\t\tif (attributeId == 0) {\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (attributeId == 1) {\n\t\t\t\t\t\t\tmapBuffer.get();\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (attributeId <= 49) {\n\t\t\t\t\t\t\tmapBuffer.get();\n\t\t\t\t\t\t} else if (attributeId <= 81) {\n\t\t\t\t\t\t\tattributes[height][localX][localY] = attributeId - 49;\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\n\t\tfor (int height = 0; height < 4; height++) {\n\t\t\tfor (int localX = 0; localX < 64; localX++) {\n\t\t\t\tfor (int localY = 0; localY < 64; localY++) {\n\n\t\t\t\t\tif ((attributes[height][localX][localY] & 2) == 2) {\n\t\t\t\t\t\tdownHeights.add(Position.hash(localX, localY, height));\n\t\t\t\t\t}\n\n\t\t\t\t\tif ((attributes[height][localX][localY] & 1) == 1) {\n\t\t\t\t\t\tint plane = height;\n\n\t\t\t\t\t\tif ((attributes[1][localX][localY] & 2) == 2) {\n\t\t\t\t\t\t\tdownHeights.add(Position.hash(localX, localY, 1));\n\t\t\t\t\t\t\tplane--;\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tif (plane >= 0) {\n\t\t\t\t\t\t\tTraversalMap.block(region, plane, localX, localY);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}","public static int[] bottomUpMergeSort(int[] num) {\n\n\t\tint[] temp = new int[num.length];\n\n\t\t// repeat merging process while width is smaller than length\n\t\tfor (int width = 2; width <= num.length; width *= 2) {\n\n\t\t\t// System.out.println(\"width = \" + width );\n\n\t\t\t// merge sublists\n\t\t\tfor (int i = 0; i < num.length; i += width)\n\t\t\t\tmergeLists(num, i, width, temp);\n\n\t\t\t// copy temp array back to original array\n\t\t\tfor (int i = 0; i < num.length; i++) {\n\t\t\t\tnum[i] = temp[i];\n\t\t\t\t// System.out.print(num[i] + \" \");\n\t\t\t}\n\n\t\t\t// System.out.println();\n\t\t\t// System.out.println();\n\t\t}\n\n\t\treturn num;\n\n\t}","@Test\r\n public void testCreateUnion_OneAndOne() {\r\n Tour tourA = new Tour(new int[][]{{1, 1}});\r\n Tour tourB = new Tour(new int[][]{{12, 12}});\r\n Tour result = tourA.createUnion(tourB);\r\n Tour expected = new Tour(new int[][]{{1, 1}, {12, 12}});\r\n assertTrue(result.toString(), expected.isEqual(result));\r\n }","void union(int level, Taint<E> tag) {\n if (containsKey(level)) {\n get(level).setUnion(tag);\n } else {\n set(level, new Node<>(tag, null));\n }\n }","public void open(int i, int j){\n\t\tif(i<=0 || i>this.gridLength || j<=0 || j>this.gridLength){\n\t\t\tthrow new IndexOutOfBoundsException();\n\t\t}\n\t\tint N = this.gridLength;\n\t\t\n\t\t/*opens argument site is previously unopened and also connects to neighboring open sites\n\t\twhile also updating its connectedness to the bottom row indices*/\n\t\tif(this.idGrid[(i-1)*N + j] == false){\n\t\t\tthis.idGrid[(i-1)*N + j] = true;\n\t\t\tboolean connectBottom = this.bottom[(i-1)*N + j];\n\t\t\tif(i-1>0){\n\t\t\t\tif(idGrid[(i-2)*N + j] == true){\n\t\t\t\t\tif(this.bottom[this.unionTest.find((i - 2)*N + j)] == true){\n\t\t\t\t\t\tconnectBottom = true;\n\t\t\t\t\t}\n\t\t\t\t\tunionTest.union((i-1)*N + j, (i-2)*N + j);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(i+1<=this.gridLength){\n\t\t\t\tif(idGrid[(i)*N + j] == true){\n\t\t\t\t\tif(this.bottom[this.unionTest.find((i)*N + j)] == true){\n\t\t\t\t\t\tconnectBottom = true;\n\t\t\t\t\t}\n\t\t\t\t\tunionTest.union((i-1)*N + j, (i)*N + j);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(j-1>0){\n\t\t\t\tif(idGrid[(i-1)*N + j - 1] == true){\n\t\t\t\t\tif(this.bottom[(this.unionTest.find((i-1)*N + j - 1))] == true){\n\t\t\t\t\t\tconnectBottom = true;\n\t\t\t\t\t}\n\t\t\t\t\tunionTest.union((i-1)*N + j, (i-1)*N + j-1);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(j+1<=this.gridLength){\n\t\t\t\tif(idGrid[(i-1)*N + j + 1] == true){\n\t\t\t\t\tif(this.bottom[this.unionTest.find((i-1)*N + j + 1)] == true){\n\t\t\t\t\t\tconnectBottom = true;\n\t\t\t\t\t}\n\t\t\t\t\tunionTest.union((i-1)*N + j, (i-1)*N + j+1);\n\t\t\t\t}\n\t\t\t}\n\t\t\t//update root status\n\t\t\tif(this.bottom[this.unionTest.find((i-1)*N + j)] != true){\n\t\t\t\tthis.bottom[this.unionTest.find((i-1)*N + j)] = connectBottom;\n\t\t\t}\n\t\t}\n\t}","@Test\n public void testMatchLimitOneTopDown() throws Exception {\n\n HepProgramBuilder programBuilder = HepProgram.builder();\n programBuilder.addMatchOrder( HepMatchOrder.TOP_DOWN );\n programBuilder.addMatchLimit( 1 );\n programBuilder.addRuleInstance( UnionToDistinctRule.INSTANCE );\n\n checkPlanning( programBuilder.build(), UNION_TREE );\n }","public void open(int row, int col){\n\t\tif (row <= 0 || col <= 0 || row > storeVar || col > storeVar) \n\t\t\tthrow new IllegalArgumentException(\"row index i out of bounds\");\n\n\t\t// System.out.println(\"\\n We're opening again! \");\n\t\tint currIndex = ((row-1)*storeVar) + col;\n\n\t\tif (isOpen(row, col)) return;\n\t\topenSites++;\n\t\tgrid[currIndex] = true;\n\n\n\t\tif (currIndex < storeVar+1 ){\n\t\t\tunionFind.union(currIndex, virtualTop);\n\t\t\tbackwash.union(currIndex, virtualTop);\n\t\t\tfullgrid[currIndex] = true;\n\t\t}\n\t\tif ((currIndex < grid.length - 1) && (currIndex >= (grid.length - 1 - storeVar))){\n\t\t\t// System.out.println(\"Confirmed that bottom is connected\");\n\t\t\tunionFind.union(currIndex, virtualBottom);\n\t\t}\n\n\t\t\n\t\tif(row + 1 <= storeVar && isOpen(row + 1, col)){\n\t\t\tif (!unionFind.connected(currIndex, currIndex+storeVar)) {\n\t\t\t\tunionFind.union(currIndex, currIndex+storeVar);\n\t\t\t\tbackwash.union(currIndex, currIndex+storeVar);\n\t\t\t}\n\t\t}\n\t\tif(col + 1 <= storeVar && isOpen(row , col+1)){\n\t\t\tif (!unionFind.connected(currIndex, currIndex+1)) {\n\t\t\t\tunionFind.union(currIndex, currIndex+1);\n\t\t\t\tbackwash.union(currIndex, currIndex+1);\n\t\t\t}\n\t\t}\n\t\tif(row - 1 > 0 && isOpen(row - 1, col)){\n\t\t\tif (!unionFind.connected(currIndex, currIndex-storeVar)){ \n\t\t\t\tunionFind.union(currIndex, currIndex-storeVar);\n\t\t\t\tbackwash.union(currIndex, currIndex-storeVar);\n\t\t\t}\n\t\t}\n\t\tif(col - 1 > 0 && isOpen(row , col-1)){\n\t\t\tif (!unionFind.connected(currIndex, currIndex-1)){\n\t\t\t unionFind.union(currIndex, currIndex-1);\n\t\t\t backwash.union(currIndex, currIndex-1);\n\t\t\t}\n\t\t}\n\t}","public void moveToHeight(double height) {\n\t\t//Sin(theta) = height/length\n\t\t//angleSetpoint = Math.toDegrees(Math.asin(height/Constants.BreachArm.ARM_LENGTH));\n\t}","@Override\n public void generateMaze() {\n //Opens up the entrance to the maze\n MazeCell current=maze[0][0];\n current.openWall(Directions.North.getBValue());\n\n //A list of sets. The sets contain the cells which can be accessed from one another.\n List<List<MazeCell>> sets=new LinkedList<>();\n //All the walls in the maze\n List<InnerWall> wallList=new LinkedList<>();\n //Initially create a set for each cell\n //Also add the walls to the list\n for(int row=0;row< maze.length;row++){\n for(int column=0;column<maze[0].length;column++){\n sets.add(Arrays.asList(maze[row][column]));\n List<MazeCell> valid=returnValidNeighbours(maze[row][column].getX(), maze[row][column].getY());\n for(int i=0;i<valid.size();i++){\n wallList.add(new InnerWall(maze[row][column], valid.get(i)));\n }\n }\n }\n //Now we have as many wall sets as maze cells, each containing four walls.\n\n Random rnd=new Random();\n int idx;\n //Loops until only one set remains, meaning all cells can be reached from any cell\n while(sets.size()!=1){\n //Select a random wall\n idx=wallList.size()>1 ? rnd.nextInt(wallList.size()) : 0;\n InnerWall w= wallList.get(idx);\n //The two neighbouring cells\n MazeCell c1=w.parent;\n MazeCell c2=w.connected;\n\n //Their relative directions\n Directions d=Directions.getOffsetDirection(c1.getX(),c1.getY(),c2.getX(),c2.getY());\n\n //Check if the two cells are already connected\n if((c1.getOpenWalls() % d.getBValue())==d.getBValue())\n continue;\n\n //Two new sets\n List<MazeCell> set1=null;\n List<MazeCell> set2=null;\n //We get the sets\n boolean b1,b2;\n b1=b2=false;\n //We loop through the set of sets looking for the two which contains the two cells\n for(List<MazeCell> list : sets) {\n if(list.contains(c1)){\n set1=list;\n b1=true;\n }\n if(list.contains(c2)) {\n set2=list;\n b2=true;\n }\n if(b1 && b2)\n break;\n }\n //If the two sets are disjoint then we join them together\n if(set1!=null && set2!=null && !set1.equals(set2)){\n\n //We connect the two cells\n c1.openWall(d.getBValue());\n c2.openOppositeWall(d.getBValue());\n\n if(sleepDrawTime>0) {\n try {\n Thread.sleep(sleepDrawTime);\n mf.repaint();\n } catch (InterruptedException e) {\n e.printStackTrace();\n }\n }\n\n //Join the two sets\n List<MazeCell> temp= Stream.concat(set1.stream(), set2.stream())\n .collect(Collectors.toList());\n sets.remove(set2);\n sets.remove(set1);\n sets.add(temp);\n }\n //We remove the wall from the list\n wallList.remove(w);\n //As the walls are double-sided, two cells share a wall, we have to find the opposite cell's wall in the list\n InnerWall oppositeWall=wallList.stream().filter((x)->x.parent==w.connected).findFirst().orElse(null);\n wallList.remove(oppositeWall);\n\n\n }\n //We open an exit in the last row.\n maze[maze.length-1][rnd.nextInt(maze[0].length)].openWall(Directions.South.getBValue());\n\n }","@Test void testInterpretUnion() {\n rootSchema.add(\"simple\", new ScannableTableTest.SimpleTable());\n final String sql = \"select * from \\\"simple\\\"\\n\"\n + \"union\\n\"\n + \"select * from \\\"simple\\\"\";\n sql(sql).returnsRowsUnordered(\"[0]\", \"[10]\", \"[20]\", \"[30]\");\n }","@Override\r\n public void generateMaze(int width, int height) {\r\n s=null;\r\n threadPool.execute(() -> {\r\n try {\r\n Client client = new Client(InetAddress.getLocalHost(), 5400, new IClientStrategy() {\r\n public void clientStrategy(InputStream inFromServer, OutputStream outToServer) {\r\n try {\r\n ObjectOutputStream toServer = new ObjectOutputStream(outToServer);\r\n ObjectInputStream fromServer = new ObjectInputStream(inFromServer);\r\n toServer.flush();\r\n int[] mazeDimensions = new int[]{width, height};\r\n toServer.writeObject(mazeDimensions);\r\n toServer.flush();\r\n byte[] compressedMaze = (byte[]) fromServer.readObject();\r\n InputStream is = new MyDecompressorInputStream(new ByteArrayInputStream(compressedMaze));\r\n byte[] decompressedMaze = new byte[100000];\r\n is.read(decompressedMaze);\r\n Maze mymaze = new Maze(decompressedMaze);\r\n maze = mymaze;\r\n PlayerPositionRow = maze.getStartPosition().getRowIndex();\r\n PlayerPositionCol = maze.getStartPosition().getColIndex();\r\n goalPositionRow=maze.getGoalPosition().getRowIndex();\r\n goalPositionColumn=maze.getGoalPosition().getColIndex();\r\n } catch (Exception e) {\r\n e.printStackTrace();\r\n }\r\n }\r\n });\r\n client.communicateWithServer();\r\n try {\r\n Thread.sleep(5000);\r\n } catch (InterruptedException e) {\r\n e.printStackTrace();\r\n }\r\n setChanged();\r\n notifyObservers(\"maze\");\r\n } catch (UnknownHostException e) {\r\n e.printStackTrace();\r\n }\r\n });\r\n }","public final void mT__63() throws RecognitionException {\n try {\n int _type = T__63;\n int _channel = DEFAULT_TOKEN_CHANNEL;\n // ../org.xtext.example.webgme_mtl/src-gen/org/xtext/example/webgme/parser/antlr/internal/InternalMTL.g:61:7: ( 'union' )\n // ../org.xtext.example.webgme_mtl/src-gen/org/xtext/example/webgme/parser/antlr/internal/InternalMTL.g:61:9: 'union'\n {\n match(\"union\"); \n\n\n }\n\n state.type = _type;\n state.channel = _channel;\n }\n finally {\n }\n }","@Test\r\n\t\tpublic void testUnion() {\n\t\t\ttestingSet = new IntegerSet(list1);\r\n\t\t\ttestingSet2= new IntegerSet(list2);\r\n\t\t\t// 3rd set =to the union of the two lists \r\n\t\t\ttestingSet3= new IntegerSet(union);\r\n\t\t\t// 4th set equal to the union of sets 1 and 2 \r\n\t\t\ttestingSet4= testingSet.union(testingSet, testingSet2);\r\n\t\t\t// sets 3 and 4 should be equal\r\n\t\t\t// assertEquals method is deprecated \r\n\t\t\tassertArrayEquals(testingSet3.toArray(),testingSet4.toArray());\r\n\t\t\t \r\n\t\t}","public void union(int p, int q) {\n int pRoot = getRoot(p);\n int qRoot = getRoot(q);\n nodes[pRoot] = qRoot;\n }","public BSTSet union(BSTSet s) {\n int[] thisArray = BSTToArray();\n int[] sArray = s.BSTToArray();\n int[] unionArray = new int[thisArray.length + sArray.length];\n int unionArrayIndex = 0;\n\n // add both arrays together\n for (int i = 0; i < thisArray.length; i++) {\n unionArray[unionArrayIndex++] = thisArray[i];\n }\n\n for (int i = 0; i < sArray.length; i++) {\n unionArray[unionArrayIndex++] = sArray[i];\n }\n\n return new BSTSet(unionArray);\n }","@Test\r\n public void testHeightAddNodesRight(){\r\n \ttree.add(\"g\");\r\n \ttree.add(\"f\");\r\n \ttree.add(\"e\");\r\n \tassertEquals(tree.height(),2);\r\n \t\r\n \t//testing height of 3\r\n \ttree.add(\"d\"); //height now 3, d is right\r\n \tassertEquals(tree.height(), 3);\r\n \t\r\n \ttree.add(\"c\");\r\n \ttree.add(\"b\"); \r\n \ttree.add(\"a\"); \r\n \tassertEquals(tree.height(),6); //last\r\n }","private void moveUp()\n {\n // runs through column first, row second\n for ( int column = 0; column < grid[0].length; column++) {\n\n // check is set to false, meaning no combinations have been made\n boolean check = false;\n for ( int row = 1; row < grid.length; row++) {\n int compare = row;\n if ( grid[compare][column] != 0 ) { \n\n // loop continues while there are still zero values above the current\n // tile\n while ( grid[compare-1][column] == 0 ) {\n\n // switches places of the current tile with the zero tile\n grid[compare-1][column] = grid[compare][column];\n grid[compare][column] = 0;\n compare --;\n\n // if you reach the top of the board, break from the loop\n if ( compare == 0 ){\n break;\n }\n }\n // if a combination was made on the previous loop, set check to false\n if ( check == true ){\n check = false;\n }\n // if a combination wasn't made on the previous loop and two tiles\n // next to each other have the same value, combine them\n else if ( compare!=0 && \n grid[compare-1][column] == grid[compare][column] ) {\n grid[compare-1][column] = 2*grid[compare-1][column];\n grid[compare][column] = 0;\n\n // sets check to true to indicate a combination was made\n check = true;\n\n // increases your score by the value of the combined tile\n score+= grid[compare-1][column];\n } \n }\n }\n } \n }","public void union(int p, int q) {\n\t\tint rootP = find(p);\n\t\tint rootQ = find(q);\n\t\tif (rootQ == rootP)\n\t\t\treturn;\n\t\tid[rootQ] = rootP;\n\t\tcount--;\n\t}","public void uncover ()\n {\n for (DancingNode i=this.U; i!=this; i=i.U) // go up the column\n {\n for (DancingNode j=i.L; j!=i; j=j.L) // go left across the row \n {\n j.C.size++;\n j.relinkUD();\n }\n }\n this.relinkLR();\n }","public NodeUnion<? extends IdentifierListNode> getUnionForTargets();","public PipeUnion<T> getUnion();","public static void main(String[] args) throws IOException{\n Scanner f = new Scanner(System.in);\n //BufferedReader f = new BufferedReader(new FileReader(\"uva.in\"));\n //BufferedReader f = new BufferedReader(new InputStreamReader(System.in));\n PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n while(true) {\n int C = f.nextInt();\n int R = f.nextInt();\n if(C == 0 && R == 0) {\n break;\n }\n HashMap<String,Integer> getIndex = new HashMap<>();\n for(int i = 0; i < C; i++) {\n getIndex.put(f.next(),i);\n }\n int[] leaderIds = new int[C];\n int[] groupSizes = new int[C];\n for(int i = 0; i < C; i++) {\n leaderIds[i] = i;\n groupSizes[i] = 1;\n }\n for(int i = 0; i < R; i++) {\n int p = getIndex.get(f.next());\n int q = getIndex.get(f.next());\n if(root(leaderIds,p) != root(leaderIds,q)) {\n union(leaderIds,groupSizes,p,q);\n }\n }\n int max = 0;\n for(int i = 0; i < C; i++) {\n int p = root(leaderIds,i);\n max = Math.max(max,groupSizes[p]);\n }\n out.println(max);\n }\n f.close();\n out.close();\n }","static\nint\nprintUnion(\nint\narr1[], \nint\narr2[], \nint\nm, \nint\nn) \n\n{ \n\nint\ni = \n0\n, j = \n0\n; \n\nwhile\n(i < m && j < n) \n\n{ \n\nif\n(arr1[i] < arr2[j]) \n\nSystem.out.print(arr1[i++]+\n\" \"\n); \n\nelse\nif\n(arr2[j] < arr1[i]) \n\nSystem.out.print(arr2[j++]+\n\" \"\n); \n\nelse\n\n{ \n\nSystem.out.print(arr2[j++]+\n\" \"\n); \n\ni++; \n\n} \n\n} \n\n\n/* Print remaining elements of \n\nthe larger array */\n\nwhile\n(i < m) \n\nSystem.out.print(arr1[i++]+\n\" \"\n); \n\nwhile\n(j < n) \n\nSystem.out.print(arr2[j++]+\n\" \"\n); \n\n\nreturn\n0\n; \n\n}","@Test\n public void testSolveGivenMazeTwice() {\n try {\n //link row 1\n largeMaze.linkPillars(Maze.position(0, 0), Maze.position(1, 0));\n largeMaze.linkPillars(Maze.position(1, 0), Maze.position(2, 0));\n largeMaze.linkPillars(Maze.position(2, 0), Maze.position(3, 0));\n largeMaze.linkPillars(Maze.position(3, 0), Maze.position(4, 0));\n largeMaze.linkPillars(Maze.position(1, 0), Maze.position(1, 1));\n\n //link row 2\n largeMaze.linkPillars(Maze.position(1, 1), Maze.position(2, 1));\n largeMaze.linkPillars(Maze.position(1, 1), Maze.position(1, 2));\n largeMaze.linkPillars(Maze.position(3, 1), Maze.position(4, 1));\n\n //link row 3\n largeMaze.linkPillars(Maze.position(1, 2), Maze.position(1, 3));\n largeMaze.linkPillars(Maze.position(1, 2), Maze.position(2, 2));\n\n //link row 4\n largeMaze.linkPillars(Maze.position(1, 3), Maze.position(0, 3));\n largeMaze.linkPillars(Maze.position(1, 3), Maze.position(2, 3));\n largeMaze.linkPillars(Maze.position(3, 3), Maze.position(4, 3));\n largeMaze.linkPillars(Maze.position(0, 3), Maze.position(0, 4));\n\n //link row 5\n largeMaze.linkPillars(Maze.position(0, 4), Maze.position(1, 4));\n largeMaze.linkPillars(Maze.position(1, 4), Maze.position(2, 4));\n largeMaze.linkPillars(Maze.position(2, 4), Maze.position(3, 4));\n largeMaze.linkPillars(Maze.position(3, 4), Maze.position(4, 4));\n\n //set beginning and end\n largeMaze.setBegin(Maze.position(0, 0));\n largeMaze.setEnd(Maze.position(4, 4));\n shortestPath = MazeSolver.pStar(largeMaze, 25);\n shortestPath2 = MazeSolver.pStar(largeMaze, 25);\n\n assertEquals(9, shortestPath.size());\n\n assertEquals(shortestPath.size(), shortestPath2.size());\n\n assertEquals(\"<0, 0>\", shortestPath.get(0).getCoordinateString());\n assertEquals(\"<1, 0>\", shortestPath.get(1).getCoordinateString());\n assertEquals(\"<1, 1>\", shortestPath.get(2).getCoordinateString());\n assertEquals(\"<1, 2>\", shortestPath.get(3).getCoordinateString());\n assertEquals(\"<1, 3>\", shortestPath.get(4).getCoordinateString());\n assertEquals(\"<1, 4>\", shortestPath.get(5).getCoordinateString());\n assertEquals(\"<2, 4>\", shortestPath.get(6).getCoordinateString());\n assertEquals(\"<3, 4>\", shortestPath.get(7).getCoordinateString());\n assertEquals(\"<4, 4>\", shortestPath.get(8).getCoordinateString());\n\n assertEquals(\"<0, 0>\", shortestPath2.get(0).getCoordinateString());\n assertEquals(\"<0, 1>\", shortestPath2.get(1).getCoordinateString());\n assertEquals(\"<0, 2>\", shortestPath2.get(2).getCoordinateString());\n assertEquals(\"<0, 3>\", shortestPath2.get(3).getCoordinateString());\n assertEquals(\"<0, 4>\", shortestPath2.get(4).getCoordinateString());\n assertEquals(\"<1, 4>\", shortestPath2.get(5).getCoordinateString());\n assertEquals(\"<2, 4>\", shortestPath2.get(6).getCoordinateString());\n assertEquals(\"<3, 4>\", shortestPath2.get(7).getCoordinateString());\n assertEquals(\"<4, 4>\", shortestPath2.get(8).getCoordinateString());\n\n } catch (Exception e) {\n fail(\"Unexpected exception was thrown while linking pillars.\");\n }\n }","@Test\n\tpublic void testUnionSLLSetArrayAll0() {\n\n\t\tint[] arr1 = { 0, 0, 0 };\n\t\tint[] arr2 = { 0, 0, 0, 0 };\n\t\tint[] arr3 = { 0, 0 };\n\t\tint[] arr4 = { 0, 0 };\n\t\tSLLSet listObj100 = new SLLSet(arr1);\n\t\tSLLSet listObj99 = new SLLSet(arr2);\n\t\tSLLSet listObj98 = new SLLSet(arr3);\n\t\tSLLSet listObj97 = new SLLSet(arr4);\n\t\tSLLSet listObj96 = new SLLSet();\n\t\tSLLSet[] Array = { listObj100, listObj99, listObj98, listObj97, listObj96 }; // test static SLLSet union(sArray)\n\n\t\tSLLSet listObj23 = SLLSet.union(Array);\n\n\t\tString expected = \"0\";\n\t\tint expectedSize = 1;\n\n\t\tassertEquals(expectedSize, listObj23.getSize());\n\t\tassertEquals(expected, listObj23.toString());\n\n\t}","public ArrBag<T> union( ArrBag<T> other )\n {\n ArrBag<T> unionArray = new ArrBag<T>(other.size() + this.size()); \n\n int unionCount = 0; \n for (int i = 0; i <this.size(); i++ ){\n unionArray.add(this.get(i));\n unionCount++;\n } for (int i = 0; i<other.size(); i++){\n if (!unionArray.contains(other.get(i))){\n unionArray.add(other.get(i));\n unionCount ++;\n }\n }\n return unionArray;\n }","public DrawMaze(int w, int h) {\n width = w;\n height = h;\n setPreferredSize(new Dimension(width * SIZE + 2 * BORDER + WALL, \n height * SIZE + 2 * BORDER + WALL));\n walls = new HashSet<Wall>();\n }","@Test\r\n public void testUnion1() {\r\n int actual[] = set1.unionOfSets(set2);\r\n Assert.assertArrayEquals(new int[] { 1, 2, 3, 4, 5 }, actual);\r\n }","private void clearHeight() {\n bitField0_ = (bitField0_ & ~0x00000008);\n height_ = 0L;\n }","private void newHeightCame(int height,int p){\n\t\tif(hStack.isEmpty()||hStack.peek()<height){\n\t\t\t//just add\n\t\t}else if(hStack.peek()>height){\n\t\t\t//pop and calc first, then at last , also add ;\n\t\t\tstackPopElements(height,p);\t\n\t\t}\n\t\t\n\t\thStack.push(height);\n\t\tpStack.push(p);\n//\t\tSystem.out.println(\" ++++++++++++++ push height\"+height+\" position: \"+p+\" after thsi , : \"+pStack.peek()+\" size: \"+pStack.size());\n\t}","public void union( int root1, int root2 )\n {\n s[ root2 ] = root1;\n }","public void setBestHeight() { setHeight(getBestHeight()); }","protected void merge(FlowGraphNode victim){\r\n for(FlowGraphNode node : victim.to){\r\n this.addTo(node);\r\n node.from.remove(victim);\r\n }\r\n for(FlowGraphNode node : victim.from){\r\n node.addTo(this);\r\n node.to.remove(victim);\r\n }\r\n }","void maze(char[][] mz, int p_row, int p_col, int h_row, int h_col){\n \n if (mz[p_row][p_col] == 'F'){\n //Base case -End maze\n printMaze(mz);\n System.out.println(\"Maze Successfully Completed!\");\n } else {\n if (h_row-1 == p_row){\n //If facing East\n if(mz[h_row][h_col] != '#'){ //If right turn available\n //Update player\n mz[p_row][p_col] = 'X'; \n p_row += 1;\n p_col += 0;\n if (mz[p_row][p_col] == 'F'){\n mz[p_row][p_col] = 'F';\n } else {\n mz[p_row][p_col] = 'O';\n }\n //Update hand\n h_row += 0;\n h_col -= 1;\n printMaze(mz); \n } else { \n //If hand position is a wall check in front of player\n if(mz[p_row][p_col+1] != '#'){\n //Update player\n mz[p_row][p_col] = 'X';\n p_row += 0;\n p_col += 1;\n if (mz[p_row][p_col] == 'F'){\n mz[p_row][p_col] = 'F';\n } else {\n mz[p_row][p_col] = 'O';\n }\n //Update hand\n h_row += 0;\n h_col += 1;\n printMaze(mz);\n } else if (mz[p_row-1][p_col] != '#'){\n //Turn left 90 and if not a wall move up\n //Update player\n mz[p_row][p_col] = 'X';\n p_row -= 1;\n p_col += 0;\n if (mz[p_row][p_col] == 'F'){\n mz[p_row][p_col] = 'F';\n } else {\n mz[p_row][p_col] = 'O';\n }\n //Update hand\n h_row -= 2;\n h_col += 1;\n printMaze(mz);\n } else {\n //Turn around\n //Update player\n mz[p_row][p_col] = 'X';\n p_row += 0;\n p_col -= 1;\n if (mz[p_row][p_col] == 'F'){\n mz[p_row][p_col] = 'F';\n } else {\n mz[p_row][p_col] = 'O';\n }\n //Update hand\n h_row -= 2;\n h_col -= 1;\n printMaze(mz);\n }\n }\n } else if (h_row+1 == p_row){\n //If facing West\n if(mz[h_row][h_col] != '#'){\n //Look right\n mz[p_row][p_col] = 'X'; \n p_row -= 1;\n p_col += 0;\n if (mz[p_row][p_col] == 'F'){\n mz[p_row][p_col] = 'F';\n } else {\n mz[p_row][p_col] = 'O';\n }\n //Update hand\n h_row -= 0;\n h_col += 1;\n printMaze(mz);\n } else { \n //If hand position is a wall check in front of player\n if(mz[p_row][p_col-1] != '#'){\n //Update player\n mz[p_row][p_col] = 'X';\n p_row += 0;\n p_col -= 1;\n if (mz[p_row][p_col] == 'F'){\n mz[p_row][p_col] = 'F';\n } else {\n mz[p_row][p_col] = 'O';\n }\n //Update hand\n h_row += 0;\n h_col -= 1;\n printMaze(mz);\n } else if (mz[p_row+1][p_col] != '#'){\n //Turn left 90 and if not a wall move up\n //Update player\n mz[p_row][p_col] = 'X';\n p_row += 1;\n p_col -= 0;\n if (mz[p_row][p_col] == 'F'){\n mz[p_row][p_col] = 'F';\n } else {\n mz[p_row][p_col] = 'O';\n }\n //Update hand\n h_row += 2;\n h_col -= 1;\n printMaze(mz);\n } else {\n //Turn around\n //Update player\n mz[p_row][p_col] = 'X';\n p_row -= 0;\n p_col += 1;\n if (mz[p_row][p_col] == 'F'){\n mz[p_row][p_col] = 'F';\n } else {\n mz[p_row][p_col] = 'O';\n }\n //Update hand\n h_row += 2;\n h_col += 1;\n printMaze(mz);\n }\n }\n \n } else if (h_col -1 == p_col){\n //If facing North\n if(mz[h_row][h_col] != '#'){ \n //Take right if available\n //Update player\n mz[p_row][p_col] = 'X'; \n p_row += 0;\n p_col += 1;\n if (mz[p_row][p_col] == 'F'){\n mz[p_row][p_col] = 'F';\n } else {\n mz[p_row][p_col] = 'O';\n }\n //Update hand\n h_row += 1;\n h_col -= 0;\n printMaze(mz); \n } else {\n //If hand position is a wall check in front of player\n if(mz[p_row-1][p_col] != '#'){\n //Update player\n mz[p_row][p_col] = 'X';\n p_row -= 1;\n p_col += 0;\n if (mz[p_row][p_col] == 'F'){\n mz[p_row][p_col] = 'F';\n } else {\n mz[p_row][p_col] = 'O';\n }\n //Update hand\n h_row -= 1;\n h_col += 0;\n printMaze(mz);\n } else if (mz[p_row][p_col-1] != '#'){\n //Turn left 90 and if not a wall move up\n //Update player\n mz[p_row][p_col] = 'X';\n p_row -= 0;\n p_col -= 1;\n if (mz[p_row][p_col] == 'F'){\n mz[p_row][p_col] = 'F';\n } else {\n mz[p_row][p_col] = 'O';\n }\n //Update hand\n h_row -= 1;\n h_col -= 2;\n printMaze(mz);\n } else {\n //Turn around\n //Update player\n mz[p_row][p_col] = 'X';\n p_row -= 1;\n p_col += 0;\n if (mz[p_row][p_col] == 'F'){\n mz[p_row][p_col] = 'F';\n } else {\n mz[p_row][p_col] = 'O';\n }\n //Update hand\n h_row += 1;\n h_col -= 2;\n printMaze(mz);\n }\n }\n } else if (h_col+1 == p_col){\n //If facing South\n if(mz[h_row][h_col] != '#'){\n //Look right\n mz[p_row][p_col] = 'X'; \n p_row -= 0;\n p_col -= 1;\n if (mz[p_row][p_col] == 'F'){\n mz[p_row][p_col] = 'F';\n } else {\n mz[p_row][p_col] = 'O';\n }\n //Update hand\n h_row -= 1;\n h_col += 0;\n printMaze(mz);\n } else { \n //If hand position is a wall check in front of player\n if(mz[p_row+1][p_col] != '#'){\n //Update player\n mz[p_row][p_col] = 'X';\n p_row += 1;\n p_col += 0;\n if (mz[p_row][p_col] == 'F'){\n mz[p_row][p_col] = 'F';\n } else {\n mz[p_row][p_col] = 'O';\n }\n //Update hand\n h_row += 1;\n h_col += 0;\n printMaze(mz);\n } else if (mz[p_row][p_col+1] != '#'){\n //Turn left 90 and if not a wall move up\n //Update player\n mz[p_row][p_col] = 'X';\n p_row += 0;\n p_col += 1;\n if (mz[p_row][p_col] == 'F'){\n mz[p_row][p_col] = 'F';\n } else {\n mz[p_row][p_col] = 'O';\n }\n //Update hand\n h_row += 1;\n h_col += 2;\n printMaze(mz);\n } else {\n //Turn around\n //Update player\n mz[p_row][p_col] = 'X';\n p_row -= 0;\n p_col += 1;\n if (mz[p_row][p_col] == 'F'){\n mz[p_row][p_col] = 'F';\n } else {\n mz[p_row][p_col] = 'O';\n }\n //Update hand\n h_row += 2;\n h_col += 1;\n printMaze(mz);\n }\n }\n \n }\n maze(mz, p_row, p_col, h_row, h_col); \n }\n }","public void open(int row, int col) {\n\t\tif (!isOpen(row, col)) {\n\t\t\tgrid[row - 1][col - 1] = true;\n\t\t\topenCount++;\n\t\t}\n\t\tint indexInUF = getUnionIndex(row, col);\n\n\t\t// left neighbor\n\t\tunionIfOpen(indexInUF, row, col - 1);\n\n\t\t// right neighbor\n\t\tunionIfOpen(indexInUF, row, col + 1);\n\n\t\t// top neighbor\n\t\tunionIfOpen(indexInUF, row + 1, col);\n\n\t\t// bottom neighbor\n\t\tunionIfOpen(indexInUF, row - 1, col);\n\n\t\tif (row == 1) {\n\t\t\t// union to virtual top index\n\t\t\tuf.union(0, indexInUF);\n\t\t}\n\n\t\tif (row == size) {\n\t\t\t// union to virtual bottom index\n\t\t\tuf.union(size * size + 1, indexInUF);\n\t\t}\n\t}","private void union(int[] parent, int x, int y){\n int xParent = find(parent, x);\n int yParent = find(parent, y);\n parent[xParent] = yParent;\n }","public static boolean UnionOperator(PsiBuilder b, int l) {\n if (!recursion_guard_(b, l, \"UnionOperator\")) return false;\n if (!nextTokenIs(b, \"<union operator>\", K_UNION, PIPE)) return false;\n boolean r;\n Marker m = enter_section_(b, l, _NONE_, UNION_OPERATOR, \"<union operator>\");\n r = consumeToken(b, K_UNION);\n if (!r) r = consumeToken(b, PIPE);\n exit_section_(b, l, m, r, false, null);\n return r;\n }","public static ImmutableGraph union( final ImmutableGraph g0, final ImmutableGraph g1 ) {\n\t\treturn g0 instanceof ArcLabelledImmutableGraph && g1 instanceof ArcLabelledImmutableGraph \n\t\t\t? union( (ArcLabelledImmutableGraph)g0, (ArcLabelledImmutableGraph)g1, (LabelMergeStrategy)null )\n\t\t\t\t\t: new UnionImmutableGraph( g0, g1 );\n\t}"],"string":"[\n \"public static void mazeUnion(){\\n\\n\\t\\tint n = 10;\\t\\n\\n\\t\\tdsf S = new dsf(n*n);\\n\\t\\tMaze one = new Maze(n);\\n\\n\\t\\tRandom random;\\n\\t\\tint sets = n*n;\\t//number of sets in the DSF\\n\\t\\tint randomNumber;\\n\\t\\tint randomDirection;\\n\\t\\tint row;\\n\\t\\tint col;\\n\\n\\t\\tchar upperRight; \\t//bottom or right\\n\\n\\t\\tS.print();\\n\\n\\t\\twhile(sets > 1){\\n\\t\\t\\trandom = new Random();\\n\\t\\t\\trandomNumber = random.nextInt((n*n) - 1);\\n\\t\\t\\tSystem.out.println(\\\"RANDOM NUMBER: \\\"+randomNumber);\\n\\t\\t\\trow = randomNumber /n;\\t//SWITCHED\\n\\t\\t\\tcol = randomNumber %n;\\t//SWITCHED\\n\\t\\t\\trandomDirection = random.nextInt(2);\\n\\t\\t\\tString direct;\\n\\t\\t\\tif(randomDirection == 0)\\n\\t\\t\\t\\tdirect = \\\"upper\\\";\\n\\t\\t\\telse\\n\\t\\t\\t\\tdirect = \\\"right\\\";\\n\\t\\t\\tSystem.out.println(\\\"RANDOM DIRECTI0N: \\\"+direct);\\n\\t\\t\\tupperRight = one.direction(randomDirection);\\n\\n\\t\\t\\tif(upperRight == 'u'){\\n\\t\\t\\t\\tif((randomNumber) < ((n*n)-n)){\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"Sets: \\\"+sets);\\n\\t\\t\\t\\t\\tif(S.find(randomNumber+n) != S.find(randomNumber)){\\n\\t\\t\\t\\t\\t\\tS.union(randomNumber+n, randomNumber);\\n\\t\\t\\t\\t\\t\\tone.remove_wall(col, row, 'u');\\n\\t\\t\\t\\t\\t\\tS.print();\\n\\t\\t\\t\\t\\t\\tsets--;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(upperRight == 'r'){\\n\\t\\t\\t\\tif(((randomNumber)%(n*n)) != n-1){\\n\\t\\t\\t\\t\\tif(S.findAndCompress(randomNumber) != S.findAndCompress(randomNumber+1)){\\n\\t\\t\\t\\t\\t\\tS.union(randomNumber, randomNumber+1);\\n\\t\\t\\t\\t\\t\\tone.remove_wall(col, row, 'r');\\n\\t\\t\\t\\t\\t\\t//S.print();\\n\\t\\t\\t\\t\\t\\tsets--;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tStdDraw.show(0);\\n\\t\\tone.draw();\\n\\t\\tone.printCellNumbers();\\n\\t\\t\\n\\t\\tbuildAdjacencyList(one, n);\\n\\t\\tuserSelection_SolveMaze(n);\\n\\n\\t}\",\n \"public static void unionPathCompression(){\\n\\t\\tint n = 10;\\t\\n\\n\\t\\tdsf S = new dsf(n*n);\\n\\t\\tMaze two = new Maze(n);\\n\\n\\t\\tRandom random;\\n\\t\\tint sets = n*n;\\t//number of sets in the DSF\\n\\t\\tint randomNumber;\\n\\t\\tint randomDirection;\\n\\t\\tint row;\\n\\t\\tint col;\\n\\n\\t\\tchar upperRight; \\t//bottom or right\\n\\n\\t\\tS.print();\\n\\n\\t\\twhile(sets > 1){\\n\\t\\t\\trandom = new Random();\\n\\t\\t\\trandomNumber = random.nextInt((n*n) - 1);\\n\\t\\t\\t//System.out.println(\\\"RANDOM NUMBER: \\\"+randomNumber);\\n\\t\\t\\trow = randomNumber /n;\\t//SWITCHED\\n\\t\\t\\tcol = randomNumber %n;\\t//SWITCHED\\n\\t\\t\\trandomDirection = random.nextInt(2);\\n\\t\\t\\tString direct;\\n\\t\\t\\tif(randomDirection == 0)\\n\\t\\t\\t\\tdirect = \\\"upper\\\";\\n\\t\\t\\telse\\n\\t\\t\\t\\tdirect = \\\"right\\\";\\n\\t\\t\\tSystem.out.println(\\\"RANDOM DIRECTI0N: \\\"+direct);\\n\\t\\t\\tupperRight = two.direction(randomDirection);\\n\\n\\t\\t\\tif(upperRight == 'u'){\\n\\t\\t\\t\\tif((randomNumber) < ((n*n)-n)){\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"Sets: \\\"+sets);\\n\\t\\t\\t\\t\\tif(S.findAndCompress(randomNumber+n) != S.findAndCompress(randomNumber)){\\n\\t\\t\\t\\t\\t\\tS.union(randomNumber+n, randomNumber);\\n\\t\\t\\t\\t\\t\\ttwo.remove_wall(col, row, 'u');\\n\\t\\t\\t\\t\\t\\tS.print();\\n\\t\\t\\t\\t\\t\\tsets--;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(upperRight == 'r'){\\n\\t\\t\\t\\tif(((randomNumber)%(n*n)) != n-1){\\n\\t\\t\\t\\t\\tif(S.findAndCompress(randomNumber) != S.findAndCompress(randomNumber+1)){\\n\\t\\t\\t\\t\\t\\tS.union(randomNumber, randomNumber+1);\\n\\t\\t\\t\\t\\t\\ttwo.remove_wall(col, row, 'r');\\n\\t\\t\\t\\t\\t\\tS.print();\\n\\t\\t\\t\\t\\t\\tsets--;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tbuildAdjacencyList(two, n);\\n\\t\\tuserSelection_SolveMaze(n);\\n\\n\\n\\t\\tStdDraw.show(0);\\n\\t\\ttwo.draw();\\n\\t\\ttwo.printCellNumbers();\\n\\t}\",\n \"void union(int x,int y){\\n int xRoot=find(x),yRoot=find(y);\\n if(xRoot==yRoot)return;\\n if(rank[xRoot]<rank[yRoot])\\n parent[xRoot]=yRoot;\\n else if(rank[xRoot]>rank[yRoot])\\n parent[yRoot]=xRoot;\\n else{\\n parent[yRoot]=xRoot;\\n rank[xRoot]=rank[xRoot]+1;\\n }\\n --totalSets;\\n }\",\n \"public void union(int p, int q){\\r\\n\\t\\tint rootP = root(p);\\r\\n\\t\\tint rootQ = root(q);\\r\\n\\t\\t\\r\\n\\t\\tif(rootP == rootQ) return;\\r\\n\\t\\t// Calculate height of tree and then link the root of smaller tree to root of larger tree\\r\\n\\t\\t\\r\\n\\t\\tif(size[rootP] < size[rootQ]) {\\r\\n\\t\\t\\tid[rootP] = rootQ;\\r\\n\\t\\t\\tsize[rootQ] = size[rootQ] + size[rootP];\\r\\n\\t\\t}\\r\\n\\t\\telse {\\r\\n\\t\\t\\tid[rootQ] = rootP;\\r\\n\\t\\t\\tsize[rootP] = size[rootQ] + size[rootP];\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public void union(String p, String q) {\\n if(p.equals(q)) return;\\n String rootP = findRoot(p);\\n String rootQ = findRoot(q);\\n // skip if both users are already part of the same tree.\\n if(rootP.equals(rootQ)) return;\\n\\n int newHeight = treesHeight.get(rootP) + treesHeight.get(rootQ);\\n // Keep track of the highest tree.\\n highestHeight = Math.max(highestHeight, newHeight);\\n\\n if (treesHeight.get(rootP) > treesHeight.get(rootQ)) {\\n usersMap.put(rootQ, rootP);\\n treesHeight.put(rootP, newHeight);\\n }\\n else {\\n usersMap.put(rootP, rootQ);\\n treesHeight.put(rootQ, newHeight);\\n }\\n }\",\n \"@Override\\n public void union(int root1, int root2) {\\n // TODO: Implement the union-by-rank algorithm for disjoint set\\n if (s[root1]>-1 || s[root2]>-1 ) throw new IllegalArgumentException(\\\"Impossible to union because one of the roots is already dependant\\\");\\n if( s[root2] < s[root1]){ // root2 is deeper\\n s[root1] = root2;// Make root2 new root\\n } \\n else{\\n if(s[root1] == s[root2]) s[ root1 ]--; // Update height if same\\n s[root2] = root1; // Make root1 new root\\n }\\n }\",\n \"public void union(int i, int j) {\\n\\tint p = findRoot(i);\\n\\tint q = findRoot(j);\\n\\t\\n\\tif (p == q) return;\\n\\t\\n\\tif (size[p] < size[q]) { //pick the smallest tree and append it to the bigger tree\\n\\t root[p] = q;\\n\\t size[p] += size[q];\\n\\t} else {\\n\\t root[q] = p;\\n\\t size[q] += size[p];\\n\\t}\\n }\",\n \"void union(int x, int y) {\\n\\n // **** set the modes in the parents array ****\\n if (parents[x] == 0)\\n parents[x] = x;\\n\\n if (parents[y] == 0)\\n parents[y] = y;\\n\\n // **** update the representative element of each set ****\\n if (parents[x] != 0 || parents[y] != 0) {\\n\\n // **** get the low and high from these nodes ****\\n int high = Math.max(parents[x], parents[y]);\\n int low = Math.min(parents[x], parents[y]);\\n\\n // ???? ????\\n System.out.println(\\\"union <<< high: \\\" + high + \\\" low: \\\" + low);\\n\\n // **** update to point to the proper representative ****\\n for (int i = 0; i < parents.length; i++) {\\n if (parents[i] == high)\\n parents[i] = low;\\n }\\n }\\n }\",\n \"public void createMaze(int rows, int cols) {\\n\\t\\t\\n\\t\\tint total = rows*cols;\\n\\t\\tDisjSets ds = new DisjSets(total); //Create an object of the disjoint set class\\n\\t\\t \\n\\t\\tList<List<Node>> maze = new ArrayList<List<Node>>();\\n\\t\\t \\n\\t\\tmaze = initializeMaze(rows, cols, maze); //Initialize the maze\\n\\t\\t \\n\\t\\tRandom rand = new Random();\\n\\t\\t \\n\\t\\twhile(ds.find(0) != ds.find(total - 1)) {\\n\\t\\t\\t \\n\\t\\t\\tint currRow = rand.nextInt(rows); //Random row number\\n\\t\\t\\tint currCol = rand.nextInt(cols); //Random column number\\n\\t\\t\\tNode currNode = maze.get(currRow).get(currCol); //Current node(cell)\\n\\t\\t\\tint currValue = currNode.value;\\n\\t\\t\\t \\n\\t\\t\\tint root1 = ds.find(currValue); //Find on current node(cell)\\n\\t\\t\\tint root2;\\n\\t\\t\\tboolean removeHorizontal = false;\\n\\t\\t\\t \\n\\t\\t\\tif(currValue == total - 1) {\\n\\t\\t\\t\\tcontinue; //Don't do anything if the current cell is the bottom-rightmost cell\\n\\t\\t\\t}\\n\\t\\t\\t \\n\\t\\t\\tif(currRow == rows - 1) {\\n\\t\\t\\t\\t//Last row -- can only break the right wall, can't break the wall to the bottom \\n\\t\\t\\t\\troot2 = ds.find(currValue + 1);\\n\\t\\t\\t} else if(currCol == cols - 1) {\\n\\t\\t\\t\\t//Last column -- can only break the wall to the bottom, can't break the right wall \\n\\t\\t\\t\\troot2 = ds.find(currValue + cols);\\n\\t\\t\\t\\tremoveHorizontal = true;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\t//Neither last row nor last column\\n\\t\\t\\t\\t//Randomly select either right wall or wall to the bottom to break\\n\\t\\t\\t\\tboolean selectRight;\\n\\t\\t\\t\\tselectRight = rand.nextBoolean();\\n\\t\\t\\t\\t \\n\\t\\t\\t\\tif(selectRight) {\\n\\t\\t\\t\\t\\troot2 = ds.find(currValue + 1);\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\troot2 = ds.find(currValue + cols);\\n\\t\\t\\t\\t\\tremoveHorizontal = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t//Finds resulted in different sets\\n\\t\\t\\tif(root1 != root2) {\\n\\t\\t\\t\\t \\n\\t\\t\\t\\tds.union(root1, root2); //Take union of the two sets\\n\\t\\t\\t\\t \\n\\t\\t\\t\\tif(removeHorizontal) {\\n\\t\\t\\t\\t\\tcurrNode.horizontal = false; //Break the horizontal wall\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tcurrNode.vertical = false; //Break the vertical wall\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t//Leave the bottom right corner open\\n\\t\\tNode destination = maze.get(rows - 1).get(cols - 1);\\n\\t\\tdestination.horizontal = false;\\n\\t\\tdestination.vertical = false;\\n\\t\\t \\n\\t\\tprintMaze(rows, cols, maze); //Print the final maze\\n\\t}\",\n \"@Test\\n public void testMatchLimitOneBottomUp() throws Exception {\\n\\n HepProgramBuilder programBuilder = HepProgram.builder();\\n programBuilder.addMatchLimit( 1 );\\n programBuilder.addMatchOrder( HepMatchOrder.BOTTOM_UP );\\n programBuilder.addRuleInstance( UnionToDistinctRule.INSTANCE );\\n\\n checkPlanning( programBuilder.build(), UNION_TREE );\\n }\",\n \"public void union(int p, int q) {\\n\\t\\tint i = find(p);\\n\\t\\tint j = find(q);\\n\\t\\tif (i == j)\\n\\t\\t\\treturn;\\n\\t\\t\\n\\t\\t// make shorter root point to taller one\\n\\t\\tif (height[i] < height[j]) parent[i] = j;\\n\\t else if (height[i] > height[j]) parent[j] = i;\\n\\t else {\\n\\t \\tparent[j] = i;\\n\\t height[i]++;\\n\\t }\\n\\t\\tcount--;\\n\\t}\",\n \"public static void mazeSize(){\\n\\t\\tint n = 10;\\t\\n\\n\\t\\tdsf S = new dsf(n*n);\\n\\t\\tMaze four = new Maze(n);\\n\\n\\t\\tRandom random;\\n\\t\\tint sets = n*n;\\t//number of sets in the DSF\\n\\t\\tint randomNumber;\\n\\t\\tint randomDirection;\\n\\t\\tint row;\\n\\t\\tint col;\\n\\n\\t\\tchar upperRight; \\t//bottom or right\\n\\n\\t\\tS.print();\\n\\n\\t\\twhile(sets > 1){\\n\\t\\t\\trandom = new Random();\\n\\t\\t\\trandomNumber = random.nextInt((n*n) - 1);\\n\\t\\t\\t//System.out.println(\\\"RANDOM NUMBER: \\\"+randomNumber);\\n\\t\\t\\trow = randomNumber /n;\\t//SWITCHED\\n\\t\\t\\tcol = randomNumber %n;\\t//SWITCHED\\n\\t\\t\\trandomDirection = random.nextInt(2);\\n\\t\\t\\tString direct = null;\\n\\t\\t\\tif(randomDirection == 0)\\n\\t\\t\\t\\tdirect = \\\"upper\\\";\\n\\t\\t\\tif(randomDirection == 1)\\n\\t\\t\\t\\tdirect = \\\"right\\\";\\n\\t\\t\\t//System.out.println(\\\"RANDOM DIRECTI0N: \\\"+direct);\\n\\t\\t\\tupperRight = four.direction(randomDirection);\\n\\n\\t\\t\\tif(upperRight == 'u'){\\n\\t\\t\\t\\tif((randomNumber) < ((n*n)-n)){\\n\\t\\t\\t\\t\\t//System.out.println(\\\"Sets: \\\"+sets);\\n\\t\\t\\t\\t\\tif(S.find(randomNumber) != S.find(randomNumber + n)){\\n\\t\\t\\t\\t\\t\\tS.unionBySize(randomNumber, randomNumber+n);\\n\\t\\t\\t\\t\\t\\tfour.remove_wall(col, row, 'u');\\n\\t\\t\\t\\t\\t\\t//S.print();\\n\\t\\t\\t\\t\\t\\tsets--;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(upperRight == 'r'){\\n\\t\\t\\t\\tif(((randomNumber)%(n*n)) != n-1){\\n\\t\\t\\t\\t\\tif(S.find(randomNumber) != S.find(randomNumber+1)){\\n\\t\\t\\t\\t\\t\\tS.unionBySize(randomNumber, randomNumber+1);\\n\\t\\t\\t\\t\\t\\tfour.remove_wall(col, row, 'r');\\n\\t\\t\\t\\t\\t\\t//S.print();\\n\\t\\t\\t\\t\\t\\tsets--;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tbuildAdjacencyList(four, n);\\n\\t\\tuserSelection_SolveMaze(n);\\n\\n\\n\\t\\tStdDraw.show(0);\\n\\t\\tfour.draw();\\n\\t\\tfour.printCellNumbers();\\t\\n\\t}\",\n \"public void union(BlastGraph<HitVertex, ValueEdge> graphToUnion) {\\n\\t\\tfor (HitVertex hv : graphToUnion.getVertices()) {\\n\\t\\t\\tthis.addVertex(hv);\\n\\t\\t}\\n\\n\\t\\tfor (ValueEdge ve : graphToUnion.getEdges()) {\\n\\t\\t\\tthis.addEdge(ve, graphToUnion.getEndpoints(ve));\\n\\t\\t}\\n\\t}\",\n \"public static void sizePathCompression(){\\n\\t\\tint n = 10;\\t\\n\\n\\t\\tdsf S = new dsf(n*n);\\n\\t\\tMaze five = new Maze(n);\\n\\n\\t\\tRandom random;\\n\\t\\tint sets = n*n;\\t//number of sets in the DSF\\n\\t\\tint randomNumber;\\n\\t\\tint randomDirection;\\n\\t\\tint row;\\n\\t\\tint col;\\n\\n\\t\\tchar upperRight; \\t//bottom or right\\n\\n\\t\\tS.print();\\n\\n\\t\\twhile(sets > 1){\\n\\t\\t\\trandom = new Random();\\n\\t\\t\\trandomNumber = random.nextInt((n*n) - 1);\\n\\t\\t\\t//System.out.println(\\\"RANDOM NUMBER: \\\"+randomNumber);\\n\\t\\t\\trow = randomNumber /n;\\t//SWITCHED\\n\\t\\t\\tcol = randomNumber %n;\\t//SWITCHED\\n\\t\\t\\trandomDirection = random.nextInt(2);\\n\\t\\t\\tString direct;\\n\\t\\t\\tif(randomDirection == 0)\\n\\t\\t\\t\\tdirect = \\\"upper\\\";\\n\\t\\t\\telse\\n\\t\\t\\t\\tdirect = \\\"right\\\";\\n\\t\\t\\t//System.out.println(\\\"RANDOM DIRECTI0N: \\\"+direct);\\n\\t\\t\\tupperRight = five.direction(randomDirection);\\n\\n\\t\\t\\tif(upperRight == 'u'){\\n\\t\\t\\t\\tif((randomNumber) < ((n*n)-n)){\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"Sets: \\\"+sets);\\n\\t\\t\\t\\t\\tif(S.findAndCompress(randomNumber) != S.findAndCompress(randomNumber + n)){\\n\\t\\t\\t\\t\\t\\tS.unionBySize(randomNumber+n, randomNumber);\\n\\t\\t\\t\\t\\t\\tfive.remove_wall(col, row, 'u');\\n\\t\\t\\t\\t\\t\\t//S.print();\\n\\t\\t\\t\\t\\t\\tsets--;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(upperRight == 'r'){\\n\\t\\t\\t\\tif(((randomNumber)%(n*n)) != n-1){\\n\\t\\t\\t\\t\\tif(S.findAndCompress(randomNumber) != S.findAndCompress(randomNumber+1)){\\n\\t\\t\\t\\t\\t\\tS.unionBySize(randomNumber, randomNumber+1);\\n\\t\\t\\t\\t\\t\\tfive.remove_wall(col, row, 'r');\\n\\t\\t\\t\\t\\t\\tS.print();\\n\\t\\t\\t\\t\\t\\tsets--;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tbuildAdjacencyList(five, n);\\n\\t\\tuserSelection_SolveMaze(n);\\n\\n\\t\\tStdDraw.show(0);\\n\\t\\tfive.draw();\\n\\t\\tfive.printCellNumbers();\\t\\n\\t}\",\n \"public void union(T x, T y) {\\n\\t\\tassert (_parents.containsKey(x));\\n\\t\\tassert (_parents.containsKey(y));\\n\\n\\t\\tx = find(x);\\n\\t\\ty = find(y);\\n\\n\\t\\tif (x == y) {\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\n\\t\\tint xRank = _ranks.get(x);\\n\\t\\tint yRank = _ranks.get(y);\\n\\n\\t\\tif (xRank < yRank) {\\n\\t\\t\\t_parents.put(x, y);\\n\\t\\t} else if (xRank > yRank) {\\n\\t\\t\\t_parents.put(y, x);\\n\\t\\t} else {\\n\\t\\t\\t_parents.put(y, x);\\n\\t\\t\\t_ranks.put(x, xRank + 1);\\n\\t\\t}\\n\\n\\t\\t_numSets--;\\n\\t}\",\n \"public org.apache.gora.cascading.test.storage.TestRow.Builder clearUnionRecursive() {\\n unionRecursive = null;\\n fieldSetFlags()[3] = false;\\n return this;\\n }\",\n \"public void union(int first, int second){\\n int firstId = find(first);\\n int secondId = find(second);\\n //Check if these are already connected\\n if(firstId == secondId){\\n return;\\n }\\n if(size[firstId] < size[secondId]){\\n size[secondId]+=size[firstId];\\n grid[first] = secondId;\\n }\\n else {\\n size[firstId]+=size[secondId];\\n grid[second] = firstId;\\n }\\n --numOfComponents;\\n }\",\n \"void Union( int x, int y){\\n\\n int i = root(x);\\n int j = root(y);\\n if (i == j) return;\\n if (rank[i] > rank[j]) { id[j] = i; rank[i] += rank[j]; }\\n else { id[i] = j; rank[j] += rank[i]; }\\n }\",\n \"public void union(int p, int q)\\n {\\n int i = root(p);\\n int j = root(q);\\n if ( i == j ) return;\\n \\n if ( sz[i] < sz[j] ) { \\n // i is no longer a root, so we don't need to update the size\\n id[i] = j; sz[j] += sz[i];\\n }\\n else {\\n id[j] = i; sz[i] += sz[j]; \\n } \\n }\",\n \"public void union(int p, int q)\\n {\\n int i = this.root(p);\\n int j = this.root(q);\\n if (i == j) return;\\n\\n if (this.size[i] < this.size[j])\\n {\\n this.parent[i] = j;\\n this.size[j] += this.size[i];\\n }\\n else\\n {\\n this.parent[j] = i;\\n this.size[i] += this.size[j];\\n }\\n }\",\n \"public void quickUnion(int p, int q) {\\n int pid = find(p);\\n int qid = find(q);\\n if (pid == qid) return;\\n //compare two value's height\\n //if two height is same just need add 1 in parent root\\n if (height[p] == height[q]) {\\n id[pid] = qid;\\n height[qid]++;\\n } else if (height[p] < height[q]) {\\n id[pid] = qid;\\n } else {\\n id[qid] = pid;\\n }\\n\\n }\",\n \"public void updateUnionArea() {\\n this.mBlurUnionRect.setEmpty();\\n for (Map.Entry<View, HwBlurEntity> entityEntry : this.mTargetViews.entrySet()) {\\n View targetView = entityEntry.getKey();\\n HwBlurEntity blurEntity = entityEntry.getValue();\\n if (targetView.isShown() && blurEntity.isEnabled()) {\\n Rect targetViewRect = new Rect();\\n targetView.getGlobalVisibleRect(targetViewRect);\\n blurEntity.setTargetViewRect(targetViewRect);\\n this.mBlurUnionRect.union(targetViewRect);\\n }\\n targetView.invalidate();\\n }\\n initBitmapAndCanvas();\\n }\",\n \"public void open(int row, int col) {\\n check(row, col);\\n if (!isOpen(row, col)) {\\n sites[row - 1][col - 1] = true;\\n openSites++;\\n\\n int index = index(row, col);\\n if (row == gridDimension) {\\n unionFind.union(index, bottomRoot);\\n\\n if (gridDimension == 1){\\n unionFind.union(index, topRoot);\\n fullSites.union(index, topRoot);\\n }\\n else if (isOpen(row - 1, col)) {\\n unionFind.union(index(row - 1, col), index);\\n fullSites.union(index(row - 1, col), index);\\n }\\n }\\n else if (row == 1) {\\n unionFind.union(index, topRoot);\\n fullSites.union(index, topRoot);\\n\\n if (isOpen(row + 1, col)) {\\n unionFind.union(index(row + 1, col), index);\\n fullSites.union(index(row + 1, col), index);\\n }\\n }\\n\\n else {\\n if (isOpen(row + 1, col)) {\\n unionFind.union(index(row + 1, col), index);\\n fullSites.union(index(row + 1, col), index);\\n }\\n\\n if (isOpen(row - 1, col)) {\\n unionFind.union(index(row - 1, col), index);\\n fullSites.union(index(row - 1, col), index);\\n }\\n }\\n\\n\\n\\n if (col > 1) {\\n if (isOpen(row, col - 1)) {\\n unionFind.union(index(row, col - 1), index);\\n fullSites.union(index(row, col - 1), index);\\n }\\n }\\n\\n if (col < gridDimension) {\\n if (isOpen(row, col + 1)) {\\n unionFind.union(index(row, col + 1), index);\\n fullSites.union(index(row, col + 1), index);\\n }\\n }\\n }\\n }\",\n \"public void union(Node a, Node b) {\\n Node set1 = find(a);\\n Node set2 = find(b);\\n\\n if (set1 != set2) {\\n // Limits the worst case runtime of a find to O(log N)\\n if (set1.getSize() < set2.getSize()) {\\n set2.setParent(set1);\\n set1.setSize(set1.getSize() + set2.getSize());\\n }\\n else {\\n set1.setParent(set2);\\n set2.setSize(set1.getSize() + set2.getSize());\\n }\\n }\\n }\",\n \"void union(int a, int b) {\\n\\t\\tif (a==9 && b==4){\\r\\n\\t\\tSystem.out.println(\\\"DEBUGGING 9 AND 4\\\");\\r\\n\\t\\tSystem.out.println(\\\"size of A: \\\"+ sizeOf(a));\\r\\n\\t\\tSystem.out.println(\\\"size of B: \\\"+ sizeOf(b));\\r\\n\\t\\t}\\r\\n\\t\\tint rootB = getRoot(b); // N array access\\r\\n\\t\\tint rootA = getRoot(a); // N array access\\r\\n\\t\\tif (rootA==rootB)return;\\r\\n\\r\\n\\t\\tif (sizeOf(rootA)<sizeOf(rootB)){\\r\\n\\t\\t\\tidNode[rootA] = rootB; // 1 array access\\r\\n\\t\\t}\\r\\n\\t\\telse{\\r\\n\\t\\t\\tidNode[rootB] = rootA; // 1 array access\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public org.apache.gora.cascading.test.storage.TestRow getUnionRecursive() {\\n return unionRecursive;\\n }\",\n \"public void union(int p, int q) {\\n\\t\\tint i = root(p);\\n\\t\\tint j = root(q);\\n//\\t\\tid[i] = j; instead of this do below improvement\\n\\t\\tif (sz[i] < sz[j]) {\\n\\t\\t\\tid[i] = j;\\n\\t\\t\\tsz[j] += sz[i];\\n\\t\\t} else {\\n\\t\\t\\tid[j] = i;\\n\\t\\t\\tsz[i] += sz[j];\\n\\t\\t}\\n\\t}\",\n \"public org.apache.gora.cascading.test.storage.TestRow getUnionRecursive() {\\n return unionRecursive;\\n }\",\n \"public void union(int i, int j) {\\n\\n int root1 = find(i);\\n int root2 = find(j);\\n\\n if (root2 == root1)\\n return;\\n\\n if (_rank[root1] > _rank[root2]) {\\n _parent[root2] = root1;\\n } else if (_rank[root2] > _rank[root1]) {\\n _parent[root1] = root2;\\n } else {\\n _parent[root2] = root1;\\n _rank[root1]++;\\n }\\n }\",\n \"@Test\\n\\tpublic void testUnion5() {\\n\\n\\t\\tint[] arr = {};\\n\\t\\tSLLSet listObj2 = new SLLSet(arr);\\n\\t\\tint[] uni2 = { 0, 2, 3 };\\n\\t\\tSLLSet listObj7 = new SLLSet(uni2);\\n\\t\\tSLLSet listObj8 = listObj2.union(listObj7);\\n\\n\\t\\tString expected = \\\"0, 2, 3\\\";\\n\\t\\tint expectedSize = 3;\\n\\n\\t\\tassertEquals(expectedSize, listObj8.getSize());\\n\\t\\tassertEquals(expected, listObj8.toString());\\n\\n\\t}\",\n \"public void setUnionForBody(NodeUnion<? extends ClassBodyNode> body) throws NullPointerException;\",\n \"public void open(int row, int col) {\\n if (isOpen(row, col)) return;\\n grid[row - 1][col - 1] = true;\\n ++openSites;\\n\\n // Transform the row and the column into an appropriate index\\n // because the quick union class uses a one-dimensional array.\\n final int currentSiteIndex = toIndex(row, col);\\n\\n // The topmost row must be connected to the virtual top.\\n if (row == 1) {\\n mainUnion.union(virtualTopId, currentSiteIndex);\\n backwashAwareUnion.union(virtualTopId, currentSiteIndex);\\n }\\n // The bottommost row must be connected to virtual the bottom.\\n if (row == size) mainUnion.union(virtualBottomId, currentSiteIndex);\\n\\n // Connect all neighbors of the current site if and only if the neighbors are open.\\n if (row > 1 && isOpen(row - 1, col)) {\\n final int topNeighborIndex = toIndex(row - 1, col);\\n mainUnion.union(topNeighborIndex, currentSiteIndex);\\n backwashAwareUnion.union(topNeighborIndex, currentSiteIndex);\\n }\\n\\n if (row < size && isOpen(row + 1, col)) {\\n final int bottomNeighborIndex = toIndex(row + 1, col);\\n mainUnion.union(bottomNeighborIndex, currentSiteIndex);\\n backwashAwareUnion.union(bottomNeighborIndex, currentSiteIndex);\\n }\\n\\n if (col > 1 && isOpen(row, col - 1)) {\\n final int leftNeighborIndex = toIndex(row, col - 1);\\n mainUnion.union(leftNeighborIndex, currentSiteIndex);\\n backwashAwareUnion.union(leftNeighborIndex, currentSiteIndex);\\n }\\n\\n if (col < size && isOpen(row, col + 1)) {\\n final int rightNeighborIndex = toIndex(row, col + 1);\\n mainUnion.union(rightNeighborIndex, currentSiteIndex);\\n backwashAwareUnion.union(rightNeighborIndex, currentSiteIndex);\\n }\\n }\",\n \"public final void mT__79() throws RecognitionException {\\n try {\\n int _type = T__79;\\n int _channel = DEFAULT_TOKEN_CHANNEL;\\n // InternalMyDsl.g:77:7: ( 'union' )\\n // InternalMyDsl.g:77:9: 'union'\\n {\\n match(\\\"union\\\"); \\n\\n\\n }\\n\\n state.type = _type;\\n state.channel = _channel;\\n }\\n finally {\\n }\\n }\",\n \"BUnion createBUnion();\",\n \"public void setUnionRecursive(org.apache.gora.cascading.test.storage.TestRow value) {\\n this.unionRecursive = value;\\n setDirty(3);\\n }\",\n \"public static void unionFind(int[][] doubleArray, int dimensions, UnionFind uf)\\n {\\n int count = 0;\\n while (count != dimensions)\\n {\\n for (int column = 0; column < dimensions; column++) {\\n if (uf.find(count, (dimensions*dimensions - 1 - column)) == true)\\n {\\n uf.printArray();\\n StdOut.println();\\n StdOut.println(\\\"Drip, drip.\\\");\\n return;\\n }\\n }\\n count++;\\n }\\n StdOut.println(\\\"No drip, drip.\\\");\\n }\",\n \"public static void union(String a, String b) {\\r\\n int root1 = find(a);\\r\\n int root2 = find(b);\\r\\n if (root1 == root2)return;\\r\\n if(size.get(root1) < size.get(root2)){size.set(root2, size.get(root2)+size.get(root1)); position.set(root1, root2);}\\r\\n else {size.set(root1, size.get(root1)+size.get(root2)); position.set(root2, root1);}\\r\\n }\",\n \"@Test\\r\\n public void testCreateUnion_thisIsEmpty() {\\r\\n Tour tourA = new Tour();\\r\\n Tour tourB = new Tour(new int[][]{{12, 12}});\\r\\n Tour result = tourA.createUnion(tourB);\\r\\n Tour expected = new Tour(new int[][]{{12, 12}});\\r\\n assertTrue(result.toString(), expected.isEqual(result));\\r\\n }\",\n \"public int union(int u, int v) {\\n int p1 = find(u), p2 = find(v);\\n if (p1 == p2) {\\n return p1;\\n }\\n int s1 = _sizes[p1], s2 = _sizes[p2];\\n if (s1 > s2) {\\n _sizes[p1] += s2;\\n// int i = 1;\\n// while (s2 > 0) {\\n// if (_parents[i] == p2) {\\n// _parents[i] = p1;\\n// s2 -= 1;\\n// }\\n// i += 1;\\n// }\\n _parents[p2] = p1;\\n return s1;\\n } else {\\n _sizes[p2] += s1;\\n// int j = 1;\\n// while (s1 > 0) {\\n// if (_parents[j] == p1) {\\n// _parents[j] = p2;\\n// s1 -= 1;\\n// }\\n// j += 1;\\n// }\\n _parents[p1] = p2;\\n return s2;\\n }\\n }\",\n \"void union(int a, int b) {\\n int aParent = find(a); // find parent of a\\n int bParent = find(b); // find parent of b\\n\\n // here we are everytime setting the parent of a_set as b_set in union\\n // set the parent of all a as parent of b\\n childToParentMap.put(aParent, bParent);\\n }\",\n \"public org.apache.gora.cascading.test.storage.TestRow.Builder setUnionRecursive(org.apache.gora.cascading.test.storage.TestRow value) {\\n validate(fields()[3], value);\\n this.unionRecursive = value;\\n fieldSetFlags()[3] = true;\\n return this; \\n }\",\n \"public static List canMerge(GameBoard gb) {\\r\\n\\t\\tList fullCol = new ArrayList();\\r\\n\\t\\tList fullRow = new ArrayList();\\r\\n\\t\\tList direction = new ArrayList();\\r\\n\\t\\tfor (int i = 1; i < 5; i++) {\\r\\n\\t\\t\\tfullCol.add(gb.getColumn(i));\\r\\n\\t\\t\\tfullRow.add(gb.getRow(i));\\r\\n\\t\\t} //return list of directions that can merge\\r\\n\\t\\t//check up\\r\\n\\t\\tList temp = new ArrayList();\\r\\n\\t\\tfor (int i = 1; i < 5; i++) {\\r\\n\\t\\t\\ttemp.add(merge(gb.getColumn(i)));\\r\\n\\t\\t}\\r\\n\\t\\tif (!temp.equals(fullCol)) {direction.add(new Integer(1));}\\r\\n\\t\\t//check down\\r\\n\\t\\ttemp = new ArrayList();\\r\\n\\t\\tfor (int i = 1; i < 5; i++) {\\r\\n\\t\\t\\t//first reverse column you receive \\r\\n\\t\\t\\tList temp1 = new ArrayList();\\r\\n\\t\\t\\tList temp2 = new ArrayList();\\r\\n\\t\\t\\tfor (int j = 0; j < 4; j++) {temp1.add(gb.getColumn(i).get(3-j));}\\r\\n\\t\\t\\ttemp1 = merge(temp1);\\r\\n\\t\\t\\t//undo reverse\\r\\n\\t\\t\\tfor (int k = 0; k < 4; k++) {temp2.add(temp1.get(3-k));}\\r\\n\\t\\t\\ttemp.add(temp2);\\r\\n\\t\\t}\\r\\n\\t\\tif (!temp.equals(fullCol)) {direction.add(new Integer(2));}\\r\\n\\t\\t//check left\\r\\n\\t\\ttemp = new ArrayList();\\r\\n\\t\\tfor (int i = 1; i < 5; i++) {\\r\\n\\t\\t\\ttemp.add(merge(gb.getRow(i)));\\r\\n\\t\\t}\\r\\n\\t\\tif (!temp.equals(fullRow)) {direction.add(new Integer(3));}\\r\\n\\t\\t//check right\\r\\n\\t\\ttemp = new ArrayList();\\r\\n\\t\\tfor (int i = 1; i < 5; i++) {\\r\\n\\t\\t\\t//first reverse row you receive \\r\\n\\t\\t\\tList temp1 = new ArrayList();\\r\\n\\t\\t\\tList temp2 = new ArrayList();\\r\\n\\t\\t\\tfor (int j = 0; j < 4; j++) {temp1.add(gb.getRow(i).get(3-j));}\\r\\n\\t\\t\\ttemp1 = merge(temp1);\\r\\n\\t\\t\\t//undo reverse\\r\\n\\t\\t\\tfor (int k = 0; k < 4; k++) {temp2.add(temp1.get(3-k));}\\r\\n\\t\\t\\ttemp.add(temp2);\\r\\n\\t\\t}\\r\\n\\t\\tif (!temp.equals(fullRow)) {direction.add(new Integer(4));}\\r\\n\\t\\treturn direction;\\r\\n\\t}\",\n \"void union(int p, int q) {}\",\n \"public static ArrayList<ArrayList<String>> unionD(String table1Name, String table2Name){\\n\\t\\tArrayList<ArrayList<String>> union = new ArrayList<ArrayList<String>>();\\r\\n\\t\\t//these will hold the data from the input tables\\r\\n\\t\\tArrayList<ArrayList<String>> columns1 = new ArrayList<ArrayList<String>>();\\r\\n\\t\\tArrayList<ArrayList<String>> columns2 = new ArrayList<ArrayList<String>>();\\r\\n\\t\\t//find the input tables in the database list\\r\\n\\t\\tfor (int i = 0; i < tables.size(); i++) {\\r\\n\\t\\t\\tif (tables.get(i).getName().equals(table1Name)) {\\r\\n\\t\\t\\t\\tcolumns1 = new ArrayList<ArrayList<String>>(tables.get(i).datas);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tif (tables.get(i).getName().equals(table2Name)) {\\r\\n\\t\\t\\t\\tcolumns2 = new ArrayList<ArrayList<String>>(tables.get(i).datas);\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\t//check if the tables are union compatable\\r\\n\\t\\tif (columns1.size() != columns2.size()) {\\r\\n\\t\\t\\tSystem.out.println(\\\"Unable to perform union - unnequal number of columns.\\\");\\r\\n\\t\\t}\\r\\n\\t\\telse {\\t//only continue if they are union compatable\\r\\n\\t\\t\\t//true if all columns have the same type\\r\\n\\t\\t\\tint sameTypes = 1;\\r\\n\\t\\t\\tint type1 = 0;\\r\\n\\t\\t\\tint type2 = 0;\\r\\n\\t\\t\\t//a max char value of -1 indicates the type is integer\\r\\n\\t\\t\\tfor (int j = 0; j < columns1.size(); j++) {\\r\\n\\t\\t\\t\\ttype1 = Integer.valueOf(new String(columns1.get(j).get(1)));\\r\\n\\t\\t\\t\\ttype2 = Integer.valueOf(columns2.get(j).get(1));\\r\\n\\t\\t\\t\\tif (type1 > 0) { type1 = 1; }\\r\\n\\t\\t\\t\\telse if (type1 < 0) { type1 = -1; }\\r\\n\\t\\t\\t\\tif (type2 > 0) { type2 = 1; }\\r\\n\\t\\t\\t\\telse if (type2 < 0) { type2 = -1; }\\r\\n\\t\\t\\t\\t//if the types were not equal, don't continue\\r\\n\\t\\t\\t\\tif (type1 != type2) {\\r\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"Unable to perform union - incompatible types.\\\");\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\telse {\\t//continue if the types are equal\\r\\n\\t\\t\\t\\t\\t\\t//create new columns holding the name from the first table and the greatest char max\\r\\n\\t\\t\\t\\t\\tArrayList<String> newColumn = new ArrayList<String>();\\r\\n\\t\\t\\t\\t\\tint largestChar = 0;\\r\\n\\t\\t\\t\\t\\tif (type1 != -1) {\\t//if they aren't integers\\r\\n\\t\\t\\t\\t\\t\\t//find the largest max char value\\r\\n\\t\\t\\t\\t\\t\\tif (Integer.parseInt(columns1.get(j).get(1)) >= Integer.parseInt(columns2.get(j).get(1))) {\\r\\n\\t\\t\\t\\t\\t\\t\\tlargestChar = Integer.parseInt(new String(columns1.get(j).get(1)));\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\telse { \\r\\n\\t\\t\\t\\t\\t\\t\\tlargestChar = Integer.parseInt(columns2.get(j).get(1)); \\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t//keep the type as integer\\r\\n\\t\\t\\t\\t\\telse { \\r\\n\\t\\t\\t\\t\\t\\tlargestChar = -1; \\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t//use the name from the first table and largest char max\\r\\n\\t\\t\\t\\t\\tnewColumn.add(new String(columns1.get(j).get(0)));\\r\\n\\t\\t\\t\\t\\tnewColumn.add(String.valueOf(largestChar));\\r\\n\\t\\t\\t\\t\\tunion.add(newColumn);\\r\\n\\t\\t\\t\\t\\t//check if there are equal rows to avoid duplicates\\r\\n\\t\\t\\t\\t\\tint colCount = 0;\\r\\n\\t\\t\\t\\t\\tfor (int n = 2; n < columns1.get(colCount).size(); n++) {\\t//for each row in table1\\r\\n\\t\\t\\t\\t\\t\\tunion.get(j).add(new String(columns1.get(j).get(n)));\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\t\\t\\r\\n\\t\\t\\tfor(int t = 2; t<columns2.get(0).size(); t++){\\t//column2 row\\r\\n\\t\\t\\t\\tboolean completeUniqe = true;\\r\\n\\t\\t\\t\\tfor(int p = 2; p < union.get(0).size(); p++){// rows of union\\r\\n\\t\\t\\t\\t\\tint sameCount = 0;\\r\\n\\t\\t\\t\\t\\tfor(int u = 0; u<union.size(); u++){//columns of union\\r\\n\\t\\t\\t\\t\\t\\tif(columns2.get(u).get(t).equals(union.get(u).get(p))){\\r\\n\\t\\t\\t\\t\\t\\t\\tsameCount++;\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\tSystem.out.println(sameCount);\\r\\n\\t\\t\\t\\t\\tif(sameCount == union.size()){\\r\\n\\t\\t\\t\\t\\t\\tcompleteUniqe = false;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tif(completeUniqe){\\r\\n\\t\\t\\t\\t\\tfor(int u = 0; u<union.size(); u++){//columns of union\\r\\n\\t\\t\\t\\t\\t\\tunion.get(u).add(new String(columns2.get(u).get(t)));\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\treturn union;\\r\\n\\t}\",\n \"public void union(Vertex v1, Vertex v2) {\\n\\n // find the two vertices' path root\\n Vertex r1 = find(v1);\\n Vertex r2 = find(v2);\\n\\n // if the two roots are equal, just return\\n if(r1.equals(r2)){\\n return;\\n } else if(r1.getSize()>r2.getSize()){\\n // if the r1 path size is greater than r2\\n // just change the vertex 2's root to vertex 1\\n r2.setRoot(r1);\\n // increment the size of r1 set\\n r1.setSize(r2.getSize());\\n } else {\\n r1.setRoot(r2);\\n r2.setSize(r1.getSize());\\n }\\n \\n }\",\n \"public NodeUnion<? extends ClassBodyNode> getUnionForBody();\",\n \"int[] union(int s1,int t1,int s2,int t2)\\r\\n\\t{\\r\\n\\t\\tint [] st=new int[2];\\r\\n\\t\\t//Please fill in the program here\\r\\n\\t\\tst[0] = incCapacity();\\r\\n\\t\\taddEdge(st[0], epssymbol, s1);\\r\\n\\t\\taddEdge(st[0], epssymbol, s2);\\r\\n\\t\\tst[1] = incCapacity();\\r\\n\\t\\taddEdge(t1, epssymbol, st[1]);\\r\\n\\t\\taddEdge(t2, epssymbol, st[1]);\\r\\n\\r\\n\\t\\treturn st;\\r\\n\\t}\",\n \"public T union( T obj1, T obj2 )\\n {\\n // Find the root of each object; if either is not contained, the root\\n // value will be null, and we throw an exception.\\n Node root1 = getRoot(nodes.get(obj1));\\n Node root2 = getRoot(nodes.get(obj2));\\n if ( root1 == null && root2 == null )\\n throw new NoSuchElementException( \\\"Sets do not contain either object: \\\" + obj1 + \\\", \\\" + obj2 );\\n if ( root1 == null )\\n throw new NoSuchElementException( \\\"Sets do not contain object: \\\" + obj1 );\\n if ( root2 == null )\\n throw new NoSuchElementException( \\\"Sets do not contain object: \\\" + obj2 );\\n // If already were in same set, just return data from the root of that\\n // set.\\n if ( root1 == root2 )\\n return root1.data;\\n // If not already, then doing union reduces overall number of sets.\\n numSets-- ;\\n // We use root2 as the new parent if either (a) the trees containing\\n // both inputs have same rank and a \\\"coin toss\\\" settles on this case,\\n // or (b) the tree containing obj1 has lower rank.\\n if ( ( root1.rank == root2.rank && Math.random() < 0.5 ) || root1.rank < root2.rank )\\n {\\n // When we link root1 to root2, size of set under root2 inreases.\\n root1.parent = root2;\\n root2.size += root1.size;\\n \\n // When we union two sets of same rank, new root gets higher rank.\\n if ( root1.rank == root2.rank )\\n root2.rank++ ;\\n \\n return root2.data;\\n }\\n else\\n // We use root1 as the new parent if either (a) the trees containing\\n // both inputs have same rank and a \\\"coin toss\\\" settles on this\\n // case, or (b) the tree containing obj2 has lower rank.\\n {\\n // When we link root1 to root2, size of set under root2 inreases.\\n root2.parent = root1;\\n root1.size += root2.size;\\n \\n // When we union two sets of same rank, new root gets higher rank.\\n if ( root1.rank == root2.rank )\\n root1.rank++ ;\\n \\n return root1.data;\\n }\\n }\",\n \"void union(int [] parent, int x, int y)\\n\\t\\t{\\n\\t\\t\\tint x_set_parent = find(parent, x);\\n\\t\\t\\tint y_set_parent = find(parent, y);\\n\\t\\t\\tparent[y_set_parent] = x_set_parent;\\n\\t\\t}\",\n \"public void union(Shape s);\",\n \"private void union_Cells(int c1, int c2) {\\r\\n\\t\\twhile (cells[c1] >= 0)\\r\\n\\t\\t\\tc1 = cells[c1];\\r\\n\\t\\twhile (cells[c2] >= 0)\\r\\n\\t\\t\\tc2 = cells[c2];\\r\\n\\r\\n\\t\\t// the depth of the tree with c2 is deepper than Tc1, Tc1 attach to Tc2\\r\\n\\t\\tif (cells[c1] > cells[c2]) {\\r\\n\\t\\t\\tcells[c1] = c2;\\r\\n\\t\\t} else {\\r\\n\\t\\t\\tif (cells[c1] == cells[c2])\\r\\n\\t\\t\\t\\tcells[c1]--;\\r\\n\\t\\t\\tcells[c2] = c1;\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public static void main( String [ ] args )\\r\\n {\\r\\n \\r\\n \\t\\r\\n \\t\\r\\n \\tint maze_row=0;\\r\\n \\tint maze_column=0;\\r\\n \\t\\r\\n\\t\\t\\r\\n\\t\\tScanner type = new Scanner(System.in);\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t\\tdo\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\ttry \\r\\n\\t\\t\\t\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tSystem.out.print(\\\"Please enter number of row between 1 and 20: \\\");\\r\\n\\t\\t\\t\\tmaze_row = Integer.valueOf(type.next());\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tcatch (NumberFormatException e)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\t//System.out.println(\\\"Input didn't match with the requirement: Try Again\\\");\\r\\n\\t\\t\\t\\tmaze_row=21;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\twhile(maze_row>20 || maze_row<1);\\r\\n\\t\\tdo\\r\\n\\t\\t{\\r\\n\\t\\ttry \\r\\n\\t\\t\\r\\n\\t\\t{\\r\\n\\t\\t\\tSystem.out.print(\\\"Please enter number of column between 1 and 20: \\\");\\r\\n\\t\\t\\tmaze_column = Integer.valueOf(type.next());\\r\\n\\t\\t}\\r\\n\\t\\tcatch (NumberFormatException e)\\r\\n\\t\\t{\\r\\n\\t\\t\\t//System.out.println(\\\"Input didn't match with the requirement: Try Again\\\");\\r\\n\\t\\t\\tmaze_column=21;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\t}\\r\\n\\twhile(maze_column>20 ||maze_column<1);\\r\\n\\t\\t\\r\\n\\t\\ttype.close();\\r\\n\\t\\tSystem.out.println();\\r\\n \\tcreateMaze(maze_row,maze_column);\\r\\n \\tshowMaze();\\r\\n \\t\\r\\n \\t\\r\\n \\t\\r\\n \\t\\r\\n \\t\\r\\n \\t\\r\\n \\t\\r\\n \\t\\r\\n \\t/* int NumElements = 128;\\r\\n int NumInSameSet = 16;\\r\\n\\r\\n DisjSets ds = new DisjSets( NumElements );\\r\\n int set1, set2;\\r\\n\\r\\n for( int k = 1; k < NumInSameSet; k *= 2 )\\r\\n {\\r\\n for( int j = 0; j + k < NumElements; j += 2 * k )\\r\\n {\\r\\n set1 = ds.find( j );\\r\\n set2 = ds.find( j + k );\\r\\n ds.union( set1, set2 );\\r\\n }\\r\\n }\\r\\n\\r\\n for( int i = 0; i < NumElements; i++ )\\r\\n {\\r\\n System.out.print( ds.find( i )+ \\\"*\\\" );\\r\\n if( i % NumInSameSet == NumInSameSet - 1 )\\r\\n System.out.println( );\\r\\n }\\r\\n System.out.println( );*/\\r\\n }\",\n \"void Union(subset [] subsets, int x , int y ){ \\n\\t\\tint xroot = find(subsets, x); \\n\\t int yroot = find(subsets, y); \\n\\t \\n\\t\\tif (subsets[xroot].rank < subsets[yroot].rank) \\n\\t\\t\\tsubsets[xroot].parent = yroot; \\n\\t\\telse if (subsets[yroot].rank < subsets[xroot].rank) \\n\\t\\t\\tsubsets[yroot].parent = xroot; \\n\\t\\telse{ \\n\\t\\t\\tsubsets[xroot].parent = yroot; \\n\\t\\t\\tsubsets[yroot].rank++; \\n\\t\\t} \\n\\t}\",\n \"List<ProtocolPo> queryByUnion(ProtocolPo query);\",\n \"private void addUpBlock(Position p, TETile te,\\n int len, int leftWid, int rightWid) {\\n int x = p.x;\\n int y = p.y;\\n for (int j = y; j < y + len; j += 1) {\\n for (int i = x - leftWid; i < x + rightWid + 1; i += 1) {\\n world[i][j] = te;\\n }\\n }\\n }\",\n \"public Iteratable<IRNode> bottomUp(IRNode subtree);\",\n \"public static void union(int u, int v) {\\n\\t\\tu = root(u); // optimizations\\n\\t\\tv = root(v); // to make find faster\\n\\t\\tif (u == v) return; // already in same component\\n\\t\\t\\n\\t\\tif (size[u] >= size[v]) {\\n\\t\\t\\tp[v] = u;\\n\\t\\t\\tsize[u] += size[v];\\n\\t\\t} else {\\n\\t\\t\\tp[u] = v;\\n\\t\\t\\tsize[v] += size[u];\\n\\t\\t}\\n\\t}\",\n \"void Union(int parent[], int x, int y){ \\n int xset = find(parent, x); \\n int yset = find(parent, y); \\n parent[xset] = yset; \\n }\",\n \"static void builtVertical(Room one, Room two, WorldFrame world) {\\n Random ran = world.rand();\\n int len;\\n int y;\\n int smallestRWallX = Math.min(one.rEdge(), two.rEdge());\\n int largestX = Math.max(one.getX(), two.getX());\\n if (one.tWall() < two.getY()) {\\n len = two.getY() - one.tWall();\\n y = one.tWall();\\n } else if (two.tWall() < one.getY()) { // two.TWall() < one.getY()\\n len = one.getY() - two.tWall();\\n y = two.tWall();\\n } else {\\n return;\\n\\n }\\n int x = RandomUtils.uniform(ran, largestX, smallestRWallX + 1);\\n\\n\\n if (len > 0) {\\n world.hallwaysSet().add(new Hallway(x, y, Direction.UP, len, world));\\n }\\n }\",\n \"public Bag union(Bag u) {\\n return u;\\n }\",\n \"private void BuildUp(int towerToBuild, int towerTarget, int bottomSize) {\\n\\t\\t\\n\\t\\tint notTowerTarget = getOtherTower(towerToBuild,towerTarget);\\n\\n\\t\\twhile( towerSet.TopBlock(towerToBuild) > 1 ) {\\n\\t\\t\\tif(towerSet.TopBlock(towerTarget) == towerSet.TopBlock(towerToBuild) - 1) {\\n\\t\\t\\t\\ttowerSet.MoveBlock(towerTarget,towerToBuild);\\n\\t\\t\\t\\tturnNumber++;\\n\\t\\t\\t\\tSystem.out.println(this.toString());\\n\\t\\t\\t}\\n\\t\\t\\telse if(towerSet.TopBlock(notTowerTarget) == towerSet.TopBlock(towerToBuild) - 1) {\\n\\t\\t\\t\\ttowerSet.MoveBlock(notTowerTarget,towerToBuild);\\n\\t\\t\\t\\tturnNumber++;\\n\\t\\t\\t\\tSystem.out.println(this.toString());\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tif(towerSet.TopBlock(towerTarget) == 1 ) {\\n\\t\\t\\t\\t\\tthis.BreakDown(towerTarget, towerToBuild, towerSet.TopBlock(towerToBuild) - 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tthis.BreakDown(notTowerTarget, towerToBuild, towerSet.TopBlock(towerToBuild) - 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"public void union(int p, int q) {\\n int i = root(p);\\n int j = root(q);\\n \\n if( i == j) {\\n return;\\n }\\n \\n id[i] = j;\\n count--;\\n }\",\n \"private void parseTerrain(Region region, ByteBuffer mapBuffer, int x, int y, Set<Integer> downHeights) {\\n\\t\\tint[][][] attributes = new int[4][64][64];\\n\\n\\t\\tfor (int height = 0; height < 4; height++) {\\n\\t\\t\\tfor (int localX = 0; localX < 64; localX++) {\\n\\t\\t\\t\\tfor (int localY = 0; localY < 64; localY++) {\\n\\t\\t\\t\\t\\twhile (true) {\\n\\t\\t\\t\\t\\t\\tint attributeId = mapBuffer.get() & 0xFF;\\n\\t\\t\\t\\t\\t\\tif (attributeId == 0) {\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tif (attributeId == 1) {\\n\\t\\t\\t\\t\\t\\t\\tmapBuffer.get();\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tif (attributeId <= 49) {\\n\\t\\t\\t\\t\\t\\t\\tmapBuffer.get();\\n\\t\\t\\t\\t\\t\\t} else if (attributeId <= 81) {\\n\\t\\t\\t\\t\\t\\t\\tattributes[height][localX][localY] = attributeId - 49;\\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\\n\\t\\tfor (int height = 0; height < 4; height++) {\\n\\t\\t\\tfor (int localX = 0; localX < 64; localX++) {\\n\\t\\t\\t\\tfor (int localY = 0; localY < 64; localY++) {\\n\\n\\t\\t\\t\\t\\tif ((attributes[height][localX][localY] & 2) == 2) {\\n\\t\\t\\t\\t\\t\\tdownHeights.add(Position.hash(localX, localY, height));\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif ((attributes[height][localX][localY] & 1) == 1) {\\n\\t\\t\\t\\t\\t\\tint plane = height;\\n\\n\\t\\t\\t\\t\\t\\tif ((attributes[1][localX][localY] & 2) == 2) {\\n\\t\\t\\t\\t\\t\\t\\tdownHeights.add(Position.hash(localX, localY, 1));\\n\\t\\t\\t\\t\\t\\t\\tplane--;\\n\\t\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t\\tif (plane >= 0) {\\n\\t\\t\\t\\t\\t\\t\\tTraversalMap.block(region, plane, localX, localY);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"public static int[] bottomUpMergeSort(int[] num) {\\n\\n\\t\\tint[] temp = new int[num.length];\\n\\n\\t\\t// repeat merging process while width is smaller than length\\n\\t\\tfor (int width = 2; width <= num.length; width *= 2) {\\n\\n\\t\\t\\t// System.out.println(\\\"width = \\\" + width );\\n\\n\\t\\t\\t// merge sublists\\n\\t\\t\\tfor (int i = 0; i < num.length; i += width)\\n\\t\\t\\t\\tmergeLists(num, i, width, temp);\\n\\n\\t\\t\\t// copy temp array back to original array\\n\\t\\t\\tfor (int i = 0; i < num.length; i++) {\\n\\t\\t\\t\\tnum[i] = temp[i];\\n\\t\\t\\t\\t// System.out.print(num[i] + \\\" \\\");\\n\\t\\t\\t}\\n\\n\\t\\t\\t// System.out.println();\\n\\t\\t\\t// System.out.println();\\n\\t\\t}\\n\\n\\t\\treturn num;\\n\\n\\t}\",\n \"@Test\\r\\n public void testCreateUnion_OneAndOne() {\\r\\n Tour tourA = new Tour(new int[][]{{1, 1}});\\r\\n Tour tourB = new Tour(new int[][]{{12, 12}});\\r\\n Tour result = tourA.createUnion(tourB);\\r\\n Tour expected = new Tour(new int[][]{{1, 1}, {12, 12}});\\r\\n assertTrue(result.toString(), expected.isEqual(result));\\r\\n }\",\n \"void union(int level, Taint<E> tag) {\\n if (containsKey(level)) {\\n get(level).setUnion(tag);\\n } else {\\n set(level, new Node<>(tag, null));\\n }\\n }\",\n \"public void open(int i, int j){\\n\\t\\tif(i<=0 || i>this.gridLength || j<=0 || j>this.gridLength){\\n\\t\\t\\tthrow new IndexOutOfBoundsException();\\n\\t\\t}\\n\\t\\tint N = this.gridLength;\\n\\t\\t\\n\\t\\t/*opens argument site is previously unopened and also connects to neighboring open sites\\n\\t\\twhile also updating its connectedness to the bottom row indices*/\\n\\t\\tif(this.idGrid[(i-1)*N + j] == false){\\n\\t\\t\\tthis.idGrid[(i-1)*N + j] = true;\\n\\t\\t\\tboolean connectBottom = this.bottom[(i-1)*N + j];\\n\\t\\t\\tif(i-1>0){\\n\\t\\t\\t\\tif(idGrid[(i-2)*N + j] == true){\\n\\t\\t\\t\\t\\tif(this.bottom[this.unionTest.find((i - 2)*N + j)] == true){\\n\\t\\t\\t\\t\\t\\tconnectBottom = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tunionTest.union((i-1)*N + j, (i-2)*N + j);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(i+1<=this.gridLength){\\n\\t\\t\\t\\tif(idGrid[(i)*N + j] == true){\\n\\t\\t\\t\\t\\tif(this.bottom[this.unionTest.find((i)*N + j)] == true){\\n\\t\\t\\t\\t\\t\\tconnectBottom = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tunionTest.union((i-1)*N + j, (i)*N + j);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(j-1>0){\\n\\t\\t\\t\\tif(idGrid[(i-1)*N + j - 1] == true){\\n\\t\\t\\t\\t\\tif(this.bottom[(this.unionTest.find((i-1)*N + j - 1))] == true){\\n\\t\\t\\t\\t\\t\\tconnectBottom = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tunionTest.union((i-1)*N + j, (i-1)*N + j-1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(j+1<=this.gridLength){\\n\\t\\t\\t\\tif(idGrid[(i-1)*N + j + 1] == true){\\n\\t\\t\\t\\t\\tif(this.bottom[this.unionTest.find((i-1)*N + j + 1)] == true){\\n\\t\\t\\t\\t\\t\\tconnectBottom = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tunionTest.union((i-1)*N + j, (i-1)*N + j+1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t//update root status\\n\\t\\t\\tif(this.bottom[this.unionTest.find((i-1)*N + j)] != true){\\n\\t\\t\\t\\tthis.bottom[this.unionTest.find((i-1)*N + j)] = connectBottom;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"@Test\\n public void testMatchLimitOneTopDown() throws Exception {\\n\\n HepProgramBuilder programBuilder = HepProgram.builder();\\n programBuilder.addMatchOrder( HepMatchOrder.TOP_DOWN );\\n programBuilder.addMatchLimit( 1 );\\n programBuilder.addRuleInstance( UnionToDistinctRule.INSTANCE );\\n\\n checkPlanning( programBuilder.build(), UNION_TREE );\\n }\",\n \"public void open(int row, int col){\\n\\t\\tif (row <= 0 || col <= 0 || row > storeVar || col > storeVar) \\n\\t\\t\\tthrow new IllegalArgumentException(\\\"row index i out of bounds\\\");\\n\\n\\t\\t// System.out.println(\\\"\\\\n We're opening again! \\\");\\n\\t\\tint currIndex = ((row-1)*storeVar) + col;\\n\\n\\t\\tif (isOpen(row, col)) return;\\n\\t\\topenSites++;\\n\\t\\tgrid[currIndex] = true;\\n\\n\\n\\t\\tif (currIndex < storeVar+1 ){\\n\\t\\t\\tunionFind.union(currIndex, virtualTop);\\n\\t\\t\\tbackwash.union(currIndex, virtualTop);\\n\\t\\t\\tfullgrid[currIndex] = true;\\n\\t\\t}\\n\\t\\tif ((currIndex < grid.length - 1) && (currIndex >= (grid.length - 1 - storeVar))){\\n\\t\\t\\t// System.out.println(\\\"Confirmed that bottom is connected\\\");\\n\\t\\t\\tunionFind.union(currIndex, virtualBottom);\\n\\t\\t}\\n\\n\\t\\t\\n\\t\\tif(row + 1 <= storeVar && isOpen(row + 1, col)){\\n\\t\\t\\tif (!unionFind.connected(currIndex, currIndex+storeVar)) {\\n\\t\\t\\t\\tunionFind.union(currIndex, currIndex+storeVar);\\n\\t\\t\\t\\tbackwash.union(currIndex, currIndex+storeVar);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(col + 1 <= storeVar && isOpen(row , col+1)){\\n\\t\\t\\tif (!unionFind.connected(currIndex, currIndex+1)) {\\n\\t\\t\\t\\tunionFind.union(currIndex, currIndex+1);\\n\\t\\t\\t\\tbackwash.union(currIndex, currIndex+1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(row - 1 > 0 && isOpen(row - 1, col)){\\n\\t\\t\\tif (!unionFind.connected(currIndex, currIndex-storeVar)){ \\n\\t\\t\\t\\tunionFind.union(currIndex, currIndex-storeVar);\\n\\t\\t\\t\\tbackwash.union(currIndex, currIndex-storeVar);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(col - 1 > 0 && isOpen(row , col-1)){\\n\\t\\t\\tif (!unionFind.connected(currIndex, currIndex-1)){\\n\\t\\t\\t unionFind.union(currIndex, currIndex-1);\\n\\t\\t\\t backwash.union(currIndex, currIndex-1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"public void moveToHeight(double height) {\\n\\t\\t//Sin(theta) = height/length\\n\\t\\t//angleSetpoint = Math.toDegrees(Math.asin(height/Constants.BreachArm.ARM_LENGTH));\\n\\t}\",\n \"@Override\\n public void generateMaze() {\\n //Opens up the entrance to the maze\\n MazeCell current=maze[0][0];\\n current.openWall(Directions.North.getBValue());\\n\\n //A list of sets. The sets contain the cells which can be accessed from one another.\\n List<List<MazeCell>> sets=new LinkedList<>();\\n //All the walls in the maze\\n List<InnerWall> wallList=new LinkedList<>();\\n //Initially create a set for each cell\\n //Also add the walls to the list\\n for(int row=0;row< maze.length;row++){\\n for(int column=0;column<maze[0].length;column++){\\n sets.add(Arrays.asList(maze[row][column]));\\n List<MazeCell> valid=returnValidNeighbours(maze[row][column].getX(), maze[row][column].getY());\\n for(int i=0;i<valid.size();i++){\\n wallList.add(new InnerWall(maze[row][column], valid.get(i)));\\n }\\n }\\n }\\n //Now we have as many wall sets as maze cells, each containing four walls.\\n\\n Random rnd=new Random();\\n int idx;\\n //Loops until only one set remains, meaning all cells can be reached from any cell\\n while(sets.size()!=1){\\n //Select a random wall\\n idx=wallList.size()>1 ? rnd.nextInt(wallList.size()) : 0;\\n InnerWall w= wallList.get(idx);\\n //The two neighbouring cells\\n MazeCell c1=w.parent;\\n MazeCell c2=w.connected;\\n\\n //Their relative directions\\n Directions d=Directions.getOffsetDirection(c1.getX(),c1.getY(),c2.getX(),c2.getY());\\n\\n //Check if the two cells are already connected\\n if((c1.getOpenWalls() % d.getBValue())==d.getBValue())\\n continue;\\n\\n //Two new sets\\n List<MazeCell> set1=null;\\n List<MazeCell> set2=null;\\n //We get the sets\\n boolean b1,b2;\\n b1=b2=false;\\n //We loop through the set of sets looking for the two which contains the two cells\\n for(List<MazeCell> list : sets) {\\n if(list.contains(c1)){\\n set1=list;\\n b1=true;\\n }\\n if(list.contains(c2)) {\\n set2=list;\\n b2=true;\\n }\\n if(b1 && b2)\\n break;\\n }\\n //If the two sets are disjoint then we join them together\\n if(set1!=null && set2!=null && !set1.equals(set2)){\\n\\n //We connect the two cells\\n c1.openWall(d.getBValue());\\n c2.openOppositeWall(d.getBValue());\\n\\n if(sleepDrawTime>0) {\\n try {\\n Thread.sleep(sleepDrawTime);\\n mf.repaint();\\n } catch (InterruptedException e) {\\n e.printStackTrace();\\n }\\n }\\n\\n //Join the two sets\\n List<MazeCell> temp= Stream.concat(set1.stream(), set2.stream())\\n .collect(Collectors.toList());\\n sets.remove(set2);\\n sets.remove(set1);\\n sets.add(temp);\\n }\\n //We remove the wall from the list\\n wallList.remove(w);\\n //As the walls are double-sided, two cells share a wall, we have to find the opposite cell's wall in the list\\n InnerWall oppositeWall=wallList.stream().filter((x)->x.parent==w.connected).findFirst().orElse(null);\\n wallList.remove(oppositeWall);\\n\\n\\n }\\n //We open an exit in the last row.\\n maze[maze.length-1][rnd.nextInt(maze[0].length)].openWall(Directions.South.getBValue());\\n\\n }\",\n \"@Test void testInterpretUnion() {\\n rootSchema.add(\\\"simple\\\", new ScannableTableTest.SimpleTable());\\n final String sql = \\\"select * from \\\\\\\"simple\\\\\\\"\\\\n\\\"\\n + \\\"union\\\\n\\\"\\n + \\\"select * from \\\\\\\"simple\\\\\\\"\\\";\\n sql(sql).returnsRowsUnordered(\\\"[0]\\\", \\\"[10]\\\", \\\"[20]\\\", \\\"[30]\\\");\\n }\",\n \"@Override\\r\\n public void generateMaze(int width, int height) {\\r\\n s=null;\\r\\n threadPool.execute(() -> {\\r\\n try {\\r\\n Client client = new Client(InetAddress.getLocalHost(), 5400, new IClientStrategy() {\\r\\n public void clientStrategy(InputStream inFromServer, OutputStream outToServer) {\\r\\n try {\\r\\n ObjectOutputStream toServer = new ObjectOutputStream(outToServer);\\r\\n ObjectInputStream fromServer = new ObjectInputStream(inFromServer);\\r\\n toServer.flush();\\r\\n int[] mazeDimensions = new int[]{width, height};\\r\\n toServer.writeObject(mazeDimensions);\\r\\n toServer.flush();\\r\\n byte[] compressedMaze = (byte[]) fromServer.readObject();\\r\\n InputStream is = new MyDecompressorInputStream(new ByteArrayInputStream(compressedMaze));\\r\\n byte[] decompressedMaze = new byte[100000];\\r\\n is.read(decompressedMaze);\\r\\n Maze mymaze = new Maze(decompressedMaze);\\r\\n maze = mymaze;\\r\\n PlayerPositionRow = maze.getStartPosition().getRowIndex();\\r\\n PlayerPositionCol = maze.getStartPosition().getColIndex();\\r\\n goalPositionRow=maze.getGoalPosition().getRowIndex();\\r\\n goalPositionColumn=maze.getGoalPosition().getColIndex();\\r\\n } catch (Exception e) {\\r\\n e.printStackTrace();\\r\\n }\\r\\n }\\r\\n });\\r\\n client.communicateWithServer();\\r\\n try {\\r\\n Thread.sleep(5000);\\r\\n } catch (InterruptedException e) {\\r\\n e.printStackTrace();\\r\\n }\\r\\n setChanged();\\r\\n notifyObservers(\\\"maze\\\");\\r\\n } catch (UnknownHostException e) {\\r\\n e.printStackTrace();\\r\\n }\\r\\n });\\r\\n }\",\n \"public final void mT__63() throws RecognitionException {\\n try {\\n int _type = T__63;\\n int _channel = DEFAULT_TOKEN_CHANNEL;\\n // ../org.xtext.example.webgme_mtl/src-gen/org/xtext/example/webgme/parser/antlr/internal/InternalMTL.g:61:7: ( 'union' )\\n // ../org.xtext.example.webgme_mtl/src-gen/org/xtext/example/webgme/parser/antlr/internal/InternalMTL.g:61:9: 'union'\\n {\\n match(\\\"union\\\"); \\n\\n\\n }\\n\\n state.type = _type;\\n state.channel = _channel;\\n }\\n finally {\\n }\\n }\",\n \"@Test\\r\\n\\t\\tpublic void testUnion() {\\n\\t\\t\\ttestingSet = new IntegerSet(list1);\\r\\n\\t\\t\\ttestingSet2= new IntegerSet(list2);\\r\\n\\t\\t\\t// 3rd set =to the union of the two lists \\r\\n\\t\\t\\ttestingSet3= new IntegerSet(union);\\r\\n\\t\\t\\t// 4th set equal to the union of sets 1 and 2 \\r\\n\\t\\t\\ttestingSet4= testingSet.union(testingSet, testingSet2);\\r\\n\\t\\t\\t// sets 3 and 4 should be equal\\r\\n\\t\\t\\t// assertEquals method is deprecated \\r\\n\\t\\t\\tassertArrayEquals(testingSet3.toArray(),testingSet4.toArray());\\r\\n\\t\\t\\t \\r\\n\\t\\t}\",\n \"public void union(int p, int q) {\\n int pRoot = getRoot(p);\\n int qRoot = getRoot(q);\\n nodes[pRoot] = qRoot;\\n }\",\n \"public BSTSet union(BSTSet s) {\\n int[] thisArray = BSTToArray();\\n int[] sArray = s.BSTToArray();\\n int[] unionArray = new int[thisArray.length + sArray.length];\\n int unionArrayIndex = 0;\\n\\n // add both arrays together\\n for (int i = 0; i < thisArray.length; i++) {\\n unionArray[unionArrayIndex++] = thisArray[i];\\n }\\n\\n for (int i = 0; i < sArray.length; i++) {\\n unionArray[unionArrayIndex++] = sArray[i];\\n }\\n\\n return new BSTSet(unionArray);\\n }\",\n \"@Test\\r\\n public void testHeightAddNodesRight(){\\r\\n \\ttree.add(\\\"g\\\");\\r\\n \\ttree.add(\\\"f\\\");\\r\\n \\ttree.add(\\\"e\\\");\\r\\n \\tassertEquals(tree.height(),2);\\r\\n \\t\\r\\n \\t//testing height of 3\\r\\n \\ttree.add(\\\"d\\\"); //height now 3, d is right\\r\\n \\tassertEquals(tree.height(), 3);\\r\\n \\t\\r\\n \\ttree.add(\\\"c\\\");\\r\\n \\ttree.add(\\\"b\\\"); \\r\\n \\ttree.add(\\\"a\\\"); \\r\\n \\tassertEquals(tree.height(),6); //last\\r\\n }\",\n \"private void moveUp()\\n {\\n // runs through column first, row second\\n for ( int column = 0; column < grid[0].length; column++) {\\n\\n // check is set to false, meaning no combinations have been made\\n boolean check = false;\\n for ( int row = 1; row < grid.length; row++) {\\n int compare = row;\\n if ( grid[compare][column] != 0 ) { \\n\\n // loop continues while there are still zero values above the current\\n // tile\\n while ( grid[compare-1][column] == 0 ) {\\n\\n // switches places of the current tile with the zero tile\\n grid[compare-1][column] = grid[compare][column];\\n grid[compare][column] = 0;\\n compare --;\\n\\n // if you reach the top of the board, break from the loop\\n if ( compare == 0 ){\\n break;\\n }\\n }\\n // if a combination was made on the previous loop, set check to false\\n if ( check == true ){\\n check = false;\\n }\\n // if a combination wasn't made on the previous loop and two tiles\\n // next to each other have the same value, combine them\\n else if ( compare!=0 && \\n grid[compare-1][column] == grid[compare][column] ) {\\n grid[compare-1][column] = 2*grid[compare-1][column];\\n grid[compare][column] = 0;\\n\\n // sets check to true to indicate a combination was made\\n check = true;\\n\\n // increases your score by the value of the combined tile\\n score+= grid[compare-1][column];\\n } \\n }\\n }\\n } \\n }\",\n \"public void union(int p, int q) {\\n\\t\\tint rootP = find(p);\\n\\t\\tint rootQ = find(q);\\n\\t\\tif (rootQ == rootP)\\n\\t\\t\\treturn;\\n\\t\\tid[rootQ] = rootP;\\n\\t\\tcount--;\\n\\t}\",\n \"public void uncover ()\\n {\\n for (DancingNode i=this.U; i!=this; i=i.U) // go up the column\\n {\\n for (DancingNode j=i.L; j!=i; j=j.L) // go left across the row \\n {\\n j.C.size++;\\n j.relinkUD();\\n }\\n }\\n this.relinkLR();\\n }\",\n \"public NodeUnion<? extends IdentifierListNode> getUnionForTargets();\",\n \"public PipeUnion<T> getUnion();\",\n \"public static void main(String[] args) throws IOException{\\n Scanner f = new Scanner(System.in);\\n //BufferedReader f = new BufferedReader(new FileReader(\\\"uva.in\\\"));\\n //BufferedReader f = new BufferedReader(new InputStreamReader(System.in));\\n PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\\n while(true) {\\n int C = f.nextInt();\\n int R = f.nextInt();\\n if(C == 0 && R == 0) {\\n break;\\n }\\n HashMap<String,Integer> getIndex = new HashMap<>();\\n for(int i = 0; i < C; i++) {\\n getIndex.put(f.next(),i);\\n }\\n int[] leaderIds = new int[C];\\n int[] groupSizes = new int[C];\\n for(int i = 0; i < C; i++) {\\n leaderIds[i] = i;\\n groupSizes[i] = 1;\\n }\\n for(int i = 0; i < R; i++) {\\n int p = getIndex.get(f.next());\\n int q = getIndex.get(f.next());\\n if(root(leaderIds,p) != root(leaderIds,q)) {\\n union(leaderIds,groupSizes,p,q);\\n }\\n }\\n int max = 0;\\n for(int i = 0; i < C; i++) {\\n int p = root(leaderIds,i);\\n max = Math.max(max,groupSizes[p]);\\n }\\n out.println(max);\\n }\\n f.close();\\n out.close();\\n }\",\n \"static\\nint\\nprintUnion(\\nint\\narr1[], \\nint\\narr2[], \\nint\\nm, \\nint\\nn) \\n\\n{ \\n\\nint\\ni = \\n0\\n, j = \\n0\\n; \\n\\nwhile\\n(i < m && j < n) \\n\\n{ \\n\\nif\\n(arr1[i] < arr2[j]) \\n\\nSystem.out.print(arr1[i++]+\\n\\\" \\\"\\n); \\n\\nelse\\nif\\n(arr2[j] < arr1[i]) \\n\\nSystem.out.print(arr2[j++]+\\n\\\" \\\"\\n); \\n\\nelse\\n\\n{ \\n\\nSystem.out.print(arr2[j++]+\\n\\\" \\\"\\n); \\n\\ni++; \\n\\n} \\n\\n} \\n\\n\\n/* Print remaining elements of \\n\\nthe larger array */\\n\\nwhile\\n(i < m) \\n\\nSystem.out.print(arr1[i++]+\\n\\\" \\\"\\n); \\n\\nwhile\\n(j < n) \\n\\nSystem.out.print(arr2[j++]+\\n\\\" \\\"\\n); \\n\\n\\nreturn\\n0\\n; \\n\\n}\",\n \"@Test\\n public void testSolveGivenMazeTwice() {\\n try {\\n //link row 1\\n largeMaze.linkPillars(Maze.position(0, 0), Maze.position(1, 0));\\n largeMaze.linkPillars(Maze.position(1, 0), Maze.position(2, 0));\\n largeMaze.linkPillars(Maze.position(2, 0), Maze.position(3, 0));\\n largeMaze.linkPillars(Maze.position(3, 0), Maze.position(4, 0));\\n largeMaze.linkPillars(Maze.position(1, 0), Maze.position(1, 1));\\n\\n //link row 2\\n largeMaze.linkPillars(Maze.position(1, 1), Maze.position(2, 1));\\n largeMaze.linkPillars(Maze.position(1, 1), Maze.position(1, 2));\\n largeMaze.linkPillars(Maze.position(3, 1), Maze.position(4, 1));\\n\\n //link row 3\\n largeMaze.linkPillars(Maze.position(1, 2), Maze.position(1, 3));\\n largeMaze.linkPillars(Maze.position(1, 2), Maze.position(2, 2));\\n\\n //link row 4\\n largeMaze.linkPillars(Maze.position(1, 3), Maze.position(0, 3));\\n largeMaze.linkPillars(Maze.position(1, 3), Maze.position(2, 3));\\n largeMaze.linkPillars(Maze.position(3, 3), Maze.position(4, 3));\\n largeMaze.linkPillars(Maze.position(0, 3), Maze.position(0, 4));\\n\\n //link row 5\\n largeMaze.linkPillars(Maze.position(0, 4), Maze.position(1, 4));\\n largeMaze.linkPillars(Maze.position(1, 4), Maze.position(2, 4));\\n largeMaze.linkPillars(Maze.position(2, 4), Maze.position(3, 4));\\n largeMaze.linkPillars(Maze.position(3, 4), Maze.position(4, 4));\\n\\n //set beginning and end\\n largeMaze.setBegin(Maze.position(0, 0));\\n largeMaze.setEnd(Maze.position(4, 4));\\n shortestPath = MazeSolver.pStar(largeMaze, 25);\\n shortestPath2 = MazeSolver.pStar(largeMaze, 25);\\n\\n assertEquals(9, shortestPath.size());\\n\\n assertEquals(shortestPath.size(), shortestPath2.size());\\n\\n assertEquals(\\\"<0, 0>\\\", shortestPath.get(0).getCoordinateString());\\n assertEquals(\\\"<1, 0>\\\", shortestPath.get(1).getCoordinateString());\\n assertEquals(\\\"<1, 1>\\\", shortestPath.get(2).getCoordinateString());\\n assertEquals(\\\"<1, 2>\\\", shortestPath.get(3).getCoordinateString());\\n assertEquals(\\\"<1, 3>\\\", shortestPath.get(4).getCoordinateString());\\n assertEquals(\\\"<1, 4>\\\", shortestPath.get(5).getCoordinateString());\\n assertEquals(\\\"<2, 4>\\\", shortestPath.get(6).getCoordinateString());\\n assertEquals(\\\"<3, 4>\\\", shortestPath.get(7).getCoordinateString());\\n assertEquals(\\\"<4, 4>\\\", shortestPath.get(8).getCoordinateString());\\n\\n assertEquals(\\\"<0, 0>\\\", shortestPath2.get(0).getCoordinateString());\\n assertEquals(\\\"<0, 1>\\\", shortestPath2.get(1).getCoordinateString());\\n assertEquals(\\\"<0, 2>\\\", shortestPath2.get(2).getCoordinateString());\\n assertEquals(\\\"<0, 3>\\\", shortestPath2.get(3).getCoordinateString());\\n assertEquals(\\\"<0, 4>\\\", shortestPath2.get(4).getCoordinateString());\\n assertEquals(\\\"<1, 4>\\\", shortestPath2.get(5).getCoordinateString());\\n assertEquals(\\\"<2, 4>\\\", shortestPath2.get(6).getCoordinateString());\\n assertEquals(\\\"<3, 4>\\\", shortestPath2.get(7).getCoordinateString());\\n assertEquals(\\\"<4, 4>\\\", shortestPath2.get(8).getCoordinateString());\\n\\n } catch (Exception e) {\\n fail(\\\"Unexpected exception was thrown while linking pillars.\\\");\\n }\\n }\",\n \"@Test\\n\\tpublic void testUnionSLLSetArrayAll0() {\\n\\n\\t\\tint[] arr1 = { 0, 0, 0 };\\n\\t\\tint[] arr2 = { 0, 0, 0, 0 };\\n\\t\\tint[] arr3 = { 0, 0 };\\n\\t\\tint[] arr4 = { 0, 0 };\\n\\t\\tSLLSet listObj100 = new SLLSet(arr1);\\n\\t\\tSLLSet listObj99 = new SLLSet(arr2);\\n\\t\\tSLLSet listObj98 = new SLLSet(arr3);\\n\\t\\tSLLSet listObj97 = new SLLSet(arr4);\\n\\t\\tSLLSet listObj96 = new SLLSet();\\n\\t\\tSLLSet[] Array = { listObj100, listObj99, listObj98, listObj97, listObj96 }; // test static SLLSet union(sArray)\\n\\n\\t\\tSLLSet listObj23 = SLLSet.union(Array);\\n\\n\\t\\tString expected = \\\"0\\\";\\n\\t\\tint expectedSize = 1;\\n\\n\\t\\tassertEquals(expectedSize, listObj23.getSize());\\n\\t\\tassertEquals(expected, listObj23.toString());\\n\\n\\t}\",\n \"public ArrBag<T> union( ArrBag<T> other )\\n {\\n ArrBag<T> unionArray = new ArrBag<T>(other.size() + this.size()); \\n\\n int unionCount = 0; \\n for (int i = 0; i <this.size(); i++ ){\\n unionArray.add(this.get(i));\\n unionCount++;\\n } for (int i = 0; i<other.size(); i++){\\n if (!unionArray.contains(other.get(i))){\\n unionArray.add(other.get(i));\\n unionCount ++;\\n }\\n }\\n return unionArray;\\n }\",\n \"public DrawMaze(int w, int h) {\\n width = w;\\n height = h;\\n setPreferredSize(new Dimension(width * SIZE + 2 * BORDER + WALL, \\n height * SIZE + 2 * BORDER + WALL));\\n walls = new HashSet<Wall>();\\n }\",\n \"@Test\\r\\n public void testUnion1() {\\r\\n int actual[] = set1.unionOfSets(set2);\\r\\n Assert.assertArrayEquals(new int[] { 1, 2, 3, 4, 5 }, actual);\\r\\n }\",\n \"private void clearHeight() {\\n bitField0_ = (bitField0_ & ~0x00000008);\\n height_ = 0L;\\n }\",\n \"private void newHeightCame(int height,int p){\\n\\t\\tif(hStack.isEmpty()||hStack.peek()<height){\\n\\t\\t\\t//just add\\n\\t\\t}else if(hStack.peek()>height){\\n\\t\\t\\t//pop and calc first, then at last , also add ;\\n\\t\\t\\tstackPopElements(height,p);\\t\\n\\t\\t}\\n\\t\\t\\n\\t\\thStack.push(height);\\n\\t\\tpStack.push(p);\\n//\\t\\tSystem.out.println(\\\" ++++++++++++++ push height\\\"+height+\\\" position: \\\"+p+\\\" after thsi , : \\\"+pStack.peek()+\\\" size: \\\"+pStack.size());\\n\\t}\",\n \"public void union( int root1, int root2 )\\n {\\n s[ root2 ] = root1;\\n }\",\n \"public void setBestHeight() { setHeight(getBestHeight()); }\",\n \"protected void merge(FlowGraphNode victim){\\r\\n for(FlowGraphNode node : victim.to){\\r\\n this.addTo(node);\\r\\n node.from.remove(victim);\\r\\n }\\r\\n for(FlowGraphNode node : victim.from){\\r\\n node.addTo(this);\\r\\n node.to.remove(victim);\\r\\n }\\r\\n }\",\n \"void maze(char[][] mz, int p_row, int p_col, int h_row, int h_col){\\n \\n if (mz[p_row][p_col] == 'F'){\\n //Base case -End maze\\n printMaze(mz);\\n System.out.println(\\\"Maze Successfully Completed!\\\");\\n } else {\\n if (h_row-1 == p_row){\\n //If facing East\\n if(mz[h_row][h_col] != '#'){ //If right turn available\\n //Update player\\n mz[p_row][p_col] = 'X'; \\n p_row += 1;\\n p_col += 0;\\n if (mz[p_row][p_col] == 'F'){\\n mz[p_row][p_col] = 'F';\\n } else {\\n mz[p_row][p_col] = 'O';\\n }\\n //Update hand\\n h_row += 0;\\n h_col -= 1;\\n printMaze(mz); \\n } else { \\n //If hand position is a wall check in front of player\\n if(mz[p_row][p_col+1] != '#'){\\n //Update player\\n mz[p_row][p_col] = 'X';\\n p_row += 0;\\n p_col += 1;\\n if (mz[p_row][p_col] == 'F'){\\n mz[p_row][p_col] = 'F';\\n } else {\\n mz[p_row][p_col] = 'O';\\n }\\n //Update hand\\n h_row += 0;\\n h_col += 1;\\n printMaze(mz);\\n } else if (mz[p_row-1][p_col] != '#'){\\n //Turn left 90 and if not a wall move up\\n //Update player\\n mz[p_row][p_col] = 'X';\\n p_row -= 1;\\n p_col += 0;\\n if (mz[p_row][p_col] == 'F'){\\n mz[p_row][p_col] = 'F';\\n } else {\\n mz[p_row][p_col] = 'O';\\n }\\n //Update hand\\n h_row -= 2;\\n h_col += 1;\\n printMaze(mz);\\n } else {\\n //Turn around\\n //Update player\\n mz[p_row][p_col] = 'X';\\n p_row += 0;\\n p_col -= 1;\\n if (mz[p_row][p_col] == 'F'){\\n mz[p_row][p_col] = 'F';\\n } else {\\n mz[p_row][p_col] = 'O';\\n }\\n //Update hand\\n h_row -= 2;\\n h_col -= 1;\\n printMaze(mz);\\n }\\n }\\n } else if (h_row+1 == p_row){\\n //If facing West\\n if(mz[h_row][h_col] != '#'){\\n //Look right\\n mz[p_row][p_col] = 'X'; \\n p_row -= 1;\\n p_col += 0;\\n if (mz[p_row][p_col] == 'F'){\\n mz[p_row][p_col] = 'F';\\n } else {\\n mz[p_row][p_col] = 'O';\\n }\\n //Update hand\\n h_row -= 0;\\n h_col += 1;\\n printMaze(mz);\\n } else { \\n //If hand position is a wall check in front of player\\n if(mz[p_row][p_col-1] != '#'){\\n //Update player\\n mz[p_row][p_col] = 'X';\\n p_row += 0;\\n p_col -= 1;\\n if (mz[p_row][p_col] == 'F'){\\n mz[p_row][p_col] = 'F';\\n } else {\\n mz[p_row][p_col] = 'O';\\n }\\n //Update hand\\n h_row += 0;\\n h_col -= 1;\\n printMaze(mz);\\n } else if (mz[p_row+1][p_col] != '#'){\\n //Turn left 90 and if not a wall move up\\n //Update player\\n mz[p_row][p_col] = 'X';\\n p_row += 1;\\n p_col -= 0;\\n if (mz[p_row][p_col] == 'F'){\\n mz[p_row][p_col] = 'F';\\n } else {\\n mz[p_row][p_col] = 'O';\\n }\\n //Update hand\\n h_row += 2;\\n h_col -= 1;\\n printMaze(mz);\\n } else {\\n //Turn around\\n //Update player\\n mz[p_row][p_col] = 'X';\\n p_row -= 0;\\n p_col += 1;\\n if (mz[p_row][p_col] == 'F'){\\n mz[p_row][p_col] = 'F';\\n } else {\\n mz[p_row][p_col] = 'O';\\n }\\n //Update hand\\n h_row += 2;\\n h_col += 1;\\n printMaze(mz);\\n }\\n }\\n \\n } else if (h_col -1 == p_col){\\n //If facing North\\n if(mz[h_row][h_col] != '#'){ \\n //Take right if available\\n //Update player\\n mz[p_row][p_col] = 'X'; \\n p_row += 0;\\n p_col += 1;\\n if (mz[p_row][p_col] == 'F'){\\n mz[p_row][p_col] = 'F';\\n } else {\\n mz[p_row][p_col] = 'O';\\n }\\n //Update hand\\n h_row += 1;\\n h_col -= 0;\\n printMaze(mz); \\n } else {\\n //If hand position is a wall check in front of player\\n if(mz[p_row-1][p_col] != '#'){\\n //Update player\\n mz[p_row][p_col] = 'X';\\n p_row -= 1;\\n p_col += 0;\\n if (mz[p_row][p_col] == 'F'){\\n mz[p_row][p_col] = 'F';\\n } else {\\n mz[p_row][p_col] = 'O';\\n }\\n //Update hand\\n h_row -= 1;\\n h_col += 0;\\n printMaze(mz);\\n } else if (mz[p_row][p_col-1] != '#'){\\n //Turn left 90 and if not a wall move up\\n //Update player\\n mz[p_row][p_col] = 'X';\\n p_row -= 0;\\n p_col -= 1;\\n if (mz[p_row][p_col] == 'F'){\\n mz[p_row][p_col] = 'F';\\n } else {\\n mz[p_row][p_col] = 'O';\\n }\\n //Update hand\\n h_row -= 1;\\n h_col -= 2;\\n printMaze(mz);\\n } else {\\n //Turn around\\n //Update player\\n mz[p_row][p_col] = 'X';\\n p_row -= 1;\\n p_col += 0;\\n if (mz[p_row][p_col] == 'F'){\\n mz[p_row][p_col] = 'F';\\n } else {\\n mz[p_row][p_col] = 'O';\\n }\\n //Update hand\\n h_row += 1;\\n h_col -= 2;\\n printMaze(mz);\\n }\\n }\\n } else if (h_col+1 == p_col){\\n //If facing South\\n if(mz[h_row][h_col] != '#'){\\n //Look right\\n mz[p_row][p_col] = 'X'; \\n p_row -= 0;\\n p_col -= 1;\\n if (mz[p_row][p_col] == 'F'){\\n mz[p_row][p_col] = 'F';\\n } else {\\n mz[p_row][p_col] = 'O';\\n }\\n //Update hand\\n h_row -= 1;\\n h_col += 0;\\n printMaze(mz);\\n } else { \\n //If hand position is a wall check in front of player\\n if(mz[p_row+1][p_col] != '#'){\\n //Update player\\n mz[p_row][p_col] = 'X';\\n p_row += 1;\\n p_col += 0;\\n if (mz[p_row][p_col] == 'F'){\\n mz[p_row][p_col] = 'F';\\n } else {\\n mz[p_row][p_col] = 'O';\\n }\\n //Update hand\\n h_row += 1;\\n h_col += 0;\\n printMaze(mz);\\n } else if (mz[p_row][p_col+1] != '#'){\\n //Turn left 90 and if not a wall move up\\n //Update player\\n mz[p_row][p_col] = 'X';\\n p_row += 0;\\n p_col += 1;\\n if (mz[p_row][p_col] == 'F'){\\n mz[p_row][p_col] = 'F';\\n } else {\\n mz[p_row][p_col] = 'O';\\n }\\n //Update hand\\n h_row += 1;\\n h_col += 2;\\n printMaze(mz);\\n } else {\\n //Turn around\\n //Update player\\n mz[p_row][p_col] = 'X';\\n p_row -= 0;\\n p_col += 1;\\n if (mz[p_row][p_col] == 'F'){\\n mz[p_row][p_col] = 'F';\\n } else {\\n mz[p_row][p_col] = 'O';\\n }\\n //Update hand\\n h_row += 2;\\n h_col += 1;\\n printMaze(mz);\\n }\\n }\\n \\n }\\n maze(mz, p_row, p_col, h_row, h_col); \\n }\\n }\",\n \"public void open(int row, int col) {\\n\\t\\tif (!isOpen(row, col)) {\\n\\t\\t\\tgrid[row - 1][col - 1] = true;\\n\\t\\t\\topenCount++;\\n\\t\\t}\\n\\t\\tint indexInUF = getUnionIndex(row, col);\\n\\n\\t\\t// left neighbor\\n\\t\\tunionIfOpen(indexInUF, row, col - 1);\\n\\n\\t\\t// right neighbor\\n\\t\\tunionIfOpen(indexInUF, row, col + 1);\\n\\n\\t\\t// top neighbor\\n\\t\\tunionIfOpen(indexInUF, row + 1, col);\\n\\n\\t\\t// bottom neighbor\\n\\t\\tunionIfOpen(indexInUF, row - 1, col);\\n\\n\\t\\tif (row == 1) {\\n\\t\\t\\t// union to virtual top index\\n\\t\\t\\tuf.union(0, indexInUF);\\n\\t\\t}\\n\\n\\t\\tif (row == size) {\\n\\t\\t\\t// union to virtual bottom index\\n\\t\\t\\tuf.union(size * size + 1, indexInUF);\\n\\t\\t}\\n\\t}\",\n \"private void union(int[] parent, int x, int y){\\n int xParent = find(parent, x);\\n int yParent = find(parent, y);\\n parent[xParent] = yParent;\\n }\",\n \"public static boolean UnionOperator(PsiBuilder b, int l) {\\n if (!recursion_guard_(b, l, \\\"UnionOperator\\\")) return false;\\n if (!nextTokenIs(b, \\\"<union operator>\\\", K_UNION, PIPE)) return false;\\n boolean r;\\n Marker m = enter_section_(b, l, _NONE_, UNION_OPERATOR, \\\"<union operator>\\\");\\n r = consumeToken(b, K_UNION);\\n if (!r) r = consumeToken(b, PIPE);\\n exit_section_(b, l, m, r, false, null);\\n return r;\\n }\",\n \"public static ImmutableGraph union( final ImmutableGraph g0, final ImmutableGraph g1 ) {\\n\\t\\treturn g0 instanceof ArcLabelledImmutableGraph && g1 instanceof ArcLabelledImmutableGraph \\n\\t\\t\\t? union( (ArcLabelledImmutableGraph)g0, (ArcLabelledImmutableGraph)g1, (LabelMergeStrategy)null )\\n\\t\\t\\t\\t\\t: new UnionImmutableGraph( g0, g1 );\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.63619864","0.5973439","0.5275784","0.5063924","0.5040628","0.501684","0.49932745","0.49562857","0.49523562","0.49458063","0.48888665","0.48796523","0.47886294","0.4769708","0.47667032","0.46873805","0.46837887","0.46697462","0.46478003","0.45989677","0.4587597","0.45634606","0.45632777","0.4560822","0.45522603","0.45499897","0.45436156","0.45340887","0.4529934","0.4526834","0.45166594","0.4512312","0.44703528","0.4436927","0.44296604","0.440931","0.4407333","0.44005567","0.43879998","0.43860447","0.4363717","0.43591484","0.43502802","0.43430507","0.43314338","0.43283305","0.43232217","0.43050826","0.42658004","0.42491233","0.42455947","0.42444208","0.4242708","0.42297292","0.42292172","0.42272547","0.4216486","0.4213108","0.42115584","0.42021188","0.41931513","0.419015","0.41835797","0.41711578","0.41638973","0.4156306","0.41436955","0.41290146","0.412135","0.4117151","0.41061437","0.4102689","0.40974906","0.40928674","0.4085795","0.4081222","0.40772888","0.40498602","0.40448686","0.40428168","0.40399048","0.40262327","0.4021733","0.40194136","0.40190467","0.40120253","0.40053552","0.40034637","0.39983645","0.39872724","0.39853078","0.3978879","0.3973895","0.3967718","0.39675713","0.39649993","0.3960794","0.39536196","0.39492482","0.39424762"],"string":"[\n \"0.63619864\",\n \"0.5973439\",\n \"0.5275784\",\n \"0.5063924\",\n \"0.5040628\",\n \"0.501684\",\n \"0.49932745\",\n \"0.49562857\",\n \"0.49523562\",\n \"0.49458063\",\n \"0.48888665\",\n \"0.48796523\",\n \"0.47886294\",\n \"0.4769708\",\n \"0.47667032\",\n \"0.46873805\",\n \"0.46837887\",\n \"0.46697462\",\n \"0.46478003\",\n \"0.45989677\",\n \"0.4587597\",\n \"0.45634606\",\n \"0.45632777\",\n \"0.4560822\",\n \"0.45522603\",\n \"0.45499897\",\n \"0.45436156\",\n \"0.45340887\",\n \"0.4529934\",\n \"0.4526834\",\n \"0.45166594\",\n \"0.4512312\",\n \"0.44703528\",\n \"0.4436927\",\n \"0.44296604\",\n \"0.440931\",\n \"0.4407333\",\n \"0.44005567\",\n \"0.43879998\",\n \"0.43860447\",\n \"0.4363717\",\n \"0.43591484\",\n \"0.43502802\",\n \"0.43430507\",\n \"0.43314338\",\n \"0.43283305\",\n \"0.43232217\",\n \"0.43050826\",\n \"0.42658004\",\n \"0.42491233\",\n \"0.42455947\",\n \"0.42444208\",\n \"0.4242708\",\n \"0.42297292\",\n \"0.42292172\",\n \"0.42272547\",\n \"0.4216486\",\n \"0.4213108\",\n \"0.42115584\",\n \"0.42021188\",\n \"0.41931513\",\n \"0.419015\",\n \"0.41835797\",\n \"0.41711578\",\n \"0.41638973\",\n \"0.4156306\",\n \"0.41436955\",\n \"0.41290146\",\n \"0.412135\",\n \"0.4117151\",\n \"0.41061437\",\n \"0.4102689\",\n \"0.40974906\",\n \"0.40928674\",\n \"0.4085795\",\n \"0.4081222\",\n \"0.40772888\",\n \"0.40498602\",\n \"0.40448686\",\n \"0.40428168\",\n \"0.40399048\",\n \"0.40262327\",\n \"0.4021733\",\n \"0.40194136\",\n \"0.40190467\",\n \"0.40120253\",\n \"0.40053552\",\n \"0.40034637\",\n \"0.39983645\",\n \"0.39872724\",\n \"0.39853078\",\n \"0.3978879\",\n \"0.3973895\",\n \"0.3967718\",\n \"0.39675713\",\n \"0.39649993\",\n \"0.3960794\",\n \"0.39536196\",\n \"0.39492482\",\n \"0.39424762\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.55321974"},"document_rank":{"kind":"string","value":"2"}}},{"rowIdx":38180,"cells":{"query":{"kind":"string","value":"METHOD 4: UnionBySize This method runs unionbysize to solve the maze. This is of type nonreturn."},"document":{"kind":"string","value":"public static void mazeSize(){\n\t\tint n = 10;\t\n\n\t\tdsf S = new dsf(n*n);\n\t\tMaze four = new Maze(n);\n\n\t\tRandom random;\n\t\tint sets = n*n;\t//number of sets in the DSF\n\t\tint randomNumber;\n\t\tint randomDirection;\n\t\tint row;\n\t\tint col;\n\n\t\tchar upperRight; \t//bottom or right\n\n\t\tS.print();\n\n\t\twhile(sets > 1){\n\t\t\trandom = new Random();\n\t\t\trandomNumber = random.nextInt((n*n) - 1);\n\t\t\t//System.out.println(\"RANDOM NUMBER: \"+randomNumber);\n\t\t\trow = randomNumber /n;\t//SWITCHED\n\t\t\tcol = randomNumber %n;\t//SWITCHED\n\t\t\trandomDirection = random.nextInt(2);\n\t\t\tString direct = null;\n\t\t\tif(randomDirection == 0)\n\t\t\t\tdirect = \"upper\";\n\t\t\tif(randomDirection == 1)\n\t\t\t\tdirect = \"right\";\n\t\t\t//System.out.println(\"RANDOM DIRECTI0N: \"+direct);\n\t\t\tupperRight = four.direction(randomDirection);\n\n\t\t\tif(upperRight == 'u'){\n\t\t\t\tif((randomNumber) < ((n*n)-n)){\n\t\t\t\t\t//System.out.println(\"Sets: \"+sets);\n\t\t\t\t\tif(S.find(randomNumber) != S.find(randomNumber + n)){\n\t\t\t\t\t\tS.unionBySize(randomNumber, randomNumber+n);\n\t\t\t\t\t\tfour.remove_wall(col, row, 'u');\n\t\t\t\t\t\t//S.print();\n\t\t\t\t\t\tsets--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(upperRight == 'r'){\n\t\t\t\tif(((randomNumber)%(n*n)) != n-1){\n\t\t\t\t\tif(S.find(randomNumber) != S.find(randomNumber+1)){\n\t\t\t\t\t\tS.unionBySize(randomNumber, randomNumber+1);\n\t\t\t\t\t\tfour.remove_wall(col, row, 'r');\n\t\t\t\t\t\t//S.print();\n\t\t\t\t\t\tsets--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tbuildAdjacencyList(four, n);\n\t\tuserSelection_SolveMaze(n);\n\n\n\t\tStdDraw.show(0);\n\t\tfour.draw();\n\t\tfour.printCellNumbers();\t\n\t}"},"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 static void mazeUnion(){\n\n\t\tint n = 10;\t\n\n\t\tdsf S = new dsf(n*n);\n\t\tMaze one = new Maze(n);\n\n\t\tRandom random;\n\t\tint sets = n*n;\t//number of sets in the DSF\n\t\tint randomNumber;\n\t\tint randomDirection;\n\t\tint row;\n\t\tint col;\n\n\t\tchar upperRight; \t//bottom or right\n\n\t\tS.print();\n\n\t\twhile(sets > 1){\n\t\t\trandom = new Random();\n\t\t\trandomNumber = random.nextInt((n*n) - 1);\n\t\t\tSystem.out.println(\"RANDOM NUMBER: \"+randomNumber);\n\t\t\trow = randomNumber /n;\t//SWITCHED\n\t\t\tcol = randomNumber %n;\t//SWITCHED\n\t\t\trandomDirection = random.nextInt(2);\n\t\t\tString direct;\n\t\t\tif(randomDirection == 0)\n\t\t\t\tdirect = \"upper\";\n\t\t\telse\n\t\t\t\tdirect = \"right\";\n\t\t\tSystem.out.println(\"RANDOM DIRECTI0N: \"+direct);\n\t\t\tupperRight = one.direction(randomDirection);\n\n\t\t\tif(upperRight == 'u'){\n\t\t\t\tif((randomNumber) < ((n*n)-n)){\n\t\t\t\t\tSystem.out.println(\"Sets: \"+sets);\n\t\t\t\t\tif(S.find(randomNumber+n) != S.find(randomNumber)){\n\t\t\t\t\t\tS.union(randomNumber+n, randomNumber);\n\t\t\t\t\t\tone.remove_wall(col, row, 'u');\n\t\t\t\t\t\tS.print();\n\t\t\t\t\t\tsets--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(upperRight == 'r'){\n\t\t\t\tif(((randomNumber)%(n*n)) != n-1){\n\t\t\t\t\tif(S.findAndCompress(randomNumber) != S.findAndCompress(randomNumber+1)){\n\t\t\t\t\t\tS.union(randomNumber, randomNumber+1);\n\t\t\t\t\t\tone.remove_wall(col, row, 'r');\n\t\t\t\t\t\t//S.print();\n\t\t\t\t\t\tsets--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tStdDraw.show(0);\n\t\tone.draw();\n\t\tone.printCellNumbers();\n\t\t\n\t\tbuildAdjacencyList(one, n);\n\t\tuserSelection_SolveMaze(n);\n\n\t}","public static void unionPathCompression(){\n\t\tint n = 10;\t\n\n\t\tdsf S = new dsf(n*n);\n\t\tMaze two = new Maze(n);\n\n\t\tRandom random;\n\t\tint sets = n*n;\t//number of sets in the DSF\n\t\tint randomNumber;\n\t\tint randomDirection;\n\t\tint row;\n\t\tint col;\n\n\t\tchar upperRight; \t//bottom or right\n\n\t\tS.print();\n\n\t\twhile(sets > 1){\n\t\t\trandom = new Random();\n\t\t\trandomNumber = random.nextInt((n*n) - 1);\n\t\t\t//System.out.println(\"RANDOM NUMBER: \"+randomNumber);\n\t\t\trow = randomNumber /n;\t//SWITCHED\n\t\t\tcol = randomNumber %n;\t//SWITCHED\n\t\t\trandomDirection = random.nextInt(2);\n\t\t\tString direct;\n\t\t\tif(randomDirection == 0)\n\t\t\t\tdirect = \"upper\";\n\t\t\telse\n\t\t\t\tdirect = \"right\";\n\t\t\tSystem.out.println(\"RANDOM DIRECTI0N: \"+direct);\n\t\t\tupperRight = two.direction(randomDirection);\n\n\t\t\tif(upperRight == 'u'){\n\t\t\t\tif((randomNumber) < ((n*n)-n)){\n\t\t\t\t\tSystem.out.println(\"Sets: \"+sets);\n\t\t\t\t\tif(S.findAndCompress(randomNumber+n) != S.findAndCompress(randomNumber)){\n\t\t\t\t\t\tS.union(randomNumber+n, randomNumber);\n\t\t\t\t\t\ttwo.remove_wall(col, row, 'u');\n\t\t\t\t\t\tS.print();\n\t\t\t\t\t\tsets--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(upperRight == 'r'){\n\t\t\t\tif(((randomNumber)%(n*n)) != n-1){\n\t\t\t\t\tif(S.findAndCompress(randomNumber) != S.findAndCompress(randomNumber+1)){\n\t\t\t\t\t\tS.union(randomNumber, randomNumber+1);\n\t\t\t\t\t\ttwo.remove_wall(col, row, 'r');\n\t\t\t\t\t\tS.print();\n\t\t\t\t\t\tsets--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tbuildAdjacencyList(two, n);\n\t\tuserSelection_SolveMaze(n);\n\n\n\t\tStdDraw.show(0);\n\t\ttwo.draw();\n\t\ttwo.printCellNumbers();\n\t}","public static void sizePathCompression(){\n\t\tint n = 10;\t\n\n\t\tdsf S = new dsf(n*n);\n\t\tMaze five = new Maze(n);\n\n\t\tRandom random;\n\t\tint sets = n*n;\t//number of sets in the DSF\n\t\tint randomNumber;\n\t\tint randomDirection;\n\t\tint row;\n\t\tint col;\n\n\t\tchar upperRight; \t//bottom or right\n\n\t\tS.print();\n\n\t\twhile(sets > 1){\n\t\t\trandom = new Random();\n\t\t\trandomNumber = random.nextInt((n*n) - 1);\n\t\t\t//System.out.println(\"RANDOM NUMBER: \"+randomNumber);\n\t\t\trow = randomNumber /n;\t//SWITCHED\n\t\t\tcol = randomNumber %n;\t//SWITCHED\n\t\t\trandomDirection = random.nextInt(2);\n\t\t\tString direct;\n\t\t\tif(randomDirection == 0)\n\t\t\t\tdirect = \"upper\";\n\t\t\telse\n\t\t\t\tdirect = \"right\";\n\t\t\t//System.out.println(\"RANDOM DIRECTI0N: \"+direct);\n\t\t\tupperRight = five.direction(randomDirection);\n\n\t\t\tif(upperRight == 'u'){\n\t\t\t\tif((randomNumber) < ((n*n)-n)){\n\t\t\t\t\tSystem.out.println(\"Sets: \"+sets);\n\t\t\t\t\tif(S.findAndCompress(randomNumber) != S.findAndCompress(randomNumber + n)){\n\t\t\t\t\t\tS.unionBySize(randomNumber+n, randomNumber);\n\t\t\t\t\t\tfive.remove_wall(col, row, 'u');\n\t\t\t\t\t\t//S.print();\n\t\t\t\t\t\tsets--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(upperRight == 'r'){\n\t\t\t\tif(((randomNumber)%(n*n)) != n-1){\n\t\t\t\t\tif(S.findAndCompress(randomNumber) != S.findAndCompress(randomNumber+1)){\n\t\t\t\t\t\tS.unionBySize(randomNumber, randomNumber+1);\n\t\t\t\t\t\tfive.remove_wall(col, row, 'r');\n\t\t\t\t\t\tS.print();\n\t\t\t\t\t\tsets--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tbuildAdjacencyList(five, n);\n\t\tuserSelection_SolveMaze(n);\n\n\t\tStdDraw.show(0);\n\t\tfive.draw();\n\t\tfive.printCellNumbers();\t\n\t}","public void showMazeSize(int size);","@Test\n\tpublic void testUnion5() {\n\n\t\tint[] arr = {};\n\t\tSLLSet listObj2 = new SLLSet(arr);\n\t\tint[] uni2 = { 0, 2, 3 };\n\t\tSLLSet listObj7 = new SLLSet(uni2);\n\t\tSLLSet listObj8 = listObj2.union(listObj7);\n\n\t\tString expected = \"0, 2, 3\";\n\t\tint expectedSize = 3;\n\n\t\tassertEquals(expectedSize, listObj8.getSize());\n\t\tassertEquals(expected, listObj8.toString());\n\n\t}","public void union(int i, int j) {\n\tint p = findRoot(i);\n\tint q = findRoot(j);\n\t\n\tif (p == q) return;\n\t\n\tif (size[p] < size[q]) { //pick the smallest tree and append it to the bigger tree\n\t root[p] = q;\n\t size[p] += size[q];\n\t} else {\n\t root[q] = p;\n\t size[q] += size[p];\n\t}\n }","void union(int x,int y){\n int xRoot=find(x),yRoot=find(y);\n if(xRoot==yRoot)return;\n if(rank[xRoot]<rank[yRoot])\n parent[xRoot]=yRoot;\n else if(rank[xRoot]>rank[yRoot])\n parent[yRoot]=xRoot;\n else{\n parent[yRoot]=xRoot;\n rank[xRoot]=rank[xRoot]+1;\n }\n --totalSets;\n }","public void union(Shape s);","public void union(int p, int q)\n {\n int i = root(p);\n int j = root(q);\n if ( i == j ) return;\n \n if ( sz[i] < sz[j] ) { \n // i is no longer a root, so we don't need to update the size\n id[i] = j; sz[j] += sz[i];\n }\n else {\n id[j] = i; sz[i] += sz[j]; \n } \n }","public int union(int u, int v) {\n int p1 = find(u), p2 = find(v);\n if (p1 == p2) {\n return p1;\n }\n int s1 = _sizes[p1], s2 = _sizes[p2];\n if (s1 > s2) {\n _sizes[p1] += s2;\n// int i = 1;\n// while (s2 > 0) {\n// if (_parents[i] == p2) {\n// _parents[i] = p1;\n// s2 -= 1;\n// }\n// i += 1;\n// }\n _parents[p2] = p1;\n return s1;\n } else {\n _sizes[p2] += s1;\n// int j = 1;\n// while (s1 > 0) {\n// if (_parents[j] == p1) {\n// _parents[j] = p2;\n// s1 -= 1;\n// }\n// j += 1;\n// }\n _parents[p1] = p2;\n return s2;\n }\n }","public void union(int p, int q)\n {\n int i = this.root(p);\n int j = this.root(q);\n if (i == j) return;\n\n if (this.size[i] < this.size[j])\n {\n this.parent[i] = j;\n this.size[j] += this.size[i];\n }\n else\n {\n this.parent[j] = i;\n this.size[i] += this.size[j];\n }\n }","public static void main(String[] args) {\n\t\tStopwatch timer = new Stopwatch();\n\t\t//for(int i = 0; i< 10;i++) {\n\t\t\tIn in = new In(args[0]);\n\t\t\tSizeWeightedQuickUnionVisualizer q = new SizeWeightedQuickUnionVisualizer(in.readInt());\n\t\t\twhile(!in.isEmpty()) {\n\t\t\t\tint m = in.readInt();\n\t\t\t\tint n = in.readInt();\n\t\t\t\tif(q.isConnected(m, n)) continue;\n\t\t\t\tq.union(m, n);\n\t\t\t}\n\t\t//}\n\t\tdouble time = timer.elapsedTime();\n\t\t//System.out.println(\"the average time of 10 trials is : \" + time/10 + \" seconds\");\n\t\t//System.out.println(\"the number of components is \"+ q.count()+\" the number of total array accesses is \"+q.sum + \" the average nodes' depth is: \"+ q.getAvgDepth()+\" time: \"+time+\" seconds\");\n\t}","public void union(int first, int second){\n int firstId = find(first);\n int secondId = find(second);\n //Check if these are already connected\n if(firstId == secondId){\n return;\n }\n if(size[firstId] < size[secondId]){\n size[secondId]+=size[firstId];\n grid[first] = secondId;\n }\n else {\n size[firstId]+=size[secondId];\n grid[second] = firstId;\n }\n --numOfComponents;\n }","public void union(int p, int q){\r\n\t\tint rootP = root(p);\r\n\t\tint rootQ = root(q);\r\n\t\t\r\n\t\tif(rootP == rootQ) return;\r\n\t\t// Calculate height of tree and then link the root of smaller tree to root of larger tree\r\n\t\t\r\n\t\tif(size[rootP] < size[rootQ]) {\r\n\t\t\tid[rootP] = rootQ;\r\n\t\t\tsize[rootQ] = size[rootQ] + size[rootP];\r\n\t\t}\r\n\t\telse {\r\n\t\t\tid[rootQ] = rootP;\r\n\t\t\tsize[rootP] = size[rootQ] + size[rootP];\r\n\t\t}\r\n\t}","public static void unionFind(int[][] doubleArray, int dimensions, UnionFind uf)\n {\n int count = 0;\n while (count != dimensions)\n {\n for (int column = 0; column < dimensions; column++) {\n if (uf.find(count, (dimensions*dimensions - 1 - column)) == true)\n {\n uf.printArray();\n StdOut.println();\n StdOut.println(\"Drip, drip.\");\n return;\n }\n }\n count++;\n }\n StdOut.println(\"No drip, drip.\");\n }","protected void trimToSize() {\n\tnodeList.trimToSize();\n\tedgeList.trimToSize();\n }","public void union(int p, int q) {\n\t\tint i = root(p);\n\t\tint j = root(q);\n//\t\tid[i] = j; instead of this do below improvement\n\t\tif (sz[i] < sz[j]) {\n\t\t\tid[i] = j;\n\t\t\tsz[j] += sz[i];\n\t\t} else {\n\t\t\tid[j] = i;\n\t\t\tsz[i] += sz[j];\n\t\t}\n\t}","static\nint\nprintUnion(\nint\narr1[], \nint\narr2[], \nint\nm, \nint\nn) \n\n{ \n\nint\ni = \n0\n, j = \n0\n; \n\nwhile\n(i < m && j < n) \n\n{ \n\nif\n(arr1[i] < arr2[j]) \n\nSystem.out.print(arr1[i++]+\n\" \"\n); \n\nelse\nif\n(arr2[j] < arr1[i]) \n\nSystem.out.print(arr2[j++]+\n\" \"\n); \n\nelse\n\n{ \n\nSystem.out.print(arr2[j++]+\n\" \"\n); \n\ni++; \n\n} \n\n} \n\n\n/* Print remaining elements of \n\nthe larger array */\n\nwhile\n(i < m) \n\nSystem.out.print(arr1[i++]+\n\" \"\n); \n\nwhile\n(j < n) \n\nSystem.out.print(arr2[j++]+\n\" \"\n); \n\n\nreturn\n0\n; \n\n}","public static void mazeHeight(){\n\t\tint n = 10;\t\n\n\t\tdsf S = new dsf(n*n);\n\t\tMaze three = new Maze(n);\n\n\t\tRandom random;\n\t\tint sets = n*n;\t//number of sets in the DSF\n\t\tint randomNumber;\n\t\tint randomDirection;\n\t\tint row;\n\t\tint col;\n\n\t\tchar upperRight; \t//bottom or right\n\n\t\tS.print();\n\n\t\twhile(sets > 1){\n\t\t\trandom = new Random();\n\t\t\trandomNumber = random.nextInt((n*n) - 1);\n\t\t\t//System.out.println(\"RANDOM NUMBER: \"+randomNumber);\n\t\t\trow = randomNumber /n;\t//SWITCHED\n\t\t\tcol = randomNumber %n;\t//SWITCHED\n\t\t\trandomDirection = random.nextInt(2);\n\t\t\tString direct;\n\t\t\tif(randomDirection == 0)\n\t\t\t\tdirect = \"upper\";\n\t\t\telse\n\t\t\t\tdirect = \"right\";\n\t\t\t//System.out.println(\"RANDOM DIRECTI0N: \"+direct);\n\t\t\tupperRight = three.direction(randomDirection);\n\n\t\t\tif(upperRight == 'u'){\n\t\t\t\tif((randomNumber) < ((n*n)-n)){\n\t\t\t\t\tSystem.out.println(\"Sets: \"+sets);\n\t\t\t\t\tif(S.find(randomNumber) != S.find(randomNumber + n)){\n\t\t\t\t\t\tS.unionByHeight(randomNumber, randomNumber+n);\n\t\t\t\t\t\tthree.remove_wall(col, row, 'u');\n\t\t\t\t\t\tS.print();\n\t\t\t\t\t\tsets--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(upperRight == 'r'){\n\t\t\t\tif(((randomNumber)%(n*n)) != n-1){\n\t\t\t\t\tif(S.find(randomNumber) != S.find(randomNumber+1)){\n\t\t\t\t\t\tS.unionByHeight(randomNumber, randomNumber+1);\n\t\t\t\t\t\tthree.remove_wall(col, row, 'r');\n\t\t\t\t\t\tS.print();\n\t\t\t\t\t\tsets--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tbuildAdjacencyList(three, n);\n\t\tuserSelection_SolveMaze(n);\n\n\n\t\tStdDraw.show(0);\n\t\tthree.draw();\n\t\tthree.printCellNumbers();\t\n\t}","public static void union(int u, int v) {\n\t\tu = root(u); // optimizations\n\t\tv = root(v); // to make find faster\n\t\tif (u == v) return; // already in same component\n\t\t\n\t\tif (size[u] >= size[v]) {\n\t\t\tp[v] = u;\n\t\t\tsize[u] += size[v];\n\t\t} else {\n\t\t\tp[u] = v;\n\t\t\tsize[v] += size[u];\n\t\t}\n\t}","WeightedUnionFind(int N){\n id = new int[N];\n size = new int[N];\n for (int i = 0; i < N; i++){\n id[i] = i;\n size[i] = 1;\n }\n }","void union(int x, int y) {\n\n // **** set the modes in the parents array ****\n if (parents[x] == 0)\n parents[x] = x;\n\n if (parents[y] == 0)\n parents[y] = y;\n\n // **** update the representative element of each set ****\n if (parents[x] != 0 || parents[y] != 0) {\n\n // **** get the low and high from these nodes ****\n int high = Math.max(parents[x], parents[y]);\n int low = Math.min(parents[x], parents[y]);\n\n // ???? ????\n System.out.println(\"union <<< high: \" + high + \" low: \" + low);\n\n // **** update to point to the proper representative ****\n for (int i = 0; i < parents.length; i++) {\n if (parents[i] == high)\n parents[i] = low;\n }\n }\n }","void Union(subset [] subsets, int x , int y ){ \n\t\tint xroot = find(subsets, x); \n\t int yroot = find(subsets, y); \n\t \n\t\tif (subsets[xroot].rank < subsets[yroot].rank) \n\t\t\tsubsets[xroot].parent = yroot; \n\t\telse if (subsets[yroot].rank < subsets[xroot].rank) \n\t\t\tsubsets[yroot].parent = xroot; \n\t\telse{ \n\t\t\tsubsets[xroot].parent = yroot; \n\t\t\tsubsets[yroot].rank++; \n\t\t} \n\t}","public void open(int row, int col) {\n if (isOpen(row, col)) return;\n grid[row - 1][col - 1] = true;\n ++openSites;\n\n // Transform the row and the column into an appropriate index\n // because the quick union class uses a one-dimensional array.\n final int currentSiteIndex = toIndex(row, col);\n\n // The topmost row must be connected to the virtual top.\n if (row == 1) {\n mainUnion.union(virtualTopId, currentSiteIndex);\n backwashAwareUnion.union(virtualTopId, currentSiteIndex);\n }\n // The bottommost row must be connected to virtual the bottom.\n if (row == size) mainUnion.union(virtualBottomId, currentSiteIndex);\n\n // Connect all neighbors of the current site if and only if the neighbors are open.\n if (row > 1 && isOpen(row - 1, col)) {\n final int topNeighborIndex = toIndex(row - 1, col);\n mainUnion.union(topNeighborIndex, currentSiteIndex);\n backwashAwareUnion.union(topNeighborIndex, currentSiteIndex);\n }\n\n if (row < size && isOpen(row + 1, col)) {\n final int bottomNeighborIndex = toIndex(row + 1, col);\n mainUnion.union(bottomNeighborIndex, currentSiteIndex);\n backwashAwareUnion.union(bottomNeighborIndex, currentSiteIndex);\n }\n\n if (col > 1 && isOpen(row, col - 1)) {\n final int leftNeighborIndex = toIndex(row, col - 1);\n mainUnion.union(leftNeighborIndex, currentSiteIndex);\n backwashAwareUnion.union(leftNeighborIndex, currentSiteIndex);\n }\n\n if (col < size && isOpen(row, col + 1)) {\n final int rightNeighborIndex = toIndex(row, col + 1);\n mainUnion.union(rightNeighborIndex, currentSiteIndex);\n backwashAwareUnion.union(rightNeighborIndex, currentSiteIndex);\n }\n }","public org.apache.gora.cascading.test.storage.TestRow.Builder clearUnionRecursive() {\n unionRecursive = null;\n fieldSetFlags()[3] = false;\n return this;\n }","@Override\n protected int mapSize() {\n return left.size()+right.size()-hidden.size();\n }","int[] union(int s1,int t1,int s2,int t2)\r\n\t{\r\n\t\tint [] st=new int[2];\r\n\t\t//Please fill in the program here\r\n\t\tst[0] = incCapacity();\r\n\t\taddEdge(st[0], epssymbol, s1);\r\n\t\taddEdge(st[0], epssymbol, s2);\r\n\t\tst[1] = incCapacity();\r\n\t\taddEdge(t1, epssymbol, st[1]);\r\n\t\taddEdge(t2, epssymbol, st[1]);\r\n\r\n\t\treturn st;\r\n\t}","@Test\n public void testMatchLimitOneBottomUp() throws Exception {\n\n HepProgramBuilder programBuilder = HepProgram.builder();\n programBuilder.addMatchLimit( 1 );\n programBuilder.addMatchOrder( HepMatchOrder.BOTTOM_UP );\n programBuilder.addRuleInstance( UnionToDistinctRule.INSTANCE );\n\n checkPlanning( programBuilder.build(), UNION_TREE );\n }","public DisjointSetUnionByRank(int numElements) {\n super( numElements );\n }","@Test\n\tpublic void testUnionSLLSetArrayAll0() {\n\n\t\tint[] arr1 = { 0, 0, 0 };\n\t\tint[] arr2 = { 0, 0, 0, 0 };\n\t\tint[] arr3 = { 0, 0 };\n\t\tint[] arr4 = { 0, 0 };\n\t\tSLLSet listObj100 = new SLLSet(arr1);\n\t\tSLLSet listObj99 = new SLLSet(arr2);\n\t\tSLLSet listObj98 = new SLLSet(arr3);\n\t\tSLLSet listObj97 = new SLLSet(arr4);\n\t\tSLLSet listObj96 = new SLLSet();\n\t\tSLLSet[] Array = { listObj100, listObj99, listObj98, listObj97, listObj96 }; // test static SLLSet union(sArray)\n\n\t\tSLLSet listObj23 = SLLSet.union(Array);\n\n\t\tString expected = \"0\";\n\t\tint expectedSize = 1;\n\n\t\tassertEquals(expectedSize, listObj23.getSize());\n\t\tassertEquals(expected, listObj23.toString());\n\n\t}","public void union(int i, int j) {\n\n int root1 = find(i);\n int root2 = find(j);\n\n if (root2 == root1)\n return;\n\n if (_rank[root1] > _rank[root2]) {\n _parent[root2] = root1;\n } else if (_rank[root2] > _rank[root1]) {\n _parent[root1] = root2;\n } else {\n _parent[root2] = root1;\n _rank[root1]++;\n }\n }","public void open(int row, int col) {\n check(row, col);\n if (!isOpen(row, col)) {\n sites[row - 1][col - 1] = true;\n openSites++;\n\n int index = index(row, col);\n if (row == gridDimension) {\n unionFind.union(index, bottomRoot);\n\n if (gridDimension == 1){\n unionFind.union(index, topRoot);\n fullSites.union(index, topRoot);\n }\n else if (isOpen(row - 1, col)) {\n unionFind.union(index(row - 1, col), index);\n fullSites.union(index(row - 1, col), index);\n }\n }\n else if (row == 1) {\n unionFind.union(index, topRoot);\n fullSites.union(index, topRoot);\n\n if (isOpen(row + 1, col)) {\n unionFind.union(index(row + 1, col), index);\n fullSites.union(index(row + 1, col), index);\n }\n }\n\n else {\n if (isOpen(row + 1, col)) {\n unionFind.union(index(row + 1, col), index);\n fullSites.union(index(row + 1, col), index);\n }\n\n if (isOpen(row - 1, col)) {\n unionFind.union(index(row - 1, col), index);\n fullSites.union(index(row - 1, col), index);\n }\n }\n\n\n\n if (col > 1) {\n if (isOpen(row, col - 1)) {\n unionFind.union(index(row, col - 1), index);\n fullSites.union(index(row, col - 1), index);\n }\n }\n\n if (col < gridDimension) {\n if (isOpen(row, col + 1)) {\n unionFind.union(index(row, col + 1), index);\n fullSites.union(index(row, col + 1), index);\n }\n }\n }\n }","public static void union(String a, String b) {\r\n int root1 = find(a);\r\n int root2 = find(b);\r\n if (root1 == root2)return;\r\n if(size.get(root1) < size.get(root2)){size.set(root2, size.get(root2)+size.get(root1)); position.set(root1, root2);}\r\n else {size.set(root1, size.get(root1)+size.get(root2)); position.set(root2, root1);}\r\n }","public int getMazeSize() \r\n\t{\r\n\t\treturn this.size;\r\n\t}","void union(int p, int q) {}","public void setSize() {\n\t\t\tthis.size = 1;\n\t\t\tint leftSize = 0;\n\t\t\tint rightSize = 0;\n\t\t\tif (this.getLeft().getKey() != -1) {\n\t\t\t\tleftSize = this.getLeft().getSize();\n\t\t\t}\n\t\t\tif (this.getRight().getKey() != -1) {\n\t\t\t\trightSize = this.getRight().getSize();\n\t\t\t}\n\t\t\tthis.size += leftSize + rightSize;\n\n\t\t\t/**\n\t\t\t * this.size = 1; int leftSize = 0; int rightSize = 0; try { leftSize =\n\t\t\t * this.getLeft().getSize(); this.size += leftSize; } catch\n\t\t\t * (NullPointerException e) { this.size += leftSize; } try { rightSize =\n\t\t\t * this.getRight().getSize(); this.size += rightSize; } catch\n\t\t\t * (NullPointerException e) { this.size += rightSize; } if (this.getSize() >\n\t\t\t * 990) { System.out.println(\"actual size is:\" + this.getSize()); }\n\t\t\t */\n\t\t}","void union(int a, int b) {\n\t\tif (a==9 && b==4){\r\n\t\tSystem.out.println(\"DEBUGGING 9 AND 4\");\r\n\t\tSystem.out.println(\"size of A: \"+ sizeOf(a));\r\n\t\tSystem.out.println(\"size of B: \"+ sizeOf(b));\r\n\t\t}\r\n\t\tint rootB = getRoot(b); // N array access\r\n\t\tint rootA = getRoot(a); // N array access\r\n\t\tif (rootA==rootB)return;\r\n\r\n\t\tif (sizeOf(rootA)<sizeOf(rootB)){\r\n\t\t\tidNode[rootA] = rootB; // 1 array access\r\n\t\t}\r\n\t\telse{\r\n\t\t\tidNode[rootB] = rootA; // 1 array access\r\n\t\t}\r\n\t}","public void sizeOfTiles(int size)\n{\n if(m != null )\n {\n m.getOutputImageManager().setTileSize(size);\n //refresh row shift for new size of tiles\n if(m.getOutputImageManager().getMosaic() != null)\n {\n m.getOutputImageManager().setEvenRowShift(m.getOutputImageManager().getEvenRowShift());\n m.getOutputImageManager().setOddRowShift(m.getOutputImageManager().getOddRowShift());\n m.getOutputImageManager().getMosaic().setHoverIndex(0,0);\n //println(m.getOutputImageManager().getMosaic().getFlipH()[0].length);\n }\n m.getOutputImageManager().setToRerender();\n }\n}","void Union( int x, int y){\n\n int i = root(x);\n int j = root(y);\n if (i == j) return;\n if (rank[i] > rank[j]) { id[j] = i; rank[i] += rank[j]; }\n else { id[i] = j; rank[j] += rank[i]; }\n }","public void testSize() {\n assertEquals(10, maze1.size());\n }","private void BuildUp(int towerToBuild, int towerTarget, int bottomSize) {\n\t\t\n\t\tint notTowerTarget = getOtherTower(towerToBuild,towerTarget);\n\n\t\twhile( towerSet.TopBlock(towerToBuild) > 1 ) {\n\t\t\tif(towerSet.TopBlock(towerTarget) == towerSet.TopBlock(towerToBuild) - 1) {\n\t\t\t\ttowerSet.MoveBlock(towerTarget,towerToBuild);\n\t\t\t\tturnNumber++;\n\t\t\t\tSystem.out.println(this.toString());\n\t\t\t}\n\t\t\telse if(towerSet.TopBlock(notTowerTarget) == towerSet.TopBlock(towerToBuild) - 1) {\n\t\t\t\ttowerSet.MoveBlock(notTowerTarget,towerToBuild);\n\t\t\t\tturnNumber++;\n\t\t\t\tSystem.out.println(this.toString());\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif(towerSet.TopBlock(towerTarget) == 1 ) {\n\t\t\t\t\tthis.BreakDown(towerTarget, towerToBuild, towerSet.TopBlock(towerToBuild) - 1);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tthis.BreakDown(notTowerTarget, towerToBuild, towerSet.TopBlock(towerToBuild) - 1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}","public void union(int p, int q) {\n\t\tint i = find(p);\n\t\tint j = find(q);\n\t\tif (i == j)\n\t\t\treturn;\n\t\t\n\t\t// make shorter root point to taller one\n\t\tif (height[i] < height[j]) parent[i] = j;\n\t else if (height[i] > height[j]) parent[j] = i;\n\t else {\n\t \tparent[j] = i;\n\t height[i]++;\n\t }\n\t\tcount--;\n\t}","public void union(Node a, Node b) {\n Node set1 = find(a);\n Node set2 = find(b);\n\n if (set1 != set2) {\n // Limits the worst case runtime of a find to O(log N)\n if (set1.getSize() < set2.getSize()) {\n set2.setParent(set1);\n set1.setSize(set1.getSize() + set2.getSize());\n }\n else {\n set1.setParent(set2);\n set2.setSize(set1.getSize() + set2.getSize());\n }\n }\n }","@Test\r\n public void testCreateUnion_thisIsEmpty() {\r\n Tour tourA = new Tour();\r\n Tour tourB = new Tour(new int[][]{{12, 12}});\r\n Tour result = tourA.createUnion(tourB);\r\n Tour expected = new Tour(new int[][]{{12, 12}});\r\n assertTrue(result.toString(), expected.isEqual(result));\r\n }","@Test\r\n public void test_UnionOf_simple() {\r\n System.out.println(\"unionOf\");\r\n int p = 11;\r\n int q = 99;\r\n UnionFind instance = new QuickUnion(100);\r\n instance.unionOf(p, q);\r\n assertEquals(true, instance.isConnected(p, q));\r\n\r\n }","public int CalcDistance ( )\r\n\t{\r\n\t\tfor ( int i = 0; i<size; i++ )\r\n\t\t{\r\n\t\t\tfor ( int offR = 0; offR <= size/2; offR++ )\r\n\t\t\t{\r\n\t\t\t\tfor ( int c = 0; c <= size/2; c++ )\r\n\t\t\t\t{\r\n\t\t\t\t\tif ( offR == 0 && maze [offR] [c].isOpenUp() )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmaze [offR] [c].setDistanceToExit( 1 );\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse if ( maze [offR] [c].isOpenUp() && maze [offR-1] [c].isOpenDown() )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmaze [offR] [c].setDistanceToExit( \r\n\t\t\t\t\t\t\t\tMath.min( maze [offR-1] [c].getDistanceToExit()+1,\r\n\t\t\t\t\t\t\t\t\t\t maze [offR] [c].getDistanceToExit() ) );\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif ( c == 0 && maze [offR] [c].isOpenLeft() )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmaze [offR] [c].setDistanceToExit( 1 );\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse if ( maze [offR] [c].isOpenLeft() && maze [offR] [c-1].isOpenRight() )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmaze [offR] [c].setDistanceToExit( \r\n\t\t\t\t\t\t\t\tMath.min( maze [offR] [c-1].getDistanceToExit()+1,\r\n\t\t\t\t\t\t\t\t\t\t maze [offR] [c].getDistanceToExit() ) );\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\tfor ( int c = size-1; c >= size/2; c-- )\r\n\t\t\t\t{\r\n\t\t\t\t\tif ( offR == 0 && maze [offR] [c].isOpenUp() )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmaze [offR] [c].setDistanceToExit( 1 );\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse if ( maze [offR] [c].isOpenUp() && maze [offR-1] [c].isOpenDown() )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmaze [offR] [c].setDistanceToExit( \r\n\t\t\t\t\t\t\t\tMath.min( maze [offR-1] [c].getDistanceToExit()+1,\r\n\t\t\t\t\t\t\t\t\t\t maze [offR] [c].getDistanceToExit() ) );\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif ( c == size-1 && maze [offR] [c].isOpenRight() )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmaze [offR] [c].setDistanceToExit( 1 );\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse if ( maze [offR] [c].isOpenRight() && maze [offR] [c+1].isOpenLeft() )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmaze [offR] [c].setDistanceToExit( \r\n\t\t\t\t\t\t\t\tMath.min( maze [offR] [c+1].getDistanceToExit()+1,\r\n\t\t\t\t\t\t\t\t\t\t maze [offR] [c].getDistanceToExit() ) );\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tfor ( int offR = size-1; offR >= size/2; offR-- )\r\n\t\t\t{\r\n\t\t\t\tfor ( int c = 0; c <= size/2; c++ )\r\n\t\t\t\t{\r\n\t\t\t\t\tif ( offR == size-1 && maze [offR] [c].isOpenDown() )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmaze [offR] [c].setDistanceToExit( 1 );\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse if ( maze [offR] [c].isOpenDown() && maze [offR+1] [c].isOpenUp() )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmaze [offR] [c].setDistanceToExit( \r\n\t\t\t\t\t\t\t\tMath.min( maze [offR+1] [c].getDistanceToExit()+1,\r\n\t\t\t\t\t\t\t\t\t\t maze [offR] [c].getDistanceToExit() ) );\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif ( c == 0 && maze [offR] [c].isOpenLeft() )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmaze [offR] [c].setDistanceToExit( 1 );\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse if ( maze [offR] [c].isOpenLeft() && maze [offR] [c-1].isOpenRight() )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmaze [offR] [c].setDistanceToExit( \r\n\t\t\t\t\t\t\t\tMath.min( maze [offR] [c-1].getDistanceToExit()+1,\r\n\t\t\t\t\t\t\t\t\t\t maze [offR] [c].getDistanceToExit() ) );\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\tfor ( int c = size-1; c >= size/2; c-- )\r\n\t\t\t\t{\r\n\t\t\t\t\tif ( offR == size-1 && maze [offR] [c].isOpenDown() )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmaze [offR] [c].setDistanceToExit( 1 );\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse if ( maze [offR] [c].isOpenDown() && maze [offR+1] [c].isOpenUp() )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmaze [offR] [c].setDistanceToExit( \r\n\t\t\t\t\t\t\t\tMath.min( maze [offR+1] [c].getDistanceToExit()+1,\r\n\t\t\t\t\t\t\t\t\t\t maze [offR] [c].getDistanceToExit() ) );\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif ( c == size-1 && maze [offR] [c].isOpenRight() )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmaze [offR] [c].setDistanceToExit( 1 );\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse if ( maze [offR] [c].isOpenRight() && maze [offR] [c+1].isOpenLeft() )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmaze [offR] [c].setDistanceToExit( \r\n\t\t\t\t\t\t\t\tMath.min( maze [offR] [c+1].getDistanceToExit()+1,\r\n\t\t\t\t\t\t\t\t\t\t maze [offR] [c].getDistanceToExit() ) );\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\treturn maze [currentRow] [currentCol].getDistanceToExit();\r\n\t}","public void union(BlastGraph<HitVertex, ValueEdge> graphToUnion) {\n\t\tfor (HitVertex hv : graphToUnion.getVertices()) {\n\t\t\tthis.addVertex(hv);\n\t\t}\n\n\t\tfor (ValueEdge ve : graphToUnion.getEdges()) {\n\t\t\tthis.addEdge(ve, graphToUnion.getEndpoints(ve));\n\t\t}\n\t}","public UnionFind(int n) {}","public void setSize(int size) {\n\t members = size;\n\t}","public int size(Tree<K, V> t, int size) {\n\t\tsize = left.size(left, size + 1);\n\t\tsize = right.size(right, size + 1);\n\t\treturn size;\n\t}","public Maze(int size) {\n \t\tthis.size = size;\n \t\ttarget = new Point(size, 1);\n \n \t\tvisited = new boolean[size + 2][size + 2];\n \t\tnorth = new boolean[size + 2][size + 2];\n \t\teast = new boolean[size + 2][size + 2];\n \t\tsouth = new boolean[size + 2][size + 2];\n \t\twest = new boolean[size + 2][size + 2];\n \t\t\n \t\tinit();\n \t\tcalculateCentre();\n \t\tcreateSwitches(); //needs to be done after centre is created\n \t\t\n \t\t //create 15 motion sensors, but don't create any in the centre\n \t\tms = new MotionSensors(size, 15, centreMin, centreMax);\n \t\t//System.out.println(ms); //print motion sensor coordinates\n \t\t\n \t\tcreateSubmarineMaze();//generates maze for the submarine\n \t}","public static ArrayList<ArrayList<String>> unionD(String table1Name, String table2Name){\n\t\tArrayList<ArrayList<String>> union = new ArrayList<ArrayList<String>>();\r\n\t\t//these will hold the data from the input tables\r\n\t\tArrayList<ArrayList<String>> columns1 = new ArrayList<ArrayList<String>>();\r\n\t\tArrayList<ArrayList<String>> columns2 = new ArrayList<ArrayList<String>>();\r\n\t\t//find the input tables in the database list\r\n\t\tfor (int i = 0; i < tables.size(); i++) {\r\n\t\t\tif (tables.get(i).getName().equals(table1Name)) {\r\n\t\t\t\tcolumns1 = new ArrayList<ArrayList<String>>(tables.get(i).datas);\r\n\t\t\t}\r\n\t\t\tif (tables.get(i).getName().equals(table2Name)) {\r\n\t\t\t\tcolumns2 = new ArrayList<ArrayList<String>>(tables.get(i).datas);\r\n\t\t\t}\r\n\t\t}\r\n\t\t//check if the tables are union compatable\r\n\t\tif (columns1.size() != columns2.size()) {\r\n\t\t\tSystem.out.println(\"Unable to perform union - unnequal number of columns.\");\r\n\t\t}\r\n\t\telse {\t//only continue if they are union compatable\r\n\t\t\t//true if all columns have the same type\r\n\t\t\tint sameTypes = 1;\r\n\t\t\tint type1 = 0;\r\n\t\t\tint type2 = 0;\r\n\t\t\t//a max char value of -1 indicates the type is integer\r\n\t\t\tfor (int j = 0; j < columns1.size(); j++) {\r\n\t\t\t\ttype1 = Integer.valueOf(new String(columns1.get(j).get(1)));\r\n\t\t\t\ttype2 = Integer.valueOf(columns2.get(j).get(1));\r\n\t\t\t\tif (type1 > 0) { type1 = 1; }\r\n\t\t\t\telse if (type1 < 0) { type1 = -1; }\r\n\t\t\t\tif (type2 > 0) { type2 = 1; }\r\n\t\t\t\telse if (type2 < 0) { type2 = -1; }\r\n\t\t\t\t//if the types were not equal, don't continue\r\n\t\t\t\tif (type1 != type2) {\r\n\t\t\t\t\tSystem.out.println(\"Unable to perform union - incompatible types.\");\r\n\t\t\t\t}\r\n\t\t\t\telse {\t//continue if the types are equal\r\n\t\t\t\t\t\t//create new columns holding the name from the first table and the greatest char max\r\n\t\t\t\t\tArrayList<String> newColumn = new ArrayList<String>();\r\n\t\t\t\t\tint largestChar = 0;\r\n\t\t\t\t\tif (type1 != -1) {\t//if they aren't integers\r\n\t\t\t\t\t\t//find the largest max char value\r\n\t\t\t\t\t\tif (Integer.parseInt(columns1.get(j).get(1)) >= Integer.parseInt(columns2.get(j).get(1))) {\r\n\t\t\t\t\t\t\tlargestChar = Integer.parseInt(new String(columns1.get(j).get(1)));\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\telse { \r\n\t\t\t\t\t\t\tlargestChar = Integer.parseInt(columns2.get(j).get(1)); \r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t\t//keep the type as integer\r\n\t\t\t\t\telse { \r\n\t\t\t\t\t\tlargestChar = -1; \r\n\t\t\t\t\t}\r\n\t\t\t\t\t\t//use the name from the first table and largest char max\r\n\t\t\t\t\tnewColumn.add(new String(columns1.get(j).get(0)));\r\n\t\t\t\t\tnewColumn.add(String.valueOf(largestChar));\r\n\t\t\t\t\tunion.add(newColumn);\r\n\t\t\t\t\t//check if there are equal rows to avoid duplicates\r\n\t\t\t\t\tint colCount = 0;\r\n\t\t\t\t\tfor (int n = 2; n < columns1.get(colCount).size(); n++) {\t//for each row in table1\r\n\t\t\t\t\t\tunion.get(j).add(new String(columns1.get(j).get(n)));\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\t\t\r\n\t\t\tfor(int t = 2; t<columns2.get(0).size(); t++){\t//column2 row\r\n\t\t\t\tboolean completeUniqe = true;\r\n\t\t\t\tfor(int p = 2; p < union.get(0).size(); p++){// rows of union\r\n\t\t\t\t\tint sameCount = 0;\r\n\t\t\t\t\tfor(int u = 0; u<union.size(); u++){//columns of union\r\n\t\t\t\t\t\tif(columns2.get(u).get(t).equals(union.get(u).get(p))){\r\n\t\t\t\t\t\t\tsameCount++;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t\tSystem.out.println(sameCount);\r\n\t\t\t\t\tif(sameCount == union.size()){\r\n\t\t\t\t\t\tcompleteUniqe = false;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\tif(completeUniqe){\r\n\t\t\t\t\tfor(int u = 0; u<union.size(); u++){//columns of union\r\n\t\t\t\t\t\tunion.get(u).add(new String(columns2.get(u).get(t)));\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn union;\r\n\t}","public void union(T x, T y) {\n\t\tassert (_parents.containsKey(x));\n\t\tassert (_parents.containsKey(y));\n\n\t\tx = find(x);\n\t\ty = find(y);\n\n\t\tif (x == y) {\n\t\t\treturn;\n\t\t}\n\n\t\tint xRank = _ranks.get(x);\n\t\tint yRank = _ranks.get(y);\n\n\t\tif (xRank < yRank) {\n\t\t\t_parents.put(x, y);\n\t\t} else if (xRank > yRank) {\n\t\t\t_parents.put(y, x);\n\t\t} else {\n\t\t\t_parents.put(y, x);\n\t\t\t_ranks.put(x, xRank + 1);\n\t\t}\n\n\t\t_numSets--;\n\t}","@Test void testInterpretUnion() {\n rootSchema.add(\"simple\", new ScannableTableTest.SimpleTable());\n final String sql = \"select * from \\\"simple\\\"\\n\"\n + \"union\\n\"\n + \"select * from \\\"simple\\\"\";\n sql(sql).returnsRowsUnordered(\"[0]\", \"[10]\", \"[20]\", \"[30]\");\n }","public void union(Vertex v1, Vertex v2) {\n\n // find the two vertices' path root\n Vertex r1 = find(v1);\n Vertex r2 = find(v2);\n\n // if the two roots are equal, just return\n if(r1.equals(r2)){\n return;\n } else if(r1.getSize()>r2.getSize()){\n // if the r1 path size is greater than r2\n // just change the vertex 2's root to vertex 1\n r2.setRoot(r1);\n // increment the size of r1 set\n r1.setSize(r2.getSize());\n } else {\n r1.setRoot(r2);\n r2.setSize(r1.getSize());\n }\n \n }","public static void QuasiThresholdEditingMinimization (Graph<Integer,String> g, int currentSize, EditSet S){\n\t\t\r\n\t\tboolean existsP4orC4 = false;\r\n\t\tif (currentSize >= minSoFarQTEdit) return; \r\n\t\t\r\n\t\t\r\n\t\tIterator<Integer> a = g.getVertices().iterator();\r\n\t\tIterator<Integer> b;\r\n\t\tIterator<Integer> c;\r\n\t\tIterator<Integer> d;\r\n\t\twhile(a.hasNext()){\r\n\t\t\tInteger A = a.next();\r\n\t\t\t//System.out.print(\"\"+A+\" \");\r\n\t\t\tb = g.getNeighbors(A).iterator();\r\n\t\t\twhile(b.hasNext()){\r\n\t\t\t\tInteger B = b.next();\r\n\t\t\t\tc = g.getNeighbors(B).iterator();\r\n\t\t\t\twhile (c.hasNext()){\r\n\t\t\t\t\tInteger C = c.next();\r\n\t\t\t\t\tif (g.isNeighbor(C, A) || C==A) continue;\r\n\t\t\t\t\td = g.getNeighbors(C).iterator();\r\n\t\t\t\t\twhile (d.hasNext()){\r\n\t\t\t\t\t\tInteger D = d.next();\r\n\t\t\t\t\t\tif (D==B) continue; \r\n\t\t\t\t\t\tif (g.isNeighbor(D,B)) continue;\r\n\t\t\t\t\t\t//otherwise, we have a P4 or a C4\r\n\r\n\t\t\t\t\t\texistsP4orC4 = true;\r\n\t\t\t\t\t\t//System.out.print(\"Found P4: \"+A+\"-\"+B+\"-\"+C+\"-\"+D+\"... not a cograph\\n\");\r\n\r\n\t\t\t\t\t\tif (g.isNeighbor(D,A)) {\r\n\t\t\t\t\t\t\t// we have a C4 = a-b-c-d-a\r\n\t\t\t\t\t\t\t// add a diagonal chord or delete any two edges\r\n\r\n\t\t\t\t\t\t\tif (S.isIn(A, C)==-1) {\r\n\t\t\t\t\t\t\t\tg.addEdge(\"e\"+A+\",\"+C, A,C);\r\n\t\t\t\t\t\t\t\tS.add(A,C);\r\n\t\t\t\t\t\t\t\tQuasiThresholdEditingMinimization(g,1+currentSize,S);\r\n\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(A, C));\r\n\t\t\t\t\t\t\t\tS.remove(A,C);\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\tif (S.isIn(B,D) == -1) {\r\n\t\t\t\t\t\t\t\tg.addEdge(\"e\"+B+\",\"+D, B,D);\r\n\t\t\t\t\t\t\t\tS.add(B,D);\r\n\t\t\t\t\t\t\t\tQuasiThresholdEditingMinimization(g,1+currentSize,S);\r\n\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(B,D));\r\n\t\t\t\t\t\t\t\tS.remove(B,D);\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\tif (S.isIn(A,B) == -1) {\r\n\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(A, B));\r\n\t\t\t\t\t\t\t\tS.add(A,B);\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tif (S.isIn(B,C) == -1) {\r\n\t\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(B, C));\r\n\t\t\t\t\t\t\t\t\tS.add(B,C);\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\tQuasiThresholdEditingMinimization(g,2+currentSize,S);\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\tg.addEdge(\"mar-\"+B+\"-\"+C, B,C);\r\n\t\t\t\t\t\t\t\t\tS.remove(B,C);\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tif (S.isIn(C,D) == -1) {\r\n\t\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(C, D));\r\n\t\t\t\t\t\t\t\t\tS.add(C,D);\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\tQuasiThresholdEditingMinimization(g,2+currentSize,S);\r\n\r\n\t\t\t\t\t\t\t\t\tg.addEdge(\"mar-\"+C+\"-\"+D, C,D);\r\n\t\t\t\t\t\t\t\t\tS.remove(C,D);\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\r\n\r\n\t\t\t\t\t\t\t\tif (S.isIn(D, A) == -1) {\r\n\t\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(D, A));\r\n\t\t\t\t\t\t\t\t\tS.add(D,A);\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\tQuasiThresholdEditingMinimization(g,2+currentSize,S);\r\n\r\n\t\t\t\t\t\t\t\t\tg.addEdge(\"mar-\"+D+\"-\"+A, D,A);\r\n\t\t\t\t\t\t\t\t\tS.remove(D,A);\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\t\tg.addEdge(\"mar-\"+A+\"-\"+B,A,B);\r\n\t\t\t\t\t\t\t\tS.remove(A, B);\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t// all cases with AB deleted are done.\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tif (S.isIn(D,A) == -1) {\r\n\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(D,A));\r\n\t\t\t\t\t\t\t\tS.add(D,A);\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tif (S.isIn(B,C) == -1) {\r\n\t\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(B, C));\r\n\t\t\t\t\t\t\t\t\tS.add(B,C);\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\tQuasiThresholdEditingMinimization(g,currentSize+2,S);\r\n\r\n\t\t\t\t\t\t\t\t\tg.addEdge(\"mar-\"+B+\"-\"+C, B,C);\r\n\t\t\t\t\t\t\t\t\tS.remove(B,C);\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\t\tif (S.isIn(C,D) == -1) {\r\n\t\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(C, D));\r\n\t\t\t\t\t\t\t\t\tS.add(C,D);\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\tQuasiThresholdEditingMinimization(g,currentSize+2,S);\r\n\r\n\t\t\t\t\t\t\t\t\tg.addEdge(\"mar-\"+C+\"-\"+D,C,D);\r\n\t\t\t\t\t\t\t\t\tS.remove(C,D);\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tg.addEdge(\"mar-\"+A+\"-\"+D, A,D);\r\n\t\t\t\t\t\t\t\tS.remove(D,A);\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t// all cases with AB deleted or AD deleted are done\r\n\t\t\t\t\t\t\t// only need to try BC and CD together deleted.\r\n\r\n\t\t\t\t\t\t\tif (S.isIn(B,C)== -1 && S.isIn(C, D)== -1) {\r\n\r\n\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(B, C));\r\n\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(C, D));\r\n\t\t\t\t\t\t\t\tS.add(B,C);\r\n\t\t\t\t\t\t\t\tS.add(C,D);\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tQuasiThresholdEditingMinimization(g,currentSize+2,S);\r\n\r\n\t\t\t\t\t\t\t\tg.addEdge(\"mar-\"+B+\"-\"+C, B,C);\r\n\t\t\t\t\t\t\t\tg.addEdge(\"mar-\"+C+\"-\"+D, C,D);\r\n\t\t\t\t\t\t\t\tS.remove(B,C);\r\n\t\t\t\t\t\t\t\tS.remove(C,D);\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\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t} // end of C4-handling cases\r\n\r\n\t\t\t\t\t\telse {\r\n\t\t\t\t\t\t\t// this case says:\r\n\t\t\t\t\t\t\t// else D is NOT adjacent to A. Then we have P4=abcd\r\n\t\t\t\t\t\t\t// either add ac or bd or else delete one edge\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t//int branchCase = randomInt(1,5);\t\r\n\t\t\t\t\t\t//if (branchCase <= 2) {\r\n\t\t\t\t\t\t\tif (S.isIn(A, C) == -1) {\r\n\t\t\t\t\t\t\t\tg.addEdge(\"e\"+A+\",\"+C, A, C);\r\n\t\t\t\t\t\t\t\tS.add(A,C);\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tQuasiThresholdEditingMinimization(g,currentSize+1,S);\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(A, C));\r\n\t\t\t\t\t\t\t\tS.remove(A,C);\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\tif (S.isIn(B,D) == -1) {\r\n\t\t\t\t\t\t\t\tg.addEdge(\"e\"+B+\",\"+D, B, D);\r\n\t\t\t\t\t\t\t\tS.add(B,D);\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tQuasiThresholdEditingMinimization(g,currentSize+1,S);\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(B, D));\r\n\t\t\t\t\t\t\t\tS.remove(B,D);\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t//}\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t//else if (branchCase == 3) {\r\n\t\t\t\t\t\t\tif (S.isIn(A,B)== -1) {\r\n\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(A, B));\r\n\t\t\t\t\t\t\t\tS.add(A, B);\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tQuasiThresholdEditingMinimization(g,currentSize+1,S);\r\n\r\n\t\t\t\t\t\t\t\tg.addEdge(\"mar-\"+A+\"-\"+B, A,B);\r\n\t\t\t\t\t\t\t\tS.remove(A,B);\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t//}\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t//else if (branchCase == 4) {\r\n\t\t\t\t\t\t\tif (S.isIn(B,C) == -1) {\r\n\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(B, C));\r\n\t\t\t\t\t\t\t\tS.add(B, C);\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tQuasiThresholdEditingMinimization(g,currentSize+1,S);\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tg.addEdge(\"mar-\"+B+\"-\"+C, B,C);\r\n\t\t\t\t\t\t\t\tS.remove(B,C);\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t//}\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t//else if (branchCase == 5) {\r\n\t\t\t\t\t\t\tif (S.isIn(C,D) == -1) {\r\n\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(C, D));\r\n\t\t\t\t\t\t\t\tS.add(C,D);\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tQuasiThresholdEditingMinimization(g,currentSize+1,S);\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tg.addEdge(\"mar-\"+C+\"-\"+D, C,D);\r\n\t\t\t\t\t\t\t\tS.remove(C,D);\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t//}\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t} // end of P4-handling\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\tif (existsP4orC4 == true) return;\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t} // end d.hasNext()\r\n\t\t\t\t} // end c.hasNext()\r\n\t\t\t} // end b.hasNext()\r\n\t\t} // end a.hasNext()\r\n\r\n\t\t// if we reached here, no P4 was found\r\n\t\tif (existsP4orC4 == false) {\r\n\t\t\t// arrived at a quasi-threshold graph since no P4 or C4 was found\r\n\t\t\tSystem.out.print(\"\\n currentSize = \"+currentSize+\" and minSoFar = \"+minSoFarQTEdit+\"\\n\");\r\n\t\t\tSystem.out.print(\"Modified(Edited) graph has \"+g.getEdgeCount()+\" edges and is:\\n\");\r\n\t\t\tminSoFarQTEdit = currentSize;\r\n\t\t\tSystem.out.print(\"\"+g+\"\\n\");\r\n\t\t\tSystem.out.print(\"Edit set is \" + S + \"\\n\");\r\n\t\t\tNewTools.printToFile(currentSize,g,S,\"QTEditLesMis.txt\");\r\n\t\t\treturn;\r\n\t\t}\r\n\t\t\r\n\t\t// ...\r\n\t\tSystem.out.print(\"Critical Error. No P_4 or C_4 found in a non-quasi-threshold graph.\\n\");\r\n\t\treturn;\r\n\t}","public void createMaze(int rows, int cols) {\n\t\t\n\t\tint total = rows*cols;\n\t\tDisjSets ds = new DisjSets(total); //Create an object of the disjoint set class\n\t\t \n\t\tList<List<Node>> maze = new ArrayList<List<Node>>();\n\t\t \n\t\tmaze = initializeMaze(rows, cols, maze); //Initialize the maze\n\t\t \n\t\tRandom rand = new Random();\n\t\t \n\t\twhile(ds.find(0) != ds.find(total - 1)) {\n\t\t\t \n\t\t\tint currRow = rand.nextInt(rows); //Random row number\n\t\t\tint currCol = rand.nextInt(cols); //Random column number\n\t\t\tNode currNode = maze.get(currRow).get(currCol); //Current node(cell)\n\t\t\tint currValue = currNode.value;\n\t\t\t \n\t\t\tint root1 = ds.find(currValue); //Find on current node(cell)\n\t\t\tint root2;\n\t\t\tboolean removeHorizontal = false;\n\t\t\t \n\t\t\tif(currValue == total - 1) {\n\t\t\t\tcontinue; //Don't do anything if the current cell is the bottom-rightmost cell\n\t\t\t}\n\t\t\t \n\t\t\tif(currRow == rows - 1) {\n\t\t\t\t//Last row -- can only break the right wall, can't break the wall to the bottom \n\t\t\t\troot2 = ds.find(currValue + 1);\n\t\t\t} else if(currCol == cols - 1) {\n\t\t\t\t//Last column -- can only break the wall to the bottom, can't break the right wall \n\t\t\t\troot2 = ds.find(currValue + cols);\n\t\t\t\tremoveHorizontal = true;\n\t\t\t} else {\n\t\t\t\t//Neither last row nor last column\n\t\t\t\t//Randomly select either right wall or wall to the bottom to break\n\t\t\t\tboolean selectRight;\n\t\t\t\tselectRight = rand.nextBoolean();\n\t\t\t\t \n\t\t\t\tif(selectRight) {\n\t\t\t\t\troot2 = ds.find(currValue + 1);\n\t\t\t\t} else {\n\t\t\t\t\troot2 = ds.find(currValue + cols);\n\t\t\t\t\tremoveHorizontal = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\t//Finds resulted in different sets\n\t\t\tif(root1 != root2) {\n\t\t\t\t \n\t\t\t\tds.union(root1, root2); //Take union of the two sets\n\t\t\t\t \n\t\t\t\tif(removeHorizontal) {\n\t\t\t\t\tcurrNode.horizontal = false; //Break the horizontal wall\n\t\t\t\t} else {\n\t\t\t\t\tcurrNode.vertical = false; //Break the vertical wall\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\t//Leave the bottom right corner open\n\t\tNode destination = maze.get(rows - 1).get(cols - 1);\n\t\tdestination.horizontal = false;\n\t\tdestination.vertical = false;\n\t\t \n\t\tprintMaze(rows, cols, maze); //Print the final maze\n\t}","static void constructUnionFindDataStructure() {\n\n\t\t// construct a scanner for an input file\n\t\tScanner scanner = null;\n\t\ttry {\n\n\t\t\tscanner = new Scanner(new File(\"tinyUF.txt\"));\n\t\t} \n\t\tcatch (FileNotFoundException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\n\t\t// read the number of objects from the standard input\n\t\tint n = Integer.parseInt(scanner.nextLine());\n\n\t\t// initialise a union-find data structure\n\t\tUnionFind unionFind = new UnionFind(n);\n\n\t\t/* Repeatedly read in pairs of integers (object identifiers). If they are not yet connected, connect them\n\t\t * and print out the pair */\n\n\t\twhile (scanner.hasNextLine()) {\n\n\t\t\t// read integers\n\t\t\tString pair = scanner.nextLine();\n\t\t\tString[] objects = pair.split(\" \");\n\t\t\tint p = Integer.parseInt(objects[0]);\n\t\t\tint q = Integer.parseInt(objects[1]);\n\n\t\t\t// connect them if not already\n\t\t\tif (!unionFind.connected(p, q)) {\n\n\t\t\t\tunionFind.union(p, q);\n\t\t\t\tSystem.out.println(p + \" \" + q);\n\t\t\t}\n\t\t}\n\t}","static int[][] unite4arrays(Map<Integer, int[][]> map, int size) {\n int sqrt = (int) Math.sqrt( map.keySet().size());\n int[][] result = new int[size * sqrt][size * sqrt];\n for (int i = 0; i < map.keySet().size(); i++) {\n\n for (int x = 0; x < size; x++) {\n for (int y = 0; y < size; y++) {\n result[x + size * (i % sqrt)][y + size * (i / sqrt)] = map.get(i)[x][y];\n }\n }\n\n }\n return result;\n }","public static void main( String [ ] args )\r\n {\r\n \r\n \t\r\n \t\r\n \tint maze_row=0;\r\n \tint maze_column=0;\r\n \t\r\n\t\t\r\n\t\tScanner type = new Scanner(System.in);\r\n\t\t\r\n\t\t\r\n\t\tdo\r\n\t\t\t{\r\n\t\t\ttry \r\n\t\t\t\r\n\t\t\t{\r\n\t\t\t\tSystem.out.print(\"Please enter number of row between 1 and 20: \");\r\n\t\t\t\tmaze_row = Integer.valueOf(type.next());\r\n\t\t\t}\r\n\t\t\tcatch (NumberFormatException e)\r\n\t\t\t{\r\n\t\t\t\t//System.out.println(\"Input didn't match with the requirement: Try Again\");\r\n\t\t\t\tmaze_row=21;\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t\t}\r\n\t\twhile(maze_row>20 || maze_row<1);\r\n\t\tdo\r\n\t\t{\r\n\t\ttry \r\n\t\t\r\n\t\t{\r\n\t\t\tSystem.out.print(\"Please enter number of column between 1 and 20: \");\r\n\t\t\tmaze_column = Integer.valueOf(type.next());\r\n\t\t}\r\n\t\tcatch (NumberFormatException e)\r\n\t\t{\r\n\t\t\t//System.out.println(\"Input didn't match with the requirement: Try Again\");\r\n\t\t\tmaze_column=21;\r\n\t\t\t\t\r\n\t\t}\r\n\t\t}\r\n\twhile(maze_column>20 ||maze_column<1);\r\n\t\t\r\n\t\ttype.close();\r\n\t\tSystem.out.println();\r\n \tcreateMaze(maze_row,maze_column);\r\n \tshowMaze();\r\n \t\r\n \t\r\n \t\r\n \t\r\n \t\r\n \t\r\n \t\r\n \t\r\n \t/* int NumElements = 128;\r\n int NumInSameSet = 16;\r\n\r\n DisjSets ds = new DisjSets( NumElements );\r\n int set1, set2;\r\n\r\n for( int k = 1; k < NumInSameSet; k *= 2 )\r\n {\r\n for( int j = 0; j + k < NumElements; j += 2 * k )\r\n {\r\n set1 = ds.find( j );\r\n set2 = ds.find( j + k );\r\n ds.union( set1, set2 );\r\n }\r\n }\r\n\r\n for( int i = 0; i < NumElements; i++ )\r\n {\r\n System.out.print( ds.find( i )+ \"*\" );\r\n if( i % NumInSameSet == NumInSameSet - 1 )\r\n System.out.println( );\r\n }\r\n System.out.println( );*/\r\n }","public void updateUnionArea() {\n this.mBlurUnionRect.setEmpty();\n for (Map.Entry<View, HwBlurEntity> entityEntry : this.mTargetViews.entrySet()) {\n View targetView = entityEntry.getKey();\n HwBlurEntity blurEntity = entityEntry.getValue();\n if (targetView.isShown() && blurEntity.isEnabled()) {\n Rect targetViewRect = new Rect();\n targetView.getGlobalVisibleRect(targetViewRect);\n blurEntity.setTargetViewRect(targetViewRect);\n this.mBlurUnionRect.union(targetViewRect);\n }\n targetView.invalidate();\n }\n initBitmapAndCanvas();\n }","private void unionSmallLarge(int small, int large) {\n unionStart = System.currentTimeMillis();\n\n log.debug(\" --- union smallID=\" + small + \", largeID=\" + large);\n\n int moveCount = 0;\n for (int i = 0; i < vertexUnionLeaders.length; i++) {\n if (vertexUnionLeaders[i] == small) {\n\n\n log.debug(\" changing \" + i + \" from old smallID=\" + small + \" to new largeD=\" + large);\n vertexUnionLeaders[i] = large;\n moveCount++;\n }\n }\n\n // update the large group member count\n ClusterGroup lGroup = clusterGroupMap.get(large);\n if (lGroup == null) {\n lGroup = new ClusterGroup(large, 1);\n clusterGroupMap.put(large, lGroup);\n log.debug(\" created new ClusterGroup for largeID=\" + large + \", size=1\");\n }\n int lSize = lGroup.groupSize;\n log.debug(\" old group size=\" + lSize + \", about to add smallID size=\" + moveCount);\n lSize += moveCount;\n lGroup.groupSize = lSize;\n log.debug(\" groupID=\" + lGroup.groupID + \" size=\" + lSize);\n\n // now remove the small group from the map\n clusterGroupMap.remove(small);\n unionEnd = System.currentTimeMillis();\n }","public void setStructureSize(int size) {\n\t\tmStructureSize = size;\n\t\tvalidateSize();\n\t\trepaint();\n\t\t}","public void trimToSize();","public void setSize(int size) {\n\t\tdist = new double[size];\n\t\tprev = new Node[size];\n\t\tready = new boolean[size];\n\t}","@Test\n public void testUnionOnSchemaSameSchema() throws Exception {\n PigServer pig = new PigServer(Util.getLocalTestMode());\n String query =\n \" l1 = load '\" + INP_FILE_2NUMS + \"' as (i : int, j : int);\"\n + \"l2 = load '\" + INP_FILE_2NUMS + \"' as (i : int, j : int);\"\n + \"u = union onschema l1, l2;\"\n ; \n Util.registerMultiLineQuery(pig, query);\n Schema expectedSch = Utils.getSchemaFromString(\"i: int, j: int\");\n Schema sch = pig.dumpSchema(\"u\");\n assertEquals(\"Checking expected schema\",sch, expectedSch);\n Iterator<Tuple> it = pig.openIterator(\"u\");\n \n List<Tuple> expectedRes = \n Util.getTuplesFromConstantTupleStrings(\n new String[] {\n \"(1,2)\",\n \"(5,3)\",\n \"(1,2)\",\n \"(5,3)\"\n });\n Util.checkQueryOutputsAfterSort(it, expectedRes);\n\n }","public static void main(String[] args) throws IOException{\n Scanner f = new Scanner(System.in);\n //BufferedReader f = new BufferedReader(new FileReader(\"uva.in\"));\n //BufferedReader f = new BufferedReader(new InputStreamReader(System.in));\n PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\n while(true) {\n int C = f.nextInt();\n int R = f.nextInt();\n if(C == 0 && R == 0) {\n break;\n }\n HashMap<String,Integer> getIndex = new HashMap<>();\n for(int i = 0; i < C; i++) {\n getIndex.put(f.next(),i);\n }\n int[] leaderIds = new int[C];\n int[] groupSizes = new int[C];\n for(int i = 0; i < C; i++) {\n leaderIds[i] = i;\n groupSizes[i] = 1;\n }\n for(int i = 0; i < R; i++) {\n int p = getIndex.get(f.next());\n int q = getIndex.get(f.next());\n if(root(leaderIds,p) != root(leaderIds,q)) {\n union(leaderIds,groupSizes,p,q);\n }\n }\n int max = 0;\n for(int i = 0; i < C; i++) {\n int p = root(leaderIds,i);\n max = Math.max(max,groupSizes[p]);\n }\n out.println(max);\n }\n f.close();\n out.close();\n }","public QueueArrayShiftingVirtualOverflow(int size) {\n super(size);\n }","void Union(int parent[], int x, int y){ \n int xset = find(parent, x); \n int yset = find(parent, y); \n parent[xset] = yset; \n }","public int state_build_regions(HashMap<Integer, Integer> rmap) {\r\n\t\tUnionFind u=new UnionFind();\r\n\t\t\r\n\t\t//build Unionfind\r\n\t\tfor(Integer nodeIndex:allNodes.keySet()) {\r\n\t\t\r\n\t\t\tLinkedList<Integer> neighborsIndex=nowMap.get(nodeIndex);\r\n\t\t\tif(allNodes.get(nodeIndex).path==0) {\r\n\t\t\t\tfor(Integer nIndex:neighborsIndex) {\r\n\t\t\t\t\tif(allNodes.get(nIndex).path==0)\r\n\t\t\t\t\t\tu.union(allNodes.get(nIndex),allNodes.get(nodeIndex));\r\n\t\t\t\t}\r\n\t\t\t} else if(allNodes.get(nodeIndex).path!=0) {\r\n\t\t\t\tfor(Integer nIndex:neighborsIndex) {\r\n\t\t\t\t\tif(allNodes.get(nIndex).path!=0)\r\n\t\t\t\t\t\tu.union(allNodes.get(nIndex),allNodes.get(nodeIndex));\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\t\tint rcount=1;\r\n\t\tLinkedList<Node> count=new LinkedList<Node>();\r\n\t\t//find regions\r\n\t\tfor(Integer nIndex:allNodes.keySet()) {\r\n\t\t\tNode n=allNodes.get(nIndex);\r\n\t\t\tNode np=u.find(n);\r\n\t\t\t\r\n\t\t\t\r\n\t\t\tif(np.path==0) {\r\n\t\t\t\tif(count.contains(np)) {\r\n\t\t\t\t\trmap.put(nIndex, count.indexOf(np)+1);\r\n\t\t\t\t}\r\n\t\t\t\telse {\r\n\t\t\t\t\tcount.add(np);\r\n\t\t\t\t\trmap.put(nIndex, count.indexOf(np)+1);\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t}else {\r\n\t\t\t\trmap.put(nIndex, -1);\r\n\t\t\t}\r\n\t\t\t\t\r\n\t\t}\r\n\t\r\n\t\treturn rcount;\r\n\t}","public org.apache.gora.cascading.test.storage.TestRow getUnionRecursive() {\n return unionRecursive;\n }","public boolean setSize(Size size, boolean force) {\n// if (!force) {\n// Entity intersectsWith = location.getWorld().intersects(this, Util.getRectangle(getLocation(), size));\n//\n// if (intersectsWith != null) {\n// boolean left = intersectsWith.getLocation().getX() + intersectsWith.getSize().getWidth() <= getLocation().getX();\n// boolean right = intersectsWith.getLocation().getX() <= getLocation().getX() + size.getWidth();\n// boolean top = intersectsWith.getLocation().getY() <= getLocation().getY() + size.getHeight() && intersectsWith.getLocation().getY() > getLocation().getY();\n//\n//// if (top && !left && !right)\n//// return false;\n//\n// Location moveTo = null;\n//\n// if (left)\n// moveTo = new Location(getWorld(), intersectsWith.getLocation().getX() + intersectsWith.getSize().getWidth() + size.getWidth(), getLocation().getY());\n// if (right)\n// moveTo = new Location(getWorld(), intersectsWith.getLocation().getX() - size.getWidth() - 1, getLocation().getY());\n// if (top) {\n// this.size.setHeight(intersectsWith.getLocation().getY() - this.location.getY());\n// System.out.println(this.size.getHeight());\n//// return false;\n// }\n//\n// if (moveTo != null) {\n// Entity intersects = location.getWorld().intersects(this, Util.getRectangle(moveTo, size));\n//\n// if (intersects == null && this.location.asVector().distance(moveTo.asVector()) < 15)\n// this.location = moveTo;\n// else return false;\n// }\n// }\n// }\n\n if (interactingWithX != null || interactingWithY != null) {\n boolean left = interactingWithX != null && interactingWithX.getLocation().getX() + interactingWithX.size.width <= getLocation().getX();\n boolean right = interactingWithX != null && interactingWithX.getLocation().getX() <= getLocation().getX() + size.width;\n boolean top = interactingWithY != null && (interactingWithY.getLocation().getY() <= getLocation().getY() + size.height && interactingWithY.getLocation().getY() > getLocation().getY());\n\n// if (top && !left && !right)\n// return false;\n\n Location moveTo = null;\n\n if (left)\n moveTo = new Location(getWorld(), interactingWithX.getLocation().getX() + interactingWithX.size.width + size.width, getLocation().getY());\n if (right)\n moveTo = new Location(getWorld(), interactingWithX.getLocation().getX() - size.width - 1, getLocation().getY());\n if (top) {\n this.size.height = interactingWithY.getLocation().getY() - this.location.getY();\n System.out.println(this.size.height);\n// return false;\n }\n\n if (moveTo != null) {\n Entity intersects = location.getWorld().intersects(this, Util.getRectangle(moveTo, size));\n\n if (intersects == null && this.location.asVector().distance(moveTo.asVector()) < 15)\n this.location = moveTo;\n else return false;\n }\n }\n\n this.size = size;\n return true;\n }","@Override\n public void union(int root1, int root2) {\n // TODO: Implement the union-by-rank algorithm for disjoint set\n if (s[root1]>-1 || s[root2]>-1 ) throw new IllegalArgumentException(\"Impossible to union because one of the roots is already dependant\");\n if( s[root2] < s[root1]){ // root2 is deeper\n s[root1] = root2;// Make root2 new root\n } \n else{\n if(s[root1] == s[root2]) s[ root1 ]--; // Update height if same\n s[root2] = root1; // Make root1 new root\n }\n }","public QuadTree(PointView<Point> view, int transitionSize) {\n super(view);\n _transitionSize = transitionSize;\n _nodeOrigin = new double[2];\n _elements = new ArrayList<Point>();\n _subdivided = false;\n _elementsSize = 0;\n _treeSize = 0;\n }","@Test\n public void testSize(){\n assertEquals(25, largeMaze.size());\n }","public void open(int row, int col){\n\t\tif (row <= 0 || col <= 0 || row > storeVar || col > storeVar) \n\t\t\tthrow new IllegalArgumentException(\"row index i out of bounds\");\n\n\t\t// System.out.println(\"\\n We're opening again! \");\n\t\tint currIndex = ((row-1)*storeVar) + col;\n\n\t\tif (isOpen(row, col)) return;\n\t\topenSites++;\n\t\tgrid[currIndex] = true;\n\n\n\t\tif (currIndex < storeVar+1 ){\n\t\t\tunionFind.union(currIndex, virtualTop);\n\t\t\tbackwash.union(currIndex, virtualTop);\n\t\t\tfullgrid[currIndex] = true;\n\t\t}\n\t\tif ((currIndex < grid.length - 1) && (currIndex >= (grid.length - 1 - storeVar))){\n\t\t\t// System.out.println(\"Confirmed that bottom is connected\");\n\t\t\tunionFind.union(currIndex, virtualBottom);\n\t\t}\n\n\t\t\n\t\tif(row + 1 <= storeVar && isOpen(row + 1, col)){\n\t\t\tif (!unionFind.connected(currIndex, currIndex+storeVar)) {\n\t\t\t\tunionFind.union(currIndex, currIndex+storeVar);\n\t\t\t\tbackwash.union(currIndex, currIndex+storeVar);\n\t\t\t}\n\t\t}\n\t\tif(col + 1 <= storeVar && isOpen(row , col+1)){\n\t\t\tif (!unionFind.connected(currIndex, currIndex+1)) {\n\t\t\t\tunionFind.union(currIndex, currIndex+1);\n\t\t\t\tbackwash.union(currIndex, currIndex+1);\n\t\t\t}\n\t\t}\n\t\tif(row - 1 > 0 && isOpen(row - 1, col)){\n\t\t\tif (!unionFind.connected(currIndex, currIndex-storeVar)){ \n\t\t\t\tunionFind.union(currIndex, currIndex-storeVar);\n\t\t\t\tbackwash.union(currIndex, currIndex-storeVar);\n\t\t\t}\n\t\t}\n\t\tif(col - 1 > 0 && isOpen(row , col-1)){\n\t\t\tif (!unionFind.connected(currIndex, currIndex-1)){\n\t\t\t unionFind.union(currIndex, currIndex-1);\n\t\t\t backwash.union(currIndex, currIndex-1);\n\t\t\t}\n\t\t}\n\t}","public static void QTdeletionMinimization (Graph<Integer,String> g, int currentSize) {\n\t\t\r\n\t\tboolean existsP4orC4 = false;\r\n\t\t\r\n\t\t//int temp = QTDelHeuristic1(Copy(g));\r\n\t\t//System.out.print(\"n = \"+g.getVertexCount()+\" m=\"+g.getEdgeCount()+\" hVal = \"+temp +\"\\n\");\r\n\t\tif (currentSize >= minSoFar) return; \r\n\t\tIterator<Integer> a = g.getVertices().iterator();\r\n\t\tIterator<Integer> b;\r\n\t\tIterator<Integer> c;\r\n\t\tIterator<Integer> d;\r\n\t\twhile(a.hasNext()){\r\n\t\t\tInteger A = a.next();\r\n\t\t\t//System.out.print(\"\"+A+\" \");\r\n\t\t\tb = g.getNeighbors(A).iterator();\r\n\t\t\twhile(b.hasNext()){\r\n\t\t\t\tInteger B = b.next();\r\n\t\t\t\tc = g.getNeighbors(B).iterator();\r\n\t\t\t\twhile (c.hasNext()){\r\n\t\t\t\t\tInteger C = c.next();\r\n\t\t\t\t\tif (g.isNeighbor(C, A) || C==A) continue;\r\n\t\t\t\t\td = g.getNeighbors(C).iterator();\r\n\t\t\t\t\twhile (d.hasNext()){\r\n\t\t\t\t\t\tInteger D = d.next();\r\n\t\t\t\t\t\tif (D==B) continue; \r\n\t\t\t\t\t\tif (g.isNeighbor(D,B)) continue;\r\n\t\t\t\t\t\t//otherwise, we have a P4 or a C4\r\n\r\n\t\t\t\t\t\texistsP4orC4 = true;\r\n\t\t\t\t\t\tif (currentSize + 1 >= minSoFar) return;\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t//System.out.print(\"Found P4: \"+A+\"-\"+B+\"-\"+C+\"-\"+D+\"... not a cograph\\n\");\r\n\t\t\t\t\t\tif (g.isNeighbor(D,A)) {\r\n\t\t\t\t\t\t\t// we have a C4 = a-b-c-d-a\r\n\t\t\t\t\t\t\t// delete any two edges\r\n\t\t\t\t\t\t\tif (currentSize + 2 >= minSoFar) return;\r\n\r\n\t\t\t\t\t\t\tg.removeEdge(g.findEdge(A, B));\r\n\r\n\t\t\t\t\t\t\tg.removeEdge(g.findEdge(B, C));\r\n\t\t\t\t\t\t\tQTdeletionMinimization(g,2+currentSize);\r\n\t\t\t\t\t\t\tg.addEdge(\"mar-\"+B+\"-\"+C, B,C);\r\n\r\n\t\t\t\t\t\t\tg.removeEdge(g.findEdge(C, D));\r\n\t\t\t\t\t\t\tQTdeletionMinimization(g,2+currentSize);\r\n\t\t\t\t\t\t\tg.addEdge(\"mar-\"+C+\"-\"+D, C,D);\r\n\r\n\r\n\t\t\t\t\t\t\tg.removeEdge(g.findEdge(D, A));\r\n\t\t\t\t\t\t\tQTdeletionMinimization(g,2+currentSize);\r\n\t\t\t\t\t\t\t//g.addEdge(\"mar-\"+A+\"-\"+D, A,D);\r\n\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tg.addEdge(\"mar-\"+A+\"-\"+B, A,B);\r\n\t\t\t\t\t\t\t// all cases with AB deleted are done. AD is STILL deleted\r\n\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tg.removeEdge(g.findEdge(B, C));\r\n\t\t\t\t\t\t\tQTdeletionMinimization(g,2+currentSize);\r\n\t\t\t\t\t\t\tg.addEdge(\"mar-\"+B+\"-\"+C, B,C);\r\n\r\n\t\t\t\t\t\t\tg.removeEdge(g.findEdge(C, D));\r\n\t\t\t\t\t\t\tQTdeletionMinimization(g,2+currentSize);\r\n\r\n\t\t\t\t\t\t\t// all cases with AB deleted or AD deleted are done\r\n\t\t\t\t\t\t\t// at this point, CD and AD are still deleted\r\n\t\t\t\t\t\t\t// only need to try BC and CD together deleted.\r\n\t\t\t\t\t\t\tg.addEdge(\"mar-\"+A+\"-\"+D, A,D);\r\n\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tg.removeEdge(g.findEdge(B, C));\r\n\t\t\t\t\t\t\tQTdeletionMinimization(g,2+currentSize);\r\n\r\n\t\t\t\t\t\t\tg.addEdge(\"mar-\"+B+\"-\"+C, B,C);\r\n\t\t\t\t\t\t\tg.addEdge(\"mar-\"+C+\"-\"+D, C,D);\r\n\t\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\r\n\t\t\t\t\t\telse {\r\n\t\t\t\t\t\t\t// this case says:\r\n\t\t\t\t\t\t\t// else D is NOT adjacent to A. Then we have P4=abcd\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tint choice = randomInt(1,4);\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tif (choice == 1) {\r\n\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(A, B));\r\n\t\t\t\t\t\t\t\tQTdeletionMinimization(g,1+currentSize);\r\n\t\t\t\t\t\t\t\tg.addEdge(\"mar-\"+A+\"-\"+B, A,B);\r\n\t\t\t\t\t\t\t}\t\t\t\t\t\r\n\r\n\t\t\t\t\t\t\telse if (choice == 2) {\r\n\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(C, D));\r\n\t\t\t\t\t\t\t\tQTdeletionMinimization(g,1+currentSize);\r\n\t\t\t\t\t\t\t\tg.addEdge(\"mar-\"+C+\"-\"+D, C,D);\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\telse {\r\n\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(B, C));\r\n\t\t\t\t\t\t\t\tQTdeletionMinimization(g,1+currentSize);\r\n\t\t\t\t\t\t\t\tg.addEdge(\"mar-\"+B+\"-\"+C, B,C);\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\tif (existsP4orC4==true) {\r\n\t\t\t\t\t\t\t// it found an obstruction and branched on all its ways.\r\n\t\t\t\t\t\t\t// No need to deal with this graph further.\r\n\t\t\t\t\t\t\treturn;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t} // end d.hasNext()\r\n\t\t\t\t} // end c.hasNext()\r\n\t\t\t} // end b.hasNext() \r\n\t\t} // end a.hasNext()\r\n\r\n\t\t// if we reached here, no P4 was found\r\n\t\tif (existsP4orC4 == false) {\r\n\t\t\t// arrived at a quasi-threshold graph since no P4 or C4 was found\r\n\t\t\tSystem.out.print(\"\\n currentSize = \"+currentSize+\" and minSoFar = \"+minSoFar+\"\\n\");\r\n\t\t\tSystem.out.print(\"Modified graph has \"+g.getEdgeCount()+\" edges and is:\\n\");\r\n\t\t\tminSoFar = currentSize;\r\n\t\t\tSystem.out.print(\"\"+g+\"\\n\");\r\n\t\t\tNewTools.printToFile(currentSize,g,null,\"QTDel.txt\");\r\n\t\t\t//NewTools.DrawIt(g);\r\n\t\t\t//PleaseWait(60000); // one minute\r\n\t\t\treturn;\r\n\t\t}\r\n\t\t\r\n\t\t// ...\r\n\t\tSystem.out.print(\"Critical Error. No P_4 or C_4 found in a non-quasi-threshold graph.\\n\");\r\n\t\treturn;\r\n\r\n\t\t\r\n\t}","void resize() {\n Comparable[] temp = new Comparable[size * 2];\n for (int i = 0; i < pq.length; i++) {\n temp[i] = pq[i];\n }\n pq = temp;\n }","public org.apache.gora.cascading.test.storage.TestRow getUnionRecursive() {\n return unionRecursive;\n }","public void quickUnion(int p, int q) {\n int pid = find(p);\n int qid = find(q);\n if (pid == qid) return;\n //compare two value's height\n //if two height is same just need add 1 in parent root\n if (height[p] == height[q]) {\n id[pid] = qid;\n height[qid]++;\n } else if (height[p] < height[q]) {\n id[pid] = qid;\n } else {\n id[qid] = pid;\n }\n\n }","public UnionFind(int n) {\n\troot = new int[n];\n\tfor (int i = 0; i < n; i++) \n\t root[i] = i;\n\t\n\tsize = new int[n];\n\tfor (int i = 0; i < n; i++) \n\t size[i] = 1;\n }","public XSUnionSimpleType asUnion() {\n // This method could not be decompiled.\n // \n // Original Bytecode:\n // \n // 0: ddiv \n // 1: fdiv \n // LocalVariableTable:\n // Start Length Slot Name Signature\n // ----- ------ ---- ---- -------------------------------------------\n // 0 2 0 this Lcom/sun/xml/xsom/impl/UnionSimpleTypeImpl;\n // \n // The error that occurred was:\n // \n // java.lang.ArrayIndexOutOfBoundsException\n // \n throw new IllegalStateException(\"An error occurred while decompiling this method.\");\n }","@Test\r\n\t\tpublic void testUnion() {\n\t\t\ttestingSet = new IntegerSet(list1);\r\n\t\t\ttestingSet2= new IntegerSet(list2);\r\n\t\t\t// 3rd set =to the union of the two lists \r\n\t\t\ttestingSet3= new IntegerSet(union);\r\n\t\t\t// 4th set equal to the union of sets 1 and 2 \r\n\t\t\ttestingSet4= testingSet.union(testingSet, testingSet2);\r\n\t\t\t// sets 3 and 4 should be equal\r\n\t\t\t// assertEquals method is deprecated \r\n\t\t\tassertArrayEquals(testingSet3.toArray(),testingSet4.toArray());\r\n\t\t\t \r\n\t\t}","public void sizeBy(float size) {\n internalGroup.sizeBy(size);\n dataTrait.width = internalGroup.getWidth();\n dataTrait.height = internalGroup.getHeight();\n resetSprite();\n }","public T union( T obj1, T obj2 )\n {\n // Find the root of each object; if either is not contained, the root\n // value will be null, and we throw an exception.\n Node root1 = getRoot(nodes.get(obj1));\n Node root2 = getRoot(nodes.get(obj2));\n if ( root1 == null && root2 == null )\n throw new NoSuchElementException( \"Sets do not contain either object: \" + obj1 + \", \" + obj2 );\n if ( root1 == null )\n throw new NoSuchElementException( \"Sets do not contain object: \" + obj1 );\n if ( root2 == null )\n throw new NoSuchElementException( \"Sets do not contain object: \" + obj2 );\n // If already were in same set, just return data from the root of that\n // set.\n if ( root1 == root2 )\n return root1.data;\n // If not already, then doing union reduces overall number of sets.\n numSets-- ;\n // We use root2 as the new parent if either (a) the trees containing\n // both inputs have same rank and a \"coin toss\" settles on this case,\n // or (b) the tree containing obj1 has lower rank.\n if ( ( root1.rank == root2.rank && Math.random() < 0.5 ) || root1.rank < root2.rank )\n {\n // When we link root1 to root2, size of set under root2 inreases.\n root1.parent = root2;\n root2.size += root1.size;\n \n // When we union two sets of same rank, new root gets higher rank.\n if ( root1.rank == root2.rank )\n root2.rank++ ;\n \n return root2.data;\n }\n else\n // We use root1 as the new parent if either (a) the trees containing\n // both inputs have same rank and a \"coin toss\" settles on this\n // case, or (b) the tree containing obj2 has lower rank.\n {\n // When we link root1 to root2, size of set under root2 inreases.\n root2.parent = root1;\n root1.size += root2.size;\n \n // When we union two sets of same rank, new root gets higher rank.\n if ( root1.rank == root2.rank )\n root1.rank++ ;\n \n return root1.data;\n }\n }","private int pack(int size, int sum) {\n return size | (sum << 16);\n }","public BSTSet union(BSTSet s) {\n int[] thisArray = BSTToArray();\n int[] sArray = s.BSTToArray();\n int[] unionArray = new int[thisArray.length + sArray.length];\n int unionArrayIndex = 0;\n\n // add both arrays together\n for (int i = 0; i < thisArray.length; i++) {\n unionArray[unionArrayIndex++] = thisArray[i];\n }\n\n for (int i = 0; i < sArray.length; i++) {\n unionArray[unionArrayIndex++] = sArray[i];\n }\n\n return new BSTSet(unionArray);\n }","@Test\n public void testSmallSize(){\n assertEquals(9, smallMaze.size());\n }","public void setUnionRecursive(org.apache.gora.cascading.test.storage.TestRow value) {\n this.unionRecursive = value;\n setDirty(3);\n }","public static void main(String[] args)throws Exception {\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\r\n int testCases = Integer.parseInt(br.readLine());\r\n //loop through all test cases\r\n for(int q = 0; q < testCases; q++){\r\n int iterator = 0;\r\n //initilize variables\r\n size = new ArrayList<Integer>();position = new ArrayList<Integer>();network = new HashMap<String, Integer>();\r\n int relationships = Integer.parseInt(br.readLine());\r\n //loop through all relationships\r\n for(int v = 0; v < relationships; v++){\r\n String[] people = br.readLine().split(\" \");\r\n String person1 = people[0]; String person2 = people[1];\r\n //add two people to the netword and union their roots\r\n if(!network.containsKey(person1)){network.put(person1, iterator); position.add(iterator++); size.add(1);}\r\n if(!network.containsKey(person2)){network.put(person2, iterator); position.add(iterator++); size.add(1);}\r\n union(person1,person2);\r\n //print output\r\n System.out.println(size.get(find(person1)));\r\n }\r\n }\r\n }","public void open(int row, int col) {\n\t\tif (!isOpen(row, col)) {\n\t\t\tgrid[row - 1][col - 1] = true;\n\t\t\topenCount++;\n\t\t}\n\t\tint indexInUF = getUnionIndex(row, col);\n\n\t\t// left neighbor\n\t\tunionIfOpen(indexInUF, row, col - 1);\n\n\t\t// right neighbor\n\t\tunionIfOpen(indexInUF, row, col + 1);\n\n\t\t// top neighbor\n\t\tunionIfOpen(indexInUF, row + 1, col);\n\n\t\t// bottom neighbor\n\t\tunionIfOpen(indexInUF, row - 1, col);\n\n\t\tif (row == 1) {\n\t\t\t// union to virtual top index\n\t\t\tuf.union(0, indexInUF);\n\t\t}\n\n\t\tif (row == size) {\n\t\t\t// union to virtual bottom index\n\t\t\tuf.union(size * size + 1, indexInUF);\n\t\t}\n\t}","@Test\n public void testUnionOnSchemaInputUdfs() throws Exception {\n PigServer pig = new PigServer(Util.getLocalTestMode());\n String query =\n \" l1 = load '\" + INP_FILE_2NUMS + \"' as (i : int, j : chararray);\"\n + \"l2 = load '\" + INP_FILE_2NUMS + \"' as (i : int, j : chararray);\"\n + \"f1 = foreach l1 generate i, CONCAT(j,j) as cj, \" +\n \t\t\"org.apache.pig.test.TestUnionOnSchema\\\\$UDFTupleNullSchema(i,j) as uo;\"\n + \"u = union onschema f1, l2;\"\n ; \n Util.registerMultiLineQuery(pig, query);\n\n Schema sch = pig.dumpSchema(\"u\");\n String expectedSch = \"{i: int,cj: chararray,uo: (),j: chararray}\";\n Assert.assertTrue( expectedSch.equals( sch.toString() ) );\n \n\n Iterator<Tuple> it = pig.openIterator(\"u\");\n List<Tuple> expectedRes = \n Util.getTuplesFromConstantTupleStrings(\n new String[] {\n \"(1,null,null,'2')\",\n \"(5,null,null,'3')\",\n \"(1,'22',(1,'2'),null)\",\n \"(5,'33',(5,'3'),null)\"\n });\n Util.checkQueryOutputsAfterSort(it, expectedRes);\n\n }","BUnion createBUnion();","QuickUnionUF(int n) {\n count = n;\n id = new int[n];\n for (int i = 0; i < id.length; i++) { id[i] = i; }\n }","private static int multAndDivFixer(int size){\n return size;\n }","public void generateSolution() {\n if (this.stateOfTheMaze != 1)\n throw new IllegalArgumentException(\"To generate the maze the state of it must be \\\"generated maze\\\".\");\n Queue<Box> queue = new LinkedList<>();\n queue.add(this.startBox);\n boolean notFinished = true;\n while (notFinished) {\n Box aux = queue.peek();\n LinkedList<Box> movements = movementWithWalls(aux);\n movements.remove(aux.getPrevious());\n for (Box box : movements) {\n box.setPrevious(aux);\n queue.add(box);\n if (box.equals(this.endBox))\n notFinished = false;\n }\n queue.remove();\n }\n Box anotherAux = this.endBox;\n while (!anotherAux.equals(this.startBox)) {\n anotherAux.setAsSolution();\n anotherAux = anotherAux.getPrevious();\n }\n this.stateOfTheMaze++;\n }","public CreateUnionResponse createUnion(CreateUnionRequest request) throws GPUdbException {\n CreateUnionResponse actualResponse_ = new CreateUnionResponse();\n submitRequest(\"/create/union\", request, actualResponse_, false);\n return actualResponse_;\n }","@Test\n public void testUnionOnSchemaCastOnByteArray() throws Exception {\n PigServer pig = new PigServer(Util.getLocalTestMode());\n String query =\n \" l1 = load '\" + INP_FILE_2NUMS + \"' as (i, j);\"\n + \" f1 = foreach l1 generate (int)i, (int)j;\"\n + \"u = union onschema f1, l1;\"\n ; \n Util.registerMultiLineQuery(pig, query);\n Iterator<Tuple> it = pig.openIterator(\"u\");\n \n List<Tuple> expectedRes = \n Util.getTuplesFromConstantTupleStrings(\n new String[] {\n \"(1,2)\",\n \"(5,3)\",\n \"(1,2)\",\n \"(5,3)\"\n });\n Util.checkQueryOutputsAfterSort(it, expectedRes);\n\n }","public int[][] mergeaarray(int array[][],int ootable[][],int aatable[][],int aotable[][]) {\r\n\t\t\t\t\tint mergetable[][]=new int[ootable.length+aatable.length][ootable.length+aatable.length];\r\n\t\t\t\t\t\r\n\t\t\t\t//Adding object-object table to Union array \r\n\t\t\t\t\t\t\tfor(int m=0;m<ootable.length;m++)\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tfor(int n=0;n<ootable[0].length;n++)\r\n\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\tmergetable[m][n]=ootable[m][n];\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\t\r\n\t\t\t\t\t\r\n\t\t\t\t//Adding object-attribute table to Union array\t\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\tfor(int m=0;m<array.length;m++) \r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tfor(int n=0;n<array[0].length;n++)\r\n\t\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\t\tmergetable[m][ootable.length+n]=array[m][n];\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//Adding attribute-object table to Union array\t\t\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\tfor(int m=0;m<aotable.length;m++) \r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tfor(int n=0;n<aotable[0].length;n++)\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\tmergetable[m+ootable.length][n]=aotable[m][n];\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//Adding attribute-attribute table to Union array\t\t\t\r\n\t\t\t\t\t\r\n\t\t\t\t\tfor(int m=0;m<aatable.length;m++) \r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tfor(int n=0;n<aatable[0].length;n++)\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\tmergetable[m+ootable.length][n+ootable.length]=aatable[m][n];\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//Printing the elements of Union of four Arrays table to the screen\r\n\t\t\t\t\t\r\n\t\t\t\t\t\tSystem.out.println(\"=======================================================================\");\r\n\t\t\t\t\t\tSystem.out.println(\"UNION TABLE:\");\r\n\t\t\t\t\t\tSystem.out.println(\"=======================================================================\");\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tfor(int row=0;row<mergetable.length;row++)\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\tfor(int column=0;column<mergetable[0].length;column++)\r\n\t\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\t\tSystem.out.print(mergetable[row][column]+\"\\t\");\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\tSystem.out.println();\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t}\r\n\t\t\t\r\n\t\t\t\t\t\treturn mergetable;\r\n\t\t\t\t\t}","public void setSize(int size){\n\t\tthis.shipSize = size;\n\t}"],"string":"[\n \"public static void mazeUnion(){\\n\\n\\t\\tint n = 10;\\t\\n\\n\\t\\tdsf S = new dsf(n*n);\\n\\t\\tMaze one = new Maze(n);\\n\\n\\t\\tRandom random;\\n\\t\\tint sets = n*n;\\t//number of sets in the DSF\\n\\t\\tint randomNumber;\\n\\t\\tint randomDirection;\\n\\t\\tint row;\\n\\t\\tint col;\\n\\n\\t\\tchar upperRight; \\t//bottom or right\\n\\n\\t\\tS.print();\\n\\n\\t\\twhile(sets > 1){\\n\\t\\t\\trandom = new Random();\\n\\t\\t\\trandomNumber = random.nextInt((n*n) - 1);\\n\\t\\t\\tSystem.out.println(\\\"RANDOM NUMBER: \\\"+randomNumber);\\n\\t\\t\\trow = randomNumber /n;\\t//SWITCHED\\n\\t\\t\\tcol = randomNumber %n;\\t//SWITCHED\\n\\t\\t\\trandomDirection = random.nextInt(2);\\n\\t\\t\\tString direct;\\n\\t\\t\\tif(randomDirection == 0)\\n\\t\\t\\t\\tdirect = \\\"upper\\\";\\n\\t\\t\\telse\\n\\t\\t\\t\\tdirect = \\\"right\\\";\\n\\t\\t\\tSystem.out.println(\\\"RANDOM DIRECTI0N: \\\"+direct);\\n\\t\\t\\tupperRight = one.direction(randomDirection);\\n\\n\\t\\t\\tif(upperRight == 'u'){\\n\\t\\t\\t\\tif((randomNumber) < ((n*n)-n)){\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"Sets: \\\"+sets);\\n\\t\\t\\t\\t\\tif(S.find(randomNumber+n) != S.find(randomNumber)){\\n\\t\\t\\t\\t\\t\\tS.union(randomNumber+n, randomNumber);\\n\\t\\t\\t\\t\\t\\tone.remove_wall(col, row, 'u');\\n\\t\\t\\t\\t\\t\\tS.print();\\n\\t\\t\\t\\t\\t\\tsets--;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(upperRight == 'r'){\\n\\t\\t\\t\\tif(((randomNumber)%(n*n)) != n-1){\\n\\t\\t\\t\\t\\tif(S.findAndCompress(randomNumber) != S.findAndCompress(randomNumber+1)){\\n\\t\\t\\t\\t\\t\\tS.union(randomNumber, randomNumber+1);\\n\\t\\t\\t\\t\\t\\tone.remove_wall(col, row, 'r');\\n\\t\\t\\t\\t\\t\\t//S.print();\\n\\t\\t\\t\\t\\t\\tsets--;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tStdDraw.show(0);\\n\\t\\tone.draw();\\n\\t\\tone.printCellNumbers();\\n\\t\\t\\n\\t\\tbuildAdjacencyList(one, n);\\n\\t\\tuserSelection_SolveMaze(n);\\n\\n\\t}\",\n \"public static void unionPathCompression(){\\n\\t\\tint n = 10;\\t\\n\\n\\t\\tdsf S = new dsf(n*n);\\n\\t\\tMaze two = new Maze(n);\\n\\n\\t\\tRandom random;\\n\\t\\tint sets = n*n;\\t//number of sets in the DSF\\n\\t\\tint randomNumber;\\n\\t\\tint randomDirection;\\n\\t\\tint row;\\n\\t\\tint col;\\n\\n\\t\\tchar upperRight; \\t//bottom or right\\n\\n\\t\\tS.print();\\n\\n\\t\\twhile(sets > 1){\\n\\t\\t\\trandom = new Random();\\n\\t\\t\\trandomNumber = random.nextInt((n*n) - 1);\\n\\t\\t\\t//System.out.println(\\\"RANDOM NUMBER: \\\"+randomNumber);\\n\\t\\t\\trow = randomNumber /n;\\t//SWITCHED\\n\\t\\t\\tcol = randomNumber %n;\\t//SWITCHED\\n\\t\\t\\trandomDirection = random.nextInt(2);\\n\\t\\t\\tString direct;\\n\\t\\t\\tif(randomDirection == 0)\\n\\t\\t\\t\\tdirect = \\\"upper\\\";\\n\\t\\t\\telse\\n\\t\\t\\t\\tdirect = \\\"right\\\";\\n\\t\\t\\tSystem.out.println(\\\"RANDOM DIRECTI0N: \\\"+direct);\\n\\t\\t\\tupperRight = two.direction(randomDirection);\\n\\n\\t\\t\\tif(upperRight == 'u'){\\n\\t\\t\\t\\tif((randomNumber) < ((n*n)-n)){\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"Sets: \\\"+sets);\\n\\t\\t\\t\\t\\tif(S.findAndCompress(randomNumber+n) != S.findAndCompress(randomNumber)){\\n\\t\\t\\t\\t\\t\\tS.union(randomNumber+n, randomNumber);\\n\\t\\t\\t\\t\\t\\ttwo.remove_wall(col, row, 'u');\\n\\t\\t\\t\\t\\t\\tS.print();\\n\\t\\t\\t\\t\\t\\tsets--;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(upperRight == 'r'){\\n\\t\\t\\t\\tif(((randomNumber)%(n*n)) != n-1){\\n\\t\\t\\t\\t\\tif(S.findAndCompress(randomNumber) != S.findAndCompress(randomNumber+1)){\\n\\t\\t\\t\\t\\t\\tS.union(randomNumber, randomNumber+1);\\n\\t\\t\\t\\t\\t\\ttwo.remove_wall(col, row, 'r');\\n\\t\\t\\t\\t\\t\\tS.print();\\n\\t\\t\\t\\t\\t\\tsets--;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tbuildAdjacencyList(two, n);\\n\\t\\tuserSelection_SolveMaze(n);\\n\\n\\n\\t\\tStdDraw.show(0);\\n\\t\\ttwo.draw();\\n\\t\\ttwo.printCellNumbers();\\n\\t}\",\n \"public static void sizePathCompression(){\\n\\t\\tint n = 10;\\t\\n\\n\\t\\tdsf S = new dsf(n*n);\\n\\t\\tMaze five = new Maze(n);\\n\\n\\t\\tRandom random;\\n\\t\\tint sets = n*n;\\t//number of sets in the DSF\\n\\t\\tint randomNumber;\\n\\t\\tint randomDirection;\\n\\t\\tint row;\\n\\t\\tint col;\\n\\n\\t\\tchar upperRight; \\t//bottom or right\\n\\n\\t\\tS.print();\\n\\n\\t\\twhile(sets > 1){\\n\\t\\t\\trandom = new Random();\\n\\t\\t\\trandomNumber = random.nextInt((n*n) - 1);\\n\\t\\t\\t//System.out.println(\\\"RANDOM NUMBER: \\\"+randomNumber);\\n\\t\\t\\trow = randomNumber /n;\\t//SWITCHED\\n\\t\\t\\tcol = randomNumber %n;\\t//SWITCHED\\n\\t\\t\\trandomDirection = random.nextInt(2);\\n\\t\\t\\tString direct;\\n\\t\\t\\tif(randomDirection == 0)\\n\\t\\t\\t\\tdirect = \\\"upper\\\";\\n\\t\\t\\telse\\n\\t\\t\\t\\tdirect = \\\"right\\\";\\n\\t\\t\\t//System.out.println(\\\"RANDOM DIRECTI0N: \\\"+direct);\\n\\t\\t\\tupperRight = five.direction(randomDirection);\\n\\n\\t\\t\\tif(upperRight == 'u'){\\n\\t\\t\\t\\tif((randomNumber) < ((n*n)-n)){\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"Sets: \\\"+sets);\\n\\t\\t\\t\\t\\tif(S.findAndCompress(randomNumber) != S.findAndCompress(randomNumber + n)){\\n\\t\\t\\t\\t\\t\\tS.unionBySize(randomNumber+n, randomNumber);\\n\\t\\t\\t\\t\\t\\tfive.remove_wall(col, row, 'u');\\n\\t\\t\\t\\t\\t\\t//S.print();\\n\\t\\t\\t\\t\\t\\tsets--;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(upperRight == 'r'){\\n\\t\\t\\t\\tif(((randomNumber)%(n*n)) != n-1){\\n\\t\\t\\t\\t\\tif(S.findAndCompress(randomNumber) != S.findAndCompress(randomNumber+1)){\\n\\t\\t\\t\\t\\t\\tS.unionBySize(randomNumber, randomNumber+1);\\n\\t\\t\\t\\t\\t\\tfive.remove_wall(col, row, 'r');\\n\\t\\t\\t\\t\\t\\tS.print();\\n\\t\\t\\t\\t\\t\\tsets--;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tbuildAdjacencyList(five, n);\\n\\t\\tuserSelection_SolveMaze(n);\\n\\n\\t\\tStdDraw.show(0);\\n\\t\\tfive.draw();\\n\\t\\tfive.printCellNumbers();\\t\\n\\t}\",\n \"public void showMazeSize(int size);\",\n \"@Test\\n\\tpublic void testUnion5() {\\n\\n\\t\\tint[] arr = {};\\n\\t\\tSLLSet listObj2 = new SLLSet(arr);\\n\\t\\tint[] uni2 = { 0, 2, 3 };\\n\\t\\tSLLSet listObj7 = new SLLSet(uni2);\\n\\t\\tSLLSet listObj8 = listObj2.union(listObj7);\\n\\n\\t\\tString expected = \\\"0, 2, 3\\\";\\n\\t\\tint expectedSize = 3;\\n\\n\\t\\tassertEquals(expectedSize, listObj8.getSize());\\n\\t\\tassertEquals(expected, listObj8.toString());\\n\\n\\t}\",\n \"public void union(int i, int j) {\\n\\tint p = findRoot(i);\\n\\tint q = findRoot(j);\\n\\t\\n\\tif (p == q) return;\\n\\t\\n\\tif (size[p] < size[q]) { //pick the smallest tree and append it to the bigger tree\\n\\t root[p] = q;\\n\\t size[p] += size[q];\\n\\t} else {\\n\\t root[q] = p;\\n\\t size[q] += size[p];\\n\\t}\\n }\",\n \"void union(int x,int y){\\n int xRoot=find(x),yRoot=find(y);\\n if(xRoot==yRoot)return;\\n if(rank[xRoot]<rank[yRoot])\\n parent[xRoot]=yRoot;\\n else if(rank[xRoot]>rank[yRoot])\\n parent[yRoot]=xRoot;\\n else{\\n parent[yRoot]=xRoot;\\n rank[xRoot]=rank[xRoot]+1;\\n }\\n --totalSets;\\n }\",\n \"public void union(Shape s);\",\n \"public void union(int p, int q)\\n {\\n int i = root(p);\\n int j = root(q);\\n if ( i == j ) return;\\n \\n if ( sz[i] < sz[j] ) { \\n // i is no longer a root, so we don't need to update the size\\n id[i] = j; sz[j] += sz[i];\\n }\\n else {\\n id[j] = i; sz[i] += sz[j]; \\n } \\n }\",\n \"public int union(int u, int v) {\\n int p1 = find(u), p2 = find(v);\\n if (p1 == p2) {\\n return p1;\\n }\\n int s1 = _sizes[p1], s2 = _sizes[p2];\\n if (s1 > s2) {\\n _sizes[p1] += s2;\\n// int i = 1;\\n// while (s2 > 0) {\\n// if (_parents[i] == p2) {\\n// _parents[i] = p1;\\n// s2 -= 1;\\n// }\\n// i += 1;\\n// }\\n _parents[p2] = p1;\\n return s1;\\n } else {\\n _sizes[p2] += s1;\\n// int j = 1;\\n// while (s1 > 0) {\\n// if (_parents[j] == p1) {\\n// _parents[j] = p2;\\n// s1 -= 1;\\n// }\\n// j += 1;\\n// }\\n _parents[p1] = p2;\\n return s2;\\n }\\n }\",\n \"public void union(int p, int q)\\n {\\n int i = this.root(p);\\n int j = this.root(q);\\n if (i == j) return;\\n\\n if (this.size[i] < this.size[j])\\n {\\n this.parent[i] = j;\\n this.size[j] += this.size[i];\\n }\\n else\\n {\\n this.parent[j] = i;\\n this.size[i] += this.size[j];\\n }\\n }\",\n \"public static void main(String[] args) {\\n\\t\\tStopwatch timer = new Stopwatch();\\n\\t\\t//for(int i = 0; i< 10;i++) {\\n\\t\\t\\tIn in = new In(args[0]);\\n\\t\\t\\tSizeWeightedQuickUnionVisualizer q = new SizeWeightedQuickUnionVisualizer(in.readInt());\\n\\t\\t\\twhile(!in.isEmpty()) {\\n\\t\\t\\t\\tint m = in.readInt();\\n\\t\\t\\t\\tint n = in.readInt();\\n\\t\\t\\t\\tif(q.isConnected(m, n)) continue;\\n\\t\\t\\t\\tq.union(m, n);\\n\\t\\t\\t}\\n\\t\\t//}\\n\\t\\tdouble time = timer.elapsedTime();\\n\\t\\t//System.out.println(\\\"the average time of 10 trials is : \\\" + time/10 + \\\" seconds\\\");\\n\\t\\t//System.out.println(\\\"the number of components is \\\"+ q.count()+\\\" the number of total array accesses is \\\"+q.sum + \\\" the average nodes' depth is: \\\"+ q.getAvgDepth()+\\\" time: \\\"+time+\\\" seconds\\\");\\n\\t}\",\n \"public void union(int first, int second){\\n int firstId = find(first);\\n int secondId = find(second);\\n //Check if these are already connected\\n if(firstId == secondId){\\n return;\\n }\\n if(size[firstId] < size[secondId]){\\n size[secondId]+=size[firstId];\\n grid[first] = secondId;\\n }\\n else {\\n size[firstId]+=size[secondId];\\n grid[second] = firstId;\\n }\\n --numOfComponents;\\n }\",\n \"public void union(int p, int q){\\r\\n\\t\\tint rootP = root(p);\\r\\n\\t\\tint rootQ = root(q);\\r\\n\\t\\t\\r\\n\\t\\tif(rootP == rootQ) return;\\r\\n\\t\\t// Calculate height of tree and then link the root of smaller tree to root of larger tree\\r\\n\\t\\t\\r\\n\\t\\tif(size[rootP] < size[rootQ]) {\\r\\n\\t\\t\\tid[rootP] = rootQ;\\r\\n\\t\\t\\tsize[rootQ] = size[rootQ] + size[rootP];\\r\\n\\t\\t}\\r\\n\\t\\telse {\\r\\n\\t\\t\\tid[rootQ] = rootP;\\r\\n\\t\\t\\tsize[rootP] = size[rootQ] + size[rootP];\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public static void unionFind(int[][] doubleArray, int dimensions, UnionFind uf)\\n {\\n int count = 0;\\n while (count != dimensions)\\n {\\n for (int column = 0; column < dimensions; column++) {\\n if (uf.find(count, (dimensions*dimensions - 1 - column)) == true)\\n {\\n uf.printArray();\\n StdOut.println();\\n StdOut.println(\\\"Drip, drip.\\\");\\n return;\\n }\\n }\\n count++;\\n }\\n StdOut.println(\\\"No drip, drip.\\\");\\n }\",\n \"protected void trimToSize() {\\n\\tnodeList.trimToSize();\\n\\tedgeList.trimToSize();\\n }\",\n \"public void union(int p, int q) {\\n\\t\\tint i = root(p);\\n\\t\\tint j = root(q);\\n//\\t\\tid[i] = j; instead of this do below improvement\\n\\t\\tif (sz[i] < sz[j]) {\\n\\t\\t\\tid[i] = j;\\n\\t\\t\\tsz[j] += sz[i];\\n\\t\\t} else {\\n\\t\\t\\tid[j] = i;\\n\\t\\t\\tsz[i] += sz[j];\\n\\t\\t}\\n\\t}\",\n \"static\\nint\\nprintUnion(\\nint\\narr1[], \\nint\\narr2[], \\nint\\nm, \\nint\\nn) \\n\\n{ \\n\\nint\\ni = \\n0\\n, j = \\n0\\n; \\n\\nwhile\\n(i < m && j < n) \\n\\n{ \\n\\nif\\n(arr1[i] < arr2[j]) \\n\\nSystem.out.print(arr1[i++]+\\n\\\" \\\"\\n); \\n\\nelse\\nif\\n(arr2[j] < arr1[i]) \\n\\nSystem.out.print(arr2[j++]+\\n\\\" \\\"\\n); \\n\\nelse\\n\\n{ \\n\\nSystem.out.print(arr2[j++]+\\n\\\" \\\"\\n); \\n\\ni++; \\n\\n} \\n\\n} \\n\\n\\n/* Print remaining elements of \\n\\nthe larger array */\\n\\nwhile\\n(i < m) \\n\\nSystem.out.print(arr1[i++]+\\n\\\" \\\"\\n); \\n\\nwhile\\n(j < n) \\n\\nSystem.out.print(arr2[j++]+\\n\\\" \\\"\\n); \\n\\n\\nreturn\\n0\\n; \\n\\n}\",\n \"public static void mazeHeight(){\\n\\t\\tint n = 10;\\t\\n\\n\\t\\tdsf S = new dsf(n*n);\\n\\t\\tMaze three = new Maze(n);\\n\\n\\t\\tRandom random;\\n\\t\\tint sets = n*n;\\t//number of sets in the DSF\\n\\t\\tint randomNumber;\\n\\t\\tint randomDirection;\\n\\t\\tint row;\\n\\t\\tint col;\\n\\n\\t\\tchar upperRight; \\t//bottom or right\\n\\n\\t\\tS.print();\\n\\n\\t\\twhile(sets > 1){\\n\\t\\t\\trandom = new Random();\\n\\t\\t\\trandomNumber = random.nextInt((n*n) - 1);\\n\\t\\t\\t//System.out.println(\\\"RANDOM NUMBER: \\\"+randomNumber);\\n\\t\\t\\trow = randomNumber /n;\\t//SWITCHED\\n\\t\\t\\tcol = randomNumber %n;\\t//SWITCHED\\n\\t\\t\\trandomDirection = random.nextInt(2);\\n\\t\\t\\tString direct;\\n\\t\\t\\tif(randomDirection == 0)\\n\\t\\t\\t\\tdirect = \\\"upper\\\";\\n\\t\\t\\telse\\n\\t\\t\\t\\tdirect = \\\"right\\\";\\n\\t\\t\\t//System.out.println(\\\"RANDOM DIRECTI0N: \\\"+direct);\\n\\t\\t\\tupperRight = three.direction(randomDirection);\\n\\n\\t\\t\\tif(upperRight == 'u'){\\n\\t\\t\\t\\tif((randomNumber) < ((n*n)-n)){\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"Sets: \\\"+sets);\\n\\t\\t\\t\\t\\tif(S.find(randomNumber) != S.find(randomNumber + n)){\\n\\t\\t\\t\\t\\t\\tS.unionByHeight(randomNumber, randomNumber+n);\\n\\t\\t\\t\\t\\t\\tthree.remove_wall(col, row, 'u');\\n\\t\\t\\t\\t\\t\\tS.print();\\n\\t\\t\\t\\t\\t\\tsets--;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(upperRight == 'r'){\\n\\t\\t\\t\\tif(((randomNumber)%(n*n)) != n-1){\\n\\t\\t\\t\\t\\tif(S.find(randomNumber) != S.find(randomNumber+1)){\\n\\t\\t\\t\\t\\t\\tS.unionByHeight(randomNumber, randomNumber+1);\\n\\t\\t\\t\\t\\t\\tthree.remove_wall(col, row, 'r');\\n\\t\\t\\t\\t\\t\\tS.print();\\n\\t\\t\\t\\t\\t\\tsets--;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tbuildAdjacencyList(three, n);\\n\\t\\tuserSelection_SolveMaze(n);\\n\\n\\n\\t\\tStdDraw.show(0);\\n\\t\\tthree.draw();\\n\\t\\tthree.printCellNumbers();\\t\\n\\t}\",\n \"public static void union(int u, int v) {\\n\\t\\tu = root(u); // optimizations\\n\\t\\tv = root(v); // to make find faster\\n\\t\\tif (u == v) return; // already in same component\\n\\t\\t\\n\\t\\tif (size[u] >= size[v]) {\\n\\t\\t\\tp[v] = u;\\n\\t\\t\\tsize[u] += size[v];\\n\\t\\t} else {\\n\\t\\t\\tp[u] = v;\\n\\t\\t\\tsize[v] += size[u];\\n\\t\\t}\\n\\t}\",\n \"WeightedUnionFind(int N){\\n id = new int[N];\\n size = new int[N];\\n for (int i = 0; i < N; i++){\\n id[i] = i;\\n size[i] = 1;\\n }\\n }\",\n \"void union(int x, int y) {\\n\\n // **** set the modes in the parents array ****\\n if (parents[x] == 0)\\n parents[x] = x;\\n\\n if (parents[y] == 0)\\n parents[y] = y;\\n\\n // **** update the representative element of each set ****\\n if (parents[x] != 0 || parents[y] != 0) {\\n\\n // **** get the low and high from these nodes ****\\n int high = Math.max(parents[x], parents[y]);\\n int low = Math.min(parents[x], parents[y]);\\n\\n // ???? ????\\n System.out.println(\\\"union <<< high: \\\" + high + \\\" low: \\\" + low);\\n\\n // **** update to point to the proper representative ****\\n for (int i = 0; i < parents.length; i++) {\\n if (parents[i] == high)\\n parents[i] = low;\\n }\\n }\\n }\",\n \"void Union(subset [] subsets, int x , int y ){ \\n\\t\\tint xroot = find(subsets, x); \\n\\t int yroot = find(subsets, y); \\n\\t \\n\\t\\tif (subsets[xroot].rank < subsets[yroot].rank) \\n\\t\\t\\tsubsets[xroot].parent = yroot; \\n\\t\\telse if (subsets[yroot].rank < subsets[xroot].rank) \\n\\t\\t\\tsubsets[yroot].parent = xroot; \\n\\t\\telse{ \\n\\t\\t\\tsubsets[xroot].parent = yroot; \\n\\t\\t\\tsubsets[yroot].rank++; \\n\\t\\t} \\n\\t}\",\n \"public void open(int row, int col) {\\n if (isOpen(row, col)) return;\\n grid[row - 1][col - 1] = true;\\n ++openSites;\\n\\n // Transform the row and the column into an appropriate index\\n // because the quick union class uses a one-dimensional array.\\n final int currentSiteIndex = toIndex(row, col);\\n\\n // The topmost row must be connected to the virtual top.\\n if (row == 1) {\\n mainUnion.union(virtualTopId, currentSiteIndex);\\n backwashAwareUnion.union(virtualTopId, currentSiteIndex);\\n }\\n // The bottommost row must be connected to virtual the bottom.\\n if (row == size) mainUnion.union(virtualBottomId, currentSiteIndex);\\n\\n // Connect all neighbors of the current site if and only if the neighbors are open.\\n if (row > 1 && isOpen(row - 1, col)) {\\n final int topNeighborIndex = toIndex(row - 1, col);\\n mainUnion.union(topNeighborIndex, currentSiteIndex);\\n backwashAwareUnion.union(topNeighborIndex, currentSiteIndex);\\n }\\n\\n if (row < size && isOpen(row + 1, col)) {\\n final int bottomNeighborIndex = toIndex(row + 1, col);\\n mainUnion.union(bottomNeighborIndex, currentSiteIndex);\\n backwashAwareUnion.union(bottomNeighborIndex, currentSiteIndex);\\n }\\n\\n if (col > 1 && isOpen(row, col - 1)) {\\n final int leftNeighborIndex = toIndex(row, col - 1);\\n mainUnion.union(leftNeighborIndex, currentSiteIndex);\\n backwashAwareUnion.union(leftNeighborIndex, currentSiteIndex);\\n }\\n\\n if (col < size && isOpen(row, col + 1)) {\\n final int rightNeighborIndex = toIndex(row, col + 1);\\n mainUnion.union(rightNeighborIndex, currentSiteIndex);\\n backwashAwareUnion.union(rightNeighborIndex, currentSiteIndex);\\n }\\n }\",\n \"public org.apache.gora.cascading.test.storage.TestRow.Builder clearUnionRecursive() {\\n unionRecursive = null;\\n fieldSetFlags()[3] = false;\\n return this;\\n }\",\n \"@Override\\n protected int mapSize() {\\n return left.size()+right.size()-hidden.size();\\n }\",\n \"int[] union(int s1,int t1,int s2,int t2)\\r\\n\\t{\\r\\n\\t\\tint [] st=new int[2];\\r\\n\\t\\t//Please fill in the program here\\r\\n\\t\\tst[0] = incCapacity();\\r\\n\\t\\taddEdge(st[0], epssymbol, s1);\\r\\n\\t\\taddEdge(st[0], epssymbol, s2);\\r\\n\\t\\tst[1] = incCapacity();\\r\\n\\t\\taddEdge(t1, epssymbol, st[1]);\\r\\n\\t\\taddEdge(t2, epssymbol, st[1]);\\r\\n\\r\\n\\t\\treturn st;\\r\\n\\t}\",\n \"@Test\\n public void testMatchLimitOneBottomUp() throws Exception {\\n\\n HepProgramBuilder programBuilder = HepProgram.builder();\\n programBuilder.addMatchLimit( 1 );\\n programBuilder.addMatchOrder( HepMatchOrder.BOTTOM_UP );\\n programBuilder.addRuleInstance( UnionToDistinctRule.INSTANCE );\\n\\n checkPlanning( programBuilder.build(), UNION_TREE );\\n }\",\n \"public DisjointSetUnionByRank(int numElements) {\\n super( numElements );\\n }\",\n \"@Test\\n\\tpublic void testUnionSLLSetArrayAll0() {\\n\\n\\t\\tint[] arr1 = { 0, 0, 0 };\\n\\t\\tint[] arr2 = { 0, 0, 0, 0 };\\n\\t\\tint[] arr3 = { 0, 0 };\\n\\t\\tint[] arr4 = { 0, 0 };\\n\\t\\tSLLSet listObj100 = new SLLSet(arr1);\\n\\t\\tSLLSet listObj99 = new SLLSet(arr2);\\n\\t\\tSLLSet listObj98 = new SLLSet(arr3);\\n\\t\\tSLLSet listObj97 = new SLLSet(arr4);\\n\\t\\tSLLSet listObj96 = new SLLSet();\\n\\t\\tSLLSet[] Array = { listObj100, listObj99, listObj98, listObj97, listObj96 }; // test static SLLSet union(sArray)\\n\\n\\t\\tSLLSet listObj23 = SLLSet.union(Array);\\n\\n\\t\\tString expected = \\\"0\\\";\\n\\t\\tint expectedSize = 1;\\n\\n\\t\\tassertEquals(expectedSize, listObj23.getSize());\\n\\t\\tassertEquals(expected, listObj23.toString());\\n\\n\\t}\",\n \"public void union(int i, int j) {\\n\\n int root1 = find(i);\\n int root2 = find(j);\\n\\n if (root2 == root1)\\n return;\\n\\n if (_rank[root1] > _rank[root2]) {\\n _parent[root2] = root1;\\n } else if (_rank[root2] > _rank[root1]) {\\n _parent[root1] = root2;\\n } else {\\n _parent[root2] = root1;\\n _rank[root1]++;\\n }\\n }\",\n \"public void open(int row, int col) {\\n check(row, col);\\n if (!isOpen(row, col)) {\\n sites[row - 1][col - 1] = true;\\n openSites++;\\n\\n int index = index(row, col);\\n if (row == gridDimension) {\\n unionFind.union(index, bottomRoot);\\n\\n if (gridDimension == 1){\\n unionFind.union(index, topRoot);\\n fullSites.union(index, topRoot);\\n }\\n else if (isOpen(row - 1, col)) {\\n unionFind.union(index(row - 1, col), index);\\n fullSites.union(index(row - 1, col), index);\\n }\\n }\\n else if (row == 1) {\\n unionFind.union(index, topRoot);\\n fullSites.union(index, topRoot);\\n\\n if (isOpen(row + 1, col)) {\\n unionFind.union(index(row + 1, col), index);\\n fullSites.union(index(row + 1, col), index);\\n }\\n }\\n\\n else {\\n if (isOpen(row + 1, col)) {\\n unionFind.union(index(row + 1, col), index);\\n fullSites.union(index(row + 1, col), index);\\n }\\n\\n if (isOpen(row - 1, col)) {\\n unionFind.union(index(row - 1, col), index);\\n fullSites.union(index(row - 1, col), index);\\n }\\n }\\n\\n\\n\\n if (col > 1) {\\n if (isOpen(row, col - 1)) {\\n unionFind.union(index(row, col - 1), index);\\n fullSites.union(index(row, col - 1), index);\\n }\\n }\\n\\n if (col < gridDimension) {\\n if (isOpen(row, col + 1)) {\\n unionFind.union(index(row, col + 1), index);\\n fullSites.union(index(row, col + 1), index);\\n }\\n }\\n }\\n }\",\n \"public static void union(String a, String b) {\\r\\n int root1 = find(a);\\r\\n int root2 = find(b);\\r\\n if (root1 == root2)return;\\r\\n if(size.get(root1) < size.get(root2)){size.set(root2, size.get(root2)+size.get(root1)); position.set(root1, root2);}\\r\\n else {size.set(root1, size.get(root1)+size.get(root2)); position.set(root2, root1);}\\r\\n }\",\n \"public int getMazeSize() \\r\\n\\t{\\r\\n\\t\\treturn this.size;\\r\\n\\t}\",\n \"void union(int p, int q) {}\",\n \"public void setSize() {\\n\\t\\t\\tthis.size = 1;\\n\\t\\t\\tint leftSize = 0;\\n\\t\\t\\tint rightSize = 0;\\n\\t\\t\\tif (this.getLeft().getKey() != -1) {\\n\\t\\t\\t\\tleftSize = this.getLeft().getSize();\\n\\t\\t\\t}\\n\\t\\t\\tif (this.getRight().getKey() != -1) {\\n\\t\\t\\t\\trightSize = this.getRight().getSize();\\n\\t\\t\\t}\\n\\t\\t\\tthis.size += leftSize + rightSize;\\n\\n\\t\\t\\t/**\\n\\t\\t\\t * this.size = 1; int leftSize = 0; int rightSize = 0; try { leftSize =\\n\\t\\t\\t * this.getLeft().getSize(); this.size += leftSize; } catch\\n\\t\\t\\t * (NullPointerException e) { this.size += leftSize; } try { rightSize =\\n\\t\\t\\t * this.getRight().getSize(); this.size += rightSize; } catch\\n\\t\\t\\t * (NullPointerException e) { this.size += rightSize; } if (this.getSize() >\\n\\t\\t\\t * 990) { System.out.println(\\\"actual size is:\\\" + this.getSize()); }\\n\\t\\t\\t */\\n\\t\\t}\",\n \"void union(int a, int b) {\\n\\t\\tif (a==9 && b==4){\\r\\n\\t\\tSystem.out.println(\\\"DEBUGGING 9 AND 4\\\");\\r\\n\\t\\tSystem.out.println(\\\"size of A: \\\"+ sizeOf(a));\\r\\n\\t\\tSystem.out.println(\\\"size of B: \\\"+ sizeOf(b));\\r\\n\\t\\t}\\r\\n\\t\\tint rootB = getRoot(b); // N array access\\r\\n\\t\\tint rootA = getRoot(a); // N array access\\r\\n\\t\\tif (rootA==rootB)return;\\r\\n\\r\\n\\t\\tif (sizeOf(rootA)<sizeOf(rootB)){\\r\\n\\t\\t\\tidNode[rootA] = rootB; // 1 array access\\r\\n\\t\\t}\\r\\n\\t\\telse{\\r\\n\\t\\t\\tidNode[rootB] = rootA; // 1 array access\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public void sizeOfTiles(int size)\\n{\\n if(m != null )\\n {\\n m.getOutputImageManager().setTileSize(size);\\n //refresh row shift for new size of tiles\\n if(m.getOutputImageManager().getMosaic() != null)\\n {\\n m.getOutputImageManager().setEvenRowShift(m.getOutputImageManager().getEvenRowShift());\\n m.getOutputImageManager().setOddRowShift(m.getOutputImageManager().getOddRowShift());\\n m.getOutputImageManager().getMosaic().setHoverIndex(0,0);\\n //println(m.getOutputImageManager().getMosaic().getFlipH()[0].length);\\n }\\n m.getOutputImageManager().setToRerender();\\n }\\n}\",\n \"void Union( int x, int y){\\n\\n int i = root(x);\\n int j = root(y);\\n if (i == j) return;\\n if (rank[i] > rank[j]) { id[j] = i; rank[i] += rank[j]; }\\n else { id[i] = j; rank[j] += rank[i]; }\\n }\",\n \"public void testSize() {\\n assertEquals(10, maze1.size());\\n }\",\n \"private void BuildUp(int towerToBuild, int towerTarget, int bottomSize) {\\n\\t\\t\\n\\t\\tint notTowerTarget = getOtherTower(towerToBuild,towerTarget);\\n\\n\\t\\twhile( towerSet.TopBlock(towerToBuild) > 1 ) {\\n\\t\\t\\tif(towerSet.TopBlock(towerTarget) == towerSet.TopBlock(towerToBuild) - 1) {\\n\\t\\t\\t\\ttowerSet.MoveBlock(towerTarget,towerToBuild);\\n\\t\\t\\t\\tturnNumber++;\\n\\t\\t\\t\\tSystem.out.println(this.toString());\\n\\t\\t\\t}\\n\\t\\t\\telse if(towerSet.TopBlock(notTowerTarget) == towerSet.TopBlock(towerToBuild) - 1) {\\n\\t\\t\\t\\ttowerSet.MoveBlock(notTowerTarget,towerToBuild);\\n\\t\\t\\t\\tturnNumber++;\\n\\t\\t\\t\\tSystem.out.println(this.toString());\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tif(towerSet.TopBlock(towerTarget) == 1 ) {\\n\\t\\t\\t\\t\\tthis.BreakDown(towerTarget, towerToBuild, towerSet.TopBlock(towerToBuild) - 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tthis.BreakDown(notTowerTarget, towerToBuild, towerSet.TopBlock(towerToBuild) - 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"public void union(int p, int q) {\\n\\t\\tint i = find(p);\\n\\t\\tint j = find(q);\\n\\t\\tif (i == j)\\n\\t\\t\\treturn;\\n\\t\\t\\n\\t\\t// make shorter root point to taller one\\n\\t\\tif (height[i] < height[j]) parent[i] = j;\\n\\t else if (height[i] > height[j]) parent[j] = i;\\n\\t else {\\n\\t \\tparent[j] = i;\\n\\t height[i]++;\\n\\t }\\n\\t\\tcount--;\\n\\t}\",\n \"public void union(Node a, Node b) {\\n Node set1 = find(a);\\n Node set2 = find(b);\\n\\n if (set1 != set2) {\\n // Limits the worst case runtime of a find to O(log N)\\n if (set1.getSize() < set2.getSize()) {\\n set2.setParent(set1);\\n set1.setSize(set1.getSize() + set2.getSize());\\n }\\n else {\\n set1.setParent(set2);\\n set2.setSize(set1.getSize() + set2.getSize());\\n }\\n }\\n }\",\n \"@Test\\r\\n public void testCreateUnion_thisIsEmpty() {\\r\\n Tour tourA = new Tour();\\r\\n Tour tourB = new Tour(new int[][]{{12, 12}});\\r\\n Tour result = tourA.createUnion(tourB);\\r\\n Tour expected = new Tour(new int[][]{{12, 12}});\\r\\n assertTrue(result.toString(), expected.isEqual(result));\\r\\n }\",\n \"@Test\\r\\n public void test_UnionOf_simple() {\\r\\n System.out.println(\\\"unionOf\\\");\\r\\n int p = 11;\\r\\n int q = 99;\\r\\n UnionFind instance = new QuickUnion(100);\\r\\n instance.unionOf(p, q);\\r\\n assertEquals(true, instance.isConnected(p, q));\\r\\n\\r\\n }\",\n \"public int CalcDistance ( )\\r\\n\\t{\\r\\n\\t\\tfor ( int i = 0; i<size; i++ )\\r\\n\\t\\t{\\r\\n\\t\\t\\tfor ( int offR = 0; offR <= size/2; offR++ )\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tfor ( int c = 0; c <= size/2; c++ )\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tif ( offR == 0 && maze [offR] [c].isOpenUp() )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmaze [offR] [c].setDistanceToExit( 1 );\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\telse if ( maze [offR] [c].isOpenUp() && maze [offR-1] [c].isOpenDown() )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmaze [offR] [c].setDistanceToExit( \\r\\n\\t\\t\\t\\t\\t\\t\\t\\tMath.min( maze [offR-1] [c].getDistanceToExit()+1,\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t maze [offR] [c].getDistanceToExit() ) );\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\tif ( c == 0 && maze [offR] [c].isOpenLeft() )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmaze [offR] [c].setDistanceToExit( 1 );\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\telse if ( maze [offR] [c].isOpenLeft() && maze [offR] [c-1].isOpenRight() )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmaze [offR] [c].setDistanceToExit( \\r\\n\\t\\t\\t\\t\\t\\t\\t\\tMath.min( maze [offR] [c-1].getDistanceToExit()+1,\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t maze [offR] [c].getDistanceToExit() ) );\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tfor ( int c = size-1; c >= size/2; c-- )\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tif ( offR == 0 && maze [offR] [c].isOpenUp() )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmaze [offR] [c].setDistanceToExit( 1 );\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\telse if ( maze [offR] [c].isOpenUp() && maze [offR-1] [c].isOpenDown() )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmaze [offR] [c].setDistanceToExit( \\r\\n\\t\\t\\t\\t\\t\\t\\t\\tMath.min( maze [offR-1] [c].getDistanceToExit()+1,\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t maze [offR] [c].getDistanceToExit() ) );\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\tif ( c == size-1 && maze [offR] [c].isOpenRight() )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmaze [offR] [c].setDistanceToExit( 1 );\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\telse if ( maze [offR] [c].isOpenRight() && maze [offR] [c+1].isOpenLeft() )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmaze [offR] [c].setDistanceToExit( \\r\\n\\t\\t\\t\\t\\t\\t\\t\\tMath.min( maze [offR] [c+1].getDistanceToExit()+1,\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t maze [offR] [c].getDistanceToExit() ) );\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tfor ( int offR = size-1; offR >= size/2; offR-- )\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tfor ( int c = 0; c <= size/2; c++ )\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tif ( offR == size-1 && maze [offR] [c].isOpenDown() )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmaze [offR] [c].setDistanceToExit( 1 );\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\telse if ( maze [offR] [c].isOpenDown() && maze [offR+1] [c].isOpenUp() )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmaze [offR] [c].setDistanceToExit( \\r\\n\\t\\t\\t\\t\\t\\t\\t\\tMath.min( maze [offR+1] [c].getDistanceToExit()+1,\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t maze [offR] [c].getDistanceToExit() ) );\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\tif ( c == 0 && maze [offR] [c].isOpenLeft() )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmaze [offR] [c].setDistanceToExit( 1 );\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\telse if ( maze [offR] [c].isOpenLeft() && maze [offR] [c-1].isOpenRight() )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmaze [offR] [c].setDistanceToExit( \\r\\n\\t\\t\\t\\t\\t\\t\\t\\tMath.min( maze [offR] [c-1].getDistanceToExit()+1,\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t maze [offR] [c].getDistanceToExit() ) );\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tfor ( int c = size-1; c >= size/2; c-- )\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tif ( offR == size-1 && maze [offR] [c].isOpenDown() )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmaze [offR] [c].setDistanceToExit( 1 );\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\telse if ( maze [offR] [c].isOpenDown() && maze [offR+1] [c].isOpenUp() )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmaze [offR] [c].setDistanceToExit( \\r\\n\\t\\t\\t\\t\\t\\t\\t\\tMath.min( maze [offR+1] [c].getDistanceToExit()+1,\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t maze [offR] [c].getDistanceToExit() ) );\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\tif ( c == size-1 && maze [offR] [c].isOpenRight() )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmaze [offR] [c].setDistanceToExit( 1 );\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\telse if ( maze [offR] [c].isOpenRight() && maze [offR] [c+1].isOpenLeft() )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmaze [offR] [c].setDistanceToExit( \\r\\n\\t\\t\\t\\t\\t\\t\\t\\tMath.min( maze [offR] [c+1].getDistanceToExit()+1,\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t maze [offR] [c].getDistanceToExit() ) );\\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\\treturn maze [currentRow] [currentCol].getDistanceToExit();\\r\\n\\t}\",\n \"public void union(BlastGraph<HitVertex, ValueEdge> graphToUnion) {\\n\\t\\tfor (HitVertex hv : graphToUnion.getVertices()) {\\n\\t\\t\\tthis.addVertex(hv);\\n\\t\\t}\\n\\n\\t\\tfor (ValueEdge ve : graphToUnion.getEdges()) {\\n\\t\\t\\tthis.addEdge(ve, graphToUnion.getEndpoints(ve));\\n\\t\\t}\\n\\t}\",\n \"public UnionFind(int n) {}\",\n \"public void setSize(int size) {\\n\\t members = size;\\n\\t}\",\n \"public int size(Tree<K, V> t, int size) {\\n\\t\\tsize = left.size(left, size + 1);\\n\\t\\tsize = right.size(right, size + 1);\\n\\t\\treturn size;\\n\\t}\",\n \"public Maze(int size) {\\n \\t\\tthis.size = size;\\n \\t\\ttarget = new Point(size, 1);\\n \\n \\t\\tvisited = new boolean[size + 2][size + 2];\\n \\t\\tnorth = new boolean[size + 2][size + 2];\\n \\t\\teast = new boolean[size + 2][size + 2];\\n \\t\\tsouth = new boolean[size + 2][size + 2];\\n \\t\\twest = new boolean[size + 2][size + 2];\\n \\t\\t\\n \\t\\tinit();\\n \\t\\tcalculateCentre();\\n \\t\\tcreateSwitches(); //needs to be done after centre is created\\n \\t\\t\\n \\t\\t //create 15 motion sensors, but don't create any in the centre\\n \\t\\tms = new MotionSensors(size, 15, centreMin, centreMax);\\n \\t\\t//System.out.println(ms); //print motion sensor coordinates\\n \\t\\t\\n \\t\\tcreateSubmarineMaze();//generates maze for the submarine\\n \\t}\",\n \"public static ArrayList<ArrayList<String>> unionD(String table1Name, String table2Name){\\n\\t\\tArrayList<ArrayList<String>> union = new ArrayList<ArrayList<String>>();\\r\\n\\t\\t//these will hold the data from the input tables\\r\\n\\t\\tArrayList<ArrayList<String>> columns1 = new ArrayList<ArrayList<String>>();\\r\\n\\t\\tArrayList<ArrayList<String>> columns2 = new ArrayList<ArrayList<String>>();\\r\\n\\t\\t//find the input tables in the database list\\r\\n\\t\\tfor (int i = 0; i < tables.size(); i++) {\\r\\n\\t\\t\\tif (tables.get(i).getName().equals(table1Name)) {\\r\\n\\t\\t\\t\\tcolumns1 = new ArrayList<ArrayList<String>>(tables.get(i).datas);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tif (tables.get(i).getName().equals(table2Name)) {\\r\\n\\t\\t\\t\\tcolumns2 = new ArrayList<ArrayList<String>>(tables.get(i).datas);\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\t//check if the tables are union compatable\\r\\n\\t\\tif (columns1.size() != columns2.size()) {\\r\\n\\t\\t\\tSystem.out.println(\\\"Unable to perform union - unnequal number of columns.\\\");\\r\\n\\t\\t}\\r\\n\\t\\telse {\\t//only continue if they are union compatable\\r\\n\\t\\t\\t//true if all columns have the same type\\r\\n\\t\\t\\tint sameTypes = 1;\\r\\n\\t\\t\\tint type1 = 0;\\r\\n\\t\\t\\tint type2 = 0;\\r\\n\\t\\t\\t//a max char value of -1 indicates the type is integer\\r\\n\\t\\t\\tfor (int j = 0; j < columns1.size(); j++) {\\r\\n\\t\\t\\t\\ttype1 = Integer.valueOf(new String(columns1.get(j).get(1)));\\r\\n\\t\\t\\t\\ttype2 = Integer.valueOf(columns2.get(j).get(1));\\r\\n\\t\\t\\t\\tif (type1 > 0) { type1 = 1; }\\r\\n\\t\\t\\t\\telse if (type1 < 0) { type1 = -1; }\\r\\n\\t\\t\\t\\tif (type2 > 0) { type2 = 1; }\\r\\n\\t\\t\\t\\telse if (type2 < 0) { type2 = -1; }\\r\\n\\t\\t\\t\\t//if the types were not equal, don't continue\\r\\n\\t\\t\\t\\tif (type1 != type2) {\\r\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"Unable to perform union - incompatible types.\\\");\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\telse {\\t//continue if the types are equal\\r\\n\\t\\t\\t\\t\\t\\t//create new columns holding the name from the first table and the greatest char max\\r\\n\\t\\t\\t\\t\\tArrayList<String> newColumn = new ArrayList<String>();\\r\\n\\t\\t\\t\\t\\tint largestChar = 0;\\r\\n\\t\\t\\t\\t\\tif (type1 != -1) {\\t//if they aren't integers\\r\\n\\t\\t\\t\\t\\t\\t//find the largest max char value\\r\\n\\t\\t\\t\\t\\t\\tif (Integer.parseInt(columns1.get(j).get(1)) >= Integer.parseInt(columns2.get(j).get(1))) {\\r\\n\\t\\t\\t\\t\\t\\t\\tlargestChar = Integer.parseInt(new String(columns1.get(j).get(1)));\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\telse { \\r\\n\\t\\t\\t\\t\\t\\t\\tlargestChar = Integer.parseInt(columns2.get(j).get(1)); \\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t//keep the type as integer\\r\\n\\t\\t\\t\\t\\telse { \\r\\n\\t\\t\\t\\t\\t\\tlargestChar = -1; \\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t//use the name from the first table and largest char max\\r\\n\\t\\t\\t\\t\\tnewColumn.add(new String(columns1.get(j).get(0)));\\r\\n\\t\\t\\t\\t\\tnewColumn.add(String.valueOf(largestChar));\\r\\n\\t\\t\\t\\t\\tunion.add(newColumn);\\r\\n\\t\\t\\t\\t\\t//check if there are equal rows to avoid duplicates\\r\\n\\t\\t\\t\\t\\tint colCount = 0;\\r\\n\\t\\t\\t\\t\\tfor (int n = 2; n < columns1.get(colCount).size(); n++) {\\t//for each row in table1\\r\\n\\t\\t\\t\\t\\t\\tunion.get(j).add(new String(columns1.get(j).get(n)));\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\t\\t\\r\\n\\t\\t\\tfor(int t = 2; t<columns2.get(0).size(); t++){\\t//column2 row\\r\\n\\t\\t\\t\\tboolean completeUniqe = true;\\r\\n\\t\\t\\t\\tfor(int p = 2; p < union.get(0).size(); p++){// rows of union\\r\\n\\t\\t\\t\\t\\tint sameCount = 0;\\r\\n\\t\\t\\t\\t\\tfor(int u = 0; u<union.size(); u++){//columns of union\\r\\n\\t\\t\\t\\t\\t\\tif(columns2.get(u).get(t).equals(union.get(u).get(p))){\\r\\n\\t\\t\\t\\t\\t\\t\\tsameCount++;\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\tSystem.out.println(sameCount);\\r\\n\\t\\t\\t\\t\\tif(sameCount == union.size()){\\r\\n\\t\\t\\t\\t\\t\\tcompleteUniqe = false;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tif(completeUniqe){\\r\\n\\t\\t\\t\\t\\tfor(int u = 0; u<union.size(); u++){//columns of union\\r\\n\\t\\t\\t\\t\\t\\tunion.get(u).add(new String(columns2.get(u).get(t)));\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\treturn union;\\r\\n\\t}\",\n \"public void union(T x, T y) {\\n\\t\\tassert (_parents.containsKey(x));\\n\\t\\tassert (_parents.containsKey(y));\\n\\n\\t\\tx = find(x);\\n\\t\\ty = find(y);\\n\\n\\t\\tif (x == y) {\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\n\\t\\tint xRank = _ranks.get(x);\\n\\t\\tint yRank = _ranks.get(y);\\n\\n\\t\\tif (xRank < yRank) {\\n\\t\\t\\t_parents.put(x, y);\\n\\t\\t} else if (xRank > yRank) {\\n\\t\\t\\t_parents.put(y, x);\\n\\t\\t} else {\\n\\t\\t\\t_parents.put(y, x);\\n\\t\\t\\t_ranks.put(x, xRank + 1);\\n\\t\\t}\\n\\n\\t\\t_numSets--;\\n\\t}\",\n \"@Test void testInterpretUnion() {\\n rootSchema.add(\\\"simple\\\", new ScannableTableTest.SimpleTable());\\n final String sql = \\\"select * from \\\\\\\"simple\\\\\\\"\\\\n\\\"\\n + \\\"union\\\\n\\\"\\n + \\\"select * from \\\\\\\"simple\\\\\\\"\\\";\\n sql(sql).returnsRowsUnordered(\\\"[0]\\\", \\\"[10]\\\", \\\"[20]\\\", \\\"[30]\\\");\\n }\",\n \"public void union(Vertex v1, Vertex v2) {\\n\\n // find the two vertices' path root\\n Vertex r1 = find(v1);\\n Vertex r2 = find(v2);\\n\\n // if the two roots are equal, just return\\n if(r1.equals(r2)){\\n return;\\n } else if(r1.getSize()>r2.getSize()){\\n // if the r1 path size is greater than r2\\n // just change the vertex 2's root to vertex 1\\n r2.setRoot(r1);\\n // increment the size of r1 set\\n r1.setSize(r2.getSize());\\n } else {\\n r1.setRoot(r2);\\n r2.setSize(r1.getSize());\\n }\\n \\n }\",\n \"public static void QuasiThresholdEditingMinimization (Graph<Integer,String> g, int currentSize, EditSet S){\\n\\t\\t\\r\\n\\t\\tboolean existsP4orC4 = false;\\r\\n\\t\\tif (currentSize >= minSoFarQTEdit) return; \\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t\\tIterator<Integer> a = g.getVertices().iterator();\\r\\n\\t\\tIterator<Integer> b;\\r\\n\\t\\tIterator<Integer> c;\\r\\n\\t\\tIterator<Integer> d;\\r\\n\\t\\twhile(a.hasNext()){\\r\\n\\t\\t\\tInteger A = a.next();\\r\\n\\t\\t\\t//System.out.print(\\\"\\\"+A+\\\" \\\");\\r\\n\\t\\t\\tb = g.getNeighbors(A).iterator();\\r\\n\\t\\t\\twhile(b.hasNext()){\\r\\n\\t\\t\\t\\tInteger B = b.next();\\r\\n\\t\\t\\t\\tc = g.getNeighbors(B).iterator();\\r\\n\\t\\t\\t\\twhile (c.hasNext()){\\r\\n\\t\\t\\t\\t\\tInteger C = c.next();\\r\\n\\t\\t\\t\\t\\tif (g.isNeighbor(C, A) || C==A) continue;\\r\\n\\t\\t\\t\\t\\td = g.getNeighbors(C).iterator();\\r\\n\\t\\t\\t\\t\\twhile (d.hasNext()){\\r\\n\\t\\t\\t\\t\\t\\tInteger D = d.next();\\r\\n\\t\\t\\t\\t\\t\\tif (D==B) continue; \\r\\n\\t\\t\\t\\t\\t\\tif (g.isNeighbor(D,B)) continue;\\r\\n\\t\\t\\t\\t\\t\\t//otherwise, we have a P4 or a C4\\r\\n\\r\\n\\t\\t\\t\\t\\t\\texistsP4orC4 = true;\\r\\n\\t\\t\\t\\t\\t\\t//System.out.print(\\\"Found P4: \\\"+A+\\\"-\\\"+B+\\\"-\\\"+C+\\\"-\\\"+D+\\\"... not a cograph\\\\n\\\");\\r\\n\\r\\n\\t\\t\\t\\t\\t\\tif (g.isNeighbor(D,A)) {\\r\\n\\t\\t\\t\\t\\t\\t\\t// we have a C4 = a-b-c-d-a\\r\\n\\t\\t\\t\\t\\t\\t\\t// add a diagonal chord or delete any two edges\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\tif (S.isIn(A, C)==-1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"e\\\"+A+\\\",\\\"+C, A,C);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.add(A,C);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tQuasiThresholdEditingMinimization(g,1+currentSize,S);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(A, C));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.remove(A,C);\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\tif (S.isIn(B,D) == -1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"e\\\"+B+\\\",\\\"+D, B,D);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.add(B,D);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tQuasiThresholdEditingMinimization(g,1+currentSize,S);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(B,D));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.remove(B,D);\\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\\tif (S.isIn(A,B) == -1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(A, B));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.add(A,B);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tif (S.isIn(B,C) == -1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(B, C));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tS.add(B,C);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tQuasiThresholdEditingMinimization(g,2+currentSize,S);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+B+\\\"-\\\"+C, B,C);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tS.remove(B,C);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tif (S.isIn(C,D) == -1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(C, D));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tS.add(C,D);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tQuasiThresholdEditingMinimization(g,2+currentSize,S);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+C+\\\"-\\\"+D, C,D);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tS.remove(C,D);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tif (S.isIn(D, A) == -1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(D, A));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tS.add(D,A);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tQuasiThresholdEditingMinimization(g,2+currentSize,S);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+D+\\\"-\\\"+A, D,A);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tS.remove(D,A);\\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\\t\\tg.addEdge(\\\"mar-\\\"+A+\\\"-\\\"+B,A,B);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.remove(A, B);\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t// all cases with AB deleted are done.\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tif (S.isIn(D,A) == -1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(D,A));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.add(D,A);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tif (S.isIn(B,C) == -1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(B, C));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tS.add(B,C);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tQuasiThresholdEditingMinimization(g,currentSize+2,S);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+B+\\\"-\\\"+C, B,C);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tS.remove(B,C);\\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\\t\\tif (S.isIn(C,D) == -1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(C, D));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tS.add(C,D);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tQuasiThresholdEditingMinimization(g,currentSize+2,S);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+C+\\\"-\\\"+D,C,D);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tS.remove(C,D);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+A+\\\"-\\\"+D, A,D);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.remove(D,A);\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t// all cases with AB deleted or AD deleted are done\\r\\n\\t\\t\\t\\t\\t\\t\\t// only need to try BC and CD together deleted.\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\tif (S.isIn(B,C)== -1 && S.isIn(C, D)== -1) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(B, C));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(C, D));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.add(B,C);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.add(C,D);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tQuasiThresholdEditingMinimization(g,currentSize+2,S);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+B+\\\"-\\\"+C, B,C);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+C+\\\"-\\\"+D, C,D);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.remove(B,C);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.remove(C,D);\\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\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t} // end of C4-handling cases\\r\\n\\r\\n\\t\\t\\t\\t\\t\\telse {\\r\\n\\t\\t\\t\\t\\t\\t\\t// this case says:\\r\\n\\t\\t\\t\\t\\t\\t\\t// else D is NOT adjacent to A. Then we have P4=abcd\\r\\n\\t\\t\\t\\t\\t\\t\\t// either add ac or bd or else delete one edge\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t//int branchCase = randomInt(1,5);\\t\\r\\n\\t\\t\\t\\t\\t\\t//if (branchCase <= 2) {\\r\\n\\t\\t\\t\\t\\t\\t\\tif (S.isIn(A, C) == -1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"e\\\"+A+\\\",\\\"+C, A, C);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.add(A,C);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tQuasiThresholdEditingMinimization(g,currentSize+1,S);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(A, C));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.remove(A,C);\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\tif (S.isIn(B,D) == -1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"e\\\"+B+\\\",\\\"+D, B, D);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.add(B,D);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tQuasiThresholdEditingMinimization(g,currentSize+1,S);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(B, D));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.remove(B,D);\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t//}\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t//else if (branchCase == 3) {\\r\\n\\t\\t\\t\\t\\t\\t\\tif (S.isIn(A,B)== -1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(A, B));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.add(A, B);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tQuasiThresholdEditingMinimization(g,currentSize+1,S);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+A+\\\"-\\\"+B, A,B);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.remove(A,B);\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t//}\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t//else if (branchCase == 4) {\\r\\n\\t\\t\\t\\t\\t\\t\\tif (S.isIn(B,C) == -1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(B, C));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.add(B, C);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tQuasiThresholdEditingMinimization(g,currentSize+1,S);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+B+\\\"-\\\"+C, B,C);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.remove(B,C);\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t//}\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t//else if (branchCase == 5) {\\r\\n\\t\\t\\t\\t\\t\\t\\tif (S.isIn(C,D) == -1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(C, D));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.add(C,D);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tQuasiThresholdEditingMinimization(g,currentSize+1,S);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+C+\\\"-\\\"+D, C,D);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.remove(C,D);\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t//}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t} // end of P4-handling\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tif (existsP4orC4 == true) return;\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t} // end d.hasNext()\\r\\n\\t\\t\\t\\t} // end c.hasNext()\\r\\n\\t\\t\\t} // end b.hasNext()\\r\\n\\t\\t} // end a.hasNext()\\r\\n\\r\\n\\t\\t// if we reached here, no P4 was found\\r\\n\\t\\tif (existsP4orC4 == false) {\\r\\n\\t\\t\\t// arrived at a quasi-threshold graph since no P4 or C4 was found\\r\\n\\t\\t\\tSystem.out.print(\\\"\\\\n currentSize = \\\"+currentSize+\\\" and minSoFar = \\\"+minSoFarQTEdit+\\\"\\\\n\\\");\\r\\n\\t\\t\\tSystem.out.print(\\\"Modified(Edited) graph has \\\"+g.getEdgeCount()+\\\" edges and is:\\\\n\\\");\\r\\n\\t\\t\\tminSoFarQTEdit = currentSize;\\r\\n\\t\\t\\tSystem.out.print(\\\"\\\"+g+\\\"\\\\n\\\");\\r\\n\\t\\t\\tSystem.out.print(\\\"Edit set is \\\" + S + \\\"\\\\n\\\");\\r\\n\\t\\t\\tNewTools.printToFile(currentSize,g,S,\\\"QTEditLesMis.txt\\\");\\r\\n\\t\\t\\treturn;\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\t// ...\\r\\n\\t\\tSystem.out.print(\\\"Critical Error. No P_4 or C_4 found in a non-quasi-threshold graph.\\\\n\\\");\\r\\n\\t\\treturn;\\r\\n\\t}\",\n \"public void createMaze(int rows, int cols) {\\n\\t\\t\\n\\t\\tint total = rows*cols;\\n\\t\\tDisjSets ds = new DisjSets(total); //Create an object of the disjoint set class\\n\\t\\t \\n\\t\\tList<List<Node>> maze = new ArrayList<List<Node>>();\\n\\t\\t \\n\\t\\tmaze = initializeMaze(rows, cols, maze); //Initialize the maze\\n\\t\\t \\n\\t\\tRandom rand = new Random();\\n\\t\\t \\n\\t\\twhile(ds.find(0) != ds.find(total - 1)) {\\n\\t\\t\\t \\n\\t\\t\\tint currRow = rand.nextInt(rows); //Random row number\\n\\t\\t\\tint currCol = rand.nextInt(cols); //Random column number\\n\\t\\t\\tNode currNode = maze.get(currRow).get(currCol); //Current node(cell)\\n\\t\\t\\tint currValue = currNode.value;\\n\\t\\t\\t \\n\\t\\t\\tint root1 = ds.find(currValue); //Find on current node(cell)\\n\\t\\t\\tint root2;\\n\\t\\t\\tboolean removeHorizontal = false;\\n\\t\\t\\t \\n\\t\\t\\tif(currValue == total - 1) {\\n\\t\\t\\t\\tcontinue; //Don't do anything if the current cell is the bottom-rightmost cell\\n\\t\\t\\t}\\n\\t\\t\\t \\n\\t\\t\\tif(currRow == rows - 1) {\\n\\t\\t\\t\\t//Last row -- can only break the right wall, can't break the wall to the bottom \\n\\t\\t\\t\\troot2 = ds.find(currValue + 1);\\n\\t\\t\\t} else if(currCol == cols - 1) {\\n\\t\\t\\t\\t//Last column -- can only break the wall to the bottom, can't break the right wall \\n\\t\\t\\t\\troot2 = ds.find(currValue + cols);\\n\\t\\t\\t\\tremoveHorizontal = true;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\t//Neither last row nor last column\\n\\t\\t\\t\\t//Randomly select either right wall or wall to the bottom to break\\n\\t\\t\\t\\tboolean selectRight;\\n\\t\\t\\t\\tselectRight = rand.nextBoolean();\\n\\t\\t\\t\\t \\n\\t\\t\\t\\tif(selectRight) {\\n\\t\\t\\t\\t\\troot2 = ds.find(currValue + 1);\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\troot2 = ds.find(currValue + cols);\\n\\t\\t\\t\\t\\tremoveHorizontal = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t//Finds resulted in different sets\\n\\t\\t\\tif(root1 != root2) {\\n\\t\\t\\t\\t \\n\\t\\t\\t\\tds.union(root1, root2); //Take union of the two sets\\n\\t\\t\\t\\t \\n\\t\\t\\t\\tif(removeHorizontal) {\\n\\t\\t\\t\\t\\tcurrNode.horizontal = false; //Break the horizontal wall\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tcurrNode.vertical = false; //Break the vertical wall\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t//Leave the bottom right corner open\\n\\t\\tNode destination = maze.get(rows - 1).get(cols - 1);\\n\\t\\tdestination.horizontal = false;\\n\\t\\tdestination.vertical = false;\\n\\t\\t \\n\\t\\tprintMaze(rows, cols, maze); //Print the final maze\\n\\t}\",\n \"static void constructUnionFindDataStructure() {\\n\\n\\t\\t// construct a scanner for an input file\\n\\t\\tScanner scanner = null;\\n\\t\\ttry {\\n\\n\\t\\t\\tscanner = new Scanner(new File(\\\"tinyUF.txt\\\"));\\n\\t\\t} \\n\\t\\tcatch (FileNotFoundException e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\n\\t\\t// read the number of objects from the standard input\\n\\t\\tint n = Integer.parseInt(scanner.nextLine());\\n\\n\\t\\t// initialise a union-find data structure\\n\\t\\tUnionFind unionFind = new UnionFind(n);\\n\\n\\t\\t/* Repeatedly read in pairs of integers (object identifiers). If they are not yet connected, connect them\\n\\t\\t * and print out the pair */\\n\\n\\t\\twhile (scanner.hasNextLine()) {\\n\\n\\t\\t\\t// read integers\\n\\t\\t\\tString pair = scanner.nextLine();\\n\\t\\t\\tString[] objects = pair.split(\\\" \\\");\\n\\t\\t\\tint p = Integer.parseInt(objects[0]);\\n\\t\\t\\tint q = Integer.parseInt(objects[1]);\\n\\n\\t\\t\\t// connect them if not already\\n\\t\\t\\tif (!unionFind.connected(p, q)) {\\n\\n\\t\\t\\t\\tunionFind.union(p, q);\\n\\t\\t\\t\\tSystem.out.println(p + \\\" \\\" + q);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"static int[][] unite4arrays(Map<Integer, int[][]> map, int size) {\\n int sqrt = (int) Math.sqrt( map.keySet().size());\\n int[][] result = new int[size * sqrt][size * sqrt];\\n for (int i = 0; i < map.keySet().size(); i++) {\\n\\n for (int x = 0; x < size; x++) {\\n for (int y = 0; y < size; y++) {\\n result[x + size * (i % sqrt)][y + size * (i / sqrt)] = map.get(i)[x][y];\\n }\\n }\\n\\n }\\n return result;\\n }\",\n \"public static void main( String [ ] args )\\r\\n {\\r\\n \\r\\n \\t\\r\\n \\t\\r\\n \\tint maze_row=0;\\r\\n \\tint maze_column=0;\\r\\n \\t\\r\\n\\t\\t\\r\\n\\t\\tScanner type = new Scanner(System.in);\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t\\tdo\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\ttry \\r\\n\\t\\t\\t\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tSystem.out.print(\\\"Please enter number of row between 1 and 20: \\\");\\r\\n\\t\\t\\t\\tmaze_row = Integer.valueOf(type.next());\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tcatch (NumberFormatException e)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\t//System.out.println(\\\"Input didn't match with the requirement: Try Again\\\");\\r\\n\\t\\t\\t\\tmaze_row=21;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\twhile(maze_row>20 || maze_row<1);\\r\\n\\t\\tdo\\r\\n\\t\\t{\\r\\n\\t\\ttry \\r\\n\\t\\t\\r\\n\\t\\t{\\r\\n\\t\\t\\tSystem.out.print(\\\"Please enter number of column between 1 and 20: \\\");\\r\\n\\t\\t\\tmaze_column = Integer.valueOf(type.next());\\r\\n\\t\\t}\\r\\n\\t\\tcatch (NumberFormatException e)\\r\\n\\t\\t{\\r\\n\\t\\t\\t//System.out.println(\\\"Input didn't match with the requirement: Try Again\\\");\\r\\n\\t\\t\\tmaze_column=21;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\t}\\r\\n\\twhile(maze_column>20 ||maze_column<1);\\r\\n\\t\\t\\r\\n\\t\\ttype.close();\\r\\n\\t\\tSystem.out.println();\\r\\n \\tcreateMaze(maze_row,maze_column);\\r\\n \\tshowMaze();\\r\\n \\t\\r\\n \\t\\r\\n \\t\\r\\n \\t\\r\\n \\t\\r\\n \\t\\r\\n \\t\\r\\n \\t\\r\\n \\t/* int NumElements = 128;\\r\\n int NumInSameSet = 16;\\r\\n\\r\\n DisjSets ds = new DisjSets( NumElements );\\r\\n int set1, set2;\\r\\n\\r\\n for( int k = 1; k < NumInSameSet; k *= 2 )\\r\\n {\\r\\n for( int j = 0; j + k < NumElements; j += 2 * k )\\r\\n {\\r\\n set1 = ds.find( j );\\r\\n set2 = ds.find( j + k );\\r\\n ds.union( set1, set2 );\\r\\n }\\r\\n }\\r\\n\\r\\n for( int i = 0; i < NumElements; i++ )\\r\\n {\\r\\n System.out.print( ds.find( i )+ \\\"*\\\" );\\r\\n if( i % NumInSameSet == NumInSameSet - 1 )\\r\\n System.out.println( );\\r\\n }\\r\\n System.out.println( );*/\\r\\n }\",\n \"public void updateUnionArea() {\\n this.mBlurUnionRect.setEmpty();\\n for (Map.Entry<View, HwBlurEntity> entityEntry : this.mTargetViews.entrySet()) {\\n View targetView = entityEntry.getKey();\\n HwBlurEntity blurEntity = entityEntry.getValue();\\n if (targetView.isShown() && blurEntity.isEnabled()) {\\n Rect targetViewRect = new Rect();\\n targetView.getGlobalVisibleRect(targetViewRect);\\n blurEntity.setTargetViewRect(targetViewRect);\\n this.mBlurUnionRect.union(targetViewRect);\\n }\\n targetView.invalidate();\\n }\\n initBitmapAndCanvas();\\n }\",\n \"private void unionSmallLarge(int small, int large) {\\n unionStart = System.currentTimeMillis();\\n\\n log.debug(\\\" --- union smallID=\\\" + small + \\\", largeID=\\\" + large);\\n\\n int moveCount = 0;\\n for (int i = 0; i < vertexUnionLeaders.length; i++) {\\n if (vertexUnionLeaders[i] == small) {\\n\\n\\n log.debug(\\\" changing \\\" + i + \\\" from old smallID=\\\" + small + \\\" to new largeD=\\\" + large);\\n vertexUnionLeaders[i] = large;\\n moveCount++;\\n }\\n }\\n\\n // update the large group member count\\n ClusterGroup lGroup = clusterGroupMap.get(large);\\n if (lGroup == null) {\\n lGroup = new ClusterGroup(large, 1);\\n clusterGroupMap.put(large, lGroup);\\n log.debug(\\\" created new ClusterGroup for largeID=\\\" + large + \\\", size=1\\\");\\n }\\n int lSize = lGroup.groupSize;\\n log.debug(\\\" old group size=\\\" + lSize + \\\", about to add smallID size=\\\" + moveCount);\\n lSize += moveCount;\\n lGroup.groupSize = lSize;\\n log.debug(\\\" groupID=\\\" + lGroup.groupID + \\\" size=\\\" + lSize);\\n\\n // now remove the small group from the map\\n clusterGroupMap.remove(small);\\n unionEnd = System.currentTimeMillis();\\n }\",\n \"public void setStructureSize(int size) {\\n\\t\\tmStructureSize = size;\\n\\t\\tvalidateSize();\\n\\t\\trepaint();\\n\\t\\t}\",\n \"public void trimToSize();\",\n \"public void setSize(int size) {\\n\\t\\tdist = new double[size];\\n\\t\\tprev = new Node[size];\\n\\t\\tready = new boolean[size];\\n\\t}\",\n \"@Test\\n public void testUnionOnSchemaSameSchema() throws Exception {\\n PigServer pig = new PigServer(Util.getLocalTestMode());\\n String query =\\n \\\" l1 = load '\\\" + INP_FILE_2NUMS + \\\"' as (i : int, j : int);\\\"\\n + \\\"l2 = load '\\\" + INP_FILE_2NUMS + \\\"' as (i : int, j : int);\\\"\\n + \\\"u = union onschema l1, l2;\\\"\\n ; \\n Util.registerMultiLineQuery(pig, query);\\n Schema expectedSch = Utils.getSchemaFromString(\\\"i: int, j: int\\\");\\n Schema sch = pig.dumpSchema(\\\"u\\\");\\n assertEquals(\\\"Checking expected schema\\\",sch, expectedSch);\\n Iterator<Tuple> it = pig.openIterator(\\\"u\\\");\\n \\n List<Tuple> expectedRes = \\n Util.getTuplesFromConstantTupleStrings(\\n new String[] {\\n \\\"(1,2)\\\",\\n \\\"(5,3)\\\",\\n \\\"(1,2)\\\",\\n \\\"(5,3)\\\"\\n });\\n Util.checkQueryOutputsAfterSort(it, expectedRes);\\n\\n }\",\n \"public static void main(String[] args) throws IOException{\\n Scanner f = new Scanner(System.in);\\n //BufferedReader f = new BufferedReader(new FileReader(\\\"uva.in\\\"));\\n //BufferedReader f = new BufferedReader(new InputStreamReader(System.in));\\n PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));\\n while(true) {\\n int C = f.nextInt();\\n int R = f.nextInt();\\n if(C == 0 && R == 0) {\\n break;\\n }\\n HashMap<String,Integer> getIndex = new HashMap<>();\\n for(int i = 0; i < C; i++) {\\n getIndex.put(f.next(),i);\\n }\\n int[] leaderIds = new int[C];\\n int[] groupSizes = new int[C];\\n for(int i = 0; i < C; i++) {\\n leaderIds[i] = i;\\n groupSizes[i] = 1;\\n }\\n for(int i = 0; i < R; i++) {\\n int p = getIndex.get(f.next());\\n int q = getIndex.get(f.next());\\n if(root(leaderIds,p) != root(leaderIds,q)) {\\n union(leaderIds,groupSizes,p,q);\\n }\\n }\\n int max = 0;\\n for(int i = 0; i < C; i++) {\\n int p = root(leaderIds,i);\\n max = Math.max(max,groupSizes[p]);\\n }\\n out.println(max);\\n }\\n f.close();\\n out.close();\\n }\",\n \"public QueueArrayShiftingVirtualOverflow(int size) {\\n super(size);\\n }\",\n \"void Union(int parent[], int x, int y){ \\n int xset = find(parent, x); \\n int yset = find(parent, y); \\n parent[xset] = yset; \\n }\",\n \"public int state_build_regions(HashMap<Integer, Integer> rmap) {\\r\\n\\t\\tUnionFind u=new UnionFind();\\r\\n\\t\\t\\r\\n\\t\\t//build Unionfind\\r\\n\\t\\tfor(Integer nodeIndex:allNodes.keySet()) {\\r\\n\\t\\t\\r\\n\\t\\t\\tLinkedList<Integer> neighborsIndex=nowMap.get(nodeIndex);\\r\\n\\t\\t\\tif(allNodes.get(nodeIndex).path==0) {\\r\\n\\t\\t\\t\\tfor(Integer nIndex:neighborsIndex) {\\r\\n\\t\\t\\t\\t\\tif(allNodes.get(nIndex).path==0)\\r\\n\\t\\t\\t\\t\\t\\tu.union(allNodes.get(nIndex),allNodes.get(nodeIndex));\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t} else if(allNodes.get(nodeIndex).path!=0) {\\r\\n\\t\\t\\t\\tfor(Integer nIndex:neighborsIndex) {\\r\\n\\t\\t\\t\\t\\tif(allNodes.get(nIndex).path!=0)\\r\\n\\t\\t\\t\\t\\t\\tu.union(allNodes.get(nIndex),allNodes.get(nodeIndex));\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tint rcount=1;\\r\\n\\t\\tLinkedList<Node> count=new LinkedList<Node>();\\r\\n\\t\\t//find regions\\r\\n\\t\\tfor(Integer nIndex:allNodes.keySet()) {\\r\\n\\t\\t\\tNode n=allNodes.get(nIndex);\\r\\n\\t\\t\\tNode np=u.find(n);\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tif(np.path==0) {\\r\\n\\t\\t\\t\\tif(count.contains(np)) {\\r\\n\\t\\t\\t\\t\\trmap.put(nIndex, count.indexOf(np)+1);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\telse {\\r\\n\\t\\t\\t\\t\\tcount.add(np);\\r\\n\\t\\t\\t\\t\\trmap.put(nIndex, count.indexOf(np)+1);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}else {\\r\\n\\t\\t\\t\\trmap.put(nIndex, -1);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\r\\n\\t\\treturn rcount;\\r\\n\\t}\",\n \"public org.apache.gora.cascading.test.storage.TestRow getUnionRecursive() {\\n return unionRecursive;\\n }\",\n \"public boolean setSize(Size size, boolean force) {\\n// if (!force) {\\n// Entity intersectsWith = location.getWorld().intersects(this, Util.getRectangle(getLocation(), size));\\n//\\n// if (intersectsWith != null) {\\n// boolean left = intersectsWith.getLocation().getX() + intersectsWith.getSize().getWidth() <= getLocation().getX();\\n// boolean right = intersectsWith.getLocation().getX() <= getLocation().getX() + size.getWidth();\\n// boolean top = intersectsWith.getLocation().getY() <= getLocation().getY() + size.getHeight() && intersectsWith.getLocation().getY() > getLocation().getY();\\n//\\n//// if (top && !left && !right)\\n//// return false;\\n//\\n// Location moveTo = null;\\n//\\n// if (left)\\n// moveTo = new Location(getWorld(), intersectsWith.getLocation().getX() + intersectsWith.getSize().getWidth() + size.getWidth(), getLocation().getY());\\n// if (right)\\n// moveTo = new Location(getWorld(), intersectsWith.getLocation().getX() - size.getWidth() - 1, getLocation().getY());\\n// if (top) {\\n// this.size.setHeight(intersectsWith.getLocation().getY() - this.location.getY());\\n// System.out.println(this.size.getHeight());\\n//// return false;\\n// }\\n//\\n// if (moveTo != null) {\\n// Entity intersects = location.getWorld().intersects(this, Util.getRectangle(moveTo, size));\\n//\\n// if (intersects == null && this.location.asVector().distance(moveTo.asVector()) < 15)\\n// this.location = moveTo;\\n// else return false;\\n// }\\n// }\\n// }\\n\\n if (interactingWithX != null || interactingWithY != null) {\\n boolean left = interactingWithX != null && interactingWithX.getLocation().getX() + interactingWithX.size.width <= getLocation().getX();\\n boolean right = interactingWithX != null && interactingWithX.getLocation().getX() <= getLocation().getX() + size.width;\\n boolean top = interactingWithY != null && (interactingWithY.getLocation().getY() <= getLocation().getY() + size.height && interactingWithY.getLocation().getY() > getLocation().getY());\\n\\n// if (top && !left && !right)\\n// return false;\\n\\n Location moveTo = null;\\n\\n if (left)\\n moveTo = new Location(getWorld(), interactingWithX.getLocation().getX() + interactingWithX.size.width + size.width, getLocation().getY());\\n if (right)\\n moveTo = new Location(getWorld(), interactingWithX.getLocation().getX() - size.width - 1, getLocation().getY());\\n if (top) {\\n this.size.height = interactingWithY.getLocation().getY() - this.location.getY();\\n System.out.println(this.size.height);\\n// return false;\\n }\\n\\n if (moveTo != null) {\\n Entity intersects = location.getWorld().intersects(this, Util.getRectangle(moveTo, size));\\n\\n if (intersects == null && this.location.asVector().distance(moveTo.asVector()) < 15)\\n this.location = moveTo;\\n else return false;\\n }\\n }\\n\\n this.size = size;\\n return true;\\n }\",\n \"@Override\\n public void union(int root1, int root2) {\\n // TODO: Implement the union-by-rank algorithm for disjoint set\\n if (s[root1]>-1 || s[root2]>-1 ) throw new IllegalArgumentException(\\\"Impossible to union because one of the roots is already dependant\\\");\\n if( s[root2] < s[root1]){ // root2 is deeper\\n s[root1] = root2;// Make root2 new root\\n } \\n else{\\n if(s[root1] == s[root2]) s[ root1 ]--; // Update height if same\\n s[root2] = root1; // Make root1 new root\\n }\\n }\",\n \"public QuadTree(PointView<Point> view, int transitionSize) {\\n super(view);\\n _transitionSize = transitionSize;\\n _nodeOrigin = new double[2];\\n _elements = new ArrayList<Point>();\\n _subdivided = false;\\n _elementsSize = 0;\\n _treeSize = 0;\\n }\",\n \"@Test\\n public void testSize(){\\n assertEquals(25, largeMaze.size());\\n }\",\n \"public void open(int row, int col){\\n\\t\\tif (row <= 0 || col <= 0 || row > storeVar || col > storeVar) \\n\\t\\t\\tthrow new IllegalArgumentException(\\\"row index i out of bounds\\\");\\n\\n\\t\\t// System.out.println(\\\"\\\\n We're opening again! \\\");\\n\\t\\tint currIndex = ((row-1)*storeVar) + col;\\n\\n\\t\\tif (isOpen(row, col)) return;\\n\\t\\topenSites++;\\n\\t\\tgrid[currIndex] = true;\\n\\n\\n\\t\\tif (currIndex < storeVar+1 ){\\n\\t\\t\\tunionFind.union(currIndex, virtualTop);\\n\\t\\t\\tbackwash.union(currIndex, virtualTop);\\n\\t\\t\\tfullgrid[currIndex] = true;\\n\\t\\t}\\n\\t\\tif ((currIndex < grid.length - 1) && (currIndex >= (grid.length - 1 - storeVar))){\\n\\t\\t\\t// System.out.println(\\\"Confirmed that bottom is connected\\\");\\n\\t\\t\\tunionFind.union(currIndex, virtualBottom);\\n\\t\\t}\\n\\n\\t\\t\\n\\t\\tif(row + 1 <= storeVar && isOpen(row + 1, col)){\\n\\t\\t\\tif (!unionFind.connected(currIndex, currIndex+storeVar)) {\\n\\t\\t\\t\\tunionFind.union(currIndex, currIndex+storeVar);\\n\\t\\t\\t\\tbackwash.union(currIndex, currIndex+storeVar);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(col + 1 <= storeVar && isOpen(row , col+1)){\\n\\t\\t\\tif (!unionFind.connected(currIndex, currIndex+1)) {\\n\\t\\t\\t\\tunionFind.union(currIndex, currIndex+1);\\n\\t\\t\\t\\tbackwash.union(currIndex, currIndex+1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(row - 1 > 0 && isOpen(row - 1, col)){\\n\\t\\t\\tif (!unionFind.connected(currIndex, currIndex-storeVar)){ \\n\\t\\t\\t\\tunionFind.union(currIndex, currIndex-storeVar);\\n\\t\\t\\t\\tbackwash.union(currIndex, currIndex-storeVar);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(col - 1 > 0 && isOpen(row , col-1)){\\n\\t\\t\\tif (!unionFind.connected(currIndex, currIndex-1)){\\n\\t\\t\\t unionFind.union(currIndex, currIndex-1);\\n\\t\\t\\t backwash.union(currIndex, currIndex-1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"public static void QTdeletionMinimization (Graph<Integer,String> g, int currentSize) {\\n\\t\\t\\r\\n\\t\\tboolean existsP4orC4 = false;\\r\\n\\t\\t\\r\\n\\t\\t//int temp = QTDelHeuristic1(Copy(g));\\r\\n\\t\\t//System.out.print(\\\"n = \\\"+g.getVertexCount()+\\\" m=\\\"+g.getEdgeCount()+\\\" hVal = \\\"+temp +\\\"\\\\n\\\");\\r\\n\\t\\tif (currentSize >= minSoFar) return; \\r\\n\\t\\tIterator<Integer> a = g.getVertices().iterator();\\r\\n\\t\\tIterator<Integer> b;\\r\\n\\t\\tIterator<Integer> c;\\r\\n\\t\\tIterator<Integer> d;\\r\\n\\t\\twhile(a.hasNext()){\\r\\n\\t\\t\\tInteger A = a.next();\\r\\n\\t\\t\\t//System.out.print(\\\"\\\"+A+\\\" \\\");\\r\\n\\t\\t\\tb = g.getNeighbors(A).iterator();\\r\\n\\t\\t\\twhile(b.hasNext()){\\r\\n\\t\\t\\t\\tInteger B = b.next();\\r\\n\\t\\t\\t\\tc = g.getNeighbors(B).iterator();\\r\\n\\t\\t\\t\\twhile (c.hasNext()){\\r\\n\\t\\t\\t\\t\\tInteger C = c.next();\\r\\n\\t\\t\\t\\t\\tif (g.isNeighbor(C, A) || C==A) continue;\\r\\n\\t\\t\\t\\t\\td = g.getNeighbors(C).iterator();\\r\\n\\t\\t\\t\\t\\twhile (d.hasNext()){\\r\\n\\t\\t\\t\\t\\t\\tInteger D = d.next();\\r\\n\\t\\t\\t\\t\\t\\tif (D==B) continue; \\r\\n\\t\\t\\t\\t\\t\\tif (g.isNeighbor(D,B)) continue;\\r\\n\\t\\t\\t\\t\\t\\t//otherwise, we have a P4 or a C4\\r\\n\\r\\n\\t\\t\\t\\t\\t\\texistsP4orC4 = true;\\r\\n\\t\\t\\t\\t\\t\\tif (currentSize + 1 >= minSoFar) return;\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t//System.out.print(\\\"Found P4: \\\"+A+\\\"-\\\"+B+\\\"-\\\"+C+\\\"-\\\"+D+\\\"... not a cograph\\\\n\\\");\\r\\n\\t\\t\\t\\t\\t\\tif (g.isNeighbor(D,A)) {\\r\\n\\t\\t\\t\\t\\t\\t\\t// we have a C4 = a-b-c-d-a\\r\\n\\t\\t\\t\\t\\t\\t\\t// delete any two edges\\r\\n\\t\\t\\t\\t\\t\\t\\tif (currentSize + 2 >= minSoFar) return;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(A, B));\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(B, C));\\r\\n\\t\\t\\t\\t\\t\\t\\tQTdeletionMinimization(g,2+currentSize);\\r\\n\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+B+\\\"-\\\"+C, B,C);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(C, D));\\r\\n\\t\\t\\t\\t\\t\\t\\tQTdeletionMinimization(g,2+currentSize);\\r\\n\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+C+\\\"-\\\"+D, C,D);\\r\\n\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(D, A));\\r\\n\\t\\t\\t\\t\\t\\t\\tQTdeletionMinimization(g,2+currentSize);\\r\\n\\t\\t\\t\\t\\t\\t\\t//g.addEdge(\\\"mar-\\\"+A+\\\"-\\\"+D, A,D);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+A+\\\"-\\\"+B, A,B);\\r\\n\\t\\t\\t\\t\\t\\t\\t// all cases with AB deleted are done. AD is STILL deleted\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(B, C));\\r\\n\\t\\t\\t\\t\\t\\t\\tQTdeletionMinimization(g,2+currentSize);\\r\\n\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+B+\\\"-\\\"+C, B,C);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(C, D));\\r\\n\\t\\t\\t\\t\\t\\t\\tQTdeletionMinimization(g,2+currentSize);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t// all cases with AB deleted or AD deleted are done\\r\\n\\t\\t\\t\\t\\t\\t\\t// at this point, CD and AD are still deleted\\r\\n\\t\\t\\t\\t\\t\\t\\t// only need to try BC and CD together deleted.\\r\\n\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+A+\\\"-\\\"+D, A,D);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(B, C));\\r\\n\\t\\t\\t\\t\\t\\t\\tQTdeletionMinimization(g,2+currentSize);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+B+\\\"-\\\"+C, B,C);\\r\\n\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+C+\\\"-\\\"+D, C,D);\\r\\n\\t\\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\\r\\n\\t\\t\\t\\t\\t\\telse {\\r\\n\\t\\t\\t\\t\\t\\t\\t// this case says:\\r\\n\\t\\t\\t\\t\\t\\t\\t// else D is NOT adjacent to A. Then we have P4=abcd\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tint choice = randomInt(1,4);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tif (choice == 1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(A, B));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tQTdeletionMinimization(g,1+currentSize);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+A+\\\"-\\\"+B, A,B);\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\t\\t\\t\\t\\t\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\telse if (choice == 2) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(C, D));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tQTdeletionMinimization(g,1+currentSize);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+C+\\\"-\\\"+D, C,D);\\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\\telse {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(B, C));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tQTdeletionMinimization(g,1+currentSize);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+B+\\\"-\\\"+C, B,C);\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tif (existsP4orC4==true) {\\r\\n\\t\\t\\t\\t\\t\\t\\t// it found an obstruction and branched on all its ways.\\r\\n\\t\\t\\t\\t\\t\\t\\t// No need to deal with this graph further.\\r\\n\\t\\t\\t\\t\\t\\t\\treturn;\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t} // end d.hasNext()\\r\\n\\t\\t\\t\\t} // end c.hasNext()\\r\\n\\t\\t\\t} // end b.hasNext() \\r\\n\\t\\t} // end a.hasNext()\\r\\n\\r\\n\\t\\t// if we reached here, no P4 was found\\r\\n\\t\\tif (existsP4orC4 == false) {\\r\\n\\t\\t\\t// arrived at a quasi-threshold graph since no P4 or C4 was found\\r\\n\\t\\t\\tSystem.out.print(\\\"\\\\n currentSize = \\\"+currentSize+\\\" and minSoFar = \\\"+minSoFar+\\\"\\\\n\\\");\\r\\n\\t\\t\\tSystem.out.print(\\\"Modified graph has \\\"+g.getEdgeCount()+\\\" edges and is:\\\\n\\\");\\r\\n\\t\\t\\tminSoFar = currentSize;\\r\\n\\t\\t\\tSystem.out.print(\\\"\\\"+g+\\\"\\\\n\\\");\\r\\n\\t\\t\\tNewTools.printToFile(currentSize,g,null,\\\"QTDel.txt\\\");\\r\\n\\t\\t\\t//NewTools.DrawIt(g);\\r\\n\\t\\t\\t//PleaseWait(60000); // one minute\\r\\n\\t\\t\\treturn;\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\t// ...\\r\\n\\t\\tSystem.out.print(\\\"Critical Error. No P_4 or C_4 found in a non-quasi-threshold graph.\\\\n\\\");\\r\\n\\t\\treturn;\\r\\n\\r\\n\\t\\t\\r\\n\\t}\",\n \"void resize() {\\n Comparable[] temp = new Comparable[size * 2];\\n for (int i = 0; i < pq.length; i++) {\\n temp[i] = pq[i];\\n }\\n pq = temp;\\n }\",\n \"public org.apache.gora.cascading.test.storage.TestRow getUnionRecursive() {\\n return unionRecursive;\\n }\",\n \"public void quickUnion(int p, int q) {\\n int pid = find(p);\\n int qid = find(q);\\n if (pid == qid) return;\\n //compare two value's height\\n //if two height is same just need add 1 in parent root\\n if (height[p] == height[q]) {\\n id[pid] = qid;\\n height[qid]++;\\n } else if (height[p] < height[q]) {\\n id[pid] = qid;\\n } else {\\n id[qid] = pid;\\n }\\n\\n }\",\n \"public UnionFind(int n) {\\n\\troot = new int[n];\\n\\tfor (int i = 0; i < n; i++) \\n\\t root[i] = i;\\n\\t\\n\\tsize = new int[n];\\n\\tfor (int i = 0; i < n; i++) \\n\\t size[i] = 1;\\n }\",\n \"public XSUnionSimpleType asUnion() {\\n // This method could not be decompiled.\\n // \\n // Original Bytecode:\\n // \\n // 0: ddiv \\n // 1: fdiv \\n // LocalVariableTable:\\n // Start Length Slot Name Signature\\n // ----- ------ ---- ---- -------------------------------------------\\n // 0 2 0 this Lcom/sun/xml/xsom/impl/UnionSimpleTypeImpl;\\n // \\n // The error that occurred was:\\n // \\n // java.lang.ArrayIndexOutOfBoundsException\\n // \\n throw new IllegalStateException(\\\"An error occurred while decompiling this method.\\\");\\n }\",\n \"@Test\\r\\n\\t\\tpublic void testUnion() {\\n\\t\\t\\ttestingSet = new IntegerSet(list1);\\r\\n\\t\\t\\ttestingSet2= new IntegerSet(list2);\\r\\n\\t\\t\\t// 3rd set =to the union of the two lists \\r\\n\\t\\t\\ttestingSet3= new IntegerSet(union);\\r\\n\\t\\t\\t// 4th set equal to the union of sets 1 and 2 \\r\\n\\t\\t\\ttestingSet4= testingSet.union(testingSet, testingSet2);\\r\\n\\t\\t\\t// sets 3 and 4 should be equal\\r\\n\\t\\t\\t// assertEquals method is deprecated \\r\\n\\t\\t\\tassertArrayEquals(testingSet3.toArray(),testingSet4.toArray());\\r\\n\\t\\t\\t \\r\\n\\t\\t}\",\n \"public void sizeBy(float size) {\\n internalGroup.sizeBy(size);\\n dataTrait.width = internalGroup.getWidth();\\n dataTrait.height = internalGroup.getHeight();\\n resetSprite();\\n }\",\n \"public T union( T obj1, T obj2 )\\n {\\n // Find the root of each object; if either is not contained, the root\\n // value will be null, and we throw an exception.\\n Node root1 = getRoot(nodes.get(obj1));\\n Node root2 = getRoot(nodes.get(obj2));\\n if ( root1 == null && root2 == null )\\n throw new NoSuchElementException( \\\"Sets do not contain either object: \\\" + obj1 + \\\", \\\" + obj2 );\\n if ( root1 == null )\\n throw new NoSuchElementException( \\\"Sets do not contain object: \\\" + obj1 );\\n if ( root2 == null )\\n throw new NoSuchElementException( \\\"Sets do not contain object: \\\" + obj2 );\\n // If already were in same set, just return data from the root of that\\n // set.\\n if ( root1 == root2 )\\n return root1.data;\\n // If not already, then doing union reduces overall number of sets.\\n numSets-- ;\\n // We use root2 as the new parent if either (a) the trees containing\\n // both inputs have same rank and a \\\"coin toss\\\" settles on this case,\\n // or (b) the tree containing obj1 has lower rank.\\n if ( ( root1.rank == root2.rank && Math.random() < 0.5 ) || root1.rank < root2.rank )\\n {\\n // When we link root1 to root2, size of set under root2 inreases.\\n root1.parent = root2;\\n root2.size += root1.size;\\n \\n // When we union two sets of same rank, new root gets higher rank.\\n if ( root1.rank == root2.rank )\\n root2.rank++ ;\\n \\n return root2.data;\\n }\\n else\\n // We use root1 as the new parent if either (a) the trees containing\\n // both inputs have same rank and a \\\"coin toss\\\" settles on this\\n // case, or (b) the tree containing obj2 has lower rank.\\n {\\n // When we link root1 to root2, size of set under root2 inreases.\\n root2.parent = root1;\\n root1.size += root2.size;\\n \\n // When we union two sets of same rank, new root gets higher rank.\\n if ( root1.rank == root2.rank )\\n root1.rank++ ;\\n \\n return root1.data;\\n }\\n }\",\n \"private int pack(int size, int sum) {\\n return size | (sum << 16);\\n }\",\n \"public BSTSet union(BSTSet s) {\\n int[] thisArray = BSTToArray();\\n int[] sArray = s.BSTToArray();\\n int[] unionArray = new int[thisArray.length + sArray.length];\\n int unionArrayIndex = 0;\\n\\n // add both arrays together\\n for (int i = 0; i < thisArray.length; i++) {\\n unionArray[unionArrayIndex++] = thisArray[i];\\n }\\n\\n for (int i = 0; i < sArray.length; i++) {\\n unionArray[unionArrayIndex++] = sArray[i];\\n }\\n\\n return new BSTSet(unionArray);\\n }\",\n \"@Test\\n public void testSmallSize(){\\n assertEquals(9, smallMaze.size());\\n }\",\n \"public void setUnionRecursive(org.apache.gora.cascading.test.storage.TestRow value) {\\n this.unionRecursive = value;\\n setDirty(3);\\n }\",\n \"public static void main(String[] args)throws Exception {\\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\\r\\n int testCases = Integer.parseInt(br.readLine());\\r\\n //loop through all test cases\\r\\n for(int q = 0; q < testCases; q++){\\r\\n int iterator = 0;\\r\\n //initilize variables\\r\\n size = new ArrayList<Integer>();position = new ArrayList<Integer>();network = new HashMap<String, Integer>();\\r\\n int relationships = Integer.parseInt(br.readLine());\\r\\n //loop through all relationships\\r\\n for(int v = 0; v < relationships; v++){\\r\\n String[] people = br.readLine().split(\\\" \\\");\\r\\n String person1 = people[0]; String person2 = people[1];\\r\\n //add two people to the netword and union their roots\\r\\n if(!network.containsKey(person1)){network.put(person1, iterator); position.add(iterator++); size.add(1);}\\r\\n if(!network.containsKey(person2)){network.put(person2, iterator); position.add(iterator++); size.add(1);}\\r\\n union(person1,person2);\\r\\n //print output\\r\\n System.out.println(size.get(find(person1)));\\r\\n }\\r\\n }\\r\\n }\",\n \"public void open(int row, int col) {\\n\\t\\tif (!isOpen(row, col)) {\\n\\t\\t\\tgrid[row - 1][col - 1] = true;\\n\\t\\t\\topenCount++;\\n\\t\\t}\\n\\t\\tint indexInUF = getUnionIndex(row, col);\\n\\n\\t\\t// left neighbor\\n\\t\\tunionIfOpen(indexInUF, row, col - 1);\\n\\n\\t\\t// right neighbor\\n\\t\\tunionIfOpen(indexInUF, row, col + 1);\\n\\n\\t\\t// top neighbor\\n\\t\\tunionIfOpen(indexInUF, row + 1, col);\\n\\n\\t\\t// bottom neighbor\\n\\t\\tunionIfOpen(indexInUF, row - 1, col);\\n\\n\\t\\tif (row == 1) {\\n\\t\\t\\t// union to virtual top index\\n\\t\\t\\tuf.union(0, indexInUF);\\n\\t\\t}\\n\\n\\t\\tif (row == size) {\\n\\t\\t\\t// union to virtual bottom index\\n\\t\\t\\tuf.union(size * size + 1, indexInUF);\\n\\t\\t}\\n\\t}\",\n \"@Test\\n public void testUnionOnSchemaInputUdfs() throws Exception {\\n PigServer pig = new PigServer(Util.getLocalTestMode());\\n String query =\\n \\\" l1 = load '\\\" + INP_FILE_2NUMS + \\\"' as (i : int, j : chararray);\\\"\\n + \\\"l2 = load '\\\" + INP_FILE_2NUMS + \\\"' as (i : int, j : chararray);\\\"\\n + \\\"f1 = foreach l1 generate i, CONCAT(j,j) as cj, \\\" +\\n \\t\\t\\\"org.apache.pig.test.TestUnionOnSchema\\\\\\\\$UDFTupleNullSchema(i,j) as uo;\\\"\\n + \\\"u = union onschema f1, l2;\\\"\\n ; \\n Util.registerMultiLineQuery(pig, query);\\n\\n Schema sch = pig.dumpSchema(\\\"u\\\");\\n String expectedSch = \\\"{i: int,cj: chararray,uo: (),j: chararray}\\\";\\n Assert.assertTrue( expectedSch.equals( sch.toString() ) );\\n \\n\\n Iterator<Tuple> it = pig.openIterator(\\\"u\\\");\\n List<Tuple> expectedRes = \\n Util.getTuplesFromConstantTupleStrings(\\n new String[] {\\n \\\"(1,null,null,'2')\\\",\\n \\\"(5,null,null,'3')\\\",\\n \\\"(1,'22',(1,'2'),null)\\\",\\n \\\"(5,'33',(5,'3'),null)\\\"\\n });\\n Util.checkQueryOutputsAfterSort(it, expectedRes);\\n\\n }\",\n \"BUnion createBUnion();\",\n \"QuickUnionUF(int n) {\\n count = n;\\n id = new int[n];\\n for (int i = 0; i < id.length; i++) { id[i] = i; }\\n }\",\n \"private static int multAndDivFixer(int size){\\n return size;\\n }\",\n \"public void generateSolution() {\\n if (this.stateOfTheMaze != 1)\\n throw new IllegalArgumentException(\\\"To generate the maze the state of it must be \\\\\\\"generated maze\\\\\\\".\\\");\\n Queue<Box> queue = new LinkedList<>();\\n queue.add(this.startBox);\\n boolean notFinished = true;\\n while (notFinished) {\\n Box aux = queue.peek();\\n LinkedList<Box> movements = movementWithWalls(aux);\\n movements.remove(aux.getPrevious());\\n for (Box box : movements) {\\n box.setPrevious(aux);\\n queue.add(box);\\n if (box.equals(this.endBox))\\n notFinished = false;\\n }\\n queue.remove();\\n }\\n Box anotherAux = this.endBox;\\n while (!anotherAux.equals(this.startBox)) {\\n anotherAux.setAsSolution();\\n anotherAux = anotherAux.getPrevious();\\n }\\n this.stateOfTheMaze++;\\n }\",\n \"public CreateUnionResponse createUnion(CreateUnionRequest request) throws GPUdbException {\\n CreateUnionResponse actualResponse_ = new CreateUnionResponse();\\n submitRequest(\\\"/create/union\\\", request, actualResponse_, false);\\n return actualResponse_;\\n }\",\n \"@Test\\n public void testUnionOnSchemaCastOnByteArray() throws Exception {\\n PigServer pig = new PigServer(Util.getLocalTestMode());\\n String query =\\n \\\" l1 = load '\\\" + INP_FILE_2NUMS + \\\"' as (i, j);\\\"\\n + \\\" f1 = foreach l1 generate (int)i, (int)j;\\\"\\n + \\\"u = union onschema f1, l1;\\\"\\n ; \\n Util.registerMultiLineQuery(pig, query);\\n Iterator<Tuple> it = pig.openIterator(\\\"u\\\");\\n \\n List<Tuple> expectedRes = \\n Util.getTuplesFromConstantTupleStrings(\\n new String[] {\\n \\\"(1,2)\\\",\\n \\\"(5,3)\\\",\\n \\\"(1,2)\\\",\\n \\\"(5,3)\\\"\\n });\\n Util.checkQueryOutputsAfterSort(it, expectedRes);\\n\\n }\",\n \"public int[][] mergeaarray(int array[][],int ootable[][],int aatable[][],int aotable[][]) {\\r\\n\\t\\t\\t\\t\\tint mergetable[][]=new int[ootable.length+aatable.length][ootable.length+aatable.length];\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t//Adding object-object table to Union array \\r\\n\\t\\t\\t\\t\\t\\t\\tfor(int m=0;m<ootable.length;m++)\\r\\n\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tfor(int n=0;n<ootable[0].length;n++)\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tmergetable[m][n]=ootable[m][n];\\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\\t\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t//Adding object-attribute table to Union array\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tfor(int m=0;m<array.length;m++) \\r\\n\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tfor(int n=0;n<array[0].length;n++)\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tmergetable[m][ootable.length+n]=array[m][n];\\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//Adding attribute-object table to Union array\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tfor(int m=0;m<aotable.length;m++) \\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tfor(int n=0;n<aotable[0].length;n++)\\r\\n\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\tmergetable[m+ootable.length][n]=aotable[m][n];\\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//Adding attribute-attribute table to Union array\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tfor(int m=0;m<aatable.length;m++) \\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tfor(int n=0;n<aatable[0].length;n++)\\r\\n\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\tmergetable[m+ootable.length][n+ootable.length]=aatable[m][n];\\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//Printing the elements of Union of four Arrays table to the screen\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"=======================================================================\\\");\\r\\n\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"UNION TABLE:\\\");\\r\\n\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"=======================================================================\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tfor(int row=0;row<mergetable.length;row++)\\r\\n\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\tfor(int column=0;column<mergetable[0].length;column++)\\r\\n\\t\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tSystem.out.print(mergetable[row][column]+\\\"\\\\t\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\tSystem.out.println();\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\treturn mergetable;\\r\\n\\t\\t\\t\\t\\t}\",\n \"public void setSize(int size){\\n\\t\\tthis.shipSize = size;\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.6923121","0.6593776","0.61599267","0.57513195","0.5525592","0.55057245","0.524896","0.52193594","0.5195437","0.51842284","0.50932485","0.4971272","0.4970212","0.49615133","0.49513724","0.49147213","0.48749945","0.4874752","0.48489788","0.48313853","0.4827947","0.4819114","0.48143873","0.48083428","0.4783694","0.47766876","0.47634947","0.47511166","0.47372815","0.47360802","0.47337073","0.47297364","0.47237673","0.47189784","0.47148004","0.47120824","0.4695309","0.46923992","0.46714592","0.46667337","0.46140513","0.46118793","0.46093225","0.45895016","0.45864305","0.45858225","0.45750225","0.45512128","0.45416167","0.4540631","0.45332494","0.4529169","0.45268208","0.4525578","0.45058912","0.45032993","0.44887716","0.44779533","0.44752377","0.44722086","0.44671097","0.44569013","0.4439463","0.44310936","0.4430511","0.442384","0.44139773","0.44060087","0.44051704","0.43945137","0.4390468","0.43903628","0.43899268","0.43869817","0.43860263","0.4382251","0.43751928","0.43708038","0.43705824","0.43703055","0.43643564","0.43626028","0.4361375","0.4360967","0.43487626","0.43459296","0.43459195","0.43331724","0.43117696","0.43045843","0.42946663","0.42941746","0.4291021","0.4283384","0.42833474","0.42778525","0.42773983","0.4274859","0.42639634","0.42632097"],"string":"[\n \"0.6923121\",\n \"0.6593776\",\n \"0.61599267\",\n \"0.57513195\",\n \"0.5525592\",\n \"0.55057245\",\n \"0.524896\",\n \"0.52193594\",\n \"0.5195437\",\n \"0.51842284\",\n \"0.50932485\",\n \"0.4971272\",\n \"0.4970212\",\n \"0.49615133\",\n \"0.49513724\",\n \"0.49147213\",\n \"0.48749945\",\n \"0.4874752\",\n \"0.48489788\",\n \"0.48313853\",\n \"0.4827947\",\n \"0.4819114\",\n \"0.48143873\",\n \"0.48083428\",\n \"0.4783694\",\n \"0.47766876\",\n \"0.47634947\",\n \"0.47511166\",\n \"0.47372815\",\n \"0.47360802\",\n \"0.47337073\",\n \"0.47297364\",\n \"0.47237673\",\n \"0.47189784\",\n \"0.47148004\",\n \"0.47120824\",\n \"0.4695309\",\n \"0.46923992\",\n \"0.46714592\",\n \"0.46667337\",\n \"0.46140513\",\n \"0.46118793\",\n \"0.46093225\",\n \"0.45895016\",\n \"0.45864305\",\n \"0.45858225\",\n \"0.45750225\",\n \"0.45512128\",\n \"0.45416167\",\n \"0.4540631\",\n \"0.45332494\",\n \"0.4529169\",\n \"0.45268208\",\n \"0.4525578\",\n \"0.45058912\",\n \"0.45032993\",\n \"0.44887716\",\n \"0.44779533\",\n \"0.44752377\",\n \"0.44722086\",\n \"0.44671097\",\n \"0.44569013\",\n \"0.4439463\",\n \"0.44310936\",\n \"0.4430511\",\n \"0.442384\",\n \"0.44139773\",\n \"0.44060087\",\n \"0.44051704\",\n \"0.43945137\",\n \"0.4390468\",\n \"0.43903628\",\n \"0.43899268\",\n \"0.43869817\",\n \"0.43860263\",\n \"0.4382251\",\n \"0.43751928\",\n \"0.43708038\",\n \"0.43705824\",\n \"0.43703055\",\n \"0.43643564\",\n \"0.43626028\",\n \"0.4361375\",\n \"0.4360967\",\n \"0.43487626\",\n \"0.43459296\",\n \"0.43459195\",\n \"0.43331724\",\n \"0.43117696\",\n \"0.43045843\",\n \"0.42946663\",\n \"0.42941746\",\n \"0.4291021\",\n \"0.4283384\",\n \"0.42833474\",\n \"0.42778525\",\n \"0.42773983\",\n \"0.4274859\",\n \"0.42639634\",\n \"0.42632097\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.6171462"},"document_rank":{"kind":"string","value":"2"}}},{"rowIdx":38181,"cells":{"query":{"kind":"string","value":"METHOD 5: UnionBySize w/ Path Compression This method runs unionbysize, using path compression to solve the maze. This is of type nonreturn."},"document":{"kind":"string","value":"public static void sizePathCompression(){\n\t\tint n = 10;\t\n\n\t\tdsf S = new dsf(n*n);\n\t\tMaze five = new Maze(n);\n\n\t\tRandom random;\n\t\tint sets = n*n;\t//number of sets in the DSF\n\t\tint randomNumber;\n\t\tint randomDirection;\n\t\tint row;\n\t\tint col;\n\n\t\tchar upperRight; \t//bottom or right\n\n\t\tS.print();\n\n\t\twhile(sets > 1){\n\t\t\trandom = new Random();\n\t\t\trandomNumber = random.nextInt((n*n) - 1);\n\t\t\t//System.out.println(\"RANDOM NUMBER: \"+randomNumber);\n\t\t\trow = randomNumber /n;\t//SWITCHED\n\t\t\tcol = randomNumber %n;\t//SWITCHED\n\t\t\trandomDirection = random.nextInt(2);\n\t\t\tString direct;\n\t\t\tif(randomDirection == 0)\n\t\t\t\tdirect = \"upper\";\n\t\t\telse\n\t\t\t\tdirect = \"right\";\n\t\t\t//System.out.println(\"RANDOM DIRECTI0N: \"+direct);\n\t\t\tupperRight = five.direction(randomDirection);\n\n\t\t\tif(upperRight == 'u'){\n\t\t\t\tif((randomNumber) < ((n*n)-n)){\n\t\t\t\t\tSystem.out.println(\"Sets: \"+sets);\n\t\t\t\t\tif(S.findAndCompress(randomNumber) != S.findAndCompress(randomNumber + n)){\n\t\t\t\t\t\tS.unionBySize(randomNumber+n, randomNumber);\n\t\t\t\t\t\tfive.remove_wall(col, row, 'u');\n\t\t\t\t\t\t//S.print();\n\t\t\t\t\t\tsets--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(upperRight == 'r'){\n\t\t\t\tif(((randomNumber)%(n*n)) != n-1){\n\t\t\t\t\tif(S.findAndCompress(randomNumber) != S.findAndCompress(randomNumber+1)){\n\t\t\t\t\t\tS.unionBySize(randomNumber, randomNumber+1);\n\t\t\t\t\t\tfive.remove_wall(col, row, 'r');\n\t\t\t\t\t\tS.print();\n\t\t\t\t\t\tsets--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tbuildAdjacencyList(five, n);\n\t\tuserSelection_SolveMaze(n);\n\n\t\tStdDraw.show(0);\n\t\tfive.draw();\n\t\tfive.printCellNumbers();\t\n\t}"},"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 static void unionPathCompression(){\n\t\tint n = 10;\t\n\n\t\tdsf S = new dsf(n*n);\n\t\tMaze two = new Maze(n);\n\n\t\tRandom random;\n\t\tint sets = n*n;\t//number of sets in the DSF\n\t\tint randomNumber;\n\t\tint randomDirection;\n\t\tint row;\n\t\tint col;\n\n\t\tchar upperRight; \t//bottom or right\n\n\t\tS.print();\n\n\t\twhile(sets > 1){\n\t\t\trandom = new Random();\n\t\t\trandomNumber = random.nextInt((n*n) - 1);\n\t\t\t//System.out.println(\"RANDOM NUMBER: \"+randomNumber);\n\t\t\trow = randomNumber /n;\t//SWITCHED\n\t\t\tcol = randomNumber %n;\t//SWITCHED\n\t\t\trandomDirection = random.nextInt(2);\n\t\t\tString direct;\n\t\t\tif(randomDirection == 0)\n\t\t\t\tdirect = \"upper\";\n\t\t\telse\n\t\t\t\tdirect = \"right\";\n\t\t\tSystem.out.println(\"RANDOM DIRECTI0N: \"+direct);\n\t\t\tupperRight = two.direction(randomDirection);\n\n\t\t\tif(upperRight == 'u'){\n\t\t\t\tif((randomNumber) < ((n*n)-n)){\n\t\t\t\t\tSystem.out.println(\"Sets: \"+sets);\n\t\t\t\t\tif(S.findAndCompress(randomNumber+n) != S.findAndCompress(randomNumber)){\n\t\t\t\t\t\tS.union(randomNumber+n, randomNumber);\n\t\t\t\t\t\ttwo.remove_wall(col, row, 'u');\n\t\t\t\t\t\tS.print();\n\t\t\t\t\t\tsets--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(upperRight == 'r'){\n\t\t\t\tif(((randomNumber)%(n*n)) != n-1){\n\t\t\t\t\tif(S.findAndCompress(randomNumber) != S.findAndCompress(randomNumber+1)){\n\t\t\t\t\t\tS.union(randomNumber, randomNumber+1);\n\t\t\t\t\t\ttwo.remove_wall(col, row, 'r');\n\t\t\t\t\t\tS.print();\n\t\t\t\t\t\tsets--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tbuildAdjacencyList(two, n);\n\t\tuserSelection_SolveMaze(n);\n\n\n\t\tStdDraw.show(0);\n\t\ttwo.draw();\n\t\ttwo.printCellNumbers();\n\t}","public static void mazeUnion(){\n\n\t\tint n = 10;\t\n\n\t\tdsf S = new dsf(n*n);\n\t\tMaze one = new Maze(n);\n\n\t\tRandom random;\n\t\tint sets = n*n;\t//number of sets in the DSF\n\t\tint randomNumber;\n\t\tint randomDirection;\n\t\tint row;\n\t\tint col;\n\n\t\tchar upperRight; \t//bottom or right\n\n\t\tS.print();\n\n\t\twhile(sets > 1){\n\t\t\trandom = new Random();\n\t\t\trandomNumber = random.nextInt((n*n) - 1);\n\t\t\tSystem.out.println(\"RANDOM NUMBER: \"+randomNumber);\n\t\t\trow = randomNumber /n;\t//SWITCHED\n\t\t\tcol = randomNumber %n;\t//SWITCHED\n\t\t\trandomDirection = random.nextInt(2);\n\t\t\tString direct;\n\t\t\tif(randomDirection == 0)\n\t\t\t\tdirect = \"upper\";\n\t\t\telse\n\t\t\t\tdirect = \"right\";\n\t\t\tSystem.out.println(\"RANDOM DIRECTI0N: \"+direct);\n\t\t\tupperRight = one.direction(randomDirection);\n\n\t\t\tif(upperRight == 'u'){\n\t\t\t\tif((randomNumber) < ((n*n)-n)){\n\t\t\t\t\tSystem.out.println(\"Sets: \"+sets);\n\t\t\t\t\tif(S.find(randomNumber+n) != S.find(randomNumber)){\n\t\t\t\t\t\tS.union(randomNumber+n, randomNumber);\n\t\t\t\t\t\tone.remove_wall(col, row, 'u');\n\t\t\t\t\t\tS.print();\n\t\t\t\t\t\tsets--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(upperRight == 'r'){\n\t\t\t\tif(((randomNumber)%(n*n)) != n-1){\n\t\t\t\t\tif(S.findAndCompress(randomNumber) != S.findAndCompress(randomNumber+1)){\n\t\t\t\t\t\tS.union(randomNumber, randomNumber+1);\n\t\t\t\t\t\tone.remove_wall(col, row, 'r');\n\t\t\t\t\t\t//S.print();\n\t\t\t\t\t\tsets--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tStdDraw.show(0);\n\t\tone.draw();\n\t\tone.printCellNumbers();\n\t\t\n\t\tbuildAdjacencyList(one, n);\n\t\tuserSelection_SolveMaze(n);\n\n\t}","public static void mazeSize(){\n\t\tint n = 10;\t\n\n\t\tdsf S = new dsf(n*n);\n\t\tMaze four = new Maze(n);\n\n\t\tRandom random;\n\t\tint sets = n*n;\t//number of sets in the DSF\n\t\tint randomNumber;\n\t\tint randomDirection;\n\t\tint row;\n\t\tint col;\n\n\t\tchar upperRight; \t//bottom or right\n\n\t\tS.print();\n\n\t\twhile(sets > 1){\n\t\t\trandom = new Random();\n\t\t\trandomNumber = random.nextInt((n*n) - 1);\n\t\t\t//System.out.println(\"RANDOM NUMBER: \"+randomNumber);\n\t\t\trow = randomNumber /n;\t//SWITCHED\n\t\t\tcol = randomNumber %n;\t//SWITCHED\n\t\t\trandomDirection = random.nextInt(2);\n\t\t\tString direct = null;\n\t\t\tif(randomDirection == 0)\n\t\t\t\tdirect = \"upper\";\n\t\t\tif(randomDirection == 1)\n\t\t\t\tdirect = \"right\";\n\t\t\t//System.out.println(\"RANDOM DIRECTI0N: \"+direct);\n\t\t\tupperRight = four.direction(randomDirection);\n\n\t\t\tif(upperRight == 'u'){\n\t\t\t\tif((randomNumber) < ((n*n)-n)){\n\t\t\t\t\t//System.out.println(\"Sets: \"+sets);\n\t\t\t\t\tif(S.find(randomNumber) != S.find(randomNumber + n)){\n\t\t\t\t\t\tS.unionBySize(randomNumber, randomNumber+n);\n\t\t\t\t\t\tfour.remove_wall(col, row, 'u');\n\t\t\t\t\t\t//S.print();\n\t\t\t\t\t\tsets--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(upperRight == 'r'){\n\t\t\t\tif(((randomNumber)%(n*n)) != n-1){\n\t\t\t\t\tif(S.find(randomNumber) != S.find(randomNumber+1)){\n\t\t\t\t\t\tS.unionBySize(randomNumber, randomNumber+1);\n\t\t\t\t\t\tfour.remove_wall(col, row, 'r');\n\t\t\t\t\t\t//S.print();\n\t\t\t\t\t\tsets--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tbuildAdjacencyList(four, n);\n\t\tuserSelection_SolveMaze(n);\n\n\n\t\tStdDraw.show(0);\n\t\tfour.draw();\n\t\tfour.printCellNumbers();\t\n\t}","public void union(int i, int j) {\n\tint p = findRoot(i);\n\tint q = findRoot(j);\n\t\n\tif (p == q) return;\n\t\n\tif (size[p] < size[q]) { //pick the smallest tree and append it to the bigger tree\n\t root[p] = q;\n\t size[p] += size[q];\n\t} else {\n\t root[q] = p;\n\t size[q] += size[p];\n\t}\n }","@Test\n\tpublic void testUnion5() {\n\n\t\tint[] arr = {};\n\t\tSLLSet listObj2 = new SLLSet(arr);\n\t\tint[] uni2 = { 0, 2, 3 };\n\t\tSLLSet listObj7 = new SLLSet(uni2);\n\t\tSLLSet listObj8 = listObj2.union(listObj7);\n\n\t\tString expected = \"0, 2, 3\";\n\t\tint expectedSize = 3;\n\n\t\tassertEquals(expectedSize, listObj8.getSize());\n\t\tassertEquals(expected, listObj8.toString());\n\n\t}","public void union(int p, int q)\n {\n int i = root(p);\n int j = root(q);\n if ( i == j ) return;\n \n if ( sz[i] < sz[j] ) { \n // i is no longer a root, so we don't need to update the size\n id[i] = j; sz[j] += sz[i];\n }\n else {\n id[j] = i; sz[i] += sz[j]; \n } \n }","public void showMazeSize(int size);","public void union(int p, int q)\n {\n int i = this.root(p);\n int j = this.root(q);\n if (i == j) return;\n\n if (this.size[i] < this.size[j])\n {\n this.parent[i] = j;\n this.size[j] += this.size[i];\n }\n else\n {\n this.parent[j] = i;\n this.size[i] += this.size[j];\n }\n }","void union(int x,int y){\n int xRoot=find(x),yRoot=find(y);\n if(xRoot==yRoot)return;\n if(rank[xRoot]<rank[yRoot])\n parent[xRoot]=yRoot;\n else if(rank[xRoot]>rank[yRoot])\n parent[yRoot]=xRoot;\n else{\n parent[yRoot]=xRoot;\n rank[xRoot]=rank[xRoot]+1;\n }\n --totalSets;\n }","protected void compress(){\r\n\t\t\r\n \tmodCount++;\r\n\t\tArrayNode<T> current = beginMarker.next;\r\n\t\t\r\n\t\t//find non-full node\r\n\t\twhile (current != endMarker){\r\n\t\t\tif (current.getLength()== current.getArraySize()){\r\n\t\t\t\tcurrent = current.next;\r\n\t\t\t}\r\n\t\t\telse{\r\n\t\t\t\tArrayNode<T> removing = current.next;\r\n\t\t\t\t//compression done\r\n\t\t\t\tif (removing==endMarker){\r\n\t\t\t\t\t//remove empty nodes\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t\t//empty node\r\n\t\t\t\twhile (removing.getArraySize()==0){\r\n\t\t\t\t\tremoving = removing.next;\r\n\t\t\t\t\tif (removing==endMarker)\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t\t//not sure why this is needed\r\n\t\t\t\tif (removing==endMarker){\r\n\t\t\t\t\t//remove empty nodes\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t\t//move elements from \"removing\" node to \"current\"\r\n\t\t\t\tT temp = removing.removeFirst();\r\n\t\t\t\tcurrent.insertSorted(temp);\r\n\t\t\t\t\r\n\t\t\t\t//check current length, go to next if full, otherwise redo loop\r\n\t\t\t\tif (current.getLength()==current.getArraySize()){\r\n\t\t\t\t\tcurrent = current.next;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\t//do another sweep at end to remove empty nodes\r\n\t\tcurrent = beginMarker.next;\r\n\t\twhile (current != endMarker){\r\n\t\t\tif (current.getArraySize()==0){\r\n\t\t\t\tcurrent.prev.next = current.next;\r\n\t\t\t\tcurrent.next.prev = current.prev;\r\n\t\t\t\tcurrent = current.next;\r\n\t\t\t\tsize--;\r\n\t\t\t}\r\n\t\t\telse{\r\n\t\t\t\tcurrent = current.next;\r\n\t\t\t}\r\n\t\t}\r\n\t}","public int union(int u, int v) {\n int p1 = find(u), p2 = find(v);\n if (p1 == p2) {\n return p1;\n }\n int s1 = _sizes[p1], s2 = _sizes[p2];\n if (s1 > s2) {\n _sizes[p1] += s2;\n// int i = 1;\n// while (s2 > 0) {\n// if (_parents[i] == p2) {\n// _parents[i] = p1;\n// s2 -= 1;\n// }\n// i += 1;\n// }\n _parents[p2] = p1;\n return s1;\n } else {\n _sizes[p2] += s1;\n// int j = 1;\n// while (s1 > 0) {\n// if (_parents[j] == p1) {\n// _parents[j] = p2;\n// s1 -= 1;\n// }\n// j += 1;\n// }\n _parents[p1] = p2;\n return s2;\n }\n }","public void union(int p, int q){\r\n\t\tint rootP = root(p);\r\n\t\tint rootQ = root(q);\r\n\t\t\r\n\t\tif(rootP == rootQ) return;\r\n\t\t// Calculate height of tree and then link the root of smaller tree to root of larger tree\r\n\t\t\r\n\t\tif(size[rootP] < size[rootQ]) {\r\n\t\t\tid[rootP] = rootQ;\r\n\t\t\tsize[rootQ] = size[rootQ] + size[rootP];\r\n\t\t}\r\n\t\telse {\r\n\t\t\tid[rootQ] = rootP;\r\n\t\t\tsize[rootP] = size[rootQ] + size[rootP];\r\n\t\t}\r\n\t}","public long generatePaths(int size) {\n return (MoreMath.factorial(2*size).divide((\n MoreMath.factorial(size).multiply(MoreMath.factorial(2*size - size))))).longValue();\n }","public ArrayList<Integer> path2Dest(int s, int t, int k, int method){\n double INFINITY = Double.MAX_VALUE;\n boolean[] SPT = new boolean[intersection];\n double[] d = new double[intersection];\n int[] parent = new int[intersection];\n\n for (int i = 0; i <intersection ; i++) {\n d[i] = INFINITY;\n parent[i] = -1;\n }\n d[s] = 0;\n\n MinHeap minHeap = new MinHeap(k);\n for (int i = 0; i <intersection ; i++) {\n minHeap.add(i,d[i]);\n }\n while(!minHeap.isEmpty()){\n int extractedVertex = minHeap.extractMin();\n\n if(extractedVertex==t) {\n break;\n }\n SPT[extractedVertex] = true;\n\n LinkedList<Edge> list = g.adjacencylist[extractedVertex];\n for (int i = 0; i <list.size() ; i++) {\n Edge edge = list.get(i);\n int destination = edge.destination;\n if(SPT[destination]==false ) {\n double newKey =0;\n double currentKey=0;\n if(method==1) { //method 1\n newKey = d[extractedVertex] + edge.weight;\n currentKey = d[destination];\n }\n else{ //method 2\n newKey = d[extractedVertex] + edge.weight + coor[destination].distTo(coor[t])-coor[extractedVertex].distTo(coor[t]);\n currentKey = d[destination];\n }\n if(currentKey>=newKey){\n if(currentKey==newKey){ //if equal need to compare the value of key\n if(extractedVertex<parent[destination]){\n minHeap.updateKey(newKey, destination, d[destination]);\n parent[destination] = extractedVertex;\n d[destination] = newKey;\n }\n }\n else {\n minHeap.updateKey(newKey, destination, d[destination]);\n parent[destination] = extractedVertex;\n d[destination] = newKey;\n }\n }\n }\n }\n }\n //trace back the path using parent properties\n ArrayList<Integer> path = new ArrayList<>();\n if(parent[t]!=-1){\n path.add(t);\n while(parent[t]!= s) {\n path.add(0,parent[t]);\n t = parent[t];\n }\n path.add(0,s);\n }\n else\n path = null;\n return path;\n }","public void union(int p, int q) {\n\t\tint i = root(p);\n\t\tint j = root(q);\n//\t\tid[i] = j; instead of this do below improvement\n\t\tif (sz[i] < sz[j]) {\n\t\t\tid[i] = j;\n\t\t\tsz[j] += sz[i];\n\t\t} else {\n\t\t\tid[j] = i;\n\t\t\tsz[i] += sz[j];\n\t\t}\n\t}","List<CompressResult> compress(Path input, Path output, int maxSizeInMB) throws IOException;","public void union(Shape s);","int[] union(int s1,int t1,int s2,int t2)\r\n\t{\r\n\t\tint [] st=new int[2];\r\n\t\t//Please fill in the program here\r\n\t\tst[0] = incCapacity();\r\n\t\taddEdge(st[0], epssymbol, s1);\r\n\t\taddEdge(st[0], epssymbol, s2);\r\n\t\tst[1] = incCapacity();\r\n\t\taddEdge(t1, epssymbol, st[1]);\r\n\t\taddEdge(t2, epssymbol, st[1]);\r\n\r\n\t\treturn st;\r\n\t}","public static void QTdeletionMinimization (Graph<Integer,String> g, int currentSize) {\n\t\t\r\n\t\tboolean existsP4orC4 = false;\r\n\t\t\r\n\t\t//int temp = QTDelHeuristic1(Copy(g));\r\n\t\t//System.out.print(\"n = \"+g.getVertexCount()+\" m=\"+g.getEdgeCount()+\" hVal = \"+temp +\"\\n\");\r\n\t\tif (currentSize >= minSoFar) return; \r\n\t\tIterator<Integer> a = g.getVertices().iterator();\r\n\t\tIterator<Integer> b;\r\n\t\tIterator<Integer> c;\r\n\t\tIterator<Integer> d;\r\n\t\twhile(a.hasNext()){\r\n\t\t\tInteger A = a.next();\r\n\t\t\t//System.out.print(\"\"+A+\" \");\r\n\t\t\tb = g.getNeighbors(A).iterator();\r\n\t\t\twhile(b.hasNext()){\r\n\t\t\t\tInteger B = b.next();\r\n\t\t\t\tc = g.getNeighbors(B).iterator();\r\n\t\t\t\twhile (c.hasNext()){\r\n\t\t\t\t\tInteger C = c.next();\r\n\t\t\t\t\tif (g.isNeighbor(C, A) || C==A) continue;\r\n\t\t\t\t\td = g.getNeighbors(C).iterator();\r\n\t\t\t\t\twhile (d.hasNext()){\r\n\t\t\t\t\t\tInteger D = d.next();\r\n\t\t\t\t\t\tif (D==B) continue; \r\n\t\t\t\t\t\tif (g.isNeighbor(D,B)) continue;\r\n\t\t\t\t\t\t//otherwise, we have a P4 or a C4\r\n\r\n\t\t\t\t\t\texistsP4orC4 = true;\r\n\t\t\t\t\t\tif (currentSize + 1 >= minSoFar) return;\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t//System.out.print(\"Found P4: \"+A+\"-\"+B+\"-\"+C+\"-\"+D+\"... not a cograph\\n\");\r\n\t\t\t\t\t\tif (g.isNeighbor(D,A)) {\r\n\t\t\t\t\t\t\t// we have a C4 = a-b-c-d-a\r\n\t\t\t\t\t\t\t// delete any two edges\r\n\t\t\t\t\t\t\tif (currentSize + 2 >= minSoFar) return;\r\n\r\n\t\t\t\t\t\t\tg.removeEdge(g.findEdge(A, B));\r\n\r\n\t\t\t\t\t\t\tg.removeEdge(g.findEdge(B, C));\r\n\t\t\t\t\t\t\tQTdeletionMinimization(g,2+currentSize);\r\n\t\t\t\t\t\t\tg.addEdge(\"mar-\"+B+\"-\"+C, B,C);\r\n\r\n\t\t\t\t\t\t\tg.removeEdge(g.findEdge(C, D));\r\n\t\t\t\t\t\t\tQTdeletionMinimization(g,2+currentSize);\r\n\t\t\t\t\t\t\tg.addEdge(\"mar-\"+C+\"-\"+D, C,D);\r\n\r\n\r\n\t\t\t\t\t\t\tg.removeEdge(g.findEdge(D, A));\r\n\t\t\t\t\t\t\tQTdeletionMinimization(g,2+currentSize);\r\n\t\t\t\t\t\t\t//g.addEdge(\"mar-\"+A+\"-\"+D, A,D);\r\n\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tg.addEdge(\"mar-\"+A+\"-\"+B, A,B);\r\n\t\t\t\t\t\t\t// all cases with AB deleted are done. AD is STILL deleted\r\n\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tg.removeEdge(g.findEdge(B, C));\r\n\t\t\t\t\t\t\tQTdeletionMinimization(g,2+currentSize);\r\n\t\t\t\t\t\t\tg.addEdge(\"mar-\"+B+\"-\"+C, B,C);\r\n\r\n\t\t\t\t\t\t\tg.removeEdge(g.findEdge(C, D));\r\n\t\t\t\t\t\t\tQTdeletionMinimization(g,2+currentSize);\r\n\r\n\t\t\t\t\t\t\t// all cases with AB deleted or AD deleted are done\r\n\t\t\t\t\t\t\t// at this point, CD and AD are still deleted\r\n\t\t\t\t\t\t\t// only need to try BC and CD together deleted.\r\n\t\t\t\t\t\t\tg.addEdge(\"mar-\"+A+\"-\"+D, A,D);\r\n\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tg.removeEdge(g.findEdge(B, C));\r\n\t\t\t\t\t\t\tQTdeletionMinimization(g,2+currentSize);\r\n\r\n\t\t\t\t\t\t\tg.addEdge(\"mar-\"+B+\"-\"+C, B,C);\r\n\t\t\t\t\t\t\tg.addEdge(\"mar-\"+C+\"-\"+D, C,D);\r\n\t\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\r\n\t\t\t\t\t\telse {\r\n\t\t\t\t\t\t\t// this case says:\r\n\t\t\t\t\t\t\t// else D is NOT adjacent to A. Then we have P4=abcd\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tint choice = randomInt(1,4);\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tif (choice == 1) {\r\n\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(A, B));\r\n\t\t\t\t\t\t\t\tQTdeletionMinimization(g,1+currentSize);\r\n\t\t\t\t\t\t\t\tg.addEdge(\"mar-\"+A+\"-\"+B, A,B);\r\n\t\t\t\t\t\t\t}\t\t\t\t\t\r\n\r\n\t\t\t\t\t\t\telse if (choice == 2) {\r\n\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(C, D));\r\n\t\t\t\t\t\t\t\tQTdeletionMinimization(g,1+currentSize);\r\n\t\t\t\t\t\t\t\tg.addEdge(\"mar-\"+C+\"-\"+D, C,D);\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\telse {\r\n\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(B, C));\r\n\t\t\t\t\t\t\t\tQTdeletionMinimization(g,1+currentSize);\r\n\t\t\t\t\t\t\t\tg.addEdge(\"mar-\"+B+\"-\"+C, B,C);\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\tif (existsP4orC4==true) {\r\n\t\t\t\t\t\t\t// it found an obstruction and branched on all its ways.\r\n\t\t\t\t\t\t\t// No need to deal with this graph further.\r\n\t\t\t\t\t\t\treturn;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t} // end d.hasNext()\r\n\t\t\t\t} // end c.hasNext()\r\n\t\t\t} // end b.hasNext() \r\n\t\t} // end a.hasNext()\r\n\r\n\t\t// if we reached here, no P4 was found\r\n\t\tif (existsP4orC4 == false) {\r\n\t\t\t// arrived at a quasi-threshold graph since no P4 or C4 was found\r\n\t\t\tSystem.out.print(\"\\n currentSize = \"+currentSize+\" and minSoFar = \"+minSoFar+\"\\n\");\r\n\t\t\tSystem.out.print(\"Modified graph has \"+g.getEdgeCount()+\" edges and is:\\n\");\r\n\t\t\tminSoFar = currentSize;\r\n\t\t\tSystem.out.print(\"\"+g+\"\\n\");\r\n\t\t\tNewTools.printToFile(currentSize,g,null,\"QTDel.txt\");\r\n\t\t\t//NewTools.DrawIt(g);\r\n\t\t\t//PleaseWait(60000); // one minute\r\n\t\t\treturn;\r\n\t\t}\r\n\t\t\r\n\t\t// ...\r\n\t\tSystem.out.print(\"Critical Error. No P_4 or C_4 found in a non-quasi-threshold graph.\\n\");\r\n\t\treturn;\r\n\r\n\t\t\r\n\t}","public static void main(String[] args) {\n\t\tStopwatch timer = new Stopwatch();\n\t\t//for(int i = 0; i< 10;i++) {\n\t\t\tIn in = new In(args[0]);\n\t\t\tSizeWeightedQuickUnionVisualizer q = new SizeWeightedQuickUnionVisualizer(in.readInt());\n\t\t\twhile(!in.isEmpty()) {\n\t\t\t\tint m = in.readInt();\n\t\t\t\tint n = in.readInt();\n\t\t\t\tif(q.isConnected(m, n)) continue;\n\t\t\t\tq.union(m, n);\n\t\t\t}\n\t\t//}\n\t\tdouble time = timer.elapsedTime();\n\t\t//System.out.println(\"the average time of 10 trials is : \" + time/10 + \" seconds\");\n\t\t//System.out.println(\"the number of components is \"+ q.count()+\" the number of total array accesses is \"+q.sum + \" the average nodes' depth is: \"+ q.getAvgDepth()+\" time: \"+time+\" seconds\");\n\t}","void Union(subset [] subsets, int x , int y ){ \n\t\tint xroot = find(subsets, x); \n\t int yroot = find(subsets, y); \n\t \n\t\tif (subsets[xroot].rank < subsets[yroot].rank) \n\t\t\tsubsets[xroot].parent = yroot; \n\t\telse if (subsets[yroot].rank < subsets[xroot].rank) \n\t\t\tsubsets[yroot].parent = xroot; \n\t\telse{ \n\t\t\tsubsets[xroot].parent = yroot; \n\t\t\tsubsets[yroot].rank++; \n\t\t} \n\t}","public static void union(String a, String b) {\r\n int root1 = find(a);\r\n int root2 = find(b);\r\n if (root1 == root2)return;\r\n if(size.get(root1) < size.get(root2)){size.set(root2, size.get(root2)+size.get(root1)); position.set(root1, root2);}\r\n else {size.set(root1, size.get(root1)+size.get(root2)); position.set(root2, root1);}\r\n }","public void setUnionRecursive(org.apache.gora.cascading.test.storage.TestRow value) {\n this.unionRecursive = value;\n setDirty(3);\n }","public void union(Vertex v1, Vertex v2) {\n\n // find the two vertices' path root\n Vertex r1 = find(v1);\n Vertex r2 = find(v2);\n\n // if the two roots are equal, just return\n if(r1.equals(r2)){\n return;\n } else if(r1.getSize()>r2.getSize()){\n // if the r1 path size is greater than r2\n // just change the vertex 2's root to vertex 1\n r2.setRoot(r1);\n // increment the size of r1 set\n r1.setSize(r2.getSize());\n } else {\n r1.setRoot(r2);\n r2.setSize(r1.getSize());\n }\n \n }","private PriorityQueue<Edge> _getKruskalTree(boolean input)\n{\n PriorityQueue<Edge> completeTree = new PriorityQueue<Edge>();\n for (int loop = 0;\n loop < this.nVerts;\n loop++\n ) {\n for (int innerLoop = 0;\n innerLoop < this.adjMat[loop].length;\n innerLoop++\n ) {\n /*\n * Once we identify a weighted edge, we find its position in the\n * minimum priority queue.\n */\n int edgeDistance = this.adjMat[loop][innerLoop];\n if (INFINITY == edgeDistance) {\n continue;\n }\n completeTree.add(new Edge(loop, innerLoop, edgeDistance));\n }\n }\n if (true == input) {\n return completeTree;\n }\n /*\n * Once we have the queue, we can display the tree and see how much it\n * weighs.\n * Now we make a set of vertices for UnionFind{}. This will help us to find\n * cycles.\n */\n UnionFind union = new UnionFind(this.nVerts);\n PriorityQueue<Edge> output = new PriorityQueue<Edge>();\n while (0 != completeTree.size()) {\n /*\n * We know that the completeTree will include each edge twice, so we can\n * skip the next item. It will be the same edge.\n */\n Edge nextEdge = completeTree.remove();\n if (union.find(nextEdge.srcVert) == union.find(nextEdge.destVert)) {\n continue;\n }\n union.union(nextEdge.srcVert, nextEdge.destVert);\n output.add(nextEdge);\n }\n return output;\n}","public void union(int p, int q) {\n\t\tint i = find(p);\n\t\tint j = find(q);\n\t\tif (i == j)\n\t\t\treturn;\n\t\t\n\t\t// make shorter root point to taller one\n\t\tif (height[i] < height[j]) parent[i] = j;\n\t else if (height[i] > height[j]) parent[j] = i;\n\t else {\n\t \tparent[j] = i;\n\t height[i]++;\n\t }\n\t\tcount--;\n\t}","public int CalcDistance ( )\r\n\t{\r\n\t\tfor ( int i = 0; i<size; i++ )\r\n\t\t{\r\n\t\t\tfor ( int offR = 0; offR <= size/2; offR++ )\r\n\t\t\t{\r\n\t\t\t\tfor ( int c = 0; c <= size/2; c++ )\r\n\t\t\t\t{\r\n\t\t\t\t\tif ( offR == 0 && maze [offR] [c].isOpenUp() )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmaze [offR] [c].setDistanceToExit( 1 );\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse if ( maze [offR] [c].isOpenUp() && maze [offR-1] [c].isOpenDown() )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmaze [offR] [c].setDistanceToExit( \r\n\t\t\t\t\t\t\t\tMath.min( maze [offR-1] [c].getDistanceToExit()+1,\r\n\t\t\t\t\t\t\t\t\t\t maze [offR] [c].getDistanceToExit() ) );\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif ( c == 0 && maze [offR] [c].isOpenLeft() )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmaze [offR] [c].setDistanceToExit( 1 );\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse if ( maze [offR] [c].isOpenLeft() && maze [offR] [c-1].isOpenRight() )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmaze [offR] [c].setDistanceToExit( \r\n\t\t\t\t\t\t\t\tMath.min( maze [offR] [c-1].getDistanceToExit()+1,\r\n\t\t\t\t\t\t\t\t\t\t maze [offR] [c].getDistanceToExit() ) );\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\tfor ( int c = size-1; c >= size/2; c-- )\r\n\t\t\t\t{\r\n\t\t\t\t\tif ( offR == 0 && maze [offR] [c].isOpenUp() )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmaze [offR] [c].setDistanceToExit( 1 );\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse if ( maze [offR] [c].isOpenUp() && maze [offR-1] [c].isOpenDown() )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmaze [offR] [c].setDistanceToExit( \r\n\t\t\t\t\t\t\t\tMath.min( maze [offR-1] [c].getDistanceToExit()+1,\r\n\t\t\t\t\t\t\t\t\t\t maze [offR] [c].getDistanceToExit() ) );\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif ( c == size-1 && maze [offR] [c].isOpenRight() )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmaze [offR] [c].setDistanceToExit( 1 );\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse if ( maze [offR] [c].isOpenRight() && maze [offR] [c+1].isOpenLeft() )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmaze [offR] [c].setDistanceToExit( \r\n\t\t\t\t\t\t\t\tMath.min( maze [offR] [c+1].getDistanceToExit()+1,\r\n\t\t\t\t\t\t\t\t\t\t maze [offR] [c].getDistanceToExit() ) );\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tfor ( int offR = size-1; offR >= size/2; offR-- )\r\n\t\t\t{\r\n\t\t\t\tfor ( int c = 0; c <= size/2; c++ )\r\n\t\t\t\t{\r\n\t\t\t\t\tif ( offR == size-1 && maze [offR] [c].isOpenDown() )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmaze [offR] [c].setDistanceToExit( 1 );\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse if ( maze [offR] [c].isOpenDown() && maze [offR+1] [c].isOpenUp() )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmaze [offR] [c].setDistanceToExit( \r\n\t\t\t\t\t\t\t\tMath.min( maze [offR+1] [c].getDistanceToExit()+1,\r\n\t\t\t\t\t\t\t\t\t\t maze [offR] [c].getDistanceToExit() ) );\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif ( c == 0 && maze [offR] [c].isOpenLeft() )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmaze [offR] [c].setDistanceToExit( 1 );\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse if ( maze [offR] [c].isOpenLeft() && maze [offR] [c-1].isOpenRight() )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmaze [offR] [c].setDistanceToExit( \r\n\t\t\t\t\t\t\t\tMath.min( maze [offR] [c-1].getDistanceToExit()+1,\r\n\t\t\t\t\t\t\t\t\t\t maze [offR] [c].getDistanceToExit() ) );\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\tfor ( int c = size-1; c >= size/2; c-- )\r\n\t\t\t\t{\r\n\t\t\t\t\tif ( offR == size-1 && maze [offR] [c].isOpenDown() )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmaze [offR] [c].setDistanceToExit( 1 );\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse if ( maze [offR] [c].isOpenDown() && maze [offR+1] [c].isOpenUp() )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmaze [offR] [c].setDistanceToExit( \r\n\t\t\t\t\t\t\t\tMath.min( maze [offR+1] [c].getDistanceToExit()+1,\r\n\t\t\t\t\t\t\t\t\t\t maze [offR] [c].getDistanceToExit() ) );\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif ( c == size-1 && maze [offR] [c].isOpenRight() )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmaze [offR] [c].setDistanceToExit( 1 );\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse if ( maze [offR] [c].isOpenRight() && maze [offR] [c+1].isOpenLeft() )\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tmaze [offR] [c].setDistanceToExit( \r\n\t\t\t\t\t\t\t\tMath.min( maze [offR] [c+1].getDistanceToExit()+1,\r\n\t\t\t\t\t\t\t\t\t\t maze [offR] [c].getDistanceToExit() ) );\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\treturn maze [currentRow] [currentCol].getDistanceToExit();\r\n\t}","public void union(int i, int j) {\n\n int root1 = find(i);\n int root2 = find(j);\n\n if (root2 == root1)\n return;\n\n if (_rank[root1] > _rank[root2]) {\n _parent[root2] = root1;\n } else if (_rank[root2] > _rank[root1]) {\n _parent[root1] = root2;\n } else {\n _parent[root2] = root1;\n _rank[root1]++;\n }\n }","public static void QuasiThresholdEditingMinimization (Graph<Integer,String> g, int currentSize, EditSet S){\n\t\t\r\n\t\tboolean existsP4orC4 = false;\r\n\t\tif (currentSize >= minSoFarQTEdit) return; \r\n\t\t\r\n\t\t\r\n\t\tIterator<Integer> a = g.getVertices().iterator();\r\n\t\tIterator<Integer> b;\r\n\t\tIterator<Integer> c;\r\n\t\tIterator<Integer> d;\r\n\t\twhile(a.hasNext()){\r\n\t\t\tInteger A = a.next();\r\n\t\t\t//System.out.print(\"\"+A+\" \");\r\n\t\t\tb = g.getNeighbors(A).iterator();\r\n\t\t\twhile(b.hasNext()){\r\n\t\t\t\tInteger B = b.next();\r\n\t\t\t\tc = g.getNeighbors(B).iterator();\r\n\t\t\t\twhile (c.hasNext()){\r\n\t\t\t\t\tInteger C = c.next();\r\n\t\t\t\t\tif (g.isNeighbor(C, A) || C==A) continue;\r\n\t\t\t\t\td = g.getNeighbors(C).iterator();\r\n\t\t\t\t\twhile (d.hasNext()){\r\n\t\t\t\t\t\tInteger D = d.next();\r\n\t\t\t\t\t\tif (D==B) continue; \r\n\t\t\t\t\t\tif (g.isNeighbor(D,B)) continue;\r\n\t\t\t\t\t\t//otherwise, we have a P4 or a C4\r\n\r\n\t\t\t\t\t\texistsP4orC4 = true;\r\n\t\t\t\t\t\t//System.out.print(\"Found P4: \"+A+\"-\"+B+\"-\"+C+\"-\"+D+\"... not a cograph\\n\");\r\n\r\n\t\t\t\t\t\tif (g.isNeighbor(D,A)) {\r\n\t\t\t\t\t\t\t// we have a C4 = a-b-c-d-a\r\n\t\t\t\t\t\t\t// add a diagonal chord or delete any two edges\r\n\r\n\t\t\t\t\t\t\tif (S.isIn(A, C)==-1) {\r\n\t\t\t\t\t\t\t\tg.addEdge(\"e\"+A+\",\"+C, A,C);\r\n\t\t\t\t\t\t\t\tS.add(A,C);\r\n\t\t\t\t\t\t\t\tQuasiThresholdEditingMinimization(g,1+currentSize,S);\r\n\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(A, C));\r\n\t\t\t\t\t\t\t\tS.remove(A,C);\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\tif (S.isIn(B,D) == -1) {\r\n\t\t\t\t\t\t\t\tg.addEdge(\"e\"+B+\",\"+D, B,D);\r\n\t\t\t\t\t\t\t\tS.add(B,D);\r\n\t\t\t\t\t\t\t\tQuasiThresholdEditingMinimization(g,1+currentSize,S);\r\n\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(B,D));\r\n\t\t\t\t\t\t\t\tS.remove(B,D);\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\tif (S.isIn(A,B) == -1) {\r\n\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(A, B));\r\n\t\t\t\t\t\t\t\tS.add(A,B);\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tif (S.isIn(B,C) == -1) {\r\n\t\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(B, C));\r\n\t\t\t\t\t\t\t\t\tS.add(B,C);\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\tQuasiThresholdEditingMinimization(g,2+currentSize,S);\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\tg.addEdge(\"mar-\"+B+\"-\"+C, B,C);\r\n\t\t\t\t\t\t\t\t\tS.remove(B,C);\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tif (S.isIn(C,D) == -1) {\r\n\t\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(C, D));\r\n\t\t\t\t\t\t\t\t\tS.add(C,D);\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\tQuasiThresholdEditingMinimization(g,2+currentSize,S);\r\n\r\n\t\t\t\t\t\t\t\t\tg.addEdge(\"mar-\"+C+\"-\"+D, C,D);\r\n\t\t\t\t\t\t\t\t\tS.remove(C,D);\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\r\n\r\n\t\t\t\t\t\t\t\tif (S.isIn(D, A) == -1) {\r\n\t\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(D, A));\r\n\t\t\t\t\t\t\t\t\tS.add(D,A);\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\tQuasiThresholdEditingMinimization(g,2+currentSize,S);\r\n\r\n\t\t\t\t\t\t\t\t\tg.addEdge(\"mar-\"+D+\"-\"+A, D,A);\r\n\t\t\t\t\t\t\t\t\tS.remove(D,A);\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\t\tg.addEdge(\"mar-\"+A+\"-\"+B,A,B);\r\n\t\t\t\t\t\t\t\tS.remove(A, B);\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t// all cases with AB deleted are done.\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tif (S.isIn(D,A) == -1) {\r\n\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(D,A));\r\n\t\t\t\t\t\t\t\tS.add(D,A);\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tif (S.isIn(B,C) == -1) {\r\n\t\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(B, C));\r\n\t\t\t\t\t\t\t\t\tS.add(B,C);\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\tQuasiThresholdEditingMinimization(g,currentSize+2,S);\r\n\r\n\t\t\t\t\t\t\t\t\tg.addEdge(\"mar-\"+B+\"-\"+C, B,C);\r\n\t\t\t\t\t\t\t\t\tS.remove(B,C);\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\t\tif (S.isIn(C,D) == -1) {\r\n\t\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(C, D));\r\n\t\t\t\t\t\t\t\t\tS.add(C,D);\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\tQuasiThresholdEditingMinimization(g,currentSize+2,S);\r\n\r\n\t\t\t\t\t\t\t\t\tg.addEdge(\"mar-\"+C+\"-\"+D,C,D);\r\n\t\t\t\t\t\t\t\t\tS.remove(C,D);\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tg.addEdge(\"mar-\"+A+\"-\"+D, A,D);\r\n\t\t\t\t\t\t\t\tS.remove(D,A);\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t// all cases with AB deleted or AD deleted are done\r\n\t\t\t\t\t\t\t// only need to try BC and CD together deleted.\r\n\r\n\t\t\t\t\t\t\tif (S.isIn(B,C)== -1 && S.isIn(C, D)== -1) {\r\n\r\n\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(B, C));\r\n\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(C, D));\r\n\t\t\t\t\t\t\t\tS.add(B,C);\r\n\t\t\t\t\t\t\t\tS.add(C,D);\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tQuasiThresholdEditingMinimization(g,currentSize+2,S);\r\n\r\n\t\t\t\t\t\t\t\tg.addEdge(\"mar-\"+B+\"-\"+C, B,C);\r\n\t\t\t\t\t\t\t\tg.addEdge(\"mar-\"+C+\"-\"+D, C,D);\r\n\t\t\t\t\t\t\t\tS.remove(B,C);\r\n\t\t\t\t\t\t\t\tS.remove(C,D);\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\t\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t} // end of C4-handling cases\r\n\r\n\t\t\t\t\t\telse {\r\n\t\t\t\t\t\t\t// this case says:\r\n\t\t\t\t\t\t\t// else D is NOT adjacent to A. Then we have P4=abcd\r\n\t\t\t\t\t\t\t// either add ac or bd or else delete one edge\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t//int branchCase = randomInt(1,5);\t\r\n\t\t\t\t\t\t//if (branchCase <= 2) {\r\n\t\t\t\t\t\t\tif (S.isIn(A, C) == -1) {\r\n\t\t\t\t\t\t\t\tg.addEdge(\"e\"+A+\",\"+C, A, C);\r\n\t\t\t\t\t\t\t\tS.add(A,C);\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tQuasiThresholdEditingMinimization(g,currentSize+1,S);\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(A, C));\r\n\t\t\t\t\t\t\t\tS.remove(A,C);\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\tif (S.isIn(B,D) == -1) {\r\n\t\t\t\t\t\t\t\tg.addEdge(\"e\"+B+\",\"+D, B, D);\r\n\t\t\t\t\t\t\t\tS.add(B,D);\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tQuasiThresholdEditingMinimization(g,currentSize+1,S);\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(B, D));\r\n\t\t\t\t\t\t\t\tS.remove(B,D);\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t//}\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t//else if (branchCase == 3) {\r\n\t\t\t\t\t\t\tif (S.isIn(A,B)== -1) {\r\n\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(A, B));\r\n\t\t\t\t\t\t\t\tS.add(A, B);\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tQuasiThresholdEditingMinimization(g,currentSize+1,S);\r\n\r\n\t\t\t\t\t\t\t\tg.addEdge(\"mar-\"+A+\"-\"+B, A,B);\r\n\t\t\t\t\t\t\t\tS.remove(A,B);\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t//}\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t//else if (branchCase == 4) {\r\n\t\t\t\t\t\t\tif (S.isIn(B,C) == -1) {\r\n\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(B, C));\r\n\t\t\t\t\t\t\t\tS.add(B, C);\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tQuasiThresholdEditingMinimization(g,currentSize+1,S);\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tg.addEdge(\"mar-\"+B+\"-\"+C, B,C);\r\n\t\t\t\t\t\t\t\tS.remove(B,C);\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t//}\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t//else if (branchCase == 5) {\r\n\t\t\t\t\t\t\tif (S.isIn(C,D) == -1) {\r\n\t\t\t\t\t\t\t\tg.removeEdge(g.findEdge(C, D));\r\n\t\t\t\t\t\t\t\tS.add(C,D);\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tQuasiThresholdEditingMinimization(g,currentSize+1,S);\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tg.addEdge(\"mar-\"+C+\"-\"+D, C,D);\r\n\t\t\t\t\t\t\t\tS.remove(C,D);\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t//}\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t} // end of P4-handling\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\tif (existsP4orC4 == true) return;\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t} // end d.hasNext()\r\n\t\t\t\t} // end c.hasNext()\r\n\t\t\t} // end b.hasNext()\r\n\t\t} // end a.hasNext()\r\n\r\n\t\t// if we reached here, no P4 was found\r\n\t\tif (existsP4orC4 == false) {\r\n\t\t\t// arrived at a quasi-threshold graph since no P4 or C4 was found\r\n\t\t\tSystem.out.print(\"\\n currentSize = \"+currentSize+\" and minSoFar = \"+minSoFarQTEdit+\"\\n\");\r\n\t\t\tSystem.out.print(\"Modified(Edited) graph has \"+g.getEdgeCount()+\" edges and is:\\n\");\r\n\t\t\tminSoFarQTEdit = currentSize;\r\n\t\t\tSystem.out.print(\"\"+g+\"\\n\");\r\n\t\t\tSystem.out.print(\"Edit set is \" + S + \"\\n\");\r\n\t\t\tNewTools.printToFile(currentSize,g,S,\"QTEditLesMis.txt\");\r\n\t\t\treturn;\r\n\t\t}\r\n\t\t\r\n\t\t// ...\r\n\t\tSystem.out.print(\"Critical Error. No P_4 or C_4 found in a non-quasi-threshold graph.\\n\");\r\n\t\treturn;\r\n\t}","private void calculate() {\n\t\tList<Edge> path = new ArrayList<>();\n\t\tPriorityQueue<Vert> qv = new PriorityQueue<>();\n\t\tverts[s].dist = 0;\n\t\tqv.add(verts[s]);\n\t\twhile (!qv.isEmpty()) {\n\t\t\tVert v = qv.poll();\n\t\t\tint vidx = v.idx;\n\t\t\tfor (Edge e : v.edges) {\n\t\t\t\tif (e.w==0) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tVert vo = verts[e.other(vidx)];\n\t\t\t\tif (vo.dist > v.dist + e.w) {\n\t\t\t\t\tvo.dist = v.dist + e.w;\n\t\t\t\t\tqv.add(vo);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (verts[t].dist < L) {\n\t\t\tok = false;\n\t\t\treturn;\n\t\t} else if (verts[t].dist == L) {\n\t\t\tok = true;\n\t\t\tfor (int i=0; i<m; i++) {\n\t\t\t\tif (edges[i].w == 0) {\n\t\t\t\t\tedges[i].w = MAX_DIST;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\t// replace 0 with 1, adding to za list\n\t\tfor (int i=0; i<m; i++) {\n\t\t\tif (edges[i].w == 0) {\n\t\t\t\tza[i] = true;\n\t\t\t\tedges[i].w = 1;\n\t\t\t} else {\n\t\t\t\tza[i] = false;\n\t\t\t}\n\t\t}\n\t\t\n\t\t// looking for shortest path from s to t with 0\n\t\tfor (int i=0; i<n; i++) {\n\t\t\tif (i != s) {\n\t\t\t\tverts[i].dist = MAX_DIST;\n\t\t\t}\n\t\t}\n\t\tqv.clear();\n\t\tqv.add(verts[s]);\n\t\twhile (!qv.isEmpty()) {\n\t\t\tVert v = qv.poll();\n\t\t\tint vidx = v.idx;\n\t\t\tfor (Edge e : v.edges) {\n\t\t\t\tVert vo = verts[e.other(vidx)];\n\t\t\t\tif (vo.dist > v.dist + e.w) {\n\t\t\t\t\tvo.dist = v.dist + e.w;\n\t\t\t\t\tqv.add(vo);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (verts[t].dist > L) {\n\t\t\tok = false;\n\t\t\treturn;\n\t\t}\n\t\tVert v = verts[t];\n\t\twhile (v.dist > 0) {\n\t\t\tlong minDist = MAX_DIST;\n\t\t\tVert vMin = null;\n\t\t\tEdge eMin = null;\n\t\t\tfor (Edge e : v.edges) {\n\t\t\t\tVert vo = verts[e.other(v.idx)];\n\t\t\t\tif (vo.dist+e.w < minDist) {\n\t\t\t\t\tvMin = vo;\n\t\t\t\t\teMin = e;\n\t\t\t\t\tminDist = vMin.dist+e.w;\n\t\t\t\t}\t\t\t\t\n\t\t\t}\n\t\t\tv = vMin;\t\n\t\t\tpath.add(eMin);\n\t\t}\n\t\tCollections.reverse(path);\n\t\tfor (int i=0; i<m; i++) {\n\t\t\tif (za[i]) {\n\t\t\t\tedges[i].w = MAX_DIST;\n\t\t\t}\n\t\t}\n\t\tlong totLen=0;\n\t\tboolean wFixed = false;\n\t\tfor (Edge e : path) {\n\t\t\ttotLen += (za[e.idx] ? 1 : e.w);\n\t\t}\n\t\tfor (Edge e : path) {\n\t\t\tif (za[e.idx]) {\n\t\t\t\tif (!wFixed) {\n\t\t\t\t\te.w = L - totLen + 1;\n\t\t\t\t\twFixed = true;\n\t\t\t\t} else {\n\t\t\t\t\te.w = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tok = true;\n\t}","public void findShortestPath() {\r\n\t\t\r\n\t\t//Create a circular array that will store the possible next tiles in the different paths.\r\n\t\tOrderedCircularArray<MapCell> path = new OrderedCircularArray<MapCell>();\r\n\t\t\r\n\t\t//Acquire the starting cell.\r\n\t\tMapCell starting = cityMap.getStart();\r\n\t\t\r\n\t\t//This variable is to be updated continuously with the cell with the shortest distance value in the circular array.\r\n\t\tMapCell current=null;\r\n\t\t\r\n\t\t//This variable is to check if the destination has been reached, which is initially false.\r\n\t\tboolean destination = false;\r\n\t\t\r\n\t\t//Add the starting cell into the circular array, and mark it in the list.\r\n\t\tpath.insert(starting, 0);\r\n\t\t\r\n\t\tstarting.markInList(); \r\n\t\t\r\n\t\ttry {\r\n\t\t\t\r\n\t\t\t//As long as the circular array isn't empty, and the destination hasn't been reached, run this loop.\r\n\t\t\twhile(!path.isEmpty()&&!destination) {\r\n\t\t\t\t\r\n\t\t\t\t//Take the cell with the shortest distance out of the circular array, and mark it accordingly.\r\n\t\t\t\tcurrent = path.getSmallest();\r\n\t\t\t\tcurrent.markOutList();\r\n\t\t\t\t\r\n\t\t\t\tMapCell next;\r\n\t\t\t\tint distance;\r\n\t\t\t\t\r\n\t\t\t\tif(current.isDestination()) {\r\n\t\t\t\t\t\r\n\t\t\t\t\tdestination = true; //If the current cell is the destination, end the loop.\r\n\t\t\t\t\t\r\n\t\t\t\t} else {\r\n\t\t\t\t\t\r\n\t\t\t\t\tnext = nextCell(current); //Acquire the next possible neighbour of the current cell.\r\n\t\t\t\t\t\r\n\t\t\t\t\t//Don't run if next is null, meaning there is no other possible neighbour in the path for the current cell.\r\n\t\t\t\t\twhile(next!=null) {\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tdistance = current.getDistanceToStart() + 1;\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t//If the distance of the selected neighbouring cell is currently more than 1 more than the current cell's \r\n\t\t\t\t\t\t//distance, update the distance of the neighbouring cell. Then, set the current cell as its predecessor.\r\n\t\t\t\t\t\tif(next.getDistanceToStart()>distance) {\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tnext.setDistanceToStart(distance);\r\n\t\t\t\t\t\t\tnext.setPredecessor(current);\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tdistance = next.getDistanceToStart(); \r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tif(next.isMarkedInList() && distance<path.getValue(next)) {\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tpath.changeValue(next, distance); //If the neighbouring cell is in the circular array, but with a \r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t //larger distance value than the new updated distance, change its value.\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t} else if(!next.isMarkedInList()){\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tpath.insert(next, distance); //If the neighbouring cell isn't in the circular array, add it in.\r\n\t\t\t\t\t\t\tnext.markInList();\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tnext = nextCell(current); //Look for the next possible neighbour, if any.\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}\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t//Catch all the possible exceptions that might be thrown by the method calls. Print the appropriate messages.\r\n\t\t} catch (EmptyListException e) {\r\n\t\t\t\r\n\t\t\tSystem.out.println(e.getMessage());\r\n\t\t\tSystem.out.println(\"Path finding execution stopped.\");\r\n\t\t\t\r\n\t\t} catch (InvalidNeighbourIndexException e) {\r\n\t\t\t\r\n\t\t\tSystem.out.println(\"The program tried to access an invalid neighbour of a tile.\");\r\n\t\t\tSystem.out.println(\"Path finding execution stopped.\");\r\n\t\t\t\r\n\t\t} catch (InvalidDataItemException e) {\r\n\t\t\t\r\n\t\t\tSystem.out.println(e.getMessage());\r\n\t\t\tSystem.out.println(\"Path finding execution stopped.\");\r\n\t\t\t\r\n\t\t} catch (Exception e) {\r\n\t\t\t\r\n\t\t\tSystem.out.println(e.getMessage()+\" Path finding execution has stopped.\");\r\n\t\t\t\r\n\t\t}\r\n\t\t\r\n\t\t//If a path was found, print the number of tiles in the path.\r\n\t\tif(destination) {\r\n\t\t\t\r\n\t\t\tSystem.out.println(\"Number of tiles in path: \" + (current.getDistanceToStart()+1));\r\n\t\t\t\r\n\t\t} else {\r\n\t\t\t\r\n\t\t\tSystem.out.println(\"No path found.\"); //Otherwise, indicate that a path wasn't found.\r\n\t\t\t\r\n\t\t}\r\n\t\t\r\n\t}","public int noOfMPaths2Dest(int s,int t,int k){\n double INFINITY = Double.MAX_VALUE;\n boolean[] SPT = new boolean[intersection];\n double[] resultPath = new double[intersection];\n LinkedList<Integer>[] parent = new LinkedList[intersection]; //using linked list instead of array to store all the possible parent of an intersection\n\n for (int i = 0; i <intersection ; i++) {\n resultPath[i] = INFINITY;\n parent[i] = new LinkedList<>();\n }\n\n //decrease the distance for the first index\n resultPath[s] = 0;\n\n //add all the vertices to the MinHeap\n MinHeap minHeap = new MinHeap(k);\n for (int i = 0; i <intersection ; i++) {\n minHeap.add(i,resultPath[i]);\n }\n //while minHeap is not empty\n while(!minHeap.isEmpty()){\n //extract the min\n int extractedVertex = minHeap.extractMin();\n\n if(extractedVertex==t) {\n break;\n }\n SPT[extractedVertex] = true;\n\n LinkedList<Edge> list = g.adjacencylist[extractedVertex];\n for (int i = 0; i <list.size() ; i++) {\n Edge edge = list.get(i);\n int destination = edge.destination;\n if(SPT[destination]==false ) {\n\n double newKey = resultPath[extractedVertex] + edge.weight ;\n double currentKey = resultPath[destination];\n if(currentKey>=newKey){\n minHeap.updateKey(newKey, destination,resultPath[destination]);\n parent[destination].add(extractedVertex);\n resultPath[destination] = newKey;\n }\n }\n }\n }\n int numofPath =0;\n\n //calculate the number of path\n if(parent[t]!=null){\n boolean[] isVisited = new boolean[intersection];\n ArrayList<Integer> pathList = new ArrayList<>();\n pathList.add(t);\n numofPath = findAllPathsUtil(s, t, isVisited, pathList,numofPath,parent); //dfs\n\n }\n return numofPath;\n }","public void union(BlastGraph<HitVertex, ValueEdge> graphToUnion) {\n\t\tfor (HitVertex hv : graphToUnion.getVertices()) {\n\t\t\tthis.addVertex(hv);\n\t\t}\n\n\t\tfor (ValueEdge ve : graphToUnion.getEdges()) {\n\t\t\tthis.addEdge(ve, graphToUnion.getEndpoints(ve));\n\t\t}\n\t}","public static void execute(StringBuffer path, HashMap<String, Zpair> stores\n , HashSet<Zpair> visited, List<String> q111\n , List<Integer> sortedQueue) {\n\n //System.out.println(\" \" + executeCounter++);\n //System.out.println(\"This is the path : \" + path);\n int size = path.length(); // size of current path\n StringBuffer oldPath = new StringBuffer(path.substring(0,size-1));\n\n Zpair tuple = stores.get(oldPath.toString()); // (q1,s1) = stores[oldPath]\n List<Integer> q = new ArrayList<Integer>(tuple.first); // q = q1.copy()\n List<Integer> s = new ArrayList<Integer>(tuple.second); // s = s1.copy()\n\n char qORs = path.charAt(size - 1);\n\n if (qORs == 'Q') {\n if (!moveQ1(q, s)) {\n return;\n }\n } else if (qORs == 'S') {\n if (!moveS1(q, s)) {\n return;\n }\n }\n if (size % 2 == 0) {\n if (q.equals(sortedQueue)) {\n //printList(q);\n //printList(s);\n System.out.println(path);\n System.exit(1);\n }\n }\n\n Zpair tuple1 = new Zpair(ZMethods.listCopyOfIntegers(q)\n , ZMethods.listCopyOfIntegers(s));\n\n stores.put(path.toString(), tuple1);\n if (!visited.contains(tuple1)) {\n visited.add(tuple1);\n if (q.size() != 0 && s.size() != 0) {\n if (q.get(0) == s.get(s.size() - 1)) {\n q111.add(path + \"Q\");\n return;\n }\n }\n if (q.size() != 0) {\n q111.add(path + \"Q\");\n }\n if (s.size() != 0) {\n q111.add(path + \"S\");\n }\n //printList(q111);\n }\n }","public static void main(String[] args) throws FileNotFoundException, IOException {\n BufferedReader sc = new BufferedReader(new FileReader(\"comehome.in\"));\n BufferedWriter out = new BufferedWriter(new FileWriter(\"comehome.out\"));\n int[][] adjMat = new int[58][58];\n ArrayList<Character> capsUsed = new ArrayList<Character>();\n int paths = Integer.parseInt(sc.readLine());\n for (int i = 0; i < adjMat.length; i++) {\n Arrays.fill(adjMat[i], 500000);\n }\n for (int i = 0; i < paths; i++) {\n String[] spl = sc.readLine().split(\" \");\n char u = spl[0].charAt(0);\n char v = spl[1].charAt(0);\n int weight = Integer.parseInt(spl[2]);\n adjMat[map(u)][map(v)] = Math.min(weight, adjMat[map(u)][map(v)]);//this is a multigraph, just take minimum edge weight\n adjMat[map(v)][map(u)] = Math.min(weight, adjMat[map(v)][map(u)]);//since its the only one that will count\n if (Character.isUpperCase(u)) {\n capsUsed.add(u);\n }\n if (Character.isUpperCase(v)) {\n capsUsed.add(v);\n }\n }\n for (int k = 0; k < adjMat.length; k++) {//intermediate...\n for (int i = 0; i < adjMat.length; i++) {\n for (int j = 0; j < adjMat.length; j++) {\n if (adjMat[i][k] + adjMat[k][j] < adjMat[i][j]) {\n adjMat[i][j] = adjMat[i][k] + adjMat[k][j];\n }\n }\n }\n }\n int min = Integer.MAX_VALUE;\n char minChar = '0';\n int zMap = map('Z');\n for (char c : capsUsed) {\n if (c != 'Z') {\n if (adjMat[map(c)][zMap] < min) {\n min = adjMat[map(c)][zMap];\n minChar = c;\n }\n }\n }\n //System.out.println(adjMat[map('R')][map('Z')]);\n out.append(minChar + \" \" + min + \"\\n\");\n out.close();\n }","public void union(int first, int second){\n int firstId = find(first);\n int secondId = find(second);\n //Check if these are already connected\n if(firstId == secondId){\n return;\n }\n if(size[firstId] < size[secondId]){\n size[secondId]+=size[firstId];\n grid[first] = secondId;\n }\n else {\n size[firstId]+=size[secondId];\n grid[second] = firstId;\n }\n --numOfComponents;\n }","public void sizeOfTiles(int size)\n{\n if(m != null )\n {\n m.getOutputImageManager().setTileSize(size);\n //refresh row shift for new size of tiles\n if(m.getOutputImageManager().getMosaic() != null)\n {\n m.getOutputImageManager().setEvenRowShift(m.getOutputImageManager().getEvenRowShift());\n m.getOutputImageManager().setOddRowShift(m.getOutputImageManager().getOddRowShift());\n m.getOutputImageManager().getMosaic().setHoverIndex(0,0);\n //println(m.getOutputImageManager().getMosaic().getFlipH()[0].length);\n }\n m.getOutputImageManager().setToRerender();\n }\n}","void union(int x, int y) {\n\n // **** set the modes in the parents array ****\n if (parents[x] == 0)\n parents[x] = x;\n\n if (parents[y] == 0)\n parents[y] = y;\n\n // **** update the representative element of each set ****\n if (parents[x] != 0 || parents[y] != 0) {\n\n // **** get the low and high from these nodes ****\n int high = Math.max(parents[x], parents[y]);\n int low = Math.min(parents[x], parents[y]);\n\n // ???? ????\n System.out.println(\"union <<< high: \" + high + \" low: \" + low);\n\n // **** update to point to the proper representative ****\n for (int i = 0; i < parents.length; i++) {\n if (parents[i] == high)\n parents[i] = low;\n }\n }\n }","@Test\n public void testMatchLimitOneBottomUp() throws Exception {\n\n HepProgramBuilder programBuilder = HepProgram.builder();\n programBuilder.addMatchLimit( 1 );\n programBuilder.addMatchOrder( HepMatchOrder.BOTTOM_UP );\n programBuilder.addRuleInstance( UnionToDistinctRule.INSTANCE );\n\n checkPlanning( programBuilder.build(), UNION_TREE );\n }","public void writeBig (byte[] b) {\n if (b.length<12)\n try {\n throw new IOException();\n } catch (IOException e) {\n e.printStackTrace();\n }\n\n Map<String,Integer> codes = new LinkedHashMap<>();\n ArrayList<Pair<Integer,Integer>> array = new ArrayList<>();\n int arrIndex=0;\n array.add(arrIndex++,new Pair<>(0,0));\n int k=12;\n codes.put(String.valueOf(b[k]),arrIndex);\n array.add(arrIndex++,new Pair((int)b[k++],0));\n\n for (; k<b.length; k++){\n int pointer=0;\n String current = String.valueOf(b[k]);\n while (codes.containsKey(current) && k<b.length-1){\n pointer=codes.get(current);\n k++;\n current+=String.valueOf(b[k]);\n }\n if (codes.containsKey(current) && k==b.length-1) {\n array.add(arrIndex, new Pair(2, codes.get(current)));\n codes.put(current,arrIndex);\n }\n else{\n array.add(arrIndex,new Pair((int)b[k],pointer));\n codes.put(current,arrIndex++);\n }\n }\n\n //Write compressed array//\n for (int i=0; i< 12 ; i++) //maze dimensions + start/goal\n write(b[i]);\n int pointerSize= array.size()>128 ? (array.size()>32768 ? 3 : 2) : 1; // how many bytes to represent the pointer\n write(pointerSize);\n// System.out.println(\"DEBUG : array size:\" + array.size()+\" unit size: \"+(pointerSize+1)); //DEBUGGING\n for (Pair<Integer, Integer> Pair : array) { //send array\n byte cell = (byte) (Pair.getKey()<<7);\n cell = (byte) (cell | (Pair.getValue()>>(8*(pointerSize-1))));\n write(cell);\n for (int j = pointerSize - 2; j >= 0; j--) {\n cell=(byte) (Pair.getValue() >> 8 * j);\n write(cell);\n }\n }\n write(array.get(array.size()-1).getKey()); //last cell key (0/1/2)\n //Finish writing compressed array//\n }","private static void stepSorter(String file, DataOutputStream d, int size) throws FileNotFoundException, IOException {\n\t\tDataInputStream inputA = new DataInputStream(new BufferedInputStream(new FileInputStream(new File(file))));\n\t\tDataInputStream inputB = new DataInputStream(new BufferedInputStream(new FileInputStream(new File(file))));\n\t\tint numDivisions = (int) Math.ceil(fileSize/((double) size));\n\t\tinputB.skip(size*4);\n\t\tfor (int j = 0; j < numDivisions/2; j++){\t\n\t\t\tint counterA = size;\n\t\t\tint counterB = Math.min(fileSize - j*size*2 - size, size);\n\t\t\tInteger a = inputA.readInt();\n\t\t\tInteger b = inputB.readInt();\n\t\t\twhile (counterA > 0 && counterB > 0){\n\t\t\t\tif (a < b){\n\t\t\t\t\td.writeInt(a);\n\t\t\t\t\tif (counterA > 1){\n\t\t\t\t\t\ta = inputA.readInt();\n\t\t\t\t\t}\n\t\t\t\t\tcounterA--;\n\t\t\t\t} else {\n\t\t\t\t\td.writeInt(b);\n\t\t\t\t\tif (counterB > 1){\n\t\t\t\t\t\tb = inputB.readInt();\n\t\t\t\t\t}\n\t\t\t\t\tcounterB--;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (counterA == 0){\n\t\t\t\td.writeInt(b);\n\t\t\t\tcounterB--;\n\t\t\t\tfor (int i =0; i < counterB; i++){\n\t\t\t\t\td.writeInt(inputB.readInt());\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\td.writeInt(a);\n\t\t\t\tcounterA--;\n\t\t\t\tfor (int i =0; i < counterA; i++){\n\t\t\t\t\td.writeInt(inputA.readInt());\n\t\t\t\t}\n\t\t\t}\n\t\t\tinputA.skip(size*4);\n\t\t\tinputB.skip(size*4);\n\t\t}\n\t\t\n\t\t//copy the excess\n\t\twhile (inputA.available()>0){\n\t\t\td.writeInt(inputA.readInt());\n\t\t}\n\t\tinputA.close();\n\t\tinputB.close();\n\t\td.flush();\n\t}","@Override\n public void serverStrategy(InputStream inputStream, OutputStream outputStream) {\n try {\n ObjectInputStream fromClient = new ObjectInputStream(inputStream);\n ObjectOutputStream toClient = new ObjectOutputStream(outputStream);\n toClient.flush();\n Object obFromClient = fromClient.readObject();\n if (obFromClient == null || !(obFromClient instanceof Maze)) return;\n //setting variables\n Maze mazeFromClient = (Maze)obFromClient;\n String tempFolder = System.getProperty(\"java.io.tmpdir\");\n Solution solToReturn = null;\n //search if the maze exists\n byte[] byteMazeFromClient = mazeFromClient.toByteArray();\n boolean stop = false;\n int i = 0;\n for (; i < count && !stop; i++) {\n //Path fileLocation = Paths.get(tempFolder + \"/m\" + i + \".txt\");\n String fileLocation = tempFolder + \"/m\" + i + \".txt\";\n //System.out.println(Thread.currentThread().getId()+\" reading maze from \"+fileLocation);\n //byte[] currByteArray = Files.readAllBytes(fileLocation);\n synchronized (this) {\n InputStream in = new MyDecompressorInputStream(new FileInputStream(fileLocation));\n byte currByteArray[] = new byte[sizes.get(i)];\n in.read(currByteArray);\n in.close();\n Maze maze = new Maze(currByteArray);\n stop = Arrays.equals(maze.toByteArray(), byteMazeFromClient);\n }\n\n }\n //if exists - return solution\n if (stop) {\n i--;\n //System.out.println(Thread.currentThread().getId()+\" found solution: \"+i);\n solToReturn = returnSolution(i, tempFolder);\n } else {//save and solve:\n //save the maze\n synchronized (this) {\n //Path file = Paths.get(tempFolder + \"/m\" + count + \".txt\");\n //Files.write(file, mazeFromClient.toByteArray());\n String path = tempFolder + \"/m\" + count + \".txt\";\n //System.out.println(Thread.currentThread().getId()+\" writing maze to \"+path);\n String file = tempFolder + \"/m\" + count + \".txt\";\n\n OutputStream out = new MyCompressorOutputStream(new FileOutputStream(file));\n byte[] toWrite = mazeFromClient.toByteArray();\n out.write(toWrite);\n out.flush();\n out.close();\n sizes.put(count,toWrite.length);\n //System.out.println(Thread.currentThread().getId()+\" finished writing maze, count==\"+count);\n //solve\n SearchableMaze searchableMaze = new SearchableMaze(mazeFromClient);\n/*\n ASearchingAlgorithm searcher = Configurations.getAlgorithm();\n*/\n ASearchingAlgorithm searcher = new BestFirstSearch();\n solToReturn = searcher.solve(searchableMaze);\n //save solution\n writeSolution(solToReturn, tempFolder, count);\n count++;//increase counter\n }\n }\n //send solution\n toClient.writeObject(solToReturn);\n } catch (IOException e) {\n e.printStackTrace();\n } catch (ClassNotFoundException e) {\n e.printStackTrace();\n }\n }","public static void union(int u, int v) {\n\t\tu = root(u); // optimizations\n\t\tv = root(v); // to make find faster\n\t\tif (u == v) return; // already in same component\n\t\t\n\t\tif (size[u] >= size[v]) {\n\t\t\tp[v] = u;\n\t\t\tsize[u] += size[v];\n\t\t} else {\n\t\t\tp[u] = v;\n\t\t\tsize[v] += size[u];\n\t\t}\n\t}","public static void main(String[] args) throws IOException {\n BufferedReader bufferedReader = new BufferedReader(new FileReader(UFTest.class.getResource(\"/\").getPath()+\"1.5/largeUF.txt\"));\n String str = bufferedReader.readLine();\n UFLJWQU uf = new UFLJWQU(Integer.parseInt(str));\n long beginTime =System.currentTimeMillis();\n while ((str = bufferedReader.readLine())!=null){\n String[] array = str.split(\" \");\n int p = Integer.parseInt(array[0]);\n int q = Integer.parseInt(array[1]);\n if(uf.connected(p,q)) continue;\n uf.union(p,q);\n// System.out.println(p+\" -- \"+q);\n }\n System.out.println(uf.count());\n System.out.println(\"cost time :\"+(System.currentTimeMillis() - beginTime));\n }","public static void pathMethod (int x, int y, int rows, int columns, int startPointX, int startPointY, int endPointX, int endPointY, String [][]copyArray, String [][]realArray, int decider) throws Exception{ \r\n \r\n String up = copyArray[y-1][x];\r\n String down = copyArray[y+1][x];\r\n String right = copyArray[y][x+1]; //moves the coordinate up one, down one, right one, left one and stores it into up down left right; \r\n String left = copyArray[y][x-1];\r\n \r\n if(up.equals(\"X\")||down.equals(\"X\")||right.equals(\"X\")||left.equals(\"X\")){ //if up right left or down is equal to the endpoint, the maze is solvable, and we can now print the final array\r\n System.out.println(\"\\nThe maze is solvable!\");\r\n// printFinalArray(realArray, counter, xvalues, yvalues); //solution is found already - sends back to another method to print final solution\r\n regenerate(decider); //then sends to regenerate method where it asks if user would like to create another maze\r\n }\r\n \r\n else if(copyArray[startPointY+1][startPointX].equals(\"B\")&©Array[startPointY-1][startPointX].equals(\"B\")&©Array[startPointY][startPointX+1].equals(\"B\")&©Array[startPointY][startPointX-1].equals(\"B\")){\r\n \r\n System.out.println(\"\\nSorry, your maze is unsolvable.\\n\\n\"); //if at the start point we cannot go up down left or right - no possible moves - not solvable - end of maze \r\n regenerate(decider); //call the method that gives users the option to recreate the maze if it was unsolvable \r\n } \r\n \r\n else if(up.equals(\"O\")){ //if the coordinate in the up direction is O\r\n counter=counter+1; //incrementing counter so we can input it the coordinate arrays\r\n copyArray[y][x] = \"V\"; //changing the values to 'V' so we can know that we already visited it\r\n y=y-1; //moving coordinate up one \r\n xvalues[counter]=x; //storing this coordinate into the arrays with the counter\r\n yvalues[counter]=y;\r\n pathMethod(x, y, rows, columns, startPointX, startPointY, endPointX, endPointY, copyArray, realArray, decider); //recalling method\r\n }\r\n \r\n else if(down.equals(\"O\")){ //if down = O\r\n copyArray[y][x] = \"V\";\r\n counter=counter+1;\r\n y=y+1; \r\n xvalues[counter]=x;\r\n yvalues[counter]=y;\r\n pathMethod(x, y, rows, columns, startPointX, startPointY, endPointX, endPointY, copyArray, realArray, decider);\r\n }\r\n \r\n else if(right.equals(\"O\")){ //if right equals O\r\n copyArray[y][x] = \"V\";\r\n counter=counter+1;\r\n x=x+1;\r\n xvalues[counter]=x;\r\n yvalues[counter]=y;\r\n pathMethod(x, y, rows, columns, startPointX, startPointY, endPointX, endPointY, copyArray, realArray, decider);\r\n }\r\n \r\n else if(left.equals(\"O\")){ //if left equals O\r\n copyArray[y][x] = \"V\";\r\n counter=counter+1;\r\n x=x-1;\r\n xvalues[counter]=x;\r\n yvalues[counter]=y;\r\n pathMethod(x, y, rows, columns, startPointX, startPointY, endPointX, endPointY, copyArray, realArray, decider);\r\n }\r\n \r\n else { //if neither up down left or right work\r\n for(int i = 0; i<rows; i++){ //makes all the 'V's go back to O\r\n for(int j = 0; j<columns; j++){\r\n if(copyArray[i][j].equals(\"V\")){\r\n copyArray[i][j] = \"O\";\r\n }\r\n }\r\n }\r\n copyArray[y][x] = \"B\"; //make the coordinate that you cant make a move with B, so it shortens the possible path options\r\n for(int i = 0 ; i<counter; i++){\r\n xvalues[i] = 0; //resets the coordinate arrays back to 0\r\n yvalues[i] = 0;\r\n }\r\n counter=0; //resets counter back to 0;\r\n pathMethod(startPointX, startPointY, rows, columns, startPointX, startPointY, endPointX, endPointY, copyArray, realArray, decider); //resends the startpoints instead of x and y; only thing different is that one coordinate is now marked \"B\"\r\n } \r\n }","@SuppressWarnings(\"unlikely-arg-type\")\r\n\tpublic static void main(String[] args) throws InterruptedException, ExecutionException, IOException {\r\n\t\t// TODO Auto-generated method stub\r\n\r\n\t\t// System.out.println(\"what\");\r\n\t\tint k = 7;\r\n\r\n\t\tchar[] set = { 'a', 'b', 'c' };\r\n\t\tchar[] str = new char[k];\r\n \r\n\t\tenumeratePaths(k, set, str, 0); // call function to generate the paths\r\n\t back_Up();// function to back up set of paths\r\n\t\t\t\t\t\t// information\r\n\t\t \r\n\r\n\t\tint[] lb = new int[R];// lower bound\r\n\t\tint[] ub = new int[R];// upper bound\r\n\r\n\t\tfor (int j = 0; j < R; j++) { // the sample range of integers is between 1 and 100\r\n\t\t\tlb[j] = -1000; // lower bound\r\n\t\t\tub[j] = 1000; // upper bound\r\n\r\n\t\t}\r\n\r\n\t\tfor (int run = 0; run < RUN; run++) {\r\n\r\n\t\t\tint[][] x = new int[pop_num][R];\r\n\t\t\tint[][] v = new int[pop_num][R];\r\n\t\t\t //id = 0;\r\n\t\t\t\r\n\t\t\t//paths.put(new String(str) , false);\r\n\t\t\tobj_total = 0;\r\n\t\t\t group_1_count = 0;\r\n\t\t group_2_count = 0;\r\n\t\t\t group_3_count = 0;\r\n\t\t\t group_4_count = 0;\r\n\t\t\t group_5_count = 0;\r\n\t\t\t group_6_count = 0;\r\n\t\t\t group_7_count = 0;\r\n\t\t\t group_8_count = 0;\r\n\t\t\t group_9_count = 0;\r\n\t\t\t\r\n\t\t\t group_10_count = 0;\r\n\t\t\t group_11_count = 0;\r\n\t\t\t group_12_count = 0;\r\n\t\t\t group_13_count = 0;\r\n\t\t\t group_14_count = 0;\r\n\t\t\t group_15_count = 0;\r\n\t\t\t group_16_count = 0;\r\n\t\t\t group_17_count = 0;\r\n\t\t\t group_18_count = 0;\r\n\t\t\t\r\n\t\t\t\r\n\t\t\t// pick_counter_1 = 0;\r\n\t\t\t \r\n\t\t\t group_19_count = 0;\r\n\t\t\t group_20_count = 0;\r\n\t\t\t group_21_count = 0;\r\n\t\t\t group_22_count = 0;\r\n\t\t\t group_23_count = 0;\r\n\t\t\t group_24_count = 0;\r\n\t\t\t group_25_count = 0;\r\n\t\t\t group_26_count = 0;\r\n\t\t\t group_27_count = 0;\r\n\t\t\t\r\n\t\t\t group_28_count = 0;\r\n\t\t\t group_29_count = 0;\r\n\t\t\t group_30_count = 0;\r\n\t\t\t group_31_count = 0;\r\n\t\t\t group_32_count = 0;\r\n\t\t\t group_33_count = 0;\r\n\t\t\t group_34_count = 0;\r\n\t\t\t group_35_count = 0;\r\n\t\t\t group_36_count = 0;\r\n\t\t\t\r\n\t\t\t group_37_count = 0;\r\n\t group_38_count = 0;\r\n\t\t\t group_39_count = 0;\r\n\t\t\t group_40_count = 0;\r\n\t\t\t group_41_count = 0;\r\n\t\t\t group_42_count = 0;\r\n\t\t\t group_43_count = 0;\r\n\t\t\t group_44_count = 0;\r\n\t\t\t group_45_count = 0;\r\n\t\t\t\r\n\t\t group_46_count = 0;\r\n\t\t\t group_47_count = 0;\r\n\t\t\t group_48_count = 0;\r\n\t\t\t group_49_count = 0;\r\n\t\t\t group_50_count = 0;\r\n\t\t group_51_count = 0;\r\n\t\t\t group_52_count = 0;\r\n\t\t\t group_53_count = 0;\r\n\t\t\t group_54_count = 0;\r\n\t\t\t\r\n\t\t\t group_55_count = 0;\r\n\t\t\t group_56_count = 0;\r\n\t\t\t group_57_count = 0;\r\n\t\t\t group_58_count = 0;\r\n\t\t\t group_59_count = 0;\r\n\t\t\t group_60_count = 0;\r\n\t\t\t group_61_count = 0;\r\n\t\t group_62_count = 0;\r\n\t\t\t group_63_count = 0;\r\n\t\t group_64_count = 0;\r\n\t\t\t\r\n\t\t solution_1 = new int[500][R];\r\n\t\t\t\tsolution_2 = new int[500][R];\r\n\t\t\t\tsolution_3 = new int[500][R];\r\n\t\t\t\tsolution_4 = new int[500][R];\r\n\t\t\t\tsolution_5 = new int[500][R];\r\n\t\t\t\tsolution_6 = new int[500][R];\r\n\t\t\t\tsolution_7 = new int[500][R];\r\n\t\t\t\tsolution_8 = new int[500][R];\r\n\t\t\t\tsolution_9 = new int[500][R];\r\n\t\t\t\tsolution_10 = new int[500][R];\r\n\t\t\t\tsolution_11 = new int[500][R];\r\n\t\t\t\tsolution_12 = new int[500][R];\r\n\t\t\t\tsolution_13 = new int[500][R];\r\n\t\t\t\tsolution_14 = new int[500][R];\r\n\t\t\t\tsolution_15 = new int[500][R];\r\n\t\t\t\tsolution_16 = new int[500][R];\r\n\t\t\t\tsolution_17 = new int[500][R];\r\n\t\t\t\tsolution_18 = new int[500][R];\r\n\t\t\t\tsolution_19 = new int[500][R];\r\n\t\t\t\tsolution_20 = new int[500][R];\r\n\t\t\t\tsolution_21 = new int[500][R];\r\n\t\t\t\tsolution_22 = new int[500][R];\r\n\t\t\t\tsolution_23 = new int[500][R];\r\n\t\t\t\tsolution_24 = new int[500][R];\r\n\t\t\t\tsolution_25 = new int[500][R];\r\n\t\t\t\tsolution_26 = new int[500][R];\r\n\t\t\t\tsolution_27 = new int[500][R];\r\n\t\t\t\tsolution_28 = new int[500][R];\r\n\t\t\t\tsolution_29 = new int[500][R];\r\n\t\t\t\tsolution_30 = new int[500][R];\r\n\t\t\t\tsolution_31 = new int[500][R];\r\n\t\t\t\tsolution_32 = new int[500][R];\r\n\t\t\t\tsolution_33 = new int[500][R];\r\n\r\n\t\t\t\tsolution_34 = new int[500][R];\r\n\t\t\t\tsolution_35 = new int[500][R];\r\n\t\t\t\tsolution_36 = new int[500][R];\r\n\t\t\t\tsolution_37 = new int[500][R];\r\n\t\t\t\tsolution_38 = new int[500][R];\r\n\t\t\t\tsolution_39 = new int[500][R];\r\n\t\t\t\tsolution_40 = new int[500][R];\r\n\t\t\t\tsolution_41 = new int[500][R];\r\n\t\t\t\tsolution_42 = new int[500][R];\r\n\t\t\t\tsolution_43 = new int[500][R];\r\n\t\t\t\tsolution_44 = new int[500][R];\r\n\t\t\t\tsolution_45 = new int[500][R];\r\n\t\t\t\tsolution_46 = new int[500][R];\r\n\t\t\t\tsolution_47 = new int[500][R];\r\n\t\t\t\tsolution_48 = new int[500][R];\r\n\t\t\t\tsolution_49 = new int[500][R];\r\n\t\t\t\tsolution_50 = new int[500][R];\r\n\t\t\t\tsolution_51 = new int[500][R];\r\n\t\t\t\tsolution_52 = new int[500][R];\r\n\t\t\t\tsolution_53 = new int[500][R];\r\n\t\t\t\tsolution_54 = new int[500][R];\r\n\t\t\t\tsolution_55 = new int[500][R];\r\n\t\t\t\tsolution_56 = new int[500][R];\r\n\t\t\t\tsolution_57 = new int[500][R];\r\n\t\t\t\tsolution_58 = new int[500][R];\r\n\t\t\t\tsolution_59 = new int[500][R];\r\n\t\t\t\tsolution_60 = new int[500][R];\r\n\t\t\t\tsolution_61 = new int[500][R];\r\n\t\t\t\tsolution_62 = new int[500][R];\r\n\t\t\t\tsolution_63 = new int[500][R];\r\n\t\t\t\tsolution_64 = new int[500][R];\r\n\t\t\t\t\r\n\t\t\t\r\n\t\t crossover_count = 0;\r\n boolean statusChecker =false;\r\n\t\t\tLinkedHashMap<String, List<Double>> parent_maps = new LinkedHashMap<String, List<Double>>();\r\n\t\t\t\r\n\t\t\tLinkedHashMap<String, List<Double>> offspring_maps = new LinkedHashMap<String, List<Double>>();\r\n\t\t\t\r\n\t\t\tLinkedHashMap<String, List<Double>> combined_maps = new LinkedHashMap<String, List<Double>>();\r\n\t\t//\tLinkedHashMap<String, List<Double>> fitnessmaps = new LinkedHashMap<String, List<Double>>();\r\n\r\n\t\t\tLinkedHashMap<String, Integer> setrank1 = new LinkedHashMap<String, Integer>();\r\n\t\t\r\n\r\n\t\t\tList<String> updated_population = new ArrayList<String>();\r\n\t\t\t\r\n\t\t\tList<String> combined_population = new ArrayList<String>();\r\n\t\t\tList<String> offspring_population = new ArrayList<String>();\r\n\t\t\t//List<String> parent_population = new ArrayList<String>();\r\n\t\t\tList<String> single_population = new ArrayList<String>();\r\n\r\n\t\t\tList<String> combined_population_list = new ArrayList<String>();\r\n\t\t\t\r\n\t\t\tList<String> temporary_path_holder = new ArrayList<String>();\r\n\t\t\t\r\n\t\t\tList<String> parents_population = new ArrayList<String>();\r\n\t\t\t\r\n\t\t\tList<String> parents_population_copy = new ArrayList<String>();\r\n\t\t\t\r\n\t\t//\tString traverse_template;\r\n\r\n\t\t\t// the 2d arrays below hold the solutions to each respective group\r\n\t\t\tint [][] solution = new int[500][R];\r\n\t\t\t\t\r\n\t\t\t\t\r\n\t\t//\tboolean [] statu = new boolean [PATHNUM];\r\n\t\t\t\t\r\n\r\n\t\t\tint totalpathcounter = 0;\r\n\r\n\t\t\tint obj_total = 0;\r\n\r\n\t\t\tString getfinalpath = null;\r\n\t\t\t//String getfinalpath;\r\n\r\n\t\t\tif (run > 0) { // in each run reset the number counter of the paths covered in each group\r\n\r\n\t\t\t\treset_All();\r\n\t\t\t\tpaths.clear();\r\n\t\t\t\tupdated_population.clear();\r\n\t\t\t\tcombined_population.clear();\r\n\t\t\t\toffspring_population.clear();\r\n\t\t\t\tsingle_population.clear();\r\n\t\t\t\toffspring_maps.clear();\r\n\t\t\t\tsetrank1.clear();\r\n\t\t\t\t//setrank2.clear();\r\n\t\t\t\t//offspring_maps.clear();\r\n\t\t\t\tparents_population_copy.clear();\r\n\t\t\t\tcombined_maps.clear();\r\n\t\t\t\tparent_maps.clear();\r\n\t\t\t\tpaths.putAll(temporay_paths); \r\n\t\t\t}\r\n\r\n\t\t\tfor (int i = 0; i < pop_num; i++) // initialize the population with the dimension of R values/inputs\r\n\t\t\t{\r\n\r\n\t\t\t\tfor (int j = 0; j < R; j++) {\r\n\t\t\t\t\r\n\t\t\t\t\tx[i][j] = (int)(Math.random()*((ub[j] - lb[j])+1))+ lb[j];\r\n\r\n\t\t\t\t} //initial random population\r\n\r\n\t\t\t\tgetfinalpath = pathnum(x[i]); \r\n\t\t\t\t//archiving( String check_path_group , int num, int[][] offspring)\r\n int pickPaths= 0;\r\n\t\t\t\t\r\n\t\t\t\tSet<String> keyz = paths.keySet();\r\n\t\t\t\t\r\n\t\t\t\t\r\n\t\t\t\tfor (String key : keyz) {\r\n\r\n\t\t\t\t\tif (pickPaths < 50) { //pick subset of N paths\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\ttarget_subset.put(key + \" \" + \"new\", false);\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tpickPaths++;\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse {\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}\r\n\r\n\t\t\t\tparents_population.add(\"parent\" + \" \" + i);\r\n\t\t\t\t//record covered path and find group where it belongs\r\n\t\t\t\t//save test case in corresponding path group\r\n\t\t\t\tarchiving( getfinalpath , i, x);\r\n\t\t\t\t\r\n\t\t\t}\r\n\r\n\t\t\tparents_population_copy.addAll(parents_population);\r\n\t\t\t\r\n\t\t\tcombined_population_list.addAll(parents_population_copy);\t\r\n\t\t\t///offspring_population.addAll(parents_population_copy);\r\n\t\t\t//Cycle[run] = 1;\r\n\r\n\t\t\t\tlong start_time = System.currentTimeMillis();\r\n\t\t\t\tlong wait_time = 1518750;\r\n\t\t\t\tlong end_time = start_time + wait_time;\r\n\t\t\t\tList<Double> temp_2 = new ArrayList<Double>();\r\n\t\t\t\t\r\n\t\t\t // int generation = 0;\r\n\t\t\t\t\r\n\t\t\t\twhile ((System.currentTimeMillis() < end_time) && obj_total < PATHNUM_NUMBER) // not exceeded the set\r\n\r\n\t\t\t\t{\r\n\t\t\t\t//LinkedHashMap<String, List<Double>> parent_maps_init = new LinkedHashMap<String, List<Double>>(); \r\n\t\t\t\t//initial random population tournament selection\r\n\t\t\t\r\n\t\t\t\t\t//List<Double> temp = new ArrayList<Double>();\r\n\t\t\t\t\tif (crossover_count == 0) {\r\n\t\t\t\t\t\t\r\n\t\t\t\t\tRandom random = new Random();\r\n\t\t\t\r\n\t\t\t\t\t\r\n\t\t\t\t\tfor (int i = 0; i < 25; i++) {\r\n\t\t\t\t\r\n\t\t\t\t\t\t//pick two parents to cross\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tString randomKey_1 = parents_population_copy.get( random.nextInt(parents_population_copy.size())) ;\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tparents_population_copy.remove(randomKey_1);\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tString randomKey_2 = parents_population_copy.get( random.nextInt(parents_population_copy.size())) ;\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tparents_population_copy.remove(randomKey_2);\r\n\t\t\t\t\t\t//access parent via parent_maps_init\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t//split the string\r\n\t\t\t\t\t\t//parents_population.add(\"parent\" + \" \" + i);\r\n\t\t\t\t\t\tString [] parent_1_string = randomKey_1.split(\" \");\t\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tString par_1;\r\n\r\n\t\t\t\t\t\tint pos_1;\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tpar_1 = parent_1_string[0];\r\n\t\t\t\t\t\tpos_1 = Integer.parseInt(parent_1_string[1]);\r\n\t\t\t\t\t\t\r\n // String [] parent_2_string = randomKey_2.split(\" \");\t\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tString [] parent_2_string = randomKey_1.split(\" \");\t\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tString par_2;\r\n\r\n\t\t\t\t\t\tint pos_2;\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tpar_2 = parent_2_string[0];\r\n\t\t\t\t\t\tpos_2 = Integer.parseInt(parent_2_string[1]);\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t //System.out.println(\"Random number 1 : \"+Math.random()\r\n\t\t\t\t\t\t//crossover nbased on probability\r\n\t\t\t\t \tRandom rand = new Random();\r\n\t\t\t\t\t//\tdouble rdm = rand.nextDouble();\t\t \r\n\t\t\t\t\t\tdouble rdm = Math.random();\r\n\t\t\t\t\t\t if(rdm < 0.75) {\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t//single-point crossover\r\n\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t \t//randomly find a position and exchange the tails\r\n\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\tint parent_1_random = rand.nextInt(R);\r\n\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t int new_point = parent_1_random; \r\n\t\t\t\t\t\t //exchange elements with parent_2\r\n\t\t\t\t\t\t \r\n\t\t\t\t\t\t //\tint[][] temporal = new int[pop_num][R];\r\n\t\t\t\t\t\t \r\n\t\t\t\t\t\t for (int j = 0 ; j < R; j++) {\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 \tv[pos_1][j] = x[pos_1][j];\r\n\t\t\t\t\t\t \tv[pos_2][j] = x[pos_2][j];\r\n\t\t\t\t\t \t\t\r\n\t\t\t\t\t \t}\r\n\t\t\t\t\t \t\r\n\t\t\t\t\t\t int g = new_point;\r\n\t\t\t\t\t\t \r\n\t\t\t\t\t\t // for (int g = new_point ; new_point < R; new_point++) {\r\n\t\t\t\t\t \t\t\r\n\t\t\t\t\t \twhile (g <= R){\t\r\n\t\t\t\t\t \t\t//switch the tails of parent one and parent two\r\n\t\t\t\t\t\t \tv[pos_1][g] = x[pos_2][g];\r\n\t\t\t\t\t\t \tv[pos_2][g] = x[pos_1][g];\r\n\r\n\t\t\t\t\t \t g++;\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\tdouble mutate = Math.random();\r\n\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t if(mutate < (1/R)) { \r\n\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t int child_1 = (int) (Math.random() * R);\r\n\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t \tint child_2 = (int) (Math.random() * R);\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 \tv[pos_1][child_1] = (int)(Math.random()*((ub[child_1] - lb[child_1])+1))+ lb[child_1];\r\n\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t \toffspring_population.add(\"child\" + \" \" + pos_1);\r\n\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t \tv[pos_2][child_2] = (int)(Math.random()*((ub[child_2] - lb[child_2])+1))+ lb[child_2]; \r\n\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t \toffspring_population.add(\"child\" + \" \" + pos_2);\r\n\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t }\r\n\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t else {\r\n\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t offspring_population.add(\"child\" + \" \" + pos_1);\r\n\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t offspring_population.add(\"child\" + \" \" + pos_2);\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\t }\r\n\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 \t\r\n\t\t\t\t\t \t\tfor (int j = 0 ; j < R; j++) {\r\n\t\t\t\t\t\t \t\t\r\n\t\t\t\t\t\t \t\t\r\n\t\t\t\t\t\t \t\tv[pos_1][j] = x[pos_1][j];\r\n\t\t\t\t\t\t \t\tv[pos_2][j] = x[pos_2][j];\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\t\r\n\t\t\t\t\t \t\t\r\n\t\t\t\t\t \t\t//mutate\r\n\t\t\t\t\t \t\t\r\n\r\n\t\t\t\t\t \t// Random mut = new Random();\r\n\t\t\t\t\t\t\t\tdouble mutate = Math.random();\r\n\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t if(mutate < (1/R)) { \r\n\t\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t int child_1 = (int) (Math.random() * R);\r\n\t\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t\t \tint child_2 = (int) (Math.random() * R);\r\n\t\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t\t \tv[pos_1][child_1] = (int)(Math.random()*((ub[child_1] - lb[child_1])+1))+ lb[child_1];\r\n\t\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t\t \toffspring_population.add(\"child\" + \" \" + pos_1);\r\n\t\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t\t \tv[pos_2][child_2] = (int)(Math.random()*((ub[child_2] - lb[child_2])+1))+ lb[child_2]; \r\n\t\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t\t \toffspring_population.add(\"child\" + \" \" + pos_2);\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\t\t }\r\n\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t \t\t\r\n\t\t\t\t\t\t }\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t\r\n //mutation (1/size of test case input vector)\r\n\t\r\n\t\t\t\t\t}\r\n\t\t\t\t\t//get path traversed by offsprings\r\n\t\t\t\t \r\n\t\t\t\t\t\r\n\t\t\t\t\tfor (int i = 0; i < offspring_population.size(); i++) {// initialize the population with the dimension of R values/inputs\r\n\t\t\t\t\r\n\t\t\t\t String [] get_index = offspring_population.get(i).split(\" \");\t\r\n\t\t\t\t\t\t\r\n\t\t\t\t String off_1;\r\n\r\n\t\t\t\t\tint index_1;\r\n\t\t\t\t\t\r\n\t\t\t\t\t\r\n\t\t\t\t\toff_1 = get_index[0];\r\n\t\t\t\t\tindex_1 = Integer.parseInt(get_index[1]);\t\r\n\t\t\t\t\t\r\n\t\t\t\t\tgetfinalpath = pathnum(v[index_1]);\r\n\t\t\t\t\t\r\n\t\t\t\t\r\n\t\t\t\t\tarchiving( getfinalpath , index_1, v);\r\n\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\t}\r\n\t\t\t\t\t\r\n\t\t\t\telse {\r\n\t\t\t\t\t \r\n\t\t\t\t\t\r\n\t\t\t\t\t // if ()\r\n\t\t\t\t\t\r\n\t\t\t\t \t\tRandom random = new Random();\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t//\tLinkedHashMap<String, Boolean> changed_status = new LinkedHashMap<String, Boolean>();\r\n\t\t\t\t\t\t\t//\tLinkedHashMap<String, Boolean> child_status = new LinkedHashMap<String, Boolean>();\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t \t\tparents_population_copy.clear();\r\n\t\t\t\t \t\tfor (int i = 0; i < 50; i++) {\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tparents_population_copy.add( \"parent\" + \" \" + i);\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\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\t\tfor (int i = 0; i < 25; i++) {\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\tString randomKey_1 = parents_population_copy.get( random.nextInt(parents_population_copy.size())) ;\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\tparents_population_copy.remove(randomKey_1);\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\tString randomKey_2 = parents_population_copy.get( random.nextInt(parents_population_copy.size())) ;\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\tparents_population_copy.remove(randomKey_2);\r\n\t\t\t\t\t\t\t\t\t//access parent via parent_maps_init\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t//split the string\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\tString [] parent_1_string = randomKey_1.split(\" \");\t\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\tString par_1;\r\n\r\n\t\t\t\t\t\t\t\t\tint pos_1;\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\tpar_1 = parent_1_string[0];\r\n\t\t\t\t\t\t\t\t\tpos_1 = Integer.parseInt(parent_1_string[1]);\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t // String [] parent_2_string = randomKey_2.split(\" \");\t\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\tString par_2;\r\n\r\n\t\t\t\t\t\t\t\t\tint pos_2;\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\tString [] parent_2_string = randomKey_2.split(\" \");\r\n\t\t\t\t\t\t\t\t\tpar_2 = parent_2_string[0];\r\n\t\t\t\t\t\t\t\t\tpos_2 = Integer.parseInt(parent_2_string[1]);\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t//crossover nbased on probability\r\n\t\t\t\t\t\t\t\t\tRandom rand = new Random();\r\n\t\t\t\t\t\t\t\t\tdouble rdm = Math.random();\t\t \r\n\t\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t\t if(rdm < 0.75) {\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t//single-point crossover\r\n\t\t\t\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t\t\t\t \t//randomly find a position nad exchange the tails\r\n\t\t\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t\t\tint parent_1_random = rand.nextInt(R);\r\n\t\t\t\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t\t\t\t int single_point = parent_1_random; \r\n\t\t\t\t\t\t\t\t\t //exchange elements with parent_2\r\n\t\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t\t //\tint[][] temporal = new int[pop_num][R];\r\n\t\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t\t for (int j = 0 ; j < R; j++) {\r\n\t\t\t\t\t\t\t\t \t\t\r\n\t\t\t\t\t\t\t\t \t\t\r\n\t\t\t\t\t\t\t\t\t \tv[pos_1][j] = x[pos_1][j];\r\n\t\t\t\t\t\t\t\t\t \tv[pos_2][j] = x[pos_2][j];\r\n\t\t\t\t\t\t\t\t \t\t\r\n\t\t\t\t\t\t\t\t \t}\r\n\t\t\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t\t\t\t int s = single_point;\r\n\t\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t\t while (s <= R) {\r\n\t\t\t\t\t\t\t\t \t\t\r\n\t\t\t\t\t\t\t\t \t\t\r\n\t\t\t\t\t\t\t\t \t\t//switch the tails of parent one and parent two\r\n\t\t\t\t\t\t\t\t\t \tv[pos_1][s] = x[pos_2][s];\r\n\t\t\t\t\t\t\t\t\t \tv[pos_2][s] = x[pos_1][s];\r\n\r\n\t\t\t\t\t\t\t\t \t s++;\r\n\t\t\t\t\t\t\t\t \t}\r\n\t\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t \t Random mut = new Random();\r\n\t\t\t\t\t\t\t\t\t\tdouble mutate = Math.random();\r\n\t\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t\t\t if(mutate < (1/R)) { \r\n\t\t\t\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t int child_1 = (int) (Math.random() * R);\r\n\t\t\t\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t\t\t\t \tint child_2 = (int) (Math.random() * R);\r\n\t\t\t\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t\t\t\t \tv[pos_1][child_1] = (int)(Math.random()*((ub[child_1] - lb[child_1])+1))+ lb[child_1];\r\n\t\t\t\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t\t\t\t \toffspring_population.add(\"child\" + \" \" + pos_1);\r\n\t\t\t\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t\t\t\t \tv[pos_2][child_2] = (int)(Math.random()*((ub[child_2] - lb[child_2])+1))+ lb[child_2]; \r\n\t\t\t\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t\t\t\t \toffspring_population.add(\"child\" + \" \" + pos_2);\r\n\t\t\t\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t\t\t }\r\n\t\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t\t\t else {\r\n\t\t\t\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t\t\t\t offspring_population.add(\"child\" + \" \" + pos_1);\r\n\t\t\t\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t\t\t\t offspring_population.add(\"child\" + \" \" + pos_2);\r\n\t\t\t\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t\t\t }\r\n\t\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t\t }\r\n\t\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t\telse {\r\n\t\t\t\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t\t\t \t\tfor (int j = 0 ; j < R; j++) {\r\n\t\t\t\t\t\t\t\t\t \t\t\r\n\t\t\t\t\t\t\t\t\t \t\t\r\n\t\t\t\t\t\t\t\t\t \t\tv[pos_1][j] = x[pos_1][j];\r\n\t\t\t\t\t\t\t\t\t \t\tv[pos_2][j] = x[pos_2][j];\r\n\t\t\t\t\t\t\t\t\t \t\t\r\n\t\t\t\t\t\t\t\t\t \t}\r\n\t\t\t\t\t\t\t\t \t\t\r\n\t\t\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t\t\t\t\t\tdouble mutate = Math.random();\r\n\t\t\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t\t\t\t if(mutate < (1/R)) { \r\n\t\t\t\t\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\t\t\t int child_1 = (int) (Math.random() * R);\r\n\t\t\t\t\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t\t\t\t\t \tint child_2 = (int) (Math.random() * R);\r\n\t\t\t\t\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t\t\t\t\t \tv[pos_1][child_1] = (int)(Math.random()*((ub[child_1] - lb[child_1])+1))+ lb[child_1];\r\n\t\t\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t\t\t \toffspring_population.add(\"child\" + \" \" + pos_1);\r\n\t\t\t\t\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t\t\t\t\t \tv[pos_2][child_2] = (int)(Math.random()*((ub[child_2] - lb[child_2])+1))+ lb[child_2]; \r\n\t\t\t\t\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t\t\t\t\t \toffspring_population.add(\"child\" + \" \" + pos_2);\r\n\t\t\t\t\t\t\t\t\t\t \t\r\n\t\t\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t\t\t\t }\r\n\t\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t \t}\r\n\t\t\t\r\n\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_ < offspring_population.size(); i_++) {// initialize the population with the dimension of R values/inputs\r\n\t\t\t\t\t\r\n\t\t\t\t\t String [] get_index = offspring_population.get(i_).split(\"\");\t\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t String off_1;\r\n\r\n\t\t\t\t\t\tint index_1;\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\toff_1 = get_index[0];\r\n\t\t\t\t\t\tindex_1 = Integer.parseInt(get_index[1]);\t\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t \r\n\t\t\t\t\t\tgetfinalpath = pathnum(v[index_1]); //get path traversed by offspring test case \r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tarchiving( getfinalpath , i_, v);//add test case to archive\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 //match the paths traversed\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}\r\n\t\t\t\t}\t\r\n\t\t\t\t\tcrossover_count++;\r\n\t\t\t\t\r\n\t\t\t\t\t//combined_population_list.addAll(parents_population_copy);\r\n\t\t\t\t\t\r\n\t\t\t\t\t\r\n\t\t\t\t\tfor (int i = 0; i < offspring_population.size(); i++) // add all offpsings to parent and form final combined population\r\n\t\t\t\t\t{\r\n\t\t\t\r\n\t\t\t\t\t\t\tcombined_population_list.add(offspring_population.get(i));\r\n\t\t\t\t }\r\n\t\t\t\t\t\t\r\n\t\t\t\t\tList<String> final_combined_population = new ArrayList<String>();\r\n\r\n\t\t\t\t\t// temp.clear();\r\n\r\n\t\t\t\t\tfinal_combined_population.addAll(combined_population_list);\t\r\n\t\t\t\t\t\r\n\t\t\t\t//fit.add(target_path_+ \" \" + path_status +\" \" + nonsimple_unmatched2);\r\n\t\t\t\t//evaluate parent and child population\r\n\t\t\t\t\tArrayList <String> offspring_fitness = new ArrayList<String>();\r\n\t\t\t\t\t\r\n\t\t\t\t\tfor (int i = 0; i < final_combined_population.size(); i++) // contains both parent and offspring test cases\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\r\n String checkString = final_combined_population.get(i);\t\r\n \r\n String [] getType = checkString.split(\" \");\r\n \r\n\t\t\t\t\t\tString typeName = getType[0];\r\n\r\n\t\t\t\t\t\tint typeId = Integer.parseInt(getType[1]);\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t//\tfit.add(target_path_+ \" \" + path_status +\" \" + nonsimple_unmatched2);\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tif (typeName.equals(\"parent\")) {\r\n\r\n\t\t\t\t\t \toffspring_fitness = benchmarkfunction(x[typeId]);\r\n\t\t\t\t\t \t//extract path and fitness\r\n\t\t\t\t\t \tcheck_fitness.put( \"parent\" + \" \" + typeId , offspring_fitness);\r\n\t\t\t\t\t \t\r\n\t\t\t\t\t \t//static LinkedHashMap<String, ArrayList<String>> check_fitness = new LinkedHashMap<String, ArrayList<String>>();\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 \r\n\t\t\t\t\t\telse {\r\n//\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t//fit.add(target_path_+ \" \" + path_status +\" \" + nonsimple_unmatched2);\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\toffspring_fitness = benchmarkfunction(v[typeId]);\r\n\t\t\t\t\t\t\tcheck_fitness.put( \"child\" + \" \" + typeId , offspring_fitness);\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t\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}\r\n\t\t\t\t\t\r\n\t\t\t\t\tint colum_sizes = 0;\r\n\t\t\t\t\t\r\n\t\t\t\t\tfor ( String get_keys : check_fitness.keySet() ) {\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\tcolum_sizes = ( check_fitness.get(get_keys).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\tbreak;\r\n\t\t\t\t\t}\r\n\t\t\t\t\t//process remove_objective_routine\r\n\t\t\t\t\t//process map first\r\n\t\t\t\t\t//static LinkedHashMap<String, ArrayList<String>> check_fitness = new LinkedHashMap<String, ArrayList<String>>();\r\n\t\t\t\t\tList<String> average_calculator = new ArrayList<String>();\r\n\t\t\t\t\t\r\n\t\t\t\t//\tint offspring_fitness_size = offspring_fitness.size();\r\n\t\t\t\t\r\n\t\t\t\t//\tIterator<Map.Entry<String, ArrayList<String>>> iteration_ = check_fitness.entrySet()\r\n\t\t\t\t\t\t\t//.iterator();\r\n\t\t\t\t\tString actualpath = \"\";\r\n\t\t\t\t\tString process_1 = \"\";\r\n\t\t\t\t\tString process_2 = \"\";\r\n\t\t\t\t\t\r\n\t\t\t\t\t//String updated_value_2 = \"\";\r\n\t\t\t\t\t//\"child\" + \" \" + typeId , offspring_fitness\r\n\t\t\t\t\t//String updated_value = \"\";\r\n\t\t\t\t\t\r\n//\t\t\t\t\tfit.add(target_path_+ \" \" + path_status +\" \" + nonsimple_unmatched2);\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\tint pid = 0;\t\t\r\n\t\t\t\t\t\r\n\t\t\tfor (int i = 0 ; i < colum_sizes; i++ )\t{\r\n\t\t\t\t\t\r\n\t\t\t\tdouble add_objective_scores = 0.0;\r\n\t\t\t\tdouble sum_at_column = 0.0;\r\n\r\n\t\t\t\tfor ( String get_keys : check_fitness.keySet() ) {\t\r\n\t\t\t\t\t\r\n\t\t\t\t\t\r\n // int pid = 0;\r\n \r\n\t\t\t\t\t\t//Map.Entry<String, ArrayList<String>> entry = iteration_.next();\r\n\r\n\t\t\t\t\t\taverage_calculator = check_fitness.get(get_keys);\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t//entry.getValue();\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tString get_objective_score = average_calculator.get(i);\r\n\t\t\t \r\n\t\t\t //calculate average fitness\r\n\t\t\t \r\n\t\t\t\t\t\t//\tupdated_population.add(entry.getKey());\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t//50 is the number of test cases\r\n\t\t\t\t\t\t//while (pid < 50) {\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t///String checkString = final_combined_population.get(i);\t\r\n\t \r\n\t String [] getDetails = get_objective_score.split(\" \");\r\n\t\t\t\t\t\t actualpath = getDetails[0];\r\n double objective_scores = Double.parseDouble(getDetails[1]);\r\n \r\n add_objective_scores = add_objective_scores + objective_scores ;\r\n \r\n //total fitness at colum i\r\n sum_at_column = (add_objective_scores / check_fitness.size());\r\n //get total fitness \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//int old_value = remove_objective[actualpath]\r\n\t\t\t\t\t//if(remove_objective.contiansKey(actualpath))\r\n\t\t\t\t\t\r\n\t\t\t\r\n\t\t\t\t\tfor ( String entry_1 : target_subset.keySet() ) {\t//update path status\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\r\n\t\t\t\t\t\tif (entry_1.equals(actualpath)) {\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\t String [] processPath = actualpath.split(\" \");\r\n\t\t\t\t\t\t\t process_1 = processPath[0];\r\n\t\t\t\t\t\t\t process_2 = processPath[1];\r\n\t\t\t\t\t\t\t \r\n\t //Double objective_scores = Double.parseDouble(getDetails[1]);\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tif (process_2.equals(\"new\")) {\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\ttarget_subset.put(process_1 + \" \" + \"old\" , false );\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\tremove_objective.put( actualpath, sum_at_column);\r\n\t\t\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\t\r\n\t\t\t\t\t\t\telse {\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t//remove_objective.put( actualpath, max_1 + \" \" + add_objective_scores );\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tdouble previous_value = remove_objective.get(actualpath);\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t//double get_First = Double.parseDouble(get_Path[0]);\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t//double get_Second = Double.parseDouble(get_Path[1]);\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tif ( previous_value > sum_at_column ) {\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\tremove_objective.put( actualpath, sum_at_column);\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\telse {\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t// Update status to true\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\ttemporary_path_holder.add(actualpath); \r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\tpaths.put(actualpath, true);\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\ttarget_subset.remove(actualpath);\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t//\r\n\t\t\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\t\t\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\tArrayList<String> remove_objectives_1 = new ArrayList<String>();\r\n\t\t\t\r\n\t\t\tfor ( String entry_2 : check_fitness.keySet() ) {\t//process test case // update their fitness vectors by deleting the removed objectives\r\n\t\t\t\t\r\n\t\t\t\r\n\t\t\t\tString [] process_to_remove = entry_2.split(\" \");\r\n\t\t\t\t\r\n\t\t\t\tString processes_1 = process_to_remove[0];\r\n\t\t\t\tint index_2 = Integer.parseInt(process_to_remove[1]);\r\n\t\t\t\t\r\n\t\t\t\tremove_objectives_1 = check_fitness.get(entry_2);\r\n\t\t\t\t\r\n\t\t\t\tfor (int i = 0; i < remove_objectives_1.size(); i++) // process the fitness vector and delete the worst values\r\n\t\t\t\t{\r\n\t\t\t\t\t//fit.add(target_path_+ \" \" + path_status +\" \" + nonsimple_unmatched2);\r\n\t\t\t\t\t\r\n\t\t\t\t\t//target_subset.remove(actualpath);\r\n\t\t\t\t\t//temporary_path_holder.add(actualpath); \r\n\t\t\t\t\t\r\n\t\t\t\t\tString [] process_paths_to_remove = remove_objectives_1.get(i).split(\" \");\r\n\t\t\t\t\t\r\n\t\t\t\t\tString process_path_1 = process_paths_to_remove[0];\r\n\t\t\t\t\t\r\n\t\t\t\t\tif (temporary_path_holder.contains(process_path_1) ) {\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tremove_objectives_1.remove(process_path_1);\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}\r\n\t\t\t\t\r\n\t\t\t\tcheck_fitness.put( processes_1 + \" \" + index_2, remove_objectives_1);\r\n\t\t\t\t\r\n\t\t\t\tremove_objectives_1.clear( );\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t\r\n\t\t\t//target_subset.put(process_1 + \" \" + \"old\" , false );\r\n\t\t\t\r\n\t\t\t Set<String> remainingPath = target_subset.keySet();\r\n\t\t\t\r\n\t\t\t\r\n\t\t\t\t\tfor (String keyss : remainingPath) {\r\n\t\t\t\r\n\t\t\t\r\n\t\t\t\t\t\t String [] get_Remaining = keyss.split(\" \");\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t String remaining_1 = get_Remaining[0];\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t still_remaining_targets.add(remaining_1); //back-up set of remaining targets\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 \r\n\t\t\t\t\t\r\n\t\t\t\tif (target_subset.size()!=0)\t{\r\n\t\t\t\t\t\r\n\t\t\t\t\ttry {\r\n\t\t\t\t\t\tif ((obj_total) == PATHNUM_NUMBER ) { // if all paths covered break out of while loop\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\r\n\t\t\t\t if ((obj_total) < PATHNUM_NUMBER ) { // if not all paths covered perform\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t if ((target_subset.size() == 1)) { \r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t \t\r\n\t\t\t\t \t LinkedHashMap<String, ArrayList<Double>> updated_maps_ = new LinkedHashMap<String, ArrayList<Double>>();\r\n\t\t\t\t \t\r\n\t\t\t\t\t ArrayList<String> updated_fit_ = new ArrayList<String>();\t\r\n\t\t\t\t\t \r\n\t\t\t\t\t ArrayList<Double> updated_1 = new ArrayList<Double>();\r\n\t\t\t\t\t \t\r\n\t\t\t\t\t \tfor ( String key_10 : check_fitness.keySet() ) {\r\n\t\t\t\t\t\t\t \t\t\r\n\t\t\t\t\t\t\t \t\t\r\n\t\t\t\t\t \t\tupdated_fit_ = check_fitness.get(key_10);\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\tfor (int r= 0; r < updated_fit_.size(); r++) {\r\n\t\t\t\t\t \t\t\r\n\t\t\t\t\t \t\r\n\t\t\t\t\t\t\t\t\t String [] get_list = updated_fit_.get(r).split(\" \");\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t double objective_score = Double.parseDouble(get_list[2]);\r\n\t\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t\t updated_1.add(objective_score);\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\tupdated_maps_.put(key_10, updated_1);\r\n\t\t\t\t\t \t\t\r\n\t\t\t\t\t \t\tupdated_fit_.clear();\r\n\t\t\t\t\t \t\t\r\n\t\t\t\t\t \t\tupdated_1.clear();\r\n\t\t\t\t\t \t\r\n\t\t\t\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 \tint counter = 0;\r\n\t\t\t\t\t\t\twhile (counter < 50) {\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t List<Double> value_holder = new ArrayList<Double>();\r\n\t\t\t\t\t\t\t\t List<String> keys = new ArrayList<String>(updated_maps_.keySet());\r\n\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t Random rand = new Random();\r\n\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t String key_ss = keys.get(rand.nextInt(keys.size()));\r\n\t\t\t\t\t\t\t\t String key_holder = null;\r\n\t\t\t\t\t\t\t\t value_holder.addAll(updated_maps_.get(key_ss));\r\n\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t double min = value_holder.get(0);\r\n\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t value_holder.clear();\r\n\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t for (int i = 1 ; i < 10; i++) {\r\n\t\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t String key = keys.get(rand.nextInt(keys.size()));\r\n\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t value_holder.addAll(updated_maps_.get(key));\r\n\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t double checker = value_holder.get(0);\r\n\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t if (checker < min) {\r\n\t\t\t\t\t\t min = checker;\r\n\t\t\t\t\t\t key_holder = key;\r\n\t\t\t\t\t\t \r\n\t\t\t\t\t\t }\r\n\t\t\t\t\t\t\t\t value_holder.clear();\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t parents_population_copy.add(key_holder);\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\r\n\t\t\t\t \t\r\n\t\t\t\t\t\r\n\t\t\t\t\t statusChecker = true;\r\n\t\t\t\t }//if only one uncovered path\r\n\t\t\t\t\t\t\r\n\t\t\t\t else { \r\n\t\t\t\t\t if (target_subset.size() > 1) { //if many remaining uncovered paths\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t LinkedHashMap<String, ArrayList<Double>> updated_maps = new LinkedHashMap<String, ArrayList<Double>>();\r\n\t\t\t\t\t \t\r\n\t\t\t\t\t ArrayList<String> updated_fit = new ArrayList<String>();\t\r\n\t\t\t\t\t \r\n\t\t\t\t\t ArrayList<Double> updated_ = new ArrayList<Double>();\r\n\t\t\t\t\t \t\r\n\t\t\t\t\t \tfor ( String key_10 : check_fitness.keySet() ) {\r\n\t\t\t\t\t\t\t \t\t\r\n\t\t\t\t\t\t\t \t\t\r\n\t\t\t\t\t \t\tupdated_fit = check_fitness.get(key_10);\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\tfor (int r= 0; r < updated_fit.size(); r++) {\r\n\t\t\t\t\t \t\t\r\n\t\t\t\t\t \t\r\n\t\t\t\t\t\t\t\t\t String [] get_list = updated_fit.get(r).split(\" \");\r\n\t\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\t\t double objective_score = Double.parseDouble(get_list[2]);\r\n\t\t\t\t\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t\t updated_.add(objective_score);\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\tupdated_maps.put(key_10, updated_);\r\n\t\t\t\t\t \t\t\r\n\t\t\t\t\t \t\tupdated_fit.clear();\r\n\t\t\t\t\t \t\t\r\n\t\t\t\t\t \t\tupdated_.clear();\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\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 //updated_maps.put(key_10, updated_); perform preference sorting on this map\r\n\t\t\t\t\t \t\r\n\t\t\t\t\t \tint updated_sizes = 0;\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tfor ( String get_keys : updated_maps.keySet() ) {\t\r\n\t\t\t\t\t\t\t\t\t updated_sizes = ( updated_maps.get(get_keys).size());\r\n\t\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t\t} \t\r\n\t\t\t\t\t \r\n\t\t\t\t\t\t\t\t\r\n\r\n\t\t\t\t\t\t\tDouble[][] offspring_fitness_full = new Double[final_combined_population\r\n\t\t\t\t\t\t\t\t\t.size()][updated_sizes]; // n x m matrix of combined parents and offspring test cases\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tint updates = 0;\r\n\r\n\t\t\t\t\t\t\t// List<String> traverse_group = new ArrayList<String>();\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t//List<String> best_column = new ArrayList<String>();\r\n\t\t\t\t\t\t\tint fitss = 0;\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\twhile (updates < final_combined_population.size()) {\r\n\r\n\t\t\t\t\t\t\t\tList<Double> fitness_objectives_updated = new ArrayList<Double>();\r\n\t\t\t\t\t\t\t\t// fitness_objectives_updated.clear();\r\n\r\n\t\t\t\t\t\t\t\tfitness_objectives_updated = (updated_maps.get(final_combined_population.get(updates)));\r\n\t\t\t\t\t\t\t\t\r\n\r\n\t\t\t\t\t\t\t\tList<Double> temp_3 = new ArrayList<Double>();\r\n\r\n\t\t\t\t\t\t\t\t// temp.clear();\r\n\r\n\t\t\t\t\t\t\t\ttemp_3.addAll(fitness_objectives_updated);\r\n\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tfor (int ups = 0; ups < temp_3.size(); ups++) {\r\n\r\n\t\t\t\t\t\t\t\t\toffspring_fitness_full[updates][ups] = fitness_objectives_updated.get(ups);\r\n\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\tfitness_objectives_updated.clear();\r\n\t\t\t\t\t\t\t\tupdates++;\r\n\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\r\n\t\t\t\t\t \t//check if paths is covered , plus check replaced status\r\n\t\t\t \t// average objective score calculation.....\r\n\t\t\t\t\t\t\t// removing objectives\r\n\t\t\t\t\t\t\t// check current generation vs previous generation\r\n\t\t\t \t// update replaced status in main set of uncovered paths\r\n\t\t\t \r\n\t\t\t \t\r\n\t\t\t \t// update population by replacing the other targets\r\n\t\t\t \t\r\n\t\t\t \t\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tList<String> best_column = new ArrayList<String>();\r\n\t\t\t\t\r\n\t\t\t\t\t\t\tint sizes = temp_2.size();\r\n\r\n\t\t\t\t\t\t\t//double row_fit;\r\n\t\t\t\t\t\t\tint colums = 0;\r\n\t\t\t\t\t\t\tString test_case;\r\n\t\t\t\t\t\t\tdouble fit_rowfit;\r\n\t\t\t\t\t\r\n\t\t\t\t\t\t\tLinkedHashMap<String, Double> row_getter = new LinkedHashMap<String, Double>();\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\twhile (colums < sizes) {\r\n\r\n\t\t\t\t\t\t\t\tfor (int get_row = 0; get_row < (final_combined_population.size()); get_row++) {\r\n\r\n\t\t\t\t\t\t\t\t\tfit_rowfit = (offspring_fitness_full[get_row][colums]);\r\n\r\n\t\t\t\t\t\t\t\t\tdouble row_fitter = fit_rowfit;\r\n\r\n\t\t\t\t\t\t\t\t\trow_getter.put(final_combined_population.get(get_row), row_fitter);\r\n\r\n\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\tMap<String, Double> result = row_getter.entrySet().stream() //get test case with minimum objective score for each objective\r\n\t\t\t\t\t\t\t\t\t\t.sorted(Map.Entry.comparingByValue())\r\n\t\t\t\t\t\t\t\t\t\t.collect(toMap(Map.Entry::getKey, Map.Entry::getValue,\r\n\t\t\t\t\t\t\t\t\t\t\t\t(oldValue, newValue) -> oldValue, LinkedHashMap::new));\r\n\t\t\t\t\t\t\t\t// System.out.println(\"Map yino\" +result );\r\n\r\n\t\t\t\t\t\t\t\tIterator<Map.Entry<String, Double>> best_col = result.entrySet().iterator();\r\n\r\n\t\t\t\t\t\t\t\twhile (best_col.hasNext()) {\r\n\r\n\t\t\t\t\t\t\t\t\tMap.Entry<String, Double> entry = best_col.next();\r\n\r\n\t\t\t\t\t\t\t\t\ttest_case = entry.getKey();\r\n\r\n\t\t\t\t\t\t\t\t\tif (!best_column.contains(test_case)) {\r\n\r\n\t\t\t\t\t\t\t\t\t\tbest_column.add(test_case);\r\n\r\n\t\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\tresult.clear();\r\n\t\t\t\t\t\t\t\trow_getter.clear();\r\n\t\t\t\t\t\t\t\tcolums++;\r\n\r\n\t\t\t\t\t\t\t}\r\n \r\n\t\t\t\t\t\t\t//Go straight to computing crowding distance for Font 0\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tint distance_zero;\r\n\r\n\t\t\t\t\t\t\t/************************************************************************************************************************************************************/\r\n\r\n\t\t\t\t\t\t\tdouble[][] distance_matrix_zero = new double[best_column.size()][best_column.size()];\r\n\r\n\t\t\t\t\t\t\tif ((best_column.size()) > 1) {\r\n\r\n\t\t\t\t\t\t\t\tfor (int best = 0; best < (best_column.size()); best++) {\r\n\r\n\t\t\t\t\t\t\t\t\tList<Double> front_0_1 = new ArrayList<Double>();\r\n\r\n\t\t\t\t\t\t\t\t\tfront_0_1 = updated_maps.get(best_column.get(best));\r\n\r\n\t\t\t\t\t\t\t\t\tfor (int ind_d = 0; ind_d < best_column.size(); ind_d++) {\r\n\r\n\t\t\t\t\t\t\t\t\t\tif (!((best_column.get(best).equals(best_column.get(ind_d))))) {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tList<Double> front_0_2 = new ArrayList<Double>();\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tfront_0_2 = updated_maps.get(best_column.get(ind_d));\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tdistance_zero = get_count(front_0_1, front_0_2);\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tint temp_dis = distance_zero;\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tdistance_matrix_zero[best][ind_d] = temp_dis;\r\n\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\tLinkedHashMap<String, Double> setdistance_zero_2 = new LinkedHashMap<String, Double>();\r\n\r\n\t\t\t\t\t\t\t\tfor (int font_ = 0; font_ < best_column.size(); font_++) {\r\n\r\n\t\t\t\t\t\t\t\t\tdouble zeros = 0.0;\r\n\r\n\t\t\t\t\t\t\t\t\tsetdistance_zero_2.put(best_column.get(font_), zeros);\r\n\r\n\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\tfor (int font_i = 0; font_i < (best_column.size()); font_i++) {\r\n\r\n\t\t\t\t\t\t\t\t\tfor (int font_j = 0; font_j < best_column.size(); font_j++) {\r\n\r\n\t\t\t\t\t\t\t\t\t\tif (!((best_column.get(font_i).equals(best_column.get(font_j))))) {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tif (setdistance_zero_2.get(best_column\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t.get(font_i)) < distance_matrix_zero[font_i][font_j]) {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\tdouble dis = (distance_matrix_zero[font_i][font_j]);\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\tsetdistance_zero_2.put(best_column.get(font_i), dis);\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\tMap<String, Double> result = setdistance_zero_2.entrySet().stream()\r\n\t\t\t\t\t\t\t\t\t\t.sorted(Map.Entry.comparingByValue())\r\n\t\t\t\t\t\t\t\t\t\t.collect(toMap(Map.Entry::getKey, Map.Entry::getValue,\r\n\t\t\t\t\t\t\t\t\t\t\t\t(oldValue, newValue) -> oldValue, LinkedHashMap::new));\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tfor (Map.Entry<String, Double> entry : result.entrySet()) {\r\n\r\n\t\t\t\t\t\t\t\t\tif (updated_population.size() < pop_num) { //updated_population holds the selected population for next generation\r\n\t\t\t\t\t\t\t\t\t\tupdated_population.add(entry.getKey());\r\n\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\telse {\r\n\r\n\t\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\tresult.clear();\r\n\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\t\r\n\t\t\t\t\t\t\t//updated population has best performing test cases sorted in descending order\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\telse { // process the only item in the best set\r\n\r\n\t\t\t\t\t\t\t\tif (!best_column.isEmpty()) {\r\n\r\n\t\t\t\t\t\t\t\t\tString item_one = best_column.get(0);\r\n\r\n\t\t\t\t\t\t\t\t\tif (updated_population.size() < pop_num) {\r\n\r\n\t\t\t\t\t\t\t\t\t\tupdated_population.add(item_one);\r\n\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t//Establish other fonts\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tList<String> fitness_objectives_comparator = new ArrayList<String>();\r\n\t\t\t\t\t\t\t// List<Double> fitness_objectives_p = new ArrayList<Double>();\r\n\t\t\t\t\t\t\t// List<Double> fitness_objectives_q= new ArrayList<Double>();\r\n\r\n\t\t\t\t\t\t\tfor (int next_front = 0; next_front < final_combined_population.size(); next_front++) {\r\n\r\n\t\t\t\t\t\t\t\tif (!best_column.contains(final_combined_population.get(next_front))) {\r\n\r\n\t\t\t\t\t\t\t\t\tfitness_objectives_comparator.add(final_combined_population.get(next_front));\r\n\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tif ((fitness_objectives_comparator.size()) > 1) {\r\n\r\n\t\t\t\t\t\t\t\tint[] dominateMe = new int[fitness_objectives_comparator.size()];\r\n\r\n\t\t\t\t\t\t\t\t// front[i] contains the list of individuals belonging to the front i\r\n\t\t\t\t\t\t\t\t@SuppressWarnings(\"unchecked\")\r\n\t\t\t\t\t\t\t\tList<Integer>[] front = new List[(fitness_objectives_comparator.size() + 1)];\r\n\r\n\t\t\t\t\t\t\t\t// iDominate[k] contains the list of solutions dominated by k\r\n\r\n\t\t\t\t\t\t\t\t@SuppressWarnings(\"unchecked\")\r\n\t\t\t\t\t\t\t\tList<Integer>[] iDominate = new List[fitness_objectives_comparator.size()];\r\n\r\n\t\t\t\t\t\t\t\tint flagDominate;\r\n\r\n\t\t\t\t\t\t\t\tfor (int i = 0; i < ((front.length)); i++) {\r\n\t\t\t\t\t\t\t\t\tfront[i] = new LinkedList<Integer>();\r\n\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\tfor (int p = 0; p < fitness_objectives_comparator.size(); p++) {\r\n\t\t\t\t\t\t\t\t\t// Initialize the list of individuals that i dominate and the number\r\n\t\t\t\t\t\t\t\t\t// of individuals that dominate me\r\n\t\t\t\t\t\t\t\t\tiDominate[p] = new LinkedList<Integer>();\r\n\t\t\t\t\t\t\t\t\tdominateMe[p] = 0;\r\n\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t// int secondary_size =0 ;\r\n\t\t\t\t\t\t\t\tint N = fitness_objectives_comparator.size();\r\n\t\t\t\t\t\t\t\t// int[][] dominanceChecks = new int[N][N];\r\n\r\n\t\t\t\t\t\t\t\tfor (int p = 0; p < (N - 1); p++) {\r\n\r\n\t\t\t\t\t\t\t\t\tList<Double> fitness_temporary_p = new ArrayList<Double>();\r\n\r\n\t\t\t\t\t\t\t\t\tfitness_temporary_p = updated_maps.get((fitness_objectives_comparator.get(p)));\r\n\r\n\t\t\t\t\t\t\t\t\t// secondary_size = fitness_temporary_p.size();\r\n\r\n\t\t\t\t\t\t\t\t\tfor (int q = p + 1; q < N; q++) {\r\n\t\t\t\t\t\t\t\t\t\t// if (p != q) {\r\n\t\t\t\t\t\t\t\t\t\tList<Double> fitness_temporary_q = new ArrayList<Double>();\r\n\r\n\t\t\t\t\t\t\t\t\t\tfitness_temporary_q = updated_maps\r\n\t\t\t\t\t\t\t\t\t\t\t\t.get((fitness_objectives_comparator.get(q)));\r\n\r\n\t\t\t\t\t\t\t\t\t\tflagDominate = frontdominace_Comparison(fitness_temporary_p,\r\n\t\t\t\t\t\t\t\t\t\t\t\tfitness_temporary_q);\r\n\r\n\t\t\t\t\t\t\t\t\t\tif (flagDominate == -1) {\r\n\t\t\t\t\t\t\t\t\t\t\t// System.out.println(\"p---dominates>>>>>\" );\r\n\t\t\t\t\t\t\t\t\t\t\tiDominate[p].add(q);\r\n\t\t\t\t\t\t\t\t\t\t\tdominateMe[q]++;\r\n\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\telse if (flagDominate == 1) {\r\n\t\t\t\t\t\t\t\t\t\t\t// System.out.println(\"q---dominates>>>>>\" );\r\n\t\t\t\t\t\t\t\t\t\t\tiDominate[q].add(p);\r\n\t\t\t\t\t\t\t\t\t\t\tdominateMe[p]++;\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\telse {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tList<Double> fitness_temporary_qq = new ArrayList<Double>();\r\n\t\t\t\t\t\t\t\t\t\t\tList<Double> fitness_temporary_pp = new ArrayList<Double>();\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tCollections.sort(fitness_temporary_p);\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tfitness_temporary_pp.addAll(fitness_temporary_p);\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tCollections.sort(fitness_temporary_q);\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tfitness_temporary_qq.addAll(fitness_temporary_q);\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tif (fitness_temporary_pp.get(0) < fitness_temporary_qq.get(0)) {\r\n\t\t\t\t\t\t\t\t\t\t\t\t// System.out.println(\"p---dominates>>>>>\" );\r\n\t\t\t\t\t\t\t\t\t\t\t\tiDominate[p].add(q);\r\n\t\t\t\t\t\t\t\t\t\t\t\tdominateMe[q]++;\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\t\telse if (fitness_temporary_qq.get(0) < fitness_temporary_pp.get(0)) {\r\n\t\t\t\t\t\t\t\t\t\t\t\t// System.out.println(\"q---dominates>>>>>\" );\r\n\t\t\t\t\t\t\t\t\t\t\t\tiDominate[q].add(p);\r\n\t\t\t\t\t\t\t\t\t\t\t\tdominateMe[p]++;\r\n\t\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\tfor (int p = 0; p < ((fitness_objectives_comparator.size())); p++) {\r\n\r\n\t\t\t\t\t\t\t\t\tif (dominateMe[p] == 0) {\r\n\t\t\t\t\t\t\t\t\t\tfront[0].add(p);\r\n\r\n\t\t\t\t\t\t\t\t\t\t// setrank.put(Integer.parseInt(fitness_objectives_comparator.get(p)), 1);\r\n\t\t\t\t\t\t\t\t\t\tint val = 0;\r\n\t\t\t\t\t\t\t\t\t\tsetrank1.put(fitness_objectives_comparator.get(p), val);\r\n\r\n\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t}\r\n\r\n/*****************************************************************************************************************************************************************************************/\r\n\r\n\t\t\t\t\t\t\t\tint font_s = 0;\r\n\t\t\t\t\t\t\t\t// if((front[font_s].size() != 0)) {\r\n\r\n\t\t\t\t\t\t\t\tIterator<Integer> it1, it2; // Iterators\r\n\t\t\t\t\t\t\t\twhile (front[font_s].size() != 0) {\r\n\t\t\t\t\t\t\t\t\t/// System.out.println(\"we got here\" + front[font_s]);\r\n\t\t\t\t\t\t\t\t\tfont_s++;\r\n\t\t\t\t\t\t\t\t\tit1 = front[font_s - 1].iterator();\r\n\t\t\t\t\t\t\t\t\twhile (it1.hasNext()) {\r\n\t\t\t\t\t\t\t\t\t\tit2 = iDominate[(it1.next())].iterator();\r\n\t\t\t\t\t\t\t\t\t\twhile (it2.hasNext()) {\r\n\t\t\t\t\t\t\t\t\t\t\tint index = it2.next();\r\n\t\t\t\t\t\t\t\t\t\t\tdominateMe[index]--;\r\n\t\t\t\t\t\t\t\t\t\t\tif (dominateMe[index] == 0) {\r\n\t\t\t\t\t\t\t\t\t\t\t\tfront[font_s].add(index);\r\n\t\t\t\t\t\t\t\t\t\t\t\t// System.out.println(\"Block_1: \" +front[font_s]);\r\n\t\t\t\t\t\t\t\t\t\t\t\tsetrank1.put(fitness_objectives_comparator.get(index), font_s);\r\n\t\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\tLinkedHashMap<String, Double> setdistance = new LinkedHashMap<String, Double>();\r\n\r\n\t\t\t\t\t\t\t\tLinkedHashMap<String, Double> setdistance_one = new LinkedHashMap<String, Double>();\r\n\r\n\t\t\t\t\t\t\t\tMap<Integer, ArrayList<String>> reverseMap = new HashMap<>();\r\n\r\n\t\t\t\t\t\t\t\tfor (Map.Entry<String, Integer> entry : setrank1.entrySet()) {\r\n\t\t\t\t\t\t\t\t\tif (!reverseMap.containsKey(entry.getValue())) {\r\n\t\t\t\t\t\t\t\t\t\treverseMap.put(entry.getValue(), new ArrayList<>());\r\n\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\tArrayList<String> keys = reverseMap.get(entry.getValue());\r\n\t\t\t\t\t\t\t\t\tkeys.add(entry.getKey());\r\n\t\t\t\t\t\t\t\t\treverseMap.put(entry.getValue(), keys);\r\n\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t// process fonts\r\n\r\n\t\t\t\t\t\t\t\tint smaller;\r\n\t\t\t\t\t\t\t\tint smaller_one;\r\n\t\t\t\t\t\t\t//\tint remaining;\r\n\t\t\t\t\t\t\t\t// int smaller_two;\r\n\r\n\t\t\t\t\t\t\t\tint fronts = 0;\r\n\t\t\t\t\t\t\t\t// System.out.println(\"map's size\" + reverseMap.size());\r\n\t\t\t\t\t\t\t\twhile (fronts < (reverseMap.size())) {\r\n\r\n\t\t\t\t\t\t\t\t\t// if (updated_population.size()== pop_num) {\r\n\t\t\t\t\t\t\t\t\t// break;\r\n\t\t\t\t\t\t\t\t\t// }\r\n\r\n\t\t\t\t\t\t\t\t\tif (fronts != (reverseMap.size() - 1)) {\r\n\r\n\t\t\t\t\t\t\t\t\t\tList<String> front_list = new ArrayList<String>();\r\n\r\n\t\t\t\t\t\t\t\t\t\tfront_list = reverseMap.get(fronts);\r\n\r\n\t\t\t\t\t\t\t\t\t\tif ((front_list.size()) > 1) {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tdouble[][] distance_matrix = new double[front_list.size()][front_list\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t.size()];\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tfor (int ind_d = 0; ind_d < (front_list.size()); ind_d++) {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\tList<Double> front_getter1 = new ArrayList<Double>();\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\tfront_getter1 = updated_maps.get((front_list.get(ind_d)));\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\tfor (int d = 0; d < front_list.size(); d++) {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\t\tif (!(front_list.get(ind_d).equals(front_list.get(d)))) {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tList<Double> front_getter2 = new ArrayList<Double>();\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tfront_getter2 = updated_maps.get((front_list.get(d)));\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tsmaller = get_count(front_getter1, front_getter2);\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tint sma = smaller;\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tdistance_matrix[ind_d][d] = sma;\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tfor (int font_ = 0; font_ < front_list.size(); font_++) {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\tdouble valz = 0.0;\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\tsetdistance.put(front_list.get(font_), valz);\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t// all distances set\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tfor (int font_i = 0; font_i < (front_list.size()); font_i++) {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\t// distance_matrix\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\tfor (int font_j = 0; font_j < front_list.size(); font_j++) {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\t\tif (!(front_list.get(font_i).equals(front_list.get(font_j)))) {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tif (setdistance.get(front_list\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t.get(font_i)) < distance_matrix[font_i][font_j]) {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tdouble dist = (distance_matrix[font_i][font_j]);\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\tsetdistance.put(front_list.get(font_i), dist);\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tMap<String, Double> result = setdistance.entrySet().stream()\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t.sorted(Map.Entry.comparingByValue())\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t.collect(toMap(Map.Entry::getKey, Map.Entry::getValue,\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t(oldValue, newValue) -> oldValue, LinkedHashMap::new));\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tIterator<Map.Entry<String, Double>> iteration = result.entrySet()\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t.iterator();\r\n\r\n\t\t\t\t\t\t\t\t\t\t\twhile (iteration.hasNext()) {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\tMap.Entry<String, Double> entry = iteration.next();\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\tif (updated_population.size() < pop_num) {\r\n\t\t\t\t\t\t\t\t\t\t\t\t\tupdated_population.add(entry.getKey());\r\n\t\t\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\telse {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tresult.clear();\r\n\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\telse {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tString best_1;\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tbest_1 = front_list.get(0);\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tif (updated_population.size() < (pop_num)) {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\tupdated_population.add(best_1);\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\tif (fronts == (reverseMap.size() - 1)) {\r\n\r\n\t\t\t\t\t\t\t\t\t\tList<String> front_list_one = new ArrayList<String>();\r\n\r\n\t\t\t\t\t\t\t\t\t\tfront_list_one = reverseMap.get(reverseMap.size() - 1);\r\n\r\n\t\t\t\t\t\t\t\t\t\t// System.out.println(\"hahahq\" +front_list_one);\r\n\r\n\t\t\t\t\t\t\t\t\t\tdouble[][] distance_matrix_one = new double[front_list_one\r\n\t\t\t\t\t\t\t\t\t\t\t\t.size()][front_list_one.size()];\r\n\r\n\t\t\t\t\t\t\t\t\t\tfor (int ind_w = 0; ind_w < (front_list_one.size()); ind_w++) {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tList<Double> front_getter_one = new ArrayList<Double>();\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tfront_getter_one = updated_maps.get((front_list_one.get(ind_w)));\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tfor (int dw = 0; dw < front_list_one.size(); dw++) {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\tif (!(front_list_one.get(ind_w).equals(front_list_one.get(dw)))) {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\t\tList<Double> front_getter_two = new ArrayList<Double>();\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\t\tfront_getter_two = updated_maps.get((front_list_one.get(dw)));\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\t\tsmaller_one = get_count(front_getter_one, front_getter_two);\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\t\tint sm = smaller_one;\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\t\tdistance_matrix_one[ind_w][dw] = sm;\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\tfor (int font_ = 0; font_ < front_list_one.size(); font_++) {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tdouble dit = 0.0;\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tsetdistance_one.put(front_list_one.get(font_), dit);\r\n\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\t// all distances set\r\n\r\n\t\t\t\t\t\t\t\t\t\tfor (int font_i = 0; font_i < (front_list_one.size()); font_i++) {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tfor (int font_j = 0; font_j < front_list_one.size(); font_j++) {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\tif (!(front_list_one.get(font_i)\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t.equals(front_list_one.get(font_j)))) {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\t\tif (setdistance_one.get(front_list_one\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t.get(font_i)) < distance_matrix_one[font_i][font_j]) {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tdouble dst = (distance_matrix_one[font_i][font_j]);\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tsetdistance_one.put(front_list_one.get(font_i), dst);\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\tint remaining_ = (pop_num - updated_population.size());\r\n\r\n\t\t\t\t\t\t\t\t\t\tif (setdistance_one.size() <= remaining_) {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tMap<String, Double> result = setdistance_one.entrySet().stream()\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t.sorted(Map.Entry.comparingByValue())\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t.collect(toMap(Map.Entry::getKey, Map.Entry::getValue,\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t(oldValue, newValue) -> oldValue, LinkedHashMap::new));\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tIterator<Map.Entry<String, Double>> iteration = result.entrySet()\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t.iterator();\r\n\r\n\t\t\t\t\t\t\t\t\t\t\twhile (iteration.hasNext()) {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\tMap.Entry<String, Double> entry = iteration.next();\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\tif (updated_population.size() < pop_num) {\r\n\t\t\t\t\t\t\t\t\t\t\t\t\tupdated_population.add(entry.getKey());\r\n\t\t\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\telse {\r\n\t\t\t\t\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\t// System.out.println( \"remaining---\" +remaining);\r\n\t\t\t\t\t\t\t\t\t\telse {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tMap<String, Double> sortedByValueDesc = setdistance_one.entrySet()\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t.stream()\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t.sorted(Map.Entry.<String, Double>comparingByValue().reversed())\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t.collect(toMap(Map.Entry::getKey, Map.Entry::getValue,\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t(e1, e2) -> e1, LinkedHashMap::new));\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tList<String> front_remove = new ArrayList<String>();\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tSet<String> keytest = sortedByValueDesc.keySet();\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tint final_size = sortedByValueDesc.size();\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t// while(sortedByValueDesc.size() > remaining) {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tfor (String keysss : keytest) {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\tif (final_size > remaining_) {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\t\tfront_remove.add(keysss);\r\n\t\t\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\telse {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\t\t\tfinal_size--;\r\n\t\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t// System.out.println( \"sorted map after---\" +sortedByValueDesc.size());\r\n\t\t\t\t\t\t\t\t\t\t\tSet<String> keytests = sortedByValueDesc.keySet();\r\n\r\n\t\t\t\t\t\t\t\t\t\t\tfor (String key_sss : keytests) {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\tif (updated_population.size() < pop_num) {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\t\tif (!front_remove.contains(key_sss)) {\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\tupdated_population.add(key_sss);\r\n\t\t\t\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\t\t\t} else {\r\n\t\t\t\t\t\t\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t\t\tsetdistance.clear();\r\n\t\t\t\t\t\t\t\t\tsetdistance_one.clear();\r\n\r\n\t\t\t\t\t\t\t\t\tfronts++;\r\n\t\t\t\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\t\t} else {\r\n\r\n\t\t\t\t\t\t\t\tif (!fitness_objectives_comparator.isEmpty()) {\r\n\r\n\t\t\t\t\t\t\t\t\tif (updated_population.size() < pop_num) {\r\n\r\n\t\t\t\t\t\t\t\t\t\tString get_item = (fitness_objectives_comparator.get(0));\r\n\r\n\t\t\t\t\t\t\t\t\t\tupdated_population.add(get_item);\r\n\r\n\t\t\t\t\t\t\t\t\t}\r\n}\r\n}\r\n}}\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t \t\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\t\tcatch(IndexOutOfBoundsException e) {}\r\n\r\n\t\t\t\t\t\t\t//updated_population.clear();\r\n\t\t\t\t\t\t\tcombined_population.clear();\r\n\t\t\t\t\t\t\t//combined_population2.clear();\r\n\t\t\t\t\t\t\tsetrank1.clear();\r\n\t\t\t\t\t\t\t//setrank2.clear();\r\n\t\t\t\t\t\t\t//setrank3.clear();\r\n\t\t\t\t\t\t\tcombined_maps.clear();\r\n\t\t\t\t\t\t\t//child_maps.clear();\r\n\r\n\t\t\t\t\t\t\r\n Set<String> add_target = paths.keySet();\r\n\t \t\r\n\t \t//replaced_status_2.put(id + new String(str), false);\r\n\t \tint true_count = 0;\r\n\t \t// get status of removal\r\n\t \tfor (String key_ss : add_target) { \r\n\t \t\r\n\t \t//pick path whose status is false\r\n\t \t\tif ( paths.get(key_ss) ){\r\n\t \t\t\t\r\n\t \t\t\t true_count++;\r\n\t \t\t}\r\n\t \t\t\r\n\t \t\telse {\r\n\t \t\t\t\r\n\t \t\t\tbreak;\r\n\t \t\t}\r\n\t \t \t \r\n\t \t} \r\n\t \t\r\n\t \tif ( true_count == paths.size() ) {\r\n\t \t\t\r\n\t \t\t//if all paths have true as replaced status\r\n\t \t\t\r\n\t \t\t//set them to false\r\n\t \t\t\r\n\t \t\t//pick subset of paths not previously removed at previous generation\r\n\t \t\r\n\t \t\tSet<String> add_new_entry = paths.keySet();\r\n\t \t \t\r\n\t \t \t//replaced_status_2.put(id + new String(str), false);\r\n\t \t \tint entry_count = 0;\r\n\t \t \t// get status of removal\r\n\t \t \tfor (String enrty_ss : add_new_entry ) { \r\n\t \t\t\r\n\t \t \t\t paths.put(enrty_ss , false);\r\n\t \t \t\t\r\n\t \t \t}\r\n\t \t \t\r\n\t \t \tif (paths.size() > 50) {\r\n\t \t \t\r\n\t \t \tint counter_add_paths = 0;\r\n\t \t \t\t\r\n Set<String> add_target_from_Path_1 = paths.keySet();\r\n\t\t \t\r\n\t\t \t//replaced_status_2.put(id + new String(str), false);\r\n\t\t \t\r\n\t\t \t// get status of removal\r\n\t\t \t for (String from_Path_1: add_target_from_Path_1) {\r\n\t \t \t\r\n\t \t \t\r\n\t \t \t\r\n\t \t\t if (still_remaining_targets.contains(from_Path_1) ) {\r\n\t \t \t\t\r\n\t \t \t\t continue;\r\n\t \t \t }\r\n\t \t\t\r\n\t \t\t else {\r\n\t \t\t\t \r\n\t \t\t\t \r\n\t \t\t\t if (counter_add_paths < 50) {\r\n\t \t\t\t\r\n\t \t\t\t if ( !temporary_path_holder.contains(from_Path_1) ){\r\n\t \t \t \t\t\r\n\t \t\t\t\t target_subset.put(from_Path_1 + \" \" + \"new\", false);\r\n\t\t \t \t\t\t\r\n\t \t\t\t\t counter_add_paths++;\r\n\t \t\t\t\t \r\n\t \t\t\t\t// retrieve test case from archive\r\n\t\t \t \t\t\t//updatePopulation(from_Path_1)..//return test case not previously added to temporary population\r\n\t \t\t\t\t \r\n\t\t \t \t\t}\r\n\t \t\t\t\r\n\t \t\t\t }\r\n\t \t\t\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 \t \r\n\t\t \t }\r\n\t \t \t}\r\n\t\t \t \r\n\t\t \t else {\r\n\t\t \t \t \r\n\t\t \t \t \r\n\t\t \t \tSet<String> add_target_from_Path_7 = paths.keySet();\r\n\t\t\t \t\r\n\t\t\t \t//replaced_status_2.put(id + new String(str), false);\r\n\t\t\t \t\r\n\t\t\t \t// get status of removal\r\n\t\t\t \t for (String from_Path_7: add_target_from_Path_7) { // contains(Object)\r\n\t\t\t \t\r\n\t\t\t \t //get current path set..the paths already in subset should not be picked again....\r\n\t\t\t \t\t\r\n\t\t\t \t \t//\ttarget_subset.put(key + \" \" + \"new\", false);\t\r\n\t\t\t \t \t\r\n\t\t\t if (still_remaining_targets.contains(from_Path_7) ) {\r\n\t\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 else { \r\n\t \t \t\tif ( !temporary_path_holder.contains(from_Path_7) ){\r\n\t \t \t\t\t\r\n\t \t \t\t\ttarget_subset.put(from_Path_7 + \" \" + \"new\", false);\r\n\t \t \t\t\t\r\n\t \t \t\t\t// retrieve test case from archive\r\n\t \t \t\t// retrieve test case from archive\r\n\t \t \t\t\t//updatePopulation(from_Path_7)..//return test case not previously added to temporary population\r\n\t \t \t\t}}\r\n\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 }\r\n\t \t\t\r\n\t \telse {\r\n\t \t\t\r\n\t \t\t// pick paths with false status and add them to subset of targets\r\n\t \t\t\r\n\t \t\tint path_to_add_counter = 0;\r\n\t \t\t\r\n\t \tif (paths.size() > 50) {\r\n\t \t\tSet<String> add_target_from_Path = paths.keySet();\r\n\t\t \t\r\n\t\t \t//replaced_status_2.put(id + new String(str), false);\r\n\t\t \t\r\n\t\t \t// get status of removal\r\n\t\t \t for (String from_Path: add_target_from_Path) { // contains(Object)\r\n\t\t \t\r\n\t\t \t //get current path set..the paths already in subset should not be picked again....\r\n\t\t \t\t\r\n\t\t \t \t//\ttarget_subset.put(key + \" \" + \"new\", false);\t\r\n\t\t \t \t\r\n\t\t \t \t\tif (still_remaining_targets.contains(from_Path) ) {\r\n\t\t\t\t \t \t\t\r\n\t\t\t\t \t \t\tcontinue;\r\n\t\t\t\t \t \t}\r\n\t\t \t \t\t\telse {\t\r\n\t\t \t \t\t\r\n\t\t \t \t\t if (path_to_add_counter < 50) {\r\n\t\t \t \t\t \r\n\t\t \t \t if ( !paths.get(from_Path) && (!temporary_path_holder.contains(from_Path) ) ){\r\n\t\t \t \t\t\r\n\t\t \t \t\t target_subset.put(from_Path + \" \" + \"new\", false);\r\n\t\t \t \t\t\t\r\n\t\t \t \t\t\tpath_to_add_counter++;\r\n\t\t \t \t\t\t\r\n\t\t \t \t\t\t// retrieve test case from archive\r\n\t\t \t \t\t// retrieve test case from archive\r\n\t\t \t \t\t\t//updatePopulation(from_Path)..//return test case not previously added to temporary population\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 \t\t}\r\n\t\t \t \t\t\t}\r\n\t\t \t \t}\r\n\t \t}\r\n\t \t\r\n\t \t\r\n\t\t \t else {\r\n\t\t \t \t\t \r\n\t\t \t \t\tSet<String> add_target_from_Path_4 = paths.keySet();\r\n\t\t\t\t \t\r\n\t\t\t\t \t//replaced_status_2.put(id + new String(str), false);\r\n\t\t\t\t \t\r\n\t\t\t\t \t// get status of removal\r\n\t\t\t\t \t for (String from_Path_4: add_target_from_Path_4) { // contains(Object)\r\n\t\t\t\t \t\r\n\t\t\t\t \t //get current path set..the paths already in subset should not be picked again....\r\n\t\t\t\t \t\t\r\n\t\t\t\t \t \t//\ttarget_subset.put(key + \" \" + \"new\", false);\t\r\n\t\t\t\t \t \t\r\n\t\t\t\t \r\n\t\t\t\t \t \t\t\tif (still_remaining_targets.contains(from_Path_4) ) {\r\n\t\t\t\t\t\t \t \t\t\r\n\t\t\t\t\t\t \t \t\tcontinue;\r\n\t\t\t\t\t\t \t \t}\r\n\t\t \t \t\t \r\n\t\t\t\t \t \t\t\telse {\r\n\t\t \t \t\t\t\r\n\t\t \t \t\tif ( !paths.get(from_Path_4) && (!temporary_path_holder.contains(from_Path_4) ) ){\r\n\t\t \t \t\t\t\r\n\t\t \t \t\t\ttarget_subset.put(from_Path_4 + \" \" + \"new\", false);\r\n\t\t \t \t\t\t\r\n\t\t \t \t\t\t// retrieve test case from archive\r\n\t\t \t \t\t\t//updatePopulation(from_Path_4)..//return test case not previously added to temporary population\r\n\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}\r\n\t\t \t\r\n\t \t}\r\n\t \t\r\n\t \t\r\n\t \tparents_population_copy.clear();\r\n\t \t\r\n\t \tfor (int i = 0; i < 50 ; i++) // updated population \r\n\t \t\t\t{\r\n\r\n\t \t\t\t\t//for (int j = 0; j < R; j++) {\r\n\t \t\t\t\t\r\n\t \t\t\t\t//\tx[i][j] = (int)(Math.random()*((ub[j] - lb[j])+1))+ lb[j];\r\n\r\n\t \t\t\t\t//update set x\r\n\t \t\t\t\tparents_population_copy.add(\"parent\" + \" \" + i);\r\n\t \t\r\n\t \t\r\n\t \t\r\n\t \t\r\n\t\t\t\t}\r\n\t \t\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\telse { //proceed to add paths if subset of target objectives is empty\r\n\t\t\t\t\t\r\n\t\t\t\t\t\r\n\t\t\t\t\t\r\n Set<String> add_target = paths.keySet();\r\n\t \t\r\n\t \t//replaced_status_2.put(id + new String(str), false);\r\n\t \tint true_count = 0;\r\n\t \t// get status of removal\r\n\t \tfor (String key_ss : add_target) { \r\n\t \t\r\n\t \t//pick path whose status is false\r\n\t \t\tif ( paths.get(key_ss) ){\r\n\t \t\t\t\r\n\t \t\t\t true_count++;\r\n\t \t\t}\r\n\t \t\t\r\n\t \t\telse {\r\n\t \t\t\t\r\n\t \t\t\tbreak;\r\n\t \t\t}\r\n\t \t \t \r\n\t \t} \r\n\t \t\r\n\t \tif ( true_count == paths.size() ) {\r\n\t \t\t\r\n\t \t\t//if all paths have true as replaced status\r\n\t \t\t\r\n\t \t\t//set them to false\r\n\t \t\t\r\n\t \t\t//pick subset of paths not previously removed at previous generation\r\n\t \t\r\n\t \t\tSet<String> add_new_entry = paths.keySet();\r\n\t \t \t\r\n\t \t \t//replaced_status_2.put(id + new String(str), false);\r\n\t \t \tint entry_count = 0;\r\n\t \t \t// get status of removal\r\n\t \t \tfor (String enrty_ss : add_new_entry ) { \r\n\t \t\t\r\n\t \t \t\t paths.put(enrty_ss , false);\r\n\t \t \t\t\r\n\t \t \t}\r\n\t \t \t\r\n\t \t \tif (paths.size() > 50) {\r\n\t \t \t\r\n\t \t \tint counter_add_paths = 0;\r\n\t \t \t\t\r\n Set<String> add_target_from_Path_1 = paths.keySet();\r\n\t\t \t\r\n\t\t \t//replaced_status_2.put(id + new String(str), false);\r\n\t\t \t\r\n\t\t \t// get status of removal\r\n\t\t \t for (String from_Path_1: add_target_from_Path_1) {\r\n\t \t \t\r\n\t \t \t\r\n\t \t \t\r\n\t \t\t if (still_remaining_targets.contains(from_Path_1) ) {\r\n\t \t \t\t\r\n\t \t \t\t continue;\r\n\t \t \t }\r\n\t \t\t\r\n\t \t\t else {\r\n\t \t\t\t \r\n\t \t\t\t \r\n\t \t\t\t if (counter_add_paths < 50) {\r\n\t \t\t\t\r\n\t \t\t\t if ( !temporary_path_holder.contains(from_Path_1) ){\r\n\t \t \t \t\t\r\n\t \t\t\t\t target_subset.put(from_Path_1 + \" \" + \"new\", false);\r\n\t\t \t \t\t\t\r\n\t \t\t\t\t counter_add_paths++;\r\n\t \t\t\t\t \r\n\t \t\t\t\t// retrieve test case from archive\r\n\t\t \t \t\t\t//updatePopulation(from_Path_1)..//return test case not previously added to temporary population\r\n\t \t\t\t\t \r\n\t\t \t \t\t}\r\n\t \t\t\t\r\n\t \t\t\t }\r\n\t \t\t\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 \t \r\n\t\t \t }\r\n\t \t \t}\r\n\t\t \t \r\n\t\t \t else {\r\n\t\t \t \t \r\n\t\t \t \t \r\n\t\t \t \tSet<String> add_target_from_Path_7 = paths.keySet();\r\n\t\t\t \t\r\n\t\t\t \t//replaced_status_2.put(id + new String(str), false);\r\n\t\t\t \t\r\n\t\t\t \t// get status of removal\r\n\t\t\t \t for (String from_Path_7: add_target_from_Path_7) { // contains(Object)\r\n\t\t\t \t\r\n\t\t\t \t //get current path set..the paths already in subset should not be picked again....\r\n\t\t\t \t\t\r\n\t\t\t \t \t//\ttarget_subset.put(key + \" \" + \"new\", false);\t\r\n\t\t\t \t \t\r\n\t\t\t if (still_remaining_targets.contains(from_Path_7) ) {\r\n\t\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 else { \r\n\t \t \t\tif ( !temporary_path_holder.contains(from_Path_7) ){\r\n\t \t \t\t\t\r\n\t \t \t\t\ttarget_subset.put(from_Path_7 + \" \" + \"new\", false);\r\n\t \t \t\t\t\r\n\t \t \t\t\t// retrieve test case from archive\r\n\t \t \t\t// retrieve test case from archive\r\n\t \t \t\t\t//updatePopulation(from_Path_7)..//return test case not previously added to temporary population\r\n\t \t \t\t}}\r\n\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 }\r\n\t \t\t\r\n\t \telse {\r\n\t \t\t\r\n\t \t\t// pick paths with false status and add them to subset of targets\r\n\t \t\t\r\n\t \t\tint path_to_add_counter = 0;\r\n\t \t\t\r\n\t \tif (paths.size() > 50) {\r\n\t \t\tSet<String> add_target_from_Path = paths.keySet();\r\n\t\t \t\r\n\t\t \t//replaced_status_2.put(id + new String(str), false);\r\n\t\t \t\r\n\t\t \t// get status of removal\r\n\t\t \t for (String from_Path: add_target_from_Path) { // contains(Object)\r\n\t\t \t\r\n\t\t \t //get current path set..the paths already in subset should not be picked again....\r\n\t\t \t\t\r\n\t\t \t \t//\ttarget_subset.put(key + \" \" + \"new\", false);\t\r\n\t\t \t \t\r\n\t\t \t \t\tif (still_remaining_targets.contains(from_Path) ) {\r\n\t\t\t\t \t \t\t\r\n\t\t\t\t \t \t\tcontinue;\r\n\t\t\t\t \t \t}\r\n\t\t \t \t\t\telse {\t\r\n\t\t \t \t\t\r\n\t\t \t \t\t if (path_to_add_counter < 50) {\r\n\t\t \t \t\t \r\n\t\t \t \t if ( !paths.get(from_Path) && (!temporary_path_holder.contains(from_Path) ) ){\r\n\t\t \t \t\t\r\n\t\t \t \t\t target_subset.put(from_Path + \" \" + \"new\", false);\r\n\t\t \t \t\t\t\r\n\t\t \t \t\t\tpath_to_add_counter++;\r\n\t\t \t \t\t\t\r\n\t\t \t \t\t\t// retrieve test case from archive\r\n\t\t \t \t\t// retrieve test case from archive\r\n\t\t \t \t\t\t//updatePopulation(from_Path)..//return test case not previously added to temporary population\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 \t\t}\r\n\t\t \t \t\t\t}\r\n\t\t \t \t}\r\n\t \t}\r\n\t \t\r\n\t \t\r\n\t\t \t else {\r\n\t\t \t \t\t \r\n\t\t \t \t\tSet<String> add_target_from_Path_4 = paths.keySet();\r\n\t\t\t\t \t\r\n\t\t\t\t \t//replaced_status_2.put(id + new String(str), false);\r\n\t\t\t\t \t\r\n\t\t\t\t \t// get status of removal\r\n\t\t\t\t \t for (String from_Path_4: add_target_from_Path_4) { // contains(Object)\r\n\t\t\t\t \t\r\n\t\t\t\t \t //get current path set..the paths already in subset should not be picked again....\r\n\t\t\t\t \t\t\r\n\t\t\t\t \t \t//\ttarget_subset.put(key + \" \" + \"new\", false);\t\r\n\t\t\t\t \t \t\r\n\t\t\t\t \r\n\t\t\t\t \t \t\t\tif (still_remaining_targets.contains(from_Path_4) ) {\r\n\t\t\t\t\t\t \t \t\t\r\n\t\t\t\t\t\t \t \t\tcontinue;\r\n\t\t\t\t\t\t \t \t}\r\n\t\t \t \t\t \r\n\t\t\t\t \t \t\t\telse {\r\n\t\t \t \t\t\t\r\n\t\t \t \t\tif ( !paths.get(from_Path_4) && (!temporary_path_holder.contains(from_Path_4) ) ){\r\n\t\t \t \t\t\t\r\n\t\t \t \t\t\ttarget_subset.put(from_Path_4 + \" \" + \"new\", false);\r\n\t\t \t \t\t\t\r\n\t\t \t \t\t\t// retrieve test case from archive\r\n\t\t \t \t\t\t//updatePopulation(from_Path_4)..//return test case not previously added to temporary population\r\n\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}\r\n\t\t \t\r\n\t \t}\r\n\t\t\t\t\t\r\n\t\t\t\t\t\r\n\t\t\t\t}\r\n\t \t\r\n\t \t\r\n\t\t\t\tString updated_id;\r\n\r\n\t\t\t\tint updated_val;\r\n\r\n\t\t\t\t// int rem;\r\n\r\n\t\t\t\tfor (int pop = 0; pop < updated_population.size(); pop++) {\r\n\r\n\t\t\t\t\tif (pop == 50) {\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t\tString[] updated_pop = (updated_population.get(pop).split(\" \"));\r\n\t\t\t\t\tupdated_id = updated_pop[0];\r\n\t\t\t\t\tupdated_val = Integer.parseInt(updated_pop[1]);\r\n\r\n\t\t\t\t\tif (updated_id.equals(\"parent\")) {\r\n\t\t\t\t\t\tfor (int update_parent = 0; update_parent < R; update_parent++) {\r\n\t\t\t\t\t\t\t// x[i][j] = v[i][j] ;\r\n\r\n\t\t\t\t\t\t\tx[pop][update_parent] = x[updated_val][update_parent];\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif (updated_id.equals(\"child\")) {\r\n\t\t\t\t\t\tfor (int update_child = 0; update_child < R; update_child++) {\r\n\t\t\t\t\t\t\t// x[i][j] = v[i][j] ;\r\n\r\n\t\t\t\t\t\t\tx[pop][update_child] = v[updated_val][update_child];\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t}\r\n\t \t\r\n\t \t\r\n\t\t\t\t} \t\r\n\t // \tremoved_at_previous_iteration.clear();\r\n\t\t\t\t//}\r\n\t\t\t\t\r\n\t\t\t\t\r\n\t\t\t\t\r\n\t\t\t//\tfor (Map.Entry<String, ArrayList<String>> entry : names.entrySet()) {\r\n\t\t\t\t//\tString key = entry.getKey();\r\n\t\t\t\t//\tArrayList<String> value = entry.getValue();\r\n\t\t\t\t//\t}\r\n\r\n\t\t\t\r\n\t\t//\tSystem.out.println(\"NO. of cycles=\" + (Cycle[run] - 1)); // ���Number of Cycle\r\n\t\t\tcoverage[run] = obj_total * 100 / PATHNUM_NUMBER ; // percentage of paths covered per run\r\n\t\t\tSystem.out.println(\"Path coverage=\" + coverage[run] + \"%\");\r\n\t\t\tSystem.out.println(\"The optimal solution is\");\r\n\t\t\tSystem.out.println(\"template 1(bbbb): \");\r\n\t\t\t/*for (int a = 0; a < PATHNUM; a++) // Output the result\r\n\t\t {\r\n\t\t\t\tif (statu[a]) {\r\n\t\t\t\t\tSystem.out.print(\"path\" + a + \":\");\r\n\t\t\t\t\tfor (int j = 0; j < R; j++)\r\n\t\t\t\t\t\tSystem.out.print(solution[a][j] + \" \");\r\n\t\t\t\t\tSystem.out.println();\r\n\t\t\t\t} else\r\n\t\t\t\t\tSystem.out.println(\"path\" + a + \"Not covered.\");\r\n\t\t\t}*/\r\n\r\n\t\t\t \r\n\r\n\t\t} \r\n\r\n\t\tdouble time_sum = 0, time_average;\r\n\t\tfloat coverage_sum = 0, coverage_average, cycle_sum = 0, cycle_average, case_average;\r\n\t\tint case_sum = 0;\r\n\t\tfor (int run = 0; run < RUN; run++) {\r\n\t\t\ttime_sum = time_sum + runtime[run];\r\n\t\t//\tcycle_sum = cycle_sum + (Cycle[run] - 1);\r\n\t\t//\tcase_sum = case_sum + total_case_num[run];\r\n\t\t\tcoverage_sum = coverage_sum + coverage[run];\r\n\t\t }\r\n\t\t\r\n\t\ttime_average = time_sum / RUN;\r\n\t\tcycle_average = cycle_sum / RUN;\r\n\t\tcase_average = case_sum / RUN;\r\n\t\tcoverage_average = coverage_sum / RUN;\r\n\r\n\t\tSystem.out.println(\"time_sum = \" + time_sum + \"ms\");\r\n\t\tSystem.out.println(\"time_average = \" + time_average + \"ms\");\r\n\t\tSystem.out.println(\"cycle_sum = \" + cycle_sum);\r\n\t\tSystem.out.println(\"cycle_average = \" + cycle_average);\r\n\t\tSystem.out.println(\"case_sum = \" + case_sum);\r\n\t\tSystem.out.println(\"case_average = \" + case_average);\r\n\t\tSystem.out.println(\"coverage_sum = \" + coverage_sum + \"%\");\r\n\t\tSystem.out.println(\"coverage_average = \" + coverage_average + \"%\");\r\n\r\n\t\r\n\t\t\r\n\t\t//test case number statistics\r\n\t\ttry \r\n\t\t{ \r\n//\t\t\tWritableWorkbook wbook= \r\n//\t\t\tWorkbook.createWorkbook(new File(\"E:/result0106.xls\")); \r\n//\t\t\t//生成名为“Ramdom”的工作表，参数0表示这是第一页 \r\n//\t\t\tWritableSheet sheet=wbook.createSheet(\"DE1\",0); \r\n\t\t\t\r\n\t\t\tFile file = new java.io.File(\"C:/Users/scybe/eclipse-workspace/TestData/Test_whole.xls\"); \r\n\t\t\tWorkbook book = Workbook.getWorkbook(file); \r\n\t\t\tWritableWorkbook wbook = Workbook.createWorkbook(file, book); \r\n \t WritableSheet sheet = wbook.getSheet(0); // 写入数据 sheet \r\n\t\t\t\r\n\t\t\tfor(int run=0 ; run<RUN; run++)\r\n\t\t\t{\r\n\t\t\t\tint q = run;\r\n\t\t\t\tjxl.write.Number number = new jxl.write.Number(col, q,total_case_num[run]); \r\n\t\t\t\t\r\n\t\t\t\t\r\n\t\t\t\tsheet.addCell(number); \r\n\t\t\t\tSystem.out.println(total_case_num[run]);\t\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t//total_case_num[run]\r\n\t\t\t\r\n\t\t \tdouble case_ave = getAverage(total_case_num , RUN);\r\n\t\t\tjxl.write.Number number1 = new jxl.write.Number(col, 25 ,case_ave); \r\n\t\t\tsheet.addCell(number1);\r\n\t\t\t\r\n\t\t\t \t\t\r\n\t\t\twbook.write(); \t\r\n\t\t\twbook.close();\r\n\t\t\t \r\n\t\t}catch(Exception e) \r\n\t\t{ \r\n\t\tSystem.out.println(e); \r\n\t\t} \r\n\t\t\t\t\t\t\r\n\t\t\r\n\t\t//coverage statistics \r\n\t\t\r\n\t\t//test case number statistics\r\n\t\t\t\t\r\n\t\t\r\n\t\t\r\n\t\ttry \r\n\t\t\t{ \r\n//\t\t\t\t\t\r\n\t\t\t\t\tFile file = new java.io.File(\"C:/Users/scybe/eclipse-workspace/TestData/Coverage_whole.xls\"); \r\n\t\t\t\t\tWorkbook book = Workbook.getWorkbook(file); \r\n\t\t\t\t\tWritableWorkbook wbook = Workbook.createWorkbook(file, book); \r\n\t\t \t WritableSheet sheet = wbook.getSheet(0); // 写入数据 sheet \r\n\t\t\t\t\t\r\n\t\t\t\t\tfor(int run=0 ; run<RUN; run++)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tint q=run;\r\n\t\t\t\t\t\tjxl.write.Number number = new jxl.write.Number(col, q,coverage[run]); \r\n\t\t\t\t\t\tsheet.addCell(number); \r\n\t\t\t\t\t\t\r\n \r\n\t\t\t\t\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//total_case_num[run]\r\n\t\t\t\t\t\r\n\t\t\t\t\tdouble case_ave = getAverages(coverage , RUN);\r\n\t\t\t\t\tjxl.write.Number number1 = new jxl.write.Number(col,25,case_ave); \r\n\t\t\t\t\tsheet.addCell(number1);\r\n\t\t\t\t\t\r\n\t\t\t\t\twbook.write(); \t\r\n\t\t\t\t\twbook.close();\r\n\t\t\t\t\t \r\n\t\t\t\t}catch(Exception e) \r\n\t\t\t\t{ \r\n\t\t\t\tSystem.out.println(e); \r\n\t\t\t\t} \r\n\t\t\t\t\r\n\t\t\r\n\r\n\t}","public void quickUnion(int p, int q) {\n int pid = find(p);\n int qid = find(q);\n if (pid == qid) return;\n //compare two value's height\n //if two height is same just need add 1 in parent root\n if (height[p] == height[q]) {\n id[pid] = qid;\n height[qid]++;\n } else if (height[p] < height[q]) {\n id[pid] = qid;\n } else {\n id[qid] = pid;\n }\n\n }","public void writeSmall(byte[] b) {\n if (b.length<12)\n try {\n throw new IOException();\n } catch (IOException e) {\n e.printStackTrace();\n }\n //Write compressed array//\n int i=0;\n for (; i< 12 ; i++) //maze dimensions + start/goal\n write(b[i]);\n while (i<b.length){\n byte cell=b[i++];\n for (int j =0 ; j<7; j++){\n if (i<b.length)\n cell=(byte)((cell<<1)|b[i++]);\n else\n cell=(byte)((cell << 1));\n }\n write(cell);\n }\n }","private int pack(int size, int sum) {\n return size | (sum << 16);\n }","public long generatePathsSlow(int size, int d, int r) {\n // Not thread safe, lel\n if (d == size && r == size) {\n return 1L;\n } else if (d == size) {\n return generatePathsSlow(size, d, r + 1);\n } else if (r == size) {\n return generatePathsSlow(size, d + 1, r);\n } else {\n return generatePathsSlow(size, d + 1, r) + generatePathsSlow(size, d, r + 1);\n }\n }","@Test(expected = Exception.class)\n public void testMazeSizeMismatch() throws Exception {\n shortestPath = MazeSolver.pStar(smallMaze, 20);\n }","@Test\r\n\tpublic void permutationsTestSize5() throws BoundedQueueException {\r\n\t\tbq.enqueue(1);\r\n\t\tbq.enqueue(2);\r\n\t\tbq.enqueue(3);\r\n\t\tbq.enqueue(4);\r\n\t\tbq.enqueue(5);\r\n\t\tbq.permutations();\r\n\t}","public int size(Tree<K, V> t, int size) {\n\t\tsize = left.size(left, size + 1);\n\t\tsize = right.size(right, size + 1);\n\t\treturn size;\n\t}","List<File> compress(File directory, int size);","void union(int a, int b) {\n\t\tif (a==9 && b==4){\r\n\t\tSystem.out.println(\"DEBUGGING 9 AND 4\");\r\n\t\tSystem.out.println(\"size of A: \"+ sizeOf(a));\r\n\t\tSystem.out.println(\"size of B: \"+ sizeOf(b));\r\n\t\t}\r\n\t\tint rootB = getRoot(b); // N array access\r\n\t\tint rootA = getRoot(a); // N array access\r\n\t\tif (rootA==rootB)return;\r\n\r\n\t\tif (sizeOf(rootA)<sizeOf(rootB)){\r\n\t\t\tidNode[rootA] = rootB; // 1 array access\r\n\t\t}\r\n\t\telse{\r\n\t\t\tidNode[rootB] = rootA; // 1 array access\r\n\t\t}\r\n\t}","public void open(int row, int col) {\n if (isOpen(row, col)) return;\n grid[row - 1][col - 1] = true;\n ++openSites;\n\n // Transform the row and the column into an appropriate index\n // because the quick union class uses a one-dimensional array.\n final int currentSiteIndex = toIndex(row, col);\n\n // The topmost row must be connected to the virtual top.\n if (row == 1) {\n mainUnion.union(virtualTopId, currentSiteIndex);\n backwashAwareUnion.union(virtualTopId, currentSiteIndex);\n }\n // The bottommost row must be connected to virtual the bottom.\n if (row == size) mainUnion.union(virtualBottomId, currentSiteIndex);\n\n // Connect all neighbors of the current site if and only if the neighbors are open.\n if (row > 1 && isOpen(row - 1, col)) {\n final int topNeighborIndex = toIndex(row - 1, col);\n mainUnion.union(topNeighborIndex, currentSiteIndex);\n backwashAwareUnion.union(topNeighborIndex, currentSiteIndex);\n }\n\n if (row < size && isOpen(row + 1, col)) {\n final int bottomNeighborIndex = toIndex(row + 1, col);\n mainUnion.union(bottomNeighborIndex, currentSiteIndex);\n backwashAwareUnion.union(bottomNeighborIndex, currentSiteIndex);\n }\n\n if (col > 1 && isOpen(row, col - 1)) {\n final int leftNeighborIndex = toIndex(row, col - 1);\n mainUnion.union(leftNeighborIndex, currentSiteIndex);\n backwashAwareUnion.union(leftNeighborIndex, currentSiteIndex);\n }\n\n if (col < size && isOpen(row, col + 1)) {\n final int rightNeighborIndex = toIndex(row, col + 1);\n mainUnion.union(rightNeighborIndex, currentSiteIndex);\n backwashAwareUnion.union(rightNeighborIndex, currentSiteIndex);\n }\n }","WeightedUnionFind(int N){\n id = new int[N];\n size = new int[N];\n for (int i = 0; i < N; i++){\n id[i] = i;\n size[i] = 1;\n }\n }","public org.apache.gora.cascading.test.storage.TestRow.Builder clearUnionRecursive() {\n unionRecursive = null;\n fieldSetFlags()[3] = false;\n return this;\n }","void Union( int x, int y){\n\n int i = root(x);\n int j = root(y);\n if (i == j) return;\n if (rank[i] > rank[j]) { id[j] = i; rank[i] += rank[j]; }\n else { id[i] = j; rank[j] += rank[i]; }\n }","public org.apache.gora.cascading.test.storage.TestRow.Builder setUnionRecursive(org.apache.gora.cascading.test.storage.TestRow value) {\n validate(fields()[3], value);\n this.unionRecursive = value;\n fieldSetFlags()[3] = true;\n return this; \n }","public static void mazeHeight(){\n\t\tint n = 10;\t\n\n\t\tdsf S = new dsf(n*n);\n\t\tMaze three = new Maze(n);\n\n\t\tRandom random;\n\t\tint sets = n*n;\t//number of sets in the DSF\n\t\tint randomNumber;\n\t\tint randomDirection;\n\t\tint row;\n\t\tint col;\n\n\t\tchar upperRight; \t//bottom or right\n\n\t\tS.print();\n\n\t\twhile(sets > 1){\n\t\t\trandom = new Random();\n\t\t\trandomNumber = random.nextInt((n*n) - 1);\n\t\t\t//System.out.println(\"RANDOM NUMBER: \"+randomNumber);\n\t\t\trow = randomNumber /n;\t//SWITCHED\n\t\t\tcol = randomNumber %n;\t//SWITCHED\n\t\t\trandomDirection = random.nextInt(2);\n\t\t\tString direct;\n\t\t\tif(randomDirection == 0)\n\t\t\t\tdirect = \"upper\";\n\t\t\telse\n\t\t\t\tdirect = \"right\";\n\t\t\t//System.out.println(\"RANDOM DIRECTI0N: \"+direct);\n\t\t\tupperRight = three.direction(randomDirection);\n\n\t\t\tif(upperRight == 'u'){\n\t\t\t\tif((randomNumber) < ((n*n)-n)){\n\t\t\t\t\tSystem.out.println(\"Sets: \"+sets);\n\t\t\t\t\tif(S.find(randomNumber) != S.find(randomNumber + n)){\n\t\t\t\t\t\tS.unionByHeight(randomNumber, randomNumber+n);\n\t\t\t\t\t\tthree.remove_wall(col, row, 'u');\n\t\t\t\t\t\tS.print();\n\t\t\t\t\t\tsets--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(upperRight == 'r'){\n\t\t\t\tif(((randomNumber)%(n*n)) != n-1){\n\t\t\t\t\tif(S.find(randomNumber) != S.find(randomNumber+1)){\n\t\t\t\t\t\tS.unionByHeight(randomNumber, randomNumber+1);\n\t\t\t\t\t\tthree.remove_wall(col, row, 'r');\n\t\t\t\t\t\tS.print();\n\t\t\t\t\t\tsets--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tbuildAdjacencyList(three, n);\n\t\tuserSelection_SolveMaze(n);\n\n\n\t\tStdDraw.show(0);\n\t\tthree.draw();\n\t\tthree.printCellNumbers();\t\n\t}","public int sizeUncompressed (){\r\n\t\t\treturn _sizeUncompressed;\r\n\t\t}","public ArrayList<String> shortenPath(ArrayList<String> path){\n int currentX = testFunction.startingX;\n int currentY = testFunction.startingY;\n ArrayList<ArrayList<Integer>> board = testFunction.board;\n for (int i = 0; i < path.size(); i++) {\n if(path.get(i).equals(\"U\")) currentY++;\n if(path.get(i).equals(\"D\")) currentY--;\n if(path.get(i).equals(\"L\")) currentX--;\n if(path.get(i).equals(\"R\")) currentX++;\n if(currentX < board.size() && currentY < board.get(0).size() && currentX >= 0 && currentY >= 0) {\n if (board.get(currentX).get(currentY) == 8) {\n ArrayList<String> shortPath = new ArrayList<>();\n for (int j = 0; j <= i; j++) {\n shortPath.add(path.get(j));\n }\n return shortPath;\n }\n }\n }\n return path;\n }","public void open(int row, int col) {\n check(row, col);\n if (!isOpen(row, col)) {\n sites[row - 1][col - 1] = true;\n openSites++;\n\n int index = index(row, col);\n if (row == gridDimension) {\n unionFind.union(index, bottomRoot);\n\n if (gridDimension == 1){\n unionFind.union(index, topRoot);\n fullSites.union(index, topRoot);\n }\n else if (isOpen(row - 1, col)) {\n unionFind.union(index(row - 1, col), index);\n fullSites.union(index(row - 1, col), index);\n }\n }\n else if (row == 1) {\n unionFind.union(index, topRoot);\n fullSites.union(index, topRoot);\n\n if (isOpen(row + 1, col)) {\n unionFind.union(index(row + 1, col), index);\n fullSites.union(index(row + 1, col), index);\n }\n }\n\n else {\n if (isOpen(row + 1, col)) {\n unionFind.union(index(row + 1, col), index);\n fullSites.union(index(row + 1, col), index);\n }\n\n if (isOpen(row - 1, col)) {\n unionFind.union(index(row - 1, col), index);\n fullSites.union(index(row - 1, col), index);\n }\n }\n\n\n\n if (col > 1) {\n if (isOpen(row, col - 1)) {\n unionFind.union(index(row, col - 1), index);\n fullSites.union(index(row, col - 1), index);\n }\n }\n\n if (col < gridDimension) {\n if (isOpen(row, col + 1)) {\n unionFind.union(index(row, col + 1), index);\n fullSites.union(index(row, col + 1), index);\n }\n }\n }\n }","public QuadTree(PointView<Point> view, int transitionSize) {\n super(view);\n _transitionSize = transitionSize;\n _nodeOrigin = new double[2];\n _elements = new ArrayList<Point>();\n _subdivided = false;\n _elementsSize = 0;\n _treeSize = 0;\n }","public static void printfin(coordinate visit1[][], coordinate visit2[][]) {\n \t //represent one path to be 3s and the other to be 4s, but for now, set both srcs to three\n \t map[dim-1][dim-1]=3;\n \t map[0][0]=3;\n \t int tempx = intersect.x; \n \t int tempy = intersect.y;\n \t map[tempx][tempy] = 3; //will be updated later\n \n \t while(!(tempx==0 && tempy==0)) { //iterate one path until we hit the src1\n coordinate hold = visit1[tempx][tempy];\n\t\t//take current node and mark as visited in path 1 (src1 -- from 0,0 to intersect)\n tempx = hold.x;\n tempy=hold.y;\n\t\t//set these to 3, as visited, and increase pathSize\n pathsize++;\n\n map[tempx][tempy]=3;\n\n tempx = hold.x;\n tempy=hold.y;\n\n map[tempx][tempy]=3;\n \t }\n \t //do the same for second path\n \t tempx = intersect.x;\n \t tempy = intersect.y;\n \t map[tempx][tempy] = 3; \n \t int val=dim-1;\n \n\t //this is for the other path from the second src\n \t while(!(tempx==val && tempy==val)) {\n\t \t coordinate hold = visit2[tempx][tempy];\n\t \t tempx = hold.x;\n\t \t tempy=hold.y;\n\t \t pathsize++;\n\t \t \n\t \t map[tempx][tempy]=3;\n\t \t \n\t \t tempx = hold.x;\n\t \t tempy=hold.y;\n\t \t \n\t \t map[tempx][tempy]=4;\n \t }\n \n }","public Maze(int size) {\n \t\tthis.size = size;\n \t\ttarget = new Point(size, 1);\n \n \t\tvisited = new boolean[size + 2][size + 2];\n \t\tnorth = new boolean[size + 2][size + 2];\n \t\teast = new boolean[size + 2][size + 2];\n \t\tsouth = new boolean[size + 2][size + 2];\n \t\twest = new boolean[size + 2][size + 2];\n \t\t\n \t\tinit();\n \t\tcalculateCentre();\n \t\tcreateSwitches(); //needs to be done after centre is created\n \t\t\n \t\t //create 15 motion sensors, but don't create any in the centre\n \t\tms = new MotionSensors(size, 15, centreMin, centreMax);\n \t\t//System.out.println(ms); //print motion sensor coordinates\n \t\t\n \t\tcreateSubmarineMaze();//generates maze for the submarine\n \t}","static\nint\nprintUnion(\nint\narr1[], \nint\narr2[], \nint\nm, \nint\nn) \n\n{ \n\nint\ni = \n0\n, j = \n0\n; \n\nwhile\n(i < m && j < n) \n\n{ \n\nif\n(arr1[i] < arr2[j]) \n\nSystem.out.print(arr1[i++]+\n\" \"\n); \n\nelse\nif\n(arr2[j] < arr1[i]) \n\nSystem.out.print(arr2[j++]+\n\" \"\n); \n\nelse\n\n{ \n\nSystem.out.print(arr2[j++]+\n\" \"\n); \n\ni++; \n\n} \n\n} \n\n\n/* Print remaining elements of \n\nthe larger array */\n\nwhile\n(i < m) \n\nSystem.out.print(arr1[i++]+\n\" \"\n); \n\nwhile\n(j < n) \n\nSystem.out.print(arr2[j++]+\n\" \"\n); \n\n\nreturn\n0\n; \n\n}","private void findPath2(List<Coordinate> path) {\n List<Integer> cost = new ArrayList<>(); // store the total cost of each path\n // store all possible sequences of way points\n ArrayList<List<Coordinate>> allSorts = new ArrayList<>();\n int[] index = new int[waypointCells.size()];\n for (int i = 0; i < index.length; i++) {// generate the index reference list\n index[i] = i;\n }\n permutation(index, 0, index.length - 1);\n for (Coordinate o1 : originCells) {\n for (Coordinate d1 : destCells) {\n for (int[] ints1 : allOrderSorts) {\n List<Coordinate> temp = getOneSort(ints1, waypointCells);\n temp.add(0, o1);\n temp.add(d1);\n int tempCost = 0;\n for (int i = 0; i < temp.size() - 1; i++) {\n Graph graph = new Graph(getEdge(map));\n Coordinate start = temp.get(i);\n graph.dijkstra(start);\n Coordinate end = temp.get(i + 1);\n graph.printPath(end);\n tempCost = tempCost + graph.getPathCost(end);\n if (graph.getPathCost(end) == Integer.MAX_VALUE) {\n tempCost = Integer.MAX_VALUE;\n break;\n }\n }\n cost.add(tempCost);\n allSorts.add(temp);\n }\n }\n }\n System.out.println(\"All sorts now have <\" + allSorts.size() + \"> items.\");\n List<Coordinate> best = allSorts.get(getMinIndex(cost));\n generatePath(best, path);\n setSuccess(path);\n }","protected void trimToSize() {\n\tnodeList.trimToSize();\n\tedgeList.trimToSize();\n }","public void union(T x, T y) {\n\t\tassert (_parents.containsKey(x));\n\t\tassert (_parents.containsKey(y));\n\n\t\tx = find(x);\n\t\ty = find(y);\n\n\t\tif (x == y) {\n\t\t\treturn;\n\t\t}\n\n\t\tint xRank = _ranks.get(x);\n\t\tint yRank = _ranks.get(y);\n\n\t\tif (xRank < yRank) {\n\t\t\t_parents.put(x, y);\n\t\t} else if (xRank > yRank) {\n\t\t\t_parents.put(y, x);\n\t\t} else {\n\t\t\t_parents.put(y, x);\n\t\t\t_ranks.put(x, xRank + 1);\n\t\t}\n\n\t\t_numSets--;\n\t}","void resize() {\n Comparable[] temp = new Comparable[size * 2];\n for (int i = 0; i < pq.length; i++) {\n temp[i] = pq[i];\n }\n pq = temp;\n }","public static int distinctPaths4(int n) {\n\t\tint[][] mem = new int[n+1][n+1];\n\t\tfor(int j = 1; j <= n; ++j) {\n\t\t\tmem[1][j] = 1;\n\t\t\tmem[j][1] = 1;\n\t\t}\n\t\tfor(int i = 2; i <= n; ++i) {\n\t\t\tfor(int j = 2; j <= n; ++j) {\n\t\t\t\tmem[i][j] = mem[i-1][j] + mem[i][j-1];\n\t\t\t}\n\t\t}\n\t\treturn mem[n][n];\n\t}","public void union(Node a, Node b) {\n Node set1 = find(a);\n Node set2 = find(b);\n\n if (set1 != set2) {\n // Limits the worst case runtime of a find to O(log N)\n if (set1.getSize() < set2.getSize()) {\n set2.setParent(set1);\n set1.setSize(set1.getSize() + set2.getSize());\n }\n else {\n set1.setParent(set2);\n set2.setSize(set1.getSize() + set2.getSize());\n }\n }\n }","public static ArrayList<ArrayList<String>> unionD(String table1Name, String table2Name){\n\t\tArrayList<ArrayList<String>> union = new ArrayList<ArrayList<String>>();\r\n\t\t//these will hold the data from the input tables\r\n\t\tArrayList<ArrayList<String>> columns1 = new ArrayList<ArrayList<String>>();\r\n\t\tArrayList<ArrayList<String>> columns2 = new ArrayList<ArrayList<String>>();\r\n\t\t//find the input tables in the database list\r\n\t\tfor (int i = 0; i < tables.size(); i++) {\r\n\t\t\tif (tables.get(i).getName().equals(table1Name)) {\r\n\t\t\t\tcolumns1 = new ArrayList<ArrayList<String>>(tables.get(i).datas);\r\n\t\t\t}\r\n\t\t\tif (tables.get(i).getName().equals(table2Name)) {\r\n\t\t\t\tcolumns2 = new ArrayList<ArrayList<String>>(tables.get(i).datas);\r\n\t\t\t}\r\n\t\t}\r\n\t\t//check if the tables are union compatable\r\n\t\tif (columns1.size() != columns2.size()) {\r\n\t\t\tSystem.out.println(\"Unable to perform union - unnequal number of columns.\");\r\n\t\t}\r\n\t\telse {\t//only continue if they are union compatable\r\n\t\t\t//true if all columns have the same type\r\n\t\t\tint sameTypes = 1;\r\n\t\t\tint type1 = 0;\r\n\t\t\tint type2 = 0;\r\n\t\t\t//a max char value of -1 indicates the type is integer\r\n\t\t\tfor (int j = 0; j < columns1.size(); j++) {\r\n\t\t\t\ttype1 = Integer.valueOf(new String(columns1.get(j).get(1)));\r\n\t\t\t\ttype2 = Integer.valueOf(columns2.get(j).get(1));\r\n\t\t\t\tif (type1 > 0) { type1 = 1; }\r\n\t\t\t\telse if (type1 < 0) { type1 = -1; }\r\n\t\t\t\tif (type2 > 0) { type2 = 1; }\r\n\t\t\t\telse if (type2 < 0) { type2 = -1; }\r\n\t\t\t\t//if the types were not equal, don't continue\r\n\t\t\t\tif (type1 != type2) {\r\n\t\t\t\t\tSystem.out.println(\"Unable to perform union - incompatible types.\");\r\n\t\t\t\t}\r\n\t\t\t\telse {\t//continue if the types are equal\r\n\t\t\t\t\t\t//create new columns holding the name from the first table and the greatest char max\r\n\t\t\t\t\tArrayList<String> newColumn = new ArrayList<String>();\r\n\t\t\t\t\tint largestChar = 0;\r\n\t\t\t\t\tif (type1 != -1) {\t//if they aren't integers\r\n\t\t\t\t\t\t//find the largest max char value\r\n\t\t\t\t\t\tif (Integer.parseInt(columns1.get(j).get(1)) >= Integer.parseInt(columns2.get(j).get(1))) {\r\n\t\t\t\t\t\t\tlargestChar = Integer.parseInt(new String(columns1.get(j).get(1)));\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\telse { \r\n\t\t\t\t\t\t\tlargestChar = Integer.parseInt(columns2.get(j).get(1)); \r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t\t//keep the type as integer\r\n\t\t\t\t\telse { \r\n\t\t\t\t\t\tlargestChar = -1; \r\n\t\t\t\t\t}\r\n\t\t\t\t\t\t//use the name from the first table and largest char max\r\n\t\t\t\t\tnewColumn.add(new String(columns1.get(j).get(0)));\r\n\t\t\t\t\tnewColumn.add(String.valueOf(largestChar));\r\n\t\t\t\t\tunion.add(newColumn);\r\n\t\t\t\t\t//check if there are equal rows to avoid duplicates\r\n\t\t\t\t\tint colCount = 0;\r\n\t\t\t\t\tfor (int n = 2; n < columns1.get(colCount).size(); n++) {\t//for each row in table1\r\n\t\t\t\t\t\tunion.get(j).add(new String(columns1.get(j).get(n)));\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t}\t\t\r\n\t\t\tfor(int t = 2; t<columns2.get(0).size(); t++){\t//column2 row\r\n\t\t\t\tboolean completeUniqe = true;\r\n\t\t\t\tfor(int p = 2; p < union.get(0).size(); p++){// rows of union\r\n\t\t\t\t\tint sameCount = 0;\r\n\t\t\t\t\tfor(int u = 0; u<union.size(); u++){//columns of union\r\n\t\t\t\t\t\tif(columns2.get(u).get(t).equals(union.get(u).get(p))){\r\n\t\t\t\t\t\t\tsameCount++;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t\tSystem.out.println(sameCount);\r\n\t\t\t\t\tif(sameCount == union.size()){\r\n\t\t\t\t\t\tcompleteUniqe = false;\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\tif(completeUniqe){\r\n\t\t\t\t\tfor(int u = 0; u<union.size(); u++){//columns of union\r\n\t\t\t\t\t\tunion.get(u).add(new String(columns2.get(u).get(t)));\r\n\t\t\t\t\t}\r\n\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn union;\r\n\t}","@Override\n public void union(int root1, int root2) {\n // TODO: Implement the union-by-rank algorithm for disjoint set\n if (s[root1]>-1 || s[root2]>-1 ) throw new IllegalArgumentException(\"Impossible to union because one of the roots is already dependant\");\n if( s[root2] < s[root1]){ // root2 is deeper\n s[root1] = root2;// Make root2 new root\n } \n else{\n if(s[root1] == s[root2]) s[ root1 ]--; // Update height if same\n s[root2] = root1; // Make root1 new root\n }\n }","public static Stack<Integer> topologicalKosarajuDFSRecursive(ArrayList<ArrayList<Integer>> adj,int u,Stack<Integer> stack,boolean[] visited){\r\n visited[u]=true;\r\n for(int i:adj.get(u))\r\n if(!visited[u])\r\n topologicalKosarajuDFSRecursive(adj,i,stack,visited);\r\n stack.push(u);\r\n return stack;\r\n }","public int getMazeSize() \r\n\t{\r\n\t\treturn this.size;\r\n\t}","public void setSize() {\n\t\t\tthis.size = 1;\n\t\t\tint leftSize = 0;\n\t\t\tint rightSize = 0;\n\t\t\tif (this.getLeft().getKey() != -1) {\n\t\t\t\tleftSize = this.getLeft().getSize();\n\t\t\t}\n\t\t\tif (this.getRight().getKey() != -1) {\n\t\t\t\trightSize = this.getRight().getSize();\n\t\t\t}\n\t\t\tthis.size += leftSize + rightSize;\n\n\t\t\t/**\n\t\t\t * this.size = 1; int leftSize = 0; int rightSize = 0; try { leftSize =\n\t\t\t * this.getLeft().getSize(); this.size += leftSize; } catch\n\t\t\t * (NullPointerException e) { this.size += leftSize; } try { rightSize =\n\t\t\t * this.getRight().getSize(); this.size += rightSize; } catch\n\t\t\t * (NullPointerException e) { this.size += rightSize; } if (this.getSize() >\n\t\t\t * 990) { System.out.println(\"actual size is:\" + this.getSize()); }\n\t\t\t */\n\t\t}","void Union(int parent[], int x, int y){ \n int xset = find(parent, x); \n int yset = find(parent, y); \n parent[xset] = yset; \n }","private void findPath(int[][] path){\n int row = rows-1;\n int col = cols-1;\n int count = 1;\n int[][] newpath = new int[row+1][col+1];\n while(row>0 && col> 0){\n if(path[row-1][col-1]+1 == path[row][col]){\n newpath[row][col] = path[row][col];\n System.out.println(\"edit distance: \" + count + \"--> replace '\" + oriString.charAt(row-1) + \"' with '\" + fixString.charAt(col-1)+\"'\");\n count++;\n row--;\n col--;\n }else if(path [row-1][col]+1 == path[row][col]){\n newpath[row][col] = path[row][col];\n System.out.println(\"edit distance: \" + count + \"--> remove '\" + oriString.charAt(row-1) + \"' from str1\");\n row--;\n count++;\n\n }else if(path [row][col-1]+1 == path[row][col]){\n newpath[row][col] = path[row][col];\n System.out.println(\"edit distance: \" + count + \"--> add '\" + fixString.charAt(col-1) + \"' to str1\");\n count++;\n col--;\n }else if(path [row-1][col-1] == path[row][col]){\n newpath[row][col] = path[row][col];\n row--;\n col--;\n }\n }\n if( row != 0){\n while(row > 0){\n if(path[row][col] == path[row-1][col]+1){\n newpath[row][col] = path[row][col];\n System.out.println(\"edit distance: \" + count + \"--> remove '\" + oriString.charAt(row-1) + \"' to str1\");\n count++;\n row--;\n }\n }\n }\n if( col != 0){\n while(col > 0){\n if(path[row][col] == path[row][col-1]+1){\n newpath[row][col] = path[row][col];\n System.out.println(\"edit distance: \" + count + \"--> add '\" + fixString.charAt(col-1) + \"' to str1\");\n count++;\n col--;\n }\n }\n }\n // printPath(newpath);\n }","public void union(String p, String q) {\n if(p.equals(q)) return;\n String rootP = findRoot(p);\n String rootQ = findRoot(q);\n // skip if both users are already part of the same tree.\n if(rootP.equals(rootQ)) return;\n\n int newHeight = treesHeight.get(rootP) + treesHeight.get(rootQ);\n // Keep track of the highest tree.\n highestHeight = Math.max(highestHeight, newHeight);\n\n if (treesHeight.get(rootP) > treesHeight.get(rootQ)) {\n usersMap.put(rootQ, rootP);\n treesHeight.put(rootP, newHeight);\n }\n else {\n usersMap.put(rootP, rootQ);\n treesHeight.put(rootQ, newHeight);\n }\n }","private static void testAlgorithmOptimality() {\n AlgoFunction testAlgo = SG16Algorithm::new;\n\n //printSeed = false; // keep this commented out.\n Random seedRand = new Random(1241);\n int initial = seedRand.nextInt();\n for (int i=0; i<50000000; i++) {\n int sizeX = seedRand.nextInt(150) + 5;\n int sizeY = seedRand.nextInt(150) + 5;\n int seed = i+initial;\n int ratio = seedRand.nextInt(50) + 5;\n \n int max = (sizeX+1)*(sizeY+1);\n int p1 = seedRand.nextInt(max);\n int p2 = seedRand.nextInt(max-1);\n if (p2 == p1) {\n p2 = max-1;\n }\n \n int sx = p1%(sizeX+1);\n int sy = p1/(sizeX+1);\n int ex = p2%(sizeX+1);\n int ey = p2/(sizeX+1);\n\n double restPathLength = 0, normalPathLength = 0;\n try {\n GridGraph gridGraph = DefaultGenerator.generateSeededGraphOnly(seed, sizeX, sizeY, ratio);\n for (int iii=0;iii<300;++iii) Utility.generatePath(testAlgo, gridGraph, seedRand.nextInt(sizeX+1),seedRand.nextInt(sizeY+1),seedRand.nextInt(sizeX+1),seedRand.nextInt(sizeY+1));\n int[][] path = Utility.generatePath(testAlgo, gridGraph, sx, sy, ex, ey);\n path = Utility.removeDuplicatesInPath(path);\n restPathLength = Utility.computePathLength(gridGraph, path);\n \n path = Utility.computeOptimalPathOnline(gridGraph, sx, sy, ex, ey);\n path = Utility.removeDuplicatesInPath(path);\n normalPathLength = Utility.computePathLength(gridGraph, path);\n }catch (Exception e) {\n e.printStackTrace();\n System.out.println(\"EXCEPTION OCCURRED!\");\n System.out.println(\"Seed = \" + seed +\" , Ratio = \" + ratio + \" , Size: x=\" + sizeX + \" y=\" + sizeY);\n System.out.println(\"Start = \" + sx + \",\" + sy + \" End = \" + ex + \",\" + ey);\n throw new UnsupportedOperationException(\"DISCREPANCY!!\");\n }\n \n if (Math.abs(restPathLength - normalPathLength) > 0.000001f) {\n //if ((restPathLength == 0.f) != (normalPathLength == 0.f)) {\n System.out.println(\"============\");\n System.out.println(\"Discrepancy Discovered!\");\n System.out.println(\"Seed = \" + seed +\" , Ratio = \" + ratio + \" , Size: x=\" + sizeX + \" y=\" + sizeY);\n System.out.println(\"Start = \" + sx + \",\" + sy + \" End = \" + ex + \",\" + ey);\n System.out.println(\"Actual: \" + restPathLength + \" , Expected: \" + normalPathLength);\n System.out.println(restPathLength / normalPathLength);\n System.out.println(\"============\");\n throw new UnsupportedOperationException(\"DISCREPANCY!!\");\n } else {\n if (i%1000 == 999) {\n System.out.println(\"Count: \" + (i+1));\n System.out.println(\"OK: Seed = \" + seed +\" , Ratio = \" + ratio + \" , Size: x=\" + sizeX + \" y=\" + sizeY);\n System.out.println(\"Actual: \" + restPathLength + \" , Expected: \" + normalPathLength);\n }\n }\n }\n }","@Test\n public void testUnionOnSchemaInputUdfs() throws Exception {\n PigServer pig = new PigServer(Util.getLocalTestMode());\n String query =\n \" l1 = load '\" + INP_FILE_2NUMS + \"' as (i : int, j : chararray);\"\n + \"l2 = load '\" + INP_FILE_2NUMS + \"' as (i : int, j : chararray);\"\n + \"f1 = foreach l1 generate i, CONCAT(j,j) as cj, \" +\n \t\t\"org.apache.pig.test.TestUnionOnSchema\\\\$UDFTupleNullSchema(i,j) as uo;\"\n + \"u = union onschema f1, l2;\"\n ; \n Util.registerMultiLineQuery(pig, query);\n\n Schema sch = pig.dumpSchema(\"u\");\n String expectedSch = \"{i: int,cj: chararray,uo: (),j: chararray}\";\n Assert.assertTrue( expectedSch.equals( sch.toString() ) );\n \n\n Iterator<Tuple> it = pig.openIterator(\"u\");\n List<Tuple> expectedRes = \n Util.getTuplesFromConstantTupleStrings(\n new String[] {\n \"(1,null,null,'2')\",\n \"(5,null,null,'3')\",\n \"(1,'22',(1,'2'),null)\",\n \"(5,'33',(5,'3'),null)\"\n });\n Util.checkQueryOutputsAfterSort(it, expectedRes);\n\n }","private void BuildUp(int towerToBuild, int towerTarget, int bottomSize) {\n\t\t\n\t\tint notTowerTarget = getOtherTower(towerToBuild,towerTarget);\n\n\t\twhile( towerSet.TopBlock(towerToBuild) > 1 ) {\n\t\t\tif(towerSet.TopBlock(towerTarget) == towerSet.TopBlock(towerToBuild) - 1) {\n\t\t\t\ttowerSet.MoveBlock(towerTarget,towerToBuild);\n\t\t\t\tturnNumber++;\n\t\t\t\tSystem.out.println(this.toString());\n\t\t\t}\n\t\t\telse if(towerSet.TopBlock(notTowerTarget) == towerSet.TopBlock(towerToBuild) - 1) {\n\t\t\t\ttowerSet.MoveBlock(notTowerTarget,towerToBuild);\n\t\t\t\tturnNumber++;\n\t\t\t\tSystem.out.println(this.toString());\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif(towerSet.TopBlock(towerTarget) == 1 ) {\n\t\t\t\t\tthis.BreakDown(towerTarget, towerToBuild, towerSet.TopBlock(towerToBuild) - 1);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tthis.BreakDown(notTowerTarget, towerToBuild, towerSet.TopBlock(towerToBuild) - 1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}","private void increaseSize() {\r\n\t\tE[] biggerE = (E[]) new Object[this.capacity * 2];\r\n\t\tdouble[] biggerC = new double[this.capacity * 2];\r\n\t\tfor (int i = 0; i < this.size; i++) {\r\n\t\t\tbiggerE[i] = this.objectHeap[i];\r\n\t\t\tbiggerC[i] = this.costHeap[i];\r\n\t\t}\r\n\t\tthis.costHeap = biggerC;\r\n\t\tthis.objectHeap = biggerE;\r\n\t\tthis.capacity = this.capacity * 2;\r\n\t}","static int findUnion(int i) {\n int result = i;\n while(parent[result] != result)\n result = parent[result];\n\n // update all parents of i to result\n while(parent[i] != i) {\n int temp = parent[i];\n parent[i] = result;\n i = temp;\n }\n return result;\n }","public static String findPath(Maze maze) {\n \tint m = maze.getNumRows();\n \tint n = maze.getNumCols();\n\n \t//define a visited matrix\n \tboolean[][] visited = new boolean[m][n];\n \tsetvisited(false, visited);\n\n \t//define a direction matrix\n \tint[][] dir_mtr = new int[m][n];\n \tinit_dir(-1,dir_mtr);\n\n\n\n \t//define a stack\n \tStack<MazeLocation> s;\n \ts = new StackRefBased<MazeLocation>();\n\n \tMazeLocation entry = maze.getEntry();\n \tMazeLocation exit = maze.getExit();\n \t// System.out.println(entry.toString());\n \ts.push(entry);\n\n\t\tMazeLocation temp; \n\t\tString result = \"\"; \t\n\n\t\ttry{\n\t\t\tint x,y;\n\n\n\t\t\twhile(!s.isEmpty()){\n\n \t\ttemp = s.peek();\n \t\tx = temp.getRow();\n \t\ty = temp.getCol();\n \t\tdir_mtr[x][y]+=1;\n\n \t\tif(temp.toString().equals(exit.toString())){\n \t\t\tSystem.out.println(\"find the path\");\n \t\t\tbreak;\n\n \t\t}\n\n \t\tif(dir_mtr[x][y]==0){ \n \t\t\t//checking the up direction\n \t\t\tif(x-1>=0 && !maze.isWall(x-1,y) && !visited[x-1][y]){\n \t\t\t\tMazeLocation testnode = new MazeLocation(x-1,y,maze.isWall(x-1,y));\n \t\t\t\tvisited[x-1][y] = true;\n \t\t\t\ts.push(testnode);\n\n \t\t\t}\n\n \t\t}else if(dir_mtr[x][y]==1){\n \t\t\t//checking the left direction\n \t\t\tif(y-1>=0 && !maze.isWall(x,y-1) && !visited[x][y-1]){\n \t\t\t\tMazeLocation testnode = new MazeLocation(x,y-1,maze.isWall(x,y-1));\n \t\t\t\tvisited[x][y-1] = true;\n \t\t\t\ts.push(testnode);\n\n \t\t\t}\n\n \t\t}else if(dir_mtr[x][y]==2){\n \t\t\t//checking the down direction\n \t\t\tif(x+1<m && !maze.isWall(x+1,y) && !visited[x+1][y]){\n \t\t\t\tMazeLocation testnode = new MazeLocation(x+1,y,maze.isWall(x+1,y));\n \t\t\t\tvisited[x+1][y] = true;\n \t\t\t\ts.push(testnode);\n\n \t\t\t}\n \t\t\t\n \t\t}else if(dir_mtr[x][y]==3){\n \t\t\t//checking the right direction\n \t\t\tif(y+1<n && !maze.isWall(x,y+1) && !visited[x][y+1]){\n \t\t\t\tMazeLocation testnode = new MazeLocation(x,y+1,maze.isWall(x,y+1));\n \t\t\t\tvisited[x][y+1] = true;\n \t\t\t\ts.push(testnode);\n\n \t\t\t}\n \t\t\t\n \t\t}else{\n \t\t\tvisited[x][y] = false;\n \t\t\ts.pop();\n \t\t}\n\n\n\n \t\t\n \t}\n\n \t//reverse the stack\n \tStack<MazeLocation> reverse;\n \treverse = new StackRefBased<MazeLocation>();\n \twhile(!s.isEmpty()){\n\t\t\t reverse.push(s.pop()); \t//push the node to the reverse stack\n\t\t\t }\n\n\n \t//if the stack is not empty, then we find the path\n\t\tif(!reverse.isEmpty()){\n\t\t\tresult = reverse.toString();\n\n\t\t}\n\n \t\n \n\n\t\t}\n\t\tcatch (StackEmptyException see) {\n \n }\n\n\n \treturn result;\n\n\n }","public void xorSet(HashMap<Integer, Integer> Path) {\n int[] newMM = new int[x.length]; // == MaxMatch (+) P\n\n // In Path, Not In MaxMatch\n for (int i : Path.keySet()) {\n int j = Path.get(i);\n int A = Math.min(i, j);\n int B = Math.max(i, j);\n if (MaxMatch[A] != B) { // (i,j) in Path and not in MaxMatch\n newMM[A] = B;\n V1.remove(A);\n V2.remove(B);\n\n //System.out.println(A + \" -- \" + B);\n //printFree();\n }\n }\n\n // In MaxMatch, Not In Path\n for (int i = 0; i < x.length; i++) {\n int j = MaxMatch[i];\n if (j != 0) {\n if (((Path.get(i) != null && Path.get(i) != j) || Path.get(i) == null) && (Path.get(j) != null && Path.get(j) != i) || Path.get(j) == null) {\n newMM[i] = j;\n V1.remove(i);\n V2.remove(j);\n //System.out.println(i + \" --- \" + j);\n //printFree();\n }\n }\n }\n MaxMatch = newMM;\n\n if (debug == 1) printMaxiumMatching();\n }","@Override\r\n public void write(byte[] b) throws IOException {\r\n int rows = (Byte.toUnsignedInt(b[0])*255) + Byte.toUnsignedInt(b[1]);\r\n int cols = (Byte.toUnsignedInt(b[2])*255) + Byte.toUnsignedInt(b[3]);\r\n int compressed_size = 12 + (((rows*cols)) / 8);\r\n if ((rows*cols) % 8 != 0)\r\n compressed_size++;\r\n\r\n byte[] to_return = new byte[compressed_size];\r\n System.arraycopy(b,0,to_return,0,12);\r\n String s1=\"\";\r\n int j=0;\r\n int index=12;\r\n //go through the body of the maze\r\n for(int i=12; i<b.length; i++){\r\n //reached end of chunk\r\n if(j==8){\r\n byte temp=(byte)Integer.parseInt(s1,2);\r\n to_return[index]=temp;\r\n index++;\r\n s1=Integer.toString(b[i]);\r\n j=1;\r\n if(i==b.length-1){\r\n //s1+=Integer.toString(b[i]);\r\n byte temp1=(byte)Integer.parseInt(s1,2);\r\n to_return[index]=temp1;\r\n }\r\n }\r\n else if(j != 8 && i==b.length-1){ //remaining in case doesn't divide in 7 completely\r\n s1+=Integer.toString(b[i]);\r\n byte temp=(byte)Integer.parseInt(s1,2); //turns from binary string to byte(0-127)\r\n to_return[index]=temp;\r\n }\r\n else{\r\n s1+=Integer.toString(b[i]);\r\n j++;\r\n }\r\n }\r\n try{\r\n if(this.out instanceof ObjectOutputStream){\r\n ObjectOutputStream o=(ObjectOutputStream)this.out;\r\n o.writeObject(to_return);\r\n }\r\n else {\r\n out.write(to_return);\r\n }\r\n }\r\n catch(Exception e){\r\n e.printStackTrace();\r\n }\r\n\r\n }","@Override\n public void write(byte[] byteMaze){\n int rowSize = ((byteMaze[0] & 0xFF) <<8) | (byteMaze[1] & 0xFF);\n int colSize = ((byteMaze[2] & 0xFF) <<8) | (byteMaze[3] & 0xFF);\n if (rowSize*colSize>= 170*170) { // Threshold between big and small mazes\n write(1); //first byte - tells the decompressor which method was used\n writeBig(byteMaze);\n }\n else {\n write(0);\n writeSmall(byteMaze);\n }\n }","public int state_build_regions(HashMap<Integer, Integer> rmap) {\r\n\t\tUnionFind u=new UnionFind();\r\n\t\t\r\n\t\t//build Unionfind\r\n\t\tfor(Integer nodeIndex:allNodes.keySet()) {\r\n\t\t\r\n\t\t\tLinkedList<Integer> neighborsIndex=nowMap.get(nodeIndex);\r\n\t\t\tif(allNodes.get(nodeIndex).path==0) {\r\n\t\t\t\tfor(Integer nIndex:neighborsIndex) {\r\n\t\t\t\t\tif(allNodes.get(nIndex).path==0)\r\n\t\t\t\t\t\tu.union(allNodes.get(nIndex),allNodes.get(nodeIndex));\r\n\t\t\t\t}\r\n\t\t\t} else if(allNodes.get(nodeIndex).path!=0) {\r\n\t\t\t\tfor(Integer nIndex:neighborsIndex) {\r\n\t\t\t\t\tif(allNodes.get(nIndex).path!=0)\r\n\t\t\t\t\t\tu.union(allNodes.get(nIndex),allNodes.get(nodeIndex));\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\t\tint rcount=1;\r\n\t\tLinkedList<Node> count=new LinkedList<Node>();\r\n\t\t//find regions\r\n\t\tfor(Integer nIndex:allNodes.keySet()) {\r\n\t\t\tNode n=allNodes.get(nIndex);\r\n\t\t\tNode np=u.find(n);\r\n\t\t\t\r\n\t\t\t\r\n\t\t\tif(np.path==0) {\r\n\t\t\t\tif(count.contains(np)) {\r\n\t\t\t\t\trmap.put(nIndex, count.indexOf(np)+1);\r\n\t\t\t\t}\r\n\t\t\t\telse {\r\n\t\t\t\t\tcount.add(np);\r\n\t\t\t\t\trmap.put(nIndex, count.indexOf(np)+1);\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t}else {\r\n\t\t\t\trmap.put(nIndex, -1);\r\n\t\t\t}\r\n\t\t\t\t\r\n\t\t}\r\n\t\r\n\t\treturn rcount;\r\n\t}","@Override\n public void visit(final OpUnion opUnion) {\n if (LOG.isDebugEnabled()) {\n LOG.debug(\"Starting visiting OpUnion\");\n }\n final OpRewriter rewriter = new OpRewriter(securityEvaluator, graphIRI);\n addOp(OpUnion.create(rewriteOp2(opUnion, rewriter), rewriter.getResult()));\n }","static void constructUnionFindDataStructure() {\n\n\t\t// construct a scanner for an input file\n\t\tScanner scanner = null;\n\t\ttry {\n\n\t\t\tscanner = new Scanner(new File(\"tinyUF.txt\"));\n\t\t} \n\t\tcatch (FileNotFoundException e) {\n\t\t\te.printStackTrace();\n\t\t}\n\n\t\t// read the number of objects from the standard input\n\t\tint n = Integer.parseInt(scanner.nextLine());\n\n\t\t// initialise a union-find data structure\n\t\tUnionFind unionFind = new UnionFind(n);\n\n\t\t/* Repeatedly read in pairs of integers (object identifiers). If they are not yet connected, connect them\n\t\t * and print out the pair */\n\n\t\twhile (scanner.hasNextLine()) {\n\n\t\t\t// read integers\n\t\t\tString pair = scanner.nextLine();\n\t\t\tString[] objects = pair.split(\" \");\n\t\t\tint p = Integer.parseInt(objects[0]);\n\t\t\tint q = Integer.parseInt(objects[1]);\n\n\t\t\t// connect them if not already\n\t\t\tif (!unionFind.connected(p, q)) {\n\n\t\t\t\tunionFind.union(p, q);\n\t\t\t\tSystem.out.println(p + \" \" + q);\n\t\t\t}\n\t\t}\n\t}","@Override\r\n\tpublic void mazeSize(Maze3d maze, String name) {\r\n\t\tString s = \"maze size \" + name + \" is \" +(maze.getXSize()*maze.getYSize()*maze.getZSize()*Integer.SIZE)/8+ \" bytes\";\r\n\t\tcontroller.printStr(s);\r\n\t}","List<CompressResult> decompress(Path input, Path output) throws IOException;","void union(int p, int q) {}","public static void mergeSortedArrays(final int MEM_SIZE, ArrayList<Integer []> inputChunks, HeapTuple[] minHeap, String outfile, final boolean ENABLE_DEBUG){\n\n FileOutputStream out;\n try{\n out = new FileOutputStream(outfile);\n }\n catch (FileNotFoundException e){\n System.err.println(e);\n return;\n }\n PrintWriter sortedFiles = new PrintWriter(out, true);\n\n int tempLength = 0;\n FHbinHeap<Integer> heap = new FHbinHeap<>();\n for (int i = 0; i < inputChunks.size(); i++) {\n Integer[] temp = inputChunks.get(i).clone();\n for(int j = 0; j < temp.length; j++){\n //Integer[] temp = inputChunks.get(i).clone();\n //System.out.print(temp[j] + \",\");\n int hi = temp[j];\n heap.insert(hi);\n }\n tempLength += temp.length;\n }\n System.out.println();\n for(int i = 0; i < tempLength; i++){\n int removal = heap.remove();\n System.out.print(removal + \",\");\n sortedFiles.print(removal + \",\");\n }\n sortedFiles.close();\n\n\n\n\n\n/* FAILED CODE\n\n Due to our sorting of the arrays, the minimum of the entire set must be the minimum of the set of the first element for all chunks\n By adding an offset to the array whose\n\n\n FHbinHeap<HeapTuple> metaHeap = null;\n HeapTuple[] heapElement = null;\n // Probably should just be a FHbinheap\n for (int i = 0; i < inputChunks.size(); i++) {\n for (int j = 0; j < MEM_SIZE; i++) {\n heapElement[i] = new HeapTuple(inputChunks.get(i)[j], i, j);\n metaHeap.insert(heapElement[i]);\n System.out.println(metaHeap.remove());\n //sortedFiles.println(metaHeap.remove());\n }\n }\n\n*/\n\n\n //First MEM_SIZE minima, no order\n /*/*\n int removed = 0;\n int [] arrayShift = new int[MEM_SIZE];\n //int innerIndex = 0;\n\n int tempLength = 0;\n\n int tempMin = 0;\n int tempMinIndex = 0;\n FHbinHeap<Integer> heap = new FHbinHeap<>();\n for (int j = 0; j < 5; j++) {\n //System.out.println(arrayShift[0] + \"ARRAYSHIFT\");\n for (int i = 0; i < inputChunks.size(); i++) {\n //FHbinHeap<Integer> heap = new FHbinHeap<>();\n Integer[] temp = inputChunks.get(i).clone();\n //System.out.println(temp[arrayShift[i]] + \",\");\n if (temp[arrayShift[i]] < tempMin) {\n tempMin = temp[arrayShift[i]];\n tempMinIndex = i;\n }\n\n\n for(int j = arrayShift[i]; j < temp.length; j++){\n //Integer[] temp = inputChunks.get(i).clone();\n System.out.print(temp[j] + \",\");\n //int hi = temp[j];\n //heap.insert(hi);\n }\n\n tempLength += temp.length;\n heap.insert(temp[arrayShift[i]]);\n //System.out.print(temp[arrayShift[i]]+ \",\");\n\n\n //int heapRemove = heap.remove();\n if (i == inputChunks.size() - 1) {\n removed = heap.remove();\n System.out.println();\n System.out.println(removed + \",MINIMUM\");\n arrayShift[tempMinIndex] = (arrayShift[tempMinIndex] + 1);\n }\n\n }\n }\n */\n\n\n\n\n }","public org.apache.gora.cascading.test.storage.TestRow getUnionRecursive() {\n return unionRecursive;\n }","protected void siftUp() {\r\n\t\tint child = theHeap.size() - 1, parent;\r\n\r\n\t\twhile (child > 0) {\r\n\t\t\tparent = (child - 1) >> 1;\t// >> 1 is slightly faster than / 2\r\n\t\t\t\t\t\t\t\t\t\t// => parent = (child - 1) / 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\tchild = parent;\r\n\t\t}\r\n\t}"],"string":"[\n \"public static void unionPathCompression(){\\n\\t\\tint n = 10;\\t\\n\\n\\t\\tdsf S = new dsf(n*n);\\n\\t\\tMaze two = new Maze(n);\\n\\n\\t\\tRandom random;\\n\\t\\tint sets = n*n;\\t//number of sets in the DSF\\n\\t\\tint randomNumber;\\n\\t\\tint randomDirection;\\n\\t\\tint row;\\n\\t\\tint col;\\n\\n\\t\\tchar upperRight; \\t//bottom or right\\n\\n\\t\\tS.print();\\n\\n\\t\\twhile(sets > 1){\\n\\t\\t\\trandom = new Random();\\n\\t\\t\\trandomNumber = random.nextInt((n*n) - 1);\\n\\t\\t\\t//System.out.println(\\\"RANDOM NUMBER: \\\"+randomNumber);\\n\\t\\t\\trow = randomNumber /n;\\t//SWITCHED\\n\\t\\t\\tcol = randomNumber %n;\\t//SWITCHED\\n\\t\\t\\trandomDirection = random.nextInt(2);\\n\\t\\t\\tString direct;\\n\\t\\t\\tif(randomDirection == 0)\\n\\t\\t\\t\\tdirect = \\\"upper\\\";\\n\\t\\t\\telse\\n\\t\\t\\t\\tdirect = \\\"right\\\";\\n\\t\\t\\tSystem.out.println(\\\"RANDOM DIRECTI0N: \\\"+direct);\\n\\t\\t\\tupperRight = two.direction(randomDirection);\\n\\n\\t\\t\\tif(upperRight == 'u'){\\n\\t\\t\\t\\tif((randomNumber) < ((n*n)-n)){\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"Sets: \\\"+sets);\\n\\t\\t\\t\\t\\tif(S.findAndCompress(randomNumber+n) != S.findAndCompress(randomNumber)){\\n\\t\\t\\t\\t\\t\\tS.union(randomNumber+n, randomNumber);\\n\\t\\t\\t\\t\\t\\ttwo.remove_wall(col, row, 'u');\\n\\t\\t\\t\\t\\t\\tS.print();\\n\\t\\t\\t\\t\\t\\tsets--;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(upperRight == 'r'){\\n\\t\\t\\t\\tif(((randomNumber)%(n*n)) != n-1){\\n\\t\\t\\t\\t\\tif(S.findAndCompress(randomNumber) != S.findAndCompress(randomNumber+1)){\\n\\t\\t\\t\\t\\t\\tS.union(randomNumber, randomNumber+1);\\n\\t\\t\\t\\t\\t\\ttwo.remove_wall(col, row, 'r');\\n\\t\\t\\t\\t\\t\\tS.print();\\n\\t\\t\\t\\t\\t\\tsets--;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tbuildAdjacencyList(two, n);\\n\\t\\tuserSelection_SolveMaze(n);\\n\\n\\n\\t\\tStdDraw.show(0);\\n\\t\\ttwo.draw();\\n\\t\\ttwo.printCellNumbers();\\n\\t}\",\n \"public static void mazeUnion(){\\n\\n\\t\\tint n = 10;\\t\\n\\n\\t\\tdsf S = new dsf(n*n);\\n\\t\\tMaze one = new Maze(n);\\n\\n\\t\\tRandom random;\\n\\t\\tint sets = n*n;\\t//number of sets in the DSF\\n\\t\\tint randomNumber;\\n\\t\\tint randomDirection;\\n\\t\\tint row;\\n\\t\\tint col;\\n\\n\\t\\tchar upperRight; \\t//bottom or right\\n\\n\\t\\tS.print();\\n\\n\\t\\twhile(sets > 1){\\n\\t\\t\\trandom = new Random();\\n\\t\\t\\trandomNumber = random.nextInt((n*n) - 1);\\n\\t\\t\\tSystem.out.println(\\\"RANDOM NUMBER: \\\"+randomNumber);\\n\\t\\t\\trow = randomNumber /n;\\t//SWITCHED\\n\\t\\t\\tcol = randomNumber %n;\\t//SWITCHED\\n\\t\\t\\trandomDirection = random.nextInt(2);\\n\\t\\t\\tString direct;\\n\\t\\t\\tif(randomDirection == 0)\\n\\t\\t\\t\\tdirect = \\\"upper\\\";\\n\\t\\t\\telse\\n\\t\\t\\t\\tdirect = \\\"right\\\";\\n\\t\\t\\tSystem.out.println(\\\"RANDOM DIRECTI0N: \\\"+direct);\\n\\t\\t\\tupperRight = one.direction(randomDirection);\\n\\n\\t\\t\\tif(upperRight == 'u'){\\n\\t\\t\\t\\tif((randomNumber) < ((n*n)-n)){\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"Sets: \\\"+sets);\\n\\t\\t\\t\\t\\tif(S.find(randomNumber+n) != S.find(randomNumber)){\\n\\t\\t\\t\\t\\t\\tS.union(randomNumber+n, randomNumber);\\n\\t\\t\\t\\t\\t\\tone.remove_wall(col, row, 'u');\\n\\t\\t\\t\\t\\t\\tS.print();\\n\\t\\t\\t\\t\\t\\tsets--;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(upperRight == 'r'){\\n\\t\\t\\t\\tif(((randomNumber)%(n*n)) != n-1){\\n\\t\\t\\t\\t\\tif(S.findAndCompress(randomNumber) != S.findAndCompress(randomNumber+1)){\\n\\t\\t\\t\\t\\t\\tS.union(randomNumber, randomNumber+1);\\n\\t\\t\\t\\t\\t\\tone.remove_wall(col, row, 'r');\\n\\t\\t\\t\\t\\t\\t//S.print();\\n\\t\\t\\t\\t\\t\\tsets--;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tStdDraw.show(0);\\n\\t\\tone.draw();\\n\\t\\tone.printCellNumbers();\\n\\t\\t\\n\\t\\tbuildAdjacencyList(one, n);\\n\\t\\tuserSelection_SolveMaze(n);\\n\\n\\t}\",\n \"public static void mazeSize(){\\n\\t\\tint n = 10;\\t\\n\\n\\t\\tdsf S = new dsf(n*n);\\n\\t\\tMaze four = new Maze(n);\\n\\n\\t\\tRandom random;\\n\\t\\tint sets = n*n;\\t//number of sets in the DSF\\n\\t\\tint randomNumber;\\n\\t\\tint randomDirection;\\n\\t\\tint row;\\n\\t\\tint col;\\n\\n\\t\\tchar upperRight; \\t//bottom or right\\n\\n\\t\\tS.print();\\n\\n\\t\\twhile(sets > 1){\\n\\t\\t\\trandom = new Random();\\n\\t\\t\\trandomNumber = random.nextInt((n*n) - 1);\\n\\t\\t\\t//System.out.println(\\\"RANDOM NUMBER: \\\"+randomNumber);\\n\\t\\t\\trow = randomNumber /n;\\t//SWITCHED\\n\\t\\t\\tcol = randomNumber %n;\\t//SWITCHED\\n\\t\\t\\trandomDirection = random.nextInt(2);\\n\\t\\t\\tString direct = null;\\n\\t\\t\\tif(randomDirection == 0)\\n\\t\\t\\t\\tdirect = \\\"upper\\\";\\n\\t\\t\\tif(randomDirection == 1)\\n\\t\\t\\t\\tdirect = \\\"right\\\";\\n\\t\\t\\t//System.out.println(\\\"RANDOM DIRECTI0N: \\\"+direct);\\n\\t\\t\\tupperRight = four.direction(randomDirection);\\n\\n\\t\\t\\tif(upperRight == 'u'){\\n\\t\\t\\t\\tif((randomNumber) < ((n*n)-n)){\\n\\t\\t\\t\\t\\t//System.out.println(\\\"Sets: \\\"+sets);\\n\\t\\t\\t\\t\\tif(S.find(randomNumber) != S.find(randomNumber + n)){\\n\\t\\t\\t\\t\\t\\tS.unionBySize(randomNumber, randomNumber+n);\\n\\t\\t\\t\\t\\t\\tfour.remove_wall(col, row, 'u');\\n\\t\\t\\t\\t\\t\\t//S.print();\\n\\t\\t\\t\\t\\t\\tsets--;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(upperRight == 'r'){\\n\\t\\t\\t\\tif(((randomNumber)%(n*n)) != n-1){\\n\\t\\t\\t\\t\\tif(S.find(randomNumber) != S.find(randomNumber+1)){\\n\\t\\t\\t\\t\\t\\tS.unionBySize(randomNumber, randomNumber+1);\\n\\t\\t\\t\\t\\t\\tfour.remove_wall(col, row, 'r');\\n\\t\\t\\t\\t\\t\\t//S.print();\\n\\t\\t\\t\\t\\t\\tsets--;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tbuildAdjacencyList(four, n);\\n\\t\\tuserSelection_SolveMaze(n);\\n\\n\\n\\t\\tStdDraw.show(0);\\n\\t\\tfour.draw();\\n\\t\\tfour.printCellNumbers();\\t\\n\\t}\",\n \"public void union(int i, int j) {\\n\\tint p = findRoot(i);\\n\\tint q = findRoot(j);\\n\\t\\n\\tif (p == q) return;\\n\\t\\n\\tif (size[p] < size[q]) { //pick the smallest tree and append it to the bigger tree\\n\\t root[p] = q;\\n\\t size[p] += size[q];\\n\\t} else {\\n\\t root[q] = p;\\n\\t size[q] += size[p];\\n\\t}\\n }\",\n \"@Test\\n\\tpublic void testUnion5() {\\n\\n\\t\\tint[] arr = {};\\n\\t\\tSLLSet listObj2 = new SLLSet(arr);\\n\\t\\tint[] uni2 = { 0, 2, 3 };\\n\\t\\tSLLSet listObj7 = new SLLSet(uni2);\\n\\t\\tSLLSet listObj8 = listObj2.union(listObj7);\\n\\n\\t\\tString expected = \\\"0, 2, 3\\\";\\n\\t\\tint expectedSize = 3;\\n\\n\\t\\tassertEquals(expectedSize, listObj8.getSize());\\n\\t\\tassertEquals(expected, listObj8.toString());\\n\\n\\t}\",\n \"public void union(int p, int q)\\n {\\n int i = root(p);\\n int j = root(q);\\n if ( i == j ) return;\\n \\n if ( sz[i] < sz[j] ) { \\n // i is no longer a root, so we don't need to update the size\\n id[i] = j; sz[j] += sz[i];\\n }\\n else {\\n id[j] = i; sz[i] += sz[j]; \\n } \\n }\",\n \"public void showMazeSize(int size);\",\n \"public void union(int p, int q)\\n {\\n int i = this.root(p);\\n int j = this.root(q);\\n if (i == j) return;\\n\\n if (this.size[i] < this.size[j])\\n {\\n this.parent[i] = j;\\n this.size[j] += this.size[i];\\n }\\n else\\n {\\n this.parent[j] = i;\\n this.size[i] += this.size[j];\\n }\\n }\",\n \"void union(int x,int y){\\n int xRoot=find(x),yRoot=find(y);\\n if(xRoot==yRoot)return;\\n if(rank[xRoot]<rank[yRoot])\\n parent[xRoot]=yRoot;\\n else if(rank[xRoot]>rank[yRoot])\\n parent[yRoot]=xRoot;\\n else{\\n parent[yRoot]=xRoot;\\n rank[xRoot]=rank[xRoot]+1;\\n }\\n --totalSets;\\n }\",\n \"protected void compress(){\\r\\n\\t\\t\\r\\n \\tmodCount++;\\r\\n\\t\\tArrayNode<T> current = beginMarker.next;\\r\\n\\t\\t\\r\\n\\t\\t//find non-full node\\r\\n\\t\\twhile (current != endMarker){\\r\\n\\t\\t\\tif (current.getLength()== current.getArraySize()){\\r\\n\\t\\t\\t\\tcurrent = current.next;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse{\\r\\n\\t\\t\\t\\tArrayNode<T> removing = current.next;\\r\\n\\t\\t\\t\\t//compression done\\r\\n\\t\\t\\t\\tif (removing==endMarker){\\r\\n\\t\\t\\t\\t\\t//remove empty nodes\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t//empty node\\r\\n\\t\\t\\t\\twhile (removing.getArraySize()==0){\\r\\n\\t\\t\\t\\t\\tremoving = removing.next;\\r\\n\\t\\t\\t\\t\\tif (removing==endMarker)\\r\\n\\t\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t//not sure why this is needed\\r\\n\\t\\t\\t\\tif (removing==endMarker){\\r\\n\\t\\t\\t\\t\\t//remove empty nodes\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t//move elements from \\\"removing\\\" node to \\\"current\\\"\\r\\n\\t\\t\\t\\tT temp = removing.removeFirst();\\r\\n\\t\\t\\t\\tcurrent.insertSorted(temp);\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t//check current length, go to next if full, otherwise redo loop\\r\\n\\t\\t\\t\\tif (current.getLength()==current.getArraySize()){\\r\\n\\t\\t\\t\\t\\tcurrent = current.next;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\t//do another sweep at end to remove empty nodes\\r\\n\\t\\tcurrent = beginMarker.next;\\r\\n\\t\\twhile (current != endMarker){\\r\\n\\t\\t\\tif (current.getArraySize()==0){\\r\\n\\t\\t\\t\\tcurrent.prev.next = current.next;\\r\\n\\t\\t\\t\\tcurrent.next.prev = current.prev;\\r\\n\\t\\t\\t\\tcurrent = current.next;\\r\\n\\t\\t\\t\\tsize--;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse{\\r\\n\\t\\t\\t\\tcurrent = current.next;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public int union(int u, int v) {\\n int p1 = find(u), p2 = find(v);\\n if (p1 == p2) {\\n return p1;\\n }\\n int s1 = _sizes[p1], s2 = _sizes[p2];\\n if (s1 > s2) {\\n _sizes[p1] += s2;\\n// int i = 1;\\n// while (s2 > 0) {\\n// if (_parents[i] == p2) {\\n// _parents[i] = p1;\\n// s2 -= 1;\\n// }\\n// i += 1;\\n// }\\n _parents[p2] = p1;\\n return s1;\\n } else {\\n _sizes[p2] += s1;\\n// int j = 1;\\n// while (s1 > 0) {\\n// if (_parents[j] == p1) {\\n// _parents[j] = p2;\\n// s1 -= 1;\\n// }\\n// j += 1;\\n// }\\n _parents[p1] = p2;\\n return s2;\\n }\\n }\",\n \"public void union(int p, int q){\\r\\n\\t\\tint rootP = root(p);\\r\\n\\t\\tint rootQ = root(q);\\r\\n\\t\\t\\r\\n\\t\\tif(rootP == rootQ) return;\\r\\n\\t\\t// Calculate height of tree and then link the root of smaller tree to root of larger tree\\r\\n\\t\\t\\r\\n\\t\\tif(size[rootP] < size[rootQ]) {\\r\\n\\t\\t\\tid[rootP] = rootQ;\\r\\n\\t\\t\\tsize[rootQ] = size[rootQ] + size[rootP];\\r\\n\\t\\t}\\r\\n\\t\\telse {\\r\\n\\t\\t\\tid[rootQ] = rootP;\\r\\n\\t\\t\\tsize[rootP] = size[rootQ] + size[rootP];\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public long generatePaths(int size) {\\n return (MoreMath.factorial(2*size).divide((\\n MoreMath.factorial(size).multiply(MoreMath.factorial(2*size - size))))).longValue();\\n }\",\n \"public ArrayList<Integer> path2Dest(int s, int t, int k, int method){\\n double INFINITY = Double.MAX_VALUE;\\n boolean[] SPT = new boolean[intersection];\\n double[] d = new double[intersection];\\n int[] parent = new int[intersection];\\n\\n for (int i = 0; i <intersection ; i++) {\\n d[i] = INFINITY;\\n parent[i] = -1;\\n }\\n d[s] = 0;\\n\\n MinHeap minHeap = new MinHeap(k);\\n for (int i = 0; i <intersection ; i++) {\\n minHeap.add(i,d[i]);\\n }\\n while(!minHeap.isEmpty()){\\n int extractedVertex = minHeap.extractMin();\\n\\n if(extractedVertex==t) {\\n break;\\n }\\n SPT[extractedVertex] = true;\\n\\n LinkedList<Edge> list = g.adjacencylist[extractedVertex];\\n for (int i = 0; i <list.size() ; i++) {\\n Edge edge = list.get(i);\\n int destination = edge.destination;\\n if(SPT[destination]==false ) {\\n double newKey =0;\\n double currentKey=0;\\n if(method==1) { //method 1\\n newKey = d[extractedVertex] + edge.weight;\\n currentKey = d[destination];\\n }\\n else{ //method 2\\n newKey = d[extractedVertex] + edge.weight + coor[destination].distTo(coor[t])-coor[extractedVertex].distTo(coor[t]);\\n currentKey = d[destination];\\n }\\n if(currentKey>=newKey){\\n if(currentKey==newKey){ //if equal need to compare the value of key\\n if(extractedVertex<parent[destination]){\\n minHeap.updateKey(newKey, destination, d[destination]);\\n parent[destination] = extractedVertex;\\n d[destination] = newKey;\\n }\\n }\\n else {\\n minHeap.updateKey(newKey, destination, d[destination]);\\n parent[destination] = extractedVertex;\\n d[destination] = newKey;\\n }\\n }\\n }\\n }\\n }\\n //trace back the path using parent properties\\n ArrayList<Integer> path = new ArrayList<>();\\n if(parent[t]!=-1){\\n path.add(t);\\n while(parent[t]!= s) {\\n path.add(0,parent[t]);\\n t = parent[t];\\n }\\n path.add(0,s);\\n }\\n else\\n path = null;\\n return path;\\n }\",\n \"public void union(int p, int q) {\\n\\t\\tint i = root(p);\\n\\t\\tint j = root(q);\\n//\\t\\tid[i] = j; instead of this do below improvement\\n\\t\\tif (sz[i] < sz[j]) {\\n\\t\\t\\tid[i] = j;\\n\\t\\t\\tsz[j] += sz[i];\\n\\t\\t} else {\\n\\t\\t\\tid[j] = i;\\n\\t\\t\\tsz[i] += sz[j];\\n\\t\\t}\\n\\t}\",\n \"List<CompressResult> compress(Path input, Path output, int maxSizeInMB) throws IOException;\",\n \"public void union(Shape s);\",\n \"int[] union(int s1,int t1,int s2,int t2)\\r\\n\\t{\\r\\n\\t\\tint [] st=new int[2];\\r\\n\\t\\t//Please fill in the program here\\r\\n\\t\\tst[0] = incCapacity();\\r\\n\\t\\taddEdge(st[0], epssymbol, s1);\\r\\n\\t\\taddEdge(st[0], epssymbol, s2);\\r\\n\\t\\tst[1] = incCapacity();\\r\\n\\t\\taddEdge(t1, epssymbol, st[1]);\\r\\n\\t\\taddEdge(t2, epssymbol, st[1]);\\r\\n\\r\\n\\t\\treturn st;\\r\\n\\t}\",\n \"public static void QTdeletionMinimization (Graph<Integer,String> g, int currentSize) {\\n\\t\\t\\r\\n\\t\\tboolean existsP4orC4 = false;\\r\\n\\t\\t\\r\\n\\t\\t//int temp = QTDelHeuristic1(Copy(g));\\r\\n\\t\\t//System.out.print(\\\"n = \\\"+g.getVertexCount()+\\\" m=\\\"+g.getEdgeCount()+\\\" hVal = \\\"+temp +\\\"\\\\n\\\");\\r\\n\\t\\tif (currentSize >= minSoFar) return; \\r\\n\\t\\tIterator<Integer> a = g.getVertices().iterator();\\r\\n\\t\\tIterator<Integer> b;\\r\\n\\t\\tIterator<Integer> c;\\r\\n\\t\\tIterator<Integer> d;\\r\\n\\t\\twhile(a.hasNext()){\\r\\n\\t\\t\\tInteger A = a.next();\\r\\n\\t\\t\\t//System.out.print(\\\"\\\"+A+\\\" \\\");\\r\\n\\t\\t\\tb = g.getNeighbors(A).iterator();\\r\\n\\t\\t\\twhile(b.hasNext()){\\r\\n\\t\\t\\t\\tInteger B = b.next();\\r\\n\\t\\t\\t\\tc = g.getNeighbors(B).iterator();\\r\\n\\t\\t\\t\\twhile (c.hasNext()){\\r\\n\\t\\t\\t\\t\\tInteger C = c.next();\\r\\n\\t\\t\\t\\t\\tif (g.isNeighbor(C, A) || C==A) continue;\\r\\n\\t\\t\\t\\t\\td = g.getNeighbors(C).iterator();\\r\\n\\t\\t\\t\\t\\twhile (d.hasNext()){\\r\\n\\t\\t\\t\\t\\t\\tInteger D = d.next();\\r\\n\\t\\t\\t\\t\\t\\tif (D==B) continue; \\r\\n\\t\\t\\t\\t\\t\\tif (g.isNeighbor(D,B)) continue;\\r\\n\\t\\t\\t\\t\\t\\t//otherwise, we have a P4 or a C4\\r\\n\\r\\n\\t\\t\\t\\t\\t\\texistsP4orC4 = true;\\r\\n\\t\\t\\t\\t\\t\\tif (currentSize + 1 >= minSoFar) return;\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t//System.out.print(\\\"Found P4: \\\"+A+\\\"-\\\"+B+\\\"-\\\"+C+\\\"-\\\"+D+\\\"... not a cograph\\\\n\\\");\\r\\n\\t\\t\\t\\t\\t\\tif (g.isNeighbor(D,A)) {\\r\\n\\t\\t\\t\\t\\t\\t\\t// we have a C4 = a-b-c-d-a\\r\\n\\t\\t\\t\\t\\t\\t\\t// delete any two edges\\r\\n\\t\\t\\t\\t\\t\\t\\tif (currentSize + 2 >= minSoFar) return;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(A, B));\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(B, C));\\r\\n\\t\\t\\t\\t\\t\\t\\tQTdeletionMinimization(g,2+currentSize);\\r\\n\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+B+\\\"-\\\"+C, B,C);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(C, D));\\r\\n\\t\\t\\t\\t\\t\\t\\tQTdeletionMinimization(g,2+currentSize);\\r\\n\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+C+\\\"-\\\"+D, C,D);\\r\\n\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(D, A));\\r\\n\\t\\t\\t\\t\\t\\t\\tQTdeletionMinimization(g,2+currentSize);\\r\\n\\t\\t\\t\\t\\t\\t\\t//g.addEdge(\\\"mar-\\\"+A+\\\"-\\\"+D, A,D);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+A+\\\"-\\\"+B, A,B);\\r\\n\\t\\t\\t\\t\\t\\t\\t// all cases with AB deleted are done. AD is STILL deleted\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(B, C));\\r\\n\\t\\t\\t\\t\\t\\t\\tQTdeletionMinimization(g,2+currentSize);\\r\\n\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+B+\\\"-\\\"+C, B,C);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(C, D));\\r\\n\\t\\t\\t\\t\\t\\t\\tQTdeletionMinimization(g,2+currentSize);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t// all cases with AB deleted or AD deleted are done\\r\\n\\t\\t\\t\\t\\t\\t\\t// at this point, CD and AD are still deleted\\r\\n\\t\\t\\t\\t\\t\\t\\t// only need to try BC and CD together deleted.\\r\\n\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+A+\\\"-\\\"+D, A,D);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(B, C));\\r\\n\\t\\t\\t\\t\\t\\t\\tQTdeletionMinimization(g,2+currentSize);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+B+\\\"-\\\"+C, B,C);\\r\\n\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+C+\\\"-\\\"+D, C,D);\\r\\n\\t\\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\\r\\n\\t\\t\\t\\t\\t\\telse {\\r\\n\\t\\t\\t\\t\\t\\t\\t// this case says:\\r\\n\\t\\t\\t\\t\\t\\t\\t// else D is NOT adjacent to A. Then we have P4=abcd\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tint choice = randomInt(1,4);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tif (choice == 1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(A, B));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tQTdeletionMinimization(g,1+currentSize);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+A+\\\"-\\\"+B, A,B);\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\t\\t\\t\\t\\t\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\telse if (choice == 2) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(C, D));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tQTdeletionMinimization(g,1+currentSize);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+C+\\\"-\\\"+D, C,D);\\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\\telse {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(B, C));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tQTdeletionMinimization(g,1+currentSize);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+B+\\\"-\\\"+C, B,C);\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tif (existsP4orC4==true) {\\r\\n\\t\\t\\t\\t\\t\\t\\t// it found an obstruction and branched on all its ways.\\r\\n\\t\\t\\t\\t\\t\\t\\t// No need to deal with this graph further.\\r\\n\\t\\t\\t\\t\\t\\t\\treturn;\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t} // end d.hasNext()\\r\\n\\t\\t\\t\\t} // end c.hasNext()\\r\\n\\t\\t\\t} // end b.hasNext() \\r\\n\\t\\t} // end a.hasNext()\\r\\n\\r\\n\\t\\t// if we reached here, no P4 was found\\r\\n\\t\\tif (existsP4orC4 == false) {\\r\\n\\t\\t\\t// arrived at a quasi-threshold graph since no P4 or C4 was found\\r\\n\\t\\t\\tSystem.out.print(\\\"\\\\n currentSize = \\\"+currentSize+\\\" and minSoFar = \\\"+minSoFar+\\\"\\\\n\\\");\\r\\n\\t\\t\\tSystem.out.print(\\\"Modified graph has \\\"+g.getEdgeCount()+\\\" edges and is:\\\\n\\\");\\r\\n\\t\\t\\tminSoFar = currentSize;\\r\\n\\t\\t\\tSystem.out.print(\\\"\\\"+g+\\\"\\\\n\\\");\\r\\n\\t\\t\\tNewTools.printToFile(currentSize,g,null,\\\"QTDel.txt\\\");\\r\\n\\t\\t\\t//NewTools.DrawIt(g);\\r\\n\\t\\t\\t//PleaseWait(60000); // one minute\\r\\n\\t\\t\\treturn;\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\t// ...\\r\\n\\t\\tSystem.out.print(\\\"Critical Error. No P_4 or C_4 found in a non-quasi-threshold graph.\\\\n\\\");\\r\\n\\t\\treturn;\\r\\n\\r\\n\\t\\t\\r\\n\\t}\",\n \"public static void main(String[] args) {\\n\\t\\tStopwatch timer = new Stopwatch();\\n\\t\\t//for(int i = 0; i< 10;i++) {\\n\\t\\t\\tIn in = new In(args[0]);\\n\\t\\t\\tSizeWeightedQuickUnionVisualizer q = new SizeWeightedQuickUnionVisualizer(in.readInt());\\n\\t\\t\\twhile(!in.isEmpty()) {\\n\\t\\t\\t\\tint m = in.readInt();\\n\\t\\t\\t\\tint n = in.readInt();\\n\\t\\t\\t\\tif(q.isConnected(m, n)) continue;\\n\\t\\t\\t\\tq.union(m, n);\\n\\t\\t\\t}\\n\\t\\t//}\\n\\t\\tdouble time = timer.elapsedTime();\\n\\t\\t//System.out.println(\\\"the average time of 10 trials is : \\\" + time/10 + \\\" seconds\\\");\\n\\t\\t//System.out.println(\\\"the number of components is \\\"+ q.count()+\\\" the number of total array accesses is \\\"+q.sum + \\\" the average nodes' depth is: \\\"+ q.getAvgDepth()+\\\" time: \\\"+time+\\\" seconds\\\");\\n\\t}\",\n \"void Union(subset [] subsets, int x , int y ){ \\n\\t\\tint xroot = find(subsets, x); \\n\\t int yroot = find(subsets, y); \\n\\t \\n\\t\\tif (subsets[xroot].rank < subsets[yroot].rank) \\n\\t\\t\\tsubsets[xroot].parent = yroot; \\n\\t\\telse if (subsets[yroot].rank < subsets[xroot].rank) \\n\\t\\t\\tsubsets[yroot].parent = xroot; \\n\\t\\telse{ \\n\\t\\t\\tsubsets[xroot].parent = yroot; \\n\\t\\t\\tsubsets[yroot].rank++; \\n\\t\\t} \\n\\t}\",\n \"public static void union(String a, String b) {\\r\\n int root1 = find(a);\\r\\n int root2 = find(b);\\r\\n if (root1 == root2)return;\\r\\n if(size.get(root1) < size.get(root2)){size.set(root2, size.get(root2)+size.get(root1)); position.set(root1, root2);}\\r\\n else {size.set(root1, size.get(root1)+size.get(root2)); position.set(root2, root1);}\\r\\n }\",\n \"public void setUnionRecursive(org.apache.gora.cascading.test.storage.TestRow value) {\\n this.unionRecursive = value;\\n setDirty(3);\\n }\",\n \"public void union(Vertex v1, Vertex v2) {\\n\\n // find the two vertices' path root\\n Vertex r1 = find(v1);\\n Vertex r2 = find(v2);\\n\\n // if the two roots are equal, just return\\n if(r1.equals(r2)){\\n return;\\n } else if(r1.getSize()>r2.getSize()){\\n // if the r1 path size is greater than r2\\n // just change the vertex 2's root to vertex 1\\n r2.setRoot(r1);\\n // increment the size of r1 set\\n r1.setSize(r2.getSize());\\n } else {\\n r1.setRoot(r2);\\n r2.setSize(r1.getSize());\\n }\\n \\n }\",\n \"private PriorityQueue<Edge> _getKruskalTree(boolean input)\\n{\\n PriorityQueue<Edge> completeTree = new PriorityQueue<Edge>();\\n for (int loop = 0;\\n loop < this.nVerts;\\n loop++\\n ) {\\n for (int innerLoop = 0;\\n innerLoop < this.adjMat[loop].length;\\n innerLoop++\\n ) {\\n /*\\n * Once we identify a weighted edge, we find its position in the\\n * minimum priority queue.\\n */\\n int edgeDistance = this.adjMat[loop][innerLoop];\\n if (INFINITY == edgeDistance) {\\n continue;\\n }\\n completeTree.add(new Edge(loop, innerLoop, edgeDistance));\\n }\\n }\\n if (true == input) {\\n return completeTree;\\n }\\n /*\\n * Once we have the queue, we can display the tree and see how much it\\n * weighs.\\n * Now we make a set of vertices for UnionFind{}. This will help us to find\\n * cycles.\\n */\\n UnionFind union = new UnionFind(this.nVerts);\\n PriorityQueue<Edge> output = new PriorityQueue<Edge>();\\n while (0 != completeTree.size()) {\\n /*\\n * We know that the completeTree will include each edge twice, so we can\\n * skip the next item. It will be the same edge.\\n */\\n Edge nextEdge = completeTree.remove();\\n if (union.find(nextEdge.srcVert) == union.find(nextEdge.destVert)) {\\n continue;\\n }\\n union.union(nextEdge.srcVert, nextEdge.destVert);\\n output.add(nextEdge);\\n }\\n return output;\\n}\",\n \"public void union(int p, int q) {\\n\\t\\tint i = find(p);\\n\\t\\tint j = find(q);\\n\\t\\tif (i == j)\\n\\t\\t\\treturn;\\n\\t\\t\\n\\t\\t// make shorter root point to taller one\\n\\t\\tif (height[i] < height[j]) parent[i] = j;\\n\\t else if (height[i] > height[j]) parent[j] = i;\\n\\t else {\\n\\t \\tparent[j] = i;\\n\\t height[i]++;\\n\\t }\\n\\t\\tcount--;\\n\\t}\",\n \"public int CalcDistance ( )\\r\\n\\t{\\r\\n\\t\\tfor ( int i = 0; i<size; i++ )\\r\\n\\t\\t{\\r\\n\\t\\t\\tfor ( int offR = 0; offR <= size/2; offR++ )\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tfor ( int c = 0; c <= size/2; c++ )\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tif ( offR == 0 && maze [offR] [c].isOpenUp() )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmaze [offR] [c].setDistanceToExit( 1 );\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\telse if ( maze [offR] [c].isOpenUp() && maze [offR-1] [c].isOpenDown() )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmaze [offR] [c].setDistanceToExit( \\r\\n\\t\\t\\t\\t\\t\\t\\t\\tMath.min( maze [offR-1] [c].getDistanceToExit()+1,\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t maze [offR] [c].getDistanceToExit() ) );\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\tif ( c == 0 && maze [offR] [c].isOpenLeft() )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmaze [offR] [c].setDistanceToExit( 1 );\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\telse if ( maze [offR] [c].isOpenLeft() && maze [offR] [c-1].isOpenRight() )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmaze [offR] [c].setDistanceToExit( \\r\\n\\t\\t\\t\\t\\t\\t\\t\\tMath.min( maze [offR] [c-1].getDistanceToExit()+1,\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t maze [offR] [c].getDistanceToExit() ) );\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tfor ( int c = size-1; c >= size/2; c-- )\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tif ( offR == 0 && maze [offR] [c].isOpenUp() )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmaze [offR] [c].setDistanceToExit( 1 );\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\telse if ( maze [offR] [c].isOpenUp() && maze [offR-1] [c].isOpenDown() )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmaze [offR] [c].setDistanceToExit( \\r\\n\\t\\t\\t\\t\\t\\t\\t\\tMath.min( maze [offR-1] [c].getDistanceToExit()+1,\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t maze [offR] [c].getDistanceToExit() ) );\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\tif ( c == size-1 && maze [offR] [c].isOpenRight() )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmaze [offR] [c].setDistanceToExit( 1 );\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\telse if ( maze [offR] [c].isOpenRight() && maze [offR] [c+1].isOpenLeft() )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmaze [offR] [c].setDistanceToExit( \\r\\n\\t\\t\\t\\t\\t\\t\\t\\tMath.min( maze [offR] [c+1].getDistanceToExit()+1,\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t maze [offR] [c].getDistanceToExit() ) );\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tfor ( int offR = size-1; offR >= size/2; offR-- )\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tfor ( int c = 0; c <= size/2; c++ )\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tif ( offR == size-1 && maze [offR] [c].isOpenDown() )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmaze [offR] [c].setDistanceToExit( 1 );\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\telse if ( maze [offR] [c].isOpenDown() && maze [offR+1] [c].isOpenUp() )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmaze [offR] [c].setDistanceToExit( \\r\\n\\t\\t\\t\\t\\t\\t\\t\\tMath.min( maze [offR+1] [c].getDistanceToExit()+1,\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t maze [offR] [c].getDistanceToExit() ) );\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\tif ( c == 0 && maze [offR] [c].isOpenLeft() )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmaze [offR] [c].setDistanceToExit( 1 );\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\telse if ( maze [offR] [c].isOpenLeft() && maze [offR] [c-1].isOpenRight() )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmaze [offR] [c].setDistanceToExit( \\r\\n\\t\\t\\t\\t\\t\\t\\t\\tMath.min( maze [offR] [c-1].getDistanceToExit()+1,\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t maze [offR] [c].getDistanceToExit() ) );\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tfor ( int c = size-1; c >= size/2; c-- )\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tif ( offR == size-1 && maze [offR] [c].isOpenDown() )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmaze [offR] [c].setDistanceToExit( 1 );\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\telse if ( maze [offR] [c].isOpenDown() && maze [offR+1] [c].isOpenUp() )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmaze [offR] [c].setDistanceToExit( \\r\\n\\t\\t\\t\\t\\t\\t\\t\\tMath.min( maze [offR+1] [c].getDistanceToExit()+1,\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t maze [offR] [c].getDistanceToExit() ) );\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\tif ( c == size-1 && maze [offR] [c].isOpenRight() )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmaze [offR] [c].setDistanceToExit( 1 );\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\telse if ( maze [offR] [c].isOpenRight() && maze [offR] [c+1].isOpenLeft() )\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tmaze [offR] [c].setDistanceToExit( \\r\\n\\t\\t\\t\\t\\t\\t\\t\\tMath.min( maze [offR] [c+1].getDistanceToExit()+1,\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t maze [offR] [c].getDistanceToExit() ) );\\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\\treturn maze [currentRow] [currentCol].getDistanceToExit();\\r\\n\\t}\",\n \"public void union(int i, int j) {\\n\\n int root1 = find(i);\\n int root2 = find(j);\\n\\n if (root2 == root1)\\n return;\\n\\n if (_rank[root1] > _rank[root2]) {\\n _parent[root2] = root1;\\n } else if (_rank[root2] > _rank[root1]) {\\n _parent[root1] = root2;\\n } else {\\n _parent[root2] = root1;\\n _rank[root1]++;\\n }\\n }\",\n \"public static void QuasiThresholdEditingMinimization (Graph<Integer,String> g, int currentSize, EditSet S){\\n\\t\\t\\r\\n\\t\\tboolean existsP4orC4 = false;\\r\\n\\t\\tif (currentSize >= minSoFarQTEdit) return; \\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t\\tIterator<Integer> a = g.getVertices().iterator();\\r\\n\\t\\tIterator<Integer> b;\\r\\n\\t\\tIterator<Integer> c;\\r\\n\\t\\tIterator<Integer> d;\\r\\n\\t\\twhile(a.hasNext()){\\r\\n\\t\\t\\tInteger A = a.next();\\r\\n\\t\\t\\t//System.out.print(\\\"\\\"+A+\\\" \\\");\\r\\n\\t\\t\\tb = g.getNeighbors(A).iterator();\\r\\n\\t\\t\\twhile(b.hasNext()){\\r\\n\\t\\t\\t\\tInteger B = b.next();\\r\\n\\t\\t\\t\\tc = g.getNeighbors(B).iterator();\\r\\n\\t\\t\\t\\twhile (c.hasNext()){\\r\\n\\t\\t\\t\\t\\tInteger C = c.next();\\r\\n\\t\\t\\t\\t\\tif (g.isNeighbor(C, A) || C==A) continue;\\r\\n\\t\\t\\t\\t\\td = g.getNeighbors(C).iterator();\\r\\n\\t\\t\\t\\t\\twhile (d.hasNext()){\\r\\n\\t\\t\\t\\t\\t\\tInteger D = d.next();\\r\\n\\t\\t\\t\\t\\t\\tif (D==B) continue; \\r\\n\\t\\t\\t\\t\\t\\tif (g.isNeighbor(D,B)) continue;\\r\\n\\t\\t\\t\\t\\t\\t//otherwise, we have a P4 or a C4\\r\\n\\r\\n\\t\\t\\t\\t\\t\\texistsP4orC4 = true;\\r\\n\\t\\t\\t\\t\\t\\t//System.out.print(\\\"Found P4: \\\"+A+\\\"-\\\"+B+\\\"-\\\"+C+\\\"-\\\"+D+\\\"... not a cograph\\\\n\\\");\\r\\n\\r\\n\\t\\t\\t\\t\\t\\tif (g.isNeighbor(D,A)) {\\r\\n\\t\\t\\t\\t\\t\\t\\t// we have a C4 = a-b-c-d-a\\r\\n\\t\\t\\t\\t\\t\\t\\t// add a diagonal chord or delete any two edges\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\tif (S.isIn(A, C)==-1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"e\\\"+A+\\\",\\\"+C, A,C);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.add(A,C);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tQuasiThresholdEditingMinimization(g,1+currentSize,S);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(A, C));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.remove(A,C);\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\tif (S.isIn(B,D) == -1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"e\\\"+B+\\\",\\\"+D, B,D);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.add(B,D);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tQuasiThresholdEditingMinimization(g,1+currentSize,S);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(B,D));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.remove(B,D);\\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\\tif (S.isIn(A,B) == -1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(A, B));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.add(A,B);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tif (S.isIn(B,C) == -1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(B, C));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tS.add(B,C);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tQuasiThresholdEditingMinimization(g,2+currentSize,S);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+B+\\\"-\\\"+C, B,C);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tS.remove(B,C);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tif (S.isIn(C,D) == -1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(C, D));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tS.add(C,D);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tQuasiThresholdEditingMinimization(g,2+currentSize,S);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+C+\\\"-\\\"+D, C,D);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tS.remove(C,D);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tif (S.isIn(D, A) == -1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(D, A));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tS.add(D,A);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tQuasiThresholdEditingMinimization(g,2+currentSize,S);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+D+\\\"-\\\"+A, D,A);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tS.remove(D,A);\\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\\t\\tg.addEdge(\\\"mar-\\\"+A+\\\"-\\\"+B,A,B);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.remove(A, B);\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t// all cases with AB deleted are done.\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tif (S.isIn(D,A) == -1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(D,A));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.add(D,A);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tif (S.isIn(B,C) == -1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(B, C));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tS.add(B,C);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tQuasiThresholdEditingMinimization(g,currentSize+2,S);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+B+\\\"-\\\"+C, B,C);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tS.remove(B,C);\\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\\t\\tif (S.isIn(C,D) == -1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(C, D));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tS.add(C,D);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tQuasiThresholdEditingMinimization(g,currentSize+2,S);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+C+\\\"-\\\"+D,C,D);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tS.remove(C,D);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+A+\\\"-\\\"+D, A,D);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.remove(D,A);\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t// all cases with AB deleted or AD deleted are done\\r\\n\\t\\t\\t\\t\\t\\t\\t// only need to try BC and CD together deleted.\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\tif (S.isIn(B,C)== -1 && S.isIn(C, D)== -1) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(B, C));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(C, D));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.add(B,C);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.add(C,D);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tQuasiThresholdEditingMinimization(g,currentSize+2,S);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+B+\\\"-\\\"+C, B,C);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+C+\\\"-\\\"+D, C,D);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.remove(B,C);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.remove(C,D);\\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\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t} // end of C4-handling cases\\r\\n\\r\\n\\t\\t\\t\\t\\t\\telse {\\r\\n\\t\\t\\t\\t\\t\\t\\t// this case says:\\r\\n\\t\\t\\t\\t\\t\\t\\t// else D is NOT adjacent to A. Then we have P4=abcd\\r\\n\\t\\t\\t\\t\\t\\t\\t// either add ac or bd or else delete one edge\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t//int branchCase = randomInt(1,5);\\t\\r\\n\\t\\t\\t\\t\\t\\t//if (branchCase <= 2) {\\r\\n\\t\\t\\t\\t\\t\\t\\tif (S.isIn(A, C) == -1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"e\\\"+A+\\\",\\\"+C, A, C);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.add(A,C);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tQuasiThresholdEditingMinimization(g,currentSize+1,S);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(A, C));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.remove(A,C);\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\tif (S.isIn(B,D) == -1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"e\\\"+B+\\\",\\\"+D, B, D);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.add(B,D);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tQuasiThresholdEditingMinimization(g,currentSize+1,S);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(B, D));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.remove(B,D);\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t//}\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t//else if (branchCase == 3) {\\r\\n\\t\\t\\t\\t\\t\\t\\tif (S.isIn(A,B)== -1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(A, B));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.add(A, B);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tQuasiThresholdEditingMinimization(g,currentSize+1,S);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+A+\\\"-\\\"+B, A,B);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.remove(A,B);\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t//}\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t//else if (branchCase == 4) {\\r\\n\\t\\t\\t\\t\\t\\t\\tif (S.isIn(B,C) == -1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(B, C));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.add(B, C);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tQuasiThresholdEditingMinimization(g,currentSize+1,S);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+B+\\\"-\\\"+C, B,C);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.remove(B,C);\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t//}\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t//else if (branchCase == 5) {\\r\\n\\t\\t\\t\\t\\t\\t\\tif (S.isIn(C,D) == -1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.removeEdge(g.findEdge(C, D));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.add(C,D);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tQuasiThresholdEditingMinimization(g,currentSize+1,S);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tg.addEdge(\\\"mar-\\\"+C+\\\"-\\\"+D, C,D);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tS.remove(C,D);\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t//}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t} // end of P4-handling\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tif (existsP4orC4 == true) return;\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t} // end d.hasNext()\\r\\n\\t\\t\\t\\t} // end c.hasNext()\\r\\n\\t\\t\\t} // end b.hasNext()\\r\\n\\t\\t} // end a.hasNext()\\r\\n\\r\\n\\t\\t// if we reached here, no P4 was found\\r\\n\\t\\tif (existsP4orC4 == false) {\\r\\n\\t\\t\\t// arrived at a quasi-threshold graph since no P4 or C4 was found\\r\\n\\t\\t\\tSystem.out.print(\\\"\\\\n currentSize = \\\"+currentSize+\\\" and minSoFar = \\\"+minSoFarQTEdit+\\\"\\\\n\\\");\\r\\n\\t\\t\\tSystem.out.print(\\\"Modified(Edited) graph has \\\"+g.getEdgeCount()+\\\" edges and is:\\\\n\\\");\\r\\n\\t\\t\\tminSoFarQTEdit = currentSize;\\r\\n\\t\\t\\tSystem.out.print(\\\"\\\"+g+\\\"\\\\n\\\");\\r\\n\\t\\t\\tSystem.out.print(\\\"Edit set is \\\" + S + \\\"\\\\n\\\");\\r\\n\\t\\t\\tNewTools.printToFile(currentSize,g,S,\\\"QTEditLesMis.txt\\\");\\r\\n\\t\\t\\treturn;\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\t// ...\\r\\n\\t\\tSystem.out.print(\\\"Critical Error. No P_4 or C_4 found in a non-quasi-threshold graph.\\\\n\\\");\\r\\n\\t\\treturn;\\r\\n\\t}\",\n \"private void calculate() {\\n\\t\\tList<Edge> path = new ArrayList<>();\\n\\t\\tPriorityQueue<Vert> qv = new PriorityQueue<>();\\n\\t\\tverts[s].dist = 0;\\n\\t\\tqv.add(verts[s]);\\n\\t\\twhile (!qv.isEmpty()) {\\n\\t\\t\\tVert v = qv.poll();\\n\\t\\t\\tint vidx = v.idx;\\n\\t\\t\\tfor (Edge e : v.edges) {\\n\\t\\t\\t\\tif (e.w==0) {\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tVert vo = verts[e.other(vidx)];\\n\\t\\t\\t\\tif (vo.dist > v.dist + e.w) {\\n\\t\\t\\t\\t\\tvo.dist = v.dist + e.w;\\n\\t\\t\\t\\t\\tqv.add(vo);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (verts[t].dist < L) {\\n\\t\\t\\tok = false;\\n\\t\\t\\treturn;\\n\\t\\t} else if (verts[t].dist == L) {\\n\\t\\t\\tok = true;\\n\\t\\t\\tfor (int i=0; i<m; i++) {\\n\\t\\t\\t\\tif (edges[i].w == 0) {\\n\\t\\t\\t\\t\\tedges[i].w = MAX_DIST;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\t// replace 0 with 1, adding to za list\\n\\t\\tfor (int i=0; i<m; i++) {\\n\\t\\t\\tif (edges[i].w == 0) {\\n\\t\\t\\t\\tza[i] = true;\\n\\t\\t\\t\\tedges[i].w = 1;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tza[i] = false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t// looking for shortest path from s to t with 0\\n\\t\\tfor (int i=0; i<n; i++) {\\n\\t\\t\\tif (i != s) {\\n\\t\\t\\t\\tverts[i].dist = MAX_DIST;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tqv.clear();\\n\\t\\tqv.add(verts[s]);\\n\\t\\twhile (!qv.isEmpty()) {\\n\\t\\t\\tVert v = qv.poll();\\n\\t\\t\\tint vidx = v.idx;\\n\\t\\t\\tfor (Edge e : v.edges) {\\n\\t\\t\\t\\tVert vo = verts[e.other(vidx)];\\n\\t\\t\\t\\tif (vo.dist > v.dist + e.w) {\\n\\t\\t\\t\\t\\tvo.dist = v.dist + e.w;\\n\\t\\t\\t\\t\\tqv.add(vo);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (verts[t].dist > L) {\\n\\t\\t\\tok = false;\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tVert v = verts[t];\\n\\t\\twhile (v.dist > 0) {\\n\\t\\t\\tlong minDist = MAX_DIST;\\n\\t\\t\\tVert vMin = null;\\n\\t\\t\\tEdge eMin = null;\\n\\t\\t\\tfor (Edge e : v.edges) {\\n\\t\\t\\t\\tVert vo = verts[e.other(v.idx)];\\n\\t\\t\\t\\tif (vo.dist+e.w < minDist) {\\n\\t\\t\\t\\t\\tvMin = vo;\\n\\t\\t\\t\\t\\teMin = e;\\n\\t\\t\\t\\t\\tminDist = vMin.dist+e.w;\\n\\t\\t\\t\\t}\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\tv = vMin;\\t\\n\\t\\t\\tpath.add(eMin);\\n\\t\\t}\\n\\t\\tCollections.reverse(path);\\n\\t\\tfor (int i=0; i<m; i++) {\\n\\t\\t\\tif (za[i]) {\\n\\t\\t\\t\\tedges[i].w = MAX_DIST;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tlong totLen=0;\\n\\t\\tboolean wFixed = false;\\n\\t\\tfor (Edge e : path) {\\n\\t\\t\\ttotLen += (za[e.idx] ? 1 : e.w);\\n\\t\\t}\\n\\t\\tfor (Edge e : path) {\\n\\t\\t\\tif (za[e.idx]) {\\n\\t\\t\\t\\tif (!wFixed) {\\n\\t\\t\\t\\t\\te.w = L - totLen + 1;\\n\\t\\t\\t\\t\\twFixed = true;\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\te.w = 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tok = true;\\n\\t}\",\n \"public void findShortestPath() {\\r\\n\\t\\t\\r\\n\\t\\t//Create a circular array that will store the possible next tiles in the different paths.\\r\\n\\t\\tOrderedCircularArray<MapCell> path = new OrderedCircularArray<MapCell>();\\r\\n\\t\\t\\r\\n\\t\\t//Acquire the starting cell.\\r\\n\\t\\tMapCell starting = cityMap.getStart();\\r\\n\\t\\t\\r\\n\\t\\t//This variable is to be updated continuously with the cell with the shortest distance value in the circular array.\\r\\n\\t\\tMapCell current=null;\\r\\n\\t\\t\\r\\n\\t\\t//This variable is to check if the destination has been reached, which is initially false.\\r\\n\\t\\tboolean destination = false;\\r\\n\\t\\t\\r\\n\\t\\t//Add the starting cell into the circular array, and mark it in the list.\\r\\n\\t\\tpath.insert(starting, 0);\\r\\n\\t\\t\\r\\n\\t\\tstarting.markInList(); \\r\\n\\t\\t\\r\\n\\t\\ttry {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//As long as the circular array isn't empty, and the destination hasn't been reached, run this loop.\\r\\n\\t\\t\\twhile(!path.isEmpty()&&!destination) {\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t//Take the cell with the shortest distance out of the circular array, and mark it accordingly.\\r\\n\\t\\t\\t\\tcurrent = path.getSmallest();\\r\\n\\t\\t\\t\\tcurrent.markOutList();\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tMapCell next;\\r\\n\\t\\t\\t\\tint distance;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif(current.isDestination()) {\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tdestination = true; //If the current cell is the destination, end the loop.\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tnext = nextCell(current); //Acquire the next possible neighbour of the current cell.\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t//Don't run if next is null, meaning there is no other possible neighbour in the path for the current cell.\\r\\n\\t\\t\\t\\t\\twhile(next!=null) {\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tdistance = current.getDistanceToStart() + 1;\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t//If the distance of the selected neighbouring cell is currently more than 1 more than the current cell's \\r\\n\\t\\t\\t\\t\\t\\t//distance, update the distance of the neighbouring cell. Then, set the current cell as its predecessor.\\r\\n\\t\\t\\t\\t\\t\\tif(next.getDistanceToStart()>distance) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tnext.setDistanceToStart(distance);\\r\\n\\t\\t\\t\\t\\t\\t\\tnext.setPredecessor(current);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tdistance = next.getDistanceToStart(); \\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tif(next.isMarkedInList() && distance<path.getValue(next)) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tpath.changeValue(next, distance); //If the neighbouring cell is in the circular array, but with a \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t //larger distance value than the new updated distance, change its value.\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t} else if(!next.isMarkedInList()){\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tpath.insert(next, distance); //If the neighbouring cell isn't in the circular array, add it in.\\r\\n\\t\\t\\t\\t\\t\\t\\tnext.markInList();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tnext = nextCell(current); //Look for the next possible neighbour, if any.\\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}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//Catch all the possible exceptions that might be thrown by the method calls. Print the appropriate messages.\\r\\n\\t\\t} catch (EmptyListException e) {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tSystem.out.println(e.getMessage());\\r\\n\\t\\t\\tSystem.out.println(\\\"Path finding execution stopped.\\\");\\r\\n\\t\\t\\t\\r\\n\\t\\t} catch (InvalidNeighbourIndexException e) {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tSystem.out.println(\\\"The program tried to access an invalid neighbour of a tile.\\\");\\r\\n\\t\\t\\tSystem.out.println(\\\"Path finding execution stopped.\\\");\\r\\n\\t\\t\\t\\r\\n\\t\\t} catch (InvalidDataItemException e) {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tSystem.out.println(e.getMessage());\\r\\n\\t\\t\\tSystem.out.println(\\\"Path finding execution stopped.\\\");\\r\\n\\t\\t\\t\\r\\n\\t\\t} catch (Exception e) {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tSystem.out.println(e.getMessage()+\\\" Path finding execution has stopped.\\\");\\r\\n\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\t//If a path was found, print the number of tiles in the path.\\r\\n\\t\\tif(destination) {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tSystem.out.println(\\\"Number of tiles in path: \\\" + (current.getDistanceToStart()+1));\\r\\n\\t\\t\\t\\r\\n\\t\\t} else {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tSystem.out.println(\\\"No path found.\\\"); //Otherwise, indicate that a path wasn't found.\\r\\n\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t}\",\n \"public int noOfMPaths2Dest(int s,int t,int k){\\n double INFINITY = Double.MAX_VALUE;\\n boolean[] SPT = new boolean[intersection];\\n double[] resultPath = new double[intersection];\\n LinkedList<Integer>[] parent = new LinkedList[intersection]; //using linked list instead of array to store all the possible parent of an intersection\\n\\n for (int i = 0; i <intersection ; i++) {\\n resultPath[i] = INFINITY;\\n parent[i] = new LinkedList<>();\\n }\\n\\n //decrease the distance for the first index\\n resultPath[s] = 0;\\n\\n //add all the vertices to the MinHeap\\n MinHeap minHeap = new MinHeap(k);\\n for (int i = 0; i <intersection ; i++) {\\n minHeap.add(i,resultPath[i]);\\n }\\n //while minHeap is not empty\\n while(!minHeap.isEmpty()){\\n //extract the min\\n int extractedVertex = minHeap.extractMin();\\n\\n if(extractedVertex==t) {\\n break;\\n }\\n SPT[extractedVertex] = true;\\n\\n LinkedList<Edge> list = g.adjacencylist[extractedVertex];\\n for (int i = 0; i <list.size() ; i++) {\\n Edge edge = list.get(i);\\n int destination = edge.destination;\\n if(SPT[destination]==false ) {\\n\\n double newKey = resultPath[extractedVertex] + edge.weight ;\\n double currentKey = resultPath[destination];\\n if(currentKey>=newKey){\\n minHeap.updateKey(newKey, destination,resultPath[destination]);\\n parent[destination].add(extractedVertex);\\n resultPath[destination] = newKey;\\n }\\n }\\n }\\n }\\n int numofPath =0;\\n\\n //calculate the number of path\\n if(parent[t]!=null){\\n boolean[] isVisited = new boolean[intersection];\\n ArrayList<Integer> pathList = new ArrayList<>();\\n pathList.add(t);\\n numofPath = findAllPathsUtil(s, t, isVisited, pathList,numofPath,parent); //dfs\\n\\n }\\n return numofPath;\\n }\",\n \"public void union(BlastGraph<HitVertex, ValueEdge> graphToUnion) {\\n\\t\\tfor (HitVertex hv : graphToUnion.getVertices()) {\\n\\t\\t\\tthis.addVertex(hv);\\n\\t\\t}\\n\\n\\t\\tfor (ValueEdge ve : graphToUnion.getEdges()) {\\n\\t\\t\\tthis.addEdge(ve, graphToUnion.getEndpoints(ve));\\n\\t\\t}\\n\\t}\",\n \"public static void execute(StringBuffer path, HashMap<String, Zpair> stores\\n , HashSet<Zpair> visited, List<String> q111\\n , List<Integer> sortedQueue) {\\n\\n //System.out.println(\\\" \\\" + executeCounter++);\\n //System.out.println(\\\"This is the path : \\\" + path);\\n int size = path.length(); // size of current path\\n StringBuffer oldPath = new StringBuffer(path.substring(0,size-1));\\n\\n Zpair tuple = stores.get(oldPath.toString()); // (q1,s1) = stores[oldPath]\\n List<Integer> q = new ArrayList<Integer>(tuple.first); // q = q1.copy()\\n List<Integer> s = new ArrayList<Integer>(tuple.second); // s = s1.copy()\\n\\n char qORs = path.charAt(size - 1);\\n\\n if (qORs == 'Q') {\\n if (!moveQ1(q, s)) {\\n return;\\n }\\n } else if (qORs == 'S') {\\n if (!moveS1(q, s)) {\\n return;\\n }\\n }\\n if (size % 2 == 0) {\\n if (q.equals(sortedQueue)) {\\n //printList(q);\\n //printList(s);\\n System.out.println(path);\\n System.exit(1);\\n }\\n }\\n\\n Zpair tuple1 = new Zpair(ZMethods.listCopyOfIntegers(q)\\n , ZMethods.listCopyOfIntegers(s));\\n\\n stores.put(path.toString(), tuple1);\\n if (!visited.contains(tuple1)) {\\n visited.add(tuple1);\\n if (q.size() != 0 && s.size() != 0) {\\n if (q.get(0) == s.get(s.size() - 1)) {\\n q111.add(path + \\\"Q\\\");\\n return;\\n }\\n }\\n if (q.size() != 0) {\\n q111.add(path + \\\"Q\\\");\\n }\\n if (s.size() != 0) {\\n q111.add(path + \\\"S\\\");\\n }\\n //printList(q111);\\n }\\n }\",\n \"public static void main(String[] args) throws FileNotFoundException, IOException {\\n BufferedReader sc = new BufferedReader(new FileReader(\\\"comehome.in\\\"));\\n BufferedWriter out = new BufferedWriter(new FileWriter(\\\"comehome.out\\\"));\\n int[][] adjMat = new int[58][58];\\n ArrayList<Character> capsUsed = new ArrayList<Character>();\\n int paths = Integer.parseInt(sc.readLine());\\n for (int i = 0; i < adjMat.length; i++) {\\n Arrays.fill(adjMat[i], 500000);\\n }\\n for (int i = 0; i < paths; i++) {\\n String[] spl = sc.readLine().split(\\\" \\\");\\n char u = spl[0].charAt(0);\\n char v = spl[1].charAt(0);\\n int weight = Integer.parseInt(spl[2]);\\n adjMat[map(u)][map(v)] = Math.min(weight, adjMat[map(u)][map(v)]);//this is a multigraph, just take minimum edge weight\\n adjMat[map(v)][map(u)] = Math.min(weight, adjMat[map(v)][map(u)]);//since its the only one that will count\\n if (Character.isUpperCase(u)) {\\n capsUsed.add(u);\\n }\\n if (Character.isUpperCase(v)) {\\n capsUsed.add(v);\\n }\\n }\\n for (int k = 0; k < adjMat.length; k++) {//intermediate...\\n for (int i = 0; i < adjMat.length; i++) {\\n for (int j = 0; j < adjMat.length; j++) {\\n if (adjMat[i][k] + adjMat[k][j] < adjMat[i][j]) {\\n adjMat[i][j] = adjMat[i][k] + adjMat[k][j];\\n }\\n }\\n }\\n }\\n int min = Integer.MAX_VALUE;\\n char minChar = '0';\\n int zMap = map('Z');\\n for (char c : capsUsed) {\\n if (c != 'Z') {\\n if (adjMat[map(c)][zMap] < min) {\\n min = adjMat[map(c)][zMap];\\n minChar = c;\\n }\\n }\\n }\\n //System.out.println(adjMat[map('R')][map('Z')]);\\n out.append(minChar + \\\" \\\" + min + \\\"\\\\n\\\");\\n out.close();\\n }\",\n \"public void union(int first, int second){\\n int firstId = find(first);\\n int secondId = find(second);\\n //Check if these are already connected\\n if(firstId == secondId){\\n return;\\n }\\n if(size[firstId] < size[secondId]){\\n size[secondId]+=size[firstId];\\n grid[first] = secondId;\\n }\\n else {\\n size[firstId]+=size[secondId];\\n grid[second] = firstId;\\n }\\n --numOfComponents;\\n }\",\n \"public void sizeOfTiles(int size)\\n{\\n if(m != null )\\n {\\n m.getOutputImageManager().setTileSize(size);\\n //refresh row shift for new size of tiles\\n if(m.getOutputImageManager().getMosaic() != null)\\n {\\n m.getOutputImageManager().setEvenRowShift(m.getOutputImageManager().getEvenRowShift());\\n m.getOutputImageManager().setOddRowShift(m.getOutputImageManager().getOddRowShift());\\n m.getOutputImageManager().getMosaic().setHoverIndex(0,0);\\n //println(m.getOutputImageManager().getMosaic().getFlipH()[0].length);\\n }\\n m.getOutputImageManager().setToRerender();\\n }\\n}\",\n \"void union(int x, int y) {\\n\\n // **** set the modes in the parents array ****\\n if (parents[x] == 0)\\n parents[x] = x;\\n\\n if (parents[y] == 0)\\n parents[y] = y;\\n\\n // **** update the representative element of each set ****\\n if (parents[x] != 0 || parents[y] != 0) {\\n\\n // **** get the low and high from these nodes ****\\n int high = Math.max(parents[x], parents[y]);\\n int low = Math.min(parents[x], parents[y]);\\n\\n // ???? ????\\n System.out.println(\\\"union <<< high: \\\" + high + \\\" low: \\\" + low);\\n\\n // **** update to point to the proper representative ****\\n for (int i = 0; i < parents.length; i++) {\\n if (parents[i] == high)\\n parents[i] = low;\\n }\\n }\\n }\",\n \"@Test\\n public void testMatchLimitOneBottomUp() throws Exception {\\n\\n HepProgramBuilder programBuilder = HepProgram.builder();\\n programBuilder.addMatchLimit( 1 );\\n programBuilder.addMatchOrder( HepMatchOrder.BOTTOM_UP );\\n programBuilder.addRuleInstance( UnionToDistinctRule.INSTANCE );\\n\\n checkPlanning( programBuilder.build(), UNION_TREE );\\n }\",\n \"public void writeBig (byte[] b) {\\n if (b.length<12)\\n try {\\n throw new IOException();\\n } catch (IOException e) {\\n e.printStackTrace();\\n }\\n\\n Map<String,Integer> codes = new LinkedHashMap<>();\\n ArrayList<Pair<Integer,Integer>> array = new ArrayList<>();\\n int arrIndex=0;\\n array.add(arrIndex++,new Pair<>(0,0));\\n int k=12;\\n codes.put(String.valueOf(b[k]),arrIndex);\\n array.add(arrIndex++,new Pair((int)b[k++],0));\\n\\n for (; k<b.length; k++){\\n int pointer=0;\\n String current = String.valueOf(b[k]);\\n while (codes.containsKey(current) && k<b.length-1){\\n pointer=codes.get(current);\\n k++;\\n current+=String.valueOf(b[k]);\\n }\\n if (codes.containsKey(current) && k==b.length-1) {\\n array.add(arrIndex, new Pair(2, codes.get(current)));\\n codes.put(current,arrIndex);\\n }\\n else{\\n array.add(arrIndex,new Pair((int)b[k],pointer));\\n codes.put(current,arrIndex++);\\n }\\n }\\n\\n //Write compressed array//\\n for (int i=0; i< 12 ; i++) //maze dimensions + start/goal\\n write(b[i]);\\n int pointerSize= array.size()>128 ? (array.size()>32768 ? 3 : 2) : 1; // how many bytes to represent the pointer\\n write(pointerSize);\\n// System.out.println(\\\"DEBUG : array size:\\\" + array.size()+\\\" unit size: \\\"+(pointerSize+1)); //DEBUGGING\\n for (Pair<Integer, Integer> Pair : array) { //send array\\n byte cell = (byte) (Pair.getKey()<<7);\\n cell = (byte) (cell | (Pair.getValue()>>(8*(pointerSize-1))));\\n write(cell);\\n for (int j = pointerSize - 2; j >= 0; j--) {\\n cell=(byte) (Pair.getValue() >> 8 * j);\\n write(cell);\\n }\\n }\\n write(array.get(array.size()-1).getKey()); //last cell key (0/1/2)\\n //Finish writing compressed array//\\n }\",\n \"private static void stepSorter(String file, DataOutputStream d, int size) throws FileNotFoundException, IOException {\\n\\t\\tDataInputStream inputA = new DataInputStream(new BufferedInputStream(new FileInputStream(new File(file))));\\n\\t\\tDataInputStream inputB = new DataInputStream(new BufferedInputStream(new FileInputStream(new File(file))));\\n\\t\\tint numDivisions = (int) Math.ceil(fileSize/((double) size));\\n\\t\\tinputB.skip(size*4);\\n\\t\\tfor (int j = 0; j < numDivisions/2; j++){\\t\\n\\t\\t\\tint counterA = size;\\n\\t\\t\\tint counterB = Math.min(fileSize - j*size*2 - size, size);\\n\\t\\t\\tInteger a = inputA.readInt();\\n\\t\\t\\tInteger b = inputB.readInt();\\n\\t\\t\\twhile (counterA > 0 && counterB > 0){\\n\\t\\t\\t\\tif (a < b){\\n\\t\\t\\t\\t\\td.writeInt(a);\\n\\t\\t\\t\\t\\tif (counterA > 1){\\n\\t\\t\\t\\t\\t\\ta = inputA.readInt();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tcounterA--;\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\td.writeInt(b);\\n\\t\\t\\t\\t\\tif (counterB > 1){\\n\\t\\t\\t\\t\\t\\tb = inputB.readInt();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tcounterB--;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (counterA == 0){\\n\\t\\t\\t\\td.writeInt(b);\\n\\t\\t\\t\\tcounterB--;\\n\\t\\t\\t\\tfor (int i =0; i < counterB; i++){\\n\\t\\t\\t\\t\\td.writeInt(inputB.readInt());\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else {\\n\\t\\t\\t\\td.writeInt(a);\\n\\t\\t\\t\\tcounterA--;\\n\\t\\t\\t\\tfor (int i =0; i < counterA; i++){\\n\\t\\t\\t\\t\\td.writeInt(inputA.readInt());\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tinputA.skip(size*4);\\n\\t\\t\\tinputB.skip(size*4);\\n\\t\\t}\\n\\t\\t\\n\\t\\t//copy the excess\\n\\t\\twhile (inputA.available()>0){\\n\\t\\t\\td.writeInt(inputA.readInt());\\n\\t\\t}\\n\\t\\tinputA.close();\\n\\t\\tinputB.close();\\n\\t\\td.flush();\\n\\t}\",\n \"@Override\\n public void serverStrategy(InputStream inputStream, OutputStream outputStream) {\\n try {\\n ObjectInputStream fromClient = new ObjectInputStream(inputStream);\\n ObjectOutputStream toClient = new ObjectOutputStream(outputStream);\\n toClient.flush();\\n Object obFromClient = fromClient.readObject();\\n if (obFromClient == null || !(obFromClient instanceof Maze)) return;\\n //setting variables\\n Maze mazeFromClient = (Maze)obFromClient;\\n String tempFolder = System.getProperty(\\\"java.io.tmpdir\\\");\\n Solution solToReturn = null;\\n //search if the maze exists\\n byte[] byteMazeFromClient = mazeFromClient.toByteArray();\\n boolean stop = false;\\n int i = 0;\\n for (; i < count && !stop; i++) {\\n //Path fileLocation = Paths.get(tempFolder + \\\"/m\\\" + i + \\\".txt\\\");\\n String fileLocation = tempFolder + \\\"/m\\\" + i + \\\".txt\\\";\\n //System.out.println(Thread.currentThread().getId()+\\\" reading maze from \\\"+fileLocation);\\n //byte[] currByteArray = Files.readAllBytes(fileLocation);\\n synchronized (this) {\\n InputStream in = new MyDecompressorInputStream(new FileInputStream(fileLocation));\\n byte currByteArray[] = new byte[sizes.get(i)];\\n in.read(currByteArray);\\n in.close();\\n Maze maze = new Maze(currByteArray);\\n stop = Arrays.equals(maze.toByteArray(), byteMazeFromClient);\\n }\\n\\n }\\n //if exists - return solution\\n if (stop) {\\n i--;\\n //System.out.println(Thread.currentThread().getId()+\\\" found solution: \\\"+i);\\n solToReturn = returnSolution(i, tempFolder);\\n } else {//save and solve:\\n //save the maze\\n synchronized (this) {\\n //Path file = Paths.get(tempFolder + \\\"/m\\\" + count + \\\".txt\\\");\\n //Files.write(file, mazeFromClient.toByteArray());\\n String path = tempFolder + \\\"/m\\\" + count + \\\".txt\\\";\\n //System.out.println(Thread.currentThread().getId()+\\\" writing maze to \\\"+path);\\n String file = tempFolder + \\\"/m\\\" + count + \\\".txt\\\";\\n\\n OutputStream out = new MyCompressorOutputStream(new FileOutputStream(file));\\n byte[] toWrite = mazeFromClient.toByteArray();\\n out.write(toWrite);\\n out.flush();\\n out.close();\\n sizes.put(count,toWrite.length);\\n //System.out.println(Thread.currentThread().getId()+\\\" finished writing maze, count==\\\"+count);\\n //solve\\n SearchableMaze searchableMaze = new SearchableMaze(mazeFromClient);\\n/*\\n ASearchingAlgorithm searcher = Configurations.getAlgorithm();\\n*/\\n ASearchingAlgorithm searcher = new BestFirstSearch();\\n solToReturn = searcher.solve(searchableMaze);\\n //save solution\\n writeSolution(solToReturn, tempFolder, count);\\n count++;//increase counter\\n }\\n }\\n //send solution\\n toClient.writeObject(solToReturn);\\n } catch (IOException e) {\\n e.printStackTrace();\\n } catch (ClassNotFoundException e) {\\n e.printStackTrace();\\n }\\n }\",\n \"public static void union(int u, int v) {\\n\\t\\tu = root(u); // optimizations\\n\\t\\tv = root(v); // to make find faster\\n\\t\\tif (u == v) return; // already in same component\\n\\t\\t\\n\\t\\tif (size[u] >= size[v]) {\\n\\t\\t\\tp[v] = u;\\n\\t\\t\\tsize[u] += size[v];\\n\\t\\t} else {\\n\\t\\t\\tp[u] = v;\\n\\t\\t\\tsize[v] += size[u];\\n\\t\\t}\\n\\t}\",\n \"public static void main(String[] args) throws IOException {\\n BufferedReader bufferedReader = new BufferedReader(new FileReader(UFTest.class.getResource(\\\"/\\\").getPath()+\\\"1.5/largeUF.txt\\\"));\\n String str = bufferedReader.readLine();\\n UFLJWQU uf = new UFLJWQU(Integer.parseInt(str));\\n long beginTime =System.currentTimeMillis();\\n while ((str = bufferedReader.readLine())!=null){\\n String[] array = str.split(\\\" \\\");\\n int p = Integer.parseInt(array[0]);\\n int q = Integer.parseInt(array[1]);\\n if(uf.connected(p,q)) continue;\\n uf.union(p,q);\\n// System.out.println(p+\\\" -- \\\"+q);\\n }\\n System.out.println(uf.count());\\n System.out.println(\\\"cost time :\\\"+(System.currentTimeMillis() - beginTime));\\n }\",\n \"public static void pathMethod (int x, int y, int rows, int columns, int startPointX, int startPointY, int endPointX, int endPointY, String [][]copyArray, String [][]realArray, int decider) throws Exception{ \\r\\n \\r\\n String up = copyArray[y-1][x];\\r\\n String down = copyArray[y+1][x];\\r\\n String right = copyArray[y][x+1]; //moves the coordinate up one, down one, right one, left one and stores it into up down left right; \\r\\n String left = copyArray[y][x-1];\\r\\n \\r\\n if(up.equals(\\\"X\\\")||down.equals(\\\"X\\\")||right.equals(\\\"X\\\")||left.equals(\\\"X\\\")){ //if up right left or down is equal to the endpoint, the maze is solvable, and we can now print the final array\\r\\n System.out.println(\\\"\\\\nThe maze is solvable!\\\");\\r\\n// printFinalArray(realArray, counter, xvalues, yvalues); //solution is found already - sends back to another method to print final solution\\r\\n regenerate(decider); //then sends to regenerate method where it asks if user would like to create another maze\\r\\n }\\r\\n \\r\\n else if(copyArray[startPointY+1][startPointX].equals(\\\"B\\\")&©Array[startPointY-1][startPointX].equals(\\\"B\\\")&©Array[startPointY][startPointX+1].equals(\\\"B\\\")&©Array[startPointY][startPointX-1].equals(\\\"B\\\")){\\r\\n \\r\\n System.out.println(\\\"\\\\nSorry, your maze is unsolvable.\\\\n\\\\n\\\"); //if at the start point we cannot go up down left or right - no possible moves - not solvable - end of maze \\r\\n regenerate(decider); //call the method that gives users the option to recreate the maze if it was unsolvable \\r\\n } \\r\\n \\r\\n else if(up.equals(\\\"O\\\")){ //if the coordinate in the up direction is O\\r\\n counter=counter+1; //incrementing counter so we can input it the coordinate arrays\\r\\n copyArray[y][x] = \\\"V\\\"; //changing the values to 'V' so we can know that we already visited it\\r\\n y=y-1; //moving coordinate up one \\r\\n xvalues[counter]=x; //storing this coordinate into the arrays with the counter\\r\\n yvalues[counter]=y;\\r\\n pathMethod(x, y, rows, columns, startPointX, startPointY, endPointX, endPointY, copyArray, realArray, decider); //recalling method\\r\\n }\\r\\n \\r\\n else if(down.equals(\\\"O\\\")){ //if down = O\\r\\n copyArray[y][x] = \\\"V\\\";\\r\\n counter=counter+1;\\r\\n y=y+1; \\r\\n xvalues[counter]=x;\\r\\n yvalues[counter]=y;\\r\\n pathMethod(x, y, rows, columns, startPointX, startPointY, endPointX, endPointY, copyArray, realArray, decider);\\r\\n }\\r\\n \\r\\n else if(right.equals(\\\"O\\\")){ //if right equals O\\r\\n copyArray[y][x] = \\\"V\\\";\\r\\n counter=counter+1;\\r\\n x=x+1;\\r\\n xvalues[counter]=x;\\r\\n yvalues[counter]=y;\\r\\n pathMethod(x, y, rows, columns, startPointX, startPointY, endPointX, endPointY, copyArray, realArray, decider);\\r\\n }\\r\\n \\r\\n else if(left.equals(\\\"O\\\")){ //if left equals O\\r\\n copyArray[y][x] = \\\"V\\\";\\r\\n counter=counter+1;\\r\\n x=x-1;\\r\\n xvalues[counter]=x;\\r\\n yvalues[counter]=y;\\r\\n pathMethod(x, y, rows, columns, startPointX, startPointY, endPointX, endPointY, copyArray, realArray, decider);\\r\\n }\\r\\n \\r\\n else { //if neither up down left or right work\\r\\n for(int i = 0; i<rows; i++){ //makes all the 'V's go back to O\\r\\n for(int j = 0; j<columns; j++){\\r\\n if(copyArray[i][j].equals(\\\"V\\\")){\\r\\n copyArray[i][j] = \\\"O\\\";\\r\\n }\\r\\n }\\r\\n }\\r\\n copyArray[y][x] = \\\"B\\\"; //make the coordinate that you cant make a move with B, so it shortens the possible path options\\r\\n for(int i = 0 ; i<counter; i++){\\r\\n xvalues[i] = 0; //resets the coordinate arrays back to 0\\r\\n yvalues[i] = 0;\\r\\n }\\r\\n counter=0; //resets counter back to 0;\\r\\n pathMethod(startPointX, startPointY, rows, columns, startPointX, startPointY, endPointX, endPointY, copyArray, realArray, decider); //resends the startpoints instead of x and y; only thing different is that one coordinate is now marked \\\"B\\\"\\r\\n } \\r\\n }\",\n \"@SuppressWarnings(\\\"unlikely-arg-type\\\")\\r\\n\\tpublic static void main(String[] args) throws InterruptedException, ExecutionException, IOException {\\r\\n\\t\\t// TODO Auto-generated method stub\\r\\n\\r\\n\\t\\t// System.out.println(\\\"what\\\");\\r\\n\\t\\tint k = 7;\\r\\n\\r\\n\\t\\tchar[] set = { 'a', 'b', 'c' };\\r\\n\\t\\tchar[] str = new char[k];\\r\\n \\r\\n\\t\\tenumeratePaths(k, set, str, 0); // call function to generate the paths\\r\\n\\t back_Up();// function to back up set of paths\\r\\n\\t\\t\\t\\t\\t\\t// information\\r\\n\\t\\t \\r\\n\\r\\n\\t\\tint[] lb = new int[R];// lower bound\\r\\n\\t\\tint[] ub = new int[R];// upper bound\\r\\n\\r\\n\\t\\tfor (int j = 0; j < R; j++) { // the sample range of integers is between 1 and 100\\r\\n\\t\\t\\tlb[j] = -1000; // lower bound\\r\\n\\t\\t\\tub[j] = 1000; // upper bound\\r\\n\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tfor (int run = 0; run < RUN; run++) {\\r\\n\\r\\n\\t\\t\\tint[][] x = new int[pop_num][R];\\r\\n\\t\\t\\tint[][] v = new int[pop_num][R];\\r\\n\\t\\t\\t //id = 0;\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//paths.put(new String(str) , false);\\r\\n\\t\\t\\tobj_total = 0;\\r\\n\\t\\t\\t group_1_count = 0;\\r\\n\\t\\t group_2_count = 0;\\r\\n\\t\\t\\t group_3_count = 0;\\r\\n\\t\\t\\t group_4_count = 0;\\r\\n\\t\\t\\t group_5_count = 0;\\r\\n\\t\\t\\t group_6_count = 0;\\r\\n\\t\\t\\t group_7_count = 0;\\r\\n\\t\\t\\t group_8_count = 0;\\r\\n\\t\\t\\t group_9_count = 0;\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t group_10_count = 0;\\r\\n\\t\\t\\t group_11_count = 0;\\r\\n\\t\\t\\t group_12_count = 0;\\r\\n\\t\\t\\t group_13_count = 0;\\r\\n\\t\\t\\t group_14_count = 0;\\r\\n\\t\\t\\t group_15_count = 0;\\r\\n\\t\\t\\t group_16_count = 0;\\r\\n\\t\\t\\t group_17_count = 0;\\r\\n\\t\\t\\t group_18_count = 0;\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t// pick_counter_1 = 0;\\r\\n\\t\\t\\t \\r\\n\\t\\t\\t group_19_count = 0;\\r\\n\\t\\t\\t group_20_count = 0;\\r\\n\\t\\t\\t group_21_count = 0;\\r\\n\\t\\t\\t group_22_count = 0;\\r\\n\\t\\t\\t group_23_count = 0;\\r\\n\\t\\t\\t group_24_count = 0;\\r\\n\\t\\t\\t group_25_count = 0;\\r\\n\\t\\t\\t group_26_count = 0;\\r\\n\\t\\t\\t group_27_count = 0;\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t group_28_count = 0;\\r\\n\\t\\t\\t group_29_count = 0;\\r\\n\\t\\t\\t group_30_count = 0;\\r\\n\\t\\t\\t group_31_count = 0;\\r\\n\\t\\t\\t group_32_count = 0;\\r\\n\\t\\t\\t group_33_count = 0;\\r\\n\\t\\t\\t group_34_count = 0;\\r\\n\\t\\t\\t group_35_count = 0;\\r\\n\\t\\t\\t group_36_count = 0;\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t group_37_count = 0;\\r\\n\\t group_38_count = 0;\\r\\n\\t\\t\\t group_39_count = 0;\\r\\n\\t\\t\\t group_40_count = 0;\\r\\n\\t\\t\\t group_41_count = 0;\\r\\n\\t\\t\\t group_42_count = 0;\\r\\n\\t\\t\\t group_43_count = 0;\\r\\n\\t\\t\\t group_44_count = 0;\\r\\n\\t\\t\\t group_45_count = 0;\\r\\n\\t\\t\\t\\r\\n\\t\\t group_46_count = 0;\\r\\n\\t\\t\\t group_47_count = 0;\\r\\n\\t\\t\\t group_48_count = 0;\\r\\n\\t\\t\\t group_49_count = 0;\\r\\n\\t\\t\\t group_50_count = 0;\\r\\n\\t\\t group_51_count = 0;\\r\\n\\t\\t\\t group_52_count = 0;\\r\\n\\t\\t\\t group_53_count = 0;\\r\\n\\t\\t\\t group_54_count = 0;\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t group_55_count = 0;\\r\\n\\t\\t\\t group_56_count = 0;\\r\\n\\t\\t\\t group_57_count = 0;\\r\\n\\t\\t\\t group_58_count = 0;\\r\\n\\t\\t\\t group_59_count = 0;\\r\\n\\t\\t\\t group_60_count = 0;\\r\\n\\t\\t\\t group_61_count = 0;\\r\\n\\t\\t group_62_count = 0;\\r\\n\\t\\t\\t group_63_count = 0;\\r\\n\\t\\t group_64_count = 0;\\r\\n\\t\\t\\t\\r\\n\\t\\t solution_1 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_2 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_3 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_4 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_5 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_6 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_7 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_8 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_9 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_10 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_11 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_12 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_13 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_14 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_15 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_16 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_17 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_18 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_19 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_20 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_21 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_22 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_23 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_24 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_25 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_26 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_27 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_28 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_29 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_30 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_31 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_32 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_33 = new int[500][R];\\r\\n\\r\\n\\t\\t\\t\\tsolution_34 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_35 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_36 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_37 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_38 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_39 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_40 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_41 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_42 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_43 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_44 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_45 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_46 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_47 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_48 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_49 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_50 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_51 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_52 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_53 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_54 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_55 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_56 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_57 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_58 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_59 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_60 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_61 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_62 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_63 = new int[500][R];\\r\\n\\t\\t\\t\\tsolution_64 = new int[500][R];\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\r\\n\\t\\t crossover_count = 0;\\r\\n boolean statusChecker =false;\\r\\n\\t\\t\\tLinkedHashMap<String, List<Double>> parent_maps = new LinkedHashMap<String, List<Double>>();\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tLinkedHashMap<String, List<Double>> offspring_maps = new LinkedHashMap<String, List<Double>>();\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tLinkedHashMap<String, List<Double>> combined_maps = new LinkedHashMap<String, List<Double>>();\\r\\n\\t\\t//\\tLinkedHashMap<String, List<Double>> fitnessmaps = new LinkedHashMap<String, List<Double>>();\\r\\n\\r\\n\\t\\t\\tLinkedHashMap<String, Integer> setrank1 = new LinkedHashMap<String, Integer>();\\r\\n\\t\\t\\r\\n\\r\\n\\t\\t\\tList<String> updated_population = new ArrayList<String>();\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tList<String> combined_population = new ArrayList<String>();\\r\\n\\t\\t\\tList<String> offspring_population = new ArrayList<String>();\\r\\n\\t\\t\\t//List<String> parent_population = new ArrayList<String>();\\r\\n\\t\\t\\tList<String> single_population = new ArrayList<String>();\\r\\n\\r\\n\\t\\t\\tList<String> combined_population_list = new ArrayList<String>();\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tList<String> temporary_path_holder = new ArrayList<String>();\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tList<String> parents_population = new ArrayList<String>();\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tList<String> parents_population_copy = new ArrayList<String>();\\r\\n\\t\\t\\t\\r\\n\\t\\t//\\tString traverse_template;\\r\\n\\r\\n\\t\\t\\t// the 2d arrays below hold the solutions to each respective group\\r\\n\\t\\t\\tint [][] solution = new int[500][R];\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t//\\tboolean [] statu = new boolean [PATHNUM];\\r\\n\\t\\t\\t\\t\\r\\n\\r\\n\\t\\t\\tint totalpathcounter = 0;\\r\\n\\r\\n\\t\\t\\tint obj_total = 0;\\r\\n\\r\\n\\t\\t\\tString getfinalpath = null;\\r\\n\\t\\t\\t//String getfinalpath;\\r\\n\\r\\n\\t\\t\\tif (run > 0) { // in each run reset the number counter of the paths covered in each group\\r\\n\\r\\n\\t\\t\\t\\treset_All();\\r\\n\\t\\t\\t\\tpaths.clear();\\r\\n\\t\\t\\t\\tupdated_population.clear();\\r\\n\\t\\t\\t\\tcombined_population.clear();\\r\\n\\t\\t\\t\\toffspring_population.clear();\\r\\n\\t\\t\\t\\tsingle_population.clear();\\r\\n\\t\\t\\t\\toffspring_maps.clear();\\r\\n\\t\\t\\t\\tsetrank1.clear();\\r\\n\\t\\t\\t\\t//setrank2.clear();\\r\\n\\t\\t\\t\\t//offspring_maps.clear();\\r\\n\\t\\t\\t\\tparents_population_copy.clear();\\r\\n\\t\\t\\t\\tcombined_maps.clear();\\r\\n\\t\\t\\t\\tparent_maps.clear();\\r\\n\\t\\t\\t\\tpaths.putAll(temporay_paths); \\r\\n\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\tfor (int i = 0; i < pop_num; i++) // initialize the population with the dimension of R values/inputs\\r\\n\\t\\t\\t{\\r\\n\\r\\n\\t\\t\\t\\tfor (int j = 0; j < R; j++) {\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tx[i][j] = (int)(Math.random()*((ub[j] - lb[j])+1))+ lb[j];\\r\\n\\r\\n\\t\\t\\t\\t} //initial random population\\r\\n\\r\\n\\t\\t\\t\\tgetfinalpath = pathnum(x[i]); \\r\\n\\t\\t\\t\\t//archiving( String check_path_group , int num, int[][] offspring)\\r\\n int pickPaths= 0;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tSet<String> keyz = paths.keySet();\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tfor (String key : keyz) {\\r\\n\\r\\n\\t\\t\\t\\t\\tif (pickPaths < 50) { //pick subset of N paths\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\ttarget_subset.put(key + \\\" \\\" + \\\"new\\\", false);\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tpickPaths++;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\telse {\\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}\\r\\n\\r\\n\\t\\t\\t\\tparents_population.add(\\\"parent\\\" + \\\" \\\" + i);\\r\\n\\t\\t\\t\\t//record covered path and find group where it belongs\\r\\n\\t\\t\\t\\t//save test case in corresponding path group\\r\\n\\t\\t\\t\\tarchiving( getfinalpath , i, x);\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\tparents_population_copy.addAll(parents_population);\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tcombined_population_list.addAll(parents_population_copy);\\t\\r\\n\\t\\t\\t///offspring_population.addAll(parents_population_copy);\\r\\n\\t\\t\\t//Cycle[run] = 1;\\r\\n\\r\\n\\t\\t\\t\\tlong start_time = System.currentTimeMillis();\\r\\n\\t\\t\\t\\tlong wait_time = 1518750;\\r\\n\\t\\t\\t\\tlong end_time = start_time + wait_time;\\r\\n\\t\\t\\t\\tList<Double> temp_2 = new ArrayList<Double>();\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t // int generation = 0;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\twhile ((System.currentTimeMillis() < end_time) && obj_total < PATHNUM_NUMBER) // not exceeded the set\\r\\n\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t//LinkedHashMap<String, List<Double>> parent_maps_init = new LinkedHashMap<String, List<Double>>(); \\r\\n\\t\\t\\t\\t//initial random population tournament selection\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t//List<Double> temp = new ArrayList<Double>();\\r\\n\\t\\t\\t\\t\\tif (crossover_count == 0) {\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tRandom random = new Random();\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tfor (int i = 0; i < 25; i++) {\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t//pick two parents to cross\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tString randomKey_1 = parents_population_copy.get( random.nextInt(parents_population_copy.size())) ;\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tparents_population_copy.remove(randomKey_1);\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tString randomKey_2 = parents_population_copy.get( random.nextInt(parents_population_copy.size())) ;\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tparents_population_copy.remove(randomKey_2);\\r\\n\\t\\t\\t\\t\\t\\t//access parent via parent_maps_init\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t//split the string\\r\\n\\t\\t\\t\\t\\t\\t//parents_population.add(\\\"parent\\\" + \\\" \\\" + i);\\r\\n\\t\\t\\t\\t\\t\\tString [] parent_1_string = randomKey_1.split(\\\" \\\");\\t\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tString par_1;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\tint pos_1;\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tpar_1 = parent_1_string[0];\\r\\n\\t\\t\\t\\t\\t\\tpos_1 = Integer.parseInt(parent_1_string[1]);\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n // String [] parent_2_string = randomKey_2.split(\\\" \\\");\\t\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tString [] parent_2_string = randomKey_1.split(\\\" \\\");\\t\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tString par_2;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\tint pos_2;\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tpar_2 = parent_2_string[0];\\r\\n\\t\\t\\t\\t\\t\\tpos_2 = Integer.parseInt(parent_2_string[1]);\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t //System.out.println(\\\"Random number 1 : \\\"+Math.random()\\r\\n\\t\\t\\t\\t\\t\\t//crossover nbased on probability\\r\\n\\t\\t\\t\\t \\tRandom rand = new Random();\\r\\n\\t\\t\\t\\t\\t//\\tdouble rdm = rand.nextDouble();\\t\\t \\r\\n\\t\\t\\t\\t\\t\\tdouble rdm = Math.random();\\r\\n\\t\\t\\t\\t\\t\\t if(rdm < 0.75) {\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t//single-point crossover\\r\\n\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t \\t//randomly find a position and exchange the tails\\r\\n\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\tint parent_1_random = rand.nextInt(R);\\r\\n\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t int new_point = parent_1_random; \\r\\n\\t\\t\\t\\t\\t\\t //exchange elements with parent_2\\r\\n\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t //\\tint[][] temporal = new int[pop_num][R];\\r\\n\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t for (int j = 0 ; j < R; j++) {\\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 \\tv[pos_1][j] = x[pos_1][j];\\r\\n\\t\\t\\t\\t\\t\\t \\tv[pos_2][j] = x[pos_2][j];\\r\\n\\t\\t\\t\\t\\t \\t\\t\\r\\n\\t\\t\\t\\t\\t \\t}\\r\\n\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t int g = new_point;\\r\\n\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t // for (int g = new_point ; new_point < R; new_point++) {\\r\\n\\t\\t\\t\\t\\t \\t\\t\\r\\n\\t\\t\\t\\t\\t \\twhile (g <= R){\\t\\r\\n\\t\\t\\t\\t\\t \\t\\t//switch the tails of parent one and parent two\\r\\n\\t\\t\\t\\t\\t\\t \\tv[pos_1][g] = x[pos_2][g];\\r\\n\\t\\t\\t\\t\\t\\t \\tv[pos_2][g] = x[pos_1][g];\\r\\n\\r\\n\\t\\t\\t\\t\\t \\t g++;\\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\\tdouble mutate = Math.random();\\r\\n\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t if(mutate < (1/R)) { \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t int child_1 = (int) (Math.random() * R);\\r\\n\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t \\tint child_2 = (int) (Math.random() * R);\\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 \\tv[pos_1][child_1] = (int)(Math.random()*((ub[child_1] - lb[child_1])+1))+ lb[child_1];\\r\\n\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t \\toffspring_population.add(\\\"child\\\" + \\\" \\\" + pos_1);\\r\\n\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t \\tv[pos_2][child_2] = (int)(Math.random()*((ub[child_2] - lb[child_2])+1))+ lb[child_2]; \\r\\n\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t \\toffspring_population.add(\\\"child\\\" + \\\" \\\" + pos_2);\\r\\n\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t }\\r\\n\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t else {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t offspring_population.add(\\\"child\\\" + \\\" \\\" + pos_1);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t offspring_population.add(\\\"child\\\" + \\\" \\\" + pos_2);\\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\\t }\\r\\n\\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 \\t\\r\\n\\t\\t\\t\\t\\t \\t\\tfor (int j = 0 ; j < R; j++) {\\r\\n\\t\\t\\t\\t\\t\\t \\t\\t\\r\\n\\t\\t\\t\\t\\t\\t \\t\\t\\r\\n\\t\\t\\t\\t\\t\\t \\t\\tv[pos_1][j] = x[pos_1][j];\\r\\n\\t\\t\\t\\t\\t\\t \\t\\tv[pos_2][j] = x[pos_2][j];\\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\\t\\r\\n\\t\\t\\t\\t\\t \\t\\t\\r\\n\\t\\t\\t\\t\\t \\t\\t//mutate\\r\\n\\t\\t\\t\\t\\t \\t\\t\\r\\n\\r\\n\\t\\t\\t\\t\\t \\t// Random mut = new Random();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tdouble mutate = Math.random();\\r\\n\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t if(mutate < (1/R)) { \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t int child_1 = (int) (Math.random() * R);\\r\\n\\t\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t\\t \\tint child_2 = (int) (Math.random() * R);\\r\\n\\t\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t\\t \\tv[pos_1][child_1] = (int)(Math.random()*((ub[child_1] - lb[child_1])+1))+ lb[child_1];\\r\\n\\t\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t\\t \\toffspring_population.add(\\\"child\\\" + \\\" \\\" + pos_1);\\r\\n\\t\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t\\t \\tv[pos_2][child_2] = (int)(Math.random()*((ub[child_2] - lb[child_2])+1))+ lb[child_2]; \\r\\n\\t\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t\\t \\toffspring_population.add(\\\"child\\\" + \\\" \\\" + pos_2);\\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\\t\\t }\\r\\n\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t \\t\\t\\r\\n\\t\\t\\t\\t\\t\\t }\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n //mutation (1/size of test case input vector)\\r\\n\\t\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t//get path traversed by offsprings\\r\\n\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tfor (int i = 0; i < offspring_population.size(); i++) {// initialize the population with the dimension of R values/inputs\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t String [] get_index = offspring_population.get(i).split(\\\" \\\");\\t\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t String off_1;\\r\\n\\r\\n\\t\\t\\t\\t\\tint index_1;\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\toff_1 = get_index[0];\\r\\n\\t\\t\\t\\t\\tindex_1 = Integer.parseInt(get_index[1]);\\t\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tgetfinalpath = pathnum(v[index_1]);\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tarchiving( getfinalpath , index_1, v);\\r\\n\\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\\t}\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\telse {\\r\\n\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t // if ()\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t \\t\\tRandom random = new Random();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t//\\tLinkedHashMap<String, Boolean> changed_status = new LinkedHashMap<String, Boolean>();\\r\\n\\t\\t\\t\\t\\t\\t\\t//\\tLinkedHashMap<String, Boolean> child_status = new LinkedHashMap<String, Boolean>();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t \\t\\tparents_population_copy.clear();\\r\\n\\t\\t\\t\\t \\t\\tfor (int i = 0; i < 50; i++) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tparents_population_copy.add( \\\"parent\\\" + \\\" \\\" + i);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\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\\t\\tfor (int i = 0; i < 25; i++) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tString randomKey_1 = parents_population_copy.get( random.nextInt(parents_population_copy.size())) ;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tparents_population_copy.remove(randomKey_1);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tString randomKey_2 = parents_population_copy.get( random.nextInt(parents_population_copy.size())) ;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tparents_population_copy.remove(randomKey_2);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t//access parent via parent_maps_init\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t//split the string\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tString [] parent_1_string = randomKey_1.split(\\\" \\\");\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tString par_1;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tint pos_1;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tpar_1 = parent_1_string[0];\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tpos_1 = Integer.parseInt(parent_1_string[1]);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t // String [] parent_2_string = randomKey_2.split(\\\" \\\");\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tString par_2;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tint pos_2;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tString [] parent_2_string = randomKey_2.split(\\\" \\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tpar_2 = parent_2_string[0];\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tpos_2 = Integer.parseInt(parent_2_string[1]);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t//crossover nbased on probability\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tRandom rand = new Random();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tdouble rdm = Math.random();\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t if(rdm < 0.75) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t//single-point crossover\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\t//randomly find a position nad exchange the tails\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tint parent_1_random = rand.nextInt(R);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t int single_point = parent_1_random; \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t //exchange elements with parent_2\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t //\\tint[][] temporal = new int[pop_num][R];\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t for (int j = 0 ; j < R; j++) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t \\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t \\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\tv[pos_1][j] = x[pos_1][j];\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\tv[pos_2][j] = x[pos_2][j];\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t \\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t \\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t int s = single_point;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t while (s <= R) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t \\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t \\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t \\t\\t//switch the tails of parent one and parent two\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\tv[pos_1][s] = x[pos_2][s];\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\tv[pos_2][s] = x[pos_1][s];\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t \\t s++;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t \\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t \\t Random mut = new Random();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tdouble mutate = Math.random();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t if(mutate < (1/R)) { \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t int child_1 = (int) (Math.random() * R);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\tint child_2 = (int) (Math.random() * R);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\tv[pos_1][child_1] = (int)(Math.random()*((ub[child_1] - lb[child_1])+1))+ lb[child_1];\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\toffspring_population.add(\\\"child\\\" + \\\" \\\" + pos_1);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\tv[pos_2][child_2] = (int)(Math.random()*((ub[child_2] - lb[child_2])+1))+ lb[child_2]; \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\toffspring_population.add(\\\"child\\\" + \\\" \\\" + pos_2);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t }\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t else {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t offspring_population.add(\\\"child\\\" + \\\" \\\" + pos_1);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t offspring_population.add(\\\"child\\\" + \\\" \\\" + pos_2);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t }\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t }\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\telse {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t \\t\\tfor (int j = 0 ; j < R; j++) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\t\\tv[pos_1][j] = x[pos_1][j];\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\t\\tv[pos_2][j] = x[pos_2][j];\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t \\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tdouble mutate = Math.random();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t if(mutate < (1/R)) { \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t int child_1 = (int) (Math.random() * R);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t \\tint child_2 = (int) (Math.random() * R);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t \\tv[pos_1][child_1] = (int)(Math.random()*((ub[child_1] - lb[child_1])+1))+ lb[child_1];\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t \\toffspring_population.add(\\\"child\\\" + \\\" \\\" + pos_1);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t \\tv[pos_2][child_2] = (int)(Math.random()*((ub[child_2] - lb[child_2])+1))+ lb[child_2]; \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t \\toffspring_population.add(\\\"child\\\" + \\\" \\\" + pos_2);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t }\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t \\t}\\r\\n\\t\\t\\t\\r\\n\\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_ < offspring_population.size(); i_++) {// initialize the population with the dimension of R values/inputs\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t String [] get_index = offspring_population.get(i_).split(\\\"\\\");\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t String off_1;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\tint index_1;\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\toff_1 = get_index[0];\\r\\n\\t\\t\\t\\t\\t\\tindex_1 = Integer.parseInt(get_index[1]);\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\tgetfinalpath = pathnum(v[index_1]); //get path traversed by offspring test case \\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tarchiving( getfinalpath , i_, v);//add test case to archive\\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 //match the paths traversed\\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}\\r\\n\\t\\t\\t\\t}\\t\\r\\n\\t\\t\\t\\t\\tcrossover_count++;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t//combined_population_list.addAll(parents_population_copy);\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tfor (int i = 0; i < offspring_population.size(); i++) // add all offpsings to parent and form final combined population\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tcombined_population_list.add(offspring_population.get(i));\\r\\n\\t\\t\\t\\t }\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tList<String> final_combined_population = new ArrayList<String>();\\r\\n\\r\\n\\t\\t\\t\\t\\t// temp.clear();\\r\\n\\r\\n\\t\\t\\t\\t\\tfinal_combined_population.addAll(combined_population_list);\\t\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t//fit.add(target_path_+ \\\" \\\" + path_status +\\\" \\\" + nonsimple_unmatched2);\\r\\n\\t\\t\\t\\t//evaluate parent and child population\\r\\n\\t\\t\\t\\t\\tArrayList <String> offspring_fitness = new ArrayList<String>();\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tfor (int i = 0; i < final_combined_population.size(); i++) // contains both parent and offspring test cases\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\r\\n String checkString = final_combined_population.get(i);\\t\\r\\n \\r\\n String [] getType = checkString.split(\\\" \\\");\\r\\n \\r\\n\\t\\t\\t\\t\\t\\tString typeName = getType[0];\\r\\n\\r\\n\\t\\t\\t\\t\\t\\tint typeId = Integer.parseInt(getType[1]);\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t//\\tfit.add(target_path_+ \\\" \\\" + path_status +\\\" \\\" + nonsimple_unmatched2);\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tif (typeName.equals(\\\"parent\\\")) {\\r\\n\\r\\n\\t\\t\\t\\t\\t \\toffspring_fitness = benchmarkfunction(x[typeId]);\\r\\n\\t\\t\\t\\t\\t \\t//extract path and fitness\\r\\n\\t\\t\\t\\t\\t \\tcheck_fitness.put( \\\"parent\\\" + \\\" \\\" + typeId , offspring_fitness);\\r\\n\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t \\t//static LinkedHashMap<String, ArrayList<String>> check_fitness = new LinkedHashMap<String, ArrayList<String>>();\\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 \\r\\n\\t\\t\\t\\t\\t\\telse {\\r\\n//\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t//fit.add(target_path_+ \\\" \\\" + path_status +\\\" \\\" + nonsimple_unmatched2);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\toffspring_fitness = benchmarkfunction(v[typeId]);\\r\\n\\t\\t\\t\\t\\t\\t\\tcheck_fitness.put( \\\"child\\\" + \\\" \\\" + typeId , offspring_fitness);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\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}\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tint colum_sizes = 0;\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tfor ( String get_keys : check_fitness.keySet() ) {\\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\\tcolum_sizes = ( check_fitness.get(get_keys).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\\tbreak;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t//process remove_objective_routine\\r\\n\\t\\t\\t\\t\\t//process map first\\r\\n\\t\\t\\t\\t\\t//static LinkedHashMap<String, ArrayList<String>> check_fitness = new LinkedHashMap<String, ArrayList<String>>();\\r\\n\\t\\t\\t\\t\\tList<String> average_calculator = new ArrayList<String>();\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t//\\tint offspring_fitness_size = offspring_fitness.size();\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t//\\tIterator<Map.Entry<String, ArrayList<String>>> iteration_ = check_fitness.entrySet()\\r\\n\\t\\t\\t\\t\\t\\t\\t//.iterator();\\r\\n\\t\\t\\t\\t\\tString actualpath = \\\"\\\";\\r\\n\\t\\t\\t\\t\\tString process_1 = \\\"\\\";\\r\\n\\t\\t\\t\\t\\tString process_2 = \\\"\\\";\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t//String updated_value_2 = \\\"\\\";\\r\\n\\t\\t\\t\\t\\t//\\\"child\\\" + \\\" \\\" + typeId , offspring_fitness\\r\\n\\t\\t\\t\\t\\t//String updated_value = \\\"\\\";\\r\\n\\t\\t\\t\\t\\t\\r\\n//\\t\\t\\t\\t\\tfit.add(target_path_+ \\\" \\\" + path_status +\\\" \\\" + nonsimple_unmatched2);\\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\\tint pid = 0;\\t\\t\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\tfor (int i = 0 ; i < colum_sizes; i++ )\\t{\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tdouble add_objective_scores = 0.0;\\r\\n\\t\\t\\t\\tdouble sum_at_column = 0.0;\\r\\n\\r\\n\\t\\t\\t\\tfor ( String get_keys : check_fitness.keySet() ) {\\t\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\r\\n // int pid = 0;\\r\\n \\r\\n\\t\\t\\t\\t\\t\\t//Map.Entry<String, ArrayList<String>> entry = iteration_.next();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\taverage_calculator = check_fitness.get(get_keys);\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t//entry.getValue();\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tString get_objective_score = average_calculator.get(i);\\r\\n\\t\\t\\t \\r\\n\\t\\t\\t //calculate average fitness\\r\\n\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t//\\tupdated_population.add(entry.getKey());\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t//50 is the number of test cases\\r\\n\\t\\t\\t\\t\\t\\t//while (pid < 50) {\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t///String checkString = final_combined_population.get(i);\\t\\r\\n\\t \\r\\n\\t String [] getDetails = get_objective_score.split(\\\" \\\");\\r\\n\\t\\t\\t\\t\\t\\t actualpath = getDetails[0];\\r\\n double objective_scores = Double.parseDouble(getDetails[1]);\\r\\n \\r\\n add_objective_scores = add_objective_scores + objective_scores ;\\r\\n \\r\\n //total fitness at colum i\\r\\n sum_at_column = (add_objective_scores / check_fitness.size());\\r\\n //get total fitness \\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//int old_value = remove_objective[actualpath]\\r\\n\\t\\t\\t\\t\\t//if(remove_objective.contiansKey(actualpath))\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tfor ( String entry_1 : target_subset.keySet() ) {\\t//update path status\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tif (entry_1.equals(actualpath)) {\\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\\t String [] processPath = actualpath.split(\\\" \\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t process_1 = processPath[0];\\r\\n\\t\\t\\t\\t\\t\\t\\t process_2 = processPath[1];\\r\\n\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t //Double objective_scores = Double.parseDouble(getDetails[1]);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tif (process_2.equals(\\\"new\\\")) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\ttarget_subset.put(process_1 + \\\" \\\" + \\\"old\\\" , false );\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tremove_objective.put( actualpath, sum_at_column);\\r\\n\\t\\t\\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\\t\\r\\n\\t\\t\\t\\t\\t\\t\\telse {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t//remove_objective.put( actualpath, max_1 + \\\" \\\" + add_objective_scores );\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tdouble previous_value = remove_objective.get(actualpath);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t//double get_First = Double.parseDouble(get_Path[0]);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t//double get_Second = Double.parseDouble(get_Path[1]);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tif ( previous_value > sum_at_column ) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tremove_objective.put( actualpath, sum_at_column);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\telse {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// Update status to true\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\ttemporary_path_holder.add(actualpath); \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tpaths.put(actualpath, true);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\ttarget_subset.remove(actualpath);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t//\\r\\n\\t\\t\\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\\t\\t\\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\\tArrayList<String> remove_objectives_1 = new ArrayList<String>();\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tfor ( String entry_2 : check_fitness.keySet() ) {\\t//process test case // update their fitness vectors by deleting the removed objectives\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\tString [] process_to_remove = entry_2.split(\\\" \\\");\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tString processes_1 = process_to_remove[0];\\r\\n\\t\\t\\t\\tint index_2 = Integer.parseInt(process_to_remove[1]);\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tremove_objectives_1 = check_fitness.get(entry_2);\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tfor (int i = 0; i < remove_objectives_1.size(); i++) // process the fitness vector and delete the worst values\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t//fit.add(target_path_+ \\\" \\\" + path_status +\\\" \\\" + nonsimple_unmatched2);\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t//target_subset.remove(actualpath);\\r\\n\\t\\t\\t\\t\\t//temporary_path_holder.add(actualpath); \\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tString [] process_paths_to_remove = remove_objectives_1.get(i).split(\\\" \\\");\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tString process_path_1 = process_paths_to_remove[0];\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tif (temporary_path_holder.contains(process_path_1) ) {\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tremove_objectives_1.remove(process_path_1);\\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}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tcheck_fitness.put( processes_1 + \\\" \\\" + index_2, remove_objectives_1);\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tremove_objectives_1.clear( );\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//target_subset.put(process_1 + \\\" \\\" + \\\"old\\\" , false );\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t Set<String> remainingPath = target_subset.keySet();\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tfor (String keyss : remainingPath) {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t String [] get_Remaining = keyss.split(\\\" \\\");\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t String remaining_1 = get_Remaining[0];\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t still_remaining_targets.add(remaining_1); //back-up set of remaining targets\\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 \\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif (target_subset.size()!=0)\\t{\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\ttry {\\r\\n\\t\\t\\t\\t\\t\\tif ((obj_total) == PATHNUM_NUMBER ) { // if all paths covered break out of while loop\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t if ((obj_total) < PATHNUM_NUMBER ) { // if not all paths covered perform\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t if ((target_subset.size() == 1)) { \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t \\t LinkedHashMap<String, ArrayList<Double>> updated_maps_ = new LinkedHashMap<String, ArrayList<Double>>();\\r\\n\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t ArrayList<String> updated_fit_ = new ArrayList<String>();\\t\\r\\n\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t ArrayList<Double> updated_1 = new ArrayList<Double>();\\r\\n\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t \\tfor ( String key_10 : check_fitness.keySet() ) {\\r\\n\\t\\t\\t\\t\\t\\t\\t \\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t \\t\\t\\r\\n\\t\\t\\t\\t\\t \\t\\tupdated_fit_ = check_fitness.get(key_10);\\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\\tfor (int r= 0; r < updated_fit_.size(); r++) {\\r\\n\\t\\t\\t\\t\\t \\t\\t\\r\\n\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t String [] get_list = updated_fit_.get(r).split(\\\" \\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t double objective_score = Double.parseDouble(get_list[2]);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t updated_1.add(objective_score);\\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\\tupdated_maps_.put(key_10, updated_1);\\r\\n\\t\\t\\t\\t\\t \\t\\t\\r\\n\\t\\t\\t\\t\\t \\t\\tupdated_fit_.clear();\\r\\n\\t\\t\\t\\t\\t \\t\\t\\r\\n\\t\\t\\t\\t\\t \\t\\tupdated_1.clear();\\r\\n\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\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 \\tint counter = 0;\\r\\n\\t\\t\\t\\t\\t\\t\\twhile (counter < 50) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t List<Double> value_holder = new ArrayList<Double>();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t List<String> keys = new ArrayList<String>(updated_maps_.keySet());\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t Random rand = new Random();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t String key_ss = keys.get(rand.nextInt(keys.size()));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t String key_holder = null;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t value_holder.addAll(updated_maps_.get(key_ss));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t double min = value_holder.get(0);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t value_holder.clear();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t for (int i = 1 ; i < 10; i++) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t String key = keys.get(rand.nextInt(keys.size()));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t value_holder.addAll(updated_maps_.get(key));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t double checker = value_holder.get(0);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t if (checker < min) {\\r\\n\\t\\t\\t\\t\\t\\t min = checker;\\r\\n\\t\\t\\t\\t\\t\\t key_holder = key;\\r\\n\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t }\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t value_holder.clear();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t parents_population_copy.add(key_holder);\\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\\r\\n\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t statusChecker = true;\\r\\n\\t\\t\\t\\t }//if only one uncovered path\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t else { \\r\\n\\t\\t\\t\\t\\t if (target_subset.size() > 1) { //if many remaining uncovered paths\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t LinkedHashMap<String, ArrayList<Double>> updated_maps = new LinkedHashMap<String, ArrayList<Double>>();\\r\\n\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t ArrayList<String> updated_fit = new ArrayList<String>();\\t\\r\\n\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t ArrayList<Double> updated_ = new ArrayList<Double>();\\r\\n\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t \\tfor ( String key_10 : check_fitness.keySet() ) {\\r\\n\\t\\t\\t\\t\\t\\t\\t \\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t \\t\\t\\r\\n\\t\\t\\t\\t\\t \\t\\tupdated_fit = check_fitness.get(key_10);\\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\\tfor (int r= 0; r < updated_fit.size(); r++) {\\r\\n\\t\\t\\t\\t\\t \\t\\t\\r\\n\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t String [] get_list = updated_fit.get(r).split(\\\" \\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t double objective_score = Double.parseDouble(get_list[2]);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t updated_.add(objective_score);\\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\\tupdated_maps.put(key_10, updated_);\\r\\n\\t\\t\\t\\t\\t \\t\\t\\r\\n\\t\\t\\t\\t\\t \\t\\tupdated_fit.clear();\\r\\n\\t\\t\\t\\t\\t \\t\\t\\r\\n\\t\\t\\t\\t\\t \\t\\tupdated_.clear();\\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\\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 //updated_maps.put(key_10, updated_); perform preference sorting on this map\\r\\n\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t \\tint updated_sizes = 0;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tfor ( String get_keys : updated_maps.keySet() ) {\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t updated_sizes = ( updated_maps.get(get_keys).size());\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t} \\t\\r\\n\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\tDouble[][] offspring_fitness_full = new Double[final_combined_population\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t.size()][updated_sizes]; // n x m matrix of combined parents and offspring test cases\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tint updates = 0;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t// List<String> traverse_group = new ArrayList<String>();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t//List<String> best_column = new ArrayList<String>();\\r\\n\\t\\t\\t\\t\\t\\t\\tint fitss = 0;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\twhile (updates < final_combined_population.size()) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tList<Double> fitness_objectives_updated = new ArrayList<Double>();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t// fitness_objectives_updated.clear();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tfitness_objectives_updated = (updated_maps.get(final_combined_population.get(updates)));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tList<Double> temp_3 = new ArrayList<Double>();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t// temp.clear();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\ttemp_3.addAll(fitness_objectives_updated);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tfor (int ups = 0; ups < temp_3.size(); ups++) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\toffspring_fitness_full[updates][ups] = fitness_objectives_updated.get(ups);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tfitness_objectives_updated.clear();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tupdates++;\\r\\n\\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\\r\\n\\t\\t\\t\\t\\t \\t//check if paths is covered , plus check replaced status\\r\\n\\t\\t\\t \\t// average objective score calculation.....\\r\\n\\t\\t\\t\\t\\t\\t\\t// removing objectives\\r\\n\\t\\t\\t\\t\\t\\t\\t// check current generation vs previous generation\\r\\n\\t\\t\\t \\t// update replaced status in main set of uncovered paths\\r\\n\\t\\t\\t \\r\\n\\t\\t\\t \\t\\r\\n\\t\\t\\t \\t// update population by replacing the other targets\\r\\n\\t\\t\\t \\t\\r\\n\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tList<String> best_column = new ArrayList<String>();\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tint sizes = temp_2.size();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t//double row_fit;\\r\\n\\t\\t\\t\\t\\t\\t\\tint colums = 0;\\r\\n\\t\\t\\t\\t\\t\\t\\tString test_case;\\r\\n\\t\\t\\t\\t\\t\\t\\tdouble fit_rowfit;\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tLinkedHashMap<String, Double> row_getter = new LinkedHashMap<String, Double>();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\twhile (colums < sizes) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tfor (int get_row = 0; get_row < (final_combined_population.size()); get_row++) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tfit_rowfit = (offspring_fitness_full[get_row][colums]);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tdouble row_fitter = fit_rowfit;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\trow_getter.put(final_combined_population.get(get_row), row_fitter);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tMap<String, Double> result = row_getter.entrySet().stream() //get test case with minimum objective score for each objective\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t.sorted(Map.Entry.comparingByValue())\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t.collect(toMap(Map.Entry::getKey, Map.Entry::getValue,\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t(oldValue, newValue) -> oldValue, LinkedHashMap::new));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t// System.out.println(\\\"Map yino\\\" +result );\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tIterator<Map.Entry<String, Double>> best_col = result.entrySet().iterator();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\twhile (best_col.hasNext()) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tMap.Entry<String, Double> entry = best_col.next();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\ttest_case = entry.getKey();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif (!best_column.contains(test_case)) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tbest_column.add(test_case);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tresult.clear();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\trow_getter.clear();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tcolums++;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n \\r\\n\\t\\t\\t\\t\\t\\t\\t//Go straight to computing crowding distance for Font 0\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tint distance_zero;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t/************************************************************************************************************************************************************/\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\tdouble[][] distance_matrix_zero = new double[best_column.size()][best_column.size()];\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\tif ((best_column.size()) > 1) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tfor (int best = 0; best < (best_column.size()); best++) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tList<Double> front_0_1 = new ArrayList<Double>();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tfront_0_1 = updated_maps.get(best_column.get(best));\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tfor (int ind_d = 0; ind_d < best_column.size(); ind_d++) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif (!((best_column.get(best).equals(best_column.get(ind_d))))) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tList<Double> front_0_2 = new ArrayList<Double>();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tfront_0_2 = updated_maps.get(best_column.get(ind_d));\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tdistance_zero = get_count(front_0_1, front_0_2);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tint temp_dis = distance_zero;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tdistance_matrix_zero[best][ind_d] = temp_dis;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tLinkedHashMap<String, Double> setdistance_zero_2 = new LinkedHashMap<String, Double>();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tfor (int font_ = 0; font_ < best_column.size(); font_++) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tdouble zeros = 0.0;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tsetdistance_zero_2.put(best_column.get(font_), zeros);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tfor (int font_i = 0; font_i < (best_column.size()); font_i++) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tfor (int font_j = 0; font_j < best_column.size(); font_j++) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif (!((best_column.get(font_i).equals(best_column.get(font_j))))) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif (setdistance_zero_2.get(best_column\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t.get(font_i)) < distance_matrix_zero[font_i][font_j]) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tdouble dis = (distance_matrix_zero[font_i][font_j]);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tsetdistance_zero_2.put(best_column.get(font_i), dis);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tMap<String, Double> result = setdistance_zero_2.entrySet().stream()\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t.sorted(Map.Entry.comparingByValue())\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t.collect(toMap(Map.Entry::getKey, Map.Entry::getValue,\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t(oldValue, newValue) -> oldValue, LinkedHashMap::new));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tfor (Map.Entry<String, Double> entry : result.entrySet()) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif (updated_population.size() < pop_num) { //updated_population holds the selected population for next generation\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tupdated_population.add(entry.getKey());\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\telse {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tresult.clear();\\r\\n\\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\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t//updated population has best performing test cases sorted in descending order\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\telse { // process the only item in the best set\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tif (!best_column.isEmpty()) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tString item_one = best_column.get(0);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif (updated_population.size() < pop_num) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tupdated_population.add(item_one);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t//Establish other fonts\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tList<String> fitness_objectives_comparator = new ArrayList<String>();\\r\\n\\t\\t\\t\\t\\t\\t\\t// List<Double> fitness_objectives_p = new ArrayList<Double>();\\r\\n\\t\\t\\t\\t\\t\\t\\t// List<Double> fitness_objectives_q= new ArrayList<Double>();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\tfor (int next_front = 0; next_front < final_combined_population.size(); next_front++) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tif (!best_column.contains(final_combined_population.get(next_front))) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tfitness_objectives_comparator.add(final_combined_population.get(next_front));\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tif ((fitness_objectives_comparator.size()) > 1) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tint[] dominateMe = new int[fitness_objectives_comparator.size()];\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t// front[i] contains the list of individuals belonging to the front i\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t@SuppressWarnings(\\\"unchecked\\\")\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tList<Integer>[] front = new List[(fitness_objectives_comparator.size() + 1)];\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t// iDominate[k] contains the list of solutions dominated by k\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t@SuppressWarnings(\\\"unchecked\\\")\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tList<Integer>[] iDominate = new List[fitness_objectives_comparator.size()];\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tint flagDominate;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tfor (int i = 0; i < ((front.length)); i++) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tfront[i] = new LinkedList<Integer>();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tfor (int p = 0; p < fitness_objectives_comparator.size(); p++) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// Initialize the list of individuals that i dominate and the number\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// of individuals that dominate me\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tiDominate[p] = new LinkedList<Integer>();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tdominateMe[p] = 0;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t// int secondary_size =0 ;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tint N = fitness_objectives_comparator.size();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t// int[][] dominanceChecks = new int[N][N];\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tfor (int p = 0; p < (N - 1); p++) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tList<Double> fitness_temporary_p = new ArrayList<Double>();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tfitness_temporary_p = updated_maps.get((fitness_objectives_comparator.get(p)));\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// secondary_size = fitness_temporary_p.size();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tfor (int q = p + 1; q < N; q++) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// if (p != q) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tList<Double> fitness_temporary_q = new ArrayList<Double>();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tfitness_temporary_q = updated_maps\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t.get((fitness_objectives_comparator.get(q)));\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tflagDominate = frontdominace_Comparison(fitness_temporary_p,\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tfitness_temporary_q);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif (flagDominate == -1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// System.out.println(\\\"p---dominates>>>>>\\\" );\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tiDominate[p].add(q);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tdominateMe[q]++;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\telse if (flagDominate == 1) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// System.out.println(\\\"q---dominates>>>>>\\\" );\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tiDominate[q].add(p);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tdominateMe[p]++;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\telse {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tList<Double> fitness_temporary_qq = new ArrayList<Double>();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tList<Double> fitness_temporary_pp = new ArrayList<Double>();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tCollections.sort(fitness_temporary_p);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tfitness_temporary_pp.addAll(fitness_temporary_p);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tCollections.sort(fitness_temporary_q);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tfitness_temporary_qq.addAll(fitness_temporary_q);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif (fitness_temporary_pp.get(0) < fitness_temporary_qq.get(0)) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// System.out.println(\\\"p---dominates>>>>>\\\" );\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tiDominate[p].add(q);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tdominateMe[q]++;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\telse if (fitness_temporary_qq.get(0) < fitness_temporary_pp.get(0)) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// System.out.println(\\\"q---dominates>>>>>\\\" );\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tiDominate[q].add(p);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tdominateMe[p]++;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tfor (int p = 0; p < ((fitness_objectives_comparator.size())); p++) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif (dominateMe[p] == 0) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tfront[0].add(p);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// setrank.put(Integer.parseInt(fitness_objectives_comparator.get(p)), 1);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tint val = 0;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tsetrank1.put(fitness_objectives_comparator.get(p), val);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n/*****************************************************************************************************************************************************************************************/\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tint font_s = 0;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t// if((front[font_s].size() != 0)) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tIterator<Integer> it1, it2; // Iterators\\r\\n\\t\\t\\t\\t\\t\\t\\t\\twhile (front[font_s].size() != 0) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t/// System.out.println(\\\"we got here\\\" + front[font_s]);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tfont_s++;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tit1 = front[font_s - 1].iterator();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\twhile (it1.hasNext()) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tit2 = iDominate[(it1.next())].iterator();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\twhile (it2.hasNext()) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tint index = it2.next();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tdominateMe[index]--;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif (dominateMe[index] == 0) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tfront[font_s].add(index);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// System.out.println(\\\"Block_1: \\\" +front[font_s]);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tsetrank1.put(fitness_objectives_comparator.get(index), font_s);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tLinkedHashMap<String, Double> setdistance = new LinkedHashMap<String, Double>();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tLinkedHashMap<String, Double> setdistance_one = new LinkedHashMap<String, Double>();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tMap<Integer, ArrayList<String>> reverseMap = new HashMap<>();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tfor (Map.Entry<String, Integer> entry : setrank1.entrySet()) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif (!reverseMap.containsKey(entry.getValue())) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\treverseMap.put(entry.getValue(), new ArrayList<>());\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tArrayList<String> keys = reverseMap.get(entry.getValue());\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tkeys.add(entry.getKey());\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\treverseMap.put(entry.getValue(), keys);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t// process fonts\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tint smaller;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tint smaller_one;\\r\\n\\t\\t\\t\\t\\t\\t\\t//\\tint remaining;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t// int smaller_two;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tint fronts = 0;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t// System.out.println(\\\"map's size\\\" + reverseMap.size());\\r\\n\\t\\t\\t\\t\\t\\t\\t\\twhile (fronts < (reverseMap.size())) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// if (updated_population.size()== pop_num) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// break;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t// }\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif (fronts != (reverseMap.size() - 1)) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tList<String> front_list = new ArrayList<String>();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tfront_list = reverseMap.get(fronts);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif ((front_list.size()) > 1) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tdouble[][] distance_matrix = new double[front_list.size()][front_list\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t.size()];\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tfor (int ind_d = 0; ind_d < (front_list.size()); ind_d++) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tList<Double> front_getter1 = new ArrayList<Double>();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tfront_getter1 = updated_maps.get((front_list.get(ind_d)));\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tfor (int d = 0; d < front_list.size(); d++) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif (!(front_list.get(ind_d).equals(front_list.get(d)))) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tList<Double> front_getter2 = new ArrayList<Double>();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tfront_getter2 = updated_maps.get((front_list.get(d)));\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tsmaller = get_count(front_getter1, front_getter2);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tint sma = smaller;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tdistance_matrix[ind_d][d] = sma;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tfor (int font_ = 0; font_ < front_list.size(); font_++) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tdouble valz = 0.0;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tsetdistance.put(front_list.get(font_), valz);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// all distances set\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tfor (int font_i = 0; font_i < (front_list.size()); font_i++) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// distance_matrix\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tfor (int font_j = 0; font_j < front_list.size(); font_j++) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif (!(front_list.get(font_i).equals(front_list.get(font_j)))) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif (setdistance.get(front_list\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t.get(font_i)) < distance_matrix[font_i][font_j]) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tdouble dist = (distance_matrix[font_i][font_j]);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tsetdistance.put(front_list.get(font_i), dist);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tMap<String, Double> result = setdistance.entrySet().stream()\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t.sorted(Map.Entry.comparingByValue())\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t.collect(toMap(Map.Entry::getKey, Map.Entry::getValue,\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t(oldValue, newValue) -> oldValue, LinkedHashMap::new));\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tIterator<Map.Entry<String, Double>> iteration = result.entrySet()\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t.iterator();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\twhile (iteration.hasNext()) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tMap.Entry<String, Double> entry = iteration.next();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif (updated_population.size() < pop_num) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tupdated_population.add(entry.getKey());\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\telse {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tresult.clear();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\telse {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tString best_1;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tbest_1 = front_list.get(0);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif (updated_population.size() < (pop_num)) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tupdated_population.add(best_1);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif (fronts == (reverseMap.size() - 1)) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tList<String> front_list_one = new ArrayList<String>();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tfront_list_one = reverseMap.get(reverseMap.size() - 1);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// System.out.println(\\\"hahahq\\\" +front_list_one);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tdouble[][] distance_matrix_one = new double[front_list_one\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t.size()][front_list_one.size()];\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tfor (int ind_w = 0; ind_w < (front_list_one.size()); ind_w++) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tList<Double> front_getter_one = new ArrayList<Double>();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tfront_getter_one = updated_maps.get((front_list_one.get(ind_w)));\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tfor (int dw = 0; dw < front_list_one.size(); dw++) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif (!(front_list_one.get(ind_w).equals(front_list_one.get(dw)))) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tList<Double> front_getter_two = new ArrayList<Double>();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tfront_getter_two = updated_maps.get((front_list_one.get(dw)));\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tsmaller_one = get_count(front_getter_one, front_getter_two);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tint sm = smaller_one;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tdistance_matrix_one[ind_w][dw] = sm;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tfor (int font_ = 0; font_ < front_list_one.size(); font_++) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tdouble dit = 0.0;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tsetdistance_one.put(front_list_one.get(font_), dit);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// all distances set\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tfor (int font_i = 0; font_i < (front_list_one.size()); font_i++) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tfor (int font_j = 0; font_j < front_list_one.size(); font_j++) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif (!(front_list_one.get(font_i)\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t.equals(front_list_one.get(font_j)))) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif (setdistance_one.get(front_list_one\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t.get(font_i)) < distance_matrix_one[font_i][font_j]) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tdouble dst = (distance_matrix_one[font_i][font_j]);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tsetdistance_one.put(front_list_one.get(font_i), dst);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tint remaining_ = (pop_num - updated_population.size());\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif (setdistance_one.size() <= remaining_) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tMap<String, Double> result = setdistance_one.entrySet().stream()\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t.sorted(Map.Entry.comparingByValue())\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t.collect(toMap(Map.Entry::getKey, Map.Entry::getValue,\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t(oldValue, newValue) -> oldValue, LinkedHashMap::new));\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tIterator<Map.Entry<String, Double>> iteration = result.entrySet()\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t.iterator();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\twhile (iteration.hasNext()) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tMap.Entry<String, Double> entry = iteration.next();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif (updated_population.size() < pop_num) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tupdated_population.add(entry.getKey());\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\telse {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// System.out.println( \\\"remaining---\\\" +remaining);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\telse {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tMap<String, Double> sortedByValueDesc = setdistance_one.entrySet()\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t.stream()\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t.sorted(Map.Entry.<String, Double>comparingByValue().reversed())\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t.collect(toMap(Map.Entry::getKey, Map.Entry::getValue,\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t(e1, e2) -> e1, LinkedHashMap::new));\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tList<String> front_remove = new ArrayList<String>();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tSet<String> keytest = sortedByValueDesc.keySet();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tint final_size = sortedByValueDesc.size();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// while(sortedByValueDesc.size() > remaining) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tfor (String keysss : keytest) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif (final_size > remaining_) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tfront_remove.add(keysss);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\telse {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tfinal_size--;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// System.out.println( \\\"sorted map after---\\\" +sortedByValueDesc.size());\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tSet<String> keytests = sortedByValueDesc.keySet();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tfor (String key_sss : keytests) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif (updated_population.size() < pop_num) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif (!front_remove.contains(key_sss)) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tupdated_population.add(key_sss);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tsetdistance.clear();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tsetdistance_one.clear();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tfronts++;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t} else {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tif (!fitness_objectives_comparator.isEmpty()) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif (updated_population.size() < pop_num) {\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tString get_item = (fitness_objectives_comparator.get(0));\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tupdated_population.add(get_item);\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t}\\r\\n}\\r\\n}\\r\\n}}\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\tcatch(IndexOutOfBoundsException e) {}\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\t//updated_population.clear();\\r\\n\\t\\t\\t\\t\\t\\t\\tcombined_population.clear();\\r\\n\\t\\t\\t\\t\\t\\t\\t//combined_population2.clear();\\r\\n\\t\\t\\t\\t\\t\\t\\tsetrank1.clear();\\r\\n\\t\\t\\t\\t\\t\\t\\t//setrank2.clear();\\r\\n\\t\\t\\t\\t\\t\\t\\t//setrank3.clear();\\r\\n\\t\\t\\t\\t\\t\\t\\tcombined_maps.clear();\\r\\n\\t\\t\\t\\t\\t\\t\\t//child_maps.clear();\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n Set<String> add_target = paths.keySet();\\r\\n\\t \\t\\r\\n\\t \\t//replaced_status_2.put(id + new String(str), false);\\r\\n\\t \\tint true_count = 0;\\r\\n\\t \\t// get status of removal\\r\\n\\t \\tfor (String key_ss : add_target) { \\r\\n\\t \\t\\r\\n\\t \\t//pick path whose status is false\\r\\n\\t \\t\\tif ( paths.get(key_ss) ){\\r\\n\\t \\t\\t\\t\\r\\n\\t \\t\\t\\t true_count++;\\r\\n\\t \\t\\t}\\r\\n\\t \\t\\t\\r\\n\\t \\t\\telse {\\r\\n\\t \\t\\t\\t\\r\\n\\t \\t\\t\\tbreak;\\r\\n\\t \\t\\t}\\r\\n\\t \\t \\t \\r\\n\\t \\t} \\r\\n\\t \\t\\r\\n\\t \\tif ( true_count == paths.size() ) {\\r\\n\\t \\t\\t\\r\\n\\t \\t\\t//if all paths have true as replaced status\\r\\n\\t \\t\\t\\r\\n\\t \\t\\t//set them to false\\r\\n\\t \\t\\t\\r\\n\\t \\t\\t//pick subset of paths not previously removed at previous generation\\r\\n\\t \\t\\r\\n\\t \\t\\tSet<String> add_new_entry = paths.keySet();\\r\\n\\t \\t \\t\\r\\n\\t \\t \\t//replaced_status_2.put(id + new String(str), false);\\r\\n\\t \\t \\tint entry_count = 0;\\r\\n\\t \\t \\t// get status of removal\\r\\n\\t \\t \\tfor (String enrty_ss : add_new_entry ) { \\r\\n\\t \\t\\t\\r\\n\\t \\t \\t\\t paths.put(enrty_ss , false);\\r\\n\\t \\t \\t\\t\\r\\n\\t \\t \\t}\\r\\n\\t \\t \\t\\r\\n\\t \\t \\tif (paths.size() > 50) {\\r\\n\\t \\t \\t\\r\\n\\t \\t \\tint counter_add_paths = 0;\\r\\n\\t \\t \\t\\t\\r\\n Set<String> add_target_from_Path_1 = paths.keySet();\\r\\n\\t\\t \\t\\r\\n\\t\\t \\t//replaced_status_2.put(id + new String(str), false);\\r\\n\\t\\t \\t\\r\\n\\t\\t \\t// get status of removal\\r\\n\\t\\t \\t for (String from_Path_1: add_target_from_Path_1) {\\r\\n\\t \\t \\t\\r\\n\\t \\t \\t\\r\\n\\t \\t \\t\\r\\n\\t \\t\\t if (still_remaining_targets.contains(from_Path_1) ) {\\r\\n\\t \\t \\t\\t\\r\\n\\t \\t \\t\\t continue;\\r\\n\\t \\t \\t }\\r\\n\\t \\t\\t\\r\\n\\t \\t\\t else {\\r\\n\\t \\t\\t\\t \\r\\n\\t \\t\\t\\t \\r\\n\\t \\t\\t\\t if (counter_add_paths < 50) {\\r\\n\\t \\t\\t\\t\\r\\n\\t \\t\\t\\t if ( !temporary_path_holder.contains(from_Path_1) ){\\r\\n\\t \\t \\t \\t\\t\\r\\n\\t \\t\\t\\t\\t target_subset.put(from_Path_1 + \\\" \\\" + \\\"new\\\", false);\\r\\n\\t\\t \\t \\t\\t\\t\\r\\n\\t \\t\\t\\t\\t counter_add_paths++;\\r\\n\\t \\t\\t\\t\\t \\r\\n\\t \\t\\t\\t\\t// retrieve test case from archive\\r\\n\\t\\t \\t \\t\\t\\t//updatePopulation(from_Path_1)..//return test case not previously added to temporary population\\r\\n\\t \\t\\t\\t\\t \\r\\n\\t\\t \\t \\t\\t}\\r\\n\\t \\t\\t\\t\\r\\n\\t \\t\\t\\t }\\r\\n\\t \\t\\t\\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 \\t \\r\\n\\t\\t \\t }\\r\\n\\t \\t \\t}\\r\\n\\t\\t \\t \\r\\n\\t\\t \\t else {\\r\\n\\t\\t \\t \\t \\r\\n\\t\\t \\t \\t \\r\\n\\t\\t \\t \\tSet<String> add_target_from_Path_7 = paths.keySet();\\r\\n\\t\\t\\t \\t\\r\\n\\t\\t\\t \\t//replaced_status_2.put(id + new String(str), false);\\r\\n\\t\\t\\t \\t\\r\\n\\t\\t\\t \\t// get status of removal\\r\\n\\t\\t\\t \\t for (String from_Path_7: add_target_from_Path_7) { // contains(Object)\\r\\n\\t\\t\\t \\t\\r\\n\\t\\t\\t \\t //get current path set..the paths already in subset should not be picked again....\\r\\n\\t\\t\\t \\t\\t\\r\\n\\t\\t\\t \\t \\t//\\ttarget_subset.put(key + \\\" \\\" + \\\"new\\\", false);\\t\\r\\n\\t\\t\\t \\t \\t\\r\\n\\t\\t\\t if (still_remaining_targets.contains(from_Path_7) ) {\\r\\n\\t\\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 else { \\r\\n\\t \\t \\t\\tif ( !temporary_path_holder.contains(from_Path_7) ){\\r\\n\\t \\t \\t\\t\\t\\r\\n\\t \\t \\t\\t\\ttarget_subset.put(from_Path_7 + \\\" \\\" + \\\"new\\\", false);\\r\\n\\t \\t \\t\\t\\t\\r\\n\\t \\t \\t\\t\\t// retrieve test case from archive\\r\\n\\t \\t \\t\\t// retrieve test case from archive\\r\\n\\t \\t \\t\\t\\t//updatePopulation(from_Path_7)..//return test case not previously added to temporary population\\r\\n\\t \\t \\t\\t}}\\r\\n\\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 }\\r\\n\\t \\t\\t\\r\\n\\t \\telse {\\r\\n\\t \\t\\t\\r\\n\\t \\t\\t// pick paths with false status and add them to subset of targets\\r\\n\\t \\t\\t\\r\\n\\t \\t\\tint path_to_add_counter = 0;\\r\\n\\t \\t\\t\\r\\n\\t \\tif (paths.size() > 50) {\\r\\n\\t \\t\\tSet<String> add_target_from_Path = paths.keySet();\\r\\n\\t\\t \\t\\r\\n\\t\\t \\t//replaced_status_2.put(id + new String(str), false);\\r\\n\\t\\t \\t\\r\\n\\t\\t \\t// get status of removal\\r\\n\\t\\t \\t for (String from_Path: add_target_from_Path) { // contains(Object)\\r\\n\\t\\t \\t\\r\\n\\t\\t \\t //get current path set..the paths already in subset should not be picked again....\\r\\n\\t\\t \\t\\t\\r\\n\\t\\t \\t \\t//\\ttarget_subset.put(key + \\\" \\\" + \\\"new\\\", false);\\t\\r\\n\\t\\t \\t \\t\\r\\n\\t\\t \\t \\t\\tif (still_remaining_targets.contains(from_Path) ) {\\r\\n\\t\\t\\t\\t \\t \\t\\t\\r\\n\\t\\t\\t\\t \\t \\t\\tcontinue;\\r\\n\\t\\t\\t\\t \\t \\t}\\r\\n\\t\\t \\t \\t\\t\\telse {\\t\\r\\n\\t\\t \\t \\t\\t\\r\\n\\t\\t \\t \\t\\t if (path_to_add_counter < 50) {\\r\\n\\t\\t \\t \\t\\t \\r\\n\\t\\t \\t \\t if ( !paths.get(from_Path) && (!temporary_path_holder.contains(from_Path) ) ){\\r\\n\\t\\t \\t \\t\\t\\r\\n\\t\\t \\t \\t\\t target_subset.put(from_Path + \\\" \\\" + \\\"new\\\", false);\\r\\n\\t\\t \\t \\t\\t\\t\\r\\n\\t\\t \\t \\t\\t\\tpath_to_add_counter++;\\r\\n\\t\\t \\t \\t\\t\\t\\r\\n\\t\\t \\t \\t\\t\\t// retrieve test case from archive\\r\\n\\t\\t \\t \\t\\t// retrieve test case from archive\\r\\n\\t\\t \\t \\t\\t\\t//updatePopulation(from_Path)..//return test case not previously added to temporary population\\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 \\t\\t}\\r\\n\\t\\t \\t \\t\\t\\t}\\r\\n\\t\\t \\t \\t}\\r\\n\\t \\t}\\r\\n\\t \\t\\r\\n\\t \\t\\r\\n\\t\\t \\t else {\\r\\n\\t\\t \\t \\t\\t \\r\\n\\t\\t \\t \\t\\tSet<String> add_target_from_Path_4 = paths.keySet();\\r\\n\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t \\t//replaced_status_2.put(id + new String(str), false);\\r\\n\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t \\t// get status of removal\\r\\n\\t\\t\\t\\t \\t for (String from_Path_4: add_target_from_Path_4) { // contains(Object)\\r\\n\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t \\t //get current path set..the paths already in subset should not be picked again....\\r\\n\\t\\t\\t\\t \\t\\t\\r\\n\\t\\t\\t\\t \\t \\t//\\ttarget_subset.put(key + \\\" \\\" + \\\"new\\\", false);\\t\\r\\n\\t\\t\\t\\t \\t \\t\\r\\n\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t \\t \\t\\t\\tif (still_remaining_targets.contains(from_Path_4) ) {\\r\\n\\t\\t\\t\\t\\t\\t \\t \\t\\t\\r\\n\\t\\t\\t\\t\\t\\t \\t \\t\\tcontinue;\\r\\n\\t\\t\\t\\t\\t\\t \\t \\t}\\r\\n\\t\\t \\t \\t\\t \\r\\n\\t\\t\\t\\t \\t \\t\\t\\telse {\\r\\n\\t\\t \\t \\t\\t\\t\\r\\n\\t\\t \\t \\t\\tif ( !paths.get(from_Path_4) && (!temporary_path_holder.contains(from_Path_4) ) ){\\r\\n\\t\\t \\t \\t\\t\\t\\r\\n\\t\\t \\t \\t\\t\\ttarget_subset.put(from_Path_4 + \\\" \\\" + \\\"new\\\", false);\\r\\n\\t\\t \\t \\t\\t\\t\\r\\n\\t\\t \\t \\t\\t\\t// retrieve test case from archive\\r\\n\\t\\t \\t \\t\\t\\t//updatePopulation(from_Path_4)..//return test case not previously added to temporary population\\r\\n\\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}\\r\\n\\t\\t \\t\\r\\n\\t \\t}\\r\\n\\t \\t\\r\\n\\t \\t\\r\\n\\t \\tparents_population_copy.clear();\\r\\n\\t \\t\\r\\n\\t \\tfor (int i = 0; i < 50 ; i++) // updated population \\r\\n\\t \\t\\t\\t{\\r\\n\\r\\n\\t \\t\\t\\t\\t//for (int j = 0; j < R; j++) {\\r\\n\\t \\t\\t\\t\\t\\r\\n\\t \\t\\t\\t\\t//\\tx[i][j] = (int)(Math.random()*((ub[j] - lb[j])+1))+ lb[j];\\r\\n\\r\\n\\t \\t\\t\\t\\t//update set x\\r\\n\\t \\t\\t\\t\\tparents_population_copy.add(\\\"parent\\\" + \\\" \\\" + i);\\r\\n\\t \\t\\r\\n\\t \\t\\r\\n\\t \\t\\r\\n\\t \\t\\r\\n\\t\\t\\t\\t}\\r\\n\\t \\t\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\telse { //proceed to add paths if subset of target objectives is empty\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\r\\n Set<String> add_target = paths.keySet();\\r\\n\\t \\t\\r\\n\\t \\t//replaced_status_2.put(id + new String(str), false);\\r\\n\\t \\tint true_count = 0;\\r\\n\\t \\t// get status of removal\\r\\n\\t \\tfor (String key_ss : add_target) { \\r\\n\\t \\t\\r\\n\\t \\t//pick path whose status is false\\r\\n\\t \\t\\tif ( paths.get(key_ss) ){\\r\\n\\t \\t\\t\\t\\r\\n\\t \\t\\t\\t true_count++;\\r\\n\\t \\t\\t}\\r\\n\\t \\t\\t\\r\\n\\t \\t\\telse {\\r\\n\\t \\t\\t\\t\\r\\n\\t \\t\\t\\tbreak;\\r\\n\\t \\t\\t}\\r\\n\\t \\t \\t \\r\\n\\t \\t} \\r\\n\\t \\t\\r\\n\\t \\tif ( true_count == paths.size() ) {\\r\\n\\t \\t\\t\\r\\n\\t \\t\\t//if all paths have true as replaced status\\r\\n\\t \\t\\t\\r\\n\\t \\t\\t//set them to false\\r\\n\\t \\t\\t\\r\\n\\t \\t\\t//pick subset of paths not previously removed at previous generation\\r\\n\\t \\t\\r\\n\\t \\t\\tSet<String> add_new_entry = paths.keySet();\\r\\n\\t \\t \\t\\r\\n\\t \\t \\t//replaced_status_2.put(id + new String(str), false);\\r\\n\\t \\t \\tint entry_count = 0;\\r\\n\\t \\t \\t// get status of removal\\r\\n\\t \\t \\tfor (String enrty_ss : add_new_entry ) { \\r\\n\\t \\t\\t\\r\\n\\t \\t \\t\\t paths.put(enrty_ss , false);\\r\\n\\t \\t \\t\\t\\r\\n\\t \\t \\t}\\r\\n\\t \\t \\t\\r\\n\\t \\t \\tif (paths.size() > 50) {\\r\\n\\t \\t \\t\\r\\n\\t \\t \\tint counter_add_paths = 0;\\r\\n\\t \\t \\t\\t\\r\\n Set<String> add_target_from_Path_1 = paths.keySet();\\r\\n\\t\\t \\t\\r\\n\\t\\t \\t//replaced_status_2.put(id + new String(str), false);\\r\\n\\t\\t \\t\\r\\n\\t\\t \\t// get status of removal\\r\\n\\t\\t \\t for (String from_Path_1: add_target_from_Path_1) {\\r\\n\\t \\t \\t\\r\\n\\t \\t \\t\\r\\n\\t \\t \\t\\r\\n\\t \\t\\t if (still_remaining_targets.contains(from_Path_1) ) {\\r\\n\\t \\t \\t\\t\\r\\n\\t \\t \\t\\t continue;\\r\\n\\t \\t \\t }\\r\\n\\t \\t\\t\\r\\n\\t \\t\\t else {\\r\\n\\t \\t\\t\\t \\r\\n\\t \\t\\t\\t \\r\\n\\t \\t\\t\\t if (counter_add_paths < 50) {\\r\\n\\t \\t\\t\\t\\r\\n\\t \\t\\t\\t if ( !temporary_path_holder.contains(from_Path_1) ){\\r\\n\\t \\t \\t \\t\\t\\r\\n\\t \\t\\t\\t\\t target_subset.put(from_Path_1 + \\\" \\\" + \\\"new\\\", false);\\r\\n\\t\\t \\t \\t\\t\\t\\r\\n\\t \\t\\t\\t\\t counter_add_paths++;\\r\\n\\t \\t\\t\\t\\t \\r\\n\\t \\t\\t\\t\\t// retrieve test case from archive\\r\\n\\t\\t \\t \\t\\t\\t//updatePopulation(from_Path_1)..//return test case not previously added to temporary population\\r\\n\\t \\t\\t\\t\\t \\r\\n\\t\\t \\t \\t\\t}\\r\\n\\t \\t\\t\\t\\r\\n\\t \\t\\t\\t }\\r\\n\\t \\t\\t\\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 \\t \\r\\n\\t\\t \\t }\\r\\n\\t \\t \\t}\\r\\n\\t\\t \\t \\r\\n\\t\\t \\t else {\\r\\n\\t\\t \\t \\t \\r\\n\\t\\t \\t \\t \\r\\n\\t\\t \\t \\tSet<String> add_target_from_Path_7 = paths.keySet();\\r\\n\\t\\t\\t \\t\\r\\n\\t\\t\\t \\t//replaced_status_2.put(id + new String(str), false);\\r\\n\\t\\t\\t \\t\\r\\n\\t\\t\\t \\t// get status of removal\\r\\n\\t\\t\\t \\t for (String from_Path_7: add_target_from_Path_7) { // contains(Object)\\r\\n\\t\\t\\t \\t\\r\\n\\t\\t\\t \\t //get current path set..the paths already in subset should not be picked again....\\r\\n\\t\\t\\t \\t\\t\\r\\n\\t\\t\\t \\t \\t//\\ttarget_subset.put(key + \\\" \\\" + \\\"new\\\", false);\\t\\r\\n\\t\\t\\t \\t \\t\\r\\n\\t\\t\\t if (still_remaining_targets.contains(from_Path_7) ) {\\r\\n\\t\\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 else { \\r\\n\\t \\t \\t\\tif ( !temporary_path_holder.contains(from_Path_7) ){\\r\\n\\t \\t \\t\\t\\t\\r\\n\\t \\t \\t\\t\\ttarget_subset.put(from_Path_7 + \\\" \\\" + \\\"new\\\", false);\\r\\n\\t \\t \\t\\t\\t\\r\\n\\t \\t \\t\\t\\t// retrieve test case from archive\\r\\n\\t \\t \\t\\t// retrieve test case from archive\\r\\n\\t \\t \\t\\t\\t//updatePopulation(from_Path_7)..//return test case not previously added to temporary population\\r\\n\\t \\t \\t\\t}}\\r\\n\\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 }\\r\\n\\t \\t\\t\\r\\n\\t \\telse {\\r\\n\\t \\t\\t\\r\\n\\t \\t\\t// pick paths with false status and add them to subset of targets\\r\\n\\t \\t\\t\\r\\n\\t \\t\\tint path_to_add_counter = 0;\\r\\n\\t \\t\\t\\r\\n\\t \\tif (paths.size() > 50) {\\r\\n\\t \\t\\tSet<String> add_target_from_Path = paths.keySet();\\r\\n\\t\\t \\t\\r\\n\\t\\t \\t//replaced_status_2.put(id + new String(str), false);\\r\\n\\t\\t \\t\\r\\n\\t\\t \\t// get status of removal\\r\\n\\t\\t \\t for (String from_Path: add_target_from_Path) { // contains(Object)\\r\\n\\t\\t \\t\\r\\n\\t\\t \\t //get current path set..the paths already in subset should not be picked again....\\r\\n\\t\\t \\t\\t\\r\\n\\t\\t \\t \\t//\\ttarget_subset.put(key + \\\" \\\" + \\\"new\\\", false);\\t\\r\\n\\t\\t \\t \\t\\r\\n\\t\\t \\t \\t\\tif (still_remaining_targets.contains(from_Path) ) {\\r\\n\\t\\t\\t\\t \\t \\t\\t\\r\\n\\t\\t\\t\\t \\t \\t\\tcontinue;\\r\\n\\t\\t\\t\\t \\t \\t}\\r\\n\\t\\t \\t \\t\\t\\telse {\\t\\r\\n\\t\\t \\t \\t\\t\\r\\n\\t\\t \\t \\t\\t if (path_to_add_counter < 50) {\\r\\n\\t\\t \\t \\t\\t \\r\\n\\t\\t \\t \\t if ( !paths.get(from_Path) && (!temporary_path_holder.contains(from_Path) ) ){\\r\\n\\t\\t \\t \\t\\t\\r\\n\\t\\t \\t \\t\\t target_subset.put(from_Path + \\\" \\\" + \\\"new\\\", false);\\r\\n\\t\\t \\t \\t\\t\\t\\r\\n\\t\\t \\t \\t\\t\\tpath_to_add_counter++;\\r\\n\\t\\t \\t \\t\\t\\t\\r\\n\\t\\t \\t \\t\\t\\t// retrieve test case from archive\\r\\n\\t\\t \\t \\t\\t// retrieve test case from archive\\r\\n\\t\\t \\t \\t\\t\\t//updatePopulation(from_Path)..//return test case not previously added to temporary population\\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 \\t\\t}\\r\\n\\t\\t \\t \\t\\t\\t}\\r\\n\\t\\t \\t \\t}\\r\\n\\t \\t}\\r\\n\\t \\t\\r\\n\\t \\t\\r\\n\\t\\t \\t else {\\r\\n\\t\\t \\t \\t\\t \\r\\n\\t\\t \\t \\t\\tSet<String> add_target_from_Path_4 = paths.keySet();\\r\\n\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t \\t//replaced_status_2.put(id + new String(str), false);\\r\\n\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t \\t// get status of removal\\r\\n\\t\\t\\t\\t \\t for (String from_Path_4: add_target_from_Path_4) { // contains(Object)\\r\\n\\t\\t\\t\\t \\t\\r\\n\\t\\t\\t\\t \\t //get current path set..the paths already in subset should not be picked again....\\r\\n\\t\\t\\t\\t \\t\\t\\r\\n\\t\\t\\t\\t \\t \\t//\\ttarget_subset.put(key + \\\" \\\" + \\\"new\\\", false);\\t\\r\\n\\t\\t\\t\\t \\t \\t\\r\\n\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t \\t \\t\\t\\tif (still_remaining_targets.contains(from_Path_4) ) {\\r\\n\\t\\t\\t\\t\\t\\t \\t \\t\\t\\r\\n\\t\\t\\t\\t\\t\\t \\t \\t\\tcontinue;\\r\\n\\t\\t\\t\\t\\t\\t \\t \\t}\\r\\n\\t\\t \\t \\t\\t \\r\\n\\t\\t\\t\\t \\t \\t\\t\\telse {\\r\\n\\t\\t \\t \\t\\t\\t\\r\\n\\t\\t \\t \\t\\tif ( !paths.get(from_Path_4) && (!temporary_path_holder.contains(from_Path_4) ) ){\\r\\n\\t\\t \\t \\t\\t\\t\\r\\n\\t\\t \\t \\t\\t\\ttarget_subset.put(from_Path_4 + \\\" \\\" + \\\"new\\\", false);\\r\\n\\t\\t \\t \\t\\t\\t\\r\\n\\t\\t \\t \\t\\t\\t// retrieve test case from archive\\r\\n\\t\\t \\t \\t\\t\\t//updatePopulation(from_Path_4)..//return test case not previously added to temporary population\\r\\n\\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}\\r\\n\\t\\t \\t\\r\\n\\t \\t}\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t}\\r\\n\\t \\t\\r\\n\\t \\t\\r\\n\\t\\t\\t\\tString updated_id;\\r\\n\\r\\n\\t\\t\\t\\tint updated_val;\\r\\n\\r\\n\\t\\t\\t\\t// int rem;\\r\\n\\r\\n\\t\\t\\t\\tfor (int pop = 0; pop < updated_population.size(); pop++) {\\r\\n\\r\\n\\t\\t\\t\\t\\tif (pop == 50) {\\r\\n\\t\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t\\tString[] updated_pop = (updated_population.get(pop).split(\\\" \\\"));\\r\\n\\t\\t\\t\\t\\tupdated_id = updated_pop[0];\\r\\n\\t\\t\\t\\t\\tupdated_val = Integer.parseInt(updated_pop[1]);\\r\\n\\r\\n\\t\\t\\t\\t\\tif (updated_id.equals(\\\"parent\\\")) {\\r\\n\\t\\t\\t\\t\\t\\tfor (int update_parent = 0; update_parent < R; update_parent++) {\\r\\n\\t\\t\\t\\t\\t\\t\\t// x[i][j] = v[i][j] ;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\tx[pop][update_parent] = x[updated_val][update_parent];\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\tif (updated_id.equals(\\\"child\\\")) {\\r\\n\\t\\t\\t\\t\\t\\tfor (int update_child = 0; update_child < R; update_child++) {\\r\\n\\t\\t\\t\\t\\t\\t\\t// x[i][j] = v[i][j] ;\\r\\n\\r\\n\\t\\t\\t\\t\\t\\t\\tx[pop][update_child] = v[updated_val][update_child];\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t}\\r\\n\\t \\t\\r\\n\\t \\t\\r\\n\\t\\t\\t\\t} \\t\\r\\n\\t // \\tremoved_at_previous_iteration.clear();\\r\\n\\t\\t\\t\\t//}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t//\\tfor (Map.Entry<String, ArrayList<String>> entry : names.entrySet()) {\\r\\n\\t\\t\\t\\t//\\tString key = entry.getKey();\\r\\n\\t\\t\\t\\t//\\tArrayList<String> value = entry.getValue();\\r\\n\\t\\t\\t\\t//\\t}\\r\\n\\r\\n\\t\\t\\t\\r\\n\\t\\t//\\tSystem.out.println(\\\"NO. of cycles=\\\" + (Cycle[run] - 1)); // ���Number of Cycle\\r\\n\\t\\t\\tcoverage[run] = obj_total * 100 / PATHNUM_NUMBER ; // percentage of paths covered per run\\r\\n\\t\\t\\tSystem.out.println(\\\"Path coverage=\\\" + coverage[run] + \\\"%\\\");\\r\\n\\t\\t\\tSystem.out.println(\\\"The optimal solution is\\\");\\r\\n\\t\\t\\tSystem.out.println(\\\"template 1(bbbb): \\\");\\r\\n\\t\\t\\t/*for (int a = 0; a < PATHNUM; a++) // Output the result\\r\\n\\t\\t {\\r\\n\\t\\t\\t\\tif (statu[a]) {\\r\\n\\t\\t\\t\\t\\tSystem.out.print(\\\"path\\\" + a + \\\":\\\");\\r\\n\\t\\t\\t\\t\\tfor (int j = 0; j < R; j++)\\r\\n\\t\\t\\t\\t\\t\\tSystem.out.print(solution[a][j] + \\\" \\\");\\r\\n\\t\\t\\t\\t\\tSystem.out.println();\\r\\n\\t\\t\\t\\t} else\\r\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"path\\\" + a + \\\"Not covered.\\\");\\r\\n\\t\\t\\t}*/\\r\\n\\r\\n\\t\\t\\t \\r\\n\\r\\n\\t\\t} \\r\\n\\r\\n\\t\\tdouble time_sum = 0, time_average;\\r\\n\\t\\tfloat coverage_sum = 0, coverage_average, cycle_sum = 0, cycle_average, case_average;\\r\\n\\t\\tint case_sum = 0;\\r\\n\\t\\tfor (int run = 0; run < RUN; run++) {\\r\\n\\t\\t\\ttime_sum = time_sum + runtime[run];\\r\\n\\t\\t//\\tcycle_sum = cycle_sum + (Cycle[run] - 1);\\r\\n\\t\\t//\\tcase_sum = case_sum + total_case_num[run];\\r\\n\\t\\t\\tcoverage_sum = coverage_sum + coverage[run];\\r\\n\\t\\t }\\r\\n\\t\\t\\r\\n\\t\\ttime_average = time_sum / RUN;\\r\\n\\t\\tcycle_average = cycle_sum / RUN;\\r\\n\\t\\tcase_average = case_sum / RUN;\\r\\n\\t\\tcoverage_average = coverage_sum / RUN;\\r\\n\\r\\n\\t\\tSystem.out.println(\\\"time_sum = \\\" + time_sum + \\\"ms\\\");\\r\\n\\t\\tSystem.out.println(\\\"time_average = \\\" + time_average + \\\"ms\\\");\\r\\n\\t\\tSystem.out.println(\\\"cycle_sum = \\\" + cycle_sum);\\r\\n\\t\\tSystem.out.println(\\\"cycle_average = \\\" + cycle_average);\\r\\n\\t\\tSystem.out.println(\\\"case_sum = \\\" + case_sum);\\r\\n\\t\\tSystem.out.println(\\\"case_average = \\\" + case_average);\\r\\n\\t\\tSystem.out.println(\\\"coverage_sum = \\\" + coverage_sum + \\\"%\\\");\\r\\n\\t\\tSystem.out.println(\\\"coverage_average = \\\" + coverage_average + \\\"%\\\");\\r\\n\\r\\n\\t\\r\\n\\t\\t\\r\\n\\t\\t//test case number statistics\\r\\n\\t\\ttry \\r\\n\\t\\t{ \\r\\n//\\t\\t\\tWritableWorkbook wbook= \\r\\n//\\t\\t\\tWorkbook.createWorkbook(new File(\\\"E:/result0106.xls\\\")); \\r\\n//\\t\\t\\t//生成名为“Ramdom”的工作表，参数0表示这是第一页 \\r\\n//\\t\\t\\tWritableSheet sheet=wbook.createSheet(\\\"DE1\\\",0); \\r\\n\\t\\t\\t\\r\\n\\t\\t\\tFile file = new java.io.File(\\\"C:/Users/scybe/eclipse-workspace/TestData/Test_whole.xls\\\"); \\r\\n\\t\\t\\tWorkbook book = Workbook.getWorkbook(file); \\r\\n\\t\\t\\tWritableWorkbook wbook = Workbook.createWorkbook(file, book); \\r\\n \\t WritableSheet sheet = wbook.getSheet(0); // 写入数据 sheet \\r\\n\\t\\t\\t\\r\\n\\t\\t\\tfor(int run=0 ; run<RUN; run++)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tint q = run;\\r\\n\\t\\t\\t\\tjxl.write.Number number = new jxl.write.Number(col, q,total_case_num[run]); \\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tsheet.addCell(number); \\r\\n\\t\\t\\t\\tSystem.out.println(total_case_num[run]);\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//total_case_num[run]\\r\\n\\t\\t\\t\\r\\n\\t\\t \\tdouble case_ave = getAverage(total_case_num , RUN);\\r\\n\\t\\t\\tjxl.write.Number number1 = new jxl.write.Number(col, 25 ,case_ave); \\r\\n\\t\\t\\tsheet.addCell(number1);\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t \\t\\t\\r\\n\\t\\t\\twbook.write(); \\t\\r\\n\\t\\t\\twbook.close();\\r\\n\\t\\t\\t \\r\\n\\t\\t}catch(Exception e) \\r\\n\\t\\t{ \\r\\n\\t\\tSystem.out.println(e); \\r\\n\\t\\t} \\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\r\\n\\t\\t//coverage statistics \\r\\n\\t\\t\\r\\n\\t\\t//test case number statistics\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t\\ttry \\r\\n\\t\\t\\t{ \\r\\n//\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tFile file = new java.io.File(\\\"C:/Users/scybe/eclipse-workspace/TestData/Coverage_whole.xls\\\"); \\r\\n\\t\\t\\t\\t\\tWorkbook book = Workbook.getWorkbook(file); \\r\\n\\t\\t\\t\\t\\tWritableWorkbook wbook = Workbook.createWorkbook(file, book); \\r\\n\\t\\t \\t WritableSheet sheet = wbook.getSheet(0); // 写入数据 sheet \\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tfor(int run=0 ; run<RUN; run++)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tint q=run;\\r\\n\\t\\t\\t\\t\\t\\tjxl.write.Number number = new jxl.write.Number(col, q,coverage[run]); \\r\\n\\t\\t\\t\\t\\t\\tsheet.addCell(number); \\r\\n\\t\\t\\t\\t\\t\\t\\r\\n \\r\\n\\t\\t\\t\\t\\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//total_case_num[run]\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tdouble case_ave = getAverages(coverage , RUN);\\r\\n\\t\\t\\t\\t\\tjxl.write.Number number1 = new jxl.write.Number(col,25,case_ave); \\r\\n\\t\\t\\t\\t\\tsheet.addCell(number1);\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\twbook.write(); \\t\\r\\n\\t\\t\\t\\t\\twbook.close();\\r\\n\\t\\t\\t\\t\\t \\r\\n\\t\\t\\t\\t}catch(Exception e) \\r\\n\\t\\t\\t\\t{ \\r\\n\\t\\t\\t\\tSystem.out.println(e); \\r\\n\\t\\t\\t\\t} \\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\r\\n\\r\\n\\t}\",\n \"public void quickUnion(int p, int q) {\\n int pid = find(p);\\n int qid = find(q);\\n if (pid == qid) return;\\n //compare two value's height\\n //if two height is same just need add 1 in parent root\\n if (height[p] == height[q]) {\\n id[pid] = qid;\\n height[qid]++;\\n } else if (height[p] < height[q]) {\\n id[pid] = qid;\\n } else {\\n id[qid] = pid;\\n }\\n\\n }\",\n \"public void writeSmall(byte[] b) {\\n if (b.length<12)\\n try {\\n throw new IOException();\\n } catch (IOException e) {\\n e.printStackTrace();\\n }\\n //Write compressed array//\\n int i=0;\\n for (; i< 12 ; i++) //maze dimensions + start/goal\\n write(b[i]);\\n while (i<b.length){\\n byte cell=b[i++];\\n for (int j =0 ; j<7; j++){\\n if (i<b.length)\\n cell=(byte)((cell<<1)|b[i++]);\\n else\\n cell=(byte)((cell << 1));\\n }\\n write(cell);\\n }\\n }\",\n \"private int pack(int size, int sum) {\\n return size | (sum << 16);\\n }\",\n \"public long generatePathsSlow(int size, int d, int r) {\\n // Not thread safe, lel\\n if (d == size && r == size) {\\n return 1L;\\n } else if (d == size) {\\n return generatePathsSlow(size, d, r + 1);\\n } else if (r == size) {\\n return generatePathsSlow(size, d + 1, r);\\n } else {\\n return generatePathsSlow(size, d + 1, r) + generatePathsSlow(size, d, r + 1);\\n }\\n }\",\n \"@Test(expected = Exception.class)\\n public void testMazeSizeMismatch() throws Exception {\\n shortestPath = MazeSolver.pStar(smallMaze, 20);\\n }\",\n \"@Test\\r\\n\\tpublic void permutationsTestSize5() throws BoundedQueueException {\\r\\n\\t\\tbq.enqueue(1);\\r\\n\\t\\tbq.enqueue(2);\\r\\n\\t\\tbq.enqueue(3);\\r\\n\\t\\tbq.enqueue(4);\\r\\n\\t\\tbq.enqueue(5);\\r\\n\\t\\tbq.permutations();\\r\\n\\t}\",\n \"public int size(Tree<K, V> t, int size) {\\n\\t\\tsize = left.size(left, size + 1);\\n\\t\\tsize = right.size(right, size + 1);\\n\\t\\treturn size;\\n\\t}\",\n \"List<File> compress(File directory, int size);\",\n \"void union(int a, int b) {\\n\\t\\tif (a==9 && b==4){\\r\\n\\t\\tSystem.out.println(\\\"DEBUGGING 9 AND 4\\\");\\r\\n\\t\\tSystem.out.println(\\\"size of A: \\\"+ sizeOf(a));\\r\\n\\t\\tSystem.out.println(\\\"size of B: \\\"+ sizeOf(b));\\r\\n\\t\\t}\\r\\n\\t\\tint rootB = getRoot(b); // N array access\\r\\n\\t\\tint rootA = getRoot(a); // N array access\\r\\n\\t\\tif (rootA==rootB)return;\\r\\n\\r\\n\\t\\tif (sizeOf(rootA)<sizeOf(rootB)){\\r\\n\\t\\t\\tidNode[rootA] = rootB; // 1 array access\\r\\n\\t\\t}\\r\\n\\t\\telse{\\r\\n\\t\\t\\tidNode[rootB] = rootA; // 1 array access\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public void open(int row, int col) {\\n if (isOpen(row, col)) return;\\n grid[row - 1][col - 1] = true;\\n ++openSites;\\n\\n // Transform the row and the column into an appropriate index\\n // because the quick union class uses a one-dimensional array.\\n final int currentSiteIndex = toIndex(row, col);\\n\\n // The topmost row must be connected to the virtual top.\\n if (row == 1) {\\n mainUnion.union(virtualTopId, currentSiteIndex);\\n backwashAwareUnion.union(virtualTopId, currentSiteIndex);\\n }\\n // The bottommost row must be connected to virtual the bottom.\\n if (row == size) mainUnion.union(virtualBottomId, currentSiteIndex);\\n\\n // Connect all neighbors of the current site if and only if the neighbors are open.\\n if (row > 1 && isOpen(row - 1, col)) {\\n final int topNeighborIndex = toIndex(row - 1, col);\\n mainUnion.union(topNeighborIndex, currentSiteIndex);\\n backwashAwareUnion.union(topNeighborIndex, currentSiteIndex);\\n }\\n\\n if (row < size && isOpen(row + 1, col)) {\\n final int bottomNeighborIndex = toIndex(row + 1, col);\\n mainUnion.union(bottomNeighborIndex, currentSiteIndex);\\n backwashAwareUnion.union(bottomNeighborIndex, currentSiteIndex);\\n }\\n\\n if (col > 1 && isOpen(row, col - 1)) {\\n final int leftNeighborIndex = toIndex(row, col - 1);\\n mainUnion.union(leftNeighborIndex, currentSiteIndex);\\n backwashAwareUnion.union(leftNeighborIndex, currentSiteIndex);\\n }\\n\\n if (col < size && isOpen(row, col + 1)) {\\n final int rightNeighborIndex = toIndex(row, col + 1);\\n mainUnion.union(rightNeighborIndex, currentSiteIndex);\\n backwashAwareUnion.union(rightNeighborIndex, currentSiteIndex);\\n }\\n }\",\n \"WeightedUnionFind(int N){\\n id = new int[N];\\n size = new int[N];\\n for (int i = 0; i < N; i++){\\n id[i] = i;\\n size[i] = 1;\\n }\\n }\",\n \"public org.apache.gora.cascading.test.storage.TestRow.Builder clearUnionRecursive() {\\n unionRecursive = null;\\n fieldSetFlags()[3] = false;\\n return this;\\n }\",\n \"void Union( int x, int y){\\n\\n int i = root(x);\\n int j = root(y);\\n if (i == j) return;\\n if (rank[i] > rank[j]) { id[j] = i; rank[i] += rank[j]; }\\n else { id[i] = j; rank[j] += rank[i]; }\\n }\",\n \"public org.apache.gora.cascading.test.storage.TestRow.Builder setUnionRecursive(org.apache.gora.cascading.test.storage.TestRow value) {\\n validate(fields()[3], value);\\n this.unionRecursive = value;\\n fieldSetFlags()[3] = true;\\n return this; \\n }\",\n \"public static void mazeHeight(){\\n\\t\\tint n = 10;\\t\\n\\n\\t\\tdsf S = new dsf(n*n);\\n\\t\\tMaze three = new Maze(n);\\n\\n\\t\\tRandom random;\\n\\t\\tint sets = n*n;\\t//number of sets in the DSF\\n\\t\\tint randomNumber;\\n\\t\\tint randomDirection;\\n\\t\\tint row;\\n\\t\\tint col;\\n\\n\\t\\tchar upperRight; \\t//bottom or right\\n\\n\\t\\tS.print();\\n\\n\\t\\twhile(sets > 1){\\n\\t\\t\\trandom = new Random();\\n\\t\\t\\trandomNumber = random.nextInt((n*n) - 1);\\n\\t\\t\\t//System.out.println(\\\"RANDOM NUMBER: \\\"+randomNumber);\\n\\t\\t\\trow = randomNumber /n;\\t//SWITCHED\\n\\t\\t\\tcol = randomNumber %n;\\t//SWITCHED\\n\\t\\t\\trandomDirection = random.nextInt(2);\\n\\t\\t\\tString direct;\\n\\t\\t\\tif(randomDirection == 0)\\n\\t\\t\\t\\tdirect = \\\"upper\\\";\\n\\t\\t\\telse\\n\\t\\t\\t\\tdirect = \\\"right\\\";\\n\\t\\t\\t//System.out.println(\\\"RANDOM DIRECTI0N: \\\"+direct);\\n\\t\\t\\tupperRight = three.direction(randomDirection);\\n\\n\\t\\t\\tif(upperRight == 'u'){\\n\\t\\t\\t\\tif((randomNumber) < ((n*n)-n)){\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"Sets: \\\"+sets);\\n\\t\\t\\t\\t\\tif(S.find(randomNumber) != S.find(randomNumber + n)){\\n\\t\\t\\t\\t\\t\\tS.unionByHeight(randomNumber, randomNumber+n);\\n\\t\\t\\t\\t\\t\\tthree.remove_wall(col, row, 'u');\\n\\t\\t\\t\\t\\t\\tS.print();\\n\\t\\t\\t\\t\\t\\tsets--;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(upperRight == 'r'){\\n\\t\\t\\t\\tif(((randomNumber)%(n*n)) != n-1){\\n\\t\\t\\t\\t\\tif(S.find(randomNumber) != S.find(randomNumber+1)){\\n\\t\\t\\t\\t\\t\\tS.unionByHeight(randomNumber, randomNumber+1);\\n\\t\\t\\t\\t\\t\\tthree.remove_wall(col, row, 'r');\\n\\t\\t\\t\\t\\t\\tS.print();\\n\\t\\t\\t\\t\\t\\tsets--;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tbuildAdjacencyList(three, n);\\n\\t\\tuserSelection_SolveMaze(n);\\n\\n\\n\\t\\tStdDraw.show(0);\\n\\t\\tthree.draw();\\n\\t\\tthree.printCellNumbers();\\t\\n\\t}\",\n \"public int sizeUncompressed (){\\r\\n\\t\\t\\treturn _sizeUncompressed;\\r\\n\\t\\t}\",\n \"public ArrayList<String> shortenPath(ArrayList<String> path){\\n int currentX = testFunction.startingX;\\n int currentY = testFunction.startingY;\\n ArrayList<ArrayList<Integer>> board = testFunction.board;\\n for (int i = 0; i < path.size(); i++) {\\n if(path.get(i).equals(\\\"U\\\")) currentY++;\\n if(path.get(i).equals(\\\"D\\\")) currentY--;\\n if(path.get(i).equals(\\\"L\\\")) currentX--;\\n if(path.get(i).equals(\\\"R\\\")) currentX++;\\n if(currentX < board.size() && currentY < board.get(0).size() && currentX >= 0 && currentY >= 0) {\\n if (board.get(currentX).get(currentY) == 8) {\\n ArrayList<String> shortPath = new ArrayList<>();\\n for (int j = 0; j <= i; j++) {\\n shortPath.add(path.get(j));\\n }\\n return shortPath;\\n }\\n }\\n }\\n return path;\\n }\",\n \"public void open(int row, int col) {\\n check(row, col);\\n if (!isOpen(row, col)) {\\n sites[row - 1][col - 1] = true;\\n openSites++;\\n\\n int index = index(row, col);\\n if (row == gridDimension) {\\n unionFind.union(index, bottomRoot);\\n\\n if (gridDimension == 1){\\n unionFind.union(index, topRoot);\\n fullSites.union(index, topRoot);\\n }\\n else if (isOpen(row - 1, col)) {\\n unionFind.union(index(row - 1, col), index);\\n fullSites.union(index(row - 1, col), index);\\n }\\n }\\n else if (row == 1) {\\n unionFind.union(index, topRoot);\\n fullSites.union(index, topRoot);\\n\\n if (isOpen(row + 1, col)) {\\n unionFind.union(index(row + 1, col), index);\\n fullSites.union(index(row + 1, col), index);\\n }\\n }\\n\\n else {\\n if (isOpen(row + 1, col)) {\\n unionFind.union(index(row + 1, col), index);\\n fullSites.union(index(row + 1, col), index);\\n }\\n\\n if (isOpen(row - 1, col)) {\\n unionFind.union(index(row - 1, col), index);\\n fullSites.union(index(row - 1, col), index);\\n }\\n }\\n\\n\\n\\n if (col > 1) {\\n if (isOpen(row, col - 1)) {\\n unionFind.union(index(row, col - 1), index);\\n fullSites.union(index(row, col - 1), index);\\n }\\n }\\n\\n if (col < gridDimension) {\\n if (isOpen(row, col + 1)) {\\n unionFind.union(index(row, col + 1), index);\\n fullSites.union(index(row, col + 1), index);\\n }\\n }\\n }\\n }\",\n \"public QuadTree(PointView<Point> view, int transitionSize) {\\n super(view);\\n _transitionSize = transitionSize;\\n _nodeOrigin = new double[2];\\n _elements = new ArrayList<Point>();\\n _subdivided = false;\\n _elementsSize = 0;\\n _treeSize = 0;\\n }\",\n \"public static void printfin(coordinate visit1[][], coordinate visit2[][]) {\\n \\t //represent one path to be 3s and the other to be 4s, but for now, set both srcs to three\\n \\t map[dim-1][dim-1]=3;\\n \\t map[0][0]=3;\\n \\t int tempx = intersect.x; \\n \\t int tempy = intersect.y;\\n \\t map[tempx][tempy] = 3; //will be updated later\\n \\n \\t while(!(tempx==0 && tempy==0)) { //iterate one path until we hit the src1\\n coordinate hold = visit1[tempx][tempy];\\n\\t\\t//take current node and mark as visited in path 1 (src1 -- from 0,0 to intersect)\\n tempx = hold.x;\\n tempy=hold.y;\\n\\t\\t//set these to 3, as visited, and increase pathSize\\n pathsize++;\\n\\n map[tempx][tempy]=3;\\n\\n tempx = hold.x;\\n tempy=hold.y;\\n\\n map[tempx][tempy]=3;\\n \\t }\\n \\t //do the same for second path\\n \\t tempx = intersect.x;\\n \\t tempy = intersect.y;\\n \\t map[tempx][tempy] = 3; \\n \\t int val=dim-1;\\n \\n\\t //this is for the other path from the second src\\n \\t while(!(tempx==val && tempy==val)) {\\n\\t \\t coordinate hold = visit2[tempx][tempy];\\n\\t \\t tempx = hold.x;\\n\\t \\t tempy=hold.y;\\n\\t \\t pathsize++;\\n\\t \\t \\n\\t \\t map[tempx][tempy]=3;\\n\\t \\t \\n\\t \\t tempx = hold.x;\\n\\t \\t tempy=hold.y;\\n\\t \\t \\n\\t \\t map[tempx][tempy]=4;\\n \\t }\\n \\n }\",\n \"public Maze(int size) {\\n \\t\\tthis.size = size;\\n \\t\\ttarget = new Point(size, 1);\\n \\n \\t\\tvisited = new boolean[size + 2][size + 2];\\n \\t\\tnorth = new boolean[size + 2][size + 2];\\n \\t\\teast = new boolean[size + 2][size + 2];\\n \\t\\tsouth = new boolean[size + 2][size + 2];\\n \\t\\twest = new boolean[size + 2][size + 2];\\n \\t\\t\\n \\t\\tinit();\\n \\t\\tcalculateCentre();\\n \\t\\tcreateSwitches(); //needs to be done after centre is created\\n \\t\\t\\n \\t\\t //create 15 motion sensors, but don't create any in the centre\\n \\t\\tms = new MotionSensors(size, 15, centreMin, centreMax);\\n \\t\\t//System.out.println(ms); //print motion sensor coordinates\\n \\t\\t\\n \\t\\tcreateSubmarineMaze();//generates maze for the submarine\\n \\t}\",\n \"static\\nint\\nprintUnion(\\nint\\narr1[], \\nint\\narr2[], \\nint\\nm, \\nint\\nn) \\n\\n{ \\n\\nint\\ni = \\n0\\n, j = \\n0\\n; \\n\\nwhile\\n(i < m && j < n) \\n\\n{ \\n\\nif\\n(arr1[i] < arr2[j]) \\n\\nSystem.out.print(arr1[i++]+\\n\\\" \\\"\\n); \\n\\nelse\\nif\\n(arr2[j] < arr1[i]) \\n\\nSystem.out.print(arr2[j++]+\\n\\\" \\\"\\n); \\n\\nelse\\n\\n{ \\n\\nSystem.out.print(arr2[j++]+\\n\\\" \\\"\\n); \\n\\ni++; \\n\\n} \\n\\n} \\n\\n\\n/* Print remaining elements of \\n\\nthe larger array */\\n\\nwhile\\n(i < m) \\n\\nSystem.out.print(arr1[i++]+\\n\\\" \\\"\\n); \\n\\nwhile\\n(j < n) \\n\\nSystem.out.print(arr2[j++]+\\n\\\" \\\"\\n); \\n\\n\\nreturn\\n0\\n; \\n\\n}\",\n \"private void findPath2(List<Coordinate> path) {\\n List<Integer> cost = new ArrayList<>(); // store the total cost of each path\\n // store all possible sequences of way points\\n ArrayList<List<Coordinate>> allSorts = new ArrayList<>();\\n int[] index = new int[waypointCells.size()];\\n for (int i = 0; i < index.length; i++) {// generate the index reference list\\n index[i] = i;\\n }\\n permutation(index, 0, index.length - 1);\\n for (Coordinate o1 : originCells) {\\n for (Coordinate d1 : destCells) {\\n for (int[] ints1 : allOrderSorts) {\\n List<Coordinate> temp = getOneSort(ints1, waypointCells);\\n temp.add(0, o1);\\n temp.add(d1);\\n int tempCost = 0;\\n for (int i = 0; i < temp.size() - 1; i++) {\\n Graph graph = new Graph(getEdge(map));\\n Coordinate start = temp.get(i);\\n graph.dijkstra(start);\\n Coordinate end = temp.get(i + 1);\\n graph.printPath(end);\\n tempCost = tempCost + graph.getPathCost(end);\\n if (graph.getPathCost(end) == Integer.MAX_VALUE) {\\n tempCost = Integer.MAX_VALUE;\\n break;\\n }\\n }\\n cost.add(tempCost);\\n allSorts.add(temp);\\n }\\n }\\n }\\n System.out.println(\\\"All sorts now have <\\\" + allSorts.size() + \\\"> items.\\\");\\n List<Coordinate> best = allSorts.get(getMinIndex(cost));\\n generatePath(best, path);\\n setSuccess(path);\\n }\",\n \"protected void trimToSize() {\\n\\tnodeList.trimToSize();\\n\\tedgeList.trimToSize();\\n }\",\n \"public void union(T x, T y) {\\n\\t\\tassert (_parents.containsKey(x));\\n\\t\\tassert (_parents.containsKey(y));\\n\\n\\t\\tx = find(x);\\n\\t\\ty = find(y);\\n\\n\\t\\tif (x == y) {\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\n\\t\\tint xRank = _ranks.get(x);\\n\\t\\tint yRank = _ranks.get(y);\\n\\n\\t\\tif (xRank < yRank) {\\n\\t\\t\\t_parents.put(x, y);\\n\\t\\t} else if (xRank > yRank) {\\n\\t\\t\\t_parents.put(y, x);\\n\\t\\t} else {\\n\\t\\t\\t_parents.put(y, x);\\n\\t\\t\\t_ranks.put(x, xRank + 1);\\n\\t\\t}\\n\\n\\t\\t_numSets--;\\n\\t}\",\n \"void resize() {\\n Comparable[] temp = new Comparable[size * 2];\\n for (int i = 0; i < pq.length; i++) {\\n temp[i] = pq[i];\\n }\\n pq = temp;\\n }\",\n \"public static int distinctPaths4(int n) {\\n\\t\\tint[][] mem = new int[n+1][n+1];\\n\\t\\tfor(int j = 1; j <= n; ++j) {\\n\\t\\t\\tmem[1][j] = 1;\\n\\t\\t\\tmem[j][1] = 1;\\n\\t\\t}\\n\\t\\tfor(int i = 2; i <= n; ++i) {\\n\\t\\t\\tfor(int j = 2; j <= n; ++j) {\\n\\t\\t\\t\\tmem[i][j] = mem[i-1][j] + mem[i][j-1];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn mem[n][n];\\n\\t}\",\n \"public void union(Node a, Node b) {\\n Node set1 = find(a);\\n Node set2 = find(b);\\n\\n if (set1 != set2) {\\n // Limits the worst case runtime of a find to O(log N)\\n if (set1.getSize() < set2.getSize()) {\\n set2.setParent(set1);\\n set1.setSize(set1.getSize() + set2.getSize());\\n }\\n else {\\n set1.setParent(set2);\\n set2.setSize(set1.getSize() + set2.getSize());\\n }\\n }\\n }\",\n \"public static ArrayList<ArrayList<String>> unionD(String table1Name, String table2Name){\\n\\t\\tArrayList<ArrayList<String>> union = new ArrayList<ArrayList<String>>();\\r\\n\\t\\t//these will hold the data from the input tables\\r\\n\\t\\tArrayList<ArrayList<String>> columns1 = new ArrayList<ArrayList<String>>();\\r\\n\\t\\tArrayList<ArrayList<String>> columns2 = new ArrayList<ArrayList<String>>();\\r\\n\\t\\t//find the input tables in the database list\\r\\n\\t\\tfor (int i = 0; i < tables.size(); i++) {\\r\\n\\t\\t\\tif (tables.get(i).getName().equals(table1Name)) {\\r\\n\\t\\t\\t\\tcolumns1 = new ArrayList<ArrayList<String>>(tables.get(i).datas);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tif (tables.get(i).getName().equals(table2Name)) {\\r\\n\\t\\t\\t\\tcolumns2 = new ArrayList<ArrayList<String>>(tables.get(i).datas);\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\t//check if the tables are union compatable\\r\\n\\t\\tif (columns1.size() != columns2.size()) {\\r\\n\\t\\t\\tSystem.out.println(\\\"Unable to perform union - unnequal number of columns.\\\");\\r\\n\\t\\t}\\r\\n\\t\\telse {\\t//only continue if they are union compatable\\r\\n\\t\\t\\t//true if all columns have the same type\\r\\n\\t\\t\\tint sameTypes = 1;\\r\\n\\t\\t\\tint type1 = 0;\\r\\n\\t\\t\\tint type2 = 0;\\r\\n\\t\\t\\t//a max char value of -1 indicates the type is integer\\r\\n\\t\\t\\tfor (int j = 0; j < columns1.size(); j++) {\\r\\n\\t\\t\\t\\ttype1 = Integer.valueOf(new String(columns1.get(j).get(1)));\\r\\n\\t\\t\\t\\ttype2 = Integer.valueOf(columns2.get(j).get(1));\\r\\n\\t\\t\\t\\tif (type1 > 0) { type1 = 1; }\\r\\n\\t\\t\\t\\telse if (type1 < 0) { type1 = -1; }\\r\\n\\t\\t\\t\\tif (type2 > 0) { type2 = 1; }\\r\\n\\t\\t\\t\\telse if (type2 < 0) { type2 = -1; }\\r\\n\\t\\t\\t\\t//if the types were not equal, don't continue\\r\\n\\t\\t\\t\\tif (type1 != type2) {\\r\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"Unable to perform union - incompatible types.\\\");\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\telse {\\t//continue if the types are equal\\r\\n\\t\\t\\t\\t\\t\\t//create new columns holding the name from the first table and the greatest char max\\r\\n\\t\\t\\t\\t\\tArrayList<String> newColumn = new ArrayList<String>();\\r\\n\\t\\t\\t\\t\\tint largestChar = 0;\\r\\n\\t\\t\\t\\t\\tif (type1 != -1) {\\t//if they aren't integers\\r\\n\\t\\t\\t\\t\\t\\t//find the largest max char value\\r\\n\\t\\t\\t\\t\\t\\tif (Integer.parseInt(columns1.get(j).get(1)) >= Integer.parseInt(columns2.get(j).get(1))) {\\r\\n\\t\\t\\t\\t\\t\\t\\tlargestChar = Integer.parseInt(new String(columns1.get(j).get(1)));\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\telse { \\r\\n\\t\\t\\t\\t\\t\\t\\tlargestChar = Integer.parseInt(columns2.get(j).get(1)); \\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t//keep the type as integer\\r\\n\\t\\t\\t\\t\\telse { \\r\\n\\t\\t\\t\\t\\t\\tlargestChar = -1; \\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t//use the name from the first table and largest char max\\r\\n\\t\\t\\t\\t\\tnewColumn.add(new String(columns1.get(j).get(0)));\\r\\n\\t\\t\\t\\t\\tnewColumn.add(String.valueOf(largestChar));\\r\\n\\t\\t\\t\\t\\tunion.add(newColumn);\\r\\n\\t\\t\\t\\t\\t//check if there are equal rows to avoid duplicates\\r\\n\\t\\t\\t\\t\\tint colCount = 0;\\r\\n\\t\\t\\t\\t\\tfor (int n = 2; n < columns1.get(colCount).size(); n++) {\\t//for each row in table1\\r\\n\\t\\t\\t\\t\\t\\tunion.get(j).add(new String(columns1.get(j).get(n)));\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\t\\t\\r\\n\\t\\t\\tfor(int t = 2; t<columns2.get(0).size(); t++){\\t//column2 row\\r\\n\\t\\t\\t\\tboolean completeUniqe = true;\\r\\n\\t\\t\\t\\tfor(int p = 2; p < union.get(0).size(); p++){// rows of union\\r\\n\\t\\t\\t\\t\\tint sameCount = 0;\\r\\n\\t\\t\\t\\t\\tfor(int u = 0; u<union.size(); u++){//columns of union\\r\\n\\t\\t\\t\\t\\t\\tif(columns2.get(u).get(t).equals(union.get(u).get(p))){\\r\\n\\t\\t\\t\\t\\t\\t\\tsameCount++;\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\tSystem.out.println(sameCount);\\r\\n\\t\\t\\t\\t\\tif(sameCount == union.size()){\\r\\n\\t\\t\\t\\t\\t\\tcompleteUniqe = false;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tif(completeUniqe){\\r\\n\\t\\t\\t\\t\\tfor(int u = 0; u<union.size(); u++){//columns of union\\r\\n\\t\\t\\t\\t\\t\\tunion.get(u).add(new String(columns2.get(u).get(t)));\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\treturn union;\\r\\n\\t}\",\n \"@Override\\n public void union(int root1, int root2) {\\n // TODO: Implement the union-by-rank algorithm for disjoint set\\n if (s[root1]>-1 || s[root2]>-1 ) throw new IllegalArgumentException(\\\"Impossible to union because one of the roots is already dependant\\\");\\n if( s[root2] < s[root1]){ // root2 is deeper\\n s[root1] = root2;// Make root2 new root\\n } \\n else{\\n if(s[root1] == s[root2]) s[ root1 ]--; // Update height if same\\n s[root2] = root1; // Make root1 new root\\n }\\n }\",\n \"public static Stack<Integer> topologicalKosarajuDFSRecursive(ArrayList<ArrayList<Integer>> adj,int u,Stack<Integer> stack,boolean[] visited){\\r\\n visited[u]=true;\\r\\n for(int i:adj.get(u))\\r\\n if(!visited[u])\\r\\n topologicalKosarajuDFSRecursive(adj,i,stack,visited);\\r\\n stack.push(u);\\r\\n return stack;\\r\\n }\",\n \"public int getMazeSize() \\r\\n\\t{\\r\\n\\t\\treturn this.size;\\r\\n\\t}\",\n \"public void setSize() {\\n\\t\\t\\tthis.size = 1;\\n\\t\\t\\tint leftSize = 0;\\n\\t\\t\\tint rightSize = 0;\\n\\t\\t\\tif (this.getLeft().getKey() != -1) {\\n\\t\\t\\t\\tleftSize = this.getLeft().getSize();\\n\\t\\t\\t}\\n\\t\\t\\tif (this.getRight().getKey() != -1) {\\n\\t\\t\\t\\trightSize = this.getRight().getSize();\\n\\t\\t\\t}\\n\\t\\t\\tthis.size += leftSize + rightSize;\\n\\n\\t\\t\\t/**\\n\\t\\t\\t * this.size = 1; int leftSize = 0; int rightSize = 0; try { leftSize =\\n\\t\\t\\t * this.getLeft().getSize(); this.size += leftSize; } catch\\n\\t\\t\\t * (NullPointerException e) { this.size += leftSize; } try { rightSize =\\n\\t\\t\\t * this.getRight().getSize(); this.size += rightSize; } catch\\n\\t\\t\\t * (NullPointerException e) { this.size += rightSize; } if (this.getSize() >\\n\\t\\t\\t * 990) { System.out.println(\\\"actual size is:\\\" + this.getSize()); }\\n\\t\\t\\t */\\n\\t\\t}\",\n \"void Union(int parent[], int x, int y){ \\n int xset = find(parent, x); \\n int yset = find(parent, y); \\n parent[xset] = yset; \\n }\",\n \"private void findPath(int[][] path){\\n int row = rows-1;\\n int col = cols-1;\\n int count = 1;\\n int[][] newpath = new int[row+1][col+1];\\n while(row>0 && col> 0){\\n if(path[row-1][col-1]+1 == path[row][col]){\\n newpath[row][col] = path[row][col];\\n System.out.println(\\\"edit distance: \\\" + count + \\\"--> replace '\\\" + oriString.charAt(row-1) + \\\"' with '\\\" + fixString.charAt(col-1)+\\\"'\\\");\\n count++;\\n row--;\\n col--;\\n }else if(path [row-1][col]+1 == path[row][col]){\\n newpath[row][col] = path[row][col];\\n System.out.println(\\\"edit distance: \\\" + count + \\\"--> remove '\\\" + oriString.charAt(row-1) + \\\"' from str1\\\");\\n row--;\\n count++;\\n\\n }else if(path [row][col-1]+1 == path[row][col]){\\n newpath[row][col] = path[row][col];\\n System.out.println(\\\"edit distance: \\\" + count + \\\"--> add '\\\" + fixString.charAt(col-1) + \\\"' to str1\\\");\\n count++;\\n col--;\\n }else if(path [row-1][col-1] == path[row][col]){\\n newpath[row][col] = path[row][col];\\n row--;\\n col--;\\n }\\n }\\n if( row != 0){\\n while(row > 0){\\n if(path[row][col] == path[row-1][col]+1){\\n newpath[row][col] = path[row][col];\\n System.out.println(\\\"edit distance: \\\" + count + \\\"--> remove '\\\" + oriString.charAt(row-1) + \\\"' to str1\\\");\\n count++;\\n row--;\\n }\\n }\\n }\\n if( col != 0){\\n while(col > 0){\\n if(path[row][col] == path[row][col-1]+1){\\n newpath[row][col] = path[row][col];\\n System.out.println(\\\"edit distance: \\\" + count + \\\"--> add '\\\" + fixString.charAt(col-1) + \\\"' to str1\\\");\\n count++;\\n col--;\\n }\\n }\\n }\\n // printPath(newpath);\\n }\",\n \"public void union(String p, String q) {\\n if(p.equals(q)) return;\\n String rootP = findRoot(p);\\n String rootQ = findRoot(q);\\n // skip if both users are already part of the same tree.\\n if(rootP.equals(rootQ)) return;\\n\\n int newHeight = treesHeight.get(rootP) + treesHeight.get(rootQ);\\n // Keep track of the highest tree.\\n highestHeight = Math.max(highestHeight, newHeight);\\n\\n if (treesHeight.get(rootP) > treesHeight.get(rootQ)) {\\n usersMap.put(rootQ, rootP);\\n treesHeight.put(rootP, newHeight);\\n }\\n else {\\n usersMap.put(rootP, rootQ);\\n treesHeight.put(rootQ, newHeight);\\n }\\n }\",\n \"private static void testAlgorithmOptimality() {\\n AlgoFunction testAlgo = SG16Algorithm::new;\\n\\n //printSeed = false; // keep this commented out.\\n Random seedRand = new Random(1241);\\n int initial = seedRand.nextInt();\\n for (int i=0; i<50000000; i++) {\\n int sizeX = seedRand.nextInt(150) + 5;\\n int sizeY = seedRand.nextInt(150) + 5;\\n int seed = i+initial;\\n int ratio = seedRand.nextInt(50) + 5;\\n \\n int max = (sizeX+1)*(sizeY+1);\\n int p1 = seedRand.nextInt(max);\\n int p2 = seedRand.nextInt(max-1);\\n if (p2 == p1) {\\n p2 = max-1;\\n }\\n \\n int sx = p1%(sizeX+1);\\n int sy = p1/(sizeX+1);\\n int ex = p2%(sizeX+1);\\n int ey = p2/(sizeX+1);\\n\\n double restPathLength = 0, normalPathLength = 0;\\n try {\\n GridGraph gridGraph = DefaultGenerator.generateSeededGraphOnly(seed, sizeX, sizeY, ratio);\\n for (int iii=0;iii<300;++iii) Utility.generatePath(testAlgo, gridGraph, seedRand.nextInt(sizeX+1),seedRand.nextInt(sizeY+1),seedRand.nextInt(sizeX+1),seedRand.nextInt(sizeY+1));\\n int[][] path = Utility.generatePath(testAlgo, gridGraph, sx, sy, ex, ey);\\n path = Utility.removeDuplicatesInPath(path);\\n restPathLength = Utility.computePathLength(gridGraph, path);\\n \\n path = Utility.computeOptimalPathOnline(gridGraph, sx, sy, ex, ey);\\n path = Utility.removeDuplicatesInPath(path);\\n normalPathLength = Utility.computePathLength(gridGraph, path);\\n }catch (Exception e) {\\n e.printStackTrace();\\n System.out.println(\\\"EXCEPTION OCCURRED!\\\");\\n System.out.println(\\\"Seed = \\\" + seed +\\\" , Ratio = \\\" + ratio + \\\" , Size: x=\\\" + sizeX + \\\" y=\\\" + sizeY);\\n System.out.println(\\\"Start = \\\" + sx + \\\",\\\" + sy + \\\" End = \\\" + ex + \\\",\\\" + ey);\\n throw new UnsupportedOperationException(\\\"DISCREPANCY!!\\\");\\n }\\n \\n if (Math.abs(restPathLength - normalPathLength) > 0.000001f) {\\n //if ((restPathLength == 0.f) != (normalPathLength == 0.f)) {\\n System.out.println(\\\"============\\\");\\n System.out.println(\\\"Discrepancy Discovered!\\\");\\n System.out.println(\\\"Seed = \\\" + seed +\\\" , Ratio = \\\" + ratio + \\\" , Size: x=\\\" + sizeX + \\\" y=\\\" + sizeY);\\n System.out.println(\\\"Start = \\\" + sx + \\\",\\\" + sy + \\\" End = \\\" + ex + \\\",\\\" + ey);\\n System.out.println(\\\"Actual: \\\" + restPathLength + \\\" , Expected: \\\" + normalPathLength);\\n System.out.println(restPathLength / normalPathLength);\\n System.out.println(\\\"============\\\");\\n throw new UnsupportedOperationException(\\\"DISCREPANCY!!\\\");\\n } else {\\n if (i%1000 == 999) {\\n System.out.println(\\\"Count: \\\" + (i+1));\\n System.out.println(\\\"OK: Seed = \\\" + seed +\\\" , Ratio = \\\" + ratio + \\\" , Size: x=\\\" + sizeX + \\\" y=\\\" + sizeY);\\n System.out.println(\\\"Actual: \\\" + restPathLength + \\\" , Expected: \\\" + normalPathLength);\\n }\\n }\\n }\\n }\",\n \"@Test\\n public void testUnionOnSchemaInputUdfs() throws Exception {\\n PigServer pig = new PigServer(Util.getLocalTestMode());\\n String query =\\n \\\" l1 = load '\\\" + INP_FILE_2NUMS + \\\"' as (i : int, j : chararray);\\\"\\n + \\\"l2 = load '\\\" + INP_FILE_2NUMS + \\\"' as (i : int, j : chararray);\\\"\\n + \\\"f1 = foreach l1 generate i, CONCAT(j,j) as cj, \\\" +\\n \\t\\t\\\"org.apache.pig.test.TestUnionOnSchema\\\\\\\\$UDFTupleNullSchema(i,j) as uo;\\\"\\n + \\\"u = union onschema f1, l2;\\\"\\n ; \\n Util.registerMultiLineQuery(pig, query);\\n\\n Schema sch = pig.dumpSchema(\\\"u\\\");\\n String expectedSch = \\\"{i: int,cj: chararray,uo: (),j: chararray}\\\";\\n Assert.assertTrue( expectedSch.equals( sch.toString() ) );\\n \\n\\n Iterator<Tuple> it = pig.openIterator(\\\"u\\\");\\n List<Tuple> expectedRes = \\n Util.getTuplesFromConstantTupleStrings(\\n new String[] {\\n \\\"(1,null,null,'2')\\\",\\n \\\"(5,null,null,'3')\\\",\\n \\\"(1,'22',(1,'2'),null)\\\",\\n \\\"(5,'33',(5,'3'),null)\\\"\\n });\\n Util.checkQueryOutputsAfterSort(it, expectedRes);\\n\\n }\",\n \"private void BuildUp(int towerToBuild, int towerTarget, int bottomSize) {\\n\\t\\t\\n\\t\\tint notTowerTarget = getOtherTower(towerToBuild,towerTarget);\\n\\n\\t\\twhile( towerSet.TopBlock(towerToBuild) > 1 ) {\\n\\t\\t\\tif(towerSet.TopBlock(towerTarget) == towerSet.TopBlock(towerToBuild) - 1) {\\n\\t\\t\\t\\ttowerSet.MoveBlock(towerTarget,towerToBuild);\\n\\t\\t\\t\\tturnNumber++;\\n\\t\\t\\t\\tSystem.out.println(this.toString());\\n\\t\\t\\t}\\n\\t\\t\\telse if(towerSet.TopBlock(notTowerTarget) == towerSet.TopBlock(towerToBuild) - 1) {\\n\\t\\t\\t\\ttowerSet.MoveBlock(notTowerTarget,towerToBuild);\\n\\t\\t\\t\\tturnNumber++;\\n\\t\\t\\t\\tSystem.out.println(this.toString());\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tif(towerSet.TopBlock(towerTarget) == 1 ) {\\n\\t\\t\\t\\t\\tthis.BreakDown(towerTarget, towerToBuild, towerSet.TopBlock(towerToBuild) - 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tthis.BreakDown(notTowerTarget, towerToBuild, towerSet.TopBlock(towerToBuild) - 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"private void increaseSize() {\\r\\n\\t\\tE[] biggerE = (E[]) new Object[this.capacity * 2];\\r\\n\\t\\tdouble[] biggerC = new double[this.capacity * 2];\\r\\n\\t\\tfor (int i = 0; i < this.size; i++) {\\r\\n\\t\\t\\tbiggerE[i] = this.objectHeap[i];\\r\\n\\t\\t\\tbiggerC[i] = this.costHeap[i];\\r\\n\\t\\t}\\r\\n\\t\\tthis.costHeap = biggerC;\\r\\n\\t\\tthis.objectHeap = biggerE;\\r\\n\\t\\tthis.capacity = this.capacity * 2;\\r\\n\\t}\",\n \"static int findUnion(int i) {\\n int result = i;\\n while(parent[result] != result)\\n result = parent[result];\\n\\n // update all parents of i to result\\n while(parent[i] != i) {\\n int temp = parent[i];\\n parent[i] = result;\\n i = temp;\\n }\\n return result;\\n }\",\n \"public static String findPath(Maze maze) {\\n \\tint m = maze.getNumRows();\\n \\tint n = maze.getNumCols();\\n\\n \\t//define a visited matrix\\n \\tboolean[][] visited = new boolean[m][n];\\n \\tsetvisited(false, visited);\\n\\n \\t//define a direction matrix\\n \\tint[][] dir_mtr = new int[m][n];\\n \\tinit_dir(-1,dir_mtr);\\n\\n\\n\\n \\t//define a stack\\n \\tStack<MazeLocation> s;\\n \\ts = new StackRefBased<MazeLocation>();\\n\\n \\tMazeLocation entry = maze.getEntry();\\n \\tMazeLocation exit = maze.getExit();\\n \\t// System.out.println(entry.toString());\\n \\ts.push(entry);\\n\\n\\t\\tMazeLocation temp; \\n\\t\\tString result = \\\"\\\"; \\t\\n\\n\\t\\ttry{\\n\\t\\t\\tint x,y;\\n\\n\\n\\t\\t\\twhile(!s.isEmpty()){\\n\\n \\t\\ttemp = s.peek();\\n \\t\\tx = temp.getRow();\\n \\t\\ty = temp.getCol();\\n \\t\\tdir_mtr[x][y]+=1;\\n\\n \\t\\tif(temp.toString().equals(exit.toString())){\\n \\t\\t\\tSystem.out.println(\\\"find the path\\\");\\n \\t\\t\\tbreak;\\n\\n \\t\\t}\\n\\n \\t\\tif(dir_mtr[x][y]==0){ \\n \\t\\t\\t//checking the up direction\\n \\t\\t\\tif(x-1>=0 && !maze.isWall(x-1,y) && !visited[x-1][y]){\\n \\t\\t\\t\\tMazeLocation testnode = new MazeLocation(x-1,y,maze.isWall(x-1,y));\\n \\t\\t\\t\\tvisited[x-1][y] = true;\\n \\t\\t\\t\\ts.push(testnode);\\n\\n \\t\\t\\t}\\n\\n \\t\\t}else if(dir_mtr[x][y]==1){\\n \\t\\t\\t//checking the left direction\\n \\t\\t\\tif(y-1>=0 && !maze.isWall(x,y-1) && !visited[x][y-1]){\\n \\t\\t\\t\\tMazeLocation testnode = new MazeLocation(x,y-1,maze.isWall(x,y-1));\\n \\t\\t\\t\\tvisited[x][y-1] = true;\\n \\t\\t\\t\\ts.push(testnode);\\n\\n \\t\\t\\t}\\n\\n \\t\\t}else if(dir_mtr[x][y]==2){\\n \\t\\t\\t//checking the down direction\\n \\t\\t\\tif(x+1<m && !maze.isWall(x+1,y) && !visited[x+1][y]){\\n \\t\\t\\t\\tMazeLocation testnode = new MazeLocation(x+1,y,maze.isWall(x+1,y));\\n \\t\\t\\t\\tvisited[x+1][y] = true;\\n \\t\\t\\t\\ts.push(testnode);\\n\\n \\t\\t\\t}\\n \\t\\t\\t\\n \\t\\t}else if(dir_mtr[x][y]==3){\\n \\t\\t\\t//checking the right direction\\n \\t\\t\\tif(y+1<n && !maze.isWall(x,y+1) && !visited[x][y+1]){\\n \\t\\t\\t\\tMazeLocation testnode = new MazeLocation(x,y+1,maze.isWall(x,y+1));\\n \\t\\t\\t\\tvisited[x][y+1] = true;\\n \\t\\t\\t\\ts.push(testnode);\\n\\n \\t\\t\\t}\\n \\t\\t\\t\\n \\t\\t}else{\\n \\t\\t\\tvisited[x][y] = false;\\n \\t\\t\\ts.pop();\\n \\t\\t}\\n\\n\\n\\n \\t\\t\\n \\t}\\n\\n \\t//reverse the stack\\n \\tStack<MazeLocation> reverse;\\n \\treverse = new StackRefBased<MazeLocation>();\\n \\twhile(!s.isEmpty()){\\n\\t\\t\\t reverse.push(s.pop()); \\t//push the node to the reverse stack\\n\\t\\t\\t }\\n\\n\\n \\t//if the stack is not empty, then we find the path\\n\\t\\tif(!reverse.isEmpty()){\\n\\t\\t\\tresult = reverse.toString();\\n\\n\\t\\t}\\n\\n \\t\\n \\n\\n\\t\\t}\\n\\t\\tcatch (StackEmptyException see) {\\n \\n }\\n\\n\\n \\treturn result;\\n\\n\\n }\",\n \"public void xorSet(HashMap<Integer, Integer> Path) {\\n int[] newMM = new int[x.length]; // == MaxMatch (+) P\\n\\n // In Path, Not In MaxMatch\\n for (int i : Path.keySet()) {\\n int j = Path.get(i);\\n int A = Math.min(i, j);\\n int B = Math.max(i, j);\\n if (MaxMatch[A] != B) { // (i,j) in Path and not in MaxMatch\\n newMM[A] = B;\\n V1.remove(A);\\n V2.remove(B);\\n\\n //System.out.println(A + \\\" -- \\\" + B);\\n //printFree();\\n }\\n }\\n\\n // In MaxMatch, Not In Path\\n for (int i = 0; i < x.length; i++) {\\n int j = MaxMatch[i];\\n if (j != 0) {\\n if (((Path.get(i) != null && Path.get(i) != j) || Path.get(i) == null) && (Path.get(j) != null && Path.get(j) != i) || Path.get(j) == null) {\\n newMM[i] = j;\\n V1.remove(i);\\n V2.remove(j);\\n //System.out.println(i + \\\" --- \\\" + j);\\n //printFree();\\n }\\n }\\n }\\n MaxMatch = newMM;\\n\\n if (debug == 1) printMaxiumMatching();\\n }\",\n \"@Override\\r\\n public void write(byte[] b) throws IOException {\\r\\n int rows = (Byte.toUnsignedInt(b[0])*255) + Byte.toUnsignedInt(b[1]);\\r\\n int cols = (Byte.toUnsignedInt(b[2])*255) + Byte.toUnsignedInt(b[3]);\\r\\n int compressed_size = 12 + (((rows*cols)) / 8);\\r\\n if ((rows*cols) % 8 != 0)\\r\\n compressed_size++;\\r\\n\\r\\n byte[] to_return = new byte[compressed_size];\\r\\n System.arraycopy(b,0,to_return,0,12);\\r\\n String s1=\\\"\\\";\\r\\n int j=0;\\r\\n int index=12;\\r\\n //go through the body of the maze\\r\\n for(int i=12; i<b.length; i++){\\r\\n //reached end of chunk\\r\\n if(j==8){\\r\\n byte temp=(byte)Integer.parseInt(s1,2);\\r\\n to_return[index]=temp;\\r\\n index++;\\r\\n s1=Integer.toString(b[i]);\\r\\n j=1;\\r\\n if(i==b.length-1){\\r\\n //s1+=Integer.toString(b[i]);\\r\\n byte temp1=(byte)Integer.parseInt(s1,2);\\r\\n to_return[index]=temp1;\\r\\n }\\r\\n }\\r\\n else if(j != 8 && i==b.length-1){ //remaining in case doesn't divide in 7 completely\\r\\n s1+=Integer.toString(b[i]);\\r\\n byte temp=(byte)Integer.parseInt(s1,2); //turns from binary string to byte(0-127)\\r\\n to_return[index]=temp;\\r\\n }\\r\\n else{\\r\\n s1+=Integer.toString(b[i]);\\r\\n j++;\\r\\n }\\r\\n }\\r\\n try{\\r\\n if(this.out instanceof ObjectOutputStream){\\r\\n ObjectOutputStream o=(ObjectOutputStream)this.out;\\r\\n o.writeObject(to_return);\\r\\n }\\r\\n else {\\r\\n out.write(to_return);\\r\\n }\\r\\n }\\r\\n catch(Exception e){\\r\\n e.printStackTrace();\\r\\n }\\r\\n\\r\\n }\",\n \"@Override\\n public void write(byte[] byteMaze){\\n int rowSize = ((byteMaze[0] & 0xFF) <<8) | (byteMaze[1] & 0xFF);\\n int colSize = ((byteMaze[2] & 0xFF) <<8) | (byteMaze[3] & 0xFF);\\n if (rowSize*colSize>= 170*170) { // Threshold between big and small mazes\\n write(1); //first byte - tells the decompressor which method was used\\n writeBig(byteMaze);\\n }\\n else {\\n write(0);\\n writeSmall(byteMaze);\\n }\\n }\",\n \"public int state_build_regions(HashMap<Integer, Integer> rmap) {\\r\\n\\t\\tUnionFind u=new UnionFind();\\r\\n\\t\\t\\r\\n\\t\\t//build Unionfind\\r\\n\\t\\tfor(Integer nodeIndex:allNodes.keySet()) {\\r\\n\\t\\t\\r\\n\\t\\t\\tLinkedList<Integer> neighborsIndex=nowMap.get(nodeIndex);\\r\\n\\t\\t\\tif(allNodes.get(nodeIndex).path==0) {\\r\\n\\t\\t\\t\\tfor(Integer nIndex:neighborsIndex) {\\r\\n\\t\\t\\t\\t\\tif(allNodes.get(nIndex).path==0)\\r\\n\\t\\t\\t\\t\\t\\tu.union(allNodes.get(nIndex),allNodes.get(nodeIndex));\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t} else if(allNodes.get(nodeIndex).path!=0) {\\r\\n\\t\\t\\t\\tfor(Integer nIndex:neighborsIndex) {\\r\\n\\t\\t\\t\\t\\tif(allNodes.get(nIndex).path!=0)\\r\\n\\t\\t\\t\\t\\t\\tu.union(allNodes.get(nIndex),allNodes.get(nodeIndex));\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tint rcount=1;\\r\\n\\t\\tLinkedList<Node> count=new LinkedList<Node>();\\r\\n\\t\\t//find regions\\r\\n\\t\\tfor(Integer nIndex:allNodes.keySet()) {\\r\\n\\t\\t\\tNode n=allNodes.get(nIndex);\\r\\n\\t\\t\\tNode np=u.find(n);\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tif(np.path==0) {\\r\\n\\t\\t\\t\\tif(count.contains(np)) {\\r\\n\\t\\t\\t\\t\\trmap.put(nIndex, count.indexOf(np)+1);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\telse {\\r\\n\\t\\t\\t\\t\\tcount.add(np);\\r\\n\\t\\t\\t\\t\\trmap.put(nIndex, count.indexOf(np)+1);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}else {\\r\\n\\t\\t\\t\\trmap.put(nIndex, -1);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\r\\n\\t\\treturn rcount;\\r\\n\\t}\",\n \"@Override\\n public void visit(final OpUnion opUnion) {\\n if (LOG.isDebugEnabled()) {\\n LOG.debug(\\\"Starting visiting OpUnion\\\");\\n }\\n final OpRewriter rewriter = new OpRewriter(securityEvaluator, graphIRI);\\n addOp(OpUnion.create(rewriteOp2(opUnion, rewriter), rewriter.getResult()));\\n }\",\n \"static void constructUnionFindDataStructure() {\\n\\n\\t\\t// construct a scanner for an input file\\n\\t\\tScanner scanner = null;\\n\\t\\ttry {\\n\\n\\t\\t\\tscanner = new Scanner(new File(\\\"tinyUF.txt\\\"));\\n\\t\\t} \\n\\t\\tcatch (FileNotFoundException e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t}\\n\\n\\t\\t// read the number of objects from the standard input\\n\\t\\tint n = Integer.parseInt(scanner.nextLine());\\n\\n\\t\\t// initialise a union-find data structure\\n\\t\\tUnionFind unionFind = new UnionFind(n);\\n\\n\\t\\t/* Repeatedly read in pairs of integers (object identifiers). If they are not yet connected, connect them\\n\\t\\t * and print out the pair */\\n\\n\\t\\twhile (scanner.hasNextLine()) {\\n\\n\\t\\t\\t// read integers\\n\\t\\t\\tString pair = scanner.nextLine();\\n\\t\\t\\tString[] objects = pair.split(\\\" \\\");\\n\\t\\t\\tint p = Integer.parseInt(objects[0]);\\n\\t\\t\\tint q = Integer.parseInt(objects[1]);\\n\\n\\t\\t\\t// connect them if not already\\n\\t\\t\\tif (!unionFind.connected(p, q)) {\\n\\n\\t\\t\\t\\tunionFind.union(p, q);\\n\\t\\t\\t\\tSystem.out.println(p + \\\" \\\" + q);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"@Override\\r\\n\\tpublic void mazeSize(Maze3d maze, String name) {\\r\\n\\t\\tString s = \\\"maze size \\\" + name + \\\" is \\\" +(maze.getXSize()*maze.getYSize()*maze.getZSize()*Integer.SIZE)/8+ \\\" bytes\\\";\\r\\n\\t\\tcontroller.printStr(s);\\r\\n\\t}\",\n \"List<CompressResult> decompress(Path input, Path output) throws IOException;\",\n \"void union(int p, int q) {}\",\n \"public static void mergeSortedArrays(final int MEM_SIZE, ArrayList<Integer []> inputChunks, HeapTuple[] minHeap, String outfile, final boolean ENABLE_DEBUG){\\n\\n FileOutputStream out;\\n try{\\n out = new FileOutputStream(outfile);\\n }\\n catch (FileNotFoundException e){\\n System.err.println(e);\\n return;\\n }\\n PrintWriter sortedFiles = new PrintWriter(out, true);\\n\\n int tempLength = 0;\\n FHbinHeap<Integer> heap = new FHbinHeap<>();\\n for (int i = 0; i < inputChunks.size(); i++) {\\n Integer[] temp = inputChunks.get(i).clone();\\n for(int j = 0; j < temp.length; j++){\\n //Integer[] temp = inputChunks.get(i).clone();\\n //System.out.print(temp[j] + \\\",\\\");\\n int hi = temp[j];\\n heap.insert(hi);\\n }\\n tempLength += temp.length;\\n }\\n System.out.println();\\n for(int i = 0; i < tempLength; i++){\\n int removal = heap.remove();\\n System.out.print(removal + \\\",\\\");\\n sortedFiles.print(removal + \\\",\\\");\\n }\\n sortedFiles.close();\\n\\n\\n\\n\\n\\n/* FAILED CODE\\n\\n Due to our sorting of the arrays, the minimum of the entire set must be the minimum of the set of the first element for all chunks\\n By adding an offset to the array whose\\n\\n\\n FHbinHeap<HeapTuple> metaHeap = null;\\n HeapTuple[] heapElement = null;\\n // Probably should just be a FHbinheap\\n for (int i = 0; i < inputChunks.size(); i++) {\\n for (int j = 0; j < MEM_SIZE; i++) {\\n heapElement[i] = new HeapTuple(inputChunks.get(i)[j], i, j);\\n metaHeap.insert(heapElement[i]);\\n System.out.println(metaHeap.remove());\\n //sortedFiles.println(metaHeap.remove());\\n }\\n }\\n\\n*/\\n\\n\\n //First MEM_SIZE minima, no order\\n /*/*\\n int removed = 0;\\n int [] arrayShift = new int[MEM_SIZE];\\n //int innerIndex = 0;\\n\\n int tempLength = 0;\\n\\n int tempMin = 0;\\n int tempMinIndex = 0;\\n FHbinHeap<Integer> heap = new FHbinHeap<>();\\n for (int j = 0; j < 5; j++) {\\n //System.out.println(arrayShift[0] + \\\"ARRAYSHIFT\\\");\\n for (int i = 0; i < inputChunks.size(); i++) {\\n //FHbinHeap<Integer> heap = new FHbinHeap<>();\\n Integer[] temp = inputChunks.get(i).clone();\\n //System.out.println(temp[arrayShift[i]] + \\\",\\\");\\n if (temp[arrayShift[i]] < tempMin) {\\n tempMin = temp[arrayShift[i]];\\n tempMinIndex = i;\\n }\\n\\n\\n for(int j = arrayShift[i]; j < temp.length; j++){\\n //Integer[] temp = inputChunks.get(i).clone();\\n System.out.print(temp[j] + \\\",\\\");\\n //int hi = temp[j];\\n //heap.insert(hi);\\n }\\n\\n tempLength += temp.length;\\n heap.insert(temp[arrayShift[i]]);\\n //System.out.print(temp[arrayShift[i]]+ \\\",\\\");\\n\\n\\n //int heapRemove = heap.remove();\\n if (i == inputChunks.size() - 1) {\\n removed = heap.remove();\\n System.out.println();\\n System.out.println(removed + \\\",MINIMUM\\\");\\n arrayShift[tempMinIndex] = (arrayShift[tempMinIndex] + 1);\\n }\\n\\n }\\n }\\n */\\n\\n\\n\\n\\n }\",\n \"public org.apache.gora.cascading.test.storage.TestRow getUnionRecursive() {\\n return unionRecursive;\\n }\",\n \"protected void siftUp() {\\r\\n\\t\\tint child = theHeap.size() - 1, parent;\\r\\n\\r\\n\\t\\twhile (child > 0) {\\r\\n\\t\\t\\tparent = (child - 1) >> 1;\\t// >> 1 is slightly faster than / 2\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// => parent = (child - 1) / 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\\tchild = parent;\\r\\n\\t\\t}\\r\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7121021","0.5879418","0.525714","0.51427263","0.49897277","0.48941654","0.4886239","0.48763147","0.48193488","0.4782157","0.47429597","0.4720036","0.46830618","0.46753782","0.46351653","0.46336237","0.4584717","0.4567926","0.45206434","0.4518587","0.45183718","0.45079607","0.45076823","0.44435614","0.44372156","0.44358748","0.44346276","0.44254917","0.4423522","0.44178212","0.44129366","0.43958557","0.4392365","0.43913358","0.43766168","0.43552136","0.43231782","0.43169317","0.4315223","0.43055645","0.43037334","0.42825946","0.42643556","0.42627263","0.42625597","0.42610216","0.4245832","0.4245052","0.42338502","0.42297754","0.42290398","0.42197627","0.42027664","0.42019776","0.41992614","0.41965047","0.41920415","0.41917247","0.4187823","0.41844666","0.4165846","0.41593564","0.4151976","0.41515848","0.41424635","0.4138835","0.41373166","0.41333917","0.41260222","0.41210616","0.41136387","0.41048756","0.40928826","0.40897295","0.4089216","0.40794784","0.40686172","0.40678167","0.40575966","0.40547124","0.40546682","0.40520084","0.40504384","0.4050147","0.40301642","0.40262288","0.4016729","0.4013923","0.4010553","0.40062603","0.40024248","0.40008423","0.3990991","0.39893904","0.3985021","0.39835325","0.3980114","0.3980099","0.39795285","0.39713958"],"string":"[\n \"0.7121021\",\n \"0.5879418\",\n \"0.525714\",\n \"0.51427263\",\n \"0.49897277\",\n \"0.48941654\",\n \"0.4886239\",\n \"0.48763147\",\n \"0.48193488\",\n \"0.4782157\",\n \"0.47429597\",\n \"0.4720036\",\n \"0.46830618\",\n \"0.46753782\",\n \"0.46351653\",\n \"0.46336237\",\n \"0.4584717\",\n \"0.4567926\",\n \"0.45206434\",\n \"0.4518587\",\n \"0.45183718\",\n \"0.45079607\",\n \"0.45076823\",\n \"0.44435614\",\n \"0.44372156\",\n \"0.44358748\",\n \"0.44346276\",\n \"0.44254917\",\n \"0.4423522\",\n \"0.44178212\",\n \"0.44129366\",\n \"0.43958557\",\n \"0.4392365\",\n \"0.43913358\",\n \"0.43766168\",\n \"0.43552136\",\n \"0.43231782\",\n \"0.43169317\",\n \"0.4315223\",\n \"0.43055645\",\n \"0.43037334\",\n \"0.42825946\",\n \"0.42643556\",\n \"0.42627263\",\n \"0.42625597\",\n \"0.42610216\",\n \"0.4245832\",\n \"0.4245052\",\n \"0.42338502\",\n \"0.42297754\",\n \"0.42290398\",\n \"0.42197627\",\n \"0.42027664\",\n \"0.42019776\",\n \"0.41992614\",\n \"0.41965047\",\n \"0.41920415\",\n \"0.41917247\",\n \"0.4187823\",\n \"0.41844666\",\n \"0.4165846\",\n \"0.41593564\",\n \"0.4151976\",\n \"0.41515848\",\n \"0.41424635\",\n \"0.4138835\",\n \"0.41373166\",\n \"0.41333917\",\n \"0.41260222\",\n \"0.41210616\",\n \"0.41136387\",\n \"0.41048756\",\n \"0.40928826\",\n \"0.40897295\",\n \"0.4089216\",\n \"0.40794784\",\n \"0.40686172\",\n \"0.40678167\",\n \"0.40575966\",\n \"0.40547124\",\n \"0.40546682\",\n \"0.40520084\",\n \"0.40504384\",\n \"0.4050147\",\n \"0.40301642\",\n \"0.40262288\",\n \"0.4016729\",\n \"0.4013923\",\n \"0.4010553\",\n \"0.40062603\",\n \"0.40024248\",\n \"0.40008423\",\n \"0.3990991\",\n \"0.39893904\",\n \"0.3985021\",\n \"0.39835325\",\n \"0.3980114\",\n \"0.3980099\",\n \"0.39795285\",\n \"0.39713958\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.69499916"},"document_rank":{"kind":"string","value":"1"}}},{"rowIdx":38182,"cells":{"query":{"kind":"string","value":"CODE ADDED FOR LAB 7 METHOD 6: USER SELECTION This method will ask the user how they would like to solve the maze. This will be of type nonreturn."},"document":{"kind":"string","value":"public static void userSelection_SolveMaze(int userInputN){\n\n\t\tint[] S = new int[(int) Math.pow(userInputN, 2)];\n\t\tgNode[] G = new gNode[S.length];\n\n\t\tboolean [] visited = new boolean[S.length];\t\t//Initialize\n\t\tfor(int i=0; i<visited.length;i++)\n\t\t\tvisited[i] = false;\n\n\t\tint [] path = new int[S.length];\t\t//Initialize \n\t\tfor(int i=0; i<path.length; i++)\n\t\t\tpath[i]=-1;\n\n\t\tScanner input = new Scanner(System.in);\n\t\tSystem.out.println(\"How would you like to solve the maze?\\n\"\n\t\t\t\t+ \"1.\\tBreadth-First Search\\n\"\n\t\t\t\t+ \"2.\\tDepth-First Search\\n\"\n\t\t\t\t+ \"3.\\tDepth-First Search with Recursion\");\n\t\t\n\t\tint ur = input.nextInt();\n\t\t\n\t\tif(ur==1)\t//Breadth-First Search\t\t\\///gNode && start @ position 0\n\t\t\tbfs(G, visited, path, 0);\n\t\telse if(ur==2)\t//Depth-First Search\n\t\t\tdfs_Stack(G, visited, path, 0);\n\t\telse if(ur==3)\t//Depth-First Search w/recursion\t\n\t\t\tdfsRecursion(G, visited, path, 0);\t\n\t\telse{\n\t\t\tSystem.out.println(\"Invalid option. Please enter the appropriate integer value\");\n\t\t\tuserSelection_SolveMaze(userInputN);\n\t\t}\n\t\t\n\t\tinput.close();\n\t}"},"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 static void userSelection(){\n\t\tint selection;\n\t\tScanner input = new Scanner(System.in);\n\t\tSystem.out.println(\"Which program would you like to run?\");\n\t\tselection=input.nextInt();\n\n\t\tif(selection == 1)\n\t\t\tmazeUnion();\n\t\tif(selection == 2)\n\t\t\tunionPathCompression();\n\t\tif(selection == 3)\n\t\t\tmazeHeight();\n\t\tif(selection == 4)\n\t\t\tmazeSize();\n\t\tif(selection == 5)\n\t\t\tsizePathCompression();\n\t}","public void showSolveMaze(String message);","public static void main(String[] args) throws Exception {\n\n String[] options=new String[2];\n options[0]=\"Smart\";\n options[1]=\"Dummy\";\n String choice=\"\";\n String availableChars[] = {\"5x5maze.txt\",\"7x7maze.txt\",\"8x8maze.txt\",\"9x9maze.txt\",\"10x10maze.txt\",\"12x12maze.txt\"};\n\n int choiceG = JOptionPane.showOptionDialog(JOptionPane.getRootFrame(),\n \"Would you like to use the smart or dummy solution?\",\n \"Flow Free solver\",0,\n JOptionPane.INFORMATION_MESSAGE,null,options,null\n );\n if(choiceG==0){\n choice = (String) JOptionPane.showInputDialog(JOptionPane.getRootFrame(),\n \"Which puzzle size would you like to solve?\",\n \"Choose puzzle\",\n JOptionPane.PLAIN_MESSAGE,\n null,\n availableChars,\n 2);\n try{\n int[][] numberedMap=loadMap(choice);\n Node[] map=linkNodes(numberedMap);\n height=numberedMap.length;\n width=numberedMap[0].length;\n\n FlowDrawer.getInstance();\n FlowDrawer.setBoard(numberedMap);\n FlowFinder f=new FlowFinder(numberedMap,map,false);\n }\n catch(Exception e){System.out.println(e+\" \"+e.getStackTrace()[0].getLineNumber());}\n }\n else{\n choice = (String) JOptionPane.showInputDialog(JOptionPane.getRootFrame(),\n \"Which puzzle size would you like to solve?\",\n \"Choose puzzle\",\n JOptionPane.PLAIN_MESSAGE,\n null,\n availableChars,\n 2);\n try{\n int[][] numberedMap=loadMap(choice);\n Node[] map=linkNodes(numberedMap);\n height=numberedMap.length;\n width=numberedMap[0].length;\n\n FlowDrawer.getInstance();\n FlowDrawer.setBoard(numberedMap);\n FlowFinder f=new FlowFinder(numberedMap,map,true);\n }\n catch(Exception e){System.out.println(e+\" \"+e.getStackTrace()[0].getLineNumber());}\n }\n\n\n\n }","@Override\n\t\t\tpublic void run() \n\t\t\t{\n\t\t\t\tif(!(mazeCollection.containsKey(paramArray[0])))\n\t\t\t\t{\n\t\t\t\t\tc.passError(\"Maze doesn't exist\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\t/*\n\t\t\t\t//if solution for this maze exists\n\t\t\t\tif(mazeSolutions.containsKey(mazeCollection.get(paramArray[0])))\n\t\t\t\t{\n\t\t\t\t\tc.passSolve(\"Solution for \"+paramArray[0]+ \" is ready\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t*/\n\t\t\t\t\n\t\t\t\tif(paramArray[1].toString().equals(\"bfs\"))\n\t\t\t\t{\n\t\t\t\t\tMazeAdapter ms=new MazeAdapter(mazeCollection.get(paramArray[0]));\n\t\t\t\t\t\n\t\t\t\t\tSearcher<Position> bfs=new BFS<Position>();\n\t\t\t\t\tSolution<Position> sol=bfs.search(ms);\n\t\t\t\t\t\n\t\t\t\t\t//check if solution for the maze already exists, if so, replace it with the new one\n\t\t\t\t\tif(mazeSolutions.containsKey(mazeCollection.get(paramArray[0]))) {\n\t\t\t\t\t\tmazeSolutions.remove(mazeCollection.get(paramArray[0]));\n\t\t\t\t\t\tmazeSolutions.put(mazeCollection.get(paramArray[0]), sol);\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tmazeSolutions.put(mazeCollection.get(paramArray[0]), sol);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tc.passSolve(\"Solution for \"+paramArray[0]+ \" is ready\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\telse if(paramArray[1].toString().equals(\"dfs\"))\n\t\t\t\t{\n\t\t\t\t\tMazeAdapter ms=new MazeAdapter(mazeCollection.get(paramArray[0]));\n\t\t\t\t\t\n\t\t\t\t\tSearcher<Position> dfs=new DFS<Position>();\n\t\t\t\t\tSolution<Position> sol=dfs.search(ms);\n\t\t\t\t\t\n\t\t\t\t\t//check if solution for the maze already exists, if so, replace it with the new one\n\t\t\t\t\tif(mazeSolutions.containsKey(mazeCollection.get(paramArray[0]))) {\n\t\t\t\t\t\tmazeSolutions.remove(mazeCollection.get(paramArray[0]));\n\t\t\t\t\t\tmazeSolutions.put(mazeCollection.get(paramArray[0]), sol);\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tmazeSolutions.put(mazeCollection.get(paramArray[0]), sol);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tc.passSolve(\"Solution for \"+paramArray[0]+ \" is ready\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tc.passError(\"Invalid algorithm\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}","private void solve(int x, int y, boolean draw) {\n \t\t// these are the walls of the maze, maze solver should not go beyond\n \t\t// walls\n \t\t// if (x == 0 || y == 0 || x == N + 1 || y == N + 1) {\n \t\t// return;\n \t\t// }\n \n \t\t// if we have already visited this position\n \t\t// or if deep levels of the recursion have found the target\n \t\tif (foundTarget || visited[x][y])\n \t\t\treturn;\n \n \t\t// this position is new, mark it as visited\n \t\tvisited[x][y] = true;\n \n \t\tif (draw) {\n \t\t\t// Draw a blue dot to show we have been here\n \t\t\tStdDraw.setPenColor(StdDraw.BLUE);\n \t\t\tStdDraw.filledCircle(x + 0.5, y + 0.5, 0.25);\n \t\t\tStdDraw.show(SOLVER_SPEED);\n \t\t}\n \n \t\t// if we have reached the maze solve target\n \t\tif (x == target.x && y == target.y) {\n \t\t\tfoundTarget = true;\n \t\t}\n \n \t\t// Try go another place\n \t\tif (!north[x][y])\n \t\t\tsolve(x, y + 1, draw);\n \t\tif (!east[x][y])\n \t\t\tsolve(x + 1, y, draw);\n \t\tif (!south[x][y])\n \t\t\tsolve(x, y - 1, draw);\n \t\tif (!west[x][y])\n \t\t\tsolve(x - 1, y, draw);\n \n \t\tif (foundTarget)\n \t\t\treturn;\n \n \t\tif (draw) {\n \t\t\t// Draw a grey dot to show we have backtracked\n \t\t\tStdDraw.setPenColor(StdDraw.GRAY);\n \t\t\tStdDraw.filledCircle(x + 0.5, y + 0.5, 0.25);\n \t\t\tStdDraw.show(SOLVER_SPEED);\n \t\t}\n \t}","public void solveMaze() throws MazeException {\n\n long startTime = System.currentTimeMillis();\n List<Maze.Room> solution = path();\n long endTime = System.currentTimeMillis();\n\n double timeToSolve = (endTime - startTime) / 1000.0;\n\n setSolution(Optional.<List<Maze.Room>>of(solution));\n setTimeToSolve(Optional.<Double>of(timeToSolve));\n setSolved(true);\n }","public static void main( String [ ] args )\r\n {\r\n \r\n \t\r\n \t\r\n \tint maze_row=0;\r\n \tint maze_column=0;\r\n \t\r\n\t\t\r\n\t\tScanner type = new Scanner(System.in);\r\n\t\t\r\n\t\t\r\n\t\tdo\r\n\t\t\t{\r\n\t\t\ttry \r\n\t\t\t\r\n\t\t\t{\r\n\t\t\t\tSystem.out.print(\"Please enter number of row between 1 and 20: \");\r\n\t\t\t\tmaze_row = Integer.valueOf(type.next());\r\n\t\t\t}\r\n\t\t\tcatch (NumberFormatException e)\r\n\t\t\t{\r\n\t\t\t\t//System.out.println(\"Input didn't match with the requirement: Try Again\");\r\n\t\t\t\tmaze_row=21;\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t\t}\r\n\t\twhile(maze_row>20 || maze_row<1);\r\n\t\tdo\r\n\t\t{\r\n\t\ttry \r\n\t\t\r\n\t\t{\r\n\t\t\tSystem.out.print(\"Please enter number of column between 1 and 20: \");\r\n\t\t\tmaze_column = Integer.valueOf(type.next());\r\n\t\t}\r\n\t\tcatch (NumberFormatException e)\r\n\t\t{\r\n\t\t\t//System.out.println(\"Input didn't match with the requirement: Try Again\");\r\n\t\t\tmaze_column=21;\r\n\t\t\t\t\r\n\t\t}\r\n\t\t}\r\n\twhile(maze_column>20 ||maze_column<1);\r\n\t\t\r\n\t\ttype.close();\r\n\t\tSystem.out.println();\r\n \tcreateMaze(maze_row,maze_column);\r\n \tshowMaze();\r\n \t\r\n \t\r\n \t\r\n \t\r\n \t\r\n \t\r\n \t\r\n \t\r\n \t/* int NumElements = 128;\r\n int NumInSameSet = 16;\r\n\r\n DisjSets ds = new DisjSets( NumElements );\r\n int set1, set2;\r\n\r\n for( int k = 1; k < NumInSameSet; k *= 2 )\r\n {\r\n for( int j = 0; j + k < NumElements; j += 2 * k )\r\n {\r\n set1 = ds.find( j );\r\n set2 = ds.find( j + k );\r\n ds.union( set1, set2 );\r\n }\r\n }\r\n\r\n for( int i = 0; i < NumElements; i++ )\r\n {\r\n System.out.print( ds.find( i )+ \"*\" );\r\n if( i % NumInSameSet == NumInSameSet - 1 )\r\n System.out.println( );\r\n }\r\n System.out.println( );*/\r\n }","public static void pathMethod (int x, int y, int rows, int columns, int startPointX, int startPointY, int endPointX, int endPointY, String [][]copyArray, String [][]realArray, int decider) throws Exception{ \r\n \r\n String up = copyArray[y-1][x];\r\n String down = copyArray[y+1][x];\r\n String right = copyArray[y][x+1]; //moves the coordinate up one, down one, right one, left one and stores it into up down left right; \r\n String left = copyArray[y][x-1];\r\n \r\n if(up.equals(\"X\")||down.equals(\"X\")||right.equals(\"X\")||left.equals(\"X\")){ //if up right left or down is equal to the endpoint, the maze is solvable, and we can now print the final array\r\n System.out.println(\"\\nThe maze is solvable!\");\r\n// printFinalArray(realArray, counter, xvalues, yvalues); //solution is found already - sends back to another method to print final solution\r\n regenerate(decider); //then sends to regenerate method where it asks if user would like to create another maze\r\n }\r\n \r\n else if(copyArray[startPointY+1][startPointX].equals(\"B\")&©Array[startPointY-1][startPointX].equals(\"B\")&©Array[startPointY][startPointX+1].equals(\"B\")&©Array[startPointY][startPointX-1].equals(\"B\")){\r\n \r\n System.out.println(\"\\nSorry, your maze is unsolvable.\\n\\n\"); //if at the start point we cannot go up down left or right - no possible moves - not solvable - end of maze \r\n regenerate(decider); //call the method that gives users the option to recreate the maze if it was unsolvable \r\n } \r\n \r\n else if(up.equals(\"O\")){ //if the coordinate in the up direction is O\r\n counter=counter+1; //incrementing counter so we can input it the coordinate arrays\r\n copyArray[y][x] = \"V\"; //changing the values to 'V' so we can know that we already visited it\r\n y=y-1; //moving coordinate up one \r\n xvalues[counter]=x; //storing this coordinate into the arrays with the counter\r\n yvalues[counter]=y;\r\n pathMethod(x, y, rows, columns, startPointX, startPointY, endPointX, endPointY, copyArray, realArray, decider); //recalling method\r\n }\r\n \r\n else if(down.equals(\"O\")){ //if down = O\r\n copyArray[y][x] = \"V\";\r\n counter=counter+1;\r\n y=y+1; \r\n xvalues[counter]=x;\r\n yvalues[counter]=y;\r\n pathMethod(x, y, rows, columns, startPointX, startPointY, endPointX, endPointY, copyArray, realArray, decider);\r\n }\r\n \r\n else if(right.equals(\"O\")){ //if right equals O\r\n copyArray[y][x] = \"V\";\r\n counter=counter+1;\r\n x=x+1;\r\n xvalues[counter]=x;\r\n yvalues[counter]=y;\r\n pathMethod(x, y, rows, columns, startPointX, startPointY, endPointX, endPointY, copyArray, realArray, decider);\r\n }\r\n \r\n else if(left.equals(\"O\")){ //if left equals O\r\n copyArray[y][x] = \"V\";\r\n counter=counter+1;\r\n x=x-1;\r\n xvalues[counter]=x;\r\n yvalues[counter]=y;\r\n pathMethod(x, y, rows, columns, startPointX, startPointY, endPointX, endPointY, copyArray, realArray, decider);\r\n }\r\n \r\n else { //if neither up down left or right work\r\n for(int i = 0; i<rows; i++){ //makes all the 'V's go back to O\r\n for(int j = 0; j<columns; j++){\r\n if(copyArray[i][j].equals(\"V\")){\r\n copyArray[i][j] = \"O\";\r\n }\r\n }\r\n }\r\n copyArray[y][x] = \"B\"; //make the coordinate that you cant make a move with B, so it shortens the possible path options\r\n for(int i = 0 ; i<counter; i++){\r\n xvalues[i] = 0; //resets the coordinate arrays back to 0\r\n yvalues[i] = 0;\r\n }\r\n counter=0; //resets counter back to 0;\r\n pathMethod(startPointX, startPointY, rows, columns, startPointX, startPointY, endPointX, endPointY, copyArray, realArray, decider); //resends the startpoints instead of x and y; only thing different is that one coordinate is now marked \"B\"\r\n } \r\n }","static void Door2challenge() {\n System.out.println(\"Ready! 3...2...1...GO!\");\n System.out.println(\"Where do you want to go? Left, Right, or Straight\");\n direction = next.nextLine();\n //this is where the player will decide where to go\n //the rest of the maze will branch off from this decision. These choices will have the same outcome.\n \n if(direction.contains(\"left\")) {\n door2challenge_leftpath();\n //player enters the left branch maze\n \n }else if(direction.contains(\"right\")){\n door2challenge_rightpath();\n //player enters the right branch of the maze\n \n }else if(direction.contains(\"straight\")){\n door2challenge_straightpath();\n //player enters the straight branch of the maze\n }else{\n System.out.println(\"I don't understand...type it correctly!!!\");\n Door2challenge();\n }\n \n }","public boolean solveMaze(int x, int y, String direction){\n\n if (maze[x][y] == \"E\"){\n solved = true;\n return solved;\n\n }\n\n if(!(maze[x][y].equals(\"S\") || maze[x][y].equals(\"E\"))){\n maze[x][y] = \"X\";\n }\n\n if(direction != \"up\" && isReachable(x+1, y)){\n solveMaze(x + 1, y, \"down\");\n if(solved) return true;\n }\n if(direction != \"left\" && isReachable(x, y+ 1)){\n solveMaze(x, y + 1, \"right\");\n if(solved) return true;\n }\n if(direction != \"down\" && isReachable(x-1, y)){\n solveMaze(x - 1 , y, \"up\");\n if(solved) return true;\n }\n if(direction != \"right\" && isReachable(x, y -1)){\n solveMaze(x, y - 1, \"left\");\n if(solved) return true;\n }\n\n //If cannot move, do backtracking\n if(!solved) {\n maze[x][y] = \" \";\n return false;\n }\n\n return false;\n }","public boolean solve(final int startRow, final int startCol) {\r\n\r\n // TODO\r\n // validate arguments: ensure position is within maze area\r\n\r\n if(mazeData [startRow][startCol] == WALL) {\r\n throw new IllegalArgumentException(\" we're in a wall buddy\");\r\n }\r\n else if (startRow > mazeData.length-1 || startCol > mazeData.length-1 ){\r\n throw new IllegalArgumentException(\" we're out of bounds \");\r\n }\r\n\r\n\r\n\r\n\r\n\r\n // TODO create local class for row/col positions\r\n class Position {\r\n private int row;\r\n private int col;\r\n\r\n // TODO add instance variables\r\n public Position(final int row, final int col) {\r\n this.row = row;\r\n this.col= col;\r\n }\r\n\r\n\r\n\r\n // TODO toString if desired\r\n public String toString() {\r\n return \"Row: \" + this.row + \"Column: \"+ this.col;\r\n }\r\n\r\n\r\n }\r\n\r\n\r\n // define the stack (work queue)\r\n final var queue = Collections.asLifoQueue(new LinkedList<Position>());\r\n //Queue<Position> queue = new LinkedList<Position>(); // EXTRA CREDIT PART 2\r\n\r\n // put starting position in queue\r\n queue.add(new Position(startRow, startCol));\r\n\r\n\r\n\r\n\r\n\r\n // look for a way out of the maze from the current position\r\n while (!queue.isEmpty()) {\r\n\r\n\r\n final Position pos = queue.remove();\r\n\r\n // if this is a wall, then ignore this position (and skip the remaining steps of the loop body)\r\n if (mazeData [pos.row][pos.col]== WALL){\r\n continue; // jumps to next spot in que , by skipping to next iteration of loops by saying continue\r\n }\r\n\r\n\r\n // otherwise mark this place as visited (drop a breadcrumb)\r\n if (mazeData [pos.row][pos.col]== VISITED){\r\n continue; // jumps to next spot in que , by skipping to next iteration of loops by saying continue\r\n }\r\n else if(mazeData [pos.row][pos.col]== EMPTY){\r\n mazeData [pos.row][pos.col]= VISITED;\r\n }\r\n\r\n // if we're already on the perimeter, then this is a way out and we should return success (true) right away\r\n if (pos.row == 0|| pos.col ==0 || pos.row == mazeData.length-1 || pos.col == mazeData[0].length-1){\r\n mazeData[startRow][startCol] = START;\r\n return true;\r\n }\r\n\r\n queue.add(new Position(pos.row+1,pos.col ));//down\r\n queue.add(new Position(pos.row-1,pos.col ));//up\r\n queue.add(new Position(pos.row,pos.col-1 )); //left\r\n queue.add(new Position(pos.row, pos.col + 1)); //right\r\n\r\n\r\n }//end of while\r\n\r\n\r\n\r\n // mark starting position\r\n mazeData[startRow][startCol] = START;\r\n\r\n // if we've looked everywhere but haven't gotten out, then return failure (false)\r\n return false;\r\n }","public void generateSolution() {\n if (this.stateOfTheMaze != 1)\n throw new IllegalArgumentException(\"To generate the maze the state of it must be \\\"generated maze\\\".\");\n Queue<Box> queue = new LinkedList<>();\n queue.add(this.startBox);\n boolean notFinished = true;\n while (notFinished) {\n Box aux = queue.peek();\n LinkedList<Box> movements = movementWithWalls(aux);\n movements.remove(aux.getPrevious());\n for (Box box : movements) {\n box.setPrevious(aux);\n queue.add(box);\n if (box.equals(this.endBox))\n notFinished = false;\n }\n queue.remove();\n }\n Box anotherAux = this.endBox;\n while (!anotherAux.equals(this.startBox)) {\n anotherAux.setAsSolution();\n anotherAux = anotherAux.getPrevious();\n }\n this.stateOfTheMaze++;\n }","public void solveMaze( int x0, int y0, int x1, int y1 ) {\n visited = new boolean[rows+1][cols+1];\n solve(x0, y0, x1, y1);\n }","@Override\n public void onNothingSelected(AdapterView<?> parent) {\n currentMazeChoice = \"Simple\";\n }","private int solve(int r, int c, int result){\n if(animate){\n\n clearTerminal();\n System.out.println(this);\n\n wait(150);\n }\n\n //COMPLETE SOLVE\n if (maze[r][c] == 'E'){\n return result;\n } else {\n maze[r][c] = '@';\n }\n for (int i = 0; i < moves.length; i++){\n int rowI = moves[i].x;\n int colI = moves[i].y;\n if (maze[r + rowI][c + colI] == ' ' || maze[r + rowI][c + colI] == 'E'){\n int solvler = solve(r + rowI, c + colI, result + 1);\n if (solvler != -1){\n return solvler;\n }\n }\n }\n maze[r][c] = '.';\n return -1; //so it compiles\n }","public boolean solveMaze(char[][] maze, int row, int col) {\n if (row < 0 || row >= maze.length) {\r\n return false;\r\n }\r\n // Not even in the maze\r\n if (col < 0 || col >= maze.length) {\r\n return false;\r\n }\r\n // Can't move to this spot(Hit a wall and hit a spot that it has already been to)\r\n if (maze[row][col] == 'X' || maze[row][col] == '+') {\r\n return false;\r\n }\r\n // Winning condition: Found the exit\r\n if (maze[row][col] == 'E') {\r\n // Found the exit\r\n return true;\r\n }\r\n\r\n // Mark spot as visited\r\n maze[row][col] = '+';\r\n // Try north\r\n // Try path with new row, if successful, then it is done\r\n if (solveMaze(maze, row - 1, col)) {\r\n return true;\r\n }\r\n\r\n // Try east\r\n if (solveMaze(maze, row, col + 1)) {\r\n return true;\r\n }\r\n\r\n // Try south\r\n if (solveMaze(maze, row + 1, col)) {\r\n return true;\r\n }\r\n\r\n // Try west\r\n if (solveMaze(maze, row, col - 1)) {\r\n return true;\r\n }\r\n\r\n // Tried every direction = NO GOOD!\r\n // \"Unvisit\" the spot\r\n maze[row][col] = '.';\r\n return false;\r\n\r\n }","@Override\r\n\tpublic void solveMaze(String[] args, Maze3d maze) {\r\n\t\tthreadpool.execute(new Runnable() {\r\n\t\t\t\r\n\t\t\t@Override\r\n\t\t\tpublic void run() {\r\n\t\t\t\tSearchable<Position> s = new Maze3dDomain(maze);\r\n\t\t\t\tif(args.length>=3 && args.length<5)\r\n\t\t\t\t{\r\n\t\t\t\t\tif(args[2].equals(\"BFS\")==true)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tBFS<Position> solve = new BFS<Position>(new StateCostComparator<Position>());\r\n\t\t\t\t\t\tcontroller.setSolution(solve.search(s).getSol(),args[1]);\r\n\t\t\t\t\t\tcontroller.printStr(\"solution for \" +args[1]+ \" is ready\");\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse\r\n\t\t\t\t\t\tcontroller.printStr(\"Algorithm is not exist\");\r\n\t\t\t\t}\r\n\t\t\t\telse if(args.length>=5)\r\n\t\t\t\t{\r\n\t\t\t\t\tif((args[2]+\" \"+args[3]+\" \"+args[4]).equals(\"Astar Air Distance\")==true)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tBFS<Position> solve = new Astar<Position>(new StateCostComparator<Position>(),new MazeAirDistance(s));\r\n\t\t\t\t\t\tcontroller.setSolution(solve.search(s).getSol(),args[1]);\r\n\t\t\t\t\t\tcontroller.printStr(\"solution for \" +args[1]+ \" is ready\");\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse if((args[2]+\" \"+args[3]+\" \"+args[4]).equals(\"Astar Manhattan Distance\")==true)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tBFS<Position> solve = new Astar<Position>(new StateCostComparator<Position>(),new MazeManhattanDistance(s));\r\n\t\t\t\t\t\tcontroller.setSolution(solve.search(s).getSol(),args[1]);\r\n\t\t\t\t\t\tcontroller.printStr(\"solution for \" +args[1]+ \" is ready\");\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse\r\n\t\t\t\t\t\tcontroller.printStr(\"Algorithm is not exist\");\r\n\t\t\t\t}\r\n\t\t\t\telse\r\n\t\t\t\t\tcontroller.printStr(\"Algorithm is not exist\");\r\n\t\t\t}\r\n\t\t});\r\n\t}","public static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tQueue<maze> q = new LinkedList<>();\n\t\tint N = scan.nextInt();\n\t\tint M = scan.nextInt();\n\t\tint output = 0;\n\t\tscan.nextLine();\n\t\tint arr[][] = new int[N][M];\n\t\tint isVisit[][] = new int[N][M];\n\t\tisVisit[0][0] = 1;\n\t\tfor(int i=0;i<N;i++)\n\t\t{\n\t\t\tString line = scan.nextLine();\n\t\t\tfor(int j=0;j<M;j++)\n\t\t\t{\n\t\t\t\tarr[i][j] = line.charAt(j) - '0';\n\t\t\t}\n\t\t}\n\t\tq.add(new maze(0, 0, 1));\n\t\twhile(!q.isEmpty())\n\t\t{\n\t\t\tmaze temp = q.poll();\n\t\t\tif(temp.x == M-1 && temp.y == N-1)\n\t\t\t{\n\t\t\t\toutput = temp.block;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tfor(int i=0;i<4;i++)\n\t\t\t{\n\t\t\t\tint x = temp.x + dx[i];\n\t\t\t\tint y = temp.y + dy[i];\n\t\t\t\t\n\t\t\t\tif(0 <= x && x < M && 0 <= y && y < N && arr[y][x] == 1 && isVisit[y][x] == 0)\n\t\t\t\t{\n\t\t\t\t\tq.add(new maze(x, y, (temp.block + 1)));\n\t\t\t\t\tisVisit[y][x] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(output);\n\t}","public void testSolve1() {\n test = new Location(0, 1);\n maze2.setCell(test, MazeCell.WALL);\n test = new Location(1, 1);\n maze2.setStartLocation(test);\n test = new Location(0, 0);\n maze2.setGoalLocation(test);\n assertEquals(\"(0, 0) (1, 0) (1, 1) \", maze2.solve());\n }","@Override\r\n public void solve(String[] arr) {\r\n\tString nameAlg = arr[arr.length - 1];\r\n\tsb = new StringBuilder();\r\n\tfor (int i = 1; i < arr.length - 1; i++) {\r\n\t sb.append(arr[i]);\r\n\t}\r\n\tString name = sb.toString();\r\n\tMaze3d tempMaze = hMaze.get(name);\r\n\tif ((hSol.get(tempMaze)) != null) {\r\n\t setChanged();\r\n\t notifyObservers((\"solution:\" + name).split(\":\"));\r\n\t}\r\n\tFuture<Solution<Position>> fCallSolution = threadpool.submit(new Callable<Solution<Position>>() {\r\n\r\n\t @Override\r\n\t public Solution<Position> call() throws Exception {\r\n\r\n\t\tMaze3d m = hMaze.get(name);\r\n\t\tSearchableMaze sMaze = new SearchableMaze(m);\r\n\t\tCommonSearcher<Position> cs;\r\n\t\tSolution<Position> s = new Solution<Position>();\r\n\t\tswitch (nameAlg) {\r\n\t\tcase \"Astar\":\r\n\t\t cs = new AStar<Position>(new MazeManhattenDistance());\r\n\t\t s = cs.search(sMaze);\r\n\t\t break;\r\n\t\tcase \"A*\":\r\n\t\t cs = new AStar<Position>(new MazeManhattenDistance());\r\n\t\t s = cs.search(sMaze);\r\n\t\t break;\r\n\t\tcase \"BFS\":\r\n\t\t cs = new BFS<Position>();\r\n\t\t s = cs.search(sMaze);\r\n\t\t break;\r\n\t\t}\r\n\t\treturn s;\r\n\t }\r\n\t});\r\n\ttry {\r\n\t hSol.put(tempMaze, fCallSolution.get());\r\n\t} catch (InterruptedException | ExecutionException e) {\r\n\t // TODO Auto-generated catch block\r\n\t e.printStackTrace();\r\n\t}\r\n\tsetChanged();\r\n\tnotifyObservers((\"solution:\" + name).split(\":\"));\r\n }","Maze makeMaze();","public static void pathMenu() {\n boolean quit = false;\n do {\n System.out.println(\"==================================================\");\n System.out.println(\"Building Path Menu\");\n System.out.println(\"==================================================\");\n System.out.println();\n System.out.println(\"Please Make a selection:\");\n System.out.println(\"[1] Standard\");\n System.out.println(\"[2] Reduce Double Edges\");\n System.out.println(\"[3] Reduce Double Edges & use LSI Weights\");\n System.out.println(\"[0] back\");\n System.out.print(\"Selection: \");\n int menu = scan.nextInt();\n String name, filename;\n double w;\n int limit;\n switch (menu) {\n case 1:\n System.out.print(\"Name: \");\n name = scan.next();\n System.out.print(\"Filename: \");\n filename = scan.next();\n System.out.print(\"W: \");\n w = scan.nextDouble();\n System.out.print(\"Open List Limit: \");\n limit = scan.nextInt();\n try {\n Application.findPath(filename, name, w, limit, true, true, false);\n } catch (Exception e) {\n System.out.println(\"Error running A-Star: \" + e.getMessage());\n }\n break;\n case 2:\n System.out.print(\"Name: \");\n name = scan.next();\n System.out.print(\"Filename: \");\n filename = scan.next();\n System.out.print(\"W: \");\n w = scan.nextDouble();\n System.out.print(\"Open List Limit: \");\n limit = scan.nextInt();\n try {\n Application.findPath(filename, name, w, limit, true, true, false);\n } catch (Exception e) {\n System.out.println(\"Error running A-Star: \" + e.getMessage());\n }\n break;\n case 3:\n System.out.print(\"Name: \");\n name = scan.next();\n System.out.print(\"Filename: \");\n filename = scan.next();\n System.out.print(\"W: \");\n w = scan.nextDouble();\n System.out.print(\"Open List Limit: \");\n limit = scan.nextInt();\n try {\n Application.findPath(filename, name, w, limit, true, true, true);\n } catch (Exception e) {\n System.out.println(\"Error running A-Star: \" + e.getMessage());\n }\n break;\n case 0:\n quit = true;\n break;\n default:\n System.out.println(\"Invalid Entry!\");\n }\n }\n while (!quit);\n }","public static void main (String[] args) {\n\n Maze labyrinth = new Maze();\n \n labyrinth.print_maze();\n\n if (labyrinth.solve(0, 0)) {\n \t System.out.println (\"Maze solved!\");\n \t labyrinth.print_maze();\n \t }\n else\n System.out.println (\"No solution.\");\n\n }","public void makeMove(){\n System.out.println(\"Player choose x or o.\");\n String chose = keyword.nextLine();\n int row;\n int column;\n if (chose.equals(\"x\")){\n System.out.println(\"Type coordenates for first move.\");\n System.out.println(\"Type row.\");\n row = keyword.nextInt();\n System.out.println(\"Type column.\");\n column = keyword.nextInt();\n getBoard(row, column, \"x\");\n }\n else if (chose.equals(\"o\")){\n System.out.println(\"Type coordenates for first move.\");\n System.out.println(\"Type row.\");\n row = keyword.nextInt();\n System.out.println(\"Type column.\");\n column = keyword.nextInt();\n getBoard(row, column, \"o\");\n }\n }","public static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tint m = sc.nextInt();\n\t\tint n = sc.nextInt();\n char [] [] maze = new char[m][n];\n for(int i=0; i<m; i++) {\n \t String str = sc.next();\n \t for(int j=0; j<str.length(); j++) {\n \t\t maze[i][j]=str.charAt(j);\n \t }\n }\n int [][] ans = new int [m][n];\n blocked_Maze_path(maze, 0, 0, n-1, m-1,ans );\n \n\t}","public boolean setPosition(){\n\n while(true){\n System.out.println(\"Enter Line: \");\n line = scanner.nextInt();\n System.out.println(\"Enter Column: \");\n column = scanner.nextInt();\n\n if(line>0 && line<9 && column>0 && column<9){\n if(boardgame[line][column]!='_')\n System.out.println(\"cell already selected\");\n else \n break;\n }else{\n System.out.println(\"Choose a number between 1 and 8\");\n }\n }\n if(getPosition(line, column)==-1)\n return true;\n else \n return false;\n }","public static void main(String[] args) {\n char [][] strtMaze = new char[][]{\n {'#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#'},\n {'#', '.', '.', '.', '#', '.', '.', '.', '.', '.', '.', '#'},\n {'.', '.', '#', '.', '#', '.', '#', '#', '#', '#', '.', '#'},\n {'#', '#', '#', '.', '#', '.', '.', '.', '.', '#', '.', '#'},\n {'#', '.', '.', '.', '.', '#', '#', '#', '.', '#', '.', '#'},\n {'#', '#', '#', '#', '.', '#', 'F', '#', '.', '#', '.', '#'},\n {'#', '.', '.', '#', '.', '#', '.', '#', '.', '#', '.', '#'},\n {'#', '#', '.', '#', '.', '#', '.', '#', '.', '#', '.', '#'},\n {'#', '.', '.', '.', '.', '.', '.', '.', '.', '#', '.', '#'},\n {'#', '#', '#', '#', '#', '#', '.', '#', '#', '#', '.', '#'},\n {'#', '.', '.', '.', '.', '.', '.', '#', '.', '.', '.', '#'},\n {'#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#'},\n };\n //Get start position of person\n int pstartx = 2;\n int pstarty = 0;\n //Get start position of hand\n int hstartx = 3; //If same as pstart(facing north south)\n int hstarty = 0;//If same as pstart (facing east west)\n RecursionOutLab maze1 = new RecursionOutLab();\n maze1.maze(strtMaze, pstartx, pstarty, hstartx, hstarty);\n }","public static void solveMaze(String inputFile, String outputFile) \r\n\t{\t\r\n\t\t\r\n\t\tif(new File(inputFile).isFile() == false)\r\n\t\t{\r\n\t\t\ttry {\r\n\t\t\t\tthrow new FileNotFoundException();\r\n\t\t\t} catch (FileNotFoundException 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}\r\n\t\t\r\n\t\t//Gets the dimensions to assign to the 2d String array size\r\n\t\tString[][] Dimensions = getDimensions(inputFile);\r\n\t\t\r\n\t\t//Gets each row and column character of the maze file and adds it the 2d String array\r\n\t\tString[][] Map = getMap(inputFile, Dimensions);\r\n\t\t\r\n\t\tint startRow = 0;\r\n\t\tint startColumn = 0;\t\t\r\n\t\t\r\n\t\t\r\n\t\t//This finds the Starting values, startRow and startColumn\r\n\t\tfor(int i = 0; i < Map.length; i++)\r\n\t\t{\r\n\t\t\tfor(int j = 0; j < Map[0].length; j++)\r\n\t\t\t{\r\n\t\t\t\tString check = Map[i][j];\r\n\t\t\t\tif (check.compareTo(\"S\") == 0)\r\n\t\t\t\t{\r\n\t\t\t\t\tstartRow = i;\r\n\t\t\t\t\tstartColumn = j;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\t//This sends the startRow, startColumn, 2d String array named Map (which contains all the coordinates), \r\n\t\t//and the output and input file names to getPath. \r\n\t\tSystem.out.println(getPath(startRow, startColumn, Map, outputFile, inputFile));\t\t\r\n\t}","@Override\r\n public void solveMaze() {\r\n threadPool.execute(() -> {\r\n maze.setStartPotision(new Position(PlayerPositionRow,PlayerPositionCol));\r\n try {\r\n Client client = new Client(InetAddress.getLocalHost(), 5401, new IClientStrategy() {\r\n public void clientStrategy(InputStream inFromServer, OutputStream outToServer) {\r\n try {\r\n ObjectOutputStream toServer = new ObjectOutputStream(outToServer);\r\n ObjectInputStream fromServer = new ObjectInputStream(inFromServer);\r\n toServer.flush();\r\n toServer.writeObject(maze);\r\n toServer.flush();\r\n s = (Solution) fromServer.readObject();\r\n } catch (Exception var10) {\r\n var10.printStackTrace();\r\n }\r\n\r\n }\r\n });\r\n client.communicateWithServer();\r\n try {\r\n Thread.sleep(5000);\r\n } catch (InterruptedException e) {\r\n e.printStackTrace();\r\n }\r\n } catch (Exception e) {\r\n e.printStackTrace();\r\n }\r\n setChanged();\r\n notifyObservers(\"solve\");\r\n });\r\n }","public abstract String promptSelectionFromAnswers(final String question, final List<String> answers) throws JVMIOException;","public void solve() {\n // TODO\n // This function should use next. You should also create and use any\n // other helper fuctions you find helpful here.\n \t// get start position \t\n \tSquare s = sea.getStart();\n \texploreList.add(s);\n \twhile(this.exploreList.size() != 0) {\n \t\tSquare c = step();\n \t\tif(c.hasNemo()) {\n \t\t\tsetPath(c);\n \t\t\tfoundNemo = true;\n \t\t\tbreak;\n \t\t}\n \t}\n }","public boolean myChoice(int row, int column);","protected boolean solve(int currentRow, int currentColumn) {\n \tint currentBlock = m.maze[currentRow][currentColumn];\t\t\t\t\t\t\t// get the current block that we are on\r\n \t\r\n if (m.isBlockEmpty(currentBlock)) {\t\t\t\t\t\t\t\t\t\t\t\t// make sure current block is empty\r\n \tm.maze[currentRow][currentColumn] = 2; \t\t\t\t\t\t\t\t// add this block to the path as a potential solution\r\n repaint();\r\n \r\n m.blocksTraversed++;\t\t\t\t\t\t\t\t\t\t\t\t\t\t// keep track of how many blocks were traversed over\r\n \r\n if (currentRow == m.rows-2 && currentColumn == m.columns-2) {\t\t\t\t// current block is bottom right, path has been found\r\n \tGUI.ta.append(m.blocksTraversed + \" blocks were traversed while solving the maze.\\n\");\r\n \tdouble percentage = (((double) m.blocksTraversed / (m.rows * m.columns))*100) * 2;\r\n DecimalFormat f = new DecimalFormat(\"##.00\");\r\n \tGUI.ta.append(\"This results in \" + f.format(percentage) + \"% of the maze being traveled.\\n\");\r\n \treturn true;\r\n }\r\n \r\n try { Thread.sleep(1); }\r\n catch (InterruptedException e) { }\r\n \r\n int topBlock = currentRow - 1;\t\t\t\t\t\t\t\t\t\t\t\t// block directly above the current block\r\n int leftBlock = currentColumn - 1;\t\t\t\t\t\t\t\t\t\t\t// block directly left of the current block\r\n int bottomBlock = currentRow + 1;\t\t\t\t\t\t\t\t\t\t\t// block directly below the current block\r\n int rightBlock = currentColumn + 1;\t\t\t\t\t\t\t\t\t\t\t// block directly right of the current block\r\n \r\n if (solve(topBlock, currentColumn) || solve(currentRow, leftBlock) ||\t\t// a solution was found\r\n \tsolve(bottomBlock, currentColumn) || solve(currentRow, rightBlock))\r\n \treturn true;\r\n \r\n m.maze[currentRow][currentColumn] = 4; \t\t\t\t\t\t\t\t\t// no solution from current block so make the block visited instead\r\n repaint();\r\n \r\n synchronized(this) {\r\n try { wait(1); }\r\n catch (InterruptedException e) { }\r\n }\r\n }\r\n return false;\r\n }","@Override\n public final void solve() {\n this.flag1 = this.neo.getPosition().equals(this.goal);\n \n }","private static boolean solution(int[][] arr, int[][] mazeTravel, int row, int column) {\n\n int size = arr.length;\n\n if (row < 0 || row >= size || column < 0 || column >= size || arr[row][column] == 0 || mazeTravel[row][column] == 1 ) {\n return false;\n }\n //Mark position as travelled\n mazeTravel[row][column] = 1;\n //Check if reached destination\n if(row== arr.length-1&&column== arr.length-1){\n return true;\n }\n //Top direction\n if (solution(arr, mazeTravel, row - 1, column) ) {\n return true;\n }\n //Right direction\n if (solution(arr, mazeTravel, row, column + 1)) {\n return true;\n }\n\n //Left direction\n if (solution(arr, mazeTravel, row, column - 1)) {\n return true;\n }\n\n //Down direction\n if (solution(arr, mazeTravel, row + 1, column)) {\n return true;\n }\n //Above 4 Conditions not satisfied\n return false;\n }","public boolean solve (int row, int column) {\n\n boolean done = false;\n \n if (valid (row, column)) {\n\n grid[row][column] = 3; // cell has been tried\n\n if (row == grid.length-1 && column == grid[0].length-1)\n done = true; // maze is solved\n else {\n done = solve (row+1, column); // down\n if (!done)\n done = solve (row, column+1); // right\n if (!done)\n done = solve (row-1, column); // up\n if (!done)\n done = solve (row, column-1); // left\n }\n if (done) // part of the final path\n grid[row][column] = 7;\n }\n \n return done;\n\n }","public void actionPerformed(ActionEvent ae) {\r\n if(ae.getSource()==openMazefile){\r\n JFileChooser j = new JFileChooser(FileSystemView.getFileSystemView().getHomeDirectory());\r\n FileNameExtensionFilter filter = new FileNameExtensionFilter(\"TEXT FILES\", \"txt\", \"text\");\r\n j.setFileFilter(filter);\r\n // invoke the showsOpenDialog function to show the save dialog\r\n int r = j.showOpenDialog(null);\r\n\r\n // if the user selects a file\r\n if (r == JFileChooser.APPROVE_OPTION)\r\n {\r\n File inputFile=j.getSelectedFile();\r\n mazePanel.readMaze(inputFile);\r\n solveMaze.setEnabled(true);\r\n }\r\n }\r\n else if (ae.getSource() == solveMaze){\r\n mazePanel.solveMaze();\r\n solveMaze.setEnabled(false);\r\n clearSolution.setEnabled(true);\r\n }\r\n else if (ae.getSource() == clearSolution){\r\n mazePanel.clearMazePath();\r\n solveMaze.setEnabled(true);\r\n clearSolution.setEnabled(false);\r\n }\r\n\r\n }","public void select() {\n \t\t\tString sinput = \"\";\r\n \t\t\tOption selected = null;\r\n \t\t\tErrorLog.debug(name + \" selected.\");\r\n \t\t\t\r\n \t\t\twhile (true) {\r\n \t\t\t\tSystem.out.println(toString()); //Print menu.\r\n \t\t\t\tsinput = read(); //Get user selection.\r\n \t\t\t\tif (!sinput.equalsIgnoreCase(\"exit\")) {\r\n \t\t\t\t\tselected = options.get(sinput); //Find corresponding option.\r\n \r\n \t\t\t\t\tif (selected != null) //Sinput corresponds to an extant option.\r\n \t\t\t\t\t\tselected.select(); //Select the selected.\r\n \t\t\t\t\telse\r\n \t\t\t\t\t\tprint(sinput + \" is not a valid option\");\r\n \t\t\t\t} else\r\n \t\t\t\t\t{print(\"Returning to previous menu.\"); break;}\r\n \t\t\t}\r\n \t\t\t\r\n \t\t\tErrorLog.debug (\"Quitting \" + name + \". Sinput:\"+sinput);\r\n \t\t\t\r\n \t\t\treturn;\r\n \t\t}","public char[][] mazeTraversal(char[][] maze, int x, int y){\n\n // Using the try catch to find the 'end' of the maze. Or when the maze hits the bounds of the char array.\n try{\n // this will test all valid moves. If they are valid, it replaces the current position with 'x' and moves\n // the cursor 'A' to the next position. Prints maze and recursively calls mazeTraversal.\n\n // if down is a valid move\n if(maze[x][y-1] == '.'){\n maze[x][y] = 'x';\n maze[x][y-1] = 'A';\n print(maze);\n mazeTraversal(maze, x, y-1);\n }\n\n // if right is a valid move\n if(maze[x+1][y] == '.'){\n maze[x][y] = 'x';\n maze[x+1][y] = 'A';\n print(maze);\n mazeTraversal(maze, x+1, y);\n }\n\n // if up is a valid move\n if(maze[x][y+1] == '.'){\n maze[x][y] = 'x';\n maze[x][y+1] = 'A';\n print(maze);\n mazeTraversal(maze, x, y+1);\n }\n\n // if left is a valid move\n if(maze[x-1][y] == '.'){\n maze[x][y] = 'x';\n maze[x-1][y] = 'A';\n print(maze);\n mazeTraversal(maze, x-1, y);\n }\n\n // if no moves are available or the cursor approaches a dead end, the current position is replaced with '0'\n // and prints the maze again. This will remove the cursor until a next valid move is available.\n // Returns the current maze.\n maze[x][y] = '0';\n print(maze);\n return maze;\n }catch(Exception e){\n // If the maze approaches the 'end' of the maze, or approaches a point where the cursor is at the bounds,\n // then the catch will initiate. Assuming the maze is done. Ending the program.\n System.out.println(\"The Maze is traversed. Thank you for playing.\");\n maze[x][y] = 'x';\n print(maze);\n System.exit(0);\n }\n return maze;\n }","public IAnswer select() throws NoPossibleAnswersException;","public void findTour( int x, int y, int moves )\n {\n delay(50); //slow it down enough to be followable\n if (solved) System.exit(0);\n\n //primary base case: tour completed\n if (moves == (sideLength * sideLength)) {\n solved = true;\n }\n //other base case: stepped off board or onto visited cell\n if ( board[x][y] != 0 ) {\n return;\n }\n //otherwise, mark current location\n //and recursively generate tour possibilities from current pos\n else {\n board[x][y] = moves;\n System.out.println(this);\n delay(10); //uncomment to slow down enough to view\n\n /*======================================\n Recursively try to solve (find tour) from\n each of knight's available moves.\n . e . d .\n f . . . c\n . . @ . .\n g . . . b\n . h . a .\n ======================================*/\n // right and down\n findTour(x + 1, y + 2, moves + 1);\n // left and down\n findTour(x - 1, y + 2, moves + 1);\n // down and right\n findTour(x + 2, y + 1, moves + 1);\n // up and left\n findTour(x - 2, y - 1, moves + 1);\n // right and up\n findTour(x + 1, y - 2, moves + 1);\n // left and up\n findTour(x - 1, y - 2, moves + 1);\n // up and right\n findTour(x + 2, y - 1, moves + 1);\n // down and left\n findTour(x - 2, y + 1, moves + 1);\n\n //If made it this far, path did not lead to tour, so back up.\n board[x][y] = 0;\n System.out.println(this);\n }\n }","public static void main(String[] args) { \n \n //read in filename from user\n String filenameInput = args[0];\n \n //create new maze/graph\n Maze newMaze = new Maze(filenameInput);\n \n //call toString\n //String stringMaze = newMaze.toString();\n \n //print the string maze\n //System.out.println(stringMaze);\n \n //call findPath\n //System.out.println(newMaze.findPath());\n \n for (Vertex v : newMaze.findPath()) System.out.print(v.getName());\n \n //print solution?\n //System.out.println(newMaze.solution);\n \n \n }","public static String findPath(Maze maze) {\n \tint m = maze.getNumRows();\n \tint n = maze.getNumCols();\n\n \t//define a visited matrix\n \tboolean[][] visited = new boolean[m][n];\n \tsetvisited(false, visited);\n\n \t//define a direction matrix\n \tint[][] dir_mtr = new int[m][n];\n \tinit_dir(-1,dir_mtr);\n\n\n\n \t//define a stack\n \tStack<MazeLocation> s;\n \ts = new StackRefBased<MazeLocation>();\n\n \tMazeLocation entry = maze.getEntry();\n \tMazeLocation exit = maze.getExit();\n \t// System.out.println(entry.toString());\n \ts.push(entry);\n\n\t\tMazeLocation temp; \n\t\tString result = \"\"; \t\n\n\t\ttry{\n\t\t\tint x,y;\n\n\n\t\t\twhile(!s.isEmpty()){\n\n \t\ttemp = s.peek();\n \t\tx = temp.getRow();\n \t\ty = temp.getCol();\n \t\tdir_mtr[x][y]+=1;\n\n \t\tif(temp.toString().equals(exit.toString())){\n \t\t\tSystem.out.println(\"find the path\");\n \t\t\tbreak;\n\n \t\t}\n\n \t\tif(dir_mtr[x][y]==0){ \n \t\t\t//checking the up direction\n \t\t\tif(x-1>=0 && !maze.isWall(x-1,y) && !visited[x-1][y]){\n \t\t\t\tMazeLocation testnode = new MazeLocation(x-1,y,maze.isWall(x-1,y));\n \t\t\t\tvisited[x-1][y] = true;\n \t\t\t\ts.push(testnode);\n\n \t\t\t}\n\n \t\t}else if(dir_mtr[x][y]==1){\n \t\t\t//checking the left direction\n \t\t\tif(y-1>=0 && !maze.isWall(x,y-1) && !visited[x][y-1]){\n \t\t\t\tMazeLocation testnode = new MazeLocation(x,y-1,maze.isWall(x,y-1));\n \t\t\t\tvisited[x][y-1] = true;\n \t\t\t\ts.push(testnode);\n\n \t\t\t}\n\n \t\t}else if(dir_mtr[x][y]==2){\n \t\t\t//checking the down direction\n \t\t\tif(x+1<m && !maze.isWall(x+1,y) && !visited[x+1][y]){\n \t\t\t\tMazeLocation testnode = new MazeLocation(x+1,y,maze.isWall(x+1,y));\n \t\t\t\tvisited[x+1][y] = true;\n \t\t\t\ts.push(testnode);\n\n \t\t\t}\n \t\t\t\n \t\t}else if(dir_mtr[x][y]==3){\n \t\t\t//checking the right direction\n \t\t\tif(y+1<n && !maze.isWall(x,y+1) && !visited[x][y+1]){\n \t\t\t\tMazeLocation testnode = new MazeLocation(x,y+1,maze.isWall(x,y+1));\n \t\t\t\tvisited[x][y+1] = true;\n \t\t\t\ts.push(testnode);\n\n \t\t\t}\n \t\t\t\n \t\t}else{\n \t\t\tvisited[x][y] = false;\n \t\t\ts.pop();\n \t\t}\n\n\n\n \t\t\n \t}\n\n \t//reverse the stack\n \tStack<MazeLocation> reverse;\n \treverse = new StackRefBased<MazeLocation>();\n \twhile(!s.isEmpty()){\n\t\t\t reverse.push(s.pop()); \t//push the node to the reverse stack\n\t\t\t }\n\n\n \t//if the stack is not empty, then we find the path\n\t\tif(!reverse.isEmpty()){\n\t\t\tresult = reverse.toString();\n\n\t\t}\n\n \t\n \n\n\t\t}\n\t\tcatch (StackEmptyException see) {\n \n }\n\n\n \treturn result;\n\n\n }","public void solve(int x, int y) {\n\tif ( numQ == xLen ) \n\t solved = true; \n //Checks if you're able to place queen on current space\n\telse if ( board[x][y] == 0 ) {\n\t fill(x,y);\n\t board[x][y] = 9;\n\t numQ++;\n\t //Attempts to call solve for every spot on the board\n\t for ( int r =0; r < xLen; r++ ) {\n\t\tfor ( int c = 0; c < yLen; c++ ) {\n\t\t if (!solved) \n\t\t\tsolve(r,c);\n\t\t \n\t\t}\n\t }\n\t /* Though I got my code to work for the 5x5 example, I had \n\t trouble extending it to larger boards. Essentially my solve\n\t places a queen in the first non-\"threatened\" spot on the board\n\t available, but doesn't go back to try another configuration if\n\t the program runs into a dead-end. */\n\t}\n }","public static void userMover(){\n System.out.println(\"Where would you like to move? Please choose (R)ight, (L)eft, (U)p, or (D)own \");\n String move = input.next();\n\n while (!\"RLUD\".contains(move)) {\n System.out.println(\"Where would you like to move? Please choose (R)ight, (L)eft, (U)p, or (D)own \");\n move = input.next();\n }\n\n if (move.equals(\"R\") && (myMap.canIMoveRight())) {\n myMap.moveRight();\n } else if (move.equals(\"L\") && myMap.canIMoveLeft()) {\n myMap.moveLeft();\n } else if (move.equals(\"U\") && myMap.canIMoveUp()) {\n myMap.moveUp();\n } else if (move.equals(\"D\") && myMap.canIMoveDown()) {\n myMap.moveDown();\n } else if (myMap.isThereAPit(move)) {\n navigatePit(move);\n } else {\n System.out.println(\"Sorry, you’ve hit a wall.\");\n }\n\n myMap.printMap();\n }","public void solveIt() {\n\t\tfirstFreeSquare.setNumberMeAndTheRest();\n\t}","public boolean generateSolution() {\n //first clear all filled in fields by user (they could be wrong)\n clearGame();\n\n //use solver\n SudokuSolver solver = new BacktrackSolver();\n return solver.solveSudoku(this);\n }","public void newMaze()\n {\n NewMazeDialog dialog;\n String result;\n dialog = new NewMazeDialog(Main.getPrimaryFrameInstance());\n if ( (result = dialog.showDialog()) == null)\n return;\n\n MazeInfoModel mim = Main.getPrimaryFrameInstance().getMazeInfoModel();\n\n if (result.equals(NewMazeDialog.MAZ))\n {\n MazeInfo newMi = mim.createNew(\"New Maze \" + mLastNew, false);\n if (newMi == null)\n {\n JOptionPane.showMessageDialog(MazeEditorPage.this,\n \"Unable to create new maze\",\n \"Maze Creation Error\",\n JOptionPane.OK_OPTION);\n return;\n }\n mLastNew++;\n }\n else if (result.equals(NewMazeDialog.MZ2))\n {\n MazeInfo newMi = mim.createNew(dialog.getText(), true);\n if (newMi == null)\n {\n JOptionPane.showMessageDialog(MazeEditorPage.this,\n \"Unable to create new maze\",\n \"Maze Creation Error\",\n JOptionPane.OK_OPTION);\n return;\n }\n MazeModel mm = newMi.getModel();\n mm.setSize(dialog.getMazeSize());\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 }","private void optionsSelect() {\n switch (currentQueNum) {\n case 1:\n ans1Option();\n break;\n case 2:\n ans2Option();\n break;\n case 3:\n ans3Option();\n break;\n case 4:\n ans4Option();\n break;\n case 5:\n ans5Option();\n break;\n case 6:\n ans6Option();\n break;\n case 7:\n ans7Option();\n break;\n case 8:\n ans8Option();\n break;\n case 9:\n ans9Option();\n break;\n case 10:\n ans10Option();\n break;\n }\n }","public boolean solve()\n\t{\n Position[] pos=path.getLastStep().neighbors();\n if (grid.isOnBoundary(path.getLastStep())&&grid.isOpen(path.getLastStep()))\n\t\treturn true;\n if (path.getLastStep()==start)\n return false;\n for (int i=0;i<4;i++)\n {\n if (pos[i]!=path.getLastStep() && grid.isOpen(pos[i]))\n path.extend(pos[i]);\n }\n if (grid.isBlocked(path.getLastStep())||grid.isRejected(path.getLastStep()))\n {\n path.backUp();\n solve();\n }\n return false;\n \n\t}","public static void main(String[] args) {\n\r\n\t\tScanner input = new Scanner(System.in);\r\n\t\tint row =0,col = 0;\r\n\t\tint user = -1;\r\n\t\t\r\n\t\twhile (user != 0 && user != 1 && user != 2) {\r\n\t\t\tSystem.out.println(\"\\n************************************\");\r\n\t\t\tSystem.out.println(\"\\nEnter difficulty level\");\r\n\t\t\tSystem.out.println(\"Press 0 for BEGINNER 9*9 cells and 10 mines\");\r\n\t\t\tSystem.out.println(\"Press 1 for INTERMEDIATE 16*16 cells and 40 mines\");\r\n\t\t\tSystem.out.println(\"Press 2 for ADVANCED 24*24 cells and 99 mines\\n\");\r\n\t\t\tuser = input.nextInt();\r\n\t\t\tSystem.out.println(\"\\n************************************\");\r\n\t\t\tif (user == 0) {\r\n\t\t\t\t\r\n\t\t\t\trow = 9; col = 9;\r\n\t\t\t\t\r\n\t\t\t\t}\r\n\t\t\telse if (user == 1){ \r\n\t\t\t\t\r\n\t\t\t\trow = 16; col = 16;\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t\telse if (user == 2){\r\n\t\t\t\t\r\n\t\t\t\trow = 24; col = 24;\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\t\t\r\n\t\t\r\n\t\tchar[][] board = new char[row][col];\r\n\t\t\r\n\t\tinitBoard(board);\r\n\t\t\r\n\t\tint [][] solution = new int[row][col];\r\n\t\tint [][] playboard = new int[row][col];\r\n\t\tfor(int i=0;i<solution.length;i++){\r\n\t\t\t\r\n\t\t\tfor(int j=0;j<solution[0].length;j++){\r\n\t\t\t\t\r\n\t\t\t\tsolution[i][j]=0;playboard[i][j] =0;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\r\n\t\tint mine = 0;\r\n\t\t\r\n\t\tif (row == 9) mine = 10;\r\n\t\telse if (row == 16) mine = 40;\r\n\t\telse if (row == 24) mine = 99;\r\n\t\t\r\n\t\t\r\n\t\t\r\n\t\tint countplay = mine;fillBoard(board,mine);\r\n\t\t\r\n\t\tfor(int i=0;i<board.length;i++){\r\n\t\t\t\r\n\t\t\tfor(int j=0;j<board[0].length;j++){\r\n\t\t\t\t\r\n\t\t\t\tint r = i;\r\n\t\t\t\tint c =j;\r\n\t\t\t\tif(board[i][c] == '*'){\r\n\t\t\t\t\t\r\n\t\t\t\t\tif(r>0 && c>0){\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tif(board[r-1][c-1] == '.'){\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tsolution[r-1][c-1] += 1;\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t}\r\n\t\t\t\t\t\r\n\t\t\t\t\tif(r >0){\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tif(board[r-1][c] == '.'){\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tsolution[r-1][c] += 1;\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t}\r\n\t\t\t\t\t\r\n\t\t\t\t\tif(r >0 && c+1 < board[0].length){\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tif(board[r-1][c+1] == '.'){\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tsolution[r-1][c+1] += 1;\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t}\r\n\t\t\t\t\t\r\n\t\t\t\t\tif(c >0){if(board[r][c-1] == '.'){\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tsolution[r][c-1] += 1;\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\t\t\r\n\t\t\t\t\tif(c+1 < board[0].length){\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tif(board[r][c+1] == '.'){\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tsolution[r][c+1] += 1;\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t}\r\n\t\t\t\t\t\r\n\t\t\t\t\tif(r +1 < board.length && c >0){\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tif(board[r+1][c-1] == '.'){\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tsolution[r+1][c-1] += 1;\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t}\r\n\t\t\t\t\t\r\n\t\t\t\t\tif(r +1 < board.length){\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tif(board[r+1][c] == '.'){\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tsolution[r+1][c] += 1;\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t}\r\n\t\t\t\t\t\r\n\t\t\t\t\tif(r +1 < board.length && c+1 <board[0].length){\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tif(board[r+1][c+1] == '.'){\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tsolution[r+1][c+1] += 1;\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\r\n\t\tSystem.out.println(\"\\n************************************\");\r\n\t\tSystem.out.println(\"\\nPlay Game\");\r\n\t\tSystem.out.println(\"\\nRows and Columns start from 0!\");\r\n\t\tSystem.out.println(\"\\n************************************\");\r\n\t\tprintBoard(board);\r\n\t\t\r\n\t\twhile(countplay <=board.length * board[0].length){\r\n\t\t\t\r\n\t\t\tSystem.out.println(\"\\nEnter row: \");\r\n\t\t\t\r\n\t\t\tint prow = input.nextInt();System.out.println(\"\\nEnter col: \");\r\n\t\t\tint pcol = input.nextInt();\r\n\t\t\t\r\n\t\t\t\r\n\t\t\t\r\n\t\t\tfor(int i=0;i<board.length;i++){\r\n\t\t\t\tfor(int j=0;j<board[0].length;j++){\r\n\t\t\t\t\t\r\n\t\t\t\t\tif(board[prow][pcol] == '*'){\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tSystem.out.println(\"GAME OVER\\n\");\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tfor(int k=0;k<solution.length;k++){\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tfor(int x=0;x<solution[0].length;x++){\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\tif(board[k][x]=='*')\r\n\t\t\t\t\t\t\t\t\tSystem.out.print(\"*\" + \" \");\r\n\t\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t\telse\r\n\t\t\t\t\t\t\t\t\tSystem.out.print(solution[k][x] + \"\");\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\t\r\n\t\t\t\t\t\t\tSystem.out.println(\"\\n\");\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\treturn;\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse\r\n\t\t\t\t\t{playboard[prow][pcol] = solution[prow][pcol];\r\n\t\t\t\t\ti=board.length;\r\n\t\t\t\t\tj=board[0].length;break;\r\n\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\tfor(int k=0;k<playboard.length;k++){\r\n\t\t\t\t\r\n\t\t\t\tfor(int x=0;x<playboard[0].length;x++){\r\n\t\t\t\t\t\r\n\t\t\t\t\tif(board[k][x]=='*')\r\n\t\t\t\t\t\tSystem.out.print(\".\" + \" \");\r\n\t\t\t\t\t\r\n\t\t\t\t\telse if(playboard[k][x]==0)\r\n\t\t\t\t\t\tSystem.out.print(\".\" + \" \");\r\n\t\t\t\t\t\r\n\t\t\t\t\telse\r\n\t\t\t\t\t\tSystem.out.print(playboard[k][x] + \" \");\r\n\t\t\t\t\t\r\n\t\t\t\t}\r\n\t\t\t\tSystem.out.println(\"\\n\");\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\tcountplay++;\r\n\t\t\t\r\n\t\t}\r\n\t\t\r\n\t\tSystem.out.println(\"Congratulations\");\r\n\t\t\r\n\t}","@Override\r\n\tpublic void solve() {\n\t\t\r\n\t}","public boolean solve(){\n\t\t//Solve the puzzle using backtrack method\n\t\treturn solve(0,0);\n\t}","public void solve() {\n System.out.println(\"Solving...\");\n solving = true;\n Solver s = new Solver(b.getBoard());\n ArrayList<Integer> solution = s.solve();\n\n System.out.println(\"Printing solution...\");\n try{\n Thread.sleep(300);\n }catch (Exception e){}\n\n solution.trimToSize();\n\n solveMoves = solution;\n\n Board bRef = new Board(b.getBoard());\n\n System.out.println(\"Step 0\");\n System.out.println(bRef.toString());\n\n for (int i = 0; i < solution.size(); i++) {\n bRef.move(solution.get(i));\n System.out.println(\"Step \" + (i + 1));\n System.out.println(bRef.toString());\n }\n\n System.out.println(\"Solved by Computer in \" + solution.size()+ \" move(s).\\n\");\n System.out.println(\"Left-click screen to follow steps.\");\n System.out.println(\"Right-click the screen to play again.\");\n\n solveStep = 0; //Reset for user\n }","public static String menuSelection() throws ParseException {\n System.out.print(\"\\nWelcome to Poised!\");\n System.out.print(\"\\n1\\t-\\tAdd a new project\");\n System.out.print(\"\\n2\\t-\\tChange due date of a project\");\n System.out.print(\"\\n3\\t-\\tChange payment on project\");\n System.out.print(\"\\n4\\t-\\tUpdate contact details\");\n System.out.print(\"\\n5\\t-\\tFinalise a project\");\n System.out.print(\"\\nPlease make your selection: \");\n\n // User's selection determine which method should be called\n // If user's selection is '1', then user can create a new project\n int userSelection = input.nextInt();\n input.nextLine();\n if (userSelection == 1) {\n ProjectList.add(createProject());\n }\n\n // If user selection '2', then can amend the due date of the project\n else if (userSelection == 2) {\n Project selectedProj = getProject();\n if (selectedProj == null) {\n return menuSelection();\n }\n\n newDeadline(selectedProj);\n }\n\n // If user selects '3', then user can change the payment on the project\n else if (userSelection == 3) {\n Project selectedProj = getProject();\n if (selectedProj == null) {\n return menuSelection();\n }\n\n makePayment(selectedProj);\n }\n\n // If user selects '4', then user can update the details of either the\n // contractor, client or architect.\n else if (userSelection == 4) {\n Project selectedProj = getProject();\n if (selectedProj == null) {\n return menuSelection();\n }\n\n updateDetails(selectedProj);\n }\n\n // If user selects '5', then user can finalise the project\n else if (userSelection == 5) {\n Project selectedProj = getProject();\n if (selectedProj == null) {\n return menuSelection();\n }\n\n finalisation(selectedProj);\n }\n\n return menuSelection();\n }","public boolean solve(){\n\t\treturn solve(0,0);\n\t}","public void showSaveMaze(String message);","private static void menuSelector(){\r\n\t\tint answer= getNumberAnswer();\r\n\t\tswitch (answer) {\r\n\t\tcase 0:\r\n\t\t\tshowShapeInfo(shapes[0]);\r\n\t\t\tbreak;\r\n\t\tcase 1:\r\n\t\t\tcreateShape();\r\n\t\t\tbreak;\r\n\t\tcase 2:\r\n\t\t\tSystem.out.println(\"Its Perimeter is equal to: \" +calcShapePerimeter(shapes[0]));\r\n\t\t\tbreak;\r\n\t\tcase 3:\r\n\t\t\tSystem.out.println(\"Its Area is equal to: \" +calcShapeArea(shapes[0]));\r\n\t\t\tbreak;\r\n\t\tcase 4:\r\n\t\t\tSystem.out.println(\"Provide integer to use for scaling shape: \");\r\n\t\t\tscaleShape(shapes[0], getNumberAnswer());\r\n\t\t\tbreak;\r\n\t\tdefault:\r\n\t\t\tSystem.out.println(\"That's not actually an option.\");\r\n\t\t\tbreak;\r\n\t\t}\r\n\t}","protected boolean menu() {\n\t\tint selection = 0;\n\t\twhile(selection != 6) {\n\t\t\tSystem.out.println();\n\t\t\tSystem.out.print(\"Please select your choice:\\n\" +\n\t\t\t\t\t\"1 - Play Human vs AI Game\\n\" +\n\t\t\t\t\t\"2 - Play AI vs AI Game\\n\" +\n\t\t\t\t\t\"3 - Quit\\n\" );\n\t\t\ttry {\n\t\t\t\tselection = Integer.parseInt(getFromUser(\"Enter selection: \"));\n\t\t\t}\n\t\t\tcatch (Exception e) {\n\t\t\t\tSystem.out.println(\"Invalid Input - type the number corresponding to your selection\");\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tswitch(selection){\n\t\t\t\tcase 1: case 2: board = Factory.instance().makeBoard(selection); break;\n\t\t\t\tcase 3: quit(); break;\n\t\t\t\tdefault: System.out.println(\"Invalid Input\");\n\t\t\t}\n\t\t\tif(selection >= 1 && selection <= 4 && board != null){\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}","public void AskForMove();","public boolean solve()throws InterruptedException{\n\tint startx=0,starty=0;\n\t//Initialize startx and starty with the location of the S.\n\tfor (int r = 0; r < height; r++){\n\t for (int c = 0; c < length; c++){\n\t\tif (board[r][c] == 'S'){\n\t\t startx = r;\n\t\t starty = c;\n\t\t}\n\t }\n\t}\n\tboard[startx][starty] = ' ';//erase the S, and start solving!\n\treturn solveH(startx,starty);\n }","public void solution() {\n\t\t\n\t}","public static void main(String[] args) // solve a slider puzzle (given below)\n {\n In in = new In(args[0]);\n int N = in.readInt();\n int[][] blocks = new int[N][N];\n for (int i = 0; i < N; i++)\n for (int j = 0; j < N; j++)\n blocks[i][j] = in.readInt();\n Board initial = new Board(blocks);\n\n // solve the puzzle\n Solver solver = new Solver(initial);\n\n // print solution to standard output\n if (!solver.isSolvable())\n StdOut.println(\"No solution possible\");\n else {\n StdOut.println(\"Minimum number of moves = \" + solver.moves());\n for (Board board : solver.solution())\n StdOut.println(board);\n \n \t\n }\n}","public static void main(String[] args) {\n char option;\n Scanner scan = new Scanner(System.in);\n System.out.println(\"Welcome to MG's adventure world. Now your journey begins. Good luck!\");\n System.out.println(\"Please hit 'C' or 'c' to continue, anything else to quit-\");\n String input = getInput(scan, \"Cc\");\n System.out.println(\"You are in a dead valley.\");\n System.out.println(\"Please hit 'C' or 'c' to continue, anything else to quit-\");\n input = getInput(scan, \"Cc\");\n System.out.println(\"You walked and walked and walked and you saw a cave!\");\n cave();\n System.out.println(\"Please hit 'C' or 'c' to continue, anything else to quit-\");\n input = getInput(scan, \"Cc\");\n System.out.println(\"You entered a cave!\");\n System.out.println(\"Please hit 'C' or 'c' to continue, anything else to quit-\");\n input = getInput(scan, \"Cc\");\n System.out.println(\"Unfortunately, you ran into a GIANT!\");\n giant();\n System.out.println(\"Enter 'A' or 'a' to Attack, 'E' or 'E' to Escape, ANYTHING else is to YIELD\");\n input = getInput(scan, \"AaEe\", 10);\n System.out.println(\"Congratulations! You SURVIVED! Get your REWARD!\");\n System.out.println(\"There are three 3 tressure box in front of you! Enter the box number you want to open!\");\n box();\n input = getInput(scan);\n System.out.println(\"Hero! Have a good day!\");\n }","public void solve() {\n \tsquares[0][0].fillInRemainingOfBoard();\n }","public static void main(String[] args) {\n\t\tSystem.out.println(\"This is a 10 * 10 map, x axis and y axis start from 0 - 9.\");\n\t\tSystem.out.println(\"There are totally \"+MINE_NUMBER+\" mines, and your task is to find all the mines.\");\n\n\t\t// generate 10*10 grid\n\t\t/*\n\t\t * 0: not mine 1: mine 2: mine found 3: not mine shot\n\t\t * \n\t\t */\n\t\tint[][] map = new int[10][10];\n\t\t// repeated at least 5 times generate 5 mines\n\t\tint i = 0;\n\t\twhile (i < MINE_NUMBER) {\n\t\t\t// generate mines generally\n\t\t\tint x = (int) (Math.random() * 10); // 0-9\n\t\t\tint y = (int) (Math.random() * 10); // 0-9\n\t\t\tif (map[x][y] == 1) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tmap[x][y] = 1;\n\t\t\ti++;\n\t\t}\n\n\t\t// ready to accept user input\n\t\tScanner input = new Scanner(System.in);\n\t\t// how many mines been found\n\t\tint find = 0;\n\n\t\t// start to accept user input\n\t\twhile (find < MINE_NUMBER) {\n\t\t\tint clickX, clickY;\n\t\t\tSystem.out.println(\"please enter the x axis of mine\");\n\t\t\tclickX = input.nextInt();\n\t\t\tSystem.out.println(\"please enter the y axis of mine \");\n\t\t\tclickY = input.nextInt();\n\n\t\t\tif (map[clickX][clickY] == 1) {\n\t\t\t\tmap[clickX][clickY] = 2;\n\t\t\t\tfind++;\n\t\t\t\tSystem.out.println(\"You find a mine! Now you found \" + find + \" mines and \" + (MINE_NUMBER - find) + \" left!\");\n\n\t\t\t} else if (map[clickX][clickY] == 2) {\n\t\t\t\tSystem.out.println(\"You have found this target, try again!\");\n\t\t\t} else {\n\t\t\t\tmap[clickX][clickY] = 3;\n\t\t\t\tSystem.out.println(\"You miss!\");\n\t\t\t\thint(map, clickX, clickY);\n\t\t\t}\n\t\t}\n\n\t\tSystem.out.println(\"You found all the mines! You win!\");\n\t\tinput.close();\n\t}","public void showSolveFrom(String message);","public void solve(int x, int y, int number)\r\n\t{\r\n\t\t\r\n\t}","public void trySolve() {\n\t\tboolean change = true;\n\t\twhile (change) {\n\t\t\tchange = boardSolve();\n\t\t}\n\t}","public static void main(String[] args) {\n\n // create initial board from file\n In in = new In(args[0]);\n int N = in.readInt();\n int[][] tiles = new int[N][N];\n for (int i = 0; i < N; i++)\n for (int j = 0; j < N; j++)\n tiles[i][j] = in.readInt();\n Board initial = new Board(tiles);\n\n // check if puzzle is solvable; if so, solve it and output solution\n if (initial.isSolvable()) {\n Solver solver = new Solver(initial);\n StdOut.println(\"Minimum number of moves = \" + solver.moves());\n for (Board board : solver.solution())\n StdOut.println(board);\n }\n\n // if not, report unsolvable\n else {\n StdOut.println(\"Unsolvable puzzle\");\n }\n}","private void initializeGrid(Boolean makeMaze) {\r\n\t\t\tint oldRows = rows;\r\n\t\t\tint oldColumns = columns;\r\n\t\t\ttry {\r\n\t\t\t\tif (!rowsField.getText().isEmpty()) {\r\n\t\t\t\t\trows = Integer.parseInt(rowsField.getText());\r\n\t\t\t\t} else {\r\n\t\t\t\t\tJOptionPane.showMessageDialog(this, \"O Número de Linhas tem que ser respeitado! (5~50)\", \"Erro\",\r\n\t\t\t\t\t\t\tJOptionPane.ERROR_MESSAGE);\r\n\t\t\t\t\trows = oldRows;\r\n\t\t\t\t\treturn;\r\n\t\t\t\t}\r\n\t\t\t} catch (NumberFormatException ex) {\r\n\t\t\t\tJOptionPane.showMessageDialog(this, \"O Número de Linhas tem que ser respeitado! (5~50)\", \"Erro\",\r\n\t\t\t\t\t\tJOptionPane.ERROR_MESSAGE);\r\n\t\t\t\trows = oldRows;\r\n\t\t\t\treturn;\r\n\t\t\t}\r\n\t\t\tif (rows < 5 || rows > 50) {\r\n\t\t\t\tJOptionPane.showMessageDialog(this, \"O Número de Linhas tem que ser respeitado! (5~50)\", \"Erro\",\r\n\t\t\t\t\t\tJOptionPane.ERROR_MESSAGE);\r\n\t\t\t\trows = oldRows;\r\n\t\t\t\treturn;\r\n\t\t\t}\r\n\t\t\ttry {\r\n\t\t\t\tif (!columnsField.getText().isEmpty()) {\r\n\t\t\t\t\tcolumns = Integer.parseInt(columnsField.getText());\r\n\t\t\t\t} else {\r\n\t\t\t\t\tJOptionPane.showMessageDialog(this, \"O Número de Colunas tem que ser respeitado! (5~50)\", \"Erro\",\r\n\t\t\t\t\t\t\tJOptionPane.ERROR_MESSAGE);\r\n\t\t\t\t\tcolumns = oldColumns;\r\n\t\t\t\t\treturn;\r\n\t\t\t\t}\r\n\t\t\t} catch (NumberFormatException ex) {\r\n\t\t\t\tJOptionPane.showMessageDialog(this, \"O Número de Colunas tem que ser respeitado! (5~50)\", \"Erro\",\r\n\t\t\t\t\t\tJOptionPane.ERROR_MESSAGE);\r\n\t\t\t\tcolumns = oldColumns;\r\n\t\t\t\treturn;\r\n\t\t\t}\r\n\t\t\tif (columns < 5 || columns > 50) {\r\n\t\t\t\tJOptionPane.showMessageDialog(this, \"O Número de Colunas tem que ser respeitado! (5~50)\", \"Erro\",\r\n\t\t\t\t\t\tJOptionPane.ERROR_MESSAGE);\r\n\t\t\t\tcolumns = oldColumns;\r\n\t\t\t\treturn;\r\n\t\t\t}\r\n\t\t\tsquareSize = 500 / (rows > columns ? rows : columns);\r\n\t\t\tarrowSize = squareSize / 2;\r\n\t\t\t// the maze must have an odd number of rows and columns\r\n\t\t\tif (makeMaze && rows % 2 == 0) {\r\n\t\t\t\trows -= 1;\r\n\t\t\t}\r\n\t\t\tif (makeMaze && columns % 2 == 0) {\r\n\t\t\t\tcolumns -= 1;\r\n\t\t\t}\r\n\t\t\tgrid = new int[rows][columns];\r\n\t\t\trobotStart = new Cell(rows - 2, 1);\r\n\t\t\ttargetPos = new Cell(1, columns - 2);\r\n\t\t\tdfs.setEnabled(true);\r\n\t\t\tdfs.setSelected(true);\r\n\t\t\tbfs.setEnabled(true);\r\n\t\t\taStar.setEnabled(true);\r\n\t\t\tguloso.setEnabled(true);\r\n\t\t\tdijkstra.setEnabled(true);\r\n\t\t\tdiagonal.setSelected(false);\r\n\t\t\tdiagonal.setEnabled(true);\r\n\t\t\tdrawArrows.setSelected(false);\r\n\t\t\tdrawArrows.setEnabled(true);\r\n\t\t\tslider.setValue(500);\r\n\t\t\tif (makeMaze) {\r\n\t\t\t\tMyMaze maze = new MyMaze(rows / 2, columns / 2);\r\n\t\t\t} else {\r\n\t\t\t\tfillGrid();\r\n\t\t\t}\r\n\t\t}","private void exploreMines(int option) {\n\t\tfor(int i = 0; i < numberOfMines; i++) {\n\t\t\tboard[rowCoordinates[i]][cowCoordinates[i]] = \"*\";\n\t\t}\n\t\toutputBoard();\n\t\tif(option == 1) {\n\t\t\tSystem.out.println(\"YOU LOSE!\");\n\t\t}\n\t\telse {\n\t\t\tSystem.out.println(\"YOU WIN!\");\n\t\t}\n\t}","private MazeSolver.SolveType getSolveType() {\r\n//\t\tif (huggingRadioButton.isSelected()) return MazeSolver.SolveType.HUG_LEFT;\r\n//\t\tif (recursiveRadioButton.isSelected()) return MazeSolver.SolveType.RECURSIVE;\r\n\t\treturn MazeSolver.SolveType.HUG_LEFT;\r\n\t}","public abstract void solve();","public void selectRouteChoice()\n\t{\n\t\tRoutePlanner planner = new RoutePlanner();\n\t\tthis.sequence = ap.listSequences.get(numTrips);\n\t\t// only minimisation\n\t\tif (ap.routeChoice.equals(\"DS\")) newPath = planner.roadDistance(originNode, destinationNode, ap);\n\t\telse if (ap.routeChoice.equals(\"AC\")) newPath = planner.angularChangeBased(originNode, destinationNode, ap);\n\t\telse if (ap.routeChoice.equals(\"TS\")) newPath = planner.angularChangeBased(originNode, destinationNode, ap);\n\t\t// minimisation plus only global landmarks\n\t\telse if (ap.routeChoice.equals(\"DG\")) newPath = planner.roadDistance(originNode, destinationNode, ap);\n\t\telse if (ap.routeChoice.equals(\"AG\")) newPath = planner.angularChangeBased(originNode, destinationNode, ap);\n\t\t// minimisation plus local and (optionally) global landmarks\n\t\telse if (ap.routeChoice.contains(\"D\") && ap.routeChoice.contains(\"L\")) newPath = planner.roadDistanceSequence(sequence, ap);\n\t\telse if (ap.routeChoice.contains(\"A\") && ap.routeChoice.contains(\"L\")) newPath = planner.angularChangeBasedSequence(sequence, ap);\n\t\t// anything with regions and/or barriers, or just barriers\n\t\telse if (ap.routeChoice.contains(\"R\")) newPath = planner.regionBarrierBasedPath(originNode, destinationNode, ap);\n\t\telse if (ap.routeChoice.contains(\"B\")) newPath = planner.barrierBasedPath(originNode, destinationNode, ap);\n\t}","protected static int easyIn() {\n // ADDITIONAL CHECKS?\n int a;\n debug(\"Please enter your selection: \");\n scanner = new Scanner(System.in);\n\t\ta = scanner.nextInt();\n return a;\n }","public void testSolve2() {\n test = new Location(0, 1);\n maze2.setCell(test, MazeCell.WALL);\n test = new Location(1, 0);\n maze2.setCell(test, MazeCell.WALL);\n assertEquals(null, maze2.solve());\n }","public void consoleBoardInput(){\n\t\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in));\n\t\tString input;\n\t\tint row=0,col=0;\n\t\t\n\t\tSystem.out.println(\"Current symbol: \" + ttt.getCurrentSymbol());\n\t\t\n\t\t//get row\n\t\tdo{\n\t\t\ttry{\n\t\t\t\tSystem.out.print(\"Enter Row: \");\n\t\t\t\tinput=in.readLine();\n\t\t\t\trow = Integer.parseInt(input);\n\t\t\t\tif (row<0 || row>2) throw new IllegalArgumentException();\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcatch(Exception e){\n\t\t\t\tSystem.out.println(\"Invalid input\");\n\t\t\t}\n\t\t}while(true);\n\t\t\n\t\t//get column\n\t\tdo{\n\t\t\ttry{\n\t\t\t\tSystem.out.print(\"Enter Col: \");\n\t\t\t\tinput=in.readLine();\n\t\t\t\tcol = Integer.parseInt(input);\n\t\t\t\tif (col<0 || col>2) throw new IllegalArgumentException();\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcatch(Exception e){\n\t\t\t\tSystem.out.println(\"Invalid input\");\n\t\t\t}\n\t\t}while(true);\n\t\t\n\t\t//check whether selected cell is valid\n\t\tif (!ttt.placeMove(row,col))\n\t\t\tSystem.out.println(\"Selected cell already filled. Try again.\");\n\t}","private void readMaze(Scanner scan) //throws FileNotFoundException\n\t{\n\t\t// initialize the square matrix\n\t\ttopology = new int[row][col];\n\t\t// str stores temporary character read in\n\t\tString str = \"\";\n\t\t// read in the matrix for square\n\t\t// loop through # of rows\n\t\tfor(int i =0; i< row; i++)\n\t\t{\n\t\t\t// check if there is a next line then read \n\t\t\tif(scan.hasNextLine())\n\t\t\t{\n\t\t\t\tString line = scan.nextLine();\t\t\t\t\t\t\n\t\t\t\t// make a scanner for that line\n\t\t\t\t//Scanner scanLine = new Scanner(line);\n\t\t\t\t// read in each line\n\t\t\t\tfor(int j =0; j<col; j++){\n\t\t\t\t\t// make sure there are col # of entries in a row\n\t\t\t\t\ttry{\n\t\t\t\t\tstr = line.charAt(j)+\"\";\n\t\t\t\t\t// open space\n\t\t\t\t\tif(str.equals(\".\")) topology[i][j]= -1;\n\t\t\t\t\t//wall\n\t\t\t\t\telse if(str.equals(\"#\")) topology[i][j]=-2;\n\t\t\t\t\t//start\n\t\t\t\t\telse if(str.equals(\"S\")){\n\t\t\t\t\t\ttopology[i][j] = 0;\n\t\t\t\t\t\t// enqueue this element to the qCells\n\t\t\t\t\t\tqCells.enQueue(new Point(i,j));\n\t\t\t\t\t}\n\t\t\t\t\t//stop\n\t\t\t\t\telse if(str.equals(\"D\")){\n\t\t\t\t\t\ttopology[i][j] = -3;\n\t\t\t\t\t\t// push this on the path stack\n\t\t\t\t\t\tsPath.push(new Point(i,j));\n\t\t\t\t\t}\n\t\t\t\t\t// otherwise wrong format\n\t\t\t\t\telse{\n\t\t\t\t\t\tSystem.out.println(\"This is wrong \"+str);\n\t\t\t\t\t\tthrow new InputMismatchException(\"Illegal input\");\n\t\t\t\t\t}\n\t\t\t\t\t}catch(StringIndexOutOfBoundsException e){\n\t\t\t\t\t\tthrow new StringIndexOutOfBoundsException(\"Not enough inputs in a row\");\n\t\t\t\t\t}\n\t\t\t\t} // end of j loop\n\t\t\t\t//too many inputs on a row\n\t\t\t\tif(line.length()>col) throw new InputMismatchException(\"Extra input in row \"+ i+ \" is \" + str);\n\t\t\t\t\t\t\n\t\t\t}// end of if has next line\n\t\t\telse{\n\t\t\t\t//not enough line\n\t\t\t\tthrow new InputMismatchException(\"Two few rows.\");\n\t\t\t}\n\t\t}// end of i loop\n\t\t// check if there are too many rows\n\t\tif(scan.hasNextLine()) throw new InputMismatchException(\"Two many rows.\");\n\t}","public static void userInput(){\r\n System.out.println(\"Enter the coordinates: \");\r\n if (!sc.hasNextInt()) {\r\n System.out.println(\"You should enter numbers!\");\r\n sc.next(); // Need this to get rid of the 2nd entry\r\n userInput();\r\n } else {\r\n int x = sc.nextInt();\r\n int y = sc.nextInt();\r\n if (x > 3 || x < 1 || y > 3 || y < 1) {\r\n System.out.println(\"Coordinates should be from 1 to 3!\");\r\n userInput();\r\n } // Check if space is free\r\n else if (output[3 - y][x - 1] != ' '){\r\n System.out.println(\"This cell is occupied! Choose another one!\");\r\n userInput();\r\n } else {\r\n inputXO = totalMovesPlaced % 2 == 0 ? 'X' : 'O';\r\n output[3 - y][x - 1] = inputXO;\r\n totalMovesPlaced++;\r\n }\r\n }\r\n totalMoves++;\r\n }","public static void main(String[] args){\n\t\tSystem.out.print(\"This was the initial input\");\r\n\t\tfillBoard();\r\n\t\tprintSudoBoard(table);\r\n\t\tsolve(table);\r\n\t\t//prints the final board\r\n\t\tSystem.out.print(\"This is the answer to the board\");\r\n\t\tprintSudoBoard(table);\r\n\r\n\r\n\r\n\t}","public void chooseAlgorithm() {\n boolean runloop = true;\n CustomArrayList<Integer>[] graph = null;\n graph = util.initializeCNF(statement);\n while (runloop) {\n io.println(\"Which algorithm do you want to use to solve this?\");\n io.println(\"1: Tarjan algorithm\\n2: Kosaraju algorithm\\n3: Brute force method\\n4: Print the truth distribution that solves the CNF\\n5: return\");\n String selection = io.nextLine();\n switch (selection) {\n case (\"1\"):\n tarjan = new TarjanAlgorithm(graph, numVariables);\n TarjanPrint();\n break;\n case (\"2\"):\n kosaraju = new KosarajuAlgorithm(graph, numVariables);\n KosarajuPrint();\n break;\n case (\"3\"):\n io.println(\"Warning! Brute force method has an exponential time complexity. Using this with CNF with more than 20 variables will take a really long time. \");\n io.println(\"Continue? y/n\");\n String affirmate = io.nextLine();\n switch (affirmate) {\n case (\"y\"):\n bruteForcePrint();\n break;\n case (\"n\"):\n break;\n }\n break;\n case (\"4\"):\n tarjan = new TarjanAlgorithm(graph, numVariables);\n if (tarjan.checkSatisfiability()) {\n printTruthAssesment();\n } else {\n io.println(\"Not satisfiable\");\n }\n break;\n case (\"5\"):\n io.println(\"Returning to main menu...\");\n runloop = false;\n break;\n }\n }\n }","void maze(char[][] mz, int p_row, int p_col, int h_row, int h_col){\n \n if (mz[p_row][p_col] == 'F'){\n //Base case -End maze\n printMaze(mz);\n System.out.println(\"Maze Successfully Completed!\");\n } else {\n if (h_row-1 == p_row){\n //If facing East\n if(mz[h_row][h_col] != '#'){ //If right turn available\n //Update player\n mz[p_row][p_col] = 'X'; \n p_row += 1;\n p_col += 0;\n if (mz[p_row][p_col] == 'F'){\n mz[p_row][p_col] = 'F';\n } else {\n mz[p_row][p_col] = 'O';\n }\n //Update hand\n h_row += 0;\n h_col -= 1;\n printMaze(mz); \n } else { \n //If hand position is a wall check in front of player\n if(mz[p_row][p_col+1] != '#'){\n //Update player\n mz[p_row][p_col] = 'X';\n p_row += 0;\n p_col += 1;\n if (mz[p_row][p_col] == 'F'){\n mz[p_row][p_col] = 'F';\n } else {\n mz[p_row][p_col] = 'O';\n }\n //Update hand\n h_row += 0;\n h_col += 1;\n printMaze(mz);\n } else if (mz[p_row-1][p_col] != '#'){\n //Turn left 90 and if not a wall move up\n //Update player\n mz[p_row][p_col] = 'X';\n p_row -= 1;\n p_col += 0;\n if (mz[p_row][p_col] == 'F'){\n mz[p_row][p_col] = 'F';\n } else {\n mz[p_row][p_col] = 'O';\n }\n //Update hand\n h_row -= 2;\n h_col += 1;\n printMaze(mz);\n } else {\n //Turn around\n //Update player\n mz[p_row][p_col] = 'X';\n p_row += 0;\n p_col -= 1;\n if (mz[p_row][p_col] == 'F'){\n mz[p_row][p_col] = 'F';\n } else {\n mz[p_row][p_col] = 'O';\n }\n //Update hand\n h_row -= 2;\n h_col -= 1;\n printMaze(mz);\n }\n }\n } else if (h_row+1 == p_row){\n //If facing West\n if(mz[h_row][h_col] != '#'){\n //Look right\n mz[p_row][p_col] = 'X'; \n p_row -= 1;\n p_col += 0;\n if (mz[p_row][p_col] == 'F'){\n mz[p_row][p_col] = 'F';\n } else {\n mz[p_row][p_col] = 'O';\n }\n //Update hand\n h_row -= 0;\n h_col += 1;\n printMaze(mz);\n } else { \n //If hand position is a wall check in front of player\n if(mz[p_row][p_col-1] != '#'){\n //Update player\n mz[p_row][p_col] = 'X';\n p_row += 0;\n p_col -= 1;\n if (mz[p_row][p_col] == 'F'){\n mz[p_row][p_col] = 'F';\n } else {\n mz[p_row][p_col] = 'O';\n }\n //Update hand\n h_row += 0;\n h_col -= 1;\n printMaze(mz);\n } else if (mz[p_row+1][p_col] != '#'){\n //Turn left 90 and if not a wall move up\n //Update player\n mz[p_row][p_col] = 'X';\n p_row += 1;\n p_col -= 0;\n if (mz[p_row][p_col] == 'F'){\n mz[p_row][p_col] = 'F';\n } else {\n mz[p_row][p_col] = 'O';\n }\n //Update hand\n h_row += 2;\n h_col -= 1;\n printMaze(mz);\n } else {\n //Turn around\n //Update player\n mz[p_row][p_col] = 'X';\n p_row -= 0;\n p_col += 1;\n if (mz[p_row][p_col] == 'F'){\n mz[p_row][p_col] = 'F';\n } else {\n mz[p_row][p_col] = 'O';\n }\n //Update hand\n h_row += 2;\n h_col += 1;\n printMaze(mz);\n }\n }\n \n } else if (h_col -1 == p_col){\n //If facing North\n if(mz[h_row][h_col] != '#'){ \n //Take right if available\n //Update player\n mz[p_row][p_col] = 'X'; \n p_row += 0;\n p_col += 1;\n if (mz[p_row][p_col] == 'F'){\n mz[p_row][p_col] = 'F';\n } else {\n mz[p_row][p_col] = 'O';\n }\n //Update hand\n h_row += 1;\n h_col -= 0;\n printMaze(mz); \n } else {\n //If hand position is a wall check in front of player\n if(mz[p_row-1][p_col] != '#'){\n //Update player\n mz[p_row][p_col] = 'X';\n p_row -= 1;\n p_col += 0;\n if (mz[p_row][p_col] == 'F'){\n mz[p_row][p_col] = 'F';\n } else {\n mz[p_row][p_col] = 'O';\n }\n //Update hand\n h_row -= 1;\n h_col += 0;\n printMaze(mz);\n } else if (mz[p_row][p_col-1] != '#'){\n //Turn left 90 and if not a wall move up\n //Update player\n mz[p_row][p_col] = 'X';\n p_row -= 0;\n p_col -= 1;\n if (mz[p_row][p_col] == 'F'){\n mz[p_row][p_col] = 'F';\n } else {\n mz[p_row][p_col] = 'O';\n }\n //Update hand\n h_row -= 1;\n h_col -= 2;\n printMaze(mz);\n } else {\n //Turn around\n //Update player\n mz[p_row][p_col] = 'X';\n p_row -= 1;\n p_col += 0;\n if (mz[p_row][p_col] == 'F'){\n mz[p_row][p_col] = 'F';\n } else {\n mz[p_row][p_col] = 'O';\n }\n //Update hand\n h_row += 1;\n h_col -= 2;\n printMaze(mz);\n }\n }\n } else if (h_col+1 == p_col){\n //If facing South\n if(mz[h_row][h_col] != '#'){\n //Look right\n mz[p_row][p_col] = 'X'; \n p_row -= 0;\n p_col -= 1;\n if (mz[p_row][p_col] == 'F'){\n mz[p_row][p_col] = 'F';\n } else {\n mz[p_row][p_col] = 'O';\n }\n //Update hand\n h_row -= 1;\n h_col += 0;\n printMaze(mz);\n } else { \n //If hand position is a wall check in front of player\n if(mz[p_row+1][p_col] != '#'){\n //Update player\n mz[p_row][p_col] = 'X';\n p_row += 1;\n p_col += 0;\n if (mz[p_row][p_col] == 'F'){\n mz[p_row][p_col] = 'F';\n } else {\n mz[p_row][p_col] = 'O';\n }\n //Update hand\n h_row += 1;\n h_col += 0;\n printMaze(mz);\n } else if (mz[p_row][p_col+1] != '#'){\n //Turn left 90 and if not a wall move up\n //Update player\n mz[p_row][p_col] = 'X';\n p_row += 0;\n p_col += 1;\n if (mz[p_row][p_col] == 'F'){\n mz[p_row][p_col] = 'F';\n } else {\n mz[p_row][p_col] = 'O';\n }\n //Update hand\n h_row += 1;\n h_col += 2;\n printMaze(mz);\n } else {\n //Turn around\n //Update player\n mz[p_row][p_col] = 'X';\n p_row -= 0;\n p_col += 1;\n if (mz[p_row][p_col] == 'F'){\n mz[p_row][p_col] = 'F';\n } else {\n mz[p_row][p_col] = 'O';\n }\n //Update hand\n h_row += 2;\n h_col += 1;\n printMaze(mz);\n }\n }\n \n }\n maze(mz, p_row, p_col, h_row, h_col); \n }\n }","private void problemSolve (String folderName, ArrayList<String> loader1, ArrayList<String> loader2) throws IOException {\n Object[] pValue = { WED_ZERO.lang.getInstruct().get(1)[20], WED_ZERO.lang.getInstruct().get(1)[21],WED_ZERO.lang.getInstruct().get(1)[22], WED_ZERO.lang.getInstruct().get(1)[23] };\n Object selectedValue = JOptionPane.showInputDialog(null,\n WED_ZERO.lang.getInstruct().get(1)[24]+\" \"+\"\\\"\"+folderName+\"\\\" \"+WED_ZERO.lang.getInstruct().get(1)[25], WED_ZERO.lang.getInstruct().get(1)[26], JOptionPane.INFORMATION_MESSAGE, null, pValue, pValue[0]);\n if(selectedValue==null||(selectedValue.equals(pValue[3]))) {\n int res = JOptionPane.showConfirmDialog(null, WED_ZERO.lang.getInstruct().get(1)[27], WED_ZERO.lang.getInstruct().get(1)[12],\n JOptionPane.YES_NO_OPTION, JOptionPane.QUESTION_MESSAGE);\n if(res==JOptionPane.YES_OPTION) {\n return;\n } else {\n this.problemSolve(folderName, loader1, loader2);\n }\n } else if(selectedValue.equals(pValue[0])) {\n int res = JOptionPane.showConfirmDialog(null, WED_ZERO.lang.getInstruct().get(1)[28], WED_ZERO.lang.getInstruct().get(1)[12],\n JOptionPane.YES_NO_OPTION, JOptionPane.QUESTION_MESSAGE);\n if(res==JOptionPane.YES_OPTION) {\n this.replaceData(folderName, loader1, loader2);\n this.refresh();\n } else {\n this.problemSolve(folderName, loader1, loader2);\n }\n } else if(selectedValue.equals(pValue[1])) {\n this.renameFolder(folderName, loader1, loader2);\n this.refresh();\n } else if(selectedValue.equals(pValue[2])) {\n this.getFile(null);\n selectedValue = JOptionPane.showInputDialog(null,\n WED_ZERO.lang.getInstruct().get(1)[29]+\": \", WED_ZERO.lang.getInstruct().get(1)[25], JOptionPane.INFORMATION_MESSAGE, null, this.getListOfFileInArray(), Arrays.asList(this.getListOfFileInArray()).indexOf(folderName));\n if(selectedValue!=null) {\n this.merge(selectedValue.toString(), loader1, loader2);\n } else {\n this.problemSolve(folderName, loader1, loader2);\n }\n }\n }","private void escapeFromMaze() throws Exception {\n\t\tassert robot.distanceToObstacle(Direction.BACKWARD) != Integer.MAX_VALUE : \"Unexpected exit environment.\";\n\t\t\n\t\tswitch(robot.getCurrentDirection()){\n\t\t\tcase East:\n\t\t\t\tif(robot.getController().getMazeConfiguration().getMazecells().hasNoWall(robot.getCurrentPosition()[0], robot.getCurrentPosition()[1], CardinalDirection.East)\n\t\t\t\t\t\t&& !robot.getController().getMazeConfiguration().isValidPosition(robot.getCurrentPosition()[0]+1, robot.getCurrentPosition()[1])){\n\t\t\t\t\trobot.move(1, false);\n\t\t\t\t}\n\t\t\t\telse if(robot.getController().getMazeConfiguration().getMazecells().hasNoWall(robot.getCurrentPosition()[0], robot.getCurrentPosition()[1], CardinalDirection.North)){\n\t\t\t\t\trobot.rotate(Turn.RIGHT);\n\t\t\t\t\trobot.move(1, false);\n\t\t\t\t}else{\n\t\t\t\t\trobot.rotate(Turn.LEFT);\n\t\t\t\t\trobot.move(1, false);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase West:\n\t\t\t\tif(robot.getController().getMazeConfiguration().getMazecells().hasNoWall(robot.getCurrentPosition()[0], robot.getCurrentPosition()[1], CardinalDirection.West)\n\t\t\t\t\t\t&& !robot.getController().getMazeConfiguration().isValidPosition(robot.getCurrentPosition()[0]-1, robot.getCurrentPosition()[1])){\n\t\t\t\t\trobot.move(1, false);\n\t\t\t\t}\n\t\t\t\telse if (robot.getController().getMazeConfiguration().getMazecells().hasNoWall(robot.getCurrentPosition()[0], robot.getCurrentPosition()[1], CardinalDirection.North)){\n\t\t\t\t\trobot.rotate(Turn.LEFT);\n\t\t\t\t\trobot.move(1, false);\n\t\t\t\t}else{\n\t\t\t\t\trobot.rotate(Turn.RIGHT);\n\t\t\t\t\trobot.move(1, false);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase North:\n\t\t\t\tif(robot.getController().getMazeConfiguration().getMazecells().hasNoWall(robot.getCurrentPosition()[0], robot.getCurrentPosition()[1], CardinalDirection.North)\n\t\t\t\t\t\t&& !robot.getController().getMazeConfiguration().isValidPosition(robot.getCurrentPosition()[0], robot.getCurrentPosition()[1]-1)){\n\t\t\t\t\trobot.move(1, false);\n\t\t\t\t}\n\t\t\t\telse if (robot.getController().getMazeConfiguration().getMazecells().hasNoWall(robot.getCurrentPosition()[0], robot.getCurrentPosition()[1], CardinalDirection.East)){\n\t\t\t\t\trobot.rotate(Turn.LEFT);\n\t\t\t\t\trobot.move(1, false);\n\t\t\t\t}else{\n\t\t\t\t\trobot.rotate(Turn.RIGHT);\n\t\t\t\t\trobot.move(1, false);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase South:\n\t\t\t\tif(robot.getController().getMazeConfiguration().getMazecells().hasNoWall(robot.getCurrentPosition()[0], robot.getCurrentPosition()[1], CardinalDirection.South)\n\t\t\t\t\t\t&& !robot.getController().getMazeConfiguration().isValidPosition(robot.getCurrentPosition()[0], robot.getCurrentPosition()[1]+1)){\n\t\t\t\t\trobot.move(1, false);\n\t\t\t\t}\n\t\t\t\telse if (robot.getController().getMazeConfiguration().getMazecells().hasNoWall(robot.getCurrentPosition()[0], robot.getCurrentPosition()[1], CardinalDirection.West)){\n\t\t\t\t\trobot.rotate(Turn.LEFT);\n\t\t\t\t\trobot.move(1, false);\n\t\t\t\t}else{\n\t\t\t\t\trobot.rotate(Turn.RIGHT);\n\t\t\t\t\trobot.move(1, false);\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t}\n\t\t\n\t\t\n\t}","public static void solveMaze(String inputFile, String outputFile) {\r\n\r\n\t\ttry {\r\n\t\t\tGraph testGraph = new Graph(inputFile);\r\n\t\t\ttestGraph.breadthFirstSearch();\r\n\t\t\tPrintStream output;\r\n\t\t\toutput = new PrintStream(new FileOutputStream(outputFile));\r\n\t\t\toutput.print(testGraph.printMap());\r\n\t\t\toutput.close();\r\n\t\t} \r\n\t\tcatch (FileNotFoundException e) {\r\n\t\t\te.printStackTrace();\r\n\t\t}\r\n\t}","private static int askForGoMainMenu(String message){\n\t\tshowMessage(message);\n\t\tBufferedReader myReader = new BufferedReader(new InputStreamReader(System.in));\n\t\tint input;\n\n\t\tdo {\n\t\t\ttry {\n\t\t\t\tinput = Integer.parseInt(myReader.readLine());\n\n\t\t\t\tif ((input < 0) || (input>1)) {\n\t\t\t\t\tSystem.out.println(\"Please type 1 or 2.\\n\");\n\t\t\t\t}\n\n\t\t\t}catch (Exception e) {\n\t\t\t\tSystem.out.println(\"Character invalid. Choose 1 or 2.\\n\");\n\t\t\t\tinput = 0;\n\t\t\t}\n\n\n\t\t}\n\t\twhile ((input < 0) || (input>1));\n\n\t\treturn input;\n\n\t}","private boolean solve(int row, int col){\n\n if (col >= 9){\n return true;\n }\n\t\n\t\t\n\t\t// If the cell is not empty and the number is not preset\n\t\t//\tskip to the next number\n\t\tif( puzzle[row][col] != 0 ){\n\t\t\tif(row == 8){\n\t\t\t\tif(solve(0,col+1)){\n\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tif(solve(row+1,col)){\n\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn false;\n\t\t}\n\t\t \n\t\t\n\t // Find a valid number for the empty cell\n\t\tfor( int num = 1; num <= MAX_VALUE; num++ ){\n\t\t\t\n\t\t if( validate(row,col,num) )\n\t\t {\n\t\t \tpuzzle[row][col] = num ;\n\t\t\n\t\t \t\n\t\t \t// next number\t\t \t\n\t \t\tif(row == 8){\n\t\t\t\t\tif(solve(0,col+1)){\n\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t}else{\n\t\t\t\t\tif(solve(row+1,col)){\n\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t \t\t\n\t \t\t// No solution found\n\t \t\tpuzzle[row][col] = 0;\n\t\t }\n\t\t}\n\t\treturn false;\t\t\t\n\t\n\t}","private static List<Move> pathSolve(Level level){\n\t\tOptimisticMap optMap = new OptimisticMap(level);\n\t\t\n\t\tPoint dst = level.getExitPos();\n\t\t\n\t\t// Open nodes\n\t\tSortedMap<Integer, List<SolveNode>> nodes = new TreeMap<Integer, List<SolveNode>>();\n\t\t\n\t\t// Current costs to arrive to solve nodes\n\t\tint[][][] arrived = new int[level.getMapSize().x][level.getMapSize().y][Move.values().length];\n\t\tfor ( int x = 0 ; x < level.getMapSize().x ; x++ ){\n\t\t\tfor ( int y = 0 ; y < level.getMapSize().y ; y++ ){\n\t\t\t\tfor ( int d = 0 ; d < Move.values().length ; d++ ){\n\t\t\t\t\tarrived[x][y][d] = Integer.MAX_VALUE;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\t// Create initial nodes\n\t\t{\n\t\t\tPoint box = level.getBoxPos();\n\t\t\tPoint player = level.getPlayerPos();\n\t\t\tfor ( Move dir : Move.values()){\n\t\t\t\tPoint playerDst = dir.nextPosition(box);\n\t\t\t\tif ( level.isClearSafe(playerDst.x, playerDst.y)){\n\t\t\t\t\tList<Move> pathNoDesiredPlayerPosition = pathTo(level, player, box, playerDst);\n\t\t\t\t\tif ( pathNoDesiredPlayerPosition != null ){\n\t\t\t\t\t\tSolveNode node = new SolveNode();\n\t\t\t\t\t\tnode.moves = pathNoDesiredPlayerPosition;\n\t\t\t\t\t\tnode.box = (Point)box.clone();\n\t\t\t\t\t\tnode.playerDir = dir;\n\t\t\t\t\t\taddSolveNode(nodes, node, node.moves.size() + optMap.getValue(node.box.x, node.box.y));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\twhile ( nodes.isEmpty() == false ){\n\t\t\t// Get node to process\n\t\t\tSolveNode node = removeSolveNode(nodes);\n\t\t\tif ( node.box.equals(dst) ){\n\t\t\t\t// This is the best solution\n\t\t\t\treturn node.moves;\n\t\t\t}\n\t\t\t\n\t\t\t// Create new nodes trying to move the box in each direction\n\t\t\tfor ( Move dir : Move.values() ){\n\t\t\t\tSolveNode newNode = new SolveNode();\n\t\t\t\tnewNode.box = dir.nextPosition(node.box);\n\t\t\t\tnewNode.playerDir = dir.opposite();\n\t\t\t\t\n\t\t\t\t// First check if the box can be moved to that position (is clear)\n\t\t\t\tif ( level.isClearSafe(newNode.box.x, newNode.box.y) == false ){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Check if the player can move to the pushing position\n\t\t\t\tPoint player = node.playerDir.nextPosition(node.box);\n\t\t\t\tPoint playerDst = dir.opposite().nextPosition(node.box);\n\t\t\t\tList<Move> playerMoves = pathTo(level, player, node.box, playerDst);\n\t\t\t\tif ( playerMoves == null ){\n\t\t\t\t\t// The player can't move itself to the pushing position\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Check if the cost to arrive to the new node is less that the previous known\n\t\t\t\tif ( node.moves.size() + playerMoves.size() + 1 >= arrived[newNode.box.x][newNode.box.y][dir.index()] ){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tSystem.out.println(\"\" + newNode.box.x + \" \" + newNode.box.y);\n\t\t\t\t\n\t\t\t\t// Add the new node to the open nodes\n\t\t\t\tnewNode.moves.addAll(node.moves);\n\t\t\t\tnewNode.moves.addAll(playerMoves);\n\t\t\t\tnewNode.moves.add(dir);\n\t\t\t\taddSolveNode(nodes, newNode, newNode.moves.size() + optMap.getValue(newNode.box.x, newNode.box.y));\n\t\t\t\tarrived[newNode.box.x][newNode.box.y][dir.index()] = newNode.moves.size();\n\t\t\t}\n\t\t}\n\t\t\n\t\t// There is no solution\n\t\treturn null;\n\t}","public static void getInput() {\n\t\tselectOption();\n\t\tsc = new Scanner(System.in);\n\t userInput2 = sc.nextInt();\n\t \n\t switch (userInput2) {\n\t \tcase 1: System.out.print(\"Enter the number for the factorial function: \");\n\t \t\t\tsc = new Scanner(System.in);\n\t\t\t\t userInput2 = sc.nextInt();\n\t\t\t\t System.out.println(\"The factorial of \" + userInput2 + \" is \" + factorial(userInput2));\n\t\t\t\t getInput();\n\t\t \t\tbreak;\n\t \tcase 2: System.out.print(\"Enter the Fibonacci position: \");\n\t\t\t\t\tsc = new Scanner(System.in);\n\t\t\t\t userInput2 = sc.nextInt();\n\t\t\t\t System.out.println(\"The fibonacci number at position \" + userInput2 + \" is \" + fib(userInput2));\n\t\t\t\t getInput();\n\t\t \t\tbreak;\n\t \tcase 3: System.out.print(\"Enter the first number: \");\n\t\t\t\t\tsc = new Scanner(System.in);\n\t\t\t\t userInput2 = sc.nextInt();\n\t\t\t\t System.out.print(\"Enter the second number: \");\n\t\t\t\t sc = new Scanner(System.in);\n\t\t\t\t userInput3 = sc.nextInt();\n\t\t\t\t System.out.println(\"The GCD of the numbers \" + userInput2 + \" and \" + userInput3 + \" is \" + GCD(userInput2, userInput3));\n\t\t\t\t getInput();\n\t\t \t\tbreak;\n\t \tcase 4: System.out.print(\"Enter n: \");\n\t\t\t\t\tsc = new Scanner(System.in);\n\t\t\t\t userInput2 = sc.nextInt();\n\t\t\t\t System.out.print(\"Enter r: \");\n\t\t\t\t sc = new Scanner(System.in);\n\t\t\t\t userInput3 = sc.nextInt();\n\t\t\t\t System.out.println(userInput2 + \" choose \" + userInput3 + \" is \" + choose(userInput2, userInput3));\n\t\t\t\t getInput();\n\t\t \t\tbreak;\n\t \tcase 5: System.out.print(\"Enter n: \");\n\t\t\t\t\tsc = new Scanner(System.in);\n\t\t\t\t userInput2 = sc.nextInt();\n\t\t\t\t System.out.print(\"Enter k: \");\n\t\t\t\t sc = new Scanner(System.in);\n\t\t\t\t userInput3 = sc.nextInt();\n\t\t\t\t System.out.println(\"The Josephus of \" + userInput2 + \" and \" + userInput3 + \" is \" + josephus(userInput2, userInput3));\n\t\t\t\t getInput();\n\t\t \t\tbreak;\n\t \tcase 6: System.out.println(\"Ending program...\");\n \t\t\t\tSystem.exit(0);\n \t\t\t\tbreak;\n \t\tdefault: System.out.println(\"\\nPlease enter number between 1 and 6\\n\");\n\t \t\t\tgetInput();\n\t \t\t\tbreak;\n\t }\t\n\t}","public void generateMaze() {\n if (this.stateOfTheMaze != 0)\n throw new IllegalArgumentException(\"To generate the maze the state of it must be \\\"untouched grid\\\".\");\n Stack<Box> stack = new Stack<>();\n Random random = new Random();\n int randomRow = random.nextInt(this.grid.length);\n int randomColumn = random.nextInt(this.grid[randomRow].length);\n Box startBox = this.grid[randomRow][randomColumn];\n startBox.use();\n stack.push(startBox);\n while (!stack.isEmpty()) {\n Box aux = stack.peek();\n if (allAdjacentUsed(aux))\n stack.pop();\n else\n stack.push(movement(aux));\n }\n this.stateOfTheMaze++;\n }","public static void main(String[] args) {\n Scanner entrada = new Scanner(System.in);\n int funcao = 0;\n while(funcao < 1 || funcao > 3){\n //limpa a tela\n clrscr();\n System.out.println(\" Bem-vindo ao Sudoku!\\n\\n Digite o numero da tecnica a ser utilizada:\\n\");\n System.out.printf(\" 1 - Busca Informada (Best-first/guloso)\\n 2 - Busca Desinformada (Em profundidade)\\n\"\n + \" 3 - Busca Desinformada (Em largura)\\n\\n-> \");\n funcao = entrada.nextInt();\n }\n //Usuario escolhe nivel de dificuldade do sudoku (5 exemplos)\n int nivel = 0;\n while(nivel < 1 || nivel > 5){\n System.out.println(\"\\n Digite o nivel de dificuldade do sudoku:\\n\");\n System.out.printf(\" 1 - Muito facil\\n 2 - Facil\\n 3 - Medio\\n 4 - Dificil\\n 5 - Muito Dificil\\n\\n-> \");\n nivel = entrada.nextInt();\n }\n //Usuario define velocidade de execução do algoritmo\n int execSpeed = 1;\n while(execSpeed != 0 && execSpeed != 5 && execSpeed != 500 && execSpeed != 1000){\n System.out.printf(\"\\n Digite o tempo de espera entre as iteracoes(ms):\\n\\n\");\n System.out.printf(\" 0 - Quero somente a matriz inicial e final\\n \"\n + \"5 - Curto\\n 500 - Medio\\n 1000 - Longo\\n\\n-> \");\n execSpeed = entrada.nextInt();\n }\n \n final int tamanho = 9;\n int contador = 0; //numero de iteracoes\n \n //Exemplos\n //sudoku quase completo\n int[][] sudokuQuaseResolvido = {\n {8, 6, 2, 3, 1, 7, 4, 9, 5},\n {7, 1, 5, 4, 8, 9, 2, 6, 0},\n {4, 3, 9, 5, 6, 2, 7, 1, 8},\n {5, 9, 7, 8, 3, 1, 6, 2, 4},\n {3, 8, 0, 6, 2, 4, 5, 7, 9},\n {6, 2, 4, 9, 7, 5, 3, 8, 1},\n {2, 5, 3, 7, 9, 8, 1, 4, 6},\n {9, 7, 6, 1, 4, 3, 8, 5, 2},\n {0, 4, 8, 2, 5, 6, 9, 3, 0}};\n //sudoku facil\n int[][] sudokuFacil = {\n {4, 3, 5, 0, 0, 9, 7, 8, 1},\n {0, 0, 2, 5, 7, 1, 4, 0, 3},\n {1, 9, 7, 8, 3, 4, 0, 6, 2},\n {8, 2, 6, 1, 9, 5, 3, 4, 7},\n {3, 7, 0, 0, 8, 2, 0, 1, 5},\n {9, 5, 1, 7, 4, 3, 6, 2, 8},\n {5, 1, 9, 3, 2, 6, 8, 7, 4},\n {2, 4, 8, 9, 5, 7, 1, 3, 0},\n {0, 6, 0, 4, 0, 8, 2, 5, 9}};\n //sudoku medio\n int[][] sudokuMedio = {\n {8, 6, 0, 3, 0, 0, 0, 0, 0},\n {0, 1, 5, 4, 0, 0, 0, 0, 0},\n {0, 3, 9, 5, 0, 2, 0, 0, 0},\n {0, 0, 0, 8, 0, 0, 6, 2, 0},\n {0, 0, 0, 6, 0, 4, 5, 0, 0},\n {6, 2, 0, 9, 7, 5, 0, 8, 1},\n {0, 0, 3, 7, 9, 8, 0, 0, 6},\n {9, 0, 6, 1, 4, 0, 0, 5, 0},\n {0, 0, 8, 2, 0, 6, 0, 3, 7}};\n //sudoku dificil\n int[][] sudokuDificil = {\n {1, 0, 0, 0, 0, 0, 0, 0, 5},\n {0, 9, 8, 5, 0, 3, 7, 4, 0},\n {0, 4, 5, 0, 0, 0, 6, 1, 0},\n {0, 1, 0, 0, 9, 0, 0, 3, 0},\n {0, 0, 0, 8, 0, 1, 0, 0, 0},\n {0, 8, 0, 0, 3, 0, 0, 9, 0},\n {0, 2, 7, 0, 0, 0, 3, 6, 0},\n {0, 3, 1, 9, 0, 6, 4, 2, 0},\n {9, 0, 0, 0, 0, 0, 0, 0, 8}};\n //sudoku mais dificil\n int[][] sudokuMuitoDificil = {\n {0, 0, 0, 2, 0, 7, 0, 0, 0},\n {4, 1, 0, 6, 0, 8, 0, 9, 7},\n {6, 0, 0, 0, 0, 0, 0, 0, 2},\n {0, 3, 0, 0, 6, 0, 0, 4, 0},\n {9, 0, 0, 5, 0, 1, 0, 0, 3},\n {0, 0, 0, 0, 0, 0, 0, 0, 0},\n {1, 0, 0, 0, 0, 0, 0, 0, 8},\n {5, 9, 0, 7, 8, 4, 0, 1, 6},\n {7, 2, 0, 0, 0, 0, 0, 5, 9}};\n \n //cria uma matriz que na vdd e um sudoku.\n Matriz matriz = new Matriz();\n //copia algum exemplo inicial de sudoku para a matriz, de acordo com a escolha do usuario\n switch (nivel){\n case 1:\n matriz.copiaMatriz(sudokuQuaseResolvido);\n break;\n case 2:\n matriz.copiaMatriz(sudokuFacil);\n break;\n case 3:\n matriz.copiaMatriz(sudokuMedio);\n break;\n case 4:\n matriz.copiaMatriz(sudokuDificil);\n break;\n case 5:\n matriz.copiaMatriz(sudokuMuitoDificil);\n break;\n }\n //limpa tela e imprime inicial = start\n clrscr();\n System.out.println(\"Estado inicial...\");\n matriz.printMatriz();\n for(int i = 0; i < 2; i++){\n if(i!=0)\n System.out.print(\"Pressione enter para iniciar\");\n entrada.nextLine();\n }\n clrscr();\n System.out.println(\"Matriz inicial\");\n matriz.printMatriz();\n \n //Tempo de execucao\n long tempoInicio = System.currentTimeMillis();\n \n //a partir do algoritmo de busca em profundidade passado no slide 30 da aula 6\n //define as pilhas open e close para os próximo e visitados respectivamente \n if(funcao != 3){//se nao for busca em largura\n Stack<Matriz> openS = new Stack<>();\n Stack<Matriz> closedS = new Stack<>();\n //open = [start]\n openS.add(matriz);\n \n while (!openS.isEmpty()) {\n int x = -1, y = -1;\n //x = pop\n Matriz matriz1 = openS.pop();\n //verifica se existem espacos em branco, ou seja iguais 0 na matriz\n if(matriz1.proximoBranco()!= null){\n x = matriz1.proximoBranco()[0];\n y = matriz1.proximoBranco()[1];\n }\n //x é objetivo retorne sucesso\n if (matriz1.completa()) {\n if(execSpeed != 0)\n clrscr();\n System.out.println(\"Matriz resolvida\");\n matriz1.printMatriz();\n contador++;\n break;\n } else {\n if (x >= 0 && y >= 0) {\n //gera os filhos\n for (int i = 1; i <= tamanho; i++) {\n Matriz copia = new Matriz();\n //cria matriz de copia\n copia.copiaMatriz(matriz1);\n\n if(funcao == 2)\n /*busca desinformada gera de 1 a 9 todos os filhos */ \n copia.set(x, y, i);\n else{\n //busca informada: qtadeDeNumeros gera a quantidades de numeros que existem \n //para cada numero de 1 a 9 \n copia.qtadeDeNumeros();\n //ordena o vetor de menor para maior em quantidade de aparicoes\n copia.menorEmQuantidade();\n //seta a partir do numero com maior numero de aparicoes\n copia.set(x, y, copia.getArray().get(i-1).getKey());\n }\n /*comandos p printar filhos\n System.out.println(\"Matriz NAO resolvida\");\n copia.printMatriz();\n se nao tiver sido vizitada e se nao tiver conflitos, adiciona na open */\n if ((!openS.contains(copia) || !closedS.contains(copia)) && copia.semConflitos()){\n openS.add(copia);\n }\n }\n //push(closed, X) \n closedS.add(matriz1);\n } else {\n //push(closed, X) caso nao tenha espacos vazios e nao seja sudoku resolvido\n closedS.add(matriz1);\n }\n }\n try { Thread.sleep (execSpeed); } catch (InterruptedException ex) {}\n if (execSpeed != 0){\n //limpa tela\n clrscr();\n //imprime matriz que passou\n System.out.println(\"Matriz Parcial\");\n matriz1.printMatriz();\n System.out.println(\"Iteracao: \"+contador+\" Tempo: \"\n +((System.currentTimeMillis()-tempoInicio)/1000)+\" segundo(s)\");\n }\n contador++;\n }\n //funcao == 3 (Busca em Largura)\n } else {\n //filas\n Queue<Matriz> openQ = new LinkedList<>();\n Queue<Matriz> closedQ = new LinkedList<>();\n //open = [start]\n openQ.add(matriz);\n \n while (!openQ.isEmpty()) {\n int x = -1, y = -1;\n Matriz matriz1 = openQ.remove();\n //verifica se existem espacos em branco, ou seja iguais 0 na matriz\n if(matriz1.proximoBranco()!= null){\n x = matriz1.proximoBranco()[0];\n y = matriz1.proximoBranco()[1];\n }\n //x é objetivo retorne sucesso\n if (matriz1.completa()) {\n if(execSpeed != 0)\n clrscr();\n System.out.println(\"Matriz resolvida\");\n matriz1.printMatriz();\n contador++;\n break;\n }\n else {\n if (x >= 0 && y >= 0) {\n //gera os filhos\n for (int i = 1; i <= tamanho; i++) {\n Matriz copia = new Matriz();\n //cria matriz de copia\n copia.copiaMatriz(matriz1);\n\n /*busca desinformada gera de 1 a 9 todos os filhos */ \n copia.set(x, y, i);\n /*comandos p printar filhos\n System.out.println(\"Matriz NAO resolvida\");\n copia.printMatriz();\n se nao tiver sido vizitada e se nao tiver conflitos, adiciona na open */\n if ((!openQ.contains(copia) || !closedQ.contains(copia)) && copia.semConflitos()){\n openQ.add(copia);\n }\n }\n //push(closed, X) \n closedQ.add(matriz1);\n } else {\n //push(closed, X) caso nao tenha espacos vazios e nao seja sudoku resolvido\n closedQ.add(matriz1);\n }\n }\n try { Thread.sleep (execSpeed); } catch (InterruptedException ex) {}\n if (execSpeed != 0){\n //limpa tela\n clrscr();\n //imprime matriz que passou\n System.out.println(\"Matriz Parcial\");\n matriz1.printMatriz();\n System.out.println(\"Iteracao: \"+contador+\" Tempo: \"\n +((System.currentTimeMillis()-tempoInicio)/1000)+\" segundo(s)\");\n }\n contador++;\n }\n }\n //fim da execucao. Sudoku resolvido\n System.out.println(\"Sudoku Resolvido\");\n if((System.currentTimeMillis()-tempoInicio) < 60000){\n System.out.println(\"Iteracoes: \"+contador+\" Tempo Total: \"\n +((System.currentTimeMillis()-tempoInicio)/1000)+\" segundo(s)\");\n } else {\n System.out.println(\"Iteracoes: \"+contador+\" Tempo Total: \"\n +((System.currentTimeMillis()-tempoInicio)/1000/60)+\" minuto(s) e \"\n +((System.currentTimeMillis()-tempoInicio)/1000%60)+\" segundo(s)\");\n }\n }","int chooseMove();","public void makeMove(Board board, Scanner input) {\n boolean stillNeedsToMove = true;\n while (stillNeedsToMove) {\n System.out.println(\"Please select a coordinate for a box to make a choice in: \");\n String coordinates = input.next().trim();\n if (coordinates.length() != 2) {\n System.out.println(\"Those were invalid coordinates!\");\n continue;\n }\n int x = Integer.parseInt(coordinates.substring(0, 1));\n int y = Integer.parseInt(coordinates.substring(1, 2));\n // Check if that box has any moves left\n Box box = board.getBoxAtCoordinate(x, y);\n if (box == null) {\n System.out.println(\"Invalid coordinates, please try again!\");\n continue;\n }\n if (!box.hasOwner()) {\n System.out.println(\"That box already has been completed!\");\n continue;\n }\n System.out.println(\"Please select a line to take (LEFT, TOP, RIGHT, BOTTOM): \");\n String side = input.next().toLowerCase();\n if (box.isSideTaken(side)) {\n System.out.println(\"That side is already taken, please try making the move again!\");\n continue;\n }\n // Take the move and check if now owner\n boolean nowOwner = box.setSide(side, BoxOwner.HUMAN);\n if (nowOwner) {\n System.out.println(\"You now own this box!\");\n }\n // Check and see if you need to update the siblings side\n Box siblingToUpdate = board.getSiblingBoxBasedOnCoordinateAndMove(x, y, side);\n if (siblingToUpdate != null) {\n boolean owner;\n // Set opposite side in sibling\n if (side.equals(\"left\")) {\n owner = siblingToUpdate.setSide(\"right\", BoxOwner.HUMAN);\n } else if (side.equals(\"top\")) {\n owner = siblingToUpdate.setSide(\"bottom\", BoxOwner.HUMAN);\n } else if (side.equals(\"right\")) {\n owner = siblingToUpdate.setSide(\"left\", BoxOwner.HUMAN);\n } else {\n owner = siblingToUpdate.setSide(\"top\", BoxOwner.HUMAN);\n }\n\n if (owner) {\n System.out.println(\"You now own the sibling box as well\");\n }\n }\n // End the turn for the user\n stillNeedsToMove = false;\n }\n // Print Board\n board.printBoard();\n }","private void createMaze(Tile currentTile) {\n\n while (numberOfCellsVisited < CAST_WIDTH * CAST_HEIGHT) {\n\n // Get coordinates of current tile and set as visited\n int currentX = currentTile.getPosition().getX();\n int currentY = currentTile.getPosition().getY();\n tempMap[currentY][currentX].setVisited(true);\n\n // Begin neighbourhood scan\n ArrayList<Integer> neighbours = new ArrayList<>();\n\n // If a neighbour is not visited and its projected position is within bounds, add it to the list of valid neighbours\n // North neighbour\n if (currentY - 1 >= 0) {\n if (!tempMap[currentY - 1][currentX].isVisited()) //Northern neighbour unvisited\n neighbours.add(0);\n }\n //Southern neighbour\n if (currentY + 1 < CAST_HEIGHT) { //y index if increased is not greater than height of the chamber\n if (!tempMap[currentY + 1][currentX].isVisited()) //Northern neighbour unvisited\n neighbours.add(1);\n }\n //Eastern neighbour\n if (currentX + 1 < CAST_WIDTH) { //check edge case\n if (!tempMap[currentY][currentX + 1].isVisited()) { //check if visited\n neighbours.add(2);\n }\n }\n //Western neighbour\n if (currentX - 1 >= 0) {\n if (!tempMap[currentY][currentX - 1].isVisited()) {\n neighbours.add(3);\n }\n }\n if (!neighbours.isEmpty()) {\n\n //generate random number between 0 and 3 for direction\n Random rand = new Random();\n boolean randomizer;\n int myDirection;\n do {\n myDirection = rand.nextInt(4);\n randomizer = neighbours.contains(myDirection);\n } while (!randomizer);\n\n //knock down wall\n switch (myDirection) {\n case 0 -> { // North\n tempMap[currentY][currentX].getPathDirection()[0] = true;\n currentTile = tempMap[currentY - 1][currentX];\n }\n case 1 -> { // South\n tempMap[currentY][currentX].getPathDirection()[1] = true;\n currentTile = tempMap[currentY + 1][currentX];\n }\n case 2 -> { // East\n tempMap[currentY][currentX].getPathDirection()[2] = true;\n currentTile = tempMap[currentY][currentX + 1];\n }\n case 3 -> { // West\n tempMap[currentY][currentX].getPathDirection()[3] = true;\n currentTile = tempMap[currentY][currentX - 1];\n }\n }\n\n mapStack.push(currentTile);\n numberOfCellsVisited++;\n } else {\n currentTile = mapStack.pop(); //backtrack\n }\n }\n\n castMaze(tempMap[0][0], -1);\n }","public void showLoadMaze(String message);","public boolean initiateMovePrompt(MapPanel caller) {\n\t\tif(activePath == null || !pf.isValidPath(activePath))\n\t\t\treturn false;\n\t\tlog.log(\"Now prompting player for move.\");\n\t\tMapViewListener l = caller.getMapViewListener();\n\t\tl.setStatus(GameState.PLAYER_CONFIRMING_MOVE);\n\t\tattackableFromHere = canAttackFromDestination();\n\t\twithinRange = findSquaresWithinAtkRange();\n\t\tl.setMoveMenu(caller, attackableFromHere.size() != 0);\n\t\treturn true;\n\t}","void setMaze(IMaze maze);","public void MakeMaze() {\n\n\t\t// ints for random x , y and direction\n\t\tint rx = 0;\n\t\tint ry = 0;\n\t\tint rd = 0;\n\t\tgenMaze = true;\n\n\t\t// c used to count tries, if there are too many the main loop jumps to\n\t\t// the end of the function\n\t\tint c = 0;\n\n\t\t// fill the map with walls\n\t\tfor (int ix = 0; ix < max_x; ix++) {\n\t\t\tfor (int iy = 0; iy < max_y; iy++) {\n\t\t\t\tmap[ix][iy] = 1;\n\t\t\t}\n\t\t}\n\n\t\t// fill the cell array with unvisited cells\n\t\tfor (int ix = 0; ix < maxCells_x; ix++) {\n\t\t\tfor (int iy = 0; iy < maxCells_y; iy++) {\n\t\t\t\tcell[ix][iy] = 0;\n\t\t\t}\n\t\t}\n\n\t\t// choose a \"random\" x,y pair. centre of screen used here instead\n\t\trx = maxCells_x / 2;\n\t\try = maxCells_y / 2;\n\n\t\t// mark cell visited\n\t\tcell[rx][ry] = 1;\n\n\t\t// count cells\n\t\tcountCells();\n\n\t\t// start main generator loop\n\t\twhile (visitedCells < totalCells) {\n\n\t\t\tc++;\n\n\t\t\tif (c > magicNumber) {\n\t\t\t\tgenMaze = false;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\trd = rand.nextInt(4);\n\n\t\t\t// dig tunnels\n\n\t\t\t// up\n\n\t\t\tif (genMaze) {\n\t\t\t\tif (rd == 0) { // up\n\t\t\t\t\tif (inRange(rx * CELL_RAD, ry * CELL_RAD - 1) == 1\n\t\t\t\t\t\t\t&& (cell[rx][ry - 1]) == 0 || rand.nextInt(7) == 7) {\n\t\t\t\t\t\tclink(rx * CELL_RAD, ry * CELL_RAD, rx * CELL_RAD,\n\t\t\t\t\t\t\t\t(ry - 1) * CELL_RAD);\n\t\t\t\t\t\try--;\n\t\t\t\t\t} else {\n\t\t\t\t\t\twhile (true) {\n\t\t\t\t\t\t\trx = rand.nextInt(maxCells_x);\n\t\t\t\t\t\t\try = rand.nextInt(maxCells_y);\n\t\t\t\t\t\t\tif (cell[rx][ry] == 1) {\n\t\t\t\t\t\t\t\tbreak;\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} else if (rd == 1) { // down\n\t\t\t\t\tif (inRange(rx + CELL_RAD, ry * CELL_RAD + 1) == 1\n\t\t\t\t\t\t\t&& (cell[rx][ry + 1] == 0 || rand.nextInt(7) == 7)) {\n\t\t\t\t\t\tclink(rx * CELL_RAD, (ry) * CELL_RAD, rx * CELL_RAD,\n\t\t\t\t\t\t\t\t(ry + 1) * CELL_RAD);\n\t\t\t\t\t\try++;\n\t\t\t\t\t} else {\n\t\t\t\t\t\twhile (true) {\n\t\t\t\t\t\t\trx = rand.nextInt(maxCells_x);\n\t\t\t\t\t\t\try = rand.nextInt(maxCells_y);\n\t\t\t\t\t\t\tif (cell[rx][ry] == 1) {\n\t\t\t\t\t\t\t\tbreak;\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} else if (rd == 2) { // left\n\t\t\t\t\tif (inRange((rx * CELL_RAD) - 1, ry * CELL_RAD) == 1\n\t\t\t\t\t\t\t&& (cell[rx - 1][ry] == 0 || rand.nextInt(7) == 7)) {\n\t\t\t\t\t\tclink(rx * CELL_RAD, ry * CELL_RAD,\n\t\t\t\t\t\t\t\t(rx - 1) * CELL_RAD, ry * CELL_RAD);\n\t\t\t\t\t\trx--;\n\t\t\t\t\t} else {\n\t\t\t\t\t\twhile (true) {\n\t\t\t\t\t\t\trx = rand.nextInt(maxCells_x);\n\t\t\t\t\t\t\try = rand.nextInt(maxCells_y);\n\t\t\t\t\t\t\tif (cell[rx][ry] == 1) {\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t} else if (rd == 3) { // right\n\t\t\t\t\tif (inRange(rx * CELL_RAD + 1, ry * CELL_RAD) == 1\n\t\t\t\t\t\t\t&& (cell[rx + 1][ry]) == 0 || rand.nextInt(7) == 7) {\n\t\t\t\t\t\tclink((rx) * CELL_RAD, ry * CELL_RAD, (rx + 1)\n\t\t\t\t\t\t\t\t* CELL_RAD, ry * CELL_RAD);\n\t\t\t\t\t\trx++;\n\t\t\t\t\t} else {\n\t\t\t\t\t\twhile (true) {\n\t\t\t\t\t\t\trx = rand.nextInt(maxCells_x);\n\t\t\t\t\t\t\try = rand.nextInt(maxCells_y);\n\t\t\t\t\t\t\tif (cell[rx][ry] == 1) {\n\t\t\t\t\t\t\t\tbreak;\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\t// mark the cell as visited\n\n\t\t\t\tcell[rx][ry] = 1;\n\n\t\t\t\t// place a \"floor\" tile on the map where the maze cell should be\n\t\t\t\tmap[rx * CELL_RAD][ry * CELL_RAD] = 0;\n\n\t\t\t\t// count the cells to establish how many have been visited\n\t\t\t\tcountCells();\n\t\t\t}\n\t\t}\n\n\t\tfor (int ix = 0; ix < maxCells_x; ix++) {\n\t\t\tfor (int iy = 0; iy < maxCells_y; iy++) {\n\t\t\t\tif (cell[ix][iy] == 1) {\n\t\t\t\t\tmap[ix * CELL_RAD][iy * CELL_RAD] = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}"],"string":"[\n \"public static void userSelection(){\\n\\t\\tint selection;\\n\\t\\tScanner input = new Scanner(System.in);\\n\\t\\tSystem.out.println(\\\"Which program would you like to run?\\\");\\n\\t\\tselection=input.nextInt();\\n\\n\\t\\tif(selection == 1)\\n\\t\\t\\tmazeUnion();\\n\\t\\tif(selection == 2)\\n\\t\\t\\tunionPathCompression();\\n\\t\\tif(selection == 3)\\n\\t\\t\\tmazeHeight();\\n\\t\\tif(selection == 4)\\n\\t\\t\\tmazeSize();\\n\\t\\tif(selection == 5)\\n\\t\\t\\tsizePathCompression();\\n\\t}\",\n \"public void showSolveMaze(String message);\",\n \"public static void main(String[] args) throws Exception {\\n\\n String[] options=new String[2];\\n options[0]=\\\"Smart\\\";\\n options[1]=\\\"Dummy\\\";\\n String choice=\\\"\\\";\\n String availableChars[] = {\\\"5x5maze.txt\\\",\\\"7x7maze.txt\\\",\\\"8x8maze.txt\\\",\\\"9x9maze.txt\\\",\\\"10x10maze.txt\\\",\\\"12x12maze.txt\\\"};\\n\\n int choiceG = JOptionPane.showOptionDialog(JOptionPane.getRootFrame(),\\n \\\"Would you like to use the smart or dummy solution?\\\",\\n \\\"Flow Free solver\\\",0,\\n JOptionPane.INFORMATION_MESSAGE,null,options,null\\n );\\n if(choiceG==0){\\n choice = (String) JOptionPane.showInputDialog(JOptionPane.getRootFrame(),\\n \\\"Which puzzle size would you like to solve?\\\",\\n \\\"Choose puzzle\\\",\\n JOptionPane.PLAIN_MESSAGE,\\n null,\\n availableChars,\\n 2);\\n try{\\n int[][] numberedMap=loadMap(choice);\\n Node[] map=linkNodes(numberedMap);\\n height=numberedMap.length;\\n width=numberedMap[0].length;\\n\\n FlowDrawer.getInstance();\\n FlowDrawer.setBoard(numberedMap);\\n FlowFinder f=new FlowFinder(numberedMap,map,false);\\n }\\n catch(Exception e){System.out.println(e+\\\" \\\"+e.getStackTrace()[0].getLineNumber());}\\n }\\n else{\\n choice = (String) JOptionPane.showInputDialog(JOptionPane.getRootFrame(),\\n \\\"Which puzzle size would you like to solve?\\\",\\n \\\"Choose puzzle\\\",\\n JOptionPane.PLAIN_MESSAGE,\\n null,\\n availableChars,\\n 2);\\n try{\\n int[][] numberedMap=loadMap(choice);\\n Node[] map=linkNodes(numberedMap);\\n height=numberedMap.length;\\n width=numberedMap[0].length;\\n\\n FlowDrawer.getInstance();\\n FlowDrawer.setBoard(numberedMap);\\n FlowFinder f=new FlowFinder(numberedMap,map,true);\\n }\\n catch(Exception e){System.out.println(e+\\\" \\\"+e.getStackTrace()[0].getLineNumber());}\\n }\\n\\n\\n\\n }\",\n \"@Override\\n\\t\\t\\tpublic void run() \\n\\t\\t\\t{\\n\\t\\t\\t\\tif(!(mazeCollection.containsKey(paramArray[0])))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tc.passError(\\\"Maze doesn't exist\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t/*\\n\\t\\t\\t\\t//if solution for this maze exists\\n\\t\\t\\t\\tif(mazeSolutions.containsKey(mazeCollection.get(paramArray[0])))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tc.passSolve(\\\"Solution for \\\"+paramArray[0]+ \\\" is ready\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t*/\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(paramArray[1].toString().equals(\\\"bfs\\\"))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tMazeAdapter ms=new MazeAdapter(mazeCollection.get(paramArray[0]));\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tSearcher<Position> bfs=new BFS<Position>();\\n\\t\\t\\t\\t\\tSolution<Position> sol=bfs.search(ms);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t//check if solution for the maze already exists, if so, replace it with the new one\\n\\t\\t\\t\\t\\tif(mazeSolutions.containsKey(mazeCollection.get(paramArray[0]))) {\\n\\t\\t\\t\\t\\t\\tmazeSolutions.remove(mazeCollection.get(paramArray[0]));\\n\\t\\t\\t\\t\\t\\tmazeSolutions.put(mazeCollection.get(paramArray[0]), sol);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tmazeSolutions.put(mazeCollection.get(paramArray[0]), sol);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tc.passSolve(\\\"Solution for \\\"+paramArray[0]+ \\\" is ready\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if(paramArray[1].toString().equals(\\\"dfs\\\"))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tMazeAdapter ms=new MazeAdapter(mazeCollection.get(paramArray[0]));\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tSearcher<Position> dfs=new DFS<Position>();\\n\\t\\t\\t\\t\\tSolution<Position> sol=dfs.search(ms);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t//check if solution for the maze already exists, if so, replace it with the new one\\n\\t\\t\\t\\t\\tif(mazeSolutions.containsKey(mazeCollection.get(paramArray[0]))) {\\n\\t\\t\\t\\t\\t\\tmazeSolutions.remove(mazeCollection.get(paramArray[0]));\\n\\t\\t\\t\\t\\t\\tmazeSolutions.put(mazeCollection.get(paramArray[0]), sol);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tmazeSolutions.put(mazeCollection.get(paramArray[0]), sol);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tc.passSolve(\\\"Solution for \\\"+paramArray[0]+ \\\" is ready\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tc.passError(\\\"Invalid algorithm\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t}\",\n \"private void solve(int x, int y, boolean draw) {\\n \\t\\t// these are the walls of the maze, maze solver should not go beyond\\n \\t\\t// walls\\n \\t\\t// if (x == 0 || y == 0 || x == N + 1 || y == N + 1) {\\n \\t\\t// return;\\n \\t\\t// }\\n \\n \\t\\t// if we have already visited this position\\n \\t\\t// or if deep levels of the recursion have found the target\\n \\t\\tif (foundTarget || visited[x][y])\\n \\t\\t\\treturn;\\n \\n \\t\\t// this position is new, mark it as visited\\n \\t\\tvisited[x][y] = true;\\n \\n \\t\\tif (draw) {\\n \\t\\t\\t// Draw a blue dot to show we have been here\\n \\t\\t\\tStdDraw.setPenColor(StdDraw.BLUE);\\n \\t\\t\\tStdDraw.filledCircle(x + 0.5, y + 0.5, 0.25);\\n \\t\\t\\tStdDraw.show(SOLVER_SPEED);\\n \\t\\t}\\n \\n \\t\\t// if we have reached the maze solve target\\n \\t\\tif (x == target.x && y == target.y) {\\n \\t\\t\\tfoundTarget = true;\\n \\t\\t}\\n \\n \\t\\t// Try go another place\\n \\t\\tif (!north[x][y])\\n \\t\\t\\tsolve(x, y + 1, draw);\\n \\t\\tif (!east[x][y])\\n \\t\\t\\tsolve(x + 1, y, draw);\\n \\t\\tif (!south[x][y])\\n \\t\\t\\tsolve(x, y - 1, draw);\\n \\t\\tif (!west[x][y])\\n \\t\\t\\tsolve(x - 1, y, draw);\\n \\n \\t\\tif (foundTarget)\\n \\t\\t\\treturn;\\n \\n \\t\\tif (draw) {\\n \\t\\t\\t// Draw a grey dot to show we have backtracked\\n \\t\\t\\tStdDraw.setPenColor(StdDraw.GRAY);\\n \\t\\t\\tStdDraw.filledCircle(x + 0.5, y + 0.5, 0.25);\\n \\t\\t\\tStdDraw.show(SOLVER_SPEED);\\n \\t\\t}\\n \\t}\",\n \"public void solveMaze() throws MazeException {\\n\\n long startTime = System.currentTimeMillis();\\n List<Maze.Room> solution = path();\\n long endTime = System.currentTimeMillis();\\n\\n double timeToSolve = (endTime - startTime) / 1000.0;\\n\\n setSolution(Optional.<List<Maze.Room>>of(solution));\\n setTimeToSolve(Optional.<Double>of(timeToSolve));\\n setSolved(true);\\n }\",\n \"public static void main( String [ ] args )\\r\\n {\\r\\n \\r\\n \\t\\r\\n \\t\\r\\n \\tint maze_row=0;\\r\\n \\tint maze_column=0;\\r\\n \\t\\r\\n\\t\\t\\r\\n\\t\\tScanner type = new Scanner(System.in);\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t\\tdo\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\ttry \\r\\n\\t\\t\\t\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tSystem.out.print(\\\"Please enter number of row between 1 and 20: \\\");\\r\\n\\t\\t\\t\\tmaze_row = Integer.valueOf(type.next());\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tcatch (NumberFormatException e)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\t//System.out.println(\\\"Input didn't match with the requirement: Try Again\\\");\\r\\n\\t\\t\\t\\tmaze_row=21;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\twhile(maze_row>20 || maze_row<1);\\r\\n\\t\\tdo\\r\\n\\t\\t{\\r\\n\\t\\ttry \\r\\n\\t\\t\\r\\n\\t\\t{\\r\\n\\t\\t\\tSystem.out.print(\\\"Please enter number of column between 1 and 20: \\\");\\r\\n\\t\\t\\tmaze_column = Integer.valueOf(type.next());\\r\\n\\t\\t}\\r\\n\\t\\tcatch (NumberFormatException e)\\r\\n\\t\\t{\\r\\n\\t\\t\\t//System.out.println(\\\"Input didn't match with the requirement: Try Again\\\");\\r\\n\\t\\t\\tmaze_column=21;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\t}\\r\\n\\twhile(maze_column>20 ||maze_column<1);\\r\\n\\t\\t\\r\\n\\t\\ttype.close();\\r\\n\\t\\tSystem.out.println();\\r\\n \\tcreateMaze(maze_row,maze_column);\\r\\n \\tshowMaze();\\r\\n \\t\\r\\n \\t\\r\\n \\t\\r\\n \\t\\r\\n \\t\\r\\n \\t\\r\\n \\t\\r\\n \\t\\r\\n \\t/* int NumElements = 128;\\r\\n int NumInSameSet = 16;\\r\\n\\r\\n DisjSets ds = new DisjSets( NumElements );\\r\\n int set1, set2;\\r\\n\\r\\n for( int k = 1; k < NumInSameSet; k *= 2 )\\r\\n {\\r\\n for( int j = 0; j + k < NumElements; j += 2 * k )\\r\\n {\\r\\n set1 = ds.find( j );\\r\\n set2 = ds.find( j + k );\\r\\n ds.union( set1, set2 );\\r\\n }\\r\\n }\\r\\n\\r\\n for( int i = 0; i < NumElements; i++ )\\r\\n {\\r\\n System.out.print( ds.find( i )+ \\\"*\\\" );\\r\\n if( i % NumInSameSet == NumInSameSet - 1 )\\r\\n System.out.println( );\\r\\n }\\r\\n System.out.println( );*/\\r\\n }\",\n \"public static void pathMethod (int x, int y, int rows, int columns, int startPointX, int startPointY, int endPointX, int endPointY, String [][]copyArray, String [][]realArray, int decider) throws Exception{ \\r\\n \\r\\n String up = copyArray[y-1][x];\\r\\n String down = copyArray[y+1][x];\\r\\n String right = copyArray[y][x+1]; //moves the coordinate up one, down one, right one, left one and stores it into up down left right; \\r\\n String left = copyArray[y][x-1];\\r\\n \\r\\n if(up.equals(\\\"X\\\")||down.equals(\\\"X\\\")||right.equals(\\\"X\\\")||left.equals(\\\"X\\\")){ //if up right left or down is equal to the endpoint, the maze is solvable, and we can now print the final array\\r\\n System.out.println(\\\"\\\\nThe maze is solvable!\\\");\\r\\n// printFinalArray(realArray, counter, xvalues, yvalues); //solution is found already - sends back to another method to print final solution\\r\\n regenerate(decider); //then sends to regenerate method where it asks if user would like to create another maze\\r\\n }\\r\\n \\r\\n else if(copyArray[startPointY+1][startPointX].equals(\\\"B\\\")&©Array[startPointY-1][startPointX].equals(\\\"B\\\")&©Array[startPointY][startPointX+1].equals(\\\"B\\\")&©Array[startPointY][startPointX-1].equals(\\\"B\\\")){\\r\\n \\r\\n System.out.println(\\\"\\\\nSorry, your maze is unsolvable.\\\\n\\\\n\\\"); //if at the start point we cannot go up down left or right - no possible moves - not solvable - end of maze \\r\\n regenerate(decider); //call the method that gives users the option to recreate the maze if it was unsolvable \\r\\n } \\r\\n \\r\\n else if(up.equals(\\\"O\\\")){ //if the coordinate in the up direction is O\\r\\n counter=counter+1; //incrementing counter so we can input it the coordinate arrays\\r\\n copyArray[y][x] = \\\"V\\\"; //changing the values to 'V' so we can know that we already visited it\\r\\n y=y-1; //moving coordinate up one \\r\\n xvalues[counter]=x; //storing this coordinate into the arrays with the counter\\r\\n yvalues[counter]=y;\\r\\n pathMethod(x, y, rows, columns, startPointX, startPointY, endPointX, endPointY, copyArray, realArray, decider); //recalling method\\r\\n }\\r\\n \\r\\n else if(down.equals(\\\"O\\\")){ //if down = O\\r\\n copyArray[y][x] = \\\"V\\\";\\r\\n counter=counter+1;\\r\\n y=y+1; \\r\\n xvalues[counter]=x;\\r\\n yvalues[counter]=y;\\r\\n pathMethod(x, y, rows, columns, startPointX, startPointY, endPointX, endPointY, copyArray, realArray, decider);\\r\\n }\\r\\n \\r\\n else if(right.equals(\\\"O\\\")){ //if right equals O\\r\\n copyArray[y][x] = \\\"V\\\";\\r\\n counter=counter+1;\\r\\n x=x+1;\\r\\n xvalues[counter]=x;\\r\\n yvalues[counter]=y;\\r\\n pathMethod(x, y, rows, columns, startPointX, startPointY, endPointX, endPointY, copyArray, realArray, decider);\\r\\n }\\r\\n \\r\\n else if(left.equals(\\\"O\\\")){ //if left equals O\\r\\n copyArray[y][x] = \\\"V\\\";\\r\\n counter=counter+1;\\r\\n x=x-1;\\r\\n xvalues[counter]=x;\\r\\n yvalues[counter]=y;\\r\\n pathMethod(x, y, rows, columns, startPointX, startPointY, endPointX, endPointY, copyArray, realArray, decider);\\r\\n }\\r\\n \\r\\n else { //if neither up down left or right work\\r\\n for(int i = 0; i<rows; i++){ //makes all the 'V's go back to O\\r\\n for(int j = 0; j<columns; j++){\\r\\n if(copyArray[i][j].equals(\\\"V\\\")){\\r\\n copyArray[i][j] = \\\"O\\\";\\r\\n }\\r\\n }\\r\\n }\\r\\n copyArray[y][x] = \\\"B\\\"; //make the coordinate that you cant make a move with B, so it shortens the possible path options\\r\\n for(int i = 0 ; i<counter; i++){\\r\\n xvalues[i] = 0; //resets the coordinate arrays back to 0\\r\\n yvalues[i] = 0;\\r\\n }\\r\\n counter=0; //resets counter back to 0;\\r\\n pathMethod(startPointX, startPointY, rows, columns, startPointX, startPointY, endPointX, endPointY, copyArray, realArray, decider); //resends the startpoints instead of x and y; only thing different is that one coordinate is now marked \\\"B\\\"\\r\\n } \\r\\n }\",\n \"static void Door2challenge() {\\n System.out.println(\\\"Ready! 3...2...1...GO!\\\");\\n System.out.println(\\\"Where do you want to go? Left, Right, or Straight\\\");\\n direction = next.nextLine();\\n //this is where the player will decide where to go\\n //the rest of the maze will branch off from this decision. These choices will have the same outcome.\\n \\n if(direction.contains(\\\"left\\\")) {\\n door2challenge_leftpath();\\n //player enters the left branch maze\\n \\n }else if(direction.contains(\\\"right\\\")){\\n door2challenge_rightpath();\\n //player enters the right branch of the maze\\n \\n }else if(direction.contains(\\\"straight\\\")){\\n door2challenge_straightpath();\\n //player enters the straight branch of the maze\\n }else{\\n System.out.println(\\\"I don't understand...type it correctly!!!\\\");\\n Door2challenge();\\n }\\n \\n }\",\n \"public boolean solveMaze(int x, int y, String direction){\\n\\n if (maze[x][y] == \\\"E\\\"){\\n solved = true;\\n return solved;\\n\\n }\\n\\n if(!(maze[x][y].equals(\\\"S\\\") || maze[x][y].equals(\\\"E\\\"))){\\n maze[x][y] = \\\"X\\\";\\n }\\n\\n if(direction != \\\"up\\\" && isReachable(x+1, y)){\\n solveMaze(x + 1, y, \\\"down\\\");\\n if(solved) return true;\\n }\\n if(direction != \\\"left\\\" && isReachable(x, y+ 1)){\\n solveMaze(x, y + 1, \\\"right\\\");\\n if(solved) return true;\\n }\\n if(direction != \\\"down\\\" && isReachable(x-1, y)){\\n solveMaze(x - 1 , y, \\\"up\\\");\\n if(solved) return true;\\n }\\n if(direction != \\\"right\\\" && isReachable(x, y -1)){\\n solveMaze(x, y - 1, \\\"left\\\");\\n if(solved) return true;\\n }\\n\\n //If cannot move, do backtracking\\n if(!solved) {\\n maze[x][y] = \\\" \\\";\\n return false;\\n }\\n\\n return false;\\n }\",\n \"public boolean solve(final int startRow, final int startCol) {\\r\\n\\r\\n // TODO\\r\\n // validate arguments: ensure position is within maze area\\r\\n\\r\\n if(mazeData [startRow][startCol] == WALL) {\\r\\n throw new IllegalArgumentException(\\\" we're in a wall buddy\\\");\\r\\n }\\r\\n else if (startRow > mazeData.length-1 || startCol > mazeData.length-1 ){\\r\\n throw new IllegalArgumentException(\\\" we're out of bounds \\\");\\r\\n }\\r\\n\\r\\n\\r\\n\\r\\n\\r\\n\\r\\n // TODO create local class for row/col positions\\r\\n class Position {\\r\\n private int row;\\r\\n private int col;\\r\\n\\r\\n // TODO add instance variables\\r\\n public Position(final int row, final int col) {\\r\\n this.row = row;\\r\\n this.col= col;\\r\\n }\\r\\n\\r\\n\\r\\n\\r\\n // TODO toString if desired\\r\\n public String toString() {\\r\\n return \\\"Row: \\\" + this.row + \\\"Column: \\\"+ this.col;\\r\\n }\\r\\n\\r\\n\\r\\n }\\r\\n\\r\\n\\r\\n // define the stack (work queue)\\r\\n final var queue = Collections.asLifoQueue(new LinkedList<Position>());\\r\\n //Queue<Position> queue = new LinkedList<Position>(); // EXTRA CREDIT PART 2\\r\\n\\r\\n // put starting position in queue\\r\\n queue.add(new Position(startRow, startCol));\\r\\n\\r\\n\\r\\n\\r\\n\\r\\n\\r\\n // look for a way out of the maze from the current position\\r\\n while (!queue.isEmpty()) {\\r\\n\\r\\n\\r\\n final Position pos = queue.remove();\\r\\n\\r\\n // if this is a wall, then ignore this position (and skip the remaining steps of the loop body)\\r\\n if (mazeData [pos.row][pos.col]== WALL){\\r\\n continue; // jumps to next spot in que , by skipping to next iteration of loops by saying continue\\r\\n }\\r\\n\\r\\n\\r\\n // otherwise mark this place as visited (drop a breadcrumb)\\r\\n if (mazeData [pos.row][pos.col]== VISITED){\\r\\n continue; // jumps to next spot in que , by skipping to next iteration of loops by saying continue\\r\\n }\\r\\n else if(mazeData [pos.row][pos.col]== EMPTY){\\r\\n mazeData [pos.row][pos.col]= VISITED;\\r\\n }\\r\\n\\r\\n // if we're already on the perimeter, then this is a way out and we should return success (true) right away\\r\\n if (pos.row == 0|| pos.col ==0 || pos.row == mazeData.length-1 || pos.col == mazeData[0].length-1){\\r\\n mazeData[startRow][startCol] = START;\\r\\n return true;\\r\\n }\\r\\n\\r\\n queue.add(new Position(pos.row+1,pos.col ));//down\\r\\n queue.add(new Position(pos.row-1,pos.col ));//up\\r\\n queue.add(new Position(pos.row,pos.col-1 )); //left\\r\\n queue.add(new Position(pos.row, pos.col + 1)); //right\\r\\n\\r\\n\\r\\n }//end of while\\r\\n\\r\\n\\r\\n\\r\\n // mark starting position\\r\\n mazeData[startRow][startCol] = START;\\r\\n\\r\\n // if we've looked everywhere but haven't gotten out, then return failure (false)\\r\\n return false;\\r\\n }\",\n \"public void generateSolution() {\\n if (this.stateOfTheMaze != 1)\\n throw new IllegalArgumentException(\\\"To generate the maze the state of it must be \\\\\\\"generated maze\\\\\\\".\\\");\\n Queue<Box> queue = new LinkedList<>();\\n queue.add(this.startBox);\\n boolean notFinished = true;\\n while (notFinished) {\\n Box aux = queue.peek();\\n LinkedList<Box> movements = movementWithWalls(aux);\\n movements.remove(aux.getPrevious());\\n for (Box box : movements) {\\n box.setPrevious(aux);\\n queue.add(box);\\n if (box.equals(this.endBox))\\n notFinished = false;\\n }\\n queue.remove();\\n }\\n Box anotherAux = this.endBox;\\n while (!anotherAux.equals(this.startBox)) {\\n anotherAux.setAsSolution();\\n anotherAux = anotherAux.getPrevious();\\n }\\n this.stateOfTheMaze++;\\n }\",\n \"public void solveMaze( int x0, int y0, int x1, int y1 ) {\\n visited = new boolean[rows+1][cols+1];\\n solve(x0, y0, x1, y1);\\n }\",\n \"@Override\\n public void onNothingSelected(AdapterView<?> parent) {\\n currentMazeChoice = \\\"Simple\\\";\\n }\",\n \"private int solve(int r, int c, int result){\\n if(animate){\\n\\n clearTerminal();\\n System.out.println(this);\\n\\n wait(150);\\n }\\n\\n //COMPLETE SOLVE\\n if (maze[r][c] == 'E'){\\n return result;\\n } else {\\n maze[r][c] = '@';\\n }\\n for (int i = 0; i < moves.length; i++){\\n int rowI = moves[i].x;\\n int colI = moves[i].y;\\n if (maze[r + rowI][c + colI] == ' ' || maze[r + rowI][c + colI] == 'E'){\\n int solvler = solve(r + rowI, c + colI, result + 1);\\n if (solvler != -1){\\n return solvler;\\n }\\n }\\n }\\n maze[r][c] = '.';\\n return -1; //so it compiles\\n }\",\n \"public boolean solveMaze(char[][] maze, int row, int col) {\\n if (row < 0 || row >= maze.length) {\\r\\n return false;\\r\\n }\\r\\n // Not even in the maze\\r\\n if (col < 0 || col >= maze.length) {\\r\\n return false;\\r\\n }\\r\\n // Can't move to this spot(Hit a wall and hit a spot that it has already been to)\\r\\n if (maze[row][col] == 'X' || maze[row][col] == '+') {\\r\\n return false;\\r\\n }\\r\\n // Winning condition: Found the exit\\r\\n if (maze[row][col] == 'E') {\\r\\n // Found the exit\\r\\n return true;\\r\\n }\\r\\n\\r\\n // Mark spot as visited\\r\\n maze[row][col] = '+';\\r\\n // Try north\\r\\n // Try path with new row, if successful, then it is done\\r\\n if (solveMaze(maze, row - 1, col)) {\\r\\n return true;\\r\\n }\\r\\n\\r\\n // Try east\\r\\n if (solveMaze(maze, row, col + 1)) {\\r\\n return true;\\r\\n }\\r\\n\\r\\n // Try south\\r\\n if (solveMaze(maze, row + 1, col)) {\\r\\n return true;\\r\\n }\\r\\n\\r\\n // Try west\\r\\n if (solveMaze(maze, row, col - 1)) {\\r\\n return true;\\r\\n }\\r\\n\\r\\n // Tried every direction = NO GOOD!\\r\\n // \\\"Unvisit\\\" the spot\\r\\n maze[row][col] = '.';\\r\\n return false;\\r\\n\\r\\n }\",\n \"@Override\\r\\n\\tpublic void solveMaze(String[] args, Maze3d maze) {\\r\\n\\t\\tthreadpool.execute(new Runnable() {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t@Override\\r\\n\\t\\t\\tpublic void run() {\\r\\n\\t\\t\\t\\tSearchable<Position> s = new Maze3dDomain(maze);\\r\\n\\t\\t\\t\\tif(args.length>=3 && args.length<5)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tif(args[2].equals(\\\"BFS\\\")==true)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tBFS<Position> solve = new BFS<Position>(new StateCostComparator<Position>());\\r\\n\\t\\t\\t\\t\\t\\tcontroller.setSolution(solve.search(s).getSol(),args[1]);\\r\\n\\t\\t\\t\\t\\t\\tcontroller.printStr(\\\"solution for \\\" +args[1]+ \\\" is ready\\\");\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t\\t\\tcontroller.printStr(\\\"Algorithm is not exist\\\");\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\telse if(args.length>=5)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tif((args[2]+\\\" \\\"+args[3]+\\\" \\\"+args[4]).equals(\\\"Astar Air Distance\\\")==true)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tBFS<Position> solve = new Astar<Position>(new StateCostComparator<Position>(),new MazeAirDistance(s));\\r\\n\\t\\t\\t\\t\\t\\tcontroller.setSolution(solve.search(s).getSol(),args[1]);\\r\\n\\t\\t\\t\\t\\t\\tcontroller.printStr(\\\"solution for \\\" +args[1]+ \\\" is ready\\\");\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\telse if((args[2]+\\\" \\\"+args[3]+\\\" \\\"+args[4]).equals(\\\"Astar Manhattan Distance\\\")==true)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tBFS<Position> solve = new Astar<Position>(new StateCostComparator<Position>(),new MazeManhattanDistance(s));\\r\\n\\t\\t\\t\\t\\t\\tcontroller.setSolution(solve.search(s).getSol(),args[1]);\\r\\n\\t\\t\\t\\t\\t\\tcontroller.printStr(\\\"solution for \\\" +args[1]+ \\\" is ready\\\");\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t\\t\\tcontroller.printStr(\\\"Algorithm is not exist\\\");\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t\\tcontroller.printStr(\\\"Algorithm is not exist\\\");\\r\\n\\t\\t\\t}\\r\\n\\t\\t});\\r\\n\\t}\",\n \"public static void main(String[] args) {\\n\\t\\tScanner scan = new Scanner(System.in);\\n\\t\\tQueue<maze> q = new LinkedList<>();\\n\\t\\tint N = scan.nextInt();\\n\\t\\tint M = scan.nextInt();\\n\\t\\tint output = 0;\\n\\t\\tscan.nextLine();\\n\\t\\tint arr[][] = new int[N][M];\\n\\t\\tint isVisit[][] = new int[N][M];\\n\\t\\tisVisit[0][0] = 1;\\n\\t\\tfor(int i=0;i<N;i++)\\n\\t\\t{\\n\\t\\t\\tString line = scan.nextLine();\\n\\t\\t\\tfor(int j=0;j<M;j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tarr[i][j] = line.charAt(j) - '0';\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tq.add(new maze(0, 0, 1));\\n\\t\\twhile(!q.isEmpty())\\n\\t\\t{\\n\\t\\t\\tmaze temp = q.poll();\\n\\t\\t\\tif(temp.x == M-1 && temp.y == N-1)\\n\\t\\t\\t{\\n\\t\\t\\t\\toutput = temp.block;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\tfor(int i=0;i<4;i++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tint x = temp.x + dx[i];\\n\\t\\t\\t\\tint y = temp.y + dy[i];\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(0 <= x && x < M && 0 <= y && y < N && arr[y][x] == 1 && isVisit[y][x] == 0)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tq.add(new maze(x, y, (temp.block + 1)));\\n\\t\\t\\t\\t\\tisVisit[y][x] = 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tSystem.out.println(output);\\n\\t}\",\n \"public void testSolve1() {\\n test = new Location(0, 1);\\n maze2.setCell(test, MazeCell.WALL);\\n test = new Location(1, 1);\\n maze2.setStartLocation(test);\\n test = new Location(0, 0);\\n maze2.setGoalLocation(test);\\n assertEquals(\\\"(0, 0) (1, 0) (1, 1) \\\", maze2.solve());\\n }\",\n \"@Override\\r\\n public void solve(String[] arr) {\\r\\n\\tString nameAlg = arr[arr.length - 1];\\r\\n\\tsb = new StringBuilder();\\r\\n\\tfor (int i = 1; i < arr.length - 1; i++) {\\r\\n\\t sb.append(arr[i]);\\r\\n\\t}\\r\\n\\tString name = sb.toString();\\r\\n\\tMaze3d tempMaze = hMaze.get(name);\\r\\n\\tif ((hSol.get(tempMaze)) != null) {\\r\\n\\t setChanged();\\r\\n\\t notifyObservers((\\\"solution:\\\" + name).split(\\\":\\\"));\\r\\n\\t}\\r\\n\\tFuture<Solution<Position>> fCallSolution = threadpool.submit(new Callable<Solution<Position>>() {\\r\\n\\r\\n\\t @Override\\r\\n\\t public Solution<Position> call() throws Exception {\\r\\n\\r\\n\\t\\tMaze3d m = hMaze.get(name);\\r\\n\\t\\tSearchableMaze sMaze = new SearchableMaze(m);\\r\\n\\t\\tCommonSearcher<Position> cs;\\r\\n\\t\\tSolution<Position> s = new Solution<Position>();\\r\\n\\t\\tswitch (nameAlg) {\\r\\n\\t\\tcase \\\"Astar\\\":\\r\\n\\t\\t cs = new AStar<Position>(new MazeManhattenDistance());\\r\\n\\t\\t s = cs.search(sMaze);\\r\\n\\t\\t break;\\r\\n\\t\\tcase \\\"A*\\\":\\r\\n\\t\\t cs = new AStar<Position>(new MazeManhattenDistance());\\r\\n\\t\\t s = cs.search(sMaze);\\r\\n\\t\\t break;\\r\\n\\t\\tcase \\\"BFS\\\":\\r\\n\\t\\t cs = new BFS<Position>();\\r\\n\\t\\t s = cs.search(sMaze);\\r\\n\\t\\t break;\\r\\n\\t\\t}\\r\\n\\t\\treturn s;\\r\\n\\t }\\r\\n\\t});\\r\\n\\ttry {\\r\\n\\t hSol.put(tempMaze, fCallSolution.get());\\r\\n\\t} catch (InterruptedException | ExecutionException e) {\\r\\n\\t // TODO Auto-generated catch block\\r\\n\\t e.printStackTrace();\\r\\n\\t}\\r\\n\\tsetChanged();\\r\\n\\tnotifyObservers((\\\"solution:\\\" + name).split(\\\":\\\"));\\r\\n }\",\n \"Maze makeMaze();\",\n \"public static void pathMenu() {\\n boolean quit = false;\\n do {\\n System.out.println(\\\"==================================================\\\");\\n System.out.println(\\\"Building Path Menu\\\");\\n System.out.println(\\\"==================================================\\\");\\n System.out.println();\\n System.out.println(\\\"Please Make a selection:\\\");\\n System.out.println(\\\"[1] Standard\\\");\\n System.out.println(\\\"[2] Reduce Double Edges\\\");\\n System.out.println(\\\"[3] Reduce Double Edges & use LSI Weights\\\");\\n System.out.println(\\\"[0] back\\\");\\n System.out.print(\\\"Selection: \\\");\\n int menu = scan.nextInt();\\n String name, filename;\\n double w;\\n int limit;\\n switch (menu) {\\n case 1:\\n System.out.print(\\\"Name: \\\");\\n name = scan.next();\\n System.out.print(\\\"Filename: \\\");\\n filename = scan.next();\\n System.out.print(\\\"W: \\\");\\n w = scan.nextDouble();\\n System.out.print(\\\"Open List Limit: \\\");\\n limit = scan.nextInt();\\n try {\\n Application.findPath(filename, name, w, limit, true, true, false);\\n } catch (Exception e) {\\n System.out.println(\\\"Error running A-Star: \\\" + e.getMessage());\\n }\\n break;\\n case 2:\\n System.out.print(\\\"Name: \\\");\\n name = scan.next();\\n System.out.print(\\\"Filename: \\\");\\n filename = scan.next();\\n System.out.print(\\\"W: \\\");\\n w = scan.nextDouble();\\n System.out.print(\\\"Open List Limit: \\\");\\n limit = scan.nextInt();\\n try {\\n Application.findPath(filename, name, w, limit, true, true, false);\\n } catch (Exception e) {\\n System.out.println(\\\"Error running A-Star: \\\" + e.getMessage());\\n }\\n break;\\n case 3:\\n System.out.print(\\\"Name: \\\");\\n name = scan.next();\\n System.out.print(\\\"Filename: \\\");\\n filename = scan.next();\\n System.out.print(\\\"W: \\\");\\n w = scan.nextDouble();\\n System.out.print(\\\"Open List Limit: \\\");\\n limit = scan.nextInt();\\n try {\\n Application.findPath(filename, name, w, limit, true, true, true);\\n } catch (Exception e) {\\n System.out.println(\\\"Error running A-Star: \\\" + e.getMessage());\\n }\\n break;\\n case 0:\\n quit = true;\\n break;\\n default:\\n System.out.println(\\\"Invalid Entry!\\\");\\n }\\n }\\n while (!quit);\\n }\",\n \"public static void main (String[] args) {\\n\\n Maze labyrinth = new Maze();\\n \\n labyrinth.print_maze();\\n\\n if (labyrinth.solve(0, 0)) {\\n \\t System.out.println (\\\"Maze solved!\\\");\\n \\t labyrinth.print_maze();\\n \\t }\\n else\\n System.out.println (\\\"No solution.\\\");\\n\\n }\",\n \"public void makeMove(){\\n System.out.println(\\\"Player choose x or o.\\\");\\n String chose = keyword.nextLine();\\n int row;\\n int column;\\n if (chose.equals(\\\"x\\\")){\\n System.out.println(\\\"Type coordenates for first move.\\\");\\n System.out.println(\\\"Type row.\\\");\\n row = keyword.nextInt();\\n System.out.println(\\\"Type column.\\\");\\n column = keyword.nextInt();\\n getBoard(row, column, \\\"x\\\");\\n }\\n else if (chose.equals(\\\"o\\\")){\\n System.out.println(\\\"Type coordenates for first move.\\\");\\n System.out.println(\\\"Type row.\\\");\\n row = keyword.nextInt();\\n System.out.println(\\\"Type column.\\\");\\n column = keyword.nextInt();\\n getBoard(row, column, \\\"o\\\");\\n }\\n }\",\n \"public static void main(String[] args) {\\n\\t\\tScanner sc = new Scanner(System.in);\\n\\t\\tint m = sc.nextInt();\\n\\t\\tint n = sc.nextInt();\\n char [] [] maze = new char[m][n];\\n for(int i=0; i<m; i++) {\\n \\t String str = sc.next();\\n \\t for(int j=0; j<str.length(); j++) {\\n \\t\\t maze[i][j]=str.charAt(j);\\n \\t }\\n }\\n int [][] ans = new int [m][n];\\n blocked_Maze_path(maze, 0, 0, n-1, m-1,ans );\\n \\n\\t}\",\n \"public boolean setPosition(){\\n\\n while(true){\\n System.out.println(\\\"Enter Line: \\\");\\n line = scanner.nextInt();\\n System.out.println(\\\"Enter Column: \\\");\\n column = scanner.nextInt();\\n\\n if(line>0 && line<9 && column>0 && column<9){\\n if(boardgame[line][column]!='_')\\n System.out.println(\\\"cell already selected\\\");\\n else \\n break;\\n }else{\\n System.out.println(\\\"Choose a number between 1 and 8\\\");\\n }\\n }\\n if(getPosition(line, column)==-1)\\n return true;\\n else \\n return false;\\n }\",\n \"public static void main(String[] args) {\\n char [][] strtMaze = new char[][]{\\n {'#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#'},\\n {'#', '.', '.', '.', '#', '.', '.', '.', '.', '.', '.', '#'},\\n {'.', '.', '#', '.', '#', '.', '#', '#', '#', '#', '.', '#'},\\n {'#', '#', '#', '.', '#', '.', '.', '.', '.', '#', '.', '#'},\\n {'#', '.', '.', '.', '.', '#', '#', '#', '.', '#', '.', '#'},\\n {'#', '#', '#', '#', '.', '#', 'F', '#', '.', '#', '.', '#'},\\n {'#', '.', '.', '#', '.', '#', '.', '#', '.', '#', '.', '#'},\\n {'#', '#', '.', '#', '.', '#', '.', '#', '.', '#', '.', '#'},\\n {'#', '.', '.', '.', '.', '.', '.', '.', '.', '#', '.', '#'},\\n {'#', '#', '#', '#', '#', '#', '.', '#', '#', '#', '.', '#'},\\n {'#', '.', '.', '.', '.', '.', '.', '#', '.', '.', '.', '#'},\\n {'#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#'},\\n };\\n //Get start position of person\\n int pstartx = 2;\\n int pstarty = 0;\\n //Get start position of hand\\n int hstartx = 3; //If same as pstart(facing north south)\\n int hstarty = 0;//If same as pstart (facing east west)\\n RecursionOutLab maze1 = new RecursionOutLab();\\n maze1.maze(strtMaze, pstartx, pstarty, hstartx, hstarty);\\n }\",\n \"public static void solveMaze(String inputFile, String outputFile) \\r\\n\\t{\\t\\r\\n\\t\\t\\r\\n\\t\\tif(new File(inputFile).isFile() == false)\\r\\n\\t\\t{\\r\\n\\t\\t\\ttry {\\r\\n\\t\\t\\t\\tthrow new FileNotFoundException();\\r\\n\\t\\t\\t} catch (FileNotFoundException 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}\\r\\n\\t\\t\\r\\n\\t\\t//Gets the dimensions to assign to the 2d String array size\\r\\n\\t\\tString[][] Dimensions = getDimensions(inputFile);\\r\\n\\t\\t\\r\\n\\t\\t//Gets each row and column character of the maze file and adds it the 2d String array\\r\\n\\t\\tString[][] Map = getMap(inputFile, Dimensions);\\r\\n\\t\\t\\r\\n\\t\\tint startRow = 0;\\r\\n\\t\\tint startColumn = 0;\\t\\t\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t\\t//This finds the Starting values, startRow and startColumn\\r\\n\\t\\tfor(int i = 0; i < Map.length; i++)\\r\\n\\t\\t{\\r\\n\\t\\t\\tfor(int j = 0; j < Map[0].length; j++)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tString check = Map[i][j];\\r\\n\\t\\t\\t\\tif (check.compareTo(\\\"S\\\") == 0)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tstartRow = i;\\r\\n\\t\\t\\t\\t\\tstartColumn = j;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\t//This sends the startRow, startColumn, 2d String array named Map (which contains all the coordinates), \\r\\n\\t\\t//and the output and input file names to getPath. \\r\\n\\t\\tSystem.out.println(getPath(startRow, startColumn, Map, outputFile, inputFile));\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n public void solveMaze() {\\r\\n threadPool.execute(() -> {\\r\\n maze.setStartPotision(new Position(PlayerPositionRow,PlayerPositionCol));\\r\\n try {\\r\\n Client client = new Client(InetAddress.getLocalHost(), 5401, new IClientStrategy() {\\r\\n public void clientStrategy(InputStream inFromServer, OutputStream outToServer) {\\r\\n try {\\r\\n ObjectOutputStream toServer = new ObjectOutputStream(outToServer);\\r\\n ObjectInputStream fromServer = new ObjectInputStream(inFromServer);\\r\\n toServer.flush();\\r\\n toServer.writeObject(maze);\\r\\n toServer.flush();\\r\\n s = (Solution) fromServer.readObject();\\r\\n } catch (Exception var10) {\\r\\n var10.printStackTrace();\\r\\n }\\r\\n\\r\\n }\\r\\n });\\r\\n client.communicateWithServer();\\r\\n try {\\r\\n Thread.sleep(5000);\\r\\n } catch (InterruptedException e) {\\r\\n e.printStackTrace();\\r\\n }\\r\\n } catch (Exception e) {\\r\\n e.printStackTrace();\\r\\n }\\r\\n setChanged();\\r\\n notifyObservers(\\\"solve\\\");\\r\\n });\\r\\n }\",\n \"public abstract String promptSelectionFromAnswers(final String question, final List<String> answers) throws JVMIOException;\",\n \"public void solve() {\\n // TODO\\n // This function should use next. You should also create and use any\\n // other helper fuctions you find helpful here.\\n \\t// get start position \\t\\n \\tSquare s = sea.getStart();\\n \\texploreList.add(s);\\n \\twhile(this.exploreList.size() != 0) {\\n \\t\\tSquare c = step();\\n \\t\\tif(c.hasNemo()) {\\n \\t\\t\\tsetPath(c);\\n \\t\\t\\tfoundNemo = true;\\n \\t\\t\\tbreak;\\n \\t\\t}\\n \\t}\\n }\",\n \"public boolean myChoice(int row, int column);\",\n \"protected boolean solve(int currentRow, int currentColumn) {\\n \\tint currentBlock = m.maze[currentRow][currentColumn];\\t\\t\\t\\t\\t\\t\\t// get the current block that we are on\\r\\n \\t\\r\\n if (m.isBlockEmpty(currentBlock)) {\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// make sure current block is empty\\r\\n \\tm.maze[currentRow][currentColumn] = 2; \\t\\t\\t\\t\\t\\t\\t\\t// add this block to the path as a potential solution\\r\\n repaint();\\r\\n \\r\\n m.blocksTraversed++;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// keep track of how many blocks were traversed over\\r\\n \\r\\n if (currentRow == m.rows-2 && currentColumn == m.columns-2) {\\t\\t\\t\\t// current block is bottom right, path has been found\\r\\n \\tGUI.ta.append(m.blocksTraversed + \\\" blocks were traversed while solving the maze.\\\\n\\\");\\r\\n \\tdouble percentage = (((double) m.blocksTraversed / (m.rows * m.columns))*100) * 2;\\r\\n DecimalFormat f = new DecimalFormat(\\\"##.00\\\");\\r\\n \\tGUI.ta.append(\\\"This results in \\\" + f.format(percentage) + \\\"% of the maze being traveled.\\\\n\\\");\\r\\n \\treturn true;\\r\\n }\\r\\n \\r\\n try { Thread.sleep(1); }\\r\\n catch (InterruptedException e) { }\\r\\n \\r\\n int topBlock = currentRow - 1;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// block directly above the current block\\r\\n int leftBlock = currentColumn - 1;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// block directly left of the current block\\r\\n int bottomBlock = currentRow + 1;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// block directly below the current block\\r\\n int rightBlock = currentColumn + 1;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// block directly right of the current block\\r\\n \\r\\n if (solve(topBlock, currentColumn) || solve(currentRow, leftBlock) ||\\t\\t// a solution was found\\r\\n \\tsolve(bottomBlock, currentColumn) || solve(currentRow, rightBlock))\\r\\n \\treturn true;\\r\\n \\r\\n m.maze[currentRow][currentColumn] = 4; \\t\\t\\t\\t\\t\\t\\t\\t\\t// no solution from current block so make the block visited instead\\r\\n repaint();\\r\\n \\r\\n synchronized(this) {\\r\\n try { wait(1); }\\r\\n catch (InterruptedException e) { }\\r\\n }\\r\\n }\\r\\n return false;\\r\\n }\",\n \"@Override\\n public final void solve() {\\n this.flag1 = this.neo.getPosition().equals(this.goal);\\n \\n }\",\n \"private static boolean solution(int[][] arr, int[][] mazeTravel, int row, int column) {\\n\\n int size = arr.length;\\n\\n if (row < 0 || row >= size || column < 0 || column >= size || arr[row][column] == 0 || mazeTravel[row][column] == 1 ) {\\n return false;\\n }\\n //Mark position as travelled\\n mazeTravel[row][column] = 1;\\n //Check if reached destination\\n if(row== arr.length-1&&column== arr.length-1){\\n return true;\\n }\\n //Top direction\\n if (solution(arr, mazeTravel, row - 1, column) ) {\\n return true;\\n }\\n //Right direction\\n if (solution(arr, mazeTravel, row, column + 1)) {\\n return true;\\n }\\n\\n //Left direction\\n if (solution(arr, mazeTravel, row, column - 1)) {\\n return true;\\n }\\n\\n //Down direction\\n if (solution(arr, mazeTravel, row + 1, column)) {\\n return true;\\n }\\n //Above 4 Conditions not satisfied\\n return false;\\n }\",\n \"public boolean solve (int row, int column) {\\n\\n boolean done = false;\\n \\n if (valid (row, column)) {\\n\\n grid[row][column] = 3; // cell has been tried\\n\\n if (row == grid.length-1 && column == grid[0].length-1)\\n done = true; // maze is solved\\n else {\\n done = solve (row+1, column); // down\\n if (!done)\\n done = solve (row, column+1); // right\\n if (!done)\\n done = solve (row-1, column); // up\\n if (!done)\\n done = solve (row, column-1); // left\\n }\\n if (done) // part of the final path\\n grid[row][column] = 7;\\n }\\n \\n return done;\\n\\n }\",\n \"public void actionPerformed(ActionEvent ae) {\\r\\n if(ae.getSource()==openMazefile){\\r\\n JFileChooser j = new JFileChooser(FileSystemView.getFileSystemView().getHomeDirectory());\\r\\n FileNameExtensionFilter filter = new FileNameExtensionFilter(\\\"TEXT FILES\\\", \\\"txt\\\", \\\"text\\\");\\r\\n j.setFileFilter(filter);\\r\\n // invoke the showsOpenDialog function to show the save dialog\\r\\n int r = j.showOpenDialog(null);\\r\\n\\r\\n // if the user selects a file\\r\\n if (r == JFileChooser.APPROVE_OPTION)\\r\\n {\\r\\n File inputFile=j.getSelectedFile();\\r\\n mazePanel.readMaze(inputFile);\\r\\n solveMaze.setEnabled(true);\\r\\n }\\r\\n }\\r\\n else if (ae.getSource() == solveMaze){\\r\\n mazePanel.solveMaze();\\r\\n solveMaze.setEnabled(false);\\r\\n clearSolution.setEnabled(true);\\r\\n }\\r\\n else if (ae.getSource() == clearSolution){\\r\\n mazePanel.clearMazePath();\\r\\n solveMaze.setEnabled(true);\\r\\n clearSolution.setEnabled(false);\\r\\n }\\r\\n\\r\\n }\",\n \"public void select() {\\n \\t\\t\\tString sinput = \\\"\\\";\\r\\n \\t\\t\\tOption selected = null;\\r\\n \\t\\t\\tErrorLog.debug(name + \\\" selected.\\\");\\r\\n \\t\\t\\t\\r\\n \\t\\t\\twhile (true) {\\r\\n \\t\\t\\t\\tSystem.out.println(toString()); //Print menu.\\r\\n \\t\\t\\t\\tsinput = read(); //Get user selection.\\r\\n \\t\\t\\t\\tif (!sinput.equalsIgnoreCase(\\\"exit\\\")) {\\r\\n \\t\\t\\t\\t\\tselected = options.get(sinput); //Find corresponding option.\\r\\n \\r\\n \\t\\t\\t\\t\\tif (selected != null) //Sinput corresponds to an extant option.\\r\\n \\t\\t\\t\\t\\t\\tselected.select(); //Select the selected.\\r\\n \\t\\t\\t\\t\\telse\\r\\n \\t\\t\\t\\t\\t\\tprint(sinput + \\\" is not a valid option\\\");\\r\\n \\t\\t\\t\\t} else\\r\\n \\t\\t\\t\\t\\t{print(\\\"Returning to previous menu.\\\"); break;}\\r\\n \\t\\t\\t}\\r\\n \\t\\t\\t\\r\\n \\t\\t\\tErrorLog.debug (\\\"Quitting \\\" + name + \\\". Sinput:\\\"+sinput);\\r\\n \\t\\t\\t\\r\\n \\t\\t\\treturn;\\r\\n \\t\\t}\",\n \"public char[][] mazeTraversal(char[][] maze, int x, int y){\\n\\n // Using the try catch to find the 'end' of the maze. Or when the maze hits the bounds of the char array.\\n try{\\n // this will test all valid moves. If they are valid, it replaces the current position with 'x' and moves\\n // the cursor 'A' to the next position. Prints maze and recursively calls mazeTraversal.\\n\\n // if down is a valid move\\n if(maze[x][y-1] == '.'){\\n maze[x][y] = 'x';\\n maze[x][y-1] = 'A';\\n print(maze);\\n mazeTraversal(maze, x, y-1);\\n }\\n\\n // if right is a valid move\\n if(maze[x+1][y] == '.'){\\n maze[x][y] = 'x';\\n maze[x+1][y] = 'A';\\n print(maze);\\n mazeTraversal(maze, x+1, y);\\n }\\n\\n // if up is a valid move\\n if(maze[x][y+1] == '.'){\\n maze[x][y] = 'x';\\n maze[x][y+1] = 'A';\\n print(maze);\\n mazeTraversal(maze, x, y+1);\\n }\\n\\n // if left is a valid move\\n if(maze[x-1][y] == '.'){\\n maze[x][y] = 'x';\\n maze[x-1][y] = 'A';\\n print(maze);\\n mazeTraversal(maze, x-1, y);\\n }\\n\\n // if no moves are available or the cursor approaches a dead end, the current position is replaced with '0'\\n // and prints the maze again. This will remove the cursor until a next valid move is available.\\n // Returns the current maze.\\n maze[x][y] = '0';\\n print(maze);\\n return maze;\\n }catch(Exception e){\\n // If the maze approaches the 'end' of the maze, or approaches a point where the cursor is at the bounds,\\n // then the catch will initiate. Assuming the maze is done. Ending the program.\\n System.out.println(\\\"The Maze is traversed. Thank you for playing.\\\");\\n maze[x][y] = 'x';\\n print(maze);\\n System.exit(0);\\n }\\n return maze;\\n }\",\n \"public IAnswer select() throws NoPossibleAnswersException;\",\n \"public void findTour( int x, int y, int moves )\\n {\\n delay(50); //slow it down enough to be followable\\n if (solved) System.exit(0);\\n\\n //primary base case: tour completed\\n if (moves == (sideLength * sideLength)) {\\n solved = true;\\n }\\n //other base case: stepped off board or onto visited cell\\n if ( board[x][y] != 0 ) {\\n return;\\n }\\n //otherwise, mark current location\\n //and recursively generate tour possibilities from current pos\\n else {\\n board[x][y] = moves;\\n System.out.println(this);\\n delay(10); //uncomment to slow down enough to view\\n\\n /*======================================\\n Recursively try to solve (find tour) from\\n each of knight's available moves.\\n . e . d .\\n f . . . c\\n . . @ . .\\n g . . . b\\n . h . a .\\n ======================================*/\\n // right and down\\n findTour(x + 1, y + 2, moves + 1);\\n // left and down\\n findTour(x - 1, y + 2, moves + 1);\\n // down and right\\n findTour(x + 2, y + 1, moves + 1);\\n // up and left\\n findTour(x - 2, y - 1, moves + 1);\\n // right and up\\n findTour(x + 1, y - 2, moves + 1);\\n // left and up\\n findTour(x - 1, y - 2, moves + 1);\\n // up and right\\n findTour(x + 2, y - 1, moves + 1);\\n // down and left\\n findTour(x - 2, y + 1, moves + 1);\\n\\n //If made it this far, path did not lead to tour, so back up.\\n board[x][y] = 0;\\n System.out.println(this);\\n }\\n }\",\n \"public static void main(String[] args) { \\n \\n //read in filename from user\\n String filenameInput = args[0];\\n \\n //create new maze/graph\\n Maze newMaze = new Maze(filenameInput);\\n \\n //call toString\\n //String stringMaze = newMaze.toString();\\n \\n //print the string maze\\n //System.out.println(stringMaze);\\n \\n //call findPath\\n //System.out.println(newMaze.findPath());\\n \\n for (Vertex v : newMaze.findPath()) System.out.print(v.getName());\\n \\n //print solution?\\n //System.out.println(newMaze.solution);\\n \\n \\n }\",\n \"public static String findPath(Maze maze) {\\n \\tint m = maze.getNumRows();\\n \\tint n = maze.getNumCols();\\n\\n \\t//define a visited matrix\\n \\tboolean[][] visited = new boolean[m][n];\\n \\tsetvisited(false, visited);\\n\\n \\t//define a direction matrix\\n \\tint[][] dir_mtr = new int[m][n];\\n \\tinit_dir(-1,dir_mtr);\\n\\n\\n\\n \\t//define a stack\\n \\tStack<MazeLocation> s;\\n \\ts = new StackRefBased<MazeLocation>();\\n\\n \\tMazeLocation entry = maze.getEntry();\\n \\tMazeLocation exit = maze.getExit();\\n \\t// System.out.println(entry.toString());\\n \\ts.push(entry);\\n\\n\\t\\tMazeLocation temp; \\n\\t\\tString result = \\\"\\\"; \\t\\n\\n\\t\\ttry{\\n\\t\\t\\tint x,y;\\n\\n\\n\\t\\t\\twhile(!s.isEmpty()){\\n\\n \\t\\ttemp = s.peek();\\n \\t\\tx = temp.getRow();\\n \\t\\ty = temp.getCol();\\n \\t\\tdir_mtr[x][y]+=1;\\n\\n \\t\\tif(temp.toString().equals(exit.toString())){\\n \\t\\t\\tSystem.out.println(\\\"find the path\\\");\\n \\t\\t\\tbreak;\\n\\n \\t\\t}\\n\\n \\t\\tif(dir_mtr[x][y]==0){ \\n \\t\\t\\t//checking the up direction\\n \\t\\t\\tif(x-1>=0 && !maze.isWall(x-1,y) && !visited[x-1][y]){\\n \\t\\t\\t\\tMazeLocation testnode = new MazeLocation(x-1,y,maze.isWall(x-1,y));\\n \\t\\t\\t\\tvisited[x-1][y] = true;\\n \\t\\t\\t\\ts.push(testnode);\\n\\n \\t\\t\\t}\\n\\n \\t\\t}else if(dir_mtr[x][y]==1){\\n \\t\\t\\t//checking the left direction\\n \\t\\t\\tif(y-1>=0 && !maze.isWall(x,y-1) && !visited[x][y-1]){\\n \\t\\t\\t\\tMazeLocation testnode = new MazeLocation(x,y-1,maze.isWall(x,y-1));\\n \\t\\t\\t\\tvisited[x][y-1] = true;\\n \\t\\t\\t\\ts.push(testnode);\\n\\n \\t\\t\\t}\\n\\n \\t\\t}else if(dir_mtr[x][y]==2){\\n \\t\\t\\t//checking the down direction\\n \\t\\t\\tif(x+1<m && !maze.isWall(x+1,y) && !visited[x+1][y]){\\n \\t\\t\\t\\tMazeLocation testnode = new MazeLocation(x+1,y,maze.isWall(x+1,y));\\n \\t\\t\\t\\tvisited[x+1][y] = true;\\n \\t\\t\\t\\ts.push(testnode);\\n\\n \\t\\t\\t}\\n \\t\\t\\t\\n \\t\\t}else if(dir_mtr[x][y]==3){\\n \\t\\t\\t//checking the right direction\\n \\t\\t\\tif(y+1<n && !maze.isWall(x,y+1) && !visited[x][y+1]){\\n \\t\\t\\t\\tMazeLocation testnode = new MazeLocation(x,y+1,maze.isWall(x,y+1));\\n \\t\\t\\t\\tvisited[x][y+1] = true;\\n \\t\\t\\t\\ts.push(testnode);\\n\\n \\t\\t\\t}\\n \\t\\t\\t\\n \\t\\t}else{\\n \\t\\t\\tvisited[x][y] = false;\\n \\t\\t\\ts.pop();\\n \\t\\t}\\n\\n\\n\\n \\t\\t\\n \\t}\\n\\n \\t//reverse the stack\\n \\tStack<MazeLocation> reverse;\\n \\treverse = new StackRefBased<MazeLocation>();\\n \\twhile(!s.isEmpty()){\\n\\t\\t\\t reverse.push(s.pop()); \\t//push the node to the reverse stack\\n\\t\\t\\t }\\n\\n\\n \\t//if the stack is not empty, then we find the path\\n\\t\\tif(!reverse.isEmpty()){\\n\\t\\t\\tresult = reverse.toString();\\n\\n\\t\\t}\\n\\n \\t\\n \\n\\n\\t\\t}\\n\\t\\tcatch (StackEmptyException see) {\\n \\n }\\n\\n\\n \\treturn result;\\n\\n\\n }\",\n \"public void solve(int x, int y) {\\n\\tif ( numQ == xLen ) \\n\\t solved = true; \\n //Checks if you're able to place queen on current space\\n\\telse if ( board[x][y] == 0 ) {\\n\\t fill(x,y);\\n\\t board[x][y] = 9;\\n\\t numQ++;\\n\\t //Attempts to call solve for every spot on the board\\n\\t for ( int r =0; r < xLen; r++ ) {\\n\\t\\tfor ( int c = 0; c < yLen; c++ ) {\\n\\t\\t if (!solved) \\n\\t\\t\\tsolve(r,c);\\n\\t\\t \\n\\t\\t}\\n\\t }\\n\\t /* Though I got my code to work for the 5x5 example, I had \\n\\t trouble extending it to larger boards. Essentially my solve\\n\\t places a queen in the first non-\\\"threatened\\\" spot on the board\\n\\t available, but doesn't go back to try another configuration if\\n\\t the program runs into a dead-end. */\\n\\t}\\n }\",\n \"public static void userMover(){\\n System.out.println(\\\"Where would you like to move? Please choose (R)ight, (L)eft, (U)p, or (D)own \\\");\\n String move = input.next();\\n\\n while (!\\\"RLUD\\\".contains(move)) {\\n System.out.println(\\\"Where would you like to move? Please choose (R)ight, (L)eft, (U)p, or (D)own \\\");\\n move = input.next();\\n }\\n\\n if (move.equals(\\\"R\\\") && (myMap.canIMoveRight())) {\\n myMap.moveRight();\\n } else if (move.equals(\\\"L\\\") && myMap.canIMoveLeft()) {\\n myMap.moveLeft();\\n } else if (move.equals(\\\"U\\\") && myMap.canIMoveUp()) {\\n myMap.moveUp();\\n } else if (move.equals(\\\"D\\\") && myMap.canIMoveDown()) {\\n myMap.moveDown();\\n } else if (myMap.isThereAPit(move)) {\\n navigatePit(move);\\n } else {\\n System.out.println(\\\"Sorry, you’ve hit a wall.\\\");\\n }\\n\\n myMap.printMap();\\n }\",\n \"public void solveIt() {\\n\\t\\tfirstFreeSquare.setNumberMeAndTheRest();\\n\\t}\",\n \"public boolean generateSolution() {\\n //first clear all filled in fields by user (they could be wrong)\\n clearGame();\\n\\n //use solver\\n SudokuSolver solver = new BacktrackSolver();\\n return solver.solveSudoku(this);\\n }\",\n \"public void newMaze()\\n {\\n NewMazeDialog dialog;\\n String result;\\n dialog = new NewMazeDialog(Main.getPrimaryFrameInstance());\\n if ( (result = dialog.showDialog()) == null)\\n return;\\n\\n MazeInfoModel mim = Main.getPrimaryFrameInstance().getMazeInfoModel();\\n\\n if (result.equals(NewMazeDialog.MAZ))\\n {\\n MazeInfo newMi = mim.createNew(\\\"New Maze \\\" + mLastNew, false);\\n if (newMi == null)\\n {\\n JOptionPane.showMessageDialog(MazeEditorPage.this,\\n \\\"Unable to create new maze\\\",\\n \\\"Maze Creation Error\\\",\\n JOptionPane.OK_OPTION);\\n return;\\n }\\n mLastNew++;\\n }\\n else if (result.equals(NewMazeDialog.MZ2))\\n {\\n MazeInfo newMi = mim.createNew(dialog.getText(), true);\\n if (newMi == null)\\n {\\n JOptionPane.showMessageDialog(MazeEditorPage.this,\\n \\\"Unable to create new maze\\\",\\n \\\"Maze Creation Error\\\",\\n JOptionPane.OK_OPTION);\\n return;\\n }\\n MazeModel mm = newMi.getModel();\\n mm.setSize(dialog.getMazeSize());\\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 \"private void optionsSelect() {\\n switch (currentQueNum) {\\n case 1:\\n ans1Option();\\n break;\\n case 2:\\n ans2Option();\\n break;\\n case 3:\\n ans3Option();\\n break;\\n case 4:\\n ans4Option();\\n break;\\n case 5:\\n ans5Option();\\n break;\\n case 6:\\n ans6Option();\\n break;\\n case 7:\\n ans7Option();\\n break;\\n case 8:\\n ans8Option();\\n break;\\n case 9:\\n ans9Option();\\n break;\\n case 10:\\n ans10Option();\\n break;\\n }\\n }\",\n \"public boolean solve()\\n\\t{\\n Position[] pos=path.getLastStep().neighbors();\\n if (grid.isOnBoundary(path.getLastStep())&&grid.isOpen(path.getLastStep()))\\n\\t\\treturn true;\\n if (path.getLastStep()==start)\\n return false;\\n for (int i=0;i<4;i++)\\n {\\n if (pos[i]!=path.getLastStep() && grid.isOpen(pos[i]))\\n path.extend(pos[i]);\\n }\\n if (grid.isBlocked(path.getLastStep())||grid.isRejected(path.getLastStep()))\\n {\\n path.backUp();\\n solve();\\n }\\n return false;\\n \\n\\t}\",\n \"public static void main(String[] args) {\\n\\r\\n\\t\\tScanner input = new Scanner(System.in);\\r\\n\\t\\tint row =0,col = 0;\\r\\n\\t\\tint user = -1;\\r\\n\\t\\t\\r\\n\\t\\twhile (user != 0 && user != 1 && user != 2) {\\r\\n\\t\\t\\tSystem.out.println(\\\"\\\\n************************************\\\");\\r\\n\\t\\t\\tSystem.out.println(\\\"\\\\nEnter difficulty level\\\");\\r\\n\\t\\t\\tSystem.out.println(\\\"Press 0 for BEGINNER 9*9 cells and 10 mines\\\");\\r\\n\\t\\t\\tSystem.out.println(\\\"Press 1 for INTERMEDIATE 16*16 cells and 40 mines\\\");\\r\\n\\t\\t\\tSystem.out.println(\\\"Press 2 for ADVANCED 24*24 cells and 99 mines\\\\n\\\");\\r\\n\\t\\t\\tuser = input.nextInt();\\r\\n\\t\\t\\tSystem.out.println(\\\"\\\\n************************************\\\");\\r\\n\\t\\t\\tif (user == 0) {\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\trow = 9; col = 9;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\telse if (user == 1){ \\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\trow = 16; col = 16;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse if (user == 2){\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\trow = 24; col = 24;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t\\tchar[][] board = new char[row][col];\\r\\n\\t\\t\\r\\n\\t\\tinitBoard(board);\\r\\n\\t\\t\\r\\n\\t\\tint [][] solution = new int[row][col];\\r\\n\\t\\tint [][] playboard = new int[row][col];\\r\\n\\t\\tfor(int i=0;i<solution.length;i++){\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tfor(int j=0;j<solution[0].length;j++){\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tsolution[i][j]=0;playboard[i][j] =0;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tint mine = 0;\\r\\n\\t\\t\\r\\n\\t\\tif (row == 9) mine = 10;\\r\\n\\t\\telse if (row == 16) mine = 40;\\r\\n\\t\\telse if (row == 24) mine = 99;\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t\\tint countplay = mine;fillBoard(board,mine);\\r\\n\\t\\t\\r\\n\\t\\tfor(int i=0;i<board.length;i++){\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tfor(int j=0;j<board[0].length;j++){\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tint r = i;\\r\\n\\t\\t\\t\\tint c =j;\\r\\n\\t\\t\\t\\tif(board[i][c] == '*'){\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tif(r>0 && c>0){\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tif(board[r-1][c-1] == '.'){\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tsolution[r-1][c-1] += 1;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tif(r >0){\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tif(board[r-1][c] == '.'){\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tsolution[r-1][c] += 1;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tif(r >0 && c+1 < board[0].length){\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tif(board[r-1][c+1] == '.'){\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tsolution[r-1][c+1] += 1;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tif(c >0){if(board[r][c-1] == '.'){\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tsolution[r][c-1] += 1;\\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\\t\\t\\r\\n\\t\\t\\t\\t\\tif(c+1 < board[0].length){\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tif(board[r][c+1] == '.'){\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tsolution[r][c+1] += 1;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tif(r +1 < board.length && c >0){\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tif(board[r+1][c-1] == '.'){\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tsolution[r+1][c-1] += 1;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tif(r +1 < board.length){\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tif(board[r+1][c] == '.'){\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tsolution[r+1][c] += 1;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tif(r +1 < board.length && c+1 <board[0].length){\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tif(board[r+1][c+1] == '.'){\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tsolution[r+1][c+1] += 1;\\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\\r\\n\\t\\tSystem.out.println(\\\"\\\\n************************************\\\");\\r\\n\\t\\tSystem.out.println(\\\"\\\\nPlay Game\\\");\\r\\n\\t\\tSystem.out.println(\\\"\\\\nRows and Columns start from 0!\\\");\\r\\n\\t\\tSystem.out.println(\\\"\\\\n************************************\\\");\\r\\n\\t\\tprintBoard(board);\\r\\n\\t\\t\\r\\n\\t\\twhile(countplay <=board.length * board[0].length){\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tSystem.out.println(\\\"\\\\nEnter row: \\\");\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tint prow = input.nextInt();System.out.println(\\\"\\\\nEnter col: \\\");\\r\\n\\t\\t\\tint pcol = input.nextInt();\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tfor(int i=0;i<board.length;i++){\\r\\n\\t\\t\\t\\tfor(int j=0;j<board[0].length;j++){\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tif(board[prow][pcol] == '*'){\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"GAME OVER\\\\n\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tfor(int k=0;k<solution.length;k++){\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tfor(int x=0;x<solution[0].length;x++){\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tif(board[k][x]=='*')\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tSystem.out.print(\\\"*\\\" + \\\" \\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tSystem.out.print(solution[k][x] + \\\"\\\");\\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\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"\\\\n\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\treturn;\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t\\t{playboard[prow][pcol] = solution[prow][pcol];\\r\\n\\t\\t\\t\\t\\ti=board.length;\\r\\n\\t\\t\\t\\t\\tj=board[0].length;break;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\tfor(int k=0;k<playboard.length;k++){\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tfor(int x=0;x<playboard[0].length;x++){\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tif(board[k][x]=='*')\\r\\n\\t\\t\\t\\t\\t\\tSystem.out.print(\\\".\\\" + \\\" \\\");\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\telse if(playboard[k][x]==0)\\r\\n\\t\\t\\t\\t\\t\\tSystem.out.print(\\\".\\\" + \\\" \\\");\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\telse\\r\\n\\t\\t\\t\\t\\t\\tSystem.out.print(playboard[k][x] + \\\" \\\");\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tSystem.out.println(\\\"\\\\n\\\");\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tcountplay++;\\r\\n\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tSystem.out.println(\\\"Congratulations\\\");\\r\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tpublic void solve() {\\n\\t\\t\\r\\n\\t}\",\n \"public boolean solve(){\\n\\t\\t//Solve the puzzle using backtrack method\\n\\t\\treturn solve(0,0);\\n\\t}\",\n \"public void solve() {\\n System.out.println(\\\"Solving...\\\");\\n solving = true;\\n Solver s = new Solver(b.getBoard());\\n ArrayList<Integer> solution = s.solve();\\n\\n System.out.println(\\\"Printing solution...\\\");\\n try{\\n Thread.sleep(300);\\n }catch (Exception e){}\\n\\n solution.trimToSize();\\n\\n solveMoves = solution;\\n\\n Board bRef = new Board(b.getBoard());\\n\\n System.out.println(\\\"Step 0\\\");\\n System.out.println(bRef.toString());\\n\\n for (int i = 0; i < solution.size(); i++) {\\n bRef.move(solution.get(i));\\n System.out.println(\\\"Step \\\" + (i + 1));\\n System.out.println(bRef.toString());\\n }\\n\\n System.out.println(\\\"Solved by Computer in \\\" + solution.size()+ \\\" move(s).\\\\n\\\");\\n System.out.println(\\\"Left-click screen to follow steps.\\\");\\n System.out.println(\\\"Right-click the screen to play again.\\\");\\n\\n solveStep = 0; //Reset for user\\n }\",\n \"public static String menuSelection() throws ParseException {\\n System.out.print(\\\"\\\\nWelcome to Poised!\\\");\\n System.out.print(\\\"\\\\n1\\\\t-\\\\tAdd a new project\\\");\\n System.out.print(\\\"\\\\n2\\\\t-\\\\tChange due date of a project\\\");\\n System.out.print(\\\"\\\\n3\\\\t-\\\\tChange payment on project\\\");\\n System.out.print(\\\"\\\\n4\\\\t-\\\\tUpdate contact details\\\");\\n System.out.print(\\\"\\\\n5\\\\t-\\\\tFinalise a project\\\");\\n System.out.print(\\\"\\\\nPlease make your selection: \\\");\\n\\n // User's selection determine which method should be called\\n // If user's selection is '1', then user can create a new project\\n int userSelection = input.nextInt();\\n input.nextLine();\\n if (userSelection == 1) {\\n ProjectList.add(createProject());\\n }\\n\\n // If user selection '2', then can amend the due date of the project\\n else if (userSelection == 2) {\\n Project selectedProj = getProject();\\n if (selectedProj == null) {\\n return menuSelection();\\n }\\n\\n newDeadline(selectedProj);\\n }\\n\\n // If user selects '3', then user can change the payment on the project\\n else if (userSelection == 3) {\\n Project selectedProj = getProject();\\n if (selectedProj == null) {\\n return menuSelection();\\n }\\n\\n makePayment(selectedProj);\\n }\\n\\n // If user selects '4', then user can update the details of either the\\n // contractor, client or architect.\\n else if (userSelection == 4) {\\n Project selectedProj = getProject();\\n if (selectedProj == null) {\\n return menuSelection();\\n }\\n\\n updateDetails(selectedProj);\\n }\\n\\n // If user selects '5', then user can finalise the project\\n else if (userSelection == 5) {\\n Project selectedProj = getProject();\\n if (selectedProj == null) {\\n return menuSelection();\\n }\\n\\n finalisation(selectedProj);\\n }\\n\\n return menuSelection();\\n }\",\n \"public boolean solve(){\\n\\t\\treturn solve(0,0);\\n\\t}\",\n \"public void showSaveMaze(String message);\",\n \"private static void menuSelector(){\\r\\n\\t\\tint answer= getNumberAnswer();\\r\\n\\t\\tswitch (answer) {\\r\\n\\t\\tcase 0:\\r\\n\\t\\t\\tshowShapeInfo(shapes[0]);\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\tcase 1:\\r\\n\\t\\t\\tcreateShape();\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\tcase 2:\\r\\n\\t\\t\\tSystem.out.println(\\\"Its Perimeter is equal to: \\\" +calcShapePerimeter(shapes[0]));\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\tcase 3:\\r\\n\\t\\t\\tSystem.out.println(\\\"Its Area is equal to: \\\" +calcShapeArea(shapes[0]));\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\tcase 4:\\r\\n\\t\\t\\tSystem.out.println(\\\"Provide integer to use for scaling shape: \\\");\\r\\n\\t\\t\\tscaleShape(shapes[0], getNumberAnswer());\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\tdefault:\\r\\n\\t\\t\\tSystem.out.println(\\\"That's not actually an option.\\\");\\r\\n\\t\\t\\tbreak;\\r\\n\\t\\t}\\r\\n\\t}\",\n \"protected boolean menu() {\\n\\t\\tint selection = 0;\\n\\t\\twhile(selection != 6) {\\n\\t\\t\\tSystem.out.println();\\n\\t\\t\\tSystem.out.print(\\\"Please select your choice:\\\\n\\\" +\\n\\t\\t\\t\\t\\t\\\"1 - Play Human vs AI Game\\\\n\\\" +\\n\\t\\t\\t\\t\\t\\\"2 - Play AI vs AI Game\\\\n\\\" +\\n\\t\\t\\t\\t\\t\\\"3 - Quit\\\\n\\\" );\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tselection = Integer.parseInt(getFromUser(\\\"Enter selection: \\\"));\\n\\t\\t\\t}\\n\\t\\t\\tcatch (Exception e) {\\n\\t\\t\\t\\tSystem.out.println(\\\"Invalid Input - type the number corresponding to your selection\\\");\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t}\\n\\t\\t\\tswitch(selection){\\n\\t\\t\\t\\tcase 1: case 2: board = Factory.instance().makeBoard(selection); break;\\n\\t\\t\\t\\tcase 3: quit(); break;\\n\\t\\t\\t\\tdefault: System.out.println(\\\"Invalid Input\\\");\\n\\t\\t\\t}\\n\\t\\t\\tif(selection >= 1 && selection <= 4 && board != null){\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn false;\\n\\t}\",\n \"public void AskForMove();\",\n \"public boolean solve()throws InterruptedException{\\n\\tint startx=0,starty=0;\\n\\t//Initialize startx and starty with the location of the S.\\n\\tfor (int r = 0; r < height; r++){\\n\\t for (int c = 0; c < length; c++){\\n\\t\\tif (board[r][c] == 'S'){\\n\\t\\t startx = r;\\n\\t\\t starty = c;\\n\\t\\t}\\n\\t }\\n\\t}\\n\\tboard[startx][starty] = ' ';//erase the S, and start solving!\\n\\treturn solveH(startx,starty);\\n }\",\n \"public void solution() {\\n\\t\\t\\n\\t}\",\n \"public static void main(String[] args) // solve a slider puzzle (given below)\\n {\\n In in = new In(args[0]);\\n int N = in.readInt();\\n int[][] blocks = new int[N][N];\\n for (int i = 0; i < N; i++)\\n for (int j = 0; j < N; j++)\\n blocks[i][j] = in.readInt();\\n Board initial = new Board(blocks);\\n\\n // solve the puzzle\\n Solver solver = new Solver(initial);\\n\\n // print solution to standard output\\n if (!solver.isSolvable())\\n StdOut.println(\\\"No solution possible\\\");\\n else {\\n StdOut.println(\\\"Minimum number of moves = \\\" + solver.moves());\\n for (Board board : solver.solution())\\n StdOut.println(board);\\n \\n \\t\\n }\\n}\",\n \"public static void main(String[] args) {\\n char option;\\n Scanner scan = new Scanner(System.in);\\n System.out.println(\\\"Welcome to MG's adventure world. Now your journey begins. Good luck!\\\");\\n System.out.println(\\\"Please hit 'C' or 'c' to continue, anything else to quit-\\\");\\n String input = getInput(scan, \\\"Cc\\\");\\n System.out.println(\\\"You are in a dead valley.\\\");\\n System.out.println(\\\"Please hit 'C' or 'c' to continue, anything else to quit-\\\");\\n input = getInput(scan, \\\"Cc\\\");\\n System.out.println(\\\"You walked and walked and walked and you saw a cave!\\\");\\n cave();\\n System.out.println(\\\"Please hit 'C' or 'c' to continue, anything else to quit-\\\");\\n input = getInput(scan, \\\"Cc\\\");\\n System.out.println(\\\"You entered a cave!\\\");\\n System.out.println(\\\"Please hit 'C' or 'c' to continue, anything else to quit-\\\");\\n input = getInput(scan, \\\"Cc\\\");\\n System.out.println(\\\"Unfortunately, you ran into a GIANT!\\\");\\n giant();\\n System.out.println(\\\"Enter 'A' or 'a' to Attack, 'E' or 'E' to Escape, ANYTHING else is to YIELD\\\");\\n input = getInput(scan, \\\"AaEe\\\", 10);\\n System.out.println(\\\"Congratulations! You SURVIVED! Get your REWARD!\\\");\\n System.out.println(\\\"There are three 3 tressure box in front of you! Enter the box number you want to open!\\\");\\n box();\\n input = getInput(scan);\\n System.out.println(\\\"Hero! Have a good day!\\\");\\n }\",\n \"public void solve() {\\n \\tsquares[0][0].fillInRemainingOfBoard();\\n }\",\n \"public static void main(String[] args) {\\n\\t\\tSystem.out.println(\\\"This is a 10 * 10 map, x axis and y axis start from 0 - 9.\\\");\\n\\t\\tSystem.out.println(\\\"There are totally \\\"+MINE_NUMBER+\\\" mines, and your task is to find all the mines.\\\");\\n\\n\\t\\t// generate 10*10 grid\\n\\t\\t/*\\n\\t\\t * 0: not mine 1: mine 2: mine found 3: not mine shot\\n\\t\\t * \\n\\t\\t */\\n\\t\\tint[][] map = new int[10][10];\\n\\t\\t// repeated at least 5 times generate 5 mines\\n\\t\\tint i = 0;\\n\\t\\twhile (i < MINE_NUMBER) {\\n\\t\\t\\t// generate mines generally\\n\\t\\t\\tint x = (int) (Math.random() * 10); // 0-9\\n\\t\\t\\tint y = (int) (Math.random() * 10); // 0-9\\n\\t\\t\\tif (map[x][y] == 1) {\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tmap[x][y] = 1;\\n\\t\\t\\ti++;\\n\\t\\t}\\n\\n\\t\\t// ready to accept user input\\n\\t\\tScanner input = new Scanner(System.in);\\n\\t\\t// how many mines been found\\n\\t\\tint find = 0;\\n\\n\\t\\t// start to accept user input\\n\\t\\twhile (find < MINE_NUMBER) {\\n\\t\\t\\tint clickX, clickY;\\n\\t\\t\\tSystem.out.println(\\\"please enter the x axis of mine\\\");\\n\\t\\t\\tclickX = input.nextInt();\\n\\t\\t\\tSystem.out.println(\\\"please enter the y axis of mine \\\");\\n\\t\\t\\tclickY = input.nextInt();\\n\\n\\t\\t\\tif (map[clickX][clickY] == 1) {\\n\\t\\t\\t\\tmap[clickX][clickY] = 2;\\n\\t\\t\\t\\tfind++;\\n\\t\\t\\t\\tSystem.out.println(\\\"You find a mine! Now you found \\\" + find + \\\" mines and \\\" + (MINE_NUMBER - find) + \\\" left!\\\");\\n\\n\\t\\t\\t} else if (map[clickX][clickY] == 2) {\\n\\t\\t\\t\\tSystem.out.println(\\\"You have found this target, try again!\\\");\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tmap[clickX][clickY] = 3;\\n\\t\\t\\t\\tSystem.out.println(\\\"You miss!\\\");\\n\\t\\t\\t\\thint(map, clickX, clickY);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tSystem.out.println(\\\"You found all the mines! You win!\\\");\\n\\t\\tinput.close();\\n\\t}\",\n \"public void showSolveFrom(String message);\",\n \"public void solve(int x, int y, int number)\\r\\n\\t{\\r\\n\\t\\t\\r\\n\\t}\",\n \"public void trySolve() {\\n\\t\\tboolean change = true;\\n\\t\\twhile (change) {\\n\\t\\t\\tchange = boardSolve();\\n\\t\\t}\\n\\t}\",\n \"public static void main(String[] args) {\\n\\n // create initial board from file\\n In in = new In(args[0]);\\n int N = in.readInt();\\n int[][] tiles = new int[N][N];\\n for (int i = 0; i < N; i++)\\n for (int j = 0; j < N; j++)\\n tiles[i][j] = in.readInt();\\n Board initial = new Board(tiles);\\n\\n // check if puzzle is solvable; if so, solve it and output solution\\n if (initial.isSolvable()) {\\n Solver solver = new Solver(initial);\\n StdOut.println(\\\"Minimum number of moves = \\\" + solver.moves());\\n for (Board board : solver.solution())\\n StdOut.println(board);\\n }\\n\\n // if not, report unsolvable\\n else {\\n StdOut.println(\\\"Unsolvable puzzle\\\");\\n }\\n}\",\n \"private void initializeGrid(Boolean makeMaze) {\\r\\n\\t\\t\\tint oldRows = rows;\\r\\n\\t\\t\\tint oldColumns = columns;\\r\\n\\t\\t\\ttry {\\r\\n\\t\\t\\t\\tif (!rowsField.getText().isEmpty()) {\\r\\n\\t\\t\\t\\t\\trows = Integer.parseInt(rowsField.getText());\\r\\n\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\tJOptionPane.showMessageDialog(this, \\\"O Número de Linhas tem que ser respeitado! (5~50)\\\", \\\"Erro\\\",\\r\\n\\t\\t\\t\\t\\t\\t\\tJOptionPane.ERROR_MESSAGE);\\r\\n\\t\\t\\t\\t\\trows = oldRows;\\r\\n\\t\\t\\t\\t\\treturn;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t} catch (NumberFormatException ex) {\\r\\n\\t\\t\\t\\tJOptionPane.showMessageDialog(this, \\\"O Número de Linhas tem que ser respeitado! (5~50)\\\", \\\"Erro\\\",\\r\\n\\t\\t\\t\\t\\t\\tJOptionPane.ERROR_MESSAGE);\\r\\n\\t\\t\\t\\trows = oldRows;\\r\\n\\t\\t\\t\\treturn;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tif (rows < 5 || rows > 50) {\\r\\n\\t\\t\\t\\tJOptionPane.showMessageDialog(this, \\\"O Número de Linhas tem que ser respeitado! (5~50)\\\", \\\"Erro\\\",\\r\\n\\t\\t\\t\\t\\t\\tJOptionPane.ERROR_MESSAGE);\\r\\n\\t\\t\\t\\trows = oldRows;\\r\\n\\t\\t\\t\\treturn;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\ttry {\\r\\n\\t\\t\\t\\tif (!columnsField.getText().isEmpty()) {\\r\\n\\t\\t\\t\\t\\tcolumns = Integer.parseInt(columnsField.getText());\\r\\n\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\tJOptionPane.showMessageDialog(this, \\\"O Número de Colunas tem que ser respeitado! (5~50)\\\", \\\"Erro\\\",\\r\\n\\t\\t\\t\\t\\t\\t\\tJOptionPane.ERROR_MESSAGE);\\r\\n\\t\\t\\t\\t\\tcolumns = oldColumns;\\r\\n\\t\\t\\t\\t\\treturn;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t} catch (NumberFormatException ex) {\\r\\n\\t\\t\\t\\tJOptionPane.showMessageDialog(this, \\\"O Número de Colunas tem que ser respeitado! (5~50)\\\", \\\"Erro\\\",\\r\\n\\t\\t\\t\\t\\t\\tJOptionPane.ERROR_MESSAGE);\\r\\n\\t\\t\\t\\tcolumns = oldColumns;\\r\\n\\t\\t\\t\\treturn;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tif (columns < 5 || columns > 50) {\\r\\n\\t\\t\\t\\tJOptionPane.showMessageDialog(this, \\\"O Número de Colunas tem que ser respeitado! (5~50)\\\", \\\"Erro\\\",\\r\\n\\t\\t\\t\\t\\t\\tJOptionPane.ERROR_MESSAGE);\\r\\n\\t\\t\\t\\tcolumns = oldColumns;\\r\\n\\t\\t\\t\\treturn;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tsquareSize = 500 / (rows > columns ? rows : columns);\\r\\n\\t\\t\\tarrowSize = squareSize / 2;\\r\\n\\t\\t\\t// the maze must have an odd number of rows and columns\\r\\n\\t\\t\\tif (makeMaze && rows % 2 == 0) {\\r\\n\\t\\t\\t\\trows -= 1;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tif (makeMaze && columns % 2 == 0) {\\r\\n\\t\\t\\t\\tcolumns -= 1;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tgrid = new int[rows][columns];\\r\\n\\t\\t\\trobotStart = new Cell(rows - 2, 1);\\r\\n\\t\\t\\ttargetPos = new Cell(1, columns - 2);\\r\\n\\t\\t\\tdfs.setEnabled(true);\\r\\n\\t\\t\\tdfs.setSelected(true);\\r\\n\\t\\t\\tbfs.setEnabled(true);\\r\\n\\t\\t\\taStar.setEnabled(true);\\r\\n\\t\\t\\tguloso.setEnabled(true);\\r\\n\\t\\t\\tdijkstra.setEnabled(true);\\r\\n\\t\\t\\tdiagonal.setSelected(false);\\r\\n\\t\\t\\tdiagonal.setEnabled(true);\\r\\n\\t\\t\\tdrawArrows.setSelected(false);\\r\\n\\t\\t\\tdrawArrows.setEnabled(true);\\r\\n\\t\\t\\tslider.setValue(500);\\r\\n\\t\\t\\tif (makeMaze) {\\r\\n\\t\\t\\t\\tMyMaze maze = new MyMaze(rows / 2, columns / 2);\\r\\n\\t\\t\\t} else {\\r\\n\\t\\t\\t\\tfillGrid();\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\",\n \"private void exploreMines(int option) {\\n\\t\\tfor(int i = 0; i < numberOfMines; i++) {\\n\\t\\t\\tboard[rowCoordinates[i]][cowCoordinates[i]] = \\\"*\\\";\\n\\t\\t}\\n\\t\\toutputBoard();\\n\\t\\tif(option == 1) {\\n\\t\\t\\tSystem.out.println(\\\"YOU LOSE!\\\");\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tSystem.out.println(\\\"YOU WIN!\\\");\\n\\t\\t}\\n\\t}\",\n \"private MazeSolver.SolveType getSolveType() {\\r\\n//\\t\\tif (huggingRadioButton.isSelected()) return MazeSolver.SolveType.HUG_LEFT;\\r\\n//\\t\\tif (recursiveRadioButton.isSelected()) return MazeSolver.SolveType.RECURSIVE;\\r\\n\\t\\treturn MazeSolver.SolveType.HUG_LEFT;\\r\\n\\t}\",\n \"public abstract void solve();\",\n \"public void selectRouteChoice()\\n\\t{\\n\\t\\tRoutePlanner planner = new RoutePlanner();\\n\\t\\tthis.sequence = ap.listSequences.get(numTrips);\\n\\t\\t// only minimisation\\n\\t\\tif (ap.routeChoice.equals(\\\"DS\\\")) newPath = planner.roadDistance(originNode, destinationNode, ap);\\n\\t\\telse if (ap.routeChoice.equals(\\\"AC\\\")) newPath = planner.angularChangeBased(originNode, destinationNode, ap);\\n\\t\\telse if (ap.routeChoice.equals(\\\"TS\\\")) newPath = planner.angularChangeBased(originNode, destinationNode, ap);\\n\\t\\t// minimisation plus only global landmarks\\n\\t\\telse if (ap.routeChoice.equals(\\\"DG\\\")) newPath = planner.roadDistance(originNode, destinationNode, ap);\\n\\t\\telse if (ap.routeChoice.equals(\\\"AG\\\")) newPath = planner.angularChangeBased(originNode, destinationNode, ap);\\n\\t\\t// minimisation plus local and (optionally) global landmarks\\n\\t\\telse if (ap.routeChoice.contains(\\\"D\\\") && ap.routeChoice.contains(\\\"L\\\")) newPath = planner.roadDistanceSequence(sequence, ap);\\n\\t\\telse if (ap.routeChoice.contains(\\\"A\\\") && ap.routeChoice.contains(\\\"L\\\")) newPath = planner.angularChangeBasedSequence(sequence, ap);\\n\\t\\t// anything with regions and/or barriers, or just barriers\\n\\t\\telse if (ap.routeChoice.contains(\\\"R\\\")) newPath = planner.regionBarrierBasedPath(originNode, destinationNode, ap);\\n\\t\\telse if (ap.routeChoice.contains(\\\"B\\\")) newPath = planner.barrierBasedPath(originNode, destinationNode, ap);\\n\\t}\",\n \"protected static int easyIn() {\\n // ADDITIONAL CHECKS?\\n int a;\\n debug(\\\"Please enter your selection: \\\");\\n scanner = new Scanner(System.in);\\n\\t\\ta = scanner.nextInt();\\n return a;\\n }\",\n \"public void testSolve2() {\\n test = new Location(0, 1);\\n maze2.setCell(test, MazeCell.WALL);\\n test = new Location(1, 0);\\n maze2.setCell(test, MazeCell.WALL);\\n assertEquals(null, maze2.solve());\\n }\",\n \"public void consoleBoardInput(){\\n\\t\\tBufferedReader in = new BufferedReader(new InputStreamReader(System.in));\\n\\t\\tString input;\\n\\t\\tint row=0,col=0;\\n\\t\\t\\n\\t\\tSystem.out.println(\\\"Current symbol: \\\" + ttt.getCurrentSymbol());\\n\\t\\t\\n\\t\\t//get row\\n\\t\\tdo{\\n\\t\\t\\ttry{\\n\\t\\t\\t\\tSystem.out.print(\\\"Enter Row: \\\");\\n\\t\\t\\t\\tinput=in.readLine();\\n\\t\\t\\t\\trow = Integer.parseInt(input);\\n\\t\\t\\t\\tif (row<0 || row>2) throw new IllegalArgumentException();\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\tcatch(Exception e){\\n\\t\\t\\t\\tSystem.out.println(\\\"Invalid input\\\");\\n\\t\\t\\t}\\n\\t\\t}while(true);\\n\\t\\t\\n\\t\\t//get column\\n\\t\\tdo{\\n\\t\\t\\ttry{\\n\\t\\t\\t\\tSystem.out.print(\\\"Enter Col: \\\");\\n\\t\\t\\t\\tinput=in.readLine();\\n\\t\\t\\t\\tcol = Integer.parseInt(input);\\n\\t\\t\\t\\tif (col<0 || col>2) throw new IllegalArgumentException();\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\tcatch(Exception e){\\n\\t\\t\\t\\tSystem.out.println(\\\"Invalid input\\\");\\n\\t\\t\\t}\\n\\t\\t}while(true);\\n\\t\\t\\n\\t\\t//check whether selected cell is valid\\n\\t\\tif (!ttt.placeMove(row,col))\\n\\t\\t\\tSystem.out.println(\\\"Selected cell already filled. Try again.\\\");\\n\\t}\",\n \"private void readMaze(Scanner scan) //throws FileNotFoundException\\n\\t{\\n\\t\\t// initialize the square matrix\\n\\t\\ttopology = new int[row][col];\\n\\t\\t// str stores temporary character read in\\n\\t\\tString str = \\\"\\\";\\n\\t\\t// read in the matrix for square\\n\\t\\t// loop through # of rows\\n\\t\\tfor(int i =0; i< row; i++)\\n\\t\\t{\\n\\t\\t\\t// check if there is a next line then read \\n\\t\\t\\tif(scan.hasNextLine())\\n\\t\\t\\t{\\n\\t\\t\\t\\tString line = scan.nextLine();\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t// make a scanner for that line\\n\\t\\t\\t\\t//Scanner scanLine = new Scanner(line);\\n\\t\\t\\t\\t// read in each line\\n\\t\\t\\t\\tfor(int j =0; j<col; j++){\\n\\t\\t\\t\\t\\t// make sure there are col # of entries in a row\\n\\t\\t\\t\\t\\ttry{\\n\\t\\t\\t\\t\\tstr = line.charAt(j)+\\\"\\\";\\n\\t\\t\\t\\t\\t// open space\\n\\t\\t\\t\\t\\tif(str.equals(\\\".\\\")) topology[i][j]= -1;\\n\\t\\t\\t\\t\\t//wall\\n\\t\\t\\t\\t\\telse if(str.equals(\\\"#\\\")) topology[i][j]=-2;\\n\\t\\t\\t\\t\\t//start\\n\\t\\t\\t\\t\\telse if(str.equals(\\\"S\\\")){\\n\\t\\t\\t\\t\\t\\ttopology[i][j] = 0;\\n\\t\\t\\t\\t\\t\\t// enqueue this element to the qCells\\n\\t\\t\\t\\t\\t\\tqCells.enQueue(new Point(i,j));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t//stop\\n\\t\\t\\t\\t\\telse if(str.equals(\\\"D\\\")){\\n\\t\\t\\t\\t\\t\\ttopology[i][j] = -3;\\n\\t\\t\\t\\t\\t\\t// push this on the path stack\\n\\t\\t\\t\\t\\t\\tsPath.push(new Point(i,j));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t// otherwise wrong format\\n\\t\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"This is wrong \\\"+str);\\n\\t\\t\\t\\t\\t\\tthrow new InputMismatchException(\\\"Illegal input\\\");\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}catch(StringIndexOutOfBoundsException e){\\n\\t\\t\\t\\t\\t\\tthrow new StringIndexOutOfBoundsException(\\\"Not enough inputs in a row\\\");\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t} // end of j loop\\n\\t\\t\\t\\t//too many inputs on a row\\n\\t\\t\\t\\tif(line.length()>col) throw new InputMismatchException(\\\"Extra input in row \\\"+ i+ \\\" is \\\" + str);\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t}// end of if has next line\\n\\t\\t\\telse{\\n\\t\\t\\t\\t//not enough line\\n\\t\\t\\t\\tthrow new InputMismatchException(\\\"Two few rows.\\\");\\n\\t\\t\\t}\\n\\t\\t}// end of i loop\\n\\t\\t// check if there are too many rows\\n\\t\\tif(scan.hasNextLine()) throw new InputMismatchException(\\\"Two many rows.\\\");\\n\\t}\",\n \"public static void userInput(){\\r\\n System.out.println(\\\"Enter the coordinates: \\\");\\r\\n if (!sc.hasNextInt()) {\\r\\n System.out.println(\\\"You should enter numbers!\\\");\\r\\n sc.next(); // Need this to get rid of the 2nd entry\\r\\n userInput();\\r\\n } else {\\r\\n int x = sc.nextInt();\\r\\n int y = sc.nextInt();\\r\\n if (x > 3 || x < 1 || y > 3 || y < 1) {\\r\\n System.out.println(\\\"Coordinates should be from 1 to 3!\\\");\\r\\n userInput();\\r\\n } // Check if space is free\\r\\n else if (output[3 - y][x - 1] != ' '){\\r\\n System.out.println(\\\"This cell is occupied! Choose another one!\\\");\\r\\n userInput();\\r\\n } else {\\r\\n inputXO = totalMovesPlaced % 2 == 0 ? 'X' : 'O';\\r\\n output[3 - y][x - 1] = inputXO;\\r\\n totalMovesPlaced++;\\r\\n }\\r\\n }\\r\\n totalMoves++;\\r\\n }\",\n \"public static void main(String[] args){\\n\\t\\tSystem.out.print(\\\"This was the initial input\\\");\\r\\n\\t\\tfillBoard();\\r\\n\\t\\tprintSudoBoard(table);\\r\\n\\t\\tsolve(table);\\r\\n\\t\\t//prints the final board\\r\\n\\t\\tSystem.out.print(\\\"This is the answer to the board\\\");\\r\\n\\t\\tprintSudoBoard(table);\\r\\n\\r\\n\\r\\n\\r\\n\\t}\",\n \"public void chooseAlgorithm() {\\n boolean runloop = true;\\n CustomArrayList<Integer>[] graph = null;\\n graph = util.initializeCNF(statement);\\n while (runloop) {\\n io.println(\\\"Which algorithm do you want to use to solve this?\\\");\\n io.println(\\\"1: Tarjan algorithm\\\\n2: Kosaraju algorithm\\\\n3: Brute force method\\\\n4: Print the truth distribution that solves the CNF\\\\n5: return\\\");\\n String selection = io.nextLine();\\n switch (selection) {\\n case (\\\"1\\\"):\\n tarjan = new TarjanAlgorithm(graph, numVariables);\\n TarjanPrint();\\n break;\\n case (\\\"2\\\"):\\n kosaraju = new KosarajuAlgorithm(graph, numVariables);\\n KosarajuPrint();\\n break;\\n case (\\\"3\\\"):\\n io.println(\\\"Warning! Brute force method has an exponential time complexity. Using this with CNF with more than 20 variables will take a really long time. \\\");\\n io.println(\\\"Continue? y/n\\\");\\n String affirmate = io.nextLine();\\n switch (affirmate) {\\n case (\\\"y\\\"):\\n bruteForcePrint();\\n break;\\n case (\\\"n\\\"):\\n break;\\n }\\n break;\\n case (\\\"4\\\"):\\n tarjan = new TarjanAlgorithm(graph, numVariables);\\n if (tarjan.checkSatisfiability()) {\\n printTruthAssesment();\\n } else {\\n io.println(\\\"Not satisfiable\\\");\\n }\\n break;\\n case (\\\"5\\\"):\\n io.println(\\\"Returning to main menu...\\\");\\n runloop = false;\\n break;\\n }\\n }\\n }\",\n \"void maze(char[][] mz, int p_row, int p_col, int h_row, int h_col){\\n \\n if (mz[p_row][p_col] == 'F'){\\n //Base case -End maze\\n printMaze(mz);\\n System.out.println(\\\"Maze Successfully Completed!\\\");\\n } else {\\n if (h_row-1 == p_row){\\n //If facing East\\n if(mz[h_row][h_col] != '#'){ //If right turn available\\n //Update player\\n mz[p_row][p_col] = 'X'; \\n p_row += 1;\\n p_col += 0;\\n if (mz[p_row][p_col] == 'F'){\\n mz[p_row][p_col] = 'F';\\n } else {\\n mz[p_row][p_col] = 'O';\\n }\\n //Update hand\\n h_row += 0;\\n h_col -= 1;\\n printMaze(mz); \\n } else { \\n //If hand position is a wall check in front of player\\n if(mz[p_row][p_col+1] != '#'){\\n //Update player\\n mz[p_row][p_col] = 'X';\\n p_row += 0;\\n p_col += 1;\\n if (mz[p_row][p_col] == 'F'){\\n mz[p_row][p_col] = 'F';\\n } else {\\n mz[p_row][p_col] = 'O';\\n }\\n //Update hand\\n h_row += 0;\\n h_col += 1;\\n printMaze(mz);\\n } else if (mz[p_row-1][p_col] != '#'){\\n //Turn left 90 and if not a wall move up\\n //Update player\\n mz[p_row][p_col] = 'X';\\n p_row -= 1;\\n p_col += 0;\\n if (mz[p_row][p_col] == 'F'){\\n mz[p_row][p_col] = 'F';\\n } else {\\n mz[p_row][p_col] = 'O';\\n }\\n //Update hand\\n h_row -= 2;\\n h_col += 1;\\n printMaze(mz);\\n } else {\\n //Turn around\\n //Update player\\n mz[p_row][p_col] = 'X';\\n p_row += 0;\\n p_col -= 1;\\n if (mz[p_row][p_col] == 'F'){\\n mz[p_row][p_col] = 'F';\\n } else {\\n mz[p_row][p_col] = 'O';\\n }\\n //Update hand\\n h_row -= 2;\\n h_col -= 1;\\n printMaze(mz);\\n }\\n }\\n } else if (h_row+1 == p_row){\\n //If facing West\\n if(mz[h_row][h_col] != '#'){\\n //Look right\\n mz[p_row][p_col] = 'X'; \\n p_row -= 1;\\n p_col += 0;\\n if (mz[p_row][p_col] == 'F'){\\n mz[p_row][p_col] = 'F';\\n } else {\\n mz[p_row][p_col] = 'O';\\n }\\n //Update hand\\n h_row -= 0;\\n h_col += 1;\\n printMaze(mz);\\n } else { \\n //If hand position is a wall check in front of player\\n if(mz[p_row][p_col-1] != '#'){\\n //Update player\\n mz[p_row][p_col] = 'X';\\n p_row += 0;\\n p_col -= 1;\\n if (mz[p_row][p_col] == 'F'){\\n mz[p_row][p_col] = 'F';\\n } else {\\n mz[p_row][p_col] = 'O';\\n }\\n //Update hand\\n h_row += 0;\\n h_col -= 1;\\n printMaze(mz);\\n } else if (mz[p_row+1][p_col] != '#'){\\n //Turn left 90 and if not a wall move up\\n //Update player\\n mz[p_row][p_col] = 'X';\\n p_row += 1;\\n p_col -= 0;\\n if (mz[p_row][p_col] == 'F'){\\n mz[p_row][p_col] = 'F';\\n } else {\\n mz[p_row][p_col] = 'O';\\n }\\n //Update hand\\n h_row += 2;\\n h_col -= 1;\\n printMaze(mz);\\n } else {\\n //Turn around\\n //Update player\\n mz[p_row][p_col] = 'X';\\n p_row -= 0;\\n p_col += 1;\\n if (mz[p_row][p_col] == 'F'){\\n mz[p_row][p_col] = 'F';\\n } else {\\n mz[p_row][p_col] = 'O';\\n }\\n //Update hand\\n h_row += 2;\\n h_col += 1;\\n printMaze(mz);\\n }\\n }\\n \\n } else if (h_col -1 == p_col){\\n //If facing North\\n if(mz[h_row][h_col] != '#'){ \\n //Take right if available\\n //Update player\\n mz[p_row][p_col] = 'X'; \\n p_row += 0;\\n p_col += 1;\\n if (mz[p_row][p_col] == 'F'){\\n mz[p_row][p_col] = 'F';\\n } else {\\n mz[p_row][p_col] = 'O';\\n }\\n //Update hand\\n h_row += 1;\\n h_col -= 0;\\n printMaze(mz); \\n } else {\\n //If hand position is a wall check in front of player\\n if(mz[p_row-1][p_col] != '#'){\\n //Update player\\n mz[p_row][p_col] = 'X';\\n p_row -= 1;\\n p_col += 0;\\n if (mz[p_row][p_col] == 'F'){\\n mz[p_row][p_col] = 'F';\\n } else {\\n mz[p_row][p_col] = 'O';\\n }\\n //Update hand\\n h_row -= 1;\\n h_col += 0;\\n printMaze(mz);\\n } else if (mz[p_row][p_col-1] != '#'){\\n //Turn left 90 and if not a wall move up\\n //Update player\\n mz[p_row][p_col] = 'X';\\n p_row -= 0;\\n p_col -= 1;\\n if (mz[p_row][p_col] == 'F'){\\n mz[p_row][p_col] = 'F';\\n } else {\\n mz[p_row][p_col] = 'O';\\n }\\n //Update hand\\n h_row -= 1;\\n h_col -= 2;\\n printMaze(mz);\\n } else {\\n //Turn around\\n //Update player\\n mz[p_row][p_col] = 'X';\\n p_row -= 1;\\n p_col += 0;\\n if (mz[p_row][p_col] == 'F'){\\n mz[p_row][p_col] = 'F';\\n } else {\\n mz[p_row][p_col] = 'O';\\n }\\n //Update hand\\n h_row += 1;\\n h_col -= 2;\\n printMaze(mz);\\n }\\n }\\n } else if (h_col+1 == p_col){\\n //If facing South\\n if(mz[h_row][h_col] != '#'){\\n //Look right\\n mz[p_row][p_col] = 'X'; \\n p_row -= 0;\\n p_col -= 1;\\n if (mz[p_row][p_col] == 'F'){\\n mz[p_row][p_col] = 'F';\\n } else {\\n mz[p_row][p_col] = 'O';\\n }\\n //Update hand\\n h_row -= 1;\\n h_col += 0;\\n printMaze(mz);\\n } else { \\n //If hand position is a wall check in front of player\\n if(mz[p_row+1][p_col] != '#'){\\n //Update player\\n mz[p_row][p_col] = 'X';\\n p_row += 1;\\n p_col += 0;\\n if (mz[p_row][p_col] == 'F'){\\n mz[p_row][p_col] = 'F';\\n } else {\\n mz[p_row][p_col] = 'O';\\n }\\n //Update hand\\n h_row += 1;\\n h_col += 0;\\n printMaze(mz);\\n } else if (mz[p_row][p_col+1] != '#'){\\n //Turn left 90 and if not a wall move up\\n //Update player\\n mz[p_row][p_col] = 'X';\\n p_row += 0;\\n p_col += 1;\\n if (mz[p_row][p_col] == 'F'){\\n mz[p_row][p_col] = 'F';\\n } else {\\n mz[p_row][p_col] = 'O';\\n }\\n //Update hand\\n h_row += 1;\\n h_col += 2;\\n printMaze(mz);\\n } else {\\n //Turn around\\n //Update player\\n mz[p_row][p_col] = 'X';\\n p_row -= 0;\\n p_col += 1;\\n if (mz[p_row][p_col] == 'F'){\\n mz[p_row][p_col] = 'F';\\n } else {\\n mz[p_row][p_col] = 'O';\\n }\\n //Update hand\\n h_row += 2;\\n h_col += 1;\\n printMaze(mz);\\n }\\n }\\n \\n }\\n maze(mz, p_row, p_col, h_row, h_col); \\n }\\n }\",\n \"private void problemSolve (String folderName, ArrayList<String> loader1, ArrayList<String> loader2) throws IOException {\\n Object[] pValue = { WED_ZERO.lang.getInstruct().get(1)[20], WED_ZERO.lang.getInstruct().get(1)[21],WED_ZERO.lang.getInstruct().get(1)[22], WED_ZERO.lang.getInstruct().get(1)[23] };\\n Object selectedValue = JOptionPane.showInputDialog(null,\\n WED_ZERO.lang.getInstruct().get(1)[24]+\\\" \\\"+\\\"\\\\\\\"\\\"+folderName+\\\"\\\\\\\" \\\"+WED_ZERO.lang.getInstruct().get(1)[25], WED_ZERO.lang.getInstruct().get(1)[26], JOptionPane.INFORMATION_MESSAGE, null, pValue, pValue[0]);\\n if(selectedValue==null||(selectedValue.equals(pValue[3]))) {\\n int res = JOptionPane.showConfirmDialog(null, WED_ZERO.lang.getInstruct().get(1)[27], WED_ZERO.lang.getInstruct().get(1)[12],\\n JOptionPane.YES_NO_OPTION, JOptionPane.QUESTION_MESSAGE);\\n if(res==JOptionPane.YES_OPTION) {\\n return;\\n } else {\\n this.problemSolve(folderName, loader1, loader2);\\n }\\n } else if(selectedValue.equals(pValue[0])) {\\n int res = JOptionPane.showConfirmDialog(null, WED_ZERO.lang.getInstruct().get(1)[28], WED_ZERO.lang.getInstruct().get(1)[12],\\n JOptionPane.YES_NO_OPTION, JOptionPane.QUESTION_MESSAGE);\\n if(res==JOptionPane.YES_OPTION) {\\n this.replaceData(folderName, loader1, loader2);\\n this.refresh();\\n } else {\\n this.problemSolve(folderName, loader1, loader2);\\n }\\n } else if(selectedValue.equals(pValue[1])) {\\n this.renameFolder(folderName, loader1, loader2);\\n this.refresh();\\n } else if(selectedValue.equals(pValue[2])) {\\n this.getFile(null);\\n selectedValue = JOptionPane.showInputDialog(null,\\n WED_ZERO.lang.getInstruct().get(1)[29]+\\\": \\\", WED_ZERO.lang.getInstruct().get(1)[25], JOptionPane.INFORMATION_MESSAGE, null, this.getListOfFileInArray(), Arrays.asList(this.getListOfFileInArray()).indexOf(folderName));\\n if(selectedValue!=null) {\\n this.merge(selectedValue.toString(), loader1, loader2);\\n } else {\\n this.problemSolve(folderName, loader1, loader2);\\n }\\n }\\n }\",\n \"private void escapeFromMaze() throws Exception {\\n\\t\\tassert robot.distanceToObstacle(Direction.BACKWARD) != Integer.MAX_VALUE : \\\"Unexpected exit environment.\\\";\\n\\t\\t\\n\\t\\tswitch(robot.getCurrentDirection()){\\n\\t\\t\\tcase East:\\n\\t\\t\\t\\tif(robot.getController().getMazeConfiguration().getMazecells().hasNoWall(robot.getCurrentPosition()[0], robot.getCurrentPosition()[1], CardinalDirection.East)\\n\\t\\t\\t\\t\\t\\t&& !robot.getController().getMazeConfiguration().isValidPosition(robot.getCurrentPosition()[0]+1, robot.getCurrentPosition()[1])){\\n\\t\\t\\t\\t\\trobot.move(1, false);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if(robot.getController().getMazeConfiguration().getMazecells().hasNoWall(robot.getCurrentPosition()[0], robot.getCurrentPosition()[1], CardinalDirection.North)){\\n\\t\\t\\t\\t\\trobot.rotate(Turn.RIGHT);\\n\\t\\t\\t\\t\\trobot.move(1, false);\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\trobot.rotate(Turn.LEFT);\\n\\t\\t\\t\\t\\trobot.move(1, false);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase West:\\n\\t\\t\\t\\tif(robot.getController().getMazeConfiguration().getMazecells().hasNoWall(robot.getCurrentPosition()[0], robot.getCurrentPosition()[1], CardinalDirection.West)\\n\\t\\t\\t\\t\\t\\t&& !robot.getController().getMazeConfiguration().isValidPosition(robot.getCurrentPosition()[0]-1, robot.getCurrentPosition()[1])){\\n\\t\\t\\t\\t\\trobot.move(1, false);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (robot.getController().getMazeConfiguration().getMazecells().hasNoWall(robot.getCurrentPosition()[0], robot.getCurrentPosition()[1], CardinalDirection.North)){\\n\\t\\t\\t\\t\\trobot.rotate(Turn.LEFT);\\n\\t\\t\\t\\t\\trobot.move(1, false);\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\trobot.rotate(Turn.RIGHT);\\n\\t\\t\\t\\t\\trobot.move(1, false);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase North:\\n\\t\\t\\t\\tif(robot.getController().getMazeConfiguration().getMazecells().hasNoWall(robot.getCurrentPosition()[0], robot.getCurrentPosition()[1], CardinalDirection.North)\\n\\t\\t\\t\\t\\t\\t&& !robot.getController().getMazeConfiguration().isValidPosition(robot.getCurrentPosition()[0], robot.getCurrentPosition()[1]-1)){\\n\\t\\t\\t\\t\\trobot.move(1, false);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (robot.getController().getMazeConfiguration().getMazecells().hasNoWall(robot.getCurrentPosition()[0], robot.getCurrentPosition()[1], CardinalDirection.East)){\\n\\t\\t\\t\\t\\trobot.rotate(Turn.LEFT);\\n\\t\\t\\t\\t\\trobot.move(1, false);\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\trobot.rotate(Turn.RIGHT);\\n\\t\\t\\t\\t\\trobot.move(1, false);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase South:\\n\\t\\t\\t\\tif(robot.getController().getMazeConfiguration().getMazecells().hasNoWall(robot.getCurrentPosition()[0], robot.getCurrentPosition()[1], CardinalDirection.South)\\n\\t\\t\\t\\t\\t\\t&& !robot.getController().getMazeConfiguration().isValidPosition(robot.getCurrentPosition()[0], robot.getCurrentPosition()[1]+1)){\\n\\t\\t\\t\\t\\trobot.move(1, false);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (robot.getController().getMazeConfiguration().getMazecells().hasNoWall(robot.getCurrentPosition()[0], robot.getCurrentPosition()[1], CardinalDirection.West)){\\n\\t\\t\\t\\t\\trobot.rotate(Turn.LEFT);\\n\\t\\t\\t\\t\\trobot.move(1, false);\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\trobot.rotate(Turn.RIGHT);\\n\\t\\t\\t\\t\\trobot.move(1, false);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"public static void solveMaze(String inputFile, String outputFile) {\\r\\n\\r\\n\\t\\ttry {\\r\\n\\t\\t\\tGraph testGraph = new Graph(inputFile);\\r\\n\\t\\t\\ttestGraph.breadthFirstSearch();\\r\\n\\t\\t\\tPrintStream output;\\r\\n\\t\\t\\toutput = new PrintStream(new FileOutputStream(outputFile));\\r\\n\\t\\t\\toutput.print(testGraph.printMap());\\r\\n\\t\\t\\toutput.close();\\r\\n\\t\\t} \\r\\n\\t\\tcatch (FileNotFoundException e) {\\r\\n\\t\\t\\te.printStackTrace();\\r\\n\\t\\t}\\r\\n\\t}\",\n \"private static int askForGoMainMenu(String message){\\n\\t\\tshowMessage(message);\\n\\t\\tBufferedReader myReader = new BufferedReader(new InputStreamReader(System.in));\\n\\t\\tint input;\\n\\n\\t\\tdo {\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tinput = Integer.parseInt(myReader.readLine());\\n\\n\\t\\t\\t\\tif ((input < 0) || (input>1)) {\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"Please type 1 or 2.\\\\n\\\");\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}catch (Exception e) {\\n\\t\\t\\t\\tSystem.out.println(\\\"Character invalid. Choose 1 or 2.\\\\n\\\");\\n\\t\\t\\t\\tinput = 0;\\n\\t\\t\\t}\\n\\n\\n\\t\\t}\\n\\t\\twhile ((input < 0) || (input>1));\\n\\n\\t\\treturn input;\\n\\n\\t}\",\n \"private boolean solve(int row, int col){\\n\\n if (col >= 9){\\n return true;\\n }\\n\\t\\n\\t\\t\\n\\t\\t// If the cell is not empty and the number is not preset\\n\\t\\t//\\tskip to the next number\\n\\t\\tif( puzzle[row][col] != 0 ){\\n\\t\\t\\tif(row == 8){\\n\\t\\t\\t\\tif(solve(0,col+1)){\\n\\n\\t\\t\\t\\t\\treturn true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tif(solve(row+1,col)){\\n\\n\\t\\t\\t\\t\\treturn true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t\\t \\n\\t\\t\\n\\t // Find a valid number for the empty cell\\n\\t\\tfor( int num = 1; num <= MAX_VALUE; num++ ){\\n\\t\\t\\t\\n\\t\\t if( validate(row,col,num) )\\n\\t\\t {\\n\\t\\t \\tpuzzle[row][col] = num ;\\n\\t\\t\\n\\t\\t \\t\\n\\t\\t \\t// next number\\t\\t \\t\\n\\t \\t\\tif(row == 8){\\n\\t\\t\\t\\t\\tif(solve(0,col+1)){\\n\\n\\t\\t\\t\\t\\t\\treturn true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tif(solve(row+1,col)){\\n\\n\\t\\t\\t\\t\\t\\treturn true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t \\t\\t\\n\\t \\t\\t// No solution found\\n\\t \\t\\tpuzzle[row][col] = 0;\\n\\t\\t }\\n\\t\\t}\\n\\t\\treturn false;\\t\\t\\t\\n\\t\\n\\t}\",\n \"private static List<Move> pathSolve(Level level){\\n\\t\\tOptimisticMap optMap = new OptimisticMap(level);\\n\\t\\t\\n\\t\\tPoint dst = level.getExitPos();\\n\\t\\t\\n\\t\\t// Open nodes\\n\\t\\tSortedMap<Integer, List<SolveNode>> nodes = new TreeMap<Integer, List<SolveNode>>();\\n\\t\\t\\n\\t\\t// Current costs to arrive to solve nodes\\n\\t\\tint[][][] arrived = new int[level.getMapSize().x][level.getMapSize().y][Move.values().length];\\n\\t\\tfor ( int x = 0 ; x < level.getMapSize().x ; x++ ){\\n\\t\\t\\tfor ( int y = 0 ; y < level.getMapSize().y ; y++ ){\\n\\t\\t\\t\\tfor ( int d = 0 ; d < Move.values().length ; d++ ){\\n\\t\\t\\t\\t\\tarrived[x][y][d] = Integer.MAX_VALUE;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t// Create initial nodes\\n\\t\\t{\\n\\t\\t\\tPoint box = level.getBoxPos();\\n\\t\\t\\tPoint player = level.getPlayerPos();\\n\\t\\t\\tfor ( Move dir : Move.values()){\\n\\t\\t\\t\\tPoint playerDst = dir.nextPosition(box);\\n\\t\\t\\t\\tif ( level.isClearSafe(playerDst.x, playerDst.y)){\\n\\t\\t\\t\\t\\tList<Move> pathNoDesiredPlayerPosition = pathTo(level, player, box, playerDst);\\n\\t\\t\\t\\t\\tif ( pathNoDesiredPlayerPosition != null ){\\n\\t\\t\\t\\t\\t\\tSolveNode node = new SolveNode();\\n\\t\\t\\t\\t\\t\\tnode.moves = pathNoDesiredPlayerPosition;\\n\\t\\t\\t\\t\\t\\tnode.box = (Point)box.clone();\\n\\t\\t\\t\\t\\t\\tnode.playerDir = dir;\\n\\t\\t\\t\\t\\t\\taddSolveNode(nodes, node, node.moves.size() + optMap.getValue(node.box.x, node.box.y));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\twhile ( nodes.isEmpty() == false ){\\n\\t\\t\\t// Get node to process\\n\\t\\t\\tSolveNode node = removeSolveNode(nodes);\\n\\t\\t\\tif ( node.box.equals(dst) ){\\n\\t\\t\\t\\t// This is the best solution\\n\\t\\t\\t\\treturn node.moves;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t// Create new nodes trying to move the box in each direction\\n\\t\\t\\tfor ( Move dir : Move.values() ){\\n\\t\\t\\t\\tSolveNode newNode = new SolveNode();\\n\\t\\t\\t\\tnewNode.box = dir.nextPosition(node.box);\\n\\t\\t\\t\\tnewNode.playerDir = dir.opposite();\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// First check if the box can be moved to that position (is clear)\\n\\t\\t\\t\\tif ( level.isClearSafe(newNode.box.x, newNode.box.y) == false ){\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Check if the player can move to the pushing position\\n\\t\\t\\t\\tPoint player = node.playerDir.nextPosition(node.box);\\n\\t\\t\\t\\tPoint playerDst = dir.opposite().nextPosition(node.box);\\n\\t\\t\\t\\tList<Move> playerMoves = pathTo(level, player, node.box, playerDst);\\n\\t\\t\\t\\tif ( playerMoves == null ){\\n\\t\\t\\t\\t\\t// The player can't move itself to the pushing position\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Check if the cost to arrive to the new node is less that the previous known\\n\\t\\t\\t\\tif ( node.moves.size() + playerMoves.size() + 1 >= arrived[newNode.box.x][newNode.box.y][dir.index()] ){\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tSystem.out.println(\\\"\\\" + newNode.box.x + \\\" \\\" + newNode.box.y);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Add the new node to the open nodes\\n\\t\\t\\t\\tnewNode.moves.addAll(node.moves);\\n\\t\\t\\t\\tnewNode.moves.addAll(playerMoves);\\n\\t\\t\\t\\tnewNode.moves.add(dir);\\n\\t\\t\\t\\taddSolveNode(nodes, newNode, newNode.moves.size() + optMap.getValue(newNode.box.x, newNode.box.y));\\n\\t\\t\\t\\tarrived[newNode.box.x][newNode.box.y][dir.index()] = newNode.moves.size();\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t// There is no solution\\n\\t\\treturn null;\\n\\t}\",\n \"public static void getInput() {\\n\\t\\tselectOption();\\n\\t\\tsc = new Scanner(System.in);\\n\\t userInput2 = sc.nextInt();\\n\\t \\n\\t switch (userInput2) {\\n\\t \\tcase 1: System.out.print(\\\"Enter the number for the factorial function: \\\");\\n\\t \\t\\t\\tsc = new Scanner(System.in);\\n\\t\\t\\t\\t userInput2 = sc.nextInt();\\n\\t\\t\\t\\t System.out.println(\\\"The factorial of \\\" + userInput2 + \\\" is \\\" + factorial(userInput2));\\n\\t\\t\\t\\t getInput();\\n\\t\\t \\t\\tbreak;\\n\\t \\tcase 2: System.out.print(\\\"Enter the Fibonacci position: \\\");\\n\\t\\t\\t\\t\\tsc = new Scanner(System.in);\\n\\t\\t\\t\\t userInput2 = sc.nextInt();\\n\\t\\t\\t\\t System.out.println(\\\"The fibonacci number at position \\\" + userInput2 + \\\" is \\\" + fib(userInput2));\\n\\t\\t\\t\\t getInput();\\n\\t\\t \\t\\tbreak;\\n\\t \\tcase 3: System.out.print(\\\"Enter the first number: \\\");\\n\\t\\t\\t\\t\\tsc = new Scanner(System.in);\\n\\t\\t\\t\\t userInput2 = sc.nextInt();\\n\\t\\t\\t\\t System.out.print(\\\"Enter the second number: \\\");\\n\\t\\t\\t\\t sc = new Scanner(System.in);\\n\\t\\t\\t\\t userInput3 = sc.nextInt();\\n\\t\\t\\t\\t System.out.println(\\\"The GCD of the numbers \\\" + userInput2 + \\\" and \\\" + userInput3 + \\\" is \\\" + GCD(userInput2, userInput3));\\n\\t\\t\\t\\t getInput();\\n\\t\\t \\t\\tbreak;\\n\\t \\tcase 4: System.out.print(\\\"Enter n: \\\");\\n\\t\\t\\t\\t\\tsc = new Scanner(System.in);\\n\\t\\t\\t\\t userInput2 = sc.nextInt();\\n\\t\\t\\t\\t System.out.print(\\\"Enter r: \\\");\\n\\t\\t\\t\\t sc = new Scanner(System.in);\\n\\t\\t\\t\\t userInput3 = sc.nextInt();\\n\\t\\t\\t\\t System.out.println(userInput2 + \\\" choose \\\" + userInput3 + \\\" is \\\" + choose(userInput2, userInput3));\\n\\t\\t\\t\\t getInput();\\n\\t\\t \\t\\tbreak;\\n\\t \\tcase 5: System.out.print(\\\"Enter n: \\\");\\n\\t\\t\\t\\t\\tsc = new Scanner(System.in);\\n\\t\\t\\t\\t userInput2 = sc.nextInt();\\n\\t\\t\\t\\t System.out.print(\\\"Enter k: \\\");\\n\\t\\t\\t\\t sc = new Scanner(System.in);\\n\\t\\t\\t\\t userInput3 = sc.nextInt();\\n\\t\\t\\t\\t System.out.println(\\\"The Josephus of \\\" + userInput2 + \\\" and \\\" + userInput3 + \\\" is \\\" + josephus(userInput2, userInput3));\\n\\t\\t\\t\\t getInput();\\n\\t\\t \\t\\tbreak;\\n\\t \\tcase 6: System.out.println(\\\"Ending program...\\\");\\n \\t\\t\\t\\tSystem.exit(0);\\n \\t\\t\\t\\tbreak;\\n \\t\\tdefault: System.out.println(\\\"\\\\nPlease enter number between 1 and 6\\\\n\\\");\\n\\t \\t\\t\\tgetInput();\\n\\t \\t\\t\\tbreak;\\n\\t }\\t\\n\\t}\",\n \"public void generateMaze() {\\n if (this.stateOfTheMaze != 0)\\n throw new IllegalArgumentException(\\\"To generate the maze the state of it must be \\\\\\\"untouched grid\\\\\\\".\\\");\\n Stack<Box> stack = new Stack<>();\\n Random random = new Random();\\n int randomRow = random.nextInt(this.grid.length);\\n int randomColumn = random.nextInt(this.grid[randomRow].length);\\n Box startBox = this.grid[randomRow][randomColumn];\\n startBox.use();\\n stack.push(startBox);\\n while (!stack.isEmpty()) {\\n Box aux = stack.peek();\\n if (allAdjacentUsed(aux))\\n stack.pop();\\n else\\n stack.push(movement(aux));\\n }\\n this.stateOfTheMaze++;\\n }\",\n \"public static void main(String[] args) {\\n Scanner entrada = new Scanner(System.in);\\n int funcao = 0;\\n while(funcao < 1 || funcao > 3){\\n //limpa a tela\\n clrscr();\\n System.out.println(\\\" Bem-vindo ao Sudoku!\\\\n\\\\n Digite o numero da tecnica a ser utilizada:\\\\n\\\");\\n System.out.printf(\\\" 1 - Busca Informada (Best-first/guloso)\\\\n 2 - Busca Desinformada (Em profundidade)\\\\n\\\"\\n + \\\" 3 - Busca Desinformada (Em largura)\\\\n\\\\n-> \\\");\\n funcao = entrada.nextInt();\\n }\\n //Usuario escolhe nivel de dificuldade do sudoku (5 exemplos)\\n int nivel = 0;\\n while(nivel < 1 || nivel > 5){\\n System.out.println(\\\"\\\\n Digite o nivel de dificuldade do sudoku:\\\\n\\\");\\n System.out.printf(\\\" 1 - Muito facil\\\\n 2 - Facil\\\\n 3 - Medio\\\\n 4 - Dificil\\\\n 5 - Muito Dificil\\\\n\\\\n-> \\\");\\n nivel = entrada.nextInt();\\n }\\n //Usuario define velocidade de execução do algoritmo\\n int execSpeed = 1;\\n while(execSpeed != 0 && execSpeed != 5 && execSpeed != 500 && execSpeed != 1000){\\n System.out.printf(\\\"\\\\n Digite o tempo de espera entre as iteracoes(ms):\\\\n\\\\n\\\");\\n System.out.printf(\\\" 0 - Quero somente a matriz inicial e final\\\\n \\\"\\n + \\\"5 - Curto\\\\n 500 - Medio\\\\n 1000 - Longo\\\\n\\\\n-> \\\");\\n execSpeed = entrada.nextInt();\\n }\\n \\n final int tamanho = 9;\\n int contador = 0; //numero de iteracoes\\n \\n //Exemplos\\n //sudoku quase completo\\n int[][] sudokuQuaseResolvido = {\\n {8, 6, 2, 3, 1, 7, 4, 9, 5},\\n {7, 1, 5, 4, 8, 9, 2, 6, 0},\\n {4, 3, 9, 5, 6, 2, 7, 1, 8},\\n {5, 9, 7, 8, 3, 1, 6, 2, 4},\\n {3, 8, 0, 6, 2, 4, 5, 7, 9},\\n {6, 2, 4, 9, 7, 5, 3, 8, 1},\\n {2, 5, 3, 7, 9, 8, 1, 4, 6},\\n {9, 7, 6, 1, 4, 3, 8, 5, 2},\\n {0, 4, 8, 2, 5, 6, 9, 3, 0}};\\n //sudoku facil\\n int[][] sudokuFacil = {\\n {4, 3, 5, 0, 0, 9, 7, 8, 1},\\n {0, 0, 2, 5, 7, 1, 4, 0, 3},\\n {1, 9, 7, 8, 3, 4, 0, 6, 2},\\n {8, 2, 6, 1, 9, 5, 3, 4, 7},\\n {3, 7, 0, 0, 8, 2, 0, 1, 5},\\n {9, 5, 1, 7, 4, 3, 6, 2, 8},\\n {5, 1, 9, 3, 2, 6, 8, 7, 4},\\n {2, 4, 8, 9, 5, 7, 1, 3, 0},\\n {0, 6, 0, 4, 0, 8, 2, 5, 9}};\\n //sudoku medio\\n int[][] sudokuMedio = {\\n {8, 6, 0, 3, 0, 0, 0, 0, 0},\\n {0, 1, 5, 4, 0, 0, 0, 0, 0},\\n {0, 3, 9, 5, 0, 2, 0, 0, 0},\\n {0, 0, 0, 8, 0, 0, 6, 2, 0},\\n {0, 0, 0, 6, 0, 4, 5, 0, 0},\\n {6, 2, 0, 9, 7, 5, 0, 8, 1},\\n {0, 0, 3, 7, 9, 8, 0, 0, 6},\\n {9, 0, 6, 1, 4, 0, 0, 5, 0},\\n {0, 0, 8, 2, 0, 6, 0, 3, 7}};\\n //sudoku dificil\\n int[][] sudokuDificil = {\\n {1, 0, 0, 0, 0, 0, 0, 0, 5},\\n {0, 9, 8, 5, 0, 3, 7, 4, 0},\\n {0, 4, 5, 0, 0, 0, 6, 1, 0},\\n {0, 1, 0, 0, 9, 0, 0, 3, 0},\\n {0, 0, 0, 8, 0, 1, 0, 0, 0},\\n {0, 8, 0, 0, 3, 0, 0, 9, 0},\\n {0, 2, 7, 0, 0, 0, 3, 6, 0},\\n {0, 3, 1, 9, 0, 6, 4, 2, 0},\\n {9, 0, 0, 0, 0, 0, 0, 0, 8}};\\n //sudoku mais dificil\\n int[][] sudokuMuitoDificil = {\\n {0, 0, 0, 2, 0, 7, 0, 0, 0},\\n {4, 1, 0, 6, 0, 8, 0, 9, 7},\\n {6, 0, 0, 0, 0, 0, 0, 0, 2},\\n {0, 3, 0, 0, 6, 0, 0, 4, 0},\\n {9, 0, 0, 5, 0, 1, 0, 0, 3},\\n {0, 0, 0, 0, 0, 0, 0, 0, 0},\\n {1, 0, 0, 0, 0, 0, 0, 0, 8},\\n {5, 9, 0, 7, 8, 4, 0, 1, 6},\\n {7, 2, 0, 0, 0, 0, 0, 5, 9}};\\n \\n //cria uma matriz que na vdd e um sudoku.\\n Matriz matriz = new Matriz();\\n //copia algum exemplo inicial de sudoku para a matriz, de acordo com a escolha do usuario\\n switch (nivel){\\n case 1:\\n matriz.copiaMatriz(sudokuQuaseResolvido);\\n break;\\n case 2:\\n matriz.copiaMatriz(sudokuFacil);\\n break;\\n case 3:\\n matriz.copiaMatriz(sudokuMedio);\\n break;\\n case 4:\\n matriz.copiaMatriz(sudokuDificil);\\n break;\\n case 5:\\n matriz.copiaMatriz(sudokuMuitoDificil);\\n break;\\n }\\n //limpa tela e imprime inicial = start\\n clrscr();\\n System.out.println(\\\"Estado inicial...\\\");\\n matriz.printMatriz();\\n for(int i = 0; i < 2; i++){\\n if(i!=0)\\n System.out.print(\\\"Pressione enter para iniciar\\\");\\n entrada.nextLine();\\n }\\n clrscr();\\n System.out.println(\\\"Matriz inicial\\\");\\n matriz.printMatriz();\\n \\n //Tempo de execucao\\n long tempoInicio = System.currentTimeMillis();\\n \\n //a partir do algoritmo de busca em profundidade passado no slide 30 da aula 6\\n //define as pilhas open e close para os próximo e visitados respectivamente \\n if(funcao != 3){//se nao for busca em largura\\n Stack<Matriz> openS = new Stack<>();\\n Stack<Matriz> closedS = new Stack<>();\\n //open = [start]\\n openS.add(matriz);\\n \\n while (!openS.isEmpty()) {\\n int x = -1, y = -1;\\n //x = pop\\n Matriz matriz1 = openS.pop();\\n //verifica se existem espacos em branco, ou seja iguais 0 na matriz\\n if(matriz1.proximoBranco()!= null){\\n x = matriz1.proximoBranco()[0];\\n y = matriz1.proximoBranco()[1];\\n }\\n //x é objetivo retorne sucesso\\n if (matriz1.completa()) {\\n if(execSpeed != 0)\\n clrscr();\\n System.out.println(\\\"Matriz resolvida\\\");\\n matriz1.printMatriz();\\n contador++;\\n break;\\n } else {\\n if (x >= 0 && y >= 0) {\\n //gera os filhos\\n for (int i = 1; i <= tamanho; i++) {\\n Matriz copia = new Matriz();\\n //cria matriz de copia\\n copia.copiaMatriz(matriz1);\\n\\n if(funcao == 2)\\n /*busca desinformada gera de 1 a 9 todos os filhos */ \\n copia.set(x, y, i);\\n else{\\n //busca informada: qtadeDeNumeros gera a quantidades de numeros que existem \\n //para cada numero de 1 a 9 \\n copia.qtadeDeNumeros();\\n //ordena o vetor de menor para maior em quantidade de aparicoes\\n copia.menorEmQuantidade();\\n //seta a partir do numero com maior numero de aparicoes\\n copia.set(x, y, copia.getArray().get(i-1).getKey());\\n }\\n /*comandos p printar filhos\\n System.out.println(\\\"Matriz NAO resolvida\\\");\\n copia.printMatriz();\\n se nao tiver sido vizitada e se nao tiver conflitos, adiciona na open */\\n if ((!openS.contains(copia) || !closedS.contains(copia)) && copia.semConflitos()){\\n openS.add(copia);\\n }\\n }\\n //push(closed, X) \\n closedS.add(matriz1);\\n } else {\\n //push(closed, X) caso nao tenha espacos vazios e nao seja sudoku resolvido\\n closedS.add(matriz1);\\n }\\n }\\n try { Thread.sleep (execSpeed); } catch (InterruptedException ex) {}\\n if (execSpeed != 0){\\n //limpa tela\\n clrscr();\\n //imprime matriz que passou\\n System.out.println(\\\"Matriz Parcial\\\");\\n matriz1.printMatriz();\\n System.out.println(\\\"Iteracao: \\\"+contador+\\\" Tempo: \\\"\\n +((System.currentTimeMillis()-tempoInicio)/1000)+\\\" segundo(s)\\\");\\n }\\n contador++;\\n }\\n //funcao == 3 (Busca em Largura)\\n } else {\\n //filas\\n Queue<Matriz> openQ = new LinkedList<>();\\n Queue<Matriz> closedQ = new LinkedList<>();\\n //open = [start]\\n openQ.add(matriz);\\n \\n while (!openQ.isEmpty()) {\\n int x = -1, y = -1;\\n Matriz matriz1 = openQ.remove();\\n //verifica se existem espacos em branco, ou seja iguais 0 na matriz\\n if(matriz1.proximoBranco()!= null){\\n x = matriz1.proximoBranco()[0];\\n y = matriz1.proximoBranco()[1];\\n }\\n //x é objetivo retorne sucesso\\n if (matriz1.completa()) {\\n if(execSpeed != 0)\\n clrscr();\\n System.out.println(\\\"Matriz resolvida\\\");\\n matriz1.printMatriz();\\n contador++;\\n break;\\n }\\n else {\\n if (x >= 0 && y >= 0) {\\n //gera os filhos\\n for (int i = 1; i <= tamanho; i++) {\\n Matriz copia = new Matriz();\\n //cria matriz de copia\\n copia.copiaMatriz(matriz1);\\n\\n /*busca desinformada gera de 1 a 9 todos os filhos */ \\n copia.set(x, y, i);\\n /*comandos p printar filhos\\n System.out.println(\\\"Matriz NAO resolvida\\\");\\n copia.printMatriz();\\n se nao tiver sido vizitada e se nao tiver conflitos, adiciona na open */\\n if ((!openQ.contains(copia) || !closedQ.contains(copia)) && copia.semConflitos()){\\n openQ.add(copia);\\n }\\n }\\n //push(closed, X) \\n closedQ.add(matriz1);\\n } else {\\n //push(closed, X) caso nao tenha espacos vazios e nao seja sudoku resolvido\\n closedQ.add(matriz1);\\n }\\n }\\n try { Thread.sleep (execSpeed); } catch (InterruptedException ex) {}\\n if (execSpeed != 0){\\n //limpa tela\\n clrscr();\\n //imprime matriz que passou\\n System.out.println(\\\"Matriz Parcial\\\");\\n matriz1.printMatriz();\\n System.out.println(\\\"Iteracao: \\\"+contador+\\\" Tempo: \\\"\\n +((System.currentTimeMillis()-tempoInicio)/1000)+\\\" segundo(s)\\\");\\n }\\n contador++;\\n }\\n }\\n //fim da execucao. Sudoku resolvido\\n System.out.println(\\\"Sudoku Resolvido\\\");\\n if((System.currentTimeMillis()-tempoInicio) < 60000){\\n System.out.println(\\\"Iteracoes: \\\"+contador+\\\" Tempo Total: \\\"\\n +((System.currentTimeMillis()-tempoInicio)/1000)+\\\" segundo(s)\\\");\\n } else {\\n System.out.println(\\\"Iteracoes: \\\"+contador+\\\" Tempo Total: \\\"\\n +((System.currentTimeMillis()-tempoInicio)/1000/60)+\\\" minuto(s) e \\\"\\n +((System.currentTimeMillis()-tempoInicio)/1000%60)+\\\" segundo(s)\\\");\\n }\\n }\",\n \"int chooseMove();\",\n \"public void makeMove(Board board, Scanner input) {\\n boolean stillNeedsToMove = true;\\n while (stillNeedsToMove) {\\n System.out.println(\\\"Please select a coordinate for a box to make a choice in: \\\");\\n String coordinates = input.next().trim();\\n if (coordinates.length() != 2) {\\n System.out.println(\\\"Those were invalid coordinates!\\\");\\n continue;\\n }\\n int x = Integer.parseInt(coordinates.substring(0, 1));\\n int y = Integer.parseInt(coordinates.substring(1, 2));\\n // Check if that box has any moves left\\n Box box = board.getBoxAtCoordinate(x, y);\\n if (box == null) {\\n System.out.println(\\\"Invalid coordinates, please try again!\\\");\\n continue;\\n }\\n if (!box.hasOwner()) {\\n System.out.println(\\\"That box already has been completed!\\\");\\n continue;\\n }\\n System.out.println(\\\"Please select a line to take (LEFT, TOP, RIGHT, BOTTOM): \\\");\\n String side = input.next().toLowerCase();\\n if (box.isSideTaken(side)) {\\n System.out.println(\\\"That side is already taken, please try making the move again!\\\");\\n continue;\\n }\\n // Take the move and check if now owner\\n boolean nowOwner = box.setSide(side, BoxOwner.HUMAN);\\n if (nowOwner) {\\n System.out.println(\\\"You now own this box!\\\");\\n }\\n // Check and see if you need to update the siblings side\\n Box siblingToUpdate = board.getSiblingBoxBasedOnCoordinateAndMove(x, y, side);\\n if (siblingToUpdate != null) {\\n boolean owner;\\n // Set opposite side in sibling\\n if (side.equals(\\\"left\\\")) {\\n owner = siblingToUpdate.setSide(\\\"right\\\", BoxOwner.HUMAN);\\n } else if (side.equals(\\\"top\\\")) {\\n owner = siblingToUpdate.setSide(\\\"bottom\\\", BoxOwner.HUMAN);\\n } else if (side.equals(\\\"right\\\")) {\\n owner = siblingToUpdate.setSide(\\\"left\\\", BoxOwner.HUMAN);\\n } else {\\n owner = siblingToUpdate.setSide(\\\"top\\\", BoxOwner.HUMAN);\\n }\\n\\n if (owner) {\\n System.out.println(\\\"You now own the sibling box as well\\\");\\n }\\n }\\n // End the turn for the user\\n stillNeedsToMove = false;\\n }\\n // Print Board\\n board.printBoard();\\n }\",\n \"private void createMaze(Tile currentTile) {\\n\\n while (numberOfCellsVisited < CAST_WIDTH * CAST_HEIGHT) {\\n\\n // Get coordinates of current tile and set as visited\\n int currentX = currentTile.getPosition().getX();\\n int currentY = currentTile.getPosition().getY();\\n tempMap[currentY][currentX].setVisited(true);\\n\\n // Begin neighbourhood scan\\n ArrayList<Integer> neighbours = new ArrayList<>();\\n\\n // If a neighbour is not visited and its projected position is within bounds, add it to the list of valid neighbours\\n // North neighbour\\n if (currentY - 1 >= 0) {\\n if (!tempMap[currentY - 1][currentX].isVisited()) //Northern neighbour unvisited\\n neighbours.add(0);\\n }\\n //Southern neighbour\\n if (currentY + 1 < CAST_HEIGHT) { //y index if increased is not greater than height of the chamber\\n if (!tempMap[currentY + 1][currentX].isVisited()) //Northern neighbour unvisited\\n neighbours.add(1);\\n }\\n //Eastern neighbour\\n if (currentX + 1 < CAST_WIDTH) { //check edge case\\n if (!tempMap[currentY][currentX + 1].isVisited()) { //check if visited\\n neighbours.add(2);\\n }\\n }\\n //Western neighbour\\n if (currentX - 1 >= 0) {\\n if (!tempMap[currentY][currentX - 1].isVisited()) {\\n neighbours.add(3);\\n }\\n }\\n if (!neighbours.isEmpty()) {\\n\\n //generate random number between 0 and 3 for direction\\n Random rand = new Random();\\n boolean randomizer;\\n int myDirection;\\n do {\\n myDirection = rand.nextInt(4);\\n randomizer = neighbours.contains(myDirection);\\n } while (!randomizer);\\n\\n //knock down wall\\n switch (myDirection) {\\n case 0 -> { // North\\n tempMap[currentY][currentX].getPathDirection()[0] = true;\\n currentTile = tempMap[currentY - 1][currentX];\\n }\\n case 1 -> { // South\\n tempMap[currentY][currentX].getPathDirection()[1] = true;\\n currentTile = tempMap[currentY + 1][currentX];\\n }\\n case 2 -> { // East\\n tempMap[currentY][currentX].getPathDirection()[2] = true;\\n currentTile = tempMap[currentY][currentX + 1];\\n }\\n case 3 -> { // West\\n tempMap[currentY][currentX].getPathDirection()[3] = true;\\n currentTile = tempMap[currentY][currentX - 1];\\n }\\n }\\n\\n mapStack.push(currentTile);\\n numberOfCellsVisited++;\\n } else {\\n currentTile = mapStack.pop(); //backtrack\\n }\\n }\\n\\n castMaze(tempMap[0][0], -1);\\n }\",\n \"public void showLoadMaze(String message);\",\n \"public boolean initiateMovePrompt(MapPanel caller) {\\n\\t\\tif(activePath == null || !pf.isValidPath(activePath))\\n\\t\\t\\treturn false;\\n\\t\\tlog.log(\\\"Now prompting player for move.\\\");\\n\\t\\tMapViewListener l = caller.getMapViewListener();\\n\\t\\tl.setStatus(GameState.PLAYER_CONFIRMING_MOVE);\\n\\t\\tattackableFromHere = canAttackFromDestination();\\n\\t\\twithinRange = findSquaresWithinAtkRange();\\n\\t\\tl.setMoveMenu(caller, attackableFromHere.size() != 0);\\n\\t\\treturn true;\\n\\t}\",\n \"void setMaze(IMaze maze);\",\n \"public void MakeMaze() {\\n\\n\\t\\t// ints for random x , y and direction\\n\\t\\tint rx = 0;\\n\\t\\tint ry = 0;\\n\\t\\tint rd = 0;\\n\\t\\tgenMaze = true;\\n\\n\\t\\t// c used to count tries, if there are too many the main loop jumps to\\n\\t\\t// the end of the function\\n\\t\\tint c = 0;\\n\\n\\t\\t// fill the map with walls\\n\\t\\tfor (int ix = 0; ix < max_x; ix++) {\\n\\t\\t\\tfor (int iy = 0; iy < max_y; iy++) {\\n\\t\\t\\t\\tmap[ix][iy] = 1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t// fill the cell array with unvisited cells\\n\\t\\tfor (int ix = 0; ix < maxCells_x; ix++) {\\n\\t\\t\\tfor (int iy = 0; iy < maxCells_y; iy++) {\\n\\t\\t\\t\\tcell[ix][iy] = 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t// choose a \\\"random\\\" x,y pair. centre of screen used here instead\\n\\t\\trx = maxCells_x / 2;\\n\\t\\try = maxCells_y / 2;\\n\\n\\t\\t// mark cell visited\\n\\t\\tcell[rx][ry] = 1;\\n\\n\\t\\t// count cells\\n\\t\\tcountCells();\\n\\n\\t\\t// start main generator loop\\n\\t\\twhile (visitedCells < totalCells) {\\n\\n\\t\\t\\tc++;\\n\\n\\t\\t\\tif (c > magicNumber) {\\n\\t\\t\\t\\tgenMaze = false;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\n\\t\\t\\trd = rand.nextInt(4);\\n\\n\\t\\t\\t// dig tunnels\\n\\n\\t\\t\\t// up\\n\\n\\t\\t\\tif (genMaze) {\\n\\t\\t\\t\\tif (rd == 0) { // up\\n\\t\\t\\t\\t\\tif (inRange(rx * CELL_RAD, ry * CELL_RAD - 1) == 1\\n\\t\\t\\t\\t\\t\\t\\t&& (cell[rx][ry - 1]) == 0 || rand.nextInt(7) == 7) {\\n\\t\\t\\t\\t\\t\\tclink(rx * CELL_RAD, ry * CELL_RAD, rx * CELL_RAD,\\n\\t\\t\\t\\t\\t\\t\\t\\t(ry - 1) * CELL_RAD);\\n\\t\\t\\t\\t\\t\\try--;\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\twhile (true) {\\n\\t\\t\\t\\t\\t\\t\\trx = rand.nextInt(maxCells_x);\\n\\t\\t\\t\\t\\t\\t\\try = rand.nextInt(maxCells_y);\\n\\t\\t\\t\\t\\t\\t\\tif (cell[rx][ry] == 1) {\\n\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\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} else if (rd == 1) { // down\\n\\t\\t\\t\\t\\tif (inRange(rx + CELL_RAD, ry * CELL_RAD + 1) == 1\\n\\t\\t\\t\\t\\t\\t\\t&& (cell[rx][ry + 1] == 0 || rand.nextInt(7) == 7)) {\\n\\t\\t\\t\\t\\t\\tclink(rx * CELL_RAD, (ry) * CELL_RAD, rx * CELL_RAD,\\n\\t\\t\\t\\t\\t\\t\\t\\t(ry + 1) * CELL_RAD);\\n\\t\\t\\t\\t\\t\\try++;\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\twhile (true) {\\n\\t\\t\\t\\t\\t\\t\\trx = rand.nextInt(maxCells_x);\\n\\t\\t\\t\\t\\t\\t\\try = rand.nextInt(maxCells_y);\\n\\t\\t\\t\\t\\t\\t\\tif (cell[rx][ry] == 1) {\\n\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\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} else if (rd == 2) { // left\\n\\t\\t\\t\\t\\tif (inRange((rx * CELL_RAD) - 1, ry * CELL_RAD) == 1\\n\\t\\t\\t\\t\\t\\t\\t&& (cell[rx - 1][ry] == 0 || rand.nextInt(7) == 7)) {\\n\\t\\t\\t\\t\\t\\tclink(rx * CELL_RAD, ry * CELL_RAD,\\n\\t\\t\\t\\t\\t\\t\\t\\t(rx - 1) * CELL_RAD, ry * CELL_RAD);\\n\\t\\t\\t\\t\\t\\trx--;\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\twhile (true) {\\n\\t\\t\\t\\t\\t\\t\\trx = rand.nextInt(maxCells_x);\\n\\t\\t\\t\\t\\t\\t\\try = rand.nextInt(maxCells_y);\\n\\t\\t\\t\\t\\t\\t\\tif (cell[rx][ry] == 1) {\\n\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t} else if (rd == 3) { // right\\n\\t\\t\\t\\t\\tif (inRange(rx * CELL_RAD + 1, ry * CELL_RAD) == 1\\n\\t\\t\\t\\t\\t\\t\\t&& (cell[rx + 1][ry]) == 0 || rand.nextInt(7) == 7) {\\n\\t\\t\\t\\t\\t\\tclink((rx) * CELL_RAD, ry * CELL_RAD, (rx + 1)\\n\\t\\t\\t\\t\\t\\t\\t\\t* CELL_RAD, ry * CELL_RAD);\\n\\t\\t\\t\\t\\t\\trx++;\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\twhile (true) {\\n\\t\\t\\t\\t\\t\\t\\trx = rand.nextInt(maxCells_x);\\n\\t\\t\\t\\t\\t\\t\\try = rand.nextInt(maxCells_y);\\n\\t\\t\\t\\t\\t\\t\\tif (cell[rx][ry] == 1) {\\n\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\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\\t// mark the cell as visited\\n\\n\\t\\t\\t\\tcell[rx][ry] = 1;\\n\\n\\t\\t\\t\\t// place a \\\"floor\\\" tile on the map where the maze cell should be\\n\\t\\t\\t\\tmap[rx * CELL_RAD][ry * CELL_RAD] = 0;\\n\\n\\t\\t\\t\\t// count the cells to establish how many have been visited\\n\\t\\t\\t\\tcountCells();\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor (int ix = 0; ix < maxCells_x; ix++) {\\n\\t\\t\\tfor (int iy = 0; iy < maxCells_y; iy++) {\\n\\t\\t\\t\\tif (cell[ix][iy] == 1) {\\n\\t\\t\\t\\t\\tmap[ix * CELL_RAD][iy * CELL_RAD] = 0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.66266364","0.6535413","0.6500761","0.6401167","0.6261671","0.62545985","0.6247414","0.6175091","0.61703897","0.61006993","0.6063069","0.605897","0.5987057","0.5875109","0.5842735","0.57885826","0.57728505","0.57708466","0.57584435","0.5736579","0.5722848","0.5714663","0.57099","0.5628814","0.5590707","0.5581727","0.5567763","0.55292743","0.5523422","0.5519682","0.5511361","0.54963875","0.5490808","0.5488966","0.54856926","0.54760766","0.54507047","0.5436919","0.5424056","0.5414204","0.5402041","0.53802353","0.53647417","0.53613526","0.53598744","0.5336403","0.5328863","0.5319385","0.53072053","0.5291082","0.5290387","0.5288768","0.5270786","0.5264094","0.52618563","0.52579415","0.52488816","0.5247429","0.5242896","0.52420527","0.5239893","0.5239525","0.52340907","0.5230073","0.52300113","0.5225293","0.5211084","0.5208798","0.5203884","0.52008855","0.51948607","0.5191816","0.5189183","0.5186339","0.5179628","0.51777846","0.5163582","0.5162499","0.51619136","0.5161247","0.51583016","0.5142624","0.51387155","0.5136206","0.5134409","0.5126278","0.5118446","0.51184416","0.51146406","0.51004106","0.5090671","0.5089175","0.5087661","0.50810814","0.5071862","0.50701356","0.506123","0.50611603","0.505926","0.50565934"],"string":"[\n \"0.66266364\",\n \"0.6535413\",\n \"0.6500761\",\n \"0.6401167\",\n \"0.6261671\",\n \"0.62545985\",\n \"0.6247414\",\n \"0.6175091\",\n \"0.61703897\",\n \"0.61006993\",\n \"0.6063069\",\n \"0.605897\",\n \"0.5987057\",\n \"0.5875109\",\n \"0.5842735\",\n \"0.57885826\",\n \"0.57728505\",\n \"0.57708466\",\n \"0.57584435\",\n \"0.5736579\",\n \"0.5722848\",\n \"0.5714663\",\n \"0.57099\",\n \"0.5628814\",\n \"0.5590707\",\n \"0.5581727\",\n \"0.5567763\",\n \"0.55292743\",\n \"0.5523422\",\n \"0.5519682\",\n \"0.5511361\",\n \"0.54963875\",\n \"0.5490808\",\n \"0.5488966\",\n \"0.54856926\",\n \"0.54760766\",\n \"0.54507047\",\n \"0.5436919\",\n \"0.5424056\",\n \"0.5414204\",\n \"0.5402041\",\n \"0.53802353\",\n \"0.53647417\",\n \"0.53613526\",\n \"0.53598744\",\n \"0.5336403\",\n \"0.5328863\",\n \"0.5319385\",\n \"0.53072053\",\n \"0.5291082\",\n \"0.5290387\",\n \"0.5288768\",\n \"0.5270786\",\n \"0.5264094\",\n \"0.52618563\",\n \"0.52579415\",\n \"0.52488816\",\n \"0.5247429\",\n \"0.5242896\",\n \"0.52420527\",\n \"0.5239893\",\n \"0.5239525\",\n \"0.52340907\",\n \"0.5230073\",\n \"0.52300113\",\n \"0.5225293\",\n \"0.5211084\",\n \"0.5208798\",\n \"0.5203884\",\n \"0.52008855\",\n \"0.51948607\",\n \"0.5191816\",\n \"0.5189183\",\n \"0.5186339\",\n \"0.5179628\",\n \"0.51777846\",\n \"0.5163582\",\n \"0.5162499\",\n \"0.51619136\",\n \"0.5161247\",\n \"0.51583016\",\n \"0.5142624\",\n \"0.51387155\",\n \"0.5136206\",\n \"0.5134409\",\n \"0.5126278\",\n \"0.5118446\",\n \"0.51184416\",\n \"0.51146406\",\n \"0.51004106\",\n \"0.5090671\",\n \"0.5089175\",\n \"0.5087661\",\n \"0.50810814\",\n \"0.5071862\",\n \"0.50701356\",\n \"0.506123\",\n \"0.50611603\",\n \"0.505926\",\n \"0.50565934\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.7123779"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":38183,"cells":{"query":{"kind":"string","value":"METHOD 7: BreadthFirst Search This method solves the maze using breadthfirst search,"},"document":{"kind":"string","value":"public static void bfs(gNode[] G, boolean[] visited, int[] path, int s){\n\t\tQueue<Integer> Q = new LinkedList<Integer>();\n\n\t\tQ.add(s);\n\t\tvisited[s] = true;\n\t\twhile(!Q.isEmpty()){\n\t\t\ts = Q.poll();\n\t\t\tfor(gNode t=G[s]; t!= null; t=t.dest){\n\t\t\t\tSystem.out.println(\"BFS\");\n\t\t\t\tif(!visited[t.item]){\t\t//once an item has been visited, set it equal to true\n\t\t\t\t\tvisited[t.item] = true;\n\t\t\t\t\tpath[t.item] = s;\t\t//change the int value of the path\n\t\t\t\t\tQ.add(t.item);\n\t\t\t\t\tSystem.out.println(t.item);\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\t\n\t}"},"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 BFS() {\n visitedCells = 1;\n\n // Initialize the vertices\n for (int j = 0; j < maze.getGrid().length; j++) {\n for (int k = 0; k < maze.getGrid().length; k++) {\n Cell cell = maze.getGrid()[j][k];\n cell.setColor(\"WHITE\");\n cell.setDistance(0);\n cell.setParent(null);\n }\n }\n\n Cell sourceCell = maze.getGrid()[0][0];\n Cell neighbor = null;\n Cell currentCell;\n int distance = 0;\n\n // Initialize the source node\n sourceCell.setColor(\"GREY\");\n sourceCell.setDistance(0);\n sourceCell.setParent(null);\n\n queue.add(sourceCell);\n\n // Visits each cell until the queue is empty\n while (!queue.isEmpty()) {\n currentCell = queue.remove();\n\n for (int i = 0; i < currentCell.mazeNeighbors.size(); i++) {\n neighbor = currentCell.mazeNeighbors.get(i);\n\n // Stop the search if you reach the final cell\n if (neighbor.x == r - 1 && neighbor.y == r - 1) {\n distance++;\n if (distance == 10)\n distance = 0;\n neighbor.setDistance(distance);\n neighbor.setParent(currentCell);\n neighbor.visited = true;\n visitedCells++;\n break;\n }\n\n // Checks each neighbor and adds it to the queue if its color is white\n if (neighbor.getColor().equalsIgnoreCase(\"WHITE\")) {\n distance++;\n if (distance == 10)\n distance = 0;\n neighbor.setColor(\"GREY\");\n neighbor.setDistance(distance);\n neighbor.setParent(currentCell);\n neighbor.visited = true;\n queue.add(neighbor);\n visitedCells++;\n }\n }\n // Stop the search if you reach the final cell\n if (neighbor.x == r - 1 && neighbor.y == r - 1)\n break;\n\n currentCell.setColor(\"BLACK\");\n }\n }","public void breadthFirstTraverse() {\n\t\t// track whether vertex was visited\n\t\tHashMap<Integer, Boolean> visited = buildVisited();\n\t\t// store neighbors\n\t\tQueue<Integer> queue = new LinkedList<Integer>();\n\n\t\t// arbitrarily add first element\n\t\tInteger current = (Integer) edges.keySet().toArray()[0];\n\t\tqueue.add(current);\n\n\t\twhile (queue.peek() != null) {\n\n\t\t\tcurrent = queue.remove();\n\t\t\tSystem.out.println(\"current: \" + current);\n\t\t\tvisited.put(current, true);\n\n\t\t\tfor (Integer neighbor: edges.get(current)) {\n\t\t\t\tif (!visited.get(neighbor)) {\n\t\t\t\t\tqueue.add(neighbor);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}","public Stack<MazePoint> DepthFirstSearch(int row, int column)\n {\n //cMaze[row][column].wasVisited()\n if(cMaze[row][column].isExit())\n {\n sPath.push(cMaze[row][column]);\n //print out the path\n PrintPath(sPath, true);\n return sPath;\n }\n else\n {\n //when not visit\n if(!cMaze[row][column].wasVisited())\n {\n if(cMaze[row][column].hasItem())\n {\n String itemName = cMaze[row][column].pickUpItem();\n Item item = new Item(itemName);\n //check if the item is in the hashmap\n if(availableItemsHashMap.get(item) != null)\n {\n inventoryList.insert(itemName);\n }\n else\n {\n cMaze[row][column].dropItem();\n }\n }\n //mark as vist\n cMaze[row][column].markVisited();\n //push into stack\n sPath.push(cMaze[row][column]);\n }\n //determine where to traverse next (S, E, W, N)\n //recursively\n if(cMaze[row+1][column].canBeNavigated() || cMaze[row+1][column].isExit())// or (cMaze[row+1][column] != VISITED_MARKER && cMaze[row+1][column] != 'W')\n {\n return DepthFirstSearch(row+1, column);\n }\n else if(cMaze[row][column+1].canBeNavigated() || cMaze[row][column+1].isExit())\n {\n return DepthFirstSearch(row, column+1);\n }\n else if(cMaze[row][column-1].canBeNavigated() || cMaze[row][column-1].isExit())\n {\n return DepthFirstSearch(row, column-1);\n }\n else if(cMaze[row-1][column].canBeNavigated() || cMaze[row-1][column].isExit())\n {\n return DepthFirstSearch(row-1, column);\n }\n //no where could go, then return\n else\n {\n sPath.pop();\n if(sPath.isEmpty())\n {\n //print nothing found\n PrintPath(sPath, false);\n return sPath;\n }\n MazePoint mp = sPath.top();\n int mpRow = mp.getRow();\n int mpColumn = mp.getColumn();\n return DepthFirstSearch(mpRow, mpColumn);\n }\n }\n }","private Queue<Integer> breadthSearch(int i, int j, Queue<Integer> queue, Queue<Integer> path) {\n while(queue.size() != 0) {\n queue.poll();\n }//while\n return new LinkedList();\n }","@Override\n\t\t\tpublic void run() \n\t\t\t{\n\t\t\t\tif(!(mazeCollection.containsKey(paramArray[0])))\n\t\t\t\t{\n\t\t\t\t\tc.passError(\"Maze doesn't exist\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\t/*\n\t\t\t\t//if solution for this maze exists\n\t\t\t\tif(mazeSolutions.containsKey(mazeCollection.get(paramArray[0])))\n\t\t\t\t{\n\t\t\t\t\tc.passSolve(\"Solution for \"+paramArray[0]+ \" is ready\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t*/\n\t\t\t\t\n\t\t\t\tif(paramArray[1].toString().equals(\"bfs\"))\n\t\t\t\t{\n\t\t\t\t\tMazeAdapter ms=new MazeAdapter(mazeCollection.get(paramArray[0]));\n\t\t\t\t\t\n\t\t\t\t\tSearcher<Position> bfs=new BFS<Position>();\n\t\t\t\t\tSolution<Position> sol=bfs.search(ms);\n\t\t\t\t\t\n\t\t\t\t\t//check if solution for the maze already exists, if so, replace it with the new one\n\t\t\t\t\tif(mazeSolutions.containsKey(mazeCollection.get(paramArray[0]))) {\n\t\t\t\t\t\tmazeSolutions.remove(mazeCollection.get(paramArray[0]));\n\t\t\t\t\t\tmazeSolutions.put(mazeCollection.get(paramArray[0]), sol);\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tmazeSolutions.put(mazeCollection.get(paramArray[0]), sol);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tc.passSolve(\"Solution for \"+paramArray[0]+ \" is ready\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\telse if(paramArray[1].toString().equals(\"dfs\"))\n\t\t\t\t{\n\t\t\t\t\tMazeAdapter ms=new MazeAdapter(mazeCollection.get(paramArray[0]));\n\t\t\t\t\t\n\t\t\t\t\tSearcher<Position> dfs=new DFS<Position>();\n\t\t\t\t\tSolution<Position> sol=dfs.search(ms);\n\t\t\t\t\t\n\t\t\t\t\t//check if solution for the maze already exists, if so, replace it with the new one\n\t\t\t\t\tif(mazeSolutions.containsKey(mazeCollection.get(paramArray[0]))) {\n\t\t\t\t\t\tmazeSolutions.remove(mazeCollection.get(paramArray[0]));\n\t\t\t\t\t\tmazeSolutions.put(mazeCollection.get(paramArray[0]), sol);\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tmazeSolutions.put(mazeCollection.get(paramArray[0]), sol);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tc.passSolve(\"Solution for \"+paramArray[0]+ \" is ready\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tc.passError(\"Invalid algorithm\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}","public void breadthFirstSearch(){\n Deque<Node> q = new ArrayDeque<>(); // In an interview just write Queue ? Issue is java 8 only has priority queue, \n // meaning I have to pass it a COMPARABLE for the Node class\n if (this.root == null){\n return;\n }\n \n q.add(this.root);\n while(q.isEmpty() == false){\n Node n = (Node) q.remove();\n System.out.print(n.val + \", \");\n if (n.left != null){\n q.add(n.left);\n }\n if (n.right != null){\n q.add(n.right);\n }\n }\n }","@Override\n\t//loc1 is the start location,loc2 is the destination\n\tpublic ArrayList<MapCoordinate> bfsSearch(MapCoordinate loc1, MapCoordinate loc2, Map m) {\n\t\tSystem.out.println(\"come into bfsSearch\");\n\t\tif(m.isAgentHasAxe() && m.isAgentHasKey()){\n\t\t\tLinkedList<State> queue=new LinkedList<State>();\n\t\t\tArrayList<MapCoordinate> Visited=new ArrayList<MapCoordinate>();\n\t\t\t\n\t\t\t//Visited.add(loc1);\n\t\t\tState s1=new State(loc1,m.getAgentHasNStones(),null);\n\t\t\tqueue.add(s1);\n\t\t\t\n\t\t\twhile(!queue.isEmpty()){\n\t\t\t\tState s=queue.remove();\n\t\t\t\tMapCoordinate currentLocation=s.getLocation();\n\t\t\t\tVisited.add(s.getLocation()); //add to visited every loop\n\t\t\t\tif(loc2.equals(currentLocation)){\n\t\t\t\t\t//means could reach loc2 from loc1\n\t\t\t\t\tArrayList<MapCoordinate> route=new ArrayList<MapCoordinate>();\n\t\t\t\t\twhile(s.getPrevState()!=null){\n\t\t\t\t\t\troute.add(0,s.getLocation()); //add to head\n\t\t\t\t\t\ts=s.getPrevState();\n\t\t\t\t\t}\n\t\t\t\t\treturn route;\n\t\t\t\t}\n\t\t\t\tMapCoordinate temp=new MapCoordinate(currentLocation.getX()+1,currentLocation.getY());\n\t\t\t\tif(m.hasCoordinate(temp)){//state move east\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){ //this is important else if(cTemp!='~'), not barely else,\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\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\ttemp=new MapCoordinate(currentLocation.getX()-1,currentLocation.getY());\n\t\t\t\tif(m.hasCoordinate(temp)){//state move south\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\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\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()+1);\n\t\t\t\tif(m.hasCoordinate(temp)){//state move north\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\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\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()-1);\n\t\t\t\tif(m.hasCoordinate(temp)){//state move south\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' ){\n\t\t\t\t\t\t\tif(cTemp=='~' &&s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\t\n\t\t\t}\n\t\t\treturn null;\n\t\t}else if(m.isAgentHasAxe()){ //only have axe\n\t\t\tLinkedList<State> queue=new LinkedList<State>();\n\t\t\tArrayList<MapCoordinate> Visited=new ArrayList<MapCoordinate>();\n\t\t\t\n\t\t\t//Visited.add(loc1);\n\t\t\tState s1=new State(loc1,m.getAgentHasNStones(),null);\n\t\t\tqueue.add(s1);\n\t\t\t\n\t\t\twhile(!queue.isEmpty()){\n\t\t\t\tState s=queue.remove();\n\t\t\t\tMapCoordinate currentLocation=s.getLocation();\n\t\t\t\tVisited.add(s.getLocation()); //add visited every loop\n\t\t\t\tif(loc2.equals(currentLocation)){\n\t\t\t\t\t//means could reach loc2 from loc1\n\t\t\t\t\tArrayList<MapCoordinate> route=new ArrayList<MapCoordinate>();\n\t\t\t\t\twhile(s.getPrevState()!=null){\n\t\t\t\t\t\troute.add(0,s.getLocation()); //add to head\n\t\t\t\t\t\ts=s.getPrevState();\n\t\t\t\t\t}\n\t\t\t\t\treturn route;\n\t\t\t\t}\n\t\t\t\tMapCoordinate temp=new MapCoordinate(currentLocation.getX()+1,currentLocation.getY());\n\t\t\t\tif(m.hasCoordinate(temp)){//state move south\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='-' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='-' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\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\ttemp=new MapCoordinate(currentLocation.getX()-1,currentLocation.getY());\n\t\t\t\tif(m.hasCoordinate(temp)){//state move south\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='-' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='-' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\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\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()+1);\n\t\t\t\tif(m.hasCoordinate(temp)){//state move north\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='-' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='-' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\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\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()-1);\n\t\t\t\tif(m.hasCoordinate(temp)){//state move south\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='-' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='-' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\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\treturn null;\n\t\t}else if(m.isAgentHasKey()){ //only have key\n\t\t\tLinkedList<State> queue=new LinkedList<State>();\n\t\t\tArrayList<MapCoordinate> Visited=new ArrayList<MapCoordinate>();\n\t\t\t\n\t\t\t//Visited.add(loc1);\n\t\t\tState s1=new State(loc1,m.getAgentHasNStones(),null);\n\t\t\tqueue.add(s1);\n\t\t\t\n\t\t\twhile(!queue.isEmpty()){\n\t\t\t\tState s=queue.remove();\n\t\t\t\tMapCoordinate currentLocation=s.getLocation();\n\t\t\t\tVisited.add(s.getLocation());\n\t\t\t\tif(loc2.equals(currentLocation)){\n\t\t\t\t\t//means could reach loc2 from loc1\n\t\t\t\t\tArrayList<MapCoordinate> route=new ArrayList<MapCoordinate>();\n\t\t\t\t\twhile(s.getPrevState()!=null){\n\t\t\t\t\t\troute.add(0, s.getLocation()); //add to head,in this fashion, return the right order of route\n\t\t\t\t\t\ts=s.getPrevState();\n\t\t\t\t\t}\n\t\t\t\t\treturn route;\n\t\t\t\t}\n\t\t\t\tMapCoordinate temp=new MapCoordinate(currentLocation.getX()+1,currentLocation.getY()); \n\t\t\t\tif(m.hasCoordinate(temp)){//state move east\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='T' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\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\ttemp=new MapCoordinate(currentLocation.getX()-1,currentLocation.getY()); //state that move west\n\t\t\t\tif(m.hasCoordinate(temp)){\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='T' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\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\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()+1); //state move north\n\t\t\t\tif(m.hasCoordinate(temp)){\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='T' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\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\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()-1); //state move south\n\t\t\t\tif(m.hasCoordinate(temp)){\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='T' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\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\treturn null;\n\t\t}\n\t\t\n\t\t\n\t\t/*\n\t\t * \n\t\t **/\t\t\n\t\telse{ //have no key and axe\n\t\t\tSystem.out.println(\"come into the last elas clause\");\n\t\t\tLinkedList<State> queue=new LinkedList<State>();\n\t\t\tArrayList<MapCoordinate> Visited=new ArrayList<MapCoordinate>();\n\t\t\t\n\t\t\tVisited.add(loc1);\n\t\t\tState s1=new State(loc1,m.getAgentHasNStones(),null);\n\t\t\tqueue.add(s1);\n\t\t\t\n\t\t\t//int i=0;\n\t\t\twhile(!queue.isEmpty()){\n\t\t\t\t//i++;\n\t\t\t\t//System.out.println(\"come into while: \"+i);\n\t\t\t\tState s=queue.remove();\n\t\t\t\tMapCoordinate currentLocation=s.getLocation();\n\t\t\t\tVisited.add(s.getLocation()); //add visited, let program won't stuck in \n\t\t\t\tif(loc2.equals(currentLocation)){\n\t\t\t\t\t//means could reach loc2 from loc1\n\t\t\t\t\tSystem.out.println(\"return computed route\");\n\t\t\t\t\tArrayList<MapCoordinate> route=new ArrayList<MapCoordinate>();\n\t\t\t\t\twhile(s.getPrevState()!=null){\n\t\t\t\t\t\troute.add(0, s.getLocation()); //add to head\n\t\t\t\t\t\ts=s.getPrevState();\n\t\t\t\t\t}\n\t\t\t\t\tfor(MapCoordinate mc:route){\n\t\t\t\t\t\t//System.out.println(\"print returned route in bfssearch\");\n\t\t\t\t\t\tSystem.out.print(\"mc:\"+mc.getX()+\" \"+mc.getY()+\"->\");\n\t\t\t\t\t\t\n\t\t\t\t\t}\n\t\t\t\t\treturn route;\n\t\t\t\t}\n\t\t\t\tMapCoordinate temp=new MapCoordinate(currentLocation.getX()+1,currentLocation.getY());\n\t\t\t\tif(m.hasCoordinate(temp)){\n\t\t\t\t\t//System.out.println(\"1 if\");\n\t\t\t\t\tif(s.getPrevState()!=null &&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if\");\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 if\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 if\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 else\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for the initial state \n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\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\ttemp=new MapCoordinate(currentLocation.getX()-1,currentLocation.getY());\n\t\t\t\tif(m.hasCoordinate(temp)){\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.add(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for the initial state \n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\tSystem.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\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\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()+1);\n\t\t\t\tif(m.hasCoordinate(temp)){\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*'&&cTemp!='T'&&cTemp!='-' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for the initial state \n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\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\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()-1);\n\t\t\t\tif(m.hasCoordinate(temp)){\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T' &&cTemp!='-' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}//do not do any action for not enough stones situation\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for the initial state \n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}//do not do any action for not enough stones situation\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\treturn null;\n\t\t}\n\t}","public boolean solve(final int startRow, final int startCol) {\r\n\r\n // TODO\r\n // validate arguments: ensure position is within maze area\r\n\r\n if(mazeData [startRow][startCol] == WALL) {\r\n throw new IllegalArgumentException(\" we're in a wall buddy\");\r\n }\r\n else if (startRow > mazeData.length-1 || startCol > mazeData.length-1 ){\r\n throw new IllegalArgumentException(\" we're out of bounds \");\r\n }\r\n\r\n\r\n\r\n\r\n\r\n // TODO create local class for row/col positions\r\n class Position {\r\n private int row;\r\n private int col;\r\n\r\n // TODO add instance variables\r\n public Position(final int row, final int col) {\r\n this.row = row;\r\n this.col= col;\r\n }\r\n\r\n\r\n\r\n // TODO toString if desired\r\n public String toString() {\r\n return \"Row: \" + this.row + \"Column: \"+ this.col;\r\n }\r\n\r\n\r\n }\r\n\r\n\r\n // define the stack (work queue)\r\n final var queue = Collections.asLifoQueue(new LinkedList<Position>());\r\n //Queue<Position> queue = new LinkedList<Position>(); // EXTRA CREDIT PART 2\r\n\r\n // put starting position in queue\r\n queue.add(new Position(startRow, startCol));\r\n\r\n\r\n\r\n\r\n\r\n // look for a way out of the maze from the current position\r\n while (!queue.isEmpty()) {\r\n\r\n\r\n final Position pos = queue.remove();\r\n\r\n // if this is a wall, then ignore this position (and skip the remaining steps of the loop body)\r\n if (mazeData [pos.row][pos.col]== WALL){\r\n continue; // jumps to next spot in que , by skipping to next iteration of loops by saying continue\r\n }\r\n\r\n\r\n // otherwise mark this place as visited (drop a breadcrumb)\r\n if (mazeData [pos.row][pos.col]== VISITED){\r\n continue; // jumps to next spot in que , by skipping to next iteration of loops by saying continue\r\n }\r\n else if(mazeData [pos.row][pos.col]== EMPTY){\r\n mazeData [pos.row][pos.col]= VISITED;\r\n }\r\n\r\n // if we're already on the perimeter, then this is a way out and we should return success (true) right away\r\n if (pos.row == 0|| pos.col ==0 || pos.row == mazeData.length-1 || pos.col == mazeData[0].length-1){\r\n mazeData[startRow][startCol] = START;\r\n return true;\r\n }\r\n\r\n queue.add(new Position(pos.row+1,pos.col ));//down\r\n queue.add(new Position(pos.row-1,pos.col ));//up\r\n queue.add(new Position(pos.row,pos.col-1 )); //left\r\n queue.add(new Position(pos.row, pos.col + 1)); //right\r\n\r\n\r\n }//end of while\r\n\r\n\r\n\r\n // mark starting position\r\n mazeData[startRow][startCol] = START;\r\n\r\n // if we've looked everywhere but haven't gotten out, then return failure (false)\r\n return false;\r\n }","public static void breadthFirstSearch(ArrayList<Node> graph) {\n\t\tSystem.out.println(\"BFS:\");\n\t\tif(graph.size() == 0) {\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tGraphUtils.cleanGraph(graph);\n\n\t\tQueue<Node> queue = new LinkedList<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\tqueue.add(node);\n\t\t\t\n\t\t\twhile(!queue.isEmpty()) {\n\t\t\t\tnode = queue.remove();\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 queue 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\tqueue.add(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\n\t\tSystem.out.println();\n\t\tGraphUtils.cleanGraph(graph);\n\t}","public static Node searchBFS(int mat[][], int i, int j, int x, int y) {\n\t\tfor (int n = 1; n < 30; n++) {\n\t\t\tfor (int p = 1; p < 30; p++) {\n\t\t\t\tvisited[n][p] = false;\n\t\t\t}\n\t\t}\n\n\t\t// create an empty queue\n\t\tQueue<Node> q = queue;\n\t\tq.clear();\n\t\t// mark source cell as visited and enqueue the source node\n\t\tvisited[j][i] = true;\n\t\tNode root = NodeFactory.createNode(i, j, 0, null, null);\n\t\tq.add(root);\n\n\t\t// stores length of longest path from source to destination\n\t\tint min_dist = Integer.MAX_VALUE;\n\t\tNode node = null;\n\n\t\t// run till queue is not empty\n\t\twhile (!q.isEmpty()) {\n\t\t\t// pop front node from queue and process it\n\n\t\t\tnode = q.poll();\n\t\t\ti = node.x;\n\t\t\tj = node.y;\n\t\t\tint dist = node.dist;\n\n\t\t\tif (i == x && j == y) {\n\t\t\t\tmin_dist = dist;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tfor (Direction dir : DIRECTIONS) {\n\t\t\t\tint nx = i + dir.x;\n\t\t\t\tint ny = j + dir.y;\n\n\t\t\t\tif (isValid(mat, visited, nx, ny)) {\n\t\t\t\t\t// mark next cell as visited and enqueue it\n\n\t\t\t\t\tvisited[ny][nx] = true;\n\t\t\t\t\tint ndist = dist + 1;\n\n\t\t\t\t\tNode newNode = NodeFactory.createNode(nx, ny, ndist, dir,\n\t\t\t\t\t\t\tnode);\n\n\t\t\t\t\t// Node newNode =new Node(node, nx, ny, ndist, dir);\n\n\t\t\t\t\tq.add(newNode);\n\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\n\t\tif (min_dist == Integer.MAX_VALUE){\n\t\t\treturn null;\n\t\t}\n\t\treturn node;\n\t}","private void breadthFirst(PathBetweenNodes graph, LinkedList<String> visited) {\r\n\r\n LinkedList<String> nodes = graph.adjacentNodes(visited.getLast());\r\n for (String node : nodes)\r\n {\r\n if (visited.contains(node))\r\n {\r\n continue;\r\n }\r\n if (node.equals(END))\r\n {\r\n \tif (mode1 && mode){\r\n visited.add(node);\r\n printPath(visited); \r\n graph.flag=false;\r\n mode=false;\r\n visited.removeLast();\r\n \t} else if(mode2){\r\n visited.add(node);\r\n printPath(visited); \r\n flag=mode2; \r\n visited.removeLast();\r\n \t} \r\n } \r\n }\r\n\r\n for (String node : nodes) { // implementing a for loop to call each node in the array nodes\r\n if (visited.contains(node) || node.equals(END)) { // if statement to see if node is already visited or it is the end node\r\n continue;\r\n }\r\n flag=true;\r\n visited.addLast(node); //adding the last node to visited array\r\n breadthFirst(graph, visited); // implementing the breath first search\r\n visited.removeLast(); // removing the last node from array visited\r\n }\r\n if (flag == false) {\r\n System.out.println(\"No path Exists between \" + START + \" and \" + END);\r\n flag = true;\r\n }\r\n }","private static int breadthFirstSearch(Vertex start) throws Queue.UnderflowException, Queue.EmptyException {\n boolean visited[] = new boolean[48];\n //Keep a queue of vertecies and a queue of the depth of the verticies - they will be added to and poped from identically\n ListQueue<Vertex> queue = new ListQueue<Vertex>();\n ListQueue<Integer> numQueue = new ListQueue<Integer>();\n //Set the starting node as visited\n visited[start.index()] = true;\n queue.enqueue(start);\n numQueue.enqueue(new Integer(1));\n\n //Keep last\n int last = -1;\n //While the queue isnt empty\n while (!queue.isEmpty()) {\n //Pop off the top from both queues and mark as visited\n start = queue.dequeue();\n int current = numQueue.dequeue();\n visited[start.index] = true;\n //For all neigbors\n for (Vertex v : start.neighbors) {\n //If we havent visited it make sure to visit it\n if (visited[v.index()] == false) {\n //As we keep adding new nodes to visit keep track of the depth\n queue.enqueue(v);\n numQueue.enqueue(current + 1);\n }\n }\n //Keep track of the most recent depth before we pop it off (queue will be empty when we exit)\n last = current;\n }\n //Return the max of the depth\n return last;\n }","public void breadthFirst() {\n\t\tQueue<Node> queue = new ArrayDeque<>();\n\t\tqueue.add(root);\n\t\twhile(!queue.isEmpty()) {\n\t\t\tif(queue.peek().left!=null)\n\t\t\t\tqueue.add(queue.peek().left);\n\t\t\tif(queue.peek().right!=null)\n\t\t\t\tqueue.add(queue.peek().right);\n\t\t\tSystem.out.println(queue.poll().data);\n\t\t}\n\t}","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 void bfs(int x, int y, Node p) {\n if (p == null) {\n // TODO\n return;\n }\n char c = board[x][y];\n\n if (p.next(c) == null) {\n // TODO not found\n return;\n }\n\n Node node = p.next(c);\n\n // if node is leaf, found a word\n if (node.word != null) {\n if (!results.contains(node.word)) {\n results.add(node.word);\n }\n }\n\n mark[x][y] = true;\n for (int[] dir: dirs) {\n int newX = x + dir[0];\n int newY = y + dir[1];\n if (newX < 0 || n <= newX\n || newY < 0 || m <= newY) {\n continue;\n }\n\n if (mark[newX][newY]) {\n continue;\n }\n\n bfs(newX, newY, node);\n }\n mark[x][y] = false;\n }","public static String findPath(Maze maze) {\n \tint m = maze.getNumRows();\n \tint n = maze.getNumCols();\n\n \t//define a visited matrix\n \tboolean[][] visited = new boolean[m][n];\n \tsetvisited(false, visited);\n\n \t//define a direction matrix\n \tint[][] dir_mtr = new int[m][n];\n \tinit_dir(-1,dir_mtr);\n\n\n\n \t//define a stack\n \tStack<MazeLocation> s;\n \ts = new StackRefBased<MazeLocation>();\n\n \tMazeLocation entry = maze.getEntry();\n \tMazeLocation exit = maze.getExit();\n \t// System.out.println(entry.toString());\n \ts.push(entry);\n\n\t\tMazeLocation temp; \n\t\tString result = \"\"; \t\n\n\t\ttry{\n\t\t\tint x,y;\n\n\n\t\t\twhile(!s.isEmpty()){\n\n \t\ttemp = s.peek();\n \t\tx = temp.getRow();\n \t\ty = temp.getCol();\n \t\tdir_mtr[x][y]+=1;\n\n \t\tif(temp.toString().equals(exit.toString())){\n \t\t\tSystem.out.println(\"find the path\");\n \t\t\tbreak;\n\n \t\t}\n\n \t\tif(dir_mtr[x][y]==0){ \n \t\t\t//checking the up direction\n \t\t\tif(x-1>=0 && !maze.isWall(x-1,y) && !visited[x-1][y]){\n \t\t\t\tMazeLocation testnode = new MazeLocation(x-1,y,maze.isWall(x-1,y));\n \t\t\t\tvisited[x-1][y] = true;\n \t\t\t\ts.push(testnode);\n\n \t\t\t}\n\n \t\t}else if(dir_mtr[x][y]==1){\n \t\t\t//checking the left direction\n \t\t\tif(y-1>=0 && !maze.isWall(x,y-1) && !visited[x][y-1]){\n \t\t\t\tMazeLocation testnode = new MazeLocation(x,y-1,maze.isWall(x,y-1));\n \t\t\t\tvisited[x][y-1] = true;\n \t\t\t\ts.push(testnode);\n\n \t\t\t}\n\n \t\t}else if(dir_mtr[x][y]==2){\n \t\t\t//checking the down direction\n \t\t\tif(x+1<m && !maze.isWall(x+1,y) && !visited[x+1][y]){\n \t\t\t\tMazeLocation testnode = new MazeLocation(x+1,y,maze.isWall(x+1,y));\n \t\t\t\tvisited[x+1][y] = true;\n \t\t\t\ts.push(testnode);\n\n \t\t\t}\n \t\t\t\n \t\t}else if(dir_mtr[x][y]==3){\n \t\t\t//checking the right direction\n \t\t\tif(y+1<n && !maze.isWall(x,y+1) && !visited[x][y+1]){\n \t\t\t\tMazeLocation testnode = new MazeLocation(x,y+1,maze.isWall(x,y+1));\n \t\t\t\tvisited[x][y+1] = true;\n \t\t\t\ts.push(testnode);\n\n \t\t\t}\n \t\t\t\n \t\t}else{\n \t\t\tvisited[x][y] = false;\n \t\t\ts.pop();\n \t\t}\n\n\n\n \t\t\n \t}\n\n \t//reverse the stack\n \tStack<MazeLocation> reverse;\n \treverse = new StackRefBased<MazeLocation>();\n \twhile(!s.isEmpty()){\n\t\t\t reverse.push(s.pop()); \t//push the node to the reverse stack\n\t\t\t }\n\n\n \t//if the stack is not empty, then we find the path\n\t\tif(!reverse.isEmpty()){\n\t\t\tresult = reverse.toString();\n\n\t\t}\n\n \t\n \n\n\t\t}\n\t\tcatch (StackEmptyException see) {\n \n }\n\n\n \treturn result;\n\n\n }","public static void bfs(int a, int b) {\n\t\t\r\n\t\tQueue<Node> q = new LinkedList<>();\r\n\t\t\r\n\t\tq.add(new Node(a,b));\r\n\t\t\r\n\t\twhile(!q.isEmpty()) {\r\n\t\t\t\r\n\t\t\tNode n = q.remove();\r\n\t\t\t\r\n\t\t\tint x = n.x;\r\n\t\t\tint y = n.y;\r\n\t\t\t\r\n\t\t\tif(x+1 <= N && map[x+1][y] > map[x][y]) {\r\n\t\t\t\tif(visited[x+1][y] != 1) {\r\n\t\t\t\t\tq.add(new Node(x+1,y));\r\n\t\t\t\t\tvisited[x+1][y] = cnt;\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\tif(x-1 > 0 && map[x-1][y] > map[x][y]) {\r\n\t\t\t\tif(visited[x-1][y] != 1) {\r\n\t\t\t\t\tq.add(new Node(x-1,y));\r\n\t\t\t\t\tvisited[x-1][y] = cnt;\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\tif(y-1 > 0 && map[x][y-1] > map[x][y]) {\r\n\t\t\t\tif(visited[x][y-1] != 1) {\r\n\t\t\t\t\tq.add(new Node(x,y-1));\r\n\t\t\t\t\tvisited[x][y-1] = cnt;\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\tif(y+1 <=N && map[x][y+1] > map[x][y]) {\r\n\t\t\t\tif(visited[x][y+1] != 1) {\r\n\t\t\t\t\tq.add(new Node(x,y+1));\r\n\t\t\t\t\tvisited[x][y+1] = cnt;\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\t\r\n\t\t\t\r\n\t\t\t\r\n\t\t}\r\n\t\t\r\n\t\t\r\n\t\t\r\n\t\t\r\n\t\t\r\n\t}","public String breadthFirstSearch( AnyType start_vertex ) throws VertexException {\n \n StringBuffer buffer = new StringBuffer();\n \n // ----------------------------\n // TODO: Add your code here\n // ----------------------------\n boolean exists = false;\n Vertex<AnyType> S = new Vertex<AnyType>(start_vertex);\n int counter = 1;\n //make new vertex to check if its in list\n //make queue to hold vertices\n SemiConstantTimeQueue<Vertex<AnyType>> queue = new SemiConstantTimeQueue<Vertex<AnyType>>();\n //loop through and set not visited\n for( int i = 0; i < vertex_adjacency_list.size(); i++){\n vertex_adjacency_list.get(i).setVisited(-1);\n //if it's in list then set exists to true\n //and set visited \n if(vertex_adjacency_list.get(i).compareTo(S) == 0){\n exists = true;\n vertex_adjacency_list.get(i).setVisited(counter);\n counter = i;\n }\n } \n //if doesn't exist then throw the exception\n if(exists == false){\n throw new VertexException(\"Start Vertex does not exist\");\n }\n //make new queue\n queue.add(vertex_adjacency_list.get(counter));\n vertex_adjacency_list.get(counter).setVisited(1);\n counter = 1;\n int k=0;\n Vertex<AnyType>e;\n //while the queue isn't empty\n while(queue.peek() !=null){\n //make e the top of the queue \n e = queue.peek(); \n //go through the list and if you reach the begining it exits loop\n for( k = 0; k < vertex_adjacency_list.size()-1; k++){\n if(vertex_adjacency_list.get(k).compareTo(e)==0){\n break;\n }\n } \n //go through loop and check if visited, if not then add it to queue, set visited\n for( int j = 0; j< vertex_adjacency_list.get(k).numberOfAdjacentVertices(); j++){\n if(vertex_adjacency_list.get(k).getAdjacentVertex(j).hasBeenVisited()==false){\n counter++;\n queue.add(vertex_adjacency_list.get(k).getAdjacentVertex(j));\n vertex_adjacency_list.get(k).getAdjacentVertex(j).setVisited(counter);\n }\n }\n //remove from queue when through loop once\n k++;\n queue.remove();\n }\n //loop through list and print vertex and when it was visited\n for(int o = 0; o< vertex_adjacency_list.size(); o++){\n buffer.append(vertex_adjacency_list.get(o) + \":\" + vertex_adjacency_list.get(o).getVisited()+ \"\\n\");\n }\n return buffer.toString();\n }","private void breadthFirstSearch (int start, int[] visited, int[] parent){\r\n Queue< Integer > theQueue = new LinkedList< Integer >();\r\n boolean[] identified = new boolean[getNumV()];\r\n identified[start] = true;\r\n theQueue.offer(start);\r\n while (!theQueue.isEmpty()) {\r\n int current = theQueue.remove();\r\n visited[current] = 1; //ziyaret edilmis vertexler queuedan cikarilan vertexlerdir\r\n Iterator < Edge > itr = edgeIterator(current);\r\n while (itr.hasNext()) {\r\n Edge edge = itr.next();\r\n int neighbor = edge.getDest();\r\n if (!identified[neighbor]) {\r\n identified[neighbor] = true;\r\n theQueue.offer(neighbor);\r\n parent[neighbor] = current;\r\n }\r\n }\r\n }\r\n }","public static void main(String[] args) throws FileNotFoundException, IOException {\r\n\r\n //Creating an instance object of the class PathBetweenNodes\r\n PathBetweenNodes x = new PathBetweenNodes();\r\n x.graph = new PathBetweenNodes();\r\n x.readMaze(); // reading the maze from the file\r\n LinkedList<String> visited = new LinkedList<String>(); // creating an array called visited to store visited nodes\r\n System.out.println(\"Enter the source node:\");//asking user to enter the start node\r\n Scanner sc = new Scanner(System.in); // Scanner to input the start node into the system\r\n START = sc.next();\r\n System.out.println(\"Enter the destination node:\");// asking user to input the destination node\r\n END = sc.next(); //scan the destination node into the system\r\n mode(option);\r\n startTimer = System.nanoTime();\r\n visited.add(START);// adding the start node to array visited\r\n new PathBetweenNodes().breadthFirst(x.graph, visited); // implementing the breath first search for graph x and array visited\r\n sc.close(); // scanner must be closed\r\n if (x.graph.flag) {\r\n System.out.println(\"There is existing path between \" + START + \" and \" + END + \" as above.\");\r\n }\r\n if (!x.graph.flag) {\r\n System.out.println(\"No path was found between \" + START + \" and \" + END + \".\");\r\n }\r\n endTimer = System.nanoTime();\r\n long TimeElapsed = endTimer - startTimer;\r\n System.out.println(\"Time taken to solve the maze = \" + TimeElapsed + \" Nano seconds.\");\r\n }","private void createMaze(Tile currentTile) {\n\n while (numberOfCellsVisited < CAST_WIDTH * CAST_HEIGHT) {\n\n // Get coordinates of current tile and set as visited\n int currentX = currentTile.getPosition().getX();\n int currentY = currentTile.getPosition().getY();\n tempMap[currentY][currentX].setVisited(true);\n\n // Begin neighbourhood scan\n ArrayList<Integer> neighbours = new ArrayList<>();\n\n // If a neighbour is not visited and its projected position is within bounds, add it to the list of valid neighbours\n // North neighbour\n if (currentY - 1 >= 0) {\n if (!tempMap[currentY - 1][currentX].isVisited()) //Northern neighbour unvisited\n neighbours.add(0);\n }\n //Southern neighbour\n if (currentY + 1 < CAST_HEIGHT) { //y index if increased is not greater than height of the chamber\n if (!tempMap[currentY + 1][currentX].isVisited()) //Northern neighbour unvisited\n neighbours.add(1);\n }\n //Eastern neighbour\n if (currentX + 1 < CAST_WIDTH) { //check edge case\n if (!tempMap[currentY][currentX + 1].isVisited()) { //check if visited\n neighbours.add(2);\n }\n }\n //Western neighbour\n if (currentX - 1 >= 0) {\n if (!tempMap[currentY][currentX - 1].isVisited()) {\n neighbours.add(3);\n }\n }\n if (!neighbours.isEmpty()) {\n\n //generate random number between 0 and 3 for direction\n Random rand = new Random();\n boolean randomizer;\n int myDirection;\n do {\n myDirection = rand.nextInt(4);\n randomizer = neighbours.contains(myDirection);\n } while (!randomizer);\n\n //knock down wall\n switch (myDirection) {\n case 0 -> { // North\n tempMap[currentY][currentX].getPathDirection()[0] = true;\n currentTile = tempMap[currentY - 1][currentX];\n }\n case 1 -> { // South\n tempMap[currentY][currentX].getPathDirection()[1] = true;\n currentTile = tempMap[currentY + 1][currentX];\n }\n case 2 -> { // East\n tempMap[currentY][currentX].getPathDirection()[2] = true;\n currentTile = tempMap[currentY][currentX + 1];\n }\n case 3 -> { // West\n tempMap[currentY][currentX].getPathDirection()[3] = true;\n currentTile = tempMap[currentY][currentX - 1];\n }\n }\n\n mapStack.push(currentTile);\n numberOfCellsVisited++;\n } else {\n currentTile = mapStack.pop(); //backtrack\n }\n }\n\n castMaze(tempMap[0][0], -1);\n }","void testSearches(Tester t) {\n Vertex v1 = new Vertex(10, 10);\n Vertex v2 = new Vertex(10, 11);\n Vertex v3 = new Vertex(10, 12);\n\n Edge e1 = new Edge(v1, v2, 1);\n Edge e2 = new Edge(v2, v3, 1);\n\n IList<Vertex> map = new Cons<Vertex>(v1, new Cons<Vertex>(v2, new Cons<Vertex>(\n v3, new Empty<Vertex>())));\n\n Player player = new Player(map);\n DepthFirst dp = new DepthFirst(map);\n BreadthFirst bp = new BreadthFirst(map);\n\n t.checkExpect(player.current, v1);\n t.checkExpect(player.finished, false);\n\n t.checkExpect(bp.hasNext(), true);\n t.checkExpect(bp.next(), new Queue<Vertex>());\n\n t.checkExpect(dp.hasNext(), true);\n t.checkExpect(dp.next(), new Stack<Vertex>());\n\n t.checkExpect(player.move(true, e1), v2);\n\n t.checkExpect(player.current, v2);\n t.checkExpect(player.finished, false);\n\n t.checkExpect(bp.hasNext(), false);\n t.checkExpect(bp.next(), v3);\n\n t.checkExpect(dp.hasNext(), false);\n t.checkExpect(dp.next(), v3);\n\n t.checkExpect(player.move(true, e2), v3);\n\n player.finished = true;\n\n t.checkExpect(player.current, v3);\n t.checkExpect(player.finished, true);\n\n Queue<Vertex> q = new Queue<Vertex>(map);\n\n q.enqueue(new Vertex(5, 5));\n\n Deque<Vertex> dq = new Deque<Vertex>();\n dq.addAtHead(v1);\n dq.addAtTail(v2);\n dq.addAtTail(new Vertex(5, 5));\n\n\n t.checkExpect(q.isEmpty(), false);\n t.checkExpect(q.contents, dq);\n\n Stack<Vertex> stack = new Stack<Vertex>(map);\n\n t.checkExpect(stack.isEmpty(), false);\n dq.removeFromHead();\n t.checkExpect(stack.pop(), dq);\n\n t.checkExpect(dp.next(), v2);\n t.checkExpect(bp.hasNext(), true);\n\n }","public static Node searchBFSInvalidDes(int mat[][], int i, int j, int x,\n\t\t\tint y) {\n\t\tfor (int n = 1; n < 30; n++) {\n\t\t\tfor (int p = 1; p < 30; p++) {\n\t\t\t\tvisited[n][p] = false;\n\t\t\t}\n\t\t}\n\n\t\t// create an empty queue\n\t\tQueue<Node> q = queue;\n\t\tq.clear();\n\t\t// mark source cell as visited and enqueue the source node\n\t\tvisited[j][i] = true;\n\t\tNode root = NodeFactory.createNode(i, j, 0, null, null);\n\t\tq.add(root);\n\n\t\t// stores length of longest path from source to destination\n\t\tint min_dist = Integer.MAX_VALUE;\n\t\tNode node = null;\n\t\t// run till queue is not empty\n\t\twhile (!q.isEmpty()) {\n\t\t\t// pop front node from queue and process it\n\t\t\tnode = q.poll();\n\n\t\t\t// (i, j) represents current cell and dist stores its\n\t\t\t// minimum distance from the source\n\t\t\ti = node.x;\n\t\t\tj = node.y;\n\t\t\tint dist = node.dist;\n\n\t\t\t// if destination is found, update min_dist and stop\n\t\t\tif (i == x && j == y) {\n\t\t\t\tmin_dist = dist;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\t// check for all 4 possible movements from current cell\n\t\t\t// and enqueue each valid movement\n\t\t\tfor (Direction dir : DIRECTIONS) {\n\t\t\t\t// check if it is possible to go to position\n\t\t\t\t// (i + row[k], j + col[k]) from current position\n\t\t\t\tint nx = i + dir.x;\n\t\t\t\tint ny = j + dir.y;\n\t\t\t\tif (isValid(mat, visited, nx, ny) || ((nx == x) && ny == y)) {\n\t\t\t\t\t// mark next cell as visited and enqueue it\n\t\t\t\t\tvisited[ny][nx] = true;\n\t\t\t\t\tint ndist = dist + 1;\n\t\t\t\t\tNode newNode = NodeFactory.createNode(nx, ny, ndist, dir,\n\t\t\t\t\t\t\tnode);\n\t\t\t\t\t// Node newNode =new Node(node, nx, ny, ndist, dir);\n\t\t\t\t\tq.add(newNode);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (min_dist == Integer.MAX_VALUE)\n\t\t\treturn null;\n\t\treturn node;\n\t}","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 BFS() {\r\n\t\tSet<Vertex> visited = new HashSet<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\tBFS(this.vertices[3], visited, queue); // BFS starting with 40\r\n\r\n\t\t// Call the helper function to print BFS 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\tBFS(this.vertices[i], visited, queue);\r\n\t}","public void printBFS() {\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.zeroDistanceColumn());\n else\n System.out.print(currentCell.distanceColumn());\n }\n System.out.print(\"|\");\n System.out.println();\n }\n }\n }","public void bfs(Queue<Integer> queue, int visited[]) {\n if (queue.isEmpty()) {\n return;\n }\n\n int root = queue.poll();\n\n if (visited[root] == 1) {\n bfs(queue, visited);\n return;//alreadu into consideration\n }\n\n\n System.out.printf(\"Exploring of node %d has started\\n\", root);\n visited[root] = 1;\n\n\n for (int i = 0; i < adjMatrix[root].size(); i++) {\n if (visited[adjMatrix[root].get(i)] == 1 || visited[adjMatrix[root].get(i)] == 2) {\n continue;\n }\n queue.add(adjMatrix[root].get(i));\n }\n bfs(queue, visited);\n System.out.printf(\"Exploring of node %d has end\\n\", root);\n visited[root] = 2;\n }","public void breadthFirstTraversal() {\n beginAnimation();\n treeBreadthFirstTraversal();\n stopAnimation();\n\n }","private boolean bfs(int[] pos, int[][] dis, int[][] grid,int m, int n,int bcnt){\n Queue<int[]> q = new LinkedList<>();\n int curx=0, cury=0, curlevel=0 ;\n int newx = 0, newy=0, newlevel = 0;\n int[] cur;\n boolean availableplace = false;\n boolean[][] vd = new boolean[m][n];\n int res =0;\n vd[pos[0]][pos[1]] = true;\n q.offer(pos);\n while(!q.isEmpty()){\n cur = q.poll();\n curx = cur[0];\n cury = cur[1];\n curlevel = cur[2];\n vd[curx][cury]=true;\n for(int[] mm : M){\n newx = curx+mm[0];\n newy = cury+mm[1];\n if(newx >=0 && newx <m && newy >=0 && newy <n && !vd[newx][newy] &&grid[newx][newy]!=2){\n vd[newx][newy] = true;\n if(grid[newx][newy]==1) res++;\n else if(grid[newx][newy]==0){\n availableplace = true;\n dis[newx][newy]+=curlevel;\n q.offer(new int[]{newx,newy,curlevel+1});\n }\n }\n }\n }\n return res==bcnt-1&&availableplace;\n }","public static void breadthFirstSearch (HashMap<String, Zpair> stores,\n HashSet<Zpair> visited,\n List<Integer> sortedQueue) {\n List<String> q = new ArrayList<String>();\n q.add(\"Q\");\n // k=0\n //int k = 0;\n while(q.size() != 0) {\n //if(k == 21) {\n // System.exit(20);\n // }\n List<StringBuffer> path = new ArrayList<StringBuffer>(); // this is the return string\n List<String> q1 = new ArrayList<String>();\n int size = q.size();\n //System.out.println(k);\n for(int i = 0; i < size; i++) {\n //printList(q);\n path.add(ZMethods.stringPop(q));\n execute(path.get(i), stores, visited, q1, sortedQueue);\n }\n copyStringBuffer(q1,q);\n //k++;\n }\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 }","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}","private void bfs(int[][] board){\n int[][] original = {{1,2,3},{4,5,0}};\n LinkedList<Cell> queue = new LinkedList<>();\n HashMap<Cell,int[][]> states = new HashMap<Cell,int[][]>();\n Set<String> seen = new HashSet<>();\n queue.offer(new Cell(1,2));\n states.put(queue.peekFirst(),original);\n int step = 0;\n while(step <= maxStep){\n int sz = queue.size();\n while(sz-- > 0){\n Cell cur = queue.pollFirst();\n int[][] curBoard = states.get(cur);\n if(seen.contains(this.toStr(curBoard))){\n continue;\n }\n seen.add(this.toStr(curBoard));\n \n if (isSame(curBoard,board)){\n this.res = step;\n return;\n }\n // move around\n for(int i = 0; i < 4; ++i){\n int r = cur.row + dr[i];\n int c = cur.col + dc[i];\n if(r < 0 || c < 0 || r > 1 || c > 2) continue; \n Cell next = new Cell(r, c);\n queue.offer(next);\n int[][] nextboard = this.clone(curBoard);\n nextboard[cur.row][cur.col] = nextboard[r][c];\n nextboard[r][c] = 0;\n states.put(next,nextboard);\n }\n }\n ++step;\n }\n return;\n }","private Cell breadthFirstSearch(WorldMap worldMap, Cell startCell, CELLTYPE goalType, Hashtable<Cell, Cell> prev) {\n\n\t\t// Using markedSet to avoid re-checking already visited nodes\n\t\tHashSet<Cell> markedSet = new HashSet<Cell>();\n\t\tLinkedList<Cell> queue = new LinkedList<Cell>();\n\n\t\tmarkedSet.add(startCell);\n\t\tqueue.add(startCell);\n\n\t\twhile (!queue.isEmpty()) {\n\t\t\tCell cell = queue.remove();\n\t\t\tif (cell.getCellType() == goalType)\n\t\t\t\treturn cell;\n\t\t\tLinkedList<Cell> neighbors = generateSuccessors(worldMap, cell, goalType);\n\n\t\t\t/*\n\t\t\t * If looking for unexplored, shuffle list. Since the neighbors are\n\t\t\t * always returned NESW, it's best to shuffle the list if ant wants\n\t\t\t * to explore a random portion of the map.\n\t\t\t */\n\t\t\tif (goalType == CELLTYPE.UNEXPLORED)\n\t\t\t\tCollections.shuffle(neighbors, new Random(System.currentTimeMillis()));\n\n\t\t\tfor (Cell neighbor : neighbors)\n\t\t\t\tif (!markedSet.contains(neighbor)) {\n\t\t\t\t\tmarkedSet.add(neighbor);\n\t\t\t\t\tqueue.add(neighbor);\n\t\t\t\t\tprev.put(neighbor, cell);\n\t\t\t\t}\n\t\t}\n\t\t// If reached here, goal type doesn't exist\n\t\treturn null;\n\t}","static int[] bfs(int n, int m, int[][] edges, int s) {\r\n \r\n HashSet<Integer> aList[] = new HashSet[n];\r\n // Array of the nodes of the tree\r\n\r\n Queue<Integer> bfsQueue = new LinkedList();\r\n\r\n boolean visited[] = new boolean[n];\r\n // check if a node is visited or not\r\n\r\n\r\n int cost[] = new int[n];\r\n // cost to travel from one node to other\r\n\r\n for (int i = 0; i < n; i++) {\r\n // intialising the values\r\n visited[i] = false;\r\n cost[i] = -1;\r\n\r\n aList[i] = new HashSet<Integer>();\r\n // Each element of aList is a Set\r\n // To store the neighbouring nodes of a particular node\r\n }\r\n\r\n for (int i = 0; i < m; i++) {\r\n // let node[i] <--> node[j]\r\n\r\n // adding node[j] to neighbours list of node[i]\r\n aList[edges[i][0] - 1].add(edges[i][1] - 1);\r\n\r\n // adding node[i] to neighbours list of node[j]\r\n aList[edges[i][1] - 1].add(edges[i][0] - 1);\r\n }\r\n\r\n //\r\n s = s - 1;\r\n bfsQueue.add(s);\r\n visited[s] = true;\r\n cost[s] = 0;\r\n //\r\n \r\n \r\n while (!bfsQueue.isEmpty()) {\r\n \r\n int curr = bfsQueue.poll();\r\n // takes the last element of the queue\r\n \r\n for (int neigh : aList[curr]) { // iterating the neighbours of node 'curr'\r\n if (!visited[neigh]) { // checking if node neigh id already visited during the search\r\n visited[neigh ] = true;\r\n bfsQueue.add(neigh); //add the node neigh to bfsqueue\r\n cost[neigh] = cost[curr] + 6; \r\n }\r\n }\r\n }\r\n\r\n int result[] = new int[n-1];\r\n\r\n for (int i=0, j=0; i<n && j<n-1; i++, j++) {\r\n if (i == s){\r\n i++;\r\n }\r\n result[j] = cost[i];\r\n }\r\n \r\n return result;\r\n }","private void breadthFirstSearch(Node sourceNode, Node destinationNode, String path, HashSet<Character> visited) {\n // Create a list of nodes to visit (children of nodes)\n LinkedList<Node> nextToVisit = new LinkedList<>();\n // Add the first node to the list\n nextToVisit.add(sourceNode);\n\n // Traverse level by level by traversing to all of its children first\n while(!nextToVisit.isEmpty()) {\n Node node = nextToVisit.remove();\n // If its visited already, continue to the next child\n if(visited.contains(node.charId)) {\n continue;\n }\n // Mark the node as visited\n path += \"->\" + node.charId;\n visited.add(node.charId);\n // If destination is reached\n if(node == destinationNode) {\n paths.add(path);\n return;\n }\n // Add all of its children to the next node to visit\n for(Node children : node.adjacent) {\n nextToVisit.add(children);\n }\n }\n\n }","@Override\r\n public boolean breadthFirstSearch(T start, T end) {\r\n Vertex<T> startV = vertices.get(start);\r\n Vertex<T> endV = vertices.get(end);\r\n\r\n Queue<Vertex<T>> queue = new LinkedList<Vertex<T>>();\r\n Set<Vertex<T>> visited = new HashSet<>();\r\n\r\n queue.add(startV);\r\n visited.add(startV);\r\n\r\n while(queue.size() > 0){\r\n Vertex<T> next = queue.poll();\r\n if(next == null){\r\n continue;\r\n }\r\n if(next == endV){\r\n return true;\r\n }\r\n\r\n for (Vertex<T> neighbor: next.getNeighbors()){\r\n if(!visited.contains(neighbor)){\r\n visited.add(neighbor);\r\n queue.add(neighbor);\r\n }\r\n }\r\n }\r\n\r\n return false;\r\n }","public static int runBFS(int[][]map, coordinate src1, coordinate src2){\n\t \n boolean visited[][] = new boolean[dim][dim]; //visited boolean 2d array that is the same size as 2d map\n coordinate visit1[][]=new coordinate[dim][dim]; // this is the one used to hold previous location\n coordinate visit2[][]=new coordinate[dim][dim]; // this is the one used to hold previous location\n\t \n\t visit1[0][0]=new coordinate(0,0); //same as BFS\n \n\t visit2[dim-1][dim-1] = new coordinate(dim-1,dim-1);\n\t //marked both the 0,0 and dim-1, dim-1 srcs as visited\n\t \n\t Queue<QueueNode> queue1 = new LinkedList<>(); //queue for src1\n\t Queue<QueueNode> queue2 = new LinkedList<>(); //queue for src2\n\t \n\t QueueNode sn1 = new QueueNode(src1, 0, src1); //src node 1 queue node\n\t QueueNode sn2 = new QueueNode(src2, 0, src2);\n\t \n\t ArrayList<coordinate> pathHold1 = new ArrayList<>(); //for first path\n\t ArrayList<coordinate> pathHold2 = new ArrayList<>(); //for second path \n\t \n\t visited[src1.x][src1.y] = true; //mark the start node as visited inside of the visited boolean 2d array for first src\n\t visited[src2.x][src2.y] = true; //mark the start node as visited inside of the visited boolean 2d array for second src\n\t \n\t System.out.println();\n\t \n\t queue1.add(sn1);\n\t queue2.add(sn2);\n\t //added the start nodes\n\t \n\t QueueNode current1 = null;\n\t QueueNode current2 = null;\n\t //to be used later to hold current node being looked at\n\t coordinate c1 = null;\n\t coordinate c2 = null;\n\t\t//coordinates to be examined\n\t \n\t while(!queue1.isEmpty()&&!queue2.isEmpty()){\n\t //keep iterating so long as queues have items -- but if one becomes empty, check at each iteration\n\t\t\t//to avoid null pointer so we are not dequeuing from empty queue\n int maxFringe = 0;\n\t\t//use this to check max fringe at each time we add to either queue\n if(queue1.size()>maxFringe || queue2.size()>0) {\n \t if(queue1.size()>maxFringe) {\n \t\t maxFringe=queue1.size();\n \t }else {\n \t\t maxFringe=queue2.size();\n \t }\n }\n\t \n\t \tif(!queue1.isEmpty()) { \n\t\t\t\t//while first queue is not empty, pop\n\t \t\t current1 = queue1.peek(); // this is n\n\t c1 = current1.point;\n\t \t\t visited[c1.x][c1.y]=true; //mark this node as visited, will check neighbors later\n\t boolean inFringe = false;\n\t inFringe = compareFringe(c1, queue2); //see if intersect or not\n\t \n\t \n\t // compare current point to the queue2 fringe. If not in fringe\n\t if(inFringe) {\n\t \t //we have found the duplicate \n\t \t System.out.println(\"duplicate\");\n\t \t intersect = c1;\n\t\t System.out.println(\"Intersect is :\"+c1.x+\",\"+c1.y);\n\t\t visit1[c1.x][c1.y]=current1.prev; //set prev node or where we came from\n\t\t \n\t\t System.out.println(\"We have reached our goal!\");\n\t\t \n\t\t if(current2 != null) {\n\t\t\t\t\t //so long as paths have values, add length and return\n\t\t return current1.pathTotal+current2.pathTotal;\n\t\t }else {\n\t\t\t\t\t //else return only one path \n\t\t \t return current1.pathTotal;\n\t\t }\n\t }\n\t\t\t\t//this is getting the neighbors, same as BFS\n\t \n\t int row1 = 0;\n\t int col1 = 0;\n\t \n\t for (int i = 0; i < 4; i++) { \n\t row1= c1.x + rowNum1[i]; \n\t col1 = c1.y + colNum1[i]; \n\t //grab neighbor of current\n\t if (cellValid(row1, col1) && map[row1][col1] == 1 && !visited[row1][col1]){ \n\t \t \n\t // mark cell as visited and enqueue it \n\t visited[row1][col1] = true; //we visited the node so mark it\n\t visit1[row1][col1] = new coordinate(c1.x, c1.y); //set prev as current coord\n\n\t QueueNode Adjcell = new QueueNode(new coordinate(row1, col1), current1.pathTotal + 1, new coordinate(row1-rowNum1[i], col1-colNum1[i])); \n\t queue1.add(Adjcell); //make it a queueNode to add to q1 for first path\n\t }else if(cellValid(row1, col1) && map[row1][col1] == 1 && (visited[row1][col1]&&visit2[row1][col1]!=null)){\n\t \t // System.out.println(\"already visited\"+row1+\",\"+col1); \n\t\t\t\t //check if already visited and valid (not off grid) and = 1 so we can take path -- \n\t\t\t\t //if so, this means we found intersect\n\t\t\t\t //make sure node has been visited in other path to guarantee it is intersect\n\t \t intersect=new coordinate(row1,col1); //set intersect\n\t \t visit1[intersect.x][intersect.y]=new coordinate(c1.x, c1.y); //set where we came from\n\t \t //current1.pathTotal++;\n\t \t printfin(visit1, visit2); //used to print final path -- set map\n \n int nodesExplored1 = 0;\n int nodesExplored2 = 0;\n for(coordinate coor : pathHold1){\n nodesExplored1++;\n }\n for(coordinate coor : pathHold2){\n nodesExplored2++;\n }\n\t\t\t\t \n\t\t\t\t //get number of nodes expanded in each path, add together\n\n int fin = nodesExplored1+nodesExplored2; //this is final explored nodes in each path\n System.out.println(\"Nodes explored: \" + fin);\n \n\t \t return pathsize; //return total pathsize\n\t \t //break;\n\t }\n\t \n\t \n\t } \n\t //once all of the neighbors have been visited, dequeue from queue 1 in path 1\n\t queue1.remove(); \n\t pathHold1.add(c1); //add to explored\n\t \n\t }\n\t \t//now to the same in path2 from (dim-1, dim-1) as src2\n\t \tif(!queue2.isEmpty()) {\n\t \t\t\n\t \t\t current2 = queue2.peek(); // this is n\n\t c2 = current2.point;\n\t \t\t visited[c2.x][c2.y]=true;\n\t boolean inFringe = false;\n\t inFringe = compareFringe(c2, queue1);\n\t \n\t // compare current point to the queue2 fringe. If not in fringe\n\t if(inFringe) {\n\t \t //we have found the duplicate \n\t \t System.out.println(\"duplicate\");\n\t \t intersect = c2;\n\t\t // System.out.println(\"Intersect is :\"+c2.x+\",\"+c2.y);\n\t\t visit2[c2.x][c2.y]=current2.prev;\n\t\t \n\t\t System.out.println(\"We have reached our goal!\");\n\t\t \n\t\t \n\t\t if(current1 != null) {\n\t\t\t return current1.pathTotal+current2.pathTotal;\n\t\t\t }else {\n\t\t\t \t return current2.pathTotal;\n\t\t\t }\n\t }\n\t \n\t \t// get neighbors\n\t int row2 = 0;\n\t int col2 = 0;\n\t \n\t for (int i = 0; i < 4; i++) { \n\t row2= c2.x + rowNum2[i]; \n\t col2 = c2.y + colNum2[i]; \n\t \n\t \n\t if (cellValid(row2, col2) && map[row2][col2] == 1 && !visited[row2][col2]){ \n\t \t \n\t // mark cell as visited and enqueue it \n\t visited[row2][col2] = true; \n\t visit2[row2][col2] = new coordinate(c2.x, c2.y);\n\n\t QueueNode Adjcell2 = new QueueNode(new coordinate(row2, col2), current2.pathTotal + 1, new coordinate(row2-rowNum2[i], col2-colNum2[i])); \n\t queue2.add(Adjcell2);\n\t }else if(cellValid(row2, col2) && map[row2][col2] == 1 && (visited[row2][col2]&&visit1[row2][col2]!=null)){\n\t \t \n\t \t intersect=new coordinate(row2,col2);\n\t \t \n\t \t visit2[intersect.x][intersect.y]=new coordinate(c2.x, c2.y);\n\t \n\t \n\t printfin(visit1, visit2);\n\t int nodesExplored1 = 0;\n int nodesExplored2 = 0;\n for(coordinate coor : pathHold1){\n nodesExplored1++;\n }\n for(coordinate coor : pathHold2){\n nodesExplored2++;\n }\n\n int fin = nodesExplored1+nodesExplored2;\n System.out.println(\"Nodes explored: \" + fin);\n\t \t return pathsize;\n\t \t \n\t }\n\t \n\t } \n\t //once all of the neighbors have been visited, dequeue \n\t queue2.remove(); \n\t pathHold2.add(c2);\n\t \t\t\n\t \t}\n\n\t }\n \n int nodesExplored1 = 0;\n int nodesExplored2 = 0;\n for(coordinate coor : pathHold1){\n nodesExplored1++;\n }\n for(coordinate coor : pathHold2){\n nodesExplored2++;\n }\n\n int fin = nodesExplored1+nodesExplored2;\n System.out.println(\"Nodes explored: \" + fin);\n\t //if here, means no path was found\n\t return -1;\n\t \n\t }","public BFSMaze(MazeConstructor maze) {\n this.maze = maze;\n this.r = maze.getR();\n queue = new LinkedList<>();\n parents = new LinkedList<>();\n }","public static Vector<int []> BFS(int[] startPosition,int[] unexploreNode, mapNode[][] nodes){\n\t\t\r\n\t\tVector<int []> shortestPath;\r\n\t\t\r\n\t\t//initial all nodes' status to UN-visited\r\n\t\tfor(int i = 0; i < nodes.length; i++)\r\n\t\t{\r\n\t\t\tfor(int j = 0; j < nodes[i].length;j++)\r\n\t\t\t{\r\n\t\t\t\tnodes[i][j].setTotDistance(999999999);//set the initial distance to INF\r\n\t\t\t\tnodes[i][j].gridPosition[0] = i;//save current node x position\r\n\t\t\t\tnodes[i][j].gridPosition[1] = j;//save current node y position\r\n\t\t\t\tnodes[i][j].setNodeVistied(false);//set all nodes are not visited yet\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\t\t//create start node and add it into the execution queue\r\n\t\tmapNode tempNode = new mapNode();\r\n\t\ttempNode = nodes[startPosition[0]][startPosition[1]];\r\n\t\tVector<mapNode> tempQueue = new Vector<mapNode>();\r\n\t\ttempQueue.add(tempNode);\r\n\t\t//main loop: check all nodes on the map\r\n\t\twhile(tempQueue.size() != 0)\r\n\t\t{\r\n\t\t\t//create four nearby nodes\r\n\t\t\tmapNode tempTopNode = new mapNode();\r\n\t\t\tmapNode tempBottomNode = new mapNode();\r\n\t\t\tmapNode tempLeftNode = new mapNode();\r\n\t\t\tmapNode tempRightNode = new mapNode();\r\n\t\t\t\t\r\n\t\t\t//update Top node information from original nodes matrix\r\n\t\t\tif(tempQueue.get(0).topNode != null)\r\n\t\t\t{\r\n\t\t\t\ttempTopNode = nodes[tempQueue.get(0).topNode.gridPosition[0]][tempQueue.get(0).topNode.gridPosition[1]];\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\ttempTopNode = null;\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t//update Bottom node information from original nodes matrix\r\n\t\t\tif(tempQueue.get(0).bottomNode != null)\r\n\t\t\t{\r\n\t\t\t\ttempBottomNode = nodes[tempQueue.get(0).bottomNode.gridPosition[0]][tempQueue.get(0).bottomNode.gridPosition[1]];\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\ttempBottomNode = null;\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t//update Left node information from original nodes matrix\r\n\t\t\tif(tempQueue.get(0).leftNode != null)\r\n\t\t\t{\r\n\t\t\t\ttempLeftNode = nodes[tempQueue.get(0).leftNode.gridPosition[0]][tempQueue.get(0).leftNode.gridPosition[1]];\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\ttempLeftNode = null;\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t//update Right node information from original nodes matrix\r\n\t\t\tif(tempQueue.get(0).rightNode != null)\r\n\t\t\t{\r\n\t\t\t\ttempRightNode = nodes[tempQueue.get(0).rightNode.gridPosition[0]][tempQueue.get(0).rightNode.gridPosition[1]];\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\ttempRightNode = null;\r\n\t\t\t}\r\n\t\t\t\t\r\n\t\t\t//start re-calculate distance of each node\r\n\t\t\t//check the top node and update new distance\r\n\t\t\tif(tempTopNode != null)\r\n\t\t\t{\r\n\t\t\t\tif(tempTopNode.getNodeVisited() == false && tempTopNode.getOwnElevation() != 999999999 && tempTopNode.getStatus() != Status.EXPLORED )\r\n\t\t\t\t{\r\n\t\t\t\t\tVector<int[]> tempPath = new Vector<int[]>();\r\n\t\t\t\t\t//record the path\r\n\t\t\t\t\tfor(int m = 0; m < tempQueue.get(0).getTotPath().size(); m++)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tint[] tempXY = new int[2];\r\n\t\t\t\t\t\ttempXY = tempQueue.get(0).getTotPath().get(m);\r\n\t\t\t\t\t\ttempPath.add(tempXY);\r\n\t\t\t\t\t}\r\n\t\t\t\t\t//check new node to see if exists in path\r\n\t\t\t\t\tif(checkPositionInPath(tempPath, tempQueue.get(0).gridPosition[0], tempQueue.get(0).gridPosition[1]) == false)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tint[] tempXY2 = new int[2];\r\n\t\t\t\t\t\ttempXY2 = tempQueue.get(0).gridPosition;\r\n\t\t\t\t\t\ttempPath.add(tempXY2);\r\n\t\t\t\t\t}\r\n\t\t\t\t\t//assign new path to the node\r\n\t\t\t\t\ttempTopNode.setTotPath(tempPath);\r\n\t\t\t\t\t//update data back to original matrix\r\n\t\t\t\t\ttempTopNode.setStatus(Status.EXPLORED);\r\n\t\t\t\t\tnodes[tempTopNode.gridPosition[0]][tempTopNode.gridPosition[1]] = tempTopNode;\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\tif(tempTopNode.gridPosition[0] == unexploreNode[0] && tempTopNode.gridPosition[1] == unexploreNode[1]){\r\n\t\t\t\t\t//print out the end node\r\n\t\t\t\t\t//print out the total distance between two points\r\n\t\t\t\t\t//print out the total number node of path\r\n\t\t\t\t\t//System.out.println(\"End Point: \"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[0]+1)+\" \"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[1]+1));\r\n\t\t\t\t\t//System.out.println(\"Total Distance: \"+nodes[unexploreNode[0]][unexploreNode[1]].getTotDistance());\r\n\t\t\t\t\t//System.out.println(\"Total number of nodes: \"+nodes[unexploreNode[0]][unexploreNode[1]].getTotPath().size());\r\n\t\t\t\t\tshortestPath = nodes[unexploreNode[0]][unexploreNode[1]].getTotPath();\r\n\t\t\t\t\tshortestPath.add(unexploreNode);\r\n\t\t\t\t\treturn shortestPath;\t\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\tif(nodes[tempTopNode.gridPosition[0]][tempTopNode.gridPosition[1]].getNodeVisited()== false && checkNodeInQueue(tempQueue, tempTopNode.gridPosition[0], tempTopNode.gridPosition[1]) == false && tempTopNode.getOwnElevation() != 999999999)\r\n\t\t\t\t{\r\n\t\t\t\t\t//check un-visited nodes and add new node into execution queue\r\n\t\t\t\t\ttempQueue.add(tempTopNode);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t//check the bottom node and update new distance\r\n\t\t\tif(tempBottomNode != null)\r\n\t\t\t{\r\n\t\t\t\tif(tempBottomNode.getNodeVisited() == false && tempBottomNode.getOwnElevation() != 999999999 && tempBottomNode.getStatus() != Status.EXPLORED)\r\n\t\t\t\t{\r\n\t\t\t\t\tVector<int[]> tempPath = new Vector<int[]>();\r\n\t\t\t\t\t//record the path\r\n\t\t\t\t\tfor(int m = 0; m < tempQueue.get(0).getTotPath().size(); m++)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tint[] tempXY = new int[2];\r\n\t\t\t\t\t\ttempXY = tempQueue.get(0).getTotPath().get(m);\r\n\t\t\t\t\t\ttempPath.add(tempXY);\r\n\t\t\t\t\t}\r\n\t\t\t\t\t//check new node to see if it exists in path\r\n\t\t\t\t\tif(checkPositionInPath(tempPath, tempQueue.get(0).gridPosition[0], tempQueue.get(0).gridPosition[1]) == false)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tint[] tempXY2 = new int[2];\r\n\t\t\t\t\t\ttempXY2 = tempQueue.get(0).gridPosition;\r\n\t\t\t\t\t\ttempPath.add(tempXY2);\r\n\t\t\t\t\t}\t\t\t\t\r\n\t\t\t\t\t//assign new path to the node\r\n\t\t\t\t\ttempBottomNode.setTotPath(tempPath);\r\n\t\t\t\t\ttempBottomNode.setStatus(Status.EXPLORED);\r\n\t\t\t\t\t//update data back to original matrix\r\n\t\t\t\t\tnodes[tempQueue.get(0).bottomNode.gridPosition[0]][tempQueue.get(0).bottomNode.gridPosition[1]] = tempBottomNode;\r\n\t\t\t\t}\r\n\t\t\t\tif(tempBottomNode.gridPosition[0] == unexploreNode[0] && tempBottomNode.gridPosition[1] == unexploreNode[1]){\r\n\t\t\t\t\t//System.out.println(\"End Point: \"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[0]+1)+\" \"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[1]+1));\r\n\t\t\t\t\t//System.out.println(\"Total Distance: \"+nodes[unexploreNode[0]][unexploreNode[1]].getTotDistance());\r\n\t\t\t\t\t//System.out.println(\"Total number of nodes: \"+nodes[unexploreNode[0]][unexploreNode[1]].getTotPath().size());\r\n\t\t\t\t\tshortestPath = nodes[unexploreNode[0]][unexploreNode[1]].getTotPath();\r\n\t\t\t\t\tshortestPath.add(unexploreNode);\r\n\t\t\t\t\treturn shortestPath;\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\tif(nodes[tempBottomNode.gridPosition[0]][tempBottomNode.gridPosition[1]].getNodeVisited()== false && checkNodeInQueue(tempQueue, tempBottomNode.gridPosition[0], tempBottomNode.gridPosition[1]) == false && tempBottomNode.getOwnElevation() != 999999999)\r\n\t\t\t\t{\r\n\t\t\t\t\t//check un-visited nodes and add new node into execution queue\r\n\t\t\t\t\ttempQueue.add(tempBottomNode);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t//check the left node and update new distance\r\n\t\t\tif(tempLeftNode != null)\r\n\t\t\t{\r\n\t\t\t\tif(tempLeftNode.getNodeVisited() == false && tempLeftNode.getOwnElevation() != 999999999 && tempLeftNode.getStatus() != Status.EXPLORED)\r\n\t\t\t\t{\r\n\t\t\t\t\tVector<int[]> tempPath = new Vector<int[]>();\r\n\t\t\t\t\t//record the path\r\n\t\t\t\t\tfor(int m = 0; m < tempQueue.get(0).getTotPath().size(); m++)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tint[] tempXY = new int[2];\r\n\t\t\t\t\t\ttempXY = tempQueue.get(0).getTotPath().get(m);\r\n\t\t\t\t\t\ttempPath.add(tempXY);\r\n\t\t\t\t\t}\r\n\t\t\t\t\t//check new node to see if it exists in path\r\n\t\t\t\t\tif(checkPositionInPath(tempPath, tempQueue.get(0).gridPosition[0], tempQueue.get(0).gridPosition[1]) == false)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tint[] tempXY2 = new int[2];\r\n\t\t\t\t\t\ttempXY2 = tempQueue.get(0).gridPosition;\r\n\t\t\t\t\t\ttempPath.add(tempXY2);\r\n\t\t\t\t\t}\t\t\t\t\r\n\t\t\t\t\t//assign new path to the node\r\n\t\t\t\t\ttempLeftNode.setTotPath(tempPath);\r\n\t\t\t\t\ttempLeftNode.setStatus(Status.EXPLORED);\r\n\t\t\t\t\t//update data back to original matrix\r\n\t\t\t\t\tnodes[tempQueue.get(0).leftNode.gridPosition[0]][tempQueue.get(0).leftNode.gridPosition[1]] = tempLeftNode;\r\n\t\t\t\t}\r\n\t\t\t\tif(tempLeftNode.gridPosition[0] == unexploreNode[0] && tempLeftNode.gridPosition[1] == unexploreNode[1]){\r\n\t\t\t\t\t//System.out.println(\"End Point: \"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[0]+1)+\" \"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[1]+1));\r\n\t\t\t\t\t//System.out.println(\"Total Distance: \"+nodes[unexploreNode[0]][unexploreNode[1]].getTotDistance());\r\n\t\t\t\t\t//System.out.println(\"Total number of nodes: \"+nodes[unexploreNode[0]][unexploreNode[1]].getTotPath().size());\r\n\t\t\t\t\tshortestPath = nodes[unexploreNode[0]][unexploreNode[1]].getTotPath();\r\n\t\t\t\t\tshortestPath.add(unexploreNode);\r\n\t\t\t\t\treturn shortestPath;\t\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\tif(nodes[tempLeftNode.gridPosition[0]][tempLeftNode.gridPosition[1]].getNodeVisited()== false && checkNodeInQueue(tempQueue, tempLeftNode.gridPosition[0], tempLeftNode.gridPosition[1]) == false && tempLeftNode.getOwnElevation() != 999999999)\r\n\t\t\t\t{\r\n\t\t\t\t\t//check un-visited nodes and add new node into execution queue\r\n\t\t\t\t\ttempQueue.add(tempLeftNode);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t//check the right node and update new distance\r\n\t\t\tif(tempRightNode != null)\r\n\t\t\t{\r\n\t\t\t\tif(tempRightNode.getNodeVisited() == false && tempRightNode.getOwnElevation() != 999999999 && tempRightNode.getStatus() != Status.EXPLORED)\r\n\t\t\t\t{\r\n\t\t\t\t\tVector<int[]> tempPath = new Vector<int[]>();\r\n\t\t\t\t\t//record the path\r\n\t\t\t\t\tfor(int m = 0; m < tempQueue.get(0).getTotPath().size(); m++)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tint[] tempXY = new int[2];\r\n\t\t\t\t\t\ttempXY = tempQueue.get(0).getTotPath().get(m);\r\n\t\t\t\t\t\ttempPath.add(tempXY);\r\n\t\t\t\t\t}\r\n\t\t\t\t\t//check to see if new node existed in path\r\n\t\t\t\t\tif(checkPositionInPath(tempPath, tempQueue.get(0).gridPosition[0], tempQueue.get(0).gridPosition[1]) == false)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tint[] tempXY2 = new int[2];\r\n\t\t\t\t\t\ttempXY2 = tempQueue.get(0).gridPosition;\r\n\t\t\t\t\t\ttempPath.add(tempXY2);\r\n\t\t\t\t\t}\r\n\t\t\t\t\t//assign new path to the node\r\n\t\t\t\t\ttempRightNode.setTotPath(tempPath);\r\n\t\t\t\t\ttempRightNode.setStatus(Status.EXPLORED);\r\n\t\t\t\t\t//update data back to original matrix\r\n\t\t\t\t\tnodes[tempQueue.get(0).rightNode.gridPosition[0]][tempQueue.get(0).rightNode.gridPosition[1]] = tempRightNode;\r\n\t\t\t\t}\r\n\t\t\t\tif(tempRightNode.gridPosition[0] == unexploreNode[0] && tempRightNode.gridPosition[1] == unexploreNode[1]){\r\n\t\t\t\t\t//System.out.println(\"End Point: \"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[0]+1)+\" \"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[1]+1));\r\n\t\t\t\t\t//System.out.println(\"Total Distance: \"+nodes[unexploreNode[0]][unexploreNode[1]].getTotDistance());\r\n\t\t\t\t\t//System.out.println(\"Total number of nodes: \"+nodes[unexploreNode[0]][unexploreNode[1]].getTotPath().size());\r\n\t\t\t\t\tshortestPath = nodes[unexploreNode[0]][unexploreNode[1]].getTotPath();\r\n\t\t\t\t\tshortestPath.add(unexploreNode);\r\n\t\t\t\t\treturn shortestPath;\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\tif(nodes[tempRightNode.gridPosition[0]][tempRightNode.gridPosition[1]].getNodeVisited()== false && checkNodeInQueue(tempQueue, tempRightNode.gridPosition[0], tempRightNode.gridPosition[1]) == false && tempRightNode.getOwnElevation() != 999999999)\r\n\t\t\t\t{\r\n\t\t\t\t\t//check un-visited nodes and add new node into execution queue\r\n\t\t\t\t\ttempQueue.add(tempRightNode);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t//set current node to visited node and\r\n\t\t\t//remove current node from execution queue\r\n\t\t\ttempQueue.get(0).setNodeVistied(true);\r\n\t\t\tnodes[tempQueue.get(0).gridPosition[0]][tempQueue.get(0).gridPosition[1]].setNodeVistied(true);\r\n\t\t\ttempQueue.remove(0);\t\r\n\t\t}\r\n\t\t//print out the end node\r\n\t\t//print out the total distance between two points\r\n\t\t//print out the total number node of path\r\n\t\tSystem.out.println(\"End 5 Point: \"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[0]+1)+\" \"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[1]+1));\r\n\t\tSystem.out.println(\"Total Distance: \"+nodes[unexploreNode[0]][unexploreNode[1]].getTotDistance());\r\n\t\tSystem.out.println(\"Total number of nodes: \"+nodes[unexploreNode[0]][unexploreNode[1]].getTotPath().size());\r\n\t\tshortestPath = nodes[unexploreNode[0]][unexploreNode[1]].getTotPath();\r\n\t\tshortestPath.add(unexploreNode);\r\n\t\treturn shortestPath;\t\t\r\n\t}","private int BFS() {\n adjList.cleanNodeFields();\n\n //Queue for storing current shortest path\n Queue<Node<Integer, Integer>> q = new LinkedList<>();\n\n //Set source node value to 0\n q.add(adjList.getNode(startNode));\n q.peek().key = 0;\n q.peek().d = 0;\n q.peek().visited = true;\n\n //Helper variables\n LinkedList<Pair<Node<Integer, Integer>, Integer>> neighbors;//Array of pairs <neighborKey, edgeWeight>\n Node<Integer, Integer> neighbor, u;\n long speed = (long) (cellSideLength * 1.20);\n\n while (!isCancelled() && q.size() != 0) {\n u = q.poll();\n\n //Marks node as checked\n checkedNodesGC.fillRect((u.value >> 16) * cellSideLength + 0.5f,\n (u.value & 0x0000FFFF) * cellSideLength + 0.5f,\n (int) cellSideLength - 1, (int) cellSideLength - 1);\n\n //endNode found\n if (u.value == endNode) {\n //Draws shortest path\n Node<Integer, Integer> current = u, prev = u;\n\n while ((current = current.prev) != null) {\n shortestPathGC.strokeLine((prev.value >> 16) * cellSideLength + cellSideLength / 2,\n (prev.value & 0x0000FFFF) * cellSideLength + cellSideLength / 2,\n (current.value >> 16) * cellSideLength + cellSideLength / 2,\n (current.value & 0x0000FFFF) * cellSideLength + cellSideLength / 2);\n prev = current;\n }\n return u.d;\n }\n\n //Wait after checking node\n try {\n Thread.sleep(speed);\n } catch (InterruptedException interrupted) {\n if (isCancelled())\n break;\n }\n\n //Checking Neighbors\n neighbors = adjList.getNeighbors(u.value);\n for (Pair<Node<Integer, Integer>, Integer> neighborKeyValuePair : neighbors) {\n neighbor = neighborKeyValuePair.getKey();\n //Relaxation step\n //Checks if neighbor hasn't been checked, if so the assign the shortest path\n if (!neighbor.visited) {\n //Adds checked neighbor to queue\n neighbor.key = u.d + 1;\n neighbor.d = u.d + 1; //Assign shorter path found to neighbor\n neighbor.prev = u;\n neighbor.visited = true;\n q.add(neighbor);\n }\n }\n }\n return Integer.MAX_VALUE;\n }","void BFS(int s);","static void bfs(int[][] G){\n\t\tQueue<Integer> q = new LinkedList<Integer>();\t\t\n\t\tfor (int ver_start = 0; ver_start < N; ver_start ++){\n\t\t\tif (visited[ver_start]) continue;\n\t\t\tq.add(ver_start);\n\t\t\tvisited[ver_start] = true;\n\n\t\t\twhile(!q.isEmpty()){\n\t\t\t\tint vertex = q.remove();\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 queue\n\t\t\t\t\t\tq.add(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\t\t\tSystem.out.println(\"--\");\t\t\t\n\t\t}\n\t}","private static void breadthFirstSearch(int source, ArrayList<ArrayList<Integer>> nodes) {\n\t\tArrayList<ArrayList<Integer>> neighbours = nodes;\n\t\tQueue<Integer> queue= new LinkedList<Integer>();\n\t\t\n\t\tboolean[] visited = new boolean[nodes.size()];\n\t\t\n\t\tqueue.add(source);\n\t\tvisited[source]=true;\n\t\t\n\t\twhile(!queue.isEmpty()) {\n\t\t\tint k =queue.remove();\n\t\t\tSystem.out.println(k);\n\t\t\tfor(int p : nodes.get(k)) {\n\t\t\t\tif(!visited[p]) {\n\t\t\t\t\tqueue.add(p);\n\t\t\t\t\tvisited[p]=true;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\t\n\t\t\n\t}","Path run(Maze maze, Cell start, Cell finish) {\n Path path = new Path();\n if (start.equals(finish)) {\n path.add(start);\n return path;\n }\n Maze changed = new Maze(maze);\n CellQueue queue = new CellQueueLinkedListImpl();\n queue.enqueue(start);\n changed.setCellValue(start, 0);\n Cell curCell;\n do {\n curCell = queue.dequeue();\n for (int i = -1; i <= 1; i++) {\n for (int j = -1; j <= 1; j++) {\n for (int k = -1; k <= 1; k++) {\n Cell curNeighbour = new Cell(curCell.x + i, curCell.y + j, curCell.z + k);\n //check that curNeighbour exists and empty\n if (changed.getCellValue(curNeighbour) == -1) {\n changed.setCellValue(curNeighbour, changed.getCellValue(curCell) + 1);\n queue.enqueue(curNeighbour);\n }\n }\n }\n }\n } while (!queue.isEmpty() && !curCell.equals(finish));\n if (!curCell.equals(finish)) {\n return path;\n }\n while (!curCell.equals(start)) {\n path.addBegin(curCell);\n int curPathIndex = changed.getCellValue(curCell);\n boolean foundPrev = false;\n for (int i = -1; i <= 1 && !foundPrev; i++) {\n for (int j = -1; j <= 1 && !foundPrev; j++) {\n for (int k = -1; k <= 1 && !foundPrev; k++) {\n Cell curNeighbour = new Cell(curCell.x + i, curCell.y + j, curCell.z + k);\n if (changed.getCellValue(curNeighbour) == changed.getCellValue(curCell) - 1) {\n curCell = curNeighbour;\n foundPrev = true;\n }\n }\n }\n }\n }\n path.addBegin(start);\n return path;\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}","public static int bfs() {\r\n check = new int[N][N]; // check 변수 초기화\r\n q = new LinkedList<Point>();\t\t\t\t\t//bfs 할때 필요한 그 stack. first in first out\r\n q.offer(new Point(shark.x, shark.y));\t\t\t//q.offer == 해당 큐의 맨 뒤에 전달된 요소를 삽입함. list에서 list.add와 같은 말임.\r\n check[shark.x][shark.y] = 1;\r\n\r\n int FishCheck = 0;\t\t\t\t\t\t\t\t//the number of the fish in the sea map\r\n Shark fish = new Shark(N, N);\t\t\t\t\t//new shark initiation\r\n loop: while (!q.isEmpty()) {\r\n int r = q.peek().x;\t\t\t\t\t\t\t//q.peek == 해당 큐의 맨 앞에 있는(제일 먼저 저장된) 요소를 반환함\r\n int c = q.poll().y;\t\t\t\t\t\t\t//q.poll == 해당 큐의 맨 앞에 있는(제일 먼저 저장된) 요소를 반환하고, 해당 요소를 큐에서 제거함. 만약 큐가 비어있으면 null을 반환함.\r\n\r\n for (int d = 0; d < dr.length; d++) {\r\n int nr = r + dr[d];\t\t\t\t\t\t//북(0),남(1),동(2),서(3) 순으로. nr == new row\r\n int nc = c + dc[d];\t\t\t\t\t\t//북(0),남(1),동(2),서(3) 순으로. nc == new column\r\n\r\n // 지나갈 수 있는 곳: 자신보다 큰 물고기가 없는 곳\r\n if (isIn(nr, nc) && check[nr][nc] == 0 && sea[nr][nc] <= shark.lv) {\r\n check[nr][nc] = check[r][c] + 1;\r\n q.offer(new Point(nr, nc));\r\n\r\n // 위치가 더 커질 경우, 더이상 확인할 필요 X\r\n if (FishCheck != 0 && FishCheck < check[nr][nc]) {\r\n break loop;\r\n }\r\n \r\n // 처음 먹을 수 있는 자기보다 물고기가 발견 되었을 때\r\n if (0 < sea[nr][nc] && sea[nr][nc] < shark.lv && FishCheck == 0) {\r\n FishCheck = check[nr][nc];\r\n fish.x = nr;\r\n fish.y = nc;\r\n fish.lv = sea[nr][nc];\r\n }\r\n // 같은 위치에 여러 마리 있을 경우, 가장 위의 가장 왼쪽 물고기부터 먹음\r\n else if (FishCheck == check[nr][nc] && 0 < sea[nr][nc] && sea[nr][nc] < shark.lv) {\r\n if (nr < fish.x) { // 가장 위에 있는 거 우선권\r\n fish.x = nr;\r\n fish.y = nc;\r\n fish.lv = sea[nr][nc];\r\n } else if (nr == fish.x && nc < fish.y) { // 다 가장 위일 경우, 가장 왼쪽 우선권\r\n fish.x = nr;\r\n fish.y = nc;\r\n fish.lv = sea[nr][nc];\r\n }\r\n\r\n }\r\n\r\n }else if(isIn(nr, nc) && check[nr][nc] == 0) {\r\n check[nr][nc] = -1;\r\n }\r\n }\r\n }\r\n // idx 초과 안날 경우\r\n if (fish.x != N && fish.y != N) {\r\n eatFish(fish);\r\n }\r\n \r\n return (FishCheck - 1);\r\n }","public String outputBreadthFirstSearch() {\n\n String output = \"\";\n\n // create a queue for BFS \n LinkedList<TrieNode> queue = new LinkedList<>();\n\n queue.add(root);\n\n while (queue.size() != 0) {\n // dequeue a node from queue and append to the output\n TrieNode s = queue.poll();\n\n // append to the output\n output += s;\n\n // get all children nodes of the dequeued node s\n TrieNode[] children = s.offsprings;\n for (int i = 0; i < 26; i++) {\n TrieNode next = children[i];\n if (next != null) {\n queue.add(next);\n }\n\n }\n }\n return output;\n }","public List<String> breadthFirstSearch(List<String> array) {\n // Write your code here.\n Queue<Node> queue = new ArrayDeque<>();\n queue.add(this);\n // breadthFirstSearch(this, queue, array);\n while (queue.size() > 0) {\n Node node = queue.poll();\n array.add(node.name);\n queue.addAll(node.children);\n }\n return array;\n }","private void resolverBFS() {\n\t\tQueue<Integer> cola = new LinkedList<Integer>();\n\t\tint[] vecDistancia = new int[nodos.size()];\n\t\tfor (int i = 0; i < vecDistancia.length; i++) {\n\t\t\tvecDistancia[i] = -1;\n\t\t\trecorrido[i] = 0;\n\t\t}\n\t\tint nodoActual = 0;\n\t\tcola.add(nodoActual);\n\t\tvecDistancia[nodoActual] = 0;\n\t\trecorrido[nodoActual] = -1;\n\t\twhile (!cola.isEmpty()) {\n\t\t\tif (tieneAdyacencia(nodoActual, vecDistancia)) {\n\t\t\t\tfor (int i = 1; i < matrizAdyacencia.length; i++) {\n\t\t\t\t\tif (matrizAdyacencia[nodoActual][i] != 99 && vecDistancia[i] == -1) {\n\t\t\t\t\t\tcola.add(i);\n\t\t\t\t\t\tvecDistancia[i] = vecDistancia[nodoActual] + 1;\n\t\t\t\t\t\trecorrido[i] = nodoActual;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tcola.poll();\n\t\t\t\tif (!cola.isEmpty()) {\n\t\t\t\t\tnodoActual = cola.peek();\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}","void BFS(String start){\n\t\tint iStart = index(start);\n\t\t\n\t\tFronta f = new Fronta(pocetVrcholu*2);\n\t\t\n\t\tvrchP[iStart].barva = 'S';\n\t\tvrchP[iStart].vzdalenost = 0;\n\t\t\n\t\tf.vloz(start);\n\t\t\n\t\twhile(!f.jePrazdna()){\n\t\t\tString u = f.vyber();\n\t\t\tint indexU = index(u);\n\t\t\tint pom = 0;\n\t\t\t\n\t\t\tfor(int i = 1;i<= vrchP[indexU].pocetSousedu;i++){\n\t\t\t\twhile(matice[indexU][pom] == 0){\n\t\t\t\t\tpom++;\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\tint a = pom++;\n\t\t\t\t\n\t\t\t\t\n\t\t\t\tif(vrchP[a].barva =='B'){\n\t\t\t\t\tvrchP[a].barva = 'S';\n\t\t\t\t\tvrchP[a].vzdalenost = vrchP[indexU].vzdalenost + 1;\n\t\t\t\t\tvrchP[a].predchudce = u;\n\t\t\t\t\tf.vloz(vrchP[a].klic);\n\t\t\t\t}\n\t\t\t}\n\t\t\tvrchP[indexU].barva = 'C';\n\t\t\tpole.add(vrchP[indexU].klic);\n\t\t}\n\t\t\n\t\t\n\t}","public void seekWalls() {\n\t\t for (int j=0; j<visited[0].length; j++){\n\t\t\tfor (int i=visited.length-1; i>=0; i--) {\t\t\t\n\t\t\t\tif (i!=0 && j!= visited[0].length-1) {//general position\n\t\t\t\t\tif (map.get(visited[i][j]) + map.get(visited[i-1][j]) == maxComb && !isFree(i,j,2)) {\n\t\t\t\t\t\twallRow = i+1;\n\t\t\t\t\t\twallCol = j+1;\n\t\t\t\t\t\twallSide = 'N';\n\t\t\t\t\t\treturn;//not break!!!!! return to exit !\n\t\t\t\t\t}\n\n\t\t\t\t\tif (map.get(visited[i][j]) + map.get(visited[i][j+1]) == maxComb && !isFree(i,j,4)) {\n\t\t\t\t\t\twallRow = i+1;\n\t\t\t\t\t\twallCol = j+1;\n\t\t\t\t\t\twallSide = 'E';\t\n\t\t\t\t\t\treturn;\t\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\telse if (i==0 && j!= visited[0].length-1) {\n\t\t\t\t\tif (map.get(visited[i][j]) + map.get(visited[i][j+1]) == maxComb && !isFree(i,j,4)) {\n\t\t\t\t\t\twallRow = i+1;\n\t\t\t\t\t\twallCol = j+1;\n\t\t\t\t\t\twallSide = 'E';\t\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\telse if (i!=0 && j== visited[0].length-1) {\n\t\t\t\t\tif (map.get(visited[i][j]) + map.get(visited[i-1][j]) == maxComb && !isFree(i,j,2)) {\n\t\t\t\t\t\twallRow = i+1;\n\t\t\t\t\t\twallCol = j+1;\n\t\t\t\t\t\twallSide = 'N';\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\n\t\t\t\t}\n\t\t\t\telse {//if (i==0 && j== visited[0].length-1) {\n\t\t\t\t\t//no solution\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}","public abstract List<Direction> searchForCheese(Maze maze);","public static void findShortestPath(char[][] maze) {\n\t\tboolean visited[][] = new boolean[maze.length][maze[0].length]; \n\t\tint srcX = 0, srcY = 0;\n\t\t// find the source\n\t\tfor(int i=0; i<maze.length; i++) {\n\t\t\tfor(int j=0; j<maze[0].length; j++) {\n\t\t\t\tif(maze[i][j] == 's') {\n\t\t\t\t\tsrcX = i; srcY=j;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tboolean pe = doGridBFS(maze,visited,srcX,srcY);\n\t\tSystem.out.println(pe);\n\t\t\n\t}","private void BFS() {\n\n int fruitIndex = vertices.size()-1;\n Queue<GraphNode> bfsQueue = new LinkedList<>();\n bfsQueue.add(vertices.get(0));\n while (!bfsQueue.isEmpty()) {\n GraphNode pollNode = bfsQueue.poll();\n pollNode.setSeen(true);\n for (GraphNode node : vertices) {\n if (node.isSeen()) {\n continue;\n } else if (node.getID() == pollNode.getID()) {\n continue;\n } else if (!los.isIntersects(pollNode.getPoint(), node.getPoint())) {\n pollNode.getNeigbours().add(node);\n if (node.getID() != fruitIndex) {\n bfsQueue.add(node);\n node.setSeen(true);\n }\n }\n }\n }\n }","private void bfs(Dungeon d, Site s) {\n\t\t\n\t\t// use a queue to do BFS, and initialize instance variables\n\t\tQueue<Site> q = new LinkedList<Site>();\n\t\tfor (int x = 0; x < d.size(); x++)\n\t\t\tfor (int y = 0; y < d.size(); y++)\n\t\t\t\tdistTo[x][y] = INFINITY; \n\t\tdistTo[s.getX()][s.getY()] = 0;\n\t\tmarked[s.getX()][s.getY()] = true;\n\t\t\n\t\t// pop site from queue until it's empty\n\t\tq.offer(s);\n\t\twhile (!q.isEmpty()) {\n\t\t\t\n\t\t\t// pop the next site in the queue\n\t\t\tSite v = q.poll(); \t \n\t\t\tint x = v.getX();\n\t\t\tint y = v.getY();\n\n\t\t\t// 4 adjacent sites\n\t\t\tSite east = new Site(x + 1, y);\n\t\t\tSite west = new Site(x - 1, y);\n\t\t\tSite north = new Site(x, y - 1);\n\t\t\tSite south = new Site(x, y + 1);\n\n\t\t\t// BFS the rest of the dungeon\n\t\t\tif (d.isLegalMove(v, east) && !marked[east.getX()][east.getY()]) {\n\t\t\t\tedgeTo[east.getX()][east.getY()] = v;\n\t\t\t\tdistTo[east.getX()][east.getY()] = distTo[x][y] + 1;\n\t\t\t\tmarked[east.getX()][east.getY()] = true;\n\t\t\t\tq.offer(east);\n\t\t\t}\n\t\t\tif (d.isLegalMove(v, west) && !marked[west.getX()][west.getY()]) {\n\t\t\t\tedgeTo[west.getX()][west.getY()] = v;\n\t\t\t\tdistTo[west.getX()][west.getY()] = distTo[x][y] + 1;\n\t\t\t\tmarked[west.getX()][west.getY()] = true;\n\t\t\t\tq.offer(west);\n\t\t\t}\n\t\t\tif (d.isLegalMove(v, north) && !marked[north.getX()][north.getY()]) {\n\t\t\t\tedgeTo[north.getX()][north.getY()] = v;\n\t\t\t\tdistTo[north.getX()][north.getY()] = distTo[x][y] + 1;\n\t\t\t\tmarked[north.getX()][north.getY()] = true;\n\t\t\t\tq.offer(north);\n\t\t\t}\n\t\t\tif (d.isLegalMove(v, south) && !marked[south.getX()][south.getY()]) {\n\t\t\t\tedgeTo[south.getX()][south.getY()] = v;\n\t\t\t\tdistTo[south.getX()][south.getY()] = distTo[x][y] + 1;\n\t\t\t\tmarked[south.getX()][south.getY()] = true;\n\t\t\t\tq.offer(south);\n\t\t\t}\n\n\t\t}\n\n\t}","public Stack<Integer> dfs(Maze tmp) {\n \n int tmpx = tmp.positionX();\n int tmpy = tmp.positionY();\n Stack<Integer> s = new Stack<Integer>();\n while (!tmp.gameOver()) {\n choosedirection(s, tmp);\n while (!s.isEmpty() && !tmp.gameOver()) {\n if (s.peek() == 0) {\n if (tmp.right()) {\n s.push(1);\n } else if (tmp.up()) {\n s.push(0);\n } else if (tmp.left()) {\n s.push(3);\n } else {\n this.stackpop(s, tmp);\n }\n } else if (s.peek() == 1) {\n if (tmp.down()) {\n s.push(2);\n } else if (tmp.right()) {\n s.push(1);\n } else if (tmp.up()) {\n s.push(0);\n } else {\n this.stackpop(s, tmp);\n }\n } else if (s.peek() == 2) {\n if (tmp.left()) {\n s.push(3);\n } else if (tmp.down()) {\n s.push(2);\n } else if (tmp.right()) {\n s.push(1);\n } else {\n this.stackpop(s, tmp);\n }\n } else if (s.peek() == 3) {\n if (tmp.up()) {\n s.push(0);\n } else if (tmp.left()) {\n s.push(3);\n } else if (tmp.down()) {\n s.push(2);\n } else {\n this.stackpop(s, tmp);\n }\n\n }\n\n }\n }\n\n Stack<Integer> stack = new Stack<Integer>();\n while (!s.isEmpty()) {\n stack.push(s.pop());\n }\n\n tmp.setLocation(tmpx, tmpy);\n return stack;\n\n }","void BFS(int s, int d) \r\n { \r\n int source = s;\r\n int destination = d;\r\n boolean visited[] = new boolean[V];\r\n int parent[] = new int[V];\r\n \r\n // Create a queue for BFS \r\n LinkedList<Integer> queue = new LinkedList<Integer>(); \r\n \r\n // Mark the current node as visited and enqueue it \r\n \r\n visited[s]=true; \r\n queue.add(s); \r\n System.out.println(\"Search Nodes: \");\r\n while (queue.size() != 0) \r\n { \r\n int index = 0;\r\n \r\n // Dequeue a vertex from queue and print it \r\n \r\n s = queue.poll();\r\n \r\n System.out.print(convert2(s)); \r\n \r\n if(s == destination)\r\n {\r\n break;\r\n }\r\n \r\n System.out.print(\" -> \");\r\n while(index < adj[s].size()) \r\n { \r\n \r\n \r\n int n = adj[s].get(index); \r\n if (!visited[n]) \r\n { \r\n visited[n] = true;\r\n parent[n] = s;\r\n queue.add(n); \r\n }\r\n index = index+ 2;\r\n \r\n \r\n }\r\n \r\n \r\n \r\n }\r\n int check = destination;\r\n int cost = 0, first, second = 0;\r\n String string = \"\" + convert2(check);\r\n while(check!=source)\r\n {\r\n \r\n first = parent[check];\r\n string = convert2(first) + \" -> \" + string;\r\n while(adj[first].get(second) != check)\r\n {\r\n second++;\r\n }\r\n cost = cost + adj[first].get(second +1);\r\n check = first;\r\n second = 0;\r\n \r\n }\r\n \r\n System.out.println(\"\\n\\nPathway: \");\r\n \r\n System.out.println(string);\r\n \r\n \r\n System.out.println(\"\\nTotal cost: \" + cost);\r\n }","static int BFS(int mat[][], Point src,\n\t\t\t\t\t\t\tPoint dest)\n{\n\t// check source and destination cell\n\t// of the matrix have value 1\n\tif (mat[src.x][src.y] != 1 ||\n\t\tmat[dest.x][dest.y] != 1)\n\t\treturn -1;\n\n\tboolean [][]visited = new boolean[ROW][COL];\n\t\n\t// Mark the source cell as visited\n\tvisited[src.x][src.y] = true;\n\n\t// Create a queue for BFS\n\tQueue<queueNode> q = new LinkedList<>();\n\t\n\t// Distance of source cell is 0\n\tqueueNode s = new queueNode(src, 0);\n\tq.add(s); // Enqueue source cell\n\n\t// Do a BFS starting from source cell\n\twhile (!q.isEmpty())\n\t{\n\t\tqueueNode curr = q.peek();\n\t\tPoint pt = curr.pt;\n\n\t\t// If we have reached the destination cell,\n\t\t// we are done\n\t\tif (pt.x == dest.x && pt.y == dest.y)\n\t\t\treturn curr.dist;\n\n\t\t// Otherwise dequeue the front cell\n\t\t// in the queue and enqueue\n\t\t// its adjacent cells\n\t\tq.remove();\n\n\t\tfor (int i = 0; i < 4; i++)\n\t\t{\n\t\t\tint row = pt.x + rowNum[i];\n\t\t\tint col = pt.y + colNum[i];\n\t\t\t\n\t\t\t// if adjacent cell is valid, has path\n\t\t\t// and not visited yet, enqueue it.\n\t\t\tif (isValid(row, col) &&\n\t\t\t\t\tmat[row][col] == 1 &&\n\t\t\t\t\t!visited[row][col])\n\t\t\t{\n\t\t\t\t// mark cell as visited and enqueue it\n\t\t\t\tvisited[row][col] = true;\n\t\t\t\tqueueNode Adjcell = new queueNode\n\t\t\t\t\t\t\t(new Point(row, col),\n\t\t\t\t\t\t\t\tcurr.dist + 1 );\n\t\t\t\tq.add(Adjcell);\n\t\t\t}\n\t\t}\n\t}\n\n\t// Return -1 if destination cannot be reached\n\treturn -1;\n}","public static void main(String[] args) {\n\t\tScanner scan = new Scanner(System.in);\n\t\tQueue<maze> q = new LinkedList<>();\n\t\tint N = scan.nextInt();\n\t\tint M = scan.nextInt();\n\t\tint output = 0;\n\t\tscan.nextLine();\n\t\tint arr[][] = new int[N][M];\n\t\tint isVisit[][] = new int[N][M];\n\t\tisVisit[0][0] = 1;\n\t\tfor(int i=0;i<N;i++)\n\t\t{\n\t\t\tString line = scan.nextLine();\n\t\t\tfor(int j=0;j<M;j++)\n\t\t\t{\n\t\t\t\tarr[i][j] = line.charAt(j) - '0';\n\t\t\t}\n\t\t}\n\t\tq.add(new maze(0, 0, 1));\n\t\twhile(!q.isEmpty())\n\t\t{\n\t\t\tmaze temp = q.poll();\n\t\t\tif(temp.x == M-1 && temp.y == N-1)\n\t\t\t{\n\t\t\t\toutput = temp.block;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tfor(int i=0;i<4;i++)\n\t\t\t{\n\t\t\t\tint x = temp.x + dx[i];\n\t\t\t\tint y = temp.y + dy[i];\n\t\t\t\t\n\t\t\t\tif(0 <= x && x < M && 0 <= y && y < N && arr[y][x] == 1 && isVisit[y][x] == 0)\n\t\t\t\t{\n\t\t\t\t\tq.add(new maze(x, y, (temp.block + 1)));\n\t\t\t\t\tisVisit[y][x] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(output);\n\t}","public void generate_maze()\n\t{\n\t\tint i, j, r, c;\n\n\t\t// choose a cell at random and make it the current cell\n\t\tRandom rand = new Random(666);\n\t\tr = (int)(rand.nextFloat() * (ROWS - 1));\n\t\tc = (int)(rand.nextFloat() * (COLS - 1));\n\t\tint[] curr = {r,c}; // current search location\n\t\tint visited = 1;\n\t\tint total = ROWS*COLS;\n\t\tint tos = 0; // index for top of cell stack \n\n\t\t// arrays of single step movements between cells\n\t\t// north east south west\n\t\tint[][] move = {{-1, 0}, {0, 1}, {1, 0}, {0,-1}};\n\t\tint[][] next = {{0, 0}, {0, 0}, {0, 0}, {0, 0}};\n\n\t\twhile (visited < total)\n\t\t{\n\t\t\t// find all neighbors of current cell with all walls intact\n\t\t\tj = 0;\n\t\t\tfor (i = 0; i < 4; i++)\n\t\t\t{\n\t\t\t\tr = curr[0] + move[i][0];\n\t\t\t\tc = curr[1] + move[i][1];\n\n\t\t\t\t// check for valid next cell\n\t\t\t\tif ((0 <= r) && (r < ROWS) && (0 <= c) && (c < COLS))\n\t\t\t\t{\n\t\t\t\t\t// check if previously visited\n\t\t\t\t\tif ((Maze[r][c] == 15))//N) && (Maze[r][c] == E) && (Maze[r][c] == S) && (Maze[r][c] == W))\n\t\t\t\t\t{\n\t\t\t\t\t\t// not visited, so add to possible next cells\n\t\t\t\t\t\tnext[j][0] = r;\n\t\t\t\t\t\tnext[j][1] = c;\n\t\t\t\t\t\tj++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (j > 0)\n\t\t\t{\n\t\t\t\t// current cell has one or more unvisited neighbors, so choose one at random \n\t\t\t\t// and knock down the wall between it and the current cell\n\t\t\t\ti = (int)(rand.nextFloat() * (j-1));\n\n\t\t\t\tif ((next[i][0] - curr[0]) == 0) // next on same row\n\t\t\t\t{\n\t\t\t\t\tr = next[i][0];\n\t\t\t\t\tif (next[i][1] > curr[1]) // move east\n\t\t\t\t\t{\n\t\t\t\t\t\tc = curr[1];\n\t\t\t\t\t\tMaze[r][c] &= ~E; // clear E wall\n\t\t\t\t\t\tc = next[i][1];\n\t\t\t\t\t\tMaze[r][c] &= ~W; // clear W wall\n\t\t\t\t\t}\n\t\t\t\t\telse // move west\n\t\t\t\t\t{\n\t\t\t\t\t\tc = curr[1];\n\t\t\t\t\t\tMaze[r][c] &= ~W; // clear W wall\n\t\t\t\t\t\tc = next[i][1];\n\t\t\t\t\t\tMaze[r][c] &= ~E; // clear E wall\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse // next on same column\n\t\t\t\t{\n\t\t\t\t\tc = next[i][1];\n\t\t\t\t\t if (next[i][0] > curr[0]) // move south \n\t\t\t\t\t {\n\t\t\t\t\t \tr = curr[0];\n\t\t\t\t\t \tMaze[r][c] &= ~S; // clear S wall\n\t\t\t\t\t \tr = next[i][0];\n\t\t\t\t\t \tMaze[r][c] &= ~N; // clear N wall\n\t\t\t\t\t }\n\t\t\t\t\t else // move north\n\t\t\t\t\t {\n\t\t\t\t\t \tr = curr[0];\n\t\t\t\t\t \tMaze[r][c] &= ~N; // clear N wall\n\t\t\t\t\t \tr = next[i][0];\n\t\t\t\t\t \tMaze[r][c] &= ~S; // clear S wall\n\t\t\t\t\t }\n\t\t\t\t}\n\n\t\t\t\ttos++; // push current cell location\n\t\t\t\tstack.elementAt(tos)[0] = curr[0];\n\t\t\t\tstack.elementAt(tos)[1] = curr[1];\n\n\t\t\t\tcurr[0] = next[i][0]; // make next cell the current cell\n\t\t\t\tcurr[1] = next[i][1];\n\n\t\t\t\tvisited++; // increment count of visited cells\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\t// reached dead end, backtrack\n\t\t\t\t// pop the most recent cell from the cell stack \n\t\t\t\t// and make it the current cell\n\t\t\t\tcurr[0] = stack.elementAt(tos)[0];\n\t\t\t\tcurr[1] = stack.elementAt(tos)[1];\n\t\t\t\ttos--;\n\t\t\t}\n\t\t}\n\t}","public static void userSelection_SolveMaze(int userInputN){\n\n\t\tint[] S = new int[(int) Math.pow(userInputN, 2)];\n\t\tgNode[] G = new gNode[S.length];\n\n\t\tboolean [] visited = new boolean[S.length];\t\t//Initialize\n\t\tfor(int i=0; i<visited.length;i++)\n\t\t\tvisited[i] = false;\n\n\t\tint [] path = new int[S.length];\t\t//Initialize \n\t\tfor(int i=0; i<path.length; i++)\n\t\t\tpath[i]=-1;\n\n\t\tScanner input = new Scanner(System.in);\n\t\tSystem.out.println(\"How would you like to solve the maze?\\n\"\n\t\t\t\t+ \"1.\\tBreadth-First Search\\n\"\n\t\t\t\t+ \"2.\\tDepth-First Search\\n\"\n\t\t\t\t+ \"3.\\tDepth-First Search with Recursion\");\n\t\t\n\t\tint ur = input.nextInt();\n\t\t\n\t\tif(ur==1)\t//Breadth-First Search\t\t\\///gNode && start @ position 0\n\t\t\tbfs(G, visited, path, 0);\n\t\telse if(ur==2)\t//Depth-First Search\n\t\t\tdfs_Stack(G, visited, path, 0);\n\t\telse if(ur==3)\t//Depth-First Search w/recursion\t\n\t\t\tdfsRecursion(G, visited, path, 0);\t\n\t\telse{\n\t\t\tSystem.out.println(\"Invalid option. Please enter the appropriate integer value\");\n\t\t\tuserSelection_SolveMaze(userInputN);\n\t\t}\n\t\t\n\t\tinput.close();\n\t}","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 Maze3D generate(int depth, int row, int column) throws Exception {\n if (row < 2 || column < 2 || depth < 2)\n throw new Exception(\"Invalid inputs Maze most be at least 2x2x2\");\n Maze3D myMaze = new Maze3D(depth,row, column); //create an empty maze\n for (int r = 0; r <row ; r++) { //init to 1 all the cells\n for (int c = 0; c <column ; c++) {\n for (int d = 0; d < depth; d++) {\n myMaze.maze[d][r][c]= 1;\n\n }\n }\n }\n boolean [][][] VisitedCells = new boolean[depth][row][column]; //create an boolean matrix that saved cell as visited or not\n int randomDepth = Ran.nextInt((depth)); //select random depth number\n int randomRow = Ran.nextInt((row)); //select random row number\n Position3D StartPos = new Position3D(randomDepth,randomRow, 0);\n myMaze.maze[randomDepth][randomRow][0]= 0; //change selected start position to 0\n myMaze.setStartPosition(StartPos); //set the start position of the maze\n changeStatus(randomDepth,randomRow,0,VisitedCells); //change Start position as visited\n //choose random goal position cell in the maze\n int randomDepth_2 = Ran.nextInt((depth)); //select random depth number\n int randomRow_2 = Ran.nextInt((row)); //select random row number\n Position3D EndPos = new Position3D(randomDepth_2,randomRow_2, (column-1));\n myMaze.maze[randomDepth_2][randomRow_2][(column-1)]= 0; //change selected goal position to 0\n myMaze.setGoalPosition(EndPos); //set the start position of the maze\n changeStatus(randomDepth_2,randomRow_2,(column-1),VisitedCells);//mark as visited\n stack.push(StartPos);\n while (!stack.empty()) {\n Position3D curr = stack.pop();\n //check if the current cell have any neighbors which have not been visited, and find them all\n ArrayList<Position3D> neighbors = findNeighbors(curr, myMaze, VisitedCells); //find all options of moving forward\n if (neighbors.size() > 0) { //iterate over all neighbors\n stack.push(curr); //push curr into the stack\n myMaze.maze[curr.getDepthIndex()][curr.getRowIndex()][curr.getColumnIndex()] = 0; //change it's place to 1\n Position3D Neighbor = ChooseNeighbor(neighbors); //choose one unvisited random neighbor\n changeStatus(Neighbor.getDepthIndex(),Neighbor.getRowIndex(),Neighbor.getColumnIndex(), VisitedCells); //mark him as visited neighbor\n removeWall(curr, Neighbor, VisitedCells, myMaze); //remove the wall & mark as visited\n stack.push(Neighbor);\n }\n }\n //handle odd maze problems - open the walls which surround the goal cell\n for (int d = EndPos.getDepthIndex()-1; d < EndPos.getDepthIndex()+2; d++) {\n for (int r = EndPos.getRowIndex()-1; r < EndPos.getRowIndex()+2; r++) {\n for (int c = EndPos.getColumnIndex()-1; c < EndPos.getColumnIndex()+1; c++) {\n if (pointOnGrid(d,r,c,myMaze)){\n myMaze.maze[d][r][c]= 0; //change selected cell to 0\n changeStatus(d,r,c,VisitedCells);\n }\n }}\n }\n return myMaze;\n }","public void saveMaze(File file) throws IOException {\n PrintWriter outputFile = new PrintWriter(file);\n\n Cell[][] grid = maze.getGrid();\n\n outputFile.write(\"BFS\\n\");\n\n // Saves the original (not shortest) BFS path.\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 outputFile.write(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 outputFile.write(currentCell.topRow());\n }\n }\n outputFile.write(\"+\");\n outputFile.write(\"\\n\");\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 outputFile.write(currentCell.zeroDistanceColumn());\n else\n outputFile.write(currentCell.distanceColumn());\n }\n outputFile.write(\"|\");\n outputFile.write(\"\\n\");\n }\n }\n\n // Saves the shortest BFS path.\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 outputFile.write(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 outputFile.write(currentCell.topRow());\n }\n }\n outputFile.write(\"+\");\n outputFile.write(\"\\n\");\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 outputFile.write(currentCell.zeroDistanceColumn2());\n else if (parents.contains(currentCell))\n outputFile.write(currentCell.zeroDistanceColumn2());\n else\n outputFile.write(currentCell.distanceColumn2());\n }\n outputFile.write(\"|\");\n outputFile.write(\"\\n\");\n }\n }\n // Saves the shortest path, length, and visited cells.\n outputFile.write(\"Path:\");\n for (Cell currentCell : parents) {\n outputFile.write(\"(\" + currentCell.x + \",\" + currentCell.y + \") \");\n }\n outputFile.write(\"\\n\");\n outputFile.write(\"Visited Cells: \" + visitedCells + \"\\n\");\n outputFile.write(\"Length of Path: \" + parents.size() + \"\\n\");\n outputFile.close();\n\n }","public void next() {\n Solver<ArrayList<Integer>> mySolver =\n new Solver<ArrayList<Integer>>();\n ArrayList<ArrayList<Integer>> Solution =\n mySolver.SolveBFS(this);\n\n //Reset 'tried' to none\n tried = new HashSet<ArrayList<Integer>>();\n\n //Set up the nextState\n ArrayList<Integer> nextState = new ArrayList<Integer>();\n\n if(Solution.size() == 0) {\n //No Solution\n } else if (Solution.size() == 1) {\n nextState = Solution.get(0);\n curBoard = nextState;\n } else {\n nextState = Solution.get(1);\n curBoard = nextState;\n moveCount++;\n }\n clearStack();\n\n\tsetChanged();\n\tnotifyObservers();\n }","private void solve(int x, int y, boolean draw) {\n \t\t// these are the walls of the maze, maze solver should not go beyond\n \t\t// walls\n \t\t// if (x == 0 || y == 0 || x == N + 1 || y == N + 1) {\n \t\t// return;\n \t\t// }\n \n \t\t// if we have already visited this position\n \t\t// or if deep levels of the recursion have found the target\n \t\tif (foundTarget || visited[x][y])\n \t\t\treturn;\n \n \t\t// this position is new, mark it as visited\n \t\tvisited[x][y] = true;\n \n \t\tif (draw) {\n \t\t\t// Draw a blue dot to show we have been here\n \t\t\tStdDraw.setPenColor(StdDraw.BLUE);\n \t\t\tStdDraw.filledCircle(x + 0.5, y + 0.5, 0.25);\n \t\t\tStdDraw.show(SOLVER_SPEED);\n \t\t}\n \n \t\t// if we have reached the maze solve target\n \t\tif (x == target.x && y == target.y) {\n \t\t\tfoundTarget = true;\n \t\t}\n \n \t\t// Try go another place\n \t\tif (!north[x][y])\n \t\t\tsolve(x, y + 1, draw);\n \t\tif (!east[x][y])\n \t\t\tsolve(x + 1, y, draw);\n \t\tif (!south[x][y])\n \t\t\tsolve(x, y - 1, draw);\n \t\tif (!west[x][y])\n \t\t\tsolve(x - 1, y, draw);\n \n \t\tif (foundTarget)\n \t\t\treturn;\n \n \t\tif (draw) {\n \t\t\t// Draw a grey dot to show we have backtracked\n \t\t\tStdDraw.setPenColor(StdDraw.GRAY);\n \t\t\tStdDraw.filledCircle(x + 0.5, y + 0.5, 0.25);\n \t\t\tStdDraw.show(SOLVER_SPEED);\n \t\t}\n \t}","public void breadthFirstSearch(int vertexIndex) {\n Queue<Integer> queue = new LinkedList<Integer>();\n vertexList[vertexIndex].wasVisited = true;\n displayVertex(vertexIndex);\n int unvisitedIndex;\n do {\n\n do {\n unvisitedIndex = getAdjacentUnvisitedVertexIndex(vertexIndex);\n if(unvisitedIndex != -1) {\n vertexList[unvisitedIndex].wasVisited = true;\n displayVertex(unvisitedIndex);\n queue.add(unvisitedIndex);\n\n }\n } while(unvisitedIndex != -1);\n if(!queue.isEmpty()) {\n vertexIndex = queue.remove();\n\n }\n\n } while(!queue.isEmpty());\n\n for (int i = 0; i < vertexCount; i++) {\n vertexList[i].wasVisited = false;\n\n }\n }","int main()\n{\n // Create a graph given in the above diagram\n Graph g(4);\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 cout << \"Following is Breadth First Traversal \"\n << \"(starting from vertex 2) n\";\n g.BFS(2);\n \n return 0;\n}","public static void main(String[] args) {\n\t\tint[][] m= { {197,130,139,188},{20,24,167,182},{108,78,169,193},{184,65,83,41} };\r\n\t\tint[][] m2= {{149,77,42,136},\r\n\t\t\t\t{145,155,45,0},\r\n\t\t\t\t{136,102,182,87},\r\n\t\t\t\t{178,183,143,60}};\r\n\t\tfor (int[] is : m2) {\r\n\t\t\tfor (int is2 : is) {\r\n\t\t\t\tSystem.out.print(is2+\",\");\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t\tSystem.out.println(\"\\n\");\r\n\t\t}\r\n\t\tSearchable matrix=new Matrix(m2,new MatrixState(\"0,0\"),new MatrixState(\"3,3\"));\r\n\t\tSearcher<String> sol=new BFS<>();\r\n\t\tSystem.out.println(sol.search(matrix));\r\n\t}","public static void BFS(char[][] board, int y, int x){\n \tint[] offsetX = {-1,0,1,0};\n \tint[] offsetY = {0, -1, 0, 1};\n \tQueue<pair> que = new LinkedList<pair>();\n \tque.add(new pair(x,y));\n \twhile(!que.isEmpty()){\n \t\tpair p = que.poll();\n \t \tif (board[p.y][p.x] == 'D'){\n\t continue;\n \t \t}\n \t\t//System.out.println(p.x);\n \t\t//System.out.println(p.y);\n \t \tboard[p.y][p.x] = 'D';\t \t\n \t \tfor(int i = 0; i < offsetX.length; i++){\n \t \t\tif(p.x + offsetX[i] >= 0 &&p.x+offsetX[i] < board[0].length&& p.y + offsetY[i] >= 0 &&p.y+offsetY[i] < board.length\n \t \t\t\t\t&& board[p.y+offsetY[i]][p.x+offsetX[i]] == 'O'){\n \t \t\t\tque.add(new pair(p.x+offsetX[i], p.y+offsetY[i]));\n \t \t\t}\n \t \t}\n \t}\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/* */ }","private static void BFS(int[][] adjacencyMatrix) {\n\t\tint n = adjacencyMatrix.length;\n\t\tboolean visited[] = new boolean[n];\n\t\tfor(int i=0;i<n;i++) {\n\t\t\tif(!visited[i]) {\n\t\t\tprintBFS(adjacencyMatrix,i,visited);\n\t\t\t}\n\t\t}\n\t\t\t\n\t\t\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 BFS() {\r\n\t\tQueue queue = new Queue();\r\n\t\tqueue.enqueue(this.currentVertex);\r\n\t\tcurrentVertex.printVertex();\r\n\t\tcurrentVertex.visited = true;\r\n\t\twhile (!queue.isEmpty()) {\r\n\t\t\tVertex vertex = (Vertex) queue.dequeue();\r\n\t\t\tVertex child = null;\r\n\t\t\twhile ((child = getUnvisitedChildVertex(vertex)) != null) {\r\n\t\t\t\tchild.visited = true;\r\n\t\t\t\tchild.printVertex();\r\n\t\t\t\tqueue.enqueue(child);\r\n\t\t\t}\r\n\t\t}\r\n\t\tclearVertexNodes();\r\n\t\tprintLine();\r\n\t}","public void solveMaze( int x0, int y0, int x1, int y1 ) {\n visited = new boolean[rows+1][cols+1];\n solve(x0, y0, x1, y1);\n }","void Graph::BFS(int s)\n{\n bool *visited = new bool[V];\n for(int i = 0; i < V; i++)\n visited[i] = false;\n \n // Create a queue for BFS\n list<int> queue;\n \n // Mark the current node as visited and enqueue it\n visited[s] = true;\n queue.push_back(s);\n \n // 'i' will be used to get all adjacent vertices of a vertex\n list<int>::iterator i;\n \n while(!queue.empty())\n {\n // Dequeue a vertex from queue and print it\n s = queue.front();\n cout << s << \" \";\n queue.pop_front();\n \n // Get all adjacent vertices of the dequeued vertex s\n // If a adjacent has not been visited, then mark it visited\n // and enqueue it\n for(i = adj[s].begin(); i != adj[s].end(); ++i)\n {\n if(!visited[*i])\n {\n visited[*i] = true;\n queue.push_back(*i);\n }\n }\n }","public boolean breadthFirstSearch(int vertexA, int vertexB, HashMap<Integer, ArrayList<Integer>> adjMapList) {\n\t\tQueue<Integer> queue = new LinkedList<Integer>();\n\t\tHashSet<Integer> visited = new HashSet<Integer>();\n\t\tqueue.add(vertexA);\n\t\tvisited.add(vertexA);\n\t\twhile (!queue.isEmpty()) {\n\t\t\tInteger curr = queue.remove();\n\t\t\tif (curr == vertexB) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tArrayList<Integer> neighbors = adjMapList.get(curr);\n\t\t\tfor (Integer vertex : neighbors) {\n\t\t\t\tif (!visited.contains(vertex)) {\n\t\t\t\t\tvisited.add(vertex);\n\t\t\t\t\tqueue.add(vertex);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}","public void createMaze(int rows, int cols) {\n\t\t\n\t\tint total = rows*cols;\n\t\tDisjSets ds = new DisjSets(total); //Create an object of the disjoint set class\n\t\t \n\t\tList<List<Node>> maze = new ArrayList<List<Node>>();\n\t\t \n\t\tmaze = initializeMaze(rows, cols, maze); //Initialize the maze\n\t\t \n\t\tRandom rand = new Random();\n\t\t \n\t\twhile(ds.find(0) != ds.find(total - 1)) {\n\t\t\t \n\t\t\tint currRow = rand.nextInt(rows); //Random row number\n\t\t\tint currCol = rand.nextInt(cols); //Random column number\n\t\t\tNode currNode = maze.get(currRow).get(currCol); //Current node(cell)\n\t\t\tint currValue = currNode.value;\n\t\t\t \n\t\t\tint root1 = ds.find(currValue); //Find on current node(cell)\n\t\t\tint root2;\n\t\t\tboolean removeHorizontal = false;\n\t\t\t \n\t\t\tif(currValue == total - 1) {\n\t\t\t\tcontinue; //Don't do anything if the current cell is the bottom-rightmost cell\n\t\t\t}\n\t\t\t \n\t\t\tif(currRow == rows - 1) {\n\t\t\t\t//Last row -- can only break the right wall, can't break the wall to the bottom \n\t\t\t\troot2 = ds.find(currValue + 1);\n\t\t\t} else if(currCol == cols - 1) {\n\t\t\t\t//Last column -- can only break the wall to the bottom, can't break the right wall \n\t\t\t\troot2 = ds.find(currValue + cols);\n\t\t\t\tremoveHorizontal = true;\n\t\t\t} else {\n\t\t\t\t//Neither last row nor last column\n\t\t\t\t//Randomly select either right wall or wall to the bottom to break\n\t\t\t\tboolean selectRight;\n\t\t\t\tselectRight = rand.nextBoolean();\n\t\t\t\t \n\t\t\t\tif(selectRight) {\n\t\t\t\t\troot2 = ds.find(currValue + 1);\n\t\t\t\t} else {\n\t\t\t\t\troot2 = ds.find(currValue + cols);\n\t\t\t\t\tremoveHorizontal = true;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\t//Finds resulted in different sets\n\t\t\tif(root1 != root2) {\n\t\t\t\t \n\t\t\t\tds.union(root1, root2); //Take union of the two sets\n\t\t\t\t \n\t\t\t\tif(removeHorizontal) {\n\t\t\t\t\tcurrNode.horizontal = false; //Break the horizontal wall\n\t\t\t\t} else {\n\t\t\t\t\tcurrNode.vertical = false; //Break the vertical wall\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\t//Leave the bottom right corner open\n\t\tNode destination = maze.get(rows - 1).get(cols - 1);\n\t\tdestination.horizontal = false;\n\t\tdestination.vertical = false;\n\t\t \n\t\tprintMaze(rows, cols, maze); //Print the final maze\n\t}","public void breadthFirst(Vertex[] vertices ){\n\t\t\n\t\tVertex temp = vertices[0];\n\t\ttemp.state=1; //for tracking the visited nodes, visited/discovered A\n\t\tboolean[] seen = new boolean[vertices.length];\n\t\tQueue<Vertex> q = new LinkedList<Vertex>(); //queue for breadth first traversal\n\t\t\n\t\tq.add(temp); //root node added to queue\n\t\tseen[0] = true;\n\t\tSystem.out.println(\"Begin breadth first traversal: \\n\" + \n\t\t\t\tq.toString());\n\t\t\t\t\n\t\tfor (int i = 0; i < vertices.length; i++){\n\t\t\ttemp = vertices[i];\n\t\t\twhile (!q.isEmpty() ) {\n\t Vertex v = q.remove();\n\t for (int j : v.neighbors) {\n\t if (!seen[j]) {\n\t q.add(vertices[j]);\n\t seen[j] = true;\n\t vertices[j].state=1;\n\t }\n\t }\n\t System.out.println(q.toString());\n \t}\n\t\t}\n\t}","public static boolean Traversal_DFS(int row, int col, int[][] maze)\r\n {\n if (isASolution(row, col))\r\n {\r\n maze[row][col] = 3;\r\n return true;\r\n }\r\n\r\n // otherwise, mark the cell as visited and process its children.\r\n maze[row][col] = 2;\r\n if (canMove(row,col-1, maze) && Traversal_DFS(row,col-1, maze))\r\n {\r\n \t// mark this as success.\r\n maze[row][col-1] = 3;\r\n return true;\r\n }\r\n if (canMove(row,col+1, maze))\r\n {\r\n // move right\r\n if (Traversal_DFS(row,col+1, maze))\r\n {\r\n \tmaze[row][col+1] = 3;\r\n return true;\r\n }\r\n }\r\n if (canMove(row-1,col, maze))\r\n {\r\n // move up\r\n if (Traversal_DFS(row-1,col, maze))\r\n {\r\n \tmaze[row-1][col] = 3;\r\n return true;\r\n }\r\n }\r\n if (canMove(row+1,col, maze))\r\n {\r\n // move down\r\n if (Traversal_DFS(row+1,col, maze))\r\n {\r\n \tmaze[row+1][col] = 3;\r\n return true;\r\n }\r\n }\r\n // Failure, unmark the cell and return false\r\n maze[row][col] = 0;\r\n return false;\r\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 }","void BFS(int s)\n {\n /* List of visited vertices; all false in the beginning) */\n boolean visited[] = new boolean[V];\n\n /* Queue data structure is used for BFS */\n LinkedList<Integer> queue = new LinkedList<>();\n\n /* Mark starting node s as visited and enqueue it */\n visited[s]=true;\n queue.add(s);\n\n /* Until queue is empty, dequeue a single node in queue and look for it's neighboring vertices.\n * If an adjecent node hasn't been visited yet, set it as visited and enqueue this node. s*/\n while (queue.size() != 0)\n {\n /* Dequeue */\n s = queue.poll();\n System.out.print( s + \" \");\n\n /* Get all adjacent vertices */\n Iterator<Integer> i = adj[s].listIterator();\n while (i.hasNext())\n {\n int n = i.next();\n if (!visited[n])\n {\n visited[n] = true;\n queue.add(n);\n }\n }\n }\n }","protected boolean solve(int currentRow, int currentColumn) {\n \tint currentBlock = m.maze[currentRow][currentColumn];\t\t\t\t\t\t\t// get the current block that we are on\r\n \t\r\n if (m.isBlockEmpty(currentBlock)) {\t\t\t\t\t\t\t\t\t\t\t\t// make sure current block is empty\r\n \tm.maze[currentRow][currentColumn] = 2; \t\t\t\t\t\t\t\t// add this block to the path as a potential solution\r\n repaint();\r\n \r\n m.blocksTraversed++;\t\t\t\t\t\t\t\t\t\t\t\t\t\t// keep track of how many blocks were traversed over\r\n \r\n if (currentRow == m.rows-2 && currentColumn == m.columns-2) {\t\t\t\t// current block is bottom right, path has been found\r\n \tGUI.ta.append(m.blocksTraversed + \" blocks were traversed while solving the maze.\\n\");\r\n \tdouble percentage = (((double) m.blocksTraversed / (m.rows * m.columns))*100) * 2;\r\n DecimalFormat f = new DecimalFormat(\"##.00\");\r\n \tGUI.ta.append(\"This results in \" + f.format(percentage) + \"% of the maze being traveled.\\n\");\r\n \treturn true;\r\n }\r\n \r\n try { Thread.sleep(1); }\r\n catch (InterruptedException e) { }\r\n \r\n int topBlock = currentRow - 1;\t\t\t\t\t\t\t\t\t\t\t\t// block directly above the current block\r\n int leftBlock = currentColumn - 1;\t\t\t\t\t\t\t\t\t\t\t// block directly left of the current block\r\n int bottomBlock = currentRow + 1;\t\t\t\t\t\t\t\t\t\t\t// block directly below the current block\r\n int rightBlock = currentColumn + 1;\t\t\t\t\t\t\t\t\t\t\t// block directly right of the current block\r\n \r\n if (solve(topBlock, currentColumn) || solve(currentRow, leftBlock) ||\t\t// a solution was found\r\n \tsolve(bottomBlock, currentColumn) || solve(currentRow, rightBlock))\r\n \treturn true;\r\n \r\n m.maze[currentRow][currentColumn] = 4; \t\t\t\t\t\t\t\t\t// no solution from current block so make the block visited instead\r\n repaint();\r\n \r\n synchronized(this) {\r\n try { wait(1); }\r\n catch (InterruptedException e) { }\r\n }\r\n }\r\n return false;\r\n }","private boolean thereispath(Move m, Tile tile, Integer integer, Graph g, Board B) {\n\n boolean result = true;\n boolean result1 = true;\n\n int start_dest_C = tile.COLUMN;\n int start_dest_R = tile.ROW;\n\n int move_column = m.getX();\n int move_row = m.getY();\n\n int TEMP = 0;\n int TEMP_ID = 0;\n int TEMP_ID_F = tile.id;\n int TEMP_ID_FIRST = tile.id;\n\n int final_dest_R = (integer / B.width);\n int final_dest_C = (integer % B.width);\n\n //System.out.println(\"* \" + tile.toString() + \" \" + integer + \" \" + m.toString());\n\n // Y ROW - X COLUMN\n\n for (int i = 0; i != 2; i++) {\n\n TEMP_ID_FIRST = tile.id;\n\n // possibility 1\n if (i == 0) {\n\n\n // first move columns\n for (int c = 0; c != Math.abs(move_column) && result != false; c++) {\n\n if (c == 0) {\n TEMP_ID_FIRST = tile.id;\n\n } else {\n TEMP_ID_FIRST = B.a.get(start_dest_R).get(start_dest_C).id;\n\n }\n\n TEMP = move_column / Math.abs(move_column);\n\n //System.out.println(\"1C:\" + TEMP);\n\n //System.out.println(\" \" + TEMP_ID_FIRST + \" - > \" + (start_dest_C + TEMP));\n\n start_dest_C += TEMP;\n\n TEMP_ID = B.a.get(start_dest_R).get(start_dest_C).id;\n\n //System.out.println(TEMP_ID_FIRST + \" = \" + TEMP_ID);\n\n if (g.adj.get(TEMP_ID_FIRST).contains(TEMP_ID)) {\n\n // System.out.println(\"OK\");\n\n } else {\n\n result = false;\n\n // System.out.println(\"NOPE\");\n\n\n }\n }\n\n for (int r = 0; r != Math.abs(move_row) && result != false; r++) {\n\n TEMP_ID_FIRST = B.a.get(start_dest_R).get(start_dest_C).id;\n\n TEMP = move_row / Math.abs(move_row);\n\n //System.out.println(\"1R:\" + TEMP);\n\n //System.out.println(start_dest_R + \" - > \" + (start_dest_R + TEMP));\n\n start_dest_R += TEMP;\n\n TEMP_ID = B.a.get(start_dest_R).get(start_dest_C).id;\n\n // System.out.println(TEMP_ID_FIRST + \" and \" + TEMP_ID);\n\n if (g.adj.get(TEMP_ID_FIRST).contains(TEMP_ID)) {\n\n //System.out.println(\"OK\");\n\n\n } else {\n\n result = false;\n\n //System.out.println(\"NOPE\");\n\n\n }\n }\n\n if (result == true) {\n return true;\n }\n\n\n }\n\n TEMP_ID = 0;\n\n if (i == 1) {\n\n result = true;\n\n start_dest_C = tile.COLUMN;\n start_dest_R = tile.ROW;\n // first move row\n for (int r = 0; r != Math.abs(move_row) && result1 != false; r++) {\n\n if (r == 0) {\n TEMP_ID_FIRST = tile.id;\n\n } else {\n TEMP_ID_FIRST = B.a.get(start_dest_R).get(start_dest_C).id;\n\n }\n\n TEMP_ID_FIRST = B.a.get(start_dest_R).get(start_dest_C).id;\n\n TEMP = move_row / Math.abs(move_row);\n\n //System.out.println(\"1R:\" + TEMP);\n\n //System.out.println(start_dest_R + \" - > \" + (start_dest_R + TEMP));\n\n start_dest_R += TEMP;\n\n TEMP_ID = B.a.get(start_dest_R).get(start_dest_C).id;\n\n\n //System.out.println(TEMP_ID_FIRST + \" = \" + TEMP_ID);\n\n if (g.adj.get(TEMP_ID_FIRST).contains(TEMP_ID)) {\n\n //System.out.println(\"OK\");\n\n } else {\n\n //System.out.println(\"NOPE\");\n\n result = false;\n\n }\n\n\n }\n\n // first move columns\n for (int c = 0; c != Math.abs(move_column) && result1 != false; c++) {\n\n\n TEMP_ID_FIRST = B.a.get(start_dest_R).get(start_dest_C).id;\n\n TEMP = move_column / Math.abs(move_column);\n\n //System.out.println(\"1C:\" + TEMP);\n\n //System.out.println(\" \" + TEMP_ID_FIRST + \" - > \" + (start_dest_C + TEMP));\n\n start_dest_C += TEMP;\n\n TEMP_ID = B.a.get(start_dest_R).get(start_dest_C).id;\n\n //System.out.println(TEMP_ID_FIRST + \" and \" + TEMP_ID);\n\n if (g.adj.get(TEMP_ID_FIRST).contains(TEMP_ID)) {\n\n //System.out.println(\"OK\");\n\n } else {\n result = false;\n\n //System.out.println(\"NOPE\");\n\n\n }\n }\n\n if (result == false) {\n return false;\n\n }\n\n\n }\n\n\n }\n\n\n return true;\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 }","public void findShortestPath() {\r\n\t\t\r\n\t\t//Create a circular array that will store the possible next tiles in the different paths.\r\n\t\tOrderedCircularArray<MapCell> path = new OrderedCircularArray<MapCell>();\r\n\t\t\r\n\t\t//Acquire the starting cell.\r\n\t\tMapCell starting = cityMap.getStart();\r\n\t\t\r\n\t\t//This variable is to be updated continuously with the cell with the shortest distance value in the circular array.\r\n\t\tMapCell current=null;\r\n\t\t\r\n\t\t//This variable is to check if the destination has been reached, which is initially false.\r\n\t\tboolean destination = false;\r\n\t\t\r\n\t\t//Add the starting cell into the circular array, and mark it in the list.\r\n\t\tpath.insert(starting, 0);\r\n\t\t\r\n\t\tstarting.markInList(); \r\n\t\t\r\n\t\ttry {\r\n\t\t\t\r\n\t\t\t//As long as the circular array isn't empty, and the destination hasn't been reached, run this loop.\r\n\t\t\twhile(!path.isEmpty()&&!destination) {\r\n\t\t\t\t\r\n\t\t\t\t//Take the cell with the shortest distance out of the circular array, and mark it accordingly.\r\n\t\t\t\tcurrent = path.getSmallest();\r\n\t\t\t\tcurrent.markOutList();\r\n\t\t\t\t\r\n\t\t\t\tMapCell next;\r\n\t\t\t\tint distance;\r\n\t\t\t\t\r\n\t\t\t\tif(current.isDestination()) {\r\n\t\t\t\t\t\r\n\t\t\t\t\tdestination = true; //If the current cell is the destination, end the loop.\r\n\t\t\t\t\t\r\n\t\t\t\t} else {\r\n\t\t\t\t\t\r\n\t\t\t\t\tnext = nextCell(current); //Acquire the next possible neighbour of the current cell.\r\n\t\t\t\t\t\r\n\t\t\t\t\t//Don't run if next is null, meaning there is no other possible neighbour in the path for the current cell.\r\n\t\t\t\t\twhile(next!=null) {\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tdistance = current.getDistanceToStart() + 1;\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t//If the distance of the selected neighbouring cell is currently more than 1 more than the current cell's \r\n\t\t\t\t\t\t//distance, update the distance of the neighbouring cell. Then, set the current cell as its predecessor.\r\n\t\t\t\t\t\tif(next.getDistanceToStart()>distance) {\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tnext.setDistanceToStart(distance);\r\n\t\t\t\t\t\t\tnext.setPredecessor(current);\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tdistance = next.getDistanceToStart(); \r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tif(next.isMarkedInList() && distance<path.getValue(next)) {\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tpath.changeValue(next, distance); //If the neighbouring cell is in the circular array, but with a \r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t //larger distance value than the new updated distance, change its value.\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t} else if(!next.isMarkedInList()){\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tpath.insert(next, distance); //If the neighbouring cell isn't in the circular array, add it in.\r\n\t\t\t\t\t\t\tnext.markInList();\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tnext = nextCell(current); //Look for the next possible neighbour, if any.\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}\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t//Catch all the possible exceptions that might be thrown by the method calls. Print the appropriate messages.\r\n\t\t} catch (EmptyListException e) {\r\n\t\t\t\r\n\t\t\tSystem.out.println(e.getMessage());\r\n\t\t\tSystem.out.println(\"Path finding execution stopped.\");\r\n\t\t\t\r\n\t\t} catch (InvalidNeighbourIndexException e) {\r\n\t\t\t\r\n\t\t\tSystem.out.println(\"The program tried to access an invalid neighbour of a tile.\");\r\n\t\t\tSystem.out.println(\"Path finding execution stopped.\");\r\n\t\t\t\r\n\t\t} catch (InvalidDataItemException e) {\r\n\t\t\t\r\n\t\t\tSystem.out.println(e.getMessage());\r\n\t\t\tSystem.out.println(\"Path finding execution stopped.\");\r\n\t\t\t\r\n\t\t} catch (Exception e) {\r\n\t\t\t\r\n\t\t\tSystem.out.println(e.getMessage()+\" Path finding execution has stopped.\");\r\n\t\t\t\r\n\t\t}\r\n\t\t\r\n\t\t//If a path was found, print the number of tiles in the path.\r\n\t\tif(destination) {\r\n\t\t\t\r\n\t\t\tSystem.out.println(\"Number of tiles in path: \" + (current.getDistanceToStart()+1));\r\n\t\t\t\r\n\t\t} else {\r\n\t\t\t\r\n\t\t\tSystem.out.println(\"No path found.\"); //Otherwise, indicate that a path wasn't found.\r\n\t\t\t\r\n\t\t}\r\n\t\t\r\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 }","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 Vector<PuzzleState> aStarSearch() {\r\n System.out.println(\"Starting A*\");\r\n long startTime = (new Date()).getTime();\r\n Vector<PuzzleState> solution = new Vector<PuzzleState>();\r\n HashSet<PuzzleState> closedList = new HashSet<PuzzleState>();\r\n PriorityQueue<PuzzleState> openList = new PriorityQueue<PuzzleState>();\r\n \r\n PuzzleState searchState = state.copy();\r\n searchState.prevState = null;\r\n searchState.depth = 0;\r\n openList.add(searchState);\r\n\r\n while (!openList.isEmpty() && !isGoal(searchState)) {\r\n searchState = openList.poll();\r\n if (!closedList.contains(searchState)) {\r\n closedList.add(searchState);\r\n Vector<PuzzleState> nextStates = possibleNextStates(searchState);\r\n for (PuzzleState s : nextStates)\r\n s.depth = searchState.depth + 1;\r\n openList.addAll(nextStates);\r\n }\r\n }\r\n \r\n // If the goal has been reached, construct the solution\r\n if (isGoal(searchState)) {\r\n for (PuzzleState s = searchState; s.prevState != null; s = s.prevState) {\r\n solution.add(s);\r\n }\r\n Collections.reverse(solution);\r\n }\r\n \r\n long endTime = (new Date()).getTime();\r\n System.out.println(\"A* search ended after \" + (endTime - startTime) + \" ms\");\r\n //for (PuzzleState s : solution)\r\n // System.out.println(s);\r\n return solution;\r\n }","public boolean solveMaze(int x, int y, String direction){\n\n if (maze[x][y] == \"E\"){\n solved = true;\n return solved;\n\n }\n\n if(!(maze[x][y].equals(\"S\") || maze[x][y].equals(\"E\"))){\n maze[x][y] = \"X\";\n }\n\n if(direction != \"up\" && isReachable(x+1, y)){\n solveMaze(x + 1, y, \"down\");\n if(solved) return true;\n }\n if(direction != \"left\" && isReachable(x, y+ 1)){\n solveMaze(x, y + 1, \"right\");\n if(solved) return true;\n }\n if(direction != \"down\" && isReachable(x-1, y)){\n solveMaze(x - 1 , y, \"up\");\n if(solved) return true;\n }\n if(direction != \"right\" && isReachable(x, y -1)){\n solveMaze(x, y - 1, \"left\");\n if(solved) return true;\n }\n\n //If cannot move, do backtracking\n if(!solved) {\n maze[x][y] = \" \";\n return false;\n }\n\n return false;\n }","public ArrayList<Integer> breadthSearch(int i, int j) {\n markedVerts = new ArrayList<Integer>();\n visitedVerts = new ArrayList<Integer>();\n Queue<Integer> queue = new LinkedList<Integer>();\n queue.add(i);\n return new ArrayList(breadthSearch(i, j, queue, queue));\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 }","@Override\n public ArrayList<AState> getAllPossibleStates(AState state){\n MazeState s = (MazeState)state;\n ArrayList<AState> moves = new ArrayList<AState> ();\n\n\n int row = s.getState().getRowIndex();\n int col = s.getState().getColumnIndex();\n int [][] matrix = mySearchableMaze.getMazeMatrix();\n\n\n if(row+1 < matrix.length){\n if( matrix[row+1][col]==0 ){\n moves.add(new MazeState(new Position(row+1,col),false,s.getCost()+1));\n\n }\n }\n if(row-1 >= 0 ){\n if( matrix[row-1][col]==0){\n moves.add(new MazeState(new Position(row-1,col),false,s.getCost()+1));\n\n }\n }\n if(col+1 < matrix[0].length ){\n if( matrix[row][col+1]==0 ){\n moves.add(new MazeState(new Position(row,col+1),false,s.getCost()+1));\n\n }\n }\n if(col-1 >= 0 ){\n if( matrix[row][col-1]==0 ){\n moves.add(new MazeState(new Position(row,col-1),false,s.getCost()+1));\n }\n }\n return moves;\n }","public static ArrayList<Edge> GenerateMaze(int size)\n {\n //Initialize\n Size = size;\n InitializeCells();\n InitializeEdges();\n stack = new Stack<Cell>();\n\n Cell current;\n\n //Algorithm\n\n //STEP 1: Choose 'random' cell and make it the current cell, and push it to the stack\n\n int rndX = RandomNum.Next(0, size);\n int rndY = RandomNum.Next(0, size);\n\n current = cells[rndX][rndY];\n stack.push(cells[rndX][rndY]);\n cells[current.Point.X][current.Point.Y].Visited = true;\n\n //STEP 2: While all cells hasn't been visited\n while (!AllCellsVisited())\n {\n //STEP 3: Get a random unvisited neighbour from current cell.\n //If cell doesn't have any valid neighbours it will return null\n Point neighbour = GetRandomNeighbour(current.Point);\n\n //If the current cell has a unvisited neighbour\n if (neighbour != null)\n {\n RemoveEdge(current.Point, neighbour);\n cells[neighbour.X][neighbour.Y].Visited = true;\n current = cells[neighbour.X][neighbour.Y];\n stack.push(current);\n\n }\n\n //If the current cell doesn't have any unvisited neighbours\n else\n {\n while (true)\n {\n Cell pop_cell = stack.pop();\n Point pop_neighbour = GetRandomNeighbour(pop_cell.Point);\n\n //If popped cell has a unvisited neighbour, break while loop\n if (pop_neighbour != null)\n {\n RemoveEdge(pop_cell.Point, pop_neighbour);\n current = cells[pop_neighbour.X][pop_neighbour.Y];\n stack.push(cells[pop_neighbour.X][pop_neighbour.Y]);\n cells[pop_neighbour.X][pop_neighbour.Y].Visited = true;\n\n break;\n }\n }\n }\n }\n\n return edges;\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 void analyzeForObstacles() {\n \t\n \t\n \tStack<Rect> bestFound = new Stack<Rect>();//This is a stack as the algorithm moves along x linearly\n \tboolean[][] blackWhiteGrid = getBlackWhiteGrid();\n \tint[] cache = new int[grid.length];\n \t\n \twhile (true) {\n\t\t\tboolean noneFound = true;\n\t\t\t\n\t\t\tfor (int i = 0; i<cache.length; i++)\n\t\t\t\tcache[i] = 0;\n\t\t\tfor (int llx = grid.length -1; llx >= 0; llx--) {\n\t\t\t\tupdate_cache(blackWhiteGrid,cache, llx);\n\t\t\t\tfor (int lly = 0; lly < grid.length; lly++) {\n\t\t\t\t\tRect bestOfRound = new Rect(llx,lly,llx,lly);\n\t\t\t\t\tint y = lly;\n\t\t\t\t\tint x_max = 9999;\n\t\t\t\t\tint x = llx;\n\t\t\t\t\twhile (y+1<grid.length && blackWhiteGrid[llx][y]) {\n\t\t\t\t\t\ty++;\n\t\t\t\t\t\tx = Math.min(llx+cache[y]-1, x_max);\n\t\t\t\t\t\tx_max = x;\n\t\t\t\t\t\tRect tryRect = new Rect(llx,lly-1,x,y);\n\t\t\t\t\t\tif (tryRect.area() > bestOfRound.area()) {\n\t\t\t\t\t\t\tbestOfRound = tryRect;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (bestOfRound.area() > 40) {\n\t\t\t\t\t\tif (noneFound) {\n\t\t\t\t\t\t\tbestFound.push(bestOfRound);\n\t\t\t\t\t\t\tnoneFound = false;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tRect lastRect = bestFound.peek();\n\t\t\t\t\t\t\tif (lastRect.area() < bestOfRound.area()) {\n\t\t\t\t\t\t\t\tbestFound.pop();\n\t\t\t\t\t\t\t\tbestFound.push(bestOfRound);\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\tif (noneFound)\n\t\t\t\tbreak;\n\t\t\t\n\t\t\tclearFoundRectangle(blackWhiteGrid, bestFound.peek());\n \t}\n \t\n \t//add found rectanlges\n \tobstacles.clear();\n \tobstacles.addAll(bestFound);\n \tSystem.out.println(\"Sweep done:\");\n \tfor (Rect r : bestFound){\n \t\tSystem.out.println(\"Rect: llx=\" + (r.llx-400) + \"\\tlly=\" + (r.lly-400) + \"\\turx=\" + (r.urx-400) + \"\\tury=\" + (r.ury-400));\n \t\tList<Point2D.Double> corners = new ArrayList<Point2D.Double>();\n \t\tcorners.add(new Point2D.Double((r.llx-400),(r.lly-400)));\n \t\tcorners.add(new Point2D.Double((r.llx-400),(r.ury-400)));\n \t\tcorners.add(new Point2D.Double((r.urx-400),(r.lly-400)));\n \t\tcorners.add(new Point2D.Double((r.urx-400),(r.ury-400)));\n \t\tobstaclesF.add(new Obstacle(corners));\n \t}\n \t\n \ttoExplore.clear();\n \tint i = 0;\n \tRandom rand = new Random();\n \twhile (toExplore.size() < 10 && i < 1000) {\n \t\tint x = rand.nextInt(grid.length);\n \t\tint y = rand.nextInt(grid.length);\n \t\tif (grid[x][y] == .5) {\n \t\t\ttoExplore.add(new Flag(\"blue\",x,y));\n \t\t}\n \t}\n }","private static void bfs(int idx) {\n\t\t\n\t\tQueue<node> q =new LinkedList<node>();\n\t\tq.add(new node(idx,0,\"\"));\n\t\twhile (!q.isEmpty()) {\n\t\t\tnode tmp = q.poll();\n\t\t\tif(tmp.idx<0 ||tmp.idx > 200000) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(tmp.cnt> min) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif(tmp.idx == k) {\n\t\t\t\tif(tmp.cnt < min) {\n\t\t\t\t\tmin = tmp.cnt;\n\t\t\t\t\tminnode = tmp;\n\t\t\t\t}\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif(!visit[tmp.idx] && tmp.idx<=100000) {\n\t\t\t\tvisit[tmp.idx]= true;\n\t\t\t\tq.add(new node(tmp.idx*2, tmp.cnt+1,tmp.s));\n\t\t\t\tq.add(new node(tmp.idx-1, tmp.cnt+1,tmp.s));\n\t\t\t\tq.add(new node(tmp.idx+1, tmp.cnt+1,tmp.s));\n\t\t\t}\n\t\t}\n\t\t\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 void findNeighbours(ArrayList<int[]> visited , Grid curMap) {\r\n\t\tArrayList<int[]> visitd = visited;\r\n\r\n\t\t//System.out.println(\"FROM FIND NEIGHBOURS cur pos:\" +Arrays.toString(nodePos));\r\n\t\t//for(int j=0; j<visitd.size();j++) {\r\n\t\t\t//System.out.println(\"FROM FIND NEIGHBOURS\" +Arrays.toString(visited.get(j)));\r\n\t\t\t//System.out.println(\"FROM FIND NEIGHBOURS getvstd\" +Arrays.toString(visited.get(j)));\r\n\t\t//}\r\n\t\t//System.out.println(\"FROM FIND NEIGHBOURS\" +visited);\r\n\t\tCell left=curMap.getCell(0, 0);\r\n\t\tCell right=curMap.getCell(0, 0);\r\n\t\tCell upper=curMap.getCell(0, 0);\r\n\t\tCell down=curMap.getCell(0, 0);\r\n\t\t//the getStart() method returns x,y coordinates representing the point in x,y axes\r\n\t\t//so if either of [0] or [1] coordinate is zero then we have one less neighbor\r\n\t\tif (nodePos[1]> 0) {\r\n\t\t\tupper=curMap.getCell(nodePos[0], nodePos[1]-1) ; \r\n\t\t}\r\n\t\tif (nodePos[1] < M-1) {\r\n\t\t\tdown=curMap.getCell(nodePos[0], nodePos[1]+1);\r\n\t\t}\r\n\t\tif (nodePos[0] > 0) {\r\n\t\t\tleft=curMap.getCell(nodePos[0] - 1, nodePos[1]);\r\n\t\t}\r\n\t\tif (nodePos[0] < N-1) {\r\n\t\t\tright=curMap.getCell(nodePos[0]+1, nodePos[1]);\r\n\t\t}\r\n\t\t//for(int i=0;i<visitd.size();i++) {\r\n\t\t\t//System.out.println(Arrays.toString(visitd.get(i)));\t\r\n\t\t//}\r\n\t\t\r\n\t\t//check if the neighbor is wall,if its not add to the list\r\n\t\tif(nodePos[1]>0 && !upper.isWall() && (!exists(visitd,new int[] {nodePos[0], nodePos[1] - 1}))) {\r\n\t\t\t//Node e=new Node(this , this.N , this.M , new int[] {nodePos[0], nodePos[1] - 1},curMap);\r\n\t\t\t//if(e.getVisited()!=true) {\r\n\t\t\tNodeChildren.add(new Node(this , this.N , this.M , new int[] {nodePos[0], nodePos[1] - 1}, curMap)); // father of the new nodes is this node\r\n\t\t\t//}\r\n\t\t}\r\n\t\tif(nodePos[1]<M-1 &&!down.isWall() && (!exists(visitd,new int[] {nodePos[0], nodePos[1] + 1}))){\r\n\t\t\tNodeChildren.add(new Node(this , this.N , this.M , new int[] {nodePos[0], nodePos[1] + 1}, curMap));\r\n\t\t}\r\n\t\tif(nodePos[0]>0 && !left.isWall() && (!exists(visitd,new int[] {nodePos[0] - 1, nodePos[1]}))) {\r\n\t\t\tNodeChildren.add(new Node(this , this.N , this.M , new int[] {nodePos[0] - 1, nodePos[1]}, curMap));\r\n\t\t}\r\n\t\tif(nodePos[0]<N-1 && !right.isWall() && (!exists(visitd,new int[] {nodePos[0] + 1, nodePos[1]}))) {\r\n\t\t\tNodeChildren.add(new Node(this , this.N , this.M , new int[] {nodePos[0] + 1, nodePos[1]}, curMap));\r\n\t\t}\r\n\t\t//for(int i=0; i<NodeChildren.size();i++) {\r\n\t\t\t//System.out.println(\"Paidia sth find:\" + Arrays.toString(NodeChildren.get(i).getNodePos()));\r\n\t\t//}\r\n\t\t\t\t\t\t\r\n\t}","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 }"],"string":"[\n \"public void BFS() {\\n visitedCells = 1;\\n\\n // Initialize the vertices\\n for (int j = 0; j < maze.getGrid().length; j++) {\\n for (int k = 0; k < maze.getGrid().length; k++) {\\n Cell cell = maze.getGrid()[j][k];\\n cell.setColor(\\\"WHITE\\\");\\n cell.setDistance(0);\\n cell.setParent(null);\\n }\\n }\\n\\n Cell sourceCell = maze.getGrid()[0][0];\\n Cell neighbor = null;\\n Cell currentCell;\\n int distance = 0;\\n\\n // Initialize the source node\\n sourceCell.setColor(\\\"GREY\\\");\\n sourceCell.setDistance(0);\\n sourceCell.setParent(null);\\n\\n queue.add(sourceCell);\\n\\n // Visits each cell until the queue is empty\\n while (!queue.isEmpty()) {\\n currentCell = queue.remove();\\n\\n for (int i = 0; i < currentCell.mazeNeighbors.size(); i++) {\\n neighbor = currentCell.mazeNeighbors.get(i);\\n\\n // Stop the search if you reach the final cell\\n if (neighbor.x == r - 1 && neighbor.y == r - 1) {\\n distance++;\\n if (distance == 10)\\n distance = 0;\\n neighbor.setDistance(distance);\\n neighbor.setParent(currentCell);\\n neighbor.visited = true;\\n visitedCells++;\\n break;\\n }\\n\\n // Checks each neighbor and adds it to the queue if its color is white\\n if (neighbor.getColor().equalsIgnoreCase(\\\"WHITE\\\")) {\\n distance++;\\n if (distance == 10)\\n distance = 0;\\n neighbor.setColor(\\\"GREY\\\");\\n neighbor.setDistance(distance);\\n neighbor.setParent(currentCell);\\n neighbor.visited = true;\\n queue.add(neighbor);\\n visitedCells++;\\n }\\n }\\n // Stop the search if you reach the final cell\\n if (neighbor.x == r - 1 && neighbor.y == r - 1)\\n break;\\n\\n currentCell.setColor(\\\"BLACK\\\");\\n }\\n }\",\n \"public void breadthFirstTraverse() {\\n\\t\\t// track whether vertex was visited\\n\\t\\tHashMap<Integer, Boolean> visited = buildVisited();\\n\\t\\t// store neighbors\\n\\t\\tQueue<Integer> queue = new LinkedList<Integer>();\\n\\n\\t\\t// arbitrarily add first element\\n\\t\\tInteger current = (Integer) edges.keySet().toArray()[0];\\n\\t\\tqueue.add(current);\\n\\n\\t\\twhile (queue.peek() != null) {\\n\\n\\t\\t\\tcurrent = queue.remove();\\n\\t\\t\\tSystem.out.println(\\\"current: \\\" + current);\\n\\t\\t\\tvisited.put(current, true);\\n\\n\\t\\t\\tfor (Integer neighbor: edges.get(current)) {\\n\\t\\t\\t\\tif (!visited.get(neighbor)) {\\n\\t\\t\\t\\t\\tqueue.add(neighbor);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"public Stack<MazePoint> DepthFirstSearch(int row, int column)\\n {\\n //cMaze[row][column].wasVisited()\\n if(cMaze[row][column].isExit())\\n {\\n sPath.push(cMaze[row][column]);\\n //print out the path\\n PrintPath(sPath, true);\\n return sPath;\\n }\\n else\\n {\\n //when not visit\\n if(!cMaze[row][column].wasVisited())\\n {\\n if(cMaze[row][column].hasItem())\\n {\\n String itemName = cMaze[row][column].pickUpItem();\\n Item item = new Item(itemName);\\n //check if the item is in the hashmap\\n if(availableItemsHashMap.get(item) != null)\\n {\\n inventoryList.insert(itemName);\\n }\\n else\\n {\\n cMaze[row][column].dropItem();\\n }\\n }\\n //mark as vist\\n cMaze[row][column].markVisited();\\n //push into stack\\n sPath.push(cMaze[row][column]);\\n }\\n //determine where to traverse next (S, E, W, N)\\n //recursively\\n if(cMaze[row+1][column].canBeNavigated() || cMaze[row+1][column].isExit())// or (cMaze[row+1][column] != VISITED_MARKER && cMaze[row+1][column] != 'W')\\n {\\n return DepthFirstSearch(row+1, column);\\n }\\n else if(cMaze[row][column+1].canBeNavigated() || cMaze[row][column+1].isExit())\\n {\\n return DepthFirstSearch(row, column+1);\\n }\\n else if(cMaze[row][column-1].canBeNavigated() || cMaze[row][column-1].isExit())\\n {\\n return DepthFirstSearch(row, column-1);\\n }\\n else if(cMaze[row-1][column].canBeNavigated() || cMaze[row-1][column].isExit())\\n {\\n return DepthFirstSearch(row-1, column);\\n }\\n //no where could go, then return\\n else\\n {\\n sPath.pop();\\n if(sPath.isEmpty())\\n {\\n //print nothing found\\n PrintPath(sPath, false);\\n return sPath;\\n }\\n MazePoint mp = sPath.top();\\n int mpRow = mp.getRow();\\n int mpColumn = mp.getColumn();\\n return DepthFirstSearch(mpRow, mpColumn);\\n }\\n }\\n }\",\n \"private Queue<Integer> breadthSearch(int i, int j, Queue<Integer> queue, Queue<Integer> path) {\\n while(queue.size() != 0) {\\n queue.poll();\\n }//while\\n return new LinkedList();\\n }\",\n \"@Override\\n\\t\\t\\tpublic void run() \\n\\t\\t\\t{\\n\\t\\t\\t\\tif(!(mazeCollection.containsKey(paramArray[0])))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tc.passError(\\\"Maze doesn't exist\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t/*\\n\\t\\t\\t\\t//if solution for this maze exists\\n\\t\\t\\t\\tif(mazeSolutions.containsKey(mazeCollection.get(paramArray[0])))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tc.passSolve(\\\"Solution for \\\"+paramArray[0]+ \\\" is ready\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t*/\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(paramArray[1].toString().equals(\\\"bfs\\\"))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tMazeAdapter ms=new MazeAdapter(mazeCollection.get(paramArray[0]));\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tSearcher<Position> bfs=new BFS<Position>();\\n\\t\\t\\t\\t\\tSolution<Position> sol=bfs.search(ms);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t//check if solution for the maze already exists, if so, replace it with the new one\\n\\t\\t\\t\\t\\tif(mazeSolutions.containsKey(mazeCollection.get(paramArray[0]))) {\\n\\t\\t\\t\\t\\t\\tmazeSolutions.remove(mazeCollection.get(paramArray[0]));\\n\\t\\t\\t\\t\\t\\tmazeSolutions.put(mazeCollection.get(paramArray[0]), sol);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tmazeSolutions.put(mazeCollection.get(paramArray[0]), sol);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tc.passSolve(\\\"Solution for \\\"+paramArray[0]+ \\\" is ready\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if(paramArray[1].toString().equals(\\\"dfs\\\"))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tMazeAdapter ms=new MazeAdapter(mazeCollection.get(paramArray[0]));\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tSearcher<Position> dfs=new DFS<Position>();\\n\\t\\t\\t\\t\\tSolution<Position> sol=dfs.search(ms);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t//check if solution for the maze already exists, if so, replace it with the new one\\n\\t\\t\\t\\t\\tif(mazeSolutions.containsKey(mazeCollection.get(paramArray[0]))) {\\n\\t\\t\\t\\t\\t\\tmazeSolutions.remove(mazeCollection.get(paramArray[0]));\\n\\t\\t\\t\\t\\t\\tmazeSolutions.put(mazeCollection.get(paramArray[0]), sol);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tmazeSolutions.put(mazeCollection.get(paramArray[0]), sol);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tc.passSolve(\\\"Solution for \\\"+paramArray[0]+ \\\" is ready\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tc.passError(\\\"Invalid algorithm\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t}\",\n \"public void breadthFirstSearch(){\\n Deque<Node> q = new ArrayDeque<>(); // In an interview just write Queue ? Issue is java 8 only has priority queue, \\n // meaning I have to pass it a COMPARABLE for the Node class\\n if (this.root == null){\\n return;\\n }\\n \\n q.add(this.root);\\n while(q.isEmpty() == false){\\n Node n = (Node) q.remove();\\n System.out.print(n.val + \\\", \\\");\\n if (n.left != null){\\n q.add(n.left);\\n }\\n if (n.right != null){\\n q.add(n.right);\\n }\\n }\\n }\",\n \"@Override\\n\\t//loc1 is the start location,loc2 is the destination\\n\\tpublic ArrayList<MapCoordinate> bfsSearch(MapCoordinate loc1, MapCoordinate loc2, Map m) {\\n\\t\\tSystem.out.println(\\\"come into bfsSearch\\\");\\n\\t\\tif(m.isAgentHasAxe() && m.isAgentHasKey()){\\n\\t\\t\\tLinkedList<State> queue=new LinkedList<State>();\\n\\t\\t\\tArrayList<MapCoordinate> Visited=new ArrayList<MapCoordinate>();\\n\\t\\t\\t\\n\\t\\t\\t//Visited.add(loc1);\\n\\t\\t\\tState s1=new State(loc1,m.getAgentHasNStones(),null);\\n\\t\\t\\tqueue.add(s1);\\n\\t\\t\\t\\n\\t\\t\\twhile(!queue.isEmpty()){\\n\\t\\t\\t\\tState s=queue.remove();\\n\\t\\t\\t\\tMapCoordinate currentLocation=s.getLocation();\\n\\t\\t\\t\\tVisited.add(s.getLocation()); //add to visited every loop\\n\\t\\t\\t\\tif(loc2.equals(currentLocation)){\\n\\t\\t\\t\\t\\t//means could reach loc2 from loc1\\n\\t\\t\\t\\t\\tArrayList<MapCoordinate> route=new ArrayList<MapCoordinate>();\\n\\t\\t\\t\\t\\twhile(s.getPrevState()!=null){\\n\\t\\t\\t\\t\\t\\troute.add(0,s.getLocation()); //add to head\\n\\t\\t\\t\\t\\t\\ts=s.getPrevState();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\treturn route;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tMapCoordinate temp=new MapCoordinate(currentLocation.getX()+1,currentLocation.getY());\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){//state move east\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){ //this is important else if(cTemp!='~'), not barely else,\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\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\\ttemp=new MapCoordinate(currentLocation.getX()-1,currentLocation.getY());\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){//state move south\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\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\\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()+1);\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){//state move north\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\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\\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()-1);\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){//state move south\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' &&s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\t\\n\\t\\t\\t}\\n\\t\\t\\treturn null;\\n\\t\\t}else if(m.isAgentHasAxe()){ //only have axe\\n\\t\\t\\tLinkedList<State> queue=new LinkedList<State>();\\n\\t\\t\\tArrayList<MapCoordinate> Visited=new ArrayList<MapCoordinate>();\\n\\t\\t\\t\\n\\t\\t\\t//Visited.add(loc1);\\n\\t\\t\\tState s1=new State(loc1,m.getAgentHasNStones(),null);\\n\\t\\t\\tqueue.add(s1);\\n\\t\\t\\t\\n\\t\\t\\twhile(!queue.isEmpty()){\\n\\t\\t\\t\\tState s=queue.remove();\\n\\t\\t\\t\\tMapCoordinate currentLocation=s.getLocation();\\n\\t\\t\\t\\tVisited.add(s.getLocation()); //add visited every loop\\n\\t\\t\\t\\tif(loc2.equals(currentLocation)){\\n\\t\\t\\t\\t\\t//means could reach loc2 from loc1\\n\\t\\t\\t\\t\\tArrayList<MapCoordinate> route=new ArrayList<MapCoordinate>();\\n\\t\\t\\t\\t\\twhile(s.getPrevState()!=null){\\n\\t\\t\\t\\t\\t\\troute.add(0,s.getLocation()); //add to head\\n\\t\\t\\t\\t\\t\\ts=s.getPrevState();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\treturn route;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tMapCoordinate temp=new MapCoordinate(currentLocation.getX()+1,currentLocation.getY());\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){//state move south\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\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\\ttemp=new MapCoordinate(currentLocation.getX()-1,currentLocation.getY());\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){//state move south\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\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\\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()+1);\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){//state move north\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\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\\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()-1);\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){//state move south\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\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\\treturn null;\\n\\t\\t}else if(m.isAgentHasKey()){ //only have key\\n\\t\\t\\tLinkedList<State> queue=new LinkedList<State>();\\n\\t\\t\\tArrayList<MapCoordinate> Visited=new ArrayList<MapCoordinate>();\\n\\t\\t\\t\\n\\t\\t\\t//Visited.add(loc1);\\n\\t\\t\\tState s1=new State(loc1,m.getAgentHasNStones(),null);\\n\\t\\t\\tqueue.add(s1);\\n\\t\\t\\t\\n\\t\\t\\twhile(!queue.isEmpty()){\\n\\t\\t\\t\\tState s=queue.remove();\\n\\t\\t\\t\\tMapCoordinate currentLocation=s.getLocation();\\n\\t\\t\\t\\tVisited.add(s.getLocation());\\n\\t\\t\\t\\tif(loc2.equals(currentLocation)){\\n\\t\\t\\t\\t\\t//means could reach loc2 from loc1\\n\\t\\t\\t\\t\\tArrayList<MapCoordinate> route=new ArrayList<MapCoordinate>();\\n\\t\\t\\t\\t\\twhile(s.getPrevState()!=null){\\n\\t\\t\\t\\t\\t\\troute.add(0, s.getLocation()); //add to head,in this fashion, return the right order of route\\n\\t\\t\\t\\t\\t\\ts=s.getPrevState();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\treturn route;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tMapCoordinate temp=new MapCoordinate(currentLocation.getX()+1,currentLocation.getY()); \\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){//state move east\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='T' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\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\\ttemp=new MapCoordinate(currentLocation.getX()-1,currentLocation.getY()); //state that move west\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='T' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\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\\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()+1); //state move north\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='T' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\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\\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()-1); //state move south\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='T' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\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\\treturn null;\\n\\t\\t}\\n\\t\\t\\n\\t\\t\\n\\t\\t/*\\n\\t\\t * \\n\\t\\t **/\\t\\t\\n\\t\\telse{ //have no key and axe\\n\\t\\t\\tSystem.out.println(\\\"come into the last elas clause\\\");\\n\\t\\t\\tLinkedList<State> queue=new LinkedList<State>();\\n\\t\\t\\tArrayList<MapCoordinate> Visited=new ArrayList<MapCoordinate>();\\n\\t\\t\\t\\n\\t\\t\\tVisited.add(loc1);\\n\\t\\t\\tState s1=new State(loc1,m.getAgentHasNStones(),null);\\n\\t\\t\\tqueue.add(s1);\\n\\t\\t\\t\\n\\t\\t\\t//int i=0;\\n\\t\\t\\twhile(!queue.isEmpty()){\\n\\t\\t\\t\\t//i++;\\n\\t\\t\\t\\t//System.out.println(\\\"come into while: \\\"+i);\\n\\t\\t\\t\\tState s=queue.remove();\\n\\t\\t\\t\\tMapCoordinate currentLocation=s.getLocation();\\n\\t\\t\\t\\tVisited.add(s.getLocation()); //add visited, let program won't stuck in \\n\\t\\t\\t\\tif(loc2.equals(currentLocation)){\\n\\t\\t\\t\\t\\t//means could reach loc2 from loc1\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"return computed route\\\");\\n\\t\\t\\t\\t\\tArrayList<MapCoordinate> route=new ArrayList<MapCoordinate>();\\n\\t\\t\\t\\t\\twhile(s.getPrevState()!=null){\\n\\t\\t\\t\\t\\t\\troute.add(0, s.getLocation()); //add to head\\n\\t\\t\\t\\t\\t\\ts=s.getPrevState();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tfor(MapCoordinate mc:route){\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"print returned route in bfssearch\\\");\\n\\t\\t\\t\\t\\t\\tSystem.out.print(\\\"mc:\\\"+mc.getX()+\\\" \\\"+mc.getY()+\\\"->\\\");\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\treturn route;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tMapCoordinate temp=new MapCoordinate(currentLocation.getX()+1,currentLocation.getY());\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){\\n\\t\\t\\t\\t\\t//System.out.println(\\\"1 if\\\");\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null &&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if\\\");\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 if\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 if\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 else\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for the initial state \\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\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\\ttemp=new MapCoordinate(currentLocation.getX()-1,currentLocation.getY());\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.add(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for the initial state \\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\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\\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()+1);\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*'&&cTemp!='T'&&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for the initial state \\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\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\\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()-1);\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T' &&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}//do not do any action for not enough stones situation\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for the initial state \\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}//do not do any action for not enough stones situation\\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\\treturn null;\\n\\t\\t}\\n\\t}\",\n \"public boolean solve(final int startRow, final int startCol) {\\r\\n\\r\\n // TODO\\r\\n // validate arguments: ensure position is within maze area\\r\\n\\r\\n if(mazeData [startRow][startCol] == WALL) {\\r\\n throw new IllegalArgumentException(\\\" we're in a wall buddy\\\");\\r\\n }\\r\\n else if (startRow > mazeData.length-1 || startCol > mazeData.length-1 ){\\r\\n throw new IllegalArgumentException(\\\" we're out of bounds \\\");\\r\\n }\\r\\n\\r\\n\\r\\n\\r\\n\\r\\n\\r\\n // TODO create local class for row/col positions\\r\\n class Position {\\r\\n private int row;\\r\\n private int col;\\r\\n\\r\\n // TODO add instance variables\\r\\n public Position(final int row, final int col) {\\r\\n this.row = row;\\r\\n this.col= col;\\r\\n }\\r\\n\\r\\n\\r\\n\\r\\n // TODO toString if desired\\r\\n public String toString() {\\r\\n return \\\"Row: \\\" + this.row + \\\"Column: \\\"+ this.col;\\r\\n }\\r\\n\\r\\n\\r\\n }\\r\\n\\r\\n\\r\\n // define the stack (work queue)\\r\\n final var queue = Collections.asLifoQueue(new LinkedList<Position>());\\r\\n //Queue<Position> queue = new LinkedList<Position>(); // EXTRA CREDIT PART 2\\r\\n\\r\\n // put starting position in queue\\r\\n queue.add(new Position(startRow, startCol));\\r\\n\\r\\n\\r\\n\\r\\n\\r\\n\\r\\n // look for a way out of the maze from the current position\\r\\n while (!queue.isEmpty()) {\\r\\n\\r\\n\\r\\n final Position pos = queue.remove();\\r\\n\\r\\n // if this is a wall, then ignore this position (and skip the remaining steps of the loop body)\\r\\n if (mazeData [pos.row][pos.col]== WALL){\\r\\n continue; // jumps to next spot in que , by skipping to next iteration of loops by saying continue\\r\\n }\\r\\n\\r\\n\\r\\n // otherwise mark this place as visited (drop a breadcrumb)\\r\\n if (mazeData [pos.row][pos.col]== VISITED){\\r\\n continue; // jumps to next spot in que , by skipping to next iteration of loops by saying continue\\r\\n }\\r\\n else if(mazeData [pos.row][pos.col]== EMPTY){\\r\\n mazeData [pos.row][pos.col]= VISITED;\\r\\n }\\r\\n\\r\\n // if we're already on the perimeter, then this is a way out and we should return success (true) right away\\r\\n if (pos.row == 0|| pos.col ==0 || pos.row == mazeData.length-1 || pos.col == mazeData[0].length-1){\\r\\n mazeData[startRow][startCol] = START;\\r\\n return true;\\r\\n }\\r\\n\\r\\n queue.add(new Position(pos.row+1,pos.col ));//down\\r\\n queue.add(new Position(pos.row-1,pos.col ));//up\\r\\n queue.add(new Position(pos.row,pos.col-1 )); //left\\r\\n queue.add(new Position(pos.row, pos.col + 1)); //right\\r\\n\\r\\n\\r\\n }//end of while\\r\\n\\r\\n\\r\\n\\r\\n // mark starting position\\r\\n mazeData[startRow][startCol] = START;\\r\\n\\r\\n // if we've looked everywhere but haven't gotten out, then return failure (false)\\r\\n return false;\\r\\n }\",\n \"public static void breadthFirstSearch(ArrayList<Node> graph) {\\n\\t\\tSystem.out.println(\\\"BFS:\\\");\\n\\t\\tif(graph.size() == 0) {\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\t\\n\\t\\tGraphUtils.cleanGraph(graph);\\n\\n\\t\\tQueue<Node> queue = new LinkedList<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\\tqueue.add(node);\\n\\t\\t\\t\\n\\t\\t\\twhile(!queue.isEmpty()) {\\n\\t\\t\\t\\tnode = queue.remove();\\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 queue 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\\tqueue.add(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\\n\\t\\tSystem.out.println();\\n\\t\\tGraphUtils.cleanGraph(graph);\\n\\t}\",\n \"public static Node searchBFS(int mat[][], int i, int j, int x, int y) {\\n\\t\\tfor (int n = 1; n < 30; n++) {\\n\\t\\t\\tfor (int p = 1; p < 30; p++) {\\n\\t\\t\\t\\tvisited[n][p] = false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t// create an empty queue\\n\\t\\tQueue<Node> q = queue;\\n\\t\\tq.clear();\\n\\t\\t// mark source cell as visited and enqueue the source node\\n\\t\\tvisited[j][i] = true;\\n\\t\\tNode root = NodeFactory.createNode(i, j, 0, null, null);\\n\\t\\tq.add(root);\\n\\n\\t\\t// stores length of longest path from source to destination\\n\\t\\tint min_dist = Integer.MAX_VALUE;\\n\\t\\tNode node = null;\\n\\n\\t\\t// run till queue is not empty\\n\\t\\twhile (!q.isEmpty()) {\\n\\t\\t\\t// pop front node from queue and process it\\n\\n\\t\\t\\tnode = q.poll();\\n\\t\\t\\ti = node.x;\\n\\t\\t\\tj = node.y;\\n\\t\\t\\tint dist = node.dist;\\n\\n\\t\\t\\tif (i == x && j == y) {\\n\\t\\t\\t\\tmin_dist = dist;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor (Direction dir : DIRECTIONS) {\\n\\t\\t\\t\\tint nx = i + dir.x;\\n\\t\\t\\t\\tint ny = j + dir.y;\\n\\n\\t\\t\\t\\tif (isValid(mat, visited, nx, ny)) {\\n\\t\\t\\t\\t\\t// mark next cell as visited and enqueue it\\n\\n\\t\\t\\t\\t\\tvisited[ny][nx] = true;\\n\\t\\t\\t\\t\\tint ndist = dist + 1;\\n\\n\\t\\t\\t\\t\\tNode newNode = NodeFactory.createNode(nx, ny, ndist, dir,\\n\\t\\t\\t\\t\\t\\t\\tnode);\\n\\n\\t\\t\\t\\t\\t// Node newNode =new Node(node, nx, ny, ndist, dir);\\n\\n\\t\\t\\t\\t\\tq.add(newNode);\\n\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t\\tif (min_dist == Integer.MAX_VALUE){\\n\\t\\t\\treturn null;\\n\\t\\t}\\n\\t\\treturn node;\\n\\t}\",\n \"private void breadthFirst(PathBetweenNodes graph, LinkedList<String> visited) {\\r\\n\\r\\n LinkedList<String> nodes = graph.adjacentNodes(visited.getLast());\\r\\n for (String node : nodes)\\r\\n {\\r\\n if (visited.contains(node))\\r\\n {\\r\\n continue;\\r\\n }\\r\\n if (node.equals(END))\\r\\n {\\r\\n \\tif (mode1 && mode){\\r\\n visited.add(node);\\r\\n printPath(visited); \\r\\n graph.flag=false;\\r\\n mode=false;\\r\\n visited.removeLast();\\r\\n \\t} else if(mode2){\\r\\n visited.add(node);\\r\\n printPath(visited); \\r\\n flag=mode2; \\r\\n visited.removeLast();\\r\\n \\t} \\r\\n } \\r\\n }\\r\\n\\r\\n for (String node : nodes) { // implementing a for loop to call each node in the array nodes\\r\\n if (visited.contains(node) || node.equals(END)) { // if statement to see if node is already visited or it is the end node\\r\\n continue;\\r\\n }\\r\\n flag=true;\\r\\n visited.addLast(node); //adding the last node to visited array\\r\\n breadthFirst(graph, visited); // implementing the breath first search\\r\\n visited.removeLast(); // removing the last node from array visited\\r\\n }\\r\\n if (flag == false) {\\r\\n System.out.println(\\\"No path Exists between \\\" + START + \\\" and \\\" + END);\\r\\n flag = true;\\r\\n }\\r\\n }\",\n \"private static int breadthFirstSearch(Vertex start) throws Queue.UnderflowException, Queue.EmptyException {\\n boolean visited[] = new boolean[48];\\n //Keep a queue of vertecies and a queue of the depth of the verticies - they will be added to and poped from identically\\n ListQueue<Vertex> queue = new ListQueue<Vertex>();\\n ListQueue<Integer> numQueue = new ListQueue<Integer>();\\n //Set the starting node as visited\\n visited[start.index()] = true;\\n queue.enqueue(start);\\n numQueue.enqueue(new Integer(1));\\n\\n //Keep last\\n int last = -1;\\n //While the queue isnt empty\\n while (!queue.isEmpty()) {\\n //Pop off the top from both queues and mark as visited\\n start = queue.dequeue();\\n int current = numQueue.dequeue();\\n visited[start.index] = true;\\n //For all neigbors\\n for (Vertex v : start.neighbors) {\\n //If we havent visited it make sure to visit it\\n if (visited[v.index()] == false) {\\n //As we keep adding new nodes to visit keep track of the depth\\n queue.enqueue(v);\\n numQueue.enqueue(current + 1);\\n }\\n }\\n //Keep track of the most recent depth before we pop it off (queue will be empty when we exit)\\n last = current;\\n }\\n //Return the max of the depth\\n return last;\\n }\",\n \"public void breadthFirst() {\\n\\t\\tQueue<Node> queue = new ArrayDeque<>();\\n\\t\\tqueue.add(root);\\n\\t\\twhile(!queue.isEmpty()) {\\n\\t\\t\\tif(queue.peek().left!=null)\\n\\t\\t\\t\\tqueue.add(queue.peek().left);\\n\\t\\t\\tif(queue.peek().right!=null)\\n\\t\\t\\t\\tqueue.add(queue.peek().right);\\n\\t\\t\\tSystem.out.println(queue.poll().data);\\n\\t\\t}\\n\\t}\",\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 void bfs(int x, int y, Node p) {\\n if (p == null) {\\n // TODO\\n return;\\n }\\n char c = board[x][y];\\n\\n if (p.next(c) == null) {\\n // TODO not found\\n return;\\n }\\n\\n Node node = p.next(c);\\n\\n // if node is leaf, found a word\\n if (node.word != null) {\\n if (!results.contains(node.word)) {\\n results.add(node.word);\\n }\\n }\\n\\n mark[x][y] = true;\\n for (int[] dir: dirs) {\\n int newX = x + dir[0];\\n int newY = y + dir[1];\\n if (newX < 0 || n <= newX\\n || newY < 0 || m <= newY) {\\n continue;\\n }\\n\\n if (mark[newX][newY]) {\\n continue;\\n }\\n\\n bfs(newX, newY, node);\\n }\\n mark[x][y] = false;\\n }\",\n \"public static String findPath(Maze maze) {\\n \\tint m = maze.getNumRows();\\n \\tint n = maze.getNumCols();\\n\\n \\t//define a visited matrix\\n \\tboolean[][] visited = new boolean[m][n];\\n \\tsetvisited(false, visited);\\n\\n \\t//define a direction matrix\\n \\tint[][] dir_mtr = new int[m][n];\\n \\tinit_dir(-1,dir_mtr);\\n\\n\\n\\n \\t//define a stack\\n \\tStack<MazeLocation> s;\\n \\ts = new StackRefBased<MazeLocation>();\\n\\n \\tMazeLocation entry = maze.getEntry();\\n \\tMazeLocation exit = maze.getExit();\\n \\t// System.out.println(entry.toString());\\n \\ts.push(entry);\\n\\n\\t\\tMazeLocation temp; \\n\\t\\tString result = \\\"\\\"; \\t\\n\\n\\t\\ttry{\\n\\t\\t\\tint x,y;\\n\\n\\n\\t\\t\\twhile(!s.isEmpty()){\\n\\n \\t\\ttemp = s.peek();\\n \\t\\tx = temp.getRow();\\n \\t\\ty = temp.getCol();\\n \\t\\tdir_mtr[x][y]+=1;\\n\\n \\t\\tif(temp.toString().equals(exit.toString())){\\n \\t\\t\\tSystem.out.println(\\\"find the path\\\");\\n \\t\\t\\tbreak;\\n\\n \\t\\t}\\n\\n \\t\\tif(dir_mtr[x][y]==0){ \\n \\t\\t\\t//checking the up direction\\n \\t\\t\\tif(x-1>=0 && !maze.isWall(x-1,y) && !visited[x-1][y]){\\n \\t\\t\\t\\tMazeLocation testnode = new MazeLocation(x-1,y,maze.isWall(x-1,y));\\n \\t\\t\\t\\tvisited[x-1][y] = true;\\n \\t\\t\\t\\ts.push(testnode);\\n\\n \\t\\t\\t}\\n\\n \\t\\t}else if(dir_mtr[x][y]==1){\\n \\t\\t\\t//checking the left direction\\n \\t\\t\\tif(y-1>=0 && !maze.isWall(x,y-1) && !visited[x][y-1]){\\n \\t\\t\\t\\tMazeLocation testnode = new MazeLocation(x,y-1,maze.isWall(x,y-1));\\n \\t\\t\\t\\tvisited[x][y-1] = true;\\n \\t\\t\\t\\ts.push(testnode);\\n\\n \\t\\t\\t}\\n\\n \\t\\t}else if(dir_mtr[x][y]==2){\\n \\t\\t\\t//checking the down direction\\n \\t\\t\\tif(x+1<m && !maze.isWall(x+1,y) && !visited[x+1][y]){\\n \\t\\t\\t\\tMazeLocation testnode = new MazeLocation(x+1,y,maze.isWall(x+1,y));\\n \\t\\t\\t\\tvisited[x+1][y] = true;\\n \\t\\t\\t\\ts.push(testnode);\\n\\n \\t\\t\\t}\\n \\t\\t\\t\\n \\t\\t}else if(dir_mtr[x][y]==3){\\n \\t\\t\\t//checking the right direction\\n \\t\\t\\tif(y+1<n && !maze.isWall(x,y+1) && !visited[x][y+1]){\\n \\t\\t\\t\\tMazeLocation testnode = new MazeLocation(x,y+1,maze.isWall(x,y+1));\\n \\t\\t\\t\\tvisited[x][y+1] = true;\\n \\t\\t\\t\\ts.push(testnode);\\n\\n \\t\\t\\t}\\n \\t\\t\\t\\n \\t\\t}else{\\n \\t\\t\\tvisited[x][y] = false;\\n \\t\\t\\ts.pop();\\n \\t\\t}\\n\\n\\n\\n \\t\\t\\n \\t}\\n\\n \\t//reverse the stack\\n \\tStack<MazeLocation> reverse;\\n \\treverse = new StackRefBased<MazeLocation>();\\n \\twhile(!s.isEmpty()){\\n\\t\\t\\t reverse.push(s.pop()); \\t//push the node to the reverse stack\\n\\t\\t\\t }\\n\\n\\n \\t//if the stack is not empty, then we find the path\\n\\t\\tif(!reverse.isEmpty()){\\n\\t\\t\\tresult = reverse.toString();\\n\\n\\t\\t}\\n\\n \\t\\n \\n\\n\\t\\t}\\n\\t\\tcatch (StackEmptyException see) {\\n \\n }\\n\\n\\n \\treturn result;\\n\\n\\n }\",\n \"public static void bfs(int a, int b) {\\n\\t\\t\\r\\n\\t\\tQueue<Node> q = new LinkedList<>();\\r\\n\\t\\t\\r\\n\\t\\tq.add(new Node(a,b));\\r\\n\\t\\t\\r\\n\\t\\twhile(!q.isEmpty()) {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tNode n = q.remove();\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tint x = n.x;\\r\\n\\t\\t\\tint y = n.y;\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tif(x+1 <= N && map[x+1][y] > map[x][y]) {\\r\\n\\t\\t\\t\\tif(visited[x+1][y] != 1) {\\r\\n\\t\\t\\t\\t\\tq.add(new Node(x+1,y));\\r\\n\\t\\t\\t\\t\\tvisited[x+1][y] = cnt;\\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\\tif(x-1 > 0 && map[x-1][y] > map[x][y]) {\\r\\n\\t\\t\\t\\tif(visited[x-1][y] != 1) {\\r\\n\\t\\t\\t\\t\\tq.add(new Node(x-1,y));\\r\\n\\t\\t\\t\\t\\tvisited[x-1][y] = cnt;\\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\\tif(y-1 > 0 && map[x][y-1] > map[x][y]) {\\r\\n\\t\\t\\t\\tif(visited[x][y-1] != 1) {\\r\\n\\t\\t\\t\\t\\tq.add(new Node(x,y-1));\\r\\n\\t\\t\\t\\t\\tvisited[x][y-1] = cnt;\\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\\tif(y+1 <=N && map[x][y+1] > map[x][y]) {\\r\\n\\t\\t\\t\\tif(visited[x][y+1] != 1) {\\r\\n\\t\\t\\t\\t\\tq.add(new Node(x,y+1));\\r\\n\\t\\t\\t\\t\\tvisited[x][y+1] = cnt;\\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\\t\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t}\",\n \"public String breadthFirstSearch( AnyType start_vertex ) throws VertexException {\\n \\n StringBuffer buffer = new StringBuffer();\\n \\n // ----------------------------\\n // TODO: Add your code here\\n // ----------------------------\\n boolean exists = false;\\n Vertex<AnyType> S = new Vertex<AnyType>(start_vertex);\\n int counter = 1;\\n //make new vertex to check if its in list\\n //make queue to hold vertices\\n SemiConstantTimeQueue<Vertex<AnyType>> queue = new SemiConstantTimeQueue<Vertex<AnyType>>();\\n //loop through and set not visited\\n for( int i = 0; i < vertex_adjacency_list.size(); i++){\\n vertex_adjacency_list.get(i).setVisited(-1);\\n //if it's in list then set exists to true\\n //and set visited \\n if(vertex_adjacency_list.get(i).compareTo(S) == 0){\\n exists = true;\\n vertex_adjacency_list.get(i).setVisited(counter);\\n counter = i;\\n }\\n } \\n //if doesn't exist then throw the exception\\n if(exists == false){\\n throw new VertexException(\\\"Start Vertex does not exist\\\");\\n }\\n //make new queue\\n queue.add(vertex_adjacency_list.get(counter));\\n vertex_adjacency_list.get(counter).setVisited(1);\\n counter = 1;\\n int k=0;\\n Vertex<AnyType>e;\\n //while the queue isn't empty\\n while(queue.peek() !=null){\\n //make e the top of the queue \\n e = queue.peek(); \\n //go through the list and if you reach the begining it exits loop\\n for( k = 0; k < vertex_adjacency_list.size()-1; k++){\\n if(vertex_adjacency_list.get(k).compareTo(e)==0){\\n break;\\n }\\n } \\n //go through loop and check if visited, if not then add it to queue, set visited\\n for( int j = 0; j< vertex_adjacency_list.get(k).numberOfAdjacentVertices(); j++){\\n if(vertex_adjacency_list.get(k).getAdjacentVertex(j).hasBeenVisited()==false){\\n counter++;\\n queue.add(vertex_adjacency_list.get(k).getAdjacentVertex(j));\\n vertex_adjacency_list.get(k).getAdjacentVertex(j).setVisited(counter);\\n }\\n }\\n //remove from queue when through loop once\\n k++;\\n queue.remove();\\n }\\n //loop through list and print vertex and when it was visited\\n for(int o = 0; o< vertex_adjacency_list.size(); o++){\\n buffer.append(vertex_adjacency_list.get(o) + \\\":\\\" + vertex_adjacency_list.get(o).getVisited()+ \\\"\\\\n\\\");\\n }\\n return buffer.toString();\\n }\",\n \"private void breadthFirstSearch (int start, int[] visited, int[] parent){\\r\\n Queue< Integer > theQueue = new LinkedList< Integer >();\\r\\n boolean[] identified = new boolean[getNumV()];\\r\\n identified[start] = true;\\r\\n theQueue.offer(start);\\r\\n while (!theQueue.isEmpty()) {\\r\\n int current = theQueue.remove();\\r\\n visited[current] = 1; //ziyaret edilmis vertexler queuedan cikarilan vertexlerdir\\r\\n Iterator < Edge > itr = edgeIterator(current);\\r\\n while (itr.hasNext()) {\\r\\n Edge edge = itr.next();\\r\\n int neighbor = edge.getDest();\\r\\n if (!identified[neighbor]) {\\r\\n identified[neighbor] = true;\\r\\n theQueue.offer(neighbor);\\r\\n parent[neighbor] = current;\\r\\n }\\r\\n }\\r\\n }\\r\\n }\",\n \"public static void main(String[] args) throws FileNotFoundException, IOException {\\r\\n\\r\\n //Creating an instance object of the class PathBetweenNodes\\r\\n PathBetweenNodes x = new PathBetweenNodes();\\r\\n x.graph = new PathBetweenNodes();\\r\\n x.readMaze(); // reading the maze from the file\\r\\n LinkedList<String> visited = new LinkedList<String>(); // creating an array called visited to store visited nodes\\r\\n System.out.println(\\\"Enter the source node:\\\");//asking user to enter the start node\\r\\n Scanner sc = new Scanner(System.in); // Scanner to input the start node into the system\\r\\n START = sc.next();\\r\\n System.out.println(\\\"Enter the destination node:\\\");// asking user to input the destination node\\r\\n END = sc.next(); //scan the destination node into the system\\r\\n mode(option);\\r\\n startTimer = System.nanoTime();\\r\\n visited.add(START);// adding the start node to array visited\\r\\n new PathBetweenNodes().breadthFirst(x.graph, visited); // implementing the breath first search for graph x and array visited\\r\\n sc.close(); // scanner must be closed\\r\\n if (x.graph.flag) {\\r\\n System.out.println(\\\"There is existing path between \\\" + START + \\\" and \\\" + END + \\\" as above.\\\");\\r\\n }\\r\\n if (!x.graph.flag) {\\r\\n System.out.println(\\\"No path was found between \\\" + START + \\\" and \\\" + END + \\\".\\\");\\r\\n }\\r\\n endTimer = System.nanoTime();\\r\\n long TimeElapsed = endTimer - startTimer;\\r\\n System.out.println(\\\"Time taken to solve the maze = \\\" + TimeElapsed + \\\" Nano seconds.\\\");\\r\\n }\",\n \"private void createMaze(Tile currentTile) {\\n\\n while (numberOfCellsVisited < CAST_WIDTH * CAST_HEIGHT) {\\n\\n // Get coordinates of current tile and set as visited\\n int currentX = currentTile.getPosition().getX();\\n int currentY = currentTile.getPosition().getY();\\n tempMap[currentY][currentX].setVisited(true);\\n\\n // Begin neighbourhood scan\\n ArrayList<Integer> neighbours = new ArrayList<>();\\n\\n // If a neighbour is not visited and its projected position is within bounds, add it to the list of valid neighbours\\n // North neighbour\\n if (currentY - 1 >= 0) {\\n if (!tempMap[currentY - 1][currentX].isVisited()) //Northern neighbour unvisited\\n neighbours.add(0);\\n }\\n //Southern neighbour\\n if (currentY + 1 < CAST_HEIGHT) { //y index if increased is not greater than height of the chamber\\n if (!tempMap[currentY + 1][currentX].isVisited()) //Northern neighbour unvisited\\n neighbours.add(1);\\n }\\n //Eastern neighbour\\n if (currentX + 1 < CAST_WIDTH) { //check edge case\\n if (!tempMap[currentY][currentX + 1].isVisited()) { //check if visited\\n neighbours.add(2);\\n }\\n }\\n //Western neighbour\\n if (currentX - 1 >= 0) {\\n if (!tempMap[currentY][currentX - 1].isVisited()) {\\n neighbours.add(3);\\n }\\n }\\n if (!neighbours.isEmpty()) {\\n\\n //generate random number between 0 and 3 for direction\\n Random rand = new Random();\\n boolean randomizer;\\n int myDirection;\\n do {\\n myDirection = rand.nextInt(4);\\n randomizer = neighbours.contains(myDirection);\\n } while (!randomizer);\\n\\n //knock down wall\\n switch (myDirection) {\\n case 0 -> { // North\\n tempMap[currentY][currentX].getPathDirection()[0] = true;\\n currentTile = tempMap[currentY - 1][currentX];\\n }\\n case 1 -> { // South\\n tempMap[currentY][currentX].getPathDirection()[1] = true;\\n currentTile = tempMap[currentY + 1][currentX];\\n }\\n case 2 -> { // East\\n tempMap[currentY][currentX].getPathDirection()[2] = true;\\n currentTile = tempMap[currentY][currentX + 1];\\n }\\n case 3 -> { // West\\n tempMap[currentY][currentX].getPathDirection()[3] = true;\\n currentTile = tempMap[currentY][currentX - 1];\\n }\\n }\\n\\n mapStack.push(currentTile);\\n numberOfCellsVisited++;\\n } else {\\n currentTile = mapStack.pop(); //backtrack\\n }\\n }\\n\\n castMaze(tempMap[0][0], -1);\\n }\",\n \"void testSearches(Tester t) {\\n Vertex v1 = new Vertex(10, 10);\\n Vertex v2 = new Vertex(10, 11);\\n Vertex v3 = new Vertex(10, 12);\\n\\n Edge e1 = new Edge(v1, v2, 1);\\n Edge e2 = new Edge(v2, v3, 1);\\n\\n IList<Vertex> map = new Cons<Vertex>(v1, new Cons<Vertex>(v2, new Cons<Vertex>(\\n v3, new Empty<Vertex>())));\\n\\n Player player = new Player(map);\\n DepthFirst dp = new DepthFirst(map);\\n BreadthFirst bp = new BreadthFirst(map);\\n\\n t.checkExpect(player.current, v1);\\n t.checkExpect(player.finished, false);\\n\\n t.checkExpect(bp.hasNext(), true);\\n t.checkExpect(bp.next(), new Queue<Vertex>());\\n\\n t.checkExpect(dp.hasNext(), true);\\n t.checkExpect(dp.next(), new Stack<Vertex>());\\n\\n t.checkExpect(player.move(true, e1), v2);\\n\\n t.checkExpect(player.current, v2);\\n t.checkExpect(player.finished, false);\\n\\n t.checkExpect(bp.hasNext(), false);\\n t.checkExpect(bp.next(), v3);\\n\\n t.checkExpect(dp.hasNext(), false);\\n t.checkExpect(dp.next(), v3);\\n\\n t.checkExpect(player.move(true, e2), v3);\\n\\n player.finished = true;\\n\\n t.checkExpect(player.current, v3);\\n t.checkExpect(player.finished, true);\\n\\n Queue<Vertex> q = new Queue<Vertex>(map);\\n\\n q.enqueue(new Vertex(5, 5));\\n\\n Deque<Vertex> dq = new Deque<Vertex>();\\n dq.addAtHead(v1);\\n dq.addAtTail(v2);\\n dq.addAtTail(new Vertex(5, 5));\\n\\n\\n t.checkExpect(q.isEmpty(), false);\\n t.checkExpect(q.contents, dq);\\n\\n Stack<Vertex> stack = new Stack<Vertex>(map);\\n\\n t.checkExpect(stack.isEmpty(), false);\\n dq.removeFromHead();\\n t.checkExpect(stack.pop(), dq);\\n\\n t.checkExpect(dp.next(), v2);\\n t.checkExpect(bp.hasNext(), true);\\n\\n }\",\n \"public static Node searchBFSInvalidDes(int mat[][], int i, int j, int x,\\n\\t\\t\\tint y) {\\n\\t\\tfor (int n = 1; n < 30; n++) {\\n\\t\\t\\tfor (int p = 1; p < 30; p++) {\\n\\t\\t\\t\\tvisited[n][p] = false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t// create an empty queue\\n\\t\\tQueue<Node> q = queue;\\n\\t\\tq.clear();\\n\\t\\t// mark source cell as visited and enqueue the source node\\n\\t\\tvisited[j][i] = true;\\n\\t\\tNode root = NodeFactory.createNode(i, j, 0, null, null);\\n\\t\\tq.add(root);\\n\\n\\t\\t// stores length of longest path from source to destination\\n\\t\\tint min_dist = Integer.MAX_VALUE;\\n\\t\\tNode node = null;\\n\\t\\t// run till queue is not empty\\n\\t\\twhile (!q.isEmpty()) {\\n\\t\\t\\t// pop front node from queue and process it\\n\\t\\t\\tnode = q.poll();\\n\\n\\t\\t\\t// (i, j) represents current cell and dist stores its\\n\\t\\t\\t// minimum distance from the source\\n\\t\\t\\ti = node.x;\\n\\t\\t\\tj = node.y;\\n\\t\\t\\tint dist = node.dist;\\n\\n\\t\\t\\t// if destination is found, update min_dist and stop\\n\\t\\t\\tif (i == x && j == y) {\\n\\t\\t\\t\\tmin_dist = dist;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\n\\t\\t\\t// check for all 4 possible movements from current cell\\n\\t\\t\\t// and enqueue each valid movement\\n\\t\\t\\tfor (Direction dir : DIRECTIONS) {\\n\\t\\t\\t\\t// check if it is possible to go to position\\n\\t\\t\\t\\t// (i + row[k], j + col[k]) from current position\\n\\t\\t\\t\\tint nx = i + dir.x;\\n\\t\\t\\t\\tint ny = j + dir.y;\\n\\t\\t\\t\\tif (isValid(mat, visited, nx, ny) || ((nx == x) && ny == y)) {\\n\\t\\t\\t\\t\\t// mark next cell as visited and enqueue it\\n\\t\\t\\t\\t\\tvisited[ny][nx] = true;\\n\\t\\t\\t\\t\\tint ndist = dist + 1;\\n\\t\\t\\t\\t\\tNode newNode = NodeFactory.createNode(nx, ny, ndist, dir,\\n\\t\\t\\t\\t\\t\\t\\tnode);\\n\\t\\t\\t\\t\\t// Node newNode =new Node(node, nx, ny, ndist, dir);\\n\\t\\t\\t\\t\\tq.add(newNode);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (min_dist == Integer.MAX_VALUE)\\n\\t\\t\\treturn null;\\n\\t\\treturn node;\\n\\t}\",\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 BFS() {\\r\\n\\t\\tSet<Vertex> visited = new HashSet<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\\tBFS(this.vertices[3], visited, queue); // BFS starting with 40\\r\\n\\r\\n\\t\\t// Call the helper function to print BFS 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\\tBFS(this.vertices[i], visited, queue);\\r\\n\\t}\",\n \"public void printBFS() {\\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.zeroDistanceColumn());\\n else\\n System.out.print(currentCell.distanceColumn());\\n }\\n System.out.print(\\\"|\\\");\\n System.out.println();\\n }\\n }\\n }\",\n \"public void bfs(Queue<Integer> queue, int visited[]) {\\n if (queue.isEmpty()) {\\n return;\\n }\\n\\n int root = queue.poll();\\n\\n if (visited[root] == 1) {\\n bfs(queue, visited);\\n return;//alreadu into consideration\\n }\\n\\n\\n System.out.printf(\\\"Exploring of node %d has started\\\\n\\\", root);\\n visited[root] = 1;\\n\\n\\n for (int i = 0; i < adjMatrix[root].size(); i++) {\\n if (visited[adjMatrix[root].get(i)] == 1 || visited[adjMatrix[root].get(i)] == 2) {\\n continue;\\n }\\n queue.add(adjMatrix[root].get(i));\\n }\\n bfs(queue, visited);\\n System.out.printf(\\\"Exploring of node %d has end\\\\n\\\", root);\\n visited[root] = 2;\\n }\",\n \"public void breadthFirstTraversal() {\\n beginAnimation();\\n treeBreadthFirstTraversal();\\n stopAnimation();\\n\\n }\",\n \"private boolean bfs(int[] pos, int[][] dis, int[][] grid,int m, int n,int bcnt){\\n Queue<int[]> q = new LinkedList<>();\\n int curx=0, cury=0, curlevel=0 ;\\n int newx = 0, newy=0, newlevel = 0;\\n int[] cur;\\n boolean availableplace = false;\\n boolean[][] vd = new boolean[m][n];\\n int res =0;\\n vd[pos[0]][pos[1]] = true;\\n q.offer(pos);\\n while(!q.isEmpty()){\\n cur = q.poll();\\n curx = cur[0];\\n cury = cur[1];\\n curlevel = cur[2];\\n vd[curx][cury]=true;\\n for(int[] mm : M){\\n newx = curx+mm[0];\\n newy = cury+mm[1];\\n if(newx >=0 && newx <m && newy >=0 && newy <n && !vd[newx][newy] &&grid[newx][newy]!=2){\\n vd[newx][newy] = true;\\n if(grid[newx][newy]==1) res++;\\n else if(grid[newx][newy]==0){\\n availableplace = true;\\n dis[newx][newy]+=curlevel;\\n q.offer(new int[]{newx,newy,curlevel+1});\\n }\\n }\\n }\\n }\\n return res==bcnt-1&&availableplace;\\n }\",\n \"public static void breadthFirstSearch (HashMap<String, Zpair> stores,\\n HashSet<Zpair> visited,\\n List<Integer> sortedQueue) {\\n List<String> q = new ArrayList<String>();\\n q.add(\\\"Q\\\");\\n // k=0\\n //int k = 0;\\n while(q.size() != 0) {\\n //if(k == 21) {\\n // System.exit(20);\\n // }\\n List<StringBuffer> path = new ArrayList<StringBuffer>(); // this is the return string\\n List<String> q1 = new ArrayList<String>();\\n int size = q.size();\\n //System.out.println(k);\\n for(int i = 0; i < size; i++) {\\n //printList(q);\\n path.add(ZMethods.stringPop(q));\\n execute(path.get(i), stores, visited, q1, sortedQueue);\\n }\\n copyStringBuffer(q1,q);\\n //k++;\\n }\\n }\",\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 \"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 \"private void bfs(int[][] board){\\n int[][] original = {{1,2,3},{4,5,0}};\\n LinkedList<Cell> queue = new LinkedList<>();\\n HashMap<Cell,int[][]> states = new HashMap<Cell,int[][]>();\\n Set<String> seen = new HashSet<>();\\n queue.offer(new Cell(1,2));\\n states.put(queue.peekFirst(),original);\\n int step = 0;\\n while(step <= maxStep){\\n int sz = queue.size();\\n while(sz-- > 0){\\n Cell cur = queue.pollFirst();\\n int[][] curBoard = states.get(cur);\\n if(seen.contains(this.toStr(curBoard))){\\n continue;\\n }\\n seen.add(this.toStr(curBoard));\\n \\n if (isSame(curBoard,board)){\\n this.res = step;\\n return;\\n }\\n // move around\\n for(int i = 0; i < 4; ++i){\\n int r = cur.row + dr[i];\\n int c = cur.col + dc[i];\\n if(r < 0 || c < 0 || r > 1 || c > 2) continue; \\n Cell next = new Cell(r, c);\\n queue.offer(next);\\n int[][] nextboard = this.clone(curBoard);\\n nextboard[cur.row][cur.col] = nextboard[r][c];\\n nextboard[r][c] = 0;\\n states.put(next,nextboard);\\n }\\n }\\n ++step;\\n }\\n return;\\n }\",\n \"private Cell breadthFirstSearch(WorldMap worldMap, Cell startCell, CELLTYPE goalType, Hashtable<Cell, Cell> prev) {\\n\\n\\t\\t// Using markedSet to avoid re-checking already visited nodes\\n\\t\\tHashSet<Cell> markedSet = new HashSet<Cell>();\\n\\t\\tLinkedList<Cell> queue = new LinkedList<Cell>();\\n\\n\\t\\tmarkedSet.add(startCell);\\n\\t\\tqueue.add(startCell);\\n\\n\\t\\twhile (!queue.isEmpty()) {\\n\\t\\t\\tCell cell = queue.remove();\\n\\t\\t\\tif (cell.getCellType() == goalType)\\n\\t\\t\\t\\treturn cell;\\n\\t\\t\\tLinkedList<Cell> neighbors = generateSuccessors(worldMap, cell, goalType);\\n\\n\\t\\t\\t/*\\n\\t\\t\\t * If looking for unexplored, shuffle list. Since the neighbors are\\n\\t\\t\\t * always returned NESW, it's best to shuffle the list if ant wants\\n\\t\\t\\t * to explore a random portion of the map.\\n\\t\\t\\t */\\n\\t\\t\\tif (goalType == CELLTYPE.UNEXPLORED)\\n\\t\\t\\t\\tCollections.shuffle(neighbors, new Random(System.currentTimeMillis()));\\n\\n\\t\\t\\tfor (Cell neighbor : neighbors)\\n\\t\\t\\t\\tif (!markedSet.contains(neighbor)) {\\n\\t\\t\\t\\t\\tmarkedSet.add(neighbor);\\n\\t\\t\\t\\t\\tqueue.add(neighbor);\\n\\t\\t\\t\\t\\tprev.put(neighbor, cell);\\n\\t\\t\\t\\t}\\n\\t\\t}\\n\\t\\t// If reached here, goal type doesn't exist\\n\\t\\treturn null;\\n\\t}\",\n \"static int[] bfs(int n, int m, int[][] edges, int s) {\\r\\n \\r\\n HashSet<Integer> aList[] = new HashSet[n];\\r\\n // Array of the nodes of the tree\\r\\n\\r\\n Queue<Integer> bfsQueue = new LinkedList();\\r\\n\\r\\n boolean visited[] = new boolean[n];\\r\\n // check if a node is visited or not\\r\\n\\r\\n\\r\\n int cost[] = new int[n];\\r\\n // cost to travel from one node to other\\r\\n\\r\\n for (int i = 0; i < n; i++) {\\r\\n // intialising the values\\r\\n visited[i] = false;\\r\\n cost[i] = -1;\\r\\n\\r\\n aList[i] = new HashSet<Integer>();\\r\\n // Each element of aList is a Set\\r\\n // To store the neighbouring nodes of a particular node\\r\\n }\\r\\n\\r\\n for (int i = 0; i < m; i++) {\\r\\n // let node[i] <--> node[j]\\r\\n\\r\\n // adding node[j] to neighbours list of node[i]\\r\\n aList[edges[i][0] - 1].add(edges[i][1] - 1);\\r\\n\\r\\n // adding node[i] to neighbours list of node[j]\\r\\n aList[edges[i][1] - 1].add(edges[i][0] - 1);\\r\\n }\\r\\n\\r\\n //\\r\\n s = s - 1;\\r\\n bfsQueue.add(s);\\r\\n visited[s] = true;\\r\\n cost[s] = 0;\\r\\n //\\r\\n \\r\\n \\r\\n while (!bfsQueue.isEmpty()) {\\r\\n \\r\\n int curr = bfsQueue.poll();\\r\\n // takes the last element of the queue\\r\\n \\r\\n for (int neigh : aList[curr]) { // iterating the neighbours of node 'curr'\\r\\n if (!visited[neigh]) { // checking if node neigh id already visited during the search\\r\\n visited[neigh ] = true;\\r\\n bfsQueue.add(neigh); //add the node neigh to bfsqueue\\r\\n cost[neigh] = cost[curr] + 6; \\r\\n }\\r\\n }\\r\\n }\\r\\n\\r\\n int result[] = new int[n-1];\\r\\n\\r\\n for (int i=0, j=0; i<n && j<n-1; i++, j++) {\\r\\n if (i == s){\\r\\n i++;\\r\\n }\\r\\n result[j] = cost[i];\\r\\n }\\r\\n \\r\\n return result;\\r\\n }\",\n \"private void breadthFirstSearch(Node sourceNode, Node destinationNode, String path, HashSet<Character> visited) {\\n // Create a list of nodes to visit (children of nodes)\\n LinkedList<Node> nextToVisit = new LinkedList<>();\\n // Add the first node to the list\\n nextToVisit.add(sourceNode);\\n\\n // Traverse level by level by traversing to all of its children first\\n while(!nextToVisit.isEmpty()) {\\n Node node = nextToVisit.remove();\\n // If its visited already, continue to the next child\\n if(visited.contains(node.charId)) {\\n continue;\\n }\\n // Mark the node as visited\\n path += \\\"->\\\" + node.charId;\\n visited.add(node.charId);\\n // If destination is reached\\n if(node == destinationNode) {\\n paths.add(path);\\n return;\\n }\\n // Add all of its children to the next node to visit\\n for(Node children : node.adjacent) {\\n nextToVisit.add(children);\\n }\\n }\\n\\n }\",\n \"@Override\\r\\n public boolean breadthFirstSearch(T start, T end) {\\r\\n Vertex<T> startV = vertices.get(start);\\r\\n Vertex<T> endV = vertices.get(end);\\r\\n\\r\\n Queue<Vertex<T>> queue = new LinkedList<Vertex<T>>();\\r\\n Set<Vertex<T>> visited = new HashSet<>();\\r\\n\\r\\n queue.add(startV);\\r\\n visited.add(startV);\\r\\n\\r\\n while(queue.size() > 0){\\r\\n Vertex<T> next = queue.poll();\\r\\n if(next == null){\\r\\n continue;\\r\\n }\\r\\n if(next == endV){\\r\\n return true;\\r\\n }\\r\\n\\r\\n for (Vertex<T> neighbor: next.getNeighbors()){\\r\\n if(!visited.contains(neighbor)){\\r\\n visited.add(neighbor);\\r\\n queue.add(neighbor);\\r\\n }\\r\\n }\\r\\n }\\r\\n\\r\\n return false;\\r\\n }\",\n \"public static int runBFS(int[][]map, coordinate src1, coordinate src2){\\n\\t \\n boolean visited[][] = new boolean[dim][dim]; //visited boolean 2d array that is the same size as 2d map\\n coordinate visit1[][]=new coordinate[dim][dim]; // this is the one used to hold previous location\\n coordinate visit2[][]=new coordinate[dim][dim]; // this is the one used to hold previous location\\n\\t \\n\\t visit1[0][0]=new coordinate(0,0); //same as BFS\\n \\n\\t visit2[dim-1][dim-1] = new coordinate(dim-1,dim-1);\\n\\t //marked both the 0,0 and dim-1, dim-1 srcs as visited\\n\\t \\n\\t Queue<QueueNode> queue1 = new LinkedList<>(); //queue for src1\\n\\t Queue<QueueNode> queue2 = new LinkedList<>(); //queue for src2\\n\\t \\n\\t QueueNode sn1 = new QueueNode(src1, 0, src1); //src node 1 queue node\\n\\t QueueNode sn2 = new QueueNode(src2, 0, src2);\\n\\t \\n\\t ArrayList<coordinate> pathHold1 = new ArrayList<>(); //for first path\\n\\t ArrayList<coordinate> pathHold2 = new ArrayList<>(); //for second path \\n\\t \\n\\t visited[src1.x][src1.y] = true; //mark the start node as visited inside of the visited boolean 2d array for first src\\n\\t visited[src2.x][src2.y] = true; //mark the start node as visited inside of the visited boolean 2d array for second src\\n\\t \\n\\t System.out.println();\\n\\t \\n\\t queue1.add(sn1);\\n\\t queue2.add(sn2);\\n\\t //added the start nodes\\n\\t \\n\\t QueueNode current1 = null;\\n\\t QueueNode current2 = null;\\n\\t //to be used later to hold current node being looked at\\n\\t coordinate c1 = null;\\n\\t coordinate c2 = null;\\n\\t\\t//coordinates to be examined\\n\\t \\n\\t while(!queue1.isEmpty()&&!queue2.isEmpty()){\\n\\t //keep iterating so long as queues have items -- but if one becomes empty, check at each iteration\\n\\t\\t\\t//to avoid null pointer so we are not dequeuing from empty queue\\n int maxFringe = 0;\\n\\t\\t//use this to check max fringe at each time we add to either queue\\n if(queue1.size()>maxFringe || queue2.size()>0) {\\n \\t if(queue1.size()>maxFringe) {\\n \\t\\t maxFringe=queue1.size();\\n \\t }else {\\n \\t\\t maxFringe=queue2.size();\\n \\t }\\n }\\n\\t \\n\\t \\tif(!queue1.isEmpty()) { \\n\\t\\t\\t\\t//while first queue is not empty, pop\\n\\t \\t\\t current1 = queue1.peek(); // this is n\\n\\t c1 = current1.point;\\n\\t \\t\\t visited[c1.x][c1.y]=true; //mark this node as visited, will check neighbors later\\n\\t boolean inFringe = false;\\n\\t inFringe = compareFringe(c1, queue2); //see if intersect or not\\n\\t \\n\\t \\n\\t // compare current point to the queue2 fringe. If not in fringe\\n\\t if(inFringe) {\\n\\t \\t //we have found the duplicate \\n\\t \\t System.out.println(\\\"duplicate\\\");\\n\\t \\t intersect = c1;\\n\\t\\t System.out.println(\\\"Intersect is :\\\"+c1.x+\\\",\\\"+c1.y);\\n\\t\\t visit1[c1.x][c1.y]=current1.prev; //set prev node or where we came from\\n\\t\\t \\n\\t\\t System.out.println(\\\"We have reached our goal!\\\");\\n\\t\\t \\n\\t\\t if(current2 != null) {\\n\\t\\t\\t\\t\\t //so long as paths have values, add length and return\\n\\t\\t return current1.pathTotal+current2.pathTotal;\\n\\t\\t }else {\\n\\t\\t\\t\\t\\t //else return only one path \\n\\t\\t \\t return current1.pathTotal;\\n\\t\\t }\\n\\t }\\n\\t\\t\\t\\t//this is getting the neighbors, same as BFS\\n\\t \\n\\t int row1 = 0;\\n\\t int col1 = 0;\\n\\t \\n\\t for (int i = 0; i < 4; i++) { \\n\\t row1= c1.x + rowNum1[i]; \\n\\t col1 = c1.y + colNum1[i]; \\n\\t //grab neighbor of current\\n\\t if (cellValid(row1, col1) && map[row1][col1] == 1 && !visited[row1][col1]){ \\n\\t \\t \\n\\t // mark cell as visited and enqueue it \\n\\t visited[row1][col1] = true; //we visited the node so mark it\\n\\t visit1[row1][col1] = new coordinate(c1.x, c1.y); //set prev as current coord\\n\\n\\t QueueNode Adjcell = new QueueNode(new coordinate(row1, col1), current1.pathTotal + 1, new coordinate(row1-rowNum1[i], col1-colNum1[i])); \\n\\t queue1.add(Adjcell); //make it a queueNode to add to q1 for first path\\n\\t }else if(cellValid(row1, col1) && map[row1][col1] == 1 && (visited[row1][col1]&&visit2[row1][col1]!=null)){\\n\\t \\t // System.out.println(\\\"already visited\\\"+row1+\\\",\\\"+col1); \\n\\t\\t\\t\\t //check if already visited and valid (not off grid) and = 1 so we can take path -- \\n\\t\\t\\t\\t //if so, this means we found intersect\\n\\t\\t\\t\\t //make sure node has been visited in other path to guarantee it is intersect\\n\\t \\t intersect=new coordinate(row1,col1); //set intersect\\n\\t \\t visit1[intersect.x][intersect.y]=new coordinate(c1.x, c1.y); //set where we came from\\n\\t \\t //current1.pathTotal++;\\n\\t \\t printfin(visit1, visit2); //used to print final path -- set map\\n \\n int nodesExplored1 = 0;\\n int nodesExplored2 = 0;\\n for(coordinate coor : pathHold1){\\n nodesExplored1++;\\n }\\n for(coordinate coor : pathHold2){\\n nodesExplored2++;\\n }\\n\\t\\t\\t\\t \\n\\t\\t\\t\\t //get number of nodes expanded in each path, add together\\n\\n int fin = nodesExplored1+nodesExplored2; //this is final explored nodes in each path\\n System.out.println(\\\"Nodes explored: \\\" + fin);\\n \\n\\t \\t return pathsize; //return total pathsize\\n\\t \\t //break;\\n\\t }\\n\\t \\n\\t \\n\\t } \\n\\t //once all of the neighbors have been visited, dequeue from queue 1 in path 1\\n\\t queue1.remove(); \\n\\t pathHold1.add(c1); //add to explored\\n\\t \\n\\t }\\n\\t \\t//now to the same in path2 from (dim-1, dim-1) as src2\\n\\t \\tif(!queue2.isEmpty()) {\\n\\t \\t\\t\\n\\t \\t\\t current2 = queue2.peek(); // this is n\\n\\t c2 = current2.point;\\n\\t \\t\\t visited[c2.x][c2.y]=true;\\n\\t boolean inFringe = false;\\n\\t inFringe = compareFringe(c2, queue1);\\n\\t \\n\\t // compare current point to the queue2 fringe. If not in fringe\\n\\t if(inFringe) {\\n\\t \\t //we have found the duplicate \\n\\t \\t System.out.println(\\\"duplicate\\\");\\n\\t \\t intersect = c2;\\n\\t\\t // System.out.println(\\\"Intersect is :\\\"+c2.x+\\\",\\\"+c2.y);\\n\\t\\t visit2[c2.x][c2.y]=current2.prev;\\n\\t\\t \\n\\t\\t System.out.println(\\\"We have reached our goal!\\\");\\n\\t\\t \\n\\t\\t \\n\\t\\t if(current1 != null) {\\n\\t\\t\\t return current1.pathTotal+current2.pathTotal;\\n\\t\\t\\t }else {\\n\\t\\t\\t \\t return current2.pathTotal;\\n\\t\\t\\t }\\n\\t }\\n\\t \\n\\t \\t// get neighbors\\n\\t int row2 = 0;\\n\\t int col2 = 0;\\n\\t \\n\\t for (int i = 0; i < 4; i++) { \\n\\t row2= c2.x + rowNum2[i]; \\n\\t col2 = c2.y + colNum2[i]; \\n\\t \\n\\t \\n\\t if (cellValid(row2, col2) && map[row2][col2] == 1 && !visited[row2][col2]){ \\n\\t \\t \\n\\t // mark cell as visited and enqueue it \\n\\t visited[row2][col2] = true; \\n\\t visit2[row2][col2] = new coordinate(c2.x, c2.y);\\n\\n\\t QueueNode Adjcell2 = new QueueNode(new coordinate(row2, col2), current2.pathTotal + 1, new coordinate(row2-rowNum2[i], col2-colNum2[i])); \\n\\t queue2.add(Adjcell2);\\n\\t }else if(cellValid(row2, col2) && map[row2][col2] == 1 && (visited[row2][col2]&&visit1[row2][col2]!=null)){\\n\\t \\t \\n\\t \\t intersect=new coordinate(row2,col2);\\n\\t \\t \\n\\t \\t visit2[intersect.x][intersect.y]=new coordinate(c2.x, c2.y);\\n\\t \\n\\t \\n\\t printfin(visit1, visit2);\\n\\t int nodesExplored1 = 0;\\n int nodesExplored2 = 0;\\n for(coordinate coor : pathHold1){\\n nodesExplored1++;\\n }\\n for(coordinate coor : pathHold2){\\n nodesExplored2++;\\n }\\n\\n int fin = nodesExplored1+nodesExplored2;\\n System.out.println(\\\"Nodes explored: \\\" + fin);\\n\\t \\t return pathsize;\\n\\t \\t \\n\\t }\\n\\t \\n\\t } \\n\\t //once all of the neighbors have been visited, dequeue \\n\\t queue2.remove(); \\n\\t pathHold2.add(c2);\\n\\t \\t\\t\\n\\t \\t}\\n\\n\\t }\\n \\n int nodesExplored1 = 0;\\n int nodesExplored2 = 0;\\n for(coordinate coor : pathHold1){\\n nodesExplored1++;\\n }\\n for(coordinate coor : pathHold2){\\n nodesExplored2++;\\n }\\n\\n int fin = nodesExplored1+nodesExplored2;\\n System.out.println(\\\"Nodes explored: \\\" + fin);\\n\\t //if here, means no path was found\\n\\t return -1;\\n\\t \\n\\t }\",\n \"public BFSMaze(MazeConstructor maze) {\\n this.maze = maze;\\n this.r = maze.getR();\\n queue = new LinkedList<>();\\n parents = new LinkedList<>();\\n }\",\n \"public static Vector<int []> BFS(int[] startPosition,int[] unexploreNode, mapNode[][] nodes){\\n\\t\\t\\r\\n\\t\\tVector<int []> shortestPath;\\r\\n\\t\\t\\r\\n\\t\\t//initial all nodes' status to UN-visited\\r\\n\\t\\tfor(int i = 0; i < nodes.length; i++)\\r\\n\\t\\t{\\r\\n\\t\\t\\tfor(int j = 0; j < nodes[i].length;j++)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tnodes[i][j].setTotDistance(999999999);//set the initial distance to INF\\r\\n\\t\\t\\t\\tnodes[i][j].gridPosition[0] = i;//save current node x position\\r\\n\\t\\t\\t\\tnodes[i][j].gridPosition[1] = j;//save current node y position\\r\\n\\t\\t\\t\\tnodes[i][j].setNodeVistied(false);//set all nodes are not visited yet\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\t//create start node and add it into the execution queue\\r\\n\\t\\tmapNode tempNode = new mapNode();\\r\\n\\t\\ttempNode = nodes[startPosition[0]][startPosition[1]];\\r\\n\\t\\tVector<mapNode> tempQueue = new Vector<mapNode>();\\r\\n\\t\\ttempQueue.add(tempNode);\\r\\n\\t\\t//main loop: check all nodes on the map\\r\\n\\t\\twhile(tempQueue.size() != 0)\\r\\n\\t\\t{\\r\\n\\t\\t\\t//create four nearby nodes\\r\\n\\t\\t\\tmapNode tempTopNode = new mapNode();\\r\\n\\t\\t\\tmapNode tempBottomNode = new mapNode();\\r\\n\\t\\t\\tmapNode tempLeftNode = new mapNode();\\r\\n\\t\\t\\tmapNode tempRightNode = new mapNode();\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t//update Top node information from original nodes matrix\\r\\n\\t\\t\\tif(tempQueue.get(0).topNode != null)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\ttempTopNode = nodes[tempQueue.get(0).topNode.gridPosition[0]][tempQueue.get(0).topNode.gridPosition[1]];\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\ttempTopNode = null;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//update Bottom node information from original nodes matrix\\r\\n\\t\\t\\tif(tempQueue.get(0).bottomNode != null)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\ttempBottomNode = nodes[tempQueue.get(0).bottomNode.gridPosition[0]][tempQueue.get(0).bottomNode.gridPosition[1]];\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\ttempBottomNode = null;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//update Left node information from original nodes matrix\\r\\n\\t\\t\\tif(tempQueue.get(0).leftNode != null)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\ttempLeftNode = nodes[tempQueue.get(0).leftNode.gridPosition[0]][tempQueue.get(0).leftNode.gridPosition[1]];\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\ttempLeftNode = null;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//update Right node information from original nodes matrix\\r\\n\\t\\t\\tif(tempQueue.get(0).rightNode != null)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\ttempRightNode = nodes[tempQueue.get(0).rightNode.gridPosition[0]][tempQueue.get(0).rightNode.gridPosition[1]];\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\ttempRightNode = null;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t//start re-calculate distance of each node\\r\\n\\t\\t\\t//check the top node and update new distance\\r\\n\\t\\t\\tif(tempTopNode != null)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tif(tempTopNode.getNodeVisited() == false && tempTopNode.getOwnElevation() != 999999999 && tempTopNode.getStatus() != Status.EXPLORED )\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tVector<int[]> tempPath = new Vector<int[]>();\\r\\n\\t\\t\\t\\t\\t//record the path\\r\\n\\t\\t\\t\\t\\tfor(int m = 0; m < tempQueue.get(0).getTotPath().size(); m++)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tint[] tempXY = new int[2];\\r\\n\\t\\t\\t\\t\\t\\ttempXY = tempQueue.get(0).getTotPath().get(m);\\r\\n\\t\\t\\t\\t\\t\\ttempPath.add(tempXY);\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t//check new node to see if exists in path\\r\\n\\t\\t\\t\\t\\tif(checkPositionInPath(tempPath, tempQueue.get(0).gridPosition[0], tempQueue.get(0).gridPosition[1]) == false)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tint[] tempXY2 = new int[2];\\r\\n\\t\\t\\t\\t\\t\\ttempXY2 = tempQueue.get(0).gridPosition;\\r\\n\\t\\t\\t\\t\\t\\ttempPath.add(tempXY2);\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t//assign new path to the node\\r\\n\\t\\t\\t\\t\\ttempTopNode.setTotPath(tempPath);\\r\\n\\t\\t\\t\\t\\t//update data back to original matrix\\r\\n\\t\\t\\t\\t\\ttempTopNode.setStatus(Status.EXPLORED);\\r\\n\\t\\t\\t\\t\\tnodes[tempTopNode.gridPosition[0]][tempTopNode.gridPosition[1]] = tempTopNode;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif(tempTopNode.gridPosition[0] == unexploreNode[0] && tempTopNode.gridPosition[1] == unexploreNode[1]){\\r\\n\\t\\t\\t\\t\\t//print out the end node\\r\\n\\t\\t\\t\\t\\t//print out the total distance between two points\\r\\n\\t\\t\\t\\t\\t//print out the total number node of path\\r\\n\\t\\t\\t\\t\\t//System.out.println(\\\"End Point: \\\"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[0]+1)+\\\" \\\"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[1]+1));\\r\\n\\t\\t\\t\\t\\t//System.out.println(\\\"Total Distance: \\\"+nodes[unexploreNode[0]][unexploreNode[1]].getTotDistance());\\r\\n\\t\\t\\t\\t\\t//System.out.println(\\\"Total number of nodes: \\\"+nodes[unexploreNode[0]][unexploreNode[1]].getTotPath().size());\\r\\n\\t\\t\\t\\t\\tshortestPath = nodes[unexploreNode[0]][unexploreNode[1]].getTotPath();\\r\\n\\t\\t\\t\\t\\tshortestPath.add(unexploreNode);\\r\\n\\t\\t\\t\\t\\treturn shortestPath;\\t\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif(nodes[tempTopNode.gridPosition[0]][tempTopNode.gridPosition[1]].getNodeVisited()== false && checkNodeInQueue(tempQueue, tempTopNode.gridPosition[0], tempTopNode.gridPosition[1]) == false && tempTopNode.getOwnElevation() != 999999999)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t//check un-visited nodes and add new node into execution queue\\r\\n\\t\\t\\t\\t\\ttempQueue.add(tempTopNode);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//check the bottom node and update new distance\\r\\n\\t\\t\\tif(tempBottomNode != null)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tif(tempBottomNode.getNodeVisited() == false && tempBottomNode.getOwnElevation() != 999999999 && tempBottomNode.getStatus() != Status.EXPLORED)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tVector<int[]> tempPath = new Vector<int[]>();\\r\\n\\t\\t\\t\\t\\t//record the path\\r\\n\\t\\t\\t\\t\\tfor(int m = 0; m < tempQueue.get(0).getTotPath().size(); m++)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tint[] tempXY = new int[2];\\r\\n\\t\\t\\t\\t\\t\\ttempXY = tempQueue.get(0).getTotPath().get(m);\\r\\n\\t\\t\\t\\t\\t\\ttempPath.add(tempXY);\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t//check new node to see if it exists in path\\r\\n\\t\\t\\t\\t\\tif(checkPositionInPath(tempPath, tempQueue.get(0).gridPosition[0], tempQueue.get(0).gridPosition[1]) == false)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tint[] tempXY2 = new int[2];\\r\\n\\t\\t\\t\\t\\t\\ttempXY2 = tempQueue.get(0).gridPosition;\\r\\n\\t\\t\\t\\t\\t\\ttempPath.add(tempXY2);\\r\\n\\t\\t\\t\\t\\t}\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t//assign new path to the node\\r\\n\\t\\t\\t\\t\\ttempBottomNode.setTotPath(tempPath);\\r\\n\\t\\t\\t\\t\\ttempBottomNode.setStatus(Status.EXPLORED);\\r\\n\\t\\t\\t\\t\\t//update data back to original matrix\\r\\n\\t\\t\\t\\t\\tnodes[tempQueue.get(0).bottomNode.gridPosition[0]][tempQueue.get(0).bottomNode.gridPosition[1]] = tempBottomNode;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tif(tempBottomNode.gridPosition[0] == unexploreNode[0] && tempBottomNode.gridPosition[1] == unexploreNode[1]){\\r\\n\\t\\t\\t\\t\\t//System.out.println(\\\"End Point: \\\"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[0]+1)+\\\" \\\"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[1]+1));\\r\\n\\t\\t\\t\\t\\t//System.out.println(\\\"Total Distance: \\\"+nodes[unexploreNode[0]][unexploreNode[1]].getTotDistance());\\r\\n\\t\\t\\t\\t\\t//System.out.println(\\\"Total number of nodes: \\\"+nodes[unexploreNode[0]][unexploreNode[1]].getTotPath().size());\\r\\n\\t\\t\\t\\t\\tshortestPath = nodes[unexploreNode[0]][unexploreNode[1]].getTotPath();\\r\\n\\t\\t\\t\\t\\tshortestPath.add(unexploreNode);\\r\\n\\t\\t\\t\\t\\treturn shortestPath;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif(nodes[tempBottomNode.gridPosition[0]][tempBottomNode.gridPosition[1]].getNodeVisited()== false && checkNodeInQueue(tempQueue, tempBottomNode.gridPosition[0], tempBottomNode.gridPosition[1]) == false && tempBottomNode.getOwnElevation() != 999999999)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t//check un-visited nodes and add new node into execution queue\\r\\n\\t\\t\\t\\t\\ttempQueue.add(tempBottomNode);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//check the left node and update new distance\\r\\n\\t\\t\\tif(tempLeftNode != null)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tif(tempLeftNode.getNodeVisited() == false && tempLeftNode.getOwnElevation() != 999999999 && tempLeftNode.getStatus() != Status.EXPLORED)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tVector<int[]> tempPath = new Vector<int[]>();\\r\\n\\t\\t\\t\\t\\t//record the path\\r\\n\\t\\t\\t\\t\\tfor(int m = 0; m < tempQueue.get(0).getTotPath().size(); m++)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tint[] tempXY = new int[2];\\r\\n\\t\\t\\t\\t\\t\\ttempXY = tempQueue.get(0).getTotPath().get(m);\\r\\n\\t\\t\\t\\t\\t\\ttempPath.add(tempXY);\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t//check new node to see if it exists in path\\r\\n\\t\\t\\t\\t\\tif(checkPositionInPath(tempPath, tempQueue.get(0).gridPosition[0], tempQueue.get(0).gridPosition[1]) == false)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tint[] tempXY2 = new int[2];\\r\\n\\t\\t\\t\\t\\t\\ttempXY2 = tempQueue.get(0).gridPosition;\\r\\n\\t\\t\\t\\t\\t\\ttempPath.add(tempXY2);\\r\\n\\t\\t\\t\\t\\t}\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t//assign new path to the node\\r\\n\\t\\t\\t\\t\\ttempLeftNode.setTotPath(tempPath);\\r\\n\\t\\t\\t\\t\\ttempLeftNode.setStatus(Status.EXPLORED);\\r\\n\\t\\t\\t\\t\\t//update data back to original matrix\\r\\n\\t\\t\\t\\t\\tnodes[tempQueue.get(0).leftNode.gridPosition[0]][tempQueue.get(0).leftNode.gridPosition[1]] = tempLeftNode;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tif(tempLeftNode.gridPosition[0] == unexploreNode[0] && tempLeftNode.gridPosition[1] == unexploreNode[1]){\\r\\n\\t\\t\\t\\t\\t//System.out.println(\\\"End Point: \\\"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[0]+1)+\\\" \\\"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[1]+1));\\r\\n\\t\\t\\t\\t\\t//System.out.println(\\\"Total Distance: \\\"+nodes[unexploreNode[0]][unexploreNode[1]].getTotDistance());\\r\\n\\t\\t\\t\\t\\t//System.out.println(\\\"Total number of nodes: \\\"+nodes[unexploreNode[0]][unexploreNode[1]].getTotPath().size());\\r\\n\\t\\t\\t\\t\\tshortestPath = nodes[unexploreNode[0]][unexploreNode[1]].getTotPath();\\r\\n\\t\\t\\t\\t\\tshortestPath.add(unexploreNode);\\r\\n\\t\\t\\t\\t\\treturn shortestPath;\\t\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif(nodes[tempLeftNode.gridPosition[0]][tempLeftNode.gridPosition[1]].getNodeVisited()== false && checkNodeInQueue(tempQueue, tempLeftNode.gridPosition[0], tempLeftNode.gridPosition[1]) == false && tempLeftNode.getOwnElevation() != 999999999)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t//check un-visited nodes and add new node into execution queue\\r\\n\\t\\t\\t\\t\\ttempQueue.add(tempLeftNode);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//check the right node and update new distance\\r\\n\\t\\t\\tif(tempRightNode != null)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tif(tempRightNode.getNodeVisited() == false && tempRightNode.getOwnElevation() != 999999999 && tempRightNode.getStatus() != Status.EXPLORED)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tVector<int[]> tempPath = new Vector<int[]>();\\r\\n\\t\\t\\t\\t\\t//record the path\\r\\n\\t\\t\\t\\t\\tfor(int m = 0; m < tempQueue.get(0).getTotPath().size(); m++)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tint[] tempXY = new int[2];\\r\\n\\t\\t\\t\\t\\t\\ttempXY = tempQueue.get(0).getTotPath().get(m);\\r\\n\\t\\t\\t\\t\\t\\ttempPath.add(tempXY);\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t//check to see if new node existed in path\\r\\n\\t\\t\\t\\t\\tif(checkPositionInPath(tempPath, tempQueue.get(0).gridPosition[0], tempQueue.get(0).gridPosition[1]) == false)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tint[] tempXY2 = new int[2];\\r\\n\\t\\t\\t\\t\\t\\ttempXY2 = tempQueue.get(0).gridPosition;\\r\\n\\t\\t\\t\\t\\t\\ttempPath.add(tempXY2);\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t//assign new path to the node\\r\\n\\t\\t\\t\\t\\ttempRightNode.setTotPath(tempPath);\\r\\n\\t\\t\\t\\t\\ttempRightNode.setStatus(Status.EXPLORED);\\r\\n\\t\\t\\t\\t\\t//update data back to original matrix\\r\\n\\t\\t\\t\\t\\tnodes[tempQueue.get(0).rightNode.gridPosition[0]][tempQueue.get(0).rightNode.gridPosition[1]] = tempRightNode;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tif(tempRightNode.gridPosition[0] == unexploreNode[0] && tempRightNode.gridPosition[1] == unexploreNode[1]){\\r\\n\\t\\t\\t\\t\\t//System.out.println(\\\"End Point: \\\"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[0]+1)+\\\" \\\"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[1]+1));\\r\\n\\t\\t\\t\\t\\t//System.out.println(\\\"Total Distance: \\\"+nodes[unexploreNode[0]][unexploreNode[1]].getTotDistance());\\r\\n\\t\\t\\t\\t\\t//System.out.println(\\\"Total number of nodes: \\\"+nodes[unexploreNode[0]][unexploreNode[1]].getTotPath().size());\\r\\n\\t\\t\\t\\t\\tshortestPath = nodes[unexploreNode[0]][unexploreNode[1]].getTotPath();\\r\\n\\t\\t\\t\\t\\tshortestPath.add(unexploreNode);\\r\\n\\t\\t\\t\\t\\treturn shortestPath;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif(nodes[tempRightNode.gridPosition[0]][tempRightNode.gridPosition[1]].getNodeVisited()== false && checkNodeInQueue(tempQueue, tempRightNode.gridPosition[0], tempRightNode.gridPosition[1]) == false && tempRightNode.getOwnElevation() != 999999999)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t//check un-visited nodes and add new node into execution queue\\r\\n\\t\\t\\t\\t\\ttempQueue.add(tempRightNode);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t//set current node to visited node and\\r\\n\\t\\t\\t//remove current node from execution queue\\r\\n\\t\\t\\ttempQueue.get(0).setNodeVistied(true);\\r\\n\\t\\t\\tnodes[tempQueue.get(0).gridPosition[0]][tempQueue.get(0).gridPosition[1]].setNodeVistied(true);\\r\\n\\t\\t\\ttempQueue.remove(0);\\t\\r\\n\\t\\t}\\r\\n\\t\\t//print out the end node\\r\\n\\t\\t//print out the total distance between two points\\r\\n\\t\\t//print out the total number node of path\\r\\n\\t\\tSystem.out.println(\\\"End 5 Point: \\\"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[0]+1)+\\\" \\\"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[1]+1));\\r\\n\\t\\tSystem.out.println(\\\"Total Distance: \\\"+nodes[unexploreNode[0]][unexploreNode[1]].getTotDistance());\\r\\n\\t\\tSystem.out.println(\\\"Total number of nodes: \\\"+nodes[unexploreNode[0]][unexploreNode[1]].getTotPath().size());\\r\\n\\t\\tshortestPath = nodes[unexploreNode[0]][unexploreNode[1]].getTotPath();\\r\\n\\t\\tshortestPath.add(unexploreNode);\\r\\n\\t\\treturn shortestPath;\\t\\t\\r\\n\\t}\",\n \"private int BFS() {\\n adjList.cleanNodeFields();\\n\\n //Queue for storing current shortest path\\n Queue<Node<Integer, Integer>> q = new LinkedList<>();\\n\\n //Set source node value to 0\\n q.add(adjList.getNode(startNode));\\n q.peek().key = 0;\\n q.peek().d = 0;\\n q.peek().visited = true;\\n\\n //Helper variables\\n LinkedList<Pair<Node<Integer, Integer>, Integer>> neighbors;//Array of pairs <neighborKey, edgeWeight>\\n Node<Integer, Integer> neighbor, u;\\n long speed = (long) (cellSideLength * 1.20);\\n\\n while (!isCancelled() && q.size() != 0) {\\n u = q.poll();\\n\\n //Marks node as checked\\n checkedNodesGC.fillRect((u.value >> 16) * cellSideLength + 0.5f,\\n (u.value & 0x0000FFFF) * cellSideLength + 0.5f,\\n (int) cellSideLength - 1, (int) cellSideLength - 1);\\n\\n //endNode found\\n if (u.value == endNode) {\\n //Draws shortest path\\n Node<Integer, Integer> current = u, prev = u;\\n\\n while ((current = current.prev) != null) {\\n shortestPathGC.strokeLine((prev.value >> 16) * cellSideLength + cellSideLength / 2,\\n (prev.value & 0x0000FFFF) * cellSideLength + cellSideLength / 2,\\n (current.value >> 16) * cellSideLength + cellSideLength / 2,\\n (current.value & 0x0000FFFF) * cellSideLength + cellSideLength / 2);\\n prev = current;\\n }\\n return u.d;\\n }\\n\\n //Wait after checking node\\n try {\\n Thread.sleep(speed);\\n } catch (InterruptedException interrupted) {\\n if (isCancelled())\\n break;\\n }\\n\\n //Checking Neighbors\\n neighbors = adjList.getNeighbors(u.value);\\n for (Pair<Node<Integer, Integer>, Integer> neighborKeyValuePair : neighbors) {\\n neighbor = neighborKeyValuePair.getKey();\\n //Relaxation step\\n //Checks if neighbor hasn't been checked, if so the assign the shortest path\\n if (!neighbor.visited) {\\n //Adds checked neighbor to queue\\n neighbor.key = u.d + 1;\\n neighbor.d = u.d + 1; //Assign shorter path found to neighbor\\n neighbor.prev = u;\\n neighbor.visited = true;\\n q.add(neighbor);\\n }\\n }\\n }\\n return Integer.MAX_VALUE;\\n }\",\n \"void BFS(int s);\",\n \"static void bfs(int[][] G){\\n\\t\\tQueue<Integer> q = new LinkedList<Integer>();\\t\\t\\n\\t\\tfor (int ver_start = 0; ver_start < N; ver_start ++){\\n\\t\\t\\tif (visited[ver_start]) continue;\\n\\t\\t\\tq.add(ver_start);\\n\\t\\t\\tvisited[ver_start] = true;\\n\\n\\t\\t\\twhile(!q.isEmpty()){\\n\\t\\t\\t\\tint vertex = q.remove();\\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 queue\\n\\t\\t\\t\\t\\t\\tq.add(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\\t\\t\\tSystem.out.println(\\\"--\\\");\\t\\t\\t\\n\\t\\t}\\n\\t}\",\n \"private static void breadthFirstSearch(int source, ArrayList<ArrayList<Integer>> nodes) {\\n\\t\\tArrayList<ArrayList<Integer>> neighbours = nodes;\\n\\t\\tQueue<Integer> queue= new LinkedList<Integer>();\\n\\t\\t\\n\\t\\tboolean[] visited = new boolean[nodes.size()];\\n\\t\\t\\n\\t\\tqueue.add(source);\\n\\t\\tvisited[source]=true;\\n\\t\\t\\n\\t\\twhile(!queue.isEmpty()) {\\n\\t\\t\\tint k =queue.remove();\\n\\t\\t\\tSystem.out.println(k);\\n\\t\\t\\tfor(int p : nodes.get(k)) {\\n\\t\\t\\t\\tif(!visited[p]) {\\n\\t\\t\\t\\t\\tqueue.add(p);\\n\\t\\t\\t\\t\\tvisited[p]=true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"Path run(Maze maze, Cell start, Cell finish) {\\n Path path = new Path();\\n if (start.equals(finish)) {\\n path.add(start);\\n return path;\\n }\\n Maze changed = new Maze(maze);\\n CellQueue queue = new CellQueueLinkedListImpl();\\n queue.enqueue(start);\\n changed.setCellValue(start, 0);\\n Cell curCell;\\n do {\\n curCell = queue.dequeue();\\n for (int i = -1; i <= 1; i++) {\\n for (int j = -1; j <= 1; j++) {\\n for (int k = -1; k <= 1; k++) {\\n Cell curNeighbour = new Cell(curCell.x + i, curCell.y + j, curCell.z + k);\\n //check that curNeighbour exists and empty\\n if (changed.getCellValue(curNeighbour) == -1) {\\n changed.setCellValue(curNeighbour, changed.getCellValue(curCell) + 1);\\n queue.enqueue(curNeighbour);\\n }\\n }\\n }\\n }\\n } while (!queue.isEmpty() && !curCell.equals(finish));\\n if (!curCell.equals(finish)) {\\n return path;\\n }\\n while (!curCell.equals(start)) {\\n path.addBegin(curCell);\\n int curPathIndex = changed.getCellValue(curCell);\\n boolean foundPrev = false;\\n for (int i = -1; i <= 1 && !foundPrev; i++) {\\n for (int j = -1; j <= 1 && !foundPrev; j++) {\\n for (int k = -1; k <= 1 && !foundPrev; k++) {\\n Cell curNeighbour = new Cell(curCell.x + i, curCell.y + j, curCell.z + k);\\n if (changed.getCellValue(curNeighbour) == changed.getCellValue(curCell) - 1) {\\n curCell = curNeighbour;\\n foundPrev = true;\\n }\\n }\\n }\\n }\\n }\\n path.addBegin(start);\\n return path;\\n }\",\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 \"public static int bfs() {\\r\\n check = new int[N][N]; // check 변수 초기화\\r\\n q = new LinkedList<Point>();\\t\\t\\t\\t\\t//bfs 할때 필요한 그 stack. first in first out\\r\\n q.offer(new Point(shark.x, shark.y));\\t\\t\\t//q.offer == 해당 큐의 맨 뒤에 전달된 요소를 삽입함. list에서 list.add와 같은 말임.\\r\\n check[shark.x][shark.y] = 1;\\r\\n\\r\\n int FishCheck = 0;\\t\\t\\t\\t\\t\\t\\t\\t//the number of the fish in the sea map\\r\\n Shark fish = new Shark(N, N);\\t\\t\\t\\t\\t//new shark initiation\\r\\n loop: while (!q.isEmpty()) {\\r\\n int r = q.peek().x;\\t\\t\\t\\t\\t\\t\\t//q.peek == 해당 큐의 맨 앞에 있는(제일 먼저 저장된) 요소를 반환함\\r\\n int c = q.poll().y;\\t\\t\\t\\t\\t\\t\\t//q.poll == 해당 큐의 맨 앞에 있는(제일 먼저 저장된) 요소를 반환하고, 해당 요소를 큐에서 제거함. 만약 큐가 비어있으면 null을 반환함.\\r\\n\\r\\n for (int d = 0; d < dr.length; d++) {\\r\\n int nr = r + dr[d];\\t\\t\\t\\t\\t\\t//북(0),남(1),동(2),서(3) 순으로. nr == new row\\r\\n int nc = c + dc[d];\\t\\t\\t\\t\\t\\t//북(0),남(1),동(2),서(3) 순으로. nc == new column\\r\\n\\r\\n // 지나갈 수 있는 곳: 자신보다 큰 물고기가 없는 곳\\r\\n if (isIn(nr, nc) && check[nr][nc] == 0 && sea[nr][nc] <= shark.lv) {\\r\\n check[nr][nc] = check[r][c] + 1;\\r\\n q.offer(new Point(nr, nc));\\r\\n\\r\\n // 위치가 더 커질 경우, 더이상 확인할 필요 X\\r\\n if (FishCheck != 0 && FishCheck < check[nr][nc]) {\\r\\n break loop;\\r\\n }\\r\\n \\r\\n // 처음 먹을 수 있는 자기보다 물고기가 발견 되었을 때\\r\\n if (0 < sea[nr][nc] && sea[nr][nc] < shark.lv && FishCheck == 0) {\\r\\n FishCheck = check[nr][nc];\\r\\n fish.x = nr;\\r\\n fish.y = nc;\\r\\n fish.lv = sea[nr][nc];\\r\\n }\\r\\n // 같은 위치에 여러 마리 있을 경우, 가장 위의 가장 왼쪽 물고기부터 먹음\\r\\n else if (FishCheck == check[nr][nc] && 0 < sea[nr][nc] && sea[nr][nc] < shark.lv) {\\r\\n if (nr < fish.x) { // 가장 위에 있는 거 우선권\\r\\n fish.x = nr;\\r\\n fish.y = nc;\\r\\n fish.lv = sea[nr][nc];\\r\\n } else if (nr == fish.x && nc < fish.y) { // 다 가장 위일 경우, 가장 왼쪽 우선권\\r\\n fish.x = nr;\\r\\n fish.y = nc;\\r\\n fish.lv = sea[nr][nc];\\r\\n }\\r\\n\\r\\n }\\r\\n\\r\\n }else if(isIn(nr, nc) && check[nr][nc] == 0) {\\r\\n check[nr][nc] = -1;\\r\\n }\\r\\n }\\r\\n }\\r\\n // idx 초과 안날 경우\\r\\n if (fish.x != N && fish.y != N) {\\r\\n eatFish(fish);\\r\\n }\\r\\n \\r\\n return (FishCheck - 1);\\r\\n }\",\n \"public String outputBreadthFirstSearch() {\\n\\n String output = \\\"\\\";\\n\\n // create a queue for BFS \\n LinkedList<TrieNode> queue = new LinkedList<>();\\n\\n queue.add(root);\\n\\n while (queue.size() != 0) {\\n // dequeue a node from queue and append to the output\\n TrieNode s = queue.poll();\\n\\n // append to the output\\n output += s;\\n\\n // get all children nodes of the dequeued node s\\n TrieNode[] children = s.offsprings;\\n for (int i = 0; i < 26; i++) {\\n TrieNode next = children[i];\\n if (next != null) {\\n queue.add(next);\\n }\\n\\n }\\n }\\n return output;\\n }\",\n \"public List<String> breadthFirstSearch(List<String> array) {\\n // Write your code here.\\n Queue<Node> queue = new ArrayDeque<>();\\n queue.add(this);\\n // breadthFirstSearch(this, queue, array);\\n while (queue.size() > 0) {\\n Node node = queue.poll();\\n array.add(node.name);\\n queue.addAll(node.children);\\n }\\n return array;\\n }\",\n \"private void resolverBFS() {\\n\\t\\tQueue<Integer> cola = new LinkedList<Integer>();\\n\\t\\tint[] vecDistancia = new int[nodos.size()];\\n\\t\\tfor (int i = 0; i < vecDistancia.length; i++) {\\n\\t\\t\\tvecDistancia[i] = -1;\\n\\t\\t\\trecorrido[i] = 0;\\n\\t\\t}\\n\\t\\tint nodoActual = 0;\\n\\t\\tcola.add(nodoActual);\\n\\t\\tvecDistancia[nodoActual] = 0;\\n\\t\\trecorrido[nodoActual] = -1;\\n\\t\\twhile (!cola.isEmpty()) {\\n\\t\\t\\tif (tieneAdyacencia(nodoActual, vecDistancia)) {\\n\\t\\t\\t\\tfor (int i = 1; i < matrizAdyacencia.length; i++) {\\n\\t\\t\\t\\t\\tif (matrizAdyacencia[nodoActual][i] != 99 && vecDistancia[i] == -1) {\\n\\t\\t\\t\\t\\t\\tcola.add(i);\\n\\t\\t\\t\\t\\t\\tvecDistancia[i] = vecDistancia[nodoActual] + 1;\\n\\t\\t\\t\\t\\t\\trecorrido[i] = nodoActual;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tcola.poll();\\n\\t\\t\\t\\tif (!cola.isEmpty()) {\\n\\t\\t\\t\\t\\tnodoActual = cola.peek();\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"void BFS(String start){\\n\\t\\tint iStart = index(start);\\n\\t\\t\\n\\t\\tFronta f = new Fronta(pocetVrcholu*2);\\n\\t\\t\\n\\t\\tvrchP[iStart].barva = 'S';\\n\\t\\tvrchP[iStart].vzdalenost = 0;\\n\\t\\t\\n\\t\\tf.vloz(start);\\n\\t\\t\\n\\t\\twhile(!f.jePrazdna()){\\n\\t\\t\\tString u = f.vyber();\\n\\t\\t\\tint indexU = index(u);\\n\\t\\t\\tint pom = 0;\\n\\t\\t\\t\\n\\t\\t\\tfor(int i = 1;i<= vrchP[indexU].pocetSousedu;i++){\\n\\t\\t\\t\\twhile(matice[indexU][pom] == 0){\\n\\t\\t\\t\\t\\tpom++;\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tint a = pom++;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(vrchP[a].barva =='B'){\\n\\t\\t\\t\\t\\tvrchP[a].barva = 'S';\\n\\t\\t\\t\\t\\tvrchP[a].vzdalenost = vrchP[indexU].vzdalenost + 1;\\n\\t\\t\\t\\t\\tvrchP[a].predchudce = u;\\n\\t\\t\\t\\t\\tf.vloz(vrchP[a].klic);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tvrchP[indexU].barva = 'C';\\n\\t\\t\\tpole.add(vrchP[indexU].klic);\\n\\t\\t}\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"public void seekWalls() {\\n\\t\\t for (int j=0; j<visited[0].length; j++){\\n\\t\\t\\tfor (int i=visited.length-1; i>=0; i--) {\\t\\t\\t\\n\\t\\t\\t\\tif (i!=0 && j!= visited[0].length-1) {//general position\\n\\t\\t\\t\\t\\tif (map.get(visited[i][j]) + map.get(visited[i-1][j]) == maxComb && !isFree(i,j,2)) {\\n\\t\\t\\t\\t\\t\\twallRow = i+1;\\n\\t\\t\\t\\t\\t\\twallCol = j+1;\\n\\t\\t\\t\\t\\t\\twallSide = 'N';\\n\\t\\t\\t\\t\\t\\treturn;//not break!!!!! return to exit !\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tif (map.get(visited[i][j]) + map.get(visited[i][j+1]) == maxComb && !isFree(i,j,4)) {\\n\\t\\t\\t\\t\\t\\twallRow = i+1;\\n\\t\\t\\t\\t\\t\\twallCol = j+1;\\n\\t\\t\\t\\t\\t\\twallSide = 'E';\\t\\n\\t\\t\\t\\t\\t\\treturn;\\t\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\telse if (i==0 && j!= visited[0].length-1) {\\n\\t\\t\\t\\t\\tif (map.get(visited[i][j]) + map.get(visited[i][j+1]) == maxComb && !isFree(i,j,4)) {\\n\\t\\t\\t\\t\\t\\twallRow = i+1;\\n\\t\\t\\t\\t\\t\\twallCol = j+1;\\n\\t\\t\\t\\t\\t\\twallSide = 'E';\\t\\n\\t\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\telse if (i!=0 && j== visited[0].length-1) {\\n\\t\\t\\t\\t\\tif (map.get(visited[i][j]) + map.get(visited[i-1][j]) == maxComb && !isFree(i,j,2)) {\\n\\t\\t\\t\\t\\t\\twallRow = i+1;\\n\\t\\t\\t\\t\\t\\twallCol = j+1;\\n\\t\\t\\t\\t\\t\\twallSide = 'N';\\n\\t\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {//if (i==0 && j== visited[0].length-1) {\\n\\t\\t\\t\\t\\t//no solution\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"public abstract List<Direction> searchForCheese(Maze maze);\",\n \"public static void findShortestPath(char[][] maze) {\\n\\t\\tboolean visited[][] = new boolean[maze.length][maze[0].length]; \\n\\t\\tint srcX = 0, srcY = 0;\\n\\t\\t// find the source\\n\\t\\tfor(int i=0; i<maze.length; i++) {\\n\\t\\t\\tfor(int j=0; j<maze[0].length; j++) {\\n\\t\\t\\t\\tif(maze[i][j] == 's') {\\n\\t\\t\\t\\t\\tsrcX = i; srcY=j;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tboolean pe = doGridBFS(maze,visited,srcX,srcY);\\n\\t\\tSystem.out.println(pe);\\n\\t\\t\\n\\t}\",\n \"private void BFS() {\\n\\n int fruitIndex = vertices.size()-1;\\n Queue<GraphNode> bfsQueue = new LinkedList<>();\\n bfsQueue.add(vertices.get(0));\\n while (!bfsQueue.isEmpty()) {\\n GraphNode pollNode = bfsQueue.poll();\\n pollNode.setSeen(true);\\n for (GraphNode node : vertices) {\\n if (node.isSeen()) {\\n continue;\\n } else if (node.getID() == pollNode.getID()) {\\n continue;\\n } else if (!los.isIntersects(pollNode.getPoint(), node.getPoint())) {\\n pollNode.getNeigbours().add(node);\\n if (node.getID() != fruitIndex) {\\n bfsQueue.add(node);\\n node.setSeen(true);\\n }\\n }\\n }\\n }\\n }\",\n \"private void bfs(Dungeon d, Site s) {\\n\\t\\t\\n\\t\\t// use a queue to do BFS, and initialize instance variables\\n\\t\\tQueue<Site> q = new LinkedList<Site>();\\n\\t\\tfor (int x = 0; x < d.size(); x++)\\n\\t\\t\\tfor (int y = 0; y < d.size(); y++)\\n\\t\\t\\t\\tdistTo[x][y] = INFINITY; \\n\\t\\tdistTo[s.getX()][s.getY()] = 0;\\n\\t\\tmarked[s.getX()][s.getY()] = true;\\n\\t\\t\\n\\t\\t// pop site from queue until it's empty\\n\\t\\tq.offer(s);\\n\\t\\twhile (!q.isEmpty()) {\\n\\t\\t\\t\\n\\t\\t\\t// pop the next site in the queue\\n\\t\\t\\tSite v = q.poll(); \\t \\n\\t\\t\\tint x = v.getX();\\n\\t\\t\\tint y = v.getY();\\n\\n\\t\\t\\t// 4 adjacent sites\\n\\t\\t\\tSite east = new Site(x + 1, y);\\n\\t\\t\\tSite west = new Site(x - 1, y);\\n\\t\\t\\tSite north = new Site(x, y - 1);\\n\\t\\t\\tSite south = new Site(x, y + 1);\\n\\n\\t\\t\\t// BFS the rest of the dungeon\\n\\t\\t\\tif (d.isLegalMove(v, east) && !marked[east.getX()][east.getY()]) {\\n\\t\\t\\t\\tedgeTo[east.getX()][east.getY()] = v;\\n\\t\\t\\t\\tdistTo[east.getX()][east.getY()] = distTo[x][y] + 1;\\n\\t\\t\\t\\tmarked[east.getX()][east.getY()] = true;\\n\\t\\t\\t\\tq.offer(east);\\n\\t\\t\\t}\\n\\t\\t\\tif (d.isLegalMove(v, west) && !marked[west.getX()][west.getY()]) {\\n\\t\\t\\t\\tedgeTo[west.getX()][west.getY()] = v;\\n\\t\\t\\t\\tdistTo[west.getX()][west.getY()] = distTo[x][y] + 1;\\n\\t\\t\\t\\tmarked[west.getX()][west.getY()] = true;\\n\\t\\t\\t\\tq.offer(west);\\n\\t\\t\\t}\\n\\t\\t\\tif (d.isLegalMove(v, north) && !marked[north.getX()][north.getY()]) {\\n\\t\\t\\t\\tedgeTo[north.getX()][north.getY()] = v;\\n\\t\\t\\t\\tdistTo[north.getX()][north.getY()] = distTo[x][y] + 1;\\n\\t\\t\\t\\tmarked[north.getX()][north.getY()] = true;\\n\\t\\t\\t\\tq.offer(north);\\n\\t\\t\\t}\\n\\t\\t\\tif (d.isLegalMove(v, south) && !marked[south.getX()][south.getY()]) {\\n\\t\\t\\t\\tedgeTo[south.getX()][south.getY()] = v;\\n\\t\\t\\t\\tdistTo[south.getX()][south.getY()] = distTo[x][y] + 1;\\n\\t\\t\\t\\tmarked[south.getX()][south.getY()] = true;\\n\\t\\t\\t\\tq.offer(south);\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t}\",\n \"public Stack<Integer> dfs(Maze tmp) {\\n \\n int tmpx = tmp.positionX();\\n int tmpy = tmp.positionY();\\n Stack<Integer> s = new Stack<Integer>();\\n while (!tmp.gameOver()) {\\n choosedirection(s, tmp);\\n while (!s.isEmpty() && !tmp.gameOver()) {\\n if (s.peek() == 0) {\\n if (tmp.right()) {\\n s.push(1);\\n } else if (tmp.up()) {\\n s.push(0);\\n } else if (tmp.left()) {\\n s.push(3);\\n } else {\\n this.stackpop(s, tmp);\\n }\\n } else if (s.peek() == 1) {\\n if (tmp.down()) {\\n s.push(2);\\n } else if (tmp.right()) {\\n s.push(1);\\n } else if (tmp.up()) {\\n s.push(0);\\n } else {\\n this.stackpop(s, tmp);\\n }\\n } else if (s.peek() == 2) {\\n if (tmp.left()) {\\n s.push(3);\\n } else if (tmp.down()) {\\n s.push(2);\\n } else if (tmp.right()) {\\n s.push(1);\\n } else {\\n this.stackpop(s, tmp);\\n }\\n } else if (s.peek() == 3) {\\n if (tmp.up()) {\\n s.push(0);\\n } else if (tmp.left()) {\\n s.push(3);\\n } else if (tmp.down()) {\\n s.push(2);\\n } else {\\n this.stackpop(s, tmp);\\n }\\n\\n }\\n\\n }\\n }\\n\\n Stack<Integer> stack = new Stack<Integer>();\\n while (!s.isEmpty()) {\\n stack.push(s.pop());\\n }\\n\\n tmp.setLocation(tmpx, tmpy);\\n return stack;\\n\\n }\",\n \"void BFS(int s, int d) \\r\\n { \\r\\n int source = s;\\r\\n int destination = d;\\r\\n boolean visited[] = new boolean[V];\\r\\n int parent[] = new int[V];\\r\\n \\r\\n // Create a queue for BFS \\r\\n LinkedList<Integer> queue = new LinkedList<Integer>(); \\r\\n \\r\\n // Mark the current node as visited and enqueue it \\r\\n \\r\\n visited[s]=true; \\r\\n queue.add(s); \\r\\n System.out.println(\\\"Search Nodes: \\\");\\r\\n while (queue.size() != 0) \\r\\n { \\r\\n int index = 0;\\r\\n \\r\\n // Dequeue a vertex from queue and print it \\r\\n \\r\\n s = queue.poll();\\r\\n \\r\\n System.out.print(convert2(s)); \\r\\n \\r\\n if(s == destination)\\r\\n {\\r\\n break;\\r\\n }\\r\\n \\r\\n System.out.print(\\\" -> \\\");\\r\\n while(index < adj[s].size()) \\r\\n { \\r\\n \\r\\n \\r\\n int n = adj[s].get(index); \\r\\n if (!visited[n]) \\r\\n { \\r\\n visited[n] = true;\\r\\n parent[n] = s;\\r\\n queue.add(n); \\r\\n }\\r\\n index = index+ 2;\\r\\n \\r\\n \\r\\n }\\r\\n \\r\\n \\r\\n \\r\\n }\\r\\n int check = destination;\\r\\n int cost = 0, first, second = 0;\\r\\n String string = \\\"\\\" + convert2(check);\\r\\n while(check!=source)\\r\\n {\\r\\n \\r\\n first = parent[check];\\r\\n string = convert2(first) + \\\" -> \\\" + string;\\r\\n while(adj[first].get(second) != check)\\r\\n {\\r\\n second++;\\r\\n }\\r\\n cost = cost + adj[first].get(second +1);\\r\\n check = first;\\r\\n second = 0;\\r\\n \\r\\n }\\r\\n \\r\\n System.out.println(\\\"\\\\n\\\\nPathway: \\\");\\r\\n \\r\\n System.out.println(string);\\r\\n \\r\\n \\r\\n System.out.println(\\\"\\\\nTotal cost: \\\" + cost);\\r\\n }\",\n \"static int BFS(int mat[][], Point src,\\n\\t\\t\\t\\t\\t\\t\\tPoint dest)\\n{\\n\\t// check source and destination cell\\n\\t// of the matrix have value 1\\n\\tif (mat[src.x][src.y] != 1 ||\\n\\t\\tmat[dest.x][dest.y] != 1)\\n\\t\\treturn -1;\\n\\n\\tboolean [][]visited = new boolean[ROW][COL];\\n\\t\\n\\t// Mark the source cell as visited\\n\\tvisited[src.x][src.y] = true;\\n\\n\\t// Create a queue for BFS\\n\\tQueue<queueNode> q = new LinkedList<>();\\n\\t\\n\\t// Distance of source cell is 0\\n\\tqueueNode s = new queueNode(src, 0);\\n\\tq.add(s); // Enqueue source cell\\n\\n\\t// Do a BFS starting from source cell\\n\\twhile (!q.isEmpty())\\n\\t{\\n\\t\\tqueueNode curr = q.peek();\\n\\t\\tPoint pt = curr.pt;\\n\\n\\t\\t// If we have reached the destination cell,\\n\\t\\t// we are done\\n\\t\\tif (pt.x == dest.x && pt.y == dest.y)\\n\\t\\t\\treturn curr.dist;\\n\\n\\t\\t// Otherwise dequeue the front cell\\n\\t\\t// in the queue and enqueue\\n\\t\\t// its adjacent cells\\n\\t\\tq.remove();\\n\\n\\t\\tfor (int i = 0; i < 4; i++)\\n\\t\\t{\\n\\t\\t\\tint row = pt.x + rowNum[i];\\n\\t\\t\\tint col = pt.y + colNum[i];\\n\\t\\t\\t\\n\\t\\t\\t// if adjacent cell is valid, has path\\n\\t\\t\\t// and not visited yet, enqueue it.\\n\\t\\t\\tif (isValid(row, col) &&\\n\\t\\t\\t\\t\\tmat[row][col] == 1 &&\\n\\t\\t\\t\\t\\t!visited[row][col])\\n\\t\\t\\t{\\n\\t\\t\\t\\t// mark cell as visited and enqueue it\\n\\t\\t\\t\\tvisited[row][col] = true;\\n\\t\\t\\t\\tqueueNode Adjcell = new queueNode\\n\\t\\t\\t\\t\\t\\t\\t(new Point(row, col),\\n\\t\\t\\t\\t\\t\\t\\t\\tcurr.dist + 1 );\\n\\t\\t\\t\\tq.add(Adjcell);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// Return -1 if destination cannot be reached\\n\\treturn -1;\\n}\",\n \"public static void main(String[] args) {\\n\\t\\tScanner scan = new Scanner(System.in);\\n\\t\\tQueue<maze> q = new LinkedList<>();\\n\\t\\tint N = scan.nextInt();\\n\\t\\tint M = scan.nextInt();\\n\\t\\tint output = 0;\\n\\t\\tscan.nextLine();\\n\\t\\tint arr[][] = new int[N][M];\\n\\t\\tint isVisit[][] = new int[N][M];\\n\\t\\tisVisit[0][0] = 1;\\n\\t\\tfor(int i=0;i<N;i++)\\n\\t\\t{\\n\\t\\t\\tString line = scan.nextLine();\\n\\t\\t\\tfor(int j=0;j<M;j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tarr[i][j] = line.charAt(j) - '0';\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tq.add(new maze(0, 0, 1));\\n\\t\\twhile(!q.isEmpty())\\n\\t\\t{\\n\\t\\t\\tmaze temp = q.poll();\\n\\t\\t\\tif(temp.x == M-1 && temp.y == N-1)\\n\\t\\t\\t{\\n\\t\\t\\t\\toutput = temp.block;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\tfor(int i=0;i<4;i++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tint x = temp.x + dx[i];\\n\\t\\t\\t\\tint y = temp.y + dy[i];\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(0 <= x && x < M && 0 <= y && y < N && arr[y][x] == 1 && isVisit[y][x] == 0)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tq.add(new maze(x, y, (temp.block + 1)));\\n\\t\\t\\t\\t\\tisVisit[y][x] = 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tSystem.out.println(output);\\n\\t}\",\n \"public void generate_maze()\\n\\t{\\n\\t\\tint i, j, r, c;\\n\\n\\t\\t// choose a cell at random and make it the current cell\\n\\t\\tRandom rand = new Random(666);\\n\\t\\tr = (int)(rand.nextFloat() * (ROWS - 1));\\n\\t\\tc = (int)(rand.nextFloat() * (COLS - 1));\\n\\t\\tint[] curr = {r,c}; // current search location\\n\\t\\tint visited = 1;\\n\\t\\tint total = ROWS*COLS;\\n\\t\\tint tos = 0; // index for top of cell stack \\n\\n\\t\\t// arrays of single step movements between cells\\n\\t\\t// north east south west\\n\\t\\tint[][] move = {{-1, 0}, {0, 1}, {1, 0}, {0,-1}};\\n\\t\\tint[][] next = {{0, 0}, {0, 0}, {0, 0}, {0, 0}};\\n\\n\\t\\twhile (visited < total)\\n\\t\\t{\\n\\t\\t\\t// find all neighbors of current cell with all walls intact\\n\\t\\t\\tj = 0;\\n\\t\\t\\tfor (i = 0; i < 4; i++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tr = curr[0] + move[i][0];\\n\\t\\t\\t\\tc = curr[1] + move[i][1];\\n\\n\\t\\t\\t\\t// check for valid next cell\\n\\t\\t\\t\\tif ((0 <= r) && (r < ROWS) && (0 <= c) && (c < COLS))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t// check if previously visited\\n\\t\\t\\t\\t\\tif ((Maze[r][c] == 15))//N) && (Maze[r][c] == E) && (Maze[r][c] == S) && (Maze[r][c] == W))\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t// not visited, so add to possible next cells\\n\\t\\t\\t\\t\\t\\tnext[j][0] = r;\\n\\t\\t\\t\\t\\t\\tnext[j][1] = c;\\n\\t\\t\\t\\t\\t\\tj++;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif (j > 0)\\n\\t\\t\\t{\\n\\t\\t\\t\\t// current cell has one or more unvisited neighbors, so choose one at random \\n\\t\\t\\t\\t// and knock down the wall between it and the current cell\\n\\t\\t\\t\\ti = (int)(rand.nextFloat() * (j-1));\\n\\n\\t\\t\\t\\tif ((next[i][0] - curr[0]) == 0) // next on same row\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tr = next[i][0];\\n\\t\\t\\t\\t\\tif (next[i][1] > curr[1]) // move east\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tc = curr[1];\\n\\t\\t\\t\\t\\t\\tMaze[r][c] &= ~E; // clear E wall\\n\\t\\t\\t\\t\\t\\tc = next[i][1];\\n\\t\\t\\t\\t\\t\\tMaze[r][c] &= ~W; // clear W wall\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse // move west\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tc = curr[1];\\n\\t\\t\\t\\t\\t\\tMaze[r][c] &= ~W; // clear W wall\\n\\t\\t\\t\\t\\t\\tc = next[i][1];\\n\\t\\t\\t\\t\\t\\tMaze[r][c] &= ~E; // clear E wall\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse // next on same column\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tc = next[i][1];\\n\\t\\t\\t\\t\\t if (next[i][0] > curr[0]) // move south \\n\\t\\t\\t\\t\\t {\\n\\t\\t\\t\\t\\t \\tr = curr[0];\\n\\t\\t\\t\\t\\t \\tMaze[r][c] &= ~S; // clear S wall\\n\\t\\t\\t\\t\\t \\tr = next[i][0];\\n\\t\\t\\t\\t\\t \\tMaze[r][c] &= ~N; // clear N wall\\n\\t\\t\\t\\t\\t }\\n\\t\\t\\t\\t\\t else // move north\\n\\t\\t\\t\\t\\t {\\n\\t\\t\\t\\t\\t \\tr = curr[0];\\n\\t\\t\\t\\t\\t \\tMaze[r][c] &= ~N; // clear N wall\\n\\t\\t\\t\\t\\t \\tr = next[i][0];\\n\\t\\t\\t\\t\\t \\tMaze[r][c] &= ~S; // clear S wall\\n\\t\\t\\t\\t\\t }\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\ttos++; // push current cell location\\n\\t\\t\\t\\tstack.elementAt(tos)[0] = curr[0];\\n\\t\\t\\t\\tstack.elementAt(tos)[1] = curr[1];\\n\\n\\t\\t\\t\\tcurr[0] = next[i][0]; // make next cell the current cell\\n\\t\\t\\t\\tcurr[1] = next[i][1];\\n\\n\\t\\t\\t\\tvisited++; // increment count of visited cells\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\t// reached dead end, backtrack\\n\\t\\t\\t\\t// pop the most recent cell from the cell stack \\n\\t\\t\\t\\t// and make it the current cell\\n\\t\\t\\t\\tcurr[0] = stack.elementAt(tos)[0];\\n\\t\\t\\t\\tcurr[1] = stack.elementAt(tos)[1];\\n\\t\\t\\t\\ttos--;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"public static void userSelection_SolveMaze(int userInputN){\\n\\n\\t\\tint[] S = new int[(int) Math.pow(userInputN, 2)];\\n\\t\\tgNode[] G = new gNode[S.length];\\n\\n\\t\\tboolean [] visited = new boolean[S.length];\\t\\t//Initialize\\n\\t\\tfor(int i=0; i<visited.length;i++)\\n\\t\\t\\tvisited[i] = false;\\n\\n\\t\\tint [] path = new int[S.length];\\t\\t//Initialize \\n\\t\\tfor(int i=0; i<path.length; i++)\\n\\t\\t\\tpath[i]=-1;\\n\\n\\t\\tScanner input = new Scanner(System.in);\\n\\t\\tSystem.out.println(\\\"How would you like to solve the maze?\\\\n\\\"\\n\\t\\t\\t\\t+ \\\"1.\\\\tBreadth-First Search\\\\n\\\"\\n\\t\\t\\t\\t+ \\\"2.\\\\tDepth-First Search\\\\n\\\"\\n\\t\\t\\t\\t+ \\\"3.\\\\tDepth-First Search with Recursion\\\");\\n\\t\\t\\n\\t\\tint ur = input.nextInt();\\n\\t\\t\\n\\t\\tif(ur==1)\\t//Breadth-First Search\\t\\t\\\\///gNode && start @ position 0\\n\\t\\t\\tbfs(G, visited, path, 0);\\n\\t\\telse if(ur==2)\\t//Depth-First Search\\n\\t\\t\\tdfs_Stack(G, visited, path, 0);\\n\\t\\telse if(ur==3)\\t//Depth-First Search w/recursion\\t\\n\\t\\t\\tdfsRecursion(G, visited, path, 0);\\t\\n\\t\\telse{\\n\\t\\t\\tSystem.out.println(\\\"Invalid option. Please enter the appropriate integer value\\\");\\n\\t\\t\\tuserSelection_SolveMaze(userInputN);\\n\\t\\t}\\n\\t\\t\\n\\t\\tinput.close();\\n\\t}\",\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 Maze3D generate(int depth, int row, int column) throws Exception {\\n if (row < 2 || column < 2 || depth < 2)\\n throw new Exception(\\\"Invalid inputs Maze most be at least 2x2x2\\\");\\n Maze3D myMaze = new Maze3D(depth,row, column); //create an empty maze\\n for (int r = 0; r <row ; r++) { //init to 1 all the cells\\n for (int c = 0; c <column ; c++) {\\n for (int d = 0; d < depth; d++) {\\n myMaze.maze[d][r][c]= 1;\\n\\n }\\n }\\n }\\n boolean [][][] VisitedCells = new boolean[depth][row][column]; //create an boolean matrix that saved cell as visited or not\\n int randomDepth = Ran.nextInt((depth)); //select random depth number\\n int randomRow = Ran.nextInt((row)); //select random row number\\n Position3D StartPos = new Position3D(randomDepth,randomRow, 0);\\n myMaze.maze[randomDepth][randomRow][0]= 0; //change selected start position to 0\\n myMaze.setStartPosition(StartPos); //set the start position of the maze\\n changeStatus(randomDepth,randomRow,0,VisitedCells); //change Start position as visited\\n //choose random goal position cell in the maze\\n int randomDepth_2 = Ran.nextInt((depth)); //select random depth number\\n int randomRow_2 = Ran.nextInt((row)); //select random row number\\n Position3D EndPos = new Position3D(randomDepth_2,randomRow_2, (column-1));\\n myMaze.maze[randomDepth_2][randomRow_2][(column-1)]= 0; //change selected goal position to 0\\n myMaze.setGoalPosition(EndPos); //set the start position of the maze\\n changeStatus(randomDepth_2,randomRow_2,(column-1),VisitedCells);//mark as visited\\n stack.push(StartPos);\\n while (!stack.empty()) {\\n Position3D curr = stack.pop();\\n //check if the current cell have any neighbors which have not been visited, and find them all\\n ArrayList<Position3D> neighbors = findNeighbors(curr, myMaze, VisitedCells); //find all options of moving forward\\n if (neighbors.size() > 0) { //iterate over all neighbors\\n stack.push(curr); //push curr into the stack\\n myMaze.maze[curr.getDepthIndex()][curr.getRowIndex()][curr.getColumnIndex()] = 0; //change it's place to 1\\n Position3D Neighbor = ChooseNeighbor(neighbors); //choose one unvisited random neighbor\\n changeStatus(Neighbor.getDepthIndex(),Neighbor.getRowIndex(),Neighbor.getColumnIndex(), VisitedCells); //mark him as visited neighbor\\n removeWall(curr, Neighbor, VisitedCells, myMaze); //remove the wall & mark as visited\\n stack.push(Neighbor);\\n }\\n }\\n //handle odd maze problems - open the walls which surround the goal cell\\n for (int d = EndPos.getDepthIndex()-1; d < EndPos.getDepthIndex()+2; d++) {\\n for (int r = EndPos.getRowIndex()-1; r < EndPos.getRowIndex()+2; r++) {\\n for (int c = EndPos.getColumnIndex()-1; c < EndPos.getColumnIndex()+1; c++) {\\n if (pointOnGrid(d,r,c,myMaze)){\\n myMaze.maze[d][r][c]= 0; //change selected cell to 0\\n changeStatus(d,r,c,VisitedCells);\\n }\\n }}\\n }\\n return myMaze;\\n }\",\n \"public void saveMaze(File file) throws IOException {\\n PrintWriter outputFile = new PrintWriter(file);\\n\\n Cell[][] grid = maze.getGrid();\\n\\n outputFile.write(\\\"BFS\\\\n\\\");\\n\\n // Saves the original (not shortest) BFS path.\\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 outputFile.write(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 outputFile.write(currentCell.topRow());\\n }\\n }\\n outputFile.write(\\\"+\\\");\\n outputFile.write(\\\"\\\\n\\\");\\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 outputFile.write(currentCell.zeroDistanceColumn());\\n else\\n outputFile.write(currentCell.distanceColumn());\\n }\\n outputFile.write(\\\"|\\\");\\n outputFile.write(\\\"\\\\n\\\");\\n }\\n }\\n\\n // Saves the shortest BFS path.\\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 outputFile.write(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 outputFile.write(currentCell.topRow());\\n }\\n }\\n outputFile.write(\\\"+\\\");\\n outputFile.write(\\\"\\\\n\\\");\\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 outputFile.write(currentCell.zeroDistanceColumn2());\\n else if (parents.contains(currentCell))\\n outputFile.write(currentCell.zeroDistanceColumn2());\\n else\\n outputFile.write(currentCell.distanceColumn2());\\n }\\n outputFile.write(\\\"|\\\");\\n outputFile.write(\\\"\\\\n\\\");\\n }\\n }\\n // Saves the shortest path, length, and visited cells.\\n outputFile.write(\\\"Path:\\\");\\n for (Cell currentCell : parents) {\\n outputFile.write(\\\"(\\\" + currentCell.x + \\\",\\\" + currentCell.y + \\\") \\\");\\n }\\n outputFile.write(\\\"\\\\n\\\");\\n outputFile.write(\\\"Visited Cells: \\\" + visitedCells + \\\"\\\\n\\\");\\n outputFile.write(\\\"Length of Path: \\\" + parents.size() + \\\"\\\\n\\\");\\n outputFile.close();\\n\\n }\",\n \"public void next() {\\n Solver<ArrayList<Integer>> mySolver =\\n new Solver<ArrayList<Integer>>();\\n ArrayList<ArrayList<Integer>> Solution =\\n mySolver.SolveBFS(this);\\n\\n //Reset 'tried' to none\\n tried = new HashSet<ArrayList<Integer>>();\\n\\n //Set up the nextState\\n ArrayList<Integer> nextState = new ArrayList<Integer>();\\n\\n if(Solution.size() == 0) {\\n //No Solution\\n } else if (Solution.size() == 1) {\\n nextState = Solution.get(0);\\n curBoard = nextState;\\n } else {\\n nextState = Solution.get(1);\\n curBoard = nextState;\\n moveCount++;\\n }\\n clearStack();\\n\\n\\tsetChanged();\\n\\tnotifyObservers();\\n }\",\n \"private void solve(int x, int y, boolean draw) {\\n \\t\\t// these are the walls of the maze, maze solver should not go beyond\\n \\t\\t// walls\\n \\t\\t// if (x == 0 || y == 0 || x == N + 1 || y == N + 1) {\\n \\t\\t// return;\\n \\t\\t// }\\n \\n \\t\\t// if we have already visited this position\\n \\t\\t// or if deep levels of the recursion have found the target\\n \\t\\tif (foundTarget || visited[x][y])\\n \\t\\t\\treturn;\\n \\n \\t\\t// this position is new, mark it as visited\\n \\t\\tvisited[x][y] = true;\\n \\n \\t\\tif (draw) {\\n \\t\\t\\t// Draw a blue dot to show we have been here\\n \\t\\t\\tStdDraw.setPenColor(StdDraw.BLUE);\\n \\t\\t\\tStdDraw.filledCircle(x + 0.5, y + 0.5, 0.25);\\n \\t\\t\\tStdDraw.show(SOLVER_SPEED);\\n \\t\\t}\\n \\n \\t\\t// if we have reached the maze solve target\\n \\t\\tif (x == target.x && y == target.y) {\\n \\t\\t\\tfoundTarget = true;\\n \\t\\t}\\n \\n \\t\\t// Try go another place\\n \\t\\tif (!north[x][y])\\n \\t\\t\\tsolve(x, y + 1, draw);\\n \\t\\tif (!east[x][y])\\n \\t\\t\\tsolve(x + 1, y, draw);\\n \\t\\tif (!south[x][y])\\n \\t\\t\\tsolve(x, y - 1, draw);\\n \\t\\tif (!west[x][y])\\n \\t\\t\\tsolve(x - 1, y, draw);\\n \\n \\t\\tif (foundTarget)\\n \\t\\t\\treturn;\\n \\n \\t\\tif (draw) {\\n \\t\\t\\t// Draw a grey dot to show we have backtracked\\n \\t\\t\\tStdDraw.setPenColor(StdDraw.GRAY);\\n \\t\\t\\tStdDraw.filledCircle(x + 0.5, y + 0.5, 0.25);\\n \\t\\t\\tStdDraw.show(SOLVER_SPEED);\\n \\t\\t}\\n \\t}\",\n \"public void breadthFirstSearch(int vertexIndex) {\\n Queue<Integer> queue = new LinkedList<Integer>();\\n vertexList[vertexIndex].wasVisited = true;\\n displayVertex(vertexIndex);\\n int unvisitedIndex;\\n do {\\n\\n do {\\n unvisitedIndex = getAdjacentUnvisitedVertexIndex(vertexIndex);\\n if(unvisitedIndex != -1) {\\n vertexList[unvisitedIndex].wasVisited = true;\\n displayVertex(unvisitedIndex);\\n queue.add(unvisitedIndex);\\n\\n }\\n } while(unvisitedIndex != -1);\\n if(!queue.isEmpty()) {\\n vertexIndex = queue.remove();\\n\\n }\\n\\n } while(!queue.isEmpty());\\n\\n for (int i = 0; i < vertexCount; i++) {\\n vertexList[i].wasVisited = false;\\n\\n }\\n }\",\n \"int main()\\n{\\n // Create a graph given in the above diagram\\n Graph g(4);\\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 cout << \\\"Following is Breadth First Traversal \\\"\\n << \\\"(starting from vertex 2) n\\\";\\n g.BFS(2);\\n \\n return 0;\\n}\",\n \"public static void main(String[] args) {\\n\\t\\tint[][] m= { {197,130,139,188},{20,24,167,182},{108,78,169,193},{184,65,83,41} };\\r\\n\\t\\tint[][] m2= {{149,77,42,136},\\r\\n\\t\\t\\t\\t{145,155,45,0},\\r\\n\\t\\t\\t\\t{136,102,182,87},\\r\\n\\t\\t\\t\\t{178,183,143,60}};\\r\\n\\t\\tfor (int[] is : m2) {\\r\\n\\t\\t\\tfor (int is2 : is) {\\r\\n\\t\\t\\t\\tSystem.out.print(is2+\\\",\\\");\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tSystem.out.println(\\\"\\\\n\\\");\\r\\n\\t\\t}\\r\\n\\t\\tSearchable matrix=new Matrix(m2,new MatrixState(\\\"0,0\\\"),new MatrixState(\\\"3,3\\\"));\\r\\n\\t\\tSearcher<String> sol=new BFS<>();\\r\\n\\t\\tSystem.out.println(sol.search(matrix));\\r\\n\\t}\",\n \"public static void BFS(char[][] board, int y, int x){\\n \\tint[] offsetX = {-1,0,1,0};\\n \\tint[] offsetY = {0, -1, 0, 1};\\n \\tQueue<pair> que = new LinkedList<pair>();\\n \\tque.add(new pair(x,y));\\n \\twhile(!que.isEmpty()){\\n \\t\\tpair p = que.poll();\\n \\t \\tif (board[p.y][p.x] == 'D'){\\n\\t continue;\\n \\t \\t}\\n \\t\\t//System.out.println(p.x);\\n \\t\\t//System.out.println(p.y);\\n \\t \\tboard[p.y][p.x] = 'D';\\t \\t\\n \\t \\tfor(int i = 0; i < offsetX.length; i++){\\n \\t \\t\\tif(p.x + offsetX[i] >= 0 &&p.x+offsetX[i] < board[0].length&& p.y + offsetY[i] >= 0 &&p.y+offsetY[i] < board.length\\n \\t \\t\\t\\t\\t&& board[p.y+offsetY[i]][p.x+offsetX[i]] == 'O'){\\n \\t \\t\\t\\tque.add(new pair(p.x+offsetX[i], p.y+offsetY[i]));\\n \\t \\t\\t}\\n \\t \\t}\\n \\t}\\n \\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 \"private static void BFS(int[][] adjacencyMatrix) {\\n\\t\\tint n = adjacencyMatrix.length;\\n\\t\\tboolean visited[] = new boolean[n];\\n\\t\\tfor(int i=0;i<n;i++) {\\n\\t\\t\\tif(!visited[i]) {\\n\\t\\t\\tprintBFS(adjacencyMatrix,i,visited);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\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 BFS() {\\r\\n\\t\\tQueue queue = new Queue();\\r\\n\\t\\tqueue.enqueue(this.currentVertex);\\r\\n\\t\\tcurrentVertex.printVertex();\\r\\n\\t\\tcurrentVertex.visited = true;\\r\\n\\t\\twhile (!queue.isEmpty()) {\\r\\n\\t\\t\\tVertex vertex = (Vertex) queue.dequeue();\\r\\n\\t\\t\\tVertex child = null;\\r\\n\\t\\t\\twhile ((child = getUnvisitedChildVertex(vertex)) != null) {\\r\\n\\t\\t\\t\\tchild.visited = true;\\r\\n\\t\\t\\t\\tchild.printVertex();\\r\\n\\t\\t\\t\\tqueue.enqueue(child);\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\tclearVertexNodes();\\r\\n\\t\\tprintLine();\\r\\n\\t}\",\n \"public void solveMaze( int x0, int y0, int x1, int y1 ) {\\n visited = new boolean[rows+1][cols+1];\\n solve(x0, y0, x1, y1);\\n }\",\n \"void Graph::BFS(int s)\\n{\\n bool *visited = new bool[V];\\n for(int i = 0; i < V; i++)\\n visited[i] = false;\\n \\n // Create a queue for BFS\\n list<int> queue;\\n \\n // Mark the current node as visited and enqueue it\\n visited[s] = true;\\n queue.push_back(s);\\n \\n // 'i' will be used to get all adjacent vertices of a vertex\\n list<int>::iterator i;\\n \\n while(!queue.empty())\\n {\\n // Dequeue a vertex from queue and print it\\n s = queue.front();\\n cout << s << \\\" \\\";\\n queue.pop_front();\\n \\n // Get all adjacent vertices of the dequeued vertex s\\n // If a adjacent has not been visited, then mark it visited\\n // and enqueue it\\n for(i = adj[s].begin(); i != adj[s].end(); ++i)\\n {\\n if(!visited[*i])\\n {\\n visited[*i] = true;\\n queue.push_back(*i);\\n }\\n }\\n }\",\n \"public boolean breadthFirstSearch(int vertexA, int vertexB, HashMap<Integer, ArrayList<Integer>> adjMapList) {\\n\\t\\tQueue<Integer> queue = new LinkedList<Integer>();\\n\\t\\tHashSet<Integer> visited = new HashSet<Integer>();\\n\\t\\tqueue.add(vertexA);\\n\\t\\tvisited.add(vertexA);\\n\\t\\twhile (!queue.isEmpty()) {\\n\\t\\t\\tInteger curr = queue.remove();\\n\\t\\t\\tif (curr == vertexB) {\\n\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t\\tArrayList<Integer> neighbors = adjMapList.get(curr);\\n\\t\\t\\tfor (Integer vertex : neighbors) {\\n\\t\\t\\t\\tif (!visited.contains(vertex)) {\\n\\t\\t\\t\\t\\tvisited.add(vertex);\\n\\t\\t\\t\\t\\tqueue.add(vertex);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn false;\\n\\t}\",\n \"public void createMaze(int rows, int cols) {\\n\\t\\t\\n\\t\\tint total = rows*cols;\\n\\t\\tDisjSets ds = new DisjSets(total); //Create an object of the disjoint set class\\n\\t\\t \\n\\t\\tList<List<Node>> maze = new ArrayList<List<Node>>();\\n\\t\\t \\n\\t\\tmaze = initializeMaze(rows, cols, maze); //Initialize the maze\\n\\t\\t \\n\\t\\tRandom rand = new Random();\\n\\t\\t \\n\\t\\twhile(ds.find(0) != ds.find(total - 1)) {\\n\\t\\t\\t \\n\\t\\t\\tint currRow = rand.nextInt(rows); //Random row number\\n\\t\\t\\tint currCol = rand.nextInt(cols); //Random column number\\n\\t\\t\\tNode currNode = maze.get(currRow).get(currCol); //Current node(cell)\\n\\t\\t\\tint currValue = currNode.value;\\n\\t\\t\\t \\n\\t\\t\\tint root1 = ds.find(currValue); //Find on current node(cell)\\n\\t\\t\\tint root2;\\n\\t\\t\\tboolean removeHorizontal = false;\\n\\t\\t\\t \\n\\t\\t\\tif(currValue == total - 1) {\\n\\t\\t\\t\\tcontinue; //Don't do anything if the current cell is the bottom-rightmost cell\\n\\t\\t\\t}\\n\\t\\t\\t \\n\\t\\t\\tif(currRow == rows - 1) {\\n\\t\\t\\t\\t//Last row -- can only break the right wall, can't break the wall to the bottom \\n\\t\\t\\t\\troot2 = ds.find(currValue + 1);\\n\\t\\t\\t} else if(currCol == cols - 1) {\\n\\t\\t\\t\\t//Last column -- can only break the wall to the bottom, can't break the right wall \\n\\t\\t\\t\\troot2 = ds.find(currValue + cols);\\n\\t\\t\\t\\tremoveHorizontal = true;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\t//Neither last row nor last column\\n\\t\\t\\t\\t//Randomly select either right wall or wall to the bottom to break\\n\\t\\t\\t\\tboolean selectRight;\\n\\t\\t\\t\\tselectRight = rand.nextBoolean();\\n\\t\\t\\t\\t \\n\\t\\t\\t\\tif(selectRight) {\\n\\t\\t\\t\\t\\troot2 = ds.find(currValue + 1);\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\troot2 = ds.find(currValue + cols);\\n\\t\\t\\t\\t\\tremoveHorizontal = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t//Finds resulted in different sets\\n\\t\\t\\tif(root1 != root2) {\\n\\t\\t\\t\\t \\n\\t\\t\\t\\tds.union(root1, root2); //Take union of the two sets\\n\\t\\t\\t\\t \\n\\t\\t\\t\\tif(removeHorizontal) {\\n\\t\\t\\t\\t\\tcurrNode.horizontal = false; //Break the horizontal wall\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tcurrNode.vertical = false; //Break the vertical wall\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t//Leave the bottom right corner open\\n\\t\\tNode destination = maze.get(rows - 1).get(cols - 1);\\n\\t\\tdestination.horizontal = false;\\n\\t\\tdestination.vertical = false;\\n\\t\\t \\n\\t\\tprintMaze(rows, cols, maze); //Print the final maze\\n\\t}\",\n \"public void breadthFirst(Vertex[] vertices ){\\n\\t\\t\\n\\t\\tVertex temp = vertices[0];\\n\\t\\ttemp.state=1; //for tracking the visited nodes, visited/discovered A\\n\\t\\tboolean[] seen = new boolean[vertices.length];\\n\\t\\tQueue<Vertex> q = new LinkedList<Vertex>(); //queue for breadth first traversal\\n\\t\\t\\n\\t\\tq.add(temp); //root node added to queue\\n\\t\\tseen[0] = true;\\n\\t\\tSystem.out.println(\\\"Begin breadth first traversal: \\\\n\\\" + \\n\\t\\t\\t\\tq.toString());\\n\\t\\t\\t\\t\\n\\t\\tfor (int i = 0; i < vertices.length; i++){\\n\\t\\t\\ttemp = vertices[i];\\n\\t\\t\\twhile (!q.isEmpty() ) {\\n\\t Vertex v = q.remove();\\n\\t for (int j : v.neighbors) {\\n\\t if (!seen[j]) {\\n\\t q.add(vertices[j]);\\n\\t seen[j] = true;\\n\\t vertices[j].state=1;\\n\\t }\\n\\t }\\n\\t System.out.println(q.toString());\\n \\t}\\n\\t\\t}\\n\\t}\",\n \"public static boolean Traversal_DFS(int row, int col, int[][] maze)\\r\\n {\\n if (isASolution(row, col))\\r\\n {\\r\\n maze[row][col] = 3;\\r\\n return true;\\r\\n }\\r\\n\\r\\n // otherwise, mark the cell as visited and process its children.\\r\\n maze[row][col] = 2;\\r\\n if (canMove(row,col-1, maze) && Traversal_DFS(row,col-1, maze))\\r\\n {\\r\\n \\t// mark this as success.\\r\\n maze[row][col-1] = 3;\\r\\n return true;\\r\\n }\\r\\n if (canMove(row,col+1, maze))\\r\\n {\\r\\n // move right\\r\\n if (Traversal_DFS(row,col+1, maze))\\r\\n {\\r\\n \\tmaze[row][col+1] = 3;\\r\\n return true;\\r\\n }\\r\\n }\\r\\n if (canMove(row-1,col, maze))\\r\\n {\\r\\n // move up\\r\\n if (Traversal_DFS(row-1,col, maze))\\r\\n {\\r\\n \\tmaze[row-1][col] = 3;\\r\\n return true;\\r\\n }\\r\\n }\\r\\n if (canMove(row+1,col, maze))\\r\\n {\\r\\n // move down\\r\\n if (Traversal_DFS(row+1,col, maze))\\r\\n {\\r\\n \\tmaze[row+1][col] = 3;\\r\\n return true;\\r\\n }\\r\\n }\\r\\n // Failure, unmark the cell and return false\\r\\n maze[row][col] = 0;\\r\\n return false;\\r\\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 \"void BFS(int s)\\n {\\n /* List of visited vertices; all false in the beginning) */\\n boolean visited[] = new boolean[V];\\n\\n /* Queue data structure is used for BFS */\\n LinkedList<Integer> queue = new LinkedList<>();\\n\\n /* Mark starting node s as visited and enqueue it */\\n visited[s]=true;\\n queue.add(s);\\n\\n /* Until queue is empty, dequeue a single node in queue and look for it's neighboring vertices.\\n * If an adjecent node hasn't been visited yet, set it as visited and enqueue this node. s*/\\n while (queue.size() != 0)\\n {\\n /* Dequeue */\\n s = queue.poll();\\n System.out.print( s + \\\" \\\");\\n\\n /* Get all adjacent vertices */\\n Iterator<Integer> i = adj[s].listIterator();\\n while (i.hasNext())\\n {\\n int n = i.next();\\n if (!visited[n])\\n {\\n visited[n] = true;\\n queue.add(n);\\n }\\n }\\n }\\n }\",\n \"protected boolean solve(int currentRow, int currentColumn) {\\n \\tint currentBlock = m.maze[currentRow][currentColumn];\\t\\t\\t\\t\\t\\t\\t// get the current block that we are on\\r\\n \\t\\r\\n if (m.isBlockEmpty(currentBlock)) {\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// make sure current block is empty\\r\\n \\tm.maze[currentRow][currentColumn] = 2; \\t\\t\\t\\t\\t\\t\\t\\t// add this block to the path as a potential solution\\r\\n repaint();\\r\\n \\r\\n m.blocksTraversed++;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// keep track of how many blocks were traversed over\\r\\n \\r\\n if (currentRow == m.rows-2 && currentColumn == m.columns-2) {\\t\\t\\t\\t// current block is bottom right, path has been found\\r\\n \\tGUI.ta.append(m.blocksTraversed + \\\" blocks were traversed while solving the maze.\\\\n\\\");\\r\\n \\tdouble percentage = (((double) m.blocksTraversed / (m.rows * m.columns))*100) * 2;\\r\\n DecimalFormat f = new DecimalFormat(\\\"##.00\\\");\\r\\n \\tGUI.ta.append(\\\"This results in \\\" + f.format(percentage) + \\\"% of the maze being traveled.\\\\n\\\");\\r\\n \\treturn true;\\r\\n }\\r\\n \\r\\n try { Thread.sleep(1); }\\r\\n catch (InterruptedException e) { }\\r\\n \\r\\n int topBlock = currentRow - 1;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// block directly above the current block\\r\\n int leftBlock = currentColumn - 1;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// block directly left of the current block\\r\\n int bottomBlock = currentRow + 1;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// block directly below the current block\\r\\n int rightBlock = currentColumn + 1;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// block directly right of the current block\\r\\n \\r\\n if (solve(topBlock, currentColumn) || solve(currentRow, leftBlock) ||\\t\\t// a solution was found\\r\\n \\tsolve(bottomBlock, currentColumn) || solve(currentRow, rightBlock))\\r\\n \\treturn true;\\r\\n \\r\\n m.maze[currentRow][currentColumn] = 4; \\t\\t\\t\\t\\t\\t\\t\\t\\t// no solution from current block so make the block visited instead\\r\\n repaint();\\r\\n \\r\\n synchronized(this) {\\r\\n try { wait(1); }\\r\\n catch (InterruptedException e) { }\\r\\n }\\r\\n }\\r\\n return false;\\r\\n }\",\n \"private boolean thereispath(Move m, Tile tile, Integer integer, Graph g, Board B) {\\n\\n boolean result = true;\\n boolean result1 = true;\\n\\n int start_dest_C = tile.COLUMN;\\n int start_dest_R = tile.ROW;\\n\\n int move_column = m.getX();\\n int move_row = m.getY();\\n\\n int TEMP = 0;\\n int TEMP_ID = 0;\\n int TEMP_ID_F = tile.id;\\n int TEMP_ID_FIRST = tile.id;\\n\\n int final_dest_R = (integer / B.width);\\n int final_dest_C = (integer % B.width);\\n\\n //System.out.println(\\\"* \\\" + tile.toString() + \\\" \\\" + integer + \\\" \\\" + m.toString());\\n\\n // Y ROW - X COLUMN\\n\\n for (int i = 0; i != 2; i++) {\\n\\n TEMP_ID_FIRST = tile.id;\\n\\n // possibility 1\\n if (i == 0) {\\n\\n\\n // first move columns\\n for (int c = 0; c != Math.abs(move_column) && result != false; c++) {\\n\\n if (c == 0) {\\n TEMP_ID_FIRST = tile.id;\\n\\n } else {\\n TEMP_ID_FIRST = B.a.get(start_dest_R).get(start_dest_C).id;\\n\\n }\\n\\n TEMP = move_column / Math.abs(move_column);\\n\\n //System.out.println(\\\"1C:\\\" + TEMP);\\n\\n //System.out.println(\\\" \\\" + TEMP_ID_FIRST + \\\" - > \\\" + (start_dest_C + TEMP));\\n\\n start_dest_C += TEMP;\\n\\n TEMP_ID = B.a.get(start_dest_R).get(start_dest_C).id;\\n\\n //System.out.println(TEMP_ID_FIRST + \\\" = \\\" + TEMP_ID);\\n\\n if (g.adj.get(TEMP_ID_FIRST).contains(TEMP_ID)) {\\n\\n // System.out.println(\\\"OK\\\");\\n\\n } else {\\n\\n result = false;\\n\\n // System.out.println(\\\"NOPE\\\");\\n\\n\\n }\\n }\\n\\n for (int r = 0; r != Math.abs(move_row) && result != false; r++) {\\n\\n TEMP_ID_FIRST = B.a.get(start_dest_R).get(start_dest_C).id;\\n\\n TEMP = move_row / Math.abs(move_row);\\n\\n //System.out.println(\\\"1R:\\\" + TEMP);\\n\\n //System.out.println(start_dest_R + \\\" - > \\\" + (start_dest_R + TEMP));\\n\\n start_dest_R += TEMP;\\n\\n TEMP_ID = B.a.get(start_dest_R).get(start_dest_C).id;\\n\\n // System.out.println(TEMP_ID_FIRST + \\\" and \\\" + TEMP_ID);\\n\\n if (g.adj.get(TEMP_ID_FIRST).contains(TEMP_ID)) {\\n\\n //System.out.println(\\\"OK\\\");\\n\\n\\n } else {\\n\\n result = false;\\n\\n //System.out.println(\\\"NOPE\\\");\\n\\n\\n }\\n }\\n\\n if (result == true) {\\n return true;\\n }\\n\\n\\n }\\n\\n TEMP_ID = 0;\\n\\n if (i == 1) {\\n\\n result = true;\\n\\n start_dest_C = tile.COLUMN;\\n start_dest_R = tile.ROW;\\n // first move row\\n for (int r = 0; r != Math.abs(move_row) && result1 != false; r++) {\\n\\n if (r == 0) {\\n TEMP_ID_FIRST = tile.id;\\n\\n } else {\\n TEMP_ID_FIRST = B.a.get(start_dest_R).get(start_dest_C).id;\\n\\n }\\n\\n TEMP_ID_FIRST = B.a.get(start_dest_R).get(start_dest_C).id;\\n\\n TEMP = move_row / Math.abs(move_row);\\n\\n //System.out.println(\\\"1R:\\\" + TEMP);\\n\\n //System.out.println(start_dest_R + \\\" - > \\\" + (start_dest_R + TEMP));\\n\\n start_dest_R += TEMP;\\n\\n TEMP_ID = B.a.get(start_dest_R).get(start_dest_C).id;\\n\\n\\n //System.out.println(TEMP_ID_FIRST + \\\" = \\\" + TEMP_ID);\\n\\n if (g.adj.get(TEMP_ID_FIRST).contains(TEMP_ID)) {\\n\\n //System.out.println(\\\"OK\\\");\\n\\n } else {\\n\\n //System.out.println(\\\"NOPE\\\");\\n\\n result = false;\\n\\n }\\n\\n\\n }\\n\\n // first move columns\\n for (int c = 0; c != Math.abs(move_column) && result1 != false; c++) {\\n\\n\\n TEMP_ID_FIRST = B.a.get(start_dest_R).get(start_dest_C).id;\\n\\n TEMP = move_column / Math.abs(move_column);\\n\\n //System.out.println(\\\"1C:\\\" + TEMP);\\n\\n //System.out.println(\\\" \\\" + TEMP_ID_FIRST + \\\" - > \\\" + (start_dest_C + TEMP));\\n\\n start_dest_C += TEMP;\\n\\n TEMP_ID = B.a.get(start_dest_R).get(start_dest_C).id;\\n\\n //System.out.println(TEMP_ID_FIRST + \\\" and \\\" + TEMP_ID);\\n\\n if (g.adj.get(TEMP_ID_FIRST).contains(TEMP_ID)) {\\n\\n //System.out.println(\\\"OK\\\");\\n\\n } else {\\n result = false;\\n\\n //System.out.println(\\\"NOPE\\\");\\n\\n\\n }\\n }\\n\\n if (result == false) {\\n return false;\\n\\n }\\n\\n\\n }\\n\\n\\n }\\n\\n\\n return true;\\n }\",\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 \"public void findShortestPath() {\\r\\n\\t\\t\\r\\n\\t\\t//Create a circular array that will store the possible next tiles in the different paths.\\r\\n\\t\\tOrderedCircularArray<MapCell> path = new OrderedCircularArray<MapCell>();\\r\\n\\t\\t\\r\\n\\t\\t//Acquire the starting cell.\\r\\n\\t\\tMapCell starting = cityMap.getStart();\\r\\n\\t\\t\\r\\n\\t\\t//This variable is to be updated continuously with the cell with the shortest distance value in the circular array.\\r\\n\\t\\tMapCell current=null;\\r\\n\\t\\t\\r\\n\\t\\t//This variable is to check if the destination has been reached, which is initially false.\\r\\n\\t\\tboolean destination = false;\\r\\n\\t\\t\\r\\n\\t\\t//Add the starting cell into the circular array, and mark it in the list.\\r\\n\\t\\tpath.insert(starting, 0);\\r\\n\\t\\t\\r\\n\\t\\tstarting.markInList(); \\r\\n\\t\\t\\r\\n\\t\\ttry {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//As long as the circular array isn't empty, and the destination hasn't been reached, run this loop.\\r\\n\\t\\t\\twhile(!path.isEmpty()&&!destination) {\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t//Take the cell with the shortest distance out of the circular array, and mark it accordingly.\\r\\n\\t\\t\\t\\tcurrent = path.getSmallest();\\r\\n\\t\\t\\t\\tcurrent.markOutList();\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tMapCell next;\\r\\n\\t\\t\\t\\tint distance;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif(current.isDestination()) {\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tdestination = true; //If the current cell is the destination, end the loop.\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tnext = nextCell(current); //Acquire the next possible neighbour of the current cell.\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t//Don't run if next is null, meaning there is no other possible neighbour in the path for the current cell.\\r\\n\\t\\t\\t\\t\\twhile(next!=null) {\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tdistance = current.getDistanceToStart() + 1;\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t//If the distance of the selected neighbouring cell is currently more than 1 more than the current cell's \\r\\n\\t\\t\\t\\t\\t\\t//distance, update the distance of the neighbouring cell. Then, set the current cell as its predecessor.\\r\\n\\t\\t\\t\\t\\t\\tif(next.getDistanceToStart()>distance) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tnext.setDistanceToStart(distance);\\r\\n\\t\\t\\t\\t\\t\\t\\tnext.setPredecessor(current);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tdistance = next.getDistanceToStart(); \\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tif(next.isMarkedInList() && distance<path.getValue(next)) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tpath.changeValue(next, distance); //If the neighbouring cell is in the circular array, but with a \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t //larger distance value than the new updated distance, change its value.\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t} else if(!next.isMarkedInList()){\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tpath.insert(next, distance); //If the neighbouring cell isn't in the circular array, add it in.\\r\\n\\t\\t\\t\\t\\t\\t\\tnext.markInList();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tnext = nextCell(current); //Look for the next possible neighbour, if any.\\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}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//Catch all the possible exceptions that might be thrown by the method calls. Print the appropriate messages.\\r\\n\\t\\t} catch (EmptyListException e) {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tSystem.out.println(e.getMessage());\\r\\n\\t\\t\\tSystem.out.println(\\\"Path finding execution stopped.\\\");\\r\\n\\t\\t\\t\\r\\n\\t\\t} catch (InvalidNeighbourIndexException e) {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tSystem.out.println(\\\"The program tried to access an invalid neighbour of a tile.\\\");\\r\\n\\t\\t\\tSystem.out.println(\\\"Path finding execution stopped.\\\");\\r\\n\\t\\t\\t\\r\\n\\t\\t} catch (InvalidDataItemException e) {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tSystem.out.println(e.getMessage());\\r\\n\\t\\t\\tSystem.out.println(\\\"Path finding execution stopped.\\\");\\r\\n\\t\\t\\t\\r\\n\\t\\t} catch (Exception e) {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tSystem.out.println(e.getMessage()+\\\" Path finding execution has stopped.\\\");\\r\\n\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\t//If a path was found, print the number of tiles in the path.\\r\\n\\t\\tif(destination) {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tSystem.out.println(\\\"Number of tiles in path: \\\" + (current.getDistanceToStart()+1));\\r\\n\\t\\t\\t\\r\\n\\t\\t} else {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tSystem.out.println(\\\"No path found.\\\"); //Otherwise, indicate that a path wasn't found.\\r\\n\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\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 \"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 Vector<PuzzleState> aStarSearch() {\\r\\n System.out.println(\\\"Starting A*\\\");\\r\\n long startTime = (new Date()).getTime();\\r\\n Vector<PuzzleState> solution = new Vector<PuzzleState>();\\r\\n HashSet<PuzzleState> closedList = new HashSet<PuzzleState>();\\r\\n PriorityQueue<PuzzleState> openList = new PriorityQueue<PuzzleState>();\\r\\n \\r\\n PuzzleState searchState = state.copy();\\r\\n searchState.prevState = null;\\r\\n searchState.depth = 0;\\r\\n openList.add(searchState);\\r\\n\\r\\n while (!openList.isEmpty() && !isGoal(searchState)) {\\r\\n searchState = openList.poll();\\r\\n if (!closedList.contains(searchState)) {\\r\\n closedList.add(searchState);\\r\\n Vector<PuzzleState> nextStates = possibleNextStates(searchState);\\r\\n for (PuzzleState s : nextStates)\\r\\n s.depth = searchState.depth + 1;\\r\\n openList.addAll(nextStates);\\r\\n }\\r\\n }\\r\\n \\r\\n // If the goal has been reached, construct the solution\\r\\n if (isGoal(searchState)) {\\r\\n for (PuzzleState s = searchState; s.prevState != null; s = s.prevState) {\\r\\n solution.add(s);\\r\\n }\\r\\n Collections.reverse(solution);\\r\\n }\\r\\n \\r\\n long endTime = (new Date()).getTime();\\r\\n System.out.println(\\\"A* search ended after \\\" + (endTime - startTime) + \\\" ms\\\");\\r\\n //for (PuzzleState s : solution)\\r\\n // System.out.println(s);\\r\\n return solution;\\r\\n }\",\n \"public boolean solveMaze(int x, int y, String direction){\\n\\n if (maze[x][y] == \\\"E\\\"){\\n solved = true;\\n return solved;\\n\\n }\\n\\n if(!(maze[x][y].equals(\\\"S\\\") || maze[x][y].equals(\\\"E\\\"))){\\n maze[x][y] = \\\"X\\\";\\n }\\n\\n if(direction != \\\"up\\\" && isReachable(x+1, y)){\\n solveMaze(x + 1, y, \\\"down\\\");\\n if(solved) return true;\\n }\\n if(direction != \\\"left\\\" && isReachable(x, y+ 1)){\\n solveMaze(x, y + 1, \\\"right\\\");\\n if(solved) return true;\\n }\\n if(direction != \\\"down\\\" && isReachable(x-1, y)){\\n solveMaze(x - 1 , y, \\\"up\\\");\\n if(solved) return true;\\n }\\n if(direction != \\\"right\\\" && isReachable(x, y -1)){\\n solveMaze(x, y - 1, \\\"left\\\");\\n if(solved) return true;\\n }\\n\\n //If cannot move, do backtracking\\n if(!solved) {\\n maze[x][y] = \\\" \\\";\\n return false;\\n }\\n\\n return false;\\n }\",\n \"public ArrayList<Integer> breadthSearch(int i, int j) {\\n markedVerts = new ArrayList<Integer>();\\n visitedVerts = new ArrayList<Integer>();\\n Queue<Integer> queue = new LinkedList<Integer>();\\n queue.add(i);\\n return new ArrayList(breadthSearch(i, j, queue, queue));\\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 \"@Override\\n public ArrayList<AState> getAllPossibleStates(AState state){\\n MazeState s = (MazeState)state;\\n ArrayList<AState> moves = new ArrayList<AState> ();\\n\\n\\n int row = s.getState().getRowIndex();\\n int col = s.getState().getColumnIndex();\\n int [][] matrix = mySearchableMaze.getMazeMatrix();\\n\\n\\n if(row+1 < matrix.length){\\n if( matrix[row+1][col]==0 ){\\n moves.add(new MazeState(new Position(row+1,col),false,s.getCost()+1));\\n\\n }\\n }\\n if(row-1 >= 0 ){\\n if( matrix[row-1][col]==0){\\n moves.add(new MazeState(new Position(row-1,col),false,s.getCost()+1));\\n\\n }\\n }\\n if(col+1 < matrix[0].length ){\\n if( matrix[row][col+1]==0 ){\\n moves.add(new MazeState(new Position(row,col+1),false,s.getCost()+1));\\n\\n }\\n }\\n if(col-1 >= 0 ){\\n if( matrix[row][col-1]==0 ){\\n moves.add(new MazeState(new Position(row,col-1),false,s.getCost()+1));\\n }\\n }\\n return moves;\\n }\",\n \"public static ArrayList<Edge> GenerateMaze(int size)\\n {\\n //Initialize\\n Size = size;\\n InitializeCells();\\n InitializeEdges();\\n stack = new Stack<Cell>();\\n\\n Cell current;\\n\\n //Algorithm\\n\\n //STEP 1: Choose 'random' cell and make it the current cell, and push it to the stack\\n\\n int rndX = RandomNum.Next(0, size);\\n int rndY = RandomNum.Next(0, size);\\n\\n current = cells[rndX][rndY];\\n stack.push(cells[rndX][rndY]);\\n cells[current.Point.X][current.Point.Y].Visited = true;\\n\\n //STEP 2: While all cells hasn't been visited\\n while (!AllCellsVisited())\\n {\\n //STEP 3: Get a random unvisited neighbour from current cell.\\n //If cell doesn't have any valid neighbours it will return null\\n Point neighbour = GetRandomNeighbour(current.Point);\\n\\n //If the current cell has a unvisited neighbour\\n if (neighbour != null)\\n {\\n RemoveEdge(current.Point, neighbour);\\n cells[neighbour.X][neighbour.Y].Visited = true;\\n current = cells[neighbour.X][neighbour.Y];\\n stack.push(current);\\n\\n }\\n\\n //If the current cell doesn't have any unvisited neighbours\\n else\\n {\\n while (true)\\n {\\n Cell pop_cell = stack.pop();\\n Point pop_neighbour = GetRandomNeighbour(pop_cell.Point);\\n\\n //If popped cell has a unvisited neighbour, break while loop\\n if (pop_neighbour != null)\\n {\\n RemoveEdge(pop_cell.Point, pop_neighbour);\\n current = cells[pop_neighbour.X][pop_neighbour.Y];\\n stack.push(cells[pop_neighbour.X][pop_neighbour.Y]);\\n cells[pop_neighbour.X][pop_neighbour.Y].Visited = true;\\n\\n break;\\n }\\n }\\n }\\n }\\n\\n return edges;\\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 void analyzeForObstacles() {\\n \\t\\n \\t\\n \\tStack<Rect> bestFound = new Stack<Rect>();//This is a stack as the algorithm moves along x linearly\\n \\tboolean[][] blackWhiteGrid = getBlackWhiteGrid();\\n \\tint[] cache = new int[grid.length];\\n \\t\\n \\twhile (true) {\\n\\t\\t\\tboolean noneFound = true;\\n\\t\\t\\t\\n\\t\\t\\tfor (int i = 0; i<cache.length; i++)\\n\\t\\t\\t\\tcache[i] = 0;\\n\\t\\t\\tfor (int llx = grid.length -1; llx >= 0; llx--) {\\n\\t\\t\\t\\tupdate_cache(blackWhiteGrid,cache, llx);\\n\\t\\t\\t\\tfor (int lly = 0; lly < grid.length; lly++) {\\n\\t\\t\\t\\t\\tRect bestOfRound = new Rect(llx,lly,llx,lly);\\n\\t\\t\\t\\t\\tint y = lly;\\n\\t\\t\\t\\t\\tint x_max = 9999;\\n\\t\\t\\t\\t\\tint x = llx;\\n\\t\\t\\t\\t\\twhile (y+1<grid.length && blackWhiteGrid[llx][y]) {\\n\\t\\t\\t\\t\\t\\ty++;\\n\\t\\t\\t\\t\\t\\tx = Math.min(llx+cache[y]-1, x_max);\\n\\t\\t\\t\\t\\t\\tx_max = x;\\n\\t\\t\\t\\t\\t\\tRect tryRect = new Rect(llx,lly-1,x,y);\\n\\t\\t\\t\\t\\t\\tif (tryRect.area() > bestOfRound.area()) {\\n\\t\\t\\t\\t\\t\\t\\tbestOfRound = tryRect;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif (bestOfRound.area() > 40) {\\n\\t\\t\\t\\t\\t\\tif (noneFound) {\\n\\t\\t\\t\\t\\t\\t\\tbestFound.push(bestOfRound);\\n\\t\\t\\t\\t\\t\\t\\tnoneFound = false;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\t\\tRect lastRect = bestFound.peek();\\n\\t\\t\\t\\t\\t\\t\\tif (lastRect.area() < bestOfRound.area()) {\\n\\t\\t\\t\\t\\t\\t\\t\\tbestFound.pop();\\n\\t\\t\\t\\t\\t\\t\\t\\tbestFound.push(bestOfRound);\\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\\tif (noneFound)\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\n\\t\\t\\tclearFoundRectangle(blackWhiteGrid, bestFound.peek());\\n \\t}\\n \\t\\n \\t//add found rectanlges\\n \\tobstacles.clear();\\n \\tobstacles.addAll(bestFound);\\n \\tSystem.out.println(\\\"Sweep done:\\\");\\n \\tfor (Rect r : bestFound){\\n \\t\\tSystem.out.println(\\\"Rect: llx=\\\" + (r.llx-400) + \\\"\\\\tlly=\\\" + (r.lly-400) + \\\"\\\\turx=\\\" + (r.urx-400) + \\\"\\\\tury=\\\" + (r.ury-400));\\n \\t\\tList<Point2D.Double> corners = new ArrayList<Point2D.Double>();\\n \\t\\tcorners.add(new Point2D.Double((r.llx-400),(r.lly-400)));\\n \\t\\tcorners.add(new Point2D.Double((r.llx-400),(r.ury-400)));\\n \\t\\tcorners.add(new Point2D.Double((r.urx-400),(r.lly-400)));\\n \\t\\tcorners.add(new Point2D.Double((r.urx-400),(r.ury-400)));\\n \\t\\tobstaclesF.add(new Obstacle(corners));\\n \\t}\\n \\t\\n \\ttoExplore.clear();\\n \\tint i = 0;\\n \\tRandom rand = new Random();\\n \\twhile (toExplore.size() < 10 && i < 1000) {\\n \\t\\tint x = rand.nextInt(grid.length);\\n \\t\\tint y = rand.nextInt(grid.length);\\n \\t\\tif (grid[x][y] == .5) {\\n \\t\\t\\ttoExplore.add(new Flag(\\\"blue\\\",x,y));\\n \\t\\t}\\n \\t}\\n }\",\n \"private static void bfs(int idx) {\\n\\t\\t\\n\\t\\tQueue<node> q =new LinkedList<node>();\\n\\t\\tq.add(new node(idx,0,\\\"\\\"));\\n\\t\\twhile (!q.isEmpty()) {\\n\\t\\t\\tnode tmp = q.poll();\\n\\t\\t\\tif(tmp.idx<0 ||tmp.idx > 200000) {\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tif(tmp.cnt> min) {\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\t\\t\\tif(tmp.idx == k) {\\n\\t\\t\\t\\tif(tmp.cnt < min) {\\n\\t\\t\\t\\t\\tmin = tmp.cnt;\\n\\t\\t\\t\\t\\tminnode = tmp;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\t\\t\\tif(!visit[tmp.idx] && tmp.idx<=100000) {\\n\\t\\t\\t\\tvisit[tmp.idx]= true;\\n\\t\\t\\t\\tq.add(new node(tmp.idx*2, tmp.cnt+1,tmp.s));\\n\\t\\t\\t\\tq.add(new node(tmp.idx-1, tmp.cnt+1,tmp.s));\\n\\t\\t\\t\\tq.add(new node(tmp.idx+1, tmp.cnt+1,tmp.s));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\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 void findNeighbours(ArrayList<int[]> visited , Grid curMap) {\\r\\n\\t\\tArrayList<int[]> visitd = visited;\\r\\n\\r\\n\\t\\t//System.out.println(\\\"FROM FIND NEIGHBOURS cur pos:\\\" +Arrays.toString(nodePos));\\r\\n\\t\\t//for(int j=0; j<visitd.size();j++) {\\r\\n\\t\\t\\t//System.out.println(\\\"FROM FIND NEIGHBOURS\\\" +Arrays.toString(visited.get(j)));\\r\\n\\t\\t\\t//System.out.println(\\\"FROM FIND NEIGHBOURS getvstd\\\" +Arrays.toString(visited.get(j)));\\r\\n\\t\\t//}\\r\\n\\t\\t//System.out.println(\\\"FROM FIND NEIGHBOURS\\\" +visited);\\r\\n\\t\\tCell left=curMap.getCell(0, 0);\\r\\n\\t\\tCell right=curMap.getCell(0, 0);\\r\\n\\t\\tCell upper=curMap.getCell(0, 0);\\r\\n\\t\\tCell down=curMap.getCell(0, 0);\\r\\n\\t\\t//the getStart() method returns x,y coordinates representing the point in x,y axes\\r\\n\\t\\t//so if either of [0] or [1] coordinate is zero then we have one less neighbor\\r\\n\\t\\tif (nodePos[1]> 0) {\\r\\n\\t\\t\\tupper=curMap.getCell(nodePos[0], nodePos[1]-1) ; \\r\\n\\t\\t}\\r\\n\\t\\tif (nodePos[1] < M-1) {\\r\\n\\t\\t\\tdown=curMap.getCell(nodePos[0], nodePos[1]+1);\\r\\n\\t\\t}\\r\\n\\t\\tif (nodePos[0] > 0) {\\r\\n\\t\\t\\tleft=curMap.getCell(nodePos[0] - 1, nodePos[1]);\\r\\n\\t\\t}\\r\\n\\t\\tif (nodePos[0] < N-1) {\\r\\n\\t\\t\\tright=curMap.getCell(nodePos[0]+1, nodePos[1]);\\r\\n\\t\\t}\\r\\n\\t\\t//for(int i=0;i<visitd.size();i++) {\\r\\n\\t\\t\\t//System.out.println(Arrays.toString(visitd.get(i)));\\t\\r\\n\\t\\t//}\\r\\n\\t\\t\\r\\n\\t\\t//check if the neighbor is wall,if its not add to the list\\r\\n\\t\\tif(nodePos[1]>0 && !upper.isWall() && (!exists(visitd,new int[] {nodePos[0], nodePos[1] - 1}))) {\\r\\n\\t\\t\\t//Node e=new Node(this , this.N , this.M , new int[] {nodePos[0], nodePos[1] - 1},curMap);\\r\\n\\t\\t\\t//if(e.getVisited()!=true) {\\r\\n\\t\\t\\tNodeChildren.add(new Node(this , this.N , this.M , new int[] {nodePos[0], nodePos[1] - 1}, curMap)); // father of the new nodes is this node\\r\\n\\t\\t\\t//}\\r\\n\\t\\t}\\r\\n\\t\\tif(nodePos[1]<M-1 &&!down.isWall() && (!exists(visitd,new int[] {nodePos[0], nodePos[1] + 1}))){\\r\\n\\t\\t\\tNodeChildren.add(new Node(this , this.N , this.M , new int[] {nodePos[0], nodePos[1] + 1}, curMap));\\r\\n\\t\\t}\\r\\n\\t\\tif(nodePos[0]>0 && !left.isWall() && (!exists(visitd,new int[] {nodePos[0] - 1, nodePos[1]}))) {\\r\\n\\t\\t\\tNodeChildren.add(new Node(this , this.N , this.M , new int[] {nodePos[0] - 1, nodePos[1]}, curMap));\\r\\n\\t\\t}\\r\\n\\t\\tif(nodePos[0]<N-1 && !right.isWall() && (!exists(visitd,new int[] {nodePos[0] + 1, nodePos[1]}))) {\\r\\n\\t\\t\\tNodeChildren.add(new Node(this , this.N , this.M , new int[] {nodePos[0] + 1, nodePos[1]}, curMap));\\r\\n\\t\\t}\\r\\n\\t\\t//for(int i=0; i<NodeChildren.size();i++) {\\r\\n\\t\\t\\t//System.out.println(\\\"Paidia sth find:\\\" + Arrays.toString(NodeChildren.get(i).getNodePos()));\\r\\n\\t\\t//}\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t}\",\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]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7508335","0.68866485","0.68606406","0.67978257","0.66566634","0.66292137","0.65918154","0.65903634","0.65882474","0.65360236","0.65073365","0.64814","0.64698815","0.6440443","0.6415154","0.6408731","0.6396683","0.63860554","0.6370794","0.6353809","0.6349445","0.6312904","0.6296358","0.62661886","0.62631387","0.62534213","0.62469435","0.62403333","0.6225974","0.6213444","0.61977106","0.6167465","0.6146993","0.6124261","0.6121719","0.60944265","0.60828996","0.6077906","0.60542434","0.6045374","0.60376674","0.6037621","0.60262376","0.6022149","0.6002093","0.6000142","0.59924877","0.59843963","0.5976791","0.5971465","0.5969985","0.59657204","0.5965074","0.5940033","0.5932746","0.5928274","0.5926114","0.58985996","0.58936304","0.58932793","0.58926606","0.5892239","0.5892066","0.58899003","0.58845353","0.5879084","0.5875978","0.5870121","0.5863265","0.58593166","0.5859013","0.5848355","0.58444244","0.58408153","0.5839636","0.58314884","0.58207226","0.58094585","0.5792003","0.57716846","0.57696134","0.57566714","0.57454336","0.57422894","0.57408506","0.5737867","0.5737217","0.5711209","0.5711187","0.57029134","0.56846654","0.56729203","0.56651396","0.56597614","0.5652935","0.56480736","0.5644433","0.56352526","0.5634778","0.56347716","0.5628621"],"string":"[\n \"0.7508335\",\n \"0.68866485\",\n \"0.68606406\",\n \"0.67978257\",\n \"0.66566634\",\n \"0.66292137\",\n \"0.65918154\",\n \"0.65903634\",\n \"0.65882474\",\n \"0.65360236\",\n \"0.65073365\",\n \"0.64814\",\n \"0.64698815\",\n \"0.6440443\",\n \"0.6415154\",\n \"0.6408731\",\n \"0.6396683\",\n \"0.63860554\",\n \"0.6370794\",\n \"0.6353809\",\n \"0.6349445\",\n \"0.6312904\",\n \"0.6296358\",\n \"0.62661886\",\n \"0.62631387\",\n \"0.62534213\",\n \"0.62469435\",\n \"0.62403333\",\n \"0.6225974\",\n \"0.6213444\",\n \"0.61977106\",\n \"0.6167465\",\n \"0.6146993\",\n \"0.6124261\",\n \"0.6121719\",\n \"0.60944265\",\n \"0.60828996\",\n \"0.6077906\",\n \"0.60542434\",\n \"0.6045374\",\n \"0.60376674\",\n \"0.6037621\",\n \"0.60262376\",\n \"0.6022149\",\n \"0.6002093\",\n \"0.6000142\",\n \"0.59924877\",\n \"0.59843963\",\n \"0.5976791\",\n \"0.5971465\",\n \"0.5969985\",\n \"0.59657204\",\n \"0.5965074\",\n \"0.5940033\",\n \"0.5932746\",\n \"0.5928274\",\n \"0.5926114\",\n \"0.58985996\",\n \"0.58936304\",\n \"0.58932793\",\n \"0.58926606\",\n \"0.5892239\",\n \"0.5892066\",\n \"0.58899003\",\n \"0.58845353\",\n \"0.5879084\",\n \"0.5875978\",\n \"0.5870121\",\n \"0.5863265\",\n \"0.58593166\",\n \"0.5859013\",\n \"0.5848355\",\n \"0.58444244\",\n \"0.58408153\",\n \"0.5839636\",\n \"0.58314884\",\n \"0.58207226\",\n \"0.58094585\",\n \"0.5792003\",\n \"0.57716846\",\n \"0.57696134\",\n \"0.57566714\",\n \"0.57454336\",\n \"0.57422894\",\n \"0.57408506\",\n \"0.5737867\",\n \"0.5737217\",\n \"0.5711209\",\n \"0.5711187\",\n \"0.57029134\",\n \"0.56846654\",\n \"0.56729203\",\n \"0.56651396\",\n \"0.56597614\",\n \"0.5652935\",\n \"0.56480736\",\n \"0.5644433\",\n \"0.56352526\",\n \"0.5634778\",\n \"0.56347716\",\n \"0.5628621\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":38184,"cells":{"query":{"kind":"string","value":"METHOD 8: DEPTHFIRST SEARCH USING A STACK This method solves the maze using breadthfirst search, this time, using a stack. It will still take in the maze"},"document":{"kind":"string","value":"public static int[] dfs_Stack(gNode[] G, boolean[] visited, int[] path, int s){\n\t\tStack <Integer> dfs = new Stack<Integer>();\n\n\t\tdfs.push(s);\n\t\tvisited[s] = true;\n\t\twhile(!dfs.isEmpty()){\n\t\t\ts = dfs.pop();\n\t\t\tfor(gNode t=G[s]; t!= null; t=t.dest){\n\t\t\t\tif(!visited[t.item]){\t\t//once an item has been visited, set it equal to true\n\t\t\t\t\tvisited[t.item] = true;\n\t\t\t\t\tpath[t.item] = s;\t\t//change the int value of the path\n\t\t\t\t\tdfs.push(t.item);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn path;\n\n\n\t}"},"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 Stack<MazePoint> DepthFirstSearch(int row, int column)\n {\n //cMaze[row][column].wasVisited()\n if(cMaze[row][column].isExit())\n {\n sPath.push(cMaze[row][column]);\n //print out the path\n PrintPath(sPath, true);\n return sPath;\n }\n else\n {\n //when not visit\n if(!cMaze[row][column].wasVisited())\n {\n if(cMaze[row][column].hasItem())\n {\n String itemName = cMaze[row][column].pickUpItem();\n Item item = new Item(itemName);\n //check if the item is in the hashmap\n if(availableItemsHashMap.get(item) != null)\n {\n inventoryList.insert(itemName);\n }\n else\n {\n cMaze[row][column].dropItem();\n }\n }\n //mark as vist\n cMaze[row][column].markVisited();\n //push into stack\n sPath.push(cMaze[row][column]);\n }\n //determine where to traverse next (S, E, W, N)\n //recursively\n if(cMaze[row+1][column].canBeNavigated() || cMaze[row+1][column].isExit())// or (cMaze[row+1][column] != VISITED_MARKER && cMaze[row+1][column] != 'W')\n {\n return DepthFirstSearch(row+1, column);\n }\n else if(cMaze[row][column+1].canBeNavigated() || cMaze[row][column+1].isExit())\n {\n return DepthFirstSearch(row, column+1);\n }\n else if(cMaze[row][column-1].canBeNavigated() || cMaze[row][column-1].isExit())\n {\n return DepthFirstSearch(row, column-1);\n }\n else if(cMaze[row-1][column].canBeNavigated() || cMaze[row-1][column].isExit())\n {\n return DepthFirstSearch(row-1, column);\n }\n //no where could go, then return\n else\n {\n sPath.pop();\n if(sPath.isEmpty())\n {\n //print nothing found\n PrintPath(sPath, false);\n return sPath;\n }\n MazePoint mp = sPath.top();\n int mpRow = mp.getRow();\n int mpColumn = mp.getColumn();\n return DepthFirstSearch(mpRow, mpColumn);\n }\n }\n }","public Stack<Integer> dfs(Maze tmp) {\n \n int tmpx = tmp.positionX();\n int tmpy = tmp.positionY();\n Stack<Integer> s = new Stack<Integer>();\n while (!tmp.gameOver()) {\n choosedirection(s, tmp);\n while (!s.isEmpty() && !tmp.gameOver()) {\n if (s.peek() == 0) {\n if (tmp.right()) {\n s.push(1);\n } else if (tmp.up()) {\n s.push(0);\n } else if (tmp.left()) {\n s.push(3);\n } else {\n this.stackpop(s, tmp);\n }\n } else if (s.peek() == 1) {\n if (tmp.down()) {\n s.push(2);\n } else if (tmp.right()) {\n s.push(1);\n } else if (tmp.up()) {\n s.push(0);\n } else {\n this.stackpop(s, tmp);\n }\n } else if (s.peek() == 2) {\n if (tmp.left()) {\n s.push(3);\n } else if (tmp.down()) {\n s.push(2);\n } else if (tmp.right()) {\n s.push(1);\n } else {\n this.stackpop(s, tmp);\n }\n } else if (s.peek() == 3) {\n if (tmp.up()) {\n s.push(0);\n } else if (tmp.left()) {\n s.push(3);\n } else if (tmp.down()) {\n s.push(2);\n } else {\n this.stackpop(s, tmp);\n }\n\n }\n\n }\n }\n\n Stack<Integer> stack = new Stack<Integer>();\n while (!s.isEmpty()) {\n stack.push(s.pop());\n }\n\n tmp.setLocation(tmpx, tmpy);\n return stack;\n\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 }","void testSearches(Tester t) {\n Vertex v1 = new Vertex(10, 10);\n Vertex v2 = new Vertex(10, 11);\n Vertex v3 = new Vertex(10, 12);\n\n Edge e1 = new Edge(v1, v2, 1);\n Edge e2 = new Edge(v2, v3, 1);\n\n IList<Vertex> map = new Cons<Vertex>(v1, new Cons<Vertex>(v2, new Cons<Vertex>(\n v3, new Empty<Vertex>())));\n\n Player player = new Player(map);\n DepthFirst dp = new DepthFirst(map);\n BreadthFirst bp = new BreadthFirst(map);\n\n t.checkExpect(player.current, v1);\n t.checkExpect(player.finished, false);\n\n t.checkExpect(bp.hasNext(), true);\n t.checkExpect(bp.next(), new Queue<Vertex>());\n\n t.checkExpect(dp.hasNext(), true);\n t.checkExpect(dp.next(), new Stack<Vertex>());\n\n t.checkExpect(player.move(true, e1), v2);\n\n t.checkExpect(player.current, v2);\n t.checkExpect(player.finished, false);\n\n t.checkExpect(bp.hasNext(), false);\n t.checkExpect(bp.next(), v3);\n\n t.checkExpect(dp.hasNext(), false);\n t.checkExpect(dp.next(), v3);\n\n t.checkExpect(player.move(true, e2), v3);\n\n player.finished = true;\n\n t.checkExpect(player.current, v3);\n t.checkExpect(player.finished, true);\n\n Queue<Vertex> q = new Queue<Vertex>(map);\n\n q.enqueue(new Vertex(5, 5));\n\n Deque<Vertex> dq = new Deque<Vertex>();\n dq.addAtHead(v1);\n dq.addAtTail(v2);\n dq.addAtTail(new Vertex(5, 5));\n\n\n t.checkExpect(q.isEmpty(), false);\n t.checkExpect(q.contents, dq);\n\n Stack<Vertex> stack = new Stack<Vertex>(map);\n\n t.checkExpect(stack.isEmpty(), false);\n dq.removeFromHead();\n t.checkExpect(stack.pop(), dq);\n\n t.checkExpect(dp.next(), v2);\n t.checkExpect(bp.hasNext(), true);\n\n }","public static String findPath(Maze maze) {\n \tint m = maze.getNumRows();\n \tint n = maze.getNumCols();\n\n \t//define a visited matrix\n \tboolean[][] visited = new boolean[m][n];\n \tsetvisited(false, visited);\n\n \t//define a direction matrix\n \tint[][] dir_mtr = new int[m][n];\n \tinit_dir(-1,dir_mtr);\n\n\n\n \t//define a stack\n \tStack<MazeLocation> s;\n \ts = new StackRefBased<MazeLocation>();\n\n \tMazeLocation entry = maze.getEntry();\n \tMazeLocation exit = maze.getExit();\n \t// System.out.println(entry.toString());\n \ts.push(entry);\n\n\t\tMazeLocation temp; \n\t\tString result = \"\"; \t\n\n\t\ttry{\n\t\t\tint x,y;\n\n\n\t\t\twhile(!s.isEmpty()){\n\n \t\ttemp = s.peek();\n \t\tx = temp.getRow();\n \t\ty = temp.getCol();\n \t\tdir_mtr[x][y]+=1;\n\n \t\tif(temp.toString().equals(exit.toString())){\n \t\t\tSystem.out.println(\"find the path\");\n \t\t\tbreak;\n\n \t\t}\n\n \t\tif(dir_mtr[x][y]==0){ \n \t\t\t//checking the up direction\n \t\t\tif(x-1>=0 && !maze.isWall(x-1,y) && !visited[x-1][y]){\n \t\t\t\tMazeLocation testnode = new MazeLocation(x-1,y,maze.isWall(x-1,y));\n \t\t\t\tvisited[x-1][y] = true;\n \t\t\t\ts.push(testnode);\n\n \t\t\t}\n\n \t\t}else if(dir_mtr[x][y]==1){\n \t\t\t//checking the left direction\n \t\t\tif(y-1>=0 && !maze.isWall(x,y-1) && !visited[x][y-1]){\n \t\t\t\tMazeLocation testnode = new MazeLocation(x,y-1,maze.isWall(x,y-1));\n \t\t\t\tvisited[x][y-1] = true;\n \t\t\t\ts.push(testnode);\n\n \t\t\t}\n\n \t\t}else if(dir_mtr[x][y]==2){\n \t\t\t//checking the down direction\n \t\t\tif(x+1<m && !maze.isWall(x+1,y) && !visited[x+1][y]){\n \t\t\t\tMazeLocation testnode = new MazeLocation(x+1,y,maze.isWall(x+1,y));\n \t\t\t\tvisited[x+1][y] = true;\n \t\t\t\ts.push(testnode);\n\n \t\t\t}\n \t\t\t\n \t\t}else if(dir_mtr[x][y]==3){\n \t\t\t//checking the right direction\n \t\t\tif(y+1<n && !maze.isWall(x,y+1) && !visited[x][y+1]){\n \t\t\t\tMazeLocation testnode = new MazeLocation(x,y+1,maze.isWall(x,y+1));\n \t\t\t\tvisited[x][y+1] = true;\n \t\t\t\ts.push(testnode);\n\n \t\t\t}\n \t\t\t\n \t\t}else{\n \t\t\tvisited[x][y] = false;\n \t\t\ts.pop();\n \t\t}\n\n\n\n \t\t\n \t}\n\n \t//reverse the stack\n \tStack<MazeLocation> reverse;\n \treverse = new StackRefBased<MazeLocation>();\n \twhile(!s.isEmpty()){\n\t\t\t reverse.push(s.pop()); \t//push the node to the reverse stack\n\t\t\t }\n\n\n \t//if the stack is not empty, then we find the path\n\t\tif(!reverse.isEmpty()){\n\t\t\tresult = reverse.toString();\n\n\t\t}\n\n \t\n \n\n\t\t}\n\t\tcatch (StackEmptyException see) {\n \n }\n\n\n \treturn result;\n\n\n }","public void breadthFirstSearch(){\n Deque<Node> q = new ArrayDeque<>(); // In an interview just write Queue ? Issue is java 8 only has priority queue, \n // meaning I have to pass it a COMPARABLE for the Node class\n if (this.root == null){\n return;\n }\n \n q.add(this.root);\n while(q.isEmpty() == false){\n Node n = (Node) q.remove();\n System.out.print(n.val + \", \");\n if (n.left != null){\n q.add(n.left);\n }\n if (n.right != null){\n q.add(n.right);\n }\n }\n }","public boolean solve(final int startRow, final int startCol) {\r\n\r\n // TODO\r\n // validate arguments: ensure position is within maze area\r\n\r\n if(mazeData [startRow][startCol] == WALL) {\r\n throw new IllegalArgumentException(\" we're in a wall buddy\");\r\n }\r\n else if (startRow > mazeData.length-1 || startCol > mazeData.length-1 ){\r\n throw new IllegalArgumentException(\" we're out of bounds \");\r\n }\r\n\r\n\r\n\r\n\r\n\r\n // TODO create local class for row/col positions\r\n class Position {\r\n private int row;\r\n private int col;\r\n\r\n // TODO add instance variables\r\n public Position(final int row, final int col) {\r\n this.row = row;\r\n this.col= col;\r\n }\r\n\r\n\r\n\r\n // TODO toString if desired\r\n public String toString() {\r\n return \"Row: \" + this.row + \"Column: \"+ this.col;\r\n }\r\n\r\n\r\n }\r\n\r\n\r\n // define the stack (work queue)\r\n final var queue = Collections.asLifoQueue(new LinkedList<Position>());\r\n //Queue<Position> queue = new LinkedList<Position>(); // EXTRA CREDIT PART 2\r\n\r\n // put starting position in queue\r\n queue.add(new Position(startRow, startCol));\r\n\r\n\r\n\r\n\r\n\r\n // look for a way out of the maze from the current position\r\n while (!queue.isEmpty()) {\r\n\r\n\r\n final Position pos = queue.remove();\r\n\r\n // if this is a wall, then ignore this position (and skip the remaining steps of the loop body)\r\n if (mazeData [pos.row][pos.col]== WALL){\r\n continue; // jumps to next spot in que , by skipping to next iteration of loops by saying continue\r\n }\r\n\r\n\r\n // otherwise mark this place as visited (drop a breadcrumb)\r\n if (mazeData [pos.row][pos.col]== VISITED){\r\n continue; // jumps to next spot in que , by skipping to next iteration of loops by saying continue\r\n }\r\n else if(mazeData [pos.row][pos.col]== EMPTY){\r\n mazeData [pos.row][pos.col]= VISITED;\r\n }\r\n\r\n // if we're already on the perimeter, then this is a way out and we should return success (true) right away\r\n if (pos.row == 0|| pos.col ==0 || pos.row == mazeData.length-1 || pos.col == mazeData[0].length-1){\r\n mazeData[startRow][startCol] = START;\r\n return true;\r\n }\r\n\r\n queue.add(new Position(pos.row+1,pos.col ));//down\r\n queue.add(new Position(pos.row-1,pos.col ));//up\r\n queue.add(new Position(pos.row,pos.col-1 )); //left\r\n queue.add(new Position(pos.row, pos.col + 1)); //right\r\n\r\n\r\n }//end of while\r\n\r\n\r\n\r\n // mark starting position\r\n mazeData[startRow][startCol] = START;\r\n\r\n // if we've looked everywhere but haven't gotten out, then return failure (false)\r\n return false;\r\n }","private Queue<Integer> breadthSearch(int i, int j, Queue<Integer> queue, Queue<Integer> path) {\n while(queue.size() != 0) {\n queue.poll();\n }//while\n return new LinkedList();\n }","private static int breadthFirstSearch(Vertex start) throws Queue.UnderflowException, Queue.EmptyException {\n boolean visited[] = new boolean[48];\n //Keep a queue of vertecies and a queue of the depth of the verticies - they will be added to and poped from identically\n ListQueue<Vertex> queue = new ListQueue<Vertex>();\n ListQueue<Integer> numQueue = new ListQueue<Integer>();\n //Set the starting node as visited\n visited[start.index()] = true;\n queue.enqueue(start);\n numQueue.enqueue(new Integer(1));\n\n //Keep last\n int last = -1;\n //While the queue isnt empty\n while (!queue.isEmpty()) {\n //Pop off the top from both queues and mark as visited\n start = queue.dequeue();\n int current = numQueue.dequeue();\n visited[start.index] = true;\n //For all neigbors\n for (Vertex v : start.neighbors) {\n //If we havent visited it make sure to visit it\n if (visited[v.index()] == false) {\n //As we keep adding new nodes to visit keep track of the depth\n queue.enqueue(v);\n numQueue.enqueue(current + 1);\n }\n }\n //Keep track of the most recent depth before we pop it off (queue will be empty when we exit)\n last = current;\n }\n //Return the max of the depth\n return last;\n }","public void BFS() {\n visitedCells = 1;\n\n // Initialize the vertices\n for (int j = 0; j < maze.getGrid().length; j++) {\n for (int k = 0; k < maze.getGrid().length; k++) {\n Cell cell = maze.getGrid()[j][k];\n cell.setColor(\"WHITE\");\n cell.setDistance(0);\n cell.setParent(null);\n }\n }\n\n Cell sourceCell = maze.getGrid()[0][0];\n Cell neighbor = null;\n Cell currentCell;\n int distance = 0;\n\n // Initialize the source node\n sourceCell.setColor(\"GREY\");\n sourceCell.setDistance(0);\n sourceCell.setParent(null);\n\n queue.add(sourceCell);\n\n // Visits each cell until the queue is empty\n while (!queue.isEmpty()) {\n currentCell = queue.remove();\n\n for (int i = 0; i < currentCell.mazeNeighbors.size(); i++) {\n neighbor = currentCell.mazeNeighbors.get(i);\n\n // Stop the search if you reach the final cell\n if (neighbor.x == r - 1 && neighbor.y == r - 1) {\n distance++;\n if (distance == 10)\n distance = 0;\n neighbor.setDistance(distance);\n neighbor.setParent(currentCell);\n neighbor.visited = true;\n visitedCells++;\n break;\n }\n\n // Checks each neighbor and adds it to the queue if its color is white\n if (neighbor.getColor().equalsIgnoreCase(\"WHITE\")) {\n distance++;\n if (distance == 10)\n distance = 0;\n neighbor.setColor(\"GREY\");\n neighbor.setDistance(distance);\n neighbor.setParent(currentCell);\n neighbor.visited = true;\n queue.add(neighbor);\n visitedCells++;\n }\n }\n // Stop the search if you reach the final cell\n if (neighbor.x == r - 1 && neighbor.y == r - 1)\n break;\n\n currentCell.setColor(\"BLACK\");\n }\n }","public static void breadthFirstSearch(ArrayList<Node> graph) {\n\t\tSystem.out.println(\"BFS:\");\n\t\tif(graph.size() == 0) {\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tGraphUtils.cleanGraph(graph);\n\n\t\tQueue<Node> queue = new LinkedList<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\tqueue.add(node);\n\t\t\t\n\t\t\twhile(!queue.isEmpty()) {\n\t\t\t\tnode = queue.remove();\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 queue 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\tqueue.add(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\n\t\tSystem.out.println();\n\t\tGraphUtils.cleanGraph(graph);\n\t}","@SuppressWarnings({\"rawtypes\", \"unchecked\", \"SuspiciousMethodCalls\"})\n private List getDepthFirstTraversal_iterative_usingStack_BigO_VPlusE() throws Exception {\n Map<Object, Boolean> visited = new LinkedHashMap<>();\n Stack watchStack = new Stack();\n\n V root = data.keySet().stream().findFirst().orElseThrow(() -> new Exception(\"Graph is Empty\"));\n watchStack.push(root);\n visited.put(root, true);\n\n while(!watchStack.isEmpty()) {\n Object currentVertex = watchStack.top();\n\n BinarySearchTree<E> edgeTree = data.getOrDefault(currentVertex, new BinarySearchTree<>());\n List<E> edges = edgeTree.getTreeByInOrder_depthFirst();\n\n //Remove an item from the stack when there are no edges or all the edges are visited for that vertex\n if(edgeTree.isEmpty() || visited.keySet().containsAll(edges)) {\n watchStack.pop();\n } else {\n for(E edge : edges) {\n if(!visited.containsKey(edge)) {\n watchStack.push(edge);\n visited.put(edge, true);\n break;\n }\n }\n }\n }\n return new ArrayList<>(visited.keySet());\n }","public void depthFirstSearch(){\n\t\tStack<TreeNode<T>> nodeStack = new Stack<TreeNode<T>>();\n\n\t\tif(root!=null){\n\t\t\tnodeStack.push(root);\n\t\t\tSystem.out.println(root.data);\n\t\t\tTreeNode<T> topNode = root;\n\t\t\twhile(!nodeStack.isEmpty()){\n\t\t\t\tif(topNode.left!=null){\n\t\t\t\t\tnodeStack.push(topNode.left);\t\t\t\t\t\n\t\t\t\t\tSystem.out.println(topNode.data);\n\t\t\t\t\ttopNode = topNode.left;\n\t\t\t\t} else if(topNode.right!=null){\n\t\t\t\t\tnodeStack.push(topNode.right);\n\t\t\t\t\tSystem.out.println(topNode.data);\n\t\t\t\t\ttopNode = topNode.right;\n\t\t\t\t} else{\n\t\t\t\t\ttry{\n\t\t\t\t\t\tnodeStack.pop();\n\t\t\t\t\t}catch(Exception ex){\n\t\t\t\t\t\tex.printStackTrace();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}","public static Node searchBFS(int mat[][], int i, int j, int x, int y) {\n\t\tfor (int n = 1; n < 30; n++) {\n\t\t\tfor (int p = 1; p < 30; p++) {\n\t\t\t\tvisited[n][p] = false;\n\t\t\t}\n\t\t}\n\n\t\t// create an empty queue\n\t\tQueue<Node> q = queue;\n\t\tq.clear();\n\t\t// mark source cell as visited and enqueue the source node\n\t\tvisited[j][i] = true;\n\t\tNode root = NodeFactory.createNode(i, j, 0, null, null);\n\t\tq.add(root);\n\n\t\t// stores length of longest path from source to destination\n\t\tint min_dist = Integer.MAX_VALUE;\n\t\tNode node = null;\n\n\t\t// run till queue is not empty\n\t\twhile (!q.isEmpty()) {\n\t\t\t// pop front node from queue and process it\n\n\t\t\tnode = q.poll();\n\t\t\ti = node.x;\n\t\t\tj = node.y;\n\t\t\tint dist = node.dist;\n\n\t\t\tif (i == x && j == y) {\n\t\t\t\tmin_dist = dist;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tfor (Direction dir : DIRECTIONS) {\n\t\t\t\tint nx = i + dir.x;\n\t\t\t\tint ny = j + dir.y;\n\n\t\t\t\tif (isValid(mat, visited, nx, ny)) {\n\t\t\t\t\t// mark next cell as visited and enqueue it\n\n\t\t\t\t\tvisited[ny][nx] = true;\n\t\t\t\t\tint ndist = dist + 1;\n\n\t\t\t\t\tNode newNode = NodeFactory.createNode(nx, ny, ndist, dir,\n\t\t\t\t\t\t\tnode);\n\n\t\t\t\t\t// Node newNode =new Node(node, nx, ny, ndist, dir);\n\n\t\t\t\t\tq.add(newNode);\n\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\n\t\tif (min_dist == Integer.MAX_VALUE){\n\t\t\treturn null;\n\t\t}\n\t\treturn node;\n\t}","private void breadthFirst(PathBetweenNodes graph, LinkedList<String> visited) {\r\n\r\n LinkedList<String> nodes = graph.adjacentNodes(visited.getLast());\r\n for (String node : nodes)\r\n {\r\n if (visited.contains(node))\r\n {\r\n continue;\r\n }\r\n if (node.equals(END))\r\n {\r\n \tif (mode1 && mode){\r\n visited.add(node);\r\n printPath(visited); \r\n graph.flag=false;\r\n mode=false;\r\n visited.removeLast();\r\n \t} else if(mode2){\r\n visited.add(node);\r\n printPath(visited); \r\n flag=mode2; \r\n visited.removeLast();\r\n \t} \r\n } \r\n }\r\n\r\n for (String node : nodes) { // implementing a for loop to call each node in the array nodes\r\n if (visited.contains(node) || node.equals(END)) { // if statement to see if node is already visited or it is the end node\r\n continue;\r\n }\r\n flag=true;\r\n visited.addLast(node); //adding the last node to visited array\r\n breadthFirst(graph, visited); // implementing the breath first search\r\n visited.removeLast(); // removing the last node from array visited\r\n }\r\n if (flag == false) {\r\n System.out.println(\"No path Exists between \" + START + \" and \" + END);\r\n flag = true;\r\n }\r\n }","public void breadthFirstTraverse() {\n\t\t// track whether vertex was visited\n\t\tHashMap<Integer, Boolean> visited = buildVisited();\n\t\t// store neighbors\n\t\tQueue<Integer> queue = new LinkedList<Integer>();\n\n\t\t// arbitrarily add first element\n\t\tInteger current = (Integer) edges.keySet().toArray()[0];\n\t\tqueue.add(current);\n\n\t\twhile (queue.peek() != null) {\n\n\t\t\tcurrent = queue.remove();\n\t\t\tSystem.out.println(\"current: \" + current);\n\t\t\tvisited.put(current, true);\n\n\t\t\tfor (Integer neighbor: edges.get(current)) {\n\t\t\t\tif (!visited.get(neighbor)) {\n\t\t\t\t\tqueue.add(neighbor);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}","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 }","public static void breadthFirstSearch (HashMap<String, Zpair> stores,\n HashSet<Zpair> visited,\n List<Integer> sortedQueue) {\n List<String> q = new ArrayList<String>();\n q.add(\"Q\");\n // k=0\n //int k = 0;\n while(q.size() != 0) {\n //if(k == 21) {\n // System.exit(20);\n // }\n List<StringBuffer> path = new ArrayList<StringBuffer>(); // this is the return string\n List<String> q1 = new ArrayList<String>();\n int size = q.size();\n //System.out.println(k);\n for(int i = 0; i < size; i++) {\n //printList(q);\n path.add(ZMethods.stringPop(q));\n execute(path.get(i), stores, visited, q1, sortedQueue);\n }\n copyStringBuffer(q1,q);\n //k++;\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 }","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 String depthFirstSearch( AnyType start_vertex ) throws VertexException {\n \n StringBuffer buffer = new StringBuffer();\n \n // ----------------------------\n // TODO: Add your code here\n // ----------------------------\n ConstantTimeStack<Vertex<AnyType>> stack = new ConstantTimeStack<Vertex<AnyType>>();\n boolean exists = false;\n Vertex<AnyType> S = new Vertex<AnyType>(start_vertex);\n int counter = 0;\n //loop through to set each vertex to not visited\n for( int i = 0; i < vertex_adjacency_list.size(); i++){\n vertex_adjacency_list.get(i).setVisited(-1);\n //if find the start vertex then set index position to counter\n if(vertex_adjacency_list.get(i).compareTo(S) == 0){\n exists = true;\n vertex_adjacency_list.get(i).setVisited(counter);\n counter = i;\n }\n }\n //if doesn't exist then through exception\n if(exists == false){\n throw new VertexException(\"Start Vertex does not exist\");\n }\n //if it does exist then push start node onto stack, set visited \n else if(exists){\n stack.push(vertex_adjacency_list.get(counter));\n vertex_adjacency_list.get(counter).setVisited(1);\n Vertex <AnyType> e = vertex_adjacency_list.get(counter);\n counter = 2;\n int n = e.numberOfAdjacentVertices();\n try{\n \n while(true){\n //loop through e's adjacent vertices \n for (n = e.numberOfAdjacentVertices()-1; n >=0 ; n--){\n //if the adacent vertex has not been visited\n if(e.getAdjacentVertex(n).hasBeenVisited()==false){\n //change e to adjacent vertex and push onto stack\n e = e.getAdjacentVertex(n);\n stack.push(e);\n //set e as visited at counter\n e.setVisited(counter);\n counter++;\n //reset n to e's num of vertices\n n = e.numberOfAdjacentVertices();\n }\n //if it has been visited and it's the first node in list\n //then pop it off the stack and then set e to new top\n //set n to new num of vertices\n else if(e.getAdjacentVertex(n).hasBeenVisited() && n == 0){\n stack.pop();\n e = stack.peek();\n n = e.numberOfAdjacentVertices();\n }\n }\n }\n }catch(EmptyStackException m){\n }\n }\n //loop through the list and print each with when it was visited\n for(int k = 0; k< vertex_adjacency_list.size(); k++){\n buffer.append(vertex_adjacency_list.get(k) + \":\" + vertex_adjacency_list.get(k).getVisited()+ \"\\n\");\n }\n \n return buffer.toString();\n \n }","private void DepthFirstSearch(Node current){\n helperDFS( current );\n }","public void breadthFirst() {\n\t\tQueue<Node> queue = new ArrayDeque<>();\n\t\tqueue.add(root);\n\t\twhile(!queue.isEmpty()) {\n\t\t\tif(queue.peek().left!=null)\n\t\t\t\tqueue.add(queue.peek().left);\n\t\t\tif(queue.peek().right!=null)\n\t\t\t\tqueue.add(queue.peek().right);\n\t\t\tSystem.out.println(queue.poll().data);\n\t\t}\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 }","public List<String> breadthFirstSearch(List<String> array) {\n // Write your code here.\n Queue<Node> queue = new ArrayDeque<>();\n queue.add(this);\n // breadthFirstSearch(this, queue, array);\n while (queue.size() > 0) {\n Node node = queue.poll();\n array.add(node.name);\n queue.addAll(node.children);\n }\n return array;\n }","public static int bfs() {\r\n check = new int[N][N]; // check 변수 초기화\r\n q = new LinkedList<Point>();\t\t\t\t\t//bfs 할때 필요한 그 stack. first in first out\r\n q.offer(new Point(shark.x, shark.y));\t\t\t//q.offer == 해당 큐의 맨 뒤에 전달된 요소를 삽입함. list에서 list.add와 같은 말임.\r\n check[shark.x][shark.y] = 1;\r\n\r\n int FishCheck = 0;\t\t\t\t\t\t\t\t//the number of the fish in the sea map\r\n Shark fish = new Shark(N, N);\t\t\t\t\t//new shark initiation\r\n loop: while (!q.isEmpty()) {\r\n int r = q.peek().x;\t\t\t\t\t\t\t//q.peek == 해당 큐의 맨 앞에 있는(제일 먼저 저장된) 요소를 반환함\r\n int c = q.poll().y;\t\t\t\t\t\t\t//q.poll == 해당 큐의 맨 앞에 있는(제일 먼저 저장된) 요소를 반환하고, 해당 요소를 큐에서 제거함. 만약 큐가 비어있으면 null을 반환함.\r\n\r\n for (int d = 0; d < dr.length; d++) {\r\n int nr = r + dr[d];\t\t\t\t\t\t//북(0),남(1),동(2),서(3) 순으로. nr == new row\r\n int nc = c + dc[d];\t\t\t\t\t\t//북(0),남(1),동(2),서(3) 순으로. nc == new column\r\n\r\n // 지나갈 수 있는 곳: 자신보다 큰 물고기가 없는 곳\r\n if (isIn(nr, nc) && check[nr][nc] == 0 && sea[nr][nc] <= shark.lv) {\r\n check[nr][nc] = check[r][c] + 1;\r\n q.offer(new Point(nr, nc));\r\n\r\n // 위치가 더 커질 경우, 더이상 확인할 필요 X\r\n if (FishCheck != 0 && FishCheck < check[nr][nc]) {\r\n break loop;\r\n }\r\n \r\n // 처음 먹을 수 있는 자기보다 물고기가 발견 되었을 때\r\n if (0 < sea[nr][nc] && sea[nr][nc] < shark.lv && FishCheck == 0) {\r\n FishCheck = check[nr][nc];\r\n fish.x = nr;\r\n fish.y = nc;\r\n fish.lv = sea[nr][nc];\r\n }\r\n // 같은 위치에 여러 마리 있을 경우, 가장 위의 가장 왼쪽 물고기부터 먹음\r\n else if (FishCheck == check[nr][nc] && 0 < sea[nr][nc] && sea[nr][nc] < shark.lv) {\r\n if (nr < fish.x) { // 가장 위에 있는 거 우선권\r\n fish.x = nr;\r\n fish.y = nc;\r\n fish.lv = sea[nr][nc];\r\n } else if (nr == fish.x && nc < fish.y) { // 다 가장 위일 경우, 가장 왼쪽 우선권\r\n fish.x = nr;\r\n fish.y = nc;\r\n fish.lv = sea[nr][nc];\r\n }\r\n\r\n }\r\n\r\n }else if(isIn(nr, nc) && check[nr][nc] == 0) {\r\n check[nr][nc] = -1;\r\n }\r\n }\r\n }\r\n // idx 초과 안날 경우\r\n if (fish.x != N && fish.y != N) {\r\n eatFish(fish);\r\n }\r\n \r\n return (FishCheck - 1);\r\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 }","public boolean direction(Maze maze, Stack<Integer> stack) {\n boolean zero = true;\n boolean one = true;\n boolean two = true;\n boolean three = true;\n while (one || two || zero || three) {\n int direction = random.nextInt(4);\n if (direction == 0 && zero) {\n if (maze.getRight() == 1) {\n maze.goRight();\n maze.getTable()[maze.positionX()][maze.positionY()] = 1;\n stack.push(0);\n return true;\n } else if (maze.getRight() == 2) {\n maze.goRight();\n maze.goRight();\n maze.goRight();\n maze.goRight();\n stack.push(0);\n stack.push(0);\n stack.push(0);\n stack.push(0);\n maze.getTable()[maze.positionX()][maze.positionY()] = 1;\n maze.getTable()[maze.positionX() - 1][maze.positionY()] = 2;\n maze.getTable()[maze.positionX() - 2][maze.positionY()] = 1;\n maze.getTable()[maze.positionX() - 3][maze.positionY()] = 1;\n } else\n zero = false;\n } else if (direction == 1 && one) {\n if (maze.getDown() == 1) {\n maze.goDown();\n maze.getTable()[maze.positionX()][maze.positionY()] = 1;\n stack.push(1);\n return true;\n } else if (maze.getDown() == 2) {\n\n maze.goDown();\n maze.goDown();\n maze.goDown();\n maze.goDown();\n stack.push(1);\n stack.push(1);\n stack.push(1);\n stack.push(1);\n maze.getTable()[maze.positionX()][maze.positionY()] = 1;\n maze.getTable()[maze.positionX()][maze.positionY() - 1] = 2;\n maze.getTable()[maze.positionX()][maze.positionY() - 2] = 1;\n maze.getTable()[maze.positionX()][maze.positionY() - 3] = 1;\n } else\n one = false;\n } else if (direction == 2 && two) {\n if (maze.getLeft() == 1) {\n maze.goLeft();\n maze.getTable()[maze.positionX()][maze.positionY()] = 1;\n stack.push(2);\n return true;\n } else if (maze.getLeft() == 2) {\n\n maze.goLeft();\n maze.goLeft();\n maze.goLeft();\n maze.goLeft();\n stack.push(2);\n stack.push(2);\n stack.push(2);\n stack.push(2);\n maze.getTable()[maze.positionX()][maze.positionY()] = 1;\n maze.getTable()[maze.positionX() + 1][maze.positionY()] = 2;\n maze.getTable()[maze.positionX() + 2][maze.positionY()] = 1;\n maze.getTable()[maze.positionX() + 3][maze.positionY()] = 1;\n\n } else\n two = false;\n } else if (direction == 3 && three) {\n if (maze.getUp() == 1) {\n maze.goUp();\n maze.getTable()[maze.positionX()][maze.positionY()] = 1;\n stack.push(3);\n return true;\n } else if (maze.getUp() == 2) {\n maze.goUp();\n maze.goUp();\n maze.goUp();\n maze.goUp();\n stack.push(3);\n stack.push(3);\n stack.push(3);\n stack.push(3);\n maze.getTable()[maze.positionX()][maze.positionY()] = 1;\n maze.getTable()[maze.positionX()][maze.positionY() + 1] = 2;\n maze.getTable()[maze.positionX()][maze.positionY() + 2] = 1;\n maze.getTable()[maze.positionX()][maze.positionY() + 3] = 1;\n } else\n\n three = false;\n }\n\n }\n return false;\n }","public String breadthFirstSearch( AnyType start_vertex ) throws VertexException {\n \n StringBuffer buffer = new StringBuffer();\n \n // ----------------------------\n // TODO: Add your code here\n // ----------------------------\n boolean exists = false;\n Vertex<AnyType> S = new Vertex<AnyType>(start_vertex);\n int counter = 1;\n //make new vertex to check if its in list\n //make queue to hold vertices\n SemiConstantTimeQueue<Vertex<AnyType>> queue = new SemiConstantTimeQueue<Vertex<AnyType>>();\n //loop through and set not visited\n for( int i = 0; i < vertex_adjacency_list.size(); i++){\n vertex_adjacency_list.get(i).setVisited(-1);\n //if it's in list then set exists to true\n //and set visited \n if(vertex_adjacency_list.get(i).compareTo(S) == 0){\n exists = true;\n vertex_adjacency_list.get(i).setVisited(counter);\n counter = i;\n }\n } \n //if doesn't exist then throw the exception\n if(exists == false){\n throw new VertexException(\"Start Vertex does not exist\");\n }\n //make new queue\n queue.add(vertex_adjacency_list.get(counter));\n vertex_adjacency_list.get(counter).setVisited(1);\n counter = 1;\n int k=0;\n Vertex<AnyType>e;\n //while the queue isn't empty\n while(queue.peek() !=null){\n //make e the top of the queue \n e = queue.peek(); \n //go through the list and if you reach the begining it exits loop\n for( k = 0; k < vertex_adjacency_list.size()-1; k++){\n if(vertex_adjacency_list.get(k).compareTo(e)==0){\n break;\n }\n } \n //go through loop and check if visited, if not then add it to queue, set visited\n for( int j = 0; j< vertex_adjacency_list.get(k).numberOfAdjacentVertices(); j++){\n if(vertex_adjacency_list.get(k).getAdjacentVertex(j).hasBeenVisited()==false){\n counter++;\n queue.add(vertex_adjacency_list.get(k).getAdjacentVertex(j));\n vertex_adjacency_list.get(k).getAdjacentVertex(j).setVisited(counter);\n }\n }\n //remove from queue when through loop once\n k++;\n queue.remove();\n }\n //loop through list and print vertex and when it was visited\n for(int o = 0; o< vertex_adjacency_list.size(); o++){\n buffer.append(vertex_adjacency_list.get(o) + \":\" + vertex_adjacency_list.get(o).getVisited()+ \"\\n\");\n }\n return buffer.toString();\n }","public void bfs(Queue<Integer> queue, int visited[]) {\n if (queue.isEmpty()) {\n return;\n }\n\n int root = queue.poll();\n\n if (visited[root] == 1) {\n bfs(queue, visited);\n return;//alreadu into consideration\n }\n\n\n System.out.printf(\"Exploring of node %d has started\\n\", root);\n visited[root] = 1;\n\n\n for (int i = 0; i < adjMatrix[root].size(); i++) {\n if (visited[adjMatrix[root].get(i)] == 1 || visited[adjMatrix[root].get(i)] == 2) {\n continue;\n }\n queue.add(adjMatrix[root].get(i));\n }\n bfs(queue, visited);\n System.out.printf(\"Exploring of node %d has end\\n\", root);\n visited[root] = 2;\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 static Node searchBFSInvalidDes(int mat[][], int i, int j, int x,\n\t\t\tint y) {\n\t\tfor (int n = 1; n < 30; n++) {\n\t\t\tfor (int p = 1; p < 30; p++) {\n\t\t\t\tvisited[n][p] = false;\n\t\t\t}\n\t\t}\n\n\t\t// create an empty queue\n\t\tQueue<Node> q = queue;\n\t\tq.clear();\n\t\t// mark source cell as visited and enqueue the source node\n\t\tvisited[j][i] = true;\n\t\tNode root = NodeFactory.createNode(i, j, 0, null, null);\n\t\tq.add(root);\n\n\t\t// stores length of longest path from source to destination\n\t\tint min_dist = Integer.MAX_VALUE;\n\t\tNode node = null;\n\t\t// run till queue is not empty\n\t\twhile (!q.isEmpty()) {\n\t\t\t// pop front node from queue and process it\n\t\t\tnode = q.poll();\n\n\t\t\t// (i, j) represents current cell and dist stores its\n\t\t\t// minimum distance from the source\n\t\t\ti = node.x;\n\t\t\tj = node.y;\n\t\t\tint dist = node.dist;\n\n\t\t\t// if destination is found, update min_dist and stop\n\t\t\tif (i == x && j == y) {\n\t\t\t\tmin_dist = dist;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\t// check for all 4 possible movements from current cell\n\t\t\t// and enqueue each valid movement\n\t\t\tfor (Direction dir : DIRECTIONS) {\n\t\t\t\t// check if it is possible to go to position\n\t\t\t\t// (i + row[k], j + col[k]) from current position\n\t\t\t\tint nx = i + dir.x;\n\t\t\t\tint ny = j + dir.y;\n\t\t\t\tif (isValid(mat, visited, nx, ny) || ((nx == x) && ny == y)) {\n\t\t\t\t\t// mark next cell as visited and enqueue it\n\t\t\t\t\tvisited[ny][nx] = true;\n\t\t\t\t\tint ndist = dist + 1;\n\t\t\t\t\tNode newNode = NodeFactory.createNode(nx, ny, ndist, dir,\n\t\t\t\t\t\t\tnode);\n\t\t\t\t\t// Node newNode =new Node(node, nx, ny, ndist, dir);\n\t\t\t\t\tq.add(newNode);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (min_dist == Integer.MAX_VALUE)\n\t\t\treturn null;\n\t\treturn node;\n\t}","private void bfs(int x, int y, Node p) {\n if (p == null) {\n // TODO\n return;\n }\n char c = board[x][y];\n\n if (p.next(c) == null) {\n // TODO not found\n return;\n }\n\n Node node = p.next(c);\n\n // if node is leaf, found a word\n if (node.word != null) {\n if (!results.contains(node.word)) {\n results.add(node.word);\n }\n }\n\n mark[x][y] = true;\n for (int[] dir: dirs) {\n int newX = x + dir[0];\n int newY = y + dir[1];\n if (newX < 0 || n <= newX\n || newY < 0 || m <= newY) {\n continue;\n }\n\n if (mark[newX][newY]) {\n continue;\n }\n\n bfs(newX, newY, node);\n }\n mark[x][y] = false;\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}","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}","public static boolean Traversal_DFS(int row, int col, int[][] maze)\r\n {\n if (isASolution(row, col))\r\n {\r\n maze[row][col] = 3;\r\n return true;\r\n }\r\n\r\n // otherwise, mark the cell as visited and process its children.\r\n maze[row][col] = 2;\r\n if (canMove(row,col-1, maze) && Traversal_DFS(row,col-1, maze))\r\n {\r\n \t// mark this as success.\r\n maze[row][col-1] = 3;\r\n return true;\r\n }\r\n if (canMove(row,col+1, maze))\r\n {\r\n // move right\r\n if (Traversal_DFS(row,col+1, maze))\r\n {\r\n \tmaze[row][col+1] = 3;\r\n return true;\r\n }\r\n }\r\n if (canMove(row-1,col, maze))\r\n {\r\n // move up\r\n if (Traversal_DFS(row-1,col, maze))\r\n {\r\n \tmaze[row-1][col] = 3;\r\n return true;\r\n }\r\n }\r\n if (canMove(row+1,col, maze))\r\n {\r\n // move down\r\n if (Traversal_DFS(row+1,col, maze))\r\n {\r\n \tmaze[row+1][col] = 3;\r\n return true;\r\n }\r\n }\r\n // Failure, unmark the cell and return false\r\n maze[row][col] = 0;\r\n return false;\r\n }","public static void findShortestPath(char[][] maze) {\n\t\tboolean visited[][] = new boolean[maze.length][maze[0].length]; \n\t\tint srcX = 0, srcY = 0;\n\t\t// find the source\n\t\tfor(int i=0; i<maze.length; i++) {\n\t\t\tfor(int j=0; j<maze[0].length; j++) {\n\t\t\t\tif(maze[i][j] == 's') {\n\t\t\t\t\tsrcX = i; srcY=j;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tboolean pe = doGridBFS(maze,visited,srcX,srcY);\n\t\tSystem.out.println(pe);\n\t\t\n\t}","public static void main(String[] args) {\n\t\tScanner sc = new Scanner(System.in);\n\t\tStack<Integer> st = new Stack<Integer>();\n\t\tQueue<Integer> que = new LinkedList<Integer>();\n\t\tArrayList<Integer> path = new ArrayList<>();\n\t\tint n = sc.nextInt();\n\t\tint m = sc.nextInt();\n\t\tint v = sc.nextInt();\n\t\tint [][] arr= new int [n+1][n+1];\n\t\tboolean [] visit = new boolean[n+1];\n\t\tfor(int i=0;i<m;i++) {\n\t\t\tint a = sc.nextInt();\n\t\t\tint b = sc.nextInt();\n\t\t\tarr[a][b] = 1;\n\t\t\tarr[b][a] = 1;\n\t\t}\n\t\tst.push(v);\n\t\twhile(!st.isEmpty()) {\n\t\t\tint temp = st.pop();\n\t\t\tif(visit[temp]) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tpath.add(temp);\n\t\t\tvisit[temp] = true;\n\t\t\tfor(int i=n;i>0;i--) {\n\t\t\t\tif(arr[temp][i]==1 && !visit[i]) {\n\t\t\t\t\tst.push(i);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<path.size();i++) {\n\t\t\tSystem.out.print(path.get(i)+\" \");\n\t\t}\n\t\tSystem.out.println();\n\t\tArrays.fill(visit, false);\n\t\tpath = new ArrayList<>();\n\t\tque.add(v);\n\t\twhile(!que.isEmpty()) {\n\t\t\tint temp = que.poll();\n\t\t\tif(visit[temp]) {\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tpath.add(temp);\n\t\t\tvisit[temp] = true;\n\t\t\tfor(int i=1;i<=n;i++) {\n\t\t\t\tif(arr[temp][i]==1 && !visit[i]) {\n\t\t\t\t\tque.add(i);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<path.size();i++) {\n\t\t\tSystem.out.print(path.get(i)+\" \");\n\t\t}\n\t}","void BFS(int s, int d) \r\n { \r\n int source = s;\r\n int destination = d;\r\n boolean visited[] = new boolean[V];\r\n int parent[] = new int[V];\r\n \r\n // Create a queue for BFS \r\n LinkedList<Integer> queue = new LinkedList<Integer>(); \r\n \r\n // Mark the current node as visited and enqueue it \r\n \r\n visited[s]=true; \r\n queue.add(s); \r\n System.out.println(\"Search Nodes: \");\r\n while (queue.size() != 0) \r\n { \r\n int index = 0;\r\n \r\n // Dequeue a vertex from queue and print it \r\n \r\n s = queue.poll();\r\n \r\n System.out.print(convert2(s)); \r\n \r\n if(s == destination)\r\n {\r\n break;\r\n }\r\n \r\n System.out.print(\" -> \");\r\n while(index < adj[s].size()) \r\n { \r\n \r\n \r\n int n = adj[s].get(index); \r\n if (!visited[n]) \r\n { \r\n visited[n] = true;\r\n parent[n] = s;\r\n queue.add(n); \r\n }\r\n index = index+ 2;\r\n \r\n \r\n }\r\n \r\n \r\n \r\n }\r\n int check = destination;\r\n int cost = 0, first, second = 0;\r\n String string = \"\" + convert2(check);\r\n while(check!=source)\r\n {\r\n \r\n first = parent[check];\r\n string = convert2(first) + \" -> \" + string;\r\n while(adj[first].get(second) != check)\r\n {\r\n second++;\r\n }\r\n cost = cost + adj[first].get(second +1);\r\n check = first;\r\n second = 0;\r\n \r\n }\r\n \r\n System.out.println(\"\\n\\nPathway: \");\r\n \r\n System.out.println(string);\r\n \r\n \r\n System.out.println(\"\\nTotal cost: \" + cost);\r\n }","@Override\n\t//loc1 is the start location,loc2 is the destination\n\tpublic ArrayList<MapCoordinate> bfsSearch(MapCoordinate loc1, MapCoordinate loc2, Map m) {\n\t\tSystem.out.println(\"come into bfsSearch\");\n\t\tif(m.isAgentHasAxe() && m.isAgentHasKey()){\n\t\t\tLinkedList<State> queue=new LinkedList<State>();\n\t\t\tArrayList<MapCoordinate> Visited=new ArrayList<MapCoordinate>();\n\t\t\t\n\t\t\t//Visited.add(loc1);\n\t\t\tState s1=new State(loc1,m.getAgentHasNStones(),null);\n\t\t\tqueue.add(s1);\n\t\t\t\n\t\t\twhile(!queue.isEmpty()){\n\t\t\t\tState s=queue.remove();\n\t\t\t\tMapCoordinate currentLocation=s.getLocation();\n\t\t\t\tVisited.add(s.getLocation()); //add to visited every loop\n\t\t\t\tif(loc2.equals(currentLocation)){\n\t\t\t\t\t//means could reach loc2 from loc1\n\t\t\t\t\tArrayList<MapCoordinate> route=new ArrayList<MapCoordinate>();\n\t\t\t\t\twhile(s.getPrevState()!=null){\n\t\t\t\t\t\troute.add(0,s.getLocation()); //add to head\n\t\t\t\t\t\ts=s.getPrevState();\n\t\t\t\t\t}\n\t\t\t\t\treturn route;\n\t\t\t\t}\n\t\t\t\tMapCoordinate temp=new MapCoordinate(currentLocation.getX()+1,currentLocation.getY());\n\t\t\t\tif(m.hasCoordinate(temp)){//state move east\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){ //this is important else if(cTemp!='~'), not barely else,\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\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\ttemp=new MapCoordinate(currentLocation.getX()-1,currentLocation.getY());\n\t\t\t\tif(m.hasCoordinate(temp)){//state move south\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\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\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()+1);\n\t\t\t\tif(m.hasCoordinate(temp)){//state move north\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\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\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()-1);\n\t\t\t\tif(m.hasCoordinate(temp)){//state move south\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' ){\n\t\t\t\t\t\t\tif(cTemp=='~' &&s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\t\n\t\t\t}\n\t\t\treturn null;\n\t\t}else if(m.isAgentHasAxe()){ //only have axe\n\t\t\tLinkedList<State> queue=new LinkedList<State>();\n\t\t\tArrayList<MapCoordinate> Visited=new ArrayList<MapCoordinate>();\n\t\t\t\n\t\t\t//Visited.add(loc1);\n\t\t\tState s1=new State(loc1,m.getAgentHasNStones(),null);\n\t\t\tqueue.add(s1);\n\t\t\t\n\t\t\twhile(!queue.isEmpty()){\n\t\t\t\tState s=queue.remove();\n\t\t\t\tMapCoordinate currentLocation=s.getLocation();\n\t\t\t\tVisited.add(s.getLocation()); //add visited every loop\n\t\t\t\tif(loc2.equals(currentLocation)){\n\t\t\t\t\t//means could reach loc2 from loc1\n\t\t\t\t\tArrayList<MapCoordinate> route=new ArrayList<MapCoordinate>();\n\t\t\t\t\twhile(s.getPrevState()!=null){\n\t\t\t\t\t\troute.add(0,s.getLocation()); //add to head\n\t\t\t\t\t\ts=s.getPrevState();\n\t\t\t\t\t}\n\t\t\t\t\treturn route;\n\t\t\t\t}\n\t\t\t\tMapCoordinate temp=new MapCoordinate(currentLocation.getX()+1,currentLocation.getY());\n\t\t\t\tif(m.hasCoordinate(temp)){//state move south\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='-' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='-' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\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\ttemp=new MapCoordinate(currentLocation.getX()-1,currentLocation.getY());\n\t\t\t\tif(m.hasCoordinate(temp)){//state move south\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='-' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='-' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\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\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()+1);\n\t\t\t\tif(m.hasCoordinate(temp)){//state move north\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='-' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='-' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\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\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()-1);\n\t\t\t\tif(m.hasCoordinate(temp)){//state move south\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='-' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='-' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\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\treturn null;\n\t\t}else if(m.isAgentHasKey()){ //only have key\n\t\t\tLinkedList<State> queue=new LinkedList<State>();\n\t\t\tArrayList<MapCoordinate> Visited=new ArrayList<MapCoordinate>();\n\t\t\t\n\t\t\t//Visited.add(loc1);\n\t\t\tState s1=new State(loc1,m.getAgentHasNStones(),null);\n\t\t\tqueue.add(s1);\n\t\t\t\n\t\t\twhile(!queue.isEmpty()){\n\t\t\t\tState s=queue.remove();\n\t\t\t\tMapCoordinate currentLocation=s.getLocation();\n\t\t\t\tVisited.add(s.getLocation());\n\t\t\t\tif(loc2.equals(currentLocation)){\n\t\t\t\t\t//means could reach loc2 from loc1\n\t\t\t\t\tArrayList<MapCoordinate> route=new ArrayList<MapCoordinate>();\n\t\t\t\t\twhile(s.getPrevState()!=null){\n\t\t\t\t\t\troute.add(0, s.getLocation()); //add to head,in this fashion, return the right order of route\n\t\t\t\t\t\ts=s.getPrevState();\n\t\t\t\t\t}\n\t\t\t\t\treturn route;\n\t\t\t\t}\n\t\t\t\tMapCoordinate temp=new MapCoordinate(currentLocation.getX()+1,currentLocation.getY()); \n\t\t\t\tif(m.hasCoordinate(temp)){//state move east\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='T' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\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\ttemp=new MapCoordinate(currentLocation.getX()-1,currentLocation.getY()); //state that move west\n\t\t\t\tif(m.hasCoordinate(temp)){\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='T' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\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\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()+1); //state move north\n\t\t\t\tif(m.hasCoordinate(temp)){\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='T' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\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\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()-1); //state move south\n\t\t\t\tif(m.hasCoordinate(temp)){\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for initial state\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='T' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\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\treturn null;\n\t\t}\n\t\t\n\t\t\n\t\t/*\n\t\t * \n\t\t **/\t\t\n\t\telse{ //have no key and axe\n\t\t\tSystem.out.println(\"come into the last elas clause\");\n\t\t\tLinkedList<State> queue=new LinkedList<State>();\n\t\t\tArrayList<MapCoordinate> Visited=new ArrayList<MapCoordinate>();\n\t\t\t\n\t\t\tVisited.add(loc1);\n\t\t\tState s1=new State(loc1,m.getAgentHasNStones(),null);\n\t\t\tqueue.add(s1);\n\t\t\t\n\t\t\t//int i=0;\n\t\t\twhile(!queue.isEmpty()){\n\t\t\t\t//i++;\n\t\t\t\t//System.out.println(\"come into while: \"+i);\n\t\t\t\tState s=queue.remove();\n\t\t\t\tMapCoordinate currentLocation=s.getLocation();\n\t\t\t\tVisited.add(s.getLocation()); //add visited, let program won't stuck in \n\t\t\t\tif(loc2.equals(currentLocation)){\n\t\t\t\t\t//means could reach loc2 from loc1\n\t\t\t\t\tSystem.out.println(\"return computed route\");\n\t\t\t\t\tArrayList<MapCoordinate> route=new ArrayList<MapCoordinate>();\n\t\t\t\t\twhile(s.getPrevState()!=null){\n\t\t\t\t\t\troute.add(0, s.getLocation()); //add to head\n\t\t\t\t\t\ts=s.getPrevState();\n\t\t\t\t\t}\n\t\t\t\t\tfor(MapCoordinate mc:route){\n\t\t\t\t\t\t//System.out.println(\"print returned route in bfssearch\");\n\t\t\t\t\t\tSystem.out.print(\"mc:\"+mc.getX()+\" \"+mc.getY()+\"->\");\n\t\t\t\t\t\t\n\t\t\t\t\t}\n\t\t\t\t\treturn route;\n\t\t\t\t}\n\t\t\t\tMapCoordinate temp=new MapCoordinate(currentLocation.getX()+1,currentLocation.getY());\n\t\t\t\tif(m.hasCoordinate(temp)){\n\t\t\t\t\t//System.out.println(\"1 if\");\n\t\t\t\t\tif(s.getPrevState()!=null &&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if\");\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 if\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 if\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 else\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for the initial state \n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\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\ttemp=new MapCoordinate(currentLocation.getX()-1,currentLocation.getY());\n\t\t\t\tif(m.hasCoordinate(temp)){\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.add(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for the initial state \n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\tSystem.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\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\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()+1);\n\t\t\t\tif(m.hasCoordinate(temp)){\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*'&&cTemp!='T'&&cTemp!='-' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for the initial state \n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\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\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()-1);\n\t\t\t\tif(m.hasCoordinate(temp)){\n\t\t\t\t\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T' &&cTemp!='-' ){\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}//do not do any action for not enough stones situation\n\t\t\t\t\t\t}\n\t\t\t\t\t}else if(s.getPrevState()==null){ //for the initial state \n\t\t\t\t\t\tchar cTemp=m.getSymbol(temp);\n\t\t\t\t\t\t//System.out.println(\"2 if lalala\");\n\t\t\t\t\t\tif(cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\n\t\t\t\t\t\t\t//System.out.println(\"3 iflalala\");\n\t\t\t\t\t\t\tif(cTemp=='~' && s.getStoneNumber()>0){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 iflalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\n\t\t\t\t\t\t\t\tqueue.addLast(newState);\n\t\t\t\t\t\t\t}else if(cTemp!='~'){\n\t\t\t\t\t\t\t\t//System.out.println(\"4 elselalala\");\n\t\t\t\t\t\t\t\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\n\t\t\t\t\t\t\t\tqueue.addFirst(newState);\n\t\t\t\t\t\t\t}//do not do any action for not enough stones situation\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\treturn null;\n\t\t}\n\t}","Deque<SearchStackElementCategory> getSearchStack() throws Exception;","private void breadthFirstSearch (int start, int[] visited, int[] parent){\r\n Queue< Integer > theQueue = new LinkedList< Integer >();\r\n boolean[] identified = new boolean[getNumV()];\r\n identified[start] = true;\r\n theQueue.offer(start);\r\n while (!theQueue.isEmpty()) {\r\n int current = theQueue.remove();\r\n visited[current] = 1; //ziyaret edilmis vertexler queuedan cikarilan vertexlerdir\r\n Iterator < Edge > itr = edgeIterator(current);\r\n while (itr.hasNext()) {\r\n Edge edge = itr.next();\r\n int neighbor = edge.getDest();\r\n if (!identified[neighbor]) {\r\n identified[neighbor] = true;\r\n theQueue.offer(neighbor);\r\n parent[neighbor] = current;\r\n }\r\n }\r\n }\r\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 }","private void solve(int x, int y, boolean draw) {\n \t\t// these are the walls of the maze, maze solver should not go beyond\n \t\t// walls\n \t\t// if (x == 0 || y == 0 || x == N + 1 || y == N + 1) {\n \t\t// return;\n \t\t// }\n \n \t\t// if we have already visited this position\n \t\t// or if deep levels of the recursion have found the target\n \t\tif (foundTarget || visited[x][y])\n \t\t\treturn;\n \n \t\t// this position is new, mark it as visited\n \t\tvisited[x][y] = true;\n \n \t\tif (draw) {\n \t\t\t// Draw a blue dot to show we have been here\n \t\t\tStdDraw.setPenColor(StdDraw.BLUE);\n \t\t\tStdDraw.filledCircle(x + 0.5, y + 0.5, 0.25);\n \t\t\tStdDraw.show(SOLVER_SPEED);\n \t\t}\n \n \t\t// if we have reached the maze solve target\n \t\tif (x == target.x && y == target.y) {\n \t\t\tfoundTarget = true;\n \t\t}\n \n \t\t// Try go another place\n \t\tif (!north[x][y])\n \t\t\tsolve(x, y + 1, draw);\n \t\tif (!east[x][y])\n \t\t\tsolve(x + 1, y, draw);\n \t\tif (!south[x][y])\n \t\t\tsolve(x, y - 1, draw);\n \t\tif (!west[x][y])\n \t\t\tsolve(x - 1, y, draw);\n \n \t\tif (foundTarget)\n \t\t\treturn;\n \n \t\tif (draw) {\n \t\t\t// Draw a grey dot to show we have backtracked\n \t\t\tStdDraw.setPenColor(StdDraw.GRAY);\n \t\t\tStdDraw.filledCircle(x + 0.5, y + 0.5, 0.25);\n \t\t\tStdDraw.show(SOLVER_SPEED);\n \t\t}\n \t}","private boolean bfs(int[] pos, int[][] dis, int[][] grid,int m, int n,int bcnt){\n Queue<int[]> q = new LinkedList<>();\n int curx=0, cury=0, curlevel=0 ;\n int newx = 0, newy=0, newlevel = 0;\n int[] cur;\n boolean availableplace = false;\n boolean[][] vd = new boolean[m][n];\n int res =0;\n vd[pos[0]][pos[1]] = true;\n q.offer(pos);\n while(!q.isEmpty()){\n cur = q.poll();\n curx = cur[0];\n cury = cur[1];\n curlevel = cur[2];\n vd[curx][cury]=true;\n for(int[] mm : M){\n newx = curx+mm[0];\n newy = cury+mm[1];\n if(newx >=0 && newx <m && newy >=0 && newy <n && !vd[newx][newy] &&grid[newx][newy]!=2){\n vd[newx][newy] = true;\n if(grid[newx][newy]==1) res++;\n else if(grid[newx][newy]==0){\n availableplace = true;\n dis[newx][newy]+=curlevel;\n q.offer(new int[]{newx,newy,curlevel+1});\n }\n }\n }\n }\n return res==bcnt-1&&availableplace;\n }","static int[] bfs(int n, int m, int[][] edges, int s) {\r\n \r\n HashSet<Integer> aList[] = new HashSet[n];\r\n // Array of the nodes of the tree\r\n\r\n Queue<Integer> bfsQueue = new LinkedList();\r\n\r\n boolean visited[] = new boolean[n];\r\n // check if a node is visited or not\r\n\r\n\r\n int cost[] = new int[n];\r\n // cost to travel from one node to other\r\n\r\n for (int i = 0; i < n; i++) {\r\n // intialising the values\r\n visited[i] = false;\r\n cost[i] = -1;\r\n\r\n aList[i] = new HashSet<Integer>();\r\n // Each element of aList is a Set\r\n // To store the neighbouring nodes of a particular node\r\n }\r\n\r\n for (int i = 0; i < m; i++) {\r\n // let node[i] <--> node[j]\r\n\r\n // adding node[j] to neighbours list of node[i]\r\n aList[edges[i][0] - 1].add(edges[i][1] - 1);\r\n\r\n // adding node[i] to neighbours list of node[j]\r\n aList[edges[i][1] - 1].add(edges[i][0] - 1);\r\n }\r\n\r\n //\r\n s = s - 1;\r\n bfsQueue.add(s);\r\n visited[s] = true;\r\n cost[s] = 0;\r\n //\r\n \r\n \r\n while (!bfsQueue.isEmpty()) {\r\n \r\n int curr = bfsQueue.poll();\r\n // takes the last element of the queue\r\n \r\n for (int neigh : aList[curr]) { // iterating the neighbours of node 'curr'\r\n if (!visited[neigh]) { // checking if node neigh id already visited during the search\r\n visited[neigh ] = true;\r\n bfsQueue.add(neigh); //add the node neigh to bfsqueue\r\n cost[neigh] = cost[curr] + 6; \r\n }\r\n }\r\n }\r\n\r\n int result[] = new int[n-1];\r\n\r\n for (int i=0, j=0; i<n && j<n-1; i++, j++) {\r\n if (i == s){\r\n i++;\r\n }\r\n result[j] = cost[i];\r\n }\r\n \r\n return result;\r\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}","private Stack<MapLocation> findPath(State.StateView state)\n {\n Unit.UnitView townhallUnit = state.getUnit(townhallID);\n Unit.UnitView footmanUnit = state.getUnit(footmanID);\n \n MapLocation startLoc = new MapLocation(footmanUnit.getXPosition(), footmanUnit.getYPosition(), null, 0);\n \n MapLocation goalLoc = new MapLocation(townhallUnit.getXPosition(), townhallUnit.getYPosition(), null, 0);\n \n MapLocation footmanLoc = null;\n if(enemyFootmanID != -1) {\n Unit.UnitView enemyFootmanUnit = state.getUnit(enemyFootmanID);\n footmanLoc = new MapLocation(enemyFootmanUnit.getXPosition(), enemyFootmanUnit.getYPosition(), null, 0);\n }\n \n // get resource locations\n List<Integer> resourceIDs = state.getAllResourceIds();\n Set<MapLocation> resourceLocations = new HashSet<MapLocation>();\n for(Integer resourceID : resourceIDs)\n {\n ResourceNode.ResourceView resource = state.getResourceNode(resourceID);\n \n resourceLocations.add(new MapLocation(resource.getXPosition(), resource.getYPosition(), null, 0));\n }\n \n return AstarSearch(startLoc, goalLoc, state.getXExtent(), state.getYExtent(), footmanLoc, resourceLocations);\n }","public boolean solveMaze(int x, int y, String direction){\n\n if (maze[x][y] == \"E\"){\n solved = true;\n return solved;\n\n }\n\n if(!(maze[x][y].equals(\"S\") || maze[x][y].equals(\"E\"))){\n maze[x][y] = \"X\";\n }\n\n if(direction != \"up\" && isReachable(x+1, y)){\n solveMaze(x + 1, y, \"down\");\n if(solved) return true;\n }\n if(direction != \"left\" && isReachable(x, y+ 1)){\n solveMaze(x, y + 1, \"right\");\n if(solved) return true;\n }\n if(direction != \"down\" && isReachable(x-1, y)){\n solveMaze(x - 1 , y, \"up\");\n if(solved) return true;\n }\n if(direction != \"right\" && isReachable(x, y -1)){\n solveMaze(x, y - 1, \"left\");\n if(solved) return true;\n }\n\n //If cannot move, do backtracking\n if(!solved) {\n maze[x][y] = \" \";\n return false;\n }\n\n return false;\n }","@Override\n\t\t\tpublic void run() \n\t\t\t{\n\t\t\t\tif(!(mazeCollection.containsKey(paramArray[0])))\n\t\t\t\t{\n\t\t\t\t\tc.passError(\"Maze doesn't exist\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\t/*\n\t\t\t\t//if solution for this maze exists\n\t\t\t\tif(mazeSolutions.containsKey(mazeCollection.get(paramArray[0])))\n\t\t\t\t{\n\t\t\t\t\tc.passSolve(\"Solution for \"+paramArray[0]+ \" is ready\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t*/\n\t\t\t\t\n\t\t\t\tif(paramArray[1].toString().equals(\"bfs\"))\n\t\t\t\t{\n\t\t\t\t\tMazeAdapter ms=new MazeAdapter(mazeCollection.get(paramArray[0]));\n\t\t\t\t\t\n\t\t\t\t\tSearcher<Position> bfs=new BFS<Position>();\n\t\t\t\t\tSolution<Position> sol=bfs.search(ms);\n\t\t\t\t\t\n\t\t\t\t\t//check if solution for the maze already exists, if so, replace it with the new one\n\t\t\t\t\tif(mazeSolutions.containsKey(mazeCollection.get(paramArray[0]))) {\n\t\t\t\t\t\tmazeSolutions.remove(mazeCollection.get(paramArray[0]));\n\t\t\t\t\t\tmazeSolutions.put(mazeCollection.get(paramArray[0]), sol);\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tmazeSolutions.put(mazeCollection.get(paramArray[0]), sol);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tc.passSolve(\"Solution for \"+paramArray[0]+ \" is ready\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\telse if(paramArray[1].toString().equals(\"dfs\"))\n\t\t\t\t{\n\t\t\t\t\tMazeAdapter ms=new MazeAdapter(mazeCollection.get(paramArray[0]));\n\t\t\t\t\t\n\t\t\t\t\tSearcher<Position> dfs=new DFS<Position>();\n\t\t\t\t\tSolution<Position> sol=dfs.search(ms);\n\t\t\t\t\t\n\t\t\t\t\t//check if solution for the maze already exists, if so, replace it with the new one\n\t\t\t\t\tif(mazeSolutions.containsKey(mazeCollection.get(paramArray[0]))) {\n\t\t\t\t\t\tmazeSolutions.remove(mazeCollection.get(paramArray[0]));\n\t\t\t\t\t\tmazeSolutions.put(mazeCollection.get(paramArray[0]), sol);\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tmazeSolutions.put(mazeCollection.get(paramArray[0]), sol);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tc.passSolve(\"Solution for \"+paramArray[0]+ \" is ready\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tc.passError(\"Invalid algorithm\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\t\n\t\t\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 String findCheese(Place startingPoint) {\nif (startingPoint==null)\n\treturn null;\n\nvisited.add(startingPoint);\nStack<Place> vstdstack=new Stack<Place>();\nvstdstack.add(startingPoint);\n//Stack<c> pather=\"start->\";\nwhile(!vstdstack.isEmpty())\n{\n\tPlace curpos=getNextPlace(vstdstack.peek());\n if (curpos==null)\n {\n vstdstack.pop();\n soln.deleteCharAt(soln.length()-1);\n continue;\n }\n if(curpos.isCheese())\n return soln.toString();\n else \n vstdstack.push(curpos);\n \n}\nreturn null;\n}","private boolean solveNext(){\n Stack<Integer[]> emptyPositions = findEmptyPositions();\n\n while (!emptyPositions.isEmpty()) {\n\n //get the top empty position from the stack.\n Integer[] position = emptyPositions.peek();\n int row = position[0];\n int col = position[1];\n\n for (int value = 1; value <= size; value++) {\n if (isPositionValid(row, col, value)){\n\n //value is valid, we can set it to the board.\n board[row][col] = value;\n\n //recursive backtracking\n if(solveNext()) {\n\n //if the value leads to a solution, pop it from the stack.\n emptyPositions.pop();\n return true;\n }\n else board[row][col] = 0;\n\n }\n }\n return false;\n }\n return true;\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}","static void stack_search(Stack<Integer> stack,int element)\r\n\t{\r\n\t\tInteger positionOfStackElements=(Integer) stack.search(element);\r\n\t\tif(positionOfStackElements==-1)\r\n\t\t\tSystem.out.println(\"Element not found\");\r\n\t\telse System.out.println(\"Element is found at position :\"+ positionOfStackElements);\r\n\t\t\r\n\t}","void BFS(int s);","private void breadthFirstSearch(Node sourceNode, Node destinationNode, String path, HashSet<Character> visited) {\n // Create a list of nodes to visit (children of nodes)\n LinkedList<Node> nextToVisit = new LinkedList<>();\n // Add the first node to the list\n nextToVisit.add(sourceNode);\n\n // Traverse level by level by traversing to all of its children first\n while(!nextToVisit.isEmpty()) {\n Node node = nextToVisit.remove();\n // If its visited already, continue to the next child\n if(visited.contains(node.charId)) {\n continue;\n }\n // Mark the node as visited\n path += \"->\" + node.charId;\n visited.add(node.charId);\n // If destination is reached\n if(node == destinationNode) {\n paths.add(path);\n return;\n }\n // Add all of its children to the next node to visit\n for(Node children : node.adjacent) {\n nextToVisit.add(children);\n }\n }\n\n }","private void bfs(int[][] board){\n int[][] original = {{1,2,3},{4,5,0}};\n LinkedList<Cell> queue = new LinkedList<>();\n HashMap<Cell,int[][]> states = new HashMap<Cell,int[][]>();\n Set<String> seen = new HashSet<>();\n queue.offer(new Cell(1,2));\n states.put(queue.peekFirst(),original);\n int step = 0;\n while(step <= maxStep){\n int sz = queue.size();\n while(sz-- > 0){\n Cell cur = queue.pollFirst();\n int[][] curBoard = states.get(cur);\n if(seen.contains(this.toStr(curBoard))){\n continue;\n }\n seen.add(this.toStr(curBoard));\n \n if (isSame(curBoard,board)){\n this.res = step;\n return;\n }\n // move around\n for(int i = 0; i < 4; ++i){\n int r = cur.row + dr[i];\n int c = cur.col + dc[i];\n if(r < 0 || c < 0 || r > 1 || c > 2) continue; \n Cell next = new Cell(r, c);\n queue.offer(next);\n int[][] nextboard = this.clone(curBoard);\n nextboard[cur.row][cur.col] = nextboard[r][c];\n nextboard[r][c] = 0;\n states.put(next,nextboard);\n }\n }\n ++step;\n }\n return;\n }","public static void userSelection_SolveMaze(int userInputN){\n\n\t\tint[] S = new int[(int) Math.pow(userInputN, 2)];\n\t\tgNode[] G = new gNode[S.length];\n\n\t\tboolean [] visited = new boolean[S.length];\t\t//Initialize\n\t\tfor(int i=0; i<visited.length;i++)\n\t\t\tvisited[i] = false;\n\n\t\tint [] path = new int[S.length];\t\t//Initialize \n\t\tfor(int i=0; i<path.length; i++)\n\t\t\tpath[i]=-1;\n\n\t\tScanner input = new Scanner(System.in);\n\t\tSystem.out.println(\"How would you like to solve the maze?\\n\"\n\t\t\t\t+ \"1.\\tBreadth-First Search\\n\"\n\t\t\t\t+ \"2.\\tDepth-First Search\\n\"\n\t\t\t\t+ \"3.\\tDepth-First Search with Recursion\");\n\t\t\n\t\tint ur = input.nextInt();\n\t\t\n\t\tif(ur==1)\t//Breadth-First Search\t\t\\///gNode && start @ position 0\n\t\t\tbfs(G, visited, path, 0);\n\t\telse if(ur==2)\t//Depth-First Search\n\t\t\tdfs_Stack(G, visited, path, 0);\n\t\telse if(ur==3)\t//Depth-First Search w/recursion\t\n\t\t\tdfsRecursion(G, visited, path, 0);\t\n\t\telse{\n\t\t\tSystem.out.println(\"Invalid option. Please enter the appropriate integer value\");\n\t\t\tuserSelection_SolveMaze(userInputN);\n\t\t}\n\t\t\n\t\tinput.close();\n\t}","public void solve(char[][] board) {\n\t\tif(board==null || board.length == 0)\n\t\t\treturn;\n\t\tint rows = board.length;\n\t\tint cols = board[0].length;\n\t\t\n\t\tQueue<Integer> exploreList = new LinkedList<Integer>();\n\t\tfor(int i=0; i< rows;i++){\n\t\t\tbfs(board, i, 0, rows, cols, exploreList);\n\t\t\tbfs(board, i, cols-1, rows, cols, exploreList);\n\t\t}\n\t\t\n\t\tfor(int j=1; j< cols; j++){\n\t\t\tbfs(board, 0, j, rows, cols, exploreList);\n\t\t\tbfs(board, rows-1, j, rows, cols, exploreList);\n\t\t}\n\t\t\n\t\tfor(int i=0; i<rows; i++){\n\t\t\tfor(int j=0; j<cols; j++){\n\t\t\t\tif(board[i][j] =='D')\n\t\t\t\t\tboard[i][j] = 'O';\n\t\t\t\telse if(board[i][j] == 'O')\n\t\t\t\t\tboard[i][j] = 'X';\n\t\t\t}\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 }","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}","public void search(ArrayList<String> path, TrieNode root, char[][] board,\n int x, int y, boolean[][] visited) {\n if (root.isString == true) {\n if (!path.contains(root.s)) {\n path.add(root.s);\n }\n }\n\n if (x < 0 || x >= board.length || y < 0 || y >= board[0].length\n || visited[x][y] == true || root == null) {\n return;\n }\n // DFS\n if (root.subtree.containsKey(board[x][y])) {\n for (int i = 0; i < 4; ++i) {\n visited[x][y] = true;\n search(path, root.subtree.get(board[x][y]), board, x + dx[i], y + dy[i],\n visited);\n visited[x][y] = false;\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 }","public DSAQueue breadthFirstSearch(String start, String target)\n\t{\n\t\tif(!vertices.isEmpty())\n\t\t{\n\t\t\tDSAQueue queue = new DSAQueue();\n\t\t\tDSAStack visited = new DSAStack();\t//creates empty stack\n\t\t\tDSAGraphVertex vx = getVertex(start); //vertex to start on (root)\n\t\t\tDSAGraphVertex dest = getVertex(target); //vertex to start on (dest)\n\n\t\t\tclear(); //sets all visited on all vertices == false\n\t\t\tvx.setVisited(); // Marks root as visited\n\t\t\tqueue.enqueue(vx); //adds start point to queue\n\n\t\t\tbfs(vx, visited, queue, dest); //begin recursion\n\n\t\t\tqueue.enqueue(dest); //if successful adds destination to queue\n\n\t\t\treturn queue;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthrow new NoSuchElementException(\"List is empty or start or end elements don't exist\");\n\t\t}\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 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}","public abstract List<Direction> searchForCheese(Maze maze);","public void traverseStack(){\n // check if there is any stack present or not\n if(this.arr==null){\n System.out.println(\"No stack present, first create a stack\");\n return;\n }\n // check if stack is empty\n if(this.topOfStack==-1){\n System.out.println(\"Stack is empty, can't traverse\");\n return;\n }\n // if stack is not empty\n System.out.println(\"Printing stack...\");\n for(int i=0;i<=this.topOfStack;i++){\n System.out.print(this.arr[i]+\" \");\n }\n System.out.println();\n }","public TreeNode DFS(int ps,int pe, int is, int ie, int[] postorder, int[] inorder){\n if(ps>pe || is>ie) return null;\n int numroot = postorder[pe];\n TreeNode root = new TreeNode(numroot);\n\n int index = is;\n for(int i=is;i<=ie;i++){\n if(inorder[i]==numroot){\n index = i;\n }\n }\n int rightlen = ie-index;\n root.left = DFS(ps,pe-rightlen-1,is,index-1,postorder,inorder);\n root.right = DFS(pe-rightlen,pe-1,index+1,ie,postorder,inorder);\n return root;\n\n }","private void bfs(Dungeon d, Site s) {\n\t\t\n\t\t// use a queue to do BFS, and initialize instance variables\n\t\tQueue<Site> q = new LinkedList<Site>();\n\t\tfor (int x = 0; x < d.size(); x++)\n\t\t\tfor (int y = 0; y < d.size(); y++)\n\t\t\t\tdistTo[x][y] = INFINITY; \n\t\tdistTo[s.getX()][s.getY()] = 0;\n\t\tmarked[s.getX()][s.getY()] = true;\n\t\t\n\t\t// pop site from queue until it's empty\n\t\tq.offer(s);\n\t\twhile (!q.isEmpty()) {\n\t\t\t\n\t\t\t// pop the next site in the queue\n\t\t\tSite v = q.poll(); \t \n\t\t\tint x = v.getX();\n\t\t\tint y = v.getY();\n\n\t\t\t// 4 adjacent sites\n\t\t\tSite east = new Site(x + 1, y);\n\t\t\tSite west = new Site(x - 1, y);\n\t\t\tSite north = new Site(x, y - 1);\n\t\t\tSite south = new Site(x, y + 1);\n\n\t\t\t// BFS the rest of the dungeon\n\t\t\tif (d.isLegalMove(v, east) && !marked[east.getX()][east.getY()]) {\n\t\t\t\tedgeTo[east.getX()][east.getY()] = v;\n\t\t\t\tdistTo[east.getX()][east.getY()] = distTo[x][y] + 1;\n\t\t\t\tmarked[east.getX()][east.getY()] = true;\n\t\t\t\tq.offer(east);\n\t\t\t}\n\t\t\tif (d.isLegalMove(v, west) && !marked[west.getX()][west.getY()]) {\n\t\t\t\tedgeTo[west.getX()][west.getY()] = v;\n\t\t\t\tdistTo[west.getX()][west.getY()] = distTo[x][y] + 1;\n\t\t\t\tmarked[west.getX()][west.getY()] = true;\n\t\t\t\tq.offer(west);\n\t\t\t}\n\t\t\tif (d.isLegalMove(v, north) && !marked[north.getX()][north.getY()]) {\n\t\t\t\tedgeTo[north.getX()][north.getY()] = v;\n\t\t\t\tdistTo[north.getX()][north.getY()] = distTo[x][y] + 1;\n\t\t\t\tmarked[north.getX()][north.getY()] = true;\n\t\t\t\tq.offer(north);\n\t\t\t}\n\t\t\tif (d.isLegalMove(v, south) && !marked[south.getX()][south.getY()]) {\n\t\t\t\tedgeTo[south.getX()][south.getY()] = v;\n\t\t\t\tdistTo[south.getX()][south.getY()] = distTo[x][y] + 1;\n\t\t\t\tmarked[south.getX()][south.getY()] = true;\n\t\t\t\tq.offer(south);\n\t\t\t}\n\n\t\t}\n\n\t}","static int BFS(int mat[][], Point src,\n\t\t\t\t\t\t\tPoint dest)\n{\n\t// check source and destination cell\n\t// of the matrix have value 1\n\tif (mat[src.x][src.y] != 1 ||\n\t\tmat[dest.x][dest.y] != 1)\n\t\treturn -1;\n\n\tboolean [][]visited = new boolean[ROW][COL];\n\t\n\t// Mark the source cell as visited\n\tvisited[src.x][src.y] = true;\n\n\t// Create a queue for BFS\n\tQueue<queueNode> q = new LinkedList<>();\n\t\n\t// Distance of source cell is 0\n\tqueueNode s = new queueNode(src, 0);\n\tq.add(s); // Enqueue source cell\n\n\t// Do a BFS starting from source cell\n\twhile (!q.isEmpty())\n\t{\n\t\tqueueNode curr = q.peek();\n\t\tPoint pt = curr.pt;\n\n\t\t// If we have reached the destination cell,\n\t\t// we are done\n\t\tif (pt.x == dest.x && pt.y == dest.y)\n\t\t\treturn curr.dist;\n\n\t\t// Otherwise dequeue the front cell\n\t\t// in the queue and enqueue\n\t\t// its adjacent cells\n\t\tq.remove();\n\n\t\tfor (int i = 0; i < 4; i++)\n\t\t{\n\t\t\tint row = pt.x + rowNum[i];\n\t\t\tint col = pt.y + colNum[i];\n\t\t\t\n\t\t\t// if adjacent cell is valid, has path\n\t\t\t// and not visited yet, enqueue it.\n\t\t\tif (isValid(row, col) &&\n\t\t\t\t\tmat[row][col] == 1 &&\n\t\t\t\t\t!visited[row][col])\n\t\t\t{\n\t\t\t\t// mark cell as visited and enqueue it\n\t\t\t\tvisited[row][col] = true;\n\t\t\t\tqueueNode Adjcell = new queueNode\n\t\t\t\t\t\t\t(new Point(row, col),\n\t\t\t\t\t\t\t\tcurr.dist + 1 );\n\t\t\t\tq.add(Adjcell);\n\t\t\t}\n\t\t}\n\t}\n\n\t// Return -1 if destination cannot be reached\n\treturn -1;\n}","public static Vector<int []> BFS(int[] startPosition,int[] unexploreNode, mapNode[][] nodes){\n\t\t\r\n\t\tVector<int []> shortestPath;\r\n\t\t\r\n\t\t//initial all nodes' status to UN-visited\r\n\t\tfor(int i = 0; i < nodes.length; i++)\r\n\t\t{\r\n\t\t\tfor(int j = 0; j < nodes[i].length;j++)\r\n\t\t\t{\r\n\t\t\t\tnodes[i][j].setTotDistance(999999999);//set the initial distance to INF\r\n\t\t\t\tnodes[i][j].gridPosition[0] = i;//save current node x position\r\n\t\t\t\tnodes[i][j].gridPosition[1] = j;//save current node y position\r\n\t\t\t\tnodes[i][j].setNodeVistied(false);//set all nodes are not visited yet\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\t\t//create start node and add it into the execution queue\r\n\t\tmapNode tempNode = new mapNode();\r\n\t\ttempNode = nodes[startPosition[0]][startPosition[1]];\r\n\t\tVector<mapNode> tempQueue = new Vector<mapNode>();\r\n\t\ttempQueue.add(tempNode);\r\n\t\t//main loop: check all nodes on the map\r\n\t\twhile(tempQueue.size() != 0)\r\n\t\t{\r\n\t\t\t//create four nearby nodes\r\n\t\t\tmapNode tempTopNode = new mapNode();\r\n\t\t\tmapNode tempBottomNode = new mapNode();\r\n\t\t\tmapNode tempLeftNode = new mapNode();\r\n\t\t\tmapNode tempRightNode = new mapNode();\r\n\t\t\t\t\r\n\t\t\t//update Top node information from original nodes matrix\r\n\t\t\tif(tempQueue.get(0).topNode != null)\r\n\t\t\t{\r\n\t\t\t\ttempTopNode = nodes[tempQueue.get(0).topNode.gridPosition[0]][tempQueue.get(0).topNode.gridPosition[1]];\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\ttempTopNode = null;\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t//update Bottom node information from original nodes matrix\r\n\t\t\tif(tempQueue.get(0).bottomNode != null)\r\n\t\t\t{\r\n\t\t\t\ttempBottomNode = nodes[tempQueue.get(0).bottomNode.gridPosition[0]][tempQueue.get(0).bottomNode.gridPosition[1]];\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\ttempBottomNode = null;\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t//update Left node information from original nodes matrix\r\n\t\t\tif(tempQueue.get(0).leftNode != null)\r\n\t\t\t{\r\n\t\t\t\ttempLeftNode = nodes[tempQueue.get(0).leftNode.gridPosition[0]][tempQueue.get(0).leftNode.gridPosition[1]];\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\ttempLeftNode = null;\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t//update Right node information from original nodes matrix\r\n\t\t\tif(tempQueue.get(0).rightNode != null)\r\n\t\t\t{\r\n\t\t\t\ttempRightNode = nodes[tempQueue.get(0).rightNode.gridPosition[0]][tempQueue.get(0).rightNode.gridPosition[1]];\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\ttempRightNode = null;\r\n\t\t\t}\r\n\t\t\t\t\r\n\t\t\t//start re-calculate distance of each node\r\n\t\t\t//check the top node and update new distance\r\n\t\t\tif(tempTopNode != null)\r\n\t\t\t{\r\n\t\t\t\tif(tempTopNode.getNodeVisited() == false && tempTopNode.getOwnElevation() != 999999999 && tempTopNode.getStatus() != Status.EXPLORED )\r\n\t\t\t\t{\r\n\t\t\t\t\tVector<int[]> tempPath = new Vector<int[]>();\r\n\t\t\t\t\t//record the path\r\n\t\t\t\t\tfor(int m = 0; m < tempQueue.get(0).getTotPath().size(); m++)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tint[] tempXY = new int[2];\r\n\t\t\t\t\t\ttempXY = tempQueue.get(0).getTotPath().get(m);\r\n\t\t\t\t\t\ttempPath.add(tempXY);\r\n\t\t\t\t\t}\r\n\t\t\t\t\t//check new node to see if exists in path\r\n\t\t\t\t\tif(checkPositionInPath(tempPath, tempQueue.get(0).gridPosition[0], tempQueue.get(0).gridPosition[1]) == false)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tint[] tempXY2 = new int[2];\r\n\t\t\t\t\t\ttempXY2 = tempQueue.get(0).gridPosition;\r\n\t\t\t\t\t\ttempPath.add(tempXY2);\r\n\t\t\t\t\t}\r\n\t\t\t\t\t//assign new path to the node\r\n\t\t\t\t\ttempTopNode.setTotPath(tempPath);\r\n\t\t\t\t\t//update data back to original matrix\r\n\t\t\t\t\ttempTopNode.setStatus(Status.EXPLORED);\r\n\t\t\t\t\tnodes[tempTopNode.gridPosition[0]][tempTopNode.gridPosition[1]] = tempTopNode;\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\tif(tempTopNode.gridPosition[0] == unexploreNode[0] && tempTopNode.gridPosition[1] == unexploreNode[1]){\r\n\t\t\t\t\t//print out the end node\r\n\t\t\t\t\t//print out the total distance between two points\r\n\t\t\t\t\t//print out the total number node of path\r\n\t\t\t\t\t//System.out.println(\"End Point: \"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[0]+1)+\" \"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[1]+1));\r\n\t\t\t\t\t//System.out.println(\"Total Distance: \"+nodes[unexploreNode[0]][unexploreNode[1]].getTotDistance());\r\n\t\t\t\t\t//System.out.println(\"Total number of nodes: \"+nodes[unexploreNode[0]][unexploreNode[1]].getTotPath().size());\r\n\t\t\t\t\tshortestPath = nodes[unexploreNode[0]][unexploreNode[1]].getTotPath();\r\n\t\t\t\t\tshortestPath.add(unexploreNode);\r\n\t\t\t\t\treturn shortestPath;\t\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\tif(nodes[tempTopNode.gridPosition[0]][tempTopNode.gridPosition[1]].getNodeVisited()== false && checkNodeInQueue(tempQueue, tempTopNode.gridPosition[0], tempTopNode.gridPosition[1]) == false && tempTopNode.getOwnElevation() != 999999999)\r\n\t\t\t\t{\r\n\t\t\t\t\t//check un-visited nodes and add new node into execution queue\r\n\t\t\t\t\ttempQueue.add(tempTopNode);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t//check the bottom node and update new distance\r\n\t\t\tif(tempBottomNode != null)\r\n\t\t\t{\r\n\t\t\t\tif(tempBottomNode.getNodeVisited() == false && tempBottomNode.getOwnElevation() != 999999999 && tempBottomNode.getStatus() != Status.EXPLORED)\r\n\t\t\t\t{\r\n\t\t\t\t\tVector<int[]> tempPath = new Vector<int[]>();\r\n\t\t\t\t\t//record the path\r\n\t\t\t\t\tfor(int m = 0; m < tempQueue.get(0).getTotPath().size(); m++)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tint[] tempXY = new int[2];\r\n\t\t\t\t\t\ttempXY = tempQueue.get(0).getTotPath().get(m);\r\n\t\t\t\t\t\ttempPath.add(tempXY);\r\n\t\t\t\t\t}\r\n\t\t\t\t\t//check new node to see if it exists in path\r\n\t\t\t\t\tif(checkPositionInPath(tempPath, tempQueue.get(0).gridPosition[0], tempQueue.get(0).gridPosition[1]) == false)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tint[] tempXY2 = new int[2];\r\n\t\t\t\t\t\ttempXY2 = tempQueue.get(0).gridPosition;\r\n\t\t\t\t\t\ttempPath.add(tempXY2);\r\n\t\t\t\t\t}\t\t\t\t\r\n\t\t\t\t\t//assign new path to the node\r\n\t\t\t\t\ttempBottomNode.setTotPath(tempPath);\r\n\t\t\t\t\ttempBottomNode.setStatus(Status.EXPLORED);\r\n\t\t\t\t\t//update data back to original matrix\r\n\t\t\t\t\tnodes[tempQueue.get(0).bottomNode.gridPosition[0]][tempQueue.get(0).bottomNode.gridPosition[1]] = tempBottomNode;\r\n\t\t\t\t}\r\n\t\t\t\tif(tempBottomNode.gridPosition[0] == unexploreNode[0] && tempBottomNode.gridPosition[1] == unexploreNode[1]){\r\n\t\t\t\t\t//System.out.println(\"End Point: \"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[0]+1)+\" \"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[1]+1));\r\n\t\t\t\t\t//System.out.println(\"Total Distance: \"+nodes[unexploreNode[0]][unexploreNode[1]].getTotDistance());\r\n\t\t\t\t\t//System.out.println(\"Total number of nodes: \"+nodes[unexploreNode[0]][unexploreNode[1]].getTotPath().size());\r\n\t\t\t\t\tshortestPath = nodes[unexploreNode[0]][unexploreNode[1]].getTotPath();\r\n\t\t\t\t\tshortestPath.add(unexploreNode);\r\n\t\t\t\t\treturn shortestPath;\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\tif(nodes[tempBottomNode.gridPosition[0]][tempBottomNode.gridPosition[1]].getNodeVisited()== false && checkNodeInQueue(tempQueue, tempBottomNode.gridPosition[0], tempBottomNode.gridPosition[1]) == false && tempBottomNode.getOwnElevation() != 999999999)\r\n\t\t\t\t{\r\n\t\t\t\t\t//check un-visited nodes and add new node into execution queue\r\n\t\t\t\t\ttempQueue.add(tempBottomNode);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t//check the left node and update new distance\r\n\t\t\tif(tempLeftNode != null)\r\n\t\t\t{\r\n\t\t\t\tif(tempLeftNode.getNodeVisited() == false && tempLeftNode.getOwnElevation() != 999999999 && tempLeftNode.getStatus() != Status.EXPLORED)\r\n\t\t\t\t{\r\n\t\t\t\t\tVector<int[]> tempPath = new Vector<int[]>();\r\n\t\t\t\t\t//record the path\r\n\t\t\t\t\tfor(int m = 0; m < tempQueue.get(0).getTotPath().size(); m++)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tint[] tempXY = new int[2];\r\n\t\t\t\t\t\ttempXY = tempQueue.get(0).getTotPath().get(m);\r\n\t\t\t\t\t\ttempPath.add(tempXY);\r\n\t\t\t\t\t}\r\n\t\t\t\t\t//check new node to see if it exists in path\r\n\t\t\t\t\tif(checkPositionInPath(tempPath, tempQueue.get(0).gridPosition[0], tempQueue.get(0).gridPosition[1]) == false)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tint[] tempXY2 = new int[2];\r\n\t\t\t\t\t\ttempXY2 = tempQueue.get(0).gridPosition;\r\n\t\t\t\t\t\ttempPath.add(tempXY2);\r\n\t\t\t\t\t}\t\t\t\t\r\n\t\t\t\t\t//assign new path to the node\r\n\t\t\t\t\ttempLeftNode.setTotPath(tempPath);\r\n\t\t\t\t\ttempLeftNode.setStatus(Status.EXPLORED);\r\n\t\t\t\t\t//update data back to original matrix\r\n\t\t\t\t\tnodes[tempQueue.get(0).leftNode.gridPosition[0]][tempQueue.get(0).leftNode.gridPosition[1]] = tempLeftNode;\r\n\t\t\t\t}\r\n\t\t\t\tif(tempLeftNode.gridPosition[0] == unexploreNode[0] && tempLeftNode.gridPosition[1] == unexploreNode[1]){\r\n\t\t\t\t\t//System.out.println(\"End Point: \"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[0]+1)+\" \"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[1]+1));\r\n\t\t\t\t\t//System.out.println(\"Total Distance: \"+nodes[unexploreNode[0]][unexploreNode[1]].getTotDistance());\r\n\t\t\t\t\t//System.out.println(\"Total number of nodes: \"+nodes[unexploreNode[0]][unexploreNode[1]].getTotPath().size());\r\n\t\t\t\t\tshortestPath = nodes[unexploreNode[0]][unexploreNode[1]].getTotPath();\r\n\t\t\t\t\tshortestPath.add(unexploreNode);\r\n\t\t\t\t\treturn shortestPath;\t\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\tif(nodes[tempLeftNode.gridPosition[0]][tempLeftNode.gridPosition[1]].getNodeVisited()== false && checkNodeInQueue(tempQueue, tempLeftNode.gridPosition[0], tempLeftNode.gridPosition[1]) == false && tempLeftNode.getOwnElevation() != 999999999)\r\n\t\t\t\t{\r\n\t\t\t\t\t//check un-visited nodes and add new node into execution queue\r\n\t\t\t\t\ttempQueue.add(tempLeftNode);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t//check the right node and update new distance\r\n\t\t\tif(tempRightNode != null)\r\n\t\t\t{\r\n\t\t\t\tif(tempRightNode.getNodeVisited() == false && tempRightNode.getOwnElevation() != 999999999 && tempRightNode.getStatus() != Status.EXPLORED)\r\n\t\t\t\t{\r\n\t\t\t\t\tVector<int[]> tempPath = new Vector<int[]>();\r\n\t\t\t\t\t//record the path\r\n\t\t\t\t\tfor(int m = 0; m < tempQueue.get(0).getTotPath().size(); m++)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tint[] tempXY = new int[2];\r\n\t\t\t\t\t\ttempXY = tempQueue.get(0).getTotPath().get(m);\r\n\t\t\t\t\t\ttempPath.add(tempXY);\r\n\t\t\t\t\t}\r\n\t\t\t\t\t//check to see if new node existed in path\r\n\t\t\t\t\tif(checkPositionInPath(tempPath, tempQueue.get(0).gridPosition[0], tempQueue.get(0).gridPosition[1]) == false)\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tint[] tempXY2 = new int[2];\r\n\t\t\t\t\t\ttempXY2 = tempQueue.get(0).gridPosition;\r\n\t\t\t\t\t\ttempPath.add(tempXY2);\r\n\t\t\t\t\t}\r\n\t\t\t\t\t//assign new path to the node\r\n\t\t\t\t\ttempRightNode.setTotPath(tempPath);\r\n\t\t\t\t\ttempRightNode.setStatus(Status.EXPLORED);\r\n\t\t\t\t\t//update data back to original matrix\r\n\t\t\t\t\tnodes[tempQueue.get(0).rightNode.gridPosition[0]][tempQueue.get(0).rightNode.gridPosition[1]] = tempRightNode;\r\n\t\t\t\t}\r\n\t\t\t\tif(tempRightNode.gridPosition[0] == unexploreNode[0] && tempRightNode.gridPosition[1] == unexploreNode[1]){\r\n\t\t\t\t\t//System.out.println(\"End Point: \"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[0]+1)+\" \"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[1]+1));\r\n\t\t\t\t\t//System.out.println(\"Total Distance: \"+nodes[unexploreNode[0]][unexploreNode[1]].getTotDistance());\r\n\t\t\t\t\t//System.out.println(\"Total number of nodes: \"+nodes[unexploreNode[0]][unexploreNode[1]].getTotPath().size());\r\n\t\t\t\t\tshortestPath = nodes[unexploreNode[0]][unexploreNode[1]].getTotPath();\r\n\t\t\t\t\tshortestPath.add(unexploreNode);\r\n\t\t\t\t\treturn shortestPath;\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\tif(nodes[tempRightNode.gridPosition[0]][tempRightNode.gridPosition[1]].getNodeVisited()== false && checkNodeInQueue(tempQueue, tempRightNode.gridPosition[0], tempRightNode.gridPosition[1]) == false && tempRightNode.getOwnElevation() != 999999999)\r\n\t\t\t\t{\r\n\t\t\t\t\t//check un-visited nodes and add new node into execution queue\r\n\t\t\t\t\ttempQueue.add(tempRightNode);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\t//set current node to visited node and\r\n\t\t\t//remove current node from execution queue\r\n\t\t\ttempQueue.get(0).setNodeVistied(true);\r\n\t\t\tnodes[tempQueue.get(0).gridPosition[0]][tempQueue.get(0).gridPosition[1]].setNodeVistied(true);\r\n\t\t\ttempQueue.remove(0);\t\r\n\t\t}\r\n\t\t//print out the end node\r\n\t\t//print out the total distance between two points\r\n\t\t//print out the total number node of path\r\n\t\tSystem.out.println(\"End 5 Point: \"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[0]+1)+\" \"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[1]+1));\r\n\t\tSystem.out.println(\"Total Distance: \"+nodes[unexploreNode[0]][unexploreNode[1]].getTotDistance());\r\n\t\tSystem.out.println(\"Total number of nodes: \"+nodes[unexploreNode[0]][unexploreNode[1]].getTotPath().size());\r\n\t\tshortestPath = nodes[unexploreNode[0]][unexploreNode[1]].getTotPath();\r\n\t\tshortestPath.add(unexploreNode);\r\n\t\treturn shortestPath;\t\t\r\n\t}","@Override\n public void backtrack() {\n if (!stack.isEmpty()) {\n int index = (Integer) stack.pop();\n\n if (index > arr.length) {//popping the insert function unneeded push\n insert((Integer) stack.pop());\n stack.pop();\n }\n if (index < arr.length) {//popping the delete function unneeded push\n delete(index);\n stack.pop();\n stack.pop();\n }\n System.out.println(\"backtracking performed\");\n }\n }","public static void bfs(int a, int b) {\n\t\t\r\n\t\tQueue<Node> q = new LinkedList<>();\r\n\t\t\r\n\t\tq.add(new Node(a,b));\r\n\t\t\r\n\t\twhile(!q.isEmpty()) {\r\n\t\t\t\r\n\t\t\tNode n = q.remove();\r\n\t\t\t\r\n\t\t\tint x = n.x;\r\n\t\t\tint y = n.y;\r\n\t\t\t\r\n\t\t\tif(x+1 <= N && map[x+1][y] > map[x][y]) {\r\n\t\t\t\tif(visited[x+1][y] != 1) {\r\n\t\t\t\t\tq.add(new Node(x+1,y));\r\n\t\t\t\t\tvisited[x+1][y] = cnt;\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\tif(x-1 > 0 && map[x-1][y] > map[x][y]) {\r\n\t\t\t\tif(visited[x-1][y] != 1) {\r\n\t\t\t\t\tq.add(new Node(x-1,y));\r\n\t\t\t\t\tvisited[x-1][y] = cnt;\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\tif(y-1 > 0 && map[x][y-1] > map[x][y]) {\r\n\t\t\t\tif(visited[x][y-1] != 1) {\r\n\t\t\t\t\tq.add(new Node(x,y-1));\r\n\t\t\t\t\tvisited[x][y-1] = cnt;\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\tif(y+1 <=N && map[x][y+1] > map[x][y]) {\r\n\t\t\t\tif(visited[x][y+1] != 1) {\r\n\t\t\t\t\tq.add(new Node(x,y+1));\r\n\t\t\t\t\tvisited[x][y+1] = cnt;\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\t\r\n\t\t\t\r\n\t\t\t\r\n\t\t}\r\n\t\t\r\n\t\t\r\n\t\t\r\n\t\t\r\n\t\t\r\n\t}","int DFS(int i, int j) {\n if (dp[i][j] != 0)\n return dp[i][j];\n\n int steps = 0;\n int trial = 0;\n if (i < dp.length - 1 && matrix[i][j] < matrix[i+1][j]) {\n trial = DFS(i + 1, j);\n if (trial > steps)\n steps = trial;\n }\n if (i > 0 && matrix[i][j] < matrix[i-1][j]) {\n trial = DFS(i - 1, j);\n if (trial > steps)\n steps = trial;\n }\n if (j < dp[0].length - 1 && matrix[i][j] < matrix[i][j+1]) {\n trial = DFS(i, j + 1);\n if (trial > steps)\n steps = trial;\n }\n if (j > 0 && matrix[i][j] < matrix[i][j-1]) {\n trial = DFS(i, j - 1);\n if (trial > steps)\n steps = trial;\n }\n\n dp[i][j] = steps + 1;\n return dp[i][j];\n }","public Vector<PuzzleState> aStarSearch() {\r\n System.out.println(\"Starting A*\");\r\n long startTime = (new Date()).getTime();\r\n Vector<PuzzleState> solution = new Vector<PuzzleState>();\r\n HashSet<PuzzleState> closedList = new HashSet<PuzzleState>();\r\n PriorityQueue<PuzzleState> openList = new PriorityQueue<PuzzleState>();\r\n \r\n PuzzleState searchState = state.copy();\r\n searchState.prevState = null;\r\n searchState.depth = 0;\r\n openList.add(searchState);\r\n\r\n while (!openList.isEmpty() && !isGoal(searchState)) {\r\n searchState = openList.poll();\r\n if (!closedList.contains(searchState)) {\r\n closedList.add(searchState);\r\n Vector<PuzzleState> nextStates = possibleNextStates(searchState);\r\n for (PuzzleState s : nextStates)\r\n s.depth = searchState.depth + 1;\r\n openList.addAll(nextStates);\r\n }\r\n }\r\n \r\n // If the goal has been reached, construct the solution\r\n if (isGoal(searchState)) {\r\n for (PuzzleState s = searchState; s.prevState != null; s = s.prevState) {\r\n solution.add(s);\r\n }\r\n Collections.reverse(solution);\r\n }\r\n \r\n long endTime = (new Date()).getTime();\r\n System.out.println(\"A* search ended after \" + (endTime - startTime) + \" ms\");\r\n //for (PuzzleState s : solution)\r\n // System.out.println(s);\r\n return solution;\r\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 DSAQueue depthFirstSearch(String start)\n\t{\n\t\tif(!vertices.isEmpty())\n\t\t{\n\t\t\tDSAQueue queue = new DSAQueue();\n\t\t\tDSAGraphVertex vx = getVertex(start); //vertex to start on (root)\n\t\t\tDSAStack visited = new DSAStack();\t//creates empty stack\n\n\t\t\tclear(); //sets all vertices as not visited\n\t\t\tvx.setVisited(); // Marks root as visited\n\t\t\tqueue.enqueue(vx); //start point\n\n\t\t\tdfs(vx, visited, queue); //begin recursion\n\n\t\t\treturn queue;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthrow new NoSuchElementException(\"List is empty\");\n\t\t}\n\t}","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 boolean search(String word) {\n return dfs(word, 0, root);\n}","private List<Integer> depthFirstSearch(String sequence) {\r\n LinkedList<Integer> stack = new LinkedList<Integer>();\r\n LinkedList<Integer> wordPos = new LinkedList<Integer>();\r\n List<Integer> neighbors = null;\r\n //string pos counter\r\n int c = 0;\r\n int index = -1;\r\n //find starting pos\r\n for (int i = 0; i < squareDimension * squareDimension; i++) {\r\n if (sequence.toUpperCase().startsWith(this.elementAtPos(i))) {\r\n this.clearMarks();\r\n wordPos.clear();\r\n stack.clear();\r\n //depth-first search\r\n stack.push(i);\r\n togglePosMark(i);\r\n wordPos = (LinkedList<Integer>) \r\n dfsRecursive(stack, sequence.substring(\r\n elementAtPos(i).length(), sequence.length())\r\n .toUpperCase(), elementAtPos(i).length(), \r\n i, sequence.length());\r\n if (wordPos.size() != 0) {\r\n return wordPos;\r\n }\r\n }\r\n }\r\n //no result so return empty list\r\n return new LinkedList<Integer>();\r\n }","public static void main(String[] args) {\n TreeNode root = new TreeNode(20, null, null);\n TreeNode lvl2Node1 = insertTreeNode(true, 10, root);\n TreeNode lvl2Node2 = insertTreeNode(false, 1, root);\n TreeNode lvl3Node1 = insertTreeNode(true, 25, lvl2Node1);\n TreeNode lvl3Node2 = insertTreeNode(false, 26, lvl2Node1);\n TreeNode lvl3Node3 = insertTreeNode(true, 32, lvl2Node2);\n TreeNode lvl3Node4 = insertTreeNode(false, 37, lvl2Node2);\n insertTreeNode(true, 5, lvl3Node1);\n insertTreeNode(false, 6, lvl3Node2);\n insertTreeNode(false, 8, lvl3Node3);\n insertTreeNode(true, 10, lvl3Node4);\n\n\n breadthFirstSearchPrintTree(root);\n\n }","public static Stack<Integer> topologicalKosarajuDFSRecursive(ArrayList<ArrayList<Integer>> adj,int u,Stack<Integer> stack,boolean[] visited){\r\n visited[u]=true;\r\n for(int i:adj.get(u))\r\n if(!visited[u])\r\n topologicalKosarajuDFSRecursive(adj,i,stack,visited);\r\n stack.push(u);\r\n return stack;\r\n }","public static void BFS(char[][] board, int y, int x){\n \tint[] offsetX = {-1,0,1,0};\n \tint[] offsetY = {0, -1, 0, 1};\n \tQueue<pair> que = new LinkedList<pair>();\n \tque.add(new pair(x,y));\n \twhile(!que.isEmpty()){\n \t\tpair p = que.poll();\n \t \tif (board[p.y][p.x] == 'D'){\n\t continue;\n \t \t}\n \t\t//System.out.println(p.x);\n \t\t//System.out.println(p.y);\n \t \tboard[p.y][p.x] = 'D';\t \t\n \t \tfor(int i = 0; i < offsetX.length; i++){\n \t \t\tif(p.x + offsetX[i] >= 0 &&p.x+offsetX[i] < board[0].length&& p.y + offsetY[i] >= 0 &&p.y+offsetY[i] < board.length\n \t \t\t\t\t&& board[p.y+offsetY[i]][p.x+offsetX[i]] == 'O'){\n \t \t\t\tque.add(new pair(p.x+offsetX[i], p.y+offsetY[i]));\n \t \t\t}\n \t \t}\n \t}\n \n }","private Cell breadthFirstSearch(WorldMap worldMap, Cell startCell, CELLTYPE goalType, Hashtable<Cell, Cell> prev) {\n\n\t\t// Using markedSet to avoid re-checking already visited nodes\n\t\tHashSet<Cell> markedSet = new HashSet<Cell>();\n\t\tLinkedList<Cell> queue = new LinkedList<Cell>();\n\n\t\tmarkedSet.add(startCell);\n\t\tqueue.add(startCell);\n\n\t\twhile (!queue.isEmpty()) {\n\t\t\tCell cell = queue.remove();\n\t\t\tif (cell.getCellType() == goalType)\n\t\t\t\treturn cell;\n\t\t\tLinkedList<Cell> neighbors = generateSuccessors(worldMap, cell, goalType);\n\n\t\t\t/*\n\t\t\t * If looking for unexplored, shuffle list. Since the neighbors are\n\t\t\t * always returned NESW, it's best to shuffle the list if ant wants\n\t\t\t * to explore a random portion of the map.\n\t\t\t */\n\t\t\tif (goalType == CELLTYPE.UNEXPLORED)\n\t\t\t\tCollections.shuffle(neighbors, new Random(System.currentTimeMillis()));\n\n\t\t\tfor (Cell neighbor : neighbors)\n\t\t\t\tif (!markedSet.contains(neighbor)) {\n\t\t\t\t\tmarkedSet.add(neighbor);\n\t\t\t\t\tqueue.add(neighbor);\n\t\t\t\t\tprev.put(neighbor, cell);\n\t\t\t\t}\n\t\t}\n\t\t// If reached here, goal type doesn't exist\n\t\treturn null;\n\t}","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 }","public static int largestIslandChain(Scanner sc) {\n int islands=sc.nextInt();\r\n boolean graph[][] = new boolean[islands][islands];\r\n\r\n //System.out.print(\"How many ziplines? \");\r\n int ziplines=sc.nextInt();\r\n\r\n for (int edge=0; edge<ziplines; edge++) {\r\n int from=sc.nextInt();\r\n int to=sc.nextInt();\r\n graph[from][to]=true;\r\n }\r\n\r\n\r\n /* Find the SCCs... */\r\n\r\n //Utility Data Structures\r\n Stack<Integer> stack = new Stack<Integer>(); \r\n\r\n\r\n //First DFS\r\n boolean[] visited01 = new boolean[islands];\r\n int exitTimeTicker=0;\r\n int[] exitTimes = new int[islands];\r\n int[] exitPoints = new int[islands];\r\n for (int island=0; island<islands; island++) {\r\n int source;\r\n if (!visited01[island])\r\n {\r\n visited01[island]=true;\r\n stack.push(island);\r\n source=island;\r\n\r\n int destination=0;\r\n while (!stack.isEmpty())\r\n {\r\n source=stack.peek();\r\n destination=0;\r\n while (destination<islands)\r\n {\r\n if (graph[source][destination] && !visited01[destination])\r\n {\r\n stack.push(destination);\r\n visited01[destination]=true;\r\n source=destination;\r\n destination=0;\r\n }\r\n else {\r\n destination++;\r\n }\r\n }\r\n exitTimes[stack.peek()]=exitTimeTicker;\r\n exitPoints[exitTimeTicker]=stack.peek();\r\n stack.pop();\r\n exitTimeTicker++;\r\n }\r\n }\r\n }\r\n\r\n\r\n boolean graphTransposeUsingExits[][] = new boolean[islands][islands];\r\n for (int i=0; i<islands; i++)\r\n {\r\n for (int j=0; j<islands; j++)\r\n {\r\n if (graph[i][j])\r\n graphTransposeUsingExits[exitTimes[j]][exitTimes[i]]=true;\r\n }\r\n }\r\n\r\n\r\n //Second DFS\r\n boolean[] visited02 = new boolean[islands];\r\n int[] numberOfSCC = new int[islands];\r\n int currSCCnum=0;\r\n for (int exitTime=islands-1; exitTime>=0; exitTime--)\r\n {\r\n if (!visited02[exitTime])\r\n {\r\n //entryPointToScc=exitTime;\r\n visited02[exitTime]=true;\r\n numberOfSCC[exitPoints[exitTime]]=++currSCCnum;\r\n stack.push(exitTime);\r\n int source=exitTime;\r\n while (!stack.isEmpty())\r\n {\r\n source=stack.peek();\r\n int destination=0;\r\n while (destination<islands)\r\n {\r\n if (graphTransposeUsingExits[source][destination] && !visited02[destination])\r\n {\r\n if (numberOfSCC[exitPoints[destination]]==0) {\r\n numberOfSCC[exitPoints[destination]]=currSCCnum;\r\n }\r\n stack.push(destination);\r\n visited02[destination]=true;\r\n source=destination;\r\n destination=0;\r\n }\r\n else {\r\n destination++;\r\n } \r\n }\r\n stack.pop();\r\n } \r\n }\r\n }\r\n\r\n\r\n int[] sizeOfSCCs = new int[currSCCnum];\r\n for (int i=0; i<islands; i++) {\r\n sizeOfSCCs[numberOfSCC[i]-1]++;\r\n }\r\n \r\n int sccsMax = Integer.MIN_VALUE;\r\n for(int i=0; i<sizeOfSCCs.length; ++i) {\r\n \tif(sizeOfSCCs[i] > sccsMax) {\r\n \t\tsccsMax = sizeOfSCCs[i];\r\n \t}\r\n }\r\n return sccsMax;\r\n \r\n // Java 8\r\n //return Arrays.stream(sizeOfSCCs).summaryStatistics().getMax();\r\n }","private static void breadthFirstSearch(int source, ArrayList<ArrayList<Integer>> nodes) {\n\t\tArrayList<ArrayList<Integer>> neighbours = nodes;\n\t\tQueue<Integer> queue= new LinkedList<Integer>();\n\t\t\n\t\tboolean[] visited = new boolean[nodes.size()];\n\t\t\n\t\tqueue.add(source);\n\t\tvisited[source]=true;\n\t\t\n\t\twhile(!queue.isEmpty()) {\n\t\t\tint k =queue.remove();\n\t\t\tSystem.out.println(k);\n\t\t\tfor(int p : nodes.get(k)) {\n\t\t\t\tif(!visited[p]) {\n\t\t\t\t\tqueue.add(p);\n\t\t\t\t\tvisited[p]=true;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\t\n\t\t\n\t}","public boolean dfs_iterative_util(LinkedList<Integer>[] graph, boolean[] visited, int s){\n Stack<Integer> fringe = new Stack<Integer>();\n Set<Integer> currStack = new HashSet<Integer>();\n \n fringe.push(s);\n currStack.add(s);\n \n while(!fringe.isEmpty()){\n int curr = fringe.pop();\n if(currStack.contains(curr))\n return false;\n visited[curr] = true;\n currStack.add(curr);\n if(graph[curr] != null){\n Iterator<Integer> itr = graph[curr].iterator();\n while(itr.hasNext()){\n int n = itr.next();\n \n if(!visited[n]){\n fringe.push(n);\n }\n }\n currStack.remove(curr);\n }\n \n }\n \n return true;\n }","void Graph::BFS(int s)\n{\n bool *visited = new bool[V];\n for(int i = 0; i < V; i++)\n visited[i] = false;\n \n // Create a queue for BFS\n list<int> queue;\n \n // Mark the current node as visited and enqueue it\n visited[s] = true;\n queue.push_back(s);\n \n // 'i' will be used to get all adjacent vertices of a vertex\n list<int>::iterator i;\n \n while(!queue.empty())\n {\n // Dequeue a vertex from queue and print it\n s = queue.front();\n cout << s << \" \";\n queue.pop_front();\n \n // Get all adjacent vertices of the dequeued vertex s\n // If a adjacent has not been visited, then mark it visited\n // and enqueue it\n for(i = adj[s].begin(); i != adj[s].end(); ++i)\n {\n if(!visited[*i])\n {\n visited[*i] = true;\n queue.push_back(*i);\n }\n }\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}","public static int runBFS(int[][]map, coordinate src1, coordinate src2){\n\t \n boolean visited[][] = new boolean[dim][dim]; //visited boolean 2d array that is the same size as 2d map\n coordinate visit1[][]=new coordinate[dim][dim]; // this is the one used to hold previous location\n coordinate visit2[][]=new coordinate[dim][dim]; // this is the one used to hold previous location\n\t \n\t visit1[0][0]=new coordinate(0,0); //same as BFS\n \n\t visit2[dim-1][dim-1] = new coordinate(dim-1,dim-1);\n\t //marked both the 0,0 and dim-1, dim-1 srcs as visited\n\t \n\t Queue<QueueNode> queue1 = new LinkedList<>(); //queue for src1\n\t Queue<QueueNode> queue2 = new LinkedList<>(); //queue for src2\n\t \n\t QueueNode sn1 = new QueueNode(src1, 0, src1); //src node 1 queue node\n\t QueueNode sn2 = new QueueNode(src2, 0, src2);\n\t \n\t ArrayList<coordinate> pathHold1 = new ArrayList<>(); //for first path\n\t ArrayList<coordinate> pathHold2 = new ArrayList<>(); //for second path \n\t \n\t visited[src1.x][src1.y] = true; //mark the start node as visited inside of the visited boolean 2d array for first src\n\t visited[src2.x][src2.y] = true; //mark the start node as visited inside of the visited boolean 2d array for second src\n\t \n\t System.out.println();\n\t \n\t queue1.add(sn1);\n\t queue2.add(sn2);\n\t //added the start nodes\n\t \n\t QueueNode current1 = null;\n\t QueueNode current2 = null;\n\t //to be used later to hold current node being looked at\n\t coordinate c1 = null;\n\t coordinate c2 = null;\n\t\t//coordinates to be examined\n\t \n\t while(!queue1.isEmpty()&&!queue2.isEmpty()){\n\t //keep iterating so long as queues have items -- but if one becomes empty, check at each iteration\n\t\t\t//to avoid null pointer so we are not dequeuing from empty queue\n int maxFringe = 0;\n\t\t//use this to check max fringe at each time we add to either queue\n if(queue1.size()>maxFringe || queue2.size()>0) {\n \t if(queue1.size()>maxFringe) {\n \t\t maxFringe=queue1.size();\n \t }else {\n \t\t maxFringe=queue2.size();\n \t }\n }\n\t \n\t \tif(!queue1.isEmpty()) { \n\t\t\t\t//while first queue is not empty, pop\n\t \t\t current1 = queue1.peek(); // this is n\n\t c1 = current1.point;\n\t \t\t visited[c1.x][c1.y]=true; //mark this node as visited, will check neighbors later\n\t boolean inFringe = false;\n\t inFringe = compareFringe(c1, queue2); //see if intersect or not\n\t \n\t \n\t // compare current point to the queue2 fringe. If not in fringe\n\t if(inFringe) {\n\t \t //we have found the duplicate \n\t \t System.out.println(\"duplicate\");\n\t \t intersect = c1;\n\t\t System.out.println(\"Intersect is :\"+c1.x+\",\"+c1.y);\n\t\t visit1[c1.x][c1.y]=current1.prev; //set prev node or where we came from\n\t\t \n\t\t System.out.println(\"We have reached our goal!\");\n\t\t \n\t\t if(current2 != null) {\n\t\t\t\t\t //so long as paths have values, add length and return\n\t\t return current1.pathTotal+current2.pathTotal;\n\t\t }else {\n\t\t\t\t\t //else return only one path \n\t\t \t return current1.pathTotal;\n\t\t }\n\t }\n\t\t\t\t//this is getting the neighbors, same as BFS\n\t \n\t int row1 = 0;\n\t int col1 = 0;\n\t \n\t for (int i = 0; i < 4; i++) { \n\t row1= c1.x + rowNum1[i]; \n\t col1 = c1.y + colNum1[i]; \n\t //grab neighbor of current\n\t if (cellValid(row1, col1) && map[row1][col1] == 1 && !visited[row1][col1]){ \n\t \t \n\t // mark cell as visited and enqueue it \n\t visited[row1][col1] = true; //we visited the node so mark it\n\t visit1[row1][col1] = new coordinate(c1.x, c1.y); //set prev as current coord\n\n\t QueueNode Adjcell = new QueueNode(new coordinate(row1, col1), current1.pathTotal + 1, new coordinate(row1-rowNum1[i], col1-colNum1[i])); \n\t queue1.add(Adjcell); //make it a queueNode to add to q1 for first path\n\t }else if(cellValid(row1, col1) && map[row1][col1] == 1 && (visited[row1][col1]&&visit2[row1][col1]!=null)){\n\t \t // System.out.println(\"already visited\"+row1+\",\"+col1); \n\t\t\t\t //check if already visited and valid (not off grid) and = 1 so we can take path -- \n\t\t\t\t //if so, this means we found intersect\n\t\t\t\t //make sure node has been visited in other path to guarantee it is intersect\n\t \t intersect=new coordinate(row1,col1); //set intersect\n\t \t visit1[intersect.x][intersect.y]=new coordinate(c1.x, c1.y); //set where we came from\n\t \t //current1.pathTotal++;\n\t \t printfin(visit1, visit2); //used to print final path -- set map\n \n int nodesExplored1 = 0;\n int nodesExplored2 = 0;\n for(coordinate coor : pathHold1){\n nodesExplored1++;\n }\n for(coordinate coor : pathHold2){\n nodesExplored2++;\n }\n\t\t\t\t \n\t\t\t\t //get number of nodes expanded in each path, add together\n\n int fin = nodesExplored1+nodesExplored2; //this is final explored nodes in each path\n System.out.println(\"Nodes explored: \" + fin);\n \n\t \t return pathsize; //return total pathsize\n\t \t //break;\n\t }\n\t \n\t \n\t } \n\t //once all of the neighbors have been visited, dequeue from queue 1 in path 1\n\t queue1.remove(); \n\t pathHold1.add(c1); //add to explored\n\t \n\t }\n\t \t//now to the same in path2 from (dim-1, dim-1) as src2\n\t \tif(!queue2.isEmpty()) {\n\t \t\t\n\t \t\t current2 = queue2.peek(); // this is n\n\t c2 = current2.point;\n\t \t\t visited[c2.x][c2.y]=true;\n\t boolean inFringe = false;\n\t inFringe = compareFringe(c2, queue1);\n\t \n\t // compare current point to the queue2 fringe. If not in fringe\n\t if(inFringe) {\n\t \t //we have found the duplicate \n\t \t System.out.println(\"duplicate\");\n\t \t intersect = c2;\n\t\t // System.out.println(\"Intersect is :\"+c2.x+\",\"+c2.y);\n\t\t visit2[c2.x][c2.y]=current2.prev;\n\t\t \n\t\t System.out.println(\"We have reached our goal!\");\n\t\t \n\t\t \n\t\t if(current1 != null) {\n\t\t\t return current1.pathTotal+current2.pathTotal;\n\t\t\t }else {\n\t\t\t \t return current2.pathTotal;\n\t\t\t }\n\t }\n\t \n\t \t// get neighbors\n\t int row2 = 0;\n\t int col2 = 0;\n\t \n\t for (int i = 0; i < 4; i++) { \n\t row2= c2.x + rowNum2[i]; \n\t col2 = c2.y + colNum2[i]; \n\t \n\t \n\t if (cellValid(row2, col2) && map[row2][col2] == 1 && !visited[row2][col2]){ \n\t \t \n\t // mark cell as visited and enqueue it \n\t visited[row2][col2] = true; \n\t visit2[row2][col2] = new coordinate(c2.x, c2.y);\n\n\t QueueNode Adjcell2 = new QueueNode(new coordinate(row2, col2), current2.pathTotal + 1, new coordinate(row2-rowNum2[i], col2-colNum2[i])); \n\t queue2.add(Adjcell2);\n\t }else if(cellValid(row2, col2) && map[row2][col2] == 1 && (visited[row2][col2]&&visit1[row2][col2]!=null)){\n\t \t \n\t \t intersect=new coordinate(row2,col2);\n\t \t \n\t \t visit2[intersect.x][intersect.y]=new coordinate(c2.x, c2.y);\n\t \n\t \n\t printfin(visit1, visit2);\n\t int nodesExplored1 = 0;\n int nodesExplored2 = 0;\n for(coordinate coor : pathHold1){\n nodesExplored1++;\n }\n for(coordinate coor : pathHold2){\n nodesExplored2++;\n }\n\n int fin = nodesExplored1+nodesExplored2;\n System.out.println(\"Nodes explored: \" + fin);\n\t \t return pathsize;\n\t \t \n\t }\n\t \n\t } \n\t //once all of the neighbors have been visited, dequeue \n\t queue2.remove(); \n\t pathHold2.add(c2);\n\t \t\t\n\t \t}\n\n\t }\n \n int nodesExplored1 = 0;\n int nodesExplored2 = 0;\n for(coordinate coor : pathHold1){\n nodesExplored1++;\n }\n for(coordinate coor : pathHold2){\n nodesExplored2++;\n }\n\n int fin = nodesExplored1+nodesExplored2;\n System.out.println(\"Nodes explored: \" + fin);\n\t //if here, means no path was found\n\t return -1;\n\t \n\t }","private boolean dfs(int[][] maze, boolean[][] visited, int[] start, int[] destination) {\n\t\tif(Arrays.equals(start, destination)) return true;\n\t\tint i = start[0];\n\t\tint j = start[1];\n\t\tif(visited[i][j])\n\t\t\treturn false;\n\t\tvisited[i][j] = true;\n\t\tBiPredicate<Integer, Integer> roll = (rowInc, colInc) -> {\n\t\t\tint ii = i, jj = j;\n\t\t\twhile(ii >= 0 && ii <= maze.length - 1 && jj >= 0 && jj <= maze[0].length - 1 && maze[ii][jj] != 1) {\n\t\t\t\tii += rowInc;\n\t\t\t\tjj += colInc;\n\t\t\t}\n\t\t\treturn dfs(maze, visited, new int[] {ii - rowInc, jj - colInc}, destination)\n\t\t};\n\t\tif(roll.test(1, 0)) return true;\n\t\tif(roll.test(-1, 0)) return true;\n\t\tif(roll.test(0, 1)) return true;\n\t\tif(roll.test(0, -1)) return true;\n\t\t\n\t\treturn false;\n\t}","public static void main(String[] args) {\n Solution solution = new Solution();\n TreeNode root = new TreeNode(1);\n root.left = new TreeNode(2);\n root.left.left = new TreeNode(6);\n root.left.left.right = new TreeNode(10);\n root.left.left.right.left = new TreeNode(-1);\n root.left.right = new TreeNode(9);\n\n root.right = new TreeNode(3);\n root.right.right = new TreeNode(5);\n root.right.left = new TreeNode(4);\n root.right.left.left = new TreeNode(7);\n root.right.left.right = new TreeNode(8);\n \n solution.stackList(root);\n for (int i = 0 ; i < solution.list.size(); i++) System.out.print(solution.list.get(i) + \" \");\n }","public Integer retrieveBF(Vertex vert, Stack<Integer> st)\r\n\t{\r\n\t\tfor(int k = 0; k < vertices.size(); k++)\r\n\t\t{\r\n\t\t\t/*for(int j = 0; j < vertices.get(k).getEdges().size(); j++)\r\n\t\t\t\t{\r\n\t\t\t\t\tif (!vert.get.isTraversed())\r\n\t\t\t\t\t{\r\n\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t}\r\n\t\t\t\t}*/\r\n\t\t\t//else if(this.getEdge(i, k) != null && vertices.get(i).getEdge(k).isTraversed() == false);\r\n\t\t\t//{\r\n\t\t\t/*else */\r\n\t\t\tif(vert.getEdge(k) != null && vert.getEdge(k).isTraversed() == false)\r\n\t\t\t{\t\t\t\t\r\n\t\t\t\tvert.getEdge(k).setTraversed();\r\n\t\t\t\tst.push(retrieveBF(vert.getEdge(k).getVertex(vert.getID()),st));\r\n\t\t\t\t//return st.push(retrieveBF(vert.getEdge(k).getVertex(vert.getID()),st));\r\n\t\t\t}\r\n\t\t\t\treturn st.push(retrieveBF(vert,st));\r\n\t\t}\r\n\t\treturn st.pop();\r\n\t}","public Solution67() {\n stack = new Stack<>();\n min_stack = new Stack<>();\n }","public void breadthFirstTraversal() {\n beginAnimation();\n treeBreadthFirstTraversal();\n stopAnimation();\n\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}","private static void solve2(Board bd) throws SolutionFoundException {\n\t\tst = new StackImage();\n\n\t\tdepth ++;\n\n\t\tif(depth < -1) {\n\t\t\tbd.checkForSolution();\n\t\t\tthrow new SolutionFoundException();\n\t\t}\n\n\t\tst.cnt = 0;\n\t\tfor( st.r=0;st.r<bd.getBoard_size();++st.r) \n\t\t\tfor( st.c=0;st.c<bd.getBoard_size(); ++st.c) {\n\t\t\t\tif(bd.getPossibilities(st.r, st.c) >= 1) {\n\n\t\t\t\t\tfor(st.p=0;st.p<bd.getBoard_size();++st.p) {\n\t\t\t\t\t\t//System.out.println(\"Status check \" + st.r + \" \" + st.c + \" \" + st.p + \" \" + (bd.check(st.r, st.c, st.p)) + \" \" + (bd.verify(st.r,st.c,st.p)));\n\t\t\t\t\t\tif(bd.check(st.r, st.c, st.p) && bd.verify(st.r,st.c,st.p)) {\n\t\t\t\t\t\t\tst.bi = bd.assign(st.r, st.c, st.p);\n\t\t\t\t\t\t\tSystem.out.println(\"CHoice at \" + st.r + \" \" + st.c + \" \" + st.p);\n\t\t\t\t\t\t\tmoves.add( st );\n\t\t\t\t\t\t\tsolve2(bd);\n\t\t\t\t\t\t\tst = moves.removeLast();\n\t\t\t\t\t\t\tbd.restore(st.r,st.c,st.bi);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t++st.cnt;\n\t\t\t\t\treturn;\n\t\t\t\t} else if(bd.getPossibilities(st.r, st.c) == 0 && !bd.isOnlyOne(st.r, st.c)) {\n\t\t\t\t\treturn ;\n\t\t\t\t}\n\t\t\t}\n\n\t\tif(st.cnt == 0) {\n\t\t\tbd.checkForSolution();\n\t\t\tthrow new SolutionFoundException();\n\t\t}\n\t\t--depth;\t\t\n\t\tst = null;\n\t}","void topologicalSort(){ \n Stack<Integer> stack = new Stack<Integer>(); \n \n // Mark all the vertices as not visited \n boolean visited[] = new boolean[V]; \n for (int i = 0; i < V; i++) \n visited[i] = false; \n \n // Call the recursive helper function to store Topological Sort starting from all vertices one by one \n for (int i = 0; i < V; i++) \n if (visited[i] == false) \n topologicalSortUtil(i, visited, stack); \n \n // Print contents of stack \n while (stack.empty()==false) \n System.out.print(stack.pop() + \" \"); \n }"],"string":"[\n \"public Stack<MazePoint> DepthFirstSearch(int row, int column)\\n {\\n //cMaze[row][column].wasVisited()\\n if(cMaze[row][column].isExit())\\n {\\n sPath.push(cMaze[row][column]);\\n //print out the path\\n PrintPath(sPath, true);\\n return sPath;\\n }\\n else\\n {\\n //when not visit\\n if(!cMaze[row][column].wasVisited())\\n {\\n if(cMaze[row][column].hasItem())\\n {\\n String itemName = cMaze[row][column].pickUpItem();\\n Item item = new Item(itemName);\\n //check if the item is in the hashmap\\n if(availableItemsHashMap.get(item) != null)\\n {\\n inventoryList.insert(itemName);\\n }\\n else\\n {\\n cMaze[row][column].dropItem();\\n }\\n }\\n //mark as vist\\n cMaze[row][column].markVisited();\\n //push into stack\\n sPath.push(cMaze[row][column]);\\n }\\n //determine where to traverse next (S, E, W, N)\\n //recursively\\n if(cMaze[row+1][column].canBeNavigated() || cMaze[row+1][column].isExit())// or (cMaze[row+1][column] != VISITED_MARKER && cMaze[row+1][column] != 'W')\\n {\\n return DepthFirstSearch(row+1, column);\\n }\\n else if(cMaze[row][column+1].canBeNavigated() || cMaze[row][column+1].isExit())\\n {\\n return DepthFirstSearch(row, column+1);\\n }\\n else if(cMaze[row][column-1].canBeNavigated() || cMaze[row][column-1].isExit())\\n {\\n return DepthFirstSearch(row, column-1);\\n }\\n else if(cMaze[row-1][column].canBeNavigated() || cMaze[row-1][column].isExit())\\n {\\n return DepthFirstSearch(row-1, column);\\n }\\n //no where could go, then return\\n else\\n {\\n sPath.pop();\\n if(sPath.isEmpty())\\n {\\n //print nothing found\\n PrintPath(sPath, false);\\n return sPath;\\n }\\n MazePoint mp = sPath.top();\\n int mpRow = mp.getRow();\\n int mpColumn = mp.getColumn();\\n return DepthFirstSearch(mpRow, mpColumn);\\n }\\n }\\n }\",\n \"public Stack<Integer> dfs(Maze tmp) {\\n \\n int tmpx = tmp.positionX();\\n int tmpy = tmp.positionY();\\n Stack<Integer> s = new Stack<Integer>();\\n while (!tmp.gameOver()) {\\n choosedirection(s, tmp);\\n while (!s.isEmpty() && !tmp.gameOver()) {\\n if (s.peek() == 0) {\\n if (tmp.right()) {\\n s.push(1);\\n } else if (tmp.up()) {\\n s.push(0);\\n } else if (tmp.left()) {\\n s.push(3);\\n } else {\\n this.stackpop(s, tmp);\\n }\\n } else if (s.peek() == 1) {\\n if (tmp.down()) {\\n s.push(2);\\n } else if (tmp.right()) {\\n s.push(1);\\n } else if (tmp.up()) {\\n s.push(0);\\n } else {\\n this.stackpop(s, tmp);\\n }\\n } else if (s.peek() == 2) {\\n if (tmp.left()) {\\n s.push(3);\\n } else if (tmp.down()) {\\n s.push(2);\\n } else if (tmp.right()) {\\n s.push(1);\\n } else {\\n this.stackpop(s, tmp);\\n }\\n } else if (s.peek() == 3) {\\n if (tmp.up()) {\\n s.push(0);\\n } else if (tmp.left()) {\\n s.push(3);\\n } else if (tmp.down()) {\\n s.push(2);\\n } else {\\n this.stackpop(s, tmp);\\n }\\n\\n }\\n\\n }\\n }\\n\\n Stack<Integer> stack = new Stack<Integer>();\\n while (!s.isEmpty()) {\\n stack.push(s.pop());\\n }\\n\\n tmp.setLocation(tmpx, tmpy);\\n return stack;\\n\\n }\",\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 \"void testSearches(Tester t) {\\n Vertex v1 = new Vertex(10, 10);\\n Vertex v2 = new Vertex(10, 11);\\n Vertex v3 = new Vertex(10, 12);\\n\\n Edge e1 = new Edge(v1, v2, 1);\\n Edge e2 = new Edge(v2, v3, 1);\\n\\n IList<Vertex> map = new Cons<Vertex>(v1, new Cons<Vertex>(v2, new Cons<Vertex>(\\n v3, new Empty<Vertex>())));\\n\\n Player player = new Player(map);\\n DepthFirst dp = new DepthFirst(map);\\n BreadthFirst bp = new BreadthFirst(map);\\n\\n t.checkExpect(player.current, v1);\\n t.checkExpect(player.finished, false);\\n\\n t.checkExpect(bp.hasNext(), true);\\n t.checkExpect(bp.next(), new Queue<Vertex>());\\n\\n t.checkExpect(dp.hasNext(), true);\\n t.checkExpect(dp.next(), new Stack<Vertex>());\\n\\n t.checkExpect(player.move(true, e1), v2);\\n\\n t.checkExpect(player.current, v2);\\n t.checkExpect(player.finished, false);\\n\\n t.checkExpect(bp.hasNext(), false);\\n t.checkExpect(bp.next(), v3);\\n\\n t.checkExpect(dp.hasNext(), false);\\n t.checkExpect(dp.next(), v3);\\n\\n t.checkExpect(player.move(true, e2), v3);\\n\\n player.finished = true;\\n\\n t.checkExpect(player.current, v3);\\n t.checkExpect(player.finished, true);\\n\\n Queue<Vertex> q = new Queue<Vertex>(map);\\n\\n q.enqueue(new Vertex(5, 5));\\n\\n Deque<Vertex> dq = new Deque<Vertex>();\\n dq.addAtHead(v1);\\n dq.addAtTail(v2);\\n dq.addAtTail(new Vertex(5, 5));\\n\\n\\n t.checkExpect(q.isEmpty(), false);\\n t.checkExpect(q.contents, dq);\\n\\n Stack<Vertex> stack = new Stack<Vertex>(map);\\n\\n t.checkExpect(stack.isEmpty(), false);\\n dq.removeFromHead();\\n t.checkExpect(stack.pop(), dq);\\n\\n t.checkExpect(dp.next(), v2);\\n t.checkExpect(bp.hasNext(), true);\\n\\n }\",\n \"public static String findPath(Maze maze) {\\n \\tint m = maze.getNumRows();\\n \\tint n = maze.getNumCols();\\n\\n \\t//define a visited matrix\\n \\tboolean[][] visited = new boolean[m][n];\\n \\tsetvisited(false, visited);\\n\\n \\t//define a direction matrix\\n \\tint[][] dir_mtr = new int[m][n];\\n \\tinit_dir(-1,dir_mtr);\\n\\n\\n\\n \\t//define a stack\\n \\tStack<MazeLocation> s;\\n \\ts = new StackRefBased<MazeLocation>();\\n\\n \\tMazeLocation entry = maze.getEntry();\\n \\tMazeLocation exit = maze.getExit();\\n \\t// System.out.println(entry.toString());\\n \\ts.push(entry);\\n\\n\\t\\tMazeLocation temp; \\n\\t\\tString result = \\\"\\\"; \\t\\n\\n\\t\\ttry{\\n\\t\\t\\tint x,y;\\n\\n\\n\\t\\t\\twhile(!s.isEmpty()){\\n\\n \\t\\ttemp = s.peek();\\n \\t\\tx = temp.getRow();\\n \\t\\ty = temp.getCol();\\n \\t\\tdir_mtr[x][y]+=1;\\n\\n \\t\\tif(temp.toString().equals(exit.toString())){\\n \\t\\t\\tSystem.out.println(\\\"find the path\\\");\\n \\t\\t\\tbreak;\\n\\n \\t\\t}\\n\\n \\t\\tif(dir_mtr[x][y]==0){ \\n \\t\\t\\t//checking the up direction\\n \\t\\t\\tif(x-1>=0 && !maze.isWall(x-1,y) && !visited[x-1][y]){\\n \\t\\t\\t\\tMazeLocation testnode = new MazeLocation(x-1,y,maze.isWall(x-1,y));\\n \\t\\t\\t\\tvisited[x-1][y] = true;\\n \\t\\t\\t\\ts.push(testnode);\\n\\n \\t\\t\\t}\\n\\n \\t\\t}else if(dir_mtr[x][y]==1){\\n \\t\\t\\t//checking the left direction\\n \\t\\t\\tif(y-1>=0 && !maze.isWall(x,y-1) && !visited[x][y-1]){\\n \\t\\t\\t\\tMazeLocation testnode = new MazeLocation(x,y-1,maze.isWall(x,y-1));\\n \\t\\t\\t\\tvisited[x][y-1] = true;\\n \\t\\t\\t\\ts.push(testnode);\\n\\n \\t\\t\\t}\\n\\n \\t\\t}else if(dir_mtr[x][y]==2){\\n \\t\\t\\t//checking the down direction\\n \\t\\t\\tif(x+1<m && !maze.isWall(x+1,y) && !visited[x+1][y]){\\n \\t\\t\\t\\tMazeLocation testnode = new MazeLocation(x+1,y,maze.isWall(x+1,y));\\n \\t\\t\\t\\tvisited[x+1][y] = true;\\n \\t\\t\\t\\ts.push(testnode);\\n\\n \\t\\t\\t}\\n \\t\\t\\t\\n \\t\\t}else if(dir_mtr[x][y]==3){\\n \\t\\t\\t//checking the right direction\\n \\t\\t\\tif(y+1<n && !maze.isWall(x,y+1) && !visited[x][y+1]){\\n \\t\\t\\t\\tMazeLocation testnode = new MazeLocation(x,y+1,maze.isWall(x,y+1));\\n \\t\\t\\t\\tvisited[x][y+1] = true;\\n \\t\\t\\t\\ts.push(testnode);\\n\\n \\t\\t\\t}\\n \\t\\t\\t\\n \\t\\t}else{\\n \\t\\t\\tvisited[x][y] = false;\\n \\t\\t\\ts.pop();\\n \\t\\t}\\n\\n\\n\\n \\t\\t\\n \\t}\\n\\n \\t//reverse the stack\\n \\tStack<MazeLocation> reverse;\\n \\treverse = new StackRefBased<MazeLocation>();\\n \\twhile(!s.isEmpty()){\\n\\t\\t\\t reverse.push(s.pop()); \\t//push the node to the reverse stack\\n\\t\\t\\t }\\n\\n\\n \\t//if the stack is not empty, then we find the path\\n\\t\\tif(!reverse.isEmpty()){\\n\\t\\t\\tresult = reverse.toString();\\n\\n\\t\\t}\\n\\n \\t\\n \\n\\n\\t\\t}\\n\\t\\tcatch (StackEmptyException see) {\\n \\n }\\n\\n\\n \\treturn result;\\n\\n\\n }\",\n \"public void breadthFirstSearch(){\\n Deque<Node> q = new ArrayDeque<>(); // In an interview just write Queue ? Issue is java 8 only has priority queue, \\n // meaning I have to pass it a COMPARABLE for the Node class\\n if (this.root == null){\\n return;\\n }\\n \\n q.add(this.root);\\n while(q.isEmpty() == false){\\n Node n = (Node) q.remove();\\n System.out.print(n.val + \\\", \\\");\\n if (n.left != null){\\n q.add(n.left);\\n }\\n if (n.right != null){\\n q.add(n.right);\\n }\\n }\\n }\",\n \"public boolean solve(final int startRow, final int startCol) {\\r\\n\\r\\n // TODO\\r\\n // validate arguments: ensure position is within maze area\\r\\n\\r\\n if(mazeData [startRow][startCol] == WALL) {\\r\\n throw new IllegalArgumentException(\\\" we're in a wall buddy\\\");\\r\\n }\\r\\n else if (startRow > mazeData.length-1 || startCol > mazeData.length-1 ){\\r\\n throw new IllegalArgumentException(\\\" we're out of bounds \\\");\\r\\n }\\r\\n\\r\\n\\r\\n\\r\\n\\r\\n\\r\\n // TODO create local class for row/col positions\\r\\n class Position {\\r\\n private int row;\\r\\n private int col;\\r\\n\\r\\n // TODO add instance variables\\r\\n public Position(final int row, final int col) {\\r\\n this.row = row;\\r\\n this.col= col;\\r\\n }\\r\\n\\r\\n\\r\\n\\r\\n // TODO toString if desired\\r\\n public String toString() {\\r\\n return \\\"Row: \\\" + this.row + \\\"Column: \\\"+ this.col;\\r\\n }\\r\\n\\r\\n\\r\\n }\\r\\n\\r\\n\\r\\n // define the stack (work queue)\\r\\n final var queue = Collections.asLifoQueue(new LinkedList<Position>());\\r\\n //Queue<Position> queue = new LinkedList<Position>(); // EXTRA CREDIT PART 2\\r\\n\\r\\n // put starting position in queue\\r\\n queue.add(new Position(startRow, startCol));\\r\\n\\r\\n\\r\\n\\r\\n\\r\\n\\r\\n // look for a way out of the maze from the current position\\r\\n while (!queue.isEmpty()) {\\r\\n\\r\\n\\r\\n final Position pos = queue.remove();\\r\\n\\r\\n // if this is a wall, then ignore this position (and skip the remaining steps of the loop body)\\r\\n if (mazeData [pos.row][pos.col]== WALL){\\r\\n continue; // jumps to next spot in que , by skipping to next iteration of loops by saying continue\\r\\n }\\r\\n\\r\\n\\r\\n // otherwise mark this place as visited (drop a breadcrumb)\\r\\n if (mazeData [pos.row][pos.col]== VISITED){\\r\\n continue; // jumps to next spot in que , by skipping to next iteration of loops by saying continue\\r\\n }\\r\\n else if(mazeData [pos.row][pos.col]== EMPTY){\\r\\n mazeData [pos.row][pos.col]= VISITED;\\r\\n }\\r\\n\\r\\n // if we're already on the perimeter, then this is a way out and we should return success (true) right away\\r\\n if (pos.row == 0|| pos.col ==0 || pos.row == mazeData.length-1 || pos.col == mazeData[0].length-1){\\r\\n mazeData[startRow][startCol] = START;\\r\\n return true;\\r\\n }\\r\\n\\r\\n queue.add(new Position(pos.row+1,pos.col ));//down\\r\\n queue.add(new Position(pos.row-1,pos.col ));//up\\r\\n queue.add(new Position(pos.row,pos.col-1 )); //left\\r\\n queue.add(new Position(pos.row, pos.col + 1)); //right\\r\\n\\r\\n\\r\\n }//end of while\\r\\n\\r\\n\\r\\n\\r\\n // mark starting position\\r\\n mazeData[startRow][startCol] = START;\\r\\n\\r\\n // if we've looked everywhere but haven't gotten out, then return failure (false)\\r\\n return false;\\r\\n }\",\n \"private Queue<Integer> breadthSearch(int i, int j, Queue<Integer> queue, Queue<Integer> path) {\\n while(queue.size() != 0) {\\n queue.poll();\\n }//while\\n return new LinkedList();\\n }\",\n \"private static int breadthFirstSearch(Vertex start) throws Queue.UnderflowException, Queue.EmptyException {\\n boolean visited[] = new boolean[48];\\n //Keep a queue of vertecies and a queue of the depth of the verticies - they will be added to and poped from identically\\n ListQueue<Vertex> queue = new ListQueue<Vertex>();\\n ListQueue<Integer> numQueue = new ListQueue<Integer>();\\n //Set the starting node as visited\\n visited[start.index()] = true;\\n queue.enqueue(start);\\n numQueue.enqueue(new Integer(1));\\n\\n //Keep last\\n int last = -1;\\n //While the queue isnt empty\\n while (!queue.isEmpty()) {\\n //Pop off the top from both queues and mark as visited\\n start = queue.dequeue();\\n int current = numQueue.dequeue();\\n visited[start.index] = true;\\n //For all neigbors\\n for (Vertex v : start.neighbors) {\\n //If we havent visited it make sure to visit it\\n if (visited[v.index()] == false) {\\n //As we keep adding new nodes to visit keep track of the depth\\n queue.enqueue(v);\\n numQueue.enqueue(current + 1);\\n }\\n }\\n //Keep track of the most recent depth before we pop it off (queue will be empty when we exit)\\n last = current;\\n }\\n //Return the max of the depth\\n return last;\\n }\",\n \"public void BFS() {\\n visitedCells = 1;\\n\\n // Initialize the vertices\\n for (int j = 0; j < maze.getGrid().length; j++) {\\n for (int k = 0; k < maze.getGrid().length; k++) {\\n Cell cell = maze.getGrid()[j][k];\\n cell.setColor(\\\"WHITE\\\");\\n cell.setDistance(0);\\n cell.setParent(null);\\n }\\n }\\n\\n Cell sourceCell = maze.getGrid()[0][0];\\n Cell neighbor = null;\\n Cell currentCell;\\n int distance = 0;\\n\\n // Initialize the source node\\n sourceCell.setColor(\\\"GREY\\\");\\n sourceCell.setDistance(0);\\n sourceCell.setParent(null);\\n\\n queue.add(sourceCell);\\n\\n // Visits each cell until the queue is empty\\n while (!queue.isEmpty()) {\\n currentCell = queue.remove();\\n\\n for (int i = 0; i < currentCell.mazeNeighbors.size(); i++) {\\n neighbor = currentCell.mazeNeighbors.get(i);\\n\\n // Stop the search if you reach the final cell\\n if (neighbor.x == r - 1 && neighbor.y == r - 1) {\\n distance++;\\n if (distance == 10)\\n distance = 0;\\n neighbor.setDistance(distance);\\n neighbor.setParent(currentCell);\\n neighbor.visited = true;\\n visitedCells++;\\n break;\\n }\\n\\n // Checks each neighbor and adds it to the queue if its color is white\\n if (neighbor.getColor().equalsIgnoreCase(\\\"WHITE\\\")) {\\n distance++;\\n if (distance == 10)\\n distance = 0;\\n neighbor.setColor(\\\"GREY\\\");\\n neighbor.setDistance(distance);\\n neighbor.setParent(currentCell);\\n neighbor.visited = true;\\n queue.add(neighbor);\\n visitedCells++;\\n }\\n }\\n // Stop the search if you reach the final cell\\n if (neighbor.x == r - 1 && neighbor.y == r - 1)\\n break;\\n\\n currentCell.setColor(\\\"BLACK\\\");\\n }\\n }\",\n \"public static void breadthFirstSearch(ArrayList<Node> graph) {\\n\\t\\tSystem.out.println(\\\"BFS:\\\");\\n\\t\\tif(graph.size() == 0) {\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\t\\n\\t\\tGraphUtils.cleanGraph(graph);\\n\\n\\t\\tQueue<Node> queue = new LinkedList<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\\tqueue.add(node);\\n\\t\\t\\t\\n\\t\\t\\twhile(!queue.isEmpty()) {\\n\\t\\t\\t\\tnode = queue.remove();\\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 queue 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\\tqueue.add(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\\n\\t\\tSystem.out.println();\\n\\t\\tGraphUtils.cleanGraph(graph);\\n\\t}\",\n \"@SuppressWarnings({\\\"rawtypes\\\", \\\"unchecked\\\", \\\"SuspiciousMethodCalls\\\"})\\n private List getDepthFirstTraversal_iterative_usingStack_BigO_VPlusE() throws Exception {\\n Map<Object, Boolean> visited = new LinkedHashMap<>();\\n Stack watchStack = new Stack();\\n\\n V root = data.keySet().stream().findFirst().orElseThrow(() -> new Exception(\\\"Graph is Empty\\\"));\\n watchStack.push(root);\\n visited.put(root, true);\\n\\n while(!watchStack.isEmpty()) {\\n Object currentVertex = watchStack.top();\\n\\n BinarySearchTree<E> edgeTree = data.getOrDefault(currentVertex, new BinarySearchTree<>());\\n List<E> edges = edgeTree.getTreeByInOrder_depthFirst();\\n\\n //Remove an item from the stack when there are no edges or all the edges are visited for that vertex\\n if(edgeTree.isEmpty() || visited.keySet().containsAll(edges)) {\\n watchStack.pop();\\n } else {\\n for(E edge : edges) {\\n if(!visited.containsKey(edge)) {\\n watchStack.push(edge);\\n visited.put(edge, true);\\n break;\\n }\\n }\\n }\\n }\\n return new ArrayList<>(visited.keySet());\\n }\",\n \"public void depthFirstSearch(){\\n\\t\\tStack<TreeNode<T>> nodeStack = new Stack<TreeNode<T>>();\\n\\n\\t\\tif(root!=null){\\n\\t\\t\\tnodeStack.push(root);\\n\\t\\t\\tSystem.out.println(root.data);\\n\\t\\t\\tTreeNode<T> topNode = root;\\n\\t\\t\\twhile(!nodeStack.isEmpty()){\\n\\t\\t\\t\\tif(topNode.left!=null){\\n\\t\\t\\t\\t\\tnodeStack.push(topNode.left);\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tSystem.out.println(topNode.data);\\n\\t\\t\\t\\t\\ttopNode = topNode.left;\\n\\t\\t\\t\\t} else if(topNode.right!=null){\\n\\t\\t\\t\\t\\tnodeStack.push(topNode.right);\\n\\t\\t\\t\\t\\tSystem.out.println(topNode.data);\\n\\t\\t\\t\\t\\ttopNode = topNode.right;\\n\\t\\t\\t\\t} else{\\n\\t\\t\\t\\t\\ttry{\\n\\t\\t\\t\\t\\t\\tnodeStack.pop();\\n\\t\\t\\t\\t\\t}catch(Exception ex){\\n\\t\\t\\t\\t\\t\\tex.printStackTrace();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"public static Node searchBFS(int mat[][], int i, int j, int x, int y) {\\n\\t\\tfor (int n = 1; n < 30; n++) {\\n\\t\\t\\tfor (int p = 1; p < 30; p++) {\\n\\t\\t\\t\\tvisited[n][p] = false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t// create an empty queue\\n\\t\\tQueue<Node> q = queue;\\n\\t\\tq.clear();\\n\\t\\t// mark source cell as visited and enqueue the source node\\n\\t\\tvisited[j][i] = true;\\n\\t\\tNode root = NodeFactory.createNode(i, j, 0, null, null);\\n\\t\\tq.add(root);\\n\\n\\t\\t// stores length of longest path from source to destination\\n\\t\\tint min_dist = Integer.MAX_VALUE;\\n\\t\\tNode node = null;\\n\\n\\t\\t// run till queue is not empty\\n\\t\\twhile (!q.isEmpty()) {\\n\\t\\t\\t// pop front node from queue and process it\\n\\n\\t\\t\\tnode = q.poll();\\n\\t\\t\\ti = node.x;\\n\\t\\t\\tj = node.y;\\n\\t\\t\\tint dist = node.dist;\\n\\n\\t\\t\\tif (i == x && j == y) {\\n\\t\\t\\t\\tmin_dist = dist;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor (Direction dir : DIRECTIONS) {\\n\\t\\t\\t\\tint nx = i + dir.x;\\n\\t\\t\\t\\tint ny = j + dir.y;\\n\\n\\t\\t\\t\\tif (isValid(mat, visited, nx, ny)) {\\n\\t\\t\\t\\t\\t// mark next cell as visited and enqueue it\\n\\n\\t\\t\\t\\t\\tvisited[ny][nx] = true;\\n\\t\\t\\t\\t\\tint ndist = dist + 1;\\n\\n\\t\\t\\t\\t\\tNode newNode = NodeFactory.createNode(nx, ny, ndist, dir,\\n\\t\\t\\t\\t\\t\\t\\tnode);\\n\\n\\t\\t\\t\\t\\t// Node newNode =new Node(node, nx, ny, ndist, dir);\\n\\n\\t\\t\\t\\t\\tq.add(newNode);\\n\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t\\tif (min_dist == Integer.MAX_VALUE){\\n\\t\\t\\treturn null;\\n\\t\\t}\\n\\t\\treturn node;\\n\\t}\",\n \"private void breadthFirst(PathBetweenNodes graph, LinkedList<String> visited) {\\r\\n\\r\\n LinkedList<String> nodes = graph.adjacentNodes(visited.getLast());\\r\\n for (String node : nodes)\\r\\n {\\r\\n if (visited.contains(node))\\r\\n {\\r\\n continue;\\r\\n }\\r\\n if (node.equals(END))\\r\\n {\\r\\n \\tif (mode1 && mode){\\r\\n visited.add(node);\\r\\n printPath(visited); \\r\\n graph.flag=false;\\r\\n mode=false;\\r\\n visited.removeLast();\\r\\n \\t} else if(mode2){\\r\\n visited.add(node);\\r\\n printPath(visited); \\r\\n flag=mode2; \\r\\n visited.removeLast();\\r\\n \\t} \\r\\n } \\r\\n }\\r\\n\\r\\n for (String node : nodes) { // implementing a for loop to call each node in the array nodes\\r\\n if (visited.contains(node) || node.equals(END)) { // if statement to see if node is already visited or it is the end node\\r\\n continue;\\r\\n }\\r\\n flag=true;\\r\\n visited.addLast(node); //adding the last node to visited array\\r\\n breadthFirst(graph, visited); // implementing the breath first search\\r\\n visited.removeLast(); // removing the last node from array visited\\r\\n }\\r\\n if (flag == false) {\\r\\n System.out.println(\\\"No path Exists between \\\" + START + \\\" and \\\" + END);\\r\\n flag = true;\\r\\n }\\r\\n }\",\n \"public void breadthFirstTraverse() {\\n\\t\\t// track whether vertex was visited\\n\\t\\tHashMap<Integer, Boolean> visited = buildVisited();\\n\\t\\t// store neighbors\\n\\t\\tQueue<Integer> queue = new LinkedList<Integer>();\\n\\n\\t\\t// arbitrarily add first element\\n\\t\\tInteger current = (Integer) edges.keySet().toArray()[0];\\n\\t\\tqueue.add(current);\\n\\n\\t\\twhile (queue.peek() != null) {\\n\\n\\t\\t\\tcurrent = queue.remove();\\n\\t\\t\\tSystem.out.println(\\\"current: \\\" + current);\\n\\t\\t\\tvisited.put(current, true);\\n\\n\\t\\t\\tfor (Integer neighbor: edges.get(current)) {\\n\\t\\t\\t\\tif (!visited.get(neighbor)) {\\n\\t\\t\\t\\t\\tqueue.add(neighbor);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\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 \"public static void breadthFirstSearch (HashMap<String, Zpair> stores,\\n HashSet<Zpair> visited,\\n List<Integer> sortedQueue) {\\n List<String> q = new ArrayList<String>();\\n q.add(\\\"Q\\\");\\n // k=0\\n //int k = 0;\\n while(q.size() != 0) {\\n //if(k == 21) {\\n // System.exit(20);\\n // }\\n List<StringBuffer> path = new ArrayList<StringBuffer>(); // this is the return string\\n List<String> q1 = new ArrayList<String>();\\n int size = q.size();\\n //System.out.println(k);\\n for(int i = 0; i < size; i++) {\\n //printList(q);\\n path.add(ZMethods.stringPop(q));\\n execute(path.get(i), stores, visited, q1, sortedQueue);\\n }\\n copyStringBuffer(q1,q);\\n //k++;\\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 \"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 String depthFirstSearch( AnyType start_vertex ) throws VertexException {\\n \\n StringBuffer buffer = new StringBuffer();\\n \\n // ----------------------------\\n // TODO: Add your code here\\n // ----------------------------\\n ConstantTimeStack<Vertex<AnyType>> stack = new ConstantTimeStack<Vertex<AnyType>>();\\n boolean exists = false;\\n Vertex<AnyType> S = new Vertex<AnyType>(start_vertex);\\n int counter = 0;\\n //loop through to set each vertex to not visited\\n for( int i = 0; i < vertex_adjacency_list.size(); i++){\\n vertex_adjacency_list.get(i).setVisited(-1);\\n //if find the start vertex then set index position to counter\\n if(vertex_adjacency_list.get(i).compareTo(S) == 0){\\n exists = true;\\n vertex_adjacency_list.get(i).setVisited(counter);\\n counter = i;\\n }\\n }\\n //if doesn't exist then through exception\\n if(exists == false){\\n throw new VertexException(\\\"Start Vertex does not exist\\\");\\n }\\n //if it does exist then push start node onto stack, set visited \\n else if(exists){\\n stack.push(vertex_adjacency_list.get(counter));\\n vertex_adjacency_list.get(counter).setVisited(1);\\n Vertex <AnyType> e = vertex_adjacency_list.get(counter);\\n counter = 2;\\n int n = e.numberOfAdjacentVertices();\\n try{\\n \\n while(true){\\n //loop through e's adjacent vertices \\n for (n = e.numberOfAdjacentVertices()-1; n >=0 ; n--){\\n //if the adacent vertex has not been visited\\n if(e.getAdjacentVertex(n).hasBeenVisited()==false){\\n //change e to adjacent vertex and push onto stack\\n e = e.getAdjacentVertex(n);\\n stack.push(e);\\n //set e as visited at counter\\n e.setVisited(counter);\\n counter++;\\n //reset n to e's num of vertices\\n n = e.numberOfAdjacentVertices();\\n }\\n //if it has been visited and it's the first node in list\\n //then pop it off the stack and then set e to new top\\n //set n to new num of vertices\\n else if(e.getAdjacentVertex(n).hasBeenVisited() && n == 0){\\n stack.pop();\\n e = stack.peek();\\n n = e.numberOfAdjacentVertices();\\n }\\n }\\n }\\n }catch(EmptyStackException m){\\n }\\n }\\n //loop through the list and print each with when it was visited\\n for(int k = 0; k< vertex_adjacency_list.size(); k++){\\n buffer.append(vertex_adjacency_list.get(k) + \\\":\\\" + vertex_adjacency_list.get(k).getVisited()+ \\\"\\\\n\\\");\\n }\\n \\n return buffer.toString();\\n \\n }\",\n \"private void DepthFirstSearch(Node current){\\n helperDFS( current );\\n }\",\n \"public void breadthFirst() {\\n\\t\\tQueue<Node> queue = new ArrayDeque<>();\\n\\t\\tqueue.add(root);\\n\\t\\twhile(!queue.isEmpty()) {\\n\\t\\t\\tif(queue.peek().left!=null)\\n\\t\\t\\t\\tqueue.add(queue.peek().left);\\n\\t\\t\\tif(queue.peek().right!=null)\\n\\t\\t\\t\\tqueue.add(queue.peek().right);\\n\\t\\t\\tSystem.out.println(queue.poll().data);\\n\\t\\t}\\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 \"public List<String> breadthFirstSearch(List<String> array) {\\n // Write your code here.\\n Queue<Node> queue = new ArrayDeque<>();\\n queue.add(this);\\n // breadthFirstSearch(this, queue, array);\\n while (queue.size() > 0) {\\n Node node = queue.poll();\\n array.add(node.name);\\n queue.addAll(node.children);\\n }\\n return array;\\n }\",\n \"public static int bfs() {\\r\\n check = new int[N][N]; // check 변수 초기화\\r\\n q = new LinkedList<Point>();\\t\\t\\t\\t\\t//bfs 할때 필요한 그 stack. first in first out\\r\\n q.offer(new Point(shark.x, shark.y));\\t\\t\\t//q.offer == 해당 큐의 맨 뒤에 전달된 요소를 삽입함. list에서 list.add와 같은 말임.\\r\\n check[shark.x][shark.y] = 1;\\r\\n\\r\\n int FishCheck = 0;\\t\\t\\t\\t\\t\\t\\t\\t//the number of the fish in the sea map\\r\\n Shark fish = new Shark(N, N);\\t\\t\\t\\t\\t//new shark initiation\\r\\n loop: while (!q.isEmpty()) {\\r\\n int r = q.peek().x;\\t\\t\\t\\t\\t\\t\\t//q.peek == 해당 큐의 맨 앞에 있는(제일 먼저 저장된) 요소를 반환함\\r\\n int c = q.poll().y;\\t\\t\\t\\t\\t\\t\\t//q.poll == 해당 큐의 맨 앞에 있는(제일 먼저 저장된) 요소를 반환하고, 해당 요소를 큐에서 제거함. 만약 큐가 비어있으면 null을 반환함.\\r\\n\\r\\n for (int d = 0; d < dr.length; d++) {\\r\\n int nr = r + dr[d];\\t\\t\\t\\t\\t\\t//북(0),남(1),동(2),서(3) 순으로. nr == new row\\r\\n int nc = c + dc[d];\\t\\t\\t\\t\\t\\t//북(0),남(1),동(2),서(3) 순으로. nc == new column\\r\\n\\r\\n // 지나갈 수 있는 곳: 자신보다 큰 물고기가 없는 곳\\r\\n if (isIn(nr, nc) && check[nr][nc] == 0 && sea[nr][nc] <= shark.lv) {\\r\\n check[nr][nc] = check[r][c] + 1;\\r\\n q.offer(new Point(nr, nc));\\r\\n\\r\\n // 위치가 더 커질 경우, 더이상 확인할 필요 X\\r\\n if (FishCheck != 0 && FishCheck < check[nr][nc]) {\\r\\n break loop;\\r\\n }\\r\\n \\r\\n // 처음 먹을 수 있는 자기보다 물고기가 발견 되었을 때\\r\\n if (0 < sea[nr][nc] && sea[nr][nc] < shark.lv && FishCheck == 0) {\\r\\n FishCheck = check[nr][nc];\\r\\n fish.x = nr;\\r\\n fish.y = nc;\\r\\n fish.lv = sea[nr][nc];\\r\\n }\\r\\n // 같은 위치에 여러 마리 있을 경우, 가장 위의 가장 왼쪽 물고기부터 먹음\\r\\n else if (FishCheck == check[nr][nc] && 0 < sea[nr][nc] && sea[nr][nc] < shark.lv) {\\r\\n if (nr < fish.x) { // 가장 위에 있는 거 우선권\\r\\n fish.x = nr;\\r\\n fish.y = nc;\\r\\n fish.lv = sea[nr][nc];\\r\\n } else if (nr == fish.x && nc < fish.y) { // 다 가장 위일 경우, 가장 왼쪽 우선권\\r\\n fish.x = nr;\\r\\n fish.y = nc;\\r\\n fish.lv = sea[nr][nc];\\r\\n }\\r\\n\\r\\n }\\r\\n\\r\\n }else if(isIn(nr, nc) && check[nr][nc] == 0) {\\r\\n check[nr][nc] = -1;\\r\\n }\\r\\n }\\r\\n }\\r\\n // idx 초과 안날 경우\\r\\n if (fish.x != N && fish.y != N) {\\r\\n eatFish(fish);\\r\\n }\\r\\n \\r\\n return (FishCheck - 1);\\r\\n }\",\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 boolean direction(Maze maze, Stack<Integer> stack) {\\n boolean zero = true;\\n boolean one = true;\\n boolean two = true;\\n boolean three = true;\\n while (one || two || zero || three) {\\n int direction = random.nextInt(4);\\n if (direction == 0 && zero) {\\n if (maze.getRight() == 1) {\\n maze.goRight();\\n maze.getTable()[maze.positionX()][maze.positionY()] = 1;\\n stack.push(0);\\n return true;\\n } else if (maze.getRight() == 2) {\\n maze.goRight();\\n maze.goRight();\\n maze.goRight();\\n maze.goRight();\\n stack.push(0);\\n stack.push(0);\\n stack.push(0);\\n stack.push(0);\\n maze.getTable()[maze.positionX()][maze.positionY()] = 1;\\n maze.getTable()[maze.positionX() - 1][maze.positionY()] = 2;\\n maze.getTable()[maze.positionX() - 2][maze.positionY()] = 1;\\n maze.getTable()[maze.positionX() - 3][maze.positionY()] = 1;\\n } else\\n zero = false;\\n } else if (direction == 1 && one) {\\n if (maze.getDown() == 1) {\\n maze.goDown();\\n maze.getTable()[maze.positionX()][maze.positionY()] = 1;\\n stack.push(1);\\n return true;\\n } else if (maze.getDown() == 2) {\\n\\n maze.goDown();\\n maze.goDown();\\n maze.goDown();\\n maze.goDown();\\n stack.push(1);\\n stack.push(1);\\n stack.push(1);\\n stack.push(1);\\n maze.getTable()[maze.positionX()][maze.positionY()] = 1;\\n maze.getTable()[maze.positionX()][maze.positionY() - 1] = 2;\\n maze.getTable()[maze.positionX()][maze.positionY() - 2] = 1;\\n maze.getTable()[maze.positionX()][maze.positionY() - 3] = 1;\\n } else\\n one = false;\\n } else if (direction == 2 && two) {\\n if (maze.getLeft() == 1) {\\n maze.goLeft();\\n maze.getTable()[maze.positionX()][maze.positionY()] = 1;\\n stack.push(2);\\n return true;\\n } else if (maze.getLeft() == 2) {\\n\\n maze.goLeft();\\n maze.goLeft();\\n maze.goLeft();\\n maze.goLeft();\\n stack.push(2);\\n stack.push(2);\\n stack.push(2);\\n stack.push(2);\\n maze.getTable()[maze.positionX()][maze.positionY()] = 1;\\n maze.getTable()[maze.positionX() + 1][maze.positionY()] = 2;\\n maze.getTable()[maze.positionX() + 2][maze.positionY()] = 1;\\n maze.getTable()[maze.positionX() + 3][maze.positionY()] = 1;\\n\\n } else\\n two = false;\\n } else if (direction == 3 && three) {\\n if (maze.getUp() == 1) {\\n maze.goUp();\\n maze.getTable()[maze.positionX()][maze.positionY()] = 1;\\n stack.push(3);\\n return true;\\n } else if (maze.getUp() == 2) {\\n maze.goUp();\\n maze.goUp();\\n maze.goUp();\\n maze.goUp();\\n stack.push(3);\\n stack.push(3);\\n stack.push(3);\\n stack.push(3);\\n maze.getTable()[maze.positionX()][maze.positionY()] = 1;\\n maze.getTable()[maze.positionX()][maze.positionY() + 1] = 2;\\n maze.getTable()[maze.positionX()][maze.positionY() + 2] = 1;\\n maze.getTable()[maze.positionX()][maze.positionY() + 3] = 1;\\n } else\\n\\n three = false;\\n }\\n\\n }\\n return false;\\n }\",\n \"public String breadthFirstSearch( AnyType start_vertex ) throws VertexException {\\n \\n StringBuffer buffer = new StringBuffer();\\n \\n // ----------------------------\\n // TODO: Add your code here\\n // ----------------------------\\n boolean exists = false;\\n Vertex<AnyType> S = new Vertex<AnyType>(start_vertex);\\n int counter = 1;\\n //make new vertex to check if its in list\\n //make queue to hold vertices\\n SemiConstantTimeQueue<Vertex<AnyType>> queue = new SemiConstantTimeQueue<Vertex<AnyType>>();\\n //loop through and set not visited\\n for( int i = 0; i < vertex_adjacency_list.size(); i++){\\n vertex_adjacency_list.get(i).setVisited(-1);\\n //if it's in list then set exists to true\\n //and set visited \\n if(vertex_adjacency_list.get(i).compareTo(S) == 0){\\n exists = true;\\n vertex_adjacency_list.get(i).setVisited(counter);\\n counter = i;\\n }\\n } \\n //if doesn't exist then throw the exception\\n if(exists == false){\\n throw new VertexException(\\\"Start Vertex does not exist\\\");\\n }\\n //make new queue\\n queue.add(vertex_adjacency_list.get(counter));\\n vertex_adjacency_list.get(counter).setVisited(1);\\n counter = 1;\\n int k=0;\\n Vertex<AnyType>e;\\n //while the queue isn't empty\\n while(queue.peek() !=null){\\n //make e the top of the queue \\n e = queue.peek(); \\n //go through the list and if you reach the begining it exits loop\\n for( k = 0; k < vertex_adjacency_list.size()-1; k++){\\n if(vertex_adjacency_list.get(k).compareTo(e)==0){\\n break;\\n }\\n } \\n //go through loop and check if visited, if not then add it to queue, set visited\\n for( int j = 0; j< vertex_adjacency_list.get(k).numberOfAdjacentVertices(); j++){\\n if(vertex_adjacency_list.get(k).getAdjacentVertex(j).hasBeenVisited()==false){\\n counter++;\\n queue.add(vertex_adjacency_list.get(k).getAdjacentVertex(j));\\n vertex_adjacency_list.get(k).getAdjacentVertex(j).setVisited(counter);\\n }\\n }\\n //remove from queue when through loop once\\n k++;\\n queue.remove();\\n }\\n //loop through list and print vertex and when it was visited\\n for(int o = 0; o< vertex_adjacency_list.size(); o++){\\n buffer.append(vertex_adjacency_list.get(o) + \\\":\\\" + vertex_adjacency_list.get(o).getVisited()+ \\\"\\\\n\\\");\\n }\\n return buffer.toString();\\n }\",\n \"public void bfs(Queue<Integer> queue, int visited[]) {\\n if (queue.isEmpty()) {\\n return;\\n }\\n\\n int root = queue.poll();\\n\\n if (visited[root] == 1) {\\n bfs(queue, visited);\\n return;//alreadu into consideration\\n }\\n\\n\\n System.out.printf(\\\"Exploring of node %d has started\\\\n\\\", root);\\n visited[root] = 1;\\n\\n\\n for (int i = 0; i < adjMatrix[root].size(); i++) {\\n if (visited[adjMatrix[root].get(i)] == 1 || visited[adjMatrix[root].get(i)] == 2) {\\n continue;\\n }\\n queue.add(adjMatrix[root].get(i));\\n }\\n bfs(queue, visited);\\n System.out.printf(\\\"Exploring of node %d has end\\\\n\\\", root);\\n visited[root] = 2;\\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 static Node searchBFSInvalidDes(int mat[][], int i, int j, int x,\\n\\t\\t\\tint y) {\\n\\t\\tfor (int n = 1; n < 30; n++) {\\n\\t\\t\\tfor (int p = 1; p < 30; p++) {\\n\\t\\t\\t\\tvisited[n][p] = false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t// create an empty queue\\n\\t\\tQueue<Node> q = queue;\\n\\t\\tq.clear();\\n\\t\\t// mark source cell as visited and enqueue the source node\\n\\t\\tvisited[j][i] = true;\\n\\t\\tNode root = NodeFactory.createNode(i, j, 0, null, null);\\n\\t\\tq.add(root);\\n\\n\\t\\t// stores length of longest path from source to destination\\n\\t\\tint min_dist = Integer.MAX_VALUE;\\n\\t\\tNode node = null;\\n\\t\\t// run till queue is not empty\\n\\t\\twhile (!q.isEmpty()) {\\n\\t\\t\\t// pop front node from queue and process it\\n\\t\\t\\tnode = q.poll();\\n\\n\\t\\t\\t// (i, j) represents current cell and dist stores its\\n\\t\\t\\t// minimum distance from the source\\n\\t\\t\\ti = node.x;\\n\\t\\t\\tj = node.y;\\n\\t\\t\\tint dist = node.dist;\\n\\n\\t\\t\\t// if destination is found, update min_dist and stop\\n\\t\\t\\tif (i == x && j == y) {\\n\\t\\t\\t\\tmin_dist = dist;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\n\\t\\t\\t// check for all 4 possible movements from current cell\\n\\t\\t\\t// and enqueue each valid movement\\n\\t\\t\\tfor (Direction dir : DIRECTIONS) {\\n\\t\\t\\t\\t// check if it is possible to go to position\\n\\t\\t\\t\\t// (i + row[k], j + col[k]) from current position\\n\\t\\t\\t\\tint nx = i + dir.x;\\n\\t\\t\\t\\tint ny = j + dir.y;\\n\\t\\t\\t\\tif (isValid(mat, visited, nx, ny) || ((nx == x) && ny == y)) {\\n\\t\\t\\t\\t\\t// mark next cell as visited and enqueue it\\n\\t\\t\\t\\t\\tvisited[ny][nx] = true;\\n\\t\\t\\t\\t\\tint ndist = dist + 1;\\n\\t\\t\\t\\t\\tNode newNode = NodeFactory.createNode(nx, ny, ndist, dir,\\n\\t\\t\\t\\t\\t\\t\\tnode);\\n\\t\\t\\t\\t\\t// Node newNode =new Node(node, nx, ny, ndist, dir);\\n\\t\\t\\t\\t\\tq.add(newNode);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (min_dist == Integer.MAX_VALUE)\\n\\t\\t\\treturn null;\\n\\t\\treturn node;\\n\\t}\",\n \"private void bfs(int x, int y, Node p) {\\n if (p == null) {\\n // TODO\\n return;\\n }\\n char c = board[x][y];\\n\\n if (p.next(c) == null) {\\n // TODO not found\\n return;\\n }\\n\\n Node node = p.next(c);\\n\\n // if node is leaf, found a word\\n if (node.word != null) {\\n if (!results.contains(node.word)) {\\n results.add(node.word);\\n }\\n }\\n\\n mark[x][y] = true;\\n for (int[] dir: dirs) {\\n int newX = x + dir[0];\\n int newY = y + dir[1];\\n if (newX < 0 || n <= newX\\n || newY < 0 || m <= newY) {\\n continue;\\n }\\n\\n if (mark[newX][newY]) {\\n continue;\\n }\\n\\n bfs(newX, newY, node);\\n }\\n mark[x][y] = false;\\n }\",\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 \"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 \"public static boolean Traversal_DFS(int row, int col, int[][] maze)\\r\\n {\\n if (isASolution(row, col))\\r\\n {\\r\\n maze[row][col] = 3;\\r\\n return true;\\r\\n }\\r\\n\\r\\n // otherwise, mark the cell as visited and process its children.\\r\\n maze[row][col] = 2;\\r\\n if (canMove(row,col-1, maze) && Traversal_DFS(row,col-1, maze))\\r\\n {\\r\\n \\t// mark this as success.\\r\\n maze[row][col-1] = 3;\\r\\n return true;\\r\\n }\\r\\n if (canMove(row,col+1, maze))\\r\\n {\\r\\n // move right\\r\\n if (Traversal_DFS(row,col+1, maze))\\r\\n {\\r\\n \\tmaze[row][col+1] = 3;\\r\\n return true;\\r\\n }\\r\\n }\\r\\n if (canMove(row-1,col, maze))\\r\\n {\\r\\n // move up\\r\\n if (Traversal_DFS(row-1,col, maze))\\r\\n {\\r\\n \\tmaze[row-1][col] = 3;\\r\\n return true;\\r\\n }\\r\\n }\\r\\n if (canMove(row+1,col, maze))\\r\\n {\\r\\n // move down\\r\\n if (Traversal_DFS(row+1,col, maze))\\r\\n {\\r\\n \\tmaze[row+1][col] = 3;\\r\\n return true;\\r\\n }\\r\\n }\\r\\n // Failure, unmark the cell and return false\\r\\n maze[row][col] = 0;\\r\\n return false;\\r\\n }\",\n \"public static void findShortestPath(char[][] maze) {\\n\\t\\tboolean visited[][] = new boolean[maze.length][maze[0].length]; \\n\\t\\tint srcX = 0, srcY = 0;\\n\\t\\t// find the source\\n\\t\\tfor(int i=0; i<maze.length; i++) {\\n\\t\\t\\tfor(int j=0; j<maze[0].length; j++) {\\n\\t\\t\\t\\tif(maze[i][j] == 's') {\\n\\t\\t\\t\\t\\tsrcX = i; srcY=j;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tboolean pe = doGridBFS(maze,visited,srcX,srcY);\\n\\t\\tSystem.out.println(pe);\\n\\t\\t\\n\\t}\",\n \"public static void main(String[] args) {\\n\\t\\tScanner sc = new Scanner(System.in);\\n\\t\\tStack<Integer> st = new Stack<Integer>();\\n\\t\\tQueue<Integer> que = new LinkedList<Integer>();\\n\\t\\tArrayList<Integer> path = new ArrayList<>();\\n\\t\\tint n = sc.nextInt();\\n\\t\\tint m = sc.nextInt();\\n\\t\\tint v = sc.nextInt();\\n\\t\\tint [][] arr= new int [n+1][n+1];\\n\\t\\tboolean [] visit = new boolean[n+1];\\n\\t\\tfor(int i=0;i<m;i++) {\\n\\t\\t\\tint a = sc.nextInt();\\n\\t\\t\\tint b = sc.nextInt();\\n\\t\\t\\tarr[a][b] = 1;\\n\\t\\t\\tarr[b][a] = 1;\\n\\t\\t}\\n\\t\\tst.push(v);\\n\\t\\twhile(!st.isEmpty()) {\\n\\t\\t\\tint temp = st.pop();\\n\\t\\t\\tif(visit[temp]) {\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tpath.add(temp);\\n\\t\\t\\tvisit[temp] = true;\\n\\t\\t\\tfor(int i=n;i>0;i--) {\\n\\t\\t\\t\\tif(arr[temp][i]==1 && !visit[i]) {\\n\\t\\t\\t\\t\\tst.push(i);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int i=0;i<path.size();i++) {\\n\\t\\t\\tSystem.out.print(path.get(i)+\\\" \\\");\\n\\t\\t}\\n\\t\\tSystem.out.println();\\n\\t\\tArrays.fill(visit, false);\\n\\t\\tpath = new ArrayList<>();\\n\\t\\tque.add(v);\\n\\t\\twhile(!que.isEmpty()) {\\n\\t\\t\\tint temp = que.poll();\\n\\t\\t\\tif(visit[temp]) {\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tpath.add(temp);\\n\\t\\t\\tvisit[temp] = true;\\n\\t\\t\\tfor(int i=1;i<=n;i++) {\\n\\t\\t\\t\\tif(arr[temp][i]==1 && !visit[i]) {\\n\\t\\t\\t\\t\\tque.add(i);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int i=0;i<path.size();i++) {\\n\\t\\t\\tSystem.out.print(path.get(i)+\\\" \\\");\\n\\t\\t}\\n\\t}\",\n \"void BFS(int s, int d) \\r\\n { \\r\\n int source = s;\\r\\n int destination = d;\\r\\n boolean visited[] = new boolean[V];\\r\\n int parent[] = new int[V];\\r\\n \\r\\n // Create a queue for BFS \\r\\n LinkedList<Integer> queue = new LinkedList<Integer>(); \\r\\n \\r\\n // Mark the current node as visited and enqueue it \\r\\n \\r\\n visited[s]=true; \\r\\n queue.add(s); \\r\\n System.out.println(\\\"Search Nodes: \\\");\\r\\n while (queue.size() != 0) \\r\\n { \\r\\n int index = 0;\\r\\n \\r\\n // Dequeue a vertex from queue and print it \\r\\n \\r\\n s = queue.poll();\\r\\n \\r\\n System.out.print(convert2(s)); \\r\\n \\r\\n if(s == destination)\\r\\n {\\r\\n break;\\r\\n }\\r\\n \\r\\n System.out.print(\\\" -> \\\");\\r\\n while(index < adj[s].size()) \\r\\n { \\r\\n \\r\\n \\r\\n int n = adj[s].get(index); \\r\\n if (!visited[n]) \\r\\n { \\r\\n visited[n] = true;\\r\\n parent[n] = s;\\r\\n queue.add(n); \\r\\n }\\r\\n index = index+ 2;\\r\\n \\r\\n \\r\\n }\\r\\n \\r\\n \\r\\n \\r\\n }\\r\\n int check = destination;\\r\\n int cost = 0, first, second = 0;\\r\\n String string = \\\"\\\" + convert2(check);\\r\\n while(check!=source)\\r\\n {\\r\\n \\r\\n first = parent[check];\\r\\n string = convert2(first) + \\\" -> \\\" + string;\\r\\n while(adj[first].get(second) != check)\\r\\n {\\r\\n second++;\\r\\n }\\r\\n cost = cost + adj[first].get(second +1);\\r\\n check = first;\\r\\n second = 0;\\r\\n \\r\\n }\\r\\n \\r\\n System.out.println(\\\"\\\\n\\\\nPathway: \\\");\\r\\n \\r\\n System.out.println(string);\\r\\n \\r\\n \\r\\n System.out.println(\\\"\\\\nTotal cost: \\\" + cost);\\r\\n }\",\n \"@Override\\n\\t//loc1 is the start location,loc2 is the destination\\n\\tpublic ArrayList<MapCoordinate> bfsSearch(MapCoordinate loc1, MapCoordinate loc2, Map m) {\\n\\t\\tSystem.out.println(\\\"come into bfsSearch\\\");\\n\\t\\tif(m.isAgentHasAxe() && m.isAgentHasKey()){\\n\\t\\t\\tLinkedList<State> queue=new LinkedList<State>();\\n\\t\\t\\tArrayList<MapCoordinate> Visited=new ArrayList<MapCoordinate>();\\n\\t\\t\\t\\n\\t\\t\\t//Visited.add(loc1);\\n\\t\\t\\tState s1=new State(loc1,m.getAgentHasNStones(),null);\\n\\t\\t\\tqueue.add(s1);\\n\\t\\t\\t\\n\\t\\t\\twhile(!queue.isEmpty()){\\n\\t\\t\\t\\tState s=queue.remove();\\n\\t\\t\\t\\tMapCoordinate currentLocation=s.getLocation();\\n\\t\\t\\t\\tVisited.add(s.getLocation()); //add to visited every loop\\n\\t\\t\\t\\tif(loc2.equals(currentLocation)){\\n\\t\\t\\t\\t\\t//means could reach loc2 from loc1\\n\\t\\t\\t\\t\\tArrayList<MapCoordinate> route=new ArrayList<MapCoordinate>();\\n\\t\\t\\t\\t\\twhile(s.getPrevState()!=null){\\n\\t\\t\\t\\t\\t\\troute.add(0,s.getLocation()); //add to head\\n\\t\\t\\t\\t\\t\\ts=s.getPrevState();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\treturn route;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tMapCoordinate temp=new MapCoordinate(currentLocation.getX()+1,currentLocation.getY());\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){//state move east\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){ //this is important else if(cTemp!='~'), not barely else,\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\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\\ttemp=new MapCoordinate(currentLocation.getX()-1,currentLocation.getY());\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){//state move south\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\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\\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()+1);\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){//state move north\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\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\\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()-1);\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){//state move south\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' &&s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\t\\n\\t\\t\\t}\\n\\t\\t\\treturn null;\\n\\t\\t}else if(m.isAgentHasAxe()){ //only have axe\\n\\t\\t\\tLinkedList<State> queue=new LinkedList<State>();\\n\\t\\t\\tArrayList<MapCoordinate> Visited=new ArrayList<MapCoordinate>();\\n\\t\\t\\t\\n\\t\\t\\t//Visited.add(loc1);\\n\\t\\t\\tState s1=new State(loc1,m.getAgentHasNStones(),null);\\n\\t\\t\\tqueue.add(s1);\\n\\t\\t\\t\\n\\t\\t\\twhile(!queue.isEmpty()){\\n\\t\\t\\t\\tState s=queue.remove();\\n\\t\\t\\t\\tMapCoordinate currentLocation=s.getLocation();\\n\\t\\t\\t\\tVisited.add(s.getLocation()); //add visited every loop\\n\\t\\t\\t\\tif(loc2.equals(currentLocation)){\\n\\t\\t\\t\\t\\t//means could reach loc2 from loc1\\n\\t\\t\\t\\t\\tArrayList<MapCoordinate> route=new ArrayList<MapCoordinate>();\\n\\t\\t\\t\\t\\twhile(s.getPrevState()!=null){\\n\\t\\t\\t\\t\\t\\troute.add(0,s.getLocation()); //add to head\\n\\t\\t\\t\\t\\t\\ts=s.getPrevState();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\treturn route;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tMapCoordinate temp=new MapCoordinate(currentLocation.getX()+1,currentLocation.getY());\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){//state move south\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\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\\ttemp=new MapCoordinate(currentLocation.getX()-1,currentLocation.getY());\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){//state move south\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\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\\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()+1);\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){//state move north\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\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\\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()-1);\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){//state move south\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\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\\treturn null;\\n\\t\\t}else if(m.isAgentHasKey()){ //only have key\\n\\t\\t\\tLinkedList<State> queue=new LinkedList<State>();\\n\\t\\t\\tArrayList<MapCoordinate> Visited=new ArrayList<MapCoordinate>();\\n\\t\\t\\t\\n\\t\\t\\t//Visited.add(loc1);\\n\\t\\t\\tState s1=new State(loc1,m.getAgentHasNStones(),null);\\n\\t\\t\\tqueue.add(s1);\\n\\t\\t\\t\\n\\t\\t\\twhile(!queue.isEmpty()){\\n\\t\\t\\t\\tState s=queue.remove();\\n\\t\\t\\t\\tMapCoordinate currentLocation=s.getLocation();\\n\\t\\t\\t\\tVisited.add(s.getLocation());\\n\\t\\t\\t\\tif(loc2.equals(currentLocation)){\\n\\t\\t\\t\\t\\t//means could reach loc2 from loc1\\n\\t\\t\\t\\t\\tArrayList<MapCoordinate> route=new ArrayList<MapCoordinate>();\\n\\t\\t\\t\\t\\twhile(s.getPrevState()!=null){\\n\\t\\t\\t\\t\\t\\troute.add(0, s.getLocation()); //add to head,in this fashion, return the right order of route\\n\\t\\t\\t\\t\\t\\ts=s.getPrevState();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\treturn route;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tMapCoordinate temp=new MapCoordinate(currentLocation.getX()+1,currentLocation.getY()); \\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){//state move east\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='T' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\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\\ttemp=new MapCoordinate(currentLocation.getX()-1,currentLocation.getY()); //state that move west\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='T' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\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\\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()+1); //state move north\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='T' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\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\\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()-1); //state move south\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){//at least has 1 stone\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for initial state\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='T' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\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\\treturn null;\\n\\t\\t}\\n\\t\\t\\n\\t\\t\\n\\t\\t/*\\n\\t\\t * \\n\\t\\t **/\\t\\t\\n\\t\\telse{ //have no key and axe\\n\\t\\t\\tSystem.out.println(\\\"come into the last elas clause\\\");\\n\\t\\t\\tLinkedList<State> queue=new LinkedList<State>();\\n\\t\\t\\tArrayList<MapCoordinate> Visited=new ArrayList<MapCoordinate>();\\n\\t\\t\\t\\n\\t\\t\\tVisited.add(loc1);\\n\\t\\t\\tState s1=new State(loc1,m.getAgentHasNStones(),null);\\n\\t\\t\\tqueue.add(s1);\\n\\t\\t\\t\\n\\t\\t\\t//int i=0;\\n\\t\\t\\twhile(!queue.isEmpty()){\\n\\t\\t\\t\\t//i++;\\n\\t\\t\\t\\t//System.out.println(\\\"come into while: \\\"+i);\\n\\t\\t\\t\\tState s=queue.remove();\\n\\t\\t\\t\\tMapCoordinate currentLocation=s.getLocation();\\n\\t\\t\\t\\tVisited.add(s.getLocation()); //add visited, let program won't stuck in \\n\\t\\t\\t\\tif(loc2.equals(currentLocation)){\\n\\t\\t\\t\\t\\t//means could reach loc2 from loc1\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"return computed route\\\");\\n\\t\\t\\t\\t\\tArrayList<MapCoordinate> route=new ArrayList<MapCoordinate>();\\n\\t\\t\\t\\t\\twhile(s.getPrevState()!=null){\\n\\t\\t\\t\\t\\t\\troute.add(0, s.getLocation()); //add to head\\n\\t\\t\\t\\t\\t\\ts=s.getPrevState();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tfor(MapCoordinate mc:route){\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"print returned route in bfssearch\\\");\\n\\t\\t\\t\\t\\t\\tSystem.out.print(\\\"mc:\\\"+mc.getX()+\\\" \\\"+mc.getY()+\\\"->\\\");\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\treturn route;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tMapCoordinate temp=new MapCoordinate(currentLocation.getX()+1,currentLocation.getY());\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){\\n\\t\\t\\t\\t\\t//System.out.println(\\\"1 if\\\");\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null &&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if\\\");\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 if\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 if\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 else\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for the initial state \\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\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\\ttemp=new MapCoordinate(currentLocation.getX()-1,currentLocation.getY());\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.add(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for the initial state \\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\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\\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()+1);\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*'&&cTemp!='T'&&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for the initial state \\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\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\\ttemp=new MapCoordinate(currentLocation.getX(),currentLocation.getY()-1);\\n\\t\\t\\t\\tif(m.hasCoordinate(temp)){\\n\\t\\t\\t\\t\\tif(s.getPrevState()!=null&&!temp.equals(s.getPrevState().getLocation())){\\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\tif(!Visited.contains(temp)&&cTemp!='*' &&cTemp!='T' &&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}//do not do any action for not enough stones situation\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}else if(s.getPrevState()==null){ //for the initial state \\n\\t\\t\\t\\t\\t\\tchar cTemp=m.getSymbol(temp);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"2 if lalala\\\");\\n\\t\\t\\t\\t\\t\\tif(cTemp!='*' &&cTemp!='T'&&cTemp!='-' ){\\n\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"3 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\tif(cTemp=='~' && s.getStoneNumber()>0){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 iflalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber()-1,s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addLast(newState);\\n\\t\\t\\t\\t\\t\\t\\t}else if(cTemp!='~'){\\n\\t\\t\\t\\t\\t\\t\\t\\t//System.out.println(\\\"4 elselalala\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\tState newState=new State(new MapCoordinate(temp),s.getStoneNumber(),s);\\n\\t\\t\\t\\t\\t\\t\\t\\tqueue.addFirst(newState);\\n\\t\\t\\t\\t\\t\\t\\t}//do not do any action for not enough stones situation\\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\\treturn null;\\n\\t\\t}\\n\\t}\",\n \"Deque<SearchStackElementCategory> getSearchStack() throws Exception;\",\n \"private void breadthFirstSearch (int start, int[] visited, int[] parent){\\r\\n Queue< Integer > theQueue = new LinkedList< Integer >();\\r\\n boolean[] identified = new boolean[getNumV()];\\r\\n identified[start] = true;\\r\\n theQueue.offer(start);\\r\\n while (!theQueue.isEmpty()) {\\r\\n int current = theQueue.remove();\\r\\n visited[current] = 1; //ziyaret edilmis vertexler queuedan cikarilan vertexlerdir\\r\\n Iterator < Edge > itr = edgeIterator(current);\\r\\n while (itr.hasNext()) {\\r\\n Edge edge = itr.next();\\r\\n int neighbor = edge.getDest();\\r\\n if (!identified[neighbor]) {\\r\\n identified[neighbor] = true;\\r\\n theQueue.offer(neighbor);\\r\\n parent[neighbor] = current;\\r\\n }\\r\\n }\\r\\n }\\r\\n }\",\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 solve(int x, int y, boolean draw) {\\n \\t\\t// these are the walls of the maze, maze solver should not go beyond\\n \\t\\t// walls\\n \\t\\t// if (x == 0 || y == 0 || x == N + 1 || y == N + 1) {\\n \\t\\t// return;\\n \\t\\t// }\\n \\n \\t\\t// if we have already visited this position\\n \\t\\t// or if deep levels of the recursion have found the target\\n \\t\\tif (foundTarget || visited[x][y])\\n \\t\\t\\treturn;\\n \\n \\t\\t// this position is new, mark it as visited\\n \\t\\tvisited[x][y] = true;\\n \\n \\t\\tif (draw) {\\n \\t\\t\\t// Draw a blue dot to show we have been here\\n \\t\\t\\tStdDraw.setPenColor(StdDraw.BLUE);\\n \\t\\t\\tStdDraw.filledCircle(x + 0.5, y + 0.5, 0.25);\\n \\t\\t\\tStdDraw.show(SOLVER_SPEED);\\n \\t\\t}\\n \\n \\t\\t// if we have reached the maze solve target\\n \\t\\tif (x == target.x && y == target.y) {\\n \\t\\t\\tfoundTarget = true;\\n \\t\\t}\\n \\n \\t\\t// Try go another place\\n \\t\\tif (!north[x][y])\\n \\t\\t\\tsolve(x, y + 1, draw);\\n \\t\\tif (!east[x][y])\\n \\t\\t\\tsolve(x + 1, y, draw);\\n \\t\\tif (!south[x][y])\\n \\t\\t\\tsolve(x, y - 1, draw);\\n \\t\\tif (!west[x][y])\\n \\t\\t\\tsolve(x - 1, y, draw);\\n \\n \\t\\tif (foundTarget)\\n \\t\\t\\treturn;\\n \\n \\t\\tif (draw) {\\n \\t\\t\\t// Draw a grey dot to show we have backtracked\\n \\t\\t\\tStdDraw.setPenColor(StdDraw.GRAY);\\n \\t\\t\\tStdDraw.filledCircle(x + 0.5, y + 0.5, 0.25);\\n \\t\\t\\tStdDraw.show(SOLVER_SPEED);\\n \\t\\t}\\n \\t}\",\n \"private boolean bfs(int[] pos, int[][] dis, int[][] grid,int m, int n,int bcnt){\\n Queue<int[]> q = new LinkedList<>();\\n int curx=0, cury=0, curlevel=0 ;\\n int newx = 0, newy=0, newlevel = 0;\\n int[] cur;\\n boolean availableplace = false;\\n boolean[][] vd = new boolean[m][n];\\n int res =0;\\n vd[pos[0]][pos[1]] = true;\\n q.offer(pos);\\n while(!q.isEmpty()){\\n cur = q.poll();\\n curx = cur[0];\\n cury = cur[1];\\n curlevel = cur[2];\\n vd[curx][cury]=true;\\n for(int[] mm : M){\\n newx = curx+mm[0];\\n newy = cury+mm[1];\\n if(newx >=0 && newx <m && newy >=0 && newy <n && !vd[newx][newy] &&grid[newx][newy]!=2){\\n vd[newx][newy] = true;\\n if(grid[newx][newy]==1) res++;\\n else if(grid[newx][newy]==0){\\n availableplace = true;\\n dis[newx][newy]+=curlevel;\\n q.offer(new int[]{newx,newy,curlevel+1});\\n }\\n }\\n }\\n }\\n return res==bcnt-1&&availableplace;\\n }\",\n \"static int[] bfs(int n, int m, int[][] edges, int s) {\\r\\n \\r\\n HashSet<Integer> aList[] = new HashSet[n];\\r\\n // Array of the nodes of the tree\\r\\n\\r\\n Queue<Integer> bfsQueue = new LinkedList();\\r\\n\\r\\n boolean visited[] = new boolean[n];\\r\\n // check if a node is visited or not\\r\\n\\r\\n\\r\\n int cost[] = new int[n];\\r\\n // cost to travel from one node to other\\r\\n\\r\\n for (int i = 0; i < n; i++) {\\r\\n // intialising the values\\r\\n visited[i] = false;\\r\\n cost[i] = -1;\\r\\n\\r\\n aList[i] = new HashSet<Integer>();\\r\\n // Each element of aList is a Set\\r\\n // To store the neighbouring nodes of a particular node\\r\\n }\\r\\n\\r\\n for (int i = 0; i < m; i++) {\\r\\n // let node[i] <--> node[j]\\r\\n\\r\\n // adding node[j] to neighbours list of node[i]\\r\\n aList[edges[i][0] - 1].add(edges[i][1] - 1);\\r\\n\\r\\n // adding node[i] to neighbours list of node[j]\\r\\n aList[edges[i][1] - 1].add(edges[i][0] - 1);\\r\\n }\\r\\n\\r\\n //\\r\\n s = s - 1;\\r\\n bfsQueue.add(s);\\r\\n visited[s] = true;\\r\\n cost[s] = 0;\\r\\n //\\r\\n \\r\\n \\r\\n while (!bfsQueue.isEmpty()) {\\r\\n \\r\\n int curr = bfsQueue.poll();\\r\\n // takes the last element of the queue\\r\\n \\r\\n for (int neigh : aList[curr]) { // iterating the neighbours of node 'curr'\\r\\n if (!visited[neigh]) { // checking if node neigh id already visited during the search\\r\\n visited[neigh ] = true;\\r\\n bfsQueue.add(neigh); //add the node neigh to bfsqueue\\r\\n cost[neigh] = cost[curr] + 6; \\r\\n }\\r\\n }\\r\\n }\\r\\n\\r\\n int result[] = new int[n-1];\\r\\n\\r\\n for (int i=0, j=0; i<n && j<n-1; i++, j++) {\\r\\n if (i == s){\\r\\n i++;\\r\\n }\\r\\n result[j] = cost[i];\\r\\n }\\r\\n \\r\\n return result;\\r\\n }\",\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 \"private Stack<MapLocation> findPath(State.StateView state)\\n {\\n Unit.UnitView townhallUnit = state.getUnit(townhallID);\\n Unit.UnitView footmanUnit = state.getUnit(footmanID);\\n \\n MapLocation startLoc = new MapLocation(footmanUnit.getXPosition(), footmanUnit.getYPosition(), null, 0);\\n \\n MapLocation goalLoc = new MapLocation(townhallUnit.getXPosition(), townhallUnit.getYPosition(), null, 0);\\n \\n MapLocation footmanLoc = null;\\n if(enemyFootmanID != -1) {\\n Unit.UnitView enemyFootmanUnit = state.getUnit(enemyFootmanID);\\n footmanLoc = new MapLocation(enemyFootmanUnit.getXPosition(), enemyFootmanUnit.getYPosition(), null, 0);\\n }\\n \\n // get resource locations\\n List<Integer> resourceIDs = state.getAllResourceIds();\\n Set<MapLocation> resourceLocations = new HashSet<MapLocation>();\\n for(Integer resourceID : resourceIDs)\\n {\\n ResourceNode.ResourceView resource = state.getResourceNode(resourceID);\\n \\n resourceLocations.add(new MapLocation(resource.getXPosition(), resource.getYPosition(), null, 0));\\n }\\n \\n return AstarSearch(startLoc, goalLoc, state.getXExtent(), state.getYExtent(), footmanLoc, resourceLocations);\\n }\",\n \"public boolean solveMaze(int x, int y, String direction){\\n\\n if (maze[x][y] == \\\"E\\\"){\\n solved = true;\\n return solved;\\n\\n }\\n\\n if(!(maze[x][y].equals(\\\"S\\\") || maze[x][y].equals(\\\"E\\\"))){\\n maze[x][y] = \\\"X\\\";\\n }\\n\\n if(direction != \\\"up\\\" && isReachable(x+1, y)){\\n solveMaze(x + 1, y, \\\"down\\\");\\n if(solved) return true;\\n }\\n if(direction != \\\"left\\\" && isReachable(x, y+ 1)){\\n solveMaze(x, y + 1, \\\"right\\\");\\n if(solved) return true;\\n }\\n if(direction != \\\"down\\\" && isReachable(x-1, y)){\\n solveMaze(x - 1 , y, \\\"up\\\");\\n if(solved) return true;\\n }\\n if(direction != \\\"right\\\" && isReachable(x, y -1)){\\n solveMaze(x, y - 1, \\\"left\\\");\\n if(solved) return true;\\n }\\n\\n //If cannot move, do backtracking\\n if(!solved) {\\n maze[x][y] = \\\" \\\";\\n return false;\\n }\\n\\n return false;\\n }\",\n \"@Override\\n\\t\\t\\tpublic void run() \\n\\t\\t\\t{\\n\\t\\t\\t\\tif(!(mazeCollection.containsKey(paramArray[0])))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tc.passError(\\\"Maze doesn't exist\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t/*\\n\\t\\t\\t\\t//if solution for this maze exists\\n\\t\\t\\t\\tif(mazeSolutions.containsKey(mazeCollection.get(paramArray[0])))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tc.passSolve(\\\"Solution for \\\"+paramArray[0]+ \\\" is ready\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t*/\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(paramArray[1].toString().equals(\\\"bfs\\\"))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tMazeAdapter ms=new MazeAdapter(mazeCollection.get(paramArray[0]));\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tSearcher<Position> bfs=new BFS<Position>();\\n\\t\\t\\t\\t\\tSolution<Position> sol=bfs.search(ms);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t//check if solution for the maze already exists, if so, replace it with the new one\\n\\t\\t\\t\\t\\tif(mazeSolutions.containsKey(mazeCollection.get(paramArray[0]))) {\\n\\t\\t\\t\\t\\t\\tmazeSolutions.remove(mazeCollection.get(paramArray[0]));\\n\\t\\t\\t\\t\\t\\tmazeSolutions.put(mazeCollection.get(paramArray[0]), sol);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tmazeSolutions.put(mazeCollection.get(paramArray[0]), sol);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tc.passSolve(\\\"Solution for \\\"+paramArray[0]+ \\\" is ready\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if(paramArray[1].toString().equals(\\\"dfs\\\"))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tMazeAdapter ms=new MazeAdapter(mazeCollection.get(paramArray[0]));\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tSearcher<Position> dfs=new DFS<Position>();\\n\\t\\t\\t\\t\\tSolution<Position> sol=dfs.search(ms);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t//check if solution for the maze already exists, if so, replace it with the new one\\n\\t\\t\\t\\t\\tif(mazeSolutions.containsKey(mazeCollection.get(paramArray[0]))) {\\n\\t\\t\\t\\t\\t\\tmazeSolutions.remove(mazeCollection.get(paramArray[0]));\\n\\t\\t\\t\\t\\t\\tmazeSolutions.put(mazeCollection.get(paramArray[0]), sol);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tmazeSolutions.put(mazeCollection.get(paramArray[0]), sol);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tc.passSolve(\\\"Solution for \\\"+paramArray[0]+ \\\" is ready\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tc.passError(\\\"Invalid algorithm\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\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 String findCheese(Place startingPoint) {\\nif (startingPoint==null)\\n\\treturn null;\\n\\nvisited.add(startingPoint);\\nStack<Place> vstdstack=new Stack<Place>();\\nvstdstack.add(startingPoint);\\n//Stack<c> pather=\\\"start->\\\";\\nwhile(!vstdstack.isEmpty())\\n{\\n\\tPlace curpos=getNextPlace(vstdstack.peek());\\n if (curpos==null)\\n {\\n vstdstack.pop();\\n soln.deleteCharAt(soln.length()-1);\\n continue;\\n }\\n if(curpos.isCheese())\\n return soln.toString();\\n else \\n vstdstack.push(curpos);\\n \\n}\\nreturn null;\\n}\",\n \"private boolean solveNext(){\\n Stack<Integer[]> emptyPositions = findEmptyPositions();\\n\\n while (!emptyPositions.isEmpty()) {\\n\\n //get the top empty position from the stack.\\n Integer[] position = emptyPositions.peek();\\n int row = position[0];\\n int col = position[1];\\n\\n for (int value = 1; value <= size; value++) {\\n if (isPositionValid(row, col, value)){\\n\\n //value is valid, we can set it to the board.\\n board[row][col] = value;\\n\\n //recursive backtracking\\n if(solveNext()) {\\n\\n //if the value leads to a solution, pop it from the stack.\\n emptyPositions.pop();\\n return true;\\n }\\n else board[row][col] = 0;\\n\\n }\\n }\\n return false;\\n }\\n return true;\\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 \"static void stack_search(Stack<Integer> stack,int element)\\r\\n\\t{\\r\\n\\t\\tInteger positionOfStackElements=(Integer) stack.search(element);\\r\\n\\t\\tif(positionOfStackElements==-1)\\r\\n\\t\\t\\tSystem.out.println(\\\"Element not found\\\");\\r\\n\\t\\telse System.out.println(\\\"Element is found at position :\\\"+ positionOfStackElements);\\r\\n\\t\\t\\r\\n\\t}\",\n \"void BFS(int s);\",\n \"private void breadthFirstSearch(Node sourceNode, Node destinationNode, String path, HashSet<Character> visited) {\\n // Create a list of nodes to visit (children of nodes)\\n LinkedList<Node> nextToVisit = new LinkedList<>();\\n // Add the first node to the list\\n nextToVisit.add(sourceNode);\\n\\n // Traverse level by level by traversing to all of its children first\\n while(!nextToVisit.isEmpty()) {\\n Node node = nextToVisit.remove();\\n // If its visited already, continue to the next child\\n if(visited.contains(node.charId)) {\\n continue;\\n }\\n // Mark the node as visited\\n path += \\\"->\\\" + node.charId;\\n visited.add(node.charId);\\n // If destination is reached\\n if(node == destinationNode) {\\n paths.add(path);\\n return;\\n }\\n // Add all of its children to the next node to visit\\n for(Node children : node.adjacent) {\\n nextToVisit.add(children);\\n }\\n }\\n\\n }\",\n \"private void bfs(int[][] board){\\n int[][] original = {{1,2,3},{4,5,0}};\\n LinkedList<Cell> queue = new LinkedList<>();\\n HashMap<Cell,int[][]> states = new HashMap<Cell,int[][]>();\\n Set<String> seen = new HashSet<>();\\n queue.offer(new Cell(1,2));\\n states.put(queue.peekFirst(),original);\\n int step = 0;\\n while(step <= maxStep){\\n int sz = queue.size();\\n while(sz-- > 0){\\n Cell cur = queue.pollFirst();\\n int[][] curBoard = states.get(cur);\\n if(seen.contains(this.toStr(curBoard))){\\n continue;\\n }\\n seen.add(this.toStr(curBoard));\\n \\n if (isSame(curBoard,board)){\\n this.res = step;\\n return;\\n }\\n // move around\\n for(int i = 0; i < 4; ++i){\\n int r = cur.row + dr[i];\\n int c = cur.col + dc[i];\\n if(r < 0 || c < 0 || r > 1 || c > 2) continue; \\n Cell next = new Cell(r, c);\\n queue.offer(next);\\n int[][] nextboard = this.clone(curBoard);\\n nextboard[cur.row][cur.col] = nextboard[r][c];\\n nextboard[r][c] = 0;\\n states.put(next,nextboard);\\n }\\n }\\n ++step;\\n }\\n return;\\n }\",\n \"public static void userSelection_SolveMaze(int userInputN){\\n\\n\\t\\tint[] S = new int[(int) Math.pow(userInputN, 2)];\\n\\t\\tgNode[] G = new gNode[S.length];\\n\\n\\t\\tboolean [] visited = new boolean[S.length];\\t\\t//Initialize\\n\\t\\tfor(int i=0; i<visited.length;i++)\\n\\t\\t\\tvisited[i] = false;\\n\\n\\t\\tint [] path = new int[S.length];\\t\\t//Initialize \\n\\t\\tfor(int i=0; i<path.length; i++)\\n\\t\\t\\tpath[i]=-1;\\n\\n\\t\\tScanner input = new Scanner(System.in);\\n\\t\\tSystem.out.println(\\\"How would you like to solve the maze?\\\\n\\\"\\n\\t\\t\\t\\t+ \\\"1.\\\\tBreadth-First Search\\\\n\\\"\\n\\t\\t\\t\\t+ \\\"2.\\\\tDepth-First Search\\\\n\\\"\\n\\t\\t\\t\\t+ \\\"3.\\\\tDepth-First Search with Recursion\\\");\\n\\t\\t\\n\\t\\tint ur = input.nextInt();\\n\\t\\t\\n\\t\\tif(ur==1)\\t//Breadth-First Search\\t\\t\\\\///gNode && start @ position 0\\n\\t\\t\\tbfs(G, visited, path, 0);\\n\\t\\telse if(ur==2)\\t//Depth-First Search\\n\\t\\t\\tdfs_Stack(G, visited, path, 0);\\n\\t\\telse if(ur==3)\\t//Depth-First Search w/recursion\\t\\n\\t\\t\\tdfsRecursion(G, visited, path, 0);\\t\\n\\t\\telse{\\n\\t\\t\\tSystem.out.println(\\\"Invalid option. Please enter the appropriate integer value\\\");\\n\\t\\t\\tuserSelection_SolveMaze(userInputN);\\n\\t\\t}\\n\\t\\t\\n\\t\\tinput.close();\\n\\t}\",\n \"public void solve(char[][] board) {\\n\\t\\tif(board==null || board.length == 0)\\n\\t\\t\\treturn;\\n\\t\\tint rows = board.length;\\n\\t\\tint cols = board[0].length;\\n\\t\\t\\n\\t\\tQueue<Integer> exploreList = new LinkedList<Integer>();\\n\\t\\tfor(int i=0; i< rows;i++){\\n\\t\\t\\tbfs(board, i, 0, rows, cols, exploreList);\\n\\t\\t\\tbfs(board, i, cols-1, rows, cols, exploreList);\\n\\t\\t}\\n\\t\\t\\n\\t\\tfor(int j=1; j< cols; j++){\\n\\t\\t\\tbfs(board, 0, j, rows, cols, exploreList);\\n\\t\\t\\tbfs(board, rows-1, j, rows, cols, exploreList);\\n\\t\\t}\\n\\t\\t\\n\\t\\tfor(int i=0; i<rows; i++){\\n\\t\\t\\tfor(int j=0; j<cols; j++){\\n\\t\\t\\t\\tif(board[i][j] =='D')\\n\\t\\t\\t\\t\\tboard[i][j] = 'O';\\n\\t\\t\\t\\telse if(board[i][j] == 'O')\\n\\t\\t\\t\\t\\tboard[i][j] = 'X';\\n\\t\\t\\t}\\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 \"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 \"public void search(ArrayList<String> path, TrieNode root, char[][] board,\\n int x, int y, boolean[][] visited) {\\n if (root.isString == true) {\\n if (!path.contains(root.s)) {\\n path.add(root.s);\\n }\\n }\\n\\n if (x < 0 || x >= board.length || y < 0 || y >= board[0].length\\n || visited[x][y] == true || root == null) {\\n return;\\n }\\n // DFS\\n if (root.subtree.containsKey(board[x][y])) {\\n for (int i = 0; i < 4; ++i) {\\n visited[x][y] = true;\\n search(path, root.subtree.get(board[x][y]), board, x + dx[i], y + dy[i],\\n visited);\\n visited[x][y] = false;\\n }\\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 DSAQueue breadthFirstSearch(String start, String target)\\n\\t{\\n\\t\\tif(!vertices.isEmpty())\\n\\t\\t{\\n\\t\\t\\tDSAQueue queue = new DSAQueue();\\n\\t\\t\\tDSAStack visited = new DSAStack();\\t//creates empty stack\\n\\t\\t\\tDSAGraphVertex vx = getVertex(start); //vertex to start on (root)\\n\\t\\t\\tDSAGraphVertex dest = getVertex(target); //vertex to start on (dest)\\n\\n\\t\\t\\tclear(); //sets all visited on all vertices == false\\n\\t\\t\\tvx.setVisited(); // Marks root as visited\\n\\t\\t\\tqueue.enqueue(vx); //adds start point to queue\\n\\n\\t\\t\\tbfs(vx, visited, queue, dest); //begin recursion\\n\\n\\t\\t\\tqueue.enqueue(dest); //if successful adds destination to queue\\n\\n\\t\\t\\treturn queue;\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tthrow new NoSuchElementException(\\\"List is empty or start or end elements don't exist\\\");\\n\\t\\t}\\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 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 \"public abstract List<Direction> searchForCheese(Maze maze);\",\n \"public void traverseStack(){\\n // check if there is any stack present or not\\n if(this.arr==null){\\n System.out.println(\\\"No stack present, first create a stack\\\");\\n return;\\n }\\n // check if stack is empty\\n if(this.topOfStack==-1){\\n System.out.println(\\\"Stack is empty, can't traverse\\\");\\n return;\\n }\\n // if stack is not empty\\n System.out.println(\\\"Printing stack...\\\");\\n for(int i=0;i<=this.topOfStack;i++){\\n System.out.print(this.arr[i]+\\\" \\\");\\n }\\n System.out.println();\\n }\",\n \"public TreeNode DFS(int ps,int pe, int is, int ie, int[] postorder, int[] inorder){\\n if(ps>pe || is>ie) return null;\\n int numroot = postorder[pe];\\n TreeNode root = new TreeNode(numroot);\\n\\n int index = is;\\n for(int i=is;i<=ie;i++){\\n if(inorder[i]==numroot){\\n index = i;\\n }\\n }\\n int rightlen = ie-index;\\n root.left = DFS(ps,pe-rightlen-1,is,index-1,postorder,inorder);\\n root.right = DFS(pe-rightlen,pe-1,index+1,ie,postorder,inorder);\\n return root;\\n\\n }\",\n \"private void bfs(Dungeon d, Site s) {\\n\\t\\t\\n\\t\\t// use a queue to do BFS, and initialize instance variables\\n\\t\\tQueue<Site> q = new LinkedList<Site>();\\n\\t\\tfor (int x = 0; x < d.size(); x++)\\n\\t\\t\\tfor (int y = 0; y < d.size(); y++)\\n\\t\\t\\t\\tdistTo[x][y] = INFINITY; \\n\\t\\tdistTo[s.getX()][s.getY()] = 0;\\n\\t\\tmarked[s.getX()][s.getY()] = true;\\n\\t\\t\\n\\t\\t// pop site from queue until it's empty\\n\\t\\tq.offer(s);\\n\\t\\twhile (!q.isEmpty()) {\\n\\t\\t\\t\\n\\t\\t\\t// pop the next site in the queue\\n\\t\\t\\tSite v = q.poll(); \\t \\n\\t\\t\\tint x = v.getX();\\n\\t\\t\\tint y = v.getY();\\n\\n\\t\\t\\t// 4 adjacent sites\\n\\t\\t\\tSite east = new Site(x + 1, y);\\n\\t\\t\\tSite west = new Site(x - 1, y);\\n\\t\\t\\tSite north = new Site(x, y - 1);\\n\\t\\t\\tSite south = new Site(x, y + 1);\\n\\n\\t\\t\\t// BFS the rest of the dungeon\\n\\t\\t\\tif (d.isLegalMove(v, east) && !marked[east.getX()][east.getY()]) {\\n\\t\\t\\t\\tedgeTo[east.getX()][east.getY()] = v;\\n\\t\\t\\t\\tdistTo[east.getX()][east.getY()] = distTo[x][y] + 1;\\n\\t\\t\\t\\tmarked[east.getX()][east.getY()] = true;\\n\\t\\t\\t\\tq.offer(east);\\n\\t\\t\\t}\\n\\t\\t\\tif (d.isLegalMove(v, west) && !marked[west.getX()][west.getY()]) {\\n\\t\\t\\t\\tedgeTo[west.getX()][west.getY()] = v;\\n\\t\\t\\t\\tdistTo[west.getX()][west.getY()] = distTo[x][y] + 1;\\n\\t\\t\\t\\tmarked[west.getX()][west.getY()] = true;\\n\\t\\t\\t\\tq.offer(west);\\n\\t\\t\\t}\\n\\t\\t\\tif (d.isLegalMove(v, north) && !marked[north.getX()][north.getY()]) {\\n\\t\\t\\t\\tedgeTo[north.getX()][north.getY()] = v;\\n\\t\\t\\t\\tdistTo[north.getX()][north.getY()] = distTo[x][y] + 1;\\n\\t\\t\\t\\tmarked[north.getX()][north.getY()] = true;\\n\\t\\t\\t\\tq.offer(north);\\n\\t\\t\\t}\\n\\t\\t\\tif (d.isLegalMove(v, south) && !marked[south.getX()][south.getY()]) {\\n\\t\\t\\t\\tedgeTo[south.getX()][south.getY()] = v;\\n\\t\\t\\t\\tdistTo[south.getX()][south.getY()] = distTo[x][y] + 1;\\n\\t\\t\\t\\tmarked[south.getX()][south.getY()] = true;\\n\\t\\t\\t\\tq.offer(south);\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t}\",\n \"static int BFS(int mat[][], Point src,\\n\\t\\t\\t\\t\\t\\t\\tPoint dest)\\n{\\n\\t// check source and destination cell\\n\\t// of the matrix have value 1\\n\\tif (mat[src.x][src.y] != 1 ||\\n\\t\\tmat[dest.x][dest.y] != 1)\\n\\t\\treturn -1;\\n\\n\\tboolean [][]visited = new boolean[ROW][COL];\\n\\t\\n\\t// Mark the source cell as visited\\n\\tvisited[src.x][src.y] = true;\\n\\n\\t// Create a queue for BFS\\n\\tQueue<queueNode> q = new LinkedList<>();\\n\\t\\n\\t// Distance of source cell is 0\\n\\tqueueNode s = new queueNode(src, 0);\\n\\tq.add(s); // Enqueue source cell\\n\\n\\t// Do a BFS starting from source cell\\n\\twhile (!q.isEmpty())\\n\\t{\\n\\t\\tqueueNode curr = q.peek();\\n\\t\\tPoint pt = curr.pt;\\n\\n\\t\\t// If we have reached the destination cell,\\n\\t\\t// we are done\\n\\t\\tif (pt.x == dest.x && pt.y == dest.y)\\n\\t\\t\\treturn curr.dist;\\n\\n\\t\\t// Otherwise dequeue the front cell\\n\\t\\t// in the queue and enqueue\\n\\t\\t// its adjacent cells\\n\\t\\tq.remove();\\n\\n\\t\\tfor (int i = 0; i < 4; i++)\\n\\t\\t{\\n\\t\\t\\tint row = pt.x + rowNum[i];\\n\\t\\t\\tint col = pt.y + colNum[i];\\n\\t\\t\\t\\n\\t\\t\\t// if adjacent cell is valid, has path\\n\\t\\t\\t// and not visited yet, enqueue it.\\n\\t\\t\\tif (isValid(row, col) &&\\n\\t\\t\\t\\t\\tmat[row][col] == 1 &&\\n\\t\\t\\t\\t\\t!visited[row][col])\\n\\t\\t\\t{\\n\\t\\t\\t\\t// mark cell as visited and enqueue it\\n\\t\\t\\t\\tvisited[row][col] = true;\\n\\t\\t\\t\\tqueueNode Adjcell = new queueNode\\n\\t\\t\\t\\t\\t\\t\\t(new Point(row, col),\\n\\t\\t\\t\\t\\t\\t\\t\\tcurr.dist + 1 );\\n\\t\\t\\t\\tq.add(Adjcell);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// Return -1 if destination cannot be reached\\n\\treturn -1;\\n}\",\n \"public static Vector<int []> BFS(int[] startPosition,int[] unexploreNode, mapNode[][] nodes){\\n\\t\\t\\r\\n\\t\\tVector<int []> shortestPath;\\r\\n\\t\\t\\r\\n\\t\\t//initial all nodes' status to UN-visited\\r\\n\\t\\tfor(int i = 0; i < nodes.length; i++)\\r\\n\\t\\t{\\r\\n\\t\\t\\tfor(int j = 0; j < nodes[i].length;j++)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tnodes[i][j].setTotDistance(999999999);//set the initial distance to INF\\r\\n\\t\\t\\t\\tnodes[i][j].gridPosition[0] = i;//save current node x position\\r\\n\\t\\t\\t\\tnodes[i][j].gridPosition[1] = j;//save current node y position\\r\\n\\t\\t\\t\\tnodes[i][j].setNodeVistied(false);//set all nodes are not visited yet\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\t//create start node and add it into the execution queue\\r\\n\\t\\tmapNode tempNode = new mapNode();\\r\\n\\t\\ttempNode = nodes[startPosition[0]][startPosition[1]];\\r\\n\\t\\tVector<mapNode> tempQueue = new Vector<mapNode>();\\r\\n\\t\\ttempQueue.add(tempNode);\\r\\n\\t\\t//main loop: check all nodes on the map\\r\\n\\t\\twhile(tempQueue.size() != 0)\\r\\n\\t\\t{\\r\\n\\t\\t\\t//create four nearby nodes\\r\\n\\t\\t\\tmapNode tempTopNode = new mapNode();\\r\\n\\t\\t\\tmapNode tempBottomNode = new mapNode();\\r\\n\\t\\t\\tmapNode tempLeftNode = new mapNode();\\r\\n\\t\\t\\tmapNode tempRightNode = new mapNode();\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t//update Top node information from original nodes matrix\\r\\n\\t\\t\\tif(tempQueue.get(0).topNode != null)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\ttempTopNode = nodes[tempQueue.get(0).topNode.gridPosition[0]][tempQueue.get(0).topNode.gridPosition[1]];\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\ttempTopNode = null;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//update Bottom node information from original nodes matrix\\r\\n\\t\\t\\tif(tempQueue.get(0).bottomNode != null)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\ttempBottomNode = nodes[tempQueue.get(0).bottomNode.gridPosition[0]][tempQueue.get(0).bottomNode.gridPosition[1]];\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\ttempBottomNode = null;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//update Left node information from original nodes matrix\\r\\n\\t\\t\\tif(tempQueue.get(0).leftNode != null)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\ttempLeftNode = nodes[tempQueue.get(0).leftNode.gridPosition[0]][tempQueue.get(0).leftNode.gridPosition[1]];\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\ttempLeftNode = null;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//update Right node information from original nodes matrix\\r\\n\\t\\t\\tif(tempQueue.get(0).rightNode != null)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\ttempRightNode = nodes[tempQueue.get(0).rightNode.gridPosition[0]][tempQueue.get(0).rightNode.gridPosition[1]];\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\ttempRightNode = null;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t//start re-calculate distance of each node\\r\\n\\t\\t\\t//check the top node and update new distance\\r\\n\\t\\t\\tif(tempTopNode != null)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tif(tempTopNode.getNodeVisited() == false && tempTopNode.getOwnElevation() != 999999999 && tempTopNode.getStatus() != Status.EXPLORED )\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tVector<int[]> tempPath = new Vector<int[]>();\\r\\n\\t\\t\\t\\t\\t//record the path\\r\\n\\t\\t\\t\\t\\tfor(int m = 0; m < tempQueue.get(0).getTotPath().size(); m++)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tint[] tempXY = new int[2];\\r\\n\\t\\t\\t\\t\\t\\ttempXY = tempQueue.get(0).getTotPath().get(m);\\r\\n\\t\\t\\t\\t\\t\\ttempPath.add(tempXY);\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t//check new node to see if exists in path\\r\\n\\t\\t\\t\\t\\tif(checkPositionInPath(tempPath, tempQueue.get(0).gridPosition[0], tempQueue.get(0).gridPosition[1]) == false)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tint[] tempXY2 = new int[2];\\r\\n\\t\\t\\t\\t\\t\\ttempXY2 = tempQueue.get(0).gridPosition;\\r\\n\\t\\t\\t\\t\\t\\ttempPath.add(tempXY2);\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t//assign new path to the node\\r\\n\\t\\t\\t\\t\\ttempTopNode.setTotPath(tempPath);\\r\\n\\t\\t\\t\\t\\t//update data back to original matrix\\r\\n\\t\\t\\t\\t\\ttempTopNode.setStatus(Status.EXPLORED);\\r\\n\\t\\t\\t\\t\\tnodes[tempTopNode.gridPosition[0]][tempTopNode.gridPosition[1]] = tempTopNode;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif(tempTopNode.gridPosition[0] == unexploreNode[0] && tempTopNode.gridPosition[1] == unexploreNode[1]){\\r\\n\\t\\t\\t\\t\\t//print out the end node\\r\\n\\t\\t\\t\\t\\t//print out the total distance between two points\\r\\n\\t\\t\\t\\t\\t//print out the total number node of path\\r\\n\\t\\t\\t\\t\\t//System.out.println(\\\"End Point: \\\"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[0]+1)+\\\" \\\"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[1]+1));\\r\\n\\t\\t\\t\\t\\t//System.out.println(\\\"Total Distance: \\\"+nodes[unexploreNode[0]][unexploreNode[1]].getTotDistance());\\r\\n\\t\\t\\t\\t\\t//System.out.println(\\\"Total number of nodes: \\\"+nodes[unexploreNode[0]][unexploreNode[1]].getTotPath().size());\\r\\n\\t\\t\\t\\t\\tshortestPath = nodes[unexploreNode[0]][unexploreNode[1]].getTotPath();\\r\\n\\t\\t\\t\\t\\tshortestPath.add(unexploreNode);\\r\\n\\t\\t\\t\\t\\treturn shortestPath;\\t\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif(nodes[tempTopNode.gridPosition[0]][tempTopNode.gridPosition[1]].getNodeVisited()== false && checkNodeInQueue(tempQueue, tempTopNode.gridPosition[0], tempTopNode.gridPosition[1]) == false && tempTopNode.getOwnElevation() != 999999999)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t//check un-visited nodes and add new node into execution queue\\r\\n\\t\\t\\t\\t\\ttempQueue.add(tempTopNode);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//check the bottom node and update new distance\\r\\n\\t\\t\\tif(tempBottomNode != null)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tif(tempBottomNode.getNodeVisited() == false && tempBottomNode.getOwnElevation() != 999999999 && tempBottomNode.getStatus() != Status.EXPLORED)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tVector<int[]> tempPath = new Vector<int[]>();\\r\\n\\t\\t\\t\\t\\t//record the path\\r\\n\\t\\t\\t\\t\\tfor(int m = 0; m < tempQueue.get(0).getTotPath().size(); m++)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tint[] tempXY = new int[2];\\r\\n\\t\\t\\t\\t\\t\\ttempXY = tempQueue.get(0).getTotPath().get(m);\\r\\n\\t\\t\\t\\t\\t\\ttempPath.add(tempXY);\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t//check new node to see if it exists in path\\r\\n\\t\\t\\t\\t\\tif(checkPositionInPath(tempPath, tempQueue.get(0).gridPosition[0], tempQueue.get(0).gridPosition[1]) == false)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tint[] tempXY2 = new int[2];\\r\\n\\t\\t\\t\\t\\t\\ttempXY2 = tempQueue.get(0).gridPosition;\\r\\n\\t\\t\\t\\t\\t\\ttempPath.add(tempXY2);\\r\\n\\t\\t\\t\\t\\t}\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t//assign new path to the node\\r\\n\\t\\t\\t\\t\\ttempBottomNode.setTotPath(tempPath);\\r\\n\\t\\t\\t\\t\\ttempBottomNode.setStatus(Status.EXPLORED);\\r\\n\\t\\t\\t\\t\\t//update data back to original matrix\\r\\n\\t\\t\\t\\t\\tnodes[tempQueue.get(0).bottomNode.gridPosition[0]][tempQueue.get(0).bottomNode.gridPosition[1]] = tempBottomNode;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tif(tempBottomNode.gridPosition[0] == unexploreNode[0] && tempBottomNode.gridPosition[1] == unexploreNode[1]){\\r\\n\\t\\t\\t\\t\\t//System.out.println(\\\"End Point: \\\"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[0]+1)+\\\" \\\"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[1]+1));\\r\\n\\t\\t\\t\\t\\t//System.out.println(\\\"Total Distance: \\\"+nodes[unexploreNode[0]][unexploreNode[1]].getTotDistance());\\r\\n\\t\\t\\t\\t\\t//System.out.println(\\\"Total number of nodes: \\\"+nodes[unexploreNode[0]][unexploreNode[1]].getTotPath().size());\\r\\n\\t\\t\\t\\t\\tshortestPath = nodes[unexploreNode[0]][unexploreNode[1]].getTotPath();\\r\\n\\t\\t\\t\\t\\tshortestPath.add(unexploreNode);\\r\\n\\t\\t\\t\\t\\treturn shortestPath;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif(nodes[tempBottomNode.gridPosition[0]][tempBottomNode.gridPosition[1]].getNodeVisited()== false && checkNodeInQueue(tempQueue, tempBottomNode.gridPosition[0], tempBottomNode.gridPosition[1]) == false && tempBottomNode.getOwnElevation() != 999999999)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t//check un-visited nodes and add new node into execution queue\\r\\n\\t\\t\\t\\t\\ttempQueue.add(tempBottomNode);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//check the left node and update new distance\\r\\n\\t\\t\\tif(tempLeftNode != null)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tif(tempLeftNode.getNodeVisited() == false && tempLeftNode.getOwnElevation() != 999999999 && tempLeftNode.getStatus() != Status.EXPLORED)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tVector<int[]> tempPath = new Vector<int[]>();\\r\\n\\t\\t\\t\\t\\t//record the path\\r\\n\\t\\t\\t\\t\\tfor(int m = 0; m < tempQueue.get(0).getTotPath().size(); m++)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tint[] tempXY = new int[2];\\r\\n\\t\\t\\t\\t\\t\\ttempXY = tempQueue.get(0).getTotPath().get(m);\\r\\n\\t\\t\\t\\t\\t\\ttempPath.add(tempXY);\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t//check new node to see if it exists in path\\r\\n\\t\\t\\t\\t\\tif(checkPositionInPath(tempPath, tempQueue.get(0).gridPosition[0], tempQueue.get(0).gridPosition[1]) == false)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tint[] tempXY2 = new int[2];\\r\\n\\t\\t\\t\\t\\t\\ttempXY2 = tempQueue.get(0).gridPosition;\\r\\n\\t\\t\\t\\t\\t\\ttempPath.add(tempXY2);\\r\\n\\t\\t\\t\\t\\t}\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t//assign new path to the node\\r\\n\\t\\t\\t\\t\\ttempLeftNode.setTotPath(tempPath);\\r\\n\\t\\t\\t\\t\\ttempLeftNode.setStatus(Status.EXPLORED);\\r\\n\\t\\t\\t\\t\\t//update data back to original matrix\\r\\n\\t\\t\\t\\t\\tnodes[tempQueue.get(0).leftNode.gridPosition[0]][tempQueue.get(0).leftNode.gridPosition[1]] = tempLeftNode;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tif(tempLeftNode.gridPosition[0] == unexploreNode[0] && tempLeftNode.gridPosition[1] == unexploreNode[1]){\\r\\n\\t\\t\\t\\t\\t//System.out.println(\\\"End Point: \\\"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[0]+1)+\\\" \\\"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[1]+1));\\r\\n\\t\\t\\t\\t\\t//System.out.println(\\\"Total Distance: \\\"+nodes[unexploreNode[0]][unexploreNode[1]].getTotDistance());\\r\\n\\t\\t\\t\\t\\t//System.out.println(\\\"Total number of nodes: \\\"+nodes[unexploreNode[0]][unexploreNode[1]].getTotPath().size());\\r\\n\\t\\t\\t\\t\\tshortestPath = nodes[unexploreNode[0]][unexploreNode[1]].getTotPath();\\r\\n\\t\\t\\t\\t\\tshortestPath.add(unexploreNode);\\r\\n\\t\\t\\t\\t\\treturn shortestPath;\\t\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif(nodes[tempLeftNode.gridPosition[0]][tempLeftNode.gridPosition[1]].getNodeVisited()== false && checkNodeInQueue(tempQueue, tempLeftNode.gridPosition[0], tempLeftNode.gridPosition[1]) == false && tempLeftNode.getOwnElevation() != 999999999)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t//check un-visited nodes and add new node into execution queue\\r\\n\\t\\t\\t\\t\\ttempQueue.add(tempLeftNode);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//check the right node and update new distance\\r\\n\\t\\t\\tif(tempRightNode != null)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tif(tempRightNode.getNodeVisited() == false && tempRightNode.getOwnElevation() != 999999999 && tempRightNode.getStatus() != Status.EXPLORED)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tVector<int[]> tempPath = new Vector<int[]>();\\r\\n\\t\\t\\t\\t\\t//record the path\\r\\n\\t\\t\\t\\t\\tfor(int m = 0; m < tempQueue.get(0).getTotPath().size(); m++)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tint[] tempXY = new int[2];\\r\\n\\t\\t\\t\\t\\t\\ttempXY = tempQueue.get(0).getTotPath().get(m);\\r\\n\\t\\t\\t\\t\\t\\ttempPath.add(tempXY);\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t//check to see if new node existed in path\\r\\n\\t\\t\\t\\t\\tif(checkPositionInPath(tempPath, tempQueue.get(0).gridPosition[0], tempQueue.get(0).gridPosition[1]) == false)\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tint[] tempXY2 = new int[2];\\r\\n\\t\\t\\t\\t\\t\\ttempXY2 = tempQueue.get(0).gridPosition;\\r\\n\\t\\t\\t\\t\\t\\ttempPath.add(tempXY2);\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t//assign new path to the node\\r\\n\\t\\t\\t\\t\\ttempRightNode.setTotPath(tempPath);\\r\\n\\t\\t\\t\\t\\ttempRightNode.setStatus(Status.EXPLORED);\\r\\n\\t\\t\\t\\t\\t//update data back to original matrix\\r\\n\\t\\t\\t\\t\\tnodes[tempQueue.get(0).rightNode.gridPosition[0]][tempQueue.get(0).rightNode.gridPosition[1]] = tempRightNode;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tif(tempRightNode.gridPosition[0] == unexploreNode[0] && tempRightNode.gridPosition[1] == unexploreNode[1]){\\r\\n\\t\\t\\t\\t\\t//System.out.println(\\\"End Point: \\\"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[0]+1)+\\\" \\\"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[1]+1));\\r\\n\\t\\t\\t\\t\\t//System.out.println(\\\"Total Distance: \\\"+nodes[unexploreNode[0]][unexploreNode[1]].getTotDistance());\\r\\n\\t\\t\\t\\t\\t//System.out.println(\\\"Total number of nodes: \\\"+nodes[unexploreNode[0]][unexploreNode[1]].getTotPath().size());\\r\\n\\t\\t\\t\\t\\tshortestPath = nodes[unexploreNode[0]][unexploreNode[1]].getTotPath();\\r\\n\\t\\t\\t\\t\\tshortestPath.add(unexploreNode);\\r\\n\\t\\t\\t\\t\\treturn shortestPath;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif(nodes[tempRightNode.gridPosition[0]][tempRightNode.gridPosition[1]].getNodeVisited()== false && checkNodeInQueue(tempQueue, tempRightNode.gridPosition[0], tempRightNode.gridPosition[1]) == false && tempRightNode.getOwnElevation() != 999999999)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t//check un-visited nodes and add new node into execution queue\\r\\n\\t\\t\\t\\t\\ttempQueue.add(tempRightNode);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t//set current node to visited node and\\r\\n\\t\\t\\t//remove current node from execution queue\\r\\n\\t\\t\\ttempQueue.get(0).setNodeVistied(true);\\r\\n\\t\\t\\tnodes[tempQueue.get(0).gridPosition[0]][tempQueue.get(0).gridPosition[1]].setNodeVistied(true);\\r\\n\\t\\t\\ttempQueue.remove(0);\\t\\r\\n\\t\\t}\\r\\n\\t\\t//print out the end node\\r\\n\\t\\t//print out the total distance between two points\\r\\n\\t\\t//print out the total number node of path\\r\\n\\t\\tSystem.out.println(\\\"End 5 Point: \\\"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[0]+1)+\\\" \\\"+(nodes[unexploreNode[0]][unexploreNode[1]].gridPosition[1]+1));\\r\\n\\t\\tSystem.out.println(\\\"Total Distance: \\\"+nodes[unexploreNode[0]][unexploreNode[1]].getTotDistance());\\r\\n\\t\\tSystem.out.println(\\\"Total number of nodes: \\\"+nodes[unexploreNode[0]][unexploreNode[1]].getTotPath().size());\\r\\n\\t\\tshortestPath = nodes[unexploreNode[0]][unexploreNode[1]].getTotPath();\\r\\n\\t\\tshortestPath.add(unexploreNode);\\r\\n\\t\\treturn shortestPath;\\t\\t\\r\\n\\t}\",\n \"@Override\\n public void backtrack() {\\n if (!stack.isEmpty()) {\\n int index = (Integer) stack.pop();\\n\\n if (index > arr.length) {//popping the insert function unneeded push\\n insert((Integer) stack.pop());\\n stack.pop();\\n }\\n if (index < arr.length) {//popping the delete function unneeded push\\n delete(index);\\n stack.pop();\\n stack.pop();\\n }\\n System.out.println(\\\"backtracking performed\\\");\\n }\\n }\",\n \"public static void bfs(int a, int b) {\\n\\t\\t\\r\\n\\t\\tQueue<Node> q = new LinkedList<>();\\r\\n\\t\\t\\r\\n\\t\\tq.add(new Node(a,b));\\r\\n\\t\\t\\r\\n\\t\\twhile(!q.isEmpty()) {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tNode n = q.remove();\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tint x = n.x;\\r\\n\\t\\t\\tint y = n.y;\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tif(x+1 <= N && map[x+1][y] > map[x][y]) {\\r\\n\\t\\t\\t\\tif(visited[x+1][y] != 1) {\\r\\n\\t\\t\\t\\t\\tq.add(new Node(x+1,y));\\r\\n\\t\\t\\t\\t\\tvisited[x+1][y] = cnt;\\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\\tif(x-1 > 0 && map[x-1][y] > map[x][y]) {\\r\\n\\t\\t\\t\\tif(visited[x-1][y] != 1) {\\r\\n\\t\\t\\t\\t\\tq.add(new Node(x-1,y));\\r\\n\\t\\t\\t\\t\\tvisited[x-1][y] = cnt;\\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\\tif(y-1 > 0 && map[x][y-1] > map[x][y]) {\\r\\n\\t\\t\\t\\tif(visited[x][y-1] != 1) {\\r\\n\\t\\t\\t\\t\\tq.add(new Node(x,y-1));\\r\\n\\t\\t\\t\\t\\tvisited[x][y-1] = cnt;\\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\\tif(y+1 <=N && map[x][y+1] > map[x][y]) {\\r\\n\\t\\t\\t\\tif(visited[x][y+1] != 1) {\\r\\n\\t\\t\\t\\t\\tq.add(new Node(x,y+1));\\r\\n\\t\\t\\t\\t\\tvisited[x][y+1] = cnt;\\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\\t\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t}\",\n \"int DFS(int i, int j) {\\n if (dp[i][j] != 0)\\n return dp[i][j];\\n\\n int steps = 0;\\n int trial = 0;\\n if (i < dp.length - 1 && matrix[i][j] < matrix[i+1][j]) {\\n trial = DFS(i + 1, j);\\n if (trial > steps)\\n steps = trial;\\n }\\n if (i > 0 && matrix[i][j] < matrix[i-1][j]) {\\n trial = DFS(i - 1, j);\\n if (trial > steps)\\n steps = trial;\\n }\\n if (j < dp[0].length - 1 && matrix[i][j] < matrix[i][j+1]) {\\n trial = DFS(i, j + 1);\\n if (trial > steps)\\n steps = trial;\\n }\\n if (j > 0 && matrix[i][j] < matrix[i][j-1]) {\\n trial = DFS(i, j - 1);\\n if (trial > steps)\\n steps = trial;\\n }\\n\\n dp[i][j] = steps + 1;\\n return dp[i][j];\\n }\",\n \"public Vector<PuzzleState> aStarSearch() {\\r\\n System.out.println(\\\"Starting A*\\\");\\r\\n long startTime = (new Date()).getTime();\\r\\n Vector<PuzzleState> solution = new Vector<PuzzleState>();\\r\\n HashSet<PuzzleState> closedList = new HashSet<PuzzleState>();\\r\\n PriorityQueue<PuzzleState> openList = new PriorityQueue<PuzzleState>();\\r\\n \\r\\n PuzzleState searchState = state.copy();\\r\\n searchState.prevState = null;\\r\\n searchState.depth = 0;\\r\\n openList.add(searchState);\\r\\n\\r\\n while (!openList.isEmpty() && !isGoal(searchState)) {\\r\\n searchState = openList.poll();\\r\\n if (!closedList.contains(searchState)) {\\r\\n closedList.add(searchState);\\r\\n Vector<PuzzleState> nextStates = possibleNextStates(searchState);\\r\\n for (PuzzleState s : nextStates)\\r\\n s.depth = searchState.depth + 1;\\r\\n openList.addAll(nextStates);\\r\\n }\\r\\n }\\r\\n \\r\\n // If the goal has been reached, construct the solution\\r\\n if (isGoal(searchState)) {\\r\\n for (PuzzleState s = searchState; s.prevState != null; s = s.prevState) {\\r\\n solution.add(s);\\r\\n }\\r\\n Collections.reverse(solution);\\r\\n }\\r\\n \\r\\n long endTime = (new Date()).getTime();\\r\\n System.out.println(\\\"A* search ended after \\\" + (endTime - startTime) + \\\" ms\\\");\\r\\n //for (PuzzleState s : solution)\\r\\n // System.out.println(s);\\r\\n return solution;\\r\\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 DSAQueue depthFirstSearch(String start)\\n\\t{\\n\\t\\tif(!vertices.isEmpty())\\n\\t\\t{\\n\\t\\t\\tDSAQueue queue = new DSAQueue();\\n\\t\\t\\tDSAGraphVertex vx = getVertex(start); //vertex to start on (root)\\n\\t\\t\\tDSAStack visited = new DSAStack();\\t//creates empty stack\\n\\n\\t\\t\\tclear(); //sets all vertices as not visited\\n\\t\\t\\tvx.setVisited(); // Marks root as visited\\n\\t\\t\\tqueue.enqueue(vx); //start point\\n\\n\\t\\t\\tdfs(vx, visited, queue); //begin recursion\\n\\n\\t\\t\\treturn queue;\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tthrow new NoSuchElementException(\\\"List is empty\\\");\\n\\t\\t}\\n\\t}\",\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 boolean search(String word) {\\n return dfs(word, 0, root);\\n}\",\n \"private List<Integer> depthFirstSearch(String sequence) {\\r\\n LinkedList<Integer> stack = new LinkedList<Integer>();\\r\\n LinkedList<Integer> wordPos = new LinkedList<Integer>();\\r\\n List<Integer> neighbors = null;\\r\\n //string pos counter\\r\\n int c = 0;\\r\\n int index = -1;\\r\\n //find starting pos\\r\\n for (int i = 0; i < squareDimension * squareDimension; i++) {\\r\\n if (sequence.toUpperCase().startsWith(this.elementAtPos(i))) {\\r\\n this.clearMarks();\\r\\n wordPos.clear();\\r\\n stack.clear();\\r\\n //depth-first search\\r\\n stack.push(i);\\r\\n togglePosMark(i);\\r\\n wordPos = (LinkedList<Integer>) \\r\\n dfsRecursive(stack, sequence.substring(\\r\\n elementAtPos(i).length(), sequence.length())\\r\\n .toUpperCase(), elementAtPos(i).length(), \\r\\n i, sequence.length());\\r\\n if (wordPos.size() != 0) {\\r\\n return wordPos;\\r\\n }\\r\\n }\\r\\n }\\r\\n //no result so return empty list\\r\\n return new LinkedList<Integer>();\\r\\n }\",\n \"public static void main(String[] args) {\\n TreeNode root = new TreeNode(20, null, null);\\n TreeNode lvl2Node1 = insertTreeNode(true, 10, root);\\n TreeNode lvl2Node2 = insertTreeNode(false, 1, root);\\n TreeNode lvl3Node1 = insertTreeNode(true, 25, lvl2Node1);\\n TreeNode lvl3Node2 = insertTreeNode(false, 26, lvl2Node1);\\n TreeNode lvl3Node3 = insertTreeNode(true, 32, lvl2Node2);\\n TreeNode lvl3Node4 = insertTreeNode(false, 37, lvl2Node2);\\n insertTreeNode(true, 5, lvl3Node1);\\n insertTreeNode(false, 6, lvl3Node2);\\n insertTreeNode(false, 8, lvl3Node3);\\n insertTreeNode(true, 10, lvl3Node4);\\n\\n\\n breadthFirstSearchPrintTree(root);\\n\\n }\",\n \"public static Stack<Integer> topologicalKosarajuDFSRecursive(ArrayList<ArrayList<Integer>> adj,int u,Stack<Integer> stack,boolean[] visited){\\r\\n visited[u]=true;\\r\\n for(int i:adj.get(u))\\r\\n if(!visited[u])\\r\\n topologicalKosarajuDFSRecursive(adj,i,stack,visited);\\r\\n stack.push(u);\\r\\n return stack;\\r\\n }\",\n \"public static void BFS(char[][] board, int y, int x){\\n \\tint[] offsetX = {-1,0,1,0};\\n \\tint[] offsetY = {0, -1, 0, 1};\\n \\tQueue<pair> que = new LinkedList<pair>();\\n \\tque.add(new pair(x,y));\\n \\twhile(!que.isEmpty()){\\n \\t\\tpair p = que.poll();\\n \\t \\tif (board[p.y][p.x] == 'D'){\\n\\t continue;\\n \\t \\t}\\n \\t\\t//System.out.println(p.x);\\n \\t\\t//System.out.println(p.y);\\n \\t \\tboard[p.y][p.x] = 'D';\\t \\t\\n \\t \\tfor(int i = 0; i < offsetX.length; i++){\\n \\t \\t\\tif(p.x + offsetX[i] >= 0 &&p.x+offsetX[i] < board[0].length&& p.y + offsetY[i] >= 0 &&p.y+offsetY[i] < board.length\\n \\t \\t\\t\\t\\t&& board[p.y+offsetY[i]][p.x+offsetX[i]] == 'O'){\\n \\t \\t\\t\\tque.add(new pair(p.x+offsetX[i], p.y+offsetY[i]));\\n \\t \\t\\t}\\n \\t \\t}\\n \\t}\\n \\n }\",\n \"private Cell breadthFirstSearch(WorldMap worldMap, Cell startCell, CELLTYPE goalType, Hashtable<Cell, Cell> prev) {\\n\\n\\t\\t// Using markedSet to avoid re-checking already visited nodes\\n\\t\\tHashSet<Cell> markedSet = new HashSet<Cell>();\\n\\t\\tLinkedList<Cell> queue = new LinkedList<Cell>();\\n\\n\\t\\tmarkedSet.add(startCell);\\n\\t\\tqueue.add(startCell);\\n\\n\\t\\twhile (!queue.isEmpty()) {\\n\\t\\t\\tCell cell = queue.remove();\\n\\t\\t\\tif (cell.getCellType() == goalType)\\n\\t\\t\\t\\treturn cell;\\n\\t\\t\\tLinkedList<Cell> neighbors = generateSuccessors(worldMap, cell, goalType);\\n\\n\\t\\t\\t/*\\n\\t\\t\\t * If looking for unexplored, shuffle list. Since the neighbors are\\n\\t\\t\\t * always returned NESW, it's best to shuffle the list if ant wants\\n\\t\\t\\t * to explore a random portion of the map.\\n\\t\\t\\t */\\n\\t\\t\\tif (goalType == CELLTYPE.UNEXPLORED)\\n\\t\\t\\t\\tCollections.shuffle(neighbors, new Random(System.currentTimeMillis()));\\n\\n\\t\\t\\tfor (Cell neighbor : neighbors)\\n\\t\\t\\t\\tif (!markedSet.contains(neighbor)) {\\n\\t\\t\\t\\t\\tmarkedSet.add(neighbor);\\n\\t\\t\\t\\t\\tqueue.add(neighbor);\\n\\t\\t\\t\\t\\tprev.put(neighbor, cell);\\n\\t\\t\\t\\t}\\n\\t\\t}\\n\\t\\t// If reached here, goal type doesn't exist\\n\\t\\treturn null;\\n\\t}\",\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 \"public static int largestIslandChain(Scanner sc) {\\n int islands=sc.nextInt();\\r\\n boolean graph[][] = new boolean[islands][islands];\\r\\n\\r\\n //System.out.print(\\\"How many ziplines? \\\");\\r\\n int ziplines=sc.nextInt();\\r\\n\\r\\n for (int edge=0; edge<ziplines; edge++) {\\r\\n int from=sc.nextInt();\\r\\n int to=sc.nextInt();\\r\\n graph[from][to]=true;\\r\\n }\\r\\n\\r\\n\\r\\n /* Find the SCCs... */\\r\\n\\r\\n //Utility Data Structures\\r\\n Stack<Integer> stack = new Stack<Integer>(); \\r\\n\\r\\n\\r\\n //First DFS\\r\\n boolean[] visited01 = new boolean[islands];\\r\\n int exitTimeTicker=0;\\r\\n int[] exitTimes = new int[islands];\\r\\n int[] exitPoints = new int[islands];\\r\\n for (int island=0; island<islands; island++) {\\r\\n int source;\\r\\n if (!visited01[island])\\r\\n {\\r\\n visited01[island]=true;\\r\\n stack.push(island);\\r\\n source=island;\\r\\n\\r\\n int destination=0;\\r\\n while (!stack.isEmpty())\\r\\n {\\r\\n source=stack.peek();\\r\\n destination=0;\\r\\n while (destination<islands)\\r\\n {\\r\\n if (graph[source][destination] && !visited01[destination])\\r\\n {\\r\\n stack.push(destination);\\r\\n visited01[destination]=true;\\r\\n source=destination;\\r\\n destination=0;\\r\\n }\\r\\n else {\\r\\n destination++;\\r\\n }\\r\\n }\\r\\n exitTimes[stack.peek()]=exitTimeTicker;\\r\\n exitPoints[exitTimeTicker]=stack.peek();\\r\\n stack.pop();\\r\\n exitTimeTicker++;\\r\\n }\\r\\n }\\r\\n }\\r\\n\\r\\n\\r\\n boolean graphTransposeUsingExits[][] = new boolean[islands][islands];\\r\\n for (int i=0; i<islands; i++)\\r\\n {\\r\\n for (int j=0; j<islands; j++)\\r\\n {\\r\\n if (graph[i][j])\\r\\n graphTransposeUsingExits[exitTimes[j]][exitTimes[i]]=true;\\r\\n }\\r\\n }\\r\\n\\r\\n\\r\\n //Second DFS\\r\\n boolean[] visited02 = new boolean[islands];\\r\\n int[] numberOfSCC = new int[islands];\\r\\n int currSCCnum=0;\\r\\n for (int exitTime=islands-1; exitTime>=0; exitTime--)\\r\\n {\\r\\n if (!visited02[exitTime])\\r\\n {\\r\\n //entryPointToScc=exitTime;\\r\\n visited02[exitTime]=true;\\r\\n numberOfSCC[exitPoints[exitTime]]=++currSCCnum;\\r\\n stack.push(exitTime);\\r\\n int source=exitTime;\\r\\n while (!stack.isEmpty())\\r\\n {\\r\\n source=stack.peek();\\r\\n int destination=0;\\r\\n while (destination<islands)\\r\\n {\\r\\n if (graphTransposeUsingExits[source][destination] && !visited02[destination])\\r\\n {\\r\\n if (numberOfSCC[exitPoints[destination]]==0) {\\r\\n numberOfSCC[exitPoints[destination]]=currSCCnum;\\r\\n }\\r\\n stack.push(destination);\\r\\n visited02[destination]=true;\\r\\n source=destination;\\r\\n destination=0;\\r\\n }\\r\\n else {\\r\\n destination++;\\r\\n } \\r\\n }\\r\\n stack.pop();\\r\\n } \\r\\n }\\r\\n }\\r\\n\\r\\n\\r\\n int[] sizeOfSCCs = new int[currSCCnum];\\r\\n for (int i=0; i<islands; i++) {\\r\\n sizeOfSCCs[numberOfSCC[i]-1]++;\\r\\n }\\r\\n \\r\\n int sccsMax = Integer.MIN_VALUE;\\r\\n for(int i=0; i<sizeOfSCCs.length; ++i) {\\r\\n \\tif(sizeOfSCCs[i] > sccsMax) {\\r\\n \\t\\tsccsMax = sizeOfSCCs[i];\\r\\n \\t}\\r\\n }\\r\\n return sccsMax;\\r\\n \\r\\n // Java 8\\r\\n //return Arrays.stream(sizeOfSCCs).summaryStatistics().getMax();\\r\\n }\",\n \"private static void breadthFirstSearch(int source, ArrayList<ArrayList<Integer>> nodes) {\\n\\t\\tArrayList<ArrayList<Integer>> neighbours = nodes;\\n\\t\\tQueue<Integer> queue= new LinkedList<Integer>();\\n\\t\\t\\n\\t\\tboolean[] visited = new boolean[nodes.size()];\\n\\t\\t\\n\\t\\tqueue.add(source);\\n\\t\\tvisited[source]=true;\\n\\t\\t\\n\\t\\twhile(!queue.isEmpty()) {\\n\\t\\t\\tint k =queue.remove();\\n\\t\\t\\tSystem.out.println(k);\\n\\t\\t\\tfor(int p : nodes.get(k)) {\\n\\t\\t\\t\\tif(!visited[p]) {\\n\\t\\t\\t\\t\\tqueue.add(p);\\n\\t\\t\\t\\t\\tvisited[p]=true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"public boolean dfs_iterative_util(LinkedList<Integer>[] graph, boolean[] visited, int s){\\n Stack<Integer> fringe = new Stack<Integer>();\\n Set<Integer> currStack = new HashSet<Integer>();\\n \\n fringe.push(s);\\n currStack.add(s);\\n \\n while(!fringe.isEmpty()){\\n int curr = fringe.pop();\\n if(currStack.contains(curr))\\n return false;\\n visited[curr] = true;\\n currStack.add(curr);\\n if(graph[curr] != null){\\n Iterator<Integer> itr = graph[curr].iterator();\\n while(itr.hasNext()){\\n int n = itr.next();\\n \\n if(!visited[n]){\\n fringe.push(n);\\n }\\n }\\n currStack.remove(curr);\\n }\\n \\n }\\n \\n return true;\\n }\",\n \"void Graph::BFS(int s)\\n{\\n bool *visited = new bool[V];\\n for(int i = 0; i < V; i++)\\n visited[i] = false;\\n \\n // Create a queue for BFS\\n list<int> queue;\\n \\n // Mark the current node as visited and enqueue it\\n visited[s] = true;\\n queue.push_back(s);\\n \\n // 'i' will be used to get all adjacent vertices of a vertex\\n list<int>::iterator i;\\n \\n while(!queue.empty())\\n {\\n // Dequeue a vertex from queue and print it\\n s = queue.front();\\n cout << s << \\\" \\\";\\n queue.pop_front();\\n \\n // Get all adjacent vertices of the dequeued vertex s\\n // If a adjacent has not been visited, then mark it visited\\n // and enqueue it\\n for(i = adj[s].begin(); i != adj[s].end(); ++i)\\n {\\n if(!visited[*i])\\n {\\n visited[*i] = true;\\n queue.push_back(*i);\\n }\\n }\\n }\",\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 \"public static int runBFS(int[][]map, coordinate src1, coordinate src2){\\n\\t \\n boolean visited[][] = new boolean[dim][dim]; //visited boolean 2d array that is the same size as 2d map\\n coordinate visit1[][]=new coordinate[dim][dim]; // this is the one used to hold previous location\\n coordinate visit2[][]=new coordinate[dim][dim]; // this is the one used to hold previous location\\n\\t \\n\\t visit1[0][0]=new coordinate(0,0); //same as BFS\\n \\n\\t visit2[dim-1][dim-1] = new coordinate(dim-1,dim-1);\\n\\t //marked both the 0,0 and dim-1, dim-1 srcs as visited\\n\\t \\n\\t Queue<QueueNode> queue1 = new LinkedList<>(); //queue for src1\\n\\t Queue<QueueNode> queue2 = new LinkedList<>(); //queue for src2\\n\\t \\n\\t QueueNode sn1 = new QueueNode(src1, 0, src1); //src node 1 queue node\\n\\t QueueNode sn2 = new QueueNode(src2, 0, src2);\\n\\t \\n\\t ArrayList<coordinate> pathHold1 = new ArrayList<>(); //for first path\\n\\t ArrayList<coordinate> pathHold2 = new ArrayList<>(); //for second path \\n\\t \\n\\t visited[src1.x][src1.y] = true; //mark the start node as visited inside of the visited boolean 2d array for first src\\n\\t visited[src2.x][src2.y] = true; //mark the start node as visited inside of the visited boolean 2d array for second src\\n\\t \\n\\t System.out.println();\\n\\t \\n\\t queue1.add(sn1);\\n\\t queue2.add(sn2);\\n\\t //added the start nodes\\n\\t \\n\\t QueueNode current1 = null;\\n\\t QueueNode current2 = null;\\n\\t //to be used later to hold current node being looked at\\n\\t coordinate c1 = null;\\n\\t coordinate c2 = null;\\n\\t\\t//coordinates to be examined\\n\\t \\n\\t while(!queue1.isEmpty()&&!queue2.isEmpty()){\\n\\t //keep iterating so long as queues have items -- but if one becomes empty, check at each iteration\\n\\t\\t\\t//to avoid null pointer so we are not dequeuing from empty queue\\n int maxFringe = 0;\\n\\t\\t//use this to check max fringe at each time we add to either queue\\n if(queue1.size()>maxFringe || queue2.size()>0) {\\n \\t if(queue1.size()>maxFringe) {\\n \\t\\t maxFringe=queue1.size();\\n \\t }else {\\n \\t\\t maxFringe=queue2.size();\\n \\t }\\n }\\n\\t \\n\\t \\tif(!queue1.isEmpty()) { \\n\\t\\t\\t\\t//while first queue is not empty, pop\\n\\t \\t\\t current1 = queue1.peek(); // this is n\\n\\t c1 = current1.point;\\n\\t \\t\\t visited[c1.x][c1.y]=true; //mark this node as visited, will check neighbors later\\n\\t boolean inFringe = false;\\n\\t inFringe = compareFringe(c1, queue2); //see if intersect or not\\n\\t \\n\\t \\n\\t // compare current point to the queue2 fringe. If not in fringe\\n\\t if(inFringe) {\\n\\t \\t //we have found the duplicate \\n\\t \\t System.out.println(\\\"duplicate\\\");\\n\\t \\t intersect = c1;\\n\\t\\t System.out.println(\\\"Intersect is :\\\"+c1.x+\\\",\\\"+c1.y);\\n\\t\\t visit1[c1.x][c1.y]=current1.prev; //set prev node or where we came from\\n\\t\\t \\n\\t\\t System.out.println(\\\"We have reached our goal!\\\");\\n\\t\\t \\n\\t\\t if(current2 != null) {\\n\\t\\t\\t\\t\\t //so long as paths have values, add length and return\\n\\t\\t return current1.pathTotal+current2.pathTotal;\\n\\t\\t }else {\\n\\t\\t\\t\\t\\t //else return only one path \\n\\t\\t \\t return current1.pathTotal;\\n\\t\\t }\\n\\t }\\n\\t\\t\\t\\t//this is getting the neighbors, same as BFS\\n\\t \\n\\t int row1 = 0;\\n\\t int col1 = 0;\\n\\t \\n\\t for (int i = 0; i < 4; i++) { \\n\\t row1= c1.x + rowNum1[i]; \\n\\t col1 = c1.y + colNum1[i]; \\n\\t //grab neighbor of current\\n\\t if (cellValid(row1, col1) && map[row1][col1] == 1 && !visited[row1][col1]){ \\n\\t \\t \\n\\t // mark cell as visited and enqueue it \\n\\t visited[row1][col1] = true; //we visited the node so mark it\\n\\t visit1[row1][col1] = new coordinate(c1.x, c1.y); //set prev as current coord\\n\\n\\t QueueNode Adjcell = new QueueNode(new coordinate(row1, col1), current1.pathTotal + 1, new coordinate(row1-rowNum1[i], col1-colNum1[i])); \\n\\t queue1.add(Adjcell); //make it a queueNode to add to q1 for first path\\n\\t }else if(cellValid(row1, col1) && map[row1][col1] == 1 && (visited[row1][col1]&&visit2[row1][col1]!=null)){\\n\\t \\t // System.out.println(\\\"already visited\\\"+row1+\\\",\\\"+col1); \\n\\t\\t\\t\\t //check if already visited and valid (not off grid) and = 1 so we can take path -- \\n\\t\\t\\t\\t //if so, this means we found intersect\\n\\t\\t\\t\\t //make sure node has been visited in other path to guarantee it is intersect\\n\\t \\t intersect=new coordinate(row1,col1); //set intersect\\n\\t \\t visit1[intersect.x][intersect.y]=new coordinate(c1.x, c1.y); //set where we came from\\n\\t \\t //current1.pathTotal++;\\n\\t \\t printfin(visit1, visit2); //used to print final path -- set map\\n \\n int nodesExplored1 = 0;\\n int nodesExplored2 = 0;\\n for(coordinate coor : pathHold1){\\n nodesExplored1++;\\n }\\n for(coordinate coor : pathHold2){\\n nodesExplored2++;\\n }\\n\\t\\t\\t\\t \\n\\t\\t\\t\\t //get number of nodes expanded in each path, add together\\n\\n int fin = nodesExplored1+nodesExplored2; //this is final explored nodes in each path\\n System.out.println(\\\"Nodes explored: \\\" + fin);\\n \\n\\t \\t return pathsize; //return total pathsize\\n\\t \\t //break;\\n\\t }\\n\\t \\n\\t \\n\\t } \\n\\t //once all of the neighbors have been visited, dequeue from queue 1 in path 1\\n\\t queue1.remove(); \\n\\t pathHold1.add(c1); //add to explored\\n\\t \\n\\t }\\n\\t \\t//now to the same in path2 from (dim-1, dim-1) as src2\\n\\t \\tif(!queue2.isEmpty()) {\\n\\t \\t\\t\\n\\t \\t\\t current2 = queue2.peek(); // this is n\\n\\t c2 = current2.point;\\n\\t \\t\\t visited[c2.x][c2.y]=true;\\n\\t boolean inFringe = false;\\n\\t inFringe = compareFringe(c2, queue1);\\n\\t \\n\\t // compare current point to the queue2 fringe. If not in fringe\\n\\t if(inFringe) {\\n\\t \\t //we have found the duplicate \\n\\t \\t System.out.println(\\\"duplicate\\\");\\n\\t \\t intersect = c2;\\n\\t\\t // System.out.println(\\\"Intersect is :\\\"+c2.x+\\\",\\\"+c2.y);\\n\\t\\t visit2[c2.x][c2.y]=current2.prev;\\n\\t\\t \\n\\t\\t System.out.println(\\\"We have reached our goal!\\\");\\n\\t\\t \\n\\t\\t \\n\\t\\t if(current1 != null) {\\n\\t\\t\\t return current1.pathTotal+current2.pathTotal;\\n\\t\\t\\t }else {\\n\\t\\t\\t \\t return current2.pathTotal;\\n\\t\\t\\t }\\n\\t }\\n\\t \\n\\t \\t// get neighbors\\n\\t int row2 = 0;\\n\\t int col2 = 0;\\n\\t \\n\\t for (int i = 0; i < 4; i++) { \\n\\t row2= c2.x + rowNum2[i]; \\n\\t col2 = c2.y + colNum2[i]; \\n\\t \\n\\t \\n\\t if (cellValid(row2, col2) && map[row2][col2] == 1 && !visited[row2][col2]){ \\n\\t \\t \\n\\t // mark cell as visited and enqueue it \\n\\t visited[row2][col2] = true; \\n\\t visit2[row2][col2] = new coordinate(c2.x, c2.y);\\n\\n\\t QueueNode Adjcell2 = new QueueNode(new coordinate(row2, col2), current2.pathTotal + 1, new coordinate(row2-rowNum2[i], col2-colNum2[i])); \\n\\t queue2.add(Adjcell2);\\n\\t }else if(cellValid(row2, col2) && map[row2][col2] == 1 && (visited[row2][col2]&&visit1[row2][col2]!=null)){\\n\\t \\t \\n\\t \\t intersect=new coordinate(row2,col2);\\n\\t \\t \\n\\t \\t visit2[intersect.x][intersect.y]=new coordinate(c2.x, c2.y);\\n\\t \\n\\t \\n\\t printfin(visit1, visit2);\\n\\t int nodesExplored1 = 0;\\n int nodesExplored2 = 0;\\n for(coordinate coor : pathHold1){\\n nodesExplored1++;\\n }\\n for(coordinate coor : pathHold2){\\n nodesExplored2++;\\n }\\n\\n int fin = nodesExplored1+nodesExplored2;\\n System.out.println(\\\"Nodes explored: \\\" + fin);\\n\\t \\t return pathsize;\\n\\t \\t \\n\\t }\\n\\t \\n\\t } \\n\\t //once all of the neighbors have been visited, dequeue \\n\\t queue2.remove(); \\n\\t pathHold2.add(c2);\\n\\t \\t\\t\\n\\t \\t}\\n\\n\\t }\\n \\n int nodesExplored1 = 0;\\n int nodesExplored2 = 0;\\n for(coordinate coor : pathHold1){\\n nodesExplored1++;\\n }\\n for(coordinate coor : pathHold2){\\n nodesExplored2++;\\n }\\n\\n int fin = nodesExplored1+nodesExplored2;\\n System.out.println(\\\"Nodes explored: \\\" + fin);\\n\\t //if here, means no path was found\\n\\t return -1;\\n\\t \\n\\t }\",\n \"private boolean dfs(int[][] maze, boolean[][] visited, int[] start, int[] destination) {\\n\\t\\tif(Arrays.equals(start, destination)) return true;\\n\\t\\tint i = start[0];\\n\\t\\tint j = start[1];\\n\\t\\tif(visited[i][j])\\n\\t\\t\\treturn false;\\n\\t\\tvisited[i][j] = true;\\n\\t\\tBiPredicate<Integer, Integer> roll = (rowInc, colInc) -> {\\n\\t\\t\\tint ii = i, jj = j;\\n\\t\\t\\twhile(ii >= 0 && ii <= maze.length - 1 && jj >= 0 && jj <= maze[0].length - 1 && maze[ii][jj] != 1) {\\n\\t\\t\\t\\tii += rowInc;\\n\\t\\t\\t\\tjj += colInc;\\n\\t\\t\\t}\\n\\t\\t\\treturn dfs(maze, visited, new int[] {ii - rowInc, jj - colInc}, destination)\\n\\t\\t};\\n\\t\\tif(roll.test(1, 0)) return true;\\n\\t\\tif(roll.test(-1, 0)) return true;\\n\\t\\tif(roll.test(0, 1)) return true;\\n\\t\\tif(roll.test(0, -1)) return true;\\n\\t\\t\\n\\t\\treturn false;\\n\\t}\",\n \"public static void main(String[] args) {\\n Solution solution = new Solution();\\n TreeNode root = new TreeNode(1);\\n root.left = new TreeNode(2);\\n root.left.left = new TreeNode(6);\\n root.left.left.right = new TreeNode(10);\\n root.left.left.right.left = new TreeNode(-1);\\n root.left.right = new TreeNode(9);\\n\\n root.right = new TreeNode(3);\\n root.right.right = new TreeNode(5);\\n root.right.left = new TreeNode(4);\\n root.right.left.left = new TreeNode(7);\\n root.right.left.right = new TreeNode(8);\\n \\n solution.stackList(root);\\n for (int i = 0 ; i < solution.list.size(); i++) System.out.print(solution.list.get(i) + \\\" \\\");\\n }\",\n \"public Integer retrieveBF(Vertex vert, Stack<Integer> st)\\r\\n\\t{\\r\\n\\t\\tfor(int k = 0; k < vertices.size(); k++)\\r\\n\\t\\t{\\r\\n\\t\\t\\t/*for(int j = 0; j < vertices.get(k).getEdges().size(); j++)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tif (!vert.get.isTraversed())\\r\\n\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}*/\\r\\n\\t\\t\\t//else if(this.getEdge(i, k) != null && vertices.get(i).getEdge(k).isTraversed() == false);\\r\\n\\t\\t\\t//{\\r\\n\\t\\t\\t/*else */\\r\\n\\t\\t\\tif(vert.getEdge(k) != null && vert.getEdge(k).isTraversed() == false)\\r\\n\\t\\t\\t{\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tvert.getEdge(k).setTraversed();\\r\\n\\t\\t\\t\\tst.push(retrieveBF(vert.getEdge(k).getVertex(vert.getID()),st));\\r\\n\\t\\t\\t\\t//return st.push(retrieveBF(vert.getEdge(k).getVertex(vert.getID()),st));\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\treturn st.push(retrieveBF(vert,st));\\r\\n\\t\\t}\\r\\n\\t\\treturn st.pop();\\r\\n\\t}\",\n \"public Solution67() {\\n stack = new Stack<>();\\n min_stack = new Stack<>();\\n }\",\n \"public void breadthFirstTraversal() {\\n beginAnimation();\\n treeBreadthFirstTraversal();\\n stopAnimation();\\n\\n }\",\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 \"private static void solve2(Board bd) throws SolutionFoundException {\\n\\t\\tst = new StackImage();\\n\\n\\t\\tdepth ++;\\n\\n\\t\\tif(depth < -1) {\\n\\t\\t\\tbd.checkForSolution();\\n\\t\\t\\tthrow new SolutionFoundException();\\n\\t\\t}\\n\\n\\t\\tst.cnt = 0;\\n\\t\\tfor( st.r=0;st.r<bd.getBoard_size();++st.r) \\n\\t\\t\\tfor( st.c=0;st.c<bd.getBoard_size(); ++st.c) {\\n\\t\\t\\t\\tif(bd.getPossibilities(st.r, st.c) >= 1) {\\n\\n\\t\\t\\t\\t\\tfor(st.p=0;st.p<bd.getBoard_size();++st.p) {\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"Status check \\\" + st.r + \\\" \\\" + st.c + \\\" \\\" + st.p + \\\" \\\" + (bd.check(st.r, st.c, st.p)) + \\\" \\\" + (bd.verify(st.r,st.c,st.p)));\\n\\t\\t\\t\\t\\t\\tif(bd.check(st.r, st.c, st.p) && bd.verify(st.r,st.c,st.p)) {\\n\\t\\t\\t\\t\\t\\t\\tst.bi = bd.assign(st.r, st.c, st.p);\\n\\t\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"CHoice at \\\" + st.r + \\\" \\\" + st.c + \\\" \\\" + st.p);\\n\\t\\t\\t\\t\\t\\t\\tmoves.add( st );\\n\\t\\t\\t\\t\\t\\t\\tsolve2(bd);\\n\\t\\t\\t\\t\\t\\t\\tst = moves.removeLast();\\n\\t\\t\\t\\t\\t\\t\\tbd.restore(st.r,st.c,st.bi);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t++st.cnt;\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t} else if(bd.getPossibilities(st.r, st.c) == 0 && !bd.isOnlyOne(st.r, st.c)) {\\n\\t\\t\\t\\t\\treturn ;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\tif(st.cnt == 0) {\\n\\t\\t\\tbd.checkForSolution();\\n\\t\\t\\tthrow new SolutionFoundException();\\n\\t\\t}\\n\\t\\t--depth;\\t\\t\\n\\t\\tst = null;\\n\\t}\",\n \"void topologicalSort(){ \\n Stack<Integer> stack = new Stack<Integer>(); \\n \\n // Mark all the vertices as not visited \\n boolean visited[] = new boolean[V]; \\n for (int i = 0; i < V; i++) \\n visited[i] = false; \\n \\n // Call the recursive helper function to store Topological Sort starting from all vertices one by one \\n for (int i = 0; i < V; i++) \\n if (visited[i] == false) \\n topologicalSortUtil(i, visited, stack); \\n \\n // Print contents of stack \\n while (stack.empty()==false) \\n System.out.print(stack.pop() + \\\" \\\"); \\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.72871023","0.6768588","0.64710766","0.645953","0.63642484","0.6271256","0.6234236","0.61241555","0.60703397","0.60630256","0.60406446","0.5976431","0.59638447","0.59452784","0.58824754","0.587762","0.5842304","0.58212245","0.5818742","0.58040637","0.57685184","0.5757552","0.57408714","0.5737437","0.57289714","0.5679464","0.5675731","0.56706244","0.5670334","0.5657826","0.56460845","0.5622697","0.5612698","0.5602679","0.5597447","0.55909544","0.5581296","0.5574889","0.557181","0.55450356","0.553642","0.5530659","0.5528514","0.55124766","0.5508581","0.5507743","0.5504097","0.5468427","0.545758","0.54548335","0.54546463","0.54491156","0.5447812","0.54357725","0.54094183","0.5407714","0.5401342","0.53951544","0.5391398","0.5388478","0.536772","0.53668106","0.53638434","0.5362528","0.5352211","0.5349126","0.53451616","0.53425854","0.5338858","0.533815","0.533265","0.5329693","0.53206867","0.53204733","0.5318834","0.53168887","0.5314612","0.53068733","0.5304301","0.52911717","0.5290603","0.52881587","0.52844507","0.5283207","0.52717954","0.5267671","0.5260994","0.5259273","0.5255027","0.5254376","0.52414715","0.52293026","0.5225421","0.5205258","0.5202029","0.52015585","0.52012295","0.51988196","0.51968455","0.5195317","0.5192001"],"string":"[\n \"0.72871023\",\n \"0.6768588\",\n \"0.64710766\",\n \"0.645953\",\n \"0.63642484\",\n \"0.6271256\",\n \"0.6234236\",\n \"0.61241555\",\n \"0.60703397\",\n \"0.60630256\",\n \"0.60406446\",\n \"0.5976431\",\n \"0.59638447\",\n \"0.59452784\",\n \"0.58824754\",\n \"0.587762\",\n \"0.5842304\",\n \"0.58212245\",\n \"0.5818742\",\n \"0.58040637\",\n \"0.57685184\",\n \"0.5757552\",\n \"0.57408714\",\n \"0.5737437\",\n \"0.57289714\",\n \"0.5679464\",\n \"0.5675731\",\n \"0.56706244\",\n \"0.5670334\",\n \"0.5657826\",\n \"0.56460845\",\n \"0.5622697\",\n \"0.5612698\",\n \"0.5602679\",\n \"0.5597447\",\n \"0.55909544\",\n \"0.5581296\",\n \"0.5574889\",\n \"0.557181\",\n \"0.55450356\",\n \"0.553642\",\n \"0.5530659\",\n \"0.5528514\",\n \"0.55124766\",\n \"0.5508581\",\n \"0.5507743\",\n \"0.5504097\",\n \"0.5468427\",\n \"0.545758\",\n \"0.54548335\",\n \"0.54546463\",\n \"0.54491156\",\n \"0.5447812\",\n \"0.54357725\",\n \"0.54094183\",\n \"0.5407714\",\n \"0.5401342\",\n \"0.53951544\",\n \"0.5391398\",\n \"0.5388478\",\n \"0.536772\",\n \"0.53668106\",\n \"0.53638434\",\n \"0.5362528\",\n \"0.5352211\",\n \"0.5349126\",\n \"0.53451616\",\n \"0.53425854\",\n \"0.5338858\",\n \"0.533815\",\n \"0.533265\",\n \"0.5329693\",\n \"0.53206867\",\n \"0.53204733\",\n \"0.5318834\",\n \"0.53168887\",\n \"0.5314612\",\n \"0.53068733\",\n \"0.5304301\",\n \"0.52911717\",\n \"0.5290603\",\n \"0.52881587\",\n \"0.52844507\",\n \"0.5283207\",\n \"0.52717954\",\n \"0.5267671\",\n \"0.5260994\",\n \"0.5259273\",\n \"0.5255027\",\n \"0.5254376\",\n \"0.52414715\",\n \"0.52293026\",\n \"0.5225421\",\n \"0.5205258\",\n \"0.5202029\",\n \"0.52015585\",\n \"0.52012295\",\n \"0.51988196\",\n \"0.51968455\",\n \"0.5195317\",\n \"0.5192001\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":38185,"cells":{"query":{"kind":"string","value":"METHOD 9: DEPTHFIRST SEARCH WITH RECURSION This method solves the maze using depthfirst search (w/recursion),"},"document":{"kind":"string","value":"public static void dfsRecursion(gNode[] G, boolean[] visited, int[] path, int s){\n\t\tvisited[s] =true;\n\t\tfor(gNode t = G[s]; t!=null; t=t.dest){\n\t\t\tif(!visited[t.item]){\n\t\t\t\tpath[t.item]=s;\n\t\t\t\tdfsRecursion(G, visited, path, t.item);\n\t\t\t}\n\t\t}\t\n\t}"},"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 Stack<MazePoint> DepthFirstSearch(int row, int column)\n {\n //cMaze[row][column].wasVisited()\n if(cMaze[row][column].isExit())\n {\n sPath.push(cMaze[row][column]);\n //print out the path\n PrintPath(sPath, true);\n return sPath;\n }\n else\n {\n //when not visit\n if(!cMaze[row][column].wasVisited())\n {\n if(cMaze[row][column].hasItem())\n {\n String itemName = cMaze[row][column].pickUpItem();\n Item item = new Item(itemName);\n //check if the item is in the hashmap\n if(availableItemsHashMap.get(item) != null)\n {\n inventoryList.insert(itemName);\n }\n else\n {\n cMaze[row][column].dropItem();\n }\n }\n //mark as vist\n cMaze[row][column].markVisited();\n //push into stack\n sPath.push(cMaze[row][column]);\n }\n //determine where to traverse next (S, E, W, N)\n //recursively\n if(cMaze[row+1][column].canBeNavigated() || cMaze[row+1][column].isExit())// or (cMaze[row+1][column] != VISITED_MARKER && cMaze[row+1][column] != 'W')\n {\n return DepthFirstSearch(row+1, column);\n }\n else if(cMaze[row][column+1].canBeNavigated() || cMaze[row][column+1].isExit())\n {\n return DepthFirstSearch(row, column+1);\n }\n else if(cMaze[row][column-1].canBeNavigated() || cMaze[row][column-1].isExit())\n {\n return DepthFirstSearch(row, column-1);\n }\n else if(cMaze[row-1][column].canBeNavigated() || cMaze[row-1][column].isExit())\n {\n return DepthFirstSearch(row-1, column);\n }\n //no where could go, then return\n else\n {\n sPath.pop();\n if(sPath.isEmpty())\n {\n //print nothing found\n PrintPath(sPath, false);\n return sPath;\n }\n MazePoint mp = sPath.top();\n int mpRow = mp.getRow();\n int mpColumn = mp.getColumn();\n return DepthFirstSearch(mpRow, mpColumn);\n }\n }\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 }","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 }","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 }","public static boolean Traversal_DFS(int row, int col, int[][] maze)\r\n {\n if (isASolution(row, col))\r\n {\r\n maze[row][col] = 3;\r\n return true;\r\n }\r\n\r\n // otherwise, mark the cell as visited and process its children.\r\n maze[row][col] = 2;\r\n if (canMove(row,col-1, maze) && Traversal_DFS(row,col-1, maze))\r\n {\r\n \t// mark this as success.\r\n maze[row][col-1] = 3;\r\n return true;\r\n }\r\n if (canMove(row,col+1, maze))\r\n {\r\n // move right\r\n if (Traversal_DFS(row,col+1, maze))\r\n {\r\n \tmaze[row][col+1] = 3;\r\n return true;\r\n }\r\n }\r\n if (canMove(row-1,col, maze))\r\n {\r\n // move up\r\n if (Traversal_DFS(row-1,col, maze))\r\n {\r\n \tmaze[row-1][col] = 3;\r\n return true;\r\n }\r\n }\r\n if (canMove(row+1,col, maze))\r\n {\r\n // move down\r\n if (Traversal_DFS(row+1,col, maze))\r\n {\r\n \tmaze[row+1][col] = 3;\r\n return true;\r\n }\r\n }\r\n // Failure, unmark the cell and return false\r\n maze[row][col] = 0;\r\n return false;\r\n }","private void DepthFirstSearch(Node current){\n helperDFS( current );\n }","public Stack<Integer> dfs(Maze tmp) {\n \n int tmpx = tmp.positionX();\n int tmpy = tmp.positionY();\n Stack<Integer> s = new Stack<Integer>();\n while (!tmp.gameOver()) {\n choosedirection(s, tmp);\n while (!s.isEmpty() && !tmp.gameOver()) {\n if (s.peek() == 0) {\n if (tmp.right()) {\n s.push(1);\n } else if (tmp.up()) {\n s.push(0);\n } else if (tmp.left()) {\n s.push(3);\n } else {\n this.stackpop(s, tmp);\n }\n } else if (s.peek() == 1) {\n if (tmp.down()) {\n s.push(2);\n } else if (tmp.right()) {\n s.push(1);\n } else if (tmp.up()) {\n s.push(0);\n } else {\n this.stackpop(s, tmp);\n }\n } else if (s.peek() == 2) {\n if (tmp.left()) {\n s.push(3);\n } else if (tmp.down()) {\n s.push(2);\n } else if (tmp.right()) {\n s.push(1);\n } else {\n this.stackpop(s, tmp);\n }\n } else if (s.peek() == 3) {\n if (tmp.up()) {\n s.push(0);\n } else if (tmp.left()) {\n s.push(3);\n } else if (tmp.down()) {\n s.push(2);\n } else {\n this.stackpop(s, tmp);\n }\n\n }\n\n }\n }\n\n Stack<Integer> stack = new Stack<Integer>();\n while (!s.isEmpty()) {\n stack.push(s.pop());\n }\n\n tmp.setLocation(tmpx, tmpy);\n return stack;\n\n }","public static String findPath(Maze maze) {\n \tint m = maze.getNumRows();\n \tint n = maze.getNumCols();\n\n \t//define a visited matrix\n \tboolean[][] visited = new boolean[m][n];\n \tsetvisited(false, visited);\n\n \t//define a direction matrix\n \tint[][] dir_mtr = new int[m][n];\n \tinit_dir(-1,dir_mtr);\n\n\n\n \t//define a stack\n \tStack<MazeLocation> s;\n \ts = new StackRefBased<MazeLocation>();\n\n \tMazeLocation entry = maze.getEntry();\n \tMazeLocation exit = maze.getExit();\n \t// System.out.println(entry.toString());\n \ts.push(entry);\n\n\t\tMazeLocation temp; \n\t\tString result = \"\"; \t\n\n\t\ttry{\n\t\t\tint x,y;\n\n\n\t\t\twhile(!s.isEmpty()){\n\n \t\ttemp = s.peek();\n \t\tx = temp.getRow();\n \t\ty = temp.getCol();\n \t\tdir_mtr[x][y]+=1;\n\n \t\tif(temp.toString().equals(exit.toString())){\n \t\t\tSystem.out.println(\"find the path\");\n \t\t\tbreak;\n\n \t\t}\n\n \t\tif(dir_mtr[x][y]==0){ \n \t\t\t//checking the up direction\n \t\t\tif(x-1>=0 && !maze.isWall(x-1,y) && !visited[x-1][y]){\n \t\t\t\tMazeLocation testnode = new MazeLocation(x-1,y,maze.isWall(x-1,y));\n \t\t\t\tvisited[x-1][y] = true;\n \t\t\t\ts.push(testnode);\n\n \t\t\t}\n\n \t\t}else if(dir_mtr[x][y]==1){\n \t\t\t//checking the left direction\n \t\t\tif(y-1>=0 && !maze.isWall(x,y-1) && !visited[x][y-1]){\n \t\t\t\tMazeLocation testnode = new MazeLocation(x,y-1,maze.isWall(x,y-1));\n \t\t\t\tvisited[x][y-1] = true;\n \t\t\t\ts.push(testnode);\n\n \t\t\t}\n\n \t\t}else if(dir_mtr[x][y]==2){\n \t\t\t//checking the down direction\n \t\t\tif(x+1<m && !maze.isWall(x+1,y) && !visited[x+1][y]){\n \t\t\t\tMazeLocation testnode = new MazeLocation(x+1,y,maze.isWall(x+1,y));\n \t\t\t\tvisited[x+1][y] = true;\n \t\t\t\ts.push(testnode);\n\n \t\t\t}\n \t\t\t\n \t\t}else if(dir_mtr[x][y]==3){\n \t\t\t//checking the right direction\n \t\t\tif(y+1<n && !maze.isWall(x,y+1) && !visited[x][y+1]){\n \t\t\t\tMazeLocation testnode = new MazeLocation(x,y+1,maze.isWall(x,y+1));\n \t\t\t\tvisited[x][y+1] = true;\n \t\t\t\ts.push(testnode);\n\n \t\t\t}\n \t\t\t\n \t\t}else{\n \t\t\tvisited[x][y] = false;\n \t\t\ts.pop();\n \t\t}\n\n\n\n \t\t\n \t}\n\n \t//reverse the stack\n \tStack<MazeLocation> reverse;\n \treverse = new StackRefBased<MazeLocation>();\n \twhile(!s.isEmpty()){\n\t\t\t reverse.push(s.pop()); \t//push the node to the reverse stack\n\t\t\t }\n\n\n \t//if the stack is not empty, then we find the path\n\t\tif(!reverse.isEmpty()){\n\t\t\tresult = reverse.toString();\n\n\t\t}\n\n \t\n \n\n\t\t}\n\t\tcatch (StackEmptyException see) {\n \n }\n\n\n \treturn result;\n\n\n }","private Boolean depthFirstSearch(HashMap<String, Boolean> visited, String node) {\n \tif (visited.get(node)) {\n \t\t// This can actually never happen\n \t\tif (Flags.semant_debug) {\n \t\t\tSystem.out.println(\"Node: \" + node + \" visited twice\");\n \t\t}\n \t\tsemantError(nameToClass.get(node)).println(\"Class \" + node + \", or its ancestors, is invloved in a cycle\");\n \t\treturn false;\n \t}\n \tvisited.put(node, true);\n \tif (adjacencyList.get(node) == null) {\n \t\treturn true;\n \t}\n \tfor (String child : adjacencyList.get(node)) {\n \t\tif (Flags.semant_debug) {\n \t\t\tSystem.out.println(\"Traversing \" + node + \" --> \" + child);\n \t\t}\n \t\tdepthFirstSearch(visited, child);\n \t}\n \treturn true;\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 }","private boolean dfs(int[][] maze, boolean[][] visited, int[] start, int[] destination) {\n\t\tif(Arrays.equals(start, destination)) return true;\n\t\tint i = start[0];\n\t\tint j = start[1];\n\t\tif(visited[i][j])\n\t\t\treturn false;\n\t\tvisited[i][j] = true;\n\t\tBiPredicate<Integer, Integer> roll = (rowInc, colInc) -> {\n\t\t\tint ii = i, jj = j;\n\t\t\twhile(ii >= 0 && ii <= maze.length - 1 && jj >= 0 && jj <= maze[0].length - 1 && maze[ii][jj] != 1) {\n\t\t\t\tii += rowInc;\n\t\t\t\tjj += colInc;\n\t\t\t}\n\t\t\treturn dfs(maze, visited, new int[] {ii - rowInc, jj - colInc}, destination)\n\t\t};\n\t\tif(roll.test(1, 0)) return true;\n\t\tif(roll.test(-1, 0)) return true;\n\t\tif(roll.test(0, 1)) return true;\n\t\tif(roll.test(0, -1)) return true;\n\t\t\n\t\treturn false;\n\t}","public boolean solve(final int startRow, final int startCol) {\r\n\r\n // TODO\r\n // validate arguments: ensure position is within maze area\r\n\r\n if(mazeData [startRow][startCol] == WALL) {\r\n throw new IllegalArgumentException(\" we're in a wall buddy\");\r\n }\r\n else if (startRow > mazeData.length-1 || startCol > mazeData.length-1 ){\r\n throw new IllegalArgumentException(\" we're out of bounds \");\r\n }\r\n\r\n\r\n\r\n\r\n\r\n // TODO create local class for row/col positions\r\n class Position {\r\n private int row;\r\n private int col;\r\n\r\n // TODO add instance variables\r\n public Position(final int row, final int col) {\r\n this.row = row;\r\n this.col= col;\r\n }\r\n\r\n\r\n\r\n // TODO toString if desired\r\n public String toString() {\r\n return \"Row: \" + this.row + \"Column: \"+ this.col;\r\n }\r\n\r\n\r\n }\r\n\r\n\r\n // define the stack (work queue)\r\n final var queue = Collections.asLifoQueue(new LinkedList<Position>());\r\n //Queue<Position> queue = new LinkedList<Position>(); // EXTRA CREDIT PART 2\r\n\r\n // put starting position in queue\r\n queue.add(new Position(startRow, startCol));\r\n\r\n\r\n\r\n\r\n\r\n // look for a way out of the maze from the current position\r\n while (!queue.isEmpty()) {\r\n\r\n\r\n final Position pos = queue.remove();\r\n\r\n // if this is a wall, then ignore this position (and skip the remaining steps of the loop body)\r\n if (mazeData [pos.row][pos.col]== WALL){\r\n continue; // jumps to next spot in que , by skipping to next iteration of loops by saying continue\r\n }\r\n\r\n\r\n // otherwise mark this place as visited (drop a breadcrumb)\r\n if (mazeData [pos.row][pos.col]== VISITED){\r\n continue; // jumps to next spot in que , by skipping to next iteration of loops by saying continue\r\n }\r\n else if(mazeData [pos.row][pos.col]== EMPTY){\r\n mazeData [pos.row][pos.col]= VISITED;\r\n }\r\n\r\n // if we're already on the perimeter, then this is a way out and we should return success (true) right away\r\n if (pos.row == 0|| pos.col ==0 || pos.row == mazeData.length-1 || pos.col == mazeData[0].length-1){\r\n mazeData[startRow][startCol] = START;\r\n return true;\r\n }\r\n\r\n queue.add(new Position(pos.row+1,pos.col ));//down\r\n queue.add(new Position(pos.row-1,pos.col ));//up\r\n queue.add(new Position(pos.row,pos.col-1 )); //left\r\n queue.add(new Position(pos.row, pos.col + 1)); //right\r\n\r\n\r\n }//end of while\r\n\r\n\r\n\r\n // mark starting position\r\n mazeData[startRow][startCol] = START;\r\n\r\n // if we've looked everywhere but haven't gotten out, then return failure (false)\r\n return false;\r\n }","private void solve(int x, int y, boolean draw) {\n \t\t// these are the walls of the maze, maze solver should not go beyond\n \t\t// walls\n \t\t// if (x == 0 || y == 0 || x == N + 1 || y == N + 1) {\n \t\t// return;\n \t\t// }\n \n \t\t// if we have already visited this position\n \t\t// or if deep levels of the recursion have found the target\n \t\tif (foundTarget || visited[x][y])\n \t\t\treturn;\n \n \t\t// this position is new, mark it as visited\n \t\tvisited[x][y] = true;\n \n \t\tif (draw) {\n \t\t\t// Draw a blue dot to show we have been here\n \t\t\tStdDraw.setPenColor(StdDraw.BLUE);\n \t\t\tStdDraw.filledCircle(x + 0.5, y + 0.5, 0.25);\n \t\t\tStdDraw.show(SOLVER_SPEED);\n \t\t}\n \n \t\t// if we have reached the maze solve target\n \t\tif (x == target.x && y == target.y) {\n \t\t\tfoundTarget = true;\n \t\t}\n \n \t\t// Try go another place\n \t\tif (!north[x][y])\n \t\t\tsolve(x, y + 1, draw);\n \t\tif (!east[x][y])\n \t\t\tsolve(x + 1, y, draw);\n \t\tif (!south[x][y])\n \t\t\tsolve(x, y - 1, draw);\n \t\tif (!west[x][y])\n \t\t\tsolve(x - 1, y, draw);\n \n \t\tif (foundTarget)\n \t\t\treturn;\n \n \t\tif (draw) {\n \t\t\t// Draw a grey dot to show we have backtracked\n \t\t\tStdDraw.setPenColor(StdDraw.GRAY);\n \t\t\tStdDraw.filledCircle(x + 0.5, y + 0.5, 0.25);\n \t\t\tStdDraw.show(SOLVER_SPEED);\n \t\t}\n \t}","private static boolean dfs(char[][] board, int r, int c) {\n if (r == 9)\n return true;\n\n // return here and line 57 is because you will backtrack to the very beginning once a solution is found\n if (c == 9)\n return dfs(board, r + 1, 0);\n\n if (board[r][c] == '.') {\n // try each number\n for (int k = 1; k <= 9; k++) {\n board[r][c] = Character.forDigit(k, 10);\n if (isValid(board, r, c)) {\n // when find the solution should return true to avoid any more backtrack search\n if (dfs(board, r, c + 1))\n return true;\n }\n board[r][c] = '.';\n }\n } else {\n return dfs(board, r, c + 1);\n }\n return false;\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}","public boolean solveMaze(int x, int y, String direction){\n\n if (maze[x][y] == \"E\"){\n solved = true;\n return solved;\n\n }\n\n if(!(maze[x][y].equals(\"S\") || maze[x][y].equals(\"E\"))){\n maze[x][y] = \"X\";\n }\n\n if(direction != \"up\" && isReachable(x+1, y)){\n solveMaze(x + 1, y, \"down\");\n if(solved) return true;\n }\n if(direction != \"left\" && isReachable(x, y+ 1)){\n solveMaze(x, y + 1, \"right\");\n if(solved) return true;\n }\n if(direction != \"down\" && isReachable(x-1, y)){\n solveMaze(x - 1 , y, \"up\");\n if(solved) return true;\n }\n if(direction != \"right\" && isReachable(x, y -1)){\n solveMaze(x, y - 1, \"left\");\n if(solved) return true;\n }\n\n //If cannot move, do backtracking\n if(!solved) {\n maze[x][y] = \" \";\n return false;\n }\n\n return false;\n }","public abstract List<Direction> searchForCheese(Maze maze);","public String depthFirstSearch( AnyType start_vertex ) throws VertexException {\n \n StringBuffer buffer = new StringBuffer();\n \n // ----------------------------\n // TODO: Add your code here\n // ----------------------------\n ConstantTimeStack<Vertex<AnyType>> stack = new ConstantTimeStack<Vertex<AnyType>>();\n boolean exists = false;\n Vertex<AnyType> S = new Vertex<AnyType>(start_vertex);\n int counter = 0;\n //loop through to set each vertex to not visited\n for( int i = 0; i < vertex_adjacency_list.size(); i++){\n vertex_adjacency_list.get(i).setVisited(-1);\n //if find the start vertex then set index position to counter\n if(vertex_adjacency_list.get(i).compareTo(S) == 0){\n exists = true;\n vertex_adjacency_list.get(i).setVisited(counter);\n counter = i;\n }\n }\n //if doesn't exist then through exception\n if(exists == false){\n throw new VertexException(\"Start Vertex does not exist\");\n }\n //if it does exist then push start node onto stack, set visited \n else if(exists){\n stack.push(vertex_adjacency_list.get(counter));\n vertex_adjacency_list.get(counter).setVisited(1);\n Vertex <AnyType> e = vertex_adjacency_list.get(counter);\n counter = 2;\n int n = e.numberOfAdjacentVertices();\n try{\n \n while(true){\n //loop through e's adjacent vertices \n for (n = e.numberOfAdjacentVertices()-1; n >=0 ; n--){\n //if the adacent vertex has not been visited\n if(e.getAdjacentVertex(n).hasBeenVisited()==false){\n //change e to adjacent vertex and push onto stack\n e = e.getAdjacentVertex(n);\n stack.push(e);\n //set e as visited at counter\n e.setVisited(counter);\n counter++;\n //reset n to e's num of vertices\n n = e.numberOfAdjacentVertices();\n }\n //if it has been visited and it's the first node in list\n //then pop it off the stack and then set e to new top\n //set n to new num of vertices\n else if(e.getAdjacentVertex(n).hasBeenVisited() && n == 0){\n stack.pop();\n e = stack.peek();\n n = e.numberOfAdjacentVertices();\n }\n }\n }\n }catch(EmptyStackException m){\n }\n }\n //loop through the list and print each with when it was visited\n for(int k = 0; k< vertex_adjacency_list.size(); k++){\n buffer.append(vertex_adjacency_list.get(k) + \":\" + vertex_adjacency_list.get(k).getVisited()+ \"\\n\");\n }\n \n return buffer.toString();\n \n }","private void depthFirstSearch(DirectedGraph graph, int vertex) {\r\n \r\n visited[vertex] = true;\r\n inRecursionStack[vertex] = true;\r\n \r\n for(int adjacentVertex: graph.adjacentVertices(vertex)) {\r\n if(inRecursionStack[adjacentVertex]) {\r\n throw new IllegalArgumentException(String.format(\"Graph contains a cycle: no topological sort possible: %s -> %s\", vertex, adjacentVertex));\r\n }\r\n \r\n if(!visited[adjacentVertex]) {\r\n depthFirstSearch(graph, adjacentVertex);\r\n }\r\n }\r\n\r\n reversePostOrder.push(vertex); \r\n inRecursionStack[vertex] = false;\r\n }","public char[][] mazeTraversal(char[][] maze, int x, int y){\n\n // Using the try catch to find the 'end' of the maze. Or when the maze hits the bounds of the char array.\n try{\n // this will test all valid moves. If they are valid, it replaces the current position with 'x' and moves\n // the cursor 'A' to the next position. Prints maze and recursively calls mazeTraversal.\n\n // if down is a valid move\n if(maze[x][y-1] == '.'){\n maze[x][y] = 'x';\n maze[x][y-1] = 'A';\n print(maze);\n mazeTraversal(maze, x, y-1);\n }\n\n // if right is a valid move\n if(maze[x+1][y] == '.'){\n maze[x][y] = 'x';\n maze[x+1][y] = 'A';\n print(maze);\n mazeTraversal(maze, x+1, y);\n }\n\n // if up is a valid move\n if(maze[x][y+1] == '.'){\n maze[x][y] = 'x';\n maze[x][y+1] = 'A';\n print(maze);\n mazeTraversal(maze, x, y+1);\n }\n\n // if left is a valid move\n if(maze[x-1][y] == '.'){\n maze[x][y] = 'x';\n maze[x-1][y] = 'A';\n print(maze);\n mazeTraversal(maze, x-1, y);\n }\n\n // if no moves are available or the cursor approaches a dead end, the current position is replaced with '0'\n // and prints the maze again. This will remove the cursor until a next valid move is available.\n // Returns the current maze.\n maze[x][y] = '0';\n print(maze);\n return maze;\n }catch(Exception e){\n // If the maze approaches the 'end' of the maze, or approaches a point where the cursor is at the bounds,\n // then the catch will initiate. Assuming the maze is done. Ending the program.\n System.out.println(\"The Maze is traversed. Thank you for playing.\");\n maze[x][y] = 'x';\n print(maze);\n System.exit(0);\n }\n return maze;\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 }","private static void DepthFirstSearch(int i, ArrayList<ArrayList<Integer>> nodes, boolean[] visited) {\n\t\tif(nodes == null) return;\n\t\tvisited[i] = true;\n\t\tSystem.out.println(i);\n\t\tfor(int p : nodes.get(i)) {\n\t\t\tif(!visited[p]) {\n\t\t\t\tDepthFirstSearch(p,nodes, visited);\n\t\t\t}\n\t\t}\n\t\t\t\n\t}","public void depthFirstSearch(){\n\t\tStack<TreeNode<T>> nodeStack = new Stack<TreeNode<T>>();\n\n\t\tif(root!=null){\n\t\t\tnodeStack.push(root);\n\t\t\tSystem.out.println(root.data);\n\t\t\tTreeNode<T> topNode = root;\n\t\t\twhile(!nodeStack.isEmpty()){\n\t\t\t\tif(topNode.left!=null){\n\t\t\t\t\tnodeStack.push(topNode.left);\t\t\t\t\t\n\t\t\t\t\tSystem.out.println(topNode.data);\n\t\t\t\t\ttopNode = topNode.left;\n\t\t\t\t} else if(topNode.right!=null){\n\t\t\t\t\tnodeStack.push(topNode.right);\n\t\t\t\t\tSystem.out.println(topNode.data);\n\t\t\t\t\ttopNode = topNode.right;\n\t\t\t\t} else{\n\t\t\t\t\ttry{\n\t\t\t\t\t\tnodeStack.pop();\n\t\t\t\t\t}catch(Exception ex){\n\t\t\t\t\t\tex.printStackTrace();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\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 }","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}","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 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 }","private void depthFirstSearch(Node sourceNode, Node destinationNode, String path, HashSet<Character> visited) {\n // Base condition is that if the node is looping then return\n if(visited.contains(sourceNode.charId)) {\n return;\n }\n\n // Mark the sourceNode as visited\n visited.add(sourceNode.charId);\n String newPath = sourceNode.charId.toString();\n path += \"->\" + newPath;\n\n // If the source node reached destination or the node has no children\n if(sourceNode == destinationNode || sourceNode.adjacent.isEmpty()) {\n paths.add(path);\n return;\n }\n\n // Search all of it's children's children until reach destination\n for(Node children : sourceNode.adjacent) {\n depthFirstSearch(children, destinationNode, path, visited);\n }\n }","public int depthFirstSearch(List<Integer>[] adj){\n int connected = 0;\n for(int i = 0; i < n; i++){\n if(visited[i] == false){\n connected ++;\n dfsRecursive(adj, i);\n }\n }\n return connected;\n }","public static void depthFirstSearchRecursive(ArrayList<Node> graph) {\n\t\tSystem.out.println(\"DFS Recursive:\");\n\t\tif(graph.size() == 0) {\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tGraphUtils.cleanGraph(graph);\n\t\t\n\t\tfor(Node node : graph) {\n\t\t\tdfsRecursive(node);\n\t\t}\n\t\t\n\t\tSystem.out.println();\n\t\t\n\t\tGraphUtils.cleanGraph(graph);\n\t}","public void depthFirstSearch(int current) throws Exception {\n /* Mark the current vertex visited. */\n visited[current] = true;\n\n discoveryOrder[discoverIndex++] = current;\n /* Examine each vertex adjacent to the current vertex */\n Iterator<Edge> itr = graph.edgeIterator(current);\n while (itr.hasNext()) {\n int neighbor = itr.next().getDest();\n /* Process a neighbor that has not been visited */\n if (!visited[neighbor]) {\n /* Insert (current, neighbor) into the depthFirst search tree. */\n parent[neighbor] = current;\n /* Recursively apply the algorithm starting at neighbor. */\n depthFirstSearch(neighbor);\n }\n }\n\n /* Mark current finished. */\n finishOrder[finishIndex++] = current;\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 }","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 }","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 }","public void buildTreeRecursive(SearchNode currentNode, MapGrid map, int depthLimit) {\n\t\tsize = depthLimit;\n\t\tif (currentNode.getX() == 0 && currentNode.getY() == 0) {\n\t\t\thomeFound = true; \t// If home has not been found within depthLimit, then the reverse stack path is fastest route\n\t\t\treturn; \t\t\t// If the current Node is the home node, don't build deeper\n\t\t} else if (currentNode.getDepth() + 1 > depthLimit) {\t// if currentNode is at the depth limit, don't build further\n\t\t\treturn;\n\t\t} else {\n\t\t\tint currentDepth = currentNode.getDepth();\n\t\t\tGridCell currentCell = getCellFromNodeXY(currentNode, map);\n\t\t\tList<Character> walls = currentCell.directionsWithoutWalls();\n\t\t\tfor (char dir : walls) {\t\t\t\t\n\t\t\t\tGridCell adjacentCell = map.getCellInDir(currentCell, dir);\n\t\t\t\tSearchNode adjacentNode = createNodeFromCell(adjacentCell);\n\t\t\t\tadjacentNode.setDepth(currentDepth + 1);\n\t\t\t\tcurrentNode.addNodeInDir(adjacentNode, dir);\t\t\t\t\n\t\t\t\tbuildTreeRecursive(adjacentNode, map, depthLimit);\n\t\t\t}\n\t\t}\n\t\t\n\t\t\n\t}","public DSAQueue depthFirstSearch(String start)\n\t{\n\t\tif(!vertices.isEmpty())\n\t\t{\n\t\t\tDSAQueue queue = new DSAQueue();\n\t\t\tDSAGraphVertex vx = getVertex(start); //vertex to start on (root)\n\t\t\tDSAStack visited = new DSAStack();\t//creates empty stack\n\n\t\t\tclear(); //sets all vertices as not visited\n\t\t\tvx.setVisited(); // Marks root as visited\n\t\t\tqueue.enqueue(vx); //start point\n\n\t\t\tdfs(vx, visited, queue); //begin recursion\n\n\t\t\treturn queue;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthrow new NoSuchElementException(\"List is empty\");\n\t\t}\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}","private void doDepthFirstTraverse(int start, boolean[] visited, List<Edge> path) {\n visited[start] = true;\n\n for (int i: this.heads[start]) {\n if (!visited[i]) {\n path.add(new Edge(start, i));\n doDepthFirstTraverse(i, visited, path);\n }\n }\n }","private static int breadthFirstSearch(Vertex start) throws Queue.UnderflowException, Queue.EmptyException {\n boolean visited[] = new boolean[48];\n //Keep a queue of vertecies and a queue of the depth of the verticies - they will be added to and poped from identically\n ListQueue<Vertex> queue = new ListQueue<Vertex>();\n ListQueue<Integer> numQueue = new ListQueue<Integer>();\n //Set the starting node as visited\n visited[start.index()] = true;\n queue.enqueue(start);\n numQueue.enqueue(new Integer(1));\n\n //Keep last\n int last = -1;\n //While the queue isnt empty\n while (!queue.isEmpty()) {\n //Pop off the top from both queues and mark as visited\n start = queue.dequeue();\n int current = numQueue.dequeue();\n visited[start.index] = true;\n //For all neigbors\n for (Vertex v : start.neighbors) {\n //If we havent visited it make sure to visit it\n if (visited[v.index()] == false) {\n //As we keep adding new nodes to visit keep track of the depth\n queue.enqueue(v);\n numQueue.enqueue(current + 1);\n }\n }\n //Keep track of the most recent depth before we pop it off (queue will be empty when we exit)\n last = current;\n }\n //Return the max of the depth\n return last;\n }","void testSearches(Tester t) {\n Vertex v1 = new Vertex(10, 10);\n Vertex v2 = new Vertex(10, 11);\n Vertex v3 = new Vertex(10, 12);\n\n Edge e1 = new Edge(v1, v2, 1);\n Edge e2 = new Edge(v2, v3, 1);\n\n IList<Vertex> map = new Cons<Vertex>(v1, new Cons<Vertex>(v2, new Cons<Vertex>(\n v3, new Empty<Vertex>())));\n\n Player player = new Player(map);\n DepthFirst dp = new DepthFirst(map);\n BreadthFirst bp = new BreadthFirst(map);\n\n t.checkExpect(player.current, v1);\n t.checkExpect(player.finished, false);\n\n t.checkExpect(bp.hasNext(), true);\n t.checkExpect(bp.next(), new Queue<Vertex>());\n\n t.checkExpect(dp.hasNext(), true);\n t.checkExpect(dp.next(), new Stack<Vertex>());\n\n t.checkExpect(player.move(true, e1), v2);\n\n t.checkExpect(player.current, v2);\n t.checkExpect(player.finished, false);\n\n t.checkExpect(bp.hasNext(), false);\n t.checkExpect(bp.next(), v3);\n\n t.checkExpect(dp.hasNext(), false);\n t.checkExpect(dp.next(), v3);\n\n t.checkExpect(player.move(true, e2), v3);\n\n player.finished = true;\n\n t.checkExpect(player.current, v3);\n t.checkExpect(player.finished, true);\n\n Queue<Vertex> q = new Queue<Vertex>(map);\n\n q.enqueue(new Vertex(5, 5));\n\n Deque<Vertex> dq = new Deque<Vertex>();\n dq.addAtHead(v1);\n dq.addAtTail(v2);\n dq.addAtTail(new Vertex(5, 5));\n\n\n t.checkExpect(q.isEmpty(), false);\n t.checkExpect(q.contents, dq);\n\n Stack<Vertex> stack = new Stack<Vertex>(map);\n\n t.checkExpect(stack.isEmpty(), false);\n dq.removeFromHead();\n t.checkExpect(stack.pop(), dq);\n\n t.checkExpect(dp.next(), v2);\n t.checkExpect(bp.hasNext(), true);\n\n }","private static boolean solution(int[][] arr, int[][] mazeTravel, int row, int column) {\n\n int size = arr.length;\n\n if (row < 0 || row >= size || column < 0 || column >= size || arr[row][column] == 0 || mazeTravel[row][column] == 1 ) {\n return false;\n }\n //Mark position as travelled\n mazeTravel[row][column] = 1;\n //Check if reached destination\n if(row== arr.length-1&&column== arr.length-1){\n return true;\n }\n //Top direction\n if (solution(arr, mazeTravel, row - 1, column) ) {\n return true;\n }\n //Right direction\n if (solution(arr, mazeTravel, row, column + 1)) {\n return true;\n }\n\n //Left direction\n if (solution(arr, mazeTravel, row, column - 1)) {\n return true;\n }\n\n //Down direction\n if (solution(arr, mazeTravel, row + 1, column)) {\n return true;\n }\n //Above 4 Conditions not satisfied\n return false;\n }","int DFS(int i, int j) {\n if (dp[i][j] != 0)\n return dp[i][j];\n\n int steps = 0;\n int trial = 0;\n if (i < dp.length - 1 && matrix[i][j] < matrix[i+1][j]) {\n trial = DFS(i + 1, j);\n if (trial > steps)\n steps = trial;\n }\n if (i > 0 && matrix[i][j] < matrix[i-1][j]) {\n trial = DFS(i - 1, j);\n if (trial > steps)\n steps = trial;\n }\n if (j < dp[0].length - 1 && matrix[i][j] < matrix[i][j+1]) {\n trial = DFS(i, j + 1);\n if (trial > steps)\n steps = trial;\n }\n if (j > 0 && matrix[i][j] < matrix[i][j-1]) {\n trial = DFS(i, j - 1);\n if (trial > steps)\n steps = trial;\n }\n\n dp[i][j] = steps + 1;\n return dp[i][j];\n }","public void search(ArrayList<String> path, TrieNode root, char[][] board,\n int x, int y, boolean[][] visited) {\n if (root.isString == true) {\n if (!path.contains(root.s)) {\n path.add(root.s);\n }\n }\n\n if (x < 0 || x >= board.length || y < 0 || y >= board[0].length\n || visited[x][y] == true || root == null) {\n return;\n }\n // DFS\n if (root.subtree.containsKey(board[x][y])) {\n for (int i = 0; i < 4; ++i) {\n visited[x][y] = true;\n search(path, root.subtree.get(board[x][y]), board, x + dx[i], y + dy[i],\n visited);\n visited[x][y] = false;\n }\n }\n }","public static void findShortestPath(char[][] maze) {\n\t\tboolean visited[][] = new boolean[maze.length][maze[0].length]; \n\t\tint srcX = 0, srcY = 0;\n\t\t// find the source\n\t\tfor(int i=0; i<maze.length; i++) {\n\t\t\tfor(int j=0; j<maze[0].length; j++) {\n\t\t\t\tif(maze[i][j] == 's') {\n\t\t\t\t\tsrcX = i; srcY=j;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tboolean pe = doGridBFS(maze,visited,srcX,srcY);\n\t\tSystem.out.println(pe);\n\t\t\n\t}","void calculating(int depth);","public Maze3D generate(int depth, int row, int column) throws Exception {\n if (row < 2 || column < 2 || depth < 2)\n throw new Exception(\"Invalid inputs Maze most be at least 2x2x2\");\n Maze3D myMaze = new Maze3D(depth,row, column); //create an empty maze\n for (int r = 0; r <row ; r++) { //init to 1 all the cells\n for (int c = 0; c <column ; c++) {\n for (int d = 0; d < depth; d++) {\n myMaze.maze[d][r][c]= 1;\n\n }\n }\n }\n boolean [][][] VisitedCells = new boolean[depth][row][column]; //create an boolean matrix that saved cell as visited or not\n int randomDepth = Ran.nextInt((depth)); //select random depth number\n int randomRow = Ran.nextInt((row)); //select random row number\n Position3D StartPos = new Position3D(randomDepth,randomRow, 0);\n myMaze.maze[randomDepth][randomRow][0]= 0; //change selected start position to 0\n myMaze.setStartPosition(StartPos); //set the start position of the maze\n changeStatus(randomDepth,randomRow,0,VisitedCells); //change Start position as visited\n //choose random goal position cell in the maze\n int randomDepth_2 = Ran.nextInt((depth)); //select random depth number\n int randomRow_2 = Ran.nextInt((row)); //select random row number\n Position3D EndPos = new Position3D(randomDepth_2,randomRow_2, (column-1));\n myMaze.maze[randomDepth_2][randomRow_2][(column-1)]= 0; //change selected goal position to 0\n myMaze.setGoalPosition(EndPos); //set the start position of the maze\n changeStatus(randomDepth_2,randomRow_2,(column-1),VisitedCells);//mark as visited\n stack.push(StartPos);\n while (!stack.empty()) {\n Position3D curr = stack.pop();\n //check if the current cell have any neighbors which have not been visited, and find them all\n ArrayList<Position3D> neighbors = findNeighbors(curr, myMaze, VisitedCells); //find all options of moving forward\n if (neighbors.size() > 0) { //iterate over all neighbors\n stack.push(curr); //push curr into the stack\n myMaze.maze[curr.getDepthIndex()][curr.getRowIndex()][curr.getColumnIndex()] = 0; //change it's place to 1\n Position3D Neighbor = ChooseNeighbor(neighbors); //choose one unvisited random neighbor\n changeStatus(Neighbor.getDepthIndex(),Neighbor.getRowIndex(),Neighbor.getColumnIndex(), VisitedCells); //mark him as visited neighbor\n removeWall(curr, Neighbor, VisitedCells, myMaze); //remove the wall & mark as visited\n stack.push(Neighbor);\n }\n }\n //handle odd maze problems - open the walls which surround the goal cell\n for (int d = EndPos.getDepthIndex()-1; d < EndPos.getDepthIndex()+2; d++) {\n for (int r = EndPos.getRowIndex()-1; r < EndPos.getRowIndex()+2; r++) {\n for (int c = EndPos.getColumnIndex()-1; c < EndPos.getColumnIndex()+1; c++) {\n if (pointOnGrid(d,r,c,myMaze)){\n myMaze.maze[d][r][c]= 0; //change selected cell to 0\n changeStatus(d,r,c,VisitedCells);\n }\n }}\n }\n return myMaze;\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 }","public void solveMaze( int x0, int y0, int x1, int y1 ) {\n visited = new boolean[rows+1][cols+1];\n solve(x0, y0, x1, y1);\n }","private List<Integer> depthFirstSearch(String sequence) {\r\n LinkedList<Integer> stack = new LinkedList<Integer>();\r\n LinkedList<Integer> wordPos = new LinkedList<Integer>();\r\n List<Integer> neighbors = null;\r\n //string pos counter\r\n int c = 0;\r\n int index = -1;\r\n //find starting pos\r\n for (int i = 0; i < squareDimension * squareDimension; i++) {\r\n if (sequence.toUpperCase().startsWith(this.elementAtPos(i))) {\r\n this.clearMarks();\r\n wordPos.clear();\r\n stack.clear();\r\n //depth-first search\r\n stack.push(i);\r\n togglePosMark(i);\r\n wordPos = (LinkedList<Integer>) \r\n dfsRecursive(stack, sequence.substring(\r\n elementAtPos(i).length(), sequence.length())\r\n .toUpperCase(), elementAtPos(i).length(), \r\n i, sequence.length());\r\n if (wordPos.size() != 0) {\r\n return wordPos;\r\n }\r\n }\r\n }\r\n //no result so return empty list\r\n return new LinkedList<Integer>();\r\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\t\t\tpublic void run() \n\t\t\t{\n\t\t\t\tif(!(mazeCollection.containsKey(paramArray[0])))\n\t\t\t\t{\n\t\t\t\t\tc.passError(\"Maze doesn't exist\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\t/*\n\t\t\t\t//if solution for this maze exists\n\t\t\t\tif(mazeSolutions.containsKey(mazeCollection.get(paramArray[0])))\n\t\t\t\t{\n\t\t\t\t\tc.passSolve(\"Solution for \"+paramArray[0]+ \" is ready\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t*/\n\t\t\t\t\n\t\t\t\tif(paramArray[1].toString().equals(\"bfs\"))\n\t\t\t\t{\n\t\t\t\t\tMazeAdapter ms=new MazeAdapter(mazeCollection.get(paramArray[0]));\n\t\t\t\t\t\n\t\t\t\t\tSearcher<Position> bfs=new BFS<Position>();\n\t\t\t\t\tSolution<Position> sol=bfs.search(ms);\n\t\t\t\t\t\n\t\t\t\t\t//check if solution for the maze already exists, if so, replace it with the new one\n\t\t\t\t\tif(mazeSolutions.containsKey(mazeCollection.get(paramArray[0]))) {\n\t\t\t\t\t\tmazeSolutions.remove(mazeCollection.get(paramArray[0]));\n\t\t\t\t\t\tmazeSolutions.put(mazeCollection.get(paramArray[0]), sol);\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tmazeSolutions.put(mazeCollection.get(paramArray[0]), sol);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tc.passSolve(\"Solution for \"+paramArray[0]+ \" is ready\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\telse if(paramArray[1].toString().equals(\"dfs\"))\n\t\t\t\t{\n\t\t\t\t\tMazeAdapter ms=new MazeAdapter(mazeCollection.get(paramArray[0]));\n\t\t\t\t\t\n\t\t\t\t\tSearcher<Position> dfs=new DFS<Position>();\n\t\t\t\t\tSolution<Position> sol=dfs.search(ms);\n\t\t\t\t\t\n\t\t\t\t\t//check if solution for the maze already exists, if so, replace it with the new one\n\t\t\t\t\tif(mazeSolutions.containsKey(mazeCollection.get(paramArray[0]))) {\n\t\t\t\t\t\tmazeSolutions.remove(mazeCollection.get(paramArray[0]));\n\t\t\t\t\t\tmazeSolutions.put(mazeCollection.get(paramArray[0]), sol);\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tmazeSolutions.put(mazeCollection.get(paramArray[0]), sol);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tc.passSolve(\"Solution for \"+paramArray[0]+ \" is ready\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tc.passError(\"Invalid algorithm\");\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}","public boolean search(String word) {\n return dfs(word, 0, root);\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 }","private void depthFirstTraversalWithRecursion(final int startPoint, final boolean[] isVerticesVisited) {\n\t\tisVerticesVisited[startPoint] = true;\n\t\tSystem.out.print(startPoint + \" \");\n\t\tIterator<Integer> edgeIterator = adjacencyList[startPoint].listIterator();\n\n\t\tint vertice;\n\t\twhile (edgeIterator.hasNext()) {\n\t\t\tvertice = edgeIterator.next();\n\t\t\tif (!isVerticesVisited[vertice]) {\n\t\t\t\tdepthFirstTraversalWithRecursion(vertice, isVerticesVisited);\n\t\t\t}\n\t\t}\n\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}","public void BFS() {\n visitedCells = 1;\n\n // Initialize the vertices\n for (int j = 0; j < maze.getGrid().length; j++) {\n for (int k = 0; k < maze.getGrid().length; k++) {\n Cell cell = maze.getGrid()[j][k];\n cell.setColor(\"WHITE\");\n cell.setDistance(0);\n cell.setParent(null);\n }\n }\n\n Cell sourceCell = maze.getGrid()[0][0];\n Cell neighbor = null;\n Cell currentCell;\n int distance = 0;\n\n // Initialize the source node\n sourceCell.setColor(\"GREY\");\n sourceCell.setDistance(0);\n sourceCell.setParent(null);\n\n queue.add(sourceCell);\n\n // Visits each cell until the queue is empty\n while (!queue.isEmpty()) {\n currentCell = queue.remove();\n\n for (int i = 0; i < currentCell.mazeNeighbors.size(); i++) {\n neighbor = currentCell.mazeNeighbors.get(i);\n\n // Stop the search if you reach the final cell\n if (neighbor.x == r - 1 && neighbor.y == r - 1) {\n distance++;\n if (distance == 10)\n distance = 0;\n neighbor.setDistance(distance);\n neighbor.setParent(currentCell);\n neighbor.visited = true;\n visitedCells++;\n break;\n }\n\n // Checks each neighbor and adds it to the queue if its color is white\n if (neighbor.getColor().equalsIgnoreCase(\"WHITE\")) {\n distance++;\n if (distance == 10)\n distance = 0;\n neighbor.setColor(\"GREY\");\n neighbor.setDistance(distance);\n neighbor.setParent(currentCell);\n neighbor.visited = true;\n queue.add(neighbor);\n visitedCells++;\n }\n }\n // Stop the search if you reach the final cell\n if (neighbor.x == r - 1 && neighbor.y == r - 1)\n break;\n\n currentCell.setColor(\"BLACK\");\n }\n }","public static void userSelection_SolveMaze(int userInputN){\n\n\t\tint[] S = new int[(int) Math.pow(userInputN, 2)];\n\t\tgNode[] G = new gNode[S.length];\n\n\t\tboolean [] visited = new boolean[S.length];\t\t//Initialize\n\t\tfor(int i=0; i<visited.length;i++)\n\t\t\tvisited[i] = false;\n\n\t\tint [] path = new int[S.length];\t\t//Initialize \n\t\tfor(int i=0; i<path.length; i++)\n\t\t\tpath[i]=-1;\n\n\t\tScanner input = new Scanner(System.in);\n\t\tSystem.out.println(\"How would you like to solve the maze?\\n\"\n\t\t\t\t+ \"1.\\tBreadth-First Search\\n\"\n\t\t\t\t+ \"2.\\tDepth-First Search\\n\"\n\t\t\t\t+ \"3.\\tDepth-First Search with Recursion\");\n\t\t\n\t\tint ur = input.nextInt();\n\t\t\n\t\tif(ur==1)\t//Breadth-First Search\t\t\\///gNode && start @ position 0\n\t\t\tbfs(G, visited, path, 0);\n\t\telse if(ur==2)\t//Depth-First Search\n\t\t\tdfs_Stack(G, visited, path, 0);\n\t\telse if(ur==3)\t//Depth-First Search w/recursion\t\n\t\t\tdfsRecursion(G, visited, path, 0);\t\n\t\telse{\n\t\t\tSystem.out.println(\"Invalid option. Please enter the appropriate integer value\");\n\t\t\tuserSelection_SolveMaze(userInputN);\n\t\t}\n\t\t\n\t\tinput.close();\n\t}","int depth();","int depth();","private void depthFirstSearchIterative(int sourceVertex, List<Integer>[] adjacent, Stack<Integer> finishTimes,\n boolean[] visited, boolean getFinishTimes) {\n Stack<Integer> stack = new Stack<>();\n stack.push(sourceVertex);\n visited[sourceVertex] = true;\n\n if (!getFinishTimes) {\n sccIds[sourceVertex] = sccCount;\n }\n\n // Used to be able to iterate over each adjacency list, keeping track of which\n // vertex in each adjacency list needs to be explored next\n Iterator<Integer>[] adjacentIterators = (Iterator<Integer>[]) new Iterator[adjacent.length];\n for (int vertexId = 0; vertexId < adjacentIterators.length; vertexId++) {\n if (adjacent[vertexId] != null) {\n adjacentIterators[vertexId] = adjacent[vertexId].iterator();\n }\n }\n\n while (!stack.isEmpty()) {\n int currentVertex = stack.peek();\n\n if (adjacentIterators[currentVertex].hasNext()) {\n int neighbor = adjacentIterators[currentVertex].next();\n\n if (!visited[neighbor]) {\n stack.push(neighbor);\n visited[neighbor] = true;\n }\n } else {\n stack.pop();\n\n if (getFinishTimes) {\n finishTimes.push(currentVertex);\n }\n }\n }\n }","static void dfs(int node) {\n for (int adj : adjList[node]) {\n if (adj != firstParents[node]) {\n firstParents[adj] = node;\n depth[adj] = depth[node] + 1;\n maxDepth = Math.max(maxDepth, depth[adj]);\n dfs(adj);\n }\n }\n }","public void findTour( int x, int y, int moves )\n {\n delay(50); //slow it down enough to be followable\n if (solved) System.exit(0);\n\n //primary base case: tour completed\n if (moves == (sideLength * sideLength)) {\n solved = true;\n }\n //other base case: stepped off board or onto visited cell\n if ( board[x][y] != 0 ) {\n return;\n }\n //otherwise, mark current location\n //and recursively generate tour possibilities from current pos\n else {\n board[x][y] = moves;\n System.out.println(this);\n delay(10); //uncomment to slow down enough to view\n\n /*======================================\n Recursively try to solve (find tour) from\n each of knight's available moves.\n . e . d .\n f . . . c\n . . @ . .\n g . . . b\n . h . a .\n ======================================*/\n // right and down\n findTour(x + 1, y + 2, moves + 1);\n // left and down\n findTour(x - 1, y + 2, moves + 1);\n // down and right\n findTour(x + 2, y + 1, moves + 1);\n // up and left\n findTour(x - 2, y - 1, moves + 1);\n // right and up\n findTour(x + 1, y - 2, moves + 1);\n // left and up\n findTour(x - 1, y - 2, moves + 1);\n // up and right\n findTour(x + 2, y - 1, moves + 1);\n // down and left\n findTour(x - 2, y + 1, moves + 1);\n\n //If made it this far, path did not lead to tour, so back up.\n board[x][y] = 0;\n System.out.println(this);\n }\n }","private void createMaze(Tile currentTile) {\n\n while (numberOfCellsVisited < CAST_WIDTH * CAST_HEIGHT) {\n\n // Get coordinates of current tile and set as visited\n int currentX = currentTile.getPosition().getX();\n int currentY = currentTile.getPosition().getY();\n tempMap[currentY][currentX].setVisited(true);\n\n // Begin neighbourhood scan\n ArrayList<Integer> neighbours = new ArrayList<>();\n\n // If a neighbour is not visited and its projected position is within bounds, add it to the list of valid neighbours\n // North neighbour\n if (currentY - 1 >= 0) {\n if (!tempMap[currentY - 1][currentX].isVisited()) //Northern neighbour unvisited\n neighbours.add(0);\n }\n //Southern neighbour\n if (currentY + 1 < CAST_HEIGHT) { //y index if increased is not greater than height of the chamber\n if (!tempMap[currentY + 1][currentX].isVisited()) //Northern neighbour unvisited\n neighbours.add(1);\n }\n //Eastern neighbour\n if (currentX + 1 < CAST_WIDTH) { //check edge case\n if (!tempMap[currentY][currentX + 1].isVisited()) { //check if visited\n neighbours.add(2);\n }\n }\n //Western neighbour\n if (currentX - 1 >= 0) {\n if (!tempMap[currentY][currentX - 1].isVisited()) {\n neighbours.add(3);\n }\n }\n if (!neighbours.isEmpty()) {\n\n //generate random number between 0 and 3 for direction\n Random rand = new Random();\n boolean randomizer;\n int myDirection;\n do {\n myDirection = rand.nextInt(4);\n randomizer = neighbours.contains(myDirection);\n } while (!randomizer);\n\n //knock down wall\n switch (myDirection) {\n case 0 -> { // North\n tempMap[currentY][currentX].getPathDirection()[0] = true;\n currentTile = tempMap[currentY - 1][currentX];\n }\n case 1 -> { // South\n tempMap[currentY][currentX].getPathDirection()[1] = true;\n currentTile = tempMap[currentY + 1][currentX];\n }\n case 2 -> { // East\n tempMap[currentY][currentX].getPathDirection()[2] = true;\n currentTile = tempMap[currentY][currentX + 1];\n }\n case 3 -> { // West\n tempMap[currentY][currentX].getPathDirection()[3] = true;\n currentTile = tempMap[currentY][currentX - 1];\n }\n }\n\n mapStack.push(currentTile);\n numberOfCellsVisited++;\n } else {\n currentTile = mapStack.pop(); //backtrack\n }\n }\n\n castMaze(tempMap[0][0], -1);\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 }","private boolean DFSUtil(State state, ArrayList<String> visited, int currentDepth) {\n // Mark the current node as visited and print it\n visited.add(state.joinValues());\n\n this.path.push(state);\n\n if (this.problem.goalTest(state)) {\n return true;\n }\n\n // Recur for all the vertices adjacent to this vertex\n // extend the current node\n ListIterator<State> iterator = this.extend(state).listIterator();\n this.incrementExtendedNumber();\n while (iterator.hasNext()) {\n State state1 = iterator.next();\n if (this.limit > currentDepth) {\n if (this.graphSearch && !visited.contains(state1.joinValues())) {\n this.incrementVisitedNumber();\n if (DFSUtil(state1, visited, currentDepth + 1))\n return true;\n else\n this.path.pop();\n } else if (!this.graphSearch) {\n this.incrementVisitedNumber();\n if (DFSUtil(state1, visited, currentDepth + 1))\n return true;\n else\n this.path.pop();\n }\n }\n\n\n this.setMaxMemory(this.path.size());\n }\n return false;\n }","private int dfs(int[][] matrix, int i, int j, int d) {\n if (i < 0 || j < 0 || i == matrix.length || j == matrix[0].length || matrix[i][j] != 0)\n return 0;\n if (dp[i][j][d] > 0) return dp[i][j][d];\n timeComplexityCount++;\n maxI = Math.max(maxI, i);\n int res;\n if (d == 1)\n res = Math.max(dfs(matrix, i, j + 1, 1), dfs(matrix, i, j + 1, 2));\n else if (d == 0)\n res = Math.max(dfs(matrix, i, j - 1, 0), dfs(matrix, i, j - 1, 2));\n else\n res = Math.max(dfs(matrix, i + 1, j, 0), Math.max(dfs(matrix, i + 1, j, 1), dfs(matrix, i + 1, j, 2)));\n dp[i][j][d] = res + 1;\n return res + 1;\n }","private static void DFS(char grid[][], int row, int col, int ROW, int COL, boolean visited[][]) {\n\t\t// these arrays are used to get row and column numbers of 8 neighbors of a given cell.\n\t\tint rowNum[] = new int[] {-1, -1, -1, 0, 0, 1, 1, 1};\n\t\tint colNum[] = new int[] {-1, 0, 1, -1, 1, -1, 0, 1};\n\t\t\n\t\t// mark this cell as visited\n\t\tvisited[row][col] = true;\n\t\t\n\t\t// recur for all connected neighbors\n\t\tfor (int i = 0; i < 8; i++) {\n\t\t\tif (isSafe(grid, row+rowNum[i], col+colNum[i], ROW, COL, visited)) {\n\t\t\t\tDFS(grid, row+rowNum[i], col+colNum[i], ROW, COL, visited);\n\t\t\t}\n\t\t}\n\t}","private static void depthFirstSearch(Vertex v, ArrayList<Vertex> visitedArrayList, Graph graph){\n visitedArrayList.add(v);\n Iterator<Vertex> iter=graph.getNeighbors(v).iterator();\n while (iter.hasNext()){\n Vertex v1=iter.next();\n if(!visitedArrayList.contains(v1)){\n depthFirstSearch(v1,visitedArrayList,graph);\n }\n }\n for(Vertex v1 : graph.getNeighbors(v)){\n if(!visitedArrayList.contains(v1)){\n depthFirstSearch(v1,visitedArrayList,graph);\n }\n }\n }","public int depth ();","public DepthFirst(MazePoint[][] cMaze, LinkedList<String> inventoryList, HashMap<Item, ItemValue> availableItemsHashMap)\n {\n // initialise instance variables\n this.cMaze = cMaze;\n this.inventoryList = inventoryList;\n this.availableItemsHashMap = availableItemsHashMap;\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 searchMaze(char[][] maze, int s, int [] k, boolean[][] visited) {\n\t\tint startRow = 0;\n\t\tint startCol = 0;\n\t\t\n\t\touterloop:\n\t\tfor(int row = 0; row < maze.length; row++) {\n\t\t\tfor(int col = 0; col < maze[0].length; col++) {\n\t\t\t\tif(maze[row][col] == '.') {\n\t\t\t\t\tstartRow = row;\n\t\t\t\t\tstartCol = col;\n\t\t\t\t\tbreak outerloop;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tmazeHelper(maze, visited, k, startRow, startCol);\n\t\t\n\t\tfor(int row = 0; row < maze.length; row++) {\n\t\t\tfor(int col = 0; col < maze[0].length; col++) {\n\t\t\t\tif(maze[row][col] == '.' && !visited[row][col]) {\n\t\t\t\t\tmaze[row][col] = 'X';\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintMaze(maze);\n\t}","private ArrayList<Position3D> findNeighbors(Position3D current, Maze3D myMaze,boolean [][][]VisitedCells) throws Exception {\n ArrayList<Position3D> neighbors = new ArrayList<>();\n //for each neighbor, add him into the neighbors array, if it's on the grid (maze), if it's not a corner, not the current position itself, and it's unvisited\n //iterate over all neighbors in the same depth\n for (int x = current.getRowIndex()-2; x < current.getRowIndex()+3; x=x+2) {\n for (int y = current.getColumnIndex()-2; y < current.getColumnIndex()+3 ; y=y+2) {\n if (pointOnGrid(current.getDepthIndex(),x, y, myMaze) && pointNotCorner(current ,current.getDepthIndex(), x, y)\n && pointNotMyCell(current,current.getDepthIndex(), x, y) && !(Visited(current.getDepthIndex(),x,y,VisitedCells))) {\n neighbors.add(new Position3D(current.getDepthIndex(),x, y));\n }\n }\n }\n //check the options from the other depths\n\n if (pointOnGrid(current.getDepthIndex()+2,current.getRowIndex(), current.getColumnIndex(), myMaze) && !(Visited(current.getDepthIndex()+2,current.getRowIndex(),current.getColumnIndex(),VisitedCells))){\n neighbors.add(new Position3D(current.getDepthIndex()+2,current.getRowIndex(), current.getColumnIndex()));\n }\n if (pointOnGrid(current.getDepthIndex()-2,current.getRowIndex(), current.getColumnIndex(), myMaze) && !(Visited(current.getDepthIndex()-2,current.getRowIndex(),current.getColumnIndex(),VisitedCells))){\n neighbors.add(new Position3D(current.getDepthIndex()-2,current.getRowIndex(), current.getColumnIndex()));\n }\n return neighbors;\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 }","private boolean solveNext(){\n Stack<Integer[]> emptyPositions = findEmptyPositions();\n\n while (!emptyPositions.isEmpty()) {\n\n //get the top empty position from the stack.\n Integer[] position = emptyPositions.peek();\n int row = position[0];\n int col = position[1];\n\n for (int value = 1; value <= size; value++) {\n if (isPositionValid(row, col, value)){\n\n //value is valid, we can set it to the board.\n board[row][col] = value;\n\n //recursive backtracking\n if(solveNext()) {\n\n //if the value leads to a solution, pop it from the stack.\n emptyPositions.pop();\n return true;\n }\n else board[row][col] = 0;\n\n }\n }\n return false;\n }\n return true;\n }","@SuppressWarnings({\"rawtypes\", \"unchecked\", \"SuspiciousMethodCalls\"})\n private List getDepthFirstTraversal_iterative_usingStack_BigO_VPlusE() throws Exception {\n Map<Object, Boolean> visited = new LinkedHashMap<>();\n Stack watchStack = new Stack();\n\n V root = data.keySet().stream().findFirst().orElseThrow(() -> new Exception(\"Graph is Empty\"));\n watchStack.push(root);\n visited.put(root, true);\n\n while(!watchStack.isEmpty()) {\n Object currentVertex = watchStack.top();\n\n BinarySearchTree<E> edgeTree = data.getOrDefault(currentVertex, new BinarySearchTree<>());\n List<E> edges = edgeTree.getTreeByInOrder_depthFirst();\n\n //Remove an item from the stack when there are no edges or all the edges are visited for that vertex\n if(edgeTree.isEmpty() || visited.keySet().containsAll(edges)) {\n watchStack.pop();\n } else {\n for(E edge : edges) {\n if(!visited.containsKey(edge)) {\n watchStack.push(edge);\n visited.put(edge, true);\n break;\n }\n }\n }\n }\n return new ArrayList<>(visited.keySet());\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 }","private static BoardNode startGreedyDepthFirst(int steps, BoardNode node){\n count = 1;\n return greedyDepthFirst(steps, node);\n }","public MahjongSolitaireMove findMove()\n {\n // MAKE A MOVE TO FILL IN \n MahjongSolitaireMove move = new MahjongSolitaireMove();\n\n // GO THROUGH THE ENTIRE GRID TO FIND A MATCH BETWEEN AVAILABLE TILES\n for (int i = 0; i < gridColumns; i++)\n {\n for (int j = 0; j < gridRows; j++)\n {\n ArrayList<MahjongSolitaireTile> stack1 = tileGrid[i][j];\n if (stack1.size() > 0)\n {\n // GET THE FIRST TILE\n MahjongSolitaireTile testTile1 = stack1.get(stack1.size()-1);\n for (int k = 0; k < gridColumns; k++)\n {\n for (int l = 0; l < gridRows; l++)\n {\n if (!((i == k) && (j == l)))\n { \n ArrayList<MahjongSolitaireTile> stack2 = tileGrid[k][l];\n if (stack2.size() > 0) \n {\n // AND TEST IT AGAINST THE SECOND TILE\n MahjongSolitaireTile testTile2 = stack2.get(stack2.size()-1);\n \n // DO THEY MATCH\n if (testTile1.match(testTile2))\n {\n // YES, FILL IN THE MOVE AND RETURN IT\n move.col1 = i;\n move.row1 = j;\n move.col2 = k;\n move.row2 = l;\n return move;\n }\n }\n }\n }\n }\n }\n }\n }\n // WE'VE SEARCHED THE ENTIRE GRID AND THERE\n // ARE NO POSSIBLE MOVES REMAINING\n return null;\n }","protected boolean solve(int currentRow, int currentColumn) {\n \tint currentBlock = m.maze[currentRow][currentColumn];\t\t\t\t\t\t\t// get the current block that we are on\r\n \t\r\n if (m.isBlockEmpty(currentBlock)) {\t\t\t\t\t\t\t\t\t\t\t\t// make sure current block is empty\r\n \tm.maze[currentRow][currentColumn] = 2; \t\t\t\t\t\t\t\t// add this block to the path as a potential solution\r\n repaint();\r\n \r\n m.blocksTraversed++;\t\t\t\t\t\t\t\t\t\t\t\t\t\t// keep track of how many blocks were traversed over\r\n \r\n if (currentRow == m.rows-2 && currentColumn == m.columns-2) {\t\t\t\t// current block is bottom right, path has been found\r\n \tGUI.ta.append(m.blocksTraversed + \" blocks were traversed while solving the maze.\\n\");\r\n \tdouble percentage = (((double) m.blocksTraversed / (m.rows * m.columns))*100) * 2;\r\n DecimalFormat f = new DecimalFormat(\"##.00\");\r\n \tGUI.ta.append(\"This results in \" + f.format(percentage) + \"% of the maze being traveled.\\n\");\r\n \treturn true;\r\n }\r\n \r\n try { Thread.sleep(1); }\r\n catch (InterruptedException e) { }\r\n \r\n int topBlock = currentRow - 1;\t\t\t\t\t\t\t\t\t\t\t\t// block directly above the current block\r\n int leftBlock = currentColumn - 1;\t\t\t\t\t\t\t\t\t\t\t// block directly left of the current block\r\n int bottomBlock = currentRow + 1;\t\t\t\t\t\t\t\t\t\t\t// block directly below the current block\r\n int rightBlock = currentColumn + 1;\t\t\t\t\t\t\t\t\t\t\t// block directly right of the current block\r\n \r\n if (solve(topBlock, currentColumn) || solve(currentRow, leftBlock) ||\t\t// a solution was found\r\n \tsolve(bottomBlock, currentColumn) || solve(currentRow, rightBlock))\r\n \treturn true;\r\n \r\n m.maze[currentRow][currentColumn] = 4; \t\t\t\t\t\t\t\t\t// no solution from current block so make the block visited instead\r\n repaint();\r\n \r\n synchronized(this) {\r\n try { wait(1); }\r\n catch (InterruptedException e) { }\r\n }\r\n }\r\n return false;\r\n }","private Leaf minimax(AI_Domain game,boolean turn,int depth, boolean flag,String path) {\r\n\t\t\t\r\n\t\t\t// if the depth is zero or the game is over,\r\n\t\t\t// return the heuristic value of this state\r\n\t\t\tif(depth == 0 || game.gameOver()){\r\n\t\t\t\tLeaf L = new Leaf(H.calculateScore(game));\r\n\t\t\t\tL.insertPath(path);\r\n\t\t\t\treturn L;\r\n\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\r\n\t\t\tArrayList<String> moves = new ArrayList<String>();\r\n\t\t\t\r\n\t\t\t// get all the possible moves\r\n\t\t\tmoves = game.allPossibleMoves(turn);\r\n\r\n\t\t\tLeaf val;\r\n\t\t\tLeaf bestVal = new Leaf(0);\r\n\t\t\t\r\n\t\t\t// its the maximizing player turn\r\n\t\t\tif(turn) {\r\n\t\t\t\t// \tset the best value to be 0 (minus infinity)\r\n\t\t\t\t\tbestVal.setValue(0);\r\n\t\t\t\t\r\n\t\t\t\t// for each possible move\r\n\t\t\t\tfor(String str : moves){\r\n\t\t\t\t\t\r\n\t\t\t\t\t//create a copy of the given problem\r\n\t\t\t\t\tAI_Domain copy = game.clone();\t\t\r\n\t\t\t\t\t\r\n\t\t\t\t\t//execute possible move\r\n\t\t\t\t\tcopy.executeCommand(str,\"MiniMax\");\r\n\t\t\t\t\r\n\t\t\t\t\t\t// if it's the first enter to the minimax :\r\n\t\t\t\t\t\t// set the path of the this root to be the first move that executed\r\n\t\t\t\t\t\t// and lead to the next leaves\r\n\t\t\t\t\t\tif(flag) {\r\n\t\t\t\t\t\t\tpath = str;\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t//recursive check the best move for the copied problem after executed the move\r\n\t\t\t\t\t\t\tval = minimax(copy,!turn,depth-1,false,path);\r\n\t\t\t\t\t\t\t// set the bestval to be the move that has higher heuristic score\r\n\t\t\t\t\t\t\tif( val.getValue() >= bestVal.getValue())\r\n\t\t\t\t\t\t\t\tbestVal = val.clone();\r\n\t\t\t\t\t\t\t}\r\n\t\t\t\t\t\t// not the first time entered to minimax\r\n\t\t\t\t\t\telse {\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\t//recursive check the best move for the copied problem after executed the move\r\n\t\t\t\t\t\t\tval = minimax(copy,!turn,depth-1,false,path);\r\n\t\t\t\t\t\t\t// set the bestval to be the move that has higher heuristic score\r\n\t\t\t\t\t\t\tif( val.getValue() >= bestVal.getValue())\r\n\t\t\t\t\t\t\tbestVal = val.clone();\r\n\t\r\n\t\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\r\n\t\t\t}\r\n\t\t\t\t// it's the other player turn\r\n\t\t\t else { \r\n\t\t\t\t // set the best value to be plus infinity\r\n\t\t\t\t\tbestVal.setValue(Integer.MAX_VALUE-1);\r\n\t\t\t\t\tfor(String str : moves){\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t//create a copy of the given problem\r\n\t\t\t\t\t\tAI_Domain copy = game.clone();\r\n\t\t\t\t\t\t//execute possible move\r\n\t\t\t\t\t\tcopy.executeCommand(str,\"MiniMax\");\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t//recursive check the best move for the copied problem after executed the move\r\n\t\t\t\t\t\tval = minimax(copy,!turn,depth-1,false,path);\r\n\t\t\t\t\t\t// we assume that the other player will try to maximize his score too\r\n\t\t\t\t\t\t//and therefore it will minimize our score\r\n\t\t\t\t\t\tif(val.getValue() < bestVal.getValue())\r\n\t\t\t\t\t\t bestVal = val.clone();\r\n\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\treturn bestVal;\t\t\r\n\t}","Path run(Maze maze, Cell start, Cell finish) {\n Path path = new Path();\n if (start.equals(finish)) {\n path.add(start);\n return path;\n }\n Maze changed = new Maze(maze);\n CellQueue queue = new CellQueueLinkedListImpl();\n queue.enqueue(start);\n changed.setCellValue(start, 0);\n Cell curCell;\n do {\n curCell = queue.dequeue();\n for (int i = -1; i <= 1; i++) {\n for (int j = -1; j <= 1; j++) {\n for (int k = -1; k <= 1; k++) {\n Cell curNeighbour = new Cell(curCell.x + i, curCell.y + j, curCell.z + k);\n //check that curNeighbour exists and empty\n if (changed.getCellValue(curNeighbour) == -1) {\n changed.setCellValue(curNeighbour, changed.getCellValue(curCell) + 1);\n queue.enqueue(curNeighbour);\n }\n }\n }\n }\n } while (!queue.isEmpty() && !curCell.equals(finish));\n if (!curCell.equals(finish)) {\n return path;\n }\n while (!curCell.equals(start)) {\n path.addBegin(curCell);\n int curPathIndex = changed.getCellValue(curCell);\n boolean foundPrev = false;\n for (int i = -1; i <= 1 && !foundPrev; i++) {\n for (int j = -1; j <= 1 && !foundPrev; j++) {\n for (int k = -1; k <= 1 && !foundPrev; k++) {\n Cell curNeighbour = new Cell(curCell.x + i, curCell.y + j, curCell.z + k);\n if (changed.getCellValue(curNeighbour) == changed.getCellValue(curCell) - 1) {\n curCell = curNeighbour;\n foundPrev = true;\n }\n }\n }\n }\n }\n path.addBegin(start);\n return path;\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}","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 findShortestPath() {\r\n\t\t\r\n\t\t//Create a circular array that will store the possible next tiles in the different paths.\r\n\t\tOrderedCircularArray<MapCell> path = new OrderedCircularArray<MapCell>();\r\n\t\t\r\n\t\t//Acquire the starting cell.\r\n\t\tMapCell starting = cityMap.getStart();\r\n\t\t\r\n\t\t//This variable is to be updated continuously with the cell with the shortest distance value in the circular array.\r\n\t\tMapCell current=null;\r\n\t\t\r\n\t\t//This variable is to check if the destination has been reached, which is initially false.\r\n\t\tboolean destination = false;\r\n\t\t\r\n\t\t//Add the starting cell into the circular array, and mark it in the list.\r\n\t\tpath.insert(starting, 0);\r\n\t\t\r\n\t\tstarting.markInList(); \r\n\t\t\r\n\t\ttry {\r\n\t\t\t\r\n\t\t\t//As long as the circular array isn't empty, and the destination hasn't been reached, run this loop.\r\n\t\t\twhile(!path.isEmpty()&&!destination) {\r\n\t\t\t\t\r\n\t\t\t\t//Take the cell with the shortest distance out of the circular array, and mark it accordingly.\r\n\t\t\t\tcurrent = path.getSmallest();\r\n\t\t\t\tcurrent.markOutList();\r\n\t\t\t\t\r\n\t\t\t\tMapCell next;\r\n\t\t\t\tint distance;\r\n\t\t\t\t\r\n\t\t\t\tif(current.isDestination()) {\r\n\t\t\t\t\t\r\n\t\t\t\t\tdestination = true; //If the current cell is the destination, end the loop.\r\n\t\t\t\t\t\r\n\t\t\t\t} else {\r\n\t\t\t\t\t\r\n\t\t\t\t\tnext = nextCell(current); //Acquire the next possible neighbour of the current cell.\r\n\t\t\t\t\t\r\n\t\t\t\t\t//Don't run if next is null, meaning there is no other possible neighbour in the path for the current cell.\r\n\t\t\t\t\twhile(next!=null) {\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tdistance = current.getDistanceToStart() + 1;\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\t//If the distance of the selected neighbouring cell is currently more than 1 more than the current cell's \r\n\t\t\t\t\t\t//distance, update the distance of the neighbouring cell. Then, set the current cell as its predecessor.\r\n\t\t\t\t\t\tif(next.getDistanceToStart()>distance) {\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tnext.setDistanceToStart(distance);\r\n\t\t\t\t\t\t\tnext.setPredecessor(current);\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tdistance = next.getDistanceToStart(); \r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tif(next.isMarkedInList() && distance<path.getValue(next)) {\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tpath.changeValue(next, distance); //If the neighbouring cell is in the circular array, but with a \r\n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\t //larger distance value than the new updated distance, change its value.\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t} else if(!next.isMarkedInList()){\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tpath.insert(next, distance); //If the neighbouring cell isn't in the circular array, add it in.\r\n\t\t\t\t\t\t\tnext.markInList();\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tnext = nextCell(current); //Look for the next possible neighbour, if any.\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}\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t//Catch all the possible exceptions that might be thrown by the method calls. Print the appropriate messages.\r\n\t\t} catch (EmptyListException e) {\r\n\t\t\t\r\n\t\t\tSystem.out.println(e.getMessage());\r\n\t\t\tSystem.out.println(\"Path finding execution stopped.\");\r\n\t\t\t\r\n\t\t} catch (InvalidNeighbourIndexException e) {\r\n\t\t\t\r\n\t\t\tSystem.out.println(\"The program tried to access an invalid neighbour of a tile.\");\r\n\t\t\tSystem.out.println(\"Path finding execution stopped.\");\r\n\t\t\t\r\n\t\t} catch (InvalidDataItemException e) {\r\n\t\t\t\r\n\t\t\tSystem.out.println(e.getMessage());\r\n\t\t\tSystem.out.println(\"Path finding execution stopped.\");\r\n\t\t\t\r\n\t\t} catch (Exception e) {\r\n\t\t\t\r\n\t\t\tSystem.out.println(e.getMessage()+\" Path finding execution has stopped.\");\r\n\t\t\t\r\n\t\t}\r\n\t\t\r\n\t\t//If a path was found, print the number of tiles in the path.\r\n\t\tif(destination) {\r\n\t\t\t\r\n\t\t\tSystem.out.println(\"Number of tiles in path: \" + (current.getDistanceToStart()+1));\r\n\t\t\t\r\n\t\t} else {\r\n\t\t\t\r\n\t\t\tSystem.out.println(\"No path found.\"); //Otherwise, indicate that a path wasn't found.\r\n\t\t\t\r\n\t\t}\r\n\t\t\r\n\t}","private ArrayList<Vertex> dfs(boolean[] visited, Vertex start, Vertex target) {\n \n //TEST VALUES: if start/end are out of bounds of array of vertices\n if (start.getID() < 0) {\n return null;\n }\n \n if (target.getID() > arrayOfVertices.length) {\n return null;\n }\n \n \n //base case: if start = target, return start vertex right there.\n if (start == target) {\n solution.add(0, start);\n return solution;\n }\n \n //has this vertex been visited before? yes? then just return. if no, \n if (visited[start.getID()]) {\n return null;\n }\n \n //since it hasn't been visited before, mark it as visited\n visited[start.getID()] = true;\n \n //does it have kids? no? return.\n if (start.getDegree() == 0) {\n return null;\n }\n \n //create ArrayList of adjacent vertices to the given start\n ArrayList<Vertex> adjacents = start.getAdjacent();\n \n //go through its edges, for loop. to go through edges\n for (int i = 0; i < start.getDegree(); i++) {\n \n //(from testing)\n NavigateMaze.advance(start.getID(), adjacents.get(i).getID());\n \n //do the dfs; if it's not equal to null \n //(i.e. we found the target, then add it to path\n if (dfs(visited, adjacents.get(i), target) != null) {\n //then add to path\n solution.add(0, start); \n return solution;\n }\n \n //(from testing)\n else {\n NavigateMaze.backtrack(adjacents.get(i).getID(), start.getID());\n }\n \n } \n \n //return null\n return null;\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 }","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 }","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}","private boolean solve(int i, int j, int pos, int[][] cells) {\n\t\tif (i == 9) {\n\t\t\ti = 0;\n\t\t\tif (++j == 9)\n\t\t\t\treturn true;\n\t\t}\n\t\tif (cells[i][j] != 0) // Skip filled cells\n\t\t\treturn solve(i + 1, j, pos, cells);\n\n\t\tfor (int k = 1; k <= 9; k++) {\n\t\t\tint val = k + pos;\n\t\t\tif (val > 9) {\n\t\t\t\tval = val - 9;\n\t\t\t}\n\t\t\tif (legal(i, j, val, cells)) {\n\t\t\t\tcells[i][j] = val;\n\t\t\t\tif (solve(i + 1, j, pos, cells))\n\t\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\tcells[i][j] = 0; // Reset on backtrack\n\t\treturn false;\n\t}","private Stack<MapLocation> findPath(State.StateView state)\n {\n Unit.UnitView townhallUnit = state.getUnit(townhallID);\n Unit.UnitView footmanUnit = state.getUnit(footmanID);\n \n MapLocation startLoc = new MapLocation(footmanUnit.getXPosition(), footmanUnit.getYPosition(), null, 0);\n \n MapLocation goalLoc = new MapLocation(townhallUnit.getXPosition(), townhallUnit.getYPosition(), null, 0);\n \n MapLocation footmanLoc = null;\n if(enemyFootmanID != -1) {\n Unit.UnitView enemyFootmanUnit = state.getUnit(enemyFootmanID);\n footmanLoc = new MapLocation(enemyFootmanUnit.getXPosition(), enemyFootmanUnit.getYPosition(), null, 0);\n }\n \n // get resource locations\n List<Integer> resourceIDs = state.getAllResourceIds();\n Set<MapLocation> resourceLocations = new HashSet<MapLocation>();\n for(Integer resourceID : resourceIDs)\n {\n ResourceNode.ResourceView resource = state.getResourceNode(resourceID);\n \n resourceLocations.add(new MapLocation(resource.getXPosition(), resource.getYPosition(), null, 0));\n }\n \n return AstarSearch(startLoc, goalLoc, state.getXExtent(), state.getYExtent(), footmanLoc, resourceLocations);\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 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}","private static List<Move> pathSolve(Level level){\n\t\tOptimisticMap optMap = new OptimisticMap(level);\n\t\t\n\t\tPoint dst = level.getExitPos();\n\t\t\n\t\t// Open nodes\n\t\tSortedMap<Integer, List<SolveNode>> nodes = new TreeMap<Integer, List<SolveNode>>();\n\t\t\n\t\t// Current costs to arrive to solve nodes\n\t\tint[][][] arrived = new int[level.getMapSize().x][level.getMapSize().y][Move.values().length];\n\t\tfor ( int x = 0 ; x < level.getMapSize().x ; x++ ){\n\t\t\tfor ( int y = 0 ; y < level.getMapSize().y ; y++ ){\n\t\t\t\tfor ( int d = 0 ; d < Move.values().length ; d++ ){\n\t\t\t\t\tarrived[x][y][d] = Integer.MAX_VALUE;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\t// Create initial nodes\n\t\t{\n\t\t\tPoint box = level.getBoxPos();\n\t\t\tPoint player = level.getPlayerPos();\n\t\t\tfor ( Move dir : Move.values()){\n\t\t\t\tPoint playerDst = dir.nextPosition(box);\n\t\t\t\tif ( level.isClearSafe(playerDst.x, playerDst.y)){\n\t\t\t\t\tList<Move> pathNoDesiredPlayerPosition = pathTo(level, player, box, playerDst);\n\t\t\t\t\tif ( pathNoDesiredPlayerPosition != null ){\n\t\t\t\t\t\tSolveNode node = new SolveNode();\n\t\t\t\t\t\tnode.moves = pathNoDesiredPlayerPosition;\n\t\t\t\t\t\tnode.box = (Point)box.clone();\n\t\t\t\t\t\tnode.playerDir = dir;\n\t\t\t\t\t\taddSolveNode(nodes, node, node.moves.size() + optMap.getValue(node.box.x, node.box.y));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\twhile ( nodes.isEmpty() == false ){\n\t\t\t// Get node to process\n\t\t\tSolveNode node = removeSolveNode(nodes);\n\t\t\tif ( node.box.equals(dst) ){\n\t\t\t\t// This is the best solution\n\t\t\t\treturn node.moves;\n\t\t\t}\n\t\t\t\n\t\t\t// Create new nodes trying to move the box in each direction\n\t\t\tfor ( Move dir : Move.values() ){\n\t\t\t\tSolveNode newNode = new SolveNode();\n\t\t\t\tnewNode.box = dir.nextPosition(node.box);\n\t\t\t\tnewNode.playerDir = dir.opposite();\n\t\t\t\t\n\t\t\t\t// First check if the box can be moved to that position (is clear)\n\t\t\t\tif ( level.isClearSafe(newNode.box.x, newNode.box.y) == false ){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Check if the player can move to the pushing position\n\t\t\t\tPoint player = node.playerDir.nextPosition(node.box);\n\t\t\t\tPoint playerDst = dir.opposite().nextPosition(node.box);\n\t\t\t\tList<Move> playerMoves = pathTo(level, player, node.box, playerDst);\n\t\t\t\tif ( playerMoves == null ){\n\t\t\t\t\t// The player can't move itself to the pushing position\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Check if the cost to arrive to the new node is less that the previous known\n\t\t\t\tif ( node.moves.size() + playerMoves.size() + 1 >= arrived[newNode.box.x][newNode.box.y][dir.index()] ){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tSystem.out.println(\"\" + newNode.box.x + \" \" + newNode.box.y);\n\t\t\t\t\n\t\t\t\t// Add the new node to the open nodes\n\t\t\t\tnewNode.moves.addAll(node.moves);\n\t\t\t\tnewNode.moves.addAll(playerMoves);\n\t\t\t\tnewNode.moves.add(dir);\n\t\t\t\taddSolveNode(nodes, newNode, newNode.moves.size() + optMap.getValue(newNode.box.x, newNode.box.y));\n\t\t\t\tarrived[newNode.box.x][newNode.box.y][dir.index()] = newNode.moves.size();\n\t\t\t}\n\t\t}\n\t\t\n\t\t// There is no solution\n\t\treturn null;\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 }","public boolean solveMaze(char[][] maze, int row, int col) {\n if (row < 0 || row >= maze.length) {\r\n return false;\r\n }\r\n // Not even in the maze\r\n if (col < 0 || col >= maze.length) {\r\n return false;\r\n }\r\n // Can't move to this spot(Hit a wall and hit a spot that it has already been to)\r\n if (maze[row][col] == 'X' || maze[row][col] == '+') {\r\n return false;\r\n }\r\n // Winning condition: Found the exit\r\n if (maze[row][col] == 'E') {\r\n // Found the exit\r\n return true;\r\n }\r\n\r\n // Mark spot as visited\r\n maze[row][col] = '+';\r\n // Try north\r\n // Try path with new row, if successful, then it is done\r\n if (solveMaze(maze, row - 1, col)) {\r\n return true;\r\n }\r\n\r\n // Try east\r\n if (solveMaze(maze, row, col + 1)) {\r\n return true;\r\n }\r\n\r\n // Try south\r\n if (solveMaze(maze, row + 1, col)) {\r\n return true;\r\n }\r\n\r\n // Try west\r\n if (solveMaze(maze, row, col - 1)) {\r\n return true;\r\n }\r\n\r\n // Tried every direction = NO GOOD!\r\n // \"Unvisit\" the spot\r\n maze[row][col] = '.';\r\n return false;\r\n\r\n }","private void findPath()\n\t{\n\t\tpathfinding = true;\n\n\t\tmoves = Pathfinder.calcOneWayMove(city.getDrivingMap(), x, y, destX, destY);\n\t\tpathfinding = false;\n\t}","public void solve(int startX, int startY, int endX, int endY) {\r\n // re-inicializar células para encontrar o caminho\r\n for (Cell[] cellrow : this.cells) {\r\n for (Cell cell : cellrow) {\r\n cell.parent = null;\r\n cell.visited = false;\r\n cell.inPath = false;\r\n cell.travelled = 0;\r\n cell.projectedDist = -1;\r\n }\r\n }\r\n // células ainda estão sendo consideradas\r\n ArrayList<Cell> openCells = new ArrayList<>();\r\n // célula sendo considerada\r\n Cell endCell = getCell(endX, endY);\r\n if (endCell == null) return; // saia se terminar fora dos limites\r\n { // bloco anônimo para excluir o início, porque não usado posteriormente\r\n Cell start = getCell(startX, startY);\r\n if (start == null) return; // saia se começar fora dos limites\r\n start.projectedDist = getProjectedDistance(start, 0, endCell);\r\n start.visited = true;\r\n openCells.add(start);\r\n }\r\n boolean solving = true;\r\n while (solving) {\r\n if (openCells.isEmpty()) return; // sair, nenhum caminho\r\n // classifique openCells de acordo com a menor distância projetada\r\n Collections.sort(openCells, new Comparator<Cell>() {\r\n @Override\r\n public int compare(Cell cell1, Cell cell2) {\r\n double diff = cell1.projectedDist - cell2.projectedDist;\r\n if (diff > 0) return 1;\r\n else if (diff < 0) return -1;\r\n else return 0;\r\n }\r\n });\r\n Cell current = openCells.remove(0); // célula pop menos projetada\r\n if (current == endCell) break; // no final\r\n for (Cell neighbor : current.neighbors) {\r\n double projDist = getProjectedDistance(neighbor,\r\n current.travelled + 1, endCell);\r\n if (!neighbor.visited || // ainda não visitado\r\n projDist < neighbor.projectedDist) { // melhor caminho\r\n neighbor.parent = current;\r\n neighbor.visited = true;\r\n neighbor.projectedDist = projDist;\r\n neighbor.travelled = current.travelled + 1;\r\n if (!openCells.contains(neighbor))\r\n openCells.add(neighbor);\r\n }\r\n }\r\n }\r\n // criar caminho do fim ao começo\r\n Cell backtracking = endCell;\r\n backtracking.inPath = true;\r\n while (backtracking.parent != null) {\r\n backtracking = backtracking.parent;\r\n backtracking.inPath = true;\r\n }\r\n }","private boolean computeSearchDirection() {\n\t\t// Compute the function's gradient\n\t\tfunction.computeGradient(temp0_Nx1.data);\n\n\t\t// compute the change in gradient\n\t\tfor( int i = 0; i < N; i++ ) {\n\t\t\ty.data[i] = temp0_Nx1.data[i] - g.data[i];\n\t\t\tg.data[i] = temp0_Nx1.data[i];\n\t\t}\n\n\t\t// Update the inverse Hessian matrix\n\t\tif( iterations != 0 ) {\n\t\t\tEquationsBFGS.inverseUpdate(B, s, y, temp0_Nx1, temp1_Nx1);\n\t\t}\n\n\t\t// compute the search direction\n\t\tCommonOps_DDRM.mult(-1,B,g, searchVector);\n\n\t\t// use the line search to find the next x\n\t\tif( !setupLineSearch(fx, x.data, g.data, searchVector.data) ) {\n\t\t\t// the search direction has a positive derivative, meaning the B matrix is\n\t\t\t// no longer SPD. Attempt to fix the situation by resetting the matrix\n\t\t\tresetMatrixB();\n\t\t\t// do the search again, it can't fail this time\n\t\t\tCommonOps_DDRM.mult(-1,B,g, searchVector);\n\t\t\tsetupLineSearch(fx, x.data, g.data, searchVector.data);\n\t\t} else if(Math.abs(derivAtZero) <= gtol ) {\n\t\t\tif( verbose != null ) {\n\t\t\t\tverbose.printf(\"finished select direction, gtest=%e\\n\",Math.abs(derivAtZero));\n\t\t\t}\n\n\t\t\t// the input might have been modified by the function. So copy it\n\t\t\tSystem.arraycopy(function.getCurrentState(),0,x.data,0,N);\n\t\t\treturn terminateSearch(true);\n\t\t}\n\n\t\tmode = 1;\n\t\titerations++;\n\t\treturn false;\n\t}","boolean dfs(char[][] board, boolean[][] visited, int i, int j,String word, int k) {\n\t\t if(k==word.length()) return true;\n\t\t if(i<0||i>=board.length||j<0||j>=board[0].length) return false;\n\t\t if(visited[i][j]) return false;\n\t\t if(board[i][j]!=word.charAt(k)) return false;\n\t\t \n\t\t visited[i][j]=true;\n\t\t if(dfs(board,visited,i-1,j,word,k+1)) return true;\n\t\t if(dfs(board,visited,i+1,j,word,k+1)) return true;\n\t\t if(dfs(board,visited,i,j-1,word,k+1)) return true;\n\t\t if(dfs(board,visited,i,j+1,word,k+1)) return true;\n\t\t visited[i][j]=false;\n\t\t \n\t\treturn false;\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 }"],"string":"[\n \"public Stack<MazePoint> DepthFirstSearch(int row, int column)\\n {\\n //cMaze[row][column].wasVisited()\\n if(cMaze[row][column].isExit())\\n {\\n sPath.push(cMaze[row][column]);\\n //print out the path\\n PrintPath(sPath, true);\\n return sPath;\\n }\\n else\\n {\\n //when not visit\\n if(!cMaze[row][column].wasVisited())\\n {\\n if(cMaze[row][column].hasItem())\\n {\\n String itemName = cMaze[row][column].pickUpItem();\\n Item item = new Item(itemName);\\n //check if the item is in the hashmap\\n if(availableItemsHashMap.get(item) != null)\\n {\\n inventoryList.insert(itemName);\\n }\\n else\\n {\\n cMaze[row][column].dropItem();\\n }\\n }\\n //mark as vist\\n cMaze[row][column].markVisited();\\n //push into stack\\n sPath.push(cMaze[row][column]);\\n }\\n //determine where to traverse next (S, E, W, N)\\n //recursively\\n if(cMaze[row+1][column].canBeNavigated() || cMaze[row+1][column].isExit())// or (cMaze[row+1][column] != VISITED_MARKER && cMaze[row+1][column] != 'W')\\n {\\n return DepthFirstSearch(row+1, column);\\n }\\n else if(cMaze[row][column+1].canBeNavigated() || cMaze[row][column+1].isExit())\\n {\\n return DepthFirstSearch(row, column+1);\\n }\\n else if(cMaze[row][column-1].canBeNavigated() || cMaze[row][column-1].isExit())\\n {\\n return DepthFirstSearch(row, column-1);\\n }\\n else if(cMaze[row-1][column].canBeNavigated() || cMaze[row-1][column].isExit())\\n {\\n return DepthFirstSearch(row-1, column);\\n }\\n //no where could go, then return\\n else\\n {\\n sPath.pop();\\n if(sPath.isEmpty())\\n {\\n //print nothing found\\n PrintPath(sPath, false);\\n return sPath;\\n }\\n MazePoint mp = sPath.top();\\n int mpRow = mp.getRow();\\n int mpColumn = mp.getColumn();\\n return DepthFirstSearch(mpRow, mpColumn);\\n }\\n }\\n }\",\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 \"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 \"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 \"public static boolean Traversal_DFS(int row, int col, int[][] maze)\\r\\n {\\n if (isASolution(row, col))\\r\\n {\\r\\n maze[row][col] = 3;\\r\\n return true;\\r\\n }\\r\\n\\r\\n // otherwise, mark the cell as visited and process its children.\\r\\n maze[row][col] = 2;\\r\\n if (canMove(row,col-1, maze) && Traversal_DFS(row,col-1, maze))\\r\\n {\\r\\n \\t// mark this as success.\\r\\n maze[row][col-1] = 3;\\r\\n return true;\\r\\n }\\r\\n if (canMove(row,col+1, maze))\\r\\n {\\r\\n // move right\\r\\n if (Traversal_DFS(row,col+1, maze))\\r\\n {\\r\\n \\tmaze[row][col+1] = 3;\\r\\n return true;\\r\\n }\\r\\n }\\r\\n if (canMove(row-1,col, maze))\\r\\n {\\r\\n // move up\\r\\n if (Traversal_DFS(row-1,col, maze))\\r\\n {\\r\\n \\tmaze[row-1][col] = 3;\\r\\n return true;\\r\\n }\\r\\n }\\r\\n if (canMove(row+1,col, maze))\\r\\n {\\r\\n // move down\\r\\n if (Traversal_DFS(row+1,col, maze))\\r\\n {\\r\\n \\tmaze[row+1][col] = 3;\\r\\n return true;\\r\\n }\\r\\n }\\r\\n // Failure, unmark the cell and return false\\r\\n maze[row][col] = 0;\\r\\n return false;\\r\\n }\",\n \"private void DepthFirstSearch(Node current){\\n helperDFS( current );\\n }\",\n \"public Stack<Integer> dfs(Maze tmp) {\\n \\n int tmpx = tmp.positionX();\\n int tmpy = tmp.positionY();\\n Stack<Integer> s = new Stack<Integer>();\\n while (!tmp.gameOver()) {\\n choosedirection(s, tmp);\\n while (!s.isEmpty() && !tmp.gameOver()) {\\n if (s.peek() == 0) {\\n if (tmp.right()) {\\n s.push(1);\\n } else if (tmp.up()) {\\n s.push(0);\\n } else if (tmp.left()) {\\n s.push(3);\\n } else {\\n this.stackpop(s, tmp);\\n }\\n } else if (s.peek() == 1) {\\n if (tmp.down()) {\\n s.push(2);\\n } else if (tmp.right()) {\\n s.push(1);\\n } else if (tmp.up()) {\\n s.push(0);\\n } else {\\n this.stackpop(s, tmp);\\n }\\n } else if (s.peek() == 2) {\\n if (tmp.left()) {\\n s.push(3);\\n } else if (tmp.down()) {\\n s.push(2);\\n } else if (tmp.right()) {\\n s.push(1);\\n } else {\\n this.stackpop(s, tmp);\\n }\\n } else if (s.peek() == 3) {\\n if (tmp.up()) {\\n s.push(0);\\n } else if (tmp.left()) {\\n s.push(3);\\n } else if (tmp.down()) {\\n s.push(2);\\n } else {\\n this.stackpop(s, tmp);\\n }\\n\\n }\\n\\n }\\n }\\n\\n Stack<Integer> stack = new Stack<Integer>();\\n while (!s.isEmpty()) {\\n stack.push(s.pop());\\n }\\n\\n tmp.setLocation(tmpx, tmpy);\\n return stack;\\n\\n }\",\n \"public static String findPath(Maze maze) {\\n \\tint m = maze.getNumRows();\\n \\tint n = maze.getNumCols();\\n\\n \\t//define a visited matrix\\n \\tboolean[][] visited = new boolean[m][n];\\n \\tsetvisited(false, visited);\\n\\n \\t//define a direction matrix\\n \\tint[][] dir_mtr = new int[m][n];\\n \\tinit_dir(-1,dir_mtr);\\n\\n\\n\\n \\t//define a stack\\n \\tStack<MazeLocation> s;\\n \\ts = new StackRefBased<MazeLocation>();\\n\\n \\tMazeLocation entry = maze.getEntry();\\n \\tMazeLocation exit = maze.getExit();\\n \\t// System.out.println(entry.toString());\\n \\ts.push(entry);\\n\\n\\t\\tMazeLocation temp; \\n\\t\\tString result = \\\"\\\"; \\t\\n\\n\\t\\ttry{\\n\\t\\t\\tint x,y;\\n\\n\\n\\t\\t\\twhile(!s.isEmpty()){\\n\\n \\t\\ttemp = s.peek();\\n \\t\\tx = temp.getRow();\\n \\t\\ty = temp.getCol();\\n \\t\\tdir_mtr[x][y]+=1;\\n\\n \\t\\tif(temp.toString().equals(exit.toString())){\\n \\t\\t\\tSystem.out.println(\\\"find the path\\\");\\n \\t\\t\\tbreak;\\n\\n \\t\\t}\\n\\n \\t\\tif(dir_mtr[x][y]==0){ \\n \\t\\t\\t//checking the up direction\\n \\t\\t\\tif(x-1>=0 && !maze.isWall(x-1,y) && !visited[x-1][y]){\\n \\t\\t\\t\\tMazeLocation testnode = new MazeLocation(x-1,y,maze.isWall(x-1,y));\\n \\t\\t\\t\\tvisited[x-1][y] = true;\\n \\t\\t\\t\\ts.push(testnode);\\n\\n \\t\\t\\t}\\n\\n \\t\\t}else if(dir_mtr[x][y]==1){\\n \\t\\t\\t//checking the left direction\\n \\t\\t\\tif(y-1>=0 && !maze.isWall(x,y-1) && !visited[x][y-1]){\\n \\t\\t\\t\\tMazeLocation testnode = new MazeLocation(x,y-1,maze.isWall(x,y-1));\\n \\t\\t\\t\\tvisited[x][y-1] = true;\\n \\t\\t\\t\\ts.push(testnode);\\n\\n \\t\\t\\t}\\n\\n \\t\\t}else if(dir_mtr[x][y]==2){\\n \\t\\t\\t//checking the down direction\\n \\t\\t\\tif(x+1<m && !maze.isWall(x+1,y) && !visited[x+1][y]){\\n \\t\\t\\t\\tMazeLocation testnode = new MazeLocation(x+1,y,maze.isWall(x+1,y));\\n \\t\\t\\t\\tvisited[x+1][y] = true;\\n \\t\\t\\t\\ts.push(testnode);\\n\\n \\t\\t\\t}\\n \\t\\t\\t\\n \\t\\t}else if(dir_mtr[x][y]==3){\\n \\t\\t\\t//checking the right direction\\n \\t\\t\\tif(y+1<n && !maze.isWall(x,y+1) && !visited[x][y+1]){\\n \\t\\t\\t\\tMazeLocation testnode = new MazeLocation(x,y+1,maze.isWall(x,y+1));\\n \\t\\t\\t\\tvisited[x][y+1] = true;\\n \\t\\t\\t\\ts.push(testnode);\\n\\n \\t\\t\\t}\\n \\t\\t\\t\\n \\t\\t}else{\\n \\t\\t\\tvisited[x][y] = false;\\n \\t\\t\\ts.pop();\\n \\t\\t}\\n\\n\\n\\n \\t\\t\\n \\t}\\n\\n \\t//reverse the stack\\n \\tStack<MazeLocation> reverse;\\n \\treverse = new StackRefBased<MazeLocation>();\\n \\twhile(!s.isEmpty()){\\n\\t\\t\\t reverse.push(s.pop()); \\t//push the node to the reverse stack\\n\\t\\t\\t }\\n\\n\\n \\t//if the stack is not empty, then we find the path\\n\\t\\tif(!reverse.isEmpty()){\\n\\t\\t\\tresult = reverse.toString();\\n\\n\\t\\t}\\n\\n \\t\\n \\n\\n\\t\\t}\\n\\t\\tcatch (StackEmptyException see) {\\n \\n }\\n\\n\\n \\treturn result;\\n\\n\\n }\",\n \"private Boolean depthFirstSearch(HashMap<String, Boolean> visited, String node) {\\n \\tif (visited.get(node)) {\\n \\t\\t// This can actually never happen\\n \\t\\tif (Flags.semant_debug) {\\n \\t\\t\\tSystem.out.println(\\\"Node: \\\" + node + \\\" visited twice\\\");\\n \\t\\t}\\n \\t\\tsemantError(nameToClass.get(node)).println(\\\"Class \\\" + node + \\\", or its ancestors, is invloved in a cycle\\\");\\n \\t\\treturn false;\\n \\t}\\n \\tvisited.put(node, true);\\n \\tif (adjacencyList.get(node) == null) {\\n \\t\\treturn true;\\n \\t}\\n \\tfor (String child : adjacencyList.get(node)) {\\n \\t\\tif (Flags.semant_debug) {\\n \\t\\t\\tSystem.out.println(\\\"Traversing \\\" + node + \\\" --> \\\" + child);\\n \\t\\t}\\n \\t\\tdepthFirstSearch(visited, child);\\n \\t}\\n \\treturn true;\\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 \"private boolean dfs(int[][] maze, boolean[][] visited, int[] start, int[] destination) {\\n\\t\\tif(Arrays.equals(start, destination)) return true;\\n\\t\\tint i = start[0];\\n\\t\\tint j = start[1];\\n\\t\\tif(visited[i][j])\\n\\t\\t\\treturn false;\\n\\t\\tvisited[i][j] = true;\\n\\t\\tBiPredicate<Integer, Integer> roll = (rowInc, colInc) -> {\\n\\t\\t\\tint ii = i, jj = j;\\n\\t\\t\\twhile(ii >= 0 && ii <= maze.length - 1 && jj >= 0 && jj <= maze[0].length - 1 && maze[ii][jj] != 1) {\\n\\t\\t\\t\\tii += rowInc;\\n\\t\\t\\t\\tjj += colInc;\\n\\t\\t\\t}\\n\\t\\t\\treturn dfs(maze, visited, new int[] {ii - rowInc, jj - colInc}, destination)\\n\\t\\t};\\n\\t\\tif(roll.test(1, 0)) return true;\\n\\t\\tif(roll.test(-1, 0)) return true;\\n\\t\\tif(roll.test(0, 1)) return true;\\n\\t\\tif(roll.test(0, -1)) return true;\\n\\t\\t\\n\\t\\treturn false;\\n\\t}\",\n \"public boolean solve(final int startRow, final int startCol) {\\r\\n\\r\\n // TODO\\r\\n // validate arguments: ensure position is within maze area\\r\\n\\r\\n if(mazeData [startRow][startCol] == WALL) {\\r\\n throw new IllegalArgumentException(\\\" we're in a wall buddy\\\");\\r\\n }\\r\\n else if (startRow > mazeData.length-1 || startCol > mazeData.length-1 ){\\r\\n throw new IllegalArgumentException(\\\" we're out of bounds \\\");\\r\\n }\\r\\n\\r\\n\\r\\n\\r\\n\\r\\n\\r\\n // TODO create local class for row/col positions\\r\\n class Position {\\r\\n private int row;\\r\\n private int col;\\r\\n\\r\\n // TODO add instance variables\\r\\n public Position(final int row, final int col) {\\r\\n this.row = row;\\r\\n this.col= col;\\r\\n }\\r\\n\\r\\n\\r\\n\\r\\n // TODO toString if desired\\r\\n public String toString() {\\r\\n return \\\"Row: \\\" + this.row + \\\"Column: \\\"+ this.col;\\r\\n }\\r\\n\\r\\n\\r\\n }\\r\\n\\r\\n\\r\\n // define the stack (work queue)\\r\\n final var queue = Collections.asLifoQueue(new LinkedList<Position>());\\r\\n //Queue<Position> queue = new LinkedList<Position>(); // EXTRA CREDIT PART 2\\r\\n\\r\\n // put starting position in queue\\r\\n queue.add(new Position(startRow, startCol));\\r\\n\\r\\n\\r\\n\\r\\n\\r\\n\\r\\n // look for a way out of the maze from the current position\\r\\n while (!queue.isEmpty()) {\\r\\n\\r\\n\\r\\n final Position pos = queue.remove();\\r\\n\\r\\n // if this is a wall, then ignore this position (and skip the remaining steps of the loop body)\\r\\n if (mazeData [pos.row][pos.col]== WALL){\\r\\n continue; // jumps to next spot in que , by skipping to next iteration of loops by saying continue\\r\\n }\\r\\n\\r\\n\\r\\n // otherwise mark this place as visited (drop a breadcrumb)\\r\\n if (mazeData [pos.row][pos.col]== VISITED){\\r\\n continue; // jumps to next spot in que , by skipping to next iteration of loops by saying continue\\r\\n }\\r\\n else if(mazeData [pos.row][pos.col]== EMPTY){\\r\\n mazeData [pos.row][pos.col]= VISITED;\\r\\n }\\r\\n\\r\\n // if we're already on the perimeter, then this is a way out and we should return success (true) right away\\r\\n if (pos.row == 0|| pos.col ==0 || pos.row == mazeData.length-1 || pos.col == mazeData[0].length-1){\\r\\n mazeData[startRow][startCol] = START;\\r\\n return true;\\r\\n }\\r\\n\\r\\n queue.add(new Position(pos.row+1,pos.col ));//down\\r\\n queue.add(new Position(pos.row-1,pos.col ));//up\\r\\n queue.add(new Position(pos.row,pos.col-1 )); //left\\r\\n queue.add(new Position(pos.row, pos.col + 1)); //right\\r\\n\\r\\n\\r\\n }//end of while\\r\\n\\r\\n\\r\\n\\r\\n // mark starting position\\r\\n mazeData[startRow][startCol] = START;\\r\\n\\r\\n // if we've looked everywhere but haven't gotten out, then return failure (false)\\r\\n return false;\\r\\n }\",\n \"private void solve(int x, int y, boolean draw) {\\n \\t\\t// these are the walls of the maze, maze solver should not go beyond\\n \\t\\t// walls\\n \\t\\t// if (x == 0 || y == 0 || x == N + 1 || y == N + 1) {\\n \\t\\t// return;\\n \\t\\t// }\\n \\n \\t\\t// if we have already visited this position\\n \\t\\t// or if deep levels of the recursion have found the target\\n \\t\\tif (foundTarget || visited[x][y])\\n \\t\\t\\treturn;\\n \\n \\t\\t// this position is new, mark it as visited\\n \\t\\tvisited[x][y] = true;\\n \\n \\t\\tif (draw) {\\n \\t\\t\\t// Draw a blue dot to show we have been here\\n \\t\\t\\tStdDraw.setPenColor(StdDraw.BLUE);\\n \\t\\t\\tStdDraw.filledCircle(x + 0.5, y + 0.5, 0.25);\\n \\t\\t\\tStdDraw.show(SOLVER_SPEED);\\n \\t\\t}\\n \\n \\t\\t// if we have reached the maze solve target\\n \\t\\tif (x == target.x && y == target.y) {\\n \\t\\t\\tfoundTarget = true;\\n \\t\\t}\\n \\n \\t\\t// Try go another place\\n \\t\\tif (!north[x][y])\\n \\t\\t\\tsolve(x, y + 1, draw);\\n \\t\\tif (!east[x][y])\\n \\t\\t\\tsolve(x + 1, y, draw);\\n \\t\\tif (!south[x][y])\\n \\t\\t\\tsolve(x, y - 1, draw);\\n \\t\\tif (!west[x][y])\\n \\t\\t\\tsolve(x - 1, y, draw);\\n \\n \\t\\tif (foundTarget)\\n \\t\\t\\treturn;\\n \\n \\t\\tif (draw) {\\n \\t\\t\\t// Draw a grey dot to show we have backtracked\\n \\t\\t\\tStdDraw.setPenColor(StdDraw.GRAY);\\n \\t\\t\\tStdDraw.filledCircle(x + 0.5, y + 0.5, 0.25);\\n \\t\\t\\tStdDraw.show(SOLVER_SPEED);\\n \\t\\t}\\n \\t}\",\n \"private static boolean dfs(char[][] board, int r, int c) {\\n if (r == 9)\\n return true;\\n\\n // return here and line 57 is because you will backtrack to the very beginning once a solution is found\\n if (c == 9)\\n return dfs(board, r + 1, 0);\\n\\n if (board[r][c] == '.') {\\n // try each number\\n for (int k = 1; k <= 9; k++) {\\n board[r][c] = Character.forDigit(k, 10);\\n if (isValid(board, r, c)) {\\n // when find the solution should return true to avoid any more backtrack search\\n if (dfs(board, r, c + 1))\\n return true;\\n }\\n board[r][c] = '.';\\n }\\n } else {\\n return dfs(board, r, c + 1);\\n }\\n return false;\\n }\",\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 boolean solveMaze(int x, int y, String direction){\\n\\n if (maze[x][y] == \\\"E\\\"){\\n solved = true;\\n return solved;\\n\\n }\\n\\n if(!(maze[x][y].equals(\\\"S\\\") || maze[x][y].equals(\\\"E\\\"))){\\n maze[x][y] = \\\"X\\\";\\n }\\n\\n if(direction != \\\"up\\\" && isReachable(x+1, y)){\\n solveMaze(x + 1, y, \\\"down\\\");\\n if(solved) return true;\\n }\\n if(direction != \\\"left\\\" && isReachable(x, y+ 1)){\\n solveMaze(x, y + 1, \\\"right\\\");\\n if(solved) return true;\\n }\\n if(direction != \\\"down\\\" && isReachable(x-1, y)){\\n solveMaze(x - 1 , y, \\\"up\\\");\\n if(solved) return true;\\n }\\n if(direction != \\\"right\\\" && isReachable(x, y -1)){\\n solveMaze(x, y - 1, \\\"left\\\");\\n if(solved) return true;\\n }\\n\\n //If cannot move, do backtracking\\n if(!solved) {\\n maze[x][y] = \\\" \\\";\\n return false;\\n }\\n\\n return false;\\n }\",\n \"public abstract List<Direction> searchForCheese(Maze maze);\",\n \"public String depthFirstSearch( AnyType start_vertex ) throws VertexException {\\n \\n StringBuffer buffer = new StringBuffer();\\n \\n // ----------------------------\\n // TODO: Add your code here\\n // ----------------------------\\n ConstantTimeStack<Vertex<AnyType>> stack = new ConstantTimeStack<Vertex<AnyType>>();\\n boolean exists = false;\\n Vertex<AnyType> S = new Vertex<AnyType>(start_vertex);\\n int counter = 0;\\n //loop through to set each vertex to not visited\\n for( int i = 0; i < vertex_adjacency_list.size(); i++){\\n vertex_adjacency_list.get(i).setVisited(-1);\\n //if find the start vertex then set index position to counter\\n if(vertex_adjacency_list.get(i).compareTo(S) == 0){\\n exists = true;\\n vertex_adjacency_list.get(i).setVisited(counter);\\n counter = i;\\n }\\n }\\n //if doesn't exist then through exception\\n if(exists == false){\\n throw new VertexException(\\\"Start Vertex does not exist\\\");\\n }\\n //if it does exist then push start node onto stack, set visited \\n else if(exists){\\n stack.push(vertex_adjacency_list.get(counter));\\n vertex_adjacency_list.get(counter).setVisited(1);\\n Vertex <AnyType> e = vertex_adjacency_list.get(counter);\\n counter = 2;\\n int n = e.numberOfAdjacentVertices();\\n try{\\n \\n while(true){\\n //loop through e's adjacent vertices \\n for (n = e.numberOfAdjacentVertices()-1; n >=0 ; n--){\\n //if the adacent vertex has not been visited\\n if(e.getAdjacentVertex(n).hasBeenVisited()==false){\\n //change e to adjacent vertex and push onto stack\\n e = e.getAdjacentVertex(n);\\n stack.push(e);\\n //set e as visited at counter\\n e.setVisited(counter);\\n counter++;\\n //reset n to e's num of vertices\\n n = e.numberOfAdjacentVertices();\\n }\\n //if it has been visited and it's the first node in list\\n //then pop it off the stack and then set e to new top\\n //set n to new num of vertices\\n else if(e.getAdjacentVertex(n).hasBeenVisited() && n == 0){\\n stack.pop();\\n e = stack.peek();\\n n = e.numberOfAdjacentVertices();\\n }\\n }\\n }\\n }catch(EmptyStackException m){\\n }\\n }\\n //loop through the list and print each with when it was visited\\n for(int k = 0; k< vertex_adjacency_list.size(); k++){\\n buffer.append(vertex_adjacency_list.get(k) + \\\":\\\" + vertex_adjacency_list.get(k).getVisited()+ \\\"\\\\n\\\");\\n }\\n \\n return buffer.toString();\\n \\n }\",\n \"private void depthFirstSearch(DirectedGraph graph, int vertex) {\\r\\n \\r\\n visited[vertex] = true;\\r\\n inRecursionStack[vertex] = true;\\r\\n \\r\\n for(int adjacentVertex: graph.adjacentVertices(vertex)) {\\r\\n if(inRecursionStack[adjacentVertex]) {\\r\\n throw new IllegalArgumentException(String.format(\\\"Graph contains a cycle: no topological sort possible: %s -> %s\\\", vertex, adjacentVertex));\\r\\n }\\r\\n \\r\\n if(!visited[adjacentVertex]) {\\r\\n depthFirstSearch(graph, adjacentVertex);\\r\\n }\\r\\n }\\r\\n\\r\\n reversePostOrder.push(vertex); \\r\\n inRecursionStack[vertex] = false;\\r\\n }\",\n \"public char[][] mazeTraversal(char[][] maze, int x, int y){\\n\\n // Using the try catch to find the 'end' of the maze. Or when the maze hits the bounds of the char array.\\n try{\\n // this will test all valid moves. If they are valid, it replaces the current position with 'x' and moves\\n // the cursor 'A' to the next position. Prints maze and recursively calls mazeTraversal.\\n\\n // if down is a valid move\\n if(maze[x][y-1] == '.'){\\n maze[x][y] = 'x';\\n maze[x][y-1] = 'A';\\n print(maze);\\n mazeTraversal(maze, x, y-1);\\n }\\n\\n // if right is a valid move\\n if(maze[x+1][y] == '.'){\\n maze[x][y] = 'x';\\n maze[x+1][y] = 'A';\\n print(maze);\\n mazeTraversal(maze, x+1, y);\\n }\\n\\n // if up is a valid move\\n if(maze[x][y+1] == '.'){\\n maze[x][y] = 'x';\\n maze[x][y+1] = 'A';\\n print(maze);\\n mazeTraversal(maze, x, y+1);\\n }\\n\\n // if left is a valid move\\n if(maze[x-1][y] == '.'){\\n maze[x][y] = 'x';\\n maze[x-1][y] = 'A';\\n print(maze);\\n mazeTraversal(maze, x-1, y);\\n }\\n\\n // if no moves are available or the cursor approaches a dead end, the current position is replaced with '0'\\n // and prints the maze again. This will remove the cursor until a next valid move is available.\\n // Returns the current maze.\\n maze[x][y] = '0';\\n print(maze);\\n return maze;\\n }catch(Exception e){\\n // If the maze approaches the 'end' of the maze, or approaches a point where the cursor is at the bounds,\\n // then the catch will initiate. Assuming the maze is done. Ending the program.\\n System.out.println(\\\"The Maze is traversed. Thank you for playing.\\\");\\n maze[x][y] = 'x';\\n print(maze);\\n System.exit(0);\\n }\\n return maze;\\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 \"private static void DepthFirstSearch(int i, ArrayList<ArrayList<Integer>> nodes, boolean[] visited) {\\n\\t\\tif(nodes == null) return;\\n\\t\\tvisited[i] = true;\\n\\t\\tSystem.out.println(i);\\n\\t\\tfor(int p : nodes.get(i)) {\\n\\t\\t\\tif(!visited[p]) {\\n\\t\\t\\t\\tDepthFirstSearch(p,nodes, visited);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\t\\n\\t}\",\n \"public void depthFirstSearch(){\\n\\t\\tStack<TreeNode<T>> nodeStack = new Stack<TreeNode<T>>();\\n\\n\\t\\tif(root!=null){\\n\\t\\t\\tnodeStack.push(root);\\n\\t\\t\\tSystem.out.println(root.data);\\n\\t\\t\\tTreeNode<T> topNode = root;\\n\\t\\t\\twhile(!nodeStack.isEmpty()){\\n\\t\\t\\t\\tif(topNode.left!=null){\\n\\t\\t\\t\\t\\tnodeStack.push(topNode.left);\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tSystem.out.println(topNode.data);\\n\\t\\t\\t\\t\\ttopNode = topNode.left;\\n\\t\\t\\t\\t} else if(topNode.right!=null){\\n\\t\\t\\t\\t\\tnodeStack.push(topNode.right);\\n\\t\\t\\t\\t\\tSystem.out.println(topNode.data);\\n\\t\\t\\t\\t\\ttopNode = topNode.right;\\n\\t\\t\\t\\t} else{\\n\\t\\t\\t\\t\\ttry{\\n\\t\\t\\t\\t\\t\\tnodeStack.pop();\\n\\t\\t\\t\\t\\t}catch(Exception ex){\\n\\t\\t\\t\\t\\t\\tex.printStackTrace();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\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 \"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 \"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 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 \"private void depthFirstSearch(Node sourceNode, Node destinationNode, String path, HashSet<Character> visited) {\\n // Base condition is that if the node is looping then return\\n if(visited.contains(sourceNode.charId)) {\\n return;\\n }\\n\\n // Mark the sourceNode as visited\\n visited.add(sourceNode.charId);\\n String newPath = sourceNode.charId.toString();\\n path += \\\"->\\\" + newPath;\\n\\n // If the source node reached destination or the node has no children\\n if(sourceNode == destinationNode || sourceNode.adjacent.isEmpty()) {\\n paths.add(path);\\n return;\\n }\\n\\n // Search all of it's children's children until reach destination\\n for(Node children : sourceNode.adjacent) {\\n depthFirstSearch(children, destinationNode, path, visited);\\n }\\n }\",\n \"public int depthFirstSearch(List<Integer>[] adj){\\n int connected = 0;\\n for(int i = 0; i < n; i++){\\n if(visited[i] == false){\\n connected ++;\\n dfsRecursive(adj, i);\\n }\\n }\\n return connected;\\n }\",\n \"public static void depthFirstSearchRecursive(ArrayList<Node> graph) {\\n\\t\\tSystem.out.println(\\\"DFS Recursive:\\\");\\n\\t\\tif(graph.size() == 0) {\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\t\\n\\t\\tGraphUtils.cleanGraph(graph);\\n\\t\\t\\n\\t\\tfor(Node node : graph) {\\n\\t\\t\\tdfsRecursive(node);\\n\\t\\t}\\n\\t\\t\\n\\t\\tSystem.out.println();\\n\\t\\t\\n\\t\\tGraphUtils.cleanGraph(graph);\\n\\t}\",\n \"public void depthFirstSearch(int current) throws Exception {\\n /* Mark the current vertex visited. */\\n visited[current] = true;\\n\\n discoveryOrder[discoverIndex++] = current;\\n /* Examine each vertex adjacent to the current vertex */\\n Iterator<Edge> itr = graph.edgeIterator(current);\\n while (itr.hasNext()) {\\n int neighbor = itr.next().getDest();\\n /* Process a neighbor that has not been visited */\\n if (!visited[neighbor]) {\\n /* Insert (current, neighbor) into the depthFirst search tree. */\\n parent[neighbor] = current;\\n /* Recursively apply the algorithm starting at neighbor. */\\n depthFirstSearch(neighbor);\\n }\\n }\\n\\n /* Mark current finished. */\\n finishOrder[finishIndex++] = current;\\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 \"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 \"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 \"public void buildTreeRecursive(SearchNode currentNode, MapGrid map, int depthLimit) {\\n\\t\\tsize = depthLimit;\\n\\t\\tif (currentNode.getX() == 0 && currentNode.getY() == 0) {\\n\\t\\t\\thomeFound = true; \\t// If home has not been found within depthLimit, then the reverse stack path is fastest route\\n\\t\\t\\treturn; \\t\\t\\t// If the current Node is the home node, don't build deeper\\n\\t\\t} else if (currentNode.getDepth() + 1 > depthLimit) {\\t// if currentNode is at the depth limit, don't build further\\n\\t\\t\\treturn;\\n\\t\\t} else {\\n\\t\\t\\tint currentDepth = currentNode.getDepth();\\n\\t\\t\\tGridCell currentCell = getCellFromNodeXY(currentNode, map);\\n\\t\\t\\tList<Character> walls = currentCell.directionsWithoutWalls();\\n\\t\\t\\tfor (char dir : walls) {\\t\\t\\t\\t\\n\\t\\t\\t\\tGridCell adjacentCell = map.getCellInDir(currentCell, dir);\\n\\t\\t\\t\\tSearchNode adjacentNode = createNodeFromCell(adjacentCell);\\n\\t\\t\\t\\tadjacentNode.setDepth(currentDepth + 1);\\n\\t\\t\\t\\tcurrentNode.addNodeInDir(adjacentNode, dir);\\t\\t\\t\\t\\n\\t\\t\\t\\tbuildTreeRecursive(adjacentNode, map, depthLimit);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"public DSAQueue depthFirstSearch(String start)\\n\\t{\\n\\t\\tif(!vertices.isEmpty())\\n\\t\\t{\\n\\t\\t\\tDSAQueue queue = new DSAQueue();\\n\\t\\t\\tDSAGraphVertex vx = getVertex(start); //vertex to start on (root)\\n\\t\\t\\tDSAStack visited = new DSAStack();\\t//creates empty stack\\n\\n\\t\\t\\tclear(); //sets all vertices as not visited\\n\\t\\t\\tvx.setVisited(); // Marks root as visited\\n\\t\\t\\tqueue.enqueue(vx); //start point\\n\\n\\t\\t\\tdfs(vx, visited, queue); //begin recursion\\n\\n\\t\\t\\treturn queue;\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tthrow new NoSuchElementException(\\\"List is empty\\\");\\n\\t\\t}\\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 \"private void doDepthFirstTraverse(int start, boolean[] visited, List<Edge> path) {\\n visited[start] = true;\\n\\n for (int i: this.heads[start]) {\\n if (!visited[i]) {\\n path.add(new Edge(start, i));\\n doDepthFirstTraverse(i, visited, path);\\n }\\n }\\n }\",\n \"private static int breadthFirstSearch(Vertex start) throws Queue.UnderflowException, Queue.EmptyException {\\n boolean visited[] = new boolean[48];\\n //Keep a queue of vertecies and a queue of the depth of the verticies - they will be added to and poped from identically\\n ListQueue<Vertex> queue = new ListQueue<Vertex>();\\n ListQueue<Integer> numQueue = new ListQueue<Integer>();\\n //Set the starting node as visited\\n visited[start.index()] = true;\\n queue.enqueue(start);\\n numQueue.enqueue(new Integer(1));\\n\\n //Keep last\\n int last = -1;\\n //While the queue isnt empty\\n while (!queue.isEmpty()) {\\n //Pop off the top from both queues and mark as visited\\n start = queue.dequeue();\\n int current = numQueue.dequeue();\\n visited[start.index] = true;\\n //For all neigbors\\n for (Vertex v : start.neighbors) {\\n //If we havent visited it make sure to visit it\\n if (visited[v.index()] == false) {\\n //As we keep adding new nodes to visit keep track of the depth\\n queue.enqueue(v);\\n numQueue.enqueue(current + 1);\\n }\\n }\\n //Keep track of the most recent depth before we pop it off (queue will be empty when we exit)\\n last = current;\\n }\\n //Return the max of the depth\\n return last;\\n }\",\n \"void testSearches(Tester t) {\\n Vertex v1 = new Vertex(10, 10);\\n Vertex v2 = new Vertex(10, 11);\\n Vertex v3 = new Vertex(10, 12);\\n\\n Edge e1 = new Edge(v1, v2, 1);\\n Edge e2 = new Edge(v2, v3, 1);\\n\\n IList<Vertex> map = new Cons<Vertex>(v1, new Cons<Vertex>(v2, new Cons<Vertex>(\\n v3, new Empty<Vertex>())));\\n\\n Player player = new Player(map);\\n DepthFirst dp = new DepthFirst(map);\\n BreadthFirst bp = new BreadthFirst(map);\\n\\n t.checkExpect(player.current, v1);\\n t.checkExpect(player.finished, false);\\n\\n t.checkExpect(bp.hasNext(), true);\\n t.checkExpect(bp.next(), new Queue<Vertex>());\\n\\n t.checkExpect(dp.hasNext(), true);\\n t.checkExpect(dp.next(), new Stack<Vertex>());\\n\\n t.checkExpect(player.move(true, e1), v2);\\n\\n t.checkExpect(player.current, v2);\\n t.checkExpect(player.finished, false);\\n\\n t.checkExpect(bp.hasNext(), false);\\n t.checkExpect(bp.next(), v3);\\n\\n t.checkExpect(dp.hasNext(), false);\\n t.checkExpect(dp.next(), v3);\\n\\n t.checkExpect(player.move(true, e2), v3);\\n\\n player.finished = true;\\n\\n t.checkExpect(player.current, v3);\\n t.checkExpect(player.finished, true);\\n\\n Queue<Vertex> q = new Queue<Vertex>(map);\\n\\n q.enqueue(new Vertex(5, 5));\\n\\n Deque<Vertex> dq = new Deque<Vertex>();\\n dq.addAtHead(v1);\\n dq.addAtTail(v2);\\n dq.addAtTail(new Vertex(5, 5));\\n\\n\\n t.checkExpect(q.isEmpty(), false);\\n t.checkExpect(q.contents, dq);\\n\\n Stack<Vertex> stack = new Stack<Vertex>(map);\\n\\n t.checkExpect(stack.isEmpty(), false);\\n dq.removeFromHead();\\n t.checkExpect(stack.pop(), dq);\\n\\n t.checkExpect(dp.next(), v2);\\n t.checkExpect(bp.hasNext(), true);\\n\\n }\",\n \"private static boolean solution(int[][] arr, int[][] mazeTravel, int row, int column) {\\n\\n int size = arr.length;\\n\\n if (row < 0 || row >= size || column < 0 || column >= size || arr[row][column] == 0 || mazeTravel[row][column] == 1 ) {\\n return false;\\n }\\n //Mark position as travelled\\n mazeTravel[row][column] = 1;\\n //Check if reached destination\\n if(row== arr.length-1&&column== arr.length-1){\\n return true;\\n }\\n //Top direction\\n if (solution(arr, mazeTravel, row - 1, column) ) {\\n return true;\\n }\\n //Right direction\\n if (solution(arr, mazeTravel, row, column + 1)) {\\n return true;\\n }\\n\\n //Left direction\\n if (solution(arr, mazeTravel, row, column - 1)) {\\n return true;\\n }\\n\\n //Down direction\\n if (solution(arr, mazeTravel, row + 1, column)) {\\n return true;\\n }\\n //Above 4 Conditions not satisfied\\n return false;\\n }\",\n \"int DFS(int i, int j) {\\n if (dp[i][j] != 0)\\n return dp[i][j];\\n\\n int steps = 0;\\n int trial = 0;\\n if (i < dp.length - 1 && matrix[i][j] < matrix[i+1][j]) {\\n trial = DFS(i + 1, j);\\n if (trial > steps)\\n steps = trial;\\n }\\n if (i > 0 && matrix[i][j] < matrix[i-1][j]) {\\n trial = DFS(i - 1, j);\\n if (trial > steps)\\n steps = trial;\\n }\\n if (j < dp[0].length - 1 && matrix[i][j] < matrix[i][j+1]) {\\n trial = DFS(i, j + 1);\\n if (trial > steps)\\n steps = trial;\\n }\\n if (j > 0 && matrix[i][j] < matrix[i][j-1]) {\\n trial = DFS(i, j - 1);\\n if (trial > steps)\\n steps = trial;\\n }\\n\\n dp[i][j] = steps + 1;\\n return dp[i][j];\\n }\",\n \"public void search(ArrayList<String> path, TrieNode root, char[][] board,\\n int x, int y, boolean[][] visited) {\\n if (root.isString == true) {\\n if (!path.contains(root.s)) {\\n path.add(root.s);\\n }\\n }\\n\\n if (x < 0 || x >= board.length || y < 0 || y >= board[0].length\\n || visited[x][y] == true || root == null) {\\n return;\\n }\\n // DFS\\n if (root.subtree.containsKey(board[x][y])) {\\n for (int i = 0; i < 4; ++i) {\\n visited[x][y] = true;\\n search(path, root.subtree.get(board[x][y]), board, x + dx[i], y + dy[i],\\n visited);\\n visited[x][y] = false;\\n }\\n }\\n }\",\n \"public static void findShortestPath(char[][] maze) {\\n\\t\\tboolean visited[][] = new boolean[maze.length][maze[0].length]; \\n\\t\\tint srcX = 0, srcY = 0;\\n\\t\\t// find the source\\n\\t\\tfor(int i=0; i<maze.length; i++) {\\n\\t\\t\\tfor(int j=0; j<maze[0].length; j++) {\\n\\t\\t\\t\\tif(maze[i][j] == 's') {\\n\\t\\t\\t\\t\\tsrcX = i; srcY=j;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tboolean pe = doGridBFS(maze,visited,srcX,srcY);\\n\\t\\tSystem.out.println(pe);\\n\\t\\t\\n\\t}\",\n \"void calculating(int depth);\",\n \"public Maze3D generate(int depth, int row, int column) throws Exception {\\n if (row < 2 || column < 2 || depth < 2)\\n throw new Exception(\\\"Invalid inputs Maze most be at least 2x2x2\\\");\\n Maze3D myMaze = new Maze3D(depth,row, column); //create an empty maze\\n for (int r = 0; r <row ; r++) { //init to 1 all the cells\\n for (int c = 0; c <column ; c++) {\\n for (int d = 0; d < depth; d++) {\\n myMaze.maze[d][r][c]= 1;\\n\\n }\\n }\\n }\\n boolean [][][] VisitedCells = new boolean[depth][row][column]; //create an boolean matrix that saved cell as visited or not\\n int randomDepth = Ran.nextInt((depth)); //select random depth number\\n int randomRow = Ran.nextInt((row)); //select random row number\\n Position3D StartPos = new Position3D(randomDepth,randomRow, 0);\\n myMaze.maze[randomDepth][randomRow][0]= 0; //change selected start position to 0\\n myMaze.setStartPosition(StartPos); //set the start position of the maze\\n changeStatus(randomDepth,randomRow,0,VisitedCells); //change Start position as visited\\n //choose random goal position cell in the maze\\n int randomDepth_2 = Ran.nextInt((depth)); //select random depth number\\n int randomRow_2 = Ran.nextInt((row)); //select random row number\\n Position3D EndPos = new Position3D(randomDepth_2,randomRow_2, (column-1));\\n myMaze.maze[randomDepth_2][randomRow_2][(column-1)]= 0; //change selected goal position to 0\\n myMaze.setGoalPosition(EndPos); //set the start position of the maze\\n changeStatus(randomDepth_2,randomRow_2,(column-1),VisitedCells);//mark as visited\\n stack.push(StartPos);\\n while (!stack.empty()) {\\n Position3D curr = stack.pop();\\n //check if the current cell have any neighbors which have not been visited, and find them all\\n ArrayList<Position3D> neighbors = findNeighbors(curr, myMaze, VisitedCells); //find all options of moving forward\\n if (neighbors.size() > 0) { //iterate over all neighbors\\n stack.push(curr); //push curr into the stack\\n myMaze.maze[curr.getDepthIndex()][curr.getRowIndex()][curr.getColumnIndex()] = 0; //change it's place to 1\\n Position3D Neighbor = ChooseNeighbor(neighbors); //choose one unvisited random neighbor\\n changeStatus(Neighbor.getDepthIndex(),Neighbor.getRowIndex(),Neighbor.getColumnIndex(), VisitedCells); //mark him as visited neighbor\\n removeWall(curr, Neighbor, VisitedCells, myMaze); //remove the wall & mark as visited\\n stack.push(Neighbor);\\n }\\n }\\n //handle odd maze problems - open the walls which surround the goal cell\\n for (int d = EndPos.getDepthIndex()-1; d < EndPos.getDepthIndex()+2; d++) {\\n for (int r = EndPos.getRowIndex()-1; r < EndPos.getRowIndex()+2; r++) {\\n for (int c = EndPos.getColumnIndex()-1; c < EndPos.getColumnIndex()+1; c++) {\\n if (pointOnGrid(d,r,c,myMaze)){\\n myMaze.maze[d][r][c]= 0; //change selected cell to 0\\n changeStatus(d,r,c,VisitedCells);\\n }\\n }}\\n }\\n return myMaze;\\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 \"public void solveMaze( int x0, int y0, int x1, int y1 ) {\\n visited = new boolean[rows+1][cols+1];\\n solve(x0, y0, x1, y1);\\n }\",\n \"private List<Integer> depthFirstSearch(String sequence) {\\r\\n LinkedList<Integer> stack = new LinkedList<Integer>();\\r\\n LinkedList<Integer> wordPos = new LinkedList<Integer>();\\r\\n List<Integer> neighbors = null;\\r\\n //string pos counter\\r\\n int c = 0;\\r\\n int index = -1;\\r\\n //find starting pos\\r\\n for (int i = 0; i < squareDimension * squareDimension; i++) {\\r\\n if (sequence.toUpperCase().startsWith(this.elementAtPos(i))) {\\r\\n this.clearMarks();\\r\\n wordPos.clear();\\r\\n stack.clear();\\r\\n //depth-first search\\r\\n stack.push(i);\\r\\n togglePosMark(i);\\r\\n wordPos = (LinkedList<Integer>) \\r\\n dfsRecursive(stack, sequence.substring(\\r\\n elementAtPos(i).length(), sequence.length())\\r\\n .toUpperCase(), elementAtPos(i).length(), \\r\\n i, sequence.length());\\r\\n if (wordPos.size() != 0) {\\r\\n return wordPos;\\r\\n }\\r\\n }\\r\\n }\\r\\n //no result so return empty list\\r\\n return new LinkedList<Integer>();\\r\\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\\t\\t\\tpublic void run() \\n\\t\\t\\t{\\n\\t\\t\\t\\tif(!(mazeCollection.containsKey(paramArray[0])))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tc.passError(\\\"Maze doesn't exist\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t/*\\n\\t\\t\\t\\t//if solution for this maze exists\\n\\t\\t\\t\\tif(mazeSolutions.containsKey(mazeCollection.get(paramArray[0])))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tc.passSolve(\\\"Solution for \\\"+paramArray[0]+ \\\" is ready\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t*/\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(paramArray[1].toString().equals(\\\"bfs\\\"))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tMazeAdapter ms=new MazeAdapter(mazeCollection.get(paramArray[0]));\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tSearcher<Position> bfs=new BFS<Position>();\\n\\t\\t\\t\\t\\tSolution<Position> sol=bfs.search(ms);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t//check if solution for the maze already exists, if so, replace it with the new one\\n\\t\\t\\t\\t\\tif(mazeSolutions.containsKey(mazeCollection.get(paramArray[0]))) {\\n\\t\\t\\t\\t\\t\\tmazeSolutions.remove(mazeCollection.get(paramArray[0]));\\n\\t\\t\\t\\t\\t\\tmazeSolutions.put(mazeCollection.get(paramArray[0]), sol);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tmazeSolutions.put(mazeCollection.get(paramArray[0]), sol);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tc.passSolve(\\\"Solution for \\\"+paramArray[0]+ \\\" is ready\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if(paramArray[1].toString().equals(\\\"dfs\\\"))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tMazeAdapter ms=new MazeAdapter(mazeCollection.get(paramArray[0]));\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tSearcher<Position> dfs=new DFS<Position>();\\n\\t\\t\\t\\t\\tSolution<Position> sol=dfs.search(ms);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t//check if solution for the maze already exists, if so, replace it with the new one\\n\\t\\t\\t\\t\\tif(mazeSolutions.containsKey(mazeCollection.get(paramArray[0]))) {\\n\\t\\t\\t\\t\\t\\tmazeSolutions.remove(mazeCollection.get(paramArray[0]));\\n\\t\\t\\t\\t\\t\\tmazeSolutions.put(mazeCollection.get(paramArray[0]), sol);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tmazeSolutions.put(mazeCollection.get(paramArray[0]), sol);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tc.passSolve(\\\"Solution for \\\"+paramArray[0]+ \\\" is ready\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tc.passError(\\\"Invalid algorithm\\\");\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t}\",\n \"public boolean search(String word) {\\n return dfs(word, 0, root);\\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 \"private void depthFirstTraversalWithRecursion(final int startPoint, final boolean[] isVerticesVisited) {\\n\\t\\tisVerticesVisited[startPoint] = true;\\n\\t\\tSystem.out.print(startPoint + \\\" \\\");\\n\\t\\tIterator<Integer> edgeIterator = adjacencyList[startPoint].listIterator();\\n\\n\\t\\tint vertice;\\n\\t\\twhile (edgeIterator.hasNext()) {\\n\\t\\t\\tvertice = edgeIterator.next();\\n\\t\\t\\tif (!isVerticesVisited[vertice]) {\\n\\t\\t\\t\\tdepthFirstTraversalWithRecursion(vertice, isVerticesVisited);\\n\\t\\t\\t}\\n\\t\\t}\\n\\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 \"public void BFS() {\\n visitedCells = 1;\\n\\n // Initialize the vertices\\n for (int j = 0; j < maze.getGrid().length; j++) {\\n for (int k = 0; k < maze.getGrid().length; k++) {\\n Cell cell = maze.getGrid()[j][k];\\n cell.setColor(\\\"WHITE\\\");\\n cell.setDistance(0);\\n cell.setParent(null);\\n }\\n }\\n\\n Cell sourceCell = maze.getGrid()[0][0];\\n Cell neighbor = null;\\n Cell currentCell;\\n int distance = 0;\\n\\n // Initialize the source node\\n sourceCell.setColor(\\\"GREY\\\");\\n sourceCell.setDistance(0);\\n sourceCell.setParent(null);\\n\\n queue.add(sourceCell);\\n\\n // Visits each cell until the queue is empty\\n while (!queue.isEmpty()) {\\n currentCell = queue.remove();\\n\\n for (int i = 0; i < currentCell.mazeNeighbors.size(); i++) {\\n neighbor = currentCell.mazeNeighbors.get(i);\\n\\n // Stop the search if you reach the final cell\\n if (neighbor.x == r - 1 && neighbor.y == r - 1) {\\n distance++;\\n if (distance == 10)\\n distance = 0;\\n neighbor.setDistance(distance);\\n neighbor.setParent(currentCell);\\n neighbor.visited = true;\\n visitedCells++;\\n break;\\n }\\n\\n // Checks each neighbor and adds it to the queue if its color is white\\n if (neighbor.getColor().equalsIgnoreCase(\\\"WHITE\\\")) {\\n distance++;\\n if (distance == 10)\\n distance = 0;\\n neighbor.setColor(\\\"GREY\\\");\\n neighbor.setDistance(distance);\\n neighbor.setParent(currentCell);\\n neighbor.visited = true;\\n queue.add(neighbor);\\n visitedCells++;\\n }\\n }\\n // Stop the search if you reach the final cell\\n if (neighbor.x == r - 1 && neighbor.y == r - 1)\\n break;\\n\\n currentCell.setColor(\\\"BLACK\\\");\\n }\\n }\",\n \"public static void userSelection_SolveMaze(int userInputN){\\n\\n\\t\\tint[] S = new int[(int) Math.pow(userInputN, 2)];\\n\\t\\tgNode[] G = new gNode[S.length];\\n\\n\\t\\tboolean [] visited = new boolean[S.length];\\t\\t//Initialize\\n\\t\\tfor(int i=0; i<visited.length;i++)\\n\\t\\t\\tvisited[i] = false;\\n\\n\\t\\tint [] path = new int[S.length];\\t\\t//Initialize \\n\\t\\tfor(int i=0; i<path.length; i++)\\n\\t\\t\\tpath[i]=-1;\\n\\n\\t\\tScanner input = new Scanner(System.in);\\n\\t\\tSystem.out.println(\\\"How would you like to solve the maze?\\\\n\\\"\\n\\t\\t\\t\\t+ \\\"1.\\\\tBreadth-First Search\\\\n\\\"\\n\\t\\t\\t\\t+ \\\"2.\\\\tDepth-First Search\\\\n\\\"\\n\\t\\t\\t\\t+ \\\"3.\\\\tDepth-First Search with Recursion\\\");\\n\\t\\t\\n\\t\\tint ur = input.nextInt();\\n\\t\\t\\n\\t\\tif(ur==1)\\t//Breadth-First Search\\t\\t\\\\///gNode && start @ position 0\\n\\t\\t\\tbfs(G, visited, path, 0);\\n\\t\\telse if(ur==2)\\t//Depth-First Search\\n\\t\\t\\tdfs_Stack(G, visited, path, 0);\\n\\t\\telse if(ur==3)\\t//Depth-First Search w/recursion\\t\\n\\t\\t\\tdfsRecursion(G, visited, path, 0);\\t\\n\\t\\telse{\\n\\t\\t\\tSystem.out.println(\\\"Invalid option. Please enter the appropriate integer value\\\");\\n\\t\\t\\tuserSelection_SolveMaze(userInputN);\\n\\t\\t}\\n\\t\\t\\n\\t\\tinput.close();\\n\\t}\",\n \"int depth();\",\n \"int depth();\",\n \"private void depthFirstSearchIterative(int sourceVertex, List<Integer>[] adjacent, Stack<Integer> finishTimes,\\n boolean[] visited, boolean getFinishTimes) {\\n Stack<Integer> stack = new Stack<>();\\n stack.push(sourceVertex);\\n visited[sourceVertex] = true;\\n\\n if (!getFinishTimes) {\\n sccIds[sourceVertex] = sccCount;\\n }\\n\\n // Used to be able to iterate over each adjacency list, keeping track of which\\n // vertex in each adjacency list needs to be explored next\\n Iterator<Integer>[] adjacentIterators = (Iterator<Integer>[]) new Iterator[adjacent.length];\\n for (int vertexId = 0; vertexId < adjacentIterators.length; vertexId++) {\\n if (adjacent[vertexId] != null) {\\n adjacentIterators[vertexId] = adjacent[vertexId].iterator();\\n }\\n }\\n\\n while (!stack.isEmpty()) {\\n int currentVertex = stack.peek();\\n\\n if (adjacentIterators[currentVertex].hasNext()) {\\n int neighbor = adjacentIterators[currentVertex].next();\\n\\n if (!visited[neighbor]) {\\n stack.push(neighbor);\\n visited[neighbor] = true;\\n }\\n } else {\\n stack.pop();\\n\\n if (getFinishTimes) {\\n finishTimes.push(currentVertex);\\n }\\n }\\n }\\n }\",\n \"static void dfs(int node) {\\n for (int adj : adjList[node]) {\\n if (adj != firstParents[node]) {\\n firstParents[adj] = node;\\n depth[adj] = depth[node] + 1;\\n maxDepth = Math.max(maxDepth, depth[adj]);\\n dfs(adj);\\n }\\n }\\n }\",\n \"public void findTour( int x, int y, int moves )\\n {\\n delay(50); //slow it down enough to be followable\\n if (solved) System.exit(0);\\n\\n //primary base case: tour completed\\n if (moves == (sideLength * sideLength)) {\\n solved = true;\\n }\\n //other base case: stepped off board or onto visited cell\\n if ( board[x][y] != 0 ) {\\n return;\\n }\\n //otherwise, mark current location\\n //and recursively generate tour possibilities from current pos\\n else {\\n board[x][y] = moves;\\n System.out.println(this);\\n delay(10); //uncomment to slow down enough to view\\n\\n /*======================================\\n Recursively try to solve (find tour) from\\n each of knight's available moves.\\n . e . d .\\n f . . . c\\n . . @ . .\\n g . . . b\\n . h . a .\\n ======================================*/\\n // right and down\\n findTour(x + 1, y + 2, moves + 1);\\n // left and down\\n findTour(x - 1, y + 2, moves + 1);\\n // down and right\\n findTour(x + 2, y + 1, moves + 1);\\n // up and left\\n findTour(x - 2, y - 1, moves + 1);\\n // right and up\\n findTour(x + 1, y - 2, moves + 1);\\n // left and up\\n findTour(x - 1, y - 2, moves + 1);\\n // up and right\\n findTour(x + 2, y - 1, moves + 1);\\n // down and left\\n findTour(x - 2, y + 1, moves + 1);\\n\\n //If made it this far, path did not lead to tour, so back up.\\n board[x][y] = 0;\\n System.out.println(this);\\n }\\n }\",\n \"private void createMaze(Tile currentTile) {\\n\\n while (numberOfCellsVisited < CAST_WIDTH * CAST_HEIGHT) {\\n\\n // Get coordinates of current tile and set as visited\\n int currentX = currentTile.getPosition().getX();\\n int currentY = currentTile.getPosition().getY();\\n tempMap[currentY][currentX].setVisited(true);\\n\\n // Begin neighbourhood scan\\n ArrayList<Integer> neighbours = new ArrayList<>();\\n\\n // If a neighbour is not visited and its projected position is within bounds, add it to the list of valid neighbours\\n // North neighbour\\n if (currentY - 1 >= 0) {\\n if (!tempMap[currentY - 1][currentX].isVisited()) //Northern neighbour unvisited\\n neighbours.add(0);\\n }\\n //Southern neighbour\\n if (currentY + 1 < CAST_HEIGHT) { //y index if increased is not greater than height of the chamber\\n if (!tempMap[currentY + 1][currentX].isVisited()) //Northern neighbour unvisited\\n neighbours.add(1);\\n }\\n //Eastern neighbour\\n if (currentX + 1 < CAST_WIDTH) { //check edge case\\n if (!tempMap[currentY][currentX + 1].isVisited()) { //check if visited\\n neighbours.add(2);\\n }\\n }\\n //Western neighbour\\n if (currentX - 1 >= 0) {\\n if (!tempMap[currentY][currentX - 1].isVisited()) {\\n neighbours.add(3);\\n }\\n }\\n if (!neighbours.isEmpty()) {\\n\\n //generate random number between 0 and 3 for direction\\n Random rand = new Random();\\n boolean randomizer;\\n int myDirection;\\n do {\\n myDirection = rand.nextInt(4);\\n randomizer = neighbours.contains(myDirection);\\n } while (!randomizer);\\n\\n //knock down wall\\n switch (myDirection) {\\n case 0 -> { // North\\n tempMap[currentY][currentX].getPathDirection()[0] = true;\\n currentTile = tempMap[currentY - 1][currentX];\\n }\\n case 1 -> { // South\\n tempMap[currentY][currentX].getPathDirection()[1] = true;\\n currentTile = tempMap[currentY + 1][currentX];\\n }\\n case 2 -> { // East\\n tempMap[currentY][currentX].getPathDirection()[2] = true;\\n currentTile = tempMap[currentY][currentX + 1];\\n }\\n case 3 -> { // West\\n tempMap[currentY][currentX].getPathDirection()[3] = true;\\n currentTile = tempMap[currentY][currentX - 1];\\n }\\n }\\n\\n mapStack.push(currentTile);\\n numberOfCellsVisited++;\\n } else {\\n currentTile = mapStack.pop(); //backtrack\\n }\\n }\\n\\n castMaze(tempMap[0][0], -1);\\n }\",\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 \"private boolean DFSUtil(State state, ArrayList<String> visited, int currentDepth) {\\n // Mark the current node as visited and print it\\n visited.add(state.joinValues());\\n\\n this.path.push(state);\\n\\n if (this.problem.goalTest(state)) {\\n return true;\\n }\\n\\n // Recur for all the vertices adjacent to this vertex\\n // extend the current node\\n ListIterator<State> iterator = this.extend(state).listIterator();\\n this.incrementExtendedNumber();\\n while (iterator.hasNext()) {\\n State state1 = iterator.next();\\n if (this.limit > currentDepth) {\\n if (this.graphSearch && !visited.contains(state1.joinValues())) {\\n this.incrementVisitedNumber();\\n if (DFSUtil(state1, visited, currentDepth + 1))\\n return true;\\n else\\n this.path.pop();\\n } else if (!this.graphSearch) {\\n this.incrementVisitedNumber();\\n if (DFSUtil(state1, visited, currentDepth + 1))\\n return true;\\n else\\n this.path.pop();\\n }\\n }\\n\\n\\n this.setMaxMemory(this.path.size());\\n }\\n return false;\\n }\",\n \"private int dfs(int[][] matrix, int i, int j, int d) {\\n if (i < 0 || j < 0 || i == matrix.length || j == matrix[0].length || matrix[i][j] != 0)\\n return 0;\\n if (dp[i][j][d] > 0) return dp[i][j][d];\\n timeComplexityCount++;\\n maxI = Math.max(maxI, i);\\n int res;\\n if (d == 1)\\n res = Math.max(dfs(matrix, i, j + 1, 1), dfs(matrix, i, j + 1, 2));\\n else if (d == 0)\\n res = Math.max(dfs(matrix, i, j - 1, 0), dfs(matrix, i, j - 1, 2));\\n else\\n res = Math.max(dfs(matrix, i + 1, j, 0), Math.max(dfs(matrix, i + 1, j, 1), dfs(matrix, i + 1, j, 2)));\\n dp[i][j][d] = res + 1;\\n return res + 1;\\n }\",\n \"private static void DFS(char grid[][], int row, int col, int ROW, int COL, boolean visited[][]) {\\n\\t\\t// these arrays are used to get row and column numbers of 8 neighbors of a given cell.\\n\\t\\tint rowNum[] = new int[] {-1, -1, -1, 0, 0, 1, 1, 1};\\n\\t\\tint colNum[] = new int[] {-1, 0, 1, -1, 1, -1, 0, 1};\\n\\t\\t\\n\\t\\t// mark this cell as visited\\n\\t\\tvisited[row][col] = true;\\n\\t\\t\\n\\t\\t// recur for all connected neighbors\\n\\t\\tfor (int i = 0; i < 8; i++) {\\n\\t\\t\\tif (isSafe(grid, row+rowNum[i], col+colNum[i], ROW, COL, visited)) {\\n\\t\\t\\t\\tDFS(grid, row+rowNum[i], col+colNum[i], ROW, COL, visited);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"private static void depthFirstSearch(Vertex v, ArrayList<Vertex> visitedArrayList, Graph graph){\\n visitedArrayList.add(v);\\n Iterator<Vertex> iter=graph.getNeighbors(v).iterator();\\n while (iter.hasNext()){\\n Vertex v1=iter.next();\\n if(!visitedArrayList.contains(v1)){\\n depthFirstSearch(v1,visitedArrayList,graph);\\n }\\n }\\n for(Vertex v1 : graph.getNeighbors(v)){\\n if(!visitedArrayList.contains(v1)){\\n depthFirstSearch(v1,visitedArrayList,graph);\\n }\\n }\\n }\",\n \"public int depth ();\",\n \"public DepthFirst(MazePoint[][] cMaze, LinkedList<String> inventoryList, HashMap<Item, ItemValue> availableItemsHashMap)\\n {\\n // initialise instance variables\\n this.cMaze = cMaze;\\n this.inventoryList = inventoryList;\\n this.availableItemsHashMap = availableItemsHashMap;\\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 searchMaze(char[][] maze, int s, int [] k, boolean[][] visited) {\\n\\t\\tint startRow = 0;\\n\\t\\tint startCol = 0;\\n\\t\\t\\n\\t\\touterloop:\\n\\t\\tfor(int row = 0; row < maze.length; row++) {\\n\\t\\t\\tfor(int col = 0; col < maze[0].length; col++) {\\n\\t\\t\\t\\tif(maze[row][col] == '.') {\\n\\t\\t\\t\\t\\tstartRow = row;\\n\\t\\t\\t\\t\\tstartCol = col;\\n\\t\\t\\t\\t\\tbreak outerloop;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tmazeHelper(maze, visited, k, startRow, startCol);\\n\\t\\t\\n\\t\\tfor(int row = 0; row < maze.length; row++) {\\n\\t\\t\\tfor(int col = 0; col < maze[0].length; col++) {\\n\\t\\t\\t\\tif(maze[row][col] == '.' && !visited[row][col]) {\\n\\t\\t\\t\\t\\tmaze[row][col] = 'X';\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tprintMaze(maze);\\n\\t}\",\n \"private ArrayList<Position3D> findNeighbors(Position3D current, Maze3D myMaze,boolean [][][]VisitedCells) throws Exception {\\n ArrayList<Position3D> neighbors = new ArrayList<>();\\n //for each neighbor, add him into the neighbors array, if it's on the grid (maze), if it's not a corner, not the current position itself, and it's unvisited\\n //iterate over all neighbors in the same depth\\n for (int x = current.getRowIndex()-2; x < current.getRowIndex()+3; x=x+2) {\\n for (int y = current.getColumnIndex()-2; y < current.getColumnIndex()+3 ; y=y+2) {\\n if (pointOnGrid(current.getDepthIndex(),x, y, myMaze) && pointNotCorner(current ,current.getDepthIndex(), x, y)\\n && pointNotMyCell(current,current.getDepthIndex(), x, y) && !(Visited(current.getDepthIndex(),x,y,VisitedCells))) {\\n neighbors.add(new Position3D(current.getDepthIndex(),x, y));\\n }\\n }\\n }\\n //check the options from the other depths\\n\\n if (pointOnGrid(current.getDepthIndex()+2,current.getRowIndex(), current.getColumnIndex(), myMaze) && !(Visited(current.getDepthIndex()+2,current.getRowIndex(),current.getColumnIndex(),VisitedCells))){\\n neighbors.add(new Position3D(current.getDepthIndex()+2,current.getRowIndex(), current.getColumnIndex()));\\n }\\n if (pointOnGrid(current.getDepthIndex()-2,current.getRowIndex(), current.getColumnIndex(), myMaze) && !(Visited(current.getDepthIndex()-2,current.getRowIndex(),current.getColumnIndex(),VisitedCells))){\\n neighbors.add(new Position3D(current.getDepthIndex()-2,current.getRowIndex(), current.getColumnIndex()));\\n }\\n return neighbors;\\n }\",\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 boolean solveNext(){\\n Stack<Integer[]> emptyPositions = findEmptyPositions();\\n\\n while (!emptyPositions.isEmpty()) {\\n\\n //get the top empty position from the stack.\\n Integer[] position = emptyPositions.peek();\\n int row = position[0];\\n int col = position[1];\\n\\n for (int value = 1; value <= size; value++) {\\n if (isPositionValid(row, col, value)){\\n\\n //value is valid, we can set it to the board.\\n board[row][col] = value;\\n\\n //recursive backtracking\\n if(solveNext()) {\\n\\n //if the value leads to a solution, pop it from the stack.\\n emptyPositions.pop();\\n return true;\\n }\\n else board[row][col] = 0;\\n\\n }\\n }\\n return false;\\n }\\n return true;\\n }\",\n \"@SuppressWarnings({\\\"rawtypes\\\", \\\"unchecked\\\", \\\"SuspiciousMethodCalls\\\"})\\n private List getDepthFirstTraversal_iterative_usingStack_BigO_VPlusE() throws Exception {\\n Map<Object, Boolean> visited = new LinkedHashMap<>();\\n Stack watchStack = new Stack();\\n\\n V root = data.keySet().stream().findFirst().orElseThrow(() -> new Exception(\\\"Graph is Empty\\\"));\\n watchStack.push(root);\\n visited.put(root, true);\\n\\n while(!watchStack.isEmpty()) {\\n Object currentVertex = watchStack.top();\\n\\n BinarySearchTree<E> edgeTree = data.getOrDefault(currentVertex, new BinarySearchTree<>());\\n List<E> edges = edgeTree.getTreeByInOrder_depthFirst();\\n\\n //Remove an item from the stack when there are no edges or all the edges are visited for that vertex\\n if(edgeTree.isEmpty() || visited.keySet().containsAll(edges)) {\\n watchStack.pop();\\n } else {\\n for(E edge : edges) {\\n if(!visited.containsKey(edge)) {\\n watchStack.push(edge);\\n visited.put(edge, true);\\n break;\\n }\\n }\\n }\\n }\\n return new ArrayList<>(visited.keySet());\\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 \"private static BoardNode startGreedyDepthFirst(int steps, BoardNode node){\\n count = 1;\\n return greedyDepthFirst(steps, node);\\n }\",\n \"public MahjongSolitaireMove findMove()\\n {\\n // MAKE A MOVE TO FILL IN \\n MahjongSolitaireMove move = new MahjongSolitaireMove();\\n\\n // GO THROUGH THE ENTIRE GRID TO FIND A MATCH BETWEEN AVAILABLE TILES\\n for (int i = 0; i < gridColumns; i++)\\n {\\n for (int j = 0; j < gridRows; j++)\\n {\\n ArrayList<MahjongSolitaireTile> stack1 = tileGrid[i][j];\\n if (stack1.size() > 0)\\n {\\n // GET THE FIRST TILE\\n MahjongSolitaireTile testTile1 = stack1.get(stack1.size()-1);\\n for (int k = 0; k < gridColumns; k++)\\n {\\n for (int l = 0; l < gridRows; l++)\\n {\\n if (!((i == k) && (j == l)))\\n { \\n ArrayList<MahjongSolitaireTile> stack2 = tileGrid[k][l];\\n if (stack2.size() > 0) \\n {\\n // AND TEST IT AGAINST THE SECOND TILE\\n MahjongSolitaireTile testTile2 = stack2.get(stack2.size()-1);\\n \\n // DO THEY MATCH\\n if (testTile1.match(testTile2))\\n {\\n // YES, FILL IN THE MOVE AND RETURN IT\\n move.col1 = i;\\n move.row1 = j;\\n move.col2 = k;\\n move.row2 = l;\\n return move;\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n // WE'VE SEARCHED THE ENTIRE GRID AND THERE\\n // ARE NO POSSIBLE MOVES REMAINING\\n return null;\\n }\",\n \"protected boolean solve(int currentRow, int currentColumn) {\\n \\tint currentBlock = m.maze[currentRow][currentColumn];\\t\\t\\t\\t\\t\\t\\t// get the current block that we are on\\r\\n \\t\\r\\n if (m.isBlockEmpty(currentBlock)) {\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// make sure current block is empty\\r\\n \\tm.maze[currentRow][currentColumn] = 2; \\t\\t\\t\\t\\t\\t\\t\\t// add this block to the path as a potential solution\\r\\n repaint();\\r\\n \\r\\n m.blocksTraversed++;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// keep track of how many blocks were traversed over\\r\\n \\r\\n if (currentRow == m.rows-2 && currentColumn == m.columns-2) {\\t\\t\\t\\t// current block is bottom right, path has been found\\r\\n \\tGUI.ta.append(m.blocksTraversed + \\\" blocks were traversed while solving the maze.\\\\n\\\");\\r\\n \\tdouble percentage = (((double) m.blocksTraversed / (m.rows * m.columns))*100) * 2;\\r\\n DecimalFormat f = new DecimalFormat(\\\"##.00\\\");\\r\\n \\tGUI.ta.append(\\\"This results in \\\" + f.format(percentage) + \\\"% of the maze being traveled.\\\\n\\\");\\r\\n \\treturn true;\\r\\n }\\r\\n \\r\\n try { Thread.sleep(1); }\\r\\n catch (InterruptedException e) { }\\r\\n \\r\\n int topBlock = currentRow - 1;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// block directly above the current block\\r\\n int leftBlock = currentColumn - 1;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// block directly left of the current block\\r\\n int bottomBlock = currentRow + 1;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// block directly below the current block\\r\\n int rightBlock = currentColumn + 1;\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// block directly right of the current block\\r\\n \\r\\n if (solve(topBlock, currentColumn) || solve(currentRow, leftBlock) ||\\t\\t// a solution was found\\r\\n \\tsolve(bottomBlock, currentColumn) || solve(currentRow, rightBlock))\\r\\n \\treturn true;\\r\\n \\r\\n m.maze[currentRow][currentColumn] = 4; \\t\\t\\t\\t\\t\\t\\t\\t\\t// no solution from current block so make the block visited instead\\r\\n repaint();\\r\\n \\r\\n synchronized(this) {\\r\\n try { wait(1); }\\r\\n catch (InterruptedException e) { }\\r\\n }\\r\\n }\\r\\n return false;\\r\\n }\",\n \"private Leaf minimax(AI_Domain game,boolean turn,int depth, boolean flag,String path) {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t// if the depth is zero or the game is over,\\r\\n\\t\\t\\t// return the heuristic value of this state\\r\\n\\t\\t\\tif(depth == 0 || game.gameOver()){\\r\\n\\t\\t\\t\\tLeaf L = new Leaf(H.calculateScore(game));\\r\\n\\t\\t\\t\\tL.insertPath(path);\\r\\n\\t\\t\\t\\treturn L;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tArrayList<String> moves = new ArrayList<String>();\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t// get all the possible moves\\r\\n\\t\\t\\tmoves = game.allPossibleMoves(turn);\\r\\n\\r\\n\\t\\t\\tLeaf val;\\r\\n\\t\\t\\tLeaf bestVal = new Leaf(0);\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t// its the maximizing player turn\\r\\n\\t\\t\\tif(turn) {\\r\\n\\t\\t\\t\\t// \\tset the best value to be 0 (minus infinity)\\r\\n\\t\\t\\t\\t\\tbestVal.setValue(0);\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t// for each possible move\\r\\n\\t\\t\\t\\tfor(String str : moves){\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t//create a copy of the given problem\\r\\n\\t\\t\\t\\t\\tAI_Domain copy = game.clone();\\t\\t\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t//execute possible move\\r\\n\\t\\t\\t\\t\\tcopy.executeCommand(str,\\\"MiniMax\\\");\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t// if it's the first enter to the minimax :\\r\\n\\t\\t\\t\\t\\t\\t// set the path of the this root to be the first move that executed\\r\\n\\t\\t\\t\\t\\t\\t// and lead to the next leaves\\r\\n\\t\\t\\t\\t\\t\\tif(flag) {\\r\\n\\t\\t\\t\\t\\t\\t\\tpath = str;\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t//recursive check the best move for the copied problem after executed the move\\r\\n\\t\\t\\t\\t\\t\\t\\tval = minimax(copy,!turn,depth-1,false,path);\\r\\n\\t\\t\\t\\t\\t\\t\\t// set the bestval to be the move that has higher heuristic score\\r\\n\\t\\t\\t\\t\\t\\t\\tif( val.getValue() >= bestVal.getValue())\\r\\n\\t\\t\\t\\t\\t\\t\\t\\tbestVal = val.clone();\\r\\n\\t\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t// not the first time entered to minimax\\r\\n\\t\\t\\t\\t\\t\\telse {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\t//recursive check the best move for the copied problem after executed the move\\r\\n\\t\\t\\t\\t\\t\\t\\tval = minimax(copy,!turn,depth-1,false,path);\\r\\n\\t\\t\\t\\t\\t\\t\\t// set the bestval to be the move that has higher heuristic score\\r\\n\\t\\t\\t\\t\\t\\t\\tif( val.getValue() >= bestVal.getValue())\\r\\n\\t\\t\\t\\t\\t\\t\\tbestVal = val.clone();\\r\\n\\t\\r\\n\\t\\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\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\t// it's the other player turn\\r\\n\\t\\t\\t else { \\r\\n\\t\\t\\t\\t // set the best value to be plus infinity\\r\\n\\t\\t\\t\\t\\tbestVal.setValue(Integer.MAX_VALUE-1);\\r\\n\\t\\t\\t\\t\\tfor(String str : moves){\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t//create a copy of the given problem\\r\\n\\t\\t\\t\\t\\t\\tAI_Domain copy = game.clone();\\r\\n\\t\\t\\t\\t\\t\\t//execute possible move\\r\\n\\t\\t\\t\\t\\t\\tcopy.executeCommand(str,\\\"MiniMax\\\");\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t//recursive check the best move for the copied problem after executed the move\\r\\n\\t\\t\\t\\t\\t\\tval = minimax(copy,!turn,depth-1,false,path);\\r\\n\\t\\t\\t\\t\\t\\t// we assume that the other player will try to maximize his score too\\r\\n\\t\\t\\t\\t\\t\\t//and therefore it will minimize our score\\r\\n\\t\\t\\t\\t\\t\\tif(val.getValue() < bestVal.getValue())\\r\\n\\t\\t\\t\\t\\t\\t bestVal = val.clone();\\r\\n\\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\\treturn bestVal;\\t\\t\\r\\n\\t}\",\n \"Path run(Maze maze, Cell start, Cell finish) {\\n Path path = new Path();\\n if (start.equals(finish)) {\\n path.add(start);\\n return path;\\n }\\n Maze changed = new Maze(maze);\\n CellQueue queue = new CellQueueLinkedListImpl();\\n queue.enqueue(start);\\n changed.setCellValue(start, 0);\\n Cell curCell;\\n do {\\n curCell = queue.dequeue();\\n for (int i = -1; i <= 1; i++) {\\n for (int j = -1; j <= 1; j++) {\\n for (int k = -1; k <= 1; k++) {\\n Cell curNeighbour = new Cell(curCell.x + i, curCell.y + j, curCell.z + k);\\n //check that curNeighbour exists and empty\\n if (changed.getCellValue(curNeighbour) == -1) {\\n changed.setCellValue(curNeighbour, changed.getCellValue(curCell) + 1);\\n queue.enqueue(curNeighbour);\\n }\\n }\\n }\\n }\\n } while (!queue.isEmpty() && !curCell.equals(finish));\\n if (!curCell.equals(finish)) {\\n return path;\\n }\\n while (!curCell.equals(start)) {\\n path.addBegin(curCell);\\n int curPathIndex = changed.getCellValue(curCell);\\n boolean foundPrev = false;\\n for (int i = -1; i <= 1 && !foundPrev; i++) {\\n for (int j = -1; j <= 1 && !foundPrev; j++) {\\n for (int k = -1; k <= 1 && !foundPrev; k++) {\\n Cell curNeighbour = new Cell(curCell.x + i, curCell.y + j, curCell.z + k);\\n if (changed.getCellValue(curNeighbour) == changed.getCellValue(curCell) - 1) {\\n curCell = curNeighbour;\\n foundPrev = true;\\n }\\n }\\n }\\n }\\n }\\n path.addBegin(start);\\n return path;\\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 \"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 findShortestPath() {\\r\\n\\t\\t\\r\\n\\t\\t//Create a circular array that will store the possible next tiles in the different paths.\\r\\n\\t\\tOrderedCircularArray<MapCell> path = new OrderedCircularArray<MapCell>();\\r\\n\\t\\t\\r\\n\\t\\t//Acquire the starting cell.\\r\\n\\t\\tMapCell starting = cityMap.getStart();\\r\\n\\t\\t\\r\\n\\t\\t//This variable is to be updated continuously with the cell with the shortest distance value in the circular array.\\r\\n\\t\\tMapCell current=null;\\r\\n\\t\\t\\r\\n\\t\\t//This variable is to check if the destination has been reached, which is initially false.\\r\\n\\t\\tboolean destination = false;\\r\\n\\t\\t\\r\\n\\t\\t//Add the starting cell into the circular array, and mark it in the list.\\r\\n\\t\\tpath.insert(starting, 0);\\r\\n\\t\\t\\r\\n\\t\\tstarting.markInList(); \\r\\n\\t\\t\\r\\n\\t\\ttry {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//As long as the circular array isn't empty, and the destination hasn't been reached, run this loop.\\r\\n\\t\\t\\twhile(!path.isEmpty()&&!destination) {\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t//Take the cell with the shortest distance out of the circular array, and mark it accordingly.\\r\\n\\t\\t\\t\\tcurrent = path.getSmallest();\\r\\n\\t\\t\\t\\tcurrent.markOutList();\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tMapCell next;\\r\\n\\t\\t\\t\\tint distance;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif(current.isDestination()) {\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tdestination = true; //If the current cell is the destination, end the loop.\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tnext = nextCell(current); //Acquire the next possible neighbour of the current cell.\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t//Don't run if next is null, meaning there is no other possible neighbour in the path for the current cell.\\r\\n\\t\\t\\t\\t\\twhile(next!=null) {\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tdistance = current.getDistanceToStart() + 1;\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t//If the distance of the selected neighbouring cell is currently more than 1 more than the current cell's \\r\\n\\t\\t\\t\\t\\t\\t//distance, update the distance of the neighbouring cell. Then, set the current cell as its predecessor.\\r\\n\\t\\t\\t\\t\\t\\tif(next.getDistanceToStart()>distance) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tnext.setDistanceToStart(distance);\\r\\n\\t\\t\\t\\t\\t\\t\\tnext.setPredecessor(current);\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tdistance = next.getDistanceToStart(); \\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tif(next.isMarkedInList() && distance<path.getValue(next)) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tpath.changeValue(next, distance); //If the neighbouring cell is in the circular array, but with a \\r\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t //larger distance value than the new updated distance, change its value.\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t} else if(!next.isMarkedInList()){\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tpath.insert(next, distance); //If the neighbouring cell isn't in the circular array, add it in.\\r\\n\\t\\t\\t\\t\\t\\t\\tnext.markInList();\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tnext = nextCell(current); //Look for the next possible neighbour, if any.\\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}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//Catch all the possible exceptions that might be thrown by the method calls. Print the appropriate messages.\\r\\n\\t\\t} catch (EmptyListException e) {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tSystem.out.println(e.getMessage());\\r\\n\\t\\t\\tSystem.out.println(\\\"Path finding execution stopped.\\\");\\r\\n\\t\\t\\t\\r\\n\\t\\t} catch (InvalidNeighbourIndexException e) {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tSystem.out.println(\\\"The program tried to access an invalid neighbour of a tile.\\\");\\r\\n\\t\\t\\tSystem.out.println(\\\"Path finding execution stopped.\\\");\\r\\n\\t\\t\\t\\r\\n\\t\\t} catch (InvalidDataItemException e) {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tSystem.out.println(e.getMessage());\\r\\n\\t\\t\\tSystem.out.println(\\\"Path finding execution stopped.\\\");\\r\\n\\t\\t\\t\\r\\n\\t\\t} catch (Exception e) {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tSystem.out.println(e.getMessage()+\\\" Path finding execution has stopped.\\\");\\r\\n\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\t//If a path was found, print the number of tiles in the path.\\r\\n\\t\\tif(destination) {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tSystem.out.println(\\\"Number of tiles in path: \\\" + (current.getDistanceToStart()+1));\\r\\n\\t\\t\\t\\r\\n\\t\\t} else {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tSystem.out.println(\\\"No path found.\\\"); //Otherwise, indicate that a path wasn't found.\\r\\n\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t}\",\n \"private ArrayList<Vertex> dfs(boolean[] visited, Vertex start, Vertex target) {\\n \\n //TEST VALUES: if start/end are out of bounds of array of vertices\\n if (start.getID() < 0) {\\n return null;\\n }\\n \\n if (target.getID() > arrayOfVertices.length) {\\n return null;\\n }\\n \\n \\n //base case: if start = target, return start vertex right there.\\n if (start == target) {\\n solution.add(0, start);\\n return solution;\\n }\\n \\n //has this vertex been visited before? yes? then just return. if no, \\n if (visited[start.getID()]) {\\n return null;\\n }\\n \\n //since it hasn't been visited before, mark it as visited\\n visited[start.getID()] = true;\\n \\n //does it have kids? no? return.\\n if (start.getDegree() == 0) {\\n return null;\\n }\\n \\n //create ArrayList of adjacent vertices to the given start\\n ArrayList<Vertex> adjacents = start.getAdjacent();\\n \\n //go through its edges, for loop. to go through edges\\n for (int i = 0; i < start.getDegree(); i++) {\\n \\n //(from testing)\\n NavigateMaze.advance(start.getID(), adjacents.get(i).getID());\\n \\n //do the dfs; if it's not equal to null \\n //(i.e. we found the target, then add it to path\\n if (dfs(visited, adjacents.get(i), target) != null) {\\n //then add to path\\n solution.add(0, start); \\n return solution;\\n }\\n \\n //(from testing)\\n else {\\n NavigateMaze.backtrack(adjacents.get(i).getID(), start.getID());\\n }\\n \\n } \\n \\n //return null\\n return null;\\n }\",\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 \"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 \"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 \"private boolean solve(int i, int j, int pos, int[][] cells) {\\n\\t\\tif (i == 9) {\\n\\t\\t\\ti = 0;\\n\\t\\t\\tif (++j == 9)\\n\\t\\t\\t\\treturn true;\\n\\t\\t}\\n\\t\\tif (cells[i][j] != 0) // Skip filled cells\\n\\t\\t\\treturn solve(i + 1, j, pos, cells);\\n\\n\\t\\tfor (int k = 1; k <= 9; k++) {\\n\\t\\t\\tint val = k + pos;\\n\\t\\t\\tif (val > 9) {\\n\\t\\t\\t\\tval = val - 9;\\n\\t\\t\\t}\\n\\t\\t\\tif (legal(i, j, val, cells)) {\\n\\t\\t\\t\\tcells[i][j] = val;\\n\\t\\t\\t\\tif (solve(i + 1, j, pos, cells))\\n\\t\\t\\t\\t\\treturn true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcells[i][j] = 0; // Reset on backtrack\\n\\t\\treturn false;\\n\\t}\",\n \"private Stack<MapLocation> findPath(State.StateView state)\\n {\\n Unit.UnitView townhallUnit = state.getUnit(townhallID);\\n Unit.UnitView footmanUnit = state.getUnit(footmanID);\\n \\n MapLocation startLoc = new MapLocation(footmanUnit.getXPosition(), footmanUnit.getYPosition(), null, 0);\\n \\n MapLocation goalLoc = new MapLocation(townhallUnit.getXPosition(), townhallUnit.getYPosition(), null, 0);\\n \\n MapLocation footmanLoc = null;\\n if(enemyFootmanID != -1) {\\n Unit.UnitView enemyFootmanUnit = state.getUnit(enemyFootmanID);\\n footmanLoc = new MapLocation(enemyFootmanUnit.getXPosition(), enemyFootmanUnit.getYPosition(), null, 0);\\n }\\n \\n // get resource locations\\n List<Integer> resourceIDs = state.getAllResourceIds();\\n Set<MapLocation> resourceLocations = new HashSet<MapLocation>();\\n for(Integer resourceID : resourceIDs)\\n {\\n ResourceNode.ResourceView resource = state.getResourceNode(resourceID);\\n \\n resourceLocations.add(new MapLocation(resource.getXPosition(), resource.getYPosition(), null, 0));\\n }\\n \\n return AstarSearch(startLoc, goalLoc, state.getXExtent(), state.getYExtent(), footmanLoc, resourceLocations);\\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 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 \"private static List<Move> pathSolve(Level level){\\n\\t\\tOptimisticMap optMap = new OptimisticMap(level);\\n\\t\\t\\n\\t\\tPoint dst = level.getExitPos();\\n\\t\\t\\n\\t\\t// Open nodes\\n\\t\\tSortedMap<Integer, List<SolveNode>> nodes = new TreeMap<Integer, List<SolveNode>>();\\n\\t\\t\\n\\t\\t// Current costs to arrive to solve nodes\\n\\t\\tint[][][] arrived = new int[level.getMapSize().x][level.getMapSize().y][Move.values().length];\\n\\t\\tfor ( int x = 0 ; x < level.getMapSize().x ; x++ ){\\n\\t\\t\\tfor ( int y = 0 ; y < level.getMapSize().y ; y++ ){\\n\\t\\t\\t\\tfor ( int d = 0 ; d < Move.values().length ; d++ ){\\n\\t\\t\\t\\t\\tarrived[x][y][d] = Integer.MAX_VALUE;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t// Create initial nodes\\n\\t\\t{\\n\\t\\t\\tPoint box = level.getBoxPos();\\n\\t\\t\\tPoint player = level.getPlayerPos();\\n\\t\\t\\tfor ( Move dir : Move.values()){\\n\\t\\t\\t\\tPoint playerDst = dir.nextPosition(box);\\n\\t\\t\\t\\tif ( level.isClearSafe(playerDst.x, playerDst.y)){\\n\\t\\t\\t\\t\\tList<Move> pathNoDesiredPlayerPosition = pathTo(level, player, box, playerDst);\\n\\t\\t\\t\\t\\tif ( pathNoDesiredPlayerPosition != null ){\\n\\t\\t\\t\\t\\t\\tSolveNode node = new SolveNode();\\n\\t\\t\\t\\t\\t\\tnode.moves = pathNoDesiredPlayerPosition;\\n\\t\\t\\t\\t\\t\\tnode.box = (Point)box.clone();\\n\\t\\t\\t\\t\\t\\tnode.playerDir = dir;\\n\\t\\t\\t\\t\\t\\taddSolveNode(nodes, node, node.moves.size() + optMap.getValue(node.box.x, node.box.y));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\twhile ( nodes.isEmpty() == false ){\\n\\t\\t\\t// Get node to process\\n\\t\\t\\tSolveNode node = removeSolveNode(nodes);\\n\\t\\t\\tif ( node.box.equals(dst) ){\\n\\t\\t\\t\\t// This is the best solution\\n\\t\\t\\t\\treturn node.moves;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t// Create new nodes trying to move the box in each direction\\n\\t\\t\\tfor ( Move dir : Move.values() ){\\n\\t\\t\\t\\tSolveNode newNode = new SolveNode();\\n\\t\\t\\t\\tnewNode.box = dir.nextPosition(node.box);\\n\\t\\t\\t\\tnewNode.playerDir = dir.opposite();\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// First check if the box can be moved to that position (is clear)\\n\\t\\t\\t\\tif ( level.isClearSafe(newNode.box.x, newNode.box.y) == false ){\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Check if the player can move to the pushing position\\n\\t\\t\\t\\tPoint player = node.playerDir.nextPosition(node.box);\\n\\t\\t\\t\\tPoint playerDst = dir.opposite().nextPosition(node.box);\\n\\t\\t\\t\\tList<Move> playerMoves = pathTo(level, player, node.box, playerDst);\\n\\t\\t\\t\\tif ( playerMoves == null ){\\n\\t\\t\\t\\t\\t// The player can't move itself to the pushing position\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Check if the cost to arrive to the new node is less that the previous known\\n\\t\\t\\t\\tif ( node.moves.size() + playerMoves.size() + 1 >= arrived[newNode.box.x][newNode.box.y][dir.index()] ){\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tSystem.out.println(\\\"\\\" + newNode.box.x + \\\" \\\" + newNode.box.y);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Add the new node to the open nodes\\n\\t\\t\\t\\tnewNode.moves.addAll(node.moves);\\n\\t\\t\\t\\tnewNode.moves.addAll(playerMoves);\\n\\t\\t\\t\\tnewNode.moves.add(dir);\\n\\t\\t\\t\\taddSolveNode(nodes, newNode, newNode.moves.size() + optMap.getValue(newNode.box.x, newNode.box.y));\\n\\t\\t\\t\\tarrived[newNode.box.x][newNode.box.y][dir.index()] = newNode.moves.size();\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t// There is no solution\\n\\t\\treturn null;\\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 \"public boolean solveMaze(char[][] maze, int row, int col) {\\n if (row < 0 || row >= maze.length) {\\r\\n return false;\\r\\n }\\r\\n // Not even in the maze\\r\\n if (col < 0 || col >= maze.length) {\\r\\n return false;\\r\\n }\\r\\n // Can't move to this spot(Hit a wall and hit a spot that it has already been to)\\r\\n if (maze[row][col] == 'X' || maze[row][col] == '+') {\\r\\n return false;\\r\\n }\\r\\n // Winning condition: Found the exit\\r\\n if (maze[row][col] == 'E') {\\r\\n // Found the exit\\r\\n return true;\\r\\n }\\r\\n\\r\\n // Mark spot as visited\\r\\n maze[row][col] = '+';\\r\\n // Try north\\r\\n // Try path with new row, if successful, then it is done\\r\\n if (solveMaze(maze, row - 1, col)) {\\r\\n return true;\\r\\n }\\r\\n\\r\\n // Try east\\r\\n if (solveMaze(maze, row, col + 1)) {\\r\\n return true;\\r\\n }\\r\\n\\r\\n // Try south\\r\\n if (solveMaze(maze, row + 1, col)) {\\r\\n return true;\\r\\n }\\r\\n\\r\\n // Try west\\r\\n if (solveMaze(maze, row, col - 1)) {\\r\\n return true;\\r\\n }\\r\\n\\r\\n // Tried every direction = NO GOOD!\\r\\n // \\\"Unvisit\\\" the spot\\r\\n maze[row][col] = '.';\\r\\n return false;\\r\\n\\r\\n }\",\n \"private void findPath()\\n\\t{\\n\\t\\tpathfinding = true;\\n\\n\\t\\tmoves = Pathfinder.calcOneWayMove(city.getDrivingMap(), x, y, destX, destY);\\n\\t\\tpathfinding = false;\\n\\t}\",\n \"public void solve(int startX, int startY, int endX, int endY) {\\r\\n // re-inicializar células para encontrar o caminho\\r\\n for (Cell[] cellrow : this.cells) {\\r\\n for (Cell cell : cellrow) {\\r\\n cell.parent = null;\\r\\n cell.visited = false;\\r\\n cell.inPath = false;\\r\\n cell.travelled = 0;\\r\\n cell.projectedDist = -1;\\r\\n }\\r\\n }\\r\\n // células ainda estão sendo consideradas\\r\\n ArrayList<Cell> openCells = new ArrayList<>();\\r\\n // célula sendo considerada\\r\\n Cell endCell = getCell(endX, endY);\\r\\n if (endCell == null) return; // saia se terminar fora dos limites\\r\\n { // bloco anônimo para excluir o início, porque não usado posteriormente\\r\\n Cell start = getCell(startX, startY);\\r\\n if (start == null) return; // saia se começar fora dos limites\\r\\n start.projectedDist = getProjectedDistance(start, 0, endCell);\\r\\n start.visited = true;\\r\\n openCells.add(start);\\r\\n }\\r\\n boolean solving = true;\\r\\n while (solving) {\\r\\n if (openCells.isEmpty()) return; // sair, nenhum caminho\\r\\n // classifique openCells de acordo com a menor distância projetada\\r\\n Collections.sort(openCells, new Comparator<Cell>() {\\r\\n @Override\\r\\n public int compare(Cell cell1, Cell cell2) {\\r\\n double diff = cell1.projectedDist - cell2.projectedDist;\\r\\n if (diff > 0) return 1;\\r\\n else if (diff < 0) return -1;\\r\\n else return 0;\\r\\n }\\r\\n });\\r\\n Cell current = openCells.remove(0); // célula pop menos projetada\\r\\n if (current == endCell) break; // no final\\r\\n for (Cell neighbor : current.neighbors) {\\r\\n double projDist = getProjectedDistance(neighbor,\\r\\n current.travelled + 1, endCell);\\r\\n if (!neighbor.visited || // ainda não visitado\\r\\n projDist < neighbor.projectedDist) { // melhor caminho\\r\\n neighbor.parent = current;\\r\\n neighbor.visited = true;\\r\\n neighbor.projectedDist = projDist;\\r\\n neighbor.travelled = current.travelled + 1;\\r\\n if (!openCells.contains(neighbor))\\r\\n openCells.add(neighbor);\\r\\n }\\r\\n }\\r\\n }\\r\\n // criar caminho do fim ao começo\\r\\n Cell backtracking = endCell;\\r\\n backtracking.inPath = true;\\r\\n while (backtracking.parent != null) {\\r\\n backtracking = backtracking.parent;\\r\\n backtracking.inPath = true;\\r\\n }\\r\\n }\",\n \"private boolean computeSearchDirection() {\\n\\t\\t// Compute the function's gradient\\n\\t\\tfunction.computeGradient(temp0_Nx1.data);\\n\\n\\t\\t// compute the change in gradient\\n\\t\\tfor( int i = 0; i < N; i++ ) {\\n\\t\\t\\ty.data[i] = temp0_Nx1.data[i] - g.data[i];\\n\\t\\t\\tg.data[i] = temp0_Nx1.data[i];\\n\\t\\t}\\n\\n\\t\\t// Update the inverse Hessian matrix\\n\\t\\tif( iterations != 0 ) {\\n\\t\\t\\tEquationsBFGS.inverseUpdate(B, s, y, temp0_Nx1, temp1_Nx1);\\n\\t\\t}\\n\\n\\t\\t// compute the search direction\\n\\t\\tCommonOps_DDRM.mult(-1,B,g, searchVector);\\n\\n\\t\\t// use the line search to find the next x\\n\\t\\tif( !setupLineSearch(fx, x.data, g.data, searchVector.data) ) {\\n\\t\\t\\t// the search direction has a positive derivative, meaning the B matrix is\\n\\t\\t\\t// no longer SPD. Attempt to fix the situation by resetting the matrix\\n\\t\\t\\tresetMatrixB();\\n\\t\\t\\t// do the search again, it can't fail this time\\n\\t\\t\\tCommonOps_DDRM.mult(-1,B,g, searchVector);\\n\\t\\t\\tsetupLineSearch(fx, x.data, g.data, searchVector.data);\\n\\t\\t} else if(Math.abs(derivAtZero) <= gtol ) {\\n\\t\\t\\tif( verbose != null ) {\\n\\t\\t\\t\\tverbose.printf(\\\"finished select direction, gtest=%e\\\\n\\\",Math.abs(derivAtZero));\\n\\t\\t\\t}\\n\\n\\t\\t\\t// the input might have been modified by the function. So copy it\\n\\t\\t\\tSystem.arraycopy(function.getCurrentState(),0,x.data,0,N);\\n\\t\\t\\treturn terminateSearch(true);\\n\\t\\t}\\n\\n\\t\\tmode = 1;\\n\\t\\titerations++;\\n\\t\\treturn false;\\n\\t}\",\n \"boolean dfs(char[][] board, boolean[][] visited, int i, int j,String word, int k) {\\n\\t\\t if(k==word.length()) return true;\\n\\t\\t if(i<0||i>=board.length||j<0||j>=board[0].length) return false;\\n\\t\\t if(visited[i][j]) return false;\\n\\t\\t if(board[i][j]!=word.charAt(k)) return false;\\n\\t\\t \\n\\t\\t visited[i][j]=true;\\n\\t\\t if(dfs(board,visited,i-1,j,word,k+1)) return true;\\n\\t\\t if(dfs(board,visited,i+1,j,word,k+1)) return true;\\n\\t\\t if(dfs(board,visited,i,j-1,word,k+1)) return true;\\n\\t\\t if(dfs(board,visited,i,j+1,word,k+1)) return true;\\n\\t\\t visited[i][j]=false;\\n\\t\\t \\n\\t\\treturn false;\\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]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.77325815","0.70551914","0.66099834","0.65396774","0.6525591","0.65224016","0.6522038","0.6472017","0.6225173","0.6196449","0.61605406","0.6159167","0.61326563","0.60578203","0.5946599","0.5934834","0.5925713","0.5921992","0.58562595","0.5850952","0.5847626","0.58440363","0.5840728","0.58390063","0.57975745","0.5765805","0.57526416","0.57452244","0.573991","0.5692972","0.56643784","0.5663559","0.56584996","0.5657368","0.56518173","0.5639061","0.5637916","0.5629584","0.5605207","0.5561465","0.55591094","0.5519785","0.55173755","0.5515493","0.5509387","0.550531","0.55052185","0.55041385","0.54990065","0.54856145","0.54700047","0.5467785","0.54640293","0.5453315","0.54450846","0.5441762","0.5420691","0.54191864","0.54191864","0.54173416","0.5405437","0.53886443","0.5387446","0.53794986","0.5374481","0.53722733","0.5365681","0.53633046","0.5362012","0.5354891","0.5352838","0.53474605","0.53473705","0.534637","0.5344889","0.5334043","0.53240114","0.53220433","0.5319138","0.5312474","0.53077024","0.5300167","0.5285207","0.52646095","0.5264072","0.5263659","0.52597314","0.5258376","0.52489144","0.5246006","0.52444386","0.5242864","0.52414036","0.5236557","0.52348304","0.52341545","0.52169687","0.5214072","0.52072597","0.5203623","0.5202534"],"string":"[\n \"0.77325815\",\n \"0.70551914\",\n \"0.66099834\",\n \"0.65396774\",\n \"0.6525591\",\n \"0.65224016\",\n \"0.6522038\",\n \"0.6472017\",\n \"0.6225173\",\n \"0.6196449\",\n \"0.61605406\",\n \"0.6159167\",\n \"0.61326563\",\n \"0.60578203\",\n \"0.5946599\",\n \"0.5934834\",\n \"0.5925713\",\n \"0.5921992\",\n \"0.58562595\",\n \"0.5850952\",\n \"0.5847626\",\n \"0.58440363\",\n \"0.5840728\",\n \"0.58390063\",\n \"0.57975745\",\n \"0.5765805\",\n \"0.57526416\",\n \"0.57452244\",\n \"0.573991\",\n \"0.5692972\",\n \"0.56643784\",\n \"0.5663559\",\n \"0.56584996\",\n \"0.5657368\",\n \"0.56518173\",\n \"0.5639061\",\n \"0.5637916\",\n \"0.5629584\",\n \"0.5605207\",\n \"0.5561465\",\n \"0.55591094\",\n \"0.5519785\",\n \"0.55173755\",\n \"0.5515493\",\n \"0.5509387\",\n \"0.550531\",\n \"0.55052185\",\n \"0.55041385\",\n \"0.54990065\",\n \"0.54856145\",\n \"0.54700047\",\n \"0.5467785\",\n \"0.54640293\",\n \"0.5453315\",\n \"0.54450846\",\n \"0.5441762\",\n \"0.5420691\",\n \"0.54191864\",\n \"0.54191864\",\n \"0.54173416\",\n \"0.5405437\",\n \"0.53886443\",\n \"0.5387446\",\n \"0.53794986\",\n \"0.5374481\",\n \"0.53722733\",\n \"0.5365681\",\n \"0.53633046\",\n \"0.5362012\",\n \"0.5354891\",\n \"0.5352838\",\n \"0.53474605\",\n \"0.53473705\",\n \"0.534637\",\n \"0.5344889\",\n \"0.5334043\",\n \"0.53240114\",\n \"0.53220433\",\n \"0.5319138\",\n \"0.5312474\",\n \"0.53077024\",\n \"0.5300167\",\n \"0.5285207\",\n \"0.52646095\",\n \"0.5264072\",\n \"0.5263659\",\n \"0.52597314\",\n \"0.5258376\",\n \"0.52489144\",\n \"0.5246006\",\n \"0.52444386\",\n \"0.5242864\",\n \"0.52414036\",\n \"0.5236557\",\n \"0.52348304\",\n \"0.52341545\",\n \"0.52169687\",\n \"0.5214072\",\n \"0.52072597\",\n \"0.5203623\",\n \"0.5202534\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":38186,"cells":{"query":{"kind":"string","value":"METHOD 10: ADJACENCY LIST This method will create the adjacency list based on the graph"},"document":{"kind":"string","value":"public static void buildAdjacencyList(Maze m, int n){\n\n\t\tint mazeSize = n*n;\n\t\tgNode[] AL = new gNode[mazeSize]; \n\t\tfor(int i=0; i<AL.length-1; i++){\n\n\t\t\t//for the right and left walls\n\t\t\tif(!(i%AL.length == n-1)){\n\t\t\t\tif(m.check_wall(i, i+1, 'r') == false){\n\t\t\t\t\tAL[i] = new gNode(i+1, AL[i]);\n\t\t\t\t}\n\t\t\t}\n\n\n\t\t\t//for the upper and bottom walls (just to avoid another for-loop)\n\t\t\tif(i < AL.length-n){\n\t\t\t\tif(m.check_wall(i, i+n, 'u') == false){\n\t\t\t\t\tAL[i] = new gNode(i+n, AL[i]);\n\t\t\t\t}\n\n\t\t\t}\n\t\t}\n\n\t\tfor(int j=0; j<AL.length; j++){\n\t\t\tSystem.out.println(\"VERTEX \"+j);\n\t\t\tfor(gNode t= AL[j]; t!=null; t=t.dest){\n\t\t\t\tSystem.out.println(t.item);\n\t\t\t}\n\t\t}\n\n\n\t}"},"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":["ArrayList<Edge> getAdjacencies();","private List<Vertex> prepareGraphAdjacencyList() {\n\n\t\tList<Vertex> graph = new ArrayList<Vertex>();\n\t\tVertex vertexA = new Vertex(\"A\");\n\t\tVertex vertexB = new Vertex(\"B\");\n\t\tVertex vertexC = new Vertex(\"C\");\n\t\tVertex vertexD = new Vertex(\"D\");\n\t\tVertex vertexE = new Vertex(\"E\");\n\t\tVertex vertexF = new Vertex(\"F\");\n\t\tVertex vertexG = new Vertex(\"G\");\n\n\t\tList<Edge> edges = new ArrayList<Edge>();\n\t\tedges.add(new Edge(vertexB, 2));\n\t\tedges.add(new Edge(vertexD, 6));\n\t\tedges.add(new Edge(vertexF, 5));\n\t\tvertexA.incidentEdges = edges;\n\n\t\tedges = new ArrayList<Edge>();\n\t\tedges.add(new Edge(vertexA, 2));\n\t\tedges.add(new Edge(vertexC, 7));\n\t\tvertexB.incidentEdges = edges;\n\n\t\tedges = new ArrayList<Edge>();\n\t\tedges.add(new Edge(vertexB, 7));\n\t\tedges.add(new Edge(vertexD, 9));\n\t\tedges.add(new Edge(vertexF, 1));\n\t\tvertexC.incidentEdges = edges;\n\n\t\tedges = new ArrayList<Edge>();\n\t\tedges.add(new Edge(vertexA, 6));\n\t\tedges.add(new Edge(vertexC, 9));\n\t\tedges.add(new Edge(vertexE, 4));\n\t\tedges.add(new Edge(vertexG, 8));\n\t\tvertexD.incidentEdges = edges;\n\n\t\tedges = new ArrayList<Edge>();\n\t\tedges.add(new Edge(vertexD, 4));\n\t\tedges.add(new Edge(vertexF, 3));\n\t\tvertexE.incidentEdges = edges;\n\n\t\tedges = new ArrayList<Edge>();\n\t\tedges.add(new Edge(vertexA, 5));\n\t\tedges.add(new Edge(vertexC, 1));\n\t\tedges.add(new Edge(vertexE, 3));\n\t\tvertexF.incidentEdges = edges;\n\n\t\tedges = new ArrayList<Edge>();\n\t\tedges.add(new Edge(vertexD, 8));\n\t\tvertexG.incidentEdges = edges;\n\n\t\tgraph.add(vertexA);\n\t\tgraph.add(vertexB);\n\t\tgraph.add(vertexC);\n\t\tgraph.add(vertexD);\n\t\tgraph.add(vertexE);\n\t\tgraph.add(vertexF);\n\t\tgraph.add(vertexG);\n\n\t\treturn graph;\n\t}","public DoublyLinkedList getAdjacencyList()\n \t{\n\t return adjacencyList ;\n \t}","public ArrayList<Edge> getAdjacencies(){\r\n return adjacencies;\r\n }","public static strictfp void main(String... args) {\n\t\tArrayList<Vertex> graph = new ArrayList<>();\r\n\t\tHashMap<Character, Vertex> map = new HashMap<>();\r\n\t\t// add vertices\r\n\t\tfor (char c = 'a'; c <= 'i'; c++) {\r\n\t\t\tVertex v = new Vertex(c);\r\n\t\t\tgraph.add(v);\r\n\t\t\tmap.put(c, v);\r\n\t\t}\r\n\t\t// add edges\r\n\t\tfor (Vertex v: graph) {\r\n\t\t\tif (v.getNodeId() == 'a') {\r\n\t\t\t\tv.getAdjacents().add(map.get('b'));\r\n\t\t\t\tv.getAdjacents().add(map.get('h'));\r\n\t\t\t} else if (v.getNodeId() == 'b') {\r\n\t\t\t\tv.getAdjacents().add(map.get('a'));\r\n\t\t\t\tv.getAdjacents().add(map.get('c'));\r\n\t\t\t\tv.getAdjacents().add(map.get('h'));\r\n\t\t\t} else if (v.getNodeId() == 'c') {\r\n\t\t\t\tv.getAdjacents().add(map.get('b'));\r\n\t\t\t\tv.getAdjacents().add(map.get('d'));\r\n\t\t\t\tv.getAdjacents().add(map.get('f'));\r\n\t\t\t\tv.getAdjacents().add(map.get('i'));\r\n\t\t\t} else if (v.getNodeId() == 'd') {\r\n\t\t\t\tv.getAdjacents().add(map.get('c'));\r\n\t\t\t\tv.getAdjacents().add(map.get('e'));\r\n\t\t\t\tv.getAdjacents().add(map.get('f'));\r\n\t\t\t} else if (v.getNodeId() == 'e') {\r\n\t\t\t\tv.getAdjacents().add(map.get('d'));\r\n\t\t\t\tv.getAdjacents().add(map.get('f'));\r\n\t\t\t} else if (v.getNodeId() == 'f') {\r\n\t\t\t\tv.getAdjacents().add(map.get('c'));\r\n\t\t\t\tv.getAdjacents().add(map.get('d'));\r\n\t\t\t\tv.getAdjacents().add(map.get('e'));\r\n\t\t\t\tv.getAdjacents().add(map.get('g'));\r\n\t\t\t} else if (v.getNodeId() == 'g') {\r\n\t\t\t\tv.getAdjacents().add(map.get('f'));\r\n\t\t\t\tv.getAdjacents().add(map.get('h'));\r\n\t\t\t\tv.getAdjacents().add(map.get('i'));\r\n\t\t\t} else if (v.getNodeId() == 'h') {\r\n\t\t\t\tv.getAdjacents().add(map.get('a'));\r\n\t\t\t\tv.getAdjacents().add(map.get('b'));\r\n\t\t\t\tv.getAdjacents().add(map.get('g'));\r\n\t\t\t\tv.getAdjacents().add(map.get('i'));\r\n\t\t\t} else if (v.getNodeId() == 'i') {\r\n\t\t\t\tv.getAdjacents().add(map.get('c'));\r\n\t\t\t\tv.getAdjacents().add(map.get('g'));\r\n\t\t\t\tv.getAdjacents().add(map.get('h'));\r\n\t\t\t}\t\r\n\t\t}\r\n\t\t// graph created\r\n\t\t// create disjoint sets\r\n\t\tDisjointSet S = null, V_S = null;\r\n\t\tfor (Vertex v: graph) {\r\n\t\t\tchar c = v.getNodeId();\r\n\t\t\tif (c == 'a' || c == 'b' || c == 'd' || c == 'e') {\r\n\t\t\t\tif (S == null) {\r\n\t\t\t\t\tS = v.getDisjointSet();\r\n\t\t\t\t} else {\r\n\t\t\t\t\tDisjointSet set = DisjointSet.union(S, v.getDisjointSet());\r\n\t\t\t\t\tv.setDisjointSet(set);\r\n\t\t\t\t}\r\n\t\t\t} else {\r\n\t\t\t\tif (V_S == null) {\r\n\t\t\t\t\tV_S = v.getDisjointSet();\r\n\t\t\t\t} else {\r\n\t\t\t\t\tDisjointSet set = DisjointSet.union(V_S, v.getDisjointSet());\r\n\t\t\t\t\tv.setDisjointSet(set);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t\t// Disjoint sets created\r\n\t\tfor (Vertex u: graph) {\r\n\t\t\tfor (Vertex v: u.getAdjacents()) {\r\n\t\t\t\tif (DisjointSet.findSet((DisjointSet) u.getDisjointSet()) == \r\n\t\t\t\t DisjointSet.findSet((DisjointSet) v.getDisjointSet())) {\r\n\t\t\t\t\tSystem.out.println(\"The cut respects (\" + u.getNodeId() + \", \" + v.getNodeId() + \").\");\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}","public ArrayList<ChessCoordinate> getAdjacencyList() {\n\t\tint dx, dy;\n\t\tArrayList<ChessCoordinate> adjacencyList = new ArrayList<ChessCoordinate>();\n\n\t\tfor (dx = -1; dx <= 1; dx++) {\n\t\t\tfor (dy = -1; dy <= 1; dy++) {\n\t\t\t\tif (dx == dy) {\n\t\t\t\t\tcontinue;\n\t\t\t\t} else {\n\t\t\t\t\tadjacencyList.add(StandardCoordinate.make(x + dx, y + dy));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn adjacencyList;\n\t}","Graph(int vertices) {\r\n this.numVertices = vertices;\r\n adjacencylist = new LinkedList[vertices];\r\n //initialize adjacency lists for all the vertices\r\n for (int i = 0; i <vertices ; i++) {\r\n adjacencylist[i] = new LinkedList<>();\r\n }\r\n }","public AdjacencyListGraph(boolean isDirected) {\r\n\t\tthis.isDirected = isDirected;\r\n\t\tvertices = new HashMap<>();\r\n\t\tadjacencyLists = new HashMap<>();\r\n\t}","public static void main( String[] args ){\n AdjListsGraph<String> a = new AdjListsGraph<String>( \"Sample-Graph.tgf\" );\n System.out.println( a );\n System.out.println( \"Number of vertices (5):\" + a.getNumVertices());\n System.out.println( \"Number of arcs (7):\" + a.getNumArcs());\n System.out.println( \"isEdge A<-->B (TRUE):\" + a.isEdge(\"A\", \"B\"));\n System.out.println( \"isArc A-->C (TRUE):\" + a.isArc( \"A\",\"C\"));\n System.out.println( \"isEdge D<-->E (FALSE):\" + a.isEdge( \"D\",\"E\" ));\n System.out.println( \"isArc D -> E (TRUE):\" + a.isArc( \"D\",\"E\" ));\n System.out.println( \"isArc E -> D (FALSE):\" + a.isArc( \"E\",\"D\" ));\n System.out.println( \"Removing vertex A.\");\n a.removeVertex( \"A\" );\n System.out.println( \"Adding edge B<-->D\");\n a.addEdge( \"B\",\"D\" );\n System.out.println( \"Number of vertices (4):\" + a.getNumVertices());\n System.out.println( \"Number of arcs (5):\" + a.getNumArcs());\n System.out.println( a );\n System.out.println( \"Adj to B ([C,D]):\" + a.getSuccessors( \"B\" ) );\n System.out.println( \"Adj to C ([B]):\" + a.getSuccessors( \"C\" ));\n System.out.println( \"Adding A (at the end of vertices).\" );\n a.addVertex( \"A\" ); \n System.out.println( \"Adding B (should be ignored).\" );\n a.addVertex( \"B\" );\n System.out.println( \"Saving the graph into BCDEA.tgf\" );\n a.saveToTGF( \"BCDEA.tgf\" );\n System.out.println( \"Adding F->G->H->I->J->K->A.\" );\n a.addVertex( \"F\" );\n a.addVertex( \"G\" );\n a.addArc( \"F\", \"G\" );\n a.addVertex( \"H\" );\n a.addArc( \"G\", \"H\" );\n a.addVertex( \"I\" );\n a.addArc( \"H\", \"I\" );\n a.addVertex( \"J\" );\n a.addArc( \"I\", \"J\" );\n a.addVertex( \"K\" );\n a.addArc( \"J\", \"K\" );\n a.addArc( \"K\", \"A\" );\n System.out.println( a );\n System.out.println( \"Saving the graph into A-K.tgf\" );\n a.saveToTGF( \"A-K.tgf\" );\n }","DFS(int ver){\n // assign the nu,mber of vertex\n v = ver;\n // assign the number of boolean at it's vertex\n visited = new boolean[ver];\n // assisgn the array with the vertex length\n pre = new int[ver];\n // asssigning the adjList length\n adjList = new ArrayList[ver];\n\n // now going throgh the loop and adding the newList to adjList each index , in pre making all -1, and false in all visited\n for (int x=0; x<ver; x+=1){\n adjList[x] = new ArrayList();\n\n // for the visited boolean value false\n visited[x] = false;\n\n // pre \n pre[x]=-1;\n }\n }","AdjacencyGraph(){\r\n vertices = new HashMap<>();\r\n }","Graph(int v) {\n this.v = v;\n array = new ArrayList[v];\n\n // Add linkedList to array\n for (int i = 0; i < v; i++) {\n array[i] = new ArrayList<>();\n }\n }","public int[][] getAdjacencyMatrix();","List<Integer> adj(int v) {\n return adj[v];\n }","public AdjacencyLists(int size) {\r\n\t\tgraph = new ArrayList[size];\r\n\t}","private void createAdjacencyLists(List<Edges> edges,int numberOfVertices){\n\t\t\n\t\tfor(int i=0;i<numberOfVertices;i++){\n\t\t\tneighbors.add(new ArrayList<Integer>());\n\t\t}\n\t\tfor(Edges edge:edges){\n\t\t\tneighbors.get(edge.u).add(edge.v);\n\t\t}\n\t\t\n\t}","public void printAdjacencyList() {\n \n for ( int i=0; i<vertex_adjacency_list.size(); i++ ) {\n \n vertex_adjacency_list.get( i ).printVertex();\n \n }\n \n }","@SuppressWarnings(\"unchecked\")\n private void initAdjList()\n {\n adjList = new ArrayList[v];\n\n for(int i = 0; i < v; i++)\n {\n adjList[i] = new ArrayList<>();\n }\n }","public Graph() // constructor\n{\n vertexList = new Vertex[MAX_VERTS];\n // adjacency matrix\n adjMat = new int[MAX_VERTS][MAX_VERTS];\n nVerts = 0;\n for (int j = 0; j < MAX_VERTS; j++) // set adjacency\n for (int k = 0; k < MAX_VERTS; k++) // matrix to 0\n adjMat[j][k] = INFINITY;\n}","public void addVertex (){\t\t \n\t\tthis.graph.insert( new MyList<Integer>() );\n\t}","public Vertex[] createGraph(){\n\t\t /* constructing a graph using matrices\n\t\t * If there is a connection between two adjacent LETTERS, the \n\t * cell will contain a num > 1, otherwise a 0. A value of -1 in the\n\t * cell denotes that the cities are not neighbors.\n\t * \n\t * GRAPH (with weights b/w nodes):\n\t * E+---12-------+B--------18-----+F----2---+C\n\t * +\t\t\t\t+\t\t\t\t +\t\t +\n\t * |\t\t\t\t|\t\t\t\t/\t\t |\n\t * |\t\t\t\t|\t\t\t |\t\t |\n\t * |\t\t\t\t|\t\t\t |\t\t 10\n\t * 24\t\t\t\t8\t\t\t 8\t |\n\t * |\t\t\t\t|\t\t\t |\t\t +\n\t * |\t\t\t\t|\t\t\t | H <+---11---I\n\t * |\t\t\t\t|\t\t\t /\n\t * +\t\t\t\t+\t\t\t +\n\t * G+---12----+A(start)+---10--+D\n\t * \n\t * NOTE: I is the only unidirectional node\n\t */\n\t\t\n\t\tint cols = 9;\n\t\tint rows = 9;\n\t\t//adjacency matrix\n\t\t\t\t //A B C D E F G H I\n\t int graph[][] = { {0,8,0,10,0,0,12,0,0}, //A\n\t {8,0,0,0,12,18,0,0,0}, //B\n\t {0,0,0,0,0,2,0,10,0}, //C\n\t {10,0,0,0,0,8,0,0,0}, //D\n\t {0,12,0,0,0,0,24,0,0}, //E\n\t {0,18,2,8,0,0,0,0,0}, //F\n\t {12,0,0,0,0,0,24,0,0}, //G\n\t {0,0,10,0,0,0,0,0,11}, //H\n\t {0,0,0,0,0,0,0,11,0}}; //I\n\t \n\t //initialize stores vertices\n\t Vertex[] vertices = new Vertex[rows]; \n\n\t //Go through each row and collect all [i,col] >= 1 (neighbors)\n\t int weight = 0; //weight of the neighbor\n\t for (int i = 0; i < rows; i++) {\n\t \tVector<Integer> vec = new Vector<Integer>(rows);\n\t\t\tfor (int j = 0; j < cols; j++) {\n\t\t\t\tif (graph[i][j] >= 1) {\n\t\t\t\t\tvec.add(j);\n\t\t\t\t\tweight = j;\n\t\t\t\t}//is a neighbor\n\t\t\t}\n\t\t\tvertices[i] = new Vertex(Vertex.getVertexName(i), vec);\n\t\t\tvertices[i].state = weight;\n\t\t\tvec = null; // Allow garbage collection\n\t\t}\n\t return vertices;\n\t}","public static ArrayList<Vertex> initializeGraph() {\n\t\tVertex uVertex = new Vertex('u');\n\t\tVertex vVertex = new Vertex('v');\n\t\tVertex wVertex = new Vertex('w');\n\t\tVertex xVertex = new Vertex('x');\n\t\tVertex yVertex = new Vertex('y');\n\t\tVertex zVertex = new Vertex('z');\n\t\t\n\t\tVertex[] uAdjacencyList = {xVertex, vVertex};\n\t\tuVertex.setAdjacencyList(createArrayList( uAdjacencyList ));\n\t\t\n\t\tVertex[] vAdjacencyList = {yVertex};\n\t\tvVertex.setAdjacencyList(createArrayList( vAdjacencyList ));\n\t\t\n\t\tVertex[] wAdjacencyList = {zVertex, yVertex};\n\t\twVertex.setAdjacencyList(createArrayList( wAdjacencyList ));\n\t\t\n\t\tVertex[] xAdjacencyList = {vVertex};\n\t\txVertex.setAdjacencyList(createArrayList( xAdjacencyList ));\n\t\t\n\t\tVertex[] yAdjacencyList = {xVertex};\n\t\tyVertex.setAdjacencyList(createArrayList( yAdjacencyList ));\n\t\t\n\t\tVertex[] zAdjacencyList = {zVertex};\n\t\tzVertex.setAdjacencyList(createArrayList( zAdjacencyList ));\n\n\t\tVertex[] graph = { uVertex, vVertex, wVertex, xVertex, yVertex, zVertex};\n\t\treturn createArrayList( graph );\n\n\t}","Digraph(int v) {\n this.V = v;\n adj = (List<Integer>[]) new ArrayList[V];\n for (int i = 0; i < V; i++) {\n adj[i] = new ArrayList<>();\n }\n }","public AdjacencyLists(String filename)\n {\n readGraph(filename);\n }","public WeightedAdjacencyGraph() {\n this.vertices = new HashMap<>();\n }","Graph(int v) {\n V = v;\n adj = new LinkedList[v];\n for (int i = 0; i < v; ++i)\n adj [i] = new LinkedList();\n }","public List neighbors(int vertex) {\n// your code here\n LinkedList<Integer> result = new LinkedList<>();\n LinkedList<Edge> list = adjLists[vertex];\n for (Edge a : list) {\n result.add(a.to());\n }\n//List<Integer> list = new List<Integer>();\n return result;\n }","public void printAdjacencyMatrix();","public AdjacencyMatrix ( Graph g ) {\n dim = g.getNumberOfVertices();\n matrix = new int[dim][dim];\n ids = new int[dim];\n reachable = new boolean[dim];\n agentNames = new String[dim][];\n for ( Vertex v : g.getVertices() ) {\n int i = g.getVertices().indexOf(v);\n String name = g.getVertices().get(i).getName();\n name = name.replace(\"vertex\", \"\");\n try {\n ids[i] = Integer.parseInt(name);\n }\n catch ( Exception ex ) {\n }\n if ( v.isAdjacentTo(g.getPosition()) )\n reachable[i] = true;\n agentNames[i] = v.getAgentNames();\n }\n position = g.getVertices().indexOf(g.getPosition());\n LinkedList<Vertex> vertices = g.getVertices();\n for ( Edge e : g.getEdges() ) {\n int i = vertices.indexOf(e.getVertices()[0]);\n int j = vertices.indexOf(e.getVertices()[1]);\n if ( !e.isSurveyed() )\n matrix[i][j] = matrix[j][i] = -1;\n else\n matrix[i][j] = matrix[j][i] = e.getWeight();\n }\n }","@SuppressWarnings(\"rawtypes\")\n\tpublic Set getAdjList(){ \t\t\t\t\t\t\t\t\t\t\t\t\t// getter for the adjacency list\n\t\treturn adjList; \n\t}","private ArrayList<Edge>getFullyConnectedGraph(){\n\t\tArrayList<Edge> edges = new ArrayList<>();\n\t\tfor(int i=0;i<nodes.size();i++){\n\t\t\tfor(int j=i+1;j<nodes.size();j++){\n\t\t\t\tEdge edge = new Edge(nodes.get(i), nodes.get(j),Utils.distance(nodes.get(i), nodes.get(j)));\n\t\t\t\tedges.add(edge);\n\t\t\t}\n\t\t}\n\t\treturn edges;\n\t}","Graph(){\n\t\tadjlist = new HashMap<String, Vertex>();\n\t\tvertices = 0;\n\t\tedges = 0;\n\t\tkeys = new ArrayList<String>();\n\t}","private void buildGraph(String[] words,int indegree[], HashMap<Character, Set<Character>> adjList){\n // initialise the adj list graph with all charac ters in all words\n for(String word:words ){\n for(char c: word.toCharArray()){\n adjList.putIfAbsent(c, new HashSet());\n }\n }// once u fill with init, then u eatblish relationships\n \n // wrt and er \n for(int i=1; i<words.length;i++){\n String first = words[i-1];\n String second = words[i];\n // now compare each char in thos words\n for(int j=0; j< Math.min(first.length(),second.length());j++){\n if(first.charAt(j) != second.charAt(j)){\n // a->b here out=a, in=b\n char out = first.charAt(j);\n char in = second.charAt(j);\n // a->b , so in adj list. we need to insert the valiue if not present\n // if the graph does not contains dependecny, which is in set, u add it else u dont add// since hashset, we can check usinhg contains i guess\n if(! adjList.get(out).contains(in)){\n adjList.get(out).add(in);\n \n indegree[in -'a']++;\n }\n // once it is found , u can break out th e loop\n break;\n \n }// if eqaual we mmove to next char and do the process\n }\n }\n }","@Override\r\n public List<Vertex> getVertices() {\r\n List<Vertex> verticesList = new LinkedList<>(adjacencyList.keySet()); //getting the key set of adjacencyList i.e, a list of all vertices\r\n Collections.sort(verticesList, Comparator.comparing(Vertex::getLabel));\r\n return verticesList;\r\n }","public Iterable<DirectedEdge> adj(int v) \n {\n return adj[v];\n }","private void addLinkesToGraph()\n\t{\n\t\tString from,to;\n\t\tshort sourcePort,destPort;\n\t\tMap<Long, Set<Link>> mapswitch= linkDiscover.getSwitchLinks();\n\n\t\tfor(Long switchId:mapswitch.keySet())\n\t\t{\n\t\t\tfor(Link l: mapswitch.get(switchId))\n\t\t\t{\n\t\t\t\tfrom = Long.toString(l.getSrc());\n\t\t\t\tto = Long.toString(l.getDst());\n\t\t\t\tsourcePort = l.getSrcPort();\n\t\t\t\tdestPort = l.getDstPort();\n\t\t\t\tm_graph.addEdge(from, to, Capacity ,sourcePort,destPort);\n\t\t\t} \n\t\t}\n\t\tSystem.out.println(m_graph);\n\t}","public AdjacencyLists(int num)\n {\n numVertices = num;\n clearGraph();\n }","public Map<V,List<E>> adjacencyMap(){\n\t\tMap<V,List<E>> ret = new HashMap<V,List<E>>();\n\t\tfor (E e : edges){\n\t\t\tif (virtualEdges.contains(e))\n\t\t\t\tcontinue;\n\t\t\tList<E> list;\n\t\t\tif (!ret.containsKey(e.getOrigin())){\n\t\t\t\tlist = new ArrayList<E>();\n\t\t\t\tret.put(e.getOrigin(), list);\n\t\t\t}\n\t\t\telse\n\t\t\t\tlist = ret.get(e.getOrigin());\n\t\t\tlist.add(e);\n\t\t\t\n\t\t\tif (!ret.containsKey(e.getDestination())){\n\t\t\t\tlist = new ArrayList<E>();\n\t\t\t\tret.put(e.getDestination(), list);\n\t\t\t}\n\t\t\telse\n\t\t\t\tlist = ret.get(e.getDestination());\n\t\t\tlist.add(e);\n\t\t}\n\t\treturn ret;\n\t}","@Override\r\n public void addVertex(Vertex v) {\r\n adjacencyList.put(v, new ArrayList<>()); //putting v into key, a new LinkedList into value for later use\r\n }","public Graph(int numberOfVertices){\r\n this.numberOfVertices = numberOfVertices;\r\n this.adjacencyList = new TreeMap<>();\r\n }","public void buildGraph(){\n\t}","public ListGraph(int numV, boolean directed) {\r\n super(numV, directed);\r\n edges = new List[numV];\r\n for (int i = 0; i < numV; i++) {\r\n edges[i] = new LinkedList < Edge > ();\r\n }\r\n }","static int[] topoSort(int V, ArrayList<ArrayList<Integer>> adj)\n {\n int indegree[] = new int[V];\n for(ArrayList<Integer> v : adj){\n for(Integer c : v){\n indegree[c]++;\n }\n }\n Queue<Integer> q = new LinkedList();\n for(int i=0;i<V;i++){\n if(indegree[i]==0){\n q.add(i);\n }\n }\n List<Integer> top = new ArrayList();\n int c = 0;\n while (!q.isEmpty()){\n Integer node = q.poll();\n top.add(node);\n c++;\n for(int child : adj.get(node)){\n indegree[child]--;\n if(indegree[child]==0){\n q.add(child);\n }\n }\n }\n if(c==V){\n int ans[] = new int[top.size()];\n for(int i=0;i<top.size();i++){\n ans[i] = top.get(i);\n }\n return ans;\n }\n// System.out.println(\"Cycle exists\");\n return null;\n }","public void main() {\n\t\tint size = 100;\n \tadjacencyList = new ArrayList<int[]>(size + 1);\n \tint[] emptyNodeArray;\n// nodes = new HashMap<Integer, Integer>(size);\n for (int i = 0; i <= size; i++) {\n \temptyNodeArray = new int[] {};\n \tadjacencyList.add(i, emptyNodeArray);\n// \tnodes.put(i, -1); // initialize all node distances to -1\n }\n\t\tint n1 = 0, n2 = 1;\n \tint indexToLast;\n \tint[] destinationsList = adjacencyList.get(n1);\n \tif (destinationsList == null) { \n \t\tindexToLast = 0;\n \t} else {\n \t\tindexToLast = destinationsList.length;\n \t}\n \tdestinationsList[indexToLast] = n2;\n\t}","private void buildGraph()\n\t{\n\t\taddVerticesToGraph();\n\t\taddLinkesToGraph();\n\t}","public Iterable<Integer> adj(int v)\n { return adj[v]; }","@DisplayName(\"Add directed edge\")\n @Test\n public void testAddEdgeDirected() {\n graph.addEdge(new Edge(3, 4));\n List<Integer> l = new ArrayList<>();\n l.add(2);\n l.add(4);\n Assertions.assertArrayEquals(l.toArray(), graph.getNeighbours(3).toArray());\n }","public interface Graph {\n\n\t/**\n\t * Method to add the edge from start to end to the graph.\n\t * Adding self-loops is not allowed.\n\t * @param start start vertex\n\t * @param end end vertex\n\t */\n\tpublic void addEdge(int start, int end);\n\n\t/**\n\t * Method to add the edge with the given weight to the graph from start to end.\n\t * Adding self-loops is not allowed.\n\t * @param start number of start vertex\n\t * @param end number of end vertex\n\t * @param weight weight of edge\n\t */\n\tpublic void addEdge(int start, int end, double weight);\n\n\t/**\n\t * Method to add a vertex to the graph.\n\t */\n\tpublic void addVertex();\n\t\n\t/**\n\t * Method to add multiple vertices to the graph.\n\t * @param n number of vertices to add\n\t */\n\tpublic void addVertices(int n);\n\n\t/**\n\t * Returns all neighbors of the given vertex v (all vertices i with {i,v} in E or (i,v) or (v,i) in E).\n\t * @param v vertex whose neighbors shall be returned\n\t * @return List of vertices adjacent to v\n\t */\n\tpublic List<Integer> getNeighbors(int v);\n\n\t/**\n\t * Returns a list containing all predecessors of v. In an undirected graph all neighbors are returned.\n\t * @param v vertex id\n\t * @return list containing all predecessors of v\n\t */\n\tpublic List<Integer> getPredecessors(int v);\n\n\t/**\n\t * Returns a list containing all successors v. In an undirected graph all neighbors are returned.\n\t * @param v vertex id\n\t * @return list containing all edges starting in v\n\t */\n\tpublic List<Integer> getSuccessors(int v);\n\n\t/**\n\t * Method to get the number of vertices.\n\t * @return number of vertices\n\t */\n\tpublic int getVertexCount();\n\n\t/**\n\t * Method to get the weight of the edge {start, end} / the arc (start, end).\n\t * @param start start vertex of edge / arc\n\t * @param end end vertex of edge / arc\n\t * @return Double.POSITIVE_INFINITY, if the edge does not exist, c_{start, end} otherwise\n\t */\n\tpublic double getEdgeWeight(int start, int end);\n\n\t/**\n\t * Method to test whether the graph contains the edge {start, end} / the arc (start, end).\n\t * @param start start vertex of the edge\n\t * @param end end vertex of the edge\n\t */\n\tpublic boolean hasEdge(int start, int end);\n\n\t/**\n\t * Method to remove an edge from the graph, defined by the vertices start and end.\n\t * @param start start vertex of the edge\n\t * @param end end vertex of the edge\n\t */\n\tpublic void removeEdge(int start, int end);\n\n\t/**\n\t * Method to remove the last vertex from the graph.\n\t */\n\tpublic void removeVertex();\n\n\t/**\n\t * Returns whether the graph is weighted.\n\t * A graph is weighted if an edge with weight different from 1.0 has been added to the graph.\n\t * @return true if the graph is weighted\n\t */\n\tpublic boolean isWeighted();\n\n\t/**\n\t * Returns whether the graph is directed.\n\t * @return true if the graph is directed\n\t */\n\tpublic boolean isDirected();\n\n}","Graph() {\r\n\t\tvertices = new LinkedList<Vertex>();\r\n\t\tedges = 0;\r\n\r\n\t\tfor (int i = 0; i < 26; i++) {\r\n\t\t\t// ASCII value of 'A' is 65\r\n\t\t\tVertex vertex = new Vertex((char) (i + 65));\r\n\t\t\tvertices.add(vertex);\r\n\t\t}\r\n\t\tcurrentVertex = vertices.get(0);\r\n\t\tseen = new boolean[26];\r\n\t}","public void addToList(Vertex newVertex)\n\t{\n\t\tadjacencyList.add(newVertex);\n\t\tupdateIndegree();\n\t}","void addEdge(int vertex1, int vertex2){\n adjList[vertex1].add(vertex2);\n adjList[vertex2].add(vertex1);\n }","public void dfs(LinkedList<Node>[] adjList){\n Set<Integer> visited = new HashSet<>();\n\n for(LinkedList<Node> node: adjList){\n Node curr = node.getFirst();\n if(!visited.contains(curr)){\n ArrayList<Integer> components = new ArrayList<>();\n components = getConnectedComponets(curr, visited, components);\n System.out.printf(\"do something %s\", components.toString());\n }\n }\n }","public Iterable<Edge> adj(int v) {\n return adj[v];\n }","public WeightedGraph(List<K> v)\n\t{\n\t // make ourselves a private copy of the vertex set\n\t verts = new HashSet<K>(v);\n\n\t // set up empty adkacency lists for each vertex\n\t adjLists = new HashMap<K, List<HashMap<K, Integer>>>();\n\t for (K src : verts)\n\t\t{\n\t\t adjLists.put(src, new ArrayList<HashMap<K, Integer>>());\n\t\t}\n\t}","Iterable<Long> vertices() {\n //YOUR CODE HERE, this currently returns only an empty list.\n ArrayList<Long> verticesIter = new ArrayList<>();\n verticesIter.addAll(adj.keySet());\n return verticesIter;\n }","public ArrayList<Integer> nodosAdyacentesA(final int nodo) {\n\t\tArrayList<Integer> adyacentes = new ArrayList<Integer>();\n\t\tfor (int i = 0; i < matriz.getDimension(); i++) {\n\t\t\tif (esAdyacente(nodo, i) && nodo != i) {\n\t\t\t\tadyacentes.add(i);\n\t\t\t}\n\t\t}\n\t\treturn adyacentes;\n\t}","private List<V> getNewVertexOrderIfAcyclic () {\n Map<V, Integer> indegree = inDegree();\n // Determine all vertices with zero in-degree\n Stack<V> zeroIncomingVertex = new Stack<V>(); \n for (V v: indegree.keySet()) {\n if (indegree.get(v) == 0) zeroIncomingVertex.push(v);\n }\n \n // Determine the vertex order\n List<V> result = new ArrayList<V>();\n while (!zeroIncomingVertex.isEmpty()) {\n V v = zeroIncomingVertex.pop(); // Choose a vertex with zero in-degree\n result.add(v); // Vertex v is next in vertex ordering\n // \"Remove\" vertex v by updating its neighbors\n for (V neighbor: dag.get(v)) {\n indegree.put(neighbor, indegree.get(neighbor) - 1);\n // Remember any vertices that now have zero in-degree\n if (indegree.get(neighbor) == 0) zeroIncomingVertex.push(neighbor);\n }\n }\n // Check that we have used the entire graph. If not then there was a cycle.\n if (result.size() != dag.size()) return null;\n return result;\n }","public static Graph instantiateAdjacencyMatrixGraph() {\r\n\t\treturn new AdjacencyMatrixGraph();\r\n\t}","public static void main(String[] args) throws IOException {\n AdjListGraph adjListGraph = null;\r\n AdjMatrixGraph adjMatGraph = null;\r\n AdjMatrixMoreEfficientGraph adjEffGraph = null;\r\n \r\n // Create object for input sequence according to the file name\r\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\r\n System.out.print(\"Enter input filename: \");\r\n String filename = br.readLine();\r\n \r\n // Inserting data to each graph, pay attention to different path representation for ubuntu and windows\r\n In inputFile = new In(\"data/\" + filename);\r\n adjListGraph = new AdjListGraph(inputFile);\r\n inputFile = new In(\"data/\" + filename);\r\n adjMatGraph = new AdjMatrixGraph(inputFile);\r\n inputFile = new In(\"data/\" + filename);\r\n adjEffGraph = new AdjMatrixMoreEfficientGraph(inputFile);\r\n \r\n /*\r\n * Step 2\r\n * get the size of graph of each representation\r\n * AdjListGraph.java: adj\r\n * AdjMatrixGraph.java: adj\r\n\t\t * Please use adjListGraph.sizeOfGraph() to get the memory usage of the graph with list implementation. \r\n\t\t * Please use adjMatGraph.sizeOfGraph() to get the memory usage of the graph with matrix implementation. \r\n */\r\n \r\n // Output every required data from all versions\r\n System.out.format(\"1. Number of vertices = %d \\n\", adjListGraph.V());\r\n System.out.format(\"2. Number of edges = %d \\n\", adjListGraph.E());\r\n System.out.format(\"3. Output of the graph using adjacency list:\\n\");\r\n //adjListGraph.printGraph();\r\n System.out.format(\"4. Adjacency list\\n (a) Memory needed to record edges = %d\\n\", adjListGraph.E() * Size.INTEGER);\r\n System.out.format(\" (b) Total amount of memory used = %d\\n\", adjListGraph.sizeOfGraph());\r\n System.out.format(\" (c) Efficiency = %f\\n\", 100.0 * adjListGraph.E() * Size.INTEGER / adjListGraph.sizeOfGraph());\r\n System.out.format(\"5. Output of the graph using matrix:\\n\");\r\n //adjMatGraph.printGraph();\r\n System.out.format(\"6. Adjacency matrix\\n (a) Memory needed to record edges = %d\\n\", adjMatGraph.E() * Size.BOOLEAN);\r\n System.out.format(\" (b) Total amount of memory used = %d\\n\", adjMatGraph.sizeOfGraph());\r\n System.out.format(\" (c) Efficiency = %f\\n\", 100.0 * adjMatGraph.E() * Size.BOOLEAN / adjMatGraph.sizeOfGraph());\r\n //adjEffGraph.printGraph();\r\n System.out.format(\"Additional task: Efficient Adjacency matrix\\n (a) Memory needed to record edges = %d\\n\", adjEffGraph.E() * Size.BOOLEAN);\r\n System.out.format(\" (b) Total amount of memory used = %d\\n\", adjEffGraph.sizeOfGraph());\r\n System.out.format(\" (c) Efficiency = %f\\n\", 100.0 * adjEffGraph.E() * Size.BOOLEAN / adjEffGraph.sizeOfGraph());\r\n }","private List<routerNode> getPathVertexList(routerNode beginNode, routerNode endNode) {\r\n\t\tTransformer<routerLink, Integer> wtTransformer; // transformer for getting edge weight\r\n\t\twtTransformer = new Transformer<routerLink, Integer>() {\r\n public Integer transform(routerLink link) {\r\n return link.getWeight();\r\n \t}\r\n };\t\t\r\n\r\n\t\t\r\n\t\tList<routerNode> vlist;\r\n\t\tDijkstraShortestPath<routerNode, routerLink> DSPath = \r\n\t \t new DijkstraShortestPath<routerNode, routerLink>(gGraph, wtTransformer);\r\n \t// get the shortest path in the form of edge list \r\n List<routerLink> elist = DSPath.getPath(beginNode, endNode);\r\n\t\t\r\n \t\t// get the node list form the shortest path\r\n\t Iterator<routerLink> ebIter = elist.iterator();\r\n\t vlist = new ArrayList<routerNode>(elist.size() + 1);\r\n \tvlist.add(0, beginNode);\r\n\t for(int i=0; i<elist.size(); i++){\r\n\t\t routerLink aLink = ebIter.next();\r\n\t \t \t// get the nodes corresponding to the edge\r\n \t\tPair<routerNode> endpoints = gGraph.getEndpoints(aLink);\r\n\t routerNode V1 = endpoints.getFirst();\r\n\t routerNode V2 = endpoints.getSecond();\r\n\t \tif(vlist.get(i) == V1)\r\n\t \t vlist.add(i+1, V2);\r\n\t else\r\n\t \tvlist.add(i+1, V1);\r\n\t }\r\n\t return vlist;\r\n\t}","private static void addAllEdgeInstances (Graph graph, boolean isDirected){\n Collection<Node> noteSet = graph.getNodeSet();\n\n for (Iterator<Node> iterator = noteSet.iterator(); iterator.hasNext();) {\n Node startNode = (Node) iterator.next();\n\n for (Iterator<Node> iterator2 = noteSet.iterator(); iterator2.hasNext();) {\n Node endNode = (Node) iterator2.next();\n\n if (!(startNode == endNode)){\n graph.addEdge(startNode.toString().concat(endNode.toString()), startNode, endNode, isDirected);\n }\n\n }\n }\n }","public static ArrayList<String> connectors2(Graph g) {\n boolean[] visits = new boolean[g.members.length]; \n for (int i=0;i<=g.members.length-1;i++) {\n \tvisits[i]=false;\n }\n int[] dfsnum = new int[g.members.length];\n int[] back = new int[g.members.length];\n ArrayList<String> answer = new ArrayList<String>();\n\n //driver portion\n for (Person person : g.members) {\n //if it hasn't been visited\n if (visits[g.map.get(person.name)]==false){\n //for different islands\n dfsnum = new int[g.members.length];\n dfs(g.map.get(person.name), g.map.get(person.name), g, visits, dfsnum, back, answer);\n }\n }\n \n //check if vertex has one neighbor\n for (int i = 0; i < answer.size(); i++) {\n Friend ptr = g.members[g.map.get(answer.get(i))].first;\n //counts number of neighbors\n int count = 0;\n while (ptr != null) {\n ptr = ptr.next;\n count++;\n }\n if (count == 1) answer.remove(i);\n if (count == 0) answer.remove(i);\n } \n for (Person member : g.members) {\n if (member.first!=null&& member.first.next == null) {\n if (answer.contains(g.members[member.first.fnum].name)==false)\n \t\t answer.add(g.members[member.first.fnum].name);\n }\n }\n answer=modify(answer,g);\n if (answer==null||answer.size()==0) return null;\n return answer;\n }","public ListGraph(int numberOfVertex, boolean directed) throws Exception {\n super(numberOfVertex, directed);\n\n edges = new List[numberOfVertex];\n\n for(int index = 0; index < numberOfVertex; ++index)\n this.edges[index] = new LinkedList<Edge>();\n }","@Override\r\n\tpublic void FloydWarshall() {\r\n\t\tgraphForWarshall = new AdjacencyMatrixGraph<>(getOrder(), isDirected);\r\n\t\tvertices.forEach((E t, Vertex<E> u) -> {\r\n\t\t\tgraphForWarshall.insertVertex(t);\r\n\t\t});\r\n\t\tadjacencyLists.forEach((E t, ArrayList<Edge<E>> u) -> {\r\n\t\t\tfor(Edge<E> ale : u) {\r\n\t\t\t\tgraphForWarshall.link(ale.getSrc(), ale.getDst(), ale.getWeight());\r\n\t\t\t}\r\n\t\t});\r\n\t\tgraphForWarshall.FloydWarshall();\r\n\t}","public static void main(String[] args) {\n\n Graph myGraph = new Graph();\n myGraph.addNode(\"8\");\n myGraph.addNode(\"1\");\n myGraph.addNode(\"2\");\n myGraph.addNode(\"9\");\n myGraph.addNode(\"7\");\n myGraph.addNode(\"5\");\n myGraph.addEdge(\"8\" , \"1\" , 50);\n myGraph.addEdge(\"5\" , \"1\" , 70);\n myGraph.addEdge(\"7\" , \"5\", 20);\n myGraph.addEdge(\"8\" , \"9\", 100);\n myGraph.addEdge(\"8\" , \"2\", 40);\n String[] trip = {\"8\" , \"1\" , \"5\"};\n String[] trip2 = {\"8\" , \"5\"};\n String[] trip3 = {\"8\" , \"1\" , \"5\" , \"7\" , \"5\" , \"1\" , \"8\" , \"9\"};\n String[] trip4 = {\"8\" , \"9\" , \"5\" };\n String[] trip5 = {\"8\"};\n String[] trip6 = {\"8\" , \"2\"};\n// System.out.println(myGraph);\n// System.out.println(myGraph.getNodes());\n// System.out.println(myGraph.getNeighbors(\"8\"));\n// System.out.println(myGraph.getNeighbors(\"7\"));\n// System.out.println(myGraph.getNeighbors(\"5\"));\n// System.out.println(myGraph.size());\n// System.out.println(myGraph.breadthFirst(\"8\"));\n// System.out.println(myGraph.weightList);\n// System.out.println(myGraph.breadthFirst(\"7\"));\n// System.out.println(myGraph.breadthFirst(\"5\"));\n// System.out.println(myGraph.businessTrip(\"8\",trip));\n// System.out.println(myGraph.businessTrip(\"8\",trip2));\n// System.out.println(myGraph.businessTrip(\"8\",trip3));\n// System.out.println(myGraph.businessTrip(\"8\",trip4));\n// System.out.println(myGraph.businessTrip(\"8\",trip5));\n// System.out.println(myGraph.businessTrip(\"8\",trip6));\n System.out.println(myGraph.depthFirst(\"8\"));\n }","private void addVerticesToGraph()\n\t{\n\t\tString vertexName;\n\n\t\tMap<Long, IOFSwitch> switches = this.floodlightProvider.getSwitches();\n\t\tfor(IOFSwitch s :switches.values())\n\t\t{\n\t\t\tvertexName =Long.toString(s.getId());\n\t\t\tm_graph.addVertex(vertexName);\t\t\t \t\t\t \n\t\t}\n\t\tSystem.out.println(m_graph);\n\t}","List<CyEdge> getInternalEdgeList();","private static void criaListaDeVertices(Graph graph) {\r\n\t\tfor (int i = 0; i < graph.getArestas().size(); i++) {\r\n\t\t\tif (!graph.getArestas().get(i).getV1().statusVertice()) {\r\n\t\t\t\tgraph.getVerticesGraph().add( graph.getArestas().get(i).getV1() );\r\n\t\t\t\tgraph.getArestas().get(i).getV1().alteraStatusVertice(true);\r\n\t\t\t}\r\n\r\n\t\t\tif (!graph.getArestas().get(i).getV2().statusVertice()) {\r\n\t\t\t\tgraph.getVerticesGraph().add( graph.getArestas().get(i).getV2() );\r\n\t\t\t\tgraph.getArestas().get(i).getV2().alteraStatusVertice(true);\r\n\r\n\t\t\t}\r\n\t\t}\r\n\t}","private Double[][] makeAdjacencyMatrix()\n {\n Double[][] matrix = new Double[this.numIntxns][this.numIntxns];\n\n for (int i = 0; i < this.numIntxns; i++)\n {\n for (int j = 0; j < this.numIntxns; j++)\n {\n // if the indices are the same the distance is 0.0.\n // otherwise, it's infinite.\n matrix[i][j] = (i != j) ? null : 0.0;\n }\n }\n\n // populate the matrix\n for (int intxn = 0; intxn < this.numIntxns; intxn++)\n {\n for (Road road : this.roads)\n {\n if (intxn == road.start())\n {\n matrix[intxn][road.end()] = road.length();\n matrix[road.end()][intxn] = road.length();\n }\n }\n }\n\n return matrix;\n }","static void adjoint(int A[][],int [][]adj) \n { \n \n \n // temp is used to store cofactors of A[][] \n int sign = 1; \n int [][]temp = new int[N][N]; \n \n for (int i = 0; i < N; i++) \n { \n for (int j = 0; j < N; j++) \n { \n // Get cofactor of A[i][j] \n getCofactor(A, temp, i, j, N); \n \n // sign of adj[j][i] positive if sum of row \n // and column indexes is even. \n sign = ((i + j) % 2 == 0)? 1: -1; \n \n // Interchanging rows and columns to get the \n // transpose of the cofactor matrix \n adj[j][i] = (sign)*(determinant(temp, N-1)); \n adj[j][i] = adj[j][i]%26;\n } \n } \n }","protected void addNode (Node node, int index)\n {\n Node currentNode = adjacencySequences[index];\n if (currentNode == null)\n adjacencySequences[index] = node;\n else\n {\n Node previousNode = null;\n while (currentNode != null && currentNode.edgeWeight < node.edgeWeight)\n {\n previousNode = currentNode;\n currentNode = currentNode.nextNode;\n }\n\n if (previousNode == null)\n adjacencySequences[index] = node;\n else\n previousNode.nextNode = node;\n \n node.nextNode = currentNode;\n }\n }","public void addedge(String fro, String to, int wt) {\r\n Edge e = new Edge(fro, to, wt);\r\n\r\n\r\n Set<String> keys = graph.keySet();\r\n// Object[] arr = keys.toArray();\r\n int f = 0;\r\n if(graph.containsKey(fro)&&graph.containsKey(to))\r\n {\r\n\r\n int[] bb2 = new int[2000];\r\n for(int zz=0;zz<5000;zz++){\r\n\r\n\r\n ArrayList<Integer> abcd = new ArrayList<>();\r\n abcd.add(zz);\r\n\r\n if(zz<2500)\r\n zz++;\r\n else\r\n zz++;\r\n\r\n bb2[zz%500]=zz;\r\n\r\n\r\n int qq= 5000;\r\n\r\n qq--;\r\n\r\n String nnn = \"aaa aa\";\r\n nnn+=\"df\";\r\n\r\n\r\n }\r\n\r\n }\r\n else\r\n {\r\n\r\n\r\n System.out.println(\"some vertices are not present\");\r\n return;\r\n }\r\n for ( String y : keys) {\r\n if (fro.compareTo(y) == 0) {\r\n f = 1;\r\n ArrayList<Edge> ee =graph.get(y);\r\n\r\n\r\n ee.add(e);\r\n }\r\n\r\n\r\n }\r\n if (f == 0) {}\r\n }","private int numberOfComponents(ArrayList<Integer>[] adj) {\n\t\t\t\t\n\t\tint n = adj.length;\n\t\tvisited = new boolean[n]; //default is false\n\t\tCCnum = new int[n];\n\t\tDFS(adj);\n\t\t\n\t\treturn cc;\n }","public void addEdge(int i, int j)\n {\n adjList[i].add(j);\n adjList[j].add(i);\n numEdges++;\n }","public Graph createGraph() {\n String fileName;\n// fileName =\"./428333.edges\";\n String line;\n Graph g = new Graph();\n// List<String> vertexNames = new ArrayList<>();\n// try\n// {\n// BufferedReader in=new BufferedReader(new FileReader(fileName));\n// line=in.readLine();\n// while (line!=null) {\n////\t\t\t\tSystem.out.println(line);\n// String src = line.split(\" \")[0];\n// String dst = line.split(\" \")[1];\n//// vertexNames.add(src);\n//// vertexNames.add(dst);\n//// System.out.println(src+\" \"+dst);\n// g.addEdge(src, dst, 1);\n// line=in.readLine();\n// }\n// in.close();\n// } catch (Exception e) {\n//\t\t\te.printStackTrace();\n// }\n\n fileName=\"./788813.edges\";\n// List<String> vertexNames = new ArrayList<>();\n try\n {\n BufferedReader in=new BufferedReader(new FileReader(fileName));\n line=in.readLine();\n while (line!=null) {\n//\t\t\t\tSystem.out.println(line);\n String src = line.split(\" \")[0];\n String dst = line.split(\" \")[1];\n g.addEdge(src, dst, 1);\n line=in.readLine();\n }\n in.close();\n } catch (Exception e) {\n e.printStackTrace();\n }\n\n// Graph g = new Graph(new String[]{\"v0\", \"v1\", \"v2\", \"v3\", \"v4\", \"v5\", \"v6\", \"v7\", \"v8\"});\n// // Add the required edges.\n// g.addEdge(\"v0\", \"v1\", 4); g.addEdge(\"v0\", \"v7\", 8);\n// g.addEdge(\"v1\", \"v2\", 8); g.addEdge(\"v1\", \"v7\", 11); g.addEdge(\"v2\", \"v1\", 8);\n// g.addEdge(\"v2\", \"v8\", 2); g.addEdge(\"v2\", \"v5\", 4); g.addEdge(\"v2\", \"v3\", 7);\n// g.addEdge(\"v3\", \"v2\", 7); g.addEdge(\"v3\", \"v5\", 14); g.addEdge(\"v3\", \"v4\", 9);\n// g.addEdge(\"v4\", \"v3\", 9); g.addEdge(\"v4\", \"v5\", 10);\n// g.addEdge(\"v5\", \"v4\", 10); g.addEdge(\"v5\", \"v3\", 9); g.addEdge(\"v5\", \"v2\", 4);\n// g.addEdge(\"v5\", \"v6\", 2);\n// g.addEdge(\"v6\", \"v7\", 1); g.addEdge(\"v6\", \"v8\", 6); g.addEdge(\"v6\", \"v5\", 2);\n// g.addEdge(\"v7\", \"v0\", 8); g.addEdge(\"v7\", \"v8\", 7); g.addEdge(\"v7\", \"v1\", 11);\n// g.addEdge(\"v7\", \"v6\", 1);\n// g.addEdge(\"v8\", \"v2\", 2); g.addEdge(\"v8\", \"v7\", 7); g.addEdge(\"v8\", \"v6\", 6);\n\n//\n return g;\n }","@Override\r\n public List<Vertex> getNeighbors(Vertex v) {\r\n ArrayList<Vertex> neighborsList = new ArrayList<>();\r\n neighborsList = adjacencyList.get(v);\r\n Collections.sort(neighborsList, Comparator.comparing(Vertex::getLabel));\r\n return neighborsList; //getting the list of all adjacent vertices of vertex v\r\n }","public EdgeListGraph(int V) {\n\t\t// TODO Auto-generated constructor stub\n\t\tthis.V = V;\n\t\tthis.edgeList = new ArrayList<>();\n\t}","private void setUpCLRSGraph() {\n\t\tvertices = new HashMap<Character, DirectedOrderedDfsVertex>();\n\t\tfor (char i = 'a'; i <= 'h'; i++) {\n\t\t\tvertices.put(i, new DirectedOrderedDfsVertex());\n\t\t}\n\t\tgraph = new DirectedSimpleGraph<DirectedOrderedDfsVertex>(vertices.values());\n\t\tvertices.get('a').addAdjacency(vertices.get('b'));\n\t\tvertices.get('b').addAdjacency(vertices.get('f'));\n\t\tvertices.get('b').addAdjacency(vertices.get('e'));\n\t\tvertices.get('b').addAdjacency(vertices.get('c'));\n\t\tvertices.get('c').addAdjacency(vertices.get('d'));\n\t\tvertices.get('c').addAdjacency(vertices.get('g'));\n\t\tvertices.get('d').addAdjacency(vertices.get('c'));\n\t\tvertices.get('d').addAdjacency(vertices.get('h'));\n\t\tvertices.get('e').addAdjacency(vertices.get('a'));\n\t\tvertices.get('e').addAdjacency(vertices.get('f'));\n\t\tvertices.get('f').addAdjacency(vertices.get('g'));\n\t\tvertices.get('g').addAdjacency(vertices.get('f'));\n\t\tvertices.get('g').addAdjacency(vertices.get('h'));\n\t\tvertices.get('h').addAdjacency(vertices.get('h'));\n\t}","public static void main(String[] args) throws IOException {\n File file = new File(args[0]);\r\n //FileOutputStream f = new FileOutputStream(\"prat_dfs_data2.txt\");\r\n //System.setOut(new PrintStream(f));\r\n BufferedReader reader = new BufferedReader(new FileReader(file));\r\n String line;\r\n line = reader.readLine();\r\n int nodecount = 0;\r\n HashMap <String , Integer> nodeMap = new HashMap <String , Integer>(); \r\n while ((line = reader.readLine()) != null ) {\r\n String data[] = line.split(\",(?=(?:[^\\\"]*\\\"[^\\\"]*\\\")*[^\\\"]*$)\");\r\n if (!nodeMap.containsKey(data[0].replaceAll(\"^\\\"|\\\"$\", \"\"))){\r\n nodeMap.put(data[0].replaceAll(\"^\\\"|\\\"$\", \"\"), nodecount);\r\n nodecount++;\r\n }\r\n }\r\n reader.close();\r\n Vertex adjList[] = new Vertex[nodecount];\r\n Vertex sortVer[] = new Vertex[nodecount];\r\n for(int it = 0; it < nodecount; it++){\r\n adjList[it] = new Vertex(it);\r\n }\r\n nodeMap.forEach((k, v) -> adjList[v].val = k);\r\n File file2 = new File(args[1]);\r\n BufferedReader reader2 = new BufferedReader(new FileReader(file2));\r\n line = reader2.readLine();\r\n while ((line = reader2.readLine()) !=null) {\r\n String data[] = line.split(\",(?=(?:[^\\\"]*\\\"[^\\\"]*\\\")*[^\\\"]*$)\");\r\n String source = data[0].replaceAll(\"^\\\"|\\\"$\", \"\");\r\n String target = data[1].replaceAll(\"^\\\"|\\\"$\", \"\");\r\n\r\n int weight = Integer.parseInt(data[2]);\r\n Vertex current = adjList[nodeMap.get(source)];\r\n Vertex newbie = new Vertex(nodeMap.get(target));\r\n current.countN++;\r\n current.co_occur += weight;\r\n if (adjList[nodeMap.get(source)].next == null){\r\n current.next = newbie;\r\n newbie.prev = current;\r\n }\r\n else{\r\n current.next.prev = newbie;\r\n newbie.next = current.next;\r\n current.next = newbie;\r\n newbie.prev = current;\r\n }\r\n Vertex current1 = adjList[nodeMap.get(target)];\r\n Vertex newbie1 = new Vertex(nodeMap.get(source));\r\n current1.co_occur += weight;\r\n current1.countN++;\r\n if (current1.next == null){\r\n current1.next = newbie1;\r\n newbie1.prev = current1;\r\n }\r\n else{\r\n current1.next.prev = newbie1;\r\n newbie1.next = current1.next;\r\n current1.next = newbie1;\r\n newbie1.prev = current1;\r\n }\r\n }\r\n reader2.close();\r\n \r\n for(int it = 0; it < nodecount; it++){\r\n sortVer[it] = new Vertex(adjList[it].id);\r\n sortVer[it].val = adjList[it].val;\r\n sortVer[it].co_occur = adjList[it].co_occur;\r\n }\r\n if (args[2].equals(\"average\")){\r\n double countdeg = 0;\r\n for(int it = 0; it<nodecount; it++){\r\n countdeg+= (double) adjList[it].countN;\r\n }\r\n countdeg = countdeg / (double) (nodecount);\r\n System.out.printf(\"%.2f\", countdeg);\r\n System.out.println();\r\n //long toc= System.nanoTime();\r\n //System.out.println((toc- startTime)/1000000000.0);\r\n }\r\n \r\n if(args[2].equals(\"rank\")){\r\n Graph.mergesort(sortVer, 0, nodecount-1);\r\n // long toc= System.nanoTime();\r\n // System.out.println((toc- startTime)/1000000000.0);\r\n System.out.print(sortVer[0].val);\r\n for(int kk=1; kk<nodecount; kk++){\r\n System.out.print(\",\" + sortVer[kk].val.toString());\r\n }\r\n System.out.println();\r\n }\r\n if(args[2].equals(\"independent_storylines_dfs\")){\r\n boolean visited[] = new boolean[nodecount];\r\n int ind = 0;\r\n ArrayList<ArrayList<Vertex>> comps = new ArrayList<ArrayList<Vertex>>();\r\n for(int it1 = 0; it1<nodecount; it1++){\r\n visited[it1] = false;\r\n }\r\n for(int it1 = 0; it1<nodecount; it1++){\r\n if (visited[it1] == false){\r\n ArrayList<Vertex> temp = new ArrayList<Vertex>();\r\n Graph.dfs(it1, visited, ind, adjList, temp);\r\n ind++;\r\n Graph.mergesort2(temp, 0, temp.size()-1);\r\n comps.add(temp);\r\n }\r\n }\r\n Graph.mergesort3(comps, 0, comps.size()-1);\r\n // long toc= System.nanoTime();\r\n // System.out.println((toc- startTime)/1000000000.0);\r\n for(int a1 = 0; a1 < ind; a1++){\r\n System.out.print(comps.get(a1).get(0).val);\r\n for(int j1 = 1; j1<comps.get(a1).size(); j1++){\r\n System.out.print(\",\" + comps.get(a1).get(j1).val);\r\n }\r\n System.out.println();\r\n }\r\n }\r\n }","public void addAdj(BoardCell adj) {\n\t\tadjList.add(adj);\t\t\t\t\t\t\t\t\t\t\t\t\t\t// adding the cell to the adjacency set\n\t}","public static <V> List<Graph<V>> getConnectedComponents(Graph<V> graph) {\n List<Graph<V>> listaComponentes = new LinkedList<>();\n V[] listaVertices = graph.getValuesAsArray();\n Set<V> revisados = new LinkedListSet<>();\n while (revisados.size() != listaVertices.length) {\n int valor = 0;\n for (int x = 0; x < listaVertices.length; x++) {\n if (!revisados.isMember(listaVertices[x])) {\n valor = x;\n x = listaVertices.length * 2;\n }\n }\n Graph<V> nuevo = new AdjacencyMatrix<>(graph.isDirected(), true);\n recorridoProf(graph, listaVertices[valor], revisados, nuevo);\n listaComponentes.add(nuevo);\n }\n return listaComponentes;\n }","List<Edge<V>> getEdgeList();","public:\n Graph(int V); // Constructor\n void addEdge(int v, int w);","public ArrayList<Country> getAdjList() {\n return adjList;\n }","public static void main(String [] args){\n\t\tSystem.out.println(\"Code by github: Vinay26k\");\n\t\t // create the graph given in above figure\n int V = 5;\n Graph graph = new Graph(V);\n addEdge(graph, 0, 1);\n addEdge(graph, 0, 4);\n addEdge(graph, 1, 2);\n addEdge(graph, 1, 3);\n addEdge(graph, 1, 4);\n addEdge(graph, 2, 3);\n addEdge(graph, 3, 4);\n \n // print the adjacency list representation of \n // the above graph\n printGraph(graph);\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}","List<Edge<V>> getIncidentEdgeList(V v);","public static Graph instantiateAdjacencyMapGraph() {\r\n\t\treturn new AdjacencyMapGraph();\r\n\t}","public native VertexList append(VertexNode vertex);","public String alienOrder(String[] words) {\n int[] indegree = new int[26];\n //adj list--hashmap\n HashMap<Character, Set<Character>> adjList = new HashMap();\n // 2 major steps\n // buildGraph(words,indegree,adjList );\n \n // initialise the adj list graph with all charac ters in all words\n for(String word:words ){\n for(char c: word.toCharArray()){\n adjList.putIfAbsent(c, new HashSet());\n }\n }// once u fill with init, then u eatblish relationships\n \n // wrt and er \n for(int i=1; i<words.length;i++){\n String first = words[i-1];\n String second = words[i];\n \n // important edge case\n if(first.length()> second.length() && first.startsWith(second))\n return \"\";\n // now compare each char in thos words\n for(int j=0; j< Math.min(first.length(),second.length());j++){\n if(first.charAt(j) != second.charAt(j)){\n // a->b here out=a, in=b\n char out = first.charAt(j);\n char in = second.charAt(j);\n // a->b , so in adj list. we need to insert the valiue if not present\n // if the graph does not contains dependecny, which is in set, u add it else u dont add// since hashset, we can check usinhg contains i guess\n if(! adjList.get(out).contains(in)){\n adjList.get(out).add(in);\n //also increase the indegree if u find the dependency\n indegree[in -'a']++;\n }\n // once it is found , u can break out th e loop\n break;\n \n }// if eqaual we mmove to next char and do the process\n }\n }\n \n \n \n \n \n \n// return topologicalSortDfs(indegree,adjList );\n \n \n \n // we ll use stringbuilder to update the characters instead of string\n // we ll insert all elements into queue who has indegree==0 initially, which means they dont have any dependency so they can come at any time//\n // so insert all indgree==0 into queu and do a stanmdard queue template\n StringBuilder sb = new StringBuilder();\n Queue<Character> q = new LinkedList();\n int totalChars = adjList.size(); // to check at end if all are present\n \n \n // loop thru all keys in graph and check the indegree of that character in indegree if its has zero , if so then add to queue initially\n // initial push to queue\n for(char c: adjList.keySet()){\n if(indegree[c-'a'] == 0){\n \n sb.append(c);\n q.offer(c);// so u need to add all orphan nodes to sb , since it contains results\n }\n \n } \n // now we need to find nodes which has dependency, take it out and reduce the indegree and check if indegreeis zero then add tio queue\n \n // stand ard queue template\n while(!q.isEmpty()){\n // take the elemnt \n char curr = q.poll();\n \n if(adjList.get(curr) == null || adjList.get(curr).size()==0 ){\n // we shud not do antthing, and pick the next nodes in the queue\n continue;\n }\n // if we have some elements in the adj list which means we have a dependency\n // So what do we do here:??\n // i think we can take it and reduce the indgree ??\n // Since we are. removing this particular current element, so we need to reduce all its neighbour indegree becios we removed aos we need to update the indegree of all its neiughbours\n for(char neighbour : adjList.get(curr)){\n indegree[neighbour-'a']--;\n //also check if it becomes zero after update we need to push to queu and sb\n if(indegree[neighbour-'a'] == 0){\n //add to q and sb\n q.offer(neighbour);\n sb.append(neighbour);\n \n }\n }\n \n }\n \n // once we are out of queue, which means we processed all nodes\n // if total chars is sb length, which means we got all chars /nodes so we can return else \"\"\n return sb.length() == totalChars ? sb.toString() : \"\";\n }","Vertex addVertex(String name){\n\t\t//if graph doesn't already have the key\n\t\tif (!adjlist.containsKey(name)) {\n\t\t\tkeys.add(name); //places keys in list in order they're added\n\t\t\tvertices++; //increases vertex count variable\n\t\t\treturn adjlist.put(name, new Vertex(name)); //adds to hashmap\n\t\t//if graph does already have the key\n\t\t} else {\n\t\t\treturn adjlist.get(name);\n\t\t}\n\t}","DFS(int vertices) {\n\t\tlist = new ArrayList<ArrayList<Integer>>(vertices);\n\t\tvis = new boolean[vertices];\n\n\t\tfor (int i = 0; i < vertices; i++) {\n\t\t\tlist.add(new ArrayList<Integer>());\n\t\t}\n\t}","public AdjacentListGraph(String[] vertexes) {\n this.vertexes = Arrays.copyOf(vertexes, vertexes.length);\n this.heads = new LinkedList[vertexes.length];\n\n // init the heads to save code: if(heads != null)\n for (int i = 0; i < heads.length; i++) {\n this.heads[i] = new LinkedList<>();\n }\n }","public Iterable<FlowEdge> adj(int v) {\n return adj[v];\n }","public Map<String, List<String>> getAdjList() {\n\t\treturn adj_list;\n\t}","static int[] topoSortDFS(int V, ArrayList<ArrayList<Integer>> adj)\n {\n System.out.println(adj);\n // add your code here\n Stack<Integer> explored = new Stack<Integer>();\n Set<Integer> visited = new HashSet<Integer>();\n for(int i=0;i<adj.size();i++){\n if(!visited.contains(i))\n dfs(V,adj,visited,explored);\n }\n //Once the DFS is complete, convert the 'explored' stack to array\n int ans[] = new int[explored.size()];\n int ind = 0;\n for(int x : explored){\n ans[ind++] = x;\n }\n return ans;\n }","void graph2() {\n\t\tconnect(\"1\", \"7\");\n\t\tconnect(\"1\", \"8\");\n\t\tconnect(\"1\", \"9\");\n\t\tconnect(\"9\", \"1\");\n\t\tconnect(\"9\", \"0\");\n\t\tconnect(\"9\", \"4\");\n\t\tconnect(\"4\", \"8\");\n\t\tconnect(\"4\", \"3\");\n\t\tconnect(\"3\", \"4\");\n\t}","void addEdge(int from, int to) {\n\t\tadjList.get(from).add(to);\n\t}","public static void printAdjacencyList(ArrayList<LinkedList<Integer>> map) {\n\t\tint size = map.size();\n\t\tfor(int node = 0; node < size; node++) { \n\t\t\tLinkedList<Integer> ll = map.get(node);\n\t\t\tif(ll == null) continue;\n\t\t\tint len = ll.size();\n\t\t\tfor(int i = 0; i < len; i++) {\n\t\t\t\tSystem.out.println(node + \" \" + ll.get(i));\n\t\t\t}\t\t\n\t\t}\n\t}","ArrayList<Node> BFTRec(final Graph graph)\n {\n ArrayList<Node> BFT_Order = new ArrayList<Node>();\n int numNodes = graph.numNodes;\n boolean visited[] = new boolean[numNodes];\n\n // Start at every node to ensure that all nodes are visited for unconnected graphs\n for ( int i = 0; i < numNodes; i++ )\n {\n if ( !visited[i] )\n {\n visited[i] = true;\n Node currNode = graph.nodeList.get(i);\n Queue<Node> queue = new LinkedList<Node>();\n queue.add(currNode);\n BFT_Order.addAll( BFTRec_Helper(queue, visited) ); \n\n }\n }\n return BFT_Order;\n }","public Dijkstra(Graph graph)\n\t{\n\t\tthis.listNode = graph.getListNode();\n\t\tthis.listEdge = graph.getListEdge();\n\t}"],"string":"[\n \"ArrayList<Edge> getAdjacencies();\",\n \"private List<Vertex> prepareGraphAdjacencyList() {\\n\\n\\t\\tList<Vertex> graph = new ArrayList<Vertex>();\\n\\t\\tVertex vertexA = new Vertex(\\\"A\\\");\\n\\t\\tVertex vertexB = new Vertex(\\\"B\\\");\\n\\t\\tVertex vertexC = new Vertex(\\\"C\\\");\\n\\t\\tVertex vertexD = new Vertex(\\\"D\\\");\\n\\t\\tVertex vertexE = new Vertex(\\\"E\\\");\\n\\t\\tVertex vertexF = new Vertex(\\\"F\\\");\\n\\t\\tVertex vertexG = new Vertex(\\\"G\\\");\\n\\n\\t\\tList<Edge> edges = new ArrayList<Edge>();\\n\\t\\tedges.add(new Edge(vertexB, 2));\\n\\t\\tedges.add(new Edge(vertexD, 6));\\n\\t\\tedges.add(new Edge(vertexF, 5));\\n\\t\\tvertexA.incidentEdges = edges;\\n\\n\\t\\tedges = new ArrayList<Edge>();\\n\\t\\tedges.add(new Edge(vertexA, 2));\\n\\t\\tedges.add(new Edge(vertexC, 7));\\n\\t\\tvertexB.incidentEdges = edges;\\n\\n\\t\\tedges = new ArrayList<Edge>();\\n\\t\\tedges.add(new Edge(vertexB, 7));\\n\\t\\tedges.add(new Edge(vertexD, 9));\\n\\t\\tedges.add(new Edge(vertexF, 1));\\n\\t\\tvertexC.incidentEdges = edges;\\n\\n\\t\\tedges = new ArrayList<Edge>();\\n\\t\\tedges.add(new Edge(vertexA, 6));\\n\\t\\tedges.add(new Edge(vertexC, 9));\\n\\t\\tedges.add(new Edge(vertexE, 4));\\n\\t\\tedges.add(new Edge(vertexG, 8));\\n\\t\\tvertexD.incidentEdges = edges;\\n\\n\\t\\tedges = new ArrayList<Edge>();\\n\\t\\tedges.add(new Edge(vertexD, 4));\\n\\t\\tedges.add(new Edge(vertexF, 3));\\n\\t\\tvertexE.incidentEdges = edges;\\n\\n\\t\\tedges = new ArrayList<Edge>();\\n\\t\\tedges.add(new Edge(vertexA, 5));\\n\\t\\tedges.add(new Edge(vertexC, 1));\\n\\t\\tedges.add(new Edge(vertexE, 3));\\n\\t\\tvertexF.incidentEdges = edges;\\n\\n\\t\\tedges = new ArrayList<Edge>();\\n\\t\\tedges.add(new Edge(vertexD, 8));\\n\\t\\tvertexG.incidentEdges = edges;\\n\\n\\t\\tgraph.add(vertexA);\\n\\t\\tgraph.add(vertexB);\\n\\t\\tgraph.add(vertexC);\\n\\t\\tgraph.add(vertexD);\\n\\t\\tgraph.add(vertexE);\\n\\t\\tgraph.add(vertexF);\\n\\t\\tgraph.add(vertexG);\\n\\n\\t\\treturn graph;\\n\\t}\",\n \"public DoublyLinkedList getAdjacencyList()\\n \\t{\\n\\t return adjacencyList ;\\n \\t}\",\n \"public ArrayList<Edge> getAdjacencies(){\\r\\n return adjacencies;\\r\\n }\",\n \"public static strictfp void main(String... args) {\\n\\t\\tArrayList<Vertex> graph = new ArrayList<>();\\r\\n\\t\\tHashMap<Character, Vertex> map = new HashMap<>();\\r\\n\\t\\t// add vertices\\r\\n\\t\\tfor (char c = 'a'; c <= 'i'; c++) {\\r\\n\\t\\t\\tVertex v = new Vertex(c);\\r\\n\\t\\t\\tgraph.add(v);\\r\\n\\t\\t\\tmap.put(c, v);\\r\\n\\t\\t}\\r\\n\\t\\t// add edges\\r\\n\\t\\tfor (Vertex v: graph) {\\r\\n\\t\\t\\tif (v.getNodeId() == 'a') {\\r\\n\\t\\t\\t\\tv.getAdjacents().add(map.get('b'));\\r\\n\\t\\t\\t\\tv.getAdjacents().add(map.get('h'));\\r\\n\\t\\t\\t} else if (v.getNodeId() == 'b') {\\r\\n\\t\\t\\t\\tv.getAdjacents().add(map.get('a'));\\r\\n\\t\\t\\t\\tv.getAdjacents().add(map.get('c'));\\r\\n\\t\\t\\t\\tv.getAdjacents().add(map.get('h'));\\r\\n\\t\\t\\t} else if (v.getNodeId() == 'c') {\\r\\n\\t\\t\\t\\tv.getAdjacents().add(map.get('b'));\\r\\n\\t\\t\\t\\tv.getAdjacents().add(map.get('d'));\\r\\n\\t\\t\\t\\tv.getAdjacents().add(map.get('f'));\\r\\n\\t\\t\\t\\tv.getAdjacents().add(map.get('i'));\\r\\n\\t\\t\\t} else if (v.getNodeId() == 'd') {\\r\\n\\t\\t\\t\\tv.getAdjacents().add(map.get('c'));\\r\\n\\t\\t\\t\\tv.getAdjacents().add(map.get('e'));\\r\\n\\t\\t\\t\\tv.getAdjacents().add(map.get('f'));\\r\\n\\t\\t\\t} else if (v.getNodeId() == 'e') {\\r\\n\\t\\t\\t\\tv.getAdjacents().add(map.get('d'));\\r\\n\\t\\t\\t\\tv.getAdjacents().add(map.get('f'));\\r\\n\\t\\t\\t} else if (v.getNodeId() == 'f') {\\r\\n\\t\\t\\t\\tv.getAdjacents().add(map.get('c'));\\r\\n\\t\\t\\t\\tv.getAdjacents().add(map.get('d'));\\r\\n\\t\\t\\t\\tv.getAdjacents().add(map.get('e'));\\r\\n\\t\\t\\t\\tv.getAdjacents().add(map.get('g'));\\r\\n\\t\\t\\t} else if (v.getNodeId() == 'g') {\\r\\n\\t\\t\\t\\tv.getAdjacents().add(map.get('f'));\\r\\n\\t\\t\\t\\tv.getAdjacents().add(map.get('h'));\\r\\n\\t\\t\\t\\tv.getAdjacents().add(map.get('i'));\\r\\n\\t\\t\\t} else if (v.getNodeId() == 'h') {\\r\\n\\t\\t\\t\\tv.getAdjacents().add(map.get('a'));\\r\\n\\t\\t\\t\\tv.getAdjacents().add(map.get('b'));\\r\\n\\t\\t\\t\\tv.getAdjacents().add(map.get('g'));\\r\\n\\t\\t\\t\\tv.getAdjacents().add(map.get('i'));\\r\\n\\t\\t\\t} else if (v.getNodeId() == 'i') {\\r\\n\\t\\t\\t\\tv.getAdjacents().add(map.get('c'));\\r\\n\\t\\t\\t\\tv.getAdjacents().add(map.get('g'));\\r\\n\\t\\t\\t\\tv.getAdjacents().add(map.get('h'));\\r\\n\\t\\t\\t}\\t\\r\\n\\t\\t}\\r\\n\\t\\t// graph created\\r\\n\\t\\t// create disjoint sets\\r\\n\\t\\tDisjointSet S = null, V_S = null;\\r\\n\\t\\tfor (Vertex v: graph) {\\r\\n\\t\\t\\tchar c = v.getNodeId();\\r\\n\\t\\t\\tif (c == 'a' || c == 'b' || c == 'd' || c == 'e') {\\r\\n\\t\\t\\t\\tif (S == null) {\\r\\n\\t\\t\\t\\t\\tS = v.getDisjointSet();\\r\\n\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\tDisjointSet set = DisjointSet.union(S, v.getDisjointSet());\\r\\n\\t\\t\\t\\t\\tv.setDisjointSet(set);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t} else {\\r\\n\\t\\t\\t\\tif (V_S == null) {\\r\\n\\t\\t\\t\\t\\tV_S = v.getDisjointSet();\\r\\n\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\tDisjointSet set = DisjointSet.union(V_S, v.getDisjointSet());\\r\\n\\t\\t\\t\\t\\tv.setDisjointSet(set);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\t// Disjoint sets created\\r\\n\\t\\tfor (Vertex u: graph) {\\r\\n\\t\\t\\tfor (Vertex v: u.getAdjacents()) {\\r\\n\\t\\t\\t\\tif (DisjointSet.findSet((DisjointSet) u.getDisjointSet()) == \\r\\n\\t\\t\\t\\t DisjointSet.findSet((DisjointSet) v.getDisjointSet())) {\\r\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"The cut respects (\\\" + u.getNodeId() + \\\", \\\" + v.getNodeId() + \\\").\\\");\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t}\",\n \"public ArrayList<ChessCoordinate> getAdjacencyList() {\\n\\t\\tint dx, dy;\\n\\t\\tArrayList<ChessCoordinate> adjacencyList = new ArrayList<ChessCoordinate>();\\n\\n\\t\\tfor (dx = -1; dx <= 1; dx++) {\\n\\t\\t\\tfor (dy = -1; dy <= 1; dy++) {\\n\\t\\t\\t\\tif (dx == dy) {\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tadjacencyList.add(StandardCoordinate.make(x + dx, y + dy));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\treturn adjacencyList;\\n\\t}\",\n \"Graph(int vertices) {\\r\\n this.numVertices = vertices;\\r\\n adjacencylist = new LinkedList[vertices];\\r\\n //initialize adjacency lists for all the vertices\\r\\n for (int i = 0; i <vertices ; i++) {\\r\\n adjacencylist[i] = new LinkedList<>();\\r\\n }\\r\\n }\",\n \"public AdjacencyListGraph(boolean isDirected) {\\r\\n\\t\\tthis.isDirected = isDirected;\\r\\n\\t\\tvertices = new HashMap<>();\\r\\n\\t\\tadjacencyLists = new HashMap<>();\\r\\n\\t}\",\n \"public static void main( String[] args ){\\n AdjListsGraph<String> a = new AdjListsGraph<String>( \\\"Sample-Graph.tgf\\\" );\\n System.out.println( a );\\n System.out.println( \\\"Number of vertices (5):\\\" + a.getNumVertices());\\n System.out.println( \\\"Number of arcs (7):\\\" + a.getNumArcs());\\n System.out.println( \\\"isEdge A<-->B (TRUE):\\\" + a.isEdge(\\\"A\\\", \\\"B\\\"));\\n System.out.println( \\\"isArc A-->C (TRUE):\\\" + a.isArc( \\\"A\\\",\\\"C\\\"));\\n System.out.println( \\\"isEdge D<-->E (FALSE):\\\" + a.isEdge( \\\"D\\\",\\\"E\\\" ));\\n System.out.println( \\\"isArc D -> E (TRUE):\\\" + a.isArc( \\\"D\\\",\\\"E\\\" ));\\n System.out.println( \\\"isArc E -> D (FALSE):\\\" + a.isArc( \\\"E\\\",\\\"D\\\" ));\\n System.out.println( \\\"Removing vertex A.\\\");\\n a.removeVertex( \\\"A\\\" );\\n System.out.println( \\\"Adding edge B<-->D\\\");\\n a.addEdge( \\\"B\\\",\\\"D\\\" );\\n System.out.println( \\\"Number of vertices (4):\\\" + a.getNumVertices());\\n System.out.println( \\\"Number of arcs (5):\\\" + a.getNumArcs());\\n System.out.println( a );\\n System.out.println( \\\"Adj to B ([C,D]):\\\" + a.getSuccessors( \\\"B\\\" ) );\\n System.out.println( \\\"Adj to C ([B]):\\\" + a.getSuccessors( \\\"C\\\" ));\\n System.out.println( \\\"Adding A (at the end of vertices).\\\" );\\n a.addVertex( \\\"A\\\" ); \\n System.out.println( \\\"Adding B (should be ignored).\\\" );\\n a.addVertex( \\\"B\\\" );\\n System.out.println( \\\"Saving the graph into BCDEA.tgf\\\" );\\n a.saveToTGF( \\\"BCDEA.tgf\\\" );\\n System.out.println( \\\"Adding F->G->H->I->J->K->A.\\\" );\\n a.addVertex( \\\"F\\\" );\\n a.addVertex( \\\"G\\\" );\\n a.addArc( \\\"F\\\", \\\"G\\\" );\\n a.addVertex( \\\"H\\\" );\\n a.addArc( \\\"G\\\", \\\"H\\\" );\\n a.addVertex( \\\"I\\\" );\\n a.addArc( \\\"H\\\", \\\"I\\\" );\\n a.addVertex( \\\"J\\\" );\\n a.addArc( \\\"I\\\", \\\"J\\\" );\\n a.addVertex( \\\"K\\\" );\\n a.addArc( \\\"J\\\", \\\"K\\\" );\\n a.addArc( \\\"K\\\", \\\"A\\\" );\\n System.out.println( a );\\n System.out.println( \\\"Saving the graph into A-K.tgf\\\" );\\n a.saveToTGF( \\\"A-K.tgf\\\" );\\n }\",\n \"DFS(int ver){\\n // assign the nu,mber of vertex\\n v = ver;\\n // assign the number of boolean at it's vertex\\n visited = new boolean[ver];\\n // assisgn the array with the vertex length\\n pre = new int[ver];\\n // asssigning the adjList length\\n adjList = new ArrayList[ver];\\n\\n // now going throgh the loop and adding the newList to adjList each index , in pre making all -1, and false in all visited\\n for (int x=0; x<ver; x+=1){\\n adjList[x] = new ArrayList();\\n\\n // for the visited boolean value false\\n visited[x] = false;\\n\\n // pre \\n pre[x]=-1;\\n }\\n }\",\n \"AdjacencyGraph(){\\r\\n vertices = new HashMap<>();\\r\\n }\",\n \"Graph(int v) {\\n this.v = v;\\n array = new ArrayList[v];\\n\\n // Add linkedList to array\\n for (int i = 0; i < v; i++) {\\n array[i] = new ArrayList<>();\\n }\\n }\",\n \"public int[][] getAdjacencyMatrix();\",\n \"List<Integer> adj(int v) {\\n return adj[v];\\n }\",\n \"public AdjacencyLists(int size) {\\r\\n\\t\\tgraph = new ArrayList[size];\\r\\n\\t}\",\n \"private void createAdjacencyLists(List<Edges> edges,int numberOfVertices){\\n\\t\\t\\n\\t\\tfor(int i=0;i<numberOfVertices;i++){\\n\\t\\t\\tneighbors.add(new ArrayList<Integer>());\\n\\t\\t}\\n\\t\\tfor(Edges edge:edges){\\n\\t\\t\\tneighbors.get(edge.u).add(edge.v);\\n\\t\\t}\\n\\t\\t\\n\\t}\",\n \"public void printAdjacencyList() {\\n \\n for ( int i=0; i<vertex_adjacency_list.size(); i++ ) {\\n \\n vertex_adjacency_list.get( i ).printVertex();\\n \\n }\\n \\n }\",\n \"@SuppressWarnings(\\\"unchecked\\\")\\n private void initAdjList()\\n {\\n adjList = new ArrayList[v];\\n\\n for(int i = 0; i < v; i++)\\n {\\n adjList[i] = new ArrayList<>();\\n }\\n }\",\n \"public Graph() // constructor\\n{\\n vertexList = new Vertex[MAX_VERTS];\\n // adjacency matrix\\n adjMat = new int[MAX_VERTS][MAX_VERTS];\\n nVerts = 0;\\n for (int j = 0; j < MAX_VERTS; j++) // set adjacency\\n for (int k = 0; k < MAX_VERTS; k++) // matrix to 0\\n adjMat[j][k] = INFINITY;\\n}\",\n \"public void addVertex (){\\t\\t \\n\\t\\tthis.graph.insert( new MyList<Integer>() );\\n\\t}\",\n \"public Vertex[] createGraph(){\\n\\t\\t /* constructing a graph using matrices\\n\\t\\t * If there is a connection between two adjacent LETTERS, the \\n\\t * cell will contain a num > 1, otherwise a 0. A value of -1 in the\\n\\t * cell denotes that the cities are not neighbors.\\n\\t * \\n\\t * GRAPH (with weights b/w nodes):\\n\\t * E+---12-------+B--------18-----+F----2---+C\\n\\t * +\\t\\t\\t\\t+\\t\\t\\t\\t +\\t\\t +\\n\\t * |\\t\\t\\t\\t|\\t\\t\\t\\t/\\t\\t |\\n\\t * |\\t\\t\\t\\t|\\t\\t\\t |\\t\\t |\\n\\t * |\\t\\t\\t\\t|\\t\\t\\t |\\t\\t 10\\n\\t * 24\\t\\t\\t\\t8\\t\\t\\t 8\\t |\\n\\t * |\\t\\t\\t\\t|\\t\\t\\t |\\t\\t +\\n\\t * |\\t\\t\\t\\t|\\t\\t\\t | H <+---11---I\\n\\t * |\\t\\t\\t\\t|\\t\\t\\t /\\n\\t * +\\t\\t\\t\\t+\\t\\t\\t +\\n\\t * G+---12----+A(start)+---10--+D\\n\\t * \\n\\t * NOTE: I is the only unidirectional node\\n\\t */\\n\\t\\t\\n\\t\\tint cols = 9;\\n\\t\\tint rows = 9;\\n\\t\\t//adjacency matrix\\n\\t\\t\\t\\t //A B C D E F G H I\\n\\t int graph[][] = { {0,8,0,10,0,0,12,0,0}, //A\\n\\t {8,0,0,0,12,18,0,0,0}, //B\\n\\t {0,0,0,0,0,2,0,10,0}, //C\\n\\t {10,0,0,0,0,8,0,0,0}, //D\\n\\t {0,12,0,0,0,0,24,0,0}, //E\\n\\t {0,18,2,8,0,0,0,0,0}, //F\\n\\t {12,0,0,0,0,0,24,0,0}, //G\\n\\t {0,0,10,0,0,0,0,0,11}, //H\\n\\t {0,0,0,0,0,0,0,11,0}}; //I\\n\\t \\n\\t //initialize stores vertices\\n\\t Vertex[] vertices = new Vertex[rows]; \\n\\n\\t //Go through each row and collect all [i,col] >= 1 (neighbors)\\n\\t int weight = 0; //weight of the neighbor\\n\\t for (int i = 0; i < rows; i++) {\\n\\t \\tVector<Integer> vec = new Vector<Integer>(rows);\\n\\t\\t\\tfor (int j = 0; j < cols; j++) {\\n\\t\\t\\t\\tif (graph[i][j] >= 1) {\\n\\t\\t\\t\\t\\tvec.add(j);\\n\\t\\t\\t\\t\\tweight = j;\\n\\t\\t\\t\\t}//is a neighbor\\n\\t\\t\\t}\\n\\t\\t\\tvertices[i] = new Vertex(Vertex.getVertexName(i), vec);\\n\\t\\t\\tvertices[i].state = weight;\\n\\t\\t\\tvec = null; // Allow garbage collection\\n\\t\\t}\\n\\t return vertices;\\n\\t}\",\n \"public static ArrayList<Vertex> initializeGraph() {\\n\\t\\tVertex uVertex = new Vertex('u');\\n\\t\\tVertex vVertex = new Vertex('v');\\n\\t\\tVertex wVertex = new Vertex('w');\\n\\t\\tVertex xVertex = new Vertex('x');\\n\\t\\tVertex yVertex = new Vertex('y');\\n\\t\\tVertex zVertex = new Vertex('z');\\n\\t\\t\\n\\t\\tVertex[] uAdjacencyList = {xVertex, vVertex};\\n\\t\\tuVertex.setAdjacencyList(createArrayList( uAdjacencyList ));\\n\\t\\t\\n\\t\\tVertex[] vAdjacencyList = {yVertex};\\n\\t\\tvVertex.setAdjacencyList(createArrayList( vAdjacencyList ));\\n\\t\\t\\n\\t\\tVertex[] wAdjacencyList = {zVertex, yVertex};\\n\\t\\twVertex.setAdjacencyList(createArrayList( wAdjacencyList ));\\n\\t\\t\\n\\t\\tVertex[] xAdjacencyList = {vVertex};\\n\\t\\txVertex.setAdjacencyList(createArrayList( xAdjacencyList ));\\n\\t\\t\\n\\t\\tVertex[] yAdjacencyList = {xVertex};\\n\\t\\tyVertex.setAdjacencyList(createArrayList( yAdjacencyList ));\\n\\t\\t\\n\\t\\tVertex[] zAdjacencyList = {zVertex};\\n\\t\\tzVertex.setAdjacencyList(createArrayList( zAdjacencyList ));\\n\\n\\t\\tVertex[] graph = { uVertex, vVertex, wVertex, xVertex, yVertex, zVertex};\\n\\t\\treturn createArrayList( graph );\\n\\n\\t}\",\n \"Digraph(int v) {\\n this.V = v;\\n adj = (List<Integer>[]) new ArrayList[V];\\n for (int i = 0; i < V; i++) {\\n adj[i] = new ArrayList<>();\\n }\\n }\",\n \"public AdjacencyLists(String filename)\\n {\\n readGraph(filename);\\n }\",\n \"public WeightedAdjacencyGraph() {\\n this.vertices = new HashMap<>();\\n }\",\n \"Graph(int v) {\\n V = v;\\n adj = new LinkedList[v];\\n for (int i = 0; i < v; ++i)\\n adj [i] = new LinkedList();\\n }\",\n \"public List neighbors(int vertex) {\\n// your code here\\n LinkedList<Integer> result = new LinkedList<>();\\n LinkedList<Edge> list = adjLists[vertex];\\n for (Edge a : list) {\\n result.add(a.to());\\n }\\n//List<Integer> list = new List<Integer>();\\n return result;\\n }\",\n \"public void printAdjacencyMatrix();\",\n \"public AdjacencyMatrix ( Graph g ) {\\n dim = g.getNumberOfVertices();\\n matrix = new int[dim][dim];\\n ids = new int[dim];\\n reachable = new boolean[dim];\\n agentNames = new String[dim][];\\n for ( Vertex v : g.getVertices() ) {\\n int i = g.getVertices().indexOf(v);\\n String name = g.getVertices().get(i).getName();\\n name = name.replace(\\\"vertex\\\", \\\"\\\");\\n try {\\n ids[i] = Integer.parseInt(name);\\n }\\n catch ( Exception ex ) {\\n }\\n if ( v.isAdjacentTo(g.getPosition()) )\\n reachable[i] = true;\\n agentNames[i] = v.getAgentNames();\\n }\\n position = g.getVertices().indexOf(g.getPosition());\\n LinkedList<Vertex> vertices = g.getVertices();\\n for ( Edge e : g.getEdges() ) {\\n int i = vertices.indexOf(e.getVertices()[0]);\\n int j = vertices.indexOf(e.getVertices()[1]);\\n if ( !e.isSurveyed() )\\n matrix[i][j] = matrix[j][i] = -1;\\n else\\n matrix[i][j] = matrix[j][i] = e.getWeight();\\n }\\n }\",\n \"@SuppressWarnings(\\\"rawtypes\\\")\\n\\tpublic Set getAdjList(){ \\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// getter for the adjacency list\\n\\t\\treturn adjList; \\n\\t}\",\n \"private ArrayList<Edge>getFullyConnectedGraph(){\\n\\t\\tArrayList<Edge> edges = new ArrayList<>();\\n\\t\\tfor(int i=0;i<nodes.size();i++){\\n\\t\\t\\tfor(int j=i+1;j<nodes.size();j++){\\n\\t\\t\\t\\tEdge edge = new Edge(nodes.get(i), nodes.get(j),Utils.distance(nodes.get(i), nodes.get(j)));\\n\\t\\t\\t\\tedges.add(edge);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn edges;\\n\\t}\",\n \"Graph(){\\n\\t\\tadjlist = new HashMap<String, Vertex>();\\n\\t\\tvertices = 0;\\n\\t\\tedges = 0;\\n\\t\\tkeys = new ArrayList<String>();\\n\\t}\",\n \"private void buildGraph(String[] words,int indegree[], HashMap<Character, Set<Character>> adjList){\\n // initialise the adj list graph with all charac ters in all words\\n for(String word:words ){\\n for(char c: word.toCharArray()){\\n adjList.putIfAbsent(c, new HashSet());\\n }\\n }// once u fill with init, then u eatblish relationships\\n \\n // wrt and er \\n for(int i=1; i<words.length;i++){\\n String first = words[i-1];\\n String second = words[i];\\n // now compare each char in thos words\\n for(int j=0; j< Math.min(first.length(),second.length());j++){\\n if(first.charAt(j) != second.charAt(j)){\\n // a->b here out=a, in=b\\n char out = first.charAt(j);\\n char in = second.charAt(j);\\n // a->b , so in adj list. we need to insert the valiue if not present\\n // if the graph does not contains dependecny, which is in set, u add it else u dont add// since hashset, we can check usinhg contains i guess\\n if(! adjList.get(out).contains(in)){\\n adjList.get(out).add(in);\\n \\n indegree[in -'a']++;\\n }\\n // once it is found , u can break out th e loop\\n break;\\n \\n }// if eqaual we mmove to next char and do the process\\n }\\n }\\n }\",\n \"@Override\\r\\n public List<Vertex> getVertices() {\\r\\n List<Vertex> verticesList = new LinkedList<>(adjacencyList.keySet()); //getting the key set of adjacencyList i.e, a list of all vertices\\r\\n Collections.sort(verticesList, Comparator.comparing(Vertex::getLabel));\\r\\n return verticesList;\\r\\n }\",\n \"public Iterable<DirectedEdge> adj(int v) \\n {\\n return adj[v];\\n }\",\n \"private void addLinkesToGraph()\\n\\t{\\n\\t\\tString from,to;\\n\\t\\tshort sourcePort,destPort;\\n\\t\\tMap<Long, Set<Link>> mapswitch= linkDiscover.getSwitchLinks();\\n\\n\\t\\tfor(Long switchId:mapswitch.keySet())\\n\\t\\t{\\n\\t\\t\\tfor(Link l: mapswitch.get(switchId))\\n\\t\\t\\t{\\n\\t\\t\\t\\tfrom = Long.toString(l.getSrc());\\n\\t\\t\\t\\tto = Long.toString(l.getDst());\\n\\t\\t\\t\\tsourcePort = l.getSrcPort();\\n\\t\\t\\t\\tdestPort = l.getDstPort();\\n\\t\\t\\t\\tm_graph.addEdge(from, to, Capacity ,sourcePort,destPort);\\n\\t\\t\\t} \\n\\t\\t}\\n\\t\\tSystem.out.println(m_graph);\\n\\t}\",\n \"public AdjacencyLists(int num)\\n {\\n numVertices = num;\\n clearGraph();\\n }\",\n \"public Map<V,List<E>> adjacencyMap(){\\n\\t\\tMap<V,List<E>> ret = new HashMap<V,List<E>>();\\n\\t\\tfor (E e : edges){\\n\\t\\t\\tif (virtualEdges.contains(e))\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\tList<E> list;\\n\\t\\t\\tif (!ret.containsKey(e.getOrigin())){\\n\\t\\t\\t\\tlist = new ArrayList<E>();\\n\\t\\t\\t\\tret.put(e.getOrigin(), list);\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t\\tlist = ret.get(e.getOrigin());\\n\\t\\t\\tlist.add(e);\\n\\t\\t\\t\\n\\t\\t\\tif (!ret.containsKey(e.getDestination())){\\n\\t\\t\\t\\tlist = new ArrayList<E>();\\n\\t\\t\\t\\tret.put(e.getDestination(), list);\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t\\tlist = ret.get(e.getDestination());\\n\\t\\t\\tlist.add(e);\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}\",\n \"@Override\\r\\n public void addVertex(Vertex v) {\\r\\n adjacencyList.put(v, new ArrayList<>()); //putting v into key, a new LinkedList into value for later use\\r\\n }\",\n \"public Graph(int numberOfVertices){\\r\\n this.numberOfVertices = numberOfVertices;\\r\\n this.adjacencyList = new TreeMap<>();\\r\\n }\",\n \"public void buildGraph(){\\n\\t}\",\n \"public ListGraph(int numV, boolean directed) {\\r\\n super(numV, directed);\\r\\n edges = new List[numV];\\r\\n for (int i = 0; i < numV; i++) {\\r\\n edges[i] = new LinkedList < Edge > ();\\r\\n }\\r\\n }\",\n \"static int[] topoSort(int V, ArrayList<ArrayList<Integer>> adj)\\n {\\n int indegree[] = new int[V];\\n for(ArrayList<Integer> v : adj){\\n for(Integer c : v){\\n indegree[c]++;\\n }\\n }\\n Queue<Integer> q = new LinkedList();\\n for(int i=0;i<V;i++){\\n if(indegree[i]==0){\\n q.add(i);\\n }\\n }\\n List<Integer> top = new ArrayList();\\n int c = 0;\\n while (!q.isEmpty()){\\n Integer node = q.poll();\\n top.add(node);\\n c++;\\n for(int child : adj.get(node)){\\n indegree[child]--;\\n if(indegree[child]==0){\\n q.add(child);\\n }\\n }\\n }\\n if(c==V){\\n int ans[] = new int[top.size()];\\n for(int i=0;i<top.size();i++){\\n ans[i] = top.get(i);\\n }\\n return ans;\\n }\\n// System.out.println(\\\"Cycle exists\\\");\\n return null;\\n }\",\n \"public void main() {\\n\\t\\tint size = 100;\\n \\tadjacencyList = new ArrayList<int[]>(size + 1);\\n \\tint[] emptyNodeArray;\\n// nodes = new HashMap<Integer, Integer>(size);\\n for (int i = 0; i <= size; i++) {\\n \\temptyNodeArray = new int[] {};\\n \\tadjacencyList.add(i, emptyNodeArray);\\n// \\tnodes.put(i, -1); // initialize all node distances to -1\\n }\\n\\t\\tint n1 = 0, n2 = 1;\\n \\tint indexToLast;\\n \\tint[] destinationsList = adjacencyList.get(n1);\\n \\tif (destinationsList == null) { \\n \\t\\tindexToLast = 0;\\n \\t} else {\\n \\t\\tindexToLast = destinationsList.length;\\n \\t}\\n \\tdestinationsList[indexToLast] = n2;\\n\\t}\",\n \"private void buildGraph()\\n\\t{\\n\\t\\taddVerticesToGraph();\\n\\t\\taddLinkesToGraph();\\n\\t}\",\n \"public Iterable<Integer> adj(int v)\\n { return adj[v]; }\",\n \"@DisplayName(\\\"Add directed edge\\\")\\n @Test\\n public void testAddEdgeDirected() {\\n graph.addEdge(new Edge(3, 4));\\n List<Integer> l = new ArrayList<>();\\n l.add(2);\\n l.add(4);\\n Assertions.assertArrayEquals(l.toArray(), graph.getNeighbours(3).toArray());\\n }\",\n \"public interface Graph {\\n\\n\\t/**\\n\\t * Method to add the edge from start to end to the graph.\\n\\t * Adding self-loops is not allowed.\\n\\t * @param start start vertex\\n\\t * @param end end vertex\\n\\t */\\n\\tpublic void addEdge(int start, int end);\\n\\n\\t/**\\n\\t * Method to add the edge with the given weight to the graph from start to end.\\n\\t * Adding self-loops is not allowed.\\n\\t * @param start number of start vertex\\n\\t * @param end number of end vertex\\n\\t * @param weight weight of edge\\n\\t */\\n\\tpublic void addEdge(int start, int end, double weight);\\n\\n\\t/**\\n\\t * Method to add a vertex to the graph.\\n\\t */\\n\\tpublic void addVertex();\\n\\t\\n\\t/**\\n\\t * Method to add multiple vertices to the graph.\\n\\t * @param n number of vertices to add\\n\\t */\\n\\tpublic void addVertices(int n);\\n\\n\\t/**\\n\\t * Returns all neighbors of the given vertex v (all vertices i with {i,v} in E or (i,v) or (v,i) in E).\\n\\t * @param v vertex whose neighbors shall be returned\\n\\t * @return List of vertices adjacent to v\\n\\t */\\n\\tpublic List<Integer> getNeighbors(int v);\\n\\n\\t/**\\n\\t * Returns a list containing all predecessors of v. In an undirected graph all neighbors are returned.\\n\\t * @param v vertex id\\n\\t * @return list containing all predecessors of v\\n\\t */\\n\\tpublic List<Integer> getPredecessors(int v);\\n\\n\\t/**\\n\\t * Returns a list containing all successors v. In an undirected graph all neighbors are returned.\\n\\t * @param v vertex id\\n\\t * @return list containing all edges starting in v\\n\\t */\\n\\tpublic List<Integer> getSuccessors(int v);\\n\\n\\t/**\\n\\t * Method to get the number of vertices.\\n\\t * @return number of vertices\\n\\t */\\n\\tpublic int getVertexCount();\\n\\n\\t/**\\n\\t * Method to get the weight of the edge {start, end} / the arc (start, end).\\n\\t * @param start start vertex of edge / arc\\n\\t * @param end end vertex of edge / arc\\n\\t * @return Double.POSITIVE_INFINITY, if the edge does not exist, c_{start, end} otherwise\\n\\t */\\n\\tpublic double getEdgeWeight(int start, int end);\\n\\n\\t/**\\n\\t * Method to test whether the graph contains the edge {start, end} / the arc (start, end).\\n\\t * @param start start vertex of the edge\\n\\t * @param end end vertex of the edge\\n\\t */\\n\\tpublic boolean hasEdge(int start, int end);\\n\\n\\t/**\\n\\t * Method to remove an edge from the graph, defined by the vertices start and end.\\n\\t * @param start start vertex of the edge\\n\\t * @param end end vertex of the edge\\n\\t */\\n\\tpublic void removeEdge(int start, int end);\\n\\n\\t/**\\n\\t * Method to remove the last vertex from the graph.\\n\\t */\\n\\tpublic void removeVertex();\\n\\n\\t/**\\n\\t * Returns whether the graph is weighted.\\n\\t * A graph is weighted if an edge with weight different from 1.0 has been added to the graph.\\n\\t * @return true if the graph is weighted\\n\\t */\\n\\tpublic boolean isWeighted();\\n\\n\\t/**\\n\\t * Returns whether the graph is directed.\\n\\t * @return true if the graph is directed\\n\\t */\\n\\tpublic boolean isDirected();\\n\\n}\",\n \"Graph() {\\r\\n\\t\\tvertices = new LinkedList<Vertex>();\\r\\n\\t\\tedges = 0;\\r\\n\\r\\n\\t\\tfor (int i = 0; i < 26; i++) {\\r\\n\\t\\t\\t// ASCII value of 'A' is 65\\r\\n\\t\\t\\tVertex vertex = new Vertex((char) (i + 65));\\r\\n\\t\\t\\tvertices.add(vertex);\\r\\n\\t\\t}\\r\\n\\t\\tcurrentVertex = vertices.get(0);\\r\\n\\t\\tseen = new boolean[26];\\r\\n\\t}\",\n \"public void addToList(Vertex newVertex)\\n\\t{\\n\\t\\tadjacencyList.add(newVertex);\\n\\t\\tupdateIndegree();\\n\\t}\",\n \"void addEdge(int vertex1, int vertex2){\\n adjList[vertex1].add(vertex2);\\n adjList[vertex2].add(vertex1);\\n }\",\n \"public void dfs(LinkedList<Node>[] adjList){\\n Set<Integer> visited = new HashSet<>();\\n\\n for(LinkedList<Node> node: adjList){\\n Node curr = node.getFirst();\\n if(!visited.contains(curr)){\\n ArrayList<Integer> components = new ArrayList<>();\\n components = getConnectedComponets(curr, visited, components);\\n System.out.printf(\\\"do something %s\\\", components.toString());\\n }\\n }\\n }\",\n \"public Iterable<Edge> adj(int v) {\\n return adj[v];\\n }\",\n \"public WeightedGraph(List<K> v)\\n\\t{\\n\\t // make ourselves a private copy of the vertex set\\n\\t verts = new HashSet<K>(v);\\n\\n\\t // set up empty adkacency lists for each vertex\\n\\t adjLists = new HashMap<K, List<HashMap<K, Integer>>>();\\n\\t for (K src : verts)\\n\\t\\t{\\n\\t\\t adjLists.put(src, new ArrayList<HashMap<K, Integer>>());\\n\\t\\t}\\n\\t}\",\n \"Iterable<Long> vertices() {\\n //YOUR CODE HERE, this currently returns only an empty list.\\n ArrayList<Long> verticesIter = new ArrayList<>();\\n verticesIter.addAll(adj.keySet());\\n return verticesIter;\\n }\",\n \"public ArrayList<Integer> nodosAdyacentesA(final int nodo) {\\n\\t\\tArrayList<Integer> adyacentes = new ArrayList<Integer>();\\n\\t\\tfor (int i = 0; i < matriz.getDimension(); i++) {\\n\\t\\t\\tif (esAdyacente(nodo, i) && nodo != i) {\\n\\t\\t\\t\\tadyacentes.add(i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn adyacentes;\\n\\t}\",\n \"private List<V> getNewVertexOrderIfAcyclic () {\\n Map<V, Integer> indegree = inDegree();\\n // Determine all vertices with zero in-degree\\n Stack<V> zeroIncomingVertex = new Stack<V>(); \\n for (V v: indegree.keySet()) {\\n if (indegree.get(v) == 0) zeroIncomingVertex.push(v);\\n }\\n \\n // Determine the vertex order\\n List<V> result = new ArrayList<V>();\\n while (!zeroIncomingVertex.isEmpty()) {\\n V v = zeroIncomingVertex.pop(); // Choose a vertex with zero in-degree\\n result.add(v); // Vertex v is next in vertex ordering\\n // \\\"Remove\\\" vertex v by updating its neighbors\\n for (V neighbor: dag.get(v)) {\\n indegree.put(neighbor, indegree.get(neighbor) - 1);\\n // Remember any vertices that now have zero in-degree\\n if (indegree.get(neighbor) == 0) zeroIncomingVertex.push(neighbor);\\n }\\n }\\n // Check that we have used the entire graph. If not then there was a cycle.\\n if (result.size() != dag.size()) return null;\\n return result;\\n }\",\n \"public static Graph instantiateAdjacencyMatrixGraph() {\\r\\n\\t\\treturn new AdjacencyMatrixGraph();\\r\\n\\t}\",\n \"public static void main(String[] args) throws IOException {\\n AdjListGraph adjListGraph = null;\\r\\n AdjMatrixGraph adjMatGraph = null;\\r\\n AdjMatrixMoreEfficientGraph adjEffGraph = null;\\r\\n \\r\\n // Create object for input sequence according to the file name\\r\\n BufferedReader br = new BufferedReader(new InputStreamReader(System.in));\\r\\n System.out.print(\\\"Enter input filename: \\\");\\r\\n String filename = br.readLine();\\r\\n \\r\\n // Inserting data to each graph, pay attention to different path representation for ubuntu and windows\\r\\n In inputFile = new In(\\\"data/\\\" + filename);\\r\\n adjListGraph = new AdjListGraph(inputFile);\\r\\n inputFile = new In(\\\"data/\\\" + filename);\\r\\n adjMatGraph = new AdjMatrixGraph(inputFile);\\r\\n inputFile = new In(\\\"data/\\\" + filename);\\r\\n adjEffGraph = new AdjMatrixMoreEfficientGraph(inputFile);\\r\\n \\r\\n /*\\r\\n * Step 2\\r\\n * get the size of graph of each representation\\r\\n * AdjListGraph.java: adj\\r\\n * AdjMatrixGraph.java: adj\\r\\n\\t\\t * Please use adjListGraph.sizeOfGraph() to get the memory usage of the graph with list implementation. \\r\\n\\t\\t * Please use adjMatGraph.sizeOfGraph() to get the memory usage of the graph with matrix implementation. \\r\\n */\\r\\n \\r\\n // Output every required data from all versions\\r\\n System.out.format(\\\"1. Number of vertices = %d \\\\n\\\", adjListGraph.V());\\r\\n System.out.format(\\\"2. Number of edges = %d \\\\n\\\", adjListGraph.E());\\r\\n System.out.format(\\\"3. Output of the graph using adjacency list:\\\\n\\\");\\r\\n //adjListGraph.printGraph();\\r\\n System.out.format(\\\"4. Adjacency list\\\\n (a) Memory needed to record edges = %d\\\\n\\\", adjListGraph.E() * Size.INTEGER);\\r\\n System.out.format(\\\" (b) Total amount of memory used = %d\\\\n\\\", adjListGraph.sizeOfGraph());\\r\\n System.out.format(\\\" (c) Efficiency = %f\\\\n\\\", 100.0 * adjListGraph.E() * Size.INTEGER / adjListGraph.sizeOfGraph());\\r\\n System.out.format(\\\"5. Output of the graph using matrix:\\\\n\\\");\\r\\n //adjMatGraph.printGraph();\\r\\n System.out.format(\\\"6. Adjacency matrix\\\\n (a) Memory needed to record edges = %d\\\\n\\\", adjMatGraph.E() * Size.BOOLEAN);\\r\\n System.out.format(\\\" (b) Total amount of memory used = %d\\\\n\\\", adjMatGraph.sizeOfGraph());\\r\\n System.out.format(\\\" (c) Efficiency = %f\\\\n\\\", 100.0 * adjMatGraph.E() * Size.BOOLEAN / adjMatGraph.sizeOfGraph());\\r\\n //adjEffGraph.printGraph();\\r\\n System.out.format(\\\"Additional task: Efficient Adjacency matrix\\\\n (a) Memory needed to record edges = %d\\\\n\\\", adjEffGraph.E() * Size.BOOLEAN);\\r\\n System.out.format(\\\" (b) Total amount of memory used = %d\\\\n\\\", adjEffGraph.sizeOfGraph());\\r\\n System.out.format(\\\" (c) Efficiency = %f\\\\n\\\", 100.0 * adjEffGraph.E() * Size.BOOLEAN / adjEffGraph.sizeOfGraph());\\r\\n }\",\n \"private List<routerNode> getPathVertexList(routerNode beginNode, routerNode endNode) {\\r\\n\\t\\tTransformer<routerLink, Integer> wtTransformer; // transformer for getting edge weight\\r\\n\\t\\twtTransformer = new Transformer<routerLink, Integer>() {\\r\\n public Integer transform(routerLink link) {\\r\\n return link.getWeight();\\r\\n \\t}\\r\\n };\\t\\t\\r\\n\\r\\n\\t\\t\\r\\n\\t\\tList<routerNode> vlist;\\r\\n\\t\\tDijkstraShortestPath<routerNode, routerLink> DSPath = \\r\\n\\t \\t new DijkstraShortestPath<routerNode, routerLink>(gGraph, wtTransformer);\\r\\n \\t// get the shortest path in the form of edge list \\r\\n List<routerLink> elist = DSPath.getPath(beginNode, endNode);\\r\\n\\t\\t\\r\\n \\t\\t// get the node list form the shortest path\\r\\n\\t Iterator<routerLink> ebIter = elist.iterator();\\r\\n\\t vlist = new ArrayList<routerNode>(elist.size() + 1);\\r\\n \\tvlist.add(0, beginNode);\\r\\n\\t for(int i=0; i<elist.size(); i++){\\r\\n\\t\\t routerLink aLink = ebIter.next();\\r\\n\\t \\t \\t// get the nodes corresponding to the edge\\r\\n \\t\\tPair<routerNode> endpoints = gGraph.getEndpoints(aLink);\\r\\n\\t routerNode V1 = endpoints.getFirst();\\r\\n\\t routerNode V2 = endpoints.getSecond();\\r\\n\\t \\tif(vlist.get(i) == V1)\\r\\n\\t \\t vlist.add(i+1, V2);\\r\\n\\t else\\r\\n\\t \\tvlist.add(i+1, V1);\\r\\n\\t }\\r\\n\\t return vlist;\\r\\n\\t}\",\n \"private static void addAllEdgeInstances (Graph graph, boolean isDirected){\\n Collection<Node> noteSet = graph.getNodeSet();\\n\\n for (Iterator<Node> iterator = noteSet.iterator(); iterator.hasNext();) {\\n Node startNode = (Node) iterator.next();\\n\\n for (Iterator<Node> iterator2 = noteSet.iterator(); iterator2.hasNext();) {\\n Node endNode = (Node) iterator2.next();\\n\\n if (!(startNode == endNode)){\\n graph.addEdge(startNode.toString().concat(endNode.toString()), startNode, endNode, isDirected);\\n }\\n\\n }\\n }\\n }\",\n \"public static ArrayList<String> connectors2(Graph g) {\\n boolean[] visits = new boolean[g.members.length]; \\n for (int i=0;i<=g.members.length-1;i++) {\\n \\tvisits[i]=false;\\n }\\n int[] dfsnum = new int[g.members.length];\\n int[] back = new int[g.members.length];\\n ArrayList<String> answer = new ArrayList<String>();\\n\\n //driver portion\\n for (Person person : g.members) {\\n //if it hasn't been visited\\n if (visits[g.map.get(person.name)]==false){\\n //for different islands\\n dfsnum = new int[g.members.length];\\n dfs(g.map.get(person.name), g.map.get(person.name), g, visits, dfsnum, back, answer);\\n }\\n }\\n \\n //check if vertex has one neighbor\\n for (int i = 0; i < answer.size(); i++) {\\n Friend ptr = g.members[g.map.get(answer.get(i))].first;\\n //counts number of neighbors\\n int count = 0;\\n while (ptr != null) {\\n ptr = ptr.next;\\n count++;\\n }\\n if (count == 1) answer.remove(i);\\n if (count == 0) answer.remove(i);\\n } \\n for (Person member : g.members) {\\n if (member.first!=null&& member.first.next == null) {\\n if (answer.contains(g.members[member.first.fnum].name)==false)\\n \\t\\t answer.add(g.members[member.first.fnum].name);\\n }\\n }\\n answer=modify(answer,g);\\n if (answer==null||answer.size()==0) return null;\\n return answer;\\n }\",\n \"public ListGraph(int numberOfVertex, boolean directed) throws Exception {\\n super(numberOfVertex, directed);\\n\\n edges = new List[numberOfVertex];\\n\\n for(int index = 0; index < numberOfVertex; ++index)\\n this.edges[index] = new LinkedList<Edge>();\\n }\",\n \"@Override\\r\\n\\tpublic void FloydWarshall() {\\r\\n\\t\\tgraphForWarshall = new AdjacencyMatrixGraph<>(getOrder(), isDirected);\\r\\n\\t\\tvertices.forEach((E t, Vertex<E> u) -> {\\r\\n\\t\\t\\tgraphForWarshall.insertVertex(t);\\r\\n\\t\\t});\\r\\n\\t\\tadjacencyLists.forEach((E t, ArrayList<Edge<E>> u) -> {\\r\\n\\t\\t\\tfor(Edge<E> ale : u) {\\r\\n\\t\\t\\t\\tgraphForWarshall.link(ale.getSrc(), ale.getDst(), ale.getWeight());\\r\\n\\t\\t\\t}\\r\\n\\t\\t});\\r\\n\\t\\tgraphForWarshall.FloydWarshall();\\r\\n\\t}\",\n \"public static void main(String[] args) {\\n\\n Graph myGraph = new Graph();\\n myGraph.addNode(\\\"8\\\");\\n myGraph.addNode(\\\"1\\\");\\n myGraph.addNode(\\\"2\\\");\\n myGraph.addNode(\\\"9\\\");\\n myGraph.addNode(\\\"7\\\");\\n myGraph.addNode(\\\"5\\\");\\n myGraph.addEdge(\\\"8\\\" , \\\"1\\\" , 50);\\n myGraph.addEdge(\\\"5\\\" , \\\"1\\\" , 70);\\n myGraph.addEdge(\\\"7\\\" , \\\"5\\\", 20);\\n myGraph.addEdge(\\\"8\\\" , \\\"9\\\", 100);\\n myGraph.addEdge(\\\"8\\\" , \\\"2\\\", 40);\\n String[] trip = {\\\"8\\\" , \\\"1\\\" , \\\"5\\\"};\\n String[] trip2 = {\\\"8\\\" , \\\"5\\\"};\\n String[] trip3 = {\\\"8\\\" , \\\"1\\\" , \\\"5\\\" , \\\"7\\\" , \\\"5\\\" , \\\"1\\\" , \\\"8\\\" , \\\"9\\\"};\\n String[] trip4 = {\\\"8\\\" , \\\"9\\\" , \\\"5\\\" };\\n String[] trip5 = {\\\"8\\\"};\\n String[] trip6 = {\\\"8\\\" , \\\"2\\\"};\\n// System.out.println(myGraph);\\n// System.out.println(myGraph.getNodes());\\n// System.out.println(myGraph.getNeighbors(\\\"8\\\"));\\n// System.out.println(myGraph.getNeighbors(\\\"7\\\"));\\n// System.out.println(myGraph.getNeighbors(\\\"5\\\"));\\n// System.out.println(myGraph.size());\\n// System.out.println(myGraph.breadthFirst(\\\"8\\\"));\\n// System.out.println(myGraph.weightList);\\n// System.out.println(myGraph.breadthFirst(\\\"7\\\"));\\n// System.out.println(myGraph.breadthFirst(\\\"5\\\"));\\n// System.out.println(myGraph.businessTrip(\\\"8\\\",trip));\\n// System.out.println(myGraph.businessTrip(\\\"8\\\",trip2));\\n// System.out.println(myGraph.businessTrip(\\\"8\\\",trip3));\\n// System.out.println(myGraph.businessTrip(\\\"8\\\",trip4));\\n// System.out.println(myGraph.businessTrip(\\\"8\\\",trip5));\\n// System.out.println(myGraph.businessTrip(\\\"8\\\",trip6));\\n System.out.println(myGraph.depthFirst(\\\"8\\\"));\\n }\",\n \"private void addVerticesToGraph()\\n\\t{\\n\\t\\tString vertexName;\\n\\n\\t\\tMap<Long, IOFSwitch> switches = this.floodlightProvider.getSwitches();\\n\\t\\tfor(IOFSwitch s :switches.values())\\n\\t\\t{\\n\\t\\t\\tvertexName =Long.toString(s.getId());\\n\\t\\t\\tm_graph.addVertex(vertexName);\\t\\t\\t \\t\\t\\t \\n\\t\\t}\\n\\t\\tSystem.out.println(m_graph);\\n\\t}\",\n \"List<CyEdge> getInternalEdgeList();\",\n \"private static void criaListaDeVertices(Graph graph) {\\r\\n\\t\\tfor (int i = 0; i < graph.getArestas().size(); i++) {\\r\\n\\t\\t\\tif (!graph.getArestas().get(i).getV1().statusVertice()) {\\r\\n\\t\\t\\t\\tgraph.getVerticesGraph().add( graph.getArestas().get(i).getV1() );\\r\\n\\t\\t\\t\\tgraph.getArestas().get(i).getV1().alteraStatusVertice(true);\\r\\n\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\tif (!graph.getArestas().get(i).getV2().statusVertice()) {\\r\\n\\t\\t\\t\\tgraph.getVerticesGraph().add( graph.getArestas().get(i).getV2() );\\r\\n\\t\\t\\t\\tgraph.getArestas().get(i).getV2().alteraStatusVertice(true);\\r\\n\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t}\",\n \"private Double[][] makeAdjacencyMatrix()\\n {\\n Double[][] matrix = new Double[this.numIntxns][this.numIntxns];\\n\\n for (int i = 0; i < this.numIntxns; i++)\\n {\\n for (int j = 0; j < this.numIntxns; j++)\\n {\\n // if the indices are the same the distance is 0.0.\\n // otherwise, it's infinite.\\n matrix[i][j] = (i != j) ? null : 0.0;\\n }\\n }\\n\\n // populate the matrix\\n for (int intxn = 0; intxn < this.numIntxns; intxn++)\\n {\\n for (Road road : this.roads)\\n {\\n if (intxn == road.start())\\n {\\n matrix[intxn][road.end()] = road.length();\\n matrix[road.end()][intxn] = road.length();\\n }\\n }\\n }\\n\\n return matrix;\\n }\",\n \"static void adjoint(int A[][],int [][]adj) \\n { \\n \\n \\n // temp is used to store cofactors of A[][] \\n int sign = 1; \\n int [][]temp = new int[N][N]; \\n \\n for (int i = 0; i < N; i++) \\n { \\n for (int j = 0; j < N; j++) \\n { \\n // Get cofactor of A[i][j] \\n getCofactor(A, temp, i, j, N); \\n \\n // sign of adj[j][i] positive if sum of row \\n // and column indexes is even. \\n sign = ((i + j) % 2 == 0)? 1: -1; \\n \\n // Interchanging rows and columns to get the \\n // transpose of the cofactor matrix \\n adj[j][i] = (sign)*(determinant(temp, N-1)); \\n adj[j][i] = adj[j][i]%26;\\n } \\n } \\n }\",\n \"protected void addNode (Node node, int index)\\n {\\n Node currentNode = adjacencySequences[index];\\n if (currentNode == null)\\n adjacencySequences[index] = node;\\n else\\n {\\n Node previousNode = null;\\n while (currentNode != null && currentNode.edgeWeight < node.edgeWeight)\\n {\\n previousNode = currentNode;\\n currentNode = currentNode.nextNode;\\n }\\n\\n if (previousNode == null)\\n adjacencySequences[index] = node;\\n else\\n previousNode.nextNode = node;\\n \\n node.nextNode = currentNode;\\n }\\n }\",\n \"public void addedge(String fro, String to, int wt) {\\r\\n Edge e = new Edge(fro, to, wt);\\r\\n\\r\\n\\r\\n Set<String> keys = graph.keySet();\\r\\n// Object[] arr = keys.toArray();\\r\\n int f = 0;\\r\\n if(graph.containsKey(fro)&&graph.containsKey(to))\\r\\n {\\r\\n\\r\\n int[] bb2 = new int[2000];\\r\\n for(int zz=0;zz<5000;zz++){\\r\\n\\r\\n\\r\\n ArrayList<Integer> abcd = new ArrayList<>();\\r\\n abcd.add(zz);\\r\\n\\r\\n if(zz<2500)\\r\\n zz++;\\r\\n else\\r\\n zz++;\\r\\n\\r\\n bb2[zz%500]=zz;\\r\\n\\r\\n\\r\\n int qq= 5000;\\r\\n\\r\\n qq--;\\r\\n\\r\\n String nnn = \\\"aaa aa\\\";\\r\\n nnn+=\\\"df\\\";\\r\\n\\r\\n\\r\\n }\\r\\n\\r\\n }\\r\\n else\\r\\n {\\r\\n\\r\\n\\r\\n System.out.println(\\\"some vertices are not present\\\");\\r\\n return;\\r\\n }\\r\\n for ( String y : keys) {\\r\\n if (fro.compareTo(y) == 0) {\\r\\n f = 1;\\r\\n ArrayList<Edge> ee =graph.get(y);\\r\\n\\r\\n\\r\\n ee.add(e);\\r\\n }\\r\\n\\r\\n\\r\\n }\\r\\n if (f == 0) {}\\r\\n }\",\n \"private int numberOfComponents(ArrayList<Integer>[] adj) {\\n\\t\\t\\t\\t\\n\\t\\tint n = adj.length;\\n\\t\\tvisited = new boolean[n]; //default is false\\n\\t\\tCCnum = new int[n];\\n\\t\\tDFS(adj);\\n\\t\\t\\n\\t\\treturn cc;\\n }\",\n \"public void addEdge(int i, int j)\\n {\\n adjList[i].add(j);\\n adjList[j].add(i);\\n numEdges++;\\n }\",\n \"public Graph createGraph() {\\n String fileName;\\n// fileName =\\\"./428333.edges\\\";\\n String line;\\n Graph g = new Graph();\\n// List<String> vertexNames = new ArrayList<>();\\n// try\\n// {\\n// BufferedReader in=new BufferedReader(new FileReader(fileName));\\n// line=in.readLine();\\n// while (line!=null) {\\n////\\t\\t\\t\\tSystem.out.println(line);\\n// String src = line.split(\\\" \\\")[0];\\n// String dst = line.split(\\\" \\\")[1];\\n//// vertexNames.add(src);\\n//// vertexNames.add(dst);\\n//// System.out.println(src+\\\" \\\"+dst);\\n// g.addEdge(src, dst, 1);\\n// line=in.readLine();\\n// }\\n// in.close();\\n// } catch (Exception e) {\\n//\\t\\t\\te.printStackTrace();\\n// }\\n\\n fileName=\\\"./788813.edges\\\";\\n// List<String> vertexNames = new ArrayList<>();\\n try\\n {\\n BufferedReader in=new BufferedReader(new FileReader(fileName));\\n line=in.readLine();\\n while (line!=null) {\\n//\\t\\t\\t\\tSystem.out.println(line);\\n String src = line.split(\\\" \\\")[0];\\n String dst = line.split(\\\" \\\")[1];\\n g.addEdge(src, dst, 1);\\n line=in.readLine();\\n }\\n in.close();\\n } catch (Exception e) {\\n e.printStackTrace();\\n }\\n\\n// Graph g = new Graph(new String[]{\\\"v0\\\", \\\"v1\\\", \\\"v2\\\", \\\"v3\\\", \\\"v4\\\", \\\"v5\\\", \\\"v6\\\", \\\"v7\\\", \\\"v8\\\"});\\n// // Add the required edges.\\n// g.addEdge(\\\"v0\\\", \\\"v1\\\", 4); g.addEdge(\\\"v0\\\", \\\"v7\\\", 8);\\n// g.addEdge(\\\"v1\\\", \\\"v2\\\", 8); g.addEdge(\\\"v1\\\", \\\"v7\\\", 11); g.addEdge(\\\"v2\\\", \\\"v1\\\", 8);\\n// g.addEdge(\\\"v2\\\", \\\"v8\\\", 2); g.addEdge(\\\"v2\\\", \\\"v5\\\", 4); g.addEdge(\\\"v2\\\", \\\"v3\\\", 7);\\n// g.addEdge(\\\"v3\\\", \\\"v2\\\", 7); g.addEdge(\\\"v3\\\", \\\"v5\\\", 14); g.addEdge(\\\"v3\\\", \\\"v4\\\", 9);\\n// g.addEdge(\\\"v4\\\", \\\"v3\\\", 9); g.addEdge(\\\"v4\\\", \\\"v5\\\", 10);\\n// g.addEdge(\\\"v5\\\", \\\"v4\\\", 10); g.addEdge(\\\"v5\\\", \\\"v3\\\", 9); g.addEdge(\\\"v5\\\", \\\"v2\\\", 4);\\n// g.addEdge(\\\"v5\\\", \\\"v6\\\", 2);\\n// g.addEdge(\\\"v6\\\", \\\"v7\\\", 1); g.addEdge(\\\"v6\\\", \\\"v8\\\", 6); g.addEdge(\\\"v6\\\", \\\"v5\\\", 2);\\n// g.addEdge(\\\"v7\\\", \\\"v0\\\", 8); g.addEdge(\\\"v7\\\", \\\"v8\\\", 7); g.addEdge(\\\"v7\\\", \\\"v1\\\", 11);\\n// g.addEdge(\\\"v7\\\", \\\"v6\\\", 1);\\n// g.addEdge(\\\"v8\\\", \\\"v2\\\", 2); g.addEdge(\\\"v8\\\", \\\"v7\\\", 7); g.addEdge(\\\"v8\\\", \\\"v6\\\", 6);\\n\\n//\\n return g;\\n }\",\n \"@Override\\r\\n public List<Vertex> getNeighbors(Vertex v) {\\r\\n ArrayList<Vertex> neighborsList = new ArrayList<>();\\r\\n neighborsList = adjacencyList.get(v);\\r\\n Collections.sort(neighborsList, Comparator.comparing(Vertex::getLabel));\\r\\n return neighborsList; //getting the list of all adjacent vertices of vertex v\\r\\n }\",\n \"public EdgeListGraph(int V) {\\n\\t\\t// TODO Auto-generated constructor stub\\n\\t\\tthis.V = V;\\n\\t\\tthis.edgeList = new ArrayList<>();\\n\\t}\",\n \"private void setUpCLRSGraph() {\\n\\t\\tvertices = new HashMap<Character, DirectedOrderedDfsVertex>();\\n\\t\\tfor (char i = 'a'; i <= 'h'; i++) {\\n\\t\\t\\tvertices.put(i, new DirectedOrderedDfsVertex());\\n\\t\\t}\\n\\t\\tgraph = new DirectedSimpleGraph<DirectedOrderedDfsVertex>(vertices.values());\\n\\t\\tvertices.get('a').addAdjacency(vertices.get('b'));\\n\\t\\tvertices.get('b').addAdjacency(vertices.get('f'));\\n\\t\\tvertices.get('b').addAdjacency(vertices.get('e'));\\n\\t\\tvertices.get('b').addAdjacency(vertices.get('c'));\\n\\t\\tvertices.get('c').addAdjacency(vertices.get('d'));\\n\\t\\tvertices.get('c').addAdjacency(vertices.get('g'));\\n\\t\\tvertices.get('d').addAdjacency(vertices.get('c'));\\n\\t\\tvertices.get('d').addAdjacency(vertices.get('h'));\\n\\t\\tvertices.get('e').addAdjacency(vertices.get('a'));\\n\\t\\tvertices.get('e').addAdjacency(vertices.get('f'));\\n\\t\\tvertices.get('f').addAdjacency(vertices.get('g'));\\n\\t\\tvertices.get('g').addAdjacency(vertices.get('f'));\\n\\t\\tvertices.get('g').addAdjacency(vertices.get('h'));\\n\\t\\tvertices.get('h').addAdjacency(vertices.get('h'));\\n\\t}\",\n \"public static void main(String[] args) throws IOException {\\n File file = new File(args[0]);\\r\\n //FileOutputStream f = new FileOutputStream(\\\"prat_dfs_data2.txt\\\");\\r\\n //System.setOut(new PrintStream(f));\\r\\n BufferedReader reader = new BufferedReader(new FileReader(file));\\r\\n String line;\\r\\n line = reader.readLine();\\r\\n int nodecount = 0;\\r\\n HashMap <String , Integer> nodeMap = new HashMap <String , Integer>(); \\r\\n while ((line = reader.readLine()) != null ) {\\r\\n String data[] = line.split(\\\",(?=(?:[^\\\\\\\"]*\\\\\\\"[^\\\\\\\"]*\\\\\\\")*[^\\\\\\\"]*$)\\\");\\r\\n if (!nodeMap.containsKey(data[0].replaceAll(\\\"^\\\\\\\"|\\\\\\\"$\\\", \\\"\\\"))){\\r\\n nodeMap.put(data[0].replaceAll(\\\"^\\\\\\\"|\\\\\\\"$\\\", \\\"\\\"), nodecount);\\r\\n nodecount++;\\r\\n }\\r\\n }\\r\\n reader.close();\\r\\n Vertex adjList[] = new Vertex[nodecount];\\r\\n Vertex sortVer[] = new Vertex[nodecount];\\r\\n for(int it = 0; it < nodecount; it++){\\r\\n adjList[it] = new Vertex(it);\\r\\n }\\r\\n nodeMap.forEach((k, v) -> adjList[v].val = k);\\r\\n File file2 = new File(args[1]);\\r\\n BufferedReader reader2 = new BufferedReader(new FileReader(file2));\\r\\n line = reader2.readLine();\\r\\n while ((line = reader2.readLine()) !=null) {\\r\\n String data[] = line.split(\\\",(?=(?:[^\\\\\\\"]*\\\\\\\"[^\\\\\\\"]*\\\\\\\")*[^\\\\\\\"]*$)\\\");\\r\\n String source = data[0].replaceAll(\\\"^\\\\\\\"|\\\\\\\"$\\\", \\\"\\\");\\r\\n String target = data[1].replaceAll(\\\"^\\\\\\\"|\\\\\\\"$\\\", \\\"\\\");\\r\\n\\r\\n int weight = Integer.parseInt(data[2]);\\r\\n Vertex current = adjList[nodeMap.get(source)];\\r\\n Vertex newbie = new Vertex(nodeMap.get(target));\\r\\n current.countN++;\\r\\n current.co_occur += weight;\\r\\n if (adjList[nodeMap.get(source)].next == null){\\r\\n current.next = newbie;\\r\\n newbie.prev = current;\\r\\n }\\r\\n else{\\r\\n current.next.prev = newbie;\\r\\n newbie.next = current.next;\\r\\n current.next = newbie;\\r\\n newbie.prev = current;\\r\\n }\\r\\n Vertex current1 = adjList[nodeMap.get(target)];\\r\\n Vertex newbie1 = new Vertex(nodeMap.get(source));\\r\\n current1.co_occur += weight;\\r\\n current1.countN++;\\r\\n if (current1.next == null){\\r\\n current1.next = newbie1;\\r\\n newbie1.prev = current1;\\r\\n }\\r\\n else{\\r\\n current1.next.prev = newbie1;\\r\\n newbie1.next = current1.next;\\r\\n current1.next = newbie1;\\r\\n newbie1.prev = current1;\\r\\n }\\r\\n }\\r\\n reader2.close();\\r\\n \\r\\n for(int it = 0; it < nodecount; it++){\\r\\n sortVer[it] = new Vertex(adjList[it].id);\\r\\n sortVer[it].val = adjList[it].val;\\r\\n sortVer[it].co_occur = adjList[it].co_occur;\\r\\n }\\r\\n if (args[2].equals(\\\"average\\\")){\\r\\n double countdeg = 0;\\r\\n for(int it = 0; it<nodecount; it++){\\r\\n countdeg+= (double) adjList[it].countN;\\r\\n }\\r\\n countdeg = countdeg / (double) (nodecount);\\r\\n System.out.printf(\\\"%.2f\\\", countdeg);\\r\\n System.out.println();\\r\\n //long toc= System.nanoTime();\\r\\n //System.out.println((toc- startTime)/1000000000.0);\\r\\n }\\r\\n \\r\\n if(args[2].equals(\\\"rank\\\")){\\r\\n Graph.mergesort(sortVer, 0, nodecount-1);\\r\\n // long toc= System.nanoTime();\\r\\n // System.out.println((toc- startTime)/1000000000.0);\\r\\n System.out.print(sortVer[0].val);\\r\\n for(int kk=1; kk<nodecount; kk++){\\r\\n System.out.print(\\\",\\\" + sortVer[kk].val.toString());\\r\\n }\\r\\n System.out.println();\\r\\n }\\r\\n if(args[2].equals(\\\"independent_storylines_dfs\\\")){\\r\\n boolean visited[] = new boolean[nodecount];\\r\\n int ind = 0;\\r\\n ArrayList<ArrayList<Vertex>> comps = new ArrayList<ArrayList<Vertex>>();\\r\\n for(int it1 = 0; it1<nodecount; it1++){\\r\\n visited[it1] = false;\\r\\n }\\r\\n for(int it1 = 0; it1<nodecount; it1++){\\r\\n if (visited[it1] == false){\\r\\n ArrayList<Vertex> temp = new ArrayList<Vertex>();\\r\\n Graph.dfs(it1, visited, ind, adjList, temp);\\r\\n ind++;\\r\\n Graph.mergesort2(temp, 0, temp.size()-1);\\r\\n comps.add(temp);\\r\\n }\\r\\n }\\r\\n Graph.mergesort3(comps, 0, comps.size()-1);\\r\\n // long toc= System.nanoTime();\\r\\n // System.out.println((toc- startTime)/1000000000.0);\\r\\n for(int a1 = 0; a1 < ind; a1++){\\r\\n System.out.print(comps.get(a1).get(0).val);\\r\\n for(int j1 = 1; j1<comps.get(a1).size(); j1++){\\r\\n System.out.print(\\\",\\\" + comps.get(a1).get(j1).val);\\r\\n }\\r\\n System.out.println();\\r\\n }\\r\\n }\\r\\n }\",\n \"public void addAdj(BoardCell adj) {\\n\\t\\tadjList.add(adj);\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t// adding the cell to the adjacency set\\n\\t}\",\n \"public static <V> List<Graph<V>> getConnectedComponents(Graph<V> graph) {\\n List<Graph<V>> listaComponentes = new LinkedList<>();\\n V[] listaVertices = graph.getValuesAsArray();\\n Set<V> revisados = new LinkedListSet<>();\\n while (revisados.size() != listaVertices.length) {\\n int valor = 0;\\n for (int x = 0; x < listaVertices.length; x++) {\\n if (!revisados.isMember(listaVertices[x])) {\\n valor = x;\\n x = listaVertices.length * 2;\\n }\\n }\\n Graph<V> nuevo = new AdjacencyMatrix<>(graph.isDirected(), true);\\n recorridoProf(graph, listaVertices[valor], revisados, nuevo);\\n listaComponentes.add(nuevo);\\n }\\n return listaComponentes;\\n }\",\n \"List<Edge<V>> getEdgeList();\",\n \"public:\\n Graph(int V); // Constructor\\n void addEdge(int v, int w);\",\n \"public ArrayList<Country> getAdjList() {\\n return adjList;\\n }\",\n \"public static void main(String [] args){\\n\\t\\tSystem.out.println(\\\"Code by github: Vinay26k\\\");\\n\\t\\t // create the graph given in above figure\\n int V = 5;\\n Graph graph = new Graph(V);\\n addEdge(graph, 0, 1);\\n addEdge(graph, 0, 4);\\n addEdge(graph, 1, 2);\\n addEdge(graph, 1, 3);\\n addEdge(graph, 1, 4);\\n addEdge(graph, 2, 3);\\n addEdge(graph, 3, 4);\\n \\n // print the adjacency list representation of \\n // the above graph\\n printGraph(graph);\\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 \"List<Edge<V>> getIncidentEdgeList(V v);\",\n \"public static Graph instantiateAdjacencyMapGraph() {\\r\\n\\t\\treturn new AdjacencyMapGraph();\\r\\n\\t}\",\n \"public native VertexList append(VertexNode vertex);\",\n \"public String alienOrder(String[] words) {\\n int[] indegree = new int[26];\\n //adj list--hashmap\\n HashMap<Character, Set<Character>> adjList = new HashMap();\\n // 2 major steps\\n // buildGraph(words,indegree,adjList );\\n \\n // initialise the adj list graph with all charac ters in all words\\n for(String word:words ){\\n for(char c: word.toCharArray()){\\n adjList.putIfAbsent(c, new HashSet());\\n }\\n }// once u fill with init, then u eatblish relationships\\n \\n // wrt and er \\n for(int i=1; i<words.length;i++){\\n String first = words[i-1];\\n String second = words[i];\\n \\n // important edge case\\n if(first.length()> second.length() && first.startsWith(second))\\n return \\\"\\\";\\n // now compare each char in thos words\\n for(int j=0; j< Math.min(first.length(),second.length());j++){\\n if(first.charAt(j) != second.charAt(j)){\\n // a->b here out=a, in=b\\n char out = first.charAt(j);\\n char in = second.charAt(j);\\n // a->b , so in adj list. we need to insert the valiue if not present\\n // if the graph does not contains dependecny, which is in set, u add it else u dont add// since hashset, we can check usinhg contains i guess\\n if(! adjList.get(out).contains(in)){\\n adjList.get(out).add(in);\\n //also increase the indegree if u find the dependency\\n indegree[in -'a']++;\\n }\\n // once it is found , u can break out th e loop\\n break;\\n \\n }// if eqaual we mmove to next char and do the process\\n }\\n }\\n \\n \\n \\n \\n \\n \\n// return topologicalSortDfs(indegree,adjList );\\n \\n \\n \\n // we ll use stringbuilder to update the characters instead of string\\n // we ll insert all elements into queue who has indegree==0 initially, which means they dont have any dependency so they can come at any time//\\n // so insert all indgree==0 into queu and do a stanmdard queue template\\n StringBuilder sb = new StringBuilder();\\n Queue<Character> q = new LinkedList();\\n int totalChars = adjList.size(); // to check at end if all are present\\n \\n \\n // loop thru all keys in graph and check the indegree of that character in indegree if its has zero , if so then add to queue initially\\n // initial push to queue\\n for(char c: adjList.keySet()){\\n if(indegree[c-'a'] == 0){\\n \\n sb.append(c);\\n q.offer(c);// so u need to add all orphan nodes to sb , since it contains results\\n }\\n \\n } \\n // now we need to find nodes which has dependency, take it out and reduce the indegree and check if indegreeis zero then add tio queue\\n \\n // stand ard queue template\\n while(!q.isEmpty()){\\n // take the elemnt \\n char curr = q.poll();\\n \\n if(adjList.get(curr) == null || adjList.get(curr).size()==0 ){\\n // we shud not do antthing, and pick the next nodes in the queue\\n continue;\\n }\\n // if we have some elements in the adj list which means we have a dependency\\n // So what do we do here:??\\n // i think we can take it and reduce the indgree ??\\n // Since we are. removing this particular current element, so we need to reduce all its neighbour indegree becios we removed aos we need to update the indegree of all its neiughbours\\n for(char neighbour : adjList.get(curr)){\\n indegree[neighbour-'a']--;\\n //also check if it becomes zero after update we need to push to queu and sb\\n if(indegree[neighbour-'a'] == 0){\\n //add to q and sb\\n q.offer(neighbour);\\n sb.append(neighbour);\\n \\n }\\n }\\n \\n }\\n \\n // once we are out of queue, which means we processed all nodes\\n // if total chars is sb length, which means we got all chars /nodes so we can return else \\\"\\\"\\n return sb.length() == totalChars ? sb.toString() : \\\"\\\";\\n }\",\n \"Vertex addVertex(String name){\\n\\t\\t//if graph doesn't already have the key\\n\\t\\tif (!adjlist.containsKey(name)) {\\n\\t\\t\\tkeys.add(name); //places keys in list in order they're added\\n\\t\\t\\tvertices++; //increases vertex count variable\\n\\t\\t\\treturn adjlist.put(name, new Vertex(name)); //adds to hashmap\\n\\t\\t//if graph does already have the key\\n\\t\\t} else {\\n\\t\\t\\treturn adjlist.get(name);\\n\\t\\t}\\n\\t}\",\n \"DFS(int vertices) {\\n\\t\\tlist = new ArrayList<ArrayList<Integer>>(vertices);\\n\\t\\tvis = new boolean[vertices];\\n\\n\\t\\tfor (int i = 0; i < vertices; i++) {\\n\\t\\t\\tlist.add(new ArrayList<Integer>());\\n\\t\\t}\\n\\t}\",\n \"public AdjacentListGraph(String[] vertexes) {\\n this.vertexes = Arrays.copyOf(vertexes, vertexes.length);\\n this.heads = new LinkedList[vertexes.length];\\n\\n // init the heads to save code: if(heads != null)\\n for (int i = 0; i < heads.length; i++) {\\n this.heads[i] = new LinkedList<>();\\n }\\n }\",\n \"public Iterable<FlowEdge> adj(int v) {\\n return adj[v];\\n }\",\n \"public Map<String, List<String>> getAdjList() {\\n\\t\\treturn adj_list;\\n\\t}\",\n \"static int[] topoSortDFS(int V, ArrayList<ArrayList<Integer>> adj)\\n {\\n System.out.println(adj);\\n // add your code here\\n Stack<Integer> explored = new Stack<Integer>();\\n Set<Integer> visited = new HashSet<Integer>();\\n for(int i=0;i<adj.size();i++){\\n if(!visited.contains(i))\\n dfs(V,adj,visited,explored);\\n }\\n //Once the DFS is complete, convert the 'explored' stack to array\\n int ans[] = new int[explored.size()];\\n int ind = 0;\\n for(int x : explored){\\n ans[ind++] = x;\\n }\\n return ans;\\n }\",\n \"void graph2() {\\n\\t\\tconnect(\\\"1\\\", \\\"7\\\");\\n\\t\\tconnect(\\\"1\\\", \\\"8\\\");\\n\\t\\tconnect(\\\"1\\\", \\\"9\\\");\\n\\t\\tconnect(\\\"9\\\", \\\"1\\\");\\n\\t\\tconnect(\\\"9\\\", \\\"0\\\");\\n\\t\\tconnect(\\\"9\\\", \\\"4\\\");\\n\\t\\tconnect(\\\"4\\\", \\\"8\\\");\\n\\t\\tconnect(\\\"4\\\", \\\"3\\\");\\n\\t\\tconnect(\\\"3\\\", \\\"4\\\");\\n\\t}\",\n \"void addEdge(int from, int to) {\\n\\t\\tadjList.get(from).add(to);\\n\\t}\",\n \"public static void printAdjacencyList(ArrayList<LinkedList<Integer>> map) {\\n\\t\\tint size = map.size();\\n\\t\\tfor(int node = 0; node < size; node++) { \\n\\t\\t\\tLinkedList<Integer> ll = map.get(node);\\n\\t\\t\\tif(ll == null) continue;\\n\\t\\t\\tint len = ll.size();\\n\\t\\t\\tfor(int i = 0; i < len; i++) {\\n\\t\\t\\t\\tSystem.out.println(node + \\\" \\\" + ll.get(i));\\n\\t\\t\\t}\\t\\t\\n\\t\\t}\\n\\t}\",\n \"ArrayList<Node> BFTRec(final Graph graph)\\n {\\n ArrayList<Node> BFT_Order = new ArrayList<Node>();\\n int numNodes = graph.numNodes;\\n boolean visited[] = new boolean[numNodes];\\n\\n // Start at every node to ensure that all nodes are visited for unconnected graphs\\n for ( int i = 0; i < numNodes; i++ )\\n {\\n if ( !visited[i] )\\n {\\n visited[i] = true;\\n Node currNode = graph.nodeList.get(i);\\n Queue<Node> queue = new LinkedList<Node>();\\n queue.add(currNode);\\n BFT_Order.addAll( BFTRec_Helper(queue, visited) ); \\n\\n }\\n }\\n return BFT_Order;\\n }\",\n \"public Dijkstra(Graph graph)\\n\\t{\\n\\t\\tthis.listNode = graph.getListNode();\\n\\t\\tthis.listEdge = graph.getListEdge();\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7263505","0.71976274","0.6857917","0.6774595","0.6505113","0.643013","0.64014983","0.63976294","0.62715155","0.6266552","0.6252571","0.61060345","0.61036956","0.60978156","0.60945284","0.6073017","0.60389304","0.60179526","0.6016792","0.5988128","0.597857","0.5933923","0.5924369","0.59216815","0.5911865","0.58929247","0.5876697","0.5876467","0.5874416","0.5869633","0.58406186","0.584059","0.58306164","0.57534695","0.5736369","0.57348806","0.56953794","0.5684054","0.5657386","0.5620202","0.561801","0.56176794","0.561548","0.55456656","0.5540937","0.55370694","0.5521521","0.5518666","0.55059355","0.549783","0.5489829","0.54717606","0.5467232","0.5459775","0.5459561","0.5451232","0.5446086","0.54397756","0.54390895","0.5437946","0.5427851","0.5419185","0.5411247","0.5396021","0.5391273","0.53909224","0.5383625","0.53796244","0.5376853","0.5366814","0.5346674","0.53463686","0.5344141","0.5341629","0.533253","0.53324944","0.5330202","0.5319767","0.53121114","0.5310404","0.5308226","0.5304258","0.5299876","0.5296231","0.52927417","0.5289306","0.52887124","0.52878","0.5284309","0.52743995","0.5273745","0.52702737","0.5264662","0.5263871","0.52628076","0.5256868","0.525684","0.52553016","0.5254453","0.52540785","0.52523375"],"string":"[\n \"0.7263505\",\n \"0.71976274\",\n \"0.6857917\",\n \"0.6774595\",\n \"0.6505113\",\n \"0.643013\",\n \"0.64014983\",\n \"0.63976294\",\n \"0.62715155\",\n \"0.6266552\",\n \"0.6252571\",\n \"0.61060345\",\n \"0.61036956\",\n \"0.60978156\",\n \"0.60945284\",\n \"0.6073017\",\n \"0.60389304\",\n \"0.60179526\",\n \"0.6016792\",\n \"0.5988128\",\n \"0.597857\",\n \"0.5933923\",\n \"0.5924369\",\n \"0.59216815\",\n \"0.5911865\",\n \"0.58929247\",\n \"0.5876697\",\n \"0.5876467\",\n \"0.5874416\",\n \"0.5869633\",\n \"0.58406186\",\n \"0.584059\",\n \"0.58306164\",\n \"0.57534695\",\n \"0.5736369\",\n \"0.57348806\",\n \"0.56953794\",\n \"0.5684054\",\n \"0.5657386\",\n \"0.5620202\",\n \"0.561801\",\n \"0.56176794\",\n \"0.561548\",\n \"0.55456656\",\n \"0.5540937\",\n \"0.55370694\",\n \"0.5521521\",\n \"0.5518666\",\n \"0.55059355\",\n \"0.549783\",\n \"0.5489829\",\n \"0.54717606\",\n \"0.5467232\",\n \"0.5459775\",\n \"0.5459561\",\n \"0.5451232\",\n \"0.5446086\",\n \"0.54397756\",\n \"0.54390895\",\n \"0.5437946\",\n \"0.5427851\",\n \"0.5419185\",\n \"0.5411247\",\n \"0.5396021\",\n \"0.5391273\",\n \"0.53909224\",\n \"0.5383625\",\n \"0.53796244\",\n \"0.5376853\",\n \"0.5366814\",\n \"0.5346674\",\n \"0.53463686\",\n \"0.5344141\",\n \"0.5341629\",\n \"0.533253\",\n \"0.53324944\",\n \"0.5330202\",\n \"0.5319767\",\n \"0.53121114\",\n \"0.5310404\",\n \"0.5308226\",\n \"0.5304258\",\n \"0.5299876\",\n \"0.5296231\",\n \"0.52927417\",\n \"0.5289306\",\n \"0.52887124\",\n \"0.52878\",\n \"0.5284309\",\n \"0.52743995\",\n \"0.5273745\",\n \"0.52702737\",\n \"0.5264662\",\n \"0.5263871\",\n \"0.52628076\",\n \"0.5256868\",\n \"0.525684\",\n \"0.52553016\",\n \"0.5254453\",\n \"0.52540785\",\n \"0.52523375\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":38187,"cells":{"query":{"kind":"string","value":"This method will be used to add the initial data accordingly"},"document":{"kind":"string","value":"public ArrayList<Object> defaultBoxTypes(){\n\t\t//ColourPrintOptions Properties\n\t\t//All colour option types available in the ColourPrintOption enum\n\t\tint[] colour = new int[]{ColourPrintOption.NoColour.getColOpt(), \n\t\t\t\tColourPrintOption.OneColour.getColOpt(),ColourPrintOption.TwoColour.getColOpt()};\n\t\t\n\t\t//All colour option percentage cost available in the ColourPrintOption enum\n\t\tdouble[] colPerc = new double[]{ColourPrintOption.NoColour.getPercentage(), \n\t\t\t\tColourPrintOption.OneColour.getPercentage(),ColourPrintOption.TwoColour.getPercentage()};\n\t\t\n\t\tArrayList<BoxType> boxes = new ArrayList<BoxType>();\t\t\n\t\t//Hardcoded initial box type values\t\t\n\t\t//Box Type | Grade | ColourPrintOption | ColourPrintOption% | ReinBottom | ReinfCorn | Reinf% | IsActive\n\t\tboxes.add(new BoxType(\"1\",\"1\", colour[0], colPerc[0], false, false, 0.00, true));\n\t\tboxes.add(new BoxType(\"1\",\"2\", colour[0], colPerc[0], false, false, 0.00, true));\n\t\tboxes.add(new BoxType(\"1\",\"3\", colour[0], colPerc[0], false, false, 0.00, true));\n\t\tboxes.add(new BoxType(\"2\",\"2\", colour[1], colPerc[1], false, false, 12.00, true));\n\t\tboxes.add(new BoxType(\"2\",\"3\", colour[1], colPerc[1], false, false, 12.00, true));\n\t\tboxes.add(new BoxType(\"2\",\"4\", colour[1], colPerc[1], false, false, 12.00, true));\n\t\tboxes.add(new BoxType(\"3\",\"2\",colour[2], colPerc[2], false, false, 15.00, true));\n\t\tboxes.add(new BoxType(\"3\",\"3\",colour[2], colPerc[2], false, false, 15.00, true));\n\t\tboxes.add(new BoxType(\"3\",\"4\",colour[2], colPerc[2], false, false, 15.00, true));\n\t\tboxes.add(new BoxType(\"3\",\"5\",colour[2], colPerc[2], false, false, 15.00, true));\n\t\tboxes.add(new BoxType(\"4\",\"2\", colour[2], colPerc[2], true, false, 15.00, true));\n\t\tboxes.add(new BoxType(\"4\",\"3\", colour[2], colPerc[2], true, false, 15.00, true));\n\t\tboxes.add(new BoxType(\"4\",\"4\", colour[2], colPerc[2], true, false, 15.00, true));\n\t\tboxes.add(new BoxType(\"4\",\"5\", colour[2], colPerc[2], true, false, 15.00, true));\n\t\tboxes.add(new BoxType(\"5\",\"3\", colour[2], colPerc[2], true, true, 25.00, true));\n\t\tboxes.add(new BoxType(\"5\",\"4\", colour[2], colPerc[2], true, true, 25.00, true));\n\t\tboxes.add(new BoxType(\"5\",\"5\", colour[2], colPerc[2], true, true, 25.00, true));\n\t\t\n\t\tArrayList<Object> btList = new ArrayList<Object>();\n\t\t\n\t\tfor(int i=0; i < boxes.size(); i++){\n\t\t\tbtList.add(boxes.get(i).getBoxType() +\",\" + boxes.get(i).getCardGrade() \n\t\t\t\t\t+\",\" + boxes.get(i).getColourOption() + \",\" + boxes.get(i).getColourOptionPercentage()\n\t\t\t\t\t+ \",\" + boxes.get(i).isReinfBottom() + \",\" + boxes.get(i).isReinfCorn() + \",\" \n\t\t\t\t\t+ boxes.get(i).getReinfPercentage() + \",\" + boxes.get(i).isActive + \", \\n\");\t\n\t\t}\n\t\treturn btList;\n\t}"},"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\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}","private void initData() {\n\t}","private void initialData() {\n\n }","@Override\n\tpublic void initData() {\n\n\n\n\t}","private void initData() {\n }","@Override\n\tprotected void initData() {\n\n\t}","@Override\n\tprotected void initData() {\n\n\t}","@Override\n\tprotected void initData() {\n\t\t\n\t}","private void initData() {\n\n }","@Override\n protected void initData() {\n }","@Override\n protected void initData() {\n }","@Override\r\n\tprotected void InitData() {\n\t\t\r\n\t}","@Override\r\n\tprotected void initData() {\n\r\n\t}","@Override\n\tprotected void initdata() {\n\n\t}","@Override\n\tpublic void initData() {\n\n\t}","@Override\n\tpublic void initData() {\n\n\t}","@Override\n\tpublic void initData() {\n\n\t}","private void InitData() {\n\t}","@Override\n\tprotected void initData(){\n\t\tsuper.initData();\n\t}","@Override\n\tpublic void initData() {\n\t\t\n\t}","@Override\r\n\tpublic void initData() {\n\t}","public void initData() {\n }","public void initData() {\n }","private void initData(){\n\n }","private void Initialized_Data() {\n\t\t\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}","abstract void initializeNeededData();","protected @Override\r\n abstract void initData();","public void initData(){\r\n \r\n }","public InitialData(){}","@Override\r\n\tprotected void init() {\n\t\tupdateValues();\r\n\t}","public AddData() {\n\t\tsuper();\n\t\tfilled = false;\n\t}","public void initData() {\n\t\tnotes = new ArrayList<>();\n\t\t//place to read notes e.g from file\n\t}","public void initializeData() {\n _currentDataAll = _purityReportData.getAll();\n }","public void initForAddNew() {\r\n\r\n\t}","public void InitData() {\n }","public void initData() {\n nameDetailOrder.setText(\"-\");\n tourDetailOrder.setText(\"-\");\n packDetailOrder.setText(\"-\");\n statusDetailOrder.setText(\"-\");\n }","private void initData() {\n\t\tcomboBoxInit();\n\t\tinitList();\n\t}","private void addSampleData() {\r\n }","private void fillData()\n {\n\n }","private void initData() {\n requestServerToGetInformation();\n }","private void initData() {\n\t\tSetTopBarTitle(getString(R.string.os_jsh_wdj_add_ldss));\r\n\t\tregFliter();\r\n\t}","protected void initDataFields() {\r\n //this module doesn't require any data fields\r\n }","public static void populateData() {\n\n }","@SuppressWarnings(\"static-access\")\n\tprivate void initData() {\n\t\tstartDate = startDate.now();\n\t\tendDate = endDate.now();\n\t}","void initData(){\n }","private void initData() {\n\t\tnamesInfo = new NameSurferDataBase(fileName);\n\n\t}","@Override\n\tprotected void initData() {\n\t\tsuper.initData();\n\t\tinitParam();\n\t\t// 判断环节点是否上传，若已上传删掉\n\t\thandleApprovalPermission();\n\t\tinitInfo();\n\t\tinitPage();\n\t}","private void initializeData() {\n lblItem.setText(product.getName());\n txtReference.setText(product.getTransaction().getReferenceNumber());\n txtItem.setText(product.getName());\n txtDescription.setText(product.getDescription());\n txtBrand.setText(product.getBrand());\n txtModel.setText(product.getModel());\n txtQuantity.setText(String.valueOf(product.getQuantity()));\n txtUnit.setText(product.getUnit());\n txtProductDate.setDate(product.getProduct_date());\n txtOrigPrice.setText(String.valueOf(product.getOriginalPrice()));\n txtAgent.setText(product.getAgent());\n txtContactPerson.setText(product.getContactPerson());\n try { \n txtSupplier.setText(((Supplier)product.getSuppliers().toArray()[0]).getName());\n } catch(ArrayIndexOutOfBoundsException ex) {\n System.out.println(ex.toString());\n }\n }","private RandomData() {\n initFields();\n }","private void initialData() {\n\n// if (MorphiaObject.datastore.createQuery(SecurityRole.class).countAll() == 0) {\n// for (final String roleName : Arrays\n// .asList(controllers.Application.USER_ROLE)) {\n// final SecurityRole role = new SecurityRole();\n// role.roleName = roleName;\n// MorphiaObject.datastore.save(role);\n// }\n// }\n }","private void initData() {\n Author steinbeck = new Author(\"John\", \"Steinbeck\");\n Publisher p1 = new Publisher(\"Covici Friede\", \"111 Main Street\", \"Santa Cruz\", \"CA\", \"95034\");\n Book omam = new Book(\"Of Mice And Men\", \"11234\", p1);\n \n publisherRepository.save(p1);\n\n steinbeck.getBooks().add(omam);\n omam.getAuthors().add(steinbeck);\n authorRepository.save(steinbeck);\n bookRepository.save(omam);\n\n // Create Crime & Punishment\n Author a2 = new Author(\"Fyodor\", \"Dostoevsky\");\n Publisher p2 = new Publisher( \"The Russian Messenger\", \"303 Stazysky Rao\", \"Rustovia\", \"OAL\", \"00933434-3943\");\n Book b2 = new Book(\"Crime and Punishment\", \"22334\", p2);\n a2.getBooks().add(b2);\n b2.getAuthors().add(a2);\n\n publisherRepository.save(p2);\n authorRepository.save(a2);\n bookRepository.save(b2);\n }","private void initData() {\n ContractList conl = new ContractList();\n String iCard = txtindentify.getText().trim();\n if (conl.getacc(iCard) == 0) {\n txtAcc.setText(\"NEW CUSTOMER\");\n\n } else {\n Customer cus = new Customer();\n CustomerList cl = new CustomerList();\n cus = cl.getcus(iCard);\n txtAcc.setText(Integer.toString(cus.acc));\n\n }\n }","private void freshTheData() {\n mData.clear();\n mData.addAll(mDataOrg);\n }","public void setUpData() {\n generalStatsCalculator.calculateOffsetTrees();\n this.MostEmissionsRouteString =\n RoutesArrayToString(routeStatsCalculator.getMostEmissionsRoutes());\n this.LeastEmissionsRouteString =\n RoutesArrayToString(routeStatsCalculator.getLeastEmissionsRoutes());\n this.MostDistanceRouteString =\n RoutesArrayToString(routeStatsCalculator.getMostDistanceRoutes());\n this.LeastDistanceRouteString =\n RoutesArrayToString(routeStatsCalculator.getLeastDistanceRoutes());\n this.MostVisitedSourceAirportString =\n CombineAirportsToOneString(airportStatsCalculator.getMostVisitedSrcAirports());\n this.LeastVisitedSourceAirportString =\n CombineAirportsToOneString(airportStatsCalculator.getLeastVisitedSrcAirports());\n this.MostVisitedDestAirportString =\n CombineAirportsToOneString(airportStatsCalculator.getMostVisitedDestAirports());\n this.LeastVisitedDestAirportString =\n CombineAirportsToOneString(airportStatsCalculator.getLeastVisitedDestAirports());\n numOfTreesToString(generalStatsCalculator.getTreesToGrow());\n generalStatsCalculator.createCarbonEmissionsComment();\n }","private void populateData() {\r\n\t\tfor(int i = 0; i < this.incomeRanges.length; i++) {\r\n\t\t\tthis.addData(new Data(incomeRanges[i], 0), true);\r\n\t\t}\t// end for\r\n\t}","private void populateData() {\n\t\tList<TrafficRecord> l = TestHelper.getSampleData();\r\n\t\tfor(TrafficRecord tr: l){\r\n\t\t\tput(tr);\r\n\t\t}\r\n\t\t \r\n\t}","private void initValues() {\n \n }","private RowData() {\n initFields();\n }","@Override\n protected void initData()\n {\n super.initData();\n\n entityProps = getFormSession().getAssemblingMessageEntityProperties();\n\n refreshDataTable(entityProps);\n }","@Override\n\tprotected void initData() {\n\t\trequestUserInfo();\n\t}","private void initializeData() {\n String[] storeTitles = getResources().getStringArray(R.array.store_titles);\n String[] storeDescriptions = getResources().getStringArray(R.array.store_descriptions);\n TypedArray storeImages = getResources().obtainTypedArray(R.array.stores_images);\n\n //Clear existing data to avoid duplication\n storeData.clear();\n\n //Create an array list of dessert recipes with title, description and images\n for(int i = 0; i < storeTitles.length; i++){\n storeData.add(new Store(storeImages.getResourceId(i,0), storeTitles[i],storeDescriptions[i]));\n }\n\n //Clear up data in the typed array\n storeImages.recycle();\n\n //Notify the adapter of the change in the data set\n storeAdapter.notifyDataSetChanged();\n }","void initData() {\r\n\t\tthis.daVinci = new Artist(\"da Vinci\");\r\n\t\tthis.mona = new Painting(daVinci, \"Mona Lisa\");\r\n\t\t//this.lastSupper = new Painting(this.daVinci, \"Last Supper\");\r\n\t}","void populateData();","private void initializeData() {\n ListaOfertas.removeAll(ListaOfertas);\n for(Articulo listaJuegos: ArticuloRepository.getListArticulo()){\n if(listaJuegos.getOferta().contains(\"S\")){\n listaJuegos.setValorDescuento(String.valueOf(listaJuegos.getPrecioArticulo()-(listaJuegos.getPrecioArticulo()*listaJuegos.getPorcentajeDescuento()/100)));\n ListaOfertas.add(listaJuegos);\n }\n\n }\n }","private void initData() {\n getCourse();\n// getMessage();\n\n }","public void InitData() {\n this.mItemTitleIds = new int[]{R.string.can_rvs_camera, R.string.can_ccaqyxfz};\n this.mItemTypes = new CanScrollCarInfoView.Item[]{CanScrollCarInfoView.Item.POP, CanScrollCarInfoView.Item.SWITCH};\n this.mPopValueIds[0] = new int[]{R.string.can_hjyxfzxt, R.string.can_dccsyxfzxt};\n this.mCarData = new CanDataInfo.LuxgenOd_SetData();\n }","private void initData() {\n\t\tIntent intent = getIntent();\n\t\tjob = (Job) intent.getSerializableExtra(\"job\");\n\t\tedt_content.setText(job.getJobContent());\n\t\tedt_course.setText(job.getCourseName());\n\t}","public AppData() {\n super(0,Entry.DataColumn.values().length);\n setColumnIdentifiers(Arrays.stream(Entry.DataColumn.values()).map(Entry.DataColumn::getName).toArray());\n System.out.println(\"a new AppData has been constructed\");\n }","private void initData() {\n\t\tpages = new ArrayList<WallpaperPage>();\n\n\t}","@Override\r\n\tpublic void updateData() {\n\t\t\r\n\t}","public ChangeData()\r\n\t\t{\r\n\t\t}","public void setInitialData(Dataset InitialData) {\r\n errorIfStarted();\r\n CurrentIteration = 0;\r\n this.InitialData = InitialData;\r\n }","@Override\n\tpublic void fillData() {\n\t}","protected boolean initLocalData() {\n return true;\n }","private TigerData() {\n initFields();\n }","private void setData() {\n populateInterfaceElements();\n }","public void setDefaultData()\n\t\t{\n\t\t\t\n\t\t\t//Creating demo/default ADMIN:\n\t\t\t\n\t\t\tUser testAdmin = new User(\"ADMIN\", \"YAGYESH\", \"123\", 123, Long.parseLong(\"7976648278\"));\n\t\t\tdata.userMap.put(testAdmin.getUserId(), testAdmin);\n\t\t\t\n\t\t\t//Creating demo/default CUSTOMER:\n\t\t\tUser tempCustomer = new User(\"CUSTOMER\", \"JOHN\", \"124\", 124, Long.parseLong(\"9462346459\"));\n\t\t\tdata.userMap.put(tempCustomer.getUserId(), tempCustomer);\n\t\t\t\n\t\t\t//Creating Airports:\n\t\t\tAirport airport1 = new Airport(\"Mumbai Chattrapathi Shivaji International Airport\",\n\t\t\t\t\t\t\t\t\t\t\t\"MUMBAI\", \"BOM\");\n\t\t\t\n\t\t\tAirport airport2 = new Airport(\"Bangalore Bengaluru International Airport \",\n\t\t\t\t\t\t\t\t\t\t\t\"Bangalore\", \"BLR\");\n\t\t\t\n\t\t\tAirport airport3 = new Airport(\"New Delhi Indira Gandhi International Airport\",\n\t\t\t\t\t\t\t\t\t\t\t\"New Delhi \", \"DEL\");\n\n\t\t\tAirport airport4 = new Airport(\"Hyderabad Rajiv Gandhi International Airport\",\n\t\t\t\t\t\t\t\t\t\t\t\"Hyderabad\", \"HYD\");\n\n\t\t\tdata.airportMap.put(airport1.getAirportCode(), airport1);\n\t\t\tdata.airportMap.put(airport2.getAirportCode(), airport2);\n\t\t\tdata.airportMap.put(airport3.getAirportCode(), airport3);\n\t\t\tdata.airportMap.put(airport4.getAirportCode(), airport4);\n\t\t\t\n\t\t\t//Creating DateTime Objects:\n\t\t\t\n\t\t\tDate dateTime1 = null;\n\t\t\tDate dateTime2 = null;\n\t\t\tDate dateTime3 = null;\n\t\t\tDate dateTime4 = null;\n\t\t\ttry\n\t\t\t{\n\t\t\t\tdateTime1 = dateFormat.parse(\"12-01-2020 05:12:00\");\n\t\t\t\tdateTime2 = dateFormat.parse(\"02-02-2020 23:45:00\");\n\t\t\t\tdateTime3 = dateFormat.parse(\"12-01-2020 07:12:00\");\n\t\t\t\tdateTime4 = dateFormat.parse(\"03-02-2020 01:45:00\");\n\t\t\t}\n\t\t\tcatch (ParseException e) \n\t\t\t{\n\t\t\t\te.getMessage();\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t\t//Creating Schedules:\n\t\t\tSchedule schedule1 = new Schedule(airport1, airport2, dateTime3, dateTime1, dateFormat);\n\t\t\tSchedule schedule2 = new Schedule(airport2, airport3, dateTime3, dateTime1, dateFormat);\n\t\t\tSchedule schedule3 = new Schedule(airport4, airport1, dateTime4, dateTime2, dateFormat);\n\t\t\tSchedule schedule4 = new Schedule(airport3, airport4, dateTime4, dateTime2, dateFormat);\n\t\t\t\n\t\t\t//Creating Flights:\n\t\t\tFlight flight1 = new Flight(\"AB3456\", \"INDIGO\", \"A330\", 293);\n\t\t\tFlight flight2 = new Flight(\"BO6789\", \"JET AIRWAYS\", \"777\", 440);\n\t\t\tdata.flightMap.put(flight1.getFlightNumber(), flight1);\n\t\t\tdata.flightMap.put(flight2.getFlightNumber(), flight2);\n\t\t\t\n\t\t\t//Creating Scheduled Flights:\n\t\t\tScheduledFlight scheduledFlight1 = new ScheduledFlight(flight1, 293, schedule1);\n\t\t\tScheduledFlight scheduledFlight2 = new ScheduledFlight(flight2, 440, schedule2);\n\t\t\tScheduledFlight scheduledFlight3 = new ScheduledFlight(flight1, 293, schedule3);\n\t\t\tScheduledFlight scheduledFlight4 = new ScheduledFlight(flight2, 440, schedule4);\n\t\t\t\n\t\t\t//Creating List of Scheduled Flights:\n\t\t\tdata.listScheduledFlights.add(scheduledFlight1);\n\t\t\tdata.listScheduledFlights.add(scheduledFlight2);\n\t\t\tdata.listScheduledFlights.add(scheduledFlight3);\n\t\t\tdata.listScheduledFlights.add(scheduledFlight4);\n\n\t\t}","public void preSaveInit() {\n persistentData.clear();\n for (int i = 0; i < getNumPoints(); i++) {\n persistentData.add(getPoint(i));\n }\n }","protected void loadData()\n {\n }","@Override\n public void onCreate() {\n initData();\n }","private void initializeData() {\n String[] sportsList = getResources().getStringArray(R.array.track_title);\n String[] sportsInfo = getResources().getStringArray(R.array.track_category);\n\n // Clear the existing data (to avoid duplication).\n mSportsData.clear();\n\n TypedArray trackImageResources =\n getResources().obtainTypedArray(R.array.track_image);\n\n // Create the ArrayList of Sports objects with titles and\n // information about each sport.\n for (int i = 0; i < sportsList.length; i++) {\n for (int j = 0; j < workout.size(); j++) {\n if (workout.get(j).equals(sportsList[i])) {\n mSportsData.add(new Track(sportsList[i], sportsInfo[i], trackImageResources.getResourceId(i, 0)));\n }\n }\n }\n\n // Notify the adapter of the change.\n mAdapter.notifyDataSetChanged();\n\n trackImageResources.recycle();\n }","@Override\n protected void initEventAndData() {\n }","private void initializeData() {\n posts = new ArrayList<>();\n posts.add(new Posts(\"Emma Wilson\", \"23 years old\", R.drawable.logo));\n posts.add(new Posts(\"Lavery Maiss\", \"25 years old\", R.drawable.star));\n posts.add(new Posts(\"Lillie Watts\", \"35 years old\", R.drawable.profile));\n }","@Override\n\tpublic void initializeValues() {\n\n\t}","public CreateData() {\n\t\t\n\t\t// TODO Auto-generated constructor stub\n\t}","private void initDataset(){\n dataSet.add(\"Karin\");\n dataSet.add(\"Ingrid\");\n dataSet.add(\"Helga\");\n dataSet.add(\"Renate\");\n dataSet.add(\"Elke\");\n dataSet.add(\"Ursula\");\n dataSet.add(\"Erika\");\n dataSet.add(\"Christa\");\n dataSet.add(\"Gisela\");\n dataSet.add(\"Monika\");\n\n addDataSet.add(\"Anna\");\n addDataSet.add(\"Sofia\");\n addDataSet.add(\"Emilia\");\n addDataSet.add(\"Emma\");\n addDataSet.add(\"Neele\");\n addDataSet.add(\"Franziska\");\n addDataSet.add(\"Heike\");\n addDataSet.add(\"Katrin\");\n addDataSet.add(\"Katharina\");\n addDataSet.add(\"Liselotte\");\n }","@Override\n\tpublic void insertDummyData() {\n\t\t\n\t}","public void postOpenInit() {\n logger = Logger.getLogger(Dataset.class);\n clear();\n for (DataPoint point : persistentData) {\n addPoint(point);\n }\n }","private void initData() {\n\n MyLog.log(\"调用录音上传接口\");\n MosHelper.startCheck(new MosHelper.mosSourceListener() {\n\n @Override\n public void getMosSource(String testTest, ArrayList<String> source) {\n // TODO Auto-generated method stub\n\n }\n\n @Override\n public void getMosIMEIAndId(String IMEI,\n String sourceId) {\n // TODO Auto-generated method stub\n MyLog.log(\"IMEI::\" + IMEI);\n Message message = handler.obtainMessage();\n message.obj = \"IMEI::\" + IMEI + \"\\n\" + \"sourceID:\\n\" + sourceId;\n message.what = 8;\n handler.sendMessage(message);\n\n }\n });\n }","private void fillData() {\n table.setRowList(data);\n }","private void remplirPrestaraireData() {\n\t}","public void InitData() {\n this.mItemTitleIds = new int[]{R.string.can_volvo_cysjysz, R.string.can_volvo_zdsm, R.string.can_door_unlock, R.string.can_volvo_zdhsj, R.string.can_volvo_qxzchsj, R.string.can_volvo_qxychsj, R.string.can_volvo_fxplsz, R.string.can_volvo_dstc, R.string.can_volvo_csaq, R.string.can_volvo_hfqcsz};\n this.mItemTypes = new CanScrollCarInfoView.Item[]{CanScrollCarInfoView.Item.SWITCH, CanScrollCarInfoView.Item.SWITCH, CanScrollCarInfoView.Item.POP, CanScrollCarInfoView.Item.SWITCH, CanScrollCarInfoView.Item.SWITCH, CanScrollCarInfoView.Item.SWITCH, CanScrollCarInfoView.Item.POP, CanScrollCarInfoView.Item.SWITCH, CanScrollCarInfoView.Item.SWITCH, CanScrollCarInfoView.Item.TITLE};\n this.mPopValueIds[2] = new int[]{R.string.can_door_unlock_key2, R.string.can_door_unlock_key1};\n this.mPopValueIds[6] = new int[]{R.string.can_ac_low, R.string.can_ac_mid, R.string.can_ac_high};\n this.mSetData = new CanDataInfo.VolvoXc60_CarSet();\n }","public synchronized void updateData() {\n updateDataFields(this::defaultFetcher);\n }","@Override\n\tpublic void initData() {\n\n\t\tsuper.initData();\n\t\tinitLsitData();\n\n\t\tviewpager.setAdapter(new MyPagerAdapter());\n\t\tindicator.setViewPager(viewpager);\n\n\t}"],"string":"[\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 \"private void initData() {\\n\\t}\",\n \"private void initialData() {\\n\\n }\",\n \"@Override\\n\\tpublic void initData() {\\n\\n\\n\\n\\t}\",\n \"private void initData() {\\n }\",\n \"@Override\\n\\tprotected void initData() {\\n\\n\\t}\",\n \"@Override\\n\\tprotected void initData() {\\n\\n\\t}\",\n \"@Override\\n\\tprotected void initData() {\\n\\t\\t\\n\\t}\",\n \"private void initData() {\\n\\n }\",\n \"@Override\\n protected void initData() {\\n }\",\n \"@Override\\n protected void initData() {\\n }\",\n \"@Override\\r\\n\\tprotected void InitData() {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\r\\n\\tprotected void initData() {\\n\\r\\n\\t}\",\n \"@Override\\n\\tprotected void initdata() {\\n\\n\\t}\",\n \"@Override\\n\\tpublic void initData() {\\n\\n\\t}\",\n \"@Override\\n\\tpublic void initData() {\\n\\n\\t}\",\n \"@Override\\n\\tpublic void initData() {\\n\\n\\t}\",\n \"private void InitData() {\\n\\t}\",\n \"@Override\\n\\tprotected void initData(){\\n\\t\\tsuper.initData();\\n\\t}\",\n \"@Override\\n\\tpublic void initData() {\\n\\t\\t\\n\\t}\",\n \"@Override\\r\\n\\tpublic void initData() {\\n\\t}\",\n \"public void initData() {\\n }\",\n \"public void initData() {\\n }\",\n \"private void initData(){\\n\\n }\",\n \"private void Initialized_Data() {\\n\\t\\t\\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 \"abstract void initializeNeededData();\",\n \"protected @Override\\r\\n abstract void initData();\",\n \"public void initData(){\\r\\n \\r\\n }\",\n \"public InitialData(){}\",\n \"@Override\\r\\n\\tprotected void init() {\\n\\t\\tupdateValues();\\r\\n\\t}\",\n \"public AddData() {\\n\\t\\tsuper();\\n\\t\\tfilled = false;\\n\\t}\",\n \"public void initData() {\\n\\t\\tnotes = new ArrayList<>();\\n\\t\\t//place to read notes e.g from file\\n\\t}\",\n \"public void initializeData() {\\n _currentDataAll = _purityReportData.getAll();\\n }\",\n \"public void initForAddNew() {\\r\\n\\r\\n\\t}\",\n \"public void InitData() {\\n }\",\n \"public void initData() {\\n nameDetailOrder.setText(\\\"-\\\");\\n tourDetailOrder.setText(\\\"-\\\");\\n packDetailOrder.setText(\\\"-\\\");\\n statusDetailOrder.setText(\\\"-\\\");\\n }\",\n \"private void initData() {\\n\\t\\tcomboBoxInit();\\n\\t\\tinitList();\\n\\t}\",\n \"private void addSampleData() {\\r\\n }\",\n \"private void fillData()\\n {\\n\\n }\",\n \"private void initData() {\\n requestServerToGetInformation();\\n }\",\n \"private void initData() {\\n\\t\\tSetTopBarTitle(getString(R.string.os_jsh_wdj_add_ldss));\\r\\n\\t\\tregFliter();\\r\\n\\t}\",\n \"protected void initDataFields() {\\r\\n //this module doesn't require any data fields\\r\\n }\",\n \"public static void populateData() {\\n\\n }\",\n \"@SuppressWarnings(\\\"static-access\\\")\\n\\tprivate void initData() {\\n\\t\\tstartDate = startDate.now();\\n\\t\\tendDate = endDate.now();\\n\\t}\",\n \"void initData(){\\n }\",\n \"private void initData() {\\n\\t\\tnamesInfo = new NameSurferDataBase(fileName);\\n\\n\\t}\",\n \"@Override\\n\\tprotected void initData() {\\n\\t\\tsuper.initData();\\n\\t\\tinitParam();\\n\\t\\t// 判断环节点是否上传，若已上传删掉\\n\\t\\thandleApprovalPermission();\\n\\t\\tinitInfo();\\n\\t\\tinitPage();\\n\\t}\",\n \"private void initializeData() {\\n lblItem.setText(product.getName());\\n txtReference.setText(product.getTransaction().getReferenceNumber());\\n txtItem.setText(product.getName());\\n txtDescription.setText(product.getDescription());\\n txtBrand.setText(product.getBrand());\\n txtModel.setText(product.getModel());\\n txtQuantity.setText(String.valueOf(product.getQuantity()));\\n txtUnit.setText(product.getUnit());\\n txtProductDate.setDate(product.getProduct_date());\\n txtOrigPrice.setText(String.valueOf(product.getOriginalPrice()));\\n txtAgent.setText(product.getAgent());\\n txtContactPerson.setText(product.getContactPerson());\\n try { \\n txtSupplier.setText(((Supplier)product.getSuppliers().toArray()[0]).getName());\\n } catch(ArrayIndexOutOfBoundsException ex) {\\n System.out.println(ex.toString());\\n }\\n }\",\n \"private RandomData() {\\n initFields();\\n }\",\n \"private void initialData() {\\n\\n// if (MorphiaObject.datastore.createQuery(SecurityRole.class).countAll() == 0) {\\n// for (final String roleName : Arrays\\n// .asList(controllers.Application.USER_ROLE)) {\\n// final SecurityRole role = new SecurityRole();\\n// role.roleName = roleName;\\n// MorphiaObject.datastore.save(role);\\n// }\\n// }\\n }\",\n \"private void initData() {\\n Author steinbeck = new Author(\\\"John\\\", \\\"Steinbeck\\\");\\n Publisher p1 = new Publisher(\\\"Covici Friede\\\", \\\"111 Main Street\\\", \\\"Santa Cruz\\\", \\\"CA\\\", \\\"95034\\\");\\n Book omam = new Book(\\\"Of Mice And Men\\\", \\\"11234\\\", p1);\\n \\n publisherRepository.save(p1);\\n\\n steinbeck.getBooks().add(omam);\\n omam.getAuthors().add(steinbeck);\\n authorRepository.save(steinbeck);\\n bookRepository.save(omam);\\n\\n // Create Crime & Punishment\\n Author a2 = new Author(\\\"Fyodor\\\", \\\"Dostoevsky\\\");\\n Publisher p2 = new Publisher( \\\"The Russian Messenger\\\", \\\"303 Stazysky Rao\\\", \\\"Rustovia\\\", \\\"OAL\\\", \\\"00933434-3943\\\");\\n Book b2 = new Book(\\\"Crime and Punishment\\\", \\\"22334\\\", p2);\\n a2.getBooks().add(b2);\\n b2.getAuthors().add(a2);\\n\\n publisherRepository.save(p2);\\n authorRepository.save(a2);\\n bookRepository.save(b2);\\n }\",\n \"private void initData() {\\n ContractList conl = new ContractList();\\n String iCard = txtindentify.getText().trim();\\n if (conl.getacc(iCard) == 0) {\\n txtAcc.setText(\\\"NEW CUSTOMER\\\");\\n\\n } else {\\n Customer cus = new Customer();\\n CustomerList cl = new CustomerList();\\n cus = cl.getcus(iCard);\\n txtAcc.setText(Integer.toString(cus.acc));\\n\\n }\\n }\",\n \"private void freshTheData() {\\n mData.clear();\\n mData.addAll(mDataOrg);\\n }\",\n \"public void setUpData() {\\n generalStatsCalculator.calculateOffsetTrees();\\n this.MostEmissionsRouteString =\\n RoutesArrayToString(routeStatsCalculator.getMostEmissionsRoutes());\\n this.LeastEmissionsRouteString =\\n RoutesArrayToString(routeStatsCalculator.getLeastEmissionsRoutes());\\n this.MostDistanceRouteString =\\n RoutesArrayToString(routeStatsCalculator.getMostDistanceRoutes());\\n this.LeastDistanceRouteString =\\n RoutesArrayToString(routeStatsCalculator.getLeastDistanceRoutes());\\n this.MostVisitedSourceAirportString =\\n CombineAirportsToOneString(airportStatsCalculator.getMostVisitedSrcAirports());\\n this.LeastVisitedSourceAirportString =\\n CombineAirportsToOneString(airportStatsCalculator.getLeastVisitedSrcAirports());\\n this.MostVisitedDestAirportString =\\n CombineAirportsToOneString(airportStatsCalculator.getMostVisitedDestAirports());\\n this.LeastVisitedDestAirportString =\\n CombineAirportsToOneString(airportStatsCalculator.getLeastVisitedDestAirports());\\n numOfTreesToString(generalStatsCalculator.getTreesToGrow());\\n generalStatsCalculator.createCarbonEmissionsComment();\\n }\",\n \"private void populateData() {\\r\\n\\t\\tfor(int i = 0; i < this.incomeRanges.length; i++) {\\r\\n\\t\\t\\tthis.addData(new Data(incomeRanges[i], 0), true);\\r\\n\\t\\t}\\t// end for\\r\\n\\t}\",\n \"private void populateData() {\\n\\t\\tList<TrafficRecord> l = TestHelper.getSampleData();\\r\\n\\t\\tfor(TrafficRecord tr: l){\\r\\n\\t\\t\\tput(tr);\\r\\n\\t\\t}\\r\\n\\t\\t \\r\\n\\t}\",\n \"private void initValues() {\\n \\n }\",\n \"private RowData() {\\n initFields();\\n }\",\n \"@Override\\n protected void initData()\\n {\\n super.initData();\\n\\n entityProps = getFormSession().getAssemblingMessageEntityProperties();\\n\\n refreshDataTable(entityProps);\\n }\",\n \"@Override\\n\\tprotected void initData() {\\n\\t\\trequestUserInfo();\\n\\t}\",\n \"private void initializeData() {\\n String[] storeTitles = getResources().getStringArray(R.array.store_titles);\\n String[] storeDescriptions = getResources().getStringArray(R.array.store_descriptions);\\n TypedArray storeImages = getResources().obtainTypedArray(R.array.stores_images);\\n\\n //Clear existing data to avoid duplication\\n storeData.clear();\\n\\n //Create an array list of dessert recipes with title, description and images\\n for(int i = 0; i < storeTitles.length; i++){\\n storeData.add(new Store(storeImages.getResourceId(i,0), storeTitles[i],storeDescriptions[i]));\\n }\\n\\n //Clear up data in the typed array\\n storeImages.recycle();\\n\\n //Notify the adapter of the change in the data set\\n storeAdapter.notifyDataSetChanged();\\n }\",\n \"void initData() {\\r\\n\\t\\tthis.daVinci = new Artist(\\\"da Vinci\\\");\\r\\n\\t\\tthis.mona = new Painting(daVinci, \\\"Mona Lisa\\\");\\r\\n\\t\\t//this.lastSupper = new Painting(this.daVinci, \\\"Last Supper\\\");\\r\\n\\t}\",\n \"void populateData();\",\n \"private void initializeData() {\\n ListaOfertas.removeAll(ListaOfertas);\\n for(Articulo listaJuegos: ArticuloRepository.getListArticulo()){\\n if(listaJuegos.getOferta().contains(\\\"S\\\")){\\n listaJuegos.setValorDescuento(String.valueOf(listaJuegos.getPrecioArticulo()-(listaJuegos.getPrecioArticulo()*listaJuegos.getPorcentajeDescuento()/100)));\\n ListaOfertas.add(listaJuegos);\\n }\\n\\n }\\n }\",\n \"private void initData() {\\n getCourse();\\n// getMessage();\\n\\n }\",\n \"public void InitData() {\\n this.mItemTitleIds = new int[]{R.string.can_rvs_camera, R.string.can_ccaqyxfz};\\n this.mItemTypes = new CanScrollCarInfoView.Item[]{CanScrollCarInfoView.Item.POP, CanScrollCarInfoView.Item.SWITCH};\\n this.mPopValueIds[0] = new int[]{R.string.can_hjyxfzxt, R.string.can_dccsyxfzxt};\\n this.mCarData = new CanDataInfo.LuxgenOd_SetData();\\n }\",\n \"private void initData() {\\n\\t\\tIntent intent = getIntent();\\n\\t\\tjob = (Job) intent.getSerializableExtra(\\\"job\\\");\\n\\t\\tedt_content.setText(job.getJobContent());\\n\\t\\tedt_course.setText(job.getCourseName());\\n\\t}\",\n \"public AppData() {\\n super(0,Entry.DataColumn.values().length);\\n setColumnIdentifiers(Arrays.stream(Entry.DataColumn.values()).map(Entry.DataColumn::getName).toArray());\\n System.out.println(\\\"a new AppData has been constructed\\\");\\n }\",\n \"private void initData() {\\n\\t\\tpages = new ArrayList<WallpaperPage>();\\n\\n\\t}\",\n \"@Override\\r\\n\\tpublic void updateData() {\\n\\t\\t\\r\\n\\t}\",\n \"public ChangeData()\\r\\n\\t\\t{\\r\\n\\t\\t}\",\n \"public void setInitialData(Dataset InitialData) {\\r\\n errorIfStarted();\\r\\n CurrentIteration = 0;\\r\\n this.InitialData = InitialData;\\r\\n }\",\n \"@Override\\n\\tpublic void fillData() {\\n\\t}\",\n \"protected boolean initLocalData() {\\n return true;\\n }\",\n \"private TigerData() {\\n initFields();\\n }\",\n \"private void setData() {\\n populateInterfaceElements();\\n }\",\n \"public void setDefaultData()\\n\\t\\t{\\n\\t\\t\\t\\n\\t\\t\\t//Creating demo/default ADMIN:\\n\\t\\t\\t\\n\\t\\t\\tUser testAdmin = new User(\\\"ADMIN\\\", \\\"YAGYESH\\\", \\\"123\\\", 123, Long.parseLong(\\\"7976648278\\\"));\\n\\t\\t\\tdata.userMap.put(testAdmin.getUserId(), testAdmin);\\n\\t\\t\\t\\n\\t\\t\\t//Creating demo/default CUSTOMER:\\n\\t\\t\\tUser tempCustomer = new User(\\\"CUSTOMER\\\", \\\"JOHN\\\", \\\"124\\\", 124, Long.parseLong(\\\"9462346459\\\"));\\n\\t\\t\\tdata.userMap.put(tempCustomer.getUserId(), tempCustomer);\\n\\t\\t\\t\\n\\t\\t\\t//Creating Airports:\\n\\t\\t\\tAirport airport1 = new Airport(\\\"Mumbai Chattrapathi Shivaji International Airport\\\",\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\\"MUMBAI\\\", \\\"BOM\\\");\\n\\t\\t\\t\\n\\t\\t\\tAirport airport2 = new Airport(\\\"Bangalore Bengaluru International Airport \\\",\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\\"Bangalore\\\", \\\"BLR\\\");\\n\\t\\t\\t\\n\\t\\t\\tAirport airport3 = new Airport(\\\"New Delhi Indira Gandhi International Airport\\\",\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\\"New Delhi \\\", \\\"DEL\\\");\\n\\n\\t\\t\\tAirport airport4 = new Airport(\\\"Hyderabad Rajiv Gandhi International Airport\\\",\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\\"Hyderabad\\\", \\\"HYD\\\");\\n\\n\\t\\t\\tdata.airportMap.put(airport1.getAirportCode(), airport1);\\n\\t\\t\\tdata.airportMap.put(airport2.getAirportCode(), airport2);\\n\\t\\t\\tdata.airportMap.put(airport3.getAirportCode(), airport3);\\n\\t\\t\\tdata.airportMap.put(airport4.getAirportCode(), airport4);\\n\\t\\t\\t\\n\\t\\t\\t//Creating DateTime Objects:\\n\\t\\t\\t\\n\\t\\t\\tDate dateTime1 = null;\\n\\t\\t\\tDate dateTime2 = null;\\n\\t\\t\\tDate dateTime3 = null;\\n\\t\\t\\tDate dateTime4 = null;\\n\\t\\t\\ttry\\n\\t\\t\\t{\\n\\t\\t\\t\\tdateTime1 = dateFormat.parse(\\\"12-01-2020 05:12:00\\\");\\n\\t\\t\\t\\tdateTime2 = dateFormat.parse(\\\"02-02-2020 23:45:00\\\");\\n\\t\\t\\t\\tdateTime3 = dateFormat.parse(\\\"12-01-2020 07:12:00\\\");\\n\\t\\t\\t\\tdateTime4 = dateFormat.parse(\\\"03-02-2020 01:45:00\\\");\\n\\t\\t\\t}\\n\\t\\t\\tcatch (ParseException e) \\n\\t\\t\\t{\\n\\t\\t\\t\\te.getMessage();\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t\\t//Creating Schedules:\\n\\t\\t\\tSchedule schedule1 = new Schedule(airport1, airport2, dateTime3, dateTime1, dateFormat);\\n\\t\\t\\tSchedule schedule2 = new Schedule(airport2, airport3, dateTime3, dateTime1, dateFormat);\\n\\t\\t\\tSchedule schedule3 = new Schedule(airport4, airport1, dateTime4, dateTime2, dateFormat);\\n\\t\\t\\tSchedule schedule4 = new Schedule(airport3, airport4, dateTime4, dateTime2, dateFormat);\\n\\t\\t\\t\\n\\t\\t\\t//Creating Flights:\\n\\t\\t\\tFlight flight1 = new Flight(\\\"AB3456\\\", \\\"INDIGO\\\", \\\"A330\\\", 293);\\n\\t\\t\\tFlight flight2 = new Flight(\\\"BO6789\\\", \\\"JET AIRWAYS\\\", \\\"777\\\", 440);\\n\\t\\t\\tdata.flightMap.put(flight1.getFlightNumber(), flight1);\\n\\t\\t\\tdata.flightMap.put(flight2.getFlightNumber(), flight2);\\n\\t\\t\\t\\n\\t\\t\\t//Creating Scheduled Flights:\\n\\t\\t\\tScheduledFlight scheduledFlight1 = new ScheduledFlight(flight1, 293, schedule1);\\n\\t\\t\\tScheduledFlight scheduledFlight2 = new ScheduledFlight(flight2, 440, schedule2);\\n\\t\\t\\tScheduledFlight scheduledFlight3 = new ScheduledFlight(flight1, 293, schedule3);\\n\\t\\t\\tScheduledFlight scheduledFlight4 = new ScheduledFlight(flight2, 440, schedule4);\\n\\t\\t\\t\\n\\t\\t\\t//Creating List of Scheduled Flights:\\n\\t\\t\\tdata.listScheduledFlights.add(scheduledFlight1);\\n\\t\\t\\tdata.listScheduledFlights.add(scheduledFlight2);\\n\\t\\t\\tdata.listScheduledFlights.add(scheduledFlight3);\\n\\t\\t\\tdata.listScheduledFlights.add(scheduledFlight4);\\n\\n\\t\\t}\",\n \"public void preSaveInit() {\\n persistentData.clear();\\n for (int i = 0; i < getNumPoints(); i++) {\\n persistentData.add(getPoint(i));\\n }\\n }\",\n \"protected void loadData()\\n {\\n }\",\n \"@Override\\n public void onCreate() {\\n initData();\\n }\",\n \"private void initializeData() {\\n String[] sportsList = getResources().getStringArray(R.array.track_title);\\n String[] sportsInfo = getResources().getStringArray(R.array.track_category);\\n\\n // Clear the existing data (to avoid duplication).\\n mSportsData.clear();\\n\\n TypedArray trackImageResources =\\n getResources().obtainTypedArray(R.array.track_image);\\n\\n // Create the ArrayList of Sports objects with titles and\\n // information about each sport.\\n for (int i = 0; i < sportsList.length; i++) {\\n for (int j = 0; j < workout.size(); j++) {\\n if (workout.get(j).equals(sportsList[i])) {\\n mSportsData.add(new Track(sportsList[i], sportsInfo[i], trackImageResources.getResourceId(i, 0)));\\n }\\n }\\n }\\n\\n // Notify the adapter of the change.\\n mAdapter.notifyDataSetChanged();\\n\\n trackImageResources.recycle();\\n }\",\n \"@Override\\n protected void initEventAndData() {\\n }\",\n \"private void initializeData() {\\n posts = new ArrayList<>();\\n posts.add(new Posts(\\\"Emma Wilson\\\", \\\"23 years old\\\", R.drawable.logo));\\n posts.add(new Posts(\\\"Lavery Maiss\\\", \\\"25 years old\\\", R.drawable.star));\\n posts.add(new Posts(\\\"Lillie Watts\\\", \\\"35 years old\\\", R.drawable.profile));\\n }\",\n \"@Override\\n\\tpublic void initializeValues() {\\n\\n\\t}\",\n \"public CreateData() {\\n\\t\\t\\n\\t\\t// TODO Auto-generated constructor stub\\n\\t}\",\n \"private void initDataset(){\\n dataSet.add(\\\"Karin\\\");\\n dataSet.add(\\\"Ingrid\\\");\\n dataSet.add(\\\"Helga\\\");\\n dataSet.add(\\\"Renate\\\");\\n dataSet.add(\\\"Elke\\\");\\n dataSet.add(\\\"Ursula\\\");\\n dataSet.add(\\\"Erika\\\");\\n dataSet.add(\\\"Christa\\\");\\n dataSet.add(\\\"Gisela\\\");\\n dataSet.add(\\\"Monika\\\");\\n\\n addDataSet.add(\\\"Anna\\\");\\n addDataSet.add(\\\"Sofia\\\");\\n addDataSet.add(\\\"Emilia\\\");\\n addDataSet.add(\\\"Emma\\\");\\n addDataSet.add(\\\"Neele\\\");\\n addDataSet.add(\\\"Franziska\\\");\\n addDataSet.add(\\\"Heike\\\");\\n addDataSet.add(\\\"Katrin\\\");\\n addDataSet.add(\\\"Katharina\\\");\\n addDataSet.add(\\\"Liselotte\\\");\\n }\",\n \"@Override\\n\\tpublic void insertDummyData() {\\n\\t\\t\\n\\t}\",\n \"public void postOpenInit() {\\n logger = Logger.getLogger(Dataset.class);\\n clear();\\n for (DataPoint point : persistentData) {\\n addPoint(point);\\n }\\n }\",\n \"private void initData() {\\n\\n MyLog.log(\\\"调用录音上传接口\\\");\\n MosHelper.startCheck(new MosHelper.mosSourceListener() {\\n\\n @Override\\n public void getMosSource(String testTest, ArrayList<String> source) {\\n // TODO Auto-generated method stub\\n\\n }\\n\\n @Override\\n public void getMosIMEIAndId(String IMEI,\\n String sourceId) {\\n // TODO Auto-generated method stub\\n MyLog.log(\\\"IMEI::\\\" + IMEI);\\n Message message = handler.obtainMessage();\\n message.obj = \\\"IMEI::\\\" + IMEI + \\\"\\\\n\\\" + \\\"sourceID:\\\\n\\\" + sourceId;\\n message.what = 8;\\n handler.sendMessage(message);\\n\\n }\\n });\\n }\",\n \"private void fillData() {\\n table.setRowList(data);\\n }\",\n \"private void remplirPrestaraireData() {\\n\\t}\",\n \"public void InitData() {\\n this.mItemTitleIds = new int[]{R.string.can_volvo_cysjysz, R.string.can_volvo_zdsm, R.string.can_door_unlock, R.string.can_volvo_zdhsj, R.string.can_volvo_qxzchsj, R.string.can_volvo_qxychsj, R.string.can_volvo_fxplsz, R.string.can_volvo_dstc, R.string.can_volvo_csaq, R.string.can_volvo_hfqcsz};\\n this.mItemTypes = new CanScrollCarInfoView.Item[]{CanScrollCarInfoView.Item.SWITCH, CanScrollCarInfoView.Item.SWITCH, CanScrollCarInfoView.Item.POP, CanScrollCarInfoView.Item.SWITCH, CanScrollCarInfoView.Item.SWITCH, CanScrollCarInfoView.Item.SWITCH, CanScrollCarInfoView.Item.POP, CanScrollCarInfoView.Item.SWITCH, CanScrollCarInfoView.Item.SWITCH, CanScrollCarInfoView.Item.TITLE};\\n this.mPopValueIds[2] = new int[]{R.string.can_door_unlock_key2, R.string.can_door_unlock_key1};\\n this.mPopValueIds[6] = new int[]{R.string.can_ac_low, R.string.can_ac_mid, R.string.can_ac_high};\\n this.mSetData = new CanDataInfo.VolvoXc60_CarSet();\\n }\",\n \"public synchronized void updateData() {\\n updateDataFields(this::defaultFetcher);\\n }\",\n \"@Override\\n\\tpublic void initData() {\\n\\n\\t\\tsuper.initData();\\n\\t\\tinitLsitData();\\n\\n\\t\\tviewpager.setAdapter(new MyPagerAdapter());\\n\\t\\tindicator.setViewPager(viewpager);\\n\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.78427535","0.78427535","0.78427535","0.78427535","0.78427535","0.78427535","0.7729716","0.76609707","0.76533806","0.7651555","0.7649823","0.7649823","0.7589307","0.7576715","0.7561135","0.7561135","0.75534034","0.7519955","0.75117916","0.75036556","0.75036556","0.75036556","0.7481854","0.74773854","0.74300766","0.7406468","0.7373137","0.7373137","0.7363422","0.73532665","0.723844","0.723844","0.7230662","0.71973634","0.70044845","0.6999181","0.69345504","0.69184226","0.6898628","0.68913805","0.6838525","0.681482","0.6782164","0.67782426","0.67601347","0.67508817","0.672582","0.672468","0.67101634","0.6707236","0.67040944","0.6699053","0.6697077","0.6691281","0.6659343","0.66405004","0.66324806","0.66321844","0.662582","0.66097826","0.6588789","0.65837604","0.656768","0.6552521","0.6542868","0.6523355","0.6500091","0.647409","0.64719874","0.64065295","0.6400007","0.63985103","0.63950604","0.6393688","0.63785744","0.63738656","0.63431716","0.63419545","0.63243794","0.63068223","0.6300888","0.62890565","0.6286565","0.62284076","0.6219374","0.6210843","0.6209144","0.6194146","0.6177723","0.61677116","0.61659074","0.61445767","0.61404145","0.613738","0.61304027","0.6120728","0.6120403","0.6116027","0.609901","0.608835","0.607105"],"string":"[\n \"0.78427535\",\n \"0.78427535\",\n \"0.78427535\",\n \"0.78427535\",\n \"0.78427535\",\n \"0.78427535\",\n \"0.7729716\",\n \"0.76609707\",\n \"0.76533806\",\n \"0.7651555\",\n \"0.7649823\",\n \"0.7649823\",\n \"0.7589307\",\n \"0.7576715\",\n \"0.7561135\",\n \"0.7561135\",\n \"0.75534034\",\n \"0.7519955\",\n \"0.75117916\",\n \"0.75036556\",\n \"0.75036556\",\n \"0.75036556\",\n \"0.7481854\",\n \"0.74773854\",\n \"0.74300766\",\n \"0.7406468\",\n \"0.7373137\",\n \"0.7373137\",\n \"0.7363422\",\n \"0.73532665\",\n \"0.723844\",\n \"0.723844\",\n \"0.7230662\",\n \"0.71973634\",\n \"0.70044845\",\n \"0.6999181\",\n \"0.69345504\",\n \"0.69184226\",\n \"0.6898628\",\n \"0.68913805\",\n \"0.6838525\",\n \"0.681482\",\n \"0.6782164\",\n \"0.67782426\",\n \"0.67601347\",\n \"0.67508817\",\n \"0.672582\",\n \"0.672468\",\n \"0.67101634\",\n \"0.6707236\",\n \"0.67040944\",\n \"0.6699053\",\n \"0.6697077\",\n \"0.6691281\",\n \"0.6659343\",\n \"0.66405004\",\n \"0.66324806\",\n \"0.66321844\",\n \"0.662582\",\n \"0.66097826\",\n \"0.6588789\",\n \"0.65837604\",\n \"0.656768\",\n \"0.6552521\",\n \"0.6542868\",\n \"0.6523355\",\n \"0.6500091\",\n \"0.647409\",\n \"0.64719874\",\n \"0.64065295\",\n \"0.6400007\",\n \"0.63985103\",\n \"0.63950604\",\n \"0.6393688\",\n \"0.63785744\",\n \"0.63738656\",\n \"0.63431716\",\n \"0.63419545\",\n \"0.63243794\",\n \"0.63068223\",\n \"0.6300888\",\n \"0.62890565\",\n \"0.6286565\",\n \"0.62284076\",\n \"0.6219374\",\n \"0.6210843\",\n \"0.6209144\",\n \"0.6194146\",\n \"0.6177723\",\n \"0.61677116\",\n \"0.61659074\",\n \"0.61445767\",\n \"0.61404145\",\n \"0.613738\",\n \"0.61304027\",\n \"0.6120728\",\n \"0.6120403\",\n \"0.6116027\",\n \"0.609901\",\n \"0.608835\",\n \"0.607105\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":38188,"cells":{"query":{"kind":"string","value":"This method will check whether the default box types were created in the file"},"document":{"kind":"string","value":"public ArrayList<Object> validateDefaultBoxTypes(){\n\t\tArrayList<Object> btList = new ArrayList<Object>();\n\t\t\n\t\tif(getList(PRODUCT_PATH)==null){\n\t\t\tbtList.addAll(defaultBoxTypes());\n\t\t\t\n\t\t\treturn btList;\n\t\t}\n\t\t\n\t\tfor(int i=0; i< defaultBoxTypes().size(); i++){\n\t\t\t\n\t\t\tif(defaultBoxTypes().get(i).equals(getList(PRODUCT_PATH).iterator())){\n\t\t\t\n\t\t\t}else{\n\t\t\t\tbtList.add(defaultBoxTypes().get(i));\n\t\t\t}\n\t\t}\n\t\t\n\t\tif(btList.size()<0){\n\t\t\treturn null;\n\t\t}else{\n\t\t\treturn btList;\n\t\t}\n\t}"},"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 ArrayList<Object> defaultBoxTypes(){\n\t\t//ColourPrintOptions Properties\n\t\t//All colour option types available in the ColourPrintOption enum\n\t\tint[] colour = new int[]{ColourPrintOption.NoColour.getColOpt(), \n\t\t\t\tColourPrintOption.OneColour.getColOpt(),ColourPrintOption.TwoColour.getColOpt()};\n\t\t\n\t\t//All colour option percentage cost available in the ColourPrintOption enum\n\t\tdouble[] colPerc = new double[]{ColourPrintOption.NoColour.getPercentage(), \n\t\t\t\tColourPrintOption.OneColour.getPercentage(),ColourPrintOption.TwoColour.getPercentage()};\n\t\t\n\t\tArrayList<BoxType> boxes = new ArrayList<BoxType>();\t\t\n\t\t//Hardcoded initial box type values\t\t\n\t\t//Box Type | Grade | ColourPrintOption | ColourPrintOption% | ReinBottom | ReinfCorn | Reinf% | IsActive\n\t\tboxes.add(new BoxType(\"1\",\"1\", colour[0], colPerc[0], false, false, 0.00, true));\n\t\tboxes.add(new BoxType(\"1\",\"2\", colour[0], colPerc[0], false, false, 0.00, true));\n\t\tboxes.add(new BoxType(\"1\",\"3\", colour[0], colPerc[0], false, false, 0.00, true));\n\t\tboxes.add(new BoxType(\"2\",\"2\", colour[1], colPerc[1], false, false, 12.00, true));\n\t\tboxes.add(new BoxType(\"2\",\"3\", colour[1], colPerc[1], false, false, 12.00, true));\n\t\tboxes.add(new BoxType(\"2\",\"4\", colour[1], colPerc[1], false, false, 12.00, true));\n\t\tboxes.add(new BoxType(\"3\",\"2\",colour[2], colPerc[2], false, false, 15.00, true));\n\t\tboxes.add(new BoxType(\"3\",\"3\",colour[2], colPerc[2], false, false, 15.00, true));\n\t\tboxes.add(new BoxType(\"3\",\"4\",colour[2], colPerc[2], false, false, 15.00, true));\n\t\tboxes.add(new BoxType(\"3\",\"5\",colour[2], colPerc[2], false, false, 15.00, true));\n\t\tboxes.add(new BoxType(\"4\",\"2\", colour[2], colPerc[2], true, false, 15.00, true));\n\t\tboxes.add(new BoxType(\"4\",\"3\", colour[2], colPerc[2], true, false, 15.00, true));\n\t\tboxes.add(new BoxType(\"4\",\"4\", colour[2], colPerc[2], true, false, 15.00, true));\n\t\tboxes.add(new BoxType(\"4\",\"5\", colour[2], colPerc[2], true, false, 15.00, true));\n\t\tboxes.add(new BoxType(\"5\",\"3\", colour[2], colPerc[2], true, true, 25.00, true));\n\t\tboxes.add(new BoxType(\"5\",\"4\", colour[2], colPerc[2], true, true, 25.00, true));\n\t\tboxes.add(new BoxType(\"5\",\"5\", colour[2], colPerc[2], true, true, 25.00, true));\n\t\t\n\t\tArrayList<Object> btList = new ArrayList<Object>();\n\t\t\n\t\tfor(int i=0; i < boxes.size(); i++){\n\t\t\tbtList.add(boxes.get(i).getBoxType() +\",\" + boxes.get(i).getCardGrade() \n\t\t\t\t\t+\",\" + boxes.get(i).getColourOption() + \",\" + boxes.get(i).getColourOptionPercentage()\n\t\t\t\t\t+ \",\" + boxes.get(i).isReinfBottom() + \",\" + boxes.get(i).isReinfCorn() + \",\" \n\t\t\t\t\t+ boxes.get(i).getReinfPercentage() + \",\" + boxes.get(i).isActive + \", \\n\");\t\n\t\t}\n\t\treturn btList;\n\t}","@Override\n\tpublic boolean checkTypes() {\n\t\treturn false;\n\t}","private void checkAndInsertDefaultEntries() {\n\t\tinsertDefaultMediaFormats();\n\t}","boolean isSetBox();","public void verify() {\n lblPaletteContent();\n treePaletteContentsTree();\n lblJLabel();\n btMoveUp();\n btMoveDown();\n btRemove();\n btNewCategory();\n btAddFromJAR();\n btAddFromLibrary();\n btAddFromProject();\n btResetPalette();\n btClose();\n }","private void checkChanges() {\n CertificationStyleWrapper wrapper = (CertificationStyleWrapper) cbCertificationStyle.getSelectedItem();\n if (wrapper != null && settings.getCertificationStyle() != wrapper.style) {\n settings.setCertificationStyle(wrapper.style);\n }\n\n // set NFO filenames\n settings.clearNfoFilenames();\n if (chckbxTvShowNfo1.isSelected()) {\n settings.addNfoFilename(TvShowNfoNaming.TV_SHOW);\n }\n\n settings.clearEpisodeNfoFilenames();\n if (chckbxEpisodeNfo1.isSelected()) {\n settings.addEpisodeNfoFilename(TvShowEpisodeNfoNaming.FILENAME);\n }\n }","public boolean loadMessageBox(){\n boolean isMessagebox = true;\n byte tempType = CustomCanvas.msgType;\n CustomCanvas.msgType = -1;\n \n if(tempType == 0){\n tempType = 1;\n } else if(tempType == 20) {\n tempType = 16;\n }\n if (tempType == 1 || tempType == 2 || tempType == 3 || tempType == 16) {\n isMessagebox = false;\n }\n handleSmartPopup(tempType);\n return isMessagebox;\n }","private boolean checkFields() {\n if (editTxtName.getText().equals(\"\")) return false;//name\n if (editTxtDesc.getText().equals(\"\")) return false;//desc\n if (editClrColor.getValue() == null) return false;//color\n if (oldEnvironment == null) return false;//environment is null\n return true;//everything is valid\n }","boolean isSetKeyBox();","public void check()\n {\n typeDec.check();\n }","private static void types() {\n\t\ttry {\n\t\t\tScanner handicaps = new Scanner(new FileInputStream(\"handicaps.txt\"));\n\t\t\tSystem.out.println(\"\\nAvailable Boat Types\");\n\t\t\tSystem.out.println(\"--------------------\");\n\t\t\twhile(handicaps.hasNextLine()) {\n\t\t\t\tSystem.out.println(handicaps.nextLine().split(\":\")[0]);\n\t\t\t}\n\t\t\tSystem.out.println(\"\");\n\t\t\thandicaps.close();\n\t\t} catch (FileNotFoundException e) {\n\t\t\tSystem.err.println(\"\\n\\nSEVERE ERROR: CRUCIAL FILE HANDICAPS.TXT NOT FOUND\\n\\n\");\n\t\t\tSystem.err.println(\"Attempting to re-create file....\");\n\t\t\tgenerateHandicaps();\n\t\t\tSystem.err.println(\"Success!\\nTry command again.\\n\");\n\t\t}\n\n\t}","boolean isImageType();","@Override\r\n\tprotected void isBodyValid() {\r\n\t\tif( withinButton.isSelected() \r\n\t\t\t\t&& withinField.getText().equals(\"\")){\r\n//\t\t\tinformation.setText(\"When --within is selected you must specify a file.\");\r\n\t\t\tvalidBody = false;\r\n\t\t}\r\n\t\telse \r\n\t\t\tvalidBody = true;\r\n\t\t\r\n\t\tokForm();\r\n\r\n\t}","void check()\n {\n checkUsedType(responseType);\n checkUsedType(requestType);\n }","private void checkValid() {\n getSimType();\n getInitialConfig();\n getIsOutlined();\n getEdgePolicy();\n getNeighborPolicy();\n getCellShape();\n }","private boolean canSelectCurWorldType() {\n WorldType worldtype = WorldType.WORLD_TYPES[this.selectedIndex];\n if (worldtype != null && worldtype.canBeCreated()) {\n return worldtype == WorldType.DEBUG_ALL_BLOCK_STATES ? hasShiftDown() : true;\n } else {\n return false;\n }\n }","private boolean validate(){\n return EditorUtils.editTextValidator(generalnformation,etGeneralnformation,\"Type in information\") &&\n EditorUtils.editTextValidator(symptoms,etSymptoms, \"Type in symptoms\") &&\n EditorUtils.editTextValidator(management,etManagement, \"Type in management\");\n }","@Override\n public Set<String> validTypes() {\n return factory.validTypes();\n }","private boolean checkDefaultValueAgainstQuestionType(){\n\t\t\n\t\tString defaultValue = txtDefaultValue.getText();\n\t\tQuestionDef questionDef = (QuestionDef) propertiesObj;\n\t\t\n\t\tif(questionDef.getDataType() == QuestionDef.QTN_TYPE_NUMERIC && \n\t\t\t\t!PropertiesViewHelper.isDefaultValueNumeric(defaultValue)){\n\t\t\t\n\t\t\ttxtDefaultValue.setText(\"\");\n\t\t\treturn false;\n\t\t}\n\t\telse if(questionDef.getDataType() == QuestionDef.QTN_TYPE_DECIMAL &&\n\t\t\t\t!PropertiesViewHelper.isDefaultValueDecimal(defaultValue)){\n\t\t\ttxtDefaultValue.setText(\"\");\n\t\t\treturn false;\n\t\t}\n\t\telse if(questionDef.getDataType() == QuestionDef.QTN_TYPE_BOOLEAN &&\n\t\t\t\t!PropertiesViewHelper.isDefaultValueBoolean(defaultValue)){\t\t\t\n\t\t\ttxtDefaultValue.setText(\"\");\n\t\t\treturn false;\n\t\t}\n\t\treturn true;\n\t}","@Test\n public void require_that_types_are_not_checked() throws IOException {\n Slime slime = new Slime();\n Cursor root = slime.setObject();\n root.setString(\"enumval\", \"null\");\n root.setString(\"intval\", \"null\");\n root.setString(\"longval\", \"null\");\n root.setString(\"boolval\", \"null\");\n root.setString(\"doubleval\", \"null\");\n InnerCNode def = new DefParser(\"simpletypes\", new StringReader(StringUtilities.implode(SimpletypesConfig.CONFIG_DEF_SCHEMA, \"\\n\"))).getTree();\n ByteArrayOutputStream baos = new ByteArrayOutputStream();\n new ConfigFileFormat(def).encode(baos, slime);\n assertThat(baos.toString(StandardCharsets.UTF_8), is(\"enumval null\\nintval null\\nlongval null\\nboolval false\\ndoubleval null\\n\"));\n }","boolean hasPlaceholderType();","@Test\n public void getType() {\n\n // Defaulted1 is Rec then we mutates.\n assertEquals(TypeOfShape.RECTANGLE, defaultShape1.getType());\n assertNotEquals(TypeOfShape.OVAL, defaultShape1.getType());\n defaultShape1 = new Oval(defaultColor1, defaultPosition1, defaultSize1);\n assertEquals(TypeOfShape.OVAL, defaultShape1.getType());\n assertNotEquals(TypeOfShape.RECTANGLE, defaultShape1.getType());\n // Default2 is oval then we mutates.\n assertEquals(TypeOfShape.OVAL, defaultShape2.getType());\n assertNotEquals(TypeOfShape.RECTANGLE, defaultShape2.getType());\n defaultShape2 = new Rectangle(defaultColor2, defaultPosition2, defaultSize2);\n assertEquals(TypeOfShape.RECTANGLE, defaultShape2.getType());\n assertNotEquals(TypeOfShape.OVAL, defaultShape2.getType());\n }","public boolean isSetFileType()\n {\n synchronized (monitor())\n {\n check_orphaned();\n return get_store().count_elements(FILETYPE$8) != 0;\n }\n }","boolean getBox();","public static boolean processDefaults() {\r\n\t\tboolean done = false;\r\n\t\tint winScore = stringToInt(IniSetup.winScore.getText());\r\n\t\tint loseScore = stringToInt(IniSetup.loseScore.getText());\r\n\t\tFile file = new File(Main.soundDir);\r\n\t\t\r\n\t\t//Check winning score value.\r\n\t\tif (winScore >= 100) {\r\n\t\t\t//Check loosing score value.\r\n\t\t\tif (loseScore < 0) {\r\n\t\t\t\t//Check if the input for sounds is a directory.\r\n\t\t\t\tif (file.isDirectory()) {\r\n\t\t\t\t\tdone = true;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\t//Show dialog box reminder.\r\n\t\tif (!done) FrameUtils.showDialogBox(\"Check your inputs.\");\r\n\t\t\r\n\t\t//Save the default options.\r\n\t\tsaveDefaultOptions();\r\n\t\t\r\n\t\t//Create the defaults array list.\r\n\t\tcreateDefaultsArrList();\r\n\r\n\t\treturn done;\r\n\t}","public boolean isSetTypes() {\n return this.types != null;\n }","private boolean CheckCallDefinitions()\n {\n if(apiCallDefinitions==null || apiCallDefinitions.size()==0)\n return false;\n\n if(defaultAPIVersionPath==null)\n return false;\n\n return true;\n }","private void checkStructure() {\n for (DatabaseUpdateType updateType : DatabaseUpdateType.values()) {\n checkDatabaseStructure(updateType);\n }\n }","private boolean checkFields() {\n boolean test = true;\n if (fname.isEmpty()) {\n test = false;\n }\n if (lname.isEmpty()) {\n test = false;\n }\n if (cin.isEmpty()) {\n test = false;\n }\n if (typeCompte.equals(\"Bancaire\")) {\n if (decouvertNF.isEmpty())\n test = false;\n } else if (typeCompte.equals(\"Epargne\")) {\n if (tauxInteretNF.isEmpty())\n test = false;\n }\n if (s_datePK.getValue() == null) {\n s_datePK.setStyle(\"-fx-border-color:red;-fx-border-radius:3px;-fx-border-size: 1px;\");\n test = false;\n }\n\n return test;\n }","public boolean initTypes() throws RepositoryAccessException {\r\n // XXX Magic String\r\n File sqlFile = new File(m_sqlDirectory, \"types.sql\");\r\n if (!sqlFile.exists() || !sqlFile.canRead() || !sqlFile.isFile())\r\n return false;\r\n \r\n return executeScriptAndProbe(sqlFile, true);\r\n }","public boolean isSetFileType() {\n return this.fileType != null;\n }","boolean hasDocumentType();","public boolean isSetGearboxtypestring() {\n return this.gearboxtypestring != null;\n }","private boolean emptyBoxes() {\n return (FirstName.getText().toString().isEmpty() || LastName.getText().toString().isEmpty() ||\n ID.getText().toString().isEmpty() || PhoneNumber.getText().toString().isEmpty() ||\n EmailAddress.getText().toString().isEmpty() || CreditCard.getText().toString().isEmpty() ||\n Password.getText().toString().isEmpty());\n }","public boolean isSetGearboxtype() {\n return __isset_bit_vector.get(__GEARBOXTYPE_ISSET_ID);\n }","public boolean isUnknownType() {\n switch (type) {\n case ICNS.ICON:\n case ICNS.ICN_:\n case ICNS.icm_:\n case ICNS.ics_:\n case ICNS.ich_:\n case ICNS.icm4:\n case ICNS.ics4:\n case ICNS.icl4:\n case ICNS.ich4:\n case ICNS.icm8:\n case ICNS.ics8:\n case ICNS.icl8:\n case ICNS.ich8:\n case ICNS.s8mk:\n case ICNS.l8mk:\n case ICNS.h8mk:\n case ICNS.t8mk:\n case ICNS.is32:\n case ICNS.il32:\n case ICNS.ih32:\n case ICNS.it32:\n case ICNS.ic08:\n case ICNS.ic09:\n case ICNS.ic10:\n return false;\n }\n\n return true;\n }","private BioMightBoundBoxes setupDefaultBoundBoxes() \r\n\t{\r\n\t\t// Set up the collection to hold the Bounding Boxes\r\n\t\tBioMightBoundBoxes bioBoundBoxes = null;\r\n\t\r\n\t\t// Initialize the position of the bounding box vars\r\n\t\tBigDecimal xPos = new BigDecimal(0.0);\r\n\t\tBigDecimal yPos = new BigDecimal(0.0);\r\n\t\tBigDecimal zPos= new BigDecimal(0.0);\r\n\t\t\r\n\t\t// Set to base 1x1x1 cube\r\n\t\tBigDecimal xVector= new BigDecimal(1.0);\r\n\t\tBigDecimal yVector= new BigDecimal(1.0); \r\n\t\tBigDecimal zVector= new BigDecimal(1.0);\r\n\t\r\n\t\t// Initialize a BoundBox\r\n\t\tBioMightBoundBox bioBoundBox = null;\r\n\t\r\n\t\t// Initialize Connectors \r\n\t\tBioMightConnectors bioMightConnectors = null; \r\n\r\n\t\t// Initialize a Connector \r\n\t\tBioMightConnector bioMightConnector= null;\r\n\t\r\n\t\tdouble circumference = 0.0;\r\n\t\tdouble[] startPos = {0.0, 0.0, 0.0};\r\n\t\tdouble[][] startPoints = null;\r\n\t\r\n\t\t//********************************************************************* \r\n\t\t// LEFT FOOT BOUNDBOX\r\n\t\t// Set up the Bounding Box for the Feet\r\n\t\t// The connector for this will come from the incoming Bound Box\r\n\t\t// Both are defined like and bolt and they lock into position at the\r\n\t\t// interestion of both connectors\r\n\t\t//**********************************************************************\r\n\t\txPos = new BigDecimal(0.0);\r\n\t\tyPos = new BigDecimal(-65.0);\r\n\t\tzPos= new BigDecimal(3.0);\r\n\t\r\n\t\txVector= new BigDecimal(1.0);\r\n\t\tyVector= new BigDecimal(4.0); \r\n\t\tzVector= new BigDecimal(1.0);\r\n\r\n\t\tbioBoundBox = new BioMightBoundBox(xPos, yPos, zPos, xVector, yVector, zVector);\r\n\t\tbioMightConnectors = new BioMightConnectors();\r\n\t\r\n\t\t// Feet Epithelium Connector\r\n\t\tcircumference = 0.3;\r\n\t\tstartPos = getStartPoints(-2.0, -65.0, -1.0);\r\n\t\tstartPoints = BioGraphics.octogonYPlane(startPos, circumference);\r\n\t\tbioMightConnector = new BioMightConnector(startPoints, Constants.FootEpitheliumRef,\"connType\");\r\n\t\tbioMightConnectors.setBioMightConnector(Constants.FootEpitheliumRef, bioMightConnector);\r\n\t\t\r\n\t\t// Associate the connector on the Box\r\n\t\tbioBoundBox.setBioMightConnectors(bioMightConnectors);\r\n\t\t\r\n\t\t// Put the Bounding Box in the collection\r\n\t\tbioBoundBoxes.setBoundingBox(Constants.LeftFootRef, bioBoundBox);\r\n\t\r\n\t\r\n\t\t//********************************************************************* er\r\n\t\t// RIGHT CNEMES BOUNDBOX\r\n\t\t// Set up the Bounding Box for the Foot\r\n\t\t// On a porportioned human, the \r\n\t\t//**********************************************************************\r\n\t\txPos = new BigDecimal(0.0);\r\n\t\tyPos = new BigDecimal(-14.0);\r\n\t\tzPos= new BigDecimal(-3.0);\r\n\t\r\n\t\txVector= new BigDecimal(1.0);\r\n\t\tyVector= new BigDecimal(4.0); \r\n\t\tzVector= new BigDecimal(1.0);\r\n\r\n\t\tbioBoundBox = new BioMightBoundBox(xPos, yPos, zPos, xVector, yVector, zVector);\r\n\t\tbioMightConnectors = new BioMightConnectors();\r\n\t\t\r\n\t\t// Foot Epithelium Connector\r\n\t\tcircumference = 0.3;\r\n\t\tstartPos = getStartPoints(2.0, -65.0, -1.0);\r\n\t\tstartPoints = BioGraphics.octogonYPlane(startPos, circumference);\r\n\t\tbioMightConnector = new BioMightConnector(startPoints, Constants.FootEpitheliumRef,\"connType\");\r\n\t\tbioMightConnectors.setBioMightConnector(Constants.FootEpitheliumRef, bioMightConnector);\r\n\t\r\n\t\t// Associate the connector on the Box\r\n\t\tbioBoundBox.setBioMightConnectors(bioMightConnectors);\r\n\t\t\r\n\t\t// Put the Bounding Box in the collection\r\n\t\tbioBoundBoxes.setBoundingBox(Constants.RightFootRef, bioBoundBox);\r\n\t\r\n\t\t// return the collection that holds both foot bound boxes\r\n\t\treturn (bioBoundBoxes);\r\n\t}","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","boolean hasType();","protected boolean checkFormat() {\n\t\t// Read the card contents and check that all is ok.\n\t byte[] memory = utils.readMemory();\n\t if (memory == null)\n\t return false;\n\t \n\t // Check the application tag.\n\t for (int i = 1; i < 4; i++)\n\t if (memory[4 * 4 + i] != applicationTag[i])\n\t return false;\n\t \n\t // Check zeros. Ignore page 36 and up because of the safe mode.\n\t for (int i = 5 * 4; i < 36 * 4; i++)\n\t if (memory[i] != 0)\n\t return false;\n\t \n\t // Check that the memory pages 4..39 are not locked.\n\t // Lock 0: Check lock status for pages 4-7\n\t if (memory[2 * 4 + 2] != 0) \n\t return false;\n\t // Lock 1: \n\t if (memory[2 * 4 + 3] != 0)\n\t return false;\n\t // Lock 2:\n\t if (memory[40 * 4] != 0)\n\t \t\treturn false;\n\t // Lock 1:\n\t if (memory[40 * 4 + 1] != 0)\n\t \t\treturn false;\n\t \n\t return true;\n\t}","private boolean validate(MessageType mt) {\n if (mt.getDesignation() == null) {\n DialogUtility\n .showMessageBox(this.shell, SWT.ICON_ERROR | SWT.OK,\n \"Message Type - Designation\",\n \"Designation is a required field. Please select a Designation.\");\n return false;\n }\n\n /*\n * verify that an afos id has been set.\n */\n if (mt.getAfosid() == null || mt.getAfosid().isEmpty()) {\n DialogUtility\n .showMessageBox(this.shell, SWT.ICON_ERROR | SWT.OK,\n \"Message Type - Message Type\",\n \"Message Type is a required field. Please enter a Message Type.\");\n return false;\n }\n\n /*\n * verify that a title has been set.\n */\n if (mt.getTitle() == null || mt.getTitle().isEmpty()) {\n DialogUtility.showMessageBox(this.shell, SWT.ICON_ERROR | SWT.OK,\n \"Message Type - Title\",\n \"Title is a required field. Please enter a Title.\");\n return false;\n }\n\n /*\n * verify that the afos id is unique.\n */\n try {\n MessageType existingMessageType = this.mtdm.getMessageType(mt\n .getAfosid());\n if (existingMessageType != null) {\n DialogUtility\n .showMessageBox(\n this.shell,\n SWT.ICON_ERROR | SWT.OK,\n \"Message Type - Message Type\",\n \"Message Type \"\n + mt.getAfosid()\n + \" already exists. Please enter a unique Message Type.\");\n return false;\n }\n } catch (Exception e) {\n statusHandler.error(\n \"Failed to determine if Message Type \" + mt.getAfosid()\n + \" is unique.\", e);\n return false;\n }\n\n return true;\n }","private boolean checkEditContent()\n {\n if (etUrl.hasContent() && etFilePath.hasContent())\n {\n return true;\n }\n return false;\n }","public void addBox()\n {\n if(Student.sittingRia==false) {\n box = new BoxRia(\"chalkboard.png\",4,2);\n addObject(box,box.myRow,box.mySeat);\n chalk = new BoxRia(\"chalk.png\",0,0);\n addObject(chalk,2,3);\n }\n }","private boolean isValid (DocFile file) {\n return file != null && Arrays.asList(Constants.VALIDDOCTYPES).contains(file.getFileType());\n }","boolean isSupportedType(String type) {\n // No bigBed support yet (but it's coming).\n if (type.startsWith(\"bigBed\")) {\n return false;\n }\n \n // No bigWig support yet (but it's coming).\n if (type.startsWith(\"bigWig\")) {\n return false;\n }\n \n // Actual data is contained in an external file, but the file is identified by a number, not a path.\n if (type.startsWith(\"wigMaf\")) {\n return false;\n }\n \n // We can probably the support BAM, but not implemented yet.\n if (type.equals(\"bam\")) {\n return false;\n }\n \n // Not one of our rejected types.\n return true;\n }","private void validateAttachedDocumentTypes(Noc noc, Object mdmsData) {\n\t\tMap<String, List<String>> masterData = mdmsValidator.getAttributeValues(mdmsData);\n\t\tList<Document> documents = noc.getDocuments();\n\n\t\tString filterExp = \"$.[?(@.applicationType=='\" + noc.getApplicationType() + \"' && @.nocType=='\" + noc.getNocType() + \"')].docTypes\";\n\n\t\tList<Object> docTypes = JsonPath.read(masterData.get(NOCConstants.NOC_DOC_TYPE_MAPPING), filterExp);\n\n\t\tif (CollectionUtils.isEmpty(docTypes)) {\n\t\t\tthrow new CustomException(\"MDMS_DATA_ERROR\", \"Unable to fetch noc document mapping\");\n\t\t}\n\n\t\tList<String> docTypeMappings = JsonPath.read(docTypes, \"$..documentType\");\n\n\t\tfilterExp = \"$.[?(@.active==true)].code\";\n\t\tList<String> validDocumentTypes = JsonPath.read(masterData.get(NOCConstants.DOCUMENT_TYPE), filterExp);\n\n\t\tif (!CollectionUtils.isEmpty(documents)) {\n\t\t\tList<String> addedDocTypes = new ArrayList<String>();\n\t\t\tdocuments.forEach(document -> {\n\t\t\t\tif (StringUtils.isEmpty(document.getFileStoreId())) {\n\t\t\t\t\tthrow new CustomException(\"NOC_FILE_EMPTY\", \"Filestore id is empty\");\n\t\t\t\t}\n\t\t\t\tif (!validDocumentTypes.contains(document.getDocumentType())) {\n\t\t\t\t\tthrow new CustomException(\"NOC_UNKNOWN_DOCUMENTTYPE\", document.getDocumentType() + \" is Unkown\");\n\t\t\t\t}\n\t\t\t\tString docType = document.getDocumentType();\n\t\t\t\tint lastIndex = docType.lastIndexOf(\".\");\n\t\t\t\tString documentNs = \"\";\n\t\t\t\tif (lastIndex > 1) {\n\t\t\t\t\tdocumentNs = docType.substring(0, lastIndex);\n\t\t\t\t} else if (lastIndex == 1) {\n\t\t\t\t\tthrow new CustomException(\"NOC_INVALID_DOCUMENTTYPE\", document.getDocumentType() + \" is Invalid\");\n\t\t\t\t} else {\n\t\t\t\t\tdocumentNs = docType;\n\t\t\t\t}\n\t\t\t\taddedDocTypes.add(documentNs);\n\t\t\t});\n\t\t\taddedDocTypes.forEach(documentType -> {\n\t\t\t\tif (!docTypeMappings.contains(documentType)) {\n\t\t\t\t\tthrow new CustomException(\"NOC_INVALID_DOCUMENTTYPE\", \"Document Type \" + documentType + \" is invalid for \" + noc.getNocType() + \" application\");\n\t\t\t\t}\n\t\t\t});\n\t\t}\n\t}","public boolean checkEntryInputs() {\n\t\tboolean isValid = true;\n\t\tif(sampleNumberTF.getText().equals(\"\")) {\n\t\t\tisValid = false;\n\t\t}\n\t\t\n\t\tif(materialDescriptionTF.getText().equals(\"\")) {\n\t\t\tisValid = false;\n\t\t}\n\t\t\n\t\tif(Double.valueOf(bacteroidesConcentrationTF.getText())==null) {\n\t\t\tisValid = false;\n\t\t}\n\t\treturn isValid;\n\t}","public boolean isDefault() {\r\n\treturn bgclip == border;\r\n }","ShipmentBoxType createShipmentBoxType();","@Test\n void checkButtons() throws FileNotFoundException {\n assertEquals(defaultMode.getText(), \"Candy Mode\");\n assertEquals(darkMode.getText(), \"Dark Mode\");\n assertEquals(rainbowMode.getText(), \"Rainbow Mode\");\n assertEquals(greenMode.getText(), \"Green Mode\");\n assertEquals(waveMode.getText(), \"Wave Mode\");\n }","public static void main(String[] args){\n Box[] boxes = {new Box1(),new Box2(), new Box3(),new Box4(),new Box5() };\n int length =15;\n int width =20;\n int height =25;\n for (Box box:boxes\n ) {if(box.validate(length,width,height)){\n System.out.println(box.name );\n break;\n }\n\n }\n\n\n\n\n /*Scanner scan = new Scanner(System.in);\n System.out.println(\"Please enter a number:\");\n int length = Integer.parseInt(scan.next());\n System.out.println(\"Please enter a number:\");\n int width = Integer.parseInt(scan.next());\n System.out.println(\"Please enter a number:\");\n int height = Integer.parseInt(scan.next());\n System.out.println(\"length: \" + length + \", width: \" + width + \", height: \" + height);\n if (box3.validate(length, width, height)) {\n System.out.println(box3.getName());\n }*/\n\n\n }","public void verify() {\n lblSourcePackageFolder();\n lblClasspath();\n btAddJARFolder();\n btRemove();\n lblOutputFolderOrJAR();\n txtOutputFolder();\n btBrowse();\n lstClasspath();\n cboSourcePackageFolder();\n btMoveUp();\n btMoveDown();\n lblOnlineError();\n }","public boolean hasALLOWMISCINVCREATION() {\n return fieldSetFlags()[9];\n }","boolean isDefault();","boolean isDefault();","private void setBox(){\n\t\tif((this.row >= 0 && this.row <= 2) && \n\t\t (this.column >= 0 && this.column <= 2)){\n\t\t\t\t\tthis.box = 1;\n\t\t\t\t\treturn;\n\t\t}\n\t\tif((this.row >= 0 && this.row <= 2) && \n\t\t (this.column >= 3 && this.column <= 5)){\n\t\t\t\t\tthis.box = 2;\n\t\t\t\t\treturn;\n\t\t}\n\t\tif((this.row >= 0 && this.row <= 2) && \n\t\t (this.column >= 6 && this.column <= 8)){\n\t\t\t\t\tthis.box = 3;\n\t\t\t\t\treturn;\n\t\t}\n\t\tif((this.row >= 3 && this.row <= 5) && \n\t\t (this.column >= 0 && this.column <= 2)){\n\t\t\t\t\tthis.box = 4;\n\t\t\t\t\treturn;\n\t\t}\n\t\tif((this.row >= 3 && this.row <= 5) && \n\t\t (this.column >= 3 && this.column <= 5)){\n\t\t\t\t\tthis.box = 5;\n\t\t\t\t\treturn;\n\t\t}\n\t\tif((this.row >= 3 && this.row <= 5) && \n\t\t (this.column >= 6 && this.column <= 8)){\n\t\t\t\t\tthis.box = 6;\n\t\t\t\t\treturn;\n\t\t}\n\t\tif((this.row >= 6 && this.row <= 8) && \n\t\t (this.column >= 0 && this.column <= 2)){\n\t\t\t\t\tthis.box = 7;\n\t\t\t\t\treturn;\n\t\t}\n\t\tif((this.row >= 6 && this.row <= 8) && \n\t\t (this.column >= 3 && this.column <= 5)){\n\t\t\t\t\tthis.box = 8;\n\t\t\t\t\treturn;\n\t\t}\n\t\tif((this.row >= 6 && this.row <= 8) && \n\t\t (this.column >= 6 && this.column <= 8)){\n\t\t\t\t\tthis.box = 9;\n\t\t\t\t\treturn;\n\t\t}\n\t}","public boolean hasEditor()\n\t{\n\t\treturn true;\n\t}","boolean isSetPowerBox();","boolean isSetControlType();","private boolean isBlockAvailable(BlockShape shape) {\n boolean result = false;\n\n for (BlockColor color : map_color_to_id.keySet()) {\n if (objBlockFactory.IsBlocktypeAvailable(shape, color)){\n result = true;\n break;\n }\n }\n return result;\n }"],"string":"[\n \"public ArrayList<Object> defaultBoxTypes(){\\n\\t\\t//ColourPrintOptions Properties\\n\\t\\t//All colour option types available in the ColourPrintOption enum\\n\\t\\tint[] colour = new int[]{ColourPrintOption.NoColour.getColOpt(), \\n\\t\\t\\t\\tColourPrintOption.OneColour.getColOpt(),ColourPrintOption.TwoColour.getColOpt()};\\n\\t\\t\\n\\t\\t//All colour option percentage cost available in the ColourPrintOption enum\\n\\t\\tdouble[] colPerc = new double[]{ColourPrintOption.NoColour.getPercentage(), \\n\\t\\t\\t\\tColourPrintOption.OneColour.getPercentage(),ColourPrintOption.TwoColour.getPercentage()};\\n\\t\\t\\n\\t\\tArrayList<BoxType> boxes = new ArrayList<BoxType>();\\t\\t\\n\\t\\t//Hardcoded initial box type values\\t\\t\\n\\t\\t//Box Type | Grade | ColourPrintOption | ColourPrintOption% | ReinBottom | ReinfCorn | Reinf% | IsActive\\n\\t\\tboxes.add(new BoxType(\\\"1\\\",\\\"1\\\", colour[0], colPerc[0], false, false, 0.00, true));\\n\\t\\tboxes.add(new BoxType(\\\"1\\\",\\\"2\\\", colour[0], colPerc[0], false, false, 0.00, true));\\n\\t\\tboxes.add(new BoxType(\\\"1\\\",\\\"3\\\", colour[0], colPerc[0], false, false, 0.00, true));\\n\\t\\tboxes.add(new BoxType(\\\"2\\\",\\\"2\\\", colour[1], colPerc[1], false, false, 12.00, true));\\n\\t\\tboxes.add(new BoxType(\\\"2\\\",\\\"3\\\", colour[1], colPerc[1], false, false, 12.00, true));\\n\\t\\tboxes.add(new BoxType(\\\"2\\\",\\\"4\\\", colour[1], colPerc[1], false, false, 12.00, true));\\n\\t\\tboxes.add(new BoxType(\\\"3\\\",\\\"2\\\",colour[2], colPerc[2], false, false, 15.00, true));\\n\\t\\tboxes.add(new BoxType(\\\"3\\\",\\\"3\\\",colour[2], colPerc[2], false, false, 15.00, true));\\n\\t\\tboxes.add(new BoxType(\\\"3\\\",\\\"4\\\",colour[2], colPerc[2], false, false, 15.00, true));\\n\\t\\tboxes.add(new BoxType(\\\"3\\\",\\\"5\\\",colour[2], colPerc[2], false, false, 15.00, true));\\n\\t\\tboxes.add(new BoxType(\\\"4\\\",\\\"2\\\", colour[2], colPerc[2], true, false, 15.00, true));\\n\\t\\tboxes.add(new BoxType(\\\"4\\\",\\\"3\\\", colour[2], colPerc[2], true, false, 15.00, true));\\n\\t\\tboxes.add(new BoxType(\\\"4\\\",\\\"4\\\", colour[2], colPerc[2], true, false, 15.00, true));\\n\\t\\tboxes.add(new BoxType(\\\"4\\\",\\\"5\\\", colour[2], colPerc[2], true, false, 15.00, true));\\n\\t\\tboxes.add(new BoxType(\\\"5\\\",\\\"3\\\", colour[2], colPerc[2], true, true, 25.00, true));\\n\\t\\tboxes.add(new BoxType(\\\"5\\\",\\\"4\\\", colour[2], colPerc[2], true, true, 25.00, true));\\n\\t\\tboxes.add(new BoxType(\\\"5\\\",\\\"5\\\", colour[2], colPerc[2], true, true, 25.00, true));\\n\\t\\t\\n\\t\\tArrayList<Object> btList = new ArrayList<Object>();\\n\\t\\t\\n\\t\\tfor(int i=0; i < boxes.size(); i++){\\n\\t\\t\\tbtList.add(boxes.get(i).getBoxType() +\\\",\\\" + boxes.get(i).getCardGrade() \\n\\t\\t\\t\\t\\t+\\\",\\\" + boxes.get(i).getColourOption() + \\\",\\\" + boxes.get(i).getColourOptionPercentage()\\n\\t\\t\\t\\t\\t+ \\\",\\\" + boxes.get(i).isReinfBottom() + \\\",\\\" + boxes.get(i).isReinfCorn() + \\\",\\\" \\n\\t\\t\\t\\t\\t+ boxes.get(i).getReinfPercentage() + \\\",\\\" + boxes.get(i).isActive + \\\", \\\\n\\\");\\t\\n\\t\\t}\\n\\t\\treturn btList;\\n\\t}\",\n \"@Override\\n\\tpublic boolean checkTypes() {\\n\\t\\treturn false;\\n\\t}\",\n \"private void checkAndInsertDefaultEntries() {\\n\\t\\tinsertDefaultMediaFormats();\\n\\t}\",\n \"boolean isSetBox();\",\n \"public void verify() {\\n lblPaletteContent();\\n treePaletteContentsTree();\\n lblJLabel();\\n btMoveUp();\\n btMoveDown();\\n btRemove();\\n btNewCategory();\\n btAddFromJAR();\\n btAddFromLibrary();\\n btAddFromProject();\\n btResetPalette();\\n btClose();\\n }\",\n \"private void checkChanges() {\\n CertificationStyleWrapper wrapper = (CertificationStyleWrapper) cbCertificationStyle.getSelectedItem();\\n if (wrapper != null && settings.getCertificationStyle() != wrapper.style) {\\n settings.setCertificationStyle(wrapper.style);\\n }\\n\\n // set NFO filenames\\n settings.clearNfoFilenames();\\n if (chckbxTvShowNfo1.isSelected()) {\\n settings.addNfoFilename(TvShowNfoNaming.TV_SHOW);\\n }\\n\\n settings.clearEpisodeNfoFilenames();\\n if (chckbxEpisodeNfo1.isSelected()) {\\n settings.addEpisodeNfoFilename(TvShowEpisodeNfoNaming.FILENAME);\\n }\\n }\",\n \"public boolean loadMessageBox(){\\n boolean isMessagebox = true;\\n byte tempType = CustomCanvas.msgType;\\n CustomCanvas.msgType = -1;\\n \\n if(tempType == 0){\\n tempType = 1;\\n } else if(tempType == 20) {\\n tempType = 16;\\n }\\n if (tempType == 1 || tempType == 2 || tempType == 3 || tempType == 16) {\\n isMessagebox = false;\\n }\\n handleSmartPopup(tempType);\\n return isMessagebox;\\n }\",\n \"private boolean checkFields() {\\n if (editTxtName.getText().equals(\\\"\\\")) return false;//name\\n if (editTxtDesc.getText().equals(\\\"\\\")) return false;//desc\\n if (editClrColor.getValue() == null) return false;//color\\n if (oldEnvironment == null) return false;//environment is null\\n return true;//everything is valid\\n }\",\n \"boolean isSetKeyBox();\",\n \"public void check()\\n {\\n typeDec.check();\\n }\",\n \"private static void types() {\\n\\t\\ttry {\\n\\t\\t\\tScanner handicaps = new Scanner(new FileInputStream(\\\"handicaps.txt\\\"));\\n\\t\\t\\tSystem.out.println(\\\"\\\\nAvailable Boat Types\\\");\\n\\t\\t\\tSystem.out.println(\\\"--------------------\\\");\\n\\t\\t\\twhile(handicaps.hasNextLine()) {\\n\\t\\t\\t\\tSystem.out.println(handicaps.nextLine().split(\\\":\\\")[0]);\\n\\t\\t\\t}\\n\\t\\t\\tSystem.out.println(\\\"\\\");\\n\\t\\t\\thandicaps.close();\\n\\t\\t} catch (FileNotFoundException e) {\\n\\t\\t\\tSystem.err.println(\\\"\\\\n\\\\nSEVERE ERROR: CRUCIAL FILE HANDICAPS.TXT NOT FOUND\\\\n\\\\n\\\");\\n\\t\\t\\tSystem.err.println(\\\"Attempting to re-create file....\\\");\\n\\t\\t\\tgenerateHandicaps();\\n\\t\\t\\tSystem.err.println(\\\"Success!\\\\nTry command again.\\\\n\\\");\\n\\t\\t}\\n\\n\\t}\",\n \"boolean isImageType();\",\n \"@Override\\r\\n\\tprotected void isBodyValid() {\\r\\n\\t\\tif( withinButton.isSelected() \\r\\n\\t\\t\\t\\t&& withinField.getText().equals(\\\"\\\")){\\r\\n//\\t\\t\\tinformation.setText(\\\"When --within is selected you must specify a file.\\\");\\r\\n\\t\\t\\tvalidBody = false;\\r\\n\\t\\t}\\r\\n\\t\\telse \\r\\n\\t\\t\\tvalidBody = true;\\r\\n\\t\\t\\r\\n\\t\\tokForm();\\r\\n\\r\\n\\t}\",\n \"void check()\\n {\\n checkUsedType(responseType);\\n checkUsedType(requestType);\\n }\",\n \"private void checkValid() {\\n getSimType();\\n getInitialConfig();\\n getIsOutlined();\\n getEdgePolicy();\\n getNeighborPolicy();\\n getCellShape();\\n }\",\n \"private boolean canSelectCurWorldType() {\\n WorldType worldtype = WorldType.WORLD_TYPES[this.selectedIndex];\\n if (worldtype != null && worldtype.canBeCreated()) {\\n return worldtype == WorldType.DEBUG_ALL_BLOCK_STATES ? hasShiftDown() : true;\\n } else {\\n return false;\\n }\\n }\",\n \"private boolean validate(){\\n return EditorUtils.editTextValidator(generalnformation,etGeneralnformation,\\\"Type in information\\\") &&\\n EditorUtils.editTextValidator(symptoms,etSymptoms, \\\"Type in symptoms\\\") &&\\n EditorUtils.editTextValidator(management,etManagement, \\\"Type in management\\\");\\n }\",\n \"@Override\\n public Set<String> validTypes() {\\n return factory.validTypes();\\n }\",\n \"private boolean checkDefaultValueAgainstQuestionType(){\\n\\t\\t\\n\\t\\tString defaultValue = txtDefaultValue.getText();\\n\\t\\tQuestionDef questionDef = (QuestionDef) propertiesObj;\\n\\t\\t\\n\\t\\tif(questionDef.getDataType() == QuestionDef.QTN_TYPE_NUMERIC && \\n\\t\\t\\t\\t!PropertiesViewHelper.isDefaultValueNumeric(defaultValue)){\\n\\t\\t\\t\\n\\t\\t\\ttxtDefaultValue.setText(\\\"\\\");\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t\\telse if(questionDef.getDataType() == QuestionDef.QTN_TYPE_DECIMAL &&\\n\\t\\t\\t\\t!PropertiesViewHelper.isDefaultValueDecimal(defaultValue)){\\n\\t\\t\\ttxtDefaultValue.setText(\\\"\\\");\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t\\telse if(questionDef.getDataType() == QuestionDef.QTN_TYPE_BOOLEAN &&\\n\\t\\t\\t\\t!PropertiesViewHelper.isDefaultValueBoolean(defaultValue)){\\t\\t\\t\\n\\t\\t\\ttxtDefaultValue.setText(\\\"\\\");\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t\\treturn true;\\n\\t}\",\n \"@Test\\n public void require_that_types_are_not_checked() throws IOException {\\n Slime slime = new Slime();\\n Cursor root = slime.setObject();\\n root.setString(\\\"enumval\\\", \\\"null\\\");\\n root.setString(\\\"intval\\\", \\\"null\\\");\\n root.setString(\\\"longval\\\", \\\"null\\\");\\n root.setString(\\\"boolval\\\", \\\"null\\\");\\n root.setString(\\\"doubleval\\\", \\\"null\\\");\\n InnerCNode def = new DefParser(\\\"simpletypes\\\", new StringReader(StringUtilities.implode(SimpletypesConfig.CONFIG_DEF_SCHEMA, \\\"\\\\n\\\"))).getTree();\\n ByteArrayOutputStream baos = new ByteArrayOutputStream();\\n new ConfigFileFormat(def).encode(baos, slime);\\n assertThat(baos.toString(StandardCharsets.UTF_8), is(\\\"enumval null\\\\nintval null\\\\nlongval null\\\\nboolval false\\\\ndoubleval null\\\\n\\\"));\\n }\",\n \"boolean hasPlaceholderType();\",\n \"@Test\\n public void getType() {\\n\\n // Defaulted1 is Rec then we mutates.\\n assertEquals(TypeOfShape.RECTANGLE, defaultShape1.getType());\\n assertNotEquals(TypeOfShape.OVAL, defaultShape1.getType());\\n defaultShape1 = new Oval(defaultColor1, defaultPosition1, defaultSize1);\\n assertEquals(TypeOfShape.OVAL, defaultShape1.getType());\\n assertNotEquals(TypeOfShape.RECTANGLE, defaultShape1.getType());\\n // Default2 is oval then we mutates.\\n assertEquals(TypeOfShape.OVAL, defaultShape2.getType());\\n assertNotEquals(TypeOfShape.RECTANGLE, defaultShape2.getType());\\n defaultShape2 = new Rectangle(defaultColor2, defaultPosition2, defaultSize2);\\n assertEquals(TypeOfShape.RECTANGLE, defaultShape2.getType());\\n assertNotEquals(TypeOfShape.OVAL, defaultShape2.getType());\\n }\",\n \"public boolean isSetFileType()\\n {\\n synchronized (monitor())\\n {\\n check_orphaned();\\n return get_store().count_elements(FILETYPE$8) != 0;\\n }\\n }\",\n \"boolean getBox();\",\n \"public static boolean processDefaults() {\\r\\n\\t\\tboolean done = false;\\r\\n\\t\\tint winScore = stringToInt(IniSetup.winScore.getText());\\r\\n\\t\\tint loseScore = stringToInt(IniSetup.loseScore.getText());\\r\\n\\t\\tFile file = new File(Main.soundDir);\\r\\n\\t\\t\\r\\n\\t\\t//Check winning score value.\\r\\n\\t\\tif (winScore >= 100) {\\r\\n\\t\\t\\t//Check loosing score value.\\r\\n\\t\\t\\tif (loseScore < 0) {\\r\\n\\t\\t\\t\\t//Check if the input for sounds is a directory.\\r\\n\\t\\t\\t\\tif (file.isDirectory()) {\\r\\n\\t\\t\\t\\t\\tdone = true;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\t//Show dialog box reminder.\\r\\n\\t\\tif (!done) FrameUtils.showDialogBox(\\\"Check your inputs.\\\");\\r\\n\\t\\t\\r\\n\\t\\t//Save the default options.\\r\\n\\t\\tsaveDefaultOptions();\\r\\n\\t\\t\\r\\n\\t\\t//Create the defaults array list.\\r\\n\\t\\tcreateDefaultsArrList();\\r\\n\\r\\n\\t\\treturn done;\\r\\n\\t}\",\n \"public boolean isSetTypes() {\\n return this.types != null;\\n }\",\n \"private boolean CheckCallDefinitions()\\n {\\n if(apiCallDefinitions==null || apiCallDefinitions.size()==0)\\n return false;\\n\\n if(defaultAPIVersionPath==null)\\n return false;\\n\\n return true;\\n }\",\n \"private void checkStructure() {\\n for (DatabaseUpdateType updateType : DatabaseUpdateType.values()) {\\n checkDatabaseStructure(updateType);\\n }\\n }\",\n \"private boolean checkFields() {\\n boolean test = true;\\n if (fname.isEmpty()) {\\n test = false;\\n }\\n if (lname.isEmpty()) {\\n test = false;\\n }\\n if (cin.isEmpty()) {\\n test = false;\\n }\\n if (typeCompte.equals(\\\"Bancaire\\\")) {\\n if (decouvertNF.isEmpty())\\n test = false;\\n } else if (typeCompte.equals(\\\"Epargne\\\")) {\\n if (tauxInteretNF.isEmpty())\\n test = false;\\n }\\n if (s_datePK.getValue() == null) {\\n s_datePK.setStyle(\\\"-fx-border-color:red;-fx-border-radius:3px;-fx-border-size: 1px;\\\");\\n test = false;\\n }\\n\\n return test;\\n }\",\n \"public boolean initTypes() throws RepositoryAccessException {\\r\\n // XXX Magic String\\r\\n File sqlFile = new File(m_sqlDirectory, \\\"types.sql\\\");\\r\\n if (!sqlFile.exists() || !sqlFile.canRead() || !sqlFile.isFile())\\r\\n return false;\\r\\n \\r\\n return executeScriptAndProbe(sqlFile, true);\\r\\n }\",\n \"public boolean isSetFileType() {\\n return this.fileType != null;\\n }\",\n \"boolean hasDocumentType();\",\n \"public boolean isSetGearboxtypestring() {\\n return this.gearboxtypestring != null;\\n }\",\n \"private boolean emptyBoxes() {\\n return (FirstName.getText().toString().isEmpty() || LastName.getText().toString().isEmpty() ||\\n ID.getText().toString().isEmpty() || PhoneNumber.getText().toString().isEmpty() ||\\n EmailAddress.getText().toString().isEmpty() || CreditCard.getText().toString().isEmpty() ||\\n Password.getText().toString().isEmpty());\\n }\",\n \"public boolean isSetGearboxtype() {\\n return __isset_bit_vector.get(__GEARBOXTYPE_ISSET_ID);\\n }\",\n \"public boolean isUnknownType() {\\n switch (type) {\\n case ICNS.ICON:\\n case ICNS.ICN_:\\n case ICNS.icm_:\\n case ICNS.ics_:\\n case ICNS.ich_:\\n case ICNS.icm4:\\n case ICNS.ics4:\\n case ICNS.icl4:\\n case ICNS.ich4:\\n case ICNS.icm8:\\n case ICNS.ics8:\\n case ICNS.icl8:\\n case ICNS.ich8:\\n case ICNS.s8mk:\\n case ICNS.l8mk:\\n case ICNS.h8mk:\\n case ICNS.t8mk:\\n case ICNS.is32:\\n case ICNS.il32:\\n case ICNS.ih32:\\n case ICNS.it32:\\n case ICNS.ic08:\\n case ICNS.ic09:\\n case ICNS.ic10:\\n return false;\\n }\\n\\n return true;\\n }\",\n \"private BioMightBoundBoxes setupDefaultBoundBoxes() \\r\\n\\t{\\r\\n\\t\\t// Set up the collection to hold the Bounding Boxes\\r\\n\\t\\tBioMightBoundBoxes bioBoundBoxes = null;\\r\\n\\t\\r\\n\\t\\t// Initialize the position of the bounding box vars\\r\\n\\t\\tBigDecimal xPos = new BigDecimal(0.0);\\r\\n\\t\\tBigDecimal yPos = new BigDecimal(0.0);\\r\\n\\t\\tBigDecimal zPos= new BigDecimal(0.0);\\r\\n\\t\\t\\r\\n\\t\\t// Set to base 1x1x1 cube\\r\\n\\t\\tBigDecimal xVector= new BigDecimal(1.0);\\r\\n\\t\\tBigDecimal yVector= new BigDecimal(1.0); \\r\\n\\t\\tBigDecimal zVector= new BigDecimal(1.0);\\r\\n\\t\\r\\n\\t\\t// Initialize a BoundBox\\r\\n\\t\\tBioMightBoundBox bioBoundBox = null;\\r\\n\\t\\r\\n\\t\\t// Initialize Connectors \\r\\n\\t\\tBioMightConnectors bioMightConnectors = null; \\r\\n\\r\\n\\t\\t// Initialize a Connector \\r\\n\\t\\tBioMightConnector bioMightConnector= null;\\r\\n\\t\\r\\n\\t\\tdouble circumference = 0.0;\\r\\n\\t\\tdouble[] startPos = {0.0, 0.0, 0.0};\\r\\n\\t\\tdouble[][] startPoints = null;\\r\\n\\t\\r\\n\\t\\t//********************************************************************* \\r\\n\\t\\t// LEFT FOOT BOUNDBOX\\r\\n\\t\\t// Set up the Bounding Box for the Feet\\r\\n\\t\\t// The connector for this will come from the incoming Bound Box\\r\\n\\t\\t// Both are defined like and bolt and they lock into position at the\\r\\n\\t\\t// interestion of both connectors\\r\\n\\t\\t//**********************************************************************\\r\\n\\t\\txPos = new BigDecimal(0.0);\\r\\n\\t\\tyPos = new BigDecimal(-65.0);\\r\\n\\t\\tzPos= new BigDecimal(3.0);\\r\\n\\t\\r\\n\\t\\txVector= new BigDecimal(1.0);\\r\\n\\t\\tyVector= new BigDecimal(4.0); \\r\\n\\t\\tzVector= new BigDecimal(1.0);\\r\\n\\r\\n\\t\\tbioBoundBox = new BioMightBoundBox(xPos, yPos, zPos, xVector, yVector, zVector);\\r\\n\\t\\tbioMightConnectors = new BioMightConnectors();\\r\\n\\t\\r\\n\\t\\t// Feet Epithelium Connector\\r\\n\\t\\tcircumference = 0.3;\\r\\n\\t\\tstartPos = getStartPoints(-2.0, -65.0, -1.0);\\r\\n\\t\\tstartPoints = BioGraphics.octogonYPlane(startPos, circumference);\\r\\n\\t\\tbioMightConnector = new BioMightConnector(startPoints, Constants.FootEpitheliumRef,\\\"connType\\\");\\r\\n\\t\\tbioMightConnectors.setBioMightConnector(Constants.FootEpitheliumRef, bioMightConnector);\\r\\n\\t\\t\\r\\n\\t\\t// Associate the connector on the Box\\r\\n\\t\\tbioBoundBox.setBioMightConnectors(bioMightConnectors);\\r\\n\\t\\t\\r\\n\\t\\t// Put the Bounding Box in the collection\\r\\n\\t\\tbioBoundBoxes.setBoundingBox(Constants.LeftFootRef, bioBoundBox);\\r\\n\\t\\r\\n\\t\\r\\n\\t\\t//********************************************************************* er\\r\\n\\t\\t// RIGHT CNEMES BOUNDBOX\\r\\n\\t\\t// Set up the Bounding Box for the Foot\\r\\n\\t\\t// On a porportioned human, the \\r\\n\\t\\t//**********************************************************************\\r\\n\\t\\txPos = new BigDecimal(0.0);\\r\\n\\t\\tyPos = new BigDecimal(-14.0);\\r\\n\\t\\tzPos= new BigDecimal(-3.0);\\r\\n\\t\\r\\n\\t\\txVector= new BigDecimal(1.0);\\r\\n\\t\\tyVector= new BigDecimal(4.0); \\r\\n\\t\\tzVector= new BigDecimal(1.0);\\r\\n\\r\\n\\t\\tbioBoundBox = new BioMightBoundBox(xPos, yPos, zPos, xVector, yVector, zVector);\\r\\n\\t\\tbioMightConnectors = new BioMightConnectors();\\r\\n\\t\\t\\r\\n\\t\\t// Foot Epithelium Connector\\r\\n\\t\\tcircumference = 0.3;\\r\\n\\t\\tstartPos = getStartPoints(2.0, -65.0, -1.0);\\r\\n\\t\\tstartPoints = BioGraphics.octogonYPlane(startPos, circumference);\\r\\n\\t\\tbioMightConnector = new BioMightConnector(startPoints, Constants.FootEpitheliumRef,\\\"connType\\\");\\r\\n\\t\\tbioMightConnectors.setBioMightConnector(Constants.FootEpitheliumRef, bioMightConnector);\\r\\n\\t\\r\\n\\t\\t// Associate the connector on the Box\\r\\n\\t\\tbioBoundBox.setBioMightConnectors(bioMightConnectors);\\r\\n\\t\\t\\r\\n\\t\\t// Put the Bounding Box in the collection\\r\\n\\t\\tbioBoundBoxes.setBoundingBox(Constants.RightFootRef, bioBoundBox);\\r\\n\\t\\r\\n\\t\\t// return the collection that holds both foot bound boxes\\r\\n\\t\\treturn (bioBoundBoxes);\\r\\n\\t}\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"boolean hasType();\",\n \"protected boolean checkFormat() {\\n\\t\\t// Read the card contents and check that all is ok.\\n\\t byte[] memory = utils.readMemory();\\n\\t if (memory == null)\\n\\t return false;\\n\\t \\n\\t // Check the application tag.\\n\\t for (int i = 1; i < 4; i++)\\n\\t if (memory[4 * 4 + i] != applicationTag[i])\\n\\t return false;\\n\\t \\n\\t // Check zeros. Ignore page 36 and up because of the safe mode.\\n\\t for (int i = 5 * 4; i < 36 * 4; i++)\\n\\t if (memory[i] != 0)\\n\\t return false;\\n\\t \\n\\t // Check that the memory pages 4..39 are not locked.\\n\\t // Lock 0: Check lock status for pages 4-7\\n\\t if (memory[2 * 4 + 2] != 0) \\n\\t return false;\\n\\t // Lock 1: \\n\\t if (memory[2 * 4 + 3] != 0)\\n\\t return false;\\n\\t // Lock 2:\\n\\t if (memory[40 * 4] != 0)\\n\\t \\t\\treturn false;\\n\\t // Lock 1:\\n\\t if (memory[40 * 4 + 1] != 0)\\n\\t \\t\\treturn false;\\n\\t \\n\\t return true;\\n\\t}\",\n \"private boolean validate(MessageType mt) {\\n if (mt.getDesignation() == null) {\\n DialogUtility\\n .showMessageBox(this.shell, SWT.ICON_ERROR | SWT.OK,\\n \\\"Message Type - Designation\\\",\\n \\\"Designation is a required field. Please select a Designation.\\\");\\n return false;\\n }\\n\\n /*\\n * verify that an afos id has been set.\\n */\\n if (mt.getAfosid() == null || mt.getAfosid().isEmpty()) {\\n DialogUtility\\n .showMessageBox(this.shell, SWT.ICON_ERROR | SWT.OK,\\n \\\"Message Type - Message Type\\\",\\n \\\"Message Type is a required field. Please enter a Message Type.\\\");\\n return false;\\n }\\n\\n /*\\n * verify that a title has been set.\\n */\\n if (mt.getTitle() == null || mt.getTitle().isEmpty()) {\\n DialogUtility.showMessageBox(this.shell, SWT.ICON_ERROR | SWT.OK,\\n \\\"Message Type - Title\\\",\\n \\\"Title is a required field. Please enter a Title.\\\");\\n return false;\\n }\\n\\n /*\\n * verify that the afos id is unique.\\n */\\n try {\\n MessageType existingMessageType = this.mtdm.getMessageType(mt\\n .getAfosid());\\n if (existingMessageType != null) {\\n DialogUtility\\n .showMessageBox(\\n this.shell,\\n SWT.ICON_ERROR | SWT.OK,\\n \\\"Message Type - Message Type\\\",\\n \\\"Message Type \\\"\\n + mt.getAfosid()\\n + \\\" already exists. Please enter a unique Message Type.\\\");\\n return false;\\n }\\n } catch (Exception e) {\\n statusHandler.error(\\n \\\"Failed to determine if Message Type \\\" + mt.getAfosid()\\n + \\\" is unique.\\\", e);\\n return false;\\n }\\n\\n return true;\\n }\",\n \"private boolean checkEditContent()\\n {\\n if (etUrl.hasContent() && etFilePath.hasContent())\\n {\\n return true;\\n }\\n return false;\\n }\",\n \"public void addBox()\\n {\\n if(Student.sittingRia==false) {\\n box = new BoxRia(\\\"chalkboard.png\\\",4,2);\\n addObject(box,box.myRow,box.mySeat);\\n chalk = new BoxRia(\\\"chalk.png\\\",0,0);\\n addObject(chalk,2,3);\\n }\\n }\",\n \"private boolean isValid (DocFile file) {\\n return file != null && Arrays.asList(Constants.VALIDDOCTYPES).contains(file.getFileType());\\n }\",\n \"boolean isSupportedType(String type) {\\n // No bigBed support yet (but it's coming).\\n if (type.startsWith(\\\"bigBed\\\")) {\\n return false;\\n }\\n \\n // No bigWig support yet (but it's coming).\\n if (type.startsWith(\\\"bigWig\\\")) {\\n return false;\\n }\\n \\n // Actual data is contained in an external file, but the file is identified by a number, not a path.\\n if (type.startsWith(\\\"wigMaf\\\")) {\\n return false;\\n }\\n \\n // We can probably the support BAM, but not implemented yet.\\n if (type.equals(\\\"bam\\\")) {\\n return false;\\n }\\n \\n // Not one of our rejected types.\\n return true;\\n }\",\n \"private void validateAttachedDocumentTypes(Noc noc, Object mdmsData) {\\n\\t\\tMap<String, List<String>> masterData = mdmsValidator.getAttributeValues(mdmsData);\\n\\t\\tList<Document> documents = noc.getDocuments();\\n\\n\\t\\tString filterExp = \\\"$.[?(@.applicationType=='\\\" + noc.getApplicationType() + \\\"' && @.nocType=='\\\" + noc.getNocType() + \\\"')].docTypes\\\";\\n\\n\\t\\tList<Object> docTypes = JsonPath.read(masterData.get(NOCConstants.NOC_DOC_TYPE_MAPPING), filterExp);\\n\\n\\t\\tif (CollectionUtils.isEmpty(docTypes)) {\\n\\t\\t\\tthrow new CustomException(\\\"MDMS_DATA_ERROR\\\", \\\"Unable to fetch noc document mapping\\\");\\n\\t\\t}\\n\\n\\t\\tList<String> docTypeMappings = JsonPath.read(docTypes, \\\"$..documentType\\\");\\n\\n\\t\\tfilterExp = \\\"$.[?(@.active==true)].code\\\";\\n\\t\\tList<String> validDocumentTypes = JsonPath.read(masterData.get(NOCConstants.DOCUMENT_TYPE), filterExp);\\n\\n\\t\\tif (!CollectionUtils.isEmpty(documents)) {\\n\\t\\t\\tList<String> addedDocTypes = new ArrayList<String>();\\n\\t\\t\\tdocuments.forEach(document -> {\\n\\t\\t\\t\\tif (StringUtils.isEmpty(document.getFileStoreId())) {\\n\\t\\t\\t\\t\\tthrow new CustomException(\\\"NOC_FILE_EMPTY\\\", \\\"Filestore id is empty\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (!validDocumentTypes.contains(document.getDocumentType())) {\\n\\t\\t\\t\\t\\tthrow new CustomException(\\\"NOC_UNKNOWN_DOCUMENTTYPE\\\", document.getDocumentType() + \\\" is Unkown\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tString docType = document.getDocumentType();\\n\\t\\t\\t\\tint lastIndex = docType.lastIndexOf(\\\".\\\");\\n\\t\\t\\t\\tString documentNs = \\\"\\\";\\n\\t\\t\\t\\tif (lastIndex > 1) {\\n\\t\\t\\t\\t\\tdocumentNs = docType.substring(0, lastIndex);\\n\\t\\t\\t\\t} else if (lastIndex == 1) {\\n\\t\\t\\t\\t\\tthrow new CustomException(\\\"NOC_INVALID_DOCUMENTTYPE\\\", document.getDocumentType() + \\\" is Invalid\\\");\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tdocumentNs = docType;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\taddedDocTypes.add(documentNs);\\n\\t\\t\\t});\\n\\t\\t\\taddedDocTypes.forEach(documentType -> {\\n\\t\\t\\t\\tif (!docTypeMappings.contains(documentType)) {\\n\\t\\t\\t\\t\\tthrow new CustomException(\\\"NOC_INVALID_DOCUMENTTYPE\\\", \\\"Document Type \\\" + documentType + \\\" is invalid for \\\" + noc.getNocType() + \\\" application\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t});\\n\\t\\t}\\n\\t}\",\n \"public boolean checkEntryInputs() {\\n\\t\\tboolean isValid = true;\\n\\t\\tif(sampleNumberTF.getText().equals(\\\"\\\")) {\\n\\t\\t\\tisValid = false;\\n\\t\\t}\\n\\t\\t\\n\\t\\tif(materialDescriptionTF.getText().equals(\\\"\\\")) {\\n\\t\\t\\tisValid = false;\\n\\t\\t}\\n\\t\\t\\n\\t\\tif(Double.valueOf(bacteroidesConcentrationTF.getText())==null) {\\n\\t\\t\\tisValid = false;\\n\\t\\t}\\n\\t\\treturn isValid;\\n\\t}\",\n \"public boolean isDefault() {\\r\\n\\treturn bgclip == border;\\r\\n }\",\n \"ShipmentBoxType createShipmentBoxType();\",\n \"@Test\\n void checkButtons() throws FileNotFoundException {\\n assertEquals(defaultMode.getText(), \\\"Candy Mode\\\");\\n assertEquals(darkMode.getText(), \\\"Dark Mode\\\");\\n assertEquals(rainbowMode.getText(), \\\"Rainbow Mode\\\");\\n assertEquals(greenMode.getText(), \\\"Green Mode\\\");\\n assertEquals(waveMode.getText(), \\\"Wave Mode\\\");\\n }\",\n \"public static void main(String[] args){\\n Box[] boxes = {new Box1(),new Box2(), new Box3(),new Box4(),new Box5() };\\n int length =15;\\n int width =20;\\n int height =25;\\n for (Box box:boxes\\n ) {if(box.validate(length,width,height)){\\n System.out.println(box.name );\\n break;\\n }\\n\\n }\\n\\n\\n\\n\\n /*Scanner scan = new Scanner(System.in);\\n System.out.println(\\\"Please enter a number:\\\");\\n int length = Integer.parseInt(scan.next());\\n System.out.println(\\\"Please enter a number:\\\");\\n int width = Integer.parseInt(scan.next());\\n System.out.println(\\\"Please enter a number:\\\");\\n int height = Integer.parseInt(scan.next());\\n System.out.println(\\\"length: \\\" + length + \\\", width: \\\" + width + \\\", height: \\\" + height);\\n if (box3.validate(length, width, height)) {\\n System.out.println(box3.getName());\\n }*/\\n\\n\\n }\",\n \"public void verify() {\\n lblSourcePackageFolder();\\n lblClasspath();\\n btAddJARFolder();\\n btRemove();\\n lblOutputFolderOrJAR();\\n txtOutputFolder();\\n btBrowse();\\n lstClasspath();\\n cboSourcePackageFolder();\\n btMoveUp();\\n btMoveDown();\\n lblOnlineError();\\n }\",\n \"public boolean hasALLOWMISCINVCREATION() {\\n return fieldSetFlags()[9];\\n }\",\n \"boolean isDefault();\",\n \"boolean isDefault();\",\n \"private void setBox(){\\n\\t\\tif((this.row >= 0 && this.row <= 2) && \\n\\t\\t (this.column >= 0 && this.column <= 2)){\\n\\t\\t\\t\\t\\tthis.box = 1;\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tif((this.row >= 0 && this.row <= 2) && \\n\\t\\t (this.column >= 3 && this.column <= 5)){\\n\\t\\t\\t\\t\\tthis.box = 2;\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tif((this.row >= 0 && this.row <= 2) && \\n\\t\\t (this.column >= 6 && this.column <= 8)){\\n\\t\\t\\t\\t\\tthis.box = 3;\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tif((this.row >= 3 && this.row <= 5) && \\n\\t\\t (this.column >= 0 && this.column <= 2)){\\n\\t\\t\\t\\t\\tthis.box = 4;\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tif((this.row >= 3 && this.row <= 5) && \\n\\t\\t (this.column >= 3 && this.column <= 5)){\\n\\t\\t\\t\\t\\tthis.box = 5;\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tif((this.row >= 3 && this.row <= 5) && \\n\\t\\t (this.column >= 6 && this.column <= 8)){\\n\\t\\t\\t\\t\\tthis.box = 6;\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tif((this.row >= 6 && this.row <= 8) && \\n\\t\\t (this.column >= 0 && this.column <= 2)){\\n\\t\\t\\t\\t\\tthis.box = 7;\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tif((this.row >= 6 && this.row <= 8) && \\n\\t\\t (this.column >= 3 && this.column <= 5)){\\n\\t\\t\\t\\t\\tthis.box = 8;\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tif((this.row >= 6 && this.row <= 8) && \\n\\t\\t (this.column >= 6 && this.column <= 8)){\\n\\t\\t\\t\\t\\tthis.box = 9;\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t}\\n\\t}\",\n \"public boolean hasEditor()\\n\\t{\\n\\t\\treturn true;\\n\\t}\",\n \"boolean isSetPowerBox();\",\n \"boolean isSetControlType();\",\n \"private boolean isBlockAvailable(BlockShape shape) {\\n boolean result = false;\\n\\n for (BlockColor color : map_color_to_id.keySet()) {\\n if (objBlockFactory.IsBlocktypeAvailable(shape, color)){\\n result = true;\\n break;\\n }\\n }\\n return result;\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.60501367","0.597637","0.59177387","0.58724725","0.5863238","0.57939917","0.5579411","0.5563745","0.5442224","0.54118294","0.5398252","0.53950495","0.53362054","0.52911526","0.5265303","0.5245692","0.52394575","0.5225614","0.52174866","0.521613","0.5214587","0.5194759","0.51721036","0.51710725","0.5150594","0.5150411","0.5125152","0.5106005","0.5105915","0.5100858","0.5100577","0.509328","0.50745755","0.507447","0.5071706","0.5039781","0.501454","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.5005461","0.49954334","0.4994556","0.4985406","0.49708185","0.49692708","0.49684268","0.49553832","0.49447012","0.49439457","0.49428114","0.49424005","0.49297696","0.4929572","0.49261957","0.49190828","0.49190828","0.49185333","0.49061343","0.48998266","0.48962268","0.48838294"],"string":"[\n \"0.60501367\",\n \"0.597637\",\n \"0.59177387\",\n \"0.58724725\",\n \"0.5863238\",\n \"0.57939917\",\n \"0.5579411\",\n \"0.5563745\",\n \"0.5442224\",\n \"0.54118294\",\n \"0.5398252\",\n \"0.53950495\",\n \"0.53362054\",\n \"0.52911526\",\n \"0.5265303\",\n \"0.5245692\",\n \"0.52394575\",\n \"0.5225614\",\n \"0.52174866\",\n \"0.521613\",\n \"0.5214587\",\n \"0.5194759\",\n \"0.51721036\",\n \"0.51710725\",\n \"0.5150594\",\n \"0.5150411\",\n \"0.5125152\",\n \"0.5106005\",\n \"0.5105915\",\n \"0.5100858\",\n \"0.5100577\",\n \"0.509328\",\n \"0.50745755\",\n \"0.507447\",\n \"0.5071706\",\n \"0.5039781\",\n \"0.501454\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.5005461\",\n \"0.49954334\",\n \"0.4994556\",\n \"0.4985406\",\n \"0.49708185\",\n \"0.49692708\",\n \"0.49684268\",\n \"0.49553832\",\n \"0.49447012\",\n \"0.49439457\",\n \"0.49428114\",\n \"0.49424005\",\n \"0.49297696\",\n \"0.4929572\",\n \"0.49261957\",\n \"0.49190828\",\n \"0.49190828\",\n \"0.49185333\",\n \"0.49061343\",\n \"0.48998266\",\n \"0.48962268\",\n \"0.48838294\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.65418077"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":38189,"cells":{"query":{"kind":"string","value":"This method will be used to calculate the volume of a box by the user specified dimensions"},"document":{"kind":"string","value":"public String calcSurfaceAreaOfBox(double length, double width, double height, double cost, int quantity){\n\t\tdouble surfaceArea = 2*(width * length) + 2*(length * height) + 2*(width * height);\n\t\tdouble computedCost = cost * surfaceArea;\n\t\tdouble totalCost = computedCost * quantity;\n\t\n\t\tDecimalFormat df = new DecimalFormat(\"##.##\");\n\t\treturn df.format(totalCost);\n\t}"},"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 static void main(String [] args){\n\r\n Box box1 = new Box(10.0, 20.0, 15.0);\r\n Box box2 = new Box();\r\n Box box3 = new Box(7);\r\n\r\n double vol = box1.Volume();\r\n System.out.println(\"The Volume of box1: \"+vol);\r\n\r\n vol = box2.Volume();\r\n System.out.println(\"The Volume of box2: \"+vol);\r\n\r\n vol = box3.Volume();\r\n System.out.println(\"The Volume of Cube: \"+vol);\r\n\r\n \r\n \r\n }","double volume(){\n\n return widgh*height*depth;\n\n }","public double calcVolume(){\n double area=calcArea(); // calcArea of superclass used\r\n return area*h;\r\n }","double volume(){\n return width*height*depth;\n }","public abstract double calcVolume();","public abstract double calcVolume();","double volume()\n\t{\n\t\t\n\t\treturn width*height*depth;\n\t\t\n\t}","double volume() {\n\treturn width*height*depth;\n}","private void calculateVolume() {\n\n\t\t/*\n\n\t\t */\n\t\tfor(int i=0; i<this._prismoidsLength.size(); i++) \n\t\t\tthis._prismoidsVolumes.add(\n\t\t\t\t\tAmount.valueOf(\n\t\t\t\t\t\t\tthis._prismoidsLength.get(i).divide(3)\n\t\t\t\t\t\t\t.times(\n\t\t\t\t\t\t\t\t\tthis._prismoidsSectionsAreas.get(i).getEstimatedValue()\n\t\t\t\t\t\t\t\t\t+ this._prismoidsSectionsAreas.get(i+1).getEstimatedValue()\n\t\t\t\t\t\t\t\t\t+ Math.sqrt(\n\t\t\t\t\t\t\t\t\t\t\tthis._prismoidsSectionsAreas.get(i)\n\t\t\t\t\t\t\t\t\t\t\t.times(this._prismoidsSectionsAreas.get(i+1))\n\t\t\t\t\t\t\t\t\t\t\t.getEstimatedValue()\n\t\t\t\t\t\t\t\t\t\t\t)\n\t\t\t\t\t\t\t\t\t).getEstimatedValue(),\n\t\t\t\t\t\t\tSI.CUBIC_METRE\n\t\t\t\t\t\t\t)\n\t\t\t\t\t);\n\t\t\n\t\tfor(int i=0; i<this._prismoidsVolumes.size(); i++)\n\t\t\tthis._fuelVolume = this._fuelVolume\n\t\t\t\t\t\t\t\t\t\t.plus(this._prismoidsVolumes.get(i));\n\t\tthis._fuelVolume = this._fuelVolume.times(2);\n\t\t\n\t}","public abstract double volume();","public int volume() {\r\n int xLength = this.getMaximumPoint().getBlockX() - this.getMinimumPoint().getBlockX() + 1;\r\n int yLength = this.getMaximumPoint().getBlockY() - this.getMinimumPoint().getBlockY() + 1;\r\n int zLength = this.getMaximumPoint().getBlockZ() - this.getMinimumPoint().getBlockZ() + 1;\r\n\r\n int volume = xLength * yLength * zLength;\r\n return volume;\r\n }","@Override\n\tpublic void calcularVolume() {\n\t\t\n\t}","public static void main(String args[]){\n\n Box mybox1 = new Box();\n Box mybox2 = new Box();\n\n double vol;\n\n // get volume of first box\n\n vol = mybox1.volume();\n System.out.println(\"Volume of box1 is \"+vol);\n\n // get volume of second box\n\n vol = mybox2.volume();\n System.out.println(\"Volume of box2 is \"+vol);\n }","public abstract float volume();","public int calculateVolume() {\n return (int) Math.pow(this.sideLength, 3) ;\n }","public double volume() {\n\t\treturn this.iWidth * this.iLength * this.iDepth\r\n\t}","public double volume()\r\n {\r\n double volume = Math.pow(radius, 2) * (height / 3) * Math.PI;\r\n return volume;\r\n }","@Override\n\tpublic double getvolume(){\n\t\tdouble[] ab_cross_ac = calculate_vcp(getVector_AB(),getVector_AC());\n\t\t\n\t\t//dot product of ab_cross_ac and ad\n\t\tdouble S = calculate_vdp(ab_cross_ac,getVector_AD());\n\t\t\n\t\t//formula of tetrahedron's volume\n\t\treturn Math.abs(S)/6;\t\n\t}","public void calcVolume() {\n this.vol = (0.6666666666666667 * Math.PI) * Math.pow(r, 3);\n }","public static void main(String[] args){\n BoxModify box1 = new BoxModify(20.0, 10.0, 15.0);\n BoxModify box2 = new BoxModify(box1);\n BoxModify box3 = new BoxModify(6.0);\n double volume, area;\n //double volume, area; \n // Get and display volume and surface area of box1\n volume = box1.volume();\n area = box1.surfaceArea();\n System.out.println(\"Box 1 is \" + box1);\n System.out.println(\"Box 2 is \"+box2);\n System.out.println(\"Box 3 is \"+box3);\n // Get and display volume of surface area box2\n System.out.println(\"\\nThe volume of box2 is \" + box2.volume() + \" cubic cm\");\n System.out.println(\"The surface area of box2 is \"+area+\" square cm\\n\");\n }","double Volume(){\r\n return Height * Width * Depth;\r\n }","@Test\r\n public void testRectangleVolumeCalc() throws JadeExceptionClass {\r\n System.out.println(\"Test Case #1\");\r\n double length = 23.0;\r\n double width = 8.0;\r\n double height = 4.0;\r\n rectangleControl instance = new rectangleControl();\r\n double expResult = 736.0;\r\n double result = instance.rectangleVolumeCalc(length, width, height);\r\n assertEquals(expResult, result, 1.0);\r\n System.out.println(\"Test Case #2\");\r\n length = 0;\r\n width = 43;\r\n height = 28;\r\n expResult = -1;\r\n result = instance.rectangleVolumeCalc(length, width, height);\r\n assertEquals(expResult, result, 1.0);\r\n System.out.println(\"Test Case #3\");\r\n length = -10;\r\n width = 50;\r\n height = 9;\r\n expResult = -1;\r\n result = instance.rectangleVolumeCalc(length, width, height);\r\n assertEquals(expResult, result, 1.0);\r\n System.out.println(\"Test Case #4\");\r\n length = 1100;\r\n width = 5;\r\n height = 6;\r\n expResult = -1;\r\n result = instance.rectangleVolumeCalc(length, width, height);\r\n assertEquals(expResult, result, 1.0);\r\n System.out.println(\"Test Case #5\");\r\n length = 50;\r\n width = 50;\r\n height = 1;\r\n expResult = 2500;\r\n result = instance.rectangleVolumeCalc(length, width, height);\r\n assertEquals(expResult, result, 1.0);\r\n System.out.println(\"Test Case #6\");\r\n length = 1;\r\n width = 50;\r\n height = 50;\r\n expResult = 2500;\r\n result = instance.rectangleVolumeCalc(length, width, height);\r\n assertEquals(expResult, result, 1.0);\r\n System.out.println(\"Test Case #7\");\r\n length = 50;\r\n width = 1;\r\n height = 50;\r\n expResult = 2500;\r\n result = instance.rectangleVolumeCalc(length, width, height);\r\n assertEquals(expResult, result, 1.0);\r\n }","private void setDimensions() {\n IPhysicalVolume physVol_parent = getModule().getGeometry().getPhysicalVolume();\n ILogicalVolume logVol_parent = physVol_parent.getLogicalVolume();\n ISolid solid_parent = logVol_parent.getSolid();\n Box box_parent;\n if (Box.class.isInstance(solid_parent)) {\n box_parent = (Box) solid_parent;\n } else {\n throw new RuntimeException(\"Couldn't cast the module volume to a box!?\");\n }\n _length = box_parent.getXHalfLength() * 2.0;\n _width = box_parent.getYHalfLength() * 2.0;\n\n }","public double getVolume() {\n return (getArea() * height);\n }","@Override\n\tpublic float volume() {\n\t\treturn (float) ((4/3) * Math.PI * Math.pow(radius, 3));\n\t}","public double getVolume() {\n\n double volume = 0;\n\n double[] v = this.getVertices();\n int[] f = this.getFaces();\n\n for (int i = 0; i < f.length; i += 6) {\n Vector3D v0 = new Vector3D(v[3 * f[i]], v[3 * f[i] + 1], v[3 * f[i] + 2]);\n Vector3D v1 = new Vector3D(v[3 * f[i + 2]], v[3 * f[i + 2] + 1], v[3 * f[i + 2] + 2]);\n Vector3D v2 = new Vector3D(v[3 * f[i + 4]], v[3 * f[i + 4] + 1], v[3 * f[i + 4] + 2]);\n\n v0 = v0.crossProduct(v1);\n volume += v0.dotProduct(v2);\n }\n\n return Math.abs(volume / 6.0);\n }","public static void main(String args[])\n {\n Box1 mybox1 = new Box1();\n Box1 mybox2 = new Box1();\n \n double vol;\n //get volume of first box\n vol = mybox1.volume();\n System.out.println(\"Volume is \" + vol);\n \n //get volume of second box\n vol = mybox2.volume();\n System.out.println(\"Volume is \" + vol);\n }","public double getVolume() {\n\t\treturn height * depth * length;\n\n\t}","@Override\n\tpublic void volume() {\n\t\tsolido.volume = (solido.areaBase * altura) / 3;\n\t}","public double volume () {return (4/3)*Math.PI*this.r*this.r*this.r;}","BigDecimal getVolume();","public static void main(String[] args) {\n\t\tBox box1 = new Box(10.323, 21.32, 9);\r\n\t\tBox box2 = new Box();\r\n\t\t\r\n\t\tbox2.setHeight(12.5);\r\n\t\tbox2.setWidht(10.4);\r\n\t\tbox2.setDepth(4);\r\n\t\t\r\n\t\tSystem.out.println(\"Box 1 \"+box1);\r\n\t\tSystem.out.println(\"Box 2 \"+box2);\r\n\t\t\r\n\t\tbox1.getVolume();\r\n\t\tbox2.getVolume();\r\n\t\t\r\n\t\tBox box3 = new Box();\r\n\t\tbox3.volume(box2);\r\n\t\t\r\n\t}","public double getVolume()\r\n\t{\r\n\t\treturn (super.getArea())*h;\r\n\t}","public double getVolume() {\n\t\treturn base.getArea() * height;\n\t}","public abstract double getVolume();","private double Volume() {\n\t\tdouble volume = (4f / 3f) * Math.PI * Math.pow(_radius, 3);\n\t\treturn volume;\n\t}","@Override\n\tpublic float volume() {\n\t\tfloat volume = (float) ((4/3) * Math.PI * Math.pow(this.radius, 3));\n\t\treturn volume;\n\t}","public double get_volume(int l,int b, int h) {\n\t\treturn l*b*h;\n\t}","public static void main(String args[])\n\t{\n\t\t\n\t\tBox mybox1 = new Box(10,20,15);\n\t\tBox mybox2 = new Box();\n\t\tBox mycube = new Box(7);\n\t\tBox myclone = new Box(mybox1);\n\t\t\n\t\tdouble vol;\n\t\t//get volume of first box\n\t\tvol = mybox1.volume();\n\t\tSystem.out.println(\"Volume of mybox1 is \"+vol);\n\t\t//get volume of second box\n\t\tvol = mybox2.volume();\n\t\tSystem.out.println(\"Volume of mybox2 is \"+vol);\n\t\t//get volume of cube\n\t\tvol = mycube.volume();\n\t\tSystem.out.println(\"Volume of my cube is \"+vol);\n\t\tvol = myclone.volume();\n\t\tSystem.out.println(\"Volume of myclone is \"+vol);\n\t}","public static void main(String[] args) {\r\n\r\n Rectangle rect = new Rectangle(5, 10);\r\n Cuboid cub = new Cuboid(5,10,5);\r\n System.out.println(cub.getVolume());\r\n }","double volume() {\n\t\treturn 0;\n\t}","static public double calculateVolumeLegacy(double[] direction, double[] positions, List<Triangle3D> triangles ){\n double sum = 0;\n\n for(Triangle3D triangle: triangles){\n triangle.update();\n sum += triangle.area*(triangle.normal[0]*direction[0] + triangle.normal[1]*direction[1] + triangle.normal[2]*direction[2])*\n (triangle.center[0]*direction[0] + triangle.center[1]*direction[1] + triangle.center[2]*direction[2]);\n }\n\n return sum/2.0;\n }","@Override\n public void getDimensions() {\n DecimalFormat df = new DecimalFormat(\"###.000\");\n System.out.println(\"RESULT: \" + getType() + \" dimensions: (2/3)pi * \" + r + \"^3\");\n System.out.println(\"RESULT: \" + getType() + \" volume \" + getVolume() + \" = [\" + df.format(this.vol) + \"]\");\n }","private static double[] getVolumes(final ImageStack aInputStack, final int[] aLables, final double[] aResol)\r\n\t{\r\n\t\tfinal double[] volumes = GeometricMeasures3D.volume(aInputStack, aLables, aResol);\r\n\t\treturn volumes;\r\n\t}","public double getVolumeOfPipe(){\n double lengthPipeInches = lengthOfPipe / 0.0254;\n \n double outerRadius = diameterOfPipe / 2;\n outerRadius = Math.pow(outerRadius,2);\n double outervolumeOfPipe = (Math.PI * outerRadius) * lengthPipeInches;\n \n //get the inner volume pi * r^2 * height\n double innerRadius = (diameterOfPipe / 2) * 0.9;\n innerRadius = Math.pow(innerRadius,2);\n double innervolumeOfPipe = (Math.PI * innerRadius) * lengthPipeInches; \n \n //get the total volume of raw materials\n double totalVolume = outervolumeOfPipe - innervolumeOfPipe;\n \n return totalVolume;\n }","int getVolume();","int getVolume();","public static double cylinderVolume(double radius, double height){\n return Math.PI * square(radius) * height;\n }","public double getVolume()\n {\n return volume / 512;\n }","@Test public void volumeTest()\n {\n PentagonalPyramid[] pArray = new PentagonalPyramid[100];\n PentagonalPyramid p1 = new PentagonalPyramid(\"PP1\", 1, 2);\n PentagonalPyramid p2 = new PentagonalPyramid(\"PP1\", 2, 3);\n PentagonalPyramid p3 = new PentagonalPyramid(\"PP1\", 3, 4);\n pArray[0] = p1;\n pArray[1] = p2;\n pArray[2] = p3;\n \n PentagonalPyramidList2 pList = new PentagonalPyramidList2(\"ListName\", \n pArray, 3);\n \n Assert.assertEquals(28.67462334314945, pList.totalVolume(), 0.00001);\n Assert.assertEquals(9.558207781049816, pList.averageVolume(), 0.00001);\n \n PentagonalPyramidList2 pList2 = new PentagonalPyramidList2(\"ListName\", \n null, 0);\n Assert.assertEquals(0.0, pList2.averageVolume(), 0.00001);\n \n }","public double getCyclinderVolume();","public static void main (String [] args) {\n\nScanner myScanner = new Scanner( System.in ); //declaring the instance of scanner and creating an instance of calling input from STDIN\nSystem.out.print( \"Enter the square side measurement of pyramid: \" ); //prompt user to enter measurement of square side of pyramid\ndouble squareSide = myScanner.nextDouble(); //accept user input\n\n\nSystem.out.print( \"Enter the height of pyramid: \" ); //prompt user to enter measurement of height of pyramid\ndouble height = myScanner.nextDouble(); //accept user input\n\n\ndouble volume = (squareSide*squareSide*height)/3;\n\n\n System.out.println(\"The volume inside the pyramid is: \"+ volume + \".\");\n\n\n }","@Override\n\tpublic double volume() {\n\t\treturn 0;\n\t}","@Override\n\tpublic double volume() {\n\t\treturn 0;\n\t}","public int getVolume();","public double getVolume() { return volume; }","public static double volumeOfCylinder(double radius, double height) {\n\n //calculating the volume.\n double rSquared = Math.pow(radius, 2); // To do the power. Radius is in the base\n // and the 2 is in the power\n\n //doing the equation to get the volume of a cylinder\n double volume = Math.PI * rSquared * height;\n\n return volume; //send back the answer\n }","public Float getVolume() throws DynamicCallException, ExecutionException {\n return (Float)call(\"getVolume\").get();\n }","public double getVolume() {\n return super.getLado1() * super.getLado2() * this.altura;\n }","public static void main(String[] args) {\n\t\t\n\t\tint vol;\n\t\t\n\t\tBoxInfo myobj = new BoxInfo();\n\t\tBoxInfo myobj1 = new BoxInfo();\n\t\t\n\t\tmyobj.height = 10;\n\t\tmyobj.length = 30;\n\t\t\n\t\tmyobj1.height = 3;\n\t\tmyobj1.length = 4;\n\t\t\n\t\t\n\t\tvol = myobj.height * myobj.length;\n\t\tSystem.out.println(\"value of area is:\"+vol);\n\t\t\n\t\tvol = myobj1.height * myobj1.length;\n\t\tSystem.out.println(\"value of area is:\"+vol);\n\t\t\n\n\t}","public static void halfVolume() {\n volume = 50;\n System.out.println(\"Volume: \" + volume);\n//end of modifiable zone(JavaCode)........E/30cff6a1-f5dd-43b9-94cb-285201f52ee7\n }","public double[] getBox() { return box; }","public static double volume(double radius){\r\n return 4.0 / 3.0 * Math.PI * Math.pow(radius,3.0);\r\n }","public IntVec3Volume(IntVec3 start, IntVec3 end){\n this.start=start;\n this.end=end;\n }","public float getVolumeMultiplier();","void setFluidContents(int volume);","public double get_volume(double r) {\n\t\treturn (Math.PI)*r*r*r*2/3;\t\t//dont 2/3*(Math.PI)*r*r*r -> ans 0\n\t}","public long getPropertyVolume();","@Override\n\tpublic float volume() {\n\t\treturn 0;\n\t}","public double averageVolume() {\n if (numberOfIcosahedrons() == 0) {\n return 0;\n }\n else {\n return totalVolume() / numberOfIcosahedrons();\n }\n }","public float getVolume()\n {\n return volume;\n }","@Test(groups = { \"data\", \"volume\", \"functional\" }, dataProvider = \"cube-volume\")\n\tpublic void testVolume(int input, double VolumeExpected) {\n\t\tSystem.out.print(\"testVolume\");\n\t\tSystem.out.println(\" passed values are side=\" + input + \" VolumeExpected=\" + VolumeExpected);\n\n\t\tCube cube = new Cube(input);\n\t\tdouble result = cube.volume();\n\t\tSystem.out.println(\"testVolume result :\" + result + \" Expected: \" + VolumeExpected);\n\t\tassertEquals(VolumeExpected, result, 0.0);\n\t}","public static double volumeCylinder( double radius, double height ) {\n return Math.PI * areaCircle(radius) * height;\n }","int getOriginalVolume();","public double getVolume() {\n return volume;\n }","public ViewVolumeViewer(WorldWindow observedWindow, Dimension size)\n {\n this.observered = observedWindow;\n this.getContentPane().setLayout(new BorderLayout(5, 5));\n\n this.wwp = new WWPanel((WorldWindowGLCanvas) this.observered, size, this.makeModel());\n this.getContentPane().add(wwp, BorderLayout.CENTER);\n\n this.wwd = wwp.wwd;\n\n final SectorGeometryLayer sgLayer = new SectorGeometryLayer();\n this.wwd.getModel().getLayers().add(sgLayer);\n\n final ViewVolumeLayer vvLayer = new ViewVolumeLayer();\n this.wwd.getModel().getLayers().add(0, vvLayer);\n\n // This view volume viewer updates its display within a rendering listener registered for the observed window\n this.observered.addRenderingListener(new RenderingListener()\n {\n public void stageChanged(RenderingEvent event)\n {\n if (event.getStage().equals(RenderingEvent.AFTER_BUFFER_SWAP))\n {\n // Get the observed window's sector geometry and update this window's terrain display layer\n SectorGeometryList sgCopy = new SectorGeometryList(observered.getSceneController().getTerrain());\n sgLayer.setGeometry(sgCopy);\n\n // Get the observed window's view and update this window's view volume display layer\n vvLayer.setView(observered.getView());\n\n // Redraw this (the view volume viewer's) window\n wwd.redraw();\n }\n }\n });\n\n this.setTitle(\"View Volume Viewer\");\n this.setResizable(true);\n this.pack();\n }","@Override\r\n public double obtenerVolumen() {\n return Math.pow(getA(), 3);//eleva al cubo\r\n }","Box(double len)\n\t{\n\t\t\n\t\twidth = height = depth = len;\n\t\t\n\t}","public static double calculateVolume(List<Triangle3D> triangles){\n double sum = 0;\n for(Triangle3D triangle: triangles){\n double[] r1 = triangle.getCoordinates(0);\n double[] r2 = triangle.getCoordinates(1);\n double[] r3 = triangle.getCoordinates(2);\n sum += (\n - r3[0]*r2[1]*r1[2] + r2[0]*r3[1]*r1[2] + r3[0]*r1[1]*r2[2]\n - r1[0]*r3[1]*r2[2] - r2[0]*r1[1]*r3[2] + r1[0]*r2[1]*r3[2]\n )/6.0;\n }\n return sum;\n }","public static void main(String[] args) {\n Scanner scanner = new Scanner(System.in);\n List<Shape> shapes = new ArrayList<>();\n //System.out.println(\"Please enter the bin capacity\");\n Shape container = new Shape();\n container.containerPrompt();\n container.containerVolume();\n int binCapacity = container.containerVolume();\n //insert three items here\n System.out.println(\"How many cubes do want to store: 1, 2 or 3 \");\n int choice = scanner.nextInt();\n while (choice-- >0){\n Shape object = new Shape();\n object.objectPrompt();\n shapes.add(object);\n\n /*\n object.objectVolume();\n int one = object.containerVolume();*/\n }\n\n /*switch (choice){\n case 1:\n Shape shape1 = new Shape();\n shape1.objectPrompt();\n shape1.objectVolume();\n int one = shape1.containerVolume();\n break;\n case 2:\n Shape shape2 = new Shape();\n shape2.objectPrompt();\n shape2.objectVolume();\n int two = shape2.containerVolume();\n\n Shape shape3 = new Shape();\n shape3.objectPrompt();\n shape3.objectVolume();\n int one = shape1.containerVolume();\n break;\n\n case 3:\n Shape shape1 = new Shape();\n shape1.objectPrompt();\n shape1.objectVolume();\n int one = shape1.containerVolume();\n break;\n default:\n }*/\n List<Integer> items=new ArrayList<>();\n\n for (Shape shape: shapes){\n items.add(shape.containerVolume());\n System.out.println(shape.containerVolume());\n }\n\n\n\n //List<Integer> items = Arrays.asList(shapes.get(0).containerVolume());\n //insert the bin capacity\n // int binCapacity = 5;\n CheckBin algorithm = new CheckBin(items, binCapacity);\n algorithm.solvingBinPackingProblem();\n algorithm.showResults();\n // System.out.println(\"This is after committing\");\n\n\n }","public float getVolume() {\n return 1.0f;\n }","void setVolume(float volume);","public double getVolume()\n {\n return this.volume;\n }","Box(double len){\r\n Height = Width = Depth = len;\r\n\r\n }","public long getPropertyVolumeUnity();","void volume(double volume) {\n execute(\"player.volume = \" + volume);\n }","public void setVolume(double area, double height) {\n this.height = height;\n }","@Override\r\n\tpublic float getVolume() {\n\t\treturn 0;\r\n\t}","public int VolumeGet();","double area() {\nSystem.out.println(\"Inside Area for Rectangle.\");\nreturn dim1 * dim2;\n }","public static double volumeOfSphere(double r) {\n double v = 4.0 / 3.0 * Math.PI * Math.pow(r, 3);\n v = (double) Math.round(v * 100) / 100;\n return v;\n }","public abstract float surfaceArea();","public double calcConeVolume(final double radius, final double height) {\n\n return ((1.0 / 3.0) * Math.PI * Math.pow(radius, 2) * height);\n }","double area() {\nSystem.out.println(\"Inside Area for Rectangle.\");\nreturn dim1 * dim2;\n}","private void calcBoxVerts() {\n\t\tif (verts != null) {\n\t\t\tdouble minX = verts[0].getElement(0);\n\t\t\tdouble maxX = minX;\n\t\t\tdouble minY = verts[0].getElement(1);\n\t\t\tdouble maxY = minY;\n\t\t\tdouble minZ = verts[0].getElement(2);\n\t\t\tdouble maxZ = minZ;\n\t\t\tfor (int i = 1; i < verts.length; i++) {\n\t\t\t\tif (verts[i].getElement(0) < minX) {\n\t\t\t\t\tminX = verts[i].getElement(0);\n\t\t\t\t} else if (verts[i].getElement(0) > maxX) {\n\t\t\t\t\tmaxX = verts[i].getElement(0);\n\t\t\t\t}\n\t\t\t\tif (verts[i].getElement(1) < minY) {\n\t\t\t\t\tminY = verts[i].getElement(1);\n\t\t\t\t} else if (verts[i].getElement(1) > maxY) {\n\t\t\t\t\tmaxY = verts[i].getElement(1);\n\t\t\t\t}\n\t\t\t\tif (verts[i].getElement(2) < minZ) {\n\t\t\t\t\tminZ = verts[i].getElement(2);\n\t\t\t\t} else if (verts[i].getElement(2) > maxZ) {\n\t\t\t\t\tmaxZ = verts[i].getElement(2);\n\t\t\t\t}\n\t\t\t}\n\t\t\tVector[] boxVerts = new Vector[8];\n\t\t\tboxVerts[0] = new Vector(3);\n\t\t\tboxVerts[0].setElements(new double[] {minX, minY, minZ});\n\t\t\tboxVerts[1] = new Vector(3);\n\t\t\tboxVerts[1].setElements(new double[] {maxX, minY, minZ});\n\t\t\tboxVerts[2] = new Vector(3);\n\t\t\tboxVerts[2].setElements(new double[] {minX, minY, maxZ});\n\t\t\tboxVerts[3] = new Vector(3);\n\t\t\tboxVerts[3].setElements(new double[] {maxX, minY, maxZ});\n\t\t\tboxVerts[4] = new Vector(3);\n\t\t\tboxVerts[4].setElements(new double[] {minX, maxY, minZ});\n\t\t\tboxVerts[5] = new Vector(3);\n\t\t\tboxVerts[5].setElements(new double[] {maxX, maxY, minZ});\n\t\t\tboxVerts[6] = new Vector(3);\n\t\t\tboxVerts[6].setElements(new double[] {minX, maxY, maxZ});\n\t\t\tboxVerts[7] = new Vector(3);\n\t\t\tboxVerts[7].setElements(new double[] {maxX, maxY, maxZ});\n\t\t\tthis.boxVerts = boxVerts;\n\t\t} else {\n\t\t\tthis.boxVerts = null;\n\t\t}\n\t}","@Override\n public double obtenerVolumen(){\n return (1.0 / 3.0) * c.obtenerArea() * c.obtenerAltura();\n }","double getMaxVolume();","public Vector3f getDimensions();","ModuleComponent volume();","Double volume() {\n return execute(\"player.volume\");\n }","public double get_volume(double r,double h) {\n\t\treturn (Math.PI)*r*r*h;\n\t}"],"string":"[\n \"public static void main(String [] args){\\n\\r\\n Box box1 = new Box(10.0, 20.0, 15.0);\\r\\n Box box2 = new Box();\\r\\n Box box3 = new Box(7);\\r\\n\\r\\n double vol = box1.Volume();\\r\\n System.out.println(\\\"The Volume of box1: \\\"+vol);\\r\\n\\r\\n vol = box2.Volume();\\r\\n System.out.println(\\\"The Volume of box2: \\\"+vol);\\r\\n\\r\\n vol = box3.Volume();\\r\\n System.out.println(\\\"The Volume of Cube: \\\"+vol);\\r\\n\\r\\n \\r\\n \\r\\n }\",\n \"double volume(){\\n\\n return widgh*height*depth;\\n\\n }\",\n \"public double calcVolume(){\\n double area=calcArea(); // calcArea of superclass used\\r\\n return area*h;\\r\\n }\",\n \"double volume(){\\n return width*height*depth;\\n }\",\n \"public abstract double calcVolume();\",\n \"public abstract double calcVolume();\",\n \"double volume()\\n\\t{\\n\\t\\t\\n\\t\\treturn width*height*depth;\\n\\t\\t\\n\\t}\",\n \"double volume() {\\n\\treturn width*height*depth;\\n}\",\n \"private void calculateVolume() {\\n\\n\\t\\t/*\\n\\n\\t\\t */\\n\\t\\tfor(int i=0; i<this._prismoidsLength.size(); i++) \\n\\t\\t\\tthis._prismoidsVolumes.add(\\n\\t\\t\\t\\t\\tAmount.valueOf(\\n\\t\\t\\t\\t\\t\\t\\tthis._prismoidsLength.get(i).divide(3)\\n\\t\\t\\t\\t\\t\\t\\t.times(\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tthis._prismoidsSectionsAreas.get(i).getEstimatedValue()\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t+ this._prismoidsSectionsAreas.get(i+1).getEstimatedValue()\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t+ Math.sqrt(\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tthis._prismoidsSectionsAreas.get(i)\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t.times(this._prismoidsSectionsAreas.get(i+1))\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t.getEstimatedValue()\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t)\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t).getEstimatedValue(),\\n\\t\\t\\t\\t\\t\\t\\tSI.CUBIC_METRE\\n\\t\\t\\t\\t\\t\\t\\t)\\n\\t\\t\\t\\t\\t);\\n\\t\\t\\n\\t\\tfor(int i=0; i<this._prismoidsVolumes.size(); i++)\\n\\t\\t\\tthis._fuelVolume = this._fuelVolume\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\t.plus(this._prismoidsVolumes.get(i));\\n\\t\\tthis._fuelVolume = this._fuelVolume.times(2);\\n\\t\\t\\n\\t}\",\n \"public abstract double volume();\",\n \"public int volume() {\\r\\n int xLength = this.getMaximumPoint().getBlockX() - this.getMinimumPoint().getBlockX() + 1;\\r\\n int yLength = this.getMaximumPoint().getBlockY() - this.getMinimumPoint().getBlockY() + 1;\\r\\n int zLength = this.getMaximumPoint().getBlockZ() - this.getMinimumPoint().getBlockZ() + 1;\\r\\n\\r\\n int volume = xLength * yLength * zLength;\\r\\n return volume;\\r\\n }\",\n \"@Override\\n\\tpublic void calcularVolume() {\\n\\t\\t\\n\\t}\",\n \"public static void main(String args[]){\\n\\n Box mybox1 = new Box();\\n Box mybox2 = new Box();\\n\\n double vol;\\n\\n // get volume of first box\\n\\n vol = mybox1.volume();\\n System.out.println(\\\"Volume of box1 is \\\"+vol);\\n\\n // get volume of second box\\n\\n vol = mybox2.volume();\\n System.out.println(\\\"Volume of box2 is \\\"+vol);\\n }\",\n \"public abstract float volume();\",\n \"public int calculateVolume() {\\n return (int) Math.pow(this.sideLength, 3) ;\\n }\",\n \"public double volume() {\\n\\t\\treturn this.iWidth * this.iLength * this.iDepth\\r\\n\\t}\",\n \"public double volume()\\r\\n {\\r\\n double volume = Math.pow(radius, 2) * (height / 3) * Math.PI;\\r\\n return volume;\\r\\n }\",\n \"@Override\\n\\tpublic double getvolume(){\\n\\t\\tdouble[] ab_cross_ac = calculate_vcp(getVector_AB(),getVector_AC());\\n\\t\\t\\n\\t\\t//dot product of ab_cross_ac and ad\\n\\t\\tdouble S = calculate_vdp(ab_cross_ac,getVector_AD());\\n\\t\\t\\n\\t\\t//formula of tetrahedron's volume\\n\\t\\treturn Math.abs(S)/6;\\t\\n\\t}\",\n \"public void calcVolume() {\\n this.vol = (0.6666666666666667 * Math.PI) * Math.pow(r, 3);\\n }\",\n \"public static void main(String[] args){\\n BoxModify box1 = new BoxModify(20.0, 10.0, 15.0);\\n BoxModify box2 = new BoxModify(box1);\\n BoxModify box3 = new BoxModify(6.0);\\n double volume, area;\\n //double volume, area; \\n // Get and display volume and surface area of box1\\n volume = box1.volume();\\n area = box1.surfaceArea();\\n System.out.println(\\\"Box 1 is \\\" + box1);\\n System.out.println(\\\"Box 2 is \\\"+box2);\\n System.out.println(\\\"Box 3 is \\\"+box3);\\n // Get and display volume of surface area box2\\n System.out.println(\\\"\\\\nThe volume of box2 is \\\" + box2.volume() + \\\" cubic cm\\\");\\n System.out.println(\\\"The surface area of box2 is \\\"+area+\\\" square cm\\\\n\\\");\\n }\",\n \"double Volume(){\\r\\n return Height * Width * Depth;\\r\\n }\",\n \"@Test\\r\\n public void testRectangleVolumeCalc() throws JadeExceptionClass {\\r\\n System.out.println(\\\"Test Case #1\\\");\\r\\n double length = 23.0;\\r\\n double width = 8.0;\\r\\n double height = 4.0;\\r\\n rectangleControl instance = new rectangleControl();\\r\\n double expResult = 736.0;\\r\\n double result = instance.rectangleVolumeCalc(length, width, height);\\r\\n assertEquals(expResult, result, 1.0);\\r\\n System.out.println(\\\"Test Case #2\\\");\\r\\n length = 0;\\r\\n width = 43;\\r\\n height = 28;\\r\\n expResult = -1;\\r\\n result = instance.rectangleVolumeCalc(length, width, height);\\r\\n assertEquals(expResult, result, 1.0);\\r\\n System.out.println(\\\"Test Case #3\\\");\\r\\n length = -10;\\r\\n width = 50;\\r\\n height = 9;\\r\\n expResult = -1;\\r\\n result = instance.rectangleVolumeCalc(length, width, height);\\r\\n assertEquals(expResult, result, 1.0);\\r\\n System.out.println(\\\"Test Case #4\\\");\\r\\n length = 1100;\\r\\n width = 5;\\r\\n height = 6;\\r\\n expResult = -1;\\r\\n result = instance.rectangleVolumeCalc(length, width, height);\\r\\n assertEquals(expResult, result, 1.0);\\r\\n System.out.println(\\\"Test Case #5\\\");\\r\\n length = 50;\\r\\n width = 50;\\r\\n height = 1;\\r\\n expResult = 2500;\\r\\n result = instance.rectangleVolumeCalc(length, width, height);\\r\\n assertEquals(expResult, result, 1.0);\\r\\n System.out.println(\\\"Test Case #6\\\");\\r\\n length = 1;\\r\\n width = 50;\\r\\n height = 50;\\r\\n expResult = 2500;\\r\\n result = instance.rectangleVolumeCalc(length, width, height);\\r\\n assertEquals(expResult, result, 1.0);\\r\\n System.out.println(\\\"Test Case #7\\\");\\r\\n length = 50;\\r\\n width = 1;\\r\\n height = 50;\\r\\n expResult = 2500;\\r\\n result = instance.rectangleVolumeCalc(length, width, height);\\r\\n assertEquals(expResult, result, 1.0);\\r\\n }\",\n \"private void setDimensions() {\\n IPhysicalVolume physVol_parent = getModule().getGeometry().getPhysicalVolume();\\n ILogicalVolume logVol_parent = physVol_parent.getLogicalVolume();\\n ISolid solid_parent = logVol_parent.getSolid();\\n Box box_parent;\\n if (Box.class.isInstance(solid_parent)) {\\n box_parent = (Box) solid_parent;\\n } else {\\n throw new RuntimeException(\\\"Couldn't cast the module volume to a box!?\\\");\\n }\\n _length = box_parent.getXHalfLength() * 2.0;\\n _width = box_parent.getYHalfLength() * 2.0;\\n\\n }\",\n \"public double getVolume() {\\n return (getArea() * height);\\n }\",\n \"@Override\\n\\tpublic float volume() {\\n\\t\\treturn (float) ((4/3) * Math.PI * Math.pow(radius, 3));\\n\\t}\",\n \"public double getVolume() {\\n\\n double volume = 0;\\n\\n double[] v = this.getVertices();\\n int[] f = this.getFaces();\\n\\n for (int i = 0; i < f.length; i += 6) {\\n Vector3D v0 = new Vector3D(v[3 * f[i]], v[3 * f[i] + 1], v[3 * f[i] + 2]);\\n Vector3D v1 = new Vector3D(v[3 * f[i + 2]], v[3 * f[i + 2] + 1], v[3 * f[i + 2] + 2]);\\n Vector3D v2 = new Vector3D(v[3 * f[i + 4]], v[3 * f[i + 4] + 1], v[3 * f[i + 4] + 2]);\\n\\n v0 = v0.crossProduct(v1);\\n volume += v0.dotProduct(v2);\\n }\\n\\n return Math.abs(volume / 6.0);\\n }\",\n \"public static void main(String args[])\\n {\\n Box1 mybox1 = new Box1();\\n Box1 mybox2 = new Box1();\\n \\n double vol;\\n //get volume of first box\\n vol = mybox1.volume();\\n System.out.println(\\\"Volume is \\\" + vol);\\n \\n //get volume of second box\\n vol = mybox2.volume();\\n System.out.println(\\\"Volume is \\\" + vol);\\n }\",\n \"public double getVolume() {\\n\\t\\treturn height * depth * length;\\n\\n\\t}\",\n \"@Override\\n\\tpublic void volume() {\\n\\t\\tsolido.volume = (solido.areaBase * altura) / 3;\\n\\t}\",\n \"public double volume () {return (4/3)*Math.PI*this.r*this.r*this.r;}\",\n \"BigDecimal getVolume();\",\n \"public static void main(String[] args) {\\n\\t\\tBox box1 = new Box(10.323, 21.32, 9);\\r\\n\\t\\tBox box2 = new Box();\\r\\n\\t\\t\\r\\n\\t\\tbox2.setHeight(12.5);\\r\\n\\t\\tbox2.setWidht(10.4);\\r\\n\\t\\tbox2.setDepth(4);\\r\\n\\t\\t\\r\\n\\t\\tSystem.out.println(\\\"Box 1 \\\"+box1);\\r\\n\\t\\tSystem.out.println(\\\"Box 2 \\\"+box2);\\r\\n\\t\\t\\r\\n\\t\\tbox1.getVolume();\\r\\n\\t\\tbox2.getVolume();\\r\\n\\t\\t\\r\\n\\t\\tBox box3 = new Box();\\r\\n\\t\\tbox3.volume(box2);\\r\\n\\t\\t\\r\\n\\t}\",\n \"public double getVolume()\\r\\n\\t{\\r\\n\\t\\treturn (super.getArea())*h;\\r\\n\\t}\",\n \"public double getVolume() {\\n\\t\\treturn base.getArea() * height;\\n\\t}\",\n \"public abstract double getVolume();\",\n \"private double Volume() {\\n\\t\\tdouble volume = (4f / 3f) * Math.PI * Math.pow(_radius, 3);\\n\\t\\treturn volume;\\n\\t}\",\n \"@Override\\n\\tpublic float volume() {\\n\\t\\tfloat volume = (float) ((4/3) * Math.PI * Math.pow(this.radius, 3));\\n\\t\\treturn volume;\\n\\t}\",\n \"public double get_volume(int l,int b, int h) {\\n\\t\\treturn l*b*h;\\n\\t}\",\n \"public static void main(String args[])\\n\\t{\\n\\t\\t\\n\\t\\tBox mybox1 = new Box(10,20,15);\\n\\t\\tBox mybox2 = new Box();\\n\\t\\tBox mycube = new Box(7);\\n\\t\\tBox myclone = new Box(mybox1);\\n\\t\\t\\n\\t\\tdouble vol;\\n\\t\\t//get volume of first box\\n\\t\\tvol = mybox1.volume();\\n\\t\\tSystem.out.println(\\\"Volume of mybox1 is \\\"+vol);\\n\\t\\t//get volume of second box\\n\\t\\tvol = mybox2.volume();\\n\\t\\tSystem.out.println(\\\"Volume of mybox2 is \\\"+vol);\\n\\t\\t//get volume of cube\\n\\t\\tvol = mycube.volume();\\n\\t\\tSystem.out.println(\\\"Volume of my cube is \\\"+vol);\\n\\t\\tvol = myclone.volume();\\n\\t\\tSystem.out.println(\\\"Volume of myclone is \\\"+vol);\\n\\t}\",\n \"public static void main(String[] args) {\\r\\n\\r\\n Rectangle rect = new Rectangle(5, 10);\\r\\n Cuboid cub = new Cuboid(5,10,5);\\r\\n System.out.println(cub.getVolume());\\r\\n }\",\n \"double volume() {\\n\\t\\treturn 0;\\n\\t}\",\n \"static public double calculateVolumeLegacy(double[] direction, double[] positions, List<Triangle3D> triangles ){\\n double sum = 0;\\n\\n for(Triangle3D triangle: triangles){\\n triangle.update();\\n sum += triangle.area*(triangle.normal[0]*direction[0] + triangle.normal[1]*direction[1] + triangle.normal[2]*direction[2])*\\n (triangle.center[0]*direction[0] + triangle.center[1]*direction[1] + triangle.center[2]*direction[2]);\\n }\\n\\n return sum/2.0;\\n }\",\n \"@Override\\n public void getDimensions() {\\n DecimalFormat df = new DecimalFormat(\\\"###.000\\\");\\n System.out.println(\\\"RESULT: \\\" + getType() + \\\" dimensions: (2/3)pi * \\\" + r + \\\"^3\\\");\\n System.out.println(\\\"RESULT: \\\" + getType() + \\\" volume \\\" + getVolume() + \\\" = [\\\" + df.format(this.vol) + \\\"]\\\");\\n }\",\n \"private static double[] getVolumes(final ImageStack aInputStack, final int[] aLables, final double[] aResol)\\r\\n\\t{\\r\\n\\t\\tfinal double[] volumes = GeometricMeasures3D.volume(aInputStack, aLables, aResol);\\r\\n\\t\\treturn volumes;\\r\\n\\t}\",\n \"public double getVolumeOfPipe(){\\n double lengthPipeInches = lengthOfPipe / 0.0254;\\n \\n double outerRadius = diameterOfPipe / 2;\\n outerRadius = Math.pow(outerRadius,2);\\n double outervolumeOfPipe = (Math.PI * outerRadius) * lengthPipeInches;\\n \\n //get the inner volume pi * r^2 * height\\n double innerRadius = (diameterOfPipe / 2) * 0.9;\\n innerRadius = Math.pow(innerRadius,2);\\n double innervolumeOfPipe = (Math.PI * innerRadius) * lengthPipeInches; \\n \\n //get the total volume of raw materials\\n double totalVolume = outervolumeOfPipe - innervolumeOfPipe;\\n \\n return totalVolume;\\n }\",\n \"int getVolume();\",\n \"int getVolume();\",\n \"public static double cylinderVolume(double radius, double height){\\n return Math.PI * square(radius) * height;\\n }\",\n \"public double getVolume()\\n {\\n return volume / 512;\\n }\",\n \"@Test public void volumeTest()\\n {\\n PentagonalPyramid[] pArray = new PentagonalPyramid[100];\\n PentagonalPyramid p1 = new PentagonalPyramid(\\\"PP1\\\", 1, 2);\\n PentagonalPyramid p2 = new PentagonalPyramid(\\\"PP1\\\", 2, 3);\\n PentagonalPyramid p3 = new PentagonalPyramid(\\\"PP1\\\", 3, 4);\\n pArray[0] = p1;\\n pArray[1] = p2;\\n pArray[2] = p3;\\n \\n PentagonalPyramidList2 pList = new PentagonalPyramidList2(\\\"ListName\\\", \\n pArray, 3);\\n \\n Assert.assertEquals(28.67462334314945, pList.totalVolume(), 0.00001);\\n Assert.assertEquals(9.558207781049816, pList.averageVolume(), 0.00001);\\n \\n PentagonalPyramidList2 pList2 = new PentagonalPyramidList2(\\\"ListName\\\", \\n null, 0);\\n Assert.assertEquals(0.0, pList2.averageVolume(), 0.00001);\\n \\n }\",\n \"public double getCyclinderVolume();\",\n \"public static void main (String [] args) {\\n\\nScanner myScanner = new Scanner( System.in ); //declaring the instance of scanner and creating an instance of calling input from STDIN\\nSystem.out.print( \\\"Enter the square side measurement of pyramid: \\\" ); //prompt user to enter measurement of square side of pyramid\\ndouble squareSide = myScanner.nextDouble(); //accept user input\\n\\n\\nSystem.out.print( \\\"Enter the height of pyramid: \\\" ); //prompt user to enter measurement of height of pyramid\\ndouble height = myScanner.nextDouble(); //accept user input\\n\\n\\ndouble volume = (squareSide*squareSide*height)/3;\\n\\n\\n System.out.println(\\\"The volume inside the pyramid is: \\\"+ volume + \\\".\\\");\\n\\n\\n }\",\n \"@Override\\n\\tpublic double volume() {\\n\\t\\treturn 0;\\n\\t}\",\n \"@Override\\n\\tpublic double volume() {\\n\\t\\treturn 0;\\n\\t}\",\n \"public int getVolume();\",\n \"public double getVolume() { return volume; }\",\n \"public static double volumeOfCylinder(double radius, double height) {\\n\\n //calculating the volume.\\n double rSquared = Math.pow(radius, 2); // To do the power. Radius is in the base\\n // and the 2 is in the power\\n\\n //doing the equation to get the volume of a cylinder\\n double volume = Math.PI * rSquared * height;\\n\\n return volume; //send back the answer\\n }\",\n \"public Float getVolume() throws DynamicCallException, ExecutionException {\\n return (Float)call(\\\"getVolume\\\").get();\\n }\",\n \"public double getVolume() {\\n return super.getLado1() * super.getLado2() * this.altura;\\n }\",\n \"public static void main(String[] args) {\\n\\t\\t\\n\\t\\tint vol;\\n\\t\\t\\n\\t\\tBoxInfo myobj = new BoxInfo();\\n\\t\\tBoxInfo myobj1 = new BoxInfo();\\n\\t\\t\\n\\t\\tmyobj.height = 10;\\n\\t\\tmyobj.length = 30;\\n\\t\\t\\n\\t\\tmyobj1.height = 3;\\n\\t\\tmyobj1.length = 4;\\n\\t\\t\\n\\t\\t\\n\\t\\tvol = myobj.height * myobj.length;\\n\\t\\tSystem.out.println(\\\"value of area is:\\\"+vol);\\n\\t\\t\\n\\t\\tvol = myobj1.height * myobj1.length;\\n\\t\\tSystem.out.println(\\\"value of area is:\\\"+vol);\\n\\t\\t\\n\\n\\t}\",\n \"public static void halfVolume() {\\n volume = 50;\\n System.out.println(\\\"Volume: \\\" + volume);\\n//end of modifiable zone(JavaCode)........E/30cff6a1-f5dd-43b9-94cb-285201f52ee7\\n }\",\n \"public double[] getBox() { return box; }\",\n \"public static double volume(double radius){\\r\\n return 4.0 / 3.0 * Math.PI * Math.pow(radius,3.0);\\r\\n }\",\n \"public IntVec3Volume(IntVec3 start, IntVec3 end){\\n this.start=start;\\n this.end=end;\\n }\",\n \"public float getVolumeMultiplier();\",\n \"void setFluidContents(int volume);\",\n \"public double get_volume(double r) {\\n\\t\\treturn (Math.PI)*r*r*r*2/3;\\t\\t//dont 2/3*(Math.PI)*r*r*r -> ans 0\\n\\t}\",\n \"public long getPropertyVolume();\",\n \"@Override\\n\\tpublic float volume() {\\n\\t\\treturn 0;\\n\\t}\",\n \"public double averageVolume() {\\n if (numberOfIcosahedrons() == 0) {\\n return 0;\\n }\\n else {\\n return totalVolume() / numberOfIcosahedrons();\\n }\\n }\",\n \"public float getVolume()\\n {\\n return volume;\\n }\",\n \"@Test(groups = { \\\"data\\\", \\\"volume\\\", \\\"functional\\\" }, dataProvider = \\\"cube-volume\\\")\\n\\tpublic void testVolume(int input, double VolumeExpected) {\\n\\t\\tSystem.out.print(\\\"testVolume\\\");\\n\\t\\tSystem.out.println(\\\" passed values are side=\\\" + input + \\\" VolumeExpected=\\\" + VolumeExpected);\\n\\n\\t\\tCube cube = new Cube(input);\\n\\t\\tdouble result = cube.volume();\\n\\t\\tSystem.out.println(\\\"testVolume result :\\\" + result + \\\" Expected: \\\" + VolumeExpected);\\n\\t\\tassertEquals(VolumeExpected, result, 0.0);\\n\\t}\",\n \"public static double volumeCylinder( double radius, double height ) {\\n return Math.PI * areaCircle(radius) * height;\\n }\",\n \"int getOriginalVolume();\",\n \"public double getVolume() {\\n return volume;\\n }\",\n \"public ViewVolumeViewer(WorldWindow observedWindow, Dimension size)\\n {\\n this.observered = observedWindow;\\n this.getContentPane().setLayout(new BorderLayout(5, 5));\\n\\n this.wwp = new WWPanel((WorldWindowGLCanvas) this.observered, size, this.makeModel());\\n this.getContentPane().add(wwp, BorderLayout.CENTER);\\n\\n this.wwd = wwp.wwd;\\n\\n final SectorGeometryLayer sgLayer = new SectorGeometryLayer();\\n this.wwd.getModel().getLayers().add(sgLayer);\\n\\n final ViewVolumeLayer vvLayer = new ViewVolumeLayer();\\n this.wwd.getModel().getLayers().add(0, vvLayer);\\n\\n // This view volume viewer updates its display within a rendering listener registered for the observed window\\n this.observered.addRenderingListener(new RenderingListener()\\n {\\n public void stageChanged(RenderingEvent event)\\n {\\n if (event.getStage().equals(RenderingEvent.AFTER_BUFFER_SWAP))\\n {\\n // Get the observed window's sector geometry and update this window's terrain display layer\\n SectorGeometryList sgCopy = new SectorGeometryList(observered.getSceneController().getTerrain());\\n sgLayer.setGeometry(sgCopy);\\n\\n // Get the observed window's view and update this window's view volume display layer\\n vvLayer.setView(observered.getView());\\n\\n // Redraw this (the view volume viewer's) window\\n wwd.redraw();\\n }\\n }\\n });\\n\\n this.setTitle(\\\"View Volume Viewer\\\");\\n this.setResizable(true);\\n this.pack();\\n }\",\n \"@Override\\r\\n public double obtenerVolumen() {\\n return Math.pow(getA(), 3);//eleva al cubo\\r\\n }\",\n \"Box(double len)\\n\\t{\\n\\t\\t\\n\\t\\twidth = height = depth = len;\\n\\t\\t\\n\\t}\",\n \"public static double calculateVolume(List<Triangle3D> triangles){\\n double sum = 0;\\n for(Triangle3D triangle: triangles){\\n double[] r1 = triangle.getCoordinates(0);\\n double[] r2 = triangle.getCoordinates(1);\\n double[] r3 = triangle.getCoordinates(2);\\n sum += (\\n - r3[0]*r2[1]*r1[2] + r2[0]*r3[1]*r1[2] + r3[0]*r1[1]*r2[2]\\n - r1[0]*r3[1]*r2[2] - r2[0]*r1[1]*r3[2] + r1[0]*r2[1]*r3[2]\\n )/6.0;\\n }\\n return sum;\\n }\",\n \"public static void main(String[] args) {\\n Scanner scanner = new Scanner(System.in);\\n List<Shape> shapes = new ArrayList<>();\\n //System.out.println(\\\"Please enter the bin capacity\\\");\\n Shape container = new Shape();\\n container.containerPrompt();\\n container.containerVolume();\\n int binCapacity = container.containerVolume();\\n //insert three items here\\n System.out.println(\\\"How many cubes do want to store: 1, 2 or 3 \\\");\\n int choice = scanner.nextInt();\\n while (choice-- >0){\\n Shape object = new Shape();\\n object.objectPrompt();\\n shapes.add(object);\\n\\n /*\\n object.objectVolume();\\n int one = object.containerVolume();*/\\n }\\n\\n /*switch (choice){\\n case 1:\\n Shape shape1 = new Shape();\\n shape1.objectPrompt();\\n shape1.objectVolume();\\n int one = shape1.containerVolume();\\n break;\\n case 2:\\n Shape shape2 = new Shape();\\n shape2.objectPrompt();\\n shape2.objectVolume();\\n int two = shape2.containerVolume();\\n\\n Shape shape3 = new Shape();\\n shape3.objectPrompt();\\n shape3.objectVolume();\\n int one = shape1.containerVolume();\\n break;\\n\\n case 3:\\n Shape shape1 = new Shape();\\n shape1.objectPrompt();\\n shape1.objectVolume();\\n int one = shape1.containerVolume();\\n break;\\n default:\\n }*/\\n List<Integer> items=new ArrayList<>();\\n\\n for (Shape shape: shapes){\\n items.add(shape.containerVolume());\\n System.out.println(shape.containerVolume());\\n }\\n\\n\\n\\n //List<Integer> items = Arrays.asList(shapes.get(0).containerVolume());\\n //insert the bin capacity\\n // int binCapacity = 5;\\n CheckBin algorithm = new CheckBin(items, binCapacity);\\n algorithm.solvingBinPackingProblem();\\n algorithm.showResults();\\n // System.out.println(\\\"This is after committing\\\");\\n\\n\\n }\",\n \"public float getVolume() {\\n return 1.0f;\\n }\",\n \"void setVolume(float volume);\",\n \"public double getVolume()\\n {\\n return this.volume;\\n }\",\n \"Box(double len){\\r\\n Height = Width = Depth = len;\\r\\n\\r\\n }\",\n \"public long getPropertyVolumeUnity();\",\n \"void volume(double volume) {\\n execute(\\\"player.volume = \\\" + volume);\\n }\",\n \"public void setVolume(double area, double height) {\\n this.height = height;\\n }\",\n \"@Override\\r\\n\\tpublic float getVolume() {\\n\\t\\treturn 0;\\r\\n\\t}\",\n \"public int VolumeGet();\",\n \"double area() {\\nSystem.out.println(\\\"Inside Area for Rectangle.\\\");\\nreturn dim1 * dim2;\\n }\",\n \"public static double volumeOfSphere(double r) {\\n double v = 4.0 / 3.0 * Math.PI * Math.pow(r, 3);\\n v = (double) Math.round(v * 100) / 100;\\n return v;\\n }\",\n \"public abstract float surfaceArea();\",\n \"public double calcConeVolume(final double radius, final double height) {\\n\\n return ((1.0 / 3.0) * Math.PI * Math.pow(radius, 2) * height);\\n }\",\n \"double area() {\\nSystem.out.println(\\\"Inside Area for Rectangle.\\\");\\nreturn dim1 * dim2;\\n}\",\n \"private void calcBoxVerts() {\\n\\t\\tif (verts != null) {\\n\\t\\t\\tdouble minX = verts[0].getElement(0);\\n\\t\\t\\tdouble maxX = minX;\\n\\t\\t\\tdouble minY = verts[0].getElement(1);\\n\\t\\t\\tdouble maxY = minY;\\n\\t\\t\\tdouble minZ = verts[0].getElement(2);\\n\\t\\t\\tdouble maxZ = minZ;\\n\\t\\t\\tfor (int i = 1; i < verts.length; i++) {\\n\\t\\t\\t\\tif (verts[i].getElement(0) < minX) {\\n\\t\\t\\t\\t\\tminX = verts[i].getElement(0);\\n\\t\\t\\t\\t} else if (verts[i].getElement(0) > maxX) {\\n\\t\\t\\t\\t\\tmaxX = verts[i].getElement(0);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (verts[i].getElement(1) < minY) {\\n\\t\\t\\t\\t\\tminY = verts[i].getElement(1);\\n\\t\\t\\t\\t} else if (verts[i].getElement(1) > maxY) {\\n\\t\\t\\t\\t\\tmaxY = verts[i].getElement(1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (verts[i].getElement(2) < minZ) {\\n\\t\\t\\t\\t\\tminZ = verts[i].getElement(2);\\n\\t\\t\\t\\t} else if (verts[i].getElement(2) > maxZ) {\\n\\t\\t\\t\\t\\tmaxZ = verts[i].getElement(2);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tVector[] boxVerts = new Vector[8];\\n\\t\\t\\tboxVerts[0] = new Vector(3);\\n\\t\\t\\tboxVerts[0].setElements(new double[] {minX, minY, minZ});\\n\\t\\t\\tboxVerts[1] = new Vector(3);\\n\\t\\t\\tboxVerts[1].setElements(new double[] {maxX, minY, minZ});\\n\\t\\t\\tboxVerts[2] = new Vector(3);\\n\\t\\t\\tboxVerts[2].setElements(new double[] {minX, minY, maxZ});\\n\\t\\t\\tboxVerts[3] = new Vector(3);\\n\\t\\t\\tboxVerts[3].setElements(new double[] {maxX, minY, maxZ});\\n\\t\\t\\tboxVerts[4] = new Vector(3);\\n\\t\\t\\tboxVerts[4].setElements(new double[] {minX, maxY, minZ});\\n\\t\\t\\tboxVerts[5] = new Vector(3);\\n\\t\\t\\tboxVerts[5].setElements(new double[] {maxX, maxY, minZ});\\n\\t\\t\\tboxVerts[6] = new Vector(3);\\n\\t\\t\\tboxVerts[6].setElements(new double[] {minX, maxY, maxZ});\\n\\t\\t\\tboxVerts[7] = new Vector(3);\\n\\t\\t\\tboxVerts[7].setElements(new double[] {maxX, maxY, maxZ});\\n\\t\\t\\tthis.boxVerts = boxVerts;\\n\\t\\t} else {\\n\\t\\t\\tthis.boxVerts = null;\\n\\t\\t}\\n\\t}\",\n \"@Override\\n public double obtenerVolumen(){\\n return (1.0 / 3.0) * c.obtenerArea() * c.obtenerAltura();\\n }\",\n \"double getMaxVolume();\",\n \"public Vector3f getDimensions();\",\n \"ModuleComponent volume();\",\n \"Double volume() {\\n return execute(\\\"player.volume\\\");\\n }\",\n \"public double get_volume(double r,double h) {\\n\\t\\treturn (Math.PI)*r*r*h;\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7140493","0.7106524","0.70839554","0.702827","0.695058","0.695058","0.69346887","0.6922983","0.68704563","0.67770517","0.6730048","0.672721","0.67227536","0.6699203","0.6641555","0.6614941","0.6614265","0.6601639","0.656963","0.6501758","0.6449204","0.64032257","0.6399719","0.63813436","0.6380858","0.63699144","0.636345","0.63564634","0.6339787","0.6336862","0.63213277","0.63175416","0.6305426","0.63053024","0.62987906","0.62676936","0.6246072","0.6146217","0.6139385","0.61196935","0.60800314","0.60065466","0.6001584","0.59892255","0.59665453","0.59643865","0.59643865","0.5949907","0.5925356","0.59041506","0.590309","0.5889762","0.58853066","0.58853066","0.58847654","0.58737487","0.5822316","0.5813075","0.58096635","0.57736343","0.5769116","0.57643086","0.5743676","0.5730577","0.5706635","0.56866384","0.56722486","0.5663695","0.5653945","0.56527126","0.5644581","0.5637324","0.563163","0.56054896","0.5598004","0.5589167","0.5582326","0.5559747","0.55567205","0.5547873","0.5514509","0.55127245","0.55045766","0.5489038","0.54809105","0.5461527","0.54414815","0.5430821","0.5428609","0.5424942","0.54188937","0.5413763","0.54013234","0.53941566","0.539056","0.5386615","0.5384863","0.5384647","0.5384149","0.53707504","0.5362904"],"string":"[\n \"0.7140493\",\n \"0.7106524\",\n \"0.70839554\",\n \"0.702827\",\n \"0.695058\",\n \"0.695058\",\n \"0.69346887\",\n \"0.6922983\",\n \"0.68704563\",\n \"0.67770517\",\n \"0.6730048\",\n \"0.672721\",\n \"0.67227536\",\n \"0.6699203\",\n \"0.6641555\",\n \"0.6614941\",\n \"0.6614265\",\n \"0.6601639\",\n \"0.656963\",\n \"0.6501758\",\n \"0.6449204\",\n \"0.64032257\",\n \"0.6399719\",\n \"0.63813436\",\n \"0.6380858\",\n \"0.63699144\",\n \"0.636345\",\n \"0.63564634\",\n \"0.6339787\",\n \"0.6336862\",\n \"0.63213277\",\n \"0.63175416\",\n \"0.6305426\",\n \"0.63053024\",\n \"0.62987906\",\n \"0.62676936\",\n \"0.6246072\",\n \"0.6146217\",\n \"0.6139385\",\n \"0.61196935\",\n \"0.60800314\",\n \"0.60065466\",\n \"0.6001584\",\n \"0.59892255\",\n \"0.59665453\",\n \"0.59643865\",\n \"0.59643865\",\n \"0.5949907\",\n \"0.5925356\",\n \"0.59041506\",\n \"0.590309\",\n \"0.5889762\",\n \"0.58853066\",\n \"0.58853066\",\n \"0.58847654\",\n \"0.58737487\",\n \"0.5822316\",\n \"0.5813075\",\n \"0.58096635\",\n \"0.57736343\",\n \"0.5769116\",\n \"0.57643086\",\n \"0.5743676\",\n \"0.5730577\",\n \"0.5706635\",\n \"0.56866384\",\n \"0.56722486\",\n \"0.5663695\",\n \"0.5653945\",\n \"0.56527126\",\n \"0.5644581\",\n \"0.5637324\",\n \"0.563163\",\n \"0.56054896\",\n \"0.5598004\",\n \"0.5589167\",\n \"0.5582326\",\n \"0.5559747\",\n \"0.55567205\",\n \"0.5547873\",\n \"0.5514509\",\n \"0.55127245\",\n \"0.55045766\",\n \"0.5489038\",\n \"0.54809105\",\n \"0.5461527\",\n \"0.54414815\",\n \"0.5430821\",\n \"0.5428609\",\n \"0.5424942\",\n \"0.54188937\",\n \"0.5413763\",\n \"0.54013234\",\n \"0.53941566\",\n \"0.539056\",\n \"0.5386615\",\n \"0.5384863\",\n \"0.5384647\",\n \"0.5384149\",\n \"0.53707504\",\n \"0.5362904\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":38190,"cells":{"query":{"kind":"string","value":"This method may be used to add a specified percentage to the cost shown in a textfield (i.e: add colour print percentage to the cost of the box)"},"document":{"kind":"string","value":"public void addPercentageToCost(JTextField textField, double percent){\n\t\t//CardGrade Properties\t\t\n\t\tdouble origGradeCost = Double.valueOf(textField.getText());\n\t\t\n\t\tdouble sum = (origGradeCost * percent / 100) + origGradeCost; \n\n\t\tsum = Math.round(sum * 100);\n\t\tsum = sum/100;\n\t\t\n\t\ttextField.setText(String.valueOf(sum));\n\t}"},"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 percent()\n\t{\n\t\tDouble percent;\t\t//holds the right value percentage of the left value\n\t\tString newText = \"\";//Holds the updated text \n\t\tif(calc.getLeftValue ( ) != 0.0 && Fun != null)\n\t\t{\n\t\t\tsetRightValue();\n\t\t\tpercent = calc.getRightValue() * 0.01 * calc.getLeftValue();\n\t\t\tleftValue = calc.getLeftValue();\n\t\t\tnewText += leftValue;\n\t\t\tswitch (Fun)\n\t\t\t{\n\t\t\t\tcase ADD:\n\t\t\t\t\tnewText += \" + \";\n\t\t\t\t\tbreak;\n\t\t\t\tcase SUBTRACT:\n\t\t\t\t\tnewText += \" - \";\n\t\t\t\t\tbreak;\n\t\t\t\tcase DIVIDE:\n\t\t\t\t\tnewText += \" / \";\n\t\t\t\t\tbreak;\n\t\t\t\tcase MULTIPLY:\n\t\t\t\t\tnewText += \" * \";\n\t\t\t\t\tbreak;\n\t\t\t}//end switch\n\t\t\t\n\t\t\tnewText += \" \" + percent;\n\t\t\tentry.setText(newText);\n\t\t\t\n\t\t}//end if\n\t\t\n\t}","public void increasePrice(int percentage);","public void addPrice(float add) {\n price += add;\n totalPrizeLabel.setText(String.format(\"£%.02f\", price));\n }","private void updateStandard(){\n\n // calculate bill total with a ten percent tip\n double tenPercentTip = currentBillTotal * .1;\n double tenPercentTotal = currentBillTotal + tenPercentTip;\n // set tip10EditText's text to tenPercentTip\n tip10EditText.setText(String.format(getString(R.string.two_dec_float), tenPercentTip));\n //set total10EditText's text to tenPercentTotal\n total10EditText.setText(String.format(getString(R.string.two_dec_float), tenPercentTotal));\n\n // calculate bill total with a fifteen percent tip\n double fifteenPercentTip = currentBillTotal * .15;\n double fifteenPercentTotal = currentBillTotal + fifteenPercentTip;\n // set tip15EditText's text to fifteenPercentTip\n tip15EditText.setText(String.format(getString(R.string.two_dec_float), fifteenPercentTip));\n //set total15EditText's text to fifteenPercentTotal\n total15EditText.setText(String.format(getString(R.string.two_dec_float), fifteenPercentTotal));\n\n // calculate bill total with a twenty percent tip\n double twentyPercentTip = currentBillTotal * .20;\n double twentyPercentTotal = currentBillTotal + twentyPercentTip;\n // set tip20EditText's text to twentyPercentTip\n tip20EditText.setText(String.format(getString(R.string.two_dec_float), twentyPercentTip));\n //set total20EditText's text to twentyPercentTotal\n total20EditText.setText(String.format(getString(R.string.two_dec_float), twentyPercentTotal));\n\n }","public void updateTotalPrice(){\n\t\tBigDecimal discount = currentOrder.getDiscount();\n\t\tBigDecimal subtotal = currentOrder.getSubtotal();\n\t\tthis.subtotal.text.setText(CURR+subtotal.add(discount).toString());\n\t\tthis.discount.text.setText(CURR + discount.toString());\n\t\tthis.toPay.text.setText(CURR+subtotal.toString());\n\t}","public void changeSubtotalTextField()\n {\n Float subtotal = getSubtotal();\n if ( subtotal != -1f )\n {\n String newSubtotal = Utility.ToDollars(subtotal);\n subtotalTextField.setText(newSubtotal);\n }\n }","@Override\n public void actionPerformed(ActionEvent e) {\n payment = Float.parseFloat(txtPayment.getText());\n cashChange = String.valueOf(String.format(\"%.02f\", payment - finalTotal) );\n lblChange.setVisible(true);\n lblChange.setText(\"Change \" + \"£ \" + cashChange);\n btnPrint.setVisible(true);\n\n }","private void totalPrice() {\n double totalPrice;\n \n String stu = studentSubTotal.getText();\n stu = stu.substring(1);\n double stuTotal = Double.parseDouble(stu);\n\n String adult = adultSubTotal.getText();\n adult = adult.substring(1);\n double adultTotal = Double.parseDouble(adult);\n\n String senior = seniorSubTotal.getText();\n senior = senior.substring(1);\n double seniorTotal = Double.parseDouble(senior);\n\n totalPrice = stuTotal + adultTotal + seniorTotal;\n NumberFormat gbp = NumberFormat.getCurrencyInstance(Locale.UK);\n String totalStr = String.valueOf(gbp.format(totalPrice));\n totalPriceTextField.setText(totalStr);\n\n }","private void addToBalance(double aBalance) {\n balance += aBalance;\n String out = String.format(\"<html><b>Balance</b><br>$%.2f</html>\", balance);\n balanceLabel.setText(out);\n }","@FXML\r\n private void calculateButtonPressed(ActionEvent event) {\r\n try{\r\n BigDecimal amount = new BigDecimal(amountTextField.getText());\r\n BigDecimal tip = amount.multiply(tipPercentage);\r\n BigDecimal total = amount.add(tip);\r\n \r\n tipTextField.setText(currency.format(tip));\r\n totalTextField.setText(currency.format(total));\r\n }\r\n catch(NumberFormatException ex){\r\n amountTextField.setText(\"Enter amount\");\r\n amountTextField.selectAll();\r\n amountTextField.requestFocus();\r\n }\r\n }","public void calcVal(JLabel l){\n\t\tdouble total = 0;\n\t\tfor(int i = 0; i < coinList.size(); i++){\n\t\t\ttotal += coinList.get(i).getValue();\n\t\t}\n\t\tl.setText(\"Total Money: $\" + toPercent(total));\n\t}","static float addDiscount(float originalPrice, String discountName, float discountPercentage) {\n float discountedPrice = originalPrice * (1 - discountPercentage);\n float discount = discountedPrice - originalPrice;\n printEntry(discountName, discount);\n return discountedPrice;\n }","private void formatTxtPercentFocusLost(java.awt.event.FocusEvent evt) {//GEN-FIRST:event_formatTxtPercentFocusLost\n formatTxtPercent.setText(formatTxtPercent.getText() + \"%\");\n }","public void adjustPay(double percentage){\r\n this.commission = getCommission() + getCommission() * percentage;\r\n }","@Override\n public double calculatePercentageExtra() {\n double percentageExtra = 0;\n \n percentageExtra += getTwoColourCost();\n \n if(getChemicalResistance()) {\n percentageExtra += getChemicalResistanceCost();\n }\n \n return percentageExtra;\n }","public void calcPrecioTotal() {\n try {\n float result = precioUnidad * Float.parseFloat(unidades.getText().toString());\n prTotal.setText(String.valueOf(result) + \"€\");\n }catch (Exception e){\n prTotal.setText(\"0.0€\");\n }\n }","private void formatTxtPercentFocusGained(java.awt.event.FocusEvent evt) {//GEN-FIRST:event_formatTxtPercentFocusGained\n lbFormat.setText(\"Enter number!\");\n formatTxtPercent.setText(\"\");\n }","private void setDiscountedPrice() {\n seekbarNewprice.setOnSeekBarChangeListener(new SeekBar.OnSeekBarChangeListener() {\n @Override\n public void onProgressChanged(SeekBar seekBar, int progress, boolean fromUser) {\n tvDiscountPerc.setText(progress * 5 + \"%\");\n try {\n double originalPrice = Double.parseDouble(etOriginalPrice.getText().toString());\n double sp = (progress * 5 * originalPrice) / 100;\n\n tvNewPrice.setText(String.format(Locale.US, \"%.2f\", originalPrice - sp));\n } catch (NumberFormatException ne) {\n ne.printStackTrace();\n }\n }\n\n @Override\n public void onStartTrackingTouch(SeekBar seekBar) {\n\n }\n\n @Override\n public void onStopTrackingTouch(SeekBar seekBar) {\n\n }\n });\n }","public void printCost() {\r\n double cost;\r\n cost = quantity * price;\r\n System.out.printf(\"Total cost = $%.2f\", cost);\r\n }","double setCost(double cost);","private void makeFormattedTextField(){\n textField = new JTextField(\"\"+ShapeFactory.getRoundness(), 3);\n //add listener that happens after each type and make the field accept only numbers between 0 to 100\n textField.addKeyListener(new KeyAdapter() {\n @Override\n public void keyTyped(KeyEvent e) {\n super.keyTyped(e);\n typeEvent(e);\n }\n });\n }","private void trataDesconto(String x){\n \n Double sub;\n \n descontoField.setText(porcentagem.format((Double.parseDouble(x))/100));\n descontoField.setEnabled(true);\n sub = retornaSubTotal(this.getVlrTotalItem(), Double.parseDouble(x));\n subTotalField.setText(moeda.format(sub));\n lblTotalGeral.setText(subTotalField.getText());\n this.setVlrTotalItem(sub);\n}","public void tvqTax() {\n TextView tvqView = findViewById(R.id.checkoutPage_TVQtaxValue);\n tvqTaxTotal = beforeTaxTotal * 0.09975;\n tvqView.setText(String.format(\"$%.2f\", tvqTaxTotal));\n }","void setCost(double cost);","void calcAmount(double amountEntered, double costAmount){\n double changeAmount ;\n if(amountEntered >= costAmount){\n changeAmount = amountEntered - costAmount;\n myTextView.setText(\"Please take your change = R\"+ changeAmount + \"\\n\"+ \"Thank you!!\"+\"\\nTravel safe!!\");\n }else{\n changeAmount = amountEntered - costAmount;\n myTextView.setText(\"You still owe R\" + Math.abs(changeAmount)+ \" \\nplease pay now!!\");\n }\n }","public void updateFuelUsed(double fuel) {\r\n\t\tfuelUsed.setText(\"Fuel Used (L): \" + BigDecimal.valueOf(fuel).setScale(2, RoundingMode.HALF_UP));\r\n\t\t\r\n\t}","private void updateSubtotal() {\n subtotal = entreePrice + drinkPrice + dessertPrice;\n subtotalEdtTxt.setText(String.format(\"$%.2f\", subtotal));\n }","public void calculateAmount() {\n totalAmount = kurv.calculateTotalAmount() + \" DKK\";\n headerPrice.setText(totalAmount);\n }","public double returnBoxCost(double cardGradeCost, double colourOptPercent, double reinfPercent, double sealablePercent){\n\t\tdouble sum = cardGradeCost + ((cardGradeCost * colourOptPercent) / 100) + ((cardGradeCost * reinfPercent) / 100)\n\t\t\t\t+ ((cardGradeCost * sealablePercent) / 100); \n\t\tdouble computeTotal = 0.00;\n\t\t\n\t\tDecimalFormat df = new DecimalFormat(\"##.##\");\t\n\t\t\n\t\ttry{\n\t\t\tcomputeTotal = Double.valueOf(df.format(sum));\n\t\t\t}catch(NumberFormatException nme){\n\t\t\t\t\n\t\t\t}\n\t\treturn computeTotal;\n\t}","private void updateCustom(){\n\n // sets customTipTextView's text to match the position of the SeekBar\n customTipTextView.setText(currentCustomPercent + getString(R.string.percent_sign));\n\n // calculate the custom tip amount\n double customTipAmount = currentBillTotal * currentCustomPercent * .01;\n\n // calculate the total bill including the custom tip\n double customTotalAmount = currentBillTotal + customTipAmount;\n\n // display the tip and total bill amounts\n tipCustomEditText.setText(String.format(getString(R.string.two_dec_float), customTipAmount));\n totalCustomEditText.setText(String.format(getString(R.string.two_dec_float), customTotalAmount));\n }","public void calcular(View view) {\n int quilos = Integer.valueOf(editTextQuantidade.getText().toString());\n int total = (quilos *1000)/500;\n \n String message = \"Com \" + quilos + \"kg de chocolate da para fazer \" + total + \" ovos de 500g.\";\n textViewTotal.setText(message);\n }","private void updateWeightTextFieldToStored(String errorMsg)\n {\n SpriteGrader spriteGrader = (SpriteGrader) context\n .getComponent(SpriteGrader.MODULE_NAME);\n if (spriteGrader != null)\n {\n // update the weight text box\n weightTextField.setText(String.format(\"%5.3f\",\n spriteGrader.getWeightFrom0To1()));\n }\n else\n {\n System.out.println(\"Cannot open the Sprite Grader \"\n + \"Weighted Component in gui.\");\n\n weightTextField.setText(errorMsg);\n }\n }","private void setTipPercentage(){\n System.out.println(\"You indicated the service quality was \"+\n serviceQuality+\". What percentage tip would you like to leave?\");\n tipRate=keyboard.nextDouble();\n \n \n }","public void onclickpercent(View v){\n Button b = (Button) v;\n String temp;\n double t;\n String y;\n displayscreen = screen.getText().toString();\n displayscreen2 = screen2.getText().toString();\n if (displayscreen.equals(\"\") && displayscreen2.equals(\"\")) //handle if display is empty\n return;\n else if (displayscreen.equals(\"\") && !displayscreen2.equals(\"\")) {\n temp = screen2.getText().toString();\n if (temp.contains(\"+\") || temp.contains(\"-\") || temp.contains(\"x\") || temp.contains(\"÷\")){ //handle if user inserts only operators\n return;}\n t = Double.valueOf(temp) /100.0;\n y=df2.format(t);\n screen.setText(y);\n String z=\"%\";\n screen2.setText(temp+z);\n }\n else\n {\n temp = screen.getText().toString();\n t = Double.valueOf(temp) /100.0;\n y=df2.format(t);\n screen.setText(y);\n String z=\"%\";\n screen2.setText(temp+z);\n }\n }","public void updateTotalSpentLabel() {\n totalSpentLabel.setText(\"Total: $\" + duke.expenseList.getTotalAmount());\n }","public void addFuel(double fuelToAdd){\n\n fuelRemaining = fuelRemaining + fuelToAdd;\n }","private void calcPrice() {\n double itemPrice = 0;\n \n //get price of burger (base)\n if (singleRad.isSelected())\n {\n itemPrice = 3.50;\n }\n else \n {\n itemPrice = 4.75;\n }\n \n //check options add to item price\n if(cheeseCheckbox.isSelected())\n itemPrice = itemPrice += 0.50;\n if(baconCheckbox.isSelected())\n itemPrice = itemPrice += 1.25;\n if(mealCheckbox.isSelected())\n itemPrice = itemPrice += 4.00;\n \n //include the quantity for the item price\n int quantity= 1;\n if (quantityTextField.getText().equals(\"\"))\n quantityTextField.setText(\"1\");\n quantity = Integer.parseInt(quantityTextField.getText());\n itemPrice = itemPrice * quantity;\n\n \n //show the price no $ symbol\n \n itemPriceTextField.setText(d2.format(itemPrice));\n }","@Override\n\t\t\tpublic void insertUpdate(DocumentEvent e) {\n\t\t\t\tvmvcpumhztotalsize.setText(getVmvcpumhztotal(vmvcpumhztxt.getText(),\n\t\t\t\t\t\tvmvcpucombo.getSelectedItem().toString(), vmvcpumhzoverheadcombo.getSelectedItem().toString()));\n\n\t\t\t}","private void plusQuantity(TextField source, Clothing clothing) {\n clothing.setCount(1);\n int quantity = clothing.getCount();\n double totalPriceOfClothing = 0;\n\n for (int i = 0; i < clothingArrayList.size(); i++) {\n double countOfItems = clothingArrayList.get(i).getCount();\n double clothingPricePerUnit = Double.valueOf(clothingArrayList.get(i).getPrice());\n totalPriceOfClothing += countOfItems * clothingPricePerUnit;\n\n }\n source.setText(\"\" + (quantity));\n totalPrices.setText(\"\" + totalPriceOfClothing);\n\n totalPrice.textProperty().bind(totalPrices.textProperty());\n }","double updateValue(double value, double percentage){\n\t\treturn value+=(value*(.01*percentage));\r\n\t}","public void totalprice(float tprice)\n {\n \t this.mTotalPrice=tprice;\n }","public void tpsTax() {\n TextView tpsView = findViewById(R.id.checkoutPage_TPStaxValue);\n tpsTaxTotal = beforeTaxTotal * 0.05;\n tpsView.setText(String.format(\"$%.2f\", tpsTaxTotal));\n }","private void updateTotal() {\n int total = table.getTotal();\n vip.setConsumption(total);\n if (total > 0)\n payBtn.setText(PAY + RMB + total);\n else if (total == 0)\n payBtn.setText(PAY);\n }","private void Button_PercentActionPerformed(java.awt.event.ActionEvent evt) {//GEN-FIRST:event_Button_PercentActionPerformed\n // TODO add your handling code here:\n }","public void updateScoreCard(){\n scoreCard.setText(correct+\"/\"+total);\n }","public void calcularTotal() {\n double valor = 0;\n String servico = (String)consultaSelecionada.getSelectedItem().toString();\n switch(servico) {\n case \"Consulta\":\n valor += 100;\n break;\n case \"Limpeza\":\n valor += 130;\n break;\n case \"Clareamento\":\n valor += 450;\n break;\n case \"Aparelho\":\n valor += 100;\n break;\n case \"Raio-x\":\n valor += 80;\n break;\n case \"Cirurgia\":\n valor += 70;\n break;\n }\n Total.setText(String.valueOf(valor));\n }","@Override\n\t\t\tpublic void actionPerformed(ActionEvent e) {\n\t\t\t\tint a = Integer.parseInt(field.getText());\n\t\t\t\tint b = Integer.parseInt(field2.getText());\n\t\t\t\tint c = a+b;\n\t\t\t\tlabel.setText(\"Value is: \" + c);\n\t\t\t}","public void calculateScore(){\n\n score.setText(Integer.toString(80));\n\n\n }","public void operation() {\n\t\t\n\t\tswitch(calculation){\n\t\t\tcase 1:\n\t\t\t\ttotal = num + Double.parseDouble(textField.getText());\n\t\t\t\ttextField.setText(Double.toString(total));\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\tcase 2:\n\t\t\t\ttotal = num - Double.parseDouble(textField.getText());\n\t\t\t\ttextField.setText(Double.toString(total));\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\tcase 3:\n\t\t\t\ttotal = num * Double.parseDouble(textField.getText());\n\t\t\t\ttextField.setText(Double.toString(total));\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\tcase 4:\n\t\t\t\ttotal = num / (Double.parseDouble(textField.getText()));\n\t\t\t\ttextField.setText(Double.toString(total));\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t}\n\t}","private void calculateCosts() {\r\n lb_CubicSum.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_Volume)) + \" €\");\r\n lb_MaterialCostSum.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_Price)) + \" €\");\r\n lb_CuttingTimeSum.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_CuttingHours)) + \" €\");\r\n lb_CuttingCostSum.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_CuttingPrice)) + \" €\");\r\n lb_TotalCosts.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_CuttingPrice) + getColmunSum(tc_Price)) + \" €\");\r\n\r\n ModifyController.getInstance().setProject_constructionmaterialList(Boolean.TRUE);\r\n }","public void buttonPercent(View v){\n expressionView.setText(expressionView.getText() + \"%\");\n calculate();\n }","private void updateHubHelps(BoundedRangeModel subModel , JLabel component) {\n DecimalFormat df = new DecimalFormat(\"#00.00\");\n float prc_current = (float)subModel.getValue() / (float)( subModel.getMaximum() - subModel.getMinimum() ) * 100f;\n float prc_total = this.hub.getWeight( this.hub.indexOf( subModel ) ) / this.hub.getTotalWeight() * 100f;\n component.setText( df.format(prc_current) + \" % of \" + df.format(prc_total) + \" %\" );\n }","public double getCost() \n { \n return super.getCost() +22;\n }","private void updatePriceLabel(double aPrice) {\n price = aPrice;\n String out = String.format(\"<html><b>Price</b><br>$%.2f</html>\", price);\n priceLabel.setText(out);\n }","public void afterTax() {\n TextView afterView = findViewById(R.id.checkoutPage_afterTaxValue);\n afterTaxTotal = beforeTaxTotal + tpsTaxTotal + tvqTaxTotal;\n afterView.setText(String.format(\"$%.2f\", afterTaxTotal));\n }","public void calculate(View v) {\n EditText inputBill = findViewById(R.id.inputBill);\n EditText inputTipPercent = findViewById(R.id.inputTipPercent);\n String num1Str = inputBill.getText().toString();\n String num2Str = inputTipPercent.getText().toString();\n\n // multiply Bill by Tip to get Tip in dollars\n double num1 = Double.parseDouble(num1Str);\n double num2 = Double.parseDouble(num2Str);\n double tipInDollar = num1 * (num2 / 100);\n double total = num1 + tipInDollar;\n\n // show tip in dollars\n TextView lblTipAmount = findViewById(R.id.lblTipAmount);\n lblTipAmount.setText(String.valueOf(tipInDollar));\n\n // show total price with tip included\n TextView lblTotalAmount = findViewById(R.id.lblTotalAmount);\n lblTotalAmount.setText(String.valueOf(total));\n }","@FXML\r\n private void addPoints() {\r\n if (diffPoint > 0) {\r\n int f1 = Integer.parseInt(strength.getText());\r\n int f2 = f1 + 1;\r\n strength.setText(String.valueOf(f2));\r\n diffPoint--;\r\n point.setText(\"You have \" + diffPoint + \" points\");\r\n }\r\n }","private void jButton1ActionPerformed(java.awt.event.ActionEvent evt) {\n mid = Mid.getText();\n bid=Bid.getText();\n days=Integer.parseInt(late.getText());\n if(days > 1 && days <10)\n {\n Fine= 50.0;\n }\n else if( days >10 && days <20)\n {\n Fine=100.0;\n \n \n }\n else if(days >20 && days < 30)\n {\n Fine = 200.0;\n }\n else\n {\n Fine= 0.0;\n }\n Fine=Fine*days;\n add();\n // fine.setText(fine.getText( Fine));\n }","public void addQuantity()\n {\n int quantity = Integer.parseInt(quantityTextField.getText());\n quantity++;\n quantityTextField.setText(\"\" + quantity);\n\n changeSubtotalTextField();\n }","public void setMaxTotalCost(int amount);","@Override\n\tprotected void setCost(double cst) {\n\t\t\n\t}","@Override\n public void actionPerformed(ActionEvent actionEvent) {\n total = total * amount3;\n String.valueOf(total);\n //displaying what user chose\n JOptionPane.showMessageDialog(null, total + \" seconds \" + nameItem +\" \"+ amount3 );\n }","@Override\n public void formJisuan(double sum) {\n cart_frag_xiaoji.setText(\"小计：￥\" + sum);\n cart_frag_price.setText(\"￥\" + sum);\n }","public void getPaintPrice(){\n System.out.println(\"Enter the price per gallon of paint: \");\n this.pricePerGallon = INPUT.nextDouble();\n }","@Override\n\t\t\tpublic void actionPerformed(ActionEvent e) {\n\t\t\t\tvmvcpumhztotalsize.setText(getVmvcpumhztotal(vmvcpumhztxt.getText(),\n\t\t\t\t\t\tvmvcpucombo.getSelectedItem().toString(), vmvcpumhzoverheadcombo.getSelectedItem().toString()));\n\n\t\t\t}","@Override\n\t\t\tpublic void actionPerformed(ActionEvent e) {\n\t\t\t\tvmvcpumhztotalsize.setText(getVmvcpumhztotal(vmvcpumhztxt.getText(),\n\t\t\t\t\t\tvmvcpucombo.getSelectedItem().toString(), vmvcpumhzoverheadcombo.getSelectedItem().toString()));\n\n\t\t\t}","@Override\n\t\t\tpublic void actionPerformed(ActionEvent e) {\n\t\t\t\tvmvcpumhztotalsize.setText(getVmvcpumhztotal(vmvcpumhztxt.getText(),\n\t\t\t\t\t\tvmvcpucombo.getSelectedItem().toString(), vmvcpumhzoverheadcombo.getSelectedItem().toString()));\n\n\t\t\t}","public void getTip(View v)\n {\n EditText billEditText = (EditText) findViewById(R.id.billEditText);\n EditText percentEditText = (EditText) findViewById(R.id.percentEditText);\n TextView tipTextView = (TextView) findViewById(R.id.tipTextView);\n TextView totalTextView = (TextView) findViewById(R.id.totalTextView);\n\n //get the values from the EditText boxes and convert them to double data types\n double bill = Double.parseDouble(billEditText.getText().toString());\n double percent = Double.parseDouble(percentEditText.getText().toString());\n //double total = Double.parseDouble(totalTextView.getText().toString());\n\n //calculate tip\n percent = percent/100;\n double tip = bill*percent;\n double total = bill + tip;\n\n tipTextView.setText(\"Tip: \" + tip);\n totalTextView.setText(\"Total: \" + total);\n\n\n\n\n }","private void onBasketTotalChanged(String total){\n binding.textViewTotalValue.setText(String.format(\"$%s\", total));\n }","@Override\n public void changed(ObservableValue<? extends Number> observable, Number oldValue, Number newValue) {\n DecimalFormat df = new DecimalFormat(\"#.#\");\n df.setRoundingMode(RoundingMode.HALF_UP);\n cogInput.setText(df.format(newValue));\n }","private void updateBalanceLabel() {\n balanceLabel.setText(String.format(\"<html><b>Balance</b><br>$%.2f</html>\", balance));\n }","@Override\n\t\t\tpublic boolean onEditorAction(TextView v, int actionId, KeyEvent event) {\n\t\t\t\ttip_perc.setText(\"Tip: \"+String.valueOf(tip_percentage)+\" %\");\n\t\t\t\tint tip_dollar = calculateTip(tip_percentage, Integer.parseInt(ed.getText().toString()));\n\t\t\t\ttotal_val=Integer.parseInt(ed.getText().toString())+tip_dollar;\n\t\t\t\ttip.setText(\"Tip: \"+String.valueOf(tip_dollar));\n\t\t\t\ttotal.setText(\"Total: \" + String.valueOf(total_val));\n\t\t\t\treturn false;\n\t\t\t}","private void calculateEarnings()\n {\n // get user input\n int items = Integer.parseInt( itemsSoldJTextField.getText() );\n double price = Double.parseDouble( priceJTextField.getText() );\n Integer integerObject = \n ( Integer ) commissionJSpinner.getValue();\n int commissionRate = integerObject.intValue();\n \n // calculate total sales and earnings\n double sales = items * price;\n double earnings = ( sales * commissionRate ) / 100;\n \n // display the results\n DecimalFormat dollars = new DecimalFormat( \"$0.00\" );\n grossSalesJTextField.setText( dollars.format( sales ) );\n earningsJTextField.setText( dollars.format( earnings ) );\n\n }","public double returnBoxCost(double cardGradeCost, double colourOptPercent, double reinfPercent, double sealablePercent, int qty, double length, double width, double height){\n\t\tdouble sum = cardGradeCost + (cardGradeCost * colourOptPercent / 100) + (cardGradeCost * reinfPercent / 100)\n\t\t\t\t+ (cardGradeCost * sealablePercent / 100); \n\t\t\n\t\tdouble computeTotal = 0;\n\t\tDecimalFormat df = new DecimalFormat(\"##.##\");\n\t\ttry{\n\t\t\tcomputeTotal = Double.valueOf(calcSurfaceAreaOfBox(length, width, height, sum, qty));\n\t\t\n\t\t\treturn Double.valueOf(df.format(computeTotal));\n\t\t\n\t\t}catch(NumberFormatException nme){\n\t\t\treturn 0.00;\n\t\t}\n\t}","public void actionPerformed(ActionEvent arg0) {\n\t\t\t\t\t\t\tif( txt_showresult.getText().equals( \"0\" )){ \n\t\t\t\t\t\t\t\ttxt_showresult.setText(\"6\");\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t// if textfield show other value , add number after the value\n\t\t\t\t\t\t\telse{\n\t\t\t\t\t\t\ttxt_showresult.setText( txt_showresult.getText() + \"6\");\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}","@Override\n\tpublic void widgetSelected(SelectionEvent e) {\n\t\tint i = typecombo.getSelectionIndex();\n\t\tif(i == 0){\n\t\t\tcosttext.setText(\"3元\");\n\t\t}\n\t\telse if(i == 1){\n\t\t\tcosttext.setText(\"5元\");\n\t\t}\n\t}","private void percentageScaling() {\n switch (slot) {\n case Torso -> updateBonusStats(1);\n case Head -> updateBonusStats(0.8);\n case Legs -> updateBonusStats(0.6);\n }\n }","public void calcAction(View v) \n\t{\n\t\ttry\n\t\t{\n\t\t\tString initial = size.getText().toString(); /* the following gets user input, in order to do calculations */\n\t\t\tString end = \"Nothing\"; /* This is the default text in case the unexpected happens */\n\t\t\tunit = selection.getSelectedItem().toString(); /* this gets the unit of measure that the user specifies */\n\t\tdouble convert = Double.parseDouble(initial); /* this converts the size input to numerical data, in order for calculations to be done */\n\t\t\tcapacity.setStorage(convert); /* send input to external class */\n\t\t\tDecimalFormat twop = new DecimalFormat(\"#.##\"); /* created new object, in order to format output to display two decimal places at most */\n\n\t\t\t/* the following conditional statement reads the unit of measure specify by the user, puts the data into the proper formula, and returns the results */\n\n\t\t\tif (unit.equals(\"KB\")) // runs if user specifies KB\n\t\t\t{\n\t\t\t\tend = twop.format(capacity.getKB());\n\t\t\t}\n\n\t\t\telse if (unit.equals(\"MB\")) /* runs if user specifies MB */\n\t\t\t{\n\t\t\t\tend = twop.format(capacity.getMB());\n\t\t\t}\n\n\t\t\telse if (unit.equals(\"GB\")) /* runs if user specifies GB */\n\t\t\t{\n\t\t\t\tend = twop.format(capacity.getGB());\n\t\t\t}\n\n\t\t\telse if (unit.equals(\"TB\")) /* runs if user specifies TB */\n\t\t\t{\n\t\t\t\tend = twop.format(capacity.getTB());\n\t\t\t}\n\n\t\t\telse if (unit.equals(\"PB\")) /* runs if user specifies PB */\n\t\t\t{\n\t\t\t\tend = twop.format(capacity.getPB());\n\t\t\t}\n\n\t\t\telse if (unit.equals(\"EB\")) /* runs if user specifies EB */\n\t\t\t{\n\t\t\t\tend = twop.format(capacity.getEB());\n\t\t\t}\n\n\t\t\telse if (unit.equals(\"ZB\")) /* runs if user specifies ZB */\n\t\t\t{\n\t\t\t\tend = twop.format(capacity.getZB());\n\t\t\t}\n\n\t\t\telse if (unit.equals(\"YB\")) /* runs if user specifies YB */\n\t\t\t{\n\t\t\t\tend = twop.format(capacity.getYB());\n\t\t\t}\n\n\t\t\telse; // send default text, if unexpected happens.\n\n\t\t\tresult.setText(end); // display results\n\t\t}\n\n\t\tcatch (NumberFormatException e)\n\t\t{\n\t\t\tAlertDialog.Builder m = new AlertDialog.Builder(this);\n\t\t\tm.setTitle(R.string.error); // set dialog title\n\t\t\tm.setMessage(R.string.error_message).setCancelable(true).setPositiveButton(R.string.ok, new DialogInterface.OnClickListener()\n\t\t\t{\n\t\t\t\tpublic void onClick(DialogInterface dialog, int id)\n\t\t\t\t{\n\t\t\t\t\tdialog.cancel();\n\t\t\t\t}\n\t\t\t});\n\t\t\tm.create();\n\t\t\tm.show();\n\t\t}\t\n\t}","public void calcPrice() {\r\n\t\tsuper.price = 3 * super.height;\r\n\t}","@Override\n\t\tpublic void onTextChanged(CharSequence s, int start, int before, int count) {\n\t\t\ttry{\n\t\t\t\tbillAmount = Double.parseDouble(s.toString()) / 100.0;\n\t\t\t}\n\t\t\tcatch(NumberFormatException e)\n\t\t\t{\n\t\t\t\tbillAmount = 0.0;\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\tamountDisplayTextView.setText(currencyFormat.format(billAmount));\n\t\t\tupdateStandard();\n\t\t\tupdateCustom();\n\t\t}","public void setCost(double value) {\n this.cost = value;\n }","public void amount() {\n \t\tfloat boxOHamt=boxOH*.65f*48f;\n \t\tSystem.out.printf(boxOH+\" boxes of Oh Henry ($0.65 x 48)= $%4.2f \\n\",boxOHamt);\n \t\tfloat boxCCamt=boxCC*.80f*48f;\n \t\tSystem.out.printf(boxCC+\" boxes of Coffee Crisp ($0.80 x 48)= $%4.2f \\n\", boxCCamt);\n \t\tfloat boxAEamt=boxAE*.60f*48f;\n \t\tSystem.out.printf(boxAE+\" boxes of Aero ($0.60 x 48)= $%4.2f \\n\", boxAEamt);\n \t\tfloat boxSMamt=boxSM*.70f*48f;\n \t\tSystem.out.printf(boxSM+\" boxes of Smarties ($0.70 x 48)= $%4.2f \\n\", boxSMamt);\n \t\tfloat boxCRamt=boxCR*.75f*48f;\n \t\tSystem.out.printf(boxCR+\" boxes of Crunchies ($0.75 x 48)= $%4.2f \\n\",boxCRamt);\n \t\tSystem.out.println(\"----------------------------------------------\");\n \t\t//display the total prices\n \t\tsubtotal=boxOHamt+boxCCamt+boxAEamt+boxSMamt+boxCRamt;\n \t\tSystem.out.printf(\"Sub Total = $%4.2f \\n\", subtotal);\n \t\ttax=subtotal*.07f;\n \t\tSystem.out.printf(\"Tax = $%4.2f \\n\", tax);\n \t\tSystem.out.println(\"==============================================\");\n \t\ttotal=subtotal+tax;\n \t\tSystem.out.printf(\"Amount Due = $%4.2f \\n\", total);\n \t}","public void actionPerformed(ActionEvent event) {\n // it is a digit or decimal point\n JButton source = (JButton) event.getSource();\n String label = source.getText();\n // don't add two decimal points\n if (label.equals(\".\") && display.getText().indexOf(\".\") != -1) {\n return;\n }\n display.setText(display.getText() + label);\n }","Builder withAutoCompactFillRate(int percentage);","public void addMoney(double profit){\n money+=profit;\n }","public Price percentage(Float percentage) {\n this.percentage = percentage;\n return this;\n }","public void calculateAndDisplay() {\n fromUnitString = fromUnitEditText.getText().toString();\r\n if (fromUnitString.equals(\"\")) {\r\n fromValue = 0;\r\n }\r\n else {\r\n fromValue = Float.parseFloat(fromUnitString);\r\n }\r\n\r\n // calculate the \"to\" value\r\n toValue = fromValue * ratio;\r\n\r\n // display the results with formatting\r\n NumberFormat number = NumberFormat.getNumberInstance();\r\n number.setMaximumFractionDigits(2);\r\n number.setMinimumFractionDigits(2);\r\n toUnitTextView.setText(number.format(toValue));\r\n }","public void addCost(int amount) {\n\t\tcost = amount;\n\t}","double setEstimatedCost(double cost);","@Override\r\n\tpublic void addToCost() {\n\t\t\r\n\t}","void setDiscount(float sconto);","private void peso(){\r\n if(getPeso()>80){\r\n precioBase+=100;\r\n }\r\n else if ((getPeso()<=79)&&(getPeso()>=50)){\r\n precioBase+=80;\r\n }\r\n else if ((getPeso()<=49)&&(getPeso()>=20)){\r\n precioBase+=50;\r\n }\r\n else if ((getPeso()<=19)&&(getPeso()>=0)){\r\n precioBase+=10;\r\n }\r\n }","public void donutTypeChosen()\n {\n changeSubtotalTextField();\n }","public void setScore(String str){\r\n formattedTextField1.setText(str);\r\n }","@Override\n public void actionPerformed(ActionEvent actionEvent) {\n total = total * amount2;\n String.valueOf(total);\n //displaying what user chose\n JOptionPane.showMessageDialog(null, total + \" seconds \" + nameItem +\" \"+ amount2 );\n }","public void actionPerformed(ActionEvent arg0) {\n\t\t\t\t\t\t\tif( txt_showresult.getText().equals( \"0\" )){ \n\t\t\t\t\t\t\t\ttxt_showresult.setText(\"8\");\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t// if textfield show other value , add number after the value\n\t\t\t\t\t\t\telse{\n\t\t\t\t\t\t\ttxt_showresult.setText( txt_showresult.getText() + \"8\");\n\t\t\t\t\t\t\t}\t\n\t\t\t\t\t\t}","public void actionPerformed(ActionEvent arg0) {\n\t\t\t\t\t\t\tif( txt_showresult.getText().equals( \"0\" )){ \n\t\t\t\t\t\t\t\ttxt_showresult.setText(\"5\");\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t// if textfield show other value , add number after the value\n\t\t\t\t\t\t\telse{\n\t\t\t\t\t\t\ttxt_showresult.setText( txt_showresult.getText() + \"5\");\n\t\t\t\t\t\t\t}\t\n\t\t\t\t\t\t}","private void sumaApostado() {\n\t\tapostado.set(apostado.get() + 1.0);\n\t\tdiruField.setText(String.format(\"%.2f\", apostado.get()));\n\t\tactualizaPremio();\n\t}","public void actionPerformed(ActionEvent arg0) {\n\t\t\t\t\t\t\tif( txt_showresult.getText().equals( \"0\" )){ \n\t\t\t\t\t\t\t\ttxt_showresult.setText(\"9\");\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\t// if textfield show other value , add number after the value\n\t\t\t\t\t\t\telse{\n\t\t\t\t\t\t\ttxt_showresult.setText( txt_showresult.getText() + \"9\");\n\t\t\t\t\t\t\t}\t\t\n\t\t\t\t\t\t}","public void setPricePerSquareFoot(double newPricePerSquareFoot){\nif(newPricePerSquareFoot > 0){\npricePerSquareFoot = newPricePerSquareFoot;\n}\n}"],"string":"[\n \"private void percent()\\n\\t{\\n\\t\\tDouble percent;\\t\\t//holds the right value percentage of the left value\\n\\t\\tString newText = \\\"\\\";//Holds the updated text \\n\\t\\tif(calc.getLeftValue ( ) != 0.0 && Fun != null)\\n\\t\\t{\\n\\t\\t\\tsetRightValue();\\n\\t\\t\\tpercent = calc.getRightValue() * 0.01 * calc.getLeftValue();\\n\\t\\t\\tleftValue = calc.getLeftValue();\\n\\t\\t\\tnewText += leftValue;\\n\\t\\t\\tswitch (Fun)\\n\\t\\t\\t{\\n\\t\\t\\t\\tcase ADD:\\n\\t\\t\\t\\t\\tnewText += \\\" + \\\";\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tcase SUBTRACT:\\n\\t\\t\\t\\t\\tnewText += \\\" - \\\";\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tcase DIVIDE:\\n\\t\\t\\t\\t\\tnewText += \\\" / \\\";\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tcase MULTIPLY:\\n\\t\\t\\t\\t\\tnewText += \\\" * \\\";\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t}//end switch\\n\\t\\t\\t\\n\\t\\t\\tnewText += \\\" \\\" + percent;\\n\\t\\t\\tentry.setText(newText);\\n\\t\\t\\t\\n\\t\\t}//end if\\n\\t\\t\\n\\t}\",\n \"public void increasePrice(int percentage);\",\n \"public void addPrice(float add) {\\n price += add;\\n totalPrizeLabel.setText(String.format(\\\"£%.02f\\\", price));\\n }\",\n \"private void updateStandard(){\\n\\n // calculate bill total with a ten percent tip\\n double tenPercentTip = currentBillTotal * .1;\\n double tenPercentTotal = currentBillTotal + tenPercentTip;\\n // set tip10EditText's text to tenPercentTip\\n tip10EditText.setText(String.format(getString(R.string.two_dec_float), tenPercentTip));\\n //set total10EditText's text to tenPercentTotal\\n total10EditText.setText(String.format(getString(R.string.two_dec_float), tenPercentTotal));\\n\\n // calculate bill total with a fifteen percent tip\\n double fifteenPercentTip = currentBillTotal * .15;\\n double fifteenPercentTotal = currentBillTotal + fifteenPercentTip;\\n // set tip15EditText's text to fifteenPercentTip\\n tip15EditText.setText(String.format(getString(R.string.two_dec_float), fifteenPercentTip));\\n //set total15EditText's text to fifteenPercentTotal\\n total15EditText.setText(String.format(getString(R.string.two_dec_float), fifteenPercentTotal));\\n\\n // calculate bill total with a twenty percent tip\\n double twentyPercentTip = currentBillTotal * .20;\\n double twentyPercentTotal = currentBillTotal + twentyPercentTip;\\n // set tip20EditText's text to twentyPercentTip\\n tip20EditText.setText(String.format(getString(R.string.two_dec_float), twentyPercentTip));\\n //set total20EditText's text to twentyPercentTotal\\n total20EditText.setText(String.format(getString(R.string.two_dec_float), twentyPercentTotal));\\n\\n }\",\n \"public void updateTotalPrice(){\\n\\t\\tBigDecimal discount = currentOrder.getDiscount();\\n\\t\\tBigDecimal subtotal = currentOrder.getSubtotal();\\n\\t\\tthis.subtotal.text.setText(CURR+subtotal.add(discount).toString());\\n\\t\\tthis.discount.text.setText(CURR + discount.toString());\\n\\t\\tthis.toPay.text.setText(CURR+subtotal.toString());\\n\\t}\",\n \"public void changeSubtotalTextField()\\n {\\n Float subtotal = getSubtotal();\\n if ( subtotal != -1f )\\n {\\n String newSubtotal = Utility.ToDollars(subtotal);\\n subtotalTextField.setText(newSubtotal);\\n }\\n }\",\n \"@Override\\n public void actionPerformed(ActionEvent e) {\\n payment = Float.parseFloat(txtPayment.getText());\\n cashChange = String.valueOf(String.format(\\\"%.02f\\\", payment - finalTotal) );\\n lblChange.setVisible(true);\\n lblChange.setText(\\\"Change \\\" + \\\"£ \\\" + cashChange);\\n btnPrint.setVisible(true);\\n\\n }\",\n \"private void totalPrice() {\\n double totalPrice;\\n \\n String stu = studentSubTotal.getText();\\n stu = stu.substring(1);\\n double stuTotal = Double.parseDouble(stu);\\n\\n String adult = adultSubTotal.getText();\\n adult = adult.substring(1);\\n double adultTotal = Double.parseDouble(adult);\\n\\n String senior = seniorSubTotal.getText();\\n senior = senior.substring(1);\\n double seniorTotal = Double.parseDouble(senior);\\n\\n totalPrice = stuTotal + adultTotal + seniorTotal;\\n NumberFormat gbp = NumberFormat.getCurrencyInstance(Locale.UK);\\n String totalStr = String.valueOf(gbp.format(totalPrice));\\n totalPriceTextField.setText(totalStr);\\n\\n }\",\n \"private void addToBalance(double aBalance) {\\n balance += aBalance;\\n String out = String.format(\\\"<html><b>Balance</b><br>$%.2f</html>\\\", balance);\\n balanceLabel.setText(out);\\n }\",\n \"@FXML\\r\\n private void calculateButtonPressed(ActionEvent event) {\\r\\n try{\\r\\n BigDecimal amount = new BigDecimal(amountTextField.getText());\\r\\n BigDecimal tip = amount.multiply(tipPercentage);\\r\\n BigDecimal total = amount.add(tip);\\r\\n \\r\\n tipTextField.setText(currency.format(tip));\\r\\n totalTextField.setText(currency.format(total));\\r\\n }\\r\\n catch(NumberFormatException ex){\\r\\n amountTextField.setText(\\\"Enter amount\\\");\\r\\n amountTextField.selectAll();\\r\\n amountTextField.requestFocus();\\r\\n }\\r\\n }\",\n \"public void calcVal(JLabel l){\\n\\t\\tdouble total = 0;\\n\\t\\tfor(int i = 0; i < coinList.size(); i++){\\n\\t\\t\\ttotal += coinList.get(i).getValue();\\n\\t\\t}\\n\\t\\tl.setText(\\\"Total Money: $\\\" + toPercent(total));\\n\\t}\",\n \"static float addDiscount(float originalPrice, String discountName, float discountPercentage) {\\n float discountedPrice = originalPrice * (1 - discountPercentage);\\n float discount = discountedPrice - originalPrice;\\n printEntry(discountName, discount);\\n return discountedPrice;\\n }\",\n \"private void formatTxtPercentFocusLost(java.awt.event.FocusEvent evt) {//GEN-FIRST:event_formatTxtPercentFocusLost\\n formatTxtPercent.setText(formatTxtPercent.getText() + \\\"%\\\");\\n }\",\n \"public void adjustPay(double percentage){\\r\\n this.commission = getCommission() + getCommission() * percentage;\\r\\n }\",\n \"@Override\\n public double calculatePercentageExtra() {\\n double percentageExtra = 0;\\n \\n percentageExtra += getTwoColourCost();\\n \\n if(getChemicalResistance()) {\\n percentageExtra += getChemicalResistanceCost();\\n }\\n \\n return percentageExtra;\\n }\",\n \"public void calcPrecioTotal() {\\n try {\\n float result = precioUnidad * Float.parseFloat(unidades.getText().toString());\\n prTotal.setText(String.valueOf(result) + \\\"€\\\");\\n }catch (Exception e){\\n prTotal.setText(\\\"0.0€\\\");\\n }\\n }\",\n \"private void formatTxtPercentFocusGained(java.awt.event.FocusEvent evt) {//GEN-FIRST:event_formatTxtPercentFocusGained\\n lbFormat.setText(\\\"Enter number!\\\");\\n formatTxtPercent.setText(\\\"\\\");\\n }\",\n \"private void setDiscountedPrice() {\\n seekbarNewprice.setOnSeekBarChangeListener(new SeekBar.OnSeekBarChangeListener() {\\n @Override\\n public void onProgressChanged(SeekBar seekBar, int progress, boolean fromUser) {\\n tvDiscountPerc.setText(progress * 5 + \\\"%\\\");\\n try {\\n double originalPrice = Double.parseDouble(etOriginalPrice.getText().toString());\\n double sp = (progress * 5 * originalPrice) / 100;\\n\\n tvNewPrice.setText(String.format(Locale.US, \\\"%.2f\\\", originalPrice - sp));\\n } catch (NumberFormatException ne) {\\n ne.printStackTrace();\\n }\\n }\\n\\n @Override\\n public void onStartTrackingTouch(SeekBar seekBar) {\\n\\n }\\n\\n @Override\\n public void onStopTrackingTouch(SeekBar seekBar) {\\n\\n }\\n });\\n }\",\n \"public void printCost() {\\r\\n double cost;\\r\\n cost = quantity * price;\\r\\n System.out.printf(\\\"Total cost = $%.2f\\\", cost);\\r\\n }\",\n \"double setCost(double cost);\",\n \"private void makeFormattedTextField(){\\n textField = new JTextField(\\\"\\\"+ShapeFactory.getRoundness(), 3);\\n //add listener that happens after each type and make the field accept only numbers between 0 to 100\\n textField.addKeyListener(new KeyAdapter() {\\n @Override\\n public void keyTyped(KeyEvent e) {\\n super.keyTyped(e);\\n typeEvent(e);\\n }\\n });\\n }\",\n \"private void trataDesconto(String x){\\n \\n Double sub;\\n \\n descontoField.setText(porcentagem.format((Double.parseDouble(x))/100));\\n descontoField.setEnabled(true);\\n sub = retornaSubTotal(this.getVlrTotalItem(), Double.parseDouble(x));\\n subTotalField.setText(moeda.format(sub));\\n lblTotalGeral.setText(subTotalField.getText());\\n this.setVlrTotalItem(sub);\\n}\",\n \"public void tvqTax() {\\n TextView tvqView = findViewById(R.id.checkoutPage_TVQtaxValue);\\n tvqTaxTotal = beforeTaxTotal * 0.09975;\\n tvqView.setText(String.format(\\\"$%.2f\\\", tvqTaxTotal));\\n }\",\n \"void setCost(double cost);\",\n \"void calcAmount(double amountEntered, double costAmount){\\n double changeAmount ;\\n if(amountEntered >= costAmount){\\n changeAmount = amountEntered - costAmount;\\n myTextView.setText(\\\"Please take your change = R\\\"+ changeAmount + \\\"\\\\n\\\"+ \\\"Thank you!!\\\"+\\\"\\\\nTravel safe!!\\\");\\n }else{\\n changeAmount = amountEntered - costAmount;\\n myTextView.setText(\\\"You still owe R\\\" + Math.abs(changeAmount)+ \\\" \\\\nplease pay now!!\\\");\\n }\\n }\",\n \"public void updateFuelUsed(double fuel) {\\r\\n\\t\\tfuelUsed.setText(\\\"Fuel Used (L): \\\" + BigDecimal.valueOf(fuel).setScale(2, RoundingMode.HALF_UP));\\r\\n\\t\\t\\r\\n\\t}\",\n \"private void updateSubtotal() {\\n subtotal = entreePrice + drinkPrice + dessertPrice;\\n subtotalEdtTxt.setText(String.format(\\\"$%.2f\\\", subtotal));\\n }\",\n \"public void calculateAmount() {\\n totalAmount = kurv.calculateTotalAmount() + \\\" DKK\\\";\\n headerPrice.setText(totalAmount);\\n }\",\n \"public double returnBoxCost(double cardGradeCost, double colourOptPercent, double reinfPercent, double sealablePercent){\\n\\t\\tdouble sum = cardGradeCost + ((cardGradeCost * colourOptPercent) / 100) + ((cardGradeCost * reinfPercent) / 100)\\n\\t\\t\\t\\t+ ((cardGradeCost * sealablePercent) / 100); \\n\\t\\tdouble computeTotal = 0.00;\\n\\t\\t\\n\\t\\tDecimalFormat df = new DecimalFormat(\\\"##.##\\\");\\t\\n\\t\\t\\n\\t\\ttry{\\n\\t\\t\\tcomputeTotal = Double.valueOf(df.format(sum));\\n\\t\\t\\t}catch(NumberFormatException nme){\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\treturn computeTotal;\\n\\t}\",\n \"private void updateCustom(){\\n\\n // sets customTipTextView's text to match the position of the SeekBar\\n customTipTextView.setText(currentCustomPercent + getString(R.string.percent_sign));\\n\\n // calculate the custom tip amount\\n double customTipAmount = currentBillTotal * currentCustomPercent * .01;\\n\\n // calculate the total bill including the custom tip\\n double customTotalAmount = currentBillTotal + customTipAmount;\\n\\n // display the tip and total bill amounts\\n tipCustomEditText.setText(String.format(getString(R.string.two_dec_float), customTipAmount));\\n totalCustomEditText.setText(String.format(getString(R.string.two_dec_float), customTotalAmount));\\n }\",\n \"public void calcular(View view) {\\n int quilos = Integer.valueOf(editTextQuantidade.getText().toString());\\n int total = (quilos *1000)/500;\\n \\n String message = \\\"Com \\\" + quilos + \\\"kg de chocolate da para fazer \\\" + total + \\\" ovos de 500g.\\\";\\n textViewTotal.setText(message);\\n }\",\n \"private void updateWeightTextFieldToStored(String errorMsg)\\n {\\n SpriteGrader spriteGrader = (SpriteGrader) context\\n .getComponent(SpriteGrader.MODULE_NAME);\\n if (spriteGrader != null)\\n {\\n // update the weight text box\\n weightTextField.setText(String.format(\\\"%5.3f\\\",\\n spriteGrader.getWeightFrom0To1()));\\n }\\n else\\n {\\n System.out.println(\\\"Cannot open the Sprite Grader \\\"\\n + \\\"Weighted Component in gui.\\\");\\n\\n weightTextField.setText(errorMsg);\\n }\\n }\",\n \"private void setTipPercentage(){\\n System.out.println(\\\"You indicated the service quality was \\\"+\\n serviceQuality+\\\". What percentage tip would you like to leave?\\\");\\n tipRate=keyboard.nextDouble();\\n \\n \\n }\",\n \"public void onclickpercent(View v){\\n Button b = (Button) v;\\n String temp;\\n double t;\\n String y;\\n displayscreen = screen.getText().toString();\\n displayscreen2 = screen2.getText().toString();\\n if (displayscreen.equals(\\\"\\\") && displayscreen2.equals(\\\"\\\")) //handle if display is empty\\n return;\\n else if (displayscreen.equals(\\\"\\\") && !displayscreen2.equals(\\\"\\\")) {\\n temp = screen2.getText().toString();\\n if (temp.contains(\\\"+\\\") || temp.contains(\\\"-\\\") || temp.contains(\\\"x\\\") || temp.contains(\\\"÷\\\")){ //handle if user inserts only operators\\n return;}\\n t = Double.valueOf(temp) /100.0;\\n y=df2.format(t);\\n screen.setText(y);\\n String z=\\\"%\\\";\\n screen2.setText(temp+z);\\n }\\n else\\n {\\n temp = screen.getText().toString();\\n t = Double.valueOf(temp) /100.0;\\n y=df2.format(t);\\n screen.setText(y);\\n String z=\\\"%\\\";\\n screen2.setText(temp+z);\\n }\\n }\",\n \"public void updateTotalSpentLabel() {\\n totalSpentLabel.setText(\\\"Total: $\\\" + duke.expenseList.getTotalAmount());\\n }\",\n \"public void addFuel(double fuelToAdd){\\n\\n fuelRemaining = fuelRemaining + fuelToAdd;\\n }\",\n \"private void calcPrice() {\\n double itemPrice = 0;\\n \\n //get price of burger (base)\\n if (singleRad.isSelected())\\n {\\n itemPrice = 3.50;\\n }\\n else \\n {\\n itemPrice = 4.75;\\n }\\n \\n //check options add to item price\\n if(cheeseCheckbox.isSelected())\\n itemPrice = itemPrice += 0.50;\\n if(baconCheckbox.isSelected())\\n itemPrice = itemPrice += 1.25;\\n if(mealCheckbox.isSelected())\\n itemPrice = itemPrice += 4.00;\\n \\n //include the quantity for the item price\\n int quantity= 1;\\n if (quantityTextField.getText().equals(\\\"\\\"))\\n quantityTextField.setText(\\\"1\\\");\\n quantity = Integer.parseInt(quantityTextField.getText());\\n itemPrice = itemPrice * quantity;\\n\\n \\n //show the price no $ symbol\\n \\n itemPriceTextField.setText(d2.format(itemPrice));\\n }\",\n \"@Override\\n\\t\\t\\tpublic void insertUpdate(DocumentEvent e) {\\n\\t\\t\\t\\tvmvcpumhztotalsize.setText(getVmvcpumhztotal(vmvcpumhztxt.getText(),\\n\\t\\t\\t\\t\\t\\tvmvcpucombo.getSelectedItem().toString(), vmvcpumhzoverheadcombo.getSelectedItem().toString()));\\n\\n\\t\\t\\t}\",\n \"private void plusQuantity(TextField source, Clothing clothing) {\\n clothing.setCount(1);\\n int quantity = clothing.getCount();\\n double totalPriceOfClothing = 0;\\n\\n for (int i = 0; i < clothingArrayList.size(); i++) {\\n double countOfItems = clothingArrayList.get(i).getCount();\\n double clothingPricePerUnit = Double.valueOf(clothingArrayList.get(i).getPrice());\\n totalPriceOfClothing += countOfItems * clothingPricePerUnit;\\n\\n }\\n source.setText(\\\"\\\" + (quantity));\\n totalPrices.setText(\\\"\\\" + totalPriceOfClothing);\\n\\n totalPrice.textProperty().bind(totalPrices.textProperty());\\n }\",\n \"double updateValue(double value, double percentage){\\n\\t\\treturn value+=(value*(.01*percentage));\\r\\n\\t}\",\n \"public void totalprice(float tprice)\\n {\\n \\t this.mTotalPrice=tprice;\\n }\",\n \"public void tpsTax() {\\n TextView tpsView = findViewById(R.id.checkoutPage_TPStaxValue);\\n tpsTaxTotal = beforeTaxTotal * 0.05;\\n tpsView.setText(String.format(\\\"$%.2f\\\", tpsTaxTotal));\\n }\",\n \"private void updateTotal() {\\n int total = table.getTotal();\\n vip.setConsumption(total);\\n if (total > 0)\\n payBtn.setText(PAY + RMB + total);\\n else if (total == 0)\\n payBtn.setText(PAY);\\n }\",\n \"private void Button_PercentActionPerformed(java.awt.event.ActionEvent evt) {//GEN-FIRST:event_Button_PercentActionPerformed\\n // TODO add your handling code here:\\n }\",\n \"public void updateScoreCard(){\\n scoreCard.setText(correct+\\\"/\\\"+total);\\n }\",\n \"public void calcularTotal() {\\n double valor = 0;\\n String servico = (String)consultaSelecionada.getSelectedItem().toString();\\n switch(servico) {\\n case \\\"Consulta\\\":\\n valor += 100;\\n break;\\n case \\\"Limpeza\\\":\\n valor += 130;\\n break;\\n case \\\"Clareamento\\\":\\n valor += 450;\\n break;\\n case \\\"Aparelho\\\":\\n valor += 100;\\n break;\\n case \\\"Raio-x\\\":\\n valor += 80;\\n break;\\n case \\\"Cirurgia\\\":\\n valor += 70;\\n break;\\n }\\n Total.setText(String.valueOf(valor));\\n }\",\n \"@Override\\n\\t\\t\\tpublic void actionPerformed(ActionEvent e) {\\n\\t\\t\\t\\tint a = Integer.parseInt(field.getText());\\n\\t\\t\\t\\tint b = Integer.parseInt(field2.getText());\\n\\t\\t\\t\\tint c = a+b;\\n\\t\\t\\t\\tlabel.setText(\\\"Value is: \\\" + c);\\n\\t\\t\\t}\",\n \"public void calculateScore(){\\n\\n score.setText(Integer.toString(80));\\n\\n\\n }\",\n \"public void operation() {\\n\\t\\t\\n\\t\\tswitch(calculation){\\n\\t\\t\\tcase 1:\\n\\t\\t\\t\\ttotal = num + Double.parseDouble(textField.getText());\\n\\t\\t\\t\\ttextField.setText(Double.toString(total));\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\n\\t\\t\\tcase 2:\\n\\t\\t\\t\\ttotal = num - Double.parseDouble(textField.getText());\\n\\t\\t\\t\\ttextField.setText(Double.toString(total));\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\n\\t\\t\\tcase 3:\\n\\t\\t\\t\\ttotal = num * Double.parseDouble(textField.getText());\\n\\t\\t\\t\\ttextField.setText(Double.toString(total));\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\n\\t\\t\\tcase 4:\\n\\t\\t\\t\\ttotal = num / (Double.parseDouble(textField.getText()));\\n\\t\\t\\t\\ttextField.setText(Double.toString(total));\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\n\\t\\t}\\n\\t}\",\n \"private void calculateCosts() {\\r\\n lb_CubicSum.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_Volume)) + \\\" €\\\");\\r\\n lb_MaterialCostSum.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_Price)) + \\\" €\\\");\\r\\n lb_CuttingTimeSum.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_CuttingHours)) + \\\" €\\\");\\r\\n lb_CuttingCostSum.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_CuttingPrice)) + \\\" €\\\");\\r\\n lb_TotalCosts.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_CuttingPrice) + getColmunSum(tc_Price)) + \\\" €\\\");\\r\\n\\r\\n ModifyController.getInstance().setProject_constructionmaterialList(Boolean.TRUE);\\r\\n }\",\n \"public void buttonPercent(View v){\\n expressionView.setText(expressionView.getText() + \\\"%\\\");\\n calculate();\\n }\",\n \"private void updateHubHelps(BoundedRangeModel subModel , JLabel component) {\\n DecimalFormat df = new DecimalFormat(\\\"#00.00\\\");\\n float prc_current = (float)subModel.getValue() / (float)( subModel.getMaximum() - subModel.getMinimum() ) * 100f;\\n float prc_total = this.hub.getWeight( this.hub.indexOf( subModel ) ) / this.hub.getTotalWeight() * 100f;\\n component.setText( df.format(prc_current) + \\\" % of \\\" + df.format(prc_total) + \\\" %\\\" );\\n }\",\n \"public double getCost() \\n { \\n return super.getCost() +22;\\n }\",\n \"private void updatePriceLabel(double aPrice) {\\n price = aPrice;\\n String out = String.format(\\\"<html><b>Price</b><br>$%.2f</html>\\\", price);\\n priceLabel.setText(out);\\n }\",\n \"public void afterTax() {\\n TextView afterView = findViewById(R.id.checkoutPage_afterTaxValue);\\n afterTaxTotal = beforeTaxTotal + tpsTaxTotal + tvqTaxTotal;\\n afterView.setText(String.format(\\\"$%.2f\\\", afterTaxTotal));\\n }\",\n \"public void calculate(View v) {\\n EditText inputBill = findViewById(R.id.inputBill);\\n EditText inputTipPercent = findViewById(R.id.inputTipPercent);\\n String num1Str = inputBill.getText().toString();\\n String num2Str = inputTipPercent.getText().toString();\\n\\n // multiply Bill by Tip to get Tip in dollars\\n double num1 = Double.parseDouble(num1Str);\\n double num2 = Double.parseDouble(num2Str);\\n double tipInDollar = num1 * (num2 / 100);\\n double total = num1 + tipInDollar;\\n\\n // show tip in dollars\\n TextView lblTipAmount = findViewById(R.id.lblTipAmount);\\n lblTipAmount.setText(String.valueOf(tipInDollar));\\n\\n // show total price with tip included\\n TextView lblTotalAmount = findViewById(R.id.lblTotalAmount);\\n lblTotalAmount.setText(String.valueOf(total));\\n }\",\n \"@FXML\\r\\n private void addPoints() {\\r\\n if (diffPoint > 0) {\\r\\n int f1 = Integer.parseInt(strength.getText());\\r\\n int f2 = f1 + 1;\\r\\n strength.setText(String.valueOf(f2));\\r\\n diffPoint--;\\r\\n point.setText(\\\"You have \\\" + diffPoint + \\\" points\\\");\\r\\n }\\r\\n }\",\n \"private void jButton1ActionPerformed(java.awt.event.ActionEvent evt) {\\n mid = Mid.getText();\\n bid=Bid.getText();\\n days=Integer.parseInt(late.getText());\\n if(days > 1 && days <10)\\n {\\n Fine= 50.0;\\n }\\n else if( days >10 && days <20)\\n {\\n Fine=100.0;\\n \\n \\n }\\n else if(days >20 && days < 30)\\n {\\n Fine = 200.0;\\n }\\n else\\n {\\n Fine= 0.0;\\n }\\n Fine=Fine*days;\\n add();\\n // fine.setText(fine.getText( Fine));\\n }\",\n \"public void addQuantity()\\n {\\n int quantity = Integer.parseInt(quantityTextField.getText());\\n quantity++;\\n quantityTextField.setText(\\\"\\\" + quantity);\\n\\n changeSubtotalTextField();\\n }\",\n \"public void setMaxTotalCost(int amount);\",\n \"@Override\\n\\tprotected void setCost(double cst) {\\n\\t\\t\\n\\t}\",\n \"@Override\\n public void actionPerformed(ActionEvent actionEvent) {\\n total = total * amount3;\\n String.valueOf(total);\\n //displaying what user chose\\n JOptionPane.showMessageDialog(null, total + \\\" seconds \\\" + nameItem +\\\" \\\"+ amount3 );\\n }\",\n \"@Override\\n public void formJisuan(double sum) {\\n cart_frag_xiaoji.setText(\\\"小计：￥\\\" + sum);\\n cart_frag_price.setText(\\\"￥\\\" + sum);\\n }\",\n \"public void getPaintPrice(){\\n System.out.println(\\\"Enter the price per gallon of paint: \\\");\\n this.pricePerGallon = INPUT.nextDouble();\\n }\",\n \"@Override\\n\\t\\t\\tpublic void actionPerformed(ActionEvent e) {\\n\\t\\t\\t\\tvmvcpumhztotalsize.setText(getVmvcpumhztotal(vmvcpumhztxt.getText(),\\n\\t\\t\\t\\t\\t\\tvmvcpucombo.getSelectedItem().toString(), vmvcpumhzoverheadcombo.getSelectedItem().toString()));\\n\\n\\t\\t\\t}\",\n \"@Override\\n\\t\\t\\tpublic void actionPerformed(ActionEvent e) {\\n\\t\\t\\t\\tvmvcpumhztotalsize.setText(getVmvcpumhztotal(vmvcpumhztxt.getText(),\\n\\t\\t\\t\\t\\t\\tvmvcpucombo.getSelectedItem().toString(), vmvcpumhzoverheadcombo.getSelectedItem().toString()));\\n\\n\\t\\t\\t}\",\n \"@Override\\n\\t\\t\\tpublic void actionPerformed(ActionEvent e) {\\n\\t\\t\\t\\tvmvcpumhztotalsize.setText(getVmvcpumhztotal(vmvcpumhztxt.getText(),\\n\\t\\t\\t\\t\\t\\tvmvcpucombo.getSelectedItem().toString(), vmvcpumhzoverheadcombo.getSelectedItem().toString()));\\n\\n\\t\\t\\t}\",\n \"public void getTip(View v)\\n {\\n EditText billEditText = (EditText) findViewById(R.id.billEditText);\\n EditText percentEditText = (EditText) findViewById(R.id.percentEditText);\\n TextView tipTextView = (TextView) findViewById(R.id.tipTextView);\\n TextView totalTextView = (TextView) findViewById(R.id.totalTextView);\\n\\n //get the values from the EditText boxes and convert them to double data types\\n double bill = Double.parseDouble(billEditText.getText().toString());\\n double percent = Double.parseDouble(percentEditText.getText().toString());\\n //double total = Double.parseDouble(totalTextView.getText().toString());\\n\\n //calculate tip\\n percent = percent/100;\\n double tip = bill*percent;\\n double total = bill + tip;\\n\\n tipTextView.setText(\\\"Tip: \\\" + tip);\\n totalTextView.setText(\\\"Total: \\\" + total);\\n\\n\\n\\n\\n }\",\n \"private void onBasketTotalChanged(String total){\\n binding.textViewTotalValue.setText(String.format(\\\"$%s\\\", total));\\n }\",\n \"@Override\\n public void changed(ObservableValue<? extends Number> observable, Number oldValue, Number newValue) {\\n DecimalFormat df = new DecimalFormat(\\\"#.#\\\");\\n df.setRoundingMode(RoundingMode.HALF_UP);\\n cogInput.setText(df.format(newValue));\\n }\",\n \"private void updateBalanceLabel() {\\n balanceLabel.setText(String.format(\\\"<html><b>Balance</b><br>$%.2f</html>\\\", balance));\\n }\",\n \"@Override\\n\\t\\t\\tpublic boolean onEditorAction(TextView v, int actionId, KeyEvent event) {\\n\\t\\t\\t\\ttip_perc.setText(\\\"Tip: \\\"+String.valueOf(tip_percentage)+\\\" %\\\");\\n\\t\\t\\t\\tint tip_dollar = calculateTip(tip_percentage, Integer.parseInt(ed.getText().toString()));\\n\\t\\t\\t\\ttotal_val=Integer.parseInt(ed.getText().toString())+tip_dollar;\\n\\t\\t\\t\\ttip.setText(\\\"Tip: \\\"+String.valueOf(tip_dollar));\\n\\t\\t\\t\\ttotal.setText(\\\"Total: \\\" + String.valueOf(total_val));\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t}\",\n \"private void calculateEarnings()\\n {\\n // get user input\\n int items = Integer.parseInt( itemsSoldJTextField.getText() );\\n double price = Double.parseDouble( priceJTextField.getText() );\\n Integer integerObject = \\n ( Integer ) commissionJSpinner.getValue();\\n int commissionRate = integerObject.intValue();\\n \\n // calculate total sales and earnings\\n double sales = items * price;\\n double earnings = ( sales * commissionRate ) / 100;\\n \\n // display the results\\n DecimalFormat dollars = new DecimalFormat( \\\"$0.00\\\" );\\n grossSalesJTextField.setText( dollars.format( sales ) );\\n earningsJTextField.setText( dollars.format( earnings ) );\\n\\n }\",\n \"public double returnBoxCost(double cardGradeCost, double colourOptPercent, double reinfPercent, double sealablePercent, int qty, double length, double width, double height){\\n\\t\\tdouble sum = cardGradeCost + (cardGradeCost * colourOptPercent / 100) + (cardGradeCost * reinfPercent / 100)\\n\\t\\t\\t\\t+ (cardGradeCost * sealablePercent / 100); \\n\\t\\t\\n\\t\\tdouble computeTotal = 0;\\n\\t\\tDecimalFormat df = new DecimalFormat(\\\"##.##\\\");\\n\\t\\ttry{\\n\\t\\t\\tcomputeTotal = Double.valueOf(calcSurfaceAreaOfBox(length, width, height, sum, qty));\\n\\t\\t\\n\\t\\t\\treturn Double.valueOf(df.format(computeTotal));\\n\\t\\t\\n\\t\\t}catch(NumberFormatException nme){\\n\\t\\t\\treturn 0.00;\\n\\t\\t}\\n\\t}\",\n \"public void actionPerformed(ActionEvent arg0) {\\n\\t\\t\\t\\t\\t\\t\\tif( txt_showresult.getText().equals( \\\"0\\\" )){ \\n\\t\\t\\t\\t\\t\\t\\t\\ttxt_showresult.setText(\\\"6\\\");\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t// if textfield show other value , add number after the value\\n\\t\\t\\t\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\t\\t\\ttxt_showresult.setText( txt_showresult.getText() + \\\"6\\\");\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\",\n \"@Override\\n\\tpublic void widgetSelected(SelectionEvent e) {\\n\\t\\tint i = typecombo.getSelectionIndex();\\n\\t\\tif(i == 0){\\n\\t\\t\\tcosttext.setText(\\\"3元\\\");\\n\\t\\t}\\n\\t\\telse if(i == 1){\\n\\t\\t\\tcosttext.setText(\\\"5元\\\");\\n\\t\\t}\\n\\t}\",\n \"private void percentageScaling() {\\n switch (slot) {\\n case Torso -> updateBonusStats(1);\\n case Head -> updateBonusStats(0.8);\\n case Legs -> updateBonusStats(0.6);\\n }\\n }\",\n \"public void calcAction(View v) \\n\\t{\\n\\t\\ttry\\n\\t\\t{\\n\\t\\t\\tString initial = size.getText().toString(); /* the following gets user input, in order to do calculations */\\n\\t\\t\\tString end = \\\"Nothing\\\"; /* This is the default text in case the unexpected happens */\\n\\t\\t\\tunit = selection.getSelectedItem().toString(); /* this gets the unit of measure that the user specifies */\\n\\t\\tdouble convert = Double.parseDouble(initial); /* this converts the size input to numerical data, in order for calculations to be done */\\n\\t\\t\\tcapacity.setStorage(convert); /* send input to external class */\\n\\t\\t\\tDecimalFormat twop = new DecimalFormat(\\\"#.##\\\"); /* created new object, in order to format output to display two decimal places at most */\\n\\n\\t\\t\\t/* the following conditional statement reads the unit of measure specify by the user, puts the data into the proper formula, and returns the results */\\n\\n\\t\\t\\tif (unit.equals(\\\"KB\\\")) // runs if user specifies KB\\n\\t\\t\\t{\\n\\t\\t\\t\\tend = twop.format(capacity.getKB());\\n\\t\\t\\t}\\n\\n\\t\\t\\telse if (unit.equals(\\\"MB\\\")) /* runs if user specifies MB */\\n\\t\\t\\t{\\n\\t\\t\\t\\tend = twop.format(capacity.getMB());\\n\\t\\t\\t}\\n\\n\\t\\t\\telse if (unit.equals(\\\"GB\\\")) /* runs if user specifies GB */\\n\\t\\t\\t{\\n\\t\\t\\t\\tend = twop.format(capacity.getGB());\\n\\t\\t\\t}\\n\\n\\t\\t\\telse if (unit.equals(\\\"TB\\\")) /* runs if user specifies TB */\\n\\t\\t\\t{\\n\\t\\t\\t\\tend = twop.format(capacity.getTB());\\n\\t\\t\\t}\\n\\n\\t\\t\\telse if (unit.equals(\\\"PB\\\")) /* runs if user specifies PB */\\n\\t\\t\\t{\\n\\t\\t\\t\\tend = twop.format(capacity.getPB());\\n\\t\\t\\t}\\n\\n\\t\\t\\telse if (unit.equals(\\\"EB\\\")) /* runs if user specifies EB */\\n\\t\\t\\t{\\n\\t\\t\\t\\tend = twop.format(capacity.getEB());\\n\\t\\t\\t}\\n\\n\\t\\t\\telse if (unit.equals(\\\"ZB\\\")) /* runs if user specifies ZB */\\n\\t\\t\\t{\\n\\t\\t\\t\\tend = twop.format(capacity.getZB());\\n\\t\\t\\t}\\n\\n\\t\\t\\telse if (unit.equals(\\\"YB\\\")) /* runs if user specifies YB */\\n\\t\\t\\t{\\n\\t\\t\\t\\tend = twop.format(capacity.getYB());\\n\\t\\t\\t}\\n\\n\\t\\t\\telse; // send default text, if unexpected happens.\\n\\n\\t\\t\\tresult.setText(end); // display results\\n\\t\\t}\\n\\n\\t\\tcatch (NumberFormatException e)\\n\\t\\t{\\n\\t\\t\\tAlertDialog.Builder m = new AlertDialog.Builder(this);\\n\\t\\t\\tm.setTitle(R.string.error); // set dialog title\\n\\t\\t\\tm.setMessage(R.string.error_message).setCancelable(true).setPositiveButton(R.string.ok, new DialogInterface.OnClickListener()\\n\\t\\t\\t{\\n\\t\\t\\t\\tpublic void onClick(DialogInterface dialog, int id)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tdialog.cancel();\\n\\t\\t\\t\\t}\\n\\t\\t\\t});\\n\\t\\t\\tm.create();\\n\\t\\t\\tm.show();\\n\\t\\t}\\t\\n\\t}\",\n \"public void calcPrice() {\\r\\n\\t\\tsuper.price = 3 * super.height;\\r\\n\\t}\",\n \"@Override\\n\\t\\tpublic void onTextChanged(CharSequence s, int start, int before, int count) {\\n\\t\\t\\ttry{\\n\\t\\t\\t\\tbillAmount = Double.parseDouble(s.toString()) / 100.0;\\n\\t\\t\\t}\\n\\t\\t\\tcatch(NumberFormatException e)\\n\\t\\t\\t{\\n\\t\\t\\t\\tbillAmount = 0.0;\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tamountDisplayTextView.setText(currencyFormat.format(billAmount));\\n\\t\\t\\tupdateStandard();\\n\\t\\t\\tupdateCustom();\\n\\t\\t}\",\n \"public void setCost(double value) {\\n this.cost = value;\\n }\",\n \"public void amount() {\\n \\t\\tfloat boxOHamt=boxOH*.65f*48f;\\n \\t\\tSystem.out.printf(boxOH+\\\" boxes of Oh Henry ($0.65 x 48)= $%4.2f \\\\n\\\",boxOHamt);\\n \\t\\tfloat boxCCamt=boxCC*.80f*48f;\\n \\t\\tSystem.out.printf(boxCC+\\\" boxes of Coffee Crisp ($0.80 x 48)= $%4.2f \\\\n\\\", boxCCamt);\\n \\t\\tfloat boxAEamt=boxAE*.60f*48f;\\n \\t\\tSystem.out.printf(boxAE+\\\" boxes of Aero ($0.60 x 48)= $%4.2f \\\\n\\\", boxAEamt);\\n \\t\\tfloat boxSMamt=boxSM*.70f*48f;\\n \\t\\tSystem.out.printf(boxSM+\\\" boxes of Smarties ($0.70 x 48)= $%4.2f \\\\n\\\", boxSMamt);\\n \\t\\tfloat boxCRamt=boxCR*.75f*48f;\\n \\t\\tSystem.out.printf(boxCR+\\\" boxes of Crunchies ($0.75 x 48)= $%4.2f \\\\n\\\",boxCRamt);\\n \\t\\tSystem.out.println(\\\"----------------------------------------------\\\");\\n \\t\\t//display the total prices\\n \\t\\tsubtotal=boxOHamt+boxCCamt+boxAEamt+boxSMamt+boxCRamt;\\n \\t\\tSystem.out.printf(\\\"Sub Total = $%4.2f \\\\n\\\", subtotal);\\n \\t\\ttax=subtotal*.07f;\\n \\t\\tSystem.out.printf(\\\"Tax = $%4.2f \\\\n\\\", tax);\\n \\t\\tSystem.out.println(\\\"==============================================\\\");\\n \\t\\ttotal=subtotal+tax;\\n \\t\\tSystem.out.printf(\\\"Amount Due = $%4.2f \\\\n\\\", total);\\n \\t}\",\n \"public void actionPerformed(ActionEvent event) {\\n // it is a digit or decimal point\\n JButton source = (JButton) event.getSource();\\n String label = source.getText();\\n // don't add two decimal points\\n if (label.equals(\\\".\\\") && display.getText().indexOf(\\\".\\\") != -1) {\\n return;\\n }\\n display.setText(display.getText() + label);\\n }\",\n \"Builder withAutoCompactFillRate(int percentage);\",\n \"public void addMoney(double profit){\\n money+=profit;\\n }\",\n \"public Price percentage(Float percentage) {\\n this.percentage = percentage;\\n return this;\\n }\",\n \"public void calculateAndDisplay() {\\n fromUnitString = fromUnitEditText.getText().toString();\\r\\n if (fromUnitString.equals(\\\"\\\")) {\\r\\n fromValue = 0;\\r\\n }\\r\\n else {\\r\\n fromValue = Float.parseFloat(fromUnitString);\\r\\n }\\r\\n\\r\\n // calculate the \\\"to\\\" value\\r\\n toValue = fromValue * ratio;\\r\\n\\r\\n // display the results with formatting\\r\\n NumberFormat number = NumberFormat.getNumberInstance();\\r\\n number.setMaximumFractionDigits(2);\\r\\n number.setMinimumFractionDigits(2);\\r\\n toUnitTextView.setText(number.format(toValue));\\r\\n }\",\n \"public void addCost(int amount) {\\n\\t\\tcost = amount;\\n\\t}\",\n \"double setEstimatedCost(double cost);\",\n \"@Override\\r\\n\\tpublic void addToCost() {\\n\\t\\t\\r\\n\\t}\",\n \"void setDiscount(float sconto);\",\n \"private void peso(){\\r\\n if(getPeso()>80){\\r\\n precioBase+=100;\\r\\n }\\r\\n else if ((getPeso()<=79)&&(getPeso()>=50)){\\r\\n precioBase+=80;\\r\\n }\\r\\n else if ((getPeso()<=49)&&(getPeso()>=20)){\\r\\n precioBase+=50;\\r\\n }\\r\\n else if ((getPeso()<=19)&&(getPeso()>=0)){\\r\\n precioBase+=10;\\r\\n }\\r\\n }\",\n \"public void donutTypeChosen()\\n {\\n changeSubtotalTextField();\\n }\",\n \"public void setScore(String str){\\r\\n formattedTextField1.setText(str);\\r\\n }\",\n \"@Override\\n public void actionPerformed(ActionEvent actionEvent) {\\n total = total * amount2;\\n String.valueOf(total);\\n //displaying what user chose\\n JOptionPane.showMessageDialog(null, total + \\\" seconds \\\" + nameItem +\\\" \\\"+ amount2 );\\n }\",\n \"public void actionPerformed(ActionEvent arg0) {\\n\\t\\t\\t\\t\\t\\t\\tif( txt_showresult.getText().equals( \\\"0\\\" )){ \\n\\t\\t\\t\\t\\t\\t\\t\\ttxt_showresult.setText(\\\"8\\\");\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t// if textfield show other value , add number after the value\\n\\t\\t\\t\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\t\\t\\ttxt_showresult.setText( txt_showresult.getText() + \\\"8\\\");\\n\\t\\t\\t\\t\\t\\t\\t}\\t\\n\\t\\t\\t\\t\\t\\t}\",\n \"public void actionPerformed(ActionEvent arg0) {\\n\\t\\t\\t\\t\\t\\t\\tif( txt_showresult.getText().equals( \\\"0\\\" )){ \\n\\t\\t\\t\\t\\t\\t\\t\\ttxt_showresult.setText(\\\"5\\\");\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t// if textfield show other value , add number after the value\\n\\t\\t\\t\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\t\\t\\ttxt_showresult.setText( txt_showresult.getText() + \\\"5\\\");\\n\\t\\t\\t\\t\\t\\t\\t}\\t\\n\\t\\t\\t\\t\\t\\t}\",\n \"private void sumaApostado() {\\n\\t\\tapostado.set(apostado.get() + 1.0);\\n\\t\\tdiruField.setText(String.format(\\\"%.2f\\\", apostado.get()));\\n\\t\\tactualizaPremio();\\n\\t}\",\n \"public void actionPerformed(ActionEvent arg0) {\\n\\t\\t\\t\\t\\t\\t\\tif( txt_showresult.getText().equals( \\\"0\\\" )){ \\n\\t\\t\\t\\t\\t\\t\\t\\ttxt_showresult.setText(\\\"9\\\");\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\t// if textfield show other value , add number after the value\\n\\t\\t\\t\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\t\\t\\ttxt_showresult.setText( txt_showresult.getText() + \\\"9\\\");\\n\\t\\t\\t\\t\\t\\t\\t}\\t\\t\\n\\t\\t\\t\\t\\t\\t}\",\n \"public void setPricePerSquareFoot(double newPricePerSquareFoot){\\nif(newPricePerSquareFoot > 0){\\npricePerSquareFoot = newPricePerSquareFoot;\\n}\\n}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.67218584","0.6585632","0.62429845","0.6159801","0.6142358","0.60641575","0.60492384","0.59809774","0.5971775","0.59689116","0.59402853","0.59243304","0.5896911","0.58927524","0.587081","0.5796374","0.57823586","0.577438","0.57726896","0.5770402","0.57654154","0.5750601","0.57339007","0.57320744","0.5730859","0.57080925","0.57050127","0.56877303","0.5681503","0.5679662","0.5676994","0.56697655","0.56689125","0.56556624","0.564709","0.56372875","0.5636788","0.56310755","0.56231296","0.56207174","0.5606633","0.5606379","0.5592056","0.558729","0.55844724","0.55840254","0.5581531","0.5562479","0.5551182","0.5539688","0.5519433","0.5517796","0.5513153","0.55126715","0.55102664","0.55078965","0.5503342","0.5499455","0.549913","0.54909617","0.54878175","0.54877406","0.5485328","0.5483962","0.5471404","0.5471404","0.5471404","0.54642487","0.546332","0.5444217","0.5442439","0.54395443","0.54385114","0.5435785","0.5433456","0.543154","0.542964","0.5429292","0.54109716","0.54103136","0.5410298","0.54033947","0.53937364","0.5390834","0.53859234","0.5381933","0.5381811","0.5381126","0.5378646","0.5378289","0.5374101","0.53658336","0.5365005","0.5359063","0.535822","0.53561115","0.53541446","0.5353744","0.5342868","0.5340444"],"string":"[\n \"0.67218584\",\n \"0.6585632\",\n \"0.62429845\",\n \"0.6159801\",\n \"0.6142358\",\n \"0.60641575\",\n \"0.60492384\",\n \"0.59809774\",\n \"0.5971775\",\n \"0.59689116\",\n \"0.59402853\",\n \"0.59243304\",\n \"0.5896911\",\n \"0.58927524\",\n \"0.587081\",\n \"0.5796374\",\n \"0.57823586\",\n \"0.577438\",\n \"0.57726896\",\n \"0.5770402\",\n \"0.57654154\",\n \"0.5750601\",\n \"0.57339007\",\n \"0.57320744\",\n \"0.5730859\",\n \"0.57080925\",\n \"0.57050127\",\n \"0.56877303\",\n \"0.5681503\",\n \"0.5679662\",\n \"0.5676994\",\n \"0.56697655\",\n \"0.56689125\",\n \"0.56556624\",\n \"0.564709\",\n \"0.56372875\",\n \"0.5636788\",\n \"0.56310755\",\n \"0.56231296\",\n \"0.56207174\",\n \"0.5606633\",\n \"0.5606379\",\n \"0.5592056\",\n \"0.558729\",\n \"0.55844724\",\n \"0.55840254\",\n \"0.5581531\",\n \"0.5562479\",\n \"0.5551182\",\n \"0.5539688\",\n \"0.5519433\",\n \"0.5517796\",\n \"0.5513153\",\n \"0.55126715\",\n \"0.55102664\",\n \"0.55078965\",\n \"0.5503342\",\n \"0.5499455\",\n \"0.549913\",\n \"0.54909617\",\n \"0.54878175\",\n \"0.54877406\",\n \"0.5485328\",\n \"0.5483962\",\n \"0.5471404\",\n \"0.5471404\",\n \"0.5471404\",\n \"0.54642487\",\n \"0.546332\",\n \"0.5444217\",\n \"0.5442439\",\n \"0.54395443\",\n \"0.54385114\",\n \"0.5435785\",\n \"0.5433456\",\n \"0.543154\",\n \"0.542964\",\n \"0.5429292\",\n \"0.54109716\",\n \"0.54103136\",\n \"0.5410298\",\n \"0.54033947\",\n \"0.53937364\",\n \"0.5390834\",\n \"0.53859234\",\n \"0.5381933\",\n \"0.5381811\",\n \"0.5381126\",\n \"0.5378646\",\n \"0.5378289\",\n \"0.5374101\",\n \"0.53658336\",\n \"0.5365005\",\n \"0.5359063\",\n \"0.535822\",\n \"0.53561115\",\n \"0.53541446\",\n \"0.5353744\",\n \"0.5342868\",\n \"0.5340444\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.8212438"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":38191,"cells":{"query":{"kind":"string","value":"This method will compute the correct cost and the total cost of box cost quantity according to the parameters passed to it"},"document":{"kind":"string","value":"public double returnBoxCost(double cardGradeCost, double colourOptPercent, double reinfPercent, double sealablePercent, int qty, double length, double width, double height){\n\t\tdouble sum = cardGradeCost + (cardGradeCost * colourOptPercent / 100) + (cardGradeCost * reinfPercent / 100)\n\t\t\t\t+ (cardGradeCost * sealablePercent / 100); \n\t\t\n\t\tdouble computeTotal = 0;\n\t\tDecimalFormat df = new DecimalFormat(\"##.##\");\n\t\ttry{\n\t\t\tcomputeTotal = Double.valueOf(calcSurfaceAreaOfBox(length, width, height, sum, qty));\n\t\t\n\t\t\treturn Double.valueOf(df.format(computeTotal));\n\t\t\n\t\t}catch(NumberFormatException nme){\n\t\t\treturn 0.00;\n\t\t}\n\t}"},"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 static double Cost(double boxes, double Cost) {\n\tdouble pay = boxes * Cost;\n\treturn pay;\n}","public void calculateCost() {\n \tdouble costToShipPack;\n \tint numOfPacks = 1;\n \t\n \tfor(Package p: this.packages) {\n \t\tcostToShipPack = 3 + (p.calcVolume() - 1);\n \t\tthis.totalAmounts.put(\"Package \"+numOfPacks, costToShipPack);\n \t\tnumOfPacks++;\n \t}\n \t\n }","private void calculateCosts() {\r\n lb_CubicSum.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_Volume)) + \" €\");\r\n lb_MaterialCostSum.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_Price)) + \" €\");\r\n lb_CuttingTimeSum.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_CuttingHours)) + \" €\");\r\n lb_CuttingCostSum.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_CuttingPrice)) + \" €\");\r\n lb_TotalCosts.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_CuttingPrice) + getColmunSum(tc_Price)) + \" €\");\r\n\r\n ModifyController.getInstance().setProject_constructionmaterialList(Boolean.TRUE);\r\n }","public void compute(){\r\n\r\n\t\ttotalCost=(capAmount*CAPCOST)+(hoodyAmount*HOODYCOST)+(shirtAmount*SHIRTCOST);\r\n\t}","public void calculateCost()\n\t{\n\t\tLogManager lgmngr = LogManager.getLogManager(); \n\t\tLogger log = lgmngr.getLogger(Logger.GLOBAL_LOGGER_NAME);\n\t\tString s = \"\";\n\t\tint costperfeet = 0;\n\t\tif (this.materialStandard.equals(\"standard materials\") && this.fullyAutomated == false)\n\t\t\tcostperfeet = 1200;\n\t\telse if (this.materialStandard.equals(\"above standard materials\") && this.fullyAutomated == false)\n\t\t\tcostperfeet = 1500;\n\t\telse if(this.materialStandard.equals(\"high standard materials\") && this.fullyAutomated == false)\n\t\t\tcostperfeet = 1800;\n\t\telse if (this.materialStandard.equals(\"high standard materials\") && this.fullyAutomated == true)\n\t\t\tcostperfeet = 2500;\n\t\t\n\t\tint totalCost = costperfeet * this.totalArea;\n\t\t/*s = \"Total Cost of Construction is :- \";\n\t\twriter.printf(\"%s\" + totalCost, s);\n\t\twriter.flush();*/\n\t\tlog.log(Level.INFO, \"Total Cost of Construction is :- \" + totalCost);\n\t}","public double calculatingCostO(int quantity)\n { \n cost = 750 + (0.25 * quantity);\n return cost;\n \n }","public double calcCost() {\n if (pizzaSize.equals(\"small\")) {\n return 10.0 + ((cheeseToppings + pepperoniToppings + veggieToppings) * 2);\n\n }\n else if (pizzaSize.equals(\"medium\")) {\n return 12.0 + ((cheeseToppings + pepperoniToppings + veggieToppings) * 2);\n }\n else {\n return 14.0 + ((cheeseToppings + pepperoniToppings + veggieToppings) * 2);\n }\n }","public double calcCost() {\n // $2 per topping.\n double cost = 2 * (this.cheese + this.pepperoni + this.ham);\n // size cost\n switch (this.size) {\n case \"small\":\n cost += 10;\n break;\n case \"medium\":\n cost += 12;\n break;\n case \"large\":\n cost += 14;\n break;\n default:\n }\n return cost;\n }","public double returnBoxCost(double cardGradeCost, double colourOptPercent, double reinfPercent, double sealablePercent){\n\t\tdouble sum = cardGradeCost + ((cardGradeCost * colourOptPercent) / 100) + ((cardGradeCost * reinfPercent) / 100)\n\t\t\t\t+ ((cardGradeCost * sealablePercent) / 100); \n\t\tdouble computeTotal = 0.00;\n\t\t\n\t\tDecimalFormat df = new DecimalFormat(\"##.##\");\t\n\t\t\n\t\ttry{\n\t\t\tcomputeTotal = Double.valueOf(df.format(sum));\n\t\t\t}catch(NumberFormatException nme){\n\t\t\t\t\n\t\t\t}\n\t\treturn computeTotal;\n\t}","@Override\n protected double calcTotalCost() {\n \n double totalCost, templateBasicRate = DEFAULT_BASIC_RATE;\n double extraBedrooms = 0, extraBathrooms = 0;\n\n // if there are extra beds/baths\n if (this.getNumBedrooms() > DEFAULT_NUM_BEDROOMS)\n extraBedrooms = this.getNumBedrooms() - DEFAULT_NUM_BEDROOMS;\n\n if (this.getNumBathrooms() > DEFAULT_NUM_BATHROOMS)\n extraBathrooms = this.getNumBathrooms() - DEFAULT_NUM_BATHROOMS;\n\n // multiply basic rate by 1.5 if the total area is >= 3,000 sq ft\n if (this.getTotalArea() >= 3000)\n templateBasicRate *= 1.5;\n\n // calculate total cost\n totalCost = (templateBasicRate + ((800 * extraBedrooms) + (500 * extraBathrooms)));\n\n // add tax\n totalCost += (TAX * totalCost);\n\n return totalCost;\n }","double getCost();","double getCost();","double calculateDeliveryCost(Cart cart);","@Override\r\n\tpublic double getCost() {\r\n\t\tdouble total = 0;\r\n\t\t\r\n\t\tfor(Product p: parts) {\r\n\t\t\ttotal += p.getCost();\r\n\t\t}\r\n\t\t\r\n\t\treturn total;\r\n\t}","double getTotalCost();","public double calculateCost(Purchase purchase);","public double getCost() {\n return quantity*ppu;\n\n }","public String calcSurfaceAreaOfBox(double length, double width, double height, double cost, int quantity){\n\t\tdouble surfaceArea = 2*(width * length) + 2*(length * height) + 2*(width * height);\n\t\tdouble computedCost = cost * surfaceArea;\n\t\tdouble totalCost = computedCost * quantity;\n\t\n\t\tDecimalFormat df = new DecimalFormat(\"##.##\");\n\t\treturn df.format(totalCost);\n\t}","public abstract double getCost();","public void calculateCost(){\n if(this.isChair){\n for(int i = 0; i < this.chairs.length; i++){\n this.cost += this.chairs[i].getPrice();\n }\n }\n //if furniture type is chair, add up cost of all items in list\n if(this.isDesk){\n for(int i = 0; i < this.desks.length; i++){\n this.cost += this.desks[i].getPrice();\n }\n }\n //if furniture type is chair, add up cost of all items in list\n if(this.isFiling){\n for(int i = 0; i < this.filingCabinets.length; i++){\n this.cost += this.filingCabinets[i].getPrice();\n }\n }\n //if furniture type is chair, add up cost of all items in list\n if(this.isLamp){\n for(int i = 0; i < this.lamps.length; i++){\n this.cost += this.lamps[i].getPrice();\n }\n }\n }","public double calcCost(){\n double cost = 0;\n cost += pMap.get(size);\n cost += cMap.get(crust);\n //Toppings are priced at 3.00 for 3-4 topppings, and 4.0 for 5+ toppings\n \n if(toppings !=null)\n {\n if((toppings.length == 3) || (toppings.length == 4)){\n cost += 3.0;\n }\n if (toppings.length > 4){\n cost += 4.0;\n }\n }\n \n return cost;\n }","public double getCost() {\n\t\t\n\t\tdouble cost = 0;\n\t\t\n\t\tif (Objects.equals(Size, \"small\"))\n\t\t\tcost = 7.00;\n\t\telse if (Objects.equals(Size, \"medium\"))\n\t\t\tcost = 9.00;\n\t\telse if (Objects.equals(Size, \"large\"))\n\t\t\tcost = 11.00;\n\t\t\n\t\tcost += (Cheese - 1)*1.50;\n\t\tcost += Ham*1.50;\n\t\tcost += Pepperoni*1.50;\n\t\t\n\t\treturn cost;\t\t\n\t}","@Override\n public double calcCost() {\n return calcSalesFee()+calcTaxes();\n }","@Override\r\n\tprotected void processCost() {\n\r\n\t}","@Override\n public double cost()\n {\n return this.price * this.number;\n }","public static void main(String[] args) {\n \n // Number of pairs of socks\n int nSocks=3;\n // Cost per pair of socks\n double sockCost$=2.58;\n \n // Number of drinking glasses\n int nGlasses=6;\n // Cost per glass\n double glassCost$=2.29;\n \n // Number of boxes of envelopes\n int nEnvelopes=1;\n // Cost per box of envelopes\n double envelopeCost$=3.25;\n double taxPercent=0.06;\n \n double totalSockCost$; // Total cost of socks\n double totalGlassCost$; // \n double totalEnvelopeCost$; // \n double costOfSocksBeforeTax, totalCostOfSocks1, totalCostOfSocks2, glassCost, sockCost;\n double costOfGlassesBeforeTax, totalCostOfGlasses1, totalCostOfGlasses2;\n double costOfEnvelopesBeforeTax, totalCostOfEnvelopes1, totalCostOfEnvelopes2, envelopeCost;\n double costBeforeTax, costAfterTax, glassesBeforeTax, envelopesBeforeTax, socksBeforeTax;\n \n socksBeforeTax=nSocks*sockCost$;\n glassesBeforeTax=nGlasses*glassCost$;\n envelopesBeforeTax=nEnvelopes*envelopeCost$;\n \n costOfSocksBeforeTax=nSocks*sockCost$;\n totalCostOfSocks1=costOfSocksBeforeTax*taxPercent;\n totalCostOfSocks2=costOfSocksBeforeTax-totalCostOfSocks1;\n \n costOfGlassesBeforeTax=nGlasses*glassCost$;\n totalCostOfGlasses1=costOfGlassesBeforeTax*taxPercent;\n totalCostOfGlasses2=costOfGlassesBeforeTax-totalCostOfGlasses1;\n \n costOfEnvelopesBeforeTax=nEnvelopes*envelopeCost$;\n totalCostOfEnvelopes1=costOfEnvelopesBeforeTax*taxPercent;\n totalCostOfEnvelopes2=costOfEnvelopesBeforeTax-totalCostOfEnvelopes1;\n \n costBeforeTax=costOfEnvelopesBeforeTax+costOfGlassesBeforeTax+costOfSocksBeforeTax;\n costAfterTax=totalCostOfEnvelopes2+totalCostOfGlasses2+totalCostOfSocks2;\n \n // printing out how many items you have\n System.out.println(\"Socks:\");\n System.out.println(\"Socks cost \"+sockCost$+\" each.\");\n System.out.println(\"Price after tax is \"+socksBeforeTax+\".\");\n System.out.println(\"We are buying \"+nSocks+\".\");\n System.out.println(\"Price before tax is \"+totalCostOfSocks2+\".\");\n \n System.out.println(\"Glasses:\");\n System.out.println(\"Glasses cost \"+glassCost$+\" each.\");\n System.out.println(\"We are buying \"+nGlasses+\" each.\");\n System.out.println(\"Price after tax is \"+glassesBeforeTax+\".\");\n System.out.println(\"Price before tax is \"+totalCostOfGlasses2+\".\");\n \n System.out.println(\"Envelopes:\");\n System.out.println(\"Envelopes cost \"+envelopeCost$+\" each.\");\n System.out.println(\"We are buying \"+nEnvelopes+\".\");\n System.out.println(\"Price after tax is \"+envelopesBeforeTax+\".\");\n System.out.println(\"Price before tax is \"+totalCostOfEnvelopes2+\".\");\n \n System.out.println(\"Total cost of everything after tax is \"+costBeforeTax+\".\");\n System.out.println(\"Total cost of everything before tax is \"+costAfterTax+\".\");\n \n\n }","@Override\n\tpublic double cost() {\n\t\tdouble price = good.cost();\n\t\treturn price+price/2;\n\t}","int getCost();","int getCost();","int getCost();","public void calculateCost(Order currentOrder) {\n\n BigDecimal area = currentOrder.getArea();\n BigDecimal materialCost = (area.multiply(currentOrder.getProduct().getCostPerSqFt())).setScale(2);\n BigDecimal laborCost = (area.multiply(currentOrder.getProduct().getLaborCostPerSqFt()));\n BigDecimal tax = laborCost.add(materialCost).multiply(currentOrder.getState().getTaxRate().movePointLeft(2));\n BigDecimal total = materialCost.add(laborCost).add(tax);\n\n //using half_up for rounding to get the (nearest neighbor)\n //Setting each price to the object\n currentOrder.setMaterialCost(materialCost.setScale(2, RoundingMode.HALF_UP));\n currentOrder.setLaborCost(laborCost.setScale(2, RoundingMode.HALF_UP));\n currentOrder.setTax(tax.setScale(2, RoundingMode.HALF_UP));\n currentOrder.setTotal(total.setScale(2, RoundingMode.HALF_UP));\n }","public int calculateCost() {\n int premium = surety.calculatePremium(insuredValue);\n SuretyType suretyType = surety.getSuretyType();\n int commission = (int) Math.round(premium * vehicle.getCommission(suretyType));\n return premium + commission;\n }","public void calculateOrderCost(){\n int tmpCost=0;\n for (Vehicle v : vehicleList){\n tmpCost+=v.getCost();\n }\n totalCost=tmpCost;\n }","@Override\n\tvoid get_cost_per_sqarefeet() {\n\t\tcost=1800;\n\t}","public double costNEX() {\r\n double diff=0;\r\n double intensity=0;\r\n \r\n for(int x=Config.ptvXLow-0; x < Config.ptvXHigh+0; x++) {\r\n// for(int x=Solver.xBoundsTumor[0]; x < Solver.xBoundsTumor[1]; x+= Config.scaleFactor) {\r\n for(int y=Config.ptvYLow-0; y < Config.ptvYHigh+0; y++) {\r\n// for(int y=Solver.yBoundsTumor[0]; y < Solver.yBoundsTumor[1]; y+= Config.scaleFactor) {\r\n for(int z=Config.ptvZLow-0; z < Config.ptvZHigh+0; z++) {\r\n// for(int z=Solver.zBoundsTumor[0]; z < Solver.zBoundsTumor[1]; z+= Config.scaleFactor) {\r\n\r\n this.body2[x][y][z].setCurrentDosis(0.0); //Set currentPtvVoxel Dose to 0 \r\n for(int i=0; i<Config.numberOfSeeds;++i) { \r\n // Calculate intensity based based on current dwelltime\r\n intensity = this.body2[x][y][z].radiationIntensity(this.seeds2[i].getCoordinate(), New_state[i]);\r\n if (intensity>0) {\r\n// LogTool.print(\"Cost: Intensity :\" + intensity + \"@ \" + x + \" \" + y + \" \" + z,\"notification\");\r\n }\r\n this.body2[x][y][z].addCurrentDosis(intensity);\r\n } \r\n diff += Math.pow((this.body2[x][y][z].getGoalDosis()-this.body2[x][y][z].getCurrentDosis()),2);\r\n// LogTool.print(\" diffdose \" + (Looper.body2[x][y][z].getGoalDosis()-Looper.body2[x][y][z].getCurrentDosis()),\"notification\");\r\n } \r\n }\r\n }\r\n return Math.sqrt(diff);\r\n// return Math.random();\r\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}","protected abstract double getDefaultCost();","public void printCost() {\r\n double cost;\r\n cost = quantity * price;\r\n System.out.printf(\"Total cost = $%.2f\", cost);\r\n }","public static double calculations(int quantity, double cost) {\r\n\tdouble price = 0;\r\n\tprice = quantity*cost;\r\n\treturn price = price+calculateTax(price);\r\n\t}","@Override\n\tpublic int calculateCost() \n\t{\n\t\treturn (this.modernCenterpieceCost*this.centerpieceCount);\n\t}","@Override\r\n\tpublic int cost() {\n\t\treturn b1.cost() + 1;\r\n\t}","private void calcPrice() {\n double itemPrice = 0;\n \n //get price of burger (base)\n if (singleRad.isSelected())\n {\n itemPrice = 3.50;\n }\n else \n {\n itemPrice = 4.75;\n }\n \n //check options add to item price\n if(cheeseCheckbox.isSelected())\n itemPrice = itemPrice += 0.50;\n if(baconCheckbox.isSelected())\n itemPrice = itemPrice += 1.25;\n if(mealCheckbox.isSelected())\n itemPrice = itemPrice += 4.00;\n \n //include the quantity for the item price\n int quantity= 1;\n if (quantityTextField.getText().equals(\"\"))\n quantityTextField.setText(\"1\");\n quantity = Integer.parseInt(quantityTextField.getText());\n itemPrice = itemPrice * quantity;\n\n \n //show the price no $ symbol\n \n itemPriceTextField.setText(d2.format(itemPrice));\n }","@Override\r\n\tpublic void addToCost() {\n\t\t\r\n\t}","private void calculatePrice(int quantity) {\n int price = quantity * priceOfCoffee;\n }","public abstract int getCost();","public abstract int getCost();","public abstract int getCost();","private int determineCost(JCheckBox chcBox) {\r\n int cost = 0;\r\n String departmentName = chcBox.getText();\r\n\r\n if (departmentName.equals(\"Bogen\")) {\r\n cost = 8;\r\n } else if (departmentName.equals(\"Luftdruck\")) {\r\n cost = 10;\r\n } else if (departmentName.equals(\"Feuerwaffen\")) {\r\n cost = 15;\r\n } else {\r\n System.out.println(\"Nichts\");\r\n }\r\n\r\n return cost;\r\n }","@Override\n public double getCost() {\n\t return 13;\n }","float calculatePrice () \n\t{\n\t\tfloat final_price = 0;\n\t\tfinal_price = (float)(price * quantity); // price * number of items\n\t\tfinal_price += final_price*(.10); // add tax\n\t\tif(perishable.equals(\"P\"))\n\t\t{\n\t\t\tfloat ship = (float)(20* weight)*quantity; // add shipping\n\t\t\tship += ship*.20;\n\t\t\tfinal_price += ship;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tfinal_price += (20* weight)*quantity; // add shipping\n\t\t}\n\t\treturn final_price;\n\t}","public static void main(String[] args) {\n Scanner sc = new Scanner(System.in);\n int q = sc.nextInt();\n\n for(int k = 0; k < q; k++) {\n int m = sc.nextInt();\n int n = sc.nextInt();\n\n // indicate number of pieces\n long x = 1;\n long y = 1;\n \n ArrayList<Long> c_y = new ArrayList<Long>();\n for(int i = 0; i < m - 1; i++) {\n c_y.add(sc.nextLong());\n }\n \n ArrayList<Long> c_x = new ArrayList<Long>();\n for(int i = 0; i < n - 1; i++) {\n c_x.add(sc.nextLong());\n }\n\n Collections.sort(c_y, Collections.reverseOrder());\n Collections.sort(c_x, Collections.reverseOrder());\n\n // cut: most expensive = cut first\n int index_X = 0;\n int index_Y = 0;\n long totalCost = 0;\n\n while(!(x == n && y == m)) {\n if(x < n && y < m) {\n // compare cost to decide whether cut horizontally or vertically\n if(c_y.get(index_Y) >= c_x.get(index_X)) {\n totalCost += c_y.get(index_Y) * x;\n y++;\n index_Y++;\n } else if(c_y.get(index_Y) < c_x.get(index_X)) {\n totalCost += c_x.get(index_X) * y;\n x++;\n index_X++; \n }\n } else if(x == n && y < m) {\n totalCost += c_y.get(index_Y) * x;\n index_Y++;\n y++;\n } else if(x < n && y == m) {\n totalCost += c_x.get(index_X) * y;\n index_X++;\n x++;\n }\n }\n\n totalCost = totalCost % (long)(Math.pow(10, 9) + 7);\n System.out.println(totalCost );\n }\n }","private double calcCost(Cloudlet cloudlet, FogDevice fogDevice) {\n double cost = 0;\n //cost includes the processing cost\n cost += fogDevice.getCharacteristics().getCostPerSecond() * cloudlet.getCloudletLength( ) / fogDevice.getHost().getTotalMips();\n // cost includes the memory cost\n cost += fogDevice.getCharacteristics().getCostPerMem() * cloudlet.getMemRequired();\n // cost includes the bandwidth cost\n cost += fogDevice.getCharacteristics().getCostPerBw() * (cloudlet.getCloudletFileSize() + cloudlet.getCloudletOutputSize());\n return cost;\n }","@Pure\n\tdouble getCost();","double getSolutionCost();","float getCostReduction();","@Override\n\tpublic double getCost() {\n\t\treturn price * weight; // cost = price of the candy * weight of candies\n\t}","public String returnBoxCost(double cardGradeCost, String colourOption, String reinfBotOption, \n\t\t\tString reinfCornOption, String sealOption){\n\t\tdouble colOptPercent = 0.00;\n\t\tdouble reinfPercent = 0.00;\n\t\tdouble sealPercent = 0.00;\n\t\t\n\t\tif(colourOption.equals(\"2\")){\n\t\t\tcolOptPercent = 15.00;\n\t\t}else if(colourOption.equals(\"1\")){\n\t\t\tcolOptPercent = 12.00;\n\t\t}else{\n\t\t\tcolOptPercent = 0.00;\n\t\t}\n\t\t\n\t\tif((reinfBotOption.equals(\"true\")) && (reinfCornOption.equals(\"true\"))){\n\t\t\treinfPercent = 17.00;\n\t\t}else if((reinfBotOption.equals(\"true\")) && (reinfCornOption.equals(\"false\"))){\n\t\t\treinfPercent = 10.00;\n\t\t}else if((reinfBotOption.equals(\"false\")) && (reinfCornOption.equals(\"true\"))){\n\t\t\treinfPercent = 7.00;\n\t\t}else if((reinfBotOption.equals(\"true\")) && (reinfCornOption.equals(\"select\"))){\n\t\t\treinfPercent = 10.00;\n\t\t}else if((reinfBotOption.equals(\"select\")) && (reinfCornOption.equals(\"false\"))){\n\t\t\treinfPercent = 7.00;\n\t\t}else{\n\t\t\treinfPercent = 0.00;\n\t\t}\n\t\t\n\t\tif(sealOption.equals(\"true\")){\n\t\t\tsealPercent = 5.00;\n\t\t}else if(sealOption.equals(\"false\")){\n\t\t\tsealPercent = 0.00;\n\t\t}else{\n\t\t\tsealPercent = 0.00;\n\t\t}\n\t\t\n\t\tdouble sum = cardGradeCost+((cardGradeCost*colOptPercent)/100) + ((cardGradeCost*reinfPercent)/100)\n\t\t\t\t+ ((cardGradeCost*sealPercent)/100); \n\t\n\t\tDecimalFormat df = new DecimalFormat(\"##.##\");\t\n\t\treturn df.format(sum);\n\t}","public void calcAction(View v) \n\t{\n\t\ttry\n\t\t{\n\t\t\tString initial = size.getText().toString(); /* the following gets user input, in order to do calculations */\n\t\t\tString end = \"Nothing\"; /* This is the default text in case the unexpected happens */\n\t\t\tunit = selection.getSelectedItem().toString(); /* this gets the unit of measure that the user specifies */\n\t\tdouble convert = Double.parseDouble(initial); /* this converts the size input to numerical data, in order for calculations to be done */\n\t\t\tcapacity.setStorage(convert); /* send input to external class */\n\t\t\tDecimalFormat twop = new DecimalFormat(\"#.##\"); /* created new object, in order to format output to display two decimal places at most */\n\n\t\t\t/* the following conditional statement reads the unit of measure specify by the user, puts the data into the proper formula, and returns the results */\n\n\t\t\tif (unit.equals(\"KB\")) // runs if user specifies KB\n\t\t\t{\n\t\t\t\tend = twop.format(capacity.getKB());\n\t\t\t}\n\n\t\t\telse if (unit.equals(\"MB\")) /* runs if user specifies MB */\n\t\t\t{\n\t\t\t\tend = twop.format(capacity.getMB());\n\t\t\t}\n\n\t\t\telse if (unit.equals(\"GB\")) /* runs if user specifies GB */\n\t\t\t{\n\t\t\t\tend = twop.format(capacity.getGB());\n\t\t\t}\n\n\t\t\telse if (unit.equals(\"TB\")) /* runs if user specifies TB */\n\t\t\t{\n\t\t\t\tend = twop.format(capacity.getTB());\n\t\t\t}\n\n\t\t\telse if (unit.equals(\"PB\")) /* runs if user specifies PB */\n\t\t\t{\n\t\t\t\tend = twop.format(capacity.getPB());\n\t\t\t}\n\n\t\t\telse if (unit.equals(\"EB\")) /* runs if user specifies EB */\n\t\t\t{\n\t\t\t\tend = twop.format(capacity.getEB());\n\t\t\t}\n\n\t\t\telse if (unit.equals(\"ZB\")) /* runs if user specifies ZB */\n\t\t\t{\n\t\t\t\tend = twop.format(capacity.getZB());\n\t\t\t}\n\n\t\t\telse if (unit.equals(\"YB\")) /* runs if user specifies YB */\n\t\t\t{\n\t\t\t\tend = twop.format(capacity.getYB());\n\t\t\t}\n\n\t\t\telse; // send default text, if unexpected happens.\n\n\t\t\tresult.setText(end); // display results\n\t\t}\n\n\t\tcatch (NumberFormatException e)\n\t\t{\n\t\t\tAlertDialog.Builder m = new AlertDialog.Builder(this);\n\t\t\tm.setTitle(R.string.error); // set dialog title\n\t\t\tm.setMessage(R.string.error_message).setCancelable(true).setPositiveButton(R.string.ok, new DialogInterface.OnClickListener()\n\t\t\t{\n\t\t\t\tpublic void onClick(DialogInterface dialog, int id)\n\t\t\t\t{\n\t\t\t\t\tdialog.cancel();\n\t\t\t\t}\n\t\t\t});\n\t\t\tm.create();\n\t\t\tm.show();\n\t\t}\t\n\t}","public float totalCost() {\n\t\tttCost = 0;\n\t\tfor (int i = 0; i < itemsOrdered.size(); i++) {\n\t\t\tttCost += itemsOrdered.get(i).getCost();\n\t\t}\n\t\treturn ttCost;\n\t}","@Test\n\tvoid testCost() {\n\t\tint nbCores = 16;\n\t\tlong duration = 2000;\n\t\tDate requestDate = new Date(\"01/01/2000\");\n\t\tJob j1 = new Job(nbCores,requestDate,duration,mediumQ);//16 cores less than 1h\n\t\tJob j2 = new Job(nbCores*2,requestDate,duration,mediumQ);//32 cores less than 1h\n\t\tJob j3 = new Job(nbCores*2+1,requestDate,duration,mediumQ);//33 cores less than 1h\n\t\tJob j4 = new Job(nbCores,requestDate,duration*2,mediumQ);//16 cores more than 1h\n\t\tJob j5 = new Job(nbCores*2+1,requestDate,duration*2,mediumQ);//33 cores more than 1h\n\t\tassertEquals(j1.getCost(),0.05f);\n\t\tassertEquals(j2.getCost(),0.05f);\n\t\tassertEquals(j3.getCost(),0.1f);\n\t\tassertEquals(j4.getCost(),0.1f);\n\t\tassertEquals(j5.getCost(),0.2f);\n\t}","double ComputeCost(double order, double tipPercent, double serviceRating, double foodRating)\r\n {\r\n // kazda gwiazdka to 2 procent od sumy zamówienia\r\n return order + order * (tipPercent/100) + (serviceRating * 0.02) * order + (foodRating * 0.02) * order;\r\n }","public float getCost()\r\n/* 13: */ {\r\n/* 14:10 */ return this.costFromStart + this.estimatedCostToGoal;\r\n/* 15: */ }","public double getCost() {\r\n\t\t\r\n\t\tif (super.getSize() == \"Small\") { totalCost = 2.00; }\r\n\t\t\r\n\t\tif (super.getSize() == \"Medium\") { totalCost = 2.50; }\r\n\t\t\r\n\t\tif (super.getSize() == \"Large\") { totalCost = 3.00; }\r\n\t\t\r\n\t\treturn totalCost;\r\n\t}","@Override\n\tpublic double cost() {\n\t\treturn 2.19;\n\t}","@Override\n\tprotected void setCost(double cst) {\n\t\t\n\t}","public void calculatePaintAndLabor(){\n this.numGallons = squareFeet/115;\n System.out.println(\"Number of Gallons: \" + numGallons);\n this.laborHours = numGallons * 8;\n System.out.println(\"Number of Hours: \" + laborHours);\n this.paintCost = numGallons * pricePerGallon;\n System.out.println(\"Price of Paint: $\" + paintCost);\n this.laborCost = laborHours * 20.00;\n System.out.println(\"Price of Labor: $\" + laborCost);\n this.totalCost = paintCost + laborCost;\n System.out.println(\"Total Cost: $\" + totalCost);\n\n }","public float getCost(Node n){\n char t1 = this.type;\n char t2 = n.getType();\n int row1 = this.row;\n int col1 = this.col;\n int row2 = n.getRow();\n int col2 = n.getCol();\n boolean straight;\n\n if(row1 == row2 || col1 == col2)\n straight = true;\n else\n straight = false;\n\n if(straight){\n switch (t1){\n case '1':\n switch (t2){\n case '1':\n return 1;\n case '2':\n return (float)1.5;\n case 'a':\n return 1;\n case 'b':\n return (float)1.5;\n }\n break;\n case '2':\n switch (t2){\n case '1':\n return (float)1.5;\n case '2':\n return 2;\n case 'a':\n return (float)1.5;\n case 'b':\n return 2;\n }\n break;\n case 'a':\n switch (t2){\n case '1':\n return 1;\n case '2':\n return (float)1.5;\n case 'a':\n return (float).25;\n case 'b':\n return (float).375;\n }\n break;\n case 'b':\n switch (t2){\n case '1':\n return (float)1.5;\n case '2':\n return 2;\n case 'a':\n return (float).375;\n case 'b':\n return (float).25;\n }\n break;\n }\n } else{\n switch(t1){\n case '1':\n switch (t2){\n case 'a':\n case '1':\n return (float)Math.sqrt(2);\n case '2':\n case 'b':\n return (float)((Math.sqrt(2)+Math.sqrt(8))/2);\n }\n break;\n case '2':\n switch (t2){\n case 'a':\n case '1':\n return (float)((Math.sqrt(2)+Math.sqrt(8))/2);\n case '2':\n case 'b':\n return (float)Math.sqrt(8);\n }\n break;\n case 'a':\n switch (t2){\n case 'a':\n case '1':\n return (float)Math.sqrt(2);\n case '2':\n case 'b':\n return (float)((Math.sqrt(2)+Math.sqrt(8))/2);\n }\n break;\n case 'b':\n switch (t2){\n case 'a':\n case '1':\n return (float)((Math.sqrt(2)+Math.sqrt(8))/2);\n case '2':\n case 'b':\n return (float)Math.sqrt(8);\n }\n break;\n }\n }\n\n return 0;\n }","private CostHelper() {}","public void calculaMatrizCostes() {\n int i, j;\n double xd, yd;\n costes = new int[n][n];\n for (i = 0; i < n; i++) {\n for (j = 0; j < n; j++) {\n xd = vx[i] - vx[j];\n yd = vy[i] - vy[j];\n costes[i][j] = (int) Math.round(Math.sqrt((xd * xd) + (yd * yd)));\n }\n }\n }","public double calcTotal(){\n\t\tdouble total; // amount to be returned\n\t\t\n\t\t// add .50 cents for any milk that isn't whole or skim, and .35 cents for flavoring\n\t\tif ((milk != \"whole\" && milk != \"skim\") && flavor != \"no\"){\n\t\t\tcost += 0.85;\t\n\t\t}\n\t\t\n\t\t// add .35 cents for flavoring\n\t\telse if (flavor != \"no\"){\n\t\t\tcost += 0.35;\t\n\t\t}\n\t\t\n\t\t// add .50 cents for milk that isn't whole or skim\n\t\telse if (milk != \"whole\" && milk != \"skim\"){\n\t\t\tcost += 0.50;\n\t\t}\n\t\t\n\t\telse{\n\t\t}\n\t\t\n\t\t// add .50 cents for extra shot of espresso\n\t\tif (extraShot != false){\n\t\t\ttotal = cost + 0.50;\n\t\t}\n\t\telse\n\t\t\ttotal = cost;\n\t\t\n\t\treturn total;\n\t}","public double totalQuantity() {\r\n\t\tdouble t = 0;\r\n\t\tfor(int i=0;i<boxes[0];i++)\r\n\t\t\tfor(int j=0;j<boxes[1];j++)\r\n\t\t\t\tfor(int k=0;k<boxes[2];k++) t += quantity[i][j][k];\r\n\t\treturn t;\r\n\t}","public void generateCost() throws StandardException {\n\n double baseTableSelectivity = computePhaseSelectivity(selectivityHolder,QualifierPhase.BASE);\n double filterBaseTableSelectivity = computePhaseSelectivity(selectivityHolder,QualifierPhase.BASE,QualifierPhase.FILTER_BASE);\n double projectionSelectivity = computePhaseSelectivity(selectivityHolder,QualifierPhase.FILTER_PROJECTION);\n double totalSelectivity = computeTotalSelectivity(selectivityHolder);\n\n assert filterBaseTableSelectivity >= 0 && filterBaseTableSelectivity <= 1.0:\"filterBaseTableSelectivity Out of Bounds -> \" + filterBaseTableSelectivity;\n assert baseTableSelectivity >= 0 && baseTableSelectivity <= 1.0:\"baseTableSelectivity Out of Bounds -> \" + baseTableSelectivity;\n assert projectionSelectivity >= 0 && projectionSelectivity <= 1.0:\"projectionSelectivity Out of Bounds -> \" + projectionSelectivity;\n assert totalSelectivity >= 0 && totalSelectivity <= 1.0:\"totalSelectivity Out of Bounds -> \" + totalSelectivity;\n\n // Total Row Count from the Base Conglomerate\n double totalRowCount = scc.baseRowCount();\n assert totalRowCount >= 0 : \"totalRowCount cannot be negative -> \" + totalRowCount;\n // Rows Returned is always the totalSelectivity (Conglomerate Independent)\n scanCost.setEstimatedRowCount(Math.round(totalRowCount*totalSelectivity));\n\n double baseTableAverageRowWidth = scc.getBaseTableAvgRowWidth();\n double baseTableColumnSizeFactor = scc.baseTableColumnSizeFactor(totalColumns);\n\n // We use the base table so the estimated heap size and remote cost are the same for all conglomerates\n double colSizeFactor = baseTableAverageRowWidth*baseTableColumnSizeFactor;\n assert baseTableAverageRowWidth >= 0 : \"baseTableAverageRowWidth cannot be negative -> \" + baseTableAverageRowWidth;\n assert baseTableColumnSizeFactor >= 0 : \"baseTableColumnSizeFactor cannot be negative -> \" + baseTableColumnSizeFactor;\n\n double openLatency = scc.getOpenLatency();\n double closeLatency = scc.getCloseLatency();\n double localLatency = scc.getLocalLatency();\n double remoteLatency = scc.getRemoteLatency();\n double remoteCost = openLatency + closeLatency + totalRowCount*totalSelectivity*remoteLatency*(1+colSizeFactor/100d);\n assert openLatency >= 0 : \"openLatency cannot be negative -> \" + openLatency;\n assert closeLatency >= 0 : \"closeLatency cannot be negative -> \" + closeLatency;\n assert localLatency >= 0 : \"localLatency cannot be negative -> \" + localLatency;\n assert remoteLatency >= 0 : \"remoteLatency cannot be negative -> \" + remoteLatency;\n assert remoteCost >= 0 : \"remoteCost cannot be negative -> \" + remoteCost;\n // Heap Size is the avg row width of the columns for the base table*total rows\n // Average Row Width\n // This should be the same for every conglomerate path\n scanCost.setEstimatedHeapSize((long)(totalRowCount*totalSelectivity*colSizeFactor));\n // Should be the same for each conglomerate\n scanCost.setRemoteCost((long)remoteCost);\n // Base Cost + LookupCost + Projection Cost\n double congAverageWidth = scc.getConglomerateAvgRowWidth();\n double baseCost = openLatency+closeLatency+(totalRowCount*baseTableSelectivity*localLatency*(1+congAverageWidth/100d));\n assert congAverageWidth >= 0 : \"congAverageWidth cannot be negative -> \" + congAverageWidth;\n assert baseCost >= 0 : \"baseCost cannot be negative -> \" + baseCost;\n scanCost.setFromBaseTableRows(filterBaseTableSelectivity * totalRowCount);\n scanCost.setFromBaseTableCost(baseCost);\n double lookupCost;\n if (lookupColumns == null)\n lookupCost = 0.0d;\n else {\n lookupCost = totalRowCount*filterBaseTableSelectivity*(openLatency+closeLatency);\n scanCost.setIndexLookupRows(filterBaseTableSelectivity*totalRowCount);\n scanCost.setIndexLookupCost(lookupCost+baseCost);\n }\n assert lookupCost >= 0 : \"lookupCost cannot be negative -> \" + lookupCost;\n\n double projectionCost;\n if (projectionSelectivity == 1.0d)\n projectionCost = 0.0d;\n else {\n projectionCost = totalRowCount * filterBaseTableSelectivity * localLatency * colSizeFactor*1d/1000d;\n scanCost.setProjectionRows(scanCost.getEstimatedRowCount());\n scanCost.setProjectionCost(lookupCost+baseCost+projectionCost);\n }\n assert projectionCost >= 0 : \"projectionCost cannot be negative -> \" + projectionCost;\n\n double localCost = baseCost+lookupCost+projectionCost;\n assert localCost >= 0 : \"localCost cannot be negative -> \" + localCost;\n scanCost.setLocalCost(localCost);\n scanCost.setNumPartitions(scc.getNumPartitions());\n scanCost.setLocalCostPerPartition((baseCost + lookupCost + projectionCost)/scc.getNumPartitions());\n }","double setCost(double cost);","public double GetCost() {\n if( LotSize != CurLotSize ) {\n double CostPerShot = Cost / (double) LotSize;\n return CommonTools.RoundFractionalTons( CostPerShot * (double) CurLotSize );\n }\n return Cost;\n }","@Override\n public void calculateCost(final ResourceAllocation allocation) {\n final IReservable reservable = this.resourceDataSource.get(allocation.getResourceId());\n\n final double units = getCostUnits(allocation, reservable);\n\n // check on external ??\n final double costPerUnit = reservable.getCostPerUnit();\n final int quantity = allocation.getQuantity();\n // calculate cost and round to 2 decimals\n final double cost = DataSourceUtils.round2(costPerUnit * units * quantity);\n\n allocation.setCost(cost);\n }","@Override\n\tpublic double calcConsumedEnergy() {\n\t\treturn (getBasicEnergyCost() * 4);\n\t}","public void amount() {\n \t\tfloat boxOHamt=boxOH*.65f*48f;\n \t\tSystem.out.printf(boxOH+\" boxes of Oh Henry ($0.65 x 48)= $%4.2f \\n\",boxOHamt);\n \t\tfloat boxCCamt=boxCC*.80f*48f;\n \t\tSystem.out.printf(boxCC+\" boxes of Coffee Crisp ($0.80 x 48)= $%4.2f \\n\", boxCCamt);\n \t\tfloat boxAEamt=boxAE*.60f*48f;\n \t\tSystem.out.printf(boxAE+\" boxes of Aero ($0.60 x 48)= $%4.2f \\n\", boxAEamt);\n \t\tfloat boxSMamt=boxSM*.70f*48f;\n \t\tSystem.out.printf(boxSM+\" boxes of Smarties ($0.70 x 48)= $%4.2f \\n\", boxSMamt);\n \t\tfloat boxCRamt=boxCR*.75f*48f;\n \t\tSystem.out.printf(boxCR+\" boxes of Crunchies ($0.75 x 48)= $%4.2f \\n\",boxCRamt);\n \t\tSystem.out.println(\"----------------------------------------------\");\n \t\t//display the total prices\n \t\tsubtotal=boxOHamt+boxCCamt+boxAEamt+boxSMamt+boxCRamt;\n \t\tSystem.out.printf(\"Sub Total = $%4.2f \\n\", subtotal);\n \t\ttax=subtotal*.07f;\n \t\tSystem.out.printf(\"Tax = $%4.2f \\n\", tax);\n \t\tSystem.out.println(\"==============================================\");\n \t\ttotal=subtotal+tax;\n \t\tSystem.out.printf(\"Amount Due = $%4.2f \\n\", total);\n \t}","public static double calcularCosto(String tipoLicencia, int vigencia) {\n float monto = 0;\n switch(tipoLicencia){\n case \"Clase A\": \n switch(vigencia){\n case 1: monto = 20;\n break;\n case 3: monto = 25;\n break;\n case 4: monto = 30;\n break;\n case 5: monto = 40;\n break;\n }\n break;\n case \"Clase B\": switch(vigencia){\n case 1: monto = 20;\n break;\n case 3: monto = 25;\n break;\n case 4: monto = 30;\n break;\n case 5: monto = 40;\n break;\n }\n break;\n case \"Clase C\": switch(vigencia){\n case 1: monto = 23;\n break;\n case 3: monto = 30;\n break;\n case 4: monto = 35;\n break;\n case 5: monto = 47;\n break;\n }\n break;\n case \"Clase D\": switch(vigencia){\n case 1: monto = 20;\n break;\n case 3: monto = 25;\n break;\n case 4: monto = 30;\n break;\n case 5: monto = 40;\n break;\n }\n break;\n case \"Clase E\": switch(vigencia){\n case 1: monto = 29;\n break;\n case 3: monto = 39;\n break;\n case 4: monto = 44;\n break;\n case 5: monto = 59;\n break;\n }\n break;\n case \"Clase F\": switch(vigencia){\n case 1: monto = 20;\n break;\n case 3: monto = 25;\n break;\n case 4: monto = 30;\n break;\n case 5: monto = 40;\n break;\n }\n break;\n case \"Clase G\": switch(vigencia){\n case 1: monto = 20;\n break;\n case 3: monto = 25;\n break;\n case 4: monto = 30;\n break;\n case 5: monto = 40;\n break;\n }\n break;\n } \n return monto;\n }","@Override\n public double cost(){\n return 2 + super.cake.cost();\n }","@Pure\n\tdouble getEstimatedCost();","public static void main(String[] args) {\n\n\t\tCustomer customer = new Customer();\n\t\tShoppingCart cart = new ShoppingCart();\n\t\tBill bill = new Bill();\n\t\t\n\t\tcustomer.addCart(cart);\n\t\t\n\t\tint cost1 = 15;\n\t\tint cost2 = 30;\n\t\tint cost3 = 10;\n\t int cost4 = 20;\n\t\t\n\t\tItem item1 = new Item( 12345666L);\n\t\titem1.setCost(cost1);\n\t\tItem item2 = new Item(12345667L);\n\t\titem2.setCost(cost2);\n\t\tItem item3 = new Item(12345668L);\n\t\titem3.setCost(cost3);\n\t\tItem item4 = new Item(12345669L);\n\t\titem4.setCost(cost4);\n\t\t\n\t\tcart.addItem(item1);\n\t\tcart.addItem(item2);\n\t\tcart.addItem(item3);\n\t\tcart.addItem(item4);\n\t\t\n\t\t\n\t\tint total = cart.getTotal();\n\t\t\n\t\tint actual = cost1 + cost2 + cost3 + cost4 ;\n\t\t\n\t\tif(total==actual){\n\t\tSystem.out.println(\"getTotal is correct\");\n\t\tSystem.out.println(\"item 1 is \" + cost1 + \"item 2 is \"+cost2 + \"item 3 is \" + cost3 + \"item 4 is \"+ cost4);\n\t\tSystem.out.println(\"Total is \" + total);\n\t\t}else{\n\t\tSystem.out.println(\"getTotal is wrong\");\n\t\tSystem.out.println(\"expected \" + actual);\t\n\t\tSystem.out.println(\"returned \" + total);\t\n\t\t}\n\t\t\n\t\tSystem.out.println(\"removing an item from cart \");\n\t\t\n\t\tcart.removeItem(item4);\n\t\tint newActual = cost1 + cost2 + cost3;\n\t\tint newTotal = cart.getTotal();\n\t\tif(total==actual){\n\t\t\tSystem.out.println(\"getTotal is correct\");\n\t\t\tSystem.out.println(\"item 1 is \" + cost1 + \"item 2 is \"+cost2 + \"item 3 is \" + cost3 );\n\t\t\tSystem.out.println(\"Total is \" + newTotal);\n\t\t}else{\n\t\t\tSystem.out.println(\"getTotal is wrong\");\n\t\t\tSystem.out.println(\"expected \" + newActual);\t\n\t\t\tSystem.out.println(\"returned \" + newTotal);\t\n\t\t\t}\n\t\t\n\t\t\n\t\tbill.inputBill();\n\t\t\n\t\t\n\t\t\n\t\t\n\t}","@Override\n public double cost(){\n return 1 + super.sandwich.cost();\n }","private void calculatePrice(int quantity, int pricePerCup) {\n int price = quantity * pricePerCup;\n }","@Override\r\n public double getBaseCost() { return type.getCost(); }","@Override\r\n\tprotected void processCost() throws SGSException {\n\r\n\t}","@Test\r\n\tpublic void getTotal_4bc(){\n\t\tcart = new TourShoppingCart(MockRules.getRules());\r\n\t\t\r\n\t\tcart.add(new Item(ItemType.BC, BigDecimal.valueOf(110.00)) );\r\n\t\tcart.add(new Item(ItemType.BC, BigDecimal.valueOf(110.00)) );\r\n\t\tcart.add(new Item(ItemType.BC, BigDecimal.valueOf(110.00)) );\r\n\t\tcart.add(new Item(ItemType.BC, BigDecimal.valueOf(110.00)) );\r\n\t\tcart.add(new Item(ItemType.BC, BigDecimal.valueOf(110.00)) );\r\n\t\t\r\n\t\tcart.add(new Item(ItemType.OH, BigDecimal.valueOf(300.00)) );\r\n\t\t\r\n\t\tassert cart.total().equals(BigDecimal.valueOf(760.00));\r\n\t\tSystem.out.println(cart.total());\r\n\t}","@Override\n\tpublic double cost() {\n\t\treturn 10000;\n\t}","public double getCost() \n { \n return super.getCost() +22;\n }","public double getCost(StringBuffer detail, boolean ignoreAmmo) {\n double[] costs = new double[15];\n int i = 0;\n\n double cockpitCost = 0;\n if (getCockpitType() == Mech.COCKPIT_TORSO_MOUNTED) {\n cockpitCost = 750000;\n } else if (getCockpitType() == Mech.COCKPIT_DUAL) {\n // FIXME\n cockpitCost = 0;\n } else if (getCockpitType() == Mech.COCKPIT_COMMAND_CONSOLE) {\n // Command Consoles are listed as a cost of 500,000.\n // That appears to be in addition to the primary cockpit.\n cockpitCost = 700000;\n } else if (getCockpitType() == Mech.COCKPIT_SMALL) {\n cockpitCost = 175000;\n } else if (getCockpitType() == Mech.COCKPIT_INDUSTRIAL) {\n cockpitCost = 100000;\n } else {\n cockpitCost = 200000;\n }\n if (hasEiCockpit() && getCrew().getOptions().booleanOption(\"ei_implant\")) {\n cockpitCost = 400000;\n }\n costs[i++] = cockpitCost;\n costs[i++] = 50000;// life support\n costs[i++] = weight * 2000;// sensors\n int muscCost = hasTSM() ? 16000 : 2000;\n costs[i++] = muscCost * weight;// musculature\n costs[i++] = EquipmentType.getStructureCost(structureType) * weight;// IS\n costs[i++] = getActuatorCost();// arm and/or leg actuators\n Engine engine = getEngine();\n costs[i++] = engine.getBaseCost() * engine.getRating() * weight / 75.0;\n if (getGyroType() == Mech.GYRO_XL) {\n costs[i++] = 750000 * (int) Math.ceil(getOriginalWalkMP() * weight / 100f) * 0.5;\n } else if (getGyroType() == Mech.GYRO_COMPACT) {\n costs[i++] = 400000 * (int) Math.ceil(getOriginalWalkMP() * weight / 100f) * 1.5;\n } else if (getGyroType() == Mech.GYRO_HEAVY_DUTY) {\n costs[i++] = 500000 * (int) Math.ceil(getOriginalWalkMP() * weight / 100f) * 2;\n } else {\n costs[i++] = 300000 * (int) Math.ceil(getOriginalWalkMP() * weight / 100f);\n }\n double jumpBaseCost = 200;\n // You cannot have JJ's and UMU's on the same unit.\n if (hasUMU()) {\n costs[i++] = Math.pow(getAllUMUCount(), 2.0) * weight * jumpBaseCost;\n } else {\n if (getJumpType() == Mech.JUMP_BOOSTER) {\n jumpBaseCost = 150;\n } else if (getJumpType() == Mech.JUMP_IMPROVED) {\n jumpBaseCost = 500;\n }\n costs[i++] = Math.pow(getOriginalJumpMP(), 2.0) * weight * jumpBaseCost;\n }\n // num of sinks we don't pay for\n int freeSinks = hasDoubleHeatSinks() ? 0 : 10;\n int sinkCost = hasDoubleHeatSinks() ? 6000 : 2000;\n // cost of sinks\n costs[i++] = sinkCost * (heatSinks() - freeSinks);\n costs[i++] = hasFullHeadEject()?1725000:0;\n costs[i++] = getArmorWeight() * EquipmentType.getArmorCost(armorType);\n costs[i++] = getWeaponsAndEquipmentCost(ignoreAmmo);\n\n double cost = 0; // calculate the total\n for (int x = 0; x < i; x++) {\n cost += costs[x];\n }\n\n double omniMultiplier = 0;\n if (isOmni()) {\n omniMultiplier = 1.25f;\n cost *= omniMultiplier;\n }\n costs[i++] = -omniMultiplier; // negative just marks it as multiplier\n\n double weightMultiplier = 1 + (weight / 100f);\n costs[i++] = -weightMultiplier; // negative just marks it as multiplier\n cost = Math.round(cost * weightMultiplier);\n if (detail != null) {\n addCostDetails(cost, detail, costs);\n }\n return cost;\n }","public int totalCostOfComponents( ){\n\t\tint total=0;\n\t\tfor (Component temp : components){\n\t\t\ttotal+=temp.getCost();\n\t\t}\n\t\treturn total;\n\t}","double setEstimatedCost(double cost);","private double calcuFcost() {\n\t\treturn num * configMap.get('r') + (num-1) * configMap.get('l') + num * configMap.get('f') + configMap.get('t');\n\t}","public int getCost() {\n\t\treturn (int) Math.round(weight*price_per_pound);\n\t\t\n\t}","public int getCost(Tile<T> n1, Tile<T> n2);","public double calculateSubTotal() {\n return candy.getPrice() * quantity;\n\n }","public double getCost() {\t\t \n\t\treturn cost;\n\t}","@Override\n public double getCost() {\n return cost;\n }","double calculateCost() {\n double cost = 0;\n InspectionDTO[] DTOArray = this.currentInspectionChecklist.inspectionDTOArray;\n for (int i = 0; i <= DTOArray.length - 1; i++) {\n cost += DTOArray[i].getCost();\n }\n return cost;\n }","public static void main(String[] args) {\n \n// scanner\n Scanner myScanner;\n myScanner = new Scanner( System.in );\n \n// user inputs\n System.out.print(\n \"Enter the number of Big Macs(an interger > 0): \"); // asking user for the number of Big Macs\n int nBigMacs = myScanner.nextInt(); // declare that input as an interger nBigMacs\n \n System.out.print(\"Enter the cost per Big Mac as\"+ \n \" a double (in the form xx.xx) :\"); // prompts for the cost of 1 Big Mac\n double bigMac$ = myScanner.nextDouble(); //declaration of the Big Mac cost as a variable\n \n System.out.print(\n \"Enter the percent tax as a whole number (xx): \"); // prompts user for tax percent\n double taxRate = myScanner.nextDouble(); // decleration of tax rate\n taxRate/=100; // converts whole number to a usable proportion\n \n// eeclare variables for output and calculation\n double cost$;\n int dollars,dimes, pennies; // make variables for dollars, dimes, and pennies for storing digits\n cost$=nBigMacs*bigMac$*(1+taxRate); //calculation for the cost of all Big Macs\n dollars=(int)cost$; //gets dollars as a whole interger\n dimes=(int)(cost$*10)%10; //isolates one digit after the decimal place\n pennies=(int)(cost$*100)%10; //isolates the second degit after the decimal place\n \n// print results\n System.out.println(\"The total cost of \"+nBigMacs+\" Big Macs, at $\"+bigMac$+\" per Big Mac, with a sales tax of \"+(int)(taxRate*100) + \"%, is $\"+dollars+'.'+dimes+pennies);\n \n }","public double getCost() {\n\t\tif (this.accommodationType.equals(TYPEsingle)) {\n\t\t\tif (this.getRoomView().equals(\"street view\")) {\n\t\t\t\treturn 50.0;\n\t\t\t} else if (this.getRoomView().equals(\"garden view\")) {\n\t\t\t\treturn 70.0;\n\t\t\t} else {\n\t\t\t\treturn 110.0;\n\t\t\t}\n\t\t} else if (this.accommodationType.equals(TYPEdouble)) {\n\t\t\tif (this.getRoomView().equals(\"street view\")) {\n\t\t\t\treturn 70.0;\n\t\t\t} else if (this.getRoomView().equals(\"garden view\")) {\n\t\t\t\treturn 98.0;\n\t\t\t} else {\n\t\t\t\treturn 154.0;\n\t\t\t}\n\t\t} else if (this.accommodationType.equals(TYPEfamily)) {\n\t\t\tif (this.getRoomView().equals(\"street view\")) {\n\t\t\t\treturn 86.0;\n\t\t\t} else if (this.getRoomView().equals(\"garden view\")) {\n\t\t\t\tif (getInfoJacuzzi() == true) {\n\t\t\t\t\treturn 180.6;\n\t\t\t\t} else {\n\t\t\t\t\treturn 120.4;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (getInfoJacuzzi() == true) {\n\t\t\t\t\treturn 283.8;\n\t\t\t\t} else {\n\t\t\t\t\treturn 189.2;\n\t\t\t\t}\n\t\t\t}\n\t\t} else if (this.accommodationType.equals(TYPEpresidential)) {\n\t\t\tif (this.getRoomView().equals(\"street view\")) {\n\t\t\t\treturn 200.0;\n\t\t\t} else if (this.getRoomView().equals(\"garden view\")) {\n\t\t\t\tif (getInfoJacuzzi() == true) {\n\t\t\t\t\treturn 420.0;\n\t\t\t\t} else {\n\t\t\t\t\treturn 280.0;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif (getInfoJacuzzi() == true) {\n\t\t\t\t\treturn 660.0;\n\t\t\t\t} else {\n\t\t\t\t\treturn 440.0;\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\treturn 0.0;\n\t\t}\n\t}"],"string":"[\n \"public static double Cost(double boxes, double Cost) {\\n\\tdouble pay = boxes * Cost;\\n\\treturn pay;\\n}\",\n \"public void calculateCost() {\\n \\tdouble costToShipPack;\\n \\tint numOfPacks = 1;\\n \\t\\n \\tfor(Package p: this.packages) {\\n \\t\\tcostToShipPack = 3 + (p.calcVolume() - 1);\\n \\t\\tthis.totalAmounts.put(\\\"Package \\\"+numOfPacks, costToShipPack);\\n \\t\\tnumOfPacks++;\\n \\t}\\n \\t\\n }\",\n \"private void calculateCosts() {\\r\\n lb_CubicSum.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_Volume)) + \\\" €\\\");\\r\\n lb_MaterialCostSum.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_Price)) + \\\" €\\\");\\r\\n lb_CuttingTimeSum.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_CuttingHours)) + \\\" €\\\");\\r\\n lb_CuttingCostSum.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_CuttingPrice)) + \\\" €\\\");\\r\\n lb_TotalCosts.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_CuttingPrice) + getColmunSum(tc_Price)) + \\\" €\\\");\\r\\n\\r\\n ModifyController.getInstance().setProject_constructionmaterialList(Boolean.TRUE);\\r\\n }\",\n \"public void compute(){\\r\\n\\r\\n\\t\\ttotalCost=(capAmount*CAPCOST)+(hoodyAmount*HOODYCOST)+(shirtAmount*SHIRTCOST);\\r\\n\\t}\",\n \"public void calculateCost()\\n\\t{\\n\\t\\tLogManager lgmngr = LogManager.getLogManager(); \\n\\t\\tLogger log = lgmngr.getLogger(Logger.GLOBAL_LOGGER_NAME);\\n\\t\\tString s = \\\"\\\";\\n\\t\\tint costperfeet = 0;\\n\\t\\tif (this.materialStandard.equals(\\\"standard materials\\\") && this.fullyAutomated == false)\\n\\t\\t\\tcostperfeet = 1200;\\n\\t\\telse if (this.materialStandard.equals(\\\"above standard materials\\\") && this.fullyAutomated == false)\\n\\t\\t\\tcostperfeet = 1500;\\n\\t\\telse if(this.materialStandard.equals(\\\"high standard materials\\\") && this.fullyAutomated == false)\\n\\t\\t\\tcostperfeet = 1800;\\n\\t\\telse if (this.materialStandard.equals(\\\"high standard materials\\\") && this.fullyAutomated == true)\\n\\t\\t\\tcostperfeet = 2500;\\n\\t\\t\\n\\t\\tint totalCost = costperfeet * this.totalArea;\\n\\t\\t/*s = \\\"Total Cost of Construction is :- \\\";\\n\\t\\twriter.printf(\\\"%s\\\" + totalCost, s);\\n\\t\\twriter.flush();*/\\n\\t\\tlog.log(Level.INFO, \\\"Total Cost of Construction is :- \\\" + totalCost);\\n\\t}\",\n \"public double calculatingCostO(int quantity)\\n { \\n cost = 750 + (0.25 * quantity);\\n return cost;\\n \\n }\",\n \"public double calcCost() {\\n if (pizzaSize.equals(\\\"small\\\")) {\\n return 10.0 + ((cheeseToppings + pepperoniToppings + veggieToppings) * 2);\\n\\n }\\n else if (pizzaSize.equals(\\\"medium\\\")) {\\n return 12.0 + ((cheeseToppings + pepperoniToppings + veggieToppings) * 2);\\n }\\n else {\\n return 14.0 + ((cheeseToppings + pepperoniToppings + veggieToppings) * 2);\\n }\\n }\",\n \"public double calcCost() {\\n // $2 per topping.\\n double cost = 2 * (this.cheese + this.pepperoni + this.ham);\\n // size cost\\n switch (this.size) {\\n case \\\"small\\\":\\n cost += 10;\\n break;\\n case \\\"medium\\\":\\n cost += 12;\\n break;\\n case \\\"large\\\":\\n cost += 14;\\n break;\\n default:\\n }\\n return cost;\\n }\",\n \"public double returnBoxCost(double cardGradeCost, double colourOptPercent, double reinfPercent, double sealablePercent){\\n\\t\\tdouble sum = cardGradeCost + ((cardGradeCost * colourOptPercent) / 100) + ((cardGradeCost * reinfPercent) / 100)\\n\\t\\t\\t\\t+ ((cardGradeCost * sealablePercent) / 100); \\n\\t\\tdouble computeTotal = 0.00;\\n\\t\\t\\n\\t\\tDecimalFormat df = new DecimalFormat(\\\"##.##\\\");\\t\\n\\t\\t\\n\\t\\ttry{\\n\\t\\t\\tcomputeTotal = Double.valueOf(df.format(sum));\\n\\t\\t\\t}catch(NumberFormatException nme){\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\treturn computeTotal;\\n\\t}\",\n \"@Override\\n protected double calcTotalCost() {\\n \\n double totalCost, templateBasicRate = DEFAULT_BASIC_RATE;\\n double extraBedrooms = 0, extraBathrooms = 0;\\n\\n // if there are extra beds/baths\\n if (this.getNumBedrooms() > DEFAULT_NUM_BEDROOMS)\\n extraBedrooms = this.getNumBedrooms() - DEFAULT_NUM_BEDROOMS;\\n\\n if (this.getNumBathrooms() > DEFAULT_NUM_BATHROOMS)\\n extraBathrooms = this.getNumBathrooms() - DEFAULT_NUM_BATHROOMS;\\n\\n // multiply basic rate by 1.5 if the total area is >= 3,000 sq ft\\n if (this.getTotalArea() >= 3000)\\n templateBasicRate *= 1.5;\\n\\n // calculate total cost\\n totalCost = (templateBasicRate + ((800 * extraBedrooms) + (500 * extraBathrooms)));\\n\\n // add tax\\n totalCost += (TAX * totalCost);\\n\\n return totalCost;\\n }\",\n \"double getCost();\",\n \"double getCost();\",\n \"double calculateDeliveryCost(Cart cart);\",\n \"@Override\\r\\n\\tpublic double getCost() {\\r\\n\\t\\tdouble total = 0;\\r\\n\\t\\t\\r\\n\\t\\tfor(Product p: parts) {\\r\\n\\t\\t\\ttotal += p.getCost();\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\treturn total;\\r\\n\\t}\",\n \"double getTotalCost();\",\n \"public double calculateCost(Purchase purchase);\",\n \"public double getCost() {\\n return quantity*ppu;\\n\\n }\",\n \"public String calcSurfaceAreaOfBox(double length, double width, double height, double cost, int quantity){\\n\\t\\tdouble surfaceArea = 2*(width * length) + 2*(length * height) + 2*(width * height);\\n\\t\\tdouble computedCost = cost * surfaceArea;\\n\\t\\tdouble totalCost = computedCost * quantity;\\n\\t\\n\\t\\tDecimalFormat df = new DecimalFormat(\\\"##.##\\\");\\n\\t\\treturn df.format(totalCost);\\n\\t}\",\n \"public abstract double getCost();\",\n \"public void calculateCost(){\\n if(this.isChair){\\n for(int i = 0; i < this.chairs.length; i++){\\n this.cost += this.chairs[i].getPrice();\\n }\\n }\\n //if furniture type is chair, add up cost of all items in list\\n if(this.isDesk){\\n for(int i = 0; i < this.desks.length; i++){\\n this.cost += this.desks[i].getPrice();\\n }\\n }\\n //if furniture type is chair, add up cost of all items in list\\n if(this.isFiling){\\n for(int i = 0; i < this.filingCabinets.length; i++){\\n this.cost += this.filingCabinets[i].getPrice();\\n }\\n }\\n //if furniture type is chair, add up cost of all items in list\\n if(this.isLamp){\\n for(int i = 0; i < this.lamps.length; i++){\\n this.cost += this.lamps[i].getPrice();\\n }\\n }\\n }\",\n \"public double calcCost(){\\n double cost = 0;\\n cost += pMap.get(size);\\n cost += cMap.get(crust);\\n //Toppings are priced at 3.00 for 3-4 topppings, and 4.0 for 5+ toppings\\n \\n if(toppings !=null)\\n {\\n if((toppings.length == 3) || (toppings.length == 4)){\\n cost += 3.0;\\n }\\n if (toppings.length > 4){\\n cost += 4.0;\\n }\\n }\\n \\n return cost;\\n }\",\n \"public double getCost() {\\n\\t\\t\\n\\t\\tdouble cost = 0;\\n\\t\\t\\n\\t\\tif (Objects.equals(Size, \\\"small\\\"))\\n\\t\\t\\tcost = 7.00;\\n\\t\\telse if (Objects.equals(Size, \\\"medium\\\"))\\n\\t\\t\\tcost = 9.00;\\n\\t\\telse if (Objects.equals(Size, \\\"large\\\"))\\n\\t\\t\\tcost = 11.00;\\n\\t\\t\\n\\t\\tcost += (Cheese - 1)*1.50;\\n\\t\\tcost += Ham*1.50;\\n\\t\\tcost += Pepperoni*1.50;\\n\\t\\t\\n\\t\\treturn cost;\\t\\t\\n\\t}\",\n \"@Override\\n public double calcCost() {\\n return calcSalesFee()+calcTaxes();\\n }\",\n \"@Override\\r\\n\\tprotected void processCost() {\\n\\r\\n\\t}\",\n \"@Override\\n public double cost()\\n {\\n return this.price * this.number;\\n }\",\n \"public static void main(String[] args) {\\n \\n // Number of pairs of socks\\n int nSocks=3;\\n // Cost per pair of socks\\n double sockCost$=2.58;\\n \\n // Number of drinking glasses\\n int nGlasses=6;\\n // Cost per glass\\n double glassCost$=2.29;\\n \\n // Number of boxes of envelopes\\n int nEnvelopes=1;\\n // Cost per box of envelopes\\n double envelopeCost$=3.25;\\n double taxPercent=0.06;\\n \\n double totalSockCost$; // Total cost of socks\\n double totalGlassCost$; // \\n double totalEnvelopeCost$; // \\n double costOfSocksBeforeTax, totalCostOfSocks1, totalCostOfSocks2, glassCost, sockCost;\\n double costOfGlassesBeforeTax, totalCostOfGlasses1, totalCostOfGlasses2;\\n double costOfEnvelopesBeforeTax, totalCostOfEnvelopes1, totalCostOfEnvelopes2, envelopeCost;\\n double costBeforeTax, costAfterTax, glassesBeforeTax, envelopesBeforeTax, socksBeforeTax;\\n \\n socksBeforeTax=nSocks*sockCost$;\\n glassesBeforeTax=nGlasses*glassCost$;\\n envelopesBeforeTax=nEnvelopes*envelopeCost$;\\n \\n costOfSocksBeforeTax=nSocks*sockCost$;\\n totalCostOfSocks1=costOfSocksBeforeTax*taxPercent;\\n totalCostOfSocks2=costOfSocksBeforeTax-totalCostOfSocks1;\\n \\n costOfGlassesBeforeTax=nGlasses*glassCost$;\\n totalCostOfGlasses1=costOfGlassesBeforeTax*taxPercent;\\n totalCostOfGlasses2=costOfGlassesBeforeTax-totalCostOfGlasses1;\\n \\n costOfEnvelopesBeforeTax=nEnvelopes*envelopeCost$;\\n totalCostOfEnvelopes1=costOfEnvelopesBeforeTax*taxPercent;\\n totalCostOfEnvelopes2=costOfEnvelopesBeforeTax-totalCostOfEnvelopes1;\\n \\n costBeforeTax=costOfEnvelopesBeforeTax+costOfGlassesBeforeTax+costOfSocksBeforeTax;\\n costAfterTax=totalCostOfEnvelopes2+totalCostOfGlasses2+totalCostOfSocks2;\\n \\n // printing out how many items you have\\n System.out.println(\\\"Socks:\\\");\\n System.out.println(\\\"Socks cost \\\"+sockCost$+\\\" each.\\\");\\n System.out.println(\\\"Price after tax is \\\"+socksBeforeTax+\\\".\\\");\\n System.out.println(\\\"We are buying \\\"+nSocks+\\\".\\\");\\n System.out.println(\\\"Price before tax is \\\"+totalCostOfSocks2+\\\".\\\");\\n \\n System.out.println(\\\"Glasses:\\\");\\n System.out.println(\\\"Glasses cost \\\"+glassCost$+\\\" each.\\\");\\n System.out.println(\\\"We are buying \\\"+nGlasses+\\\" each.\\\");\\n System.out.println(\\\"Price after tax is \\\"+glassesBeforeTax+\\\".\\\");\\n System.out.println(\\\"Price before tax is \\\"+totalCostOfGlasses2+\\\".\\\");\\n \\n System.out.println(\\\"Envelopes:\\\");\\n System.out.println(\\\"Envelopes cost \\\"+envelopeCost$+\\\" each.\\\");\\n System.out.println(\\\"We are buying \\\"+nEnvelopes+\\\".\\\");\\n System.out.println(\\\"Price after tax is \\\"+envelopesBeforeTax+\\\".\\\");\\n System.out.println(\\\"Price before tax is \\\"+totalCostOfEnvelopes2+\\\".\\\");\\n \\n System.out.println(\\\"Total cost of everything after tax is \\\"+costBeforeTax+\\\".\\\");\\n System.out.println(\\\"Total cost of everything before tax is \\\"+costAfterTax+\\\".\\\");\\n \\n\\n }\",\n \"@Override\\n\\tpublic double cost() {\\n\\t\\tdouble price = good.cost();\\n\\t\\treturn price+price/2;\\n\\t}\",\n \"int getCost();\",\n \"int getCost();\",\n \"int getCost();\",\n \"public void calculateCost(Order currentOrder) {\\n\\n BigDecimal area = currentOrder.getArea();\\n BigDecimal materialCost = (area.multiply(currentOrder.getProduct().getCostPerSqFt())).setScale(2);\\n BigDecimal laborCost = (area.multiply(currentOrder.getProduct().getLaborCostPerSqFt()));\\n BigDecimal tax = laborCost.add(materialCost).multiply(currentOrder.getState().getTaxRate().movePointLeft(2));\\n BigDecimal total = materialCost.add(laborCost).add(tax);\\n\\n //using half_up for rounding to get the (nearest neighbor)\\n //Setting each price to the object\\n currentOrder.setMaterialCost(materialCost.setScale(2, RoundingMode.HALF_UP));\\n currentOrder.setLaborCost(laborCost.setScale(2, RoundingMode.HALF_UP));\\n currentOrder.setTax(tax.setScale(2, RoundingMode.HALF_UP));\\n currentOrder.setTotal(total.setScale(2, RoundingMode.HALF_UP));\\n }\",\n \"public int calculateCost() {\\n int premium = surety.calculatePremium(insuredValue);\\n SuretyType suretyType = surety.getSuretyType();\\n int commission = (int) Math.round(premium * vehicle.getCommission(suretyType));\\n return premium + commission;\\n }\",\n \"public void calculateOrderCost(){\\n int tmpCost=0;\\n for (Vehicle v : vehicleList){\\n tmpCost+=v.getCost();\\n }\\n totalCost=tmpCost;\\n }\",\n \"@Override\\n\\tvoid get_cost_per_sqarefeet() {\\n\\t\\tcost=1800;\\n\\t}\",\n \"public double costNEX() {\\r\\n double diff=0;\\r\\n double intensity=0;\\r\\n \\r\\n for(int x=Config.ptvXLow-0; x < Config.ptvXHigh+0; x++) {\\r\\n// for(int x=Solver.xBoundsTumor[0]; x < Solver.xBoundsTumor[1]; x+= Config.scaleFactor) {\\r\\n for(int y=Config.ptvYLow-0; y < Config.ptvYHigh+0; y++) {\\r\\n// for(int y=Solver.yBoundsTumor[0]; y < Solver.yBoundsTumor[1]; y+= Config.scaleFactor) {\\r\\n for(int z=Config.ptvZLow-0; z < Config.ptvZHigh+0; z++) {\\r\\n// for(int z=Solver.zBoundsTumor[0]; z < Solver.zBoundsTumor[1]; z+= Config.scaleFactor) {\\r\\n\\r\\n this.body2[x][y][z].setCurrentDosis(0.0); //Set currentPtvVoxel Dose to 0 \\r\\n for(int i=0; i<Config.numberOfSeeds;++i) { \\r\\n // Calculate intensity based based on current dwelltime\\r\\n intensity = this.body2[x][y][z].radiationIntensity(this.seeds2[i].getCoordinate(), New_state[i]);\\r\\n if (intensity>0) {\\r\\n// LogTool.print(\\\"Cost: Intensity :\\\" + intensity + \\\"@ \\\" + x + \\\" \\\" + y + \\\" \\\" + z,\\\"notification\\\");\\r\\n }\\r\\n this.body2[x][y][z].addCurrentDosis(intensity);\\r\\n } \\r\\n diff += Math.pow((this.body2[x][y][z].getGoalDosis()-this.body2[x][y][z].getCurrentDosis()),2);\\r\\n// LogTool.print(\\\" diffdose \\\" + (Looper.body2[x][y][z].getGoalDosis()-Looper.body2[x][y][z].getCurrentDosis()),\\\"notification\\\");\\r\\n } \\r\\n }\\r\\n }\\r\\n return Math.sqrt(diff);\\r\\n// return Math.random();\\r\\n }\",\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 \"protected abstract double getDefaultCost();\",\n \"public void printCost() {\\r\\n double cost;\\r\\n cost = quantity * price;\\r\\n System.out.printf(\\\"Total cost = $%.2f\\\", cost);\\r\\n }\",\n \"public static double calculations(int quantity, double cost) {\\r\\n\\tdouble price = 0;\\r\\n\\tprice = quantity*cost;\\r\\n\\treturn price = price+calculateTax(price);\\r\\n\\t}\",\n \"@Override\\n\\tpublic int calculateCost() \\n\\t{\\n\\t\\treturn (this.modernCenterpieceCost*this.centerpieceCount);\\n\\t}\",\n \"@Override\\r\\n\\tpublic int cost() {\\n\\t\\treturn b1.cost() + 1;\\r\\n\\t}\",\n \"private void calcPrice() {\\n double itemPrice = 0;\\n \\n //get price of burger (base)\\n if (singleRad.isSelected())\\n {\\n itemPrice = 3.50;\\n }\\n else \\n {\\n itemPrice = 4.75;\\n }\\n \\n //check options add to item price\\n if(cheeseCheckbox.isSelected())\\n itemPrice = itemPrice += 0.50;\\n if(baconCheckbox.isSelected())\\n itemPrice = itemPrice += 1.25;\\n if(mealCheckbox.isSelected())\\n itemPrice = itemPrice += 4.00;\\n \\n //include the quantity for the item price\\n int quantity= 1;\\n if (quantityTextField.getText().equals(\\\"\\\"))\\n quantityTextField.setText(\\\"1\\\");\\n quantity = Integer.parseInt(quantityTextField.getText());\\n itemPrice = itemPrice * quantity;\\n\\n \\n //show the price no $ symbol\\n \\n itemPriceTextField.setText(d2.format(itemPrice));\\n }\",\n \"@Override\\r\\n\\tpublic void addToCost() {\\n\\t\\t\\r\\n\\t}\",\n \"private void calculatePrice(int quantity) {\\n int price = quantity * priceOfCoffee;\\n }\",\n \"public abstract int getCost();\",\n \"public abstract int getCost();\",\n \"public abstract int getCost();\",\n \"private int determineCost(JCheckBox chcBox) {\\r\\n int cost = 0;\\r\\n String departmentName = chcBox.getText();\\r\\n\\r\\n if (departmentName.equals(\\\"Bogen\\\")) {\\r\\n cost = 8;\\r\\n } else if (departmentName.equals(\\\"Luftdruck\\\")) {\\r\\n cost = 10;\\r\\n } else if (departmentName.equals(\\\"Feuerwaffen\\\")) {\\r\\n cost = 15;\\r\\n } else {\\r\\n System.out.println(\\\"Nichts\\\");\\r\\n }\\r\\n\\r\\n return cost;\\r\\n }\",\n \"@Override\\n public double getCost() {\\n\\t return 13;\\n }\",\n \"float calculatePrice () \\n\\t{\\n\\t\\tfloat final_price = 0;\\n\\t\\tfinal_price = (float)(price * quantity); // price * number of items\\n\\t\\tfinal_price += final_price*(.10); // add tax\\n\\t\\tif(perishable.equals(\\\"P\\\"))\\n\\t\\t{\\n\\t\\t\\tfloat ship = (float)(20* weight)*quantity; // add shipping\\n\\t\\t\\tship += ship*.20;\\n\\t\\t\\tfinal_price += ship;\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tfinal_price += (20* weight)*quantity; // add shipping\\n\\t\\t}\\n\\t\\treturn final_price;\\n\\t}\",\n \"public static void main(String[] args) {\\n Scanner sc = new Scanner(System.in);\\n int q = sc.nextInt();\\n\\n for(int k = 0; k < q; k++) {\\n int m = sc.nextInt();\\n int n = sc.nextInt();\\n\\n // indicate number of pieces\\n long x = 1;\\n long y = 1;\\n \\n ArrayList<Long> c_y = new ArrayList<Long>();\\n for(int i = 0; i < m - 1; i++) {\\n c_y.add(sc.nextLong());\\n }\\n \\n ArrayList<Long> c_x = new ArrayList<Long>();\\n for(int i = 0; i < n - 1; i++) {\\n c_x.add(sc.nextLong());\\n }\\n\\n Collections.sort(c_y, Collections.reverseOrder());\\n Collections.sort(c_x, Collections.reverseOrder());\\n\\n // cut: most expensive = cut first\\n int index_X = 0;\\n int index_Y = 0;\\n long totalCost = 0;\\n\\n while(!(x == n && y == m)) {\\n if(x < n && y < m) {\\n // compare cost to decide whether cut horizontally or vertically\\n if(c_y.get(index_Y) >= c_x.get(index_X)) {\\n totalCost += c_y.get(index_Y) * x;\\n y++;\\n index_Y++;\\n } else if(c_y.get(index_Y) < c_x.get(index_X)) {\\n totalCost += c_x.get(index_X) * y;\\n x++;\\n index_X++; \\n }\\n } else if(x == n && y < m) {\\n totalCost += c_y.get(index_Y) * x;\\n index_Y++;\\n y++;\\n } else if(x < n && y == m) {\\n totalCost += c_x.get(index_X) * y;\\n index_X++;\\n x++;\\n }\\n }\\n\\n totalCost = totalCost % (long)(Math.pow(10, 9) + 7);\\n System.out.println(totalCost );\\n }\\n }\",\n \"private double calcCost(Cloudlet cloudlet, FogDevice fogDevice) {\\n double cost = 0;\\n //cost includes the processing cost\\n cost += fogDevice.getCharacteristics().getCostPerSecond() * cloudlet.getCloudletLength( ) / fogDevice.getHost().getTotalMips();\\n // cost includes the memory cost\\n cost += fogDevice.getCharacteristics().getCostPerMem() * cloudlet.getMemRequired();\\n // cost includes the bandwidth cost\\n cost += fogDevice.getCharacteristics().getCostPerBw() * (cloudlet.getCloudletFileSize() + cloudlet.getCloudletOutputSize());\\n return cost;\\n }\",\n \"@Pure\\n\\tdouble getCost();\",\n \"double getSolutionCost();\",\n \"float getCostReduction();\",\n \"@Override\\n\\tpublic double getCost() {\\n\\t\\treturn price * weight; // cost = price of the candy * weight of candies\\n\\t}\",\n \"public String returnBoxCost(double cardGradeCost, String colourOption, String reinfBotOption, \\n\\t\\t\\tString reinfCornOption, String sealOption){\\n\\t\\tdouble colOptPercent = 0.00;\\n\\t\\tdouble reinfPercent = 0.00;\\n\\t\\tdouble sealPercent = 0.00;\\n\\t\\t\\n\\t\\tif(colourOption.equals(\\\"2\\\")){\\n\\t\\t\\tcolOptPercent = 15.00;\\n\\t\\t}else if(colourOption.equals(\\\"1\\\")){\\n\\t\\t\\tcolOptPercent = 12.00;\\n\\t\\t}else{\\n\\t\\t\\tcolOptPercent = 0.00;\\n\\t\\t}\\n\\t\\t\\n\\t\\tif((reinfBotOption.equals(\\\"true\\\")) && (reinfCornOption.equals(\\\"true\\\"))){\\n\\t\\t\\treinfPercent = 17.00;\\n\\t\\t}else if((reinfBotOption.equals(\\\"true\\\")) && (reinfCornOption.equals(\\\"false\\\"))){\\n\\t\\t\\treinfPercent = 10.00;\\n\\t\\t}else if((reinfBotOption.equals(\\\"false\\\")) && (reinfCornOption.equals(\\\"true\\\"))){\\n\\t\\t\\treinfPercent = 7.00;\\n\\t\\t}else if((reinfBotOption.equals(\\\"true\\\")) && (reinfCornOption.equals(\\\"select\\\"))){\\n\\t\\t\\treinfPercent = 10.00;\\n\\t\\t}else if((reinfBotOption.equals(\\\"select\\\")) && (reinfCornOption.equals(\\\"false\\\"))){\\n\\t\\t\\treinfPercent = 7.00;\\n\\t\\t}else{\\n\\t\\t\\treinfPercent = 0.00;\\n\\t\\t}\\n\\t\\t\\n\\t\\tif(sealOption.equals(\\\"true\\\")){\\n\\t\\t\\tsealPercent = 5.00;\\n\\t\\t}else if(sealOption.equals(\\\"false\\\")){\\n\\t\\t\\tsealPercent = 0.00;\\n\\t\\t}else{\\n\\t\\t\\tsealPercent = 0.00;\\n\\t\\t}\\n\\t\\t\\n\\t\\tdouble sum = cardGradeCost+((cardGradeCost*colOptPercent)/100) + ((cardGradeCost*reinfPercent)/100)\\n\\t\\t\\t\\t+ ((cardGradeCost*sealPercent)/100); \\n\\t\\n\\t\\tDecimalFormat df = new DecimalFormat(\\\"##.##\\\");\\t\\n\\t\\treturn df.format(sum);\\n\\t}\",\n \"public void calcAction(View v) \\n\\t{\\n\\t\\ttry\\n\\t\\t{\\n\\t\\t\\tString initial = size.getText().toString(); /* the following gets user input, in order to do calculations */\\n\\t\\t\\tString end = \\\"Nothing\\\"; /* This is the default text in case the unexpected happens */\\n\\t\\t\\tunit = selection.getSelectedItem().toString(); /* this gets the unit of measure that the user specifies */\\n\\t\\tdouble convert = Double.parseDouble(initial); /* this converts the size input to numerical data, in order for calculations to be done */\\n\\t\\t\\tcapacity.setStorage(convert); /* send input to external class */\\n\\t\\t\\tDecimalFormat twop = new DecimalFormat(\\\"#.##\\\"); /* created new object, in order to format output to display two decimal places at most */\\n\\n\\t\\t\\t/* the following conditional statement reads the unit of measure specify by the user, puts the data into the proper formula, and returns the results */\\n\\n\\t\\t\\tif (unit.equals(\\\"KB\\\")) // runs if user specifies KB\\n\\t\\t\\t{\\n\\t\\t\\t\\tend = twop.format(capacity.getKB());\\n\\t\\t\\t}\\n\\n\\t\\t\\telse if (unit.equals(\\\"MB\\\")) /* runs if user specifies MB */\\n\\t\\t\\t{\\n\\t\\t\\t\\tend = twop.format(capacity.getMB());\\n\\t\\t\\t}\\n\\n\\t\\t\\telse if (unit.equals(\\\"GB\\\")) /* runs if user specifies GB */\\n\\t\\t\\t{\\n\\t\\t\\t\\tend = twop.format(capacity.getGB());\\n\\t\\t\\t}\\n\\n\\t\\t\\telse if (unit.equals(\\\"TB\\\")) /* runs if user specifies TB */\\n\\t\\t\\t{\\n\\t\\t\\t\\tend = twop.format(capacity.getTB());\\n\\t\\t\\t}\\n\\n\\t\\t\\telse if (unit.equals(\\\"PB\\\")) /* runs if user specifies PB */\\n\\t\\t\\t{\\n\\t\\t\\t\\tend = twop.format(capacity.getPB());\\n\\t\\t\\t}\\n\\n\\t\\t\\telse if (unit.equals(\\\"EB\\\")) /* runs if user specifies EB */\\n\\t\\t\\t{\\n\\t\\t\\t\\tend = twop.format(capacity.getEB());\\n\\t\\t\\t}\\n\\n\\t\\t\\telse if (unit.equals(\\\"ZB\\\")) /* runs if user specifies ZB */\\n\\t\\t\\t{\\n\\t\\t\\t\\tend = twop.format(capacity.getZB());\\n\\t\\t\\t}\\n\\n\\t\\t\\telse if (unit.equals(\\\"YB\\\")) /* runs if user specifies YB */\\n\\t\\t\\t{\\n\\t\\t\\t\\tend = twop.format(capacity.getYB());\\n\\t\\t\\t}\\n\\n\\t\\t\\telse; // send default text, if unexpected happens.\\n\\n\\t\\t\\tresult.setText(end); // display results\\n\\t\\t}\\n\\n\\t\\tcatch (NumberFormatException e)\\n\\t\\t{\\n\\t\\t\\tAlertDialog.Builder m = new AlertDialog.Builder(this);\\n\\t\\t\\tm.setTitle(R.string.error); // set dialog title\\n\\t\\t\\tm.setMessage(R.string.error_message).setCancelable(true).setPositiveButton(R.string.ok, new DialogInterface.OnClickListener()\\n\\t\\t\\t{\\n\\t\\t\\t\\tpublic void onClick(DialogInterface dialog, int id)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tdialog.cancel();\\n\\t\\t\\t\\t}\\n\\t\\t\\t});\\n\\t\\t\\tm.create();\\n\\t\\t\\tm.show();\\n\\t\\t}\\t\\n\\t}\",\n \"public float totalCost() {\\n\\t\\tttCost = 0;\\n\\t\\tfor (int i = 0; i < itemsOrdered.size(); i++) {\\n\\t\\t\\tttCost += itemsOrdered.get(i).getCost();\\n\\t\\t}\\n\\t\\treturn ttCost;\\n\\t}\",\n \"@Test\\n\\tvoid testCost() {\\n\\t\\tint nbCores = 16;\\n\\t\\tlong duration = 2000;\\n\\t\\tDate requestDate = new Date(\\\"01/01/2000\\\");\\n\\t\\tJob j1 = new Job(nbCores,requestDate,duration,mediumQ);//16 cores less than 1h\\n\\t\\tJob j2 = new Job(nbCores*2,requestDate,duration,mediumQ);//32 cores less than 1h\\n\\t\\tJob j3 = new Job(nbCores*2+1,requestDate,duration,mediumQ);//33 cores less than 1h\\n\\t\\tJob j4 = new Job(nbCores,requestDate,duration*2,mediumQ);//16 cores more than 1h\\n\\t\\tJob j5 = new Job(nbCores*2+1,requestDate,duration*2,mediumQ);//33 cores more than 1h\\n\\t\\tassertEquals(j1.getCost(),0.05f);\\n\\t\\tassertEquals(j2.getCost(),0.05f);\\n\\t\\tassertEquals(j3.getCost(),0.1f);\\n\\t\\tassertEquals(j4.getCost(),0.1f);\\n\\t\\tassertEquals(j5.getCost(),0.2f);\\n\\t}\",\n \"double ComputeCost(double order, double tipPercent, double serviceRating, double foodRating)\\r\\n {\\r\\n // kazda gwiazdka to 2 procent od sumy zamówienia\\r\\n return order + order * (tipPercent/100) + (serviceRating * 0.02) * order + (foodRating * 0.02) * order;\\r\\n }\",\n \"public float getCost()\\r\\n/* 13: */ {\\r\\n/* 14:10 */ return this.costFromStart + this.estimatedCostToGoal;\\r\\n/* 15: */ }\",\n \"public double getCost() {\\r\\n\\t\\t\\r\\n\\t\\tif (super.getSize() == \\\"Small\\\") { totalCost = 2.00; }\\r\\n\\t\\t\\r\\n\\t\\tif (super.getSize() == \\\"Medium\\\") { totalCost = 2.50; }\\r\\n\\t\\t\\r\\n\\t\\tif (super.getSize() == \\\"Large\\\") { totalCost = 3.00; }\\r\\n\\t\\t\\r\\n\\t\\treturn totalCost;\\r\\n\\t}\",\n \"@Override\\n\\tpublic double cost() {\\n\\t\\treturn 2.19;\\n\\t}\",\n \"@Override\\n\\tprotected void setCost(double cst) {\\n\\t\\t\\n\\t}\",\n \"public void calculatePaintAndLabor(){\\n this.numGallons = squareFeet/115;\\n System.out.println(\\\"Number of Gallons: \\\" + numGallons);\\n this.laborHours = numGallons * 8;\\n System.out.println(\\\"Number of Hours: \\\" + laborHours);\\n this.paintCost = numGallons * pricePerGallon;\\n System.out.println(\\\"Price of Paint: $\\\" + paintCost);\\n this.laborCost = laborHours * 20.00;\\n System.out.println(\\\"Price of Labor: $\\\" + laborCost);\\n this.totalCost = paintCost + laborCost;\\n System.out.println(\\\"Total Cost: $\\\" + totalCost);\\n\\n }\",\n \"public float getCost(Node n){\\n char t1 = this.type;\\n char t2 = n.getType();\\n int row1 = this.row;\\n int col1 = this.col;\\n int row2 = n.getRow();\\n int col2 = n.getCol();\\n boolean straight;\\n\\n if(row1 == row2 || col1 == col2)\\n straight = true;\\n else\\n straight = false;\\n\\n if(straight){\\n switch (t1){\\n case '1':\\n switch (t2){\\n case '1':\\n return 1;\\n case '2':\\n return (float)1.5;\\n case 'a':\\n return 1;\\n case 'b':\\n return (float)1.5;\\n }\\n break;\\n case '2':\\n switch (t2){\\n case '1':\\n return (float)1.5;\\n case '2':\\n return 2;\\n case 'a':\\n return (float)1.5;\\n case 'b':\\n return 2;\\n }\\n break;\\n case 'a':\\n switch (t2){\\n case '1':\\n return 1;\\n case '2':\\n return (float)1.5;\\n case 'a':\\n return (float).25;\\n case 'b':\\n return (float).375;\\n }\\n break;\\n case 'b':\\n switch (t2){\\n case '1':\\n return (float)1.5;\\n case '2':\\n return 2;\\n case 'a':\\n return (float).375;\\n case 'b':\\n return (float).25;\\n }\\n break;\\n }\\n } else{\\n switch(t1){\\n case '1':\\n switch (t2){\\n case 'a':\\n case '1':\\n return (float)Math.sqrt(2);\\n case '2':\\n case 'b':\\n return (float)((Math.sqrt(2)+Math.sqrt(8))/2);\\n }\\n break;\\n case '2':\\n switch (t2){\\n case 'a':\\n case '1':\\n return (float)((Math.sqrt(2)+Math.sqrt(8))/2);\\n case '2':\\n case 'b':\\n return (float)Math.sqrt(8);\\n }\\n break;\\n case 'a':\\n switch (t2){\\n case 'a':\\n case '1':\\n return (float)Math.sqrt(2);\\n case '2':\\n case 'b':\\n return (float)((Math.sqrt(2)+Math.sqrt(8))/2);\\n }\\n break;\\n case 'b':\\n switch (t2){\\n case 'a':\\n case '1':\\n return (float)((Math.sqrt(2)+Math.sqrt(8))/2);\\n case '2':\\n case 'b':\\n return (float)Math.sqrt(8);\\n }\\n break;\\n }\\n }\\n\\n return 0;\\n }\",\n \"private CostHelper() {}\",\n \"public void calculaMatrizCostes() {\\n int i, j;\\n double xd, yd;\\n costes = new int[n][n];\\n for (i = 0; i < n; i++) {\\n for (j = 0; j < n; j++) {\\n xd = vx[i] - vx[j];\\n yd = vy[i] - vy[j];\\n costes[i][j] = (int) Math.round(Math.sqrt((xd * xd) + (yd * yd)));\\n }\\n }\\n }\",\n \"public double calcTotal(){\\n\\t\\tdouble total; // amount to be returned\\n\\t\\t\\n\\t\\t// add .50 cents for any milk that isn't whole or skim, and .35 cents for flavoring\\n\\t\\tif ((milk != \\\"whole\\\" && milk != \\\"skim\\\") && flavor != \\\"no\\\"){\\n\\t\\t\\tcost += 0.85;\\t\\n\\t\\t}\\n\\t\\t\\n\\t\\t// add .35 cents for flavoring\\n\\t\\telse if (flavor != \\\"no\\\"){\\n\\t\\t\\tcost += 0.35;\\t\\n\\t\\t}\\n\\t\\t\\n\\t\\t// add .50 cents for milk that isn't whole or skim\\n\\t\\telse if (milk != \\\"whole\\\" && milk != \\\"skim\\\"){\\n\\t\\t\\tcost += 0.50;\\n\\t\\t}\\n\\t\\t\\n\\t\\telse{\\n\\t\\t}\\n\\t\\t\\n\\t\\t// add .50 cents for extra shot of espresso\\n\\t\\tif (extraShot != false){\\n\\t\\t\\ttotal = cost + 0.50;\\n\\t\\t}\\n\\t\\telse\\n\\t\\t\\ttotal = cost;\\n\\t\\t\\n\\t\\treturn total;\\n\\t}\",\n \"public double totalQuantity() {\\r\\n\\t\\tdouble t = 0;\\r\\n\\t\\tfor(int i=0;i<boxes[0];i++)\\r\\n\\t\\t\\tfor(int j=0;j<boxes[1];j++)\\r\\n\\t\\t\\t\\tfor(int k=0;k<boxes[2];k++) t += quantity[i][j][k];\\r\\n\\t\\treturn t;\\r\\n\\t}\",\n \"public void generateCost() throws StandardException {\\n\\n double baseTableSelectivity = computePhaseSelectivity(selectivityHolder,QualifierPhase.BASE);\\n double filterBaseTableSelectivity = computePhaseSelectivity(selectivityHolder,QualifierPhase.BASE,QualifierPhase.FILTER_BASE);\\n double projectionSelectivity = computePhaseSelectivity(selectivityHolder,QualifierPhase.FILTER_PROJECTION);\\n double totalSelectivity = computeTotalSelectivity(selectivityHolder);\\n\\n assert filterBaseTableSelectivity >= 0 && filterBaseTableSelectivity <= 1.0:\\\"filterBaseTableSelectivity Out of Bounds -> \\\" + filterBaseTableSelectivity;\\n assert baseTableSelectivity >= 0 && baseTableSelectivity <= 1.0:\\\"baseTableSelectivity Out of Bounds -> \\\" + baseTableSelectivity;\\n assert projectionSelectivity >= 0 && projectionSelectivity <= 1.0:\\\"projectionSelectivity Out of Bounds -> \\\" + projectionSelectivity;\\n assert totalSelectivity >= 0 && totalSelectivity <= 1.0:\\\"totalSelectivity Out of Bounds -> \\\" + totalSelectivity;\\n\\n // Total Row Count from the Base Conglomerate\\n double totalRowCount = scc.baseRowCount();\\n assert totalRowCount >= 0 : \\\"totalRowCount cannot be negative -> \\\" + totalRowCount;\\n // Rows Returned is always the totalSelectivity (Conglomerate Independent)\\n scanCost.setEstimatedRowCount(Math.round(totalRowCount*totalSelectivity));\\n\\n double baseTableAverageRowWidth = scc.getBaseTableAvgRowWidth();\\n double baseTableColumnSizeFactor = scc.baseTableColumnSizeFactor(totalColumns);\\n\\n // We use the base table so the estimated heap size and remote cost are the same for all conglomerates\\n double colSizeFactor = baseTableAverageRowWidth*baseTableColumnSizeFactor;\\n assert baseTableAverageRowWidth >= 0 : \\\"baseTableAverageRowWidth cannot be negative -> \\\" + baseTableAverageRowWidth;\\n assert baseTableColumnSizeFactor >= 0 : \\\"baseTableColumnSizeFactor cannot be negative -> \\\" + baseTableColumnSizeFactor;\\n\\n double openLatency = scc.getOpenLatency();\\n double closeLatency = scc.getCloseLatency();\\n double localLatency = scc.getLocalLatency();\\n double remoteLatency = scc.getRemoteLatency();\\n double remoteCost = openLatency + closeLatency + totalRowCount*totalSelectivity*remoteLatency*(1+colSizeFactor/100d);\\n assert openLatency >= 0 : \\\"openLatency cannot be negative -> \\\" + openLatency;\\n assert closeLatency >= 0 : \\\"closeLatency cannot be negative -> \\\" + closeLatency;\\n assert localLatency >= 0 : \\\"localLatency cannot be negative -> \\\" + localLatency;\\n assert remoteLatency >= 0 : \\\"remoteLatency cannot be negative -> \\\" + remoteLatency;\\n assert remoteCost >= 0 : \\\"remoteCost cannot be negative -> \\\" + remoteCost;\\n // Heap Size is the avg row width of the columns for the base table*total rows\\n // Average Row Width\\n // This should be the same for every conglomerate path\\n scanCost.setEstimatedHeapSize((long)(totalRowCount*totalSelectivity*colSizeFactor));\\n // Should be the same for each conglomerate\\n scanCost.setRemoteCost((long)remoteCost);\\n // Base Cost + LookupCost + Projection Cost\\n double congAverageWidth = scc.getConglomerateAvgRowWidth();\\n double baseCost = openLatency+closeLatency+(totalRowCount*baseTableSelectivity*localLatency*(1+congAverageWidth/100d));\\n assert congAverageWidth >= 0 : \\\"congAverageWidth cannot be negative -> \\\" + congAverageWidth;\\n assert baseCost >= 0 : \\\"baseCost cannot be negative -> \\\" + baseCost;\\n scanCost.setFromBaseTableRows(filterBaseTableSelectivity * totalRowCount);\\n scanCost.setFromBaseTableCost(baseCost);\\n double lookupCost;\\n if (lookupColumns == null)\\n lookupCost = 0.0d;\\n else {\\n lookupCost = totalRowCount*filterBaseTableSelectivity*(openLatency+closeLatency);\\n scanCost.setIndexLookupRows(filterBaseTableSelectivity*totalRowCount);\\n scanCost.setIndexLookupCost(lookupCost+baseCost);\\n }\\n assert lookupCost >= 0 : \\\"lookupCost cannot be negative -> \\\" + lookupCost;\\n\\n double projectionCost;\\n if (projectionSelectivity == 1.0d)\\n projectionCost = 0.0d;\\n else {\\n projectionCost = totalRowCount * filterBaseTableSelectivity * localLatency * colSizeFactor*1d/1000d;\\n scanCost.setProjectionRows(scanCost.getEstimatedRowCount());\\n scanCost.setProjectionCost(lookupCost+baseCost+projectionCost);\\n }\\n assert projectionCost >= 0 : \\\"projectionCost cannot be negative -> \\\" + projectionCost;\\n\\n double localCost = baseCost+lookupCost+projectionCost;\\n assert localCost >= 0 : \\\"localCost cannot be negative -> \\\" + localCost;\\n scanCost.setLocalCost(localCost);\\n scanCost.setNumPartitions(scc.getNumPartitions());\\n scanCost.setLocalCostPerPartition((baseCost + lookupCost + projectionCost)/scc.getNumPartitions());\\n }\",\n \"double setCost(double cost);\",\n \"public double GetCost() {\\n if( LotSize != CurLotSize ) {\\n double CostPerShot = Cost / (double) LotSize;\\n return CommonTools.RoundFractionalTons( CostPerShot * (double) CurLotSize );\\n }\\n return Cost;\\n }\",\n \"@Override\\n public void calculateCost(final ResourceAllocation allocation) {\\n final IReservable reservable = this.resourceDataSource.get(allocation.getResourceId());\\n\\n final double units = getCostUnits(allocation, reservable);\\n\\n // check on external ??\\n final double costPerUnit = reservable.getCostPerUnit();\\n final int quantity = allocation.getQuantity();\\n // calculate cost and round to 2 decimals\\n final double cost = DataSourceUtils.round2(costPerUnit * units * quantity);\\n\\n allocation.setCost(cost);\\n }\",\n \"@Override\\n\\tpublic double calcConsumedEnergy() {\\n\\t\\treturn (getBasicEnergyCost() * 4);\\n\\t}\",\n \"public void amount() {\\n \\t\\tfloat boxOHamt=boxOH*.65f*48f;\\n \\t\\tSystem.out.printf(boxOH+\\\" boxes of Oh Henry ($0.65 x 48)= $%4.2f \\\\n\\\",boxOHamt);\\n \\t\\tfloat boxCCamt=boxCC*.80f*48f;\\n \\t\\tSystem.out.printf(boxCC+\\\" boxes of Coffee Crisp ($0.80 x 48)= $%4.2f \\\\n\\\", boxCCamt);\\n \\t\\tfloat boxAEamt=boxAE*.60f*48f;\\n \\t\\tSystem.out.printf(boxAE+\\\" boxes of Aero ($0.60 x 48)= $%4.2f \\\\n\\\", boxAEamt);\\n \\t\\tfloat boxSMamt=boxSM*.70f*48f;\\n \\t\\tSystem.out.printf(boxSM+\\\" boxes of Smarties ($0.70 x 48)= $%4.2f \\\\n\\\", boxSMamt);\\n \\t\\tfloat boxCRamt=boxCR*.75f*48f;\\n \\t\\tSystem.out.printf(boxCR+\\\" boxes of Crunchies ($0.75 x 48)= $%4.2f \\\\n\\\",boxCRamt);\\n \\t\\tSystem.out.println(\\\"----------------------------------------------\\\");\\n \\t\\t//display the total prices\\n \\t\\tsubtotal=boxOHamt+boxCCamt+boxAEamt+boxSMamt+boxCRamt;\\n \\t\\tSystem.out.printf(\\\"Sub Total = $%4.2f \\\\n\\\", subtotal);\\n \\t\\ttax=subtotal*.07f;\\n \\t\\tSystem.out.printf(\\\"Tax = $%4.2f \\\\n\\\", tax);\\n \\t\\tSystem.out.println(\\\"==============================================\\\");\\n \\t\\ttotal=subtotal+tax;\\n \\t\\tSystem.out.printf(\\\"Amount Due = $%4.2f \\\\n\\\", total);\\n \\t}\",\n \"public static double calcularCosto(String tipoLicencia, int vigencia) {\\n float monto = 0;\\n switch(tipoLicencia){\\n case \\\"Clase A\\\": \\n switch(vigencia){\\n case 1: monto = 20;\\n break;\\n case 3: monto = 25;\\n break;\\n case 4: monto = 30;\\n break;\\n case 5: monto = 40;\\n break;\\n }\\n break;\\n case \\\"Clase B\\\": switch(vigencia){\\n case 1: monto = 20;\\n break;\\n case 3: monto = 25;\\n break;\\n case 4: monto = 30;\\n break;\\n case 5: monto = 40;\\n break;\\n }\\n break;\\n case \\\"Clase C\\\": switch(vigencia){\\n case 1: monto = 23;\\n break;\\n case 3: monto = 30;\\n break;\\n case 4: monto = 35;\\n break;\\n case 5: monto = 47;\\n break;\\n }\\n break;\\n case \\\"Clase D\\\": switch(vigencia){\\n case 1: monto = 20;\\n break;\\n case 3: monto = 25;\\n break;\\n case 4: monto = 30;\\n break;\\n case 5: monto = 40;\\n break;\\n }\\n break;\\n case \\\"Clase E\\\": switch(vigencia){\\n case 1: monto = 29;\\n break;\\n case 3: monto = 39;\\n break;\\n case 4: monto = 44;\\n break;\\n case 5: monto = 59;\\n break;\\n }\\n break;\\n case \\\"Clase F\\\": switch(vigencia){\\n case 1: monto = 20;\\n break;\\n case 3: monto = 25;\\n break;\\n case 4: monto = 30;\\n break;\\n case 5: monto = 40;\\n break;\\n }\\n break;\\n case \\\"Clase G\\\": switch(vigencia){\\n case 1: monto = 20;\\n break;\\n case 3: monto = 25;\\n break;\\n case 4: monto = 30;\\n break;\\n case 5: monto = 40;\\n break;\\n }\\n break;\\n } \\n return monto;\\n }\",\n \"@Override\\n public double cost(){\\n return 2 + super.cake.cost();\\n }\",\n \"@Pure\\n\\tdouble getEstimatedCost();\",\n \"public static void main(String[] args) {\\n\\n\\t\\tCustomer customer = new Customer();\\n\\t\\tShoppingCart cart = new ShoppingCart();\\n\\t\\tBill bill = new Bill();\\n\\t\\t\\n\\t\\tcustomer.addCart(cart);\\n\\t\\t\\n\\t\\tint cost1 = 15;\\n\\t\\tint cost2 = 30;\\n\\t\\tint cost3 = 10;\\n\\t int cost4 = 20;\\n\\t\\t\\n\\t\\tItem item1 = new Item( 12345666L);\\n\\t\\titem1.setCost(cost1);\\n\\t\\tItem item2 = new Item(12345667L);\\n\\t\\titem2.setCost(cost2);\\n\\t\\tItem item3 = new Item(12345668L);\\n\\t\\titem3.setCost(cost3);\\n\\t\\tItem item4 = new Item(12345669L);\\n\\t\\titem4.setCost(cost4);\\n\\t\\t\\n\\t\\tcart.addItem(item1);\\n\\t\\tcart.addItem(item2);\\n\\t\\tcart.addItem(item3);\\n\\t\\tcart.addItem(item4);\\n\\t\\t\\n\\t\\t\\n\\t\\tint total = cart.getTotal();\\n\\t\\t\\n\\t\\tint actual = cost1 + cost2 + cost3 + cost4 ;\\n\\t\\t\\n\\t\\tif(total==actual){\\n\\t\\tSystem.out.println(\\\"getTotal is correct\\\");\\n\\t\\tSystem.out.println(\\\"item 1 is \\\" + cost1 + \\\"item 2 is \\\"+cost2 + \\\"item 3 is \\\" + cost3 + \\\"item 4 is \\\"+ cost4);\\n\\t\\tSystem.out.println(\\\"Total is \\\" + total);\\n\\t\\t}else{\\n\\t\\tSystem.out.println(\\\"getTotal is wrong\\\");\\n\\t\\tSystem.out.println(\\\"expected \\\" + actual);\\t\\n\\t\\tSystem.out.println(\\\"returned \\\" + total);\\t\\n\\t\\t}\\n\\t\\t\\n\\t\\tSystem.out.println(\\\"removing an item from cart \\\");\\n\\t\\t\\n\\t\\tcart.removeItem(item4);\\n\\t\\tint newActual = cost1 + cost2 + cost3;\\n\\t\\tint newTotal = cart.getTotal();\\n\\t\\tif(total==actual){\\n\\t\\t\\tSystem.out.println(\\\"getTotal is correct\\\");\\n\\t\\t\\tSystem.out.println(\\\"item 1 is \\\" + cost1 + \\\"item 2 is \\\"+cost2 + \\\"item 3 is \\\" + cost3 );\\n\\t\\t\\tSystem.out.println(\\\"Total is \\\" + newTotal);\\n\\t\\t}else{\\n\\t\\t\\tSystem.out.println(\\\"getTotal is wrong\\\");\\n\\t\\t\\tSystem.out.println(\\\"expected \\\" + newActual);\\t\\n\\t\\t\\tSystem.out.println(\\\"returned \\\" + newTotal);\\t\\n\\t\\t\\t}\\n\\t\\t\\n\\t\\t\\n\\t\\tbill.inputBill();\\n\\t\\t\\n\\t\\t\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"@Override\\n public double cost(){\\n return 1 + super.sandwich.cost();\\n }\",\n \"private void calculatePrice(int quantity, int pricePerCup) {\\n int price = quantity * pricePerCup;\\n }\",\n \"@Override\\r\\n public double getBaseCost() { return type.getCost(); }\",\n \"@Override\\r\\n\\tprotected void processCost() throws SGSException {\\n\\r\\n\\t}\",\n \"@Test\\r\\n\\tpublic void getTotal_4bc(){\\n\\t\\tcart = new TourShoppingCart(MockRules.getRules());\\r\\n\\t\\t\\r\\n\\t\\tcart.add(new Item(ItemType.BC, BigDecimal.valueOf(110.00)) );\\r\\n\\t\\tcart.add(new Item(ItemType.BC, BigDecimal.valueOf(110.00)) );\\r\\n\\t\\tcart.add(new Item(ItemType.BC, BigDecimal.valueOf(110.00)) );\\r\\n\\t\\tcart.add(new Item(ItemType.BC, BigDecimal.valueOf(110.00)) );\\r\\n\\t\\tcart.add(new Item(ItemType.BC, BigDecimal.valueOf(110.00)) );\\r\\n\\t\\t\\r\\n\\t\\tcart.add(new Item(ItemType.OH, BigDecimal.valueOf(300.00)) );\\r\\n\\t\\t\\r\\n\\t\\tassert cart.total().equals(BigDecimal.valueOf(760.00));\\r\\n\\t\\tSystem.out.println(cart.total());\\r\\n\\t}\",\n \"@Override\\n\\tpublic double cost() {\\n\\t\\treturn 10000;\\n\\t}\",\n \"public double getCost() \\n { \\n return super.getCost() +22;\\n }\",\n \"public double getCost(StringBuffer detail, boolean ignoreAmmo) {\\n double[] costs = new double[15];\\n int i = 0;\\n\\n double cockpitCost = 0;\\n if (getCockpitType() == Mech.COCKPIT_TORSO_MOUNTED) {\\n cockpitCost = 750000;\\n } else if (getCockpitType() == Mech.COCKPIT_DUAL) {\\n // FIXME\\n cockpitCost = 0;\\n } else if (getCockpitType() == Mech.COCKPIT_COMMAND_CONSOLE) {\\n // Command Consoles are listed as a cost of 500,000.\\n // That appears to be in addition to the primary cockpit.\\n cockpitCost = 700000;\\n } else if (getCockpitType() == Mech.COCKPIT_SMALL) {\\n cockpitCost = 175000;\\n } else if (getCockpitType() == Mech.COCKPIT_INDUSTRIAL) {\\n cockpitCost = 100000;\\n } else {\\n cockpitCost = 200000;\\n }\\n if (hasEiCockpit() && getCrew().getOptions().booleanOption(\\\"ei_implant\\\")) {\\n cockpitCost = 400000;\\n }\\n costs[i++] = cockpitCost;\\n costs[i++] = 50000;// life support\\n costs[i++] = weight * 2000;// sensors\\n int muscCost = hasTSM() ? 16000 : 2000;\\n costs[i++] = muscCost * weight;// musculature\\n costs[i++] = EquipmentType.getStructureCost(structureType) * weight;// IS\\n costs[i++] = getActuatorCost();// arm and/or leg actuators\\n Engine engine = getEngine();\\n costs[i++] = engine.getBaseCost() * engine.getRating() * weight / 75.0;\\n if (getGyroType() == Mech.GYRO_XL) {\\n costs[i++] = 750000 * (int) Math.ceil(getOriginalWalkMP() * weight / 100f) * 0.5;\\n } else if (getGyroType() == Mech.GYRO_COMPACT) {\\n costs[i++] = 400000 * (int) Math.ceil(getOriginalWalkMP() * weight / 100f) * 1.5;\\n } else if (getGyroType() == Mech.GYRO_HEAVY_DUTY) {\\n costs[i++] = 500000 * (int) Math.ceil(getOriginalWalkMP() * weight / 100f) * 2;\\n } else {\\n costs[i++] = 300000 * (int) Math.ceil(getOriginalWalkMP() * weight / 100f);\\n }\\n double jumpBaseCost = 200;\\n // You cannot have JJ's and UMU's on the same unit.\\n if (hasUMU()) {\\n costs[i++] = Math.pow(getAllUMUCount(), 2.0) * weight * jumpBaseCost;\\n } else {\\n if (getJumpType() == Mech.JUMP_BOOSTER) {\\n jumpBaseCost = 150;\\n } else if (getJumpType() == Mech.JUMP_IMPROVED) {\\n jumpBaseCost = 500;\\n }\\n costs[i++] = Math.pow(getOriginalJumpMP(), 2.0) * weight * jumpBaseCost;\\n }\\n // num of sinks we don't pay for\\n int freeSinks = hasDoubleHeatSinks() ? 0 : 10;\\n int sinkCost = hasDoubleHeatSinks() ? 6000 : 2000;\\n // cost of sinks\\n costs[i++] = sinkCost * (heatSinks() - freeSinks);\\n costs[i++] = hasFullHeadEject()?1725000:0;\\n costs[i++] = getArmorWeight() * EquipmentType.getArmorCost(armorType);\\n costs[i++] = getWeaponsAndEquipmentCost(ignoreAmmo);\\n\\n double cost = 0; // calculate the total\\n for (int x = 0; x < i; x++) {\\n cost += costs[x];\\n }\\n\\n double omniMultiplier = 0;\\n if (isOmni()) {\\n omniMultiplier = 1.25f;\\n cost *= omniMultiplier;\\n }\\n costs[i++] = -omniMultiplier; // negative just marks it as multiplier\\n\\n double weightMultiplier = 1 + (weight / 100f);\\n costs[i++] = -weightMultiplier; // negative just marks it as multiplier\\n cost = Math.round(cost * weightMultiplier);\\n if (detail != null) {\\n addCostDetails(cost, detail, costs);\\n }\\n return cost;\\n }\",\n \"public int totalCostOfComponents( ){\\n\\t\\tint total=0;\\n\\t\\tfor (Component temp : components){\\n\\t\\t\\ttotal+=temp.getCost();\\n\\t\\t}\\n\\t\\treturn total;\\n\\t}\",\n \"double setEstimatedCost(double cost);\",\n \"private double calcuFcost() {\\n\\t\\treturn num * configMap.get('r') + (num-1) * configMap.get('l') + num * configMap.get('f') + configMap.get('t');\\n\\t}\",\n \"public int getCost() {\\n\\t\\treturn (int) Math.round(weight*price_per_pound);\\n\\t\\t\\n\\t}\",\n \"public int getCost(Tile<T> n1, Tile<T> n2);\",\n \"public double calculateSubTotal() {\\n return candy.getPrice() * quantity;\\n\\n }\",\n \"public double getCost() {\\t\\t \\n\\t\\treturn cost;\\n\\t}\",\n \"@Override\\n public double getCost() {\\n return cost;\\n }\",\n \"double calculateCost() {\\n double cost = 0;\\n InspectionDTO[] DTOArray = this.currentInspectionChecklist.inspectionDTOArray;\\n for (int i = 0; i <= DTOArray.length - 1; i++) {\\n cost += DTOArray[i].getCost();\\n }\\n return cost;\\n }\",\n \"public static void main(String[] args) {\\n \\n// scanner\\n Scanner myScanner;\\n myScanner = new Scanner( System.in );\\n \\n// user inputs\\n System.out.print(\\n \\\"Enter the number of Big Macs(an interger > 0): \\\"); // asking user for the number of Big Macs\\n int nBigMacs = myScanner.nextInt(); // declare that input as an interger nBigMacs\\n \\n System.out.print(\\\"Enter the cost per Big Mac as\\\"+ \\n \\\" a double (in the form xx.xx) :\\\"); // prompts for the cost of 1 Big Mac\\n double bigMac$ = myScanner.nextDouble(); //declaration of the Big Mac cost as a variable\\n \\n System.out.print(\\n \\\"Enter the percent tax as a whole number (xx): \\\"); // prompts user for tax percent\\n double taxRate = myScanner.nextDouble(); // decleration of tax rate\\n taxRate/=100; // converts whole number to a usable proportion\\n \\n// eeclare variables for output and calculation\\n double cost$;\\n int dollars,dimes, pennies; // make variables for dollars, dimes, and pennies for storing digits\\n cost$=nBigMacs*bigMac$*(1+taxRate); //calculation for the cost of all Big Macs\\n dollars=(int)cost$; //gets dollars as a whole interger\\n dimes=(int)(cost$*10)%10; //isolates one digit after the decimal place\\n pennies=(int)(cost$*100)%10; //isolates the second degit after the decimal place\\n \\n// print results\\n System.out.println(\\\"The total cost of \\\"+nBigMacs+\\\" Big Macs, at $\\\"+bigMac$+\\\" per Big Mac, with a sales tax of \\\"+(int)(taxRate*100) + \\\"%, is $\\\"+dollars+'.'+dimes+pennies);\\n \\n }\",\n \"public double getCost() {\\n\\t\\tif (this.accommodationType.equals(TYPEsingle)) {\\n\\t\\t\\tif (this.getRoomView().equals(\\\"street view\\\")) {\\n\\t\\t\\t\\treturn 50.0;\\n\\t\\t\\t} else if (this.getRoomView().equals(\\\"garden view\\\")) {\\n\\t\\t\\t\\treturn 70.0;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\treturn 110.0;\\n\\t\\t\\t}\\n\\t\\t} else if (this.accommodationType.equals(TYPEdouble)) {\\n\\t\\t\\tif (this.getRoomView().equals(\\\"street view\\\")) {\\n\\t\\t\\t\\treturn 70.0;\\n\\t\\t\\t} else if (this.getRoomView().equals(\\\"garden view\\\")) {\\n\\t\\t\\t\\treturn 98.0;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\treturn 154.0;\\n\\t\\t\\t}\\n\\t\\t} else if (this.accommodationType.equals(TYPEfamily)) {\\n\\t\\t\\tif (this.getRoomView().equals(\\\"street view\\\")) {\\n\\t\\t\\t\\treturn 86.0;\\n\\t\\t\\t} else if (this.getRoomView().equals(\\\"garden view\\\")) {\\n\\t\\t\\t\\tif (getInfoJacuzzi() == true) {\\n\\t\\t\\t\\t\\treturn 180.6;\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\treturn 120.4;\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tif (getInfoJacuzzi() == true) {\\n\\t\\t\\t\\t\\treturn 283.8;\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\treturn 189.2;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t} else if (this.accommodationType.equals(TYPEpresidential)) {\\n\\t\\t\\tif (this.getRoomView().equals(\\\"street view\\\")) {\\n\\t\\t\\t\\treturn 200.0;\\n\\t\\t\\t} else if (this.getRoomView().equals(\\\"garden view\\\")) {\\n\\t\\t\\t\\tif (getInfoJacuzzi() == true) {\\n\\t\\t\\t\\t\\treturn 420.0;\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\treturn 280.0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tif (getInfoJacuzzi() == true) {\\n\\t\\t\\t\\t\\treturn 660.0;\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\treturn 440.0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t} else {\\n\\t\\t\\treturn 0.0;\\n\\t\\t}\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.74331397","0.69724363","0.6677726","0.65370077","0.6431816","0.6332957","0.626661","0.6250655","0.6223832","0.622378","0.6208951","0.6208951","0.6199922","0.61795336","0.6133281","0.6113645","0.61078256","0.6096503","0.6047753","0.6040718","0.60173225","0.6011416","0.5985406","0.5969814","0.59533817","0.58976555","0.5892759","0.58922714","0.58922714","0.58922714","0.5887153","0.58864784","0.58720595","0.5866795","0.58508664","0.58469164","0.58199006","0.5809971","0.5788923","0.57620406","0.57602936","0.5752348","0.57427037","0.5741067","0.5737468","0.5737468","0.5737468","0.5731174","0.5726552","0.57145035","0.5705775","0.5704962","0.5701305","0.5696749","0.56624633","0.56416214","0.56337786","0.56337214","0.5622292","0.5609868","0.5605637","0.5601674","0.5595544","0.55848145","0.5572926","0.5568706","0.55636406","0.555909","0.55353457","0.5532078","0.5514231","0.5503684","0.5495066","0.5493042","0.5490146","0.54891115","0.54847544","0.5481874","0.5481528","0.5476867","0.54642576","0.545806","0.5450151","0.5448263","0.544717","0.54434896","0.5433562","0.54332554","0.5430315","0.5429475","0.5415879","0.5409825","0.54096955","0.54079413","0.5402706","0.5399545","0.5393445","0.53912294","0.5388633","0.53862363"],"string":"[\n \"0.74331397\",\n \"0.69724363\",\n \"0.6677726\",\n \"0.65370077\",\n \"0.6431816\",\n \"0.6332957\",\n \"0.626661\",\n \"0.6250655\",\n \"0.6223832\",\n \"0.622378\",\n \"0.6208951\",\n \"0.6208951\",\n \"0.6199922\",\n \"0.61795336\",\n \"0.6133281\",\n \"0.6113645\",\n \"0.61078256\",\n \"0.6096503\",\n \"0.6047753\",\n \"0.6040718\",\n \"0.60173225\",\n \"0.6011416\",\n \"0.5985406\",\n \"0.5969814\",\n \"0.59533817\",\n \"0.58976555\",\n \"0.5892759\",\n \"0.58922714\",\n \"0.58922714\",\n \"0.58922714\",\n \"0.5887153\",\n \"0.58864784\",\n \"0.58720595\",\n \"0.5866795\",\n \"0.58508664\",\n \"0.58469164\",\n \"0.58199006\",\n \"0.5809971\",\n \"0.5788923\",\n \"0.57620406\",\n \"0.57602936\",\n \"0.5752348\",\n \"0.57427037\",\n \"0.5741067\",\n \"0.5737468\",\n \"0.5737468\",\n \"0.5737468\",\n \"0.5731174\",\n \"0.5726552\",\n \"0.57145035\",\n \"0.5705775\",\n \"0.5704962\",\n \"0.5701305\",\n \"0.5696749\",\n \"0.56624633\",\n \"0.56416214\",\n \"0.56337786\",\n \"0.56337214\",\n \"0.5622292\",\n \"0.5609868\",\n \"0.5605637\",\n \"0.5601674\",\n \"0.5595544\",\n \"0.55848145\",\n \"0.5572926\",\n \"0.5568706\",\n \"0.55636406\",\n \"0.555909\",\n \"0.55353457\",\n \"0.5532078\",\n \"0.5514231\",\n \"0.5503684\",\n \"0.5495066\",\n \"0.5493042\",\n \"0.5490146\",\n \"0.54891115\",\n \"0.54847544\",\n \"0.5481874\",\n \"0.5481528\",\n \"0.5476867\",\n \"0.54642576\",\n \"0.545806\",\n \"0.5450151\",\n \"0.5448263\",\n \"0.544717\",\n \"0.54434896\",\n \"0.5433562\",\n \"0.54332554\",\n \"0.5430315\",\n \"0.5429475\",\n \"0.5415879\",\n \"0.5409825\",\n \"0.54096955\",\n \"0.54079413\",\n \"0.5402706\",\n \"0.5399545\",\n \"0.5393445\",\n \"0.53912294\",\n \"0.5388633\",\n \"0.53862363\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.68586314"},"document_rank":{"kind":"string","value":"2"}}},{"rowIdx":38192,"cells":{"query":{"kind":"string","value":"This method will compute the correct cost according to the parameters passed to it"},"document":{"kind":"string","value":"public double returnBoxCost(double cardGradeCost, double colourOptPercent, double reinfPercent, double sealablePercent){\n\t\tdouble sum = cardGradeCost + ((cardGradeCost * colourOptPercent) / 100) + ((cardGradeCost * reinfPercent) / 100)\n\t\t\t\t+ ((cardGradeCost * sealablePercent) / 100); \n\t\tdouble computeTotal = 0.00;\n\t\t\n\t\tDecimalFormat df = new DecimalFormat(\"##.##\");\t\n\t\t\n\t\ttry{\n\t\t\tcomputeTotal = Double.valueOf(df.format(sum));\n\t\t\t}catch(NumberFormatException nme){\n\t\t\t\t\n\t\t\t}\n\t\treturn computeTotal;\n\t}"},"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":["double getCost();","double getCost();","double getSolutionCost();","@Override\r\n\tprotected void processCost() {\n\r\n\t}","public abstract double getCost();","protected abstract double getDefaultCost();","double getTotalCost();","float getCostReduction();","public void compute(){\r\n\r\n\t\ttotalCost=(capAmount*CAPCOST)+(hoodyAmount*HOODYCOST)+(shirtAmount*SHIRTCOST);\r\n\t}","@Override\n\tpublic double cost() {\n\t\tdouble price = good.cost();\n\t\treturn price+price/2;\n\t}","public void calculateCost() {\n\t\tthis.cost = 0.0;\n\t\t\n\t\tint i, count = this.cities.size()-1;\n\t\tfor (i = 0; i < count; i++)\n\t\t\tthis.cost += this.cities.get(i).distances[this.cities.get(i+1).index];\n\n\t\tthis.cost += this.cities.get(count).distances[this.cities.get(0).index];\n\t}","public float getCost()\r\n/* 13: */ {\r\n/* 14:10 */ return this.costFromStart + this.estimatedCostToGoal;\r\n/* 15: */ }","double ComputeCost(double order, double tipPercent, double serviceRating, double foodRating)\r\n {\r\n // kazda gwiazdka to 2 procent od sumy zamówienia\r\n return order + order * (tipPercent/100) + (serviceRating * 0.02) * order + (foodRating * 0.02) * order;\r\n }","@Override\n\tpublic double cost() {\n\t\treturn 2.19;\n\t}","public abstract float getEstimatedCost(AStarNode paramAStarNode);","public void calculateCost()\n\t{\n\t\tLogManager lgmngr = LogManager.getLogManager(); \n\t\tLogger log = lgmngr.getLogger(Logger.GLOBAL_LOGGER_NAME);\n\t\tString s = \"\";\n\t\tint costperfeet = 0;\n\t\tif (this.materialStandard.equals(\"standard materials\") && this.fullyAutomated == false)\n\t\t\tcostperfeet = 1200;\n\t\telse if (this.materialStandard.equals(\"above standard materials\") && this.fullyAutomated == false)\n\t\t\tcostperfeet = 1500;\n\t\telse if(this.materialStandard.equals(\"high standard materials\") && this.fullyAutomated == false)\n\t\t\tcostperfeet = 1800;\n\t\telse if (this.materialStandard.equals(\"high standard materials\") && this.fullyAutomated == true)\n\t\t\tcostperfeet = 2500;\n\t\t\n\t\tint totalCost = costperfeet * this.totalArea;\n\t\t/*s = \"Total Cost of Construction is :- \";\n\t\twriter.printf(\"%s\" + totalCost, s);\n\t\twriter.flush();*/\n\t\tlog.log(Level.INFO, \"Total Cost of Construction is :- \" + totalCost);\n\t}","public void generateCost() throws StandardException {\n\n double baseTableSelectivity = computePhaseSelectivity(selectivityHolder,QualifierPhase.BASE);\n double filterBaseTableSelectivity = computePhaseSelectivity(selectivityHolder,QualifierPhase.BASE,QualifierPhase.FILTER_BASE);\n double projectionSelectivity = computePhaseSelectivity(selectivityHolder,QualifierPhase.FILTER_PROJECTION);\n double totalSelectivity = computeTotalSelectivity(selectivityHolder);\n\n assert filterBaseTableSelectivity >= 0 && filterBaseTableSelectivity <= 1.0:\"filterBaseTableSelectivity Out of Bounds -> \" + filterBaseTableSelectivity;\n assert baseTableSelectivity >= 0 && baseTableSelectivity <= 1.0:\"baseTableSelectivity Out of Bounds -> \" + baseTableSelectivity;\n assert projectionSelectivity >= 0 && projectionSelectivity <= 1.0:\"projectionSelectivity Out of Bounds -> \" + projectionSelectivity;\n assert totalSelectivity >= 0 && totalSelectivity <= 1.0:\"totalSelectivity Out of Bounds -> \" + totalSelectivity;\n\n // Total Row Count from the Base Conglomerate\n double totalRowCount = scc.baseRowCount();\n assert totalRowCount >= 0 : \"totalRowCount cannot be negative -> \" + totalRowCount;\n // Rows Returned is always the totalSelectivity (Conglomerate Independent)\n scanCost.setEstimatedRowCount(Math.round(totalRowCount*totalSelectivity));\n\n double baseTableAverageRowWidth = scc.getBaseTableAvgRowWidth();\n double baseTableColumnSizeFactor = scc.baseTableColumnSizeFactor(totalColumns);\n\n // We use the base table so the estimated heap size and remote cost are the same for all conglomerates\n double colSizeFactor = baseTableAverageRowWidth*baseTableColumnSizeFactor;\n assert baseTableAverageRowWidth >= 0 : \"baseTableAverageRowWidth cannot be negative -> \" + baseTableAverageRowWidth;\n assert baseTableColumnSizeFactor >= 0 : \"baseTableColumnSizeFactor cannot be negative -> \" + baseTableColumnSizeFactor;\n\n double openLatency = scc.getOpenLatency();\n double closeLatency = scc.getCloseLatency();\n double localLatency = scc.getLocalLatency();\n double remoteLatency = scc.getRemoteLatency();\n double remoteCost = openLatency + closeLatency + totalRowCount*totalSelectivity*remoteLatency*(1+colSizeFactor/100d);\n assert openLatency >= 0 : \"openLatency cannot be negative -> \" + openLatency;\n assert closeLatency >= 0 : \"closeLatency cannot be negative -> \" + closeLatency;\n assert localLatency >= 0 : \"localLatency cannot be negative -> \" + localLatency;\n assert remoteLatency >= 0 : \"remoteLatency cannot be negative -> \" + remoteLatency;\n assert remoteCost >= 0 : \"remoteCost cannot be negative -> \" + remoteCost;\n // Heap Size is the avg row width of the columns for the base table*total rows\n // Average Row Width\n // This should be the same for every conglomerate path\n scanCost.setEstimatedHeapSize((long)(totalRowCount*totalSelectivity*colSizeFactor));\n // Should be the same for each conglomerate\n scanCost.setRemoteCost((long)remoteCost);\n // Base Cost + LookupCost + Projection Cost\n double congAverageWidth = scc.getConglomerateAvgRowWidth();\n double baseCost = openLatency+closeLatency+(totalRowCount*baseTableSelectivity*localLatency*(1+congAverageWidth/100d));\n assert congAverageWidth >= 0 : \"congAverageWidth cannot be negative -> \" + congAverageWidth;\n assert baseCost >= 0 : \"baseCost cannot be negative -> \" + baseCost;\n scanCost.setFromBaseTableRows(filterBaseTableSelectivity * totalRowCount);\n scanCost.setFromBaseTableCost(baseCost);\n double lookupCost;\n if (lookupColumns == null)\n lookupCost = 0.0d;\n else {\n lookupCost = totalRowCount*filterBaseTableSelectivity*(openLatency+closeLatency);\n scanCost.setIndexLookupRows(filterBaseTableSelectivity*totalRowCount);\n scanCost.setIndexLookupCost(lookupCost+baseCost);\n }\n assert lookupCost >= 0 : \"lookupCost cannot be negative -> \" + lookupCost;\n\n double projectionCost;\n if (projectionSelectivity == 1.0d)\n projectionCost = 0.0d;\n else {\n projectionCost = totalRowCount * filterBaseTableSelectivity * localLatency * colSizeFactor*1d/1000d;\n scanCost.setProjectionRows(scanCost.getEstimatedRowCount());\n scanCost.setProjectionCost(lookupCost+baseCost+projectionCost);\n }\n assert projectionCost >= 0 : \"projectionCost cannot be negative -> \" + projectionCost;\n\n double localCost = baseCost+lookupCost+projectionCost;\n assert localCost >= 0 : \"localCost cannot be negative -> \" + localCost;\n scanCost.setLocalCost(localCost);\n scanCost.setNumPartitions(scc.getNumPartitions());\n scanCost.setLocalCostPerPartition((baseCost + lookupCost + projectionCost)/scc.getNumPartitions());\n }","@Override\n\tpublic double cost() {\n\t\treturn 10000;\n\t}","@Pure\n\tdouble getCost();","@Override\n\tvoid get_cost_per_sqarefeet() {\n\t\tcost=1800;\n\t}","int getCost();","int getCost();","int getCost();","public abstract float getCost(AStarNode paramAStarNode);","private double calcuFcost() {\n\t\treturn num * configMap.get('r') + (num-1) * configMap.get('l') + num * configMap.get('f') + configMap.get('t');\n\t}","double setCost(double cost);","double setEstimatedCost(double cost);","@Override\r\n\tpublic int cost() {\n\t\treturn b1.cost() + 1;\r\n\t}","@Pure\n\tdouble getEstimatedCost();","@Override\n public double calcCost() {\n return calcSalesFee()+calcTaxes();\n }","@Override\n public double getCost() {\n\t return 13;\n }","public double calculateCost(Purchase purchase);","public abstract int getCost();","public abstract int getCost();","public abstract int getCost();","@Override\n public double getCost() {\n return cost;\n }","@Override\r\n\tpublic void addToCost() {\n\t\t\r\n\t}","public void calculateCost(){\n if(this.isChair){\n for(int i = 0; i < this.chairs.length; i++){\n this.cost += this.chairs[i].getPrice();\n }\n }\n //if furniture type is chair, add up cost of all items in list\n if(this.isDesk){\n for(int i = 0; i < this.desks.length; i++){\n this.cost += this.desks[i].getPrice();\n }\n }\n //if furniture type is chair, add up cost of all items in list\n if(this.isFiling){\n for(int i = 0; i < this.filingCabinets.length; i++){\n this.cost += this.filingCabinets[i].getPrice();\n }\n }\n //if furniture type is chair, add up cost of all items in list\n if(this.isLamp){\n for(int i = 0; i < this.lamps.length; i++){\n this.cost += this.lamps[i].getPrice();\n }\n }\n }","protected double getCost(double[] n) throws Exception {\n\t\tdouble[] da = this.outputDifferences(n);\n\t\tdouble o = 0;\n\t\tfor (double d : da) o += d*d;\n\t\treturn o;\n\t}","@Override\n public double cost()\n {\n return this.price * this.number;\n }","public double calcCost() {\n // $2 per topping.\n double cost = 2 * (this.cheese + this.pepperoni + this.ham);\n // size cost\n switch (this.size) {\n case \"small\":\n cost += 10;\n break;\n case \"medium\":\n cost += 12;\n break;\n case \"large\":\n cost += 14;\n break;\n default:\n }\n return cost;\n }","@Override\n\tprotected void setCost(double cst) {\n\t\t\n\t}","public float getCost(Node n){\n char t1 = this.type;\n char t2 = n.getType();\n int row1 = this.row;\n int col1 = this.col;\n int row2 = n.getRow();\n int col2 = n.getCol();\n boolean straight;\n\n if(row1 == row2 || col1 == col2)\n straight = true;\n else\n straight = false;\n\n if(straight){\n switch (t1){\n case '1':\n switch (t2){\n case '1':\n return 1;\n case '2':\n return (float)1.5;\n case 'a':\n return 1;\n case 'b':\n return (float)1.5;\n }\n break;\n case '2':\n switch (t2){\n case '1':\n return (float)1.5;\n case '2':\n return 2;\n case 'a':\n return (float)1.5;\n case 'b':\n return 2;\n }\n break;\n case 'a':\n switch (t2){\n case '1':\n return 1;\n case '2':\n return (float)1.5;\n case 'a':\n return (float).25;\n case 'b':\n return (float).375;\n }\n break;\n case 'b':\n switch (t2){\n case '1':\n return (float)1.5;\n case '2':\n return 2;\n case 'a':\n return (float).375;\n case 'b':\n return (float).25;\n }\n break;\n }\n } else{\n switch(t1){\n case '1':\n switch (t2){\n case 'a':\n case '1':\n return (float)Math.sqrt(2);\n case '2':\n case 'b':\n return (float)((Math.sqrt(2)+Math.sqrt(8))/2);\n }\n break;\n case '2':\n switch (t2){\n case 'a':\n case '1':\n return (float)((Math.sqrt(2)+Math.sqrt(8))/2);\n case '2':\n case 'b':\n return (float)Math.sqrt(8);\n }\n break;\n case 'a':\n switch (t2){\n case 'a':\n case '1':\n return (float)Math.sqrt(2);\n case '2':\n case 'b':\n return (float)((Math.sqrt(2)+Math.sqrt(8))/2);\n }\n break;\n case 'b':\n switch (t2){\n case 'a':\n case '1':\n return (float)((Math.sqrt(2)+Math.sqrt(8))/2);\n case '2':\n case 'b':\n return (float)Math.sqrt(8);\n }\n break;\n }\n }\n\n return 0;\n }","public static double Cost(double boxes, double Cost) {\n\tdouble pay = boxes * Cost;\n\treturn pay;\n}","public double getCost()\n\t{\n\t\treturn 0.9;\n\t}","public void calculateCost() {\n \tdouble costToShipPack;\n \tint numOfPacks = 1;\n \t\n \tfor(Package p: this.packages) {\n \t\tcostToShipPack = 3 + (p.calcVolume() - 1);\n \t\tthis.totalAmounts.put(\"Package \"+numOfPacks, costToShipPack);\n \t\tnumOfPacks++;\n \t}\n \t\n }","public double calcCost(){\n double cost = 0;\n cost += pMap.get(size);\n cost += cMap.get(crust);\n //Toppings are priced at 3.00 for 3-4 topppings, and 4.0 for 5+ toppings\n \n if(toppings !=null)\n {\n if((toppings.length == 3) || (toppings.length == 4)){\n cost += 3.0;\n }\n if (toppings.length > 4){\n cost += 4.0;\n }\n }\n \n return cost;\n }","public double costNEX() {\r\n double diff=0;\r\n double intensity=0;\r\n \r\n for(int x=Config.ptvXLow-0; x < Config.ptvXHigh+0; x++) {\r\n// for(int x=Solver.xBoundsTumor[0]; x < Solver.xBoundsTumor[1]; x+= Config.scaleFactor) {\r\n for(int y=Config.ptvYLow-0; y < Config.ptvYHigh+0; y++) {\r\n// for(int y=Solver.yBoundsTumor[0]; y < Solver.yBoundsTumor[1]; y+= Config.scaleFactor) {\r\n for(int z=Config.ptvZLow-0; z < Config.ptvZHigh+0; z++) {\r\n// for(int z=Solver.zBoundsTumor[0]; z < Solver.zBoundsTumor[1]; z+= Config.scaleFactor) {\r\n\r\n this.body2[x][y][z].setCurrentDosis(0.0); //Set currentPtvVoxel Dose to 0 \r\n for(int i=0; i<Config.numberOfSeeds;++i) { \r\n // Calculate intensity based based on current dwelltime\r\n intensity = this.body2[x][y][z].radiationIntensity(this.seeds2[i].getCoordinate(), New_state[i]);\r\n if (intensity>0) {\r\n// LogTool.print(\"Cost: Intensity :\" + intensity + \"@ \" + x + \" \" + y + \" \" + z,\"notification\");\r\n }\r\n this.body2[x][y][z].addCurrentDosis(intensity);\r\n } \r\n diff += Math.pow((this.body2[x][y][z].getGoalDosis()-this.body2[x][y][z].getCurrentDosis()),2);\r\n// LogTool.print(\" diffdose \" + (Looper.body2[x][y][z].getGoalDosis()-Looper.body2[x][y][z].getCurrentDosis()),\"notification\");\r\n } \r\n }\r\n }\r\n return Math.sqrt(diff);\r\n// return Math.random();\r\n }","public double calcCost() {\n if (pizzaSize.equals(\"small\")) {\n return 10.0 + ((cheeseToppings + pepperoniToppings + veggieToppings) * 2);\n\n }\n else if (pizzaSize.equals(\"medium\")) {\n return 12.0 + ((cheeseToppings + pepperoniToppings + veggieToppings) * 2);\n }\n else {\n return 14.0 + ((cheeseToppings + pepperoniToppings + veggieToppings) * 2);\n }\n }","@Override\n public long cost() {\n return 100;\n }","@Override\n public double cost(){\n return 1 + super.sandwich.cost();\n }","@Override\n\tpublic double getCost() {\n\t\treturn price * weight; // cost = price of the candy * weight of candies\n\t}","@Override\n\tpublic double cost() {\n\t\treturn water.cost()+10;\n\t}","@Override\r\n\tpublic double cost() {\n\t\treturn this.cost;\r\n\t}","public double getCost() {\r\n\t \treturn(cost);\r\n\t}","@Override\r\n\tprotected void processCost() throws SGSException {\n\r\n\t}","private double calcuCMetric() {\n\t\treturn (p-1)/fcost;\n\t}","@Override\r\n\tpublic double getCost() {\n\t\treturn 0;\r\n\t}","public void calculateOrderCost(){\n int tmpCost=0;\n for (Vehicle v : vehicleList){\n tmpCost+=v.getCost();\n }\n totalCost=tmpCost;\n }","public double getCost() {\t\t \n\t\treturn cost;\n\t}","void setCost(double cost);","public void calculateCost(AStarNode parentNode, AStarNode endNode)\n \t{\n \t\tthis.costFromStart = parentNode.getCostFromStart() + node.getCost();\n \t\tthis.heuristic = ModelUtils.INSTANCE.getDistance(this.getPosition(), endNode.getPosition());\n \t\tthis.totalCost = this.costFromStart + this.heuristic;\n \t\tthis.parent = parentNode;\n \t}","private double computeCost(Link link, boolean ignorePenalties) {\n \t\tdouble result = link.getLength() / (link.getMaxSpeed_r() / 3.6);\r\n \t\tif (ignorePenalties)\r\n \t\t\treturn result;\r\n \t\tDouble penalty = penalties.get(link);\r\n \t\tif (null != penalty)\r\n \t\t\tresult *= (1 + penalty);\r\n \t\treturn result;\r\n \t}","@Override\r\n public int getCost() {\r\n return cost;\r\n }","public int getCost(Tile<T> n1, Tile<T> n2);","public void setCost(double cost){\n this.cost = cost;\n }","public double getCost() {\n\t\t\n\t\tdouble cost = 0;\n\t\t\n\t\tif (Objects.equals(Size, \"small\"))\n\t\t\tcost = 7.00;\n\t\telse if (Objects.equals(Size, \"medium\"))\n\t\t\tcost = 9.00;\n\t\telse if (Objects.equals(Size, \"large\"))\n\t\t\tcost = 11.00;\n\t\t\n\t\tcost += (Cheese - 1)*1.50;\n\t\tcost += Ham*1.50;\n\t\tcost += Pepperoni*1.50;\n\t\t\n\t\treturn cost;\t\t\n\t}","private double newCost(int v, int w) {\n\t\treturn 0.0;\n\t}","@Override\n\tpublic int cost() {\n\t\treturn 5000;\n\t}","@Override\n\tprotected void computeWithoutTime() {\n\t\tinitShortestPaths();\n\n\t\t// Then we sort for each node v the list of terminals by the distance from v\n\t\tsortedRequiredVertices = new HashMap<Integer, TreeSet<Integer>>();\n\t\tsortRequiredVertices();\n\t\t\n\t\t// Copy of the terminals\n\t\tHashSet<Integer> req = new HashSet<Integer>(\n\t\t\t\tinstance.getRequiredVertices());\n\n\t\t// Union of all the solutions returned by the subalgorithm CH2\n\t\tHashSet<Arc> currentSol = new HashSet<Arc>();\n\n\t\t// Until all terminals are reached\n\t\twhile (req.size() > 0) {\n\n\t\t\t// We apply CH2 to reach some of the non reached terminals\n\t\t\tCouple<HashSet<Arc>, HashSet<Integer>> tree = applyCH2(req);\n\n\t\t\t// tree.first the tree returned by CH2\n\t\t\t// tree.second is the terminals of that tree\n\n\t\t\tcurrentSol.addAll(tree.first);\n\t\t\tfor (Arc a : tree.first)\n\t\t\t\tcosts.put(a, 0); // Set the cost of the arc to 0, as this arc is already used in the solution, it does not cost anything to use it again.\n\t\t\treq.removeAll(tree.second);\n\t\t}\n\n\t\t// Compute the returned solution and its cost.\n\t\tarborescence = new HashSet<Arc>();\n\t\tint c = 0;\n\t\tfor (Arc a : currentSol) {\n\t\t\tList<Arc> l = shortestPaths.get(a);\n\t\t\tif (a.getInput().equals(a.getOutput()))\n\t\t\t\tl = new ArrayList<Arc>();\n\t\t\tfor (Arc b : l) {\n\t\t\t\tarborescence.add(b);\n\t\t\t\tc += instance.getCost(b);\n\t\t\t}\n\t\t}\n\t\tcost = c;\n\t}","public double getCost() {\n\t\treturn 1.25;\n\t}","@Override\n\tpublic double cost() {\n\t\treturn Double.parseDouble(rateOfLatte);\n\t}","public double cost()\n\t{\n\t\treturn (price * weight);\n\t}","@Override\n\tpublic int calculateCost() \n\t{\n\t\treturn (this.modernCenterpieceCost*this.centerpieceCount);\n\t}","@Test\n\tvoid testCost() {\n\t\tint nbCores = 16;\n\t\tlong duration = 2000;\n\t\tDate requestDate = new Date(\"01/01/2000\");\n\t\tJob j1 = new Job(nbCores,requestDate,duration,mediumQ);//16 cores less than 1h\n\t\tJob j2 = new Job(nbCores*2,requestDate,duration,mediumQ);//32 cores less than 1h\n\t\tJob j3 = new Job(nbCores*2+1,requestDate,duration,mediumQ);//33 cores less than 1h\n\t\tJob j4 = new Job(nbCores,requestDate,duration*2,mediumQ);//16 cores more than 1h\n\t\tJob j5 = new Job(nbCores*2+1,requestDate,duration*2,mediumQ);//33 cores more than 1h\n\t\tassertEquals(j1.getCost(),0.05f);\n\t\tassertEquals(j2.getCost(),0.05f);\n\t\tassertEquals(j3.getCost(),0.1f);\n\t\tassertEquals(j4.getCost(),0.1f);\n\t\tassertEquals(j5.getCost(),0.2f);\n\t}","public double getCost() {\n\t\treturn costOverride > 0 ? costOverride : getDefaultCost();\n\t}","private double calcCost(Cloudlet cloudlet, FogDevice fogDevice) {\n double cost = 0;\n //cost includes the processing cost\n cost += fogDevice.getCharacteristics().getCostPerSecond() * cloudlet.getCloudletLength( ) / fogDevice.getHost().getTotalMips();\n // cost includes the memory cost\n cost += fogDevice.getCharacteristics().getCostPerMem() * cloudlet.getMemRequired();\n // cost includes the bandwidth cost\n cost += fogDevice.getCharacteristics().getCostPerBw() * (cloudlet.getCloudletFileSize() + cloudlet.getCloudletOutputSize());\n return cost;\n }","protected void setCost(double cost) \r\n\t{\tthis.cost = cost;\t}","Integer cost(PathFindingNode node, PathFindingNode neighbour);","UnsignedLong cost(EigrpMetricVersion version);","public double calculateCostExclusive() {\n\t\tdouble accumulatedCost = 0;\n\t\tfor(int i = 0; i < solutionLength - 1; i++) {\n\t\t\taccumulatedCost += calculateEuclideanDistance(solutionRepresentation.get(i), solutionRepresentation.get(i + 1));\n\t\t}\n\t\t\n\t\treturn accumulatedCost;\n\t}","public double getCost(ReadOnlyProperty<Double> linkCost){\r\n\t\tdouble travelCost = 0;\r\n\t\tfor(int l: getLinks()){\r\n\t\t\ttravelCost += getLinkProbability(l) * linkCost.get(l);\r\n\t\t}\r\n\t\treturn travelCost;\r\n\t}","public double cost()\n\t{\n\t\treturn _dblCost;\n\t}","public double getCost()\r\n\t{\treturn this.cost;\t}","private void calculateCosts() {\r\n lb_CubicSum.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_Volume)) + \" €\");\r\n lb_MaterialCostSum.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_Price)) + \" €\");\r\n lb_CuttingTimeSum.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_CuttingHours)) + \" €\");\r\n lb_CuttingCostSum.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_CuttingPrice)) + \" €\");\r\n lb_TotalCosts.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_CuttingPrice) + getColmunSum(tc_Price)) + \" €\");\r\n\r\n ModifyController.getInstance().setProject_constructionmaterialList(Boolean.TRUE);\r\n }","@Override\n public int getCost() {\n\treturn 0;\n }","@Override\r\n\tpublic double getCost() {\r\n\t\tdouble total = 0;\r\n\t\t\r\n\t\tfor(Product p: parts) {\r\n\t\t\ttotal += p.getCost();\r\n\t\t}\r\n\t\t\r\n\t\treturn total;\r\n\t}","public double getCost(){\n return cost;\n }","public double calculatingCostO(int quantity)\n { \n cost = 750 + (0.25 * quantity);\n return cost;\n \n }","float getCostScale();","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}","private CostHelper() {}","private double costOf(int w) {\n\t\treturn getVertex(w).getCost();\n\t}","public double getCost() {\r\n return cost;\r\n }","double calculateCost() {\n double cost = 0;\n InspectionDTO[] DTOArray = this.currentInspectionChecklist.inspectionDTOArray;\n for (int i = 0; i <= DTOArray.length - 1; i++) {\n cost += DTOArray[i].getCost();\n }\n return cost;\n }","public double getCost(Triple triple1, Triple triple2) {\n\t\tdouble p1 = 0d;\n\t\tdouble p2 = 0d;\n\n\t\tif (gsh == null) {\n\t\t\tp1 = vcp.getCost(triple1);\n\t\t\tp2 = vcp.getCost(triple2);\n\t\t} else {\n\t\t\tp1 = gsh.getCost(triple1);\n\t\t\tp2 = gsh.getCost(triple2);\n\t\t}\n\n\t\tif (p1 < p2)\n\t\t\treturn p1 + vcp.getCost(triple1, triple2);\n\n\t\treturn p2 + vcp.getCost(triple1, triple2);\n\t}","int getResourceCost();","public int act1Cost()\r\n {\r\n return 1;\r\n }","public double calculateCost() {\n double output = price * (1 + taxRate);\n return output;\n }","public abstract double costPerMin (CallZone zone);","public void setCost(double cost) {\r\n this.cost = cost;\r\n }"],"string":"[\n \"double getCost();\",\n \"double getCost();\",\n \"double getSolutionCost();\",\n \"@Override\\r\\n\\tprotected void processCost() {\\n\\r\\n\\t}\",\n \"public abstract double getCost();\",\n \"protected abstract double getDefaultCost();\",\n \"double getTotalCost();\",\n \"float getCostReduction();\",\n \"public void compute(){\\r\\n\\r\\n\\t\\ttotalCost=(capAmount*CAPCOST)+(hoodyAmount*HOODYCOST)+(shirtAmount*SHIRTCOST);\\r\\n\\t}\",\n \"@Override\\n\\tpublic double cost() {\\n\\t\\tdouble price = good.cost();\\n\\t\\treturn price+price/2;\\n\\t}\",\n \"public void calculateCost() {\\n\\t\\tthis.cost = 0.0;\\n\\t\\t\\n\\t\\tint i, count = this.cities.size()-1;\\n\\t\\tfor (i = 0; i < count; i++)\\n\\t\\t\\tthis.cost += this.cities.get(i).distances[this.cities.get(i+1).index];\\n\\n\\t\\tthis.cost += this.cities.get(count).distances[this.cities.get(0).index];\\n\\t}\",\n \"public float getCost()\\r\\n/* 13: */ {\\r\\n/* 14:10 */ return this.costFromStart + this.estimatedCostToGoal;\\r\\n/* 15: */ }\",\n \"double ComputeCost(double order, double tipPercent, double serviceRating, double foodRating)\\r\\n {\\r\\n // kazda gwiazdka to 2 procent od sumy zamówienia\\r\\n return order + order * (tipPercent/100) + (serviceRating * 0.02) * order + (foodRating * 0.02) * order;\\r\\n }\",\n \"@Override\\n\\tpublic double cost() {\\n\\t\\treturn 2.19;\\n\\t}\",\n \"public abstract float getEstimatedCost(AStarNode paramAStarNode);\",\n \"public void calculateCost()\\n\\t{\\n\\t\\tLogManager lgmngr = LogManager.getLogManager(); \\n\\t\\tLogger log = lgmngr.getLogger(Logger.GLOBAL_LOGGER_NAME);\\n\\t\\tString s = \\\"\\\";\\n\\t\\tint costperfeet = 0;\\n\\t\\tif (this.materialStandard.equals(\\\"standard materials\\\") && this.fullyAutomated == false)\\n\\t\\t\\tcostperfeet = 1200;\\n\\t\\telse if (this.materialStandard.equals(\\\"above standard materials\\\") && this.fullyAutomated == false)\\n\\t\\t\\tcostperfeet = 1500;\\n\\t\\telse if(this.materialStandard.equals(\\\"high standard materials\\\") && this.fullyAutomated == false)\\n\\t\\t\\tcostperfeet = 1800;\\n\\t\\telse if (this.materialStandard.equals(\\\"high standard materials\\\") && this.fullyAutomated == true)\\n\\t\\t\\tcostperfeet = 2500;\\n\\t\\t\\n\\t\\tint totalCost = costperfeet * this.totalArea;\\n\\t\\t/*s = \\\"Total Cost of Construction is :- \\\";\\n\\t\\twriter.printf(\\\"%s\\\" + totalCost, s);\\n\\t\\twriter.flush();*/\\n\\t\\tlog.log(Level.INFO, \\\"Total Cost of Construction is :- \\\" + totalCost);\\n\\t}\",\n \"public void generateCost() throws StandardException {\\n\\n double baseTableSelectivity = computePhaseSelectivity(selectivityHolder,QualifierPhase.BASE);\\n double filterBaseTableSelectivity = computePhaseSelectivity(selectivityHolder,QualifierPhase.BASE,QualifierPhase.FILTER_BASE);\\n double projectionSelectivity = computePhaseSelectivity(selectivityHolder,QualifierPhase.FILTER_PROJECTION);\\n double totalSelectivity = computeTotalSelectivity(selectivityHolder);\\n\\n assert filterBaseTableSelectivity >= 0 && filterBaseTableSelectivity <= 1.0:\\\"filterBaseTableSelectivity Out of Bounds -> \\\" + filterBaseTableSelectivity;\\n assert baseTableSelectivity >= 0 && baseTableSelectivity <= 1.0:\\\"baseTableSelectivity Out of Bounds -> \\\" + baseTableSelectivity;\\n assert projectionSelectivity >= 0 && projectionSelectivity <= 1.0:\\\"projectionSelectivity Out of Bounds -> \\\" + projectionSelectivity;\\n assert totalSelectivity >= 0 && totalSelectivity <= 1.0:\\\"totalSelectivity Out of Bounds -> \\\" + totalSelectivity;\\n\\n // Total Row Count from the Base Conglomerate\\n double totalRowCount = scc.baseRowCount();\\n assert totalRowCount >= 0 : \\\"totalRowCount cannot be negative -> \\\" + totalRowCount;\\n // Rows Returned is always the totalSelectivity (Conglomerate Independent)\\n scanCost.setEstimatedRowCount(Math.round(totalRowCount*totalSelectivity));\\n\\n double baseTableAverageRowWidth = scc.getBaseTableAvgRowWidth();\\n double baseTableColumnSizeFactor = scc.baseTableColumnSizeFactor(totalColumns);\\n\\n // We use the base table so the estimated heap size and remote cost are the same for all conglomerates\\n double colSizeFactor = baseTableAverageRowWidth*baseTableColumnSizeFactor;\\n assert baseTableAverageRowWidth >= 0 : \\\"baseTableAverageRowWidth cannot be negative -> \\\" + baseTableAverageRowWidth;\\n assert baseTableColumnSizeFactor >= 0 : \\\"baseTableColumnSizeFactor cannot be negative -> \\\" + baseTableColumnSizeFactor;\\n\\n double openLatency = scc.getOpenLatency();\\n double closeLatency = scc.getCloseLatency();\\n double localLatency = scc.getLocalLatency();\\n double remoteLatency = scc.getRemoteLatency();\\n double remoteCost = openLatency + closeLatency + totalRowCount*totalSelectivity*remoteLatency*(1+colSizeFactor/100d);\\n assert openLatency >= 0 : \\\"openLatency cannot be negative -> \\\" + openLatency;\\n assert closeLatency >= 0 : \\\"closeLatency cannot be negative -> \\\" + closeLatency;\\n assert localLatency >= 0 : \\\"localLatency cannot be negative -> \\\" + localLatency;\\n assert remoteLatency >= 0 : \\\"remoteLatency cannot be negative -> \\\" + remoteLatency;\\n assert remoteCost >= 0 : \\\"remoteCost cannot be negative -> \\\" + remoteCost;\\n // Heap Size is the avg row width of the columns for the base table*total rows\\n // Average Row Width\\n // This should be the same for every conglomerate path\\n scanCost.setEstimatedHeapSize((long)(totalRowCount*totalSelectivity*colSizeFactor));\\n // Should be the same for each conglomerate\\n scanCost.setRemoteCost((long)remoteCost);\\n // Base Cost + LookupCost + Projection Cost\\n double congAverageWidth = scc.getConglomerateAvgRowWidth();\\n double baseCost = openLatency+closeLatency+(totalRowCount*baseTableSelectivity*localLatency*(1+congAverageWidth/100d));\\n assert congAverageWidth >= 0 : \\\"congAverageWidth cannot be negative -> \\\" + congAverageWidth;\\n assert baseCost >= 0 : \\\"baseCost cannot be negative -> \\\" + baseCost;\\n scanCost.setFromBaseTableRows(filterBaseTableSelectivity * totalRowCount);\\n scanCost.setFromBaseTableCost(baseCost);\\n double lookupCost;\\n if (lookupColumns == null)\\n lookupCost = 0.0d;\\n else {\\n lookupCost = totalRowCount*filterBaseTableSelectivity*(openLatency+closeLatency);\\n scanCost.setIndexLookupRows(filterBaseTableSelectivity*totalRowCount);\\n scanCost.setIndexLookupCost(lookupCost+baseCost);\\n }\\n assert lookupCost >= 0 : \\\"lookupCost cannot be negative -> \\\" + lookupCost;\\n\\n double projectionCost;\\n if (projectionSelectivity == 1.0d)\\n projectionCost = 0.0d;\\n else {\\n projectionCost = totalRowCount * filterBaseTableSelectivity * localLatency * colSizeFactor*1d/1000d;\\n scanCost.setProjectionRows(scanCost.getEstimatedRowCount());\\n scanCost.setProjectionCost(lookupCost+baseCost+projectionCost);\\n }\\n assert projectionCost >= 0 : \\\"projectionCost cannot be negative -> \\\" + projectionCost;\\n\\n double localCost = baseCost+lookupCost+projectionCost;\\n assert localCost >= 0 : \\\"localCost cannot be negative -> \\\" + localCost;\\n scanCost.setLocalCost(localCost);\\n scanCost.setNumPartitions(scc.getNumPartitions());\\n scanCost.setLocalCostPerPartition((baseCost + lookupCost + projectionCost)/scc.getNumPartitions());\\n }\",\n \"@Override\\n\\tpublic double cost() {\\n\\t\\treturn 10000;\\n\\t}\",\n \"@Pure\\n\\tdouble getCost();\",\n \"@Override\\n\\tvoid get_cost_per_sqarefeet() {\\n\\t\\tcost=1800;\\n\\t}\",\n \"int getCost();\",\n \"int getCost();\",\n \"int getCost();\",\n \"public abstract float getCost(AStarNode paramAStarNode);\",\n \"private double calcuFcost() {\\n\\t\\treturn num * configMap.get('r') + (num-1) * configMap.get('l') + num * configMap.get('f') + configMap.get('t');\\n\\t}\",\n \"double setCost(double cost);\",\n \"double setEstimatedCost(double cost);\",\n \"@Override\\r\\n\\tpublic int cost() {\\n\\t\\treturn b1.cost() + 1;\\r\\n\\t}\",\n \"@Pure\\n\\tdouble getEstimatedCost();\",\n \"@Override\\n public double calcCost() {\\n return calcSalesFee()+calcTaxes();\\n }\",\n \"@Override\\n public double getCost() {\\n\\t return 13;\\n }\",\n \"public double calculateCost(Purchase purchase);\",\n \"public abstract int getCost();\",\n \"public abstract int getCost();\",\n \"public abstract int getCost();\",\n \"@Override\\n public double getCost() {\\n return cost;\\n }\",\n \"@Override\\r\\n\\tpublic void addToCost() {\\n\\t\\t\\r\\n\\t}\",\n \"public void calculateCost(){\\n if(this.isChair){\\n for(int i = 0; i < this.chairs.length; i++){\\n this.cost += this.chairs[i].getPrice();\\n }\\n }\\n //if furniture type is chair, add up cost of all items in list\\n if(this.isDesk){\\n for(int i = 0; i < this.desks.length; i++){\\n this.cost += this.desks[i].getPrice();\\n }\\n }\\n //if furniture type is chair, add up cost of all items in list\\n if(this.isFiling){\\n for(int i = 0; i < this.filingCabinets.length; i++){\\n this.cost += this.filingCabinets[i].getPrice();\\n }\\n }\\n //if furniture type is chair, add up cost of all items in list\\n if(this.isLamp){\\n for(int i = 0; i < this.lamps.length; i++){\\n this.cost += this.lamps[i].getPrice();\\n }\\n }\\n }\",\n \"protected double getCost(double[] n) throws Exception {\\n\\t\\tdouble[] da = this.outputDifferences(n);\\n\\t\\tdouble o = 0;\\n\\t\\tfor (double d : da) o += d*d;\\n\\t\\treturn o;\\n\\t}\",\n \"@Override\\n public double cost()\\n {\\n return this.price * this.number;\\n }\",\n \"public double calcCost() {\\n // $2 per topping.\\n double cost = 2 * (this.cheese + this.pepperoni + this.ham);\\n // size cost\\n switch (this.size) {\\n case \\\"small\\\":\\n cost += 10;\\n break;\\n case \\\"medium\\\":\\n cost += 12;\\n break;\\n case \\\"large\\\":\\n cost += 14;\\n break;\\n default:\\n }\\n return cost;\\n }\",\n \"@Override\\n\\tprotected void setCost(double cst) {\\n\\t\\t\\n\\t}\",\n \"public float getCost(Node n){\\n char t1 = this.type;\\n char t2 = n.getType();\\n int row1 = this.row;\\n int col1 = this.col;\\n int row2 = n.getRow();\\n int col2 = n.getCol();\\n boolean straight;\\n\\n if(row1 == row2 || col1 == col2)\\n straight = true;\\n else\\n straight = false;\\n\\n if(straight){\\n switch (t1){\\n case '1':\\n switch (t2){\\n case '1':\\n return 1;\\n case '2':\\n return (float)1.5;\\n case 'a':\\n return 1;\\n case 'b':\\n return (float)1.5;\\n }\\n break;\\n case '2':\\n switch (t2){\\n case '1':\\n return (float)1.5;\\n case '2':\\n return 2;\\n case 'a':\\n return (float)1.5;\\n case 'b':\\n return 2;\\n }\\n break;\\n case 'a':\\n switch (t2){\\n case '1':\\n return 1;\\n case '2':\\n return (float)1.5;\\n case 'a':\\n return (float).25;\\n case 'b':\\n return (float).375;\\n }\\n break;\\n case 'b':\\n switch (t2){\\n case '1':\\n return (float)1.5;\\n case '2':\\n return 2;\\n case 'a':\\n return (float).375;\\n case 'b':\\n return (float).25;\\n }\\n break;\\n }\\n } else{\\n switch(t1){\\n case '1':\\n switch (t2){\\n case 'a':\\n case '1':\\n return (float)Math.sqrt(2);\\n case '2':\\n case 'b':\\n return (float)((Math.sqrt(2)+Math.sqrt(8))/2);\\n }\\n break;\\n case '2':\\n switch (t2){\\n case 'a':\\n case '1':\\n return (float)((Math.sqrt(2)+Math.sqrt(8))/2);\\n case '2':\\n case 'b':\\n return (float)Math.sqrt(8);\\n }\\n break;\\n case 'a':\\n switch (t2){\\n case 'a':\\n case '1':\\n return (float)Math.sqrt(2);\\n case '2':\\n case 'b':\\n return (float)((Math.sqrt(2)+Math.sqrt(8))/2);\\n }\\n break;\\n case 'b':\\n switch (t2){\\n case 'a':\\n case '1':\\n return (float)((Math.sqrt(2)+Math.sqrt(8))/2);\\n case '2':\\n case 'b':\\n return (float)Math.sqrt(8);\\n }\\n break;\\n }\\n }\\n\\n return 0;\\n }\",\n \"public static double Cost(double boxes, double Cost) {\\n\\tdouble pay = boxes * Cost;\\n\\treturn pay;\\n}\",\n \"public double getCost()\\n\\t{\\n\\t\\treturn 0.9;\\n\\t}\",\n \"public void calculateCost() {\\n \\tdouble costToShipPack;\\n \\tint numOfPacks = 1;\\n \\t\\n \\tfor(Package p: this.packages) {\\n \\t\\tcostToShipPack = 3 + (p.calcVolume() - 1);\\n \\t\\tthis.totalAmounts.put(\\\"Package \\\"+numOfPacks, costToShipPack);\\n \\t\\tnumOfPacks++;\\n \\t}\\n \\t\\n }\",\n \"public double calcCost(){\\n double cost = 0;\\n cost += pMap.get(size);\\n cost += cMap.get(crust);\\n //Toppings are priced at 3.00 for 3-4 topppings, and 4.0 for 5+ toppings\\n \\n if(toppings !=null)\\n {\\n if((toppings.length == 3) || (toppings.length == 4)){\\n cost += 3.0;\\n }\\n if (toppings.length > 4){\\n cost += 4.0;\\n }\\n }\\n \\n return cost;\\n }\",\n \"public double costNEX() {\\r\\n double diff=0;\\r\\n double intensity=0;\\r\\n \\r\\n for(int x=Config.ptvXLow-0; x < Config.ptvXHigh+0; x++) {\\r\\n// for(int x=Solver.xBoundsTumor[0]; x < Solver.xBoundsTumor[1]; x+= Config.scaleFactor) {\\r\\n for(int y=Config.ptvYLow-0; y < Config.ptvYHigh+0; y++) {\\r\\n// for(int y=Solver.yBoundsTumor[0]; y < Solver.yBoundsTumor[1]; y+= Config.scaleFactor) {\\r\\n for(int z=Config.ptvZLow-0; z < Config.ptvZHigh+0; z++) {\\r\\n// for(int z=Solver.zBoundsTumor[0]; z < Solver.zBoundsTumor[1]; z+= Config.scaleFactor) {\\r\\n\\r\\n this.body2[x][y][z].setCurrentDosis(0.0); //Set currentPtvVoxel Dose to 0 \\r\\n for(int i=0; i<Config.numberOfSeeds;++i) { \\r\\n // Calculate intensity based based on current dwelltime\\r\\n intensity = this.body2[x][y][z].radiationIntensity(this.seeds2[i].getCoordinate(), New_state[i]);\\r\\n if (intensity>0) {\\r\\n// LogTool.print(\\\"Cost: Intensity :\\\" + intensity + \\\"@ \\\" + x + \\\" \\\" + y + \\\" \\\" + z,\\\"notification\\\");\\r\\n }\\r\\n this.body2[x][y][z].addCurrentDosis(intensity);\\r\\n } \\r\\n diff += Math.pow((this.body2[x][y][z].getGoalDosis()-this.body2[x][y][z].getCurrentDosis()),2);\\r\\n// LogTool.print(\\\" diffdose \\\" + (Looper.body2[x][y][z].getGoalDosis()-Looper.body2[x][y][z].getCurrentDosis()),\\\"notification\\\");\\r\\n } \\r\\n }\\r\\n }\\r\\n return Math.sqrt(diff);\\r\\n// return Math.random();\\r\\n }\",\n \"public double calcCost() {\\n if (pizzaSize.equals(\\\"small\\\")) {\\n return 10.0 + ((cheeseToppings + pepperoniToppings + veggieToppings) * 2);\\n\\n }\\n else if (pizzaSize.equals(\\\"medium\\\")) {\\n return 12.0 + ((cheeseToppings + pepperoniToppings + veggieToppings) * 2);\\n }\\n else {\\n return 14.0 + ((cheeseToppings + pepperoniToppings + veggieToppings) * 2);\\n }\\n }\",\n \"@Override\\n public long cost() {\\n return 100;\\n }\",\n \"@Override\\n public double cost(){\\n return 1 + super.sandwich.cost();\\n }\",\n \"@Override\\n\\tpublic double getCost() {\\n\\t\\treturn price * weight; // cost = price of the candy * weight of candies\\n\\t}\",\n \"@Override\\n\\tpublic double cost() {\\n\\t\\treturn water.cost()+10;\\n\\t}\",\n \"@Override\\r\\n\\tpublic double cost() {\\n\\t\\treturn this.cost;\\r\\n\\t}\",\n \"public double getCost() {\\r\\n\\t \\treturn(cost);\\r\\n\\t}\",\n \"@Override\\r\\n\\tprotected void processCost() throws SGSException {\\n\\r\\n\\t}\",\n \"private double calcuCMetric() {\\n\\t\\treturn (p-1)/fcost;\\n\\t}\",\n \"@Override\\r\\n\\tpublic double getCost() {\\n\\t\\treturn 0;\\r\\n\\t}\",\n \"public void calculateOrderCost(){\\n int tmpCost=0;\\n for (Vehicle v : vehicleList){\\n tmpCost+=v.getCost();\\n }\\n totalCost=tmpCost;\\n }\",\n \"public double getCost() {\\t\\t \\n\\t\\treturn cost;\\n\\t}\",\n \"void setCost(double cost);\",\n \"public void calculateCost(AStarNode parentNode, AStarNode endNode)\\n \\t{\\n \\t\\tthis.costFromStart = parentNode.getCostFromStart() + node.getCost();\\n \\t\\tthis.heuristic = ModelUtils.INSTANCE.getDistance(this.getPosition(), endNode.getPosition());\\n \\t\\tthis.totalCost = this.costFromStart + this.heuristic;\\n \\t\\tthis.parent = parentNode;\\n \\t}\",\n \"private double computeCost(Link link, boolean ignorePenalties) {\\n \\t\\tdouble result = link.getLength() / (link.getMaxSpeed_r() / 3.6);\\r\\n \\t\\tif (ignorePenalties)\\r\\n \\t\\t\\treturn result;\\r\\n \\t\\tDouble penalty = penalties.get(link);\\r\\n \\t\\tif (null != penalty)\\r\\n \\t\\t\\tresult *= (1 + penalty);\\r\\n \\t\\treturn result;\\r\\n \\t}\",\n \"@Override\\r\\n public int getCost() {\\r\\n return cost;\\r\\n }\",\n \"public int getCost(Tile<T> n1, Tile<T> n2);\",\n \"public void setCost(double cost){\\n this.cost = cost;\\n }\",\n \"public double getCost() {\\n\\t\\t\\n\\t\\tdouble cost = 0;\\n\\t\\t\\n\\t\\tif (Objects.equals(Size, \\\"small\\\"))\\n\\t\\t\\tcost = 7.00;\\n\\t\\telse if (Objects.equals(Size, \\\"medium\\\"))\\n\\t\\t\\tcost = 9.00;\\n\\t\\telse if (Objects.equals(Size, \\\"large\\\"))\\n\\t\\t\\tcost = 11.00;\\n\\t\\t\\n\\t\\tcost += (Cheese - 1)*1.50;\\n\\t\\tcost += Ham*1.50;\\n\\t\\tcost += Pepperoni*1.50;\\n\\t\\t\\n\\t\\treturn cost;\\t\\t\\n\\t}\",\n \"private double newCost(int v, int w) {\\n\\t\\treturn 0.0;\\n\\t}\",\n \"@Override\\n\\tpublic int cost() {\\n\\t\\treturn 5000;\\n\\t}\",\n \"@Override\\n\\tprotected void computeWithoutTime() {\\n\\t\\tinitShortestPaths();\\n\\n\\t\\t// Then we sort for each node v the list of terminals by the distance from v\\n\\t\\tsortedRequiredVertices = new HashMap<Integer, TreeSet<Integer>>();\\n\\t\\tsortRequiredVertices();\\n\\t\\t\\n\\t\\t// Copy of the terminals\\n\\t\\tHashSet<Integer> req = new HashSet<Integer>(\\n\\t\\t\\t\\tinstance.getRequiredVertices());\\n\\n\\t\\t// Union of all the solutions returned by the subalgorithm CH2\\n\\t\\tHashSet<Arc> currentSol = new HashSet<Arc>();\\n\\n\\t\\t// Until all terminals are reached\\n\\t\\twhile (req.size() > 0) {\\n\\n\\t\\t\\t// We apply CH2 to reach some of the non reached terminals\\n\\t\\t\\tCouple<HashSet<Arc>, HashSet<Integer>> tree = applyCH2(req);\\n\\n\\t\\t\\t// tree.first the tree returned by CH2\\n\\t\\t\\t// tree.second is the terminals of that tree\\n\\n\\t\\t\\tcurrentSol.addAll(tree.first);\\n\\t\\t\\tfor (Arc a : tree.first)\\n\\t\\t\\t\\tcosts.put(a, 0); // Set the cost of the arc to 0, as this arc is already used in the solution, it does not cost anything to use it again.\\n\\t\\t\\treq.removeAll(tree.second);\\n\\t\\t}\\n\\n\\t\\t// Compute the returned solution and its cost.\\n\\t\\tarborescence = new HashSet<Arc>();\\n\\t\\tint c = 0;\\n\\t\\tfor (Arc a : currentSol) {\\n\\t\\t\\tList<Arc> l = shortestPaths.get(a);\\n\\t\\t\\tif (a.getInput().equals(a.getOutput()))\\n\\t\\t\\t\\tl = new ArrayList<Arc>();\\n\\t\\t\\tfor (Arc b : l) {\\n\\t\\t\\t\\tarborescence.add(b);\\n\\t\\t\\t\\tc += instance.getCost(b);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcost = c;\\n\\t}\",\n \"public double getCost() {\\n\\t\\treturn 1.25;\\n\\t}\",\n \"@Override\\n\\tpublic double cost() {\\n\\t\\treturn Double.parseDouble(rateOfLatte);\\n\\t}\",\n \"public double cost()\\n\\t{\\n\\t\\treturn (price * weight);\\n\\t}\",\n \"@Override\\n\\tpublic int calculateCost() \\n\\t{\\n\\t\\treturn (this.modernCenterpieceCost*this.centerpieceCount);\\n\\t}\",\n \"@Test\\n\\tvoid testCost() {\\n\\t\\tint nbCores = 16;\\n\\t\\tlong duration = 2000;\\n\\t\\tDate requestDate = new Date(\\\"01/01/2000\\\");\\n\\t\\tJob j1 = new Job(nbCores,requestDate,duration,mediumQ);//16 cores less than 1h\\n\\t\\tJob j2 = new Job(nbCores*2,requestDate,duration,mediumQ);//32 cores less than 1h\\n\\t\\tJob j3 = new Job(nbCores*2+1,requestDate,duration,mediumQ);//33 cores less than 1h\\n\\t\\tJob j4 = new Job(nbCores,requestDate,duration*2,mediumQ);//16 cores more than 1h\\n\\t\\tJob j5 = new Job(nbCores*2+1,requestDate,duration*2,mediumQ);//33 cores more than 1h\\n\\t\\tassertEquals(j1.getCost(),0.05f);\\n\\t\\tassertEquals(j2.getCost(),0.05f);\\n\\t\\tassertEquals(j3.getCost(),0.1f);\\n\\t\\tassertEquals(j4.getCost(),0.1f);\\n\\t\\tassertEquals(j5.getCost(),0.2f);\\n\\t}\",\n \"public double getCost() {\\n\\t\\treturn costOverride > 0 ? costOverride : getDefaultCost();\\n\\t}\",\n \"private double calcCost(Cloudlet cloudlet, FogDevice fogDevice) {\\n double cost = 0;\\n //cost includes the processing cost\\n cost += fogDevice.getCharacteristics().getCostPerSecond() * cloudlet.getCloudletLength( ) / fogDevice.getHost().getTotalMips();\\n // cost includes the memory cost\\n cost += fogDevice.getCharacteristics().getCostPerMem() * cloudlet.getMemRequired();\\n // cost includes the bandwidth cost\\n cost += fogDevice.getCharacteristics().getCostPerBw() * (cloudlet.getCloudletFileSize() + cloudlet.getCloudletOutputSize());\\n return cost;\\n }\",\n \"protected void setCost(double cost) \\r\\n\\t{\\tthis.cost = cost;\\t}\",\n \"Integer cost(PathFindingNode node, PathFindingNode neighbour);\",\n \"UnsignedLong cost(EigrpMetricVersion version);\",\n \"public double calculateCostExclusive() {\\n\\t\\tdouble accumulatedCost = 0;\\n\\t\\tfor(int i = 0; i < solutionLength - 1; i++) {\\n\\t\\t\\taccumulatedCost += calculateEuclideanDistance(solutionRepresentation.get(i), solutionRepresentation.get(i + 1));\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn accumulatedCost;\\n\\t}\",\n \"public double getCost(ReadOnlyProperty<Double> linkCost){\\r\\n\\t\\tdouble travelCost = 0;\\r\\n\\t\\tfor(int l: getLinks()){\\r\\n\\t\\t\\ttravelCost += getLinkProbability(l) * linkCost.get(l);\\r\\n\\t\\t}\\r\\n\\t\\treturn travelCost;\\r\\n\\t}\",\n \"public double cost()\\n\\t{\\n\\t\\treturn _dblCost;\\n\\t}\",\n \"public double getCost()\\r\\n\\t{\\treturn this.cost;\\t}\",\n \"private void calculateCosts() {\\r\\n lb_CubicSum.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_Volume)) + \\\" €\\\");\\r\\n lb_MaterialCostSum.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_Price)) + \\\" €\\\");\\r\\n lb_CuttingTimeSum.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_CuttingHours)) + \\\" €\\\");\\r\\n lb_CuttingCostSum.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_CuttingPrice)) + \\\" €\\\");\\r\\n lb_TotalCosts.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_CuttingPrice) + getColmunSum(tc_Price)) + \\\" €\\\");\\r\\n\\r\\n ModifyController.getInstance().setProject_constructionmaterialList(Boolean.TRUE);\\r\\n }\",\n \"@Override\\n public int getCost() {\\n\\treturn 0;\\n }\",\n \"@Override\\r\\n\\tpublic double getCost() {\\r\\n\\t\\tdouble total = 0;\\r\\n\\t\\t\\r\\n\\t\\tfor(Product p: parts) {\\r\\n\\t\\t\\ttotal += p.getCost();\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\treturn total;\\r\\n\\t}\",\n \"public double getCost(){\\n return cost;\\n }\",\n \"public double calculatingCostO(int quantity)\\n { \\n cost = 750 + (0.25 * quantity);\\n return cost;\\n \\n }\",\n \"float getCostScale();\",\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 \"private CostHelper() {}\",\n \"private double costOf(int w) {\\n\\t\\treturn getVertex(w).getCost();\\n\\t}\",\n \"public double getCost() {\\r\\n return cost;\\r\\n }\",\n \"double calculateCost() {\\n double cost = 0;\\n InspectionDTO[] DTOArray = this.currentInspectionChecklist.inspectionDTOArray;\\n for (int i = 0; i <= DTOArray.length - 1; i++) {\\n cost += DTOArray[i].getCost();\\n }\\n return cost;\\n }\",\n \"public double getCost(Triple triple1, Triple triple2) {\\n\\t\\tdouble p1 = 0d;\\n\\t\\tdouble p2 = 0d;\\n\\n\\t\\tif (gsh == null) {\\n\\t\\t\\tp1 = vcp.getCost(triple1);\\n\\t\\t\\tp2 = vcp.getCost(triple2);\\n\\t\\t} else {\\n\\t\\t\\tp1 = gsh.getCost(triple1);\\n\\t\\t\\tp2 = gsh.getCost(triple2);\\n\\t\\t}\\n\\n\\t\\tif (p1 < p2)\\n\\t\\t\\treturn p1 + vcp.getCost(triple1, triple2);\\n\\n\\t\\treturn p2 + vcp.getCost(triple1, triple2);\\n\\t}\",\n \"int getResourceCost();\",\n \"public int act1Cost()\\r\\n {\\r\\n return 1;\\r\\n }\",\n \"public double calculateCost() {\\n double output = price * (1 + taxRate);\\n return output;\\n }\",\n \"public abstract double costPerMin (CallZone zone);\",\n \"public void setCost(double cost) {\\r\\n this.cost = cost;\\r\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7462457","0.7462457","0.74439496","0.7387476","0.7303156","0.72468615","0.71599704","0.7149586","0.7143792","0.7137188","0.7122418","0.7108507","0.69901913","0.69898605","0.6981662","0.6961411","0.6931223","0.6928458","0.68991","0.6893234","0.68571216","0.68571216","0.68571216","0.68555707","0.6841677","0.6821021","0.6803407","0.67887664","0.67425734","0.67317355","0.67301255","0.6706157","0.66855335","0.66855335","0.66855335","0.66657305","0.6646922","0.6643531","0.6641494","0.6620587","0.66084737","0.65640265","0.65503764","0.65467733","0.6537683","0.6532823","0.6528202","0.65262455","0.6506593","0.6501796","0.64955163","0.6490547","0.64861965","0.64750934","0.64721376","0.64516115","0.6439283","0.6432171","0.64309245","0.64186263","0.64178735","0.6415092","0.64124954","0.6408303","0.63989836","0.6396176","0.6395768","0.6395337","0.638542","0.6373475","0.63673514","0.6365565","0.63630086","0.6350745","0.6346749","0.6319697","0.631257","0.63120335","0.63105404","0.629094","0.62842226","0.62819993","0.62811065","0.627399","0.6271568","0.6260618","0.624835","0.6243317","0.62398565","0.62378067","0.62359107","0.6235378","0.62353","0.62280977","0.6223122","0.62197894","0.62180746","0.620953","0.61936414","0.6191547","0.618825"],"string":"[\n \"0.7462457\",\n \"0.7462457\",\n \"0.74439496\",\n \"0.7387476\",\n \"0.7303156\",\n \"0.72468615\",\n \"0.71599704\",\n \"0.7149586\",\n \"0.7143792\",\n \"0.7137188\",\n \"0.7122418\",\n \"0.7108507\",\n \"0.69901913\",\n \"0.69898605\",\n \"0.6981662\",\n \"0.6961411\",\n \"0.6931223\",\n \"0.6928458\",\n \"0.68991\",\n \"0.6893234\",\n \"0.68571216\",\n \"0.68571216\",\n \"0.68571216\",\n \"0.68555707\",\n \"0.6841677\",\n \"0.6821021\",\n \"0.6803407\",\n \"0.67887664\",\n \"0.67425734\",\n \"0.67317355\",\n \"0.67301255\",\n \"0.6706157\",\n \"0.66855335\",\n \"0.66855335\",\n \"0.66855335\",\n \"0.66657305\",\n \"0.6646922\",\n \"0.6643531\",\n \"0.6641494\",\n \"0.6620587\",\n \"0.66084737\",\n \"0.65640265\",\n \"0.65503764\",\n \"0.65467733\",\n \"0.6537683\",\n \"0.6532823\",\n \"0.6528202\",\n \"0.65262455\",\n \"0.6506593\",\n \"0.6501796\",\n \"0.64955163\",\n \"0.6490547\",\n \"0.64861965\",\n \"0.64750934\",\n \"0.64721376\",\n \"0.64516115\",\n \"0.6439283\",\n \"0.6432171\",\n \"0.64309245\",\n \"0.64186263\",\n \"0.64178735\",\n \"0.6415092\",\n \"0.64124954\",\n \"0.6408303\",\n \"0.63989836\",\n \"0.6396176\",\n \"0.6395768\",\n \"0.6395337\",\n \"0.638542\",\n \"0.6373475\",\n \"0.63673514\",\n \"0.6365565\",\n \"0.63630086\",\n \"0.6350745\",\n \"0.6346749\",\n \"0.6319697\",\n \"0.631257\",\n \"0.63120335\",\n \"0.63105404\",\n \"0.629094\",\n \"0.62842226\",\n \"0.62819993\",\n \"0.62811065\",\n \"0.627399\",\n \"0.6271568\",\n \"0.6260618\",\n \"0.624835\",\n \"0.6243317\",\n \"0.62398565\",\n \"0.62378067\",\n \"0.62359107\",\n \"0.6235378\",\n \"0.62353\",\n \"0.62280977\",\n \"0.6223122\",\n \"0.62197894\",\n \"0.62180746\",\n \"0.620953\",\n \"0.61936414\",\n \"0.6191547\",\n \"0.618825\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":38193,"cells":{"query":{"kind":"string","value":"this method will compute the cost based on the given parameters"},"document":{"kind":"string","value":"public String returnBoxCost(double cardGradeCost, String colourOption, String reinfBotOption, \n\t\t\tString reinfCornOption, String sealOption){\n\t\tdouble colOptPercent = 0.00;\n\t\tdouble reinfPercent = 0.00;\n\t\tdouble sealPercent = 0.00;\n\t\t\n\t\tif(colourOption.equals(\"2\")){\n\t\t\tcolOptPercent = 15.00;\n\t\t}else if(colourOption.equals(\"1\")){\n\t\t\tcolOptPercent = 12.00;\n\t\t}else{\n\t\t\tcolOptPercent = 0.00;\n\t\t}\n\t\t\n\t\tif((reinfBotOption.equals(\"true\")) && (reinfCornOption.equals(\"true\"))){\n\t\t\treinfPercent = 17.00;\n\t\t}else if((reinfBotOption.equals(\"true\")) && (reinfCornOption.equals(\"false\"))){\n\t\t\treinfPercent = 10.00;\n\t\t}else if((reinfBotOption.equals(\"false\")) && (reinfCornOption.equals(\"true\"))){\n\t\t\treinfPercent = 7.00;\n\t\t}else if((reinfBotOption.equals(\"true\")) && (reinfCornOption.equals(\"select\"))){\n\t\t\treinfPercent = 10.00;\n\t\t}else if((reinfBotOption.equals(\"select\")) && (reinfCornOption.equals(\"false\"))){\n\t\t\treinfPercent = 7.00;\n\t\t}else{\n\t\t\treinfPercent = 0.00;\n\t\t}\n\t\t\n\t\tif(sealOption.equals(\"true\")){\n\t\t\tsealPercent = 5.00;\n\t\t}else if(sealOption.equals(\"false\")){\n\t\t\tsealPercent = 0.00;\n\t\t}else{\n\t\t\tsealPercent = 0.00;\n\t\t}\n\t\t\n\t\tdouble sum = cardGradeCost+((cardGradeCost*colOptPercent)/100) + ((cardGradeCost*reinfPercent)/100)\n\t\t\t\t+ ((cardGradeCost*sealPercent)/100); \n\t\n\t\tDecimalFormat df = new DecimalFormat(\"##.##\");\t\n\t\treturn df.format(sum);\n\t}"},"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":["double getCost();","double getCost();","public void calculateCost()\n\t{\n\t\tLogManager lgmngr = LogManager.getLogManager(); \n\t\tLogger log = lgmngr.getLogger(Logger.GLOBAL_LOGGER_NAME);\n\t\tString s = \"\";\n\t\tint costperfeet = 0;\n\t\tif (this.materialStandard.equals(\"standard materials\") && this.fullyAutomated == false)\n\t\t\tcostperfeet = 1200;\n\t\telse if (this.materialStandard.equals(\"above standard materials\") && this.fullyAutomated == false)\n\t\t\tcostperfeet = 1500;\n\t\telse if(this.materialStandard.equals(\"high standard materials\") && this.fullyAutomated == false)\n\t\t\tcostperfeet = 1800;\n\t\telse if (this.materialStandard.equals(\"high standard materials\") && this.fullyAutomated == true)\n\t\t\tcostperfeet = 2500;\n\t\t\n\t\tint totalCost = costperfeet * this.totalArea;\n\t\t/*s = \"Total Cost of Construction is :- \";\n\t\twriter.printf(\"%s\" + totalCost, s);\n\t\twriter.flush();*/\n\t\tlog.log(Level.INFO, \"Total Cost of Construction is :- \" + totalCost);\n\t}","double getSolutionCost();","@Override\r\n\tprotected void processCost() {\n\r\n\t}","double getTotalCost();","public void compute(){\r\n\r\n\t\ttotalCost=(capAmount*CAPCOST)+(hoodyAmount*HOODYCOST)+(shirtAmount*SHIRTCOST);\r\n\t}","public abstract double getCost();","public void generateCost() throws StandardException {\n\n double baseTableSelectivity = computePhaseSelectivity(selectivityHolder,QualifierPhase.BASE);\n double filterBaseTableSelectivity = computePhaseSelectivity(selectivityHolder,QualifierPhase.BASE,QualifierPhase.FILTER_BASE);\n double projectionSelectivity = computePhaseSelectivity(selectivityHolder,QualifierPhase.FILTER_PROJECTION);\n double totalSelectivity = computeTotalSelectivity(selectivityHolder);\n\n assert filterBaseTableSelectivity >= 0 && filterBaseTableSelectivity <= 1.0:\"filterBaseTableSelectivity Out of Bounds -> \" + filterBaseTableSelectivity;\n assert baseTableSelectivity >= 0 && baseTableSelectivity <= 1.0:\"baseTableSelectivity Out of Bounds -> \" + baseTableSelectivity;\n assert projectionSelectivity >= 0 && projectionSelectivity <= 1.0:\"projectionSelectivity Out of Bounds -> \" + projectionSelectivity;\n assert totalSelectivity >= 0 && totalSelectivity <= 1.0:\"totalSelectivity Out of Bounds -> \" + totalSelectivity;\n\n // Total Row Count from the Base Conglomerate\n double totalRowCount = scc.baseRowCount();\n assert totalRowCount >= 0 : \"totalRowCount cannot be negative -> \" + totalRowCount;\n // Rows Returned is always the totalSelectivity (Conglomerate Independent)\n scanCost.setEstimatedRowCount(Math.round(totalRowCount*totalSelectivity));\n\n double baseTableAverageRowWidth = scc.getBaseTableAvgRowWidth();\n double baseTableColumnSizeFactor = scc.baseTableColumnSizeFactor(totalColumns);\n\n // We use the base table so the estimated heap size and remote cost are the same for all conglomerates\n double colSizeFactor = baseTableAverageRowWidth*baseTableColumnSizeFactor;\n assert baseTableAverageRowWidth >= 0 : \"baseTableAverageRowWidth cannot be negative -> \" + baseTableAverageRowWidth;\n assert baseTableColumnSizeFactor >= 0 : \"baseTableColumnSizeFactor cannot be negative -> \" + baseTableColumnSizeFactor;\n\n double openLatency = scc.getOpenLatency();\n double closeLatency = scc.getCloseLatency();\n double localLatency = scc.getLocalLatency();\n double remoteLatency = scc.getRemoteLatency();\n double remoteCost = openLatency + closeLatency + totalRowCount*totalSelectivity*remoteLatency*(1+colSizeFactor/100d);\n assert openLatency >= 0 : \"openLatency cannot be negative -> \" + openLatency;\n assert closeLatency >= 0 : \"closeLatency cannot be negative -> \" + closeLatency;\n assert localLatency >= 0 : \"localLatency cannot be negative -> \" + localLatency;\n assert remoteLatency >= 0 : \"remoteLatency cannot be negative -> \" + remoteLatency;\n assert remoteCost >= 0 : \"remoteCost cannot be negative -> \" + remoteCost;\n // Heap Size is the avg row width of the columns for the base table*total rows\n // Average Row Width\n // This should be the same for every conglomerate path\n scanCost.setEstimatedHeapSize((long)(totalRowCount*totalSelectivity*colSizeFactor));\n // Should be the same for each conglomerate\n scanCost.setRemoteCost((long)remoteCost);\n // Base Cost + LookupCost + Projection Cost\n double congAverageWidth = scc.getConglomerateAvgRowWidth();\n double baseCost = openLatency+closeLatency+(totalRowCount*baseTableSelectivity*localLatency*(1+congAverageWidth/100d));\n assert congAverageWidth >= 0 : \"congAverageWidth cannot be negative -> \" + congAverageWidth;\n assert baseCost >= 0 : \"baseCost cannot be negative -> \" + baseCost;\n scanCost.setFromBaseTableRows(filterBaseTableSelectivity * totalRowCount);\n scanCost.setFromBaseTableCost(baseCost);\n double lookupCost;\n if (lookupColumns == null)\n lookupCost = 0.0d;\n else {\n lookupCost = totalRowCount*filterBaseTableSelectivity*(openLatency+closeLatency);\n scanCost.setIndexLookupRows(filterBaseTableSelectivity*totalRowCount);\n scanCost.setIndexLookupCost(lookupCost+baseCost);\n }\n assert lookupCost >= 0 : \"lookupCost cannot be negative -> \" + lookupCost;\n\n double projectionCost;\n if (projectionSelectivity == 1.0d)\n projectionCost = 0.0d;\n else {\n projectionCost = totalRowCount * filterBaseTableSelectivity * localLatency * colSizeFactor*1d/1000d;\n scanCost.setProjectionRows(scanCost.getEstimatedRowCount());\n scanCost.setProjectionCost(lookupCost+baseCost+projectionCost);\n }\n assert projectionCost >= 0 : \"projectionCost cannot be negative -> \" + projectionCost;\n\n double localCost = baseCost+lookupCost+projectionCost;\n assert localCost >= 0 : \"localCost cannot be negative -> \" + localCost;\n scanCost.setLocalCost(localCost);\n scanCost.setNumPartitions(scc.getNumPartitions());\n scanCost.setLocalCostPerPartition((baseCost + lookupCost + projectionCost)/scc.getNumPartitions());\n }","public void calculateCost() {\n\t\tthis.cost = 0.0;\n\t\t\n\t\tint i, count = this.cities.size()-1;\n\t\tfor (i = 0; i < count; i++)\n\t\t\tthis.cost += this.cities.get(i).distances[this.cities.get(i+1).index];\n\n\t\tthis.cost += this.cities.get(count).distances[this.cities.get(0).index];\n\t}","float getCostReduction();","double ComputeCost(double order, double tipPercent, double serviceRating, double foodRating)\r\n {\r\n // kazda gwiazdka to 2 procent od sumy zamówienia\r\n return order + order * (tipPercent/100) + (serviceRating * 0.02) * order + (foodRating * 0.02) * order;\r\n }","@Override\n\tpublic double cost() {\n\t\tdouble price = good.cost();\n\t\treturn price+price/2;\n\t}","private double calcuFcost() {\n\t\treturn num * configMap.get('r') + (num-1) * configMap.get('l') + num * configMap.get('f') + configMap.get('t');\n\t}","public abstract float getEstimatedCost(AStarNode paramAStarNode);","public abstract float getCost(AStarNode paramAStarNode);","public float getCost()\r\n/* 13: */ {\r\n/* 14:10 */ return this.costFromStart + this.estimatedCostToGoal;\r\n/* 15: */ }","protected abstract double getDefaultCost();","int getCost();","int getCost();","int getCost();","@Override\n\tvoid get_cost_per_sqarefeet() {\n\t\tcost=1800;\n\t}","@Override\n\tpublic double cost() {\n\t\treturn 10000;\n\t}","@Pure\n\tdouble getCost();","public double calculateCost(Purchase purchase);","protected double getCost(double[] n) throws Exception {\n\t\tdouble[] da = this.outputDifferences(n);\n\t\tdouble o = 0;\n\t\tfor (double d : da) o += d*d;\n\t\treturn o;\n\t}","@Override\n public double calcCost() {\n return calcSalesFee()+calcTaxes();\n }","public double costNEX() {\r\n double diff=0;\r\n double intensity=0;\r\n \r\n for(int x=Config.ptvXLow-0; x < Config.ptvXHigh+0; x++) {\r\n// for(int x=Solver.xBoundsTumor[0]; x < Solver.xBoundsTumor[1]; x+= Config.scaleFactor) {\r\n for(int y=Config.ptvYLow-0; y < Config.ptvYHigh+0; y++) {\r\n// for(int y=Solver.yBoundsTumor[0]; y < Solver.yBoundsTumor[1]; y+= Config.scaleFactor) {\r\n for(int z=Config.ptvZLow-0; z < Config.ptvZHigh+0; z++) {\r\n// for(int z=Solver.zBoundsTumor[0]; z < Solver.zBoundsTumor[1]; z+= Config.scaleFactor) {\r\n\r\n this.body2[x][y][z].setCurrentDosis(0.0); //Set currentPtvVoxel Dose to 0 \r\n for(int i=0; i<Config.numberOfSeeds;++i) { \r\n // Calculate intensity based based on current dwelltime\r\n intensity = this.body2[x][y][z].radiationIntensity(this.seeds2[i].getCoordinate(), New_state[i]);\r\n if (intensity>0) {\r\n// LogTool.print(\"Cost: Intensity :\" + intensity + \"@ \" + x + \" \" + y + \" \" + z,\"notification\");\r\n }\r\n this.body2[x][y][z].addCurrentDosis(intensity);\r\n } \r\n diff += Math.pow((this.body2[x][y][z].getGoalDosis()-this.body2[x][y][z].getCurrentDosis()),2);\r\n// LogTool.print(\" diffdose \" + (Looper.body2[x][y][z].getGoalDosis()-Looper.body2[x][y][z].getCurrentDosis()),\"notification\");\r\n } \r\n }\r\n }\r\n return Math.sqrt(diff);\r\n// return Math.random();\r\n }","@Override\n\tpublic double cost() {\n\t\treturn 2.19;\n\t}","double setCost(double cost);","public void calculateCost(){\n if(this.isChair){\n for(int i = 0; i < this.chairs.length; i++){\n this.cost += this.chairs[i].getPrice();\n }\n }\n //if furniture type is chair, add up cost of all items in list\n if(this.isDesk){\n for(int i = 0; i < this.desks.length; i++){\n this.cost += this.desks[i].getPrice();\n }\n }\n //if furniture type is chair, add up cost of all items in list\n if(this.isFiling){\n for(int i = 0; i < this.filingCabinets.length; i++){\n this.cost += this.filingCabinets[i].getPrice();\n }\n }\n //if furniture type is chair, add up cost of all items in list\n if(this.isLamp){\n for(int i = 0; i < this.lamps.length; i++){\n this.cost += this.lamps[i].getPrice();\n }\n }\n }","double setEstimatedCost(double cost);","@Override\n\tpublic double cost() {\n\t\treturn water.cost()+10;\n\t}","public void calculateOrderCost(){\n int tmpCost=0;\n for (Vehicle v : vehicleList){\n tmpCost+=v.getCost();\n }\n totalCost=tmpCost;\n }","@Override\n public double cost()\n {\n return this.price * this.number;\n }","@Override\r\n\tpublic int cost() {\n\t\treturn b1.cost() + 1;\r\n\t}","@Override\r\n\tpublic void addToCost() {\n\t\t\r\n\t}","public abstract int getCost();","public abstract int getCost();","public abstract int getCost();","public double calcCost(){\n double cost = 0;\n cost += pMap.get(size);\n cost += cMap.get(crust);\n //Toppings are priced at 3.00 for 3-4 topppings, and 4.0 for 5+ toppings\n \n if(toppings !=null)\n {\n if((toppings.length == 3) || (toppings.length == 4)){\n cost += 3.0;\n }\n if (toppings.length > 4){\n cost += 4.0;\n }\n }\n \n return cost;\n }","public static double Cost(double boxes, double Cost) {\n\tdouble pay = boxes * Cost;\n\treturn pay;\n}","@Override\n public double getCost() {\n return cost;\n }","public double getCost() {\r\n\t \treturn(cost);\r\n\t}","@Override\r\n\tprotected void processCost() throws SGSException {\n\r\n\t}","public double cost()\n\t{\n\t\treturn (price * weight);\n\t}","@Pure\n\tdouble getEstimatedCost();","public void calculateCost() {\n \tdouble costToShipPack;\n \tint numOfPacks = 1;\n \t\n \tfor(Package p: this.packages) {\n \t\tcostToShipPack = 3 + (p.calcVolume() - 1);\n \t\tthis.totalAmounts.put(\"Package \"+numOfPacks, costToShipPack);\n \t\tnumOfPacks++;\n \t}\n \t\n }","public void calculateCost(AStarNode parentNode, AStarNode endNode)\n \t{\n \t\tthis.costFromStart = parentNode.getCostFromStart() + node.getCost();\n \t\tthis.heuristic = ModelUtils.INSTANCE.getDistance(this.getPosition(), endNode.getPosition());\n \t\tthis.totalCost = this.costFromStart + this.heuristic;\n \t\tthis.parent = parentNode;\n \t}","private double calcuCMetric() {\n\t\treturn (p-1)/fcost;\n\t}","public double getCost() {\t\t \n\t\treturn cost;\n\t}","@Override\r\n\tpublic double cost() {\n\t\treturn this.cost;\r\n\t}","private double costOf(int w) {\n\t\treturn getVertex(w).getCost();\n\t}","public double getCost()\n\t{\n\t\treturn 0.9;\n\t}","@Override\n public double getCost() {\n\t return 13;\n }","@Override\n\tpublic double getCost() {\n\t\treturn price * weight; // cost = price of the candy * weight of candies\n\t}","public double sCost(Model m, Value stats, Value params) throws LearnerException {\n return -m.logPSufficient(stats,params);\n }","@Override\r\n\tpublic double getCost() {\r\n\t\tdouble total = 0;\r\n\t\t\r\n\t\tfor(Product p: parts) {\r\n\t\t\ttotal += p.getCost();\r\n\t\t}\r\n\t\t\r\n\t\treturn total;\r\n\t}","public double calcCost() {\n // $2 per topping.\n double cost = 2 * (this.cheese + this.pepperoni + this.ham);\n // size cost\n switch (this.size) {\n case \"small\":\n cost += 10;\n break;\n case \"medium\":\n cost += 12;\n break;\n case \"large\":\n cost += 14;\n break;\n default:\n }\n return cost;\n }","private void calculateCosts() {\r\n lb_CubicSum.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_Volume)) + \" €\");\r\n lb_MaterialCostSum.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_Price)) + \" €\");\r\n lb_CuttingTimeSum.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_CuttingHours)) + \" €\");\r\n lb_CuttingCostSum.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_CuttingPrice)) + \" €\");\r\n lb_TotalCosts.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_CuttingPrice) + getColmunSum(tc_Price)) + \" €\");\r\n\r\n ModifyController.getInstance().setProject_constructionmaterialList(Boolean.TRUE);\r\n }","Integer cost(PathFindingNode node, PathFindingNode neighbour);","@Override\n\tprotected void setCost(double cst) {\n\t\t\n\t}","public double getCosts();","UnsignedLong cost(EigrpMetricVersion version);","private double calcCost(Cloudlet cloudlet, FogDevice fogDevice) {\n double cost = 0;\n //cost includes the processing cost\n cost += fogDevice.getCharacteristics().getCostPerSecond() * cloudlet.getCloudletLength( ) / fogDevice.getHost().getTotalMips();\n // cost includes the memory cost\n cost += fogDevice.getCharacteristics().getCostPerMem() * cloudlet.getMemRequired();\n // cost includes the bandwidth cost\n cost += fogDevice.getCharacteristics().getCostPerBw() * (cloudlet.getCloudletFileSize() + cloudlet.getCloudletOutputSize());\n return cost;\n }","@Override\n public double cost(){\n return 1 + super.sandwich.cost();\n }","private double computeCost(Link link, boolean ignorePenalties) {\n \t\tdouble result = link.getLength() / (link.getMaxSpeed_r() / 3.6);\r\n \t\tif (ignorePenalties)\r\n \t\t\treturn result;\r\n \t\tDouble penalty = penalties.get(link);\r\n \t\tif (null != penalty)\r\n \t\t\tresult *= (1 + penalty);\r\n \t\treturn result;\r\n \t}","void setCost(double cost);","@Override\n public long cost() {\n return 100;\n }","public int getCost(Tile<T> n1, Tile<T> n2);","public Tuple optimize (Tuple theta) {\n\t\t\n\t\t// obtain the dimensionality\n\t\tdimensionality = theta.GetDimension();\n\t\t\n\t\t// check that dimensionality matches with feature dimensions\n\t\t// TODO\n\t\t\n\t\t// scaling constant k = (alpha / m);\n\t\tdouble c = alpha / members;\n\t\t\n\t\t// Start calculating for each theta\n\t\tTuple new_theta = new Tuple(dimensionality);\n\t\t\n\t\t// Below loop of 'j' will iterate over each parameter\n\t\tfor (int j = 0; j < dimensionality; j++) {\n\n\t\t\tdouble weighted_error = 0;\n\t\t\t\n\t\t\t// Below loop of 'i' will iterate over each data points of given training set \n\t\t\tfor (int i = 0; i < members; i++) {\n\t\t\t\tTuple ithFeatureSet = dv.GetFeatureTuple(i);\n\t\t\t\tTuple ithResponse = dv.GetResponse(i);\n\t\t\t\t\n\t\t\t\tdouble hypo = 0;\n\t\t\t\tfor (int k = 0; k < dimensionality; k++)\n\t\t\t\t\thypo += ithFeatureSet.get(k) * theta.get(k);\n\t\t\t\tdouble error = ( hypo - ithResponse.get(0) );\n\t\t\t\tweighted_error += error * ithFeatureSet.get(j);\t\n\t\t\t\tcurrentCost += error * error;\n\t\t\t\t\n\t\t\t\t// TODO LOGGING\n\t\t\t\t// System.out.println(\"[\" + j + \", \" + i + \"] For Theta(\" + j + \"), Row = \" + i + \", Feature: \" + ithFeatureSet + \", Theta: \" + theta + \", Response: \" + ithResponse + \", hypo = \" + hypo + \", err = \" + error + \", weighted_err = \" + weighted_error);\n\t\t\t\t// System.out.println(\"theta = \" + j + \", row = \" + i + \", hypo = \" + hypo + \", error = \" + error + \", weighted err = \" + weighted_error);\n\t\t\t} // end of 'i'\n\t\t\t\n\t\t\tdouble adjustment = c * weighted_error;\n\t\t\tcurrentCost = currentCost / (2 * members);\n\t\t\t\n\t\t\t// TODO LOGGING\n\t\t\t// System.out.println(\"alpha = \" + alpha + \", m = \" + members + \", c = \" + c + \", weighted_err = \" + weighted_error + \", adj = \" + adjustment);\n\t\t\t\n\t\t\tnew_theta.add(theta.get(j) - adjustment );\n\t\t} // end of 'j'\n\t\t\n\t\treturn new_theta;\n\t}","private double newCost(int v, int w) {\n\t\treturn 0.0;\n\t}","@Override\n\tpublic int cost() {\n\t\treturn 5000;\n\t}","public void setCost(double cost){\n this.cost = cost;\n }","@Override\n\tpublic double cost() {\n\t\treturn Double.parseDouble(rateOfLatte);\n\t}","@Override\n\tprotected void computeWithoutTime() {\n\t\tinitShortestPaths();\n\n\t\t// Then we sort for each node v the list of terminals by the distance from v\n\t\tsortedRequiredVertices = new HashMap<Integer, TreeSet<Integer>>();\n\t\tsortRequiredVertices();\n\t\t\n\t\t// Copy of the terminals\n\t\tHashSet<Integer> req = new HashSet<Integer>(\n\t\t\t\tinstance.getRequiredVertices());\n\n\t\t// Union of all the solutions returned by the subalgorithm CH2\n\t\tHashSet<Arc> currentSol = new HashSet<Arc>();\n\n\t\t// Until all terminals are reached\n\t\twhile (req.size() > 0) {\n\n\t\t\t// We apply CH2 to reach some of the non reached terminals\n\t\t\tCouple<HashSet<Arc>, HashSet<Integer>> tree = applyCH2(req);\n\n\t\t\t// tree.first the tree returned by CH2\n\t\t\t// tree.second is the terminals of that tree\n\n\t\t\tcurrentSol.addAll(tree.first);\n\t\t\tfor (Arc a : tree.first)\n\t\t\t\tcosts.put(a, 0); // Set the cost of the arc to 0, as this arc is already used in the solution, it does not cost anything to use it again.\n\t\t\treq.removeAll(tree.second);\n\t\t}\n\n\t\t// Compute the returned solution and its cost.\n\t\tarborescence = new HashSet<Arc>();\n\t\tint c = 0;\n\t\tfor (Arc a : currentSol) {\n\t\t\tList<Arc> l = shortestPaths.get(a);\n\t\t\tif (a.getInput().equals(a.getOutput()))\n\t\t\t\tl = new ArrayList<Arc>();\n\t\t\tfor (Arc b : l) {\n\t\t\t\tarborescence.add(b);\n\t\t\t\tc += instance.getCost(b);\n\t\t\t}\n\t\t}\n\t\tcost = c;\n\t}","public double getTotalCost() {\n cost = spr.calculateCost();\n return cost;\n }","public double getCost(){\n return cost;\n }","@Override\n protected double calcTotalCost() {\n \n double totalCost, templateBasicRate = DEFAULT_BASIC_RATE;\n double extraBedrooms = 0, extraBathrooms = 0;\n\n // if there are extra beds/baths\n if (this.getNumBedrooms() > DEFAULT_NUM_BEDROOMS)\n extraBedrooms = this.getNumBedrooms() - DEFAULT_NUM_BEDROOMS;\n\n if (this.getNumBathrooms() > DEFAULT_NUM_BATHROOMS)\n extraBathrooms = this.getNumBathrooms() - DEFAULT_NUM_BATHROOMS;\n\n // multiply basic rate by 1.5 if the total area is >= 3,000 sq ft\n if (this.getTotalArea() >= 3000)\n templateBasicRate *= 1.5;\n\n // calculate total cost\n totalCost = (templateBasicRate + ((800 * extraBedrooms) + (500 * extraBathrooms)));\n\n // add tax\n totalCost += (TAX * totalCost);\n\n return totalCost;\n }","float estimateCostToGoal( int current_x, int current_y, int current_z, boolean fromStart ) {\n\t\treturn 0;\n\t}","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 double getCost()\r\n\t{\treturn this.cost;\t}","public CalculateJobCosts() {\n\t\t//sc = new SimpleConnection();\n\t\t//conn = sc.getConnection();\n\t}","public void calculaMatrizCostes() {\n int i, j;\n double xd, yd;\n costes = new int[n][n];\n for (i = 0; i < n; i++) {\n for (j = 0; j < n; j++) {\n xd = vx[i] - vx[j];\n yd = vy[i] - vy[j];\n costes[i][j] = (int) Math.round(Math.sqrt((xd * xd) + (yd * yd)));\n }\n }\n }","@Override\r\n public int getCost() {\r\n return cost;\r\n }","public double getCost() {\r\n return cost;\r\n }","public double cost()\n\t{\n\t\treturn _dblCost;\n\t}","public double getCost(Triple triple1, Triple triple2) {\n\t\tdouble p1 = 0d;\n\t\tdouble p2 = 0d;\n\n\t\tif (gsh == null) {\n\t\t\tp1 = vcp.getCost(triple1);\n\t\t\tp2 = vcp.getCost(triple2);\n\t\t} else {\n\t\t\tp1 = gsh.getCost(triple1);\n\t\t\tp2 = gsh.getCost(triple2);\n\t\t}\n\n\t\tif (p1 < p2)\n\t\t\treturn p1 + vcp.getCost(triple1, triple2);\n\n\t\treturn p2 + vcp.getCost(triple1, triple2);\n\t}","@Test\n\tvoid testCost() {\n\t\tint nbCores = 16;\n\t\tlong duration = 2000;\n\t\tDate requestDate = new Date(\"01/01/2000\");\n\t\tJob j1 = new Job(nbCores,requestDate,duration,mediumQ);//16 cores less than 1h\n\t\tJob j2 = new Job(nbCores*2,requestDate,duration,mediumQ);//32 cores less than 1h\n\t\tJob j3 = new Job(nbCores*2+1,requestDate,duration,mediumQ);//33 cores less than 1h\n\t\tJob j4 = new Job(nbCores,requestDate,duration*2,mediumQ);//16 cores more than 1h\n\t\tJob j5 = new Job(nbCores*2+1,requestDate,duration*2,mediumQ);//33 cores more than 1h\n\t\tassertEquals(j1.getCost(),0.05f);\n\t\tassertEquals(j2.getCost(),0.05f);\n\t\tassertEquals(j3.getCost(),0.1f);\n\t\tassertEquals(j4.getCost(),0.1f);\n\t\tassertEquals(j5.getCost(),0.2f);\n\t}","public double evalCost(int[] assig)\r\n {\r\n /** Indicates if each depot is open */\r\n BOFLP BFLProblem = BOFLP.instance();\r\n\r\n boolean[] openDepots;\r\n\r\n int nClients = BFLProblem.nClients;\r\n int nDepots = BFLProblem.nDepots;\r\n\r\n openDepots = new boolean[nDepots + 1];\r\n\r\n double cost;\r\n\r\n for (int j = 1; j <= nDepots; j++)\r\n {\r\n openDepots[j] = false;\r\n }\r\n cost = 0;\r\n for (int i = 1; i <= nClients; i++)\r\n {\r\n int depot = assig[i - 1];\r\n cost = cost + BFLProblem.cost[i][depot];\r\n openDepots[depot] = true;\r\n }\r\n for (int j = 1; j <= nDepots; j++)\r\n {\r\n if (openDepots[j])\r\n cost = cost + BFLProblem.fixedCost[j];\r\n }\r\n return cost;\r\n }","@Override\r\n\tpublic double getCost() {\n\t\treturn 0;\r\n\t}","public double getCost() {\n\t\treturn 1.25;\n\t}","int getResourceCost();","@Override\n\tpublic int calculateCost() \n\t{\n\t\treturn (this.modernCenterpieceCost*this.centerpieceCount);\n\t}","public double calcCost() {\n if (pizzaSize.equals(\"small\")) {\n return 10.0 + ((cheeseToppings + pepperoniToppings + veggieToppings) * 2);\n\n }\n else if (pizzaSize.equals(\"medium\")) {\n return 12.0 + ((cheeseToppings + pepperoniToppings + veggieToppings) * 2);\n }\n else {\n return 14.0 + ((cheeseToppings + pepperoniToppings + veggieToppings) * 2);\n }\n }","public float getCost(Node n){\n char t1 = this.type;\n char t2 = n.getType();\n int row1 = this.row;\n int col1 = this.col;\n int row2 = n.getRow();\n int col2 = n.getCol();\n boolean straight;\n\n if(row1 == row2 || col1 == col2)\n straight = true;\n else\n straight = false;\n\n if(straight){\n switch (t1){\n case '1':\n switch (t2){\n case '1':\n return 1;\n case '2':\n return (float)1.5;\n case 'a':\n return 1;\n case 'b':\n return (float)1.5;\n }\n break;\n case '2':\n switch (t2){\n case '1':\n return (float)1.5;\n case '2':\n return 2;\n case 'a':\n return (float)1.5;\n case 'b':\n return 2;\n }\n break;\n case 'a':\n switch (t2){\n case '1':\n return 1;\n case '2':\n return (float)1.5;\n case 'a':\n return (float).25;\n case 'b':\n return (float).375;\n }\n break;\n case 'b':\n switch (t2){\n case '1':\n return (float)1.5;\n case '2':\n return 2;\n case 'a':\n return (float).375;\n case 'b':\n return (float).25;\n }\n break;\n }\n } else{\n switch(t1){\n case '1':\n switch (t2){\n case 'a':\n case '1':\n return (float)Math.sqrt(2);\n case '2':\n case 'b':\n return (float)((Math.sqrt(2)+Math.sqrt(8))/2);\n }\n break;\n case '2':\n switch (t2){\n case 'a':\n case '1':\n return (float)((Math.sqrt(2)+Math.sqrt(8))/2);\n case '2':\n case 'b':\n return (float)Math.sqrt(8);\n }\n break;\n case 'a':\n switch (t2){\n case 'a':\n case '1':\n return (float)Math.sqrt(2);\n case '2':\n case 'b':\n return (float)((Math.sqrt(2)+Math.sqrt(8))/2);\n }\n break;\n case 'b':\n switch (t2){\n case 'a':\n case '1':\n return (float)((Math.sqrt(2)+Math.sqrt(8))/2);\n case '2':\n case 'b':\n return (float)Math.sqrt(8);\n }\n break;\n }\n }\n\n return 0;\n }","public double getCost() {\r\n\t\treturn cost;\r\n\t}","public abstract double cost(List<Drink> drinks, Double originalPrice, String pattern);","public double calculateCost(GridState newPoint){\n\t // Does the agent have access to weather information?\n\t return agent.danger(newPoint.getPosition());\n\t \n\t \n\t /* if(agent.hasWeatherInfo()) {\n\t\t // Check fire speed, check wind speed, calculate new fire speed, see if it is likely to spread to the state its gridpoint\n\t\t // Check if it is raining, because then it is slowing down the rain again\n\t\t return danger(newPoint);\n\t }\n\t else return 1.0;*/\n }","public double getCost(ReadOnlyProperty<Double> linkCost){\r\n\t\tdouble travelCost = 0;\r\n\t\tfor(int l: getLinks()){\r\n\t\t\ttravelCost += getLinkProbability(l) * linkCost.get(l);\r\n\t\t}\r\n\t\treturn travelCost;\r\n\t}","double treeNodeTargetFunctionValue(){\n\t\t\t//loop counter variable\n\t\t\tint i;\n\t\t\t\n\t\t\t//stores the cost\n\t\t\tdouble sum = 0.0;\n\n\t\t\tfor(i=0; i<this.n; i++){\n\t\t\t\t//stores the distance\n\t\t\t\tdouble distance = 0.0;\n\n\t\t\t\t//loop counter variable\n\t\t\t\tint l;\n\n\t\t\t\tfor(l=0;l<this.points[i].dimension;l++){\n\t\t\t\t\t//centroid coordinate of the point\n\t\t\t\t\tdouble centroidCoordinatePoint;\n\t\t\t\t\tif(this.points[i].weight != 0.0){\n\t\t\t\t\t\tcentroidCoordinatePoint = this.points[i].coordinates[l] / this.points[i].weight;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tcentroidCoordinatePoint = this.points[i].coordinates[l];\n\t\t\t\t\t}\n\t\t\t\t\t//centroid coordinate of the centre\n\t\t\t\t\tdouble centroidCoordinateCentre;\n\t\t\t\t\tif(this.centre.weight != 0.0){\n\t\t\t\t\t\tcentroidCoordinateCentre = this.centre.coordinates[l] / this.centre.weight;\n\t\t\t\t\t} else {\n\t\t\t\t\t\tcentroidCoordinateCentre = this.centre.coordinates[l];\n\t\t\t\t\t}\n\t\t\t\t\tdistance += (centroidCoordinatePoint-centroidCoordinateCentre) * \n\t\t\t\t\t\t\t(centroidCoordinatePoint-centroidCoordinateCentre) ;\n\t\t\t\t\t\t\n\t\t\t\t}\n\n\t\t\t\tsum += distance*this.points[i].weight;\t\n\t\t\t}\n\t\t\treturn sum;\n\t\t}"],"string":"[\n \"double getCost();\",\n \"double getCost();\",\n \"public void calculateCost()\\n\\t{\\n\\t\\tLogManager lgmngr = LogManager.getLogManager(); \\n\\t\\tLogger log = lgmngr.getLogger(Logger.GLOBAL_LOGGER_NAME);\\n\\t\\tString s = \\\"\\\";\\n\\t\\tint costperfeet = 0;\\n\\t\\tif (this.materialStandard.equals(\\\"standard materials\\\") && this.fullyAutomated == false)\\n\\t\\t\\tcostperfeet = 1200;\\n\\t\\telse if (this.materialStandard.equals(\\\"above standard materials\\\") && this.fullyAutomated == false)\\n\\t\\t\\tcostperfeet = 1500;\\n\\t\\telse if(this.materialStandard.equals(\\\"high standard materials\\\") && this.fullyAutomated == false)\\n\\t\\t\\tcostperfeet = 1800;\\n\\t\\telse if (this.materialStandard.equals(\\\"high standard materials\\\") && this.fullyAutomated == true)\\n\\t\\t\\tcostperfeet = 2500;\\n\\t\\t\\n\\t\\tint totalCost = costperfeet * this.totalArea;\\n\\t\\t/*s = \\\"Total Cost of Construction is :- \\\";\\n\\t\\twriter.printf(\\\"%s\\\" + totalCost, s);\\n\\t\\twriter.flush();*/\\n\\t\\tlog.log(Level.INFO, \\\"Total Cost of Construction is :- \\\" + totalCost);\\n\\t}\",\n \"double getSolutionCost();\",\n \"@Override\\r\\n\\tprotected void processCost() {\\n\\r\\n\\t}\",\n \"double getTotalCost();\",\n \"public void compute(){\\r\\n\\r\\n\\t\\ttotalCost=(capAmount*CAPCOST)+(hoodyAmount*HOODYCOST)+(shirtAmount*SHIRTCOST);\\r\\n\\t}\",\n \"public abstract double getCost();\",\n \"public void generateCost() throws StandardException {\\n\\n double baseTableSelectivity = computePhaseSelectivity(selectivityHolder,QualifierPhase.BASE);\\n double filterBaseTableSelectivity = computePhaseSelectivity(selectivityHolder,QualifierPhase.BASE,QualifierPhase.FILTER_BASE);\\n double projectionSelectivity = computePhaseSelectivity(selectivityHolder,QualifierPhase.FILTER_PROJECTION);\\n double totalSelectivity = computeTotalSelectivity(selectivityHolder);\\n\\n assert filterBaseTableSelectivity >= 0 && filterBaseTableSelectivity <= 1.0:\\\"filterBaseTableSelectivity Out of Bounds -> \\\" + filterBaseTableSelectivity;\\n assert baseTableSelectivity >= 0 && baseTableSelectivity <= 1.0:\\\"baseTableSelectivity Out of Bounds -> \\\" + baseTableSelectivity;\\n assert projectionSelectivity >= 0 && projectionSelectivity <= 1.0:\\\"projectionSelectivity Out of Bounds -> \\\" + projectionSelectivity;\\n assert totalSelectivity >= 0 && totalSelectivity <= 1.0:\\\"totalSelectivity Out of Bounds -> \\\" + totalSelectivity;\\n\\n // Total Row Count from the Base Conglomerate\\n double totalRowCount = scc.baseRowCount();\\n assert totalRowCount >= 0 : \\\"totalRowCount cannot be negative -> \\\" + totalRowCount;\\n // Rows Returned is always the totalSelectivity (Conglomerate Independent)\\n scanCost.setEstimatedRowCount(Math.round(totalRowCount*totalSelectivity));\\n\\n double baseTableAverageRowWidth = scc.getBaseTableAvgRowWidth();\\n double baseTableColumnSizeFactor = scc.baseTableColumnSizeFactor(totalColumns);\\n\\n // We use the base table so the estimated heap size and remote cost are the same for all conglomerates\\n double colSizeFactor = baseTableAverageRowWidth*baseTableColumnSizeFactor;\\n assert baseTableAverageRowWidth >= 0 : \\\"baseTableAverageRowWidth cannot be negative -> \\\" + baseTableAverageRowWidth;\\n assert baseTableColumnSizeFactor >= 0 : \\\"baseTableColumnSizeFactor cannot be negative -> \\\" + baseTableColumnSizeFactor;\\n\\n double openLatency = scc.getOpenLatency();\\n double closeLatency = scc.getCloseLatency();\\n double localLatency = scc.getLocalLatency();\\n double remoteLatency = scc.getRemoteLatency();\\n double remoteCost = openLatency + closeLatency + totalRowCount*totalSelectivity*remoteLatency*(1+colSizeFactor/100d);\\n assert openLatency >= 0 : \\\"openLatency cannot be negative -> \\\" + openLatency;\\n assert closeLatency >= 0 : \\\"closeLatency cannot be negative -> \\\" + closeLatency;\\n assert localLatency >= 0 : \\\"localLatency cannot be negative -> \\\" + localLatency;\\n assert remoteLatency >= 0 : \\\"remoteLatency cannot be negative -> \\\" + remoteLatency;\\n assert remoteCost >= 0 : \\\"remoteCost cannot be negative -> \\\" + remoteCost;\\n // Heap Size is the avg row width of the columns for the base table*total rows\\n // Average Row Width\\n // This should be the same for every conglomerate path\\n scanCost.setEstimatedHeapSize((long)(totalRowCount*totalSelectivity*colSizeFactor));\\n // Should be the same for each conglomerate\\n scanCost.setRemoteCost((long)remoteCost);\\n // Base Cost + LookupCost + Projection Cost\\n double congAverageWidth = scc.getConglomerateAvgRowWidth();\\n double baseCost = openLatency+closeLatency+(totalRowCount*baseTableSelectivity*localLatency*(1+congAverageWidth/100d));\\n assert congAverageWidth >= 0 : \\\"congAverageWidth cannot be negative -> \\\" + congAverageWidth;\\n assert baseCost >= 0 : \\\"baseCost cannot be negative -> \\\" + baseCost;\\n scanCost.setFromBaseTableRows(filterBaseTableSelectivity * totalRowCount);\\n scanCost.setFromBaseTableCost(baseCost);\\n double lookupCost;\\n if (lookupColumns == null)\\n lookupCost = 0.0d;\\n else {\\n lookupCost = totalRowCount*filterBaseTableSelectivity*(openLatency+closeLatency);\\n scanCost.setIndexLookupRows(filterBaseTableSelectivity*totalRowCount);\\n scanCost.setIndexLookupCost(lookupCost+baseCost);\\n }\\n assert lookupCost >= 0 : \\\"lookupCost cannot be negative -> \\\" + lookupCost;\\n\\n double projectionCost;\\n if (projectionSelectivity == 1.0d)\\n projectionCost = 0.0d;\\n else {\\n projectionCost = totalRowCount * filterBaseTableSelectivity * localLatency * colSizeFactor*1d/1000d;\\n scanCost.setProjectionRows(scanCost.getEstimatedRowCount());\\n scanCost.setProjectionCost(lookupCost+baseCost+projectionCost);\\n }\\n assert projectionCost >= 0 : \\\"projectionCost cannot be negative -> \\\" + projectionCost;\\n\\n double localCost = baseCost+lookupCost+projectionCost;\\n assert localCost >= 0 : \\\"localCost cannot be negative -> \\\" + localCost;\\n scanCost.setLocalCost(localCost);\\n scanCost.setNumPartitions(scc.getNumPartitions());\\n scanCost.setLocalCostPerPartition((baseCost + lookupCost + projectionCost)/scc.getNumPartitions());\\n }\",\n \"public void calculateCost() {\\n\\t\\tthis.cost = 0.0;\\n\\t\\t\\n\\t\\tint i, count = this.cities.size()-1;\\n\\t\\tfor (i = 0; i < count; i++)\\n\\t\\t\\tthis.cost += this.cities.get(i).distances[this.cities.get(i+1).index];\\n\\n\\t\\tthis.cost += this.cities.get(count).distances[this.cities.get(0).index];\\n\\t}\",\n \"float getCostReduction();\",\n \"double ComputeCost(double order, double tipPercent, double serviceRating, double foodRating)\\r\\n {\\r\\n // kazda gwiazdka to 2 procent od sumy zamówienia\\r\\n return order + order * (tipPercent/100) + (serviceRating * 0.02) * order + (foodRating * 0.02) * order;\\r\\n }\",\n \"@Override\\n\\tpublic double cost() {\\n\\t\\tdouble price = good.cost();\\n\\t\\treturn price+price/2;\\n\\t}\",\n \"private double calcuFcost() {\\n\\t\\treturn num * configMap.get('r') + (num-1) * configMap.get('l') + num * configMap.get('f') + configMap.get('t');\\n\\t}\",\n \"public abstract float getEstimatedCost(AStarNode paramAStarNode);\",\n \"public abstract float getCost(AStarNode paramAStarNode);\",\n \"public float getCost()\\r\\n/* 13: */ {\\r\\n/* 14:10 */ return this.costFromStart + this.estimatedCostToGoal;\\r\\n/* 15: */ }\",\n \"protected abstract double getDefaultCost();\",\n \"int getCost();\",\n \"int getCost();\",\n \"int getCost();\",\n \"@Override\\n\\tvoid get_cost_per_sqarefeet() {\\n\\t\\tcost=1800;\\n\\t}\",\n \"@Override\\n\\tpublic double cost() {\\n\\t\\treturn 10000;\\n\\t}\",\n \"@Pure\\n\\tdouble getCost();\",\n \"public double calculateCost(Purchase purchase);\",\n \"protected double getCost(double[] n) throws Exception {\\n\\t\\tdouble[] da = this.outputDifferences(n);\\n\\t\\tdouble o = 0;\\n\\t\\tfor (double d : da) o += d*d;\\n\\t\\treturn o;\\n\\t}\",\n \"@Override\\n public double calcCost() {\\n return calcSalesFee()+calcTaxes();\\n }\",\n \"public double costNEX() {\\r\\n double diff=0;\\r\\n double intensity=0;\\r\\n \\r\\n for(int x=Config.ptvXLow-0; x < Config.ptvXHigh+0; x++) {\\r\\n// for(int x=Solver.xBoundsTumor[0]; x < Solver.xBoundsTumor[1]; x+= Config.scaleFactor) {\\r\\n for(int y=Config.ptvYLow-0; y < Config.ptvYHigh+0; y++) {\\r\\n// for(int y=Solver.yBoundsTumor[0]; y < Solver.yBoundsTumor[1]; y+= Config.scaleFactor) {\\r\\n for(int z=Config.ptvZLow-0; z < Config.ptvZHigh+0; z++) {\\r\\n// for(int z=Solver.zBoundsTumor[0]; z < Solver.zBoundsTumor[1]; z+= Config.scaleFactor) {\\r\\n\\r\\n this.body2[x][y][z].setCurrentDosis(0.0); //Set currentPtvVoxel Dose to 0 \\r\\n for(int i=0; i<Config.numberOfSeeds;++i) { \\r\\n // Calculate intensity based based on current dwelltime\\r\\n intensity = this.body2[x][y][z].radiationIntensity(this.seeds2[i].getCoordinate(), New_state[i]);\\r\\n if (intensity>0) {\\r\\n// LogTool.print(\\\"Cost: Intensity :\\\" + intensity + \\\"@ \\\" + x + \\\" \\\" + y + \\\" \\\" + z,\\\"notification\\\");\\r\\n }\\r\\n this.body2[x][y][z].addCurrentDosis(intensity);\\r\\n } \\r\\n diff += Math.pow((this.body2[x][y][z].getGoalDosis()-this.body2[x][y][z].getCurrentDosis()),2);\\r\\n// LogTool.print(\\\" diffdose \\\" + (Looper.body2[x][y][z].getGoalDosis()-Looper.body2[x][y][z].getCurrentDosis()),\\\"notification\\\");\\r\\n } \\r\\n }\\r\\n }\\r\\n return Math.sqrt(diff);\\r\\n// return Math.random();\\r\\n }\",\n \"@Override\\n\\tpublic double cost() {\\n\\t\\treturn 2.19;\\n\\t}\",\n \"double setCost(double cost);\",\n \"public void calculateCost(){\\n if(this.isChair){\\n for(int i = 0; i < this.chairs.length; i++){\\n this.cost += this.chairs[i].getPrice();\\n }\\n }\\n //if furniture type is chair, add up cost of all items in list\\n if(this.isDesk){\\n for(int i = 0; i < this.desks.length; i++){\\n this.cost += this.desks[i].getPrice();\\n }\\n }\\n //if furniture type is chair, add up cost of all items in list\\n if(this.isFiling){\\n for(int i = 0; i < this.filingCabinets.length; i++){\\n this.cost += this.filingCabinets[i].getPrice();\\n }\\n }\\n //if furniture type is chair, add up cost of all items in list\\n if(this.isLamp){\\n for(int i = 0; i < this.lamps.length; i++){\\n this.cost += this.lamps[i].getPrice();\\n }\\n }\\n }\",\n \"double setEstimatedCost(double cost);\",\n \"@Override\\n\\tpublic double cost() {\\n\\t\\treturn water.cost()+10;\\n\\t}\",\n \"public void calculateOrderCost(){\\n int tmpCost=0;\\n for (Vehicle v : vehicleList){\\n tmpCost+=v.getCost();\\n }\\n totalCost=tmpCost;\\n }\",\n \"@Override\\n public double cost()\\n {\\n return this.price * this.number;\\n }\",\n \"@Override\\r\\n\\tpublic int cost() {\\n\\t\\treturn b1.cost() + 1;\\r\\n\\t}\",\n \"@Override\\r\\n\\tpublic void addToCost() {\\n\\t\\t\\r\\n\\t}\",\n \"public abstract int getCost();\",\n \"public abstract int getCost();\",\n \"public abstract int getCost();\",\n \"public double calcCost(){\\n double cost = 0;\\n cost += pMap.get(size);\\n cost += cMap.get(crust);\\n //Toppings are priced at 3.00 for 3-4 topppings, and 4.0 for 5+ toppings\\n \\n if(toppings !=null)\\n {\\n if((toppings.length == 3) || (toppings.length == 4)){\\n cost += 3.0;\\n }\\n if (toppings.length > 4){\\n cost += 4.0;\\n }\\n }\\n \\n return cost;\\n }\",\n \"public static double Cost(double boxes, double Cost) {\\n\\tdouble pay = boxes * Cost;\\n\\treturn pay;\\n}\",\n \"@Override\\n public double getCost() {\\n return cost;\\n }\",\n \"public double getCost() {\\r\\n\\t \\treturn(cost);\\r\\n\\t}\",\n \"@Override\\r\\n\\tprotected void processCost() throws SGSException {\\n\\r\\n\\t}\",\n \"public double cost()\\n\\t{\\n\\t\\treturn (price * weight);\\n\\t}\",\n \"@Pure\\n\\tdouble getEstimatedCost();\",\n \"public void calculateCost() {\\n \\tdouble costToShipPack;\\n \\tint numOfPacks = 1;\\n \\t\\n \\tfor(Package p: this.packages) {\\n \\t\\tcostToShipPack = 3 + (p.calcVolume() - 1);\\n \\t\\tthis.totalAmounts.put(\\\"Package \\\"+numOfPacks, costToShipPack);\\n \\t\\tnumOfPacks++;\\n \\t}\\n \\t\\n }\",\n \"public void calculateCost(AStarNode parentNode, AStarNode endNode)\\n \\t{\\n \\t\\tthis.costFromStart = parentNode.getCostFromStart() + node.getCost();\\n \\t\\tthis.heuristic = ModelUtils.INSTANCE.getDistance(this.getPosition(), endNode.getPosition());\\n \\t\\tthis.totalCost = this.costFromStart + this.heuristic;\\n \\t\\tthis.parent = parentNode;\\n \\t}\",\n \"private double calcuCMetric() {\\n\\t\\treturn (p-1)/fcost;\\n\\t}\",\n \"public double getCost() {\\t\\t \\n\\t\\treturn cost;\\n\\t}\",\n \"@Override\\r\\n\\tpublic double cost() {\\n\\t\\treturn this.cost;\\r\\n\\t}\",\n \"private double costOf(int w) {\\n\\t\\treturn getVertex(w).getCost();\\n\\t}\",\n \"public double getCost()\\n\\t{\\n\\t\\treturn 0.9;\\n\\t}\",\n \"@Override\\n public double getCost() {\\n\\t return 13;\\n }\",\n \"@Override\\n\\tpublic double getCost() {\\n\\t\\treturn price * weight; // cost = price of the candy * weight of candies\\n\\t}\",\n \"public double sCost(Model m, Value stats, Value params) throws LearnerException {\\n return -m.logPSufficient(stats,params);\\n }\",\n \"@Override\\r\\n\\tpublic double getCost() {\\r\\n\\t\\tdouble total = 0;\\r\\n\\t\\t\\r\\n\\t\\tfor(Product p: parts) {\\r\\n\\t\\t\\ttotal += p.getCost();\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\treturn total;\\r\\n\\t}\",\n \"public double calcCost() {\\n // $2 per topping.\\n double cost = 2 * (this.cheese + this.pepperoni + this.ham);\\n // size cost\\n switch (this.size) {\\n case \\\"small\\\":\\n cost += 10;\\n break;\\n case \\\"medium\\\":\\n cost += 12;\\n break;\\n case \\\"large\\\":\\n cost += 14;\\n break;\\n default:\\n }\\n return cost;\\n }\",\n \"private void calculateCosts() {\\r\\n lb_CubicSum.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_Volume)) + \\\" €\\\");\\r\\n lb_MaterialCostSum.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_Price)) + \\\" €\\\");\\r\\n lb_CuttingTimeSum.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_CuttingHours)) + \\\" €\\\");\\r\\n lb_CuttingCostSum.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_CuttingPrice)) + \\\" €\\\");\\r\\n lb_TotalCosts.setText(UtilityFormat.getStringForLabel(getColmunSum(tc_CuttingPrice) + getColmunSum(tc_Price)) + \\\" €\\\");\\r\\n\\r\\n ModifyController.getInstance().setProject_constructionmaterialList(Boolean.TRUE);\\r\\n }\",\n \"Integer cost(PathFindingNode node, PathFindingNode neighbour);\",\n \"@Override\\n\\tprotected void setCost(double cst) {\\n\\t\\t\\n\\t}\",\n \"public double getCosts();\",\n \"UnsignedLong cost(EigrpMetricVersion version);\",\n \"private double calcCost(Cloudlet cloudlet, FogDevice fogDevice) {\\n double cost = 0;\\n //cost includes the processing cost\\n cost += fogDevice.getCharacteristics().getCostPerSecond() * cloudlet.getCloudletLength( ) / fogDevice.getHost().getTotalMips();\\n // cost includes the memory cost\\n cost += fogDevice.getCharacteristics().getCostPerMem() * cloudlet.getMemRequired();\\n // cost includes the bandwidth cost\\n cost += fogDevice.getCharacteristics().getCostPerBw() * (cloudlet.getCloudletFileSize() + cloudlet.getCloudletOutputSize());\\n return cost;\\n }\",\n \"@Override\\n public double cost(){\\n return 1 + super.sandwich.cost();\\n }\",\n \"private double computeCost(Link link, boolean ignorePenalties) {\\n \\t\\tdouble result = link.getLength() / (link.getMaxSpeed_r() / 3.6);\\r\\n \\t\\tif (ignorePenalties)\\r\\n \\t\\t\\treturn result;\\r\\n \\t\\tDouble penalty = penalties.get(link);\\r\\n \\t\\tif (null != penalty)\\r\\n \\t\\t\\tresult *= (1 + penalty);\\r\\n \\t\\treturn result;\\r\\n \\t}\",\n \"void setCost(double cost);\",\n \"@Override\\n public long cost() {\\n return 100;\\n }\",\n \"public int getCost(Tile<T> n1, Tile<T> n2);\",\n \"public Tuple optimize (Tuple theta) {\\n\\t\\t\\n\\t\\t// obtain the dimensionality\\n\\t\\tdimensionality = theta.GetDimension();\\n\\t\\t\\n\\t\\t// check that dimensionality matches with feature dimensions\\n\\t\\t// TODO\\n\\t\\t\\n\\t\\t// scaling constant k = (alpha / m);\\n\\t\\tdouble c = alpha / members;\\n\\t\\t\\n\\t\\t// Start calculating for each theta\\n\\t\\tTuple new_theta = new Tuple(dimensionality);\\n\\t\\t\\n\\t\\t// Below loop of 'j' will iterate over each parameter\\n\\t\\tfor (int j = 0; j < dimensionality; j++) {\\n\\n\\t\\t\\tdouble weighted_error = 0;\\n\\t\\t\\t\\n\\t\\t\\t// Below loop of 'i' will iterate over each data points of given training set \\n\\t\\t\\tfor (int i = 0; i < members; i++) {\\n\\t\\t\\t\\tTuple ithFeatureSet = dv.GetFeatureTuple(i);\\n\\t\\t\\t\\tTuple ithResponse = dv.GetResponse(i);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tdouble hypo = 0;\\n\\t\\t\\t\\tfor (int k = 0; k < dimensionality; k++)\\n\\t\\t\\t\\t\\thypo += ithFeatureSet.get(k) * theta.get(k);\\n\\t\\t\\t\\tdouble error = ( hypo - ithResponse.get(0) );\\n\\t\\t\\t\\tweighted_error += error * ithFeatureSet.get(j);\\t\\n\\t\\t\\t\\tcurrentCost += error * error;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// TODO LOGGING\\n\\t\\t\\t\\t// System.out.println(\\\"[\\\" + j + \\\", \\\" + i + \\\"] For Theta(\\\" + j + \\\"), Row = \\\" + i + \\\", Feature: \\\" + ithFeatureSet + \\\", Theta: \\\" + theta + \\\", Response: \\\" + ithResponse + \\\", hypo = \\\" + hypo + \\\", err = \\\" + error + \\\", weighted_err = \\\" + weighted_error);\\n\\t\\t\\t\\t// System.out.println(\\\"theta = \\\" + j + \\\", row = \\\" + i + \\\", hypo = \\\" + hypo + \\\", error = \\\" + error + \\\", weighted err = \\\" + weighted_error);\\n\\t\\t\\t} // end of 'i'\\n\\t\\t\\t\\n\\t\\t\\tdouble adjustment = c * weighted_error;\\n\\t\\t\\tcurrentCost = currentCost / (2 * members);\\n\\t\\t\\t\\n\\t\\t\\t// TODO LOGGING\\n\\t\\t\\t// System.out.println(\\\"alpha = \\\" + alpha + \\\", m = \\\" + members + \\\", c = \\\" + c + \\\", weighted_err = \\\" + weighted_error + \\\", adj = \\\" + adjustment);\\n\\t\\t\\t\\n\\t\\t\\tnew_theta.add(theta.get(j) - adjustment );\\n\\t\\t} // end of 'j'\\n\\t\\t\\n\\t\\treturn new_theta;\\n\\t}\",\n \"private double newCost(int v, int w) {\\n\\t\\treturn 0.0;\\n\\t}\",\n \"@Override\\n\\tpublic int cost() {\\n\\t\\treturn 5000;\\n\\t}\",\n \"public void setCost(double cost){\\n this.cost = cost;\\n }\",\n \"@Override\\n\\tpublic double cost() {\\n\\t\\treturn Double.parseDouble(rateOfLatte);\\n\\t}\",\n \"@Override\\n\\tprotected void computeWithoutTime() {\\n\\t\\tinitShortestPaths();\\n\\n\\t\\t// Then we sort for each node v the list of terminals by the distance from v\\n\\t\\tsortedRequiredVertices = new HashMap<Integer, TreeSet<Integer>>();\\n\\t\\tsortRequiredVertices();\\n\\t\\t\\n\\t\\t// Copy of the terminals\\n\\t\\tHashSet<Integer> req = new HashSet<Integer>(\\n\\t\\t\\t\\tinstance.getRequiredVertices());\\n\\n\\t\\t// Union of all the solutions returned by the subalgorithm CH2\\n\\t\\tHashSet<Arc> currentSol = new HashSet<Arc>();\\n\\n\\t\\t// Until all terminals are reached\\n\\t\\twhile (req.size() > 0) {\\n\\n\\t\\t\\t// We apply CH2 to reach some of the non reached terminals\\n\\t\\t\\tCouple<HashSet<Arc>, HashSet<Integer>> tree = applyCH2(req);\\n\\n\\t\\t\\t// tree.first the tree returned by CH2\\n\\t\\t\\t// tree.second is the terminals of that tree\\n\\n\\t\\t\\tcurrentSol.addAll(tree.first);\\n\\t\\t\\tfor (Arc a : tree.first)\\n\\t\\t\\t\\tcosts.put(a, 0); // Set the cost of the arc to 0, as this arc is already used in the solution, it does not cost anything to use it again.\\n\\t\\t\\treq.removeAll(tree.second);\\n\\t\\t}\\n\\n\\t\\t// Compute the returned solution and its cost.\\n\\t\\tarborescence = new HashSet<Arc>();\\n\\t\\tint c = 0;\\n\\t\\tfor (Arc a : currentSol) {\\n\\t\\t\\tList<Arc> l = shortestPaths.get(a);\\n\\t\\t\\tif (a.getInput().equals(a.getOutput()))\\n\\t\\t\\t\\tl = new ArrayList<Arc>();\\n\\t\\t\\tfor (Arc b : l) {\\n\\t\\t\\t\\tarborescence.add(b);\\n\\t\\t\\t\\tc += instance.getCost(b);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcost = c;\\n\\t}\",\n \"public double getTotalCost() {\\n cost = spr.calculateCost();\\n return cost;\\n }\",\n \"public double getCost(){\\n return cost;\\n }\",\n \"@Override\\n protected double calcTotalCost() {\\n \\n double totalCost, templateBasicRate = DEFAULT_BASIC_RATE;\\n double extraBedrooms = 0, extraBathrooms = 0;\\n\\n // if there are extra beds/baths\\n if (this.getNumBedrooms() > DEFAULT_NUM_BEDROOMS)\\n extraBedrooms = this.getNumBedrooms() - DEFAULT_NUM_BEDROOMS;\\n\\n if (this.getNumBathrooms() > DEFAULT_NUM_BATHROOMS)\\n extraBathrooms = this.getNumBathrooms() - DEFAULT_NUM_BATHROOMS;\\n\\n // multiply basic rate by 1.5 if the total area is >= 3,000 sq ft\\n if (this.getTotalArea() >= 3000)\\n templateBasicRate *= 1.5;\\n\\n // calculate total cost\\n totalCost = (templateBasicRate + ((800 * extraBedrooms) + (500 * extraBathrooms)));\\n\\n // add tax\\n totalCost += (TAX * totalCost);\\n\\n return totalCost;\\n }\",\n \"float estimateCostToGoal( int current_x, int current_y, int current_z, boolean fromStart ) {\\n\\t\\treturn 0;\\n\\t}\",\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 double getCost()\\r\\n\\t{\\treturn this.cost;\\t}\",\n \"public CalculateJobCosts() {\\n\\t\\t//sc = new SimpleConnection();\\n\\t\\t//conn = sc.getConnection();\\n\\t}\",\n \"public void calculaMatrizCostes() {\\n int i, j;\\n double xd, yd;\\n costes = new int[n][n];\\n for (i = 0; i < n; i++) {\\n for (j = 0; j < n; j++) {\\n xd = vx[i] - vx[j];\\n yd = vy[i] - vy[j];\\n costes[i][j] = (int) Math.round(Math.sqrt((xd * xd) + (yd * yd)));\\n }\\n }\\n }\",\n \"@Override\\r\\n public int getCost() {\\r\\n return cost;\\r\\n }\",\n \"public double getCost() {\\r\\n return cost;\\r\\n }\",\n \"public double cost()\\n\\t{\\n\\t\\treturn _dblCost;\\n\\t}\",\n \"public double getCost(Triple triple1, Triple triple2) {\\n\\t\\tdouble p1 = 0d;\\n\\t\\tdouble p2 = 0d;\\n\\n\\t\\tif (gsh == null) {\\n\\t\\t\\tp1 = vcp.getCost(triple1);\\n\\t\\t\\tp2 = vcp.getCost(triple2);\\n\\t\\t} else {\\n\\t\\t\\tp1 = gsh.getCost(triple1);\\n\\t\\t\\tp2 = gsh.getCost(triple2);\\n\\t\\t}\\n\\n\\t\\tif (p1 < p2)\\n\\t\\t\\treturn p1 + vcp.getCost(triple1, triple2);\\n\\n\\t\\treturn p2 + vcp.getCost(triple1, triple2);\\n\\t}\",\n \"@Test\\n\\tvoid testCost() {\\n\\t\\tint nbCores = 16;\\n\\t\\tlong duration = 2000;\\n\\t\\tDate requestDate = new Date(\\\"01/01/2000\\\");\\n\\t\\tJob j1 = new Job(nbCores,requestDate,duration,mediumQ);//16 cores less than 1h\\n\\t\\tJob j2 = new Job(nbCores*2,requestDate,duration,mediumQ);//32 cores less than 1h\\n\\t\\tJob j3 = new Job(nbCores*2+1,requestDate,duration,mediumQ);//33 cores less than 1h\\n\\t\\tJob j4 = new Job(nbCores,requestDate,duration*2,mediumQ);//16 cores more than 1h\\n\\t\\tJob j5 = new Job(nbCores*2+1,requestDate,duration*2,mediumQ);//33 cores more than 1h\\n\\t\\tassertEquals(j1.getCost(),0.05f);\\n\\t\\tassertEquals(j2.getCost(),0.05f);\\n\\t\\tassertEquals(j3.getCost(),0.1f);\\n\\t\\tassertEquals(j4.getCost(),0.1f);\\n\\t\\tassertEquals(j5.getCost(),0.2f);\\n\\t}\",\n \"public double evalCost(int[] assig)\\r\\n {\\r\\n /** Indicates if each depot is open */\\r\\n BOFLP BFLProblem = BOFLP.instance();\\r\\n\\r\\n boolean[] openDepots;\\r\\n\\r\\n int nClients = BFLProblem.nClients;\\r\\n int nDepots = BFLProblem.nDepots;\\r\\n\\r\\n openDepots = new boolean[nDepots + 1];\\r\\n\\r\\n double cost;\\r\\n\\r\\n for (int j = 1; j <= nDepots; j++)\\r\\n {\\r\\n openDepots[j] = false;\\r\\n }\\r\\n cost = 0;\\r\\n for (int i = 1; i <= nClients; i++)\\r\\n {\\r\\n int depot = assig[i - 1];\\r\\n cost = cost + BFLProblem.cost[i][depot];\\r\\n openDepots[depot] = true;\\r\\n }\\r\\n for (int j = 1; j <= nDepots; j++)\\r\\n {\\r\\n if (openDepots[j])\\r\\n cost = cost + BFLProblem.fixedCost[j];\\r\\n }\\r\\n return cost;\\r\\n }\",\n \"@Override\\r\\n\\tpublic double getCost() {\\n\\t\\treturn 0;\\r\\n\\t}\",\n \"public double getCost() {\\n\\t\\treturn 1.25;\\n\\t}\",\n \"int getResourceCost();\",\n \"@Override\\n\\tpublic int calculateCost() \\n\\t{\\n\\t\\treturn (this.modernCenterpieceCost*this.centerpieceCount);\\n\\t}\",\n \"public double calcCost() {\\n if (pizzaSize.equals(\\\"small\\\")) {\\n return 10.0 + ((cheeseToppings + pepperoniToppings + veggieToppings) * 2);\\n\\n }\\n else if (pizzaSize.equals(\\\"medium\\\")) {\\n return 12.0 + ((cheeseToppings + pepperoniToppings + veggieToppings) * 2);\\n }\\n else {\\n return 14.0 + ((cheeseToppings + pepperoniToppings + veggieToppings) * 2);\\n }\\n }\",\n \"public float getCost(Node n){\\n char t1 = this.type;\\n char t2 = n.getType();\\n int row1 = this.row;\\n int col1 = this.col;\\n int row2 = n.getRow();\\n int col2 = n.getCol();\\n boolean straight;\\n\\n if(row1 == row2 || col1 == col2)\\n straight = true;\\n else\\n straight = false;\\n\\n if(straight){\\n switch (t1){\\n case '1':\\n switch (t2){\\n case '1':\\n return 1;\\n case '2':\\n return (float)1.5;\\n case 'a':\\n return 1;\\n case 'b':\\n return (float)1.5;\\n }\\n break;\\n case '2':\\n switch (t2){\\n case '1':\\n return (float)1.5;\\n case '2':\\n return 2;\\n case 'a':\\n return (float)1.5;\\n case 'b':\\n return 2;\\n }\\n break;\\n case 'a':\\n switch (t2){\\n case '1':\\n return 1;\\n case '2':\\n return (float)1.5;\\n case 'a':\\n return (float).25;\\n case 'b':\\n return (float).375;\\n }\\n break;\\n case 'b':\\n switch (t2){\\n case '1':\\n return (float)1.5;\\n case '2':\\n return 2;\\n case 'a':\\n return (float).375;\\n case 'b':\\n return (float).25;\\n }\\n break;\\n }\\n } else{\\n switch(t1){\\n case '1':\\n switch (t2){\\n case 'a':\\n case '1':\\n return (float)Math.sqrt(2);\\n case '2':\\n case 'b':\\n return (float)((Math.sqrt(2)+Math.sqrt(8))/2);\\n }\\n break;\\n case '2':\\n switch (t2){\\n case 'a':\\n case '1':\\n return (float)((Math.sqrt(2)+Math.sqrt(8))/2);\\n case '2':\\n case 'b':\\n return (float)Math.sqrt(8);\\n }\\n break;\\n case 'a':\\n switch (t2){\\n case 'a':\\n case '1':\\n return (float)Math.sqrt(2);\\n case '2':\\n case 'b':\\n return (float)((Math.sqrt(2)+Math.sqrt(8))/2);\\n }\\n break;\\n case 'b':\\n switch (t2){\\n case 'a':\\n case '1':\\n return (float)((Math.sqrt(2)+Math.sqrt(8))/2);\\n case '2':\\n case 'b':\\n return (float)Math.sqrt(8);\\n }\\n break;\\n }\\n }\\n\\n return 0;\\n }\",\n \"public double getCost() {\\r\\n\\t\\treturn cost;\\r\\n\\t}\",\n \"public abstract double cost(List<Drink> drinks, Double originalPrice, String pattern);\",\n \"public double calculateCost(GridState newPoint){\\n\\t // Does the agent have access to weather information?\\n\\t return agent.danger(newPoint.getPosition());\\n\\t \\n\\t \\n\\t /* if(agent.hasWeatherInfo()) {\\n\\t\\t // Check fire speed, check wind speed, calculate new fire speed, see if it is likely to spread to the state its gridpoint\\n\\t\\t // Check if it is raining, because then it is slowing down the rain again\\n\\t\\t return danger(newPoint);\\n\\t }\\n\\t else return 1.0;*/\\n }\",\n \"public double getCost(ReadOnlyProperty<Double> linkCost){\\r\\n\\t\\tdouble travelCost = 0;\\r\\n\\t\\tfor(int l: getLinks()){\\r\\n\\t\\t\\ttravelCost += getLinkProbability(l) * linkCost.get(l);\\r\\n\\t\\t}\\r\\n\\t\\treturn travelCost;\\r\\n\\t}\",\n \"double treeNodeTargetFunctionValue(){\\n\\t\\t\\t//loop counter variable\\n\\t\\t\\tint i;\\n\\t\\t\\t\\n\\t\\t\\t//stores the cost\\n\\t\\t\\tdouble sum = 0.0;\\n\\n\\t\\t\\tfor(i=0; i<this.n; i++){\\n\\t\\t\\t\\t//stores the distance\\n\\t\\t\\t\\tdouble distance = 0.0;\\n\\n\\t\\t\\t\\t//loop counter variable\\n\\t\\t\\t\\tint l;\\n\\n\\t\\t\\t\\tfor(l=0;l<this.points[i].dimension;l++){\\n\\t\\t\\t\\t\\t//centroid coordinate of the point\\n\\t\\t\\t\\t\\tdouble centroidCoordinatePoint;\\n\\t\\t\\t\\t\\tif(this.points[i].weight != 0.0){\\n\\t\\t\\t\\t\\t\\tcentroidCoordinatePoint = this.points[i].coordinates[l] / this.points[i].weight;\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tcentroidCoordinatePoint = this.points[i].coordinates[l];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t//centroid coordinate of the centre\\n\\t\\t\\t\\t\\tdouble centroidCoordinateCentre;\\n\\t\\t\\t\\t\\tif(this.centre.weight != 0.0){\\n\\t\\t\\t\\t\\t\\tcentroidCoordinateCentre = this.centre.coordinates[l] / this.centre.weight;\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tcentroidCoordinateCentre = this.centre.coordinates[l];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tdistance += (centroidCoordinatePoint-centroidCoordinateCentre) * \\n\\t\\t\\t\\t\\t\\t\\t(centroidCoordinatePoint-centroidCoordinateCentre) ;\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tsum += distance*this.points[i].weight;\\t\\n\\t\\t\\t}\\n\\t\\t\\treturn sum;\\n\\t\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7190976","0.7190976","0.7136482","0.7119998","0.7043499","0.6999867","0.6969274","0.68936336","0.68459374","0.682099","0.67754775","0.6729219","0.6651276","0.6625793","0.65941083","0.65700686","0.6523296","0.6514856","0.65137064","0.65137064","0.65137064","0.6499385","0.6491753","0.6473434","0.644966","0.6448802","0.644491","0.6434846","0.64304334","0.6419332","0.6350567","0.6329467","0.6313391","0.6294387","0.62786126","0.62703043","0.62568355","0.6250275","0.6250275","0.6250275","0.6250056","0.6243702","0.6241951","0.62368286","0.62360734","0.62198997","0.62130404","0.6212127","0.62110054","0.6203511","0.61839414","0.61604625","0.61568356","0.6150751","0.6150053","0.61414546","0.61403185","0.6128713","0.61267126","0.61095524","0.6103502","0.60974485","0.60921156","0.6077892","0.60741824","0.6054169","0.60446763","0.6044278","0.6041528","0.6019692","0.60019124","0.59963316","0.5995218","0.5986882","0.5984888","0.59833354","0.5975494","0.5972676","0.5968655","0.59670866","0.59647775","0.59587204","0.5958487","0.59561193","0.5950395","0.5946107","0.59422404","0.59397984","0.5939495","0.59236336","0.591397","0.59134465","0.5906417","0.5899556","0.5898639","0.5892016","0.58911395","0.58834875","0.58797896","0.5877328","0.5875338"],"string":"[\n \"0.7190976\",\n \"0.7190976\",\n \"0.7136482\",\n \"0.7119998\",\n \"0.7043499\",\n \"0.6999867\",\n \"0.6969274\",\n \"0.68936336\",\n \"0.68459374\",\n \"0.682099\",\n \"0.67754775\",\n \"0.6729219\",\n \"0.6651276\",\n \"0.6625793\",\n \"0.65941083\",\n \"0.65700686\",\n \"0.6523296\",\n \"0.6514856\",\n \"0.65137064\",\n \"0.65137064\",\n \"0.65137064\",\n \"0.6499385\",\n \"0.6491753\",\n \"0.6473434\",\n \"0.644966\",\n \"0.6448802\",\n \"0.644491\",\n \"0.6434846\",\n \"0.64304334\",\n \"0.6419332\",\n \"0.6350567\",\n \"0.6329467\",\n \"0.6313391\",\n \"0.6294387\",\n \"0.62786126\",\n \"0.62703043\",\n \"0.62568355\",\n \"0.6250275\",\n \"0.6250275\",\n \"0.6250275\",\n \"0.6250056\",\n \"0.6243702\",\n \"0.6241951\",\n \"0.62368286\",\n \"0.62360734\",\n \"0.62198997\",\n \"0.62130404\",\n \"0.6212127\",\n \"0.62110054\",\n \"0.6203511\",\n \"0.61839414\",\n \"0.61604625\",\n \"0.61568356\",\n \"0.6150751\",\n \"0.6150053\",\n \"0.61414546\",\n \"0.61403185\",\n \"0.6128713\",\n \"0.61267126\",\n \"0.61095524\",\n \"0.6103502\",\n \"0.60974485\",\n \"0.60921156\",\n \"0.6077892\",\n \"0.60741824\",\n \"0.6054169\",\n \"0.60446763\",\n \"0.6044278\",\n \"0.6041528\",\n \"0.6019692\",\n \"0.60019124\",\n \"0.59963316\",\n \"0.5995218\",\n \"0.5986882\",\n \"0.5984888\",\n \"0.59833354\",\n \"0.5975494\",\n \"0.5972676\",\n \"0.5968655\",\n \"0.59670866\",\n \"0.59647775\",\n \"0.59587204\",\n \"0.5958487\",\n \"0.59561193\",\n \"0.5950395\",\n \"0.5946107\",\n \"0.59422404\",\n \"0.59397984\",\n \"0.5939495\",\n \"0.59236336\",\n \"0.591397\",\n \"0.59134465\",\n \"0.5906417\",\n \"0.5899556\",\n \"0.5898639\",\n \"0.5892016\",\n \"0.58911395\",\n \"0.58834875\",\n \"0.58797896\",\n \"0.5877328\",\n \"0.5875338\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":38194,"cells":{"query":{"kind":"string","value":"Called when message is received."},"document":{"kind":"string","value":"@Override\n public void onMessageReceived(RemoteMessage remoteMessage) {\n super.onMessageReceived(remoteMessage);\n // [START_EXCLUDE]\n // There are two types of messages data messages and notification messages. Data messages are handled\n // here in onMessageReceived whether the app is in the foreground or background. Data messages are the type\n // traditionally used with GCM. Notification messages are only received here in onMessageReceived when the app\n // is in the foreground. When the app is in the background an automatically generated notification is displayed.\n // When the user taps on the notification they are returned to the app. Messages containing both notification\n // and data payloads are treated as notification messages. The Firebase console always sends notification\n // messages. For more see: https://firebase.google.com/docs/cloud-messaging/concept-options\n // [END_EXCLUDE]\n\n // TODO(developer): Handle FCM messages here.\n // Not getting messages here? See why this may be: https://goo.gl/39bRNJ\n Log.d(TAG, \"From: \" + remoteMessage.getFrom());\n\n // Check if message contains a data payload.\n if (remoteMessage.getData().size() > 0) {\n Log.d(TAG, \"Message data payload: \" + remoteMessage.getData());\n\n if (/* Check if data needs to be processed by long running job */ true) {\n // For long-running tasks (10 seconds or more) use Firebase Job Dispatcher.\n scheduleJob();\n } else {\n // Handle message within 10 seconds\n handleNow();\n }\n\n }\n\n // Check if message contains a notification payload.\n if (remoteMessage.getNotification() != null) {\n //Log.d(TAG, \"Message Notification Body: \" + remoteMessage.getNotification().getBody());\n// processData(remoteMessage);\n //sendNotification(remoteMessage.getNotification().getBody());\n //Toast.makeText(this, remoteMessage.getNotification().getBody(),Toast.LENGTH_SHORT).show();\n }\n\n // Also if you intend on generating your own notifications as a result of a received FCM\n // message, here is where that should be initiated. See sendNotification method below.\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\tpublic void onMessageRecieved(Message arg0) {\n\t\t\n\t}","void onMessageReceived(Message message);","public void messageReceived(Message m) {\n\t\t\r\n\t}","public void messageReceived() {\n\tTrackedMessage.accumulateMap(TrackedMessage.unmapType(\n\t\tTrackedMessage.messagesRecieved, this.getClass()), this\n\t\t.getMessageType(), 1);\n\tTrackedMessage.accumulateMap(TrackedMessage.unmapType(\n\t\tTrackedMessage.bytesRecieved, this.getClass()), this\n\t\t.getMessageType(), TrackedMessage.objectSize(this));\n }","@Override\n public void onMessageReceived(RemoteMessage remoteMessage) {\n }","@Override\n\tpublic void msgReceived(Message msg) {\n\n\t}","@Override\n public void receiveMessage(String message) {\n }","@Override\n\tpublic void onMessage( String message ) {\n\t\tlog.info(\"received: \" + message);\n\t}","@Override\n public void handleMessage(Message message) {}","@Override\r\n\tpublic void messageReceived(Object obj) {\n\t\t\r\n\t}","@Override\n\tpublic void receive_message(Message m) {\n\t\t\n\t}","@Override\n public void onReceive(Object message) throws Exception {\n }","public void OnMessageReceived(String msg);","public void messageReceived(Message message) {\n\r\n\t\tLog.info(message.getMsg());\r\n\t}","public abstract void messageReceived(String message);","@Override\n\tpublic void onMessageReceived(ACLMessage message) {\n\n\t}","@Override\r\n public void handleMessage(Message msg) {\n }","@Override\n //here the messageReceived method is implemented\n public void messageReceived(String message) {\n publishProgress(message);\n }","@Override\n //here the messageReceived method is implemented\n public void messageReceived(String message) {\n publishProgress(message);\n }","@Override\n //here the messageReceived method is implemented\n public void messageReceived(String message) {\n publishProgress(message);\n }","@Override\n //here the messageReceived method is implemented\n public void messageReceived(String message) {\n publishProgress(message);\n }","@Override\n\tpublic void onMessageReceived(Message m) {\n\t\thandle.addMessage(m);\n\t\trefreshMessages();\n\t}","@Override\n public void onReceive(Object msg) throws Exception {\n }","void onMessageRead(byte[] data);","public void onMessage(Message message) {\n lastMessage = message;\n\n }","public void onDataReceived(byte[] data, String message) {\n }","@Override\n\t\tpublic void handleMessage(Message msg) {\n\t\t\tsuper.handleMessage(msg);\n\t\t\tswitch (msg.what) {\n\t\t\tcase 0:\n\t\t\t\ttv_read.setText(msg.obj.toString());\n\t\t\t\tToast.makeText(N20PINPadControllerActivity.this, \"recv\",\n\t\t\t\t\t\tToast.LENGTH_SHORT).show();\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}","abstract public boolean onMessageReceived(MMXMessage message);","void messageReceived(IMSession session, Message message);","public void onMessage(String message) {\n\t\t\n\t}","void onReceive(Message message) throws IOException {\n server.onReceive(message);\n }","public abstract void onTextReceived(String message);","@Override\n\tpublic void onMessage(Object arg0) {\n\t\t\n\t}","@Override\n\tpublic void receive(String msg) {\n\t\t\n\t}","@OnMessage\n\n public void onMessage(String message) {\n\n System.out.println(\"Received msg: \" + message);\n\n }","abstract void onMessage(byte[] message);","protected void handleMessage(Message msg) {}","@Override\n\tprotected void doReceiveMessage(Message msg) {\n\t\tdeliverMessage(msg);\n\t}","public void handleMessage(Message message);","public void onMessage(String message) {\n\t\t\t\t\tCometMessage msg = deserializeMessage(message);\n\t\t\t\t\tif(msg != null)\n\t\t\t\t\t\tlistener.onMessage(msg);\n\t\t\t\t}","@Override\n\tpublic void receive(String message) {\n\t\tgetReceiveArea().append(message + \"\\n\");\n\t}","@Override\n\tpublic void processMessage(Message message) {\n\t\t\n\t}","private void messageHandler(String read){\n\n try {\n buffer.append(read);\n }catch (MalformedMessageException e){\n System.out.println(\"[CLIENT] The message received is not in XML format.\");\n }\n\n while(!buffer.isEmpty()) {\n if (buffer.getPong()) pong = true;\n else if (buffer.getPing()) send(\"<pong/>\");\n else {\n try {\n clientController.onReceivedMessage(buffer.get());\n } catch (EmptyBufferException e) {\n System.out.println(\"[CLIENT] The buffer is empty!\");\n }\n }\n }\n\n }","@Override\n public void onBufferReceived(byte[] buffer) {\n }","@Override\r\n public void onReceiveResult(Message message) {\r\n switch (message.what) {\r\n //TODO\r\n }\r\n }","@Override\r\n\tpublic void onMessage(BmobMsg message) {\n\t\trefreshNewMsg(message);\r\n\t}","@Override\n\tpublic void readMessage(Message message) {\n\t\t\n\t}","public void messageReceived(String message) {\r\n\t\t// display incoming message to screen.\r\n\t\tthis.chatArea.append(message + \"\\n\");\r\n\t}","void onNewMessage(String message);","public interface OnMessageReceived {\n void messageReceived(String message);\n }","@Override\n\t\t\tpublic void onMessage(Message message) {\n\t\t\t\tTextMessage msg = null;\n\t\t\t\t\n\t\t\t\tif(message instanceof TextMessage){\n\t\t\t\t\tmsg = (TextMessage)message;\n\t\t\t\t\ttry {\n\t\t\t\t\t\tSystem.out.println(\"Consumer:->Receiving message: \"+ msg.getText());\n\t\t\t\t\t} catch (JMSException e) {\n\t\t\t\t\t\t// TODO Auto-generated catch block\n\t\t\t\t\t\te.printStackTrace();\n\t\t\t\t\t}\n\t\t\t\t}else{\n\t\t\t\t\tSystem.out.println(\"Message of wrong type: \"+message.getClass().getName());\n\t\t\t\t}\n\t\t\t}","public synchronized void handleMessage(String message) {\n Log.d(TAG, \"incoming message:\" + message);\n OnMessageReceivedListener listener = listenerReference.get();\n if(listener != null) {\n Log.d(TAG, \"listener not null. Handling message..\");\n listener.handleMessage(message);\n }\n else {\n Log.d(TAG, \"listener null!!\");\n }\n }","@Override\n public void handleMessage(Message msg) {\n Bundle data = msg.getData();\n if (data.containsKey(\"command\")) {\n if (data.getString(\"command\").equalsIgnoreCase(\"get_data\")) {\n mGetDataMessenger = msg.replyTo;\n getData();\n }\n }\n }","public interface OnMessageReceived {\n\t\tpublic void messageReceived(String message);\n\t}","@Override\n\t\tpublic void onMessage(Message message) {\n\t\t\tTextMessage msg = null;\n\t\t\t\n\t\t\tif(message instanceof TextMessage){\n\t\t\t\tmsg = (TextMessage)message;\n\t\t\t\ttry {\n\t\t\t\t\tSystem.out.println(\"Consumer:->Receiving message: \"+ msg.getText());\n\t\t\t\t} catch (JMSException 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}else{\n\t\t\t\tSystem.out.println(\"Message of wrong type: \"+message.getClass().getName());\n\t\t\t}\n\t\t}","@Override\n public void processMessage(int type, String receivedMsg) {\n }","@Override\n\tpublic void onMessage(CommandMessage msg) {\n\t}","private void receivedMessage(ChannelHandlerContext channelHandlerContext, ByteBuf response) {\n String message = new String(getByteArray(response));\n if (message.contains(\"Heartbeat\")) {\n logger.info(\"Received Heartbeat message\");\n channelHandlerContext.fireUserEventTriggered(response);\n } else {\n clientChannelHandlerObserver.processResponse(getByteArray(response));\n }\n }","@Override\n\tpublic void addMessageReceivedListener(MessageReceivedListener messageReceivedListener) {\n\n\t}","public void receiveMessage(String message) {\n\t\tthis.observable.notifyObservers(message);\r\n\t}","@Override\n public void receiveMessage(Message m) {\n commReceiver.receiveMessage(m);\n }","abstract protected void receiveMessage(Message m);","@Override\n\t \t\tpublic void handleMessage(Message msg) {\n\t \t\treceive();\n\t \t\t\t// myTextView.setText(String.valueOf(cnt));\n\t \t\t}","@Override\n\tpublic void onMessage(Message message) {\n\t\tSystem.out.println(message.getBody());\n\t}","@Override\r\n\tpublic void receiveMessage(Stanza stanza, Object payload) {\n\t\t\r\n\t}","public interface OnMessageReceived {\n public void messageReceived(String message);\n }","@Override\n\t\t\t\tpublic void messageArrived(MqttTopic topicName,\n\t\t\t\t\t\tMqttMessage message) throws Exception {\n\t\t\t\t\tSystem.out.println(\"messageArrived----------\");\n\t\t\t\t\tMessage msg = new Message();\n\t\t\t\t\tmsg.what = 1;\n\t\t\t\t\tmsg.obj = message.toString();\n\t\t\t\t\thandler.sendMessage(msg);\n\t\t\t\t}","@Override\n\tpublic void onChatReceived(ChatEvent arg0) {\n\t\t\n\t}","@Override\n public void run() {\n Message message = mHandler.obtainMessage(1);\n mHandler.sendMessage(message);\n }","@Override public void handleMessage(Message msg) {\n super.handleMessage(msg);\n byte[] byteArray = (byte[]) msg.obj;\n int length = msg.arg1;\n byte[] resultArray = length == -1 ? byteArray : new byte[length];\n for (int i = 0; i < byteArray.length && i < length; ++i) {\n resultArray[i] = byteArray[i];\n }\n String text = new String(resultArray, StandardCharsets.UTF_8);\n if (msg.what == BluetoothTalker.MessageConstants.MESSAGE_WRITE) {\n Log.i(TAG, \"we just wrote... [\" + length + \"] '\" + text + \"'\");\n// mIncomingMsgs.onNext(text);\n } else if (msg.what == BluetoothTalker.MessageConstants.MESSAGE_READ) {\n Log.i(TAG, \"we just read... [\" + length + \"] '\" + text + \"'\");\n Log.i(TAG, \" >>r \" + Arrays.toString((byte[]) msg.obj));\n mIncomingMsgs.onNext(text);\n sendMsg(\"I heard you : \" + Math.random() + \"!\");\n// mReadTxt.setText(++ri + \"] \" + text);\n// if (mServerBound && mServerService.isConnected()) {\n// mServerService.sendMsg(\"I heard you : \" + Math.random() + \"!\");\n// } else if (mClientBound && mClientService.isConnected()) {\n// mClientService.sendMsg(\"I heard you : \" + Math.random() + \"!\");\n// }\n// mBluetoothStuff.mTalker.write();\n }\n }","public void onMessage(Message message) {\n gameManager.onMessage(message);\n }","public void receive(Message message) {\n try {\n if (logObj.isDebugEnabled()) {\n logObj.debug(\"Received Message from: \" + message.getSrc());\n }\n\n CayenneEvent event = messageObjectToEvent((Serializable) message.getObject());\n if (event != null) {\n if (logObj.isDebugEnabled()) {\n logObj.debug(\"Received CayenneEvent: \" + event.getClass().getName());\n }\n\n onExternalEvent(event);\n }\n } catch (Exception ex) {\n logObj.info(\"Exception while processing message: \", ex);\n }\n\n }","public void onRecieve(RoundTimeMessage message) {\n\n\n }","@Override\r\n\tpublic void onReceive(Object arg0) throws Exception {\n\t\t\r\n\t}","@Override\n\t\t\tpublic void handleMessage(Message msg) {\n\t\t\t\tprocessBluetoothDeviceMessage(msg);\n\t\t\t}","public void handleMessage(Message msg) {\n switch (msg.what) {\n case handlerState:\n String readMessage = (String) msg.obj; // msg.arg1 = bytes from connect thread\n ReceivedData.setData(readMessage);\n break;\n\n case handlerState1:\n tempSound = Boolean.parseBoolean((String) msg.obj);\n ReceivedData.setSound(tempSound);\n break;\n\n case handlerState5:\n if(\"ACK\".equals ((String) msg.obj ))\n ReceivedData.clearPPGwaveBuffer();\n break;\n\n }\n ReceivedData.Process();\n }","public void onMessage(Session session, Object message) throws IOException {\n\t}","public void receive(Message message) {\n\t\t\tappReceiver.getBufferReceive().add(message);\r\n\t\t\t\t\r\n\t\t}","@Override\n\tpublic void receive() {\n\t}","@Override\n public void onReceive(Context context, Intent intent) {\n String message = intent.getStringExtra(\"message\");\n Log.d(\"receiver\", \"Got message: \" + message);\n\n textView.setText(message);\n }","@Override\n public void onMessageReceived(String from, Bundle data) {\n String message = data.getString(\"message\");\n String key = data.getString(\"key\");\n String value = data.getString(\"value\");\n String enum_text = data.getString(\"enum_text\");\n String extra = data.getString(\"extra\");\n Log.i(TAG, \"From: \" + from);\n Log.i(TAG, \"Message: \" + message);\n\n /**\n * Process the message here.\n * Eg: - Syncing with server.\n * - Store message in local database.\n * - Update UI.\n */\n\n /**\n * In some cases it may be useful to show a notification indicating to the user\n * that a message was received.\n */\n }","void received() throws ImsException;","@Override\n public void handleMessage(Message msg) {\n super.handleMessage(msg);\n Log.d(TAG,\"In Handler, Msg = \"+msg.arg1);\n }","@Override\r\n\t\t\t\t// here the messageReceived method is implemented\r\n\t\t\t\tpublic void messageReceived(String message) {\n\t\t\t\t\tpublishProgress(message);\r\n\t\t\t\t\t// serverMessage[0] = message;\r\n\r\n\t\t\t\t\tserverMessage[count] = message;\r\n\r\n\t\t\t\t\t// count++;\r\n\t\t\t\t\tLog.i(\"TAG\", count + \"辞獄拭辞 閤精 葵: \" + serverMessage[count]);\r\n\t\t\t\t\t/*\r\n\t\t\t\t\t * Log.i(\"TAG\", \"0腰属閤精 葵: \" + serverMessage[0]);\r\n\t\t\t\t\t * Log.i(\"TAG\", \"1腰属 閤精 葵: \" + serverMessage[1]);\r\n\t\t\t\t\t */\r\n\t\t\t\t\tcount++;\r\n\t\t\t\t}","@Override\n public void handleMessage(Message msg) {\n System.out.println(\"recibe mensajes ...\");\n System.out.println(msg.obj);\n }","@Override\n\tpublic void messageReceived(Message message) {\n\t\tappend(String.format(\"<%s> %s\",message.getSource().getName(),message.getMessage().toString()));\n\t}","@Override\n public void onReceive(Context context, Intent intent) {\n String message = intent.getStringExtra(\"message\");\n Log.d(\"receiver\", \"Got message: \" + message);\n }","@Override\n public void onReceive(Context context, Intent intent) {\n String message = intent.getStringExtra(\"message\");\n Log.d(\"receiver\", \"Got message: \" + message);\n }","@Override\n public void run() {\n Message message = new Message();\n message.what = 4;\n handler.sendMessage(message);\n }","@Override\n public void onMessageReceived(String receivedMessage) {\n try {\n JSONObject jsonFromString = new JSONObject(receivedMessage);\n\n\n } catch (JSONException e) {\n e.printStackTrace();\n }\n }","public void onMessageReceived(String message) {\n\t\t\n\t\tILogger logger = LoggerFactory.getLoggerInstance();\n\t\t/** \n\t\t * Create instance of processing module handler and pass message to it. \n\t\t * Processing module handler perform corresponding operation and\n\t\t * compute the changes to be sent to UI\n\t\t */\n\t\tObjectHandler objectHandler = new ObjectHandler();\n\t\tobjectHandler.onMessageReceived(message);\n\t\tlogger.log(ModuleID.PROCESSING, \n\t\t\t\tLogLevel.INFO,\n\t\t\t\t\"Test: Passed the message to processing module ObjectHandler.\");\n\t}","@SuppressWarnings(\"WeakerAccess\")\n\tprotected abstract void onMessageReceived(@NonNull BroadcastMessage message);","@Override\n\tpublic void processMessage(byte[] message) {\n\t}","void systemMessageReceived(IMSession session, Message message);","@Override\n public void onMessage(Message message) {\n try {\n // Generate data\n QueueProcessor processor = getBean(QueueProcessor.class);\n ServiceData serviceData = processor.parseResponseMessage(response, message);\n\n // If return is a DataList or Data, parse it with the query\n if (serviceData.getClientActionList() == null || serviceData.getClientActionList().isEmpty()) {\n serviceData = queryService.onSubscribeData(query, address, serviceData, parameterMap);\n } else {\n // Add address to client action list\n for (ClientAction action : serviceData.getClientActionList()) {\n action.setAddress(getAddress());\n }\n }\n\n // Broadcast data\n broadcastService.broadcastMessageToUID(address.getSession(), serviceData.getClientActionList());\n\n // Log sent message\n getLogger().log(QueueListener.class, Level.DEBUG,\n \"New message received from subscription to address {0}. Content: {1}\",\n getAddress().toString(), message.toString());\n } catch (AWException exc) {\n broadcastService.sendErrorToUID(address.getSession(), exc.getTitle(), exc.getMessage());\n\n // Log error\n getLogger().log(QueueListener.class, Level.ERROR, \"Error in message from subscription to address {0}. Content: {1}\", exc,\n getAddress().toString(), message.toString());\n } catch (Exception exc) {\n broadcastService.sendErrorToUID(address.getSession(), null, exc.getMessage());\n\n // Log error\n getLogger().log(QueueListener.class, Level.ERROR, \"Error in message from subscription to address {0}. Content: {1}\", exc,\n getAddress().toString(), message.toString());\n }\n }","private Message onMessageReceived(String message, DecentSocket origin) {\n\t\tGson gson = new Gson();\n\t\tJsonObject messageObj = JsonParser.parseString(message).getAsJsonObject();\n\t\t//Timestamp member required for all messages\n\t\tif(messageObj.has(\"timestamp\")) {\n\t\t\tString type = messageObj.get(\"type\").getAsString();\n\t\t\tswitch(type) {\n\t\t\t\tcase \"chat\":\n\t\t\t\t\tchatMessageCallback.apply(gson.fromJson(message, ChatMessage.class), origin);\n\t\t\t\t\tbreak;\n\t\t\t\tcase \"peerAsk\":\n\t\t\t\t\treturn onPeerAskMessageReceived(gson.fromJson(message, PeerAskMessage.class), origin);\n\t\t\t\tcase \"peers\":\n\t\t\t\t\treturn onPeersMessageReceived(gson.fromJson(message, PeersMessage.class), origin);\n\t\t\t\tcase \"ping\":\n\t\t\t\t\treturn onPingMessageReceived(gson.fromJson(message, PingMessage.class), origin);\n\t\t\t\tcase \"pong\":\n\t\t\t\t\treturn onPongMessageReceived(gson.fromJson(message, PongMessage.class), origin);\n\t\t\t\tcase \"historyAsk\":\n\t\t\t\t\treturn onHistoryAskMessageReceived(gson.fromJson(message, HistoryAskMessage.class), origin);\n\t\t\t\tcase \"history\":\n\t\t\t\t\treturn onHistoryMessageReceived(gson.fromJson(message, HistoryMessage.class), origin);\n\t\t\t}\n\t\t}\n\t\treturn null;\n\t}","@Override\n public void run() {\n Message message = new Message();\n message.what=1;\n handler.sendMessage(message);\n }","void onMessage(String message) throws IOException;","@Override\n public void handleMessage(ACLMessage message) {\n try {\n onMessage(message);\n } catch (Exception e) {\n e.getMessage();\n }\n }","public void onMessage(Message arg0) {\n\r\n\t}","public void onReceive(Object message) {\r\n if (message instanceof End) {\r\n End end = (End) message;\r\n \r\n log.debug(\"Message End of file for : \"+end.getFilePath().toString()+\" received!\");\r\n \r\n count++;\r\n \r\n String path = end.getFilePath().toString();\r\n \r\n System.out.println(\"Words count of file : \" + path + \" is \" + wordCount.get(path) + \" words\");\r\n \r\n if (count >= numberOfFiles) {\r\n getContext().system().terminate();\r\n }\r\n } else if (message instanceof Line) {\r\n \t\r\n Line line = (Line) message;\r\n \r\n log.debug(\"Message Line of file for : \"+line.getFilePath().toString()+\" received!\");\r\n\r\n int lineWordsCounts = line.read.split(\" \").length;\r\n \r\n String path = line.getFilePath();\r\n \r\n if (wordCount.containsKey(path)) {\r\n \twordCount.put(path, wordCount.get(path) + lineWordsCounts);\r\n } else {\r\n \twordCount.put(path, lineWordsCounts);\r\n }\r\n \r\n } else if (message instanceof Start) {\r\n Start start = (Start) message;\r\n \r\n log.debug(\"Message Start of file for : \"+start.getFilePath().toString()+\" received!\");\r\n\r\n } else {\r\n\t\t\tlog.error(\"Unexpected object message received: \"+message);\r\n unhandled(message);\r\n }\r\n }"],"string":"[\n \"@Override\\n\\tpublic void onMessageRecieved(Message arg0) {\\n\\t\\t\\n\\t}\",\n \"void onMessageReceived(Message message);\",\n \"public void messageReceived(Message m) {\\n\\t\\t\\r\\n\\t}\",\n \"public void messageReceived() {\\n\\tTrackedMessage.accumulateMap(TrackedMessage.unmapType(\\n\\t\\tTrackedMessage.messagesRecieved, this.getClass()), this\\n\\t\\t.getMessageType(), 1);\\n\\tTrackedMessage.accumulateMap(TrackedMessage.unmapType(\\n\\t\\tTrackedMessage.bytesRecieved, this.getClass()), this\\n\\t\\t.getMessageType(), TrackedMessage.objectSize(this));\\n }\",\n \"@Override\\n public void onMessageReceived(RemoteMessage remoteMessage) {\\n }\",\n \"@Override\\n\\tpublic void msgReceived(Message msg) {\\n\\n\\t}\",\n \"@Override\\n public void receiveMessage(String message) {\\n }\",\n \"@Override\\n\\tpublic void onMessage( String message ) {\\n\\t\\tlog.info(\\\"received: \\\" + message);\\n\\t}\",\n \"@Override\\n public void handleMessage(Message message) {}\",\n \"@Override\\r\\n\\tpublic void messageReceived(Object obj) {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\n\\tpublic void receive_message(Message m) {\\n\\t\\t\\n\\t}\",\n \"@Override\\n public void onReceive(Object message) throws Exception {\\n }\",\n \"public void OnMessageReceived(String msg);\",\n \"public void messageReceived(Message message) {\\n\\r\\n\\t\\tLog.info(message.getMsg());\\r\\n\\t}\",\n \"public abstract void messageReceived(String message);\",\n \"@Override\\n\\tpublic void onMessageReceived(ACLMessage message) {\\n\\n\\t}\",\n \"@Override\\r\\n public void handleMessage(Message msg) {\\n }\",\n \"@Override\\n //here the messageReceived method is implemented\\n public void messageReceived(String message) {\\n publishProgress(message);\\n }\",\n \"@Override\\n //here the messageReceived method is implemented\\n public void messageReceived(String message) {\\n publishProgress(message);\\n }\",\n \"@Override\\n //here the messageReceived method is implemented\\n public void messageReceived(String message) {\\n publishProgress(message);\\n }\",\n \"@Override\\n //here the messageReceived method is implemented\\n public void messageReceived(String message) {\\n publishProgress(message);\\n }\",\n \"@Override\\n\\tpublic void onMessageReceived(Message m) {\\n\\t\\thandle.addMessage(m);\\n\\t\\trefreshMessages();\\n\\t}\",\n \"@Override\\n public void onReceive(Object msg) throws Exception {\\n }\",\n \"void onMessageRead(byte[] data);\",\n \"public void onMessage(Message message) {\\n lastMessage = message;\\n\\n }\",\n \"public void onDataReceived(byte[] data, String message) {\\n }\",\n \"@Override\\n\\t\\tpublic void handleMessage(Message msg) {\\n\\t\\t\\tsuper.handleMessage(msg);\\n\\t\\t\\tswitch (msg.what) {\\n\\t\\t\\tcase 0:\\n\\t\\t\\t\\ttv_read.setText(msg.obj.toString());\\n\\t\\t\\t\\tToast.makeText(N20PINPadControllerActivity.this, \\\"recv\\\",\\n\\t\\t\\t\\t\\t\\tToast.LENGTH_SHORT).show();\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tdefault:\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\",\n \"abstract public boolean onMessageReceived(MMXMessage message);\",\n \"void messageReceived(IMSession session, Message message);\",\n \"public void onMessage(String message) {\\n\\t\\t\\n\\t}\",\n \"void onReceive(Message message) throws IOException {\\n server.onReceive(message);\\n }\",\n \"public abstract void onTextReceived(String message);\",\n \"@Override\\n\\tpublic void onMessage(Object arg0) {\\n\\t\\t\\n\\t}\",\n \"@Override\\n\\tpublic void receive(String msg) {\\n\\t\\t\\n\\t}\",\n \"@OnMessage\\n\\n public void onMessage(String message) {\\n\\n System.out.println(\\\"Received msg: \\\" + message);\\n\\n }\",\n \"abstract void onMessage(byte[] message);\",\n \"protected void handleMessage(Message msg) {}\",\n \"@Override\\n\\tprotected void doReceiveMessage(Message msg) {\\n\\t\\tdeliverMessage(msg);\\n\\t}\",\n \"public void handleMessage(Message message);\",\n \"public void onMessage(String message) {\\n\\t\\t\\t\\t\\tCometMessage msg = deserializeMessage(message);\\n\\t\\t\\t\\t\\tif(msg != null)\\n\\t\\t\\t\\t\\t\\tlistener.onMessage(msg);\\n\\t\\t\\t\\t}\",\n \"@Override\\n\\tpublic void receive(String message) {\\n\\t\\tgetReceiveArea().append(message + \\\"\\\\n\\\");\\n\\t}\",\n \"@Override\\n\\tpublic void processMessage(Message message) {\\n\\t\\t\\n\\t}\",\n \"private void messageHandler(String read){\\n\\n try {\\n buffer.append(read);\\n }catch (MalformedMessageException e){\\n System.out.println(\\\"[CLIENT] The message received is not in XML format.\\\");\\n }\\n\\n while(!buffer.isEmpty()) {\\n if (buffer.getPong()) pong = true;\\n else if (buffer.getPing()) send(\\\"<pong/>\\\");\\n else {\\n try {\\n clientController.onReceivedMessage(buffer.get());\\n } catch (EmptyBufferException e) {\\n System.out.println(\\\"[CLIENT] The buffer is empty!\\\");\\n }\\n }\\n }\\n\\n }\",\n \"@Override\\n public void onBufferReceived(byte[] buffer) {\\n }\",\n \"@Override\\r\\n public void onReceiveResult(Message message) {\\r\\n switch (message.what) {\\r\\n //TODO\\r\\n }\\r\\n }\",\n \"@Override\\r\\n\\tpublic void onMessage(BmobMsg message) {\\n\\t\\trefreshNewMsg(message);\\r\\n\\t}\",\n \"@Override\\n\\tpublic void readMessage(Message message) {\\n\\t\\t\\n\\t}\",\n \"public void messageReceived(String message) {\\r\\n\\t\\t// display incoming message to screen.\\r\\n\\t\\tthis.chatArea.append(message + \\\"\\\\n\\\");\\r\\n\\t}\",\n \"void onNewMessage(String message);\",\n \"public interface OnMessageReceived {\\n void messageReceived(String message);\\n }\",\n \"@Override\\n\\t\\t\\tpublic void onMessage(Message message) {\\n\\t\\t\\t\\tTextMessage msg = null;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(message instanceof TextMessage){\\n\\t\\t\\t\\t\\tmsg = (TextMessage)message;\\n\\t\\t\\t\\t\\ttry {\\n\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"Consumer:->Receiving message: \\\"+ msg.getText());\\n\\t\\t\\t\\t\\t} catch (JMSException e) {\\n\\t\\t\\t\\t\\t\\t// TODO Auto-generated catch block\\n\\t\\t\\t\\t\\t\\te.printStackTrace();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"Message of wrong type: \\\"+message.getClass().getName());\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\",\n \"public synchronized void handleMessage(String message) {\\n Log.d(TAG, \\\"incoming message:\\\" + message);\\n OnMessageReceivedListener listener = listenerReference.get();\\n if(listener != null) {\\n Log.d(TAG, \\\"listener not null. Handling message..\\\");\\n listener.handleMessage(message);\\n }\\n else {\\n Log.d(TAG, \\\"listener null!!\\\");\\n }\\n }\",\n \"@Override\\n public void handleMessage(Message msg) {\\n Bundle data = msg.getData();\\n if (data.containsKey(\\\"command\\\")) {\\n if (data.getString(\\\"command\\\").equalsIgnoreCase(\\\"get_data\\\")) {\\n mGetDataMessenger = msg.replyTo;\\n getData();\\n }\\n }\\n }\",\n \"public interface OnMessageReceived {\\n\\t\\tpublic void messageReceived(String message);\\n\\t}\",\n \"@Override\\n\\t\\tpublic void onMessage(Message message) {\\n\\t\\t\\tTextMessage msg = null;\\n\\t\\t\\t\\n\\t\\t\\tif(message instanceof TextMessage){\\n\\t\\t\\t\\tmsg = (TextMessage)message;\\n\\t\\t\\t\\ttry {\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"Consumer:->Receiving message: \\\"+ msg.getText());\\n\\t\\t\\t\\t} catch (JMSException 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}else{\\n\\t\\t\\t\\tSystem.out.println(\\\"Message of wrong type: \\\"+message.getClass().getName());\\n\\t\\t\\t}\\n\\t\\t}\",\n \"@Override\\n public void processMessage(int type, String receivedMsg) {\\n }\",\n \"@Override\\n\\tpublic void onMessage(CommandMessage msg) {\\n\\t}\",\n \"private void receivedMessage(ChannelHandlerContext channelHandlerContext, ByteBuf response) {\\n String message = new String(getByteArray(response));\\n if (message.contains(\\\"Heartbeat\\\")) {\\n logger.info(\\\"Received Heartbeat message\\\");\\n channelHandlerContext.fireUserEventTriggered(response);\\n } else {\\n clientChannelHandlerObserver.processResponse(getByteArray(response));\\n }\\n }\",\n \"@Override\\n\\tpublic void addMessageReceivedListener(MessageReceivedListener messageReceivedListener) {\\n\\n\\t}\",\n \"public void receiveMessage(String message) {\\n\\t\\tthis.observable.notifyObservers(message);\\r\\n\\t}\",\n \"@Override\\n public void receiveMessage(Message m) {\\n commReceiver.receiveMessage(m);\\n }\",\n \"abstract protected void receiveMessage(Message m);\",\n \"@Override\\n\\t \\t\\tpublic void handleMessage(Message msg) {\\n\\t \\t\\treceive();\\n\\t \\t\\t\\t// myTextView.setText(String.valueOf(cnt));\\n\\t \\t\\t}\",\n \"@Override\\n\\tpublic void onMessage(Message message) {\\n\\t\\tSystem.out.println(message.getBody());\\n\\t}\",\n \"@Override\\r\\n\\tpublic void receiveMessage(Stanza stanza, Object payload) {\\n\\t\\t\\r\\n\\t}\",\n \"public interface OnMessageReceived {\\n public void messageReceived(String message);\\n }\",\n \"@Override\\n\\t\\t\\t\\tpublic void messageArrived(MqttTopic topicName,\\n\\t\\t\\t\\t\\t\\tMqttMessage message) throws Exception {\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"messageArrived----------\\\");\\n\\t\\t\\t\\t\\tMessage msg = new Message();\\n\\t\\t\\t\\t\\tmsg.what = 1;\\n\\t\\t\\t\\t\\tmsg.obj = message.toString();\\n\\t\\t\\t\\t\\thandler.sendMessage(msg);\\n\\t\\t\\t\\t}\",\n \"@Override\\n\\tpublic void onChatReceived(ChatEvent arg0) {\\n\\t\\t\\n\\t}\",\n \"@Override\\n public void run() {\\n Message message = mHandler.obtainMessage(1);\\n mHandler.sendMessage(message);\\n }\",\n \"@Override public void handleMessage(Message msg) {\\n super.handleMessage(msg);\\n byte[] byteArray = (byte[]) msg.obj;\\n int length = msg.arg1;\\n byte[] resultArray = length == -1 ? byteArray : new byte[length];\\n for (int i = 0; i < byteArray.length && i < length; ++i) {\\n resultArray[i] = byteArray[i];\\n }\\n String text = new String(resultArray, StandardCharsets.UTF_8);\\n if (msg.what == BluetoothTalker.MessageConstants.MESSAGE_WRITE) {\\n Log.i(TAG, \\\"we just wrote... [\\\" + length + \\\"] '\\\" + text + \\\"'\\\");\\n// mIncomingMsgs.onNext(text);\\n } else if (msg.what == BluetoothTalker.MessageConstants.MESSAGE_READ) {\\n Log.i(TAG, \\\"we just read... [\\\" + length + \\\"] '\\\" + text + \\\"'\\\");\\n Log.i(TAG, \\\" >>r \\\" + Arrays.toString((byte[]) msg.obj));\\n mIncomingMsgs.onNext(text);\\n sendMsg(\\\"I heard you : \\\" + Math.random() + \\\"!\\\");\\n// mReadTxt.setText(++ri + \\\"] \\\" + text);\\n// if (mServerBound && mServerService.isConnected()) {\\n// mServerService.sendMsg(\\\"I heard you : \\\" + Math.random() + \\\"!\\\");\\n// } else if (mClientBound && mClientService.isConnected()) {\\n// mClientService.sendMsg(\\\"I heard you : \\\" + Math.random() + \\\"!\\\");\\n// }\\n// mBluetoothStuff.mTalker.write();\\n }\\n }\",\n \"public void onMessage(Message message) {\\n gameManager.onMessage(message);\\n }\",\n \"public void receive(Message message) {\\n try {\\n if (logObj.isDebugEnabled()) {\\n logObj.debug(\\\"Received Message from: \\\" + message.getSrc());\\n }\\n\\n CayenneEvent event = messageObjectToEvent((Serializable) message.getObject());\\n if (event != null) {\\n if (logObj.isDebugEnabled()) {\\n logObj.debug(\\\"Received CayenneEvent: \\\" + event.getClass().getName());\\n }\\n\\n onExternalEvent(event);\\n }\\n } catch (Exception ex) {\\n logObj.info(\\\"Exception while processing message: \\\", ex);\\n }\\n\\n }\",\n \"public void onRecieve(RoundTimeMessage message) {\\n\\n\\n }\",\n \"@Override\\r\\n\\tpublic void onReceive(Object arg0) throws Exception {\\n\\t\\t\\r\\n\\t}\",\n \"@Override\\n\\t\\t\\tpublic void handleMessage(Message msg) {\\n\\t\\t\\t\\tprocessBluetoothDeviceMessage(msg);\\n\\t\\t\\t}\",\n \"public void handleMessage(Message msg) {\\n switch (msg.what) {\\n case handlerState:\\n String readMessage = (String) msg.obj; // msg.arg1 = bytes from connect thread\\n ReceivedData.setData(readMessage);\\n break;\\n\\n case handlerState1:\\n tempSound = Boolean.parseBoolean((String) msg.obj);\\n ReceivedData.setSound(tempSound);\\n break;\\n\\n case handlerState5:\\n if(\\\"ACK\\\".equals ((String) msg.obj ))\\n ReceivedData.clearPPGwaveBuffer();\\n break;\\n\\n }\\n ReceivedData.Process();\\n }\",\n \"public void onMessage(Session session, Object message) throws IOException {\\n\\t}\",\n \"public void receive(Message message) {\\n\\t\\t\\tappReceiver.getBufferReceive().add(message);\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t}\",\n \"@Override\\n\\tpublic void receive() {\\n\\t}\",\n \"@Override\\n public void onReceive(Context context, Intent intent) {\\n String message = intent.getStringExtra(\\\"message\\\");\\n Log.d(\\\"receiver\\\", \\\"Got message: \\\" + message);\\n\\n textView.setText(message);\\n }\",\n \"@Override\\n public void onMessageReceived(String from, Bundle data) {\\n String message = data.getString(\\\"message\\\");\\n String key = data.getString(\\\"key\\\");\\n String value = data.getString(\\\"value\\\");\\n String enum_text = data.getString(\\\"enum_text\\\");\\n String extra = data.getString(\\\"extra\\\");\\n Log.i(TAG, \\\"From: \\\" + from);\\n Log.i(TAG, \\\"Message: \\\" + message);\\n\\n /**\\n * Process the message here.\\n * Eg: - Syncing with server.\\n * - Store message in local database.\\n * - Update UI.\\n */\\n\\n /**\\n * In some cases it may be useful to show a notification indicating to the user\\n * that a message was received.\\n */\\n }\",\n \"void received() throws ImsException;\",\n \"@Override\\n public void handleMessage(Message msg) {\\n super.handleMessage(msg);\\n Log.d(TAG,\\\"In Handler, Msg = \\\"+msg.arg1);\\n }\",\n \"@Override\\r\\n\\t\\t\\t\\t// here the messageReceived method is implemented\\r\\n\\t\\t\\t\\tpublic void messageReceived(String message) {\\n\\t\\t\\t\\t\\tpublishProgress(message);\\r\\n\\t\\t\\t\\t\\t// serverMessage[0] = message;\\r\\n\\r\\n\\t\\t\\t\\t\\tserverMessage[count] = message;\\r\\n\\r\\n\\t\\t\\t\\t\\t// count++;\\r\\n\\t\\t\\t\\t\\tLog.i(\\\"TAG\\\", count + \\\"辞獄拭辞 閤精 葵: \\\" + serverMessage[count]);\\r\\n\\t\\t\\t\\t\\t/*\\r\\n\\t\\t\\t\\t\\t * Log.i(\\\"TAG\\\", \\\"0腰属閤精 葵: \\\" + serverMessage[0]);\\r\\n\\t\\t\\t\\t\\t * Log.i(\\\"TAG\\\", \\\"1腰属 閤精 葵: \\\" + serverMessage[1]);\\r\\n\\t\\t\\t\\t\\t */\\r\\n\\t\\t\\t\\t\\tcount++;\\r\\n\\t\\t\\t\\t}\",\n \"@Override\\n public void handleMessage(Message msg) {\\n System.out.println(\\\"recibe mensajes ...\\\");\\n System.out.println(msg.obj);\\n }\",\n \"@Override\\n\\tpublic void messageReceived(Message message) {\\n\\t\\tappend(String.format(\\\"<%s> %s\\\",message.getSource().getName(),message.getMessage().toString()));\\n\\t}\",\n \"@Override\\n public void onReceive(Context context, Intent intent) {\\n String message = intent.getStringExtra(\\\"message\\\");\\n Log.d(\\\"receiver\\\", \\\"Got message: \\\" + message);\\n }\",\n \"@Override\\n public void onReceive(Context context, Intent intent) {\\n String message = intent.getStringExtra(\\\"message\\\");\\n Log.d(\\\"receiver\\\", \\\"Got message: \\\" + message);\\n }\",\n \"@Override\\n public void run() {\\n Message message = new Message();\\n message.what = 4;\\n handler.sendMessage(message);\\n }\",\n \"@Override\\n public void onMessageReceived(String receivedMessage) {\\n try {\\n JSONObject jsonFromString = new JSONObject(receivedMessage);\\n\\n\\n } catch (JSONException e) {\\n e.printStackTrace();\\n }\\n }\",\n \"public void onMessageReceived(String message) {\\n\\t\\t\\n\\t\\tILogger logger = LoggerFactory.getLoggerInstance();\\n\\t\\t/** \\n\\t\\t * Create instance of processing module handler and pass message to it. \\n\\t\\t * Processing module handler perform corresponding operation and\\n\\t\\t * compute the changes to be sent to UI\\n\\t\\t */\\n\\t\\tObjectHandler objectHandler = new ObjectHandler();\\n\\t\\tobjectHandler.onMessageReceived(message);\\n\\t\\tlogger.log(ModuleID.PROCESSING, \\n\\t\\t\\t\\tLogLevel.INFO,\\n\\t\\t\\t\\t\\\"Test: Passed the message to processing module ObjectHandler.\\\");\\n\\t}\",\n \"@SuppressWarnings(\\\"WeakerAccess\\\")\\n\\tprotected abstract void onMessageReceived(@NonNull BroadcastMessage message);\",\n \"@Override\\n\\tpublic void processMessage(byte[] message) {\\n\\t}\",\n \"void systemMessageReceived(IMSession session, Message message);\",\n \"@Override\\n public void onMessage(Message message) {\\n try {\\n // Generate data\\n QueueProcessor processor = getBean(QueueProcessor.class);\\n ServiceData serviceData = processor.parseResponseMessage(response, message);\\n\\n // If return is a DataList or Data, parse it with the query\\n if (serviceData.getClientActionList() == null || serviceData.getClientActionList().isEmpty()) {\\n serviceData = queryService.onSubscribeData(query, address, serviceData, parameterMap);\\n } else {\\n // Add address to client action list\\n for (ClientAction action : serviceData.getClientActionList()) {\\n action.setAddress(getAddress());\\n }\\n }\\n\\n // Broadcast data\\n broadcastService.broadcastMessageToUID(address.getSession(), serviceData.getClientActionList());\\n\\n // Log sent message\\n getLogger().log(QueueListener.class, Level.DEBUG,\\n \\\"New message received from subscription to address {0}. Content: {1}\\\",\\n getAddress().toString(), message.toString());\\n } catch (AWException exc) {\\n broadcastService.sendErrorToUID(address.getSession(), exc.getTitle(), exc.getMessage());\\n\\n // Log error\\n getLogger().log(QueueListener.class, Level.ERROR, \\\"Error in message from subscription to address {0}. Content: {1}\\\", exc,\\n getAddress().toString(), message.toString());\\n } catch (Exception exc) {\\n broadcastService.sendErrorToUID(address.getSession(), null, exc.getMessage());\\n\\n // Log error\\n getLogger().log(QueueListener.class, Level.ERROR, \\\"Error in message from subscription to address {0}. Content: {1}\\\", exc,\\n getAddress().toString(), message.toString());\\n }\\n }\",\n \"private Message onMessageReceived(String message, DecentSocket origin) {\\n\\t\\tGson gson = new Gson();\\n\\t\\tJsonObject messageObj = JsonParser.parseString(message).getAsJsonObject();\\n\\t\\t//Timestamp member required for all messages\\n\\t\\tif(messageObj.has(\\\"timestamp\\\")) {\\n\\t\\t\\tString type = messageObj.get(\\\"type\\\").getAsString();\\n\\t\\t\\tswitch(type) {\\n\\t\\t\\t\\tcase \\\"chat\\\":\\n\\t\\t\\t\\t\\tchatMessageCallback.apply(gson.fromJson(message, ChatMessage.class), origin);\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tcase \\\"peerAsk\\\":\\n\\t\\t\\t\\t\\treturn onPeerAskMessageReceived(gson.fromJson(message, PeerAskMessage.class), origin);\\n\\t\\t\\t\\tcase \\\"peers\\\":\\n\\t\\t\\t\\t\\treturn onPeersMessageReceived(gson.fromJson(message, PeersMessage.class), origin);\\n\\t\\t\\t\\tcase \\\"ping\\\":\\n\\t\\t\\t\\t\\treturn onPingMessageReceived(gson.fromJson(message, PingMessage.class), origin);\\n\\t\\t\\t\\tcase \\\"pong\\\":\\n\\t\\t\\t\\t\\treturn onPongMessageReceived(gson.fromJson(message, PongMessage.class), origin);\\n\\t\\t\\t\\tcase \\\"historyAsk\\\":\\n\\t\\t\\t\\t\\treturn onHistoryAskMessageReceived(gson.fromJson(message, HistoryAskMessage.class), origin);\\n\\t\\t\\t\\tcase \\\"history\\\":\\n\\t\\t\\t\\t\\treturn onHistoryMessageReceived(gson.fromJson(message, HistoryMessage.class), origin);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn null;\\n\\t}\",\n \"@Override\\n public void run() {\\n Message message = new Message();\\n message.what=1;\\n handler.sendMessage(message);\\n }\",\n \"void onMessage(String message) throws IOException;\",\n \"@Override\\n public void handleMessage(ACLMessage message) {\\n try {\\n onMessage(message);\\n } catch (Exception e) {\\n e.getMessage();\\n }\\n }\",\n \"public void onMessage(Message arg0) {\\n\\r\\n\\t}\",\n \"public void onReceive(Object message) {\\r\\n if (message instanceof End) {\\r\\n End end = (End) message;\\r\\n \\r\\n log.debug(\\\"Message End of file for : \\\"+end.getFilePath().toString()+\\\" received!\\\");\\r\\n \\r\\n count++;\\r\\n \\r\\n String path = end.getFilePath().toString();\\r\\n \\r\\n System.out.println(\\\"Words count of file : \\\" + path + \\\" is \\\" + wordCount.get(path) + \\\" words\\\");\\r\\n \\r\\n if (count >= numberOfFiles) {\\r\\n getContext().system().terminate();\\r\\n }\\r\\n } else if (message instanceof Line) {\\r\\n \\t\\r\\n Line line = (Line) message;\\r\\n \\r\\n log.debug(\\\"Message Line of file for : \\\"+line.getFilePath().toString()+\\\" received!\\\");\\r\\n\\r\\n int lineWordsCounts = line.read.split(\\\" \\\").length;\\r\\n \\r\\n String path = line.getFilePath();\\r\\n \\r\\n if (wordCount.containsKey(path)) {\\r\\n \\twordCount.put(path, wordCount.get(path) + lineWordsCounts);\\r\\n } else {\\r\\n \\twordCount.put(path, lineWordsCounts);\\r\\n }\\r\\n \\r\\n } else if (message instanceof Start) {\\r\\n Start start = (Start) message;\\r\\n \\r\\n log.debug(\\\"Message Start of file for : \\\"+start.getFilePath().toString()+\\\" received!\\\");\\r\\n\\r\\n } else {\\r\\n\\t\\t\\tlog.error(\\\"Unexpected object message received: \\\"+message);\\r\\n unhandled(message);\\r\\n }\\r\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.8122202","0.80398816","0.785205","0.78350604","0.78322476","0.7822788","0.7797256","0.77835315","0.7694252","0.7622119","0.75510436","0.75181186","0.7510918","0.75091225","0.7503756","0.745281","0.7443811","0.7413422","0.7413422","0.7413422","0.7413422","0.73498106","0.7306548","0.72727084","0.7266291","0.7263036","0.72559917","0.7238753","0.7232474","0.722852","0.7216143","0.71981746","0.7159593","0.71521014","0.7123668","0.7118889","0.71076345","0.7084014","0.707772","0.706663","0.7062231","0.7054568","0.7044867","0.70198476","0.70030755","0.6997087","0.69874763","0.69694024","0.6967564","0.69653654","0.6956799","0.6952375","0.6948794","0.6931533","0.6925384","0.6920414","0.69020367","0.6898272","0.68947214","0.68928045","0.6889317","0.6889188","0.68872833","0.68853915","0.6877219","0.68743867","0.68713254","0.6869855","0.6864478","0.6863514","0.6838256","0.6833569","0.6832806","0.68214816","0.68165106","0.68145293","0.6813643","0.6812225","0.6810395","0.6801911","0.6796142","0.67952114","0.6780698","0.6775823","0.6774075","0.6771611","0.67696655","0.67696655","0.6756099","0.6734164","0.67338973","0.67236","0.672159","0.67174757","0.670743","0.67054284","0.6700302","0.6698175","0.6682078","0.6674609","0.666481"],"string":"[\n \"0.8122202\",\n \"0.80398816\",\n \"0.785205\",\n \"0.78350604\",\n \"0.78322476\",\n \"0.7822788\",\n \"0.7797256\",\n \"0.77835315\",\n \"0.7694252\",\n \"0.7622119\",\n \"0.75510436\",\n \"0.75181186\",\n \"0.7510918\",\n \"0.75091225\",\n \"0.7503756\",\n \"0.745281\",\n \"0.7443811\",\n \"0.7413422\",\n \"0.7413422\",\n \"0.7413422\",\n \"0.7413422\",\n \"0.73498106\",\n \"0.7306548\",\n \"0.72727084\",\n \"0.7266291\",\n \"0.7263036\",\n \"0.72559917\",\n \"0.7238753\",\n \"0.7232474\",\n \"0.722852\",\n \"0.7216143\",\n \"0.71981746\",\n \"0.7159593\",\n \"0.71521014\",\n \"0.7123668\",\n \"0.7118889\",\n \"0.71076345\",\n \"0.7084014\",\n \"0.707772\",\n \"0.706663\",\n \"0.7062231\",\n \"0.7054568\",\n \"0.7044867\",\n \"0.70198476\",\n \"0.70030755\",\n \"0.6997087\",\n \"0.69874763\",\n \"0.69694024\",\n \"0.6967564\",\n \"0.69653654\",\n \"0.6956799\",\n \"0.6952375\",\n \"0.6948794\",\n \"0.6931533\",\n \"0.6925384\",\n \"0.6920414\",\n \"0.69020367\",\n \"0.6898272\",\n \"0.68947214\",\n \"0.68928045\",\n \"0.6889317\",\n \"0.6889188\",\n \"0.68872833\",\n \"0.68853915\",\n \"0.6877219\",\n \"0.68743867\",\n \"0.68713254\",\n \"0.6869855\",\n \"0.6864478\",\n \"0.6863514\",\n \"0.6838256\",\n \"0.6833569\",\n \"0.6832806\",\n \"0.68214816\",\n \"0.68165106\",\n \"0.68145293\",\n \"0.6813643\",\n \"0.6812225\",\n \"0.6810395\",\n \"0.6801911\",\n \"0.6796142\",\n \"0.67952114\",\n \"0.6780698\",\n \"0.6775823\",\n \"0.6774075\",\n \"0.6771611\",\n \"0.67696655\",\n \"0.67696655\",\n \"0.6756099\",\n \"0.6734164\",\n \"0.67338973\",\n \"0.67236\",\n \"0.672159\",\n \"0.67174757\",\n \"0.670743\",\n \"0.67054284\",\n \"0.6700302\",\n \"0.6698175\",\n \"0.6682078\",\n \"0.6674609\",\n \"0.666481\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":38195,"cells":{"query":{"kind":"string","value":"Handle time allotted to BroadcastReceivers."},"document":{"kind":"string","value":"private void handleNow() {\n Log.d(TAG, \"Short lived task is done.\");\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 onReceive(Context context, Intent intent) {\n ArrayList<String> key=intent.getStringArrayListExtra(\"time\");\n Calendar calendar = Calendar.getInstance();\n int hours = calendar.get(Calendar.HOUR_OF_DAY);\n int minutes = calendar.get(Calendar.MINUTE);\n Toast.makeText(context, String.valueOf(key.size()), Toast.LENGTH_LONG).show();\n /*if (Data.size()>0) {\n Toast.makeText(context, Data.get(0), Toast.LENGTH_LONG).show();\n /*int hour = Integer.valueOf(Data.get(0).substring(0, Data.get(0).indexOf(\":\")));\n int minute = Integer.valueOf(Data.get(0).substring(Data.get(0).indexOf(\":\")));\n if ((hours == hour) && (minutes == minute))\n try {\n play(context, R.raw.girlfart01);//vibrator.vibrate(2000);Vibrator vibrator = (Vibrator) context.getSystemService(Context.VIBRATOR_SERVICE);\n Data.remove(0);\n Data.remove(1);\n } catch (IOException e) {\n e.printStackTrace();\n }\n }*/\n Log.v(this.getClass().getName(), \"Timed alarm onReceive() started at time: \" + new java.sql.Timestamp(System.currentTimeMillis()).toString());\n }","private void handleTimeUpdate() {\n Assert.isMainThread();\n Log.d(\"KeyguardUpdateMonitor\", \"handleTimeUpdate\");\n for (int i = 0; i < this.mCallbacks.size(); i++) {\n KeyguardUpdateMonitorCallback keyguardUpdateMonitorCallback = this.mCallbacks.get(i).get();\n if (keyguardUpdateMonitorCallback != null) {\n keyguardUpdateMonitorCallback.onTimeChanged();\n }\n }\n }","public void onTimeTick() {\n tick++;\n try {\n sendBeaconLog(10);\n } catch (InterruptedException e) {\n }\n if (tick % 10 == 0) {\n sendDirectedPresence();\n }\n }","@Override\n public void onReceive(Context context, Intent intent) {\n try {\n float[] message1 = intent.getFloatArrayExtra(\"HR\");\n int message2 = intent.getIntExtra(\"ACCR\", 0);\n int sensorType = intent.getIntExtra(\"SENSOR_TYPE\", 0);\n isRunning = intent.getBooleanExtra(\"IS_RUNNING\",false);\n if (!isRunning) {\n //Thread.sleep(3000);\n isStop = true;\n } else {\n isStop = false;\n }\n if (mSwitch != null) {\n if (isStop) {\n mSwitch.setChecked(isRunning);\n }\n }\n if ((message1 != null ) && (sensorType == 21)) {\n Log.d(\"Receiver\", \"Got HR: \" + message1[0] + \". Got Accuracy: \" + message2);\n int tmpHr = (int)Math.ceil(message1[0] - 0.5f);\n if (tmpHr > 0) {\n //db.getAllUserMonitorDataByLastMeasurementTime(lastMeasurementTime);\n hrTxt.setText(String.valueOf(tmpHr));\n }\n DatabaseHandler db = new DatabaseHandler(getActivity());\n long timeStamp = intent.getLongExtra(\"TIME\", 0)/1000000L;\n lastSyncTxt.setText(String.valueOf(getDate(timeStamp)) + \" / \" + db.getAllUserMonitorDataByLastMeasurementTime(lastMeasurementTime).size() + \" records\");\n }\n } catch (Exception e) {\n e.printStackTrace();\n }\n }","public abstract void broadcastTraceTime(Server s);","@Override\n\t\tpublic void onReceive(Context arg0, Intent arg1) {\n\t\t\tString action = arg1.getAction();\n\t\t\tmContext = arg0;\n\t\t\t\n\t\t\tif(action.equals(\"com.example.timeshowactivity.OFF\")){\n\t\t\t mDelayFlag = 0;\n\t\t\t //WhetherSendIntent =false;\n\t\t\t setTimeShowState(false);\n\t\t\t Log.i(TAG,\"qiuyaobo onReceive com.example.timeshowactivity.OFF\");\n\t\t\t}else if(action.equals(\"com.example.timeshowactivity.ON\")){\n\t\t\t mDelayFlag = 1;\n\t\t\t\t//WhetherSendIntent =true;\n\t\t\t setTimeShowState(true);\n\t\t\t//Log.i(\"huangjun00\",\"TimeShowReceiver ***onReceive00com.example.timeshowactivity.ON***\");\n\t\t\t}else if(action.equals(\"android.intent.action.BOOT_COMPLETED\")){\n\t\t\t\tLog.d(\"ljz\", \"set hall\");\n\t\t\t\t//PowerManager pm = (PowerManager) arg0.getSystemService(Context.POWER_SERVICE);\n\t\t\t\t//pm.setHallSensor(true, 0);\n\t\t\t//Log.i(\"huangjun00\",\"TimeShowReceiver ***onReceive.....android.intent.action.BOOT_COMPLETED***\");\n\t\t\t\treturn;\n\t\t }else if (MTK_ACTION_UNREAD_CHANGED.equals(action)){\n\t\t\t //Log.i(\"huangjun00\",\"TimeShowReceiver ***onReceive.....MTK_ACTION_UNREAD_CHANGED***\");\n\t\t\t\t\t\t\tboolean lidOpen =SystemProperties.getBoolean(\"persist.sys.lidopen\",false);\n\t\t\t\t\t\t\tif(lidOpen){//hal is off ,at the same time a call is arriving,open the hal ,at hal Call interface,hang up the call ,we should display the TimeShow \n\t\t\t\t\t\t\t\t\tmDelayFlag = 1;\n\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t\t\tmDelayFlag = 0;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif(!isIdle()){\n\t\t\t\t\t\t\t\treturn;//when we opened call waiting function ,we hanged up one call ,the other call has been activitied,at this time we cannot update TimeShow actovity if the TimeShow actovity on Background process!\n\t\t\t\t\t\t\t}\n\t\t\t\t\t MainActivity m = MainActivity.getInstance();\n\t\t\t\t\t if(m != null){\n\t\t\t\t\t m.updatetInfo();\n\t }\n\t }\n\t\n\t\t if(!isIdle()){\n\t\t\t\t\t\tIntent updateIncallTouchUi = new Intent(\"UPDATE_INCALLSCREEN_TOUCHUI\");\n\t\t\t\t\t\tmContext.sendBroadcast(updateIncallTouchUi);\n\t\n\t }\n\t\t \n\t\t long milliseconds = SystemClock.elapsedRealtime();\n\t\t long timeSinceLastEvent = milliseconds - mLastReceiveEventTime;\n\t\t mLastReceiveEventTime = milliseconds;\n\t\t mHandler.removeCallbacks(mDelayTimeTask);\n\t\t\t\n\t\t //Log.i(\"huangjun00\",\"TimeShowReceiver ******** flag=\" +mDelayFlag + \" timeSinceLastEvent=\"+timeSinceLastEvent);\n\t\t if(timeSinceLastEvent < DELAY_TIME){\n\t\t\t\t\t\tlong i;\n\t\t\t\t\t\ti= DELAY_TIME - timeSinceLastEvent;\n\t\t //Log.i(\"huangjun00\",\"TimeShowReceiver ***timeSinceLastEvent < DELAY_TIME..timeSinceLastEvent=\" +timeSinceLastEvent + \"; DELAY_TIME=\"+DELAY_TIME+\";i=\"+i);\n\t\t mHandler.postDelayed(mDelayTimeTask, DELAY_TIME - timeSinceLastEvent);\n\t\t return;\n\t\t }\n\t\n\t\t\t\tif(mDelayFlag == 0){\n\t\t\t\t\t\tMainActivity m = MainActivity.getInstance();\n\t\t\t\t\t\tLog.i(TAG,\" qiuyaobo onReceive mDelayFlag == 0 m=\" +m);\n\t\t\t\n\t\t\t\t\t\tif(m != null){\n\t\t\t\t\t\t m.finish();\n\t\t\t\t\t\t\t//m.moveTaskToBack(false);\n\t\t\t // m.onBackPressed();\n\t\t\t\t\t\t\t//ActivityManager am = (ActivityManager)mContext.getSystemService(Context.ACTIVITY_SERVICE);\n\t\t\t\t\t\t//\tam.forceStopPackage(\"com.example.timeshowactivity\");\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t}\n\t\t\t\t}else if(mDelayFlag == 1){\n\t\t\n\t\t /// mTelephonyManager = (TelephonyManager) (mContext.getSystemService(Context.TELEPHONY_SERVICE));//hj\n\t\t // mTelephonyManager.listen(mPhoneStateListener, PhoneStateListener.LISTEN_CALL_STATE); //hj\n\t\t\t\t\n\t\t\t\t\tComponentName cn = new ComponentName(\"com.example.timeshowactivity\",\"com.example.timeshowactivity.MainActivity\");\n\t\t\t\t\tIntent intent = new Intent();\n\t\t\t\t\tintent.addFlags(Intent.FLAG_ACTIVITY_NEW_TASK);\n\t\t\t\t\tintent.setComponent(cn);\n\t\t\t\t\tmContext.startActivity(intent);\n\t\t\t\t}\n\t\t\t\n\t\t}","@Override\n public void onReceive(Context context, Intent intent) {\n Toast.makeText(context, \"Your Task Time Is Over\", Toast.LENGTH_SHORT).show();\n }","@Override\n public void onReceive(Context context, Intent intent) {\n\n if (!PPApplicationStatic.getApplicationStarted(true, true))\n return;\n\n Calendar now = Calendar.getInstance();\n int gmtOffset = 0; //TimeZone.getDefault().getRawOffset();\n final long _time = now.getTimeInMillis() + gmtOffset;\n\n final String alarmPackageName = intent.getStringExtra(EXTRA_ALARM_PACKAGE_NAME);\n\n if (EventStatic.getGlobalEventsRunning(context)) {\n final Context appContext = context.getApplicationContext();\n //PPApplication.startHandlerThreadBroadcast(/*\"AlarmClockBroadcastReceiver.onReceive\"*/);\n //final Handler __handler = new Handler(PPApplication.handlerThreadBroadcast.getLooper());\n //__handler.post(new PPApplication.PPHandlerThreadRunnable(context.getApplicationContext()) {\n //__handler.post(() -> {\n Runnable runnable = () -> {\n// PPApplicationStatic.logE(\"[IN_EXECUTOR] PPApplication.startHandlerThread\", \"START run - from=AlarmClockBroadcastReceiver.onReceive\");\n\n //Context appContext= appContextWeakRef.get();\n\n //if (appContext != null) {\n PowerManager powerManager = (PowerManager) appContext.getSystemService(Context.POWER_SERVICE);\n PowerManager.WakeLock wakeLock = null;\n try {\n if (powerManager != null) {\n wakeLock = powerManager.newWakeLock(PowerManager.PARTIAL_WAKE_LOCK, PPApplication.PACKAGE_NAME + \":AlarmClockBroadcastReceiver_onReceive\");\n wakeLock.acquire(10 * 60 * 1000);\n }\n\n// PPApplicationStatic.logE(\"[EVENTS_HANDLER_CALL] AlarmClockBroadcastReceiver.onReceive\", \"sensorType=SENSOR_TYPE_ALARM_CLOCK\");\n EventsHandler eventsHandler = new EventsHandler(appContext);\n eventsHandler.setEventAlarmClockParameters(_time, alarmPackageName);\n eventsHandler.handleEvents(EventsHandler.SENSOR_TYPE_ALARM_CLOCK);\n\n } catch (Exception e) {\n// PPApplicationStatic.logE(\"[IN_EXECUTOR] PPApplication.startHandlerThread\", Log.getStackTraceString(e));\n PPApplicationStatic.recordException(e);\n } finally {\n if ((wakeLock != null) && wakeLock.isHeld()) {\n try {\n wakeLock.release();\n } catch (Exception ignored) {\n }\n }\n }\n //}\n }; //);\n PPApplicationStatic.createEventsHandlerExecutor();\n PPApplication.eventsHandlerExecutor.submit(runnable);\n }\n }","@Override\n\t\tpublic void onReceive(Context c, Intent i) {\n\t\t\t\n\t\t\tint h=i.getIntExtra(\"hrs\", 0);\n\t\t\tint m=i.getIntExtra(\"min\", 0);\n\t\t\tint s=i.getIntExtra(\"sec\", 0);\n\t\t\tLog.d(TAG, Integer.toString(h));\n\t\t\tLog.d(TAG, Integer.toString(m));\n\t\t\tLog.d(TAG, Integer.toString(s));\n\t\t\t\n\t\t\t//Printing Time to Textview\n\t\t\t\n\t\t\tTextView th=(TextView) findViewById(R.id.hr);\n\t\t\tTextView tm=(TextView) findViewById(R.id.mn);\n\t\t\tTextView ts=(TextView) findViewById(R.id.sc);\n\t\t\tif(h>=10)\n\t\t\t\tth.setText(Integer.toString(h)+\":\");\n\t\t\telse\n\t\t\t\tth.setText(\"0\"+Integer.toString(h)+\":\");\n\t\t\tif(m>=10)\n\t\t\t\ttm.setText(Integer.toString(m)+\":\");\n\t\t\telse\n\t\t\t\ttm.setText(\"0\"+Integer.toString(m)+\":\");\n\t\t\tif(s>=10)\n\t\t\t\tts.setText(Integer.toString(s));\n\t\t\telse\n\t\t\t\tts.setText(\"0\"+Integer.toString(s));\n\t\t\t\n\t\t\t}","@Override\n public void onReceive(Context context, Intent intent) {\n Log.d(\"ALARMA\", \"alarma\");\n AlarmUtils.scheduleAlarmHeartRate();\n BleDevice device = new BleDevice(new DeviceManager().getDevice().getMacAddress());\n\n device.connect();\n /*\n while(!device.readSteps(new StepsListener() {\n @Override\n public void onStepsRead(int value) {\n Log.d(\"ALARMA\", value+\"\");\n }\n })){\n }\n */\n\n while(!device.readHeartRate(new HeartRateListener() {\n @Override\n public void onHeartRateRead(int value) {\n Log.d(\"ALARMA\", value+\"\");\n\n Measurement measurement = new Measurement(new SessionManager().getId(), value, currentTimeMillis()/1000);\n new ApiHelper().uploadHeartRateMeasure(measurement, new SessionManager().getJWT());\n }\n }));\n }","@Override\n\tpublic void msgUpdateTime(int time, int day) {\n\t\tlog.add(new LoggedEvent(\"Recieved Time \" + time));\n\t}","private void handleUpdateTimeMessage() {\n invalidate();\n if (shouldTimerBeRunning()) {\n long timeMs = System.currentTimeMillis();\n long delayMs = INTERACTIVE_UPDATE_RATE_MS - (timeMs % INTERACTIVE_UPDATE_RATE_MS);\n mUpdateTimeHandler.sendEmptyMessageDelayed(MSG_UPDATE_TIME, delayMs);\n }\n }","public void onRecieve(RoundTimeMessage message) {\n\n\n }","private void handleUpdateTimeMessage() {\n invalidate();\n if (shouldTimerBeRunning()) {\n long timeMs = System.currentTimeMillis();\n long delayMs = INTERACTIVE_UPDATE_RATE_MS\n - (timeMs % INTERACTIVE_UPDATE_RATE_MS);\n mUpdateTimeHandler.sendEmptyMessageDelayed(MSG_UPDATE_TIME, delayMs);\n }\n }","private void handleUpdateTimeMessage() {\n invalidate();\n if (shouldTimerBeRunning()) {\n long timeMs = System.currentTimeMillis();\n long delayMs = INTERACTIVE_UPDATE_RATE_MS\n - (timeMs % INTERACTIVE_UPDATE_RATE_MS);\n mUpdateTimeHandler.sendEmptyMessageDelayed(MSG_UPDATE_TIME, delayMs);\n }\n }","private void handleUpdateTimeMessage() {\n invalidate();\n if (shouldTimerBeRunning()) {\n long timeMs = System.currentTimeMillis();\n long delayMs = INTERACTIVE_UPDATE_RATE_MS\n - (timeMs % INTERACTIVE_UPDATE_RATE_MS);\n mUpdateTimeHandler.sendEmptyMessageDelayed(MSG_UPDATE_TIME, delayMs);\n }\n }","private void handleUpdateTimeMessage() {\n invalidate();\n if (shouldTimerBeRunning()) {\n long timeMs = System.currentTimeMillis();\n long delayMs = INTERACTIVE_UPDATE_RATE_MS\n - (timeMs % INTERACTIVE_UPDATE_RATE_MS);\n mUpdateTimeHandler.sendEmptyMessageDelayed(MSG_UPDATE_TIME, delayMs);\n }\n }","private void handleUpdateTimeMessage() {\n invalidate();\n if (shouldTimerBeRunning()) {\n long timeMs = System.currentTimeMillis();\n long delayMs = INTERACTIVE_UPDATE_RATE_MS\n - (timeMs % INTERACTIVE_UPDATE_RATE_MS);\n mUpdateTimeHandler.sendEmptyMessageDelayed(MSG_UPDATE_TIME, delayMs);\n }\n }","public void mo33398h() {\n String str = \"com.tencent.android.tpush.service.channel.heartbeatIntent.pullup\";\n String str2 = \"TpnsChannel\";\n try {\n if (this.f23285A == null) {\n IntentFilter intentFilter = new IntentFilter();\n intentFilter.addAction(\"android.intent.action.SCREEN_ON\");\n intentFilter.addAction(\"android.intent.action.SCREEN_OFF\");\n intentFilter.addAction(\"android.intent.action.USER_PRESENT\");\n intentFilter.addAction(str);\n C6973b.m29776f().registerReceiver(this.f23292L, intentFilter);\n this.f23285A = PendingIntent.getBroadcast(C6973b.m29776f(), 0, new Intent(str), 134217728);\n }\n long currentTimeMillis = System.currentTimeMillis();\n if (f23282q > f23278m) {\n f23282q = f23278m;\n }\n if (XGPushConfig.isForeignWeakAlarmMode(C6973b.m29776f())) {\n StringBuilder sb = new StringBuilder();\n sb.append(\"schedulePullUpHeartbeat WaekAlarmMode heartbeatinterval: \");\n sb.append(f23280o);\n sb.append(\" ms\");\n C6864a.m29305f(str2, sb.toString());\n f23282q = f23280o;\n }\n f23282q = C7055h.m30166a(C6973b.m29776f(), \"com.tencent.android.xg.wx.HeartbeatIntervalMs\", f23282q);\n long j = currentTimeMillis + ((long) f23282q);\n mo33391b(true);\n C7045d.m30117a().mo34149a(0, j, this.f23285A);\n } catch (Throwable th) {\n C6864a.m29302d(str2, \"scheduleHeartbeat error\", th);\n }\n }","@Override\n public void onReceive(final Context context, Intent intent) {\n// PPApplicationStatic.logE(\"[IN_BROADCAST] DashClockBroadcastReceiver.onReceive\", \"xxx\");\n\n PhoneProfilesDashClockExtension dashClockExtension = PhoneProfilesDashClockExtension.getInstance();\n if (dashClockExtension != null) {\n dashClockExtension.updateExtension();\n }\n\n //final boolean refresh = (intent == null) || intent.getBooleanExtra(EXTRA_REFRESH, true);\n\n /*PPApplication.startHandlerThreadBroadcast();\n final Handler handler = new Handler(PPApplication.handlerThreadBroadcast.getLooper());\n handler.post(new Runnable() {\n @Override\n public void run() {\n PPApplicationStatic.logE(\"[IN_THREAD_HANDLER] PPApplication.startHandlerThread\", \"START run - from=DashClockBroadcastReceiver.onReceive\");\n\n PhoneProfilesDashClockExtension dashClockExtension = PhoneProfilesDashClockExtension.getInstance();\n if (dashClockExtension != null)\n {\n dashClockExtension.updateExtension();\n }\n }\n });*/\n\n }","@Override\n\t\tpublic void run() {\n\t\t\twhile (!endFlag) {\n\t\t\t\tlong endTime = System.currentTimeMillis();\n\t\t\t\tif (endTime - touchStartTime > 6000) {\n\t\t\t\t\tMessage msg = handler.obtainMessage();\n\t\t\t\t\tmsg.what = 0;\n\t\t\t\t\thandler.sendMessage(msg);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}","boolean hasReceiveTime();","private void m29985m() {\n String str = \"com.tencent.android.tpush.service.channel.heartbeatIntent\";\n String str2 = \"TpnsChannel\";\n try {\n if (this.f23299z == null) {\n C6973b.m29776f().registerReceiver(new BroadcastReceiver() {\n public void onReceive(Context context, Intent intent) {\n C7005b.m29964a().m29983k();\n }\n }, new IntentFilter(str));\n this.f23299z = PendingIntent.getBroadcast(C6973b.m29776f(), 0, new Intent(str), 134217728);\n }\n long currentTimeMillis = System.currentTimeMillis();\n if (f23279n > f23278m) {\n f23279n = f23278m;\n }\n if (XGPushConfig.isForeignWeakAlarmMode(C6973b.m29776f())) {\n StringBuilder sb = new StringBuilder();\n sb.append(\"scheduleHeartbeat WaekAlarmMode heartbeatinterval: \");\n sb.append(f23280o);\n sb.append(\" ms\");\n C6864a.m29305f(str2, sb.toString());\n f23279n = f23280o;\n }\n f23279n = C7055h.m30166a(C6973b.m29776f(), \"com.tencent.android.xg.wx.HeartbeatIntervalMs\", f23279n);\n C7045d.m30117a().mo34149a(0, currentTimeMillis + ((long) f23279n), this.f23299z);\n } catch (Throwable th) {\n C6864a.m29302d(str2, \"scheduleHeartbeat error\", th);\n }\n }","public void onReceive(Context context, Intent intent) {\n\n Toast.makeText(context, \"Alarm worked.\", Toast.LENGTH_LONG).show();\n final Calendar c = Calendar.getInstance();\n long mHour = c.get(Calendar.HOUR_OF_DAY);\n long mMinute = c.get(Calendar.MINUTE);\n Log.d(\"myTag\", \"Alarm executed at : \" + mHour + \":\" + mMinute);\n\n }","@Override protected void doProcess(Time systemTime) {\n }","@Override\n public void onReceive(Context context, Intent intent) {\n AppUtils.setMorningAlarm(context);\n }","@Override\n\tpublic void onMessageReceived(Message msg) {\n\t\tif ( msgSendTimes.containsKey(\"\"+msg.Payload)) {\n\t\t\tlong startTime = msgSendTimes.get((String)msg.Payload);\n\t\t\tlong elapsedTime = System.nanoTime() - startTime;\n\t\t\tmsgSendTimes.remove((String)msg.Payload);\n\t\t\tmsgTimes.add(elapsedTime);\n\t\t\tSystem.out.println(elapsedTime / 1000000000f);\n\t\t}\n\t}","@RequiresApi(api = Build.VERSION_CODES.JELLY_BEAN)\n @Override\n public void onReceive(Context context, Intent intent) {\n Toast.makeText(context, \"Время поливать свои растения! \", Toast.LENGTH_LONG).show();\n }","@Override\n\t\tpublic void onReceive(Context arg0, Intent arg1) {\n\t\t\tSystem.out.println(\"ALARM CALLED\");\n\t\t\tsendPostRequest();\n\t\t}","public void onScheduled(long scheduledTime);","@Scheduled(fixedRate = 60_000)\n public void checkEventTime() {\n isTimeService.findAll().forEach(event -> {\n if (event.getSchedulledTime().isBefore(LocalDateTime.now())) {\n this.producer.sendReachTimeMessage(new IsTime(event.getMessageId()));\n this.isTimeService.deleteById(event.getSchedulledId());\n }\n });\n// log.info(\"Schedulled time check.\");\n }","@Override\n public void onReceive(Context context, Intent intent) {\n String message = intent.getStringExtra(\"message\");\n Log.d(\"receiver\", \"Got message: \" + message);\n filterDayWise();\n }","public void setReceiveTime(Date receiveTime) {\n this.receiveTime = receiveTime;\n }","public void timeLogic(int time){\n //Add logic to decide time increments at which tickets will be granted\n }","public void timeout(){\n\t\tDate now = new Date();\n\t\tfor (Broadcast b : this.broadcasts){\n\t\t\tif (b.getTimeout().getTime() < now.getTime()){\n\t\t\t\tthis.remove(b);\n\t\t\t}\n\t\t}\n\t}","@Override\n public void onReceive(Context context, Intent intent) {\n String refresh = intent.getStringExtra(MyService.REFRESH_MONEY_PLAYER);\n Log.i(\"II/FullScreen_Juego>\", \" receiver2 > REFRESH : \"+refresh);\n\n try {\n\n //Si lo que recibimos es mayor que lo que habia entonces GANAMOS dinero\n if (Float.parseFloat(refresh) > Float.parseFloat(visorMoneyP1.getText().toString())\n ) {\n //Ejecutamos sonido\n soundGanamosDinero.start();\n //Ejecutar animacion\n visorMoneyP1.startAnimation(aumento);\n //Mostramos el Custom Toast Felicitaciones!\n Toast toast = new Toast(getApplicationContext());\n toast.setDuration(Toast.LENGTH_LONG);\n toast.setGravity(Gravity.CENTER_VERTICAL, 0, 0);\n toast.setView(layout_ganamos);//setting the view of custom toast layout\n toast.show();\n\n\n //Monstramos imagview/gif confeti\n imageView_gif_confeti.setVisibility(View.VISIBLE);\n //Despues de 6 segundos ocultamos Confeti\n new CountDownTimer(6000, 1000) {\n public void onFinish() {\n // When timer is finished\n // Execute your code here\n\n imageView_gif_confeti.setVisibility(View.INVISIBLE);\n }\n\n public void onTick(long millisUntilFinished) {\n // millisUntilFinished The amount of time until finished.\n }\n }.start();\n\n\n //Si lo que recibimos es MENOR que lo que habia entonces PERDIMOS dinero\n } else if (Float.parseFloat(refresh) < Float.parseFloat(visorMoneyP1.getText().toString())\n ) {\n\n //Ejecutamos sonido\n soundPerdimosDinero.start();\n //Ejecutamos animacion\n visorMoneyP1.startAnimation(sacudir);\n\n //Mostramos el Custom Toast Perdimos :(\n Toast toast = new Toast(getApplicationContext());\n toast.setDuration(Toast.LENGTH_LONG);\n toast.setGravity(Gravity.CENTER_VERTICAL, 0, 0);\n toast.setView(layout_pierde);//setting the view of custom toast layout\n toast.show();\n }\n\n\n visorMoneyP1.setText(refresh);\n\n\n }catch (Exception e){\n Log.d(\"II/\",\"Error: \"+e);\n }\n\n }","private void informTimeToCross() {\n if (continueAskingTimes) {\n requestTimes();\n }\n }","public void sendMessage(View v) {\n /*\n\n Intent intent = new Intent(this, DisplayMessageActivity.class);\n EditText editText = (EditText) findViewById(R.id.edit_message);\n String message = editText.getText().toString();\n intent.putExtra(EXTRA_MESSAGE, message);\n startActivity(intent);\n\n */\n long time = currentTimeMillis();\n Date d1 = new Date();\n Date d2;\n // d2 = new Date(d1.getYear(),d1.getMonth(),d1.getDate(),d1.getHours(),d1.getMinutes(),d1.getSeconds());\n Toast.makeText(this, \"ALARM ON\", Toast.LENGTH_SHORT).show();\n // Calendar calendar = Calendar.getInstance();\n // calendar.set(Calendar.HOUR_OF_DAY, alarmTimePicker.getCurrentHour());\n // calendar.set(Calendar.MINUTE, alarmTimePicker.getCurrentMinute());\n alarmManager = (AlarmManager) getSystemService(Context.ALARM_SERVICE);\n Intent intent = new Intent(MainActivity.this, AlarmReceiver.class);\n pendingIntent = PendingIntent.getBroadcast(this, 0, intent, 0);\n Calendar calendar = Calendar.getInstance();\n calendar.setTimeInMillis(System.currentTimeMillis());\n // Set the alarm's trigger time to 8:30 a.m.\n calendar.set(Calendar.HOUR_OF_DAY, 14);\n calendar.set(Calendar.MINUTE, 58);\n Toast.makeText(MainActivity.this, \"bjr\", Toast.LENGTH_SHORT).show();\n // alarmManager.setRepeating(AlarmManager.RTC_WAKEUP, time + 5, 10000, pendingIntent);\n alarmManager.set(AlarmManager.RTC_WAKEUP, System.currentTimeMillis(), pendingIntent);\n // Bon manque de prevenir le receiver....!!\n\n }","public abstract void broadcastTraceTimeCustom(Server s, String prefix);","@Override\n public void run() {\n NotificationHelper nh = new NotificationHelper(getApplicationContext(), alarmId);\n\n /* AlarmEntity is null for snoozed alarm\n * Get actual alarm time by: CurrentTime - silenceTimeout\n */\n if (isSnoozed) {\n nh.deliverMissedNotification(\n System.currentTimeMillis() - (Long.parseLong(silenceTimeStr) * 60000));\n } else\n nh.deliverMissedNotification(alarmEntity.getAlarmTime());\n\n stopAlarmService();\n }","public void setReceiveTime(Date receiveTime) {\r\n this.receiveTime = receiveTime;\r\n }","@Override\n\tprotected void onHandleIntent(Intent intent) {\n\t\tTimer timer = new Timer();\n\t\tTimerTask task = new TimerTask() {\n\t\t\t\n\t\t\t@Override\n\t\t\tpublic void run() {\n\t\t\t\t// TODO Auto-generated method stub\n\t\t\t\tLog.e(\"SERVICE\",\"sulod\");\n\t\t\t\tIntent intent = new Intent();\n\t\t\t\tintent.setAction(ResponseReceiver.ACTION_RESP);\n\t\t\t\tintent.addCategory(Intent.CATEGORY_DEFAULT);\n\t\t\t\tintent.putExtra(\"MESSAGE\", 100);\n\t\t\t\tsendBroadcast(intent);\n\t\t\t}\n\t\t};\n\t\ttimer.schedule(task, 10, SEND_INTERVAL);\n\t}","private synchronized void m16565c() {\n if (!(this.f14719b || this.f14723f.hasMessages(this.f14724g))) {\n this.f14723f.sendMessageDelayed(this.f14723f.obtainMessage(this.f14724g), 2000);\n }\n }","@Override\n public void run() {\n try {\n Thread.sleep(1500);\n } catch (InterruptedException e2) {\n // TODO Auto-generated catch block\n e2.printStackTrace();\n }\n if(isTmp!=-1 && MainActivity2.linkLose==-1){\n Message message=new Message();\n message.what=15;\n MainActivity.hReceiver.sendMessage(message);\n\n }\n }","@Override\n public void onReceive(Context context, Intent intent) {\n Toast.makeText(context, \"Broadcast Received\", Toast.LENGTH_LONG).show();\n /*\n first param is the context\n second param is message to display\n third param is the duration to display the message\n */\n }","private void setHeartRateMonitor()\n {\n\n Calendar cal = Calendar.getInstance();\n Date now = new Date();\n cal.setTime(now);\n\n long alarm_time = cal.getTimeInMillis();\n\n// if(cal.before(Calendar.getInstance()))\n// alarm_time += 60*1000;\n\n AlarmManager alarmManager = (AlarmManager) getSystemService(Context.ALARM_SERVICE);\n\n Intent intent = new Intent(this, HeartRateMonitor.class);\n\n PendingIntent pendingIntent = PendingIntent.getBroadcast(this, HEART_RATE_MONITOR_REQUEST_CODE, intent,PendingIntent.FLAG_UPDATE_CURRENT);\n\n alarmManager.setRepeating(AlarmManager.RTC_WAKEUP, alarm_time,90000, pendingIntent);\n\n Log.i(\"hrmonitor\",\"hrmonitor alarm set\");\n }","@Override\r\n\t\tpublic void onReceive(Context arg0, Intent intent) {\n\t\t\tString action=intent.getAction();\r\n\t\t\tif(action.equals(\"update_sportTime_calorie_distance\")){\r\n\t\t\t\tif(isOnTotalSteps){\r\n\t\t\t\t\ttvCalorie.setText(calorie2String(BleService.totalCalorie)+\"k cal\");\r\n\t\t\t\t\ttvSportTime.setText(time2String(BleService.totalSportTime));\r\n\t\t\t\t\ttvDistance.setText(BleService.totalDistance+\"m\");\r\n\t\t\t\t}else{\r\n\t\t\t\t\ttvCalorie.setText(calorie2String(BleService.intervalCalorie)+\"k cal\");\r\n\t\t\t\t\ttvSportTime.setText(time2String(BleService.intervalSportTime));\r\n\t\t\t\t\ttvDistance.setText(BleService.intervalDistance+\"m\");\r\n\t\t\t\t}\r\n\t\t\t\tdb.execSQL(\"UPDATE sportData SET steps=? WHERE date=?\", new Object[]{BleService.totalSteps, dateString});\r\n\t\t\t\tlayoutChart.removeViewAt(0);\r\n\t\t\t\tlayoutChart.addView(getGraphicalView(), 0);\r\n\t\t\t}\r\n\t\t\tif(action.equals(\"update_steps\")){\r\n\t\t\t\ttvTotalSteps.setText(BleService.totalSteps+\"\");\r\n\t\t\t\ttvIntervalSteps.setText(BleService.intervalSteps+\"\");\r\n\t\t\t\tint currentCount=BleService.totalSteps*100/targetSteps;\r\n\t\t\t\tif(currentCount>100){\r\n\t\t\t\t\tpgTotalSteps.setCurrentCount(100);\r\n\t\t\t\t}else if(currentCount<0){\r\n\t\t\t\t\tpgTotalSteps.setCurrentCount(0);\r\n\t\t\t\t}else{\r\n\t\t\t\t\tpgTotalSteps.setCurrentCount(currentCount);\r\n\t\t\t\t}\r\n\t\t\t\tfloat percent=BleService.totalSteps*100f/targetSteps;\r\n\t\t\t\tif(percent>100){\r\n\t\t\t\t\ttvComplete.setText(\"100%\");\r\n\t\t\t\t}else if(percent<0){\r\n\t\t\t\t\ttvComplete.setText(\"0%\");\r\n\t\t\t\t}else{\r\n\t\t\t\t\ttvComplete.setText(percent2String(percent)+\"%\");\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t}","@Override\n public void onReceive(Context context, Intent intent) {\n int heartRateWatch = intent.getIntExtra(LiveRecordingActivity.HEART_RATE, -1);\n String s = String.valueOf(heartRateWatch) + \" [BPM]\" ;\n hrTextView.setText(s);\n\n if (hasPlot) {\n // Plot the graph\n xyPlotSeriesList.updateSeries(HR_PLOT_WATCH, heartRateWatch);\n XYSeries hrWatchSeries = new SimpleXYSeries(xyPlotSeriesList.getSeriesFromList(HR_PLOT_WATCH), SimpleXYSeries.ArrayFormat.XY_VALS_INTERLEAVED, HR_PLOT_WATCH);\n LineAndPointFormatter formatterPolar = xyPlotSeriesList.getFormatterFromList(HR_PLOT_WATCH);\n heartRatePlot.clear();\n heartRatePlot.addSeries(hrWatchSeries, formatterPolar);\n heartRatePlot.redraw();\n // And add HR value to HR ArrayList\n hrDataArrayList.add(heartRateWatch);\n hrTimes.add(System.currentTimeMillis()-initialTime);\n }\n }","private void onCalculatingChargingTime() {\n store.saveString(remainingTimeForBatteryToDrainOrCharge, \"Computing charging time...\");\n }","protected void processTimer(){\n if(timer != null){\n timer.cancel();\n timer = null;\n }\n // Verificamos si el partido esta en progreso\n if(match.status == Match.STATUS_PENDING || match.status == Match.STATUS_ENDED){\n return;\n }\n // Creamos temporizador 90 * 60 * 1000 = 5.400.000\n timer = new CountDownTimer(5400000, 1000) {\n @Override\n public void onTick(long l) {\n // Calcular los segundos que pasaron\n long seconds = (new Date().getTime() - matchDayLong) / 1000;\n // Calcular los minutos del partido\n long minutes = seconds / 60;\n //long minutes = TimeUnit.MILLISECONDS.toMinutes(uptime);\n if(minutes < 0){\n minutes = 0;\n seconds = 0;\n statusMedium.setText(\"PT\");\n }if(minutes > 45 && minutes < 60){\n minutes = 45;\n seconds = 60;\n }else if(minutes > 90){\n minutes = 90;\n seconds = 60;\n statusMedium.setText(\"ST\");\n }else if(minutes >= 60){\n minutes -= 15;\n statusMedium.setText(\"ST\");\n }else{\n statusMedium.setText(\"PT\");\n }\n\n statusTime.setText(String.format(\"%02d:%02d\", minutes, (seconds%60)));\n }\n\n @Override\n public void onFinish() {\n\n }\n }.start();\n }","@Override\n public void onReceive(Context context, Intent intent) {\n Log.e(\"i m in Broadcast recive\", \"i m in Broadcast recive\");\n Double latitude = intent.getDoubleExtra(\"latitude\",0.0);\n Double longitude = intent.getDoubleExtra(\"longitude\",0.0);\n int pendingPoints = intent.getIntExtra(\"pendingPoints\",0);\n String timeStamp = intent.getStringExtra(\"lastUpdated\");\n boolean isBulkUpload = intent.getBooleanExtra(\"isBulkUpload\",false);\n\n\n textViewLastUpdatedTime.setText(\"Last Updated On: \"+timeStamp);\n textViewPointsCount.setText(\"Pending Points: \"+pendingPoints);\n if(getAddress(latitude,longitude).isEmpty()){\n textview_tracking_updates.setText(\"Updating Details: \\n\"+latitude+\" / \"+longitude );\n }else{\n textview_tracking_updates.setText(\"Updating Details: \\n\\nLast Updated Location is : \"+getAddress(latitude,longitude));\n }\n\n\n }","public void setReceiveTime(Date receiveTime) {\n this.receiveTime = receiveTime;\n }","@Override\r\n public void run() {\n d7++;\r\n if (d7 == 1) {\r\n onReceive(new byte[]{Message.TIMER_MESSAGE, Message.TFP7_EXPIRE});\r\n }\r\n }","public void timeToChallenger() {\n\n\n String c = null;\n for(PlayerInterface p : onlinePlayers){\n if(p.getNickname().equals(getCurrentTurn().getCurrentPlayer().getNickname())){\n c = p.getWorkerRef().get(0).getColor();\n break;\n }\n }\n notifyCards(getCurrentTurn().getCurrentPlayer().getNickname(), c);\n notifyChoose(cardsChosen, this.getAllGods(), this.getCurrentTurn().getCurrentPlayer().getNickname());\n }","public synchronized void checkTimeoutMessages() {\n SQSMessage SQSMessage;\n String receiptHandler;\n long currentTimeStampDifference;\n for (Map.Entry pairs : receivedMessages.entrySet()) {\n SQSMessage = (SQSMessage) pairs.getValue();\n currentTimeStampDifference = System.currentTimeMillis() - SQSMessage.getReceivedTimeStamp();\n if (currentTimeStampDifference > SQSMessage.getDefaultVisibilityTimeout()) {\n receiptHandler = (String) pairs.getKey();\n SQSMessageQueue.addFirst(SQSMessage);\n receivedMessages.remove(receiptHandler);\n }\n }\n }","@Override\n public void run() {\n int time = 59;\n while (time >= -1) {\n try {\n Message message = new Message();\n message.what = AppConfig.CHECKCODE;\n message.obj = time;\n handler.sendMessage(message);\n Thread.sleep(1000);\n time--;\n } catch (InterruptedException e) {\n // TODO Auto-generated catch block\n e.printStackTrace();\n }\n }\n }","@Override\n public void onReceive(Context context, Intent intent) {\n setAlarm(context);\n }","private void onCalculatingDischargingTime() {\n store.saveString(remainingTimeForBatteryToDrainOrCharge, \"Computing drain time...\");\n }","@Override\n \tpublic void handleMessage(Message msg) {\n \t\tswitch (msg.what) {\n\t\t\tcase MSG_BASE:\n\t\t\t\t\n\t\t\t\tbreak;\n\t\t\t\t\n\t\t\tcase MSG_ONESECOND:\n\t onTimeChanged();\n\t invalidate();\n\t mHandler.sendEmptyMessageDelayed(MSG_ONESECOND, ONESECOND);\n\t\t\t\tbreak;\n\n\t\t\tdefault:\n\t\t\t\tbreak;\n\t\t\t}\n \t\tsuper.handleMessage(msg);\n \t}","protected void timeout(Object data_) \n\t{\n\t\tif ( data_ instanceof DiffTimer )\n\t\t{\n\t\t\tDiffTimer d = (DiffTimer)data_ ;\n\t\t\tint type = d.EVT_Type ;\n\t\t\tif(pendingInterest!=null && type!=DiffTimer.TIMEOUT_DELAY_BROADCAST){\n\t\t\t\tsendPacket(pendingInterest, 0.0) ;\n\t\t\t}\n\t\t\tswitch ( type )\n\t\t\t{\n\t\t\t\tcase DiffTimer.TIMEOUT_SEND_REINFORCEMENT :\n\t\t\t\t\tsendReinforcements() ;\n\n\t\t\t\t\t/*// if the size of the dataCache has become 0, there is no need for the timer. The timer will be set next time dataCache_insert is called. \n\t\t\t\t\tif ( (dataCache.size() == 0) && (reinforcementTimer.handle != null) )\n\t\t\t\t\t{\n\t\t\t\t\t\tcancelTimeout(reinforcementTimer.handle) ;\n\t\t\t\t\t\treinforcementTimer.setObject(null) ;\n\t\t\t\t\t\treinforcementTimer.handle = null ; \n\t\t\t\t\t\treinforcementTimer = null ;\n\t\t\t\t\t}\n\t\t\t\t\telse{*/\n\t\t\t\t\t//\t reset the timer. \n\t\t\t\t\t\treinforcementTimer.handle = setTimeout(reinforcementTimer, REINFORCE_WINDOW) ;\n\t\t\t\t\t//}\n\t\t\t\t\tbreak ;\n\t\t\t\tcase DiffTimer.TIMEOUT_INTEREST_CACHE_PURGE :\n\t\t\t\t\tinterestCachePurge() ;\n\n\t\t\t\t\t/* if the size of the interestCache has become 0, there is no need for the timer. The timer will be set next time interestCache_insert is called. */\n\t\t\t\t\tif ( (interestCache.size() == 0) && (interestCache_purgeTimer.handle != null) )\n\t\t\t\t\t{\n\t\t\t\t\t\tcancelTimeout(interestCache_purgeTimer.handle) ;\n\t\t\t\t\t\tinterestCache_purgeTimer.setObject(null) ;\n\t\t\t\t\t\tinterestCache_purgeTimer.handle = null ; \n\t\t\t\t\t\tinterestCache_purgeTimer = null ;\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\t/* reset the timer. */\n\t\t\t\t\t\tinterestCache_purgeTimer.handle = setTimeout(interestCache_purgeTimer, INTEREST_CACHE_PURGE_INTERVAL) ;\n\t\t\t\t\t}\n\t\t\t\t\tbreak ;\n\t\t\t\tcase DiffTimer.TIMEOUT_DELAY_BROADCAST :\n\t\t\t\t\t\n\t\t\t\t\tif ( d.getObject() instanceof InterestPacket )\n\t\t\t\t\t{\n\t\t\t\t\t\tsendPacket((InterestPacket)(d.getObject()), 0.0) ;\n\t\t\t\t\t}\n\t\t\t\t\telse if ( d.getObject() instanceof DataPacket )\n\t\t\t\t\t{\n\t\t\t\t\t\tDataPacket dataPkt = (DataPacket)(d.getObject()) ;\n\t\t\t\t\t\tsendPacket(dataPkt, 0.0) ;\n\t\t\t\t\t}\n\t\t\t\t\telse if ( d.getObject() instanceof ReinforcementPacket )\n\t\t\t\t\t{\n\t\t\t\t\t\tReinforcementPacket pstvReinforcementPkt = (ReinforcementPacket)(d.getObject()) ;\n\t\t\t\t\t\tsendPacket(pstvReinforcementPkt, 0.0) ;\n\t\t\t\t\t}\n\t\t\t\t\tbreak ;\n\t\t\t\tcase DiffTimer.TIMEOUT_REFRESH_INTEREST :\n\t\t\t\t\t\n\t\t\t\t\tInteger I = (Integer)(d.getObject()) ;\n\t\t\t\t\tint taskId = I.intValue() ;\n\t\t\t\t\tTaskEntry taskEntry = activeTasksList.get(taskId) ;\n\t\t\t\t\tInterestPacket interest= taskEntry.getInterest();\n\t\t\t\t\t//if ( (getTime() - taskEntry.getStartTime()) <= interest.getDuration()) /* depends on getTime() - interest start time */\n\t\t\t\t\t//{\n\t\t\t\t\t\tif ( isDebugEnabled() )\n\t\t\t\t\t\t\tSystem.out.println(\"DiffApp \" + nid + \": Sending INTEREST packet at time \" + getTime()) ;\n\t\t\t\t\t\tinterest.setTimestamp(getTime());\n\t\t\t\t\t\tsendPacket(interest, 0.0 ) ;\n\t\t\t\t\t\tDiffTimer refresh_EVT = new DiffTimer(DiffTimer.TIMEOUT_REFRESH_INTEREST, new Integer(taskId)); \n\t\t\t\t\t\trefresh_EVT.handle = setTimeout(refresh_EVT, taskEntry.getRefreshPeriod()) ;\n\t\t\t\t\t/*}\n\t\t\t\t\telse if ( d.handle != null )\n\t\t\t\t\t{\n\t\t\t\t\t\t// The task state has to be purged from the node after the time indicated by the duration attribute. \n\t\t\t\t\t\tactiveTasksList.remove(taskId) ;\n\t\t\t\t\t}*/\n\t\t\t\t\tcancelTimeout(d.handle) ;\n\t\t\t\t\td.setObject(null) ;\n\t\t\t\t\td.handle = null ;\n\t\t\t\t\tbreak ;\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tmicroLearner.timeout(data_) ;\n\t\t} \n\t}","@Override\r\n public void run() {\n d2++;\r\n if (d2 == 1) {\r\n onReceive(new byte[]{Message.TIMER_MESSAGE, Message.TFP2_EXPIRE});\r\n }\r\n }","@Override\r\n public void run() {\n d1++;\r\n if (d1 == 1) {\r\n onReceive(new byte[]{Message.TIMER_MESSAGE, Message.TFP1_EXPIRE});\r\n }\r\n if (d1 == 10) {\r\n onReceive(new byte[]{Message.TIMER_MESSAGE, Message.TFP1_EXPIRE_N});\r\n }\r\n }","public void checkTimes(){\r\n\t\tcal = Calendar.getInstance();\r\n\t\t//if(alarmList.size() != 0){\r\n\t\tfor(int i = 0; i < alarmList.size(); i++){\r\n\t\t\tAlarmTime current = alarmList.get(i);\r\n\t\t\tif(current.getYear() == cal.get(Calendar.YEAR) && current.getMonth() == cal.get(Calendar.MONTH)\r\n\t\t\t\t\t&& current.getDay() == cal.get(Calendar.DAY_OF_MONTH) && current.getHour() == cal.get(Calendar.HOUR_OF_DAY)\r\n\t\t\t\t\t&& current.getMinute() <= cal.get(Calendar.MINUTE)){\r\n\t\t\t\t//display alarm / play sound\r\n\t\t\t\t\t//alarmList.get(i).setActive(true);\r\n\t\t\t\t\tcurrent.setActive(true);\r\n\t\t\t\t//if(!alarmList.get(i).isActive){\t\t\t\t\t//this can be removed if it needs to repeatedly go off\r\n\r\n//\t\t\t\t\tif(!(activeAlarms.contains(alarmList.get(i)))){\r\n//\t\t\t\t\t\tactiveAlarms.add(alarmList.get(i));\r\n//\t\t\t\t\t}\r\n\t\t\t\t\tif(!(activeAlarms.contains(current))){\r\n\t\t\t\t\t\tactiveAlarms.add(current);\r\n\t\t\t\t\t}\r\n\t\t\t\t\t\r\n\t\t\t\t\t//System.out.println(alarmList.get(i).getMinute());\r\n\t\t\t\t\t//System.out.println(current.getMinute());\r\n\t\t\t\t\tring = new AlarmRingDesign(alarmList.get(i).getMessage(), this, alarmList.get(i));\r\n\t\t\t\t\tring.init();\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t\telse{\r\n\t\t\t\t//do nothing\r\n\t\t\t}\r\n\t\t}\r\n\t//}\r\n\t}","public void onMonitor(double timestamp, double startTime){\n\t\n\t\tif(timestamp < startTime) {\n\t\t\t//don't start lagging before the start time\n\t\t\t//clear the logs\n\t\t\tlog.clear(); \n\t\t\treturn;\n\t\t}\n\n\t\t//count the number of waiting requests\n\t\tdouble w = 0;\n\t\tfor(Request r: queue){\n\t\t\tif(r.isWaiting()) w++;\n\t\t}\n\t\t\n\t\tSystem.out.println(\"Monitor Event at time:\" + timestamp);\n\t\tSystem.out.println(\"---------------------\");\n\t\tdouble[] qAndW = new double[2];\n\t\tqAndW[0] = queue.size();\n\t\tqAndW[1] = w;\n\t\t\n\t\tQandW.add(qAndW);\n\t\t\t\t\n\t}","@Override\n\tprotected void onHandleIntent(final Intent intent) {\n\t\ttimeFromNow = intent.getExtras().getFloat(\"timeFromNow\");\n\t\tLog.i(\"LocalNotification\", \"scheduleNotification -> timeFromNow: \" + timeFromNow);\n \tTimer t = new Timer(); \n\t\tTimerTask task = new TimerTask() {\n\t\t\t@Override\n\t\t\tpublic void run() { \n\t\t\t\tcreateNotif(intent);\n\t\t\t}\n\t\t};\n\t\tt.schedule(task, (long) (timeFromNow*1000));\n\t}","@Override\n public void run() {\n time_ = (int) (System.currentTimeMillis() - startTime_) / 1000;\n updateUI();\n\n if (time_ >= maxTime_) {\n // Log.v(VUphone.tag, \"TimerTask.run() entering timeout\");\n handler_.post(new Runnable() {\n public void run() {\n report(true);\n }\n });\n }\n }","private void renewTimes() {\n String time_morgens_new = time_prefs.getString(\"time_morgens\", getResources().getString(R.string.default_morgens));\n String time_mittags_new = time_prefs.getString(\"time_mittags\", getResources().getString(R.string.default_mittags));\n String time_abends_new = time_prefs.getString(\"time_abends\", getResources().getString(R.string.default_abends));\n String time_zur_nacht_new = time_prefs.getString(\"time_morgens\", getResources().getString(R.string.default_morgens));\n /*comparison of class local time variblaes with new Preferences\n deletes alarms affected medicines and creates new alarms for them\n */\n\n if (!time_morgens.equals(time_morgens_new)) {\n //list all affected Meds and iterate for each\n List<Meds> meds = Meds.find(Meds.class, \"time = ?\", \"Morgens\");\n for (Meds m : meds) {\n if (!m.getDays().equals(\"\")) {\n cancelAlarm(m.getId());\n }\n }\n\n for (Meds m : meds) {\n if (!m.getDays().equals(\"\")) {\n createAlarm(m.getDays(), m.getTime(), m.getId());\n }\n }\n }\n\n if (!time_mittags.equals(time_mittags_new)) {\n List<Meds> meds = Meds.find(Meds.class, \"time = ?\", \"Mittags\");\n for (Meds m : meds) {\n if (!m.getDays().equals(\"\")) {\n cancelAlarm(m.getId());\n }\n }\n\n for (Meds m : meds) {\n if (!m.getDays().equals(\"\")) {\n createAlarm(m.getDays(), m.getTime(), m.getId());\n }\n }\n }\n if (!time_abends.equals(time_abends_new)) {\n List<Meds> meds = Meds.find(Meds.class, \"time = ?\", \"Abends\");\n for (Meds m : meds) {\n if (!m.getDays().equals(\"\")) {\n cancelAlarm(m.getId());\n }\n }\n\n for (Meds m : meds) {\n if (!m.getDays().equals(\"\")) {\n createAlarm(m.getDays(), m.getTime(), m.getId());\n }\n }\n }\n if (!time_zur_nacht.equals(time_zur_nacht_new)) {\n List<Meds> meds = Meds.find(Meds.class, \"time = ?\", \"Morgens\");\n for (Meds m : meds) {\n if (!m.getDays().equals(\"\")) {\n cancelAlarm(m.getId());\n }\n }\n\n for (Meds m : meds) {\n if (!m.getDays().equals(\"\")) {\n createAlarm(m.getDays(), m.getTime(), m.getId());\n }\n }\n }\n }","@Override\n protected void onHandleIntent(Intent intent) {\n retrieveValues();\n Resources res = getResources();\n\n if(!swearNegative && !swearNeutral && !swearPositive){\n SwearNotification.notify(this, res.getString(R.string.noTypeSelected) + \"No swears will follow!\", -1);\n return;\n }\n\n negative = res.getStringArray(R.array.negative);\n neutral = res.getStringArray(R.array.neutral);\n positive = res.getStringArray(R.array.positive);\n\n rand = new Random();\n\n swearTimer = new Timer(\"swearTimer\", true);\n swearTimer.schedule(new swearTask(), getDelay());\n// SwearNotification.notify(context,\"minTime:\"+Integer.toString(minTime) + \", maxTime:\"+Integer.toString(maxTime)+\",delay:\"+Long.toString(getDelay()),-1);\n\n }","@Override\n public void run() {\n\n try {\n LocalDateTime now = LocalDateTime.now();\n voda bot = new voda();\n\n List<Integer> notifyTime = Arrays.asList(7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23);\n int currentHour = now.getHour();\n\n ArrayList<Integer> consulted = dbmodel.MysqlCon.getFollowers();\n\n for (Integer ntime : notifyTime) {\n if (ntime == currentHour) {\n for (Integer consultedUser : consulted) {\n bot.sendTextToIdMessage(consultedUser, dbmodel.MysqlCon.getEveryDayWaterUserWaterCountView(consultedUser));\n }\n }\n }\n\n\n } catch (Exception e) {\n System.out.println();\n }\n }","@Override\n\t\t\t\tpublic void run() {\n\t\t\t\t\tlong nowTime = System.currentTimeMillis();\n\t\t\t\t\t//Logger.debug(\"测试主动回答线程================================系统时间\" + nowTime);\n\t\t\t\t\tif (nowTime - mIStartTime <= timeNum + 1000 && nowTime - mIStartTime >= timeNum) {\n\t\t\t\t\t\tmICount++;\n\t\t\t\t\t\tcall.OnEnd();\n\t\t\t\t\t\tsetStartTime(nowTime);\n\t\t\t\t\t\tthis.cancel();\n\t\t\t\t\t}\n\t\t\t\t}","@Override\n public void startTimeLoop() {\n MyLog.log(\"startTimeLoop::\");\n // handler.sendEmptyMessage(5);\n }","@Override\n public void run() {\n\n SimpleDateFormat sdf = new SimpleDateFormat(\"hh:mm aa\",\n Locale.getDefault());\n String formattedTime = sdf.format(System.currentTimeMillis());\n tvAlarmTime.setText(formattedTime);\n\n tvAlarmTitle.setText(R.string.snoozed_alarm);\n }","public static void registerReceiver(Context context) {\n\n //Get the milliseconds for next hour\n Calendar calendar = Calendar.getInstance(TimeZone.getDefault());\n calendar.setTimeZone(TimeZone.getTimeZone(\"Asia/Calcutta\"));\n calendar.add(Calendar.HOUR_OF_DAY, 1);\n calendar.set(Calendar.MINUTE, 0);\n calendar.set(Calendar.SECOND, 0);\n calendar.set(Calendar.MILLISECOND, 0);\n\n //Prepare the pending intent\n PendingIntent pendingIntent = PendingIntent.getBroadcast(context,\n REA_CODE_PENDING_INTENT,\n new Intent(context, TimeReminderReceiver.class),\n PendingIntent.FLAG_UPDATE_CURRENT);\n\n //Set the alarm\n AlarmManager alarmManager = (AlarmManager) context.getSystemService(Context.ALARM_SERVICE);\n if (Build.VERSION.SDK_INT >= Build.VERSION_CODES.M) {\n alarmManager.setExactAndAllowWhileIdle(AlarmManager.RTC, calendar.getTimeInMillis(), pendingIntent);\n } else {\n alarmManager.setExact(AlarmManager.RTC, calendar.getTimeInMillis(), pendingIntent);\n }\n\n Log.d(TAG, \"registerReceiver: Next alarm registered.\");\n }","public void handleRecordTime(int type, long time) {\n if (type == 4) {\n this.mFingerDown = time;\n } else if (type == 5) {\n this.mFingerSuccess = time;\n } else if (this.mStartTime != 0) {\n if (type != 0) {\n if (type != 1) {\n if (type != 2) {\n if (type != 3) {\n if (type != 6) {\n if (type != 7) {\n if (type == 8 && this.mKeyExitAnim == 0 && this.mKeyGoingAway > 0) {\n this.mKeyExitAnim = time;\n }\n } else if (this.mKeyGoingAway == 0) {\n this.mKeyGoingAway = time;\n }\n } else if (this.mKeyguardDrawn == 0 && this.mBlockScreenOnBegin > 0) {\n this.mKeyguardDrawn = time;\n }\n } else if (this.mBlockScreenOnEnd == 0 && this.mBlockScreenOnBegin > 0) {\n this.mBlockScreenOnEnd = time;\n }\n } else if (this.mBlockScreenOnBegin == 0) {\n this.mBlockScreenOnBegin = time;\n }\n } else if (this.mSetDisplayStateEnd == 0 && this.mSetDisplayStateBegin > 0) {\n this.mSetDisplayStateEnd = time;\n }\n } else if (this.mSetDisplayStateBegin == 0) {\n this.mSetDisplayStateBegin = time;\n }\n }\n }","@Override\n\tprotected void onResume() {\n\t\t super.onResume();\n\t\t registerReceiver(timerec, new IntentFilter(\"in.ac.srmuniv.displaytime\"));\n\t}","public void processTransmissionTimeout() {\n //to be overridden by extending classes\n }","public void doWork() {\r\n runOnUiThread(new Runnable() {\r\n @SuppressWarnings(\"deprecation\")\r\n public void run() {\r\n try{\r\n TextView txtCurrentTime= (TextView)findViewById(R.id.time);\r\n Date dt = new Date();\r\n int hours = dt.getHours();\r\n int minutes = dt.getMinutes();\r\n int seconds = dt.getSeconds();\r\n\r\n String time = \"AM\";\r\n String min = Integer.toString(minutes);\r\n String sec =Integer.toString(seconds);\r\n\r\n if (hours > 12) {\r\n hours = hours - 12;\r\n time = \"PM\";\r\n }\r\n if (hours == 12)\r\n {\r\n time = \"PM\";\r\n }\r\n if (minutes < 10){\r\n DecimalFormat formatter = new DecimalFormat(\"00\");\r\n min = formatter.format(minutes);\r\n }\r\n if (seconds < 10){\r\n DecimalFormat formatter = new DecimalFormat(\"00\");\r\n sec = formatter.format(seconds);\r\n }\r\n String curTime = hours + \":\" + min + \":\" + sec;\r\n txtCurrentTime.setText(\"Current Time: \" + curTime + \" \" + time);\r\n\r\n int i=0, x=0;\r\n for (String temp [] : stops){\r\n int size = temp.length;\r\n\r\n Log.i(\"StopsActivity_x\", \"x is: \" + x);\r\n for (i=2; i<size; i++){\r\n\r\n if (temp[i].contains (\"AM\") || temp[i].contains (\"PM\")){\r\n\r\n Log.i(\"StopsActivity_x\", \"temp is: \" + temp[i]);\r\n //Log.i(\"StopsActivity_stops\", temp[i]);\r\n String split[] = temp[i].split(\":\");\r\n int stopTime = Integer.parseInt(split[0]);\r\n\r\n if (split[1].contains(\"PM\") && stopTime != 12) {\r\n stopTime = stopTime + 12;\r\n } else if (split[1].contains(\"AM\") && stopTime == 12)\r\n stopTime = 0;\r\n\r\n //Log.i(\"StopsActivity_test\", \"12-hour time is: \" + split[0] + \" 24 hour time is: \" + stopTime);\r\n\r\n int currHour = hours;\r\n\r\n if (time.contains(\"PM\") && currHour != 12) {\r\n currHour = currHour + 12;\r\n } else if (time.contains(\"AM\") && currHour == 12)\r\n currHour = 0;\r\n\r\n //Log.i(\"StopsActivity_test\", \"12-hour current time is: \" + hours + \" 24 hour current time is: \" + currHour);\r\n\r\n Log.i (\"StopsActivity_x\", \"stopTime is: \" + stopTime + \" and currHour is: \" + currHour);\r\n if (stopTime == currHour) {\r\n\r\n String busSplit[] = split[1].split(\" \");\r\n\r\n int curMin = Integer.parseInt(min);\r\n int busMin = Integer.parseInt(busSplit[0]);\r\n\r\n if (busMin > curMin) {\r\n String des = \"Next Bus at: \" + temp[i];\r\n routeItems.get(x).setRouteDescription(des);\r\n //TextView nextTime = (TextView) view.findViewById(R.id.nextbus);\r\n //nextTime.setText(\"Next Bus at: \" + temp[i]);\r\n break;\r\n }\r\n }\r\n else if (stopTime > currHour) {\r\n\r\n //TextView nextTime = (TextView) view.findViewById(R.id.nextbus);\r\n //nextTime.setText(\"Next Bus at: \" + temp[i]);\r\n String des = \"Next Bus at: \" + temp[i];\r\n routeItems.get(x).setRouteDescription(des);\r\n break;\r\n }\r\n }\r\n }\r\n x++;\r\n }\r\n }\r\n catch (Exception e) {}\r\n }\r\n });\r\n }","public void timeChanged();","@Override\n\t\t\tpublic void doTimerCheckWork() {\n\n\t\t\t\tif (CommonUtil.isWifiApEnabled(mWifiManager)) {\n\t\t\t\t\tLog.v(TAG, \"Wifi enabled success!\");\n\t\t\t\t\tIntent intentService = new Intent(mContext,\n\t\t\t\t\t\t\tProcessMsgService.class);\n\t\t\t\t\tmContext.startService(intentService);\n\t\t\t\t\tString action = Constants.ACTION_HOTSPOT_AVAILABLE;\n\t\t\t\t\tIntent intent = new Intent(action);\n\t\t\t\t\tmContext.sendBroadcast(intent);\n\t\t\t\t\tthis.exit();\n\t\t\t\t} else {\n\t\t\t\t\tString action = Constants.ACTION_HOTSPOT_UNAVAILABLE;\n\t\t\t\t\tIntent intent = new Intent(action);\n\t\t\t\t\tmContext.sendBroadcast(intent);\n\t\t\t\t\tLog.v(TAG, \"Wifi enabled failed!\");\n\t\t\t\t}\n\t\t\t}","@Override\n\tpublic void onReceive(final Context context, Intent intent) {\n\t\tLog.i(\"msg\", \"new message\");\n\t\tif (Constants.MoShi==3) {\n\t\t\tnew Thread(){\n\t\t\t\tpublic void run() {\n\t\t\t\t\ttry {\n\t\t\t\t\t\tsleep(3000);\n\t\t\t\t\t} catch (InterruptedException e) {\n\t\t\t\t\t\t// TODO Auto-generated catch block\n\t\t\t\t\t\te.printStackTrace();\n\t\t\t\t\t}\n\t\t\t\t\tSmsDao smsdao = new SmsDao(context);\n\t\t\t\t\tMap<String, String> data = smsdao.getSmsData();\n\t\t\t\t\t\n\t\t\t\t\tIntent itent = new Intent(Constants.ACTION_RING);\n\t\t\t\t\tif (data != null) {\n\t\t\t\t\t\titent.putExtra(\"data\", Constants.SMSINFO);\n\t\t\t\t\t\titent.putExtra(\"person\", data.get(\"person\"));\n\t\t\t\t\t\titent.putExtra(\"body\", data.get(\"body\"));\n\t\t\t\t\t}\n\n\t\t\t\t\tcontext.sendBroadcast(itent);\n\t\t\t\t};\n\t\t\t\t\n\t\t\t}.start();\n\t\t}\n\t\t\n\t\t\n\t}","@Override\n public void onReceive(Context context, Intent intent) {\n\n boolean isAlarmOn = Utils.isAlarmOn();\n PollService.setServiceAlarm(MyApplication.getContext(), isAlarmOn);\n }","public void buffTimer() {\r\n if (seconds - lastBuffCheck >= 1) {\r\n lastBuffCheck = seconds;\r\n for (int i = 0; i < buffs.size(); i++) {\r\n buffs.set(i, buffs.get(i)-1);\r\n if (buffs.get(i) <= 0) {\r\n buffs.remove(i);\r\n }\r\n }\r\n } else if (seconds < lastBuffCheck) {\r\n lastBuffCheck = 0;\r\n }\r\n }","private int micRecTime(long freeSpace) {\n\n return (int) (freeSpace / 5898240);\n }","@Override\n public void onReceive(Context context, Intent intent) {\n mContext = context;\n systems = new Systems(context);\n mCalendar = new GregorianCalendar();\n mManager = (AlarmManager)context.getSystemService(Context.ALARM_SERVICE);\n\n // Check Connected Network\n if(systems.isNetworkAvailable(context))\n {\n try {\n if(!systems.getFarDay(0).equals(systems.getString(\"WheatherAlarmDate\", \"null\"))) {\n // Get Local Weather : Reh\n LocalWeather localWeather = new LocalWeather(context);\n String Reh = localWeather.execute().get();\n\n // Check Reh Value is Valid?\n if (Reh != null) {\n // get Preference Setting Value\n SharedPreferences prefs = PreferenceManager.getDefaultSharedPreferences(context);\n boolean vibrate = prefs.getBoolean(\"Setting_Vibrate\", true);\n boolean sound = prefs.getBoolean(\"Setting_Sound\", true);\n\n // Set Auto WaterGoal\n if (prefs.getBoolean(\"Setting_AutoGoal\", true)) {\n int recommandAmount = systems.getInt(\"userWeight\", 60) * 30 + (500 - Integer.parseInt(Reh) * 3);\n systems.putString(\"WaterGoal\", String.valueOf(recommandAmount));\n\n // Send Notification\n if (prefs.getBoolean(\"Setting_AutoGoalPush\", true))\n systems.sendNotification(\"물 한잔 해요\", \"오늘의 습도 : \" + Reh + \"%, 목표 섭취량 : \" + recommandAmount + \"ml\", 1, vibrate, sound);\n }\n\n // Save Reh Data\n systems.putString(\"Reh\", Reh);\n\n // Cancel this Alarm\n mManager.cancel(pendingIntent(requestC));\n\n // Set Next Alarm\n mCalendar.set(mCalendar.get(Calendar.YEAR), mCalendar.get(Calendar.MONTH), mCalendar.get(Calendar.DAY_OF_MONTH), 7, 0);\n mCalendar.add(Calendar.DATE, 1);\n mManager.setInexactRepeating(AlarmManager.RTC_WAKEUP, mCalendar.getTimeInMillis(), 1200 * 1000, pendingIntent(requestC));\n\n // Set Preference\n systems.putString(\"WheatherAlarmDate\", systems.getFarDay(0));\n }\n }\n }\n catch (Exception e){\n // Network Error\n }\n }\n }","@Override\n public void run() {\n if (timerValidFlag)\n gSeconds++;\n Message message = new Message();\n message.what = 1;\n handler.sendMessage(message);\n }","@Override\r\n public void run() {\n d5++;\r\n if (d5 == 1) {\r\n onReceive(new byte[]{Message.TIMER_MESSAGE, Message.TFP5_EXPIRE});\r\n }\r\n\r\n }","public void timeToCheckWorker() {\n notifyCanMove(this.getCurrentTurn().getCurrentPlayer());\n }","private void handleCallKill() {\n Trace.traceBegin(8, \"bufferLowToKill\");\n long curTime = System.currentTimeMillis();\n long j = lastCallKillTime;\n if (curTime < j || curTime - j >= 1000) {\n lastCallKillTime = curTime;\n Slog.i(TAG, \"buffer low too long, zswapd keep fail, call kill\");\n KillDecision.getInstance().killApplicationWithZswapdPresure(false);\n Trace.traceEnd(8);\n return;\n }\n Slog.i(TAG, \"buffer low too long, kill too frequently\" + lastCallKillTime + AwarenessInnerConstants.DASH_KEY + curTime);\n Trace.traceEnd(8);\n }","public Date getReceiveTime() {\r\n return receiveTime;\r\n }","@Override\n public void onTimePicked() {\n }","protected void onDestroy(){\n super.onDestroy();\n LocalBroadcastManager.getInstance(this).unregisterReceiver(timeReceiver);\n }","public Date getReceiveTime() {\n return receiveTime;\n }","private void setupMsgBroadcastReceiver() {\n broadcastReceiverLoraMsg = new BroadcastReceiver() {\n @Override\n public void onReceive(Context context, Intent intent) {\n if (\"com.example.loravisual.MSG_RECEIVED\".equals(intent.getAction())) {\n byte[] bytes = intent.getByteArrayExtra(\"com.example.loravisual.MSG\");\n\n String totalNumber = Integer.toString(bytes[11] + (bytes[10] * multipliers[5])); // + correct total message number calculated from two ble transmitted bytes (#msg number in iteration = [11], (#iteration = [10])\n String msg = new String(bytes).substring(0, 10); // msg = header (ble transmitted from board as string\n\n if (colorToggle) {\n msgTextView.setTextColor(getResources().getColor(R.color.colorPrimaryDark, null));\n } else {\n msgTextView.setTextColor(getResources().getColor(R.color.white, null));\n }\n colorToggle = !colorToggle;\n msgTextView.setText(msg + \" (\" + totalNumber + \")\");\n\n if (dbEntries == null) {\n dbEntries = new String[5];\n dbEntries[0] = totalNumber;\n dbEntries[1] = msg;\n } else {\n dbEntries[0] = totalNumber;\n dbEntries[1] = msg;\n databaseHandler.logReceivedTransmission(Integer.toString(experimentNumber), dbEntries);\n dbEntries = null;\n }\n }\n }\n };\n IntentFilter filter = new IntentFilter(\"com.example.loravisual.MSG_RECEIVED\");\n registerReceiver(broadcastReceiverLoraMsg, filter);\n }","@Override\r\n\tpublic void onReceive(Context context, Intent intent) {\n\t\tVibrator v = (Vibrator) context\r\n\t\t\t\t.getSystemService(Context.VIBRATOR_SERVICE);\r\n\t\tv.vibrate(500);\r\n\r\n\t\t// also display a toast.\r\n\t\tToast.makeText(context, \"Boradcast received successfully\",\r\n\t\t\t\tToast.LENGTH_LONG).show();\r\n\t}","public void run() {\n\t\t\tCalendar c = new GregorianCalendar();\n\t\t\tcurrHour = c.get(Calendar.HOUR);\n\t\t\tcurrMin = String.valueOf(c.get(Calendar.MINUTE));\n\t\t\tif(currMin.length()==1) {\n\t\t\t\tcurrMin = \"0\"+currMin;\n\t\t\t}\n\t\t\tcheckAlarm();\n\t\t}","@Override\n\t\tpublic void onReceive(Context arg0, Intent intent) {\n\t\t\tif(intent.getAction().equals(Constants.P2P.ACK_GET_SD_CARD_CAPACITY)){\n\t\t\t\tint result = intent.getIntExtra(\"result\", -1);\n\t\t\t\tif(result==Constants.P2P_SET.ACK_RESULT.ACK_PWD_ERROR){\n\t\t\t\t\t\n\t\t\t\t\tIntent i = new Intent();\n\t\t\t\t\ti.setAction(Constants.Action.CONTROL_SETTING_PWD_ERROR);\n\t\t\t\t\tmContext.sendBroadcast(i);\n\t\t\t\t\t\n\t\t\t\t}else if(result==Constants.P2P_SET.ACK_RESULT.ACK_NET_ERROR){\n\t\t\t\t\tLog.e(\"my\",\"net error resend:get npc time\");\n\t\t\t\t\tP2PHandler.getInstance().getSdCardCapacity(contact.contactId, contact.contactPassword,command);\n\t\t\t\t}\n\t\t\t}else if(intent.getAction().equals(Constants.P2P.RET_GET_SD_CARD_CAPACITY)){\n\t\t\t\tint total_capacity=intent.getIntExtra(\"total_capacity\",-1);\n\t\t\t\tint remain_capacity=intent.getIntExtra(\"remain_capacity\",-1);\n\t\t\t\tint state=intent.getIntExtra(\"state\",-1);\n\t\t\t\tSDcardId=intent.getIntExtra(\"SDcardID\",-1);\n\t\t\t\tString id=Integer.toBinaryString(SDcardId);\n\t\t\t\tLog.e(\"id\",\"msga\"+id);\n\t\t\t\twhile(id.length()<8){\n\t\t\t\t\tid=\"0\"+id;\n\t\t\t\t}\n\t\t\t\tchar index=id.charAt(3);\n\t\t\t\tLog.e(\"id\",\"msgb\"+id);\n\t\t\t\tLog.e(\"id\",\"msgc\"+index);\n\t\t\t\tif(state==1){\n\t\t\t\t\tif(index=='1'){\n\t\t\t\t\t\tsdId=SDcardId;\n\t\t\t\t\t\ttv_total_capacity.setText(String.valueOf(total_capacity)+\"M\");\n\t\t\t\t\t\ttv_sd_remainning_capacity.setText(String.valueOf(remain_capacity)+\"M\");\n\t\t\t\t\t\tshowSDImg();\n\t\t\t\t\t}else if(index=='0'){\n\t\t\t\t\t\tusbId=SDcardId;\n\t\t\t\t\t tv_usb_total_capacity.setText(String.valueOf(total_capacity)+\"M\");\n\t\t\t\t\t\ttv_usb_remainning_capacity.setText(String.valueOf(remain_capacity)+\"M\");\n\t\t\t\t\t}\n\t\t\t\t}else{\n//\t\t\t\t\t count++;\n//\t\t\t\t\t if(contact.contactType==P2PValue.DeviceType.IPC){\n//\t\t\t\t\t \tif(count==1){\n//\t\t\t\t\t \t\tIntent back = new Intent();\n//\t\t\t\t\t\t\t\tback.setAction(Constants.Action.REPLACE_MAIN_CONTROL);\n//\t\t\t\t\t\t\t\tmContext.sendBroadcast(back);\n//\t\t\t\t\t\t\t\tT.showShort(mContext,R.string.sd_no_exist);\n//\t\t\t\t\t \t}\n//\t\t\t\t\t }else{\n//\t\t\t\t\t \tif(count==2){\n//\t\t\t\t\t \t\tIntent back = new Intent();\n//\t\t\t\t\t\t\t\tback.setAction(Constants.Action.REPLACE_MAIN_CONTROL);\n//\t\t\t\t\t\t\t\tmContext.sendBroadcast(back);\n//\t\t\t\t\t\t\t\tT.showShort(mContext,R.string.sd_no_exist);\n//\t\t\t\t\t \t}\n//\t\t\t\t\t }\n\t\t\t\t\tIntent back = new Intent();\n\t\t\t\t\tback.setAction(Constants.Action.REPLACE_MAIN_CONTROL);\n\t\t\t\t\tmContext.sendBroadcast(back);\n\t\t\t\t\tT.showShort(mContext,R.string.sd_no_exist);\n\t\t\t }\n\t\t\t}else if(intent.getAction().equals(Constants.P2P.ACK_GET_SD_CARD_FORMAT)){\n\t\t\t\tint result = intent.getIntExtra(\"result\", -1);\n\t\t\t\tif(result==Constants.P2P_SET.ACK_RESULT.ACK_PWD_ERROR){\n\t\t\t\t\t\n\t\t\t\t\tIntent i = new Intent();\n\t\t\t\t\ti.setAction(Constants.Action.CONTROL_SETTING_PWD_ERROR);\n\t\t\t\t\tmContext.sendBroadcast(i);\n\t\t\t\t\t\n\t\t\t\t}else if(result==Constants.P2P_SET.ACK_RESULT.ACK_NET_ERROR){\n\t\t\t\t\tLog.e(\"my\",\"net error resend:get npc time\");\n\t\t\t\t\tP2PHandler.getInstance().setSdFormat(contact.contactId, contact.contactPassword, sdId);\n\t\t\t\t}\n\t\t\t}else if(intent.getAction().equals(Constants.P2P.RET_GET_SD_CARD_FORMAT)){\n\t\t\t\tint result=intent.getIntExtra(\"result\", -1);\n\t\t\t if(result==Constants.P2P_SET.SD_FORMAT.SD_CARD_SUCCESS){\n\t\t\t \tT.showShort(mContext, R.string.sd_format_success);\n\t\t\t }else if(result==Constants.P2P_SET.SD_FORMAT.SD_CARD_FAIL){\n\t\t\t \tT.showShort(mContext, R.string.sd_format_fail);\n\t\t\t }else if(result==Constants.P2P_SET.SD_FORMAT.SD_NO_EXIST){\n\t\t\t \tT.showShort(mContext,R.string.sd_no_exist);\n\t\t\t }\n\t\t\t showSDImg();\n\t\t\t}else if(intent.getAction().equals(Constants.P2P.RET_GET_USB_CAPACITY)){\n\t\t\t\tint total_capacity=intent.getIntExtra(\"total_capacity\",-1);\n\t\t\t\tint remain_capacity=intent.getIntExtra(\"remain_capacity\",-1);\n\t\t\t\tint state=intent.getIntExtra(\"state\",-1);\n\t\t\t\tSDcardId=intent.getIntExtra(\"SDcardID\",-1);\n\t\t\t\tString id=Integer.toBinaryString(SDcardId);\n\t\t\t\tLog.e(\"id\",\"msga\"+id);\n\t\t\t\twhile(id.length()<8){\n\t\t\t\t\tid=\"0\"+id;\n\t\t\t\t}\n\t\t\t\tchar index=id.charAt(3);\n\t\t\t\tLog.e(\"id\",\"msgb\"+id);\n\t\t\t\tLog.e(\"id\",\"msgc\"+index);\n\t\t\t\tif(state==1){\n\t\t\t\t\tif(index=='1'){\n\t\t\t\t\t\tsdId=SDcardId;\n\t\t\t\t\t\ttv_total_capacity.setText(String.valueOf(total_capacity)+\"M\");\n\t\t\t\t\t\ttv_sd_remainning_capacity.setText(String.valueOf(remain_capacity)+\"M\");\n\t\t\t\t\t\tshowSDImg();\n\t\t\t\t\t}else if(index=='0'){\n\t\t\t\t\t\tusbId=SDcardId;\n\t\t\t\t\t tv_usb_total_capacity.setText(String.valueOf(total_capacity)+\"M\");\n\t\t\t\t\t\ttv_usb_remainning_capacity.setText(String.valueOf(remain_capacity)+\"M\");\n\t\t\t\t\t}\n\t\t\t\t}else{\n\t\t\t\t\t count++;\n\t\t\t\t\t if(contact.contactType==P2PValue.DeviceType.IPC){\n\t\t\t\t\t \tif(count==1){\n\t\t\t\t\t \t\tIntent back = new Intent();\n\t\t\t\t\t\t\t\tback.setAction(Constants.Action.REPLACE_MAIN_CONTROL);\n\t\t\t\t\t\t\t\tmContext.sendBroadcast(back);\n\t\t\t\t\t\t\t\tT.showShort(mContext,R.string.sd_no_exist);\n\t\t\t\t\t \t}\n\t\t\t\t\t }else{\n\t\t\t\t\t \tif(count==2){\n\t\t\t\t\t \t\tIntent back = new Intent();\n\t\t\t\t\t\t\t\tback.setAction(Constants.Action.REPLACE_MAIN_CONTROL);\n\t\t\t\t\t\t\t\tmContext.sendBroadcast(back);\n\t\t\t\t\t\t\t\tT.showShort(mContext,R.string.sd_no_exist);\n\t\t\t\t\t \t}\n\t\t\t\t\t }\n\t\t\t\t}\n\t\t\t}else if(intent.getAction().equals(Constants.P2P.RET_DEVICE_NOT_SUPPORT)){\n\t\t\t\tIntent back = new Intent();\n\t\t\t\tback.setAction(Constants.Action.REPLACE_MAIN_CONTROL);\n\t\t\t\tmContext.sendBroadcast(back);\n\t\t\t\tT.showShort(mContext,R.string.not_support);\n\t\t\t}\n\t\t}","@Override\n\tpublic void onReceive(Context arg0, Intent arg1) {\n\t\tString message;\n\t\t//check if facebook object exists? if not recreate it\n\t\t\n\t\tcheckFacebookExists(arg0);\n\t\t\n\t\t\t\t//count for friend to reach 30 ie check every 30 minutes for new friend joining\n\t\tcountForFriend++;\n\t\t\n\t\t\n\t\t//notification preference to store data related to notification , stores if birthdays are given\n\t\t\n\t\tdoBirthdayNotificationPreProcessing(arg0);\n\t\t\n\n\t\tif (isInternetAvailable(arg0)) {\n\t\t\n\t\t\t\tif (BIRTHDAYGIFTNOTGIVEN) {\n\t\t\t\t\tdoBirthdayNotification(arg0);\n\n\t\t\t\t}\n\t\t\t\n\n\t\t\tif (countForFriend == DURATIONFORFRIENDCHECK) {\n\t\t\t\tfriendNotification(arg0);\n\t\t\t}\n\t\t\t/*\n\t\t\t * if (countForEvent == DURATIONFOREVENTCHECK) {\n\t\t\t * \n\t\t\t * message = runCommand(arg0, EVENT); if\n\t\t\t * (!(message.equalsIgnoreCase(lastEventMessage))) { if\n\t\t\t * (!message.equalsIgnoreCase(EMPTYSTRING)) { lastEventMessage =\n\t\t\t * message; String sendmessage = message + BIRTHDAY;\n\t\t\t * \n\t\t\t * \n\t\t\t * makeNotifications(sendmessage, arg0);\n\t\t\t * \n\t\t\t * } } }\n\t\t\t */\n\t\t\tif (countForFriend != 0) {\n\t\t\t\tgiftNotification(arg0);\n\t\t\t}\n\t\t}\n\t}","public void passTime(){\n growPop();\n growGdp();\n growSocial();\n growLiving();\n }","void updateNextUnblockTime(int t);","private void onPingingTimerTick()\r\n {\r\n EneterTrace aTrace = EneterTrace.entering();\r\n try\r\n {\r\n try\r\n {\r\n myConnectionManipulatorLock.lock();\r\n try\r\n {\r\n // Send the ping message.\r\n myUnderlyingOutputChannel.sendMessage(myPreserializedPingMessage);\r\n\r\n // Schedule the next ping.\r\n myPingingTimer.change(myPingFrequency);\r\n }\r\n finally\r\n {\r\n myConnectionManipulatorLock.unlock();\r\n }\r\n }\r\n catch (Exception err)\r\n {\r\n // The sending of the ping message failed - the connection is broken.\r\n cleanAfterConnection(true, true);\r\n }\r\n }\r\n finally\r\n {\r\n EneterTrace.leaving(aTrace);\r\n }\r\n }","@Override\n\tpublic void run() {\n\t\tsuper.run();\n\t\twhile(isrun&&handler!=null){\n\t\t\ttry {\n\t\t\t\tMessage msg=handler.obtainMessage(timeupdate, new Date());\n\t\t\t\thandler.sendMessage(msg);\n\t\t\t\tThread.sleep(1000);\n\t\t\t} catch (InterruptedException e) {\n\t\t\t\t// TODO Auto-generated catch block\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t}\n\t}"],"string":"[\n \"@Override\\n public void onReceive(Context context, Intent intent) {\\n ArrayList<String> key=intent.getStringArrayListExtra(\\\"time\\\");\\n Calendar calendar = Calendar.getInstance();\\n int hours = calendar.get(Calendar.HOUR_OF_DAY);\\n int minutes = calendar.get(Calendar.MINUTE);\\n Toast.makeText(context, String.valueOf(key.size()), Toast.LENGTH_LONG).show();\\n /*if (Data.size()>0) {\\n Toast.makeText(context, Data.get(0), Toast.LENGTH_LONG).show();\\n /*int hour = Integer.valueOf(Data.get(0).substring(0, Data.get(0).indexOf(\\\":\\\")));\\n int minute = Integer.valueOf(Data.get(0).substring(Data.get(0).indexOf(\\\":\\\")));\\n if ((hours == hour) && (minutes == minute))\\n try {\\n play(context, R.raw.girlfart01);//vibrator.vibrate(2000);Vibrator vibrator = (Vibrator) context.getSystemService(Context.VIBRATOR_SERVICE);\\n Data.remove(0);\\n Data.remove(1);\\n } catch (IOException e) {\\n e.printStackTrace();\\n }\\n }*/\\n Log.v(this.getClass().getName(), \\\"Timed alarm onReceive() started at time: \\\" + new java.sql.Timestamp(System.currentTimeMillis()).toString());\\n }\",\n \"private void handleTimeUpdate() {\\n Assert.isMainThread();\\n Log.d(\\\"KeyguardUpdateMonitor\\\", \\\"handleTimeUpdate\\\");\\n for (int i = 0; i < this.mCallbacks.size(); i++) {\\n KeyguardUpdateMonitorCallback keyguardUpdateMonitorCallback = this.mCallbacks.get(i).get();\\n if (keyguardUpdateMonitorCallback != null) {\\n keyguardUpdateMonitorCallback.onTimeChanged();\\n }\\n }\\n }\",\n \"public void onTimeTick() {\\n tick++;\\n try {\\n sendBeaconLog(10);\\n } catch (InterruptedException e) {\\n }\\n if (tick % 10 == 0) {\\n sendDirectedPresence();\\n }\\n }\",\n \"@Override\\n public void onReceive(Context context, Intent intent) {\\n try {\\n float[] message1 = intent.getFloatArrayExtra(\\\"HR\\\");\\n int message2 = intent.getIntExtra(\\\"ACCR\\\", 0);\\n int sensorType = intent.getIntExtra(\\\"SENSOR_TYPE\\\", 0);\\n isRunning = intent.getBooleanExtra(\\\"IS_RUNNING\\\",false);\\n if (!isRunning) {\\n //Thread.sleep(3000);\\n isStop = true;\\n } else {\\n isStop = false;\\n }\\n if (mSwitch != null) {\\n if (isStop) {\\n mSwitch.setChecked(isRunning);\\n }\\n }\\n if ((message1 != null ) && (sensorType == 21)) {\\n Log.d(\\\"Receiver\\\", \\\"Got HR: \\\" + message1[0] + \\\". Got Accuracy: \\\" + message2);\\n int tmpHr = (int)Math.ceil(message1[0] - 0.5f);\\n if (tmpHr > 0) {\\n //db.getAllUserMonitorDataByLastMeasurementTime(lastMeasurementTime);\\n hrTxt.setText(String.valueOf(tmpHr));\\n }\\n DatabaseHandler db = new DatabaseHandler(getActivity());\\n long timeStamp = intent.getLongExtra(\\\"TIME\\\", 0)/1000000L;\\n lastSyncTxt.setText(String.valueOf(getDate(timeStamp)) + \\\" / \\\" + db.getAllUserMonitorDataByLastMeasurementTime(lastMeasurementTime).size() + \\\" records\\\");\\n }\\n } catch (Exception e) {\\n e.printStackTrace();\\n }\\n }\",\n \"public abstract void broadcastTraceTime(Server s);\",\n \"@Override\\n\\t\\tpublic void onReceive(Context arg0, Intent arg1) {\\n\\t\\t\\tString action = arg1.getAction();\\n\\t\\t\\tmContext = arg0;\\n\\t\\t\\t\\n\\t\\t\\tif(action.equals(\\\"com.example.timeshowactivity.OFF\\\")){\\n\\t\\t\\t mDelayFlag = 0;\\n\\t\\t\\t //WhetherSendIntent =false;\\n\\t\\t\\t setTimeShowState(false);\\n\\t\\t\\t Log.i(TAG,\\\"qiuyaobo onReceive com.example.timeshowactivity.OFF\\\");\\n\\t\\t\\t}else if(action.equals(\\\"com.example.timeshowactivity.ON\\\")){\\n\\t\\t\\t mDelayFlag = 1;\\n\\t\\t\\t\\t//WhetherSendIntent =true;\\n\\t\\t\\t setTimeShowState(true);\\n\\t\\t\\t//Log.i(\\\"huangjun00\\\",\\\"TimeShowReceiver ***onReceive00com.example.timeshowactivity.ON***\\\");\\n\\t\\t\\t}else if(action.equals(\\\"android.intent.action.BOOT_COMPLETED\\\")){\\n\\t\\t\\t\\tLog.d(\\\"ljz\\\", \\\"set hall\\\");\\n\\t\\t\\t\\t//PowerManager pm = (PowerManager) arg0.getSystemService(Context.POWER_SERVICE);\\n\\t\\t\\t\\t//pm.setHallSensor(true, 0);\\n\\t\\t\\t//Log.i(\\\"huangjun00\\\",\\\"TimeShowReceiver ***onReceive.....android.intent.action.BOOT_COMPLETED***\\\");\\n\\t\\t\\t\\treturn;\\n\\t\\t }else if (MTK_ACTION_UNREAD_CHANGED.equals(action)){\\n\\t\\t\\t //Log.i(\\\"huangjun00\\\",\\\"TimeShowReceiver ***onReceive.....MTK_ACTION_UNREAD_CHANGED***\\\");\\n\\t\\t\\t\\t\\t\\t\\tboolean lidOpen =SystemProperties.getBoolean(\\\"persist.sys.lidopen\\\",false);\\n\\t\\t\\t\\t\\t\\t\\tif(lidOpen){//hal is off ,at the same time a call is arriving,open the hal ,at hal Call interface,hang up the call ,we should display the TimeShow \\n\\t\\t\\t\\t\\t\\t\\t\\t\\tmDelayFlag = 1;\\n\\t\\t\\t\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tmDelayFlag = 0;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\tif(!isIdle()){\\n\\t\\t\\t\\t\\t\\t\\t\\treturn;//when we opened call waiting function ,we hanged up one call ,the other call has been activitied,at this time we cannot update TimeShow actovity if the TimeShow actovity on Background process!\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t MainActivity m = MainActivity.getInstance();\\n\\t\\t\\t\\t\\t if(m != null){\\n\\t\\t\\t\\t\\t m.updatetInfo();\\n\\t }\\n\\t }\\n\\t\\n\\t\\t if(!isIdle()){\\n\\t\\t\\t\\t\\t\\tIntent updateIncallTouchUi = new Intent(\\\"UPDATE_INCALLSCREEN_TOUCHUI\\\");\\n\\t\\t\\t\\t\\t\\tmContext.sendBroadcast(updateIncallTouchUi);\\n\\t\\n\\t }\\n\\t\\t \\n\\t\\t long milliseconds = SystemClock.elapsedRealtime();\\n\\t\\t long timeSinceLastEvent = milliseconds - mLastReceiveEventTime;\\n\\t\\t mLastReceiveEventTime = milliseconds;\\n\\t\\t mHandler.removeCallbacks(mDelayTimeTask);\\n\\t\\t\\t\\n\\t\\t //Log.i(\\\"huangjun00\\\",\\\"TimeShowReceiver ******** flag=\\\" +mDelayFlag + \\\" timeSinceLastEvent=\\\"+timeSinceLastEvent);\\n\\t\\t if(timeSinceLastEvent < DELAY_TIME){\\n\\t\\t\\t\\t\\t\\tlong i;\\n\\t\\t\\t\\t\\t\\ti= DELAY_TIME - timeSinceLastEvent;\\n\\t\\t //Log.i(\\\"huangjun00\\\",\\\"TimeShowReceiver ***timeSinceLastEvent < DELAY_TIME..timeSinceLastEvent=\\\" +timeSinceLastEvent + \\\"; DELAY_TIME=\\\"+DELAY_TIME+\\\";i=\\\"+i);\\n\\t\\t mHandler.postDelayed(mDelayTimeTask, DELAY_TIME - timeSinceLastEvent);\\n\\t\\t return;\\n\\t\\t }\\n\\t\\n\\t\\t\\t\\tif(mDelayFlag == 0){\\n\\t\\t\\t\\t\\t\\tMainActivity m = MainActivity.getInstance();\\n\\t\\t\\t\\t\\t\\tLog.i(TAG,\\\" qiuyaobo onReceive mDelayFlag == 0 m=\\\" +m);\\n\\t\\t\\t\\n\\t\\t\\t\\t\\t\\tif(m != null){\\n\\t\\t\\t\\t\\t\\t m.finish();\\n\\t\\t\\t\\t\\t\\t\\t//m.moveTaskToBack(false);\\n\\t\\t\\t // m.onBackPressed();\\n\\t\\t\\t\\t\\t\\t\\t//ActivityManager am = (ActivityManager)mContext.getSystemService(Context.ACTIVITY_SERVICE);\\n\\t\\t\\t\\t\\t\\t//\\tam.forceStopPackage(\\\"com.example.timeshowactivity\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}else if(mDelayFlag == 1){\\n\\t\\t\\n\\t\\t /// mTelephonyManager = (TelephonyManager) (mContext.getSystemService(Context.TELEPHONY_SERVICE));//hj\\n\\t\\t // mTelephonyManager.listen(mPhoneStateListener, PhoneStateListener.LISTEN_CALL_STATE); //hj\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tComponentName cn = new ComponentName(\\\"com.example.timeshowactivity\\\",\\\"com.example.timeshowactivity.MainActivity\\\");\\n\\t\\t\\t\\t\\tIntent intent = new Intent();\\n\\t\\t\\t\\t\\tintent.addFlags(Intent.FLAG_ACTIVITY_NEW_TASK);\\n\\t\\t\\t\\t\\tintent.setComponent(cn);\\n\\t\\t\\t\\t\\tmContext.startActivity(intent);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t}\",\n \"@Override\\n public void onReceive(Context context, Intent intent) {\\n Toast.makeText(context, \\\"Your Task Time Is Over\\\", Toast.LENGTH_SHORT).show();\\n }\",\n \"@Override\\n public void onReceive(Context context, Intent intent) {\\n\\n if (!PPApplicationStatic.getApplicationStarted(true, true))\\n return;\\n\\n Calendar now = Calendar.getInstance();\\n int gmtOffset = 0; //TimeZone.getDefault().getRawOffset();\\n final long _time = now.getTimeInMillis() + gmtOffset;\\n\\n final String alarmPackageName = intent.getStringExtra(EXTRA_ALARM_PACKAGE_NAME);\\n\\n if (EventStatic.getGlobalEventsRunning(context)) {\\n final Context appContext = context.getApplicationContext();\\n //PPApplication.startHandlerThreadBroadcast(/*\\\"AlarmClockBroadcastReceiver.onReceive\\\"*/);\\n //final Handler __handler = new Handler(PPApplication.handlerThreadBroadcast.getLooper());\\n //__handler.post(new PPApplication.PPHandlerThreadRunnable(context.getApplicationContext()) {\\n //__handler.post(() -> {\\n Runnable runnable = () -> {\\n// PPApplicationStatic.logE(\\\"[IN_EXECUTOR] PPApplication.startHandlerThread\\\", \\\"START run - from=AlarmClockBroadcastReceiver.onReceive\\\");\\n\\n //Context appContext= appContextWeakRef.get();\\n\\n //if (appContext != null) {\\n PowerManager powerManager = (PowerManager) appContext.getSystemService(Context.POWER_SERVICE);\\n PowerManager.WakeLock wakeLock = null;\\n try {\\n if (powerManager != null) {\\n wakeLock = powerManager.newWakeLock(PowerManager.PARTIAL_WAKE_LOCK, PPApplication.PACKAGE_NAME + \\\":AlarmClockBroadcastReceiver_onReceive\\\");\\n wakeLock.acquire(10 * 60 * 1000);\\n }\\n\\n// PPApplicationStatic.logE(\\\"[EVENTS_HANDLER_CALL] AlarmClockBroadcastReceiver.onReceive\\\", \\\"sensorType=SENSOR_TYPE_ALARM_CLOCK\\\");\\n EventsHandler eventsHandler = new EventsHandler(appContext);\\n eventsHandler.setEventAlarmClockParameters(_time, alarmPackageName);\\n eventsHandler.handleEvents(EventsHandler.SENSOR_TYPE_ALARM_CLOCK);\\n\\n } catch (Exception e) {\\n// PPApplicationStatic.logE(\\\"[IN_EXECUTOR] PPApplication.startHandlerThread\\\", Log.getStackTraceString(e));\\n PPApplicationStatic.recordException(e);\\n } finally {\\n if ((wakeLock != null) && wakeLock.isHeld()) {\\n try {\\n wakeLock.release();\\n } catch (Exception ignored) {\\n }\\n }\\n }\\n //}\\n }; //);\\n PPApplicationStatic.createEventsHandlerExecutor();\\n PPApplication.eventsHandlerExecutor.submit(runnable);\\n }\\n }\",\n \"@Override\\n\\t\\tpublic void onReceive(Context c, Intent i) {\\n\\t\\t\\t\\n\\t\\t\\tint h=i.getIntExtra(\\\"hrs\\\", 0);\\n\\t\\t\\tint m=i.getIntExtra(\\\"min\\\", 0);\\n\\t\\t\\tint s=i.getIntExtra(\\\"sec\\\", 0);\\n\\t\\t\\tLog.d(TAG, Integer.toString(h));\\n\\t\\t\\tLog.d(TAG, Integer.toString(m));\\n\\t\\t\\tLog.d(TAG, Integer.toString(s));\\n\\t\\t\\t\\n\\t\\t\\t//Printing Time to Textview\\n\\t\\t\\t\\n\\t\\t\\tTextView th=(TextView) findViewById(R.id.hr);\\n\\t\\t\\tTextView tm=(TextView) findViewById(R.id.mn);\\n\\t\\t\\tTextView ts=(TextView) findViewById(R.id.sc);\\n\\t\\t\\tif(h>=10)\\n\\t\\t\\t\\tth.setText(Integer.toString(h)+\\\":\\\");\\n\\t\\t\\telse\\n\\t\\t\\t\\tth.setText(\\\"0\\\"+Integer.toString(h)+\\\":\\\");\\n\\t\\t\\tif(m>=10)\\n\\t\\t\\t\\ttm.setText(Integer.toString(m)+\\\":\\\");\\n\\t\\t\\telse\\n\\t\\t\\t\\ttm.setText(\\\"0\\\"+Integer.toString(m)+\\\":\\\");\\n\\t\\t\\tif(s>=10)\\n\\t\\t\\t\\tts.setText(Integer.toString(s));\\n\\t\\t\\telse\\n\\t\\t\\t\\tts.setText(\\\"0\\\"+Integer.toString(s));\\n\\t\\t\\t\\n\\t\\t\\t}\",\n \"@Override\\n public void onReceive(Context context, Intent intent) {\\n Log.d(\\\"ALARMA\\\", \\\"alarma\\\");\\n AlarmUtils.scheduleAlarmHeartRate();\\n BleDevice device = new BleDevice(new DeviceManager().getDevice().getMacAddress());\\n\\n device.connect();\\n /*\\n while(!device.readSteps(new StepsListener() {\\n @Override\\n public void onStepsRead(int value) {\\n Log.d(\\\"ALARMA\\\", value+\\\"\\\");\\n }\\n })){\\n }\\n */\\n\\n while(!device.readHeartRate(new HeartRateListener() {\\n @Override\\n public void onHeartRateRead(int value) {\\n Log.d(\\\"ALARMA\\\", value+\\\"\\\");\\n\\n Measurement measurement = new Measurement(new SessionManager().getId(), value, currentTimeMillis()/1000);\\n new ApiHelper().uploadHeartRateMeasure(measurement, new SessionManager().getJWT());\\n }\\n }));\\n }\",\n \"@Override\\n\\tpublic void msgUpdateTime(int time, int day) {\\n\\t\\tlog.add(new LoggedEvent(\\\"Recieved Time \\\" + time));\\n\\t}\",\n \"private void handleUpdateTimeMessage() {\\n invalidate();\\n if (shouldTimerBeRunning()) {\\n long timeMs = System.currentTimeMillis();\\n long delayMs = INTERACTIVE_UPDATE_RATE_MS - (timeMs % INTERACTIVE_UPDATE_RATE_MS);\\n mUpdateTimeHandler.sendEmptyMessageDelayed(MSG_UPDATE_TIME, delayMs);\\n }\\n }\",\n \"public void onRecieve(RoundTimeMessage message) {\\n\\n\\n }\",\n \"private void handleUpdateTimeMessage() {\\n invalidate();\\n if (shouldTimerBeRunning()) {\\n long timeMs = System.currentTimeMillis();\\n long delayMs = INTERACTIVE_UPDATE_RATE_MS\\n - (timeMs % INTERACTIVE_UPDATE_RATE_MS);\\n mUpdateTimeHandler.sendEmptyMessageDelayed(MSG_UPDATE_TIME, delayMs);\\n }\\n }\",\n \"private void handleUpdateTimeMessage() {\\n invalidate();\\n if (shouldTimerBeRunning()) {\\n long timeMs = System.currentTimeMillis();\\n long delayMs = INTERACTIVE_UPDATE_RATE_MS\\n - (timeMs % INTERACTIVE_UPDATE_RATE_MS);\\n mUpdateTimeHandler.sendEmptyMessageDelayed(MSG_UPDATE_TIME, delayMs);\\n }\\n }\",\n \"private void handleUpdateTimeMessage() {\\n invalidate();\\n if (shouldTimerBeRunning()) {\\n long timeMs = System.currentTimeMillis();\\n long delayMs = INTERACTIVE_UPDATE_RATE_MS\\n - (timeMs % INTERACTIVE_UPDATE_RATE_MS);\\n mUpdateTimeHandler.sendEmptyMessageDelayed(MSG_UPDATE_TIME, delayMs);\\n }\\n }\",\n \"private void handleUpdateTimeMessage() {\\n invalidate();\\n if (shouldTimerBeRunning()) {\\n long timeMs = System.currentTimeMillis();\\n long delayMs = INTERACTIVE_UPDATE_RATE_MS\\n - (timeMs % INTERACTIVE_UPDATE_RATE_MS);\\n mUpdateTimeHandler.sendEmptyMessageDelayed(MSG_UPDATE_TIME, delayMs);\\n }\\n }\",\n \"private void handleUpdateTimeMessage() {\\n invalidate();\\n if (shouldTimerBeRunning()) {\\n long timeMs = System.currentTimeMillis();\\n long delayMs = INTERACTIVE_UPDATE_RATE_MS\\n - (timeMs % INTERACTIVE_UPDATE_RATE_MS);\\n mUpdateTimeHandler.sendEmptyMessageDelayed(MSG_UPDATE_TIME, delayMs);\\n }\\n }\",\n \"public void mo33398h() {\\n String str = \\\"com.tencent.android.tpush.service.channel.heartbeatIntent.pullup\\\";\\n String str2 = \\\"TpnsChannel\\\";\\n try {\\n if (this.f23285A == null) {\\n IntentFilter intentFilter = new IntentFilter();\\n intentFilter.addAction(\\\"android.intent.action.SCREEN_ON\\\");\\n intentFilter.addAction(\\\"android.intent.action.SCREEN_OFF\\\");\\n intentFilter.addAction(\\\"android.intent.action.USER_PRESENT\\\");\\n intentFilter.addAction(str);\\n C6973b.m29776f().registerReceiver(this.f23292L, intentFilter);\\n this.f23285A = PendingIntent.getBroadcast(C6973b.m29776f(), 0, new Intent(str), 134217728);\\n }\\n long currentTimeMillis = System.currentTimeMillis();\\n if (f23282q > f23278m) {\\n f23282q = f23278m;\\n }\\n if (XGPushConfig.isForeignWeakAlarmMode(C6973b.m29776f())) {\\n StringBuilder sb = new StringBuilder();\\n sb.append(\\\"schedulePullUpHeartbeat WaekAlarmMode heartbeatinterval: \\\");\\n sb.append(f23280o);\\n sb.append(\\\" ms\\\");\\n C6864a.m29305f(str2, sb.toString());\\n f23282q = f23280o;\\n }\\n f23282q = C7055h.m30166a(C6973b.m29776f(), \\\"com.tencent.android.xg.wx.HeartbeatIntervalMs\\\", f23282q);\\n long j = currentTimeMillis + ((long) f23282q);\\n mo33391b(true);\\n C7045d.m30117a().mo34149a(0, j, this.f23285A);\\n } catch (Throwable th) {\\n C6864a.m29302d(str2, \\\"scheduleHeartbeat error\\\", th);\\n }\\n }\",\n \"@Override\\n public void onReceive(final Context context, Intent intent) {\\n// PPApplicationStatic.logE(\\\"[IN_BROADCAST] DashClockBroadcastReceiver.onReceive\\\", \\\"xxx\\\");\\n\\n PhoneProfilesDashClockExtension dashClockExtension = PhoneProfilesDashClockExtension.getInstance();\\n if (dashClockExtension != null) {\\n dashClockExtension.updateExtension();\\n }\\n\\n //final boolean refresh = (intent == null) || intent.getBooleanExtra(EXTRA_REFRESH, true);\\n\\n /*PPApplication.startHandlerThreadBroadcast();\\n final Handler handler = new Handler(PPApplication.handlerThreadBroadcast.getLooper());\\n handler.post(new Runnable() {\\n @Override\\n public void run() {\\n PPApplicationStatic.logE(\\\"[IN_THREAD_HANDLER] PPApplication.startHandlerThread\\\", \\\"START run - from=DashClockBroadcastReceiver.onReceive\\\");\\n\\n PhoneProfilesDashClockExtension dashClockExtension = PhoneProfilesDashClockExtension.getInstance();\\n if (dashClockExtension != null)\\n {\\n dashClockExtension.updateExtension();\\n }\\n }\\n });*/\\n\\n }\",\n \"@Override\\n\\t\\tpublic void run() {\\n\\t\\t\\twhile (!endFlag) {\\n\\t\\t\\t\\tlong endTime = System.currentTimeMillis();\\n\\t\\t\\t\\tif (endTime - touchStartTime > 6000) {\\n\\t\\t\\t\\t\\tMessage msg = handler.obtainMessage();\\n\\t\\t\\t\\t\\tmsg.what = 0;\\n\\t\\t\\t\\t\\thandler.sendMessage(msg);\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\",\n \"boolean hasReceiveTime();\",\n \"private void m29985m() {\\n String str = \\\"com.tencent.android.tpush.service.channel.heartbeatIntent\\\";\\n String str2 = \\\"TpnsChannel\\\";\\n try {\\n if (this.f23299z == null) {\\n C6973b.m29776f().registerReceiver(new BroadcastReceiver() {\\n public void onReceive(Context context, Intent intent) {\\n C7005b.m29964a().m29983k();\\n }\\n }, new IntentFilter(str));\\n this.f23299z = PendingIntent.getBroadcast(C6973b.m29776f(), 0, new Intent(str), 134217728);\\n }\\n long currentTimeMillis = System.currentTimeMillis();\\n if (f23279n > f23278m) {\\n f23279n = f23278m;\\n }\\n if (XGPushConfig.isForeignWeakAlarmMode(C6973b.m29776f())) {\\n StringBuilder sb = new StringBuilder();\\n sb.append(\\\"scheduleHeartbeat WaekAlarmMode heartbeatinterval: \\\");\\n sb.append(f23280o);\\n sb.append(\\\" ms\\\");\\n C6864a.m29305f(str2, sb.toString());\\n f23279n = f23280o;\\n }\\n f23279n = C7055h.m30166a(C6973b.m29776f(), \\\"com.tencent.android.xg.wx.HeartbeatIntervalMs\\\", f23279n);\\n C7045d.m30117a().mo34149a(0, currentTimeMillis + ((long) f23279n), this.f23299z);\\n } catch (Throwable th) {\\n C6864a.m29302d(str2, \\\"scheduleHeartbeat error\\\", th);\\n }\\n }\",\n \"public void onReceive(Context context, Intent intent) {\\n\\n Toast.makeText(context, \\\"Alarm worked.\\\", Toast.LENGTH_LONG).show();\\n final Calendar c = Calendar.getInstance();\\n long mHour = c.get(Calendar.HOUR_OF_DAY);\\n long mMinute = c.get(Calendar.MINUTE);\\n Log.d(\\\"myTag\\\", \\\"Alarm executed at : \\\" + mHour + \\\":\\\" + mMinute);\\n\\n }\",\n \"@Override protected void doProcess(Time systemTime) {\\n }\",\n \"@Override\\n public void onReceive(Context context, Intent intent) {\\n AppUtils.setMorningAlarm(context);\\n }\",\n \"@Override\\n\\tpublic void onMessageReceived(Message msg) {\\n\\t\\tif ( msgSendTimes.containsKey(\\\"\\\"+msg.Payload)) {\\n\\t\\t\\tlong startTime = msgSendTimes.get((String)msg.Payload);\\n\\t\\t\\tlong elapsedTime = System.nanoTime() - startTime;\\n\\t\\t\\tmsgSendTimes.remove((String)msg.Payload);\\n\\t\\t\\tmsgTimes.add(elapsedTime);\\n\\t\\t\\tSystem.out.println(elapsedTime / 1000000000f);\\n\\t\\t}\\n\\t}\",\n \"@RequiresApi(api = Build.VERSION_CODES.JELLY_BEAN)\\n @Override\\n public void onReceive(Context context, Intent intent) {\\n Toast.makeText(context, \\\"Время поливать свои растения! \\\", Toast.LENGTH_LONG).show();\\n }\",\n \"@Override\\n\\t\\tpublic void onReceive(Context arg0, Intent arg1) {\\n\\t\\t\\tSystem.out.println(\\\"ALARM CALLED\\\");\\n\\t\\t\\tsendPostRequest();\\n\\t\\t}\",\n \"public void onScheduled(long scheduledTime);\",\n \"@Scheduled(fixedRate = 60_000)\\n public void checkEventTime() {\\n isTimeService.findAll().forEach(event -> {\\n if (event.getSchedulledTime().isBefore(LocalDateTime.now())) {\\n this.producer.sendReachTimeMessage(new IsTime(event.getMessageId()));\\n this.isTimeService.deleteById(event.getSchedulledId());\\n }\\n });\\n// log.info(\\\"Schedulled time check.\\\");\\n }\",\n \"@Override\\n public void onReceive(Context context, Intent intent) {\\n String message = intent.getStringExtra(\\\"message\\\");\\n Log.d(\\\"receiver\\\", \\\"Got message: \\\" + message);\\n filterDayWise();\\n }\",\n \"public void setReceiveTime(Date receiveTime) {\\n this.receiveTime = receiveTime;\\n }\",\n \"public void timeLogic(int time){\\n //Add logic to decide time increments at which tickets will be granted\\n }\",\n \"public void timeout(){\\n\\t\\tDate now = new Date();\\n\\t\\tfor (Broadcast b : this.broadcasts){\\n\\t\\t\\tif (b.getTimeout().getTime() < now.getTime()){\\n\\t\\t\\t\\tthis.remove(b);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"@Override\\n public void onReceive(Context context, Intent intent) {\\n String refresh = intent.getStringExtra(MyService.REFRESH_MONEY_PLAYER);\\n Log.i(\\\"II/FullScreen_Juego>\\\", \\\" receiver2 > REFRESH : \\\"+refresh);\\n\\n try {\\n\\n //Si lo que recibimos es mayor que lo que habia entonces GANAMOS dinero\\n if (Float.parseFloat(refresh) > Float.parseFloat(visorMoneyP1.getText().toString())\\n ) {\\n //Ejecutamos sonido\\n soundGanamosDinero.start();\\n //Ejecutar animacion\\n visorMoneyP1.startAnimation(aumento);\\n //Mostramos el Custom Toast Felicitaciones!\\n Toast toast = new Toast(getApplicationContext());\\n toast.setDuration(Toast.LENGTH_LONG);\\n toast.setGravity(Gravity.CENTER_VERTICAL, 0, 0);\\n toast.setView(layout_ganamos);//setting the view of custom toast layout\\n toast.show();\\n\\n\\n //Monstramos imagview/gif confeti\\n imageView_gif_confeti.setVisibility(View.VISIBLE);\\n //Despues de 6 segundos ocultamos Confeti\\n new CountDownTimer(6000, 1000) {\\n public void onFinish() {\\n // When timer is finished\\n // Execute your code here\\n\\n imageView_gif_confeti.setVisibility(View.INVISIBLE);\\n }\\n\\n public void onTick(long millisUntilFinished) {\\n // millisUntilFinished The amount of time until finished.\\n }\\n }.start();\\n\\n\\n //Si lo que recibimos es MENOR que lo que habia entonces PERDIMOS dinero\\n } else if (Float.parseFloat(refresh) < Float.parseFloat(visorMoneyP1.getText().toString())\\n ) {\\n\\n //Ejecutamos sonido\\n soundPerdimosDinero.start();\\n //Ejecutamos animacion\\n visorMoneyP1.startAnimation(sacudir);\\n\\n //Mostramos el Custom Toast Perdimos :(\\n Toast toast = new Toast(getApplicationContext());\\n toast.setDuration(Toast.LENGTH_LONG);\\n toast.setGravity(Gravity.CENTER_VERTICAL, 0, 0);\\n toast.setView(layout_pierde);//setting the view of custom toast layout\\n toast.show();\\n }\\n\\n\\n visorMoneyP1.setText(refresh);\\n\\n\\n }catch (Exception e){\\n Log.d(\\\"II/\\\",\\\"Error: \\\"+e);\\n }\\n\\n }\",\n \"private void informTimeToCross() {\\n if (continueAskingTimes) {\\n requestTimes();\\n }\\n }\",\n \"public void sendMessage(View v) {\\n /*\\n\\n Intent intent = new Intent(this, DisplayMessageActivity.class);\\n EditText editText = (EditText) findViewById(R.id.edit_message);\\n String message = editText.getText().toString();\\n intent.putExtra(EXTRA_MESSAGE, message);\\n startActivity(intent);\\n\\n */\\n long time = currentTimeMillis();\\n Date d1 = new Date();\\n Date d2;\\n // d2 = new Date(d1.getYear(),d1.getMonth(),d1.getDate(),d1.getHours(),d1.getMinutes(),d1.getSeconds());\\n Toast.makeText(this, \\\"ALARM ON\\\", Toast.LENGTH_SHORT).show();\\n // Calendar calendar = Calendar.getInstance();\\n // calendar.set(Calendar.HOUR_OF_DAY, alarmTimePicker.getCurrentHour());\\n // calendar.set(Calendar.MINUTE, alarmTimePicker.getCurrentMinute());\\n alarmManager = (AlarmManager) getSystemService(Context.ALARM_SERVICE);\\n Intent intent = new Intent(MainActivity.this, AlarmReceiver.class);\\n pendingIntent = PendingIntent.getBroadcast(this, 0, intent, 0);\\n Calendar calendar = Calendar.getInstance();\\n calendar.setTimeInMillis(System.currentTimeMillis());\\n // Set the alarm's trigger time to 8:30 a.m.\\n calendar.set(Calendar.HOUR_OF_DAY, 14);\\n calendar.set(Calendar.MINUTE, 58);\\n Toast.makeText(MainActivity.this, \\\"bjr\\\", Toast.LENGTH_SHORT).show();\\n // alarmManager.setRepeating(AlarmManager.RTC_WAKEUP, time + 5, 10000, pendingIntent);\\n alarmManager.set(AlarmManager.RTC_WAKEUP, System.currentTimeMillis(), pendingIntent);\\n // Bon manque de prevenir le receiver....!!\\n\\n }\",\n \"public abstract void broadcastTraceTimeCustom(Server s, String prefix);\",\n \"@Override\\n public void run() {\\n NotificationHelper nh = new NotificationHelper(getApplicationContext(), alarmId);\\n\\n /* AlarmEntity is null for snoozed alarm\\n * Get actual alarm time by: CurrentTime - silenceTimeout\\n */\\n if (isSnoozed) {\\n nh.deliverMissedNotification(\\n System.currentTimeMillis() - (Long.parseLong(silenceTimeStr) * 60000));\\n } else\\n nh.deliverMissedNotification(alarmEntity.getAlarmTime());\\n\\n stopAlarmService();\\n }\",\n \"public void setReceiveTime(Date receiveTime) {\\r\\n this.receiveTime = receiveTime;\\r\\n }\",\n \"@Override\\n\\tprotected void onHandleIntent(Intent intent) {\\n\\t\\tTimer timer = new Timer();\\n\\t\\tTimerTask task = new TimerTask() {\\n\\t\\t\\t\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic void run() {\\n\\t\\t\\t\\t// TODO Auto-generated method stub\\n\\t\\t\\t\\tLog.e(\\\"SERVICE\\\",\\\"sulod\\\");\\n\\t\\t\\t\\tIntent intent = new Intent();\\n\\t\\t\\t\\tintent.setAction(ResponseReceiver.ACTION_RESP);\\n\\t\\t\\t\\tintent.addCategory(Intent.CATEGORY_DEFAULT);\\n\\t\\t\\t\\tintent.putExtra(\\\"MESSAGE\\\", 100);\\n\\t\\t\\t\\tsendBroadcast(intent);\\n\\t\\t\\t}\\n\\t\\t};\\n\\t\\ttimer.schedule(task, 10, SEND_INTERVAL);\\n\\t}\",\n \"private synchronized void m16565c() {\\n if (!(this.f14719b || this.f14723f.hasMessages(this.f14724g))) {\\n this.f14723f.sendMessageDelayed(this.f14723f.obtainMessage(this.f14724g), 2000);\\n }\\n }\",\n \"@Override\\n public void run() {\\n try {\\n Thread.sleep(1500);\\n } catch (InterruptedException e2) {\\n // TODO Auto-generated catch block\\n e2.printStackTrace();\\n }\\n if(isTmp!=-1 && MainActivity2.linkLose==-1){\\n Message message=new Message();\\n message.what=15;\\n MainActivity.hReceiver.sendMessage(message);\\n\\n }\\n }\",\n \"@Override\\n public void onReceive(Context context, Intent intent) {\\n Toast.makeText(context, \\\"Broadcast Received\\\", Toast.LENGTH_LONG).show();\\n /*\\n first param is the context\\n second param is message to display\\n third param is the duration to display the message\\n */\\n }\",\n \"private void setHeartRateMonitor()\\n {\\n\\n Calendar cal = Calendar.getInstance();\\n Date now = new Date();\\n cal.setTime(now);\\n\\n long alarm_time = cal.getTimeInMillis();\\n\\n// if(cal.before(Calendar.getInstance()))\\n// alarm_time += 60*1000;\\n\\n AlarmManager alarmManager = (AlarmManager) getSystemService(Context.ALARM_SERVICE);\\n\\n Intent intent = new Intent(this, HeartRateMonitor.class);\\n\\n PendingIntent pendingIntent = PendingIntent.getBroadcast(this, HEART_RATE_MONITOR_REQUEST_CODE, intent,PendingIntent.FLAG_UPDATE_CURRENT);\\n\\n alarmManager.setRepeating(AlarmManager.RTC_WAKEUP, alarm_time,90000, pendingIntent);\\n\\n Log.i(\\\"hrmonitor\\\",\\\"hrmonitor alarm set\\\");\\n }\",\n \"@Override\\r\\n\\t\\tpublic void onReceive(Context arg0, Intent intent) {\\n\\t\\t\\tString action=intent.getAction();\\r\\n\\t\\t\\tif(action.equals(\\\"update_sportTime_calorie_distance\\\")){\\r\\n\\t\\t\\t\\tif(isOnTotalSteps){\\r\\n\\t\\t\\t\\t\\ttvCalorie.setText(calorie2String(BleService.totalCalorie)+\\\"k cal\\\");\\r\\n\\t\\t\\t\\t\\ttvSportTime.setText(time2String(BleService.totalSportTime));\\r\\n\\t\\t\\t\\t\\ttvDistance.setText(BleService.totalDistance+\\\"m\\\");\\r\\n\\t\\t\\t\\t}else{\\r\\n\\t\\t\\t\\t\\ttvCalorie.setText(calorie2String(BleService.intervalCalorie)+\\\"k cal\\\");\\r\\n\\t\\t\\t\\t\\ttvSportTime.setText(time2String(BleService.intervalSportTime));\\r\\n\\t\\t\\t\\t\\ttvDistance.setText(BleService.intervalDistance+\\\"m\\\");\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tdb.execSQL(\\\"UPDATE sportData SET steps=? WHERE date=?\\\", new Object[]{BleService.totalSteps, dateString});\\r\\n\\t\\t\\t\\tlayoutChart.removeViewAt(0);\\r\\n\\t\\t\\t\\tlayoutChart.addView(getGraphicalView(), 0);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tif(action.equals(\\\"update_steps\\\")){\\r\\n\\t\\t\\t\\ttvTotalSteps.setText(BleService.totalSteps+\\\"\\\");\\r\\n\\t\\t\\t\\ttvIntervalSteps.setText(BleService.intervalSteps+\\\"\\\");\\r\\n\\t\\t\\t\\tint currentCount=BleService.totalSteps*100/targetSteps;\\r\\n\\t\\t\\t\\tif(currentCount>100){\\r\\n\\t\\t\\t\\t\\tpgTotalSteps.setCurrentCount(100);\\r\\n\\t\\t\\t\\t}else if(currentCount<0){\\r\\n\\t\\t\\t\\t\\tpgTotalSteps.setCurrentCount(0);\\r\\n\\t\\t\\t\\t}else{\\r\\n\\t\\t\\t\\t\\tpgTotalSteps.setCurrentCount(currentCount);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tfloat percent=BleService.totalSteps*100f/targetSteps;\\r\\n\\t\\t\\t\\tif(percent>100){\\r\\n\\t\\t\\t\\t\\ttvComplete.setText(\\\"100%\\\");\\r\\n\\t\\t\\t\\t}else if(percent<0){\\r\\n\\t\\t\\t\\t\\ttvComplete.setText(\\\"0%\\\");\\r\\n\\t\\t\\t\\t}else{\\r\\n\\t\\t\\t\\t\\ttvComplete.setText(percent2String(percent)+\\\"%\\\");\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\",\n \"@Override\\n public void onReceive(Context context, Intent intent) {\\n int heartRateWatch = intent.getIntExtra(LiveRecordingActivity.HEART_RATE, -1);\\n String s = String.valueOf(heartRateWatch) + \\\" [BPM]\\\" ;\\n hrTextView.setText(s);\\n\\n if (hasPlot) {\\n // Plot the graph\\n xyPlotSeriesList.updateSeries(HR_PLOT_WATCH, heartRateWatch);\\n XYSeries hrWatchSeries = new SimpleXYSeries(xyPlotSeriesList.getSeriesFromList(HR_PLOT_WATCH), SimpleXYSeries.ArrayFormat.XY_VALS_INTERLEAVED, HR_PLOT_WATCH);\\n LineAndPointFormatter formatterPolar = xyPlotSeriesList.getFormatterFromList(HR_PLOT_WATCH);\\n heartRatePlot.clear();\\n heartRatePlot.addSeries(hrWatchSeries, formatterPolar);\\n heartRatePlot.redraw();\\n // And add HR value to HR ArrayList\\n hrDataArrayList.add(heartRateWatch);\\n hrTimes.add(System.currentTimeMillis()-initialTime);\\n }\\n }\",\n \"private void onCalculatingChargingTime() {\\n store.saveString(remainingTimeForBatteryToDrainOrCharge, \\\"Computing charging time...\\\");\\n }\",\n \"protected void processTimer(){\\n if(timer != null){\\n timer.cancel();\\n timer = null;\\n }\\n // Verificamos si el partido esta en progreso\\n if(match.status == Match.STATUS_PENDING || match.status == Match.STATUS_ENDED){\\n return;\\n }\\n // Creamos temporizador 90 * 60 * 1000 = 5.400.000\\n timer = new CountDownTimer(5400000, 1000) {\\n @Override\\n public void onTick(long l) {\\n // Calcular los segundos que pasaron\\n long seconds = (new Date().getTime() - matchDayLong) / 1000;\\n // Calcular los minutos del partido\\n long minutes = seconds / 60;\\n //long minutes = TimeUnit.MILLISECONDS.toMinutes(uptime);\\n if(minutes < 0){\\n minutes = 0;\\n seconds = 0;\\n statusMedium.setText(\\\"PT\\\");\\n }if(minutes > 45 && minutes < 60){\\n minutes = 45;\\n seconds = 60;\\n }else if(minutes > 90){\\n minutes = 90;\\n seconds = 60;\\n statusMedium.setText(\\\"ST\\\");\\n }else if(minutes >= 60){\\n minutes -= 15;\\n statusMedium.setText(\\\"ST\\\");\\n }else{\\n statusMedium.setText(\\\"PT\\\");\\n }\\n\\n statusTime.setText(String.format(\\\"%02d:%02d\\\", minutes, (seconds%60)));\\n }\\n\\n @Override\\n public void onFinish() {\\n\\n }\\n }.start();\\n }\",\n \"@Override\\n public void onReceive(Context context, Intent intent) {\\n Log.e(\\\"i m in Broadcast recive\\\", \\\"i m in Broadcast recive\\\");\\n Double latitude = intent.getDoubleExtra(\\\"latitude\\\",0.0);\\n Double longitude = intent.getDoubleExtra(\\\"longitude\\\",0.0);\\n int pendingPoints = intent.getIntExtra(\\\"pendingPoints\\\",0);\\n String timeStamp = intent.getStringExtra(\\\"lastUpdated\\\");\\n boolean isBulkUpload = intent.getBooleanExtra(\\\"isBulkUpload\\\",false);\\n\\n\\n textViewLastUpdatedTime.setText(\\\"Last Updated On: \\\"+timeStamp);\\n textViewPointsCount.setText(\\\"Pending Points: \\\"+pendingPoints);\\n if(getAddress(latitude,longitude).isEmpty()){\\n textview_tracking_updates.setText(\\\"Updating Details: \\\\n\\\"+latitude+\\\" / \\\"+longitude );\\n }else{\\n textview_tracking_updates.setText(\\\"Updating Details: \\\\n\\\\nLast Updated Location is : \\\"+getAddress(latitude,longitude));\\n }\\n\\n\\n }\",\n \"public void setReceiveTime(Date receiveTime) {\\n this.receiveTime = receiveTime;\\n }\",\n \"@Override\\r\\n public void run() {\\n d7++;\\r\\n if (d7 == 1) {\\r\\n onReceive(new byte[]{Message.TIMER_MESSAGE, Message.TFP7_EXPIRE});\\r\\n }\\r\\n }\",\n \"public void timeToChallenger() {\\n\\n\\n String c = null;\\n for(PlayerInterface p : onlinePlayers){\\n if(p.getNickname().equals(getCurrentTurn().getCurrentPlayer().getNickname())){\\n c = p.getWorkerRef().get(0).getColor();\\n break;\\n }\\n }\\n notifyCards(getCurrentTurn().getCurrentPlayer().getNickname(), c);\\n notifyChoose(cardsChosen, this.getAllGods(), this.getCurrentTurn().getCurrentPlayer().getNickname());\\n }\",\n \"public synchronized void checkTimeoutMessages() {\\n SQSMessage SQSMessage;\\n String receiptHandler;\\n long currentTimeStampDifference;\\n for (Map.Entry pairs : receivedMessages.entrySet()) {\\n SQSMessage = (SQSMessage) pairs.getValue();\\n currentTimeStampDifference = System.currentTimeMillis() - SQSMessage.getReceivedTimeStamp();\\n if (currentTimeStampDifference > SQSMessage.getDefaultVisibilityTimeout()) {\\n receiptHandler = (String) pairs.getKey();\\n SQSMessageQueue.addFirst(SQSMessage);\\n receivedMessages.remove(receiptHandler);\\n }\\n }\\n }\",\n \"@Override\\n public void run() {\\n int time = 59;\\n while (time >= -1) {\\n try {\\n Message message = new Message();\\n message.what = AppConfig.CHECKCODE;\\n message.obj = time;\\n handler.sendMessage(message);\\n Thread.sleep(1000);\\n time--;\\n } catch (InterruptedException e) {\\n // TODO Auto-generated catch block\\n e.printStackTrace();\\n }\\n }\\n }\",\n \"@Override\\n public void onReceive(Context context, Intent intent) {\\n setAlarm(context);\\n }\",\n \"private void onCalculatingDischargingTime() {\\n store.saveString(remainingTimeForBatteryToDrainOrCharge, \\\"Computing drain time...\\\");\\n }\",\n \"@Override\\n \\tpublic void handleMessage(Message msg) {\\n \\t\\tswitch (msg.what) {\\n\\t\\t\\tcase MSG_BASE:\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\n\\t\\t\\tcase MSG_ONESECOND:\\n\\t onTimeChanged();\\n\\t invalidate();\\n\\t mHandler.sendEmptyMessageDelayed(MSG_ONESECOND, ONESECOND);\\n\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\tdefault:\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n \\t\\tsuper.handleMessage(msg);\\n \\t}\",\n \"protected void timeout(Object data_) \\n\\t{\\n\\t\\tif ( data_ instanceof DiffTimer )\\n\\t\\t{\\n\\t\\t\\tDiffTimer d = (DiffTimer)data_ ;\\n\\t\\t\\tint type = d.EVT_Type ;\\n\\t\\t\\tif(pendingInterest!=null && type!=DiffTimer.TIMEOUT_DELAY_BROADCAST){\\n\\t\\t\\t\\tsendPacket(pendingInterest, 0.0) ;\\n\\t\\t\\t}\\n\\t\\t\\tswitch ( type )\\n\\t\\t\\t{\\n\\t\\t\\t\\tcase DiffTimer.TIMEOUT_SEND_REINFORCEMENT :\\n\\t\\t\\t\\t\\tsendReinforcements() ;\\n\\n\\t\\t\\t\\t\\t/*// if the size of the dataCache has become 0, there is no need for the timer. The timer will be set next time dataCache_insert is called. \\n\\t\\t\\t\\t\\tif ( (dataCache.size() == 0) && (reinforcementTimer.handle != null) )\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tcancelTimeout(reinforcementTimer.handle) ;\\n\\t\\t\\t\\t\\t\\treinforcementTimer.setObject(null) ;\\n\\t\\t\\t\\t\\t\\treinforcementTimer.handle = null ; \\n\\t\\t\\t\\t\\t\\treinforcementTimer = null ;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse{*/\\n\\t\\t\\t\\t\\t//\\t reset the timer. \\n\\t\\t\\t\\t\\t\\treinforcementTimer.handle = setTimeout(reinforcementTimer, REINFORCE_WINDOW) ;\\n\\t\\t\\t\\t\\t//}\\n\\t\\t\\t\\t\\tbreak ;\\n\\t\\t\\t\\tcase DiffTimer.TIMEOUT_INTEREST_CACHE_PURGE :\\n\\t\\t\\t\\t\\tinterestCachePurge() ;\\n\\n\\t\\t\\t\\t\\t/* if the size of the interestCache has become 0, there is no need for the timer. The timer will be set next time interestCache_insert is called. */\\n\\t\\t\\t\\t\\tif ( (interestCache.size() == 0) && (interestCache_purgeTimer.handle != null) )\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tcancelTimeout(interestCache_purgeTimer.handle) ;\\n\\t\\t\\t\\t\\t\\tinterestCache_purgeTimer.setObject(null) ;\\n\\t\\t\\t\\t\\t\\tinterestCache_purgeTimer.handle = null ; \\n\\t\\t\\t\\t\\t\\tinterestCache_purgeTimer = null ;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t/* reset the timer. */\\n\\t\\t\\t\\t\\t\\tinterestCache_purgeTimer.handle = setTimeout(interestCache_purgeTimer, INTEREST_CACHE_PURGE_INTERVAL) ;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tbreak ;\\n\\t\\t\\t\\tcase DiffTimer.TIMEOUT_DELAY_BROADCAST :\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif ( d.getObject() instanceof InterestPacket )\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tsendPacket((InterestPacket)(d.getObject()), 0.0) ;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if ( d.getObject() instanceof DataPacket )\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tDataPacket dataPkt = (DataPacket)(d.getObject()) ;\\n\\t\\t\\t\\t\\t\\tsendPacket(dataPkt, 0.0) ;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if ( d.getObject() instanceof ReinforcementPacket )\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tReinforcementPacket pstvReinforcementPkt = (ReinforcementPacket)(d.getObject()) ;\\n\\t\\t\\t\\t\\t\\tsendPacket(pstvReinforcementPkt, 0.0) ;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tbreak ;\\n\\t\\t\\t\\tcase DiffTimer.TIMEOUT_REFRESH_INTEREST :\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tInteger I = (Integer)(d.getObject()) ;\\n\\t\\t\\t\\t\\tint taskId = I.intValue() ;\\n\\t\\t\\t\\t\\tTaskEntry taskEntry = activeTasksList.get(taskId) ;\\n\\t\\t\\t\\t\\tInterestPacket interest= taskEntry.getInterest();\\n\\t\\t\\t\\t\\t//if ( (getTime() - taskEntry.getStartTime()) <= interest.getDuration()) /* depends on getTime() - interest start time */\\n\\t\\t\\t\\t\\t//{\\n\\t\\t\\t\\t\\t\\tif ( isDebugEnabled() )\\n\\t\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"DiffApp \\\" + nid + \\\": Sending INTEREST packet at time \\\" + getTime()) ;\\n\\t\\t\\t\\t\\t\\tinterest.setTimestamp(getTime());\\n\\t\\t\\t\\t\\t\\tsendPacket(interest, 0.0 ) ;\\n\\t\\t\\t\\t\\t\\tDiffTimer refresh_EVT = new DiffTimer(DiffTimer.TIMEOUT_REFRESH_INTEREST, new Integer(taskId)); \\n\\t\\t\\t\\t\\t\\trefresh_EVT.handle = setTimeout(refresh_EVT, taskEntry.getRefreshPeriod()) ;\\n\\t\\t\\t\\t\\t/*}\\n\\t\\t\\t\\t\\telse if ( d.handle != null )\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t// The task state has to be purged from the node after the time indicated by the duration attribute. \\n\\t\\t\\t\\t\\t\\tactiveTasksList.remove(taskId) ;\\n\\t\\t\\t\\t\\t}*/\\n\\t\\t\\t\\t\\tcancelTimeout(d.handle) ;\\n\\t\\t\\t\\t\\td.setObject(null) ;\\n\\t\\t\\t\\t\\td.handle = null ;\\n\\t\\t\\t\\t\\tbreak ;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tmicroLearner.timeout(data_) ;\\n\\t\\t} \\n\\t}\",\n \"@Override\\r\\n public void run() {\\n d2++;\\r\\n if (d2 == 1) {\\r\\n onReceive(new byte[]{Message.TIMER_MESSAGE, Message.TFP2_EXPIRE});\\r\\n }\\r\\n }\",\n \"@Override\\r\\n public void run() {\\n d1++;\\r\\n if (d1 == 1) {\\r\\n onReceive(new byte[]{Message.TIMER_MESSAGE, Message.TFP1_EXPIRE});\\r\\n }\\r\\n if (d1 == 10) {\\r\\n onReceive(new byte[]{Message.TIMER_MESSAGE, Message.TFP1_EXPIRE_N});\\r\\n }\\r\\n }\",\n \"public void checkTimes(){\\r\\n\\t\\tcal = Calendar.getInstance();\\r\\n\\t\\t//if(alarmList.size() != 0){\\r\\n\\t\\tfor(int i = 0; i < alarmList.size(); i++){\\r\\n\\t\\t\\tAlarmTime current = alarmList.get(i);\\r\\n\\t\\t\\tif(current.getYear() == cal.get(Calendar.YEAR) && current.getMonth() == cal.get(Calendar.MONTH)\\r\\n\\t\\t\\t\\t\\t&& current.getDay() == cal.get(Calendar.DAY_OF_MONTH) && current.getHour() == cal.get(Calendar.HOUR_OF_DAY)\\r\\n\\t\\t\\t\\t\\t&& current.getMinute() <= cal.get(Calendar.MINUTE)){\\r\\n\\t\\t\\t\\t//display alarm / play sound\\r\\n\\t\\t\\t\\t\\t//alarmList.get(i).setActive(true);\\r\\n\\t\\t\\t\\t\\tcurrent.setActive(true);\\r\\n\\t\\t\\t\\t//if(!alarmList.get(i).isActive){\\t\\t\\t\\t\\t//this can be removed if it needs to repeatedly go off\\r\\n\\r\\n//\\t\\t\\t\\t\\tif(!(activeAlarms.contains(alarmList.get(i)))){\\r\\n//\\t\\t\\t\\t\\t\\tactiveAlarms.add(alarmList.get(i));\\r\\n//\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\tif(!(activeAlarms.contains(current))){\\r\\n\\t\\t\\t\\t\\t\\tactiveAlarms.add(current);\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t//System.out.println(alarmList.get(i).getMinute());\\r\\n\\t\\t\\t\\t\\t//System.out.println(current.getMinute());\\r\\n\\t\\t\\t\\t\\tring = new AlarmRingDesign(alarmList.get(i).getMessage(), this, alarmList.get(i));\\r\\n\\t\\t\\t\\t\\tring.init();\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse{\\r\\n\\t\\t\\t\\t//do nothing\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t//}\\r\\n\\t}\",\n \"public void onMonitor(double timestamp, double startTime){\\n\\t\\n\\t\\tif(timestamp < startTime) {\\n\\t\\t\\t//don't start lagging before the start time\\n\\t\\t\\t//clear the logs\\n\\t\\t\\tlog.clear(); \\n\\t\\t\\treturn;\\n\\t\\t}\\n\\n\\t\\t//count the number of waiting requests\\n\\t\\tdouble w = 0;\\n\\t\\tfor(Request r: queue){\\n\\t\\t\\tif(r.isWaiting()) w++;\\n\\t\\t}\\n\\t\\t\\n\\t\\tSystem.out.println(\\\"Monitor Event at time:\\\" + timestamp);\\n\\t\\tSystem.out.println(\\\"---------------------\\\");\\n\\t\\tdouble[] qAndW = new double[2];\\n\\t\\tqAndW[0] = queue.size();\\n\\t\\tqAndW[1] = w;\\n\\t\\t\\n\\t\\tQandW.add(qAndW);\\n\\t\\t\\t\\t\\n\\t}\",\n \"@Override\\n\\tprotected void onHandleIntent(final Intent intent) {\\n\\t\\ttimeFromNow = intent.getExtras().getFloat(\\\"timeFromNow\\\");\\n\\t\\tLog.i(\\\"LocalNotification\\\", \\\"scheduleNotification -> timeFromNow: \\\" + timeFromNow);\\n \\tTimer t = new Timer(); \\n\\t\\tTimerTask task = new TimerTask() {\\n\\t\\t\\t@Override\\n\\t\\t\\tpublic void run() { \\n\\t\\t\\t\\tcreateNotif(intent);\\n\\t\\t\\t}\\n\\t\\t};\\n\\t\\tt.schedule(task, (long) (timeFromNow*1000));\\n\\t}\",\n \"@Override\\n public void run() {\\n time_ = (int) (System.currentTimeMillis() - startTime_) / 1000;\\n updateUI();\\n\\n if (time_ >= maxTime_) {\\n // Log.v(VUphone.tag, \\\"TimerTask.run() entering timeout\\\");\\n handler_.post(new Runnable() {\\n public void run() {\\n report(true);\\n }\\n });\\n }\\n }\",\n \"private void renewTimes() {\\n String time_morgens_new = time_prefs.getString(\\\"time_morgens\\\", getResources().getString(R.string.default_morgens));\\n String time_mittags_new = time_prefs.getString(\\\"time_mittags\\\", getResources().getString(R.string.default_mittags));\\n String time_abends_new = time_prefs.getString(\\\"time_abends\\\", getResources().getString(R.string.default_abends));\\n String time_zur_nacht_new = time_prefs.getString(\\\"time_morgens\\\", getResources().getString(R.string.default_morgens));\\n /*comparison of class local time variblaes with new Preferences\\n deletes alarms affected medicines and creates new alarms for them\\n */\\n\\n if (!time_morgens.equals(time_morgens_new)) {\\n //list all affected Meds and iterate for each\\n List<Meds> meds = Meds.find(Meds.class, \\\"time = ?\\\", \\\"Morgens\\\");\\n for (Meds m : meds) {\\n if (!m.getDays().equals(\\\"\\\")) {\\n cancelAlarm(m.getId());\\n }\\n }\\n\\n for (Meds m : meds) {\\n if (!m.getDays().equals(\\\"\\\")) {\\n createAlarm(m.getDays(), m.getTime(), m.getId());\\n }\\n }\\n }\\n\\n if (!time_mittags.equals(time_mittags_new)) {\\n List<Meds> meds = Meds.find(Meds.class, \\\"time = ?\\\", \\\"Mittags\\\");\\n for (Meds m : meds) {\\n if (!m.getDays().equals(\\\"\\\")) {\\n cancelAlarm(m.getId());\\n }\\n }\\n\\n for (Meds m : meds) {\\n if (!m.getDays().equals(\\\"\\\")) {\\n createAlarm(m.getDays(), m.getTime(), m.getId());\\n }\\n }\\n }\\n if (!time_abends.equals(time_abends_new)) {\\n List<Meds> meds = Meds.find(Meds.class, \\\"time = ?\\\", \\\"Abends\\\");\\n for (Meds m : meds) {\\n if (!m.getDays().equals(\\\"\\\")) {\\n cancelAlarm(m.getId());\\n }\\n }\\n\\n for (Meds m : meds) {\\n if (!m.getDays().equals(\\\"\\\")) {\\n createAlarm(m.getDays(), m.getTime(), m.getId());\\n }\\n }\\n }\\n if (!time_zur_nacht.equals(time_zur_nacht_new)) {\\n List<Meds> meds = Meds.find(Meds.class, \\\"time = ?\\\", \\\"Morgens\\\");\\n for (Meds m : meds) {\\n if (!m.getDays().equals(\\\"\\\")) {\\n cancelAlarm(m.getId());\\n }\\n }\\n\\n for (Meds m : meds) {\\n if (!m.getDays().equals(\\\"\\\")) {\\n createAlarm(m.getDays(), m.getTime(), m.getId());\\n }\\n }\\n }\\n }\",\n \"@Override\\n protected void onHandleIntent(Intent intent) {\\n retrieveValues();\\n Resources res = getResources();\\n\\n if(!swearNegative && !swearNeutral && !swearPositive){\\n SwearNotification.notify(this, res.getString(R.string.noTypeSelected) + \\\"No swears will follow!\\\", -1);\\n return;\\n }\\n\\n negative = res.getStringArray(R.array.negative);\\n neutral = res.getStringArray(R.array.neutral);\\n positive = res.getStringArray(R.array.positive);\\n\\n rand = new Random();\\n\\n swearTimer = new Timer(\\\"swearTimer\\\", true);\\n swearTimer.schedule(new swearTask(), getDelay());\\n// SwearNotification.notify(context,\\\"minTime:\\\"+Integer.toString(minTime) + \\\", maxTime:\\\"+Integer.toString(maxTime)+\\\",delay:\\\"+Long.toString(getDelay()),-1);\\n\\n }\",\n \"@Override\\n public void run() {\\n\\n try {\\n LocalDateTime now = LocalDateTime.now();\\n voda bot = new voda();\\n\\n List<Integer> notifyTime = Arrays.asList(7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23);\\n int currentHour = now.getHour();\\n\\n ArrayList<Integer> consulted = dbmodel.MysqlCon.getFollowers();\\n\\n for (Integer ntime : notifyTime) {\\n if (ntime == currentHour) {\\n for (Integer consultedUser : consulted) {\\n bot.sendTextToIdMessage(consultedUser, dbmodel.MysqlCon.getEveryDayWaterUserWaterCountView(consultedUser));\\n }\\n }\\n }\\n\\n\\n } catch (Exception e) {\\n System.out.println();\\n }\\n }\",\n \"@Override\\n\\t\\t\\t\\tpublic void run() {\\n\\t\\t\\t\\t\\tlong nowTime = System.currentTimeMillis();\\n\\t\\t\\t\\t\\t//Logger.debug(\\\"测试主动回答线程================================系统时间\\\" + nowTime);\\n\\t\\t\\t\\t\\tif (nowTime - mIStartTime <= timeNum + 1000 && nowTime - mIStartTime >= timeNum) {\\n\\t\\t\\t\\t\\t\\tmICount++;\\n\\t\\t\\t\\t\\t\\tcall.OnEnd();\\n\\t\\t\\t\\t\\t\\tsetStartTime(nowTime);\\n\\t\\t\\t\\t\\t\\tthis.cancel();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\",\n \"@Override\\n public void startTimeLoop() {\\n MyLog.log(\\\"startTimeLoop::\\\");\\n // handler.sendEmptyMessage(5);\\n }\",\n \"@Override\\n public void run() {\\n\\n SimpleDateFormat sdf = new SimpleDateFormat(\\\"hh:mm aa\\\",\\n Locale.getDefault());\\n String formattedTime = sdf.format(System.currentTimeMillis());\\n tvAlarmTime.setText(formattedTime);\\n\\n tvAlarmTitle.setText(R.string.snoozed_alarm);\\n }\",\n \"public static void registerReceiver(Context context) {\\n\\n //Get the milliseconds for next hour\\n Calendar calendar = Calendar.getInstance(TimeZone.getDefault());\\n calendar.setTimeZone(TimeZone.getTimeZone(\\\"Asia/Calcutta\\\"));\\n calendar.add(Calendar.HOUR_OF_DAY, 1);\\n calendar.set(Calendar.MINUTE, 0);\\n calendar.set(Calendar.SECOND, 0);\\n calendar.set(Calendar.MILLISECOND, 0);\\n\\n //Prepare the pending intent\\n PendingIntent pendingIntent = PendingIntent.getBroadcast(context,\\n REA_CODE_PENDING_INTENT,\\n new Intent(context, TimeReminderReceiver.class),\\n PendingIntent.FLAG_UPDATE_CURRENT);\\n\\n //Set the alarm\\n AlarmManager alarmManager = (AlarmManager) context.getSystemService(Context.ALARM_SERVICE);\\n if (Build.VERSION.SDK_INT >= Build.VERSION_CODES.M) {\\n alarmManager.setExactAndAllowWhileIdle(AlarmManager.RTC, calendar.getTimeInMillis(), pendingIntent);\\n } else {\\n alarmManager.setExact(AlarmManager.RTC, calendar.getTimeInMillis(), pendingIntent);\\n }\\n\\n Log.d(TAG, \\\"registerReceiver: Next alarm registered.\\\");\\n }\",\n \"public void handleRecordTime(int type, long time) {\\n if (type == 4) {\\n this.mFingerDown = time;\\n } else if (type == 5) {\\n this.mFingerSuccess = time;\\n } else if (this.mStartTime != 0) {\\n if (type != 0) {\\n if (type != 1) {\\n if (type != 2) {\\n if (type != 3) {\\n if (type != 6) {\\n if (type != 7) {\\n if (type == 8 && this.mKeyExitAnim == 0 && this.mKeyGoingAway > 0) {\\n this.mKeyExitAnim = time;\\n }\\n } else if (this.mKeyGoingAway == 0) {\\n this.mKeyGoingAway = time;\\n }\\n } else if (this.mKeyguardDrawn == 0 && this.mBlockScreenOnBegin > 0) {\\n this.mKeyguardDrawn = time;\\n }\\n } else if (this.mBlockScreenOnEnd == 0 && this.mBlockScreenOnBegin > 0) {\\n this.mBlockScreenOnEnd = time;\\n }\\n } else if (this.mBlockScreenOnBegin == 0) {\\n this.mBlockScreenOnBegin = time;\\n }\\n } else if (this.mSetDisplayStateEnd == 0 && this.mSetDisplayStateBegin > 0) {\\n this.mSetDisplayStateEnd = time;\\n }\\n } else if (this.mSetDisplayStateBegin == 0) {\\n this.mSetDisplayStateBegin = time;\\n }\\n }\\n }\",\n \"@Override\\n\\tprotected void onResume() {\\n\\t\\t super.onResume();\\n\\t\\t registerReceiver(timerec, new IntentFilter(\\\"in.ac.srmuniv.displaytime\\\"));\\n\\t}\",\n \"public void processTransmissionTimeout() {\\n //to be overridden by extending classes\\n }\",\n \"public void doWork() {\\r\\n runOnUiThread(new Runnable() {\\r\\n @SuppressWarnings(\\\"deprecation\\\")\\r\\n public void run() {\\r\\n try{\\r\\n TextView txtCurrentTime= (TextView)findViewById(R.id.time);\\r\\n Date dt = new Date();\\r\\n int hours = dt.getHours();\\r\\n int minutes = dt.getMinutes();\\r\\n int seconds = dt.getSeconds();\\r\\n\\r\\n String time = \\\"AM\\\";\\r\\n String min = Integer.toString(minutes);\\r\\n String sec =Integer.toString(seconds);\\r\\n\\r\\n if (hours > 12) {\\r\\n hours = hours - 12;\\r\\n time = \\\"PM\\\";\\r\\n }\\r\\n if (hours == 12)\\r\\n {\\r\\n time = \\\"PM\\\";\\r\\n }\\r\\n if (minutes < 10){\\r\\n DecimalFormat formatter = new DecimalFormat(\\\"00\\\");\\r\\n min = formatter.format(minutes);\\r\\n }\\r\\n if (seconds < 10){\\r\\n DecimalFormat formatter = new DecimalFormat(\\\"00\\\");\\r\\n sec = formatter.format(seconds);\\r\\n }\\r\\n String curTime = hours + \\\":\\\" + min + \\\":\\\" + sec;\\r\\n txtCurrentTime.setText(\\\"Current Time: \\\" + curTime + \\\" \\\" + time);\\r\\n\\r\\n int i=0, x=0;\\r\\n for (String temp [] : stops){\\r\\n int size = temp.length;\\r\\n\\r\\n Log.i(\\\"StopsActivity_x\\\", \\\"x is: \\\" + x);\\r\\n for (i=2; i<size; i++){\\r\\n\\r\\n if (temp[i].contains (\\\"AM\\\") || temp[i].contains (\\\"PM\\\")){\\r\\n\\r\\n Log.i(\\\"StopsActivity_x\\\", \\\"temp is: \\\" + temp[i]);\\r\\n //Log.i(\\\"StopsActivity_stops\\\", temp[i]);\\r\\n String split[] = temp[i].split(\\\":\\\");\\r\\n int stopTime = Integer.parseInt(split[0]);\\r\\n\\r\\n if (split[1].contains(\\\"PM\\\") && stopTime != 12) {\\r\\n stopTime = stopTime + 12;\\r\\n } else if (split[1].contains(\\\"AM\\\") && stopTime == 12)\\r\\n stopTime = 0;\\r\\n\\r\\n //Log.i(\\\"StopsActivity_test\\\", \\\"12-hour time is: \\\" + split[0] + \\\" 24 hour time is: \\\" + stopTime);\\r\\n\\r\\n int currHour = hours;\\r\\n\\r\\n if (time.contains(\\\"PM\\\") && currHour != 12) {\\r\\n currHour = currHour + 12;\\r\\n } else if (time.contains(\\\"AM\\\") && currHour == 12)\\r\\n currHour = 0;\\r\\n\\r\\n //Log.i(\\\"StopsActivity_test\\\", \\\"12-hour current time is: \\\" + hours + \\\" 24 hour current time is: \\\" + currHour);\\r\\n\\r\\n Log.i (\\\"StopsActivity_x\\\", \\\"stopTime is: \\\" + stopTime + \\\" and currHour is: \\\" + currHour);\\r\\n if (stopTime == currHour) {\\r\\n\\r\\n String busSplit[] = split[1].split(\\\" \\\");\\r\\n\\r\\n int curMin = Integer.parseInt(min);\\r\\n int busMin = Integer.parseInt(busSplit[0]);\\r\\n\\r\\n if (busMin > curMin) {\\r\\n String des = \\\"Next Bus at: \\\" + temp[i];\\r\\n routeItems.get(x).setRouteDescription(des);\\r\\n //TextView nextTime = (TextView) view.findViewById(R.id.nextbus);\\r\\n //nextTime.setText(\\\"Next Bus at: \\\" + temp[i]);\\r\\n break;\\r\\n }\\r\\n }\\r\\n else if (stopTime > currHour) {\\r\\n\\r\\n //TextView nextTime = (TextView) view.findViewById(R.id.nextbus);\\r\\n //nextTime.setText(\\\"Next Bus at: \\\" + temp[i]);\\r\\n String des = \\\"Next Bus at: \\\" + temp[i];\\r\\n routeItems.get(x).setRouteDescription(des);\\r\\n break;\\r\\n }\\r\\n }\\r\\n }\\r\\n x++;\\r\\n }\\r\\n }\\r\\n catch (Exception e) {}\\r\\n }\\r\\n });\\r\\n }\",\n \"public void timeChanged();\",\n \"@Override\\n\\t\\t\\tpublic void doTimerCheckWork() {\\n\\n\\t\\t\\t\\tif (CommonUtil.isWifiApEnabled(mWifiManager)) {\\n\\t\\t\\t\\t\\tLog.v(TAG, \\\"Wifi enabled success!\\\");\\n\\t\\t\\t\\t\\tIntent intentService = new Intent(mContext,\\n\\t\\t\\t\\t\\t\\t\\tProcessMsgService.class);\\n\\t\\t\\t\\t\\tmContext.startService(intentService);\\n\\t\\t\\t\\t\\tString action = Constants.ACTION_HOTSPOT_AVAILABLE;\\n\\t\\t\\t\\t\\tIntent intent = new Intent(action);\\n\\t\\t\\t\\t\\tmContext.sendBroadcast(intent);\\n\\t\\t\\t\\t\\tthis.exit();\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tString action = Constants.ACTION_HOTSPOT_UNAVAILABLE;\\n\\t\\t\\t\\t\\tIntent intent = new Intent(action);\\n\\t\\t\\t\\t\\tmContext.sendBroadcast(intent);\\n\\t\\t\\t\\t\\tLog.v(TAG, \\\"Wifi enabled failed!\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\",\n \"@Override\\n\\tpublic void onReceive(final Context context, Intent intent) {\\n\\t\\tLog.i(\\\"msg\\\", \\\"new message\\\");\\n\\t\\tif (Constants.MoShi==3) {\\n\\t\\t\\tnew Thread(){\\n\\t\\t\\t\\tpublic void run() {\\n\\t\\t\\t\\t\\ttry {\\n\\t\\t\\t\\t\\t\\tsleep(3000);\\n\\t\\t\\t\\t\\t} catch (InterruptedException e) {\\n\\t\\t\\t\\t\\t\\t// TODO Auto-generated catch block\\n\\t\\t\\t\\t\\t\\te.printStackTrace();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tSmsDao smsdao = new SmsDao(context);\\n\\t\\t\\t\\t\\tMap<String, String> data = smsdao.getSmsData();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tIntent itent = new Intent(Constants.ACTION_RING);\\n\\t\\t\\t\\t\\tif (data != null) {\\n\\t\\t\\t\\t\\t\\titent.putExtra(\\\"data\\\", Constants.SMSINFO);\\n\\t\\t\\t\\t\\t\\titent.putExtra(\\\"person\\\", data.get(\\\"person\\\"));\\n\\t\\t\\t\\t\\t\\titent.putExtra(\\\"body\\\", data.get(\\\"body\\\"));\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tcontext.sendBroadcast(itent);\\n\\t\\t\\t\\t};\\n\\t\\t\\t\\t\\n\\t\\t\\t}.start();\\n\\t\\t}\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"@Override\\n public void onReceive(Context context, Intent intent) {\\n\\n boolean isAlarmOn = Utils.isAlarmOn();\\n PollService.setServiceAlarm(MyApplication.getContext(), isAlarmOn);\\n }\",\n \"public void buffTimer() {\\r\\n if (seconds - lastBuffCheck >= 1) {\\r\\n lastBuffCheck = seconds;\\r\\n for (int i = 0; i < buffs.size(); i++) {\\r\\n buffs.set(i, buffs.get(i)-1);\\r\\n if (buffs.get(i) <= 0) {\\r\\n buffs.remove(i);\\r\\n }\\r\\n }\\r\\n } else if (seconds < lastBuffCheck) {\\r\\n lastBuffCheck = 0;\\r\\n }\\r\\n }\",\n \"private int micRecTime(long freeSpace) {\\n\\n return (int) (freeSpace / 5898240);\\n }\",\n \"@Override\\n public void onReceive(Context context, Intent intent) {\\n mContext = context;\\n systems = new Systems(context);\\n mCalendar = new GregorianCalendar();\\n mManager = (AlarmManager)context.getSystemService(Context.ALARM_SERVICE);\\n\\n // Check Connected Network\\n if(systems.isNetworkAvailable(context))\\n {\\n try {\\n if(!systems.getFarDay(0).equals(systems.getString(\\\"WheatherAlarmDate\\\", \\\"null\\\"))) {\\n // Get Local Weather : Reh\\n LocalWeather localWeather = new LocalWeather(context);\\n String Reh = localWeather.execute().get();\\n\\n // Check Reh Value is Valid?\\n if (Reh != null) {\\n // get Preference Setting Value\\n SharedPreferences prefs = PreferenceManager.getDefaultSharedPreferences(context);\\n boolean vibrate = prefs.getBoolean(\\\"Setting_Vibrate\\\", true);\\n boolean sound = prefs.getBoolean(\\\"Setting_Sound\\\", true);\\n\\n // Set Auto WaterGoal\\n if (prefs.getBoolean(\\\"Setting_AutoGoal\\\", true)) {\\n int recommandAmount = systems.getInt(\\\"userWeight\\\", 60) * 30 + (500 - Integer.parseInt(Reh) * 3);\\n systems.putString(\\\"WaterGoal\\\", String.valueOf(recommandAmount));\\n\\n // Send Notification\\n if (prefs.getBoolean(\\\"Setting_AutoGoalPush\\\", true))\\n systems.sendNotification(\\\"물 한잔 해요\\\", \\\"오늘의 습도 : \\\" + Reh + \\\"%, 목표 섭취량 : \\\" + recommandAmount + \\\"ml\\\", 1, vibrate, sound);\\n }\\n\\n // Save Reh Data\\n systems.putString(\\\"Reh\\\", Reh);\\n\\n // Cancel this Alarm\\n mManager.cancel(pendingIntent(requestC));\\n\\n // Set Next Alarm\\n mCalendar.set(mCalendar.get(Calendar.YEAR), mCalendar.get(Calendar.MONTH), mCalendar.get(Calendar.DAY_OF_MONTH), 7, 0);\\n mCalendar.add(Calendar.DATE, 1);\\n mManager.setInexactRepeating(AlarmManager.RTC_WAKEUP, mCalendar.getTimeInMillis(), 1200 * 1000, pendingIntent(requestC));\\n\\n // Set Preference\\n systems.putString(\\\"WheatherAlarmDate\\\", systems.getFarDay(0));\\n }\\n }\\n }\\n catch (Exception e){\\n // Network Error\\n }\\n }\\n }\",\n \"@Override\\n public void run() {\\n if (timerValidFlag)\\n gSeconds++;\\n Message message = new Message();\\n message.what = 1;\\n handler.sendMessage(message);\\n }\",\n \"@Override\\r\\n public void run() {\\n d5++;\\r\\n if (d5 == 1) {\\r\\n onReceive(new byte[]{Message.TIMER_MESSAGE, Message.TFP5_EXPIRE});\\r\\n }\\r\\n\\r\\n }\",\n \"public void timeToCheckWorker() {\\n notifyCanMove(this.getCurrentTurn().getCurrentPlayer());\\n }\",\n \"private void handleCallKill() {\\n Trace.traceBegin(8, \\\"bufferLowToKill\\\");\\n long curTime = System.currentTimeMillis();\\n long j = lastCallKillTime;\\n if (curTime < j || curTime - j >= 1000) {\\n lastCallKillTime = curTime;\\n Slog.i(TAG, \\\"buffer low too long, zswapd keep fail, call kill\\\");\\n KillDecision.getInstance().killApplicationWithZswapdPresure(false);\\n Trace.traceEnd(8);\\n return;\\n }\\n Slog.i(TAG, \\\"buffer low too long, kill too frequently\\\" + lastCallKillTime + AwarenessInnerConstants.DASH_KEY + curTime);\\n Trace.traceEnd(8);\\n }\",\n \"public Date getReceiveTime() {\\r\\n return receiveTime;\\r\\n }\",\n \"@Override\\n public void onTimePicked() {\\n }\",\n \"protected void onDestroy(){\\n super.onDestroy();\\n LocalBroadcastManager.getInstance(this).unregisterReceiver(timeReceiver);\\n }\",\n \"public Date getReceiveTime() {\\n return receiveTime;\\n }\",\n \"private void setupMsgBroadcastReceiver() {\\n broadcastReceiverLoraMsg = new BroadcastReceiver() {\\n @Override\\n public void onReceive(Context context, Intent intent) {\\n if (\\\"com.example.loravisual.MSG_RECEIVED\\\".equals(intent.getAction())) {\\n byte[] bytes = intent.getByteArrayExtra(\\\"com.example.loravisual.MSG\\\");\\n\\n String totalNumber = Integer.toString(bytes[11] + (bytes[10] * multipliers[5])); // + correct total message number calculated from two ble transmitted bytes (#msg number in iteration = [11], (#iteration = [10])\\n String msg = new String(bytes).substring(0, 10); // msg = header (ble transmitted from board as string\\n\\n if (colorToggle) {\\n msgTextView.setTextColor(getResources().getColor(R.color.colorPrimaryDark, null));\\n } else {\\n msgTextView.setTextColor(getResources().getColor(R.color.white, null));\\n }\\n colorToggle = !colorToggle;\\n msgTextView.setText(msg + \\\" (\\\" + totalNumber + \\\")\\\");\\n\\n if (dbEntries == null) {\\n dbEntries = new String[5];\\n dbEntries[0] = totalNumber;\\n dbEntries[1] = msg;\\n } else {\\n dbEntries[0] = totalNumber;\\n dbEntries[1] = msg;\\n databaseHandler.logReceivedTransmission(Integer.toString(experimentNumber), dbEntries);\\n dbEntries = null;\\n }\\n }\\n }\\n };\\n IntentFilter filter = new IntentFilter(\\\"com.example.loravisual.MSG_RECEIVED\\\");\\n registerReceiver(broadcastReceiverLoraMsg, filter);\\n }\",\n \"@Override\\r\\n\\tpublic void onReceive(Context context, Intent intent) {\\n\\t\\tVibrator v = (Vibrator) context\\r\\n\\t\\t\\t\\t.getSystemService(Context.VIBRATOR_SERVICE);\\r\\n\\t\\tv.vibrate(500);\\r\\n\\r\\n\\t\\t// also display a toast.\\r\\n\\t\\tToast.makeText(context, \\\"Boradcast received successfully\\\",\\r\\n\\t\\t\\t\\tToast.LENGTH_LONG).show();\\r\\n\\t}\",\n \"public void run() {\\n\\t\\t\\tCalendar c = new GregorianCalendar();\\n\\t\\t\\tcurrHour = c.get(Calendar.HOUR);\\n\\t\\t\\tcurrMin = String.valueOf(c.get(Calendar.MINUTE));\\n\\t\\t\\tif(currMin.length()==1) {\\n\\t\\t\\t\\tcurrMin = \\\"0\\\"+currMin;\\n\\t\\t\\t}\\n\\t\\t\\tcheckAlarm();\\n\\t\\t}\",\n \"@Override\\n\\t\\tpublic void onReceive(Context arg0, Intent intent) {\\n\\t\\t\\tif(intent.getAction().equals(Constants.P2P.ACK_GET_SD_CARD_CAPACITY)){\\n\\t\\t\\t\\tint result = intent.getIntExtra(\\\"result\\\", -1);\\n\\t\\t\\t\\tif(result==Constants.P2P_SET.ACK_RESULT.ACK_PWD_ERROR){\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tIntent i = new Intent();\\n\\t\\t\\t\\t\\ti.setAction(Constants.Action.CONTROL_SETTING_PWD_ERROR);\\n\\t\\t\\t\\t\\tmContext.sendBroadcast(i);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t}else if(result==Constants.P2P_SET.ACK_RESULT.ACK_NET_ERROR){\\n\\t\\t\\t\\t\\tLog.e(\\\"my\\\",\\\"net error resend:get npc time\\\");\\n\\t\\t\\t\\t\\tP2PHandler.getInstance().getSdCardCapacity(contact.contactId, contact.contactPassword,command);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}else if(intent.getAction().equals(Constants.P2P.RET_GET_SD_CARD_CAPACITY)){\\n\\t\\t\\t\\tint total_capacity=intent.getIntExtra(\\\"total_capacity\\\",-1);\\n\\t\\t\\t\\tint remain_capacity=intent.getIntExtra(\\\"remain_capacity\\\",-1);\\n\\t\\t\\t\\tint state=intent.getIntExtra(\\\"state\\\",-1);\\n\\t\\t\\t\\tSDcardId=intent.getIntExtra(\\\"SDcardID\\\",-1);\\n\\t\\t\\t\\tString id=Integer.toBinaryString(SDcardId);\\n\\t\\t\\t\\tLog.e(\\\"id\\\",\\\"msga\\\"+id);\\n\\t\\t\\t\\twhile(id.length()<8){\\n\\t\\t\\t\\t\\tid=\\\"0\\\"+id;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tchar index=id.charAt(3);\\n\\t\\t\\t\\tLog.e(\\\"id\\\",\\\"msgb\\\"+id);\\n\\t\\t\\t\\tLog.e(\\\"id\\\",\\\"msgc\\\"+index);\\n\\t\\t\\t\\tif(state==1){\\n\\t\\t\\t\\t\\tif(index=='1'){\\n\\t\\t\\t\\t\\t\\tsdId=SDcardId;\\n\\t\\t\\t\\t\\t\\ttv_total_capacity.setText(String.valueOf(total_capacity)+\\\"M\\\");\\n\\t\\t\\t\\t\\t\\ttv_sd_remainning_capacity.setText(String.valueOf(remain_capacity)+\\\"M\\\");\\n\\t\\t\\t\\t\\t\\tshowSDImg();\\n\\t\\t\\t\\t\\t}else if(index=='0'){\\n\\t\\t\\t\\t\\t\\tusbId=SDcardId;\\n\\t\\t\\t\\t\\t tv_usb_total_capacity.setText(String.valueOf(total_capacity)+\\\"M\\\");\\n\\t\\t\\t\\t\\t\\ttv_usb_remainning_capacity.setText(String.valueOf(remain_capacity)+\\\"M\\\");\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}else{\\n//\\t\\t\\t\\t\\t count++;\\n//\\t\\t\\t\\t\\t if(contact.contactType==P2PValue.DeviceType.IPC){\\n//\\t\\t\\t\\t\\t \\tif(count==1){\\n//\\t\\t\\t\\t\\t \\t\\tIntent back = new Intent();\\n//\\t\\t\\t\\t\\t\\t\\t\\tback.setAction(Constants.Action.REPLACE_MAIN_CONTROL);\\n//\\t\\t\\t\\t\\t\\t\\t\\tmContext.sendBroadcast(back);\\n//\\t\\t\\t\\t\\t\\t\\t\\tT.showShort(mContext,R.string.sd_no_exist);\\n//\\t\\t\\t\\t\\t \\t}\\n//\\t\\t\\t\\t\\t }else{\\n//\\t\\t\\t\\t\\t \\tif(count==2){\\n//\\t\\t\\t\\t\\t \\t\\tIntent back = new Intent();\\n//\\t\\t\\t\\t\\t\\t\\t\\tback.setAction(Constants.Action.REPLACE_MAIN_CONTROL);\\n//\\t\\t\\t\\t\\t\\t\\t\\tmContext.sendBroadcast(back);\\n//\\t\\t\\t\\t\\t\\t\\t\\tT.showShort(mContext,R.string.sd_no_exist);\\n//\\t\\t\\t\\t\\t \\t}\\n//\\t\\t\\t\\t\\t }\\n\\t\\t\\t\\t\\tIntent back = new Intent();\\n\\t\\t\\t\\t\\tback.setAction(Constants.Action.REPLACE_MAIN_CONTROL);\\n\\t\\t\\t\\t\\tmContext.sendBroadcast(back);\\n\\t\\t\\t\\t\\tT.showShort(mContext,R.string.sd_no_exist);\\n\\t\\t\\t }\\n\\t\\t\\t}else if(intent.getAction().equals(Constants.P2P.ACK_GET_SD_CARD_FORMAT)){\\n\\t\\t\\t\\tint result = intent.getIntExtra(\\\"result\\\", -1);\\n\\t\\t\\t\\tif(result==Constants.P2P_SET.ACK_RESULT.ACK_PWD_ERROR){\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tIntent i = new Intent();\\n\\t\\t\\t\\t\\ti.setAction(Constants.Action.CONTROL_SETTING_PWD_ERROR);\\n\\t\\t\\t\\t\\tmContext.sendBroadcast(i);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t}else if(result==Constants.P2P_SET.ACK_RESULT.ACK_NET_ERROR){\\n\\t\\t\\t\\t\\tLog.e(\\\"my\\\",\\\"net error resend:get npc time\\\");\\n\\t\\t\\t\\t\\tP2PHandler.getInstance().setSdFormat(contact.contactId, contact.contactPassword, sdId);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}else if(intent.getAction().equals(Constants.P2P.RET_GET_SD_CARD_FORMAT)){\\n\\t\\t\\t\\tint result=intent.getIntExtra(\\\"result\\\", -1);\\n\\t\\t\\t if(result==Constants.P2P_SET.SD_FORMAT.SD_CARD_SUCCESS){\\n\\t\\t\\t \\tT.showShort(mContext, R.string.sd_format_success);\\n\\t\\t\\t }else if(result==Constants.P2P_SET.SD_FORMAT.SD_CARD_FAIL){\\n\\t\\t\\t \\tT.showShort(mContext, R.string.sd_format_fail);\\n\\t\\t\\t }else if(result==Constants.P2P_SET.SD_FORMAT.SD_NO_EXIST){\\n\\t\\t\\t \\tT.showShort(mContext,R.string.sd_no_exist);\\n\\t\\t\\t }\\n\\t\\t\\t showSDImg();\\n\\t\\t\\t}else if(intent.getAction().equals(Constants.P2P.RET_GET_USB_CAPACITY)){\\n\\t\\t\\t\\tint total_capacity=intent.getIntExtra(\\\"total_capacity\\\",-1);\\n\\t\\t\\t\\tint remain_capacity=intent.getIntExtra(\\\"remain_capacity\\\",-1);\\n\\t\\t\\t\\tint state=intent.getIntExtra(\\\"state\\\",-1);\\n\\t\\t\\t\\tSDcardId=intent.getIntExtra(\\\"SDcardID\\\",-1);\\n\\t\\t\\t\\tString id=Integer.toBinaryString(SDcardId);\\n\\t\\t\\t\\tLog.e(\\\"id\\\",\\\"msga\\\"+id);\\n\\t\\t\\t\\twhile(id.length()<8){\\n\\t\\t\\t\\t\\tid=\\\"0\\\"+id;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tchar index=id.charAt(3);\\n\\t\\t\\t\\tLog.e(\\\"id\\\",\\\"msgb\\\"+id);\\n\\t\\t\\t\\tLog.e(\\\"id\\\",\\\"msgc\\\"+index);\\n\\t\\t\\t\\tif(state==1){\\n\\t\\t\\t\\t\\tif(index=='1'){\\n\\t\\t\\t\\t\\t\\tsdId=SDcardId;\\n\\t\\t\\t\\t\\t\\ttv_total_capacity.setText(String.valueOf(total_capacity)+\\\"M\\\");\\n\\t\\t\\t\\t\\t\\ttv_sd_remainning_capacity.setText(String.valueOf(remain_capacity)+\\\"M\\\");\\n\\t\\t\\t\\t\\t\\tshowSDImg();\\n\\t\\t\\t\\t\\t}else if(index=='0'){\\n\\t\\t\\t\\t\\t\\tusbId=SDcardId;\\n\\t\\t\\t\\t\\t tv_usb_total_capacity.setText(String.valueOf(total_capacity)+\\\"M\\\");\\n\\t\\t\\t\\t\\t\\ttv_usb_remainning_capacity.setText(String.valueOf(remain_capacity)+\\\"M\\\");\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\t count++;\\n\\t\\t\\t\\t\\t if(contact.contactType==P2PValue.DeviceType.IPC){\\n\\t\\t\\t\\t\\t \\tif(count==1){\\n\\t\\t\\t\\t\\t \\t\\tIntent back = new Intent();\\n\\t\\t\\t\\t\\t\\t\\t\\tback.setAction(Constants.Action.REPLACE_MAIN_CONTROL);\\n\\t\\t\\t\\t\\t\\t\\t\\tmContext.sendBroadcast(back);\\n\\t\\t\\t\\t\\t\\t\\t\\tT.showShort(mContext,R.string.sd_no_exist);\\n\\t\\t\\t\\t\\t \\t}\\n\\t\\t\\t\\t\\t }else{\\n\\t\\t\\t\\t\\t \\tif(count==2){\\n\\t\\t\\t\\t\\t \\t\\tIntent back = new Intent();\\n\\t\\t\\t\\t\\t\\t\\t\\tback.setAction(Constants.Action.REPLACE_MAIN_CONTROL);\\n\\t\\t\\t\\t\\t\\t\\t\\tmContext.sendBroadcast(back);\\n\\t\\t\\t\\t\\t\\t\\t\\tT.showShort(mContext,R.string.sd_no_exist);\\n\\t\\t\\t\\t\\t \\t}\\n\\t\\t\\t\\t\\t }\\n\\t\\t\\t\\t}\\n\\t\\t\\t}else if(intent.getAction().equals(Constants.P2P.RET_DEVICE_NOT_SUPPORT)){\\n\\t\\t\\t\\tIntent back = new Intent();\\n\\t\\t\\t\\tback.setAction(Constants.Action.REPLACE_MAIN_CONTROL);\\n\\t\\t\\t\\tmContext.sendBroadcast(back);\\n\\t\\t\\t\\tT.showShort(mContext,R.string.not_support);\\n\\t\\t\\t}\\n\\t\\t}\",\n \"@Override\\n\\tpublic void onReceive(Context arg0, Intent arg1) {\\n\\t\\tString message;\\n\\t\\t//check if facebook object exists? if not recreate it\\n\\t\\t\\n\\t\\tcheckFacebookExists(arg0);\\n\\t\\t\\n\\t\\t\\t\\t//count for friend to reach 30 ie check every 30 minutes for new friend joining\\n\\t\\tcountForFriend++;\\n\\t\\t\\n\\t\\t\\n\\t\\t//notification preference to store data related to notification , stores if birthdays are given\\n\\t\\t\\n\\t\\tdoBirthdayNotificationPreProcessing(arg0);\\n\\t\\t\\n\\n\\t\\tif (isInternetAvailable(arg0)) {\\n\\t\\t\\n\\t\\t\\t\\tif (BIRTHDAYGIFTNOTGIVEN) {\\n\\t\\t\\t\\t\\tdoBirthdayNotification(arg0);\\n\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\n\\n\\t\\t\\tif (countForFriend == DURATIONFORFRIENDCHECK) {\\n\\t\\t\\t\\tfriendNotification(arg0);\\n\\t\\t\\t}\\n\\t\\t\\t/*\\n\\t\\t\\t * if (countForEvent == DURATIONFOREVENTCHECK) {\\n\\t\\t\\t * \\n\\t\\t\\t * message = runCommand(arg0, EVENT); if\\n\\t\\t\\t * (!(message.equalsIgnoreCase(lastEventMessage))) { if\\n\\t\\t\\t * (!message.equalsIgnoreCase(EMPTYSTRING)) { lastEventMessage =\\n\\t\\t\\t * message; String sendmessage = message + BIRTHDAY;\\n\\t\\t\\t * \\n\\t\\t\\t * \\n\\t\\t\\t * makeNotifications(sendmessage, arg0);\\n\\t\\t\\t * \\n\\t\\t\\t * } } }\\n\\t\\t\\t */\\n\\t\\t\\tif (countForFriend != 0) {\\n\\t\\t\\t\\tgiftNotification(arg0);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"public void passTime(){\\n growPop();\\n growGdp();\\n growSocial();\\n growLiving();\\n }\",\n \"void updateNextUnblockTime(int t);\",\n \"private void onPingingTimerTick()\\r\\n {\\r\\n EneterTrace aTrace = EneterTrace.entering();\\r\\n try\\r\\n {\\r\\n try\\r\\n {\\r\\n myConnectionManipulatorLock.lock();\\r\\n try\\r\\n {\\r\\n // Send the ping message.\\r\\n myUnderlyingOutputChannel.sendMessage(myPreserializedPingMessage);\\r\\n\\r\\n // Schedule the next ping.\\r\\n myPingingTimer.change(myPingFrequency);\\r\\n }\\r\\n finally\\r\\n {\\r\\n myConnectionManipulatorLock.unlock();\\r\\n }\\r\\n }\\r\\n catch (Exception err)\\r\\n {\\r\\n // The sending of the ping message failed - the connection is broken.\\r\\n cleanAfterConnection(true, true);\\r\\n }\\r\\n }\\r\\n finally\\r\\n {\\r\\n EneterTrace.leaving(aTrace);\\r\\n }\\r\\n }\",\n \"@Override\\n\\tpublic void run() {\\n\\t\\tsuper.run();\\n\\t\\twhile(isrun&&handler!=null){\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tMessage msg=handler.obtainMessage(timeupdate, new Date());\\n\\t\\t\\t\\thandler.sendMessage(msg);\\n\\t\\t\\t\\tThread.sleep(1000);\\n\\t\\t\\t} catch (InterruptedException e) {\\n\\t\\t\\t\\t// TODO Auto-generated catch block\\n\\t\\t\\t\\te.printStackTrace();\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.65464044","0.6226626","0.611962","0.60996675","0.607122","0.60530406","0.6047379","0.603238","0.5989989","0.59027153","0.58687615","0.5854633","0.5854266","0.5846572","0.5846572","0.5846572","0.5846572","0.5846572","0.5835774","0.58301353","0.5800365","0.5772452","0.5735989","0.57161707","0.57154846","0.5671843","0.5668023","0.56633526","0.5648366","0.5647857","0.5622483","0.55817544","0.55703264","0.5565298","0.55638534","0.55594385","0.55585647","0.5557989","0.554815","0.5545893","0.5533581","0.55292153","0.5528857","0.5527045","0.55269015","0.551277","0.55121076","0.55016536","0.5488328","0.5483946","0.5476442","0.54760855","0.5454606","0.54486376","0.54413784","0.54336417","0.54322207","0.5411083","0.5408758","0.53970385","0.53912705","0.53883076","0.5387075","0.5377145","0.5372866","0.5364561","0.53577083","0.5347322","0.53291184","0.5324708","0.5320233","0.5319124","0.53178656","0.5307806","0.530668","0.53000325","0.5298918","0.5291489","0.5287058","0.5256784","0.5254175","0.52533925","0.5244124","0.5238697","0.52377975","0.52315485","0.5225869","0.52135223","0.52090657","0.5206063","0.52052146","0.5205172","0.5203879","0.52003133","0.51939255","0.5192406","0.5189734","0.518445","0.51728284","0.51644766","0.5164176"],"string":"[\n \"0.65464044\",\n \"0.6226626\",\n \"0.611962\",\n \"0.60996675\",\n \"0.607122\",\n \"0.60530406\",\n \"0.6047379\",\n \"0.603238\",\n \"0.5989989\",\n \"0.59027153\",\n \"0.58687615\",\n \"0.5854633\",\n \"0.5854266\",\n \"0.5846572\",\n \"0.5846572\",\n \"0.5846572\",\n \"0.5846572\",\n \"0.5846572\",\n \"0.5835774\",\n \"0.58301353\",\n \"0.5800365\",\n \"0.5772452\",\n \"0.5735989\",\n \"0.57161707\",\n \"0.57154846\",\n \"0.5671843\",\n \"0.5668023\",\n \"0.56633526\",\n \"0.5648366\",\n \"0.5647857\",\n \"0.5622483\",\n \"0.55817544\",\n \"0.55703264\",\n \"0.5565298\",\n \"0.55638534\",\n \"0.55594385\",\n \"0.55585647\",\n \"0.5557989\",\n \"0.554815\",\n \"0.5545893\",\n \"0.5533581\",\n \"0.55292153\",\n \"0.5528857\",\n \"0.5527045\",\n \"0.55269015\",\n \"0.551277\",\n \"0.55121076\",\n \"0.55016536\",\n \"0.5488328\",\n \"0.5483946\",\n \"0.5476442\",\n \"0.54760855\",\n \"0.5454606\",\n \"0.54486376\",\n \"0.54413784\",\n \"0.54336417\",\n \"0.54322207\",\n \"0.5411083\",\n \"0.5408758\",\n \"0.53970385\",\n \"0.53912705\",\n \"0.53883076\",\n \"0.5387075\",\n \"0.5377145\",\n \"0.5372866\",\n \"0.5364561\",\n \"0.53577083\",\n \"0.5347322\",\n \"0.53291184\",\n \"0.5324708\",\n \"0.5320233\",\n \"0.5319124\",\n \"0.53178656\",\n \"0.5307806\",\n \"0.530668\",\n \"0.53000325\",\n \"0.5298918\",\n \"0.5291489\",\n \"0.5287058\",\n \"0.5256784\",\n \"0.5254175\",\n \"0.52533925\",\n \"0.5244124\",\n \"0.5238697\",\n \"0.52377975\",\n \"0.52315485\",\n \"0.5225869\",\n \"0.52135223\",\n \"0.52090657\",\n \"0.5206063\",\n \"0.52052146\",\n \"0.5205172\",\n \"0.5203879\",\n \"0.52003133\",\n \"0.51939255\",\n \"0.5192406\",\n \"0.5189734\",\n \"0.518445\",\n \"0.51728284\",\n \"0.51644766\",\n \"0.5164176\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.0"},"document_rank":{"kind":"string","value":"-1"}}},{"rowIdx":38196,"cells":{"query":{"kind":"string","value":"show Toast with massage and different colors"},"document":{"kind":"string","value":"private void ShowToast(String massage, int colorText, int background) {\n Typeface font = Typeface.createFromAsset(getAssets(), \"comic.ttf\");\n Toast toast = Toast.makeText(SignUpActivity.this, massage,\n Toast.LENGTH_LONG);\n View view=toast.getView();\n TextView view1= view.findViewById(android.R.id.message);\n view1.setTextColor(colorText);\n view.setBackgroundResource(background);\n view1.setTypeface(font);\n toast.show();\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 showToast(int color) {\n String rgbString = \"R: \" + Color.red(color) + \" B: \" + Color.blue(color) + \" G: \" + Color.green(color);\n Toast.makeText(this, rgbString, Toast.LENGTH_SHORT).show();\n }","public void toastSuccess(String mensagem){\n\n Context context = getApplicationContext();\n CharSequence text = mensagem;\n int duration = Toast.LENGTH_LONG;\n\n Toast toast = Toast.makeText(context, text, duration);\n\n View view = toast.getView();\n\n //Obtém o plano de fundo oval real do Toast e, em seguida, define o filtro de cores\n view.getBackground().setColorFilter(getResources().getColor(R.color.colorSuccess), PorterDuff.Mode.SRC_IN);\n\n //Obtém o TextView do Toast para que ele possa ser editado\n TextView newText = view.findViewById(android.R.id.message);\n newText.setShadowLayer(0, 0, 0, Color.TRANSPARENT);\n newText.setTextColor(getResources().getColor(R.color.colorWhite));\n\n toast.show();\n\n }","public void toastError(String mensagem){\n\n Context context = getApplicationContext();\n CharSequence text = mensagem;\n int duration = Toast.LENGTH_LONG;\n\n Toast toast = Toast.makeText(context, text, duration);\n\n View view = toast.getView();\n\n //Obtém o plano de fundo oval real do Toast e, em seguida, define o filtro de cores\n view.getBackground().setColorFilter(getResources().getColor(R.color.colorError), PorterDuff.Mode.SRC_IN);\n\n //Obtém o TextView do Toast para que ele possa ser editado\n TextView newText = view.findViewById(android.R.id.message);\n newText.setShadowLayer(0, 0, 0, Color.TRANSPARENT);\n newText.setTextColor(getResources().getColor(R.color.colorWhite));\n\n toast.show();\n\n }","private static StyleableToast makeToast(String text, @ToastLength int length) {\n StyleableToast st = new StyleableToast(BaseApplication.getInstance(), text, length);\n st.setBackgroundColor(BaseApplication.getInstance().getResources().getColor(R.color.colorPrimary));\n st.setTextColor(Color.WHITE);\n st.setIcon(R.drawable.ic_shape_square_plus_white_24dp);\n st.spinIcon();\n //st.setMaxAlpha();\n //st.show();\n\n return st;\n }","public void notificacionToast(String mensaje){\n Toast toast = Toast.makeText(getApplicationContext(),mensaje,Toast.LENGTH_LONG);\n toast.setGravity(Gravity.CENTER_HORIZONTAL, 0, 0);\n toast.show();\n }","protected void showThemedToast(@StringRes final int resourceId, final int length) {\n Toast hint = Toast.makeText(getApplicationContext(), resourceId, length);\n final View hintView = hint.getView();\n hintView.setBackgroundColor(getResources().getColor(R.color.blende_red));\n if (hintView instanceof TextView) {\n ((TextView) hintView).setTextColor(getResources().getColor(android.R.color.white));\n }\n hint.show();\n }","@Override\n\tpublic void createToast(String slogan, float duration) {\n\t\tif (Gdx.app.getType() == ApplicationType.Android) {\n\t\t\tgGame.iFunctions.createToast(slogan, duration);\n\t\t} else\n\t\tsuper.createToast(slogan, duration);\n\t}","private void makeToast(String msg)\n {\n FinanceApp.serviceFactory.getUtil().makeAToast(this, msg);\n }","void showToast(String message);","void showToast(String message);","private void showResultToast(final String message, final int color, final int resultIcon) {\n SuperActivityToast.create(MainActivity.this, new Style(), Style.TYPE_BUTTON)\n .setDuration(Style.DURATION_VERY_LONG)\n .setFrame(Style.FRAME_LOLLIPOP)\n .setText(message)\n .setTextSize(Style.TEXTSIZE_VERY_LARGE)\n .setTextColor(getResources().getColor(R.color.white))\n .setIconPosition(Style.ICONPOSITION_LEFT)\n .setIconResource(resultIcon)\n .setGravity(Gravity.TOP)\n .setColor(getResources().getColor(color))\n .setAnimations(Style.ANIMATIONS_FLY).show();\n }","static void makeToast(Context ctx, String s){\n Toast.makeText(ctx, s, Toast.LENGTH_SHORT).show();\n }","void toast(int resId);","void toast(CharSequence sequence);","void onMessageToast(String string);","public void makeToast(String name,int time){\n toast = new Toast(context);\n// toast.setGravity(Gravity.BOTTOM|Gravity.CENTER_HORIZONTAL , 0, SecretMessageApplication.get720WScale(240));\n toast.setDuration(time);\n// toast.setView(layout);\n toast.show();\n\n }","void showToast(String value);","private void doToast() {\n\t\tEditText editText = (EditText) findViewById(R.id.edit_message);\r\n\t\tString message = editText.getText().toString();\r\n\t\t\r\n\t\t// Create and send toast\r\n\t\tContext context = getApplicationContext();\r\n\t\tint duration = Toast.LENGTH_SHORT;\r\n\t\tToast toast = Toast.makeText(context, message, duration);\r\n\t\ttoast.show();\r\n\t}","private void makeToast(String message){\n Toast.makeText(SettingsActivity.this, message, Toast.LENGTH_LONG).show();\n }","public void toastMsg(View v){\n String msg = \"Message Sent!\";\n Toast toast = Toast.makeText(this,msg,Toast.LENGTH_SHORT);\n toast.show();\n }","@Override\n public void toastText(String s){\n Toast.makeText(getApplicationContext(), s, Toast.LENGTH_SHORT).show();\n }","public static void displayToast(Context context, String msg) {\n Toast.makeText(context, msg, Toast.LENGTH_LONG).show();\n\n }","public static void showToast(Context context, String message, int duration) {\n\n if (message.contains(\"任务\") && !getTopActivity(context).contains(\"HomeActivity\")) {\n return;\n }\n\n if (sIsAllowShow) {\n Toast toast = new Toast(context);\n View view = LayoutInflater.from(context).inflate(R.layout.toast_universal, null);\n TextView messageText = view.findViewById(R.id.toast_universal_message_text);\n messageText.setText(message);\n toast.setDuration(duration);\n toast.setView(view);\n toast.setGravity(Gravity.CENTER, 0, 0);\n toast.show();\n }\n }","public static void showToast(Context context, String msg) {\n Toast.makeText(context, \"\" + msg, Toast.LENGTH_LONG).show();\n\n }","private static void showToastText(String infoStr, int TOAST_LENGTH) {\n Context context = null;\n\t\ttoast = getToast(context);\n\t\tTextView textView = (TextView) toast.getView().findViewById(R.id.tv_toast);\n\t\ttextView.setText(infoStr);\n textView.setTypeface(Typeface.SANS_SERIF);\n\t\ttoast.setDuration(TOAST_LENGTH);\n\t\ttoast.show();\n\t}","private void toastmessage(String message){\n Toast.makeText(Accountinfo.this,message,Toast.LENGTH_SHORT).show();\n }","@Override\n public void onStart() {\n lt.setText(activity.getString(R.string.toastSending));\n lt.setBackgroundColor(activity.getResources().getColor(R.color.indigo_600));\n lt.setTextColor(activity.getResources().getColor(R.color.white));\n lt.show();\n }","public void toast (String msg)\n\t{\n\t\tToast.makeText (getApplicationContext(), msg, Toast.LENGTH_SHORT).show ();\n\t}","@Override\n public void onStart () {\n lt.setText(activity.getString(R.string.toastSending));\n lt.setBackgroundColor(activity.getResources().getColor(R.color.indigo_600));\n lt.setTextColor(activity.getResources().getColor(R.color.white));\n lt.show();\n }","@Override\n public void onStart () {\n lt.setText(activity.getString(R.string.toastSending));\n lt.setBackgroundColor(activity.getResources().getColor(R.color.indigo_600));\n lt.setTextColor(activity.getResources().getColor(R.color.white));\n lt.show();\n }","public static void toastText(Context context, String s)\n\t{\n\t\tif(Utils.ConstantVars.canToastDebugText) \n\t\t\tToast.makeText(context, s, 2 * Toast.LENGTH_LONG).show();\n\t}","@SuppressLint(\"StringFormatMatches\")\n private String createToast(double grade) {\n String message;\n Resources res = getResources();\n message = res.getString(R.string.toast_message, grade);\n return message;\n }","private void toastMessage (String message){\n Toast.makeText(this, message, Toast.LENGTH_SHORT).show();\n }","public void ToastMessage() {\n\n // create toast message object\n final Toast toast = Toast.makeText(Product_Details_Page_Type_4.this,\n \"Product added to cart\",Toast.LENGTH_LONG);\n // show method call to show Toast message\n toast.show();\n\n // create handler to set duration for toast message\n Handler handler = new Handler() {\n\n @Override\n public void close() {\n // set duration for toast message\n toast.setDuration(100);\n // cancel toast message\n toast.cancel();\n }\n @Override\n public void flush() {}\n\n @Override\n public void publish(LogRecord record) {}\n };\n }","public void toast(String toast) {\n\t\t// TODO Auto-generated method stub\n\t\t Toast toast1 = Toast.makeText(getApplicationContext(), toast, \n Toast.LENGTH_LONG); \n\t\t toast1.setDuration(1);\n\t\t toast1.show();\n\t\t \n\t}","public void ToastPopper(String t){\n Context context = getApplicationContext();\n CharSequence text = t;\n int duration = Toast.LENGTH_LONG;\n\n Toast toast = Toast.makeText(context, text, duration);\n toast.show();\n try {\n Thread.sleep(3000);\n } catch (InterruptedException e) {\n e.printStackTrace();\n }\n }","private void toastMessage(String message){\n Toast.makeText(this,message, Toast.LENGTH_SHORT).show();\n }","private void toastMessage(String message){\n Toast.makeText(this,message, Toast.LENGTH_SHORT).show();\n }","public void showToast(String text)\n {\n Text icon = GlyphsDude.createIcon(FontAwesomeIconName.CHECK_CIRCLE,\"1.5em\");\n icon.setFill(Color.WHITE);\n Label l = new Label(text) ;\n l.setTextFill(Color.WHITE);\n l.setGraphic(icon);\n snackbar = new JFXSnackbar(PrinciplePane);\n snackbar.enqueue( new JFXSnackbar.SnackbarEvent(l));\n }","protected void toast() {\n }","private void toast(String aToast) {\n Toast.makeText(getApplicationContext(), aToast, Toast.LENGTH_LONG).show();\n }","private void displayToast(String paintingDescription) {\n Toast.makeText(this, paintingDescription, Toast.LENGTH_SHORT).show();\n }","public void showToast(String msg){\n Toast.makeText(this, msg, Toast.LENGTH_SHORT).show();\n }","private void showToast(String msg) {\n Toast.makeText(getBaseContext(), msg, Toast.LENGTH_LONG).show();\n }","private void displayToast(CharSequence text){\n Context context = getApplicationContext();\n int duration = Toast.LENGTH_SHORT;\n Toast toast = Toast.makeText(context, text, duration);\n toast.show();\n }","private void makeToast(String message, boolean longToast) {\n\t\tif (longToast)\t{ Toast.makeText(this, message, Toast.LENGTH_LONG).show(); }\n\t\telse\t\t\t{ Toast.makeText(this, message, Toast.LENGTH_SHORT).show(); }\n\t}","public static void toastIt(Context context, Toast toast, CharSequence msg) {\n if(toast !=null){\n toast.cancel();\n }\n\n //Make and display new toast\n toast = Toast.makeText(context, msg, Toast.LENGTH_SHORT);\n toast.show();\n }","private static void showToast(String stringToDisplay, Context context) {\n Toast.makeText(context, stringToDisplay, Toast.LENGTH_SHORT).show();\n }","@Override\n public void onClick(View v) {\n String toastText = \"Hello World\";\n\n // This is how long we want to show the toast\n int duration = Toast.LENGTH_SHORT;\n\n // Get the context\n Context context = getApplicationContext();\n\n // Create the toast\n Toast toast = Toast.makeText(context, toastText, duration);\n\n // Show the toast\n toast.show();\n }","public static void showToastStatic(String text, int timeToShowToastMs, int xPos, int yPos, Color color) {\r\n\t\tnew ShowToast().showToast(text, timeToShowToastMs, xPos, yPos, false, color, 25f);\r\n\t}","public static void showToast(Context context, String msg) {\n Toast.makeText(context, msg, Toast.LENGTH_LONG).show();\n }","public void ting(String msg) {\r\n\t\tToast.makeText(this, msg, Toast.LENGTH_SHORT).show();\r\n\t}","private void showToast(String msg) {\r\n Toast.makeText(Imprimir.this, msg, Toast.LENGTH_LONG).show();\r\n }","public void showToastMessage(Context mContext, String msg, int duration) {\n\n //If the call wants to use the default time\n if(duration == -1) {\n duration = LONG;\n }\n\n Toast toast = Toast.makeText(mContext, msg, duration);\n toast.show();\n }","protected void toastshow() {\n \n\t\tToast toast=new Toast(getApplicationContext());\n\t\tImageView imageView=new ImageView(getApplicationContext());\n\t\timageView.setImageResource(R.drawable.icon);\n\t\ttoast.setView(imageView);\n\t\ttoast.show();\t\n\t}","public void showErrorMessage(){\n Toast.makeText(context, R.string.generic_error_message, Toast.LENGTH_LONG).show();\n }","private void exibe_mensagem(String msg){\n Toast.makeText(getApplicationContext(), msg, Toast.LENGTH_LONG).show();\n }","public void showToast(View clickedButton) {\n String greetingText = getString(R.string.greeting_text);\n Toast tempMessage\n = Toast.makeText(this, greetingText,\n Toast.LENGTH_SHORT);\n tempMessage.show();\n }","private void msg(String s)\n {\n Toast.makeText(getApplicationContext(),s,Toast.LENGTH_LONG).show();\n }","private void msg(String s)\n {\n Toast.makeText(getApplicationContext(),s,Toast.LENGTH_LONG).show();\n }","public void showToast(String string, int length) {\n System.out.println(\"toast:\" + string);\n }","private void showToast(String message){\n\n Toast.makeText(this, message, Toast.LENGTH_SHORT).show();\n }","private void showToast(final String message, final int toastLength) {\n post(new Runnable() {\n @Override\n public void run() {\n Toast.makeText(getActivity(), message, toastLength).show();\n }\n });\n }","private void toast(String string){\n Toast.makeText(this, string, Toast.LENGTH_SHORT).show();\n }","public static void showSnackBar(Context context, LinearLayout mainLayout, String msg, String btnText, int length){\n Resources resources = context.getResources();\n\n Snackbar snackbar = Snackbar\n .make(mainLayout, msg, length )\n .setAction(resources.getText(R.string.ok), new View.OnClickListener() {\n @Override\n public void onClick(View view) {\n }\n });\n\n // Changing message text color\n snackbar.setActionTextColor(ContextCompat.getColor(context, R.color.home_yellow));\n\n // Changing action button text color\n View sbView = snackbar.getView();\n sbView.setBackgroundColor(ContextCompat.getColor(context, R.color.background_edittext));\n\n TextView textView = (TextView) sbView.findViewById(com.google.android.material.R.id.snackbar_text);\n textView.setTextColor(ContextCompat.getColor(context, R.color.edittext_text));\n textView.setMaxLines(5);\n snackbar.show();\n }","public void DisplayToast(String msg) {\n Toast.makeText(getBaseContext(), msg, Toast.LENGTH_SHORT).show();\n }","private void showToast(final int resid) {\n\t\tm_toastHandler.post(new Runnable() {\n\t\t\tpublic void run() {\n\t\t\t\tToast.makeText(InstrumentService.this, resid, Toast.LENGTH_SHORT).show();\n\t\t\t}\n\t\t});\n\t}","protected void toastshow1() {\n \n\t\tToast toast=Toast.makeText(this, \"image and text\", Toast.LENGTH_LONG);\n\t\t\n\t\tLinearLayout linearLayout=new LinearLayout(this);\n\t\tlinearLayout.setOrientation(LinearLayout.VERTICAL);\n\t\tImageView imageView=new ImageView(this);\n\t\timageView.setImageResource(R.drawable.icon);\n\t\tButton button=new Button(this);\n\t\tbutton.setText(\"progress over\");\n\t\tView toastView=toast.getView();\n\t\tlinearLayout.addView(imageView);\n\t\tlinearLayout.addView(button);\n\t\tlinearLayout.addView(toastView);\n\t\t\n\t\ttoast.setView(linearLayout);\n\t\ttoast.show();\n\t\t\n\t}","public static void showToast(Context context, CharSequence message) {\n Toast.makeText(context, message, Toast.LENGTH_SHORT).show();\n }","private void msg(String s) {\n Toast.makeText(getApplicationContext(), s, Toast.LENGTH_LONG).show();\n }","private void msg(String s) {\n Toast.makeText(getApplicationContext(), s, Toast.LENGTH_LONG).show();\n }","private void msg(String s) {\n Toast.makeText(getApplicationContext(), s, Toast.LENGTH_LONG).show();\n }","private void toastMessage(String message) {\n Toast.makeText(this, message, Toast.LENGTH_SHORT).show();\n\n }","private void makeToast(String string) {\n\t\tToast.makeText(this, string, Toast.LENGTH_SHORT).show();\r\n\r\n\t}","public void toast (String msg, boolean longLength)\n {\n Toast.makeText (getApplicationContext(), msg,\n (longLength ? Toast.LENGTH_LONG : Toast.LENGTH_SHORT)\n ).show ();\n }","public void yell(String message){\n Toast.makeText(getApplicationContext(), message, Toast.LENGTH_SHORT).show();\n }","private void toast(String bread) {\n Toast.makeText(getActivity(), bread, Toast.LENGTH_SHORT).show();\n }","@JavascriptInterface\n public void showToast(String toast) {\n Toast.makeText(mContext, toast, Toast.LENGTH_LONG).show();\n }","@JavascriptInterface\n public void showToast(String toast) {\n Toast.makeText(mContext, toast, Toast.LENGTH_SHORT).show();\n }","@JavascriptInterface\n public void showToast(String toast) {\n Toast.makeText(mContext, toast, Toast.LENGTH_SHORT).show();\n }","private void displayToast(String message) {\n Toast.makeText(getApplicationContext(), message, Toast.LENGTH_SHORT).show();\n }","private void showErrorToast() {\n }","protected void showToast(CharSequence text) {\r\n\t Context context = getApplicationContext();\r\n\t int duration = Toast.LENGTH_SHORT;\r\n\t \r\n\t Toast toast = Toast.makeText(context, text, duration);\r\n\t toast.show();\r\n\t}","public void displayToastMessage(String msg) {\n\t\tToast toast = Toast.makeText(context, msg, Toast.LENGTH_SHORT);\n\t\ttoast.setGravity(Gravity.CENTER, 0, 0);\n\t\ttoast.show();\n\t}","private void displayToast(String message) {\n Toast.makeText(OptionActivity.this, message, Toast.LENGTH_SHORT).show();\n }","@JavascriptInterface\n public void showToast(String toast) {\n Toast.makeText(mContext, toast, Toast.LENGTH_SHORT).show();\n }","@JavascriptInterface\n public void showToast(String toast) {\n Toast.makeText(mContext, toast, Toast.LENGTH_SHORT).show();\n }","public void showToast(View view) {\n // Initialize an object named 'toast' using the 'Toast' class\n Toast toast = Toast.makeText(this, R.string.toast_message, Toast.LENGTH_SHORT);\n\n // Use the method 'show()' under the 'Toast' class to show a message\n toast.show();\n }","public static void showToastCenteredStatic(String text, int timeToShowToastMs, Color color) {\r\n\t\tnew ShowToast().showToast(text, timeToShowToastMs, 0, 0, true, color, 25f);\r\n\t}","public static void showToast(Context context, String text) {\n //Toast.makeText(context, text, Toast.LENGTH_SHORT).show();\n showToastAtCenter(context, text);\n }","private void displayToast(String message) {\n\n //get the LayoutInflater and inflate the custom_toast layout\n LayoutInflater view = getLayoutInflater();\n View layout = view.inflate(R.layout.toast, null);\n\n //get the TextView from the custom_toast layout\n TextView text = layout.findViewById(R.id.txtMessage);\n text.setText(message);\n\n //create the toast object, set display duration,\n //set the view as layout that's inflated above and then call show()\n Toast toast = new Toast(getApplicationContext());\n toast.setDuration(Toast.LENGTH_LONG);\n toast.setView(layout);\n toast.show();\n }","static void displayToast(Handler handler, final Context con, final String text, final int toast_length){\n\t\thandler.post(new Runnable(){\n\t\t\tpublic void run(){\n\t\t\t\tToast.makeText(con, text, toast_length).show();\n\t\t\t}\n\t\t});\n\t}","@JavascriptInterface\r\n\t public void showToast(String toast) {\r\n\t Toast.makeText(mContext, toast, Toast.LENGTH_SHORT).show();\r\n\t }","public void showToast(String text){\n Toast.makeText(this,text,Toast.LENGTH_SHORT).show();\n }","protected void showToast(String message) {\n\tToast.makeText(this, message, Toast.LENGTH_SHORT).show();\n}","private void messageToUser(CharSequence text)\n {\n Context context = getApplicationContext();\n int duration = Toast.LENGTH_SHORT;\n Toast toast = Toast.makeText(context, text, duration);\n toast.show();\n }","public void showToastMessage(String str) {\n Toast.makeText(self, str, Toast.LENGTH_SHORT).show();\n }","@Override\n public void onClick(View v) {\n\n String s = v.getTag().toString();\n int duration = Toast.LENGTH_SHORT;\n Toast toast = Toast.makeText(context, s, duration);\n toast.show();\n }","public void showMessage(String msg){\n Toast.makeText(getApplicationContext(), msg, Toast.LENGTH_SHORT).show();\n }","private void showToast(String message) {\n\t\tToast toast = Toast.makeText(getApplicationContext(), message,\n\t\t\t\tToast.LENGTH_SHORT);\n\n\t\ttoast.setGravity(Gravity.CENTER | Gravity.CENTER_HORIZONTAL, 0, 0);\n\t\ttoast.show();\n\t}"],"string":"[\n \"private void showToast(int color) {\\n String rgbString = \\\"R: \\\" + Color.red(color) + \\\" B: \\\" + Color.blue(color) + \\\" G: \\\" + Color.green(color);\\n Toast.makeText(this, rgbString, Toast.LENGTH_SHORT).show();\\n }\",\n \"public void toastSuccess(String mensagem){\\n\\n Context context = getApplicationContext();\\n CharSequence text = mensagem;\\n int duration = Toast.LENGTH_LONG;\\n\\n Toast toast = Toast.makeText(context, text, duration);\\n\\n View view = toast.getView();\\n\\n //Obtém o plano de fundo oval real do Toast e, em seguida, define o filtro de cores\\n view.getBackground().setColorFilter(getResources().getColor(R.color.colorSuccess), PorterDuff.Mode.SRC_IN);\\n\\n //Obtém o TextView do Toast para que ele possa ser editado\\n TextView newText = view.findViewById(android.R.id.message);\\n newText.setShadowLayer(0, 0, 0, Color.TRANSPARENT);\\n newText.setTextColor(getResources().getColor(R.color.colorWhite));\\n\\n toast.show();\\n\\n }\",\n \"public void toastError(String mensagem){\\n\\n Context context = getApplicationContext();\\n CharSequence text = mensagem;\\n int duration = Toast.LENGTH_LONG;\\n\\n Toast toast = Toast.makeText(context, text, duration);\\n\\n View view = toast.getView();\\n\\n //Obtém o plano de fundo oval real do Toast e, em seguida, define o filtro de cores\\n view.getBackground().setColorFilter(getResources().getColor(R.color.colorError), PorterDuff.Mode.SRC_IN);\\n\\n //Obtém o TextView do Toast para que ele possa ser editado\\n TextView newText = view.findViewById(android.R.id.message);\\n newText.setShadowLayer(0, 0, 0, Color.TRANSPARENT);\\n newText.setTextColor(getResources().getColor(R.color.colorWhite));\\n\\n toast.show();\\n\\n }\",\n \"private static StyleableToast makeToast(String text, @ToastLength int length) {\\n StyleableToast st = new StyleableToast(BaseApplication.getInstance(), text, length);\\n st.setBackgroundColor(BaseApplication.getInstance().getResources().getColor(R.color.colorPrimary));\\n st.setTextColor(Color.WHITE);\\n st.setIcon(R.drawable.ic_shape_square_plus_white_24dp);\\n st.spinIcon();\\n //st.setMaxAlpha();\\n //st.show();\\n\\n return st;\\n }\",\n \"public void notificacionToast(String mensaje){\\n Toast toast = Toast.makeText(getApplicationContext(),mensaje,Toast.LENGTH_LONG);\\n toast.setGravity(Gravity.CENTER_HORIZONTAL, 0, 0);\\n toast.show();\\n }\",\n \"protected void showThemedToast(@StringRes final int resourceId, final int length) {\\n Toast hint = Toast.makeText(getApplicationContext(), resourceId, length);\\n final View hintView = hint.getView();\\n hintView.setBackgroundColor(getResources().getColor(R.color.blende_red));\\n if (hintView instanceof TextView) {\\n ((TextView) hintView).setTextColor(getResources().getColor(android.R.color.white));\\n }\\n hint.show();\\n }\",\n \"@Override\\n\\tpublic void createToast(String slogan, float duration) {\\n\\t\\tif (Gdx.app.getType() == ApplicationType.Android) {\\n\\t\\t\\tgGame.iFunctions.createToast(slogan, duration);\\n\\t\\t} else\\n\\t\\tsuper.createToast(slogan, duration);\\n\\t}\",\n \"private void makeToast(String msg)\\n {\\n FinanceApp.serviceFactory.getUtil().makeAToast(this, msg);\\n }\",\n \"void showToast(String message);\",\n \"void showToast(String message);\",\n \"private void showResultToast(final String message, final int color, final int resultIcon) {\\n SuperActivityToast.create(MainActivity.this, new Style(), Style.TYPE_BUTTON)\\n .setDuration(Style.DURATION_VERY_LONG)\\n .setFrame(Style.FRAME_LOLLIPOP)\\n .setText(message)\\n .setTextSize(Style.TEXTSIZE_VERY_LARGE)\\n .setTextColor(getResources().getColor(R.color.white))\\n .setIconPosition(Style.ICONPOSITION_LEFT)\\n .setIconResource(resultIcon)\\n .setGravity(Gravity.TOP)\\n .setColor(getResources().getColor(color))\\n .setAnimations(Style.ANIMATIONS_FLY).show();\\n }\",\n \"static void makeToast(Context ctx, String s){\\n Toast.makeText(ctx, s, Toast.LENGTH_SHORT).show();\\n }\",\n \"void toast(int resId);\",\n \"void toast(CharSequence sequence);\",\n \"void onMessageToast(String string);\",\n \"public void makeToast(String name,int time){\\n toast = new Toast(context);\\n// toast.setGravity(Gravity.BOTTOM|Gravity.CENTER_HORIZONTAL , 0, SecretMessageApplication.get720WScale(240));\\n toast.setDuration(time);\\n// toast.setView(layout);\\n toast.show();\\n\\n }\",\n \"void showToast(String value);\",\n \"private void doToast() {\\n\\t\\tEditText editText = (EditText) findViewById(R.id.edit_message);\\r\\n\\t\\tString message = editText.getText().toString();\\r\\n\\t\\t\\r\\n\\t\\t// Create and send toast\\r\\n\\t\\tContext context = getApplicationContext();\\r\\n\\t\\tint duration = Toast.LENGTH_SHORT;\\r\\n\\t\\tToast toast = Toast.makeText(context, message, duration);\\r\\n\\t\\ttoast.show();\\r\\n\\t}\",\n \"private void makeToast(String message){\\n Toast.makeText(SettingsActivity.this, message, Toast.LENGTH_LONG).show();\\n }\",\n \"public void toastMsg(View v){\\n String msg = \\\"Message Sent!\\\";\\n Toast toast = Toast.makeText(this,msg,Toast.LENGTH_SHORT);\\n toast.show();\\n }\",\n \"@Override\\n public void toastText(String s){\\n Toast.makeText(getApplicationContext(), s, Toast.LENGTH_SHORT).show();\\n }\",\n \"public static void displayToast(Context context, String msg) {\\n Toast.makeText(context, msg, Toast.LENGTH_LONG).show();\\n\\n }\",\n \"public static void showToast(Context context, String message, int duration) {\\n\\n if (message.contains(\\\"任务\\\") && !getTopActivity(context).contains(\\\"HomeActivity\\\")) {\\n return;\\n }\\n\\n if (sIsAllowShow) {\\n Toast toast = new Toast(context);\\n View view = LayoutInflater.from(context).inflate(R.layout.toast_universal, null);\\n TextView messageText = view.findViewById(R.id.toast_universal_message_text);\\n messageText.setText(message);\\n toast.setDuration(duration);\\n toast.setView(view);\\n toast.setGravity(Gravity.CENTER, 0, 0);\\n toast.show();\\n }\\n }\",\n \"public static void showToast(Context context, String msg) {\\n Toast.makeText(context, \\\"\\\" + msg, Toast.LENGTH_LONG).show();\\n\\n }\",\n \"private static void showToastText(String infoStr, int TOAST_LENGTH) {\\n Context context = null;\\n\\t\\ttoast = getToast(context);\\n\\t\\tTextView textView = (TextView) toast.getView().findViewById(R.id.tv_toast);\\n\\t\\ttextView.setText(infoStr);\\n textView.setTypeface(Typeface.SANS_SERIF);\\n\\t\\ttoast.setDuration(TOAST_LENGTH);\\n\\t\\ttoast.show();\\n\\t}\",\n \"private void toastmessage(String message){\\n Toast.makeText(Accountinfo.this,message,Toast.LENGTH_SHORT).show();\\n }\",\n \"@Override\\n public void onStart() {\\n lt.setText(activity.getString(R.string.toastSending));\\n lt.setBackgroundColor(activity.getResources().getColor(R.color.indigo_600));\\n lt.setTextColor(activity.getResources().getColor(R.color.white));\\n lt.show();\\n }\",\n \"public void toast (String msg)\\n\\t{\\n\\t\\tToast.makeText (getApplicationContext(), msg, Toast.LENGTH_SHORT).show ();\\n\\t}\",\n \"@Override\\n public void onStart () {\\n lt.setText(activity.getString(R.string.toastSending));\\n lt.setBackgroundColor(activity.getResources().getColor(R.color.indigo_600));\\n lt.setTextColor(activity.getResources().getColor(R.color.white));\\n lt.show();\\n }\",\n \"@Override\\n public void onStart () {\\n lt.setText(activity.getString(R.string.toastSending));\\n lt.setBackgroundColor(activity.getResources().getColor(R.color.indigo_600));\\n lt.setTextColor(activity.getResources().getColor(R.color.white));\\n lt.show();\\n }\",\n \"public static void toastText(Context context, String s)\\n\\t{\\n\\t\\tif(Utils.ConstantVars.canToastDebugText) \\n\\t\\t\\tToast.makeText(context, s, 2 * Toast.LENGTH_LONG).show();\\n\\t}\",\n \"@SuppressLint(\\\"StringFormatMatches\\\")\\n private String createToast(double grade) {\\n String message;\\n Resources res = getResources();\\n message = res.getString(R.string.toast_message, grade);\\n return message;\\n }\",\n \"private void toastMessage (String message){\\n Toast.makeText(this, message, Toast.LENGTH_SHORT).show();\\n }\",\n \"public void ToastMessage() {\\n\\n // create toast message object\\n final Toast toast = Toast.makeText(Product_Details_Page_Type_4.this,\\n \\\"Product added to cart\\\",Toast.LENGTH_LONG);\\n // show method call to show Toast message\\n toast.show();\\n\\n // create handler to set duration for toast message\\n Handler handler = new Handler() {\\n\\n @Override\\n public void close() {\\n // set duration for toast message\\n toast.setDuration(100);\\n // cancel toast message\\n toast.cancel();\\n }\\n @Override\\n public void flush() {}\\n\\n @Override\\n public void publish(LogRecord record) {}\\n };\\n }\",\n \"public void toast(String toast) {\\n\\t\\t// TODO Auto-generated method stub\\n\\t\\t Toast toast1 = Toast.makeText(getApplicationContext(), toast, \\n Toast.LENGTH_LONG); \\n\\t\\t toast1.setDuration(1);\\n\\t\\t toast1.show();\\n\\t\\t \\n\\t}\",\n \"public void ToastPopper(String t){\\n Context context = getApplicationContext();\\n CharSequence text = t;\\n int duration = Toast.LENGTH_LONG;\\n\\n Toast toast = Toast.makeText(context, text, duration);\\n toast.show();\\n try {\\n Thread.sleep(3000);\\n } catch (InterruptedException e) {\\n e.printStackTrace();\\n }\\n }\",\n \"private void toastMessage(String message){\\n Toast.makeText(this,message, Toast.LENGTH_SHORT).show();\\n }\",\n \"private void toastMessage(String message){\\n Toast.makeText(this,message, Toast.LENGTH_SHORT).show();\\n }\",\n \"public void showToast(String text)\\n {\\n Text icon = GlyphsDude.createIcon(FontAwesomeIconName.CHECK_CIRCLE,\\\"1.5em\\\");\\n icon.setFill(Color.WHITE);\\n Label l = new Label(text) ;\\n l.setTextFill(Color.WHITE);\\n l.setGraphic(icon);\\n snackbar = new JFXSnackbar(PrinciplePane);\\n snackbar.enqueue( new JFXSnackbar.SnackbarEvent(l));\\n }\",\n \"protected void toast() {\\n }\",\n \"private void toast(String aToast) {\\n Toast.makeText(getApplicationContext(), aToast, Toast.LENGTH_LONG).show();\\n }\",\n \"private void displayToast(String paintingDescription) {\\n Toast.makeText(this, paintingDescription, Toast.LENGTH_SHORT).show();\\n }\",\n \"public void showToast(String msg){\\n Toast.makeText(this, msg, Toast.LENGTH_SHORT).show();\\n }\",\n \"private void showToast(String msg) {\\n Toast.makeText(getBaseContext(), msg, Toast.LENGTH_LONG).show();\\n }\",\n \"private void displayToast(CharSequence text){\\n Context context = getApplicationContext();\\n int duration = Toast.LENGTH_SHORT;\\n Toast toast = Toast.makeText(context, text, duration);\\n toast.show();\\n }\",\n \"private void makeToast(String message, boolean longToast) {\\n\\t\\tif (longToast)\\t{ Toast.makeText(this, message, Toast.LENGTH_LONG).show(); }\\n\\t\\telse\\t\\t\\t{ Toast.makeText(this, message, Toast.LENGTH_SHORT).show(); }\\n\\t}\",\n \"public static void toastIt(Context context, Toast toast, CharSequence msg) {\\n if(toast !=null){\\n toast.cancel();\\n }\\n\\n //Make and display new toast\\n toast = Toast.makeText(context, msg, Toast.LENGTH_SHORT);\\n toast.show();\\n }\",\n \"private static void showToast(String stringToDisplay, Context context) {\\n Toast.makeText(context, stringToDisplay, Toast.LENGTH_SHORT).show();\\n }\",\n \"@Override\\n public void onClick(View v) {\\n String toastText = \\\"Hello World\\\";\\n\\n // This is how long we want to show the toast\\n int duration = Toast.LENGTH_SHORT;\\n\\n // Get the context\\n Context context = getApplicationContext();\\n\\n // Create the toast\\n Toast toast = Toast.makeText(context, toastText, duration);\\n\\n // Show the toast\\n toast.show();\\n }\",\n \"public static void showToastStatic(String text, int timeToShowToastMs, int xPos, int yPos, Color color) {\\r\\n\\t\\tnew ShowToast().showToast(text, timeToShowToastMs, xPos, yPos, false, color, 25f);\\r\\n\\t}\",\n \"public static void showToast(Context context, String msg) {\\n Toast.makeText(context, msg, Toast.LENGTH_LONG).show();\\n }\",\n \"public void ting(String msg) {\\r\\n\\t\\tToast.makeText(this, msg, Toast.LENGTH_SHORT).show();\\r\\n\\t}\",\n \"private void showToast(String msg) {\\r\\n Toast.makeText(Imprimir.this, msg, Toast.LENGTH_LONG).show();\\r\\n }\",\n \"public void showToastMessage(Context mContext, String msg, int duration) {\\n\\n //If the call wants to use the default time\\n if(duration == -1) {\\n duration = LONG;\\n }\\n\\n Toast toast = Toast.makeText(mContext, msg, duration);\\n toast.show();\\n }\",\n \"protected void toastshow() {\\n \\n\\t\\tToast toast=new Toast(getApplicationContext());\\n\\t\\tImageView imageView=new ImageView(getApplicationContext());\\n\\t\\timageView.setImageResource(R.drawable.icon);\\n\\t\\ttoast.setView(imageView);\\n\\t\\ttoast.show();\\t\\n\\t}\",\n \"public void showErrorMessage(){\\n Toast.makeText(context, R.string.generic_error_message, Toast.LENGTH_LONG).show();\\n }\",\n \"private void exibe_mensagem(String msg){\\n Toast.makeText(getApplicationContext(), msg, Toast.LENGTH_LONG).show();\\n }\",\n \"public void showToast(View clickedButton) {\\n String greetingText = getString(R.string.greeting_text);\\n Toast tempMessage\\n = Toast.makeText(this, greetingText,\\n Toast.LENGTH_SHORT);\\n tempMessage.show();\\n }\",\n \"private void msg(String s)\\n {\\n Toast.makeText(getApplicationContext(),s,Toast.LENGTH_LONG).show();\\n }\",\n \"private void msg(String s)\\n {\\n Toast.makeText(getApplicationContext(),s,Toast.LENGTH_LONG).show();\\n }\",\n \"public void showToast(String string, int length) {\\n System.out.println(\\\"toast:\\\" + string);\\n }\",\n \"private void showToast(String message){\\n\\n Toast.makeText(this, message, Toast.LENGTH_SHORT).show();\\n }\",\n \"private void showToast(final String message, final int toastLength) {\\n post(new Runnable() {\\n @Override\\n public void run() {\\n Toast.makeText(getActivity(), message, toastLength).show();\\n }\\n });\\n }\",\n \"private void toast(String string){\\n Toast.makeText(this, string, Toast.LENGTH_SHORT).show();\\n }\",\n \"public static void showSnackBar(Context context, LinearLayout mainLayout, String msg, String btnText, int length){\\n Resources resources = context.getResources();\\n\\n Snackbar snackbar = Snackbar\\n .make(mainLayout, msg, length )\\n .setAction(resources.getText(R.string.ok), new View.OnClickListener() {\\n @Override\\n public void onClick(View view) {\\n }\\n });\\n\\n // Changing message text color\\n snackbar.setActionTextColor(ContextCompat.getColor(context, R.color.home_yellow));\\n\\n // Changing action button text color\\n View sbView = snackbar.getView();\\n sbView.setBackgroundColor(ContextCompat.getColor(context, R.color.background_edittext));\\n\\n TextView textView = (TextView) sbView.findViewById(com.google.android.material.R.id.snackbar_text);\\n textView.setTextColor(ContextCompat.getColor(context, R.color.edittext_text));\\n textView.setMaxLines(5);\\n snackbar.show();\\n }\",\n \"public void DisplayToast(String msg) {\\n Toast.makeText(getBaseContext(), msg, Toast.LENGTH_SHORT).show();\\n }\",\n \"private void showToast(final int resid) {\\n\\t\\tm_toastHandler.post(new Runnable() {\\n\\t\\t\\tpublic void run() {\\n\\t\\t\\t\\tToast.makeText(InstrumentService.this, resid, Toast.LENGTH_SHORT).show();\\n\\t\\t\\t}\\n\\t\\t});\\n\\t}\",\n \"protected void toastshow1() {\\n \\n\\t\\tToast toast=Toast.makeText(this, \\\"image and text\\\", Toast.LENGTH_LONG);\\n\\t\\t\\n\\t\\tLinearLayout linearLayout=new LinearLayout(this);\\n\\t\\tlinearLayout.setOrientation(LinearLayout.VERTICAL);\\n\\t\\tImageView imageView=new ImageView(this);\\n\\t\\timageView.setImageResource(R.drawable.icon);\\n\\t\\tButton button=new Button(this);\\n\\t\\tbutton.setText(\\\"progress over\\\");\\n\\t\\tView toastView=toast.getView();\\n\\t\\tlinearLayout.addView(imageView);\\n\\t\\tlinearLayout.addView(button);\\n\\t\\tlinearLayout.addView(toastView);\\n\\t\\t\\n\\t\\ttoast.setView(linearLayout);\\n\\t\\ttoast.show();\\n\\t\\t\\n\\t}\",\n \"public static void showToast(Context context, CharSequence message) {\\n Toast.makeText(context, message, Toast.LENGTH_SHORT).show();\\n }\",\n \"private void msg(String s) {\\n Toast.makeText(getApplicationContext(), s, Toast.LENGTH_LONG).show();\\n }\",\n \"private void msg(String s) {\\n Toast.makeText(getApplicationContext(), s, Toast.LENGTH_LONG).show();\\n }\",\n \"private void msg(String s) {\\n Toast.makeText(getApplicationContext(), s, Toast.LENGTH_LONG).show();\\n }\",\n \"private void toastMessage(String message) {\\n Toast.makeText(this, message, Toast.LENGTH_SHORT).show();\\n\\n }\",\n \"private void makeToast(String string) {\\n\\t\\tToast.makeText(this, string, Toast.LENGTH_SHORT).show();\\r\\n\\r\\n\\t}\",\n \"public void toast (String msg, boolean longLength)\\n {\\n Toast.makeText (getApplicationContext(), msg,\\n (longLength ? Toast.LENGTH_LONG : Toast.LENGTH_SHORT)\\n ).show ();\\n }\",\n \"public void yell(String message){\\n Toast.makeText(getApplicationContext(), message, Toast.LENGTH_SHORT).show();\\n }\",\n \"private void toast(String bread) {\\n Toast.makeText(getActivity(), bread, Toast.LENGTH_SHORT).show();\\n }\",\n \"@JavascriptInterface\\n public void showToast(String toast) {\\n Toast.makeText(mContext, toast, Toast.LENGTH_LONG).show();\\n }\",\n \"@JavascriptInterface\\n public void showToast(String toast) {\\n Toast.makeText(mContext, toast, Toast.LENGTH_SHORT).show();\\n }\",\n \"@JavascriptInterface\\n public void showToast(String toast) {\\n Toast.makeText(mContext, toast, Toast.LENGTH_SHORT).show();\\n }\",\n \"private void displayToast(String message) {\\n Toast.makeText(getApplicationContext(), message, Toast.LENGTH_SHORT).show();\\n }\",\n \"private void showErrorToast() {\\n }\",\n \"protected void showToast(CharSequence text) {\\r\\n\\t Context context = getApplicationContext();\\r\\n\\t int duration = Toast.LENGTH_SHORT;\\r\\n\\t \\r\\n\\t Toast toast = Toast.makeText(context, text, duration);\\r\\n\\t toast.show();\\r\\n\\t}\",\n \"public void displayToastMessage(String msg) {\\n\\t\\tToast toast = Toast.makeText(context, msg, Toast.LENGTH_SHORT);\\n\\t\\ttoast.setGravity(Gravity.CENTER, 0, 0);\\n\\t\\ttoast.show();\\n\\t}\",\n \"private void displayToast(String message) {\\n Toast.makeText(OptionActivity.this, message, Toast.LENGTH_SHORT).show();\\n }\",\n \"@JavascriptInterface\\n public void showToast(String toast) {\\n Toast.makeText(mContext, toast, Toast.LENGTH_SHORT).show();\\n }\",\n \"@JavascriptInterface\\n public void showToast(String toast) {\\n Toast.makeText(mContext, toast, Toast.LENGTH_SHORT).show();\\n }\",\n \"public void showToast(View view) {\\n // Initialize an object named 'toast' using the 'Toast' class\\n Toast toast = Toast.makeText(this, R.string.toast_message, Toast.LENGTH_SHORT);\\n\\n // Use the method 'show()' under the 'Toast' class to show a message\\n toast.show();\\n }\",\n \"public static void showToastCenteredStatic(String text, int timeToShowToastMs, Color color) {\\r\\n\\t\\tnew ShowToast().showToast(text, timeToShowToastMs, 0, 0, true, color, 25f);\\r\\n\\t}\",\n \"public static void showToast(Context context, String text) {\\n //Toast.makeText(context, text, Toast.LENGTH_SHORT).show();\\n showToastAtCenter(context, text);\\n }\",\n \"private void displayToast(String message) {\\n\\n //get the LayoutInflater and inflate the custom_toast layout\\n LayoutInflater view = getLayoutInflater();\\n View layout = view.inflate(R.layout.toast, null);\\n\\n //get the TextView from the custom_toast layout\\n TextView text = layout.findViewById(R.id.txtMessage);\\n text.setText(message);\\n\\n //create the toast object, set display duration,\\n //set the view as layout that's inflated above and then call show()\\n Toast toast = new Toast(getApplicationContext());\\n toast.setDuration(Toast.LENGTH_LONG);\\n toast.setView(layout);\\n toast.show();\\n }\",\n \"static void displayToast(Handler handler, final Context con, final String text, final int toast_length){\\n\\t\\thandler.post(new Runnable(){\\n\\t\\t\\tpublic void run(){\\n\\t\\t\\t\\tToast.makeText(con, text, toast_length).show();\\n\\t\\t\\t}\\n\\t\\t});\\n\\t}\",\n \"@JavascriptInterface\\r\\n\\t public void showToast(String toast) {\\r\\n\\t Toast.makeText(mContext, toast, Toast.LENGTH_SHORT).show();\\r\\n\\t }\",\n \"public void showToast(String text){\\n Toast.makeText(this,text,Toast.LENGTH_SHORT).show();\\n }\",\n \"protected void showToast(String message) {\\n\\tToast.makeText(this, message, Toast.LENGTH_SHORT).show();\\n}\",\n \"private void messageToUser(CharSequence text)\\n {\\n Context context = getApplicationContext();\\n int duration = Toast.LENGTH_SHORT;\\n Toast toast = Toast.makeText(context, text, duration);\\n toast.show();\\n }\",\n \"public void showToastMessage(String str) {\\n Toast.makeText(self, str, Toast.LENGTH_SHORT).show();\\n }\",\n \"@Override\\n public void onClick(View v) {\\n\\n String s = v.getTag().toString();\\n int duration = Toast.LENGTH_SHORT;\\n Toast toast = Toast.makeText(context, s, duration);\\n toast.show();\\n }\",\n \"public void showMessage(String msg){\\n Toast.makeText(getApplicationContext(), msg, Toast.LENGTH_SHORT).show();\\n }\",\n \"private void showToast(String message) {\\n\\t\\tToast toast = Toast.makeText(getApplicationContext(), message,\\n\\t\\t\\t\\tToast.LENGTH_SHORT);\\n\\n\\t\\ttoast.setGravity(Gravity.CENTER | Gravity.CENTER_HORIZONTAL, 0, 0);\\n\\t\\ttoast.show();\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7824688","0.7811595","0.7505371","0.726954","0.72437024","0.7233329","0.7157529","0.7126696","0.71175444","0.71175444","0.704128","0.70111024","0.7001095","0.70002586","0.69482005","0.6945795","0.68603724","0.6829744","0.6826315","0.68115807","0.6808117","0.6768106","0.6765598","0.67440104","0.67359823","0.6733957","0.67316693","0.67290616","0.6723043","0.6723043","0.67084265","0.6706997","0.67027575","0.6688826","0.6676457","0.6660083","0.66555583","0.66555583","0.6650826","0.663179","0.6627064","0.6626545","0.6617732","0.6597167","0.6596003","0.65763634","0.6569531","0.6562005","0.65582883","0.65565073","0.65541303","0.65456635","0.6536032","0.65325814","0.6530172","0.65272427","0.6517471","0.6515727","0.65112257","0.65112257","0.6490769","0.6485821","0.6485739","0.64763784","0.64743674","0.6469407","0.646098","0.6457164","0.6452945","0.64526355","0.64526355","0.64526355","0.64469266","0.64384913","0.64359355","0.6435626","0.64335376","0.64317495","0.6426432","0.6426432","0.6414764","0.64093786","0.64051926","0.64039767","0.6402191","0.6401626","0.6401626","0.6400478","0.63986146","0.6378716","0.6366854","0.6362212","0.63620913","0.63488233","0.634333","0.6339198","0.63364947","0.63259757","0.63140655","0.63001704"],"string":"[\n \"0.7824688\",\n \"0.7811595\",\n \"0.7505371\",\n \"0.726954\",\n \"0.72437024\",\n \"0.7233329\",\n \"0.7157529\",\n \"0.7126696\",\n \"0.71175444\",\n \"0.71175444\",\n \"0.704128\",\n \"0.70111024\",\n \"0.7001095\",\n \"0.70002586\",\n \"0.69482005\",\n \"0.6945795\",\n \"0.68603724\",\n \"0.6829744\",\n \"0.6826315\",\n \"0.68115807\",\n \"0.6808117\",\n \"0.6768106\",\n \"0.6765598\",\n \"0.67440104\",\n \"0.67359823\",\n \"0.6733957\",\n \"0.67316693\",\n \"0.67290616\",\n \"0.6723043\",\n \"0.6723043\",\n \"0.67084265\",\n \"0.6706997\",\n \"0.67027575\",\n \"0.6688826\",\n \"0.6676457\",\n \"0.6660083\",\n \"0.66555583\",\n \"0.66555583\",\n \"0.6650826\",\n \"0.663179\",\n \"0.6627064\",\n \"0.6626545\",\n \"0.6617732\",\n \"0.6597167\",\n \"0.6596003\",\n \"0.65763634\",\n \"0.6569531\",\n \"0.6562005\",\n \"0.65582883\",\n \"0.65565073\",\n \"0.65541303\",\n \"0.65456635\",\n \"0.6536032\",\n \"0.65325814\",\n \"0.6530172\",\n \"0.65272427\",\n \"0.6517471\",\n \"0.6515727\",\n \"0.65112257\",\n \"0.65112257\",\n \"0.6490769\",\n \"0.6485821\",\n \"0.6485739\",\n \"0.64763784\",\n \"0.64743674\",\n \"0.6469407\",\n \"0.646098\",\n \"0.6457164\",\n \"0.6452945\",\n \"0.64526355\",\n \"0.64526355\",\n \"0.64526355\",\n \"0.64469266\",\n \"0.64384913\",\n \"0.64359355\",\n \"0.6435626\",\n \"0.64335376\",\n \"0.64317495\",\n \"0.6426432\",\n \"0.6426432\",\n \"0.6414764\",\n \"0.64093786\",\n \"0.64051926\",\n \"0.64039767\",\n \"0.6402191\",\n \"0.6401626\",\n \"0.6401626\",\n \"0.6400478\",\n \"0.63986146\",\n \"0.6378716\",\n \"0.6366854\",\n \"0.6362212\",\n \"0.63620913\",\n \"0.63488233\",\n \"0.634333\",\n \"0.6339198\",\n \"0.63364947\",\n \"0.63259757\",\n \"0.63140655\",\n \"0.63001704\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.81744117"},"document_rank":{"kind":"string","value":"0"}}},{"rowIdx":38197,"cells":{"query":{"kind":"string","value":"pop a dialog when User created successfully"},"document":{"kind":"string","value":"private void showDialog() {\n AlertDialog.Builder builder = new AlertDialog.Builder(this);\n builder.setTitle(\"User created successfully\");\n builder.setIcon(R.drawable.ic_shield);\n builder.setCancelable(true);\n builder.setPositiveButton(\n \"Continue\",\n new DialogInterface.OnClickListener() {\n public void onClick(DialogInterface dialog, int id) {\n finish();\n }\n });\n AlertDialog alert11 = builder.create();\n alert11.show();\n Window window = alert11.getWindow();\n assert window != null;\n WindowManager.LayoutParams wlp = window.getAttributes();\n wlp.gravity = Gravity.CENTER;\n wlp.y = 270;\n wlp.flags &= ~WindowManager.LayoutParams.FLAG_DIM_BEHIND;\n window.setAttributes(wlp);\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 usernameTakenDialog() {\n Dialog dialog = new Dialog(\"Username taken\", cloudSkin, \"dialog\") {\n public void result(Object obj) {\n System.out.println(\"result \" + obj);\n }\n };\n dialog.text(\"This username has already been taken, try a new one.\");\n dialog.button(\"OK\", true);\n dialog.show(stage);\n }","@FXML\n private void openCreateUser(ActionEvent event) {\n CreateUserController createusercontroller = new CreateUserController();\n User user = createusercontroller.openCreateUser(event, roleTap);\n\n if (user != null) {\n userList.add(user);\n UsermanagementUtilities.setFeedback(event, user.getName().getFirstName()+LanguageHandler.getText(\"userCreated\"), true);\n } else {\n UsermanagementUtilities.setFeedback(event, LanguageHandler.getText(\"userNotCreated\"), false);\n\n }\n }","@FXML\n\tpublic void createUser(ActionEvent event) {\n\t\tString empty = \"\";\n\t\tString name = txtUserNames.getText();\n\t\tString lastName = txtUserSurnames.getText();\n\t\tString id = txtUserId.getText();\n\t\tString username = txtUserUsername.getText();\n\t\tString password = PfUserPassword.getText();\n\n\t\tif (!name.equals(empty) && !lastName.equals(empty) && !id.equals(empty) && !username.equals(empty)\n\t\t\t\t&& !password.equals(empty)) {\n\t\t\tcreateSystemUser(name, lastName, id, username, password);\n\t\t\ttxtUserNames.setText(\"\");\n\t\t\ttxtUserSurnames.setText(\"\");\n\t\t\ttxtUserId.setText(\"\");\n\t\t\ttxtUserUsername.setText(\"\");\n\t\t\tPfUserPassword.setText(\"\");\n\t\t\t// labelUserMessage.setText(\"The user has been created\");\n\t\t} else if (name.equals(empty) && lastName.equals(empty) && id.equals(empty) && username.equals(empty)\n\t\t\t\t&& password.equals(empty)) {\n\t\t\tDialog<String> dialog = createDialog();\n\t\t\tdialog.setTitle(\"Error al guardar datos\");\n\t\t\tdialog.setContentText(\"Todos los campos de texto deben ser llenados\");\n\t\t\tdialog.show();\n\t\t}\n\t}","@Override\n\t\t\tpublic void buttonClick(ClickEvent event) {\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t\tConfirmDialog.show(UI.getCurrent(), MESSAGE_1,\"\",\"Aceptar\",\"Crear mas Usuarios\",\n\t\t\t\t new ConfirmDialog.Listener() {\n\n\t\t\t\t public void onClose(ConfirmDialog dialog) {\t\n\t\t\t\t \tent= false;\n\t\t\t\t if (dialog.isConfirmed()) {\n\t\t\t\t // Confirmed to continue\t\n\t\t\t\t \tc.navegar((StartView.VIEW_NAME));\n\t\t\t\t } else {\n\t\t\t\t // User did not confirm\t\t\t \n\t\t\t\t \t//c.crearWindow(RegistrarUser.VIEW_NAME);\n\t\t\t\t \tc.navegar((StartView.VIEW_NAME));\n\t\t\t\t \n\t\t\t\t }\n\t\t\t\t \n\t\t\t\t }\n\t\t\t\t \n\t\t\t\t });\n\t\t\t\t\n\t\t\t\t//Notification nota= new Notification(\"Registro Exitoso!\",Notification.Type.HUMANIZED_MESSAGE);\n\t\t\t\t//nota.setDelayMsec(-1);\n\t\t\t\t//nota.show(Page.getCurrent());\t\n\t\t\t\t\n\t\t\t\tclose();\t\t\t\n\t\t\t}","@Override\r\n public void handle(ActionEvent e) {\n CreateUser create = new CreateUser(txtUserName, txtEmail,\r\n txtFirstName, txtLastName, txtPassword);\r\n\r\n create.createUser(); //Call the createUser method.\r\n confirmUserStage.close(); //Close the confirm stage\r\n\r\n }","public void newuserclicked(View view) {\n Intent myuserIntent = new Intent(this, UserCreation.class);\n startActivity(myuserIntent);\n }","private void newUser() {\n // TODO: Initial layout\n LayoutInflater layoutInflater = LayoutInflater.from(getActivity());\n View form = layoutInflater.inflate(R.layout.form_user, null);\n AlertDialog.Builder alertDialogBuilder = new AlertDialog.Builder(getActivity());\n alertDialogBuilder.setTitle(\"Thêm tài khoản\");\n alertDialogBuilder.setView(form);\n\n // TODO: Add controls\n editTextPhone = form.findViewById(R.id.editTextPhoneOnUserForm);\n editTextUsername = form.findViewById(R.id.editTextUsernameOnUserForm);\n editTextPassword = form.findViewById(R.id.editTextPasswordOnUserForm);\n editTextPassword2 = form.findViewById(R.id.editTextPassword2OnUserForm);\n\n // TODO: Add events\n alertDialogBuilder.setPositiveButton(\"Lưu\", null);\n alertDialogBuilder.setNegativeButton(\"Hủy\", new DialogInterface.OnClickListener() {\n @Override\n public void onClick(DialogInterface dialog, int which) {\n dialog.dismiss();\n }\n });\n final AlertDialog alertDialog = alertDialogBuilder.create();\n alertDialog.setOnShowListener(new DialogInterface.OnShowListener() {\n @Override\n public void onShow(final DialogInterface dialog) {\n Button buttonSave = alertDialog.getButton(AlertDialog.BUTTON_POSITIVE);\n buttonSave.setOnClickListener(new View.OnClickListener() {\n @Override\n public void onClick(View v) {\n final User user = getUser();\n if (user != null) {\n tableUser.addListenerForSingleValueEvent(new ValueEventListener() {\n @Override\n public void onDataChange(@NonNull DataSnapshot dataSnapshot) {\n if (dataSnapshot.child((user.getId())).exists()) {\n Toast.makeText(getActivity(), \"Số điện thoại đã tồn tại, xin nhập số khác\", Toast.LENGTH_LONG).show();\n } else {\n tableUser.child(user.getId()).setValue(user);\n dialog.dismiss();\n Toast.makeText(getActivity(), \"Thêm thành công\", Toast.LENGTH_LONG).show();\n }\n }\n\n @Override\n public void onCancelled(@NonNull DatabaseError databaseError) {\n }\n });\n }\n }\n });\n }\n });\n alertDialog.show();\n }","private void showSuccessDialog(String username, String groupName) {\n\n successDialog = new CustomAlertDialog(\n RunnerActivity.this);\n successDialog.setCancelableFlag(false);\n successDialog.setTitle(\"Add user\");\n //String message = String.format(\"Add user: %s to group: %s Successfully!\", new String[]{username, groupName});\n String message = String.format(\"Add user: %s to group: %s Successfully!\", username, groupName);\n successDialog.setMessage(message);\n successDialog.setPositiveButton(getString(R.string.ok),\n new OnPositiveButtonClick() {\n\n @Override\n public void onButtonClick(View view) {\n // TODO Auto-generated method stub\n successDialog.dismiss();\n }\n });\n\n successDialog.show();\n }","private void createNewUser() {\n ContentValues contentValues = new ContentValues();\n contentValues.put(DataBaseConstants.Constants_TBL_PATIENTS.GENDER, getSelectedGender());\n contentValues.put(DataBaseConstants.Constants_TBL_PATIENTS.PIN, edtConfirmPin.getText().toString().trim());\n contentValues.put(DataBaseConstants.Constants_TBL_PATIENTS.LAST_NAME, edtLastName.getText().toString().trim());\n contentValues.put(DataBaseConstants.Constants_TBL_PATIENTS.FIRST_NAME, edtFirstName.getText().toString().trim());\n contentValues.put(DataBaseConstants.Constants_TBL_PATIENTS.STATUS, spnStatus.getSelectedItem().toString().trim());\n contentValues.put(DataBaseConstants.Constants_TBL_PATIENTS.DATE_OF_BIRTH, edtDateOfBirth.getText().toString().trim());\n contentValues.put(DataBaseConstants.Constants_TBL_PATIENTS.BLOOD_GROUP, spnBloodGroup.getSelectedItem().toString().trim());\n contentValues.put(DataBaseConstants.Constants_TBL_PATIENTS.IS_DELETED, \"N\");\n contentValues.put(DataBaseConstants.Constants_TBL_PATIENTS.MOBILE_NUMBER, edtMobileNumber.getText().toString());\n contentValues.put(DataBaseConstants.Constants_TBL_CATEGORIES.CREATE_DATE, Utils.getCurrentDateTime(Utils.DD_MM_YYYY));\n\n dataBaseHelper.saveToLocalTable(DataBaseConstants.TableNames.TBL_PATIENTS, contentValues);\n context.startActivity(new Intent(CreatePinActivity.this, LoginActivity.class));\n }","private void RegisterUser(final User user) {\n AlertDialog.Builder builder;\n if (Build.VERSION.SDK_INT >= Build.VERSION_CODES.LOLLIPOP) {\n builder = new AlertDialog.Builder(this, android.R.style.Theme_Material_Dialog_Alert);\n } else {\n builder = new AlertDialog.Builder(this);\n }\n\n View view = LayoutInflater.from(MainActivity.this).inflate(R.layout.alert_dialog_input,null);\n\n builder.setTitle(\"Faltan informacion requerida\")\n .setMessage(\"Completa los siguentes campos\")\n .setView(view);\n\n final EditText editTxtEmailDialog = view.findViewById(R.id.editTxtEmailAlertDialog);\n final EditText editTxtNicknameDialog = view.findViewById(R.id.editTxtNicknameAlertDialog);\n final EditText editTxtPasswordDialog = view.findViewById(R.id.editTxtPasswordAlertDialog);\n\n if(user.getEmail() != null)\n editTxtEmailDialog.setVisibility(View.GONE);\n\n builder.setPositiveButton(\"Registar\", new DialogInterface.OnClickListener() {\n @Override\n public void onClick(DialogInterface dialog, int which) {\n String email = user.getEmail() != null ? user.getEmail() : editTxtEmailDialog.getText().toString();\n String nickname = editTxtNicknameDialog.getText().toString();\n String password = editTxtPasswordDialog.getText().toString();\n if(!isValidateRegisterProvider(email,nickname,password))\n return;\n user.setEmail(email);\n user.setNickname(nickname);\n user.setPassword(password);\n\n\n\n //User aux = new User(user.getName(), user.getLastName(),nickname,email,password,\"\", user.getProvider());\n if(!Networking.isNetworkAvailable(MainActivity.this)) {\n Toast.makeText(MainActivity.this,\"No hay internet\",Toast.LENGTH_SHORT).show();\n return;\n }\n new Networking(MainActivity.this).execute(Networking.SIGNUP_PROVIDER, user,new NetCallback() {\n @Override\n public void onWorkFinish(Object... objects) {\n\n final User user_temp = (User) objects[0];\n if(user_temp.getId() != -1) {\n runOnUiThread(new Runnable() {\n @Override\n public void run() {\n Toast.makeText(MainActivity.this,\"Bienvenido\",Toast.LENGTH_SHORT).show();\n Intent intent = new Intent(MainActivity.this, InitActivity.class);\n Grua grua = new Grua(\"\",\"\", \"\");\n grua.setId(-1);\n intent.putExtra(Register.JSON_USER, user_temp.toJSON());\n intent.putExtra(Register.JSON_GRUA,grua.toJSON());\n SharedUtil.setUserNickname(MainActivity.this,user_temp.getNickname());\n SharedUtil.setUserPassword(MainActivity.this, user_temp.getPassword());\n SharedUtil.setUserProvider(MainActivity.this, user_temp.getProvider());\n startActivity(intent);\n }\n });\n }\n\n }\n\n @Override\n public void onMessageThreadMain(Object data) {\n final String message = (String) data;\n runOnUiThread(new Runnable() {\n @Override\n public void run() {\n Toast.makeText(MainActivity.this, message, Toast.LENGTH_SHORT).show();\n }\n });\n\n }\n });\n\n }\n }).setNegativeButton(\"Cancelar\", new DialogInterface.OnClickListener() {\n @Override\n public void onClick(DialogInterface dialog, int which) {\n //... Remover instancia iniciar con ...\n Toast.makeText(MainActivity.this,\"Su registro se ha cancelado\", Toast.LENGTH_SHORT).show();\n }\n })\n .setIcon(android.R.drawable.ic_dialog_info)\n .show();\n\n }","@Override\r\n\t\t\tpublic void onClick(View v) {\n\t\t\t\tString userName = input.getText().toString();\r\n\t\t\t\tString userColour = sprCoun.getSelectedItem()\r\n\t\t\t\t\t\t.toString();\r\n\t\t\t\tString userLangName = userLang;\r\n\r\n\t\t\t\tcontext.addNewUser(userName, userColour);\r\n\t\t\t\t\r\n\t\t\t\talertDialog.dismiss();\r\n\t\t\t}","public void mmCreateClick(ActionEvent event) throws Exception{\r\n displayCreateProfile();\r\n }","@Override\n public void onClick(DialogInterface dialog, int which) {\n dialog.dismiss();\n setUserInfo(user);\n }","public boolean onOkClicked() {\n try {\n if (form.isValid()) {\n String userName = form.getFieldValue(SysUser.USER_NAME_PROPERTY);\n String userAccount = form.getFieldValue(SysUser.USER_ACCOUNT_PROPERTY);\n String passWord = form.getFieldValue(SysUser.USER_PASSWORD_PROPERTY);\n String cPassWord = form.getFieldValue(\"cPassWord\");\n if (!passWord.equals(cPassWord)) {\n form.getField(SysUser.USER_PASSWORD_PROPERTY).setValue(\"\");\n form.getField(\"cPassWord\").setValue(\"\");\n form.getField(SysUser.USER_PASSWORD_PROPERTY).setFocus(true);\n addModel(\"msg\", \"密码不一致\");\n } else if (SysUserDao.getInstance().canCreate(getSysUser().getObjectContext(), userAccount)) {\n if (SysUserDao.getInstance().createSysUser(getSysUser().getObjectContext(), userName, userAccount, passWord)) {\n setRedirect(UserListPage.class);\n } else {\n addModel(\"msg\", \"失败\");\n }\n } else {\n form.getField(SysUser.USER_ACCOUNT_PROPERTY).setFocus(true);\n addModel(\"msg\", \"账号已存在\");\n }\n }\n } catch (Exception e) {\n logger.error(e.getLocalizedMessage(), e);\n }\n return true;\n }","public void agregarNuevoUsuario(){\n //recupero objeto rol usuario\n usuarioBean.getUsuario().setRol(new ListadoRoles().getListaRoles().get(1));\n usuarioBean.agregarUsuario(); \n FacesContext context = FacesContext.getCurrentInstance(); \n context.addMessage(null, new FacesMessage(\"Éxito\", \"Se agregó un Usuario correctamente.\" )); \n RequestContext.getCurrentInstance().execute(\"PF('dlgAltaUsuario').hide();\");\n }","@Override\n public void onClick(View v) {\n\n String name = fullname.getText().toString();\n String emailx = email.getText().toString();\n String password1 = password.getText().toString();\n String password2 = password_conf.getText().toString();\n progressDialog.setMessage(\"sign up your data\");\n showDialog();\n\n\n userdata = new UserData(name,emailx,password1,password2);\n Call<UserData> call = createUser.createUser(userdata);\n call.enqueue(new Callback<UserData>() {\n @Override\n public void onResponse(Call<UserData> call, Response<UserData> response) {\n if(response.isSuccessful()){\n Toast.makeText(RegisterActivity.this,\"Sign Up Success\",Toast.LENGTH_LONG).show();\n Intent intent = new Intent(getApplicationContext(), LoginActivity.class);\n startActivity(intent);\n finish();\n hideDialog();\n } else {\n Toast.makeText(getApplicationContext(),response.message(), Toast.LENGTH_LONG).show();\n hideDialog();\n }\n }\n\n @Override\n public void onFailure(Call<UserData> call, Throwable t) {\n Toast.makeText(getApplicationContext(), \"Error Connection\", Toast.LENGTH_LONG).show();\n hideDialog();\n }\n });\n }","public void confirmUser() {\r\n\r\n bpConfirmUser.setTop(vbText());//Add VBox to top\r\n bpConfirmUser.setCenter(gpCenter());//Add GridPane to center\r\n bpConfirmUser.setBottom(hbButtons()); //Add Hbox to bottom\r\n\r\n bpConfirmUser.setPadding(new Insets(10, 50, 50, 50)); //Padding\r\n\r\n bpConfirmUser.setId(\"bp\"); //SetID\r\n //Create Scene and add mainBorder to it\r\n Scene myScene = new Scene(bpConfirmUser, 400, 300);\r\n\r\n //Setup Stage\r\n confirmUserStage.setTitle(\"Confirm Information\"); //Set the title of the Stage\r\n myScene.getStylesheets().add(getClass().getClassLoader().getResource(\"createuser.css\").toExternalForm());\r\n confirmUserStage.setScene(myScene); //Add Scene to Stage\r\n\r\n confirmUserStage.show(); //Show Stage\r\n\r\n }","private void serchUser() {\n if (!userNameTextField.getText().isEmpty() && !passwordPasswordField.getText().isEmpty()) {\n try {\n User user = UserController.searchUserByUserName(userNameTextField.getText());\n if (user != null) {\n if (passwordPasswordField.getText().equals(user.getPassword())) {\n closeFadeOut();\n Hi hi = new Hi();\n hi.setUser(user);\n hi.setVisible(true);\n dispose();\n } else {\n JOptionPane.showMessageDialog(this, \"Incorrect username or password !\");\n passwordPasswordField.setText(\"\");\n userNameTextField.requestFocus();\n userNameTextField.selectAll();\n }\n } else {\n JOptionPane.showMessageDialog(this, \"Incorrect username or password !\");\n passwordPasswordField.setText(\"\");\n userNameTextField.requestFocus();\n userNameTextField.selectAll();\n }\n\n } catch (ClassNotFoundException ex) {\n ex.printStackTrace();\n } catch (SQLException ex) {\n ex.printStackTrace();\n }\n } else {\n JOptionPane.showMessageDialog(this, \"Please enter username and password\");\n passwordPasswordField.setText(\"\");\n userNameTextField.requestFocus();\n userNameTextField.selectAll();\n }\n\n }","private void registerUser()\n {\n /*AuthService.createAccount takes a Consumer<Boolean> where the result will be true if the user successfully logged in, or false otherwise*/\n authService.createAccount(entryService.extractText(namedFields), result -> {\n if (result.isEmpty()) {\n startActivity(new Intent(this, DashboardActivity.class));\n } else {\n makeToast(result);\n formContainer.setAlpha(1f);\n progressContainer.setVisibility(View.GONE);\n progressContainer.setOnClickListener(null);\n }\n });\n }","public void onClick(DialogInterface dialog, int whichButton) {\n String inputUsername = edittext.getText()\n .toString().trim().toLowerCase();\n\n ParseQuery userQuery = ParseUser.getQuery();\n userQuery.whereEqualTo(Keys.USERNAME_KEY, inputUsername);\n\n try {\n if (userQuery.count() > 0 && !(userQuery.getFirst().getObjectId()\n .equals(mCurrentUser.getObjectId()))) {\n ParseRelation myFriends = ParseUser.getCurrentUser()\n .getRelation(Keys.FRIENDS_KEY);\n myFriends.add(userQuery.getFirst());\n mCurrentUser.saveInBackground();\n HashMap<String, Object> params = new HashMap<String, Object>();\n\n params.put(\"friendId\", userQuery.getFirst().getObjectId());\n params.put(\"myName\", ParseUser.getCurrentUser().getUsername());\n\n ParseCloud.callFunctionInBackground\n (\"addFriend\", params, new FunctionCallback<String>() {\n @Override\n public void done(String s, ParseException e) {\n if (e == null) {\n mCurrentUser.increment\n (Keys.NUM_FRIENDS_KEY);\n mCurrentUser.saveInBackground();\n\n } else {\n AlertDialog.Builder builder = new\n AlertDialog.Builder(ActivityProfile.this);\n builder.setMessage(e.getMessage())\n .setCancelable(false)\n .setPositiveButton(\"OK\", new\n DialogInterface.OnClickListener() {\n public void onClick\n (DialogInterface dialog,\n int id) {\n dialog.cancel();\n }\n });\n builder.setTitle(\"Whoops!\");\n AlertDialog alert = builder.create();\n alert.show();\n }\n }\n });\n }\n } catch (ParseException e) {\n e.printStackTrace();\n }\n\n }","public void onClick(View view) {\n if(validate_info()){\n create_user();\n user = FirebaseAuth.getInstance().getCurrentUser();\n if (user != null) {\n submit_profile(user);\n }\n }\n else{\n return;\n\n\n }\n }","@SuppressWarnings({ \"rawtypes\", \"unchecked\", \"deprecation\" })\r\n\tprotected void btnCreateactionPerformed() {\n\t\tif ((confirmpasswordcreatejTextField.getText()).equals(passwordcreatejPasswordField.getText()))\r\n\t\t{\r\n\t\t\tjava.sql.Connection conObj = JdbcConnect.createConnection();\r\n\t\t\tjava.sql.ResultSet rs = null;\r\n\t\t\ttry {\r\n\t\t\t\trs = JdbcSelectUname.selectRecordFromTable(conObj,usrname);\r\n\t\t\t} catch (SQLException e) {\r\n\t\t\t\t// TODO Auto-generated catch block\r\n\t\t\t\tJOptionPane.showMessageDialog(null, e.getMessage(), \"Internal Error\", JOptionPane.ERROR_MESSAGE);\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\ttry {\r\n\t\t\t\tif (rs.next())\r\n\t\t\t\t{\r\n\t\t\t\t\t\tString role = (String) rolecreatejComboBox.getSelectedItem();\r\n\t\r\n\t\t\t\t\t\tjava.util.Vector add_rows = new java.util.Vector();\r\n\t\t\t\t\t\t//adding new user details to the Vector_add_rows\r\n\t\t\t\t\t\tadd_rows.add(unamecreatejTextField.getText());\r\n\t\t\t\t\t\tadd_rows.add(passwordcreatejPasswordField.getText());\r\n\t\t\t\t\t\tadd_rows.add(passHintTextField.getText());\r\n\t\t\t\t\t\tadd_rows.add(role);\r\n\t\r\n\t\t\t\t\t\tint i = JdbcCreateUser.insertRecords(conObj,add_rows);\r\n\t\r\n\t\t\t\t\t\tif (i!=1)\r\n\t\t\t\t\t\t{\r\n\t\t\t\t\t\t\tjavax.swing.JOptionPane.showMessageDialog(null, \"User@\"+unamecreatejTextField.getText()+\" not created\\nPlease try again...\", \"User@\"+unamecreatejTextField.getText()+\" error\", javax.swing.JOptionPane.ERROR_MESSAGE);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\telse {\r\n\t\t\t\t\t\t\tjavax.swing.JOptionPane.showMessageDialog(null, \"User@\"+unamecreatejTextField.getText()+\" added to the system\", \"User@\"+unamecreatejTextField.getText()+\" success message\", javax.swing.JOptionPane.PLAIN_MESSAGE);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t}//rs.next() if statement;\r\n\t\r\n\t\t\t\telse {\r\n\t\t\t\t\tjavax.swing.JOptionPane.showMessageDialog(null, \"Access denied! User@\"+usrname+\" not granted to create new users\", \"User@\"+usrname+\" authentication error\", javax.swing.JOptionPane.ERROR_MESSAGE);\r\n\t\t\t\t}\r\n\t\t\t} catch (HeadlessException e) {\r\n\t\t\t\t// TODO Auto-generated catch block\r\n\t\t\t\tJOptionPane.showMessageDialog(null, e.getMessage(), \"\", JOptionPane.ERROR_MESSAGE);\r\n\t\t\t} catch (SQLException e) {\r\n\t\t\t\t// TODO Auto-generated catch block\r\n\t\t\t\tJOptionPane.showMessageDialog(null, e.getMessage(), \"\", JOptionPane.ERROR_MESSAGE);\r\n\t\t\t}\r\n\t\t}\r\n\t\r\n\t\telse {\r\n\t\t\t\tjavax.swing.JOptionPane.showMessageDialog(null, \"Access Denied! The given password do not match\", \"Mismatch error\", javax.swing.JOptionPane.ERROR_MESSAGE);\t\t\t\t\t\t\r\n\t\t}\t\t\t\t\r\n\t}","public void new_user(){\n }","public void registrarUsuarioFinal(){\r\n Usuario nuevoUsuario= new Usuario();\r\n nuevoUsuario.setNombreUsuario(nuevoNombreUsuario);\r\n nuevoUsuario.setPassword(nuevoPasswordUsuario);\r\n nuevoUsuario.setTipoUsuario(\"final\");\r\n \r\n IUsuarioDAO iusuarioDAO = new UsuarioDAOImp();\r\n iusuarioDAO.agregarUsuario(nuevoUsuario);\r\n FacesMessage facesMessage = new FacesMessage(FacesMessage.SEVERITY_INFO, \"Usuario registrado\", \"Usuario registrado exitosamente\");\r\n FacesContext.getCurrentInstance().addMessage(null, facesMessage);\r\n\r\n }","@Override\n public void onClick(View v) {\n trasferisci_utente();\n\n // controlla se tutti i dati sono inseriti\n if (checkInput())\n {\n creaUser();\n NOME = username.getText().toString();\n CHIAVE = password.getText().toString();\n\n // controlla se l'utente USER con i dati inseriti negli edit_text è gia presente\n if (checkUser(persone, NOME, CHIAVE)) {\n\n errore_utente.setVisibility(View.GONE);\n\n // impedisce a due utenti di avere lo stesso username\n if(checkUsername(persone, NOME)) {\n\n errore_duplicato_username.setVisibility(View.GONE);\n\n persone.add(user);\n\n Intent showResult = new Intent(Registration.this, MainActivity.class);\n showResult.putExtra(PERSONA_PATH, persone);\n //showResult.putExtra(UTENTE_PATH, user);\n startActivity(showResult);\n } else {\n errore_duplicato_username.setVisibility(View.VISIBLE);\n }\n } else {\n errore_utente.setVisibility(View.VISIBLE);\n }\n }\n }","public void createUser(String name, String password, Boolean uBtn, Boolean eBtn){\n\t\t\n\t\tif(eBtn) {\n\t\t\tif(password.equals(\"\")) {\n\t\t\t\tSystem.out.println(\"Please enter Password\");\n\t\t\t\tJOptionPane.showMessageDialog(null, \"No password entered \" , \"Empty Password\", JOptionPane.ERROR_MESSAGE);\n\t\t\t}else if(name.equals(\"\")) {\n\t\t\t\tSystem.out.println(\"Please enter UserName\");\n\t\t\t\tJOptionPane.showMessageDialog(null, \"No UserName entered \" , \"Empty UserName\", JOptionPane.ERROR_MESSAGE);\n\t\t\t}else {\n\t\t\t\tEmployee e1 = new Employee(name);\n//\t\t\t\te1.setName(name);\n\t\t\t\t\n\t\t\t\tonlinestore.employeeList.put(e1, password);\n\t\t\t\tSystem.out.println(\"New Employee Created, Please login\");\n\t\t\t\tJOptionPane.showMessageDialog(null, \"New Employee Created. PLease Login Again\" , \"new Employee\", JOptionPane.PLAIN_MESSAGE);\n\t\t\t\t\n\t\t\t\tbuildEmployeeLoginGUI();\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t}\n\t\tif(uBtn) {\n\t\t\t\n\t\t\tif(password.equals(\"\")) {\n\t\t\t\tSystem.out.println(\"Please enter Password\");\n\t\t\t\tJOptionPane.showMessageDialog(null, \"No password entered \" , \"Empty Password\", JOptionPane.ERROR_MESSAGE);\n\t\t\t}else if(name.equals(\"\")) {\n\t\t\t\tSystem.out.println(\"Please enter UserName\");\n\t\t\t\tJOptionPane.showMessageDialog(null, \"No UserName entered \" , \"Empty UserName\", JOptionPane.ERROR_MESSAGE);\n\t\t\t}else {\n\t\t\t\tSystem.out.println(\"User radio button pressed\");\n\t\t\t\tCustomer c1 = new Customer(name);\n\t\t\t\t//c1.setName(name);\n\t\t\t\t\n\t\t\t\tonlinestore.customerList.put(c1, password);\n\t\t\t\t//System.out.println(\"New Customer Created, Please Login\");\n\t\t\t\tJOptionPane.showMessageDialog(null, \"New Customer Created. Please Login Again \" , \"new Customer\", JOptionPane.PLAIN_MESSAGE);\n\t\t\t\tbuildCustomerLoginGUI();\n\t\t\t\t\n\t\t\t}\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t}\n\n\t}","@FXML void saveUser(ActionEvent e) {\n\t\tString userName = userNameTxt.getText().trim();\n\t\t\n\t\tif(userName.isEmpty()) {\n\t\t\tAlert alert = new Alert(Alert.AlertType.ERROR);\n alert.setTitle(\"Error\");\n alert.setContentText(\"User name cannot be blank.\");\n alert.showAndWait();\n\t\t}else {\n\t\t\t/*if(userList.contains(user)) {\n\t\t\t\t//give error\n\t\t\t\tuserNameTxt.clear();\n\t\t\t}\n\t\t\telse {\n\t\t\t\tuserList.add(user);\n\t\t\t\tSystem.out.println(userList.toString());\n\t\t\t\tuserNameTxt.clear();\n\t\t\t\t\n\t\t\t}*/\n\t\t\t\n\t\t\t//userList.add(user);\n\t\t\t\n\t\t\t//checks if user is in list\n\t\t\tif(userInList(userName)) {\n\t\t\t\t\n\t\t\t\tAlert alert = new Alert(Alert.AlertType.ERROR);\n\t alert.setTitle(\"Error\");\n\t alert.setContentText(\"User name already exists.\");\n\t alert.showAndWait();\n\t\t\t\tuserNameTxt.clear();\n\t\t\t}else {\n\t\t\t\tUser user = new User(userName);\n\t\t\t\tuserList.add(user);\n\t\t\t\tuserNameTxt.clear();\n\t\t\t\t//userListView.refresh();\n\t\t\t\tuserListView.setItems(userList);\n\t\t\t}\n\t\t\t\n\t\t}\n\t\t\n\t\t\n\t\thideAdditionElements();\n\t}","public void register_user(View view) {\n CustomRestaurantTypeDialog customRestaurantTypeDialog = new CustomRestaurantTypeDialog();\n customRestaurantTypeDialog.show(getSupportFragmentManager(), \"testing\");\n }","public void userCreated(UserCreateCommand command) {\n\t\t}","@Override\r\n\t\t\tpublic void onSuccess() {\n\t\t\t\tfinal User c = userManager.getCurrentUser(User.class);\r\n\t\t\t\tShowToast(\"修改成功:\"+c.getNick());\r\n\t\t\t\tfinish();\r\n\t\t\t}","public void success() {\n Toast.makeText(ui.getApplicationContext(),\"Account successfully created!\",Toast.LENGTH_SHORT).show();\n }","public void addUserBtn(){\n\t\t\n\t\t// TODO: ERROR CHECK\n\t\t\n\t\tUserEntry user = new UserEntry(nameTF.getText(), (String)usertypeCB.getValue(), emailTF.getText());\n\t\tAdminController.userEntryList.add(user);\n\t\t\n\t\t\n\t\t// Create a UserEntry and add it to the observable list\n\t\tAdminController.userList.add(user);\t\t\n\t\t\n\t //AdminController.adminTV.setItems(AdminController.userList);\n\t\t\n\t\t//Close current stage\n\t\tAdminController.addUserStage.close();\n\t\t\n\t}","@Override\n protected void onPostExecute(JSONArray user) {\n Context context1 = getApplicationContext();\n Toast new_toast = Toast.makeText(context1, \"User has been created\", Toast.LENGTH_LONG);\n new_toast.show();\n }","private void openCreateAccountDialog()\n {\n testDialog();\n\n }","public void gotoCreateUser(){\n try {\n FXMLCreateUserController verCreateUser = (FXMLCreateUserController) replaceSceneContent(\"FXMLCreateUser.fxml\");\n verCreateUser.setApp(this);\n } catch (Exception ex) {\n Logger.getLogger(IndieAirwaysClient.class.getName()).log(Level.SEVERE, null, ex);\n }\n }","public void onSignUpClick() {\n\t\tString uid = regview.getUsername();\n\t\tString pw = regview.getPassword();\n\t\tString na = regview.getName();\n\t\tString em = regview.getEmail();\n\t\tString text = \"\";\n\t\tif(uid.equals(\"\") || pw.equals(\"\") || na.equals(\"\")|| em.equals(\"\")){\n\t\t\ttext = \"Please fill out all fields!\";\n\t\t} else if(regview.findUser(uid)!=User.NULL_USER){\n\t\t\ttext = \"The username already exsit, please try another one!\";\n\t\t} else {\n\t\t\tregview.addUser(new User(uid,pw,na,em));\n\t\t\tregview.goLoginPage();\n\t\t}\n\t\tregview.setRegisterText(text);\n\t}","private ShowCreateAnswerPage() {\n this.service = UserService.retrieve();\n this.validator = Validator.retrieve();\n }","@Override\n public void done(User returnedUser) {\n startActivity(new Intent(Register.this, Login.class));\n }","private Dialog recreateDialog() {\n final AlertDialog.Builder builder = new AlertDialog.Builder(OptionActivity.this);\n builder.setMessage(\"Do you want to change your profile?\")\n .setPositiveButton(\"Yah!\", new DialogInterface.OnClickListener() {\n public void onClick(DialogInterface dialog, int id) {\n Intent intent = new Intent(OptionActivity.this, amountscreen.class);\n startActivity(intent);\n }\n })\n .setNegativeButton(\"Nope\", new DialogInterface.OnClickListener() {\n public void onClick(DialogInterface dialog, int id) {\n\n }\n });\n // Create the AlertDialog object and return it\n return builder.create();\n }","@Override\n\t\t\tpublic void onClick(View v) {\n\t\t\t\tIntent inten = new Intent(Main_Activity.this, Create_User.class);\n\t\t\t\tBundle myBundle = new Bundle();\n\t\t\t\tString u =userName;\n\t\t\t\tlog.info(\"in create coach user is: \"+u);\n\t\t\t\tif(coach_user.isEmpty()) {\n\t\t\t\t\tcoach_user=\"\";\n\t\t\t\t}\n\t\t\t\tmyBundle.putString(\"usern\", u);\n\t\t\t\tinten.putExtras(myBundle);\n\t\t\t\tstartActivityForResult(inten, 234);\n\t\t\t\t}","@FXML\n private void handleNewPerson() {\n Shops tempShops = new Shops();\n boolean okClicked = mainApp.showPersonEditDialog(tempShops);\n if (okClicked) {\n mainApp.getPersonData().add(tempShops);\n }\n }","@Override\n public void onSuccess(AuthResult authResult) {\n userWAPFirebase.create(newUser, firebaseAuth.getCurrentUser().getUid()).addOnSuccessListener(new OnSuccessListener<Void>() {\n @Override\n public void onSuccess(Void aVoid) {\n Log.d(TAG, \"User \" + newUser.getUsername() + \" has been successfully created\");\n Toast.makeText(SignUpActivity.this, \"Sign up successful!\", Toast.LENGTH_SHORT).show();\n\n //Go back to Login Activity\n Intent loginIntent = new Intent(SignUpActivity.this, LoginActivity.class);\n loginIntent.putExtra(PASSWORD_KEY, etPasswordSignup.getText().toString());\n loginIntent.putExtra(EMAIL_KEY, newUser.getEmail());\n startActivity(loginIntent);\n }\n });\n }","public String createUserAction()throws Exception{\n\t\tString response=\"\";\n\t\tresponse=getService().getUserMgmtService().createNewUser(\n\t\t\t\tgetAuthBean().getUserName(),\n\t\t\t\tgetAuthBean().getFirstName(),\n\t\t\t\tgetAuthBean().getLastName(),\n\t\t\t\tgetAuthBean().getEmailId(),\n\t\t\t\tgetAuthBean().getRole()\n\t\t);\n\t\tgetAuthBean().setResponse(response);\n\t\tinputStream = new StringBufferInputStream(response);\n\t\tinputStream.close();\n\t\treturn SUCCESS;\n\t}","@Override\n public void onClick(View view) {\n UpdateUserInformation();\n addUserChangeListener();\n/*\n //check for already exists\n if (TextUtils.isEmpty(userID)) {\n\n createUser(name, email, userMobile,userLatitude, userLongitude);\n Intent intent = new Intent(UserRegister.this, MapView.class);\n startActivity(intent);\n return;\n\n } else {\n //updateUser(name, email, userMobile,userLatitude, userLongitude);\n //UpdateUserInformation();\n }\n*/\n }","public void agregarNuevoUsuarioAdmin(){\n //recupero objeto rol administrador\n usuario.setRol(new ListadoRoles().getListaRoles().get(0));\n usuarioBean.setUsuario(usuario);\n usuarioBean.agregarUsuario();\n FacesContext context = FacesContext.getCurrentInstance(); \n context.addMessage(null, new FacesMessage(\"Éxito\", \"Se agregó un Usuario Administrador correctamente.\" ));\n RequestContext.getCurrentInstance().execute(\"PF('dlgAltaUsuario').hide();\");\n }","void register() {\n if (registerView.getFirstName().length() == 0 || registerView.getLastName().length() == 0 || registerView.getUsername().length() == 0 || registerView.getPassword().length() == 0) {\n IDialog invalidRegistrationDialog\n = dialogFactory.createDialog(DialogFactoryOptions.dialogNames.MESSAGE, new HashMap<String, Object>() {\n {\n put(\"message\", \"Unable to register: Fields must be non-empty!\");\n put(\"title\", \"Authentication Error\");\n put(\"messageType\", DialogFactoryOptions.dialogType.ERROR);\n }\n });\n\n invalidRegistrationDialog.run();\n } else {\n if (userController.registerUser(registerView.getFirstName(), registerView.getLastName(), registerView.getUsername(), registerView.getPassword()) != null) {\n mainFrame.setPanel(panelFactory.createPanel(PanelFactoryOptions.panelNames.MAIN_MENU));\n } else {\n IDialog invalidRegistrationDialog = dialogFactory.createDialog(DialogFactoryOptions.dialogNames.MESSAGE, new HashMap<String, Object>() {\n {\n put(\"message\", \"Unable to register: Username is already taken\");\n put(\"title\", \"Authentication Error\");\n put(\"messageType\", DialogFactoryOptions.dialogType.ERROR);\n }\n });\n\n invalidRegistrationDialog.run();\n }\n }\n }","public void insert()\n {\n CInsertUser cInsertUser = new CInsertUser();\n window.dispose();\n }","private void successDialog() {\n AlertDialog dialog = _dialogFactory.createDialog(this, R.string.completed, R.string.success);\n\n dialog.setButton(DialogInterface.BUTTON_NEUTRAL, getString(R.string.ok), new DialogInterface.OnClickListener() {\n public void onClick(DialogInterface dialog, int id) {\n gotoGameEnd(IGameConstants.GAME_SUCCESS);\n }\n });\n\n dialog.setCancelable(false);\n _dialogActive = true;\n dialog.show();\n }","private void SuccessfulBox(View v){\n \t//create an alert box with specified properties\n \tnew AlertDialog.Builder(this)\n \t.setTitle(\"Submit Successfully!\")\n \t.setMessage(\"New prescription information has been added to\" + \" \" +item)\n \t.setNeutralButton(\"ok\", null)\n \t.show();\n }","public void newUserClicked(View view) {\r\n Intent intent = new Intent(this, SignUpActivity.class);\r\n startActivity(intent);\r\n }","private void onSignupSuccess() {\n startActivity(currentActivity, UserLoginActivity.class);\n finish();\n }","public void registerNewUser(View v) {\n Intent intent = new Intent(this, com.mms.memorizationgame.RegisterActivity.class);\n\n finish();\n startActivity(intent);\n }","@Override\n protected void onActivityResult(int requestCode, int resultCode, @Nullable Intent data) {\n if (CREATE_USER_REQUEST_CODE == requestCode && RESULT_OK == resultCode){\n if (data != null) {\n String username = data.getStringExtra(UserCreationActivity.BUNDLE_NEW_USER_NAME);\n\n User user = new User(username, User.EMPTY_CASE, User.EMPTY_CASE);\n\n createUser(user);\n }\n }\n }","private void addNewUser() throws Exception, UnitException {\n String firstNameInput = firstName.getText();\n String lastNameInput = lastName.getText();\n String unitInput = unitID.getText();\n String accountInput = accountTypeValue;\n String passwordInput = password.getText();\n User newUserInfo;\n\n // Create user type based on the commandbox input\n switch (accountInput) {\n case \"Employee\":\n newUserInfo = new Employee(firstNameInput, lastNameInput, unitInput, passwordInput);\n break;\n case \"Lead\":\n newUserInfo = new Lead(firstNameInput, lastNameInput, unitInput, passwordInput);\n break;\n case \"Admin\":\n newUserInfo = new Admin(firstNameInput, lastNameInput, unitInput, passwordInput);\n break;\n default:\n throw new IllegalStateException(\"Unexpected value: \" + accountInput);\n }\n\n // Try adding this new user information to the database, if successful will return success prompt\n try {\n Admin.addUserToDatabase(newUserInfo);\n\n // If successful, output message dialog\n String msg = \"New User \" + firstNameInput + \" \" + lastNameInput + \" with UserID \"\n + newUserInfo.returnUserID() + \" successfully created\";\n JOptionPane.showMessageDialog(null, msg);\n\n // Reset Values\n firstName.setText(\"\");\n lastName.setText(\"\");\n unitID.setText(\"\");\n password.setText(\"\");\n } catch (UserException e) {\n JOptionPane.showMessageDialog(null, e.getMessage());\n } catch (Exception e) {\n JOptionPane.showMessageDialog(null, e.getMessage());\n }\n }","@Override\r\n\tprotected void okPressed() {\n\t\t\r\n\t\tfor(TableItem item:tv.getTable().getItems()){\r\n\t\t\tUser friend=(User) item.getData();\r\n\t\t\tTranObject<User> msg=new TranObject<User>(TranObjectType.CLIENT_TO_SEVER);\r\n\t\t\tmsg.setFromUser(user.getId());\r\n\t\t\tmsg.setToUser(friend.getId());\r\n\t\t\t//msg.setObject(user);\r\n\t\t\tmsg.setObjStr(gson.toJson(user));\r\n\t\t\tmsg.setRequest(ClientRequest.ADD_FRIEND);\r\n\t\t\tc.getWriteThread().setMsg(msg);\r\n//\t\t\tString category_name=combo.getText();\r\n//\t\t\tCategory new_category=null;\r\n//\t\t\tfor(Category category:user.getCategorys()){\r\n//\t\t\t\tif(category.getKey().equals(category_name)){\r\n//\t\t\t\t\tnew_category=category;\r\n//\t\t\t\t\tbreak;\r\n//\t\t\t\t}\r\n//\t\t\t}\r\n//\t\t\tif(new_category==null){\r\n//\t\t\t\tnew_category=new Category();\r\n//\t\t\t\tnew_category.setKey(category_name);\r\n//\t\t\t\tuser.getCategorys().add(new_category);\r\n//\t\t\t}\r\n//\t\t\tnew_category.getMembers().add(friend);\r\n\t\t\t\r\n\t\t}\r\n\t\t\r\n\t\tsuper.okPressed();\r\n\t}","@Override\n public Dialog onCreateDialog(Bundle savedInstanceState) {\n\n LayoutInflater inflater = getActivity().getLayoutInflater();\n\n\n AlertDialog.Builder builder = new AlertDialog.Builder(getActivity());\n builder.setMessage(\"CREA USUARIO\")\n .setView(inflater.inflate(R.layout.register_dialog, null))\n .setPositiveButton(\"OK\", new DialogInterface.OnClickListener() {\n public void onClick(DialogInterface dialog, int id) {\n editUser = ((AlertDialog) dialog).findViewById(R.id.username);\n editPass = ((AlertDialog) dialog).findViewById(R.id.password);\n startConexion();\n }\n })\n .setNegativeButton(\"CANCEL\", new DialogInterface.OnClickListener() {\n public void onClick(DialogInterface dialog, int id) {\n // User cancelled the dialog\n }\n });\n // Create the AlertDialog object and return it\n return builder.create();\n }","public UserDialog(JFrame parent){\n\t\t\tsuper(parent, \"New user\");\n\t\t\tadd(new JPanel(), BorderLayout.NORTH);\n\t\t\tadd(new UserDatapanel(),BorderLayout.CENTER);\n\t\t\tadd(getButtonPanel(),BorderLayout.SOUTH);\n\t\t\tsetSize(500,300);\n\t\t}","public void greetingUser() {\n\n\n //Showing dialog\n\n final Dialog dialog = new Dialog(UserHomeActivity.this);\n dialog.requestWindowFeature(Window.FEATURE_NO_TITLE);\n dialog.setContentView(R.layout.greetinguser);\n dialog.getWindow().setBackgroundDrawable(new ColorDrawable(Color.TRANSPARENT));\n dialog.show();\n\n\n //Shared preference object for auto login\n\n final AutoLogin shared = new AutoLogin(this);\n\n\n //Hooks\n\n backButton = dialog.findViewById(R.id.backButton);\n userName = dialog.findViewById(R.id.userNamegreeting);\n greetingMsg = dialog.findViewById(R.id.greetings);\n\n //Setting greeting\n\n\n Calendar cal = Calendar.getInstance();\n Date date=cal.getTime();\n DateFormat dateFormat = new SimpleDateFormat(\"HH:mm:ss\");\n String formattedDate=dateFormat.format(date);\n\n //Splitting the date\n\n String[] timeInString = formattedDate.split(\":\");\n\n\n int time = Integer.parseInt(timeInString[0]);\n\n if(time>=0 && time<12){\n\n greetingMsg.setText(\"Good Morning\");\n\n }\n else if(time>=12 && time<17){\n\n greetingMsg.setText(\"Good Afternoon\");\n\n }\n else{\n\n greetingMsg.setText(\"Good evening\");\n\n }\n\n\n //Setting user name\n\n userName.setText(shared.getUserName());\n\n //User will click on back button\n backButton.setOnClickListener(new View.OnClickListener() {\n @Override\n public void onClick(View view) {\n dialog.dismiss();\n }\n });\n\n\n }","public void UserHasBeenRegistered() {\r\n\t\t\tJOptionPane.showMessageDialog(new JFrame(), \"User has been registered\",\"\", JOptionPane.INFORMATION_MESSAGE);\r\n\t\t\tNameTF.setText(\"\");\r\n\t\t\tSurnameTF.setText(\"\");\r\n\t\t\tUsernameTF.setText(\"\");\r\n\t\t\tPasswordTF.setText(\"\");\r\n\t\t\tEmailTF.setText(\"\");\r\n\t\t\tAddressTF.setText(\"\");\r\n\t\t\tCardNTF.setValue(null);\r\n\t\t}","@FXML private void setToNewUser(){\n\t\tshowPassword();\n\t\tclearFields();\n\t\thideLackMessages();\n\t\tchangeCancelButton.setText(\"Anuluj\");\n\t\tnewUser = true;\n\t}","public Dialog createAddPersonDialog(String title, String msg) {\n AlertDialog.Builder builder = new AlertDialog.Builder(getMyAcitivty());\n builder.setTitle(title);\n builder.setMessage(msg);\n\n // Use an EditText view to get user input.\n final EditText input = new EditText(getMyAcitivty());\n input.setText(\"\");\n builder.setView(input);\n\n builder.setPositiveButton(\"Ok\", new DialogInterface.OnClickListener() {\n @Override\n public void onClick(DialogInterface dialog, int whichButton) {\n String value = input.getText().toString();\n Log.d(TAG, \"user input: \" + value);\n inputDialogResult = value;\n launchTrainingActivity();\n// AlertDialog dg =\n// SelectServerAlertDialog.createDialog(\n// getContext(),\n// \"Pick a Server\",\n// getAllIps(),\n// launchTrainingActivityAction,\n// cancelAction,\n// true);\n// dg.show();\n }\n });\n builder.setNegativeButton(\"Cancel\", SelectServerAlertDialog.cancelAction);\n return builder.create();\n }","@Override\n\tpublic void onActivityResult(int requestCode, int resultCode, Intent data) {\n\t\tif (resultCode != -1 && resultCode !=0) {\n\t\t\tappState.userID = data.getStringExtra(\"uid\");\n\t\t\tappState.userName = data.getStringExtra(\"name\");\n\t\t\tappState.note = data.getStringExtra(\"note\");\t\n\t\t\tif (\"none\".equals(appState.userID)) {\n\t\t\t\tnew AlertDialog.Builder(getActivity())\n\t\t\t\t.setTitle(\"No user found\")\n\t\t\t\t.setMessage(\"There's no user found in your device, please ADD one in User page.\")\n//\t\t\t\t.setNegativeButton(\"Cancel\",\n//\t\t\t\t\t\tnew DialogInterface.OnClickListener() {\n//\t\t\t\t\t\t\t@Override\n//\t\t\t\t\t\t\tpublic void onClick(DialogInterface dialog, int which) {\n//\t\t\t\t\t\t\t\t//this.s = \"Negative\";\n//\t\t\t\t\t\t\t}\n//\t\t\t\t\t\t})\n\t\t\t\t.setPositiveButton(\"Confirm\", new DialogInterface.OnClickListener() {\n\t\t\t\t\t\t\tpublic void onClick(DialogInterface dialog, int whichButton) {\n\t\t\t\t\t\t\t}\n\t\t\t\t}).show();\n\t\t\t} else {\n\t\t\t\ttv_user1_dianzichen.setTextColor(Color.BLACK);\n\t\t\t\ttv_user2_dianzichen.setTextColor(Color.BLACK);\n\t\t\t\t\n\t\t\t\tupdateUI();\t\n\t\t\t}\n\t\t\t\n\t\t}\n\t}","private void notifySelectedUser() {\n\t\tfinal GHAGridRecord<SSOUser> selectedRecord = grid.getSelectedRecord();\n\t\tif (selectedRecord == null) {\n\t\t\tGHAErrorMessageProcessor.alert(\"record-not-selected\");\n\t\t\treturn;\n\t\t}\n\t\tnotifyUser(selectedRecord.toEntity());\n\t\thide();\n\t}","public void Report_User_alert(){\n final AlertDialog.Builder alert=new AlertDialog.Builder(context,R.style.DialogStyle);\n alert.setTitle(\"Report\")\n .setMessage(\"Are you sure to Report this user?\")\n .setNegativeButton(\"No\", new DialogInterface.OnClickListener() {\n public void onClick(DialogInterface dialog, int id) {\n dialog.dismiss();\n }\n })\n .setPositiveButton(\"yes\", new DialogInterface.OnClickListener() {\n @Override\n public void onClick(DialogInterface dialog, int which) {\n Send_report();\n }\n });\n\n alert.setCancelable(true);\n alert.show();\n }","public void addData(final String name,final int phone){\n boolean isInserted = myDb.insertData(name,phone);\n if (isInserted =true){\n builder.setTitle(\" User Created Successfully\");\n builder.setMessage(\" Name : \"+ name +\"\\n Phone : +265\"+ phone);\n builder.setPositiveButton(\"OK\", new DialogInterface.OnClickListener() {\n @Override\n public void onClick(DialogInterface dialogInterface, int i) {\n ///// go to general assessment///////\n\n mainActivity();\n }\n });\n AlertDialog alertDialog = builder.create();\n alertDialog.show();\n }\n else {\n builder.setTitle(\"User Creation\");\n builder.setMessage(\"Response : Sorry Error occured!! Try again \" );\n builder.setNegativeButton(\"Try Again\", new DialogInterface.OnClickListener() {\n @Override\n public void onClick(DialogInterface dialogInterface, int i) {\n\n }\n });\n AlertDialog alertDialog = builder.create();\n alertDialog.show();\n }\n }","public void dialogoAgregarUsuario() {\n vAgregarUsuario = new V_AgregarUsuario(new JFrame(), true);\n vAgregarUsuario.setVisible(true);\n }","public void createAccount() {\n\t\t// Assigns variables based on user input\n\t\tString username = usernameField.getText();\n\t\tString firstName = firstNameField.getText();\n\t\tString lastName = lastNameField.getText();\n\t\tString address = addressField.getText();\n\t\tString postCode = postcodeField.getText();\n\t\tString phoneNumber = phoneNumberField.getText();\n\t\tlong phoneNumberLong;\n\t\tif (username.isEmpty() || firstName.isEmpty() || lastName.isEmpty() || address.isEmpty() || postCode.isEmpty()\n\t\t\t\t|| phoneNumber.isEmpty()) { // Checks if number is correct format\n\n\t\t\tAlert alert = new Alert(AlertType.ERROR); // Error message\n\t\t\talert.setTitle(\"Error\");\n\n\t\t\talert.setHeaderText(\"Could not create an user\");\n\t\t\talert.setContentText(\"Make sure you fill all fields and press button again\");\n\t\t\talert.showAndWait();\n\n\t\t\treturn;\n\t\t}\n\n\t\telse {\n\t\t\ttry {\n\t\t\t\tphoneNumberLong = Long.parseLong(phoneNumber);\n\t\t\t} catch (Exception e) {\n\t\t\t\tAlert alert = new Alert(AlertType.ERROR);\n\t\t\t\talert.setTitle(\"Error\");\n\n\t\t\t\talert.setHeaderText(\"Wrong format of phone number\");\n\t\t\t\talert.setContentText(\"Please enter correct phone number\");\n\t\t\t\talert.showAndWait();\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t\n\t\t\tif(FileReader.exists(username)) {\n\t\t\t\tAlert alert = new Alert(AlertType.ERROR);\n\t\t\t\talert.setTitle(\"Error\");\n\n\t\t\t\talert.setHeaderText(\"User with the username \"+ username +\" already exists. \");\n\t\t\t\talert.setContentText(\"Please choose another username\");\n\t\t\t\talert.showAndWait();\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tString userdata = \"\";\n\t\t\tuserdata += \"\\n Username: \" + username;\n\t\t\tuserdata += \"\\n First name: \" + firstName;\n\t\t\tuserdata += \"\\n Last name: \" + lastName;\n\t\t\tuserdata += \"\\n Address: \" + address;\n\t\t\tuserdata += \"\\n Post code: \" + postCode;\n\t\t\tuserdata += \"\\n Phone number: \" + phoneNumberLong;\n\t\t\t\n\n\t\t\tif(custom) {\n\t\t\t\tavatarIndex = 101;\n\t\t\t\t// Gives users the custom avatar\n\t\t\t\tFile file1 = new File(\"artworkImages/\" + username);\n\t\t\t\tfile1.mkdir();\n\t\t\t\tPath path = Paths.get(\"customAvatars/\" + username + \".png\");\n\t\t\t\tString path1 = \"tmpImg.png\";\n\t\t\t\tFile file = new File(path1);\n\n\t\t\t\ttry {\n\t\t\t\t\tFiles.copy(file.toPath(), path, StandardCopyOption.REPLACE_EXISTING);\n\t\t\t\t} catch (IOException e) {\n\t\t\t\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tUser user = new User(username, firstName, lastName, address, postCode, phoneNumberLong, avatarIndex);\n\t\t\tFileReader.addUser(user); // Creates user\n\n\t\t\ttry {\n\t\t\t\tWriter.writeUserFile(user); // Adds user to memory\n\t\t\t} catch (IOException e) {\n\t\t\t\n\t\t\t\te.printStackTrace();\n\t\t\t}\n\t\t\t\n\n\t\t\tAlert alert = new Alert(AlertType.INFORMATION); // Success message\n\t\t\talert.setTitle(\"Success\");\n\n\t\t\talert.setHeaderText(\"The user has been created\");\n\t\t\talert.setContentText(\"Close this window to return to login screen\");\n\t\t\talert.showAndWait();\n\n\t\t\tcreateAccountButton.getScene().getWindow().hide();\n\t\t}\n\n\t}","@Override\n public void onSuccess(UserBean userBean) {\n finish();\n startActivity(MainActivity.startIntent(getActivity()));\n }","@Override\n public void onClick(ClickEvent event) {\n String mobileNr = content.getLoginView().getMobilenrTxtBox().getText();\n String password = content.getLoginView().getPasswordTxtBox().getText();\n\n // RPC authenticating user method\n motionCBSTestService.authorizeUser(mobileNr, password, new AsyncCallback<User>() {\n\n @Override\n public void onFailure(Throwable caught) {\n Window.alert(\"Der skete en fejl\");\n }\n\n @Override\n public void onSuccess(User user) {\n\n // Failed to match input with User in database\n if (user == null) {\n Window.alert(\"Wrong password or mobile number!\");\n } else if (user.getIsApproved() != true) {\n Window.alert(\"User not approved!\");\n } else\n\n\n\n // Here we check the type and if they are type 1 we go to admin view and the other way around\n if (user.getType() == 1) {\n adminController.loadUser(user);\n content.changeView(content.getMainAdminView());\n } else if (user.getType() == 2) {\n userController.loadUser(user);\n content.changeView(content.getMainUserView());\n }\n\n // Clearing the text fields (mobileNr & password) from the login screen\n content.getLoginView().clearTextBoxFields();\n }\n });\n }","void changeUser(){\n\t\tfinal FrameLayout fl = new FrameLayout(this);\n\n\t\tfinal EditText newUID = new EditText(this);\n\t\tfinal LinearLayout nameHolder = new LinearLayout(this);\n\t\tnameHolder.setOrientation(1);//Vertical\n//\t\tinputName.setGravity(Gravity.CENTER);\n//\t\tinputTitle.setGravity(Gravity.CENTER);\n\t\t//MAX 2 digits! HARDCODED\n\t\t//Limit them to a certain amount of digits\n\t\tInputFilter[] FilterArray = new InputFilter[1];\n\t\tFilterArray[0] = new InputFilter.LengthFilter(2);\n\t\tnewUID.setFilters(FilterArray);\n\t\t\n\t\tnameHolder.addView(newUID, new FrameLayout.LayoutParams(\n\t\t\t\tFrameLayout.LayoutParams.FILL_PARENT,\n\t\t\t\tFrameLayout.LayoutParams.WRAP_CONTENT));\n\t\t\n\t\tfl.addView(nameHolder, new FrameLayout.LayoutParams(\n\t\t\t\tFrameLayout.LayoutParams. FILL_PARENT,\n\t\t\t\tFrameLayout.LayoutParams.FILL_PARENT));\n\n\t\t// input.setText(\"Preset Text\");\n\t\tnewUID.setHint(\"NUMBER: 00-99\");\n\t\tnewUID.setInputType(InputType.TYPE_CLASS_NUMBER);\n\n\t\tAlertDialog newprojPopUp = new AlertDialog.Builder(this).create();\n\n\t\t//Show the keyboard automatically\n\t\tnewprojPopUp.setOnShowListener(new OnShowListener() {\n\n\t\t @Override\n\t\t public void onShow(DialogInterface dialog) {\n\t\t InputMethodManager imm = (InputMethodManager) getSystemService(Context.INPUT_METHOD_SERVICE);\n\t\t imm.showSoftInput(newUID, InputMethodManager.SHOW_FORCED);\n\t\t }\n\t\t});\n\t\t\n\t\tnewprojPopUp.setView(fl);\n\n\t\tnewprojPopUp.setTitle(\"Enter your USER ID (00-99)\");\n\n\t\t// Create Button\n\t\tnewprojPopUp.setButton(\"Enter\",\n\t\t\t\tnew DialogInterface.OnClickListener() {\n\n\t\t\t\t\tpublic void onClick(\n\t\t\t\t\t\t\tfinal DialogInterface dMAIN,\n\t\t\t\t\t\t\tint which) {\n\n\t\t\t\t\t\tuserID=Integer.parseInt(newUID.getText().toString().trim());\n\t\t\t\t\t\tuserButton.setText(\"USER: \"+userIDformatter.format(userID));\n\t\t\t\t\t\tToast.makeText(\n\t\t\t\t\t\t\t\tgetApplicationContext(),\n\t\t\t\t\t\t\t\t\"New User ID = \"+userID,\n\t\t\t\t\t\t\t\t1).show();\n\t\t\t\t\t\tmakeUser();\n\t\t\t\t\t\tloadUpAllPics();\n\n\n\t\t\t\t\t}\n\n\t\t\t\t});\n\t\t// Cancel Button\n\t\tnewprojPopUp.setButton2(\"Cancel\",\n\t\t\t\tnew DialogInterface.OnClickListener() {\n\n\t\t\t\t\t@Override\n\t\t\t\t\tpublic void onClick(DialogInterface d,\n\t\t\t\t\t\t\tint which) {\n\n\t\t\t\t\t\t d.dismiss();\n\n\t\t\t\t\t}\n\n\t\t\t\t});\n\n\t\tnewprojPopUp.show();\n\t\tnewUID.requestFocus();\n\t\tnewprojPopUp\n\t\t\t\t.getWindow()\n\t\t\t\t.setSoftInputMode(\n\t\t\t\t\t\tWindowManager.LayoutParams.SOFT_INPUT_STATE_ALWAYS_VISIBLE);\n\n\n\t\t\n\t}","@SuppressLint(\"InflateParams\")\r\n\tprivate void showDialog() {\n\t\tLayoutInflater layoutInflater = LayoutInflater.from(getActivity());\r\n\t\tviewAddEmployee = layoutInflater\r\n\t\t\t\t.inflate(R.layout.activity_dialog, null);\r\n\t\teditText = (EditText) viewAddEmployee.findViewById(R.id.editText1);\r\n\t\ttv_phone = (TextView) viewAddEmployee.findViewById(R.id.tv_phone);\r\n\t\tbt_setting = (Button) viewAddEmployee.findViewById(R.id.bt_setting);\r\n\t\tbt_cancel = (Button) viewAddEmployee.findViewById(R.id.bt_cancel);\r\n\t\tString tel = SharePreferenceUtil.getInstance(\r\n\t\t\t\tgetActivity().getApplicationContext()).getUserTel();\r\n\t\ttv_phone.setText(StringUtils.getTelNum(tel));\r\n\r\n\t\tshowPop();\r\n\r\n\t\tbt_setting.setOnClickListener(new OnClickListener() {\r\n\r\n\t\t\t@Override\r\n\t\t\tpublic void onClick(View v) {\r\n\t\t\t\t// TODO Auto-generated method stub\r\n\t\t\t\tString psd = SharePreferenceUtil.getInstance(\r\n\t\t\t\t\t\tgetActivity().getApplicationContext()).getUserPsd();\r\n\t\t\t\tString password = editText.getText().toString().trim();\r\n\t\t\t\tif (TextUtils.isEmpty(password)) {\r\n\t\t\t\t\tShowToast(\"密码不能为空！\");\r\n\t\t\t\t\treturn;\r\n\t\t\t\t}\r\n\t\t\t\tif (password.equals(psd)) {\r\n\t\t\t\t\tavatorPop.dismiss();\r\n\t\t\t\t\tintentAction(getActivity(), GesturePsdActivity.class);\r\n\r\n\t\t\t\t} else {\r\n\t\t\t\t\tShowToast(\"输入密码错误！\");\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t});\r\n\r\n\t\tbt_cancel.setOnClickListener(new OnClickListener() {\r\n\r\n\t\t\t@Override\r\n\t\t\tpublic void onClick(View v) {\r\n\t\t\t\t// TODO Auto-generated method stub\r\n\t\t\t\tavatorPop.dismiss();\r\n\t\t\t}\r\n\t\t});\r\n\t}","public void onClick(DialogInterface dialogBox, int id) {\n String user = userInputDialogEditText.getText().toString();\n if (Util.ONLINE) {\n if (user.equalsIgnoreCase(name)) {\n\n completeBatch();\n\n } else {\n dialogBox.cancel();\n showMessage(\"VALIDATION ERROR\", \"TAGID DOES NOT MATCH\");\n }\n } else {\n boolean b = db.checkUserdropdown(user, user);\n if (b == true) {\n completeBatch();\n } else {\n dialogBox.cancel();\n showMessage(\"VALIDATION ERROR\", \"TAGID DOES NOT MATCH\");\n }\n }\n }","public RegisterUserDialog(Admin admin) { \n\t\tthis.admin = admin;\n\t\tUserDialog dialog = new UserDialog(this);\n\t\tsetLayout(new FlowLayout()); \n\t\tpack();\n\t\t// Set window location in middle of screen\n\t\tdialog.setLocationRelativeTo(null);\n\t\t// Display window\n\t\tdialog.setVisible(true);\n\t }","private void showAlert() {\n AlertDialog.Builder alert = new AlertDialog.Builder(this);\n alert.setMessage(\"Error al autenticar usuario\");\n alert.setPositiveButton(\"Aceptar\", null);\n AlertDialog pop = alert.create();\n alert.show();\n }","@Override\n public void onComplete(@NonNull Task<Void> task) {\n if(task.isSuccessful()){\n Toast.makeText(getBaseContext(), \"New contact \" + addMe.getDisplayName() + \" created!\", Toast.LENGTH_LONG).show();\n\n //Go to home page\n finish();\n }\n else {\n Toast.makeText(getBaseContext(), \"Unable to add \" + addMe.getDisplayName() + \" contact\", Toast.LENGTH_LONG).show();\n }\n }","private void dialogshow(String title, String msg) {\n\n AlertDialog.Builder builder =\n new AlertDialog.Builder(this, R.style.AppCompatAlertDialogStyle);\n builder.setTitle(title);\n builder.setMessage(msg);\n builder.setCancelable(false);\n builder.setPositiveButton(R.string.ok, new DialogInterface.OnClickListener() {\n\n @Override\n public void onClick(DialogInterface dialog, int which) {\n if (acc1.equals(\"no\")) {\n// sendacktorider();\n Intent fare = new Intent(SlideMainActivity.this, SlideMainActivity.class);\n fare.putExtra(\"userid\", User_id);\n fare.putExtra(\"fbuserproimg\", fbuserproimg);\n fare.putExtra(\"whologin\", WhoLogin);\n fare.putExtra(\"password\", checkpassword);\n startActivity(fare);\n finish();\n }\n dialog.cancel();\n }\n });\n\n builder.show();\n\n }","@Override\n\t\t\t\t\t\tpublic void onClick(DialogInterface dialog, int which) {\n\t\t\t\t\t\t\taddMember();\n\t\t\t\t\t\t}","@Override\n public void onClick(View view) {\n if (mAddDialog == null) {\n mAddDialog = new XPopup.Builder(MainActivity.this)\n .asInputConfirm(getString(R.string.add_random_title)\n , getString(R.string.add_random_content)\n , new OnInputConfirmListener() {\n @Override\n public void onConfirm(String text) {\n if (mAdapter != null) {\n mAdapter.addData(new BaseModel(text, 1));\n }\n }\n }).show();\n } else {\n mAddDialog.show();\n }\n }","private void SendUserToInfoPage(){\n Intent intent = new Intent(sign_up_activity.this,user_info_activity.class);\n intent.setFlags(Intent.FLAG_ACTIVITY_NEW_TASK|Intent.FLAG_ACTIVITY_CLEAR_TASK);\n overridePendingTransition(0,0);\n startActivity(intent);\n finish();\n }","@Override\n public Dialog onCreateDialog(Bundle savedInstanceState) {\n AlertDialog.Builder builder = new AlertDialog.Builder(getActivity());\n String mess = \"The user your trying to connect to does not have a name set\";\n if(getArguments().getBoolean(\"me\"))\n {\n mess = \"Someone tried to connect to you for a game but you dont have a name set\";\n }\n builder.setMessage(mess)\n .setPositiveButton(\"Ok\", new DialogInterface.OnClickListener() {\n public void onClick(DialogInterface dialog, int id) {\n // FIRE ZE MISSILES!\n }\n });\n // Create the AlertDialog object and return it\n return builder.create();\n }","public void actionPerformed(ActionEvent e) {\n \tif(e.getActionCommand()==\"Home\")\n \t\tfireEvent(e.getActionCommand());\n \telse if(e.getActionCommand()==\"Create\"){\n \t\tcheckFields();\n \t\tif(createInputOK==true){\n\t \t\ttry{\n\t\t \t\t//TODO put in error checking \n\t\t \t\t//insertDB(); insert into books table\n\t\t \t\tDBConnect.insertDB(\"users (username,passw,email,books,students)\",\n\t\t \t\t\t\t\"('\"+userNameTxFld.getText()+\"','\"+ encryptedPassW+\"','\"+\n\t\t \t\teMailTxFld.getText()+\"','\"+ \"\"+\"','\"+ \"\"+\"')\");\t\t\n\t\t \t\t//DBConnect.updateDB(\"users\", \"users=CONCAT(user,'\"+id+\" ')\",\"usersid=\"+Globals.userid);\n\t\t \t\t//System.out.println(id+\"\\n\"+titleTxfld.getText());\n\t\t \t\t//http://docs.oracle.com/javase/tutorial/uiswing/components/dialog.html <-popup message\n\t\t \t\t//popup message saying book added \n\t\t \t\tJOptionPane.showMessageDialog(BookCheckWindow.frame, userNameTxFld.getText()+\" Has Been Created. Click Cancel to Log-In\");\n\t\t \tcreateInputOK=false;\n\t\t \tcreateUserOK=true;\n\t \t\t}\n\t \t\tcatch(Exception ex){\n\t \t\t\t\n\t \t\t}\n \t\t}\n \t}\n }","public void createUser() {\r\n\t\tif(validateUser()) {\r\n\t\t\t\r\n\t\t\tcdb=new Connectiondb();\r\n\t\t\tcon=cdb.createConnection();\r\n\t\t\ttry {\r\n\t\t\t\tps=con.prepareStatement(\"INSERT INTO t_user (nom,prenom,userName,pass,tel,type,status) values(?,?,?,?,?,?,?)\");\r\n\t\t\t\tps.setString(1, this.getNom());\r\n\t\t\t\tps.setString(2, this.getPrenom());\r\n\t\t\t\tps.setString(3, this.getUserName());\r\n\t\t\t\tps.setString(4, this.getPassword());\r\n\t\t\t\tps.setInt(5, Integer.parseInt(this.getTel().trim()));\r\n\t\t\t\tps.setString(6, this.getType());\r\n\t\t\t\tps.setBoolean(7, true);\r\n\t\t\t\tps.executeUpdate();\r\n\t\t\t\tnew Message().error(\"Fin d'ajout d'utilisateur\");\r\n\t\t\t} catch (SQLException e) {\r\n\t\t\t\tnew Message().error(\"Echec d'ajout d'utilisateur\");\r\n\t\t\t\te.printStackTrace();\r\n\t\t\t}finally {\r\n\t\t\t\tcdb.closePrepareStatement(ps);\r\n\t\t\t\tcdb.closeConnection(con);\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\t}","public void addUser() {\n\t\tUser user = dataManager.findCurrentUser();\r\n\t\tif (user != null) {\r\n\t\t\tframeManager.addUser(user);\r\n\t\t\tpesquisar();\r\n\t\t} else {\r\n\t\t\tAlertUtils.alertSemPrivelegio();\r\n\t\t}\r\n\t}","@FXML protected void handleSignUpButtonAction() {\n \tboolean bexit = false;\n \tif(passwordField.getText().equals(passwordField2.getText()))\n \t{\n \t\t\n \t\tString signUpUsername = username.getText();\n \t\tString signUpPassword = passwordField.getText();\n \t\t\n if(username.getText().toString().length() >= 6 && passwordField.getText().toString().length() >= 6)\n {\n\t \t\tUser user = new User(signUpUsername, \"Unknown\", null, \"Unknown\", signUpPassword);\n\t \t\t\n\t \t\ttry {\n\t\t\t\t\tuser = client.createUser(user);\n\t \t\t\n\t \t\t} catch (WebApplicationException e) {\n\t \t\t\tLOGGER.log(Level.SEVERE, e.toString(), e);\n\t \t\t\tif (e.getResponse().getStatus() == 409) {\n\t \t\t\t\tactiontarget.setText(\"Sign up error: Username already exists\");\n\t \t\t\t} else {\n\t \t\t\t\t\n\t \t\t\t}\n\t \t\t\t\n\t \t\t} catch (JsonProcessingException e) {\n\t \t\t\tLOGGER.log(Level.SEVERE, e.toString(), e);\n\t\n\t\t\t\t} catch (Exception e) {\n\t\t\t\t\tLOGGER.log(Level.SEVERE, e.toString(), e);\n\t\t\t\t}\n\t \t\t\n\t \t\t// Go back to Login view\n\t \t\t\n\t \t\tLoginVistaNavigator.loadVista(LoginVistaNavigator.LOGIN);\n }\n else\n {\n \tactiontarget.setText(\"username/password \\nlength must be 6 number\");\n }\n \t}\n \telse\n \t{\n \t\tactiontarget.setText(\"password not consistent.\");\n \t}\n }","private void errorPopUp() {\n new AlertDialog.Builder(mActivity)\n .setTitle(\"Oops\")\n .setMessage(\"Please choose an emotional state or enter a date and time\")\n .setPositiveButton(\"Ok\", new DialogInterface.OnClickListener() {\n @Override\n public void onClick(DialogInterface dialogInterface, int i) {\n //Go back without changing anything\n dialogInterface.dismiss();\n }\n })\n .create()\n .show();\n }","U getCreateby();","public void doPositiveClick() {\n\t\t//Shows message that contact added to database. \n\t\tToast.makeText(this, \"Контакт сохранен\", Toast.LENGTH_SHORT).show();\n\t\taddRecord();\n\t}","public void messageToUser() {\n // show a message dialog - the message is an error message.\n JOptionPane.showMessageDialog(new JFrame(),\n \"You are missing some parameters in the level definitions, Please check it\", \"Error!\",\n JOptionPane.ERROR_MESSAGE);\n // exit the program\n System.exit(0);\n }","@FXML\r\n\tvoid openCreateUser(ActionEvent event) {\r\n\t\tParent root = null;\r\n\t\tnewWindow = new Stage();\r\n\t\ttry {\r\n\t\t\troot = FXMLLoader.load(getClass().getResource(\"3.1-AddISUsersScreen.fxml\"));\r\n\t\t} catch (IOException e) {\r\n\r\n\t\t\te.printStackTrace();\r\n\t\t}\r\n\t\tISUsers = new Scene(root);\r\n\t\tnewWindow.setTitle(\"Create IS User\");\r\n\t\tnewWindow.setScene(ISUsers);\r\n\t\tnewWindow.setResizable(false);\r\n\t\tnewWindow.initOwner((Stage) ((Node) event.getSource()).getScene().getWindow());\r\n\t\tnewWindow.initModality(Modality.WINDOW_MODAL);\r\n\t\tnewWindow.show();\r\n\t}","@Test (priority = 1)\n\tpublic void TC1_CheckCreateNewuser_Exists ()\n\n\t{\n\t\tCreateUserPage UserObj = new CreateUserPage (driver);\n\n\t\t// This is to Validate If Create user button exists to Create a new User\n\t\tUserObj.Validate_CreateUserButton_Exsist();\n\n\t}","public AlertDialog createSimpleDialog(String mensaje, String titulo, final String typ) {\n final AlertDialog.Builder builder = new AlertDialog.Builder(getActivity());\n\n LayoutInflater inflater = getActivity().getLayoutInflater();\n\n View v = inflater.inflate(R.layout.dialog_monitoring_info, null);\n builder.setView(v);\n\n TextView tvTitle = (TextView) v.findViewById(R.id.tv_title_dialog);\n TextView tvDescription = (TextView) v.findViewById(R.id.tv_description_dialog);\n\n tvTitle.setText(titulo);\n tvTitle.setCompoundDrawables(ContextCompat.getDrawable(v.getContext(), R.drawable.ic_question), null, null, null);\n tvDescription.setText(mensaje);\n\n builder.setPositiveButton(getResources().getString(R.string.info_dialog_option_accept),\n new DialogInterface.OnClickListener() {\n @Override\n public void onClick(DialogInterface dialog, int which) {\n new Handler().postDelayed(new Runnable() {\n @Override\n public void run() {\n if (typ.equals(\"REGIST\")){\n MonitoringRegistrationFormFragment fragment = new MonitoringRegistrationFormFragment();\n Bundle params = new Bundle();\n params.putString(\"AREA\", area);\n params.putString(\"OPCION\", \"N\");\n fragment.setArguments(params);\n\n getActivity().getSupportFragmentManager().popBackStack(null, FragmentManager.POP_BACK_STACK_INCLUSIVE);\n\n getActivity().getSupportFragmentManager().beginTransaction()\n .replace(R.id.monitoring_principal_context, fragment)\n .commit();\n }\n else {\n AdminUserFormFragment fragment = new AdminUserFormFragment();\n getActivity().getSupportFragmentManager().popBackStack(null, FragmentManager.POP_BACK_STACK_INCLUSIVE);\n getActivity().getSupportFragmentManager().beginTransaction()\n .replace(R.id.transaction_principal_context, fragment)\n .commit();\n }\n }\n },300);\n }\n })\n .setNegativeButton(getResources().getString(R.string.info_dialog_option_cancel),\n new DialogInterface.OnClickListener() {\n @Override\n public void onClick(DialogInterface dialog, int which) {\n builder.create().dismiss();\n if (typ.equals(\"REGIST\")){\n new Handler().postDelayed(new Runnable() {\n @Override\n public void run() {\n Intent intent = new Intent(getActivity(), MonitorMenuActivity.class);\n intent.setFlags(Intent.FLAG_ACTIVITY_CLEAR_TOP | Intent.FLAG_ACTIVITY_SINGLE_TOP);\n startActivity(intent);\n getActivity().finish();\n }\n },300);\n }\n else {\n getActivity().finish();\n }\n }\n });\n\n return builder.create();\n }","Boolean registerNewUser(User user);","@Override\n public void onClick(View v) {\n ParseUser currentUser = ParseUser.getCurrentUser();\n String currentUserUsername = currentUser.getUsername();\n\n\n //get the status user has enteretd, conver it to a string\n String newStatus = UsertxtFieldmsg.getText().toString();\n\n //Save the status in parse\n ParseObject statusObject = new ParseObject(\"Messages\");\n statusObject.put(\"Message\",newStatus);\n statusObject.put(\"user\", currentUserUsername);\n statusObject.saveInBackground(new SaveCallback() {\n @Override\n public void done(ParseException e) {\n if(e == null){\n //succesfully stored the new status in parse\n Toast.makeText(User_SendMessage.this, \"Message Sent!\", Toast.LENGTH_LONG).show();\n\n //take user home\n Intent takeUserHome =new Intent(User_SendMessage.this, UserActivityPage.class);\n startActivity(takeUserHome);\n\n\n }else{\n //there was a problem storn new status, advice user\n AlertDialog.Builder builder = new AlertDialog.Builder(User_SendMessage.this);\n builder.setMessage(e.getMessage());\n builder.setTitle(\"Sorry\");\n builder.setPositiveButton(\"Ok\", new DialogInterface.OnClickListener() {\n @Override\n public void onClick(DialogInterface dialogInterface, int i) {\n dialogInterface.dismiss();\n }\n });\n AlertDialog dialog = builder.create();\n dialog.show();\n }\n }\n });\n\n }","public void showPopUp(View view) {\n\n menuDialog.setContentView(R.layout.menupopup);\n menuDialog.getWindow().setBackgroundDrawable(new ColorDrawable(Color.TRANSPARENT));\n\n TextView txtUserName = (TextView) menuDialog.getWindow().findViewById(R.id.textview_UserName);\n txtUserName.setText(userName);\n // Download User Image from Firebase and show it to User.\n\n final long ONE_MEGABYTE = 1024 * 1024;\n downloadImageStorageReference.getBytes(ONE_MEGABYTE).addOnSuccessListener(new OnSuccessListener<byte[]>() {\n @Override\n public void onSuccess(byte[] bytes) {\n bitmap = BitmapFactory.decodeByteArray(bytes, 0, bytes.length);\n imageView_UserPhoto.setImageBitmap(bitmap);\n }\n });\n imageView_UserPhoto = menuDialog.getWindow().findViewById(R.id.imageview_UserImage);\n\n if(bitmap != null) {\n imageView_UserPhoto.setImageBitmap(bitmap);\n }else {\n imageView_UserPhoto.setImageResource(R.drawable.userimage_default);\n }\n\n\n menuDialog.show();\n }","public void actionPerformed(ActionEvent arg0) {\n\t\t\t\tnew UserData(Username,true,\"Verification\");\n\t\t\t}","public void popUpEmptyTextView() {\n final Intent intent = new Intent(this, AddUserDetailsActivity.class);\n AlertDialog alertDialog = new AlertDialog.Builder(AddUserDetailsActivity.this).create();\n alertDialog.setTitle(\"ERROR\");\n alertDialog.setMessage(\"One of the fields have been left empty, please try again.\"\n );\n alertDialog.setButton(AlertDialog.BUTTON_NEUTRAL, \"OK\",\n new DialogInterface.OnClickListener() {\n public void onClick(DialogInterface dialog, int which) {\n dialog.dismiss();\n //Intent intent = new Intent(this, AddUserDetailsActivity.class);\n startActivity(intent);\n finish();\n\n }\n });\n alertDialog.show();\n }","public void showSucceedDeleteDialog() {\n\t\tString msg = getApplicationContext().getResources().getString(\n\t\t\t\tR.string.MSG_DLG_LABEL_DELETE_ITEM_SUCCESS);\n\t\tfinal AlertDialog.Builder alertDialogBuilder = new AlertDialog.Builder(\n\t\t\t\tthis);\n\t\talertDialogBuilder\n\t\t\t\t.setMessage(msg)\n\t\t\t\t.setCancelable(false)\n\t\t\t\t.setPositiveButton(\n\t\t\t\t\t\tgetApplicationContext().getResources().getString(\n\t\t\t\t\t\t\t\tR.string.MSG_DLG_LABEL_OK),\n\t\t\t\t\t\tnew DialogInterface.OnClickListener() {\n\t\t\t\t\t\t\tpublic void onClick(DialogInterface dialog, int id) {\n\t\t\t\t\t\t\t\tfinish();\n\t\t\t\t\t\t\t\tstartActivity(getIntent());\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t});\n\t\tAlertDialog alertDialog = alertDialogBuilder.create();\n\t\talertDialog.show();\n\n\t}","private void submitForm() {\n final Dialog dialog = new Dialog(context);\n\t\t dialog.setContentView(R.layout.dialogbox);\n\t\t dialog.setTitle(\"Sucess!\");\n\t\t dialog.setCancelable(false);\n\t dialog.setCanceledOnTouchOutside(false);\n\t\t TextView txt = (TextView) dialog.findViewById(R.id.errorlog);\n\t\t txt.setText(\"Registration Successfull.\");\n\t\t Button dialogButton = (Button) dialog.findViewById(R.id.release);\n\t\t dialogButton.setOnClickListener(new OnClickListener() {\n\t\t\t public void onClick(View vd) {\n\t\t\t\t change.setEnabled(true);\n\t\t\t\t dialog.dismiss();\n\t\t\n\t\t}\n\t\t});\n\t\t dialog.show();\n}","private void addUser() {\n\t\t//check for the user limit, and if it is reached, return an error.\n\t\tif(!(users[users.length-1].equals(\"\"))) {\n\t\t\terror(USER_LIMIT_REACHED);\n\t\t\tProgramGUI.this.dispose();\n\t\t}\n\t\telse {\n\t\t\tProgramGUI.this.dispose();\n\t\t\tindex = nextUserIndex();\n\t\t\tframe = new JFrame(\"Adding user #\" + (index+1));\n\t\t\tframe.setSize(FRAME_WIDTH, FRAME_HEIGHT);\n\t\t\tframe.setLocationRelativeTo(null);\n\t\t\tframe.setDefaultCloseOperation(EXIT_ON_CLOSE);\n\t\t\tJPanel panel = new JPanel();\n\t\t\tpanel.setLayout(new GridLayout(2, 2));\n\t\t\tpanel.setBorder(BorderFactory.createEmptyBorder(10,10,0,10));\n\t\t\tpanel.add(new JLabel(\"Enter Username: \"));\n\t\t\tuser = new JTextField();\n\t\t\tpanel.add(user);\n\t\t\tpanel.add(new JLabel(\"Enter Password: \"));\n\t\t\tpass = new JPasswordField();\n\t\t\tpanel.add(pass);\n\t\t\tframe.add(panel, BorderLayout.NORTH);\n\t\t\tJPanel button = new JPanel();\n\t\t\tJButton ok = new JButton(\"Confirm User\");\n\t\t\tok.addActionListener(new AddListener());\n\t\t\tJButton cancel = new JButton(\"Cancel\");\n\t\t\tcancel.addActionListener(new ButtonListener());\n\t\t\tbutton.add(ok);\n\t\t\tbutton.add(cancel);\n\t\t\tframe.add(button, BorderLayout.SOUTH);\n\t\t\tframe.setVisible(true);\n\t\t}\n\t}","public int signUp(String email_address, String email_password, String first_name, String last_name)\r\n\t{\r\n\t\ttry \r\n\t\t{\r\n\t\t\tString query = \"insert into users values (?, ?, ?, ?)\";\r\n\t\t\tpreparedStatement = connect.prepareStatement(query);\r\n\t\t\t\r\n\t\t\t/*\r\n\t\t\t * variables here replaces the question marks in the query\r\n\t\t\t * the numbers before the variables denote what question mark is the variable supposed to replace\r\n\t\t\t * the numbers start at 1 compared to starting at 0\r\n\t\t\t */\r\n\t\t\tpreparedStatement.setString(1, email_address);\r\n\t\t\tpreparedStatement.setString(2, email_password);\r\n\t\t\tpreparedStatement.setString(3, first_name);\r\n\t\t\tpreparedStatement.setString(4, last_name);\r\n\t\t\tpreparedStatement.execute();\t//execute the query above\r\n\t\t\t\r\n\t\t\t/*\r\n\t\t\t * Created an object array which only contains the value of the button to be used in the popup message\r\n\t\t\t * the popup message displays upon successfully registering a user\r\n\t\t\t */\r\n\t\t\tObject[] options = {\"OK\"};\r\n\t\t\tint temp = JOptionPane.showOptionDialog(null, \"You are now registered\", \"Registration\", JOptionPane.OK_OPTION, JOptionPane.INFORMATION_MESSAGE, null, options, options[0]);\r\n\t\t\treturn temp;\r\n\t\t} \r\n\t\tcatch (Exception e) \r\n\t\t{\r\n\t\t\te.printStackTrace();\r\n\t\t}\r\n\t\treturn 0;\r\n\t}"],"string":"[\n \"private void usernameTakenDialog() {\\n Dialog dialog = new Dialog(\\\"Username taken\\\", cloudSkin, \\\"dialog\\\") {\\n public void result(Object obj) {\\n System.out.println(\\\"result \\\" + obj);\\n }\\n };\\n dialog.text(\\\"This username has already been taken, try a new one.\\\");\\n dialog.button(\\\"OK\\\", true);\\n dialog.show(stage);\\n }\",\n \"@FXML\\n private void openCreateUser(ActionEvent event) {\\n CreateUserController createusercontroller = new CreateUserController();\\n User user = createusercontroller.openCreateUser(event, roleTap);\\n\\n if (user != null) {\\n userList.add(user);\\n UsermanagementUtilities.setFeedback(event, user.getName().getFirstName()+LanguageHandler.getText(\\\"userCreated\\\"), true);\\n } else {\\n UsermanagementUtilities.setFeedback(event, LanguageHandler.getText(\\\"userNotCreated\\\"), false);\\n\\n }\\n }\",\n \"@FXML\\n\\tpublic void createUser(ActionEvent event) {\\n\\t\\tString empty = \\\"\\\";\\n\\t\\tString name = txtUserNames.getText();\\n\\t\\tString lastName = txtUserSurnames.getText();\\n\\t\\tString id = txtUserId.getText();\\n\\t\\tString username = txtUserUsername.getText();\\n\\t\\tString password = PfUserPassword.getText();\\n\\n\\t\\tif (!name.equals(empty) && !lastName.equals(empty) && !id.equals(empty) && !username.equals(empty)\\n\\t\\t\\t\\t&& !password.equals(empty)) {\\n\\t\\t\\tcreateSystemUser(name, lastName, id, username, password);\\n\\t\\t\\ttxtUserNames.setText(\\\"\\\");\\n\\t\\t\\ttxtUserSurnames.setText(\\\"\\\");\\n\\t\\t\\ttxtUserId.setText(\\\"\\\");\\n\\t\\t\\ttxtUserUsername.setText(\\\"\\\");\\n\\t\\t\\tPfUserPassword.setText(\\\"\\\");\\n\\t\\t\\t// labelUserMessage.setText(\\\"The user has been created\\\");\\n\\t\\t} else if (name.equals(empty) && lastName.equals(empty) && id.equals(empty) && username.equals(empty)\\n\\t\\t\\t\\t&& password.equals(empty)) {\\n\\t\\t\\tDialog<String> dialog = createDialog();\\n\\t\\t\\tdialog.setTitle(\\\"Error al guardar datos\\\");\\n\\t\\t\\tdialog.setContentText(\\\"Todos los campos de texto deben ser llenados\\\");\\n\\t\\t\\tdialog.show();\\n\\t\\t}\\n\\t}\",\n \"@Override\\n\\t\\t\\tpublic void buttonClick(ClickEvent event) {\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tConfirmDialog.show(UI.getCurrent(), MESSAGE_1,\\\"\\\",\\\"Aceptar\\\",\\\"Crear mas Usuarios\\\",\\n\\t\\t\\t\\t new ConfirmDialog.Listener() {\\n\\n\\t\\t\\t\\t public void onClose(ConfirmDialog dialog) {\\t\\n\\t\\t\\t\\t \\tent= false;\\n\\t\\t\\t\\t if (dialog.isConfirmed()) {\\n\\t\\t\\t\\t // Confirmed to continue\\t\\n\\t\\t\\t\\t \\tc.navegar((StartView.VIEW_NAME));\\n\\t\\t\\t\\t } else {\\n\\t\\t\\t\\t // User did not confirm\\t\\t\\t \\n\\t\\t\\t\\t \\t//c.crearWindow(RegistrarUser.VIEW_NAME);\\n\\t\\t\\t\\t \\tc.navegar((StartView.VIEW_NAME));\\n\\t\\t\\t\\t \\n\\t\\t\\t\\t }\\n\\t\\t\\t\\t \\n\\t\\t\\t\\t }\\n\\t\\t\\t\\t \\n\\t\\t\\t\\t });\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t//Notification nota= new Notification(\\\"Registro Exitoso!\\\",Notification.Type.HUMANIZED_MESSAGE);\\n\\t\\t\\t\\t//nota.setDelayMsec(-1);\\n\\t\\t\\t\\t//nota.show(Page.getCurrent());\\t\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tclose();\\t\\t\\t\\n\\t\\t\\t}\",\n \"@Override\\r\\n public void handle(ActionEvent e) {\\n CreateUser create = new CreateUser(txtUserName, txtEmail,\\r\\n txtFirstName, txtLastName, txtPassword);\\r\\n\\r\\n create.createUser(); //Call the createUser method.\\r\\n confirmUserStage.close(); //Close the confirm stage\\r\\n\\r\\n }\",\n \"public void newuserclicked(View view) {\\n Intent myuserIntent = new Intent(this, UserCreation.class);\\n startActivity(myuserIntent);\\n }\",\n \"private void newUser() {\\n // TODO: Initial layout\\n LayoutInflater layoutInflater = LayoutInflater.from(getActivity());\\n View form = layoutInflater.inflate(R.layout.form_user, null);\\n AlertDialog.Builder alertDialogBuilder = new AlertDialog.Builder(getActivity());\\n alertDialogBuilder.setTitle(\\\"Thêm tài khoản\\\");\\n alertDialogBuilder.setView(form);\\n\\n // TODO: Add controls\\n editTextPhone = form.findViewById(R.id.editTextPhoneOnUserForm);\\n editTextUsername = form.findViewById(R.id.editTextUsernameOnUserForm);\\n editTextPassword = form.findViewById(R.id.editTextPasswordOnUserForm);\\n editTextPassword2 = form.findViewById(R.id.editTextPassword2OnUserForm);\\n\\n // TODO: Add events\\n alertDialogBuilder.setPositiveButton(\\\"Lưu\\\", null);\\n alertDialogBuilder.setNegativeButton(\\\"Hủy\\\", new DialogInterface.OnClickListener() {\\n @Override\\n public void onClick(DialogInterface dialog, int which) {\\n dialog.dismiss();\\n }\\n });\\n final AlertDialog alertDialog = alertDialogBuilder.create();\\n alertDialog.setOnShowListener(new DialogInterface.OnShowListener() {\\n @Override\\n public void onShow(final DialogInterface dialog) {\\n Button buttonSave = alertDialog.getButton(AlertDialog.BUTTON_POSITIVE);\\n buttonSave.setOnClickListener(new View.OnClickListener() {\\n @Override\\n public void onClick(View v) {\\n final User user = getUser();\\n if (user != null) {\\n tableUser.addListenerForSingleValueEvent(new ValueEventListener() {\\n @Override\\n public void onDataChange(@NonNull DataSnapshot dataSnapshot) {\\n if (dataSnapshot.child((user.getId())).exists()) {\\n Toast.makeText(getActivity(), \\\"Số điện thoại đã tồn tại, xin nhập số khác\\\", Toast.LENGTH_LONG).show();\\n } else {\\n tableUser.child(user.getId()).setValue(user);\\n dialog.dismiss();\\n Toast.makeText(getActivity(), \\\"Thêm thành công\\\", Toast.LENGTH_LONG).show();\\n }\\n }\\n\\n @Override\\n public void onCancelled(@NonNull DatabaseError databaseError) {\\n }\\n });\\n }\\n }\\n });\\n }\\n });\\n alertDialog.show();\\n }\",\n \"private void showSuccessDialog(String username, String groupName) {\\n\\n successDialog = new CustomAlertDialog(\\n RunnerActivity.this);\\n successDialog.setCancelableFlag(false);\\n successDialog.setTitle(\\\"Add user\\\");\\n //String message = String.format(\\\"Add user: %s to group: %s Successfully!\\\", new String[]{username, groupName});\\n String message = String.format(\\\"Add user: %s to group: %s Successfully!\\\", username, groupName);\\n successDialog.setMessage(message);\\n successDialog.setPositiveButton(getString(R.string.ok),\\n new OnPositiveButtonClick() {\\n\\n @Override\\n public void onButtonClick(View view) {\\n // TODO Auto-generated method stub\\n successDialog.dismiss();\\n }\\n });\\n\\n successDialog.show();\\n }\",\n \"private void createNewUser() {\\n ContentValues contentValues = new ContentValues();\\n contentValues.put(DataBaseConstants.Constants_TBL_PATIENTS.GENDER, getSelectedGender());\\n contentValues.put(DataBaseConstants.Constants_TBL_PATIENTS.PIN, edtConfirmPin.getText().toString().trim());\\n contentValues.put(DataBaseConstants.Constants_TBL_PATIENTS.LAST_NAME, edtLastName.getText().toString().trim());\\n contentValues.put(DataBaseConstants.Constants_TBL_PATIENTS.FIRST_NAME, edtFirstName.getText().toString().trim());\\n contentValues.put(DataBaseConstants.Constants_TBL_PATIENTS.STATUS, spnStatus.getSelectedItem().toString().trim());\\n contentValues.put(DataBaseConstants.Constants_TBL_PATIENTS.DATE_OF_BIRTH, edtDateOfBirth.getText().toString().trim());\\n contentValues.put(DataBaseConstants.Constants_TBL_PATIENTS.BLOOD_GROUP, spnBloodGroup.getSelectedItem().toString().trim());\\n contentValues.put(DataBaseConstants.Constants_TBL_PATIENTS.IS_DELETED, \\\"N\\\");\\n contentValues.put(DataBaseConstants.Constants_TBL_PATIENTS.MOBILE_NUMBER, edtMobileNumber.getText().toString());\\n contentValues.put(DataBaseConstants.Constants_TBL_CATEGORIES.CREATE_DATE, Utils.getCurrentDateTime(Utils.DD_MM_YYYY));\\n\\n dataBaseHelper.saveToLocalTable(DataBaseConstants.TableNames.TBL_PATIENTS, contentValues);\\n context.startActivity(new Intent(CreatePinActivity.this, LoginActivity.class));\\n }\",\n \"private void RegisterUser(final User user) {\\n AlertDialog.Builder builder;\\n if (Build.VERSION.SDK_INT >= Build.VERSION_CODES.LOLLIPOP) {\\n builder = new AlertDialog.Builder(this, android.R.style.Theme_Material_Dialog_Alert);\\n } else {\\n builder = new AlertDialog.Builder(this);\\n }\\n\\n View view = LayoutInflater.from(MainActivity.this).inflate(R.layout.alert_dialog_input,null);\\n\\n builder.setTitle(\\\"Faltan informacion requerida\\\")\\n .setMessage(\\\"Completa los siguentes campos\\\")\\n .setView(view);\\n\\n final EditText editTxtEmailDialog = view.findViewById(R.id.editTxtEmailAlertDialog);\\n final EditText editTxtNicknameDialog = view.findViewById(R.id.editTxtNicknameAlertDialog);\\n final EditText editTxtPasswordDialog = view.findViewById(R.id.editTxtPasswordAlertDialog);\\n\\n if(user.getEmail() != null)\\n editTxtEmailDialog.setVisibility(View.GONE);\\n\\n builder.setPositiveButton(\\\"Registar\\\", new DialogInterface.OnClickListener() {\\n @Override\\n public void onClick(DialogInterface dialog, int which) {\\n String email = user.getEmail() != null ? user.getEmail() : editTxtEmailDialog.getText().toString();\\n String nickname = editTxtNicknameDialog.getText().toString();\\n String password = editTxtPasswordDialog.getText().toString();\\n if(!isValidateRegisterProvider(email,nickname,password))\\n return;\\n user.setEmail(email);\\n user.setNickname(nickname);\\n user.setPassword(password);\\n\\n\\n\\n //User aux = new User(user.getName(), user.getLastName(),nickname,email,password,\\\"\\\", user.getProvider());\\n if(!Networking.isNetworkAvailable(MainActivity.this)) {\\n Toast.makeText(MainActivity.this,\\\"No hay internet\\\",Toast.LENGTH_SHORT).show();\\n return;\\n }\\n new Networking(MainActivity.this).execute(Networking.SIGNUP_PROVIDER, user,new NetCallback() {\\n @Override\\n public void onWorkFinish(Object... objects) {\\n\\n final User user_temp = (User) objects[0];\\n if(user_temp.getId() != -1) {\\n runOnUiThread(new Runnable() {\\n @Override\\n public void run() {\\n Toast.makeText(MainActivity.this,\\\"Bienvenido\\\",Toast.LENGTH_SHORT).show();\\n Intent intent = new Intent(MainActivity.this, InitActivity.class);\\n Grua grua = new Grua(\\\"\\\",\\\"\\\", \\\"\\\");\\n grua.setId(-1);\\n intent.putExtra(Register.JSON_USER, user_temp.toJSON());\\n intent.putExtra(Register.JSON_GRUA,grua.toJSON());\\n SharedUtil.setUserNickname(MainActivity.this,user_temp.getNickname());\\n SharedUtil.setUserPassword(MainActivity.this, user_temp.getPassword());\\n SharedUtil.setUserProvider(MainActivity.this, user_temp.getProvider());\\n startActivity(intent);\\n }\\n });\\n }\\n\\n }\\n\\n @Override\\n public void onMessageThreadMain(Object data) {\\n final String message = (String) data;\\n runOnUiThread(new Runnable() {\\n @Override\\n public void run() {\\n Toast.makeText(MainActivity.this, message, Toast.LENGTH_SHORT).show();\\n }\\n });\\n\\n }\\n });\\n\\n }\\n }).setNegativeButton(\\\"Cancelar\\\", new DialogInterface.OnClickListener() {\\n @Override\\n public void onClick(DialogInterface dialog, int which) {\\n //... Remover instancia iniciar con ...\\n Toast.makeText(MainActivity.this,\\\"Su registro se ha cancelado\\\", Toast.LENGTH_SHORT).show();\\n }\\n })\\n .setIcon(android.R.drawable.ic_dialog_info)\\n .show();\\n\\n }\",\n \"@Override\\r\\n\\t\\t\\tpublic void onClick(View v) {\\n\\t\\t\\t\\tString userName = input.getText().toString();\\r\\n\\t\\t\\t\\tString userColour = sprCoun.getSelectedItem()\\r\\n\\t\\t\\t\\t\\t\\t.toString();\\r\\n\\t\\t\\t\\tString userLangName = userLang;\\r\\n\\r\\n\\t\\t\\t\\tcontext.addNewUser(userName, userColour);\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\talertDialog.dismiss();\\r\\n\\t\\t\\t}\",\n \"public void mmCreateClick(ActionEvent event) throws Exception{\\r\\n displayCreateProfile();\\r\\n }\",\n \"@Override\\n public void onClick(DialogInterface dialog, int which) {\\n dialog.dismiss();\\n setUserInfo(user);\\n }\",\n \"public boolean onOkClicked() {\\n try {\\n if (form.isValid()) {\\n String userName = form.getFieldValue(SysUser.USER_NAME_PROPERTY);\\n String userAccount = form.getFieldValue(SysUser.USER_ACCOUNT_PROPERTY);\\n String passWord = form.getFieldValue(SysUser.USER_PASSWORD_PROPERTY);\\n String cPassWord = form.getFieldValue(\\\"cPassWord\\\");\\n if (!passWord.equals(cPassWord)) {\\n form.getField(SysUser.USER_PASSWORD_PROPERTY).setValue(\\\"\\\");\\n form.getField(\\\"cPassWord\\\").setValue(\\\"\\\");\\n form.getField(SysUser.USER_PASSWORD_PROPERTY).setFocus(true);\\n addModel(\\\"msg\\\", \\\"密码不一致\\\");\\n } else if (SysUserDao.getInstance().canCreate(getSysUser().getObjectContext(), userAccount)) {\\n if (SysUserDao.getInstance().createSysUser(getSysUser().getObjectContext(), userName, userAccount, passWord)) {\\n setRedirect(UserListPage.class);\\n } else {\\n addModel(\\\"msg\\\", \\\"失败\\\");\\n }\\n } else {\\n form.getField(SysUser.USER_ACCOUNT_PROPERTY).setFocus(true);\\n addModel(\\\"msg\\\", \\\"账号已存在\\\");\\n }\\n }\\n } catch (Exception e) {\\n logger.error(e.getLocalizedMessage(), e);\\n }\\n return true;\\n }\",\n \"public void agregarNuevoUsuario(){\\n //recupero objeto rol usuario\\n usuarioBean.getUsuario().setRol(new ListadoRoles().getListaRoles().get(1));\\n usuarioBean.agregarUsuario(); \\n FacesContext context = FacesContext.getCurrentInstance(); \\n context.addMessage(null, new FacesMessage(\\\"Éxito\\\", \\\"Se agregó un Usuario correctamente.\\\" )); \\n RequestContext.getCurrentInstance().execute(\\\"PF('dlgAltaUsuario').hide();\\\");\\n }\",\n \"@Override\\n public void onClick(View v) {\\n\\n String name = fullname.getText().toString();\\n String emailx = email.getText().toString();\\n String password1 = password.getText().toString();\\n String password2 = password_conf.getText().toString();\\n progressDialog.setMessage(\\\"sign up your data\\\");\\n showDialog();\\n\\n\\n userdata = new UserData(name,emailx,password1,password2);\\n Call<UserData> call = createUser.createUser(userdata);\\n call.enqueue(new Callback<UserData>() {\\n @Override\\n public void onResponse(Call<UserData> call, Response<UserData> response) {\\n if(response.isSuccessful()){\\n Toast.makeText(RegisterActivity.this,\\\"Sign Up Success\\\",Toast.LENGTH_LONG).show();\\n Intent intent = new Intent(getApplicationContext(), LoginActivity.class);\\n startActivity(intent);\\n finish();\\n hideDialog();\\n } else {\\n Toast.makeText(getApplicationContext(),response.message(), Toast.LENGTH_LONG).show();\\n hideDialog();\\n }\\n }\\n\\n @Override\\n public void onFailure(Call<UserData> call, Throwable t) {\\n Toast.makeText(getApplicationContext(), \\\"Error Connection\\\", Toast.LENGTH_LONG).show();\\n hideDialog();\\n }\\n });\\n }\",\n \"public void confirmUser() {\\r\\n\\r\\n bpConfirmUser.setTop(vbText());//Add VBox to top\\r\\n bpConfirmUser.setCenter(gpCenter());//Add GridPane to center\\r\\n bpConfirmUser.setBottom(hbButtons()); //Add Hbox to bottom\\r\\n\\r\\n bpConfirmUser.setPadding(new Insets(10, 50, 50, 50)); //Padding\\r\\n\\r\\n bpConfirmUser.setId(\\\"bp\\\"); //SetID\\r\\n //Create Scene and add mainBorder to it\\r\\n Scene myScene = new Scene(bpConfirmUser, 400, 300);\\r\\n\\r\\n //Setup Stage\\r\\n confirmUserStage.setTitle(\\\"Confirm Information\\\"); //Set the title of the Stage\\r\\n myScene.getStylesheets().add(getClass().getClassLoader().getResource(\\\"createuser.css\\\").toExternalForm());\\r\\n confirmUserStage.setScene(myScene); //Add Scene to Stage\\r\\n\\r\\n confirmUserStage.show(); //Show Stage\\r\\n\\r\\n }\",\n \"private void serchUser() {\\n if (!userNameTextField.getText().isEmpty() && !passwordPasswordField.getText().isEmpty()) {\\n try {\\n User user = UserController.searchUserByUserName(userNameTextField.getText());\\n if (user != null) {\\n if (passwordPasswordField.getText().equals(user.getPassword())) {\\n closeFadeOut();\\n Hi hi = new Hi();\\n hi.setUser(user);\\n hi.setVisible(true);\\n dispose();\\n } else {\\n JOptionPane.showMessageDialog(this, \\\"Incorrect username or password !\\\");\\n passwordPasswordField.setText(\\\"\\\");\\n userNameTextField.requestFocus();\\n userNameTextField.selectAll();\\n }\\n } else {\\n JOptionPane.showMessageDialog(this, \\\"Incorrect username or password !\\\");\\n passwordPasswordField.setText(\\\"\\\");\\n userNameTextField.requestFocus();\\n userNameTextField.selectAll();\\n }\\n\\n } catch (ClassNotFoundException ex) {\\n ex.printStackTrace();\\n } catch (SQLException ex) {\\n ex.printStackTrace();\\n }\\n } else {\\n JOptionPane.showMessageDialog(this, \\\"Please enter username and password\\\");\\n passwordPasswordField.setText(\\\"\\\");\\n userNameTextField.requestFocus();\\n userNameTextField.selectAll();\\n }\\n\\n }\",\n \"private void registerUser()\\n {\\n /*AuthService.createAccount takes a Consumer<Boolean> where the result will be true if the user successfully logged in, or false otherwise*/\\n authService.createAccount(entryService.extractText(namedFields), result -> {\\n if (result.isEmpty()) {\\n startActivity(new Intent(this, DashboardActivity.class));\\n } else {\\n makeToast(result);\\n formContainer.setAlpha(1f);\\n progressContainer.setVisibility(View.GONE);\\n progressContainer.setOnClickListener(null);\\n }\\n });\\n }\",\n \"public void onClick(DialogInterface dialog, int whichButton) {\\n String inputUsername = edittext.getText()\\n .toString().trim().toLowerCase();\\n\\n ParseQuery userQuery = ParseUser.getQuery();\\n userQuery.whereEqualTo(Keys.USERNAME_KEY, inputUsername);\\n\\n try {\\n if (userQuery.count() > 0 && !(userQuery.getFirst().getObjectId()\\n .equals(mCurrentUser.getObjectId()))) {\\n ParseRelation myFriends = ParseUser.getCurrentUser()\\n .getRelation(Keys.FRIENDS_KEY);\\n myFriends.add(userQuery.getFirst());\\n mCurrentUser.saveInBackground();\\n HashMap<String, Object> params = new HashMap<String, Object>();\\n\\n params.put(\\\"friendId\\\", userQuery.getFirst().getObjectId());\\n params.put(\\\"myName\\\", ParseUser.getCurrentUser().getUsername());\\n\\n ParseCloud.callFunctionInBackground\\n (\\\"addFriend\\\", params, new FunctionCallback<String>() {\\n @Override\\n public void done(String s, ParseException e) {\\n if (e == null) {\\n mCurrentUser.increment\\n (Keys.NUM_FRIENDS_KEY);\\n mCurrentUser.saveInBackground();\\n\\n } else {\\n AlertDialog.Builder builder = new\\n AlertDialog.Builder(ActivityProfile.this);\\n builder.setMessage(e.getMessage())\\n .setCancelable(false)\\n .setPositiveButton(\\\"OK\\\", new\\n DialogInterface.OnClickListener() {\\n public void onClick\\n (DialogInterface dialog,\\n int id) {\\n dialog.cancel();\\n }\\n });\\n builder.setTitle(\\\"Whoops!\\\");\\n AlertDialog alert = builder.create();\\n alert.show();\\n }\\n }\\n });\\n }\\n } catch (ParseException e) {\\n e.printStackTrace();\\n }\\n\\n }\",\n \"public void onClick(View view) {\\n if(validate_info()){\\n create_user();\\n user = FirebaseAuth.getInstance().getCurrentUser();\\n if (user != null) {\\n submit_profile(user);\\n }\\n }\\n else{\\n return;\\n\\n\\n }\\n }\",\n \"@SuppressWarnings({ \\\"rawtypes\\\", \\\"unchecked\\\", \\\"deprecation\\\" })\\r\\n\\tprotected void btnCreateactionPerformed() {\\n\\t\\tif ((confirmpasswordcreatejTextField.getText()).equals(passwordcreatejPasswordField.getText()))\\r\\n\\t\\t{\\r\\n\\t\\t\\tjava.sql.Connection conObj = JdbcConnect.createConnection();\\r\\n\\t\\t\\tjava.sql.ResultSet rs = null;\\r\\n\\t\\t\\ttry {\\r\\n\\t\\t\\t\\trs = JdbcSelectUname.selectRecordFromTable(conObj,usrname);\\r\\n\\t\\t\\t} catch (SQLException e) {\\r\\n\\t\\t\\t\\t// TODO Auto-generated catch block\\r\\n\\t\\t\\t\\tJOptionPane.showMessageDialog(null, e.getMessage(), \\\"Internal Error\\\", JOptionPane.ERROR_MESSAGE);\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\ttry {\\r\\n\\t\\t\\t\\tif (rs.next())\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\tString role = (String) rolecreatejComboBox.getSelectedItem();\\r\\n\\t\\r\\n\\t\\t\\t\\t\\t\\tjava.util.Vector add_rows = new java.util.Vector();\\r\\n\\t\\t\\t\\t\\t\\t//adding new user details to the Vector_add_rows\\r\\n\\t\\t\\t\\t\\t\\tadd_rows.add(unamecreatejTextField.getText());\\r\\n\\t\\t\\t\\t\\t\\tadd_rows.add(passwordcreatejPasswordField.getText());\\r\\n\\t\\t\\t\\t\\t\\tadd_rows.add(passHintTextField.getText());\\r\\n\\t\\t\\t\\t\\t\\tadd_rows.add(role);\\r\\n\\t\\r\\n\\t\\t\\t\\t\\t\\tint i = JdbcCreateUser.insertRecords(conObj,add_rows);\\r\\n\\t\\r\\n\\t\\t\\t\\t\\t\\tif (i!=1)\\r\\n\\t\\t\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\t\\t\\tjavax.swing.JOptionPane.showMessageDialog(null, \\\"User@\\\"+unamecreatejTextField.getText()+\\\" not created\\\\nPlease try again...\\\", \\\"User@\\\"+unamecreatejTextField.getText()+\\\" error\\\", javax.swing.JOptionPane.ERROR_MESSAGE);\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\t\\telse {\\r\\n\\t\\t\\t\\t\\t\\t\\tjavax.swing.JOptionPane.showMessageDialog(null, \\\"User@\\\"+unamecreatejTextField.getText()+\\\" added to the system\\\", \\\"User@\\\"+unamecreatejTextField.getText()+\\\" success message\\\", javax.swing.JOptionPane.PLAIN_MESSAGE);\\r\\n\\t\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t}//rs.next() if statement;\\r\\n\\t\\r\\n\\t\\t\\t\\telse {\\r\\n\\t\\t\\t\\t\\tjavax.swing.JOptionPane.showMessageDialog(null, \\\"Access denied! User@\\\"+usrname+\\\" not granted to create new users\\\", \\\"User@\\\"+usrname+\\\" authentication error\\\", javax.swing.JOptionPane.ERROR_MESSAGE);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t} catch (HeadlessException e) {\\r\\n\\t\\t\\t\\t// TODO Auto-generated catch block\\r\\n\\t\\t\\t\\tJOptionPane.showMessageDialog(null, e.getMessage(), \\\"\\\", JOptionPane.ERROR_MESSAGE);\\r\\n\\t\\t\\t} catch (SQLException e) {\\r\\n\\t\\t\\t\\t// TODO Auto-generated catch block\\r\\n\\t\\t\\t\\tJOptionPane.showMessageDialog(null, e.getMessage(), \\\"\\\", JOptionPane.ERROR_MESSAGE);\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\r\\n\\t\\telse {\\r\\n\\t\\t\\t\\tjavax.swing.JOptionPane.showMessageDialog(null, \\\"Access Denied! The given password do not match\\\", \\\"Mismatch error\\\", javax.swing.JOptionPane.ERROR_MESSAGE);\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t}\\t\\t\\t\\t\\r\\n\\t}\",\n \"public void new_user(){\\n }\",\n \"public void registrarUsuarioFinal(){\\r\\n Usuario nuevoUsuario= new Usuario();\\r\\n nuevoUsuario.setNombreUsuario(nuevoNombreUsuario);\\r\\n nuevoUsuario.setPassword(nuevoPasswordUsuario);\\r\\n nuevoUsuario.setTipoUsuario(\\\"final\\\");\\r\\n \\r\\n IUsuarioDAO iusuarioDAO = new UsuarioDAOImp();\\r\\n iusuarioDAO.agregarUsuario(nuevoUsuario);\\r\\n FacesMessage facesMessage = new FacesMessage(FacesMessage.SEVERITY_INFO, \\\"Usuario registrado\\\", \\\"Usuario registrado exitosamente\\\");\\r\\n FacesContext.getCurrentInstance().addMessage(null, facesMessage);\\r\\n\\r\\n }\",\n \"@Override\\n public void onClick(View v) {\\n trasferisci_utente();\\n\\n // controlla se tutti i dati sono inseriti\\n if (checkInput())\\n {\\n creaUser();\\n NOME = username.getText().toString();\\n CHIAVE = password.getText().toString();\\n\\n // controlla se l'utente USER con i dati inseriti negli edit_text è gia presente\\n if (checkUser(persone, NOME, CHIAVE)) {\\n\\n errore_utente.setVisibility(View.GONE);\\n\\n // impedisce a due utenti di avere lo stesso username\\n if(checkUsername(persone, NOME)) {\\n\\n errore_duplicato_username.setVisibility(View.GONE);\\n\\n persone.add(user);\\n\\n Intent showResult = new Intent(Registration.this, MainActivity.class);\\n showResult.putExtra(PERSONA_PATH, persone);\\n //showResult.putExtra(UTENTE_PATH, user);\\n startActivity(showResult);\\n } else {\\n errore_duplicato_username.setVisibility(View.VISIBLE);\\n }\\n } else {\\n errore_utente.setVisibility(View.VISIBLE);\\n }\\n }\\n }\",\n \"public void createUser(String name, String password, Boolean uBtn, Boolean eBtn){\\n\\t\\t\\n\\t\\tif(eBtn) {\\n\\t\\t\\tif(password.equals(\\\"\\\")) {\\n\\t\\t\\t\\tSystem.out.println(\\\"Please enter Password\\\");\\n\\t\\t\\t\\tJOptionPane.showMessageDialog(null, \\\"No password entered \\\" , \\\"Empty Password\\\", JOptionPane.ERROR_MESSAGE);\\n\\t\\t\\t}else if(name.equals(\\\"\\\")) {\\n\\t\\t\\t\\tSystem.out.println(\\\"Please enter UserName\\\");\\n\\t\\t\\t\\tJOptionPane.showMessageDialog(null, \\\"No UserName entered \\\" , \\\"Empty UserName\\\", JOptionPane.ERROR_MESSAGE);\\n\\t\\t\\t}else {\\n\\t\\t\\t\\tEmployee e1 = new Employee(name);\\n//\\t\\t\\t\\te1.setName(name);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tonlinestore.employeeList.put(e1, password);\\n\\t\\t\\t\\tSystem.out.println(\\\"New Employee Created, Please login\\\");\\n\\t\\t\\t\\tJOptionPane.showMessageDialog(null, \\\"New Employee Created. PLease Login Again\\\" , \\\"new Employee\\\", JOptionPane.PLAIN_MESSAGE);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tbuildEmployeeLoginGUI();\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\tif(uBtn) {\\n\\t\\t\\t\\n\\t\\t\\tif(password.equals(\\\"\\\")) {\\n\\t\\t\\t\\tSystem.out.println(\\\"Please enter Password\\\");\\n\\t\\t\\t\\tJOptionPane.showMessageDialog(null, \\\"No password entered \\\" , \\\"Empty Password\\\", JOptionPane.ERROR_MESSAGE);\\n\\t\\t\\t}else if(name.equals(\\\"\\\")) {\\n\\t\\t\\t\\tSystem.out.println(\\\"Please enter UserName\\\");\\n\\t\\t\\t\\tJOptionPane.showMessageDialog(null, \\\"No UserName entered \\\" , \\\"Empty UserName\\\", JOptionPane.ERROR_MESSAGE);\\n\\t\\t\\t}else {\\n\\t\\t\\t\\tSystem.out.println(\\\"User radio button pressed\\\");\\n\\t\\t\\t\\tCustomer c1 = new Customer(name);\\n\\t\\t\\t\\t//c1.setName(name);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tonlinestore.customerList.put(c1, password);\\n\\t\\t\\t\\t//System.out.println(\\\"New Customer Created, Please Login\\\");\\n\\t\\t\\t\\tJOptionPane.showMessageDialog(null, \\\"New Customer Created. Please Login Again \\\" , \\\"new Customer\\\", JOptionPane.PLAIN_MESSAGE);\\n\\t\\t\\t\\tbuildCustomerLoginGUI();\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t\\t\\n\\t\\t}\\n\\n\\t}\",\n \"@FXML void saveUser(ActionEvent e) {\\n\\t\\tString userName = userNameTxt.getText().trim();\\n\\t\\t\\n\\t\\tif(userName.isEmpty()) {\\n\\t\\t\\tAlert alert = new Alert(Alert.AlertType.ERROR);\\n alert.setTitle(\\\"Error\\\");\\n alert.setContentText(\\\"User name cannot be blank.\\\");\\n alert.showAndWait();\\n\\t\\t}else {\\n\\t\\t\\t/*if(userList.contains(user)) {\\n\\t\\t\\t\\t//give error\\n\\t\\t\\t\\tuserNameTxt.clear();\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tuserList.add(user);\\n\\t\\t\\t\\tSystem.out.println(userList.toString());\\n\\t\\t\\t\\tuserNameTxt.clear();\\n\\t\\t\\t\\t\\n\\t\\t\\t}*/\\n\\t\\t\\t\\n\\t\\t\\t//userList.add(user);\\n\\t\\t\\t\\n\\t\\t\\t//checks if user is in list\\n\\t\\t\\tif(userInList(userName)) {\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tAlert alert = new Alert(Alert.AlertType.ERROR);\\n\\t alert.setTitle(\\\"Error\\\");\\n\\t alert.setContentText(\\\"User name already exists.\\\");\\n\\t alert.showAndWait();\\n\\t\\t\\t\\tuserNameTxt.clear();\\n\\t\\t\\t}else {\\n\\t\\t\\t\\tUser user = new User(userName);\\n\\t\\t\\t\\tuserList.add(user);\\n\\t\\t\\t\\tuserNameTxt.clear();\\n\\t\\t\\t\\t//userListView.refresh();\\n\\t\\t\\t\\tuserListView.setItems(userList);\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t\\t\\n\\t\\thideAdditionElements();\\n\\t}\",\n \"public void register_user(View view) {\\n CustomRestaurantTypeDialog customRestaurantTypeDialog = new CustomRestaurantTypeDialog();\\n customRestaurantTypeDialog.show(getSupportFragmentManager(), \\\"testing\\\");\\n }\",\n \"public void userCreated(UserCreateCommand command) {\\n\\t\\t}\",\n \"@Override\\r\\n\\t\\t\\tpublic void onSuccess() {\\n\\t\\t\\t\\tfinal User c = userManager.getCurrentUser(User.class);\\r\\n\\t\\t\\t\\tShowToast(\\\"修改成功:\\\"+c.getNick());\\r\\n\\t\\t\\t\\tfinish();\\r\\n\\t\\t\\t}\",\n \"public void success() {\\n Toast.makeText(ui.getApplicationContext(),\\\"Account successfully created!\\\",Toast.LENGTH_SHORT).show();\\n }\",\n \"public void addUserBtn(){\\n\\t\\t\\n\\t\\t// TODO: ERROR CHECK\\n\\t\\t\\n\\t\\tUserEntry user = new UserEntry(nameTF.getText(), (String)usertypeCB.getValue(), emailTF.getText());\\n\\t\\tAdminController.userEntryList.add(user);\\n\\t\\t\\n\\t\\t\\n\\t\\t// Create a UserEntry and add it to the observable list\\n\\t\\tAdminController.userList.add(user);\\t\\t\\n\\t\\t\\n\\t //AdminController.adminTV.setItems(AdminController.userList);\\n\\t\\t\\n\\t\\t//Close current stage\\n\\t\\tAdminController.addUserStage.close();\\n\\t\\t\\n\\t}\",\n \"@Override\\n protected void onPostExecute(JSONArray user) {\\n Context context1 = getApplicationContext();\\n Toast new_toast = Toast.makeText(context1, \\\"User has been created\\\", Toast.LENGTH_LONG);\\n new_toast.show();\\n }\",\n \"private void openCreateAccountDialog()\\n {\\n testDialog();\\n\\n }\",\n \"public void gotoCreateUser(){\\n try {\\n FXMLCreateUserController verCreateUser = (FXMLCreateUserController) replaceSceneContent(\\\"FXMLCreateUser.fxml\\\");\\n verCreateUser.setApp(this);\\n } catch (Exception ex) {\\n Logger.getLogger(IndieAirwaysClient.class.getName()).log(Level.SEVERE, null, ex);\\n }\\n }\",\n \"public void onSignUpClick() {\\n\\t\\tString uid = regview.getUsername();\\n\\t\\tString pw = regview.getPassword();\\n\\t\\tString na = regview.getName();\\n\\t\\tString em = regview.getEmail();\\n\\t\\tString text = \\\"\\\";\\n\\t\\tif(uid.equals(\\\"\\\") || pw.equals(\\\"\\\") || na.equals(\\\"\\\")|| em.equals(\\\"\\\")){\\n\\t\\t\\ttext = \\\"Please fill out all fields!\\\";\\n\\t\\t} else if(regview.findUser(uid)!=User.NULL_USER){\\n\\t\\t\\ttext = \\\"The username already exsit, please try another one!\\\";\\n\\t\\t} else {\\n\\t\\t\\tregview.addUser(new User(uid,pw,na,em));\\n\\t\\t\\tregview.goLoginPage();\\n\\t\\t}\\n\\t\\tregview.setRegisterText(text);\\n\\t}\",\n \"private ShowCreateAnswerPage() {\\n this.service = UserService.retrieve();\\n this.validator = Validator.retrieve();\\n }\",\n \"@Override\\n public void done(User returnedUser) {\\n startActivity(new Intent(Register.this, Login.class));\\n }\",\n \"private Dialog recreateDialog() {\\n final AlertDialog.Builder builder = new AlertDialog.Builder(OptionActivity.this);\\n builder.setMessage(\\\"Do you want to change your profile?\\\")\\n .setPositiveButton(\\\"Yah!\\\", new DialogInterface.OnClickListener() {\\n public void onClick(DialogInterface dialog, int id) {\\n Intent intent = new Intent(OptionActivity.this, amountscreen.class);\\n startActivity(intent);\\n }\\n })\\n .setNegativeButton(\\\"Nope\\\", new DialogInterface.OnClickListener() {\\n public void onClick(DialogInterface dialog, int id) {\\n\\n }\\n });\\n // Create the AlertDialog object and return it\\n return builder.create();\\n }\",\n \"@Override\\n\\t\\t\\tpublic void onClick(View v) {\\n\\t\\t\\t\\tIntent inten = new Intent(Main_Activity.this, Create_User.class);\\n\\t\\t\\t\\tBundle myBundle = new Bundle();\\n\\t\\t\\t\\tString u =userName;\\n\\t\\t\\t\\tlog.info(\\\"in create coach user is: \\\"+u);\\n\\t\\t\\t\\tif(coach_user.isEmpty()) {\\n\\t\\t\\t\\t\\tcoach_user=\\\"\\\";\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tmyBundle.putString(\\\"usern\\\", u);\\n\\t\\t\\t\\tinten.putExtras(myBundle);\\n\\t\\t\\t\\tstartActivityForResult(inten, 234);\\n\\t\\t\\t\\t}\",\n \"@FXML\\n private void handleNewPerson() {\\n Shops tempShops = new Shops();\\n boolean okClicked = mainApp.showPersonEditDialog(tempShops);\\n if (okClicked) {\\n mainApp.getPersonData().add(tempShops);\\n }\\n }\",\n \"@Override\\n public void onSuccess(AuthResult authResult) {\\n userWAPFirebase.create(newUser, firebaseAuth.getCurrentUser().getUid()).addOnSuccessListener(new OnSuccessListener<Void>() {\\n @Override\\n public void onSuccess(Void aVoid) {\\n Log.d(TAG, \\\"User \\\" + newUser.getUsername() + \\\" has been successfully created\\\");\\n Toast.makeText(SignUpActivity.this, \\\"Sign up successful!\\\", Toast.LENGTH_SHORT).show();\\n\\n //Go back to Login Activity\\n Intent loginIntent = new Intent(SignUpActivity.this, LoginActivity.class);\\n loginIntent.putExtra(PASSWORD_KEY, etPasswordSignup.getText().toString());\\n loginIntent.putExtra(EMAIL_KEY, newUser.getEmail());\\n startActivity(loginIntent);\\n }\\n });\\n }\",\n \"public String createUserAction()throws Exception{\\n\\t\\tString response=\\\"\\\";\\n\\t\\tresponse=getService().getUserMgmtService().createNewUser(\\n\\t\\t\\t\\tgetAuthBean().getUserName(),\\n\\t\\t\\t\\tgetAuthBean().getFirstName(),\\n\\t\\t\\t\\tgetAuthBean().getLastName(),\\n\\t\\t\\t\\tgetAuthBean().getEmailId(),\\n\\t\\t\\t\\tgetAuthBean().getRole()\\n\\t\\t);\\n\\t\\tgetAuthBean().setResponse(response);\\n\\t\\tinputStream = new StringBufferInputStream(response);\\n\\t\\tinputStream.close();\\n\\t\\treturn SUCCESS;\\n\\t}\",\n \"@Override\\n public void onClick(View view) {\\n UpdateUserInformation();\\n addUserChangeListener();\\n/*\\n //check for already exists\\n if (TextUtils.isEmpty(userID)) {\\n\\n createUser(name, email, userMobile,userLatitude, userLongitude);\\n Intent intent = new Intent(UserRegister.this, MapView.class);\\n startActivity(intent);\\n return;\\n\\n } else {\\n //updateUser(name, email, userMobile,userLatitude, userLongitude);\\n //UpdateUserInformation();\\n }\\n*/\\n }\",\n \"public void agregarNuevoUsuarioAdmin(){\\n //recupero objeto rol administrador\\n usuario.setRol(new ListadoRoles().getListaRoles().get(0));\\n usuarioBean.setUsuario(usuario);\\n usuarioBean.agregarUsuario();\\n FacesContext context = FacesContext.getCurrentInstance(); \\n context.addMessage(null, new FacesMessage(\\\"Éxito\\\", \\\"Se agregó un Usuario Administrador correctamente.\\\" ));\\n RequestContext.getCurrentInstance().execute(\\\"PF('dlgAltaUsuario').hide();\\\");\\n }\",\n \"void register() {\\n if (registerView.getFirstName().length() == 0 || registerView.getLastName().length() == 0 || registerView.getUsername().length() == 0 || registerView.getPassword().length() == 0) {\\n IDialog invalidRegistrationDialog\\n = dialogFactory.createDialog(DialogFactoryOptions.dialogNames.MESSAGE, new HashMap<String, Object>() {\\n {\\n put(\\\"message\\\", \\\"Unable to register: Fields must be non-empty!\\\");\\n put(\\\"title\\\", \\\"Authentication Error\\\");\\n put(\\\"messageType\\\", DialogFactoryOptions.dialogType.ERROR);\\n }\\n });\\n\\n invalidRegistrationDialog.run();\\n } else {\\n if (userController.registerUser(registerView.getFirstName(), registerView.getLastName(), registerView.getUsername(), registerView.getPassword()) != null) {\\n mainFrame.setPanel(panelFactory.createPanel(PanelFactoryOptions.panelNames.MAIN_MENU));\\n } else {\\n IDialog invalidRegistrationDialog = dialogFactory.createDialog(DialogFactoryOptions.dialogNames.MESSAGE, new HashMap<String, Object>() {\\n {\\n put(\\\"message\\\", \\\"Unable to register: Username is already taken\\\");\\n put(\\\"title\\\", \\\"Authentication Error\\\");\\n put(\\\"messageType\\\", DialogFactoryOptions.dialogType.ERROR);\\n }\\n });\\n\\n invalidRegistrationDialog.run();\\n }\\n }\\n }\",\n \"public void insert()\\n {\\n CInsertUser cInsertUser = new CInsertUser();\\n window.dispose();\\n }\",\n \"private void successDialog() {\\n AlertDialog dialog = _dialogFactory.createDialog(this, R.string.completed, R.string.success);\\n\\n dialog.setButton(DialogInterface.BUTTON_NEUTRAL, getString(R.string.ok), new DialogInterface.OnClickListener() {\\n public void onClick(DialogInterface dialog, int id) {\\n gotoGameEnd(IGameConstants.GAME_SUCCESS);\\n }\\n });\\n\\n dialog.setCancelable(false);\\n _dialogActive = true;\\n dialog.show();\\n }\",\n \"private void SuccessfulBox(View v){\\n \\t//create an alert box with specified properties\\n \\tnew AlertDialog.Builder(this)\\n \\t.setTitle(\\\"Submit Successfully!\\\")\\n \\t.setMessage(\\\"New prescription information has been added to\\\" + \\\" \\\" +item)\\n \\t.setNeutralButton(\\\"ok\\\", null)\\n \\t.show();\\n }\",\n \"public void newUserClicked(View view) {\\r\\n Intent intent = new Intent(this, SignUpActivity.class);\\r\\n startActivity(intent);\\r\\n }\",\n \"private void onSignupSuccess() {\\n startActivity(currentActivity, UserLoginActivity.class);\\n finish();\\n }\",\n \"public void registerNewUser(View v) {\\n Intent intent = new Intent(this, com.mms.memorizationgame.RegisterActivity.class);\\n\\n finish();\\n startActivity(intent);\\n }\",\n \"@Override\\n protected void onActivityResult(int requestCode, int resultCode, @Nullable Intent data) {\\n if (CREATE_USER_REQUEST_CODE == requestCode && RESULT_OK == resultCode){\\n if (data != null) {\\n String username = data.getStringExtra(UserCreationActivity.BUNDLE_NEW_USER_NAME);\\n\\n User user = new User(username, User.EMPTY_CASE, User.EMPTY_CASE);\\n\\n createUser(user);\\n }\\n }\\n }\",\n \"private void addNewUser() throws Exception, UnitException {\\n String firstNameInput = firstName.getText();\\n String lastNameInput = lastName.getText();\\n String unitInput = unitID.getText();\\n String accountInput = accountTypeValue;\\n String passwordInput = password.getText();\\n User newUserInfo;\\n\\n // Create user type based on the commandbox input\\n switch (accountInput) {\\n case \\\"Employee\\\":\\n newUserInfo = new Employee(firstNameInput, lastNameInput, unitInput, passwordInput);\\n break;\\n case \\\"Lead\\\":\\n newUserInfo = new Lead(firstNameInput, lastNameInput, unitInput, passwordInput);\\n break;\\n case \\\"Admin\\\":\\n newUserInfo = new Admin(firstNameInput, lastNameInput, unitInput, passwordInput);\\n break;\\n default:\\n throw new IllegalStateException(\\\"Unexpected value: \\\" + accountInput);\\n }\\n\\n // Try adding this new user information to the database, if successful will return success prompt\\n try {\\n Admin.addUserToDatabase(newUserInfo);\\n\\n // If successful, output message dialog\\n String msg = \\\"New User \\\" + firstNameInput + \\\" \\\" + lastNameInput + \\\" with UserID \\\"\\n + newUserInfo.returnUserID() + \\\" successfully created\\\";\\n JOptionPane.showMessageDialog(null, msg);\\n\\n // Reset Values\\n firstName.setText(\\\"\\\");\\n lastName.setText(\\\"\\\");\\n unitID.setText(\\\"\\\");\\n password.setText(\\\"\\\");\\n } catch (UserException e) {\\n JOptionPane.showMessageDialog(null, e.getMessage());\\n } catch (Exception e) {\\n JOptionPane.showMessageDialog(null, e.getMessage());\\n }\\n }\",\n \"@Override\\r\\n\\tprotected void okPressed() {\\n\\t\\t\\r\\n\\t\\tfor(TableItem item:tv.getTable().getItems()){\\r\\n\\t\\t\\tUser friend=(User) item.getData();\\r\\n\\t\\t\\tTranObject<User> msg=new TranObject<User>(TranObjectType.CLIENT_TO_SEVER);\\r\\n\\t\\t\\tmsg.setFromUser(user.getId());\\r\\n\\t\\t\\tmsg.setToUser(friend.getId());\\r\\n\\t\\t\\t//msg.setObject(user);\\r\\n\\t\\t\\tmsg.setObjStr(gson.toJson(user));\\r\\n\\t\\t\\tmsg.setRequest(ClientRequest.ADD_FRIEND);\\r\\n\\t\\t\\tc.getWriteThread().setMsg(msg);\\r\\n//\\t\\t\\tString category_name=combo.getText();\\r\\n//\\t\\t\\tCategory new_category=null;\\r\\n//\\t\\t\\tfor(Category category:user.getCategorys()){\\r\\n//\\t\\t\\t\\tif(category.getKey().equals(category_name)){\\r\\n//\\t\\t\\t\\t\\tnew_category=category;\\r\\n//\\t\\t\\t\\t\\tbreak;\\r\\n//\\t\\t\\t\\t}\\r\\n//\\t\\t\\t}\\r\\n//\\t\\t\\tif(new_category==null){\\r\\n//\\t\\t\\t\\tnew_category=new Category();\\r\\n//\\t\\t\\t\\tnew_category.setKey(category_name);\\r\\n//\\t\\t\\t\\tuser.getCategorys().add(new_category);\\r\\n//\\t\\t\\t}\\r\\n//\\t\\t\\tnew_category.getMembers().add(friend);\\r\\n\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tsuper.okPressed();\\r\\n\\t}\",\n \"@Override\\n public Dialog onCreateDialog(Bundle savedInstanceState) {\\n\\n LayoutInflater inflater = getActivity().getLayoutInflater();\\n\\n\\n AlertDialog.Builder builder = new AlertDialog.Builder(getActivity());\\n builder.setMessage(\\\"CREA USUARIO\\\")\\n .setView(inflater.inflate(R.layout.register_dialog, null))\\n .setPositiveButton(\\\"OK\\\", new DialogInterface.OnClickListener() {\\n public void onClick(DialogInterface dialog, int id) {\\n editUser = ((AlertDialog) dialog).findViewById(R.id.username);\\n editPass = ((AlertDialog) dialog).findViewById(R.id.password);\\n startConexion();\\n }\\n })\\n .setNegativeButton(\\\"CANCEL\\\", new DialogInterface.OnClickListener() {\\n public void onClick(DialogInterface dialog, int id) {\\n // User cancelled the dialog\\n }\\n });\\n // Create the AlertDialog object and return it\\n return builder.create();\\n }\",\n \"public UserDialog(JFrame parent){\\n\\t\\t\\tsuper(parent, \\\"New user\\\");\\n\\t\\t\\tadd(new JPanel(), BorderLayout.NORTH);\\n\\t\\t\\tadd(new UserDatapanel(),BorderLayout.CENTER);\\n\\t\\t\\tadd(getButtonPanel(),BorderLayout.SOUTH);\\n\\t\\t\\tsetSize(500,300);\\n\\t\\t}\",\n \"public void greetingUser() {\\n\\n\\n //Showing dialog\\n\\n final Dialog dialog = new Dialog(UserHomeActivity.this);\\n dialog.requestWindowFeature(Window.FEATURE_NO_TITLE);\\n dialog.setContentView(R.layout.greetinguser);\\n dialog.getWindow().setBackgroundDrawable(new ColorDrawable(Color.TRANSPARENT));\\n dialog.show();\\n\\n\\n //Shared preference object for auto login\\n\\n final AutoLogin shared = new AutoLogin(this);\\n\\n\\n //Hooks\\n\\n backButton = dialog.findViewById(R.id.backButton);\\n userName = dialog.findViewById(R.id.userNamegreeting);\\n greetingMsg = dialog.findViewById(R.id.greetings);\\n\\n //Setting greeting\\n\\n\\n Calendar cal = Calendar.getInstance();\\n Date date=cal.getTime();\\n DateFormat dateFormat = new SimpleDateFormat(\\\"HH:mm:ss\\\");\\n String formattedDate=dateFormat.format(date);\\n\\n //Splitting the date\\n\\n String[] timeInString = formattedDate.split(\\\":\\\");\\n\\n\\n int time = Integer.parseInt(timeInString[0]);\\n\\n if(time>=0 && time<12){\\n\\n greetingMsg.setText(\\\"Good Morning\\\");\\n\\n }\\n else if(time>=12 && time<17){\\n\\n greetingMsg.setText(\\\"Good Afternoon\\\");\\n\\n }\\n else{\\n\\n greetingMsg.setText(\\\"Good evening\\\");\\n\\n }\\n\\n\\n //Setting user name\\n\\n userName.setText(shared.getUserName());\\n\\n //User will click on back button\\n backButton.setOnClickListener(new View.OnClickListener() {\\n @Override\\n public void onClick(View view) {\\n dialog.dismiss();\\n }\\n });\\n\\n\\n }\",\n \"public void UserHasBeenRegistered() {\\r\\n\\t\\t\\tJOptionPane.showMessageDialog(new JFrame(), \\\"User has been registered\\\",\\\"\\\", JOptionPane.INFORMATION_MESSAGE);\\r\\n\\t\\t\\tNameTF.setText(\\\"\\\");\\r\\n\\t\\t\\tSurnameTF.setText(\\\"\\\");\\r\\n\\t\\t\\tUsernameTF.setText(\\\"\\\");\\r\\n\\t\\t\\tPasswordTF.setText(\\\"\\\");\\r\\n\\t\\t\\tEmailTF.setText(\\\"\\\");\\r\\n\\t\\t\\tAddressTF.setText(\\\"\\\");\\r\\n\\t\\t\\tCardNTF.setValue(null);\\r\\n\\t\\t}\",\n \"@FXML private void setToNewUser(){\\n\\t\\tshowPassword();\\n\\t\\tclearFields();\\n\\t\\thideLackMessages();\\n\\t\\tchangeCancelButton.setText(\\\"Anuluj\\\");\\n\\t\\tnewUser = true;\\n\\t}\",\n \"public Dialog createAddPersonDialog(String title, String msg) {\\n AlertDialog.Builder builder = new AlertDialog.Builder(getMyAcitivty());\\n builder.setTitle(title);\\n builder.setMessage(msg);\\n\\n // Use an EditText view to get user input.\\n final EditText input = new EditText(getMyAcitivty());\\n input.setText(\\\"\\\");\\n builder.setView(input);\\n\\n builder.setPositiveButton(\\\"Ok\\\", new DialogInterface.OnClickListener() {\\n @Override\\n public void onClick(DialogInterface dialog, int whichButton) {\\n String value = input.getText().toString();\\n Log.d(TAG, \\\"user input: \\\" + value);\\n inputDialogResult = value;\\n launchTrainingActivity();\\n// AlertDialog dg =\\n// SelectServerAlertDialog.createDialog(\\n// getContext(),\\n// \\\"Pick a Server\\\",\\n// getAllIps(),\\n// launchTrainingActivityAction,\\n// cancelAction,\\n// true);\\n// dg.show();\\n }\\n });\\n builder.setNegativeButton(\\\"Cancel\\\", SelectServerAlertDialog.cancelAction);\\n return builder.create();\\n }\",\n \"@Override\\n\\tpublic void onActivityResult(int requestCode, int resultCode, Intent data) {\\n\\t\\tif (resultCode != -1 && resultCode !=0) {\\n\\t\\t\\tappState.userID = data.getStringExtra(\\\"uid\\\");\\n\\t\\t\\tappState.userName = data.getStringExtra(\\\"name\\\");\\n\\t\\t\\tappState.note = data.getStringExtra(\\\"note\\\");\\t\\n\\t\\t\\tif (\\\"none\\\".equals(appState.userID)) {\\n\\t\\t\\t\\tnew AlertDialog.Builder(getActivity())\\n\\t\\t\\t\\t.setTitle(\\\"No user found\\\")\\n\\t\\t\\t\\t.setMessage(\\\"There's no user found in your device, please ADD one in User page.\\\")\\n//\\t\\t\\t\\t.setNegativeButton(\\\"Cancel\\\",\\n//\\t\\t\\t\\t\\t\\tnew DialogInterface.OnClickListener() {\\n//\\t\\t\\t\\t\\t\\t\\t@Override\\n//\\t\\t\\t\\t\\t\\t\\tpublic void onClick(DialogInterface dialog, int which) {\\n//\\t\\t\\t\\t\\t\\t\\t\\t//this.s = \\\"Negative\\\";\\n//\\t\\t\\t\\t\\t\\t\\t}\\n//\\t\\t\\t\\t\\t\\t})\\n\\t\\t\\t\\t.setPositiveButton(\\\"Confirm\\\", new DialogInterface.OnClickListener() {\\n\\t\\t\\t\\t\\t\\t\\tpublic void onClick(DialogInterface dialog, int whichButton) {\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}).show();\\n\\t\\t\\t} else {\\n\\t\\t\\t\\ttv_user1_dianzichen.setTextColor(Color.BLACK);\\n\\t\\t\\t\\ttv_user2_dianzichen.setTextColor(Color.BLACK);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tupdateUI();\\t\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t}\\n\\t}\",\n \"private void notifySelectedUser() {\\n\\t\\tfinal GHAGridRecord<SSOUser> selectedRecord = grid.getSelectedRecord();\\n\\t\\tif (selectedRecord == null) {\\n\\t\\t\\tGHAErrorMessageProcessor.alert(\\\"record-not-selected\\\");\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tnotifyUser(selectedRecord.toEntity());\\n\\t\\thide();\\n\\t}\",\n \"public void Report_User_alert(){\\n final AlertDialog.Builder alert=new AlertDialog.Builder(context,R.style.DialogStyle);\\n alert.setTitle(\\\"Report\\\")\\n .setMessage(\\\"Are you sure to Report this user?\\\")\\n .setNegativeButton(\\\"No\\\", new DialogInterface.OnClickListener() {\\n public void onClick(DialogInterface dialog, int id) {\\n dialog.dismiss();\\n }\\n })\\n .setPositiveButton(\\\"yes\\\", new DialogInterface.OnClickListener() {\\n @Override\\n public void onClick(DialogInterface dialog, int which) {\\n Send_report();\\n }\\n });\\n\\n alert.setCancelable(true);\\n alert.show();\\n }\",\n \"public void addData(final String name,final int phone){\\n boolean isInserted = myDb.insertData(name,phone);\\n if (isInserted =true){\\n builder.setTitle(\\\" User Created Successfully\\\");\\n builder.setMessage(\\\" Name : \\\"+ name +\\\"\\\\n Phone : +265\\\"+ phone);\\n builder.setPositiveButton(\\\"OK\\\", new DialogInterface.OnClickListener() {\\n @Override\\n public void onClick(DialogInterface dialogInterface, int i) {\\n ///// go to general assessment///////\\n\\n mainActivity();\\n }\\n });\\n AlertDialog alertDialog = builder.create();\\n alertDialog.show();\\n }\\n else {\\n builder.setTitle(\\\"User Creation\\\");\\n builder.setMessage(\\\"Response : Sorry Error occured!! Try again \\\" );\\n builder.setNegativeButton(\\\"Try Again\\\", new DialogInterface.OnClickListener() {\\n @Override\\n public void onClick(DialogInterface dialogInterface, int i) {\\n\\n }\\n });\\n AlertDialog alertDialog = builder.create();\\n alertDialog.show();\\n }\\n }\",\n \"public void dialogoAgregarUsuario() {\\n vAgregarUsuario = new V_AgregarUsuario(new JFrame(), true);\\n vAgregarUsuario.setVisible(true);\\n }\",\n \"public void createAccount() {\\n\\t\\t// Assigns variables based on user input\\n\\t\\tString username = usernameField.getText();\\n\\t\\tString firstName = firstNameField.getText();\\n\\t\\tString lastName = lastNameField.getText();\\n\\t\\tString address = addressField.getText();\\n\\t\\tString postCode = postcodeField.getText();\\n\\t\\tString phoneNumber = phoneNumberField.getText();\\n\\t\\tlong phoneNumberLong;\\n\\t\\tif (username.isEmpty() || firstName.isEmpty() || lastName.isEmpty() || address.isEmpty() || postCode.isEmpty()\\n\\t\\t\\t\\t|| phoneNumber.isEmpty()) { // Checks if number is correct format\\n\\n\\t\\t\\tAlert alert = new Alert(AlertType.ERROR); // Error message\\n\\t\\t\\talert.setTitle(\\\"Error\\\");\\n\\n\\t\\t\\talert.setHeaderText(\\\"Could not create an user\\\");\\n\\t\\t\\talert.setContentText(\\\"Make sure you fill all fields and press button again\\\");\\n\\t\\t\\talert.showAndWait();\\n\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\n\\t\\telse {\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tphoneNumberLong = Long.parseLong(phoneNumber);\\n\\t\\t\\t} catch (Exception e) {\\n\\t\\t\\t\\tAlert alert = new Alert(AlertType.ERROR);\\n\\t\\t\\t\\talert.setTitle(\\\"Error\\\");\\n\\n\\t\\t\\t\\talert.setHeaderText(\\\"Wrong format of phone number\\\");\\n\\t\\t\\t\\talert.setContentText(\\\"Please enter correct phone number\\\");\\n\\t\\t\\t\\talert.showAndWait();\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tif(FileReader.exists(username)) {\\n\\t\\t\\t\\tAlert alert = new Alert(AlertType.ERROR);\\n\\t\\t\\t\\talert.setTitle(\\\"Error\\\");\\n\\n\\t\\t\\t\\talert.setHeaderText(\\\"User with the username \\\"+ username +\\\" already exists. \\\");\\n\\t\\t\\t\\talert.setContentText(\\\"Please choose another username\\\");\\n\\t\\t\\t\\talert.showAndWait();\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\n\\t\\t\\tString userdata = \\\"\\\";\\n\\t\\t\\tuserdata += \\\"\\\\n Username: \\\" + username;\\n\\t\\t\\tuserdata += \\\"\\\\n First name: \\\" + firstName;\\n\\t\\t\\tuserdata += \\\"\\\\n Last name: \\\" + lastName;\\n\\t\\t\\tuserdata += \\\"\\\\n Address: \\\" + address;\\n\\t\\t\\tuserdata += \\\"\\\\n Post code: \\\" + postCode;\\n\\t\\t\\tuserdata += \\\"\\\\n Phone number: \\\" + phoneNumberLong;\\n\\t\\t\\t\\n\\n\\t\\t\\tif(custom) {\\n\\t\\t\\t\\tavatarIndex = 101;\\n\\t\\t\\t\\t// Gives users the custom avatar\\n\\t\\t\\t\\tFile file1 = new File(\\\"artworkImages/\\\" + username);\\n\\t\\t\\t\\tfile1.mkdir();\\n\\t\\t\\t\\tPath path = Paths.get(\\\"customAvatars/\\\" + username + \\\".png\\\");\\n\\t\\t\\t\\tString path1 = \\\"tmpImg.png\\\";\\n\\t\\t\\t\\tFile file = new File(path1);\\n\\n\\t\\t\\t\\ttry {\\n\\t\\t\\t\\t\\tFiles.copy(file.toPath(), path, StandardCopyOption.REPLACE_EXISTING);\\n\\t\\t\\t\\t} catch (IOException e) {\\n\\t\\t\\t\\n\\t\\t\\t\\t\\te.printStackTrace();\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tUser user = new User(username, firstName, lastName, address, postCode, phoneNumberLong, avatarIndex);\\n\\t\\t\\tFileReader.addUser(user); // Creates user\\n\\n\\t\\t\\ttry {\\n\\t\\t\\t\\tWriter.writeUserFile(user); // Adds user to memory\\n\\t\\t\\t} catch (IOException e) {\\n\\t\\t\\t\\n\\t\\t\\t\\te.printStackTrace();\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\n\\t\\t\\tAlert alert = new Alert(AlertType.INFORMATION); // Success message\\n\\t\\t\\talert.setTitle(\\\"Success\\\");\\n\\n\\t\\t\\talert.setHeaderText(\\\"The user has been created\\\");\\n\\t\\t\\talert.setContentText(\\\"Close this window to return to login screen\\\");\\n\\t\\t\\talert.showAndWait();\\n\\n\\t\\t\\tcreateAccountButton.getScene().getWindow().hide();\\n\\t\\t}\\n\\n\\t}\",\n \"@Override\\n public void onSuccess(UserBean userBean) {\\n finish();\\n startActivity(MainActivity.startIntent(getActivity()));\\n }\",\n \"@Override\\n public void onClick(ClickEvent event) {\\n String mobileNr = content.getLoginView().getMobilenrTxtBox().getText();\\n String password = content.getLoginView().getPasswordTxtBox().getText();\\n\\n // RPC authenticating user method\\n motionCBSTestService.authorizeUser(mobileNr, password, new AsyncCallback<User>() {\\n\\n @Override\\n public void onFailure(Throwable caught) {\\n Window.alert(\\\"Der skete en fejl\\\");\\n }\\n\\n @Override\\n public void onSuccess(User user) {\\n\\n // Failed to match input with User in database\\n if (user == null) {\\n Window.alert(\\\"Wrong password or mobile number!\\\");\\n } else if (user.getIsApproved() != true) {\\n Window.alert(\\\"User not approved!\\\");\\n } else\\n\\n\\n\\n // Here we check the type and if they are type 1 we go to admin view and the other way around\\n if (user.getType() == 1) {\\n adminController.loadUser(user);\\n content.changeView(content.getMainAdminView());\\n } else if (user.getType() == 2) {\\n userController.loadUser(user);\\n content.changeView(content.getMainUserView());\\n }\\n\\n // Clearing the text fields (mobileNr & password) from the login screen\\n content.getLoginView().clearTextBoxFields();\\n }\\n });\\n }\",\n \"void changeUser(){\\n\\t\\tfinal FrameLayout fl = new FrameLayout(this);\\n\\n\\t\\tfinal EditText newUID = new EditText(this);\\n\\t\\tfinal LinearLayout nameHolder = new LinearLayout(this);\\n\\t\\tnameHolder.setOrientation(1);//Vertical\\n//\\t\\tinputName.setGravity(Gravity.CENTER);\\n//\\t\\tinputTitle.setGravity(Gravity.CENTER);\\n\\t\\t//MAX 2 digits! HARDCODED\\n\\t\\t//Limit them to a certain amount of digits\\n\\t\\tInputFilter[] FilterArray = new InputFilter[1];\\n\\t\\tFilterArray[0] = new InputFilter.LengthFilter(2);\\n\\t\\tnewUID.setFilters(FilterArray);\\n\\t\\t\\n\\t\\tnameHolder.addView(newUID, new FrameLayout.LayoutParams(\\n\\t\\t\\t\\tFrameLayout.LayoutParams.FILL_PARENT,\\n\\t\\t\\t\\tFrameLayout.LayoutParams.WRAP_CONTENT));\\n\\t\\t\\n\\t\\tfl.addView(nameHolder, new FrameLayout.LayoutParams(\\n\\t\\t\\t\\tFrameLayout.LayoutParams. FILL_PARENT,\\n\\t\\t\\t\\tFrameLayout.LayoutParams.FILL_PARENT));\\n\\n\\t\\t// input.setText(\\\"Preset Text\\\");\\n\\t\\tnewUID.setHint(\\\"NUMBER: 00-99\\\");\\n\\t\\tnewUID.setInputType(InputType.TYPE_CLASS_NUMBER);\\n\\n\\t\\tAlertDialog newprojPopUp = new AlertDialog.Builder(this).create();\\n\\n\\t\\t//Show the keyboard automatically\\n\\t\\tnewprojPopUp.setOnShowListener(new OnShowListener() {\\n\\n\\t\\t @Override\\n\\t\\t public void onShow(DialogInterface dialog) {\\n\\t\\t InputMethodManager imm = (InputMethodManager) getSystemService(Context.INPUT_METHOD_SERVICE);\\n\\t\\t imm.showSoftInput(newUID, InputMethodManager.SHOW_FORCED);\\n\\t\\t }\\n\\t\\t});\\n\\t\\t\\n\\t\\tnewprojPopUp.setView(fl);\\n\\n\\t\\tnewprojPopUp.setTitle(\\\"Enter your USER ID (00-99)\\\");\\n\\n\\t\\t// Create Button\\n\\t\\tnewprojPopUp.setButton(\\\"Enter\\\",\\n\\t\\t\\t\\tnew DialogInterface.OnClickListener() {\\n\\n\\t\\t\\t\\t\\tpublic void onClick(\\n\\t\\t\\t\\t\\t\\t\\tfinal DialogInterface dMAIN,\\n\\t\\t\\t\\t\\t\\t\\tint which) {\\n\\n\\t\\t\\t\\t\\t\\tuserID=Integer.parseInt(newUID.getText().toString().trim());\\n\\t\\t\\t\\t\\t\\tuserButton.setText(\\\"USER: \\\"+userIDformatter.format(userID));\\n\\t\\t\\t\\t\\t\\tToast.makeText(\\n\\t\\t\\t\\t\\t\\t\\t\\tgetApplicationContext(),\\n\\t\\t\\t\\t\\t\\t\\t\\t\\\"New User ID = \\\"+userID,\\n\\t\\t\\t\\t\\t\\t\\t\\t1).show();\\n\\t\\t\\t\\t\\t\\tmakeUser();\\n\\t\\t\\t\\t\\t\\tloadUpAllPics();\\n\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t});\\n\\t\\t// Cancel Button\\n\\t\\tnewprojPopUp.setButton2(\\\"Cancel\\\",\\n\\t\\t\\t\\tnew DialogInterface.OnClickListener() {\\n\\n\\t\\t\\t\\t\\t@Override\\n\\t\\t\\t\\t\\tpublic void onClick(DialogInterface d,\\n\\t\\t\\t\\t\\t\\t\\tint which) {\\n\\n\\t\\t\\t\\t\\t\\t d.dismiss();\\n\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t});\\n\\n\\t\\tnewprojPopUp.show();\\n\\t\\tnewUID.requestFocus();\\n\\t\\tnewprojPopUp\\n\\t\\t\\t\\t.getWindow()\\n\\t\\t\\t\\t.setSoftInputMode(\\n\\t\\t\\t\\t\\t\\tWindowManager.LayoutParams.SOFT_INPUT_STATE_ALWAYS_VISIBLE);\\n\\n\\n\\t\\t\\n\\t}\",\n \"@SuppressLint(\\\"InflateParams\\\")\\r\\n\\tprivate void showDialog() {\\n\\t\\tLayoutInflater layoutInflater = LayoutInflater.from(getActivity());\\r\\n\\t\\tviewAddEmployee = layoutInflater\\r\\n\\t\\t\\t\\t.inflate(R.layout.activity_dialog, null);\\r\\n\\t\\teditText = (EditText) viewAddEmployee.findViewById(R.id.editText1);\\r\\n\\t\\ttv_phone = (TextView) viewAddEmployee.findViewById(R.id.tv_phone);\\r\\n\\t\\tbt_setting = (Button) viewAddEmployee.findViewById(R.id.bt_setting);\\r\\n\\t\\tbt_cancel = (Button) viewAddEmployee.findViewById(R.id.bt_cancel);\\r\\n\\t\\tString tel = SharePreferenceUtil.getInstance(\\r\\n\\t\\t\\t\\tgetActivity().getApplicationContext()).getUserTel();\\r\\n\\t\\ttv_phone.setText(StringUtils.getTelNum(tel));\\r\\n\\r\\n\\t\\tshowPop();\\r\\n\\r\\n\\t\\tbt_setting.setOnClickListener(new OnClickListener() {\\r\\n\\r\\n\\t\\t\\t@Override\\r\\n\\t\\t\\tpublic void onClick(View v) {\\r\\n\\t\\t\\t\\t// TODO Auto-generated method stub\\r\\n\\t\\t\\t\\tString psd = SharePreferenceUtil.getInstance(\\r\\n\\t\\t\\t\\t\\t\\tgetActivity().getApplicationContext()).getUserPsd();\\r\\n\\t\\t\\t\\tString password = editText.getText().toString().trim();\\r\\n\\t\\t\\t\\tif (TextUtils.isEmpty(password)) {\\r\\n\\t\\t\\t\\t\\tShowToast(\\\"密码不能为空！\\\");\\r\\n\\t\\t\\t\\t\\treturn;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tif (password.equals(psd)) {\\r\\n\\t\\t\\t\\t\\tavatorPop.dismiss();\\r\\n\\t\\t\\t\\t\\tintentAction(getActivity(), GesturePsdActivity.class);\\r\\n\\r\\n\\t\\t\\t\\t} else {\\r\\n\\t\\t\\t\\t\\tShowToast(\\\"输入密码错误！\\\");\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t});\\r\\n\\r\\n\\t\\tbt_cancel.setOnClickListener(new OnClickListener() {\\r\\n\\r\\n\\t\\t\\t@Override\\r\\n\\t\\t\\tpublic void onClick(View v) {\\r\\n\\t\\t\\t\\t// TODO Auto-generated method stub\\r\\n\\t\\t\\t\\tavatorPop.dismiss();\\r\\n\\t\\t\\t}\\r\\n\\t\\t});\\r\\n\\t}\",\n \"public void onClick(DialogInterface dialogBox, int id) {\\n String user = userInputDialogEditText.getText().toString();\\n if (Util.ONLINE) {\\n if (user.equalsIgnoreCase(name)) {\\n\\n completeBatch();\\n\\n } else {\\n dialogBox.cancel();\\n showMessage(\\\"VALIDATION ERROR\\\", \\\"TAGID DOES NOT MATCH\\\");\\n }\\n } else {\\n boolean b = db.checkUserdropdown(user, user);\\n if (b == true) {\\n completeBatch();\\n } else {\\n dialogBox.cancel();\\n showMessage(\\\"VALIDATION ERROR\\\", \\\"TAGID DOES NOT MATCH\\\");\\n }\\n }\\n }\",\n \"public RegisterUserDialog(Admin admin) { \\n\\t\\tthis.admin = admin;\\n\\t\\tUserDialog dialog = new UserDialog(this);\\n\\t\\tsetLayout(new FlowLayout()); \\n\\t\\tpack();\\n\\t\\t// Set window location in middle of screen\\n\\t\\tdialog.setLocationRelativeTo(null);\\n\\t\\t// Display window\\n\\t\\tdialog.setVisible(true);\\n\\t }\",\n \"private void showAlert() {\\n AlertDialog.Builder alert = new AlertDialog.Builder(this);\\n alert.setMessage(\\\"Error al autenticar usuario\\\");\\n alert.setPositiveButton(\\\"Aceptar\\\", null);\\n AlertDialog pop = alert.create();\\n alert.show();\\n }\",\n \"@Override\\n public void onComplete(@NonNull Task<Void> task) {\\n if(task.isSuccessful()){\\n Toast.makeText(getBaseContext(), \\\"New contact \\\" + addMe.getDisplayName() + \\\" created!\\\", Toast.LENGTH_LONG).show();\\n\\n //Go to home page\\n finish();\\n }\\n else {\\n Toast.makeText(getBaseContext(), \\\"Unable to add \\\" + addMe.getDisplayName() + \\\" contact\\\", Toast.LENGTH_LONG).show();\\n }\\n }\",\n \"private void dialogshow(String title, String msg) {\\n\\n AlertDialog.Builder builder =\\n new AlertDialog.Builder(this, R.style.AppCompatAlertDialogStyle);\\n builder.setTitle(title);\\n builder.setMessage(msg);\\n builder.setCancelable(false);\\n builder.setPositiveButton(R.string.ok, new DialogInterface.OnClickListener() {\\n\\n @Override\\n public void onClick(DialogInterface dialog, int which) {\\n if (acc1.equals(\\\"no\\\")) {\\n// sendacktorider();\\n Intent fare = new Intent(SlideMainActivity.this, SlideMainActivity.class);\\n fare.putExtra(\\\"userid\\\", User_id);\\n fare.putExtra(\\\"fbuserproimg\\\", fbuserproimg);\\n fare.putExtra(\\\"whologin\\\", WhoLogin);\\n fare.putExtra(\\\"password\\\", checkpassword);\\n startActivity(fare);\\n finish();\\n }\\n dialog.cancel();\\n }\\n });\\n\\n builder.show();\\n\\n }\",\n \"@Override\\n\\t\\t\\t\\t\\t\\tpublic void onClick(DialogInterface dialog, int which) {\\n\\t\\t\\t\\t\\t\\t\\taddMember();\\n\\t\\t\\t\\t\\t\\t}\",\n \"@Override\\n public void onClick(View view) {\\n if (mAddDialog == null) {\\n mAddDialog = new XPopup.Builder(MainActivity.this)\\n .asInputConfirm(getString(R.string.add_random_title)\\n , getString(R.string.add_random_content)\\n , new OnInputConfirmListener() {\\n @Override\\n public void onConfirm(String text) {\\n if (mAdapter != null) {\\n mAdapter.addData(new BaseModel(text, 1));\\n }\\n }\\n }).show();\\n } else {\\n mAddDialog.show();\\n }\\n }\",\n \"private void SendUserToInfoPage(){\\n Intent intent = new Intent(sign_up_activity.this,user_info_activity.class);\\n intent.setFlags(Intent.FLAG_ACTIVITY_NEW_TASK|Intent.FLAG_ACTIVITY_CLEAR_TASK);\\n overridePendingTransition(0,0);\\n startActivity(intent);\\n finish();\\n }\",\n \"@Override\\n public Dialog onCreateDialog(Bundle savedInstanceState) {\\n AlertDialog.Builder builder = new AlertDialog.Builder(getActivity());\\n String mess = \\\"The user your trying to connect to does not have a name set\\\";\\n if(getArguments().getBoolean(\\\"me\\\"))\\n {\\n mess = \\\"Someone tried to connect to you for a game but you dont have a name set\\\";\\n }\\n builder.setMessage(mess)\\n .setPositiveButton(\\\"Ok\\\", new DialogInterface.OnClickListener() {\\n public void onClick(DialogInterface dialog, int id) {\\n // FIRE ZE MISSILES!\\n }\\n });\\n // Create the AlertDialog object and return it\\n return builder.create();\\n }\",\n \"public void actionPerformed(ActionEvent e) {\\n \\tif(e.getActionCommand()==\\\"Home\\\")\\n \\t\\tfireEvent(e.getActionCommand());\\n \\telse if(e.getActionCommand()==\\\"Create\\\"){\\n \\t\\tcheckFields();\\n \\t\\tif(createInputOK==true){\\n\\t \\t\\ttry{\\n\\t\\t \\t\\t//TODO put in error checking \\n\\t\\t \\t\\t//insertDB(); insert into books table\\n\\t\\t \\t\\tDBConnect.insertDB(\\\"users (username,passw,email,books,students)\\\",\\n\\t\\t \\t\\t\\t\\t\\\"('\\\"+userNameTxFld.getText()+\\\"','\\\"+ encryptedPassW+\\\"','\\\"+\\n\\t\\t \\t\\teMailTxFld.getText()+\\\"','\\\"+ \\\"\\\"+\\\"','\\\"+ \\\"\\\"+\\\"')\\\");\\t\\t\\n\\t\\t \\t\\t//DBConnect.updateDB(\\\"users\\\", \\\"users=CONCAT(user,'\\\"+id+\\\" ')\\\",\\\"usersid=\\\"+Globals.userid);\\n\\t\\t \\t\\t//System.out.println(id+\\\"\\\\n\\\"+titleTxfld.getText());\\n\\t\\t \\t\\t//http://docs.oracle.com/javase/tutorial/uiswing/components/dialog.html <-popup message\\n\\t\\t \\t\\t//popup message saying book added \\n\\t\\t \\t\\tJOptionPane.showMessageDialog(BookCheckWindow.frame, userNameTxFld.getText()+\\\" Has Been Created. Click Cancel to Log-In\\\");\\n\\t\\t \\tcreateInputOK=false;\\n\\t\\t \\tcreateUserOK=true;\\n\\t \\t\\t}\\n\\t \\t\\tcatch(Exception ex){\\n\\t \\t\\t\\t\\n\\t \\t\\t}\\n \\t\\t}\\n \\t}\\n }\",\n \"public void createUser() {\\r\\n\\t\\tif(validateUser()) {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tcdb=new Connectiondb();\\r\\n\\t\\t\\tcon=cdb.createConnection();\\r\\n\\t\\t\\ttry {\\r\\n\\t\\t\\t\\tps=con.prepareStatement(\\\"INSERT INTO t_user (nom,prenom,userName,pass,tel,type,status) values(?,?,?,?,?,?,?)\\\");\\r\\n\\t\\t\\t\\tps.setString(1, this.getNom());\\r\\n\\t\\t\\t\\tps.setString(2, this.getPrenom());\\r\\n\\t\\t\\t\\tps.setString(3, this.getUserName());\\r\\n\\t\\t\\t\\tps.setString(4, this.getPassword());\\r\\n\\t\\t\\t\\tps.setInt(5, Integer.parseInt(this.getTel().trim()));\\r\\n\\t\\t\\t\\tps.setString(6, this.getType());\\r\\n\\t\\t\\t\\tps.setBoolean(7, true);\\r\\n\\t\\t\\t\\tps.executeUpdate();\\r\\n\\t\\t\\t\\tnew Message().error(\\\"Fin d'ajout d'utilisateur\\\");\\r\\n\\t\\t\\t} catch (SQLException e) {\\r\\n\\t\\t\\t\\tnew Message().error(\\\"Echec d'ajout d'utilisateur\\\");\\r\\n\\t\\t\\t\\te.printStackTrace();\\r\\n\\t\\t\\t}finally {\\r\\n\\t\\t\\t\\tcdb.closePrepareStatement(ps);\\r\\n\\t\\t\\t\\tcdb.closeConnection(con);\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t}\",\n \"public void addUser() {\\n\\t\\tUser user = dataManager.findCurrentUser();\\r\\n\\t\\tif (user != null) {\\r\\n\\t\\t\\tframeManager.addUser(user);\\r\\n\\t\\t\\tpesquisar();\\r\\n\\t\\t} else {\\r\\n\\t\\t\\tAlertUtils.alertSemPrivelegio();\\r\\n\\t\\t}\\r\\n\\t}\",\n \"@FXML protected void handleSignUpButtonAction() {\\n \\tboolean bexit = false;\\n \\tif(passwordField.getText().equals(passwordField2.getText()))\\n \\t{\\n \\t\\t\\n \\t\\tString signUpUsername = username.getText();\\n \\t\\tString signUpPassword = passwordField.getText();\\n \\t\\t\\n if(username.getText().toString().length() >= 6 && passwordField.getText().toString().length() >= 6)\\n {\\n\\t \\t\\tUser user = new User(signUpUsername, \\\"Unknown\\\", null, \\\"Unknown\\\", signUpPassword);\\n\\t \\t\\t\\n\\t \\t\\ttry {\\n\\t\\t\\t\\t\\tuser = client.createUser(user);\\n\\t \\t\\t\\n\\t \\t\\t} catch (WebApplicationException e) {\\n\\t \\t\\t\\tLOGGER.log(Level.SEVERE, e.toString(), e);\\n\\t \\t\\t\\tif (e.getResponse().getStatus() == 409) {\\n\\t \\t\\t\\t\\tactiontarget.setText(\\\"Sign up error: Username already exists\\\");\\n\\t \\t\\t\\t} else {\\n\\t \\t\\t\\t\\t\\n\\t \\t\\t\\t}\\n\\t \\t\\t\\t\\n\\t \\t\\t} catch (JsonProcessingException e) {\\n\\t \\t\\t\\tLOGGER.log(Level.SEVERE, e.toString(), e);\\n\\t\\n\\t\\t\\t\\t} catch (Exception e) {\\n\\t\\t\\t\\t\\tLOGGER.log(Level.SEVERE, e.toString(), e);\\n\\t\\t\\t\\t}\\n\\t \\t\\t\\n\\t \\t\\t// Go back to Login view\\n\\t \\t\\t\\n\\t \\t\\tLoginVistaNavigator.loadVista(LoginVistaNavigator.LOGIN);\\n }\\n else\\n {\\n \\tactiontarget.setText(\\\"username/password \\\\nlength must be 6 number\\\");\\n }\\n \\t}\\n \\telse\\n \\t{\\n \\t\\tactiontarget.setText(\\\"password not consistent.\\\");\\n \\t}\\n }\",\n \"private void errorPopUp() {\\n new AlertDialog.Builder(mActivity)\\n .setTitle(\\\"Oops\\\")\\n .setMessage(\\\"Please choose an emotional state or enter a date and time\\\")\\n .setPositiveButton(\\\"Ok\\\", new DialogInterface.OnClickListener() {\\n @Override\\n public void onClick(DialogInterface dialogInterface, int i) {\\n //Go back without changing anything\\n dialogInterface.dismiss();\\n }\\n })\\n .create()\\n .show();\\n }\",\n \"U getCreateby();\",\n \"public void doPositiveClick() {\\n\\t\\t//Shows message that contact added to database. \\n\\t\\tToast.makeText(this, \\\"Контакт сохранен\\\", Toast.LENGTH_SHORT).show();\\n\\t\\taddRecord();\\n\\t}\",\n \"public void messageToUser() {\\n // show a message dialog - the message is an error message.\\n JOptionPane.showMessageDialog(new JFrame(),\\n \\\"You are missing some parameters in the level definitions, Please check it\\\", \\\"Error!\\\",\\n JOptionPane.ERROR_MESSAGE);\\n // exit the program\\n System.exit(0);\\n }\",\n \"@FXML\\r\\n\\tvoid openCreateUser(ActionEvent event) {\\r\\n\\t\\tParent root = null;\\r\\n\\t\\tnewWindow = new Stage();\\r\\n\\t\\ttry {\\r\\n\\t\\t\\troot = FXMLLoader.load(getClass().getResource(\\\"3.1-AddISUsersScreen.fxml\\\"));\\r\\n\\t\\t} catch (IOException e) {\\r\\n\\r\\n\\t\\t\\te.printStackTrace();\\r\\n\\t\\t}\\r\\n\\t\\tISUsers = new Scene(root);\\r\\n\\t\\tnewWindow.setTitle(\\\"Create IS User\\\");\\r\\n\\t\\tnewWindow.setScene(ISUsers);\\r\\n\\t\\tnewWindow.setResizable(false);\\r\\n\\t\\tnewWindow.initOwner((Stage) ((Node) event.getSource()).getScene().getWindow());\\r\\n\\t\\tnewWindow.initModality(Modality.WINDOW_MODAL);\\r\\n\\t\\tnewWindow.show();\\r\\n\\t}\",\n \"@Test (priority = 1)\\n\\tpublic void TC1_CheckCreateNewuser_Exists ()\\n\\n\\t{\\n\\t\\tCreateUserPage UserObj = new CreateUserPage (driver);\\n\\n\\t\\t// This is to Validate If Create user button exists to Create a new User\\n\\t\\tUserObj.Validate_CreateUserButton_Exsist();\\n\\n\\t}\",\n \"public AlertDialog createSimpleDialog(String mensaje, String titulo, final String typ) {\\n final AlertDialog.Builder builder = new AlertDialog.Builder(getActivity());\\n\\n LayoutInflater inflater = getActivity().getLayoutInflater();\\n\\n View v = inflater.inflate(R.layout.dialog_monitoring_info, null);\\n builder.setView(v);\\n\\n TextView tvTitle = (TextView) v.findViewById(R.id.tv_title_dialog);\\n TextView tvDescription = (TextView) v.findViewById(R.id.tv_description_dialog);\\n\\n tvTitle.setText(titulo);\\n tvTitle.setCompoundDrawables(ContextCompat.getDrawable(v.getContext(), R.drawable.ic_question), null, null, null);\\n tvDescription.setText(mensaje);\\n\\n builder.setPositiveButton(getResources().getString(R.string.info_dialog_option_accept),\\n new DialogInterface.OnClickListener() {\\n @Override\\n public void onClick(DialogInterface dialog, int which) {\\n new Handler().postDelayed(new Runnable() {\\n @Override\\n public void run() {\\n if (typ.equals(\\\"REGIST\\\")){\\n MonitoringRegistrationFormFragment fragment = new MonitoringRegistrationFormFragment();\\n Bundle params = new Bundle();\\n params.putString(\\\"AREA\\\", area);\\n params.putString(\\\"OPCION\\\", \\\"N\\\");\\n fragment.setArguments(params);\\n\\n getActivity().getSupportFragmentManager().popBackStack(null, FragmentManager.POP_BACK_STACK_INCLUSIVE);\\n\\n getActivity().getSupportFragmentManager().beginTransaction()\\n .replace(R.id.monitoring_principal_context, fragment)\\n .commit();\\n }\\n else {\\n AdminUserFormFragment fragment = new AdminUserFormFragment();\\n getActivity().getSupportFragmentManager().popBackStack(null, FragmentManager.POP_BACK_STACK_INCLUSIVE);\\n getActivity().getSupportFragmentManager().beginTransaction()\\n .replace(R.id.transaction_principal_context, fragment)\\n .commit();\\n }\\n }\\n },300);\\n }\\n })\\n .setNegativeButton(getResources().getString(R.string.info_dialog_option_cancel),\\n new DialogInterface.OnClickListener() {\\n @Override\\n public void onClick(DialogInterface dialog, int which) {\\n builder.create().dismiss();\\n if (typ.equals(\\\"REGIST\\\")){\\n new Handler().postDelayed(new Runnable() {\\n @Override\\n public void run() {\\n Intent intent = new Intent(getActivity(), MonitorMenuActivity.class);\\n intent.setFlags(Intent.FLAG_ACTIVITY_CLEAR_TOP | Intent.FLAG_ACTIVITY_SINGLE_TOP);\\n startActivity(intent);\\n getActivity().finish();\\n }\\n },300);\\n }\\n else {\\n getActivity().finish();\\n }\\n }\\n });\\n\\n return builder.create();\\n }\",\n \"Boolean registerNewUser(User user);\",\n \"@Override\\n public void onClick(View v) {\\n ParseUser currentUser = ParseUser.getCurrentUser();\\n String currentUserUsername = currentUser.getUsername();\\n\\n\\n //get the status user has enteretd, conver it to a string\\n String newStatus = UsertxtFieldmsg.getText().toString();\\n\\n //Save the status in parse\\n ParseObject statusObject = new ParseObject(\\\"Messages\\\");\\n statusObject.put(\\\"Message\\\",newStatus);\\n statusObject.put(\\\"user\\\", currentUserUsername);\\n statusObject.saveInBackground(new SaveCallback() {\\n @Override\\n public void done(ParseException e) {\\n if(e == null){\\n //succesfully stored the new status in parse\\n Toast.makeText(User_SendMessage.this, \\\"Message Sent!\\\", Toast.LENGTH_LONG).show();\\n\\n //take user home\\n Intent takeUserHome =new Intent(User_SendMessage.this, UserActivityPage.class);\\n startActivity(takeUserHome);\\n\\n\\n }else{\\n //there was a problem storn new status, advice user\\n AlertDialog.Builder builder = new AlertDialog.Builder(User_SendMessage.this);\\n builder.setMessage(e.getMessage());\\n builder.setTitle(\\\"Sorry\\\");\\n builder.setPositiveButton(\\\"Ok\\\", new DialogInterface.OnClickListener() {\\n @Override\\n public void onClick(DialogInterface dialogInterface, int i) {\\n dialogInterface.dismiss();\\n }\\n });\\n AlertDialog dialog = builder.create();\\n dialog.show();\\n }\\n }\\n });\\n\\n }\",\n \"public void showPopUp(View view) {\\n\\n menuDialog.setContentView(R.layout.menupopup);\\n menuDialog.getWindow().setBackgroundDrawable(new ColorDrawable(Color.TRANSPARENT));\\n\\n TextView txtUserName = (TextView) menuDialog.getWindow().findViewById(R.id.textview_UserName);\\n txtUserName.setText(userName);\\n // Download User Image from Firebase and show it to User.\\n\\n final long ONE_MEGABYTE = 1024 * 1024;\\n downloadImageStorageReference.getBytes(ONE_MEGABYTE).addOnSuccessListener(new OnSuccessListener<byte[]>() {\\n @Override\\n public void onSuccess(byte[] bytes) {\\n bitmap = BitmapFactory.decodeByteArray(bytes, 0, bytes.length);\\n imageView_UserPhoto.setImageBitmap(bitmap);\\n }\\n });\\n imageView_UserPhoto = menuDialog.getWindow().findViewById(R.id.imageview_UserImage);\\n\\n if(bitmap != null) {\\n imageView_UserPhoto.setImageBitmap(bitmap);\\n }else {\\n imageView_UserPhoto.setImageResource(R.drawable.userimage_default);\\n }\\n\\n\\n menuDialog.show();\\n }\",\n \"public void actionPerformed(ActionEvent arg0) {\\n\\t\\t\\t\\tnew UserData(Username,true,\\\"Verification\\\");\\n\\t\\t\\t}\",\n \"public void popUpEmptyTextView() {\\n final Intent intent = new Intent(this, AddUserDetailsActivity.class);\\n AlertDialog alertDialog = new AlertDialog.Builder(AddUserDetailsActivity.this).create();\\n alertDialog.setTitle(\\\"ERROR\\\");\\n alertDialog.setMessage(\\\"One of the fields have been left empty, please try again.\\\"\\n );\\n alertDialog.setButton(AlertDialog.BUTTON_NEUTRAL, \\\"OK\\\",\\n new DialogInterface.OnClickListener() {\\n public void onClick(DialogInterface dialog, int which) {\\n dialog.dismiss();\\n //Intent intent = new Intent(this, AddUserDetailsActivity.class);\\n startActivity(intent);\\n finish();\\n\\n }\\n });\\n alertDialog.show();\\n }\",\n \"public void showSucceedDeleteDialog() {\\n\\t\\tString msg = getApplicationContext().getResources().getString(\\n\\t\\t\\t\\tR.string.MSG_DLG_LABEL_DELETE_ITEM_SUCCESS);\\n\\t\\tfinal AlertDialog.Builder alertDialogBuilder = new AlertDialog.Builder(\\n\\t\\t\\t\\tthis);\\n\\t\\talertDialogBuilder\\n\\t\\t\\t\\t.setMessage(msg)\\n\\t\\t\\t\\t.setCancelable(false)\\n\\t\\t\\t\\t.setPositiveButton(\\n\\t\\t\\t\\t\\t\\tgetApplicationContext().getResources().getString(\\n\\t\\t\\t\\t\\t\\t\\t\\tR.string.MSG_DLG_LABEL_OK),\\n\\t\\t\\t\\t\\t\\tnew DialogInterface.OnClickListener() {\\n\\t\\t\\t\\t\\t\\t\\tpublic void onClick(DialogInterface dialog, int id) {\\n\\t\\t\\t\\t\\t\\t\\t\\tfinish();\\n\\t\\t\\t\\t\\t\\t\\t\\tstartActivity(getIntent());\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t});\\n\\t\\tAlertDialog alertDialog = alertDialogBuilder.create();\\n\\t\\talertDialog.show();\\n\\n\\t}\",\n \"private void submitForm() {\\n final Dialog dialog = new Dialog(context);\\n\\t\\t dialog.setContentView(R.layout.dialogbox);\\n\\t\\t dialog.setTitle(\\\"Sucess!\\\");\\n\\t\\t dialog.setCancelable(false);\\n\\t dialog.setCanceledOnTouchOutside(false);\\n\\t\\t TextView txt = (TextView) dialog.findViewById(R.id.errorlog);\\n\\t\\t txt.setText(\\\"Registration Successfull.\\\");\\n\\t\\t Button dialogButton = (Button) dialog.findViewById(R.id.release);\\n\\t\\t dialogButton.setOnClickListener(new OnClickListener() {\\n\\t\\t\\t public void onClick(View vd) {\\n\\t\\t\\t\\t change.setEnabled(true);\\n\\t\\t\\t\\t dialog.dismiss();\\n\\t\\t\\n\\t\\t}\\n\\t\\t});\\n\\t\\t dialog.show();\\n}\",\n \"private void addUser() {\\n\\t\\t//check for the user limit, and if it is reached, return an error.\\n\\t\\tif(!(users[users.length-1].equals(\\\"\\\"))) {\\n\\t\\t\\terror(USER_LIMIT_REACHED);\\n\\t\\t\\tProgramGUI.this.dispose();\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tProgramGUI.this.dispose();\\n\\t\\t\\tindex = nextUserIndex();\\n\\t\\t\\tframe = new JFrame(\\\"Adding user #\\\" + (index+1));\\n\\t\\t\\tframe.setSize(FRAME_WIDTH, FRAME_HEIGHT);\\n\\t\\t\\tframe.setLocationRelativeTo(null);\\n\\t\\t\\tframe.setDefaultCloseOperation(EXIT_ON_CLOSE);\\n\\t\\t\\tJPanel panel = new JPanel();\\n\\t\\t\\tpanel.setLayout(new GridLayout(2, 2));\\n\\t\\t\\tpanel.setBorder(BorderFactory.createEmptyBorder(10,10,0,10));\\n\\t\\t\\tpanel.add(new JLabel(\\\"Enter Username: \\\"));\\n\\t\\t\\tuser = new JTextField();\\n\\t\\t\\tpanel.add(user);\\n\\t\\t\\tpanel.add(new JLabel(\\\"Enter Password: \\\"));\\n\\t\\t\\tpass = new JPasswordField();\\n\\t\\t\\tpanel.add(pass);\\n\\t\\t\\tframe.add(panel, BorderLayout.NORTH);\\n\\t\\t\\tJPanel button = new JPanel();\\n\\t\\t\\tJButton ok = new JButton(\\\"Confirm User\\\");\\n\\t\\t\\tok.addActionListener(new AddListener());\\n\\t\\t\\tJButton cancel = new JButton(\\\"Cancel\\\");\\n\\t\\t\\tcancel.addActionListener(new ButtonListener());\\n\\t\\t\\tbutton.add(ok);\\n\\t\\t\\tbutton.add(cancel);\\n\\t\\t\\tframe.add(button, BorderLayout.SOUTH);\\n\\t\\t\\tframe.setVisible(true);\\n\\t\\t}\\n\\t}\",\n \"public int signUp(String email_address, String email_password, String first_name, String last_name)\\r\\n\\t{\\r\\n\\t\\ttry \\r\\n\\t\\t{\\r\\n\\t\\t\\tString query = \\\"insert into users values (?, ?, ?, ?)\\\";\\r\\n\\t\\t\\tpreparedStatement = connect.prepareStatement(query);\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t/*\\r\\n\\t\\t\\t * variables here replaces the question marks in the query\\r\\n\\t\\t\\t * the numbers before the variables denote what question mark is the variable supposed to replace\\r\\n\\t\\t\\t * the numbers start at 1 compared to starting at 0\\r\\n\\t\\t\\t */\\r\\n\\t\\t\\tpreparedStatement.setString(1, email_address);\\r\\n\\t\\t\\tpreparedStatement.setString(2, email_password);\\r\\n\\t\\t\\tpreparedStatement.setString(3, first_name);\\r\\n\\t\\t\\tpreparedStatement.setString(4, last_name);\\r\\n\\t\\t\\tpreparedStatement.execute();\\t//execute the query above\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t/*\\r\\n\\t\\t\\t * Created an object array which only contains the value of the button to be used in the popup message\\r\\n\\t\\t\\t * the popup message displays upon successfully registering a user\\r\\n\\t\\t\\t */\\r\\n\\t\\t\\tObject[] options = {\\\"OK\\\"};\\r\\n\\t\\t\\tint temp = JOptionPane.showOptionDialog(null, \\\"You are now registered\\\", \\\"Registration\\\", JOptionPane.OK_OPTION, JOptionPane.INFORMATION_MESSAGE, null, options, options[0]);\\r\\n\\t\\t\\treturn temp;\\r\\n\\t\\t} \\r\\n\\t\\tcatch (Exception e) \\r\\n\\t\\t{\\r\\n\\t\\t\\te.printStackTrace();\\r\\n\\t\\t}\\r\\n\\t\\treturn 0;\\r\\n\\t}\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.70166063","0.70100826","0.6981803","0.6882953","0.67817676","0.6726923","0.6687639","0.6534396","0.6522465","0.6500911","0.64799035","0.63699734","0.6345562","0.6343042","0.6296517","0.6294918","0.62794435","0.62202984","0.6218993","0.6203364","0.6199081","0.61815685","0.6180578","0.6163203","0.616252","0.6153769","0.6134381","0.61107254","0.6108778","0.61054903","0.61001295","0.6086602","0.607427","0.6066896","0.6058779","0.6042612","0.6033202","0.60308444","0.6027945","0.60266227","0.60265106","0.60257703","0.60224545","0.6022154","0.60171616","0.601565","0.60104614","0.60007966","0.5999841","0.59895426","0.59870213","0.59843886","0.59832346","0.5972352","0.59647334","0.5956678","0.59482783","0.5945414","0.59402305","0.593465","0.59282935","0.5927747","0.5921317","0.5921071","0.5916537","0.5903829","0.5903585","0.58996874","0.5898772","0.5882493","0.5882033","0.5878653","0.5877801","0.5874144","0.5868435","0.58668655","0.58653075","0.58583254","0.585659","0.5852448","0.5846275","0.5843817","0.58433414","0.58231634","0.5814852","0.5814411","0.58137083","0.58072805","0.58068085","0.5803078","0.5801892","0.5798378","0.5797939","0.5791452","0.57914233","0.5786425","0.5786364","0.5781356","0.57764125","0.5775914"],"string":"[\n \"0.70166063\",\n \"0.70100826\",\n \"0.6981803\",\n \"0.6882953\",\n \"0.67817676\",\n \"0.6726923\",\n \"0.6687639\",\n \"0.6534396\",\n \"0.6522465\",\n \"0.6500911\",\n \"0.64799035\",\n \"0.63699734\",\n \"0.6345562\",\n \"0.6343042\",\n \"0.6296517\",\n \"0.6294918\",\n \"0.62794435\",\n \"0.62202984\",\n \"0.6218993\",\n \"0.6203364\",\n \"0.6199081\",\n \"0.61815685\",\n \"0.6180578\",\n \"0.6163203\",\n \"0.616252\",\n \"0.6153769\",\n \"0.6134381\",\n \"0.61107254\",\n \"0.6108778\",\n \"0.61054903\",\n \"0.61001295\",\n \"0.6086602\",\n \"0.607427\",\n \"0.6066896\",\n \"0.6058779\",\n \"0.6042612\",\n \"0.6033202\",\n \"0.60308444\",\n \"0.6027945\",\n \"0.60266227\",\n \"0.60265106\",\n \"0.60257703\",\n \"0.60224545\",\n \"0.6022154\",\n \"0.60171616\",\n \"0.601565\",\n \"0.60104614\",\n \"0.60007966\",\n \"0.5999841\",\n \"0.59895426\",\n \"0.59870213\",\n \"0.59843886\",\n \"0.59832346\",\n \"0.5972352\",\n \"0.59647334\",\n \"0.5956678\",\n \"0.59482783\",\n \"0.5945414\",\n \"0.59402305\",\n \"0.593465\",\n \"0.59282935\",\n \"0.5927747\",\n \"0.5921317\",\n \"0.5921071\",\n \"0.5916537\",\n \"0.5903829\",\n \"0.5903585\",\n \"0.58996874\",\n \"0.5898772\",\n \"0.5882493\",\n \"0.5882033\",\n \"0.5878653\",\n \"0.5877801\",\n \"0.5874144\",\n \"0.5868435\",\n \"0.58668655\",\n \"0.58653075\",\n \"0.58583254\",\n \"0.585659\",\n \"0.5852448\",\n \"0.5846275\",\n \"0.5843817\",\n \"0.58433414\",\n \"0.58231634\",\n \"0.5814852\",\n \"0.5814411\",\n \"0.58137083\",\n \"0.58072805\",\n \"0.58068085\",\n \"0.5803078\",\n \"0.5801892\",\n \"0.5798378\",\n \"0.5797939\",\n \"0.5791452\",\n \"0.57914233\",\n \"0.5786425\",\n \"0.5786364\",\n \"0.5781356\",\n \"0.57764125\",\n \"0.5775914\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.66480416"},"document_rank":{"kind":"string","value":"7"}}},{"rowIdx":38198,"cells":{"query":{"kind":"string","value":"activates the search dialog by calling onSearchRequested()."},"document":{"kind":"string","value":"@Override\n public boolean onSearchRequested() {\n return super.onSearchRequested();\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 showSearch() {\n\t\tonSearchRequested();\n\t}","@Override\n\tpublic boolean onSearchRequested () {\n\t\tif (!searchMode)\n\t\t\ttoggleSearch();\n\t\treturn true;\n\t}","@Override\n\tpublic boolean onSearchRequested()\n\t{\n \tstartSearch(getCurSearch(), true, null, false);\n \treturn true;\n\t}","void requestSearchViewFocus();","protected void showSearch() {\n \t\tIntent search = new Intent(this, SearchActivity.class);\t\t\t\t\n \t\tthis.startActivity(search);\n \t}","public void onSearchStarted() {\n mActivity.invalidateOptionsMenu();\n }","@Override\n public void onSearchOpened() {\n }","@Override\n public void onSearchOpened() {\n }","@Override\n public void onSearchOpened() {\n }","private void executeSearch() {\n if (!view.getSearchContent().getText().isEmpty()) {\n SearchModuleDataHolder filter = SearchModuleDataHolder.getSearchModuleDataHolder();\n //set search content text for full text search\n filter.setSearchText(view.getSearchContent().getText());\n forwardToCurrentView(filter);\n } else {\n eventBus.showPopupNoSearchCriteria();\n }\n }","private void search()\n {\n JTextField searchField = (currentSearchView.equals(SEARCH_PANE_VIEW))? searchBar : resultsSearchBar;\n String searchTerm = searchField.getText();\n \n showTransition(2000);\n \n currentPage = 1;\n showResultsView(true);\n paginate(1, getResultsPerPage());\n\n if(searchWeb) showResultsTableView(WEB_RESULTS_PANE);\n else showResultsTableView(IMAGE_RESULTS_PANE);\n\n \n showSearchView(RESULTS_PANE_VIEW);\n resultsSearchBar.setText(searchTerm);\n }","public void onSearchStarted();","@Override\n public void onSearchOpened() {\n Log.v(\"SearchBox\", \"onSearchOpened()\");\n }","@Override\n public void onSearchConfirmed(CharSequence text) {\n startSearch(text);\n }","@Override\n public void onSearchConfirmed(CharSequence text) {\n startSearch(text);\n\n }","private void openSearch() {\n\t\tString message = \"This would be search.\";\r\n\t\tIntent intent = new Intent(this, DisplayMessageActivity.class);\r\n\t\tintent.putExtra(EXTRA_MESSAGE, message);\r\n\t\tstartActivity(intent);\r\n\t}","@Override\n public boolean onSearchRequested() {\n return !isSearchResultView && super.onSearchRequested();\n }","public void onGoToAdvancedSearch() {\n eventBus.showAdvanceSearchPopup(newAttributeSearchWidget);\n }","@Override\n public void onSearchConfirmed(CharSequence text) {\n startSearch(text);\n\n }","@Override\n public void onSearchConfirmed(CharSequence text) {\n startSearch(text);\n\n }","private void readyToSearch() {\n Intent intent = new Intent(this, SearchActivity.class);\n startActivityForResult(intent, 21);\n }","public boolean openSearch(){\n return true;\n }","private void showSearchDialog() {\n\t\tSearchDialog searchDialog = new SearchDialog(lastText);\n\t\tsearchDialog.show(getSupportFragmentManager(), \"fragment_search_keyword\");\n\t}","public void enterSearchMode(String initialQueryTerm) {\n initSearchViews();\n if (isInSearchMode()) {\n return;\n }\n if (!TextUtils.isEmpty(initialQueryTerm)) {\n mSearchView.setQuery(initialQueryTerm, false);\n } else {\n mSearchView.setQuery(\"\", false);\n }\n mSearchView.setQueryHint(mCallback.getSearchHint());\n\n mSearchMode = MODE_SEARCH;\n\n // Focus on the search input box and throw up the IME if specified.\n // TODO: HACK. this is a workaround IME not popping up.\n mSearchView.setIconified(false);\n\n refresh();\n mCallback.onSearchStarted();\n }","void searchUI();","@Override\n public void onSearchConfirmed(CharSequence text) {\n startSearchResults(text);\n }","public void performSearch() {\n History.newItem(MyWebApp.SEARCH_RESULTS);\n getMessagePanel().clear();\n if (keywordsTextBox.getValue().isEmpty()) {\n getMessagePanel().displayMessage(\"Search term is required.\");\n return;\n }\n mywebapp.getResultsPanel().resetSearchParameters();\n //keyword search does not restrict to spots\n mywebapp.addCurrentLocation();\n if (markFilterCheckbox != null) {\n mywebapp.getResultsPanel().getSearchParameters().setLicensePlate(markFilterCheckbox.getValue());\n }\n if (contestFilterCheckbox != null) {\n mywebapp.getResultsPanel().getSearchParameters().setContests(contestFilterCheckbox.getValue());\n }\n if (geoFilterCheckbox != null) {\n mywebapp.getResultsPanel().getSearchParameters().setGeospatialOff(!geoFilterCheckbox.getValue());\n }\n if (plateFilterCheckbox != null) {\n mywebapp.getResultsPanel().getSearchParameters().setLicensePlate(plateFilterCheckbox.getValue());\n }\n if (spotFilterCheckbox != null) {\n mywebapp.getResultsPanel().getSearchParameters().setSpots(spotFilterCheckbox.getValue());\n }\n String color = getValue(colorsListBox);\n mywebapp.getResultsPanel().getSearchParameters().setColor(color);\n String manufacturer = getValue(manufacturersListBox);\n if (manufacturer != null) {\n Long id = new Long(manufacturer);\n mywebapp.getResultsPanel().getSearchParameters().setManufacturerId(id);\n }\n String vehicleType = getValue(vehicleTypeListBox);\n mywebapp.getResultsPanel().getSearchParameters().setVehicleType(vehicleType);\n// for (TagHolder tagHolder : tagHolders) {\n// mywebapp.getResultsPanel().getSearchParameters().getTags().add(tagHolder);\n// }\n mywebapp.getResultsPanel().getSearchParameters().setKeywords(keywordsTextBox.getValue());\n mywebapp.getMessagePanel().clear();\n mywebapp.getResultsPanel().performSearch();\n mywebapp.getTopMenuPanel().setTitleBar(\"Search\");\n //mywebapp.getResultsPanel().setImageResources(resources.search(), resources.searchMobile());\n }","@FXML\n private void btnSearchClick() {\n\n // Check if search field isn't empty\n if (!txtSearch.getText().equals(\"\")) {\n\n // Display the progress indicator\n resultsProgressIndicator.setVisible(true);\n\n // Get query results\n MovieAPIImpl movieAPIImpl = new MovieAPIImpl();\n movieAPIImpl.getMovieList(Constants.SERVICE_API_KEY, txtSearch.getText(), this);\n }\n }","private void performSearch() {\n try {\n final String searchVal = mSearchField.getText().toString().trim();\n\n if (searchVal.trim().equals(\"\")) {\n showNoStocksFoundDialog();\n }\n else {\n showProgressDialog();\n sendSearchResultIntent(searchVal);\n }\n }\n catch (final Exception e) {\n showSearchErrorDialog();\n logError(e);\n }\n }","public void onClickSearch (View v)\n\t{\n\t\tstartActivity (new Intent(getApplicationContext(), SearchActivity.class));\n\t}","@Override\n public boolean onCreateOptionsMenu(Menu menu) {\n // Inflate the options menu from XML\n MenuInflater inflater = getMenuInflater();\n inflater.inflate(R.menu.options_menu, menu);\n\n // Todo(32) gather all search view code in one place\n\n // further code, initializes SearchView menu item:\n // Get the SearchView and set the searchable configuration\n final SearchManager searchManager = (SearchManager) getSystemService(Context.SEARCH_SERVICE);\n searchView = (SearchView) menu.findItem(R.id.action_search).getActionView();\n // Assumes current activity is the searchable activity\n searchView.setSearchableInfo(searchManager.getSearchableInfo(getComponentName()));\n // further customization of the SearchView\n searchView.setIconifiedByDefault(true);\n searchView.setQueryHint(getString(R.string.search_hint_text_for_search_widget));\n int width = AppUtilities.getDisplayWidth(this);\n searchView.setMaxWidth(width);\n // set a Listener to the SearchView so that the Search query being entered could be persisted\n searchView.setOnQueryTextListener(new SearchView.OnQueryTextListener() {\n /*\n * Method that tracks the state of SearchView (whether the user has submitted the query)\n * */\n @Override\n public boolean onQueryTextSubmit(String query) {\n searchQueryToRestore = query;\n // update the state variable\n searchQueryIsSubmitted = true;\n // remove focus from SearchView\n rootLayout.requestFocus();\n return false;\n }\n\n /*\n * Method that tracks the contents of search query being entered\n * */\n @Override\n public boolean onQueryTextChange(String newText) {\n // store the search query being entered in a global object that will be used to persist data\n // note: intentionally we use another string instead of @searchQueryToRestore, as SearchView\n // query is at first set to null (at the time SearchView is initialised), before setQuery()\n // method is called\n searchQueryToListen = newText;\n return false;\n }\n });\n\n\n // Todo(31) replace to the correct place in the code\n\n // listener that sets boolean values for @searchModeIsOn\n MenuItemCompat.setOnActionExpandListener(menu.findItem(searchView.getId()), new MenuItemCompat.OnActionExpandListener() {\n @Override\n public boolean onMenuItemActionExpand(MenuItem item) {\n searchModeIsOn = true;\n return true;\n }\n\n @Override\n public boolean onMenuItemActionCollapse(MenuItem item) {\n searchModeIsOn = false;\n\n // if no search query has been submitted, just close the search view,\n // else - reload the data\n if(!searchQuerySubmitted.equals(\"\")){\n performNewQuery();\n searchQuerySubmitted = \"\";\n }\n\n return true;\n }\n });\n\n // Restore the state of SearchView (if it was open before orientation change, or before\n // leaving the activity);\n if(searchModeIsOn){\n // expandActionView() expands / gives focus to the SearchView\n // note: it needs to be called before setQuery() method\n menu.findItem(searchView.getId()).expandActionView();\n searchView.setQuery(searchQueryToRestore, false);\n // restore the focus state\n if(searchQueryIsSubmitted){\n // if submitted - remove the focus (also removes the soft keyboard)\n searchView.clearFocus();\n rootLayout.requestFocus();\n }\n }\n return true;\n }","private void search(){\n solo.waitForView(R.id.search_action_button);\n solo.clickOnView(solo.getView(R.id.search_action_button));\n\n //Click on search bar\n SearchView searchBar = (SearchView) solo.getView(R.id.search_experiment_query);\n solo.clickOnView(searchBar);\n solo.sleep(500);\n\n //Type in a word from the description\n solo.clearEditText(0);\n solo.typeText(0, searchTerm);\n }","void showSearch() {\r\n AccelerateDecelerateInterpolator interpolator = new AccelerateDecelerateInterpolator();\r\n // Setup the animation for mSearchView\r\n mSearchView.setPivotY(mSearchView.getHeight());\r\n ObjectAnimator searchAnim = ObjectAnimator.ofFloat(mSearchView, \"scaleY\", 0.1f, 1.0f);\r\n searchAnim.setDuration(100);\r\n searchAnim.addListener(new AnimatorListenerAdapter() {\r\n @Override\r\n public void onAnimationStart(Animator animation) {\r\n // Set the visibility of the SearchView\r\n mSearchView.setVisibility(View.VISIBLE);\r\n\r\n // Request focus\r\n mSearchView.requestFocus();\r\n }\r\n });\r\n\r\n // Setup the animation for mTitle\r\n mTitle.setPivotY(mTitle.getHeight());\r\n ObjectAnimator titleAnim = ObjectAnimator.ofFloat(mTitle, \"scaleY\", 1.0f, 0.0f);\r\n searchAnim.setDuration(50);\r\n\r\n AnimatorSet animSet = new AnimatorSet();\r\n animSet.playSequentially(titleAnim, searchAnim);\r\n animSet.setInterpolator(interpolator);\r\n animSet.addListener(new AnimatorListenerAdapter() {\r\n @Override\r\n public void onAnimationEnd(Animator animation) {\r\n // Hide the app title\r\n mTitle.setVisibility(View.INVISIBLE);\r\n }\r\n });\r\n animSet.start();\r\n\r\n // Change the search icon to a cancel icon\r\n mSearchIcon.setImageDrawable(ContextCompat.getDrawable(this, R.drawable.ic_menu_close_clear_cancel));\r\n\r\n // Show the soft keyboard\r\n InputMethodManager imm = (InputMethodManager)getSystemService(Context.INPUT_METHOD_SERVICE);\r\n imm.showSoftInput(this.getCurrentFocus(), 0);\r\n }","public void openSearchView() {\n if (isSearchViewOpen) {\n return;\n }\n\n searchEditText.requestFocus();\n\n AnimatorListenerAdapter listenerAdapter = new AnimatorListenerAdapter() {\n @Override\n public void onAnimationEnd(Animator animation) {\n super.onAnimationEnd(animation);\n if (backgroundView != null) {\n backgroundView.setVisibility(VISIBLE);\n backgroundView.requestFocus();\n }\n //After SearchBar is revealed if keyword is not empty then open suggestions section\n if (!searchEditText.getText().toString().isEmpty()) {\n suggestionsAdapter.filterSuggestions(searchEditText.getText());\n FloatingSearchView.this.onTextChanged(searchEditText.getText());\n }\n }\n };\n\n if (Build.VERSION.SDK_INT >= Build.VERSION_CODES.LOLLIPOP) {\n rootView.setVisibility(View.VISIBLE);\n AnimationUtils.circleRevealView(searchBar, listenerAdapter);\n } else {\n AnimationUtils.fadeInView(rootView);\n }\n\n // Call listener if we have one\n if (searchViewListener != null) {\n searchViewListener.onSearchViewOpen();\n }\n\n isSearchViewOpen = true;\n }","public void searchDialog(final Intent intent){\n final AlertDialog dialogBuilder = new AlertDialog.Builder(this).create();\n final View dialogView = this.getLayoutInflater().inflate(R.layout.search_dialog, null);\n dialogBuilder.setView(dialogView);\n\n final EditText editText = (EditText) dialogView.findViewById(R.id.dialog_search);\n\n dialogBuilder.setTitle(getResources().getString(R.string.search));\n dialogBuilder.setMessage(getResources().getString(R.string.add_city));\n dialogBuilder.setButton(AlertDialog.BUTTON_POSITIVE, getResources().getString(R.string.cap_search), new DialogInterface.OnClickListener() {\n @Override\n public void onClick(DialogInterface dialogInterface, int i) {\n mActualCity = editText.getText().toString();\n Log.d(\"ServiceHandler\", \"searchDialog/ mActualCity: \" + mActualCity);\n if(!mActualCity.equals(\"\")){\n intent.putExtra(SharedPrefKeys.SEARCH_KEY, mActualCity);\n startActivity(intent);\n }\n dialogBuilder.dismiss();\n }\n });\n dialogBuilder.setButton(AlertDialog.BUTTON_NEGATIVE, getResources().getString(R.string.cancel), new DialogInterface.OnClickListener(){\n @Override\n public void onClick(DialogInterface dialogInterface, int i) {\n dialogBuilder.dismiss();\n }\n });\n dialogBuilder.show();\n }","private void searchforResults() {\n\n List<String> queryList = new SavePreferences(this).getStringSetPref();\n if(queryList != null && queryList.size() > 0){\n Log.i(TAG, \"Searching for results \" + queryList.get(0));\n Intent searchIntent = new Intent(Intent.ACTION_WEB_SEARCH);\n searchIntent.addFlags(Intent.FLAG_ACTIVITY_NEW_TASK);\n searchIntent.putExtra(SearchManager.QUERY, queryList.get(0));\n this.startActivity(searchIntent);\n }\n }","@Override\r\n public boolean onCreateOptionsMenu(Menu icon){\n\r\n MenuInflater expand = getMenuInflater();\r\n\r\n expand.inflate(R.menu.top_menu, icon); //Referencing to the specific menu\r\n\r\n MenuItem search = icon.findItem(R.id.search_bar);\r\n\r\n SearchView searchView = (SearchView) search.getActionView(); //Displays the search view button\r\n\r\n searchView.setOnQueryTextListener(new SearchView.OnQueryTextListener() {\r\n\r\n\r\n @Override\r\n public boolean onQueryTextSubmit(String s) {//Begins filtering here\r\n\r\n adapterDevices.getFilter().filter(s);\r\n\r\n return false;\r\n }\r\n //Sends typed string in search bar to trigger search\r\n\r\n\r\n //Method is triggered if there is text change\r\n @Override\r\n public boolean onQueryTextChange(String s) {\r\n\r\n if(s.equals(\"\")){ //When search bar is empty again the page is reloaded\r\n\r\n Intent refresh = new Intent(getApplicationContext(), MyDevicesActivity.class);\r\n\r\n startActivity(refresh);\r\n\r\n finish();\r\n\r\n }\r\n return false;\r\n }\r\n });\r\n\r\n\r\n return true;\r\n\r\n\r\n }","@Override\n\t\t\tpublic void onClick(View v) {\n\t\t\t\t\n\t\t\t\tConstants.searchText = txtSearchBox.getText().toString();\n\t\t\t\tseachExhibitions();\n\t\t\t\t\n\t\t\t}","void searchStarted (Search search);","private void search() {\n if (isConnected()) {\r\n query = searchField.getText().toString();\r\n mLoader.setVisibility(View.VISIBLE);\r\n emptyStateTextView.setText(\"\");\r\n //restart the loader with the new data\r\n loaderManager.restartLoader(1, null, this);\r\n } else {\r\n String message = getString(R.string.no_internet);\r\n new AlertDialog.Builder(this).setMessage(message).show();\r\n }\r\n }","private void toggleSearch () {\n\t\tsearchMode = !searchMode;\n\t\t\n\t\tif (searchMode) {\n\t\t\t// Go into search mode\n\t\t\t/*\n\t\t\t * Tween in the search bar and keep visible\n\t\t\t */\n\t\t\tif (flyRevealDown == null)\n\t\t\t\tflyRevealDown = AnimationUtils.loadAnimation(this, R.anim.fly_reveal_down);\n\t\t\tsearch.startAnimation(flyRevealDown);\n\t\t\tsearch.setVisibility(View.VISIBLE);\n\t\t\tfilter.requestFocus();\n\t\t\t\n\t\t\t/*\n\t\t\t * Tween out the new memo bar\n\t\t\t */\n\t\t\tif (fadeOut == null)\n\t\t\t\tfadeOut = AnimationUtils.loadAnimation(this, R.anim.fade_out);\n\t\t\tnewMemo.startAnimation(fadeOut);\n\t\t\tnewMemo.setVisibility(View.GONE);\n\t\t\t\n\t\t\t/*\n\t\t\t * Show the keyboard\n\t\t\t */\n\t\t\tinputMethodManager.showSoftInput(filter, 0);\n\t\t} else {\n\t\t\t// Go out of search mode\n\t\t\t/*\n\t\t\t * Hide the keyboard\n\t\t\t */\n\t\t\tinputMethodManager.hideSoftInputFromInputMethod(filter.getWindowToken(), 0);\n\t\t\t\n\t\t\t/*\n\t\t\t * Tween out the search bar and keep invisible\n\t\t\t */\n\t\t\tif (flyConcealUp == null)\n\t\t\t\tflyConcealUp = AnimationUtils.loadAnimation(this, R.anim.fly_conceal_up);\n\t\t\tfilter.setText(\"\");\n\t\t\tsearch.startAnimation(flyConcealUp);\n\t\t\tsearch.setVisibility(View.GONE);\n\t\t\t\n\t\t\t/*\n\t\t\t * Tween in the new memo bar\n\t\t\t */\n\t\t\tif (fadeIn == null)\n\t\t\t\tfadeIn = AnimationUtils.loadAnimation(this, R.anim.fade_in);\n\t\t\tnewMemo.startAnimation(fadeIn);\n\t\t\tnewMemo.setVisibility(View.VISIBLE);\n\t\t}\n\t}","void setNilSearchWindowStart();","@Override public void searchStarted() {\n progressBar.setVisibility(View.VISIBLE);\n }","public void clickOnSearchButton() {\n elementControl.clickElement(searchButton);\n }","@Override\n public boolean onCreateOptionsMenu(Menu menu) {\n getMenuInflater().inflate(R.menu.menu_search, menu);\n // Get the SearchView and set the searchable configuration\n SearchManager searchManager = (SearchManager) getSystemService(Context.SEARCH_SERVICE);\n final SearchView searchView = (SearchView) menu.findItem(R.id.action_search).getActionView();\n // Assumes current activity is the searchable activity\n searchView.setSearchableInfo(searchManager.getSearchableInfo(getComponentName()));\n searchView.setIconifiedByDefault(true);\n searchView.onActionViewExpanded();\n searchView.setSubmitButtonEnabled(true);\n // Change submit button\n ImageView submitButton = (ImageView) searchView.findViewById(android.support.v7.appcompat.R.id.search_go_btn);\n submitButton.setImageResource(R.drawable.ic_search_white_24dp);\n final EditText searchEditText = (EditText) searchView.findViewById(android.support.v7.appcompat.R.id.search_src_text);\n searchEditText.setImeOptions(DEFAULT_KEYS_SEARCH_LOCAL);\n //searchEditText.setTextColor(ContextCompat.getColor(this, R.color.md_black_1000));\n //View searchPlate = searchView.findViewById(android.support.v7.appcompat.R.id.search_plate);\n //searchPlate.setBackgroundResource(R.color.md_white_1000);\n searchView.setOnQueryTextListener(new SearchView.OnQueryTextListener() {\n @Override\n public boolean onQueryTextSubmit(String query) {\n executeSearchShow(query);\n searchView.clearFocus();\n return true;\n }\n\n @Override\n public boolean onQueryTextChange(String newText) {\n return false;\n }\n });\n return true;\n }","public void onSearch(View view)\n {\n PlacePicker.IntentBuilder builder = new PlacePicker.IntentBuilder();\n\n try {\n startActivityForResult(builder.build(this), PLACE_PICKER_REQUEST);\n } catch (GooglePlayServicesRepairableException e) {\n e.printStackTrace();\n } catch (GooglePlayServicesNotAvailableException e) {\n e.printStackTrace();\n }\n }","private void onClickSearch() {\n if (lat.isEmpty() || lon.isEmpty()) {\n Toast.makeText(\n self,\n getResources()\n .getString(R.string.wait_for_getting_location),\n Toast.LENGTH_SHORT).show();\n getLatLong();\n }\n //get current distance search :\n distance = ((double) skbDistance.getProgress() / 10) + \"\";\n\n Bundle b = new Bundle();\n b.putString(GlobalValue.KEY_SEARCH, edtSearch.getText().toString());\n b.putString(GlobalValue.KEY_CATEGORY_ID, categoryId);\n b.putString(GlobalValue.KEY_CITY_ID, cityId);\n b.putString(GlobalValue.KEY_OPEN, ALL_OR_OPEN);\n b.putString(GlobalValue.KEY_DISTANCE, distance);\n b.putString(GlobalValue.KEY_SORT_BY, SORT_BY);\n b.putString(GlobalValue.KEY_SORT_TYPE, SORT_TYPE);\n if (Constant.isFakeLocation) {\n b.putString(GlobalValue.KEY_LAT, GlobalValue.glatlng.latitude + \"\");\n b.putString(GlobalValue.KEY_LONG, GlobalValue.glatlng.longitude + \"\");\n } else {\n b.putString(GlobalValue.KEY_LAT, lat);\n b.putString(GlobalValue.KEY_LONG, lon);\n }\n\n if (isSelectShop)\n ((MainTabActivity) getParent()).gotoActivity(\n SearchShopResultActivity.class, b);\n else\n ((MainTabActivity) getParent()).gotoActivity(\n SearchProductResultActivity.class, b);\n }","public void actionPerformed(ActionEvent InputEvent)\r\n {\r\n performSearch();\r\n }","@Override\n public boolean onCreateOptionsMenu(final Menu menu) {\n getMenuInflater().inflate(R.menu.menu, menu);\n final MenuItem notificationsMenuItem = menu.findItem(R.id.action_notifications);\n final MenuItem walletMenuItem = menu.findItem(R.id.action_wallet);\n final MenuItem searchMenuItem = menu.findItem(R.id.action_search);\n final MenuItem homeMenuItem = menu.findItem(R.id.action_home);\n\n //Hide all action buttons\n homeMenuItem.setVisible(false);\n notificationsMenuItem.setVisible(false);\n walletMenuItem.setVisible(false);\n searchMenuItem.setVisible(mSearchViewToShow);\n\n searchView = (SearchView) MenuItemCompat.getActionView(menu.findItem(R.id.action_search));\n SearchManager searchManager = (SearchManager) getSystemService(Context.SEARCH_SERVICE);\n // Assumes current activity is the searchable activity\n searchView.setSearchableInfo(searchManager.getSearchableInfo(getComponentName()));\n// searchView.setIconifiedByDefault(false); // Do not iconify the widget; expand it by default\n\n searchView.setOnQueryTextListener(this);\n searchView.setOnQueryTextFocusChangeListener(new View.OnFocusChangeListener() {\n @Override\n public void onFocusChange(View view, boolean isFocused) {\n searchView.setSuggestionsAdapter(null);\n if (isFocused) {\n findViewById(R.id.layout_search_food).setVisibility(View.VISIBLE);\n } else {\n// findViewById(R.id.layout_search_food).setVisibility(View.GONE);\n }\n }\n });\n\n searchView.setOnCloseListener(new SearchView.OnCloseListener() {\n @Override\n public boolean onClose() {\n findViewById(R.id.layout_search_food).setVisibility(View.GONE);\n return false;\n }\n });\n\n searchView.setQueryHint(getResources().getString(R.string.search_menu_hint));\n\n SearchView.SearchAutoComplete autoCompleteTextView = (SearchView.SearchAutoComplete) searchView.findViewById(R.id.search_src_text);\n if (autoCompleteTextView != null) {\n autoCompleteTextView.setDropDownBackgroundDrawable(getResources().getDrawable(R.drawable.abc_popup_background_mtrl_mult));\n }\n View searchPlate = searchView.findViewById(android.support.v7.appcompat.R.id.search_plate);\n\n if (searchPlate != null) {\n searchPlate.setBackgroundResource(R.drawable.textfield_searchview_holo_light);\n }\n\n return true;\n }","public void initSearchWidget(){\n\n searchview.setOnQueryTextListener(new SearchView.OnQueryTextListener() {\n @Override\n public boolean onQueryTextSubmit(String query) {\n\n //Closes the keyboard once query is submitted\n searchview.clearFocus();\n return false;\n }\n\n @Override\n public boolean onQueryTextChange(String newText) {\n\n //New arraylist for filtered products\n List<product> filteredList = new ArrayList<>();\n\n //Iterating over the array with products and adding every product that matches\n //the query to the new filtered list\n for (product product : listOfProducts){\n if (product.getProductName().toLowerCase().contains(newText.toLowerCase())){\n filteredList.add(product);\n }\n }\n\n //Hides the product list and display \"not found\" message when can't find match\n if (filteredList.size()<1){\n recyclerView.setVisibility(View.GONE);\n noResults.setVisibility(View.VISIBLE);\n }else {\n recyclerView.setVisibility(View.VISIBLE);\n noResults.setVisibility(View.GONE);\n }\n\n //Sets new adapter with filtered products to the recycler view\n productAdapter = new Adapter(MainActivity.this,filteredList);\n recyclerView.setAdapter(productAdapter);\n\n return true;\n }\n });\n }","@Override\n public boolean onCreateOptionsMenu(Menu menu) {\n getMenuInflater().inflate(R.menu.menu_item, menu);\n MenuItem searchItem = menu.findItem(R.id.action_search);\n SearchView searchView = (SearchView) searchItem.getActionView();\n searchView.setImeOptions(EditorInfo.IME_ACTION_DONE);\n try{ searchView.setOnQueryTextListener(new SearchView.OnQueryTextListener() {\n @Override\n public boolean onQueryTextSubmit(String query) {\n return false;\n }\n\n @Override\n public boolean onQueryTextChange(String newText) {\n DeliveryReturnBySupervisorAdapter.getFilter().filter(newText);\n return false;\n }\n });\n }\n catch (Exception e)\n {\n e.printStackTrace();\n Intent intent_stay = new Intent(DeliveryReturnBySupervisor.this, DeliveryWithoutStatus.class);\n Toast.makeText(this, \"Page Loading...\", Toast.LENGTH_SHORT).show();\n startActivity(intent_stay);\n }\n return true;\n }","@Override\n public boolean onCreateOptionsMenu(Menu menu) {\n\n getMenuInflater().inflate(R.menu.menu_main, menu);\n\n // Associate searchable configuration with the SearchView\n SearchManager searchManager = (SearchManager) getSystemService(Context.SEARCH_SERVICE);\n SearchView searchView = (SearchView) menu.findItem(R.id.menuSearch).getActionView();\n searchView.setSearchableInfo(searchManager.getSearchableInfo(getComponentName()));\n\n searchView.setIconifiedByDefault(false);\n searchView.setFocusable(true);\n searchView.setIconified(false);\n\n\n\n if( Intent.ACTION_VIEW.equals(getIntent().getAction())){\n Intent i = new Intent(SearchActivity.this, SearchActivity.class);\n query = getIntent().getStringExtra(SearchManager.QUERY);\n i.setAction(Intent.ACTION_SEARCH);\n i.putExtra(\"query\", query);\n startActivity(i);\n\n Toast.makeText(SearchActivity.this, query, Toast.LENGTH_SHORT).show();\n }\n\n searchView.setOnQueryTextListener(new SearchView.OnQueryTextListener() {\n @Override\n public boolean onQueryTextSubmit(String query) {\n // INPUT CODE HERE\n Toast.makeText(SearchActivity.this, query, Toast.LENGTH_SHORT).show();\n return false;\n }\n\n @Override\n public boolean onQueryTextChange(String newText) {\n // INPUT CODE HERE\n// String[] q = {\"promotion_name\"};\n// String[] t = {newText};\n// MySuggestionProvider suggestion = new MySuggestionProvider();\n// suggestion.query(Uri.parse(\"database.it.kmitl.ac.th/it_35\"), q, \"promotion_name LIKE %?%\", t, null);\n return false;\n }\n });\n return true;\n }","public void onSearchButtonClick(View view){\r\n\t\t\r\n\t\tfor (ListingItem item : ListingContent.ITEMS) {\r\n\t\t\tif (item.content.toUpperCase(Locale.getDefault()).contains(searchField.getText().toString().toUpperCase(Locale.getDefault()))) {\r\n\t\t\t\tresults.add(item);\r\n\t\t\t}\r\n\t\t}\r\n\t\t\r\n\t\tsetListAdapter(new ArrayAdapter<ListingContent.ListingItem>(this,\r\n\t\t\t\tandroid.R.layout.simple_list_item_1,\r\n\t\t\t\tandroid.R.id.text1, results));\r\n\t}","public void clickSearchButton() {\n\t\tsearchButton.click();\n\t}","private void searchQuery() {\n edit_search.addTextChangedListener(new TextWatcher() {\n @Override\n public void beforeTextChanged(CharSequence s, int start, int count, int after) {\n if (paletteComposition.getVisibility() == View.VISIBLE){\n paletteComposition.setVisibility(View.GONE);\n setComposer.setVisibility(View.VISIBLE);\n }\n }\n\n @Override\n public void onTextChanged(CharSequence s, int start, int before, int count) {\n setContactThatNameContains(s.toString().trim());\n }\n\n @Override\n public void afterTextChanged(Editable s) {\n\n }\n });\n }","public void performSearch() {\n OASelect<QueryInfo> sel = getQueryInfoSearch().getSelect();\n sel.setSearchHub(getSearchFromHub());\n sel.setFinder(getFinder());\n getHub().select(sel);\n }","@Override\r\n\tpublic void searchObjectListener(ActionEvent e) {\n\t\t\r\n\t}","public void search() {\r\n \t\r\n }","@Override\n public void onClick(View v) {\n EditText searchBar = (EditText) findViewById(R.id.searchBar);\n String searchTerms = searchBar.getText().toString();\n\n //Perform the search\n new SearchStationsAsync(getBaseContext(), searchTerms).execute();\n }","@FXML\n\tvoid search(ActionEvent event) {\n\n\t\ttry {\n\n\t\t\tif(idEditText.getText().equals(\"\")) {\n\n\t\t\t\tthrow new InsufficientInformationException();\n\n\t\t\t}\n\t\t\telse {\n\n\t\t\t\tPlanetarySystem ps = ns.search(Integer.parseInt(idEditText.getText()));\n\n\t\t\t\tif(ps != null) {\n\t\t\t\t\t\n\t\t\t\t\tloadInformation(ps);\t\t\t\t\t\n\t\t\t\t\teditSelectionAlerts();\n\t\t\t\t\tupdateValidationsAvailability(true);\n\t\t\t\t\tupdateButtonsAvailability(true, true, true);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tsystemNotFoundAlert();\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\t\tcatch(InsufficientInformationException e) {\n\t\t\tinsufficientDataAlert();\n\t\t}\n\t\tcatch(Exception ex) {\n\t\t\tsystemNotFoundAlert();\n\t\t}\n\n\t}","private void search() {\n \t\tString searchString = m_searchEditText.getText().toString();\n \n \t\t// Remove the refresh if it's scheduled\n \t\tm_handler.removeCallbacks(m_refreshRunnable);\n \t\t\n\t\tif ((searchString != null) && (!searchString.equals(\"\"))) {\n \t\t\tLog.d(TAG, \"Searching string: \\\"\" + searchString + \"\\\"\");\n \n \t\t\t// Save the search string\n \t\t\tm_lastSearch = searchString;\n \n \t\t\t// Disable the Go button to show that the search is in progress\n \t\t\tm_goButton.setEnabled(false);\n \n \t\t\t// Remove the keyboard to better show results\n \t\t\t((InputMethodManager) this\n \t\t\t\t\t.getSystemService(Service.INPUT_METHOD_SERVICE))\n \t\t\t\t\t.hideSoftInputFromWindow(m_searchEditText.getWindowToken(),\n \t\t\t\t\t\t\t0);\n \n \t\t\t// Start the search task\n \t\t\tnew HTTPTask().execute(searchString);\n \t\t\t\n \t\t\t// Schedule the refresh\n \t\t\tm_handler.postDelayed(m_refreshRunnable, REFRESH_DELAY);\n \t\t} else {\n \t\t\tLog.d(TAG, \"Ignoring null or empty search string.\");\n \t\t}\n \t}","private SearchBar() {\n controller = FilterController.getInstance();\n initComponents();\n createNewQueryPanel();\n }","@Override\n\tprotected void startSearchResultActivity(String[] search_ifs) {\n\t\tItemSearchResultActivity.startThisActivity(this, getString(R.string.detail_search), search_ifs);\n\t}","private void toggleSearchButton() {\n\t\t// Enable \"Search\" button when both input fields are filled in\n\t\tview.toggleSearch(!view.getStartStation().equals(\"\")\n\t\t\t\t&& !view.getEndStation().equals(\"\"));\n\t}","public void onSearchClick(View v) {\n UIUtils.goSearch(this);\n }","private View.OnKeyListener onEnterPerformSearch() {\n return new View.OnKeyListener() {\n\n @Override\n public boolean onKey(View v, int keyCode, KeyEvent event) {\n try {\n if (event.getAction() == KeyEvent.ACTION_DOWN\n && keyCode == KeyEvent.KEYCODE_ENTER) {\n performSearch();\n return true;\n }\n if (event.getAction() == KeyEvent.ACTION_DOWN\n && keyCode == KEYCODE_SCAN_HARDWARE_BUTTON) {\n mSearchField.setText(\"\");\n return true;\n }\n return false;\n }\n catch (final Exception e) {\n showSearchErrorDialog();\n logError(e);\n return false;\n }\n }\n };\n }","void searchProbed (Search search);","public void searchMenu(View view)\n {\n // Handles the Click from the search menu\n SearchOptions searchOptions = new SearchOptions(this.gogoBogo);\n searchOptions.show(getSupportFragmentManager(), \"test\");\n }","public void onEditSearch(ActionEvent event) {\r\n \tgetController().onEditSearch( event ); \t\r\n }","private void searchMenu(){\n\t\t\n\t}","private View.OnClickListener onVoiceSearchButtonClick() {\n return new View.OnClickListener() {\n\n @Override\n public void onClick(View v) {\n try {\n if (canRecognizeSpeechInput()) {\n final Intent intent = new Intent(RecognizerIntent.ACTION_RECOGNIZE_SPEECH);\n\n // Specify the calling package to identify your application\n intent.putExtra(RecognizerIntent.EXTRA_CALLING_PACKAGE, getClass()\n .getPackage().getName());\n intent.putExtra(RecognizerIntent.EXTRA_PROMPT,\n \"Say a Make, Model, Stock Number, or VIN\");\n intent.putExtra(RecognizerIntent.EXTRA_LANGUAGE_MODEL,\n RecognizerIntent.LANGUAGE_MODEL_WEB_SEARCH);\n\n // Specify how many results you want to receive. The results will be sorted\n // where the first result is the one with higher confidence.\n intent.putExtra(RecognizerIntent.EXTRA_MAX_RESULTS, 5);\n\n getParentFragment().startActivityForResult(intent,\n VOICE_RECOGNITION_REQUEST_CODE);\n }\n }\n catch (final Exception e) {\n showSpeechRecognitionErrorDialog();\n logError(e);\n }\n }\n };\n }","protected void onSearchExit() {\n if ((mListContext != null) && mListContext.isSearch()) {\n mActivity.finish();\n } else {\n // Re show the search icon.\n mActivity.invalidateOptionsMenu();\n }\n }","public boolean onQueryTextSubmit(String query) {\n Intent i=new Intent(getApplicationContext(),SearchActivity.class);\n i.putExtra(\"search-key\",query);\n\n startActivity(i);\n searchView.setQuery(\"\", false);\n searchView.setIconified(true);\n return false;\n\n\n }","private void createSearchDialog() {\n final Dialog dialog = new Dialog(this);\n dialog.requestWindowFeature(Window.FEATURE_NO_TITLE);\n dialog.setContentView(R.layout.search);\n Window window = dialog.getWindow();\n //window.setLayout(mWidth/2, mHeight/2);\n window.setLayout(WindowManager.LayoutParams.WRAP_CONTENT, WindowManager.LayoutParams.WRAP_CONTENT);\n\n dialog.setTitle(getString(R.string.search));\n /**Search*/\n Button btnSearch = (Button) dialog.findViewById(R.id.search);\n final EditText txtSearch = (EditText) dialog.findViewById(R.id.txtSearch);\n txtSearch.setOnKeyListener(new View.OnKeyListener() {\n @Override\n public boolean onKey(View view, int i, KeyEvent keyEvent) {\n if (i == KeyEvent.KEYCODE_ENTER) {\n diaryFragment.search(txtSearch.getText().toString());\n\n dialog.dismiss();\n }\n return false;\n }\n });\n\n btnSearch.setOnClickListener(new View.OnClickListener() {\n @Override\n public void onClick(View v) {\n diaryFragment.search(txtSearch.getText().toString());\n dialog.dismiss();\n }\n });\n\n\n dialog.show();\n }","@Override\n\t\t\tpublic void onClick(View arg0)\n\t\t\t{\n\t\t\t\tintent.setClass(SearchView.this.getActivity(),\n\t\t\t\t\t\tSearchResultActivity.class);\n\t\t\t\tintent.putExtra(\"selection\", search_info.getText().toString());\n\t\t\t\tSearchView.this.startActivity(intent);\n\n\t\t\t}","private void closeSearch() {\n if (mIsSearchMode && mSearchMenuItem != null) {\n SearchView searchView = (SearchView) mSearchMenuItem.getActionView();\n EditText editText = searchView.findViewById(android.support.v7.appcompat.R.id.search_src_text);\n if (editText.isFocused()) {\n editText.onEditorAction(EditorInfo.IME_ACTION_SEARCH);\n }\n }\n }","@Override\n public void onSearchConfirmed(CharSequence text) {\n if (text!=null) {\n adapter.stopListening();\n StartSearch(text);\n searchAdapter.startListening();\n }\n }","private void initSearchView() {\n SearchManager searchManager = (SearchManager) getActivity().getSystemService(Context.SEARCH_SERVICE);\n\n searchView.setSearchableInfo(searchManager.getSearchableInfo(getActivity().getComponentName()));\n searchView.setMaxWidth(Integer.MAX_VALUE);\n\n //listening to search query text change\n searchView.setOnQueryTextListener(new SearchView.OnQueryTextListener() {\n @Override\n public boolean onQueryTextSubmit(String query) {\n // filter recycler view when query submitted\n machineAdapter.getFilter().filter(query);\n return false;\n }\n\n @Override\n public boolean onQueryTextChange(String newText) {\n machineAdapter.getFilter().filter(newText);\n return false;\n }\n });\n\n }","public void onSearchSubmit(String queryTerm);","public void initialiseSearchView() {\n text.addTextChangedListener(new TextWatcher() {\n @Override\n public void beforeTextChanged(CharSequence s, int start, int count, int after) {\n // do nothing\n }\n\n @Override\n public void onTextChanged(CharSequence s, int start, int before, int count) {\n if (count > 0) {\n clearButton.setVisibility(View.VISIBLE);\n } else {\n clearButton.setVisibility(View.GONE);\n }\n searchHandler.apply(s.toString());\n }\n\n @Override\n public void afterTextChanged(Editable s) {\n // do nothing\n }\n });\n text.setOnEditorActionListener(new TextView.OnEditorActionListener() {\n @Override\n public boolean onEditorAction(TextView v, int actionId, KeyEvent event) {\n if (actionId == EditorInfo.IME_ACTION_SEARCH) {\n //Still perform a search operation, then hide keyboard & search bar\n searchHandler.apply(v.getText().toString());\n hideSearchBar();\n return true;\n }\n return false;\n }\n });\n\n clearButton.setOnClickListener(new View.OnClickListener() {\n @Override\n public void onClick(View v) {\n text.setText(\"\");\n }\n });\n\n closeButton.setOnClickListener(new View.OnClickListener() {\n @Override\n public void onClick(View v) {\n hideSearchBar();\n }\n });\n\n clearButton.setVisibility(View.GONE);\n hideSearchBar();\n }","@Override\n public boolean onCreateOptionsMenu(final Menu menu) {\n getMenuInflater().inflate(R.menu.menu_main, menu);\n SearchManager searchManager = (SearchManager) getSystemService(Context.SEARCH_SERVICE);\n mSearchView = (SearchView) menu.findItem(R.id.action_search).getActionView();\n mSearchView.setSearchableInfo(searchManager.getSearchableInfo(getComponentName()));\n mSearchView.setQueryHint(\"Nhập từ tìm kiếm\");\n\n EditText searchPlate = ((EditText) mSearchView.findViewById(R.id.search_src_text));\n searchPlate.setBackgroundResource(R.drawable.underlinetheme_edit_text_holo_light);\n searchPlate.setImeOptions(EditorInfo.IME_ACTION_SEARCH);\n searchPlate.setTextColor(getResources().getColor(R.color.textColorPrimary));\n\n mSearchView.setOnQueryTextListener(new SearchView.OnQueryTextListener() {\n @Override\n public boolean onQueryTextSubmit(String query) {\n Seach(query);\n return false;\n }\n\n @Override\n public boolean onQueryTextChange(String newText) {\n return false;\n }\n });\n\n mTVTitle.setOnClickListener(new View.OnClickListener() {\n @Override\n public void onClick(View view) {\n mSearchView.setIconified(false);\n MenuItemCompat.expandActionView(menu.findItem(R.id.action_search));\n mSearchView.requestFocus();\n InputMethodManager lManager = (InputMethodManager) getSystemService(Context.INPUT_METHOD_SERVICE);\n lManager.showSoftInput(mSearchView, 0);\n }\n });\n\n return true;\n }","@Override\n\tpublic void startActivity(Intent intent) {\n\t if (Intent.ACTION_SEARCH.equals(intent.getAction())) {\n\t intent.putExtra(\"ACTIVE_VIEW_PAGE\", mPager.getCurrentItem());\n\t }\n\t super.startActivity(intent);\n\t}","public insearch() {\n initComponents();\n }","@Override\n \t\t\t\tpublic void onClick(View v) {\n \t\t\t\t\tEditText searchBar = (EditText) findViewById(R.id.search_bar);\n \t\t\t\t\tif(searchBar.getText().equals(\"\"))\n \t\t\t\t\t{\n \t\t\t\t\t\tsearchBar.setText(\"Please enter nonempty query\");\n \t\t\t\t\t}\n \t\t\t\t\telse\n \t\t\t\t\t{\n \t\t\t\t\t\tsearchGuide(searchBar, true);\n \t\t\t\t\t}\n \t\t\t\t}","@Override\n \t\t\t\tpublic void onClick(View v) {\n \t\t\t\t\tEditText searchBar = (EditText) findViewById(R.id.search_bar);\n \t\t\t\t\tif(searchBar.getText().equals(\"\"))\n \t\t\t\t\t{\n \t\t\t\t\t\tsearchBar.setText(\"Please enter nonempty query\");\n \t\t\t\t\t}\n \t\t\t\t\telse\n \t\t\t\t\t{\n \t\t\t\t\t\tsearchGuide(searchBar, false);\n \t\t\t\t\t}\n \t\t\t\t}","public void search() {\n }","HasClickHandlers getSearchButton();","void searchView(String name);","public void onClickSearch (View v)\n{\n startActivity (new Intent(getApplicationContext(), SearchActivity.class));\n}","private void search(ActionEvent x) {\n\t\tString text = this.searchText.getText();\n\t\tif (text.equals(\"\")) {\n\t\t\tupdate();\n\t\t\treturn;\n\t\t}\n\t\tboolean flag = false;\n\t\tfor (Project p : INSTANCE.getProjects()) {\n\t\t\tif (p.getName().indexOf(text) != -1) {\n\t\t\t\tif (!flag) {\n\t\t\t\t\tthis.projects.clear();\n\t\t\t\t\tflag = true;\n\t\t\t\t}\n\t\t\t\tthis.projects.addElement(p);\n\t\t\t}\n\t\t}\n\n\t\tif (!flag) {\n\t\t\tINSTANCE.getCurrentUser().sendNotification(new Notification((Object) INSTANCE, \"No results\"));\n\t\t\tthis.searchText.setText(\"\");\n\t\t}\n\t}","@Optional\r\n @OnClick(R.id.recipe_search_more)\r\n void searchMore() {\n Intent intent = new Intent(this, ActivitySearch.class);\r\n\r\n // Retrieve the user-added search term\r\n String searchTerm = mSearchView != null ? mSearchView.getText().toString() : null;\r\n\r\n if (searchTerm != null && !searchTerm.trim().isEmpty()) {\r\n // Pass the search term as an extra within the Intent\r\n intent.putExtra(ActivitySearch.SEARCH_TERM, searchTerm);\r\n // Start ActivitySearch with the Bundle\r\n startActivity(intent);\r\n }\r\n }","public Result clickSearch() {\n\t\tthis.searchButton.click();\r\n\t\treturn new Result(driver);\r\n\t}","@Override\n public void onClick(View view) {\n Intent searchIntent = SearchActivity.newIntent(getApplicationContext());\n startActivity(searchIntent);\n }","public void actionPerformed(ActionEvent e)\n\t{\n\t\tWindowController.searchFor();\n\t}","public void search(View v) {\n\t\tIntent intent = new Intent(RootMenuActivity.this, SearchActivity.class);\n\t\tintent.setFlags(Intent.FLAG_ACTIVITY_CLEAR_TOP);\n\t\tstartActivity(intent);\n\t}","@Override\r\npublic String popupSearch(String criteria) {\n\treturn null;\r\n}","protected abstract void onSearch(AjaxRequestTarget target, String searchString);","private void loadSearchResults(SearchRequest request) {\n showProgress(null, \"Loading search results...\");\n\n String authToken = ShPrefManager.with(getActivity()).getToken();\n RestClient.getAPI().search(authToken, request, new RestCallback<SearchResponse>() {\n @Override\n public void failure(RestError restError) {\n hideProgress();\n OpenHomeUtils.showToast(getActivity().getApplicationContext(), restError.getErrorMessage(), Toast.LENGTH_LONG);\n }\n\n @Override\n public void success(SearchResponse searchResponse, Response response) {\n hideProgress();\n if (searchResponse.getMessage().size() > 0) {\n propertyList = searchResponse.getMessage();\n String userId = ShPrefManager.with(getActivity()).getUserId();\n searchAdapter = new SearchAdapter(getActivity(), propertyList, userId, 'S');\n mRecyclerView.setAdapter(searchAdapter);\n currentAdapter = \"S\";\n //displayingNowTextView.setText(\"Searching \\\"\" + searchText + \"\\\"\");\n searchBack.setVisibility(View.VISIBLE);\n InputMethodManager imm = (InputMethodManager) getActivity().getSystemService(Context.INPUT_METHOD_SERVICE);\n imm.hideSoftInputFromWindow(getActivity().getWindow().getCurrentFocus().getWindowToken(), 0);\n locationLayout.setVisibility(View.VISIBLE);\n refineLayout.setVisibility(View.GONE);\n } else {\n String message = \"No results to display. Please modify the search criteria and try again.\";\n CustomDialogFragment regSuccessDialogFragment = CustomDialogFragment.newInstance(R.string.try_again,\n message, ApplicationConstants.BUTTON_OK, 0);\n regSuccessDialogFragment.show(getActivity().getFragmentManager(), \"SearchResultsFragment\");\n }\n }\n });\n }","public void searchByUser(View v){\n if(connection.isOnline(this)){\n new SearchByUserAsync().execute();\n }\n hideFABToolbar(new View(getApplicationContext()));\n }","private void showSearchProgressDialog(){\n\n searchButton.setEnabled(false);\n\n if(searchDialogFragment == null){\n searchDialogFragment = new SearchIndicatorDialogFragment();\n\n searchDialogFragment.setOnDialogDismissedListener(new GoogleApiHelper.OnDialogDismissedListener() {\n @Override\n public void onDialogDismissed() {\n cancelSearch = true;\n Log.d(TAG, \"Requesting Search cancellation on Search Progress dialog dismissal\");\n EventBus.getDefault().postSticky(new SearchService.CancelSearchEvent(SearchService.SEARCH_TUTORS));\n // Try cancelling the search\n }\n });\n\n }\n\n searchDialogFragment.show(getFragmentManager(), SearchIndicatorDialogFragment.FRAGMENT_TAG);\n\n /*if(searchProgressDialog == null){\n searchProgressDialog = new ProgressDialog(getContext());\n searchProgressDialog.setIndeterminate(true);\n searchProgressDialog.setCancelable(true);\n searchProgressDialog.setOnCancelListener(new DialogInterface.OnCancelListener() {\n @Override\n public void onCancel(DialogInterface dialog) {\n cancelSearch = true;\n Log.d(TAG, \"Requesting Search cancellation on Search Progress dialog dismissal\");\n EventBus.getDefault().postSticky(new SearchService.CancelSearchEvent(SearchService.SEARCH_TUTORS));\n // Try cancelling the search\n }\n });\n }\n if(!searchProgressDialog.isShowing()){\n Log.d(TAG, \"Showing the search progress dialog...\");\n searchProgressDialog.show();\n }*/\n }"],"string":"[\n \"private void showSearch() {\\n\\t\\tonSearchRequested();\\n\\t}\",\n \"@Override\\n\\tpublic boolean onSearchRequested () {\\n\\t\\tif (!searchMode)\\n\\t\\t\\ttoggleSearch();\\n\\t\\treturn true;\\n\\t}\",\n \"@Override\\n\\tpublic boolean onSearchRequested()\\n\\t{\\n \\tstartSearch(getCurSearch(), true, null, false);\\n \\treturn true;\\n\\t}\",\n \"void requestSearchViewFocus();\",\n \"protected void showSearch() {\\n \\t\\tIntent search = new Intent(this, SearchActivity.class);\\t\\t\\t\\t\\n \\t\\tthis.startActivity(search);\\n \\t}\",\n \"public void onSearchStarted() {\\n mActivity.invalidateOptionsMenu();\\n }\",\n \"@Override\\n public void onSearchOpened() {\\n }\",\n \"@Override\\n public void onSearchOpened() {\\n }\",\n \"@Override\\n public void onSearchOpened() {\\n }\",\n \"private void executeSearch() {\\n if (!view.getSearchContent().getText().isEmpty()) {\\n SearchModuleDataHolder filter = SearchModuleDataHolder.getSearchModuleDataHolder();\\n //set search content text for full text search\\n filter.setSearchText(view.getSearchContent().getText());\\n forwardToCurrentView(filter);\\n } else {\\n eventBus.showPopupNoSearchCriteria();\\n }\\n }\",\n \"private void search()\\n {\\n JTextField searchField = (currentSearchView.equals(SEARCH_PANE_VIEW))? searchBar : resultsSearchBar;\\n String searchTerm = searchField.getText();\\n \\n showTransition(2000);\\n \\n currentPage = 1;\\n showResultsView(true);\\n paginate(1, getResultsPerPage());\\n\\n if(searchWeb) showResultsTableView(WEB_RESULTS_PANE);\\n else showResultsTableView(IMAGE_RESULTS_PANE);\\n\\n \\n showSearchView(RESULTS_PANE_VIEW);\\n resultsSearchBar.setText(searchTerm);\\n }\",\n \"public void onSearchStarted();\",\n \"@Override\\n public void onSearchOpened() {\\n Log.v(\\\"SearchBox\\\", \\\"onSearchOpened()\\\");\\n }\",\n \"@Override\\n public void onSearchConfirmed(CharSequence text) {\\n startSearch(text);\\n }\",\n \"@Override\\n public void onSearchConfirmed(CharSequence text) {\\n startSearch(text);\\n\\n }\",\n \"private void openSearch() {\\n\\t\\tString message = \\\"This would be search.\\\";\\r\\n\\t\\tIntent intent = new Intent(this, DisplayMessageActivity.class);\\r\\n\\t\\tintent.putExtra(EXTRA_MESSAGE, message);\\r\\n\\t\\tstartActivity(intent);\\r\\n\\t}\",\n \"@Override\\n public boolean onSearchRequested() {\\n return !isSearchResultView && super.onSearchRequested();\\n }\",\n \"public void onGoToAdvancedSearch() {\\n eventBus.showAdvanceSearchPopup(newAttributeSearchWidget);\\n }\",\n \"@Override\\n public void onSearchConfirmed(CharSequence text) {\\n startSearch(text);\\n\\n }\",\n \"@Override\\n public void onSearchConfirmed(CharSequence text) {\\n startSearch(text);\\n\\n }\",\n \"private void readyToSearch() {\\n Intent intent = new Intent(this, SearchActivity.class);\\n startActivityForResult(intent, 21);\\n }\",\n \"public boolean openSearch(){\\n return true;\\n }\",\n \"private void showSearchDialog() {\\n\\t\\tSearchDialog searchDialog = new SearchDialog(lastText);\\n\\t\\tsearchDialog.show(getSupportFragmentManager(), \\\"fragment_search_keyword\\\");\\n\\t}\",\n \"public void enterSearchMode(String initialQueryTerm) {\\n initSearchViews();\\n if (isInSearchMode()) {\\n return;\\n }\\n if (!TextUtils.isEmpty(initialQueryTerm)) {\\n mSearchView.setQuery(initialQueryTerm, false);\\n } else {\\n mSearchView.setQuery(\\\"\\\", false);\\n }\\n mSearchView.setQueryHint(mCallback.getSearchHint());\\n\\n mSearchMode = MODE_SEARCH;\\n\\n // Focus on the search input box and throw up the IME if specified.\\n // TODO: HACK. this is a workaround IME not popping up.\\n mSearchView.setIconified(false);\\n\\n refresh();\\n mCallback.onSearchStarted();\\n }\",\n \"void searchUI();\",\n \"@Override\\n public void onSearchConfirmed(CharSequence text) {\\n startSearchResults(text);\\n }\",\n \"public void performSearch() {\\n History.newItem(MyWebApp.SEARCH_RESULTS);\\n getMessagePanel().clear();\\n if (keywordsTextBox.getValue().isEmpty()) {\\n getMessagePanel().displayMessage(\\\"Search term is required.\\\");\\n return;\\n }\\n mywebapp.getResultsPanel().resetSearchParameters();\\n //keyword search does not restrict to spots\\n mywebapp.addCurrentLocation();\\n if (markFilterCheckbox != null) {\\n mywebapp.getResultsPanel().getSearchParameters().setLicensePlate(markFilterCheckbox.getValue());\\n }\\n if (contestFilterCheckbox != null) {\\n mywebapp.getResultsPanel().getSearchParameters().setContests(contestFilterCheckbox.getValue());\\n }\\n if (geoFilterCheckbox != null) {\\n mywebapp.getResultsPanel().getSearchParameters().setGeospatialOff(!geoFilterCheckbox.getValue());\\n }\\n if (plateFilterCheckbox != null) {\\n mywebapp.getResultsPanel().getSearchParameters().setLicensePlate(plateFilterCheckbox.getValue());\\n }\\n if (spotFilterCheckbox != null) {\\n mywebapp.getResultsPanel().getSearchParameters().setSpots(spotFilterCheckbox.getValue());\\n }\\n String color = getValue(colorsListBox);\\n mywebapp.getResultsPanel().getSearchParameters().setColor(color);\\n String manufacturer = getValue(manufacturersListBox);\\n if (manufacturer != null) {\\n Long id = new Long(manufacturer);\\n mywebapp.getResultsPanel().getSearchParameters().setManufacturerId(id);\\n }\\n String vehicleType = getValue(vehicleTypeListBox);\\n mywebapp.getResultsPanel().getSearchParameters().setVehicleType(vehicleType);\\n// for (TagHolder tagHolder : tagHolders) {\\n// mywebapp.getResultsPanel().getSearchParameters().getTags().add(tagHolder);\\n// }\\n mywebapp.getResultsPanel().getSearchParameters().setKeywords(keywordsTextBox.getValue());\\n mywebapp.getMessagePanel().clear();\\n mywebapp.getResultsPanel().performSearch();\\n mywebapp.getTopMenuPanel().setTitleBar(\\\"Search\\\");\\n //mywebapp.getResultsPanel().setImageResources(resources.search(), resources.searchMobile());\\n }\",\n \"@FXML\\n private void btnSearchClick() {\\n\\n // Check if search field isn't empty\\n if (!txtSearch.getText().equals(\\\"\\\")) {\\n\\n // Display the progress indicator\\n resultsProgressIndicator.setVisible(true);\\n\\n // Get query results\\n MovieAPIImpl movieAPIImpl = new MovieAPIImpl();\\n movieAPIImpl.getMovieList(Constants.SERVICE_API_KEY, txtSearch.getText(), this);\\n }\\n }\",\n \"private void performSearch() {\\n try {\\n final String searchVal = mSearchField.getText().toString().trim();\\n\\n if (searchVal.trim().equals(\\\"\\\")) {\\n showNoStocksFoundDialog();\\n }\\n else {\\n showProgressDialog();\\n sendSearchResultIntent(searchVal);\\n }\\n }\\n catch (final Exception e) {\\n showSearchErrorDialog();\\n logError(e);\\n }\\n }\",\n \"public void onClickSearch (View v)\\n\\t{\\n\\t\\tstartActivity (new Intent(getApplicationContext(), SearchActivity.class));\\n\\t}\",\n \"@Override\\n public boolean onCreateOptionsMenu(Menu menu) {\\n // Inflate the options menu from XML\\n MenuInflater inflater = getMenuInflater();\\n inflater.inflate(R.menu.options_menu, menu);\\n\\n // Todo(32) gather all search view code in one place\\n\\n // further code, initializes SearchView menu item:\\n // Get the SearchView and set the searchable configuration\\n final SearchManager searchManager = (SearchManager) getSystemService(Context.SEARCH_SERVICE);\\n searchView = (SearchView) menu.findItem(R.id.action_search).getActionView();\\n // Assumes current activity is the searchable activity\\n searchView.setSearchableInfo(searchManager.getSearchableInfo(getComponentName()));\\n // further customization of the SearchView\\n searchView.setIconifiedByDefault(true);\\n searchView.setQueryHint(getString(R.string.search_hint_text_for_search_widget));\\n int width = AppUtilities.getDisplayWidth(this);\\n searchView.setMaxWidth(width);\\n // set a Listener to the SearchView so that the Search query being entered could be persisted\\n searchView.setOnQueryTextListener(new SearchView.OnQueryTextListener() {\\n /*\\n * Method that tracks the state of SearchView (whether the user has submitted the query)\\n * */\\n @Override\\n public boolean onQueryTextSubmit(String query) {\\n searchQueryToRestore = query;\\n // update the state variable\\n searchQueryIsSubmitted = true;\\n // remove focus from SearchView\\n rootLayout.requestFocus();\\n return false;\\n }\\n\\n /*\\n * Method that tracks the contents of search query being entered\\n * */\\n @Override\\n public boolean onQueryTextChange(String newText) {\\n // store the search query being entered in a global object that will be used to persist data\\n // note: intentionally we use another string instead of @searchQueryToRestore, as SearchView\\n // query is at first set to null (at the time SearchView is initialised), before setQuery()\\n // method is called\\n searchQueryToListen = newText;\\n return false;\\n }\\n });\\n\\n\\n // Todo(31) replace to the correct place in the code\\n\\n // listener that sets boolean values for @searchModeIsOn\\n MenuItemCompat.setOnActionExpandListener(menu.findItem(searchView.getId()), new MenuItemCompat.OnActionExpandListener() {\\n @Override\\n public boolean onMenuItemActionExpand(MenuItem item) {\\n searchModeIsOn = true;\\n return true;\\n }\\n\\n @Override\\n public boolean onMenuItemActionCollapse(MenuItem item) {\\n searchModeIsOn = false;\\n\\n // if no search query has been submitted, just close the search view,\\n // else - reload the data\\n if(!searchQuerySubmitted.equals(\\\"\\\")){\\n performNewQuery();\\n searchQuerySubmitted = \\\"\\\";\\n }\\n\\n return true;\\n }\\n });\\n\\n // Restore the state of SearchView (if it was open before orientation change, or before\\n // leaving the activity);\\n if(searchModeIsOn){\\n // expandActionView() expands / gives focus to the SearchView\\n // note: it needs to be called before setQuery() method\\n menu.findItem(searchView.getId()).expandActionView();\\n searchView.setQuery(searchQueryToRestore, false);\\n // restore the focus state\\n if(searchQueryIsSubmitted){\\n // if submitted - remove the focus (also removes the soft keyboard)\\n searchView.clearFocus();\\n rootLayout.requestFocus();\\n }\\n }\\n return true;\\n }\",\n \"private void search(){\\n solo.waitForView(R.id.search_action_button);\\n solo.clickOnView(solo.getView(R.id.search_action_button));\\n\\n //Click on search bar\\n SearchView searchBar = (SearchView) solo.getView(R.id.search_experiment_query);\\n solo.clickOnView(searchBar);\\n solo.sleep(500);\\n\\n //Type in a word from the description\\n solo.clearEditText(0);\\n solo.typeText(0, searchTerm);\\n }\",\n \"void showSearch() {\\r\\n AccelerateDecelerateInterpolator interpolator = new AccelerateDecelerateInterpolator();\\r\\n // Setup the animation for mSearchView\\r\\n mSearchView.setPivotY(mSearchView.getHeight());\\r\\n ObjectAnimator searchAnim = ObjectAnimator.ofFloat(mSearchView, \\\"scaleY\\\", 0.1f, 1.0f);\\r\\n searchAnim.setDuration(100);\\r\\n searchAnim.addListener(new AnimatorListenerAdapter() {\\r\\n @Override\\r\\n public void onAnimationStart(Animator animation) {\\r\\n // Set the visibility of the SearchView\\r\\n mSearchView.setVisibility(View.VISIBLE);\\r\\n\\r\\n // Request focus\\r\\n mSearchView.requestFocus();\\r\\n }\\r\\n });\\r\\n\\r\\n // Setup the animation for mTitle\\r\\n mTitle.setPivotY(mTitle.getHeight());\\r\\n ObjectAnimator titleAnim = ObjectAnimator.ofFloat(mTitle, \\\"scaleY\\\", 1.0f, 0.0f);\\r\\n searchAnim.setDuration(50);\\r\\n\\r\\n AnimatorSet animSet = new AnimatorSet();\\r\\n animSet.playSequentially(titleAnim, searchAnim);\\r\\n animSet.setInterpolator(interpolator);\\r\\n animSet.addListener(new AnimatorListenerAdapter() {\\r\\n @Override\\r\\n public void onAnimationEnd(Animator animation) {\\r\\n // Hide the app title\\r\\n mTitle.setVisibility(View.INVISIBLE);\\r\\n }\\r\\n });\\r\\n animSet.start();\\r\\n\\r\\n // Change the search icon to a cancel icon\\r\\n mSearchIcon.setImageDrawable(ContextCompat.getDrawable(this, R.drawable.ic_menu_close_clear_cancel));\\r\\n\\r\\n // Show the soft keyboard\\r\\n InputMethodManager imm = (InputMethodManager)getSystemService(Context.INPUT_METHOD_SERVICE);\\r\\n imm.showSoftInput(this.getCurrentFocus(), 0);\\r\\n }\",\n \"public void openSearchView() {\\n if (isSearchViewOpen) {\\n return;\\n }\\n\\n searchEditText.requestFocus();\\n\\n AnimatorListenerAdapter listenerAdapter = new AnimatorListenerAdapter() {\\n @Override\\n public void onAnimationEnd(Animator animation) {\\n super.onAnimationEnd(animation);\\n if (backgroundView != null) {\\n backgroundView.setVisibility(VISIBLE);\\n backgroundView.requestFocus();\\n }\\n //After SearchBar is revealed if keyword is not empty then open suggestions section\\n if (!searchEditText.getText().toString().isEmpty()) {\\n suggestionsAdapter.filterSuggestions(searchEditText.getText());\\n FloatingSearchView.this.onTextChanged(searchEditText.getText());\\n }\\n }\\n };\\n\\n if (Build.VERSION.SDK_INT >= Build.VERSION_CODES.LOLLIPOP) {\\n rootView.setVisibility(View.VISIBLE);\\n AnimationUtils.circleRevealView(searchBar, listenerAdapter);\\n } else {\\n AnimationUtils.fadeInView(rootView);\\n }\\n\\n // Call listener if we have one\\n if (searchViewListener != null) {\\n searchViewListener.onSearchViewOpen();\\n }\\n\\n isSearchViewOpen = true;\\n }\",\n \"public void searchDialog(final Intent intent){\\n final AlertDialog dialogBuilder = new AlertDialog.Builder(this).create();\\n final View dialogView = this.getLayoutInflater().inflate(R.layout.search_dialog, null);\\n dialogBuilder.setView(dialogView);\\n\\n final EditText editText = (EditText) dialogView.findViewById(R.id.dialog_search);\\n\\n dialogBuilder.setTitle(getResources().getString(R.string.search));\\n dialogBuilder.setMessage(getResources().getString(R.string.add_city));\\n dialogBuilder.setButton(AlertDialog.BUTTON_POSITIVE, getResources().getString(R.string.cap_search), new DialogInterface.OnClickListener() {\\n @Override\\n public void onClick(DialogInterface dialogInterface, int i) {\\n mActualCity = editText.getText().toString();\\n Log.d(\\\"ServiceHandler\\\", \\\"searchDialog/ mActualCity: \\\" + mActualCity);\\n if(!mActualCity.equals(\\\"\\\")){\\n intent.putExtra(SharedPrefKeys.SEARCH_KEY, mActualCity);\\n startActivity(intent);\\n }\\n dialogBuilder.dismiss();\\n }\\n });\\n dialogBuilder.setButton(AlertDialog.BUTTON_NEGATIVE, getResources().getString(R.string.cancel), new DialogInterface.OnClickListener(){\\n @Override\\n public void onClick(DialogInterface dialogInterface, int i) {\\n dialogBuilder.dismiss();\\n }\\n });\\n dialogBuilder.show();\\n }\",\n \"private void searchforResults() {\\n\\n List<String> queryList = new SavePreferences(this).getStringSetPref();\\n if(queryList != null && queryList.size() > 0){\\n Log.i(TAG, \\\"Searching for results \\\" + queryList.get(0));\\n Intent searchIntent = new Intent(Intent.ACTION_WEB_SEARCH);\\n searchIntent.addFlags(Intent.FLAG_ACTIVITY_NEW_TASK);\\n searchIntent.putExtra(SearchManager.QUERY, queryList.get(0));\\n this.startActivity(searchIntent);\\n }\\n }\",\n \"@Override\\r\\n public boolean onCreateOptionsMenu(Menu icon){\\n\\r\\n MenuInflater expand = getMenuInflater();\\r\\n\\r\\n expand.inflate(R.menu.top_menu, icon); //Referencing to the specific menu\\r\\n\\r\\n MenuItem search = icon.findItem(R.id.search_bar);\\r\\n\\r\\n SearchView searchView = (SearchView) search.getActionView(); //Displays the search view button\\r\\n\\r\\n searchView.setOnQueryTextListener(new SearchView.OnQueryTextListener() {\\r\\n\\r\\n\\r\\n @Override\\r\\n public boolean onQueryTextSubmit(String s) {//Begins filtering here\\r\\n\\r\\n adapterDevices.getFilter().filter(s);\\r\\n\\r\\n return false;\\r\\n }\\r\\n //Sends typed string in search bar to trigger search\\r\\n\\r\\n\\r\\n //Method is triggered if there is text change\\r\\n @Override\\r\\n public boolean onQueryTextChange(String s) {\\r\\n\\r\\n if(s.equals(\\\"\\\")){ //When search bar is empty again the page is reloaded\\r\\n\\r\\n Intent refresh = new Intent(getApplicationContext(), MyDevicesActivity.class);\\r\\n\\r\\n startActivity(refresh);\\r\\n\\r\\n finish();\\r\\n\\r\\n }\\r\\n return false;\\r\\n }\\r\\n });\\r\\n\\r\\n\\r\\n return true;\\r\\n\\r\\n\\r\\n }\",\n \"@Override\\n\\t\\t\\tpublic void onClick(View v) {\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tConstants.searchText = txtSearchBox.getText().toString();\\n\\t\\t\\t\\tseachExhibitions();\\n\\t\\t\\t\\t\\n\\t\\t\\t}\",\n \"void searchStarted (Search search);\",\n \"private void search() {\\n if (isConnected()) {\\r\\n query = searchField.getText().toString();\\r\\n mLoader.setVisibility(View.VISIBLE);\\r\\n emptyStateTextView.setText(\\\"\\\");\\r\\n //restart the loader with the new data\\r\\n loaderManager.restartLoader(1, null, this);\\r\\n } else {\\r\\n String message = getString(R.string.no_internet);\\r\\n new AlertDialog.Builder(this).setMessage(message).show();\\r\\n }\\r\\n }\",\n \"private void toggleSearch () {\\n\\t\\tsearchMode = !searchMode;\\n\\t\\t\\n\\t\\tif (searchMode) {\\n\\t\\t\\t// Go into search mode\\n\\t\\t\\t/*\\n\\t\\t\\t * Tween in the search bar and keep visible\\n\\t\\t\\t */\\n\\t\\t\\tif (flyRevealDown == null)\\n\\t\\t\\t\\tflyRevealDown = AnimationUtils.loadAnimation(this, R.anim.fly_reveal_down);\\n\\t\\t\\tsearch.startAnimation(flyRevealDown);\\n\\t\\t\\tsearch.setVisibility(View.VISIBLE);\\n\\t\\t\\tfilter.requestFocus();\\n\\t\\t\\t\\n\\t\\t\\t/*\\n\\t\\t\\t * Tween out the new memo bar\\n\\t\\t\\t */\\n\\t\\t\\tif (fadeOut == null)\\n\\t\\t\\t\\tfadeOut = AnimationUtils.loadAnimation(this, R.anim.fade_out);\\n\\t\\t\\tnewMemo.startAnimation(fadeOut);\\n\\t\\t\\tnewMemo.setVisibility(View.GONE);\\n\\t\\t\\t\\n\\t\\t\\t/*\\n\\t\\t\\t * Show the keyboard\\n\\t\\t\\t */\\n\\t\\t\\tinputMethodManager.showSoftInput(filter, 0);\\n\\t\\t} else {\\n\\t\\t\\t// Go out of search mode\\n\\t\\t\\t/*\\n\\t\\t\\t * Hide the keyboard\\n\\t\\t\\t */\\n\\t\\t\\tinputMethodManager.hideSoftInputFromInputMethod(filter.getWindowToken(), 0);\\n\\t\\t\\t\\n\\t\\t\\t/*\\n\\t\\t\\t * Tween out the search bar and keep invisible\\n\\t\\t\\t */\\n\\t\\t\\tif (flyConcealUp == null)\\n\\t\\t\\t\\tflyConcealUp = AnimationUtils.loadAnimation(this, R.anim.fly_conceal_up);\\n\\t\\t\\tfilter.setText(\\\"\\\");\\n\\t\\t\\tsearch.startAnimation(flyConcealUp);\\n\\t\\t\\tsearch.setVisibility(View.GONE);\\n\\t\\t\\t\\n\\t\\t\\t/*\\n\\t\\t\\t * Tween in the new memo bar\\n\\t\\t\\t */\\n\\t\\t\\tif (fadeIn == null)\\n\\t\\t\\t\\tfadeIn = AnimationUtils.loadAnimation(this, R.anim.fade_in);\\n\\t\\t\\tnewMemo.startAnimation(fadeIn);\\n\\t\\t\\tnewMemo.setVisibility(View.VISIBLE);\\n\\t\\t}\\n\\t}\",\n \"void setNilSearchWindowStart();\",\n \"@Override public void searchStarted() {\\n progressBar.setVisibility(View.VISIBLE);\\n }\",\n \"public void clickOnSearchButton() {\\n elementControl.clickElement(searchButton);\\n }\",\n \"@Override\\n public boolean onCreateOptionsMenu(Menu menu) {\\n getMenuInflater().inflate(R.menu.menu_search, menu);\\n // Get the SearchView and set the searchable configuration\\n SearchManager searchManager = (SearchManager) getSystemService(Context.SEARCH_SERVICE);\\n final SearchView searchView = (SearchView) menu.findItem(R.id.action_search).getActionView();\\n // Assumes current activity is the searchable activity\\n searchView.setSearchableInfo(searchManager.getSearchableInfo(getComponentName()));\\n searchView.setIconifiedByDefault(true);\\n searchView.onActionViewExpanded();\\n searchView.setSubmitButtonEnabled(true);\\n // Change submit button\\n ImageView submitButton = (ImageView) searchView.findViewById(android.support.v7.appcompat.R.id.search_go_btn);\\n submitButton.setImageResource(R.drawable.ic_search_white_24dp);\\n final EditText searchEditText = (EditText) searchView.findViewById(android.support.v7.appcompat.R.id.search_src_text);\\n searchEditText.setImeOptions(DEFAULT_KEYS_SEARCH_LOCAL);\\n //searchEditText.setTextColor(ContextCompat.getColor(this, R.color.md_black_1000));\\n //View searchPlate = searchView.findViewById(android.support.v7.appcompat.R.id.search_plate);\\n //searchPlate.setBackgroundResource(R.color.md_white_1000);\\n searchView.setOnQueryTextListener(new SearchView.OnQueryTextListener() {\\n @Override\\n public boolean onQueryTextSubmit(String query) {\\n executeSearchShow(query);\\n searchView.clearFocus();\\n return true;\\n }\\n\\n @Override\\n public boolean onQueryTextChange(String newText) {\\n return false;\\n }\\n });\\n return true;\\n }\",\n \"public void onSearch(View view)\\n {\\n PlacePicker.IntentBuilder builder = new PlacePicker.IntentBuilder();\\n\\n try {\\n startActivityForResult(builder.build(this), PLACE_PICKER_REQUEST);\\n } catch (GooglePlayServicesRepairableException e) {\\n e.printStackTrace();\\n } catch (GooglePlayServicesNotAvailableException e) {\\n e.printStackTrace();\\n }\\n }\",\n \"private void onClickSearch() {\\n if (lat.isEmpty() || lon.isEmpty()) {\\n Toast.makeText(\\n self,\\n getResources()\\n .getString(R.string.wait_for_getting_location),\\n Toast.LENGTH_SHORT).show();\\n getLatLong();\\n }\\n //get current distance search :\\n distance = ((double) skbDistance.getProgress() / 10) + \\\"\\\";\\n\\n Bundle b = new Bundle();\\n b.putString(GlobalValue.KEY_SEARCH, edtSearch.getText().toString());\\n b.putString(GlobalValue.KEY_CATEGORY_ID, categoryId);\\n b.putString(GlobalValue.KEY_CITY_ID, cityId);\\n b.putString(GlobalValue.KEY_OPEN, ALL_OR_OPEN);\\n b.putString(GlobalValue.KEY_DISTANCE, distance);\\n b.putString(GlobalValue.KEY_SORT_BY, SORT_BY);\\n b.putString(GlobalValue.KEY_SORT_TYPE, SORT_TYPE);\\n if (Constant.isFakeLocation) {\\n b.putString(GlobalValue.KEY_LAT, GlobalValue.glatlng.latitude + \\\"\\\");\\n b.putString(GlobalValue.KEY_LONG, GlobalValue.glatlng.longitude + \\\"\\\");\\n } else {\\n b.putString(GlobalValue.KEY_LAT, lat);\\n b.putString(GlobalValue.KEY_LONG, lon);\\n }\\n\\n if (isSelectShop)\\n ((MainTabActivity) getParent()).gotoActivity(\\n SearchShopResultActivity.class, b);\\n else\\n ((MainTabActivity) getParent()).gotoActivity(\\n SearchProductResultActivity.class, b);\\n }\",\n \"public void actionPerformed(ActionEvent InputEvent)\\r\\n {\\r\\n performSearch();\\r\\n }\",\n \"@Override\\n public boolean onCreateOptionsMenu(final Menu menu) {\\n getMenuInflater().inflate(R.menu.menu, menu);\\n final MenuItem notificationsMenuItem = menu.findItem(R.id.action_notifications);\\n final MenuItem walletMenuItem = menu.findItem(R.id.action_wallet);\\n final MenuItem searchMenuItem = menu.findItem(R.id.action_search);\\n final MenuItem homeMenuItem = menu.findItem(R.id.action_home);\\n\\n //Hide all action buttons\\n homeMenuItem.setVisible(false);\\n notificationsMenuItem.setVisible(false);\\n walletMenuItem.setVisible(false);\\n searchMenuItem.setVisible(mSearchViewToShow);\\n\\n searchView = (SearchView) MenuItemCompat.getActionView(menu.findItem(R.id.action_search));\\n SearchManager searchManager = (SearchManager) getSystemService(Context.SEARCH_SERVICE);\\n // Assumes current activity is the searchable activity\\n searchView.setSearchableInfo(searchManager.getSearchableInfo(getComponentName()));\\n// searchView.setIconifiedByDefault(false); // Do not iconify the widget; expand it by default\\n\\n searchView.setOnQueryTextListener(this);\\n searchView.setOnQueryTextFocusChangeListener(new View.OnFocusChangeListener() {\\n @Override\\n public void onFocusChange(View view, boolean isFocused) {\\n searchView.setSuggestionsAdapter(null);\\n if (isFocused) {\\n findViewById(R.id.layout_search_food).setVisibility(View.VISIBLE);\\n } else {\\n// findViewById(R.id.layout_search_food).setVisibility(View.GONE);\\n }\\n }\\n });\\n\\n searchView.setOnCloseListener(new SearchView.OnCloseListener() {\\n @Override\\n public boolean onClose() {\\n findViewById(R.id.layout_search_food).setVisibility(View.GONE);\\n return false;\\n }\\n });\\n\\n searchView.setQueryHint(getResources().getString(R.string.search_menu_hint));\\n\\n SearchView.SearchAutoComplete autoCompleteTextView = (SearchView.SearchAutoComplete) searchView.findViewById(R.id.search_src_text);\\n if (autoCompleteTextView != null) {\\n autoCompleteTextView.setDropDownBackgroundDrawable(getResources().getDrawable(R.drawable.abc_popup_background_mtrl_mult));\\n }\\n View searchPlate = searchView.findViewById(android.support.v7.appcompat.R.id.search_plate);\\n\\n if (searchPlate != null) {\\n searchPlate.setBackgroundResource(R.drawable.textfield_searchview_holo_light);\\n }\\n\\n return true;\\n }\",\n \"public void initSearchWidget(){\\n\\n searchview.setOnQueryTextListener(new SearchView.OnQueryTextListener() {\\n @Override\\n public boolean onQueryTextSubmit(String query) {\\n\\n //Closes the keyboard once query is submitted\\n searchview.clearFocus();\\n return false;\\n }\\n\\n @Override\\n public boolean onQueryTextChange(String newText) {\\n\\n //New arraylist for filtered products\\n List<product> filteredList = new ArrayList<>();\\n\\n //Iterating over the array with products and adding every product that matches\\n //the query to the new filtered list\\n for (product product : listOfProducts){\\n if (product.getProductName().toLowerCase().contains(newText.toLowerCase())){\\n filteredList.add(product);\\n }\\n }\\n\\n //Hides the product list and display \\\"not found\\\" message when can't find match\\n if (filteredList.size()<1){\\n recyclerView.setVisibility(View.GONE);\\n noResults.setVisibility(View.VISIBLE);\\n }else {\\n recyclerView.setVisibility(View.VISIBLE);\\n noResults.setVisibility(View.GONE);\\n }\\n\\n //Sets new adapter with filtered products to the recycler view\\n productAdapter = new Adapter(MainActivity.this,filteredList);\\n recyclerView.setAdapter(productAdapter);\\n\\n return true;\\n }\\n });\\n }\",\n \"@Override\\n public boolean onCreateOptionsMenu(Menu menu) {\\n getMenuInflater().inflate(R.menu.menu_item, menu);\\n MenuItem searchItem = menu.findItem(R.id.action_search);\\n SearchView searchView = (SearchView) searchItem.getActionView();\\n searchView.setImeOptions(EditorInfo.IME_ACTION_DONE);\\n try{ searchView.setOnQueryTextListener(new SearchView.OnQueryTextListener() {\\n @Override\\n public boolean onQueryTextSubmit(String query) {\\n return false;\\n }\\n\\n @Override\\n public boolean onQueryTextChange(String newText) {\\n DeliveryReturnBySupervisorAdapter.getFilter().filter(newText);\\n return false;\\n }\\n });\\n }\\n catch (Exception e)\\n {\\n e.printStackTrace();\\n Intent intent_stay = new Intent(DeliveryReturnBySupervisor.this, DeliveryWithoutStatus.class);\\n Toast.makeText(this, \\\"Page Loading...\\\", Toast.LENGTH_SHORT).show();\\n startActivity(intent_stay);\\n }\\n return true;\\n }\",\n \"@Override\\n public boolean onCreateOptionsMenu(Menu menu) {\\n\\n getMenuInflater().inflate(R.menu.menu_main, menu);\\n\\n // Associate searchable configuration with the SearchView\\n SearchManager searchManager = (SearchManager) getSystemService(Context.SEARCH_SERVICE);\\n SearchView searchView = (SearchView) menu.findItem(R.id.menuSearch).getActionView();\\n searchView.setSearchableInfo(searchManager.getSearchableInfo(getComponentName()));\\n\\n searchView.setIconifiedByDefault(false);\\n searchView.setFocusable(true);\\n searchView.setIconified(false);\\n\\n\\n\\n if( Intent.ACTION_VIEW.equals(getIntent().getAction())){\\n Intent i = new Intent(SearchActivity.this, SearchActivity.class);\\n query = getIntent().getStringExtra(SearchManager.QUERY);\\n i.setAction(Intent.ACTION_SEARCH);\\n i.putExtra(\\\"query\\\", query);\\n startActivity(i);\\n\\n Toast.makeText(SearchActivity.this, query, Toast.LENGTH_SHORT).show();\\n }\\n\\n searchView.setOnQueryTextListener(new SearchView.OnQueryTextListener() {\\n @Override\\n public boolean onQueryTextSubmit(String query) {\\n // INPUT CODE HERE\\n Toast.makeText(SearchActivity.this, query, Toast.LENGTH_SHORT).show();\\n return false;\\n }\\n\\n @Override\\n public boolean onQueryTextChange(String newText) {\\n // INPUT CODE HERE\\n// String[] q = {\\\"promotion_name\\\"};\\n// String[] t = {newText};\\n// MySuggestionProvider suggestion = new MySuggestionProvider();\\n// suggestion.query(Uri.parse(\\\"database.it.kmitl.ac.th/it_35\\\"), q, \\\"promotion_name LIKE %?%\\\", t, null);\\n return false;\\n }\\n });\\n return true;\\n }\",\n \"public void onSearchButtonClick(View view){\\r\\n\\t\\t\\r\\n\\t\\tfor (ListingItem item : ListingContent.ITEMS) {\\r\\n\\t\\t\\tif (item.content.toUpperCase(Locale.getDefault()).contains(searchField.getText().toString().toUpperCase(Locale.getDefault()))) {\\r\\n\\t\\t\\t\\tresults.add(item);\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tsetListAdapter(new ArrayAdapter<ListingContent.ListingItem>(this,\\r\\n\\t\\t\\t\\tandroid.R.layout.simple_list_item_1,\\r\\n\\t\\t\\t\\tandroid.R.id.text1, results));\\r\\n\\t}\",\n \"public void clickSearchButton() {\\n\\t\\tsearchButton.click();\\n\\t}\",\n \"private void searchQuery() {\\n edit_search.addTextChangedListener(new TextWatcher() {\\n @Override\\n public void beforeTextChanged(CharSequence s, int start, int count, int after) {\\n if (paletteComposition.getVisibility() == View.VISIBLE){\\n paletteComposition.setVisibility(View.GONE);\\n setComposer.setVisibility(View.VISIBLE);\\n }\\n }\\n\\n @Override\\n public void onTextChanged(CharSequence s, int start, int before, int count) {\\n setContactThatNameContains(s.toString().trim());\\n }\\n\\n @Override\\n public void afterTextChanged(Editable s) {\\n\\n }\\n });\\n }\",\n \"public void performSearch() {\\n OASelect<QueryInfo> sel = getQueryInfoSearch().getSelect();\\n sel.setSearchHub(getSearchFromHub());\\n sel.setFinder(getFinder());\\n getHub().select(sel);\\n }\",\n \"@Override\\r\\n\\tpublic void searchObjectListener(ActionEvent e) {\\n\\t\\t\\r\\n\\t}\",\n \"public void search() {\\r\\n \\t\\r\\n }\",\n \"@Override\\n public void onClick(View v) {\\n EditText searchBar = (EditText) findViewById(R.id.searchBar);\\n String searchTerms = searchBar.getText().toString();\\n\\n //Perform the search\\n new SearchStationsAsync(getBaseContext(), searchTerms).execute();\\n }\",\n \"@FXML\\n\\tvoid search(ActionEvent event) {\\n\\n\\t\\ttry {\\n\\n\\t\\t\\tif(idEditText.getText().equals(\\\"\\\")) {\\n\\n\\t\\t\\t\\tthrow new InsufficientInformationException();\\n\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\n\\t\\t\\t\\tPlanetarySystem ps = ns.search(Integer.parseInt(idEditText.getText()));\\n\\n\\t\\t\\t\\tif(ps != null) {\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tloadInformation(ps);\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\teditSelectionAlerts();\\n\\t\\t\\t\\t\\tupdateValidationsAvailability(true);\\n\\t\\t\\t\\t\\tupdateButtonsAvailability(true, true, true);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tsystemNotFoundAlert();\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\t\\tcatch(InsufficientInformationException e) {\\n\\t\\t\\tinsufficientDataAlert();\\n\\t\\t}\\n\\t\\tcatch(Exception ex) {\\n\\t\\t\\tsystemNotFoundAlert();\\n\\t\\t}\\n\\n\\t}\",\n \"private void search() {\\n \\t\\tString searchString = m_searchEditText.getText().toString();\\n \\n \\t\\t// Remove the refresh if it's scheduled\\n \\t\\tm_handler.removeCallbacks(m_refreshRunnable);\\n \\t\\t\\n\\t\\tif ((searchString != null) && (!searchString.equals(\\\"\\\"))) {\\n \\t\\t\\tLog.d(TAG, \\\"Searching string: \\\\\\\"\\\" + searchString + \\\"\\\\\\\"\\\");\\n \\n \\t\\t\\t// Save the search string\\n \\t\\t\\tm_lastSearch = searchString;\\n \\n \\t\\t\\t// Disable the Go button to show that the search is in progress\\n \\t\\t\\tm_goButton.setEnabled(false);\\n \\n \\t\\t\\t// Remove the keyboard to better show results\\n \\t\\t\\t((InputMethodManager) this\\n \\t\\t\\t\\t\\t.getSystemService(Service.INPUT_METHOD_SERVICE))\\n \\t\\t\\t\\t\\t.hideSoftInputFromWindow(m_searchEditText.getWindowToken(),\\n \\t\\t\\t\\t\\t\\t\\t0);\\n \\n \\t\\t\\t// Start the search task\\n \\t\\t\\tnew HTTPTask().execute(searchString);\\n \\t\\t\\t\\n \\t\\t\\t// Schedule the refresh\\n \\t\\t\\tm_handler.postDelayed(m_refreshRunnable, REFRESH_DELAY);\\n \\t\\t} else {\\n \\t\\t\\tLog.d(TAG, \\\"Ignoring null or empty search string.\\\");\\n \\t\\t}\\n \\t}\",\n \"private SearchBar() {\\n controller = FilterController.getInstance();\\n initComponents();\\n createNewQueryPanel();\\n }\",\n \"@Override\\n\\tprotected void startSearchResultActivity(String[] search_ifs) {\\n\\t\\tItemSearchResultActivity.startThisActivity(this, getString(R.string.detail_search), search_ifs);\\n\\t}\",\n \"private void toggleSearchButton() {\\n\\t\\t// Enable \\\"Search\\\" button when both input fields are filled in\\n\\t\\tview.toggleSearch(!view.getStartStation().equals(\\\"\\\")\\n\\t\\t\\t\\t&& !view.getEndStation().equals(\\\"\\\"));\\n\\t}\",\n \"public void onSearchClick(View v) {\\n UIUtils.goSearch(this);\\n }\",\n \"private View.OnKeyListener onEnterPerformSearch() {\\n return new View.OnKeyListener() {\\n\\n @Override\\n public boolean onKey(View v, int keyCode, KeyEvent event) {\\n try {\\n if (event.getAction() == KeyEvent.ACTION_DOWN\\n && keyCode == KeyEvent.KEYCODE_ENTER) {\\n performSearch();\\n return true;\\n }\\n if (event.getAction() == KeyEvent.ACTION_DOWN\\n && keyCode == KEYCODE_SCAN_HARDWARE_BUTTON) {\\n mSearchField.setText(\\\"\\\");\\n return true;\\n }\\n return false;\\n }\\n catch (final Exception e) {\\n showSearchErrorDialog();\\n logError(e);\\n return false;\\n }\\n }\\n };\\n }\",\n \"void searchProbed (Search search);\",\n \"public void searchMenu(View view)\\n {\\n // Handles the Click from the search menu\\n SearchOptions searchOptions = new SearchOptions(this.gogoBogo);\\n searchOptions.show(getSupportFragmentManager(), \\\"test\\\");\\n }\",\n \"public void onEditSearch(ActionEvent event) {\\r\\n \\tgetController().onEditSearch( event ); \\t\\r\\n }\",\n \"private void searchMenu(){\\n\\t\\t\\n\\t}\",\n \"private View.OnClickListener onVoiceSearchButtonClick() {\\n return new View.OnClickListener() {\\n\\n @Override\\n public void onClick(View v) {\\n try {\\n if (canRecognizeSpeechInput()) {\\n final Intent intent = new Intent(RecognizerIntent.ACTION_RECOGNIZE_SPEECH);\\n\\n // Specify the calling package to identify your application\\n intent.putExtra(RecognizerIntent.EXTRA_CALLING_PACKAGE, getClass()\\n .getPackage().getName());\\n intent.putExtra(RecognizerIntent.EXTRA_PROMPT,\\n \\\"Say a Make, Model, Stock Number, or VIN\\\");\\n intent.putExtra(RecognizerIntent.EXTRA_LANGUAGE_MODEL,\\n RecognizerIntent.LANGUAGE_MODEL_WEB_SEARCH);\\n\\n // Specify how many results you want to receive. The results will be sorted\\n // where the first result is the one with higher confidence.\\n intent.putExtra(RecognizerIntent.EXTRA_MAX_RESULTS, 5);\\n\\n getParentFragment().startActivityForResult(intent,\\n VOICE_RECOGNITION_REQUEST_CODE);\\n }\\n }\\n catch (final Exception e) {\\n showSpeechRecognitionErrorDialog();\\n logError(e);\\n }\\n }\\n };\\n }\",\n \"protected void onSearchExit() {\\n if ((mListContext != null) && mListContext.isSearch()) {\\n mActivity.finish();\\n } else {\\n // Re show the search icon.\\n mActivity.invalidateOptionsMenu();\\n }\\n }\",\n \"public boolean onQueryTextSubmit(String query) {\\n Intent i=new Intent(getApplicationContext(),SearchActivity.class);\\n i.putExtra(\\\"search-key\\\",query);\\n\\n startActivity(i);\\n searchView.setQuery(\\\"\\\", false);\\n searchView.setIconified(true);\\n return false;\\n\\n\\n }\",\n \"private void createSearchDialog() {\\n final Dialog dialog = new Dialog(this);\\n dialog.requestWindowFeature(Window.FEATURE_NO_TITLE);\\n dialog.setContentView(R.layout.search);\\n Window window = dialog.getWindow();\\n //window.setLayout(mWidth/2, mHeight/2);\\n window.setLayout(WindowManager.LayoutParams.WRAP_CONTENT, WindowManager.LayoutParams.WRAP_CONTENT);\\n\\n dialog.setTitle(getString(R.string.search));\\n /**Search*/\\n Button btnSearch = (Button) dialog.findViewById(R.id.search);\\n final EditText txtSearch = (EditText) dialog.findViewById(R.id.txtSearch);\\n txtSearch.setOnKeyListener(new View.OnKeyListener() {\\n @Override\\n public boolean onKey(View view, int i, KeyEvent keyEvent) {\\n if (i == KeyEvent.KEYCODE_ENTER) {\\n diaryFragment.search(txtSearch.getText().toString());\\n\\n dialog.dismiss();\\n }\\n return false;\\n }\\n });\\n\\n btnSearch.setOnClickListener(new View.OnClickListener() {\\n @Override\\n public void onClick(View v) {\\n diaryFragment.search(txtSearch.getText().toString());\\n dialog.dismiss();\\n }\\n });\\n\\n\\n dialog.show();\\n }\",\n \"@Override\\n\\t\\t\\tpublic void onClick(View arg0)\\n\\t\\t\\t{\\n\\t\\t\\t\\tintent.setClass(SearchView.this.getActivity(),\\n\\t\\t\\t\\t\\t\\tSearchResultActivity.class);\\n\\t\\t\\t\\tintent.putExtra(\\\"selection\\\", search_info.getText().toString());\\n\\t\\t\\t\\tSearchView.this.startActivity(intent);\\n\\n\\t\\t\\t}\",\n \"private void closeSearch() {\\n if (mIsSearchMode && mSearchMenuItem != null) {\\n SearchView searchView = (SearchView) mSearchMenuItem.getActionView();\\n EditText editText = searchView.findViewById(android.support.v7.appcompat.R.id.search_src_text);\\n if (editText.isFocused()) {\\n editText.onEditorAction(EditorInfo.IME_ACTION_SEARCH);\\n }\\n }\\n }\",\n \"@Override\\n public void onSearchConfirmed(CharSequence text) {\\n if (text!=null) {\\n adapter.stopListening();\\n StartSearch(text);\\n searchAdapter.startListening();\\n }\\n }\",\n \"private void initSearchView() {\\n SearchManager searchManager = (SearchManager) getActivity().getSystemService(Context.SEARCH_SERVICE);\\n\\n searchView.setSearchableInfo(searchManager.getSearchableInfo(getActivity().getComponentName()));\\n searchView.setMaxWidth(Integer.MAX_VALUE);\\n\\n //listening to search query text change\\n searchView.setOnQueryTextListener(new SearchView.OnQueryTextListener() {\\n @Override\\n public boolean onQueryTextSubmit(String query) {\\n // filter recycler view when query submitted\\n machineAdapter.getFilter().filter(query);\\n return false;\\n }\\n\\n @Override\\n public boolean onQueryTextChange(String newText) {\\n machineAdapter.getFilter().filter(newText);\\n return false;\\n }\\n });\\n\\n }\",\n \"public void onSearchSubmit(String queryTerm);\",\n \"public void initialiseSearchView() {\\n text.addTextChangedListener(new TextWatcher() {\\n @Override\\n public void beforeTextChanged(CharSequence s, int start, int count, int after) {\\n // do nothing\\n }\\n\\n @Override\\n public void onTextChanged(CharSequence s, int start, int before, int count) {\\n if (count > 0) {\\n clearButton.setVisibility(View.VISIBLE);\\n } else {\\n clearButton.setVisibility(View.GONE);\\n }\\n searchHandler.apply(s.toString());\\n }\\n\\n @Override\\n public void afterTextChanged(Editable s) {\\n // do nothing\\n }\\n });\\n text.setOnEditorActionListener(new TextView.OnEditorActionListener() {\\n @Override\\n public boolean onEditorAction(TextView v, int actionId, KeyEvent event) {\\n if (actionId == EditorInfo.IME_ACTION_SEARCH) {\\n //Still perform a search operation, then hide keyboard & search bar\\n searchHandler.apply(v.getText().toString());\\n hideSearchBar();\\n return true;\\n }\\n return false;\\n }\\n });\\n\\n clearButton.setOnClickListener(new View.OnClickListener() {\\n @Override\\n public void onClick(View v) {\\n text.setText(\\\"\\\");\\n }\\n });\\n\\n closeButton.setOnClickListener(new View.OnClickListener() {\\n @Override\\n public void onClick(View v) {\\n hideSearchBar();\\n }\\n });\\n\\n clearButton.setVisibility(View.GONE);\\n hideSearchBar();\\n }\",\n \"@Override\\n public boolean onCreateOptionsMenu(final Menu menu) {\\n getMenuInflater().inflate(R.menu.menu_main, menu);\\n SearchManager searchManager = (SearchManager) getSystemService(Context.SEARCH_SERVICE);\\n mSearchView = (SearchView) menu.findItem(R.id.action_search).getActionView();\\n mSearchView.setSearchableInfo(searchManager.getSearchableInfo(getComponentName()));\\n mSearchView.setQueryHint(\\\"Nhập từ tìm kiếm\\\");\\n\\n EditText searchPlate = ((EditText) mSearchView.findViewById(R.id.search_src_text));\\n searchPlate.setBackgroundResource(R.drawable.underlinetheme_edit_text_holo_light);\\n searchPlate.setImeOptions(EditorInfo.IME_ACTION_SEARCH);\\n searchPlate.setTextColor(getResources().getColor(R.color.textColorPrimary));\\n\\n mSearchView.setOnQueryTextListener(new SearchView.OnQueryTextListener() {\\n @Override\\n public boolean onQueryTextSubmit(String query) {\\n Seach(query);\\n return false;\\n }\\n\\n @Override\\n public boolean onQueryTextChange(String newText) {\\n return false;\\n }\\n });\\n\\n mTVTitle.setOnClickListener(new View.OnClickListener() {\\n @Override\\n public void onClick(View view) {\\n mSearchView.setIconified(false);\\n MenuItemCompat.expandActionView(menu.findItem(R.id.action_search));\\n mSearchView.requestFocus();\\n InputMethodManager lManager = (InputMethodManager) getSystemService(Context.INPUT_METHOD_SERVICE);\\n lManager.showSoftInput(mSearchView, 0);\\n }\\n });\\n\\n return true;\\n }\",\n \"@Override\\n\\tpublic void startActivity(Intent intent) {\\n\\t if (Intent.ACTION_SEARCH.equals(intent.getAction())) {\\n\\t intent.putExtra(\\\"ACTIVE_VIEW_PAGE\\\", mPager.getCurrentItem());\\n\\t }\\n\\t super.startActivity(intent);\\n\\t}\",\n \"public insearch() {\\n initComponents();\\n }\",\n \"@Override\\n \\t\\t\\t\\tpublic void onClick(View v) {\\n \\t\\t\\t\\t\\tEditText searchBar = (EditText) findViewById(R.id.search_bar);\\n \\t\\t\\t\\t\\tif(searchBar.getText().equals(\\\"\\\"))\\n \\t\\t\\t\\t\\t{\\n \\t\\t\\t\\t\\t\\tsearchBar.setText(\\\"Please enter nonempty query\\\");\\n \\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\telse\\n \\t\\t\\t\\t\\t{\\n \\t\\t\\t\\t\\t\\tsearchGuide(searchBar, true);\\n \\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t}\",\n \"@Override\\n \\t\\t\\t\\tpublic void onClick(View v) {\\n \\t\\t\\t\\t\\tEditText searchBar = (EditText) findViewById(R.id.search_bar);\\n \\t\\t\\t\\t\\tif(searchBar.getText().equals(\\\"\\\"))\\n \\t\\t\\t\\t\\t{\\n \\t\\t\\t\\t\\t\\tsearchBar.setText(\\\"Please enter nonempty query\\\");\\n \\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\telse\\n \\t\\t\\t\\t\\t{\\n \\t\\t\\t\\t\\t\\tsearchGuide(searchBar, false);\\n \\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t}\",\n \"public void search() {\\n }\",\n \"HasClickHandlers getSearchButton();\",\n \"void searchView(String name);\",\n \"public void onClickSearch (View v)\\n{\\n startActivity (new Intent(getApplicationContext(), SearchActivity.class));\\n}\",\n \"private void search(ActionEvent x) {\\n\\t\\tString text = this.searchText.getText();\\n\\t\\tif (text.equals(\\\"\\\")) {\\n\\t\\t\\tupdate();\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tboolean flag = false;\\n\\t\\tfor (Project p : INSTANCE.getProjects()) {\\n\\t\\t\\tif (p.getName().indexOf(text) != -1) {\\n\\t\\t\\t\\tif (!flag) {\\n\\t\\t\\t\\t\\tthis.projects.clear();\\n\\t\\t\\t\\t\\tflag = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tthis.projects.addElement(p);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif (!flag) {\\n\\t\\t\\tINSTANCE.getCurrentUser().sendNotification(new Notification((Object) INSTANCE, \\\"No results\\\"));\\n\\t\\t\\tthis.searchText.setText(\\\"\\\");\\n\\t\\t}\\n\\t}\",\n \"@Optional\\r\\n @OnClick(R.id.recipe_search_more)\\r\\n void searchMore() {\\n Intent intent = new Intent(this, ActivitySearch.class);\\r\\n\\r\\n // Retrieve the user-added search term\\r\\n String searchTerm = mSearchView != null ? mSearchView.getText().toString() : null;\\r\\n\\r\\n if (searchTerm != null && !searchTerm.trim().isEmpty()) {\\r\\n // Pass the search term as an extra within the Intent\\r\\n intent.putExtra(ActivitySearch.SEARCH_TERM, searchTerm);\\r\\n // Start ActivitySearch with the Bundle\\r\\n startActivity(intent);\\r\\n }\\r\\n }\",\n \"public Result clickSearch() {\\n\\t\\tthis.searchButton.click();\\r\\n\\t\\treturn new Result(driver);\\r\\n\\t}\",\n \"@Override\\n public void onClick(View view) {\\n Intent searchIntent = SearchActivity.newIntent(getApplicationContext());\\n startActivity(searchIntent);\\n }\",\n \"public void actionPerformed(ActionEvent e)\\n\\t{\\n\\t\\tWindowController.searchFor();\\n\\t}\",\n \"public void search(View v) {\\n\\t\\tIntent intent = new Intent(RootMenuActivity.this, SearchActivity.class);\\n\\t\\tintent.setFlags(Intent.FLAG_ACTIVITY_CLEAR_TOP);\\n\\t\\tstartActivity(intent);\\n\\t}\",\n \"@Override\\r\\npublic String popupSearch(String criteria) {\\n\\treturn null;\\r\\n}\",\n \"protected abstract void onSearch(AjaxRequestTarget target, String searchString);\",\n \"private void loadSearchResults(SearchRequest request) {\\n showProgress(null, \\\"Loading search results...\\\");\\n\\n String authToken = ShPrefManager.with(getActivity()).getToken();\\n RestClient.getAPI().search(authToken, request, new RestCallback<SearchResponse>() {\\n @Override\\n public void failure(RestError restError) {\\n hideProgress();\\n OpenHomeUtils.showToast(getActivity().getApplicationContext(), restError.getErrorMessage(), Toast.LENGTH_LONG);\\n }\\n\\n @Override\\n public void success(SearchResponse searchResponse, Response response) {\\n hideProgress();\\n if (searchResponse.getMessage().size() > 0) {\\n propertyList = searchResponse.getMessage();\\n String userId = ShPrefManager.with(getActivity()).getUserId();\\n searchAdapter = new SearchAdapter(getActivity(), propertyList, userId, 'S');\\n mRecyclerView.setAdapter(searchAdapter);\\n currentAdapter = \\\"S\\\";\\n //displayingNowTextView.setText(\\\"Searching \\\\\\\"\\\" + searchText + \\\"\\\\\\\"\\\");\\n searchBack.setVisibility(View.VISIBLE);\\n InputMethodManager imm = (InputMethodManager) getActivity().getSystemService(Context.INPUT_METHOD_SERVICE);\\n imm.hideSoftInputFromWindow(getActivity().getWindow().getCurrentFocus().getWindowToken(), 0);\\n locationLayout.setVisibility(View.VISIBLE);\\n refineLayout.setVisibility(View.GONE);\\n } else {\\n String message = \\\"No results to display. Please modify the search criteria and try again.\\\";\\n CustomDialogFragment regSuccessDialogFragment = CustomDialogFragment.newInstance(R.string.try_again,\\n message, ApplicationConstants.BUTTON_OK, 0);\\n regSuccessDialogFragment.show(getActivity().getFragmentManager(), \\\"SearchResultsFragment\\\");\\n }\\n }\\n });\\n }\",\n \"public void searchByUser(View v){\\n if(connection.isOnline(this)){\\n new SearchByUserAsync().execute();\\n }\\n hideFABToolbar(new View(getApplicationContext()));\\n }\",\n \"private void showSearchProgressDialog(){\\n\\n searchButton.setEnabled(false);\\n\\n if(searchDialogFragment == null){\\n searchDialogFragment = new SearchIndicatorDialogFragment();\\n\\n searchDialogFragment.setOnDialogDismissedListener(new GoogleApiHelper.OnDialogDismissedListener() {\\n @Override\\n public void onDialogDismissed() {\\n cancelSearch = true;\\n Log.d(TAG, \\\"Requesting Search cancellation on Search Progress dialog dismissal\\\");\\n EventBus.getDefault().postSticky(new SearchService.CancelSearchEvent(SearchService.SEARCH_TUTORS));\\n // Try cancelling the search\\n }\\n });\\n\\n }\\n\\n searchDialogFragment.show(getFragmentManager(), SearchIndicatorDialogFragment.FRAGMENT_TAG);\\n\\n /*if(searchProgressDialog == null){\\n searchProgressDialog = new ProgressDialog(getContext());\\n searchProgressDialog.setIndeterminate(true);\\n searchProgressDialog.setCancelable(true);\\n searchProgressDialog.setOnCancelListener(new DialogInterface.OnCancelListener() {\\n @Override\\n public void onCancel(DialogInterface dialog) {\\n cancelSearch = true;\\n Log.d(TAG, \\\"Requesting Search cancellation on Search Progress dialog dismissal\\\");\\n EventBus.getDefault().postSticky(new SearchService.CancelSearchEvent(SearchService.SEARCH_TUTORS));\\n // Try cancelling the search\\n }\\n });\\n }\\n if(!searchProgressDialog.isShowing()){\\n Log.d(TAG, \\\"Showing the search progress dialog...\\\");\\n searchProgressDialog.show();\\n }*/\\n }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7989228","0.7910262","0.7769844","0.73507464","0.73413974","0.7294327","0.71806633","0.71806633","0.71806633","0.7038335","0.7034937","0.69995964","0.6996985","0.6989908","0.69595814","0.687179","0.6866483","0.68489724","0.6845614","0.6845614","0.6844604","0.6836388","0.68291616","0.6790578","0.6776899","0.6760935","0.67510927","0.6687629","0.6676578","0.6662303","0.6640095","0.6625616","0.6613249","0.6612038","0.6567544","0.6560993","0.65544945","0.6542972","0.65381074","0.6526743","0.6522501","0.6508199","0.65048647","0.650364","0.64812833","0.6478143","0.6465713","0.6459569","0.6452519","0.6448567","0.6432856","0.6431174","0.64294577","0.6366891","0.63643885","0.6356426","0.63279694","0.631194","0.6305896","0.6304115","0.6296284","0.62917095","0.6287126","0.626881","0.6264209","0.6258809","0.62528074","0.6245273","0.6238721","0.6226","0.62109745","0.6210263","0.62098783","0.6209237","0.6208013","0.62073106","0.6204237","0.6201382","0.6200129","0.61955273","0.6194432","0.61878645","0.61788917","0.6173987","0.6171554","0.616991","0.616894","0.6168405","0.6158404","0.6155715","0.6147021","0.6135541","0.6135349","0.6134508","0.6126282","0.6114759","0.61076885","0.61047834","0.6101539","0.60970044"],"string":"[\n \"0.7989228\",\n \"0.7910262\",\n \"0.7769844\",\n \"0.73507464\",\n \"0.73413974\",\n \"0.7294327\",\n \"0.71806633\",\n \"0.71806633\",\n \"0.71806633\",\n \"0.7038335\",\n \"0.7034937\",\n \"0.69995964\",\n \"0.6996985\",\n \"0.6989908\",\n \"0.69595814\",\n \"0.687179\",\n \"0.6866483\",\n \"0.68489724\",\n \"0.6845614\",\n \"0.6845614\",\n \"0.6844604\",\n \"0.6836388\",\n \"0.68291616\",\n \"0.6790578\",\n \"0.6776899\",\n \"0.6760935\",\n \"0.67510927\",\n \"0.6687629\",\n \"0.6676578\",\n \"0.6662303\",\n \"0.6640095\",\n \"0.6625616\",\n \"0.6613249\",\n \"0.6612038\",\n \"0.6567544\",\n \"0.6560993\",\n \"0.65544945\",\n \"0.6542972\",\n \"0.65381074\",\n \"0.6526743\",\n \"0.6522501\",\n \"0.6508199\",\n \"0.65048647\",\n \"0.650364\",\n \"0.64812833\",\n \"0.6478143\",\n \"0.6465713\",\n \"0.6459569\",\n \"0.6452519\",\n \"0.6448567\",\n \"0.6432856\",\n \"0.6431174\",\n \"0.64294577\",\n \"0.6366891\",\n \"0.63643885\",\n \"0.6356426\",\n \"0.63279694\",\n \"0.631194\",\n \"0.6305896\",\n \"0.6304115\",\n \"0.6296284\",\n \"0.62917095\",\n \"0.6287126\",\n \"0.626881\",\n \"0.6264209\",\n \"0.6258809\",\n \"0.62528074\",\n \"0.6245273\",\n \"0.6238721\",\n \"0.6226\",\n \"0.62109745\",\n \"0.6210263\",\n \"0.62098783\",\n \"0.6209237\",\n \"0.6208013\",\n \"0.62073106\",\n \"0.6204237\",\n \"0.6201382\",\n \"0.6200129\",\n \"0.61955273\",\n \"0.6194432\",\n \"0.61878645\",\n \"0.61788917\",\n \"0.6173987\",\n \"0.6171554\",\n \"0.616991\",\n \"0.616894\",\n \"0.6168405\",\n \"0.6158404\",\n \"0.6155715\",\n \"0.6147021\",\n \"0.6135541\",\n \"0.6135349\",\n \"0.6134508\",\n \"0.6126282\",\n \"0.6114759\",\n \"0.61076885\",\n \"0.61047834\",\n \"0.6101539\",\n \"0.60970044\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.7339387"},"document_rank":{"kind":"string","value":"5"}}},{"rowIdx":38199,"cells":{"query":{"kind":"string","value":"searchView.cancelPendingInputEvents(); searchView = null;"},"document":{"kind":"string","value":"@Override\n protected void onDestroy() {\n closeSearchView();\n super.onDestroy();\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 onDestroyView() {\n super.onDestroyView();\n notifyOnFinishSearchDialog();\n hideSoftKeyboard();\n unbinder.unbind();\n }","@Override\n public void onSearchCleared() {\n }","void unsetSearchWindowStart();","void unsetSearchWindowEnd();","@Override\n public void onClick(View view) {\n InputMethodManager imm = (InputMethodManager) context.getSystemService(Context.INPUT_METHOD_SERVICE);\n imm.hideSoftInputFromWindow(gridsearchbar.getWindowToken(), 0);\n //launch_search(searchTextG.getText().toString());\n gridhomecontainer.setVisibility(View.VISIBLE);\n gridsearchbar.setVisibility(View.INVISIBLE);\n searchTextG.setText(\"\");\n }","@Override\n public void onResume() {\n super.onResume();\n searchview.setFocusable(false);\n }","@Override\n public void onClick(View v) {\n searchET.setText(\"\");\n //hide keyboard\n Utils.hideKeyboard(getActivity());\n }","@Override\n public void onClick(View view) {\n InputMethodManager imm = (InputMethodManager)context.getSystemService(Context.INPUT_METHOD_SERVICE);\n imm.hideSoftInputFromWindow(homesearchbar.getWindowToken(), 0);\n // launch_search(searchText.getText().toString());\n homecontainer.setVisibility(View.VISIBLE);\n homesearchbar.setVisibility(View.INVISIBLE);\n searchText.setText(\"\");\n }","public void clearSearch(){\n search.clear();\n }","public void onDestroy() {\n super.onDestroy();\n this.mSearchView.setOnQueryTextListener(null);\n }","public void disposeSearchView() {\r\n\t\tif(customerSearchView != null) {\r\n\t\t\tcustomerSearchView.setVisible(false);\r\n\t\t\tApplicationMaster.removeScreen(customerSearchView);\r\n\r\n\t\t\tcustomerSearchView.destroy();\r\n\t\t\tcustomerSearchView = null;\r\n\t\t} \r\n\t}","void requestSearchViewFocus();","@Override\n public boolean onQueryTextSubmit(String query) {\n InputMethodManager imm = (InputMethodManager)mSearchView.getContext().getSystemService(Context.INPUT_METHOD_SERVICE);\n imm.hideSoftInputFromWindow(mSearchView.getWindowToken(), 0);\n return true;\n }","public void clearSearchInput() {\n if (filterable != null && JQMCommon.isFilterableReady(filterable)) {\n clearInput(filterable);\n }\n }","public /* synthetic */ void lambda$new$0(View view) {\n this.searchEditText.setText(\"\");\n AndroidUtilities.showKeyboard(this.searchEditText);\n }","@FXML\r\n void ClickSearchField(MouseEvent event) {\r\n SearchScriptField.clear();\r\n }","@Override\n public boolean onQueryTextSubmit(String query) {\n searchview.clearFocus();\n return false;\n }","@Override\n public boolean onEditorAction(TextView v, int actionId, KeyEvent event) {\n if (actionId == EditorInfo.IME_ACTION_SEARCH) {\n //Hide soft keyboard\n InputMethodManager imm = (InputMethodManager) MyApp.getContext().getSystemService(Context.INPUT_METHOD_SERVICE);\n imm.hideSoftInputFromWindow(edtSearch.getWindowToken(), 0);\n\n if (edtSearch.getText().toString().length() > 0)\n btnCancelSearch.setVisibility(View.VISIBLE);\n else\n btnCancelSearch.setVisibility(View.GONE);\n //searchItems();\n return true;\n }\n return false;\n }","private void closeSearch() {\n if (mIsSearchMode && mSearchMenuItem != null) {\n SearchView searchView = (SearchView) mSearchMenuItem.getActionView();\n EditText editText = searchView.findViewById(android.support.v7.appcompat.R.id.search_src_text);\n if (editText.isFocused()) {\n editText.onEditorAction(EditorInfo.IME_ACTION_SEARCH);\n }\n }\n }","public void resetSearchSelection() {\n this.quantSearchSelection = null;\n SelectionChanged(\"reset_quant_searching\");\n }","public void run() {\n\n if(progressDialog.isShowing()) {\n progressDialog.dismiss();\n }\n searchView.clearFocus();\n imageButtonBack.clearFocus();\n// getCurrentFocus().clearFocus();\n listStoryRecycle.setVisibility(View.VISIBLE);\n }","@Override\n public void onClick(View view) {\n if (view.getId() == R.id.button_search) {\n InputMethodManager inputMethodManager = (InputMethodManager) getActivity().getSystemService(INPUT_METHOD_SERVICE);\n inputMethodManager.hideSoftInputFromWindow(getActivity().getCurrentFocus().getWindowToken(), 0);\n //onClickSearchRecipe(view);\n AddRecipeBox(view);\n //loadBar.setVisibility(View.VISIBLE);\n }\n }","public void reset() {\n this.searchDone = false;\n this.taskForResize = null;\n }","@Override\n public void onClick(View view) {\n activity.searchAgain();\n }","void setNilSearchWindowEnd();","public void clearSearch() {\n searchParam = \"\";\n lazyModel = null;\n listRemotoFake = null;\n first = 0;\n rows = 10;\n }","@Override\n public void onSearchClosed() {\n Log.v(\"SearchBox\", \"onSearchOpened()\");\n }","public void initialiseSearchView() {\n text.addTextChangedListener(new TextWatcher() {\n @Override\n public void beforeTextChanged(CharSequence s, int start, int count, int after) {\n // do nothing\n }\n\n @Override\n public void onTextChanged(CharSequence s, int start, int before, int count) {\n if (count > 0) {\n clearButton.setVisibility(View.VISIBLE);\n } else {\n clearButton.setVisibility(View.GONE);\n }\n searchHandler.apply(s.toString());\n }\n\n @Override\n public void afterTextChanged(Editable s) {\n // do nothing\n }\n });\n text.setOnEditorActionListener(new TextView.OnEditorActionListener() {\n @Override\n public boolean onEditorAction(TextView v, int actionId, KeyEvent event) {\n if (actionId == EditorInfo.IME_ACTION_SEARCH) {\n //Still perform a search operation, then hide keyboard & search bar\n searchHandler.apply(v.getText().toString());\n hideSearchBar();\n return true;\n }\n return false;\n }\n });\n\n clearButton.setOnClickListener(new View.OnClickListener() {\n @Override\n public void onClick(View v) {\n text.setText(\"\");\n }\n });\n\n closeButton.setOnClickListener(new View.OnClickListener() {\n @Override\n public void onClick(View v) {\n hideSearchBar();\n }\n });\n\n clearButton.setVisibility(View.GONE);\n hideSearchBar();\n }","private void resetSearchAheadList() {\n if (!searchResultsData.isEmpty()) {\n searchResultsData.clear();\n searchAdapter.notifyDataSetChanged();\n }\n }","abstract void clearSearchResults();","public void onSearchStarted() {\n mActivity.invalidateOptionsMenu();\n }","public Builder clearSearchRequest() {\n if (searchRequestBuilder_ == null) {\n searchRequest_ = null;\n onChanged();\n } else {\n searchRequest_ = null;\n searchRequestBuilder_ = null;\n }\n\n return this;\n }","@Override\n\t\tpublic boolean onClose() {\n\t\t\tif (!TextUtils.isEmpty(mSearchView.getQuery())) {\n\t\t\t\tmSearchView.setQuery(null, true);\n\t\t\t}\n\t\t\tmOnSearchViewChangeListener.onSearchViewClose();\n\t\t\treturn true;\n\t\t}","public void onSearchExit();","@Override\r\n public boolean dispatchTouchEvent(MotionEvent event) {\n\r\n if (event.getAction() == MotionEvent.ACTION_DOWN) {\r\n View v = getCurrentFocus();\r\n if (v instanceof EditText) {\r\n Rect outRect = new Rect();\r\n v.getGlobalVisibleRect(outRect);\r\n if (!outRect.contains((int) event.getRawX(), (int) event.getRawY())) {\r\n v.clearFocus();\r\n InputMethodManager imm = (InputMethodManager) getSystemService(Context.INPUT_METHOD_SERVICE);\r\n imm.hideSoftInputFromWindow(v.getWindowToken(), 0);\r\n }\r\n }\r\n }\r\n return super.dispatchTouchEvent(event);\r\n }","@Override\n public boolean onCreateOptionsMenu(Menu menu) {\n getMenuInflater().inflate(R.menu.main, menu);\n MenuItem menuItem = menu.findItem(R.id.searchMenu);\n SearchView searchView = (SearchView) menuItem.getActionView();\n searchView.setOnQueryTextListener(new SearchView.OnQueryTextListener() {\n @Override\n public boolean onQueryTextSubmit(String s) {\n searchView.clearFocus();\n if (s != null){\n new SearchTask(MainActivity.this, MainActivity.this)\n .execute(s);\n }\n return false;\n }\n\n @Override\n public boolean onQueryTextChange(String s) {\n return false;\n }\n });\n return true;\n }","public void search(View view){\n userinput = (EditText) findViewById(R.id.userinput);\n String input = userinput.getText().toString();\n\n if (input.isEmpty()){\n Toast.makeText(this, \"Please enter a city\", Toast.LENGTH_LONG).show();\n }\n else{\n input = input.replace(\" \", \"+\");\n\n // hide the keyboard (altough only for a short time, looks cleaner than keeping keyboard visible)\n InputMethodManager imm = (InputMethodManager) getSystemService(Context.INPUT_METHOD_SERVICE);\n imm.hideSoftInputFromWindow(getCurrentFocus().getWindowToken(), 0);\n\n // create new Asynctasks, give context and user input as arguments\n new SnowAsynctasks(MainActivity.this, input).execute();\n }\n }","void stateRestored (Search search);","private void clearFind() {\n\t\tthis.currentFindResultPage = null;\n\t\tthis.currentFindResultNumber = null;\n \tthis.pagesView.setFindMode(false);\n\t\tthis.findButtonsLayout.setVisibility(View.GONE);\n }","public static void clearSearch() {\n searchQuery = null;\n numberOfAdults = 0;\n childAges = null;\n resetDates();\n FOUND_HOTELS.clear();\n selectedHotel = null;\n selectedRoom = null;\n EXTENDED_INFOS.clear();\n HOTEL_ROOMS.clear();\n IMAGE_DRAWABLES.clear();\n }","@Override\n\t\t\t\tpublic boolean onKey(View v, int keyCode, KeyEvent event) {\n\t\t\t\t\tLog.d(\"onKey\", \"keyCode=\"+keyCode);\n\t\t\t\t\tif(event.getAction() == KeyEvent.ACTION_UP && keyCode == KeyEvent.KEYCODE_ENTER){\n\t\t\t\t\t\tSearchLaorenbyName(tv_search_edit.getText().toString());\n\t\t InputMethodManager imm = (InputMethodManager) getSystemService(Context.INPUT_METHOD_SERVICE); \n\t\t if (imm != null) { \n\t\t imm.hideSoftInputFromWindow( \n\t\t \t\ttv_search_edit.getWindowToken(), 0); \n\t\t } \n\t\t tv_search_edit.clearFocus(); \n\t\t\t\t\t}\n\t\t\t\t\treturn true;\n\t\t\t\t}","public void dismissSuggestions() {\n if (mSearchResultsRecyclerView.getVisibility() == View.VISIBLE) {\n mSearchResultsRecyclerView.setVisibility(View.GONE);\n }\n }","@Override\n public void onBackPressed() {\n if (locationFound) {\n mEditSearch.setText(\"\");\n resetSearchAheadList();\n resetDoctorsList();\n } else {\n super.onBackPressed();\n }\n }","void hideSearch() {\r\n AccelerateDecelerateInterpolator interpolator = new AccelerateDecelerateInterpolator();\r\n\r\n // Setup the animation for mSearchView\r\n mSearchView.setPivotY(mSearchView.getHeight());\r\n ObjectAnimator searchAnim = ObjectAnimator.ofFloat(mSearchView, \"scaleY\", 1.0f, 0.0f);\r\n searchAnim.setDuration(100);\r\n searchAnim.addListener(new AnimatorListenerAdapter() {\r\n @Override\r\n public void onAnimationEnd(Animator animation) {\r\n // Set the visibility of the SearchView\r\n mSearchView.setVisibility(View.INVISIBLE);\r\n }\r\n });\r\n\r\n // Setup the animation for mTitle\r\n mTitle.setPivotY(mTitle.getHeight());\r\n ObjectAnimator titleAnim = ObjectAnimator.ofFloat(mTitle, \"scaleY\", 0.1f, 1.0f);\r\n searchAnim.setDuration(100);\r\n\r\n AnimatorSet animSet = new AnimatorSet();\r\n animSet.playSequentially(searchAnim, titleAnim);\r\n animSet.setInterpolator(interpolator);\r\n animSet.addListener(new AnimatorListenerAdapter() {\r\n @Override\r\n public void onAnimationStart(Animator animation) {\r\n // Hide the app title\r\n mTitle.setVisibility(View.VISIBLE);\r\n }\r\n });\r\n animSet.start();\r\n\r\n // Hide the SearchView and show the search icon\r\n mSearchIcon.setImageDrawable(ContextCompat.getDrawable(this, R.drawable.ic_menu_search));\r\n\r\n // Hide the Card allowing the user to search additional recipes online\r\n mSearchMore.setVisibility(View.GONE);\r\n\r\n if (mSearchListener != null) {\r\n // Reset the search filter\r\n mSearchView.setText(\"\");\r\n mSearchListener.onSearch(\"\");\r\n }\r\n\r\n // Hide the soft keyboard\r\n InputMethodManager imm = (InputMethodManager)getSystemService(Context.INPUT_METHOD_SERVICE);\r\n imm.hideSoftInputFromWindow(this.getCurrentFocus().getWindowToken(), 0);\r\n }","public Builder clearSearch() {\n if (searchBuilder_ == null) {\n if (inputSourceCase_ == 10) {\n inputSourceCase_ = 0;\n inputSource_ = null;\n onChanged();\n }\n } else {\n if (inputSourceCase_ == 10) {\n inputSourceCase_ = 0;\n inputSource_ = null;\n }\n searchBuilder_.clear();\n }\n return this;\n }","void removeFocus();","@Override\n public void onClick(View v) {\n Intent i = new Intent(search_bar_activity.this, MainActivity.class);\n i.setFlags(Intent.FLAG_ACTIVITY_CLEAR_TOP);\n startActivity(i);\n }","@Override\n\tpublic void onStop()\n\t{\n\t\tsuper.onStop();\n\t\tNaviWords.setSearchType(null);\t\n\t}","@Override\n protected void onPreExecute() {\n wordMatches.getMatches().clear();\n stateObservable.setValue(States.searching);\n }","@Override\n\t\t\tpublic void onClick(View v) {\n\t\t if(coop_search_et.getText().toString().isEmpty()){\n\t\t \t\n\t\t \tToast.makeText(activity, \"关键词不能为空\",Toast.LENGTH_SHORT).show();\n\t\t }\n\t\t \n\t\t else\n\t\t {\n\t\t \tkeyword = coop_search_et.getText().toString();\n\t\t \trequestData();\n\t\t \tInputMethodManager imm = (InputMethodManager)activity.\n\t\t\t getSystemService(Context.INPUT_METHOD_SERVICE);\n\t\t \timm.hideSoftInputFromWindow(v.getWindowToken(), InputMethodManager.HIDE_NOT_ALWAYS);\n\t\t }\n\t\t\t}","private void setupSearchView() {\r\n searchView = rootView.findViewById(R.id.search_view);\r\n searchView.setOnQueryTextListener(new SearchView.OnQueryTextListener() {\r\n private Timer timer = new Timer();\r\n\r\n /**\r\n * action lors de la soumission du texte\r\n * @param query le texte rentré par l'utilisateur dans le champs qui sert à rechercher un animé\r\n * @return un booléen\r\n */\r\n @Override\r\n public boolean onQueryTextSubmit(String query) {\r\n return false;\r\n }\r\n\r\n /**\r\n * action lorsque le texte du champs dédié à la recherche change\r\n * @param s le texte dans le champs dédié à la recherche\r\n * @return un booléen\r\n */\r\n @Override\r\n public boolean onQueryTextChange(final String s) {\r\n if (s.length() == 0) {\r\n animeSearchViewModel.cancelSubscription();\r\n } else {\r\n timer.cancel();\r\n timer = new Timer();\r\n int sleep = 350;\r\n if (s.length() == 1)\r\n sleep = 5000;\r\n else if (s.length() <= 3)\r\n sleep = 300;\r\n else if (s.length() <= 5)\r\n sleep = 200;\r\n timer.schedule(new TimerTask() {\r\n @Override\r\n public void run() {\r\n animeSearchViewModel.searchAnimes(s);\r\n }\r\n }, sleep);\r\n }\r\n return true;\r\n }\r\n });\r\n }","@Override\n public boolean onQueryTextChange(String newText) {\n currentSearchData = new ArrayList<String>();\n getCurrentSearchData(newText);\n RelativeLayout searchDataRelativeView = (RelativeLayout) findViewById(R.id.search_relative_view);\n searchDataRelativeView.setOnClickListener(new View.OnClickListener() {\n @Override\n public void onClick(View v) {\n\n\n }\n });\n showCurrentData();\n System.out.println(\"\");\n return false;\n }","protected void onSearchExit() {\n if ((mListContext != null) && mListContext.isSearch()) {\n mActivity.finish();\n } else {\n // Re show the search icon.\n mActivity.invalidateOptionsMenu();\n }\n }","@Override\n public boolean onQueryTextSubmit(String query) {\n searchQueryToRestore = query;\n // update the state variable\n searchQueryIsSubmitted = true;\n // remove focus from SearchView\n rootLayout.requestFocus();\n return false;\n }","private void clear(AutoCompleteTextView view) {\n view.setText(\"\");\n }","@Override\n\t\t\tpublic void mouseClicked(MouseEvent e) {\n\t\t\t\tnew Search();\n\t\t\t\tdispose(); // 해당 프레임만 사라짐\n\t\t\t}","public void clearFields(View view){\n searchTermField.setText(\"\");\n urlField.setText(\"\");\n }","public void ClearSearch(){\n \n SearchTF.setText(\"\");\n jComboBox1.setSelectedIndex(0);\n }","@Override\n \t\t\t\tpublic void onClick(View v) {\n \t\t\t\t\tEditText searchBar = (EditText) findViewById(R.id.search_bar);\n \t\t\t\t\tif(searchBar.getText().equals(\"\"))\n \t\t\t\t\t{\n \t\t\t\t\t\tsearchBar.setText(\"Please enter nonempty query\");\n \t\t\t\t\t}\n \t\t\t\t\telse\n \t\t\t\t\t{\n \t\t\t\t\t\tsearchGuide(searchBar, false);\n \t\t\t\t\t}\n \t\t\t\t}","@Override\n public void run() {\n InputMethodManager inputMethodManager = (InputMethodManager) mSearchEditText\n .getContext().getSystemService(INPUT_METHOD_SERVICE);\n inputMethodManager.showSoftInput(mSearchEditText, 0);\n mSearchEditText.setFocusableInTouchMode(true);\n\n }","@Override\r\n public void onAnimationEnd(Animator animation) {\n mSearchView.setVisibility(View.INVISIBLE);\r\n }","@OnClick({ R.id.scrim, R.id.searchback }) protected void dismiss() {\n searchBackContainer.animate()\n .translationX(searchBackDistanceX)\n .setDuration(600L)\n .setInterpolator(\n AnimationUtils.loadInterpolator(this, android.R.interpolator.fast_out_slow_in))\n .setListener(new AnimatorListenerAdapter() {\n @Override public void onAnimationEnd(Animator animation) {\n finishAfterTransition();\n }\n })\n .start();\n // transform from back icon to search icon\n AnimatedVectorDrawable backToSearch =\n (AnimatedVectorDrawable) ContextCompat.getDrawable(this, R.drawable.avd_back_to_search);\n searchBack.setImageDrawable(backToSearch);\n // clear the background else the touch ripple moves with the translation which looks bad\n searchBack.setBackground(null);\n backToSearch.start();\n // fade out the other search chrome\n searchView.animate()\n .alpha(0f)\n .setStartDelay(0L)\n .setDuration(120L)\n .setInterpolator(\n AnimationUtils.loadInterpolator(this, android.R.interpolator.fast_out_linear_in))\n .setListener(null)\n .start();\n searchBackground.animate()\n .alpha(0f)\n .setStartDelay(300L)\n .setDuration(160L)\n .setInterpolator(\n AnimationUtils.loadInterpolator(this, android.R.interpolator.fast_out_linear_in))\n .setListener(null)\n .start();\n if (searchToolbar.getZ() != 0f) {\n searchToolbar.animate()\n .z(0f)\n .setDuration(600L)\n .setInterpolator(\n AnimationUtils.loadInterpolator(this, android.R.interpolator.fast_out_linear_in))\n .start();\n }\n\n // if we're showing search results, circular hide them\n if (resultsContainer.getHeight() > 0) {\n Animator closeResults =\n ViewAnimationUtils.createCircularReveal(resultsContainer, searchIconCenterX, 0,\n (float) Math.hypot(searchIconCenterX, resultsContainer.getHeight()), 0f);\n closeResults.setDuration(500L);\n closeResults.setInterpolator(AnimationUtils.loadInterpolator(SearchActivity.this,\n android.R.interpolator.fast_out_slow_in));\n closeResults.addListener(new AnimatorListenerAdapter() {\n @Override public void onAnimationEnd(Animator animation) {\n resultsContainer.setVisibility(View.INVISIBLE);\n }\n });\n closeResults.start();\n }\n\n // fade out the scrim\n scrim.animate()\n .alpha(0f)\n .setDuration(400L)\n .setInterpolator(\n AnimationUtils.loadInterpolator(this, android.R.interpolator.fast_out_linear_in))\n .setListener(null)\n .start();\n }","private void initSearchView() {\n SearchManager searchManager = (SearchManager) getActivity().getSystemService(Context.SEARCH_SERVICE);\n\n searchView.setSearchableInfo(searchManager.getSearchableInfo(getActivity().getComponentName()));\n searchView.setMaxWidth(Integer.MAX_VALUE);\n\n //listening to search query text change\n searchView.setOnQueryTextListener(new SearchView.OnQueryTextListener() {\n @Override\n public boolean onQueryTextSubmit(String query) {\n // filter recycler view when query submitted\n machineAdapter.getFilter().filter(query);\n return false;\n }\n\n @Override\n public boolean onQueryTextChange(String newText) {\n machineAdapter.getFilter().filter(newText);\n return false;\n }\n });\n\n }","@Override\n \t\t\t\tpublic void onClick(View v) {\n \t\t\t\t\tEditText searchBar = (EditText) findViewById(R.id.search_bar);\n \t\t\t\t\tif(searchBar.getText().equals(\"\"))\n \t\t\t\t\t{\n \t\t\t\t\t\tsearchBar.setText(\"Please enter nonempty query\");\n \t\t\t\t\t}\n \t\t\t\t\telse\n \t\t\t\t\t{\n \t\t\t\t\t\tsearchGuide(searchBar, true);\n \t\t\t\t\t}\n \t\t\t\t}","public void closeSearchView() {\n if (!isSearchViewOpen) {\n return;\n }\n\n if (suggestionsAdapter.getCount() == 0) {\n // Suggestions section is empty(collapsed)\n // just close the SearchBar\n closeSearchBar();\n } else {\n // Suggestions section is expanded\n // Clear text, values, and focus.\n // closeSearchBar should be called after Suggestions section is collapsed\n suggestionsAdapter.clearData();\n collapsingSuggestions = true;\n }\n }","void resetFocus();","void resetFocus();","private void hideKeyboard() {\n\t\tInputMethodManager inputMgr = (InputMethodManager)getSystemService(Context.INPUT_METHOD_SERVICE);\n\t\tEditText editText = (EditText)findViewById(R.id.searchtext);\n\t\tinputMgr.hideSoftInputFromWindow(editText.getWindowToken(), 0);\t\t\n\t}","protected void onFocusLost()\n {\n ; // do nothing. \n }","public void onImageSearch(View v) {\n imageResults.clear();\n doGoogleImageSearch(0);\n }","@Override\n\tpublic void onBackPressed () {\n\t\tif (searchMode) {\n\t\t\ttoggleSearch();\n\t\t\treturn;\n\t\t}\n\t\tsuper.onBackPressed();\n\t}","private void clearTextInput() {\n\t\ttextInput.setText(\"\");\n\t}","protected void resetValue(ActionEvent ae) {\n\t\tsearchClassNameTextField.setText(\"\");\r\n\t}","public void onResetSearchBar(Widget newAttributeSearchWidget) {\n eventBus.resetAdvanceSearchTabs();\n view.getSearchContent().setText(null);\n this.newAttributeSearchWidget = newAttributeSearchWidget;\n }","@Override\n public void onFocusChange(View v, boolean hasFocus) { // if focus has changed\n if (!hasFocus) {\n InputMethodManager inputMethodManager = (InputMethodManager) getSystemService(Activity.INPUT_METHOD_SERVICE);\n inputMethodManager.hideSoftInputFromWindow(v.getWindowToken(), 0);\n }\n }","@Override\n public void onSearchConfirmed(CharSequence text) {\n if (text!=null) {\n adapter.stopListening();\n StartSearch(text);\n searchAdapter.startListening();\n }\n }","@Override\n\tprotected void onDestroy() {\n\t\tsuper.onDestroy();\n\t\t// mSearch.destroy();\n\t\tmPoiSearch.destroy();\n\n\t\tif (mCommonDialog != null)\n\t\t\tmCommonDialog.dismiss();\n\t\tif(mdealTask!=null){\n\t\t\tmdealTask.cancel(true);\n\t\t\tmdealTask=null;\n\t\t\t}\n\t}","public void actionPerformed(ActionEvent InputEvent)\r\n {\r\n performSearch();\r\n }","@Override\n public void onSearchTermChanged() {\n }","private void reset() {\n \t\tif (currentSuggestion != null) {\n \t\t\tsetPromptingOff(currentSuggestion.getReplacementString());\n \t\t} else {\n \t\t\tif (focused) {\n \t\t\t\tsetPromptingOff(\"\");\n \t\t\t} else {\n \t\t\t\tsetPromptingOn();\n \t\t\t}\n \t\t}\n \t\thideSuggestions();\n \t\tLogger.getLogger(VSuggestFieldWidget.class.getName()).info(\"Reset\");\n \t}","public final /* synthetic */ void lambda$initView$0$BaseSearchContactActivity(View view) {\n finish();\n }","@Override\n protected void onDestroy() {\n saveData();\n stopRepeatingDeletionSearch();\n super.onDestroy();\n }","public void resetAdapter() {\n\n // Hide ProgressBar\n mBinding.searchUserLayout.getUvm().hideProgress();\n\n // Cancel any pending searches\n mSearchHandler.removeCallbacksAndMessages(null);\n\n // Clear the Adapter\n mAdapter.clear();\n }","public Builder clearLocalSearchRequest() {\n if (localSearchRequestBuilder_ == null) {\n localSearchRequest_ = null;\n onChanged();\n } else {\n localSearchRequest_ = null;\n localSearchRequestBuilder_ = null;\n }\n\n return this;\n }","private void schowajKlawiature() {\n View view = this.getActivity().getCurrentFocus(); //inside a fragment you should use getActivity()\n if (view != null) {\n InputMethodManager imm = (InputMethodManager) getActivity().getSystemService(context.INPUT_METHOD_SERVICE);\n imm.hideSoftInputFromWindow(view.getWindowToken(), 0);\n }\n }","void endRangeSelection() {\n mRanger = null;\n }","@Override\n\t\t public boolean onQueryTextSubmit(String query) {\n\t\t \tcloseSearch();\n\t\t return false;\n\t\t }","public Builder clearSearchResponse() {\n if (searchResponseBuilder_ == null) {\n searchResponse_ = null;\n onChanged();\n } else {\n searchResponse_ = null;\n searchResponseBuilder_ = null;\n }\n\n return this;\n }","@Override\n public void onSearchConfirmed(CharSequence text) {\n startSearch(text);\n\n }","@Override\n public boolean dispatchTouchEvent(MotionEvent event) {\n if (event.getAction() == MotionEvent.ACTION_UP) {\n View v = getCurrentFocus();\n if (v instanceof EditText) {\n Rect outRect = new Rect();\n v.getGlobalVisibleRect(outRect);\n if (!outRect.contains((int)event.getRawX(), (int)event.getRawY())) {\n v.clearFocus();\n InputMethodManager imm =\n (InputMethodManager) getSystemService(Context.INPUT_METHOD_SERVICE);\n imm.hideSoftInputFromWindow(v.getWindowToken(), 0);\n }\n }\n }\n return super.dispatchTouchEvent(event);\n }","@FXML\r\n private void cancelAction(ActionEvent event) {\n integerProperty.set(-1);\r\n searchFieldComboBox.getSelectionModel().select(0);\r\n companiesComboBox.setText(\"\");\r\n actionsComboBox.setText(\"\");\r\n yearValue.setText(\"\");\r\n mounthValue.setText(\"\");\r\n dayValue.setText(\"\");\r\n valueText.setText(\"\");\r\n relationComboBox.getSelectionModel().select(0);\r\n searchFieldComboBox.requestFocus();\r\n event.consume();\r\n }","public void onClick(View v) {\n editText1.setInputType(InputType.TYPE_NULL);\n InputMethodManager mgr = (InputMethodManager) getSystemService(Context.INPUT_METHOD_SERVICE);\n mgr.hideSoftInputFromWindow(editText1.getWindowToken(),InputMethodManager.HIDE_IMPLICIT_ONLY);\n }","private void m125722q() {\n if (this.f88309g != null) {\n this.f88309g.removeAllViews();\n }\n }","public Builder clearSearchValue() {\n if (searchValueBuilder_ == null) {\n searchValue_ = null;\n onChanged();\n } else {\n searchValue_ = null;\n searchValueBuilder_ = null;\n }\n\n return this;\n }","private void clearButtons(){\n\t\t// remove-all saved search Buttons\n\t\tqueryTableLayout.removeAllViews();\n\t}","@Override\n public View onCreateView(LayoutInflater inflater, ViewGroup container,\n Bundle savedInstanceState) {\n mRecipeList = new ArrayList<>();\n rootView = inflater.inflate(R.layout.fragment_search, container, false);\n searchWindow = rootView.findViewById(R.id.searchWindow);\n searchResultView = rootView.findViewById(R.id.searchResult);\n searchWindow.requestFocus();\n searchWindow.setOnEditorActionListener(new TextView.OnEditorActionListener() {\n @Override\n public boolean onEditorAction(TextView v, int actionId,\n KeyEvent event) {\n if (event != null&& (event.getKeyCode() == KeyEvent.KEYCODE_ENTER)) {\n UIUtils.hideKeyboard(getActivity());\n // Must return true here to consume event\n return true;\n }\n return false;\n }\n });\n final RecipeItemAdapter recipeItemAdapter = new RecipeItemAdapter(mRecipeList, mListener);\n searchResultFinder = new SearchResultFinder(recipeItemAdapter, mRecipeList);\n searchResultView.setAdapter(recipeItemAdapter);\n searchResultView.setLayoutManager(new LinearLayoutManager(getActivity(),\n LinearLayoutCompat.VERTICAL, false));\n searchWindow.addTextChangedListener(new TextWatcher() {\n @Override\n public void beforeTextChanged(CharSequence s, int start, int count, int after) {\n }\n\n @Override\n public void onTextChanged(CharSequence s, int start, int before, int count) {\n String input = searchWindow.getText().toString();\n if (input.trim().isEmpty()) {\n mRecipeList.clear();\n recipeItemAdapter.notifyDataSetChanged();\n } else searchResultFinder.search(input);\n }\n\n @Override\n public void afterTextChanged(Editable s) {\n }\n });\n return rootView;\n }","public void resetVelden(View view){\n //sortSpinner.setSelection(0);\n activity.resetFilteredAdapterData(); // resets the data of the adapter in the parent activity.\n }","void unlockInputConnection() {\n if (proxyAdapterView == null) {\n return;\n }\n\n proxyAdapterView.setLocked(false);\n }","@Override\n public void onSearchConfirmed(CharSequence text) {\n startSearch(text);\n }","@Override\n\t\t public boolean onKey(View v, int keyCode, KeyEvent event) {\n\n\t\t Log.d(\"SEARCH\", \"Search onkey\");\n\t\t return false;\n\t\t }"],"string":"[\n \"@Override\\n public void onDestroyView() {\\n super.onDestroyView();\\n notifyOnFinishSearchDialog();\\n hideSoftKeyboard();\\n unbinder.unbind();\\n }\",\n \"@Override\\n public void onSearchCleared() {\\n }\",\n \"void unsetSearchWindowStart();\",\n \"void unsetSearchWindowEnd();\",\n \"@Override\\n public void onClick(View view) {\\n InputMethodManager imm = (InputMethodManager) context.getSystemService(Context.INPUT_METHOD_SERVICE);\\n imm.hideSoftInputFromWindow(gridsearchbar.getWindowToken(), 0);\\n //launch_search(searchTextG.getText().toString());\\n gridhomecontainer.setVisibility(View.VISIBLE);\\n gridsearchbar.setVisibility(View.INVISIBLE);\\n searchTextG.setText(\\\"\\\");\\n }\",\n \"@Override\\n public void onResume() {\\n super.onResume();\\n searchview.setFocusable(false);\\n }\",\n \"@Override\\n public void onClick(View v) {\\n searchET.setText(\\\"\\\");\\n //hide keyboard\\n Utils.hideKeyboard(getActivity());\\n }\",\n \"@Override\\n public void onClick(View view) {\\n InputMethodManager imm = (InputMethodManager)context.getSystemService(Context.INPUT_METHOD_SERVICE);\\n imm.hideSoftInputFromWindow(homesearchbar.getWindowToken(), 0);\\n // launch_search(searchText.getText().toString());\\n homecontainer.setVisibility(View.VISIBLE);\\n homesearchbar.setVisibility(View.INVISIBLE);\\n searchText.setText(\\\"\\\");\\n }\",\n \"public void clearSearch(){\\n search.clear();\\n }\",\n \"public void onDestroy() {\\n super.onDestroy();\\n this.mSearchView.setOnQueryTextListener(null);\\n }\",\n \"public void disposeSearchView() {\\r\\n\\t\\tif(customerSearchView != null) {\\r\\n\\t\\t\\tcustomerSearchView.setVisible(false);\\r\\n\\t\\t\\tApplicationMaster.removeScreen(customerSearchView);\\r\\n\\r\\n\\t\\t\\tcustomerSearchView.destroy();\\r\\n\\t\\t\\tcustomerSearchView = null;\\r\\n\\t\\t} \\r\\n\\t}\",\n \"void requestSearchViewFocus();\",\n \"@Override\\n public boolean onQueryTextSubmit(String query) {\\n InputMethodManager imm = (InputMethodManager)mSearchView.getContext().getSystemService(Context.INPUT_METHOD_SERVICE);\\n imm.hideSoftInputFromWindow(mSearchView.getWindowToken(), 0);\\n return true;\\n }\",\n \"public void clearSearchInput() {\\n if (filterable != null && JQMCommon.isFilterableReady(filterable)) {\\n clearInput(filterable);\\n }\\n }\",\n \"public /* synthetic */ void lambda$new$0(View view) {\\n this.searchEditText.setText(\\\"\\\");\\n AndroidUtilities.showKeyboard(this.searchEditText);\\n }\",\n \"@FXML\\r\\n void ClickSearchField(MouseEvent event) {\\r\\n SearchScriptField.clear();\\r\\n }\",\n \"@Override\\n public boolean onQueryTextSubmit(String query) {\\n searchview.clearFocus();\\n return false;\\n }\",\n \"@Override\\n public boolean onEditorAction(TextView v, int actionId, KeyEvent event) {\\n if (actionId == EditorInfo.IME_ACTION_SEARCH) {\\n //Hide soft keyboard\\n InputMethodManager imm = (InputMethodManager) MyApp.getContext().getSystemService(Context.INPUT_METHOD_SERVICE);\\n imm.hideSoftInputFromWindow(edtSearch.getWindowToken(), 0);\\n\\n if (edtSearch.getText().toString().length() > 0)\\n btnCancelSearch.setVisibility(View.VISIBLE);\\n else\\n btnCancelSearch.setVisibility(View.GONE);\\n //searchItems();\\n return true;\\n }\\n return false;\\n }\",\n \"private void closeSearch() {\\n if (mIsSearchMode && mSearchMenuItem != null) {\\n SearchView searchView = (SearchView) mSearchMenuItem.getActionView();\\n EditText editText = searchView.findViewById(android.support.v7.appcompat.R.id.search_src_text);\\n if (editText.isFocused()) {\\n editText.onEditorAction(EditorInfo.IME_ACTION_SEARCH);\\n }\\n }\\n }\",\n \"public void resetSearchSelection() {\\n this.quantSearchSelection = null;\\n SelectionChanged(\\\"reset_quant_searching\\\");\\n }\",\n \"public void run() {\\n\\n if(progressDialog.isShowing()) {\\n progressDialog.dismiss();\\n }\\n searchView.clearFocus();\\n imageButtonBack.clearFocus();\\n// getCurrentFocus().clearFocus();\\n listStoryRecycle.setVisibility(View.VISIBLE);\\n }\",\n \"@Override\\n public void onClick(View view) {\\n if (view.getId() == R.id.button_search) {\\n InputMethodManager inputMethodManager = (InputMethodManager) getActivity().getSystemService(INPUT_METHOD_SERVICE);\\n inputMethodManager.hideSoftInputFromWindow(getActivity().getCurrentFocus().getWindowToken(), 0);\\n //onClickSearchRecipe(view);\\n AddRecipeBox(view);\\n //loadBar.setVisibility(View.VISIBLE);\\n }\\n }\",\n \"public void reset() {\\n this.searchDone = false;\\n this.taskForResize = null;\\n }\",\n \"@Override\\n public void onClick(View view) {\\n activity.searchAgain();\\n }\",\n \"void setNilSearchWindowEnd();\",\n \"public void clearSearch() {\\n searchParam = \\\"\\\";\\n lazyModel = null;\\n listRemotoFake = null;\\n first = 0;\\n rows = 10;\\n }\",\n \"@Override\\n public void onSearchClosed() {\\n Log.v(\\\"SearchBox\\\", \\\"onSearchOpened()\\\");\\n }\",\n \"public void initialiseSearchView() {\\n text.addTextChangedListener(new TextWatcher() {\\n @Override\\n public void beforeTextChanged(CharSequence s, int start, int count, int after) {\\n // do nothing\\n }\\n\\n @Override\\n public void onTextChanged(CharSequence s, int start, int before, int count) {\\n if (count > 0) {\\n clearButton.setVisibility(View.VISIBLE);\\n } else {\\n clearButton.setVisibility(View.GONE);\\n }\\n searchHandler.apply(s.toString());\\n }\\n\\n @Override\\n public void afterTextChanged(Editable s) {\\n // do nothing\\n }\\n });\\n text.setOnEditorActionListener(new TextView.OnEditorActionListener() {\\n @Override\\n public boolean onEditorAction(TextView v, int actionId, KeyEvent event) {\\n if (actionId == EditorInfo.IME_ACTION_SEARCH) {\\n //Still perform a search operation, then hide keyboard & search bar\\n searchHandler.apply(v.getText().toString());\\n hideSearchBar();\\n return true;\\n }\\n return false;\\n }\\n });\\n\\n clearButton.setOnClickListener(new View.OnClickListener() {\\n @Override\\n public void onClick(View v) {\\n text.setText(\\\"\\\");\\n }\\n });\\n\\n closeButton.setOnClickListener(new View.OnClickListener() {\\n @Override\\n public void onClick(View v) {\\n hideSearchBar();\\n }\\n });\\n\\n clearButton.setVisibility(View.GONE);\\n hideSearchBar();\\n }\",\n \"private void resetSearchAheadList() {\\n if (!searchResultsData.isEmpty()) {\\n searchResultsData.clear();\\n searchAdapter.notifyDataSetChanged();\\n }\\n }\",\n \"abstract void clearSearchResults();\",\n \"public void onSearchStarted() {\\n mActivity.invalidateOptionsMenu();\\n }\",\n \"public Builder clearSearchRequest() {\\n if (searchRequestBuilder_ == null) {\\n searchRequest_ = null;\\n onChanged();\\n } else {\\n searchRequest_ = null;\\n searchRequestBuilder_ = null;\\n }\\n\\n return this;\\n }\",\n \"@Override\\n\\t\\tpublic boolean onClose() {\\n\\t\\t\\tif (!TextUtils.isEmpty(mSearchView.getQuery())) {\\n\\t\\t\\t\\tmSearchView.setQuery(null, true);\\n\\t\\t\\t}\\n\\t\\t\\tmOnSearchViewChangeListener.onSearchViewClose();\\n\\t\\t\\treturn true;\\n\\t\\t}\",\n \"public void onSearchExit();\",\n \"@Override\\r\\n public boolean dispatchTouchEvent(MotionEvent event) {\\n\\r\\n if (event.getAction() == MotionEvent.ACTION_DOWN) {\\r\\n View v = getCurrentFocus();\\r\\n if (v instanceof EditText) {\\r\\n Rect outRect = new Rect();\\r\\n v.getGlobalVisibleRect(outRect);\\r\\n if (!outRect.contains((int) event.getRawX(), (int) event.getRawY())) {\\r\\n v.clearFocus();\\r\\n InputMethodManager imm = (InputMethodManager) getSystemService(Context.INPUT_METHOD_SERVICE);\\r\\n imm.hideSoftInputFromWindow(v.getWindowToken(), 0);\\r\\n }\\r\\n }\\r\\n }\\r\\n return super.dispatchTouchEvent(event);\\r\\n }\",\n \"@Override\\n public boolean onCreateOptionsMenu(Menu menu) {\\n getMenuInflater().inflate(R.menu.main, menu);\\n MenuItem menuItem = menu.findItem(R.id.searchMenu);\\n SearchView searchView = (SearchView) menuItem.getActionView();\\n searchView.setOnQueryTextListener(new SearchView.OnQueryTextListener() {\\n @Override\\n public boolean onQueryTextSubmit(String s) {\\n searchView.clearFocus();\\n if (s != null){\\n new SearchTask(MainActivity.this, MainActivity.this)\\n .execute(s);\\n }\\n return false;\\n }\\n\\n @Override\\n public boolean onQueryTextChange(String s) {\\n return false;\\n }\\n });\\n return true;\\n }\",\n \"public void search(View view){\\n userinput = (EditText) findViewById(R.id.userinput);\\n String input = userinput.getText().toString();\\n\\n if (input.isEmpty()){\\n Toast.makeText(this, \\\"Please enter a city\\\", Toast.LENGTH_LONG).show();\\n }\\n else{\\n input = input.replace(\\\" \\\", \\\"+\\\");\\n\\n // hide the keyboard (altough only for a short time, looks cleaner than keeping keyboard visible)\\n InputMethodManager imm = (InputMethodManager) getSystemService(Context.INPUT_METHOD_SERVICE);\\n imm.hideSoftInputFromWindow(getCurrentFocus().getWindowToken(), 0);\\n\\n // create new Asynctasks, give context and user input as arguments\\n new SnowAsynctasks(MainActivity.this, input).execute();\\n }\\n }\",\n \"void stateRestored (Search search);\",\n \"private void clearFind() {\\n\\t\\tthis.currentFindResultPage = null;\\n\\t\\tthis.currentFindResultNumber = null;\\n \\tthis.pagesView.setFindMode(false);\\n\\t\\tthis.findButtonsLayout.setVisibility(View.GONE);\\n }\",\n \"public static void clearSearch() {\\n searchQuery = null;\\n numberOfAdults = 0;\\n childAges = null;\\n resetDates();\\n FOUND_HOTELS.clear();\\n selectedHotel = null;\\n selectedRoom = null;\\n EXTENDED_INFOS.clear();\\n HOTEL_ROOMS.clear();\\n IMAGE_DRAWABLES.clear();\\n }\",\n \"@Override\\n\\t\\t\\t\\tpublic boolean onKey(View v, int keyCode, KeyEvent event) {\\n\\t\\t\\t\\t\\tLog.d(\\\"onKey\\\", \\\"keyCode=\\\"+keyCode);\\n\\t\\t\\t\\t\\tif(event.getAction() == KeyEvent.ACTION_UP && keyCode == KeyEvent.KEYCODE_ENTER){\\n\\t\\t\\t\\t\\t\\tSearchLaorenbyName(tv_search_edit.getText().toString());\\n\\t\\t InputMethodManager imm = (InputMethodManager) getSystemService(Context.INPUT_METHOD_SERVICE); \\n\\t\\t if (imm != null) { \\n\\t\\t imm.hideSoftInputFromWindow( \\n\\t\\t \\t\\ttv_search_edit.getWindowToken(), 0); \\n\\t\\t } \\n\\t\\t tv_search_edit.clearFocus(); \\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\treturn true;\\n\\t\\t\\t\\t}\",\n \"public void dismissSuggestions() {\\n if (mSearchResultsRecyclerView.getVisibility() == View.VISIBLE) {\\n mSearchResultsRecyclerView.setVisibility(View.GONE);\\n }\\n }\",\n \"@Override\\n public void onBackPressed() {\\n if (locationFound) {\\n mEditSearch.setText(\\\"\\\");\\n resetSearchAheadList();\\n resetDoctorsList();\\n } else {\\n super.onBackPressed();\\n }\\n }\",\n \"void hideSearch() {\\r\\n AccelerateDecelerateInterpolator interpolator = new AccelerateDecelerateInterpolator();\\r\\n\\r\\n // Setup the animation for mSearchView\\r\\n mSearchView.setPivotY(mSearchView.getHeight());\\r\\n ObjectAnimator searchAnim = ObjectAnimator.ofFloat(mSearchView, \\\"scaleY\\\", 1.0f, 0.0f);\\r\\n searchAnim.setDuration(100);\\r\\n searchAnim.addListener(new AnimatorListenerAdapter() {\\r\\n @Override\\r\\n public void onAnimationEnd(Animator animation) {\\r\\n // Set the visibility of the SearchView\\r\\n mSearchView.setVisibility(View.INVISIBLE);\\r\\n }\\r\\n });\\r\\n\\r\\n // Setup the animation for mTitle\\r\\n mTitle.setPivotY(mTitle.getHeight());\\r\\n ObjectAnimator titleAnim = ObjectAnimator.ofFloat(mTitle, \\\"scaleY\\\", 0.1f, 1.0f);\\r\\n searchAnim.setDuration(100);\\r\\n\\r\\n AnimatorSet animSet = new AnimatorSet();\\r\\n animSet.playSequentially(searchAnim, titleAnim);\\r\\n animSet.setInterpolator(interpolator);\\r\\n animSet.addListener(new AnimatorListenerAdapter() {\\r\\n @Override\\r\\n public void onAnimationStart(Animator animation) {\\r\\n // Hide the app title\\r\\n mTitle.setVisibility(View.VISIBLE);\\r\\n }\\r\\n });\\r\\n animSet.start();\\r\\n\\r\\n // Hide the SearchView and show the search icon\\r\\n mSearchIcon.setImageDrawable(ContextCompat.getDrawable(this, R.drawable.ic_menu_search));\\r\\n\\r\\n // Hide the Card allowing the user to search additional recipes online\\r\\n mSearchMore.setVisibility(View.GONE);\\r\\n\\r\\n if (mSearchListener != null) {\\r\\n // Reset the search filter\\r\\n mSearchView.setText(\\\"\\\");\\r\\n mSearchListener.onSearch(\\\"\\\");\\r\\n }\\r\\n\\r\\n // Hide the soft keyboard\\r\\n InputMethodManager imm = (InputMethodManager)getSystemService(Context.INPUT_METHOD_SERVICE);\\r\\n imm.hideSoftInputFromWindow(this.getCurrentFocus().getWindowToken(), 0);\\r\\n }\",\n \"public Builder clearSearch() {\\n if (searchBuilder_ == null) {\\n if (inputSourceCase_ == 10) {\\n inputSourceCase_ = 0;\\n inputSource_ = null;\\n onChanged();\\n }\\n } else {\\n if (inputSourceCase_ == 10) {\\n inputSourceCase_ = 0;\\n inputSource_ = null;\\n }\\n searchBuilder_.clear();\\n }\\n return this;\\n }\",\n \"void removeFocus();\",\n \"@Override\\n public void onClick(View v) {\\n Intent i = new Intent(search_bar_activity.this, MainActivity.class);\\n i.setFlags(Intent.FLAG_ACTIVITY_CLEAR_TOP);\\n startActivity(i);\\n }\",\n \"@Override\\n\\tpublic void onStop()\\n\\t{\\n\\t\\tsuper.onStop();\\n\\t\\tNaviWords.setSearchType(null);\\t\\n\\t}\",\n \"@Override\\n protected void onPreExecute() {\\n wordMatches.getMatches().clear();\\n stateObservable.setValue(States.searching);\\n }\",\n \"@Override\\n\\t\\t\\tpublic void onClick(View v) {\\n\\t\\t if(coop_search_et.getText().toString().isEmpty()){\\n\\t\\t \\t\\n\\t\\t \\tToast.makeText(activity, \\\"关键词不能为空\\\",Toast.LENGTH_SHORT).show();\\n\\t\\t }\\n\\t\\t \\n\\t\\t else\\n\\t\\t {\\n\\t\\t \\tkeyword = coop_search_et.getText().toString();\\n\\t\\t \\trequestData();\\n\\t\\t \\tInputMethodManager imm = (InputMethodManager)activity.\\n\\t\\t\\t getSystemService(Context.INPUT_METHOD_SERVICE);\\n\\t\\t \\timm.hideSoftInputFromWindow(v.getWindowToken(), InputMethodManager.HIDE_NOT_ALWAYS);\\n\\t\\t }\\n\\t\\t\\t}\",\n \"private void setupSearchView() {\\r\\n searchView = rootView.findViewById(R.id.search_view);\\r\\n searchView.setOnQueryTextListener(new SearchView.OnQueryTextListener() {\\r\\n private Timer timer = new Timer();\\r\\n\\r\\n /**\\r\\n * action lors de la soumission du texte\\r\\n * @param query le texte rentré par l'utilisateur dans le champs qui sert à rechercher un animé\\r\\n * @return un booléen\\r\\n */\\r\\n @Override\\r\\n public boolean onQueryTextSubmit(String query) {\\r\\n return false;\\r\\n }\\r\\n\\r\\n /**\\r\\n * action lorsque le texte du champs dédié à la recherche change\\r\\n * @param s le texte dans le champs dédié à la recherche\\r\\n * @return un booléen\\r\\n */\\r\\n @Override\\r\\n public boolean onQueryTextChange(final String s) {\\r\\n if (s.length() == 0) {\\r\\n animeSearchViewModel.cancelSubscription();\\r\\n } else {\\r\\n timer.cancel();\\r\\n timer = new Timer();\\r\\n int sleep = 350;\\r\\n if (s.length() == 1)\\r\\n sleep = 5000;\\r\\n else if (s.length() <= 3)\\r\\n sleep = 300;\\r\\n else if (s.length() <= 5)\\r\\n sleep = 200;\\r\\n timer.schedule(new TimerTask() {\\r\\n @Override\\r\\n public void run() {\\r\\n animeSearchViewModel.searchAnimes(s);\\r\\n }\\r\\n }, sleep);\\r\\n }\\r\\n return true;\\r\\n }\\r\\n });\\r\\n }\",\n \"@Override\\n public boolean onQueryTextChange(String newText) {\\n currentSearchData = new ArrayList<String>();\\n getCurrentSearchData(newText);\\n RelativeLayout searchDataRelativeView = (RelativeLayout) findViewById(R.id.search_relative_view);\\n searchDataRelativeView.setOnClickListener(new View.OnClickListener() {\\n @Override\\n public void onClick(View v) {\\n\\n\\n }\\n });\\n showCurrentData();\\n System.out.println(\\\"\\\");\\n return false;\\n }\",\n \"protected void onSearchExit() {\\n if ((mListContext != null) && mListContext.isSearch()) {\\n mActivity.finish();\\n } else {\\n // Re show the search icon.\\n mActivity.invalidateOptionsMenu();\\n }\\n }\",\n \"@Override\\n public boolean onQueryTextSubmit(String query) {\\n searchQueryToRestore = query;\\n // update the state variable\\n searchQueryIsSubmitted = true;\\n // remove focus from SearchView\\n rootLayout.requestFocus();\\n return false;\\n }\",\n \"private void clear(AutoCompleteTextView view) {\\n view.setText(\\\"\\\");\\n }\",\n \"@Override\\n\\t\\t\\tpublic void mouseClicked(MouseEvent e) {\\n\\t\\t\\t\\tnew Search();\\n\\t\\t\\t\\tdispose(); // 해당 프레임만 사라짐\\n\\t\\t\\t}\",\n \"public void clearFields(View view){\\n searchTermField.setText(\\\"\\\");\\n urlField.setText(\\\"\\\");\\n }\",\n \"public void ClearSearch(){\\n \\n SearchTF.setText(\\\"\\\");\\n jComboBox1.setSelectedIndex(0);\\n }\",\n \"@Override\\n \\t\\t\\t\\tpublic void onClick(View v) {\\n \\t\\t\\t\\t\\tEditText searchBar = (EditText) findViewById(R.id.search_bar);\\n \\t\\t\\t\\t\\tif(searchBar.getText().equals(\\\"\\\"))\\n \\t\\t\\t\\t\\t{\\n \\t\\t\\t\\t\\t\\tsearchBar.setText(\\\"Please enter nonempty query\\\");\\n \\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\telse\\n \\t\\t\\t\\t\\t{\\n \\t\\t\\t\\t\\t\\tsearchGuide(searchBar, false);\\n \\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t}\",\n \"@Override\\n public void run() {\\n InputMethodManager inputMethodManager = (InputMethodManager) mSearchEditText\\n .getContext().getSystemService(INPUT_METHOD_SERVICE);\\n inputMethodManager.showSoftInput(mSearchEditText, 0);\\n mSearchEditText.setFocusableInTouchMode(true);\\n\\n }\",\n \"@Override\\r\\n public void onAnimationEnd(Animator animation) {\\n mSearchView.setVisibility(View.INVISIBLE);\\r\\n }\",\n \"@OnClick({ R.id.scrim, R.id.searchback }) protected void dismiss() {\\n searchBackContainer.animate()\\n .translationX(searchBackDistanceX)\\n .setDuration(600L)\\n .setInterpolator(\\n AnimationUtils.loadInterpolator(this, android.R.interpolator.fast_out_slow_in))\\n .setListener(new AnimatorListenerAdapter() {\\n @Override public void onAnimationEnd(Animator animation) {\\n finishAfterTransition();\\n }\\n })\\n .start();\\n // transform from back icon to search icon\\n AnimatedVectorDrawable backToSearch =\\n (AnimatedVectorDrawable) ContextCompat.getDrawable(this, R.drawable.avd_back_to_search);\\n searchBack.setImageDrawable(backToSearch);\\n // clear the background else the touch ripple moves with the translation which looks bad\\n searchBack.setBackground(null);\\n backToSearch.start();\\n // fade out the other search chrome\\n searchView.animate()\\n .alpha(0f)\\n .setStartDelay(0L)\\n .setDuration(120L)\\n .setInterpolator(\\n AnimationUtils.loadInterpolator(this, android.R.interpolator.fast_out_linear_in))\\n .setListener(null)\\n .start();\\n searchBackground.animate()\\n .alpha(0f)\\n .setStartDelay(300L)\\n .setDuration(160L)\\n .setInterpolator(\\n AnimationUtils.loadInterpolator(this, android.R.interpolator.fast_out_linear_in))\\n .setListener(null)\\n .start();\\n if (searchToolbar.getZ() != 0f) {\\n searchToolbar.animate()\\n .z(0f)\\n .setDuration(600L)\\n .setInterpolator(\\n AnimationUtils.loadInterpolator(this, android.R.interpolator.fast_out_linear_in))\\n .start();\\n }\\n\\n // if we're showing search results, circular hide them\\n if (resultsContainer.getHeight() > 0) {\\n Animator closeResults =\\n ViewAnimationUtils.createCircularReveal(resultsContainer, searchIconCenterX, 0,\\n (float) Math.hypot(searchIconCenterX, resultsContainer.getHeight()), 0f);\\n closeResults.setDuration(500L);\\n closeResults.setInterpolator(AnimationUtils.loadInterpolator(SearchActivity.this,\\n android.R.interpolator.fast_out_slow_in));\\n closeResults.addListener(new AnimatorListenerAdapter() {\\n @Override public void onAnimationEnd(Animator animation) {\\n resultsContainer.setVisibility(View.INVISIBLE);\\n }\\n });\\n closeResults.start();\\n }\\n\\n // fade out the scrim\\n scrim.animate()\\n .alpha(0f)\\n .setDuration(400L)\\n .setInterpolator(\\n AnimationUtils.loadInterpolator(this, android.R.interpolator.fast_out_linear_in))\\n .setListener(null)\\n .start();\\n }\",\n \"private void initSearchView() {\\n SearchManager searchManager = (SearchManager) getActivity().getSystemService(Context.SEARCH_SERVICE);\\n\\n searchView.setSearchableInfo(searchManager.getSearchableInfo(getActivity().getComponentName()));\\n searchView.setMaxWidth(Integer.MAX_VALUE);\\n\\n //listening to search query text change\\n searchView.setOnQueryTextListener(new SearchView.OnQueryTextListener() {\\n @Override\\n public boolean onQueryTextSubmit(String query) {\\n // filter recycler view when query submitted\\n machineAdapter.getFilter().filter(query);\\n return false;\\n }\\n\\n @Override\\n public boolean onQueryTextChange(String newText) {\\n machineAdapter.getFilter().filter(newText);\\n return false;\\n }\\n });\\n\\n }\",\n \"@Override\\n \\t\\t\\t\\tpublic void onClick(View v) {\\n \\t\\t\\t\\t\\tEditText searchBar = (EditText) findViewById(R.id.search_bar);\\n \\t\\t\\t\\t\\tif(searchBar.getText().equals(\\\"\\\"))\\n \\t\\t\\t\\t\\t{\\n \\t\\t\\t\\t\\t\\tsearchBar.setText(\\\"Please enter nonempty query\\\");\\n \\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t\\telse\\n \\t\\t\\t\\t\\t{\\n \\t\\t\\t\\t\\t\\tsearchGuide(searchBar, true);\\n \\t\\t\\t\\t\\t}\\n \\t\\t\\t\\t}\",\n \"public void closeSearchView() {\\n if (!isSearchViewOpen) {\\n return;\\n }\\n\\n if (suggestionsAdapter.getCount() == 0) {\\n // Suggestions section is empty(collapsed)\\n // just close the SearchBar\\n closeSearchBar();\\n } else {\\n // Suggestions section is expanded\\n // Clear text, values, and focus.\\n // closeSearchBar should be called after Suggestions section is collapsed\\n suggestionsAdapter.clearData();\\n collapsingSuggestions = true;\\n }\\n }\",\n \"void resetFocus();\",\n \"void resetFocus();\",\n \"private void hideKeyboard() {\\n\\t\\tInputMethodManager inputMgr = (InputMethodManager)getSystemService(Context.INPUT_METHOD_SERVICE);\\n\\t\\tEditText editText = (EditText)findViewById(R.id.searchtext);\\n\\t\\tinputMgr.hideSoftInputFromWindow(editText.getWindowToken(), 0);\\t\\t\\n\\t}\",\n \"protected void onFocusLost()\\n {\\n ; // do nothing. \\n }\",\n \"public void onImageSearch(View v) {\\n imageResults.clear();\\n doGoogleImageSearch(0);\\n }\",\n \"@Override\\n\\tpublic void onBackPressed () {\\n\\t\\tif (searchMode) {\\n\\t\\t\\ttoggleSearch();\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tsuper.onBackPressed();\\n\\t}\",\n \"private void clearTextInput() {\\n\\t\\ttextInput.setText(\\\"\\\");\\n\\t}\",\n \"protected void resetValue(ActionEvent ae) {\\n\\t\\tsearchClassNameTextField.setText(\\\"\\\");\\r\\n\\t}\",\n \"public void onResetSearchBar(Widget newAttributeSearchWidget) {\\n eventBus.resetAdvanceSearchTabs();\\n view.getSearchContent().setText(null);\\n this.newAttributeSearchWidget = newAttributeSearchWidget;\\n }\",\n \"@Override\\n public void onFocusChange(View v, boolean hasFocus) { // if focus has changed\\n if (!hasFocus) {\\n InputMethodManager inputMethodManager = (InputMethodManager) getSystemService(Activity.INPUT_METHOD_SERVICE);\\n inputMethodManager.hideSoftInputFromWindow(v.getWindowToken(), 0);\\n }\\n }\",\n \"@Override\\n public void onSearchConfirmed(CharSequence text) {\\n if (text!=null) {\\n adapter.stopListening();\\n StartSearch(text);\\n searchAdapter.startListening();\\n }\\n }\",\n \"@Override\\n\\tprotected void onDestroy() {\\n\\t\\tsuper.onDestroy();\\n\\t\\t// mSearch.destroy();\\n\\t\\tmPoiSearch.destroy();\\n\\n\\t\\tif (mCommonDialog != null)\\n\\t\\t\\tmCommonDialog.dismiss();\\n\\t\\tif(mdealTask!=null){\\n\\t\\t\\tmdealTask.cancel(true);\\n\\t\\t\\tmdealTask=null;\\n\\t\\t\\t}\\n\\t}\",\n \"public void actionPerformed(ActionEvent InputEvent)\\r\\n {\\r\\n performSearch();\\r\\n }\",\n \"@Override\\n public void onSearchTermChanged() {\\n }\",\n \"private void reset() {\\n \\t\\tif (currentSuggestion != null) {\\n \\t\\t\\tsetPromptingOff(currentSuggestion.getReplacementString());\\n \\t\\t} else {\\n \\t\\t\\tif (focused) {\\n \\t\\t\\t\\tsetPromptingOff(\\\"\\\");\\n \\t\\t\\t} else {\\n \\t\\t\\t\\tsetPromptingOn();\\n \\t\\t\\t}\\n \\t\\t}\\n \\t\\thideSuggestions();\\n \\t\\tLogger.getLogger(VSuggestFieldWidget.class.getName()).info(\\\"Reset\\\");\\n \\t}\",\n \"public final /* synthetic */ void lambda$initView$0$BaseSearchContactActivity(View view) {\\n finish();\\n }\",\n \"@Override\\n protected void onDestroy() {\\n saveData();\\n stopRepeatingDeletionSearch();\\n super.onDestroy();\\n }\",\n \"public void resetAdapter() {\\n\\n // Hide ProgressBar\\n mBinding.searchUserLayout.getUvm().hideProgress();\\n\\n // Cancel any pending searches\\n mSearchHandler.removeCallbacksAndMessages(null);\\n\\n // Clear the Adapter\\n mAdapter.clear();\\n }\",\n \"public Builder clearLocalSearchRequest() {\\n if (localSearchRequestBuilder_ == null) {\\n localSearchRequest_ = null;\\n onChanged();\\n } else {\\n localSearchRequest_ = null;\\n localSearchRequestBuilder_ = null;\\n }\\n\\n return this;\\n }\",\n \"private void schowajKlawiature() {\\n View view = this.getActivity().getCurrentFocus(); //inside a fragment you should use getActivity()\\n if (view != null) {\\n InputMethodManager imm = (InputMethodManager) getActivity().getSystemService(context.INPUT_METHOD_SERVICE);\\n imm.hideSoftInputFromWindow(view.getWindowToken(), 0);\\n }\\n }\",\n \"void endRangeSelection() {\\n mRanger = null;\\n }\",\n \"@Override\\n\\t\\t public boolean onQueryTextSubmit(String query) {\\n\\t\\t \\tcloseSearch();\\n\\t\\t return false;\\n\\t\\t }\",\n \"public Builder clearSearchResponse() {\\n if (searchResponseBuilder_ == null) {\\n searchResponse_ = null;\\n onChanged();\\n } else {\\n searchResponse_ = null;\\n searchResponseBuilder_ = null;\\n }\\n\\n return this;\\n }\",\n \"@Override\\n public void onSearchConfirmed(CharSequence text) {\\n startSearch(text);\\n\\n }\",\n \"@Override\\n public boolean dispatchTouchEvent(MotionEvent event) {\\n if (event.getAction() == MotionEvent.ACTION_UP) {\\n View v = getCurrentFocus();\\n if (v instanceof EditText) {\\n Rect outRect = new Rect();\\n v.getGlobalVisibleRect(outRect);\\n if (!outRect.contains((int)event.getRawX(), (int)event.getRawY())) {\\n v.clearFocus();\\n InputMethodManager imm =\\n (InputMethodManager) getSystemService(Context.INPUT_METHOD_SERVICE);\\n imm.hideSoftInputFromWindow(v.getWindowToken(), 0);\\n }\\n }\\n }\\n return super.dispatchTouchEvent(event);\\n }\",\n \"@FXML\\r\\n private void cancelAction(ActionEvent event) {\\n integerProperty.set(-1);\\r\\n searchFieldComboBox.getSelectionModel().select(0);\\r\\n companiesComboBox.setText(\\\"\\\");\\r\\n actionsComboBox.setText(\\\"\\\");\\r\\n yearValue.setText(\\\"\\\");\\r\\n mounthValue.setText(\\\"\\\");\\r\\n dayValue.setText(\\\"\\\");\\r\\n valueText.setText(\\\"\\\");\\r\\n relationComboBox.getSelectionModel().select(0);\\r\\n searchFieldComboBox.requestFocus();\\r\\n event.consume();\\r\\n }\",\n \"public void onClick(View v) {\\n editText1.setInputType(InputType.TYPE_NULL);\\n InputMethodManager mgr = (InputMethodManager) getSystemService(Context.INPUT_METHOD_SERVICE);\\n mgr.hideSoftInputFromWindow(editText1.getWindowToken(),InputMethodManager.HIDE_IMPLICIT_ONLY);\\n }\",\n \"private void m125722q() {\\n if (this.f88309g != null) {\\n this.f88309g.removeAllViews();\\n }\\n }\",\n \"public Builder clearSearchValue() {\\n if (searchValueBuilder_ == null) {\\n searchValue_ = null;\\n onChanged();\\n } else {\\n searchValue_ = null;\\n searchValueBuilder_ = null;\\n }\\n\\n return this;\\n }\",\n \"private void clearButtons(){\\n\\t\\t// remove-all saved search Buttons\\n\\t\\tqueryTableLayout.removeAllViews();\\n\\t}\",\n \"@Override\\n public View onCreateView(LayoutInflater inflater, ViewGroup container,\\n Bundle savedInstanceState) {\\n mRecipeList = new ArrayList<>();\\n rootView = inflater.inflate(R.layout.fragment_search, container, false);\\n searchWindow = rootView.findViewById(R.id.searchWindow);\\n searchResultView = rootView.findViewById(R.id.searchResult);\\n searchWindow.requestFocus();\\n searchWindow.setOnEditorActionListener(new TextView.OnEditorActionListener() {\\n @Override\\n public boolean onEditorAction(TextView v, int actionId,\\n KeyEvent event) {\\n if (event != null&& (event.getKeyCode() == KeyEvent.KEYCODE_ENTER)) {\\n UIUtils.hideKeyboard(getActivity());\\n // Must return true here to consume event\\n return true;\\n }\\n return false;\\n }\\n });\\n final RecipeItemAdapter recipeItemAdapter = new RecipeItemAdapter(mRecipeList, mListener);\\n searchResultFinder = new SearchResultFinder(recipeItemAdapter, mRecipeList);\\n searchResultView.setAdapter(recipeItemAdapter);\\n searchResultView.setLayoutManager(new LinearLayoutManager(getActivity(),\\n LinearLayoutCompat.VERTICAL, false));\\n searchWindow.addTextChangedListener(new TextWatcher() {\\n @Override\\n public void beforeTextChanged(CharSequence s, int start, int count, int after) {\\n }\\n\\n @Override\\n public void onTextChanged(CharSequence s, int start, int before, int count) {\\n String input = searchWindow.getText().toString();\\n if (input.trim().isEmpty()) {\\n mRecipeList.clear();\\n recipeItemAdapter.notifyDataSetChanged();\\n } else searchResultFinder.search(input);\\n }\\n\\n @Override\\n public void afterTextChanged(Editable s) {\\n }\\n });\\n return rootView;\\n }\",\n \"public void resetVelden(View view){\\n //sortSpinner.setSelection(0);\\n activity.resetFilteredAdapterData(); // resets the data of the adapter in the parent activity.\\n }\",\n \"void unlockInputConnection() {\\n if (proxyAdapterView == null) {\\n return;\\n }\\n\\n proxyAdapterView.setLocked(false);\\n }\",\n \"@Override\\n public void onSearchConfirmed(CharSequence text) {\\n startSearch(text);\\n }\",\n \"@Override\\n\\t\\t public boolean onKey(View v, int keyCode, KeyEvent event) {\\n\\n\\t\\t Log.d(\\\"SEARCH\\\", \\\"Search onkey\\\");\\n\\t\\t return false;\\n\\t\\t }\"\n]","isConversational":false},"negative_scores":{"kind":"list like","value":["0.7694797","0.7320666","0.73044306","0.7276313","0.7113499","0.70670646","0.7045079","0.70235693","0.69656897","0.6964634","0.68849367","0.68092656","0.6803115","0.6751024","0.6713445","0.6691998","0.6670426","0.66614115","0.653591","0.6530998","0.6512381","0.64894813","0.64793414","0.6437937","0.6382087","0.6373956","0.63592315","0.6346954","0.6320622","0.62671673","0.6164863","0.61458945","0.6132382","0.60657996","0.604704","0.60436064","0.6041193","0.6037481","0.60344034","0.6023552","0.60231864","0.59874797","0.59841764","0.5981993","0.5981739","0.59743685","0.59732664","0.59671867","0.5963072","0.59586996","0.5949399","0.59456545","0.5942243","0.5937339","0.5935932","0.59306973","0.5928137","0.58988005","0.58890676","0.5886847","0.58842164","0.58707476","0.58663416","0.58589536","0.5843573","0.5831831","0.5831831","0.5823587","0.58201474","0.5812445","0.5807207","0.5799992","0.57996553","0.57883555","0.5787442","0.5780656","0.57659525","0.5765099","0.5760672","0.57602614","0.5759666","0.57571316","0.5749255","0.57469404","0.57428753","0.5736077","0.5734486","0.5729229","0.5728751","0.5728606","0.5728301","0.5725127","0.57181776","0.5715569","0.5707941","0.57072836","0.57012725","0.56973296","0.56951946","0.56950706"],"string":"[\n \"0.7694797\",\n \"0.7320666\",\n \"0.73044306\",\n \"0.7276313\",\n \"0.7113499\",\n \"0.70670646\",\n \"0.7045079\",\n \"0.70235693\",\n \"0.69656897\",\n \"0.6964634\",\n \"0.68849367\",\n \"0.68092656\",\n \"0.6803115\",\n \"0.6751024\",\n \"0.6713445\",\n \"0.6691998\",\n \"0.6670426\",\n \"0.66614115\",\n \"0.653591\",\n \"0.6530998\",\n \"0.6512381\",\n \"0.64894813\",\n \"0.64793414\",\n \"0.6437937\",\n \"0.6382087\",\n \"0.6373956\",\n \"0.63592315\",\n \"0.6346954\",\n \"0.6320622\",\n \"0.62671673\",\n \"0.6164863\",\n \"0.61458945\",\n \"0.6132382\",\n \"0.60657996\",\n \"0.604704\",\n \"0.60436064\",\n \"0.6041193\",\n \"0.6037481\",\n \"0.60344034\",\n \"0.6023552\",\n \"0.60231864\",\n \"0.59874797\",\n \"0.59841764\",\n \"0.5981993\",\n \"0.5981739\",\n \"0.59743685\",\n \"0.59732664\",\n \"0.59671867\",\n \"0.5963072\",\n \"0.59586996\",\n \"0.5949399\",\n \"0.59456545\",\n \"0.5942243\",\n \"0.5937339\",\n \"0.5935932\",\n \"0.59306973\",\n \"0.5928137\",\n \"0.58988005\",\n \"0.58890676\",\n \"0.5886847\",\n \"0.58842164\",\n \"0.58707476\",\n \"0.58663416\",\n \"0.58589536\",\n \"0.5843573\",\n \"0.5831831\",\n \"0.5831831\",\n \"0.5823587\",\n \"0.58201474\",\n \"0.5812445\",\n \"0.5807207\",\n \"0.5799992\",\n \"0.57996553\",\n \"0.57883555\",\n \"0.5787442\",\n \"0.5780656\",\n \"0.57659525\",\n \"0.5765099\",\n \"0.5760672\",\n \"0.57602614\",\n \"0.5759666\",\n \"0.57571316\",\n \"0.5749255\",\n \"0.57469404\",\n \"0.57428753\",\n \"0.5736077\",\n \"0.5734486\",\n \"0.5729229\",\n \"0.5728751\",\n \"0.5728606\",\n \"0.5728301\",\n \"0.5725127\",\n \"0.57181776\",\n \"0.5715569\",\n \"0.5707941\",\n \"0.57072836\",\n \"0.57012725\",\n \"0.56973296\",\n \"0.56951946\",\n \"0.56950706\"\n]","isConversational":false},"document_score":{"kind":"string","value":"0.7298445"},"document_rank":{"kind":"string","value":"3"}}}],"truncated":false,"partial":true},"paginationData":{"pageIndex":381,"numItemsPerPage":100,"numTotalItems":136513,"offset":38100,"length":100}},"jwt":"eyJhbGciOiJFZERTQSIsImtpZCI6IjVHZDBvd0g5MTM2eDZjc1FvbE1zcktNWUZoRVFoUm5PVVVybEpjOUhaUEEifQ.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sInJlcG9JZHMiOlsiNjc1Mzc3Mjk2YzBkMWNiNGEwNmY5MzlkIl0sImlhdCI6MTc5MDk2MjI5OSwianRpIjoiMzYzYzEwZjMtZmI5ZC00YzVhLTk5ZjAtZGRiOGU1NDMzMzg0Iiwic3ViIjoiL2RhdGFzZXRzL25vbWljLWFpL2Nvcm5zdGFjay1qYXZhLXYxIiwiZXhwIjoxNzkwOTY1ODk5LCJpc3MiOiJodHRwczovL2h1Z2dpbmdmYWNlLmNvIn0.AHL4mBoomRy33-A28zQGN4kqLee3LkMtuDpPTr7gL9mVhQ9RiwrVZdsrE6kvUl0KjfhW3Ar0koA6ZsSIXkAqDA","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 |
|---|---|---|---|---|---|---|
TODO Autogenerated method stub | @Override
public int describeContents() {
return 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 writeToParcel(Parcel dest, int flags) {
dest.writeString(northEastLatitude);
dest.writeString(northEastLongitude);
dest.writeString(southWestLatitude);
dest.writeString(southWestLongitude);
dest.writeString(arrivalTimeText);
dest.writeString(arrivalTimeZone);
dest.writeString(arriva... | {
"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 Class<?> getClassInfo() {
return RouteVO.class;
} | {
"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 |
Abstraction of error message and application info processing. | public interface YangAppErrorInfo {
/**
* Returns the application's error message for data error.
*
* @return application's error message for data error.
*/
String getGetErrorMessage();
/**
* Sets the application's error message for data error.
*
* @param errorMessage ap... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private void wrapError(String code, String message) {\r\n recentErrorCode = code;\r\n\r\n\t\t/* \r\n\t\t *\t<error>\r\n\t\t *\t\t<code>TEAL_8453</code>\r\n\t\t *\t\t<message>[request_id=201203082] Failed to create a process module by wrong value of a parameter(=topic_id)</message>\r\n\t\t *\t</error>\r\n\t\... | [
"0.63144714",
"0.6142387",
"0.61192733",
"0.59955114",
"0.59852093",
"0.5913902",
"0.5895563",
"0.5878832",
"0.5873893",
"0.58564836",
"0.58461756",
"0.5835484",
"0.58310544",
"0.58215815",
"0.58203304",
"0.5774561",
"0.5767843",
"0.5764503",
"0.57545495",
"0.57465076",
"0.57... | 0.58771354 | 8 |
Returns the application's error message for data error. | String getGetErrorMessage(); | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n\tpublic String getMessage()\n\t{\n\t\treturn errMessage;\n\t}",
"java.lang.String getErrorMessage();",
"java.lang.String getErrorMessage();",
"java.lang.String getErrorMessage();",
"java.lang.String getErrorMessage();",
"java.lang.String getErrorMessage();",
"java.lang.String getErrorMessag... | [
"0.7189802",
"0.7041286",
"0.7041286",
"0.7041286",
"0.7041286",
"0.7041286",
"0.7041286",
"0.7041286",
"0.7041286",
"0.7041286",
"0.7041286",
"0.7041286",
"0.7041286",
"0.6996623",
"0.69809234",
"0.69650155",
"0.69650155",
"0.69650155",
"0.6883689",
"0.6880997",
"0.6866388",... | 0.6526594 | 76 |
Sets the application's error message for data error. | void setErrorMessage(String errorMessage); | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public abstract void setError(String message);",
"public void putError(String message) {\n errorData.postValue(message);\n }",
"void setErrorAppTag(String errorMessage);",
"public void setErrorMessage(String msg) {\r\n\t\terrorMessage.setText(msg);\r\n\t}",
"public void setErrorMsg(String text) {... | [
"0.73516613",
"0.7137393",
"0.6950103",
"0.6827232",
"0.67718667",
"0.669761",
"0.66890675",
"0.666096",
"0.6626204",
"0.65229386",
"0.65225625",
"0.6487143",
"0.6460068",
"0.6411239",
"0.63759416",
"0.63357824",
"0.6333033",
"0.6300572",
"0.6300572",
"0.6300572",
"0.62998205... | 0.6955433 | 2 |
Returns the application's error tag for data error. | String getGetErrorAppTag(); | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public AgnTagErrorKey getErrorKey() {\n\t\treturn errorKey;\n\t}",
"void setErrorAppTag(String errorMessage);",
"public String getError() {\n return error != null ? error : \"An unknown error occurred.\";\n }",
"public String getError() {\r\n\t\treturn error;\r\n\t}",
"public String getError() {\... | [
"0.65958774",
"0.6444902",
"0.64232403",
"0.63673705",
"0.6341282",
"0.6341282",
"0.6263449",
"0.6261371",
"0.6261371",
"0.6261371",
"0.6261371",
"0.62503535",
"0.62503535",
"0.62503535",
"0.62158966",
"0.62104267",
"0.61627865",
"0.61466056",
"0.6130414",
"0.61210203",
"0.61... | 0.7617492 | 0 |
Sets the application's error tag for data error. | void setErrorAppTag(String errorMessage); | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static void error(String TAG, String value) {\n\t}",
"public void setError(ErrorResponse error)\n {\n data().put(_ERROR, error.data());\n }",
"public void setError(String error) {\n this.error = error;\n }",
"public void setError(String error) {\n this.error = error;\n }",
"... | [
"0.6551911",
"0.6371979",
"0.629838",
"0.629838",
"0.629838",
"0.6266297",
"0.61708564",
"0.61138034",
"0.610691",
"0.60626733",
"0.60463345",
"0.60214394",
"0.5994642",
"0.59555537",
"0.5944804",
"0.5936655",
"0.5922069",
"0.58932745",
"0.5879545",
"0.5861061",
"0.58594286",... | 0.787764 | 0 |
Creates new form NewWorkerFrame | public NewRoomFrame() {
initComponents();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public NewFrame() {\n initComponents();\n }",
"Frame createFrame();",
"public NewJFrame() {\n initComponents();\n \n }",
"public NewJFrame() {\n Connect();\n initComponents();\n }",
"public NewJFrame() {\r\n initComponents();\r\n }",
"FRAME createFRA... | [
"0.67074203",
"0.6690583",
"0.660508",
"0.65429944",
"0.65117687",
"0.65089124",
"0.6479624",
"0.6479624",
"0.6479624",
"0.6479624",
"0.6479624",
"0.6479624",
"0.6479624",
"0.6428509",
"0.6384794",
"0.6373028",
"0.6329696",
"0.6323149",
"0.62763846",
"0.626554",
"0.6254683",
... | 0.5714062 | 50 |
This method is called from within the constructor to initialize the form. WARNING: Do NOT modify this code. The content of this method is always regenerated by the Form Editor. | @SuppressWarnings("unchecked")
// <editor-fold defaultstate="collapsed" desc="Generated Code">//GEN-BEGIN:initComponents
private void initComponents() {
jLabel1 = new javax.swing.JLabel();
jLabel2 = new javax.swing.JLabel();
jLabel3 = new javax.swing.JLabel();
jLabel4 = new java... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public Form() {\n initComponents();\n }",
"public MainForm() {\n initComponents();\n }",
"public MainForm() {\n initComponents();\n }",
"public MainForm() {\n initComponents();\n }",
"public frmRectangulo() {\n initComponents();\n }",
"public form() {\n ... | [
"0.73206544",
"0.7291311",
"0.7291311",
"0.7291311",
"0.7286492",
"0.7249181",
"0.7213362",
"0.72085494",
"0.71965617",
"0.7190475",
"0.7184897",
"0.7159234",
"0.71483016",
"0.7094075",
"0.7081491",
"0.70579433",
"0.6987627",
"0.69776064",
"0.69552463",
"0.69549114",
"0.69453... | 0.0 | -1 |
Created by taras on 4/18/15. | public interface Color {
void fill();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n public void perish() {\n \n }",
"@Override\n\tpublic void grabar() {\n\t\t\n\t}",
"public final void mo51373a() {\n }",
"private stendhal() {\n\t}",
"@Override\n\tpublic void comer() {\n\t\t\n\t}",
"@Override\n public void func_104112_b() {\n \n }",
"@Overri... | [
"0.59523743",
"0.59035426",
"0.5832746",
"0.5828886",
"0.5786694",
"0.5729504",
"0.56800216",
"0.56800216",
"0.5678649",
"0.5673723",
"0.564558",
"0.56184673",
"0.56184673",
"0.56184673",
"0.56184673",
"0.56184673",
"0.5612442",
"0.5608374",
"0.56029254",
"0.56026703",
"0.559... | 0.0 | -1 |
TODO Autogenerated method stub | @Override
public MemberVO selectMemberazax(HashMap<String, String> param) {
return memberDAO.selectMemberazax(param);
} | {
"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 |
Constructor which sets the default scanner. | public Parser(java_cup.runtime.Scanner s) {super(s);} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static void init() {\n\t\tscanner = new Scanner(System.in);\n\t\treturn;\n\t}",
"public static void setScanner(Scanner s) {\n scanner = s;\n }",
"public static void setInputScanner(InputScanner scanner){\n inputScanner = scanner;\n }",
"private ConsoleScanner() {}",
"public Metad... | [
"0.7363979",
"0.71984017",
"0.7137678",
"0.71248406",
"0.70821637",
"0.7008351",
"0.70074767",
"0.6923786",
"0.6865954",
"0.6865954",
"0.6865954",
"0.6865954",
"0.6865954",
"0.6865954",
"0.6865954",
"0.6865954",
"0.66874146",
"0.66866326",
"0.66866326",
"0.6629352",
"0.661497... | 0.68472075 | 20 |
Constructor which sets the default scanner. | public Parser(java_cup.runtime.Scanner s, java_cup.runtime.SymbolFactory sf) {super(s,sf);} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static void init() {\n\t\tscanner = new Scanner(System.in);\n\t\treturn;\n\t}",
"public static void setScanner(Scanner s) {\n scanner = s;\n }",
"public static void setInputScanner(InputScanner scanner){\n inputScanner = scanner;\n }",
"private ConsoleScanner() {}",
"public Metad... | [
"0.7363979",
"0.71984017",
"0.7137678",
"0.71248406",
"0.70821637",
"0.7008351",
"0.70074767",
"0.6923786",
"0.6865954",
"0.6865954",
"0.6865954",
"0.6865954",
"0.6865954",
"0.6865954",
"0.6865954",
"0.6865954",
"0.68472075",
"0.68472075",
"0.68472075",
"0.68472075",
"0.68472... | 0.5671886 | 82 |
Access to production table. | public short[][] production_table() {return _production_table;} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public short[][] production_table() {\r\n return _production_table;\r\n }",
"public short[][] production_table() {\r\n return _production_table;\r\n }",
"short[][] productionTable();",
"public String getTable()\n {\n return table;\n }",
"private void refTable() {\n tr... | [
"0.68532145",
"0.6843889",
"0.57185096",
"0.56440794",
"0.563",
"0.5615971",
"0.56071514",
"0.5580453",
"0.55784947",
"0.55773133",
"0.5487715",
"0.5472419",
"0.5464648",
"0.54604506",
"0.5398757",
"0.53913164",
"0.5386026",
"0.5377525",
"0.53717554",
"0.5368894",
"0.5353499"... | 0.68878466 | 38 |
Access to parseaction table. | public short[][] action_table() {return _action_table;} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public short[][] action_table() {\r\n return _action_table;\r\n }",
"public ActionList getActions();",
"public int getAction() {\n\t\treturn action;\n\t}",
"String[] getActions();",
"public Action getAction() {\n\treturn action;\n }",
"public int getAction()\n {\n return m_action;\n ... | [
"0.71799415",
"0.6271413",
"0.60241354",
"0.6008953",
"0.59867096",
"0.5980041",
"0.5955848",
"0.5938487",
"0.5920429",
"0.5917709",
"0.59064436",
"0.590324",
"0.59030133",
"0.5900386",
"0.5894549",
"0.5894549",
"0.5894549",
"0.5894549",
"0.5890299",
"0.58894557",
"0.5886304"... | 0.7215594 | 38 |
Access to reduce_goto table. | public short[][] reduce_table() {return _reduce_table;} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public short[][] reduce_table() {\r\n return _reduce_table;\r\n }",
"public short[][] action_table() {return _action_table;}",
"public short[][] action_table() {return _action_table;}",
"public short[][] action_table() {return _action_table;}",
"public short[][] action_table() {return _action_tab... | [
"0.5971808",
"0.47024643",
"0.47024643",
"0.47024643",
"0.47024643",
"0.47024643",
"0.47024643",
"0.47024643",
"0.47024643",
"0.47024643",
"0.47024643",
"0.47024643",
"0.47024643",
"0.47024643",
"0.47024643",
"0.47024643",
"0.47024643",
"0.47024643",
"0.47024643",
"0.47024643",... | 0.6235091 | 38 |
Action encapsulation object initializer. | protected void init_actions()
{
action_obj = new CUP$Parser$actions(this);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"protected void init_actions()\n {\n action_obj = new CUP$FractalParser$actions(this);\n }",
"protected void init_actions()\r\n {\r\n action_obj = new CUP$Parser$actions(this);\r\n }",
"protected void init_actions()\r\n {\r\n action_obj = new CUP$parser$actions(this);\r\n }",
... | [
"0.7878943",
"0.7846156",
"0.7827101",
"0.7798481",
"0.7798481",
"0.7798481",
"0.7798481",
"0.7798481",
"0.7798481",
"0.7798481",
"0.7798481",
"0.7798481",
"0.7798481",
"0.7798481",
"0.7798481",
"0.7798481",
"0.7798481",
"0.7798481",
"0.7796163",
"0.7776218",
"0.7776218",
"... | 0.78301626 | 6 |
Invoke a user supplied parse action. | public java_cup.runtime.Symbol do_action(
int act_num,
java_cup.runtime.lr_parser parser,
java.util.Stack stack,
int top)
throws java.lang.Exception
{
/* call code in generated class */
return action_obj.CUP$Parser$do_action(act_num,... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void executeAction( String actionInfo );",
"public final java_cup.runtime.Symbol CUP$Parser$do_action(\n int CUP$Parser$act_num,\n java_cup.runtime.lr_parser CUP$Parser$parser,\n java.util.Stack CUP$Parser$stack,\n int CUP$Parser$top)\n ... | [
"0.66233104",
"0.65339345",
"0.65339345",
"0.65339345",
"0.6502368",
"0.6490189",
"0.6490189",
"0.6490189",
"0.6490189",
"0.6490189",
"0.64837754",
"0.645815",
"0.63573897",
"0.63072646",
"0.62915266",
"0.6286955",
"0.6286955",
"0.62713635",
"0.6186821",
"0.6142021",
"0.61393... | 0.59896076 | 28 |
Method 0 with the actual generated action code for actions 0 to 300. | public final java_cup.runtime.Symbol CUP$Parser$do_action_part00000000(
int CUP$Parser$act_num,
java_cup.runtime.lr_parser CUP$Parser$parser,
java.util.Stack CUP$Parser$stack,
int CUP$Parser$top)
throws java.lang.Exception
{
/* Symbo... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public synchronized void applyAction(int action) {\n\n }",
"@Override\n public void action() {\n }",
"@Override\n public void action() {\n }",
"@Override\n public void action() {\n }",
"@Override\r\n\tpublic void action() {\n\t\t\r\n\t}",... | [
"0.6540306",
"0.6360431",
"0.6360431",
"0.6360431",
"0.6318598",
"0.6310077",
"0.6304101",
"0.62837225",
"0.62453675",
"0.62198925",
"0.6170259",
"0.61670256",
"0.61415684",
"0.6100156",
"0.60898334",
"0.6071881",
"0.60642594",
"0.60430443",
"0.6036261",
"0.60053736",
"0.5988... | 0.0 | -1 |
/ end of method Method splitting the generated action code into several parts. | public final java_cup.runtime.Symbol CUP$Parser$do_action(
int CUP$Parser$act_num,
java_cup.runtime.lr_parser CUP$Parser$parser,
java.util.Stack CUP$Parser$stack,
int CUP$Parser$top)
throws java.lang.Exception
{
return CUP$Pa... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n\tprotected void generatePrimitives(SoAction action) {\n\n\t}",
"@Override\r\n\tpublic void action() {\n\t\t\r\n\t}",
"@Override\n public void action() {\n }",
"@Override\n public void action() {\n }",
"@Override\n public void action() {\n ... | [
"0.6762849",
"0.6629404",
"0.6623993",
"0.6623993",
"0.6623993",
"0.6572498",
"0.64394337",
"0.63651955",
"0.63266194",
"0.623059",
"0.62095",
"0.6162325",
"0.61065876",
"0.60964054",
"0.59108377",
"0.5904232",
"0.5882275",
"0.5845955",
"0.5845261",
"0.58141553",
"0.5770801",... | 0.0 | -1 |
private int previousPosition = 1; | @Override
public boolean onNavigationItemSelected(@NonNull MenuItem item) {
switch (item.getItemId()) {
case R.id.i_add:
Intent intent=new Intent(RecordActivity.this,AddRecordActivity.class);
startActivity(intent);
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n public int previousIndex()\n {\n return idx-1;\n }",
"@Override\n\t\tpublic int previousIndex() {\n\t\t\treturn 0;\n\t\t}",
"public int previousIndex() {\r\n \treturn index - 1; \r\n }",
"public int getPosition(){\n return -1;\n }",
"public ... | [
"0.7916827",
"0.78006923",
"0.7540815",
"0.7518206",
"0.73582417",
"0.7323972",
"0.7307064",
"0.724464",
"0.71372193",
"0.70864534",
"0.7063091",
"0.7015681",
"0.70060396",
"0.6949848",
"0.69214",
"0.6917164",
"0.6875482",
"0.68573564",
"0.6819218",
"0.6809265",
"0.6808684",
... | 0.0 | -1 |
Given a number, return the factorial of that number. For example, given 5, the factorial is 5 x 4 x 3 x 2 x 1 which should return 120. | public Integer factorial(Integer number){
int fact = 1;
for (int i = number; i > 0; i--){
fact *=i;
}
return fact;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public int factorial(int num) \n {\n number = num;\n f=1;\n for(i=1; i<=number; i++)\n {\n f=f*i;\n }\n return f;\n }",
"public Integer factorial(Integer number){\n int result = 1;\n for (int i =1;i<=number;i++)\n {\n resu... | [
"0.7835364",
"0.7763316",
"0.7708129",
"0.7679603",
"0.7678548",
"0.7629103",
"0.76271665",
"0.76263976",
"0.75727206",
"0.7542012",
"0.7534927",
"0.7519155",
"0.7473537",
"0.74366224",
"0.7424392",
"0.7417614",
"0.7405631",
"0.73210853",
"0.7316434",
"0.7275771",
"0.7250137"... | 0.782151 | 1 |
Given a phrase, get the acronym of that phrase. Acronym is the combination of the first character of each word in upper case. For example, given "Ruby on Rails", this method will return "ROR" | public String acronym(String phrase) {
/*StringBuilder acronymFeed = new StringBuilder("");
String wordHolder = "";
int spaceIndex;
char firstLetter;
do{
spaceIndex = phrase.indexOf(" ");
wordHolder = phrase.substring(0,spaceIndex);
acronymFeed... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public String acronym(String phrase) {\n\t\tString[] p = phrase.split(\"[\\\\W\\\\s]\");\n\t\tString returner = \"\";\n\t\tfor (String s : p) {\n\t\t\tif (!s.isEmpty())\n\t\t\t\treturner = returner + s.charAt(0);\n\t\t}\n\t\treturn returner.toUpperCase();\n\t}",
"public static String acronym(String phrase) {\n\t... | [
"0.8925246",
"0.8755592",
"0.87136763",
"0.8653149",
"0.85364926",
"0.84731317",
"0.6838266",
"0.6743494",
"0.65249467",
"0.63692397",
"0.6325082",
"0.62066144",
"0.61946565",
"0.61708647",
"0.61394083",
"0.6058268",
"0.5960621",
"0.59416914",
"0.59247595",
"0.5875696",
"0.58... | 0.8707771 | 3 |
To prevent anyone from reading our messages, we can encrypt it so it will only be readable by its intended audience. This method encrypt the message by shifting the letter by 3 characters. If the character is at the end of the alphabet, it will wraps around. For example: 'a' => 'd' 'w' => 'z' 'x' => 'a' 'y' => 'b' | public String encrypt(String word) {
char[] encrypted = word.toCharArray();
for (int i = 0; i < encrypted.length; i++){
if (encrypted[i] == 'x' || encrypted[i] == 'y' || encrypted[i] == 'z'){
encrypted[i] -= 23;
} else {
encrypted[i] +=... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n public String encryptMsg(String msg) {\n if (msg.length() == 0) {\n return msg;\n } else {\n char[] encMsg = new char[msg.length()];\n for (int ind = 0; ind < msg.length(); ++ind) {\n char letter = msg.charAt(ind);\n if (le... | [
"0.72344875",
"0.71540314",
"0.706848",
"0.7058821",
"0.70254064",
"0.70054",
"0.6987618",
"0.6947225",
"0.6921178",
"0.6874987",
"0.675149",
"0.6736562",
"0.6686012",
"0.6674453",
"0.66642094",
"0.6644165",
"0.66269654",
"0.656488",
"0.65247756",
"0.64500725",
"0.64454937",
... | 0.71331733 | 2 |
Main section must start with the SignatureVersion attribute. See | public static void writeMainSection(OutputStream out, Attributes attributes)
throws IOException {
String signatureVersion = attributes.getValue(Attributes.Name.SIGNATURE_VERSION);
if (signatureVersion == null) {
throw new IllegalArgumentException(
"Mandatory "... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@SuppressWarnings(\"unused\")\n\tprivate void version() {\n\n\t}",
"public void setSignature(String Signature) {\n this.Signature = Signature;\n }",
"public int getVersion() { return 1; }",
"int getSignature ();",
"@Override\n public int getVersion() {\n return 4;\n }",
"@Override\... | [
"0.60419613",
"0.5584853",
"0.5549175",
"0.5526498",
"0.5497148",
"0.5489039",
"0.536469",
"0.53342927",
"0.5318694",
"0.53137636",
"0.52888304",
"0.5281393",
"0.52742726",
"0.5273094",
"0.52572906",
"0.5235919",
"0.52282375",
"0.5217894",
"0.521703",
"0.51987666",
"0.5177792... | 0.6930899 | 0 |
Neither guava nor caffeine cache provide an "exact" LRU implementation, the so called "Window TinyLFU policy" is | private static Cache<DHTKey, LruRetentionInfo> buildEmptyCacheWithCapacity(long capacityBytes) {
return Caffeine.newBuilder().weigher(cacheWeigher).maximumWeight(capacityBytes).recordStats().build();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static void main(String args[]){\n LRUCache cache = new LRUCache(2);\n\n cache.put(1, 1);\n cache.put(2, 2);\n System.out.println(cache.get(1)); // returns 1\n cache.put(3, 3); // evicts key 2\n System.out.println(cache.get(2)); // returns -1 (not fou... | [
"0.6577368",
"0.63004386",
"0.6129002",
"0.6097942",
"0.6029189",
"0.601824",
"0.5991301",
"0.59897953",
"0.59595954",
"0.5903667",
"0.58974266",
"0.5886813",
"0.58241934",
"0.57705396",
"0.576861",
"0.57331467",
"0.570898",
"0.5703852",
"0.56743044",
"0.56560504",
"0.5655077... | 0.48873043 | 70 |
Use for test only for inspecting the content | public Map<DHTKey, LruRetentionInfo> getCurrentRetentionMap() {
retentionMap.cleanUp();
return Collections.unmodifiableMap(retentionMap.asMap());
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"default boolean visitContent() {\n\t\treturn true;\n\t}",
"String content();",
"@Test\r\n\tpublic void contents() throws Exception {\n\t}",
"@Test\n public void test() throws IOException {\n String url = \"http://blog.csdn.net/seatomorrow/article/details/48393547\";\n Readability readability... | [
"0.66989976",
"0.6438213",
"0.6404358",
"0.63105506",
"0.6306502",
"0.6306502",
"0.6306502",
"0.6306502",
"0.6306502",
"0.6306502",
"0.62833786",
"0.62833786",
"0.62833786",
"0.62833786",
"0.62833786",
"0.62833786",
"0.62833786",
"0.62833786",
"0.62429935",
"0.6180224",
"0.61... | 0.0 | -1 |
Utility for creating a credit specific view column | public static ViewConfig createViewConfig(ConfigLink<ExposureFunctions> exposureConfig, ConfigLink<CurrencyMatrix> currencyMatrixLink) {
return
configureView(
"FX Forward Remote view",
config(
arguments(
function(
MarketExpo... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static String getCreateViewSQLString(){\n\t\treturn \" create view \"+VIEW_NAME_FAMILY_PLANING_RECORDS_DETAIL+\" as select \"\n\t\t\t\t+SERVICE_REC_ID+\", \"\n\t\t\t\t+ TABLE_NAME_FAMILY_PLANNING_RECORDS+ \".\"+ CommunityMembers.COMMUNITY_MEMBER_ID+\", \"\n\t\t\t\t+CommunityMembers.COMMUNITY_MEMBER_NAME+\",... | [
"0.6151614",
"0.58395934",
"0.58149725",
"0.578126",
"0.5701907",
"0.56984645",
"0.5690699",
"0.5658186",
"0.5651078",
"0.5631133",
"0.560022",
"0.55728215",
"0.5564977",
"0.555096",
"0.5550132",
"0.5548814",
"0.55457217",
"0.5543902",
"0.5525554",
"0.5510591",
"0.5479595",
... | 0.0 | -1 |
Create an instance of a Fx Forward Trade | private static FXForwardTrade createFxForwardTrade() {
Counterparty counterparty = new SimpleCounterparty(ExternalId.of(Counterparty.DEFAULT_SCHEME, "COUNTERPARTY"));
BigDecimal tradeQuantity = BigDecimal.valueOf(1);
LocalDate tradeDate = LocalDate.of(2014, 7, 11);
OffsetTime tradeTime = OffsetTime.of(... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private static FXForwardSecurity createFxForwardSecurity() {\n\n Currency payCurrency = Currency.GBP;\n Currency recCurrency = Currency.USD;\n\n double payAmount = 1_000_000;\n double recAmount = 1_600_000;\n\n ZonedDateTime forwardDate = DateUtils.getUTCDate(2019, 2, 4);\n\n ExternalId region = ... | [
"0.7013786",
"0.6961077",
"0.6752613",
"0.61878556",
"0.5576244",
"0.5542571",
"0.53491056",
"0.5305078",
"0.5292215",
"0.5289227",
"0.5268767",
"0.52652246",
"0.5247499",
"0.5194636",
"0.51329386",
"0.5121338",
"0.5120789",
"0.51173687",
"0.5104054",
"0.5067539",
"0.5061777"... | 0.83188105 | 0 |
Create an instance of a Fx Forward Security | private static FXForwardSecurity createFxForwardSecurity() {
Currency payCurrency = Currency.GBP;
Currency recCurrency = Currency.USD;
double payAmount = 1_000_000;
double recAmount = 1_600_000;
ZonedDateTime forwardDate = DateUtils.getUTCDate(2019, 2, 4);
ExternalId region = ExternalSchemes... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static Security_I create()\r\n\t\t{\r\n\t\treturn new Security();\r\n\t\t}",
"public Forwarding() {\n\n }",
"private static FXForwardTrade createFxForwardTrade() {\n\n Counterparty counterparty = new SimpleCounterparty(ExternalId.of(Counterparty.DEFAULT_SCHEME, \"COUNTERPARTY\"));\n BigDecimal ... | [
"0.5880378",
"0.5864074",
"0.5856941",
"0.58366996",
"0.5626896",
"0.54038334",
"0.5357629",
"0.5227371",
"0.5217684",
"0.5154413",
"0.5150758",
"0.5134774",
"0.5122024",
"0.5094388",
"0.50928175",
"0.5081009",
"0.5020948",
"0.49954417",
"0.49945414",
"0.49851692",
"0.4918232... | 0.78778595 | 0 |
works according to singleton pattern | private DBconnectionUtil()
{
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private Singleton(){}",
"private Singleton()\n\t\t{\n\t\t}",
"static void useSingleton(){\n\t\tSingleton singleton = Singleton.getInstance();\n\t\tprint(\"singleton\", singleton);\n\t}",
"private SingletonEager(){\n \n }",
"private SingletonSigar(){}",
"private Singleton() {\n\t}",
"private Singl... | [
"0.74868447",
"0.7443924",
"0.74382615",
"0.7413988",
"0.7368423",
"0.7332989",
"0.7316249",
"0.7271524",
"0.7266916",
"0.7264639",
"0.7152609",
"0.713544",
"0.70722854",
"0.7057506",
"0.7046184",
"0.70379305",
"0.6997172",
"0.69761354",
"0.69671386",
"0.69671386",
"0.6954759... | 0.0 | -1 |
Create Database connection for the given URL, user name and password | public static Connection getConnection() throws ClassNotFoundException, SQLException
{
/**
* create new connection when connection is close or null
*/
if( conn == null || conn.isClosed() )
{
Class.forName(properties.getProperty(QueryConstants.DRIVER_NAME));
conn = DriverManager.getConnection(prope... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void createConnection(String dbUrl) {\r\n\t\ttry {\r\n\t\t\tconn = DriverManager.getConnection(dbUrl);\r\n\t\t} catch (SQLException e) {\r\n\t\t\tSystem.out.println(\"Database exception during database connection creation: \" + e.getMessage());\r\n\t\t}\r\n\t}",
"private static DatabaseConnection getConne... | [
"0.74782765",
"0.7476315",
"0.72275853",
"0.71452373",
"0.7118221",
"0.71096003",
"0.7097563",
"0.7068423",
"0.7060598",
"0.7059946",
"0.7049114",
"0.7037233",
"0.69938445",
"0.6991561",
"0.69623077",
"0.69589144",
"0.6957299",
"0.69233704",
"0.68885905",
"0.68855566",
"0.688... | 0.0 | -1 |
/ ========== SINGLETON ========== | public static FpsTimer singleton() {
return singleton == null ? singleton = new FpsTimer() : singleton;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private SingleTon() {\n\t}",
"private void init() {\n\n\t}",
"private Main() {\n\n super();\n }",
"private void init() {\n }",
"private void init() {\n\n\n\n }",
"private MApi() {}",
"private stendhal() {\n\t}",
"private Singleton()\n\t\t{\n\t\t}",
"@Override\r\n\tpublic void init() {... | [
"0.7343201",
"0.7293135",
"0.7200745",
"0.7195302",
"0.7187249",
"0.7135594",
"0.7122812",
"0.71131414",
"0.71119475",
"0.710665",
"0.710665",
"0.710665",
"0.710665",
"0.70401114",
"0.703023",
"0.699557",
"0.69948995",
"0.6987442",
"0.6987442",
"0.69691557",
"0.6962555",
"0... | 0.0 | -1 |
/ ========== PUBLIC ========== | @Override
public void run() {
while (true) {
long currentTime = System.nanoTime();
draw();
check(currentTime);
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private stendhal() {\n\t}",
"@Override\n\tpublic void grabar() {\n\t\t\n\t}",
"@Override\n\tpublic void comer() {\n\t\t\n\t}",
"@Override\n public void perish() {\n \n }",
"@Override\r\n\tpublic void comer() \r\n\t{\n\t\t\r\n\t}",
"@Override\n\tprotected void interr() {\n\t}",
"@Override\n... | [
"0.64715165",
"0.6237815",
"0.6166567",
"0.61327994",
"0.61238045",
"0.6041496",
"0.6041198",
"0.6022806",
"0.6002947",
"0.59812844",
"0.5940418",
"0.5940418",
"0.5928067",
"0.5899429",
"0.5893978",
"0.58870494",
"0.588494",
"0.5857612",
"0.5857612",
"0.5857612",
"0.5857612",... | 0.0 | -1 |
/ ========== PRIVATE ========== | private void draw() {
frames++;
MainFrame.singleton().draw();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private stendhal() {\n\t}",
"@Override\n public void perish() {\n \n }",
"@Override\n\tpublic void grabar() {\n\t\t\n\t}",
"@Override\n protected void prot() {\n }",
"@Override\n\tpublic void comer() {\n\t\t\n\t}",
"@Override\n\tprotected void interr() {\n\t}",
"@Override\n protec... | [
"0.6428683",
"0.6168114",
"0.6135315",
"0.60598546",
"0.60335034",
"0.602111",
"0.6018123",
"0.60173225",
"0.59812933",
"0.5955365",
"0.5951618",
"0.5946782",
"0.5946782",
"0.5946782",
"0.5946782",
"0.5946782",
"0.5946782",
"0.5914872",
"0.59095925",
"0.589548",
"0.58949405",... | 0.0 | -1 |
getting the resources for setting strings | private void appInit() {
res = getResources();
//vibrate
audio = (AudioManager)getSystemService(Context.AUDIO_SERVICE);
//set a/b testing variables
COLOR_MARGIN = SRUserData.getInstace().getErrorMargin();
shiftTimeMax = SRUserData.getInstace().getShiftTime();
Typeface Helveticaneue_light = Type... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private void setStrings(){\n ip = context.getResources().getString(R.string.ip);\n port = context.getResources().getString(R.string.port);\n dbName = context.getResources().getString(R.string.db_name);\n user = context.getResources().getString(R.string.masterUser);\n pass = conte... | [
"0.73277915",
"0.65784246",
"0.6535432",
"0.63871336",
"0.63559794",
"0.63119763",
"0.6277059",
"0.6226031",
"0.61642903",
"0.61220735",
"0.6102171",
"0.6088002",
"0.6031061",
"0.5990527",
"0.5976451",
"0.5973097",
"0.5948758",
"0.59273815",
"0.5879933",
"0.5873249",
"0.58687... | 0.0 | -1 |
(run = row of pixels) Validates that block runs have correct runs. Isometric blocks are 32x16, but encoded using 1/2 that (so 16x16=256 pixels) since a square block only contains a diamond's worth of pixels which is exactly half of the area of the square. | @Test
public void dt1_block_iso_tables() {
assertEquals(Tile.SUBTILE_HEIGHT, Block.ISO_X_LEN.length);
assertEquals(Tile.SUBTILE_HEIGHT, Block.ISO_X_OFF.length);
for (int i = 0; i < Tile.SUBTILE_HEIGHT; i++) {
assertEquals(Tile.SUBTILE_WIDTH, Block.ISO_X_LEN[i] + Block.ISO_X_OFF[i] * 2);
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void check() {\n // Your solution here.\n\t \n\t int position=1;\n\t int count=runs.nth(1).item[0];\n\t System.out.println(\"This is the RUNS: \"+toString());\n\t System.out.println(\"This is the Runs Length \"+runs.length());\n\t for(position=2;position<=runs.length();position++) {\n\t\t DListNod... | [
"0.68818325",
"0.59205",
"0.59081537",
"0.5780342",
"0.565204",
"0.56246597",
"0.558611",
"0.55728656",
"0.5528596",
"0.5496523",
"0.54521084",
"0.5441805",
"0.539697",
"0.5378349",
"0.5367612",
"0.53493357",
"0.5346718",
"0.5344335",
"0.5334105",
"0.5329388",
"0.53157336",
... | 0.5493662 | 10 |
Managing life cycle / (nonJavadoc) | @Override
public View onCreateView(LayoutInflater inflater, ViewGroup container, Bundle savedInstanceState) {
View view = inflater.inflate(R.layout.fragment_main, container, false);
// instantiate the graphical components
edtMessage = (EditText) view.findViewById(R.id.edtMessage);
btnAdd = (Button) view.findV... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private void init() {\n }",
"private void init() {\n }",
"private void init() {\n }",
"private void init() {\n }",
"private void init() {\n }",
"private void init() {\n\n\n\n }",
"private void init() {\n\n\t}",
"private void initialize() {\n }",
"protected void _init(){}",
"pro... | [
"0.6956695",
"0.6915739",
"0.6915739",
"0.6915739",
"0.6915739",
"0.69088495",
"0.6897627",
"0.6841256",
"0.6833415",
"0.68189645",
"0.68189645",
"0.6817462",
"0.6804831",
"0.6804831",
"0.67971003",
"0.6786445",
"0.6770522",
"0.67404366",
"0.6737729",
"0.6726073",
"0.67145455... | 0.0 | -1 |
Functional Methods Called by the btnAdd.onClick Copy the content of the editText within the TxvResult | private void addItem() {
String message = edtMessage.getText().toString();
// build the human
Human hum = new Human(message, humans.size());
// 1° method
arrayAdapter.add(hum);
// 2° method
// messages.add(message);
// arrayAdapter.notifyDataSetChanged();
// and flush
edtMessage.setText("");
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n //nhan ket qua man hinh khac tra ve Main\n protected void onActivityResult(int requestCode, int resultCode, @Nullable Intent data) {\n if (requestCode == REQUEST_CODE_EDIT && resultCode == RESULT_OK && data != null){\n String name = data.getStringExtra(\"New\");\n txt... | [
"0.61755264",
"0.6152658",
"0.6140859",
"0.606267",
"0.60314715",
"0.58868736",
"0.58501875",
"0.5800394",
"0.5779014",
"0.5775311",
"0.5762208",
"0.5744807",
"0.5723403",
"0.5716137",
"0.571176",
"0.5691986",
"0.56898814",
"0.56689626",
"0.5653928",
"0.56525755",
"0.56467754... | 0.0 | -1 |
Called when an item of the ListView is clicked | private void itemSelected(int position) {
messageToPasteFromTheListView=arrayAdapter.getItem(position).getMessage();
getActivity().showDialog(((MainActivity)getActivity()).dialogID);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n public void onItemClick(View view, ListItem obj, int position) {\n }",
"@Override\n public void onListItemClicked(int position) {\n\n }",
"@Override\n public void onClick(View view) { listener.onItemClick(view, getPosition()); }",
"public void onItemClick(View v... | [
"0.7982267",
"0.7896868",
"0.7881725",
"0.78614694",
"0.78543925",
"0.7838995",
"0.7836879",
"0.7818022",
"0.7792524",
"0.77718985",
"0.77566123",
"0.7719705",
"0.7696375",
"0.7692615",
"0.7683149",
"0.7683149",
"0.7683149",
"0.76783425",
"0.7677578",
"0.7677578",
"0.7677578"... | 0.0 | -1 |
Copy the selected human's message within the edtMessage | void copyItemInEdt() {
edtMessage.setText(messageToPasteFromTheListView);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@FXML\n private void copyEdit() {\n final Clipboard clipboard = Clipboard.getSystemClipboard();\n final ClipboardContent url = new ClipboardContent();\n url.putString(EDIT_MESSAGE);\n clipboard.setContent(url);\n }",
"@Override\n\tpublic void editorCopy()\n\t{\n\t\tclipboard = s... | [
"0.5842892",
"0.5745036",
"0.5647425",
"0.5533",
"0.5481381",
"0.5449734",
"0.5444156",
"0.54426473",
"0.5355003",
"0.5345017",
"0.5338049",
"0.5332491",
"0.5330828",
"0.5296807",
"0.52955824",
"0.52892625",
"0.52892625",
"0.52892625",
"0.52585894",
"0.5249556",
"0.523556",
... | 0.6855717 | 0 |
Sgets the size of the preview | private Camera.Size getBestPreviewSize(int width, int height,
Camera.Parameters parameters) {
Camera.Size result=null;
for (Camera.Size size : parameters.getSupportedPreviewSizes()) {
if (size.width <= width && size.height<=height) {
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"void previewSized();",
"String getPreviewSizePref();",
"public Size getPreviewSize() {\n String pair = get(\"preview-size\");\n if (pair == null)\n return null;\n String[] dims = pair.split(\"x\");\n if (dims.length != 2)\n return null;\... | [
"0.80598795",
"0.77034044",
"0.73421127",
"0.6905159",
"0.68405664",
"0.6787353",
"0.6638439",
"0.6580174",
"0.653927",
"0.6535367",
"0.6521493",
"0.6501916",
"0.64842653",
"0.64544654",
"0.64419484",
"0.643629",
"0.6430965",
"0.6414542",
"0.64091843",
"0.6381942",
"0.6367543... | 0.0 | -1 |
Sets up the peview holder surface | private void initPreview(int width, int height) {
if (camera!=null && previewHolder.getSurface()!=null) {
try {
camera.setPreviewDisplay(previewHolder);
}
catch (Throwable t) {
Log.e("PreviewDemo-surfaceCallback",
"Excep... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"void setupPresenter() {\n mPresenter = new leaguePresenter(this);\n ScheduleList.getInstance().setPresenter(mPresenter);\n }",
"private void setupView() {\n view.setName(advertisement.getTitle());\n view.setPrice(advertisement.getPrice());\n view.setDescription(advertisement... | [
"0.65965605",
"0.64717615",
"0.644694",
"0.6386695",
"0.635759",
"0.6346404",
"0.6297869",
"0.6295856",
"0.6260289",
"0.6238584",
"0.6235194",
"0.6232764",
"0.62179047",
"0.62166595",
"0.6213492",
"0.62032366",
"0.6194581",
"0.6186565",
"0.6178157",
"0.61653817",
"0.61653054"... | 0.0 | -1 |
Starts the camera preview | private void startPreview() {
if (cameraConfigured && camera!=null) {
camera.startPreview();
inPreview=true;
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void startPreview() {\r\n\t\tCamera localCamera = camera;\r\n\t\tif (localCamera != null && !isPreview) {\r\n\t\t\tcamera.startPreview();\r\n\t\t\tisPreview = true;\r\n\t\t}\r\n\t}",
"public synchronized void startPreview() {\n OpenCamera theCamera = camera;\n if (theCamera != null && !previ... | [
"0.8339843",
"0.82391626",
"0.81524336",
"0.8129809",
"0.80537784",
"0.8028276",
"0.78849727",
"0.7817719",
"0.77715343",
"0.75269",
"0.7525369",
"0.75233996",
"0.7485014",
"0.74849993",
"0.74830645",
"0.74142516",
"0.73983276",
"0.736726",
"0.7339811",
"0.73290193",
"0.73286... | 0.8697355 | 0 |
sets the orientation to portriat | public void surfaceCreated(SurfaceHolder holder) {
camera.setDisplayOrientation(90);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"void setOrientation(int orientation) {\n }",
"public void setOrientation(Direction orientation);",
"public void setOrientation(int orientation){\n //save orientation of phone\n mOrientation = orientation;\n }",
"public void invertOrientation() {\n\t\tPoint3D temp = getPoint(2);\n\t\tsetPo... | [
"0.7404526",
"0.73873645",
"0.70832944",
"0.7068926",
"0.7023553",
"0.69319177",
"0.6870159",
"0.68626857",
"0.6847897",
"0.6800478",
"0.67971903",
"0.6788306",
"0.67863584",
"0.67592496",
"0.67364943",
"0.663991",
"0.6630235",
"0.6626853",
"0.6577556",
"0.6553077",
"0.651602... | 0.0 | -1 |
Inflate the menu; this adds items to the action bar if it is present. | @Override
public boolean onCreateOptionsMenu(Menu menu) {
getMenuInflater().inflate(R.menu.menu_main, menu);
return true;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n public boolean onCreateOptionsMenu(Menu menu) {\n \tMenuInflater inflater = getMenuInflater();\n \tinflater.inflate(R.menu.main_activity_actions, menu);\n \treturn super.onCreateOptionsMenu(menu);\n }",
"@Override\n public void onCreateOptionsMenu(Menu menu, MenuInflater inflater) {... | [
"0.7246102",
"0.7201358",
"0.7194834",
"0.7176498",
"0.71066517",
"0.7039537",
"0.7037961",
"0.70112145",
"0.70094734",
"0.69807225",
"0.6944953",
"0.69389373",
"0.6933199",
"0.6916928",
"0.6916928",
"0.6891486",
"0.68831646",
"0.68754137",
"0.68745375",
"0.68621665",
"0.6862... | 0.0 | -1 |
Handle action bar item clicks here. The action bar will automatically handle clicks on the Home/Up button, so long as you specify a parent activity in AndroidManifest.xml. | @Override
public boolean onOptionsItemSelected(MenuItem item) {
int id = item.getItemId();
//noinspection SimplifiableIfStatement
if (id == R.id.action_settings) {
// shows when info is clicked
Toast.makeText(getApplicationContext(), "Please enter a height in feet... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n public boolean onOptionsItemSelected(MenuItem item) { Handle action bar item clicks here. The action bar will\n // automatically handle clicks on the Home/Up button, so long\n // as you specify a parent activity in AndroidManifest.xml.\n\n //\n // HANDLE BACK BUTTON\n ... | [
"0.7904975",
"0.78056985",
"0.77671826",
"0.77275974",
"0.7632173",
"0.7622138",
"0.75856143",
"0.7531176",
"0.7488386",
"0.74576557",
"0.74576557",
"0.74391466",
"0.7422802",
"0.7403698",
"0.7392229",
"0.73873955",
"0.73796785",
"0.737091",
"0.73627585",
"0.7356357",
"0.7346... | 0.0 | -1 |
finds the degree the phone is being held by using the values from the accelerometer finds the angle by taking the arctangent of the values from the sensor | @Override
public void onSensorChanged(SensorEvent event) {
theta = (float) Math.toDegrees(Math.atan(event.values[1] / event.values[2]));
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public AccOrientation calculateAngle(SensorEvent event) {\t\t\n\t final int _DATA_X = 0;\n\t final int _DATA_Y = 1;\n\t final int _DATA_Z = 2;\n\t // Angle around x-axis thats considered almost perfect vertical to hold\n\t // the device\n\t final int PIVOT = 20;\n\t ... | [
"0.6908449",
"0.68594503",
"0.685775",
"0.67822516",
"0.67565155",
"0.66290027",
"0.65866643",
"0.65591055",
"0.6553956",
"0.65355456",
"0.6400375",
"0.6400375",
"0.6389474",
"0.6386566",
"0.63611704",
"0.632323",
"0.63054633",
"0.6269023",
"0.62609196",
"0.6248676",
"0.62370... | 0.6977775 | 0 |
Empty Constructor Empty Constructor. | public CompareSkusFormHandler() {
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@SuppressWarnings(\"unused\")\n public NoConstructor() {\n // Empty\n }",
"public Constructor(){\n\t\t\n\t}",
"ConstructorPractice () {\n\t\tSystem.out.println(\"Default Constructor\");\n\t}",
"Constructor() {\r\n\t\t \r\n\t }",
"defaultConstructor(){}",
"void DefaultConstructor(... | [
"0.85825896",
"0.8022161",
"0.780842",
"0.7758225",
"0.77422917",
"0.7723969",
"0.7461144",
"0.74162495",
"0.74051297",
"0.73633254",
"0.73072094",
"0.7301842",
"0.7296349",
"0.7289588",
"0.72882587",
"0.72742856",
"0.72545964",
"0.7252153",
"0.7230246",
"0.7228304",
"0.72134... | 0.0 | -1 |
Sets the Repository the Products/SKUs are in. This property is typically set initially in this FormHandler's properties file. | public void setRepository(Repository pRepository) {
mRepository = pRepository;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"void setRepository(Repository repository);",
"public void setRepository(Repository repo) {\n\t\tthis.repo = repo;\n\t}",
"public void setRepository(String repository) {\n this.repository = repository;\n }",
"public void setRepository(String repository) {\n this.repository = repository;\n ... | [
"0.656126",
"0.65445",
"0.6479083",
"0.6479083",
"0.6140103",
"0.6114065",
"0.6015628",
"0.59944004",
"0.5953053",
"0.5860558",
"0.58518744",
"0.58251303",
"0.5759269",
"0.5757763",
"0.57570106",
"0.56685793",
"0.5632293",
"0.5621283",
"0.5616683",
"0.55952436",
"0.55917513",... | 0.65446126 | 1 |
Gets the Repository the Products/SKUs are in. | public Repository getRepository() {
return mRepository;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"Repository getRepository();",
"public String getRepository() {\n return repository;\n }",
"public String getRepository() {\n return repository;\n }",
"protected SlingRepository getRepository() {\n return repository;\n }",
"@Override\n public GetRepositoryResult getRepository(GetR... | [
"0.6856136",
"0.6809209",
"0.6809209",
"0.6517809",
"0.6405991",
"0.63896936",
"0.63334584",
"0.6295464",
"0.62677014",
"0.62054014",
"0.6089754",
"0.6076695",
"0.60614485",
"0.60097575",
"0.5984273",
"0.59412843",
"0.58932334",
"0.58911794",
"0.58782727",
"0.5869227",
"0.585... | 0.6786778 | 3 |
not null...empty. Sets the list of Products the user wants to compare against. This list contains Product RepositoryItems. NOTE: This list will most likely contain duplicates. If the Product has x number of SKUs, the Product will be added to the ProductCompareList x times so that the length of the ProductCompareList an... | public void setProductCompareList(List pProductCompareList) {
mProductCompareList = pProductCompareList;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Test\n public void addProductsToCompareListTest() {\n YandexMarketHomePage homePage = new YandexMarketHomePage(driver);\n homePage.open();\n\n // 2. Select category of products\n homePage.selectCategory(\"Электроника\");\n\n // 3. Select subcategory of products\n new Y... | [
"0.6950475",
"0.69174874",
"0.68241763",
"0.67991644",
"0.6476417",
"0.6339778",
"0.61811966",
"0.60141474",
"0.6010506",
"0.59512925",
"0.58731234",
"0.5841725",
"0.5798238",
"0.57839173",
"0.5744755",
"0.57019025",
"0.5676764",
"0.56641436",
"0.5602053",
"0.5598789",
"0.558... | 0.7284581 | 0 |
This method returns the list of Products the user wants to compare against. This list contains Product RepositoryItems. NOTE: This list will most likely contain duplicates. If the Product has x number of SKUs, the Product will be added to the ProductCompareList x times so that the length of the ProductCompareList and t... | public List getProductCompareList() {
return mProductCompareList;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Test\n public void addProductsToCompareListTest() {\n YandexMarketHomePage homePage = new YandexMarketHomePage(driver);\n homePage.open();\n\n // 2. Select category of products\n homePage.selectCategory(\"Электроника\");\n\n // 3. Select subcategory of products\n new Y... | [
"0.63670623",
"0.62715626",
"0.6188346",
"0.61857235",
"0.60840267",
"0.6048627",
"0.59780383",
"0.59470683",
"0.59320027",
"0.5861049",
"0.5848242",
"0.5834808",
"0.57222766",
"0.56840694",
"0.56807005",
"0.56731844",
"0.56683654",
"0.5667441",
"0.56064314",
"0.55517185",
"0... | 0.6963358 | 0 |
not null...empty. Sets the list of SKUs the user wants to compare against. This list contains SKU RepositoryItems. This list will not typically contain duplicates. | public void setSkuCompareList(List pSkuCompareList) {
mSkuCompareList = pSkuCompareList;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public List getSkuCompareList() {\n return mSkuCompareList;\n }",
"List<SkuAvailability> lookupSKUAvailability(List<Long> skuIds, boolean realTime);",
"@Override\n\tpublic boolean equals(Object obj) {\n\t\tif(obj instanceof Product) {\n\t\tProduct newProduct = (Product)obj;\n\t\t return this.getSKU() == ne... | [
"0.62764424",
"0.55918705",
"0.5518481",
"0.5507717",
"0.550537",
"0.54664165",
"0.5371134",
"0.5356908",
"0.53541565",
"0.5351975",
"0.53493893",
"0.53394717",
"0.53228426",
"0.53055614",
"0.53054756",
"0.52988434",
"0.52169985",
"0.5155248",
"0.5154792",
"0.51439196",
"0.51... | 0.60508835 | 1 |
This method returns the list of SKUs the user wants to compare against. This list contains SKU RepositoryItems. This list will not typically contain duplicates. | public List getSkuCompareList() {
return mSkuCompareList;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public String getSku() {\n return sku;\n }",
"public String getSku() {\r\n return sku;\r\n }",
"public String getSku() {\n return sku;\n }",
"public java.lang.String getSku() {\n return sku;\n }",
"public List<BaseJSFVO> getUnitUPCs() {\n\t\tList<BaseJSFVO> list = new Arra... | [
"0.56061023",
"0.5590381",
"0.55711794",
"0.555946",
"0.5541099",
"0.5471743",
"0.54581",
"0.54533505",
"0.539005",
"0.5387401",
"0.5285188",
"0.52791697",
"0.5260683",
"0.5256295",
"0.5223864",
"0.5221547",
"0.52170444",
"0.5182893",
"0.5126831",
"0.5042102",
"0.5039333",
... | 0.6655578 | 0 |
Sets the index of the first item the user wants to compare. This value is used as an index into the ProductCompareList or SkuCompareList. | public void setSelectedIndex1(String newVal) {
mSelectedIndex1 = newVal;
if (isLoggingDebug())
logDebug("SelectedIndex1 set to: " + newVal);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n void setupState(TYPE firstItem) {\n currentItem = 0;\n }",
"public void setIndex(int index) { this.index = index; }",
"public void setItemIndex(int itemIndex) {\n this.itemIndex = itemIndex;\n }",
"public void setFirstCategoryIndex(int first) {\n/* 118 */ if (first < 0 ... | [
"0.59219545",
"0.5726539",
"0.55740094",
"0.5520981",
"0.551709",
"0.5503407",
"0.54972637",
"0.53924304",
"0.53064036",
"0.52891636",
"0.5265941",
"0.5252141",
"0.525151",
"0.52293986",
"0.51592994",
"0.5142587",
"0.5132399",
"0.513004",
"0.51209325",
"0.51190317",
"0.510982... | 0.49334452 | 55 |
This method returns the index of the first item the user wants to compare. This value is used as an index into the ProductCompareList or SkuCompareList. | public String getSelectedIndex1() {
return mSelectedIndex1;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private int findIndex(T item){\n for(int i = 0; i < numItems; i++){\n if(arr[i].equals(item))\n return i;\n }\n return -1;\n }",
"private int getSelectedCustomerIndex() {\n\t\tString selection = (String) nameBox.getSelectedItem();\t//retrieves the selected name\n... | [
"0.6454204",
"0.6360591",
"0.6344948",
"0.63135475",
"0.6312804",
"0.6310712",
"0.6253049",
"0.6238965",
"0.621736",
"0.61844873",
"0.61674035",
"0.6147",
"0.6142457",
"0.61331165",
"0.6113925",
"0.6082306",
"0.6074561",
"0.60579157",
"0.6047797",
"0.60334647",
"0.5951847",
... | 0.0 | -1 |
Sets the index of the second item the user wants to compare. This value is used as an index into the ProductCompareList or SkuCompareList. | public void setSelectedIndex2(String newVal) {
mSelectedIndex2 = newVal;
if (isLoggingDebug())
logDebug("SelectedIndex2 set to: " + newVal);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void setFilter2(int index, java.lang.String value) {\n\t\tthis.setValue(FILTER2, index, value);\n\t}",
"@SuppressWarnings(\"unchecked\")\n\tpublic void set_List_Of_Product_Type_Of_Store_Two()\n\t{\n\t\tArrayList<Product> Product_Of_Store_Two = new ArrayList<Product>(); /* ArrayList Of Product */\n\... | [
"0.57167226",
"0.554519",
"0.55313164",
"0.55029774",
"0.550087",
"0.53663915",
"0.5357313",
"0.53410095",
"0.5286386",
"0.5274616",
"0.5244751",
"0.5218605",
"0.52161443",
"0.51405394",
"0.51211786",
"0.5084301",
"0.5076881",
"0.5070563",
"0.50678515",
"0.50383294",
"0.49745... | 0.56527215 | 1 |
Returns the index of the second item the user wants to compare. This value is used as an index into the ProductCompareList or SkuCompareList. | public String getSelectedIndex2() {
return mSelectedIndex2;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private String findIndexOfI (Comparable<E> item) {\n String compareString = item.toString();\n for (int i = 0; i < data.length; i++) {\n if (data[i].toString().equals(item)) {\n return data[i].toString();\n } else {\n String compareSecond = compareS... | [
"0.6144584",
"0.6039328",
"0.6033104",
"0.60157233",
"0.6000866",
"0.59344786",
"0.5912567",
"0.58411753",
"0.58043075",
"0.57713705",
"0.57200456",
"0.5692642",
"0.56887686",
"0.56837696",
"0.56688315",
"0.5665734",
"0.5645457",
"0.5634431",
"0.5621073",
"0.55997777",
"0.557... | 0.55455667 | 36 |
Sets the productId of the Product to add to the Compare Lists. This property contains the productId represented as a string. The Product/SKUs don't get added to the Compare Lists until the handleAddItemToCompareList method gets invoked. | public void setProductToCompare(String productId) {
mProductToCompare = productId;
if (isLoggingDebug())
logDebug("ProductToCompare:" + productId);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"protected void setProductId(String productId) {\n this.productId = productId;\n }",
"public void setProductId(String productId) {\r\n\t\tthis.productId = productId;\r\n\t}",
"public void setProductId(String productId) ;",
"public void setProductId(String productId) {\n this.productId = produ... | [
"0.7008651",
"0.6834212",
"0.6797948",
"0.67900294",
"0.67520255",
"0.67520255",
"0.673891",
"0.673891",
"0.673891",
"0.6699958",
"0.6590375",
"0.65689296",
"0.6515602",
"0.6515602",
"0.6515602",
"0.6515602",
"0.6515602",
"0.6515602",
"0.65015334",
"0.64821523",
"0.64798653",... | 0.7892068 | 0 |
Gets the productId of the Product to add to Compare List. | public String getProductToCompare() {
return mProductToCompare;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void setProductToCompare(String productId) {\n mProductToCompare = productId;\n if (isLoggingDebug())\n logDebug(\"ProductToCompare:\" + productId);\n }",
"public int newProductId() {\n int newId = 0;\n for (Product product : allProducts) {\n if(newId <= product.getId(... | [
"0.69188553",
"0.67552346",
"0.6730262",
"0.66894567",
"0.65923977",
"0.65923977",
"0.65923977",
"0.65923977",
"0.65923977",
"0.6577",
"0.6565976",
"0.6554552",
"0.6554306",
"0.6554306",
"0.6551783",
"0.6499979",
"0.6499979",
"0.6499979",
"0.6499979",
"0.6499979",
"0.6499979"... | 0.6288747 | 29 |
Sets the property AddToCompareListSuccessURL. This property is normally set on a jhtml page. It indicates which page we should redirect to if NO errors occur when the user pushes the button which adds a specific Product (and its SKUs) to the Compare Lists. | public void setAddToCompareListSuccessURL(String pAddToCompareListSuccessURL) {
mAddToCompareListSuccessURL = pAddToCompareListSuccessURL;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public String getAddToCompareListSuccessURL() {\n return mAddToCompareListSuccessURL;\n }",
"public void setCompareSkusSuccessURL(String pCompareSkusSuccessURL) {\n mCompareSkusSuccessURL = pCompareSkusSuccessURL;\n }",
"public String getCompareSkusSuccessURL() {\n return mCompareSkusSuccessURL;\n ... | [
"0.7779078",
"0.7260172",
"0.6590341",
"0.61854315",
"0.5599555",
"0.55723214",
"0.55205643",
"0.54750097",
"0.5344646",
"0.5307488",
"0.5283675",
"0.52610433",
"0.52431566",
"0.52430207",
"0.52430207",
"0.52396053",
"0.5166226",
"0.51467514",
"0.514525",
"0.51109403",
"0.508... | 0.84615314 | 0 |
Returns property AddToCompareListSuccessURL. It indicates which page (ie URL) we should redirect to if NO errors occur when the user pushes the button which adds a specific Product (and its SKUs) to the Compare Lists. No redirect occurs if the current URL is the same as this URL. | public String getAddToCompareListSuccessURL() {
return mAddToCompareListSuccessURL;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void setAddToCompareListSuccessURL(String pAddToCompareListSuccessURL) {\n mAddToCompareListSuccessURL = pAddToCompareListSuccessURL;\n }",
"public String getCompareSkusSuccessURL() {\n return mCompareSkusSuccessURL;\n }",
"public String getSuccessUrl() {\n return successUrl;\n }",
"... | [
"0.77369785",
"0.69511527",
"0.6443776",
"0.6374193",
"0.56381875",
"0.56169593",
"0.5583156",
"0.5537338",
"0.5421523",
"0.5368323",
"0.53054905",
"0.5296376",
"0.52960706",
"0.5243343",
"0.52327335",
"0.52104485",
"0.51481074",
"0.5118599",
"0.50524896",
"0.50470483",
"0.50... | 0.8257931 | 0 |
Method: preAddToCompareList This method provides an easy way for users to extend the functionality of the handleAddToCompareList method. The preAddToCompareList code will be executed at the start of the handleAddToCompareList method. This default implementation does nothing. | public void preAddToCompareList(DynamoHttpServletRequest pRequest,
DynamoHttpServletResponse pResponse)
throws ServletException,
IOException
{
if (isLoggingDebug())
logDebug("in CompareSkusFormHandle... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void postAddToCompareList(DynamoHttpServletRequest pRequest,\n DynamoHttpServletResponse pResponse)\n throws ServletException,\n IOException\n {\n if (isLoggingDebug())\n logDebug(\"in Compa... | [
"0.60828847",
"0.5527584",
"0.5457573",
"0.5433638",
"0.5385566",
"0.53702295",
"0.5294863",
"0.5288103",
"0.5277191",
"0.52689004",
"0.5172322",
"0.51525617",
"0.5130125",
"0.50894016",
"0.50854325",
"0.5076321",
"0.5075663",
"0.50756186",
"0.5062325",
"0.50510234",
"0.50390... | 0.74325883 | 0 |
Method: postAddToCompareList This method provides an easy way for users to extend the functionality of the handleAddToCompareList method. The postAddToCompareList code will be executed at the end of the handleAddToCompareList method. This default implementation does nothing. | public void postAddToCompareList(DynamoHttpServletRequest pRequest,
DynamoHttpServletResponse pResponse)
throws ServletException,
IOException
{
if (isLoggingDebug())
logDebug("in CompareSkusFormHa... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void preAddToCompareList(DynamoHttpServletRequest pRequest,\n DynamoHttpServletResponse pResponse)\n throws ServletException,\n IOException\n {\n if (isLoggingDebug())\n logDebug(\"in CompareSk... | [
"0.6442841",
"0.5354693",
"0.53360087",
"0.5270979",
"0.5249391",
"0.51753074",
"0.5108055",
"0.50372136",
"0.4964819",
"0.49033734",
"0.48922202",
"0.4835027",
"0.48036584",
"0.4798889",
"0.47944728",
"0.47777075",
"0.47693005",
"0.47639006",
"0.47609478",
"0.47447985",
"0.4... | 0.73479676 | 0 |
Sets property CompareSkusSuccessURL. This property is normally set on a jhtml page. It indicates which page we should redirect to if NO errors occur when the user pushes the COMPARE button on a page which compares SKUs. | public void setCompareSkusSuccessURL(String pCompareSkusSuccessURL) {
mCompareSkusSuccessURL = pCompareSkusSuccessURL;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public String getCompareSkusSuccessURL() {\n return mCompareSkusSuccessURL;\n }",
"public void setAddToCompareListSuccessURL(String pAddToCompareListSuccessURL) {\n mAddToCompareListSuccessURL = pAddToCompareListSuccessURL;\n }",
"public String getSuccessUrl() {\n return successUrl;\n }",
"... | [
"0.80523825",
"0.71778125",
"0.62334985",
"0.6103499",
"0.6090141",
"0.5740295",
"0.5654032",
"0.5635946",
"0.56275237",
"0.56275237",
"0.5614404",
"0.5499444",
"0.54657924",
"0.54657924",
"0.54657924",
"0.5461155",
"0.5413441",
"0.53905594",
"0.53670734",
"0.52498657",
"0.52... | 0.8775879 | 0 |
Returns property CompareSkusSuccessURL. It indicates which page we should redirect to if NO errors occur when the user pushes the COMPARE button on a page which compares SKUs. | public String getCompareSkusSuccessURL() {
return mCompareSkusSuccessURL;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void setCompareSkusSuccessURL(String pCompareSkusSuccessURL) {\n mCompareSkusSuccessURL = pCompareSkusSuccessURL;\n }",
"public String getSuccessUrl() {\n return successUrl;\n }",
"public String getAddToCompareListSuccessURL() {\n return mAddToCompareListSuccessURL;\n }",
"public voi... | [
"0.782388",
"0.674217",
"0.658483",
"0.6427025",
"0.60464746",
"0.5978353",
"0.5597736",
"0.5531497",
"0.5506527",
"0.54863316",
"0.542311",
"0.5288576",
"0.5218278",
"0.5197745",
"0.5197745",
"0.5197745",
"0.5197745",
"0.5148464",
"0.5112562",
"0.4929963",
"0.4921604",
"0.... | 0.85120106 | 0 |
Method: preCompareSkus This method provides an easy way for users to extend the functionality of the handleCompareSkus method. The preCompareSkus code will be executed at the start of the handleCompareSkus method. This default implementation does nothing. | public void preCompareSkus(DynamoHttpServletRequest pRequest,
DynamoHttpServletResponse pResponse)
throws ServletException,
IOException
{
if (isLoggingDebug())
logDebug("in CompareSkusFormHandler.preCompareSkus"... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void preAddToCompareList(DynamoHttpServletRequest pRequest,\n DynamoHttpServletResponse pResponse)\n throws ServletException,\n IOException\n {\n if (isLoggingDebug())\n logDebug(\"in CompareSk... | [
"0.5852443",
"0.5397765",
"0.5272083",
"0.5081283",
"0.50284135",
"0.5003496",
"0.49907985",
"0.4983478",
"0.4976346",
"0.4949486",
"0.4912526",
"0.48824003",
"0.48791027",
"0.48741364",
"0.48445833",
"0.48357633",
"0.48192248",
"0.47966358",
"0.4784099",
"0.4758162",
"0.4751... | 0.7312731 | 0 |
Method: postCompareSkus This method provides an easy way for users to extend the functionality of the handleCompareSkus method. The postCompareSkus code will be executed at the end of the handleCompareSkus method. This default implementation does nothing. | public void postCompareSkus(DynamoHttpServletRequest pRequest,
DynamoHttpServletResponse pResponse)
throws ServletException,
IOException
{
if (isLoggingDebug())
logDebug("in CompareSkusFormHandler.postCompareSku... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void preCompareSkus(DynamoHttpServletRequest pRequest,\n DynamoHttpServletResponse pResponse)\n throws ServletException,\n IOException\n {\n if (isLoggingDebug())\n logDebug(\"in CompareSkusFormHandler.pre... | [
"0.6297188",
"0.54793346",
"0.50778425",
"0.49208182",
"0.48546812",
"0.47708592",
"0.47429547",
"0.47250512",
"0.46758267",
"0.45640793",
"0.45107362",
"0.4509108",
"0.44501063",
"0.44401208",
"0.4398993",
"0.4398993",
"0.43905976",
"0.43837655",
"0.43718195",
"0.4370438",
"... | 0.7193837 | 0 |
Method: getUserLocale Returns either the Locale from the Request object (if it isn't NULL), or the Locale from the JVM. | protected Locale getUsersLocale (DynamoHttpServletRequest pRequest) {
//Try to get the locale from the Request object:
RequestLocale requestLocale = pRequest.getRequestLocale();
if (requestLocale != null) {
return requestLocale.getLocale();
}
//If no locale value in the Request object, get t... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static String getUserLocale(final HttpServletRequest request) {\n String userLocaleStr = getUserLocale(request.getCookies());\n if (userLocaleStr == null && request.getLocale() != null) {\n userLocaleStr = request.getLocale().toString();\n }\n return userLocaleStr;\n ... | [
"0.77227545",
"0.76077276",
"0.7399147",
"0.7306778",
"0.7284748",
"0.7228477",
"0.71359676",
"0.7076198",
"0.6906198",
"0.6865327",
"0.6738348",
"0.6682286",
"0.657932",
"0.6475445",
"0.6328147",
"0.62710625",
"0.6238279",
"0.6191993",
"0.61845845",
"0.61837953",
"0.61677516... | 0.8111624 | 0 |
Creates a new internal artefact for the given name. | public Artefact createArtefact(final String name) {
final Artefact old = artefacts.get(name);
if (old != null)
throw new IllegalArgumentException("Artefact '" + name + "' already exists: " + old);
final Artefact a = new Artefact(name);
artefacts.put(a.getName(), a);
return a;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"Artefact(String aName) {\n\t\tname = aName;\n\t\tattributes = new ConcurrentHashMap<>();\n\t\texternalConfigurations = new ArrayList<>();\n\t\tcontentMap = new HashMap<>();\n\t}",
"public Recipe createRecipe(String name) {\r\n\t\tRecipe recipe=new Recipe(name,this);\r\n\t\trecipes.add(recipe);\r\n\t\treturn reci... | [
"0.62284833",
"0.60516495",
"0.596422",
"0.5932947",
"0.57946366",
"0.57927454",
"0.57867485",
"0.5596459",
"0.559159",
"0.558643",
"0.55804634",
"0.55523306",
"0.54222584",
"0.5416576",
"0.541456",
"0.538733",
"0.53285795",
"0.53190386",
"0.5283983",
"0.5243268",
"0.52408475... | 0.80957204 | 0 |
Returns the artefact from the internal storage. | public Artefact getArtefact(String name) {
return artefacts.get(name);
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"OStorage getStorage();",
"public RecipeStorage getRecipeStorage() {\n return RecipeStorage.getInstance();\n }",
"ArtefactModel getArtefactModel();",
"private void readFromInternalStorage() {\n ArrayList<GeofenceObjects> returnlist = new ArrayList<>();\n if (!isExternalStorageReadable(... | [
"0.60918784",
"0.59920305",
"0.5891976",
"0.5740414",
"0.5716446",
"0.5644495",
"0.5618367",
"0.55417055",
"0.55076784",
"0.54929245",
"0.5470059",
"0.545857",
"0.5436802",
"0.54257435",
"0.53904295",
"0.5363173",
"0.5349765",
"0.5340831",
"0.5330961",
"0.5326685",
"0.5317398... | 0.63972366 | 0 |
Returns true if the configuration for the given configuration name is available. | public boolean hasConfiguration(String name) {
return getArtefact(name) != null;
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public boolean configurationValueExists(String name);",
"boolean hasConfiguration();",
"private boolean IsCfgExisted()\n {\n File f = new File(strCfgPath);\n if(f.exists())\n return true;\n return false;\n }",
"boolean hasConfigConnectorConfig();"... | [
"0.76795286",
"0.76208746",
"0.69374967",
"0.68697625",
"0.67596465",
"0.6721054",
"0.671319",
"0.66122985",
"0.657862",
"0.65497786",
"0.65280783",
"0.6522422",
"0.6521997",
"0.6504484",
"0.64941823",
"0.64781725",
"0.64185846",
"0.6418",
"0.6403219",
"0.639367",
"0.63865846... | 0.8413607 | 0 |
Returns a snapshot of the configuration with the given name in the given environment. | public Configuration getConfiguration(final String name, Environment environment) {
if (environment == null)
environment = GlobalEnvironment.INSTANCE;
final Artefact a = getArtefact(name);
if (a == null)
throw new IllegalArgumentException("No such artefact: " + name);
final ConfigurationImpl configuration... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static YamlConfiguration copy(String name){\r\n\t\t\tif (!name.endsWith(\".yml\")) {\r\n\t\t\t\tname += \".yml\";\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\tYamlConfiguration config = getConfig(name);\r\n\t\t\t\r\n\t\t\t//Does this config exist?\r\n\t\t\tif (config == null){\r\n\t\t\t\tconfig = YamlConfiguration.loadCon... | [
"0.523404",
"0.51104397",
"0.5033189",
"0.499856",
"0.49354196",
"0.49291113",
"0.4925516",
"0.48689708",
"0.48313755",
"0.48038253",
"0.47971487",
"0.47899446",
"0.47651553",
"0.46739483",
"0.46676013",
"0.46397457",
"0.46202704",
"0.4619968",
"0.45590955",
"0.45559132",
"0.... | 0.6196669 | 0 |
Created by zhou on 2018/3/26. | public interface BookSourceContract {
interface View extends BaseContract.BaseView {
void showBookSource(List<BookSource> list);
}
interface Presenter extends BaseContract.BasePresenter<View> {
void getBookSource(String view, String book);
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n public void perish() {\n \n }",
"private stendhal() {\n\t}",
"@Override\n\tpublic void comer() {\n\t\t\n\t}",
"@Override\n\tpublic void grabar() {\n\t\t\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... | [
"0.6251588",
"0.61523974",
"0.60011804",
"0.59715784",
"0.59139603",
"0.59139603",
"0.5864459",
"0.5838565",
"0.58192825",
"0.5799691",
"0.57917166",
"0.57703006",
"0.57646555",
"0.57525295",
"0.5746258",
"0.57298523",
"0.5728457",
"0.5725054",
"0.5720507",
"0.57196116",
"0.5... | 0.0 | -1 |
METHOD 0: USER SELECTION This method prompts a user to select which one of the four different options they would like to run. This is of type nonreturn. | public static void userSelection(){
int selection;
Scanner input = new Scanner(System.in);
System.out.println("Which program would you like to run?");
selection=input.nextInt();
if(selection == 1)
mazeUnion();
if(selection == 2)
unionPathCompression();
if(selection == 3)
mazeHeight();
if(selec... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void select() {\n \t\t\tString sinput = \"\";\r\n \t\t\tOption selected = null;\r\n \t\t\tErrorLog.debug(name + \" selected.\");\r\n \t\t\t\r\n \t\t\twhile (true) {\r\n \t\t\t\tSystem.out.println(toString()); //Print menu.\r\n \t\t\t\tsinput = read(); //Get user selection.\r\n \t\t\t\tif (!sinput.equalsIgno... | [
"0.73872167",
"0.6948273",
"0.69397527",
"0.6921872",
"0.69058275",
"0.6669016",
"0.66130894",
"0.6583025",
"0.6567246",
"0.6522242",
"0.6497088",
"0.6487137",
"0.63588744",
"0.6318364",
"0.63127416",
"0.6308318",
"0.6307601",
"0.6292065",
"0.6269023",
"0.62541324",
"0.624371... | 0.74674165 | 0 |
METHOD 1: Standard Union This method runs the standard union to solve the maze. This is of type nonreturn. | public static void mazeUnion(){
int n = 10;
dsf S = new dsf(n*n);
Maze one = new Maze(n);
Random random;
int sets = n*n; //number of sets in the DSF
int randomNumber;
int randomDirection;
int row;
int col;
char upperRight; //bottom or right
S.print();
while(sets > 1){
random = new Ran... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static void unionPathCompression(){\n\t\tint n = 10;\t\n\n\t\tdsf S = new dsf(n*n);\n\t\tMaze two = new Maze(n);\n\n\t\tRandom random;\n\t\tint sets = n*n;\t//number of sets in the DSF\n\t\tint randomNumber;\n\t\tint randomDirection;\n\t\tint row;\n\t\tint col;\n\n\t\tchar upperRight; \t//bottom or right\n\... | [
"0.61534077",
"0.597279",
"0.5869835",
"0.57261795",
"0.5699082",
"0.562815",
"0.56234",
"0.5595696",
"0.5554469",
"0.5535207",
"0.5522203",
"0.5482909",
"0.54091316",
"0.5408422",
"0.5292369",
"0.5279117",
"0.5275922",
"0.5273526",
"0.5243828",
"0.523727",
"0.5230709",
"0.... | 0.7095284 | 0 |
METHOD 2: UnionByCompression This method runs unionbycompression to solve the maze. This is of type nonreturn. | public static void unionPathCompression(){
int n = 10;
dsf S = new dsf(n*n);
Maze two = new Maze(n);
Random random;
int sets = n*n; //number of sets in the DSF
int randomNumber;
int randomDirection;
int row;
int col;
char upperRight; //bottom or right
S.print();
while(sets > 1){
random... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static void mazeUnion(){\n\n\t\tint n = 10;\t\n\n\t\tdsf S = new dsf(n*n);\n\t\tMaze one = new Maze(n);\n\n\t\tRandom random;\n\t\tint sets = n*n;\t//number of sets in the DSF\n\t\tint randomNumber;\n\t\tint randomDirection;\n\t\tint row;\n\t\tint col;\n\n\t\tchar upperRight; \t//bottom or right\n\n\t\tS.pr... | [
"0.6078011",
"0.5770655",
"0.5617805",
"0.5239181",
"0.52080214",
"0.51984406",
"0.5041264",
"0.5038277",
"0.5012343",
"0.49760485",
"0.49601242",
"0.4949983",
"0.49269795",
"0.49177694",
"0.4912341",
"0.4854456",
"0.48174682",
"0.47809237",
"0.47483322",
"0.47452906",
"0.473... | 0.70544344 | 0 |
METHOD 3: UnionByHeight This method runs unionbyheight to solve the maze. This is of type nonreturn. | public static void mazeHeight(){
int n = 10;
dsf S = new dsf(n*n);
Maze three = new Maze(n);
Random random;
int sets = n*n; //number of sets in the DSF
int randomNumber;
int randomDirection;
int row;
int col;
char upperRight; //bottom or right
S.print();
while(sets > 1){
random = new R... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static void mazeUnion(){\n\n\t\tint n = 10;\t\n\n\t\tdsf S = new dsf(n*n);\n\t\tMaze one = new Maze(n);\n\n\t\tRandom random;\n\t\tint sets = n*n;\t//number of sets in the DSF\n\t\tint randomNumber;\n\t\tint randomDirection;\n\t\tint row;\n\t\tint col;\n\n\t\tchar upperRight; \t//bottom or right\n\n\t\tS.pr... | [
"0.63619864",
"0.5973439",
"0.5275784",
"0.5063924",
"0.5040628",
"0.501684",
"0.49932745",
"0.49562857",
"0.49523562",
"0.49458063",
"0.48888665",
"0.48796523",
"0.47886294",
"0.4769708",
"0.47667032",
"0.46873805",
"0.46837887",
"0.46697462",
"0.46478003",
"0.45989677",
"0.... | 0.55321974 | 2 |
METHOD 4: UnionBySize This method runs unionbysize to solve the maze. This is of type nonreturn. | public static void mazeSize(){
int n = 10;
dsf S = new dsf(n*n);
Maze four = new Maze(n);
Random random;
int sets = n*n; //number of sets in the DSF
int randomNumber;
int randomDirection;
int row;
int col;
char upperRight; //bottom or right
S.print();
while(sets > 1){
random = new Rand... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static void mazeUnion(){\n\n\t\tint n = 10;\t\n\n\t\tdsf S = new dsf(n*n);\n\t\tMaze one = new Maze(n);\n\n\t\tRandom random;\n\t\tint sets = n*n;\t//number of sets in the DSF\n\t\tint randomNumber;\n\t\tint randomDirection;\n\t\tint row;\n\t\tint col;\n\n\t\tchar upperRight; \t//bottom or right\n\n\t\tS.pr... | [
"0.6923121",
"0.6593776",
"0.61599267",
"0.57513195",
"0.5525592",
"0.55057245",
"0.524896",
"0.52193594",
"0.5195437",
"0.51842284",
"0.50932485",
"0.4971272",
"0.4970212",
"0.49615133",
"0.49513724",
"0.49147213",
"0.48749945",
"0.4874752",
"0.48489788",
"0.48313853",
"0.48... | 0.6171462 | 2 |
METHOD 5: UnionBySize w/ Path Compression This method runs unionbysize, using path compression to solve the maze. This is of type nonreturn. | public static void sizePathCompression(){
int n = 10;
dsf S = new dsf(n*n);
Maze five = new Maze(n);
Random random;
int sets = n*n; //number of sets in the DSF
int randomNumber;
int randomDirection;
int row;
int col;
char upperRight; //bottom or right
S.print();
while(sets > 1){
random... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static void unionPathCompression(){\n\t\tint n = 10;\t\n\n\t\tdsf S = new dsf(n*n);\n\t\tMaze two = new Maze(n);\n\n\t\tRandom random;\n\t\tint sets = n*n;\t//number of sets in the DSF\n\t\tint randomNumber;\n\t\tint randomDirection;\n\t\tint row;\n\t\tint col;\n\n\t\tchar upperRight; \t//bottom or right\n\... | [
"0.7121021",
"0.5879418",
"0.525714",
"0.51427263",
"0.49897277",
"0.48941654",
"0.4886239",
"0.48763147",
"0.48193488",
"0.4782157",
"0.47429597",
"0.4720036",
"0.46830618",
"0.46753782",
"0.46351653",
"0.46336237",
"0.4584717",
"0.4567926",
"0.45206434",
"0.4518587",
"0.451... | 0.69499916 | 1 |
CODE ADDED FOR LAB 7 METHOD 6: USER SELECTION This method will ask the user how they would like to solve the maze. This will be of type nonreturn. | public static void userSelection_SolveMaze(int userInputN){
int[] S = new int[(int) Math.pow(userInputN, 2)];
gNode[] G = new gNode[S.length];
boolean [] visited = new boolean[S.length]; //Initialize
for(int i=0; i<visited.length;i++)
visited[i] = false;
int [] path = new int[S.length]; //Initialize
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static void userSelection(){\n\t\tint selection;\n\t\tScanner input = new Scanner(System.in);\n\t\tSystem.out.println(\"Which program would you like to run?\");\n\t\tselection=input.nextInt();\n\n\t\tif(selection == 1)\n\t\t\tmazeUnion();\n\t\tif(selection == 2)\n\t\t\tunionPathCompression();\n\t\tif(select... | [
"0.66266364",
"0.6535413",
"0.6500761",
"0.6401167",
"0.6261671",
"0.62545985",
"0.6247414",
"0.6175091",
"0.61703897",
"0.61006993",
"0.6063069",
"0.605897",
"0.5987057",
"0.5875109",
"0.5842735",
"0.57885826",
"0.57728505",
"0.57708466",
"0.57584435",
"0.5736579",
"0.572284... | 0.7123779 | 0 |
METHOD 7: BreadthFirst Search This method solves the maze using breadthfirst search, | public static void bfs(gNode[] G, boolean[] visited, int[] path, int s){
Queue<Integer> Q = new LinkedList<Integer>();
Q.add(s);
visited[s] = true;
while(!Q.isEmpty()){
s = Q.poll();
for(gNode t=G[s]; t!= null; t=t.dest){
System.out.println("BFS");
if(!visited[t.item]){ //once an item has been v... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public void BFS() {\n visitedCells = 1;\n\n // Initialize the vertices\n for (int j = 0; j < maze.getGrid().length; j++) {\n for (int k = 0; k < maze.getGrid().length; k++) {\n Cell cell = maze.getGrid()[j][k];\n cell.setColor(\"WHITE\");\n ... | [
"0.7508335",
"0.68866485",
"0.68606406",
"0.67978257",
"0.66566634",
"0.66292137",
"0.65918154",
"0.65903634",
"0.65882474",
"0.65360236",
"0.65073365",
"0.64814",
"0.64698815",
"0.6440443",
"0.6415154",
"0.6408731",
"0.6396683",
"0.63860554",
"0.6370794",
"0.6353809",
"0.634... | 0.0 | -1 |
METHOD 8: DEPTHFIRST SEARCH USING A STACK This method solves the maze using breadthfirst search, this time, using a stack. It will still take in the maze | public static int[] dfs_Stack(gNode[] G, boolean[] visited, int[] path, int s){
Stack <Integer> dfs = new Stack<Integer>();
dfs.push(s);
visited[s] = true;
while(!dfs.isEmpty()){
s = dfs.pop();
for(gNode t=G[s]; t!= null; t=t.dest){
if(!visited[t.item]){ //once an item has been visited, set it equal... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public Stack<MazePoint> DepthFirstSearch(int row, int column)\n {\n //cMaze[row][column].wasVisited()\n if(cMaze[row][column].isExit())\n {\n sPath.push(cMaze[row][column]);\n //print out the path\n PrintPath(sPath, true);\n return sPath;\n ... | [
"0.72871023",
"0.6768588",
"0.64710766",
"0.645953",
"0.63642484",
"0.6271256",
"0.6234236",
"0.61241555",
"0.60703397",
"0.60630256",
"0.60406446",
"0.5976431",
"0.59638447",
"0.59452784",
"0.58824754",
"0.587762",
"0.5842304",
"0.58212245",
"0.5818742",
"0.58040637",
"0.576... | 0.0 | -1 |
METHOD 9: DEPTHFIRST SEARCH WITH RECURSION This method solves the maze using depthfirst search (w/recursion), | public static void dfsRecursion(gNode[] G, boolean[] visited, int[] path, int s){
visited[s] =true;
for(gNode t = G[s]; t!=null; t=t.dest){
if(!visited[t.item]){
path[t.item]=s;
dfsRecursion(G, visited, path, t.item);
}
}
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public Stack<MazePoint> DepthFirstSearch(int row, int column)\n {\n //cMaze[row][column].wasVisited()\n if(cMaze[row][column].isExit())\n {\n sPath.push(cMaze[row][column]);\n //print out the path\n PrintPath(sPath, true);\n return sPath;\n ... | [
"0.77325815",
"0.70551914",
"0.66099834",
"0.65396774",
"0.6525591",
"0.65224016",
"0.6522038",
"0.6472017",
"0.6225173",
"0.6196449",
"0.61605406",
"0.6159167",
"0.61326563",
"0.60578203",
"0.5946599",
"0.5934834",
"0.5925713",
"0.5921992",
"0.58562595",
"0.5850952",
"0.5847... | 0.0 | -1 |
METHOD 10: ADJACENCY LIST This method will create the adjacency list based on the graph | public static void buildAdjacencyList(Maze m, int n){
int mazeSize = n*n;
gNode[] AL = new gNode[mazeSize];
for(int i=0; i<AL.length-1; i++){
//for the right and left walls
if(!(i%AL.length == n-1)){
if(m.check_wall(i, i+1, 'r') == false){
AL[i] = new gNode(i+1, AL[i]);
}
}
//for the... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"ArrayList<Edge> getAdjacencies();",
"private List<Vertex> prepareGraphAdjacencyList() {\n\n\t\tList<Vertex> graph = new ArrayList<Vertex>();\n\t\tVertex vertexA = new Vertex(\"A\");\n\t\tVertex vertexB = new Vertex(\"B\");\n\t\tVertex vertexC = new Vertex(\"C\");\n\t\tVertex vertexD = new Vertex(\"D\");\n\t\tVer... | [
"0.7263505",
"0.71976274",
"0.6857917",
"0.6774595",
"0.6505113",
"0.643013",
"0.64014983",
"0.63976294",
"0.62715155",
"0.6266552",
"0.6252571",
"0.61060345",
"0.61036956",
"0.60978156",
"0.60945284",
"0.6073017",
"0.60389304",
"0.60179526",
"0.6016792",
"0.5988128",
"0.5978... | 0.0 | -1 |
This method will be used to add the initial data accordingly | public ArrayList<Object> defaultBoxTypes(){
//ColourPrintOptions Properties
//All colour option types available in the ColourPrintOption enum
int[] colour = new int[]{ColourPrintOption.NoColour.getColOpt(),
ColourPrintOption.OneColour.getColOpt(),ColourPrintOption.TwoColour.getColOpt()};
//All colour op... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@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\... | [
"0.78427535",
"0.78427535",
"0.78427535",
"0.78427535",
"0.78427535",
"0.78427535",
"0.7729716",
"0.76609707",
"0.76533806",
"0.7651555",
"0.7649823",
"0.7649823",
"0.7589307",
"0.7576715",
"0.7561135",
"0.7561135",
"0.75534034",
"0.7519955",
"0.75117916",
"0.75036556",
"0.75... | 0.0 | -1 |
This method will check whether the default box types were created in the file | public ArrayList<Object> validateDefaultBoxTypes(){
ArrayList<Object> btList = new ArrayList<Object>();
if(getList(PRODUCT_PATH)==null){
btList.addAll(defaultBoxTypes());
return btList;
}
for(int i=0; i< defaultBoxTypes().size(); i++){
if(defaultBoxTypes().get(i).equals(getList(PRODUCT_PA... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public ArrayList<Object> defaultBoxTypes(){\n\t\t//ColourPrintOptions Properties\n\t\t//All colour option types available in the ColourPrintOption enum\n\t\tint[] colour = new int[]{ColourPrintOption.NoColour.getColOpt(), \n\t\t\t\tColourPrintOption.OneColour.getColOpt(),ColourPrintOption.TwoColour.getColOpt()};\n... | [
"0.60501367",
"0.597637",
"0.59177387",
"0.58724725",
"0.5863238",
"0.57939917",
"0.5579411",
"0.5563745",
"0.5442224",
"0.54118294",
"0.5398252",
"0.53950495",
"0.53362054",
"0.52911526",
"0.5265303",
"0.5245692",
"0.52394575",
"0.5225614",
"0.52174866",
"0.521613",
"0.52145... | 0.65418077 | 0 |
This method will be used to calculate the volume of a box by the user specified dimensions | public String calcSurfaceAreaOfBox(double length, double width, double height, double cost, int quantity){
double surfaceArea = 2*(width * length) + 2*(length * height) + 2*(width * height);
double computedCost = cost * surfaceArea;
double totalCost = computedCost * quantity;
DecimalFormat df = new DecimalFor... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static void main(String [] args){\n\r\n Box box1 = new Box(10.0, 20.0, 15.0);\r\n Box box2 = new Box();\r\n Box box3 = new Box(7);\r\n\r\n double vol = box1.Volume();\r\n System.out.println(\"The Volume of box1: \"+vol);\r\n\r\n vol = box2.Volume();\r\n Syste... | [
"0.7140493",
"0.7106524",
"0.70839554",
"0.702827",
"0.695058",
"0.695058",
"0.69346887",
"0.6922983",
"0.68704563",
"0.67770517",
"0.6730048",
"0.672721",
"0.67227536",
"0.6699203",
"0.6641555",
"0.6614941",
"0.6614265",
"0.6601639",
"0.656963",
"0.6501758",
"0.6449204",
"... | 0.0 | -1 |
This method may be used to add a specified percentage to the cost shown in a textfield (i.e: add colour print percentage to the cost of the box) | public void addPercentageToCost(JTextField textField, double percent){
//CardGrade Properties
double origGradeCost = Double.valueOf(textField.getText());
double sum = (origGradeCost * percent / 100) + origGradeCost;
sum = Math.round(sum * 100);
sum = sum/100;
textField.setText(String.valueOf(sum))... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private void percent()\n\t{\n\t\tDouble percent;\t\t//holds the right value percentage of the left value\n\t\tString newText = \"\";//Holds the updated text \n\t\tif(calc.getLeftValue ( ) != 0.0 && Fun != null)\n\t\t{\n\t\t\tsetRightValue();\n\t\t\tpercent = calc.getRightValue() * 0.01 * calc.getLeftValue();\n\t\t... | [
"0.67218584",
"0.6585632",
"0.62429845",
"0.6159801",
"0.6142358",
"0.60641575",
"0.60492384",
"0.59809774",
"0.5971775",
"0.59689116",
"0.59402853",
"0.59243304",
"0.5896911",
"0.58927524",
"0.587081",
"0.5796374",
"0.57823586",
"0.577438",
"0.57726896",
"0.5770402",
"0.5765... | 0.8212438 | 0 |
This method will compute the correct cost and the total cost of box cost quantity according to the parameters passed to it | public double returnBoxCost(double cardGradeCost, double colourOptPercent, double reinfPercent, double sealablePercent, int qty, double length, double width, double height){
double sum = cardGradeCost + (cardGradeCost * colourOptPercent / 100) + (cardGradeCost * reinfPercent / 100)
+ (cardGradeCost * sealablePerc... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"public static double Cost(double boxes, double Cost) {\n\tdouble pay = boxes * Cost;\n\treturn pay;\n}",
"public void calculateCost() {\n \tdouble costToShipPack;\n \tint numOfPacks = 1;\n \t\n \tfor(Package p: this.packages) {\n \t\tcostToShipPack = 3 + (p.calcVolume() - 1);\n \t\tthis.totalAm... | [
"0.74331397",
"0.69724363",
"0.6677726",
"0.65370077",
"0.6431816",
"0.6332957",
"0.626661",
"0.6250655",
"0.6223832",
"0.622378",
"0.6208951",
"0.6208951",
"0.6199922",
"0.61795336",
"0.6133281",
"0.6113645",
"0.61078256",
"0.6096503",
"0.6047753",
"0.6040718",
"0.60173225",... | 0.68586314 | 2 |
This method will compute the correct cost according to the parameters passed to it | public double returnBoxCost(double cardGradeCost, double colourOptPercent, double reinfPercent, double sealablePercent){
double sum = cardGradeCost + ((cardGradeCost * colourOptPercent) / 100) + ((cardGradeCost * reinfPercent) / 100)
+ ((cardGradeCost * sealablePercent) / 100);
double computeTotal = 0.00;
... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"double getCost();",
"double getCost();",
"double getSolutionCost();",
"@Override\r\n\tprotected void processCost() {\n\r\n\t}",
"public abstract double getCost();",
"protected abstract double getDefaultCost();",
"double getTotalCost();",
"float getCostReduction();",
"public void compute(){\r\n\r\n\... | [
"0.7462457",
"0.7462457",
"0.74439496",
"0.7387476",
"0.7303156",
"0.72468615",
"0.71599704",
"0.7149586",
"0.7143792",
"0.7137188",
"0.7122418",
"0.7108507",
"0.69901913",
"0.69898605",
"0.6981662",
"0.6961411",
"0.6931223",
"0.6928458",
"0.68991",
"0.6893234",
"0.68571216",... | 0.0 | -1 |
this method will compute the cost based on the given parameters | public String returnBoxCost(double cardGradeCost, String colourOption, String reinfBotOption,
String reinfCornOption, String sealOption){
double colOptPercent = 0.00;
double reinfPercent = 0.00;
double sealPercent = 0.00;
if(colourOption.equals("2")){
colOptPercent = 15.00;
}else if(colourOption.equ... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"double getCost();",
"double getCost();",
"public void calculateCost()\n\t{\n\t\tLogManager lgmngr = LogManager.getLogManager(); \n\t\tLogger log = lgmngr.getLogger(Logger.GLOBAL_LOGGER_NAME);\n\t\tString s = \"\";\n\t\tint costperfeet = 0;\n\t\tif (this.materialStandard.equals(\"standard materials\") && this.f... | [
"0.7190976",
"0.7190976",
"0.7136482",
"0.7119998",
"0.7043499",
"0.6999867",
"0.6969274",
"0.68936336",
"0.68459374",
"0.682099",
"0.67754775",
"0.6729219",
"0.6651276",
"0.6625793",
"0.65941083",
"0.65700686",
"0.6523296",
"0.6514856",
"0.65137064",
"0.65137064",
"0.6513706... | 0.0 | -1 |
Called when message is received. | @Override
public void onMessageReceived(RemoteMessage remoteMessage) {
super.onMessageReceived(remoteMessage);
// [START_EXCLUDE]
// There are two types of messages data messages and notification messages. Data messages are handled
// here in onMessageReceived whether the app is in t... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n\tpublic void onMessageRecieved(Message arg0) {\n\t\t\n\t}",
"void onMessageReceived(Message message);",
"public void messageReceived(Message m) {\n\t\t\r\n\t}",
"public void messageReceived() {\n\tTrackedMessage.accumulateMap(TrackedMessage.unmapType(\n\t\tTrackedMessage.messagesRecieved, this.ge... | [
"0.8122202",
"0.80398816",
"0.785205",
"0.78350604",
"0.78322476",
"0.7822788",
"0.7797256",
"0.77835315",
"0.7694252",
"0.7622119",
"0.75510436",
"0.75181186",
"0.7510918",
"0.75091225",
"0.7503756",
"0.745281",
"0.7443811",
"0.7413422",
"0.7413422",
"0.7413422",
"0.7413422"... | 0.0 | -1 |
Handle time allotted to BroadcastReceivers. | private void handleNow() {
Log.d(TAG, "Short lived task is done.");
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n public void onReceive(Context context, Intent intent) {\n ArrayList<String> key=intent.getStringArrayListExtra(\"time\");\n Calendar calendar = Calendar.getInstance();\n int hours = calendar.get(Calendar.HOUR_OF_DAY);\n int minutes = calendar.get(Calendar.MINUTE);\n ... | [
"0.65464044",
"0.6226626",
"0.611962",
"0.60996675",
"0.607122",
"0.60530406",
"0.6047379",
"0.603238",
"0.5989989",
"0.59027153",
"0.58687615",
"0.5854633",
"0.5854266",
"0.5846572",
"0.5846572",
"0.5846572",
"0.5846572",
"0.5846572",
"0.5835774",
"0.58301353",
"0.5800365",
... | 0.0 | -1 |
show Toast with massage and different colors | private void ShowToast(String massage, int colorText, int background) {
Typeface font = Typeface.createFromAsset(getAssets(), "comic.ttf");
Toast toast = Toast.makeText(SignUpActivity.this, massage,
Toast.LENGTH_LONG);
View view=toast.getView();
TextView view1= view.find... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private void showToast(int color) {\n String rgbString = \"R: \" + Color.red(color) + \" B: \" + Color.blue(color) + \" G: \" + Color.green(color);\n Toast.makeText(this, rgbString, Toast.LENGTH_SHORT).show();\n }",
"public void toastSuccess(String mensagem){\n\n Context context = getAppl... | [
"0.7824688",
"0.7811595",
"0.7505371",
"0.726954",
"0.72437024",
"0.7233329",
"0.7157529",
"0.7126696",
"0.71175444",
"0.71175444",
"0.704128",
"0.70111024",
"0.7001095",
"0.70002586",
"0.69482005",
"0.6945795",
"0.68603724",
"0.6829744",
"0.6826315",
"0.68115807",
"0.6808117... | 0.81744117 | 0 |
pop a dialog when User created successfully | private void showDialog() {
AlertDialog.Builder builder = new AlertDialog.Builder(this);
builder.setTitle("User created successfully");
builder.setIcon(R.drawable.ic_shield);
builder.setCancelable(true);
builder.setPositiveButton(
"Continue",
new D... | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private void usernameTakenDialog() {\n Dialog dialog = new Dialog(\"Username taken\", cloudSkin, \"dialog\") {\n public void result(Object obj) {\n System.out.println(\"result \" + obj);\n }\n };\n dialog.text(\"This username has already been taken, try a n... | [
"0.70166063",
"0.70100826",
"0.6981803",
"0.6882953",
"0.67817676",
"0.6726923",
"0.6687639",
"0.6534396",
"0.6522465",
"0.6500911",
"0.64799035",
"0.63699734",
"0.6345562",
"0.6343042",
"0.6296517",
"0.6294918",
"0.62794435",
"0.62202984",
"0.6218993",
"0.6203364",
"0.619908... | 0.66480416 | 7 |
activates the search dialog by calling onSearchRequested(). | @Override
public boolean onSearchRequested() {
return super.onSearchRequested();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"private void showSearch() {\n\t\tonSearchRequested();\n\t}",
"@Override\n\tpublic boolean onSearchRequested () {\n\t\tif (!searchMode)\n\t\t\ttoggleSearch();\n\t\treturn true;\n\t}",
"@Override\n\tpublic boolean onSearchRequested()\n\t{\n \tstartSearch(getCurSearch(), true, null, false);\n \treturn true;... | [
"0.7989228",
"0.7910262",
"0.7769844",
"0.73507464",
"0.73413974",
"0.7294327",
"0.71806633",
"0.71806633",
"0.71806633",
"0.7038335",
"0.7034937",
"0.69995964",
"0.6996985",
"0.6989908",
"0.69595814",
"0.687179",
"0.6866483",
"0.68489724",
"0.6845614",
"0.6845614",
"0.684460... | 0.7339387 | 5 |
searchView.cancelPendingInputEvents(); searchView = null; | @Override
protected void onDestroy() {
closeSearchView();
super.onDestroy();
} | {
"objective": {
"self": [],
"paired": [],
"triplet": [
[
"query",
"document",
"negatives"
]
]
}
} | [
"@Override\n public void onDestroyView() {\n super.onDestroyView();\n notifyOnFinishSearchDialog();\n hideSoftKeyboard();\n unbinder.unbind();\n }",
"@Override\n public void onSearchCleared() {\n }",
"void unsetSearchWindowStart();",
"void unsetSearchWin... | [
"0.7694797",
"0.7320666",
"0.73044306",
"0.7276313",
"0.7113499",
"0.70670646",
"0.7045079",
"0.70235693",
"0.69656897",
"0.6964634",
"0.68849367",
"0.68092656",
"0.6803115",
"0.6751024",
"0.6713445",
"0.6691998",
"0.6670426",
"0.66614115",
"0.653591",
"0.6530998",
"0.6512381... | 0.7298445 | 3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.