i = children.iterator(); i.hasNext();)\\n\\t\\t\\t\\t((CShape) (i.next())).changedTransform();\\n\\t\\trepaint();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ad51686bdeaf73889bb69c971dacb751\",\n \"score\": \"0.4842807\",\n \"text\": \"public void change(char changeChar, int position) throws Exception{\\r\\n /*TODO*/\\r\\n \\t\\r\\n //Reset Currentnode position to front of linkedlist\\r\\n currNode = firstNode;\\r\\n \\r\\n //check if the position is within legal range\\r\\n if(position < 0 || position > count-1){\\r\\n \\tthrow new StringIndexOutOfBoundsException(\\\"Position being\\\"\\r\\n \\t\\t\\t+ \\\"passed in is out of bounds, please try again!\\\");\\r\\n }\\r\\n \\r\\n //condition check\\r\\n\\t if(firstNode == null || currNode == null){\\r\\n\\t\\tSystem.out.println(\\\"There is no character to change, list is empty!\\\");\\r\\n }\\r\\n else{\\r\\n \\t//iterate through the linked list\\r\\n \\tfor(int i = 0; i <= position; i++){\\r\\n \\t\\t//find the position the user wants\\r\\n \\t\\tif(i == position){\\r\\n //Set position to the desired changed char\\r\\n currNode.data = changeChar;\\r\\n \\t\\t}\\r\\n \\t\\telse{\\r\\n \\t\\t//reseting current node reference to how it was before\\r\\n \\t\\tcurrNode = currNode.nextNode;\\r\\n \\t\\t}\\r\\n \\t}\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3a024ca56211ed9cc06eb93503c4c063\",\n \"score\": \"0.4842467\",\n \"text\": \"private void handleChanges(ActionEvent actionEvent) {\\n applyChanges();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f1ad0fe4142829a8b585dffb4b2c28fc\",\n \"score\": \"0.484191\",\n \"text\": \"public void apply(Change change, TextDocument doc) {\\n \\t\\tString s, up;\\n \\t\\t\\n \\t\\tswitch (change.getType()) {\\n \\t\\tcase INSERT_TEXT:\\n \\t\\t\\tif (change.getStartRow() == doc.getNumLines()) {\\n \\t\\t\\t\\tdoc.append(\\\"\\\");\\n \\t\\t\\t}\\n \\t\\t\\ts = doc.getLine(change.getStartRow());\\n \\t\\t\\tup = s.substring(0, change.getStartColumn()) + change.getText() + s.substring(change.getStartColumn());\\n \\t\\t\\tchangeLine(doc, change.getStartRow(), up);\\n \\t\\t\\tbreak;\\n \\t\\tcase REMOVE_TEXT:\\n\\t\\t\\tif (change.getText().equals(\\\"\\\\n\\\")) {\\n\\t\\t\\t\\tif (change.getStartRow() + 1 != change.getEndRow()) {\\n\\t\\t\\t\\t\\tthrow new IllegalArgumentException(\\\"unexpected REMOVE_TEXT to remove newline: \\\" + change);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t// combine with line below\\n\\t\\t\\t\\ts = doc.getLine(change.getStartRow());\\n\\t\\t\\t\\tup = s.substring(0, s.length() - 1) + doc.getLine(change.getEndRow());\\n\\t\\t\\t\\tdoc.removeLine(change.getEndRow());\\n\\t\\t\\t} else {\\n\\t\\t\\t\\ts = doc.getLine(change.getStartRow());\\n\\t\\t\\t\\tup = s.substring(0, change.getStartColumn()) + s.substring(change.getEndColumn());\\n \\t\\t\\t}\\n \\t\\t\\tdoc.setLine(change.getStartRow(), up);\\n \\t\\t\\tbreak;\\n \\t\\tcase INSERT_LINES:\\n \\t\\t\\tfor (int i = 0; i < change.getNumLines(); i++) {\\n \\t\\t\\t\\tdoc.insertLine(change.getStartRow() + i, change.getLine(i) + \\\"\\\\n\\\");\\n \\t\\t\\t}\\n \\t\\t\\tbreak;\\n \\t\\tcase REMOVE_LINES:\\n \\t\\t\\tfor (int i = 0; i < change.getNumLines(); i++) {\\n \\t\\t\\t\\tdoc.removeLine(change.getStartRow());\\n \\t\\t\\t}\\n \\t\\t\\tbreak;\\n \\t\\tdefault:\\n \\t\\t\\tthrow new IllegalStateException(\\\"Not handled? \\\" + change.getType());\\n \\t\\t}\\n \\t\\t\\n \\t\\t// check integrity of TextDocument\\n \\t\\tif (DEBUG) {\\n \\t\\t\\tfor (int i = 0; i < doc.getNumLines(); i++) {\\n \\t\\t\\t\\tString line = doc.getLine(i);\\n \\t\\t\\t\\tint nl = line.indexOf('\\\\n');\\n \\t\\t\\t\\tif (nl >= 0 && nl != line.length() - 1) {\\n \\t\\t\\t\\t\\tthrow new IllegalStateException(\\\"Line has enbedded newline!\\\");\\n \\t\\t\\t\\t}\\n \\t\\t\\t}\\n \\t\\t}\\n \\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1b18bebb667763d6918c98c76519b40a\",\n \"score\": \"0.48415726\",\n \"text\": \"private Node balance(Node x) {\\n if (balanceFactor(x) < -1) {\\n if (balanceFactor(x.right) > 0) {\\n x.right = rotateRight(x.right);\\n }\\n x = rotateLeft(x);\\n }\\n else if (balanceFactor(x) > 1) {\\n if (balanceFactor(x.left) < 0) {\\n x.left = rotateLeft(x.left);\\n }\\n x = rotateRight(x);\\n }\\n return x;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"163bba3b4a165c73fe3022dc3a8f676b\",\n \"score\": \"0.48382387\",\n \"text\": \"private void renameFunctionCalls(ASTNode node) throws SyntaxException {\\n\\t\\tint numChildren = node.numChildren();\\n\\n\\t\\tfor (int i = 0; i < numChildren; i++) {\\n\\t\\t\\tASTNode child = node.child(i);\\n\\n\\t\\t\\tif (child != null)\\n\\t\\t\\t\\tthis.renameFunctionCalls(node.child(i));\\n\\t\\t}\\n\\t\\tif (node instanceof FunctionCallNode) {\\n\\t\\t\\tthis.processFunctionCall((FunctionCallNode) node);\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6637105c7069002aaa254af23247d991\",\n \"score\": \"0.48360068\",\n \"text\": \"public ExpressionTreeInterface mutate();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d7a2a06eb285e4134cea7fe148e4399f\",\n \"score\": \"0.4835441\",\n \"text\": \"public void redo() {\\n\\t\\tsuper.redo();\\n\\t\\thandle(oldValue, newValue);\\n\\t}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":985390,"cells":{"query_id":{"kind":"string","value":"c0c36ef85926255e75604c54d0ddc1e7"},"query":{"kind":"string","value":"overriding hasNext to check if reached end of deck"},"positive_passages":{"kind":"list like","value":[{"docid":"4c8bc64a3f1e58b7582c86cbc4f294ea","score":"0.76370907","text":"@Override\n public boolean hasNext()\n {\n return pos < hand.size();\n }","title":""}],"string":"[\n {\n \"docid\": \"4c8bc64a3f1e58b7582c86cbc4f294ea\",\n \"score\": \"0.76370907\",\n \"text\": \"@Override\\n public boolean hasNext()\\n {\\n return pos < hand.size();\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"22887f38f4d709d939f5cacdadfa235a","score":"0.75306755","text":"public abstract boolean hasNext();","title":""},{"docid":"4a4199578a1bcc90b10acb90b83e4e40","score":"0.7320102","text":"public boolean hasNext();","title":""},{"docid":"4a4199578a1bcc90b10acb90b83e4e40","score":"0.7320102","text":"public boolean hasNext();","title":""},{"docid":"4a4199578a1bcc90b10acb90b83e4e40","score":"0.7320102","text":"public boolean hasNext();","title":""},{"docid":"4a4199578a1bcc90b10acb90b83e4e40","score":"0.7320102","text":"public boolean hasNext();","title":""},{"docid":"4a4199578a1bcc90b10acb90b83e4e40","score":"0.7320102","text":"public boolean hasNext();","title":""},{"docid":"4a4199578a1bcc90b10acb90b83e4e40","score":"0.7320102","text":"public boolean hasNext();","title":""},{"docid":"e170be76ffab532ffd972029b6fb3cd4","score":"0.7279542","text":"@Override\n public boolean hasNext() {\n return state != State.END;\n }","title":""},{"docid":"2449665af575e763a109612d1be5a0f9","score":"0.72768867","text":"@Override\n public boolean hasNext() {\n return current_index < size;\n }","title":""},{"docid":"a42146db5c4bef687c04b7cae11fcde2","score":"0.716012","text":"boolean hasNext();","title":""},{"docid":"a42146db5c4bef687c04b7cae11fcde2","score":"0.716012","text":"boolean hasNext();","title":""},{"docid":"a42146db5c4bef687c04b7cae11fcde2","score":"0.716012","text":"boolean hasNext();","title":""},{"docid":"a42146db5c4bef687c04b7cae11fcde2","score":"0.716012","text":"boolean hasNext();","title":""},{"docid":"a42146db5c4bef687c04b7cae11fcde2","score":"0.716012","text":"boolean hasNext();","title":""},{"docid":"a42146db5c4bef687c04b7cae11fcde2","score":"0.716012","text":"boolean hasNext();","title":""},{"docid":"a42146db5c4bef687c04b7cae11fcde2","score":"0.716012","text":"boolean hasNext();","title":""},{"docid":"a42146db5c4bef687c04b7cae11fcde2","score":"0.716012","text":"boolean hasNext();","title":""},{"docid":"a42146db5c4bef687c04b7cae11fcde2","score":"0.716012","text":"boolean hasNext();","title":""},{"docid":"d24887f04ac734c602d9180c7fb21ff2","score":"0.7147088","text":"@Override\n public boolean hasNext() {\n return currentIndex < size;\n }","title":""},{"docid":"d669745fa1840c15d0b9d0758e8b9687","score":"0.7129852","text":"@Override\r\n\tpublic boolean hasNext() {\n\t\treturn false;\r\n\t}","title":""},{"docid":"4645e240cc8a01f0dfee73efbd7c761f","score":"0.7100856","text":"@Override\n\tpublic boolean hasNext() {\n\t\treturn false;\n\t}","title":""},{"docid":"52bade3fbfe29c955f222ce2d8bd2a3e","score":"0.7098586","text":"@Override\n\tpublic boolean hasNext() {\n\t\treturn false; //replace this with the actual returned value\n\t}","title":""},{"docid":"21b5a050894791c519c1d19225ef65e1","score":"0.7097369","text":"@Override\r\n\t\tpublic boolean hasNext() {\n\t\t\treturn false;\r\n\t\t}","title":""},{"docid":"0eb913ce2f93c23e13f28d9b41bca309","score":"0.7087219","text":"public boolean hasNext() throws java.io.IOException;","title":""},{"docid":"f28b2232cdbe7f33640a8113c1303dac","score":"0.70845866","text":"@Override\r\n public boolean hasNext() \r\n {\r\n //first expression short-circuits second to prevent NullPointerException\r\n return cursor != null && cursor.getElement().getSuit() == suitCharacter;\r\n }","title":""},{"docid":"ca3d1f2f72d247f25e5df702f46f9dc6","score":"0.7048792","text":"@Override\n public boolean hasNext() {\n \tif (i < currentSize) {\n \t\treturn true;\n \t}\n \telse {\n \t\treturn false;\n \t}\n }","title":""},{"docid":"1f57fe50292c0458fb841d6da3fab30c","score":"0.7027305","text":"@Override\n public boolean hasNext()\n {\n return state != EXHAUSTED;\n }","title":""},{"docid":"0afb417fc4f82d669956ecccbb43a027","score":"0.70268905","text":"boolean hasNext() throws java.io.IOException;","title":""},{"docid":"1edd6a5138918968b94650de85a3332c","score":"0.702369","text":"public boolean hasNext() {\n return true;\n }","title":""},{"docid":"831f84a8e46aef143c42f8453c9739d6","score":"0.7015995","text":"@Override\n\t\tpublic boolean hasNext() {\n\t\t\treturn false;\n\t\t}","title":""},{"docid":"831f84a8e46aef143c42f8453c9739d6","score":"0.7015995","text":"@Override\n\t\tpublic boolean hasNext() {\n\t\t\treturn false;\n\t\t}","title":""},{"docid":"f5af0b50ed901d21ef1f22269c10875e","score":"0.7013198","text":"public boolean hasNext() { return (this.position != -1); }","title":""},{"docid":"32f4967d527125a4735a0c1fead73f6d","score":"0.6990914","text":"@Override\n public boolean hasNext() {\n return count > 0;\n }","title":""},{"docid":"5f9dfca92261f7e74414884405e6d0ac","score":"0.698723","text":"public boolean hasNext() {\n return false;\n }","title":""},{"docid":"7b70b14e7e67ddcf08c0c41209e93b24","score":"0.6908258","text":"@Override\n public boolean hasNext() {\n return cursor < size;\n }","title":""},{"docid":"8433d8fdd020a90effa9d3c30d5cb059","score":"0.69002986","text":"@Override\n public boolean hasNext() {\n return next != null;\n }","title":""},{"docid":"1edbf0599db704e7d8a37a7515971942","score":"0.68923485","text":"@Override\n public boolean hasNext() {\n return this.current != null;\n }","title":""},{"docid":"8653cefe483563fec03a9e9ca6f624da","score":"0.6869475","text":"public boolean hasNext() {\n if (itFront == itEnd)\n return false;\n\n return true;\n }","title":""},{"docid":"9514e8f2535ee262b51e5e92847df786","score":"0.6866763","text":"@Override\r\npublic boolean hasNext() {\n\treturn false;\r\n}","title":""},{"docid":"c9a334c59bea01ed89735d97de02814b","score":"0.6866569","text":"boolean hasNext() throws IOException;","title":""},{"docid":"4d1fcf5e81fad95f10769cb824ceaf08","score":"0.6855055","text":"public boolean hasNext() {\n return current < size;\n }","title":""},{"docid":"bfa277433c65e09cf4ba60547cac737e","score":"0.68432385","text":"@Override\n public final boolean hasNext() {\n return next != null;\n }","title":""},{"docid":"43e516ce69e472edc6353ba6d3ec8728","score":"0.68430865","text":"public boolean hasNext() {\n return current < size;\n }","title":""},{"docid":"d62abdf6c48226e0ea38189c8f1793f4","score":"0.6824192","text":"public boolean hasNext() {\n\t\t\treturn position < size - 1;\n\t\t}","title":""},{"docid":"bf16bcccdb46dc72b5d6b0340c506239","score":"0.68160397","text":"@Override\n public boolean hasNext() {\n return !this.stack.empty();\n }","title":""},{"docid":"ef249f335205902b1e011b0ddb4eaadb","score":"0.6812778","text":"@Override\n\t\tpublic boolean hasNext() {\n\t\t\treturn !isEmpty();\n\n\t\t}","title":""},{"docid":"f78ef3e4b3187311485677c22e30269e","score":"0.6811186","text":"public boolean hasNext() {\n\t return current < size();\n\t}","title":""},{"docid":"125fd5baf36b0078e0b4380736b715b2","score":"0.6796823","text":"public boolean hasNext(){\n return idx < size;\n }","title":""},{"docid":"ce527cc6bf14cd92cfa97a168c23f8c7","score":"0.6793799","text":"@Override\r\n public boolean hasNext() \r\n {\r\n return current != null;\r\n }","title":""},{"docid":"9be53ae46b08a6de7cddf23b75e59497","score":"0.67879","text":"@Override\n public boolean hasNext() {\n return !state.empty();\n }","title":""},{"docid":"5dee34b93a3a7b915e62a9a77fcfb9a4","score":"0.6742187","text":"@Override\n\t\tpublic boolean hasNext() {\n\t\t\treturn this.cursor != size;\n\t\t}","title":""},{"docid":"246b20481dc841b9d341d4b6d4ef9808","score":"0.6680979","text":"@Override\n\t\t\tpublic boolean hasNext() {\n\t\t\t\tif (count == 0)\n\t\t\t\treturn false;\n\t\t\t\telse return true;\n\t\t\t}","title":""},{"docid":"0c5ec246db4075d21b4b1ecbd0c55bf4","score":"0.6664739","text":"public boolean hasNext() {\n\t return it.hasNext();\n }","title":""},{"docid":"608e7a206b537930486f1213dd42aecf","score":"0.66645044","text":"@Override\n\tpublic boolean hasNext() { \n return nextline != null; \n }","title":""},{"docid":"ffb677ab736f6e7ceacc99cea2fdabf4","score":"0.6660441","text":"private native boolean hasNext();","title":""},{"docid":"b397127ef59c39dbee82814a8d9e0365","score":"0.6658044","text":"public boolean hasNext() {\n/* 44 */ return HasNext(this.impl);\n/* */ }","title":""},{"docid":"9aef645c681eab21bfe3284da98a1c2a","score":"0.66528505","text":"public boolean hasNext() { return curr != null; }","title":""},{"docid":"d421d25337b92f079a44357d0e731fe3","score":"0.6649242","text":"public boolean hasNext() {\n\t if (k<count)\n\t {\n\t return true;\n\t }\n\t else\n\t {\n\t return false;\n\t }\n\t }","title":""},{"docid":"cb8134a46cd0d6045d3d915e6d64af5b","score":"0.66363865","text":"public boolean hasNext() {\n return this.currentTurn != this.turns.size() - 1 || this.currentRound != this.numberOfRounds - 1;\n }","title":""},{"docid":"1d191c5a3cfd28df4ca548e6d3d666a5","score":"0.6632811","text":"@Override\r\n public boolean hasNext() {\r\n return current.next!=null;\r\n }","title":""},{"docid":"e6bf6893fee0337e0e84b3d885291abb","score":"0.66309094","text":"@Override\n public boolean hasNext() {\n if (this.reader == null) {\n throw new IllegalStateException(\"reader is null\");\n }\n while (curChar != -1 && curChar != BEGIN) {\n try {\n curChar = this.reader.read();\n } catch (final IOException e) {\n log.severe(\"IOException while reading: \" + e);\n return false;\n }\n }\n return curChar == BEGIN;\n }","title":""},{"docid":"d8878f9fbd0da54d253398cd8d929554","score":"0.6593736","text":"public boolean hasNext() {\n return count > 0;\n }","title":""},{"docid":"78f4ebe12a055d9965640a87f705981c","score":"0.65814126","text":"@Override\n\tpublic boolean hasNext() {\n\t\treturn nextline != null;\n\t}","title":""},{"docid":"a9a5a9e8d32539162aa78eab8be0e453","score":"0.65747476","text":"public boolean hasNext() {\n\t\t\t\treturn (next <= SIZE - 1);\n\t\t\t}","title":""},{"docid":"9c45b540e2216a2f264e6d0f010039a8","score":"0.65719795","text":"public boolean hasNextBlock();","title":""},{"docid":"153c6ff73bbc74bdef8eac43c6622ded","score":"0.6571826","text":"private boolean hasNext() {\n return (next != null);\n }","title":""},{"docid":"243c922b491df40c2ca71784d58017f9","score":"0.6559728","text":"public final boolean hasNext() {\r\n return (this.m_c > 0);\r\n }","title":""},{"docid":"d08b304d0e73ba2555506bd832bf5f52","score":"0.655661","text":"public boolean hasNext() {\n return current != null;\n }","title":""},{"docid":"89fb8eff9af34ed10280a6eb88925510","score":"0.65516174","text":"@Override\n\t\tpublic boolean hasNext()\n\t\t{\n\t\t\treturn current != tail;\n\t\t}","title":""},{"docid":"16a8acb1021cc47c462228474da2a6e5","score":"0.6540931","text":"public boolean hasNext() {\n return flag;\n }","title":""},{"docid":"d927e6a3c2115490a01dfc9c50d3e7df","score":"0.65328157","text":"@Override\n public boolean hasNext() {\n if (items.size() > posicion) {\n return true;\n } else {\n return false;\n }\n }","title":""},{"docid":"cfdd845860299520276bdf0990518893","score":"0.6528746","text":"public boolean hasNext() {\r\n if (current == null) {\r\n return false;\r\n }\r\n return true;\r\n }","title":""},{"docid":"fec76b67e3d9056a8e508886f04848d2","score":"0.6521942","text":"@Override\n\t\tpublic boolean hasNext() {\n\t\t\treturn current != null;\n\t\t}","title":""},{"docid":"ceb7d83c60451fe88bca42f9408c8338","score":"0.6520966","text":"@Override\n public boolean hasNext() {\n return i < queue.length;\n }","title":""},{"docid":"f673b5e349c2bedb625153d3a2423459","score":"0.6518598","text":"@Override\n\tpublic boolean hasNext() {\n\t\treturn stack.size() > 0;\n\t\t\n\t}","title":""},{"docid":"ff361abfa22ffb03e0a364d42ac12326","score":"0.65161383","text":"@Override\n public boolean hasNext() {\n return index < letters.length;\n }","title":""},{"docid":"86e3d8fd83795da73ae3da833c3803dc","score":"0.6513904","text":"public boolean hasNext() {\n return index < this.size - 1;\n }","title":""},{"docid":"889c6de89d31e5601ddadba79c2b3081","score":"0.6502873","text":"public boolean hasNext() {\r\n\t\tif (counter > 24) {\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\treturn true;\r\n\t}","title":""},{"docid":"481a5f57a93febbe1bd2ae53587990cb","score":"0.6499707","text":"@Override\n\tpublic boolean hasNext() {\n\t\treturn enumeration.hasMoreElements();\n\t}","title":""},{"docid":"6de10b1a3ec8467d82d54c3f2426cd77","score":"0.64949447","text":"public boolean hasNext() {\n return nextChar != -1;\n }","title":""},{"docid":"497b52e93858b2fea3027ed2c273c89c","score":"0.64862746","text":"public boolean hasNext() {\r\n return index != getNumV();\r\n }","title":""},{"docid":"8c98fcdcf87cfcecdd3f04b6d6f83b54","score":"0.6449256","text":"public boolean hasNext() {\n return current != null;\n }","title":""},{"docid":"c4445148e59f9e16d9ff942360290ed1","score":"0.64376605","text":"public boolean hasNext()\n\t\t{\n\t\t\tif (gameObjCollection.size() <=0 || currentIndex == gameObjCollection.size() -1 )\n\t\t\t{\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\t\n\t\t\treturn true;\n\t\t}","title":""},{"docid":"5d2a4458c950bc509be6bdaee3694320","score":"0.6435137","text":"@Override\n public boolean hasNext() {\n return this.nextRecord != null;\n }","title":""},{"docid":"5e8f2c351dc1f94f71cc3f8aae0e9988","score":"0.6415705","text":"@Override\n public boolean hasNext() {\n return cursor != null;\n }","title":""},{"docid":"5f737427081f35f14641a0a820fcb686","score":"0.64118695","text":"public boolean hasNext() {\n return nextPosition != null;\n }","title":""},{"docid":"c0b3f8aad39d49cee8f452aeddee7463","score":"0.6409562","text":"public boolean hasNext() {\n return next != null;\n }","title":""},{"docid":"c0b3f8aad39d49cee8f452aeddee7463","score":"0.6409562","text":"public boolean hasNext() {\n return next != null;\n }","title":""},{"docid":"7885101883c6e8ddead5c6449ba69c76","score":"0.6408033","text":"public boolean hasNext() {\n return cursor < limit;\n }","title":""},{"docid":"0c3a6bdac16c1987aa4864731f528d73","score":"0.64071393","text":"@Override\n\t\tpublic boolean hasNext() {\n\t\t\treturn !fringe.isEmpty();\n\t\t}","title":""},{"docid":"858d47c4aac588c989c61305ab83750c","score":"0.64058214","text":"public boolean hasNext() {\n moveToNext();\n return (fNext != fBlank);\n }","title":""},{"docid":"0a693dc8ed529b4fd4a23f02c4b187eb","score":"0.64038134","text":"@Test\n public void iteratorHasNextEmpty(){\n Assert.assertFalse(deque.iterator().hasNext());\n }","title":""},{"docid":"44a5a2e69b2c7aa99022fe091fb2a336","score":"0.63951457","text":"@Override\n public boolean hasNext() { // Time Complexity: O(1)\n\t return generatedCount < SIZE;\n\t }","title":""},{"docid":"c4a6d02623e6bdf749793b838e7300b5","score":"0.6385209","text":"public boolean hasNext() {\n return enumeration.hasNext();\n }","title":""},{"docid":"7d7a4c7841148564e97fdd93956d7e2b","score":"0.6382883","text":"public boolean hasNext() {\n if (current < list.size())\n return true;\n\n return false;\n }","title":""},{"docid":"b88924586c3c1349ac12fe650def2626","score":"0.6382652","text":"public boolean hasNext() {\n for (int i = 0; i < r; i++) {\n if (i != (n - 1) - counter[i]) {\n return true;\n }\n }\n return false;\n }","title":""},{"docid":"3ab28c2fc77574c1ea1cc400d3c9dcbe","score":"0.6382451","text":"@Override\r\n public Iterator<Card> iterator()\r\n {\r\n return hand.iterator();\r\n }","title":""},{"docid":"37a983ad9b832d0f38aa21a844b76d7d","score":"0.6380856","text":"public boolean hasNext() {\r\n\t\treturn isOpen() ? iter.hasNext() : false;\r\n\t}","title":""},{"docid":"4bd0ff4a58720704129f5af2d298d111","score":"0.63745147","text":"public boolean hasNext() {\n\t\t\treturn (!track.empty());\n\t\t}","title":""},{"docid":"6bf71fbd1499deeef361de21248fe201","score":"0.63736975","text":"boolean hasNext()\n {\n \tif(this.next!=null)\n \t\treturn true;\n \telse return false;\n }","title":""}],"string":"[\n {\n \"docid\": \"22887f38f4d709d939f5cacdadfa235a\",\n \"score\": \"0.75306755\",\n \"text\": \"public abstract boolean hasNext();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a4199578a1bcc90b10acb90b83e4e40\",\n \"score\": \"0.7320102\",\n \"text\": \"public boolean hasNext();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a4199578a1bcc90b10acb90b83e4e40\",\n \"score\": \"0.7320102\",\n \"text\": \"public boolean hasNext();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a4199578a1bcc90b10acb90b83e4e40\",\n \"score\": \"0.7320102\",\n \"text\": \"public boolean hasNext();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a4199578a1bcc90b10acb90b83e4e40\",\n \"score\": \"0.7320102\",\n \"text\": \"public boolean hasNext();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a4199578a1bcc90b10acb90b83e4e40\",\n \"score\": \"0.7320102\",\n \"text\": \"public boolean hasNext();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a4199578a1bcc90b10acb90b83e4e40\",\n \"score\": \"0.7320102\",\n \"text\": \"public boolean hasNext();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e170be76ffab532ffd972029b6fb3cd4\",\n \"score\": \"0.7279542\",\n \"text\": \"@Override\\n public boolean hasNext() {\\n return state != State.END;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2449665af575e763a109612d1be5a0f9\",\n \"score\": \"0.72768867\",\n \"text\": \"@Override\\n public boolean hasNext() {\\n return current_index < size;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a42146db5c4bef687c04b7cae11fcde2\",\n \"score\": \"0.716012\",\n \"text\": \"boolean hasNext();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a42146db5c4bef687c04b7cae11fcde2\",\n \"score\": \"0.716012\",\n \"text\": \"boolean hasNext();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a42146db5c4bef687c04b7cae11fcde2\",\n \"score\": \"0.716012\",\n \"text\": \"boolean hasNext();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a42146db5c4bef687c04b7cae11fcde2\",\n \"score\": \"0.716012\",\n \"text\": \"boolean hasNext();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a42146db5c4bef687c04b7cae11fcde2\",\n \"score\": \"0.716012\",\n \"text\": \"boolean hasNext();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a42146db5c4bef687c04b7cae11fcde2\",\n \"score\": \"0.716012\",\n \"text\": \"boolean hasNext();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a42146db5c4bef687c04b7cae11fcde2\",\n \"score\": \"0.716012\",\n \"text\": \"boolean hasNext();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a42146db5c4bef687c04b7cae11fcde2\",\n \"score\": \"0.716012\",\n \"text\": \"boolean hasNext();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a42146db5c4bef687c04b7cae11fcde2\",\n \"score\": \"0.716012\",\n \"text\": \"boolean hasNext();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d24887f04ac734c602d9180c7fb21ff2\",\n \"score\": \"0.7147088\",\n \"text\": \"@Override\\n public boolean hasNext() {\\n return currentIndex < size;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d669745fa1840c15d0b9d0758e8b9687\",\n \"score\": \"0.7129852\",\n \"text\": \"@Override\\r\\n\\tpublic boolean hasNext() {\\n\\t\\treturn false;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4645e240cc8a01f0dfee73efbd7c761f\",\n \"score\": \"0.7100856\",\n \"text\": \"@Override\\n\\tpublic boolean hasNext() {\\n\\t\\treturn false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"52bade3fbfe29c955f222ce2d8bd2a3e\",\n \"score\": \"0.7098586\",\n \"text\": \"@Override\\n\\tpublic boolean hasNext() {\\n\\t\\treturn false; //replace this with the actual returned value\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"21b5a050894791c519c1d19225ef65e1\",\n \"score\": \"0.7097369\",\n \"text\": \"@Override\\r\\n\\t\\tpublic boolean hasNext() {\\n\\t\\t\\treturn false;\\r\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0eb913ce2f93c23e13f28d9b41bca309\",\n \"score\": \"0.7087219\",\n \"text\": \"public boolean hasNext() throws java.io.IOException;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f28b2232cdbe7f33640a8113c1303dac\",\n \"score\": \"0.70845866\",\n \"text\": \"@Override\\r\\n public boolean hasNext() \\r\\n {\\r\\n //first expression short-circuits second to prevent NullPointerException\\r\\n return cursor != null && cursor.getElement().getSuit() == suitCharacter;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ca3d1f2f72d247f25e5df702f46f9dc6\",\n \"score\": \"0.7048792\",\n \"text\": \"@Override\\n public boolean hasNext() {\\n \\tif (i < currentSize) {\\n \\t\\treturn true;\\n \\t}\\n \\telse {\\n \\t\\treturn false;\\n \\t}\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f57fe50292c0458fb841d6da3fab30c\",\n \"score\": \"0.7027305\",\n \"text\": \"@Override\\n public boolean hasNext()\\n {\\n return state != EXHAUSTED;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0afb417fc4f82d669956ecccbb43a027\",\n \"score\": \"0.70268905\",\n \"text\": \"boolean hasNext() throws java.io.IOException;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1edd6a5138918968b94650de85a3332c\",\n \"score\": \"0.702369\",\n \"text\": \"public boolean hasNext() {\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"831f84a8e46aef143c42f8453c9739d6\",\n \"score\": \"0.7015995\",\n \"text\": \"@Override\\n\\t\\tpublic boolean hasNext() {\\n\\t\\t\\treturn false;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"831f84a8e46aef143c42f8453c9739d6\",\n \"score\": \"0.7015995\",\n \"text\": \"@Override\\n\\t\\tpublic boolean hasNext() {\\n\\t\\t\\treturn false;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f5af0b50ed901d21ef1f22269c10875e\",\n \"score\": \"0.7013198\",\n \"text\": \"public boolean hasNext() { return (this.position != -1); }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"32f4967d527125a4735a0c1fead73f6d\",\n \"score\": \"0.6990914\",\n \"text\": \"@Override\\n public boolean hasNext() {\\n return count > 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5f9dfca92261f7e74414884405e6d0ac\",\n \"score\": \"0.698723\",\n \"text\": \"public boolean hasNext() {\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7b70b14e7e67ddcf08c0c41209e93b24\",\n \"score\": \"0.6908258\",\n \"text\": \"@Override\\n public boolean hasNext() {\\n return cursor < size;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8433d8fdd020a90effa9d3c30d5cb059\",\n \"score\": \"0.69002986\",\n \"text\": \"@Override\\n public boolean hasNext() {\\n return next != null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1edbf0599db704e7d8a37a7515971942\",\n \"score\": \"0.68923485\",\n \"text\": \"@Override\\n public boolean hasNext() {\\n return this.current != null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8653cefe483563fec03a9e9ca6f624da\",\n \"score\": \"0.6869475\",\n \"text\": \"public boolean hasNext() {\\n if (itFront == itEnd)\\n return false;\\n\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9514e8f2535ee262b51e5e92847df786\",\n \"score\": \"0.6866763\",\n \"text\": \"@Override\\r\\npublic boolean hasNext() {\\n\\treturn false;\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c9a334c59bea01ed89735d97de02814b\",\n \"score\": \"0.6866569\",\n \"text\": \"boolean hasNext() throws IOException;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4d1fcf5e81fad95f10769cb824ceaf08\",\n \"score\": \"0.6855055\",\n \"text\": \"public boolean hasNext() {\\n return current < size;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bfa277433c65e09cf4ba60547cac737e\",\n \"score\": \"0.68432385\",\n \"text\": \"@Override\\n public final boolean hasNext() {\\n return next != null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"43e516ce69e472edc6353ba6d3ec8728\",\n \"score\": \"0.68430865\",\n \"text\": \"public boolean hasNext() {\\n return current < size;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d62abdf6c48226e0ea38189c8f1793f4\",\n \"score\": \"0.6824192\",\n \"text\": \"public boolean hasNext() {\\n\\t\\t\\treturn position < size - 1;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bf16bcccdb46dc72b5d6b0340c506239\",\n \"score\": \"0.68160397\",\n \"text\": \"@Override\\n public boolean hasNext() {\\n return !this.stack.empty();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ef249f335205902b1e011b0ddb4eaadb\",\n \"score\": \"0.6812778\",\n \"text\": \"@Override\\n\\t\\tpublic boolean hasNext() {\\n\\t\\t\\treturn !isEmpty();\\n\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f78ef3e4b3187311485677c22e30269e\",\n \"score\": \"0.6811186\",\n \"text\": \"public boolean hasNext() {\\n\\t return current < size();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"125fd5baf36b0078e0b4380736b715b2\",\n \"score\": \"0.6796823\",\n \"text\": \"public boolean hasNext(){\\n return idx < size;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ce527cc6bf14cd92cfa97a168c23f8c7\",\n \"score\": \"0.6793799\",\n \"text\": \"@Override\\r\\n public boolean hasNext() \\r\\n {\\r\\n return current != null;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9be53ae46b08a6de7cddf23b75e59497\",\n \"score\": \"0.67879\",\n \"text\": \"@Override\\n public boolean hasNext() {\\n return !state.empty();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5dee34b93a3a7b915e62a9a77fcfb9a4\",\n \"score\": \"0.6742187\",\n \"text\": \"@Override\\n\\t\\tpublic boolean hasNext() {\\n\\t\\t\\treturn this.cursor != size;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"246b20481dc841b9d341d4b6d4ef9808\",\n \"score\": \"0.6680979\",\n \"text\": \"@Override\\n\\t\\t\\tpublic boolean hasNext() {\\n\\t\\t\\t\\tif (count == 0)\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\telse return true;\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0c5ec246db4075d21b4b1ecbd0c55bf4\",\n \"score\": \"0.6664739\",\n \"text\": \"public boolean hasNext() {\\n\\t return it.hasNext();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"608e7a206b537930486f1213dd42aecf\",\n \"score\": \"0.66645044\",\n \"text\": \"@Override\\n\\tpublic boolean hasNext() { \\n return nextline != null; \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ffb677ab736f6e7ceacc99cea2fdabf4\",\n \"score\": \"0.6660441\",\n \"text\": \"private native boolean hasNext();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b397127ef59c39dbee82814a8d9e0365\",\n \"score\": \"0.6658044\",\n \"text\": \"public boolean hasNext() {\\n/* 44 */ return HasNext(this.impl);\\n/* */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9aef645c681eab21bfe3284da98a1c2a\",\n \"score\": \"0.66528505\",\n \"text\": \"public boolean hasNext() { return curr != null; }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d421d25337b92f079a44357d0e731fe3\",\n \"score\": \"0.6649242\",\n \"text\": \"public boolean hasNext() {\\n\\t if (k<count)\\n\\t {\\n\\t return true;\\n\\t }\\n\\t else\\n\\t {\\n\\t return false;\\n\\t }\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cb8134a46cd0d6045d3d915e6d64af5b\",\n \"score\": \"0.66363865\",\n \"text\": \"public boolean hasNext() {\\n return this.currentTurn != this.turns.size() - 1 || this.currentRound != this.numberOfRounds - 1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d191c5a3cfd28df4ca548e6d3d666a5\",\n \"score\": \"0.6632811\",\n \"text\": \"@Override\\r\\n public boolean hasNext() {\\r\\n return current.next!=null;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6bf6893fee0337e0e84b3d885291abb\",\n \"score\": \"0.66309094\",\n \"text\": \"@Override\\n public boolean hasNext() {\\n if (this.reader == null) {\\n throw new IllegalStateException(\\\"reader is null\\\");\\n }\\n while (curChar != -1 && curChar != BEGIN) {\\n try {\\n curChar = this.reader.read();\\n } catch (final IOException e) {\\n log.severe(\\\"IOException while reading: \\\" + e);\\n return false;\\n }\\n }\\n return curChar == BEGIN;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d8878f9fbd0da54d253398cd8d929554\",\n \"score\": \"0.6593736\",\n \"text\": \"public boolean hasNext() {\\n return count > 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"78f4ebe12a055d9965640a87f705981c\",\n \"score\": \"0.65814126\",\n \"text\": \"@Override\\n\\tpublic boolean hasNext() {\\n\\t\\treturn nextline != null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a9a5a9e8d32539162aa78eab8be0e453\",\n \"score\": \"0.65747476\",\n \"text\": \"public boolean hasNext() {\\n\\t\\t\\t\\treturn (next <= SIZE - 1);\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9c45b540e2216a2f264e6d0f010039a8\",\n \"score\": \"0.65719795\",\n \"text\": \"public boolean hasNextBlock();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"153c6ff73bbc74bdef8eac43c6622ded\",\n \"score\": \"0.6571826\",\n \"text\": \"private boolean hasNext() {\\n return (next != null);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"243c922b491df40c2ca71784d58017f9\",\n \"score\": \"0.6559728\",\n \"text\": \"public final boolean hasNext() {\\r\\n return (this.m_c > 0);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d08b304d0e73ba2555506bd832bf5f52\",\n \"score\": \"0.655661\",\n \"text\": \"public boolean hasNext() {\\n return current != null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"89fb8eff9af34ed10280a6eb88925510\",\n \"score\": \"0.65516174\",\n \"text\": \"@Override\\n\\t\\tpublic boolean hasNext()\\n\\t\\t{\\n\\t\\t\\treturn current != tail;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"16a8acb1021cc47c462228474da2a6e5\",\n \"score\": \"0.6540931\",\n \"text\": \"public boolean hasNext() {\\n return flag;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d927e6a3c2115490a01dfc9c50d3e7df\",\n \"score\": \"0.65328157\",\n \"text\": \"@Override\\n public boolean hasNext() {\\n if (items.size() > posicion) {\\n return true;\\n } else {\\n return false;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cfdd845860299520276bdf0990518893\",\n \"score\": \"0.6528746\",\n \"text\": \"public boolean hasNext() {\\r\\n if (current == null) {\\r\\n return false;\\r\\n }\\r\\n return true;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fec76b67e3d9056a8e508886f04848d2\",\n \"score\": \"0.6521942\",\n \"text\": \"@Override\\n\\t\\tpublic boolean hasNext() {\\n\\t\\t\\treturn current != null;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ceb7d83c60451fe88bca42f9408c8338\",\n \"score\": \"0.6520966\",\n \"text\": \"@Override\\n public boolean hasNext() {\\n return i < queue.length;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f673b5e349c2bedb625153d3a2423459\",\n \"score\": \"0.6518598\",\n \"text\": \"@Override\\n\\tpublic boolean hasNext() {\\n\\t\\treturn stack.size() > 0;\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ff361abfa22ffb03e0a364d42ac12326\",\n \"score\": \"0.65161383\",\n \"text\": \"@Override\\n public boolean hasNext() {\\n return index < letters.length;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"86e3d8fd83795da73ae3da833c3803dc\",\n \"score\": \"0.6513904\",\n \"text\": \"public boolean hasNext() {\\n return index < this.size - 1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"889c6de89d31e5601ddadba79c2b3081\",\n \"score\": \"0.6502873\",\n \"text\": \"public boolean hasNext() {\\r\\n\\t\\tif (counter > 24) {\\r\\n\\t\\t\\treturn false;\\r\\n\\t\\t}\\r\\n\\t\\treturn true;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"481a5f57a93febbe1bd2ae53587990cb\",\n \"score\": \"0.6499707\",\n \"text\": \"@Override\\n\\tpublic boolean hasNext() {\\n\\t\\treturn enumeration.hasMoreElements();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6de10b1a3ec8467d82d54c3f2426cd77\",\n \"score\": \"0.64949447\",\n \"text\": \"public boolean hasNext() {\\n return nextChar != -1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"497b52e93858b2fea3027ed2c273c89c\",\n \"score\": \"0.64862746\",\n \"text\": \"public boolean hasNext() {\\r\\n return index != getNumV();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8c98fcdcf87cfcecdd3f04b6d6f83b54\",\n \"score\": \"0.6449256\",\n \"text\": \"public boolean hasNext() {\\n return current != null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c4445148e59f9e16d9ff942360290ed1\",\n \"score\": \"0.64376605\",\n \"text\": \"public boolean hasNext()\\n\\t\\t{\\n\\t\\t\\tif (gameObjCollection.size() <=0 || currentIndex == gameObjCollection.size() -1 )\\n\\t\\t\\t{\\n\\t\\t\\t\\treturn false;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\treturn true;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5d2a4458c950bc509be6bdaee3694320\",\n \"score\": \"0.6435137\",\n \"text\": \"@Override\\n public boolean hasNext() {\\n return this.nextRecord != null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5e8f2c351dc1f94f71cc3f8aae0e9988\",\n \"score\": \"0.6415705\",\n \"text\": \"@Override\\n public boolean hasNext() {\\n return cursor != null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5f737427081f35f14641a0a820fcb686\",\n \"score\": \"0.64118695\",\n \"text\": \"public boolean hasNext() {\\n return nextPosition != null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c0b3f8aad39d49cee8f452aeddee7463\",\n \"score\": \"0.6409562\",\n \"text\": \"public boolean hasNext() {\\n return next != null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c0b3f8aad39d49cee8f452aeddee7463\",\n \"score\": \"0.6409562\",\n \"text\": \"public boolean hasNext() {\\n return next != null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7885101883c6e8ddead5c6449ba69c76\",\n \"score\": \"0.6408033\",\n \"text\": \"public boolean hasNext() {\\n return cursor < limit;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0c3a6bdac16c1987aa4864731f528d73\",\n \"score\": \"0.64071393\",\n \"text\": \"@Override\\n\\t\\tpublic boolean hasNext() {\\n\\t\\t\\treturn !fringe.isEmpty();\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"858d47c4aac588c989c61305ab83750c\",\n \"score\": \"0.64058214\",\n \"text\": \"public boolean hasNext() {\\n moveToNext();\\n return (fNext != fBlank);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0a693dc8ed529b4fd4a23f02c4b187eb\",\n \"score\": \"0.64038134\",\n \"text\": \"@Test\\n public void iteratorHasNextEmpty(){\\n Assert.assertFalse(deque.iterator().hasNext());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"44a5a2e69b2c7aa99022fe091fb2a336\",\n \"score\": \"0.63951457\",\n \"text\": \"@Override\\n public boolean hasNext() { // Time Complexity: O(1)\\n\\t return generatedCount < SIZE;\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c4a6d02623e6bdf749793b838e7300b5\",\n \"score\": \"0.6385209\",\n \"text\": \"public boolean hasNext() {\\n return enumeration.hasNext();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7d7a4c7841148564e97fdd93956d7e2b\",\n \"score\": \"0.6382883\",\n \"text\": \"public boolean hasNext() {\\n if (current < list.size())\\n return true;\\n\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b88924586c3c1349ac12fe650def2626\",\n \"score\": \"0.6382652\",\n \"text\": \"public boolean hasNext() {\\n for (int i = 0; i < r; i++) {\\n if (i != (n - 1) - counter[i]) {\\n return true;\\n }\\n }\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ab28c2fc77574c1ea1cc400d3c9dcbe\",\n \"score\": \"0.6382451\",\n \"text\": \"@Override\\r\\n public Iterator<Card> iterator()\\r\\n {\\r\\n return hand.iterator();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"37a983ad9b832d0f38aa21a844b76d7d\",\n \"score\": \"0.6380856\",\n \"text\": \"public boolean hasNext() {\\r\\n\\t\\treturn isOpen() ? iter.hasNext() : false;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4bd0ff4a58720704129f5af2d298d111\",\n \"score\": \"0.63745147\",\n \"text\": \"public boolean hasNext() {\\n\\t\\t\\treturn (!track.empty());\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6bf71fbd1499deeef361de21248fe201\",\n \"score\": \"0.63736975\",\n \"text\": \"boolean hasNext()\\n {\\n \\tif(this.next!=null)\\n \\t\\treturn true;\\n \\telse return false;\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":985391,"cells":{"query_id":{"kind":"string","value":"f5774eed4dc2d249995de0e7b6877ca3"},"query":{"kind":"string","value":"A PlayerBanSource is the source of a ban that has been issued by a Player"},"positive_passages":{"kind":"list like","value":[{"docid":"1da47c020eaeb8013fe87a6b5cee78b4","score":"0.72865516","text":"public interface PlayerBanSource extends BanSource {\n\n\tUUID getUUID();\n\n\t/**\n\t * Does no guarantee that the player is online\n\t */\n\tPlayer getPlayer();\n\n}","title":""}],"string":"[\n {\n \"docid\": \"1da47c020eaeb8013fe87a6b5cee78b4\",\n \"score\": \"0.72865516\",\n \"text\": \"public interface PlayerBanSource extends BanSource {\\n\\n\\tUUID getUUID();\\n\\n\\t/**\\n\\t * Does no guarantee that the player is online\\n\\t */\\n\\tPlayer getPlayer();\\n\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"daf64321f91fd9182905396f23b6f337","score":"0.5885944","text":"@Override\n\tpublic CommandResult execute(CommandSource source, CommandContext args)throws CommandException {\n\n\t\t\n\t\t\n\t\tif(source instanceof Player) {\n\t\t\tPlayer player = (Player) source;\n\t\t\tString playerName;\n\t\t\tif(args.hasAny(\"playerName\")){\n\t\t\t\tif(player.hasPermission(\"whippyconomy.bal.others\")){ \t\t\n\t\t\t\t\tplayerName = (String) args.getOne(\"playerName\").get();\n\t\t\t\t}else{\n\t\t\t\t\tplayer.sendMessage(Texts.builder(\"You do not have permission to use that command\").color(TextColors.RED).build());\n\t\t\t\t\treturn CommandResult.empty();\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tplayerName = player.getName();\n\t\t\t}\n\t\t\tString playerId = EconomyCache.getId(playerName);\n\t\t\tif(playerId==null || playerId.isEmpty()){\n\t\t\t\tplayer.sendMessage(Texts.builder(playerName + \" does not exist!\").color(TextColors.RED).build());\n\t\t\t}else{\t\t\t\t\n\t\t\t\tdouble bal = EconomyCache.getBalance(playerId);\n\t\t\t\tbal = EconomyCache.round(bal, ConfigurationLoader.getDecPlaces());\t\t\t\t\n\t\t\t\tplayer.sendMessage(Texts.builder(buildBalanceMessage(bal, \"Current\")).color(TextColors.GREEN).build());\n\t\t\t\t\n\t\t\t\tif(ConfigurationLoader.isSavingsEnabled()){\n\t\t\t\t\tdouble balSavings = EconomyCache.getSavingBalance(playerId);\t\t\t\t\t\n\t\t\t\t\tbalSavings = EconomyCache.round(balSavings, ConfigurationLoader.getDecPlaces());\n\t\t\t\t\tplayer.sendMessage(Texts.builder(buildBalanceMessage(balSavings, \"Savings\")).color(TextColors.GREEN).build());\n\t\t\t\t}\n\t\t\t}\n\t } else {\n\t \tStaticsHandler.getLogger().warn(\"Bal called by non player entity\");\n\t \treturn CommandResult.empty();\n\t }\n\t return CommandResult.success();\n\t}","title":""},{"docid":"8b2a4fccd892349a4d5dde17ec5f55b5","score":"0.5484139","text":"public Punishment getActiveBan(UUID player) {\n for (Punishment punishment : getPunishments(player)) {\n if ((punishment.getType() == PunishmentType.PERMANENT_BAN || punishment.getType() == PunishmentType.TEMPORARY_BAN) && punishment.isActive()) {\n return punishment;\n }\n }\n return null;\n }","title":""},{"docid":"f55ca6ce6813cca16dd7ebe59c09c22b","score":"0.541059","text":"void addBan(String playerName, String ipAddress, String reason, Date expiration);","title":""},{"docid":"ae27f22531bcea160560966f228518d3","score":"0.54019916","text":"@Override\n public boolean applies(GameEvent event, Ability source, Game game) {\n return event.getAmount() > 0 && source.getControllerId().equals(event.getPlayerId());\n }","title":""},{"docid":"a998f93279d5248c7fb58d60628987d3","score":"0.53949124","text":"public Teamable getSource();","title":""},{"docid":"aeaa44bf9f0da232a00a3d860b90d44f","score":"0.52757275","text":"Player getOwnPlayer();","title":""},{"docid":"d6b59682c827a7a77c4b776261491fe8","score":"0.5233156","text":"public int getFromPlayerId() {\n return fromPlayerId_;\n }","title":""},{"docid":"5fc06402a2c4afccd530fd0c93e02689","score":"0.523112","text":"public int getFromPlayerId() {\n return fromPlayerId_;\n }","title":""},{"docid":"f071680ebbe7a8b9b2cc3b40bd385ce8","score":"0.5192982","text":"BluetoothSourceNode(String source) {\r\n super(true);\r\n this.source = source;\r\n }","title":""},{"docid":"cf08c2cbb4619d2da36e37b5755ae6ac","score":"0.5160341","text":"public void who(Player player) {\n this.player = player;\n }","title":""},{"docid":"380068c4de2d9a0ba334d25ddceee201","score":"0.510818","text":"public boolean attackEntityFrom(DamageSource source, float amount) {\r\n boolean flag = super.attackEntityFrom(source, amount);\r\n if (this.world.isRemote) {\r\n return false;\r\n } else {\r\n if (flag && source.getTrueSource() instanceof LivingEntity) {\r\n try {\r\n\t\t\t\tColorEntityBrain.func_242353_a(this, (LivingEntity)source.getTrueSource());\r\n\t\t\t} catch (IllegalAccessException | IllegalArgumentException | InvocationTargetException e) {\r\n\t\t\t\te.printStackTrace();\r\n\t\t\t}\r\n }\r\n\r\n return flag;\r\n }\r\n }","title":""},{"docid":"9c334a1c33152889d17522aed9362c75","score":"0.5066222","text":"public void ban(ChatClient client, ChatClient target) throws UserNotOperatorException, UserNotOnChannelException {\n\n if (!users.contains(client))\n throw new UserNotOnChannelException();\n\n if (getOwner() != client)\n throw new UserNotOperatorException();\n\n bans.add(target.getNick());\n }","title":""},{"docid":"d7174412d9f5e9f930fb78618dfbc971","score":"0.5063422","text":"@Override\n public void run() {\n List<WrappedPlayer> lwp = core.getWrappedServer().getOnlinePlayers();\n if (lwp.isEmpty()) {\n return;\n }\n\n // Get the server bans for any players currently online.\n Set<UUID> players = lwp.stream().map(WrappedPlayer::getUUID).collect(Collectors.toSet());\n\n List<HammerPlayerBan> bans;\n try (DatabaseConnection dg = core.getDatabaseConnection()){\n bans = dg.getBanHandler().getPlayerBansForServer(players, core.getConfig().getConfig().getNode(\"server\", \"id\").getInt(1));\n } catch (Exception e) {\n // Let's not worry too much\n core.getWrappedServer().getLogger().warn(\"There was an error running the ban check task. It will be retried later.\");\n e.printStackTrace();\n return;\n }\n\n if (bans.isEmpty()) {\n // No bans here!\n return;\n }\n\n final WrappedServer s = core.getWrappedServer();\n bans.forEach(b -> {\n WrappedPlayer wp = s.getPlayer(b.getBannedUUID());\n if (wp != null) {\n String name = wp.getName();\n\n // Ban in sync!\n s.getScheduler().runSyncNow(() -> wp.ban(s.getConsole(), b.getReason()));\n s.sendMessageToPermissionGroup(new HammerTextBuilder().add(\"[Hammer] The player \", HammerTextColours.RED)\n .add(name, HammerTextColours.WHITE).add(\" has been kicked as they have been banned from elsewhere.\").build(), \"hammer.notify\");\n s.sendMessageToPermissionGroup(new HammerTextBuilder().add(\"[Hammer] Reason: \" + b.getReason(), HammerTextColours.RED).build(), \"hammer.notify\");\n\n }\n });\n }","title":""},{"docid":"400d3d2c9664b7ea22d24505f489142e","score":"0.5049215","text":"@Override\n\tpublic void robPlayer(RobPlayerInfo victim) {\n\n\t}","title":""},{"docid":"dc7fc4540227fd91c940c449de2ed3e7","score":"0.50477993","text":"tasly.greathealth.oms.domain.order.ChannelSource getChannelsource();","title":""},{"docid":"e2ccccb702c03e6ad0fb181b74ad27b4","score":"0.503913","text":"public UserInfoDatagram(Encryptor encryptor, DatagramPacket source) {\n super(encryptor, DatagramTypes.SERVER_CLIENTS_INFO);\n this.data=source.getData();\n this.message=bytesToString(unpackAndDecrypt(source));\n }","title":""},{"docid":"52c8f71e45fa4f7ed101fb260b59267f","score":"0.498957","text":"public Player getPlayer() {\n return owner;\n }","title":""},{"docid":"d16281c442178e3fb9dcc6fb15916bad","score":"0.4985593","text":"public HServerInfo getSource() {\n return source;\n }","title":""},{"docid":"96dce1cd3de07e2c22a2a693767d68c9","score":"0.49731925","text":"public String getPingSource()\n {\n return pingSource;\n }","title":""},{"docid":"fdd3733bc7197e469f962e7f9cb8952a","score":"0.49730006","text":"Source getSource(SourceType type);","title":""},{"docid":"a5686d8d3894dce1bb36fdbb909d1d84","score":"0.49642953","text":"public Source getSource()\n {\n return source_;\n }","title":""},{"docid":"b2bc192b01fcfc045aaf6be96c75b2f0","score":"0.49615428","text":"void use(PlayerCharacter Player) {\n }","title":""},{"docid":"204167b28c90aefc197385f4a762204a","score":"0.4960074","text":"public void setSourceBuyerIp(String sourceBuyerIp) {\n\t\tthis.sourceBuyerIp = sourceBuyerIp;\n\t}","title":""},{"docid":"7f6528650c3574abf273c0f50dae67ee","score":"0.49557477","text":"public interface BanList {\n\n /**\n * Add a ban to this list.\n *\n * @param playerName the player name\n * @param ipAddress the ip address\n * @param reason the reason\n * @param expiration when the ban expires.\n */\n void addBan(String playerName, String ipAddress, String reason, Date expiration);\n\n /**\n * Check if the provided {@code addressOrPlayerName} is banned.\n *\n * @param addressOrPlayerName the IP address or player name.\n * @return {@code true} if the player is banned.\n */\n boolean isBanned(String addressOrPlayerName);\n\n}","title":""},{"docid":"a2dbb94485a5aa3addf4fbf438853461","score":"0.49407232","text":"public Player getPlayer(){return Bukkit.getPlayer(this.player);}","title":""},{"docid":"a62ea48327a70afd230149332fa21bfe","score":"0.49344188","text":"public void setPlayer(Player player) {\n this.player = player;\n }","title":""},{"docid":"f2c1008f74fbc249a445da95dc26266f","score":"0.49327737","text":"@Override\n\tpublic boolean isUseableByPlayer(EntityPlayer player)\n\t{\n\t\treturn true;\n\t}","title":""},{"docid":"c923e97143e16bdc281db95e0490165d","score":"0.49282816","text":"public com.didiglobal.booster.aapt2.Resources.Source getSource() {\n if (sourceBuilder_ == null) {\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\n } else {\n return sourceBuilder_.getMessage();\n }\n }","title":""},{"docid":"c923e97143e16bdc281db95e0490165d","score":"0.49275702","text":"public com.didiglobal.booster.aapt2.Resources.Source getSource() {\n if (sourceBuilder_ == null) {\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\n } else {\n return sourceBuilder_.getMessage();\n }\n }","title":""},{"docid":"c923e97143e16bdc281db95e0490165d","score":"0.49275702","text":"public com.didiglobal.booster.aapt2.Resources.Source getSource() {\n if (sourceBuilder_ == null) {\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\n } else {\n return sourceBuilder_.getMessage();\n }\n }","title":""},{"docid":"c923e97143e16bdc281db95e0490165d","score":"0.49275702","text":"public com.didiglobal.booster.aapt2.Resources.Source getSource() {\n if (sourceBuilder_ == null) {\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\n } else {\n return sourceBuilder_.getMessage();\n }\n }","title":""},{"docid":"c923e97143e16bdc281db95e0490165d","score":"0.492719","text":"public com.didiglobal.booster.aapt2.Resources.Source getSource() {\n if (sourceBuilder_ == null) {\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\n } else {\n return sourceBuilder_.getMessage();\n }\n }","title":""},{"docid":"364a0924812e14a86d9b9221fc34d17b","score":"0.49200624","text":"public com.didiglobal.booster.aapt2.Resources.Source getSource() {\n if (sourceBuilder_ == null) {\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\n } else {\n return sourceBuilder_.getMessage();\n }\n }","title":""},{"docid":"364a0924812e14a86d9b9221fc34d17b","score":"0.49200624","text":"public com.didiglobal.booster.aapt2.Resources.Source getSource() {\n if (sourceBuilder_ == null) {\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\n } else {\n return sourceBuilder_.getMessage();\n }\n }","title":""},{"docid":"364a0924812e14a86d9b9221fc34d17b","score":"0.49200624","text":"public com.didiglobal.booster.aapt2.Resources.Source getSource() {\n if (sourceBuilder_ == null) {\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\n } else {\n return sourceBuilder_.getMessage();\n }\n }","title":""},{"docid":"364a0924812e14a86d9b9221fc34d17b","score":"0.49200624","text":"public com.didiglobal.booster.aapt2.Resources.Source getSource() {\n if (sourceBuilder_ == null) {\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\n } else {\n return sourceBuilder_.getMessage();\n }\n }","title":""},{"docid":"ae13c6316d613e96b0d951755649cadf","score":"0.49135166","text":"@Enumerated (EnumType.STRING)\n @Column (length = 25, name=\"SOURCE\", nullable = false)\n public Source getSource() {\n return this.source;\n }","title":""},{"docid":"ea3ad10189ee67ef4834dac16e13e4b9","score":"0.49092916","text":"public AcceleoSourceBuffer getSource() {\n \t\treturn source;\n \t}","title":""},{"docid":"da899af11cbcf517f6b7ab616b15d202","score":"0.4908405","text":"public void setSource(String source) {\n\n this.source = source;\n }","title":""},{"docid":"2c4bad6afeeec92408d6b5d4bdbffeb2","score":"0.49058482","text":"public Player senderToPlayer(CommandSender sender) {\n\t\treturn getServer().getPlayer(sender.getName());\n\t}","title":""},{"docid":"514e7bacae7e43e8660161d0da472c7d","score":"0.48926932","text":"public void setSource(String source) {\n this.source = source;\n }","title":""},{"docid":"514e7bacae7e43e8660161d0da472c7d","score":"0.48926932","text":"public void setSource(String source) {\n this.source = source;\n }","title":""},{"docid":"95b5225dca113a28c1db0065cdadcf49","score":"0.48898134","text":"public void setSource(short value) {\n this.source = value;\n }","title":""},{"docid":"cd4a48c462e3ac27202bbac9252d8c16","score":"0.48872444","text":"public int getSource() {\n return mSource;\n }","title":""},{"docid":"6f19480948a29a04bdb8bac317182c49","score":"0.48850033","text":"protected Entity findPlayerToAttack()\n {\n EntityPlayer var1 = this.worldObj.getClosestVulnerablePlayerToEntity(this, 64.0D);\n\n if (var1 != null)\n {\n if (this.shouldAttackPlayer(var1))\n {\n if (this.field_70826_g == 0)\n {\n this.worldObj.playSoundAtEntity(var1, \"mob.endermen.stare\", 1.0F, 1.0F);\n }\n\n if (this.field_70826_g++ == 5)\n {\n this.field_70826_g = 0;\n return var1;\n }\n }\n else\n {\n this.field_70826_g = 0;\n }\n }\n\n return null;\n }","title":""},{"docid":"9781f8030768babe4c462c9ebeedeb6b","score":"0.48757643","text":"public void setPlayer(String player) {\n this.player = player;\n }","title":""},{"docid":"f02697dd7b4e2653b7f1384e1917b32b","score":"0.48754832","text":"public void setSource(String source) {\n\t\tthis.source = source;\n\t}","title":""},{"docid":"407c4f74e5aff227a2e91fcadea36d84","score":"0.48563293","text":"public Player(Deck sourceDeck) {\n this.hand = new Hand(2, sourceDeck);\n this.score = this.getHand().handPoint();\n }","title":""},{"docid":"002f42f77421f511df784aafe7d34597","score":"0.48509476","text":"void setSource(Object source) {\n this.source = source;\n }","title":""},{"docid":"2a88b7b938fcc32b6d5c722451d8fb70","score":"0.48438662","text":"public AnimationPlayer getSource();","title":""},{"docid":"edb5e3424628d2f23fe9fe9d8ffbb9b4","score":"0.48416612","text":"public void setSource(String value)\n {\n source = value;\n }","title":""},{"docid":"91738550e5206e0fe4c0aa8660f6ab9b","score":"0.4838431","text":"public Investor getPlayer()\r\n {\r\n return player;\r\n }","title":""},{"docid":"ed51f0c7efa1a31ca0f36a8f4960d025","score":"0.48364967","text":"public void SetPlayerId(int a_id) { this.m_playerId = a_id; }","title":""},{"docid":"16b73e3dfd51899db1b4d588c3412c5c","score":"0.4831895","text":"public void setPlayer(int player) {\r\n\t\tthis.player = player;\r\n\t}","title":""},{"docid":"6c216cc46c76bb32957f3a1438957f81","score":"0.48303515","text":"void onPlayerChanged(Player player);","title":""},{"docid":"b70562486f78631c76ce6a3efdd27e3b","score":"0.48280442","text":"public void setSource( Source source)\n {\n source_ = source;\n }","title":""},{"docid":"ea93b83ac187b5d7bd33cc047318a461","score":"0.48278907","text":"public boolean attackEntityFrom(DamageSource source, float amount)\n {\n if (this.func_184686_df())\n {\n Entity entity = source.getSourceOfDamage();\n\n if (entity instanceof EntityArrow)\n {\n return false;\n }\n }\n\n if (super.attackEntityFrom(source, amount))\n {\n if ((double)this.getHealth() < (double)this.getMaxHealth() * 0.5D && this.rand.nextInt(4) == 0)\n {\n this.func_184689_o();\n }\n\n return true;\n }\n else\n {\n return false;\n }\n }","title":""},{"docid":"949b7e012c4c0bf44afe2296d99e4f83","score":"0.48214236","text":"@Override\n\tpublic boolean isUseableByPlayer(EntityPlayer var1)\n\t{\n\t\treturn false;\n\t}","title":""},{"docid":"4b4f1e99ece81c018047bff79a8dbb2b","score":"0.48198658","text":"void setSource(String source) {\n\t\tthis.source = source;\n\t}","title":""},{"docid":"e4fd45b43976094b8493adadff9950b5","score":"0.48171204","text":"public void setSourceChannel(Integer sourceChannel) {\n this.sourceChannel = sourceChannel;\n }","title":""},{"docid":"841f3857615464e60a30c9c3fa42de44","score":"0.47999597","text":"public ReachabilityGraphNode getSource() {\n\t\treturn this.source;\n\t}","title":""},{"docid":"7922c74bfe41c61ff48b57b7b96b9524","score":"0.47882107","text":"public void setSource(Source s) {\n this.source = s;\n }","title":""},{"docid":"bd47265ee0ccd3cf3f4c84229e502062","score":"0.47835237","text":"public SMUHCPlayer getPlayer(Player player) {\n return getPlayer(player.getUniqueId().toString());\n }","title":""},{"docid":"af1187c29c69ad6d9ea27b7359f9735c","score":"0.47831434","text":"public Player getOwner()\n {\n return owner;\n }","title":""},{"docid":"b5cf18f4a0025542a640dd3d5172ba01","score":"0.47819078","text":"private void updatePlayerAndSources() {\n sourceUpdater.updateMixer();\r\n\r\n //update all sources\r\n for (MixerSource source : sources) {\r\n sourceUpdater.updateSource(source);\r\n }\r\n }","title":""},{"docid":"50463818f7b38bd129ebdef4fc5b024f","score":"0.47811395","text":"public Sprite getSourceCon() {\r\n\t\treturn sourceCon;\r\n\t}","title":""},{"docid":"cb3971f9201c46281b66451caa567178","score":"0.47791278","text":"public LowbrainPlayer(Player p){\n\t\tsuper(p);\n\t\tinitializePlayer();\n\t}","title":""},{"docid":"2182ae6e3171c01ea95760ed3f023a9e","score":"0.47739533","text":"public BreakerPlayer(Strategy strategy, String playerName) {\r\n super(strategy, playerName);\r\n }","title":""},{"docid":"100c1ccb6d376c6cbaf925b16397a0b9","score":"0.47733352","text":"public void setPlayer(Player player) {\n\t\tthis.player = player;\n\t}","title":""},{"docid":"100c1ccb6d376c6cbaf925b16397a0b9","score":"0.47733352","text":"public void setPlayer(Player player) {\n\t\tthis.player = player;\n\t}","title":""},{"docid":"100c1ccb6d376c6cbaf925b16397a0b9","score":"0.47733352","text":"public void setPlayer(Player player) {\n\t\tthis.player = player;\n\t}","title":""},{"docid":"100c1ccb6d376c6cbaf925b16397a0b9","score":"0.47733352","text":"public void setPlayer(Player player) {\n\t\tthis.player = player;\n\t}","title":""},{"docid":"28b0429a2eb23c3dc3932900da6d1f6f","score":"0.47730148","text":"public static void use(Player p) {\n\t\t\r\n\t}","title":""},{"docid":"2b4f686e9483bf202b6f2a0c91348f7e","score":"0.47728878","text":"public int getSource()\n {\n return source;\n }","title":""},{"docid":"a36ea722b120a3f66cad2109a9467e03","score":"0.47725844","text":"@java.lang.Override\n public com.didiglobal.booster.aapt2.Resources.Source getSource() {\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\n }","title":""},{"docid":"a36ea722b120a3f66cad2109a9467e03","score":"0.47725844","text":"@java.lang.Override\n public com.didiglobal.booster.aapt2.Resources.Source getSource() {\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\n }","title":""},{"docid":"a36ea722b120a3f66cad2109a9467e03","score":"0.47725844","text":"@java.lang.Override\n public com.didiglobal.booster.aapt2.Resources.Source getSource() {\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\n }","title":""},{"docid":"a36ea722b120a3f66cad2109a9467e03","score":"0.47725844","text":"@java.lang.Override\n public com.didiglobal.booster.aapt2.Resources.Source getSource() {\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\n }","title":""},{"docid":"d8656a40c3b74a2602084bbc1f283d13","score":"0.47705963","text":"public Object getSource();","title":""},{"docid":"582ab2328ac98af225b15c152bb5e072","score":"0.4768596","text":"public void setPlayer(Player player){\n\t\tthis.player=player;\n\t}","title":""},{"docid":"95c0e90eaeddb0f0cbb59f254ed386d5","score":"0.4767738","text":"public Flag(Player player){\n\t\tthis.player = player;\n\t}","title":""},{"docid":"fc940eda7e0e1a10c6df832aeaeb0346","score":"0.47654307","text":"public Player getPlayer() {\n\t\tif (senderIsPlayer())\n\t\t\treturn (Player) _sender;\n\t\treturn null;\n\t}","title":""},{"docid":"e9dcc9551309827590ee7d408aa2da19","score":"0.47617757","text":"public boolean senderIsPlayer() {\n\t\treturn _sender instanceof Player;\n\t}","title":""},{"docid":"9b9730ad0038e9c4ebdf2f8d26eee86b","score":"0.47609058","text":"public void setPlayer(Player p)\r\n\t{\r\n\t\tthis.player = p;\r\n\t}","title":""},{"docid":"80f07239427ad71c4e172e8fff4225d0","score":"0.47553337","text":"@java.lang.Override\n public com.didiglobal.booster.aapt2.Resources.Source getSource() {\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\n }","title":""},{"docid":"80f07239427ad71c4e172e8fff4225d0","score":"0.47553337","text":"@java.lang.Override\n public com.didiglobal.booster.aapt2.Resources.Source getSource() {\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\n }","title":""},{"docid":"80f07239427ad71c4e172e8fff4225d0","score":"0.47551456","text":"@java.lang.Override\n public com.didiglobal.booster.aapt2.Resources.Source getSource() {\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\n }","title":""},{"docid":"d6b0a62cb3c2154e9c2cfaa2e55e120a","score":"0.47547832","text":"public Player getPlayerToTradeWith() { return playerTo; }","title":""},{"docid":"80f07239427ad71c4e172e8fff4225d0","score":"0.47544962","text":"@java.lang.Override\n public com.didiglobal.booster.aapt2.Resources.Source getSource() {\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\n }","title":""},{"docid":"80f07239427ad71c4e172e8fff4225d0","score":"0.47544962","text":"@java.lang.Override\n public com.didiglobal.booster.aapt2.Resources.Source getSource() {\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\n }","title":""},{"docid":"7119d13c41331a8d16aff1e075105de5","score":"0.4741826","text":"public boolean attackEntityFrom(DamageSource source, float amount)\r\n {\r\n if(isInvulnerable()) return false;\r\n else if(this.world.isRemote) return false;\r\n else if(source == DamageSource.OUT_OF_WORLD)\r\n {\r\n if(!this.isAlive()) return false;\r\n onDeath(source);\r\n setDead();\r\n return true;\r\n }\r\n \r\n return false;\r\n }","title":""},{"docid":"726c8fd8a5a91b69f4f5fcb203344a6a","score":"0.47414127","text":"public int getSource(){\r\n\t\treturn this.source;\r\n\t}","title":""},{"docid":"5d688e765b72d8087a3709727d27dad3","score":"0.47385874","text":"public void setPlayerId(String s) {\n\t\tplayerId = s;\n\t}","title":""},{"docid":"dbcc1fa5b03a8ebda2a0b2d5f7e4000a","score":"0.47373053","text":"public Player getOwner() {\n return this.owner;\n }","title":""},{"docid":"20e834ef28947ff59b27b7c6be2dd8d5","score":"0.47354478","text":"public Player(String name){\n this.name = name;\n id = numPlayer;\n numPlayer++;\n totalUnits = 0;\n availableUnits = 0;\n countriesOwned = new ArrayList<Country>();\n }","title":""},{"docid":"f8b61515d0c3060feb605b490f3d8bd8","score":"0.4733339","text":"public void setSource(String source);","title":""},{"docid":"ca8b1d6e3aa2b68dd716299f1b9e1f1c","score":"0.4718883","text":"public UUID getPlayer() { return player; }","title":""},{"docid":"ff13b3fff7c6fb60cc74972200694709","score":"0.47173813","text":"public String getSource() {\n return source;\n }","title":""},{"docid":"ff6a45fec4fa9480aff9f469664516eb","score":"0.4717113","text":"public MemberModel getSource() {\r\n\t\treturn source;\r\n\t}","title":""},{"docid":"ad42796f3628eb5501798be03c2ad15f","score":"0.47166085","text":"public short getSource() {\n return source;\n }","title":""}],"string":"[\n {\n \"docid\": \"daf64321f91fd9182905396f23b6f337\",\n \"score\": \"0.5885944\",\n \"text\": \"@Override\\n\\tpublic CommandResult execute(CommandSource source, CommandContext args)throws CommandException {\\n\\n\\t\\t\\n\\t\\t\\n\\t\\tif(source instanceof Player) {\\n\\t\\t\\tPlayer player = (Player) source;\\n\\t\\t\\tString playerName;\\n\\t\\t\\tif(args.hasAny(\\\"playerName\\\")){\\n\\t\\t\\t\\tif(player.hasPermission(\\\"whippyconomy.bal.others\\\")){ \\t\\t\\n\\t\\t\\t\\t\\tplayerName = (String) args.getOne(\\\"playerName\\\").get();\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tplayer.sendMessage(Texts.builder(\\\"You do not have permission to use that command\\\").color(TextColors.RED).build());\\n\\t\\t\\t\\t\\treturn CommandResult.empty();\\n\\t\\t\\t\\t}\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tplayerName = player.getName();\\n\\t\\t\\t}\\n\\t\\t\\tString playerId = EconomyCache.getId(playerName);\\n\\t\\t\\tif(playerId==null || playerId.isEmpty()){\\n\\t\\t\\t\\tplayer.sendMessage(Texts.builder(playerName + \\\" does not exist!\\\").color(TextColors.RED).build());\\n\\t\\t\\t}else{\\t\\t\\t\\t\\n\\t\\t\\t\\tdouble bal = EconomyCache.getBalance(playerId);\\n\\t\\t\\t\\tbal = EconomyCache.round(bal, ConfigurationLoader.getDecPlaces());\\t\\t\\t\\t\\n\\t\\t\\t\\tplayer.sendMessage(Texts.builder(buildBalanceMessage(bal, \\\"Current\\\")).color(TextColors.GREEN).build());\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(ConfigurationLoader.isSavingsEnabled()){\\n\\t\\t\\t\\t\\tdouble balSavings = EconomyCache.getSavingBalance(playerId);\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tbalSavings = EconomyCache.round(balSavings, ConfigurationLoader.getDecPlaces());\\n\\t\\t\\t\\t\\tplayer.sendMessage(Texts.builder(buildBalanceMessage(balSavings, \\\"Savings\\\")).color(TextColors.GREEN).build());\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t } else {\\n\\t \\tStaticsHandler.getLogger().warn(\\\"Bal called by non player entity\\\");\\n\\t \\treturn CommandResult.empty();\\n\\t }\\n\\t return CommandResult.success();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8b2a4fccd892349a4d5dde17ec5f55b5\",\n \"score\": \"0.5484139\",\n \"text\": \"public Punishment getActiveBan(UUID player) {\\n for (Punishment punishment : getPunishments(player)) {\\n if ((punishment.getType() == PunishmentType.PERMANENT_BAN || punishment.getType() == PunishmentType.TEMPORARY_BAN) && punishment.isActive()) {\\n return punishment;\\n }\\n }\\n return null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f55ca6ce6813cca16dd7ebe59c09c22b\",\n \"score\": \"0.541059\",\n \"text\": \"void addBan(String playerName, String ipAddress, String reason, Date expiration);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ae27f22531bcea160560966f228518d3\",\n \"score\": \"0.54019916\",\n \"text\": \"@Override\\n public boolean applies(GameEvent event, Ability source, Game game) {\\n return event.getAmount() > 0 && source.getControllerId().equals(event.getPlayerId());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a998f93279d5248c7fb58d60628987d3\",\n \"score\": \"0.53949124\",\n \"text\": \"public Teamable getSource();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aeaa44bf9f0da232a00a3d860b90d44f\",\n \"score\": \"0.52757275\",\n \"text\": \"Player getOwnPlayer();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d6b59682c827a7a77c4b776261491fe8\",\n \"score\": \"0.5233156\",\n \"text\": \"public int getFromPlayerId() {\\n return fromPlayerId_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5fc06402a2c4afccd530fd0c93e02689\",\n \"score\": \"0.523112\",\n \"text\": \"public int getFromPlayerId() {\\n return fromPlayerId_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f071680ebbe7a8b9b2cc3b40bd385ce8\",\n \"score\": \"0.5192982\",\n \"text\": \"BluetoothSourceNode(String source) {\\r\\n super(true);\\r\\n this.source = source;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cf08c2cbb4619d2da36e37b5755ae6ac\",\n \"score\": \"0.5160341\",\n \"text\": \"public void who(Player player) {\\n this.player = player;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"380068c4de2d9a0ba334d25ddceee201\",\n \"score\": \"0.510818\",\n \"text\": \"public boolean attackEntityFrom(DamageSource source, float amount) {\\r\\n boolean flag = super.attackEntityFrom(source, amount);\\r\\n if (this.world.isRemote) {\\r\\n return false;\\r\\n } else {\\r\\n if (flag && source.getTrueSource() instanceof LivingEntity) {\\r\\n try {\\r\\n\\t\\t\\t\\tColorEntityBrain.func_242353_a(this, (LivingEntity)source.getTrueSource());\\r\\n\\t\\t\\t} catch (IllegalAccessException | IllegalArgumentException | InvocationTargetException e) {\\r\\n\\t\\t\\t\\te.printStackTrace();\\r\\n\\t\\t\\t}\\r\\n }\\r\\n\\r\\n return flag;\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9c334a1c33152889d17522aed9362c75\",\n \"score\": \"0.5066222\",\n \"text\": \"public void ban(ChatClient client, ChatClient target) throws UserNotOperatorException, UserNotOnChannelException {\\n\\n if (!users.contains(client))\\n throw new UserNotOnChannelException();\\n\\n if (getOwner() != client)\\n throw new UserNotOperatorException();\\n\\n bans.add(target.getNick());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d7174412d9f5e9f930fb78618dfbc971\",\n \"score\": \"0.5063422\",\n \"text\": \"@Override\\n public void run() {\\n List<WrappedPlayer> lwp = core.getWrappedServer().getOnlinePlayers();\\n if (lwp.isEmpty()) {\\n return;\\n }\\n\\n // Get the server bans for any players currently online.\\n Set<UUID> players = lwp.stream().map(WrappedPlayer::getUUID).collect(Collectors.toSet());\\n\\n List<HammerPlayerBan> bans;\\n try (DatabaseConnection dg = core.getDatabaseConnection()){\\n bans = dg.getBanHandler().getPlayerBansForServer(players, core.getConfig().getConfig().getNode(\\\"server\\\", \\\"id\\\").getInt(1));\\n } catch (Exception e) {\\n // Let's not worry too much\\n core.getWrappedServer().getLogger().warn(\\\"There was an error running the ban check task. It will be retried later.\\\");\\n e.printStackTrace();\\n return;\\n }\\n\\n if (bans.isEmpty()) {\\n // No bans here!\\n return;\\n }\\n\\n final WrappedServer s = core.getWrappedServer();\\n bans.forEach(b -> {\\n WrappedPlayer wp = s.getPlayer(b.getBannedUUID());\\n if (wp != null) {\\n String name = wp.getName();\\n\\n // Ban in sync!\\n s.getScheduler().runSyncNow(() -> wp.ban(s.getConsole(), b.getReason()));\\n s.sendMessageToPermissionGroup(new HammerTextBuilder().add(\\\"[Hammer] The player \\\", HammerTextColours.RED)\\n .add(name, HammerTextColours.WHITE).add(\\\" has been kicked as they have been banned from elsewhere.\\\").build(), \\\"hammer.notify\\\");\\n s.sendMessageToPermissionGroup(new HammerTextBuilder().add(\\\"[Hammer] Reason: \\\" + b.getReason(), HammerTextColours.RED).build(), \\\"hammer.notify\\\");\\n\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"400d3d2c9664b7ea22d24505f489142e\",\n \"score\": \"0.5049215\",\n \"text\": \"@Override\\n\\tpublic void robPlayer(RobPlayerInfo victim) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dc7fc4540227fd91c940c449de2ed3e7\",\n \"score\": \"0.50477993\",\n \"text\": \"tasly.greathealth.oms.domain.order.ChannelSource getChannelsource();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e2ccccb702c03e6ad0fb181b74ad27b4\",\n \"score\": \"0.503913\",\n \"text\": \"public UserInfoDatagram(Encryptor encryptor, DatagramPacket source) {\\n super(encryptor, DatagramTypes.SERVER_CLIENTS_INFO);\\n this.data=source.getData();\\n this.message=bytesToString(unpackAndDecrypt(source));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"52c8f71e45fa4f7ed101fb260b59267f\",\n \"score\": \"0.498957\",\n \"text\": \"public Player getPlayer() {\\n return owner;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d16281c442178e3fb9dcc6fb15916bad\",\n \"score\": \"0.4985593\",\n \"text\": \"public HServerInfo getSource() {\\n return source;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"96dce1cd3de07e2c22a2a693767d68c9\",\n \"score\": \"0.49731925\",\n \"text\": \"public String getPingSource()\\n {\\n return pingSource;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fdd3733bc7197e469f962e7f9cb8952a\",\n \"score\": \"0.49730006\",\n \"text\": \"Source getSource(SourceType type);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a5686d8d3894dce1bb36fdbb909d1d84\",\n \"score\": \"0.49642953\",\n \"text\": \"public Source getSource()\\n {\\n return source_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b2bc192b01fcfc045aaf6be96c75b2f0\",\n \"score\": \"0.49615428\",\n \"text\": \"void use(PlayerCharacter Player) {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"204167b28c90aefc197385f4a762204a\",\n \"score\": \"0.4960074\",\n \"text\": \"public void setSourceBuyerIp(String sourceBuyerIp) {\\n\\t\\tthis.sourceBuyerIp = sourceBuyerIp;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7f6528650c3574abf273c0f50dae67ee\",\n \"score\": \"0.49557477\",\n \"text\": \"public interface BanList {\\n\\n /**\\n * Add a ban to this list.\\n *\\n * @param playerName the player name\\n * @param ipAddress the ip address\\n * @param reason the reason\\n * @param expiration when the ban expires.\\n */\\n void addBan(String playerName, String ipAddress, String reason, Date expiration);\\n\\n /**\\n * Check if the provided {@code addressOrPlayerName} is banned.\\n *\\n * @param addressOrPlayerName the IP address or player name.\\n * @return {@code true} if the player is banned.\\n */\\n boolean isBanned(String addressOrPlayerName);\\n\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a2dbb94485a5aa3addf4fbf438853461\",\n \"score\": \"0.49407232\",\n \"text\": \"public Player getPlayer(){return Bukkit.getPlayer(this.player);}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a62ea48327a70afd230149332fa21bfe\",\n \"score\": \"0.49344188\",\n \"text\": \"public void setPlayer(Player player) {\\n this.player = player;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f2c1008f74fbc249a445da95dc26266f\",\n \"score\": \"0.49327737\",\n \"text\": \"@Override\\n\\tpublic boolean isUseableByPlayer(EntityPlayer player)\\n\\t{\\n\\t\\treturn true;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c923e97143e16bdc281db95e0490165d\",\n \"score\": \"0.49282816\",\n \"text\": \"public com.didiglobal.booster.aapt2.Resources.Source getSource() {\\n if (sourceBuilder_ == null) {\\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\\n } else {\\n return sourceBuilder_.getMessage();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c923e97143e16bdc281db95e0490165d\",\n \"score\": \"0.49275702\",\n \"text\": \"public com.didiglobal.booster.aapt2.Resources.Source getSource() {\\n if (sourceBuilder_ == null) {\\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\\n } else {\\n return sourceBuilder_.getMessage();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c923e97143e16bdc281db95e0490165d\",\n \"score\": \"0.49275702\",\n \"text\": \"public com.didiglobal.booster.aapt2.Resources.Source getSource() {\\n if (sourceBuilder_ == null) {\\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\\n } else {\\n return sourceBuilder_.getMessage();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c923e97143e16bdc281db95e0490165d\",\n \"score\": \"0.49275702\",\n \"text\": \"public com.didiglobal.booster.aapt2.Resources.Source getSource() {\\n if (sourceBuilder_ == null) {\\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\\n } else {\\n return sourceBuilder_.getMessage();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c923e97143e16bdc281db95e0490165d\",\n \"score\": \"0.492719\",\n \"text\": \"public com.didiglobal.booster.aapt2.Resources.Source getSource() {\\n if (sourceBuilder_ == null) {\\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\\n } else {\\n return sourceBuilder_.getMessage();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"364a0924812e14a86d9b9221fc34d17b\",\n \"score\": \"0.49200624\",\n \"text\": \"public com.didiglobal.booster.aapt2.Resources.Source getSource() {\\n if (sourceBuilder_ == null) {\\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\\n } else {\\n return sourceBuilder_.getMessage();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"364a0924812e14a86d9b9221fc34d17b\",\n \"score\": \"0.49200624\",\n \"text\": \"public com.didiglobal.booster.aapt2.Resources.Source getSource() {\\n if (sourceBuilder_ == null) {\\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\\n } else {\\n return sourceBuilder_.getMessage();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"364a0924812e14a86d9b9221fc34d17b\",\n \"score\": \"0.49200624\",\n \"text\": \"public com.didiglobal.booster.aapt2.Resources.Source getSource() {\\n if (sourceBuilder_ == null) {\\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\\n } else {\\n return sourceBuilder_.getMessage();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"364a0924812e14a86d9b9221fc34d17b\",\n \"score\": \"0.49200624\",\n \"text\": \"public com.didiglobal.booster.aapt2.Resources.Source getSource() {\\n if (sourceBuilder_ == null) {\\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\\n } else {\\n return sourceBuilder_.getMessage();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ae13c6316d613e96b0d951755649cadf\",\n \"score\": \"0.49135166\",\n \"text\": \"@Enumerated (EnumType.STRING)\\n @Column (length = 25, name=\\\"SOURCE\\\", nullable = false)\\n public Source getSource() {\\n return this.source;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ea3ad10189ee67ef4834dac16e13e4b9\",\n \"score\": \"0.49092916\",\n \"text\": \"public AcceleoSourceBuffer getSource() {\\n \\t\\treturn source;\\n \\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"da899af11cbcf517f6b7ab616b15d202\",\n \"score\": \"0.4908405\",\n \"text\": \"public void setSource(String source) {\\n\\n this.source = source;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c4bad6afeeec92408d6b5d4bdbffeb2\",\n \"score\": \"0.49058482\",\n \"text\": \"public Player senderToPlayer(CommandSender sender) {\\n\\t\\treturn getServer().getPlayer(sender.getName());\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"514e7bacae7e43e8660161d0da472c7d\",\n \"score\": \"0.48926932\",\n \"text\": \"public void setSource(String source) {\\n this.source = source;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"514e7bacae7e43e8660161d0da472c7d\",\n \"score\": \"0.48926932\",\n \"text\": \"public void setSource(String source) {\\n this.source = source;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"95b5225dca113a28c1db0065cdadcf49\",\n \"score\": \"0.48898134\",\n \"text\": \"public void setSource(short value) {\\n this.source = value;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd4a48c462e3ac27202bbac9252d8c16\",\n \"score\": \"0.48872444\",\n \"text\": \"public int getSource() {\\n return mSource;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6f19480948a29a04bdb8bac317182c49\",\n \"score\": \"0.48850033\",\n \"text\": \"protected Entity findPlayerToAttack()\\n {\\n EntityPlayer var1 = this.worldObj.getClosestVulnerablePlayerToEntity(this, 64.0D);\\n\\n if (var1 != null)\\n {\\n if (this.shouldAttackPlayer(var1))\\n {\\n if (this.field_70826_g == 0)\\n {\\n this.worldObj.playSoundAtEntity(var1, \\\"mob.endermen.stare\\\", 1.0F, 1.0F);\\n }\\n\\n if (this.field_70826_g++ == 5)\\n {\\n this.field_70826_g = 0;\\n return var1;\\n }\\n }\\n else\\n {\\n this.field_70826_g = 0;\\n }\\n }\\n\\n return null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9781f8030768babe4c462c9ebeedeb6b\",\n \"score\": \"0.48757643\",\n \"text\": \"public void setPlayer(String player) {\\n this.player = player;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f02697dd7b4e2653b7f1384e1917b32b\",\n \"score\": \"0.48754832\",\n \"text\": \"public void setSource(String source) {\\n\\t\\tthis.source = source;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"407c4f74e5aff227a2e91fcadea36d84\",\n \"score\": \"0.48563293\",\n \"text\": \"public Player(Deck sourceDeck) {\\n this.hand = new Hand(2, sourceDeck);\\n this.score = this.getHand().handPoint();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"002f42f77421f511df784aafe7d34597\",\n \"score\": \"0.48509476\",\n \"text\": \"void setSource(Object source) {\\n this.source = source;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2a88b7b938fcc32b6d5c722451d8fb70\",\n \"score\": \"0.48438662\",\n \"text\": \"public AnimationPlayer getSource();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"edb5e3424628d2f23fe9fe9d8ffbb9b4\",\n \"score\": \"0.48416612\",\n \"text\": \"public void setSource(String value)\\n {\\n source = value;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"91738550e5206e0fe4c0aa8660f6ab9b\",\n \"score\": \"0.4838431\",\n \"text\": \"public Investor getPlayer()\\r\\n {\\r\\n return player;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ed51f0c7efa1a31ca0f36a8f4960d025\",\n \"score\": \"0.48364967\",\n \"text\": \"public void SetPlayerId(int a_id) { this.m_playerId = a_id; }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"16b73e3dfd51899db1b4d588c3412c5c\",\n \"score\": \"0.4831895\",\n \"text\": \"public void setPlayer(int player) {\\r\\n\\t\\tthis.player = player;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6c216cc46c76bb32957f3a1438957f81\",\n \"score\": \"0.48303515\",\n \"text\": \"void onPlayerChanged(Player player);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b70562486f78631c76ce6a3efdd27e3b\",\n \"score\": \"0.48280442\",\n \"text\": \"public void setSource( Source source)\\n {\\n source_ = source;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ea93b83ac187b5d7bd33cc047318a461\",\n \"score\": \"0.48278907\",\n \"text\": \"public boolean attackEntityFrom(DamageSource source, float amount)\\n {\\n if (this.func_184686_df())\\n {\\n Entity entity = source.getSourceOfDamage();\\n\\n if (entity instanceof EntityArrow)\\n {\\n return false;\\n }\\n }\\n\\n if (super.attackEntityFrom(source, amount))\\n {\\n if ((double)this.getHealth() < (double)this.getMaxHealth() * 0.5D && this.rand.nextInt(4) == 0)\\n {\\n this.func_184689_o();\\n }\\n\\n return true;\\n }\\n else\\n {\\n return false;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"949b7e012c4c0bf44afe2296d99e4f83\",\n \"score\": \"0.48214236\",\n \"text\": \"@Override\\n\\tpublic boolean isUseableByPlayer(EntityPlayer var1)\\n\\t{\\n\\t\\treturn false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4b4f1e99ece81c018047bff79a8dbb2b\",\n \"score\": \"0.48198658\",\n \"text\": \"void setSource(String source) {\\n\\t\\tthis.source = source;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e4fd45b43976094b8493adadff9950b5\",\n \"score\": \"0.48171204\",\n \"text\": \"public void setSourceChannel(Integer sourceChannel) {\\n this.sourceChannel = sourceChannel;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"841f3857615464e60a30c9c3fa42de44\",\n \"score\": \"0.47999597\",\n \"text\": \"public ReachabilityGraphNode getSource() {\\n\\t\\treturn this.source;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7922c74bfe41c61ff48b57b7b96b9524\",\n \"score\": \"0.47882107\",\n \"text\": \"public void setSource(Source s) {\\n this.source = s;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bd47265ee0ccd3cf3f4c84229e502062\",\n \"score\": \"0.47835237\",\n \"text\": \"public SMUHCPlayer getPlayer(Player player) {\\n return getPlayer(player.getUniqueId().toString());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"af1187c29c69ad6d9ea27b7359f9735c\",\n \"score\": \"0.47831434\",\n \"text\": \"public Player getOwner()\\n {\\n return owner;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b5cf18f4a0025542a640dd3d5172ba01\",\n \"score\": \"0.47819078\",\n \"text\": \"private void updatePlayerAndSources() {\\n sourceUpdater.updateMixer();\\r\\n\\r\\n //update all sources\\r\\n for (MixerSource source : sources) {\\r\\n sourceUpdater.updateSource(source);\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"50463818f7b38bd129ebdef4fc5b024f\",\n \"score\": \"0.47811395\",\n \"text\": \"public Sprite getSourceCon() {\\r\\n\\t\\treturn sourceCon;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cb3971f9201c46281b66451caa567178\",\n \"score\": \"0.47791278\",\n \"text\": \"public LowbrainPlayer(Player p){\\n\\t\\tsuper(p);\\n\\t\\tinitializePlayer();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2182ae6e3171c01ea95760ed3f023a9e\",\n \"score\": \"0.47739533\",\n \"text\": \"public BreakerPlayer(Strategy strategy, String playerName) {\\r\\n super(strategy, playerName);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"100c1ccb6d376c6cbaf925b16397a0b9\",\n \"score\": \"0.47733352\",\n \"text\": \"public void setPlayer(Player player) {\\n\\t\\tthis.player = player;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"100c1ccb6d376c6cbaf925b16397a0b9\",\n \"score\": \"0.47733352\",\n \"text\": \"public void setPlayer(Player player) {\\n\\t\\tthis.player = player;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"100c1ccb6d376c6cbaf925b16397a0b9\",\n \"score\": \"0.47733352\",\n \"text\": \"public void setPlayer(Player player) {\\n\\t\\tthis.player = player;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"100c1ccb6d376c6cbaf925b16397a0b9\",\n \"score\": \"0.47733352\",\n \"text\": \"public void setPlayer(Player player) {\\n\\t\\tthis.player = player;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"28b0429a2eb23c3dc3932900da6d1f6f\",\n \"score\": \"0.47730148\",\n \"text\": \"public static void use(Player p) {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2b4f686e9483bf202b6f2a0c91348f7e\",\n \"score\": \"0.47728878\",\n \"text\": \"public int getSource()\\n {\\n return source;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a36ea722b120a3f66cad2109a9467e03\",\n \"score\": \"0.47725844\",\n \"text\": \"@java.lang.Override\\n public com.didiglobal.booster.aapt2.Resources.Source getSource() {\\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a36ea722b120a3f66cad2109a9467e03\",\n \"score\": \"0.47725844\",\n \"text\": \"@java.lang.Override\\n public com.didiglobal.booster.aapt2.Resources.Source getSource() {\\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a36ea722b120a3f66cad2109a9467e03\",\n \"score\": \"0.47725844\",\n \"text\": \"@java.lang.Override\\n public com.didiglobal.booster.aapt2.Resources.Source getSource() {\\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a36ea722b120a3f66cad2109a9467e03\",\n \"score\": \"0.47725844\",\n \"text\": \"@java.lang.Override\\n public com.didiglobal.booster.aapt2.Resources.Source getSource() {\\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d8656a40c3b74a2602084bbc1f283d13\",\n \"score\": \"0.47705963\",\n \"text\": \"public Object getSource();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"582ab2328ac98af225b15c152bb5e072\",\n \"score\": \"0.4768596\",\n \"text\": \"public void setPlayer(Player player){\\n\\t\\tthis.player=player;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"95c0e90eaeddb0f0cbb59f254ed386d5\",\n \"score\": \"0.4767738\",\n \"text\": \"public Flag(Player player){\\n\\t\\tthis.player = player;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fc940eda7e0e1a10c6df832aeaeb0346\",\n \"score\": \"0.47654307\",\n \"text\": \"public Player getPlayer() {\\n\\t\\tif (senderIsPlayer())\\n\\t\\t\\treturn (Player) _sender;\\n\\t\\treturn null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e9dcc9551309827590ee7d408aa2da19\",\n \"score\": \"0.47617757\",\n \"text\": \"public boolean senderIsPlayer() {\\n\\t\\treturn _sender instanceof Player;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9b9730ad0038e9c4ebdf2f8d26eee86b\",\n \"score\": \"0.47609058\",\n \"text\": \"public void setPlayer(Player p)\\r\\n\\t{\\r\\n\\t\\tthis.player = p;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80f07239427ad71c4e172e8fff4225d0\",\n \"score\": \"0.47553337\",\n \"text\": \"@java.lang.Override\\n public com.didiglobal.booster.aapt2.Resources.Source getSource() {\\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80f07239427ad71c4e172e8fff4225d0\",\n \"score\": \"0.47553337\",\n \"text\": \"@java.lang.Override\\n public com.didiglobal.booster.aapt2.Resources.Source getSource() {\\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80f07239427ad71c4e172e8fff4225d0\",\n \"score\": \"0.47551456\",\n \"text\": \"@java.lang.Override\\n public com.didiglobal.booster.aapt2.Resources.Source getSource() {\\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d6b0a62cb3c2154e9c2cfaa2e55e120a\",\n \"score\": \"0.47547832\",\n \"text\": \"public Player getPlayerToTradeWith() { return playerTo; }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80f07239427ad71c4e172e8fff4225d0\",\n \"score\": \"0.47544962\",\n \"text\": \"@java.lang.Override\\n public com.didiglobal.booster.aapt2.Resources.Source getSource() {\\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80f07239427ad71c4e172e8fff4225d0\",\n \"score\": \"0.47544962\",\n \"text\": \"@java.lang.Override\\n public com.didiglobal.booster.aapt2.Resources.Source getSource() {\\n return source_ == null ? com.didiglobal.booster.aapt2.Resources.Source.getDefaultInstance() : source_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7119d13c41331a8d16aff1e075105de5\",\n \"score\": \"0.4741826\",\n \"text\": \"public boolean attackEntityFrom(DamageSource source, float amount)\\r\\n {\\r\\n if(isInvulnerable()) return false;\\r\\n else if(this.world.isRemote) return false;\\r\\n else if(source == DamageSource.OUT_OF_WORLD)\\r\\n {\\r\\n if(!this.isAlive()) return false;\\r\\n onDeath(source);\\r\\n setDead();\\r\\n return true;\\r\\n }\\r\\n \\r\\n return false;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"726c8fd8a5a91b69f4f5fcb203344a6a\",\n \"score\": \"0.47414127\",\n \"text\": \"public int getSource(){\\r\\n\\t\\treturn this.source;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5d688e765b72d8087a3709727d27dad3\",\n \"score\": \"0.47385874\",\n \"text\": \"public void setPlayerId(String s) {\\n\\t\\tplayerId = s;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dbcc1fa5b03a8ebda2a0b2d5f7e4000a\",\n \"score\": \"0.47373053\",\n \"text\": \"public Player getOwner() {\\n return this.owner;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"20e834ef28947ff59b27b7c6be2dd8d5\",\n \"score\": \"0.47354478\",\n \"text\": \"public Player(String name){\\n this.name = name;\\n id = numPlayer;\\n numPlayer++;\\n totalUnits = 0;\\n availableUnits = 0;\\n countriesOwned = new ArrayList<Country>();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f8b61515d0c3060feb605b490f3d8bd8\",\n \"score\": \"0.4733339\",\n \"text\": \"public void setSource(String source);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ca8b1d6e3aa2b68dd716299f1b9e1f1c\",\n \"score\": \"0.4718883\",\n \"text\": \"public UUID getPlayer() { return player; }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ff13b3fff7c6fb60cc74972200694709\",\n \"score\": \"0.47173813\",\n \"text\": \"public String getSource() {\\n return source;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ff6a45fec4fa9480aff9f469664516eb\",\n \"score\": \"0.4717113\",\n \"text\": \"public MemberModel getSource() {\\r\\n\\t\\treturn source;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ad42796f3628eb5501798be03c2ad15f\",\n \"score\": \"0.47166085\",\n \"text\": \"public short getSource() {\\n return source;\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":985392,"cells":{"query_id":{"kind":"string","value":"9e34f523e87f3a717aedebd765aa5055"},"query":{"kind":"string","value":"Declarar variables numerico y texto"},"positive_passages":{"kind":"list like","value":[{"docid":"d14db76085c91d95cda948897f1a02b7","score":"0.0","text":"public static void main(String[]args){\n int edad; // Declarando\r\n edad=25; // asignando e inicializando\r\n char genero ='F';\r\n String nombre = \"Mireya\";\r\n boolean estadocivil = false;\r\n estadocivil = false;\r\n boolean estudia = true;\r\n estudia= true;\r\n char talla = 'M';\r\n String estudios = \"Desarrollo de software\";\r\n System.out.println(\"Hola, soy \"+nombre+\" , mi edad es:\"+edad+\"años ,mi genero es: \"+genero+\", Estoy casada?: \"+estadocivil+\" ,Estoy estudiando?: \"+ estudia+\" ,Que estudio?: \"+ estudios\" \" );\r\n \r\n \r\n \r\n \r\n }","title":""}],"string":"[\n {\n \"docid\": \"d14db76085c91d95cda948897f1a02b7\",\n \"score\": \"0.0\",\n \"text\": \"public static void main(String[]args){\\n int edad; // Declarando\\r\\n edad=25; // asignando e inicializando\\r\\n char genero ='F';\\r\\n String nombre = \\\"Mireya\\\";\\r\\n boolean estadocivil = false;\\r\\n estadocivil = false;\\r\\n boolean estudia = true;\\r\\n estudia= true;\\r\\n char talla = 'M';\\r\\n String estudios = \\\"Desarrollo de software\\\";\\r\\n System.out.println(\\\"Hola, soy \\\"+nombre+\\\" , mi edad es:\\\"+edad+\\\"años ,mi genero es: \\\"+genero+\\\", Estoy casada?: \\\"+estadocivil+\\\" ,Estoy estudiando?: \\\"+ estudia+\\\" ,Que estudio?: \\\"+ estudios\\\" \\\" );\\r\\n \\r\\n \\r\\n \\r\\n \\r\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"40152ab5a6dac79b7d2c1185206cc2c5","score":"0.65372276","text":"public void creaArmas(){\n tipo = \"Baston de Aire\";\n precio = 120;\n atk = 33;\n descripcion = \"Un baston de aire, es magnifico. Daño 33, Precio 120.\";\n}","title":""},{"docid":"802d858c8010309cbe6cbe912566ee67","score":"0.6450767","text":"numero() {\n sinal = 1;\n tamanho = 0;\n }","title":""},{"docid":"3d17420fc53347b24d0ce2a2ae7cd66a","score":"0.6273059","text":"private void parametres()\n\t{\n\t\tint choix;\n\t\tsc = new Scanner(System.in);\n\t\tSystem.out.println(titrePara);\n\t\tdo\n\t\t{\n\t\t\tSystem.out.printf(textPara, parametres.getTaille(), parametres.getProbaBombe(), 37, parametres.getTriche());\n\t\t\tchoix = sc.nextInt();\n\t\t\tswitch(choix)\n\t\t\t{\n\t\t\t\tcase 1:\n\t\t\t\t\tModifTaille();\n\t\t\t\t\tbreak;\n\t\t\t\tcase 2:\n\t\t\t\t\tModifPourcentage();\n\t\t\t\t\tbreak;\n\t\t\t\tcase 3:\n\t\t\t\t\tModifTriche();\n\t\t\t\t\tbreak;\n\t\t\t\tcase -1:\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tSystem.out.println(erreur + choixInv);\n\t\t\t}\n\t\t}while(choix != -1);\n\t}","title":""},{"docid":"0fcd887a947dc837693dfad2fca9e941","score":"0.6262275","text":"void profesor(String carlos) {\r\n\t\tint edad = 31;\r\n\t\tString nombre = carlos;\r\n\t\tString quimica = carlos; \r\n\t\t\r\n\t}","title":""},{"docid":"00d3cd08513ee1bf85329d5215941f6f","score":"0.6217642","text":"private void limpiarVariables() {\n jTextFieldTelefonoClienteBuscado.setText(\"\");\n \n jTextFieldApellidoyNombre.setText(\"\");\n \n jTextField1ApellidoCliente.setText(\"\");\n \n jTextFieldDomicilio.setText(\"\");\n \n jTextFieldLugardeEnvio.setText(\"\");\n \n jTextField1Zona.setText(\"\");\n \n jTextField1ImporteZOna.setText(\"\");\n \n }","title":""},{"docid":"9366c42c6f9dee591f42a57f5ad84b69","score":"0.6146736","text":"public void exibirdados(){\n System.out.println(\"A marca do carro é: \" + marca);\n System.out.println(\"O modelo do carro é: \" + modelo);\n }","title":""},{"docid":"e258824276034b1509705a7a0ddd3cb3","score":"0.5992349","text":"public void creaAtuendo(){\n tipo = \"Armadura de marfil\";\n precio = 200;\n def = 40;\n atk = 0;\n eva = 20;\n descripcion = \"Armadura hecha de marfil.\";\n\n }","title":""},{"docid":"66c10d8bdbf29c441fa57b386104007d","score":"0.5923365","text":"public Numero() { this.valor = practica001.Constante.Valores.Zero; }","title":""},{"docid":"241531c0a2e460a32686d51ade681f6c","score":"0.59103847","text":"public void insiraMes(){ System.out.println(\"Insira mês (1-12) | 0->Sair:\"); }","title":""},{"docid":"07b4f3dbe4d59fe2b65c844af393811f","score":"0.5840753","text":"void printNumer() {\n Numer model = (Numer) this.objectToSee.get(object);\n Czasopismo czasopismo = model.getCzasopismo();\n this.setTextLabels(\"Id numeru: \" + model.getId(), \"Nazwa czasopisma: \" + czasopismo.getName(), \"Numer: \" + Integer.toString(model.getNumber()), \"Spis treści jest na stronie: \" + Integer.toString(model.getContent_table()));\n }","title":""},{"docid":"78d96797c4e3f2dc227b185633fd0d10","score":"0.5762646","text":"Nomi(String titolo) {\n try { // prova ad eseguire il codice\n /* regola le variabili di istanza coi parametri */\n this.setTitolo(titolo);\n } catch (Exception unErrore) { // intercetta l'errore\n Errore.crea(unErrore);\n }// fine del blocco try-catch\n }","title":""},{"docid":"bc16556bdd0f099ee40e4b203890a519","score":"0.57589626","text":"private void limpiarValores() {\n \t\tanio = \"\";\n \t\tmes = \"\";\n \t\tnumtrabajadores = \"\";\n \t\tsucursal = \"\";\n \t\theadcount = \"\";\n \t\tpromedio = \"\";\n \t\treuniones = \"\";\n \t\tcumplimiento = \"\";\n \t\tzuno = \"\";\n \t\tzdos = \"\";\n \t\tvalidarOperacion = 0;\n\t}","title":""},{"docid":"bb17f352e5c210f04ee97ccf170ecb1f","score":"0.5742898","text":"public void mostrarTareasNumeradas()\n {\n //bucle se hace tantas veces como tareas haya.\n int numeroPosicion = 1;\n for(String tarea : tareas)\n {\n System.out.println(numeroPosicion + \".\" + tarea);\n numeroPosicion = numeroPosicion +1;\n }\n }","title":""},{"docid":"2410806186b7342102e1ccba4eaceba3","score":"0.57336926","text":"private void diziString() {\n\t\tString[] isimler = {null,null};\r\n\t\tisimler[0] = \"Murat\";\r\n\t\tisimler[1] = \"Gureken\";\r\n\t}","title":""},{"docid":"7065cd06d9c1d4eb7d488236f527aceb","score":"0.57030606","text":"@Override\n\tpublic String mostraInfo() {\n\t\treturn \"cor: \" + this.cor + \", valor: \" + this.valor + \", ano: \" + this.ano;\n\t}","title":""},{"docid":"0fcfd37c1ab8e7cd512aba8ffe2ec260","score":"0.56928086","text":"public static void main(String[] args){\n\n\n //Aula 6\n int edades=10;\n double salarioDouble=3000;\n float salarioFloat=3000;\n byte edadByte=12;\n short edadShort=32767;\n boolean verdadero=true;\n boolean falso=false;\n long numeroGrande=1000L;\n char caracter='\\u0041'; //2 bytes\n int x =10;\n //int edadDosPiasParaRegistro=10;\n //System.out.println(\"La edad es: \"+edadDosPiasParaRegistro);\n String nombre=\"Gabrielito\";\n System.out.println(caracter);\n }","title":""},{"docid":"e786f3fe8231afcee3ff93288247f569","score":"0.5687756","text":"private void mostrarValores() {\n\n howTo.setText(realizacion);\n titulo.setText(nombre_ejercicio);\n materiales.setText(material);\n zona.setText(zona_trabajada);\n }","title":""},{"docid":"6673906a3dea985a59297bc3dd4a3268","score":"0.56868976","text":"private void resultadoDados() {\r\n String dadoUno = Integer.toString(dado1);\r\n String dadoDos = Integer.toString(dado2);\r\n String dadoTres = Integer.toString(dado3);\r\n String puntos = Integer.toString(puntaje);\r\n etiquetaResultado.setText(\"Dado 1: \" + dadoUno + \" Dado 2: \" + dadoDos + \" Dado 3: \" + dadoTres + \"Total: \" + puntos);\r\n etiquetaResultado.setFont(fuenteTexto);\r\n }","title":""},{"docid":"ed86e12c301053ad651476ff59ca3253","score":"0.5668591","text":"public static void main(String [] args) {\r\n byte numeroChiquito = 127; //DATO DE NUMERICO PEQUEÑO\r\n int numeroEntero = 54698; // DATO DE NUMERICO MEDIANO \r\n long numerosGrandes = 545468545; // DATO DE NUMERICO GRANDE \r\n \r\n short numeroDecimal = 3285;\r\n double numeroDecimalGrande = 365489;\r\n float numeroDecimalGrande2 = 476546654F;\r\n \r\n \r\n char unLetra = ´a´;\r\n String muchasLetras = \"cadena de texto\";\r\n \r\n boolean docisiones = true; \r\n \r\n \r\n System.out.print(numeroChiquito);\r\n \r\n System.out.print(numeroEntero);\r\n \r\n /**************************************************************\r\n *LA LINEA DE CODIGO System.out.println(); ME PERMITE MOSTRAR\r\n *EN LA CONSOLA EL DATO QUE SE COLOQUE O VARIABLE QUE SE \r\n *COLOQUE DENTRO DE LOS PARENTESIS Y REALIZA UN SALTO DE LINEA\r\n ***************************************************************/","title":""},{"docid":"1a94c3eedf1826b2f7285b0d83c790d5","score":"0.56670743","text":"private void addFields() {\n\t\tposition = new DecimalField(\"Position (Z): \", \"m\");\n\t\tadd(position);\n\n\t\tepaisseur = new DecimalField(\"Epaisseur : \", \"m\");\n\t\tadd(epaisseur);\n\t}","title":""},{"docid":"c9f324fa6ca6ad253d56937c60cafe5c","score":"0.5662335","text":"void setNumDossier(String text) {\n jtfNumDossier.setText(text); //To change body of generated methods, choose Tools | Templates.\n }","title":""},{"docid":"5b668d16d8c9f49a5ab3c179b1d37f64","score":"0.56437665","text":"void datos (Bicycle p) {\n Pizarra x = new Pizarra(); \n Dialog d = new Dialog();\n String v;\n int numero;\n \n x.setVisible(true);\ndo v = d.readString (\"Ingrese la cantidad de Piñones:\");\n while (!isNum(v));\n numero=Integer.parseInt(v);\n p.setPiñon(numero);\n \n \n do v = d.readString (\"Ingrese la cantidad de rodadas hechas:\");\n while (!isNum(v)); \n numero=Integer.parseInt(v);\n p.setRodada(numero);\n \n \n do v = d.readString (\"Ingrese la velocidad:\");\n while (!isNum(v)); \n numero=Integer.parseInt(v);\n p.setVelocidad(numero);\n \n}","title":""},{"docid":"4e665b80347467caa4741a823e7eafcf","score":"0.56412375","text":"private Variable() {\n this.id = -1;\n\n this.name = Constants.PREFIX_TEMPORALID + (temporals++);\n this.sort = VariableSort.TEMPORAL;\n }","title":""},{"docid":"029d6704d51ee9a1eb1642161cd0a64b","score":"0.56208897","text":"public String getValoreNum(Node n, int posizione) {\n\n\t\tString res = null;\n\t\tswitch (getElementType(n)) {\n\t\tcase LIBRO:\n\t\t\tres = \"Libro \" + this.getRoman(posizione);\n\t\t\tbreak;\n\t\tcase PARTE:\n\t\t\tres = \"Parte \" + this.getRoman(posizione);\n\t\t\tbreak;\n\t\tcase TITOLO:\n\t\t\tres = \"Titolo \" + this.getRoman(posizione);\n\t\t\tbreak;\n\t\tcase CAPO:\n\t\t\tres = \"Capo \" + this.getRoman(posizione);\n\t\t\tbreak;\n\t\tcase SEZIONE:\n\t\t\tres = \"Sezione \" + this.getRoman(posizione);\n\t\t\tbreak;\n\t\tcase ARTICOLO:\n\t\t\tres = \"Art. \" + posizione;\n\t\t\tbreak;\n\t\tcase COMMA:\n\t\t\tres = posizione + \".\";\n\t\t\tbreak;\n\t\tcase LETTERA:\n\t\t\tres = posizione + \")\";\n\t\t\t//res = UtilLang.fromNumberToLetter(\"\" + posizione) + \")\";\n\t\t\tbreak;\n\t\tcase NUMERO:\n\t\t\tres = posizione + \")\";\n\t\t\tbreak;\n\t\tcase ELENCO_PUNT:\n\t\t\t//res = (n.getNodeValue()!=null) ? n.getNodeValue() : \"-\";\n\t\t\tres = \"-\";\n\t\t\tbreak;\t\n\t\tdefault:\n\t\t\tres = \"\";\n\t\t\tbreak;\n\t\t}\n\n\t\treturn res;\n\t}","title":""},{"docid":"1ae1f50454f96a9da473f58738d5068f","score":"0.5582969","text":"@Override public void informacion(){\n String s = \"Tipo de Carroceria: \" + tipo() + \"\\n\" +\n \"Costo: \" + costo() + \"\\n\" +\n \"Velocidad: \" + velocidad() + \"\\n\" +\n \"Defensa: \" + defensa() + \"\\n\" +\n \"Ataque: \" + ataque() + \"\\n\";\n\n System.out.println(s);\n }","title":""},{"docid":"c4bdcbb0eccf328351f7cb31f4c30ee7","score":"0.55739474","text":"private void calcVar(Text text) {\n double characters = text.characters;\n double words = text.words;\n double sentences = text.sentences;\n\n L = characters / words * 100.0;\n S = sentences / words * 100.0;\n }","title":""},{"docid":"04cda2e10f303a3f15637f12920912fa","score":"0.55617464","text":"String getNumeral();","title":""},{"docid":"eca47383c406738295c88dcbc6eef07d","score":"0.55598855","text":"private void czyscPolaTekstowe(int typ){\n numerFilii.setText(\"\"); //upewnij sie ze nazwy list sa ok numery i normalizacja nazw\r\n numerFilii3.setText(\"\");\r\n maxLiczbaRegalow.setText(\"\");\r\n pojemnosc_regalu.setText(\"\");\r\n numerRegalu.setText(\"\");\r\n numerRegalu3.setText(\"\");\r\n numer_ISBN.setText(\"\");\r\n tytul.setText(\"\");\r\n daneUzytkownika.setText(\"\");\r\n numerUzytkownika.setText(\"\");\r\n iloscFilii.setText(\"\");\r\n iloscKsiazek.setText(\"\");\r\n iloscRegalow.setText(\"\");\r\n iloscUzytkownikow.setText(\"\");\r\n pojemnoscRegalu3.setText(\"\");\r\n numerFilii2 =\"\";\r\n numerRegalu2=\"\";\r\n numerUzytkownika2 = \"\";\r\n numerKatalogowy2=\"\";\r\n if(typ==1) {\r\n numerFilii4 = \"\";\r\n numerRegalu4 = \"\";\r\n numerKatalogowy4 = \"\";\r\n numerUzytkownika4 = \"\";\r\n }\r\n }","title":""},{"docid":"0ddc45bdfdfa892f12737d1406b0395a","score":"0.5553927","text":"public void testiArvotOluelle() {\r\n\t\tnimi = \"Karhu III\";\r\n\t\tpanimo = \"Sinebrychoff\";\r\n\t\ttyyli = \"Vaalea Lager\";\r\n\t\talc = 4.7;\r\n\t\tebu = 12;\r\n\t\tmaa = \"Suomi\";\r\n\t}","title":""},{"docid":"2bfb024c3cf2182f4c5eaec13f8f3d0e","score":"0.5549371","text":"public String toString()\r\n\t{\r\n\t\treturn (\"\\nLe Cylindre ayant pour hauteur: \"+\r\n\t(int)getHauteur()+\r\n\t\" pour rayon: \"+\r\n\t(int)getRayon()+UNITE+\r\n\t\", nommé \"+\r\n\tidentifiant+\r\n\t\" possède :\\nUne surface de: \"+\r\n\t(int)calculSurface()+UNITE+\"2\"+\r\n\t\"\\nUn volume de :\"+\r\n\t(int)calculVolume()+UNITE+\"3\");\r\n\t}","title":""},{"docid":"2281f5cb983378ad680dd6aa6ce925a3","score":"0.5518014","text":"@Override\n public String toString() {\n return\n \"marca='\" + marca + '\\'' +\n \", modelo='\" + modelo + '\\'' +\n \", precio=\" + precio;\n }","title":""},{"docid":"fabc1cd62fcbba00feec95f533abf57e","score":"0.55127496","text":"private void inicializarComponentes(){\n etiquetaTitulo = new JLabel(titulo);\n etiquetaTipo = new JLabel(tipo);\n etiquetaMonto = new JLabel('$'+monto);\n etiquetaReferencia = new JLabel(referencia);\n etiquetaLetra = new JLabel(String.valueOf(titulo.charAt(0)));\n \n etiquetaLetra.setBounds(0, 0, 50, 50);\n etiquetaTitulo.setBounds(50,0,100,20);\n etiquetaTipo.setBounds(50,20,150,20);\n etiquetaMonto.setBounds(200,0,100,20);\n etiquetaReferencia.setBounds(50,40, 100, 20);\n \n etiquetaLetra.setForeground(Color.GRAY);\n etiquetaTipo.setForeground(Color.GRAY);\n etiquetaLetra.setFont(new Font(\"Calibri\", 3, 50));\n }","title":""},{"docid":"4c2c05d01e865acaecf2c6fe3e779a04","score":"0.55017364","text":"private void constructTexts() {\n int TEXT_LENGTH = 5;\n textField1 = new JTextField(TEXT_LENGTH);\n textField2 = new JTextField(TEXT_LENGTH);\n textField3 = new JTextField(TEXT_LENGTH);\n textField4 = new JTextField(TEXT_LENGTH);\n textField5 = new JTextField(TEXT_LENGTH);\n textField6 = new JTextField(TEXT_LENGTH);\n textField7 = new JTextField(TEXT_LENGTH);\n textField8 = new JTextField(12); // people can make a lot of money!\n }","title":""},{"docid":"9abe5146cd27aa04fcefe19191b0a757","score":"0.549542","text":"public String impresion(){\r\n\t\treturn \"ISSN - \" + this.grupoUno+\r\n\t\t\t\t\" - \" + this.grupoDos + this.digitoControl;\r\n\t}","title":""},{"docid":"4813ce765f1433f696d3349f8afcd1d1","score":"0.5493455","text":"public void Pmenu_tradctor(){\r\n System.out.println(\"Has ingresado a traductor\");\r\n System.out.println(\"Escoge una opcion marcando el numero que le antecede\");\r\n System.out.println(\"1. K'iche - Espanol\");\r\n System.out.println(\"2. Espanol - K'iche\");\r\n System.out.println(\"3. Cerrar Traductor\\n\\n\");\r\n}","title":""},{"docid":"4dbab55d0785ffd79423e8c76e6762dc","score":"0.5492066","text":"public void mostrarDatos(){\n \tSystem.out.println(\"ISBN: \"+this.isbn);\n \tSystem.out.println(\"Autor: \"+this.autor);\n \tSystem.out.println(\"Titulo: \"+this.titulo);\n \tSystem.out.println(\"Numero de paginas: \"+this.numPaginas);\n\n \n}","title":""},{"docid":"0636133fddee7e14d9ba10fed1e70482","score":"0.54872626","text":"@Override\n public String toString()\n {\n\n return (\"[\"+this.variableText+\":\"+this.variableClass+\"] \");\n }","title":""},{"docid":"e6200e46d2d43e8f82d96216dde935a1","score":"0.5481233","text":"public String textoAyuda();","title":""},{"docid":"1a2da9f23cf33cd4af221b75dc4856b1","score":"0.5480076","text":"public String informacioPersonal(){\n\t\treturn(\"| El nom del tripulant d'aquest vehicle: \"+this.nom+\"\\n\"+\n\t\t\t\t\"| Data neixement: \"+this.dataNaixement.getDia()+\"/\"+this.dataNaixement.getMes()+\"/\"+this.dataNaixement.getAny()+\"\\n\"+\n\t\t\t\t\"| Codi del tripulant\"+this.NIF\n\t\t\t\t);\t\t\t\n\t}","title":""},{"docid":"065c063649322d9ee11d5a1298c3addf","score":"0.5479338","text":"public String dime_datosGenerales() {\n\t\treturn \"La plataforma del vehÝculo tiene \" + ruedas + \" ruedas \"\r\n\t\t\t\t+ \".Mide \" + largo / 1000 + \" metros con un ancho de \" + ancho\r\n\t\t\t\t+ \" centÝmetros\" + \",y un peso de plataforma de \"\r\n\t\t\t\t+ peso_plataforma + \" kg\";\r\n\t}","title":""},{"docid":"be9fee8e5ec6496e90a030094735501e","score":"0.547523","text":"void InitVariables()\n {\n\n String t1 = String.valueOf(((EditText)findViewById(R.id.etXi)).getText());\n tmp1 = t1.trim().split(\"\\n\");\n String t2 = String.valueOf(((EditText)findViewById(R.id.etFi)).getText());\n tmp2 = t2.trim().split(\"\\n\");\n\n Xi = new double[tmp1.length];\n Fi = new double[tmp2.length];\n XiFi = new double[tmp2.length];\n XiDev = new double[tmp2.length];\n FiDev = new double[tmp2.length];\n XiMDev = new double[tmp2.length];\n FiMDev = new double[tmp2.length];\n CF = new double[tmp2.length];\n sum = sum2 = sum3 = N = 0;\n }","title":""},{"docid":"b850b78dbd6ce96ba00191e6be0864b4","score":"0.5473454","text":"public String getTextoNombre();","title":""},{"docid":"3c2ffb49a80d59552240e9337a824531","score":"0.5472358","text":"private void setTextViews()\n {\n mathProblem.createPlayerNum();\n mathProblem.createMonsterNum();\n\n textCharacterName.setText(playerType);\n textMonsterName.setText(monster.setMonster());\n textMonsterNum.setText(Integer.toString(mathProblem.monsterNum));\n textPlayerNum.setText(Integer.toString(mathProblem.playerNum));\n textPlayerHealth.setText(Integer.toString(player.setHealth()));\n textMonsterHealth.setText(Integer.toString(monster.setHealth()));\n\n Log.d(\"character\", textMonsterNum.getText().toString());\n if(playerType == \"addition\")\n {\n textMathSymbol.setText(\"+\");\n }\n else if(playerType == \"subtraction\")\n {\n textMathSymbol.setText(\"-\");\n }\n else if(playerType == \"multiplication\")\n {\n textMathSymbol.setText(\"x\");\n }\n else textMathSymbol.setText(\"/\");\n }","title":""},{"docid":"9638c591629f6fe86cc4f31073198481","score":"0.5467259","text":"private void limpiarCampos() {\n try {\n txtID.setText(String.valueOf(LogicaServicio.conseguirID()));\n } catch (Exception ex) {\n System.out.println(ex.getMessage());\n }\n txtNombre.setText(\"\");\n txtNombre.setBackground(Color.white);\n txtPrecio.setText(\"\");\n txtPrecio.setBackground(Color.white);\n txtDniDoctor.setText(\"\");\n labFoto.setIcon(null);\n labFoto.setText(\"\");\n }","title":""},{"docid":"86a53d138d911558389a05702b3f5e03","score":"0.54593295","text":"private String variableLabel(String name, String SEP){\n return SEP+name+\" min\"+SEP+name+\" max\"+SEP+name+\" av\"+SEP+name+\" av +/-\"+SEP+name+\" sigma\";\n }","title":""},{"docid":"7a722149eba91c144263185ac13a9cac","score":"0.54569703","text":"private void setCount() {\n int importCnt = 300;\n int exportCnt = 341;\n\n importTv.setText(importCnt + \"건의 입고\");\n exportTv.setText(exportCnt + \"건의 출고\");\n }","title":""},{"docid":"0a5d6eed6031815537b001f3dbce8068","score":"0.54473835","text":"public static void main (String[] args){\n /*int i; //declarei variável mas não o valor\n int j = 10; // declarei a variavel e o valor\n i = 10; // agora declarei o valor de i\n j = 11; // alterei o valor de j\n\n double d = i; // um inteiro cabe dentro de um ponto flutuante\n System.out.println(\"d = \" + d);\n\n d = 1.56;\n int x = (int) d;\n\n System.out.println(\"x = \" + x);\n\n System.out.println(foraDoEscopo);\n\n char c = 'p';\n\n System.out.println(c);\n float f = 1f;\n\n System.out.println(\"f = \" + f);\n\n f = f/3;\n f = f*3;\n\n System.out.println(\"f = \" + f);\n\n final int constante = 10;\n //constante = 11; não pode acontecer\n\n Sexo meuSexo = Sexo.MASCULINO;\n\n System.out.println(\"meuSexo = \" + meuSexo);\n\n int valor = 99;\n System.out.println(valor++); //imprime 99\n System.out.println(--valor); //imprime 99\n\n valor = - valor; //inverte o sinal\n System.out.println(\"valor = \" + valor);\n\n System.out.println(!!true);\n\n double soma = 10 + 10.99;\n System.out.println(\"soma = \" + soma);\n\n float div = 10/ 3f;\n System.out.println(\"div = \" + div);\n\n int num = 10;\n num +=10; //jao = jao + 10;\n System.out.println(\"num = \" + num);\n\n Scanner scanner = new Scanner(System.in); //Inputar texto\n\n String name = scanner.nextLine();\n int idade = scanner.nextInt();\n double peso = scanner.nextDouble();\n\n if (idade >= 18) {\n System.out.println(name+ \" Pode beber corote.\");\n } else {\n System.out.println(name + \" só bebe leite!\");\n }\n\n System.out.println(idade >=18 ? name + \" Pode beber coroto\" : name + \"só bebe leite!\");*/\n\n Scanner scanner = new Scanner(System.in);\n int value = scanner.nextInt();\n int otherValue = 0;\n\n switch (value) {\n case 1:\n otherValue =1;\n break;\n case 2:\n otherValue =2;\n break;\n case 3:\n otherValue =3;\n break;\n case 4:\n otherValue =4;\n break;\n default:\n otherValue = -1;\n }\n\n System.out.println(\"otherValue = \" + otherValue );\n }","title":""},{"docid":"55f9649b5a1195e9b4b76d5d2c32e42d","score":"0.5440358","text":"public String tallennusString() {\r\n try {\r\n return super.tallennusString() + variString() + EROTIN;\r\n }\r\n catch(Exception e) {\r\n return VIRHE;\r\n }\r\n }","title":""},{"docid":"fea366ae6945fb197997a33af4863de5","score":"0.5440099","text":"private void setupFields() {\n maxIteration = getResources().getInteger(R.integer.main_integer_maxGreet);\n greetPrefix = getString(R.string.rb_main_mr);\n }","title":""},{"docid":"d20676d3a5fe870f4a57ce32beca82db","score":"0.5439299","text":"public String decrisToi(){\r\n\t return \"\\t\"+this.nomVille+\" est une ville de \"+this.nomPays+ \", elle comporte : \"+this.nbreHabitants+\" habitant(s) => elle est donc de cat�gorie : \"+this.categorie;\r\n\t }","title":""},{"docid":"d3de7022cd368be0b91864a38e934fbc","score":"0.5434456","text":"public String visualizar() {\n\t\tString Dato=\"\"; \n\t\tnodo aux=cabeza; \n //verifica si esta vacia, o no, para regresar un mensaje\n if(null==aux){Dato=\"--------\";}else{ \n\t\twhile (aux!=null)\n\t\t{ \n //hasta que encuentre null no va a parar y guardar los datos en esa variable \n\t\t\tDato=Dato+aux.han.getnum()+\"---\";\n\t\t\taux=aux.siguiente;\n\t\t}}\n\t\treturn(Dato);//regresa lo que tiene la variabel\n\t}","title":""},{"docid":"9af6bf38d48e24ef4fd150622f0df0d8","score":"0.54329854","text":"static public String getNumero()\r\n {\r\n return numero;\r\n }","title":""},{"docid":"0f255eec7e8214113b4f245f997fe4ff","score":"0.5427074","text":"private static void defineMaiores(String x, double y) {\n\n // Se o valor recebido for o maior encontrado, é armazenado\n if (y > maior) {\n maior = y;\n resultado = y + \"\\t\" + x;\n }\n // Se o valor recebido for igual ao maior, é concatenado ao resultado\n else if (y == maior) {\n resultado += \"\\n\" + y + \"\\t\" + x;\n }\n\n }","title":""},{"docid":"f0c59103975633c82274a3360b0306b2","score":"0.54236525","text":"public void setString()\n\t{\n\n\t\tTextView product = (TextView) findViewById(R.id.product);\n\t\tproduct.setText(this.productNaam);\n\t\tTextView prijs = (TextView) findViewById(R.id.prijs);\n\t\tprijs.setText(this.productPrijs);\n\t\tTextView totaalprijs = (TextView) findViewById(R.id.totaalprijs);\n\t\tint totaalprijsAantal = Integer.parseInt(this.productAantal);\n\t\tint totaalprijsPrijs = Integer.parseInt(\"7\");\n\t\ttotaalprijs.setText(\"€\" + (totaalprijsAantal * totaalprijsPrijs));\n\t\tEditText naamEditTekst = (EditText) findViewById( R.id.edit_naam);\n\t\tnaamEditTekst.setText(this.naam );\n\t\tEditText adresEditTekst = (EditText) findViewById( R.id.edit_adres );\n\t\tadresEditTekst.setText(this.adres );\n\t\tEditText telefoonEditTekst = (EditText) findViewById( R.id.edit_telefoon );\n\t\ttelefoonEditTekst.setText(this.telefoonnummer );\n\t\tEditText emailEditTekst = (EditText) findViewById( R.id.edit_email );\n\t\temailEditTekst.setText(this.email );\n\n\t}","title":""},{"docid":"bce8ee90e7aada9a558bf7e0ac9b29fd","score":"0.5423084","text":"public static void main(String[] args)\r\n {\n int x = 1;\r\n // [type] [invented-name];\r\n int y;\r\n\r\n char lett = 'A';\r\n String first_name = \"Danny\";\r\n String one_char = \"A\";\r\n String last_name = \"Cohen\";\r\n String number = \"5.5\";\r\n // int kaful2 = number * 2; //ERROR\r\n int x1 = 1;\r\n int kaful2 = x1 * 2;\r\n int sum2 = 1 + 1; // 2\r\n\r\n System.out.print(first_name);\r\n System.out.print(\" \");\r\n System.out.println(last_name);\r\n\r\n String sentence = \"Good \" + \"morning!\"; // \"Good morning!\" Concat\r\n\r\n System.out.println(\"Hello world!\");\r\n\r\n System.out.println(first_name + \" \" + last_name);\r\n\r\n String full_name = first_name + \" \" + last_name;\r\n System.out.println(full_name);\r\n\r\n }","title":""},{"docid":"09882f667db8b8d5423310c578c9730d","score":"0.54195285","text":"public void limpaCampos() {\n jTxt_codigo.setText(\"\");\n jFTxt_datacad.setText(\"\");\n jTxt_descricao.setText(\"\");\n jTxt_valor.setText(\"\");\n\n }","title":""},{"docid":"166dfd93d359f3783e77a626c8cbecf6","score":"0.5412699","text":"@Override\r\n\tpublic String infoEntrada() {\n\t\treturn super.infoEntrada() + \"\\nPrecio: \" + this.calcularPrecio();\r\n\t}","title":""},{"docid":"a79b78a5901a13a40a977bc424fba892","score":"0.54117215","text":"private void limparCampos() {\n\n tfaluno.setText(\"\");\n tfautor.setText(\"\");\n tfchegada.setText(\"\");\n tflivro.setText(\"\");\n tfmatricula.setText(\"\");\n tfreserva.setText(\"\");\n tfretorno.setText(\"\");\n tftombo.setText(\"\");\n }","title":""},{"docid":"473a3642fe612337ea4862830a8fcfbd","score":"0.54099923","text":"public String limpiarCargaLote()\r\n/* 960: */ {\r\n/* 961:1107 */ this.productoCargaArchivo = null;\r\n/* 962:1108 */ this.cantidadPesoLote = BigDecimal.ZERO;\r\n/* 963:1109 */ this.numeroLotes = Integer.valueOf(1);\r\n/* 964: */ \r\n/* 965:1111 */ return \"\";\r\n/* 966: */ }","title":""},{"docid":"70b1595c682cbb105e13394b92ed9013","score":"0.5409796","text":"public void getMenuMision() {\n\t\tSystem.out.println(\"\\nNombre: \" +nombre+ \" Aldea: \" +aldea+ \" Rango: \"+rango\n\t\t+\"\\nVida: \" +vida+\"/\"+vidamax+\" Oro: \"+oro+\" Nivel: \"+nivel\n\t\t+\"\\nExperiencia: \"+barraexp\n\t\t+\"\\nEnergia: \"+barraener\n\t\t+\"\\n\\n----------------MISIONES----------------\\n\"\n\t\t+\"|(1)Mision Tipo D (Ifnin) |\\n\"\n\t\t+\"|---------------------------------------|\\n\"\n\t\t+\"|(2)Mision Tipo C (Ifnin & Fornins) |\\n\"\n\t\t+\"|---------------------------------------|\\n\"\n\t\t+\"|(3)Mision Tipo B (Fornins) |\\n\"\n\t\t+\"|---------------------------------------|\\n\"\n\t\t+\"|(4)Mision Tipo A (Whilenins) |\\n\"\n\t\t+\"|---------------------------------------|\\n\"\n\t\t+\"|(5)Mision Tipo S (Whilenins & Kages) |\\n\"\n\t\t+\"|---------------------------------------|\\n\"\n\t\t+\"\\nElige numero de tu opcion: \");\n\t}","title":""},{"docid":"a6ab48f9b84a085d3b4151f3b79d10bb","score":"0.54024595","text":"public void cambiarDinero(int dinero){\n //Cambiar a string\n String cantidad= dinero+\"\";\n jLabelRupias.setText(\"Drabines: \"+cantidad+\"D\");\n }","title":""},{"docid":"162663dcbdc79f8d587079fcccc9a720","score":"0.539934","text":"protected String elaboraIncipitSpecifico() {\n String testo = VUOTA;\n\n testo += \"incipit lista cognomi\";\n testo += PIPE;\n testo += \"cognome=\";\n testo += cognome.cognome;\n testo = LibWiki.setGraffe(testo);\n\n return testo;\n }","title":""},{"docid":"d236c0befee4e7ca65d871460c164215","score":"0.5398787","text":"@Override\r\n\tpublic String NumCompte(String nom, String prenom, int id) {\n\t\tString lib1=nom.subSequence(0,3).toString();\r\n\t\tString lib2=prenom.subSequence(0,3).toString();\r\n\t\t\r\n\t\tString s1=\"CCP\";\r\n\t\tString s2=\"00000-\".concat(\"\"+id).concat(lib1).concat(lib2).concat(\"\"+nombreAleatoire);\r\n\t\tString s3=s1+s2;\r\n\t\treturn s3;\r\n\t\t\r\n\t\t\r\n\t\t\r\n\t}","title":""},{"docid":"3d087e149fb9522fede61da31a5c503b","score":"0.5394869","text":"void mostrar(){\n\t\t\n\t\tSystem.out.println(\"Nombre: \" + nombre);\n\t\tSystem.out.println(\"Apellidos: \" + apellidos);\n\t\tSystem.out.println(\"DNI: \" + dni);\n\t\t\n\t\t\n\t\t\n\t}","title":""},{"docid":"6063a30378cdbafc348ac4c70db312eb","score":"0.5394327","text":"public String getDatos(){\n return \"los datos son: \" + nombre + apellido + edad;\n }","title":""},{"docid":"66a13d164a884d1dfd2eb6c7c7ba971a","score":"0.53930974","text":"public void setTotalText(String zahlen) {\n\tif(counter !=0) {\n\t\tthis.totaltext += zahlen;\n\t view.ausgabe.setText(totaltext);\n\t}else {\n\t\tthis.totaltext = \"\";\n\t}\n\t\n \n}","title":""},{"docid":"2564d266d08d9b5456d14e9a01d65970","score":"0.53923774","text":"public void setNom(String n) { this.nom = n; }","title":""},{"docid":"c74d342db84ea3e1ebc8a2b17b4a0397","score":"0.5388792","text":"public void echo(){\n System.out.println(int_level2+String_delimitador+int_level1+String_delimitador+double_level0);\n }","title":""},{"docid":"43535801a4d487d01bc3d03dd0ddd5e2","score":"0.5387996","text":"public String getNombre() {\r\n return NOMBRE;\r\n }","title":""},{"docid":"10b5b5324b3272b11afbbde8aa966ddf","score":"0.5378781","text":"public String getTextura();","title":""},{"docid":"11e7f68172c8501284a98281301c9234","score":"0.5375293","text":"public AutoritaModulo() {\n /* regola la variabile di istanza con la costante */\n super.setNomeModulo(NOME_CHIAVE);\n\n /* regola il nome del programma (se questo modulo parte per primo) */\n super.setNomeProgramma(NOME_PROGRAMMA);\n }","title":""},{"docid":"2317c0138e215911f4ce6936b65c1896","score":"0.53739256","text":"public static void main(String[] args) {\n int a,b,c ; \n a=10;\n b=20;\n c=5;\n float d = 10.5f;\n double e = 20.12345678312312312321;\n\n int penjumlahan1 = a+b;\n int penjumlahan2 = penjumlahan1 + c;\n int penjumlahan3 = (int) d + (int) e;\n\n String penjelasan = \"Hasil dari 10.5 + 20.12 = \";\n\n System.out.println(\"Hasil dari (10+20) + 5 = \" + penjumlahan2);\n System.out.println(penjelasan + penjumlahan3);\n }","title":""},{"docid":"0c4dcfcdba08906cc68012ced0390d9e","score":"0.5357846","text":"@Override\r\n\tpublic void description() {\n\t\tSystem.out.println(\"Memiliki 3 perkerjaan seperti berkerja, melukis, dan berkendara\");\r\n\t}","title":""},{"docid":"3f22e9a130b1e22317d80a037eb2bbfc","score":"0.5356097","text":"private void pintarEspacioDisco() {\n jLabelEspacioTotal.setText(\"Espacio total : \" + gestion.getTotalSpaceGb() + \" GB.\");\n jLabelEspacioLibreTotal.setText(\"Espacio libre : \" + gestion.getFreeSpaceGb() + \" GB.\");\n }","title":""},{"docid":"ee2da3c4e24d729aaeccc247b1568b83","score":"0.5354251","text":"public String calcular(){\r\n nombre = index.getNombre();\r\n apellido = index.getApellido();\r\n diasT = index.getDiasT();\r\n sueldoB = index.getSueldoB();\r\n nivelE = 0;\r\n nivelEE = index.getNivelE();\r\n idiomas = index.getIdiomas().length;\r\n \r\n if(index.getNivelE().equals(\"primaria\")){\r\n nivelE = 0;\r\n }else if(index.getNivelE().equals(\"secundaria\")){\r\n nivelE= 0;\r\n }else if(index.getNivelE().equals(\"tecnico\")){\r\n nivelE= 5000;\r\n }else if(index.getNivelE().equals(\"tecnologo\")){\r\n nivelE= 15000;\r\n }else if(index.getNivelE().equals(\"profesional\")){\r\n nivelE= 30000;\r\n }else if(index.getNivelE().equals(\"magister\")){\r\n nivelE= 40000;\r\n }\r\n nomina =(sueldoB+(idiomas*10000)+nivelE)*diasT; \r\n return (\"/nomina\");\r\n }","title":""},{"docid":"6c3f096d1d93d2e7d307a2b9c3f6ebea","score":"0.5354152","text":"public String toString() {\n return nombre +\"\\t\\t\"+ numRegistro;\n }","title":""},{"docid":"30f53d922af7cf8814eb160e7078768b","score":"0.53533715","text":"@Override\n\tpublic void NopanHeitto() {\n\t\tString heitot=\"Nopista tuli \";\n\t\tint sum = 0;\n\t\tfor (int i=0;i<5;i++) {\n\t\t\tint luku=noppa.heitä();\n\t heitot=heitot+\",\"+luku;\n\t \tsum =sum+luku;\n\t\t}\n\t\theitot=heitot+\". Summa:\"+sum;\n\tint heittomaara=noppa.getHeittoMaara();\n\n\tnoppagui.setNoppa(heitot,heittomaara);\n\t\t\n\t}","title":""},{"docid":"47e2ce554760228fda578232e1ca2241","score":"0.53505003","text":"public String display(){\r\n return (this.Vin +\" \" +this.mfr + \" \" + this.color);\r\n }","title":""},{"docid":"07ae88a6cf64d268be56db9aac76a8d6","score":"0.5345896","text":"@Override\n\t\t\tpublic String getText() {\n\t\t\t\treturn \"Voglio tokenizzare questa stringa\";\n\t\t\t}","title":""},{"docid":"db1cd3c9a629558e52109560789c36dc","score":"0.53450257","text":"public String displayData(){\n return String.format(\"name = %s, price = %s, hasMotor = %s\", getName(), getPrice(), hasMotor);\n }","title":""},{"docid":"7e17b283544eb48b2503c7a59a4644d2","score":"0.5334675","text":"private void limpiarValores(){\n\t\tcedula = \"\";\n\t\tcoduser = \"\";\n\t\tcluser = \"\";\n\t\tmail = \"\";\n\t\tnbr = \"\";\n\t}","title":""},{"docid":"6fd8943540e217916dedb5b15d485767","score":"0.53290504","text":"String getValor();","title":""},{"docid":"e188cca452e98488123d4abf769de5c5","score":"0.53277576","text":"public void print()\n\t{\n\t\tSystem.out.print(\"Vous avez fait l'exercice \" + this.numeroExercice + \" d'une leçon \");\n\t\tif (this.typeLecon == 1)\n\t\t\tSystem.out.print(\"de grammaire\");\n\t\telse if (this.typeLecon == 2)\n\t\t\tSystem.out.print(\"de conjugaison\");\n\t\telse if (this.typeLecon == 3)\n\t\t\tSystem.out.print(\"d'orthographe\");\n\t\telse\n\t\t\tSystem.out.print(\"de vocabulaire\");\n\t\tSystem.out.print(\" dans la langue \");\n\t\tif (this.langue == 1)\n\t\t\tSystem.out.print(\"anglaise\");\n\t\telse if (this.langue == 2)\n\t\t\tSystem.out.print(\"Espagnol\");\n\t\telse if (this.langue == 3)\n\t\t\tSystem.out.print(\"Italienne\");\n\t\telse\n\t\t\tSystem.out.print(\"Allemande\");\n\t\tSystem.out.println(\".\");\n\t}","title":""},{"docid":"cc615ab8d6d6dbadd1ec9311abf2b267","score":"0.53273034","text":"public void nombreVehiculos(){ \n System.out.println(\"| VEHICULOS DEL JUGADOR:\");\n System.out.println(\"| 1. SU SKIN: \"+vehiculo1()+\" TIPO: \"+misVehiculos[0].tipoVehiculo()+\" NOMBRE: \"+misVehiculos[0].getNombreVehiculo());\n System.out.println(\"| 2. SU SKIN: \"+vehiculo2()+\" TIPO: \"+misVehiculos[1].tipoVehiculo()+\" NOMBRE: \"+misVehiculos[1].getNombreVehiculo());\n System.out.println(\"| 3. SU SKIN: \"+vehiculo3()+\" TIPO: \"+misVehiculos[2].tipoVehiculo()+\" NOMBRE: \"+misVehiculos[2].getNombreVehiculo());\n }","title":""},{"docid":"f7e6cc73a3b7f2613c82688c8e0d175c","score":"0.5320293","text":"public String darNumDerrotasOponente( )\n {\n return numDerrotasOponente;\n }","title":""},{"docid":"7c7d29951f0c63e8a8de542b4b7bba8e","score":"0.5320135","text":"public String getNumero()\r\n/* 186: */ {\r\n/* 187:212 */ return this.numero;\r\n/* 188: */ }","title":""},{"docid":"a5a66b3edb692eb3a9b37789dce75e9f","score":"0.5316289","text":"public static void main(String[] args)\n {\n // Label output with name and date:\n System.out.println(\"Gary Miller\\nLab #\\n\" + new Date() + \"\\n\");\n\n // Variable dictionary:\n String a = \"x1\";\n String b = a.substring(1,2);\n int c = Integer.parseInt(b);\n System.out.println(\"\" +c);\n\n }","title":""},{"docid":"85e81f84f2fd64910c3b201fe47a89e9","score":"0.5315935","text":"public void tampilurutankode() {\n form.getTxtNoSP().setText(model.autonumberstring());\n }","title":""},{"docid":"0c69726b8b432b2252d743a37e90c211","score":"0.53112644","text":"public String toString (){\n\t\tString descricao = \"Nota formada:\\n\";\n\t\t\n\t\tdescricao += \"\\tFreq = \" + this.getFrequencia() + \"\\n\";\n\t\t\n\t\tdescricao += \"\\tAmpli = \" + this.getAmplitude() + \"\\n\";\n\t\t\n\t\tdescricao += \"\\tDuracao = \" + this.getDuracao() + \"\\n\";\n\t\t\n\t\tdescricao += \"\\tInst. Inicial = \" + this.getInstanteInicial() + \"\\n\";\n\t\t\n\t\tdescricao += \"\\tInst. Final = \" + this.getInstanteFinal() + \"\\n\\n\";\n\t\t\n\t\treturn descricao;\n\t}","title":""},{"docid":"e3c2076c6fe2074331734c02c7e0a58e","score":"0.5308704","text":"protected void iniciarValores() {\n\t\ttextDni.setText(\"\");\n\t\ttextDireccion.setText(\"\");\n\t\ttextPrecio.setText(\"\");\n\t\ttextMetros.setText(\"\");\n\t\ttextBaños.setText(\"\");\n\t\ttextHabitaciones.setText(\"\");\n\t\ttextPlaza.setText(\"\");\n\t\ttextLocal.setText(\"\");\n\t\ttextPrecioAlquiler.setText(\"\");\n\t}","title":""},{"docid":"4b7d4fb392ac69a96c319faee4a19896","score":"0.5293473","text":"private void limpiarCampos () {\n \n txtAltura.setText(\"\");\n txtPeso.setText(\"\");\n txtHobbies.setText(\"\");\n txtAnio.setText(\"\");\n txtResultadoIMC.setText(\"\");\n txtResultadoEvaluacion.setText(\"\");\n txtNombre.setText(\"\");\n }","title":""},{"docid":"52d68368ce51030a45a052e7b085d031","score":"0.52929467","text":"public resa2() {\n initComponents();\n txthasil.setText(\"\");\nangka1=0.0;\nangka2=0.0;\njumlah=0.0;\nangka=\"\"; \n }","title":""},{"docid":"d348b855e3a3e59ebb86f5787ccce2e4","score":"0.5289993","text":"public NumberExpression(int n){\n text=Integer.toString(n);\n }","title":""},{"docid":"52f0d58767a85947e0485c752bff57e2","score":"0.52893543","text":"public String getTexto1(){\n return this.texto1;\n }","title":""},{"docid":"4e4023da3ad6238d8c697ebb429f7bee","score":"0.528699","text":"private static void inputVars() {\r\n\t\tSystem.out.println(\"Type number 1: \");\r\n\t\tnum1=scan.nextFloat();\r\n\t\tSystem.out.println(\"Type number 2: \");\r\n\t\tnum2=scan.nextFloat();\r\n\t}","title":""},{"docid":"b5e23f3a23e969731a2fb467a6cf32d3","score":"0.52848643","text":"private int showMenue()\r\n\t{\r\n\t\tSystem.out.println(\r\n\t\t\t\"\\n____________\\n\"\r\n\t\t\t+ \"|ADD (1)|\\n\"\r\n\t\t\t+ \"|DEL (2)|\\n\"\r\n\t\t\t+ \"|IMPORT (3)|\\n\"\r\n\t\t\t+ \"|SEARCH (4)|\\n\"\r\n\t\t\t+ \"|PLOT (5)|\\n\"\r\n\t\t\t+ \"|SAVE (6)|\\n\"\r\n\t\t\t+ \"|LOAD (7)|\\n\"\r\n\t\t\t+ \"|QUIT (8)|\\n\"\r\n\t\t\t+ \"¯¯¯¯¯¯¯¯¯¯¯¯\");\r\n\t\t\r\n\t\tint eingabe=0;\r\n\t\tdo{\r\n\t\t\tSystem.out.print(\"Eingabe: \");\r\n\t\t\t//Regx für Eingabe, überprüft ob eingabe Zahl ist. z.B. wenn ein Buchstabe eingegeben wird*/\r\n\t\t\tString varstring_regx=\"[1-8]\";\r\n\t\t\tString varstring_input = read.next();\r\n\t\t\tif(varstring_input.matches(varstring_regx))\r\n\t\t\t\teingabe=Integer.parseInt(varstring_input);\r\n\t\t\telse\r\n\t\t\t\tSystem.out.println(\"** Ungültige Eingabe! **\");\r\n\t\t}while(eingabe<1 || eingabe>9);\r\n\t\t\r\n\t\treturn eingabe;\r\n\t\t\r\n\t}","title":""},{"docid":"3bf445c984344a5025e5a42057a0fd7a","score":"0.5284193","text":"public void setNumero(String numero)\r\n/* 191: */ {\r\n/* 192:216 */ this.numero = numero;\r\n/* 193: */ }","title":""},{"docid":"1da181429e5f770f14e9892b78603602","score":"0.5282602","text":"private void set_initial_data(){\n\n try{\n\n value.setText(\"_\");\n systolic_value.setText(\"_\");\n diastolic_value.setText(\"_\");\n chol_total_value.setText(\"_\");\n ldl_value.setText(\"_\");\n hdl_value.setText(\"_\");\n\n }catch (Exception e){\n e.printStackTrace();\n }\n\n }","title":""},{"docid":"a0aa68ae1fe64d95291ef89a0fc2453f","score":"0.52824694","text":"public void almacenaNumeroPTB();","title":""},{"docid":"f60c89a9b022d8d8efdff32de6936341","score":"0.52784234","text":"public void setPrenom(String prenom);","title":""},{"docid":"9aecb2fdb747c17aa1ccd9d2b18eb83d","score":"0.5278211","text":"public void settings()\n\t{\n\t\tsize(1000, 500);\n\n\t\t// How to convert a character to a number\n\t\tchar c = '7'; // c holds the character 7 (55)\n\t\tint i = c - '0'; // i holds the number 7 (55 - 48) \n\t\tprintln(i);\n\t}","title":""}],"string":"[\n {\n \"docid\": \"40152ab5a6dac79b7d2c1185206cc2c5\",\n \"score\": \"0.65372276\",\n \"text\": \"public void creaArmas(){\\n tipo = \\\"Baston de Aire\\\";\\n precio = 120;\\n atk = 33;\\n descripcion = \\\"Un baston de aire, es magnifico. Daño 33, Precio 120.\\\";\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"802d858c8010309cbe6cbe912566ee67\",\n \"score\": \"0.6450767\",\n \"text\": \"numero() {\\n sinal = 1;\\n tamanho = 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3d17420fc53347b24d0ce2a2ae7cd66a\",\n \"score\": \"0.6273059\",\n \"text\": \"private void parametres()\\n\\t{\\n\\t\\tint choix;\\n\\t\\tsc = new Scanner(System.in);\\n\\t\\tSystem.out.println(titrePara);\\n\\t\\tdo\\n\\t\\t{\\n\\t\\t\\tSystem.out.printf(textPara, parametres.getTaille(), parametres.getProbaBombe(), 37, parametres.getTriche());\\n\\t\\t\\tchoix = sc.nextInt();\\n\\t\\t\\tswitch(choix)\\n\\t\\t\\t{\\n\\t\\t\\t\\tcase 1:\\n\\t\\t\\t\\t\\tModifTaille();\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tcase 2:\\n\\t\\t\\t\\t\\tModifPourcentage();\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tcase 3:\\n\\t\\t\\t\\t\\tModifTriche();\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tcase -1:\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tdefault:\\n\\t\\t\\t\\t\\tSystem.out.println(erreur + choixInv);\\n\\t\\t\\t}\\n\\t\\t}while(choix != -1);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0fcd887a947dc837693dfad2fca9e941\",\n \"score\": \"0.6262275\",\n \"text\": \"void profesor(String carlos) {\\r\\n\\t\\tint edad = 31;\\r\\n\\t\\tString nombre = carlos;\\r\\n\\t\\tString quimica = carlos; \\r\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"00d3cd08513ee1bf85329d5215941f6f\",\n \"score\": \"0.6217642\",\n \"text\": \"private void limpiarVariables() {\\n jTextFieldTelefonoClienteBuscado.setText(\\\"\\\");\\n \\n jTextFieldApellidoyNombre.setText(\\\"\\\");\\n \\n jTextField1ApellidoCliente.setText(\\\"\\\");\\n \\n jTextFieldDomicilio.setText(\\\"\\\");\\n \\n jTextFieldLugardeEnvio.setText(\\\"\\\");\\n \\n jTextField1Zona.setText(\\\"\\\");\\n \\n jTextField1ImporteZOna.setText(\\\"\\\");\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9366c42c6f9dee591f42a57f5ad84b69\",\n \"score\": \"0.6146736\",\n \"text\": \"public void exibirdados(){\\n System.out.println(\\\"A marca do carro é: \\\" + marca);\\n System.out.println(\\\"O modelo do carro é: \\\" + modelo);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e258824276034b1509705a7a0ddd3cb3\",\n \"score\": \"0.5992349\",\n \"text\": \"public void creaAtuendo(){\\n tipo = \\\"Armadura de marfil\\\";\\n precio = 200;\\n def = 40;\\n atk = 0;\\n eva = 20;\\n descripcion = \\\"Armadura hecha de marfil.\\\";\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"66c10d8bdbf29c441fa57b386104007d\",\n \"score\": \"0.5923365\",\n \"text\": \"public Numero() { this.valor = practica001.Constante.Valores.Zero; }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"241531c0a2e460a32686d51ade681f6c\",\n \"score\": \"0.59103847\",\n \"text\": \"public void insiraMes(){ System.out.println(\\\"Insira mês (1-12) | 0->Sair:\\\"); }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"07b4f3dbe4d59fe2b65c844af393811f\",\n \"score\": \"0.5840753\",\n \"text\": \"void printNumer() {\\n Numer model = (Numer) this.objectToSee.get(object);\\n Czasopismo czasopismo = model.getCzasopismo();\\n this.setTextLabels(\\\"Id numeru: \\\" + model.getId(), \\\"Nazwa czasopisma: \\\" + czasopismo.getName(), \\\"Numer: \\\" + Integer.toString(model.getNumber()), \\\"Spis treści jest na stronie: \\\" + Integer.toString(model.getContent_table()));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"78d96797c4e3f2dc227b185633fd0d10\",\n \"score\": \"0.5762646\",\n \"text\": \"Nomi(String titolo) {\\n try { // prova ad eseguire il codice\\n /* regola le variabili di istanza coi parametri */\\n this.setTitolo(titolo);\\n } catch (Exception unErrore) { // intercetta l'errore\\n Errore.crea(unErrore);\\n }// fine del blocco try-catch\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc16556bdd0f099ee40e4b203890a519\",\n \"score\": \"0.57589626\",\n \"text\": \"private void limpiarValores() {\\n \\t\\tanio = \\\"\\\";\\n \\t\\tmes = \\\"\\\";\\n \\t\\tnumtrabajadores = \\\"\\\";\\n \\t\\tsucursal = \\\"\\\";\\n \\t\\theadcount = \\\"\\\";\\n \\t\\tpromedio = \\\"\\\";\\n \\t\\treuniones = \\\"\\\";\\n \\t\\tcumplimiento = \\\"\\\";\\n \\t\\tzuno = \\\"\\\";\\n \\t\\tzdos = \\\"\\\";\\n \\t\\tvalidarOperacion = 0;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bb17f352e5c210f04ee97ccf170ecb1f\",\n \"score\": \"0.5742898\",\n \"text\": \"public void mostrarTareasNumeradas()\\n {\\n //bucle se hace tantas veces como tareas haya.\\n int numeroPosicion = 1;\\n for(String tarea : tareas)\\n {\\n System.out.println(numeroPosicion + \\\".\\\" + tarea);\\n numeroPosicion = numeroPosicion +1;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2410806186b7342102e1ccba4eaceba3\",\n \"score\": \"0.57336926\",\n \"text\": \"private void diziString() {\\n\\t\\tString[] isimler = {null,null};\\r\\n\\t\\tisimler[0] = \\\"Murat\\\";\\r\\n\\t\\tisimler[1] = \\\"Gureken\\\";\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7065cd06d9c1d4eb7d488236f527aceb\",\n \"score\": \"0.57030606\",\n \"text\": \"@Override\\n\\tpublic String mostraInfo() {\\n\\t\\treturn \\\"cor: \\\" + this.cor + \\\", valor: \\\" + this.valor + \\\", ano: \\\" + this.ano;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0fcfd37c1ab8e7cd512aba8ffe2ec260\",\n \"score\": \"0.56928086\",\n \"text\": \"public static void main(String[] args){\\n\\n\\n //Aula 6\\n int edades=10;\\n double salarioDouble=3000;\\n float salarioFloat=3000;\\n byte edadByte=12;\\n short edadShort=32767;\\n boolean verdadero=true;\\n boolean falso=false;\\n long numeroGrande=1000L;\\n char caracter='\\\\u0041'; //2 bytes\\n int x =10;\\n //int edadDosPiasParaRegistro=10;\\n //System.out.println(\\\"La edad es: \\\"+edadDosPiasParaRegistro);\\n String nombre=\\\"Gabrielito\\\";\\n System.out.println(caracter);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e786f3fe8231afcee3ff93288247f569\",\n \"score\": \"0.5687756\",\n \"text\": \"private void mostrarValores() {\\n\\n howTo.setText(realizacion);\\n titulo.setText(nombre_ejercicio);\\n materiales.setText(material);\\n zona.setText(zona_trabajada);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6673906a3dea985a59297bc3dd4a3268\",\n \"score\": \"0.56868976\",\n \"text\": \"private void resultadoDados() {\\r\\n String dadoUno = Integer.toString(dado1);\\r\\n String dadoDos = Integer.toString(dado2);\\r\\n String dadoTres = Integer.toString(dado3);\\r\\n String puntos = Integer.toString(puntaje);\\r\\n etiquetaResultado.setText(\\\"Dado 1: \\\" + dadoUno + \\\" Dado 2: \\\" + dadoDos + \\\" Dado 3: \\\" + dadoTres + \\\"Total: \\\" + puntos);\\r\\n etiquetaResultado.setFont(fuenteTexto);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ed86e12c301053ad651476ff59ca3253\",\n \"score\": \"0.5668591\",\n \"text\": \"public static void main(String [] args) {\\r\\n byte numeroChiquito = 127; //DATO DE NUMERICO PEQUEÑO\\r\\n int numeroEntero = 54698; // DATO DE NUMERICO MEDIANO \\r\\n long numerosGrandes = 545468545; // DATO DE NUMERICO GRANDE \\r\\n \\r\\n short numeroDecimal = 3285;\\r\\n double numeroDecimalGrande = 365489;\\r\\n float numeroDecimalGrande2 = 476546654F;\\r\\n \\r\\n \\r\\n char unLetra = ´a´;\\r\\n String muchasLetras = \\\"cadena de texto\\\";\\r\\n \\r\\n boolean docisiones = true; \\r\\n \\r\\n \\r\\n System.out.print(numeroChiquito);\\r\\n \\r\\n System.out.print(numeroEntero);\\r\\n \\r\\n /**************************************************************\\r\\n *LA LINEA DE CODIGO System.out.println(); ME PERMITE MOSTRAR\\r\\n *EN LA CONSOLA EL DATO QUE SE COLOQUE O VARIABLE QUE SE \\r\\n *COLOQUE DENTRO DE LOS PARENTESIS Y REALIZA UN SALTO DE LINEA\\r\\n ***************************************************************/\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a94c3eedf1826b2f7285b0d83c790d5\",\n \"score\": \"0.56670743\",\n \"text\": \"private void addFields() {\\n\\t\\tposition = new DecimalField(\\\"Position (Z): \\\", \\\"m\\\");\\n\\t\\tadd(position);\\n\\n\\t\\tepaisseur = new DecimalField(\\\"Epaisseur : \\\", \\\"m\\\");\\n\\t\\tadd(epaisseur);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c9f324fa6ca6ad253d56937c60cafe5c\",\n \"score\": \"0.5662335\",\n \"text\": \"void setNumDossier(String text) {\\n jtfNumDossier.setText(text); //To change body of generated methods, choose Tools | Templates.\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5b668d16d8c9f49a5ab3c179b1d37f64\",\n \"score\": \"0.56437665\",\n \"text\": \"void datos (Bicycle p) {\\n Pizarra x = new Pizarra(); \\n Dialog d = new Dialog();\\n String v;\\n int numero;\\n \\n x.setVisible(true);\\ndo v = d.readString (\\\"Ingrese la cantidad de Piñones:\\\");\\n while (!isNum(v));\\n numero=Integer.parseInt(v);\\n p.setPiñon(numero);\\n \\n \\n do v = d.readString (\\\"Ingrese la cantidad de rodadas hechas:\\\");\\n while (!isNum(v)); \\n numero=Integer.parseInt(v);\\n p.setRodada(numero);\\n \\n \\n do v = d.readString (\\\"Ingrese la velocidad:\\\");\\n while (!isNum(v)); \\n numero=Integer.parseInt(v);\\n p.setVelocidad(numero);\\n \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e665b80347467caa4741a823e7eafcf\",\n \"score\": \"0.56412375\",\n \"text\": \"private Variable() {\\n this.id = -1;\\n\\n this.name = Constants.PREFIX_TEMPORALID + (temporals++);\\n this.sort = VariableSort.TEMPORAL;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"029d6704d51ee9a1eb1642161cd0a64b\",\n \"score\": \"0.56208897\",\n \"text\": \"public String getValoreNum(Node n, int posizione) {\\n\\n\\t\\tString res = null;\\n\\t\\tswitch (getElementType(n)) {\\n\\t\\tcase LIBRO:\\n\\t\\t\\tres = \\\"Libro \\\" + this.getRoman(posizione);\\n\\t\\t\\tbreak;\\n\\t\\tcase PARTE:\\n\\t\\t\\tres = \\\"Parte \\\" + this.getRoman(posizione);\\n\\t\\t\\tbreak;\\n\\t\\tcase TITOLO:\\n\\t\\t\\tres = \\\"Titolo \\\" + this.getRoman(posizione);\\n\\t\\t\\tbreak;\\n\\t\\tcase CAPO:\\n\\t\\t\\tres = \\\"Capo \\\" + this.getRoman(posizione);\\n\\t\\t\\tbreak;\\n\\t\\tcase SEZIONE:\\n\\t\\t\\tres = \\\"Sezione \\\" + this.getRoman(posizione);\\n\\t\\t\\tbreak;\\n\\t\\tcase ARTICOLO:\\n\\t\\t\\tres = \\\"Art. \\\" + posizione;\\n\\t\\t\\tbreak;\\n\\t\\tcase COMMA:\\n\\t\\t\\tres = posizione + \\\".\\\";\\n\\t\\t\\tbreak;\\n\\t\\tcase LETTERA:\\n\\t\\t\\tres = posizione + \\\")\\\";\\n\\t\\t\\t//res = UtilLang.fromNumberToLetter(\\\"\\\" + posizione) + \\\")\\\";\\n\\t\\t\\tbreak;\\n\\t\\tcase NUMERO:\\n\\t\\t\\tres = posizione + \\\")\\\";\\n\\t\\t\\tbreak;\\n\\t\\tcase ELENCO_PUNT:\\n\\t\\t\\t//res = (n.getNodeValue()!=null) ? n.getNodeValue() : \\\"-\\\";\\n\\t\\t\\tres = \\\"-\\\";\\n\\t\\t\\tbreak;\\t\\n\\t\\tdefault:\\n\\t\\t\\tres = \\\"\\\";\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\n\\t\\treturn res;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1ae1f50454f96a9da473f58738d5068f\",\n \"score\": \"0.5582969\",\n \"text\": \"@Override public void informacion(){\\n String s = \\\"Tipo de Carroceria: \\\" + tipo() + \\\"\\\\n\\\" +\\n \\\"Costo: \\\" + costo() + \\\"\\\\n\\\" +\\n \\\"Velocidad: \\\" + velocidad() + \\\"\\\\n\\\" +\\n \\\"Defensa: \\\" + defensa() + \\\"\\\\n\\\" +\\n \\\"Ataque: \\\" + ataque() + \\\"\\\\n\\\";\\n\\n System.out.println(s);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c4bdcbb0eccf328351f7cb31f4c30ee7\",\n \"score\": \"0.55739474\",\n \"text\": \"private void calcVar(Text text) {\\n double characters = text.characters;\\n double words = text.words;\\n double sentences = text.sentences;\\n\\n L = characters / words * 100.0;\\n S = sentences / words * 100.0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"04cda2e10f303a3f15637f12920912fa\",\n \"score\": \"0.55617464\",\n \"text\": \"String getNumeral();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eca47383c406738295c88dcbc6eef07d\",\n \"score\": \"0.55598855\",\n \"text\": \"private void czyscPolaTekstowe(int typ){\\n numerFilii.setText(\\\"\\\"); //upewnij sie ze nazwy list sa ok numery i normalizacja nazw\\r\\n numerFilii3.setText(\\\"\\\");\\r\\n maxLiczbaRegalow.setText(\\\"\\\");\\r\\n pojemnosc_regalu.setText(\\\"\\\");\\r\\n numerRegalu.setText(\\\"\\\");\\r\\n numerRegalu3.setText(\\\"\\\");\\r\\n numer_ISBN.setText(\\\"\\\");\\r\\n tytul.setText(\\\"\\\");\\r\\n daneUzytkownika.setText(\\\"\\\");\\r\\n numerUzytkownika.setText(\\\"\\\");\\r\\n iloscFilii.setText(\\\"\\\");\\r\\n iloscKsiazek.setText(\\\"\\\");\\r\\n iloscRegalow.setText(\\\"\\\");\\r\\n iloscUzytkownikow.setText(\\\"\\\");\\r\\n pojemnoscRegalu3.setText(\\\"\\\");\\r\\n numerFilii2 =\\\"\\\";\\r\\n numerRegalu2=\\\"\\\";\\r\\n numerUzytkownika2 = \\\"\\\";\\r\\n numerKatalogowy2=\\\"\\\";\\r\\n if(typ==1) {\\r\\n numerFilii4 = \\\"\\\";\\r\\n numerRegalu4 = \\\"\\\";\\r\\n numerKatalogowy4 = \\\"\\\";\\r\\n numerUzytkownika4 = \\\"\\\";\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0ddc45bdfdfa892f12737d1406b0395a\",\n \"score\": \"0.5553927\",\n \"text\": \"public void testiArvotOluelle() {\\r\\n\\t\\tnimi = \\\"Karhu III\\\";\\r\\n\\t\\tpanimo = \\\"Sinebrychoff\\\";\\r\\n\\t\\ttyyli = \\\"Vaalea Lager\\\";\\r\\n\\t\\talc = 4.7;\\r\\n\\t\\tebu = 12;\\r\\n\\t\\tmaa = \\\"Suomi\\\";\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2bfb024c3cf2182f4c5eaec13f8f3d0e\",\n \"score\": \"0.5549371\",\n \"text\": \"public String toString()\\r\\n\\t{\\r\\n\\t\\treturn (\\\"\\\\nLe Cylindre ayant pour hauteur: \\\"+\\r\\n\\t(int)getHauteur()+\\r\\n\\t\\\" pour rayon: \\\"+\\r\\n\\t(int)getRayon()+UNITE+\\r\\n\\t\\\", nommé \\\"+\\r\\n\\tidentifiant+\\r\\n\\t\\\" possède :\\\\nUne surface de: \\\"+\\r\\n\\t(int)calculSurface()+UNITE+\\\"2\\\"+\\r\\n\\t\\\"\\\\nUn volume de :\\\"+\\r\\n\\t(int)calculVolume()+UNITE+\\\"3\\\");\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2281f5cb983378ad680dd6aa6ce925a3\",\n \"score\": \"0.5518014\",\n \"text\": \"@Override\\n public String toString() {\\n return\\n \\\"marca='\\\" + marca + '\\\\'' +\\n \\\", modelo='\\\" + modelo + '\\\\'' +\\n \\\", precio=\\\" + precio;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fabc1cd62fcbba00feec95f533abf57e\",\n \"score\": \"0.55127496\",\n \"text\": \"private void inicializarComponentes(){\\n etiquetaTitulo = new JLabel(titulo);\\n etiquetaTipo = new JLabel(tipo);\\n etiquetaMonto = new JLabel('$'+monto);\\n etiquetaReferencia = new JLabel(referencia);\\n etiquetaLetra = new JLabel(String.valueOf(titulo.charAt(0)));\\n \\n etiquetaLetra.setBounds(0, 0, 50, 50);\\n etiquetaTitulo.setBounds(50,0,100,20);\\n etiquetaTipo.setBounds(50,20,150,20);\\n etiquetaMonto.setBounds(200,0,100,20);\\n etiquetaReferencia.setBounds(50,40, 100, 20);\\n \\n etiquetaLetra.setForeground(Color.GRAY);\\n etiquetaTipo.setForeground(Color.GRAY);\\n etiquetaLetra.setFont(new Font(\\\"Calibri\\\", 3, 50));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4c2c05d01e865acaecf2c6fe3e779a04\",\n \"score\": \"0.55017364\",\n \"text\": \"private void constructTexts() {\\n int TEXT_LENGTH = 5;\\n textField1 = new JTextField(TEXT_LENGTH);\\n textField2 = new JTextField(TEXT_LENGTH);\\n textField3 = new JTextField(TEXT_LENGTH);\\n textField4 = new JTextField(TEXT_LENGTH);\\n textField5 = new JTextField(TEXT_LENGTH);\\n textField6 = new JTextField(TEXT_LENGTH);\\n textField7 = new JTextField(TEXT_LENGTH);\\n textField8 = new JTextField(12); // people can make a lot of money!\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9abe5146cd27aa04fcefe19191b0a757\",\n \"score\": \"0.549542\",\n \"text\": \"public String impresion(){\\r\\n\\t\\treturn \\\"ISSN - \\\" + this.grupoUno+\\r\\n\\t\\t\\t\\t\\\" - \\\" + this.grupoDos + this.digitoControl;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4813ce765f1433f696d3349f8afcd1d1\",\n \"score\": \"0.5493455\",\n \"text\": \"public void Pmenu_tradctor(){\\r\\n System.out.println(\\\"Has ingresado a traductor\\\");\\r\\n System.out.println(\\\"Escoge una opcion marcando el numero que le antecede\\\");\\r\\n System.out.println(\\\"1. K'iche - Espanol\\\");\\r\\n System.out.println(\\\"2. Espanol - K'iche\\\");\\r\\n System.out.println(\\\"3. Cerrar Traductor\\\\n\\\\n\\\");\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4dbab55d0785ffd79423e8c76e6762dc\",\n \"score\": \"0.5492066\",\n \"text\": \"public void mostrarDatos(){\\n \\tSystem.out.println(\\\"ISBN: \\\"+this.isbn);\\n \\tSystem.out.println(\\\"Autor: \\\"+this.autor);\\n \\tSystem.out.println(\\\"Titulo: \\\"+this.titulo);\\n \\tSystem.out.println(\\\"Numero de paginas: \\\"+this.numPaginas);\\n\\n \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0636133fddee7e14d9ba10fed1e70482\",\n \"score\": \"0.54872626\",\n \"text\": \"@Override\\n public String toString()\\n {\\n\\n return (\\\"[\\\"+this.variableText+\\\":\\\"+this.variableClass+\\\"] \\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6200e46d2d43e8f82d96216dde935a1\",\n \"score\": \"0.5481233\",\n \"text\": \"public String textoAyuda();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a2da9f23cf33cd4af221b75dc4856b1\",\n \"score\": \"0.5480076\",\n \"text\": \"public String informacioPersonal(){\\n\\t\\treturn(\\\"| El nom del tripulant d'aquest vehicle: \\\"+this.nom+\\\"\\\\n\\\"+\\n\\t\\t\\t\\t\\\"| Data neixement: \\\"+this.dataNaixement.getDia()+\\\"/\\\"+this.dataNaixement.getMes()+\\\"/\\\"+this.dataNaixement.getAny()+\\\"\\\\n\\\"+\\n\\t\\t\\t\\t\\\"| Codi del tripulant\\\"+this.NIF\\n\\t\\t\\t\\t);\\t\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"065c063649322d9ee11d5a1298c3addf\",\n \"score\": \"0.5479338\",\n \"text\": \"public String dime_datosGenerales() {\\n\\t\\treturn \\\"La plataforma del vehÝculo tiene \\\" + ruedas + \\\" ruedas \\\"\\r\\n\\t\\t\\t\\t+ \\\".Mide \\\" + largo / 1000 + \\\" metros con un ancho de \\\" + ancho\\r\\n\\t\\t\\t\\t+ \\\" centÝmetros\\\" + \\\",y un peso de plataforma de \\\"\\r\\n\\t\\t\\t\\t+ peso_plataforma + \\\" kg\\\";\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"be9fee8e5ec6496e90a030094735501e\",\n \"score\": \"0.547523\",\n \"text\": \"void InitVariables()\\n {\\n\\n String t1 = String.valueOf(((EditText)findViewById(R.id.etXi)).getText());\\n tmp1 = t1.trim().split(\\\"\\\\n\\\");\\n String t2 = String.valueOf(((EditText)findViewById(R.id.etFi)).getText());\\n tmp2 = t2.trim().split(\\\"\\\\n\\\");\\n\\n Xi = new double[tmp1.length];\\n Fi = new double[tmp2.length];\\n XiFi = new double[tmp2.length];\\n XiDev = new double[tmp2.length];\\n FiDev = new double[tmp2.length];\\n XiMDev = new double[tmp2.length];\\n FiMDev = new double[tmp2.length];\\n CF = new double[tmp2.length];\\n sum = sum2 = sum3 = N = 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b850b78dbd6ce96ba00191e6be0864b4\",\n \"score\": \"0.5473454\",\n \"text\": \"public String getTextoNombre();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c2ffb49a80d59552240e9337a824531\",\n \"score\": \"0.5472358\",\n \"text\": \"private void setTextViews()\\n {\\n mathProblem.createPlayerNum();\\n mathProblem.createMonsterNum();\\n\\n textCharacterName.setText(playerType);\\n textMonsterName.setText(monster.setMonster());\\n textMonsterNum.setText(Integer.toString(mathProblem.monsterNum));\\n textPlayerNum.setText(Integer.toString(mathProblem.playerNum));\\n textPlayerHealth.setText(Integer.toString(player.setHealth()));\\n textMonsterHealth.setText(Integer.toString(monster.setHealth()));\\n\\n Log.d(\\\"character\\\", textMonsterNum.getText().toString());\\n if(playerType == \\\"addition\\\")\\n {\\n textMathSymbol.setText(\\\"+\\\");\\n }\\n else if(playerType == \\\"subtraction\\\")\\n {\\n textMathSymbol.setText(\\\"-\\\");\\n }\\n else if(playerType == \\\"multiplication\\\")\\n {\\n textMathSymbol.setText(\\\"x\\\");\\n }\\n else textMathSymbol.setText(\\\"/\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9638c591629f6fe86cc4f31073198481\",\n \"score\": \"0.5467259\",\n \"text\": \"private void limpiarCampos() {\\n try {\\n txtID.setText(String.valueOf(LogicaServicio.conseguirID()));\\n } catch (Exception ex) {\\n System.out.println(ex.getMessage());\\n }\\n txtNombre.setText(\\\"\\\");\\n txtNombre.setBackground(Color.white);\\n txtPrecio.setText(\\\"\\\");\\n txtPrecio.setBackground(Color.white);\\n txtDniDoctor.setText(\\\"\\\");\\n labFoto.setIcon(null);\\n labFoto.setText(\\\"\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"86a53d138d911558389a05702b3f5e03\",\n \"score\": \"0.54593295\",\n \"text\": \"private String variableLabel(String name, String SEP){\\n return SEP+name+\\\" min\\\"+SEP+name+\\\" max\\\"+SEP+name+\\\" av\\\"+SEP+name+\\\" av +/-\\\"+SEP+name+\\\" sigma\\\";\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7a722149eba91c144263185ac13a9cac\",\n \"score\": \"0.54569703\",\n \"text\": \"private void setCount() {\\n int importCnt = 300;\\n int exportCnt = 341;\\n\\n importTv.setText(importCnt + \\\"건의 입고\\\");\\n exportTv.setText(exportCnt + \\\"건의 출고\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0a5d6eed6031815537b001f3dbce8068\",\n \"score\": \"0.54473835\",\n \"text\": \"public static void main (String[] args){\\n /*int i; //declarei variável mas não o valor\\n int j = 10; // declarei a variavel e o valor\\n i = 10; // agora declarei o valor de i\\n j = 11; // alterei o valor de j\\n\\n double d = i; // um inteiro cabe dentro de um ponto flutuante\\n System.out.println(\\\"d = \\\" + d);\\n\\n d = 1.56;\\n int x = (int) d;\\n\\n System.out.println(\\\"x = \\\" + x);\\n\\n System.out.println(foraDoEscopo);\\n\\n char c = 'p';\\n\\n System.out.println(c);\\n float f = 1f;\\n\\n System.out.println(\\\"f = \\\" + f);\\n\\n f = f/3;\\n f = f*3;\\n\\n System.out.println(\\\"f = \\\" + f);\\n\\n final int constante = 10;\\n //constante = 11; não pode acontecer\\n\\n Sexo meuSexo = Sexo.MASCULINO;\\n\\n System.out.println(\\\"meuSexo = \\\" + meuSexo);\\n\\n int valor = 99;\\n System.out.println(valor++); //imprime 99\\n System.out.println(--valor); //imprime 99\\n\\n valor = - valor; //inverte o sinal\\n System.out.println(\\\"valor = \\\" + valor);\\n\\n System.out.println(!!true);\\n\\n double soma = 10 + 10.99;\\n System.out.println(\\\"soma = \\\" + soma);\\n\\n float div = 10/ 3f;\\n System.out.println(\\\"div = \\\" + div);\\n\\n int num = 10;\\n num +=10; //jao = jao + 10;\\n System.out.println(\\\"num = \\\" + num);\\n\\n Scanner scanner = new Scanner(System.in); //Inputar texto\\n\\n String name = scanner.nextLine();\\n int idade = scanner.nextInt();\\n double peso = scanner.nextDouble();\\n\\n if (idade >= 18) {\\n System.out.println(name+ \\\" Pode beber corote.\\\");\\n } else {\\n System.out.println(name + \\\" só bebe leite!\\\");\\n }\\n\\n System.out.println(idade >=18 ? name + \\\" Pode beber coroto\\\" : name + \\\"só bebe leite!\\\");*/\\n\\n Scanner scanner = new Scanner(System.in);\\n int value = scanner.nextInt();\\n int otherValue = 0;\\n\\n switch (value) {\\n case 1:\\n otherValue =1;\\n break;\\n case 2:\\n otherValue =2;\\n break;\\n case 3:\\n otherValue =3;\\n break;\\n case 4:\\n otherValue =4;\\n break;\\n default:\\n otherValue = -1;\\n }\\n\\n System.out.println(\\\"otherValue = \\\" + otherValue );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"55f9649b5a1195e9b4b76d5d2c32e42d\",\n \"score\": \"0.5440358\",\n \"text\": \"public String tallennusString() {\\r\\n try {\\r\\n return super.tallennusString() + variString() + EROTIN;\\r\\n }\\r\\n catch(Exception e) {\\r\\n return VIRHE;\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fea366ae6945fb197997a33af4863de5\",\n \"score\": \"0.5440099\",\n \"text\": \"private void setupFields() {\\n maxIteration = getResources().getInteger(R.integer.main_integer_maxGreet);\\n greetPrefix = getString(R.string.rb_main_mr);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d20676d3a5fe870f4a57ce32beca82db\",\n \"score\": \"0.5439299\",\n \"text\": \"public String decrisToi(){\\r\\n\\t return \\\"\\\\t\\\"+this.nomVille+\\\" est une ville de \\\"+this.nomPays+ \\\", elle comporte : \\\"+this.nbreHabitants+\\\" habitant(s) => elle est donc de cat�gorie : \\\"+this.categorie;\\r\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d3de7022cd368be0b91864a38e934fbc\",\n \"score\": \"0.5434456\",\n \"text\": \"public String visualizar() {\\n\\t\\tString Dato=\\\"\\\"; \\n\\t\\tnodo aux=cabeza; \\n //verifica si esta vacia, o no, para regresar un mensaje\\n if(null==aux){Dato=\\\"--------\\\";}else{ \\n\\t\\twhile (aux!=null)\\n\\t\\t{ \\n //hasta que encuentre null no va a parar y guardar los datos en esa variable \\n\\t\\t\\tDato=Dato+aux.han.getnum()+\\\"---\\\";\\n\\t\\t\\taux=aux.siguiente;\\n\\t\\t}}\\n\\t\\treturn(Dato);//regresa lo que tiene la variabel\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9af6bf38d48e24ef4fd150622f0df0d8\",\n \"score\": \"0.54329854\",\n \"text\": \"static public String getNumero()\\r\\n {\\r\\n return numero;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0f255eec7e8214113b4f245f997fe4ff\",\n \"score\": \"0.5427074\",\n \"text\": \"private static void defineMaiores(String x, double y) {\\n\\n // Se o valor recebido for o maior encontrado, é armazenado\\n if (y > maior) {\\n maior = y;\\n resultado = y + \\\"\\\\t\\\" + x;\\n }\\n // Se o valor recebido for igual ao maior, é concatenado ao resultado\\n else if (y == maior) {\\n resultado += \\\"\\\\n\\\" + y + \\\"\\\\t\\\" + x;\\n }\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f0c59103975633c82274a3360b0306b2\",\n \"score\": \"0.54236525\",\n \"text\": \"public void setString()\\n\\t{\\n\\n\\t\\tTextView product = (TextView) findViewById(R.id.product);\\n\\t\\tproduct.setText(this.productNaam);\\n\\t\\tTextView prijs = (TextView) findViewById(R.id.prijs);\\n\\t\\tprijs.setText(this.productPrijs);\\n\\t\\tTextView totaalprijs = (TextView) findViewById(R.id.totaalprijs);\\n\\t\\tint totaalprijsAantal = Integer.parseInt(this.productAantal);\\n\\t\\tint totaalprijsPrijs = Integer.parseInt(\\\"7\\\");\\n\\t\\ttotaalprijs.setText(\\\"€\\\" + (totaalprijsAantal * totaalprijsPrijs));\\n\\t\\tEditText naamEditTekst = (EditText) findViewById( R.id.edit_naam);\\n\\t\\tnaamEditTekst.setText(this.naam );\\n\\t\\tEditText adresEditTekst = (EditText) findViewById( R.id.edit_adres );\\n\\t\\tadresEditTekst.setText(this.adres );\\n\\t\\tEditText telefoonEditTekst = (EditText) findViewById( R.id.edit_telefoon );\\n\\t\\ttelefoonEditTekst.setText(this.telefoonnummer );\\n\\t\\tEditText emailEditTekst = (EditText) findViewById( R.id.edit_email );\\n\\t\\temailEditTekst.setText(this.email );\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bce8ee90e7aada9a558bf7e0ac9b29fd\",\n \"score\": \"0.5423084\",\n \"text\": \"public static void main(String[] args)\\r\\n {\\n int x = 1;\\r\\n // [type] [invented-name];\\r\\n int y;\\r\\n\\r\\n char lett = 'A';\\r\\n String first_name = \\\"Danny\\\";\\r\\n String one_char = \\\"A\\\";\\r\\n String last_name = \\\"Cohen\\\";\\r\\n String number = \\\"5.5\\\";\\r\\n // int kaful2 = number * 2; //ERROR\\r\\n int x1 = 1;\\r\\n int kaful2 = x1 * 2;\\r\\n int sum2 = 1 + 1; // 2\\r\\n\\r\\n System.out.print(first_name);\\r\\n System.out.print(\\\" \\\");\\r\\n System.out.println(last_name);\\r\\n\\r\\n String sentence = \\\"Good \\\" + \\\"morning!\\\"; // \\\"Good morning!\\\" Concat\\r\\n\\r\\n System.out.println(\\\"Hello world!\\\");\\r\\n\\r\\n System.out.println(first_name + \\\" \\\" + last_name);\\r\\n\\r\\n String full_name = first_name + \\\" \\\" + last_name;\\r\\n System.out.println(full_name);\\r\\n\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"09882f667db8b8d5423310c578c9730d\",\n \"score\": \"0.54195285\",\n \"text\": \"public void limpaCampos() {\\n jTxt_codigo.setText(\\\"\\\");\\n jFTxt_datacad.setText(\\\"\\\");\\n jTxt_descricao.setText(\\\"\\\");\\n jTxt_valor.setText(\\\"\\\");\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"166dfd93d359f3783e77a626c8cbecf6\",\n \"score\": \"0.5412699\",\n \"text\": \"@Override\\r\\n\\tpublic String infoEntrada() {\\n\\t\\treturn super.infoEntrada() + \\\"\\\\nPrecio: \\\" + this.calcularPrecio();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a79b78a5901a13a40a977bc424fba892\",\n \"score\": \"0.54117215\",\n \"text\": \"private void limparCampos() {\\n\\n tfaluno.setText(\\\"\\\");\\n tfautor.setText(\\\"\\\");\\n tfchegada.setText(\\\"\\\");\\n tflivro.setText(\\\"\\\");\\n tfmatricula.setText(\\\"\\\");\\n tfreserva.setText(\\\"\\\");\\n tfretorno.setText(\\\"\\\");\\n tftombo.setText(\\\"\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"473a3642fe612337ea4862830a8fcfbd\",\n \"score\": \"0.54099923\",\n \"text\": \"public String limpiarCargaLote()\\r\\n/* 960: */ {\\r\\n/* 961:1107 */ this.productoCargaArchivo = null;\\r\\n/* 962:1108 */ this.cantidadPesoLote = BigDecimal.ZERO;\\r\\n/* 963:1109 */ this.numeroLotes = Integer.valueOf(1);\\r\\n/* 964: */ \\r\\n/* 965:1111 */ return \\\"\\\";\\r\\n/* 966: */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"70b1595c682cbb105e13394b92ed9013\",\n \"score\": \"0.5409796\",\n \"text\": \"public void getMenuMision() {\\n\\t\\tSystem.out.println(\\\"\\\\nNombre: \\\" +nombre+ \\\" Aldea: \\\" +aldea+ \\\" Rango: \\\"+rango\\n\\t\\t+\\\"\\\\nVida: \\\" +vida+\\\"/\\\"+vidamax+\\\" Oro: \\\"+oro+\\\" Nivel: \\\"+nivel\\n\\t\\t+\\\"\\\\nExperiencia: \\\"+barraexp\\n\\t\\t+\\\"\\\\nEnergia: \\\"+barraener\\n\\t\\t+\\\"\\\\n\\\\n----------------MISIONES----------------\\\\n\\\"\\n\\t\\t+\\\"|(1)Mision Tipo D (Ifnin) |\\\\n\\\"\\n\\t\\t+\\\"|---------------------------------------|\\\\n\\\"\\n\\t\\t+\\\"|(2)Mision Tipo C (Ifnin & Fornins) |\\\\n\\\"\\n\\t\\t+\\\"|---------------------------------------|\\\\n\\\"\\n\\t\\t+\\\"|(3)Mision Tipo B (Fornins) |\\\\n\\\"\\n\\t\\t+\\\"|---------------------------------------|\\\\n\\\"\\n\\t\\t+\\\"|(4)Mision Tipo A (Whilenins) |\\\\n\\\"\\n\\t\\t+\\\"|---------------------------------------|\\\\n\\\"\\n\\t\\t+\\\"|(5)Mision Tipo S (Whilenins & Kages) |\\\\n\\\"\\n\\t\\t+\\\"|---------------------------------------|\\\\n\\\"\\n\\t\\t+\\\"\\\\nElige numero de tu opcion: \\\");\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a6ab48f9b84a085d3b4151f3b79d10bb\",\n \"score\": \"0.54024595\",\n \"text\": \"public void cambiarDinero(int dinero){\\n //Cambiar a string\\n String cantidad= dinero+\\\"\\\";\\n jLabelRupias.setText(\\\"Drabines: \\\"+cantidad+\\\"D\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"162663dcbdc79f8d587079fcccc9a720\",\n \"score\": \"0.539934\",\n \"text\": \"protected String elaboraIncipitSpecifico() {\\n String testo = VUOTA;\\n\\n testo += \\\"incipit lista cognomi\\\";\\n testo += PIPE;\\n testo += \\\"cognome=\\\";\\n testo += cognome.cognome;\\n testo = LibWiki.setGraffe(testo);\\n\\n return testo;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d236c0befee4e7ca65d871460c164215\",\n \"score\": \"0.5398787\",\n \"text\": \"@Override\\r\\n\\tpublic String NumCompte(String nom, String prenom, int id) {\\n\\t\\tString lib1=nom.subSequence(0,3).toString();\\r\\n\\t\\tString lib2=prenom.subSequence(0,3).toString();\\r\\n\\t\\t\\r\\n\\t\\tString s1=\\\"CCP\\\";\\r\\n\\t\\tString s2=\\\"00000-\\\".concat(\\\"\\\"+id).concat(lib1).concat(lib2).concat(\\\"\\\"+nombreAleatoire);\\r\\n\\t\\tString s3=s1+s2;\\r\\n\\t\\treturn s3;\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3d087e149fb9522fede61da31a5c503b\",\n \"score\": \"0.5394869\",\n \"text\": \"void mostrar(){\\n\\t\\t\\n\\t\\tSystem.out.println(\\\"Nombre: \\\" + nombre);\\n\\t\\tSystem.out.println(\\\"Apellidos: \\\" + apellidos);\\n\\t\\tSystem.out.println(\\\"DNI: \\\" + dni);\\n\\t\\t\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6063a30378cdbafc348ac4c70db312eb\",\n \"score\": \"0.5394327\",\n \"text\": \"public String getDatos(){\\n return \\\"los datos son: \\\" + nombre + apellido + edad;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"66a13d164a884d1dfd2eb6c7c7ba971a\",\n \"score\": \"0.53930974\",\n \"text\": \"public void setTotalText(String zahlen) {\\n\\tif(counter !=0) {\\n\\t\\tthis.totaltext += zahlen;\\n\\t view.ausgabe.setText(totaltext);\\n\\t}else {\\n\\t\\tthis.totaltext = \\\"\\\";\\n\\t}\\n\\t\\n \\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2564d266d08d9b5456d14e9a01d65970\",\n \"score\": \"0.53923774\",\n \"text\": \"public void setNom(String n) { this.nom = n; }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c74d342db84ea3e1ebc8a2b17b4a0397\",\n \"score\": \"0.5388792\",\n \"text\": \"public void echo(){\\n System.out.println(int_level2+String_delimitador+int_level1+String_delimitador+double_level0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"43535801a4d487d01bc3d03dd0ddd5e2\",\n \"score\": \"0.5387996\",\n \"text\": \"public String getNombre() {\\r\\n return NOMBRE;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"10b5b5324b3272b11afbbde8aa966ddf\",\n \"score\": \"0.5378781\",\n \"text\": \"public String getTextura();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"11e7f68172c8501284a98281301c9234\",\n \"score\": \"0.5375293\",\n \"text\": \"public AutoritaModulo() {\\n /* regola la variabile di istanza con la costante */\\n super.setNomeModulo(NOME_CHIAVE);\\n\\n /* regola il nome del programma (se questo modulo parte per primo) */\\n super.setNomeProgramma(NOME_PROGRAMMA);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2317c0138e215911f4ce6936b65c1896\",\n \"score\": \"0.53739256\",\n \"text\": \"public static void main(String[] args) {\\n int a,b,c ; \\n a=10;\\n b=20;\\n c=5;\\n float d = 10.5f;\\n double e = 20.12345678312312312321;\\n\\n int penjumlahan1 = a+b;\\n int penjumlahan2 = penjumlahan1 + c;\\n int penjumlahan3 = (int) d + (int) e;\\n\\n String penjelasan = \\\"Hasil dari 10.5 + 20.12 = \\\";\\n\\n System.out.println(\\\"Hasil dari (10+20) + 5 = \\\" + penjumlahan2);\\n System.out.println(penjelasan + penjumlahan3);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0c4dcfcdba08906cc68012ced0390d9e\",\n \"score\": \"0.5357846\",\n \"text\": \"@Override\\r\\n\\tpublic void description() {\\n\\t\\tSystem.out.println(\\\"Memiliki 3 perkerjaan seperti berkerja, melukis, dan berkendara\\\");\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3f22e9a130b1e22317d80a037eb2bbfc\",\n \"score\": \"0.5356097\",\n \"text\": \"private void pintarEspacioDisco() {\\n jLabelEspacioTotal.setText(\\\"Espacio total : \\\" + gestion.getTotalSpaceGb() + \\\" GB.\\\");\\n jLabelEspacioLibreTotal.setText(\\\"Espacio libre : \\\" + gestion.getFreeSpaceGb() + \\\" GB.\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ee2da3c4e24d729aaeccc247b1568b83\",\n \"score\": \"0.5354251\",\n \"text\": \"public String calcular(){\\r\\n nombre = index.getNombre();\\r\\n apellido = index.getApellido();\\r\\n diasT = index.getDiasT();\\r\\n sueldoB = index.getSueldoB();\\r\\n nivelE = 0;\\r\\n nivelEE = index.getNivelE();\\r\\n idiomas = index.getIdiomas().length;\\r\\n \\r\\n if(index.getNivelE().equals(\\\"primaria\\\")){\\r\\n nivelE = 0;\\r\\n }else if(index.getNivelE().equals(\\\"secundaria\\\")){\\r\\n nivelE= 0;\\r\\n }else if(index.getNivelE().equals(\\\"tecnico\\\")){\\r\\n nivelE= 5000;\\r\\n }else if(index.getNivelE().equals(\\\"tecnologo\\\")){\\r\\n nivelE= 15000;\\r\\n }else if(index.getNivelE().equals(\\\"profesional\\\")){\\r\\n nivelE= 30000;\\r\\n }else if(index.getNivelE().equals(\\\"magister\\\")){\\r\\n nivelE= 40000;\\r\\n }\\r\\n nomina =(sueldoB+(idiomas*10000)+nivelE)*diasT; \\r\\n return (\\\"/nomina\\\");\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6c3f096d1d93d2e7d307a2b9c3f6ebea\",\n \"score\": \"0.5354152\",\n \"text\": \"public String toString() {\\n return nombre +\\\"\\\\t\\\\t\\\"+ numRegistro;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"30f53d922af7cf8814eb160e7078768b\",\n \"score\": \"0.53533715\",\n \"text\": \"@Override\\n\\tpublic void NopanHeitto() {\\n\\t\\tString heitot=\\\"Nopista tuli \\\";\\n\\t\\tint sum = 0;\\n\\t\\tfor (int i=0;i<5;i++) {\\n\\t\\t\\tint luku=noppa.heitä();\\n\\t heitot=heitot+\\\",\\\"+luku;\\n\\t \\tsum =sum+luku;\\n\\t\\t}\\n\\t\\theitot=heitot+\\\". Summa:\\\"+sum;\\n\\tint heittomaara=noppa.getHeittoMaara();\\n\\n\\tnoppagui.setNoppa(heitot,heittomaara);\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"47e2ce554760228fda578232e1ca2241\",\n \"score\": \"0.53505003\",\n \"text\": \"public String display(){\\r\\n return (this.Vin +\\\" \\\" +this.mfr + \\\" \\\" + this.color);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"07ae88a6cf64d268be56db9aac76a8d6\",\n \"score\": \"0.5345896\",\n \"text\": \"@Override\\n\\t\\t\\tpublic String getText() {\\n\\t\\t\\t\\treturn \\\"Voglio tokenizzare questa stringa\\\";\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"db1cd3c9a629558e52109560789c36dc\",\n \"score\": \"0.53450257\",\n \"text\": \"public String displayData(){\\n return String.format(\\\"name = %s, price = %s, hasMotor = %s\\\", getName(), getPrice(), hasMotor);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7e17b283544eb48b2503c7a59a4644d2\",\n \"score\": \"0.5334675\",\n \"text\": \"private void limpiarValores(){\\n\\t\\tcedula = \\\"\\\";\\n\\t\\tcoduser = \\\"\\\";\\n\\t\\tcluser = \\\"\\\";\\n\\t\\tmail = \\\"\\\";\\n\\t\\tnbr = \\\"\\\";\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6fd8943540e217916dedb5b15d485767\",\n \"score\": \"0.53290504\",\n \"text\": \"String getValor();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e188cca452e98488123d4abf769de5c5\",\n \"score\": \"0.53277576\",\n \"text\": \"public void print()\\n\\t{\\n\\t\\tSystem.out.print(\\\"Vous avez fait l'exercice \\\" + this.numeroExercice + \\\" d'une leçon \\\");\\n\\t\\tif (this.typeLecon == 1)\\n\\t\\t\\tSystem.out.print(\\\"de grammaire\\\");\\n\\t\\telse if (this.typeLecon == 2)\\n\\t\\t\\tSystem.out.print(\\\"de conjugaison\\\");\\n\\t\\telse if (this.typeLecon == 3)\\n\\t\\t\\tSystem.out.print(\\\"d'orthographe\\\");\\n\\t\\telse\\n\\t\\t\\tSystem.out.print(\\\"de vocabulaire\\\");\\n\\t\\tSystem.out.print(\\\" dans la langue \\\");\\n\\t\\tif (this.langue == 1)\\n\\t\\t\\tSystem.out.print(\\\"anglaise\\\");\\n\\t\\telse if (this.langue == 2)\\n\\t\\t\\tSystem.out.print(\\\"Espagnol\\\");\\n\\t\\telse if (this.langue == 3)\\n\\t\\t\\tSystem.out.print(\\\"Italienne\\\");\\n\\t\\telse\\n\\t\\t\\tSystem.out.print(\\\"Allemande\\\");\\n\\t\\tSystem.out.println(\\\".\\\");\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cc615ab8d6d6dbadd1ec9311abf2b267\",\n \"score\": \"0.53273034\",\n \"text\": \"public void nombreVehiculos(){ \\n System.out.println(\\\"| VEHICULOS DEL JUGADOR:\\\");\\n System.out.println(\\\"| 1. SU SKIN: \\\"+vehiculo1()+\\\" TIPO: \\\"+misVehiculos[0].tipoVehiculo()+\\\" NOMBRE: \\\"+misVehiculos[0].getNombreVehiculo());\\n System.out.println(\\\"| 2. SU SKIN: \\\"+vehiculo2()+\\\" TIPO: \\\"+misVehiculos[1].tipoVehiculo()+\\\" NOMBRE: \\\"+misVehiculos[1].getNombreVehiculo());\\n System.out.println(\\\"| 3. SU SKIN: \\\"+vehiculo3()+\\\" TIPO: \\\"+misVehiculos[2].tipoVehiculo()+\\\" NOMBRE: \\\"+misVehiculos[2].getNombreVehiculo());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f7e6cc73a3b7f2613c82688c8e0d175c\",\n \"score\": \"0.5320293\",\n \"text\": \"public String darNumDerrotasOponente( )\\n {\\n return numDerrotasOponente;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7c7d29951f0c63e8a8de542b4b7bba8e\",\n \"score\": \"0.5320135\",\n \"text\": \"public String getNumero()\\r\\n/* 186: */ {\\r\\n/* 187:212 */ return this.numero;\\r\\n/* 188: */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a5a66b3edb692eb3a9b37789dce75e9f\",\n \"score\": \"0.5316289\",\n \"text\": \"public static void main(String[] args)\\n {\\n // Label output with name and date:\\n System.out.println(\\\"Gary Miller\\\\nLab #\\\\n\\\" + new Date() + \\\"\\\\n\\\");\\n\\n // Variable dictionary:\\n String a = \\\"x1\\\";\\n String b = a.substring(1,2);\\n int c = Integer.parseInt(b);\\n System.out.println(\\\"\\\" +c);\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"85e81f84f2fd64910c3b201fe47a89e9\",\n \"score\": \"0.5315935\",\n \"text\": \"public void tampilurutankode() {\\n form.getTxtNoSP().setText(model.autonumberstring());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0c69726b8b432b2252d743a37e90c211\",\n \"score\": \"0.53112644\",\n \"text\": \"public String toString (){\\n\\t\\tString descricao = \\\"Nota formada:\\\\n\\\";\\n\\t\\t\\n\\t\\tdescricao += \\\"\\\\tFreq = \\\" + this.getFrequencia() + \\\"\\\\n\\\";\\n\\t\\t\\n\\t\\tdescricao += \\\"\\\\tAmpli = \\\" + this.getAmplitude() + \\\"\\\\n\\\";\\n\\t\\t\\n\\t\\tdescricao += \\\"\\\\tDuracao = \\\" + this.getDuracao() + \\\"\\\\n\\\";\\n\\t\\t\\n\\t\\tdescricao += \\\"\\\\tInst. Inicial = \\\" + this.getInstanteInicial() + \\\"\\\\n\\\";\\n\\t\\t\\n\\t\\tdescricao += \\\"\\\\tInst. Final = \\\" + this.getInstanteFinal() + \\\"\\\\n\\\\n\\\";\\n\\t\\t\\n\\t\\treturn descricao;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e3c2076c6fe2074331734c02c7e0a58e\",\n \"score\": \"0.5308704\",\n \"text\": \"protected void iniciarValores() {\\n\\t\\ttextDni.setText(\\\"\\\");\\n\\t\\ttextDireccion.setText(\\\"\\\");\\n\\t\\ttextPrecio.setText(\\\"\\\");\\n\\t\\ttextMetros.setText(\\\"\\\");\\n\\t\\ttextBaños.setText(\\\"\\\");\\n\\t\\ttextHabitaciones.setText(\\\"\\\");\\n\\t\\ttextPlaza.setText(\\\"\\\");\\n\\t\\ttextLocal.setText(\\\"\\\");\\n\\t\\ttextPrecioAlquiler.setText(\\\"\\\");\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4b7d4fb392ac69a96c319faee4a19896\",\n \"score\": \"0.5293473\",\n \"text\": \"private void limpiarCampos () {\\n \\n txtAltura.setText(\\\"\\\");\\n txtPeso.setText(\\\"\\\");\\n txtHobbies.setText(\\\"\\\");\\n txtAnio.setText(\\\"\\\");\\n txtResultadoIMC.setText(\\\"\\\");\\n txtResultadoEvaluacion.setText(\\\"\\\");\\n txtNombre.setText(\\\"\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"52d68368ce51030a45a052e7b085d031\",\n \"score\": \"0.52929467\",\n \"text\": \"public resa2() {\\n initComponents();\\n txthasil.setText(\\\"\\\");\\nangka1=0.0;\\nangka2=0.0;\\njumlah=0.0;\\nangka=\\\"\\\"; \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d348b855e3a3e59ebb86f5787ccce2e4\",\n \"score\": \"0.5289993\",\n \"text\": \"public NumberExpression(int n){\\n text=Integer.toString(n);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"52f0d58767a85947e0485c752bff57e2\",\n \"score\": \"0.52893543\",\n \"text\": \"public String getTexto1(){\\n return this.texto1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e4023da3ad6238d8c697ebb429f7bee\",\n \"score\": \"0.528699\",\n \"text\": \"private static void inputVars() {\\r\\n\\t\\tSystem.out.println(\\\"Type number 1: \\\");\\r\\n\\t\\tnum1=scan.nextFloat();\\r\\n\\t\\tSystem.out.println(\\\"Type number 2: \\\");\\r\\n\\t\\tnum2=scan.nextFloat();\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b5e23f3a23e969731a2fb467a6cf32d3\",\n \"score\": \"0.52848643\",\n \"text\": \"private int showMenue()\\r\\n\\t{\\r\\n\\t\\tSystem.out.println(\\r\\n\\t\\t\\t\\\"\\\\n____________\\\\n\\\"\\r\\n\\t\\t\\t+ \\\"|ADD (1)|\\\\n\\\"\\r\\n\\t\\t\\t+ \\\"|DEL (2)|\\\\n\\\"\\r\\n\\t\\t\\t+ \\\"|IMPORT (3)|\\\\n\\\"\\r\\n\\t\\t\\t+ \\\"|SEARCH (4)|\\\\n\\\"\\r\\n\\t\\t\\t+ \\\"|PLOT (5)|\\\\n\\\"\\r\\n\\t\\t\\t+ \\\"|SAVE (6)|\\\\n\\\"\\r\\n\\t\\t\\t+ \\\"|LOAD (7)|\\\\n\\\"\\r\\n\\t\\t\\t+ \\\"|QUIT (8)|\\\\n\\\"\\r\\n\\t\\t\\t+ \\\"¯¯¯¯¯¯¯¯¯¯¯¯\\\");\\r\\n\\t\\t\\r\\n\\t\\tint eingabe=0;\\r\\n\\t\\tdo{\\r\\n\\t\\t\\tSystem.out.print(\\\"Eingabe: \\\");\\r\\n\\t\\t\\t//Regx für Eingabe, überprüft ob eingabe Zahl ist. z.B. wenn ein Buchstabe eingegeben wird*/\\r\\n\\t\\t\\tString varstring_regx=\\\"[1-8]\\\";\\r\\n\\t\\t\\tString varstring_input = read.next();\\r\\n\\t\\t\\tif(varstring_input.matches(varstring_regx))\\r\\n\\t\\t\\t\\teingabe=Integer.parseInt(varstring_input);\\r\\n\\t\\t\\telse\\r\\n\\t\\t\\t\\tSystem.out.println(\\\"** Ungültige Eingabe! **\\\");\\r\\n\\t\\t}while(eingabe<1 || eingabe>9);\\r\\n\\t\\t\\r\\n\\t\\treturn eingabe;\\r\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3bf445c984344a5025e5a42057a0fd7a\",\n \"score\": \"0.5284193\",\n \"text\": \"public void setNumero(String numero)\\r\\n/* 191: */ {\\r\\n/* 192:216 */ this.numero = numero;\\r\\n/* 193: */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1da181429e5f770f14e9892b78603602\",\n \"score\": \"0.5282602\",\n \"text\": \"private void set_initial_data(){\\n\\n try{\\n\\n value.setText(\\\"_\\\");\\n systolic_value.setText(\\\"_\\\");\\n diastolic_value.setText(\\\"_\\\");\\n chol_total_value.setText(\\\"_\\\");\\n ldl_value.setText(\\\"_\\\");\\n hdl_value.setText(\\\"_\\\");\\n\\n }catch (Exception e){\\n e.printStackTrace();\\n }\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a0aa68ae1fe64d95291ef89a0fc2453f\",\n \"score\": \"0.52824694\",\n \"text\": \"public void almacenaNumeroPTB();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f60c89a9b022d8d8efdff32de6936341\",\n \"score\": \"0.52784234\",\n \"text\": \"public void setPrenom(String prenom);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9aecb2fdb747c17aa1ccd9d2b18eb83d\",\n \"score\": \"0.5278211\",\n \"text\": \"public void settings()\\n\\t{\\n\\t\\tsize(1000, 500);\\n\\n\\t\\t// How to convert a character to a number\\n\\t\\tchar c = '7'; // c holds the character 7 (55)\\n\\t\\tint i = c - '0'; // i holds the number 7 (55 - 48) \\n\\t\\tprintln(i);\\n\\t}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":985393,"cells":{"query_id":{"kind":"string","value":"eda4e4e054efd91eaefbf4bfeab03a8c"},"query":{"kind":"string","value":"Returns curve associated with this point. No copy of curve is made before return, so change of returned object will also change curve for this point."},"positive_passages":{"kind":"list like","value":[{"docid":"d8f9ce20f381d8d919983b2c99ac5a7e","score":"0.7185384","text":"public ECCurve getCurve() {\n \treturn theCurve;\n }","title":""}],"string":"[\n {\n \"docid\": \"d8f9ce20f381d8d919983b2c99ac5a7e\",\n \"score\": \"0.7185384\",\n \"text\": \"public ECCurve getCurve() {\\n \\treturn theCurve;\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"b3c058f4575e2fc36da4844b9b3ffb80","score":"0.7183551","text":"public Curve getUnderlyingCurve() {\n return underlyingCurve;\n }","title":""},{"docid":"2259402cd9b4ad39fb3ecdb7dc18bbca","score":"0.69731885","text":"public CompositeCurve getCompositeCurve(){\n\t\tif(cCurve == null)\n\t\t\tcCurve = new CompositeCurve(streams, merQH);\n\t\treturn cCurve;\n\t}","title":""},{"docid":"ff8381c7e1730e1fefcdc928d6b3fba7","score":"0.6748695","text":"@Override\n public PointToPointCurve asPointToPoint() {\n updateP2PCurve(this.numApproxPoints);\n return this.p2pCurve;\n }","title":""},{"docid":"3edd0d987cb6260137e51e53d72c2fd8","score":"0.66042435","text":"public GrandCompositeCurve getGrandCompositeCurve(){\n\t\tif(gcCurve == null)\n\t\t\tgcCurve = new GrandCompositeCurve(this);\n\t\treturn gcCurve;\n\t}","title":""},{"docid":"4454e5c943d65431d1af708327106d87","score":"0.6423372","text":"IfcCurve getAxisCurve();","title":""},{"docid":"ab21781e568d688624cb0d0ed89526d4","score":"0.6367628","text":"public String getCurveName() {\n return _curveName;\n }","title":""},{"docid":"7fdb839fa86a7405a33188923bd8d564","score":"0.63140345","text":"curve createcurve();","title":""},{"docid":"8512c07470b92bc2503498c26e53e1ea","score":"0.6105552","text":"public synchronized List<AbstractCurve> getCurves() {\n synchronized (this.raw) {\n synchronized (this.smooth) {\n List<AbstractCurve> result = new ArrayList<>();\n result.add(this.raw);\n result.addAll(this.smooth);\n return result;\n }\n }\n }","title":""},{"docid":"2b98a6761acda6bce6112e1bb7daae9d","score":"0.610083","text":"public net.opengis.gml.x32.CurvePropertyType addNewCurveMember()\n {\n synchronized (monitor())\n {\n check_orphaned();\n net.opengis.gml.x32.CurvePropertyType target = null;\n target = (net.opengis.gml.x32.CurvePropertyType)get_store().add_element_user(CURVEMEMBER$0);\n return target;\n }\n }","title":""},{"docid":"553f8afb2d47cda314d526be28831b9c","score":"0.58916026","text":"public net.opengis.gml.x32.OffsetCurveType getOffsetCurve()\n {\n synchronized (monitor())\n {\n check_orphaned();\n net.opengis.gml.x32.OffsetCurveType target = null;\n target = (net.opengis.gml.x32.OffsetCurveType)get_store().find_element_user(OFFSETCURVE$0, 0);\n if (target == null)\n {\n return null;\n }\n return target;\n }\n }","title":""},{"docid":"2e229f8bc935101a7d6b7b1433f59aa6","score":"0.5818953","text":"public Transition getTransitionCurve()\n {\n \treturn transitionCurve;\n }","title":""},{"docid":"74bf9572ffb10a50ec8bc482fce1b9a1","score":"0.5811373","text":"public Poly getPoly(){\n\t\t\n\t\tPolyDefault poly = new PolyDefault();\n\t\tfor(int i = 0; i < npoints; i++){\n\t\t\tpoly.add(xpoints[i], ypoints[i]);\n\t\t}\n\t\t\n\t\treturn poly;\n\t\t\n\t\t\n\t}","title":""},{"docid":"f55ea387c4ef85955b6e5358d4eeaca6","score":"0.5790397","text":"public Line2D getLine() {\n return new Line2D.Double(getP1(), getP2());\n }","title":""},{"docid":"d56d09a4a1f28b6560399a627d156fbc","score":"0.5718341","text":"public synchronized RawCurve getRaw() {\n synchronized (this.raw) {\n return this.raw;\n }\n }","title":""},{"docid":"0d9f0ef035adb9e02c6516f9cce89393","score":"0.56859905","text":"public synchronized AbstractCurve getCurve(int smooth) throws InnerException {\n synchronized (this.raw) {\n synchronized (this.smooth) {\n if (smooth == 1) {\n return this.raw;\n } else {\n for (SmoothCurve curve : this.smooth) {\n if (curve.getLevel() == smooth) {\n return curve;\n }\n }\n }\n throw new InnerException(\"Failed to retrieve curve for smooth level %d\", smooth);\n }\n }\n }","title":""},{"docid":"582af0061ade1d9eeca79cbb44439ba1","score":"0.562849","text":"IfcCurve getBasisCurve();","title":""},{"docid":"4f8b3e56a8a9c2318eef13613185b8cb","score":"0.5569177","text":"public Builder withCurve(JsonWebKeyCurveName curve) {\n this.curve = curve;\n return this;\n }","title":""},{"docid":"a4c4b2801e4ab8153ecd8adf990b881c","score":"0.5491027","text":"PriceValue getPointValue();","title":""},{"docid":"fbd7931f0ea2845682defaa4f3ee5098","score":"0.5483641","text":"public SHPPolyLine(Curve[] curve) {\n \n double xmin = curve[0].getEnvelope().getMin().getX();\n double xmax = curve[0].getEnvelope().getMax().getX();\n double ymin = curve[0].getEnvelope().getMin().getY();\n double ymax = curve[0].getEnvelope().getMax().getY();\n \n numParts = curve.length;\n \n numPoints = 0;\n \n points = new SHPPoint[numParts][];\n \n try {\n // create SHPPoints from the Points array\n for (int i = 0; i < numParts; i++) {\n \n LineString ls = curve[i].getAsLineString();\n \n numPoints += ls.getNumberOfPoints();\n \n points[i] = new SHPPoint[ls.getNumberOfPoints()];\n \n for (int j = 0; j < ls.getNumberOfPoints(); j++) {\n points[i][j] = new SHPPoint( ls.getPositionAt(j) );\n if (points[i][j].x > xmax) {\n xmax = points[i][j].x;\n } else if (points[i][j].x < xmin) {\n xmin = points[i][j].x;\n }\n if (points[i][j].y > ymax) {\n ymax = points[i][j].y;\n } else if (points[i][j].y < ymin) {\n ymin = points[i][j].y;\n }\n }\n \n }\n } catch(Exception e) {\n e.printStackTrace();\n }\n \n envelope = new SHPEnvelope(xmin,xmax,ymax,ymin);\n }","title":""},{"docid":"3231db0094b55bedbb52220a5ee3e6b1","score":"0.5463306","text":"public IfcCurve getBasisCurve() {\n return basisCurve;\n\n }","title":""},{"docid":"2bd5e56744b1088377f54d766ff27309","score":"0.53979856","text":"static public double of (org.apache.spark.rdd.RDD<scala.Tuple2<java.lang.Object, java.lang.Object>> curve) { throw new RuntimeException(); }","title":""},{"docid":"32b8a1c9f88c4e246c022a8ef1e71adf","score":"0.53891","text":"public net.opengis.gml.x32.OffsetCurveType addNewOffsetCurve()\n {\n synchronized (monitor())\n {\n check_orphaned();\n net.opengis.gml.x32.OffsetCurveType target = null;\n target = (net.opengis.gml.x32.OffsetCurveType)get_store().add_element_user(OFFSETCURVE$0);\n return target;\n }\n }","title":""},{"docid":"ab58516bc841c7df180b2a9c902270b6","score":"0.538557","text":"@Override\n\tpublic Shape getShape() {\n\t\treturn new Line2D.Double(getStartPoint().x, getStartPoint().y,\n\t\t\t\tmyNextPoint.x, myNextPoint.y);\n\t}","title":""},{"docid":"4f94f5e722228fd7e323f15b0282bd85","score":"0.5303521","text":"public org.drip.state.discount.MergedDiscountForwardCurve base()\n\t{\n\t\treturn _dcBase;\n\t}","title":""},{"docid":"01584cc220cbc102710e9397faf3e58d","score":"0.52840555","text":"public Shape shape()\r\n {\r\n return new Ellipse2D.Double(myX, myY, myWidth, myHeight);\r\n }","title":""},{"docid":"a8ea1b5e12fecae652d106985523e0c4","score":"0.52591556","text":"static public double of (scala.collection.Iterable<scala.Tuple2<java.lang.Object, java.lang.Object>> curve) { throw new RuntimeException(); }","title":""},{"docid":"f2bc1511d1903d9ebb1908ea9f70dc20","score":"0.5251917","text":"public net.opengis.gml.x32.CurvePropertyType getCurveMemberArray(int i)\n {\n synchronized (monitor())\n {\n check_orphaned();\n net.opengis.gml.x32.CurvePropertyType target = null;\n target = (net.opengis.gml.x32.CurvePropertyType)get_store().find_element_user(CURVEMEMBER$0, i);\n if (target == null)\n {\n throw new IndexOutOfBoundsException();\n }\n return target;\n }\n }","title":""},{"docid":"b42a9006666079b00165fdbf2db16d65","score":"0.5222775","text":"public abstract void curveTo(float cx1,float cy1,float cx2,float cy2,float x,float y);","title":""},{"docid":"b60c13357ebf8a26a16a1adc80a335ce","score":"0.5181427","text":"public net.opengis.gml.x32.CurvePropertyType[] getCurveMemberArray()\n {\n synchronized (monitor())\n {\n check_orphaned();\n java.util.List targetList = new java.util.ArrayList();\n get_store().find_all_element_users(CURVEMEMBER$0, targetList);\n net.opengis.gml.x32.CurvePropertyType[] result = new net.opengis.gml.x32.CurvePropertyType[targetList.size()];\n targetList.toArray(result);\n return result;\n }\n }","title":""},{"docid":"e8ccb5cdfe20bd2b636e381015c8c19d","score":"0.51584506","text":"public double getPoint() {\n\t\treturn point;\n\t}","title":""},{"docid":"af220fc0ce171af6702f13899af44ec4","score":"0.51428235","text":"public static native JsArray path2curve(String pathString)/*-{\n\treturn $wnd.Raphael.path2curve(pathString);\n}-*/;","title":""},{"docid":"d70ba44f5f6cf78a538271a0febf16b7","score":"0.51127064","text":"public net.opengis.gml.x32.CurvePropertyType insertNewCurveMember(int i)\n {\n synchronized (monitor())\n {\n check_orphaned();\n net.opengis.gml.x32.CurvePropertyType target = null;\n target = (net.opengis.gml.x32.CurvePropertyType)get_store().insert_element_user(CURVEMEMBER$0, i);\n return target;\n }\n }","title":""},{"docid":"1a76dfbb0361481d7eef0dfdfbb11760","score":"0.5110502","text":"public Point getPoint() \r\n {\r\n \treturn getP();\r\n }","title":""},{"docid":"a6af6b357c1ba7560756f0ba4bced7a6","score":"0.5102264","text":"@Generated(hash = 1154150153)\n public Points getPoint() {\n String __key = this.fn_point;\n if (point__resolvedKey == null || point__resolvedKey != __key) {\n final DaoSession daoSession = this.daoSession;\n if (daoSession == null) {\n throw new DaoException(\"Entity is detached from DAO context\");\n }\n PointsDao targetDao = daoSession.getPointsDao();\n Points pointNew = targetDao.load(__key);\n synchronized (this) {\n point = pointNew;\n point__resolvedKey = __key;\n }\n }\n return point;\n }","title":""},{"docid":"1b2bc160414f38da129b622088587897","score":"0.50780517","text":"abstract YieldAndDiscountCurve generateCurve(final String name, final YieldCurveBundle bundle, final double[] parameters);","title":""},{"docid":"fe45af75ee2008f441ae6c044bee5f73","score":"0.5074074","text":"public Shape getPointOutline() {\n\t\treturn pointOutline;\n\t}","title":""},{"docid":"1d3f2305404cbdb75059b1f8d97e1544","score":"0.506079","text":"public Object clone() {\n CurveSegment cs = null;\n\n try {\n cs = new LineStringImpl( getPositions(), getCoordinateSystem() );\n } catch ( Exception ex ) {\n LOG.logError( \"LineString_Impl.clone: \", ex );\n }\n\n return cs;\n }","title":""},{"docid":"04dfdd83588dc6465956867082ee2c92","score":"0.50521946","text":"public SurfacePlot curvatureSurfacePlot(){\n\n DeformableMesh3D mesh = getSelectedMesh();\n if(mesh==null){\n return null;\n }\n\n return new CurvatureSurfacePlot(mesh);\n }","title":""},{"docid":"de9efb1ba5756f84ae9ff9c16908c696","score":"0.50423044","text":"public BigDecimal getLinePrice() {\n return linePrice;\n }","title":""},{"docid":"85c9ba24739205ca77e942616671c9ea","score":"0.50358635","text":"public long PCurve( TopoDS_Edge edge, TopoDS_Face face, Geom2d_Curve C2d, double[] cf, double[] cl) {\n return OCCwrapJavaJNI.ShapeAnalysis_Edge_PCurve__SWIG_1(swigCPtr, this, TopoDS_Edge.getCPtr(edge), edge, TopoDS_Face.getCPtr(face), face, Geom2d_Curve.getCPtr(C2d) , C2d, cf, cl);\n }","title":""},{"docid":"9f04369d7e5a5a98fb4f255ed64f7b93","score":"0.5028467","text":"abstract YieldAndDiscountCurve generateCurve(final String name, final double[] parameters);","title":""},{"docid":"fd4fee0abe970e12f75f129c11d9382f","score":"0.50011253","text":"public double[] getPoints() {\n return (double[])points.clone();\n }","title":""},{"docid":"b5d60942aac67793520849b341efc28e","score":"0.49916175","text":"public Point point()\n\t{\n\t\treturn new Point(x, y);\n\t}","title":""},{"docid":"6c5537f8a918a044551468264d6018bc","score":"0.49884573","text":"public ComplexPolynomial derive() {\n\n\t\tComplex[] derivedFactors = new Complex[this.order()];\n\t\tfor (int i = 0; i < this.order(); i++) {\n\t\t\tderivedFactors[i] = factors.get(i).multiply(\n\t\t\t\t\tnew Complex(this.order() - i, 0));\n\t\t}\n\n\t\treturn new ComplexPolynomial(derivedFactors);\n\t}","title":""},{"docid":"44439a750d8c3d5314f522a40e67a095","score":"0.49665546","text":"public Point getPoint() {\r\n return p1;\r\n }","title":""},{"docid":"645e3085cf50160dedc281e6fb26730f","score":"0.49616006","text":"public GeneratorCurve finalGenerator(Object data) {\n return this;\n }","title":""},{"docid":"57817ad9d80d2af935893e4f3ffbffcb","score":"0.4960919","text":"public Point3D getP2() {\n return new Point3D(_p2.getX(), _p2.getY(), _p2.getZ());\n }","title":""},{"docid":"ce1300b9f4c8047e74a7d5f155b7b8d4","score":"0.4945849","text":"public IXPoint getPoint() {\r\n\t\treturn point;\r\n\t}","title":""},{"docid":"f579dd057a78fc6fbaf24e799036a2db","score":"0.49408117","text":"public BigDecimal getBaseCross()\n {\n return baseCross;\n }","title":""},{"docid":"76b66353f842d6983ff088a260489e07","score":"0.49353203","text":"public VCurve() {\n }","title":""},{"docid":"8d24f48355b69eb262a130b30187abfe","score":"0.49329412","text":"public Polynomial getPolynomial() {\n double[] mv = QuadraticClassifier.makeInteger(modelVector, 100);\n Polynomial p = new Polynomial(new Expression(\"\" + mv[0]));\n\n p = p.sum(new Polynomial(new Expression(mv[1] + \"*x\")));\n p = p.sum(new Polynomial(new Expression(mv[2] + \"*x^2\")));\n p = p.sum(new Polynomial(new Expression(mv[3] + \"*y\")));\n p = p.sum(new Polynomial(new Expression(mv[4] + \"*x*y\")));\n p = p.sum(new Polynomial(new Expression(mv[5] + \"*y^2\")));\n return p;\n }","title":""},{"docid":"ae6d7b34cfe6ee52f7e4a71d45beede9","score":"0.49311107","text":"private Point2D getP1() {\n return new Point2D.Double(getX1(), getY1());\n }","title":""},{"docid":"5f5f5fd751396ab7b285aa5c5eb738a4","score":"0.49210405","text":"public Pose2d getPose2d(){\n return new Pose2d(x, y, heading);\n }","title":""},{"docid":"969f5617e027ffb2635de3f0ef31704d","score":"0.4918696","text":"public BSpline2f getBSplineBase()\r\n {\r\n return bSplineBase;\r\n }","title":""},{"docid":"631591bffd87c9b9e7323c24f5235fe4","score":"0.49132535","text":"public BSpline2f getBSpline()\r\n {\r\n return bSpline;\r\n }","title":""},{"docid":"69f1b9ae5db0e5d0a90e840e2e8ce30b","score":"0.49039787","text":"public Complex exp() {\n return new Complex(Math.exp(x)*Math.cos(y),Math.exp(x)*Math.sin(y));\n }","title":""},{"docid":"a0a4c9715afd8bf6499d51d37fbeae5b","score":"0.48982915","text":"private Point2D getP2() {\n return new Point2D.Double(getX2(), getY2());\n }","title":""},{"docid":"20ed5ca20c2996001992b16cb19573b6","score":"0.48875105","text":"@Inject\n public CurveTo(PointFactory pointFactory) {\n this.pointFactory = pointFactory;\n }","title":""},{"docid":"18cb8bb622f548b689b4ff67a54434f2","score":"0.4868664","text":"public Polygon getShape() {\n polygon.setPosition(getX(), getY());\n polygon.setOrigin(getOriginX(), getOriginY());\n polygon.setRotation(getRotation());\n polygon.setScale(getScaleX(), getScaleY());\n return polygon;\n }","title":""},{"docid":"1876efbe9c6136a6b4f9acce65813684","score":"0.48576656","text":"public void curve(myPoint[] ara) {if(ara.length == 0){return;}beginShape(); curveVertex(ara[0]);for(int i=0;i<ara.length;++i){curveVertex(ara[i]);} curveVertex(ara[ara.length-1]);endShape();}","title":""},{"docid":"7275bdaab6963c4155dc350db9a88c41","score":"0.48439798","text":"public BezierCurve(int numPoints) {\n super();\n this.p2pCurve = null;\n this.numApproxPoints = numPoints;\n this.weight = 1;\n }","title":""},{"docid":"4e1e7678f4022297402204c93b1ab32f","score":"0.48405722","text":"public IfcCurveStyle getHatchLineAppearance() {\n return hatchLineAppearance;\n\n }","title":""},{"docid":"894e946902e4e991cbc37ae1719a7ba2","score":"0.48348522","text":"public Shape shape()\r\n {\r\n return new Rectangle2D.Double(myX, myY, myWidth, myHeight);\r\n }","title":""},{"docid":"70989fcebd5217827880a9d00e27d00d","score":"0.48283938","text":"public Point asPoint() {\n return point;\n }","title":""},{"docid":"cd76a1bcd851e61293fab9e7748bdd06","score":"0.48130268","text":"public Piece get(Point p) {\n return get(p.x.intValue(), p.y.intValue());\n }","title":""},{"docid":"2025cd12282666d8806432228ca03b76","score":"0.4810056","text":"Point2D.Double pointD()\n {\n return new Point2D.Double(x, y);\n }","title":""},{"docid":"e51ac16a78bc2ab05a3457c3f5911df0","score":"0.4796173","text":"public Point pointDouble() {\n if (this.infinity || this.y.equals(HexNum.HEX_ZERO)) {\n return new Point();\n }\n // Get slope\n HexNum slope = HexNum.HEX_THREE.mul(this.x.pow(HexNum.HEX_TWO)).div(HexNum.HEX_TWO.mul(this.y)); // λ = (3 * (x ^ 2)) / (2 * y) (% p)\n // Get x coordinate\n HexNum Rx = slope.pow(HexNum.HEX_TWO).sub(HexNum.HEX_TWO.mul(this.x)); // Rx = (λ ^ 2) - (2 * x) (% p)\n // Get y coordinate\n HexNum Ry = slope.mul(this.x.sub(Rx)).sub(this.y); // Ry = (λ * (x - Rx)) - y (% p)\n // Return the (x, y) coordinate pair as a point\n return new Point(Rx, Ry);\n }","title":""},{"docid":"66416675d3967774229fbbc4b16486aa","score":"0.4795262","text":"private Path getPathForDrawing(LinkedList<ContinuousFadingPath> pathPoints) {\n Path path = new Path();\n\n final int nCurves = pathPoints.size() - 1;\n for (int i = 0; i < nCurves; i++) {\n ContinuousFadingPath curPt = pathPoints.get(i);\n ContinuousFadingPath prevPt, nextPt, endPt;\n\n if (i == 0) {\n path.moveTo(curPt.x, curPt.y);\n }\n\n int nexti = (i + 1) % pathPoints.size();\n int previ = (i - 1 < 0 ? pathPoints.size() - 1 : i - 1);\n\n prevPt = pathPoints.get(previ);\n nextPt = pathPoints.get(nexti);\n endPt = nextPt;\n\n float dx;\n float dy;\n if (i > 0) {\n dx = (nextPt.x - curPt.x) * 0.5f;\n dx += (curPt.x - prevPt.x) * 0.5f;\n dy = (nextPt.y - curPt.y) * 0.5f;\n dy += (curPt.y - prevPt.y) * 0.5f;\n } else {\n dx = (nextPt.x - curPt.x) * 0.5f;\n dy = (nextPt.y - curPt.y) * 0.5f;\n }\n\n ContinuousFadingPath ctrlPt1 = new ContinuousFadingPath(0, 0);\n ctrlPt1.x = curPt.x + dx / 3.0f;\n ctrlPt1.y = curPt.y + dy / 3.0f;\n\n curPt = pathPoints.get(nexti);\n\n nexti = (nexti + 1) % pathPoints.size();\n previ = i;\n\n prevPt = pathPoints.get(previ);\n nextPt = pathPoints.get(nexti);\n\n if (i < nCurves - 1) {\n dx = (nextPt.x - curPt.x) * 0.5f;\n dx += (curPt.x - prevPt.x) * 0.5f;\n dy = (nextPt.y - curPt.y) * 0.5f;\n dy += (curPt.y - prevPt.y) * 0.5f;\n } else {\n dx = (nextPt.x - curPt.x) * 0.1f;\n dy = (nextPt.y - curPt.y) * 0.1f;\n }\n\n ContinuousFadingPath ctrlPt2 = new ContinuousFadingPath(0, 0);\n ctrlPt2.x = curPt.x - dx / 3.0f;\n ctrlPt2.y = curPt.y - dy / 3.0f;\n\n path.cubicTo(ctrlPt1.x, ctrlPt1.y, ctrlPt2.x, ctrlPt2.y, endPt.x, endPt.y);\n\n }\n\n return path;\n }","title":""},{"docid":"89d0a6184cfd2f9dbb0d438d234ae9f6","score":"0.4793912","text":"@Override\n public double[] getPoint() {\n double[] vec = new double[this.vec.length];\n for (int i=0; i<this.vec.length; i++)\n vec[i] = this.vec[i];\n return vec;\n }","title":""},{"docid":"15352eba5aa8611d3f2b9b83788cbefc","score":"0.47892758","text":"public void endCurve(Object Curve);","title":""},{"docid":"6b0410e4c0fae43edb1685868a462ccc","score":"0.4785464","text":"ObservablePolyglot getPolyglot();","title":""},{"docid":"f336efa8167df25f9151304ea6dec311","score":"0.47724897","text":"Point getPoint() {\n return point;\n }","title":""},{"docid":"f336efa8167df25f9151304ea6dec311","score":"0.47724897","text":"Point getPoint() {\n return point;\n }","title":""},{"docid":"6ade3e90fa81e244e190a39063167f29","score":"0.47716278","text":"public Path createPath()\n {\n // Iterate vars\n Path path = new Path(); double lx = 0, ly = 0, mx = 0, my = 0;\n\n // Iterate over segments, if any segment intersects cubic, return true\n for (Segment seg : _segs) {\n\n // If last end point was last move point, add moveTo\n if (lx == mx && ly == my)\n path.moveTo(mx = seg.x0, my = seg.y0);\n\n // Handle Seg (Line, Quad, Cubic)\n if (seg instanceof Line) { Line line = (Line) seg;\n if (mx == line.x1 && my == line.y1)\n path.close();\n else path.lineTo(lx = line.x1, ly = line.y1);\n }\n else if (seg instanceof Quad) { Quad quad = (Quad) seg;\n path.quadTo(quad.cpx, quad.cpy, lx = quad.x1, ly = quad.y1);\n }\n else if (seg instanceof Cubic) { Cubic cubic = (Cubic) seg;\n path.curveTo(cubic.cp0x, cubic.cp0y, cubic.cp1x, cubic.cp1y, lx = cubic.x1, ly = cubic.y1);\n }\n }\n\n // Return new path\n return path;\n }","title":""},{"docid":"5bb14f4fe3555eaad517281b940038b1","score":"0.47644076","text":"public void unsetCurve() {\n this.curve = null;\n }","title":""},{"docid":"88378fdab9b66548d5c57ac3b80ae845","score":"0.476293","text":"public Vect[] getPoints() {\n return points;\n }","title":""},{"docid":"aebcddcd6a4783865ec9405c2e628c7b","score":"0.4755813","text":"@Override\n public Shape copy() {\n Shape copy =\n new Ellipse(\n super.getXCoordinate(),\n super.getYCoordinate(),\n super.getWidth(),\n super.getHeight(),\n super.getColor()[0],\n super.getColor()[1],\n super.getColor()[2],\n super.getDescriptor());\n return copy;\n }","title":""},{"docid":"1cfae1b39cbd1dd9fc795bc48f0b0eb5","score":"0.4746259","text":"public void addSegmentToCurve(Object segment, Object curve);","title":""},{"docid":"c96503fe1de4c3095a4f907ed76f5a2f","score":"0.47451562","text":"Point point()\n {\n return new Point((int)x, (int)y);\n }","title":""},{"docid":"582fbee24cabb5f3832e916669d82795","score":"0.47367084","text":"public Point getPoint(){\n\t\treturn this.point;\n\t}","title":""},{"docid":"d2357f610efd229232a29aaeab8203fa","score":"0.47364187","text":"public static OriPoint getCrossPoint(\r\n Double p0,\r\n Double p1,\r\n Double q0,\r\n Double q1) {\r\n Double d0 = new Double(p1.x - p0.x, p1.y - p0.y);\r\n Double d1 = new Double(q1.x - q0.x, q1.y - q0.y);\r\n Double diff = new Double(q0.x - p0.x, q0.y - p0.y);\r\n double det = d1.x * d0.y - d1.y * d0.x;\r\n\r\n if (det * det > epsilon * xxyy(d0) * xxyy(d1)) {\r\n // Lines intersect in a single point. Return both s and t values for\r\n // use by calling functions.\r\n double invDet = 1.0 / det;\r\n double s = (d1.x * diff.y - d1.y * diff.x) * invDet;\r\n double t = (d0.x * diff.y - d0.y * diff.x) * invDet;\r\n\r\n if (t < 0.0 - epsilon || t > 1.0 + epsilon) {\r\n return null;\r\n } else if (s < 0.0 - epsilon || s > 1.0 + epsilon) {\r\n return null;\r\n } else {\r\n OriPoint cp = new OriPoint();\r\n cp.x = (1.0 - t) * q0.x + t * q1.x;\r\n cp.y = (1.0 - t) * q0.y + t * q1.y;\r\n return cp;\r\n }\r\n\r\n }\r\n return null;\r\n }","title":""},{"docid":"058f21f1b17981f72964a5728035598f","score":"0.4724791","text":"public Shape getPointFill() {\n\t\treturn pointFill;\n\t}","title":""},{"docid":"edf9cdf8b619487bf36e55f735b315f2","score":"0.47215605","text":"private static float[] getCachedPathPoints(float startPoint, float endPoint, float startCurvePoint, float endCurvePoint, float pathLength){\r\n\t\tfloat[] points = new float[Math.round(pathLength*CURVE_STEP) + 1];\r\n\t\tif(startPoint == endPoint){\r\n\t\t\tfor(int i=0; i<points.length; ++i){\r\n\t\t\t\tpoints[i] = startPoint;\r\n\t\t\t}\r\n\t\t}else{\r\n\t\t\tfloat segmentPercentage;\r\n\t\t\tfor(int i=0; i<points.length; ++i){\r\n\t\t\t\tsegmentPercentage = i/((points.length - 1)*1F);\r\n\t\t\t\tpoints[i] = (float) (Math.pow(1-segmentPercentage, 3)*startPoint + 3*Math.pow(1-segmentPercentage, 2)*segmentPercentage*startCurvePoint + 3*(1-segmentPercentage)*Math.pow(segmentPercentage, 2)*endCurvePoint + Math.pow(segmentPercentage, 3)*endPoint);\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn points;\r\n\t}","title":""},{"docid":"7f52e353a145b5aa13ed4dbfa94fb079","score":"0.47179982","text":"private Polygon getArrow() {\r\n\t\tfloat d, x1, y1, x2, y2, x3, y3, x4, y4, x5, y5, f1, f2;\r\n\t\tPoint p;\r\n\t\tPolygon polygon = new Polygon();\r\n\t\tFlowHandle lastHandle = (FlowHandle) handles.lastElement();\r\n\t\tx1 = (float) lastHandle.getX();\r\n\t\ty1 = (float) lastHandle.getY();\r\n\r\n\t\tx2 = (float) getToX();\r\n\t\ty2 = (float) getToY();\r\n\r\n\t\td = (float) Math.sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1));\r\n\r\n\t\tx3 = x2 - c_arrowLength * (x2 - x1) / d;\r\n\t\ty3 = y2 - c_arrowLength * (y2 - y1) / d;\r\n\t\tx4 = x3 + (c_arrowWidth / 2) * (y2 - y1) / d;\r\n\t\ty4 = y3 - (c_arrowLength / 2) * (x2 - x1) / d;\r\n\t\tx5 = x3 - (c_arrowLength / 2) * (y2 - y1) / d;\r\n\t\ty5 = y3 + (c_arrowLength / 2) * (x2 - x1) / d;\r\n\r\n\t\tpolygon.addPoint(Math.round(x2), Math.round(y2));\r\n\t\tpolygon.addPoint(Math.round(x4), Math.round(y4));\r\n\t\tpolygon.addPoint(Math.round(x5), Math.round(y5));\r\n\r\n\t\treturn polygon;\r\n\t}","title":""},{"docid":"03bc5a9c4fbaed72e055c2b6556ae6f6","score":"0.47167194","text":"public PiecePainter getPiecePainter() {\n return piecePainter;\n }","title":""},{"docid":"9b3219f52f263ba5f825abf599cb5824","score":"0.4715066","text":"public static Pair<Point2D[], Point2D[]> calcCurveControlPoints(Point2D[] dataPoints) {\n Point2D[] firstControlPoints;\n Point2D[] secondControlPoints;\n int n = dataPoints.length - 1;\n if (n == 1) { // Special case: Bezier curve should be a straight line.\n firstControlPoints = new Point2D[1];\n // 3P1 = 2P0 + P3\n firstControlPoints[0] = new Point2D((2 * dataPoints[0].getX() + dataPoints[1].getX()) / 3,\n (2 * dataPoints[0].getY() + dataPoints[1].getY()) / 3);\n\n secondControlPoints = new Point2D[1];\n \n secondControlPoints[0] = new Point2D(2 * firstControlPoints[0].getX() - dataPoints[0].getX(),\n 2 * firstControlPoints[0].getY() - dataPoints[0].getY());\n return new Pair<>(firstControlPoints, secondControlPoints);\n }\n\n // Calculate first Bezier control points\n // Right hand side vector\n double[] rhs = new double[n];\n\n // Set right hand side X values\n for (int i = 1; i < n - 1; ++i)\n rhs[i] = 4 * dataPoints[i].getX() + 2 * dataPoints[i + 1].getX();\n rhs[0] = dataPoints[0].getX() + 2 * dataPoints[1].getX();\n rhs[n - 1] = (8 * dataPoints[n - 1].getX() + dataPoints[n].getX()) / 2.0;\n // Get first control points X-values\n double[] x = GetFirstControlPoints(rhs);\n\n // Set right hand side Y values\n for (int i = 1; i < n - 1; ++i)\n rhs[i] = 4 * dataPoints[i].getY() + 2 * dataPoints[i + 1].getY();\n rhs[0] = dataPoints[0].getY() + 2 * dataPoints[1].getY();\n rhs[n - 1] = (8 * dataPoints[n - 1].getY() + dataPoints[n].getY()) / 2.0;\n // Get first control points Y-values\n double[] y = GetFirstControlPoints(rhs);\n\n // Fill output arrays.\n firstControlPoints = new Point2D[n];\n secondControlPoints = new Point2D[n];\n for (int i = 0; i < n; ++i) {\n // First control point\n firstControlPoints[i] = new Point2D(x[i], y[i]);\n // Second control point\n if (i < n - 1) {\n secondControlPoints[i] = new Point2D(2 * dataPoints[i + 1].getX() - x[i + 1],\n 2 * dataPoints[i + 1].getY() - y[i + 1]);\n } else {\n secondControlPoints[i] = new Point2D((dataPoints[n].getX() + x[n - 1]) / 2,\n (dataPoints[n].getY() + y[n - 1]) / 2);\n }\n }\n return new Pair<>(firstControlPoints, secondControlPoints);\n }","title":""},{"docid":"7f5d0e671efbda6886de4f697561aead","score":"0.47147405","text":"public CurveMaker() {\n\t\tthis.setSize(width, height);\n\t\tthis.setTitle(\"Left Click for Next, Right Click to Save (WARNING: WILL OVERWRITE)\");\n\t\tthis.addWindowListener(new WindowAdapter() {\n\t\t\t\n\t\t\tpublic void windowClosing(WindowEvent e) {\n\t\t\t\tSystem.exit(0);\n\t\t\t}\n\t\t});\n\t\tthis.addMouseListener(new MouseAdapter() {\n\t\t\t\n\t\t\tpublic void mouseClicked(MouseEvent e) {\n\t\t\t\tif(e.getButton() == MouseEvent.BUTTON1) { // left click\n\t\t\t\t\tSystem.out.println(\"next\");\n\t\t\t\t\tnext();\n\t\t\t\t} else if(e.getButton() == MouseEvent.BUTTON3) { // right click\n\t\t\t\t\tSystem.out.println(\"saved\");\n\t\t\t\t\tsave();\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t});\n\t\t\n\t\tcurve = new Curve(this.getWidth(), this.getHeight()); // instantiate curve\n\t\t\n\t\tnext(); // generates a Curve\n\t\tthis.setVisible(true); // shows the frame\n\t}","title":""},{"docid":"f9c1c2fa39e93146a65db6dde60393f4","score":"0.47050488","text":"@Override\n\tpublic Point clone() {\n\t\tPoint pointClone = new Point();\n\t\tpointClone.setX(this.getX());\n\t\tpointClone.setY(this.getY());\n\t\tpointClone.setForeground(this.getForeground());\n\t\treturn pointClone;\n\t}","title":""},{"docid":"0c2ff1dedeaf29a40c7e7be6ca9f39d6","score":"0.4697224","text":"public synchronized void curveTo(Point2D p1,\n Point2D p2, Point2D p3) {\n path.curveTo((float) p1.x(), (float) p1.y(), (float) p2.x(),\n (float) p2.y(), (float) p3.x(), (float) p3.y());\n }","title":""},{"docid":"e37a34fb3eec522858621cc62b2e1e22","score":"0.4695812","text":"public LineSegment getLine() {\n Coordinate point = getPoint();\n\n return new LineSegment(point, new Vector2D(point).add(\n stripFamily.getDirection()).toCoordinate());\n }","title":""},{"docid":"5958b97e0f69eae1af11faac3c2c3ca7","score":"0.4684538","text":"public Line copy() {\n\t\tLine l2 = new Line();\n\t\tfor (Point p : points) {\n\t\t\tl2.add(new Point(p.x, p.y));\n\t\t}\n\t\treturn l2;\n\t}","title":""},{"docid":"e97692c917c895bbb3d189bf604128f8","score":"0.46827903","text":"private Polygon getArrow() {\r\n\t\tfloat d, x1, y1, x2, y2, x3, y3, x4, y4, x5, y5, f1, f2;\r\n\t\tPoint p;\r\n\t\tPolygon polygon = new Polygon();\r\n\r\n\t\tx1 = (float) getX();\r\n\t\ty1 = (float) getY();\r\n\r\n\t\tx2 = (float) getToX();\r\n\t\ty2 = (float) getToY();\r\n\r\n\t\td = (float) Math.sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1));\r\n\r\n\t\tx3 = x2 - c_arrowLength * (x2 - x1) / d;\r\n\t\ty3 = y2 - c_arrowLength * (y2 - y1) / d;\r\n\t\tx4 = x3 + (c_arrowWidth / 2) * (y2 - y1) / d;\r\n\t\ty4 = y3 - (c_arrowLength / 2) * (x2 - x1) / d;\r\n\t\tx5 = x3 - (c_arrowLength / 2) * (y2 - y1) / d;\r\n\t\ty5 = y3 + (c_arrowLength / 2) * (x2 - x1) / d;\r\n\r\n\t\tpolygon.addPoint(Math.round(x2), Math.round(y2));\r\n\t\tpolygon.addPoint(Math.round(x4), Math.round(y4));\r\n\t\tpolygon.addPoint(Math.round(x5), Math.round(y5));\r\n\r\n\t\treturn polygon;\r\n\t}","title":""},{"docid":"ab02af8e052973b742c9c584c1d97b7f","score":"0.46805596","text":"public final Point getP2() {\r\n return p2;\r\n }","title":""},{"docid":"f013f197289500ebae3496302204f637","score":"0.4667107","text":"public double [] getPolynomial() {\n\t\treturn this.poly;\n\t}","title":""},{"docid":"461fcd884844e98a7813da78736f2935","score":"0.46627885","text":"private static Pair<Point2D[], Point2D[]> calcCurveControlPoints(Point2D[] dataPoints) {\n Point2D[] firstControlPoints;\n Point2D[] secondControlPoints;\n int n = dataPoints.length - 1;\n if (n == 1) { // Special case: Bezier curve should be a straight line.\n firstControlPoints = new Point2D[1];\n // 3P1 = 2P0 + P3\n firstControlPoints[0] = new Point2D((2 * dataPoints[0].getX() + dataPoints[1].getX()) / 3, (2 * dataPoints[0].getY() + dataPoints[1].getY()) / 3);\n secondControlPoints = new Point2D[1];\n // P2 = 2P1 – P0\n secondControlPoints[0] = new Point2D(2 * firstControlPoints[0].getX() - dataPoints[0].getX(), 2 * firstControlPoints[0].getY() - dataPoints[0].getY());\n return new Pair<>(firstControlPoints, secondControlPoints);\n }\n\n // Calculate first Bezier control points\n // Right hand side vector\n double[] rhs = new double[n];\n\n // Set right hand side X values\n for (int i = 1; i < n - 1; ++i) {\n rhs[i] = 4 * dataPoints[i].getX() + 2 * dataPoints[i + 1].getX();\n }\n rhs[0] = dataPoints[0].getX() + 2 * dataPoints[1].getX();\n rhs[n - 1] = (8 * dataPoints[n - 1].getX() + dataPoints[n].getX()) / 2.0;\n // Get first control points X-values\n double[] x = getFirstControlPoints(rhs);\n\n // Set right hand side Y values\n for (int i = 1; i < n - 1; ++i) {\n rhs[i] = 4 * dataPoints[i].getY() + 2 * dataPoints[i + 1].getY();\n }\n rhs[0] = dataPoints[0].getY() + 2 * dataPoints[1].getY();\n rhs[n - 1] = (8 * dataPoints[n - 1].getY() + dataPoints[n].getY()) / 2.0;\n // Get first control points Y-values\n double[] y = getFirstControlPoints(rhs);\n\n // Fill output arrays.\n firstControlPoints = new Point2D[n];\n secondControlPoints = new Point2D[n];\n for (int i = 0; i < n; ++i) {\n // First control point\n firstControlPoints[i] = new Point2D(x[i], y[i]);\n // Second control point\n if (i < n - 1) {\n secondControlPoints[i] = new Point2D(2 * dataPoints[i + 1].getX() - x[i + 1], 2 * dataPoints[i + 1].getY() - y[i + 1]);\n } else {\n secondControlPoints[i] = new Point2D((dataPoints[n].getX() + x[n - 1]) / 2, (dataPoints[n].getY() + y[n - 1]) / 2);\n }\n }\n return new Pair<>(firstControlPoints, secondControlPoints);\n }","title":""},{"docid":"39ff04e7a3ab089aaecba85b5aa0d9b3","score":"0.4656671","text":"myPoint bezierPoint(myPoint[] C, float t) {return P(bezierPoint((float)C[0].x,(float)C[1].x,(float)C[2].x,(float)C[3].x,(float)t),bezierPoint((float)C[0].y,(float)C[1].y,(float)C[2].y,(float)C[3].y,(float)t),bezierPoint((float)C[0].z,(float)C[1].z,(float)C[2].z,(float)C[3].z,(float)t)); }","title":""},{"docid":"580f69018daf23f9f54cbf49ae1f43ac","score":"0.46545187","text":"public abstract double getY();","title":""},{"docid":"a487a65386ef84a79bfe4f71620e0aea","score":"0.46529233","text":"public double[] getPolynomial() {\r\n return polynomial;\r\n }","title":""},{"docid":"679d49f2b3680397336bdfc4c729aca0","score":"0.46500528","text":"public Point getP2() {\r\n return p2;\r\n }","title":""},{"docid":"dfa16a760ba18eb127fea9fea0170ece","score":"0.46489695","text":"BigDecimal getDewPoint();","title":""}],"string":"[\n {\n \"docid\": \"b3c058f4575e2fc36da4844b9b3ffb80\",\n \"score\": \"0.7183551\",\n \"text\": \"public Curve getUnderlyingCurve() {\\n return underlyingCurve;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2259402cd9b4ad39fb3ecdb7dc18bbca\",\n \"score\": \"0.69731885\",\n \"text\": \"public CompositeCurve getCompositeCurve(){\\n\\t\\tif(cCurve == null)\\n\\t\\t\\tcCurve = new CompositeCurve(streams, merQH);\\n\\t\\treturn cCurve;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ff8381c7e1730e1fefcdc928d6b3fba7\",\n \"score\": \"0.6748695\",\n \"text\": \"@Override\\n public PointToPointCurve asPointToPoint() {\\n updateP2PCurve(this.numApproxPoints);\\n return this.p2pCurve;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3edd0d987cb6260137e51e53d72c2fd8\",\n \"score\": \"0.66042435\",\n \"text\": \"public GrandCompositeCurve getGrandCompositeCurve(){\\n\\t\\tif(gcCurve == null)\\n\\t\\t\\tgcCurve = new GrandCompositeCurve(this);\\n\\t\\treturn gcCurve;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4454e5c943d65431d1af708327106d87\",\n \"score\": \"0.6423372\",\n \"text\": \"IfcCurve getAxisCurve();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ab21781e568d688624cb0d0ed89526d4\",\n \"score\": \"0.6367628\",\n \"text\": \"public String getCurveName() {\\n return _curveName;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7fdb839fa86a7405a33188923bd8d564\",\n \"score\": \"0.63140345\",\n \"text\": \"curve createcurve();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8512c07470b92bc2503498c26e53e1ea\",\n \"score\": \"0.6105552\",\n \"text\": \"public synchronized List<AbstractCurve> getCurves() {\\n synchronized (this.raw) {\\n synchronized (this.smooth) {\\n List<AbstractCurve> result = new ArrayList<>();\\n result.add(this.raw);\\n result.addAll(this.smooth);\\n return result;\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2b98a6761acda6bce6112e1bb7daae9d\",\n \"score\": \"0.610083\",\n \"text\": \"public net.opengis.gml.x32.CurvePropertyType addNewCurveMember()\\n {\\n synchronized (monitor())\\n {\\n check_orphaned();\\n net.opengis.gml.x32.CurvePropertyType target = null;\\n target = (net.opengis.gml.x32.CurvePropertyType)get_store().add_element_user(CURVEMEMBER$0);\\n return target;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"553f8afb2d47cda314d526be28831b9c\",\n \"score\": \"0.58916026\",\n \"text\": \"public net.opengis.gml.x32.OffsetCurveType getOffsetCurve()\\n {\\n synchronized (monitor())\\n {\\n check_orphaned();\\n net.opengis.gml.x32.OffsetCurveType target = null;\\n target = (net.opengis.gml.x32.OffsetCurveType)get_store().find_element_user(OFFSETCURVE$0, 0);\\n if (target == null)\\n {\\n return null;\\n }\\n return target;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2e229f8bc935101a7d6b7b1433f59aa6\",\n \"score\": \"0.5818953\",\n \"text\": \"public Transition getTransitionCurve()\\n {\\n \\treturn transitionCurve;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"74bf9572ffb10a50ec8bc482fce1b9a1\",\n \"score\": \"0.5811373\",\n \"text\": \"public Poly getPoly(){\\n\\t\\t\\n\\t\\tPolyDefault poly = new PolyDefault();\\n\\t\\tfor(int i = 0; i < npoints; i++){\\n\\t\\t\\tpoly.add(xpoints[i], ypoints[i]);\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn poly;\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f55ea387c4ef85955b6e5358d4eeaca6\",\n \"score\": \"0.5790397\",\n \"text\": \"public Line2D getLine() {\\n return new Line2D.Double(getP1(), getP2());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d56d09a4a1f28b6560399a627d156fbc\",\n \"score\": \"0.5718341\",\n \"text\": \"public synchronized RawCurve getRaw() {\\n synchronized (this.raw) {\\n return this.raw;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0d9f0ef035adb9e02c6516f9cce89393\",\n \"score\": \"0.56859905\",\n \"text\": \"public synchronized AbstractCurve getCurve(int smooth) throws InnerException {\\n synchronized (this.raw) {\\n synchronized (this.smooth) {\\n if (smooth == 1) {\\n return this.raw;\\n } else {\\n for (SmoothCurve curve : this.smooth) {\\n if (curve.getLevel() == smooth) {\\n return curve;\\n }\\n }\\n }\\n throw new InnerException(\\\"Failed to retrieve curve for smooth level %d\\\", smooth);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"582af0061ade1d9eeca79cbb44439ba1\",\n \"score\": \"0.562849\",\n \"text\": \"IfcCurve getBasisCurve();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4f8b3e56a8a9c2318eef13613185b8cb\",\n \"score\": \"0.5569177\",\n \"text\": \"public Builder withCurve(JsonWebKeyCurveName curve) {\\n this.curve = curve;\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4c4b2801e4ab8153ecd8adf990b881c\",\n \"score\": \"0.5491027\",\n \"text\": \"PriceValue getPointValue();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fbd7931f0ea2845682defaa4f3ee5098\",\n \"score\": \"0.5483641\",\n \"text\": \"public SHPPolyLine(Curve[] curve) {\\n \\n double xmin = curve[0].getEnvelope().getMin().getX();\\n double xmax = curve[0].getEnvelope().getMax().getX();\\n double ymin = curve[0].getEnvelope().getMin().getY();\\n double ymax = curve[0].getEnvelope().getMax().getY();\\n \\n numParts = curve.length;\\n \\n numPoints = 0;\\n \\n points = new SHPPoint[numParts][];\\n \\n try {\\n // create SHPPoints from the Points array\\n for (int i = 0; i < numParts; i++) {\\n \\n LineString ls = curve[i].getAsLineString();\\n \\n numPoints += ls.getNumberOfPoints();\\n \\n points[i] = new SHPPoint[ls.getNumberOfPoints()];\\n \\n for (int j = 0; j < ls.getNumberOfPoints(); j++) {\\n points[i][j] = new SHPPoint( ls.getPositionAt(j) );\\n if (points[i][j].x > xmax) {\\n xmax = points[i][j].x;\\n } else if (points[i][j].x < xmin) {\\n xmin = points[i][j].x;\\n }\\n if (points[i][j].y > ymax) {\\n ymax = points[i][j].y;\\n } else if (points[i][j].y < ymin) {\\n ymin = points[i][j].y;\\n }\\n }\\n \\n }\\n } catch(Exception e) {\\n e.printStackTrace();\\n }\\n \\n envelope = new SHPEnvelope(xmin,xmax,ymax,ymin);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3231db0094b55bedbb52220a5ee3e6b1\",\n \"score\": \"0.5463306\",\n \"text\": \"public IfcCurve getBasisCurve() {\\n return basisCurve;\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2bd5e56744b1088377f54d766ff27309\",\n \"score\": \"0.53979856\",\n \"text\": \"static public double of (org.apache.spark.rdd.RDD<scala.Tuple2<java.lang.Object, java.lang.Object>> curve) { throw new RuntimeException(); }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"32b8a1c9f88c4e246c022a8ef1e71adf\",\n \"score\": \"0.53891\",\n \"text\": \"public net.opengis.gml.x32.OffsetCurveType addNewOffsetCurve()\\n {\\n synchronized (monitor())\\n {\\n check_orphaned();\\n net.opengis.gml.x32.OffsetCurveType target = null;\\n target = (net.opengis.gml.x32.OffsetCurveType)get_store().add_element_user(OFFSETCURVE$0);\\n return target;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ab58516bc841c7df180b2a9c902270b6\",\n \"score\": \"0.538557\",\n \"text\": \"@Override\\n\\tpublic Shape getShape() {\\n\\t\\treturn new Line2D.Double(getStartPoint().x, getStartPoint().y,\\n\\t\\t\\t\\tmyNextPoint.x, myNextPoint.y);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4f94f5e722228fd7e323f15b0282bd85\",\n \"score\": \"0.5303521\",\n \"text\": \"public org.drip.state.discount.MergedDiscountForwardCurve base()\\n\\t{\\n\\t\\treturn _dcBase;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"01584cc220cbc102710e9397faf3e58d\",\n \"score\": \"0.52840555\",\n \"text\": \"public Shape shape()\\r\\n {\\r\\n return new Ellipse2D.Double(myX, myY, myWidth, myHeight);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a8ea1b5e12fecae652d106985523e0c4\",\n \"score\": \"0.52591556\",\n \"text\": \"static public double of (scala.collection.Iterable<scala.Tuple2<java.lang.Object, java.lang.Object>> curve) { throw new RuntimeException(); }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f2bc1511d1903d9ebb1908ea9f70dc20\",\n \"score\": \"0.5251917\",\n \"text\": \"public net.opengis.gml.x32.CurvePropertyType getCurveMemberArray(int i)\\n {\\n synchronized (monitor())\\n {\\n check_orphaned();\\n net.opengis.gml.x32.CurvePropertyType target = null;\\n target = (net.opengis.gml.x32.CurvePropertyType)get_store().find_element_user(CURVEMEMBER$0, i);\\n if (target == null)\\n {\\n throw new IndexOutOfBoundsException();\\n }\\n return target;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b42a9006666079b00165fdbf2db16d65\",\n \"score\": \"0.5222775\",\n \"text\": \"public abstract void curveTo(float cx1,float cy1,float cx2,float cy2,float x,float y);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b60c13357ebf8a26a16a1adc80a335ce\",\n \"score\": \"0.5181427\",\n \"text\": \"public net.opengis.gml.x32.CurvePropertyType[] getCurveMemberArray()\\n {\\n synchronized (monitor())\\n {\\n check_orphaned();\\n java.util.List targetList = new java.util.ArrayList();\\n get_store().find_all_element_users(CURVEMEMBER$0, targetList);\\n net.opengis.gml.x32.CurvePropertyType[] result = new net.opengis.gml.x32.CurvePropertyType[targetList.size()];\\n targetList.toArray(result);\\n return result;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e8ccb5cdfe20bd2b636e381015c8c19d\",\n \"score\": \"0.51584506\",\n \"text\": \"public double getPoint() {\\n\\t\\treturn point;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"af220fc0ce171af6702f13899af44ec4\",\n \"score\": \"0.51428235\",\n \"text\": \"public static native JsArray path2curve(String pathString)/*-{\\n\\treturn $wnd.Raphael.path2curve(pathString);\\n}-*/;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d70ba44f5f6cf78a538271a0febf16b7\",\n \"score\": \"0.51127064\",\n \"text\": \"public net.opengis.gml.x32.CurvePropertyType insertNewCurveMember(int i)\\n {\\n synchronized (monitor())\\n {\\n check_orphaned();\\n net.opengis.gml.x32.CurvePropertyType target = null;\\n target = (net.opengis.gml.x32.CurvePropertyType)get_store().insert_element_user(CURVEMEMBER$0, i);\\n return target;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1a76dfbb0361481d7eef0dfdfbb11760\",\n \"score\": \"0.5110502\",\n \"text\": \"public Point getPoint() \\r\\n {\\r\\n \\treturn getP();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a6af6b357c1ba7560756f0ba4bced7a6\",\n \"score\": \"0.5102264\",\n \"text\": \"@Generated(hash = 1154150153)\\n public Points getPoint() {\\n String __key = this.fn_point;\\n if (point__resolvedKey == null || point__resolvedKey != __key) {\\n final DaoSession daoSession = this.daoSession;\\n if (daoSession == null) {\\n throw new DaoException(\\\"Entity is detached from DAO context\\\");\\n }\\n PointsDao targetDao = daoSession.getPointsDao();\\n Points pointNew = targetDao.load(__key);\\n synchronized (this) {\\n point = pointNew;\\n point__resolvedKey = __key;\\n }\\n }\\n return point;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1b2bc160414f38da129b622088587897\",\n \"score\": \"0.50780517\",\n \"text\": \"abstract YieldAndDiscountCurve generateCurve(final String name, final YieldCurveBundle bundle, final double[] parameters);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fe45af75ee2008f441ae6c044bee5f73\",\n \"score\": \"0.5074074\",\n \"text\": \"public Shape getPointOutline() {\\n\\t\\treturn pointOutline;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d3f2305404cbdb75059b1f8d97e1544\",\n \"score\": \"0.506079\",\n \"text\": \"public Object clone() {\\n CurveSegment cs = null;\\n\\n try {\\n cs = new LineStringImpl( getPositions(), getCoordinateSystem() );\\n } catch ( Exception ex ) {\\n LOG.logError( \\\"LineString_Impl.clone: \\\", ex );\\n }\\n\\n return cs;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"04dfdd83588dc6465956867082ee2c92\",\n \"score\": \"0.50521946\",\n \"text\": \"public SurfacePlot curvatureSurfacePlot(){\\n\\n DeformableMesh3D mesh = getSelectedMesh();\\n if(mesh==null){\\n return null;\\n }\\n\\n return new CurvatureSurfacePlot(mesh);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"de9efb1ba5756f84ae9ff9c16908c696\",\n \"score\": \"0.50423044\",\n \"text\": \"public BigDecimal getLinePrice() {\\n return linePrice;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"85c9ba24739205ca77e942616671c9ea\",\n \"score\": \"0.50358635\",\n \"text\": \"public long PCurve( TopoDS_Edge edge, TopoDS_Face face, Geom2d_Curve C2d, double[] cf, double[] cl) {\\n return OCCwrapJavaJNI.ShapeAnalysis_Edge_PCurve__SWIG_1(swigCPtr, this, TopoDS_Edge.getCPtr(edge), edge, TopoDS_Face.getCPtr(face), face, Geom2d_Curve.getCPtr(C2d) , C2d, cf, cl);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9f04369d7e5a5a98fb4f255ed64f7b93\",\n \"score\": \"0.5028467\",\n \"text\": \"abstract YieldAndDiscountCurve generateCurve(final String name, final double[] parameters);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fd4fee0abe970e12f75f129c11d9382f\",\n \"score\": \"0.50011253\",\n \"text\": \"public double[] getPoints() {\\n return (double[])points.clone();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b5d60942aac67793520849b341efc28e\",\n \"score\": \"0.49916175\",\n \"text\": \"public Point point()\\n\\t{\\n\\t\\treturn new Point(x, y);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6c5537f8a918a044551468264d6018bc\",\n \"score\": \"0.49884573\",\n \"text\": \"public ComplexPolynomial derive() {\\n\\n\\t\\tComplex[] derivedFactors = new Complex[this.order()];\\n\\t\\tfor (int i = 0; i < this.order(); i++) {\\n\\t\\t\\tderivedFactors[i] = factors.get(i).multiply(\\n\\t\\t\\t\\t\\tnew Complex(this.order() - i, 0));\\n\\t\\t}\\n\\n\\t\\treturn new ComplexPolynomial(derivedFactors);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"44439a750d8c3d5314f522a40e67a095\",\n \"score\": \"0.49665546\",\n \"text\": \"public Point getPoint() {\\r\\n return p1;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"645e3085cf50160dedc281e6fb26730f\",\n \"score\": \"0.49616006\",\n \"text\": \"public GeneratorCurve finalGenerator(Object data) {\\n return this;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"57817ad9d80d2af935893e4f3ffbffcb\",\n \"score\": \"0.4960919\",\n \"text\": \"public Point3D getP2() {\\n return new Point3D(_p2.getX(), _p2.getY(), _p2.getZ());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ce1300b9f4c8047e74a7d5f155b7b8d4\",\n \"score\": \"0.4945849\",\n \"text\": \"public IXPoint getPoint() {\\r\\n\\t\\treturn point;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f579dd057a78fc6fbaf24e799036a2db\",\n \"score\": \"0.49408117\",\n \"text\": \"public BigDecimal getBaseCross()\\n {\\n return baseCross;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"76b66353f842d6983ff088a260489e07\",\n \"score\": \"0.49353203\",\n \"text\": \"public VCurve() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8d24f48355b69eb262a130b30187abfe\",\n \"score\": \"0.49329412\",\n \"text\": \"public Polynomial getPolynomial() {\\n double[] mv = QuadraticClassifier.makeInteger(modelVector, 100);\\n Polynomial p = new Polynomial(new Expression(\\\"\\\" + mv[0]));\\n\\n p = p.sum(new Polynomial(new Expression(mv[1] + \\\"*x\\\")));\\n p = p.sum(new Polynomial(new Expression(mv[2] + \\\"*x^2\\\")));\\n p = p.sum(new Polynomial(new Expression(mv[3] + \\\"*y\\\")));\\n p = p.sum(new Polynomial(new Expression(mv[4] + \\\"*x*y\\\")));\\n p = p.sum(new Polynomial(new Expression(mv[5] + \\\"*y^2\\\")));\\n return p;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ae6d7b34cfe6ee52f7e4a71d45beede9\",\n \"score\": \"0.49311107\",\n \"text\": \"private Point2D getP1() {\\n return new Point2D.Double(getX1(), getY1());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5f5f5fd751396ab7b285aa5c5eb738a4\",\n \"score\": \"0.49210405\",\n \"text\": \"public Pose2d getPose2d(){\\n return new Pose2d(x, y, heading);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"969f5617e027ffb2635de3f0ef31704d\",\n \"score\": \"0.4918696\",\n \"text\": \"public BSpline2f getBSplineBase()\\r\\n {\\r\\n return bSplineBase;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"631591bffd87c9b9e7323c24f5235fe4\",\n \"score\": \"0.49132535\",\n \"text\": \"public BSpline2f getBSpline()\\r\\n {\\r\\n return bSpline;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"69f1b9ae5db0e5d0a90e840e2e8ce30b\",\n \"score\": \"0.49039787\",\n \"text\": \"public Complex exp() {\\n return new Complex(Math.exp(x)*Math.cos(y),Math.exp(x)*Math.sin(y));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a0a4c9715afd8bf6499d51d37fbeae5b\",\n \"score\": \"0.48982915\",\n \"text\": \"private Point2D getP2() {\\n return new Point2D.Double(getX2(), getY2());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"20ed5ca20c2996001992b16cb19573b6\",\n \"score\": \"0.48875105\",\n \"text\": \"@Inject\\n public CurveTo(PointFactory pointFactory) {\\n this.pointFactory = pointFactory;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"18cb8bb622f548b689b4ff67a54434f2\",\n \"score\": \"0.4868664\",\n \"text\": \"public Polygon getShape() {\\n polygon.setPosition(getX(), getY());\\n polygon.setOrigin(getOriginX(), getOriginY());\\n polygon.setRotation(getRotation());\\n polygon.setScale(getScaleX(), getScaleY());\\n return polygon;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1876efbe9c6136a6b4f9acce65813684\",\n \"score\": \"0.48576656\",\n \"text\": \"public void curve(myPoint[] ara) {if(ara.length == 0){return;}beginShape(); curveVertex(ara[0]);for(int i=0;i<ara.length;++i){curveVertex(ara[i]);} curveVertex(ara[ara.length-1]);endShape();}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7275bdaab6963c4155dc350db9a88c41\",\n \"score\": \"0.48439798\",\n \"text\": \"public BezierCurve(int numPoints) {\\n super();\\n this.p2pCurve = null;\\n this.numApproxPoints = numPoints;\\n this.weight = 1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e1e7678f4022297402204c93b1ab32f\",\n \"score\": \"0.48405722\",\n \"text\": \"public IfcCurveStyle getHatchLineAppearance() {\\n return hatchLineAppearance;\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"894e946902e4e991cbc37ae1719a7ba2\",\n \"score\": \"0.48348522\",\n \"text\": \"public Shape shape()\\r\\n {\\r\\n return new Rectangle2D.Double(myX, myY, myWidth, myHeight);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"70989fcebd5217827880a9d00e27d00d\",\n \"score\": \"0.48283938\",\n \"text\": \"public Point asPoint() {\\n return point;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd76a1bcd851e61293fab9e7748bdd06\",\n \"score\": \"0.48130268\",\n \"text\": \"public Piece get(Point p) {\\n return get(p.x.intValue(), p.y.intValue());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2025cd12282666d8806432228ca03b76\",\n \"score\": \"0.4810056\",\n \"text\": \"Point2D.Double pointD()\\n {\\n return new Point2D.Double(x, y);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e51ac16a78bc2ab05a3457c3f5911df0\",\n \"score\": \"0.4796173\",\n \"text\": \"public Point pointDouble() {\\n if (this.infinity || this.y.equals(HexNum.HEX_ZERO)) {\\n return new Point();\\n }\\n // Get slope\\n HexNum slope = HexNum.HEX_THREE.mul(this.x.pow(HexNum.HEX_TWO)).div(HexNum.HEX_TWO.mul(this.y)); // λ = (3 * (x ^ 2)) / (2 * y) (% p)\\n // Get x coordinate\\n HexNum Rx = slope.pow(HexNum.HEX_TWO).sub(HexNum.HEX_TWO.mul(this.x)); // Rx = (λ ^ 2) - (2 * x) (% p)\\n // Get y coordinate\\n HexNum Ry = slope.mul(this.x.sub(Rx)).sub(this.y); // Ry = (λ * (x - Rx)) - y (% p)\\n // Return the (x, y) coordinate pair as a point\\n return new Point(Rx, Ry);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"66416675d3967774229fbbc4b16486aa\",\n \"score\": \"0.4795262\",\n \"text\": \"private Path getPathForDrawing(LinkedList<ContinuousFadingPath> pathPoints) {\\n Path path = new Path();\\n\\n final int nCurves = pathPoints.size() - 1;\\n for (int i = 0; i < nCurves; i++) {\\n ContinuousFadingPath curPt = pathPoints.get(i);\\n ContinuousFadingPath prevPt, nextPt, endPt;\\n\\n if (i == 0) {\\n path.moveTo(curPt.x, curPt.y);\\n }\\n\\n int nexti = (i + 1) % pathPoints.size();\\n int previ = (i - 1 < 0 ? pathPoints.size() - 1 : i - 1);\\n\\n prevPt = pathPoints.get(previ);\\n nextPt = pathPoints.get(nexti);\\n endPt = nextPt;\\n\\n float dx;\\n float dy;\\n if (i > 0) {\\n dx = (nextPt.x - curPt.x) * 0.5f;\\n dx += (curPt.x - prevPt.x) * 0.5f;\\n dy = (nextPt.y - curPt.y) * 0.5f;\\n dy += (curPt.y - prevPt.y) * 0.5f;\\n } else {\\n dx = (nextPt.x - curPt.x) * 0.5f;\\n dy = (nextPt.y - curPt.y) * 0.5f;\\n }\\n\\n ContinuousFadingPath ctrlPt1 = new ContinuousFadingPath(0, 0);\\n ctrlPt1.x = curPt.x + dx / 3.0f;\\n ctrlPt1.y = curPt.y + dy / 3.0f;\\n\\n curPt = pathPoints.get(nexti);\\n\\n nexti = (nexti + 1) % pathPoints.size();\\n previ = i;\\n\\n prevPt = pathPoints.get(previ);\\n nextPt = pathPoints.get(nexti);\\n\\n if (i < nCurves - 1) {\\n dx = (nextPt.x - curPt.x) * 0.5f;\\n dx += (curPt.x - prevPt.x) * 0.5f;\\n dy = (nextPt.y - curPt.y) * 0.5f;\\n dy += (curPt.y - prevPt.y) * 0.5f;\\n } else {\\n dx = (nextPt.x - curPt.x) * 0.1f;\\n dy = (nextPt.y - curPt.y) * 0.1f;\\n }\\n\\n ContinuousFadingPath ctrlPt2 = new ContinuousFadingPath(0, 0);\\n ctrlPt2.x = curPt.x - dx / 3.0f;\\n ctrlPt2.y = curPt.y - dy / 3.0f;\\n\\n path.cubicTo(ctrlPt1.x, ctrlPt1.y, ctrlPt2.x, ctrlPt2.y, endPt.x, endPt.y);\\n\\n }\\n\\n return path;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"89d0a6184cfd2f9dbb0d438d234ae9f6\",\n \"score\": \"0.4793912\",\n \"text\": \"@Override\\n public double[] getPoint() {\\n double[] vec = new double[this.vec.length];\\n for (int i=0; i<this.vec.length; i++)\\n vec[i] = this.vec[i];\\n return vec;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"15352eba5aa8611d3f2b9b83788cbefc\",\n \"score\": \"0.47892758\",\n \"text\": \"public void endCurve(Object Curve);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6b0410e4c0fae43edb1685868a462ccc\",\n \"score\": \"0.4785464\",\n \"text\": \"ObservablePolyglot getPolyglot();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f336efa8167df25f9151304ea6dec311\",\n \"score\": \"0.47724897\",\n \"text\": \"Point getPoint() {\\n return point;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f336efa8167df25f9151304ea6dec311\",\n \"score\": \"0.47724897\",\n \"text\": \"Point getPoint() {\\n return point;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6ade3e90fa81e244e190a39063167f29\",\n \"score\": \"0.47716278\",\n \"text\": \"public Path createPath()\\n {\\n // Iterate vars\\n Path path = new Path(); double lx = 0, ly = 0, mx = 0, my = 0;\\n\\n // Iterate over segments, if any segment intersects cubic, return true\\n for (Segment seg : _segs) {\\n\\n // If last end point was last move point, add moveTo\\n if (lx == mx && ly == my)\\n path.moveTo(mx = seg.x0, my = seg.y0);\\n\\n // Handle Seg (Line, Quad, Cubic)\\n if (seg instanceof Line) { Line line = (Line) seg;\\n if (mx == line.x1 && my == line.y1)\\n path.close();\\n else path.lineTo(lx = line.x1, ly = line.y1);\\n }\\n else if (seg instanceof Quad) { Quad quad = (Quad) seg;\\n path.quadTo(quad.cpx, quad.cpy, lx = quad.x1, ly = quad.y1);\\n }\\n else if (seg instanceof Cubic) { Cubic cubic = (Cubic) seg;\\n path.curveTo(cubic.cp0x, cubic.cp0y, cubic.cp1x, cubic.cp1y, lx = cubic.x1, ly = cubic.y1);\\n }\\n }\\n\\n // Return new path\\n return path;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5bb14f4fe3555eaad517281b940038b1\",\n \"score\": \"0.47644076\",\n \"text\": \"public void unsetCurve() {\\n this.curve = null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"88378fdab9b66548d5c57ac3b80ae845\",\n \"score\": \"0.476293\",\n \"text\": \"public Vect[] getPoints() {\\n return points;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aebcddcd6a4783865ec9405c2e628c7b\",\n \"score\": \"0.4755813\",\n \"text\": \"@Override\\n public Shape copy() {\\n Shape copy =\\n new Ellipse(\\n super.getXCoordinate(),\\n super.getYCoordinate(),\\n super.getWidth(),\\n super.getHeight(),\\n super.getColor()[0],\\n super.getColor()[1],\\n super.getColor()[2],\\n super.getDescriptor());\\n return copy;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1cfae1b39cbd1dd9fc795bc48f0b0eb5\",\n \"score\": \"0.4746259\",\n \"text\": \"public void addSegmentToCurve(Object segment, Object curve);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c96503fe1de4c3095a4f907ed76f5a2f\",\n \"score\": \"0.47451562\",\n \"text\": \"Point point()\\n {\\n return new Point((int)x, (int)y);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"582fbee24cabb5f3832e916669d82795\",\n \"score\": \"0.47367084\",\n \"text\": \"public Point getPoint(){\\n\\t\\treturn this.point;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d2357f610efd229232a29aaeab8203fa\",\n \"score\": \"0.47364187\",\n \"text\": \"public static OriPoint getCrossPoint(\\r\\n Double p0,\\r\\n Double p1,\\r\\n Double q0,\\r\\n Double q1) {\\r\\n Double d0 = new Double(p1.x - p0.x, p1.y - p0.y);\\r\\n Double d1 = new Double(q1.x - q0.x, q1.y - q0.y);\\r\\n Double diff = new Double(q0.x - p0.x, q0.y - p0.y);\\r\\n double det = d1.x * d0.y - d1.y * d0.x;\\r\\n\\r\\n if (det * det > epsilon * xxyy(d0) * xxyy(d1)) {\\r\\n // Lines intersect in a single point. Return both s and t values for\\r\\n // use by calling functions.\\r\\n double invDet = 1.0 / det;\\r\\n double s = (d1.x * diff.y - d1.y * diff.x) * invDet;\\r\\n double t = (d0.x * diff.y - d0.y * diff.x) * invDet;\\r\\n\\r\\n if (t < 0.0 - epsilon || t > 1.0 + epsilon) {\\r\\n return null;\\r\\n } else if (s < 0.0 - epsilon || s > 1.0 + epsilon) {\\r\\n return null;\\r\\n } else {\\r\\n OriPoint cp = new OriPoint();\\r\\n cp.x = (1.0 - t) * q0.x + t * q1.x;\\r\\n cp.y = (1.0 - t) * q0.y + t * q1.y;\\r\\n return cp;\\r\\n }\\r\\n\\r\\n }\\r\\n return null;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"058f21f1b17981f72964a5728035598f\",\n \"score\": \"0.4724791\",\n \"text\": \"public Shape getPointFill() {\\n\\t\\treturn pointFill;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"edf9cdf8b619487bf36e55f735b315f2\",\n \"score\": \"0.47215605\",\n \"text\": \"private static float[] getCachedPathPoints(float startPoint, float endPoint, float startCurvePoint, float endCurvePoint, float pathLength){\\r\\n\\t\\tfloat[] points = new float[Math.round(pathLength*CURVE_STEP) + 1];\\r\\n\\t\\tif(startPoint == endPoint){\\r\\n\\t\\t\\tfor(int i=0; i<points.length; ++i){\\r\\n\\t\\t\\t\\tpoints[i] = startPoint;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}else{\\r\\n\\t\\t\\tfloat segmentPercentage;\\r\\n\\t\\t\\tfor(int i=0; i<points.length; ++i){\\r\\n\\t\\t\\t\\tsegmentPercentage = i/((points.length - 1)*1F);\\r\\n\\t\\t\\t\\tpoints[i] = (float) (Math.pow(1-segmentPercentage, 3)*startPoint + 3*Math.pow(1-segmentPercentage, 2)*segmentPercentage*startCurvePoint + 3*(1-segmentPercentage)*Math.pow(segmentPercentage, 2)*endCurvePoint + Math.pow(segmentPercentage, 3)*endPoint);\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\treturn points;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7f52e353a145b5aa13ed4dbfa94fb079\",\n \"score\": \"0.47179982\",\n \"text\": \"private Polygon getArrow() {\\r\\n\\t\\tfloat d, x1, y1, x2, y2, x3, y3, x4, y4, x5, y5, f1, f2;\\r\\n\\t\\tPoint p;\\r\\n\\t\\tPolygon polygon = new Polygon();\\r\\n\\t\\tFlowHandle lastHandle = (FlowHandle) handles.lastElement();\\r\\n\\t\\tx1 = (float) lastHandle.getX();\\r\\n\\t\\ty1 = (float) lastHandle.getY();\\r\\n\\r\\n\\t\\tx2 = (float) getToX();\\r\\n\\t\\ty2 = (float) getToY();\\r\\n\\r\\n\\t\\td = (float) Math.sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1));\\r\\n\\r\\n\\t\\tx3 = x2 - c_arrowLength * (x2 - x1) / d;\\r\\n\\t\\ty3 = y2 - c_arrowLength * (y2 - y1) / d;\\r\\n\\t\\tx4 = x3 + (c_arrowWidth / 2) * (y2 - y1) / d;\\r\\n\\t\\ty4 = y3 - (c_arrowLength / 2) * (x2 - x1) / d;\\r\\n\\t\\tx5 = x3 - (c_arrowLength / 2) * (y2 - y1) / d;\\r\\n\\t\\ty5 = y3 + (c_arrowLength / 2) * (x2 - x1) / d;\\r\\n\\r\\n\\t\\tpolygon.addPoint(Math.round(x2), Math.round(y2));\\r\\n\\t\\tpolygon.addPoint(Math.round(x4), Math.round(y4));\\r\\n\\t\\tpolygon.addPoint(Math.round(x5), Math.round(y5));\\r\\n\\r\\n\\t\\treturn polygon;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"03bc5a9c4fbaed72e055c2b6556ae6f6\",\n \"score\": \"0.47167194\",\n \"text\": \"public PiecePainter getPiecePainter() {\\n return piecePainter;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9b3219f52f263ba5f825abf599cb5824\",\n \"score\": \"0.4715066\",\n \"text\": \"public static Pair<Point2D[], Point2D[]> calcCurveControlPoints(Point2D[] dataPoints) {\\n Point2D[] firstControlPoints;\\n Point2D[] secondControlPoints;\\n int n = dataPoints.length - 1;\\n if (n == 1) { // Special case: Bezier curve should be a straight line.\\n firstControlPoints = new Point2D[1];\\n // 3P1 = 2P0 + P3\\n firstControlPoints[0] = new Point2D((2 * dataPoints[0].getX() + dataPoints[1].getX()) / 3,\\n (2 * dataPoints[0].getY() + dataPoints[1].getY()) / 3);\\n\\n secondControlPoints = new Point2D[1];\\n \\n secondControlPoints[0] = new Point2D(2 * firstControlPoints[0].getX() - dataPoints[0].getX(),\\n 2 * firstControlPoints[0].getY() - dataPoints[0].getY());\\n return new Pair<>(firstControlPoints, secondControlPoints);\\n }\\n\\n // Calculate first Bezier control points\\n // Right hand side vector\\n double[] rhs = new double[n];\\n\\n // Set right hand side X values\\n for (int i = 1; i < n - 1; ++i)\\n rhs[i] = 4 * dataPoints[i].getX() + 2 * dataPoints[i + 1].getX();\\n rhs[0] = dataPoints[0].getX() + 2 * dataPoints[1].getX();\\n rhs[n - 1] = (8 * dataPoints[n - 1].getX() + dataPoints[n].getX()) / 2.0;\\n // Get first control points X-values\\n double[] x = GetFirstControlPoints(rhs);\\n\\n // Set right hand side Y values\\n for (int i = 1; i < n - 1; ++i)\\n rhs[i] = 4 * dataPoints[i].getY() + 2 * dataPoints[i + 1].getY();\\n rhs[0] = dataPoints[0].getY() + 2 * dataPoints[1].getY();\\n rhs[n - 1] = (8 * dataPoints[n - 1].getY() + dataPoints[n].getY()) / 2.0;\\n // Get first control points Y-values\\n double[] y = GetFirstControlPoints(rhs);\\n\\n // Fill output arrays.\\n firstControlPoints = new Point2D[n];\\n secondControlPoints = new Point2D[n];\\n for (int i = 0; i < n; ++i) {\\n // First control point\\n firstControlPoints[i] = new Point2D(x[i], y[i]);\\n // Second control point\\n if (i < n - 1) {\\n secondControlPoints[i] = new Point2D(2 * dataPoints[i + 1].getX() - x[i + 1],\\n 2 * dataPoints[i + 1].getY() - y[i + 1]);\\n } else {\\n secondControlPoints[i] = new Point2D((dataPoints[n].getX() + x[n - 1]) / 2,\\n (dataPoints[n].getY() + y[n - 1]) / 2);\\n }\\n }\\n return new Pair<>(firstControlPoints, secondControlPoints);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7f5d0e671efbda6886de4f697561aead\",\n \"score\": \"0.47147405\",\n \"text\": \"public CurveMaker() {\\n\\t\\tthis.setSize(width, height);\\n\\t\\tthis.setTitle(\\\"Left Click for Next, Right Click to Save (WARNING: WILL OVERWRITE)\\\");\\n\\t\\tthis.addWindowListener(new WindowAdapter() {\\n\\t\\t\\t\\n\\t\\t\\tpublic void windowClosing(WindowEvent e) {\\n\\t\\t\\t\\tSystem.exit(0);\\n\\t\\t\\t}\\n\\t\\t});\\n\\t\\tthis.addMouseListener(new MouseAdapter() {\\n\\t\\t\\t\\n\\t\\t\\tpublic void mouseClicked(MouseEvent e) {\\n\\t\\t\\t\\tif(e.getButton() == MouseEvent.BUTTON1) { // left click\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"next\\\");\\n\\t\\t\\t\\t\\tnext();\\n\\t\\t\\t\\t} else if(e.getButton() == MouseEvent.BUTTON3) { // right click\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"saved\\\");\\n\\t\\t\\t\\t\\tsave();\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t});\\n\\t\\t\\n\\t\\tcurve = new Curve(this.getWidth(), this.getHeight()); // instantiate curve\\n\\t\\t\\n\\t\\tnext(); // generates a Curve\\n\\t\\tthis.setVisible(true); // shows the frame\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f9c1c2fa39e93146a65db6dde60393f4\",\n \"score\": \"0.47050488\",\n \"text\": \"@Override\\n\\tpublic Point clone() {\\n\\t\\tPoint pointClone = new Point();\\n\\t\\tpointClone.setX(this.getX());\\n\\t\\tpointClone.setY(this.getY());\\n\\t\\tpointClone.setForeground(this.getForeground());\\n\\t\\treturn pointClone;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0c2ff1dedeaf29a40c7e7be6ca9f39d6\",\n \"score\": \"0.4697224\",\n \"text\": \"public synchronized void curveTo(Point2D p1,\\n Point2D p2, Point2D p3) {\\n path.curveTo((float) p1.x(), (float) p1.y(), (float) p2.x(),\\n (float) p2.y(), (float) p3.x(), (float) p3.y());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e37a34fb3eec522858621cc62b2e1e22\",\n \"score\": \"0.4695812\",\n \"text\": \"public LineSegment getLine() {\\n Coordinate point = getPoint();\\n\\n return new LineSegment(point, new Vector2D(point).add(\\n stripFamily.getDirection()).toCoordinate());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5958b97e0f69eae1af11faac3c2c3ca7\",\n \"score\": \"0.4684538\",\n \"text\": \"public Line copy() {\\n\\t\\tLine l2 = new Line();\\n\\t\\tfor (Point p : points) {\\n\\t\\t\\tl2.add(new Point(p.x, p.y));\\n\\t\\t}\\n\\t\\treturn l2;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e97692c917c895bbb3d189bf604128f8\",\n \"score\": \"0.46827903\",\n \"text\": \"private Polygon getArrow() {\\r\\n\\t\\tfloat d, x1, y1, x2, y2, x3, y3, x4, y4, x5, y5, f1, f2;\\r\\n\\t\\tPoint p;\\r\\n\\t\\tPolygon polygon = new Polygon();\\r\\n\\r\\n\\t\\tx1 = (float) getX();\\r\\n\\t\\ty1 = (float) getY();\\r\\n\\r\\n\\t\\tx2 = (float) getToX();\\r\\n\\t\\ty2 = (float) getToY();\\r\\n\\r\\n\\t\\td = (float) Math.sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1));\\r\\n\\r\\n\\t\\tx3 = x2 - c_arrowLength * (x2 - x1) / d;\\r\\n\\t\\ty3 = y2 - c_arrowLength * (y2 - y1) / d;\\r\\n\\t\\tx4 = x3 + (c_arrowWidth / 2) * (y2 - y1) / d;\\r\\n\\t\\ty4 = y3 - (c_arrowLength / 2) * (x2 - x1) / d;\\r\\n\\t\\tx5 = x3 - (c_arrowLength / 2) * (y2 - y1) / d;\\r\\n\\t\\ty5 = y3 + (c_arrowLength / 2) * (x2 - x1) / d;\\r\\n\\r\\n\\t\\tpolygon.addPoint(Math.round(x2), Math.round(y2));\\r\\n\\t\\tpolygon.addPoint(Math.round(x4), Math.round(y4));\\r\\n\\t\\tpolygon.addPoint(Math.round(x5), Math.round(y5));\\r\\n\\r\\n\\t\\treturn polygon;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ab02af8e052973b742c9c584c1d97b7f\",\n \"score\": \"0.46805596\",\n \"text\": \"public final Point getP2() {\\r\\n return p2;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f013f197289500ebae3496302204f637\",\n \"score\": \"0.4667107\",\n \"text\": \"public double [] getPolynomial() {\\n\\t\\treturn this.poly;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"461fcd884844e98a7813da78736f2935\",\n \"score\": \"0.46627885\",\n \"text\": \"private static Pair<Point2D[], Point2D[]> calcCurveControlPoints(Point2D[] dataPoints) {\\n Point2D[] firstControlPoints;\\n Point2D[] secondControlPoints;\\n int n = dataPoints.length - 1;\\n if (n == 1) { // Special case: Bezier curve should be a straight line.\\n firstControlPoints = new Point2D[1];\\n // 3P1 = 2P0 + P3\\n firstControlPoints[0] = new Point2D((2 * dataPoints[0].getX() + dataPoints[1].getX()) / 3, (2 * dataPoints[0].getY() + dataPoints[1].getY()) / 3);\\n secondControlPoints = new Point2D[1];\\n // P2 = 2P1 – P0\\n secondControlPoints[0] = new Point2D(2 * firstControlPoints[0].getX() - dataPoints[0].getX(), 2 * firstControlPoints[0].getY() - dataPoints[0].getY());\\n return new Pair<>(firstControlPoints, secondControlPoints);\\n }\\n\\n // Calculate first Bezier control points\\n // Right hand side vector\\n double[] rhs = new double[n];\\n\\n // Set right hand side X values\\n for (int i = 1; i < n - 1; ++i) {\\n rhs[i] = 4 * dataPoints[i].getX() + 2 * dataPoints[i + 1].getX();\\n }\\n rhs[0] = dataPoints[0].getX() + 2 * dataPoints[1].getX();\\n rhs[n - 1] = (8 * dataPoints[n - 1].getX() + dataPoints[n].getX()) / 2.0;\\n // Get first control points X-values\\n double[] x = getFirstControlPoints(rhs);\\n\\n // Set right hand side Y values\\n for (int i = 1; i < n - 1; ++i) {\\n rhs[i] = 4 * dataPoints[i].getY() + 2 * dataPoints[i + 1].getY();\\n }\\n rhs[0] = dataPoints[0].getY() + 2 * dataPoints[1].getY();\\n rhs[n - 1] = (8 * dataPoints[n - 1].getY() + dataPoints[n].getY()) / 2.0;\\n // Get first control points Y-values\\n double[] y = getFirstControlPoints(rhs);\\n\\n // Fill output arrays.\\n firstControlPoints = new Point2D[n];\\n secondControlPoints = new Point2D[n];\\n for (int i = 0; i < n; ++i) {\\n // First control point\\n firstControlPoints[i] = new Point2D(x[i], y[i]);\\n // Second control point\\n if (i < n - 1) {\\n secondControlPoints[i] = new Point2D(2 * dataPoints[i + 1].getX() - x[i + 1], 2 * dataPoints[i + 1].getY() - y[i + 1]);\\n } else {\\n secondControlPoints[i] = new Point2D((dataPoints[n].getX() + x[n - 1]) / 2, (dataPoints[n].getY() + y[n - 1]) / 2);\\n }\\n }\\n return new Pair<>(firstControlPoints, secondControlPoints);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"39ff04e7a3ab089aaecba85b5aa0d9b3\",\n \"score\": \"0.4656671\",\n \"text\": \"myPoint bezierPoint(myPoint[] C, float t) {return P(bezierPoint((float)C[0].x,(float)C[1].x,(float)C[2].x,(float)C[3].x,(float)t),bezierPoint((float)C[0].y,(float)C[1].y,(float)C[2].y,(float)C[3].y,(float)t),bezierPoint((float)C[0].z,(float)C[1].z,(float)C[2].z,(float)C[3].z,(float)t)); }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"580f69018daf23f9f54cbf49ae1f43ac\",\n \"score\": \"0.46545187\",\n \"text\": \"public abstract double getY();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a487a65386ef84a79bfe4f71620e0aea\",\n \"score\": \"0.46529233\",\n \"text\": \"public double[] getPolynomial() {\\r\\n return polynomial;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"679d49f2b3680397336bdfc4c729aca0\",\n \"score\": \"0.46500528\",\n \"text\": \"public Point getP2() {\\r\\n return p2;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dfa16a760ba18eb127fea9fea0170ece\",\n \"score\": \"0.46489695\",\n \"text\": \"BigDecimal getDewPoint();\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":985394,"cells":{"query_id":{"kind":"string","value":"864126338e4a8fe7ab025a95663e342e"},"query":{"kind":"string","value":"end check left method ______________________________________________________________________________________________"},"positive_passages":{"kind":"list like","value":[{"docid":"013f596a9715305e6a9f575a1fd61077","score":"0.0","text":"public static double nextPoissonInterval(double lambda){\r\nreturn Math.log(rand.nextDouble()/(-lambda));\r\n}","title":""}],"string":"[\n {\n \"docid\": \"013f596a9715305e6a9f575a1fd61077\",\n \"score\": \"0.0\",\n \"text\": \"public static double nextPoissonInterval(double lambda){\\r\\nreturn Math.log(rand.nextDouble()/(-lambda));\\r\\n}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"e6ecf2aef08a4557dcb0a9134380fdf7","score":"0.7266574","text":"private void branchLeft()\n\t\t{\n\t\t\tif(current_branch > 0)\n\t\t\t{\n\t\t\t\tcurrent_branch--;\n\t\t\t}\n\t\t}","title":""},{"docid":"5ad65f61f33c8e4b706de14f7e9dcba0","score":"0.721778","text":"public boolean hasLeft() {\r\n return left != null;\r\n }","title":""},{"docid":"2232b4d0d749cc1e4e4a19d00d9c340b","score":"0.7173753","text":"public boolean hasLeft(){\n\t\treturn (left != null);\r\n\t}","title":""},{"docid":"d3fbce9d5f242808782ee1b04333ad73","score":"0.71209735","text":"public boolean isLeft() \r\n {\r\n return esIzquierdo; \r\n }","title":""},{"docid":"ef30c1370cea309696a8bcb7c33a9b93","score":"0.70026267","text":"boolean hasInitialLeft();","title":""},{"docid":"2e3ac496f0a4f41749c1311066020e29","score":"0.6963576","text":"private boolean isLeftOf(Entity e) {\n return !isRightOf(e);\n }","title":""},{"docid":"0eebd23b88c574c48fc333dc5a9df728","score":"0.6901807","text":"boolean hasUsableLeft();","title":""},{"docid":"10eaccbd5d5a69d05467767458529672","score":"0.6774169","text":"public void isLeft() {\r\n\t\tif (coords.get(0).x == 30) coords.set(0, new Point(630, coords.get(0).y));\r\n\r\n\t}","title":""},{"docid":"5618c9ee44fa40b20fadbf63f1245026","score":"0.6744009","text":"public boolean checkMoveLeft() {\n\t\t//if it's valid to move the piece by reducing it's column number by 1\n\t\tif (validMove(currentPiece, currentPiece.getPieceRotation(), currentGridPosition[0], currentGridPosition[1]-1) == true) {\n\t\t\tSystem.out.println(\"left true\");\n\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\tSystem.out.println(\"left false\");\n\t\t\treturn false;\n\t\t}\n\n\t}","title":""},{"docid":"864f43fa40fd6e505f0991f609d0dd3c","score":"0.6715894","text":"public boolean moveleft() {\r\n final int[][] blocks = ((AbstractPiece) myCurrentPiece).getBoardCoordinates();\r\n boolean canPass = true;\r\n\r\n // perform bounds checking on each block\r\n for (int i = 0; i < blocks.length; i++) {\r\n if (blocks[i][0] == 0 || // block is already at the left wall\r\n blockAt(blocks[i][0] - 1, blocks[i][1]) != Block.EMPTY) {\r\n // block to left is occupied\r\n canPass = false;\r\n break; // can't move, no need to keep checking\r\n }\r\n }\r\n\r\n return canPass;\r\n \r\n }","title":""},{"docid":"3ecfc04abd4ee4f31c163c89e3b29c00","score":"0.6564293","text":"public boolean isLeftNode(PredictionNode node) {\r\n\t\tfor (int i = 0; i < left.sequence.size(); i++) {\r\n\t\t\tif (node.sequence.get(i) != left.sequence.get(i)) return false;\r\n\t\t}\r\n\t\treturn true;\r\n\t}","title":""},{"docid":"495d4aa79739b6784d32e5590d57f789","score":"0.64463687","text":"@java.lang.Override\n public int getUsableLeft() {\n return usableLeft_;\n }","title":""},{"docid":"06f27e6e8f15bf7feecfd585581e3f26","score":"0.64380485","text":"public void moveLeft() {\r\n final int[][] blocks = ((AbstractPiece) myCurrentPiece).getBoardCoordinates();\r\n boolean canPass = true;\r\n\r\n // perform bounds checking on each block\r\n for (int i = 0; i < blocks.length; i++) {\r\n if (blocks[i][0] == 0 || // block is already at the left wall\r\n blockAt(blocks[i][0] - 1, blocks[i][1]) != Block.EMPTY) {\r\n // block to left is occupied\r\n canPass = false;\r\n break; // can't move, no need to keep checking\r\n }\r\n }\r\n\r\n if (canPass) {\r\n myCurrentPiece.moveLeft();\r\n setChanged();\r\n notifyObservers();\r\n }\r\n }","title":""},{"docid":"dfcda33f77fac24afa0aa53357728f17","score":"0.64379656","text":"public boolean getLeft() { return left; }","title":""},{"docid":"87558ae4b9e9ce65b2f01ed1cce68949","score":"0.6432594","text":"@java.lang.Override\n public int getUsableLeft() {\n return usableLeft_;\n }","title":""},{"docid":"cd6104de4e4a42153bcee582034038bf","score":"0.64264333","text":"public void moveLeft() {\n if (getX() > 0 && checkMove(this.getX() -1, this.getY())) {\n \tdungeon.offExit(this.getX(), this.getY());\n x().set(getX() - 1);\n afterMove(this.getX(), this.getY());\n dungeon.checkGoals();\n }\n }","title":""},{"docid":"2df8e1aa98c0a88d2aae73f4b2f75aaa","score":"0.64047694","text":"public void goLeft() throws IllegalBinaryTreeOpException\n\t{\n\t\tif(currentNode.getLeft()!= null)\t\n\t\t{\n\n\t\t\tcurrentNode = currentNode.getLeft();\n\t\t}\n\t\telse\n\t\t{\n\t\t\tthrow new IllegalBinaryTreeOpException(\"\"\n\t\t\t\t\t+ \"Cannot go left; there is no left child of this node.\");\n\t\t}\t\n\t}","title":""},{"docid":"1fd734669e24cbe85054619a5596d3c7","score":"0.6389892","text":"private boolean isLeave(BinaryTree left) {\n\n\t\tif (left == null)\n\t\t\treturn false;\n\n\t\tif (left.left == null && left.right == null)\n\t\t\treturn true;\n\n\t\treturn false;\n\t}","title":""},{"docid":"80397023d6898edc7ca6dc2f3f068d76","score":"0.638379","text":"private synchronized void nodeLeft(String leftNodeID) {\n Set<String> nodes = manager.getNodes();\n for (final Map.Entry<String, String> entry : clusterMap.entrySet()) {\n final JsonObject haInfo = new JsonObject(entry.getValue());\n String nodeID = haInfo.getString(\"node\");\n if (nodeID != null && (nodeID.equals(leftNodeID) || !nodes.contains(nodeID))) {\n toFailoverOnQuorum.add(new Runnable() {\n @Override\n public void run() {\n checkFailover(entry.getKey(), haInfo);\n }\n });\n }\n }\n }","title":""},{"docid":"db162da86675511b7b9949bc5156dcfd","score":"0.6364524","text":"public void setLeft(StudentRecord left) {\n this.left = left;\n }","title":""},{"docid":"5c04a5793046ff1e17e081aaa46e5e0a","score":"0.63507","text":"private boolean leftTurn(final Vertex<T> nextCandidate, final Vertex<T> top1, final Vertex<T> top2) {\n boolean left = false;\n\n // (X1 - X0)*(Y2 - Y0) - (X2 - X0)*(Y1 - Y0) > 0 => left turn.\n left = ((top1.getX() - top2.getX()) * (nextCandidate.getY() - top2.getY())\n - (nextCandidate.getX() - top2.getX()) * (top1.getY() - top2.getY())) > 0;\n return left;\n }","title":""},{"docid":"36054d69801591a12aa005a36644c1b4","score":"0.6311122","text":"private boolean moveLeft() {\n Location here = getLocation();\n if (direction == Location.EAST) {\n return false;\n }\n Location nextLoc = here.getAdjacentLocation(Location.WEST);\n if (cross(nextLoc)) {\n nextLoc = crossGrid(nextLoc);\n }\n return move(nextLoc);\n }","title":""},{"docid":"f30ed3b0222069fb862ce1df77250d59","score":"0.63101506","text":"public void setLeft(boolean left) {\n\t\tthis.left = left;\n\t}","title":""},{"docid":"da59644d2dd777a4a9ea85ca34896dba","score":"0.6266417","text":"public void moveLeft()\r\n {\r\n try\r\n {\r\n boolean canMove = true;\r\n for(Block b:fallingShape.getBlockList())\r\n {\r\n if(b.getX()-1<leftBound)\r\n {\r\n canMove = false;\r\n }\r\n for(Block d :nonMovingBlocks)\r\n {\r\n if(b.getX()-1==d.getX()&&b.getY()==d.getY())\r\n {\r\n canMove = false;\r\n }\r\n }\r\n }\r\n if(canMove)\r\n {\r\n fallingShape.moveLeft();\r\n }\r\n }\r\n catch(Exception ex)\r\n {\r\n ErrorLogger.logRuntimeError(\"Could not make calculations for shape to move to the left\", ex);\r\n }\r\n }","title":""},{"docid":"9b1257ceb7f2891a2073e80906fbee9c","score":"0.62637997","text":"private boolean lookLeft() {\r\n switch (robot.getRobotDir()) {\r\n case NORTH:\r\n return westFree();\r\n case EAST:\r\n return northFree();\r\n case SOUTH:\r\n return eastFree();\r\n case WEST:\r\n return southFree();\r\n }\r\n return false;\r\n }","title":""},{"docid":"4b7b3dc7a472b6cc00d65d49ea8eea5e","score":"0.62556916","text":"public StudentRecord getLeft() {\n return left;\n }","title":""},{"docid":"fa545145a650982204c3e11d6ba10889","score":"0.6253335","text":"private boolean canMoveLeft()\n {\n //Loops through the rows and the columns of the board\n for(int x = 0; x < GRID_SIZE; x++){\n for(int y = 1; y < GRID_SIZE; y++){\n \n //Checks if there is an empty space or an identical value to the\n //top of the tile and returns true if there is\n if(this.grid[x][y-1] == 0 || this.grid[x][y] == this.grid[x][y-1]){\n //Checks if the current tile is not empty and if the tile next\n //to it is not empty\n if(this.grid[x][y] != 0 && this.grid[x][y-1] != 0){\n return true;\n }\n }\n }\n }\n return false;\n }","title":""},{"docid":"a4244415eb422c183f41b2297c1d52f7","score":"0.62434876","text":"public void moveLeft() {\n // the most narrow block in the board means to the blocks in the borders.\n double narrowRec = 10;\n double x = this.paddle.getUpperLeft().getX();\n double y = this.paddle.getUpperLeft().getY();\n double width = this.paddle.getWidth();\n double height = this.paddle.getHeight();\n int paddleSpeed = this.level.paddleSpeed();\n x -= paddleSpeed;\n if (x - 6 < narrowRec) {\n // the paddle won't pass the left border block\n x = narrowRec;\n }\n Point newUpLeft = new Point(x, y);\n Rectangle newRec = new Rectangle(newUpLeft, (int) width, (int) height);\n this.paddle = newRec;\n\n }","title":""},{"docid":"e37955dbb0bca09d52e1be080770a500","score":"0.62343866","text":"int getUsableLeft();","title":""},{"docid":"917694ac1bbb554b9fa7ecffeffa15ad","score":"0.62278247","text":"public boolean leftHasBeeper(){\n turnLeft();\n super.move();\n boolean out = onABeeper();\n turnAround();\n super.move();\n turnLeft();\n return out;\n }","title":""},{"docid":"7124bb581dafb5b389121274f68ce667","score":"0.62216043","text":"private boolean cellLeft(int x, int y) {\n return gameboard.getCell(x - 1, y) == null &&\n (x - 1) >= 0;\n }","title":""},{"docid":"339ee5b00bec35ea42d43cb3aa617dbd","score":"0.62063503","text":"E deleteLeft();","title":""},{"docid":"9277313bd9fc7cb6e87303acba6e719e","score":"0.619069","text":"private boolean canMoveLeft() {\r\n //check whether we can move\r\n for (int i=0; i<GRID_SIZE; i++){\r\n for (int j=0; j<GRID_SIZE-1; j++){\r\n if((grid[i][j]==0 && grid[i][j+1]!=0) || (grid[i][j]!=0 && grid[i][j]==grid[i][j+1]))\r\n return true;\r\n\r\n }\r\n }\r\n return false;\r\n }","title":""},{"docid":"9f031426d64365a4cc60dc7fd704c596","score":"0.61841995","text":"Entry left() {\n/* 752 */ return ((this.info & 0x40000000) != 0) ? null : this.left;\n/* */ }","title":""},{"docid":"8a28ddadae016b4fce32eb1d5b1dfc39","score":"0.61821103","text":"boolean isLeft(Point other)\n {\n boolean isLeft = false;\n double xLeft = getX();\n double xLeftOther = other.getX();\n\n if(xLeft < xLeftOther)\n {\n return true;\n }\n return isLeft;\n }","title":""},{"docid":"a25679ca07900e69e884ebb40f4f2f9e","score":"0.61818945","text":"@Test public void testHasLeft(){\n BinaryNode node = new BinaryNode(\"first\");\n node.left = new BinaryNode(\"right\");\n //create a node with no left link\n BinaryNode noLink = new BinaryNode(\"no link\");\n //test passes if node with right link true and with no link false\n if(node.hasLeft()&&!noLink.hasLeft()){\n System.out.println(true); \n }else{\n System.out.println(false); \n } \n }","title":""},{"docid":"5a7a16417cdcbe2be5a5e1e8fd8dee5b","score":"0.6181763","text":"@Override\r\n\tpublic State moveLeft(Game game) {\n\t\treturn null;\r\n\t}","title":""},{"docid":"49b89a0f062c9035850fdcc6930f334d","score":"0.61667854","text":"public boolean hasUsesLeft() {\n\t\treturn usesLeft != 0;\r\n\t}","title":""},{"docid":"756f37cf7d151912e2f4004277c6e88a","score":"0.6164185","text":"public int left();","title":""},{"docid":"8893f3189f75b7118216192fc9b948e9","score":"0.6156387","text":"public void startRunningLeft() {\n isCollisionDone = false;\n isStaying = false;\n isRunningLeft = true;\n isRunningRight = false;\n isRunningUp = false;\n isRunningDown = false;\n }","title":""},{"docid":"b0b570378d4b6f326c98eeee057d1557","score":"0.61543375","text":"private void moveLeft() {\n if (blokken.size() > 1) {\n for (int i = 0; i < blokken.size() - 1; i++) {\n for (int u = 1; u <= 4; u++) {\n for (int o = 1; o <= 4; o++) {\n if (CurrentBlock.getX(u) - tileSize == blokken.get(i).getX(o) && CurrentBlock.getY(u) == blokken.get(i).getY(o)) {\n clear = false;\n }\n }\n }\n }\n }\n if (clear == true) {\n CurrentBlock.moveLeft();\n }\n clear = true;\n }","title":""},{"docid":"fc584d9a2afb6cfde4606ddd17550ba1","score":"0.6153476","text":"private boolean isLeftCloser(int[] A, int target, int left, int right) {\n if (left < 0) {\n return false;\n }\n\n if (right >= A.length) {\n return true;\n }\n\n if (target - A[left] != A[right] - target) {\n return target - A[left] < A[right] - target;\n }\n return true;\n }","title":""},{"docid":"9940fadc23283007556dd181a595a35f","score":"0.6152808","text":"private node getLeft()\n\t\t{\n\t\t\treturn left;\n\t\t}","title":""},{"docid":"458c977a6a55456f259527c9e7bbd8c9","score":"0.61478096","text":"boolean collisionLeft(MapElement checkColl);","title":""},{"docid":"bc8468c34e6daf606030f7d299f15976","score":"0.614406","text":"public goLeft_args(goLeft_args other) {\n __isset_bitfield = other.__isset_bitfield;\n this.angle = other.angle;\n }","title":""},{"docid":"71ded3caf812eed185d33a86b1a60dc6","score":"0.61266243","text":"private void checkOnePlayerLeft() {\r\n \t\t// if one player is left and he must not lose, let him win\r\n \t\tif(getNbActivePlayers() == 1) {\r\n \t\t\tPlayer remainingPlayer = playerQueue.get(0);\r\n \t\t\tif(!game.getMode().checkLoseAfterEachAction(remainingPlayer)) {\r\n \t\t\t\tif(playerQueue.get(0) == getCurrentPlayer()) {\r\n \t\t\t\t\tif(!game.getMode().checkLoseAfterOwnAction(remainingPlayer))\r\n \t\t\t\t\t\tgame.winGame(playerQueue.get(0));\r\n \t\t\t\t} else {\r\n \t\t\t\t\tgame.winGame(playerQueue.get(0));\r\n \t\t\t\t}\r\n \t\t\t}\r\n \t\t}\r\n \t}","title":""},{"docid":"19b1d2c60c67554505597bcb32aeee85","score":"0.61219394","text":"public abstract T getLeft();","title":""},{"docid":"feaed3618516e277766441ea0c8f439d","score":"0.6102692","text":"public boolean hasLeftNode() {\r\n return leftNode != null;\r\n }","title":""},{"docid":"79fa0c9ed9d970eb4631054a70fac644","score":"0.6094081","text":"public BigInteger getNumLeft () {\n\t return numLeft;\n\t }","title":""},{"docid":"866bcbf0cce7cb8cedd61bad911f079d","score":"0.6086158","text":"public void popLeft() {\n if (l.size == 0) {\n System.out.println(\"Deck is empty\");\n return;\n }\n l.deleteAtStart();\n l.display();\n }","title":""},{"docid":"77e59e39eec47782ec22c855c50f6a0c","score":"0.6081781","text":"public void setLeft(int left){\n\t\tthis.left = left;\n\t}","title":""},{"docid":"2c38050b9d6e61fbd2a808126cb37eec","score":"0.6070563","text":"public boolean left(Vector2 position){\n return position.x>destination.x;\n }","title":""},{"docid":"1371d6e8524936397c2b82abedf40285","score":"0.60660183","text":"@Field(3) \n\tpublic clingo_ast_body_aggregate left_guard(Pointer<clingo_ast_aggregate_guard > left_guard) {\n\t\tthis.io.setPointerField(this, 3, left_guard);\n\t\treturn this;\n\t}","title":""},{"docid":"091b4d80d450ce4d576cbaaec8c6c313","score":"0.60588604","text":"public boolean getLeft() {\n\t\treturn speed < 0;\n\t}","title":""},{"docid":"86509f6fe332925b855c6dc08ee5024c","score":"0.6057228","text":"public boolean moveLeft()\r\n\t{\t\t\r\n\t\tPosition p1 = getTilePosition(position.x - velocity, position.y);\r\n\r\n\t\tif(p1.x < 0)\r\n\t\t{\r\n\t\t\tif(position.x <= -24)\r\n\t\t\t\tposition.x = Game.mazeWidth * GameEngine.TILE_DIMENSION;\r\n\t\t}\t\r\n\t\telse\r\n\t\t{\r\n\r\n\t\t\tif(Game.maze.isWall(p1))\r\n\t\t\t{\r\n\t\t\t\tposition.x = (p1.x + 1) * GameEngine.TILE_DIMENSION;\r\n\r\n\t\t\t\treturn false;\r\n\t\t\t}\r\n\t\t}\r\n\t\tposition.x -= velocity;\r\n\r\n\t\treturn true;\r\n\t}","title":""},{"docid":"70ffff3127e0600d053e42ecb57ecb04","score":"0.6047181","text":"void left(Entry left) {\n/* 829 */ this.info &= 0xBFFFFFFF;\n/* 830 */ this.left = left;\n/* */ }","title":""},{"docid":"2aaf6369b883d9a2b46de8b9cb9626fa","score":"0.6038024","text":"void moveLeft(){\n if(xPosition == 0){\n System.out.println(\"You cant go left any further you igit. Now you waster your turn\");\n }\n else{\n xPosition = xPosition - 1;\n }\n }","title":""},{"docid":"d6cfab5b9b285ee6105b9c8ec1da34bb","score":"0.60323495","text":"public void checkTurn() throws NoPlayersLeftException {\r\n \t\tif(getCurrentPlayer().getActionsLeft() > 0){\r\n \t\t\tcheckStateAfterAction();\r\n \t\t\tcheckOnePlayerLeft();\r\n \t\t} else {\r\n \t\t\tcheckStateAfterTurn();\r\n \t\t\tcheckOnePlayerLeft();\n \t\t\tswitchTurn();\r\n \t\t}\r\n \t}","title":""},{"docid":"d19c32ff44f277e6df137e140c688b70","score":"0.6032001","text":"public boolean left() {\n if (placed) {\n facing = facing.getPrev();\n return true;\n }\n return false;\n }","title":""},{"docid":"f5c06cfacf406b45a42e3ab07da6376d","score":"0.6028494","text":"public BigInteger getNumLeft() {\n return numLeft;\n }","title":""},{"docid":"eee08306bb7c1a0dd436d3ea0a96b922","score":"0.6027983","text":"public void turnLeft() {\n return;\n }","title":""},{"docid":"0747a727fe66e59497f56f8840f88b52","score":"0.6027479","text":"public void leftCollideable(Entity entity) {\n invokeMethod(entity, \"left\");\n }","title":""},{"docid":"a3059a75e58c9165a507d3dd5e192340","score":"0.6018437","text":"public boolean checkLeft(int oldX, int oldY, int newX, Piece[][] field) {\n for(int xCoord = oldX-1; xCoord > newX; --xCoord) {\n Piece pieceInTheWay = field[xCoord][oldY];\n if(pieceInTheWay != null) {\n if(pieceInTheWay.getColor() == super.getColor())\n throw new IllegalArgumentException();\n else return true;\n }\n }\n if(field[newX][oldY] != null) {\n if (field[newX][oldY].getColor() == super.getColor())\n throw new IllegalArgumentException();\n else return true;\n }\n return false;\n }","title":""},{"docid":"055b4c4188b6fb99e9ccbe538ee0388d","score":"0.6016271","text":"public abstract BinTreeNode left() throws Exception;","title":""},{"docid":"2905a7f86340eb136c267816ce5a2e7f","score":"0.6014846","text":"boolean isLeftSplit();","title":""},{"docid":"728bd87e186516691f90f1bffbef393a","score":"0.6011543","text":"void setLeft(boolean x) \r\n { \r\n esIzquierdo = x; \r\n }","title":""},{"docid":"8e019aead063a4957f5188dc855e0ac0","score":"0.6007304","text":"boolean hasLeft(Position<E> p);","title":""},{"docid":"9ee7d3fa62d9ed6ee8b2fa7e7fc1d00e","score":"0.59981316","text":"public void setLeft(String left) {\n this.left = left;\n }","title":""},{"docid":"57becec75b4d8ab63b4f3bc88acb0e40","score":"0.5982257","text":"@Override\n\tpublic boolean isLeftCard(Goods goods,int goodsNo) {\n\t\treturn false;\n\t}","title":""},{"docid":"425e2a258e6def80f8061ae80f0d9ec3","score":"0.59805286","text":"public boolean canLeft(int x, int y, int size) {\r\n\t\tif (x > 0) {\r\n\t\t\tresult = true;\r\n\t\t\tfor (int i = 0; i < barriers.size(); i++) {\r\n\t\t\t\tif (this.meetBarrier(barriers.get(i), x - 5, y + 5, 1,\r\n\t\t\t\t\t\tsize - 10))\r\n\t\t\t\t\tresult = false;\r\n\t\t\t}\r\n\t\t\tfor (int i = 0; i < bombs.size(); i++) {\r\n\t\t\t\tif (this.meetBomb(bombs.get(i), x - 3, y + 5, 1, size - 10)\r\n\t\t\t\t\t\t&& this.meetBomb(bombs.get(i), x, y, size, size) == false\r\n\t\t\t\t\t\t) {\r\n\t\t\t\t\tresult = false;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\treturn result;\r\n\t\t}\r\n\t\treturn false;\r\n\t}","title":""},{"docid":"eb39bd251979429cf695497238925c59","score":"0.5978035","text":"public void rotateLeft()\r\n {\r\n try\r\n {\r\n //method in Shape class returns rotation locations\r\n boolean canMove = true;\r\n for(Block b:fallingShape.getCounterClockwiseOccupied())\r\n {\r\n for(Block d:nonMovingBlocks)\r\n {\r\n if(b.getX()==d.getX()&&b.getY()==d.getY())\r\n {\r\n canMove = false;\r\n }\r\n }\r\n if(b.getX()<leftBound||b.getX()>=rightBound||b.getY()>bottomBound)\r\n {\r\n canMove = false;\r\n }\r\n }\r\n if(canMove)\r\n {\r\n fallingShape.rotateCounterClockwise();\r\n } \r\n }\r\n catch(Exception ex)\r\n {\r\n ErrorLogger.logRuntimeError(\"Could not make calculations for shape to rotate the left\", ex);\r\n } \r\n }","title":""},{"docid":"606864c46f3d4881f7bf44c2c316af9a","score":"0.59700644","text":"public int getLeft(){\n\t\treturn left;\n\t}","title":""},{"docid":"660a1ab27ae6b7ccb2b9361281240872","score":"0.5966823","text":"public boolean hasWon() {\n return left == 0;\n }","title":""},{"docid":"bf0687d5fd23a0cbfaeaa3a45493a326","score":"0.59661037","text":"private boolean hasLeftChild(int index){return retrieveLeftChildIndex(index) < size;}","title":""},{"docid":"9b1c58b4f2b90faa43298c9f21ab0f6a","score":"0.59631133","text":"private boolean canMoveLeft() {\n //loop through each row first, then column\n for (int row = 0; row <GRID_SIZE; row++)\n {\n for (int column = 0; column < GRID_SIZE-1; column++)\n {\n int leftTile = grid[row][column];\n int rightTile = grid[row][column+1];\n\n //1st case: if the left tile is 0, and there are\n //any non zero tiles on the right of it.\n if (leftTile == 0 && rightTile > 0)\n {\n return true;\n\n //2nd case: if a tile has a value of x, and the tile on the right\n //side of the tile also has a value of x.\n }else if (leftTile >0 && rightTile >0 && leftTile == rightTile)\n {\n return true;\n }\n }\n }\n return false;\n}","title":""},{"docid":"c147f7ae61edc17171ff7441f0049f67","score":"0.5958517","text":"public void setLeft(int left) {\n this.left = left;\n }","title":""},{"docid":"c147f7ae61edc17171ff7441f0049f67","score":"0.5958517","text":"public void setLeft(int left) {\n this.left = left;\n }","title":""},{"docid":"52fbf7c26aff068b4b06156b4afff42f","score":"0.5956495","text":"@Field(3) \n\tpublic Pointer<clingo_ast_aggregate_guard > left_guard() {\n\t\treturn this.io.getPointerField(this, 3);\n\t}","title":""},{"docid":"c777c0d12dc151ddd02237cd1d214b51","score":"0.5952336","text":"public void setLeft(int left) {\r\n this.left = left;\r\n }","title":""},{"docid":"77dd06050340fde58d7861d2b671505c","score":"0.5944612","text":"public boolean shiftLeft() {\n\t\tif (isCurrPieceInvalid())\n\t\t\treturn false;\n\t\t\n\t\treturn tryMove(currX - 1, currY);\n\t}","title":""},{"docid":"2a19940ca19d83d1ba1bebb3e1d753e8","score":"0.593687","text":"public boolean turnLeft() {\n if (!this.seesWater(LEFT) && !this.seesNet(LEFT)) {\n this.turn(LEFT);\n this.hop();\n return (true);\n } \n else \n {\n return (false);\n }\n }","title":""},{"docid":"62408bfc8fc1ae47967ae5ee4a737288","score":"0.591703","text":"public User getLeft() {\n\t\treturn this.left ;\n\t}","title":""},{"docid":"231fba161d8ba77cd1cd4c598d4061f6","score":"0.5916564","text":"public int getNumOfLeft() {\n return cardLeft.size();\n }","title":""},{"docid":"2c090e4d7ac68015a39c52219df10182","score":"0.5916066","text":"public boolean hasLeftClicked()\n {\n \treturn leftClick;\n }","title":""},{"docid":"fb87918d0568513a55dccb28468a6f19","score":"0.5916035","text":"public void left() {\n\t\tvelX = -5;\r\n\t\tvelY = 0;\r\n\t}","title":""},{"docid":"50f381cd8f3b51c4fca5a2701f91cf5f","score":"0.5914857","text":"public L getLeft() {\n\t\treturn left;\n\t}","title":""},{"docid":"733e9418b691b3af674742605a54e8fc","score":"0.59124386","text":"@Override\n\tvoid left() {\n\t\tif(invurnalbilityTimer<50) {\n\t\t\tsuper.left();\n\t\t}\n\t\tif(this.x == 0 && this.moveLeft) {\n\t\t\tRoomManager.mapLeft = true;\n\t\t\tthis.x = ZeldaDungeon.WIDTH - 60;\n\t\t}\n\t}","title":""},{"docid":"d781b9b4fbfded4b03bd3ae6a6ff6eaa","score":"0.59100306","text":"private void checkLeft(boolean[][] moves, Piece[][] board, int size){\r\n\t\tfor (int i = 1; this.x - i >= 0; i++) {\r\n\t\t\tPiece piecexy = board[this.y][this.x-i];\r\n\t\t\tif (!checkLocation(moves, piecexy, this.x-i, this.y))\r\n\t\t\t\tbreak;\r\n\t\t}\r\n\t}","title":""},{"docid":"bf7db6d249b357ab0b6c1be5f40de462","score":"0.59026456","text":"public void moveLeft() {\n if (!alive())\n return;\n if (getX() <= 0)\n return;\n if (collide(getX() - 1, getY())) {\n x().set(getX() - 1);\n }\n notifyObservers();\n }","title":""},{"docid":"4fb33854eb37d8a1ef185aca7cd39f46","score":"0.5891426","text":"public int getLeft(){\n return left;\n }","title":""},{"docid":"efcb70d47c65b383c4c9ad6b50e31f66","score":"0.5888792","text":"public L getLeft() {\n return left;\n }","title":""},{"docid":"a2215fe9116f8cffb220a9d21641b9d1","score":"0.5888477","text":"public void setLeft(double left){\n\t\tthis.left = left;\n\t}","title":""},{"docid":"7b21bcd7dcfc1646058108deaa01c15d","score":"0.5884557","text":"public boolean hasLeftChild();","title":""},{"docid":"46ec0b253e815162e090e64d925d2050","score":"0.58784384","text":"private boolean canMoveLeft() {\r\n // determine the position of the element in the list\r\n for (int i = 0; i < grid.length; i++) {\r\n for (int j = 1; j < grid[i].length; j++) {\r\n // determine possibility of movement at particular index\r\n if (grid[i][j - 1] == grid[i][j] && grid[i][j - 1] != 0) {\r\n return true;\r\n } else if (grid[i][j - 1] == 0 && grid[i][j] > 0) {\r\n return true;\r\n }\r\n }\r\n }\r\n return false;\r\n }","title":""},{"docid":"c44768f8cf39319761b860930e56a044","score":"0.5878153","text":"public T getLeft() {\r\n return left;\r\n }","title":""},{"docid":"93668687b8b0f645bbb8062331ba8b0a","score":"0.5874906","text":"@Override\n\tpublic boolean getLeft() {\n\t\treturn delegate.getLeft();\n\t}","title":""},{"docid":"759f21aa28f1bc71bd52f0a0dab044dd","score":"0.58748156","text":"private boolean leftColumn() {\n\t\tGrid g=this.getGrid();\r\n\t\tObject o1=g.get(box1);\r\n\t\tObject o4=g.get(box4);\r\n\t\tObject o7=g.get(box7);\r\n\t\tif(o1==null||o4==null||o7==null){\r\n\t\t\treturn false;\r\n\t\t}\r\n\t\tif(o1==o4&&o4==o7){\r\n\t\t\tif(turn%2==1){\r\n\t\t\t\tSystem.out.println(\"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\");\r\n\t\t\t\tSystem.out.println(\"The Game is Over!\");\r\n\t\t\t\tSystem.out.println(\"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\");\r\n\t\t\t\tSystem.out.println(\"Player 1 (O) wins!\");\r\n\t\t\t\tSystem.out.println(\"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\");\r\n\t\t\t\tJOptionPane.showInputDialog(\"Player 1 Wins with 3 matching in the left column!\");\r\n\t\t\t\tScoreO++;\r\n\t\t\t}\r\n\t\t\telse{\r\n\t\t\t\tSystem.out.println(\"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\");\r\n\t\t\t\tSystem.out.println(\"The Game is Over!\");\r\n\t\t\t\tSystem.out.println(\"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\");\r\n\t\t\t\tSystem.out.println(\"Player 2 (X) wins!\");\r\n\t\t\t\tSystem.out.println(\"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\");\r\n\t\t\t\tJOptionPane.showInputDialog(\"Player 2 Wins with 3 matching in the left column!\");\r\n\t\t\t\tScoreX++;\r\n\t\t\t}\r\n\t\t\tclearBoard();\r\n\t\t\treturn true;\r\n\t\t}\r\n//\t\tif(turn == 9){\r\n//\t\t\tSystem.out.println(\"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\");\r\n//\t\t}\r\n\t\tif(o1!=o4&&o4!=o7){\r\n\t\t\tif(turn == 9){\r\n\t\t\t\tSystem.out.println(\"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\");\r\n\t\t\t\tSystem.out.println(\"The Game is Over!\");\r\n\t\t\t\tSystem.out.println(\"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\");\r\n\t\t\t\tSystem.out.println(\"It is a tie!\");\r\n\t\t\t\tSystem.out.println(\"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\");\r\n\t\t\t\tclearBoard();\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn false;\r\n\t}","title":""},{"docid":"0d16df381b0e974b9c77b4a2d0db5241","score":"0.5871268","text":"public boolean isCrossableLeft(int x, int y){\r\n\t\treturn isCrossable(x,y,Case.LEFT);\r\n\t}","title":""},{"docid":"4019bb6e1424edee6498c08eaf70c0f4","score":"0.5867028","text":"public boolean checkGoal(CANEncoder leftEncoder, CANEncoder rightEncoder)\r\n {\r\n double leftPos = -leftEncoder.getPosition()*Math.PI*WHEEL_DIAMETER/GEAR_RATIO;\r\n double rightPos = -rightEncoder.getPosition()*Math.PI*WHEEL_DIAMETER/GEAR_RATIO;\r\n\r\n return leftPos < arcLength+error && leftPos > arcLength-error && rightPos < arcLength+error && rightPos > arcLength-error;\r\n }","title":""},{"docid":"0d70a39c5e09b881bc18014dbaa87505","score":"0.58631146","text":"@VTID(15)\r\n double left();","title":""},{"docid":"23750ea31110f2d9d6bf90c683d93459","score":"0.5843208","text":"private boolean isFacingLeft() {\n\t\treturn getDirection() == Direction.LEFT;\n\t}","title":""}],"string":"[\n {\n \"docid\": \"e6ecf2aef08a4557dcb0a9134380fdf7\",\n \"score\": \"0.7266574\",\n \"text\": \"private void branchLeft()\\n\\t\\t{\\n\\t\\t\\tif(current_branch > 0)\\n\\t\\t\\t{\\n\\t\\t\\t\\tcurrent_branch--;\\n\\t\\t\\t}\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5ad65f61f33c8e4b706de14f7e9dcba0\",\n \"score\": \"0.721778\",\n \"text\": \"public boolean hasLeft() {\\r\\n return left != null;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2232b4d0d749cc1e4e4a19d00d9c340b\",\n \"score\": \"0.7173753\",\n \"text\": \"public boolean hasLeft(){\\n\\t\\treturn (left != null);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d3fbce9d5f242808782ee1b04333ad73\",\n \"score\": \"0.71209735\",\n \"text\": \"public boolean isLeft() \\r\\n {\\r\\n return esIzquierdo; \\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ef30c1370cea309696a8bcb7c33a9b93\",\n \"score\": \"0.70026267\",\n \"text\": \"boolean hasInitialLeft();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2e3ac496f0a4f41749c1311066020e29\",\n \"score\": \"0.6963576\",\n \"text\": \"private boolean isLeftOf(Entity e) {\\n return !isRightOf(e);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0eebd23b88c574c48fc333dc5a9df728\",\n \"score\": \"0.6901807\",\n \"text\": \"boolean hasUsableLeft();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"10eaccbd5d5a69d05467767458529672\",\n \"score\": \"0.6774169\",\n \"text\": \"public void isLeft() {\\r\\n\\t\\tif (coords.get(0).x == 30) coords.set(0, new Point(630, coords.get(0).y));\\r\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5618c9ee44fa40b20fadbf63f1245026\",\n \"score\": \"0.6744009\",\n \"text\": \"public boolean checkMoveLeft() {\\n\\t\\t//if it's valid to move the piece by reducing it's column number by 1\\n\\t\\tif (validMove(currentPiece, currentPiece.getPieceRotation(), currentGridPosition[0], currentGridPosition[1]-1) == true) {\\n\\t\\t\\tSystem.out.println(\\\"left true\\\");\\n\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tSystem.out.println(\\\"left false\\\");\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"864f43fa40fd6e505f0991f609d0dd3c\",\n \"score\": \"0.6715894\",\n \"text\": \"public boolean moveleft() {\\r\\n final int[][] blocks = ((AbstractPiece) myCurrentPiece).getBoardCoordinates();\\r\\n boolean canPass = true;\\r\\n\\r\\n // perform bounds checking on each block\\r\\n for (int i = 0; i < blocks.length; i++) {\\r\\n if (blocks[i][0] == 0 || // block is already at the left wall\\r\\n blockAt(blocks[i][0] - 1, blocks[i][1]) != Block.EMPTY) {\\r\\n // block to left is occupied\\r\\n canPass = false;\\r\\n break; // can't move, no need to keep checking\\r\\n }\\r\\n }\\r\\n\\r\\n return canPass;\\r\\n \\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ecfc04abd4ee4f31c163c89e3b29c00\",\n \"score\": \"0.6564293\",\n \"text\": \"public boolean isLeftNode(PredictionNode node) {\\r\\n\\t\\tfor (int i = 0; i < left.sequence.size(); i++) {\\r\\n\\t\\t\\tif (node.sequence.get(i) != left.sequence.get(i)) return false;\\r\\n\\t\\t}\\r\\n\\t\\treturn true;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"495d4aa79739b6784d32e5590d57f789\",\n \"score\": \"0.64463687\",\n \"text\": \"@java.lang.Override\\n public int getUsableLeft() {\\n return usableLeft_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"06f27e6e8f15bf7feecfd585581e3f26\",\n \"score\": \"0.64380485\",\n \"text\": \"public void moveLeft() {\\r\\n final int[][] blocks = ((AbstractPiece) myCurrentPiece).getBoardCoordinates();\\r\\n boolean canPass = true;\\r\\n\\r\\n // perform bounds checking on each block\\r\\n for (int i = 0; i < blocks.length; i++) {\\r\\n if (blocks[i][0] == 0 || // block is already at the left wall\\r\\n blockAt(blocks[i][0] - 1, blocks[i][1]) != Block.EMPTY) {\\r\\n // block to left is occupied\\r\\n canPass = false;\\r\\n break; // can't move, no need to keep checking\\r\\n }\\r\\n }\\r\\n\\r\\n if (canPass) {\\r\\n myCurrentPiece.moveLeft();\\r\\n setChanged();\\r\\n notifyObservers();\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dfcda33f77fac24afa0aa53357728f17\",\n \"score\": \"0.64379656\",\n \"text\": \"public boolean getLeft() { return left; }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"87558ae4b9e9ce65b2f01ed1cce68949\",\n \"score\": \"0.6432594\",\n \"text\": \"@java.lang.Override\\n public int getUsableLeft() {\\n return usableLeft_;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cd6104de4e4a42153bcee582034038bf\",\n \"score\": \"0.64264333\",\n \"text\": \"public void moveLeft() {\\n if (getX() > 0 && checkMove(this.getX() -1, this.getY())) {\\n \\tdungeon.offExit(this.getX(), this.getY());\\n x().set(getX() - 1);\\n afterMove(this.getX(), this.getY());\\n dungeon.checkGoals();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2df8e1aa98c0a88d2aae73f4b2f75aaa\",\n \"score\": \"0.64047694\",\n \"text\": \"public void goLeft() throws IllegalBinaryTreeOpException\\n\\t{\\n\\t\\tif(currentNode.getLeft()!= null)\\t\\n\\t\\t{\\n\\n\\t\\t\\tcurrentNode = currentNode.getLeft();\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tthrow new IllegalBinaryTreeOpException(\\\"\\\"\\n\\t\\t\\t\\t\\t+ \\\"Cannot go left; there is no left child of this node.\\\");\\n\\t\\t}\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1fd734669e24cbe85054619a5596d3c7\",\n \"score\": \"0.6389892\",\n \"text\": \"private boolean isLeave(BinaryTree left) {\\n\\n\\t\\tif (left == null)\\n\\t\\t\\treturn false;\\n\\n\\t\\tif (left.left == null && left.right == null)\\n\\t\\t\\treturn true;\\n\\n\\t\\treturn false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80397023d6898edc7ca6dc2f3f068d76\",\n \"score\": \"0.638379\",\n \"text\": \"private synchronized void nodeLeft(String leftNodeID) {\\n Set<String> nodes = manager.getNodes();\\n for (final Map.Entry<String, String> entry : clusterMap.entrySet()) {\\n final JsonObject haInfo = new JsonObject(entry.getValue());\\n String nodeID = haInfo.getString(\\\"node\\\");\\n if (nodeID != null && (nodeID.equals(leftNodeID) || !nodes.contains(nodeID))) {\\n toFailoverOnQuorum.add(new Runnable() {\\n @Override\\n public void run() {\\n checkFailover(entry.getKey(), haInfo);\\n }\\n });\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"db162da86675511b7b9949bc5156dcfd\",\n \"score\": \"0.6364524\",\n \"text\": \"public void setLeft(StudentRecord left) {\\n this.left = left;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c04a5793046ff1e17e081aaa46e5e0a\",\n \"score\": \"0.63507\",\n \"text\": \"private boolean leftTurn(final Vertex<T> nextCandidate, final Vertex<T> top1, final Vertex<T> top2) {\\n boolean left = false;\\n\\n // (X1 - X0)*(Y2 - Y0) - (X2 - X0)*(Y1 - Y0) > 0 => left turn.\\n left = ((top1.getX() - top2.getX()) * (nextCandidate.getY() - top2.getY())\\n - (nextCandidate.getX() - top2.getX()) * (top1.getY() - top2.getY())) > 0;\\n return left;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"36054d69801591a12aa005a36644c1b4\",\n \"score\": \"0.6311122\",\n \"text\": \"private boolean moveLeft() {\\n Location here = getLocation();\\n if (direction == Location.EAST) {\\n return false;\\n }\\n Location nextLoc = here.getAdjacentLocation(Location.WEST);\\n if (cross(nextLoc)) {\\n nextLoc = crossGrid(nextLoc);\\n }\\n return move(nextLoc);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f30ed3b0222069fb862ce1df77250d59\",\n \"score\": \"0.63101506\",\n \"text\": \"public void setLeft(boolean left) {\\n\\t\\tthis.left = left;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"da59644d2dd777a4a9ea85ca34896dba\",\n \"score\": \"0.6266417\",\n \"text\": \"public void moveLeft()\\r\\n {\\r\\n try\\r\\n {\\r\\n boolean canMove = true;\\r\\n for(Block b:fallingShape.getBlockList())\\r\\n {\\r\\n if(b.getX()-1<leftBound)\\r\\n {\\r\\n canMove = false;\\r\\n }\\r\\n for(Block d :nonMovingBlocks)\\r\\n {\\r\\n if(b.getX()-1==d.getX()&&b.getY()==d.getY())\\r\\n {\\r\\n canMove = false;\\r\\n }\\r\\n }\\r\\n }\\r\\n if(canMove)\\r\\n {\\r\\n fallingShape.moveLeft();\\r\\n }\\r\\n }\\r\\n catch(Exception ex)\\r\\n {\\r\\n ErrorLogger.logRuntimeError(\\\"Could not make calculations for shape to move to the left\\\", ex);\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9b1257ceb7f2891a2073e80906fbee9c\",\n \"score\": \"0.62637997\",\n \"text\": \"private boolean lookLeft() {\\r\\n switch (robot.getRobotDir()) {\\r\\n case NORTH:\\r\\n return westFree();\\r\\n case EAST:\\r\\n return northFree();\\r\\n case SOUTH:\\r\\n return eastFree();\\r\\n case WEST:\\r\\n return southFree();\\r\\n }\\r\\n return false;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4b7b3dc7a472b6cc00d65d49ea8eea5e\",\n \"score\": \"0.62556916\",\n \"text\": \"public StudentRecord getLeft() {\\n return left;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fa545145a650982204c3e11d6ba10889\",\n \"score\": \"0.6253335\",\n \"text\": \"private boolean canMoveLeft()\\n {\\n //Loops through the rows and the columns of the board\\n for(int x = 0; x < GRID_SIZE; x++){\\n for(int y = 1; y < GRID_SIZE; y++){\\n \\n //Checks if there is an empty space or an identical value to the\\n //top of the tile and returns true if there is\\n if(this.grid[x][y-1] == 0 || this.grid[x][y] == this.grid[x][y-1]){\\n //Checks if the current tile is not empty and if the tile next\\n //to it is not empty\\n if(this.grid[x][y] != 0 && this.grid[x][y-1] != 0){\\n return true;\\n }\\n }\\n }\\n }\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4244415eb422c183f41b2297c1d52f7\",\n \"score\": \"0.62434876\",\n \"text\": \"public void moveLeft() {\\n // the most narrow block in the board means to the blocks in the borders.\\n double narrowRec = 10;\\n double x = this.paddle.getUpperLeft().getX();\\n double y = this.paddle.getUpperLeft().getY();\\n double width = this.paddle.getWidth();\\n double height = this.paddle.getHeight();\\n int paddleSpeed = this.level.paddleSpeed();\\n x -= paddleSpeed;\\n if (x - 6 < narrowRec) {\\n // the paddle won't pass the left border block\\n x = narrowRec;\\n }\\n Point newUpLeft = new Point(x, y);\\n Rectangle newRec = new Rectangle(newUpLeft, (int) width, (int) height);\\n this.paddle = newRec;\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e37955dbb0bca09d52e1be080770a500\",\n \"score\": \"0.62343866\",\n \"text\": \"int getUsableLeft();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"917694ac1bbb554b9fa7ecffeffa15ad\",\n \"score\": \"0.62278247\",\n \"text\": \"public boolean leftHasBeeper(){\\n turnLeft();\\n super.move();\\n boolean out = onABeeper();\\n turnAround();\\n super.move();\\n turnLeft();\\n return out;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7124bb581dafb5b389121274f68ce667\",\n \"score\": \"0.62216043\",\n \"text\": \"private boolean cellLeft(int x, int y) {\\n return gameboard.getCell(x - 1, y) == null &&\\n (x - 1) >= 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"339ee5b00bec35ea42d43cb3aa617dbd\",\n \"score\": \"0.62063503\",\n \"text\": \"E deleteLeft();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9277313bd9fc7cb6e87303acba6e719e\",\n \"score\": \"0.619069\",\n \"text\": \"private boolean canMoveLeft() {\\r\\n //check whether we can move\\r\\n for (int i=0; i<GRID_SIZE; i++){\\r\\n for (int j=0; j<GRID_SIZE-1; j++){\\r\\n if((grid[i][j]==0 && grid[i][j+1]!=0) || (grid[i][j]!=0 && grid[i][j]==grid[i][j+1]))\\r\\n return true;\\r\\n\\r\\n }\\r\\n }\\r\\n return false;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9f031426d64365a4cc60dc7fd704c596\",\n \"score\": \"0.61841995\",\n \"text\": \"Entry left() {\\n/* 752 */ return ((this.info & 0x40000000) != 0) ? null : this.left;\\n/* */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8a28ddadae016b4fce32eb1d5b1dfc39\",\n \"score\": \"0.61821103\",\n \"text\": \"boolean isLeft(Point other)\\n {\\n boolean isLeft = false;\\n double xLeft = getX();\\n double xLeftOther = other.getX();\\n\\n if(xLeft < xLeftOther)\\n {\\n return true;\\n }\\n return isLeft;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a25679ca07900e69e884ebb40f4f2f9e\",\n \"score\": \"0.61818945\",\n \"text\": \"@Test public void testHasLeft(){\\n BinaryNode node = new BinaryNode(\\\"first\\\");\\n node.left = new BinaryNode(\\\"right\\\");\\n //create a node with no left link\\n BinaryNode noLink = new BinaryNode(\\\"no link\\\");\\n //test passes if node with right link true and with no link false\\n if(node.hasLeft()&&!noLink.hasLeft()){\\n System.out.println(true); \\n }else{\\n System.out.println(false); \\n } \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5a7a16417cdcbe2be5a5e1e8fd8dee5b\",\n \"score\": \"0.6181763\",\n \"text\": \"@Override\\r\\n\\tpublic State moveLeft(Game game) {\\n\\t\\treturn null;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"49b89a0f062c9035850fdcc6930f334d\",\n \"score\": \"0.61667854\",\n \"text\": \"public boolean hasUsesLeft() {\\n\\t\\treturn usesLeft != 0;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"756f37cf7d151912e2f4004277c6e88a\",\n \"score\": \"0.6164185\",\n \"text\": \"public int left();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8893f3189f75b7118216192fc9b948e9\",\n \"score\": \"0.6156387\",\n \"text\": \"public void startRunningLeft() {\\n isCollisionDone = false;\\n isStaying = false;\\n isRunningLeft = true;\\n isRunningRight = false;\\n isRunningUp = false;\\n isRunningDown = false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b0b570378d4b6f326c98eeee057d1557\",\n \"score\": \"0.61543375\",\n \"text\": \"private void moveLeft() {\\n if (blokken.size() > 1) {\\n for (int i = 0; i < blokken.size() - 1; i++) {\\n for (int u = 1; u <= 4; u++) {\\n for (int o = 1; o <= 4; o++) {\\n if (CurrentBlock.getX(u) - tileSize == blokken.get(i).getX(o) && CurrentBlock.getY(u) == blokken.get(i).getY(o)) {\\n clear = false;\\n }\\n }\\n }\\n }\\n }\\n if (clear == true) {\\n CurrentBlock.moveLeft();\\n }\\n clear = true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fc584d9a2afb6cfde4606ddd17550ba1\",\n \"score\": \"0.6153476\",\n \"text\": \"private boolean isLeftCloser(int[] A, int target, int left, int right) {\\n if (left < 0) {\\n return false;\\n }\\n\\n if (right >= A.length) {\\n return true;\\n }\\n\\n if (target - A[left] != A[right] - target) {\\n return target - A[left] < A[right] - target;\\n }\\n return true;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9940fadc23283007556dd181a595a35f\",\n \"score\": \"0.6152808\",\n \"text\": \"private node getLeft()\\n\\t\\t{\\n\\t\\t\\treturn left;\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"458c977a6a55456f259527c9e7bbd8c9\",\n \"score\": \"0.61478096\",\n \"text\": \"boolean collisionLeft(MapElement checkColl);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc8468c34e6daf606030f7d299f15976\",\n \"score\": \"0.614406\",\n \"text\": \"public goLeft_args(goLeft_args other) {\\n __isset_bitfield = other.__isset_bitfield;\\n this.angle = other.angle;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"71ded3caf812eed185d33a86b1a60dc6\",\n \"score\": \"0.61266243\",\n \"text\": \"private void checkOnePlayerLeft() {\\r\\n \\t\\t// if one player is left and he must not lose, let him win\\r\\n \\t\\tif(getNbActivePlayers() == 1) {\\r\\n \\t\\t\\tPlayer remainingPlayer = playerQueue.get(0);\\r\\n \\t\\t\\tif(!game.getMode().checkLoseAfterEachAction(remainingPlayer)) {\\r\\n \\t\\t\\t\\tif(playerQueue.get(0) == getCurrentPlayer()) {\\r\\n \\t\\t\\t\\t\\tif(!game.getMode().checkLoseAfterOwnAction(remainingPlayer))\\r\\n \\t\\t\\t\\t\\t\\tgame.winGame(playerQueue.get(0));\\r\\n \\t\\t\\t\\t} else {\\r\\n \\t\\t\\t\\t\\tgame.winGame(playerQueue.get(0));\\r\\n \\t\\t\\t\\t}\\r\\n \\t\\t\\t}\\r\\n \\t\\t}\\r\\n \\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"19b1d2c60c67554505597bcb32aeee85\",\n \"score\": \"0.61219394\",\n \"text\": \"public abstract T getLeft();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"feaed3618516e277766441ea0c8f439d\",\n \"score\": \"0.6102692\",\n \"text\": \"public boolean hasLeftNode() {\\r\\n return leftNode != null;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"79fa0c9ed9d970eb4631054a70fac644\",\n \"score\": \"0.6094081\",\n \"text\": \"public BigInteger getNumLeft () {\\n\\t return numLeft;\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"866bcbf0cce7cb8cedd61bad911f079d\",\n \"score\": \"0.6086158\",\n \"text\": \"public void popLeft() {\\n if (l.size == 0) {\\n System.out.println(\\\"Deck is empty\\\");\\n return;\\n }\\n l.deleteAtStart();\\n l.display();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77e59e39eec47782ec22c855c50f6a0c\",\n \"score\": \"0.6081781\",\n \"text\": \"public void setLeft(int left){\\n\\t\\tthis.left = left;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c38050b9d6e61fbd2a808126cb37eec\",\n \"score\": \"0.6070563\",\n \"text\": \"public boolean left(Vector2 position){\\n return position.x>destination.x;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1371d6e8524936397c2b82abedf40285\",\n \"score\": \"0.60660183\",\n \"text\": \"@Field(3) \\n\\tpublic clingo_ast_body_aggregate left_guard(Pointer<clingo_ast_aggregate_guard > left_guard) {\\n\\t\\tthis.io.setPointerField(this, 3, left_guard);\\n\\t\\treturn this;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"091b4d80d450ce4d576cbaaec8c6c313\",\n \"score\": \"0.60588604\",\n \"text\": \"public boolean getLeft() {\\n\\t\\treturn speed < 0;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"86509f6fe332925b855c6dc08ee5024c\",\n \"score\": \"0.6057228\",\n \"text\": \"public boolean moveLeft()\\r\\n\\t{\\t\\t\\r\\n\\t\\tPosition p1 = getTilePosition(position.x - velocity, position.y);\\r\\n\\r\\n\\t\\tif(p1.x < 0)\\r\\n\\t\\t{\\r\\n\\t\\t\\tif(position.x <= -24)\\r\\n\\t\\t\\t\\tposition.x = Game.mazeWidth * GameEngine.TILE_DIMENSION;\\r\\n\\t\\t}\\t\\r\\n\\t\\telse\\r\\n\\t\\t{\\r\\n\\r\\n\\t\\t\\tif(Game.maze.isWall(p1))\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tposition.x = (p1.x + 1) * GameEngine.TILE_DIMENSION;\\r\\n\\r\\n\\t\\t\\t\\treturn false;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\tposition.x -= velocity;\\r\\n\\r\\n\\t\\treturn true;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"70ffff3127e0600d053e42ecb57ecb04\",\n \"score\": \"0.6047181\",\n \"text\": \"void left(Entry left) {\\n/* 829 */ this.info &= 0xBFFFFFFF;\\n/* 830 */ this.left = left;\\n/* */ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2aaf6369b883d9a2b46de8b9cb9626fa\",\n \"score\": \"0.6038024\",\n \"text\": \"void moveLeft(){\\n if(xPosition == 0){\\n System.out.println(\\\"You cant go left any further you igit. Now you waster your turn\\\");\\n }\\n else{\\n xPosition = xPosition - 1;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d6cfab5b9b285ee6105b9c8ec1da34bb\",\n \"score\": \"0.60323495\",\n \"text\": \"public void checkTurn() throws NoPlayersLeftException {\\r\\n \\t\\tif(getCurrentPlayer().getActionsLeft() > 0){\\r\\n \\t\\t\\tcheckStateAfterAction();\\r\\n \\t\\t\\tcheckOnePlayerLeft();\\r\\n \\t\\t} else {\\r\\n \\t\\t\\tcheckStateAfterTurn();\\r\\n \\t\\t\\tcheckOnePlayerLeft();\\n \\t\\t\\tswitchTurn();\\r\\n \\t\\t}\\r\\n \\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d19c32ff44f277e6df137e140c688b70\",\n \"score\": \"0.6032001\",\n \"text\": \"public boolean left() {\\n if (placed) {\\n facing = facing.getPrev();\\n return true;\\n }\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f5c06cfacf406b45a42e3ab07da6376d\",\n \"score\": \"0.6028494\",\n \"text\": \"public BigInteger getNumLeft() {\\n return numLeft;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eee08306bb7c1a0dd436d3ea0a96b922\",\n \"score\": \"0.6027983\",\n \"text\": \"public void turnLeft() {\\n return;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0747a727fe66e59497f56f8840f88b52\",\n \"score\": \"0.6027479\",\n \"text\": \"public void leftCollideable(Entity entity) {\\n invokeMethod(entity, \\\"left\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a3059a75e58c9165a507d3dd5e192340\",\n \"score\": \"0.6018437\",\n \"text\": \"public boolean checkLeft(int oldX, int oldY, int newX, Piece[][] field) {\\n for(int xCoord = oldX-1; xCoord > newX; --xCoord) {\\n Piece pieceInTheWay = field[xCoord][oldY];\\n if(pieceInTheWay != null) {\\n if(pieceInTheWay.getColor() == super.getColor())\\n throw new IllegalArgumentException();\\n else return true;\\n }\\n }\\n if(field[newX][oldY] != null) {\\n if (field[newX][oldY].getColor() == super.getColor())\\n throw new IllegalArgumentException();\\n else return true;\\n }\\n return false;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"055b4c4188b6fb99e9ccbe538ee0388d\",\n \"score\": \"0.6016271\",\n \"text\": \"public abstract BinTreeNode left() throws Exception;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2905a7f86340eb136c267816ce5a2e7f\",\n \"score\": \"0.6014846\",\n \"text\": \"boolean isLeftSplit();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"728bd87e186516691f90f1bffbef393a\",\n \"score\": \"0.6011543\",\n \"text\": \"void setLeft(boolean x) \\r\\n { \\r\\n esIzquierdo = x; \\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8e019aead063a4957f5188dc855e0ac0\",\n \"score\": \"0.6007304\",\n \"text\": \"boolean hasLeft(Position<E> p);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9ee7d3fa62d9ed6ee8b2fa7e7fc1d00e\",\n \"score\": \"0.59981316\",\n \"text\": \"public void setLeft(String left) {\\n this.left = left;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"57becec75b4d8ab63b4f3bc88acb0e40\",\n \"score\": \"0.5982257\",\n \"text\": \"@Override\\n\\tpublic boolean isLeftCard(Goods goods,int goodsNo) {\\n\\t\\treturn false;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"425e2a258e6def80f8061ae80f0d9ec3\",\n \"score\": \"0.59805286\",\n \"text\": \"public boolean canLeft(int x, int y, int size) {\\r\\n\\t\\tif (x > 0) {\\r\\n\\t\\t\\tresult = true;\\r\\n\\t\\t\\tfor (int i = 0; i < barriers.size(); i++) {\\r\\n\\t\\t\\t\\tif (this.meetBarrier(barriers.get(i), x - 5, y + 5, 1,\\r\\n\\t\\t\\t\\t\\t\\tsize - 10))\\r\\n\\t\\t\\t\\t\\tresult = false;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tfor (int i = 0; i < bombs.size(); i++) {\\r\\n\\t\\t\\t\\tif (this.meetBomb(bombs.get(i), x - 3, y + 5, 1, size - 10)\\r\\n\\t\\t\\t\\t\\t\\t&& this.meetBomb(bombs.get(i), x, y, size, size) == false\\r\\n\\t\\t\\t\\t\\t\\t) {\\r\\n\\t\\t\\t\\t\\tresult = false;\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\treturn result;\\r\\n\\t\\t}\\r\\n\\t\\treturn false;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eb39bd251979429cf695497238925c59\",\n \"score\": \"0.5978035\",\n \"text\": \"public void rotateLeft()\\r\\n {\\r\\n try\\r\\n {\\r\\n //method in Shape class returns rotation locations\\r\\n boolean canMove = true;\\r\\n for(Block b:fallingShape.getCounterClockwiseOccupied())\\r\\n {\\r\\n for(Block d:nonMovingBlocks)\\r\\n {\\r\\n if(b.getX()==d.getX()&&b.getY()==d.getY())\\r\\n {\\r\\n canMove = false;\\r\\n }\\r\\n }\\r\\n if(b.getX()<leftBound||b.getX()>=rightBound||b.getY()>bottomBound)\\r\\n {\\r\\n canMove = false;\\r\\n }\\r\\n }\\r\\n if(canMove)\\r\\n {\\r\\n fallingShape.rotateCounterClockwise();\\r\\n } \\r\\n }\\r\\n catch(Exception ex)\\r\\n {\\r\\n ErrorLogger.logRuntimeError(\\\"Could not make calculations for shape to rotate the left\\\", ex);\\r\\n } \\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"606864c46f3d4881f7bf44c2c316af9a\",\n \"score\": \"0.59700644\",\n \"text\": \"public int getLeft(){\\n\\t\\treturn left;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"660a1ab27ae6b7ccb2b9361281240872\",\n \"score\": \"0.5966823\",\n \"text\": \"public boolean hasWon() {\\n return left == 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bf0687d5fd23a0cbfaeaa3a45493a326\",\n \"score\": \"0.59661037\",\n \"text\": \"private boolean hasLeftChild(int index){return retrieveLeftChildIndex(index) < size;}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9b1c58b4f2b90faa43298c9f21ab0f6a\",\n \"score\": \"0.59631133\",\n \"text\": \"private boolean canMoveLeft() {\\n //loop through each row first, then column\\n for (int row = 0; row <GRID_SIZE; row++)\\n {\\n for (int column = 0; column < GRID_SIZE-1; column++)\\n {\\n int leftTile = grid[row][column];\\n int rightTile = grid[row][column+1];\\n\\n //1st case: if the left tile is 0, and there are\\n //any non zero tiles on the right of it.\\n if (leftTile == 0 && rightTile > 0)\\n {\\n return true;\\n\\n //2nd case: if a tile has a value of x, and the tile on the right\\n //side of the tile also has a value of x.\\n }else if (leftTile >0 && rightTile >0 && leftTile == rightTile)\\n {\\n return true;\\n }\\n }\\n }\\n return false;\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c147f7ae61edc17171ff7441f0049f67\",\n \"score\": \"0.5958517\",\n \"text\": \"public void setLeft(int left) {\\n this.left = left;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c147f7ae61edc17171ff7441f0049f67\",\n \"score\": \"0.5958517\",\n \"text\": \"public void setLeft(int left) {\\n this.left = left;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"52fbf7c26aff068b4b06156b4afff42f\",\n \"score\": \"0.5956495\",\n \"text\": \"@Field(3) \\n\\tpublic Pointer<clingo_ast_aggregate_guard > left_guard() {\\n\\t\\treturn this.io.getPointerField(this, 3);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c777c0d12dc151ddd02237cd1d214b51\",\n \"score\": \"0.5952336\",\n \"text\": \"public void setLeft(int left) {\\r\\n this.left = left;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77dd06050340fde58d7861d2b671505c\",\n \"score\": \"0.5944612\",\n \"text\": \"public boolean shiftLeft() {\\n\\t\\tif (isCurrPieceInvalid())\\n\\t\\t\\treturn false;\\n\\t\\t\\n\\t\\treturn tryMove(currX - 1, currY);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2a19940ca19d83d1ba1bebb3e1d753e8\",\n \"score\": \"0.593687\",\n \"text\": \"public boolean turnLeft() {\\n if (!this.seesWater(LEFT) && !this.seesNet(LEFT)) {\\n this.turn(LEFT);\\n this.hop();\\n return (true);\\n } \\n else \\n {\\n return (false);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"62408bfc8fc1ae47967ae5ee4a737288\",\n \"score\": \"0.591703\",\n \"text\": \"public User getLeft() {\\n\\t\\treturn this.left ;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"231fba161d8ba77cd1cd4c598d4061f6\",\n \"score\": \"0.5916564\",\n \"text\": \"public int getNumOfLeft() {\\n return cardLeft.size();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c090e4d7ac68015a39c52219df10182\",\n \"score\": \"0.5916066\",\n \"text\": \"public boolean hasLeftClicked()\\n {\\n \\treturn leftClick;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fb87918d0568513a55dccb28468a6f19\",\n \"score\": \"0.5916035\",\n \"text\": \"public void left() {\\n\\t\\tvelX = -5;\\r\\n\\t\\tvelY = 0;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"50f381cd8f3b51c4fca5a2701f91cf5f\",\n \"score\": \"0.5914857\",\n \"text\": \"public L getLeft() {\\n\\t\\treturn left;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"733e9418b691b3af674742605a54e8fc\",\n \"score\": \"0.59124386\",\n \"text\": \"@Override\\n\\tvoid left() {\\n\\t\\tif(invurnalbilityTimer<50) {\\n\\t\\t\\tsuper.left();\\n\\t\\t}\\n\\t\\tif(this.x == 0 && this.moveLeft) {\\n\\t\\t\\tRoomManager.mapLeft = true;\\n\\t\\t\\tthis.x = ZeldaDungeon.WIDTH - 60;\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d781b9b4fbfded4b03bd3ae6a6ff6eaa\",\n \"score\": \"0.59100306\",\n \"text\": \"private void checkLeft(boolean[][] moves, Piece[][] board, int size){\\r\\n\\t\\tfor (int i = 1; this.x - i >= 0; i++) {\\r\\n\\t\\t\\tPiece piecexy = board[this.y][this.x-i];\\r\\n\\t\\t\\tif (!checkLocation(moves, piecexy, this.x-i, this.y))\\r\\n\\t\\t\\t\\tbreak;\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bf7db6d249b357ab0b6c1be5f40de462\",\n \"score\": \"0.59026456\",\n \"text\": \"public void moveLeft() {\\n if (!alive())\\n return;\\n if (getX() <= 0)\\n return;\\n if (collide(getX() - 1, getY())) {\\n x().set(getX() - 1);\\n }\\n notifyObservers();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4fb33854eb37d8a1ef185aca7cd39f46\",\n \"score\": \"0.5891426\",\n \"text\": \"public int getLeft(){\\n return left;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"efcb70d47c65b383c4c9ad6b50e31f66\",\n \"score\": \"0.5888792\",\n \"text\": \"public L getLeft() {\\n return left;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a2215fe9116f8cffb220a9d21641b9d1\",\n \"score\": \"0.5888477\",\n \"text\": \"public void setLeft(double left){\\n\\t\\tthis.left = left;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7b21bcd7dcfc1646058108deaa01c15d\",\n \"score\": \"0.5884557\",\n \"text\": \"public boolean hasLeftChild();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"46ec0b253e815162e090e64d925d2050\",\n \"score\": \"0.58784384\",\n \"text\": \"private boolean canMoveLeft() {\\r\\n // determine the position of the element in the list\\r\\n for (int i = 0; i < grid.length; i++) {\\r\\n for (int j = 1; j < grid[i].length; j++) {\\r\\n // determine possibility of movement at particular index\\r\\n if (grid[i][j - 1] == grid[i][j] && grid[i][j - 1] != 0) {\\r\\n return true;\\r\\n } else if (grid[i][j - 1] == 0 && grid[i][j] > 0) {\\r\\n return true;\\r\\n }\\r\\n }\\r\\n }\\r\\n return false;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c44768f8cf39319761b860930e56a044\",\n \"score\": \"0.5878153\",\n \"text\": \"public T getLeft() {\\r\\n return left;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"93668687b8b0f645bbb8062331ba8b0a\",\n \"score\": \"0.5874906\",\n \"text\": \"@Override\\n\\tpublic boolean getLeft() {\\n\\t\\treturn delegate.getLeft();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"759f21aa28f1bc71bd52f0a0dab044dd\",\n \"score\": \"0.58748156\",\n \"text\": \"private boolean leftColumn() {\\n\\t\\tGrid g=this.getGrid();\\r\\n\\t\\tObject o1=g.get(box1);\\r\\n\\t\\tObject o4=g.get(box4);\\r\\n\\t\\tObject o7=g.get(box7);\\r\\n\\t\\tif(o1==null||o4==null||o7==null){\\r\\n\\t\\t\\treturn false;\\r\\n\\t\\t}\\r\\n\\t\\tif(o1==o4&&o4==o7){\\r\\n\\t\\t\\tif(turn%2==1){\\r\\n\\t\\t\\t\\tSystem.out.println(\\\"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\\\");\\r\\n\\t\\t\\t\\tSystem.out.println(\\\"The Game is Over!\\\");\\r\\n\\t\\t\\t\\tSystem.out.println(\\\"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\\\");\\r\\n\\t\\t\\t\\tSystem.out.println(\\\"Player 1 (O) wins!\\\");\\r\\n\\t\\t\\t\\tSystem.out.println(\\\"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\\\");\\r\\n\\t\\t\\t\\tJOptionPane.showInputDialog(\\\"Player 1 Wins with 3 matching in the left column!\\\");\\r\\n\\t\\t\\t\\tScoreO++;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse{\\r\\n\\t\\t\\t\\tSystem.out.println(\\\"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\\\");\\r\\n\\t\\t\\t\\tSystem.out.println(\\\"The Game is Over!\\\");\\r\\n\\t\\t\\t\\tSystem.out.println(\\\"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\\\");\\r\\n\\t\\t\\t\\tSystem.out.println(\\\"Player 2 (X) wins!\\\");\\r\\n\\t\\t\\t\\tSystem.out.println(\\\"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\\\");\\r\\n\\t\\t\\t\\tJOptionPane.showInputDialog(\\\"Player 2 Wins with 3 matching in the left column!\\\");\\r\\n\\t\\t\\t\\tScoreX++;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tclearBoard();\\r\\n\\t\\t\\treturn true;\\r\\n\\t\\t}\\r\\n//\\t\\tif(turn == 9){\\r\\n//\\t\\t\\tSystem.out.println(\\\"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\\\");\\r\\n//\\t\\t}\\r\\n\\t\\tif(o1!=o4&&o4!=o7){\\r\\n\\t\\t\\tif(turn == 9){\\r\\n\\t\\t\\t\\tSystem.out.println(\\\"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\\\");\\r\\n\\t\\t\\t\\tSystem.out.println(\\\"The Game is Over!\\\");\\r\\n\\t\\t\\t\\tSystem.out.println(\\\"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\\\");\\r\\n\\t\\t\\t\\tSystem.out.println(\\\"It is a tie!\\\");\\r\\n\\t\\t\\t\\tSystem.out.println(\\\"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\\\");\\r\\n\\t\\t\\t\\tclearBoard();\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\treturn false;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0d16df381b0e974b9c77b4a2d0db5241\",\n \"score\": \"0.5871268\",\n \"text\": \"public boolean isCrossableLeft(int x, int y){\\r\\n\\t\\treturn isCrossable(x,y,Case.LEFT);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4019bb6e1424edee6498c08eaf70c0f4\",\n \"score\": \"0.5867028\",\n \"text\": \"public boolean checkGoal(CANEncoder leftEncoder, CANEncoder rightEncoder)\\r\\n {\\r\\n double leftPos = -leftEncoder.getPosition()*Math.PI*WHEEL_DIAMETER/GEAR_RATIO;\\r\\n double rightPos = -rightEncoder.getPosition()*Math.PI*WHEEL_DIAMETER/GEAR_RATIO;\\r\\n\\r\\n return leftPos < arcLength+error && leftPos > arcLength-error && rightPos < arcLength+error && rightPos > arcLength-error;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0d70a39c5e09b881bc18014dbaa87505\",\n \"score\": \"0.58631146\",\n \"text\": \"@VTID(15)\\r\\n double left();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"23750ea31110f2d9d6bf90c683d93459\",\n \"score\": \"0.5843208\",\n \"text\": \"private boolean isFacingLeft() {\\n\\t\\treturn getDirection() == Direction.LEFT;\\n\\t}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":985395,"cells":{"query_id":{"kind":"string","value":"25197b4cf814864ecd440f23b9149cb3"},"query":{"kind":"string","value":"TODO Autogenerated method stub"},"positive_passages":{"kind":"list like","value":[{"docid":"49bbd478c0b26fdf298c7bf1a20aaedf","score":"0.0","text":"@Override\n\t\t\tpublic void onClick(View v) {\n\t\t\t\tswitch(v.getId()) {\n\t\t\t\tcase R.id.red : //red버튼을 눌러서 들어왔느냐?\n\t\t\t\t\tr.setBackgroundColor(Color.RED); //레드버튼을 누르면 te의 백그라운드 컬러를 레드로 바꿔라\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t\tcase R.id.green : //green버튼을 눌러서 들어왔느냐?\n\t\t\t\t\tr.setBackgroundColor(Color.GREEN); //그린버튼을 누르면 te의 백그라운드 컬러를 그린으로 바꿔라\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t\tcase R.id.blue : //green버튼을 눌러서 들어왔느냐?\n\t\t\t\t\tr.setBackgroundColor(Color.BLUE); //블루버튼을 누르면 te의 백그라운드 컬러를 블루로 바꿔라\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t\tcase R.id.yellow : //yellow버튼을 눌러서 들어왔느냐?\n\t\t\t\t\tr.setBackgroundColor(Color.YELLOW); //옐로우버튼을 누르면 te의 백그라운드 컬러를 블루로 바꿔라\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\t\t\t\tcase R.id.any : //yellow버튼을 눌러서 들어왔느냐?\n\t\t\t\t\tint ir, ig, ib;\n\t\t\t\t\tir = Integer.parseInt(r.getText().toString());\n\t\t\t\t\tig = Integer.parseInt(g.getText().toString());\n\t\t\t\t\tib = Integer.parseInt(b.getText().toString());\n\t\t\t\t\tr.setBackgroundColor(Color.rgb(ir, ig, ib));\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t\n\t\t\t\t\n\t\t\t}","title":""}],"string":"[\n {\n \"docid\": \"49bbd478c0b26fdf298c7bf1a20aaedf\",\n \"score\": \"0.0\",\n \"text\": \"@Override\\n\\t\\t\\tpublic void onClick(View v) {\\n\\t\\t\\t\\tswitch(v.getId()) {\\n\\t\\t\\t\\tcase R.id.red : //red버튼을 눌러서 들어왔느냐?\\n\\t\\t\\t\\t\\tr.setBackgroundColor(Color.RED); //레드버튼을 누르면 te의 백그라운드 컬러를 레드로 바꿔라\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\tcase R.id.green : //green버튼을 눌러서 들어왔느냐?\\n\\t\\t\\t\\t\\tr.setBackgroundColor(Color.GREEN); //그린버튼을 누르면 te의 백그라운드 컬러를 그린으로 바꿔라\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\tcase R.id.blue : //green버튼을 눌러서 들어왔느냐?\\n\\t\\t\\t\\t\\tr.setBackgroundColor(Color.BLUE); //블루버튼을 누르면 te의 백그라운드 컬러를 블루로 바꿔라\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\tcase R.id.yellow : //yellow버튼을 눌러서 들어왔느냐?\\n\\t\\t\\t\\t\\tr.setBackgroundColor(Color.YELLOW); //옐로우버튼을 누르면 te의 백그라운드 컬러를 블루로 바꿔라\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\tcase R.id.any : //yellow버튼을 눌러서 들어왔느냐?\\n\\t\\t\\t\\t\\tint ir, ig, ib;\\n\\t\\t\\t\\t\\tir = Integer.parseInt(r.getText().toString());\\n\\t\\t\\t\\t\\tig = Integer.parseInt(g.getText().toString());\\n\\t\\t\\t\\t\\tib = Integer.parseInt(b.getText().toString());\\n\\t\\t\\t\\t\\tr.setBackgroundColor(Color.rgb(ir, ig, ib));\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t\\n\\t\\t\\t}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"1acc57d42c31dee937ac33ea6f2a5b0b","score":"0.6836411","text":"@Override\r\n\tpublic void comer() {\n\t\t\r\n\t}","title":""},{"docid":"33d41636b65afa8267c9085dae3d1a2d","score":"0.6679176","text":"private void apparence() {\r\n\r\n\t}","title":""},{"docid":"b8a45528a3f2e2c5ca531b00160fddfb","score":"0.66538197","text":"@Override\n\tpublic void nacer() {\n\n\t}","title":""},{"docid":"b8a45528a3f2e2c5ca531b00160fddfb","score":"0.66538197","text":"@Override\n\tpublic void nacer() {\n\n\t}","title":""},{"docid":"f777356e2cd2fecd871f35f7e556fda8","score":"0.6646134","text":"public void mo3640e() {\n }","title":""},{"docid":"80d20df1cc75d8fa96c12c49a757fc43","score":"0.65323734","text":"@Override\n\tprotected void getExras() {\n\t\t\n\t}","title":""},{"docid":"5f8d37aee09bc1e9959f768d6eb0183c","score":"0.6481211","text":"@Override\r\n\t\t\tpublic void annadir() {\n\r\n\t\t\t}","title":""},{"docid":"5314003d8592219f71035b81985fabc0","score":"0.64631","text":"@Override\n\tpublic void roule() {\n\t\t\n\t}","title":""},{"docid":"d0a79718ff9c5863618b11860674ac5e","score":"0.6461734","text":"@Override\n\tpublic void comer() {\n\n\t}","title":""},{"docid":"1f7c82e188acf30d59f88faf08cf24ac","score":"0.623686","text":"@Override\r\n\t\t\tpublic void ayuda() {\n\r\n\t\t\t}","title":""},{"docid":"1f7c82e188acf30d59f88faf08cf24ac","score":"0.623686","text":"@Override\r\n\t\t\tpublic void ayuda() {\n\r\n\t\t\t}","title":""},{"docid":"10ead2e988bf977cb8edb2bacf974891","score":"0.61546874","text":"@Override\n\tprotected void init() {\n\t\t\n\t}","title":""},{"docid":"f9de8c9acb961a9d05ed00de5fe361e7","score":"0.60638905","text":"@Override\n\tpublic void seRetrage() {\n\t\t\n\t}","title":""},{"docid":"483ae2cb94563f8e11864a532e44b464","score":"0.606149","text":"@Override\r\n public void perturb() {\n \r\n }","title":""},{"docid":"e41230eaa4480036f1db3ae4856b5e2c","score":"0.6048755","text":"@Override\n\tpublic void evoluer() {\n\t\t\n\t}","title":""},{"docid":"1fd4f5b0b471084e004373c89c1cf248","score":"0.6040993","text":"@Override\r\n\tpublic void sen() {\n\t\t\r\n\t}","title":""},{"docid":"5f1811a241e41ead4415ec767e77c63d","score":"0.6023245","text":"@Override\n\tprotected void init() {\n\n\t}","title":""},{"docid":"432a53d7cc7bff50c3cce7662418fe22","score":"0.60228735","text":"private static void daelijeom() {\n\t\t\n\t}","title":""},{"docid":"feb1a9485d06df38283881186fb528a9","score":"0.6014977","text":"@Override\n \tprotected void initialize() {\n \n \t}","title":""},{"docid":"1f6ca7603428a226b143ebf504f69fdb","score":"0.6005143","text":"@Override\n protected void initialize() {\n \n }","title":""},{"docid":"609ec2ff060d9d4cb0276468f482734d","score":"0.59771466","text":"public void mo89673a() {\n }","title":""},{"docid":"f3ea867fdaa4b61546bfc393614a093c","score":"0.59687567","text":"@Override\n\tpublic void setingInicial() {\n\t\t\n\t}","title":""},{"docid":"3211287bc24304a8ca2975647e8a262e","score":"0.59549016","text":"public void mo1702b() {\n }","title":""},{"docid":"e98e1f8ddb7a94a5d95c29c94232f737","score":"0.5943817","text":"@Override\r\n\tpublic void init() {\n\t\t\r\n\t\t\r\n\t}","title":""},{"docid":"2d61391fe8770661f25917f3770f2a26","score":"0.5926535","text":"@Override\n\t\tpublic void init(){\n\t\t\t\n\t\t}","title":""},{"docid":"a55a150557f80abcbd733ee3162b0661","score":"0.5925673","text":"private void m18301a() {\n }","title":""},{"docid":"6a8c6480f9fa5ab89d0437d00ffffccc","score":"0.591947","text":"@Override\n public void tirer() {\n\n }","title":""},{"docid":"8f8a1c1dfa100614be8cac1247e068d5","score":"0.59192646","text":"@Override\r\n\t\t\tpublic void work() {\n\t\t\t\t\r\n\t\t\t}","title":""},{"docid":"619a28ba3c7707bdf8bb1451d5c3d12b","score":"0.5910928","text":"public void mo25069a() {\n }","title":""},{"docid":"28237d6ae20e1aa35aaca12e05c950c9","score":"0.5902906","text":"@Override\n\tpublic void sacrifier() {\n\t\t\n\t}","title":""},{"docid":"3e6e2e657db69bfc88c40c8467801266","score":"0.5899844","text":"@Override\r\n\tpublic void ben() {\n\t\t\r\n\t}","title":""},{"docid":"1134c4caabd33b9bbd414763740fddde","score":"0.5896682","text":"@Override\n\tpublic void respirar() {\n\n\t}","title":""},{"docid":"ab499170bffb402933a50d63a97e69dd","score":"0.5896488","text":"@Override\r\n\tprotected void init() {\n\t}","title":""},{"docid":"1dc1426b3b1c079ac18377166a6b34d3","score":"0.5893354","text":"@Override\n public int getOrder() {\n return 0;\n }","title":""},{"docid":"f737e2251cf43d326f43b44297696e55","score":"0.58891016","text":"@Override\n\tpublic void patrol() {\n\n\t}","title":""},{"docid":"de8c2aa495b8cdade7e8895e58745ea2","score":"0.5887025","text":"public void afficher() {\n\t\t\n\t}","title":""},{"docid":"77f859c241fd5e1d997f67c3b890833e","score":"0.5886342","text":"@Override\n\tpublic void dormir() {\n\t\t\n\t}","title":""},{"docid":"13e4409784fd6f872b474e6effe9726e","score":"0.5879506","text":"@Override\n protected void initialization() {\n\n\n\n }","title":""},{"docid":"bafce2e94d56e61baeadcb37047f6035","score":"0.5858384","text":"@Override\n\tprotected void postprocess() {\n\t}","title":""},{"docid":"5aa237d31e744d1e0729621e464fcfb2","score":"0.585451","text":"@Override\r\n\tprotected void DataInit() {\n\r\n\t}","title":""},{"docid":"5aa237d31e744d1e0729621e464fcfb2","score":"0.585451","text":"@Override\r\n\tprotected void DataInit() {\n\r\n\t}","title":""},{"docid":"5aa237d31e744d1e0729621e464fcfb2","score":"0.585451","text":"@Override\r\n\tprotected void DataInit() {\n\r\n\t}","title":""},{"docid":"9f52ad7c10a190c6268e275fdb4c1581","score":"0.5853263","text":"@Override\n\tpublic void jealous() {\n\t\t\n\t}","title":""},{"docid":"9f52ad7c10a190c6268e275fdb4c1581","score":"0.5853263","text":"@Override\n\tpublic void jealous() {\n\t\t\n\t}","title":""},{"docid":"cdf2a119ee69429ad4420d45c29db1b6","score":"0.5849137","text":"@Override\n\tpublic void netword() {\n\t\t\n\t}","title":""},{"docid":"2bcac1bab4eaa6c9cc4cb7e33c684cef","score":"0.5848443","text":"public void mo1691a() {\n }","title":""},{"docid":"5f122c528716d4e28cd3a6695d27b80f","score":"0.584121","text":"@Override\n\tpublic void morir() {\n\n\t}","title":""},{"docid":"5f122c528716d4e28cd3a6695d27b80f","score":"0.584121","text":"@Override\n\tpublic void morir() {\n\n\t}","title":""},{"docid":"339f0371e7ea38d751e17fe6de3b3608","score":"0.58367133","text":"@Override\n\tpublic void crecer() {\n\n\t}","title":""},{"docid":"339f0371e7ea38d751e17fe6de3b3608","score":"0.58367133","text":"@Override\n\tpublic void crecer() {\n\n\t}","title":""},{"docid":"6ed3e363c02164bd00163fa46e2c48c2","score":"0.58366287","text":"@Override\n public void init_moduule() {\n \n }","title":""},{"docid":"3ea264268cd945e9281ac9d06e9bb7c5","score":"0.5829954","text":"@Override\n\tpublic void euphoria() {\n\t\t\n\t}","title":""},{"docid":"3ea264268cd945e9281ac9d06e9bb7c5","score":"0.5829954","text":"@Override\n\tpublic void euphoria() {\n\t\t\n\t}","title":""},{"docid":"ce91051d32625345f2bf3562abbb93de","score":"0.5794177","text":"@Override\n\tprotected void inicializar() {\n\t}","title":""},{"docid":"beee84210d56979d0068a8094fb2a5bd","score":"0.5792378","text":"@Override\r\n\tprotected void initData() {\n\t\t\r\n\t}","title":""},{"docid":"54b1134554bc066c34ed30a72adb660c","score":"0.57844025","text":"@Override\n\tprotected void initData() {\n\n\t}","title":""},{"docid":"b04ed49986fb3f4321a90ec19ab7f86d","score":"0.57759553","text":"@Override\n public void alistar() {\n }","title":""},{"docid":"2ded89a6dfb4a5cfce4bf00ee7993921","score":"0.5774479","text":"@Override\n\tpublic void init() {\n\t\t\n\t}","title":""},{"docid":"2ded89a6dfb4a5cfce4bf00ee7993921","score":"0.5774479","text":"@Override\n\tpublic void init() {\n\t\t\n\t}","title":""},{"docid":"2ded89a6dfb4a5cfce4bf00ee7993921","score":"0.5774479","text":"@Override\n\tpublic void init() {\n\t\t\n\t}","title":""},{"docid":"2ded89a6dfb4a5cfce4bf00ee7993921","score":"0.5774479","text":"@Override\n\tpublic void init() {\n\t\t\n\t}","title":""},{"docid":"2ded89a6dfb4a5cfce4bf00ee7993921","score":"0.5774479","text":"@Override\n\tpublic void init() {\n\t\t\n\t}","title":""},{"docid":"2ded89a6dfb4a5cfce4bf00ee7993921","score":"0.5774479","text":"@Override\n\tpublic void init() {\n\t\t\n\t}","title":""},{"docid":"2ded89a6dfb4a5cfce4bf00ee7993921","score":"0.5774479","text":"@Override\n\tpublic void init() {\n\t\t\n\t}","title":""},{"docid":"2ded89a6dfb4a5cfce4bf00ee7993921","score":"0.5774479","text":"@Override\n\tpublic void init() {\n\t\t\n\t}","title":""},{"docid":"849edaa5bbcc7511e16697ad05c01712","score":"0.57732296","text":"@Override\n\tpublic void avanzar() {\n\t\t\n\t}","title":""},{"docid":"10e00e5505d97435b723aeadb7afb929","score":"0.57712233","text":"@Override\n\tpublic void pintar2() {\n\t\t\n\t}","title":""},{"docid":"683eea6c39ec4e6df90f6be05200559d","score":"0.5769485","text":"@Override\r\n public void confer(){\n \r\n }","title":""},{"docid":"728d084a23664ecf9b5c04acb6367b9c","score":"0.5769356","text":"@Override\r\n\tpublic void descarnsar() {\n\t\t\r\n\t}","title":""},{"docid":"359987993ad84757f9d7a12eaf38d2d7","score":"0.5769273","text":"public final void mo59419g() {\n }","title":""},{"docid":"0e6111ae009ad752a364e5e9fb168e98","score":"0.5768801","text":"@Override\n\tpublic void volumne() {\n\t\t\n\t}","title":""},{"docid":"3f651ef5a6fad17e313e8da4ea72b6e3","score":"0.57645357","text":"@Override\n\tpublic void CT() {\n\t\t\n\t}","title":""},{"docid":"615018f0186427ab904e872db6726b2d","score":"0.5759138","text":"@Override\n public void init()\n {\n \n }","title":""},{"docid":"2d614ed2ee5b3120f5ee8b427542ddc3","score":"0.575025","text":"@Override\r\n\tpublic void init() {\n\t\t\r\n\t}","title":""},{"docid":"2d614ed2ee5b3120f5ee8b427542ddc3","score":"0.575025","text":"@Override\r\n\tpublic void init() {\n\t\t\r\n\t}","title":""},{"docid":"2d614ed2ee5b3120f5ee8b427542ddc3","score":"0.575025","text":"@Override\r\n\tpublic void init() {\n\t\t\r\n\t}","title":""},{"docid":"e634836bc1d61a011e04bfb67a971792","score":"0.5745885","text":"@Override\r\n\tpublic void sair() {\n\t\t\r\n\t}","title":""},{"docid":"a7cff18dc205a0d79dbe54bb988e6894","score":"0.57428306","text":"public void emettreSon() {\n\t\t\r\n\t}","title":""},{"docid":"c13e6a1b7c130afa9fb0f34225bea4ef","score":"0.573645","text":"protected void mo1555b() {\n }","title":""},{"docid":"b143ffd983be4c8f41702b8f934b6f32","score":"0.57337177","text":"@Override\r\n\tpublic void init() {\n\r\n\t}","title":""},{"docid":"ac5a7a92eda66d2b7ef40199230fa4af","score":"0.5731894","text":"@Override\n\tpublic void arbeiteInPizzeria() {\n\n\t}","title":""},{"docid":"d1c2c284b75d7d46145b6f407496cd96","score":"0.5725441","text":"@Override\n\t\tprotected void initParameters() {\n\t\t\t\n\t\t}","title":""},{"docid":"a937c607590931387a357d03c3b0eef4","score":"0.5715831","text":"@Override\n\tprotected void initialize() {\n\n\t}","title":""},{"docid":"a937c607590931387a357d03c3b0eef4","score":"0.5715831","text":"@Override\n\tprotected void initialize() {\n\n\t}","title":""},{"docid":"0fc890bce2cd6e7184e33036b92f8217","score":"0.57140535","text":"public void mo55254a() {\n }","title":""},{"docid":"65022f0bb57de78da8518cd156b102e6","score":"0.57112384","text":"private void init(){\n\t\t\t\n\t\t}","title":""},{"docid":"216da885329e8d80cdc3490fda895c11","score":"0.57087225","text":"@Override\n\tpublic void yaz1() {\n\t\t\n\t}","title":""},{"docid":"3c6f91c038ca7ffdab72b5c233b827c5","score":"0.5705329","text":"@Override\n\tprotected void initMethod() {\n\t}","title":""},{"docid":"d3ea98d4cf6d33f166c8de2a1f7ab5a5","score":"0.5697742","text":"@Override\r\n\tpublic void Collusion() {\n\t\t\r\n\t}","title":""},{"docid":"d3ea98d4cf6d33f166c8de2a1f7ab5a5","score":"0.5697742","text":"@Override\r\n\tpublic void Collusion() {\n\t\t\r\n\t}","title":""},{"docid":"5f3e16954465fbae384d88f411211419","score":"0.56972444","text":"@Override\r\n public int E_generar() {\r\n return 0;\r\n }","title":""},{"docid":"365a661b2084f764f5e458915ff735ac","score":"0.56864643","text":"@Override\n public int getMunition() {\n return 0;\n }","title":""},{"docid":"40539b782464082aab77fae6b047eade","score":"0.5681723","text":"@Override\n\tprotected int get_count() {\n\t\treturn 1;\n\t}","title":""},{"docid":"b1e3eb9a5b9dff21ed219e48a8676b34","score":"0.56774884","text":"@Override\n public void memoria() {\n \n }","title":""},{"docid":"5f628d368579dd40ef68362831006940","score":"0.56769013","text":"@Override\n\tpublic void fahreFahrzeug() {\n\n\t}","title":""},{"docid":"5ae17f2516c21590c850e6758048effe","score":"0.56625473","text":"@Override\n public int getID()\n {\n return 0;\n }","title":""},{"docid":"b8cd427648ea50c94f93c47d407d10a0","score":"0.5660459","text":"public void mo3639d() {\n }","title":""},{"docid":"9d94df716ebd35f7ec07df01763ae94c","score":"0.5655942","text":"@Override\n\tpublic void init() {\n\n\t}","title":""},{"docid":"9d94df716ebd35f7ec07df01763ae94c","score":"0.5655942","text":"@Override\n\tpublic void init() {\n\n\t}","title":""},{"docid":"9d94df716ebd35f7ec07df01763ae94c","score":"0.5655942","text":"@Override\n\tpublic void init() {\n\n\t}","title":""},{"docid":"9d94df716ebd35f7ec07df01763ae94c","score":"0.5655942","text":"@Override\n\tpublic void init() {\n\n\t}","title":""}],"string":"[\n {\n \"docid\": \"1acc57d42c31dee937ac33ea6f2a5b0b\",\n \"score\": \"0.6836411\",\n \"text\": \"@Override\\r\\n\\tpublic void comer() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"33d41636b65afa8267c9085dae3d1a2d\",\n \"score\": \"0.6679176\",\n \"text\": \"private void apparence() {\\r\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b8a45528a3f2e2c5ca531b00160fddfb\",\n \"score\": \"0.66538197\",\n \"text\": \"@Override\\n\\tpublic void nacer() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b8a45528a3f2e2c5ca531b00160fddfb\",\n \"score\": \"0.66538197\",\n \"text\": \"@Override\\n\\tpublic void nacer() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f777356e2cd2fecd871f35f7e556fda8\",\n \"score\": \"0.6646134\",\n \"text\": \"public void mo3640e() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80d20df1cc75d8fa96c12c49a757fc43\",\n \"score\": \"0.65323734\",\n \"text\": \"@Override\\n\\tprotected void getExras() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5f8d37aee09bc1e9959f768d6eb0183c\",\n \"score\": \"0.6481211\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void annadir() {\\n\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5314003d8592219f71035b81985fabc0\",\n \"score\": \"0.64631\",\n \"text\": \"@Override\\n\\tpublic void roule() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d0a79718ff9c5863618b11860674ac5e\",\n \"score\": \"0.6461734\",\n \"text\": \"@Override\\n\\tpublic void comer() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f7c82e188acf30d59f88faf08cf24ac\",\n \"score\": \"0.623686\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void ayuda() {\\n\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f7c82e188acf30d59f88faf08cf24ac\",\n \"score\": \"0.623686\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void ayuda() {\\n\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"10ead2e988bf977cb8edb2bacf974891\",\n \"score\": \"0.61546874\",\n \"text\": \"@Override\\n\\tprotected void init() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f9de8c9acb961a9d05ed00de5fe361e7\",\n \"score\": \"0.60638905\",\n \"text\": \"@Override\\n\\tpublic void seRetrage() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"483ae2cb94563f8e11864a532e44b464\",\n \"score\": \"0.606149\",\n \"text\": \"@Override\\r\\n public void perturb() {\\n \\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e41230eaa4480036f1db3ae4856b5e2c\",\n \"score\": \"0.6048755\",\n \"text\": \"@Override\\n\\tpublic void evoluer() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1fd4f5b0b471084e004373c89c1cf248\",\n \"score\": \"0.6040993\",\n \"text\": \"@Override\\r\\n\\tpublic void sen() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5f1811a241e41ead4415ec767e77c63d\",\n \"score\": \"0.6023245\",\n \"text\": \"@Override\\n\\tprotected void init() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"432a53d7cc7bff50c3cce7662418fe22\",\n \"score\": \"0.60228735\",\n \"text\": \"private static void daelijeom() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"feb1a9485d06df38283881186fb528a9\",\n \"score\": \"0.6014977\",\n \"text\": \"@Override\\n \\tprotected void initialize() {\\n \\n \\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1f6ca7603428a226b143ebf504f69fdb\",\n \"score\": \"0.6005143\",\n \"text\": \"@Override\\n protected void initialize() {\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"609ec2ff060d9d4cb0276468f482734d\",\n \"score\": \"0.59771466\",\n \"text\": \"public void mo89673a() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f3ea867fdaa4b61546bfc393614a093c\",\n \"score\": \"0.59687567\",\n \"text\": \"@Override\\n\\tpublic void setingInicial() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3211287bc24304a8ca2975647e8a262e\",\n \"score\": \"0.59549016\",\n \"text\": \"public void mo1702b() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e98e1f8ddb7a94a5d95c29c94232f737\",\n \"score\": \"0.5943817\",\n \"text\": \"@Override\\r\\n\\tpublic void init() {\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d61391fe8770661f25917f3770f2a26\",\n \"score\": \"0.5926535\",\n \"text\": \"@Override\\n\\t\\tpublic void init(){\\n\\t\\t\\t\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a55a150557f80abcbd733ee3162b0661\",\n \"score\": \"0.5925673\",\n \"text\": \"private void m18301a() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6a8c6480f9fa5ab89d0437d00ffffccc\",\n \"score\": \"0.591947\",\n \"text\": \"@Override\\n public void tirer() {\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8f8a1c1dfa100614be8cac1247e068d5\",\n \"score\": \"0.59192646\",\n \"text\": \"@Override\\r\\n\\t\\t\\tpublic void work() {\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"619a28ba3c7707bdf8bb1451d5c3d12b\",\n \"score\": \"0.5910928\",\n \"text\": \"public void mo25069a() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"28237d6ae20e1aa35aaca12e05c950c9\",\n \"score\": \"0.5902906\",\n \"text\": \"@Override\\n\\tpublic void sacrifier() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e6e2e657db69bfc88c40c8467801266\",\n \"score\": \"0.5899844\",\n \"text\": \"@Override\\r\\n\\tpublic void ben() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1134c4caabd33b9bbd414763740fddde\",\n \"score\": \"0.5896682\",\n \"text\": \"@Override\\n\\tpublic void respirar() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ab499170bffb402933a50d63a97e69dd\",\n \"score\": \"0.5896488\",\n \"text\": \"@Override\\r\\n\\tprotected void init() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1dc1426b3b1c079ac18377166a6b34d3\",\n \"score\": \"0.5893354\",\n \"text\": \"@Override\\n public int getOrder() {\\n return 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f737e2251cf43d326f43b44297696e55\",\n \"score\": \"0.58891016\",\n \"text\": \"@Override\\n\\tpublic void patrol() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"de8c2aa495b8cdade7e8895e58745ea2\",\n \"score\": \"0.5887025\",\n \"text\": \"public void afficher() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"77f859c241fd5e1d997f67c3b890833e\",\n \"score\": \"0.5886342\",\n \"text\": \"@Override\\n\\tpublic void dormir() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"13e4409784fd6f872b474e6effe9726e\",\n \"score\": \"0.5879506\",\n \"text\": \"@Override\\n protected void initialization() {\\n\\n\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bafce2e94d56e61baeadcb37047f6035\",\n \"score\": \"0.5858384\",\n \"text\": \"@Override\\n\\tprotected void postprocess() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5aa237d31e744d1e0729621e464fcfb2\",\n \"score\": \"0.585451\",\n \"text\": \"@Override\\r\\n\\tprotected void DataInit() {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5aa237d31e744d1e0729621e464fcfb2\",\n \"score\": \"0.585451\",\n \"text\": \"@Override\\r\\n\\tprotected void DataInit() {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5aa237d31e744d1e0729621e464fcfb2\",\n \"score\": \"0.585451\",\n \"text\": \"@Override\\r\\n\\tprotected void DataInit() {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9f52ad7c10a190c6268e275fdb4c1581\",\n \"score\": \"0.5853263\",\n \"text\": \"@Override\\n\\tpublic void jealous() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9f52ad7c10a190c6268e275fdb4c1581\",\n \"score\": \"0.5853263\",\n \"text\": \"@Override\\n\\tpublic void jealous() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cdf2a119ee69429ad4420d45c29db1b6\",\n \"score\": \"0.5849137\",\n \"text\": \"@Override\\n\\tpublic void netword() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2bcac1bab4eaa6c9cc4cb7e33c684cef\",\n \"score\": \"0.5848443\",\n \"text\": \"public void mo1691a() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5f122c528716d4e28cd3a6695d27b80f\",\n \"score\": \"0.584121\",\n \"text\": \"@Override\\n\\tpublic void morir() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5f122c528716d4e28cd3a6695d27b80f\",\n \"score\": \"0.584121\",\n \"text\": \"@Override\\n\\tpublic void morir() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"339f0371e7ea38d751e17fe6de3b3608\",\n \"score\": \"0.58367133\",\n \"text\": \"@Override\\n\\tpublic void crecer() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"339f0371e7ea38d751e17fe6de3b3608\",\n \"score\": \"0.58367133\",\n \"text\": \"@Override\\n\\tpublic void crecer() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6ed3e363c02164bd00163fa46e2c48c2\",\n \"score\": \"0.58366287\",\n \"text\": \"@Override\\n public void init_moduule() {\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ea264268cd945e9281ac9d06e9bb7c5\",\n \"score\": \"0.5829954\",\n \"text\": \"@Override\\n\\tpublic void euphoria() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ea264268cd945e9281ac9d06e9bb7c5\",\n \"score\": \"0.5829954\",\n \"text\": \"@Override\\n\\tpublic void euphoria() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ce91051d32625345f2bf3562abbb93de\",\n \"score\": \"0.5794177\",\n \"text\": \"@Override\\n\\tprotected void inicializar() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"beee84210d56979d0068a8094fb2a5bd\",\n \"score\": \"0.5792378\",\n \"text\": \"@Override\\r\\n\\tprotected void initData() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"54b1134554bc066c34ed30a72adb660c\",\n \"score\": \"0.57844025\",\n \"text\": \"@Override\\n\\tprotected void initData() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b04ed49986fb3f4321a90ec19ab7f86d\",\n \"score\": \"0.57759553\",\n \"text\": \"@Override\\n public void alistar() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ded89a6dfb4a5cfce4bf00ee7993921\",\n \"score\": \"0.5774479\",\n \"text\": \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ded89a6dfb4a5cfce4bf00ee7993921\",\n \"score\": \"0.5774479\",\n \"text\": \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ded89a6dfb4a5cfce4bf00ee7993921\",\n \"score\": \"0.5774479\",\n \"text\": \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ded89a6dfb4a5cfce4bf00ee7993921\",\n \"score\": \"0.5774479\",\n \"text\": \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ded89a6dfb4a5cfce4bf00ee7993921\",\n \"score\": \"0.5774479\",\n \"text\": \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ded89a6dfb4a5cfce4bf00ee7993921\",\n \"score\": \"0.5774479\",\n \"text\": \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ded89a6dfb4a5cfce4bf00ee7993921\",\n \"score\": \"0.5774479\",\n \"text\": \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2ded89a6dfb4a5cfce4bf00ee7993921\",\n \"score\": \"0.5774479\",\n \"text\": \"@Override\\n\\tpublic void init() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"849edaa5bbcc7511e16697ad05c01712\",\n \"score\": \"0.57732296\",\n \"text\": \"@Override\\n\\tpublic void avanzar() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"10e00e5505d97435b723aeadb7afb929\",\n \"score\": \"0.57712233\",\n \"text\": \"@Override\\n\\tpublic void pintar2() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"683eea6c39ec4e6df90f6be05200559d\",\n \"score\": \"0.5769485\",\n \"text\": \"@Override\\r\\n public void confer(){\\n \\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"728d084a23664ecf9b5c04acb6367b9c\",\n \"score\": \"0.5769356\",\n \"text\": \"@Override\\r\\n\\tpublic void descarnsar() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"359987993ad84757f9d7a12eaf38d2d7\",\n \"score\": \"0.5769273\",\n \"text\": \"public final void mo59419g() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0e6111ae009ad752a364e5e9fb168e98\",\n \"score\": \"0.5768801\",\n \"text\": \"@Override\\n\\tpublic void volumne() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3f651ef5a6fad17e313e8da4ea72b6e3\",\n \"score\": \"0.57645357\",\n \"text\": \"@Override\\n\\tpublic void CT() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"615018f0186427ab904e872db6726b2d\",\n \"score\": \"0.5759138\",\n \"text\": \"@Override\\n public void init()\\n {\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d614ed2ee5b3120f5ee8b427542ddc3\",\n \"score\": \"0.575025\",\n \"text\": \"@Override\\r\\n\\tpublic void init() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d614ed2ee5b3120f5ee8b427542ddc3\",\n \"score\": \"0.575025\",\n \"text\": \"@Override\\r\\n\\tpublic void init() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d614ed2ee5b3120f5ee8b427542ddc3\",\n \"score\": \"0.575025\",\n \"text\": \"@Override\\r\\n\\tpublic void init() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e634836bc1d61a011e04bfb67a971792\",\n \"score\": \"0.5745885\",\n \"text\": \"@Override\\r\\n\\tpublic void sair() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a7cff18dc205a0d79dbe54bb988e6894\",\n \"score\": \"0.57428306\",\n \"text\": \"public void emettreSon() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c13e6a1b7c130afa9fb0f34225bea4ef\",\n \"score\": \"0.573645\",\n \"text\": \"protected void mo1555b() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b143ffd983be4c8f41702b8f934b6f32\",\n \"score\": \"0.57337177\",\n \"text\": \"@Override\\r\\n\\tpublic void init() {\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ac5a7a92eda66d2b7ef40199230fa4af\",\n \"score\": \"0.5731894\",\n \"text\": \"@Override\\n\\tpublic void arbeiteInPizzeria() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d1c2c284b75d7d46145b6f407496cd96\",\n \"score\": \"0.5725441\",\n \"text\": \"@Override\\n\\t\\tprotected void initParameters() {\\n\\t\\t\\t\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a937c607590931387a357d03c3b0eef4\",\n \"score\": \"0.5715831\",\n \"text\": \"@Override\\n\\tprotected void initialize() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a937c607590931387a357d03c3b0eef4\",\n \"score\": \"0.5715831\",\n \"text\": \"@Override\\n\\tprotected void initialize() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0fc890bce2cd6e7184e33036b92f8217\",\n \"score\": \"0.57140535\",\n \"text\": \"public void mo55254a() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"65022f0bb57de78da8518cd156b102e6\",\n \"score\": \"0.57112384\",\n \"text\": \"private void init(){\\n\\t\\t\\t\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"216da885329e8d80cdc3490fda895c11\",\n \"score\": \"0.57087225\",\n \"text\": \"@Override\\n\\tpublic void yaz1() {\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3c6f91c038ca7ffdab72b5c233b827c5\",\n \"score\": \"0.5705329\",\n \"text\": \"@Override\\n\\tprotected void initMethod() {\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d3ea98d4cf6d33f166c8de2a1f7ab5a5\",\n \"score\": \"0.5697742\",\n \"text\": \"@Override\\r\\n\\tpublic void Collusion() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d3ea98d4cf6d33f166c8de2a1f7ab5a5\",\n \"score\": \"0.5697742\",\n \"text\": \"@Override\\r\\n\\tpublic void Collusion() {\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5f3e16954465fbae384d88f411211419\",\n \"score\": \"0.56972444\",\n \"text\": \"@Override\\r\\n public int E_generar() {\\r\\n return 0;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"365a661b2084f764f5e458915ff735ac\",\n \"score\": \"0.56864643\",\n \"text\": \"@Override\\n public int getMunition() {\\n return 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"40539b782464082aab77fae6b047eade\",\n \"score\": \"0.5681723\",\n \"text\": \"@Override\\n\\tprotected int get_count() {\\n\\t\\treturn 1;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b1e3eb9a5b9dff21ed219e48a8676b34\",\n \"score\": \"0.56774884\",\n \"text\": \"@Override\\n public void memoria() {\\n \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5f628d368579dd40ef68362831006940\",\n \"score\": \"0.56769013\",\n \"text\": \"@Override\\n\\tpublic void fahreFahrzeug() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5ae17f2516c21590c850e6758048effe\",\n \"score\": \"0.56625473\",\n \"text\": \"@Override\\n public int getID()\\n {\\n return 0;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b8cd427648ea50c94f93c47d407d10a0\",\n \"score\": \"0.5660459\",\n \"text\": \"public void mo3639d() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d94df716ebd35f7ec07df01763ae94c\",\n \"score\": \"0.5655942\",\n \"text\": \"@Override\\n\\tpublic void init() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d94df716ebd35f7ec07df01763ae94c\",\n \"score\": \"0.5655942\",\n \"text\": \"@Override\\n\\tpublic void init() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d94df716ebd35f7ec07df01763ae94c\",\n \"score\": \"0.5655942\",\n \"text\": \"@Override\\n\\tpublic void init() {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9d94df716ebd35f7ec07df01763ae94c\",\n \"score\": \"0.5655942\",\n \"text\": \"@Override\\n\\tpublic void init() {\\n\\n\\t}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":985396,"cells":{"query_id":{"kind":"string","value":"defbde0c1c7016f6a64bb0af244171c3"},"query":{"kind":"string","value":"Creates a new GameListRequest that holds a response listener that listens for a response from the game table database"},"positive_passages":{"kind":"list like","value":[{"docid":"465f58a458a6c8d320ced917a767dc1f","score":"0.744302","text":"public GameListRequest(Response.Listener<String> listener) {\r\n super(Request.Method.POST, GAME_LIST_REQUEST_URL, listener, null);\r\n }","title":""}],"string":"[\n {\n \"docid\": \"465f58a458a6c8d320ced917a767dc1f\",\n \"score\": \"0.744302\",\n \"text\": \"public GameListRequest(Response.Listener<String> listener) {\\r\\n super(Request.Method.POST, GAME_LIST_REQUEST_URL, listener, null);\\r\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"cdb4a701a2e1dcc2c91876005eaf58ad","score":"0.69234645","text":"@SuppressWarnings(\"unused\")\n\tprivate void createGameRequest() {\n\t\tgameClientStub.sendNewGameRequest();\n\t}","title":""},{"docid":"4a95dd83d6026906ccb6764fc0f4e506","score":"0.6210674","text":"public void fetchGame(final String gameName, final Context context, final VolleyCallback callback) {\n\n Log.d(TAG, \"fetchGame\");\n\n final JsonObjectRequest request = new JsonObjectRequest(Method.GET, base_url + \"game/\" + gameName, null, new Response.Listener<JSONObject>() {\n @Override\n public void onResponse(JSONObject response) {\n try {\n Game game = new Game(-1, response.getLong(\"game_id\"), response.getString(\"game_owner\"), gameName, response.getLong(\"end_time\"));\n JSONArray jsonTeamIds = response.getJSONArray(\"team_ids\");\n JSONArray jsonTeamNames = response.getJSONArray(\"team_names\");\n JSONArray jsonTeamColours = response.getJSONArray(\"team_colours\");\n JSONArray jsonHints = response.getJSONArray(\"hints\");\n JSONArray jsonTagIds = response.getJSONArray(\"tag_ids\");\n\n GameManager manager = new GameManager(context);\n long game_id = manager.insertGame(game);\n\n for (int i = 0; i < jsonTeamIds.length(); i++) {\n manager.insertTeam(new Team(-1, game_id, jsonTeamIds.getLong(i), jsonTeamNames.getString(i), jsonTeamColours.getString(i)));\n }\n\n for (int i = 0; i < jsonTagIds.length(); i++) {\n manager.insertTag(new NFCTag(-1, jsonTagIds.getLong(i), game_id, jsonHints.getString(i)));\n }\n\n callback.onSuccess(response);\n } catch (JSONException e) {\n e.printStackTrace();\n }\n }\n }, new Response.ErrorListener() {\n @Override\n public void onErrorResponse(VolleyError error) {\n Log.d(TAG, error.toString());\n callback.onError(error);\n }\n });\n\n Log.d(TAG, \"request: \" + request.toString());\n VolleySingleton.getInstance(context).addToQueue(request);\n }","title":""},{"docid":"fc84a9d3375865e78e1431773489132a","score":"0.605212","text":"GameBean createNewGame(NewGameRequest request);","title":""},{"docid":"8fa18a51e9a54e73fb61906be1baa829","score":"0.5660077","text":"private synchronized void RequestChunkList() {\n Listener newListener = new Listener(PacketType.CHUNK_LIST_RESPONSE, nextSessionID++, -1, DEFAULT_LISTEN_TIMEOUT);\n AddListenerToList(newListener);\n\n Util.DebugPrint(DbgSub.REQUESTING_CLIENT, \"RequestingClient: Sending out a new chunk list request for \" + filename);\n ChunkListRequest chunkListRequest = new ChunkListRequest(filename, newListener.listener.listeningPort);\n MessageSend sender = new MessageSend();\n sender.SendCommunication(servingHost, PacketType.CHUNK_LIST_REQUEST, newListener.sessionID, chunkListRequest.ExportMessagePayload());\n }","title":""},{"docid":"d21c39c29642f0bdcc752f9570dbac80","score":"0.5651227","text":"private void GameLeave() {\n StringRequest stringRequest = new StringRequest(Request.Method.POST, Const.GAME_TABLE_LEAVE,\n new Response.Listener<String>() {\n @Override\n public void onResponse(String response) {\n //progressDialog.dismiss();\n System.out.println(\"\" + response);\n // finish();\n\n }\n\n }, new Response.ErrorListener() {\n @Override\n public void onErrorResponse(VolleyError error) {\n\n }\n }) {\n @Override\n protected Map<String, String> getParams() {\n Map<String, String> params = new HashMap<String, String>();\n SharedPreferences prefs = getSharedPreferences(MY_PREFS_NAME, MODE_PRIVATE);\n params.put(\"user_id\", prefs.getString(\"user_id\", \"\"));\n params.put(\"token\", prefs.getString(\"token\", \"\"));\n return params;\n }\n\n @Override\n public Map<String, String> getHeaders() throws AuthFailureError {\n HashMap<String, String> headers = new HashMap<String, String>();\n headers.put(\"token\", Const.TOKEN);\n return headers;\n }\n };\n\n Volley.newRequestQueue(this).add(stringRequest);\n\n }","title":""},{"docid":"62f0c6fdd97aba39523ee8e17dc9e85c","score":"0.56354153","text":"public interface LoadGameRequester extends Requester {\n /**\n * Called after a load game request finishes successfully. The given Board object will represent\n * the requested game, and will have been initialized successfully from the data sent over by\n * the server.\n *\n * @param board - a Board object successfully initialized to contain the state of the board in\n * the given game\n * @param game - a UserGame object initialized to contain all the high-level information about\n * the game that was requested\n */\n void success(Board board, UserGame game);\n\n /**\n * Called if the server responds to the request by saying the supplied gameID is not associated\n * with a game in its system\n */\n void gameDoesNotExist();\n\n /**\n * Called if the server responds to the request by saying that the user the app currently has\n * logged in is not a player in the game whose data was requested\n */\n void userNotInGame();\n}","title":""},{"docid":"06fe651b6e5ba031993c67618b3c4ec8","score":"0.5556079","text":"private void onClickCreateGameButton(View v) {\n String name = etName.getText().toString();\n SharedPreferences sharedPref = getActivity().getSharedPreferences(\"token\", Context.MODE_PRIVATE);\n token = sharedPref.getString(\"token\", token);\n\n RestService.getInstance(getActivity()).createGame(GameBean.create(name, token), new Callback<GameBean>() {\n @Override\n public void success(GameBean game, Response response) {\n Long gameId = game.id();\n joinedGameId = gameId;\n\n // subscribe to pusher events\n PusherService.getInstance(getActivity()).register(joinedGameId, game.channelName());\n\n Fragment fragment = GameLobbyFragment.newInstance();\n Bundle bundle = new Bundle();\n bundle.putLong(\"gameId\", joinedGameId);\n bundle.putLong(\"userId\", userId);\n bundle.putBoolean(\"isOwner\", true);\n bundle.putString(\"gameChannel\", game.channelName());\n fragment.setArguments(bundle);\n\n ((MenuActivity) getActivity()).pushFragment(fragment);\n }\n\n @Override\n public void failure(RetrofitError error) {\n Toast.makeText(getActivity(), \"Crate Game Failed: \" + error.getMessage(), Toast.LENGTH_LONG).show();\n }\n });\n }","title":""},{"docid":"ffb06c3be6569a6ff1e8840e789fcc7d","score":"0.5525642","text":"public void loadGameList() {\n\t\tGame game = new Game();\n\t\tgame.setId(this.gameId);\n\t\tPlayer player = this.playerList.get(\"0:0:0:0:0:0:0:1\");\n\t\tplayer.setGameId(this.gameId);\n\t\tgame.setHostPlayer(player);\n\t\tthis.gameList.put(Integer.toString(this.gameId),game);\n\t\t//game.addPlayer(this.playerList.get(\"192.168.0.15\"));\n\t\tgame.addPlayer(this.playerList.get(\"192.168.0.15\"));\n\t\t//game.addPlayer(this.playerList.get(\"192.168.0.15\"));\n\t\t//game.addPlayer(this.playerList.get(\"0:0:0:0:0:0:0:1\"));\n\t\tgame.startGame(player);\n\t}","title":""},{"docid":"2e33323e573e311ab3f1e2b33602131c","score":"0.5484251","text":"public void gameStartRequest(TableEvent event) {\r\n Enumeration tEnum;\r\n TrucoGameClient tGame;\r\n TrucoTeam tTeams[];\r\n \r\n System.out.println(\"Requesting game start...\");\r\n \r\n tTeams = event.getTable().createTeams();\r\n \r\n // se crea el TrucoGame con los teams creados\r\n tGame = new TrucoGameClient(tTeams[0], tTeams[1]);\r\n \r\n // se llama al 'startGame' de todas las tablas\r\n tEnum = tables.elements();\r\n while (tEnum.hasMoreElements()) {\r\n ((Table) tEnum.nextElement()).startGame(tGame);\r\n }\r\n \r\n // da la orden de inicio de juego a 'tGame'\r\n tGame.startGame();\r\n \r\n jbJoin.setEnabled(false);\r\n }","title":""},{"docid":"4f3e11d8b634b8614d8b55f60bd446ee","score":"0.5472051","text":"List<CellBean> createCells(NewGameRequest request);","title":""},{"docid":"a2c15c571e63a4247b40d8df60614d66","score":"0.54004246","text":"@Override\n public View onCreateView(LayoutInflater inflater, ViewGroup container,\n Bundle savedInstanceState) {\n View v = inflater.inflate(R.layout.fragment_frag__new_request, container, false);\n\n doRequest= (CardView) v.findViewById(R.id.doNewRequest);\n partyn = v.findViewById(R.id.editTextNumber);\n\n ref = database.getReference(\"Games\");\n actv = v.findViewById(R.id.autoCompleteTextView);\n\n ref.addValueEventListener(new ValueEventListener() {\n\n @Override\n public void onDataChange(@NonNull DataSnapshot snapshot) {\n for(DataSnapshot game : snapshot.getChildren()){\n gameList.add(game.getValue().toString());\n }\n String[] gameListA = gameList.toArray(new String[gameList.size()]);\n ArrayAdapter<String> adapter = new ArrayAdapter<String>(getContext(), android.R.layout.select_dialog_item,gameListA);\n actv.setThreshold(1);\n actv.setAdapter(adapter);\n\n }\n\n @Override\n public void onCancelled(@NonNull DatabaseError error) {\n\n }\n });\n\n doRequest.setOnClickListener(v1 -> {\n String gameText = actv.getText().toString();\n String partyText = partyn.getText().toString();\n\n if(gameText.isEmpty()|| partyText.isEmpty()){\n Toast.makeText(getActivity(),\"Please fill all fields!\",Toast.LENGTH_SHORT).show();\n return;\n }\n\n if(!gameList.contains(gameText)){\n Toast.makeText(getActivity(),\"Invalid game!\",Toast.LENGTH_SHORT).show();\n return;\n }\n if(Integer.parseInt(partyText)<=1){\n Toast.makeText(getActivity(),\"Min party size is 2!\",Toast.LENGTH_SHORT).show();\n return;\n }\n if(Integer.parseInt(partyText)>10){\n Toast.makeText(getActivity(),\"Max party size is 10!\",Toast.LENGTH_SHORT).show();\n return;\n }\n\n\n date = new Date();\n\n requestData=new HashMap<>();\n requestData.put(\"game\",gameText);\n requestData.put(\"messageDate\",dateFormat.format(date));\n requestData.put(\"messageTime\", timeFormat.format(date));\n requestData.put(\"time\",dateFormat.format(date) + \" \" +timeFormat2.format(date));\n requestData.put(\"partyCurr\",\"1\");\n requestData.put(\"partySize\",partyText);\n requestData.put(\"sentBy\", Frag_Login.mAuth.getCurrentUser().getDisplayName());\n\n\n chatData = new HashMap<>();\n chatData.put(\"message\",\"Link Start! ChatRoom initialized!\");\n chatData.put(\"messageDate\",dateFormat.format(date));\n chatData.put(\"messageTime\",timeFormat.format(date));\n chatData.put(\"time\",dateFormat.format(date) + \" \" +timeFormat.format(date));\n chatData.put(\"sentBy\",\"PartyUp\");\n\n String requestUID = Frag_Login.mAuth.getCurrentUser().getEmail()+timeFormat2.format(date);\n String firstMessageId = \"Admin\"+timeFormat2.format(date);\n String hash = new String(Hex.encodeHex(DigestUtils.md5(requestUID)));\n String hash2 = new String(Hex.encodeHex(DigestUtils.md5(firstMessageId)));\n String hash3 = new String(Hex.encodeHex(DigestUtils.md5(Frag_Login.mAuth.getCurrentUser().getEmail())));\n ref2 = database.getReference(\"Requests/\"+hash);\n ref3 = database.getReference(\"chatMessages/\"+hash+\"/\"+hash2);\n ref4 = database.getReference(\"activeChats/\"+hash3);\n\n activeChat = new HashMap<>();\n activeChat.put(\"chat\",hash);\n requestData.put(\"id\",hash);\n\n try {\n ref2.setValue(requestData);\n ref3.setValue(chatData);\n ref4.setValue(activeChat);\n }\n\n catch (Exception ex){\n Toast.makeText(getActivity(),\"Ups! Something went wrong...\", Toast.LENGTH_SHORT).show();\n return;\n }\n\n\n Navigation.findNavController(v).navigate(R.id.action_Home_to_frag_Chat);\n actv.setText(\"\");\n partyn.setText(\"\");\n\n });\n return v;\n }","title":""},{"docid":"093006e99d24b2343655468821dcd557","score":"0.53459936","text":"GameLobby createGameLobby(Game game, GamePlayer player);","title":""},{"docid":"12db10e1590ec92e36c5242a400e0dbe","score":"0.5328459","text":"private void setGamesList(JSONObject newMsg)\n {\n this.waitingGamesList = new LinkedList<>();\n if (newMsg.getString(\"isEmpty\").equals(\"false\"))\n {\n JSONArray gamesList = newMsg.getJSONArray(\"gamesList\");\n for (int i = 0; i < gamesList.length(); i++)\n {\n JSONObject game = gamesList.getJSONObject(i);\n Game waitingGame = null;\n JSONArray users = game.getJSONArray(\"users\");\n for (int j = 0; j < users.length(); j++)\n {\n JSONObject user = users.getJSONObject(j);\n User newUser = new User(user.getString(\"nick\"), user.getString(\"identifier\"),\n user.getString(\"ip\"), user.getInt(\"ranking\"));\n if (j == 0)\n {\n switch (game.getString(\"type\"))\n {\n case \"CONCURRENT\":\n waitingGame = new ConcurrentGame(gamePanel, newUser, game.getInt(\"playersNumber\"));\n break;\n case \"COOPERATION\":\n waitingGame = new CooperationGame(gamePanel, newUser, game.getInt(\"playersNumber\"));\n break;\n }\n }\n else\n {\n waitingGame.addUser(newUser);\n }\n }\n waitingGamesList.add(waitingGame);\n }\n }\n }","title":""},{"docid":"791d7305239c26c5d1d573f28d8ca286","score":"0.5303352","text":"protected void onReceivedResults(GameList gameList) {\n // nothing to do\n }","title":""},{"docid":"373645b0bd9d81083842d28323e91ef0","score":"0.52925766","text":"public Message process(ClientState client, Message request) {\n\t\tString xmlString = new String();\n\n\t\tNode joinGameRequest = request.contents.getFirstChild();\n\t\tNamedNodeMap map = joinGameRequest.getAttributes();\n\t\tString ID = map.getNamedItem(\"gameId\").getNodeValue();\n\t\tString password = map.getNamedItem(\"password\").getNodeValue();\n\t\tString name = map.getNamedItem(\"name\").getNodeValue();\n\n\t\t// ArrayList<Game> games=model.getGames();\n\t\t// if(model.getGamenames().contains(ID)){\n\t\t\n\t\tfor (Game g : model.getGames()) {\n\t\t\tif (g.getGameID().equals(ID) && g.isactived()) {\n\t\t\t\tif (!g.checkisLocked()) {\n\t\t\t\t\tif (model.isPasswordCorrect(ID, password)) {\n\t\t\t\t\t\tg.addPlayer(name,client.id());\n\t\t\t\t\t\tString player = new String();\n\t\t\t\t\t\tArrayList<Player> Players = g.getPlayers();\n\t\t\t\t\t\tfor (Player p : Players) {\n\t\t\t\t\t\t\tplayer = player + \"<player name='\" + p.getName() + \"' position = '\"\n\t\t\t\t\t\t\t\t\t+ p.getPlayerLocation().getColumn() + \",\" + p.getPlayerLocation().getRow()\n\t\t\t\t\t\t\t\t\t+ \"' board = '\" + g.getPlayerboard(p) + \"' score='\" + p.getScore() + \"'/>\";\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// Construct message reflecting state\n\n\t\t\t\t\t\txmlString = Message.responseHeader(request.id()) + \"<boardResponse gameId='\" + g.getGameID()\n\t\t\t\t\t\t\t\t+ \"' managingUser = '\" + g.getManageUsername() + \"' bonus = '\"\n\t\t\t\t\t\t\t\t+ g.getBoard().getBonusCell().getColumn() + \",\" + g.getBoard().getBonusCell().getRow()\n\t\t\t\t\t\t\t\t+ \"' >\" + player + \"</boardResponse>\" + \"</response>\";\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t} else {\n\t\t\t\t\t\txmlString = Message.responseHeader(request.id(), \"password is incorrect\")\n\t\t\t\t\t\t\t\t+ \"<joinGameResponse gameId='\" + g.getGameID() + \"'>\" + \"</joinGameResponse>\"\n\t\t\t\t\t\t\t\t+ \"</response>\";\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\txmlString = Message.responseHeader(request.id(), \"game is locked\")\n\t\t\t\t\t\t\t+ \"<joinGameResponse gameId='\" + g.getGameID() + \"'>\" + \"</joinGameResponse>\"\n\t\t\t\t\t\t\t+ \"</response>\";\n\t\t\t\t\tbreak;\n\n\t\t\t\t}\n\t\t\t}\n\t\t\txmlString = Message.responseHeader(request.id(), \"game is not exist\") + \"<joinGameResponse gameId='\" + ID + \"'>\"\n\t\t\t\t\t+ \"</joinGameResponse>\" + \"</response>\";\n\t\t}\n\t\t\n\n\t\t\n\t\tMessage message = new Message(xmlString);\n\t\t// all other players on game (excepting this particular client) need to\n\t\t// be told of this\n\t\t// same response. Note this is inefficient and should be replaced by\n\t\t// more elegant functioning\n\t\t// hint: rely on your game to store player names...\n\t\tGame game=model.getGame(ID);\n\t\tfor (Player p : game.getPlayers()) {\n\t\t\tfor (String id : Server.ids()) {\n\t\t\t\tif (!id.equals(client.id()) && id.equals(p.getClientId())) {\n\t\t\t\t\t\n\t\t\t\t\t\tServer.getState(id).sendMessage(message);\n\t\t\t\t\t\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// send this response back to the client which sent us the request.\n\t\treturn message;\n\t}","title":""},{"docid":"b2059e4af7634834c5f49146081e8cde","score":"0.525653","text":"@EventListener\r\n private void handleLoadGameListEvent(LoadGameListEvent event) {\r\n tableView.printGameListMessage(tableService.loadGameList());\r\n }","title":""},{"docid":"ea8c68d0ae9a4c7d15f38648157fbf76","score":"0.52474535","text":"@PostMapping(path = \"/games\")\n public GameResponse createGame(@RequestBody GameRequest request) {\n logger.info(\"Create game request: \" + request.toString());\n int pits = request.getPits() == null ? PITS_DEFAULT : request.getPits();\n int stones = request.getStones() == null ? STONES_DEFAULT : request.getStones();\n String firstPlayerName = request.getFirstPlayer() == null || request.getFirstPlayer().isEmpty() ? DEFAULT_FIRST_PLAYER : request.getFirstPlayer();\n String secondPlayerName = request.getSecondPlayer() == null || request.getSecondPlayer().isEmpty() ? DEFAULT_SECOND_PLAYER : request.getSecondPlayer();\n GameModel createdGame = gameService.createGame(firstPlayerName, secondPlayerName, pits, stones);\n GameResponse response = new GameResponse();\n response.setGame(createdGame.getKalahGame().getGame());\n response.setId(createdGame.getId());\n logger.info(\"Game created: \" + createdGame.toString());\n return response;\n }","title":""},{"docid":"9e684cd3a4ea8530e79c763a7585c581","score":"0.52369946","text":"@EventListener\r\n private void handleLoadGameEvent(LoadGameEvent event) {\r\n GameTable gameTable = tableService.loadGame(event.getGameTableId());\r\n String playerId = tableService.getFreeSLot(gameTable.getGameTableID());\r\n if (playerId == null) {\r\n System.out.println(\"Sorry, no free slot.\");\r\n tableView.initGameLobby();\r\n } else {\r\n gameTable.setLeaver(false);\r\n for (Player p : gameTable.getPlayers()) {\r\n if (p.getPlayerId().equals(playerId)) {\r\n p.setControlledBy(\"human\");\r\n }\r\n }\r\n tableService.saveTable(gameTable);\r\n ClientUser clientUser = new ClientUser(gameTable.getGameTableID(), playerId);\r\n pollingService.setClientUser(clientUser);\r\n pollingService.setStartPolling(true);\r\n }\r\n\r\n }","title":""},{"docid":"a78db5b7fe97259c4be5012c2e4cb2f4","score":"0.52168065","text":"protected void processRequest(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n response.setContentType(\"application/json\");\n GameListManager gamesManager = ServletUtils.getGamesListManager(getServletContext());\n List<SingleGameResponse> games = new ArrayList<>();\n\n synchronized (getServletContext()) {\n List<SingleGameEntry> gamesList = gamesManager.getGames();\n for (SingleGameEntry seg : gamesList) {\n games.add(new SingleGameResponse(seg));\n }\n }\n\n ServletUtils.sendJsonResponse(response, new GamesListResponse((games)));\n }","title":""},{"docid":"c79b77e1cfc13579cecad0bd56576b8e","score":"0.5207033","text":"public interface GameInformationListener {\n void onSucceed();\n void onFailedMsg(String msg);\n void onGameTypeInforMation(List<GameTypeBean> list);\n\n void onGameInfor(List<GameInfoBean> li);\n}","title":""},{"docid":"60d6e632579c548c56d6082ef364b79e","score":"0.5205398","text":"public interface Request_listseeds {\n public void oncreate_seedlist(ArrayList<Seed> plants);\n}","title":""},{"docid":"b0ae865d7c732f12023a7caf41deb324","score":"0.5185745","text":"void sendWaitingLobbyList(String playerName);","title":""},{"docid":"7b0d9b1f403b22ad8bbcfbad09dee6f4","score":"0.51337457","text":"public BaseMessage GetRequest() {\n\t\treturn new EntryGameReq();\n\t}","title":""},{"docid":"f01e8c283065621e292f250c92ef16db","score":"0.50833184","text":"public void getGameNameListCallback(ErrorCode paramErrorCode, GameInfoList paramGameInfoList) {}","title":""},{"docid":"787c5f5c442232f684fdd2ae63f1ee60","score":"0.5063033","text":"Listener(PacketType requestType, int sessionID, int chunkNumber, int timeoutValue) {\n PacketType[] packetType = {requestType};\n this.listener = new MessageReceive(packetType, true);\n this.requestType = packetType;\n this.sessionID = sessionID;\n this.chunkNumber = chunkNumber;\n this.timeout = Util.GetCurrentTime() + timeoutValue;\n this.status = 0;\n this.listener.start();\n Util.DebugPrint(DbgSub.REQUESTING_CLIENT, \"RequestingClient: SessionID: \" + sessionID);\n }","title":""},{"docid":"e9c7a2d48387ab60152212e5e134c144","score":"0.5061808","text":"private void createListeners(final GameContainer container, final StateBasedGame game) {\r\n backBtn.addListener(new ClickListener() {\r\n\r\n public void onClick(Button clicked, float mx, float my) {\r\n game.enterState(MainMenuState.STATE_ID);\r\n }\r\n\r\n public void onDoubleClick(Button clicked, float mx, float my) {}\r\n public void onRightClick(Button clicked, float mx, float my) {}\r\n });\r\n connectBtn.addListener(new ClickListener(){\r\n public void onClick(Button clicked, float mx, float my) {\r\n socket = new Socket();\r\n final MatchMakingState state = thistate;\r\n new Thread(new Runnable(){\r\n private final String ip = ipBox.getText();\r\n @Override\r\n public void run() {\r\n try {\r\n socket.connect(new InetSocketAddress(ip, Constants.SERVER_PORT));\r\n instructionTxt = \"Waiting for another player to join.\";\r\n new MatchmakingNetworkingController(socket,state).start();\r\n }catch (IOException e) {\r\n instructionTxt = \"A connection could not be established. Please try again.\";\r\n ipBox.setText(e.getMessage());\r\n ipBox.setCursorVisible(true);\r\n }\r\n }\r\n }).start();\r\n }\r\n\r\n public void onDoubleClick(Button clicked, float mx, float my) {}\r\n public void onRightClick(Button clicked, float mx, float my) {}\r\n });\r\n }","title":""},{"docid":"b4be818a68cf807b1de84f09db246642","score":"0.50542945","text":"private Response.Listener<JSONObject> GetChatMessageOnSuccessListDataBind() {\n return new Response.Listener<JSONObject>() {\n @Override\n public void onResponse(JSONObject response) {\n try {\n\n JSONArray data = response.getJSONArray(\"data\");\n if (data.length() > 0) {\n for (int i = 0; i < data.length(); i++) {\n JSONObject j = data.getJSONObject(i);\n ChatMessage chatMessage = new ChatMessage(\n j.getString(\"MessageEMP_IDFrom\"),\n j.getString(\"MessageEMP_IDTo\"),\n j.getString(\"MessageText\"),\n j.getString(\"MessageID\"),\n Boolean.parseBoolean(j.getString(\"isMINE\")));\n chatMessageList.add(chatMessage);\n }\n\n\n }\n\n } catch (Exception e) {\n Log.v(\"arman\", e.getMessage());\n }\n }\n };\n\n }","title":""},{"docid":"fa9fcf97f913606df6b74d48a2dbc25b","score":"0.50455976","text":"private RequestWithList(com.google.protobuf.GeneratedMessageV3.Builder<?> builder) {\n super(builder);\n }","title":""},{"docid":"26dd9c10db32c7aa657cc09cf141bca3","score":"0.50299835","text":"void updateGameList();","title":""},{"docid":"ad66917da763d5e825bdb6803b15580f","score":"0.5029437","text":"void sendPlayersInLobbyList(String playerName);","title":""},{"docid":"78d716e4de25444dd64eaeac65baebb4","score":"0.5012921","text":"private void getFriendsList() {\n showProgressDialog();\n\n JsonArrayRequest jsonArrReq = new JsonArrayRequest(Request.Method.GET,\n Const.URL_JSON_OBJECTServer, null,\n new Response.Listener<JSONArray>() {\n\n /**\n * onResponse loops through the received JSON array to find each user name\n * @param response\n */\n @Override\n public void onResponse(JSONArray response) {\n JSONObject userObject;\n JSONArray serverArray;\n\n Log.v(TAG, response.toString());\n Log.v(TAG, \"the server is here\");\n\n serverArray = response;\n\n //add each name in the users friends server to a list\n for(int i = 0; i < serverArray.length(); i++) {\n try {\n userObject = serverArray.getJSONObject(i);\n for(int j = 0; j < idList.size(); j++) {\n if(userObject.get(\"id\").toString() == idList.get(j)) {\n Log.v(TAG, \"add friend\");\n friendsList.add(userObject.get(\"name\").toString());\n idFriendsList.add(userObject.get(\"id\").toString());\n }\n }\n } catch (JSONException e) {\n e.printStackTrace();\n }\n }\n\n adapter = new ArrayAdapter(FriendsActivity.this, android.R.layout.simple_list_item_1, friendsList);\n f_listView.setAdapter(adapter);\n hideProgressDialog();\n }\n }, new Response.ErrorListener() {\n\n /**\n * onErrorResponse responds to errors if there is an unsuccessful volley request\n * @param error\n */\n @Override\n public void onErrorResponse(VolleyError error) {\n Log.v(TAG, \"Error: \" + error.getMessage());\n hideProgressDialog();\n }\n });\n\n AppController.getInstance().addToRequestQueue(jsonArrReq, \"jobj_req\");\n }","title":""},{"docid":"442de211a3257ebc86ebc7d42b974af1","score":"0.5003774","text":"public String createGamesForSending()\r\n\t{\r\n\t\tStringBuilder builder = new StringBuilder(\"#game#list#\");\r\n\r\n\t\t// Donner uniquement les parties en attente. Le client n'a effectivement\r\n\t\t// aucun interet de recevoir une liste de partie dont il n'a pas la possibilite de\r\n\t\t// rejoindre\r\n\t\tGame[] games = this.gameList.getWaitingGames();\r\n\r\n\t\tfor (Game game : games)\r\n\t\t{\r\n\t\t\t// Ajouter l'ID de la partie, le proprietaire ainsi que le nombre de joueur\r\n\t\t\tbuilder.append(game.getID() + \"#\");\r\n\t\t\tbuilder.append(game.getOwner() + \"#\");\r\n\t\t\tbuilder.append(game.getType() + \"#\");\r\n\t\t\tbuilder.append(game.getNbPlayers() + \"#\");\r\n\t\t}\r\n\r\n\t\treturn builder.toString();\r\n\r\n\t}","title":""},{"docid":"66c0d68abbe9e072db43614d17c28dbb","score":"0.50006735","text":"public void onRequest();","title":""},{"docid":"cb3379e9320b3e77ee290bfc63682259","score":"0.4996951","text":"void createGame(Session session, Message message);","title":""},{"docid":"7c450fa33aded6ddc2a9d38e2a691b58","score":"0.49750993","text":"private void respondWithRequests() {\n\t\tbyte data[] = new byte[1];\n\t DatagramPacket receivePacket = new DatagramPacket(data, data.length);\n\t\ttry {\n\t // Block until a datagram is received via socket. \n\t\t\tschedulerSocket.receive(receivePacket);\n\t\t\tSystem.out.println(\"Packet recieved with a request for the list of requests\");\n\t } catch(IOException e) {\n\t \te.printStackTrace();\n\t \tSystem.exit(1);\n\t }\n\t\t\n\t\tByteArrayOutputStream stream = new ByteArrayOutputStream();\n\t\ttry {\n\t\t\tObjectOutputStream oStream = new ObjectOutputStream(stream);\n\t\t\toStream.writeObject(requests);\n\t\t\toStream.close();\n\t\t\tstream.close();\n\t\t} catch (IOException e) {\n\t\t\te.printStackTrace();\n\t\t\tSystem.exit(1);\n\t\t}\n\t\t\n\t\tbyte[] sendData = stream.toByteArray();\n\t\ttry {\n\t\t\tDatagramPacket sendPacket = new DatagramPacket(sendData, sendData.length, receivePacket.getAddress(), receivePacket.getPort());\n\t\t\tschedulerSocket.send(sendPacket);\n\t\t\tSystem.out.println(\"Packet sent with the list of requests\");\n\t }\n\t\tcatch (IOException e) {\n\t e.printStackTrace();\n\t System.exit(1);\n\t }\n\t}","title":""},{"docid":"70377229656b756e9c0b26ae6c633401","score":"0.4965145","text":"private void loadList() {\n\n // TODO need to filter non-hosting events\n evntlist.clear();\n mServerRequestModule.getEventsRequest(getString(R.string.event_get_in), new VolleyEventListCallback() {\n @Override\n public void onEventsListSuccessResponse(JSONArray data) {\n String you = ident.getValue(getString(R.string.user_id));\n try {\n ((FragHostActivity) getActivity()).sortResponseToList(evntlist, data, you, true);\n } catch (NullPointerException e) {\n e.printStackTrace();\n } catch (Exception e) {\n e.printStackTrace();\n }\n\n // TODO This is a hack to refresh the view, so we redraw the list\n if (getFragmentManager() != null) {\n getFragmentManager().beginTransaction().detach(ctx).attach(ctx).commit();\n }\n }\n\n @Override\n public void onErrorResponse(String result) {\n Toast.makeText(context, \"unable to load events currently\", Toast.LENGTH_LONG).show();\n }\n });\n\n }","title":""},{"docid":"b718599c3647f129192450ffbd076b4b","score":"0.49621305","text":"public interface TournamentListListener {\n\n public void manageTournamentPlayersScores(TournamentDTO t);\n public void editTournament(TournamentDTO t);\n public void viewLeaderBoard(TournamentDTO t);\n\n public void takePictures(TournamentDTO t);\n public void viewGallery(TournamentDTO t);\n public void manageTournamentTees(TournamentDTO t);\n\n public void inviteAppUser();\n public void uploadVideo(TournamentDTO t);\n\n public void sendPlayerTextMessage(TournamentDTO t);\n public void sendPlayerEmail(TournamentDTO t);\n\n public void removeTournament(TournamentDTO t);\n public void deleteSampleTournaments();\n}","title":""},{"docid":"a01ed11a1a08ffb72bcaed621b0b7c24","score":"0.49582583","text":"public interface OnH5GamesReceivedListener extends BaseUIListener {\n void onH5GamesReceivedSuccess(String userId, List<FindDataIntegralGameModel> games);\n\n void onH5GamesReceivedFailure(String message);\n}","title":""},{"docid":"ff35ae8a8b8098525ea9e7969d493a77","score":"0.49558043","text":"private NobleListReq(com.google.protobuf.GeneratedMessageV3.Builder<?> builder) {\n super(builder);\n }","title":""},{"docid":"7f19b43f2a6ed99ef1a060e272581868","score":"0.49359742","text":"public GameStartInfoResponse(String boardName, List<Player> playerList, String playerName) {\n this.playerName = playerName;\n this.boardName = boardName;\n this.playerList = playerList;\n }","title":""},{"docid":"6805927144cbcbd7eb7d0eb6ad717d01","score":"0.49298158","text":"public void checkMatchedStatus() {\n\n request = new StringRequest(Request.Method.POST, ServerDetails.MATCHING_CHECK_URL, new Response.Listener<String>() {\n\n // HANDLE RESPONSES\n @Override\n public void onResponse(String response) {\n\n try {\n\n JSONObject jsonObject = new JSONObject(response);\n\n\n if (jsonObject.names().get(0).equals(\"match_success\")) {\n\n // DISPLAY THE RESPONSE TO THE ANDROID ACTIVITY SCREEN\n // Toast.makeText(getApplicationContext(), \"You have a match\", Toast.LENGTH_SHORT).show();\n\n String isMatched = jsonObject.getString(\"isMatched\");\n\n // ONLY RUN IF THE USER HAS ACCEPTED THE MATCH\n if (isMatched.equals(\"1\")) {\n\n TextView UnmatchedBookings = findViewById(R.id.UnmatchedBookings);\n UnmatchedBookings.setVisibility(View.INVISIBLE);\n\n // SET ITEMS TO BE INVISIBLE\n TextView ActiveQueueTitle = findViewById(R.id.ActiveQueueTitle);\n ActiveQueueTitle.setText(\"Active Queue\");\n ActiveQueueTitle.setVisibility(View.VISIBLE);\n\n lView = (ListView) findViewById(R.id.ActiveQueues);\n\n String[] myQueueDetailsArray = getDataToGlobalVariableQueue();\n\n final int[] images = {R.drawable.pinlarge};\n final String[] version = {userName_matched};\n final String[] versionNumber = {myQueueDetailsArray[2]};\n\n lAdapter = new ListAdapter(bookings.this, version, versionNumber, images);\n\n lView.setAdapter(lAdapter);\n\n lView.setOnItemClickListener(new AdapterView.OnItemClickListener() {\n @Override\n public void onItemClick(AdapterView<?> adapterView, View view, int i, long l) {\n\n // START THE NEXT ACTIVITY\n // SHOW THE USER THAT THEY HAVE A MATCH\n Intent intent = new Intent(getApplicationContext(), match_details_active.class);\n intent.putExtra(\"matched_username\", userName_matched);\n intent.putExtra(\"matched_user_id\", userID_matched);\n intent.putExtra(\"times\", times);\n intent.putExtra(\"message\", Description);\n intent.putExtra(\"fee\", fee);\n intent.putExtra(\"view\", \"false\");\n startActivity(intent);\n\n }\n });\n\n } else if (!isMatched.equals(\"1\")){\n\n TextView ActiveQueueTitle = findViewById(R.id.ActiveQueueTitle);\n ActiveQueueTitle.setVisibility(View.INVISIBLE);\n\n TextView UnmatchedBookings = findViewById(R.id.UnmatchedBookings);\n UnmatchedBookings.setVisibility(View.VISIBLE);\n\n lView = (ListView) findViewById(R.id.UnmatchedBookingsList);\n\n String[] myQueueDetailsArray = getDataToGlobalVariableQueue();\n\n final int[] images = {R.drawable.pinlarge};\n final String[] version = {userName_matched};\n final String[] versionNumber = {myQueueDetailsArray[2]};\n\n lAdapter = new ListAdapter(bookings.this, version, versionNumber, images);\n\n lView.setAdapter(lAdapter);\n\n lView.setOnItemClickListener(new AdapterView.OnItemClickListener() {\n @Override\n public void onItemClick(AdapterView<?> adapterView, View view, int i, long l) {\n\n // START THE NEXT ACTIVITY\n // SHOW THE USER THAT THEY HAVE A MATCH\n Intent intent = new Intent(getApplicationContext(), match_details.class);\n intent.putExtra(\"matched_username\", userName_matched);\n intent.putExtra(\"matched_user_id\", userID_matched);\n intent.putExtra(\"times\", times);\n intent.putExtra(\"message\", Description);\n intent.putExtra(\"fee\", fee);\n intent.putExtra(\"matched\", \"no\");\n startActivity(intent);\n\n }\n });\n\n }else{\n\n // SET BOTH TO BE INVISIBLE\n\n TextView ActiveQueueTitle = findViewById(R.id.ActiveQueueTitle);\n ActiveQueueTitle.setVisibility(View.INVISIBLE);\n\n TextView UnmatchedBookings = findViewById(R.id.UnmatchedBookings);\n UnmatchedBookings.setVisibility(View.INVISIBLE);\n\n\n }\n\n } else {\n\n // DISPLAY ERROR RESPONSE TO THE ANDROID ACTIVITY SCREEN\n //Toast.makeText(getApplicationContext(), \"Error\" + jsonObject.getString(\"error\"), Toast.LENGTH_SHORT).show();\n\n }\n\n } catch (JSONException e) {\n // CATCH ERRORS\n e.printStackTrace();\n\n TextView ActiveQueueTitle = findViewById(R.id.ActiveQueueTitle);\n ActiveQueueTitle.setVisibility(View.INVISIBLE);\n\n TextView UnmatchedBookings = findViewById(R.id.UnmatchedBookings);\n UnmatchedBookings.setVisibility(View.INVISIBLE);\n\n }\n }\n }, new Response.ErrorListener() {\n\n @Override\n public void onErrorResponse(VolleyError error) {\n Toast.makeText(bookings.this, \"Oops!!! Something went wrong. Server must be offline\", Toast.LENGTH_SHORT).show();\n }\n }) {\n\n @Override\n protected Map<String, String> getParams() {\n\n HashMap<String, String> hashMap = new HashMap<>();\n hashMap.put(\"check_match_status\", \"\");\n hashMap.put(\"matched_id\", getIDFromGlobalVariable());\n return hashMap;\n\n }\n };\n\n myRequestQueue.add(request);\n\n }","title":""},{"docid":"2652077fc4b12f4705394f05bdcc85a3","score":"0.49002308","text":"@Test\n public void testNewGame() {\n Response response = makeRequest(\n Request\n .POST().url(testServerUrl().path(\"/new_game/\" + Integer.toString(100))));\n\n // Parse JSON to Java object\n Game request_game = response.payloadJsonAs(Game.class);\n assertEquals(48, request_game.deck.size());\n }","title":""},{"docid":"5bc0ae83d17427456c3b1d6f498edce7","score":"0.48947224","text":"@Override\n\tpublic Response createGame(String data) {\n\t\tRequestValues requestValues = createRequest(data);\n\t\tResponse response = post(wsBaseUri + \"/games\", body(requestValues.get(\"username\"), JSON_CONTENT_TYPE), ACCEPT_JSON_HEADER, createSessionHeader());\n\t\treturn rememberGame(response);\n\t}","title":""},{"docid":"95a6db84e0442dfc2d525e5da1a2a25a","score":"0.4894581","text":"@Override\n public ApplicationListener createApplicationListener () {\n return new MyGdxGame(new NoGameServiceClient());\n }","title":""},{"docid":"fddec87b9656f17e5a896a078798ee41","score":"0.48937267","text":"public interface GamePersistenceService {\n /**\n * Request all games\n * @param requestAllGamesEvent\n * @return\n */\n AllGamesEvent requestAllGames(RequestAllGamesEvent requestAllGamesEvent);\n\n /**\n * Create game\n * @param createGameEvent\n * @return\n */\n GameCreatedEvent createGame(CreateGameEvent createGameEvent);\n\n /**\n * Request game details\n * @param requestGameDetailsEvent\n * @return\n */\n GameDetailsEvent requestGameDetails(RequestGameDetailsEvent requestGameDetailsEvent);\n\n /**\n * Request game extended details\n * @param requestGameExtendedDetailsEvent\n * @return\n */\n GameExtendedDetailsEvent requestGameExtendedDetails(RequestGameExtendedDetailsEvent requestGameExtendedDetailsEvent);\n\n /**\n * Join event\n * @param joinGameEvent\n * @return\n */\n GameJoinedEvent joinGame(JoinGameEvent joinGameEvent);\n\n /**\n * Start game\n * @param startGameEvent\n * @return\n */\n GameStartedEvent startGame(StartGameEvent startGameEvent);\n\n /**\n * Update game player\n * @param updateGamePlayerEvent\n * @return\n */\n GamePlayerUpdatedEvent updateGamePlayer(UpdateGamePlayerEvent updateGamePlayerEvent);\n}","title":""},{"docid":"39d807a37ab37ef0d68891f92d2d649c","score":"0.48733112","text":"@Override\n public synchronized String newGame(Game game) {\n Set<String> usersSubscribed = game.getPlayers().values()\n .stream()\n .filter(p -> !(p instanceof ComPlayer))\n .map(Player::getPlayerId)\n .peek(p -> connectionsService.userActivityChanged(\n p, \"Playing against \"\n + game.getOpponents(p).stream().map(Player::getPlayerId).collect(Collectors.joining(\",\"))))\n .collect(Collectors.toSet());\n\n _GAMES.put(game, usersSubscribed);\n log.info(\"Created Game \" + game.getGameId() + \" with users subscribed: \" + usersSubscribed);\n gameLoggingService.log(\n game, GameLoggingService.STARTED,\n new ActionLog(\"Created Game\", viewExtractorService.extractGlobalSlimView(game)));\n\n return game.getGameId(); // return the id just for convenience\n }","title":""},{"docid":"ea4db77638fa1914b22bb60bcdd4a0a6","score":"0.48720306","text":"@Override\n public void run() {\n\n GameServer server = null;\n try {\n //Waiting client start the communication\n if(in.readLine().equals(\"100-START\")){\n sendProtocol(out,1,\"OK\");\n //Get username\n Protocole prot = receive(in);\n sendProtocol(out,1,\"OK\");\n\n //Get the gameMode\n int gameMode = Integer.parseInt(Protocole.receive(in).getData());\n sendProtocol(out,1,\"OK\");\n\n sendProtocol(out,1,\"END\");\n\n //Start the matchmaking system\n while (!in.readLine().equals(\"200-START\"));\n Client p = new Client(socket);\n //Search in the queue for a sever with a place for the new client\n for (GameServer s : servers.get(gameMode)) {\n if (s.getClientsCount() < gameMode) {\n server = s;\n LOG.info(String.format(\"Add client for server with game mode %d\", gameMode));\n break;\n }\n }\n // if there is no server we create a new one\n if (server == null) {\n\n LOG.info(String.format(\"New server with game mode %d\", gameMode));\n server = new GameServer(gameMode);\n servers.get(gameMode).add(server);\n }\n\n // the server will continue the managment\n server.playerJoin(p, prot.getData());\n }\n } catch (IOException e) {\n e.printStackTrace();\n // TODO Stop game server\n }\n }","title":""},{"docid":"75f2c917b4105ec8ce9da847489dfac1","score":"0.48609975","text":"public void onCreateEvent(View view) {\n\t\tListView playerList = (ListView)findViewById(R.id.list_event_create_players);\n\t\tSparseBooleanArray checkedPlayers = playerList.getCheckedItemPositions();\n\t\tif(checkedPlayers.size() < 3) {\n\t\t\tToast.makeText(this, R.string.toast_not_enough_player, Toast.LENGTH_LONG).show();\n\t\t} else {\n\t\t\tString location = ((EditText)findViewById(R.id.edit_event_creation_location)).getText().toString();\n\t\t\t\n\t\t\tif(location.length()<=0) {\n\t\t\t\tToast.makeText(this, R.string.toast_location_empty, Toast.LENGTH_LONG).show();\n\t\t\t} else {\n\t\t\t\tContentValues values = new ContentValues();\n\t\t\t\tvalues.put(Event.COLUMN_NAME_EVENT_DATE, new Date().getTime()/1000);\n\t\t\t\tvalues.put(Event.COLUMN_NAME_LOCATION, location);\n\t\t\t\tvalues.put(Event.COLUMN_NAME_FINISHED, false);\n\t\n\t\t\t\tSQLiteDatabase db = ScoreBoardDbHelper.getWriteDb(this);\n\t\t\t\tLong eventId = db.insert(Event.TABLE_NAME, null, values);\n\t\t\t\t\n\t\t\t\tint itemCount = playerList.getCount();\n\t\t\t\tLog.e(\"itemCount\", String.valueOf(itemCount));\n\t\t\t\tCursor item = null;\n\t\t\t\tfor(int i=0; i<itemCount; i++) {\n\t\t\t\t\tif(checkedPlayers.get(i)==true) {\n\t\t\t\t\t\titem = (Cursor) playerList.getItemAtPosition(i);\n\t\t\t\t\t\tvalues.clear();\n\t\t\t\t\t\tvalues.put(PlayerToEvent.COLUMN_NAME_EVENT_ID, eventId);\n\t\t\t\t\t\tvalues.put(PlayerToEvent.COLUMN_NAME_PLAYER_ID, item.getInt(item.getColumnIndex(Player.COLUMN_NAME_PLAYER_ID)));\n\t\t\t\t\t\t\n\t\t\t\t\t\tdb.insert(PlayerToEvent.TABLE_NAME, null, values);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t//Redirect vers l'activité de détail d'une rencontre\n\t\t\t\tIntent intent = new Intent(this, EventBoardActivity.class);\n\t\t\t\tintent.putExtra(EventBoardActivity.EVENT_BOARD_ID, eventId.toString());\n\t\t\t\tstartActivity(intent);\n\t\t\t}\n\t\t}\n\t}","title":""},{"docid":"639e0159533abdef49b17e238f6f9b9a","score":"0.48596737","text":"private void getIDList() {\n showProgressDialog();\n\n JsonArrayRequest jsonArrReq = new JsonArrayRequest(Request.Method.GET,\n Const.URL_JSON_OBJECTFRIENDS +user.getID(), null,\n new Response.Listener<JSONArray>() {\n\n /**\n * onResponse loops through the received JSON array to find each user name\n * @param response\n */\n @Override\n public void onResponse(JSONArray response) {\n JSONObject userObject;\n JSONArray serverArray;\n\n Log.v(TAG, response.toString());\n Log.v(TAG, \"the server is here\");\n\n serverArray = response;\n\n //add each name in the users friends server to a list\n for(int i = 0; i < serverArray.length(); i++) {\n try {\n userObject = serverArray.getJSONObject(i);\n Log.v(TAG, \"Found friend\");\n idList.add(userObject.get(\"friend\").toString());\n\n } catch (JSONException e) {\n e.printStackTrace();\n }\n\n }\n hideProgressDialog();\n }\n }, new Response.ErrorListener() {\n\n /**\n * onErrorResponse responds to errors if there is an unsuccessful volley request\n * @param error\n */\n @Override\n public void onErrorResponse(VolleyError error) {\n Log.v(TAG, \"Error: \" + error.getMessage());\n hideProgressDialog();\n }\n });\n\n AppController.getInstance().addToRequestQueue(jsonArrReq, \"jobj_req\");\n }","title":""},{"docid":"6d939c8999b9fe374b7cfab5a5d7e672","score":"0.4847361","text":"public interface GameService {\n /**\n * Creates new game from game creation message.\n */\n void createGame(Session session, Message message);\n\n /**\n * Sends updated game list to all users.\n */\n void updateGameList();\n\n /**\n * Removes selected game from game list.\n * Sends appropriate message to all users.\n */\n void startGame(Session session, Message message);\n}","title":""},{"docid":"54e0a5ff2d4fc3832116c8be99d221ba","score":"0.48461983","text":"public GameStartInfoResponse() {\n }","title":""},{"docid":"07826af6b7f31fe402e56097f4ef48de","score":"0.48335117","text":"public void listenForJobListRequests(){\n\t\t//Create and register the callback handler\n\t\tThriftServiceHandler handler = new ThriftServiceHandler();\n\t\tThriftService.Processor<ThriftServiceHandler> tp = new ThriftService.Processor<ThriftServiceHandler>(handler);\n\t\t\n\t\tTServerSocket serverSocket = null;\n\t\ttry {\n\t\t\t//Create a socket to listen a the specified port, create a server with the processor handler wrapper,\n\t\t\t//and begin to listen for connection.\n\t\t\tserverSocket = new TServerSocket(ThriftService.commPort);\n\t\t\tTServer.Args serverArgs = new TServer.Args(serverSocket).processor(tp);\n\t\t\tTSimpleServer server = new TSimpleServer(serverArgs);\n\t\t\tserver.serve();\n\t\t} catch (TTransportException e) {\n\t\t\t// TODO Auto-generated catch block\n\t\t\te.printStackTrace();\n\t\t} finally {\n\t\t\tserverSocket.close();\n\t\t}\n\n\t}","title":""},{"docid":"ec969e12cfecb8e0e00cce929e72f754","score":"0.4831824","text":"private void updateList() {\n\t\tArrayList<String> stringList = new ArrayList<String>();\n\t\t// Log.d(\"Size\", \"\"+arrayOfRequests.length);\n\t\tfor (int i = 0; i < requests.size(); i++) {\n\t\t\tstringList.add(requests.get(i).getName());\n\t\t}\n\n\t\tRequesterListAdapter listAdapter = new RequesterListAdapter(\n\t\t\t\tgetActivity(), requests);\n\n\t\tthis.setListAdapter(listAdapter);\n\t\tListView lv = this.getListView();\n\t\tlv.setTextFilterEnabled(true);\n\n\t\t// Anon class for ListView OnClick\n\t\tlv.setOnItemClickListener(new OnItemClickListener() {\n\t\t\tpublic void onItemClick(AdapterView<?> parent, View view,\n\t\t\t\t\tint position, long id) {\n\t\t\t\tindex = position;\n\t\t\t\tdialog = PopupDialog.getInstance(((Requester) getListAdapter().getItem(position)));\n\t\t\t\tdialog.show(getFragmentManager(), \"PopUpDialogFragment\");\n\t\t\t}\n\t\t});\n\t}","title":""},{"docid":"e0bf70af614bb8caddaea745a24d4aea","score":"0.48257372","text":"Game createGame(GameInformation game);","title":""},{"docid":"cdf11c53fbbf30a3fb88adcf7d735776","score":"0.48192444","text":"public void createTeam(Context context,final Team team, final ResponseHandlerCreateTeam responseHandler) {\n RequestQueue requestQueue = Volley.newRequestQueue(context);\n String url = \"http://ec2-34-230-82-126.compute-1.amazonaws.com/api/teams/teams.php\";\n StringRequest MyStringRequest = new StringRequest(Request.Method.POST, url, new Response.Listener<String>() {\n @Override\n public void onResponse(String response) {\n //This code is executed if the server responds, whether or not the response contains data.\n //The String 'response' contains the server's response.\n Log.i(\"Response from Create Team\", response);\n\n try {\n String in = response;\n JSONObject reader = new JSONObject(response);\n\n boolean hasId = reader.has(\"Id\");\n\n if (hasId) {\n Log.i(\"Team id?????\", reader.getString(\"Id\"));\n team.setTeamId(Integer.parseInt(reader.getString(\"Id\")));\n Log.i(\"Team Id after Set\", Integer.toString(team.getTeamId()));\n responseHandler.onSuccess(team);\n }\n else {\n Log.e(\"Create team failure in create team api method \" , \" \");\n responseHandler.onFailure();\n }\n }\n catch (Exception e){\n e.printStackTrace();\n }\n\n }\n }, new Response.ErrorListener() { //Create an error listener to handle errors appropriately.\n @Override\n public void onErrorResponse(VolleyError error) {\n //This code is executed if there is an error.\n Log.e(\"VOLLEY ERROR\", error.toString());\n responseHandler.onFailure();\n }\n }) {\n protected Map<String, String> getParams() {\n Map<String, String> MyData = new HashMap<String, String>();\n\n /*\n * This is where the information for each account would go to add to the database\n */\n MyData.put(\"organizer\", team.getOrganizer());\n MyData.put(\"teamName\", team.getTeamName()); //Add the data you'd like to send to the server.\n MyData.put(\"teamSize\", team.getSize());\n MyData.put(\"chalId\", team.getChallengeId());\n\n return MyData;\n }\n };\n\n requestQueue.add(MyStringRequest);\n\n\n }","title":""},{"docid":"b24307b392aa147b4349ddd27f95c2f2","score":"0.48152298","text":"private SkillListReq(com.google.protobuf.GeneratedMessageV3.Builder<?> builder) {\n super(builder);\n }","title":""},{"docid":"9a2dd2e32ce4618429ea56507bb627bf","score":"0.48107368","text":"public ServerResponse getAllGames() {\n\t\t\n\t\t//make post to proper url using json as the body of the request\n\t\tString url = \"/games/list\";\n\t\tServerResponse response = server.doGet(url);\n\t\t\n\t\tconverter.convertGameInfo(response);\n\t\treturn response; \n\t}","title":""},{"docid":"953d440bbaeaede24dadb8a0b15ed5d9","score":"0.48077035","text":"@Test\r\n\tpublic void testGetJoinableGames() {\r\n\t\tJSONObject serverResult;\r\n\t\tArrayList<Integer> result;\r\n\t\t\r\n\t\t//Valid game creation\r\n\t\tserverResult = new JSONObject();\r\n\t\tJSONArray games = new JSONArray();\r\n\t\tgames.add(1);\r\n\t\tserverResult.put(\"result\",\"success\");\r\n\t\tserverResult.put(\"games\",games);\r\n\t\tSendAsServer(serverResult);\r\n\t\tresult = GetJoinableGames();\r\n\t\tAssert.assertEquals(result.size(), 1);\r\n\t\tAssert.assertEquals((int)result.get(0), 1);\r\n\t}","title":""},{"docid":"a29bb162dd13202aab617638d6867b2f","score":"0.47961324","text":"private static List<User> createGameUserList(GameSession game) {\n List<User> list = new ArrayList<>();\n for (Player player : game.getPlayers()) {\n User foundUser = null;\n for (User user : Server.currentUsers) {\n if (user.getUserId() == player.getUserId()) {\n foundUser = user;\n break;\n }\n }\n if (foundUser != null) {\n list.add(foundUser);\n }\n }\n return list;\n }","title":""},{"docid":"5552219b970b9e576c548f907efb62b0","score":"0.47926193","text":"@Override\n\tpublic void holderListener(ArrayList<LeaveRequest> leaveRequestList) {\n\n\t}","title":""},{"docid":"723836bc7c7d2a8723532e34309f9cd2","score":"0.47747952","text":"@Override\n public void onCreate(Bundle savedInstanceState) {\n super.onCreate(savedInstanceState);\n setContentView(R.layout.list);\n\n Intent i = getIntent();\n String gameName = i.getStringExtra(\"name\");\n\n ref = new Firebase(Data.FIREBASE_URL + \"/games/\" + gameName);\n\n findViewById(R.id.viewNewButton).setOnClickListener(new View.OnClickListener() {\n @Override\n public void onClick(View v) {\n Intent i = new Intent(getApplicationContext(), NewGameActivity.class);\n startActivity(i);\n }\n });\n\n findViewById(R.id.viewJoinButton).setOnClickListener(new View.OnClickListener() {\n @Override\n public void onClick(View v) {\n Intent i = new Intent(getApplicationContext(), JoinActivity.class);\n startActivity(i);\n }\n });\n\n findViewById(R.id.viewListButton).setOnClickListener(new View.OnClickListener() {\n @Override\n public void onClick(View v) {\n Intent i = new Intent(getApplicationContext(), ListGamesActivity.class);\n startActivity(i);\n }\n });\n }","title":""},{"docid":"43001ce5ee39252c2349dfe8417ccff8","score":"0.47735706","text":"public void run() {\n while (true) {\n try {\n System.out.println(\"running...\");\n //Reset all relavent variables\n incoming = new byte[256];\n outgoing = new byte[256];\n userExists = false;\n gameAddress = null;\n returnPacket = null;\n genericPacket = null;\n gameInstance = null;\n\n //Receive a game.packet (or maybe lobby.packet)\n DatagramPacket packet = new DatagramPacket(incoming, incoming.length);\n socket.receive(packet);\n\n System.out.println(\"gameServer packet received\");\n\n //Obtain port and address of the sender.\n address = packet.getAddress();\n port = packet.getPort();\n\n if (incoming[0] == OpCode.START_GAME.valueOf()) {\n /*\n * PRE-GAME: A new game has just been started. Add it to the list of currently active games.\n */\n System.out.println(\"game.server START_GAME\");\n StartGamePacket sgp = new StartGamePacket(incoming);\n gameList.ensureCapacity(gameList.size() + 1);\n GameInstance newGame = new GameInstance(sgp.getLobbyId(), sgp.getOptions(), sgp.getMSD());\n gameList.add(newGame);\n //END\n } else if (incoming[0] == OpCode.JOIN.valueOf()) {\n /*\n * PRE-GAME: A game has been started, add these users to the game.\n */\n System.out.println(\"game.server JOIN\");\n JoinLobbyPacket jlp = new JoinLobbyPacket(incoming);\n for (GameInstance game : gameList)\n if (Utilities.compareLobbyIds(game.getGameId(), jlp.getLobbyId()))\n game.addUsers(jlp.getUsers());\n //END\n } else {\n outgoing = incoming;\n genericPacket = new GenericPacket(incoming);\n gameAddress = Utilities.idAsInetAddress(genericPacket.getGameId());\n\n for (GameInstance game : gameList)\n if (Utilities.compareLobbyIds(genericPacket.getGameId(), game.getGameId()))\n gameInstance = game;\n }\n\n if (gameInstance != null) {\n if (incoming[0] == GameOps.GAME_INFO.valueOf()) {\n //A new game is being requested to start. If lobby Id is not in use it can start.\n System.out.println(\"game.server GAME_INFO\");\n GenericPacket gp = new GenericPacket(incoming);\n //Send Game Options\n outgoing = new StartGamePacket(gameInstance.getGameId(), gameInstance.getAllOptions(), gameInstance.getMSD(), gp.getNation()).getPacket();\n //END\n } else if (incoming[0] == GameOps.GAME_USERS.valueOf()) {\n /*\n * Users of a game have been requested. Send the list of users in game with matching game Id.\n */\n System.out.println(\"game.server GAME_USERS\");\n GenericPacket gp = new GenericPacket(incoming);\n gameInstance.setupGame();\n //Send Users\n if (!gameInstance.isGameFull()) {\n //One Packet\n outgoing = new JoinLobbyPacket(gameInstance.getGameId(), gameInstance.getUsers()).getPacket();\n DatagramPacket addUsersPacket = new DatagramPacket(outgoing, outgoing.length, gameAddress, Ports.GAME_CLIENT_PORT);\n socket.send(addUsersPacket);\n } else {\n //Two Packets\n ArrayList<User> firstSixUsers = new ArrayList<User>(gameInstance.getUsers().subList(0,6));\n outgoing = new JoinLobbyPacket(gameInstance.getGameId(), firstSixUsers).getPacket();\n DatagramPacket firstSixPacket = new DatagramPacket(outgoing, outgoing.length, gameAddress, Ports.GAME_CLIENT_PORT);\n socket.send(firstSixPacket);\n\n outgoing = new JoinLobbyPacket(gameInstance.getGameId(), gameInstance.getUsers().get(6)).getPacket();\n DatagramPacket lastUserPacket = new DatagramPacket(outgoing, outgoing.length, gameAddress, Ports.GAME_CLIENT_PORT);\n socket.send(lastUserPacket);\n }\n outgoing = new GameReadyPacket(gp.getGameId(), gp.getNation()).getPacket();\n //END\n } else if (incoming[0] == GameOps.PLACE_UNITS.valueOf()) {\n /*\n * Units have been placed on the map. Update the servers instance of the map.\n */\n System.out.println(\"game.server PLACE_UNITS\");\n GamePlaceUnitsPacket placeUnits = new GamePlaceUnitsPacket(incoming);\n\n Region region = gameInstance.getMap().getRegionFromIndex(placeUnits.getRegionIndex(), placeUnits.getRegionType());\n ArrayList<MilitaryUnit> units = Utilities.getUnitsFromPacket(placeUnits);\n boolean unitsAdded = UnitController.moveAllUnits(units, gameInstance.getMap().getRegion(region.toString()));\n\n if (!unitsAdded) {\n GameServerLogger.log(\"Unable to place units to region: \" + region.toString() + \" for nation: \" + placeUnits.getOwningNation());\n gameAddress = null; //todo if units aren't added.\n }\n //END\n } else if (incoming[0] == GameOps.UNITS_PLACED.valueOf()) {\n //Adding units have been finished for a specific nation.\n System.out.println(\"game.server ALL_UNITS_PLACED\");\n //END\n } else if (incoming[0] == GameOps.ADD_UNITS.valueOf()) {\n System.out.println(\"game.server ADD_UNITS\");\n GameAddUnitsPacket addUnits = new GameAddUnitsPacket(incoming);\n GameUtilities.doPurchaseUnits(addUnits, gameInstance.getNation(addUnits.getOwningNation()));\n //END\n /*\n * Political Actions\n */\n } else if (incoming[0] == GameOps.DECLARE_WAR.valueOf()) {\n System.out.println(\"game.server DECLARE_WAR\");\n WarDeclarationPacket warDec = new WarDeclarationPacket(incoming);\n gameInstance.getNation(warDec.getDeclaringNation()).declareWar(warDec.getEnemyNation(), warDec.getPapCost(), true);\n gameInstance.getNation(warDec.getEnemyNation()).declareWar(warDec.getDeclaringNation(), 0, false);\n //END\n } else if (incoming[0] == GameOps.SUE_FOR_PEACE.valueOf()) {\n System.out.println(\"game.server SUE FOR PEACE\");\n SueForPeacePacket sfp = new SueForPeacePacket(incoming);\n PoliticalUtilities.doSueForPeace(sfp.getSueingNation(), gameInstance);\n } else if (incoming[0] == GameOps.NATION_TO_CONTROL.valueOf()) {\n //Related to War Dec\n System.out.println(\"game.server NATION_TO_CONTROL\");\n NationToControlPacket ntc = new NationToControlPacket(incoming);\n for (User u : gameInstance.getUsers()) {\n if (u.getNation() == ntc.getUserToControl()\n || u.getControlledNPNs().contains(ntc.getUserToControl()))\n PoliticalUtilities.doControlNPN(gameInstance.getNation(ntc.getUncontrolledNation()), u, null,\n gameInstance.getUserByNPN(ntc.getUncontrolledNation()));\n }\n //END\n } else if (incoming[0] == GameOps.MULTI_NATION.valueOf()) {\n //Related to War Dec\n System.out.println(\"game.server MULTI_NATION\");\n //END\n } else if (incoming[0] == GameOps.RETALIATION_WAR.valueOf()) {\n //Related to War Dec\n System.out.println(\"game.server RETALIATION_WAR\");\n RetaliationWarDecPacket warRetaliation = new RetaliationWarDecPacket(incoming);\n if (warRetaliation.isDeclaring()) {\n gameInstance.getNation(warRetaliation.getRetaliator()).declareWar(warRetaliation.getInitDeclarer(), warRetaliation.getPapCost(), true);\n gameInstance.getNation(warRetaliation.getInitDeclarer()).declareWar(warRetaliation.getRetaliator(), 0, false);\n }\n //END\n } else if (incoming[0] == GameOps.SUE_FOR_PEACE.valueOf()) {\n SueForPeacePacket sfp = new SueForPeacePacket(incoming);\n ArrayList<Integer> congressNations = PoliticalUtilities.doSueForPeace(sfp.getSueingNation(), gameInstance);\n PoliticalUtilities.spoilsOfWar(congressNations, gameInstance.getNation(sfp.getSueingNation()));\n //END\n } else if (incoming[0] == GameOps.FORM_ALLIANCE.valueOf()) {\n System.out.println(\"game.server FORM ALLIANCE\");\n FormAlliancePacket fap = new FormAlliancePacket(incoming);\n //Alliance Accepted\n if ( !fap.isRequest() && fap.hasAccepted() ) {\n int nationOne = fap.getNationOne();\n int nationTwo = fap.getNationTwo();\n gameInstance.getNation(nationOne).formAlliance(nationTwo);\n gameInstance.getNation(nationTwo).formAlliance(nationOne);\n }\n //Alliance Rejected do nothing, just forward onto clients.\n //Alliance Requested do nothing, just forward onto clients.\n //END\n } else if (incoming[0] == GameOps.BREAK_ALLIANCE.valueOf()) {\n System.out.println(\"game.server BREAK ALLIANCE\");\n BreakAlliancePacket bap = new BreakAlliancePacket(incoming);\n PoliticalUtilities.doBreakAlliance(gameInstance.getNation(bap.getBreakingNation()), gameInstance.getNation(bap.getAlliedNation()));\n //END\n } else if (incoming[0] == GameOps.ARMISTICE.valueOf()) {\n System.out.println(\"game.server CONCLUDE ARMISTICE\");\n ConcludeArmisticePacket cap = new ConcludeArmisticePacket(incoming);\n //Armistice Accepted\n if ( !cap.isRequest() && cap.hasAccepted() )\n PoliticalUtilities.doConcludeArmistice(gameInstance.getNation(cap.getNationOne()), gameInstance.getNation(cap.getNationTwo()));\n //Armistice Rejected do nothing, just forward onto clients.\n //Armistice Requested do nothing, just forward onto clients.\n //END\n } else if (incoming[0] == GameOps.GRANT_PASSAGE.valueOf()) {\n System.out.println(\"game.server GRANT PASSAGE\");\n GrantPassagePacket gpp = new GrantPassagePacket(incoming);\n PoliticalUtilities.doGrantPassage(gameInstance.getNation(gpp.getGrantingNation()), gpp.getReceivingNation(), gpp.isVoluntary());\n //END\n } else if (incoming[0] == GameOps.RESCIND_PASSAGE.valueOf()) {\n System.out.println(\"game.server RESCIND PASSAGE\");\n RescindPassagePacket rpp = new RescindPassagePacket(incoming);\n PoliticalUtilities.doRescindPassage(gameInstance.getNation(rpp.getRescindingNation()), rpp.getLosingNation());\n //END\n } else if (incoming[0] == GameOps.CONTROL_NPN.valueOf()) {\n System.out.println(\"game.server CONTROL NPN\");\n } else if (incoming[0] == GameOps.RELEASE_NPN.valueOf()) {\n System.out.println(\"game.server RELEASE_NPN\");\n ReleaseNPNPacket rnp = new ReleaseNPNPacket(incoming);\n PoliticalUtilities.doReleaseNPN( gameInstance.getNation(rnp.getNonPlayerNation()), gameInstance.getUserByNation(rnp.getPlayerNation()),\n null, gameInstance.getMonth(), gameInstance.getYear());\n } else if (incoming[0] == GameOps.FAIL_CONTROL_NPN.valueOf()) {\n System.out.println(\"game.server FAIL_CONTROL NPN\");\n } else if (incoming[0] == GameOps.SETUP_DIPLOMAT.valueOf()) {\n System.out.println(\"game.server SETUP_DIPLOMAT\");\n } else if (incoming[0] == GameOps.NEXT_DIPLOMAT.valueOf()) {\n System.out.println(\"game.server NEXT_DIPLOMAT\");\n } else if (incoming[0] == GameOps.CONGRESS_ANNEX.valueOf()) {\n System.out.println(\"game.server CONGRESS_ANNEX\");\n CongressActionPacket cap = new CongressActionPacket(incoming);\n PoliticalUtilities.doCongressAnnex( gameInstance.getNation(cap.getSueingNation()), gameInstance.getNation(cap.getActionNation()),\n (LandRegion)gameInstance.getMap().getRegionFromIndex(cap.getRegionOneIndex(), Region.LAND_REGION) );\n if ( gameInstance.getNation(cap.getSueingNation()).isExtinct() )\n PoliticalUtilities.makeNationExtinct( gameInstance.getNation(cap.getSueingNation()) );\n } else if (incoming[0] == GameOps.CONGRESS_RESTORE.valueOf()) {\n System.out.println(\"game.server CONGRESS_RESTORE\");\n CongressActionPacket cap = new CongressActionPacket(incoming);\n PoliticalUtilities.doCongressRestore( gameInstance.getNation(cap.getSueingNation()),\n (LandRegion)gameInstance.getMap().getRegionFromIndex(cap.getRegionOneIndex(), Region.LAND_REGION) );\n if (cap.getRegionTwoIndex() > 0) {\n PoliticalUtilities.doCongressRestore( gameInstance.getNation(cap.getSueingNation()),\n (LandRegion)gameInstance.getMap().getRegionFromIndex(cap.getRegionTwoIndex(), Region.LAND_REGION) );\n }\n if ( gameInstance.getNation(cap.getSueingNation()).isExtinct() )\n PoliticalUtilities.makeNationExtinct( gameInstance.getNation(cap.getSueingNation()) );\n } else if (incoming[0] == GameOps.CONGRESS_FREESERF.valueOf()) {\n System.out.println(\"game.server CONGRESS_FREESERF\");\n CongressActionPacket cap = new CongressActionPacket(incoming);\n PoliticalUtilities.doCongressFreeSerfs( (LandRegion)gameInstance.getMap().getRegionFromIndex(cap.getRegionOneIndex(), Region.LAND_REGION) );\n if (cap.getRegionTwoIndex() > 0) {\n PoliticalUtilities.doCongressFreeSerfs( (LandRegion)gameInstance.getMap().getRegionFromIndex(cap.getRegionTwoIndex(), Region.LAND_REGION) );\n }\n if (cap.getRegionThreeIndex() > 0) {\n PoliticalUtilities.doCongressFreeSerfs( (LandRegion)gameInstance.getMap().getRegionFromIndex(cap.getRegionThreeIndex(), Region.LAND_REGION) );\n }\n } else if (incoming[0] == GameOps.CONGRESS_PASS.valueOf()) {\n System.out.println(\"game.server CONGRESS_PASS\");\n } else if (incoming[0] == GameOps.CONGRESS_MOVENPN.valueOf()) {\n System.out.println(\"game.server CONGRESS_MOVENPN\");\n MoveNPNUnitsPacket mnu = new MoveNPNUnitsPacket(incoming);\n PoliticalUtilities.moveNPNMilitary( gameInstance.getNation(mnu.getSueingNation()), gameInstance, null );\n /*\n * END Political Actions\n */\n } else if (incoming[0] == GameOps.CHAT.valueOf()) {\n //A game chat packet has been received.\n System.out.println(\"game.server CHAT\");\n //END\n }\n returnPacket = new DatagramPacket(outgoing, outgoing.length, gameAddress, Ports.GAME_CLIENT_PORT);\n } else {\n outgoing = new GameNotFoundPacket(genericPacket.getGameId(), genericPacket.getOpCode()).getPacket();\n returnPacket = new DatagramPacket(outgoing, outgoing.length, address, port);\n }\n\n //Send Packet if necessary\n if (gameAddress != null)\n socket.send(returnPacket);\n\n } catch (IOException e) {\n System.err.println(\"Game Server Thread IOerror.\");\n e.printStackTrace();\n GameServerLogger.log(\"GameServerThread - \" + e.getMessage());\n break;\n } catch (Exception e) {\n System.err.println(\"Game Server Thread has thrown an Error\");\n e.printStackTrace();\n GameServerLogger.log(\"GameServerThread - \" + e.getMessage());\n }\n }\n }","title":""},{"docid":"ea371b9b1b426a209b1d86c6936c1846","score":"0.47649124","text":"public ArrayList<GameInfo> createNewGame(String title, boolean randomHexes, boolean randomNumbers, boolean randomPorts) { //JoinGameController --goes in Setup !!Not sure if needed\n\t\t\n\t\tswitch (gameState) {\n\t\tcase Login:\n\t\t\tbreak;\n\t\tcase JoinGame:\n\t\t\tGameModel gameModel = new GameModel();\n\t\t\tgameModel.setRandomHexes(randomHexes);\n\t\t\tgameModel.setRandomNumbers(randomNumbers);\n\t\t\tgameModel.setRandomPorts(randomPorts);\n\t\t\tserverProxyFacade.createGame(title, randomHexes, randomNumbers, randomPorts);\n\t\t\tServerResponse serverResponse = serverProxyFacade.getAllGames();\n\t\t\tArrayList gameObjects = (ArrayList)serverResponse.getBody();\n\t\t\tArrayList<GameInfo> games = new ArrayList<GameInfo>();\n\t\t\tfor(Object game: gameObjects) {\n\t\t\t\tgames.add((GameInfo)game);\n\t\t\t}\n\t\t\treturn games;\n\t\tcase PlayerWaiting:\n\t\t\tbreak;\n\t\tcase Setup:\n\t\t\tbreak;\n\t\tcase GamePlay:\n\t\t\tbreak;\n\t\t}\n\t\treturn null;\n }","title":""},{"docid":"a02cecf09864926df45a79e70d550371","score":"0.47623578","text":"@Override\n protected void onCreate(Bundle savedInstanceState) {\n super.onCreate(savedInstanceState);\n setContentView(R.layout.activity_waiting_2_);\n Toolbar toolbar = (Toolbar) findViewById(R.id.toolbar);\n toolbar.setTitle(\"ChromeCast Cribbage\");\n setSupportActionBar(toolbar);\n\n getSupportActionBar().setDisplayHomeAsUpEnabled(true);\n\n playerOne = (TextView) findViewById(R.id.playerOne);\n playerTwo = (TextView) findViewById(R.id.playerTwo);\n playerThree = (TextView) findViewById(R.id.playerThree);\n playerFour = (TextView) findViewById(R.id.playerFour);\n\n //prev = getIntent().getExtras();\n //numPlayers = 3;//prev.getInt(\"players\");\n\n //mCastConnectionManager = Welcome_Activity.getCastConnectionManager();\n startButton = (Button) findViewById(R.id.startButton);\n\n Welcome_Activity.mCastConnectionManager.getGameManagerClient().setListener(this);\n\n JSONObject jsonMessage = new JSONObject();\n try {\n jsonMessage.put(\"getPlayers\", \"yes\");\n } catch (JSONException e) {\n Log.e(\"json\", \"Error creating JSON message\", e);\n return;\n }\n Welcome_Activity.mCastConnectionManager.getGameManagerClient().sendGameMessage(jsonMessage);\n\n }","title":""},{"docid":"7dfb1cb24e86d3061fdacf03490cc847","score":"0.47599876","text":"public void sendRequestLobbyEntranceMessage();","title":""},{"docid":"1c0cef7196f03753b764c019fe94a333","score":"0.4754649","text":"public void getEvent(String event_Id) {\n loadingIndicatorView.setVisibility(View.VISIBLE);\n JsonObjectRequest jsonObjectRequest = new JsonObjectRequest(ApiService.REQUEST_METHOD_GET, ApiService.GET_INVITATION_LIST+event_Id+\"?calendarType=mycalendar\",null, new Response.Listener<JSONObject>() {\n @Override\n public void onResponse(JSONObject response) {\n model = null;\n if(response!=null){\n try{\n eventResultModel = new Gson().fromJson(response.toString(), EventResultModel.class);\n model = (ArrayList<InvitationsModel>) eventResultModel.getInvitationList();\n setUpEventPartners();\n\n }catch (Exception e){\n e.printStackTrace();\n }\n\n }\n\n }\n }, new Response.ErrorListener() {\n @Override\n public void onErrorResponse(VolleyError error) {\n\n }\n }){\n @Override\n public Map<String, String> getHeaders(){\n HashMap<String, String> headers = new HashMap<String, String>();\n headers.put(\"Authorization\", \"Bearer \" + user_token);\n //headers.put(\"Content-Type\", \"application/json; charset=utf-8\");\n return headers;\n }\n\n };\n if (getActivity() != null) {\n RequestQueue requestQueue = Volley.newRequestQueue(getActivity());\n Log.d(\"Request\", jsonObjectRequest.toString());\n requestQueue.add(jsonObjectRequest);\n }\n }","title":""},{"docid":"bca158f44f899ddf524b0f468af7f104","score":"0.47517747","text":"public interface ListFollowerListener {\n\n void onLoadListUsers(ApiResponse.Users rankings);\n}","title":""},{"docid":"394efb6b4e6eee2e7446f7ecee5b5edb","score":"0.47475025","text":"@Override\n public Object createGame(Object player, java.util.List<?> questions) {\n Game game = new Game((Player) player);\n\n // Create GameAnswerList\n Map<Question, Integer> gameAnswers = new HashMap<>();\n for (Object question : questions) {\n gameAnswers.put((Question) question, -1);\n }\n game.setAnswerList(gameAnswers);\n\n return game;\n }","title":""},{"docid":"f5839af4aa7c44de463af4505bfb9182","score":"0.4735727","text":"private FetchWaiterListRequest fetchWaiterListRequest() {\n\n\n FetchWaiterListRequest fetchWaiterListRequest = new FetchWaiterListRequest();\n fetchWaiterListRequest.setRest_id(restid);\n\n Log.w(TAG,\"FetchWaiterListRequest\"+ new Gson().toJson(fetchWaiterListRequest));\n return fetchWaiterListRequest;\n\n }","title":""},{"docid":"5c8bc74aee520a333d5f76a7dec53f4a","score":"0.4731992","text":"public void createGameButtonHandler(ActionEvent event) {\n createGameButton.setDisable(true);\n // Start a server thread for the game\n startServerConnection();\n // Start a client connection\n startClientConnection();\n }","title":""},{"docid":"3bbc0d32a3193870687764ea648ac542","score":"0.47292057","text":"private void requestingResponseFromPlayer()\n {\n // CALL timer's start method\n timer.start();\n }","title":""},{"docid":"1b8683062636f6f50b841814af308afe","score":"0.4718098","text":"private void fetchChatRooms() {\n StringRequest strReq = new StringRequest(Request.Method.GET,\n EndPoints.CHAT_ROOMS, new Response.Listener<String>() {\n\n @Override\n public void onResponse(String response) {\n Log.e(TAG, \"response: \" + response);\n\n try {\n JSONObject obj = new JSONObject(response);\n\n // check for error flag\n if (obj.getBoolean(\"error\") == false) {\n JSONArray chatRoomsArray = obj.getJSONArray(\"chat_rooms\");\n for (int i = 0; i < chatRoomsArray.length(); i++) {\n JSONObject chatRoomsObj = (JSONObject) chatRoomsArray.get(i);\n ChatRoom cr = new ChatRoom();\n cr.setId(chatRoomsObj.getString(\"chat_room_id\"));\n cr.setName(chatRoomsObj.getString(\"name\"));\n cr.setLastMessage(\"\");\n cr.setUnreadCount(0);\n cr.setTimestamp(chatRoomsObj.getString(\"created_at\"));\n\n chatRoomArrayList.add(cr);\n }\n\n } else {\n // error in fetching chat rooms\n Toast.makeText(getApplicationContext(), \"\" + obj.getJSONObject(\"error\").getString(\"message\"), Toast.LENGTH_LONG).show();\n }\n\n } catch (JSONException e) {\n Log.e(TAG, \"json parsing error: \" + e.getMessage());\n Toast.makeText(getApplicationContext(), \"Json parse error: \" + e.getMessage(), Toast.LENGTH_LONG).show();\n }\n\n mAdapter.notifyDataSetChanged();\n\n // subscribing to all chat room topics\n subscribeToAllTopics();\n }\n }, new Response.ErrorListener() {\n\n @Override\n public void onErrorResponse(VolleyError error) {\n NetworkResponse networkResponse = error.networkResponse;\n Log.e(TAG, \"Volley error: \" + error.getMessage() + \", code: \" + networkResponse);\n Toast.makeText(getApplicationContext(), \"Volley error: \" + error.getMessage(), Toast.LENGTH_SHORT).show();\n }\n });\n\n //Adding request to request queue\n MyApplication.getInstance().addToRequestQueue(strReq);\n }","title":""},{"docid":"49f4912033d929a3b18e7750ef55614d","score":"0.47111684","text":"public void addScoreToTeam2(){\n SharedPreferences preferences = ctx.getSharedPreferences(\"User_status\", 0);\n long gameID = preferences.getLong(\"gameID\", 1);\n nullResponse();\n mVolleyService = new VolleyService(result, ctx);\n mVolleyService.putDataVolley(\"input\", \"http://172.31.82.149:8080/api/games/upScoret2/\" + String.valueOf(gameID), null);\n\n }","title":""},{"docid":"7ee16945b7161816fe46c1ce54de5b71","score":"0.47084653","text":"@Override\n public void onCreate(@Nullable Bundle savedInstanceState) {\n super.onCreate(savedInstanceState);\n ident = new IdentProvider(getContext());\n ctx = this;\n\n mServerRequestModule = ServerRequestModule.getInstance();\n if (mServerRequestModule == null) {\n Toast.makeText(context, \"serverProblem\", Toast.LENGTH_LONG).show();\n }\n // TODO server call for user's hosted/ing events here\n evntlist = new ArrayList<>();\n loadList();\n }","title":""},{"docid":"c6cc59b86867c1ac9b4c87e97b9d8eba","score":"0.47070715","text":"private void requestLobby() {\n\t\tsendMessage(Server.LOBBY + server.lobbyToString());\n\t}","title":""},{"docid":"0edcba0052e4502b4daab5d441f45fa9","score":"0.4706299","text":"ServerResponse handleAction(OnTurnStartRequest request);","title":""},{"docid":"b94c82a60cf5536aa9adf018896f5de0","score":"0.47039086","text":"@Override\r\n\tpublic TableResponse<Collections> list(TableRequest request) {\n\t\t return TableRequestHandler.<Collections> builder().countHandler(new CountHandler() {\r\n\r\n\t @Override\r\n\t public int count(TableRequest request) {\r\n\t return collectionsDao.count(request.getParams());\r\n\t }\r\n\t }).listHandler(new ListHandler<Collections>() {\r\n\r\n\t @Override\r\n\t public List<Collections> list(TableRequest request) {\r\n\t return collectionsDao.list(request.getParams(), request.getStart(), request.getLength());\r\n\t }\r\n\t }).build().handle(request);\r\n\t}","title":""},{"docid":"00710fae42f1c3732c7581ea53a466fd","score":"0.4700568","text":"public void onRequest(RequestType request, int code);","title":""},{"docid":"3ceff0c71e95b7f5d290b62e5fa92b88","score":"0.47002274","text":"private void loadAddPlayerResponse(){\n this.commandMap.put(\"addPlayerResponse\", jsonElement -> new AddPlayerCommand(\n jsonElement.getAsJsonObject().get(\"data\").getAsJsonObject().get(\"validNick\").getAsBoolean(),\n jsonElement.getAsJsonObject().get(\"data\").getAsJsonObject().get(\"lobbyState\").getAsBoolean(),\n jsonElement.getAsJsonObject().get(\"data\").getAsJsonObject().get(\"lobbySize\").getAsInt(),\n jsonElement.getAsJsonObject().get(\"data\").getAsJsonObject().get(\"fullLobby\").getAsBoolean()));\n }","title":""},{"docid":"abbfb0bec9a3c2968f9c91bc4e96eaf3","score":"0.4699022","text":"ServerResponse handleAction(OnPlayerRejoinRequest request);","title":""},{"docid":"ed9fddae5667fb50503bbdbd21c67aec","score":"0.46918783","text":"@Override\n public void onClick(View view) {\n b.getDataHandler(new Database.DataHandler() {\n @Override\n <T> void postReceivedData(T result) {\n BookingInstanceTableDO booking = (BookingInstanceTableDO) result;\n booking.setStatus(\"Rejected\");\n b.update(booking);\n }\n }).getData(BookingInstanceTableDO.class, bookingID);\n b.getDataHandler(new Database.DataHandler() { \n @Override\n <T> void postReceivedData(T result) {\n ProfTableDO prof = (ProfTableDO) result;\n List<String> blockedTimings = ((ProfTableDO) result).getProfBlockedTimings();\n blockedTimings.remove(timing.toString());\n prof.setProfBlockedTimings(blockedTimings);\n b.update(prof);\n }\n\n @Override\n public void showOnUI(Handler handler) {\n handler.post(new Runnable() {\n @Override\n public void run() {\n updatedResult.remove(requestsList.get(position));\n requestsList.clear();\n requestsList.addAll(updatedResult);\n notifyDataSetChanged();\n Toast.makeText(context, \"Request has been declined\", Toast.LENGTH_LONG).show();\n }\n });\n }\n }).getData(ProfTableDO.class, username);\n }","title":""},{"docid":"ca9e36a729554ba2761debed3798f64b","score":"0.46907654","text":"private void sendDialogDataToDataBase(String data) {\n AnswerInput answerInput = new AnswerInput(data,mParam2,mParam3);\n JSONObject json = null;\n try { \n json = new JSONObject(gson.toJson(answerInput));\n } catch (JSONException e) {\n e.printStackTrace();\n }\n\n JsonObjectRequest jsonObjectRequest = new JsonObjectRequest(Request.Method.POST, getString(R.string.add_new_answer), json,\n new Response.Listener<JSONObject>() {\n @Override\n public void onResponse(JSONObject response) {\n Log.i(tag,response.toString());\n AnswerResponse newAnswerResponse = gson.fromJson(response.toString(), AnswerResponse.class);\n progressBar.setVisibility(View.GONE);\n if (newAnswerResponse.getCode() == 1) {\n getAnswers();\n Toast.makeText(getContext(), getString(R.string.new_answer_added),Toast.LENGTH_LONG).show();\n }\n }\n }, new Response.ErrorListener() {\n @Override\n public void onErrorResponse(VolleyError error) {\n Log.i(tag,error.toString());\n Toast.makeText(getContext(), getString(R.string.error),Toast.LENGTH_LONG).show();\n progressBar.setVisibility(View.GONE);\n }\n });\n\n queue.add(jsonObjectRequest);\n }","title":""},{"docid":"abf730e17df9ef7368b70be855e38aaa","score":"0.46886235","text":"GameLobby getGameLobbyByGame(GameInformation gameInformation);","title":""},{"docid":"4d8c76fe100aadb447ef70d877cfcc3f","score":"0.46870893","text":"public static OverviewSmallRequest createOnListChooserResultRequest(String language){\n/*Generated! Do not modify!*/ OverviewSmallRequest resultInstance = new OverviewSmallRequest(\"onListChooserResult\", language);\n/*Generated! Do not modify!*/ return resultInstance;\n/*Generated! Do not modify!*/ }","title":""},{"docid":"6adc0fc4030a9d86d768fd1e6beede16","score":"0.46796504","text":"public void addScoreToTeam1(){\n SharedPreferences preferences = ctx.getSharedPreferences(\"User_status\", 0);\n long gameID = preferences.getLong(\"gameID\", 1);\n nullResponse();\n mVolleyService = new VolleyService(result, ctx);\n mVolleyService.putDataVolley(\"input\", \"http://172.31.82.149:8080/api/games/upScoret1/\" + String.valueOf(gameID), null);\n\n }","title":""},{"docid":"fc21d1d3f8fb92f5d4d58fa7c489ede5","score":"0.46749607","text":"private void create(RoutingContext routingContext) {\n HttpServerRequest request = routingContext.request();\n String query_params = request.query();\n String itemType = query_params.split(\"=\")[1];\n\n\t\t\tString skip_validation = \"false\";\n\t\t\tif (request.headers().contains(\"skip_validation\")) {\n\t\t\t\tskip_validation = request.getHeader(\"skip_validation\").toLowerCase();\n\t\t\t}\n\n\t\t\tif (decodeCertificate(routingContext)) {\n\t\t\t\tif (authenticateRequest(routingContext, \"user.list\")) {\n\t\t\t\t\ttry {\n\t\t\t\t\t\tJsonObject request_body = routingContext.getBodyAsJson();\n\t\t\t\t\t\trequest_body.put(\"onboardedBy\", onboarder);\n\t\t\t\t\t\trequest_body.put(\"role\", onboardedBy);\n\t\t\t\t\t\trequest_body.put(\"item-type\", itemType);\n\t\t\t\t\t\trequest_body.put(\"__createdBy\",onboardedBy);\n\t\t\t\t\t\tDeliveryOptions validator_action = new DeliveryOptions();\n\t\t\t\t\t\tvalidator_action.addHeader(\"action\", \"validate-item\");\n\n\t\t\t\t\t\tif (skip_validation != null) {\n\t\t\t\t\t\t\tif (!(\"true\".equals(skip_validation)) && !(\"false\".equals(skip_validation))) {\n\t\t\t\t\t\t\t\thandle400(routingContext, \"Invalid value: skip_validation is not a boolean\");\n\t\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tvalidator_action.addHeader(\"skip_validation\", skip_validation);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tvertx.eventBus().send(\"validator\", request_body, validator_action, validator_reply -> {\n\t\t\t\t\t\t\tif (validator_reply.succeeded()) {\n\t\t\t\t\t\t\t\tif (itemTypes.contains(itemType)) {\n\t\t\t\t\t\t\t\t\tdatabaseHandler(\"create\", routingContext, request_body);\n\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\thandle400(routingContext, \"No such item-type exists\");\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\thandle500(routingContext);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t});\n\n\t\t\t\t\t} catch (Exception e) {\n\t\t\t\t\t\thandle400(routingContext, \"Invalid item: Not a Json Object\");\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\thandle401(routingContext, \"Unauthorised\");\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\thandle400(routingContext, \"Certificate 'authenticaton' error\");\n\t\t\t}\n\n\t }","title":""},{"docid":"17e04b9cf253bfaac5f7bf9bd55c65e1","score":"0.46720138","text":"private static void createNewGame() {\n GameController gcontroller = GameController.createController(Configuration.logger);\n GameManager gm = GameManager.createGameStatusManager();\n GameRender gr = GameRender.createRender();\n\n gcontroller.setStatusManager(gm);\n gcontroller.setGameRender(gr);\n gm.setGameController(gcontroller);\n gr.setController(gcontroller);\n\n gcontroller.startNewGame();\n }","title":""},{"docid":"53a3d09e18a6592a2e2d0f99afecb341","score":"0.46662748","text":"public void sendCreateLobbyMessage(ILobbyInformation lobbyInformation);","title":""},{"docid":"4dfa809d40b65d6ebb9f17e3494058c0","score":"0.46634355","text":"public InventoryRequest(String item, String curr_qty, String min_qty, String max_qty, String category, String\n last_time_updated, Response.Listener<String> listener) {\n super(Request.Method.POST, REGISTER_REQUEST_URL, listener, null);\n params = new HashMap<>();\n\n System.out.println(\"INVENTORY REQUEST\" + item);\n System.out.println(\"curr_qty\" + curr_qty);\n System.out.println(\"min_qty\" + min_qty);\n System.out.println(\"max_qty\" + max_qty);\n System.out.println(\"category\" + category);\n System.out.println(\"last_time_updated\" + last_time_updated);\n\n\n params.put(\"item\", item);\n params.put(\"curr_qty\", curr_qty);\n params.put(\"min_qty\", min_qty);\n params.put(\"max_qty\", max_qty);\n params.put(\"category\", category);\n params.put(\"last_time_updated\", last_time_updated);\n }","title":""},{"docid":"66a63eee472052a47f416f5cc5f808b6","score":"0.4661386","text":"@Override\n\tpublic void onCreate(Bundle savedInstanceState) {\n\t\tsuper.onCreate(savedInstanceState);\n\t\tsetContentView(R.layout.all_games);\n\t\t\n\t\tloginSettings = getSharedPreferences(Login.PREFS_NAME, 0);\n\n\t\tmineTurnList = new ArrayList<Game>();\n\t\topponentTurnList = new ArrayList<Game>();\n\t\tfinishedGamesList = new ArrayList<Game>();\n\n // create our list and custom adapter \n adapter = new SeparatedListAdapter(this); \n \n adapter.addSection(\"Your turn\",new GameAdapter (this, android.R.layout.activity_list_item, mineTurnList)); \n adapter.addSection(\"Opponents turn\", new GameAdapter (this, android.R.layout.activity_list_item, opponentTurnList)); \n adapter.addSection(\"Finished games\", new GameAdapter (this, android.R.layout.activity_list_item, finishedGamesList));\n\t\t\n\t\tsetListAdapter(adapter);\n\t\tserviceintent = new Intent(\"com.main.service.TimerService\");\n\t\tserviceintent.putExtra(TimerService.URL, \"http://restserver.herokuapp.com/games/\" + Login.getUsername(loginSettings));\n\t}","title":""},{"docid":"87f61215d910442e0e2e17305d4573bb","score":"0.4660418","text":"protected void processRequest(HttpServletRequest request, HttpServletResponse response)\n throws ServletException, IOException {\n response.setContentType(\"application/json\");\n\n String gameNameFromSession = SessionUtils.getGameName(request);\n GameManager gameManager = ServletUtils.getGameManager(getServletContext());\n Game currGame = gameManager.getGames().get(gameNameFromSession);\n\n HashMap<Integer, HashMap<Integer, SoldierData>> soldierMap = new HashMap<>();\n\n for (Player p : currGame.getPlayerList()) {\n soldierMap.put(p.getPlayerNum(), createSoldierMap(p.getPlayerNum(), gameManager.getGames().get(gameNameFromSession)));\n }\n\n sendDataToClient(response, true, soldierMap);\n }","title":""},{"docid":"ff65a40c6faf86e7f8698dd437e4c1eb","score":"0.46573535","text":"public GameList() {\r\n gameData = new DoublyLinkedList();\r\n }","title":""},{"docid":"1d5befde46e8b4588be4cd3649766832","score":"0.46564278","text":"void createNewRoom(ServerPlayer serverPlayer, int maxPlayers) throws RoomException;","title":""},{"docid":"2bd25745fdc6d7a887ce901e8dfea9ba","score":"0.46561158","text":"public void addResponseForAllPlayersInTheSameGameMode(long exclusiveClientID, int gameMode, GameResponse response) {\n List<String> players = null;\n if (gameMode == Constants.GAME_TYPE_PVP) {\n players = getOnlinePlayersByCurrentPlayerLocation(1);\n } else if (gameMode == Constants.GAME_TYPE_PVE) {\n players = getOnlinePlayersByCurrentPlayerLocation(2);\n }\n\n if (players != null) {\n for (String player : players) {\n GameClient client = getThreadByPlayerUserName(player);\n if (client != null && client.getId() != exclusiveClientID) {\n client.addResponseForUpdate(response);\n } else {\n System.out.println(\"In GameServer. java --- There is a client in playerPositionTracker but his/her thread is not active any longer...\");\n }\n }\n }\n }","title":""},{"docid":"30b7ccd15a25b8deb46440f7b0561998","score":"0.46528327","text":"private void addEvents() {\n String tag_string_req_events = \"req_login_events\";\n\n\n Log.d(\"TAG\", \"REGG CLICKED \" );\n\n\n StringRequest strReq = new StringRequest(Request.Method.POST,\n AppConfig.URL_EVENTS, new Response.Listener<String>() {\n\n\n @Override\n public void onResponse(String response) {\n Log.d(\"TAG\", \"Login Response: \" + response.toString());\n\n //response is a html page\n //if success move to main activity of the app\n try {\n\n //create a login session\n Toast.makeText(getApplicationContext(),\n \"Successfully Registered\", Toast.LENGTH_LONG).show();\n\n Intent intent=new Intent(getApplicationContext(),MainActivity.class);\n intent.putExtra(\"position\", 2);\n startActivity(intent);\n finish();\n\n\n } catch (Exception e) {\n // JSON error\n\n e.printStackTrace();\n Toast.makeText(getApplicationContext(), \"Json error: \" + e.getMessage(), Toast.LENGTH_LONG).show();\n }\n\n }\n }, new Response.ErrorListener() {\n\n @Override\n public void onErrorResponse(VolleyError error) {\n Toast.makeText(getApplicationContext(),\n \"Successfully Registered\", Toast.LENGTH_LONG).show();\n\n Intent intent=new Intent(getApplicationContext(),MainActivity.class);\n intent.putExtra(\"position\", 2);\n startActivity(intent);\n finish();\n Log.e(\"TAG\", \"Login Error: \" + error.getMessage());\n // Toast.makeText(getApplicationContext(),error.getMessage(), Toast.LENGTH_LONG).show();\n\n }\n }) {\n\n @Override\n protected Map<String, String> getParams() {\n // Posting parameters to login url\n Map<String, String> params = new HashMap<String, String>();\n params.put(\"mobile\", spval);\n Log.d(\"TAG\",\"mobile: \"+spval);\n for (int i = 1; i <= EventsArray.array.length; i++) {\n params.put(\"event\" + i, EventsArray.array[i-1] +\"\");\n Log.d(\"TAG\",\"event\"+ i+\":\"+EventsArray.array[i-1] +\"\");\n }\n return params;\n }\n\n };\n AppController.getInstance().addToRequestQueue(strReq);\n\n\n }","title":""},{"docid":"dcbcb0b11b4ad27dfa26647008c05b1a","score":"0.46507958","text":"public StringRequest buildCheckServerRequest(){\n\n StringRequest healthRequest = new StringRequest(Request.Method.GET, BlissApiSingleton.BLISS_HEALTH_REQUEST,\n new Response.Listener<String>() {\n @Override\n public void onResponse(String response) {\n if(response!=null){\n JSONObject obj = null;\n try {\n obj = new JSONObject(response);\n String status = obj.getString(\"status\");\n if(status.equals(\"OK\")){\n Log.d(\"APP_DEBUG\",\"[RESPONSE] OK\");\n if(isDeepLink) {\n processDeepLink();\n }else\n setListFragment(null); //null means that we dont need to pass anything onto listfragment (no deeplink)\n }else{\n loadFragment.getView().findViewById(R.id.progressBar2).setVisibility(View.INVISIBLE);\n retryDialog();\n }\n } catch (JSONException e) {\n Toast.makeText(getApplicationContext(),BlissApiSingleton.ERROR_MESSAGE,Toast.LENGTH_SHORT).show();\n }\n }else{\n Toast.makeText(getApplicationContext(),BlissApiSingleton.ERROR_MESSAGE,Toast.LENGTH_SHORT).show();\n }\n }\n }, new Response.ErrorListener() {\n @Override\n public void onErrorResponse(VolleyError error) {\n Toast.makeText(getApplicationContext(),BlissApiSingleton.ERROR_MESSAGE,Toast.LENGTH_SHORT).show();\n }\n });\n\n return healthRequest;\n }","title":""},{"docid":"8fa44b66b47f03057f4d06484e88fcd1","score":"0.4646403","text":"private void addMyselfToPlayerList() {\n \tString androidId = \"?deviceId=\" + WillyShmoApplication.getAndroidId(); \n \tString latitude = \"&latitude=\" + WillyShmoApplication.getLatitude();\n \tString longitude = \"&longitude=\" + WillyShmoApplication.getLongitude();\n \tString trackingInfo = androidId + latitude + longitude;\n \t\n \tString url = resources.getString(R.string.domainName) + \"/gamePlayer/createAndroid/\" + trackingInfo + \"&userName=\";\n \tWebServerInterfaceNewPlayerTask webServerInterfaceNewPlayerTask = new WebServerInterfaceNewPlayerTask();\n \tfinal PlayOverNetwork playOverNetwork = this;\n \twebServerInterfaceNewPlayerTask.execute(playOverNetwork, url, mPlayer1Name, getApplicationContext(), resources);\n }","title":""},{"docid":"c9bcd21e2d2b12e56b90907256b19ff5","score":"0.46444288","text":"@Override\n public void onSuccessResponse(String response) {\n JSONArray jsonResponse = new JSONArray();\n try {\n jsonResponse = new JSONArray(response);\n } catch (JSONException e) {\n\n }\n\n list = (ListView) findViewById(R.id.rider_pool_list);\n\n backButton = (Button)findViewById(R.id.rider_pool_back_button);\n\n backButton.setOnClickListener(new View.OnClickListener() {\n @Override\n public void onClick(View v) {\n RiderPool.super.onBackPressed();\n }\n });\n\n // Pass results to ListViewAdapter Class\n adapter = new RiderPoolListAdapter(thisActivity, currentContext, jsonResponse, groupID, request, token);\n // Binds the Adapter to the ListView\n list.setAdapter(adapter);\n // Capture clicks on ListView items\n list.setOnItemClickListener(new AdapterView.OnItemClickListener() {\n @Override\n public void onItemClick(AdapterView<?> parent, View view,\n int position, long id) {\n\n }\n\n });\n }","title":""},{"docid":"e1c5664582f07d6861191596190e4b57","score":"0.4642655","text":"@Override\n public Receive createReceive() {\n return receiveBuilder().match(AdContext.class, adContext -> {\n Event event = new Event();\n event.setSessionId(adContext.getSessionId());\n event.setEventId(adContext.getEventId());\n event.setDeviceId(adContext.getDeviceId());\n event.setIpAddress(adContext.getIpAddress());\n event.setCountry(adContext.getCountry());\n event.setUserAgent(adContext.getUserAgent());\n event.setCookie(adContext.getCookieId());\n event.setTag(adContext.getTag());\n event.setCreativeId(adContext.getCreativeId());\n event.setCampaignId(adContext.getCampaignId());\n event.setAdvertiserId(adContext.getAdvertiserId());\n event.setAccountId(adContext.getAccountId());\n event.setCacheBuster(adContext.getCacheBuster());\n if (adContext.getParams() != null && !adContext.getParams().isEmpty()) {\n\n event.setAppBundle(adContext.getParams().get(PARAMS.EXTERNAL_BUNDLE_ID.getName()));\n event.setSite(adContext.getParams().get(PARAMS.EXTERNAL_SITE_ID.getName()));\n event.setLatitude(adContext.getParams().get(PARAMS.GPS_LAT.getName()));\n event.setLongitude(adContext.getParams().get(PARAMS.GPS_LNG.getName()));\n event.setAppId(adContext.getParams().get(PARAMS.EXTERNAL_APP_ID.getName()));\n event.setAppName(adContext.getParams().get(PARAMS.EXTERNAL_APP_NAME.getName()));\n event.setExternalAdServer(adContext.getParams().get(PARAMS.EXTERNAL_AD_SERVER.getName()));\n event.setExternalPlacementId(\n adContext.getParams().get(PARAMS.EXTERNAL_PLACEMENT_ID.getName()));\n event.setExternalCreativeId(\n adContext.getParams().get(PARAMS.EXTERNAL_CREATIVE_ID.getName()));\n event.setExternalCampaignId(\n adContext.getParams().get(PARAMS.EXTERNAL_CAMPAIGN_ID.getName()));\n event.setBidId(adContext.getParams().get(PARAMS.BID_ID.getName()));\n }\n\n LocalDateTime time = LocalDateTime.now();\n event.setTimeStamp(new Long(time.format(\n DateTimeFormatter.ofPattern(GENERAL.SECOND_DATE_FORMAT))));\n event.setHourTimeDimension(new Long(time.format(\n DateTimeFormatter.ofPattern(GENERAL.HOUR_DATE_FORMAT))));\n event.setTagServed(adContext.isTagServed());\n // get data from AdContext\n LoggingService.logEvent(JsonService.createJson(event));\n }).build();\n }","title":""},{"docid":"566fd91d6db41116f419419e33da3e25","score":"0.46407008","text":"private void startNewGame() {\n\t\ttry {\n\t\t\tthis.userName = this.getIntent().getStringExtra(\n\t\t\t\t\tRoom.INTENT_USERNAME);\n\t\t\tthis.character = this.getIntent().getIntExtra(\n\t\t\t\t\tPersistentBoggleGame.CHARACTER, ROOMMEMBER);\n\t\t\tthis.letters = this.getIntent()\n\t\t\t\t\t.getStringExtra(PersistentBoggleGame.LETTERS).toCharArray();\n\t\t\tif (letters.length != mode * mode)\n\t\t\t\tthis.letters = bbll.generateWords(mode);\n\t\t\tthis.existed_words = new LinkedHashSet<String>();\n\t\t\tthis.score = new Score(0);\n\t\t\tthis.recLen = getSharedPreferences(\"GAME_TIME\", MODE_PRIVATE)\n\t\t\t\t\t.getInt(\"TIME\", GAMETIME);\n\t\t\t// need to refresh it\n\t\t\tgetSharedPreferences(\"GAME_TIME\", MODE_PRIVATE).edit()\n\t\t\t\t\t.putInt(\"TIME\", GAMETIME).commit();\n\t\t} catch (Exception ex) {\n\t\t\tString errorMessage = \"PersistentBoggleGame Start a New Game failed\";\n\t\t\tSystem.out.println(errorMessage);\n\t\t}\n\t}","title":""}],"string":"[\n {\n \"docid\": \"cdb4a701a2e1dcc2c91876005eaf58ad\",\n \"score\": \"0.69234645\",\n \"text\": \"@SuppressWarnings(\\\"unused\\\")\\n\\tprivate void createGameRequest() {\\n\\t\\tgameClientStub.sendNewGameRequest();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a95dd83d6026906ccb6764fc0f4e506\",\n \"score\": \"0.6210674\",\n \"text\": \"public void fetchGame(final String gameName, final Context context, final VolleyCallback callback) {\\n\\n Log.d(TAG, \\\"fetchGame\\\");\\n\\n final JsonObjectRequest request = new JsonObjectRequest(Method.GET, base_url + \\\"game/\\\" + gameName, null, new Response.Listener<JSONObject>() {\\n @Override\\n public void onResponse(JSONObject response) {\\n try {\\n Game game = new Game(-1, response.getLong(\\\"game_id\\\"), response.getString(\\\"game_owner\\\"), gameName, response.getLong(\\\"end_time\\\"));\\n JSONArray jsonTeamIds = response.getJSONArray(\\\"team_ids\\\");\\n JSONArray jsonTeamNames = response.getJSONArray(\\\"team_names\\\");\\n JSONArray jsonTeamColours = response.getJSONArray(\\\"team_colours\\\");\\n JSONArray jsonHints = response.getJSONArray(\\\"hints\\\");\\n JSONArray jsonTagIds = response.getJSONArray(\\\"tag_ids\\\");\\n\\n GameManager manager = new GameManager(context);\\n long game_id = manager.insertGame(game);\\n\\n for (int i = 0; i < jsonTeamIds.length(); i++) {\\n manager.insertTeam(new Team(-1, game_id, jsonTeamIds.getLong(i), jsonTeamNames.getString(i), jsonTeamColours.getString(i)));\\n }\\n\\n for (int i = 0; i < jsonTagIds.length(); i++) {\\n manager.insertTag(new NFCTag(-1, jsonTagIds.getLong(i), game_id, jsonHints.getString(i)));\\n }\\n\\n callback.onSuccess(response);\\n } catch (JSONException e) {\\n e.printStackTrace();\\n }\\n }\\n }, new Response.ErrorListener() {\\n @Override\\n public void onErrorResponse(VolleyError error) {\\n Log.d(TAG, error.toString());\\n callback.onError(error);\\n }\\n });\\n\\n Log.d(TAG, \\\"request: \\\" + request.toString());\\n VolleySingleton.getInstance(context).addToQueue(request);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fc84a9d3375865e78e1431773489132a\",\n \"score\": \"0.605212\",\n \"text\": \"GameBean createNewGame(NewGameRequest request);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8fa18a51e9a54e73fb61906be1baa829\",\n \"score\": \"0.5660077\",\n \"text\": \"private synchronized void RequestChunkList() {\\n Listener newListener = new Listener(PacketType.CHUNK_LIST_RESPONSE, nextSessionID++, -1, DEFAULT_LISTEN_TIMEOUT);\\n AddListenerToList(newListener);\\n\\n Util.DebugPrint(DbgSub.REQUESTING_CLIENT, \\\"RequestingClient: Sending out a new chunk list request for \\\" + filename);\\n ChunkListRequest chunkListRequest = new ChunkListRequest(filename, newListener.listener.listeningPort);\\n MessageSend sender = new MessageSend();\\n sender.SendCommunication(servingHost, PacketType.CHUNK_LIST_REQUEST, newListener.sessionID, chunkListRequest.ExportMessagePayload());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d21c39c29642f0bdcc752f9570dbac80\",\n \"score\": \"0.5651227\",\n \"text\": \"private void GameLeave() {\\n StringRequest stringRequest = new StringRequest(Request.Method.POST, Const.GAME_TABLE_LEAVE,\\n new Response.Listener<String>() {\\n @Override\\n public void onResponse(String response) {\\n //progressDialog.dismiss();\\n System.out.println(\\\"\\\" + response);\\n // finish();\\n\\n }\\n\\n }, new Response.ErrorListener() {\\n @Override\\n public void onErrorResponse(VolleyError error) {\\n\\n }\\n }) {\\n @Override\\n protected Map<String, String> getParams() {\\n Map<String, String> params = new HashMap<String, String>();\\n SharedPreferences prefs = getSharedPreferences(MY_PREFS_NAME, MODE_PRIVATE);\\n params.put(\\\"user_id\\\", prefs.getString(\\\"user_id\\\", \\\"\\\"));\\n params.put(\\\"token\\\", prefs.getString(\\\"token\\\", \\\"\\\"));\\n return params;\\n }\\n\\n @Override\\n public Map<String, String> getHeaders() throws AuthFailureError {\\n HashMap<String, String> headers = new HashMap<String, String>();\\n headers.put(\\\"token\\\", Const.TOKEN);\\n return headers;\\n }\\n };\\n\\n Volley.newRequestQueue(this).add(stringRequest);\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"62f0c6fdd97aba39523ee8e17dc9e85c\",\n \"score\": \"0.56354153\",\n \"text\": \"public interface LoadGameRequester extends Requester {\\n /**\\n * Called after a load game request finishes successfully. The given Board object will represent\\n * the requested game, and will have been initialized successfully from the data sent over by\\n * the server.\\n *\\n * @param board - a Board object successfully initialized to contain the state of the board in\\n * the given game\\n * @param game - a UserGame object initialized to contain all the high-level information about\\n * the game that was requested\\n */\\n void success(Board board, UserGame game);\\n\\n /**\\n * Called if the server responds to the request by saying the supplied gameID is not associated\\n * with a game in its system\\n */\\n void gameDoesNotExist();\\n\\n /**\\n * Called if the server responds to the request by saying that the user the app currently has\\n * logged in is not a player in the game whose data was requested\\n */\\n void userNotInGame();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"06fe651b6e5ba031993c67618b3c4ec8\",\n \"score\": \"0.5556079\",\n \"text\": \"private void onClickCreateGameButton(View v) {\\n String name = etName.getText().toString();\\n SharedPreferences sharedPref = getActivity().getSharedPreferences(\\\"token\\\", Context.MODE_PRIVATE);\\n token = sharedPref.getString(\\\"token\\\", token);\\n\\n RestService.getInstance(getActivity()).createGame(GameBean.create(name, token), new Callback<GameBean>() {\\n @Override\\n public void success(GameBean game, Response response) {\\n Long gameId = game.id();\\n joinedGameId = gameId;\\n\\n // subscribe to pusher events\\n PusherService.getInstance(getActivity()).register(joinedGameId, game.channelName());\\n\\n Fragment fragment = GameLobbyFragment.newInstance();\\n Bundle bundle = new Bundle();\\n bundle.putLong(\\\"gameId\\\", joinedGameId);\\n bundle.putLong(\\\"userId\\\", userId);\\n bundle.putBoolean(\\\"isOwner\\\", true);\\n bundle.putString(\\\"gameChannel\\\", game.channelName());\\n fragment.setArguments(bundle);\\n\\n ((MenuActivity) getActivity()).pushFragment(fragment);\\n }\\n\\n @Override\\n public void failure(RetrofitError error) {\\n Toast.makeText(getActivity(), \\\"Crate Game Failed: \\\" + error.getMessage(), Toast.LENGTH_LONG).show();\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ffb06c3be6569a6ff1e8840e789fcc7d\",\n \"score\": \"0.5525642\",\n \"text\": \"public void loadGameList() {\\n\\t\\tGame game = new Game();\\n\\t\\tgame.setId(this.gameId);\\n\\t\\tPlayer player = this.playerList.get(\\\"0:0:0:0:0:0:0:1\\\");\\n\\t\\tplayer.setGameId(this.gameId);\\n\\t\\tgame.setHostPlayer(player);\\n\\t\\tthis.gameList.put(Integer.toString(this.gameId),game);\\n\\t\\t//game.addPlayer(this.playerList.get(\\\"192.168.0.15\\\"));\\n\\t\\tgame.addPlayer(this.playerList.get(\\\"192.168.0.15\\\"));\\n\\t\\t//game.addPlayer(this.playerList.get(\\\"192.168.0.15\\\"));\\n\\t\\t//game.addPlayer(this.playerList.get(\\\"0:0:0:0:0:0:0:1\\\"));\\n\\t\\tgame.startGame(player);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2e33323e573e311ab3f1e2b33602131c\",\n \"score\": \"0.5484251\",\n \"text\": \"public void gameStartRequest(TableEvent event) {\\r\\n Enumeration tEnum;\\r\\n TrucoGameClient tGame;\\r\\n TrucoTeam tTeams[];\\r\\n \\r\\n System.out.println(\\\"Requesting game start...\\\");\\r\\n \\r\\n tTeams = event.getTable().createTeams();\\r\\n \\r\\n // se crea el TrucoGame con los teams creados\\r\\n tGame = new TrucoGameClient(tTeams[0], tTeams[1]);\\r\\n \\r\\n // se llama al 'startGame' de todas las tablas\\r\\n tEnum = tables.elements();\\r\\n while (tEnum.hasMoreElements()) {\\r\\n ((Table) tEnum.nextElement()).startGame(tGame);\\r\\n }\\r\\n \\r\\n // da la orden de inicio de juego a 'tGame'\\r\\n tGame.startGame();\\r\\n \\r\\n jbJoin.setEnabled(false);\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4f3e11d8b634b8614d8b55f60bd446ee\",\n \"score\": \"0.5472051\",\n \"text\": \"List<CellBean> createCells(NewGameRequest request);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a2c15c571e63a4247b40d8df60614d66\",\n \"score\": \"0.54004246\",\n \"text\": \"@Override\\n public View onCreateView(LayoutInflater inflater, ViewGroup container,\\n Bundle savedInstanceState) {\\n View v = inflater.inflate(R.layout.fragment_frag__new_request, container, false);\\n\\n doRequest= (CardView) v.findViewById(R.id.doNewRequest);\\n partyn = v.findViewById(R.id.editTextNumber);\\n\\n ref = database.getReference(\\\"Games\\\");\\n actv = v.findViewById(R.id.autoCompleteTextView);\\n\\n ref.addValueEventListener(new ValueEventListener() {\\n\\n @Override\\n public void onDataChange(@NonNull DataSnapshot snapshot) {\\n for(DataSnapshot game : snapshot.getChildren()){\\n gameList.add(game.getValue().toString());\\n }\\n String[] gameListA = gameList.toArray(new String[gameList.size()]);\\n ArrayAdapter<String> adapter = new ArrayAdapter<String>(getContext(), android.R.layout.select_dialog_item,gameListA);\\n actv.setThreshold(1);\\n actv.setAdapter(adapter);\\n\\n }\\n\\n @Override\\n public void onCancelled(@NonNull DatabaseError error) {\\n\\n }\\n });\\n\\n doRequest.setOnClickListener(v1 -> {\\n String gameText = actv.getText().toString();\\n String partyText = partyn.getText().toString();\\n\\n if(gameText.isEmpty()|| partyText.isEmpty()){\\n Toast.makeText(getActivity(),\\\"Please fill all fields!\\\",Toast.LENGTH_SHORT).show();\\n return;\\n }\\n\\n if(!gameList.contains(gameText)){\\n Toast.makeText(getActivity(),\\\"Invalid game!\\\",Toast.LENGTH_SHORT).show();\\n return;\\n }\\n if(Integer.parseInt(partyText)<=1){\\n Toast.makeText(getActivity(),\\\"Min party size is 2!\\\",Toast.LENGTH_SHORT).show();\\n return;\\n }\\n if(Integer.parseInt(partyText)>10){\\n Toast.makeText(getActivity(),\\\"Max party size is 10!\\\",Toast.LENGTH_SHORT).show();\\n return;\\n }\\n\\n\\n date = new Date();\\n\\n requestData=new HashMap<>();\\n requestData.put(\\\"game\\\",gameText);\\n requestData.put(\\\"messageDate\\\",dateFormat.format(date));\\n requestData.put(\\\"messageTime\\\", timeFormat.format(date));\\n requestData.put(\\\"time\\\",dateFormat.format(date) + \\\" \\\" +timeFormat2.format(date));\\n requestData.put(\\\"partyCurr\\\",\\\"1\\\");\\n requestData.put(\\\"partySize\\\",partyText);\\n requestData.put(\\\"sentBy\\\", Frag_Login.mAuth.getCurrentUser().getDisplayName());\\n\\n\\n chatData = new HashMap<>();\\n chatData.put(\\\"message\\\",\\\"Link Start! ChatRoom initialized!\\\");\\n chatData.put(\\\"messageDate\\\",dateFormat.format(date));\\n chatData.put(\\\"messageTime\\\",timeFormat.format(date));\\n chatData.put(\\\"time\\\",dateFormat.format(date) + \\\" \\\" +timeFormat.format(date));\\n chatData.put(\\\"sentBy\\\",\\\"PartyUp\\\");\\n\\n String requestUID = Frag_Login.mAuth.getCurrentUser().getEmail()+timeFormat2.format(date);\\n String firstMessageId = \\\"Admin\\\"+timeFormat2.format(date);\\n String hash = new String(Hex.encodeHex(DigestUtils.md5(requestUID)));\\n String hash2 = new String(Hex.encodeHex(DigestUtils.md5(firstMessageId)));\\n String hash3 = new String(Hex.encodeHex(DigestUtils.md5(Frag_Login.mAuth.getCurrentUser().getEmail())));\\n ref2 = database.getReference(\\\"Requests/\\\"+hash);\\n ref3 = database.getReference(\\\"chatMessages/\\\"+hash+\\\"/\\\"+hash2);\\n ref4 = database.getReference(\\\"activeChats/\\\"+hash3);\\n\\n activeChat = new HashMap<>();\\n activeChat.put(\\\"chat\\\",hash);\\n requestData.put(\\\"id\\\",hash);\\n\\n try {\\n ref2.setValue(requestData);\\n ref3.setValue(chatData);\\n ref4.setValue(activeChat);\\n }\\n\\n catch (Exception ex){\\n Toast.makeText(getActivity(),\\\"Ups! Something went wrong...\\\", Toast.LENGTH_SHORT).show();\\n return;\\n }\\n\\n\\n Navigation.findNavController(v).navigate(R.id.action_Home_to_frag_Chat);\\n actv.setText(\\\"\\\");\\n partyn.setText(\\\"\\\");\\n\\n });\\n return v;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"093006e99d24b2343655468821dcd557\",\n \"score\": \"0.53459936\",\n \"text\": \"GameLobby createGameLobby(Game game, GamePlayer player);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"12db10e1590ec92e36c5242a400e0dbe\",\n \"score\": \"0.5328459\",\n \"text\": \"private void setGamesList(JSONObject newMsg)\\n {\\n this.waitingGamesList = new LinkedList<>();\\n if (newMsg.getString(\\\"isEmpty\\\").equals(\\\"false\\\"))\\n {\\n JSONArray gamesList = newMsg.getJSONArray(\\\"gamesList\\\");\\n for (int i = 0; i < gamesList.length(); i++)\\n {\\n JSONObject game = gamesList.getJSONObject(i);\\n Game waitingGame = null;\\n JSONArray users = game.getJSONArray(\\\"users\\\");\\n for (int j = 0; j < users.length(); j++)\\n {\\n JSONObject user = users.getJSONObject(j);\\n User newUser = new User(user.getString(\\\"nick\\\"), user.getString(\\\"identifier\\\"),\\n user.getString(\\\"ip\\\"), user.getInt(\\\"ranking\\\"));\\n if (j == 0)\\n {\\n switch (game.getString(\\\"type\\\"))\\n {\\n case \\\"CONCURRENT\\\":\\n waitingGame = new ConcurrentGame(gamePanel, newUser, game.getInt(\\\"playersNumber\\\"));\\n break;\\n case \\\"COOPERATION\\\":\\n waitingGame = new CooperationGame(gamePanel, newUser, game.getInt(\\\"playersNumber\\\"));\\n break;\\n }\\n }\\n else\\n {\\n waitingGame.addUser(newUser);\\n }\\n }\\n waitingGamesList.add(waitingGame);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"791d7305239c26c5d1d573f28d8ca286\",\n \"score\": \"0.5303352\",\n \"text\": \"protected void onReceivedResults(GameList gameList) {\\n // nothing to do\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"373645b0bd9d81083842d28323e91ef0\",\n \"score\": \"0.52925766\",\n \"text\": \"public Message process(ClientState client, Message request) {\\n\\t\\tString xmlString = new String();\\n\\n\\t\\tNode joinGameRequest = request.contents.getFirstChild();\\n\\t\\tNamedNodeMap map = joinGameRequest.getAttributes();\\n\\t\\tString ID = map.getNamedItem(\\\"gameId\\\").getNodeValue();\\n\\t\\tString password = map.getNamedItem(\\\"password\\\").getNodeValue();\\n\\t\\tString name = map.getNamedItem(\\\"name\\\").getNodeValue();\\n\\n\\t\\t// ArrayList<Game> games=model.getGames();\\n\\t\\t// if(model.getGamenames().contains(ID)){\\n\\t\\t\\n\\t\\tfor (Game g : model.getGames()) {\\n\\t\\t\\tif (g.getGameID().equals(ID) && g.isactived()) {\\n\\t\\t\\t\\tif (!g.checkisLocked()) {\\n\\t\\t\\t\\t\\tif (model.isPasswordCorrect(ID, password)) {\\n\\t\\t\\t\\t\\t\\tg.addPlayer(name,client.id());\\n\\t\\t\\t\\t\\t\\tString player = new String();\\n\\t\\t\\t\\t\\t\\tArrayList<Player> Players = g.getPlayers();\\n\\t\\t\\t\\t\\t\\tfor (Player p : Players) {\\n\\t\\t\\t\\t\\t\\t\\tplayer = player + \\\"<player name='\\\" + p.getName() + \\\"' position = '\\\"\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t+ p.getPlayerLocation().getColumn() + \\\",\\\" + p.getPlayerLocation().getRow()\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t+ \\\"' board = '\\\" + g.getPlayerboard(p) + \\\"' score='\\\" + p.getScore() + \\\"'/>\\\";\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t// Construct message reflecting state\\n\\n\\t\\t\\t\\t\\t\\txmlString = Message.responseHeader(request.id()) + \\\"<boardResponse gameId='\\\" + g.getGameID()\\n\\t\\t\\t\\t\\t\\t\\t\\t+ \\\"' managingUser = '\\\" + g.getManageUsername() + \\\"' bonus = '\\\"\\n\\t\\t\\t\\t\\t\\t\\t\\t+ g.getBoard().getBonusCell().getColumn() + \\\",\\\" + g.getBoard().getBonusCell().getRow()\\n\\t\\t\\t\\t\\t\\t\\t\\t+ \\\"' >\\\" + player + \\\"</boardResponse>\\\" + \\\"</response>\\\";\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\txmlString = Message.responseHeader(request.id(), \\\"password is incorrect\\\")\\n\\t\\t\\t\\t\\t\\t\\t\\t+ \\\"<joinGameResponse gameId='\\\" + g.getGameID() + \\\"'>\\\" + \\\"</joinGameResponse>\\\"\\n\\t\\t\\t\\t\\t\\t\\t\\t+ \\\"</response>\\\";\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\txmlString = Message.responseHeader(request.id(), \\\"game is locked\\\")\\n\\t\\t\\t\\t\\t\\t\\t+ \\\"<joinGameResponse gameId='\\\" + g.getGameID() + \\\"'>\\\" + \\\"</joinGameResponse>\\\"\\n\\t\\t\\t\\t\\t\\t\\t+ \\\"</response>\\\";\\n\\t\\t\\t\\t\\tbreak;\\n\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\txmlString = Message.responseHeader(request.id(), \\\"game is not exist\\\") + \\\"<joinGameResponse gameId='\\\" + ID + \\\"'>\\\"\\n\\t\\t\\t\\t\\t+ \\\"</joinGameResponse>\\\" + \\\"</response>\\\";\\n\\t\\t}\\n\\t\\t\\n\\n\\t\\t\\n\\t\\tMessage message = new Message(xmlString);\\n\\t\\t// all other players on game (excepting this particular client) need to\\n\\t\\t// be told of this\\n\\t\\t// same response. Note this is inefficient and should be replaced by\\n\\t\\t// more elegant functioning\\n\\t\\t// hint: rely on your game to store player names...\\n\\t\\tGame game=model.getGame(ID);\\n\\t\\tfor (Player p : game.getPlayers()) {\\n\\t\\t\\tfor (String id : Server.ids()) {\\n\\t\\t\\t\\tif (!id.equals(client.id()) && id.equals(p.getClientId())) {\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\tServer.getState(id).sendMessage(message);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t// send this response back to the client which sent us the request.\\n\\t\\treturn message;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b2059e4af7634834c5f49146081e8cde\",\n \"score\": \"0.525653\",\n \"text\": \"@EventListener\\r\\n private void handleLoadGameListEvent(LoadGameListEvent event) {\\r\\n tableView.printGameListMessage(tableService.loadGameList());\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ea8c68d0ae9a4c7d15f38648157fbf76\",\n \"score\": \"0.52474535\",\n \"text\": \"@PostMapping(path = \\\"/games\\\")\\n public GameResponse createGame(@RequestBody GameRequest request) {\\n logger.info(\\\"Create game request: \\\" + request.toString());\\n int pits = request.getPits() == null ? PITS_DEFAULT : request.getPits();\\n int stones = request.getStones() == null ? STONES_DEFAULT : request.getStones();\\n String firstPlayerName = request.getFirstPlayer() == null || request.getFirstPlayer().isEmpty() ? DEFAULT_FIRST_PLAYER : request.getFirstPlayer();\\n String secondPlayerName = request.getSecondPlayer() == null || request.getSecondPlayer().isEmpty() ? DEFAULT_SECOND_PLAYER : request.getSecondPlayer();\\n GameModel createdGame = gameService.createGame(firstPlayerName, secondPlayerName, pits, stones);\\n GameResponse response = new GameResponse();\\n response.setGame(createdGame.getKalahGame().getGame());\\n response.setId(createdGame.getId());\\n logger.info(\\\"Game created: \\\" + createdGame.toString());\\n return response;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9e684cd3a4ea8530e79c763a7585c581\",\n \"score\": \"0.52369946\",\n \"text\": \"@EventListener\\r\\n private void handleLoadGameEvent(LoadGameEvent event) {\\r\\n GameTable gameTable = tableService.loadGame(event.getGameTableId());\\r\\n String playerId = tableService.getFreeSLot(gameTable.getGameTableID());\\r\\n if (playerId == null) {\\r\\n System.out.println(\\\"Sorry, no free slot.\\\");\\r\\n tableView.initGameLobby();\\r\\n } else {\\r\\n gameTable.setLeaver(false);\\r\\n for (Player p : gameTable.getPlayers()) {\\r\\n if (p.getPlayerId().equals(playerId)) {\\r\\n p.setControlledBy(\\\"human\\\");\\r\\n }\\r\\n }\\r\\n tableService.saveTable(gameTable);\\r\\n ClientUser clientUser = new ClientUser(gameTable.getGameTableID(), playerId);\\r\\n pollingService.setClientUser(clientUser);\\r\\n pollingService.setStartPolling(true);\\r\\n }\\r\\n\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a78db5b7fe97259c4be5012c2e4cb2f4\",\n \"score\": \"0.52168065\",\n \"text\": \"protected void processRequest(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n response.setContentType(\\\"application/json\\\");\\n GameListManager gamesManager = ServletUtils.getGamesListManager(getServletContext());\\n List<SingleGameResponse> games = new ArrayList<>();\\n\\n synchronized (getServletContext()) {\\n List<SingleGameEntry> gamesList = gamesManager.getGames();\\n for (SingleGameEntry seg : gamesList) {\\n games.add(new SingleGameResponse(seg));\\n }\\n }\\n\\n ServletUtils.sendJsonResponse(response, new GamesListResponse((games)));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c79b77e1cfc13579cecad0bd56576b8e\",\n \"score\": \"0.5207033\",\n \"text\": \"public interface GameInformationListener {\\n void onSucceed();\\n void onFailedMsg(String msg);\\n void onGameTypeInforMation(List<GameTypeBean> list);\\n\\n void onGameInfor(List<GameInfoBean> li);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"60d6e632579c548c56d6082ef364b79e\",\n \"score\": \"0.5205398\",\n \"text\": \"public interface Request_listseeds {\\n public void oncreate_seedlist(ArrayList<Seed> plants);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b0ae865d7c732f12023a7caf41deb324\",\n \"score\": \"0.5185745\",\n \"text\": \"void sendWaitingLobbyList(String playerName);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7b0d9b1f403b22ad8bbcfbad09dee6f4\",\n \"score\": \"0.51337457\",\n \"text\": \"public BaseMessage GetRequest() {\\n\\t\\treturn new EntryGameReq();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f01e8c283065621e292f250c92ef16db\",\n \"score\": \"0.50833184\",\n \"text\": \"public void getGameNameListCallback(ErrorCode paramErrorCode, GameInfoList paramGameInfoList) {}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"787c5f5c442232f684fdd2ae63f1ee60\",\n \"score\": \"0.5063033\",\n \"text\": \"Listener(PacketType requestType, int sessionID, int chunkNumber, int timeoutValue) {\\n PacketType[] packetType = {requestType};\\n this.listener = new MessageReceive(packetType, true);\\n this.requestType = packetType;\\n this.sessionID = sessionID;\\n this.chunkNumber = chunkNumber;\\n this.timeout = Util.GetCurrentTime() + timeoutValue;\\n this.status = 0;\\n this.listener.start();\\n Util.DebugPrint(DbgSub.REQUESTING_CLIENT, \\\"RequestingClient: SessionID: \\\" + sessionID);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e9c7a2d48387ab60152212e5e134c144\",\n \"score\": \"0.5061808\",\n \"text\": \"private void createListeners(final GameContainer container, final StateBasedGame game) {\\r\\n backBtn.addListener(new ClickListener() {\\r\\n\\r\\n public void onClick(Button clicked, float mx, float my) {\\r\\n game.enterState(MainMenuState.STATE_ID);\\r\\n }\\r\\n\\r\\n public void onDoubleClick(Button clicked, float mx, float my) {}\\r\\n public void onRightClick(Button clicked, float mx, float my) {}\\r\\n });\\r\\n connectBtn.addListener(new ClickListener(){\\r\\n public void onClick(Button clicked, float mx, float my) {\\r\\n socket = new Socket();\\r\\n final MatchMakingState state = thistate;\\r\\n new Thread(new Runnable(){\\r\\n private final String ip = ipBox.getText();\\r\\n @Override\\r\\n public void run() {\\r\\n try {\\r\\n socket.connect(new InetSocketAddress(ip, Constants.SERVER_PORT));\\r\\n instructionTxt = \\\"Waiting for another player to join.\\\";\\r\\n new MatchmakingNetworkingController(socket,state).start();\\r\\n }catch (IOException e) {\\r\\n instructionTxt = \\\"A connection could not be established. Please try again.\\\";\\r\\n ipBox.setText(e.getMessage());\\r\\n ipBox.setCursorVisible(true);\\r\\n }\\r\\n }\\r\\n }).start();\\r\\n }\\r\\n\\r\\n public void onDoubleClick(Button clicked, float mx, float my) {}\\r\\n public void onRightClick(Button clicked, float mx, float my) {}\\r\\n });\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b4be818a68cf807b1de84f09db246642\",\n \"score\": \"0.50542945\",\n \"text\": \"private Response.Listener<JSONObject> GetChatMessageOnSuccessListDataBind() {\\n return new Response.Listener<JSONObject>() {\\n @Override\\n public void onResponse(JSONObject response) {\\n try {\\n\\n JSONArray data = response.getJSONArray(\\\"data\\\");\\n if (data.length() > 0) {\\n for (int i = 0; i < data.length(); i++) {\\n JSONObject j = data.getJSONObject(i);\\n ChatMessage chatMessage = new ChatMessage(\\n j.getString(\\\"MessageEMP_IDFrom\\\"),\\n j.getString(\\\"MessageEMP_IDTo\\\"),\\n j.getString(\\\"MessageText\\\"),\\n j.getString(\\\"MessageID\\\"),\\n Boolean.parseBoolean(j.getString(\\\"isMINE\\\")));\\n chatMessageList.add(chatMessage);\\n }\\n\\n\\n }\\n\\n } catch (Exception e) {\\n Log.v(\\\"arman\\\", e.getMessage());\\n }\\n }\\n };\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fa9fcf97f913606df6b74d48a2dbc25b\",\n \"score\": \"0.50455976\",\n \"text\": \"private RequestWithList(com.google.protobuf.GeneratedMessageV3.Builder<?> builder) {\\n super(builder);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"26dd9c10db32c7aa657cc09cf141bca3\",\n \"score\": \"0.50299835\",\n \"text\": \"void updateGameList();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ad66917da763d5e825bdb6803b15580f\",\n \"score\": \"0.5029437\",\n \"text\": \"void sendPlayersInLobbyList(String playerName);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"78d716e4de25444dd64eaeac65baebb4\",\n \"score\": \"0.5012921\",\n \"text\": \"private void getFriendsList() {\\n showProgressDialog();\\n\\n JsonArrayRequest jsonArrReq = new JsonArrayRequest(Request.Method.GET,\\n Const.URL_JSON_OBJECTServer, null,\\n new Response.Listener<JSONArray>() {\\n\\n /**\\n * onResponse loops through the received JSON array to find each user name\\n * @param response\\n */\\n @Override\\n public void onResponse(JSONArray response) {\\n JSONObject userObject;\\n JSONArray serverArray;\\n\\n Log.v(TAG, response.toString());\\n Log.v(TAG, \\\"the server is here\\\");\\n\\n serverArray = response;\\n\\n //add each name in the users friends server to a list\\n for(int i = 0; i < serverArray.length(); i++) {\\n try {\\n userObject = serverArray.getJSONObject(i);\\n for(int j = 0; j < idList.size(); j++) {\\n if(userObject.get(\\\"id\\\").toString() == idList.get(j)) {\\n Log.v(TAG, \\\"add friend\\\");\\n friendsList.add(userObject.get(\\\"name\\\").toString());\\n idFriendsList.add(userObject.get(\\\"id\\\").toString());\\n }\\n }\\n } catch (JSONException e) {\\n e.printStackTrace();\\n }\\n }\\n\\n adapter = new ArrayAdapter(FriendsActivity.this, android.R.layout.simple_list_item_1, friendsList);\\n f_listView.setAdapter(adapter);\\n hideProgressDialog();\\n }\\n }, new Response.ErrorListener() {\\n\\n /**\\n * onErrorResponse responds to errors if there is an unsuccessful volley request\\n * @param error\\n */\\n @Override\\n public void onErrorResponse(VolleyError error) {\\n Log.v(TAG, \\\"Error: \\\" + error.getMessage());\\n hideProgressDialog();\\n }\\n });\\n\\n AppController.getInstance().addToRequestQueue(jsonArrReq, \\\"jobj_req\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"442de211a3257ebc86ebc7d42b974af1\",\n \"score\": \"0.5003774\",\n \"text\": \"public String createGamesForSending()\\r\\n\\t{\\r\\n\\t\\tStringBuilder builder = new StringBuilder(\\\"#game#list#\\\");\\r\\n\\r\\n\\t\\t// Donner uniquement les parties en attente. Le client n'a effectivement\\r\\n\\t\\t// aucun interet de recevoir une liste de partie dont il n'a pas la possibilite de\\r\\n\\t\\t// rejoindre\\r\\n\\t\\tGame[] games = this.gameList.getWaitingGames();\\r\\n\\r\\n\\t\\tfor (Game game : games)\\r\\n\\t\\t{\\r\\n\\t\\t\\t// Ajouter l'ID de la partie, le proprietaire ainsi que le nombre de joueur\\r\\n\\t\\t\\tbuilder.append(game.getID() + \\\"#\\\");\\r\\n\\t\\t\\tbuilder.append(game.getOwner() + \\\"#\\\");\\r\\n\\t\\t\\tbuilder.append(game.getType() + \\\"#\\\");\\r\\n\\t\\t\\tbuilder.append(game.getNbPlayers() + \\\"#\\\");\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\treturn builder.toString();\\r\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"66c0d68abbe9e072db43614d17c28dbb\",\n \"score\": \"0.50006735\",\n \"text\": \"public void onRequest();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cb3379e9320b3e77ee290bfc63682259\",\n \"score\": \"0.4996951\",\n \"text\": \"void createGame(Session session, Message message);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7c450fa33aded6ddc2a9d38e2a691b58\",\n \"score\": \"0.49750993\",\n \"text\": \"private void respondWithRequests() {\\n\\t\\tbyte data[] = new byte[1];\\n\\t DatagramPacket receivePacket = new DatagramPacket(data, data.length);\\n\\t\\ttry {\\n\\t // Block until a datagram is received via socket. \\n\\t\\t\\tschedulerSocket.receive(receivePacket);\\n\\t\\t\\tSystem.out.println(\\\"Packet recieved with a request for the list of requests\\\");\\n\\t } catch(IOException e) {\\n\\t \\te.printStackTrace();\\n\\t \\tSystem.exit(1);\\n\\t }\\n\\t\\t\\n\\t\\tByteArrayOutputStream stream = new ByteArrayOutputStream();\\n\\t\\ttry {\\n\\t\\t\\tObjectOutputStream oStream = new ObjectOutputStream(stream);\\n\\t\\t\\toStream.writeObject(requests);\\n\\t\\t\\toStream.close();\\n\\t\\t\\tstream.close();\\n\\t\\t} catch (IOException e) {\\n\\t\\t\\te.printStackTrace();\\n\\t\\t\\tSystem.exit(1);\\n\\t\\t}\\n\\t\\t\\n\\t\\tbyte[] sendData = stream.toByteArray();\\n\\t\\ttry {\\n\\t\\t\\tDatagramPacket sendPacket = new DatagramPacket(sendData, sendData.length, receivePacket.getAddress(), receivePacket.getPort());\\n\\t\\t\\tschedulerSocket.send(sendPacket);\\n\\t\\t\\tSystem.out.println(\\\"Packet sent with the list of requests\\\");\\n\\t }\\n\\t\\tcatch (IOException e) {\\n\\t e.printStackTrace();\\n\\t System.exit(1);\\n\\t }\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"70377229656b756e9c0b26ae6c633401\",\n \"score\": \"0.4965145\",\n \"text\": \"private void loadList() {\\n\\n // TODO need to filter non-hosting events\\n evntlist.clear();\\n mServerRequestModule.getEventsRequest(getString(R.string.event_get_in), new VolleyEventListCallback() {\\n @Override\\n public void onEventsListSuccessResponse(JSONArray data) {\\n String you = ident.getValue(getString(R.string.user_id));\\n try {\\n ((FragHostActivity) getActivity()).sortResponseToList(evntlist, data, you, true);\\n } catch (NullPointerException e) {\\n e.printStackTrace();\\n } catch (Exception e) {\\n e.printStackTrace();\\n }\\n\\n // TODO This is a hack to refresh the view, so we redraw the list\\n if (getFragmentManager() != null) {\\n getFragmentManager().beginTransaction().detach(ctx).attach(ctx).commit();\\n }\\n }\\n\\n @Override\\n public void onErrorResponse(String result) {\\n Toast.makeText(context, \\\"unable to load events currently\\\", Toast.LENGTH_LONG).show();\\n }\\n });\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b718599c3647f129192450ffbd076b4b\",\n \"score\": \"0.49621305\",\n \"text\": \"public interface TournamentListListener {\\n\\n public void manageTournamentPlayersScores(TournamentDTO t);\\n public void editTournament(TournamentDTO t);\\n public void viewLeaderBoard(TournamentDTO t);\\n\\n public void takePictures(TournamentDTO t);\\n public void viewGallery(TournamentDTO t);\\n public void manageTournamentTees(TournamentDTO t);\\n\\n public void inviteAppUser();\\n public void uploadVideo(TournamentDTO t);\\n\\n public void sendPlayerTextMessage(TournamentDTO t);\\n public void sendPlayerEmail(TournamentDTO t);\\n\\n public void removeTournament(TournamentDTO t);\\n public void deleteSampleTournaments();\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a01ed11a1a08ffb72bcaed621b0b7c24\",\n \"score\": \"0.49582583\",\n \"text\": \"public interface OnH5GamesReceivedListener extends BaseUIListener {\\n void onH5GamesReceivedSuccess(String userId, List<FindDataIntegralGameModel> games);\\n\\n void onH5GamesReceivedFailure(String message);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ff35ae8a8b8098525ea9e7969d493a77\",\n \"score\": \"0.49558043\",\n \"text\": \"private NobleListReq(com.google.protobuf.GeneratedMessageV3.Builder<?> builder) {\\n super(builder);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7f19b43f2a6ed99ef1a060e272581868\",\n \"score\": \"0.49359742\",\n \"text\": \"public GameStartInfoResponse(String boardName, List<Player> playerList, String playerName) {\\n this.playerName = playerName;\\n this.boardName = boardName;\\n this.playerList = playerList;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6805927144cbcbd7eb7d0eb6ad717d01\",\n \"score\": \"0.49298158\",\n \"text\": \"public void checkMatchedStatus() {\\n\\n request = new StringRequest(Request.Method.POST, ServerDetails.MATCHING_CHECK_URL, new Response.Listener<String>() {\\n\\n // HANDLE RESPONSES\\n @Override\\n public void onResponse(String response) {\\n\\n try {\\n\\n JSONObject jsonObject = new JSONObject(response);\\n\\n\\n if (jsonObject.names().get(0).equals(\\\"match_success\\\")) {\\n\\n // DISPLAY THE RESPONSE TO THE ANDROID ACTIVITY SCREEN\\n // Toast.makeText(getApplicationContext(), \\\"You have a match\\\", Toast.LENGTH_SHORT).show();\\n\\n String isMatched = jsonObject.getString(\\\"isMatched\\\");\\n\\n // ONLY RUN IF THE USER HAS ACCEPTED THE MATCH\\n if (isMatched.equals(\\\"1\\\")) {\\n\\n TextView UnmatchedBookings = findViewById(R.id.UnmatchedBookings);\\n UnmatchedBookings.setVisibility(View.INVISIBLE);\\n\\n // SET ITEMS TO BE INVISIBLE\\n TextView ActiveQueueTitle = findViewById(R.id.ActiveQueueTitle);\\n ActiveQueueTitle.setText(\\\"Active Queue\\\");\\n ActiveQueueTitle.setVisibility(View.VISIBLE);\\n\\n lView = (ListView) findViewById(R.id.ActiveQueues);\\n\\n String[] myQueueDetailsArray = getDataToGlobalVariableQueue();\\n\\n final int[] images = {R.drawable.pinlarge};\\n final String[] version = {userName_matched};\\n final String[] versionNumber = {myQueueDetailsArray[2]};\\n\\n lAdapter = new ListAdapter(bookings.this, version, versionNumber, images);\\n\\n lView.setAdapter(lAdapter);\\n\\n lView.setOnItemClickListener(new AdapterView.OnItemClickListener() {\\n @Override\\n public void onItemClick(AdapterView<?> adapterView, View view, int i, long l) {\\n\\n // START THE NEXT ACTIVITY\\n // SHOW THE USER THAT THEY HAVE A MATCH\\n Intent intent = new Intent(getApplicationContext(), match_details_active.class);\\n intent.putExtra(\\\"matched_username\\\", userName_matched);\\n intent.putExtra(\\\"matched_user_id\\\", userID_matched);\\n intent.putExtra(\\\"times\\\", times);\\n intent.putExtra(\\\"message\\\", Description);\\n intent.putExtra(\\\"fee\\\", fee);\\n intent.putExtra(\\\"view\\\", \\\"false\\\");\\n startActivity(intent);\\n\\n }\\n });\\n\\n } else if (!isMatched.equals(\\\"1\\\")){\\n\\n TextView ActiveQueueTitle = findViewById(R.id.ActiveQueueTitle);\\n ActiveQueueTitle.setVisibility(View.INVISIBLE);\\n\\n TextView UnmatchedBookings = findViewById(R.id.UnmatchedBookings);\\n UnmatchedBookings.setVisibility(View.VISIBLE);\\n\\n lView = (ListView) findViewById(R.id.UnmatchedBookingsList);\\n\\n String[] myQueueDetailsArray = getDataToGlobalVariableQueue();\\n\\n final int[] images = {R.drawable.pinlarge};\\n final String[] version = {userName_matched};\\n final String[] versionNumber = {myQueueDetailsArray[2]};\\n\\n lAdapter = new ListAdapter(bookings.this, version, versionNumber, images);\\n\\n lView.setAdapter(lAdapter);\\n\\n lView.setOnItemClickListener(new AdapterView.OnItemClickListener() {\\n @Override\\n public void onItemClick(AdapterView<?> adapterView, View view, int i, long l) {\\n\\n // START THE NEXT ACTIVITY\\n // SHOW THE USER THAT THEY HAVE A MATCH\\n Intent intent = new Intent(getApplicationContext(), match_details.class);\\n intent.putExtra(\\\"matched_username\\\", userName_matched);\\n intent.putExtra(\\\"matched_user_id\\\", userID_matched);\\n intent.putExtra(\\\"times\\\", times);\\n intent.putExtra(\\\"message\\\", Description);\\n intent.putExtra(\\\"fee\\\", fee);\\n intent.putExtra(\\\"matched\\\", \\\"no\\\");\\n startActivity(intent);\\n\\n }\\n });\\n\\n }else{\\n\\n // SET BOTH TO BE INVISIBLE\\n\\n TextView ActiveQueueTitle = findViewById(R.id.ActiveQueueTitle);\\n ActiveQueueTitle.setVisibility(View.INVISIBLE);\\n\\n TextView UnmatchedBookings = findViewById(R.id.UnmatchedBookings);\\n UnmatchedBookings.setVisibility(View.INVISIBLE);\\n\\n\\n }\\n\\n } else {\\n\\n // DISPLAY ERROR RESPONSE TO THE ANDROID ACTIVITY SCREEN\\n //Toast.makeText(getApplicationContext(), \\\"Error\\\" + jsonObject.getString(\\\"error\\\"), Toast.LENGTH_SHORT).show();\\n\\n }\\n\\n } catch (JSONException e) {\\n // CATCH ERRORS\\n e.printStackTrace();\\n\\n TextView ActiveQueueTitle = findViewById(R.id.ActiveQueueTitle);\\n ActiveQueueTitle.setVisibility(View.INVISIBLE);\\n\\n TextView UnmatchedBookings = findViewById(R.id.UnmatchedBookings);\\n UnmatchedBookings.setVisibility(View.INVISIBLE);\\n\\n }\\n }\\n }, new Response.ErrorListener() {\\n\\n @Override\\n public void onErrorResponse(VolleyError error) {\\n Toast.makeText(bookings.this, \\\"Oops!!! Something went wrong. Server must be offline\\\", Toast.LENGTH_SHORT).show();\\n }\\n }) {\\n\\n @Override\\n protected Map<String, String> getParams() {\\n\\n HashMap<String, String> hashMap = new HashMap<>();\\n hashMap.put(\\\"check_match_status\\\", \\\"\\\");\\n hashMap.put(\\\"matched_id\\\", getIDFromGlobalVariable());\\n return hashMap;\\n\\n }\\n };\\n\\n myRequestQueue.add(request);\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2652077fc4b12f4705394f05bdcc85a3\",\n \"score\": \"0.49002308\",\n \"text\": \"@Test\\n public void testNewGame() {\\n Response response = makeRequest(\\n Request\\n .POST().url(testServerUrl().path(\\\"/new_game/\\\" + Integer.toString(100))));\\n\\n // Parse JSON to Java object\\n Game request_game = response.payloadJsonAs(Game.class);\\n assertEquals(48, request_game.deck.size());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5bc0ae83d17427456c3b1d6f498edce7\",\n \"score\": \"0.48947224\",\n \"text\": \"@Override\\n\\tpublic Response createGame(String data) {\\n\\t\\tRequestValues requestValues = createRequest(data);\\n\\t\\tResponse response = post(wsBaseUri + \\\"/games\\\", body(requestValues.get(\\\"username\\\"), JSON_CONTENT_TYPE), ACCEPT_JSON_HEADER, createSessionHeader());\\n\\t\\treturn rememberGame(response);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"95a6db84e0442dfc2d525e5da1a2a25a\",\n \"score\": \"0.4894581\",\n \"text\": \"@Override\\n public ApplicationListener createApplicationListener () {\\n return new MyGdxGame(new NoGameServiceClient());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fddec87b9656f17e5a896a078798ee41\",\n \"score\": \"0.48937267\",\n \"text\": \"public interface GamePersistenceService {\\n /**\\n * Request all games\\n * @param requestAllGamesEvent\\n * @return\\n */\\n AllGamesEvent requestAllGames(RequestAllGamesEvent requestAllGamesEvent);\\n\\n /**\\n * Create game\\n * @param createGameEvent\\n * @return\\n */\\n GameCreatedEvent createGame(CreateGameEvent createGameEvent);\\n\\n /**\\n * Request game details\\n * @param requestGameDetailsEvent\\n * @return\\n */\\n GameDetailsEvent requestGameDetails(RequestGameDetailsEvent requestGameDetailsEvent);\\n\\n /**\\n * Request game extended details\\n * @param requestGameExtendedDetailsEvent\\n * @return\\n */\\n GameExtendedDetailsEvent requestGameExtendedDetails(RequestGameExtendedDetailsEvent requestGameExtendedDetailsEvent);\\n\\n /**\\n * Join event\\n * @param joinGameEvent\\n * @return\\n */\\n GameJoinedEvent joinGame(JoinGameEvent joinGameEvent);\\n\\n /**\\n * Start game\\n * @param startGameEvent\\n * @return\\n */\\n GameStartedEvent startGame(StartGameEvent startGameEvent);\\n\\n /**\\n * Update game player\\n * @param updateGamePlayerEvent\\n * @return\\n */\\n GamePlayerUpdatedEvent updateGamePlayer(UpdateGamePlayerEvent updateGamePlayerEvent);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"39d807a37ab37ef0d68891f92d2d649c\",\n \"score\": \"0.48733112\",\n \"text\": \"@Override\\n public synchronized String newGame(Game game) {\\n Set<String> usersSubscribed = game.getPlayers().values()\\n .stream()\\n .filter(p -> !(p instanceof ComPlayer))\\n .map(Player::getPlayerId)\\n .peek(p -> connectionsService.userActivityChanged(\\n p, \\\"Playing against \\\"\\n + game.getOpponents(p).stream().map(Player::getPlayerId).collect(Collectors.joining(\\\",\\\"))))\\n .collect(Collectors.toSet());\\n\\n _GAMES.put(game, usersSubscribed);\\n log.info(\\\"Created Game \\\" + game.getGameId() + \\\" with users subscribed: \\\" + usersSubscribed);\\n gameLoggingService.log(\\n game, GameLoggingService.STARTED,\\n new ActionLog(\\\"Created Game\\\", viewExtractorService.extractGlobalSlimView(game)));\\n\\n return game.getGameId(); // return the id just for convenience\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ea4db77638fa1914b22bb60bcdd4a0a6\",\n \"score\": \"0.48720306\",\n \"text\": \"@Override\\n public void run() {\\n\\n GameServer server = null;\\n try {\\n //Waiting client start the communication\\n if(in.readLine().equals(\\\"100-START\\\")){\\n sendProtocol(out,1,\\\"OK\\\");\\n //Get username\\n Protocole prot = receive(in);\\n sendProtocol(out,1,\\\"OK\\\");\\n\\n //Get the gameMode\\n int gameMode = Integer.parseInt(Protocole.receive(in).getData());\\n sendProtocol(out,1,\\\"OK\\\");\\n\\n sendProtocol(out,1,\\\"END\\\");\\n\\n //Start the matchmaking system\\n while (!in.readLine().equals(\\\"200-START\\\"));\\n Client p = new Client(socket);\\n //Search in the queue for a sever with a place for the new client\\n for (GameServer s : servers.get(gameMode)) {\\n if (s.getClientsCount() < gameMode) {\\n server = s;\\n LOG.info(String.format(\\\"Add client for server with game mode %d\\\", gameMode));\\n break;\\n }\\n }\\n // if there is no server we create a new one\\n if (server == null) {\\n\\n LOG.info(String.format(\\\"New server with game mode %d\\\", gameMode));\\n server = new GameServer(gameMode);\\n servers.get(gameMode).add(server);\\n }\\n\\n // the server will continue the managment\\n server.playerJoin(p, prot.getData());\\n }\\n } catch (IOException e) {\\n e.printStackTrace();\\n // TODO Stop game server\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"75f2c917b4105ec8ce9da847489dfac1\",\n \"score\": \"0.48609975\",\n \"text\": \"public void onCreateEvent(View view) {\\n\\t\\tListView playerList = (ListView)findViewById(R.id.list_event_create_players);\\n\\t\\tSparseBooleanArray checkedPlayers = playerList.getCheckedItemPositions();\\n\\t\\tif(checkedPlayers.size() < 3) {\\n\\t\\t\\tToast.makeText(this, R.string.toast_not_enough_player, Toast.LENGTH_LONG).show();\\n\\t\\t} else {\\n\\t\\t\\tString location = ((EditText)findViewById(R.id.edit_event_creation_location)).getText().toString();\\n\\t\\t\\t\\n\\t\\t\\tif(location.length()<=0) {\\n\\t\\t\\t\\tToast.makeText(this, R.string.toast_location_empty, Toast.LENGTH_LONG).show();\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tContentValues values = new ContentValues();\\n\\t\\t\\t\\tvalues.put(Event.COLUMN_NAME_EVENT_DATE, new Date().getTime()/1000);\\n\\t\\t\\t\\tvalues.put(Event.COLUMN_NAME_LOCATION, location);\\n\\t\\t\\t\\tvalues.put(Event.COLUMN_NAME_FINISHED, false);\\n\\t\\n\\t\\t\\t\\tSQLiteDatabase db = ScoreBoardDbHelper.getWriteDb(this);\\n\\t\\t\\t\\tLong eventId = db.insert(Event.TABLE_NAME, null, values);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tint itemCount = playerList.getCount();\\n\\t\\t\\t\\tLog.e(\\\"itemCount\\\", String.valueOf(itemCount));\\n\\t\\t\\t\\tCursor item = null;\\n\\t\\t\\t\\tfor(int i=0; i<itemCount; i++) {\\n\\t\\t\\t\\t\\tif(checkedPlayers.get(i)==true) {\\n\\t\\t\\t\\t\\t\\titem = (Cursor) playerList.getItemAtPosition(i);\\n\\t\\t\\t\\t\\t\\tvalues.clear();\\n\\t\\t\\t\\t\\t\\tvalues.put(PlayerToEvent.COLUMN_NAME_EVENT_ID, eventId);\\n\\t\\t\\t\\t\\t\\tvalues.put(PlayerToEvent.COLUMN_NAME_PLAYER_ID, item.getInt(item.getColumnIndex(Player.COLUMN_NAME_PLAYER_ID)));\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\tdb.insert(PlayerToEvent.TABLE_NAME, null, values);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t//Redirect vers l'activité de détail d'une rencontre\\n\\t\\t\\t\\tIntent intent = new Intent(this, EventBoardActivity.class);\\n\\t\\t\\t\\tintent.putExtra(EventBoardActivity.EVENT_BOARD_ID, eventId.toString());\\n\\t\\t\\t\\tstartActivity(intent);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"639e0159533abdef49b17e238f6f9b9a\",\n \"score\": \"0.48596737\",\n \"text\": \"private void getIDList() {\\n showProgressDialog();\\n\\n JsonArrayRequest jsonArrReq = new JsonArrayRequest(Request.Method.GET,\\n Const.URL_JSON_OBJECTFRIENDS +user.getID(), null,\\n new Response.Listener<JSONArray>() {\\n\\n /**\\n * onResponse loops through the received JSON array to find each user name\\n * @param response\\n */\\n @Override\\n public void onResponse(JSONArray response) {\\n JSONObject userObject;\\n JSONArray serverArray;\\n\\n Log.v(TAG, response.toString());\\n Log.v(TAG, \\\"the server is here\\\");\\n\\n serverArray = response;\\n\\n //add each name in the users friends server to a list\\n for(int i = 0; i < serverArray.length(); i++) {\\n try {\\n userObject = serverArray.getJSONObject(i);\\n Log.v(TAG, \\\"Found friend\\\");\\n idList.add(userObject.get(\\\"friend\\\").toString());\\n\\n } catch (JSONException e) {\\n e.printStackTrace();\\n }\\n\\n }\\n hideProgressDialog();\\n }\\n }, new Response.ErrorListener() {\\n\\n /**\\n * onErrorResponse responds to errors if there is an unsuccessful volley request\\n * @param error\\n */\\n @Override\\n public void onErrorResponse(VolleyError error) {\\n Log.v(TAG, \\\"Error: \\\" + error.getMessage());\\n hideProgressDialog();\\n }\\n });\\n\\n AppController.getInstance().addToRequestQueue(jsonArrReq, \\\"jobj_req\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6d939c8999b9fe374b7cfab5a5d7e672\",\n \"score\": \"0.4847361\",\n \"text\": \"public interface GameService {\\n /**\\n * Creates new game from game creation message.\\n */\\n void createGame(Session session, Message message);\\n\\n /**\\n * Sends updated game list to all users.\\n */\\n void updateGameList();\\n\\n /**\\n * Removes selected game from game list.\\n * Sends appropriate message to all users.\\n */\\n void startGame(Session session, Message message);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"54e0a5ff2d4fc3832116c8be99d221ba\",\n \"score\": \"0.48461983\",\n \"text\": \"public GameStartInfoResponse() {\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"07826af6b7f31fe402e56097f4ef48de\",\n \"score\": \"0.48335117\",\n \"text\": \"public void listenForJobListRequests(){\\n\\t\\t//Create and register the callback handler\\n\\t\\tThriftServiceHandler handler = new ThriftServiceHandler();\\n\\t\\tThriftService.Processor<ThriftServiceHandler> tp = new ThriftService.Processor<ThriftServiceHandler>(handler);\\n\\t\\t\\n\\t\\tTServerSocket serverSocket = null;\\n\\t\\ttry {\\n\\t\\t\\t//Create a socket to listen a the specified port, create a server with the processor handler wrapper,\\n\\t\\t\\t//and begin to listen for connection.\\n\\t\\t\\tserverSocket = new TServerSocket(ThriftService.commPort);\\n\\t\\t\\tTServer.Args serverArgs = new TServer.Args(serverSocket).processor(tp);\\n\\t\\t\\tTSimpleServer server = new TSimpleServer(serverArgs);\\n\\t\\t\\tserver.serve();\\n\\t\\t} catch (TTransportException e) {\\n\\t\\t\\t// TODO Auto-generated catch block\\n\\t\\t\\te.printStackTrace();\\n\\t\\t} finally {\\n\\t\\t\\tserverSocket.close();\\n\\t\\t}\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ec969e12cfecb8e0e00cce929e72f754\",\n \"score\": \"0.4831824\",\n \"text\": \"private void updateList() {\\n\\t\\tArrayList<String> stringList = new ArrayList<String>();\\n\\t\\t// Log.d(\\\"Size\\\", \\\"\\\"+arrayOfRequests.length);\\n\\t\\tfor (int i = 0; i < requests.size(); i++) {\\n\\t\\t\\tstringList.add(requests.get(i).getName());\\n\\t\\t}\\n\\n\\t\\tRequesterListAdapter listAdapter = new RequesterListAdapter(\\n\\t\\t\\t\\tgetActivity(), requests);\\n\\n\\t\\tthis.setListAdapter(listAdapter);\\n\\t\\tListView lv = this.getListView();\\n\\t\\tlv.setTextFilterEnabled(true);\\n\\n\\t\\t// Anon class for ListView OnClick\\n\\t\\tlv.setOnItemClickListener(new OnItemClickListener() {\\n\\t\\t\\tpublic void onItemClick(AdapterView<?> parent, View view,\\n\\t\\t\\t\\t\\tint position, long id) {\\n\\t\\t\\t\\tindex = position;\\n\\t\\t\\t\\tdialog = PopupDialog.getInstance(((Requester) getListAdapter().getItem(position)));\\n\\t\\t\\t\\tdialog.show(getFragmentManager(), \\\"PopUpDialogFragment\\\");\\n\\t\\t\\t}\\n\\t\\t});\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e0bf70af614bb8caddaea745a24d4aea\",\n \"score\": \"0.48257372\",\n \"text\": \"Game createGame(GameInformation game);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cdf11c53fbbf30a3fb88adcf7d735776\",\n \"score\": \"0.48192444\",\n \"text\": \"public void createTeam(Context context,final Team team, final ResponseHandlerCreateTeam responseHandler) {\\n RequestQueue requestQueue = Volley.newRequestQueue(context);\\n String url = \\\"http://ec2-34-230-82-126.compute-1.amazonaws.com/api/teams/teams.php\\\";\\n StringRequest MyStringRequest = new StringRequest(Request.Method.POST, url, new Response.Listener<String>() {\\n @Override\\n public void onResponse(String response) {\\n //This code is executed if the server responds, whether or not the response contains data.\\n //The String 'response' contains the server's response.\\n Log.i(\\\"Response from Create Team\\\", response);\\n\\n try {\\n String in = response;\\n JSONObject reader = new JSONObject(response);\\n\\n boolean hasId = reader.has(\\\"Id\\\");\\n\\n if (hasId) {\\n Log.i(\\\"Team id?????\\\", reader.getString(\\\"Id\\\"));\\n team.setTeamId(Integer.parseInt(reader.getString(\\\"Id\\\")));\\n Log.i(\\\"Team Id after Set\\\", Integer.toString(team.getTeamId()));\\n responseHandler.onSuccess(team);\\n }\\n else {\\n Log.e(\\\"Create team failure in create team api method \\\" , \\\" \\\");\\n responseHandler.onFailure();\\n }\\n }\\n catch (Exception e){\\n e.printStackTrace();\\n }\\n\\n }\\n }, new Response.ErrorListener() { //Create an error listener to handle errors appropriately.\\n @Override\\n public void onErrorResponse(VolleyError error) {\\n //This code is executed if there is an error.\\n Log.e(\\\"VOLLEY ERROR\\\", error.toString());\\n responseHandler.onFailure();\\n }\\n }) {\\n protected Map<String, String> getParams() {\\n Map<String, String> MyData = new HashMap<String, String>();\\n\\n /*\\n * This is where the information for each account would go to add to the database\\n */\\n MyData.put(\\\"organizer\\\", team.getOrganizer());\\n MyData.put(\\\"teamName\\\", team.getTeamName()); //Add the data you'd like to send to the server.\\n MyData.put(\\\"teamSize\\\", team.getSize());\\n MyData.put(\\\"chalId\\\", team.getChallengeId());\\n\\n return MyData;\\n }\\n };\\n\\n requestQueue.add(MyStringRequest);\\n\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b24307b392aa147b4349ddd27f95c2f2\",\n \"score\": \"0.48152298\",\n \"text\": \"private SkillListReq(com.google.protobuf.GeneratedMessageV3.Builder<?> builder) {\\n super(builder);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9a2dd2e32ce4618429ea56507bb627bf\",\n \"score\": \"0.48107368\",\n \"text\": \"public ServerResponse getAllGames() {\\n\\t\\t\\n\\t\\t//make post to proper url using json as the body of the request\\n\\t\\tString url = \\\"/games/list\\\";\\n\\t\\tServerResponse response = server.doGet(url);\\n\\t\\t\\n\\t\\tconverter.convertGameInfo(response);\\n\\t\\treturn response; \\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"953d440bbaeaede24dadb8a0b15ed5d9\",\n \"score\": \"0.48077035\",\n \"text\": \"@Test\\r\\n\\tpublic void testGetJoinableGames() {\\r\\n\\t\\tJSONObject serverResult;\\r\\n\\t\\tArrayList<Integer> result;\\r\\n\\t\\t\\r\\n\\t\\t//Valid game creation\\r\\n\\t\\tserverResult = new JSONObject();\\r\\n\\t\\tJSONArray games = new JSONArray();\\r\\n\\t\\tgames.add(1);\\r\\n\\t\\tserverResult.put(\\\"result\\\",\\\"success\\\");\\r\\n\\t\\tserverResult.put(\\\"games\\\",games);\\r\\n\\t\\tSendAsServer(serverResult);\\r\\n\\t\\tresult = GetJoinableGames();\\r\\n\\t\\tAssert.assertEquals(result.size(), 1);\\r\\n\\t\\tAssert.assertEquals((int)result.get(0), 1);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a29bb162dd13202aab617638d6867b2f\",\n \"score\": \"0.47961324\",\n \"text\": \"private static List<User> createGameUserList(GameSession game) {\\n List<User> list = new ArrayList<>();\\n for (Player player : game.getPlayers()) {\\n User foundUser = null;\\n for (User user : Server.currentUsers) {\\n if (user.getUserId() == player.getUserId()) {\\n foundUser = user;\\n break;\\n }\\n }\\n if (foundUser != null) {\\n list.add(foundUser);\\n }\\n }\\n return list;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5552219b970b9e576c548f907efb62b0\",\n \"score\": \"0.47926193\",\n \"text\": \"@Override\\n\\tpublic void holderListener(ArrayList<LeaveRequest> leaveRequestList) {\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"723836bc7c7d2a8723532e34309f9cd2\",\n \"score\": \"0.47747952\",\n \"text\": \"@Override\\n public void onCreate(Bundle savedInstanceState) {\\n super.onCreate(savedInstanceState);\\n setContentView(R.layout.list);\\n\\n Intent i = getIntent();\\n String gameName = i.getStringExtra(\\\"name\\\");\\n\\n ref = new Firebase(Data.FIREBASE_URL + \\\"/games/\\\" + gameName);\\n\\n findViewById(R.id.viewNewButton).setOnClickListener(new View.OnClickListener() {\\n @Override\\n public void onClick(View v) {\\n Intent i = new Intent(getApplicationContext(), NewGameActivity.class);\\n startActivity(i);\\n }\\n });\\n\\n findViewById(R.id.viewJoinButton).setOnClickListener(new View.OnClickListener() {\\n @Override\\n public void onClick(View v) {\\n Intent i = new Intent(getApplicationContext(), JoinActivity.class);\\n startActivity(i);\\n }\\n });\\n\\n findViewById(R.id.viewListButton).setOnClickListener(new View.OnClickListener() {\\n @Override\\n public void onClick(View v) {\\n Intent i = new Intent(getApplicationContext(), ListGamesActivity.class);\\n startActivity(i);\\n }\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"43001ce5ee39252c2349dfe8417ccff8\",\n \"score\": \"0.47735706\",\n \"text\": \"public void run() {\\n while (true) {\\n try {\\n System.out.println(\\\"running...\\\");\\n //Reset all relavent variables\\n incoming = new byte[256];\\n outgoing = new byte[256];\\n userExists = false;\\n gameAddress = null;\\n returnPacket = null;\\n genericPacket = null;\\n gameInstance = null;\\n\\n //Receive a game.packet (or maybe lobby.packet)\\n DatagramPacket packet = new DatagramPacket(incoming, incoming.length);\\n socket.receive(packet);\\n\\n System.out.println(\\\"gameServer packet received\\\");\\n\\n //Obtain port and address of the sender.\\n address = packet.getAddress();\\n port = packet.getPort();\\n\\n if (incoming[0] == OpCode.START_GAME.valueOf()) {\\n /*\\n * PRE-GAME: A new game has just been started. Add it to the list of currently active games.\\n */\\n System.out.println(\\\"game.server START_GAME\\\");\\n StartGamePacket sgp = new StartGamePacket(incoming);\\n gameList.ensureCapacity(gameList.size() + 1);\\n GameInstance newGame = new GameInstance(sgp.getLobbyId(), sgp.getOptions(), sgp.getMSD());\\n gameList.add(newGame);\\n //END\\n } else if (incoming[0] == OpCode.JOIN.valueOf()) {\\n /*\\n * PRE-GAME: A game has been started, add these users to the game.\\n */\\n System.out.println(\\\"game.server JOIN\\\");\\n JoinLobbyPacket jlp = new JoinLobbyPacket(incoming);\\n for (GameInstance game : gameList)\\n if (Utilities.compareLobbyIds(game.getGameId(), jlp.getLobbyId()))\\n game.addUsers(jlp.getUsers());\\n //END\\n } else {\\n outgoing = incoming;\\n genericPacket = new GenericPacket(incoming);\\n gameAddress = Utilities.idAsInetAddress(genericPacket.getGameId());\\n\\n for (GameInstance game : gameList)\\n if (Utilities.compareLobbyIds(genericPacket.getGameId(), game.getGameId()))\\n gameInstance = game;\\n }\\n\\n if (gameInstance != null) {\\n if (incoming[0] == GameOps.GAME_INFO.valueOf()) {\\n //A new game is being requested to start. If lobby Id is not in use it can start.\\n System.out.println(\\\"game.server GAME_INFO\\\");\\n GenericPacket gp = new GenericPacket(incoming);\\n //Send Game Options\\n outgoing = new StartGamePacket(gameInstance.getGameId(), gameInstance.getAllOptions(), gameInstance.getMSD(), gp.getNation()).getPacket();\\n //END\\n } else if (incoming[0] == GameOps.GAME_USERS.valueOf()) {\\n /*\\n * Users of a game have been requested. Send the list of users in game with matching game Id.\\n */\\n System.out.println(\\\"game.server GAME_USERS\\\");\\n GenericPacket gp = new GenericPacket(incoming);\\n gameInstance.setupGame();\\n //Send Users\\n if (!gameInstance.isGameFull()) {\\n //One Packet\\n outgoing = new JoinLobbyPacket(gameInstance.getGameId(), gameInstance.getUsers()).getPacket();\\n DatagramPacket addUsersPacket = new DatagramPacket(outgoing, outgoing.length, gameAddress, Ports.GAME_CLIENT_PORT);\\n socket.send(addUsersPacket);\\n } else {\\n //Two Packets\\n ArrayList<User> firstSixUsers = new ArrayList<User>(gameInstance.getUsers().subList(0,6));\\n outgoing = new JoinLobbyPacket(gameInstance.getGameId(), firstSixUsers).getPacket();\\n DatagramPacket firstSixPacket = new DatagramPacket(outgoing, outgoing.length, gameAddress, Ports.GAME_CLIENT_PORT);\\n socket.send(firstSixPacket);\\n\\n outgoing = new JoinLobbyPacket(gameInstance.getGameId(), gameInstance.getUsers().get(6)).getPacket();\\n DatagramPacket lastUserPacket = new DatagramPacket(outgoing, outgoing.length, gameAddress, Ports.GAME_CLIENT_PORT);\\n socket.send(lastUserPacket);\\n }\\n outgoing = new GameReadyPacket(gp.getGameId(), gp.getNation()).getPacket();\\n //END\\n } else if (incoming[0] == GameOps.PLACE_UNITS.valueOf()) {\\n /*\\n * Units have been placed on the map. Update the servers instance of the map.\\n */\\n System.out.println(\\\"game.server PLACE_UNITS\\\");\\n GamePlaceUnitsPacket placeUnits = new GamePlaceUnitsPacket(incoming);\\n\\n Region region = gameInstance.getMap().getRegionFromIndex(placeUnits.getRegionIndex(), placeUnits.getRegionType());\\n ArrayList<MilitaryUnit> units = Utilities.getUnitsFromPacket(placeUnits);\\n boolean unitsAdded = UnitController.moveAllUnits(units, gameInstance.getMap().getRegion(region.toString()));\\n\\n if (!unitsAdded) {\\n GameServerLogger.log(\\\"Unable to place units to region: \\\" + region.toString() + \\\" for nation: \\\" + placeUnits.getOwningNation());\\n gameAddress = null; //todo if units aren't added.\\n }\\n //END\\n } else if (incoming[0] == GameOps.UNITS_PLACED.valueOf()) {\\n //Adding units have been finished for a specific nation.\\n System.out.println(\\\"game.server ALL_UNITS_PLACED\\\");\\n //END\\n } else if (incoming[0] == GameOps.ADD_UNITS.valueOf()) {\\n System.out.println(\\\"game.server ADD_UNITS\\\");\\n GameAddUnitsPacket addUnits = new GameAddUnitsPacket(incoming);\\n GameUtilities.doPurchaseUnits(addUnits, gameInstance.getNation(addUnits.getOwningNation()));\\n //END\\n /*\\n * Political Actions\\n */\\n } else if (incoming[0] == GameOps.DECLARE_WAR.valueOf()) {\\n System.out.println(\\\"game.server DECLARE_WAR\\\");\\n WarDeclarationPacket warDec = new WarDeclarationPacket(incoming);\\n gameInstance.getNation(warDec.getDeclaringNation()).declareWar(warDec.getEnemyNation(), warDec.getPapCost(), true);\\n gameInstance.getNation(warDec.getEnemyNation()).declareWar(warDec.getDeclaringNation(), 0, false);\\n //END\\n } else if (incoming[0] == GameOps.SUE_FOR_PEACE.valueOf()) {\\n System.out.println(\\\"game.server SUE FOR PEACE\\\");\\n SueForPeacePacket sfp = new SueForPeacePacket(incoming);\\n PoliticalUtilities.doSueForPeace(sfp.getSueingNation(), gameInstance);\\n } else if (incoming[0] == GameOps.NATION_TO_CONTROL.valueOf()) {\\n //Related to War Dec\\n System.out.println(\\\"game.server NATION_TO_CONTROL\\\");\\n NationToControlPacket ntc = new NationToControlPacket(incoming);\\n for (User u : gameInstance.getUsers()) {\\n if (u.getNation() == ntc.getUserToControl()\\n || u.getControlledNPNs().contains(ntc.getUserToControl()))\\n PoliticalUtilities.doControlNPN(gameInstance.getNation(ntc.getUncontrolledNation()), u, null,\\n gameInstance.getUserByNPN(ntc.getUncontrolledNation()));\\n }\\n //END\\n } else if (incoming[0] == GameOps.MULTI_NATION.valueOf()) {\\n //Related to War Dec\\n System.out.println(\\\"game.server MULTI_NATION\\\");\\n //END\\n } else if (incoming[0] == GameOps.RETALIATION_WAR.valueOf()) {\\n //Related to War Dec\\n System.out.println(\\\"game.server RETALIATION_WAR\\\");\\n RetaliationWarDecPacket warRetaliation = new RetaliationWarDecPacket(incoming);\\n if (warRetaliation.isDeclaring()) {\\n gameInstance.getNation(warRetaliation.getRetaliator()).declareWar(warRetaliation.getInitDeclarer(), warRetaliation.getPapCost(), true);\\n gameInstance.getNation(warRetaliation.getInitDeclarer()).declareWar(warRetaliation.getRetaliator(), 0, false);\\n }\\n //END\\n } else if (incoming[0] == GameOps.SUE_FOR_PEACE.valueOf()) {\\n SueForPeacePacket sfp = new SueForPeacePacket(incoming);\\n ArrayList<Integer> congressNations = PoliticalUtilities.doSueForPeace(sfp.getSueingNation(), gameInstance);\\n PoliticalUtilities.spoilsOfWar(congressNations, gameInstance.getNation(sfp.getSueingNation()));\\n //END\\n } else if (incoming[0] == GameOps.FORM_ALLIANCE.valueOf()) {\\n System.out.println(\\\"game.server FORM ALLIANCE\\\");\\n FormAlliancePacket fap = new FormAlliancePacket(incoming);\\n //Alliance Accepted\\n if ( !fap.isRequest() && fap.hasAccepted() ) {\\n int nationOne = fap.getNationOne();\\n int nationTwo = fap.getNationTwo();\\n gameInstance.getNation(nationOne).formAlliance(nationTwo);\\n gameInstance.getNation(nationTwo).formAlliance(nationOne);\\n }\\n //Alliance Rejected do nothing, just forward onto clients.\\n //Alliance Requested do nothing, just forward onto clients.\\n //END\\n } else if (incoming[0] == GameOps.BREAK_ALLIANCE.valueOf()) {\\n System.out.println(\\\"game.server BREAK ALLIANCE\\\");\\n BreakAlliancePacket bap = new BreakAlliancePacket(incoming);\\n PoliticalUtilities.doBreakAlliance(gameInstance.getNation(bap.getBreakingNation()), gameInstance.getNation(bap.getAlliedNation()));\\n //END\\n } else if (incoming[0] == GameOps.ARMISTICE.valueOf()) {\\n System.out.println(\\\"game.server CONCLUDE ARMISTICE\\\");\\n ConcludeArmisticePacket cap = new ConcludeArmisticePacket(incoming);\\n //Armistice Accepted\\n if ( !cap.isRequest() && cap.hasAccepted() )\\n PoliticalUtilities.doConcludeArmistice(gameInstance.getNation(cap.getNationOne()), gameInstance.getNation(cap.getNationTwo()));\\n //Armistice Rejected do nothing, just forward onto clients.\\n //Armistice Requested do nothing, just forward onto clients.\\n //END\\n } else if (incoming[0] == GameOps.GRANT_PASSAGE.valueOf()) {\\n System.out.println(\\\"game.server GRANT PASSAGE\\\");\\n GrantPassagePacket gpp = new GrantPassagePacket(incoming);\\n PoliticalUtilities.doGrantPassage(gameInstance.getNation(gpp.getGrantingNation()), gpp.getReceivingNation(), gpp.isVoluntary());\\n //END\\n } else if (incoming[0] == GameOps.RESCIND_PASSAGE.valueOf()) {\\n System.out.println(\\\"game.server RESCIND PASSAGE\\\");\\n RescindPassagePacket rpp = new RescindPassagePacket(incoming);\\n PoliticalUtilities.doRescindPassage(gameInstance.getNation(rpp.getRescindingNation()), rpp.getLosingNation());\\n //END\\n } else if (incoming[0] == GameOps.CONTROL_NPN.valueOf()) {\\n System.out.println(\\\"game.server CONTROL NPN\\\");\\n } else if (incoming[0] == GameOps.RELEASE_NPN.valueOf()) {\\n System.out.println(\\\"game.server RELEASE_NPN\\\");\\n ReleaseNPNPacket rnp = new ReleaseNPNPacket(incoming);\\n PoliticalUtilities.doReleaseNPN( gameInstance.getNation(rnp.getNonPlayerNation()), gameInstance.getUserByNation(rnp.getPlayerNation()),\\n null, gameInstance.getMonth(), gameInstance.getYear());\\n } else if (incoming[0] == GameOps.FAIL_CONTROL_NPN.valueOf()) {\\n System.out.println(\\\"game.server FAIL_CONTROL NPN\\\");\\n } else if (incoming[0] == GameOps.SETUP_DIPLOMAT.valueOf()) {\\n System.out.println(\\\"game.server SETUP_DIPLOMAT\\\");\\n } else if (incoming[0] == GameOps.NEXT_DIPLOMAT.valueOf()) {\\n System.out.println(\\\"game.server NEXT_DIPLOMAT\\\");\\n } else if (incoming[0] == GameOps.CONGRESS_ANNEX.valueOf()) {\\n System.out.println(\\\"game.server CONGRESS_ANNEX\\\");\\n CongressActionPacket cap = new CongressActionPacket(incoming);\\n PoliticalUtilities.doCongressAnnex( gameInstance.getNation(cap.getSueingNation()), gameInstance.getNation(cap.getActionNation()),\\n (LandRegion)gameInstance.getMap().getRegionFromIndex(cap.getRegionOneIndex(), Region.LAND_REGION) );\\n if ( gameInstance.getNation(cap.getSueingNation()).isExtinct() )\\n PoliticalUtilities.makeNationExtinct( gameInstance.getNation(cap.getSueingNation()) );\\n } else if (incoming[0] == GameOps.CONGRESS_RESTORE.valueOf()) {\\n System.out.println(\\\"game.server CONGRESS_RESTORE\\\");\\n CongressActionPacket cap = new CongressActionPacket(incoming);\\n PoliticalUtilities.doCongressRestore( gameInstance.getNation(cap.getSueingNation()),\\n (LandRegion)gameInstance.getMap().getRegionFromIndex(cap.getRegionOneIndex(), Region.LAND_REGION) );\\n if (cap.getRegionTwoIndex() > 0) {\\n PoliticalUtilities.doCongressRestore( gameInstance.getNation(cap.getSueingNation()),\\n (LandRegion)gameInstance.getMap().getRegionFromIndex(cap.getRegionTwoIndex(), Region.LAND_REGION) );\\n }\\n if ( gameInstance.getNation(cap.getSueingNation()).isExtinct() )\\n PoliticalUtilities.makeNationExtinct( gameInstance.getNation(cap.getSueingNation()) );\\n } else if (incoming[0] == GameOps.CONGRESS_FREESERF.valueOf()) {\\n System.out.println(\\\"game.server CONGRESS_FREESERF\\\");\\n CongressActionPacket cap = new CongressActionPacket(incoming);\\n PoliticalUtilities.doCongressFreeSerfs( (LandRegion)gameInstance.getMap().getRegionFromIndex(cap.getRegionOneIndex(), Region.LAND_REGION) );\\n if (cap.getRegionTwoIndex() > 0) {\\n PoliticalUtilities.doCongressFreeSerfs( (LandRegion)gameInstance.getMap().getRegionFromIndex(cap.getRegionTwoIndex(), Region.LAND_REGION) );\\n }\\n if (cap.getRegionThreeIndex() > 0) {\\n PoliticalUtilities.doCongressFreeSerfs( (LandRegion)gameInstance.getMap().getRegionFromIndex(cap.getRegionThreeIndex(), Region.LAND_REGION) );\\n }\\n } else if (incoming[0] == GameOps.CONGRESS_PASS.valueOf()) {\\n System.out.println(\\\"game.server CONGRESS_PASS\\\");\\n } else if (incoming[0] == GameOps.CONGRESS_MOVENPN.valueOf()) {\\n System.out.println(\\\"game.server CONGRESS_MOVENPN\\\");\\n MoveNPNUnitsPacket mnu = new MoveNPNUnitsPacket(incoming);\\n PoliticalUtilities.moveNPNMilitary( gameInstance.getNation(mnu.getSueingNation()), gameInstance, null );\\n /*\\n * END Political Actions\\n */\\n } else if (incoming[0] == GameOps.CHAT.valueOf()) {\\n //A game chat packet has been received.\\n System.out.println(\\\"game.server CHAT\\\");\\n //END\\n }\\n returnPacket = new DatagramPacket(outgoing, outgoing.length, gameAddress, Ports.GAME_CLIENT_PORT);\\n } else {\\n outgoing = new GameNotFoundPacket(genericPacket.getGameId(), genericPacket.getOpCode()).getPacket();\\n returnPacket = new DatagramPacket(outgoing, outgoing.length, address, port);\\n }\\n\\n //Send Packet if necessary\\n if (gameAddress != null)\\n socket.send(returnPacket);\\n\\n } catch (IOException e) {\\n System.err.println(\\\"Game Server Thread IOerror.\\\");\\n e.printStackTrace();\\n GameServerLogger.log(\\\"GameServerThread - \\\" + e.getMessage());\\n break;\\n } catch (Exception e) {\\n System.err.println(\\\"Game Server Thread has thrown an Error\\\");\\n e.printStackTrace();\\n GameServerLogger.log(\\\"GameServerThread - \\\" + e.getMessage());\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ea371b9b1b426a209b1d86c6936c1846\",\n \"score\": \"0.47649124\",\n \"text\": \"public ArrayList<GameInfo> createNewGame(String title, boolean randomHexes, boolean randomNumbers, boolean randomPorts) { //JoinGameController --goes in Setup !!Not sure if needed\\n\\t\\t\\n\\t\\tswitch (gameState) {\\n\\t\\tcase Login:\\n\\t\\t\\tbreak;\\n\\t\\tcase JoinGame:\\n\\t\\t\\tGameModel gameModel = new GameModel();\\n\\t\\t\\tgameModel.setRandomHexes(randomHexes);\\n\\t\\t\\tgameModel.setRandomNumbers(randomNumbers);\\n\\t\\t\\tgameModel.setRandomPorts(randomPorts);\\n\\t\\t\\tserverProxyFacade.createGame(title, randomHexes, randomNumbers, randomPorts);\\n\\t\\t\\tServerResponse serverResponse = serverProxyFacade.getAllGames();\\n\\t\\t\\tArrayList gameObjects = (ArrayList)serverResponse.getBody();\\n\\t\\t\\tArrayList<GameInfo> games = new ArrayList<GameInfo>();\\n\\t\\t\\tfor(Object game: gameObjects) {\\n\\t\\t\\t\\tgames.add((GameInfo)game);\\n\\t\\t\\t}\\n\\t\\t\\treturn games;\\n\\t\\tcase PlayerWaiting:\\n\\t\\t\\tbreak;\\n\\t\\tcase Setup:\\n\\t\\t\\tbreak;\\n\\t\\tcase GamePlay:\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\treturn null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a02cecf09864926df45a79e70d550371\",\n \"score\": \"0.47623578\",\n \"text\": \"@Override\\n protected void onCreate(Bundle savedInstanceState) {\\n super.onCreate(savedInstanceState);\\n setContentView(R.layout.activity_waiting_2_);\\n Toolbar toolbar = (Toolbar) findViewById(R.id.toolbar);\\n toolbar.setTitle(\\\"ChromeCast Cribbage\\\");\\n setSupportActionBar(toolbar);\\n\\n getSupportActionBar().setDisplayHomeAsUpEnabled(true);\\n\\n playerOne = (TextView) findViewById(R.id.playerOne);\\n playerTwo = (TextView) findViewById(R.id.playerTwo);\\n playerThree = (TextView) findViewById(R.id.playerThree);\\n playerFour = (TextView) findViewById(R.id.playerFour);\\n\\n //prev = getIntent().getExtras();\\n //numPlayers = 3;//prev.getInt(\\\"players\\\");\\n\\n //mCastConnectionManager = Welcome_Activity.getCastConnectionManager();\\n startButton = (Button) findViewById(R.id.startButton);\\n\\n Welcome_Activity.mCastConnectionManager.getGameManagerClient().setListener(this);\\n\\n JSONObject jsonMessage = new JSONObject();\\n try {\\n jsonMessage.put(\\\"getPlayers\\\", \\\"yes\\\");\\n } catch (JSONException e) {\\n Log.e(\\\"json\\\", \\\"Error creating JSON message\\\", e);\\n return;\\n }\\n Welcome_Activity.mCastConnectionManager.getGameManagerClient().sendGameMessage(jsonMessage);\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7dfb1cb24e86d3061fdacf03490cc847\",\n \"score\": \"0.47599876\",\n \"text\": \"public void sendRequestLobbyEntranceMessage();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1c0cef7196f03753b764c019fe94a333\",\n \"score\": \"0.4754649\",\n \"text\": \"public void getEvent(String event_Id) {\\n loadingIndicatorView.setVisibility(View.VISIBLE);\\n JsonObjectRequest jsonObjectRequest = new JsonObjectRequest(ApiService.REQUEST_METHOD_GET, ApiService.GET_INVITATION_LIST+event_Id+\\\"?calendarType=mycalendar\\\",null, new Response.Listener<JSONObject>() {\\n @Override\\n public void onResponse(JSONObject response) {\\n model = null;\\n if(response!=null){\\n try{\\n eventResultModel = new Gson().fromJson(response.toString(), EventResultModel.class);\\n model = (ArrayList<InvitationsModel>) eventResultModel.getInvitationList();\\n setUpEventPartners();\\n\\n }catch (Exception e){\\n e.printStackTrace();\\n }\\n\\n }\\n\\n }\\n }, new Response.ErrorListener() {\\n @Override\\n public void onErrorResponse(VolleyError error) {\\n\\n }\\n }){\\n @Override\\n public Map<String, String> getHeaders(){\\n HashMap<String, String> headers = new HashMap<String, String>();\\n headers.put(\\\"Authorization\\\", \\\"Bearer \\\" + user_token);\\n //headers.put(\\\"Content-Type\\\", \\\"application/json; charset=utf-8\\\");\\n return headers;\\n }\\n\\n };\\n if (getActivity() != null) {\\n RequestQueue requestQueue = Volley.newRequestQueue(getActivity());\\n Log.d(\\\"Request\\\", jsonObjectRequest.toString());\\n requestQueue.add(jsonObjectRequest);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bca158f44f899ddf524b0f468af7f104\",\n \"score\": \"0.47517747\",\n \"text\": \"public interface ListFollowerListener {\\n\\n void onLoadListUsers(ApiResponse.Users rankings);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"394efb6b4e6eee2e7446f7ecee5b5edb\",\n \"score\": \"0.47475025\",\n \"text\": \"@Override\\n public Object createGame(Object player, java.util.List<?> questions) {\\n Game game = new Game((Player) player);\\n\\n // Create GameAnswerList\\n Map<Question, Integer> gameAnswers = new HashMap<>();\\n for (Object question : questions) {\\n gameAnswers.put((Question) question, -1);\\n }\\n game.setAnswerList(gameAnswers);\\n\\n return game;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f5839af4aa7c44de463af4505bfb9182\",\n \"score\": \"0.4735727\",\n \"text\": \"private FetchWaiterListRequest fetchWaiterListRequest() {\\n\\n\\n FetchWaiterListRequest fetchWaiterListRequest = new FetchWaiterListRequest();\\n fetchWaiterListRequest.setRest_id(restid);\\n\\n Log.w(TAG,\\\"FetchWaiterListRequest\\\"+ new Gson().toJson(fetchWaiterListRequest));\\n return fetchWaiterListRequest;\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5c8bc74aee520a333d5f76a7dec53f4a\",\n \"score\": \"0.4731992\",\n \"text\": \"public void createGameButtonHandler(ActionEvent event) {\\n createGameButton.setDisable(true);\\n // Start a server thread for the game\\n startServerConnection();\\n // Start a client connection\\n startClientConnection();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3bbc0d32a3193870687764ea648ac542\",\n \"score\": \"0.47292057\",\n \"text\": \"private void requestingResponseFromPlayer()\\n {\\n // CALL timer's start method\\n timer.start();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1b8683062636f6f50b841814af308afe\",\n \"score\": \"0.4718098\",\n \"text\": \"private void fetchChatRooms() {\\n StringRequest strReq = new StringRequest(Request.Method.GET,\\n EndPoints.CHAT_ROOMS, new Response.Listener<String>() {\\n\\n @Override\\n public void onResponse(String response) {\\n Log.e(TAG, \\\"response: \\\" + response);\\n\\n try {\\n JSONObject obj = new JSONObject(response);\\n\\n // check for error flag\\n if (obj.getBoolean(\\\"error\\\") == false) {\\n JSONArray chatRoomsArray = obj.getJSONArray(\\\"chat_rooms\\\");\\n for (int i = 0; i < chatRoomsArray.length(); i++) {\\n JSONObject chatRoomsObj = (JSONObject) chatRoomsArray.get(i);\\n ChatRoom cr = new ChatRoom();\\n cr.setId(chatRoomsObj.getString(\\\"chat_room_id\\\"));\\n cr.setName(chatRoomsObj.getString(\\\"name\\\"));\\n cr.setLastMessage(\\\"\\\");\\n cr.setUnreadCount(0);\\n cr.setTimestamp(chatRoomsObj.getString(\\\"created_at\\\"));\\n\\n chatRoomArrayList.add(cr);\\n }\\n\\n } else {\\n // error in fetching chat rooms\\n Toast.makeText(getApplicationContext(), \\\"\\\" + obj.getJSONObject(\\\"error\\\").getString(\\\"message\\\"), Toast.LENGTH_LONG).show();\\n }\\n\\n } catch (JSONException e) {\\n Log.e(TAG, \\\"json parsing error: \\\" + e.getMessage());\\n Toast.makeText(getApplicationContext(), \\\"Json parse error: \\\" + e.getMessage(), Toast.LENGTH_LONG).show();\\n }\\n\\n mAdapter.notifyDataSetChanged();\\n\\n // subscribing to all chat room topics\\n subscribeToAllTopics();\\n }\\n }, new Response.ErrorListener() {\\n\\n @Override\\n public void onErrorResponse(VolleyError error) {\\n NetworkResponse networkResponse = error.networkResponse;\\n Log.e(TAG, \\\"Volley error: \\\" + error.getMessage() + \\\", code: \\\" + networkResponse);\\n Toast.makeText(getApplicationContext(), \\\"Volley error: \\\" + error.getMessage(), Toast.LENGTH_SHORT).show();\\n }\\n });\\n\\n //Adding request to request queue\\n MyApplication.getInstance().addToRequestQueue(strReq);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"49f4912033d929a3b18e7750ef55614d\",\n \"score\": \"0.47111684\",\n \"text\": \"public void addScoreToTeam2(){\\n SharedPreferences preferences = ctx.getSharedPreferences(\\\"User_status\\\", 0);\\n long gameID = preferences.getLong(\\\"gameID\\\", 1);\\n nullResponse();\\n mVolleyService = new VolleyService(result, ctx);\\n mVolleyService.putDataVolley(\\\"input\\\", \\\"http://172.31.82.149:8080/api/games/upScoret2/\\\" + String.valueOf(gameID), null);\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7ee16945b7161816fe46c1ce54de5b71\",\n \"score\": \"0.47084653\",\n \"text\": \"@Override\\n public void onCreate(@Nullable Bundle savedInstanceState) {\\n super.onCreate(savedInstanceState);\\n ident = new IdentProvider(getContext());\\n ctx = this;\\n\\n mServerRequestModule = ServerRequestModule.getInstance();\\n if (mServerRequestModule == null) {\\n Toast.makeText(context, \\\"serverProblem\\\", Toast.LENGTH_LONG).show();\\n }\\n // TODO server call for user's hosted/ing events here\\n evntlist = new ArrayList<>();\\n loadList();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c6cc59b86867c1ac9b4c87e97b9d8eba\",\n \"score\": \"0.47070715\",\n \"text\": \"private void requestLobby() {\\n\\t\\tsendMessage(Server.LOBBY + server.lobbyToString());\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0edcba0052e4502b4daab5d441f45fa9\",\n \"score\": \"0.4706299\",\n \"text\": \"ServerResponse handleAction(OnTurnStartRequest request);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b94c82a60cf5536aa9adf018896f5de0\",\n \"score\": \"0.47039086\",\n \"text\": \"@Override\\r\\n\\tpublic TableResponse<Collections> list(TableRequest request) {\\n\\t\\t return TableRequestHandler.<Collections> builder().countHandler(new CountHandler() {\\r\\n\\r\\n\\t @Override\\r\\n\\t public int count(TableRequest request) {\\r\\n\\t return collectionsDao.count(request.getParams());\\r\\n\\t }\\r\\n\\t }).listHandler(new ListHandler<Collections>() {\\r\\n\\r\\n\\t @Override\\r\\n\\t public List<Collections> list(TableRequest request) {\\r\\n\\t return collectionsDao.list(request.getParams(), request.getStart(), request.getLength());\\r\\n\\t }\\r\\n\\t }).build().handle(request);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"00710fae42f1c3732c7581ea53a466fd\",\n \"score\": \"0.4700568\",\n \"text\": \"public void onRequest(RequestType request, int code);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3ceff0c71e95b7f5d290b62e5fa92b88\",\n \"score\": \"0.47002274\",\n \"text\": \"private void loadAddPlayerResponse(){\\n this.commandMap.put(\\\"addPlayerResponse\\\", jsonElement -> new AddPlayerCommand(\\n jsonElement.getAsJsonObject().get(\\\"data\\\").getAsJsonObject().get(\\\"validNick\\\").getAsBoolean(),\\n jsonElement.getAsJsonObject().get(\\\"data\\\").getAsJsonObject().get(\\\"lobbyState\\\").getAsBoolean(),\\n jsonElement.getAsJsonObject().get(\\\"data\\\").getAsJsonObject().get(\\\"lobbySize\\\").getAsInt(),\\n jsonElement.getAsJsonObject().get(\\\"data\\\").getAsJsonObject().get(\\\"fullLobby\\\").getAsBoolean()));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"abbfb0bec9a3c2968f9c91bc4e96eaf3\",\n \"score\": \"0.4699022\",\n \"text\": \"ServerResponse handleAction(OnPlayerRejoinRequest request);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ed9fddae5667fb50503bbdbd21c67aec\",\n \"score\": \"0.46918783\",\n \"text\": \"@Override\\n public void onClick(View view) {\\n b.getDataHandler(new Database.DataHandler() {\\n @Override\\n <T> void postReceivedData(T result) {\\n BookingInstanceTableDO booking = (BookingInstanceTableDO) result;\\n booking.setStatus(\\\"Rejected\\\");\\n b.update(booking);\\n }\\n }).getData(BookingInstanceTableDO.class, bookingID);\\n b.getDataHandler(new Database.DataHandler() { \\n @Override\\n <T> void postReceivedData(T result) {\\n ProfTableDO prof = (ProfTableDO) result;\\n List<String> blockedTimings = ((ProfTableDO) result).getProfBlockedTimings();\\n blockedTimings.remove(timing.toString());\\n prof.setProfBlockedTimings(blockedTimings);\\n b.update(prof);\\n }\\n\\n @Override\\n public void showOnUI(Handler handler) {\\n handler.post(new Runnable() {\\n @Override\\n public void run() {\\n updatedResult.remove(requestsList.get(position));\\n requestsList.clear();\\n requestsList.addAll(updatedResult);\\n notifyDataSetChanged();\\n Toast.makeText(context, \\\"Request has been declined\\\", Toast.LENGTH_LONG).show();\\n }\\n });\\n }\\n }).getData(ProfTableDO.class, username);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ca9e36a729554ba2761debed3798f64b\",\n \"score\": \"0.46907654\",\n \"text\": \"private void sendDialogDataToDataBase(String data) {\\n AnswerInput answerInput = new AnswerInput(data,mParam2,mParam3);\\n JSONObject json = null;\\n try { \\n json = new JSONObject(gson.toJson(answerInput));\\n } catch (JSONException e) {\\n e.printStackTrace();\\n }\\n\\n JsonObjectRequest jsonObjectRequest = new JsonObjectRequest(Request.Method.POST, getString(R.string.add_new_answer), json,\\n new Response.Listener<JSONObject>() {\\n @Override\\n public void onResponse(JSONObject response) {\\n Log.i(tag,response.toString());\\n AnswerResponse newAnswerResponse = gson.fromJson(response.toString(), AnswerResponse.class);\\n progressBar.setVisibility(View.GONE);\\n if (newAnswerResponse.getCode() == 1) {\\n getAnswers();\\n Toast.makeText(getContext(), getString(R.string.new_answer_added),Toast.LENGTH_LONG).show();\\n }\\n }\\n }, new Response.ErrorListener() {\\n @Override\\n public void onErrorResponse(VolleyError error) {\\n Log.i(tag,error.toString());\\n Toast.makeText(getContext(), getString(R.string.error),Toast.LENGTH_LONG).show();\\n progressBar.setVisibility(View.GONE);\\n }\\n });\\n\\n queue.add(jsonObjectRequest);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"abf730e17df9ef7368b70be855e38aaa\",\n \"score\": \"0.46886235\",\n \"text\": \"GameLobby getGameLobbyByGame(GameInformation gameInformation);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4d8c76fe100aadb447ef70d877cfcc3f\",\n \"score\": \"0.46870893\",\n \"text\": \"public static OverviewSmallRequest createOnListChooserResultRequest(String language){\\n/*Generated! Do not modify!*/ OverviewSmallRequest resultInstance = new OverviewSmallRequest(\\\"onListChooserResult\\\", language);\\n/*Generated! Do not modify!*/ return resultInstance;\\n/*Generated! Do not modify!*/ }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6adc0fc4030a9d86d768fd1e6beede16\",\n \"score\": \"0.46796504\",\n \"text\": \"public void addScoreToTeam1(){\\n SharedPreferences preferences = ctx.getSharedPreferences(\\\"User_status\\\", 0);\\n long gameID = preferences.getLong(\\\"gameID\\\", 1);\\n nullResponse();\\n mVolleyService = new VolleyService(result, ctx);\\n mVolleyService.putDataVolley(\\\"input\\\", \\\"http://172.31.82.149:8080/api/games/upScoret1/\\\" + String.valueOf(gameID), null);\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fc21d1d3f8fb92f5d4d58fa7c489ede5\",\n \"score\": \"0.46749607\",\n \"text\": \"private void create(RoutingContext routingContext) {\\n HttpServerRequest request = routingContext.request();\\n String query_params = request.query();\\n String itemType = query_params.split(\\\"=\\\")[1];\\n\\n\\t\\t\\tString skip_validation = \\\"false\\\";\\n\\t\\t\\tif (request.headers().contains(\\\"skip_validation\\\")) {\\n\\t\\t\\t\\tskip_validation = request.getHeader(\\\"skip_validation\\\").toLowerCase();\\n\\t\\t\\t}\\n\\n\\t\\t\\tif (decodeCertificate(routingContext)) {\\n\\t\\t\\t\\tif (authenticateRequest(routingContext, \\\"user.list\\\")) {\\n\\t\\t\\t\\t\\ttry {\\n\\t\\t\\t\\t\\t\\tJsonObject request_body = routingContext.getBodyAsJson();\\n\\t\\t\\t\\t\\t\\trequest_body.put(\\\"onboardedBy\\\", onboarder);\\n\\t\\t\\t\\t\\t\\trequest_body.put(\\\"role\\\", onboardedBy);\\n\\t\\t\\t\\t\\t\\trequest_body.put(\\\"item-type\\\", itemType);\\n\\t\\t\\t\\t\\t\\trequest_body.put(\\\"__createdBy\\\",onboardedBy);\\n\\t\\t\\t\\t\\t\\tDeliveryOptions validator_action = new DeliveryOptions();\\n\\t\\t\\t\\t\\t\\tvalidator_action.addHeader(\\\"action\\\", \\\"validate-item\\\");\\n\\n\\t\\t\\t\\t\\t\\tif (skip_validation != null) {\\n\\t\\t\\t\\t\\t\\t\\tif (!(\\\"true\\\".equals(skip_validation)) && !(\\\"false\\\".equals(skip_validation))) {\\n\\t\\t\\t\\t\\t\\t\\t\\thandle400(routingContext, \\\"Invalid value: skip_validation is not a boolean\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\t\\t\\tvalidator_action.addHeader(\\\"skip_validation\\\", skip_validation);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tvertx.eventBus().send(\\\"validator\\\", request_body, validator_action, validator_reply -> {\\n\\t\\t\\t\\t\\t\\t\\tif (validator_reply.succeeded()) {\\n\\t\\t\\t\\t\\t\\t\\t\\tif (itemTypes.contains(itemType)) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tdatabaseHandler(\\\"create\\\", routingContext, request_body);\\n\\t\\t\\t\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\thandle400(routingContext, \\\"No such item-type exists\\\");\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\t\\t\\thandle500(routingContext);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t});\\n\\n\\t\\t\\t\\t\\t} catch (Exception e) {\\n\\t\\t\\t\\t\\t\\thandle400(routingContext, \\\"Invalid item: Not a Json Object\\\");\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\thandle401(routingContext, \\\"Unauthorised\\\");\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else {\\n\\t\\t\\t\\thandle400(routingContext, \\\"Certificate 'authenticaton' error\\\");\\n\\t\\t\\t}\\n\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"17e04b9cf253bfaac5f7bf9bd55c65e1\",\n \"score\": \"0.46720138\",\n \"text\": \"private static void createNewGame() {\\n GameController gcontroller = GameController.createController(Configuration.logger);\\n GameManager gm = GameManager.createGameStatusManager();\\n GameRender gr = GameRender.createRender();\\n\\n gcontroller.setStatusManager(gm);\\n gcontroller.setGameRender(gr);\\n gm.setGameController(gcontroller);\\n gr.setController(gcontroller);\\n\\n gcontroller.startNewGame();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"53a3d09e18a6592a2e2d0f99afecb341\",\n \"score\": \"0.46662748\",\n \"text\": \"public void sendCreateLobbyMessage(ILobbyInformation lobbyInformation);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4dfa809d40b65d6ebb9f17e3494058c0\",\n \"score\": \"0.46634355\",\n \"text\": \"public InventoryRequest(String item, String curr_qty, String min_qty, String max_qty, String category, String\\n last_time_updated, Response.Listener<String> listener) {\\n super(Request.Method.POST, REGISTER_REQUEST_URL, listener, null);\\n params = new HashMap<>();\\n\\n System.out.println(\\\"INVENTORY REQUEST\\\" + item);\\n System.out.println(\\\"curr_qty\\\" + curr_qty);\\n System.out.println(\\\"min_qty\\\" + min_qty);\\n System.out.println(\\\"max_qty\\\" + max_qty);\\n System.out.println(\\\"category\\\" + category);\\n System.out.println(\\\"last_time_updated\\\" + last_time_updated);\\n\\n\\n params.put(\\\"item\\\", item);\\n params.put(\\\"curr_qty\\\", curr_qty);\\n params.put(\\\"min_qty\\\", min_qty);\\n params.put(\\\"max_qty\\\", max_qty);\\n params.put(\\\"category\\\", category);\\n params.put(\\\"last_time_updated\\\", last_time_updated);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"66a63eee472052a47f416f5cc5f808b6\",\n \"score\": \"0.4661386\",\n \"text\": \"@Override\\n\\tpublic void onCreate(Bundle savedInstanceState) {\\n\\t\\tsuper.onCreate(savedInstanceState);\\n\\t\\tsetContentView(R.layout.all_games);\\n\\t\\t\\n\\t\\tloginSettings = getSharedPreferences(Login.PREFS_NAME, 0);\\n\\n\\t\\tmineTurnList = new ArrayList<Game>();\\n\\t\\topponentTurnList = new ArrayList<Game>();\\n\\t\\tfinishedGamesList = new ArrayList<Game>();\\n\\n // create our list and custom adapter \\n adapter = new SeparatedListAdapter(this); \\n \\n adapter.addSection(\\\"Your turn\\\",new GameAdapter (this, android.R.layout.activity_list_item, mineTurnList)); \\n adapter.addSection(\\\"Opponents turn\\\", new GameAdapter (this, android.R.layout.activity_list_item, opponentTurnList)); \\n adapter.addSection(\\\"Finished games\\\", new GameAdapter (this, android.R.layout.activity_list_item, finishedGamesList));\\n\\t\\t\\n\\t\\tsetListAdapter(adapter);\\n\\t\\tserviceintent = new Intent(\\\"com.main.service.TimerService\\\");\\n\\t\\tserviceintent.putExtra(TimerService.URL, \\\"http://restserver.herokuapp.com/games/\\\" + Login.getUsername(loginSettings));\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"87f61215d910442e0e2e17305d4573bb\",\n \"score\": \"0.4660418\",\n \"text\": \"protected void processRequest(HttpServletRequest request, HttpServletResponse response)\\n throws ServletException, IOException {\\n response.setContentType(\\\"application/json\\\");\\n\\n String gameNameFromSession = SessionUtils.getGameName(request);\\n GameManager gameManager = ServletUtils.getGameManager(getServletContext());\\n Game currGame = gameManager.getGames().get(gameNameFromSession);\\n\\n HashMap<Integer, HashMap<Integer, SoldierData>> soldierMap = new HashMap<>();\\n\\n for (Player p : currGame.getPlayerList()) {\\n soldierMap.put(p.getPlayerNum(), createSoldierMap(p.getPlayerNum(), gameManager.getGames().get(gameNameFromSession)));\\n }\\n\\n sendDataToClient(response, true, soldierMap);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ff65a40c6faf86e7f8698dd437e4c1eb\",\n \"score\": \"0.46573535\",\n \"text\": \"public GameList() {\\r\\n gameData = new DoublyLinkedList();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d5befde46e8b4588be4cd3649766832\",\n \"score\": \"0.46564278\",\n \"text\": \"void createNewRoom(ServerPlayer serverPlayer, int maxPlayers) throws RoomException;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2bd25745fdc6d7a887ce901e8dfea9ba\",\n \"score\": \"0.46561158\",\n \"text\": \"public void addResponseForAllPlayersInTheSameGameMode(long exclusiveClientID, int gameMode, GameResponse response) {\\n List<String> players = null;\\n if (gameMode == Constants.GAME_TYPE_PVP) {\\n players = getOnlinePlayersByCurrentPlayerLocation(1);\\n } else if (gameMode == Constants.GAME_TYPE_PVE) {\\n players = getOnlinePlayersByCurrentPlayerLocation(2);\\n }\\n\\n if (players != null) {\\n for (String player : players) {\\n GameClient client = getThreadByPlayerUserName(player);\\n if (client != null && client.getId() != exclusiveClientID) {\\n client.addResponseForUpdate(response);\\n } else {\\n System.out.println(\\\"In GameServer. java --- There is a client in playerPositionTracker but his/her thread is not active any longer...\\\");\\n }\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"30b7ccd15a25b8deb46440f7b0561998\",\n \"score\": \"0.46528327\",\n \"text\": \"private void addEvents() {\\n String tag_string_req_events = \\\"req_login_events\\\";\\n\\n\\n Log.d(\\\"TAG\\\", \\\"REGG CLICKED \\\" );\\n\\n\\n StringRequest strReq = new StringRequest(Request.Method.POST,\\n AppConfig.URL_EVENTS, new Response.Listener<String>() {\\n\\n\\n @Override\\n public void onResponse(String response) {\\n Log.d(\\\"TAG\\\", \\\"Login Response: \\\" + response.toString());\\n\\n //response is a html page\\n //if success move to main activity of the app\\n try {\\n\\n //create a login session\\n Toast.makeText(getApplicationContext(),\\n \\\"Successfully Registered\\\", Toast.LENGTH_LONG).show();\\n\\n Intent intent=new Intent(getApplicationContext(),MainActivity.class);\\n intent.putExtra(\\\"position\\\", 2);\\n startActivity(intent);\\n finish();\\n\\n\\n } catch (Exception e) {\\n // JSON error\\n\\n e.printStackTrace();\\n Toast.makeText(getApplicationContext(), \\\"Json error: \\\" + e.getMessage(), Toast.LENGTH_LONG).show();\\n }\\n\\n }\\n }, new Response.ErrorListener() {\\n\\n @Override\\n public void onErrorResponse(VolleyError error) {\\n Toast.makeText(getApplicationContext(),\\n \\\"Successfully Registered\\\", Toast.LENGTH_LONG).show();\\n\\n Intent intent=new Intent(getApplicationContext(),MainActivity.class);\\n intent.putExtra(\\\"position\\\", 2);\\n startActivity(intent);\\n finish();\\n Log.e(\\\"TAG\\\", \\\"Login Error: \\\" + error.getMessage());\\n // Toast.makeText(getApplicationContext(),error.getMessage(), Toast.LENGTH_LONG).show();\\n\\n }\\n }) {\\n\\n @Override\\n protected Map<String, String> getParams() {\\n // Posting parameters to login url\\n Map<String, String> params = new HashMap<String, String>();\\n params.put(\\\"mobile\\\", spval);\\n Log.d(\\\"TAG\\\",\\\"mobile: \\\"+spval);\\n for (int i = 1; i <= EventsArray.array.length; i++) {\\n params.put(\\\"event\\\" + i, EventsArray.array[i-1] +\\\"\\\");\\n Log.d(\\\"TAG\\\",\\\"event\\\"+ i+\\\":\\\"+EventsArray.array[i-1] +\\\"\\\");\\n }\\n return params;\\n }\\n\\n };\\n AppController.getInstance().addToRequestQueue(strReq);\\n\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dcbcb0b11b4ad27dfa26647008c05b1a\",\n \"score\": \"0.46507958\",\n \"text\": \"public StringRequest buildCheckServerRequest(){\\n\\n StringRequest healthRequest = new StringRequest(Request.Method.GET, BlissApiSingleton.BLISS_HEALTH_REQUEST,\\n new Response.Listener<String>() {\\n @Override\\n public void onResponse(String response) {\\n if(response!=null){\\n JSONObject obj = null;\\n try {\\n obj = new JSONObject(response);\\n String status = obj.getString(\\\"status\\\");\\n if(status.equals(\\\"OK\\\")){\\n Log.d(\\\"APP_DEBUG\\\",\\\"[RESPONSE] OK\\\");\\n if(isDeepLink) {\\n processDeepLink();\\n }else\\n setListFragment(null); //null means that we dont need to pass anything onto listfragment (no deeplink)\\n }else{\\n loadFragment.getView().findViewById(R.id.progressBar2).setVisibility(View.INVISIBLE);\\n retryDialog();\\n }\\n } catch (JSONException e) {\\n Toast.makeText(getApplicationContext(),BlissApiSingleton.ERROR_MESSAGE,Toast.LENGTH_SHORT).show();\\n }\\n }else{\\n Toast.makeText(getApplicationContext(),BlissApiSingleton.ERROR_MESSAGE,Toast.LENGTH_SHORT).show();\\n }\\n }\\n }, new Response.ErrorListener() {\\n @Override\\n public void onErrorResponse(VolleyError error) {\\n Toast.makeText(getApplicationContext(),BlissApiSingleton.ERROR_MESSAGE,Toast.LENGTH_SHORT).show();\\n }\\n });\\n\\n return healthRequest;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8fa44b66b47f03057f4d06484e88fcd1\",\n \"score\": \"0.4646403\",\n \"text\": \"private void addMyselfToPlayerList() {\\n \\tString androidId = \\\"?deviceId=\\\" + WillyShmoApplication.getAndroidId(); \\n \\tString latitude = \\\"&latitude=\\\" + WillyShmoApplication.getLatitude();\\n \\tString longitude = \\\"&longitude=\\\" + WillyShmoApplication.getLongitude();\\n \\tString trackingInfo = androidId + latitude + longitude;\\n \\t\\n \\tString url = resources.getString(R.string.domainName) + \\\"/gamePlayer/createAndroid/\\\" + trackingInfo + \\\"&userName=\\\";\\n \\tWebServerInterfaceNewPlayerTask webServerInterfaceNewPlayerTask = new WebServerInterfaceNewPlayerTask();\\n \\tfinal PlayOverNetwork playOverNetwork = this;\\n \\twebServerInterfaceNewPlayerTask.execute(playOverNetwork, url, mPlayer1Name, getApplicationContext(), resources);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c9bcd21e2d2b12e56b90907256b19ff5\",\n \"score\": \"0.46444288\",\n \"text\": \"@Override\\n public void onSuccessResponse(String response) {\\n JSONArray jsonResponse = new JSONArray();\\n try {\\n jsonResponse = new JSONArray(response);\\n } catch (JSONException e) {\\n\\n }\\n\\n list = (ListView) findViewById(R.id.rider_pool_list);\\n\\n backButton = (Button)findViewById(R.id.rider_pool_back_button);\\n\\n backButton.setOnClickListener(new View.OnClickListener() {\\n @Override\\n public void onClick(View v) {\\n RiderPool.super.onBackPressed();\\n }\\n });\\n\\n // Pass results to ListViewAdapter Class\\n adapter = new RiderPoolListAdapter(thisActivity, currentContext, jsonResponse, groupID, request, token);\\n // Binds the Adapter to the ListView\\n list.setAdapter(adapter);\\n // Capture clicks on ListView items\\n list.setOnItemClickListener(new AdapterView.OnItemClickListener() {\\n @Override\\n public void onItemClick(AdapterView<?> parent, View view,\\n int position, long id) {\\n\\n }\\n\\n });\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e1c5664582f07d6861191596190e4b57\",\n \"score\": \"0.4642655\",\n \"text\": \"@Override\\n public Receive createReceive() {\\n return receiveBuilder().match(AdContext.class, adContext -> {\\n Event event = new Event();\\n event.setSessionId(adContext.getSessionId());\\n event.setEventId(adContext.getEventId());\\n event.setDeviceId(adContext.getDeviceId());\\n event.setIpAddress(adContext.getIpAddress());\\n event.setCountry(adContext.getCountry());\\n event.setUserAgent(adContext.getUserAgent());\\n event.setCookie(adContext.getCookieId());\\n event.setTag(adContext.getTag());\\n event.setCreativeId(adContext.getCreativeId());\\n event.setCampaignId(adContext.getCampaignId());\\n event.setAdvertiserId(adContext.getAdvertiserId());\\n event.setAccountId(adContext.getAccountId());\\n event.setCacheBuster(adContext.getCacheBuster());\\n if (adContext.getParams() != null && !adContext.getParams().isEmpty()) {\\n\\n event.setAppBundle(adContext.getParams().get(PARAMS.EXTERNAL_BUNDLE_ID.getName()));\\n event.setSite(adContext.getParams().get(PARAMS.EXTERNAL_SITE_ID.getName()));\\n event.setLatitude(adContext.getParams().get(PARAMS.GPS_LAT.getName()));\\n event.setLongitude(adContext.getParams().get(PARAMS.GPS_LNG.getName()));\\n event.setAppId(adContext.getParams().get(PARAMS.EXTERNAL_APP_ID.getName()));\\n event.setAppName(adContext.getParams().get(PARAMS.EXTERNAL_APP_NAME.getName()));\\n event.setExternalAdServer(adContext.getParams().get(PARAMS.EXTERNAL_AD_SERVER.getName()));\\n event.setExternalPlacementId(\\n adContext.getParams().get(PARAMS.EXTERNAL_PLACEMENT_ID.getName()));\\n event.setExternalCreativeId(\\n adContext.getParams().get(PARAMS.EXTERNAL_CREATIVE_ID.getName()));\\n event.setExternalCampaignId(\\n adContext.getParams().get(PARAMS.EXTERNAL_CAMPAIGN_ID.getName()));\\n event.setBidId(adContext.getParams().get(PARAMS.BID_ID.getName()));\\n }\\n\\n LocalDateTime time = LocalDateTime.now();\\n event.setTimeStamp(new Long(time.format(\\n DateTimeFormatter.ofPattern(GENERAL.SECOND_DATE_FORMAT))));\\n event.setHourTimeDimension(new Long(time.format(\\n DateTimeFormatter.ofPattern(GENERAL.HOUR_DATE_FORMAT))));\\n event.setTagServed(adContext.isTagServed());\\n // get data from AdContext\\n LoggingService.logEvent(JsonService.createJson(event));\\n }).build();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"566fd91d6db41116f419419e33da3e25\",\n \"score\": \"0.46407008\",\n \"text\": \"private void startNewGame() {\\n\\t\\ttry {\\n\\t\\t\\tthis.userName = this.getIntent().getStringExtra(\\n\\t\\t\\t\\t\\tRoom.INTENT_USERNAME);\\n\\t\\t\\tthis.character = this.getIntent().getIntExtra(\\n\\t\\t\\t\\t\\tPersistentBoggleGame.CHARACTER, ROOMMEMBER);\\n\\t\\t\\tthis.letters = this.getIntent()\\n\\t\\t\\t\\t\\t.getStringExtra(PersistentBoggleGame.LETTERS).toCharArray();\\n\\t\\t\\tif (letters.length != mode * mode)\\n\\t\\t\\t\\tthis.letters = bbll.generateWords(mode);\\n\\t\\t\\tthis.existed_words = new LinkedHashSet<String>();\\n\\t\\t\\tthis.score = new Score(0);\\n\\t\\t\\tthis.recLen = getSharedPreferences(\\\"GAME_TIME\\\", MODE_PRIVATE)\\n\\t\\t\\t\\t\\t.getInt(\\\"TIME\\\", GAMETIME);\\n\\t\\t\\t// need to refresh it\\n\\t\\t\\tgetSharedPreferences(\\\"GAME_TIME\\\", MODE_PRIVATE).edit()\\n\\t\\t\\t\\t\\t.putInt(\\\"TIME\\\", GAMETIME).commit();\\n\\t\\t} catch (Exception ex) {\\n\\t\\t\\tString errorMessage = \\\"PersistentBoggleGame Start a New Game failed\\\";\\n\\t\\t\\tSystem.out.println(errorMessage);\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":985397,"cells":{"query_id":{"kind":"string","value":"9464fad79aef09ae07aac681b2a6fd65"},"query":{"kind":"string","value":"Gets the telefoni value for this Anagrafica."},"positive_passages":{"kind":"list like","value":[{"docid":"c5459b2f85de2b6c3403262ec281be8d","score":"0.731603","text":"public it.equitalia.gestorefascicolows.dati.Telefono[] getTelefoni() {\r\n return telefoni;\r\n }","title":""}],"string":"[\n {\n \"docid\": \"c5459b2f85de2b6c3403262ec281be8d\",\n \"score\": \"0.731603\",\n \"text\": \"public it.equitalia.gestorefascicolows.dati.Telefono[] getTelefoni() {\\r\\n return telefoni;\\r\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"0820e5d1ed05aa66404bedc0a12aac4c","score":"0.7445506","text":"public java.lang.String getTelefone() {\r\n return telefone;\r\n }","title":""},{"docid":"a711584a11a1c0e8c4943c8278748d70","score":"0.7327006","text":"public String getTelefone() {\n\n\t\treturn this.telefone;\n\t}","title":""},{"docid":"0225fe60be282009f944631b0b94b9f5","score":"0.72989273","text":"public String getTelefone() {\n return this.telefone;\n }","title":""},{"docid":"a9a57fc17f475ee00ab119cfa8f2e046","score":"0.71987927","text":"public Telefone getTelefone() {\r\n\t\treturn telefone;\r\n\t}","title":""},{"docid":"2c873ebceb5d1b33370ed439a96a2364","score":"0.7089354","text":"public Integer getTelefonoFijo() {\n return telefonoFijo;\n }","title":""},{"docid":"a4ad03c1fee93abddc72af87ba3886f7","score":"0.7030955","text":"public java.lang.String getNumeroTelefone(){\n return localNumeroTelefone;\n }","title":""},{"docid":"d90a33fd69e1b5aadaaaadbf013d4532","score":"0.7000784","text":"public java.lang.CharSequence getTelefone() {\n return telefone;\n }","title":""},{"docid":"80a1b612d8c91185691177a20ab0fbf6","score":"0.69612837","text":"public String getTelefono() {\n\t\treturn telefono;\n\t}","title":""},{"docid":"21f5011b38a323616701895fab18de44","score":"0.69607025","text":"public java.lang.CharSequence getTelefone() {\n return telefone;\n }","title":""},{"docid":"01f892831528eada3de2337912483dc7","score":"0.69059825","text":"public NumeroTelefone getNumeroTelefone(){\n return localNumeroTelefone;\n }","title":""},{"docid":"6bf0464585133b219c2ac3cbe42113a5","score":"0.6904999","text":"public int getNrTelefonu() {\r\n return nrTelefonu;\r\n }","title":""},{"docid":"cf97396307c2bcd3bc5f067f4b8e31c0","score":"0.6882529","text":"public long getTelefono() {\r\n return telefono;\r\n }","title":""},{"docid":"d416fe98a12ad4c96a383c4c76571de2","score":"0.6822896","text":"public String getTelefono() {\n return vista.txttelefono.getText();\n }","title":""},{"docid":"9a2a01ff9959aaffd0a310396d6b24c5","score":"0.68212503","text":"public String getTelefone1() {\r\n\t\treturn telefone1;\r\n\t}","title":""},{"docid":"9a2a01ff9959aaffd0a310396d6b24c5","score":"0.68212503","text":"public String getTelefone1() {\r\n\t\treturn telefone1;\r\n\t}","title":""},{"docid":"2f129c0e51b02f50fbae688ab89a3be5","score":"0.6645847","text":"public String getBrTelefona() {\r\n\t\treturn brTelefona;\r\n\t}","title":""},{"docid":"35986be2c435d5c53117b1ede9bf89b3","score":"0.65876573","text":"public String getTelefono() {\n return telefono;\n }","title":""},{"docid":"35986be2c435d5c53117b1ede9bf89b3","score":"0.65876573","text":"public String getTelefono() {\n return telefono;\n }","title":""},{"docid":"86416936e0a6942904de73c68f4109d8","score":"0.6584974","text":"public ResultadoInsumo getUltimoTelefoneInformado() {\n return localUltimoTelefoneInformado;\n }","title":""},{"docid":"ebbae40bdb206e4c2ff58d3090e34f01","score":"0.65395105","text":"public NumeroTelefone getNumeroLocal(){\n return localNumeroLocal;\n }","title":""},{"docid":"57e6a8e923d579c7eaedc380e2f1fe99","score":"0.6537795","text":"public String getTel() {\r\n return tel;\r\n }","title":""},{"docid":"57e6a8e923d579c7eaedc380e2f1fe99","score":"0.6537795","text":"public String getTel() {\r\n return tel;\r\n }","title":""},{"docid":"57e6a8e923d579c7eaedc380e2f1fe99","score":"0.6537795","text":"public String getTel() {\r\n return tel;\r\n }","title":""},{"docid":"7a33e8ce8d6b96791f177bf82b28ff9b","score":"0.6525745","text":"public String getTel() {\n return tel;\n }","title":""},{"docid":"7a33e8ce8d6b96791f177bf82b28ff9b","score":"0.6525745","text":"public String getTel() {\n return tel;\n }","title":""},{"docid":"7a33e8ce8d6b96791f177bf82b28ff9b","score":"0.6525745","text":"public String getTel() {\n return tel;\n }","title":""},{"docid":"7a33e8ce8d6b96791f177bf82b28ff9b","score":"0.6525745","text":"public String getTel() {\n return tel;\n }","title":""},{"docid":"35fedabb5da1f62448ff15c717e1b311","score":"0.6514245","text":"public String getTelefone2() {\r\n\t\treturn telefone2;\r\n\t}","title":""},{"docid":"35fedabb5da1f62448ff15c717e1b311","score":"0.6514245","text":"public String getTelefone2() {\r\n\t\treturn telefone2;\r\n\t}","title":""},{"docid":"8bce1cac3bb4ef32014608b65b7c51fb","score":"0.64758795","text":"public String getTEL() {\r\n return TEL;\r\n }","title":""},{"docid":"e12646d8c30532986bcdede9c830af1b","score":"0.64743835","text":"public java.lang.String getTel () {\n\t\treturn tel;\n\t}","title":""},{"docid":"e160872ec2e86d8fa909268aa4115862","score":"0.64740676","text":"public java.lang.String getTel () {\r\n\t\treturn tel;\r\n\t}","title":""},{"docid":"a51a543b814ee57dd9323a587f0bb55a","score":"0.64736","text":"public String tel () {\n try {\n return ((DataElement)getValue(\"TEL\")).getData();\n } catch (IndexOutOfBoundsException e) {\n return \"\";\n }\n }","title":""},{"docid":"df3987f4c11b2705ce930e3d06e42418","score":"0.6465226","text":"public String getTel() {\r\n\t\treturn tel;\r\n\t}","title":""},{"docid":"482a59e4f6a56dcd51bcab4d52fbd082","score":"0.64609975","text":"public String getTel() {\n\t\treturn tel;\n\t}","title":""},{"docid":"7d716aa7d650c3ff8ef2cd939d34c143","score":"0.6443364","text":"public int getIdTelefone(){\n\t\treturn idTelefone;\n\t}","title":""},{"docid":"38d1a582ceb7d7beefa772687d674041","score":"0.643351","text":"public String getTelephone() {\n\t\treturn telephone;\n\t}","title":""},{"docid":"38d1a582ceb7d7beefa772687d674041","score":"0.643351","text":"public String getTelephone() {\n\t\treturn telephone;\n\t}","title":""},{"docid":"283c04ee39acfcb369bd9fa1b89643b6","score":"0.6386546","text":"public String getTelephone() {\n return telephone;\n }","title":""},{"docid":"283c04ee39acfcb369bd9fa1b89643b6","score":"0.6386546","text":"public String getTelephone() {\n return telephone;\n }","title":""},{"docid":"7e112e839e74fa8cb6b13455d68b8b12","score":"0.63800216","text":"public java.lang.String getTelephone () {\n\t\treturn telephone;\n\t}","title":""},{"docid":"d76838c951c0ae754c20302a183650e7","score":"0.63798803","text":"public String getTelefono(){//delcaracion de un metodo que retorna un valor de tipo String.\r\n System.out.println(\"Telefono: \" + telefono);//print que imprime el telefono del cliente.\r\n return telefono;//return que retorna un String.\r\n }","title":""},{"docid":"a77a2472624553b7eccc5811941c6699","score":"0.6373228","text":"public Telefone getTelefone(){\n return localTelefone;\n }","title":""},{"docid":"41c8c81a55916cf232e6b89fcc6ef414","score":"0.6294602","text":"public java.lang.String getTelephone() {\n\t\t\tjava.lang.Object ref = telephone_;\n\t\t\tif (ref instanceof java.lang.String) {\n\t\t\t\treturn (java.lang.String) ref;\n\t\t\t} else {\n\t\t\t\tcom.google.protobuf.ByteString bs = (com.google.protobuf.ByteString) ref;\n\t\t\t\tjava.lang.String s = bs.toStringUtf8();\n\t\t\t\ttelephone_ = s;\n\t\t\t\treturn s;\n\t\t\t}\n\t\t}","title":""},{"docid":"a6f3b18969f88f5dce75c7743088624e","score":"0.6288256","text":"public NumeroTelefone getNumeroInternacional(){\n return localNumeroInternacional;\n }","title":""},{"docid":"2db918a3f5140ea5c8598fa0baebe490","score":"0.6277531","text":"public java.lang.String getIdTelefone(){\n return localIdTelefone;\n }","title":""},{"docid":"7b4220499ba5ea9f88c034f8b79cb224","score":"0.62761444","text":"public TipoReferencia getTipoTelefone(){\n return localTipoTelefone;\n }","title":""},{"docid":"8109605c2ade4347dad7847ce77a1baf","score":"0.6266978","text":"public String getTelephoneNumber() {\n return _officeTelephone.getTelephoneNumber();\n }","title":""},{"docid":"d0e59b3e7f8569768ed06cde4cbef0b0","score":"0.6244354","text":"public java.lang.String getTelephone() {\n\t\t\t\tjava.lang.Object ref = telephone_;\n\t\t\t\tif (!(ref instanceof java.lang.String)) {\n\t\t\t\t\tcom.google.protobuf.ByteString bs = (com.google.protobuf.ByteString) ref;\n\t\t\t\t\tjava.lang.String s = bs.toStringUtf8();\n\t\t\t\t\ttelephone_ = s;\n\t\t\t\t\treturn s;\n\t\t\t\t} else {\n\t\t\t\t\treturn (java.lang.String) ref;\n\t\t\t\t}\n\t\t\t}","title":""},{"docid":"01cc7ab86f7d34fb90518ce78abebe3f","score":"0.62380975","text":"public String getTelp() {\n return telp;\n }","title":""},{"docid":"b661eb310b0541df9b2cbbd9bfd30f06","score":"0.62035596","text":"public String getTelephoneNumber()\n\t{\n\t return \"RETORNEI UM VALOR\";\n\t}","title":""},{"docid":"c063909ca963322a3ddcff1d0dd51080","score":"0.61761713","text":"String getTelephone();","title":""},{"docid":"c6fe0f2f1d2c524962444094b936b4ec","score":"0.6158302","text":"public String getNumTelephone() {\n return this.numTelephone;\n }","title":""},{"docid":"5556629481a7e4cf70f5ab3c26153ebc","score":"0.6114119","text":"public Telefone[] getTelefone(){\n return localTelefone;\n }","title":""},{"docid":"81919d61f980c877eb47a2b550a45811","score":"0.6108324","text":"java.lang.String getTelephone();","title":""},{"docid":"f3a7581263b65a938bb090c536eb90a7","score":"0.6106303","text":"public ResultadoInsumo getTelefoneAlternativo() {\n return localTelefoneAlternativo;\n }","title":""},{"docid":"17d6cfa0b4b1ebe0e7d1986e70b97a8c","score":"0.60812956","text":"@Override\n\tpublic int elektrikAkimi() {\n\t\treturn telefon.elektrikAkimi;\n\t}","title":""},{"docid":"1d559b80f7f084303c163c5047a74032","score":"0.6067604","text":"public ResultadoInsumo getTelefoneConsultado() {\n return localTelefoneConsultado;\n }","title":""},{"docid":"b1e2f384b5b0f52e5db5b1ca3e59cc4b","score":"0.6066288","text":"public String getTel1() {\n\t\treturn tel1;\n\t}","title":""},{"docid":"5dcc28abc05767ba3c0589f706f25b8c","score":"0.6058823","text":"public String getUserTelephone() {\n return userTelephone;\n }","title":""},{"docid":"d89259cac6686cb0ec630bb12fcf793a","score":"0.6044108","text":"public String getTelPhone() {\n return telPhone;\n }","title":""},{"docid":"b9bc6c2a2dadd6e69a52cdc03c089f75","score":"0.60266674","text":"public String getTelephoneNumber()\n {\n return telephoneNumber;\n }","title":""},{"docid":"c6be31e5d446e49ac66a2884b332292f","score":"0.60028166","text":"public HBaseColumn<String> telephone() {\r\n return (HBaseColumn<String>) (N.isNullOrEmpty(telephone) ? HBaseColumn.emptyOf(String.class) : telephone.iterator().next());\r\n }","title":""},{"docid":"51e3278263dfb0618b840872d90676eb","score":"0.5994722","text":"public com.google.protobuf.ByteString getTelephoneBytes() {\n\t\t\tjava.lang.Object ref = telephone_;\n\t\t\tif (ref instanceof java.lang.String) {\n\t\t\t\tcom.google.protobuf.ByteString b = com.google.protobuf.ByteString.copyFromUtf8((java.lang.String) ref);\n\t\t\t\ttelephone_ = b;\n\t\t\t\treturn b;\n\t\t\t} else {\n\t\t\t\treturn (com.google.protobuf.ByteString) ref;\n\t\t\t}\n\t\t}","title":""},{"docid":"11f89b3ddc988adbc5a44f7d48ad2894","score":"0.5994526","text":"@Override\n\tpublic IF_Contato getContatoPorTelefone(String telefone) {\n\t\treturn (IF_Contato)this.listaContato.get(telefone);\n\t}","title":""},{"docid":"ba44eff167aebbba314138ed0afdc510","score":"0.59842473","text":"public com.google.protobuf.ByteString getTelephoneBytes() {\n\t\t\t\tjava.lang.Object ref = telephone_;\n\t\t\t\tif (ref instanceof String) {\n\t\t\t\t\tcom.google.protobuf.ByteString b = com.google.protobuf.ByteString\n\t\t\t\t\t\t\t.copyFromUtf8((java.lang.String) ref);\n\t\t\t\t\ttelephone_ = b;\n\t\t\t\t\treturn b;\n\t\t\t\t} else {\n\t\t\t\t\treturn (com.google.protobuf.ByteString) ref;\n\t\t\t\t}\n\t\t\t}","title":""},{"docid":"7380a5dfc82d9fe8d95006bf06c4c557","score":"0.5980449","text":"public String getPhone() {\n\t\treturn telephone;\n\t}","title":""},{"docid":"640126a6aa10590096fbcaf2fb1f224b","score":"0.59677607","text":"public Integer getTeaF() {\r\n return teaF;\r\n }","title":""},{"docid":"d092410176087ceae8aff396c232e55b","score":"0.5960928","text":"public String getTelNumber1() {\n return telNumber1;\n }","title":""},{"docid":"c6669ce6c15aa33aa520dda1069fd315","score":"0.5915048","text":"public String getTelefonoAcompaniante() {\r\n\t\treturn telefonoAcompaniante;\r\n\t}","title":""},{"docid":"675cb5e8410e02148b52f718eeae68cd","score":"0.5876116","text":"public Integer getTelefonoMovil() {\n return telefonoMovil;\n }","title":""},{"docid":"d689dc435dc70fcb552a652c8a09612f","score":"0.5851008","text":"public TelefoneList getTelefones(){\n return localTelefones;\n }","title":""},{"docid":"adf64687aae70e72f09e3b1d9a1eec5b","score":"0.582657","text":"public String getProTel() {\r\n return proTel;\r\n }","title":""},{"docid":"2e3da9c3377010988a385cb107e89bb1","score":"0.58132905","text":"public String getUserTel1() {\n return userTel1;\n }","title":""},{"docid":"3932a298c27f80c225006ec5faa3c0a6","score":"0.57939744","text":"public String getTelephoneNumber();","title":""},{"docid":"d6276e26ed000cef248dbd9aec603271","score":"0.57832766","text":"public String getWORK_TEL() {\r\n return WORK_TEL;\r\n }","title":""},{"docid":"f1c36edab9fe906c4aa940d31de82867","score":"0.5774232","text":"public String getContactTelephone() {\n return contactTelephone;\n }","title":""},{"docid":"61993eb96b8f92d7533cc33267024c46","score":"0.57533926","text":"public Integer getFlightNumber() {\n\t\treturn flightNumber;\n\t}","title":""},{"docid":"07ca3c1507797a5af37154b2b55149d0","score":"0.5738847","text":"public int getTellerNumber()\n\t{\n\treturn this.tellerNumber;\n\t}","title":""},{"docid":"048a447878f0af3372adb16415109d0b","score":"0.5737471","text":"public String getTel2() {\n\t\treturn tel2;\n\t}","title":""},{"docid":"9b37ec2776e5b4c37314134d0cddb2bc","score":"0.5730602","text":"public String getNoTelp() {\r\n return noTelp;\r\n }","title":""},{"docid":"ccefc611c5b5da17f29490d5477bc5bb","score":"0.57193035","text":"public void setTelefoni(it.equitalia.gestorefascicolows.dati.Telefono[] telefoni) {\r\n this.telefoni = telefoni;\r\n }","title":""},{"docid":"04e3b1d32ecadb7073fcd7b63677ae0c","score":"0.5709018","text":"public int getFila() {\r\n\t\treturn fila;\r\n\t}","title":""},{"docid":"c02489889ce88271632bd971e4e21d56","score":"0.5700341","text":"public int getFila() {\n\t\treturn fila;\n\t}","title":""},{"docid":"040396fc7176f282a6357d83a2e2e884","score":"0.56928426","text":"public String getTelepon()\n {\n return telepon;\n }","title":""},{"docid":"8e06fd7e8d9ea5fe050f09bc630b4820","score":"0.56686896","text":"public java.lang.String getNumeroTamFidelidade(){\n return localNumeroTamFidelidade;\n }","title":""},{"docid":"1d98ce698afba7c4e49eb0e50d036aea","score":"0.5667472","text":"public java.lang.String getNumero(){\n return localNumero;\n }","title":""},{"docid":"1d98ce698afba7c4e49eb0e50d036aea","score":"0.5667472","text":"public java.lang.String getNumero(){\n return localNumero;\n }","title":""},{"docid":"b6db6f41f456223b1e20fc3c3a49ba67","score":"0.56474304","text":"public Integer getStudentTel() {\n return studentTel;\n }","title":""},{"docid":"d48678a6c578c9d3d0ca918529f75058","score":"0.56336236","text":"public String getFaxNumber();","title":""},{"docid":"003f4052a8cd4711b4376ba3a2b8f1f8","score":"0.5624887","text":"public Telefone getTelefonePrincipal(){\n return localTelefonePrincipal;\n }","title":""},{"docid":"1c567d5d7820d43ebdef71a7e66c6da6","score":"0.5618418","text":"public String getFax() {\r\n return fax;\r\n }","title":""},{"docid":"1c567d5d7820d43ebdef71a7e66c6da6","score":"0.5618418","text":"public String getFax() {\r\n return fax;\r\n }","title":""},{"docid":"3f48b85a8a60ad94861f47782c5b4609","score":"0.5615534","text":"public String getFlightNo() {\r\n return flightNo;\r\n }","title":""},{"docid":"62321b2d490f3284fea6107224db6735","score":"0.561142","text":"double getPhone(){\n\t\t\n\t\treturn phone;\n\t}","title":""},{"docid":"d09e208c685cbfaa7c42d0692efbb155","score":"0.5594372","text":"com.google.protobuf.ByteString getTelephoneBytes();","title":""},{"docid":"c334a11a7da0e6d644bebe8d474c5d14","score":"0.55754983","text":"public String getFax()\r\n\t{\r\n\t\treturn fax;\r\n\t}","title":""},{"docid":"50ffcc81d2f1a77bb769b37315028b50","score":"0.5567086","text":"public String getFax() {\n return fax;\n }","title":""},{"docid":"50ffcc81d2f1a77bb769b37315028b50","score":"0.5567086","text":"public String getFax() {\n return fax;\n }","title":""},{"docid":"50ffcc81d2f1a77bb769b37315028b50","score":"0.5567086","text":"public String getFax() {\n return fax;\n }","title":""}],"string":"[\n {\n \"docid\": \"0820e5d1ed05aa66404bedc0a12aac4c\",\n \"score\": \"0.7445506\",\n \"text\": \"public java.lang.String getTelefone() {\\r\\n return telefone;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a711584a11a1c0e8c4943c8278748d70\",\n \"score\": \"0.7327006\",\n \"text\": \"public String getTelefone() {\\n\\n\\t\\treturn this.telefone;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0225fe60be282009f944631b0b94b9f5\",\n \"score\": \"0.72989273\",\n \"text\": \"public String getTelefone() {\\n return this.telefone;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a9a57fc17f475ee00ab119cfa8f2e046\",\n \"score\": \"0.71987927\",\n \"text\": \"public Telefone getTelefone() {\\r\\n\\t\\treturn telefone;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c873ebceb5d1b33370ed439a96a2364\",\n \"score\": \"0.7089354\",\n \"text\": \"public Integer getTelefonoFijo() {\\n return telefonoFijo;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a4ad03c1fee93abddc72af87ba3886f7\",\n \"score\": \"0.7030955\",\n \"text\": \"public java.lang.String getNumeroTelefone(){\\n return localNumeroTelefone;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d90a33fd69e1b5aadaaaadbf013d4532\",\n \"score\": \"0.7000784\",\n \"text\": \"public java.lang.CharSequence getTelefone() {\\n return telefone;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"80a1b612d8c91185691177a20ab0fbf6\",\n \"score\": \"0.69612837\",\n \"text\": \"public String getTelefono() {\\n\\t\\treturn telefono;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"21f5011b38a323616701895fab18de44\",\n \"score\": \"0.69607025\",\n \"text\": \"public java.lang.CharSequence getTelefone() {\\n return telefone;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"01f892831528eada3de2337912483dc7\",\n \"score\": \"0.69059825\",\n \"text\": \"public NumeroTelefone getNumeroTelefone(){\\n return localNumeroTelefone;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6bf0464585133b219c2ac3cbe42113a5\",\n \"score\": \"0.6904999\",\n \"text\": \"public int getNrTelefonu() {\\r\\n return nrTelefonu;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cf97396307c2bcd3bc5f067f4b8e31c0\",\n \"score\": \"0.6882529\",\n \"text\": \"public long getTelefono() {\\r\\n return telefono;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d416fe98a12ad4c96a383c4c76571de2\",\n \"score\": \"0.6822896\",\n \"text\": \"public String getTelefono() {\\n return vista.txttelefono.getText();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9a2a01ff9959aaffd0a310396d6b24c5\",\n \"score\": \"0.68212503\",\n \"text\": \"public String getTelefone1() {\\r\\n\\t\\treturn telefone1;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9a2a01ff9959aaffd0a310396d6b24c5\",\n \"score\": \"0.68212503\",\n \"text\": \"public String getTelefone1() {\\r\\n\\t\\treturn telefone1;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2f129c0e51b02f50fbae688ab89a3be5\",\n \"score\": \"0.6645847\",\n \"text\": \"public String getBrTelefona() {\\r\\n\\t\\treturn brTelefona;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"35986be2c435d5c53117b1ede9bf89b3\",\n \"score\": \"0.65876573\",\n \"text\": \"public String getTelefono() {\\n return telefono;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"35986be2c435d5c53117b1ede9bf89b3\",\n \"score\": \"0.65876573\",\n \"text\": \"public String getTelefono() {\\n return telefono;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"86416936e0a6942904de73c68f4109d8\",\n \"score\": \"0.6584974\",\n \"text\": \"public ResultadoInsumo getUltimoTelefoneInformado() {\\n return localUltimoTelefoneInformado;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ebbae40bdb206e4c2ff58d3090e34f01\",\n \"score\": \"0.65395105\",\n \"text\": \"public NumeroTelefone getNumeroLocal(){\\n return localNumeroLocal;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"57e6a8e923d579c7eaedc380e2f1fe99\",\n \"score\": \"0.6537795\",\n \"text\": \"public String getTel() {\\r\\n return tel;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"57e6a8e923d579c7eaedc380e2f1fe99\",\n \"score\": \"0.6537795\",\n \"text\": \"public String getTel() {\\r\\n return tel;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"57e6a8e923d579c7eaedc380e2f1fe99\",\n \"score\": \"0.6537795\",\n \"text\": \"public String getTel() {\\r\\n return tel;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7a33e8ce8d6b96791f177bf82b28ff9b\",\n \"score\": \"0.6525745\",\n \"text\": \"public String getTel() {\\n return tel;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7a33e8ce8d6b96791f177bf82b28ff9b\",\n \"score\": \"0.6525745\",\n \"text\": \"public String getTel() {\\n return tel;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7a33e8ce8d6b96791f177bf82b28ff9b\",\n \"score\": \"0.6525745\",\n \"text\": \"public String getTel() {\\n return tel;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7a33e8ce8d6b96791f177bf82b28ff9b\",\n \"score\": \"0.6525745\",\n \"text\": \"public String getTel() {\\n return tel;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"35fedabb5da1f62448ff15c717e1b311\",\n \"score\": \"0.6514245\",\n \"text\": \"public String getTelefone2() {\\r\\n\\t\\treturn telefone2;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"35fedabb5da1f62448ff15c717e1b311\",\n \"score\": \"0.6514245\",\n \"text\": \"public String getTelefone2() {\\r\\n\\t\\treturn telefone2;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8bce1cac3bb4ef32014608b65b7c51fb\",\n \"score\": \"0.64758795\",\n \"text\": \"public String getTEL() {\\r\\n return TEL;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e12646d8c30532986bcdede9c830af1b\",\n \"score\": \"0.64743835\",\n \"text\": \"public java.lang.String getTel () {\\n\\t\\treturn tel;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e160872ec2e86d8fa909268aa4115862\",\n \"score\": \"0.64740676\",\n \"text\": \"public java.lang.String getTel () {\\r\\n\\t\\treturn tel;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a51a543b814ee57dd9323a587f0bb55a\",\n \"score\": \"0.64736\",\n \"text\": \"public String tel () {\\n try {\\n return ((DataElement)getValue(\\\"TEL\\\")).getData();\\n } catch (IndexOutOfBoundsException e) {\\n return \\\"\\\";\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"df3987f4c11b2705ce930e3d06e42418\",\n \"score\": \"0.6465226\",\n \"text\": \"public String getTel() {\\r\\n\\t\\treturn tel;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"482a59e4f6a56dcd51bcab4d52fbd082\",\n \"score\": \"0.64609975\",\n \"text\": \"public String getTel() {\\n\\t\\treturn tel;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7d716aa7d650c3ff8ef2cd939d34c143\",\n \"score\": \"0.6443364\",\n \"text\": \"public int getIdTelefone(){\\n\\t\\treturn idTelefone;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"38d1a582ceb7d7beefa772687d674041\",\n \"score\": \"0.643351\",\n \"text\": \"public String getTelephone() {\\n\\t\\treturn telephone;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"38d1a582ceb7d7beefa772687d674041\",\n \"score\": \"0.643351\",\n \"text\": \"public String getTelephone() {\\n\\t\\treturn telephone;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"283c04ee39acfcb369bd9fa1b89643b6\",\n \"score\": \"0.6386546\",\n \"text\": \"public String getTelephone() {\\n return telephone;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"283c04ee39acfcb369bd9fa1b89643b6\",\n \"score\": \"0.6386546\",\n \"text\": \"public String getTelephone() {\\n return telephone;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7e112e839e74fa8cb6b13455d68b8b12\",\n \"score\": \"0.63800216\",\n \"text\": \"public java.lang.String getTelephone () {\\n\\t\\treturn telephone;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d76838c951c0ae754c20302a183650e7\",\n \"score\": \"0.63798803\",\n \"text\": \"public String getTelefono(){//delcaracion de un metodo que retorna un valor de tipo String.\\r\\n System.out.println(\\\"Telefono: \\\" + telefono);//print que imprime el telefono del cliente.\\r\\n return telefono;//return que retorna un String.\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a77a2472624553b7eccc5811941c6699\",\n \"score\": \"0.6373228\",\n \"text\": \"public Telefone getTelefone(){\\n return localTelefone;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"41c8c81a55916cf232e6b89fcc6ef414\",\n \"score\": \"0.6294602\",\n \"text\": \"public java.lang.String getTelephone() {\\n\\t\\t\\tjava.lang.Object ref = telephone_;\\n\\t\\t\\tif (ref instanceof java.lang.String) {\\n\\t\\t\\t\\treturn (java.lang.String) ref;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tcom.google.protobuf.ByteString bs = (com.google.protobuf.ByteString) ref;\\n\\t\\t\\t\\tjava.lang.String s = bs.toStringUtf8();\\n\\t\\t\\t\\ttelephone_ = s;\\n\\t\\t\\t\\treturn s;\\n\\t\\t\\t}\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a6f3b18969f88f5dce75c7743088624e\",\n \"score\": \"0.6288256\",\n \"text\": \"public NumeroTelefone getNumeroInternacional(){\\n return localNumeroInternacional;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2db918a3f5140ea5c8598fa0baebe490\",\n \"score\": \"0.6277531\",\n \"text\": \"public java.lang.String getIdTelefone(){\\n return localIdTelefone;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7b4220499ba5ea9f88c034f8b79cb224\",\n \"score\": \"0.62761444\",\n \"text\": \"public TipoReferencia getTipoTelefone(){\\n return localTipoTelefone;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8109605c2ade4347dad7847ce77a1baf\",\n \"score\": \"0.6266978\",\n \"text\": \"public String getTelephoneNumber() {\\n return _officeTelephone.getTelephoneNumber();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d0e59b3e7f8569768ed06cde4cbef0b0\",\n \"score\": \"0.6244354\",\n \"text\": \"public java.lang.String getTelephone() {\\n\\t\\t\\t\\tjava.lang.Object ref = telephone_;\\n\\t\\t\\t\\tif (!(ref instanceof java.lang.String)) {\\n\\t\\t\\t\\t\\tcom.google.protobuf.ByteString bs = (com.google.protobuf.ByteString) ref;\\n\\t\\t\\t\\t\\tjava.lang.String s = bs.toStringUtf8();\\n\\t\\t\\t\\t\\ttelephone_ = s;\\n\\t\\t\\t\\t\\treturn s;\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\treturn (java.lang.String) ref;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"01cc7ab86f7d34fb90518ce78abebe3f\",\n \"score\": \"0.62380975\",\n \"text\": \"public String getTelp() {\\n return telp;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b661eb310b0541df9b2cbbd9bfd30f06\",\n \"score\": \"0.62035596\",\n \"text\": \"public String getTelephoneNumber()\\n\\t{\\n\\t return \\\"RETORNEI UM VALOR\\\";\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c063909ca963322a3ddcff1d0dd51080\",\n \"score\": \"0.61761713\",\n \"text\": \"String getTelephone();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c6fe0f2f1d2c524962444094b936b4ec\",\n \"score\": \"0.6158302\",\n \"text\": \"public String getNumTelephone() {\\n return this.numTelephone;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5556629481a7e4cf70f5ab3c26153ebc\",\n \"score\": \"0.6114119\",\n \"text\": \"public Telefone[] getTelefone(){\\n return localTelefone;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"81919d61f980c877eb47a2b550a45811\",\n \"score\": \"0.6108324\",\n \"text\": \"java.lang.String getTelephone();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f3a7581263b65a938bb090c536eb90a7\",\n \"score\": \"0.6106303\",\n \"text\": \"public ResultadoInsumo getTelefoneAlternativo() {\\n return localTelefoneAlternativo;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"17d6cfa0b4b1ebe0e7d1986e70b97a8c\",\n \"score\": \"0.60812956\",\n \"text\": \"@Override\\n\\tpublic int elektrikAkimi() {\\n\\t\\treturn telefon.elektrikAkimi;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d559b80f7f084303c163c5047a74032\",\n \"score\": \"0.6067604\",\n \"text\": \"public ResultadoInsumo getTelefoneConsultado() {\\n return localTelefoneConsultado;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b1e2f384b5b0f52e5db5b1ca3e59cc4b\",\n \"score\": \"0.6066288\",\n \"text\": \"public String getTel1() {\\n\\t\\treturn tel1;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5dcc28abc05767ba3c0589f706f25b8c\",\n \"score\": \"0.6058823\",\n \"text\": \"public String getUserTelephone() {\\n return userTelephone;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d89259cac6686cb0ec630bb12fcf793a\",\n \"score\": \"0.6044108\",\n \"text\": \"public String getTelPhone() {\\n return telPhone;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b9bc6c2a2dadd6e69a52cdc03c089f75\",\n \"score\": \"0.60266674\",\n \"text\": \"public String getTelephoneNumber()\\n {\\n return telephoneNumber;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c6be31e5d446e49ac66a2884b332292f\",\n \"score\": \"0.60028166\",\n \"text\": \"public HBaseColumn<String> telephone() {\\r\\n return (HBaseColumn<String>) (N.isNullOrEmpty(telephone) ? HBaseColumn.emptyOf(String.class) : telephone.iterator().next());\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"51e3278263dfb0618b840872d90676eb\",\n \"score\": \"0.5994722\",\n \"text\": \"public com.google.protobuf.ByteString getTelephoneBytes() {\\n\\t\\t\\tjava.lang.Object ref = telephone_;\\n\\t\\t\\tif (ref instanceof java.lang.String) {\\n\\t\\t\\t\\tcom.google.protobuf.ByteString b = com.google.protobuf.ByteString.copyFromUtf8((java.lang.String) ref);\\n\\t\\t\\t\\ttelephone_ = b;\\n\\t\\t\\t\\treturn b;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\treturn (com.google.protobuf.ByteString) ref;\\n\\t\\t\\t}\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"11f89b3ddc988adbc5a44f7d48ad2894\",\n \"score\": \"0.5994526\",\n \"text\": \"@Override\\n\\tpublic IF_Contato getContatoPorTelefone(String telefone) {\\n\\t\\treturn (IF_Contato)this.listaContato.get(telefone);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ba44eff167aebbba314138ed0afdc510\",\n \"score\": \"0.59842473\",\n \"text\": \"public com.google.protobuf.ByteString getTelephoneBytes() {\\n\\t\\t\\t\\tjava.lang.Object ref = telephone_;\\n\\t\\t\\t\\tif (ref instanceof String) {\\n\\t\\t\\t\\t\\tcom.google.protobuf.ByteString b = com.google.protobuf.ByteString\\n\\t\\t\\t\\t\\t\\t\\t.copyFromUtf8((java.lang.String) ref);\\n\\t\\t\\t\\t\\ttelephone_ = b;\\n\\t\\t\\t\\t\\treturn b;\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\treturn (com.google.protobuf.ByteString) ref;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7380a5dfc82d9fe8d95006bf06c4c557\",\n \"score\": \"0.5980449\",\n \"text\": \"public String getPhone() {\\n\\t\\treturn telephone;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"640126a6aa10590096fbcaf2fb1f224b\",\n \"score\": \"0.59677607\",\n \"text\": \"public Integer getTeaF() {\\r\\n return teaF;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d092410176087ceae8aff396c232e55b\",\n \"score\": \"0.5960928\",\n \"text\": \"public String getTelNumber1() {\\n return telNumber1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c6669ce6c15aa33aa520dda1069fd315\",\n \"score\": \"0.5915048\",\n \"text\": \"public String getTelefonoAcompaniante() {\\r\\n\\t\\treturn telefonoAcompaniante;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"675cb5e8410e02148b52f718eeae68cd\",\n \"score\": \"0.5876116\",\n \"text\": \"public Integer getTelefonoMovil() {\\n return telefonoMovil;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d689dc435dc70fcb552a652c8a09612f\",\n \"score\": \"0.5851008\",\n \"text\": \"public TelefoneList getTelefones(){\\n return localTelefones;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"adf64687aae70e72f09e3b1d9a1eec5b\",\n \"score\": \"0.582657\",\n \"text\": \"public String getProTel() {\\r\\n return proTel;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2e3da9c3377010988a385cb107e89bb1\",\n \"score\": \"0.58132905\",\n \"text\": \"public String getUserTel1() {\\n return userTel1;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3932a298c27f80c225006ec5faa3c0a6\",\n \"score\": \"0.57939744\",\n \"text\": \"public String getTelephoneNumber();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d6276e26ed000cef248dbd9aec603271\",\n \"score\": \"0.57832766\",\n \"text\": \"public String getWORK_TEL() {\\r\\n return WORK_TEL;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f1c36edab9fe906c4aa940d31de82867\",\n \"score\": \"0.5774232\",\n \"text\": \"public String getContactTelephone() {\\n return contactTelephone;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"61993eb96b8f92d7533cc33267024c46\",\n \"score\": \"0.57533926\",\n \"text\": \"public Integer getFlightNumber() {\\n\\t\\treturn flightNumber;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"07ca3c1507797a5af37154b2b55149d0\",\n \"score\": \"0.5738847\",\n \"text\": \"public int getTellerNumber()\\n\\t{\\n\\treturn this.tellerNumber;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"048a447878f0af3372adb16415109d0b\",\n \"score\": \"0.5737471\",\n \"text\": \"public String getTel2() {\\n\\t\\treturn tel2;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9b37ec2776e5b4c37314134d0cddb2bc\",\n \"score\": \"0.5730602\",\n \"text\": \"public String getNoTelp() {\\r\\n return noTelp;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ccefc611c5b5da17f29490d5477bc5bb\",\n \"score\": \"0.57193035\",\n \"text\": \"public void setTelefoni(it.equitalia.gestorefascicolows.dati.Telefono[] telefoni) {\\r\\n this.telefoni = telefoni;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"04e3b1d32ecadb7073fcd7b63677ae0c\",\n \"score\": \"0.5709018\",\n \"text\": \"public int getFila() {\\r\\n\\t\\treturn fila;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c02489889ce88271632bd971e4e21d56\",\n \"score\": \"0.5700341\",\n \"text\": \"public int getFila() {\\n\\t\\treturn fila;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"040396fc7176f282a6357d83a2e2e884\",\n \"score\": \"0.56928426\",\n \"text\": \"public String getTelepon()\\n {\\n return telepon;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8e06fd7e8d9ea5fe050f09bc630b4820\",\n \"score\": \"0.56686896\",\n \"text\": \"public java.lang.String getNumeroTamFidelidade(){\\n return localNumeroTamFidelidade;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d98ce698afba7c4e49eb0e50d036aea\",\n \"score\": \"0.5667472\",\n \"text\": \"public java.lang.String getNumero(){\\n return localNumero;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1d98ce698afba7c4e49eb0e50d036aea\",\n \"score\": \"0.5667472\",\n \"text\": \"public java.lang.String getNumero(){\\n return localNumero;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b6db6f41f456223b1e20fc3c3a49ba67\",\n \"score\": \"0.56474304\",\n \"text\": \"public Integer getStudentTel() {\\n return studentTel;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d48678a6c578c9d3d0ca918529f75058\",\n \"score\": \"0.56336236\",\n \"text\": \"public String getFaxNumber();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"003f4052a8cd4711b4376ba3a2b8f1f8\",\n \"score\": \"0.5624887\",\n \"text\": \"public Telefone getTelefonePrincipal(){\\n return localTelefonePrincipal;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1c567d5d7820d43ebdef71a7e66c6da6\",\n \"score\": \"0.5618418\",\n \"text\": \"public String getFax() {\\r\\n return fax;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1c567d5d7820d43ebdef71a7e66c6da6\",\n \"score\": \"0.5618418\",\n \"text\": \"public String getFax() {\\r\\n return fax;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3f48b85a8a60ad94861f47782c5b4609\",\n \"score\": \"0.5615534\",\n \"text\": \"public String getFlightNo() {\\r\\n return flightNo;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"62321b2d490f3284fea6107224db6735\",\n \"score\": \"0.561142\",\n \"text\": \"double getPhone(){\\n\\t\\t\\n\\t\\treturn phone;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d09e208c685cbfaa7c42d0692efbb155\",\n \"score\": \"0.5594372\",\n \"text\": \"com.google.protobuf.ByteString getTelephoneBytes();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c334a11a7da0e6d644bebe8d474c5d14\",\n \"score\": \"0.55754983\",\n \"text\": \"public String getFax()\\r\\n\\t{\\r\\n\\t\\treturn fax;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"50ffcc81d2f1a77bb769b37315028b50\",\n \"score\": \"0.5567086\",\n \"text\": \"public String getFax() {\\n return fax;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"50ffcc81d2f1a77bb769b37315028b50\",\n \"score\": \"0.5567086\",\n \"text\": \"public String getFax() {\\n return fax;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"50ffcc81d2f1a77bb769b37315028b50\",\n \"score\": \"0.5567086\",\n \"text\": \"public String getFax() {\\n return fax;\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":985398,"cells":{"query_id":{"kind":"string","value":"18d4ef427aa0dc08cc5a1776e9483e08"},"query":{"kind":"string","value":"Process one operator: Take an operator from operatorStack and apply it on the operands in the operandStack"},"positive_passages":{"kind":"list like","value":[{"docid":"a369261bb3130ec182b66886009099be","score":"0.7823257","text":"public static void processOperator(Stack<Integer> operandStack, Stack<Character> operatorStack){\n char operator = operatorStack.pop();\n int op1 = operandStack.pop();\n int op2 = operandStack.pop();\n\n switch(operator){\n case '+':\n operandStack.push(op2 + op1);\n break;\n\n case '-':\n operandStack.push(op2 - op1);\n break;\n\n case '*':\n operandStack.push(op2 * op1);\n break;\n\n case '/':\n operandStack.push(op2 / op1);\n break;\n\n case '%':\n operandStack.push(op2 % op1);\n break;\n\n case '^':\n operandStack.push((int)Math.pow(op2, op1));\n break;\n\n default:\n throw new IllegalArgumentException(\"Invalid operator: \" + operator);\n }\n\n }","title":""}],"string":"[\n {\n \"docid\": \"a369261bb3130ec182b66886009099be\",\n \"score\": \"0.7823257\",\n \"text\": \"public static void processOperator(Stack<Integer> operandStack, Stack<Character> operatorStack){\\n char operator = operatorStack.pop();\\n int op1 = operandStack.pop();\\n int op2 = operandStack.pop();\\n\\n switch(operator){\\n case '+':\\n operandStack.push(op2 + op1);\\n break;\\n\\n case '-':\\n operandStack.push(op2 - op1);\\n break;\\n\\n case '*':\\n operandStack.push(op2 * op1);\\n break;\\n\\n case '/':\\n operandStack.push(op2 / op1);\\n break;\\n\\n case '%':\\n operandStack.push(op2 % op1);\\n break;\\n\\n case '^':\\n operandStack.push((int)Math.pow(op2, op1));\\n break;\\n\\n default:\\n throw new IllegalArgumentException(\\\"Invalid operator: \\\" + operator);\\n }\\n\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"8b68d52533275aab54b74ad41f2f717c","score":"0.77358043","text":"public static void processAnOperator(\r\n\t\t\tStack<Integer> operandStack, Stack<Character> operatorStack) {\r\n\t\tchar op = operatorStack.pop();\r\n\t\tint op1 = operandStack.pop();\r\n\t\tint op2 = operandStack.pop();\r\n\t\tif (op == '+') \r\n\t\t\toperandStack.push(op2 + op1);\r\n\t\telse if (op == '-') \r\n\t\t\toperandStack.push(op2 - op1);\r\n\t\telse if (op == '*') \r\n\t\t\toperandStack.push(op2 * op1);\r\n\t\telse if (op == '/') \r\n\t\t\toperandStack.push(op2 / op1);\r\n\t\telse if (op == '%') \r\n\t\t\toperandStack.push(op2 % op1);\r\n\t}","title":""},{"docid":"f6f45d626e7271f178baae3cab219bd2","score":"0.75931805","text":"public static void processAnOperator(Stack<Double> operandStack,\n\t\t\tStack<Character> operatorStack) {\n\t\tchar op = operatorStack.pop();\n\t\tdouble op1 = operandStack.pop();\n\t\tdouble op2 = operandStack.pop();\n\t\tif (op == '+')\n\t\t\toperandStack.push(op2 + op1);\n\t\telse if (op == '-')\n\t\t\toperandStack.push(op2 - op1);\n\t\telse if (op == '*')\n\t\t\toperandStack.push(op2 * op1);\n\t\telse if (op == '/')\n\t\t\toperandStack.push(op2 / op1);\n\t}","title":""},{"docid":"2197dacb0fd2180fc420a2d3d85f6789","score":"0.7537531","text":"private void processOperator(char op) {\n if (operatorStack.empty()) {\n operatorStack.push(op);\n } else {\n // Peek the operator stack and\n // let topOp be top operator.\n char topOp = operatorStack.peek();\n if (precedence(op) > precedence(topOp)) {\n operatorStack.push(op);\n } else {\n // Pop all stacked operators with equal\n // or higher precedence than op.\n while (!operatorStack.empty()\n && precedence(op) <= precedence(topOp)) {\n operatorStack.pop();\n postfix.append(topOp);\n postfix.append(' ');\n if (!operatorStack.empty()) {\n // Reset topOp.\n topOp = operatorStack.peek();\n }\n }\n // assert: Operator stack is empty or\n // current operator precedence >\n // top of stack operator precedence.\n operatorStack.push(op);\n }\n }\n }","title":""},{"docid":"44e349bdfe86eb9eb20ef5989b1e857d","score":"0.7238422","text":"static void processOperator(char token) throws StackUnderFlowException\n\t{\n\t\tString topToken = null;\n\t\t\n\t\tif(!converterStack.isEmpty())\n\t\t\ttopToken = converterStack.top();\n\n\t\twhile(!converterStack.isEmpty() && !(topToken.equals(\"(\")) && (precedenceCheck(token,topToken.charAt(0))))\n\t\t{\n\t\t\tconverterStack.pop();\n\t\t\tpostfixExpression += topToken;\n\t\t\ttopToken = converterStack.top();\n\t\t}// end of while loop\n\t\t\n\t\tconverterStack.push(String.valueOf(token));\n\t\t\n\t}","title":""},{"docid":"6df39e1245b654d5ada19d58a575fde4","score":"0.70739573","text":"public static void process()\n {\n char operator = operatorStack.pop();\n //System.out.println(operator);\n double operand1 = operandStack.pop();\n //System.out.println(\"Op 1: \" + operand1);\n double operand2 = operandStack.pop();\n //System.out.println(\"Op 2: \" + operand2);\n \n //checks operation to be performed on 2 operands then performs it and\n //pushes the answer to the top of the operand stack. This keeps a running\n //total to use as more calculations are made\n switch(operator)\n {\n case '+':\n operandStack.push(operand2 + operand1);\n break;\n case '-':\n operandStack.push(operand2 - operand1);\n break;\n case '*':\n operandStack.push(operand2 * operand1);\n break;\n case '/':\n operandStack.push(operand2 / operand1);\n break;\n default: System.out.println(\"Good job, you broke it!\");\n }\n }","title":""},{"docid":"c5850fe08909784c3595c78e46926d8c","score":"0.6727127","text":"public void topEval(Stack<Operator> pOperatorStack, Stack<Operand> pOperandStack){\n Operand right = pOperandStack.pop();\n Operator operator = pOperatorStack.pop();\n\n if(operator instanceof UnaryOperator){\n Operand ret = ((UnaryOperator)operator).evaluate(right);\n pOperandStack.push(ret);\n\n } else {\n Operand left = pOperandStack.pop();\n Operand rez = ((BinaryOperator)operator).evaluate(left, right);\n pOperandStack.push(rez);\n }\n }","title":""},{"docid":"a80d61bf443617bcee7eae3e73183a64","score":"0.6502629","text":"static int evaluate_expression_two_stack(String expr){\r\n stack_resizable_array<Integer> operand_stack = new stack_resizable_array<>();\r\n stack_resizable_array<String> operator_stack = new stack_resizable_array<>();\r\n \r\n String[] tokens = expr.split(\" \");\r\n \r\n for (int i = 0; i < tokens.length; i++) {\r\n String token = tokens[i];\r\n try\r\n {\r\n int operand = Integer.parseInt(token);\r\n operand_stack.push(operand);\r\n }\r\n catch(NumberFormatException nfe)\r\n {\r\n\r\n //operator is found\r\n if( token.equals(\"/\") || token.equals(\"*\") || token.equals(\"+\") || token.equals(\"-\") || token.equals(\")\") ){\r\n \r\n //make sure you perform operation as pop2 _ pop1 and not pop1 _ pop2 because of reversing nature of stack\r\n switch(token){\r\n case \"+\": operator_stack.push(token);\r\n break;\r\n case \"-\": operator_stack.push(token);\r\n break;\r\n case \"*\": operator_stack.push(token);\r\n break; \r\n case \"/\": operator_stack.push(token);\r\n break; \r\n case \")\": int op1 = operand_stack.pop();\r\n int op2 = operand_stack.pop();\r\n int result=0;\r\n String operand=operator_stack.pop();\r\n switch(operand){\r\n case \"+\": result = op2 + op1;\r\n break;\r\n case \"-\": result = op2 - op1;\r\n break;\r\n case \"*\": result = op2 * op1;\r\n break; \r\n case \"/\": result = op2 / op1;\r\n break;\r\n }\r\n operand_stack.push(result);\r\n }\r\n }\r\n }\r\n }\r\n return operand_stack.pop();\r\n }","title":""},{"docid":"01bf037981628832d461c3616c0b7851","score":"0.64559346","text":"private void moveOperatorsInsideParenthesisFromStackToPostfix() {\n while (!this.tokenStack.isEmpty() && this.tokenStack.peek() != Parenthesis.LEFT) {\n moveTopFromStackToPostfix();\n }\n }","title":""},{"docid":"f78b820e5ddde3ab60ee3f23580b637d","score":"0.6373158","text":"public static void cycleThroughStack(Stack<Expression> expStack, Stack<String> opStack, HashMap<String,Integer> precedence, boolean pass){ \n\twhile(!opStack.empty() && !opStack.peek().equals(\"(\") && pass){\n\t String operString = opStack.pop();\n\t Expression term2 = expStack.pop();\n\t Expression term1 = expStack.pop();\n\t Expression oper = null;\n\t if (operString.equals(\"+\")){\n\t\toper = new SumExpression(term1,term2);\n\t\texpStack.push(oper);\n\t }\n\t else if (operString.equals(\"-\")){\n\t\toper = new DifferenceExpression(term1,term2);\n\t\texpStack.push(oper);\n\t }\n\t else if (operString.equals(\"*\")){\n\t\toper = new ProductExpression(term1,term2);\n\t\texpStack.push(oper);\n\t }\n\t else if (operString.equals(\"/\")){\n\t\toper = new QuotientExpression(term1,term2);\n\t\texpStack.push(oper);\n\t }\n\t}\n\tif (!opStack.empty() && opStack.peek().equals(\"(\")){\n\t opStack.pop();\n\t}\n }","title":""},{"docid":"16500c33f68afd8cf97f1eb98890d868","score":"0.6306151","text":"private void moveRemainingOperatorsFromStackToPostfix() {\n while (!this.tokenStack.isEmpty()) {\n if (this.tokenStack.peek() == Parenthesis.LEFT) {\n throw new IllegalArgumentException(\"Invalid expression. Parentheses don't match.\");\n }\n moveTopFromStackToPostfix();\n }\n }","title":""},{"docid":"e0aa38d7f368d754ebd896e5f6f7675c","score":"0.62949985","text":"private void StackDo(Boolean end) {\n \n boolean isAbleToCompute = true;\n //Enough to compare\n while (operators.size() >= 2 && isAbleToCompute) {\n \n boolean lastOper = false;\n if (operands.size() > operators.size()) {\n //use last operator\n lastOper = true;\n } else {\n \n }\n \n Character op2 = operators.pop();\n Character op1 = operators.pop();\n \n \n \n if (hasPrecedence(op1, op2)) {\n \n Double and2 = operands.pop();\n Double and1 = operands.pop();\n if (lastOper) {\n operators.push(op1);\n operands.push(evaluate(op2, and1, and2));\n } else {\n operators.push(op2);\n operands.push(evaluate(op1, and1, and2));\n }\n \n } else if (end) {\n Double and2 = operands.pop();\n Double and1 = operands.pop();\n operands.push(evaluate(op2, and1, and2));\n operators.push(op1);\n } else {\n isAbleToCompute = false;\n operators.push(op1);\n operators.push(op2);\n }\n\n }\n }","title":""},{"docid":"c38b6439ce735055b1c19a49016a449e","score":"0.6287936","text":"public static void main(String[] args) {\n var tokenString = \"4 3 2 - 1 + *\";\n var stack = new Stack<Expression>();\n\n var tokenList = tokenString.split(\" \");\n for (var s : tokenList) {\n if (isOperator(s)) {\n var rightExpression = stack.pop();\n var leftExpression = stack.pop();\n log.info(\"popped from stack left: {} right: {}\", leftExpression.interpret(),\n rightExpression.interpret());\n var operator = getOperatorInstance(s, leftExpression, rightExpression);\n log.info(\"operator: {}\", operator);\n var result = operator.interpret();\n var resultExpression = new NumberExpression(result);\n stack.push(resultExpression);\n log.info(\"push result to stack: {}\", resultExpression.interpret());\n } else {\n var i = new NumberExpression(s);\n stack.push(i);\n log.info(\"push to stack: {}\", i.interpret());\n }\n }\n log.info(\"result: {}\", stack.pop().interpret());\n }","title":""},{"docid":"fd86d58611243ba4663fef5bf6149d7b","score":"0.62771183","text":"@Override\n public void execute() {\n int op2 = stack.pop();\n int op1 = stack.pop();\n stack.push( op1 + op2 );\n }","title":""},{"docid":"71c6500d706652632f2e1de60b78d4ce","score":"0.6253011","text":"public void Nreduce(final ArrayList<Object> stack, final char symbole_op) throws PLFormulaSyntaxError {\n\t\tfor(int i = 0; i < stack.size(); i++) {\n\t\t\t// si ce mot est l'operateur que l'on recherche\n\t\t\tif(stack.get(i).equals(symbole_op)) {\n\t\t\t\ttry {\n\t\t\t\t\tArrayList<PLFormula> operandes = new ArrayList<>();\n\t\t\t\t\t// on recupere ses operandes droite et gauche\n\t\t\t\t\tPLFormula f2 = (PLFormula) stack.remove(i + 1);\n\t\t\t\t\tstack.remove(i);\n\t\t\t\t\tPLFormula f1 = (PLFormula) stack.remove(i - 1);\n\t\t\t\t\toperandes.add(f1);\n\t\t\t\t\toperandes.add(f2);\n\t\t\t\t\t\n\t\t\t\t\t// recherche d'un pattern n-aire (v1 & v2 & v3 & ... & vN)\n\t\t\t\t\twhile(i - 1 < stack.size() && stack.get(i - 1).equals(symbole_op)) {\n\t\t\t\t\t\tPLFormula f3 = (PLFormula) stack.remove(i);\n\t\t\t\t\t\tstack.remove(i - 1);\n\t\t\t\t\t\toperandes.add(f3);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tif(symbole_op == OR_SYMBOL) {\n\t\t\t\t\t\tstack.add(i - 1, new OR(this.li, operandes.toArray(new PLFormula[operandes.size()])));\n\t\t\t\t\t}\n\t\t\t\t\telse if(symbole_op == AND_SYMBOL) {\n\t\t\t\t\t\tstack.add(i - 1, new AND(this.li, operandes.toArray(new PLFormula[operandes.size()])));\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\ti = i - 1;\n\t\t\t\t\tthis.afficherEtat(stack);\n\t\t\t\t}\n\t\t\t\tcatch(Exception e) {\n\t\t\t\t\te.printStackTrace();\n\t\t\t\t\tthrow new PLFormulaSyntaxError(\"Missing operands for \" + symbole_op);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}","title":""},{"docid":"f1242b730c17d64f28c9be96aa260fc0","score":"0.6232406","text":"@Override\n public void execute() {\n int op2 = stack.pop();\n int op1 = stack.pop();\n stack.push( op1 * op2 );\n }","title":""},{"docid":"d7bf9abe928460a6573df397922c8c2a","score":"0.622277","text":"private void getOperands(char op) throws NoSuchElementException \n\t{\n\t\t// TODO \n\t\tif(op=='~') {\n\t\t\tif(operandStack.size()<1) {\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\t}\n\t\t\trightOperand=operandStack.pop();\n\t\t}\n\t\telse if(isOperator(op) && op!='~') {\n\t\t\tif(operandStack.size()<2) {\n\t\t\t\tthrow new NoSuchElementException();\n\t\t\t}\n\t\t\trightOperand=operandStack.pop();\n\t\t\tleftOperand=operandStack.pop();\n\t\t}\n\t}","title":""},{"docid":"16733ca26b9c5ba5d88f012123a02434","score":"0.62140405","text":"private void execute(StackInterface<Object> valStack) {\n\t\t// variables to store the double values\n\t\tArrayStack<Double> operandStack = new ArrayStack<>();\n\t\tDouble tempVal = 0.0;//temp variable to store the expression value\n\t\tString operator = \"\";\n\t\t\n\t\t// return if the value stack is empty\n\t\tif (valStack.isEmpty())\n\t\t\treturn;\n\t\t// pop the opStack\n\t\t\n\t\tObject op = valStack.pop();//pop the doubele value\n\n while ( op instanceof Double ) \n {\n double value = (double) op;\n operandStack.push(value);//if it is a double value push into stack\n op = valStack.pop();//the last one popped will be the operator\n }\n\n operator = op.toString() ;\n\t\t// based on the operator - do the operations\n\t\tswitch (operator) {\n\t\tcase \"+\":\n\t\t\t// temporary variable to store result\n\t\t\ttempVal = 0.0;\n\t\t\twhile (!operandStack.isEmpty())//pop the double values and perform operations\n\t\t\t\ttempVal = tempVal + operandStack.pop();\n\t\t\tbreak;\n\t\tcase \"-\":\n\t\t\t// temporary variable to store result\n\t\t\ttempVal = 0.0;\n\t\t\ttempVal = operandStack.pop();\n\t\t\t//if there is just one value then answer is -a\n if (operandStack.isEmpty()) {\n tempVal = -tempVal;\n }\n else {\n //case 2: there are many numbers\n while(!operandStack.isEmpty()) {//pop the double values and perform operations\n tempVal = tempVal - operandStack.pop();\n }\n \n }\n\t\t\t\n\t\t\n\t\t\tbreak;\n\t\tcase \"*\":\n\t\t\t// temporary variable to store result\n\t\t\ttempVal = 1.0;\n\t\t\twhile (!operandStack.isEmpty())//pop the double values and perform operations\n\t\t\t\ttempVal = tempVal * operandStack.pop();\n\t\t\t\n\t\t\tbreak;\n\t\tcase \"/\":\n\t\t\t// temporary variable to store result\n\t\t\ttempVal = 1.0;\n\t\t\ttempVal = operandStack.pop();\n\t\t\t//if there is just one value answer is 1/a\n\t\t\tif(operandStack.isEmpty())\n\t\t\t{\n\t\t\t\ttempVal = 1/tempVal;\n\t\t\t}\n\t\t\telse\n\t\t\t{//more than 1 value\n\t\t\twhile (!operandStack.isEmpty())//pop the double values and perform operations\n\t\t\t\ttempVal = tempVal / operandStack.pop();\n\t\t\t}\n\t\t\t\n\t\t\tbreak;\n\t\t}\n\t\t// store the result on top of valstack\n\t\t\n\t\tvalStack.push(tempVal);\n\n\t}","title":""},{"docid":"889a237c1e1563be6af91bee2495cdb3","score":"0.616334","text":"public static void processExpression (Token inputToken, TokenReader tr)\n\t{\n\t\tValueStack vStack = new ValueStack();\n\t\tOperatorStack opStack = new OperatorStack();\n\n\t\t/* Loop until the expression reaches its End */\n\t\twhile (inputToken.equalsType(TokenType.EOLN) == false)\n\t\t{\n\t\t\t/* The expression contain a VALUE */\n\t\t\tif (inputToken.equalsType(TokenType.VALUE))\n\t\t\t{\n\t\t\t\t/* make this a debugMode statement */\n\t\t\t\tif(debugMode)\n\t\t\t\t\tSystem.out.print (\"Val: \" + inputToken.getValue() + \", \"); \n\n\t\t\t\t// add code to perform this operation here\n\t\t\t\tvStack.push(inputToken.getValue());\n\t\t\t}\n\n\t\t\t/* The expression contains an OPERATOR */\n\t\t\tif (inputToken.equalsType(TokenType.OPERATOR))\n\t\t \t{\n\t\t\t\t/* make this a debugMode statement */\n\t\t\t\tif(debugMode)\n\t\t\t\tSystem.out.print (\"OP: \" + inputToken.getOperator() + \", \");\n\n\t\t\t\t// add code to perform this operation here\n\t\t\t\tif(inputToken.getOperator() == '(')\n\t\t\t\t\topStack.push('(');\n\n\t\t\t\tif(inputToken.getOperator() == '+' || inputToken.getOperator() == '-')\n\t\t\t\t{\n\t\t\t\t\twhile(!opStack.isEmpty() && (opStack.top() == '+' || opStack.top() == '-' || opStack.top() == '*' || opStack.top() == '/'))\n\t\t\t\t\t\tpopAndEvaluate(opStack, vStack);\n\t\t\t\t\t\n\t\t\t\t\topStack.push(inputToken.getOperator());\n\t\t\t\t}\n\n\t\t\t\tif(inputToken.getOperator() == '*' || inputToken.getOperator() == '/')\n\t\t\t\t{\n\t\t\t\t\twhile(!opStack.isEmpty() && (opStack.top() == '*' || opStack.top() == '/'))\n\t\t\t\t\t\tpopAndEvaluate(opStack, vStack);\n\t\t\t\t\t\t\n\t\t\t\t\topStack.push(inputToken.getOperator());\n\t\t\t\t}\n\n\t\t\t\tif(inputToken.getOperator() == ')')\n\t\t\t\t{\n\t\t\t\t\twhile(!opStack.isEmpty() && opStack.top() != '(')\n\t\t\t\t\t\tpopAndEvaluate(opStack, vStack);\n\t\t\t\t\tif(opStack.isEmpty())\n\t\t\t\t\t\tSystem.out.println(\"Error\");\n\t\t\t\t\telse\n\t\t\t\t\t\topStack.pop();\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t/* get next token from input */\n\t\t inputToken = tr.getNextToken ();\n\t\t} \n\n\t\t/* The expression has reached its end */\n\n\t\t// add code to perform this operation here\n\t\twhile(!opStack.isEmpty())\n\t\t\tpopAndEvaluate(opStack, vStack);\n\t\t\n\t\tSystem.out.print(\"\\n\");\n\t\tSystem.out.println(vStack.topPop());\n\t\t\t\n\t\tif(!vStack.isEmpty())\n\t\t\tSystem.out.println(\"Error\");\n\t}","title":""},{"docid":"3fda9b778928c131243f75d2a2be12f0","score":"0.6149172","text":"private void movePreviousOperatorsFromStackToPostfix(Operator currentOperator) {\n while (!this.tokenStack.isEmpty() && this.tokenStack.peek() != Parenthesis.LEFT) {\n Operator prevOperator = (Operator) this.tokenStack.peek();\n if (currentOperator.hasLowerPrecedence(prevOperator)\n || (currentOperator.hasEqualPrecedence(prevOperator) && prevOperator.hasLeftAssociativity())) {\n moveTopFromStackToPostfix();\n } else {\n return;\n }\n }\n }","title":""},{"docid":"b21d18a8f918263993ee1f57a49da4ce","score":"0.610652","text":"private static int evaluateExpression(String expression) {\r\n\t\t//first create 2 stack to save operands and operators\r\n\t\tStack<Integer> operandStack = new Stack<>();\r\n\t\tStack<Character> operatorStack = new Stack<>();\r\n\t\t\r\n\t\t//we cannot easily distinguish operators and operands just by operating string\r\n\t\texpression = insertBlanks(expression);\r\n\t\tString[] tokens = expression.split(\" \");\r\n\t\t\r\n\t\tfor ( int i = 0 ; i < tokens.length ; i ++)\r\n\t\t\tSystem.out.print(tokens[i]+\" \");\r\n\t\t\r\n\t\tfor( String token : tokens) {\r\n\t\t\tif ( token.length()==0 || token.charAt(0)==' ') {\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\telse if ( (token.trim().charAt(0) =='+' ||token.trim().charAt(0)=='-') && operandStack.size() > 1 ) {\r\n\t\t\t\tif ( operatorStack.peek() == '+' || operatorStack.peek() == '-') {\r\n\t\t\t\t\tprocessAnOperator(operandStack,operatorStack);\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\twhile ( !operatorStack.isEmpty() && (operatorStack.peek() == '+'||\r\n\t\t\t\t\t\toperatorStack.peek()=='-'||operatorStack.peek()=='*'||operatorStack.peek()=='/')) {\r\n\t\t\t\t\tprocessAnOperator(operandStack,operatorStack);\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\toperatorStack.push(token.charAt(0));\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\telse if ( token.trim().charAt(0) == '/' ||token.trim().charAt(0) == '*') {\r\n\t\t\t\twhile ( !operatorStack.isEmpty() &&( operatorStack.peek()=='*'||\r\n\t\t\t\t\t\toperatorStack.peek()=='/')){\r\n\t\t\t\t\t\t\tprocessAnOperator(operandStack,operatorStack);\r\n\t\t\t\t\t\t} \r\n\t\t\t\t\r\n\t\t\t\toperatorStack.push(token.charAt(0));\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t\r\n\t\t\t//******\r\n\t\t\telse if ( token.trim().charAt(0) ==')') {\r\n\t\t\t\twhile ( operatorStack.peek() != '(') {\r\n\t\t\t\t\tprocessAnOperator(operandStack,operatorStack);\r\n\t\t\t\t}\r\n\t\t\t\toperatorStack.pop();\r\n\t\t\t}\r\n\t\t\t\r\n\t\t\t//if Integer, convert it and push it in the number stack\r\n\t\t\telse {\r\n\t\t\t\tSystem.out.println(\"line 66 \"+ token.charAt(0));\r\n\t\t\t\toperandStack.push(Integer.parseInt(token.charAt(0)+\"\")); \r\n\t\t\t}\r\n\t\t} \r\n\t\t\r\n\t\twhile ( !operatorStack.isEmpty()) {\r\n\t\t\tprocessAnOperator(operandStack,operatorStack);\r\n\t\t}\r\n\t\t\r\n\t\treturn operandStack.pop();\r\n\t\t\r\n\t\t\r\n\t}","title":""},{"docid":"0f7f2311ba34c3c3b01ecd0c15678f25","score":"0.6098167","text":"private static CompoundExpression parseOperator(String str, char operator, Function<String, Expression> parseLeftSubexpression, Function<String, Expression> parseRightSubexpression)\n\t{\t\t\n\t\tfor(int i = 1; i < str.length() - 1; i++)\n\t\t{\n\t\t\tif(str.charAt(i) == operator)\n\t\t\t{\n\t\t\t\tExpression leftSubexpression = parseLeftSubexpression.apply(str.substring(0, i));\n\t\t\t\tExpression rightSubexpression = parseRightSubexpression.apply(str.substring(i + 1));\n\t\t\t\tif(leftSubexpression != null && rightSubexpression != null)\n\t\t\t\t{\n\t\t\t\t\tCompoundExpression compoundExpression = new CompoundExpressionNode(\"\" + operator);\n\t\t\t\t\tcompoundExpression.addSubexpression(leftSubexpression);\n\t\t\t\t\tleftSubexpression.setParent(compoundExpression);\n\t\t\t\t\t((HBox)compoundExpression.getNode()).getChildren().add(0, leftSubexpression.getNode());\n\t\t\t\t\tcompoundExpression.addSubexpression(rightSubexpression);\n\t\t\t\t\trightSubexpression.setParent(compoundExpression);\n\t\t\t\t\t((HBox)compoundExpression.getNode()).getChildren().add(rightSubexpression.getNode());\n\t\t\t\t\treturn compoundExpression;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn null;\n\t}","title":""},{"docid":"c154172c0901a1ffc03f0bfbafd29728","score":"0.6080868","text":"private void doOperation(BinaryOperator operator) {\n int op1 = Integer.parseInt(num1.getText().toString());\n int op2 = Integer.parseInt(num2.getText().toString());\n result.setText(String.valueOf(operator.operate(op1, op2)));\n operator.printOperands(op1, op2);\n }","title":""},{"docid":"20061e8eaf11fb1eb7b289b4bc569b8a","score":"0.6044436","text":"Operator getOperator();","title":""},{"docid":"4a6ded8dbc60e8d2584a6fa80821b8ee","score":"0.59611","text":"private void pop(Stack<String> operators, Stack<ExpressionTree> operands, boolean sawParen) {\r\n do {\r\n String operator = operators.pop();\r\n \r\n //Stop looping if we see a '('\r\n if(operator.charAt(0) == '(')\r\n return;\r\n \r\n //Get the peices to be merged together\r\n ExpressionTree rightItem = operands.pop();\r\n ExpressionTree leftItem = null;\r\n \r\n //If it's not a ! pop another thing off\r\n if(operator.charAt(0) != '!') {\r\n leftItem = operands.pop();\r\n }\r\n //Put the merged tree back onto the operands stack\r\n //Standard case\r\n if(leftItem != null) {\r\n operands.push(new ExpressionTree(new Node(leftItem.root, operator, rightItem.root)));\r\n // it must be a ! case \r\n } else {\r\n operands.push(new ExpressionTree(new Node(null, operator, rightItem.root)));\r\n }\r\n } while (sawParen);\r\n \r\n }","title":""},{"docid":"dab3ff54f38daaacd0d9a5f1c6bc0d23","score":"0.58713204","text":"private void checkOperator() {\n// String input=\"123\";\n// String[] inputArray=input.split(\"\");\n// Stack<String> stack=new Stack<String>();\n// stack.push(\"\");\n//\n//\n// stack.pop();\n\n\n }","title":""},{"docid":"36a7962fee7cec076982249d9184bb68","score":"0.58608687","text":"@Override\n public Object visit(Arithmetic arithmetic, Object o) {\n arithmetic.getLeftExpression().accept(this, o);\n codeGenerator.convert(arithmetic.getLeftExpression().getType(), arithmetic.getType());\n arithmetic.getRightExpression().accept(this, o);\n codeGenerator.convert(arithmetic.getRightExpression().getType(), arithmetic.getType());\n\n codeGenerator.arithmetic(arithmetic.getOperator(), arithmetic.getType());\n return null;\n }","title":""},{"docid":"b8f8935d014eb116cfab39daadcf9c21","score":"0.5830197","text":"private static char getOperator(LinkedList<Character> queue) { \n if (queue.isEmpty())\n throw new IllegalStateException(\"Too little input.\");\n while (queue.getFirst() == ' ')\n queue.removeFirst(); // remove any empty space\n \n char op = queue.removeFirst(); // get the operator\n if (op == '*' || op == '-' || op == '+')\n return op;\n else\n throw new IllegalArgumentException(\"Wrong operator.\");\n }","title":""},{"docid":"184ef8d37943dc6086f25afbb47565bb","score":"0.5829129","text":"public void execute(OperationsStack stack) {\n\t\tDouble value1 = stack.pop();\n\t\t\n\t\tDouble value2 = stack.pop();\n\t\tBinaryValues binaryValues = new BinaryValues(value2, value1);\n\t\tstack.push(calculate(binaryValues));\n\t}","title":""},{"docid":"7459882b251cc598a184b276f6fae9af","score":"0.5809052","text":"private void nextOp() {\n\t\tint old=pos;\n\t\tpos=old+2;\n\t\tif (!done()) {\n\t\t\tString lexeme=program.substring(old,pos);\n\t\t\tif (operators.contains(lexeme)) {\n\t\t\t\ttoken=new Token(lexeme);\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\tpos=old+1;\n\t\tString lexeme=program.substring(old,pos);\n\t\ttoken=new Token(lexeme);\n\t}","title":""},{"docid":"382e55f65c8dc0e962aeee4dbddb70b3","score":"0.5803882","text":"public void visit(UnaryOperator n);","title":""},{"docid":"57bc9153b6505f90f32217742985ee1e","score":"0.57823086","text":"@Override\n public void execute() {\n int op2 = stack.pop();\n int op1 = stack.pop();\n stack.push( op1 - op2 );\n }","title":""},{"docid":"81075d4836fe8c47ad30e2d3b95609eb","score":"0.5781201","text":"@Override\n public void execute() {\n int op1 = stack.pop();\n int n = -op1;\n stack.push(n);\n }","title":""},{"docid":"d1e297935314758e444a4efa0fb12a87","score":"0.5772797","text":"public Expression getOperatorExpression(OperatorType operator) throws IllegalArgumentException;","title":""},{"docid":"63e28dc410175338f7e7ff9f38c5464c","score":"0.57471937","text":"private void evaluate() {\n\t\t// arraystack and linkedstack to store the operators and values\n\t\t// respectively\n\n\t\tArrayStack<Object> valStack = new ArrayStack<>();\n\t\t// for each token do the following\n\t\tfor (String temp : tokens) {\n\t\t\t// check if token is an operator\n\t\t\tif (operatorCheck(temp)) \n\t\t\t\tvalStack.push(temp);\n\t\t\t // if the token is an open bracket continue\n\t\t\telse if (temp.equals(\"(\"))\n\t\t\t\tcontinue;\n\t\t\telse if (temp.equals(\")\")) {// if the token is closed bracket\n\t\t\t\t// then pop the stack and evaluate\n\t\t\t\t\texecute(valStack);\n\t\t\t\t\n\t\t\t} else // if the token is a value - convert it into double and push\n\t\t\t\t\t// into valstack\n\t\t\t{\n\t\t\t\tDouble val = Double.parseDouble(temp);\n\t\t\t\tvalStack.push(val);\n\n\t\t\t}\n\n\t\t}\n\t\t// while the opstack is not empty- execute the operations on the values\n\t\twhile (!valStack.isEmpty()) {\n\t\t\tif (valStack.size() == 1)// if the valstack size is 1- pop the result\n\t\t\t{\n\t\t\t\tresult = (double) valStack.pop();\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t//else continue operations\n\t\t\texecute(valStack);\n\t\t\n\t\t\n\t\t}\n\t}","title":""},{"docid":"4c79ce6f68bef899b54f2505ecc99a1a","score":"0.57435787","text":"public abstract Expression getPreviousOperator();","title":""},{"docid":"c03e0dd184f78548feffb73994391e42","score":"0.5735572","text":"OperatorExpression createOperatorExpression();","title":""},{"docid":"44f4179b1653a748390ef34d167ad92e","score":"0.5727163","text":"public void doConversion() {\n\t\t// TODO: read infix from input using readInfix(), then convert it to\n\t\t// postfix and print it out\n\t\tString[] infix = readInfix();\n\n\t\tString[] postfix = new String[infix.length];\n\t\tStack stack = new Stack(infix.length);\n\t\t\n\t\tfor (int i = 0; i < infix.length; i++) {\n\t\t\tSystem.out.println(infix[i]);\n\n\t\t\tif (infix[i].equals(\"(\")) {\n\t\t\t\tString operator = infix[i];\n\t\t\t\tstack.push(operator);\n\t\t\t} else if (infix[i].equals(\")\")) {\n\t\t\t\tfor (int j = Stack.getTop(); Stack.list[j].equals(\"(\"); j--)\n\t\t\t\t\tpostfix[postfix.length + 1] = stack.list[Stack.getTop()];\n\t\t\t\tstack.pop();\n\t\t\t} else if (infix[i].equals(\"+\") || infix[i].equals(\"-\") || infix[i].equals(\"*\") || infix[i].equals(\"/\")\n\t\t\t\t\t|| infix[i].equals(\"^\")) {\n\t\t\t\tString operator = infix[i];\n\n\t\t\t\tif (stack.isEmpty()) {\n\t\t\t\t\tstack.push(operator);\n\t\t\t\t} else if (i == infix.length - 1) {\n\t\t\t\t\tpostfix[postfix.length + 1] = stack.list[Stack.getTop()];\n\t\t\t\t\tstack.pop();\n\t\t\t\t} else {\n\t\t\t\t\tif (precedence(operator) > precedence(stack.list[Stack.getTop()])) {\n\t\t\t\t\t\tstack.push(operator);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tpostfix[postfix.length + 1] = stack.list[Stack.getTop()];\n\t\t\t\t\t\tstack.pop();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tpostfix[i] = infix[i];\n\t\t\t}\n\n\t\t}\n\t\tfor (int j = 0; j < postfix.length; j++) {\n\t\t\tSystem.out.println(postfix[j]);\n\t\t}\n\t}","title":""},{"docid":"27b1771808f8606b7c81a28c1d3d15ef","score":"0.5716489","text":"public final MeteorParser.operatorExpression_return operatorExpression() throws RecognitionException {\n MeteorParser.operatorExpression_return retval = new MeteorParser.operatorExpression_return();\n retval.start = input.LT(1);\n\n\n EvaluationExpression root_0 = null;\n\n MeteorParser.operator_return op =null;\n\n\n RewriteRuleSubtreeStream stream_operator=new RewriteRuleSubtreeStream(adaptor,\"rule operator\");\n try {\n // /home/arv/workspace/ozone-meteor/meteor/meteor-meteor/src/main/java/eu/stratosphere/meteor/Meteor.g:217:2: (op= operator -> ^( EXPRESSION[\\\"NestedOperatorExpression\\\"] ) )\n // /home/arv/workspace/ozone-meteor/meteor/meteor-meteor/src/main/java/eu/stratosphere/meteor/Meteor.g:217:4: op= operator\n {\n pushFollow(FOLLOW_operator_in_operatorExpression1564);\n op=operator();\n\n state._fsp--;\n if (state.failed) return retval;\n if ( state.backtracking==0 ) stream_operator.add(op.getTree());\n\n // AST REWRITE\n // elements: \n // token labels: \n // rule labels: retval\n // token list labels: \n // rule list labels: \n // wildcard labels: \n if ( state.backtracking==0 ) {\n\n retval.tree = root_0;\n RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,\"rule retval\",retval!=null?retval.tree:null);\n\n root_0 = (EvaluationExpression)adaptor.nil();\n // 217:16: -> ^( EXPRESSION[\\\"NestedOperatorExpression\\\"] )\n {\n // /home/arv/workspace/ozone-meteor/meteor/meteor-meteor/src/main/java/eu/stratosphere/meteor/Meteor.g:217:19: ^( EXPRESSION[\\\"NestedOperatorExpression\\\"] )\n {\n EvaluationExpression root_1 = (EvaluationExpression)adaptor.nil();\n root_1 = (EvaluationExpression)adaptor.becomeRoot(\n (EvaluationExpression)adaptor.create(EXPRESSION, \"NestedOperatorExpression\")\n , root_1);\n\n adaptor.addChild(root_1, (op!=null?op.op:null) );\n\n adaptor.addChild(root_0, root_1);\n }\n\n }\n\n\n retval.tree = root_0;\n }\n\n }\n\n retval.stop = input.LT(-1);\n\n\n if ( state.backtracking==0 ) {\n\n retval.tree = (EvaluationExpression)adaptor.rulePostProcessing(root_0);\n adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);\n }\n }\n\n catch (RecognitionException e) {\n throw e;\n }\n\n finally {\n \t// do for sure before leaving\n }\n return retval;\n }","title":""},{"docid":"7a3e5f91218e33a0e8a2e592a600edf8","score":"0.5715942","text":"public void expr() {\r\n\t\tfactor();\r\n\t\twhile (addop()) {\r\n\t\t\tlexer.nextToken();\r\n\t\t\tfactor();\r\n\t\t}\r\n\t\t/*if (!addop() && !compop() && lexer.token != Symbol.RPAR)\r\n\t\t\terror.signal(\"Operador não suportado, esperava + ou -\");*/\r\n\t}","title":""},{"docid":"2eb7de814ff245ea2fb3a8ee663c8c3e","score":"0.5705558","text":"private void getOperands() throws NoSuchElementException \n\t{\n\t\tif(operandStack.size() < 2) throw new NoSuchElementException(); \n\t\trightOperand = operandStack.pop(); \n\t\tleftOperand = operandStack.pop(); \n\t}","title":""},{"docid":"094486b4b62053ea18b0ba48d9bb82bf","score":"0.56861866","text":"private static String doOperation(String lhs, char operator, String rhs) {\n try {\n BigDecimal bdLhs = new BigDecimal(lhs);\n BigDecimal bdRhs = new BigDecimal(rhs);\n switch(operator) {\n case '^':\n return \"\" + Math.pow(bdLhs.doubleValue(), bdRhs.doubleValue());\n case '*':\n return \"\" + bdLhs.multiply(bdRhs).toString();\n case '/':\n return \"\" + bdLhs.divide(bdRhs, MC).toString();\n case '+':\n return \"\" + bdLhs.add(bdRhs).toString();\n case '%':\n return \"\" + bdLhs.remainder(bdRhs).toString();\n default:\n return \"\";\n }\n } catch(NumberFormatException e) {\n infinityFlag = true; // infinity or NaN\n return \"\";\n }\n }","title":""},{"docid":"bedf0916cdf6c65dcbad5700dc50adaf","score":"0.5677859","text":"public void setOperator(String operator) {\r\n this.operator = operator;\r\n }","title":""},{"docid":"ca06e526a69cc2ebe21c70578cf788ea","score":"0.56772166","text":"public Expression(String operator) {\n this.operator = operator;\n operands = new ArrayList<Object>(3);\n }","title":""},{"docid":"5abeb31e6c732bcdbf5191fd109faac6","score":"0.5675935","text":"public static void evaluate(String token){\n if (isExclamation(token)){\n evaluateExclamation(token);\n }\n try{\n int top = stack.pop();\n switch (token){\n case \"+\":\n int next = stack.pop();\n stack.push(next+top);\n break;\n case \"-\":\n next = stack.pop();\n stack.push(next-top);\n break;\n case \"*\":\n next = stack.pop();\n stack.push(next*top);\n break;\n case \"%\":\n next = stack.pop();\n stack.push(next%top);\n break;\n case \"/\":\n next = stack.pop();\n stack.push(next/top);\n break;\n case \"o\":\n next = stack.pop(); \n System.out.print(top + \" \");\n stack.push(next);\n stack.push(top);\n break;\n case \"d\":\n stack.push(top);\n stack.push(top);\n break;\n case \"c\":\n if (top < 0){\n System.out.println(\"Error: negative copy\");\n stack.removeAllElements();\n }else{\n next = stack.pop();\n for (int i = 0; i < top; i++){\n stack.push(next);\n }\n }\n break;\n case \"r\":\n stack.push(top);\n evaluateRoll();\n break;\n case \"(\":\n stack.push(top);\n evaluateParentheses();\n break;\n }\n if (!arrayRep.isEmpty()){\n if (isExclamation(arrayRep.get(index-1))){\n stack.push(top);\n }\n }\n }catch (EmptyStackException e){\n System.out.println(\"Error: too few operands\");\n }catch (ArithmeticException e){\n System.out.println(\"Error: division by 0\");\n }\n }","title":""},{"docid":"e5c6add34983971f472034d7c516e7d5","score":"0.5669196","text":"public void setOperator(String operator) {\n this.operator = operator;\n }","title":""},{"docid":"e5c6add34983971f472034d7c516e7d5","score":"0.5669196","text":"public void setOperator(String operator) {\n this.operator = operator;\n }","title":""},{"docid":"7dd071f66e44d34f7d12acd983c8d9e3","score":"0.5666978","text":"private void build(Operator operator)\n {\n assert m_plan != null;\n operator.accept(this);\n }","title":""},{"docid":"a19f5826c1c8f254af58e1d6085250e0","score":"0.56664455","text":"public Object getOperand();","title":""},{"docid":"adb26db1a51168598ea26a262305f855","score":"0.56560177","text":"private Expression parseExpressionWithPrecedenceClimbing(int minPrecedence) {\n Expression result = parseUnaryExpression();\n while (isCurrentTokenBinaryOperator()\n && isOperatorPrecedenceGreaterOrEqualThan(minPrecedence)) {\n Expression.BinOp operator = getBinaryOperator(currentToken);\n int precedence = currentToken.precedence();\n if (currentToken.associativity() == LEFT) {\n precedence++;\n }\n consumeToken();\n Expression rhs = parseExpressionWithPrecedenceClimbing(precedence);\n SourcePosition begin = result.range().begin;\n SourcePosition end = rhs.range().end;\n result = new Expression.BinaryOperator(operator, result, rhs, new SourceRange(begin, end));\n }\n return result;\n }","title":""},{"docid":"ac86274ef9b94d30a7c705b58d5f829b","score":"0.56553835","text":"private static int computeBinaryOperator(int op1,String operator,int op2){\n\t\t\n\t\tswitch(operator){\n\t\t\n\t\tcase \"+\":\n\t\t\treturn op1+op2;\n\t\tcase \"-\":\n\t\t\treturn op1-op2;\n\t\tcase \"*\":\n\t\t\treturn op1*op2;\n\t\tcase \"div\":\n\t\t\treturn op1/op2;\n\t\tdefault:\n\t\t\treturn 0;\n\t\t}\n\t}","title":""},{"docid":"198168e85b0a78865cdc0258a2cd1a71","score":"0.56544155","text":"void evaluation(List<String> postfix){\n\t\t// stack is used to store the operands\n\t\tStack<String> s = new Stack<>();\n\n\t\tfor(int i = 0;i<postfix.size();i++){\n\t\t\tString c = postfix.get(i);\n\n\t\t\tif(isOperator(c)){\n\t\t\t\tif(s.size()>1){\n\t\t\t\t\tint operand2 = Integer.parseInt(s.pop());\n\t\t\t\t\tint operand1 = Integer.parseInt(s.pop());\n\t\t\t\t\ts.push(String.valueOf(getResult(operand1, operand2, c)));\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\ts.push(c);\n\t\t\t}\n\t\t\tlogTrace(c, s, i);\n\t\t}\n\t\t\n\t\tif(s.size() == 1){\n\t\t\tSystem.out.println(s.pop());\n\t\t}\n\t}","title":""},{"docid":"87680ef8d8af66d78558c14aabe3ca69","score":"0.5647028","text":"private Expression parsePostfixOp(Expression lhs) {\n switch (currentToken.terminal) {\n case PERIOD:\n return parseDotIdentFieldAccessMethodInvocation(lhs);\n case LBRACK:\n return parseArrayAccess(lhs);\n default:\n return unexpectCurrentToken(PERIOD, LBRACK);\n }\n }","title":""},{"docid":"addc4706b0358c63de56d3cd3dbd00ea","score":"0.5646621","text":"private int getPrecedence(String operator) {\r\n\t\tswitch (operator) {\r\n\t\tcase \"!\":\r\n\t\t\treturn 1;\r\n\t\tcase \"*\":\r\n\t\tcase \"/\":\r\n\t\t\treturn 2;\r\n\t\tcase \"+\":\r\n\t\tcase \"-\":\r\n\t\t\treturn 3;\r\n\t\tcase \"<\":\r\n\t\tcase \">\":\r\n\t\tcase \"<=\":\r\n\t\tcase \">=\":\r\n\t\t\treturn 4;\r\n\t\tcase \"==\":\r\n\t\tcase \"!=\":\r\n\t\t\treturn 5;\r\n\t\tcase \"&&\":\r\n\t\t\treturn 6;\r\n\t\tcase \"||\":\r\n\t\t\treturn 7;\r\n\t\tdefault:\r\n\t\t\treturn -1;\r\n\t\t}\r\n\t}","title":""},{"docid":"75049ff65529242bfdc3636d0ce51535","score":"0.56441635","text":"private String getOp()\n {\n switch (getTokenAndAdvance()) {\n case \"+\":\n return \"add\";\n case \"-\":\n return \"sub\";\n case \"*\":\n return \"call Math.multiply 2\";\n case \"/\":\n return \"call Math.divide 2\";\n case \"&\":\n return \"and\";\n case \"|\":\n return \"or\";\n case \"<\":\n return \"lt\";\n case \">\":\n return \"gt\";\n case \"=\":\n return \"eq\";\n default:\n throw new IllegalArgumentException(\"Operator not found. \" + currentInputLine);\n }\n }","title":""},{"docid":"f23ea519f44a3c954f289a3e0756e966","score":"0.56422454","text":"static int postfixEvaluator(String postfixExpression) throws OverFlowException, StackUnderFlowException \n\t{\n\t\t// stack stores the ints in the order they are received and after operations are performed \n\t\tLLStack<Long> stack = new LLStack<Long>();\n\t\t\n\t\t// stores the value of the next integer\n\t\t long value;\n\t\t // stores the next operator\n\t\t String operator;\n\t\t \n\t\t // stores operands 1 and 2\n\t\t long operand1 = 0;\n\t\t long operand2 = 0;\n\t\t \n\t\t //stores the result of a operation\n\t\t long result = 0;\n\t\t \n\t\t // initialize the scanner to scan the postfix expression being evaluated\n\t\t Scanner tokenizer = new Scanner(postfixExpression);\n\t\t \n\t\t //while loop runs until there are no more tokens\n\t\t while (tokenizer.hasNext())\n\t\t {\n\t\t\t// Process operand\n\t\t if (tokenizer.hasNextInt())\n\t\t {\n\t\t value = tokenizer.nextInt();\n\t\t \n\t\t stack.push(value);\n\t\t }\n\t\t // Process operator\n\t\t else\n\t\t {\n\t\t operator = tokenizer.next();\n\t\t \n\t\t // Obtain first top operand from stack if there are two on the stack\n\t\t\t if(stack.getLength() > 1)\n\t\t\t {\n\t\t\t\t operand2 = stack.top();\t \n\t\t\t stack.pop();\n\t\t\t }\n\t\t \n\t\t // Obtain second bottom operand from stack.\n\t\t operand1 = stack.top();\t\t \n\t\t stack.pop();\n\t \n\t\t // Perform operation.\n\t\t switch(operator)\n\t\t {\n\t\t case \"/\": result = operand1 / operand2;\n\t\t \t\t\tbreak;\n\t\t case \"*\": result = operand1 * operand2;\n\t\t \t\t\tbreak;\n\t\t case \"+\": result = operand1 + operand2;\n\t\t \t\t\tbreak;\n\t\t case \"-\": result = operand1 - operand2;\n\t\t \t\t\tbreak;\n\t\t case \"^\": result = (int)Math.pow(operand1, operand2);\n\t\t \t\t\tbreak;\n\t\t case \"Q\": result = (int)Math.sqrt(operand1);\t \n\t\t \t\t\tstack.push(operand2);\n\t\t \t\t\tbreak;\n\t\t case \"C\": result = (int)Math.cbrt(operand1);\n\t\t \t\t\tstack.push(operand2);\n\t\t \t\t\tbreak;\n\t\t case \"<\": result = operand1 << operand2;\n\t\t \t\t\tbreak;\n\t\t case \">\": result = operand1 >> operand2;\n\t\t \t\t\tbreak;\n\t\t case \"%\": result = operand1 % operand2;\n\t\t \t\t\tbreak;\t\t\t\t\t\n\t\t \t\t\t\n\t\t }// end of switch\n\t\t \n\t\t // Push result of operation onto stack.\n\t\t stack.push(result);\n\t\t \n\t\t }// end of else\n\t\t \n\t\t}// end of while\n\t\t \n\t\t // obtain final result from the stack\n\t\t result = stack.top();\n\t\t stack.pop();\n\t\t \n\t\t // if the result is bigger than an int throw an exception\n\t\t if(result > 2147483647)\n\t\t \tthrow new OverFlowException(\"over flow the result is to big\");\n\t\t \n\t\t // Return the final result\n\t\t return (int)result;\n\t\t \n\t}","title":""},{"docid":"9e79b834eba4e108c69e81c738938bb6","score":"0.564223","text":"public void setOperator(String operator) {\n this.operator = operator;\n }","title":""},{"docid":"bc3e0f58d960fc38ebe8c70546bac498","score":"0.562984","text":"private void arithmeticLogical(int opcode) {\n SymbolicValueDescriptor op2 = (SymbolicValueDescriptor)shadowStk.pop();\n SymbolicValueDescriptor op1 = (SymbolicValueDescriptor)shadowStk.pop();\n\n if (op1.getType().isPointer()) {\n Assert.that(opcode == OP_ADD || opcode == OP_SUB,\n \"Arithmetic: pointer type can only be used in add() or sub() instructions\");\n Assert.that(op2.getType() == INT,\n \"Arithmetic add/sub: expecting second operand to be of integer type; first operand is a pointer\");\n }\n else if (op2.getType().isPointer()) {\n Assert.that(opcode == OP_ADD || opcode == OP_SUB,\n \"Arithmetic: pointer type can only be used in add() or sub() instructions\");\n Assert.that(op1.getType() == INT,\n \"Add/subtract instruction: expecting first operand type to integer; second operand is a pointer\");\n }\n else if (opcode == OP_SHL || opcode == OP_SHR || opcode == OP_USHR) {\n Assert.that(op2.getType() == INT,\n \"Shift instruction: expecting second operand to be of type integer\");\n }\n else {\n Assert.that(op1.getType() == op2.getType(),\n \"Arithmetic/logical: expecting operands to be of the same type\");\n }\n\n SymbolicValueDescriptor result = instr.binOp(op1, op2, opcode, shadowStk);\n shadowStk.push(result);\n }","title":""},{"docid":"e69e8b97d9143d8d2c960854cc0061ff","score":"0.5619809","text":"private static int performOperation(int operandOne, int operandTwo, char operator)\r\n {\n switch (operator) {\r\n case '+':\r\n int total;\r\n total = operandOne + operandTwo;\r\n return total;\r\n case '-':\r\n total = operandOne - operandTwo;\r\n return total;\r\n case '*':\r\n total = operandOne * operandTwo;\r\n return total;\r\n case '/':\r\n total = operandOne / operandTwo;\r\n return total;\r\n default:\r\n return 0;\r\n }\r\n //return the total calculated depending on the case\r\n return 0;\r\n }","title":""},{"docid":"8d071884631e41291a51a6962b8895bd","score":"0.56188846","text":"public abstract void setPreviousOperator(Expression e);","title":""},{"docid":"56c2506c541e5b0ceea3aa18cbf2c9fe","score":"0.5599511","text":"interface AInstr {\n public Stack<Double> oper(Stack<Double> s);\n}","title":""},{"docid":"1c496af8ad0de3980f8ccb7b15e8aa63","score":"0.5569224","text":"public static void doOp() {\n\t\tboolean key = false;\n\t\t\n\t\t//Pops the necessary elements from the stacks: two doubles and one string representing the operation\n\t\tx = (double) valStk.pop();\n\t y = (double) valStk.pop();\n\t op = (String) opStk.pop();\n\t \n\t //If the operation is equal to + perform the addition\n\t if(\"+\".contentEquals(op)) {\n\t\t result= y+x;\n\t\t valStk.push(result);\n\t\t \n\t }\n\t //If the operation is equal to - perform the subtraction\n\t else if(\"-\".contentEquals(op)) {\n\t\t result=y-x;\n\t\t valStk.push(result);\n\t\t \n\t }\n\t //If the operation is equal to * perform the multiplication\n\t else if(\"*\".contentEquals(op)) {\n\t\t result=y*x;\n\t\t valStk.push(result);\n\t\t \n\t }\n\t //If the operation is equal to / perform the division\n\t else if(\"/\".contentEquals(op)) {\n\t\t result=y/x;\n\t\t valStk.push(result);\n\t\t\n\t }\n\t //If the operation is equal to ^ perform the power\n\t else if(\"^\".contentEquals(op)) {\n\t\t result=power(y,x);\n\t\t valStk.push(result);\n\t\t\n\t }\n\t //If the operation is equal to ! perform the factorial\n\t else if(\"!\".contentEquals(op)) {\n\t\t result= factorial(x);\n\t\t valStk.push(result);\n\t\t \n\t }\n\t //If the operation is equal to > perform the boolean exp\n\t else if(\">\".contentEquals(op)) {\n\t\t result = (y > x ? 1 : 0);\n\t\t valStk.push(result);\n\t\n\t }\n\t //If the operation is equal to < perform the boolean exp\n\t else if(\"<\".contentEquals(op)) {\n\t\t result = (y < x ? 1 : 0);\n\t\t valStk.push(result);\n\t\t \n\t }\n\t //If the operation is equal to >= perform the boolean exp\n\t else if(\">=\".contentEquals(op)) {\n\t\t result = (y >= x ? 1 : 0);\n\t\t valStk.push(result);\n\t\t\n\t }\n\t //If the operation is equal to <= perform the boolean exp\n\t else if(\"<=\".contentEquals(op)) { \n\t\t result = (y <= x ? 1 : 0);\n\t\t valStk.push(result);\n\t\t \n\t }\n\t //If the operation is equal to == perform the boolean exp\n\t else if(\"==\".contentEquals(op)) {\n\t\t result = (y == x ? 1 : 0);\n\t\t valStk.push(result);\n\t\t \n\t }\n\t //If the operation is equal to != perform the boolean exp\n\t else if(\"!=\".contentEquals(op)) {\n\t\t result = (y != x ? 1 : 0);\n\t\t valStk.push(result);\n\t\t \n\t }\n\t \n\t }","title":""},{"docid":"fae91a6001e40a625f71409aebfb76e0","score":"0.5564359","text":"private void operate(){\n switch(operator){\n case '+':\n if(!firstResult){\n result = num1Set + num2Set;\n firstResult = true;\n }\n else\n result += num2Set;\n\n break;\n case '-':\n if(!firstResult){\n result = num1Set - num2Set;\n firstResult = true;\n }\n else\n result -= num2Set;\n break;\n case '*':\n if(!firstResult){\n result = num1Set * num2Set;\n firstResult = true;\n }\n else\n result *= num2Set;\n break;\n case '/':\n if(!firstResult){\n result = num1Set / num2Set;\n firstResult = true;\n }\n else\n result /= num2Set;\n\n break;\n }\n numDisplay.setText(Double.toString(result));\n }","title":""},{"docid":"7013aeefcd9ac4f3c7d91e4bf6a41e36","score":"0.556398","text":"boolean hasOperator();","title":""},{"docid":"f895563e1383ee3b7f021853564d9663","score":"0.55560803","text":"private Object execute(Bytecode.Operator bytecode, Constant[] frame, Context context) {\n\t\tint[] operands = bytecode.operands();\n\t\tConstant[] values = new Constant[operands.length];\n\t\t// Read all operands\n\t\tfor(int i=0;i!=operands.length;++i) {\n\t\t\tvalues[i] = frame[operands[i]];\n\t\t}\t\t\n\t\t// Compute result\n\t\tConstant result = operators[bytecode.opcode()].apply(values, context);\t\t\n\t\t// Write result to target\n\t\tframe[bytecode.target(0)] = result;\n\t\t// Continue on to next instruction\n\t\treturn context.pc.next();\n\t}","title":""},{"docid":"59d2e7509d46b07567dda3e539ff9ff8","score":"0.55525476","text":"private static void push(Precedence ele) {\n\t\tstack[++top] = ele;\n\t}","title":""},{"docid":"963620bd7020dbae62b713fa840b59ae","score":"0.55342","text":"private static int computeUnaryOperator(int op,String operator){\n\t\t\n\t\tswitch(operator){\n\t\t\n\t\tcase \"^2\":\n\t\t\treturn op*op;\n\t\tcase \"^3\":\n\t\t\treturn op*op*op;\n\t\tdefault:\n\t\t\treturn 0;\n\t\t}\n\t}","title":""},{"docid":"b258a836f4a6d0df61e5fb2e49730ca6","score":"0.5525472","text":"public void addOperator(Operator op){\n\t\tif(analyzedAgentID != op.ownerID) return;\n\t\t\n\t\tif(op.isPrivate){\n\t\t\treturn;\n\t\t}\n\t\t\n\t\tif(op.pre == null) op.pre = new HashMap<>();\n\t\tif(op.eff == null) op.eff = new HashMap<>();\n\t\t\n\t\top.generatePublicLabelAndHash();\n\t\t\n\t\tOperator existingOp = opMap.get(op.hash);\n\t\t\n\t\tif(existingOp != null){\n\t\t\t\n\t\t\texistingOp.addOriginalOp(op);\n\t\t\t\n\t\t\tSystem.out.println(\"op \" + op.opName + \", owner=\"+op.ownerID + \" added to op \" + existingOp.opName + \" with preMask=\"+Arrays.toString(op.publicPreMask)+ \",effMask=\"+Arrays.toString(op.publicEffMask)+ \", op count \" + existingOp.getOriginalOps().size());\n\t\t\t\n\t\t\tpublicActions++;\n\t\t}else{\n\t\t\topMap.put(op.hash, op);\n\t\t\tSystem.out.println(\"op \" + op.opName + \", owner=\"+op.ownerID + \" created with preMask=\"+Arrays.toString(op.publicPreMask)+ \",effMask=\"+Arrays.toString(op.publicEffMask));\n\t\t\t\n\t\t\tpubliclyUniqueActions++;\n\t\t}\n\t\t\n\t\t\n\t\t\n\t}","title":""},{"docid":"90d7e4b4ccaf296306465e8b15b80a91","score":"0.55242306","text":"public AddOperator() {\n this.precedence = 1;\n\n }","title":""},{"docid":"46bf3f3408d0abbfb42f267b4ecfab3b","score":"0.5513008","text":"@Override\n public Object visit(Logical logical, Object o) {\n logical.getLeftExpression().accept(this, o);\n logical.getRightExpression().accept(this, o);\n codeGenerator.logical(logical.getOperator());\n return null;\n }","title":""},{"docid":"196b3f54b252abe29750e3b121dfeba5","score":"0.55051017","text":"public int calPoints(String[] ops) {\n Stack<Integer> stack = new Stack();\n \n for(String op : ops) {\n if (op.equals(\"+\")) {\n int top = stack.pop();\n int newtop = top + stack.peek();\n stack.push(top);\n stack.push(newtop);\n } else if (op.equals(\"C\")) {\n stack.pop();\n } else if (op.equals(\"D\")) {\n stack.push(2 * stack.peek());\n } else {\n stack.push(Integer.valueOf(op));\n }\n }\n \n int ans = 0;\n for(int score : stack) ans += score;\n return ans;\n }","title":""},{"docid":"aa9a72bc9ad3bc9c58e98879c9c25008","score":"0.55048645","text":"public final MeteorParser.operator_return operator() throws RecognitionException {\n operator_stack.push(new operator_scope());\n MeteorParser.operator_return retval = new MeteorParser.operator_return();\n retval.start = input.LT(1);\n\n\n EvaluationExpression root_0 = null;\n\n MeteorParser.readOperator_return readOperator93 =null;\n\n MeteorParser.writeOperator_return writeOperator94 =null;\n\n MeteorParser.genericOperator_return genericOperator95 =null;\n\n\n\n try {\n // /home/arv/workspace/ozone-meteor/meteor/meteor-meteor/src/main/java/eu/stratosphere/meteor/Meteor.g:282:2: ( readOperator | writeOperator | genericOperator )\n int alt53=3;\n switch ( input.LA(1) ) {\n case VAR:\n {\n int LA53_1 = input.LA(2);\n\n if ( (LA53_1==51) ) {\n int LA53_5 = input.LA(3);\n\n if ( (LA53_5==61) ) {\n alt53=1;\n }\n else if ( (LA53_5==ID) ) {\n alt53=3;\n }\n else {\n if (state.backtracking>0) {state.failed=true; return retval;}\n NoViableAltException nvae =\n new NoViableAltException(\"\", 53, 5, input);\n\n throw nvae;\n\n }\n }\n else if ( (LA53_1==43) ) {\n alt53=3;\n }\n else {\n if (state.backtracking>0) {state.failed=true; return retval;}\n NoViableAltException nvae =\n new NoViableAltException(\"\", 53, 1, input);\n\n throw nvae;\n\n }\n }\n break;\n case 61:\n {\n alt53=1;\n }\n break;\n case 64:\n {\n alt53=2;\n }\n break;\n case ID:\n {\n alt53=3;\n }\n break;\n default:\n if (state.backtracking>0) {state.failed=true; return retval;}\n NoViableAltException nvae =\n new NoViableAltException(\"\", 53, 0, input);\n\n throw nvae;\n\n }\n\n switch (alt53) {\n case 1 :\n // /home/arv/workspace/ozone-meteor/meteor/meteor-meteor/src/main/java/eu/stratosphere/meteor/Meteor.g:282:4: readOperator\n {\n root_0 = (EvaluationExpression)adaptor.nil();\n\n\n pushFollow(FOLLOW_readOperator_in_operator2087);\n readOperator93=readOperator();\n\n state._fsp--;\n if (state.failed) return retval;\n if ( state.backtracking==0 ) adaptor.addChild(root_0, readOperator93.getTree());\n\n if ( state.backtracking==0 ) { retval.op = (readOperator93!=null?readOperator93.source:null); }\n\n }\n break;\n case 2 :\n // /home/arv/workspace/ozone-meteor/meteor/meteor-meteor/src/main/java/eu/stratosphere/meteor/Meteor.g:283:5: writeOperator\n {\n root_0 = (EvaluationExpression)adaptor.nil();\n\n\n pushFollow(FOLLOW_writeOperator_in_operator2095);\n writeOperator94=writeOperator();\n\n state._fsp--;\n if (state.failed) return retval;\n if ( state.backtracking==0 ) adaptor.addChild(root_0, writeOperator94.getTree());\n\n if ( state.backtracking==0 ) { retval.op = (writeOperator94!=null?writeOperator94.sink:null); }\n\n }\n break;\n case 3 :\n // /home/arv/workspace/ozone-meteor/meteor/meteor-meteor/src/main/java/eu/stratosphere/meteor/Meteor.g:284:5: genericOperator\n {\n root_0 = (EvaluationExpression)adaptor.nil();\n\n\n pushFollow(FOLLOW_genericOperator_in_operator2103);\n genericOperator95=genericOperator();\n\n state._fsp--;\n if (state.failed) return retval;\n if ( state.backtracking==0 ) adaptor.addChild(root_0, genericOperator95.getTree());\n\n if ( state.backtracking==0 ) { retval.op = (genericOperator95!=null?genericOperator95.op:null); }\n\n }\n break;\n\n }\n retval.stop = input.LT(-1);\n\n\n if ( state.backtracking==0 ) {\n\n retval.tree = (EvaluationExpression)adaptor.rulePostProcessing(root_0);\n adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);\n }\n }\n\n catch (RecognitionException e) {\n throw e;\n }\n\n finally {\n \t// do for sure before leaving\n operator_stack.pop();\n }\n return retval;\n }","title":""},{"docid":"c44a826a19a0706b4721bdd0e7b95c6d","score":"0.54748917","text":"private void arithmeticExpressionTreeEvaluation() {\r\n\t\t\r\n\t\tIterator printPostFix = tree.iterator();\r\n\t\t\r\n\t\tSystem.out.print(\"postfix from the arithmetic expression tree: \");\r\n\r\n\t\t\r\n\t\twhile(printPostFix.hasNext()) {\r\n\t\t\t\r\n\t\t\tSystem.out.print(printPostFix.next() + \" \");\r\n\t\t\r\n\t\t}\r\n\t\t\r\n\t\tSystem.out.println();\r\n\t\t\r\n\t\tIterator it = tree.iterator();\r\n\t\t\r\n\t\tLinkedStack<Double> expressionStack= new LinkedStack<>();\r\n\t\t\r\n\t\twhile(it.hasNext()) {\r\n\t\t\t\r\n\t\t\tString temp = it.next().toString();\r\n\t\t\t\r\n\t\t\tif(!temp.equals(\"*\") && !temp.equals(\"/\") && !temp.equals(\"+\") && !temp.equals(\"–\")) {\r\n\t\t\t\t\r\n\t\t\t\t// check to see if it the the popped item from the stack is a double or a variable, if it is a variable then ask for user input\r\n\t\t\t\ttry {\r\n\t\t\t\t\t\r\n\t\t\t\t\texpressionStack.push(Double.parseDouble(temp));\r\n\t\t\t\t\r\n\t\t\t\t} \r\n\t\t\t\t\r\n\t\t\t\tcatch (Exception e) {\r\n\t\t\t\t\t\r\n\t\t\t\t\tScanner userInput = new Scanner(System.in);\r\n\t\t\t\t\t\r\n\t\t\t\t\tdouble dobTemp;\r\n\t\t\t\t\t\r\n\t\t\t\t\tSystem.out.print(\"Please enter an integer or floating point number for the variable \" + temp + \": \");\r\n\t\t\t\t\t\r\n\t\t\t\t\twhile(true) {\r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\ttry {\r\n\t\t\r\n\t\t\t\t\t\t\tdobTemp = Double.parseDouble(userInput.next());\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\texpressionStack.push(dobTemp);\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\t\r\n\t\t\t\t\t\t} \r\n\t\t\t\t\t\t\r\n\t\t\t\t\t\tcatch (Exception e2) {\r\n\t\t\t\t\t\t\t\r\n\t\t\t\t\t\t\tSystem.out.print(\"Try again! Enter an integer or floating point number for the variable \" + temp + \": \" );\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\r\n\t\t\t\t\t} // end of while loop\r\n\t\t\t\t\t\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t} // end of if block\r\n\t\t\t\r\n\t\t\telse {\r\n\t\t\t\t\r\n\t\t\t\tdouble rightOperand;\r\n\t\t\t\t\r\n\t\t\t\tdouble leftOperand;\r\n\t\t\t\t\r\n\t\t\t\tdouble total;\r\n\t\t\t\t\r\n\t\t\t\trightOperand = expressionStack.pop();\r\n\t\t\t\t\r\n\t\t\t\tleftOperand = expressionStack.pop();\r\n\t\t\t\t\r\n\t\t\t\tif(temp.equals(\"*\")) {\r\n\t\t\t\t\t\r\n\t\t\t\t\ttotal = rightOperand * leftOperand;\r\n\t\t\t\t\t\r\n\t\t\t\t\texpressionStack.push(total);\r\n\t\t\t\t\t\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\tif(temp.equals(\"/\")) {\r\n\t\t\t\t\t\r\n\t\t\t\t\ttotal = leftOperand / rightOperand;\r\n\t\t\t\t\t\r\n\t\t\t\t\texpressionStack.push(total);\r\n\t\t\t\t\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\tif(temp.equals(\"+\")) {\r\n\t\t\t\t\t\r\n\t\t\t\t\ttotal = rightOperand + leftOperand;\r\n\t\t\t\t\t\r\n\t\t\t\t\texpressionStack.push(total);\r\n\t\t\t\t\r\n\t\t\t\t}\r\n\t\t\t\t\r\n\t\t\t\tif(temp.equals(\"–\")) {\r\n\t\t\t\t\t\r\n\t\t\t\t\ttotal = leftOperand - rightOperand;\r\n\t\t\t\t\t\r\n\t\t\t\t\texpressionStack.push(total);\r\n\t\t\t\t\t\r\n\t\t\t\t}\r\n\t\r\n\t\t\t}\r\n\t\t\t\r\n\t\t}\r\n\t\t\r\n\t\tdouble result = expressionStack.pop();\r\n\t\t\r\n\t\tSystem.out.println(\"Evaluated expression: \" + result);\r\n\t\r\n\t}","title":""},{"docid":"ddebb1525c81119bfb02dbe4e38ec668","score":"0.54671633","text":"public interface OperatorContext {\n\n /**\n * @param operator registers a new operator, taking care to avoid registration of new operators\n * that override a predefined operator suffix.\n */\n void register(Operator operator);\n\n /**\n * Finds the operator that matches the given suffix\n *\n * @param suffix the suffix to look for\n * @return the operator that matches the suffix or {@literal null} if none matches.\n */\n Operator getBySuffix(String suffix);\n}","title":""},{"docid":"2c4e6ca85415d048df672c3ed8e58d8a","score":"0.54650813","text":"protected void applyGeneticOperator(GeneticOperator a_operator,\n Population a_population,\n List a_chromosomes) {\n a_operator.operate(a_population, a_chromosomes);\n }","title":""},{"docid":"a225597652aea3a7d0cfb951d4234feb","score":"0.5461449","text":"public void eval(StackADT <Integer>stack){\r\n\t \t\t//Cycles through all the steps\r\n\t \t\tfor(int i = 0; i< steps.size(); i++){\r\n\t \t \tString s = steps.get(i);\r\n\t\t \t \ttry{\r\n\t\t \t \t//Pushes step onto stack if it is an integer\r\n\t\t \t \t\tInteger j = Integer.parseInt(s);\r\n\t\t\t \t\tstack.push(j);\r\n\t\t \t }\r\n\t\t \t catch(NumberFormatException e){ \r\n\t\t\t \t \t //Checks if string is an addition sign\r\n\t \t if (s.equals(\"+\")){\r\n\t \t\tInteger i1 = stack.pop();\r\n\t \t\tInteger i2 = stack.pop();\r\n\t \t\tstack.push(i1+i2);\r\n\t \t }\r\n\t \t //checks if string is a subtraction sign\r\n\t \t if (s.equals(\"-\")){\r\n\t \t\tInteger i2 = stack.pop();\r\n\t \t\tInteger i1 = stack.pop();\r\n\t \t\tstack.push(i2-i1);\r\n\t \t }\r\n\t \t //checks if string is a multiplication sign\r\n\t \t if (s.equals(\"*\")){\r\n\t \t\tInteger i1 = stack.pop();\r\n\t \t\tInteger i2 = stack.pop();\r\n\t \t\tstack.push(i1*i2);\r\n\t \t }\r\n\r\n\t \t }\r\n\t \t}\r\n\t\r\n\t }","title":""},{"docid":"75859aa6f7997bf2e0c32343f9a16af7","score":"0.5456655","text":"private void chooseExpressionLike(\n SourceOfRandomness random,\n Consumer<SourceOfRandomness> nextPrecedence,\n Terminal... operators) {\n\n List<Tuple2<Double, Consumer<SourceOfRandomness>>> choices = new ArrayList<>();\n // Drops down one level in precedence (e.g. from LogicalOrExpression to LogicalAndExpression).\n // This is the non-recursive case, so should have a rel. high weight.\n choices.add(tuple(2.0, nextPrecedence));\n\n for (Terminal op : operators) {\n choices.add(\n tuple(\n 0.1,\n r -> {\n // In the other cases, we will recurse while also intercalating an operator.\n // Think LogicalOrExpression || LogicalAndExpression\n // recurse op nextPrecedence\n chooseExpressionLike(r, nextPrecedence, operators);\n ret.add(op);\n nextPrecedence.accept(r);\n }));\n }\n\n selectWithRandomWeight(random, choices);\n }","title":""},{"docid":"afe005f95bf7530326701c0796257719","score":"0.5456607","text":"public static Expression Operator(Expression left, String operator, Expression right) {\n\t\treturn new Expression(\"Operator\", operator, left, right);\n\t}","title":""},{"docid":"d4c40020ffb6715caad184b1d87d83e9","score":"0.54519325","text":"private static Optional<State> doOperation(State check, int index1, int index2, char operator) {\n int valOne = check.getNumber(index1);\n String stringOne = check.getString(index1);\n int valTwo = check.getNumber(index2);\n String stringTwo = check.getString(index2);\n int result;\n switch (operator) {\n case '+':\n result = valOne + valTwo;\n break;\n case '-':\n result = valOne - valTwo;\n break;\n case '*':\n result = valOne * valTwo;\n break;\n case '/':\n result = valOne / valTwo;\n break;\n default:\n throw new IllegalArgumentException();\n }\n if (result <= MAXVALUE && result >= 0) {\n List<Integer> newNumbers = new LinkedList<>();\n List<String> newString = new LinkedList<>();\n List<Integer> remainingNumbers = getRemainingNumbers(check, index1, index2);\n\n newNumbers.add(result);\n newString.add(\"[\" + stringOne + operator + stringTwo + \"]\");\n for (Integer number: remainingNumbers) {\n newNumbers.add(number);\n newString.add(String.valueOf(number));\n }\n return Optional.ofNullable(new State(newNumbers, newString));\n }\n return Optional.empty();\n }","title":""},{"docid":"a3a0fdf9d5f0fb88aa3ef3a2b5146bdf","score":"0.54465926","text":"private static void apply(String[] operations, Integer[] values) {\n MinStack minStack = new MinStack();\n Object[] response = new Object[operations.length];\n for (int i = 0; i < operations.length; i++) {\n switch (operations[i]) {\n case \"MinStack\": {\n response[i] = null;\n continue;\n }\n case \"push\": {\n response[i] = null;\n minStack.push(values[i]);\n break;\n }\n case \"pop\": {\n response[i] = null;\n minStack.pop();\n break;\n }\n case \"getMin\": {\n response[i] = minStack.getMin();\n break;\n }\n case \"top\": {\n response[i] = minStack.top();\n break;\n }\n }\n }\n }","title":""},{"docid":"c61e21a0b35b7a7023640dbb64a335b4","score":"0.54416007","text":"public Expression parseAddExpression() throws IOException\n {\n Expression expression = parseMultExpression();\n String r = this.currentToken;\n while (r.equals(\"+\") || r.equals(\"-\"))\n {\n eat(currentToken);\n // want to build tree from left side\n expression = new Evaluator(parseMultExpression(), expression, r);\n r = currentToken;\n }\n return expression;\n }","title":""},{"docid":"e87449b515d1461913463ab437556027","score":"0.5440611","text":"public calc(){\n scan = new Scanner(System.in);\n operators = new Stack<>();\n ops = new Operator();\n }","title":""},{"docid":"8a99c2c05960beaece23b41a164b55c5","score":"0.5429486","text":"public boolean arithmetic(ByteCode instr){\n\t\tboolean right = true;\r\n\t\tif(this.cont >= 2){\r\n\t\t\tint num = this.pop();\r\n\t\t\tswitch (instr.getName()){\r\n\t\t\t\tcase ADD: \r\n\t\t\t\t\tthis.add(this.pop() + num);// stack.pop());\r\n\t\t\t\t\tright = true;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\tcase SUB:\r\n\t\t\t\t\tthis.add(this.pop() - num); //stack.pop());\r\n\t\t\t\t\tright = true;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\tcase MUL:\r\n\t\t\t\t\tthis.add(this.pop() * num);//stack.pop());\r\n\t\t\t\t\tright = true;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\tcase DIV:\r\n\t\t\t\t\t//int num = stack.pop();\r\n\t\t\t\t\tif(num != 0){\r\n\t\t\t\t\t\tright = true;\r\n\t\t\t\t\t\tthis.add(this.pop() / num);\r\n\t\t\t\t\t}\r\n\t\t\t\t\telse \r\n\t\t\t\t\t\tright = false;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\tdefault:\r\n\t\t\t\t\tright = false;\r\n\t\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\t\telse\r\n\t\t\tright = false;\r\n\t\t\r\n\t\treturn right;\r\n\t}","title":""},{"docid":"546111dec42d222975809d3a5a22b805","score":"0.5425328","text":"public Element serializeOperator(Operator operator)\n {\n Element element = serializeOperatorOnly(operator);\n \n // Operators with nested plans\n if (operator instanceof SendPlan)\n {\n Element args_elm = getOnlyChildElement(element, ARGS_ELM);\n SendPlan send_plan = (SendPlan) operator;\n serializeAssignConfiguration(args_elm, send_plan.getSendPlan());\n args_elm.appendChild(serializeOperator(send_plan.getSendPlan().getRootOperator()));\n }\n else if (operator instanceof Copy)\n {\n Element args_elm = getOnlyChildElement(element, ARGS_ELM);\n Copy copy = (Copy) operator;\n serializeAssignConfiguration(args_elm, copy.getCopyPlan());\n args_elm.appendChild(serializeOperator(copy.getCopyPlan().getRootOperator()));\n }\n else if (operator instanceof ApplyPlan)\n {\n Element args_elm = getOnlyChildElement(element, ARGS_ELM);\n ApplyPlan apply_plan = (ApplyPlan) operator;\n serializeAssignConfiguration(args_elm, apply_plan.getLogicalPlansUsed().get(0));\n args_elm.appendChild(serializeOperator(apply_plan.getLogicalPlansUsed().get(0).getRootOperator()));\n }\n else if (operator instanceof Assign)\n {\n Element args_elm = getOnlyChildElement(element, ARGS_ELM);\n Assign assign = (Assign) operator;\n serializeAssignConfiguration(args_elm, assign.getPlan());\n args_elm.appendChild(serializeOperator(assign.getPlan().getRootOperator()));\n }\n else if (operator instanceof Exists)\n {\n Element args_elm = getOnlyChildElement(element, ARGS_ELM);\n Exists exists = (Exists) operator;\n serializeAssignConfiguration(args_elm, exists.getLogicalPlansUsed().get(0));\n args_elm.appendChild(serializeOperator(exists.getLogicalPlansUsed().get(0).getRootOperator()));\n }\n else if (operator instanceof CreateDataObject)\n {\n Element args_elm = getOnlyChildElement(element, ARGS_ELM);\n CreateDataObject create_op = (CreateDataObject) operator;\n for (SchemaPath path : create_op.getTypesToSetDefault())\n {\n // Query plan XML element\n Element plan_elm = serializeLogicalPlan(create_op.getDefaultPlan(path));\n plan_elm.setAttribute(TYPE_ATTR, path.getString());\n args_elm.appendChild(plan_elm);\n }\n }\n else if (operator instanceof Insert)\n {\n Insert insert_op = (Insert) operator;\n \n Element args_elm = getOnlyChildElement(element, ARGS_ELM);\n \n // Query plan XML element\n // FIXME: the plan cannot have assignment, can it?\n Element plan_elm = serializeLogicalPlan(insert_op.getLogicalPlan());\n args_elm.appendChild(plan_elm);\n }\n else if (operator instanceof Update)\n {\n Element args_elm = getOnlyChildElement(element, ARGS_ELM);\n Update update_op = (Update) operator;\n \n for (Assignment assignment : update_op.getAssignments())\n {\n // Assignment XML element\n Element assignment_elm = getDomDocument().createElement(ASSIGNMENT_ELM);\n args_elm.appendChild(assignment_elm);\n \n // Target XML element\n Element target_elm = getDomDocument().createElement(TARGET_ELM);\n assignment_elm.appendChild(target_elm);\n \n target_elm.appendChild(this.serializeTerm(assignment.getTerm()));\n \n // Query plan XML element\n // FIXME: the plan cannot have assignment, can it?\n Element plan_elm = serializeLogicalPlan(assignment.getLogicalPlan());\n assignment_elm.appendChild(plan_elm);\n \n }\n }\n \n for (Operator child_operator : operator.getChildren())\n {\n Element child_element = serializeOperator(child_operator);\n element.appendChild(child_element);\n }\n \n return element;\n }","title":""},{"docid":"5db3999d6f56d5ec56aa62ee9cb4ac06","score":"0.541802","text":"public abstract boolean isApplicable(Operator operator);","title":""},{"docid":"ec2a498ed64858a9b5a0c598a1913f8d","score":"0.5416525","text":"public String visit(Operator n, String argu) {\n String[] _ret = { \"slt\", \"add\", \"sub\", \"mul\" };\n return _ret[n.f0.which];\n }","title":""},{"docid":"8c739a918808a3a9aa51da1c8995b2fd","score":"0.54159695","text":"public Value eval(Environment e) {\n\t\tValue operatorvalue = operator.eval(e);\n\t\tFunValue operatorValue = (FunValue) operatorvalue;\n\t\tEnvironment operatorEnv = operatorValue.environment;\n\t\tVector<Integer> locations = new Vector<Integer>();\n\t\t\n\t\tfor (Expression operand : operands) {\n\t\t\tValue v = operand.eval(e);\n\t\t\tInteger location = Store.theStore.newLocation();\n\t\t\tStore.theStore.extend(location,v);\n\t\t\tlocations.add(location);\n\t\t}\n\t\treturn operatorValue.body.eval(operatorEnv.extend(operatorValue.formals,locations));\n\t}","title":""},{"docid":"1999bc3ed11e9d6ea9519ce6ae67b204","score":"0.54143953","text":"private Fraction executeExpression() {\n\t\tswitch(operator){\n\t\tcase \"*\":\n\t\t\treturn multiply(f1,f2);\n\t\tcase \"/\":\n\t\t\treturn divide(f1,f2);\n\t\tcase \"+\":\n\t\t\treturn add(f1, f2);\n\t\tcase \"-\":\n\t\t\treturn subtract(f1,f2);\n\t\tdefault: \n\t\t\tSystem.out.println(\"no operator!!!!!!\");\n\t\t}\n\t\treturn null; // at this point - no other condition was met.\n\t}","title":""},{"docid":"7564b78d80cecf9f4eefcbd0b0a5c939","score":"0.5406436","text":"@Override\n public void evaluate_expression_tree(ArrayList list) {\n int sum = ((char) list.get(0).toString().charAt(0)) - '0';\n // For all the other items in the string: conduct operation with operator and next operand\n for (int i = 0; i < list.size(); i++) {\n // If the index contains an operator: conduct the infix operation\n if (i%2 == 1) {\n if ((char) list.get(i).toString().charAt(0) == '+') {\n sum = sum + ((char) list.get(i+1).toString().charAt(0) - '0');\n }\n else if ((char) list.get(i).toString().charAt(0) == '-') {\n sum = sum - ((char) list.get(i+1).toString().charAt(0) - '0');\n }\n else if ((char) list.get(i).toString().charAt(0) == '*') {\n sum = sum * ((char) list.get(i+1).toString().charAt(0) - '0');\n }\n else if ((char) list.get(i).toString().charAt(0) == '/') {\n sum = sum / ((char) list.get(i+1).toString().charAt(0) - '0');\n }\n }\n }\n System.out.println(\"FINAL SUM = \" + sum);\n }","title":""},{"docid":"c6de3f74276edec7fe97f2d10036ccdd","score":"0.540623","text":"public void addOperator(View operator) {\r\n if(isResult()) return;\r\n\r\n addOperator(operator, -1, new LinearLayout.LayoutParams(-2, -1));\r\n }","title":""},{"docid":"d623007552aa9fa19827724fabb11cc9","score":"0.53790456","text":"public static void repeatOps(String op) {\n\t\twhile(valStk.size()>1 && (precedent(op)<=precedent(opStk.top().toString()))&& !opStk.top().equals(\"(\")) {\n\t\t\tdoOp();\n\t\t}\n\t}","title":""},{"docid":"24ca0d6d9c078f6ed458e3e6d9aec48b","score":"0.53743875","text":"private void addOperatorInList() {\n for(String string : splitOperators) {\n \tif(!string.isEmpty()) {\n\t\t\t\ttry {\n\t\t\t\t\tif(string.contains(\"×\")) {\n\t\t\t\t\t\tstring = string.replaceAll(\"×\", \"*\");\n\t\t\t\t\t}else if(string.contains(\"÷\")){\n\t\t\t\t\t\tstring = string.replaceAll(\"÷\", \"/\");\n\t\t\t\t\t}\n\t\t\t\t\tSystem.out.println(\"operator: \" + string);\n\t\t\t\t\tthis.operators.add(string);\n\t\t\t\t}catch(NumberFormatException e) {\n\t\t\t\t\tSystem.out.println(\"Error: operation.java add operator in List\");\n\t\t\t\t}\n \t}\n }\n\t}","title":""},{"docid":"14492353143cdd4e3ed9f12388ab3fd2","score":"0.5368865","text":"boolean isOperator();","title":""},{"docid":"6da989a1efc1720ea17d92cc6ea9a198","score":"0.53631216","text":"public String infixToPostfix() {\r\n\t\t// array to store elements after splitting them through whitespaces\r\n\t\tString array[] = infixExpression.split(\"\\\\s+\");\r\n\t\t// loop for checking all elements\r\n\t\tfor (String temp : array) {\r\n\t\t\tif (temp == \"(\") {\r\n\t\t\t\tstack.push(temp);\r\n\t\t\t} else if (temp == \")\") {\r\n\t\t\t\twhile (!stack.isEmpty() && stack.topElement() != \"(\") {\r\n\t\t\t\t\tpostfixExpression += stack.pop();\r\n\t\t\t\t}\r\n\t\t\t\tif (!stack.isEmpty() && stack.topElement() != \"(\") {\r\n\t\t\t\t\tthrow new AssertionError(\"invalid expression\");\r\n\t\t\t\t}\r\n\t\t\t\tstack.pop();\r\n\t\t\t} else if (isOperator(temp)) {\r\n\t\t\t\twhile (!stack.isEmpty()\r\n\t\t\t\t\t\t&& getPrecedence(temp) > getPrecedence(stack\r\n\t\t\t\t\t\t\t\t.topElement())) {\r\n\t\t\t\t\tpostfixExpression += temp;\r\n\t\t\t\t}\r\n\t\t\t\tstack.push(temp);\r\n\t\t\t} else {\r\n\t\t\t\tpostfixExpression += temp;\r\n\t\t\t}\r\n\t\t}\r\n\t\twhile (!stack.isEmpty()) {\r\n\t\t\tpostfixExpression += stack.pop();\r\n\t\t}\r\n\t\treturn postfixExpression;\r\n\t}","title":""},{"docid":"89131a66653c3e3bfe3310adc33c14b2","score":"0.5357549","text":"public interface Operator {\n\t\n}","title":""},{"docid":"3e10fc545508c3db9644e112d4695536","score":"0.53555036","text":"ExpressionMatchingOperator createExpressionMatchingOperator();","title":""},{"docid":"727ec2318b8a52e1f0e5b5049330b6cf","score":"0.53540784","text":"void apply(Stack<Double> numbers) throws ParsingException {\n // Too few arguments\n if (numbers.size() < valency) {\n throw new ParsingException(\"Too few operands\");\n }\n\n double[] args = new double[valency];\n for (int i = valency - 1; i >= 0; --i) {\n args[i] = numbers.pop();\n }\n\n switch (this) {\n case ADD:\n numbers.push(args[0] + args[1]);\n break;\n case SUBTRACT:\n numbers.push(args[0] - args[1]);\n break;\n case MULTIPLY:\n numbers.push(args[0] * args[1]);\n break;\n case DIVIDE:\n numbers.push(args[0] / args[1]);\n break;\n case UNARY_PLUS:\n numbers.push(args[0]);\n break;\n case UNARY_MINUS:\n numbers.push(-args[0]);\n break;\n default:\n throw new IllegalStateException();\n }\n }","title":""},{"docid":"8dacb440a0a35c20d4c221a11ca265fc","score":"0.53478503","text":"public DynamicOperand getOperand();","title":""},{"docid":"07b065cb0dbddd0269333a28d100f8d6","score":"0.53453535","text":"static String infixToPostfix(String exp)throws IllegalOperationException, LookAtMrAlgebraOverHereException\n {\n // initializing empty String for result\n String result = new String(\"\");\n boolean lastest = false;\n\n // initializing empty stack\n Stack<Character> stack = new Stack<>();\n\n for (int i = 0; i<exp.length(); ++i)\n {\n char c = exp.charAt(i);\n\n // If the scanned character is an operand, add it to output.\n\n if(c == '&' || c == '#' || c == '@' || c == '^' || c == '!')\n throw new IllegalOperationException(\"this is not a legal operator\");\n\n else if (Character.isDigit(c)|| c == '.'){\n\n\n result += c;\n lastest = false;\n }\n\n\n // If the scanned character is an '(', push it to the stack.\n\n else if (c == '('){\n\n stack.push(c);\n\n }\n\n // If the scanned character is an ')', pop and output from the stack\n // until an '(' is encountered.\n else if (c == ')')\n {\n\n while (!stack.isEmpty() && stack.peek() != '('){\n result += \" \";\n result += stack.pop();\n\n }\n\n if (!stack.isEmpty() && stack.peek() != '(')\n return \"Invalid Expression\"; // invalid expression\n else\n stack.pop();\n }\n\n else// an operator is encountered\n { result += \" \";\n if(lastest == true)\n throw new LookAtMrAlgebraOverHereException(\"you need to enter number, number belongs here!\");\n lastest = true;\n while (!stack.isEmpty() && Prec(c) <= Prec(stack.peek())){\n result += stack.pop();\n result += \" \";\n\n\n }\n\n stack.push(c);\n }\n\n }\n\n // pop all the operators from the stack\n while (!stack.isEmpty())\n\n result += \" \" + stack.pop();\n return result;\n }","title":""},{"docid":"34ad3cd9be198e972145a6e4ef0ca9eb","score":"0.53416324","text":"private static void processExpressions_conditional_effects(OperatorType oper, HashMap<String, String> parameterMap, Queue<String> preconditionQueue, Queue<String> effectQueue) throws ConvertorException {\n Map<String,Set<ExpressionType>> transitionMap = new HashMap<String,Set<ExpressionType>>();\n \n for (ExpressionType expr: oper.getExpression()) {\n // read all slots and update parameterMap with new variables - these variables make up operator's parameters\n for (SlotType slot: expr.getSlot()) {\n if (slot.getContentType().equals(domainXMLAdapter.VAR_TYPE)) {\n parameterMap.put(slot.getContent(), slot.getContentClass());\n }\n }\n \n // relation expressions\n if (expr.getType().equals(dmiExpression.RELATION)) {\n preconditionQueue.add(buildPreconditionEntryFromRelation(expr));\n continue;\n }\n \n // prevailing transition expressions\n if (expr.getType().equals(dmiExpression.P_TRANS)) {\n preconditionQueue.add(buildPreconditionEntryFromPrevailingTransition(expr));\n continue;\n }\n \n // non-prevailing transition expressions\n if (expr.getType().equals(dmiExpression.TRANS)) {\n // we need to sort non-prevailing transitions into groups with common signature\n String signature = makeSignatureString(expr);\n if (!transitionMap.containsKey(signature)) {\n Set<ExpressionType> newSet = new HashSet<ExpressionType>();\n newSet.add(expr);\n transitionMap.put(signature, newSet);\n } else {\n transitionMap.get(signature).add(expr);\n }\n }\n }\n \n // process non-prevailing expressions\n // usage of conditional effect can be decided only if we know how many expressions with common signature we have\n // to process (transitions are sorted in trasitionMap - we can do it now)\n for (String sign: transitionMap.keySet()) {\n Set<ExpressionType> exprSet = transitionMap.get(sign);\n \n // there is more than one possible transition for one state variable\n if (exprSet.size() > 1) {\n for (ExpressionType expr : exprSet) {\n String oldValueTerm = buildPropositionFromTransition(expr, TRANS_UC_PRECONDITION);\n String newValueTerm = buildPropositionFromTransition(expr, TRANS_UC_EFFECT);\n if ((oldValueTerm == null) || (newValueTerm == null)) {\n throw new ConvertorException(\"Unable to convert expression containing wildcards.\");\n }\n effectQueue.add(\"(when \" + oldValueTerm + \" (and (not \" + oldValueTerm + \") \" + newValueTerm + \"))\");\n }\n } else {\n assert(exprSet.size() == 1);\n // there is only one possible transition for this state variable\n Iterator<ExpressionType> iter = exprSet.iterator();\n assert(iter.hasNext());\n ExpressionType expr = iter.next();\n String oldValueTerm = buildPropositionFromTransition(expr, TRANS_UC_PRECONDITION);\n String newValueTerm = buildPropositionFromTransition(expr, TRANS_UC_EFFECT);\n if ( (oldValueTerm == null) || (newValueTerm == null) ) {\n throw new ConvertorException(\"Unable to convert expression containing wildcards.\");\n }\n \n preconditionQueue.add(oldValueTerm);\n effectQueue.add(\"(not \" + oldValueTerm + \")\"); // delete old value in effect\n \n effectQueue.add(newValueTerm); // set new value in effect\n }\n }\n }","title":""},{"docid":"5336f8c035db7c0882b12b769f759963","score":"0.5341358","text":"public InfixExpression(Operator o, Expression first, Expression second){\n text = first.textualRepresentation()+o.textualRepresentation()+second.textualRepresentation();\n }","title":""}],"string":"[\n {\n \"docid\": \"8b68d52533275aab54b74ad41f2f717c\",\n \"score\": \"0.77358043\",\n \"text\": \"public static void processAnOperator(\\r\\n\\t\\t\\tStack<Integer> operandStack, Stack<Character> operatorStack) {\\r\\n\\t\\tchar op = operatorStack.pop();\\r\\n\\t\\tint op1 = operandStack.pop();\\r\\n\\t\\tint op2 = operandStack.pop();\\r\\n\\t\\tif (op == '+') \\r\\n\\t\\t\\toperandStack.push(op2 + op1);\\r\\n\\t\\telse if (op == '-') \\r\\n\\t\\t\\toperandStack.push(op2 - op1);\\r\\n\\t\\telse if (op == '*') \\r\\n\\t\\t\\toperandStack.push(op2 * op1);\\r\\n\\t\\telse if (op == '/') \\r\\n\\t\\t\\toperandStack.push(op2 / op1);\\r\\n\\t\\telse if (op == '%') \\r\\n\\t\\t\\toperandStack.push(op2 % op1);\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f6f45d626e7271f178baae3cab219bd2\",\n \"score\": \"0.75931805\",\n \"text\": \"public static void processAnOperator(Stack<Double> operandStack,\\n\\t\\t\\tStack<Character> operatorStack) {\\n\\t\\tchar op = operatorStack.pop();\\n\\t\\tdouble op1 = operandStack.pop();\\n\\t\\tdouble op2 = operandStack.pop();\\n\\t\\tif (op == '+')\\n\\t\\t\\toperandStack.push(op2 + op1);\\n\\t\\telse if (op == '-')\\n\\t\\t\\toperandStack.push(op2 - op1);\\n\\t\\telse if (op == '*')\\n\\t\\t\\toperandStack.push(op2 * op1);\\n\\t\\telse if (op == '/')\\n\\t\\t\\toperandStack.push(op2 / op1);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2197dacb0fd2180fc420a2d3d85f6789\",\n \"score\": \"0.7537531\",\n \"text\": \"private void processOperator(char op) {\\n if (operatorStack.empty()) {\\n operatorStack.push(op);\\n } else {\\n // Peek the operator stack and\\n // let topOp be top operator.\\n char topOp = operatorStack.peek();\\n if (precedence(op) > precedence(topOp)) {\\n operatorStack.push(op);\\n } else {\\n // Pop all stacked operators with equal\\n // or higher precedence than op.\\n while (!operatorStack.empty()\\n && precedence(op) <= precedence(topOp)) {\\n operatorStack.pop();\\n postfix.append(topOp);\\n postfix.append(' ');\\n if (!operatorStack.empty()) {\\n // Reset topOp.\\n topOp = operatorStack.peek();\\n }\\n }\\n // assert: Operator stack is empty or\\n // current operator precedence >\\n // top of stack operator precedence.\\n operatorStack.push(op);\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"44e349bdfe86eb9eb20ef5989b1e857d\",\n \"score\": \"0.7238422\",\n \"text\": \"static void processOperator(char token) throws StackUnderFlowException\\n\\t{\\n\\t\\tString topToken = null;\\n\\t\\t\\n\\t\\tif(!converterStack.isEmpty())\\n\\t\\t\\ttopToken = converterStack.top();\\n\\n\\t\\twhile(!converterStack.isEmpty() && !(topToken.equals(\\\"(\\\")) && (precedenceCheck(token,topToken.charAt(0))))\\n\\t\\t{\\n\\t\\t\\tconverterStack.pop();\\n\\t\\t\\tpostfixExpression += topToken;\\n\\t\\t\\ttopToken = converterStack.top();\\n\\t\\t}// end of while loop\\n\\t\\t\\n\\t\\tconverterStack.push(String.valueOf(token));\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6df39e1245b654d5ada19d58a575fde4\",\n \"score\": \"0.70739573\",\n \"text\": \"public static void process()\\n {\\n char operator = operatorStack.pop();\\n //System.out.println(operator);\\n double operand1 = operandStack.pop();\\n //System.out.println(\\\"Op 1: \\\" + operand1);\\n double operand2 = operandStack.pop();\\n //System.out.println(\\\"Op 2: \\\" + operand2);\\n \\n //checks operation to be performed on 2 operands then performs it and\\n //pushes the answer to the top of the operand stack. This keeps a running\\n //total to use as more calculations are made\\n switch(operator)\\n {\\n case '+':\\n operandStack.push(operand2 + operand1);\\n break;\\n case '-':\\n operandStack.push(operand2 - operand1);\\n break;\\n case '*':\\n operandStack.push(operand2 * operand1);\\n break;\\n case '/':\\n operandStack.push(operand2 / operand1);\\n break;\\n default: System.out.println(\\\"Good job, you broke it!\\\");\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c5850fe08909784c3595c78e46926d8c\",\n \"score\": \"0.6727127\",\n \"text\": \"public void topEval(Stack<Operator> pOperatorStack, Stack<Operand> pOperandStack){\\n Operand right = pOperandStack.pop();\\n Operator operator = pOperatorStack.pop();\\n\\n if(operator instanceof UnaryOperator){\\n Operand ret = ((UnaryOperator)operator).evaluate(right);\\n pOperandStack.push(ret);\\n\\n } else {\\n Operand left = pOperandStack.pop();\\n Operand rez = ((BinaryOperator)operator).evaluate(left, right);\\n pOperandStack.push(rez);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a80d61bf443617bcee7eae3e73183a64\",\n \"score\": \"0.6502629\",\n \"text\": \"static int evaluate_expression_two_stack(String expr){\\r\\n stack_resizable_array<Integer> operand_stack = new stack_resizable_array<>();\\r\\n stack_resizable_array<String> operator_stack = new stack_resizable_array<>();\\r\\n \\r\\n String[] tokens = expr.split(\\\" \\\");\\r\\n \\r\\n for (int i = 0; i < tokens.length; i++) {\\r\\n String token = tokens[i];\\r\\n try\\r\\n {\\r\\n int operand = Integer.parseInt(token);\\r\\n operand_stack.push(operand);\\r\\n }\\r\\n catch(NumberFormatException nfe)\\r\\n {\\r\\n\\r\\n //operator is found\\r\\n if( token.equals(\\\"/\\\") || token.equals(\\\"*\\\") || token.equals(\\\"+\\\") || token.equals(\\\"-\\\") || token.equals(\\\")\\\") ){\\r\\n \\r\\n //make sure you perform operation as pop2 _ pop1 and not pop1 _ pop2 because of reversing nature of stack\\r\\n switch(token){\\r\\n case \\\"+\\\": operator_stack.push(token);\\r\\n break;\\r\\n case \\\"-\\\": operator_stack.push(token);\\r\\n break;\\r\\n case \\\"*\\\": operator_stack.push(token);\\r\\n break; \\r\\n case \\\"/\\\": operator_stack.push(token);\\r\\n break; \\r\\n case \\\")\\\": int op1 = operand_stack.pop();\\r\\n int op2 = operand_stack.pop();\\r\\n int result=0;\\r\\n String operand=operator_stack.pop();\\r\\n switch(operand){\\r\\n case \\\"+\\\": result = op2 + op1;\\r\\n break;\\r\\n case \\\"-\\\": result = op2 - op1;\\r\\n break;\\r\\n case \\\"*\\\": result = op2 * op1;\\r\\n break; \\r\\n case \\\"/\\\": result = op2 / op1;\\r\\n break;\\r\\n }\\r\\n operand_stack.push(result);\\r\\n }\\r\\n }\\r\\n }\\r\\n }\\r\\n return operand_stack.pop();\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"01bf037981628832d461c3616c0b7851\",\n \"score\": \"0.64559346\",\n \"text\": \"private void moveOperatorsInsideParenthesisFromStackToPostfix() {\\n while (!this.tokenStack.isEmpty() && this.tokenStack.peek() != Parenthesis.LEFT) {\\n moveTopFromStackToPostfix();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f78b820e5ddde3ab60ee3f23580b637d\",\n \"score\": \"0.6373158\",\n \"text\": \"public static void cycleThroughStack(Stack<Expression> expStack, Stack<String> opStack, HashMap<String,Integer> precedence, boolean pass){ \\n\\twhile(!opStack.empty() && !opStack.peek().equals(\\\"(\\\") && pass){\\n\\t String operString = opStack.pop();\\n\\t Expression term2 = expStack.pop();\\n\\t Expression term1 = expStack.pop();\\n\\t Expression oper = null;\\n\\t if (operString.equals(\\\"+\\\")){\\n\\t\\toper = new SumExpression(term1,term2);\\n\\t\\texpStack.push(oper);\\n\\t }\\n\\t else if (operString.equals(\\\"-\\\")){\\n\\t\\toper = new DifferenceExpression(term1,term2);\\n\\t\\texpStack.push(oper);\\n\\t }\\n\\t else if (operString.equals(\\\"*\\\")){\\n\\t\\toper = new ProductExpression(term1,term2);\\n\\t\\texpStack.push(oper);\\n\\t }\\n\\t else if (operString.equals(\\\"/\\\")){\\n\\t\\toper = new QuotientExpression(term1,term2);\\n\\t\\texpStack.push(oper);\\n\\t }\\n\\t}\\n\\tif (!opStack.empty() && opStack.peek().equals(\\\"(\\\")){\\n\\t opStack.pop();\\n\\t}\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"16500c33f68afd8cf97f1eb98890d868\",\n \"score\": \"0.6306151\",\n \"text\": \"private void moveRemainingOperatorsFromStackToPostfix() {\\n while (!this.tokenStack.isEmpty()) {\\n if (this.tokenStack.peek() == Parenthesis.LEFT) {\\n throw new IllegalArgumentException(\\\"Invalid expression. Parentheses don't match.\\\");\\n }\\n moveTopFromStackToPostfix();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e0aa38d7f368d754ebd896e5f6f7675c\",\n \"score\": \"0.62949985\",\n \"text\": \"private void StackDo(Boolean end) {\\n \\n boolean isAbleToCompute = true;\\n //Enough to compare\\n while (operators.size() >= 2 && isAbleToCompute) {\\n \\n boolean lastOper = false;\\n if (operands.size() > operators.size()) {\\n //use last operator\\n lastOper = true;\\n } else {\\n \\n }\\n \\n Character op2 = operators.pop();\\n Character op1 = operators.pop();\\n \\n \\n \\n if (hasPrecedence(op1, op2)) {\\n \\n Double and2 = operands.pop();\\n Double and1 = operands.pop();\\n if (lastOper) {\\n operators.push(op1);\\n operands.push(evaluate(op2, and1, and2));\\n } else {\\n operators.push(op2);\\n operands.push(evaluate(op1, and1, and2));\\n }\\n \\n } else if (end) {\\n Double and2 = operands.pop();\\n Double and1 = operands.pop();\\n operands.push(evaluate(op2, and1, and2));\\n operators.push(op1);\\n } else {\\n isAbleToCompute = false;\\n operators.push(op1);\\n operators.push(op2);\\n }\\n\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c38b6439ce735055b1c19a49016a449e\",\n \"score\": \"0.6287936\",\n \"text\": \"public static void main(String[] args) {\\n var tokenString = \\\"4 3 2 - 1 + *\\\";\\n var stack = new Stack<Expression>();\\n\\n var tokenList = tokenString.split(\\\" \\\");\\n for (var s : tokenList) {\\n if (isOperator(s)) {\\n var rightExpression = stack.pop();\\n var leftExpression = stack.pop();\\n log.info(\\\"popped from stack left: {} right: {}\\\", leftExpression.interpret(),\\n rightExpression.interpret());\\n var operator = getOperatorInstance(s, leftExpression, rightExpression);\\n log.info(\\\"operator: {}\\\", operator);\\n var result = operator.interpret();\\n var resultExpression = new NumberExpression(result);\\n stack.push(resultExpression);\\n log.info(\\\"push result to stack: {}\\\", resultExpression.interpret());\\n } else {\\n var i = new NumberExpression(s);\\n stack.push(i);\\n log.info(\\\"push to stack: {}\\\", i.interpret());\\n }\\n }\\n log.info(\\\"result: {}\\\", stack.pop().interpret());\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fd86d58611243ba4663fef5bf6149d7b\",\n \"score\": \"0.62771183\",\n \"text\": \"@Override\\n public void execute() {\\n int op2 = stack.pop();\\n int op1 = stack.pop();\\n stack.push( op1 + op2 );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"71c6500d706652632f2e1de60b78d4ce\",\n \"score\": \"0.6253011\",\n \"text\": \"public void Nreduce(final ArrayList<Object> stack, final char symbole_op) throws PLFormulaSyntaxError {\\n\\t\\tfor(int i = 0; i < stack.size(); i++) {\\n\\t\\t\\t// si ce mot est l'operateur que l'on recherche\\n\\t\\t\\tif(stack.get(i).equals(symbole_op)) {\\n\\t\\t\\t\\ttry {\\n\\t\\t\\t\\t\\tArrayList<PLFormula> operandes = new ArrayList<>();\\n\\t\\t\\t\\t\\t// on recupere ses operandes droite et gauche\\n\\t\\t\\t\\t\\tPLFormula f2 = (PLFormula) stack.remove(i + 1);\\n\\t\\t\\t\\t\\tstack.remove(i);\\n\\t\\t\\t\\t\\tPLFormula f1 = (PLFormula) stack.remove(i - 1);\\n\\t\\t\\t\\t\\toperandes.add(f1);\\n\\t\\t\\t\\t\\toperandes.add(f2);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// recherche d'un pattern n-aire (v1 & v2 & v3 & ... & vN)\\n\\t\\t\\t\\t\\twhile(i - 1 < stack.size() && stack.get(i - 1).equals(symbole_op)) {\\n\\t\\t\\t\\t\\t\\tPLFormula f3 = (PLFormula) stack.remove(i);\\n\\t\\t\\t\\t\\t\\tstack.remove(i - 1);\\n\\t\\t\\t\\t\\t\\toperandes.add(f3);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(symbole_op == OR_SYMBOL) {\\n\\t\\t\\t\\t\\t\\tstack.add(i - 1, new OR(this.li, operandes.toArray(new PLFormula[operandes.size()])));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if(symbole_op == AND_SYMBOL) {\\n\\t\\t\\t\\t\\t\\tstack.add(i - 1, new AND(this.li, operandes.toArray(new PLFormula[operandes.size()])));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\ti = i - 1;\\n\\t\\t\\t\\t\\tthis.afficherEtat(stack);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcatch(Exception e) {\\n\\t\\t\\t\\t\\te.printStackTrace();\\n\\t\\t\\t\\t\\tthrow new PLFormulaSyntaxError(\\\"Missing operands for \\\" + symbole_op);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f1242b730c17d64f28c9be96aa260fc0\",\n \"score\": \"0.6232406\",\n \"text\": \"@Override\\n public void execute() {\\n int op2 = stack.pop();\\n int op1 = stack.pop();\\n stack.push( op1 * op2 );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d7bf9abe928460a6573df397922c8c2a\",\n \"score\": \"0.622277\",\n \"text\": \"private void getOperands(char op) throws NoSuchElementException \\n\\t{\\n\\t\\t// TODO \\n\\t\\tif(op=='~') {\\n\\t\\t\\tif(operandStack.size()<1) {\\n\\t\\t\\t\\tthrow new NoSuchElementException();\\n\\t\\t\\t}\\n\\t\\t\\trightOperand=operandStack.pop();\\n\\t\\t}\\n\\t\\telse if(isOperator(op) && op!='~') {\\n\\t\\t\\tif(operandStack.size()<2) {\\n\\t\\t\\t\\tthrow new NoSuchElementException();\\n\\t\\t\\t}\\n\\t\\t\\trightOperand=operandStack.pop();\\n\\t\\t\\tleftOperand=operandStack.pop();\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"16733ca26b9c5ba5d88f012123a02434\",\n \"score\": \"0.62140405\",\n \"text\": \"private void execute(StackInterface<Object> valStack) {\\n\\t\\t// variables to store the double values\\n\\t\\tArrayStack<Double> operandStack = new ArrayStack<>();\\n\\t\\tDouble tempVal = 0.0;//temp variable to store the expression value\\n\\t\\tString operator = \\\"\\\";\\n\\t\\t\\n\\t\\t// return if the value stack is empty\\n\\t\\tif (valStack.isEmpty())\\n\\t\\t\\treturn;\\n\\t\\t// pop the opStack\\n\\t\\t\\n\\t\\tObject op = valStack.pop();//pop the doubele value\\n\\n while ( op instanceof Double ) \\n {\\n double value = (double) op;\\n operandStack.push(value);//if it is a double value push into stack\\n op = valStack.pop();//the last one popped will be the operator\\n }\\n\\n operator = op.toString() ;\\n\\t\\t// based on the operator - do the operations\\n\\t\\tswitch (operator) {\\n\\t\\tcase \\\"+\\\":\\n\\t\\t\\t// temporary variable to store result\\n\\t\\t\\ttempVal = 0.0;\\n\\t\\t\\twhile (!operandStack.isEmpty())//pop the double values and perform operations\\n\\t\\t\\t\\ttempVal = tempVal + operandStack.pop();\\n\\t\\t\\tbreak;\\n\\t\\tcase \\\"-\\\":\\n\\t\\t\\t// temporary variable to store result\\n\\t\\t\\ttempVal = 0.0;\\n\\t\\t\\ttempVal = operandStack.pop();\\n\\t\\t\\t//if there is just one value then answer is -a\\n if (operandStack.isEmpty()) {\\n tempVal = -tempVal;\\n }\\n else {\\n //case 2: there are many numbers\\n while(!operandStack.isEmpty()) {//pop the double values and perform operations\\n tempVal = tempVal - operandStack.pop();\\n }\\n \\n }\\n\\t\\t\\t\\n\\t\\t\\n\\t\\t\\tbreak;\\n\\t\\tcase \\\"*\\\":\\n\\t\\t\\t// temporary variable to store result\\n\\t\\t\\ttempVal = 1.0;\\n\\t\\t\\twhile (!operandStack.isEmpty())//pop the double values and perform operations\\n\\t\\t\\t\\ttempVal = tempVal * operandStack.pop();\\n\\t\\t\\t\\n\\t\\t\\tbreak;\\n\\t\\tcase \\\"/\\\":\\n\\t\\t\\t// temporary variable to store result\\n\\t\\t\\ttempVal = 1.0;\\n\\t\\t\\ttempVal = operandStack.pop();\\n\\t\\t\\t//if there is just one value answer is 1/a\\n\\t\\t\\tif(operandStack.isEmpty())\\n\\t\\t\\t{\\n\\t\\t\\t\\ttempVal = 1/tempVal;\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{//more than 1 value\\n\\t\\t\\twhile (!operandStack.isEmpty())//pop the double values and perform operations\\n\\t\\t\\t\\ttempVal = tempVal / operandStack.pop();\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\t// store the result on top of valstack\\n\\t\\t\\n\\t\\tvalStack.push(tempVal);\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"889a237c1e1563be6af91bee2495cdb3\",\n \"score\": \"0.616334\",\n \"text\": \"public static void processExpression (Token inputToken, TokenReader tr)\\n\\t{\\n\\t\\tValueStack vStack = new ValueStack();\\n\\t\\tOperatorStack opStack = new OperatorStack();\\n\\n\\t\\t/* Loop until the expression reaches its End */\\n\\t\\twhile (inputToken.equalsType(TokenType.EOLN) == false)\\n\\t\\t{\\n\\t\\t\\t/* The expression contain a VALUE */\\n\\t\\t\\tif (inputToken.equalsType(TokenType.VALUE))\\n\\t\\t\\t{\\n\\t\\t\\t\\t/* make this a debugMode statement */\\n\\t\\t\\t\\tif(debugMode)\\n\\t\\t\\t\\t\\tSystem.out.print (\\\"Val: \\\" + inputToken.getValue() + \\\", \\\"); \\n\\n\\t\\t\\t\\t// add code to perform this operation here\\n\\t\\t\\t\\tvStack.push(inputToken.getValue());\\n\\t\\t\\t}\\n\\n\\t\\t\\t/* The expression contains an OPERATOR */\\n\\t\\t\\tif (inputToken.equalsType(TokenType.OPERATOR))\\n\\t\\t \\t{\\n\\t\\t\\t\\t/* make this a debugMode statement */\\n\\t\\t\\t\\tif(debugMode)\\n\\t\\t\\t\\tSystem.out.print (\\\"OP: \\\" + inputToken.getOperator() + \\\", \\\");\\n\\n\\t\\t\\t\\t// add code to perform this operation here\\n\\t\\t\\t\\tif(inputToken.getOperator() == '(')\\n\\t\\t\\t\\t\\topStack.push('(');\\n\\n\\t\\t\\t\\tif(inputToken.getOperator() == '+' || inputToken.getOperator() == '-')\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\twhile(!opStack.isEmpty() && (opStack.top() == '+' || opStack.top() == '-' || opStack.top() == '*' || opStack.top() == '/'))\\n\\t\\t\\t\\t\\t\\tpopAndEvaluate(opStack, vStack);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\topStack.push(inputToken.getOperator());\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(inputToken.getOperator() == '*' || inputToken.getOperator() == '/')\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\twhile(!opStack.isEmpty() && (opStack.top() == '*' || opStack.top() == '/'))\\n\\t\\t\\t\\t\\t\\tpopAndEvaluate(opStack, vStack);\\n\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\topStack.push(inputToken.getOperator());\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(inputToken.getOperator() == ')')\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\twhile(!opStack.isEmpty() && opStack.top() != '(')\\n\\t\\t\\t\\t\\t\\tpopAndEvaluate(opStack, vStack);\\n\\t\\t\\t\\t\\tif(opStack.isEmpty())\\n\\t\\t\\t\\t\\t\\tSystem.out.println(\\\"Error\\\");\\n\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\topStack.pop();\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\t/* get next token from input */\\n\\t\\t inputToken = tr.getNextToken ();\\n\\t\\t} \\n\\n\\t\\t/* The expression has reached its end */\\n\\n\\t\\t// add code to perform this operation here\\n\\t\\twhile(!opStack.isEmpty())\\n\\t\\t\\tpopAndEvaluate(opStack, vStack);\\n\\t\\t\\n\\t\\tSystem.out.print(\\\"\\\\n\\\");\\n\\t\\tSystem.out.println(vStack.topPop());\\n\\t\\t\\t\\n\\t\\tif(!vStack.isEmpty())\\n\\t\\t\\tSystem.out.println(\\\"Error\\\");\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3fda9b778928c131243f75d2a2be12f0\",\n \"score\": \"0.6149172\",\n \"text\": \"private void movePreviousOperatorsFromStackToPostfix(Operator currentOperator) {\\n while (!this.tokenStack.isEmpty() && this.tokenStack.peek() != Parenthesis.LEFT) {\\n Operator prevOperator = (Operator) this.tokenStack.peek();\\n if (currentOperator.hasLowerPrecedence(prevOperator)\\n || (currentOperator.hasEqualPrecedence(prevOperator) && prevOperator.hasLeftAssociativity())) {\\n moveTopFromStackToPostfix();\\n } else {\\n return;\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b21d18a8f918263993ee1f57a49da4ce\",\n \"score\": \"0.610652\",\n \"text\": \"private static int evaluateExpression(String expression) {\\r\\n\\t\\t//first create 2 stack to save operands and operators\\r\\n\\t\\tStack<Integer> operandStack = new Stack<>();\\r\\n\\t\\tStack<Character> operatorStack = new Stack<>();\\r\\n\\t\\t\\r\\n\\t\\t//we cannot easily distinguish operators and operands just by operating string\\r\\n\\t\\texpression = insertBlanks(expression);\\r\\n\\t\\tString[] tokens = expression.split(\\\" \\\");\\r\\n\\t\\t\\r\\n\\t\\tfor ( int i = 0 ; i < tokens.length ; i ++)\\r\\n\\t\\t\\tSystem.out.print(tokens[i]+\\\" \\\");\\r\\n\\t\\t\\r\\n\\t\\tfor( String token : tokens) {\\r\\n\\t\\t\\tif ( token.length()==0 || token.charAt(0)==' ') {\\r\\n\\t\\t\\t\\tcontinue;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\telse if ( (token.trim().charAt(0) =='+' ||token.trim().charAt(0)=='-') && operandStack.size() > 1 ) {\\r\\n\\t\\t\\t\\tif ( operatorStack.peek() == '+' || operatorStack.peek() == '-') {\\r\\n\\t\\t\\t\\t\\tprocessAnOperator(operandStack,operatorStack);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\twhile ( !operatorStack.isEmpty() && (operatorStack.peek() == '+'||\\r\\n\\t\\t\\t\\t\\t\\toperatorStack.peek()=='-'||operatorStack.peek()=='*'||operatorStack.peek()=='/')) {\\r\\n\\t\\t\\t\\t\\tprocessAnOperator(operandStack,operatorStack);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\toperatorStack.push(token.charAt(0));\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\telse if ( token.trim().charAt(0) == '/' ||token.trim().charAt(0) == '*') {\\r\\n\\t\\t\\t\\twhile ( !operatorStack.isEmpty() &&( operatorStack.peek()=='*'||\\r\\n\\t\\t\\t\\t\\t\\toperatorStack.peek()=='/')){\\r\\n\\t\\t\\t\\t\\t\\t\\tprocessAnOperator(operandStack,operatorStack);\\r\\n\\t\\t\\t\\t\\t\\t} \\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\toperatorStack.push(token.charAt(0));\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//******\\r\\n\\t\\t\\telse if ( token.trim().charAt(0) ==')') {\\r\\n\\t\\t\\t\\twhile ( operatorStack.peek() != '(') {\\r\\n\\t\\t\\t\\t\\tprocessAnOperator(operandStack,operatorStack);\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\toperatorStack.pop();\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t//if Integer, convert it and push it in the number stack\\r\\n\\t\\t\\telse {\\r\\n\\t\\t\\t\\tSystem.out.println(\\\"line 66 \\\"+ token.charAt(0));\\r\\n\\t\\t\\t\\toperandStack.push(Integer.parseInt(token.charAt(0)+\\\"\\\")); \\r\\n\\t\\t\\t}\\r\\n\\t\\t} \\r\\n\\t\\t\\r\\n\\t\\twhile ( !operatorStack.isEmpty()) {\\r\\n\\t\\t\\tprocessAnOperator(operandStack,operatorStack);\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\treturn operandStack.pop();\\r\\n\\t\\t\\r\\n\\t\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0f7f2311ba34c3c3b01ecd0c15678f25\",\n \"score\": \"0.6098167\",\n \"text\": \"private static CompoundExpression parseOperator(String str, char operator, Function<String, Expression> parseLeftSubexpression, Function<String, Expression> parseRightSubexpression)\\n\\t{\\t\\t\\n\\t\\tfor(int i = 1; i < str.length() - 1; i++)\\n\\t\\t{\\n\\t\\t\\tif(str.charAt(i) == operator)\\n\\t\\t\\t{\\n\\t\\t\\t\\tExpression leftSubexpression = parseLeftSubexpression.apply(str.substring(0, i));\\n\\t\\t\\t\\tExpression rightSubexpression = parseRightSubexpression.apply(str.substring(i + 1));\\n\\t\\t\\t\\tif(leftSubexpression != null && rightSubexpression != null)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tCompoundExpression compoundExpression = new CompoundExpressionNode(\\\"\\\" + operator);\\n\\t\\t\\t\\t\\tcompoundExpression.addSubexpression(leftSubexpression);\\n\\t\\t\\t\\t\\tleftSubexpression.setParent(compoundExpression);\\n\\t\\t\\t\\t\\t((HBox)compoundExpression.getNode()).getChildren().add(0, leftSubexpression.getNode());\\n\\t\\t\\t\\t\\tcompoundExpression.addSubexpression(rightSubexpression);\\n\\t\\t\\t\\t\\trightSubexpression.setParent(compoundExpression);\\n\\t\\t\\t\\t\\t((HBox)compoundExpression.getNode()).getChildren().add(rightSubexpression.getNode());\\n\\t\\t\\t\\t\\treturn compoundExpression;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn null;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c154172c0901a1ffc03f0bfbafd29728\",\n \"score\": \"0.6080868\",\n \"text\": \"private void doOperation(BinaryOperator operator) {\\n int op1 = Integer.parseInt(num1.getText().toString());\\n int op2 = Integer.parseInt(num2.getText().toString());\\n result.setText(String.valueOf(operator.operate(op1, op2)));\\n operator.printOperands(op1, op2);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"20061e8eaf11fb1eb7b289b4bc569b8a\",\n \"score\": \"0.6044436\",\n \"text\": \"Operator getOperator();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a6ded8dbc60e8d2584a6fa80821b8ee\",\n \"score\": \"0.59611\",\n \"text\": \"private void pop(Stack<String> operators, Stack<ExpressionTree> operands, boolean sawParen) {\\r\\n do {\\r\\n String operator = operators.pop();\\r\\n \\r\\n //Stop looping if we see a '('\\r\\n if(operator.charAt(0) == '(')\\r\\n return;\\r\\n \\r\\n //Get the peices to be merged together\\r\\n ExpressionTree rightItem = operands.pop();\\r\\n ExpressionTree leftItem = null;\\r\\n \\r\\n //If it's not a ! pop another thing off\\r\\n if(operator.charAt(0) != '!') {\\r\\n leftItem = operands.pop();\\r\\n }\\r\\n //Put the merged tree back onto the operands stack\\r\\n //Standard case\\r\\n if(leftItem != null) {\\r\\n operands.push(new ExpressionTree(new Node(leftItem.root, operator, rightItem.root)));\\r\\n // it must be a ! case \\r\\n } else {\\r\\n operands.push(new ExpressionTree(new Node(null, operator, rightItem.root)));\\r\\n }\\r\\n } while (sawParen);\\r\\n \\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dab3ff54f38daaacd0d9a5f1c6bc0d23\",\n \"score\": \"0.58713204\",\n \"text\": \"private void checkOperator() {\\n// String input=\\\"123\\\";\\n// String[] inputArray=input.split(\\\"\\\");\\n// Stack<String> stack=new Stack<String>();\\n// stack.push(\\\"\\\");\\n//\\n//\\n// stack.pop();\\n\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"36a7962fee7cec076982249d9184bb68\",\n \"score\": \"0.58608687\",\n \"text\": \"@Override\\n public Object visit(Arithmetic arithmetic, Object o) {\\n arithmetic.getLeftExpression().accept(this, o);\\n codeGenerator.convert(arithmetic.getLeftExpression().getType(), arithmetic.getType());\\n arithmetic.getRightExpression().accept(this, o);\\n codeGenerator.convert(arithmetic.getRightExpression().getType(), arithmetic.getType());\\n\\n codeGenerator.arithmetic(arithmetic.getOperator(), arithmetic.getType());\\n return null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b8f8935d014eb116cfab39daadcf9c21\",\n \"score\": \"0.5830197\",\n \"text\": \"private static char getOperator(LinkedList<Character> queue) { \\n if (queue.isEmpty())\\n throw new IllegalStateException(\\\"Too little input.\\\");\\n while (queue.getFirst() == ' ')\\n queue.removeFirst(); // remove any empty space\\n \\n char op = queue.removeFirst(); // get the operator\\n if (op == '*' || op == '-' || op == '+')\\n return op;\\n else\\n throw new IllegalArgumentException(\\\"Wrong operator.\\\");\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"184ef8d37943dc6086f25afbb47565bb\",\n \"score\": \"0.5829129\",\n \"text\": \"public void execute(OperationsStack stack) {\\n\\t\\tDouble value1 = stack.pop();\\n\\t\\t\\n\\t\\tDouble value2 = stack.pop();\\n\\t\\tBinaryValues binaryValues = new BinaryValues(value2, value1);\\n\\t\\tstack.push(calculate(binaryValues));\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7459882b251cc598a184b276f6fae9af\",\n \"score\": \"0.5809052\",\n \"text\": \"private void nextOp() {\\n\\t\\tint old=pos;\\n\\t\\tpos=old+2;\\n\\t\\tif (!done()) {\\n\\t\\t\\tString lexeme=program.substring(old,pos);\\n\\t\\t\\tif (operators.contains(lexeme)) {\\n\\t\\t\\t\\ttoken=new Token(lexeme);\\n\\t\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tpos=old+1;\\n\\t\\tString lexeme=program.substring(old,pos);\\n\\t\\ttoken=new Token(lexeme);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"382e55f65c8dc0e962aeee4dbddb70b3\",\n \"score\": \"0.5803882\",\n \"text\": \"public void visit(UnaryOperator n);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"57bc9153b6505f90f32217742985ee1e\",\n \"score\": \"0.57823086\",\n \"text\": \"@Override\\n public void execute() {\\n int op2 = stack.pop();\\n int op1 = stack.pop();\\n stack.push( op1 - op2 );\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"81075d4836fe8c47ad30e2d3b95609eb\",\n \"score\": \"0.5781201\",\n \"text\": \"@Override\\n public void execute() {\\n int op1 = stack.pop();\\n int n = -op1;\\n stack.push(n);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d1e297935314758e444a4efa0fb12a87\",\n \"score\": \"0.5772797\",\n \"text\": \"public Expression getOperatorExpression(OperatorType operator) throws IllegalArgumentException;\",\n \"title\": \"\"\n },\n {\n \"docid\": \"63e28dc410175338f7e7ff9f38c5464c\",\n \"score\": \"0.57471937\",\n \"text\": \"private void evaluate() {\\n\\t\\t// arraystack and linkedstack to store the operators and values\\n\\t\\t// respectively\\n\\n\\t\\tArrayStack<Object> valStack = new ArrayStack<>();\\n\\t\\t// for each token do the following\\n\\t\\tfor (String temp : tokens) {\\n\\t\\t\\t// check if token is an operator\\n\\t\\t\\tif (operatorCheck(temp)) \\n\\t\\t\\t\\tvalStack.push(temp);\\n\\t\\t\\t // if the token is an open bracket continue\\n\\t\\t\\telse if (temp.equals(\\\"(\\\"))\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\telse if (temp.equals(\\\")\\\")) {// if the token is closed bracket\\n\\t\\t\\t\\t// then pop the stack and evaluate\\n\\t\\t\\t\\t\\texecute(valStack);\\n\\t\\t\\t\\t\\n\\t\\t\\t} else // if the token is a value - convert it into double and push\\n\\t\\t\\t\\t\\t// into valstack\\n\\t\\t\\t{\\n\\t\\t\\t\\tDouble val = Double.parseDouble(temp);\\n\\t\\t\\t\\tvalStack.push(val);\\n\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\t\\t// while the opstack is not empty- execute the operations on the values\\n\\t\\twhile (!valStack.isEmpty()) {\\n\\t\\t\\tif (valStack.size() == 1)// if the valstack size is 1- pop the result\\n\\t\\t\\t{\\n\\t\\t\\t\\tresult = (double) valStack.pop();\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\t//else continue operations\\n\\t\\t\\texecute(valStack);\\n\\t\\t\\n\\t\\t\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4c79ce6f68bef899b54f2505ecc99a1a\",\n \"score\": \"0.57435787\",\n \"text\": \"public abstract Expression getPreviousOperator();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c03e0dd184f78548feffb73994391e42\",\n \"score\": \"0.5735572\",\n \"text\": \"OperatorExpression createOperatorExpression();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"44f4179b1653a748390ef34d167ad92e\",\n \"score\": \"0.5727163\",\n \"text\": \"public void doConversion() {\\n\\t\\t// TODO: read infix from input using readInfix(), then convert it to\\n\\t\\t// postfix and print it out\\n\\t\\tString[] infix = readInfix();\\n\\n\\t\\tString[] postfix = new String[infix.length];\\n\\t\\tStack stack = new Stack(infix.length);\\n\\t\\t\\n\\t\\tfor (int i = 0; i < infix.length; i++) {\\n\\t\\t\\tSystem.out.println(infix[i]);\\n\\n\\t\\t\\tif (infix[i].equals(\\\"(\\\")) {\\n\\t\\t\\t\\tString operator = infix[i];\\n\\t\\t\\t\\tstack.push(operator);\\n\\t\\t\\t} else if (infix[i].equals(\\\")\\\")) {\\n\\t\\t\\t\\tfor (int j = Stack.getTop(); Stack.list[j].equals(\\\"(\\\"); j--)\\n\\t\\t\\t\\t\\tpostfix[postfix.length + 1] = stack.list[Stack.getTop()];\\n\\t\\t\\t\\tstack.pop();\\n\\t\\t\\t} else if (infix[i].equals(\\\"+\\\") || infix[i].equals(\\\"-\\\") || infix[i].equals(\\\"*\\\") || infix[i].equals(\\\"/\\\")\\n\\t\\t\\t\\t\\t|| infix[i].equals(\\\"^\\\")) {\\n\\t\\t\\t\\tString operator = infix[i];\\n\\n\\t\\t\\t\\tif (stack.isEmpty()) {\\n\\t\\t\\t\\t\\tstack.push(operator);\\n\\t\\t\\t\\t} else if (i == infix.length - 1) {\\n\\t\\t\\t\\t\\tpostfix[postfix.length + 1] = stack.list[Stack.getTop()];\\n\\t\\t\\t\\t\\tstack.pop();\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tif (precedence(operator) > precedence(stack.list[Stack.getTop()])) {\\n\\t\\t\\t\\t\\t\\tstack.push(operator);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tpostfix[postfix.length + 1] = stack.list[Stack.getTop()];\\n\\t\\t\\t\\t\\t\\tstack.pop();\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tpostfix[i] = infix[i];\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\t\\tfor (int j = 0; j < postfix.length; j++) {\\n\\t\\t\\tSystem.out.println(postfix[j]);\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"27b1771808f8606b7c81a28c1d3d15ef\",\n \"score\": \"0.5716489\",\n \"text\": \"public final MeteorParser.operatorExpression_return operatorExpression() throws RecognitionException {\\n MeteorParser.operatorExpression_return retval = new MeteorParser.operatorExpression_return();\\n retval.start = input.LT(1);\\n\\n\\n EvaluationExpression root_0 = null;\\n\\n MeteorParser.operator_return op =null;\\n\\n\\n RewriteRuleSubtreeStream stream_operator=new RewriteRuleSubtreeStream(adaptor,\\\"rule operator\\\");\\n try {\\n // /home/arv/workspace/ozone-meteor/meteor/meteor-meteor/src/main/java/eu/stratosphere/meteor/Meteor.g:217:2: (op= operator -> ^( EXPRESSION[\\\\\\\"NestedOperatorExpression\\\\\\\"] ) )\\n // /home/arv/workspace/ozone-meteor/meteor/meteor-meteor/src/main/java/eu/stratosphere/meteor/Meteor.g:217:4: op= operator\\n {\\n pushFollow(FOLLOW_operator_in_operatorExpression1564);\\n op=operator();\\n\\n state._fsp--;\\n if (state.failed) return retval;\\n if ( state.backtracking==0 ) stream_operator.add(op.getTree());\\n\\n // AST REWRITE\\n // elements: \\n // token labels: \\n // rule labels: retval\\n // token list labels: \\n // rule list labels: \\n // wildcard labels: \\n if ( state.backtracking==0 ) {\\n\\n retval.tree = root_0;\\n RewriteRuleSubtreeStream stream_retval=new RewriteRuleSubtreeStream(adaptor,\\\"rule retval\\\",retval!=null?retval.tree:null);\\n\\n root_0 = (EvaluationExpression)adaptor.nil();\\n // 217:16: -> ^( EXPRESSION[\\\\\\\"NestedOperatorExpression\\\\\\\"] )\\n {\\n // /home/arv/workspace/ozone-meteor/meteor/meteor-meteor/src/main/java/eu/stratosphere/meteor/Meteor.g:217:19: ^( EXPRESSION[\\\\\\\"NestedOperatorExpression\\\\\\\"] )\\n {\\n EvaluationExpression root_1 = (EvaluationExpression)adaptor.nil();\\n root_1 = (EvaluationExpression)adaptor.becomeRoot(\\n (EvaluationExpression)adaptor.create(EXPRESSION, \\\"NestedOperatorExpression\\\")\\n , root_1);\\n\\n adaptor.addChild(root_1, (op!=null?op.op:null) );\\n\\n adaptor.addChild(root_0, root_1);\\n }\\n\\n }\\n\\n\\n retval.tree = root_0;\\n }\\n\\n }\\n\\n retval.stop = input.LT(-1);\\n\\n\\n if ( state.backtracking==0 ) {\\n\\n retval.tree = (EvaluationExpression)adaptor.rulePostProcessing(root_0);\\n adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);\\n }\\n }\\n\\n catch (RecognitionException e) {\\n throw e;\\n }\\n\\n finally {\\n \\t// do for sure before leaving\\n }\\n return retval;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7a3e5f91218e33a0e8a2e592a600edf8\",\n \"score\": \"0.5715942\",\n \"text\": \"public void expr() {\\r\\n\\t\\tfactor();\\r\\n\\t\\twhile (addop()) {\\r\\n\\t\\t\\tlexer.nextToken();\\r\\n\\t\\t\\tfactor();\\r\\n\\t\\t}\\r\\n\\t\\t/*if (!addop() && !compop() && lexer.token != Symbol.RPAR)\\r\\n\\t\\t\\terror.signal(\\\"Operador não suportado, esperava + ou -\\\");*/\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2eb7de814ff245ea2fb3a8ee663c8c3e\",\n \"score\": \"0.5705558\",\n \"text\": \"private void getOperands() throws NoSuchElementException \\n\\t{\\n\\t\\tif(operandStack.size() < 2) throw new NoSuchElementException(); \\n\\t\\trightOperand = operandStack.pop(); \\n\\t\\tleftOperand = operandStack.pop(); \\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"094486b4b62053ea18b0ba48d9bb82bf\",\n \"score\": \"0.56861866\",\n \"text\": \"private static String doOperation(String lhs, char operator, String rhs) {\\n try {\\n BigDecimal bdLhs = new BigDecimal(lhs);\\n BigDecimal bdRhs = new BigDecimal(rhs);\\n switch(operator) {\\n case '^':\\n return \\\"\\\" + Math.pow(bdLhs.doubleValue(), bdRhs.doubleValue());\\n case '*':\\n return \\\"\\\" + bdLhs.multiply(bdRhs).toString();\\n case '/':\\n return \\\"\\\" + bdLhs.divide(bdRhs, MC).toString();\\n case '+':\\n return \\\"\\\" + bdLhs.add(bdRhs).toString();\\n case '%':\\n return \\\"\\\" + bdLhs.remainder(bdRhs).toString();\\n default:\\n return \\\"\\\";\\n }\\n } catch(NumberFormatException e) {\\n infinityFlag = true; // infinity or NaN\\n return \\\"\\\";\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bedf0916cdf6c65dcbad5700dc50adaf\",\n \"score\": \"0.5677859\",\n \"text\": \"public void setOperator(String operator) {\\r\\n this.operator = operator;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ca06e526a69cc2ebe21c70578cf788ea\",\n \"score\": \"0.56772166\",\n \"text\": \"public Expression(String operator) {\\n this.operator = operator;\\n operands = new ArrayList<Object>(3);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5abeb31e6c732bcdbf5191fd109faac6\",\n \"score\": \"0.5675935\",\n \"text\": \"public static void evaluate(String token){\\n if (isExclamation(token)){\\n evaluateExclamation(token);\\n }\\n try{\\n int top = stack.pop();\\n switch (token){\\n case \\\"+\\\":\\n int next = stack.pop();\\n stack.push(next+top);\\n break;\\n case \\\"-\\\":\\n next = stack.pop();\\n stack.push(next-top);\\n break;\\n case \\\"*\\\":\\n next = stack.pop();\\n stack.push(next*top);\\n break;\\n case \\\"%\\\":\\n next = stack.pop();\\n stack.push(next%top);\\n break;\\n case \\\"/\\\":\\n next = stack.pop();\\n stack.push(next/top);\\n break;\\n case \\\"o\\\":\\n next = stack.pop(); \\n System.out.print(top + \\\" \\\");\\n stack.push(next);\\n stack.push(top);\\n break;\\n case \\\"d\\\":\\n stack.push(top);\\n stack.push(top);\\n break;\\n case \\\"c\\\":\\n if (top < 0){\\n System.out.println(\\\"Error: negative copy\\\");\\n stack.removeAllElements();\\n }else{\\n next = stack.pop();\\n for (int i = 0; i < top; i++){\\n stack.push(next);\\n }\\n }\\n break;\\n case \\\"r\\\":\\n stack.push(top);\\n evaluateRoll();\\n break;\\n case \\\"(\\\":\\n stack.push(top);\\n evaluateParentheses();\\n break;\\n }\\n if (!arrayRep.isEmpty()){\\n if (isExclamation(arrayRep.get(index-1))){\\n stack.push(top);\\n }\\n }\\n }catch (EmptyStackException e){\\n System.out.println(\\\"Error: too few operands\\\");\\n }catch (ArithmeticException e){\\n System.out.println(\\\"Error: division by 0\\\");\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e5c6add34983971f472034d7c516e7d5\",\n \"score\": \"0.5669196\",\n \"text\": \"public void setOperator(String operator) {\\n this.operator = operator;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e5c6add34983971f472034d7c516e7d5\",\n \"score\": \"0.5669196\",\n \"text\": \"public void setOperator(String operator) {\\n this.operator = operator;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7dd071f66e44d34f7d12acd983c8d9e3\",\n \"score\": \"0.5666978\",\n \"text\": \"private void build(Operator operator)\\n {\\n assert m_plan != null;\\n operator.accept(this);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a19f5826c1c8f254af58e1d6085250e0\",\n \"score\": \"0.56664455\",\n \"text\": \"public Object getOperand();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"adb26db1a51168598ea26a262305f855\",\n \"score\": \"0.56560177\",\n \"text\": \"private Expression parseExpressionWithPrecedenceClimbing(int minPrecedence) {\\n Expression result = parseUnaryExpression();\\n while (isCurrentTokenBinaryOperator()\\n && isOperatorPrecedenceGreaterOrEqualThan(minPrecedence)) {\\n Expression.BinOp operator = getBinaryOperator(currentToken);\\n int precedence = currentToken.precedence();\\n if (currentToken.associativity() == LEFT) {\\n precedence++;\\n }\\n consumeToken();\\n Expression rhs = parseExpressionWithPrecedenceClimbing(precedence);\\n SourcePosition begin = result.range().begin;\\n SourcePosition end = rhs.range().end;\\n result = new Expression.BinaryOperator(operator, result, rhs, new SourceRange(begin, end));\\n }\\n return result;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ac86274ef9b94d30a7c705b58d5f829b\",\n \"score\": \"0.56553835\",\n \"text\": \"private static int computeBinaryOperator(int op1,String operator,int op2){\\n\\t\\t\\n\\t\\tswitch(operator){\\n\\t\\t\\n\\t\\tcase \\\"+\\\":\\n\\t\\t\\treturn op1+op2;\\n\\t\\tcase \\\"-\\\":\\n\\t\\t\\treturn op1-op2;\\n\\t\\tcase \\\"*\\\":\\n\\t\\t\\treturn op1*op2;\\n\\t\\tcase \\\"div\\\":\\n\\t\\t\\treturn op1/op2;\\n\\t\\tdefault:\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"198168e85b0a78865cdc0258a2cd1a71\",\n \"score\": \"0.56544155\",\n \"text\": \"void evaluation(List<String> postfix){\\n\\t\\t// stack is used to store the operands\\n\\t\\tStack<String> s = new Stack<>();\\n\\n\\t\\tfor(int i = 0;i<postfix.size();i++){\\n\\t\\t\\tString c = postfix.get(i);\\n\\n\\t\\t\\tif(isOperator(c)){\\n\\t\\t\\t\\tif(s.size()>1){\\n\\t\\t\\t\\t\\tint operand2 = Integer.parseInt(s.pop());\\n\\t\\t\\t\\t\\tint operand1 = Integer.parseInt(s.pop());\\n\\t\\t\\t\\t\\ts.push(String.valueOf(getResult(operand1, operand2, c)));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}else{\\n\\t\\t\\t\\ts.push(c);\\n\\t\\t\\t}\\n\\t\\t\\tlogTrace(c, s, i);\\n\\t\\t}\\n\\t\\t\\n\\t\\tif(s.size() == 1){\\n\\t\\t\\tSystem.out.println(s.pop());\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"87680ef8d8af66d78558c14aabe3ca69\",\n \"score\": \"0.5647028\",\n \"text\": \"private Expression parsePostfixOp(Expression lhs) {\\n switch (currentToken.terminal) {\\n case PERIOD:\\n return parseDotIdentFieldAccessMethodInvocation(lhs);\\n case LBRACK:\\n return parseArrayAccess(lhs);\\n default:\\n return unexpectCurrentToken(PERIOD, LBRACK);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"addc4706b0358c63de56d3cd3dbd00ea\",\n \"score\": \"0.5646621\",\n \"text\": \"private int getPrecedence(String operator) {\\r\\n\\t\\tswitch (operator) {\\r\\n\\t\\tcase \\\"!\\\":\\r\\n\\t\\t\\treturn 1;\\r\\n\\t\\tcase \\\"*\\\":\\r\\n\\t\\tcase \\\"/\\\":\\r\\n\\t\\t\\treturn 2;\\r\\n\\t\\tcase \\\"+\\\":\\r\\n\\t\\tcase \\\"-\\\":\\r\\n\\t\\t\\treturn 3;\\r\\n\\t\\tcase \\\"<\\\":\\r\\n\\t\\tcase \\\">\\\":\\r\\n\\t\\tcase \\\"<=\\\":\\r\\n\\t\\tcase \\\">=\\\":\\r\\n\\t\\t\\treturn 4;\\r\\n\\t\\tcase \\\"==\\\":\\r\\n\\t\\tcase \\\"!=\\\":\\r\\n\\t\\t\\treturn 5;\\r\\n\\t\\tcase \\\"&&\\\":\\r\\n\\t\\t\\treturn 6;\\r\\n\\t\\tcase \\\"||\\\":\\r\\n\\t\\t\\treturn 7;\\r\\n\\t\\tdefault:\\r\\n\\t\\t\\treturn -1;\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"75049ff65529242bfdc3636d0ce51535\",\n \"score\": \"0.56441635\",\n \"text\": \"private String getOp()\\n {\\n switch (getTokenAndAdvance()) {\\n case \\\"+\\\":\\n return \\\"add\\\";\\n case \\\"-\\\":\\n return \\\"sub\\\";\\n case \\\"*\\\":\\n return \\\"call Math.multiply 2\\\";\\n case \\\"/\\\":\\n return \\\"call Math.divide 2\\\";\\n case \\\"&\\\":\\n return \\\"and\\\";\\n case \\\"|\\\":\\n return \\\"or\\\";\\n case \\\"<\\\":\\n return \\\"lt\\\";\\n case \\\">\\\":\\n return \\\"gt\\\";\\n case \\\"=\\\":\\n return \\\"eq\\\";\\n default:\\n throw new IllegalArgumentException(\\\"Operator not found. \\\" + currentInputLine);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f23ea519f44a3c954f289a3e0756e966\",\n \"score\": \"0.56422454\",\n \"text\": \"static int postfixEvaluator(String postfixExpression) throws OverFlowException, StackUnderFlowException \\n\\t{\\n\\t\\t// stack stores the ints in the order they are received and after operations are performed \\n\\t\\tLLStack<Long> stack = new LLStack<Long>();\\n\\t\\t\\n\\t\\t// stores the value of the next integer\\n\\t\\t long value;\\n\\t\\t // stores the next operator\\n\\t\\t String operator;\\n\\t\\t \\n\\t\\t // stores operands 1 and 2\\n\\t\\t long operand1 = 0;\\n\\t\\t long operand2 = 0;\\n\\t\\t \\n\\t\\t //stores the result of a operation\\n\\t\\t long result = 0;\\n\\t\\t \\n\\t\\t // initialize the scanner to scan the postfix expression being evaluated\\n\\t\\t Scanner tokenizer = new Scanner(postfixExpression);\\n\\t\\t \\n\\t\\t //while loop runs until there are no more tokens\\n\\t\\t while (tokenizer.hasNext())\\n\\t\\t {\\n\\t\\t\\t// Process operand\\n\\t\\t if (tokenizer.hasNextInt())\\n\\t\\t {\\n\\t\\t value = tokenizer.nextInt();\\n\\t\\t \\n\\t\\t stack.push(value);\\n\\t\\t }\\n\\t\\t // Process operator\\n\\t\\t else\\n\\t\\t {\\n\\t\\t operator = tokenizer.next();\\n\\t\\t \\n\\t\\t // Obtain first top operand from stack if there are two on the stack\\n\\t\\t\\t if(stack.getLength() > 1)\\n\\t\\t\\t {\\n\\t\\t\\t\\t operand2 = stack.top();\\t \\n\\t\\t\\t stack.pop();\\n\\t\\t\\t }\\n\\t\\t \\n\\t\\t // Obtain second bottom operand from stack.\\n\\t\\t operand1 = stack.top();\\t\\t \\n\\t\\t stack.pop();\\n\\t \\n\\t\\t // Perform operation.\\n\\t\\t switch(operator)\\n\\t\\t {\\n\\t\\t case \\\"/\\\": result = operand1 / operand2;\\n\\t\\t \\t\\t\\tbreak;\\n\\t\\t case \\\"*\\\": result = operand1 * operand2;\\n\\t\\t \\t\\t\\tbreak;\\n\\t\\t case \\\"+\\\": result = operand1 + operand2;\\n\\t\\t \\t\\t\\tbreak;\\n\\t\\t case \\\"-\\\": result = operand1 - operand2;\\n\\t\\t \\t\\t\\tbreak;\\n\\t\\t case \\\"^\\\": result = (int)Math.pow(operand1, operand2);\\n\\t\\t \\t\\t\\tbreak;\\n\\t\\t case \\\"Q\\\": result = (int)Math.sqrt(operand1);\\t \\n\\t\\t \\t\\t\\tstack.push(operand2);\\n\\t\\t \\t\\t\\tbreak;\\n\\t\\t case \\\"C\\\": result = (int)Math.cbrt(operand1);\\n\\t\\t \\t\\t\\tstack.push(operand2);\\n\\t\\t \\t\\t\\tbreak;\\n\\t\\t case \\\"<\\\": result = operand1 << operand2;\\n\\t\\t \\t\\t\\tbreak;\\n\\t\\t case \\\">\\\": result = operand1 >> operand2;\\n\\t\\t \\t\\t\\tbreak;\\n\\t\\t case \\\"%\\\": result = operand1 % operand2;\\n\\t\\t \\t\\t\\tbreak;\\t\\t\\t\\t\\t\\n\\t\\t \\t\\t\\t\\n\\t\\t }// end of switch\\n\\t\\t \\n\\t\\t // Push result of operation onto stack.\\n\\t\\t stack.push(result);\\n\\t\\t \\n\\t\\t }// end of else\\n\\t\\t \\n\\t\\t}// end of while\\n\\t\\t \\n\\t\\t // obtain final result from the stack\\n\\t\\t result = stack.top();\\n\\t\\t stack.pop();\\n\\t\\t \\n\\t\\t // if the result is bigger than an int throw an exception\\n\\t\\t if(result > 2147483647)\\n\\t\\t \\tthrow new OverFlowException(\\\"over flow the result is to big\\\");\\n\\t\\t \\n\\t\\t // Return the final result\\n\\t\\t return (int)result;\\n\\t\\t \\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9e79b834eba4e108c69e81c738938bb6\",\n \"score\": \"0.564223\",\n \"text\": \"public void setOperator(String operator) {\\n this.operator = operator;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc3e0f58d960fc38ebe8c70546bac498\",\n \"score\": \"0.562984\",\n \"text\": \"private void arithmeticLogical(int opcode) {\\n SymbolicValueDescriptor op2 = (SymbolicValueDescriptor)shadowStk.pop();\\n SymbolicValueDescriptor op1 = (SymbolicValueDescriptor)shadowStk.pop();\\n\\n if (op1.getType().isPointer()) {\\n Assert.that(opcode == OP_ADD || opcode == OP_SUB,\\n \\\"Arithmetic: pointer type can only be used in add() or sub() instructions\\\");\\n Assert.that(op2.getType() == INT,\\n \\\"Arithmetic add/sub: expecting second operand to be of integer type; first operand is a pointer\\\");\\n }\\n else if (op2.getType().isPointer()) {\\n Assert.that(opcode == OP_ADD || opcode == OP_SUB,\\n \\\"Arithmetic: pointer type can only be used in add() or sub() instructions\\\");\\n Assert.that(op1.getType() == INT,\\n \\\"Add/subtract instruction: expecting first operand type to integer; second operand is a pointer\\\");\\n }\\n else if (opcode == OP_SHL || opcode == OP_SHR || opcode == OP_USHR) {\\n Assert.that(op2.getType() == INT,\\n \\\"Shift instruction: expecting second operand to be of type integer\\\");\\n }\\n else {\\n Assert.that(op1.getType() == op2.getType(),\\n \\\"Arithmetic/logical: expecting operands to be of the same type\\\");\\n }\\n\\n SymbolicValueDescriptor result = instr.binOp(op1, op2, opcode, shadowStk);\\n shadowStk.push(result);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e69e8b97d9143d8d2c960854cc0061ff\",\n \"score\": \"0.5619809\",\n \"text\": \"private static int performOperation(int operandOne, int operandTwo, char operator)\\r\\n {\\n switch (operator) {\\r\\n case '+':\\r\\n int total;\\r\\n total = operandOne + operandTwo;\\r\\n return total;\\r\\n case '-':\\r\\n total = operandOne - operandTwo;\\r\\n return total;\\r\\n case '*':\\r\\n total = operandOne * operandTwo;\\r\\n return total;\\r\\n case '/':\\r\\n total = operandOne / operandTwo;\\r\\n return total;\\r\\n default:\\r\\n return 0;\\r\\n }\\r\\n //return the total calculated depending on the case\\r\\n return 0;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8d071884631e41291a51a6962b8895bd\",\n \"score\": \"0.56188846\",\n \"text\": \"public abstract void setPreviousOperator(Expression e);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"56c2506c541e5b0ceea3aa18cbf2c9fe\",\n \"score\": \"0.5599511\",\n \"text\": \"interface AInstr {\\n public Stack<Double> oper(Stack<Double> s);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1c496af8ad0de3980f8ccb7b15e8aa63\",\n \"score\": \"0.5569224\",\n \"text\": \"public static void doOp() {\\n\\t\\tboolean key = false;\\n\\t\\t\\n\\t\\t//Pops the necessary elements from the stacks: two doubles and one string representing the operation\\n\\t\\tx = (double) valStk.pop();\\n\\t y = (double) valStk.pop();\\n\\t op = (String) opStk.pop();\\n\\t \\n\\t //If the operation is equal to + perform the addition\\n\\t if(\\\"+\\\".contentEquals(op)) {\\n\\t\\t result= y+x;\\n\\t\\t valStk.push(result);\\n\\t\\t \\n\\t }\\n\\t //If the operation is equal to - perform the subtraction\\n\\t else if(\\\"-\\\".contentEquals(op)) {\\n\\t\\t result=y-x;\\n\\t\\t valStk.push(result);\\n\\t\\t \\n\\t }\\n\\t //If the operation is equal to * perform the multiplication\\n\\t else if(\\\"*\\\".contentEquals(op)) {\\n\\t\\t result=y*x;\\n\\t\\t valStk.push(result);\\n\\t\\t \\n\\t }\\n\\t //If the operation is equal to / perform the division\\n\\t else if(\\\"/\\\".contentEquals(op)) {\\n\\t\\t result=y/x;\\n\\t\\t valStk.push(result);\\n\\t\\t\\n\\t }\\n\\t //If the operation is equal to ^ perform the power\\n\\t else if(\\\"^\\\".contentEquals(op)) {\\n\\t\\t result=power(y,x);\\n\\t\\t valStk.push(result);\\n\\t\\t\\n\\t }\\n\\t //If the operation is equal to ! perform the factorial\\n\\t else if(\\\"!\\\".contentEquals(op)) {\\n\\t\\t result= factorial(x);\\n\\t\\t valStk.push(result);\\n\\t\\t \\n\\t }\\n\\t //If the operation is equal to > perform the boolean exp\\n\\t else if(\\\">\\\".contentEquals(op)) {\\n\\t\\t result = (y > x ? 1 : 0);\\n\\t\\t valStk.push(result);\\n\\t\\n\\t }\\n\\t //If the operation is equal to < perform the boolean exp\\n\\t else if(\\\"<\\\".contentEquals(op)) {\\n\\t\\t result = (y < x ? 1 : 0);\\n\\t\\t valStk.push(result);\\n\\t\\t \\n\\t }\\n\\t //If the operation is equal to >= perform the boolean exp\\n\\t else if(\\\">=\\\".contentEquals(op)) {\\n\\t\\t result = (y >= x ? 1 : 0);\\n\\t\\t valStk.push(result);\\n\\t\\t\\n\\t }\\n\\t //If the operation is equal to <= perform the boolean exp\\n\\t else if(\\\"<=\\\".contentEquals(op)) { \\n\\t\\t result = (y <= x ? 1 : 0);\\n\\t\\t valStk.push(result);\\n\\t\\t \\n\\t }\\n\\t //If the operation is equal to == perform the boolean exp\\n\\t else if(\\\"==\\\".contentEquals(op)) {\\n\\t\\t result = (y == x ? 1 : 0);\\n\\t\\t valStk.push(result);\\n\\t\\t \\n\\t }\\n\\t //If the operation is equal to != perform the boolean exp\\n\\t else if(\\\"!=\\\".contentEquals(op)) {\\n\\t\\t result = (y != x ? 1 : 0);\\n\\t\\t valStk.push(result);\\n\\t\\t \\n\\t }\\n\\t \\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fae91a6001e40a625f71409aebfb76e0\",\n \"score\": \"0.5564359\",\n \"text\": \"private void operate(){\\n switch(operator){\\n case '+':\\n if(!firstResult){\\n result = num1Set + num2Set;\\n firstResult = true;\\n }\\n else\\n result += num2Set;\\n\\n break;\\n case '-':\\n if(!firstResult){\\n result = num1Set - num2Set;\\n firstResult = true;\\n }\\n else\\n result -= num2Set;\\n break;\\n case '*':\\n if(!firstResult){\\n result = num1Set * num2Set;\\n firstResult = true;\\n }\\n else\\n result *= num2Set;\\n break;\\n case '/':\\n if(!firstResult){\\n result = num1Set / num2Set;\\n firstResult = true;\\n }\\n else\\n result /= num2Set;\\n\\n break;\\n }\\n numDisplay.setText(Double.toString(result));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7013aeefcd9ac4f3c7d91e4bf6a41e36\",\n \"score\": \"0.556398\",\n \"text\": \"boolean hasOperator();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f895563e1383ee3b7f021853564d9663\",\n \"score\": \"0.55560803\",\n \"text\": \"private Object execute(Bytecode.Operator bytecode, Constant[] frame, Context context) {\\n\\t\\tint[] operands = bytecode.operands();\\n\\t\\tConstant[] values = new Constant[operands.length];\\n\\t\\t// Read all operands\\n\\t\\tfor(int i=0;i!=operands.length;++i) {\\n\\t\\t\\tvalues[i] = frame[operands[i]];\\n\\t\\t}\\t\\t\\n\\t\\t// Compute result\\n\\t\\tConstant result = operators[bytecode.opcode()].apply(values, context);\\t\\t\\n\\t\\t// Write result to target\\n\\t\\tframe[bytecode.target(0)] = result;\\n\\t\\t// Continue on to next instruction\\n\\t\\treturn context.pc.next();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"59d2e7509d46b07567dda3e539ff9ff8\",\n \"score\": \"0.55525476\",\n \"text\": \"private static void push(Precedence ele) {\\n\\t\\tstack[++top] = ele;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"963620bd7020dbae62b713fa840b59ae\",\n \"score\": \"0.55342\",\n \"text\": \"private static int computeUnaryOperator(int op,String operator){\\n\\t\\t\\n\\t\\tswitch(operator){\\n\\t\\t\\n\\t\\tcase \\\"^2\\\":\\n\\t\\t\\treturn op*op;\\n\\t\\tcase \\\"^3\\\":\\n\\t\\t\\treturn op*op*op;\\n\\t\\tdefault:\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b258a836f4a6d0df61e5fb2e49730ca6\",\n \"score\": \"0.5525472\",\n \"text\": \"public void addOperator(Operator op){\\n\\t\\tif(analyzedAgentID != op.ownerID) return;\\n\\t\\t\\n\\t\\tif(op.isPrivate){\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\t\\n\\t\\tif(op.pre == null) op.pre = new HashMap<>();\\n\\t\\tif(op.eff == null) op.eff = new HashMap<>();\\n\\t\\t\\n\\t\\top.generatePublicLabelAndHash();\\n\\t\\t\\n\\t\\tOperator existingOp = opMap.get(op.hash);\\n\\t\\t\\n\\t\\tif(existingOp != null){\\n\\t\\t\\t\\n\\t\\t\\texistingOp.addOriginalOp(op);\\n\\t\\t\\t\\n\\t\\t\\tSystem.out.println(\\\"op \\\" + op.opName + \\\", owner=\\\"+op.ownerID + \\\" added to op \\\" + existingOp.opName + \\\" with preMask=\\\"+Arrays.toString(op.publicPreMask)+ \\\",effMask=\\\"+Arrays.toString(op.publicEffMask)+ \\\", op count \\\" + existingOp.getOriginalOps().size());\\n\\t\\t\\t\\n\\t\\t\\tpublicActions++;\\n\\t\\t}else{\\n\\t\\t\\topMap.put(op.hash, op);\\n\\t\\t\\tSystem.out.println(\\\"op \\\" + op.opName + \\\", owner=\\\"+op.ownerID + \\\" created with preMask=\\\"+Arrays.toString(op.publicPreMask)+ \\\",effMask=\\\"+Arrays.toString(op.publicEffMask));\\n\\t\\t\\t\\n\\t\\t\\tpubliclyUniqueActions++;\\n\\t\\t}\\n\\t\\t\\n\\t\\t\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"90d7e4b4ccaf296306465e8b15b80a91\",\n \"score\": \"0.55242306\",\n \"text\": \"public AddOperator() {\\n this.precedence = 1;\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"46bf3f3408d0abbfb42f267b4ecfab3b\",\n \"score\": \"0.5513008\",\n \"text\": \"@Override\\n public Object visit(Logical logical, Object o) {\\n logical.getLeftExpression().accept(this, o);\\n logical.getRightExpression().accept(this, o);\\n codeGenerator.logical(logical.getOperator());\\n return null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"196b3f54b252abe29750e3b121dfeba5\",\n \"score\": \"0.55051017\",\n \"text\": \"public int calPoints(String[] ops) {\\n Stack<Integer> stack = new Stack();\\n \\n for(String op : ops) {\\n if (op.equals(\\\"+\\\")) {\\n int top = stack.pop();\\n int newtop = top + stack.peek();\\n stack.push(top);\\n stack.push(newtop);\\n } else if (op.equals(\\\"C\\\")) {\\n stack.pop();\\n } else if (op.equals(\\\"D\\\")) {\\n stack.push(2 * stack.peek());\\n } else {\\n stack.push(Integer.valueOf(op));\\n }\\n }\\n \\n int ans = 0;\\n for(int score : stack) ans += score;\\n return ans;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"aa9a72bc9ad3bc9c58e98879c9c25008\",\n \"score\": \"0.55048645\",\n \"text\": \"public final MeteorParser.operator_return operator() throws RecognitionException {\\n operator_stack.push(new operator_scope());\\n MeteorParser.operator_return retval = new MeteorParser.operator_return();\\n retval.start = input.LT(1);\\n\\n\\n EvaluationExpression root_0 = null;\\n\\n MeteorParser.readOperator_return readOperator93 =null;\\n\\n MeteorParser.writeOperator_return writeOperator94 =null;\\n\\n MeteorParser.genericOperator_return genericOperator95 =null;\\n\\n\\n\\n try {\\n // /home/arv/workspace/ozone-meteor/meteor/meteor-meteor/src/main/java/eu/stratosphere/meteor/Meteor.g:282:2: ( readOperator | writeOperator | genericOperator )\\n int alt53=3;\\n switch ( input.LA(1) ) {\\n case VAR:\\n {\\n int LA53_1 = input.LA(2);\\n\\n if ( (LA53_1==51) ) {\\n int LA53_5 = input.LA(3);\\n\\n if ( (LA53_5==61) ) {\\n alt53=1;\\n }\\n else if ( (LA53_5==ID) ) {\\n alt53=3;\\n }\\n else {\\n if (state.backtracking>0) {state.failed=true; return retval;}\\n NoViableAltException nvae =\\n new NoViableAltException(\\\"\\\", 53, 5, input);\\n\\n throw nvae;\\n\\n }\\n }\\n else if ( (LA53_1==43) ) {\\n alt53=3;\\n }\\n else {\\n if (state.backtracking>0) {state.failed=true; return retval;}\\n NoViableAltException nvae =\\n new NoViableAltException(\\\"\\\", 53, 1, input);\\n\\n throw nvae;\\n\\n }\\n }\\n break;\\n case 61:\\n {\\n alt53=1;\\n }\\n break;\\n case 64:\\n {\\n alt53=2;\\n }\\n break;\\n case ID:\\n {\\n alt53=3;\\n }\\n break;\\n default:\\n if (state.backtracking>0) {state.failed=true; return retval;}\\n NoViableAltException nvae =\\n new NoViableAltException(\\\"\\\", 53, 0, input);\\n\\n throw nvae;\\n\\n }\\n\\n switch (alt53) {\\n case 1 :\\n // /home/arv/workspace/ozone-meteor/meteor/meteor-meteor/src/main/java/eu/stratosphere/meteor/Meteor.g:282:4: readOperator\\n {\\n root_0 = (EvaluationExpression)adaptor.nil();\\n\\n\\n pushFollow(FOLLOW_readOperator_in_operator2087);\\n readOperator93=readOperator();\\n\\n state._fsp--;\\n if (state.failed) return retval;\\n if ( state.backtracking==0 ) adaptor.addChild(root_0, readOperator93.getTree());\\n\\n if ( state.backtracking==0 ) { retval.op = (readOperator93!=null?readOperator93.source:null); }\\n\\n }\\n break;\\n case 2 :\\n // /home/arv/workspace/ozone-meteor/meteor/meteor-meteor/src/main/java/eu/stratosphere/meteor/Meteor.g:283:5: writeOperator\\n {\\n root_0 = (EvaluationExpression)adaptor.nil();\\n\\n\\n pushFollow(FOLLOW_writeOperator_in_operator2095);\\n writeOperator94=writeOperator();\\n\\n state._fsp--;\\n if (state.failed) return retval;\\n if ( state.backtracking==0 ) adaptor.addChild(root_0, writeOperator94.getTree());\\n\\n if ( state.backtracking==0 ) { retval.op = (writeOperator94!=null?writeOperator94.sink:null); }\\n\\n }\\n break;\\n case 3 :\\n // /home/arv/workspace/ozone-meteor/meteor/meteor-meteor/src/main/java/eu/stratosphere/meteor/Meteor.g:284:5: genericOperator\\n {\\n root_0 = (EvaluationExpression)adaptor.nil();\\n\\n\\n pushFollow(FOLLOW_genericOperator_in_operator2103);\\n genericOperator95=genericOperator();\\n\\n state._fsp--;\\n if (state.failed) return retval;\\n if ( state.backtracking==0 ) adaptor.addChild(root_0, genericOperator95.getTree());\\n\\n if ( state.backtracking==0 ) { retval.op = (genericOperator95!=null?genericOperator95.op:null); }\\n\\n }\\n break;\\n\\n }\\n retval.stop = input.LT(-1);\\n\\n\\n if ( state.backtracking==0 ) {\\n\\n retval.tree = (EvaluationExpression)adaptor.rulePostProcessing(root_0);\\n adaptor.setTokenBoundaries(retval.tree, retval.start, retval.stop);\\n }\\n }\\n\\n catch (RecognitionException e) {\\n throw e;\\n }\\n\\n finally {\\n \\t// do for sure before leaving\\n operator_stack.pop();\\n }\\n return retval;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c44a826a19a0706b4721bdd0e7b95c6d\",\n \"score\": \"0.54748917\",\n \"text\": \"private void arithmeticExpressionTreeEvaluation() {\\r\\n\\t\\t\\r\\n\\t\\tIterator printPostFix = tree.iterator();\\r\\n\\t\\t\\r\\n\\t\\tSystem.out.print(\\\"postfix from the arithmetic expression tree: \\\");\\r\\n\\r\\n\\t\\t\\r\\n\\t\\twhile(printPostFix.hasNext()) {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tSystem.out.print(printPostFix.next() + \\\" \\\");\\r\\n\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tSystem.out.println();\\r\\n\\t\\t\\r\\n\\t\\tIterator it = tree.iterator();\\r\\n\\t\\t\\r\\n\\t\\tLinkedStack<Double> expressionStack= new LinkedStack<>();\\r\\n\\t\\t\\r\\n\\t\\twhile(it.hasNext()) {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tString temp = it.next().toString();\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tif(!temp.equals(\\\"*\\\") && !temp.equals(\\\"/\\\") && !temp.equals(\\\"+\\\") && !temp.equals(\\\"–\\\")) {\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t// check to see if it the the popped item from the stack is a double or a variable, if it is a variable then ask for user input\\r\\n\\t\\t\\t\\ttry {\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\texpressionStack.push(Double.parseDouble(temp));\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t} \\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tcatch (Exception e) {\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tScanner userInput = new Scanner(System.in);\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tdouble dobTemp;\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\tSystem.out.print(\\\"Please enter an integer or floating point number for the variable \\\" + temp + \\\": \\\");\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\twhile(true) {\\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\ttry {\\r\\n\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tdobTemp = Double.parseDouble(userInput.next());\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\texpressionStack.push(dobTemp);\\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\\t\\r\\n\\t\\t\\t\\t\\t\\t} \\r\\n\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\tcatch (Exception e2) {\\r\\n\\t\\t\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\t\\t\\tSystem.out.print(\\\"Try again! Enter an integer or floating point number for the variable \\\" + temp + \\\": \\\" );\\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\\r\\n\\t\\t\\t\\t\\t} // end of while loop\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t} // end of if block\\r\\n\\t\\t\\t\\r\\n\\t\\t\\telse {\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tdouble rightOperand;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tdouble leftOperand;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tdouble total;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\trightOperand = expressionStack.pop();\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tleftOperand = expressionStack.pop();\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif(temp.equals(\\\"*\\\")) {\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\ttotal = rightOperand * leftOperand;\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\texpressionStack.push(total);\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif(temp.equals(\\\"/\\\")) {\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\ttotal = leftOperand / rightOperand;\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\texpressionStack.push(total);\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif(temp.equals(\\\"+\\\")) {\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\ttotal = rightOperand + leftOperand;\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\texpressionStack.push(total);\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tif(temp.equals(\\\"–\\\")) {\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\ttotal = leftOperand - rightOperand;\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t\\texpressionStack.push(total);\\r\\n\\t\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\t\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tdouble result = expressionStack.pop();\\r\\n\\t\\t\\r\\n\\t\\tSystem.out.println(\\\"Evaluated expression: \\\" + result);\\r\\n\\t\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ddebb1525c81119bfb02dbe4e38ec668\",\n \"score\": \"0.54671633\",\n \"text\": \"public interface OperatorContext {\\n\\n /**\\n * @param operator registers a new operator, taking care to avoid registration of new operators\\n * that override a predefined operator suffix.\\n */\\n void register(Operator operator);\\n\\n /**\\n * Finds the operator that matches the given suffix\\n *\\n * @param suffix the suffix to look for\\n * @return the operator that matches the suffix or {@literal null} if none matches.\\n */\\n Operator getBySuffix(String suffix);\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2c4e6ca85415d048df672c3ed8e58d8a\",\n \"score\": \"0.54650813\",\n \"text\": \"protected void applyGeneticOperator(GeneticOperator a_operator,\\n Population a_population,\\n List a_chromosomes) {\\n a_operator.operate(a_population, a_chromosomes);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a225597652aea3a7d0cfb951d4234feb\",\n \"score\": \"0.5461449\",\n \"text\": \"public void eval(StackADT <Integer>stack){\\r\\n\\t \\t\\t//Cycles through all the steps\\r\\n\\t \\t\\tfor(int i = 0; i< steps.size(); i++){\\r\\n\\t \\t \\tString s = steps.get(i);\\r\\n\\t\\t \\t \\ttry{\\r\\n\\t\\t \\t \\t//Pushes step onto stack if it is an integer\\r\\n\\t\\t \\t \\t\\tInteger j = Integer.parseInt(s);\\r\\n\\t\\t\\t \\t\\tstack.push(j);\\r\\n\\t\\t \\t }\\r\\n\\t\\t \\t catch(NumberFormatException e){ \\r\\n\\t\\t\\t \\t \\t //Checks if string is an addition sign\\r\\n\\t \\t if (s.equals(\\\"+\\\")){\\r\\n\\t \\t\\tInteger i1 = stack.pop();\\r\\n\\t \\t\\tInteger i2 = stack.pop();\\r\\n\\t \\t\\tstack.push(i1+i2);\\r\\n\\t \\t }\\r\\n\\t \\t //checks if string is a subtraction sign\\r\\n\\t \\t if (s.equals(\\\"-\\\")){\\r\\n\\t \\t\\tInteger i2 = stack.pop();\\r\\n\\t \\t\\tInteger i1 = stack.pop();\\r\\n\\t \\t\\tstack.push(i2-i1);\\r\\n\\t \\t }\\r\\n\\t \\t //checks if string is a multiplication sign\\r\\n\\t \\t if (s.equals(\\\"*\\\")){\\r\\n\\t \\t\\tInteger i1 = stack.pop();\\r\\n\\t \\t\\tInteger i2 = stack.pop();\\r\\n\\t \\t\\tstack.push(i1*i2);\\r\\n\\t \\t }\\r\\n\\r\\n\\t \\t }\\r\\n\\t \\t}\\r\\n\\t\\r\\n\\t }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"75859aa6f7997bf2e0c32343f9a16af7\",\n \"score\": \"0.5456655\",\n \"text\": \"private void chooseExpressionLike(\\n SourceOfRandomness random,\\n Consumer<SourceOfRandomness> nextPrecedence,\\n Terminal... operators) {\\n\\n List<Tuple2<Double, Consumer<SourceOfRandomness>>> choices = new ArrayList<>();\\n // Drops down one level in precedence (e.g. from LogicalOrExpression to LogicalAndExpression).\\n // This is the non-recursive case, so should have a rel. high weight.\\n choices.add(tuple(2.0, nextPrecedence));\\n\\n for (Terminal op : operators) {\\n choices.add(\\n tuple(\\n 0.1,\\n r -> {\\n // In the other cases, we will recurse while also intercalating an operator.\\n // Think LogicalOrExpression || LogicalAndExpression\\n // recurse op nextPrecedence\\n chooseExpressionLike(r, nextPrecedence, operators);\\n ret.add(op);\\n nextPrecedence.accept(r);\\n }));\\n }\\n\\n selectWithRandomWeight(random, choices);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"afe005f95bf7530326701c0796257719\",\n \"score\": \"0.5456607\",\n \"text\": \"public static Expression Operator(Expression left, String operator, Expression right) {\\n\\t\\treturn new Expression(\\\"Operator\\\", operator, left, right);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d4c40020ffb6715caad184b1d87d83e9\",\n \"score\": \"0.54519325\",\n \"text\": \"private static Optional<State> doOperation(State check, int index1, int index2, char operator) {\\n int valOne = check.getNumber(index1);\\n String stringOne = check.getString(index1);\\n int valTwo = check.getNumber(index2);\\n String stringTwo = check.getString(index2);\\n int result;\\n switch (operator) {\\n case '+':\\n result = valOne + valTwo;\\n break;\\n case '-':\\n result = valOne - valTwo;\\n break;\\n case '*':\\n result = valOne * valTwo;\\n break;\\n case '/':\\n result = valOne / valTwo;\\n break;\\n default:\\n throw new IllegalArgumentException();\\n }\\n if (result <= MAXVALUE && result >= 0) {\\n List<Integer> newNumbers = new LinkedList<>();\\n List<String> newString = new LinkedList<>();\\n List<Integer> remainingNumbers = getRemainingNumbers(check, index1, index2);\\n\\n newNumbers.add(result);\\n newString.add(\\\"[\\\" + stringOne + operator + stringTwo + \\\"]\\\");\\n for (Integer number: remainingNumbers) {\\n newNumbers.add(number);\\n newString.add(String.valueOf(number));\\n }\\n return Optional.ofNullable(new State(newNumbers, newString));\\n }\\n return Optional.empty();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a3a0fdf9d5f0fb88aa3ef3a2b5146bdf\",\n \"score\": \"0.54465926\",\n \"text\": \"private static void apply(String[] operations, Integer[] values) {\\n MinStack minStack = new MinStack();\\n Object[] response = new Object[operations.length];\\n for (int i = 0; i < operations.length; i++) {\\n switch (operations[i]) {\\n case \\\"MinStack\\\": {\\n response[i] = null;\\n continue;\\n }\\n case \\\"push\\\": {\\n response[i] = null;\\n minStack.push(values[i]);\\n break;\\n }\\n case \\\"pop\\\": {\\n response[i] = null;\\n minStack.pop();\\n break;\\n }\\n case \\\"getMin\\\": {\\n response[i] = minStack.getMin();\\n break;\\n }\\n case \\\"top\\\": {\\n response[i] = minStack.top();\\n break;\\n }\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c61e21a0b35b7a7023640dbb64a335b4\",\n \"score\": \"0.54416007\",\n \"text\": \"public Expression parseAddExpression() throws IOException\\n {\\n Expression expression = parseMultExpression();\\n String r = this.currentToken;\\n while (r.equals(\\\"+\\\") || r.equals(\\\"-\\\"))\\n {\\n eat(currentToken);\\n // want to build tree from left side\\n expression = new Evaluator(parseMultExpression(), expression, r);\\n r = currentToken;\\n }\\n return expression;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e87449b515d1461913463ab437556027\",\n \"score\": \"0.5440611\",\n \"text\": \"public calc(){\\n scan = new Scanner(System.in);\\n operators = new Stack<>();\\n ops = new Operator();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8a99c2c05960beaece23b41a164b55c5\",\n \"score\": \"0.5429486\",\n \"text\": \"public boolean arithmetic(ByteCode instr){\\n\\t\\tboolean right = true;\\r\\n\\t\\tif(this.cont >= 2){\\r\\n\\t\\t\\tint num = this.pop();\\r\\n\\t\\t\\tswitch (instr.getName()){\\r\\n\\t\\t\\t\\tcase ADD: \\r\\n\\t\\t\\t\\t\\tthis.add(this.pop() + num);// stack.pop());\\r\\n\\t\\t\\t\\t\\tright = true;\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\tcase SUB:\\r\\n\\t\\t\\t\\t\\tthis.add(this.pop() - num); //stack.pop());\\r\\n\\t\\t\\t\\t\\tright = true;\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\tcase MUL:\\r\\n\\t\\t\\t\\t\\tthis.add(this.pop() * num);//stack.pop());\\r\\n\\t\\t\\t\\t\\tright = true;\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\tcase DIV:\\r\\n\\t\\t\\t\\t\\t//int num = stack.pop();\\r\\n\\t\\t\\t\\t\\tif(num != 0){\\r\\n\\t\\t\\t\\t\\t\\tright = true;\\r\\n\\t\\t\\t\\t\\t\\tthis.add(this.pop() / num);\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t\\telse \\r\\n\\t\\t\\t\\t\\t\\tright = false;\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\tdefault:\\r\\n\\t\\t\\t\\t\\tright = false;\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\telse\\r\\n\\t\\t\\tright = false;\\r\\n\\t\\t\\r\\n\\t\\treturn right;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"546111dec42d222975809d3a5a22b805\",\n \"score\": \"0.5425328\",\n \"text\": \"public Element serializeOperator(Operator operator)\\n {\\n Element element = serializeOperatorOnly(operator);\\n \\n // Operators with nested plans\\n if (operator instanceof SendPlan)\\n {\\n Element args_elm = getOnlyChildElement(element, ARGS_ELM);\\n SendPlan send_plan = (SendPlan) operator;\\n serializeAssignConfiguration(args_elm, send_plan.getSendPlan());\\n args_elm.appendChild(serializeOperator(send_plan.getSendPlan().getRootOperator()));\\n }\\n else if (operator instanceof Copy)\\n {\\n Element args_elm = getOnlyChildElement(element, ARGS_ELM);\\n Copy copy = (Copy) operator;\\n serializeAssignConfiguration(args_elm, copy.getCopyPlan());\\n args_elm.appendChild(serializeOperator(copy.getCopyPlan().getRootOperator()));\\n }\\n else if (operator instanceof ApplyPlan)\\n {\\n Element args_elm = getOnlyChildElement(element, ARGS_ELM);\\n ApplyPlan apply_plan = (ApplyPlan) operator;\\n serializeAssignConfiguration(args_elm, apply_plan.getLogicalPlansUsed().get(0));\\n args_elm.appendChild(serializeOperator(apply_plan.getLogicalPlansUsed().get(0).getRootOperator()));\\n }\\n else if (operator instanceof Assign)\\n {\\n Element args_elm = getOnlyChildElement(element, ARGS_ELM);\\n Assign assign = (Assign) operator;\\n serializeAssignConfiguration(args_elm, assign.getPlan());\\n args_elm.appendChild(serializeOperator(assign.getPlan().getRootOperator()));\\n }\\n else if (operator instanceof Exists)\\n {\\n Element args_elm = getOnlyChildElement(element, ARGS_ELM);\\n Exists exists = (Exists) operator;\\n serializeAssignConfiguration(args_elm, exists.getLogicalPlansUsed().get(0));\\n args_elm.appendChild(serializeOperator(exists.getLogicalPlansUsed().get(0).getRootOperator()));\\n }\\n else if (operator instanceof CreateDataObject)\\n {\\n Element args_elm = getOnlyChildElement(element, ARGS_ELM);\\n CreateDataObject create_op = (CreateDataObject) operator;\\n for (SchemaPath path : create_op.getTypesToSetDefault())\\n {\\n // Query plan XML element\\n Element plan_elm = serializeLogicalPlan(create_op.getDefaultPlan(path));\\n plan_elm.setAttribute(TYPE_ATTR, path.getString());\\n args_elm.appendChild(plan_elm);\\n }\\n }\\n else if (operator instanceof Insert)\\n {\\n Insert insert_op = (Insert) operator;\\n \\n Element args_elm = getOnlyChildElement(element, ARGS_ELM);\\n \\n // Query plan XML element\\n // FIXME: the plan cannot have assignment, can it?\\n Element plan_elm = serializeLogicalPlan(insert_op.getLogicalPlan());\\n args_elm.appendChild(plan_elm);\\n }\\n else if (operator instanceof Update)\\n {\\n Element args_elm = getOnlyChildElement(element, ARGS_ELM);\\n Update update_op = (Update) operator;\\n \\n for (Assignment assignment : update_op.getAssignments())\\n {\\n // Assignment XML element\\n Element assignment_elm = getDomDocument().createElement(ASSIGNMENT_ELM);\\n args_elm.appendChild(assignment_elm);\\n \\n // Target XML element\\n Element target_elm = getDomDocument().createElement(TARGET_ELM);\\n assignment_elm.appendChild(target_elm);\\n \\n target_elm.appendChild(this.serializeTerm(assignment.getTerm()));\\n \\n // Query plan XML element\\n // FIXME: the plan cannot have assignment, can it?\\n Element plan_elm = serializeLogicalPlan(assignment.getLogicalPlan());\\n assignment_elm.appendChild(plan_elm);\\n \\n }\\n }\\n \\n for (Operator child_operator : operator.getChildren())\\n {\\n Element child_element = serializeOperator(child_operator);\\n element.appendChild(child_element);\\n }\\n \\n return element;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5db3999d6f56d5ec56aa62ee9cb4ac06\",\n \"score\": \"0.541802\",\n \"text\": \"public abstract boolean isApplicable(Operator operator);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ec2a498ed64858a9b5a0c598a1913f8d\",\n \"score\": \"0.5416525\",\n \"text\": \"public String visit(Operator n, String argu) {\\n String[] _ret = { \\\"slt\\\", \\\"add\\\", \\\"sub\\\", \\\"mul\\\" };\\n return _ret[n.f0.which];\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8c739a918808a3a9aa51da1c8995b2fd\",\n \"score\": \"0.54159695\",\n \"text\": \"public Value eval(Environment e) {\\n\\t\\tValue operatorvalue = operator.eval(e);\\n\\t\\tFunValue operatorValue = (FunValue) operatorvalue;\\n\\t\\tEnvironment operatorEnv = operatorValue.environment;\\n\\t\\tVector<Integer> locations = new Vector<Integer>();\\n\\t\\t\\n\\t\\tfor (Expression operand : operands) {\\n\\t\\t\\tValue v = operand.eval(e);\\n\\t\\t\\tInteger location = Store.theStore.newLocation();\\n\\t\\t\\tStore.theStore.extend(location,v);\\n\\t\\t\\tlocations.add(location);\\n\\t\\t}\\n\\t\\treturn operatorValue.body.eval(operatorEnv.extend(operatorValue.formals,locations));\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1999bc3ed11e9d6ea9519ce6ae67b204\",\n \"score\": \"0.54143953\",\n \"text\": \"private Fraction executeExpression() {\\n\\t\\tswitch(operator){\\n\\t\\tcase \\\"*\\\":\\n\\t\\t\\treturn multiply(f1,f2);\\n\\t\\tcase \\\"/\\\":\\n\\t\\t\\treturn divide(f1,f2);\\n\\t\\tcase \\\"+\\\":\\n\\t\\t\\treturn add(f1, f2);\\n\\t\\tcase \\\"-\\\":\\n\\t\\t\\treturn subtract(f1,f2);\\n\\t\\tdefault: \\n\\t\\t\\tSystem.out.println(\\\"no operator!!!!!!\\\");\\n\\t\\t}\\n\\t\\treturn null; // at this point - no other condition was met.\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7564b78d80cecf9f4eefcbd0b0a5c939\",\n \"score\": \"0.5406436\",\n \"text\": \"@Override\\n public void evaluate_expression_tree(ArrayList list) {\\n int sum = ((char) list.get(0).toString().charAt(0)) - '0';\\n // For all the other items in the string: conduct operation with operator and next operand\\n for (int i = 0; i < list.size(); i++) {\\n // If the index contains an operator: conduct the infix operation\\n if (i%2 == 1) {\\n if ((char) list.get(i).toString().charAt(0) == '+') {\\n sum = sum + ((char) list.get(i+1).toString().charAt(0) - '0');\\n }\\n else if ((char) list.get(i).toString().charAt(0) == '-') {\\n sum = sum - ((char) list.get(i+1).toString().charAt(0) - '0');\\n }\\n else if ((char) list.get(i).toString().charAt(0) == '*') {\\n sum = sum * ((char) list.get(i+1).toString().charAt(0) - '0');\\n }\\n else if ((char) list.get(i).toString().charAt(0) == '/') {\\n sum = sum / ((char) list.get(i+1).toString().charAt(0) - '0');\\n }\\n }\\n }\\n System.out.println(\\\"FINAL SUM = \\\" + sum);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c6de3f74276edec7fe97f2d10036ccdd\",\n \"score\": \"0.540623\",\n \"text\": \"public void addOperator(View operator) {\\r\\n if(isResult()) return;\\r\\n\\r\\n addOperator(operator, -1, new LinearLayout.LayoutParams(-2, -1));\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d623007552aa9fa19827724fabb11cc9\",\n \"score\": \"0.53790456\",\n \"text\": \"public static void repeatOps(String op) {\\n\\t\\twhile(valStk.size()>1 && (precedent(op)<=precedent(opStk.top().toString()))&& !opStk.top().equals(\\\"(\\\")) {\\n\\t\\t\\tdoOp();\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"24ca0d6d9c078f6ed458e3e6d9aec48b\",\n \"score\": \"0.53743875\",\n \"text\": \"private void addOperatorInList() {\\n for(String string : splitOperators) {\\n \\tif(!string.isEmpty()) {\\n\\t\\t\\t\\ttry {\\n\\t\\t\\t\\t\\tif(string.contains(\\\"×\\\")) {\\n\\t\\t\\t\\t\\t\\tstring = string.replaceAll(\\\"×\\\", \\\"*\\\");\\n\\t\\t\\t\\t\\t}else if(string.contains(\\\"÷\\\")){\\n\\t\\t\\t\\t\\t\\tstring = string.replaceAll(\\\"÷\\\", \\\"/\\\");\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"operator: \\\" + string);\\n\\t\\t\\t\\t\\tthis.operators.add(string);\\n\\t\\t\\t\\t}catch(NumberFormatException e) {\\n\\t\\t\\t\\t\\tSystem.out.println(\\\"Error: operation.java add operator in List\\\");\\n\\t\\t\\t\\t}\\n \\t}\\n }\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"14492353143cdd4e3ed9f12388ab3fd2\",\n \"score\": \"0.5368865\",\n \"text\": \"boolean isOperator();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6da989a1efc1720ea17d92cc6ea9a198\",\n \"score\": \"0.53631216\",\n \"text\": \"public String infixToPostfix() {\\r\\n\\t\\t// array to store elements after splitting them through whitespaces\\r\\n\\t\\tString array[] = infixExpression.split(\\\"\\\\\\\\s+\\\");\\r\\n\\t\\t// loop for checking all elements\\r\\n\\t\\tfor (String temp : array) {\\r\\n\\t\\t\\tif (temp == \\\"(\\\") {\\r\\n\\t\\t\\t\\tstack.push(temp);\\r\\n\\t\\t\\t} else if (temp == \\\")\\\") {\\r\\n\\t\\t\\t\\twhile (!stack.isEmpty() && stack.topElement() != \\\"(\\\") {\\r\\n\\t\\t\\t\\t\\tpostfixExpression += stack.pop();\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tif (!stack.isEmpty() && stack.topElement() != \\\"(\\\") {\\r\\n\\t\\t\\t\\t\\tthrow new AssertionError(\\\"invalid expression\\\");\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tstack.pop();\\r\\n\\t\\t\\t} else if (isOperator(temp)) {\\r\\n\\t\\t\\t\\twhile (!stack.isEmpty()\\r\\n\\t\\t\\t\\t\\t\\t&& getPrecedence(temp) > getPrecedence(stack\\r\\n\\t\\t\\t\\t\\t\\t\\t\\t.topElement())) {\\r\\n\\t\\t\\t\\t\\tpostfixExpression += temp;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\tstack.push(temp);\\r\\n\\t\\t\\t} else {\\r\\n\\t\\t\\t\\tpostfixExpression += temp;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\twhile (!stack.isEmpty()) {\\r\\n\\t\\t\\tpostfixExpression += stack.pop();\\r\\n\\t\\t}\\r\\n\\t\\treturn postfixExpression;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"89131a66653c3e3bfe3310adc33c14b2\",\n \"score\": \"0.5357549\",\n \"text\": \"public interface Operator {\\n\\t\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3e10fc545508c3db9644e112d4695536\",\n \"score\": \"0.53555036\",\n \"text\": \"ExpressionMatchingOperator createExpressionMatchingOperator();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"727ec2318b8a52e1f0e5b5049330b6cf\",\n \"score\": \"0.53540784\",\n \"text\": \"void apply(Stack<Double> numbers) throws ParsingException {\\n // Too few arguments\\n if (numbers.size() < valency) {\\n throw new ParsingException(\\\"Too few operands\\\");\\n }\\n\\n double[] args = new double[valency];\\n for (int i = valency - 1; i >= 0; --i) {\\n args[i] = numbers.pop();\\n }\\n\\n switch (this) {\\n case ADD:\\n numbers.push(args[0] + args[1]);\\n break;\\n case SUBTRACT:\\n numbers.push(args[0] - args[1]);\\n break;\\n case MULTIPLY:\\n numbers.push(args[0] * args[1]);\\n break;\\n case DIVIDE:\\n numbers.push(args[0] / args[1]);\\n break;\\n case UNARY_PLUS:\\n numbers.push(args[0]);\\n break;\\n case UNARY_MINUS:\\n numbers.push(-args[0]);\\n break;\\n default:\\n throw new IllegalStateException();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8dacb440a0a35c20d4c221a11ca265fc\",\n \"score\": \"0.53478503\",\n \"text\": \"public DynamicOperand getOperand();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"07b065cb0dbddd0269333a28d100f8d6\",\n \"score\": \"0.53453535\",\n \"text\": \"static String infixToPostfix(String exp)throws IllegalOperationException, LookAtMrAlgebraOverHereException\\n {\\n // initializing empty String for result\\n String result = new String(\\\"\\\");\\n boolean lastest = false;\\n\\n // initializing empty stack\\n Stack<Character> stack = new Stack<>();\\n\\n for (int i = 0; i<exp.length(); ++i)\\n {\\n char c = exp.charAt(i);\\n\\n // If the scanned character is an operand, add it to output.\\n\\n if(c == '&' || c == '#' || c == '@' || c == '^' || c == '!')\\n throw new IllegalOperationException(\\\"this is not a legal operator\\\");\\n\\n else if (Character.isDigit(c)|| c == '.'){\\n\\n\\n result += c;\\n lastest = false;\\n }\\n\\n\\n // If the scanned character is an '(', push it to the stack.\\n\\n else if (c == '('){\\n\\n stack.push(c);\\n\\n }\\n\\n // If the scanned character is an ')', pop and output from the stack\\n // until an '(' is encountered.\\n else if (c == ')')\\n {\\n\\n while (!stack.isEmpty() && stack.peek() != '('){\\n result += \\\" \\\";\\n result += stack.pop();\\n\\n }\\n\\n if (!stack.isEmpty() && stack.peek() != '(')\\n return \\\"Invalid Expression\\\"; // invalid expression\\n else\\n stack.pop();\\n }\\n\\n else// an operator is encountered\\n { result += \\\" \\\";\\n if(lastest == true)\\n throw new LookAtMrAlgebraOverHereException(\\\"you need to enter number, number belongs here!\\\");\\n lastest = true;\\n while (!stack.isEmpty() && Prec(c) <= Prec(stack.peek())){\\n result += stack.pop();\\n result += \\\" \\\";\\n\\n\\n }\\n\\n stack.push(c);\\n }\\n\\n }\\n\\n // pop all the operators from the stack\\n while (!stack.isEmpty())\\n\\n result += \\\" \\\" + stack.pop();\\n return result;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"34ad3cd9be198e972145a6e4ef0ca9eb\",\n \"score\": \"0.53416324\",\n \"text\": \"private static void processExpressions_conditional_effects(OperatorType oper, HashMap<String, String> parameterMap, Queue<String> preconditionQueue, Queue<String> effectQueue) throws ConvertorException {\\n Map<String,Set<ExpressionType>> transitionMap = new HashMap<String,Set<ExpressionType>>();\\n \\n for (ExpressionType expr: oper.getExpression()) {\\n // read all slots and update parameterMap with new variables - these variables make up operator's parameters\\n for (SlotType slot: expr.getSlot()) {\\n if (slot.getContentType().equals(domainXMLAdapter.VAR_TYPE)) {\\n parameterMap.put(slot.getContent(), slot.getContentClass());\\n }\\n }\\n \\n // relation expressions\\n if (expr.getType().equals(dmiExpression.RELATION)) {\\n preconditionQueue.add(buildPreconditionEntryFromRelation(expr));\\n continue;\\n }\\n \\n // prevailing transition expressions\\n if (expr.getType().equals(dmiExpression.P_TRANS)) {\\n preconditionQueue.add(buildPreconditionEntryFromPrevailingTransition(expr));\\n continue;\\n }\\n \\n // non-prevailing transition expressions\\n if (expr.getType().equals(dmiExpression.TRANS)) {\\n // we need to sort non-prevailing transitions into groups with common signature\\n String signature = makeSignatureString(expr);\\n if (!transitionMap.containsKey(signature)) {\\n Set<ExpressionType> newSet = new HashSet<ExpressionType>();\\n newSet.add(expr);\\n transitionMap.put(signature, newSet);\\n } else {\\n transitionMap.get(signature).add(expr);\\n }\\n }\\n }\\n \\n // process non-prevailing expressions\\n // usage of conditional effect can be decided only if we know how many expressions with common signature we have\\n // to process (transitions are sorted in trasitionMap - we can do it now)\\n for (String sign: transitionMap.keySet()) {\\n Set<ExpressionType> exprSet = transitionMap.get(sign);\\n \\n // there is more than one possible transition for one state variable\\n if (exprSet.size() > 1) {\\n for (ExpressionType expr : exprSet) {\\n String oldValueTerm = buildPropositionFromTransition(expr, TRANS_UC_PRECONDITION);\\n String newValueTerm = buildPropositionFromTransition(expr, TRANS_UC_EFFECT);\\n if ((oldValueTerm == null) || (newValueTerm == null)) {\\n throw new ConvertorException(\\\"Unable to convert expression containing wildcards.\\\");\\n }\\n effectQueue.add(\\\"(when \\\" + oldValueTerm + \\\" (and (not \\\" + oldValueTerm + \\\") \\\" + newValueTerm + \\\"))\\\");\\n }\\n } else {\\n assert(exprSet.size() == 1);\\n // there is only one possible transition for this state variable\\n Iterator<ExpressionType> iter = exprSet.iterator();\\n assert(iter.hasNext());\\n ExpressionType expr = iter.next();\\n String oldValueTerm = buildPropositionFromTransition(expr, TRANS_UC_PRECONDITION);\\n String newValueTerm = buildPropositionFromTransition(expr, TRANS_UC_EFFECT);\\n if ( (oldValueTerm == null) || (newValueTerm == null) ) {\\n throw new ConvertorException(\\\"Unable to convert expression containing wildcards.\\\");\\n }\\n \\n preconditionQueue.add(oldValueTerm);\\n effectQueue.add(\\\"(not \\\" + oldValueTerm + \\\")\\\"); // delete old value in effect\\n \\n effectQueue.add(newValueTerm); // set new value in effect\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5336f8c035db7c0882b12b769f759963\",\n \"score\": \"0.5341358\",\n \"text\": \"public InfixExpression(Operator o, Expression first, Expression second){\\n text = first.textualRepresentation()+o.textualRepresentation()+second.textualRepresentation();\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}},{"rowIdx":985399,"cells":{"query_id":{"kind":"string","value":"1be1f0c3228ed8b60c218a51d1e95d9b"},"query":{"kind":"string","value":"METHODS FOR EXPANDING THIS STATE Returns a Value object that represents the value of this state based on which player's turn it is or if a random action will occure. It will expand itself to a depth of 'maxDepth' to calculate the value of this state. It acts as a expectaminimax function."},"positive_passages":{"kind":"list like","value":[{"docid":"a89f5dcb064d6019e70f244fa8c56216","score":"0.79481035","text":"final Value getValue(int maxDepth){\n\t\t\n\t\t//if this state is at the max depth return the value of this state\n\t\tif(maxDepth == depth)\n\t\t\treturn evaluateState();\n\t\t\n\t\t//if not - must continue expanding tree\n\t\t\n\t\tAction[] possibleActions = this.getPossibleActions();\n\t\t\n\t\t//get the value of the the child states and return the best choice\n\t\t//depending on which player's turn it is.\n\t\tState[] children = expand(possibleActions);\n\t\t\n\t\t//if there are no sub-states, then this is an end state\n\t\tif(children==null || children.length==0)\n\t\t\treturn evaluateState();\n\t\t\n\t\t//set the depth of the children to one more than the depth of this state\n\t\tfor(State s : children)\n\t\t\ts.setDepth(this.depth+1);\n\t\t\n\t\t//get an array of values from the array of children\n\t\tValue[] values = new Value[children.length];\n\t\tfor(int i = 0; i<children.length; i++)\n\t\t\tvalues[i] = children[i].getValue(maxDepth);\n\t\t\n\t\t\n\t\t//get the index of the player that will take an action from this state\n\t\tint turn = this.getTurn();\n\t\t\n\t\t/* If a player will take an action from this state:\n\t\t * \n\t\t * find the value of the child states that is best\n\t\t * for the player who will take make the move from this state \n\t\t */\n\t\tif(turn >= 0)\n\t\t\treturn values[Value.getBestValueIndex(values, turn)];\n\t\t\n\t\t/* If a random action will take place from this state:\n\t\t * \n\t\t * Calculate the value of this state based on the probability\n\t\t * of each sub-state\n\t\t */\n\t\t\n\t\t//weight each value\n\t\tfor(int i = 0; i<values.length; i++)\n\t\t\tvalues[i].weight(possibleActions[i].getProbability());\n\t\t\n\t\t//return the sum of all the weighted values of all the sub-states\n\t\treturn new Value(values);\n\t\t\n\t}","title":""}],"string":"[\n {\n \"docid\": \"a89f5dcb064d6019e70f244fa8c56216\",\n \"score\": \"0.79481035\",\n \"text\": \"final Value getValue(int maxDepth){\\n\\t\\t\\n\\t\\t//if this state is at the max depth return the value of this state\\n\\t\\tif(maxDepth == depth)\\n\\t\\t\\treturn evaluateState();\\n\\t\\t\\n\\t\\t//if not - must continue expanding tree\\n\\t\\t\\n\\t\\tAction[] possibleActions = this.getPossibleActions();\\n\\t\\t\\n\\t\\t//get the value of the the child states and return the best choice\\n\\t\\t//depending on which player's turn it is.\\n\\t\\tState[] children = expand(possibleActions);\\n\\t\\t\\n\\t\\t//if there are no sub-states, then this is an end state\\n\\t\\tif(children==null || children.length==0)\\n\\t\\t\\treturn evaluateState();\\n\\t\\t\\n\\t\\t//set the depth of the children to one more than the depth of this state\\n\\t\\tfor(State s : children)\\n\\t\\t\\ts.setDepth(this.depth+1);\\n\\t\\t\\n\\t\\t//get an array of values from the array of children\\n\\t\\tValue[] values = new Value[children.length];\\n\\t\\tfor(int i = 0; i<children.length; i++)\\n\\t\\t\\tvalues[i] = children[i].getValue(maxDepth);\\n\\t\\t\\n\\t\\t\\n\\t\\t//get the index of the player that will take an action from this state\\n\\t\\tint turn = this.getTurn();\\n\\t\\t\\n\\t\\t/* If a player will take an action from this state:\\n\\t\\t * \\n\\t\\t * find the value of the child states that is best\\n\\t\\t * for the player who will take make the move from this state \\n\\t\\t */\\n\\t\\tif(turn >= 0)\\n\\t\\t\\treturn values[Value.getBestValueIndex(values, turn)];\\n\\t\\t\\n\\t\\t/* If a random action will take place from this state:\\n\\t\\t * \\n\\t\\t * Calculate the value of this state based on the probability\\n\\t\\t * of each sub-state\\n\\t\\t */\\n\\t\\t\\n\\t\\t//weight each value\\n\\t\\tfor(int i = 0; i<values.length; i++)\\n\\t\\t\\tvalues[i].weight(possibleActions[i].getProbability());\\n\\t\\t\\n\\t\\t//return the sum of all the weighted values of all the sub-states\\n\\t\\treturn new Value(values);\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n }\n]","isConversational":false},"negative_passages":{"kind":"list like","value":[{"docid":"3c984dcbe4cf9da5dadf74ae2749900e","score":"0.7206506","text":"@Override\r\n\tpublic double max_value(GameState s, int depthLimit) \r\n\t{\r\n\t\tdouble stateEvaluationValue = stateEvaluator(s);\r\n\r\n\t\tif (depthLimit == 0)\r\n\t\t{\r\n\t\t\treturn stateEvaluationValue;\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tdouble currMax = Double.NEGATIVE_INFINITY;\r\n\t\t\tint bestMove = 0;\r\n\t\t\tArrayList <Integer> succList = generateSuccessors(s.lastMove, s.takenList);\r\n\t\t\tif (succList.isEmpty())\r\n\t\t\t{\r\n\t\t\t\ts.bestMove = -1;\r\n\t\t\t\ts.leaf = true;\r\n\t\t\t\treturn -1;\r\n\t\t\t}\r\n\t\t\tIterator <Integer> myItr = succList.iterator();\r\n\t\t\twhile (myItr.hasNext())\r\n\t\t\t{\r\n\t\t\t\tdouble tempMax = currMax;\r\n\t\t\t\tint currNumber = myItr.next();\r\n\t\t\t\tint [] newList = s.takenList;\r\n\t\t\t\tnewList [currNumber] = 1; //assign it to player 1\r\n\t\t\t\tGameState newGameState = new GameState(newList, currNumber);\r\n\t\t\t\tcurrMax = Math.max(currMax, min_value(newGameState, depthLimit - 1));\r\n\r\n\t\t\t\tif (tempMax < currMax)\r\n\t\t\t\t{\r\n\t\t\t\t\tbestMove = currNumber;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\ts.bestMove = bestMove;\t\t\t\r\n\t\t\treturn currMax;\r\n\t\t}\r\n\r\n\r\n\t}","title":""},{"docid":"f19e9bd75518ead0329fb0ffb8cc0676","score":"0.6914502","text":"@Override\r\n\tpublic double min_value(GameState s, int depthLimit)\r\n\t{\r\n\t\tdouble stateEvaluationValue = stateEvaluator(s);\r\n\t\r\n\t\tif (depthLimit == 0)\r\n\t\t{\r\n\t\t\treturn -(stateEvaluationValue);\r\n\t\t}\r\n\t\telse\r\n\t\t{\r\n\t\t\tdouble currMin = Double.POSITIVE_INFINITY;\r\n\t\t\tint bestMove = 0;\r\n\t\t\tArrayList <Integer> succList = generateSuccessors(s.lastMove, s.takenList);\r\n\t\t\tif (succList.isEmpty())\r\n\t\t\t{\r\n\t\t\t\ts.leaf = true;\r\n\t\t\t\treturn 1;\r\n\t\t\t}\r\n\t\t\tIterator <Integer> myItr = succList.iterator();\r\n\t\t\t\r\n\t\t\twhile (myItr.hasNext())\r\n\t\t\t{\r\n\t\t\t\tint currNumber = myItr.next();\r\n\t\t\t\t\r\n\t\t\t\tdouble tempMin = currMin;\r\n\t\t\t\tint [] newList = s.takenList;\r\n\t\t\t\tnewList [currNumber] = 2;\r\n\t\t\t\tGameState newGameState = new GameState(newList, currNumber);\r\n\t\t\t\tcurrMin = Math.min(currMin, max_value(newGameState, depthLimit - 1));\r\n\r\n\t\t\t\tif (currMin < tempMin)\r\n\t\t\t\t{\r\n\t\t\t\t\tbestMove = currNumber;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\ts.bestMove = bestMove;\r\n\t\t\treturn currMin;\r\n\r\n\t\t}\r\n\t}","title":""},{"docid":"9a4ba6428c2567a242c9a2e6c324ab1f","score":"0.67425936","text":"public MoveNode ab(PentagoBoardState pbs,int myscore, int alpha, int beta,int amimaxplayer, int depth,int requireddepth){\n\n int bestmovescore;\n PentagoMove bestmove;\n\n ArrayList<PentagoMove> legalmoves = pbs.getAllLegalMoves();\n Collections.shuffle(legalmoves); //helps avoid worst run time if all good moves are at the end of array list\n\n MoveNode moveNode =new MoveNode(new PentagoMove(0,0,0,0,0),0);\n\n if (depth==requireddepth){\n bestmovescore= evaluate(pbs);\n moveNode.MyMove = null;\n moveNode.value = evaluate(pbs);\n return moveNode;\n\n }\n else if (pbs.getWinner() != Board.NOBODY){ //check win since we are at leafnode\n bestmovescore= evaluate(pbs);\n moveNode.MyMove = null;\n int movescore = evaluate(pbs);\n if (movescore<-1200000){\n moveNode.value = -999999999; //assign loss value\n } //Losing Move\n else if (movescore>1200000){\n moveNode.value = 999999999; //assign win value\n } // Winning Move\n return moveNode;\n\n }\n //do max player\n if (amimaxplayer ==1){\n int currentvalue = -999999999;\n PentagoMove currentmove =legalmoves.get(0);\n MoveNode currentmovenode = new MoveNode(currentmove,currentvalue);\n for (int i = 0; i < legalmoves.size(); i++) {\n PentagoBoardState newboard = (PentagoBoardState) pbs.clone();\n PentagoMove movetoprocess = legalmoves.get(i);\n newboard.processMove(movetoprocess);\n\n\n MoveNode scoreAfterMove = ab(newboard, currentvalue, alpha, beta, 0, depth + 1, requireddepth); // run recursion till leaf node or depth reached\n if (scoreAfterMove.value > currentvalue) { //see if current best value is lower than the new value if so replace\n currentvalue = scoreAfterMove.value;\n currentmove = movetoprocess;\n currentmovenode.value = currentvalue;\n currentmovenode.MyMove = currentmove;\n\n //System.out.println(\"I am max plyaer at depth:\" + depth + \"\\n current move is: \" + currentmove + \"\\ncurrentvalue is: \" + currentvalue);\n\n }\n\n alpha = Math.max(alpha,currentvalue);\n if (alpha>=beta){ // break loop if alpha more than beta\n //System.out.println(\"Get pruned my alpha is \" + alpha + \" my beta is \" + beta );\n break;\n }\n }\n //System.out.println(\"I am max plyaer at depth:\" + depth + \"\\n current move is: \" + currentmove + \"\\ncurrentvalue is: \" + currentvalue+\" my alpha is \" + alpha + \" my beta is \" + beta);\n\n return currentmovenode;\n }\n //do min player\n else if (amimaxplayer==0){\n int currentvalue = 999999999;\n PentagoMove currentmove =legalmoves.get(0);\n MoveNode currentmovenode = new MoveNode(currentmove,currentvalue);\n for (int i = 0; i < legalmoves.size(); i++) {\n PentagoBoardState newboard = (PentagoBoardState) pbs.clone();\n PentagoMove movetoprocess = legalmoves.get(i);\n newboard.processMove(movetoprocess);\n\n MoveNode scoreAfterMove = ab(newboard, currentvalue, alpha, beta, 1, depth + 1, requireddepth);\n if (scoreAfterMove.value < currentvalue) {\n currentvalue = scoreAfterMove.value;\n currentmove = movetoprocess;\n currentmovenode.value = currentvalue;\n currentmovenode.MyMove = currentmove;\n //System.out.println(\"I am min plyaer at depth:\" + depth + \"\\n current move is: \" + currentmove + \"\\ncurrentvalue is: \" + currentvalue);\n }\n beta = Math.min(beta,currentvalue);\n if (alpha>=beta){\n //System.out.println(\"Get pruned my alpha is \" + alpha + \" my beta is \" + beta );\n break;\n }\n }\n return currentmovenode;\n }\n //System.out.println(\"move val \" + moveNode.value);\n return moveNode;\n }","title":""},{"docid":"79de7aa12a3bd05a66a1762335d07986","score":"0.66441154","text":"public static PentagoMove excecuteMiniMax(PentagoBoardState bs, int depth) {\n\t\tlong timerStart = System.currentTimeMillis();\n\t\tPentagoMove bestMove = null;\n\t\tint highestVal = Integer.MIN_VALUE;\n\t\tint lowestVal = Integer.MAX_VALUE;\n\t\tint currentVal = 0;\n\t\tint possibleMoves = bs.getAllLegalMoves().size();\n\t\tfor (PentagoMove move : bs.getAllLegalMoves()) {\n\t\t\tPentagoBoardState stateClone = (PentagoBoardState) bs.clone();\n\t\t\tstateClone.processMove(move);\n\t\t\tif(bs.getTurnPlayer() == 0) {\n\t\t\t\tMax(stateClone, depth-1);\n\t\t\t}\n\t\t\telse if(bs.getTurnPlayer() == 1) {\n\t\t\t\tMin(stateClone, depth-1);\n\t\t\t}\n\t\t\tif (bs.getTurnPlayer() == 0 && currentVal >= highestVal) {\n\t\t\t\thighestVal = currentVal;\n\t\t\t\tbestMove = move;\n\t\t\t}\n\t\t\telse if (bs.getTurnPlayer() == 1 && currentVal <= lowestVal) {\n\t\t\t\tlowestVal = currentVal;\n\t\t\t\tbestMove = move;\n\t\t\t}\n\t\t\tif (System.currentTimeMillis() - timerStart >= 1900) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tlong totalTime = System.currentTimeMillis() - timerStart;\n\t\tSystem.out.println(totalTime);\n\t\treturn bestMove;\n\t}","title":""},{"docid":"99cb2bf3c8550fd95bc37b4ffa1de9e0","score":"0.64711577","text":"@Override\r\n\tpublic int move(int lastMove, int[] takenList, int depthLimit) \r\n\t{\r\n\t\tGameState myState = new GameState(takenList, lastMove);\r\n\t\tdouble maxValue = max_value(myState, depthLimit);\r\n\t\tint myBestMove = myState.bestMove;\r\n\t\tif (myState.leaf) //why did i do this\r\n\t\t{\r\n\t\t\treturn -1;\r\n\t\t}\r\n\t\treturn myBestMove;\r\n\t}","title":""},{"docid":"8b7422f01b627ecb06336ef275092928","score":"0.6449242","text":"private int negaMax(int depth, String indent) {\r\n\r\n\t\tif (depth <= 0\r\n\t\t\t|| this.chessGame.getGameState() == ChessGame.GAME_STATE_END_WHITE_WON\r\n\t\t\t|| this.chessGame.getGameState() == ChessGame.GAME_STATE_END_BLACK_WON){\r\n\t\t\t\r\n\t\t\treturn evaluateState();\r\n\t\t}\r\n\t\t\r\n\t\tList<Move> moves = generateMoves(false);\r\n\t\tint currentMax = Integer.MIN_VALUE;\r\n\t\t\r\n\t\tfor(Move currentMove : moves){\r\n\t\t\t\r\n\t\t\texecuteMove(currentMove);\r\n\t\t\t//ChessConsole.printCurrentGameState(this.chessGame);\r\n\t\t\tint score = -1 * negaMax(depth - 1, indent+\" \");\r\n\t\t\t//System.out.println(indent+\"handling move: \"+currentMove+\" : \"+score);\r\n\t\t\tundoMove(currentMove);\r\n\t\t\t\r\n\t\t\tif( score > currentMax){\r\n\t\t\t\tcurrentMax = score;\r\n\t\t\t}\r\n\t\t}\r\n\t\t//System.out.println(indent+\"max: \"+currentMax);\r\n\t\treturn currentMax;\r\n\t}","title":""},{"docid":"7b8366e19563eeebf44403664c6b159f","score":"0.6436687","text":"public int minimax(TablutBoardState boardState, boolean isMax, int depth, int alpha, int beta) {\n\t\tif (boardState.gameOver()){\n\t\t\t//System.out.println(\"reach endgame in minimax\");\n\t\t\tif (boardState.getWinner() == boardState.MUSCOVITE) {\n\t return 1000;\n\t }else if (boardState.getWinner()==boardState.SWEDE){\n\t \treturn -1000;\n\t }else{\n\t \treturn 0;\n\t }\n\t\t}\n\t\tif (depth == 0){\n\t\t\t//System.out.println(\"reach bottom in minimax\");\n return heuristic(boardState);\n }\n\t\t//int bestValue;\n\n\t\tif(isMax){\n\t\t\tint bestValue = Integer.MIN_VALUE;\n\t\t\tHashMap<Integer,TablutMove> moveScore = new HashMap<>();\n\t\t\tfor(TablutMove move : boardState.getAllLegalMoves()){\n\t\t\t\tTablutBoardState cloneBS = (TablutBoardState) boardState.clone();\n\t\t\t\tcloneBS.processMove(move);\n\t\t\t\tint val = minimax(cloneBS,false,depth-1,alpha,beta);\n\t\t\t\tmoveScore.put(new Integer(val),move); \n\t\t\t\tbestValue = max(bestValue,val);\n\t\t\t\talpha = max(alpha,bestValue);\n\t\t\t\t//System.out.println(\"alpha: \"+alpha+\", beta: \"+beta);\n\t\t\t\tif (beta <= alpha){\n\t\t\t\t\t//System.out.println(\"prunning: alpha: \"+alpha+\" and beta: \"+beta);\n\t\t\t\t\tbreak;\n\t\t\t\t}\t\n\t\t\t}\n\t\t\tInteger index= Collections.max(moveScore.keySet());\n\t\t\tif(depth == DEPTH){\n\t\t\t\t//System.out.println(\"update move from max\");\n\t\t\t\tbestMove = moveScore.get(index);\n\t\t\t}\n\t\t\t\n moveScore = null;\n\t\t\treturn bestValue;\n\t\t\t\n\t\t}else{\n\t\t\tint bestValue = Integer.MAX_VALUE;\n\t\t\tHashMap<Integer,TablutMove> moveScore = new HashMap<>();\n\t\t\tfor(TablutMove move : boardState.getAllLegalMoves()){\n\t\t\t\tTablutBoardState cloneBS = (TablutBoardState) boardState.clone();\n\t\t\t\tcloneBS.processMove(move);\n\t\t\t\tint val = minimax(cloneBS,true,depth-1,alpha,beta);\n\t\t\t\tmoveScore.put(new Integer(val),move); \n\t\t\t\tbestValue = min(bestValue,val);\n\t\t\t\tbeta = min(beta,bestValue);\n\t\t\t\t//System.out.println(\"alpha: \"+alpha+\", beta: \"+beta);\n\t\t\t\tif(beta<= alpha){\n\t\t\t\t\t//System.out.println(\"prunning: alpha: \"+alpha+\" and beta: \"+beta);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t}\n\t\t\tInteger index= Collections.min(moveScore.keySet());\n\t\t\tif(depth == DEPTH){\n\t\t\t\t//System.out.println(\"update move from min\");\n\t\t\t\tbestMove = moveScore.get(index);\n\t\t\t}\n moveScore = null;\n\t\t\treturn bestValue;\n\t\t\t\n\t\t}\n\t\t\n\t\t\n\t\t//return 0;\n\t}","title":""},{"docid":"b5ed00faa8cf93855eb7b77fcdd258ba","score":"0.6435788","text":"public static Pair<Integer, PentagoMove> miniMaxAlgo(PentagoBoardState boardState, int depth, int playerTurn) {\n\t\t\n\t\tArrayList<PentagoMove> possibleMoves = boardState.getAllLegalMoves();\n\t\tint score = 0;\n\t\t\n\t\t//assign a high or low value to begin with, no move can have that high/low a value\n\t\tif (playerTurn == 1) {\n\t\t\tscore = Integer.MIN_VALUE;\n\t\t}\n\t\telse {\n\t\t\tscore = Integer.MAX_VALUE;\n\t\t}\n\t\t\n\t\tint currentScore;\n\t\tPentagoMove chosenMove = null;\n\t\t\n\t\t//when all moves have been propagated up to the depth desired, find the most valuated move\n\t\tif (possibleMoves.size() == 0 || depth == 0) {\n\t\t\tscore = heuristic(boardState);\n\t\t}\n\t\telse {\n\t\t\t//iterating through all possible moves\n\t\t\tfor(int i = 0; i < possibleMoves.size(); i++) {\n\t\t\t\t\n\t\t\t\t//cloning board to predict 2 moves ahead (depth is 2)\n\t\t\t\tPentagoBoardState clone = (PentagoBoardState) boardState.clone();\n\t\t\t\tclone.processMove(possibleMoves.get(i));\n\t\t\t\tint player = 1 - playerTurn;\n\t\t\t\t\n\t\t\t\t//0 = white, trying to maximize\n\t\t\t\tif (player == 0) {\n\t\t\t\t\t\n\t\t\t\t\t//if a found score is higher, make it the new current score, then use minimize at the lower depth\n\t\t\t\t\t//player will be \"swapped\" (if opponent is current player, we'll simulate the player's turn) when making the recursive call\n\t\t\t\t\tcurrentScore = miniMaxAlgo(clone, depth - 1, player).getKey();\n\t\t\t\t\t\n\t\t\t\t\tif (currentScore >= score) {\n\t\t\t\t\t\tchosenMove = possibleMoves.get(i);\n\t\t\t\t\t\tscore = currentScore;\n\t\t\t\t\t}\n\t\t\t\t} \n\t\t\t\t\n\t\t\t\t//1 = black, trying to minimize\n\t\t\t\telse if (player == 1) {\n\t\t\t\t\t\n\t\t\t\t\t//if a found score is lower, make it the new current score, then use maximize at the lower depth\n\t\t\t\t\t//player will be \"swapped\" (if opponent is current player, we'll simulate the player's turn) when making the recursive call\n\t\t\t\t\tcurrentScore = miniMaxAlgo(clone, depth - 1, player).getKey();\n\t\t\t\t\t\n\t\t\t\t\tif (currentScore <= score) {\n\t\t\t\t\t\tchosenMove = possibleMoves.get(i);\n\t\t\t\t\t\tscore = currentScore;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t//decided to go with pair to avoid having separated methods for the score and the move\n\t\t//it is easy to extract the required value using .getKey() or .getValue()\n\t\tPair<Integer, PentagoMove> answer = new Pair<>(score, chosenMove);\n\t\treturn answer;\n\t}","title":""},{"docid":"7a78acd57ebf9afa83d09660c2577598","score":"0.64132524","text":"private double minimax(int depth, boolean isMaximizingPlayer, double alpha, double beta) {\n // Check the hashmap for this board\n if (this.hashMap.containsKey(this.game.hashCode())) {\n try {\n double value = this.hashMap.get(this.game.hashCode());\n this.hashMapHits += 1;\n return value;\n } catch (NullPointerException ex) {\n System.out.println(\"Minimax - hashmap error\");\n }\n }\n\n // Base case\n if (depth == 0) {\n double value = -BoardEvaluator.evaluate(player, this.game.getBoard());\n this.hashMap.put(this.game.hashCode(), value);\n return value;\n }\n\n List<Move> moves = this.game.getValidMoves(this.game.getActivePlayer());\n\n if (isMaximizingPlayer) {\n double bestValue = Double.NEGATIVE_INFINITY;\n for (Move move : moves) {\n this.game.executeMove(move, false);\n this.game.endTurn(false);\n bestValue = Math.max(bestValue, minimax(depth - 1, !isMaximizingPlayer, alpha, beta));\n this.game.undoMove(move, false);\n this.game.endTurn(false);\n this.moveCount += 1;\n\n alpha = Math.max(alpha, bestValue);\n\n // Alpha-Beta pruning\n if (beta <= alpha) {\n break;\n }\n }\n return bestValue;\n } else {\n double bestValue = Double.POSITIVE_INFINITY;\n for (Move move : moves) {\n this.game.executeMove(move, false);\n this.game.endTurn(false);\n bestValue = Math.min(bestValue, minimax(depth - 1, !isMaximizingPlayer, alpha, beta));\n this.game.undoMove(move, false);\n this.game.endTurn(false);\n this.moveCount += 1;\n\n beta = Math.min(beta, bestValue);\n\n // Alpha-Beta pruning\n if (beta <= alpha) {\n break;\n }\n }\n return bestValue;\n }\n }","title":""},{"docid":"dd91584e4f034289dec7885d12d7cd7e","score":"0.6368211","text":"private int[] maxValue(int[][] currentState, int[] alpha, int[] beta, int depth) {\n int[] bestMove = new int[]{MinimaxUtilties.freeCentralColumn(currentState), Integer.MIN_VALUE, 0};\n\n if (terminalTest(currentState) != 0) {\n return new int[]{0, utility(currentState), maxDepth - depth};\n }\n\n if (depth < 1){\n return new int[]{0, utility(currentState), maxDepth};\n }\n\n if (terminalTest(currentState) == 0 && depth > 0) {\n // find all possible actions for this player from the current game state\n ArrayList<Integer> possibleActions = actions(currentState, 1);\n\n // check if each possible action is better than the best action so far\n for (int i = 0; i < possibleActions.size(); i++) {\n int column = possibleActions.get(i);\n int[][] resultOfAction = result(currentState, column, 1);\n\n // returns [column that was chosen, utility of choosing it]\n int[] currentResult = new int[]{column, minValue(resultOfAction, alpha, beta, depth - 1)[1], maxDepth - depth};\n\n // found a new best action\n // new move is better, or equal to best move but has shallower depth\n if (currentResult[1] > bestMove[1] || (currentResult[1] == bestMove[1] && currentResult[2] < bestMove[2])) {\n bestMove = currentResult;\n }\n\n if (bestMove[1] > alpha[1] || (bestMove[1] == alpha[1] && bestMove[2] < alpha[2])) alpha = bestMove; // new best action is better than the current alpha action\n\n if (alpha[1] >= beta[1]) return alpha; // beta cut-off\n }\n }\n\n return bestMove;\n }","title":""},{"docid":"52738910de753d8aa2e39acfcb3877e0","score":"0.63363177","text":"private Outcome minMax(PossibleBoard posBoard, Icon icon, int depth) {\n Outcome outcome = new Outcome();\n Result result = posBoard.determineOutcome();\n boolean maximiseWin = icon == getIcon();\n\n // BASE CASE\n if (result.gameComplete()) {\n outcome.score = result.getBonus();\n outcome.moveToMake = posBoard.coor;\n outcome.depth = depth;\n return outcome;\n }\n\n ArrayList<PossibleBoard> posNextBoards = getPossibleNextBoards(posBoard, icon);\n int optimalScore = (maximiseWin ? Integer.MIN_VALUE : Integer.MAX_VALUE);\n Coordinate optimalCoor = new Coordinate(0,0);\n int optimalDepth = Integer.MAX_VALUE;\n\n for (PossibleBoard posNextBoard : posNextBoards) {\n Outcome nextOutcome = minMax(posNextBoard, (icon == Icon.CROSSES ? Icon.NOUGHTS : Icon.CROSSES), depth + 1);\n\n if (maximiseWin && nextOutcome.score >= optimalScore) {\n if (nextOutcome.score == optimalScore && nextOutcome.depth < optimalDepth) continue;\n optimalScore = nextOutcome.score;\n optimalCoor = posNextBoard.coor;\n optimalDepth = nextOutcome.depth;\n\n } else if (!maximiseWin && nextOutcome.score <= optimalScore){\n if (nextOutcome.score == optimalScore && nextOutcome.depth < optimalDepth) continue;\n optimalScore = nextOutcome.score;\n optimalCoor = posNextBoard.coor;\n optimalDepth = nextOutcome.depth;\n\n }\n }\n\n outcome.moveToMake = optimalCoor;\n outcome.score = optimalScore;\n outcome.depth = optimalDepth;\n return outcome;\n }","title":""},{"docid":"99c38294190ae776d4cce37873cf69a8","score":"0.63125294","text":"protected Move alphaBetaSearch() {\n\n\t\tdouble value = maxValue(this.parent, Double.NEGATIVE_INFINITY,\n\t\t\t\tDouble.POSITIVE_INFINITY);\n\t\tSystem.out.println(\"value-alpha-beta = \" + value);\n\t\t\n\t\tdouble maxVal = Double.NEGATIVE_INFINITY;\n\t\tMove idealMove = new Move();\n\t\tfor (Node tempNode : this.parent.children) {\n\t\t\tSystem.out.println(\"tempNode.getEvalValue() = \" \n\t\t+ tempNode.getEvalValue());\n\n\t\t\tif (tempNode.getEvalValue() >= maxVal) {\n\t\t\t\t\tidealMove = tempNode.getMove();\n\t\t\t\t\tmaxVal = tempNode.getEvalValue();\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\tif(this.forcedMove != null)\n\t\t\treturn this.forcedMove;\n\t\treturn idealMove;\n\n\t}","title":""},{"docid":"9f12fa23cf0bdb0a7f7499b8f69d6d30","score":"0.6296895","text":"@Override\n public A makeDecision(S state) {\n metrics = new Metrics();\n StringBuffer logText = null;\n P player = game.getPlayer(state);\n List<A> results = orderActions(state, game.getActions(state), player, 0);\n timer.start();\n currDepthLimit = 0;\n do {\n incrementDepthLimit();\n if (logEnabled)\n logText = new StringBuffer(\"depth \" + currDepthLimit + \": \");\n heuristicEvaluationUsed = false;\n ActionStore<A> newResults = new ActionStore<>();\n for (A action : results) {\n double value = minValue(game.getResult(state, action), player, Double.NEGATIVE_INFINITY,\n Double.POSITIVE_INFINITY, 1);\n if (timer.timeOutOccurred())\n break; // exit from action loop\n newResults.add(action, value);\n if (logEnabled)\n logText.append(action).append(\"->\").append(value).append(\" \");\n }\n if (logEnabled)\n System.out.println(logText);\n if (newResults.size() > 0) {\n results = newResults.actions;\n if (!timer.timeOutOccurred()) {\n if (hasSafeWinner(newResults.utilValues.get(0)))\n break; // exit from iterative deepening loop\n else if (newResults.size() > 1\n && isSignificantlyBetter(newResults.utilValues.get(0), newResults.utilValues.get(1)))\n break; // exit from iterative deepening loop\n }\n }\n } while (!timer.timeOutOccurred() && heuristicEvaluationUsed);\n return results.get(0);\n }","title":""},{"docid":"ed1795e832019d4f3e6f3e1cd301fc78","score":"0.628888","text":"private static int max_value(State curr_state) {\n\t\tcounterMinimax++; \r\n\r\n\r\n\t\t//Check if the current state is a terminal state, if it is, return\r\n\t\t//its terminal value\r\n\t\tif(curr_state.isTerminal()){\r\n\t\t\treturn curr_state.getScore();\r\n\t\t}\r\n\r\n\t\tint max_value = Integer.MIN_VALUE;\r\n\t\tState[] successors = curr_state.getSuccessors('1');\r\n\r\n\t\tif(successors.length == 0 && curr_state.isTerminal() == false){\r\n\t\t\tmax_value = Math.max(max_value, min_value(curr_state));\r\n\t\t}\r\n\t\t//\t\telse if(successors.length != 0 && curr_state.isTerminal() == false){\r\n\r\n\t\t//Get the successors of the current state, as dark always runs first\r\n\t\t//it will call maxValue;\r\n\r\n\r\n\t\t//Select the successor that returns the biggest value\r\n\t\tfor(State state : successors){\r\n\t\t\tmax_value = Math.max(max_value, min_value(state));\r\n\t\t}\t\r\n\t\t//\t\t}\r\n\t\treturn max_value;\r\n\t}","title":""},{"docid":"6a8fa8819efb2654e9be7564b986fced","score":"0.6265943","text":"private int alphaBetaMinimax (GameTreeNode node, int alpha, int beta, boolean isMax, Map<GameTreeNode, Integer> visited) {\n\n if(node.remaining == 0) {\n //System.out.println(\"Terminal State: Up : Score \" + node.score);\n return node.score;\n }\n if(visited.containsKey(node)) {\n //System.out.println(\"Memoized State: Up : Score \" + visited.get(node));\n return visited.get(node);\n }\n \n \n if(isMax) {\n int minimaxScore = Integer.MIN_VALUE;\n for(int i = 0; i < MAX_REMOVAL; i++) {\n \n GameTreeNode expandingChild = node.generateChild(1 + i);\n \n if(expandingChild == null) {\n break;\n }\n \n //System.out.println(\"Remaining \" + node.remaining + \" Down\");\n //\n minimaxScore = Math.max(minimaxScore, alphaBetaMinimax(expandingChild, alpha, beta, false, visited));\n alpha = Math.max(alpha, minimaxScore);\n //\n //System.out.println(\"Remaining \" + node.remaining + \" Up : Score: \" + minimaxScore);\n //\n if(beta <= alpha) {\n //System.out.println(\"Pruning: \" + node.remaining + \" child index \" + i+1);\n break;\n }\n }\n visited.put(node, minimaxScore);\n node.score = minimaxScore;\n return minimaxScore;\n }\n else {\n int minimaxScore = Integer.MAX_VALUE;\n for(int i = 0; i < MAX_REMOVAL; i++) {\n \n GameTreeNode expandingChild = node.generateChild(1 + i);\n if(expandingChild == null) {\n break;\n }\n //\n \n //\n //System.out.println(\"Remaining \" + node.remaining + \" Down\");\n //\n minimaxScore = Math.min(minimaxScore, alphaBetaMinimax(expandingChild, alpha, beta, true, visited));\n beta = Math.min(beta, minimaxScore);\n //\n //System.out.println(\"Remaining \" + node.remaining + \" Up : Score: \" + minimaxScore);\n //\n if(beta <= alpha) {\n //System.out.println(\"Pruning: \" + node.remaining + \" child index \" + i+1);\n break;\n }\n }\n visited.put(node, minimaxScore);\n node.score = minimaxScore;\n return minimaxScore;\n }\n }","title":""},{"docid":"513cda835cfcd4bad0bd64f250189f70","score":"0.60198337","text":"private double evaluate() {\n // check for draws first, most lickely\n if (board.gameState() == MNKGameState.DRAW) return 0;\n else if (board.gameState() == MY_WIN) return 2 * M * N; // 2 times max depth\n else if (board.gameState() == ENEMY_WIN) return -2 * M * N;\n else {\n evaluated++;\n // keep the heuristic evaluation between 1 and -1\n return board.value();\n }\n }","title":""},{"docid":"3487aa1477850f735b791d8614fea70c","score":"0.60172397","text":"public MoveWrapper minimax(GameBoardState gameState, int depth, MoveWrapper alpha, MoveWrapper beta,\n\t\t\tboolean maximizingPlayer) {\n\n\t\tMoveWrapper maxEval = new MoveWrapper(gameState.getLeadingMove(), Integer.MIN_VALUE); // -infinity\n\n\t\tif (gameState.isTerminal() || AgentController.getAvailableMoves(gameState, playerTurn).isEmpty() || depth == 0) {\n\t\t\tnodesExamined++;\n\t\t\tmaxEval.setMoveReward((int) AgentController.getGameEvaluation(gameState, playerTurn));\n//\t\t\tSystem.out.println(\"in terminal statement \" + maxEval.getMoveReward());\n\t\t\treturn maxEval;\n\t\t}\n\n\t\tif (maximizingPlayer) {\n\n\t\t\tfor (ObjectiveWrapper move : AgentController.getAvailableMoves(gameState, playerTurn)) {\n\t\t\t\tMoveWrapper eval = minimax(AgentController.getNewState(gameState, move), depth - 1, alpha, beta, false);\n\n\t\t\t\tif (eval.getMoveReward() > maxEval.getMoveReward()) { \n\t\t\t\t\tmaxEval.setObjectiveInformation(move);\n\t\t\t\t\tmaxEval.setMoveReward(eval.getMoveReward());\n//\t\t\t\t\tSystem.out.println(\"Player: \" + playerTurn + \"Maximizing - Depth: \" + depth + \", eval value: \" + eval.getMoveReward() + \", maxEval value: \" + maxEval.getMoveReward());\n\t\t\t\t}\n\n\t\t\t\t// alpha beta pruning\n\t\t\t\t if (eval != null && alpha.compareTo(eval) < 0) {\n\t\t\t\t alpha = eval;\n\t\t\t\t }\n\t\t\t\t\n\t\t\t\t if (beta.compareTo(alpha) <= 0) {\n\t\t\t\t prunedCounter++;\n\t\t\t\t break;\n\t\t\t\t }\n\t\t\t}\n\t\t\treturn maxEval;\n\n\t\t} else {\n\t\t\tMoveWrapper minEval = new MoveWrapper(gameState.getLeadingMove(), Integer.MAX_VALUE); // +infinity\n\n\t\t\tfor (ObjectiveWrapper move : AgentController.getAvailableMoves(gameState, GameTreeUtility.getCounterPlayer(playerTurn))) {\n\t\t\t\tMoveWrapper eval = minimax(AgentController.getNewState(gameState, move), depth - 1, alpha, beta, true);\n\n\t\t\t\tif (eval.getMoveReward() < minEval.getMoveReward()) { \n\t\t\t\t\tminEval.setObjectiveInformation(move);\n\t\t\t\t\tminEval.setMoveReward(eval.getMoveReward());\n//\t\t\t\t\tSystem.out.println(\"Player: \" + playerTurn + \"Minimizing - Depth: \" + depth + \", eval value: \" + eval.getMoveReward() + \", minEval value: \" + minEval.getMoveReward());\n\t\t\t\t}\n\n\t\t\t\t// alpha beta pruning\n\t\t\t\t if (eval != null && beta.compareTo(eval) > 0) {\n\t\t\t\t beta = eval;\n\t\t\t\t }\n\t\t\t\t if (beta.compareTo(alpha) <= 0) {\n\t\t\t\t prunedCounter++;\n\t\t\t\t break;\n\t\t\t\t }\n\t\t\t}\n\t\t\treturn minEval;\n\t\t}\n\n\t}","title":""},{"docid":"c8af00f5fc52e3c20e65fff4d2a945df","score":"0.60169095","text":"private int getBestMove(int[] board, int depth, boolean turn) {\n int boardCopy[];\n if (depth <= 0) {\n return 0;\n }\n if (depth > STEP_BACK_DEPTH) {\n try {\n Thread.sleep(3);\n } catch (InterruptedException e) {\n e.printStackTrace();\n if (shouldStop()) {\n Log.d(Constants.MY_TAG,\"out CalculatingBot\");\n unlock();\n return 0;\n }\n }\n }\n if (turn) {\n int minimum = MAXIMUM_POSSIPLE_SCORE_DIFFERENCE;\n for (int i = 0; i < 5; i++) {\n if (board[i] < 2) {\n continue;\n }\n boardCopy = board.clone();\n int x = playMove(boardCopy, i);\n int y = 0;\n if (!hasPlayer2Move(boardCopy)) {\n if (hasPlayer1Move(boardCopy)) {\n y = getBestMove(boardCopy, depth - 1, turn);\n } else {\n for (int j = 0; j < 5; j++) {\n y = y - boardCopy[j];\n }\n for (int j = 5; j < 10; j++) {\n y = y + boardCopy[j];\n }\n }\n } else {\n y = getBestMove(boardCopy, depth - 1, ! turn);\n }\n int z = y - x;\n if (z < minimum) {\n minimum = z;\n }\n }\n int i = 10;\n if (board[2] < 2) {\n return minimum;\n }\n boardCopy = board.clone();\n int x = playMove(boardCopy, i);\n int y = 0;\n if (!hasPlayer2Move(boardCopy)) {\n if (hasPlayer1Move(boardCopy)) {\n y = getBestMove(boardCopy, depth - 1, turn);\n } else {\n for (int j = 0; j < 5; j++) {\n y = y - boardCopy[j];\n }\n for (int j = 5; j < 10; j++) {\n y = y + boardCopy[j];\n }\n }\n } else {\n y = getBestMove(boardCopy, depth - 1, !turn);\n }\n int z = y - x;\n if (z < minimum) {\n minimum = z;\n }\n return minimum;\n } else {\n int maximum = MINIMUM_POSSIPLE_SCORE_DIFFERENCE;\n for (int i = 5; i < 10; i++) {\n if (board[i] < 2) {\n continue;\n }\n boardCopy = board.clone();\n int x = playMove(boardCopy, i);\n int y = 0;\n if (!hasPlayer1Move(boardCopy)) {\n if (hasPlayer2Move(boardCopy)) {\n y = getBestMove(boardCopy, depth - 1, turn);\n } else {\n for (int j = 0; j < 5; j++) {\n y = y - boardCopy[j];\n }\n for (int j = 5; j < 10; j++) {\n y = y + boardCopy[j];\n }\n }\n } else {\n y = getBestMove(boardCopy, depth - 1, !turn);\n }\n int z = y + x;\n if (z > maximum) {\n maximum = z;\n }\n }\n int i = 11;\n if (board[7] < 2) {\n return maximum;\n }\n boardCopy = board.clone();\n int x = playMove(boardCopy, i);\n int y = 0;\n if (!hasPlayer1Move(boardCopy)) {\n if (hasPlayer2Move(boardCopy)) {\n y = getBestMove(boardCopy, depth - 1, turn);\n } else {\n for (int j = 0; j < 5; j++) {\n y = y - boardCopy[j];\n }\n for (int j = 5; j < 10; j++) {\n y = y + boardCopy[j];\n }\n }\n } else {\n y = getBestMove(boardCopy, depth - 1, !turn);\n }\n int z = y + x;\n if (z > maximum) {\n maximum = z;\n }\n return maximum;\n }\n }","title":""},{"docid":"d6b5fa5c8fd9920a64953a6b7959a5cd","score":"0.6011439","text":"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}","title":""},{"docid":"cda6deb4c664da0c378d56b3206c5236","score":"0.5940419","text":"private void gameTree(MinimaxNode<GameState> currentNode, int depth, int oIndex){\n currentNode.setNodeIndex(oIndex); \n if (depth == 0) {\n return;\n }\n else{\n if (currentNode.getState().isDead(oIndex)){ //checks to see if current player is dead, if so, just skips their moves\n int newIndex = (oIndex + 1) % currentNode.getState().getNrPlayers();\n/* if(oIndex == 3){\n newIndex = 0;\n }\n else{\n newIndex = oIndex + 1;\n }*/\n gameTree(currentNode, depth-1, newIndex);\n }\n else{\n //this if statement sets up chance nodes, if the target has been met it will create 5 children nodes with randomly generated new target postitions \n if(!currentNode.getState().hasTarget()){\n currentNode.setChanceNode();\n for(int i = 1; i <= 5; i++){\n try{\n GameState newState = (GameState)currentNode.getState().clone();\n newState.chooseNextTarget();\n MinimaxNode<GameState> childNode = new MinimaxNode(newState);\n childNode.setProbability(0.2);\n currentNode.addChild(childNode); \n }\n catch (CloneNotSupportedException e){\n System.out.println(\"Clone not excepted\");\n }\n \n }\n for (int i = 0; i < currentNode.getNumberOfChildren(); i++){\n gameTree(currentNode.getChildren().get(i), depth, oIndex);\n }\n\n }\n else{\n List<Integer> options = new ArrayList();\n for (int i = 1; i <= 4; i++) {\n if (currentNode.getState().isLegalMove(oIndex, i)){\n options.add(i);\n }\n }\n for (int i = 0; i < options.size(); i++){\n try{\n GameState newState = (GameState)currentNode.getState().clone();\n newState.setOrientation(oIndex, options.get(i));\n newState.updatePlayerPosition(oIndex);\n MinimaxNode<GameState> childNode = new MinimaxNode(newState);\n currentNode.addChild(childNode);\n }\n catch (CloneNotSupportedException e){\n System.out.println(\"Clone not excepted\");\n }\n }\n int newIndex = (oIndex + 1) % currentNode.getState().getNrPlayers();\n /* if(oIndex == 3){\n newIndex = 0;\n }\n else{\n newIndex = oIndex + 1;\n }*/\n for (int i = 0; i < currentNode.getNumberOfChildren(); i++){\n gameTree(currentNode.getChildren().get(i), depth-1, newIndex);\n }\n } \n } \n }\n }","title":""},{"docid":"91fc496745e42f4ba470dfe78adc83c8","score":"0.5914755","text":"public double calculateVal(DraughtsState s, int depth) {\n int[] pieces = s.getPieces(); \n \n \n // This is where the actual heuristic is calculated. because the situation is slightly different for the white and black\n // player their heuristic is calculated seperately.\n double h = 0;\n int enemypieces = 0;\n for (int i = 1; i < pieces.length; i++) {\n int piece = pieces[i];\n \n // If we are white, substract 1, giving the white piece of the same category.\n if (piece == BLACKPIECE + ((isWhite) ? -1 : 0) || piece == BLACKKING + ((isWhite) ? -1 : 0)) {\n enemypieces++;\n }\n \n //for the kings it is not checked whether they are on the sides of the board or not since they have more movement freedom\n //and their is no real benifit for them to be at the sides.\n h += SQ_LEFT(i) * SQ_RIGHT(i) * ((piece == WHITEPIECE) ? 1.5 : 0) - SQ_LEFT(i) * SQ_RIGHT(i) * ((piece == BLACKPIECE) ? 1 : 0) + \n ((piece == WHITEKING) ? 4 : 0) - ((piece == BLACKKING) ? 5 : 0) + 0.3 * is_square(i, pieces);\n \n }\n \n // Victory rush\n if(enemypieces < 4) {\n h += 1;\n }\n\n \n if (isWhite) {\n return h;\n } else\n \n return -h;\n }","title":""},{"docid":"fa1aaa9a5742800b0800fba1bd180698","score":"0.5909432","text":"@Override\r\n\t\tpublic Action BestMove(AI_Domain game) {\r\n\t\t\t return new Action(minimax(game,true,depth,true,null).getPath());\r\n\t\t}","title":""},{"docid":"83d45a72e288c96f382664c60fc634d1","score":"0.5908354","text":"public HusMove MinimaxAB(HusBoardState board_state, int depth, double alpha, double beta){\n \n \n ArrayList<HusMove> moves = board_state.getLegalMoves();\n double maxScore = 0;\n HusMove maxMove = moves.get(0);\n \n for(int i = 0; i< moves.size(); i++){\n \n HusBoardState cloned_board_state = (HusBoardState) board_state.clone();\n cloned_board_state.move(moves.get(i));\n \n double score = MinValue(cloned_board_state, depth-1, alpha, beta);\n \n if (score > maxScore){\n maxScore = score;\n maxMove = moves.get(i);\n }\n }\n //System.out.println(\"The best move: \"+maxMove.getPit());\n\n return maxMove;\n }","title":""},{"docid":"9525f1c1bdc025031fdffc7e39b66d2d","score":"0.59045696","text":"public int recurseReward(int initialState) {\n\t\tint maxValue = -100000;\n\t\t\n\t\tfor(int action = 0; action < this.columns; action++) {\n\t\t\tif(!isActionLegal(initialState, action)){\n\t\t\t\tcontinue;\n\t\t\t}else {\n\t\t\t\tint potNewState = getStateActionMap(initialState, action);\n\t//\t\t\tint pNewColumns = potNewState % (int)Math.sqrt(this.rows);\n\t//\t\t\tint pNewRows = (potNewState - pNewColumns)/(int)Math.sqrt(this.rows);\n\t\t\t\t\n\t\t\t\tif(this.qGrid[initialState][action] > maxValue) {\n\t\t\t\t\tmaxValue = this.qGrid[initialState][action];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tSystem.out.println(\"De max value is: \" + maxValue);\n\t\treturn maxValue;\n\t}","title":""},{"docid":"f0b09ad8db02fda833da8400fd7ac3b5","score":"0.5903188","text":"int getMax_depth();","title":""},{"docid":"e94f013902eaa0c4d0ba59f34fdcd9ab","score":"0.58976096","text":"private int calculateNextMove(@TTTConstants.Sign int sign, int depth) {\n\n if (isWin(computerSign, false)) {\n return 10 - depth;\n } else if (isWin(playerSign, false)) {\n return depth - 10;\n }\n\n if (depth >= 9) {\n return 0;\n }\n\n List<Integer> scores = new ArrayList<>(), rowIndices = new ArrayList<>(), columnIndices = new ArrayList<>();\n\n for (int i = 0; i < 3; i++) {\n for (int j = 0; j < 3; j++) {\n if (board[i][j] == TTTConstants.EMPTY) {\n board[i][j] = sign;\n scores.add(calculateNextMove(getOppositeSign(sign), depth + 1));\n rowIndices.add(i);\n columnIndices.add(j);\n board[i][j] = TTTConstants.EMPTY;\n }\n }\n }\n\n if (sign == computerSign) {\n int maxScore = -100;\n for (int i = 0; i < scores.size(); i++) {\n if (scores.get(i) > maxScore) {\n maxScore = scores.get(i);\n }\n }\n return randomizeScore(maxScore, scores, rowIndices, columnIndices);\n\n } else {\n int minScore = 100;\n for (int i = 0; i < scores.size(); i++) {\n if (scores.get(i) < minScore) {\n minScore = scores.get(i);\n }\n }\n return randomizeScore(minScore, scores, rowIndices, columnIndices);\n }\n }","title":""},{"docid":"4316074be4744cd42fc4bbc06cb390e3","score":"0.58826023","text":"private Pair<Double, Move> minimax(OthelloBoard board, OthelloSide side, int depth, int max_depth, \n\t\t\t\t\t\t\t\tMove m, double alpha, double beta) {\n\t\tdouble bestScore;\n\t\tint turncount = turn;\n\t\tMove bestMove;\n\t\t//System.out.println(\"Start of minimax. Depth: \" + depth + \" Side: \" + side);\n\t /* int state = board.getState();\n\t\tif (state == OthelloBoard.DRAW)\n\t return new Pair<Double, Move>(0, m);\n\t if ((state == OthelloBoard.BLACK_WINS) && (side == OthelloSide.BLACK)) \n\t return new Pair<Double, Move>(Double.POSITIVE_INFINITY, m); \n\t if ((state == OthelloBoard.WHITE_WINS) && (side == OthelloSide.WHITE))\n\t return new Pair<Double, Move>(Double.POSITIVE_INFINITY, m);\n\t if ((state == OthelloBoard.BLACK_WINS) && (side == OthelloSide.WHITE))\n\t return new Pair<Double, Move>(Double.NEGATIVE_INFINITY, m);\n\t if ((state == OthelloBoard.WHITE_WINS) && (side == OthelloSide.BLACK))\n\t return new Pair<Double, Move>(Double.NEGATIVE_INFINITY, m);*/\n\t\tif(board.isDone()) {\n\t\t\tdouble endgame = board.countBlack() - board.countWhite();\n\t\t\treturn new Pair<Double, Move>(endgame, m);\n\t\t}\n\t\tif(depth == max_depth) {\n\t\t\tdouble mdScore = evaluator(board, side);\n\t\t\treturn new Pair<Double, Move>(mdScore, m);\t\t\t\n\t\t} else {\n\t\t\tLinkedList<Move> moveList = getMoveList(board, side);\n\t\t\tif(depth == 0) {\n\t \t\t\tLinkedList<Move> corners = new LinkedList<Move>();\n\t\t\t\tfor(Move mv : moveList) {\n\t\t\t\t\tif(board.isCorner(mv)) {\n\t\t\t\t\t\tcorners.add(mv);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(corners.size() != 0) {\n\t\t\t\t\tMove bcorner = null;\n\t\t\t\t\tdouble best = -Double.MAX_VALUE;\n\t\t\t\t\tfor(Move ml : corners) {\n\t\t\t\t\t\tdouble temp = evalMove(board, side, ml);\n\t\t\t\t\t\tif(temp > best) {\n\t\t\t\t\t\t\tbest = temp;\n\t\t\t\t\t\t\tbcorner = ml;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\treturn new Pair<Double, Move>(best, bcorner);\n\t\t\t\t}\n\t\t\t}\n\t\t\t//System.out.println(moveList.toString());\n\t\t\tbestScore = -Double.MAX_VALUE;\n\t\t\tbestMove = new Move(1,1);\n\t\t\tif(moveList.size() == 0) {\n\t\t\t\tdouble mdScore = evaluator(board, side);\n\t\t\t\treturn new Pair<Double, Move>(mdScore, m);\n\t\t\t} else {\n\t\t\t\tfor(int i = 0; i < moveList.size(); i++) {\n\t\t\t\t\tOthelloBoard tempBoard = board.copy();\n\t\t\t\t\tMove move = moveList.get(i);\n\t\t\t\t\ttempBoard.move(move, side);\n\t\t\t\t\talpha = -(minimax(tempBoard, side.opposite(), depth + 1, max_depth, move, -beta, -alpha)).score;\n\t\t\t\t\t//System.out.println(\"Side: \" + side);\n\t\t\t\t\t//System.out.println(\"alpha (before IF): \" + alpha);\n\t\t\t\t\t//System.out.println(\"bestScore (before IF): \" + bestScore);\n\t\t\t\t\tif(beta <= alpha) {\n\t\t\t\t\t\treturn new Pair<Double, Move>(alpha, move);\n\t\t\t\t\t}\n\t\t\t\t\tif(alpha > bestScore ) {\n\t\t\t\t\t\tbestScore = alpha;\n\t\t\t\t\t\tbestMove = move;\n\t\t\t\t\t\t//bestMove.copy(move);\n\t\t\t\t\t\t//System.out.println(\"theScore(IF): \" + alpha);\n\t\t\t\t\t\t//System.out.println(\"bestScore(IF): \" + bestScore);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\treturn new Pair<Double, Move>(bestScore, bestMove);\n\t\t\t}\n\t\t}\n\t}","title":""},{"docid":"6c9c05ffe6d5d008df9e0e31670714f3","score":"0.5875684","text":"private double maxValue(Board state, int depth, double alpha, double beta) {\n if(terminalTest(state, depth))\n return utility(state);\n\n double value = Double.NEGATIVE_INFINITY;\n for(Move action: actions(state)){\n Board nextState = new Board(state);\n\n value = Math.max(value,\n minValue(result(nextState, action),\n depth-1, alpha, beta));\n\n if(value >= beta)\n return value;\n\n alpha = Math.max(alpha, value);\n }\n\n return value;\n }","title":""},{"docid":"fecf60ed54e1a36746862fd393f6fa02","score":"0.58360726","text":"private int maxValue(Node state, int alpha, int beta) {\n\t\t\n\t\t\n\t\tthis.nodesExplored++;\n\t\tthis.nodesExploredThisTurn++;\n\t\t\n\t\tif (this.cutoffTest(state)) {\n\t\t\treturn state.eval(this.player);\n\t\t}\n\t\t\n\t\tArrayList<Move> legalMoves = state.getGame().getLegalMoves();\n\t\n\t\tif (this.moveOrdering) {\n\t\t\tthis.quickSort(state, legalMoves, 0, legalMoves.size() - 1, false);\n\t\t}\n\t\t\n\t\tint v = Integer.MIN_VALUE;\n\t\tMove bestMove = null;\n\t\tfor (Move move : legalMoves) {\n\t\t\t\n\t\t\tif (System.currentTimeMillis() - startMili > this.maxTime * 1000) {\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\t\n\t\t\tint value = this.minValue(state.result(move), alpha, beta);\n\t\t\tif (v < value) { //\n\t\t\t\tv = value;\n\t\t\t\tbestMove = move;\n\t\t\t}\n\t\t\t\n\t\t\tif (v >= beta) {\n\t\t\t\tstate.setBestMove(bestMove);\n\t\t\t\t\n\t\t\t\treturn v;\n\t\t\t}\n\t\t\talpha = Math.max(v, alpha);\n\t\t}\n\t\tstate.setBestMove(bestMove);\n\t\treturn v;\n\t}","title":""},{"docid":"18ecb1909b89a66604edbb2cbfbdd31a","score":"0.5834713","text":"public MoveNode getBestMove() {\n if (rootValues.isEmpty()) {\n return null;\n }\n\n MoveNode moveNode = rootValues.get(0);\n int maxScore = moveNode.getMinimaxValue();\n\n for(MoveNode m : rootValues) {\n if(m.getMinimaxValue() > maxScore) {\n moveNode = m;\n maxScore = m.getMinimaxValue();\n }\n }\n\n return moveNode;\n }","title":""},{"docid":"21944de9f03825dd6628a0d8845b6f96","score":"0.5804737","text":"private Move getBestMove() {\r\n\t\tSystem.out.println(\"getting best move\");\r\n\t\tChessConsole.printCurrentGameState(this.chessGame);\r\n\t\tSystem.out.println(\"thinking...\");\r\n\t\t\r\n\t\tList<Move> validMoves = generateMoves(false);\r\n\t\tint bestResult = Integer.MIN_VALUE;\r\n\t\tMove bestMove = null;\r\n\t\t\r\n\t\tfor (Move move : validMoves) {\r\n\t\t\texecuteMove(move);\r\n\t\t\t//System.out.println(\"evaluate move: \"+move+\" =========================================\");\r\n\t\t\tint evaluationResult = -1 * negaMax(this.maxDepth,\"\");\r\n\t\t\t//System.out.println(\"result: \"+evaluationResult);\r\n\t\t\tundoMove(move);\r\n\t\t\tif( evaluationResult > bestResult){\r\n\t\t\t\tbestResult = evaluationResult;\r\n\t\t\t\tbestMove = move;\r\n\t\t\t}\r\n\t\t}\r\n\t\tSystem.out.println(\"done thinking! best move is: \"+bestMove);\r\n\t\treturn bestMove;\r\n\t}","title":""},{"docid":"74d9e084a5fc617ecd90bbaa9abfc289","score":"0.57926786","text":"private static double minMaxPruning(GameState state, int depth, double alpha, double beta){\n\n double v = 0;\n\n // A vector containing all possible children states if this current state\n Vector<GameState> nextStates = new Vector<GameState>();\n state.findPossibleMoves(nextStates);\n\n /**\n // Try testing win/loss before going into depth search\n Move m = state.getMove();\n\n if(m.isXWin()){\n return 1000+depth;\n }\n\n else if(m.isOWin()){\n return -1;\n }\n */\n if (depth==0 || nextStates.size()==0){\n v = evalState(state);\n }\n\n // 2 is 'O' so if nextPlayer is 2 it means that the current player is 'X'\n else if (state.getNextPlayer() == 1){\n v=Double.NEGATIVE_INFINITY;\n\n for(GameState s: nextStates){\n v = Math.max(v, minMaxPruning(s,depth-1, alpha, beta));\n alpha = Math.max(alpha, v);\n if(beta <= alpha) {\n return v;\n }\n }\n }\n // 1 is 'X' so if nextplayer is 1 it means that the current player is 'O'\n else if (state.getNextPlayer() == 2){\n v=Double.POSITIVE_INFINITY;\n\n for(GameState s: nextStates){\n v= Math.min(v,minMaxPruning(s,depth-1, alpha, beta));\n beta = Math.min(beta, v);\n if( beta <= alpha ) {\n return v;\n }\n }\n }\n return v;\n }","title":""},{"docid":"b489bfe82b98d81f8f07985aa29ca289","score":"0.57754046","text":"public double maxValue(S state, P player, double alpha, double beta, int depth) {\n updateMetrics(depth);\n if (game.isTerminal(state) || depth >= currDepthLimit || timer.timeOutOccurred()) {\n return eval(state, player);\n } else {\n double value = Double.NEGATIVE_INFINITY;\n for (A action : orderActions(state, game.getActions(state), player, depth)) {\n value = Math.max(value, minValue(game.getResult(state, action), //\n player, alpha, beta, depth + 1));\n if (value >= beta)\n return value;\n alpha = Math.max(alpha, value);\n }\n return value;\n }\n }","title":""},{"docid":"e01e7c98c595d423e4759d1d9e656d48","score":"0.5774815","text":"@Override\n\tpublic Move getMove(Board game) {\n\t\t\n\t\tthis.maximumDepthReachedThisTurn = 0;\n\t\tArrayList<Move> moveList = game.getLegalMoves();\n\t\t/* tell the player what her options are */\n\t\tSystem.out.println(\"Turn \" + game.getTurn() + \", legal moves (\" + moveList.size() + \"): \");\n\t\tfor(Move m : moveList) {\n\t\t\tSystem.out.println(m.toString());\n\t\t}\n\t\t\n\t\tthis.nodesExploredThisTurn = 0;\n\t\tthis.isEndGameStatusFound = false;\n\t\tthis.maxDepth = 1;\n\t\tthis.bestMoveSoFar = null;\n\t\tthis.startMili = System.currentTimeMillis();\n\t\n\t\twhile (System.currentTimeMillis() - startMili < this.maxTime * 1000) {\n\t\t\tNode state = new Node(game, null, 0);\n\t\t\tthis.bestMoveSoFar = this.alphaBetaSearch(state);\n\t\t\t\n\t\t\tif (this.isEndGameStatusFound)\n\t\t\t\tbreak;\n\t\t\t\n\t\t\tthis.maxDepth++;\n\t\t}\n\n\t\tlong endMili=System.currentTimeMillis();\n\t\tdouble duration = ((double)(endMili - startMili)) / 1000.0;\n\t\t\n\t\tthis.maximumDepthReached += this.maximumDepthReachedThisTurn;\n\t\tSystem.out.println(\"Maximum depth reached at this turn: \" + this.maximumDepthReachedThisTurn);\n\t\tSystem.out.println(\"Maximum depth reached from game start state: \" + this.maximumDepthReached);\n\t\tSystem.out.println(\"Nodes explored at this turn: \" + this.nodesExploredThisTurn);\n\t\tSystem.out.println(\"Total nodes explored: \" + this.nodesExplored);\n\t\tSystem.out.println(\"Time to decide on a move: \" + duration);\n\n\t\treturn this.bestMoveSoFar;\n\t\t\n\t}","title":""},{"docid":"29572f159b3986dd10f82539fcca39d5","score":"0.57408774","text":"public Move chooseMove(TablutBoardState boardState) {\n \n \tList<TablutMove> options = boardState.getAllLegalMoves();\n\n \n bestMove = options.get(((int) MyTools.getSomething())% (options.size()));\n\n int depth = DEPTH;\n int opponent = boardState.getOpponent();\n boolean isMax;\n if(opponent==1){\n \tisMax = true;\n \t//System.out.println(\"I'm max\");\n }\n else{\n \tisMax = false;\n \t//System.out.println(\"I'm min\");\n }\n //bestMove = \n \n int bestvalue = minimax(boardState,isMax, depth,-10000,10000);\n \n \n //int minNumberOfOpponentPieces = boardState.getNumberPlayerPieces(opponent);\n //boolean moveCaptures = false;\n //System.out.println(\"minimax return value: \"+bestvalue);\n \n \n \n \n return bestMove;\n }","title":""},{"docid":"e6c416467ac13035c60597b702c572b9","score":"0.57305664","text":"private static int min_value(State curr_state) {\n\t\tcounterMinimax++;\r\n\r\n\t\t//Check if the current state is a terminal state, if it is, return\r\n\t\t//its terminal value\r\n\t\tif(curr_state.isTerminal()){\r\n\t\t\treturn curr_state.getScore();\r\n\t\t}\r\n\r\n\t\tint min_value = Integer.MAX_VALUE;\r\n\t\t//Get the successors of the current state, as light always runs second\r\n\t\t//it will call minValue;\r\n\t\tState[] successors = curr_state.getSuccessors('2');\r\n\r\n\t\tif(successors.length == 0 && curr_state.isTerminal() == false){\r\n\t\t\tmin_value = Math.min(min_value, max_value(curr_state));\r\n\t\t}\r\n\r\n\r\n\t\t//Select the successor that returns the smallest(optimal) value\r\n\t\tfor(State state : successors){\r\n\t\t\tmin_value = Math.min(min_value, max_value(state));\r\n\t\t}\r\n\r\n\r\n\t\treturn min_value;\r\n\t}","title":""},{"docid":"2b8a41ff345c16fb7364e9e7eee9bc0a","score":"0.5725358","text":"public int maxValue(BoardState state, int maxDepth, int currentDepth, int alpha, int beta) {\n\t\tif (currentDepth == 0)\r\n\t\t\treturn sbe(state);\r\n\r\n\t\t// initializing the smaller possible number to x\r\n\t\tint v = Integer.MIN_VALUE;\r\n\r\n\t\tfor (int i = 0; i <= 5; i++) {\r\n\r\n\t\t\t// checking if a move is legal\r\n\t\t\tif (state.isLegalMove(1, i)) {\r\n\r\n\t\t\t\t// updating our max value to v\r\n\t\t\t\tv = Math.max(v, minValue(state.applyMove(1, i), maxDepth, currentDepth - 1, alpha, beta));\r\n\t\t\t\talpha = Math.max(alpha, v);\r\n\t\t\t\t\r\n\t\t\t\t// Pruning\r\n\t\t\t\tif (beta <= alpha) \t\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\tif (v == Integer.MIN_VALUE) {\r\n\t\t\treturn sbe(state);\r\n\t\t}\r\n\r\n\t\treturn v;\r\n\t}","title":""},{"docid":"5adf54be971c006d549c965e6727a692","score":"0.5700767","text":"private Move alphaBetaSearch(Node state) {\n\t\t\n\t\tint v = this.maxValue(state, Integer.MIN_VALUE, Integer.MAX_VALUE);\n\t\t\n\t\tthis.nodesExplored--;\n\t\tthis.nodesExploredThisTurn--;\n\t\t\n\t\tif (System.currentTimeMillis() - startMili > this.maxTime * 1000) {\n\t\t\treturn this.bestMoveSoFar;\n\t\t}\n\n\t\tif (Math.abs(v) == Integer.MAX_VALUE / 2 || Math.abs(v) == Math.abs(Integer.MIN_VALUE / 2) ) {\n\t\t\t\n\t\t\tthis.isEndGameStatusFound = true;\n\t\t\treturn state.getBestMove();\n\t\t}\n\t\t\n\t\treturn state.getBestMove();\n\t}","title":""},{"docid":"b6739e57bdd85db9e9570ec88240225f","score":"0.56996495","text":"public checkersSetup.Turn getBestMoveBasedOnSearchOfDepthN(CheckersSetup setup, boolean isDarkPlayer, int curdepth) {\n\t\t\n\t\tint numAlternativelyGoodMoves=0;\n\t\t\n\t\tif(curdepth > 0) {\n\t\t\t\n\t\t\tArrayList<checkersSetup.Turn> turnChoices = BasicCheckersAIFunctions.getAllPossiblePlayerOptionsFor1Turn(setup, isDarkPlayer);\n\t\t\t\n\t\t\tfavTurn = new Turn[turnChoices.size()];\n\t\t\t\n\t\t\tfavTurn[0] = turnChoices.get(0);\n\t\t\t\n\t\t\tsetup.playTurn(turnChoices.get(0));\n\t\t\t//note: op = OPPONENT!\n\t\t\tdouble opWorstPosUtil = getEstUtilityOfPosition(setup, !isDarkPlayer, curdepth-1);\n\t\t\tsetup.reverseTurn(turnChoices.get(0));\n\t\t\t\n\t\t\tdouble opPosUtil;\n\t\t\n\t\t\tfor(int i=1; i<turnChoices.size(); i++) {\n\t\t\t\tsetup.playTurn(turnChoices.get(i));\n\t\t\t\t\n\t\t\t\topPosUtil = getEstUtilityOfPosition(setup, !isDarkPlayer, curdepth-1);\n\t\t\t\t\n\t\t\t\tif(opPosUtil < opWorstPosUtil) {\n\t\t\t\t\topWorstPosUtil = opPosUtil;\n\t\t\t\t\tfavTurn[0] = turnChoices.get(i);\n\t\t\t\t\tnumAlternativelyGoodMoves = 0;\n\t\t\t\t\n\t\t\t\t} else if(opPosUtil == opWorstPosUtil) {\n\t\t\t\t\tnumAlternativelyGoodMoves++;\n\t\t\t\t\tfavTurn[numAlternativelyGoodMoves] = turnChoices.get(i);\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tsetup.reverseTurn(turnChoices.get(i));\n\t\t\t}\n\t\t\tif(opWorstPosUtil <= -BasicCheckersAIFunctions.DARK_WIN_UTILITY) {\n\t\t\t\tSystem.out.println(\"YOU ARE FUCKED!!\");\n\t\t\t}\n\t\t\t\n\t\t\t//TODO\n\t\t\t//opUtilityOfLastMove = -opWorstPosUtil;\n\t\t} else {\n\t\t\tSystem.out.println(\"Error: the depth should be bigger than 0!\");\n\t\t\tSystem.exit(1);\n\t\t\t//stub to stop java from complaining:\n\t\t\tfavTurn = new Turn[0];\n\t\t}\n\t\t\n\t\t//if AI is NOT deterministic AND\n\t\t//\tthere's several choices that seem similarly good, the AI randomly choses a move \n\t\tif(numAlternativelyGoodMoves > 0 && this.deterministic == false) {\n\t\t\tSystem.out.println(\"aitree is randomly choosing beetween \" + (numAlternativelyGoodMoves+1) + \" ways to do his turn\");\n\t\t\tnumFavMoves = numAlternativelyGoodMoves+1;\n\t\t\treturn favTurn[(int)(Math.random()*(numAlternativelyGoodMoves+1))];\n\t\t} else {\n\t\t\tnumFavMoves = 1;\n\t\t\treturn favTurn[0];\n\t\t}\n\t\t\n\t}","title":""},{"docid":"f8f221a9117517e1772096bbb99ebd0e","score":"0.5672249","text":"private int minmax(Board board, int level, int depth, int alpha, int beta) \n {\n if (computerWin(board) || playerWin(board) || draw(board) || depth >= LIMIT)\n return evaluate(board);\n \n else if (level == MAX)\n {\n int maxValue = Integer.MIN_VALUE;\n \n LinkedList<Board> children = generate(board, COMPUTER);\n \n for (int i = 0; i < children.size(); i++)\n {\n int currentValue = minmax(children.get(i), MIN, depth + 1, alpha, beta);\n \n if (currentValue > maxValue)\n maxValue = currentValue;\n if (maxValue >= beta)\n return maxValue;\n if (maxValue > alpha)\n alpha = maxValue;\n }\n return maxValue;\n }\n else \n {\n int minValue = Integer.MAX_VALUE;\n \n LinkedList<Board> children = generate(board, PLAYER);\n \n for (int i = 0; i < children.size(); i++)\n {\n int currentValue = minmax(children.get(i), MAX, depth + 1, alpha, beta);\n \n if (currentValue < minValue)\n minValue = currentValue;\n if (minValue <= alpha)\n return minValue;\n if (minValue < beta)\n beta = minValue;\n }\n return minValue;\n }\n }","title":""},{"docid":"31bcb3d3bc3a12f6f79327bc2e13ffa6","score":"0.5665297","text":"public boolean[] eGreedyAction()\n\t{\n\t\t// initialize variables\n\t\tRandom generator = new Random();\n\t\t\n\t\t// find best action\n\t\tList<boolean[]> validActions = getValidActions();\n\t\t\n\t\t// initiate values for comparison\n\t\tStateActionPair sap = new StateActionPair(state, validActions.get(0));\n\t\tboolean[] bestAction = sap.action;\n\t\t\n\t\tdouble bestValue= getStateActionValue(sap);\n\t\t\n\t\tfor(int i=1; i<validActions.size(); i++)\n\t\t{\n\t\t\tsap = new StateActionPair(state, validActions.get(i));\n\t\t\tdouble qValue = getStateActionValue(sap);\n\t\t\tif( qValue > bestValue )\n\t\t\t{\n\t\t\t\tbestAction = sap.action;\n\t\t\t\tbestValue = qValue;\n\t\t\t}\n\t\t}\n\t\t\n\t\t// choose random action\n\t\tif( generator.nextDouble() < epsilon )\t\n\t\t{\n\t\t\tList<boolean[]> randomActions = new ArrayList<boolean[]>(validActions);\n\t\t\trandomActions.remove(bestAction);\t// don't choose the best action\n\t\t\tboolean[] randomAction = randomActions.get(generator.nextInt(randomActions.size()));\n\t\t\treturn randomAction;\n\t\t}\n\t\t\n\n\t\treturn bestAction;\t// choose best action\n\t}","title":""},{"docid":"3230d9719d554d3c32356eefdec153b8","score":"0.56531256","text":"private int[] minValue(int[][] currentState, int[] alpha, int[] beta, int depth) {\n int[] bestMove = new int[]{MinimaxUtilties.freeCentralColumn(currentState), Integer.MAX_VALUE, 0};\n\n if (terminalTest(currentState) != 0) {\n return new int[]{0, utility(currentState), maxDepth - depth};\n }\n\n if (depth < 1){\n return new int[]{0, utility(currentState), maxDepth};\n }\n\n if (terminalTest(currentState) == 0 && depth > 0) {\n ArrayList<Integer> possibleActions = actions(currentState, 2);\n\n for (int i = 0; i < possibleActions.size(); i++) {\n int column = possibleActions.get(i);\n int[][] resultOfAction = result(currentState, column, 2);\n\n int[] currentResult = new int[]{column, maxValue(resultOfAction, alpha, beta, depth - 1)[1], maxDepth - depth};\n\n if (currentResult[1] < bestMove[1] || (currentResult[1] == bestMove[1] && currentResult[2] < bestMove[2])) {\n bestMove = currentResult;\n }\n\n if (bestMove[1] < beta[1] || (bestMove[1] == beta[1] && bestMove[2] < beta[2])) beta = bestMove;\n\n if (alpha[1] >= beta[1]) return beta;\n }\n }\n\n return bestMove;\n }","title":""},{"docid":"24537319874458147f9718f170f3a4e7","score":"0.5630002","text":"public int[] getMove() {\n int[] bestMove = new int[] {-1, -1, -1};\n int bestEval = Integer.MIN_VALUE;\n for (final BoardTree child : this.children) {\n if (child.evaluation > bestEval) {\n bestEval = child.evaluation;\n bestMove = child.prevMove;\n }\n if (VERBOSE) {\n System.out.println(Arrays.toString(child.prevMove)+\":\"+child.evaluation);\n }\n }\n delTree(this);\n\n if (VERBOSE) {\n System.out.println(\"Chose eval: \"+bestEval);\n }\n return bestMove;\n }","title":""},{"docid":"78ba93158bde460a9d2a59043a514d24","score":"0.5625526","text":"private static int getOptimalValue(int depth, int nodeIndex, boolean isMax,\n int[] scores, int h) {\n if (depth == h) \n return scores[nodeIndex];\n \n if (isMax) {\n return Math.max(getOptimalValue(depth+1, nodeIndex*2, false, scores, h), \n getOptimalValue(depth+1, nodeIndex * 2 + 1, false, scores, h));\n } else {\n return Math.min(getOptimalValue(depth+1, nodeIndex*2, true, scores, h), \n getOptimalValue(depth+1, nodeIndex * 2 + 1, true, scores, h));\n }\n }","title":""},{"docid":"baa96577e3a3909ae7101e2924fbf433","score":"0.56157434","text":"static double addHeuristic1(GameState c, boolean isMaxNode) {\n\t\t// Value returned will be absolute. If its max node, this config is good\n\t\t// then value will be positive. If its min node,\n\t\t// and this config is good for min, then value will be negative\n\n\t\tint i, j, vacant_spaces;\n\t\t// Compute : Feasible Moves for self\n\t\tint self_feasible_moves = 0;\n\t\tint self_remaining_moves = 0;\n\t\tint opponent_feasible_moves = 0;\n\t\tint opponent_remaining_moves = 0;\n\n\t\t// Go through the board and figure out vacant spots\n\t\tvacant_spaces = 0;\n\t\tfor (i = -GameState.HALF_BOARD; i <= GameState.HALF_BOARD; i = i + 1) {\n\t\t\tif (c.getWeight(i) == 0) {\n\t\t\t\tvacant_spaces++;\n\t\t\t}\n\t\t}\n\n\t\tfor (i = 1; i <= GameState.MAX_WEIGHT; i = i + 1) {\n\t\t\t// Check if self have the weight\n\t\t\tif (c.IHaveWeight(i)) {\n\t\t\t\tself_remaining_moves++;\n\t\t\t\t// Go through all the possible positions\n\t\t\t\tfor (j = -GameState.HALF_BOARD; j < GameState.HALF_BOARD; j++) {\n\t\t\t\t\tif (c.getWeight(j) == 0) {\n\t\t\t\t\t\t// Place it and see if you tip\n\t\t\t\t\t\tc.makeMove(i, j, PlayerName.none);\n\t\t\t\t\t\tif (!c.isTipping_old()) {\n\t\t\t\t\t\t\tself_feasible_moves++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// Now remove the weight\n\t\t\t\t\t\tc.removeMove(j);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t// Check if opponent has this weight\n\t\t\tif (c.opponentHasWeight(i)) {\n\t\t\t\topponent_remaining_moves++;\n\t\t\t\t// Go through all the possible positions\n\t\t\t\tfor (j = -GameState.HALF_BOARD; j < GameState.HALF_BOARD; j++) {\n\t\t\t\t\t// Place the weight and see if you tip\n\t\t\t\t\tif (c.getWeight(j) == 0) {\n\t\t\t\t\t\tc.makeMove(i, j, PlayerName.none);\n\t\t\t\t\t\tif (!c.isTipping_old()) {\n\t\t\t\t\t\t\topponent_feasible_moves++;\n\t\t\t\t\t\t}\n\t\t\t\t\t\t// Now remove the weight\n\t\t\t\t\t\tc.removeMove(j);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Need to take the max because one of the players may have played one\n\t\t// chance less\n\t\tif (self_remaining_moves == 0 && opponent_remaining_moves == 0) {\n\t\t\treturn 0.0;\n\t\t} else if (self_remaining_moves > opponent_remaining_moves)\n\t\t\treturn (double) (self_feasible_moves - opponent_feasible_moves)\n\t\t\t\t\t/ (double) (self_remaining_moves * vacant_spaces);\n\t\telse\n\t\t\treturn (double) (self_feasible_moves - opponent_feasible_moves)\n\t\t\t\t\t/ (double) (opponent_remaining_moves * vacant_spaces);\n\t}","title":""},{"docid":"1fbd5eab02a385c91ef9909b674a4510","score":"0.5610305","text":"private Action bestActionFromFinishedTree() {\n return Collections.max(validActionsDiscretized, Comparator.comparing(\n c -> root.getActionReward(c) / (double) root.getActionVisits(c)));\n }","title":""},{"docid":"2e0f29be2f67f2901a0249c1fe7468c4","score":"0.56044203","text":"public static int applyMinMax(int d, BoardModel model, boolean maximizingTeam, int alpha, int beta, boolean whiteTeam, int startDepth) {\n //base case, figure out determinaion of game over\n\n // printMap(model);\n // System.out.println(\"Depth: \"+d);\n \n\n //allPossibleMoves moveTree = new allPossibleMoves();\n int[] currentQueen;\n ArrayList<int[]> whiteQueens = new ArrayList<>();\n ArrayList<int[]> blackQueens = new ArrayList<>();\n ArrayList<int[]> myQueens = new ArrayList<>();\n // possibleMove bestestMove = null;\n\n// for (int count = 0; count < model.queenPositions.size(); count++) {\n// if (model.getTile(model.queenPositions.get(count)).equals(POS_MARKED_BLACK)) {\n// blackQueens.add(model.queenPositions.get(count));\n// // System.out.println(\"Black: \"+model.getTile(model.queenPositions.get(count)));\n// } else {\n// whiteQueens.add(model.queenPositions.get(count));\n// // System.out.println(\"White: \"+model.getTile(model.queenPositions.get(count)));\n// }\n// }\n//set black and white queens \n for (int jam = 0; jam < 10; jam++) {\n for (int pb = 0; pb < 10; pb++) {\n if (model.getTile(new int[]{jam, pb}).equals(POS_MARKED_WHITE)) {\n whiteQueens.add(new int[]{jam, pb});\n }\n if (model.getTile(new int[]{jam, pb}).equals(POS_MARKED_BLACK)) {\n blackQueens.add(new int[]{jam, pb});\n }\n }\n }\n if (maximizingTeam){\n if (whiteTeam){\n myQueens = whiteQueens;\n }\n else{\n myQueens = blackQueens;\n }\n }\n if (!maximizingTeam){\n if (whiteTeam){\n myQueens = blackQueens;\n }\n else{\n myQueens = whiteQueens;\n }\n }\n \n if (d == 0 || findAllMoves(model,myQueens).isEmpty() ) {\n return baseCase(model, whiteTeam);\n }\n\n // System.out.println(\"White Queens identified as: \" + whiteQueens.get(0)[0] + \"\" + whiteQueens.get(0)[1] + \" \" + whiteQueens.get(1)[0] + whiteQueens.get(1)[1] + \" \" + whiteQueens.get(2)[0] + whiteQueens.get(2)[1] + \" \" + whiteQueens.get(3)[0] + whiteQueens.get(3)[1]);\n //if (whiteTeam) {\n // myQueens = whiteQueens;\n //} else {\n // myQueens = blackQueens;\n // }\n // perform a check to see which side we are on. \n // System.out.println(\"Status: \"+maximizingTeam);\n if (maximizingTeam) {\n // System.out.println(\"Maximizing turn\");\n if (whiteTeam) {\n myQueens = whiteQueens;\n } else {\n myQueens = blackQueens;\n }\n\n int maxEval = -1000000;\n // considering this move was played. \n\n // printMap(model);\n // System.out.println();\n //find all children from this state\n ArrayList<ArrayList<int[]>> children = findAllMoves(model, myQueens);\n if (children.size() == 0){\n return baseCase(model, whiteTeam);\n }\n if(children.size()==0 && d == startDepth){\n System.out.println(\"We Lost :( \");\n }\n // printMap(model);\n // System.out.println();\n for (int i = 0; i < children.size(); i++) {\n\n String m1 = stringMap(model);\n\n BoardModel recursionModel = new BoardModel(10);\n\n for (int jam = 0; jam < 10; jam++) {\n for (int pb = 0; pb < 10; pb++) {\n recursionModel.setTile(new int[]{jam, pb}, model.getTile(new int[]{jam, pb}));\n }\n }\n recursionModel.queenPositions = new ArrayList<>();\n for (int x = 0; x < model.queenPositions.size(); x++) {\n recursionModel.queenPositions.add(model.queenPositions.get(x));\n }\n\n // printMap(recursionModel);\n recursionModel.moveQueen(children.get(i).get(0), children.get(i).get(1));\n recursionModel.setTile(children.get(i).get(2), POS_MARKED_ARROW);\n // System.out.println(\"max recursive call\");\n int childVal = applyMinMax(d - 1, recursionModel, false, alpha, beta, whiteTeam, startDepth);\n recursionModel.moveQueen(children.get(i).get(1), children.get(i).get(0));\n recursionModel.setTile(children.get(i).get(2), POS_AVAILABLE);\n\n String m2 = stringMap(model);\n // System.out.println(\"Check board Validity Max: \"+m1.equals(m2));\n\n maxEval = max(maxEval, childVal);\n if (d == startDepth) {\n ArrayList<int[]> blah = new ArrayList<int[]>();\n blah.add(children.get(i).get(0));\n blah.add(children.get(i).get(1));\n blah.add(children.get(i).get(2));\n blah.add(new int[]{childVal});\n maxMinMoves.add(blah);\n }\n alpha = max(maxEval, alpha);\n // System.out.println(\"A: \"+alpha);\n if (alpha >= beta) {\n break;\n }\n }\n return maxEval;\n\n } else {\n // System.out.println(\"Minimizing turn\");\n if (!whiteTeam) {\n myQueens = whiteQueens;\n } else {\n myQueens = blackQueens;\n }\n\n int maxEval = 1000000;\n // considering this move was played. \n\n // printMap(model);\n // System.out.println();\n //find all children from this state\n ArrayList<ArrayList<int[]>> children = findAllMoves(model, myQueens);\n if (children.size() == 0){\n return baseCase(model, whiteTeam);\n }\n if(children.size()==0 && d == startDepth){\n System.out.println(\"We Lost :( \");\n }\n // printMap(model);\n // System.out.println();\n for (int i = 0; i < children.size(); i++) {\n\n String m1 = stringMap(model);\n\n BoardModel recursionModel = new BoardModel(10);\n\n for (int jam = 0; jam < 10; jam++) {\n for (int pb = 0; pb < 10; pb++) {\n recursionModel.setTile(new int[]{jam, pb}, model.getTile(new int[]{jam, pb}));\n }\n }\n recursionModel.queenPositions = new ArrayList<>();\n for (int x = 0; x < model.queenPositions.size(); x++) {\n recursionModel.queenPositions.add(model.queenPositions.get(x));\n }\n\n // printMap(recursionModel);\n recursionModel.moveQueen(children.get(i).get(0), children.get(i).get(1));\n recursionModel.setTile(children.get(i).get(2), POS_MARKED_ARROW);\n // System.out.println(\"min recursive call\");\n int childVal = applyMinMax(d - 1, recursionModel, true, alpha, beta, whiteTeam, startDepth);\n recursionModel.moveQueen(children.get(i).get(1), children.get(i).get(0));\n recursionModel.setTile(children.get(i).get(2), POS_AVAILABLE);\n\n String m2 = stringMap(model);\n // System.out.println(\"Check board Validity Max: \"+m1.equals(m2));\n\n maxEval = min(maxEval, childVal);\n if (d == startDepth) {\n ArrayList<int[]> blah = new ArrayList<int[]>();\n blah.add(children.get(i).get(0));\n blah.add(children.get(i).get(1));\n blah.add(children.get(i).get(2));\n blah.add(new int[]{childVal});\n maxMinMoves.add(blah);\n }\n beta = min(maxEval, alpha);\n // System.out.println(\"A: \"+alpha);\n if (alpha >= beta) {\n break;\n }\n }\n return maxEval;\n }\n\n }","title":""},{"docid":"0133053a3b224750ac8a06f893e0533b","score":"0.55714476","text":"public interface MiniMaxState extends State {\r\n\t/**\r\n\t * Determine if this state is a state in which MAX acts (we, as opposed to\r\n\t * the opponent that we have no control over).\r\n\t * \r\n\t * @return true if MAX acts, false if opponent acts\r\n\t */\r\n\tpublic boolean isMaxState();\r\n\r\n\t/**\r\n\t * Determine the \"utility\" of the state, is usually called when a\r\n\t * terminating state is visited. Should be a positive value (not exceeding\r\n\t * +9999999) if we're doing well, a negative value (not below -9999999) if\r\n\t * we're doing badly.\r\n\t * \r\n\t * @return the utility of the state\r\n\t */\r\n\tpublic double utility();\r\n\r\n}","title":""},{"docid":"e62880fb655f48e3438795c367e50ac7","score":"0.5555728","text":"public static int[] alphaBeta(Board b, int depth, int alpha, int beta, int playerNum){\n //if the depth is 0 or the game is over return the last move\n if (depth == 0 || b.isGameOver()){\n return b.getLastMove();\n }\n //If player 1, maximize board score\n if (playerNum == Board.PLAYER_1){\n int[] bestMove = new int[3];\n bestMove[2] = Integer.MIN_VALUE;\n //check nodes of next tree\n for (Board board: Board.getPossibleBoards(b, Board.PLAYER_2)) {\n //calls minimax using next player to determine minimum board score possible\n int[] move = alphaBeta(board, depth - 1, alpha, beta, Board.PLAYER_2);\n if (move[2] > bestMove[2] && !isLosingMove(b, move[1], Board.PLAYER_2))\n bestMove = move;\n else if(move[2] == bestMove[2]){\n if (Math.abs(move[1] - 3) < Math.abs(bestMove[1] - 3)){\n bestMove = move;\n }\n else if (getRandom()){\n bestMove = move;\n }\n }\n //update upper bound\n if(bestMove[2] > alpha){\n alpha = bestMove[2];\n }\n //if bounds cross, node and children can be ignored\n if(beta < alpha)\n break;\n }\n return bestMove;\n }\n //if player 2, minimize board score\n else if(playerNum == 2){\n int[] bestMove = new int[3];\n bestMove[2] = Integer.MAX_VALUE;\n //check next nodes of tree\n for (Board board: Board.getPossibleBoards(b, Board.PLAYER_1)){\n //determine maximum loss using recursion\n int[] move = alphaBeta(board, depth - 1, alpha, beta, Board.PLAYER_1);\n if (move[2] < bestMove[2] && !isLosingMove(b, move[1], Board.PLAYER_2))\n bestMove = move;\n else if (move[2] == bestMove[2]){\n if (Math.abs(move[1] - 3) < Math.abs(bestMove[1] - 3)){\n bestMove = move;\n }\n else if (getRandom()){\n bestMove = move;\n }\n }\n //update lower bound\n if(bestMove[2] < beta){\n beta = bestMove[2];\n }\n //break if bounds intersect\n if(beta < alpha)\n break;\n }\n //minimizes max loss\n return bestMove;\n }\n return null;\n }","title":""},{"docid":"a16bbb809172722d494907f29e32b23f","score":"0.5532613","text":"abstract int getMaxLevel();","title":""},{"docid":"eaac15d5953bb149473800badacd644e","score":"0.55172807","text":"private DeterministicBoardStateNode getBestTurn(int team, int depth, double sampleRate, double maxSamples,\n boolean filterLethal) {\n // no turn possible\n if (this.b.getCurrentPlayerTurn() != team || this.b.getWinner() != 0) {\n return null;\n }\n String state = this.b.stateToString();\n UUID stateHash = UUID.nameUUIDFromBytes(state.getBytes());\n DeterministicBoardStateNode dbsn;\n boolean cacheHit = false;\n if (!this.nodeMap.containsKey(stateHash)) {\n dbsn = new DeterministicBoardStateNode(team,\n evaluateAdvantage(this.b, team),\n filterLethal ? this.getPossibleLethalActions(team) : this.getPossibleActions(team));\n dbsn.sampleRate = sampleRate;\n this.nodeMap.put(stateHash, dbsn);\n } else {\n dbsn = this.nodeMap.get(stateHash);\n cacheHit = true;\n if (this.traversedNodes.contains(dbsn)) {\n System.err.println(\"AI encountered a cycle somehow\");\n return null;\n }\n }\n this.traversedNodes.add(dbsn);\n // start sampling\n int numSamples = (int) Math.round(Math.min(dbsn.totalBranches * sampleRate, maxSamples));\n numSamples = Math.max(numSamples, SAMPLING_MIN_SAMPLES);\n numSamples = Math.min(numSamples, dbsn.totalBranches);\n // if we are revisiting this node, but it needs to be re-evaluated at a better detail level\n if (cacheHit && dbsn.sampleRate < sampleRate - this.config.reevaluationMaxSampleRateDiff) {\n dbsn.resetEvaluationOrder();\n dbsn.sampleRate = sampleRate;\n this.totalReevaluations++;\n }\n\n // some statistics for debugging purposes\n this.maxBranches[depth] = Math.max(this.maxBranches[depth], numSamples);\n this.width[depth]++;\n this.totalEvaluated++;\n if (cacheHit) {\n this.cacheHits[depth]++;\n this.totalCacheHits++;\n }\n while (dbsn.evaluatedBranches < numSamples) {\n String action = dbsn.nextBranchToEvaluate();\n TraversalResult traverse = this.traverseAction(dbsn, state, action, depth, sampleRate, maxSamples,\n filterLethal, null);\n if (traverse.rng) {\n // rng, re-evaluate action many times, channel an average score into an RNGBoardStateNode\n int trials = Math.max(SelectRandom.ditherRound(Math.pow(this.config.rngDensityMultiplier, dbsn.totalBranches) * (this.config.rngMaxTrials - depth * this.config.rngTrialReduction)), this.config.rngMinTrials);\n RNGBoardStateNode nextBsn = (RNGBoardStateNode) dbsn.branches.get(action); // trust\n if (nextBsn != null) {\n // if previously evaluated this rng branch, see if we can add some trials to it\n trials = Math.max(1, trials - nextBsn.trials);\n } else {\n nextBsn = new RNGBoardStateNode(team);\n nextBsn.addTrial(traverse.next);\n }\n for (int j = 1; j < trials; j++) {\n traverse = this.traverseAction(dbsn, state, action, depth, sampleRate, maxSamples, filterLethal, nextBsn);\n nextBsn.addTrial(traverse.next);\n }\n dbsn.logEvaluation(action, nextBsn);\n } else {\n // not rng, whatever\n dbsn.logEvaluation(action, traverse.next);\n if (dbsn.lethal) {\n break;\n }\n }\n }\n this.traversedNodes.remove(dbsn);\n return dbsn;\n }","title":""},{"docid":"b21bc37c607c0d6340a63882519b59b7","score":"0.54919946","text":"private List<Double> MinimaxAlgorithm(MinimaxNode<GameState> node, int dataCount){\n if(node.getNumberOfChildren() == 0){ //checks to see if terminal node\n List<Double> heuristics = new ArrayList();\n heuristics.addAll(calculateHeuristic(node.getState()));\n return heuristics;\n }\n else{ //will maximise all the scores for each player.\n double value = Double.NEGATIVE_INFINITY;\n double checkValue;\n int bestMove;\n List<Double> heuristics = new ArrayList();\n if(node.getIfChanceNode()){ //checks if current node is a chance node, if so, times \n for (int i = 0; i < node.getChildren().size(); i++){\n List<Double> tempHeuristics = new ArrayList();\n tempHeuristics.addAll(MinimaxAlgorithm(node.getChildren().get(i),dataCount+1));\n checkValue = node.getChildren().get(i).getProbability() * tempHeuristics.get(node.getNodeIndex());\n value = Math.max(value, checkValue);//maximises the score.\n if(checkValue == value){\n heuristics.addAll(tempHeuristics); \n }\n if(dataCount == 0){//checks if this is the root node\n if(checkValue == value){\n MinimaxPlayer.optimalMoves = node.getChildren().get(i).getState().getOrientation(node.getNodeIndex()); \n }\n } \n }\n }\n else{\n for (int i = 0; i < node.getChildren().size(); i++){\n List<Double> tempHeuristics = new ArrayList();\n tempHeuristics.addAll(MinimaxAlgorithm(node.getChildren().get(i),dataCount+1));\n checkValue = tempHeuristics.get(node.getNodeIndex());\n value = Math.max(value, checkValue);//maximises the score.\n if(checkValue == value){\n heuristics.addAll(tempHeuristics); \n }\n if(dataCount == 0){//checks if this is the root node\n if(checkValue == value){\n MinimaxPlayer.optimalMoves = node.getChildren().get(i).getState().getOrientation(node.getNodeIndex()); \n }\n } \n } \n }\n return heuristics;\n } \n }","title":""},{"docid":"5eb2b93a3b1a53072b96485eb21de5c6","score":"0.54799473","text":"public static GameState getBestMove(Vector<GameState> states){\n int index = 0;\n double max = 0;\n double v = 0;\n\n // find state with max value and save its index\n for(int i = 0; i < states.size(); i++){\n v = minMaxPruning(states.get(i), depth, Double.NEGATIVE_INFINITY, Double.POSITIVE_INFINITY);\n if(max < v){\n max = v;\n index = i;\n }\n }\n return states.get(index);\n }","title":""},{"docid":"9963c9edbdaff81e9a1e284792e1ae81","score":"0.5478927","text":"public void move(BoardState state) {\n\t move = alphabetaSearch(state, maxDepth);\r\n\r\n\t\t// TEST CASES\r\n\t\t// System.out.println(maxValue(state, maxDepth, 2, -1000, 1000));\r\n\t\t// System.out.println(alphabetaSearch(state, 10));\r\n\r\n\t}","title":""},{"docid":"5522635aa85a165bcfce55e0bb2785d7","score":"0.54650664","text":"public int minimax(Tile[][] board, int depth, boolean isMaximizing) {\n int result = WinnerChecker.checkWinner();\r\n if(result != 2) {\r\n return result;\r\n }\r\n\r\n int bestScore = 0;\r\n if(isMaximizing){\r\n bestScore = 1;\r\n for(int i = 0; i< 3; i++){\r\n for(int j = 0; j< 3; j++){\r\n // Is the spot available?\r\n if(board[i][j].text.getText().isEmpty()){\r\n board[i][j].text.setText(\"O\");\r\n TicTacToeApp.previous_move = board[i][j];\r\n int score = minimax(board, depth+1,false);\r\n board[i][j].text.setText(\"\");\r\n bestScore = Math.min(score, bestScore);\r\n }\r\n }\r\n }\r\n }else{\r\n bestScore = -1;\r\n for(int i = 0; i< 3; i++){\r\n for(int j = 0; j< 3; j++){\r\n // Is the spot available?\r\n if(board[i][j].text.getText().isEmpty()){\r\n board[i][j].text.setText(\"X\");\r\n TicTacToeApp.previous_move = board[i][j];\r\n int score = minimax(board, depth+1,true);\r\n board[i][j].text.setText(\"\");\r\n bestScore = Math.max(score, bestScore);\r\n }\r\n }\r\n }\r\n }\r\n return bestScore;\r\n }","title":""},{"docid":"41708a414ae9321cbcbbd3dd8db8474f","score":"0.5452009","text":"public int getBestMove(ModelInterface field, List<IRatingMechanism> ratingMechanisms, Token owner) {\n tree = new Tree(field, ratingMechanisms, owner);\n // minimize or maximize each level\n for (int i = Tree.MAXDEPTH - 1; i > 0; i--) {\n //System.out.println(\"max/min level \" + i);\n List<Node> currLevel = tree.getLevel(i);\n if (!currLevel.isEmpty()) {\n \n if (currLevel.get(0).getCurrentOwner() == owner) {\n \n for (Node node : currLevel) {\n maximize(node);\n }\n \n } else {\n \n for (Node node : currLevel) {\n minimize(node);\n }\n }\n }\n }\n\n // debug\n for (int i = 0; i < tree.getLevel(1).size(); i++) {\n System.out.println(tree.getLevel(1).get(i).getMove().toString());\n }\n\n PossibleMove minMove = tree.getLevel(1).get(0).getMove();\n for (int i = 0; i < tree.getLevel(1).size(); i++) {\n if (tree.getLevel(1).get(i).getMove().getRating() < minMove.getRating()) {\n minMove = tree.getLevel(1).get(i).getMove();\n }\n }\n return minMove.getMove();\n }","title":""},{"docid":"dc0ce2e9fcf373f8fc027d16f5d501be","score":"0.54419297","text":"private float generateLegalMoves(Node n, int depth, double A, double B, int player) {\n\t\tdouble val = (player == 1 ? Double.NEGATIVE_INFINITY : Double.POSITIVE_INFINITY);\n\t\t\n\t\tGamepiece[] playerPieces = (player == 1 ? g_board.getWhiteQueens() : g_board.getBlackQueens());\n\t\t\n\t\tfor(Gamepiece Queen : playerPieces) {\n\t\t\tint[] pos = Queen.position();\n\t\t\t\n\t\t\tint x = pos[0];\n\t\t\tint y = pos[1];\n\t\t\tint to_x = 0, to_y = 0, a_x = 0, a_y = 0;\n\t\t\t\n\t\t\t// Try to move up\n\t\t\tfor(int i = 1; i < (10 - y) && board[y + i][x] instanceof Blank; i++) {\n\t\t\t\tto_x = x;\n\t\t\t\tto_y = (y + i);\n\t\t\t\t\n\t\t\t\t// Try to shoot up\n\t\t\t\tfor(int j = 1; j < (10 - to_y) && board[to_y + j][to_x] instanceof Blank; j++) {\n\t\t\t\t\t// Finish constructing the move\n\t\t\t\t\ta_x = to_x;\n\t\t\t\t\ta_y = (to_y + j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\t// Create a new node with the move and this node as its parent\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\t// Play the move on the AI board\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\t// Recursive call back to alphaBeta to search deeper\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\t// Undo the move made at this level\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\t// If we've reached a point where A >= B, break out of the entire move generation process\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot right\n\t\t\t\tfor(int j = 1; j < (10 - to_x) && board[to_y][to_x + j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = to_x + j;\n\t\t\t\t\ta_y = to_y;\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot down (with special case => can shoot to queen's origin square)\n\t\t\t\tfor(int j = 1; j <= to_y && (board[to_y - j][to_x] instanceof Blank || (to_y - j == y)); j++) {\n\t\t\t\t\ta_x = to_x;\n\t\t\t\t\ta_y = (to_y - j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot left\n\t\t\t\tfor(int j = 1; j <= to_x && board[to_y][to_x - j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x - j);\n\t\t\t\t\ta_y = to_y;\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot up-right\n\t\t\t\tfor(int j = 1; j < (10 - to_y) && j < (10 - to_x) && board[to_y + j][to_x + j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x + j);\n\t\t\t\t\ta_y = (to_y + j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot down-right\n\t\t\t\tfor(int j = 1; j <= to_y && j < (10 - to_x) && board[to_y - j][to_x + j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x + j);\n\t\t\t\t\ta_y = (to_y - j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot up-left\n\t\t\t\tfor(int j = 1; j < (10 - to_y) && j <= to_x && board[to_y + j][to_x - j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x - j);\n\t\t\t\t\ta_y = (to_y + j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot down-left\n\t\t\t\tfor(int j = 1; j <= to_y && j <= to_x && board[to_y - j][to_x - j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x - j);\n\t\t\t\t\ta_y = (to_y - j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(A >= B) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\t// Try to move right\n\t\t\tfor(int i = 1; i < (10 - x) && board[y][x + i] instanceof Blank; i++) {\n\t\t\t\tto_x = x + i;\n\t\t\t\tto_y = y;\n\t\t\t\t\n\t\t\t\t// Try to shoot up\n\t\t\t\tfor(int j = 1; j < (10 - to_y) && board[to_y + j][to_x] instanceof Blank; j++) {\n\t\t\t\t\t// Finish constructing the move\n\t\t\t\t\ta_x = to_x;\n\t\t\t\t\ta_y = (to_y + j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\t// Create a new node with the move and this node as its parent\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\t// Play the move on the AI board\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\t// Recursive call back to alphaBeta to search deeper\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\t// Undo the move made at this level\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\t// If we've reached a point where A >= B, break out of the entire move generation process\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot right\n\t\t\t\tfor(int j = 1; j < (10 - to_x) && board[to_y][to_x + j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = to_x + j;\n\t\t\t\t\ta_y = to_y;\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot down \n\t\t\t\tfor(int j = 1; j <= to_y && board[to_y - j][to_x] instanceof Blank; j++) {\n\t\t\t\t\ta_x = to_x;\n\t\t\t\t\ta_y = (to_y - j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot left (with special case => can shoot to queen's origin square)\n\t\t\t\tfor(int j = 1; j <= to_x && (board[to_y][to_x - j] instanceof Blank || (to_x - j) == x); j++) {\n\t\t\t\t\ta_x = (to_x - j);\n\t\t\t\t\ta_y = to_y;\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot up-right\n\t\t\t\tfor(int j = 1; j < (10 - to_y) && j < (10 - to_x) && board[to_y + j][to_x + j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x + j);\n\t\t\t\t\ta_y = (to_y + j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot down-right\n\t\t\t\tfor(int j = 1; j <= to_y && j < (10 - to_x) && board[to_y - j][to_x + j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x + j);\n\t\t\t\t\ta_y = (to_y - j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot up-left\n\t\t\t\tfor(int j = 1; j < (10 - to_y) && j <= to_x && board[to_y + j][to_x - j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x - j);\n\t\t\t\t\ta_y = (to_y + j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot down-left\n\t\t\t\tfor(int j = 1; j <= to_y && j <= to_x && board[to_y - j][to_x - j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x - j);\n\t\t\t\t\ta_y = (to_y - j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(A >= B) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\t// Try to move down\n\t\t\tfor(int i = 1; i <= y && board[y - i][x] instanceof Blank; i++) {\n\t\t\t\tto_x = x;\n\t\t\t\tto_y = y - i;\n\t\t\t\t\n\t\t\t\t// Try to shoot up (With special case arrow loc = queen start)\n\t\t\t\tfor(int j = 1; j < (10 - to_y) && (board[to_y + j][to_x] instanceof Blank || to_y + j == y); j++) {\n\t\t\t\t\t// Finish constructing the move\n\t\t\t\t\ta_x = to_x;\n\t\t\t\t\ta_y = (to_y + j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\t// Create a new node with the move and this node as its parent\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\t// Play the move on the AI board\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\t// Recursive call back to alphaBeta to search deeper\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\t// Undo the move made at this level\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\t// If we've reached a point where A >= B, break out of the entire move generation process\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot right\n\t\t\t\tfor(int j = 1; j < (10 - to_x) && board[to_y][to_x + j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = to_x + j;\n\t\t\t\t\ta_y = to_y;\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot down \n\t\t\t\tfor(int j = 1; j <= to_y && board[to_y - j][to_x] instanceof Blank; j++) {\n\t\t\t\t\ta_x = to_x;\n\t\t\t\t\ta_y = (to_y - j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot left (with special case => can shoot to queen's origin square)\n\t\t\t\tfor(int j = 1; j <= to_x && (board[to_y][to_x - j] instanceof Blank || (to_x - j) == x); j++) {\n\t\t\t\t\ta_x = (to_x - j);\n\t\t\t\t\ta_y = to_y;\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot up-right\n\t\t\t\tfor(int j = 1; j < (10 - to_y) && j < (10 - to_x) && board[to_y + j][to_x + j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x + j);\n\t\t\t\t\ta_y = (to_y + j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot down-right\n\t\t\t\tfor(int j = 1; j <= to_y && j < (10 - to_x) && board[to_y - j][to_x + j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x + j);\n\t\t\t\t\ta_y = (to_y - j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot up-left\n\t\t\t\tfor(int j = 1; j < (10 - to_y) && j <= to_x && board[to_y + j][to_x - j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x - j);\n\t\t\t\t\ta_y = (to_y + j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot down-left\n\t\t\t\tfor(int j = 1; j <= to_y && j <= to_x && board[to_y - j][to_x - j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x - j);\n\t\t\t\t\ta_y = (to_y - j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(A >= B) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\t// Try to move left\n\t\t\tfor(int i = 1; i <= x && board[y][x - i] instanceof Blank; i++) {\n\t\t\t\tto_x = x - i;\n\t\t\t\tto_y = y;\n\t\t\t\t\n\t\t\t\t// Try to shoot up\n\t\t\t\tfor(int j = 1; j < (10 - to_y) && board[to_y + j][to_x] instanceof Blank; j++) {\n\t\t\t\t\t// Finish constructing the move\n\t\t\t\t\ta_x = to_x;\n\t\t\t\t\ta_y = (to_y + j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\t// Create a new node with the move and this node as its parent\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\t// Play the move on the AI board\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\t// Recursive call back to alphaBeta to search deeper\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\t// Undo the move made at this level\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\t// If we've reached a point where A >= B, break out of the entire move generation process\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot right (with special case)\n\t\t\t\tfor(int j = 1; j < (10 - to_x) && (board[to_y][to_x + j] instanceof Blank || (to_x + j == x)); j++) {\n\t\t\t\t\ta_x = to_x + j;\n\t\t\t\t\ta_y = to_y;\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot down \n\t\t\t\tfor(int j = 1; j <= to_y && board[to_y - j][to_x] instanceof Blank; j++) {\n\t\t\t\t\ta_x = to_x;\n\t\t\t\t\ta_y = (to_y - j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot left (with special case => can shoot to queen's origin square)\n\t\t\t\tfor(int j = 1; j <= to_x && (board[to_y][to_x - j] instanceof Blank || (to_x - j) == x); j++) {\n\t\t\t\t\ta_x = (to_x - j);\n\t\t\t\t\ta_y = to_y;\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot up-right\n\t\t\t\tfor(int j = 1; j < (10 - to_y) && j < (10 - to_x) && board[to_y + j][to_x + j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x + j);\n\t\t\t\t\ta_y = (to_y + j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot down-right\n\t\t\t\tfor(int j = 1; j <= to_y && j < (10 - to_x) && board[to_y - j][to_x + j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x + j);\n\t\t\t\t\ta_y = (to_y - j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot up-left\n\t\t\t\tfor(int j = 1; j < (10 - to_y) && j <= to_x && board[to_y + j][to_x - j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x - j);\n\t\t\t\t\ta_y = (to_y + j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot down-left\n\t\t\t\tfor(int j = 1; j <= to_y && j <= to_x && board[to_y - j][to_x - j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x - j);\n\t\t\t\t\ta_y = (to_y - j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(A >= B) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\t// Try to move up-right\n\t\t\tfor(int i = 1; i < (10 - y) && i < (10 - x) && board[y + i][x + i] instanceof Blank; i++) {\n\t\t\t\tto_x = x + i;\n\t\t\t\tto_y = y + i;\n\t\t\t\t\n\t\t\t\t// Try to shoot up\n\t\t\t\tfor(int j = 1; j < (10 - to_y) && board[to_y + j][to_x] instanceof Blank; j++) {\n\t\t\t\t\t// Finish constructing the move\n\t\t\t\t\ta_x = to_x;\n\t\t\t\t\ta_y = (to_y + j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\t// Create a new node with the move and this node as its parent\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\t// Play the move on the AI board\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\t// Recursive call back to alphaBeta to search deeper\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\t// Undo the move made at this level\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\t// If we've reached a point where A >= B, break out of the entire move generation process\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot right\n\t\t\t\tfor(int j = 1; j < (10 - to_x) && board[to_y][to_x + j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = to_x + j;\n\t\t\t\t\ta_y = to_y;\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot down \n\t\t\t\tfor(int j = 1; j <= to_y && board[to_y - j][to_x] instanceof Blank; j++) {\n\t\t\t\t\ta_x = to_x;\n\t\t\t\t\ta_y = (to_y - j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot left\n\t\t\t\tfor(int j = 1; j <= to_x && board[to_y][to_x - j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x - j);\n\t\t\t\t\ta_y = to_y;\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot up-right\n\t\t\t\tfor(int j = 1; j < (10 - to_y) && j < (10 - to_x) && board[to_y + j][to_x + j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x + j);\n\t\t\t\t\ta_y = (to_y + j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot down-right\n\t\t\t\tfor(int j = 1; j <= to_y && j < (10 - to_x) && board[to_y - j][to_x + j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x + j);\n\t\t\t\t\ta_y = (to_y - j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot up-left\n\t\t\t\tfor(int j = 1; j < (10 - to_y) && j <= to_x && board[to_y + j][to_x - j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x - j);\n\t\t\t\t\ta_y = (to_y + j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot down-left (with special case)\n\t\t\t\tfor(int j = 1; j <= to_y && j <= to_x && (board[to_y - j][to_x - j] instanceof Blank || ((to_y - j) == y && (to_x - j) == x)); j++) {\n\t\t\t\t\ta_x = (to_x - j);\n\t\t\t\t\ta_y = (to_y - j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(A >= B) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\t// Try to move down-right\n\t\t\tfor(int i = 1; i <= y && i < (10 - x) && board[y - i][x + i] instanceof Blank; i++) {\n\t\t\t\tto_x = x + i;\n\t\t\t\tto_y = y - i;\n\t\t\t\t\n\t\t\t\t// Try to shoot up\n\t\t\t\tfor(int j = 1; j < (10 - to_y) && board[to_y + j][to_x] instanceof Blank; j++) {\n\t\t\t\t\t// Finish constructing the move\n\t\t\t\t\ta_x = to_x;\n\t\t\t\t\ta_y = (to_y + j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\t// Create a new node with the move and this node as its parent\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\t// Play the move on the AI board\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\t// Recursive call back to alphaBeta to search deeper\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\t// Undo the move made at this level\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\t// If we've reached a point where A >= B, break out of the entire move generation process\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot right\n\t\t\t\tfor(int j = 1; j < (10 - to_x) && board[to_y][to_x + j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = to_x + j;\n\t\t\t\t\ta_y = to_y;\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot down \n\t\t\t\tfor(int j = 1; j <= to_y && board[to_y - j][to_x] instanceof Blank; j++) {\n\t\t\t\t\ta_x = to_x;\n\t\t\t\t\ta_y = (to_y - j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot left\n\t\t\t\tfor(int j = 1; j <= to_x && board[to_y][to_x - j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x - j);\n\t\t\t\t\ta_y = to_y;\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot up-right\n\t\t\t\tfor(int j = 1; j < (10 - to_y) && j < (10 - to_x) && board[to_y + j][to_x + j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x + j);\n\t\t\t\t\ta_y = (to_y + j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot down-right\n\t\t\t\tfor(int j = 1; j <= to_y && j < (10 - to_x) && board[to_y - j][to_x + j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x + j);\n\t\t\t\t\ta_y = (to_y - j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot up-left (with special case)\n\t\t\t\tfor(int j = 1; j < (10 - to_y) && j <= to_x && (board[to_y + j][to_x - j] instanceof Blank || ((to_y + j) == y && (to_x - j) == x)); j++) {\n\t\t\t\t\ta_x = (to_x - j);\n\t\t\t\t\ta_y = (to_y + j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot down-left\n\t\t\t\tfor(int j = 1; j <= to_y && j <= to_x && board[to_y - j][to_x - j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x - j);\n\t\t\t\t\ta_y = (to_y - j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(A >= B) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\t// Try to move up-left\n\t\t\tfor(int i = 1; i < (10 - y) && i <= x && board[y + i][x - i] instanceof Blank; i++) {\n\t\t\t\tto_x = x - i;\n\t\t\t\tto_y = y + i;\n\t\t\t\t\n\t\t\t\t// Try to shoot up\n\t\t\t\tfor(int j = 1; j < (10 - to_y) && board[to_y + j][to_x] instanceof Blank; j++) {\n\t\t\t\t\t// Finish constructing the move\n\t\t\t\t\ta_x = to_x;\n\t\t\t\t\ta_y = (to_y + j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\t// Create a new node with the move and this node as its parent\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\t// Play the move on the AI board\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\t// Recursive call back to alphaBeta to search deeper\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\t// Undo the move made at this level\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\t// If we've reached a point where A >= B, break out of the entire move generation process\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot right\n\t\t\t\tfor(int j = 1; j < (10 - to_x) && board[to_y][to_x + j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = to_x + j;\n\t\t\t\t\ta_y = to_y;\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot down \n\t\t\t\tfor(int j = 1; j <= to_y && board[to_y - j][to_x] instanceof Blank; j++) {\n\t\t\t\t\ta_x = to_x;\n\t\t\t\t\ta_y = (to_y - j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot left\n\t\t\t\tfor(int j = 1; j <= to_x && board[to_y][to_x - j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x - j);\n\t\t\t\t\ta_y = to_y;\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot up-right\n\t\t\t\tfor(int j = 1; j < (10 - to_y) && j < (10 - to_x) && board[to_y + j][to_x + j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x + j);\n\t\t\t\t\ta_y = (to_y + j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot down-right (with special case)\n\t\t\t\tfor(int j = 1; j <= to_y && j < (10 - to_x) && (board[to_y - j][to_x + j] instanceof Blank || ((to_y - j) == y && (to_x + j) == x)); j++) {\n\t\t\t\t\ta_x = (to_x + j);\n\t\t\t\t\ta_y = (to_y - j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot up-left\n\t\t\t\tfor(int j = 1; j < (10 - to_y) && j <= to_x && board[to_y + j][to_x - j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x - j);\n\t\t\t\t\ta_y = (to_y + j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot down-left\n\t\t\t\tfor(int j = 1; j <= to_y && j <= to_x && board[to_y - j][to_x - j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x - j);\n\t\t\t\t\ta_y = (to_y - j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(A >= B) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t\n\t\t\t// Try to move down-left\n\t\t\tfor(int i = 1; i <= y && i <= x && board[y - i][x - i] instanceof Blank; i++) {\n\t\t\t\tto_x = x - i;\n\t\t\t\tto_y = y - i;\n\t\t\t\t\n\t\t\t\t// Try to shoot up\n\t\t\t\tfor(int j = 1; j < (10 - to_y) && board[to_y + j][to_x] instanceof Blank; j++) {\n\t\t\t\t\t// Finish constructing the move\n\t\t\t\t\ta_x = to_x;\n\t\t\t\t\ta_y = (to_y + j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\t// Create a new node with the move and this node as its parent\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\t// Play the move on the AI board\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\t// Recursive call back to alphaBeta to search deeper\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\t// Undo the move made at this level\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\t// If we've reached a point where A >= B, break out of the entire move generation process\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot right\n\t\t\t\tfor(int j = 1; j < (10 - to_x) && board[to_y][to_x + j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = to_x + j;\n\t\t\t\t\ta_y = to_y;\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot down \n\t\t\t\tfor(int j = 1; j <= to_y && board[to_y - j][to_x] instanceof Blank; j++) {\n\t\t\t\t\ta_x = to_x;\n\t\t\t\t\ta_y = (to_y - j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot left\n\t\t\t\tfor(int j = 1; j <= to_x && board[to_y][to_x - j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x - j);\n\t\t\t\t\ta_y = to_y;\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot up-right (with special case)\n\t\t\t\tfor(int j = 1; j < (10 - to_y) && j < (10 - to_x) && (board[to_y + j][to_x + j] instanceof Blank || ((to_y + j) == y && (to_x + j) == x)); j++) {\n\t\t\t\t\ta_x = (to_x + j);\n\t\t\t\t\ta_y = (to_y + j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot down-right\n\t\t\t\tfor(int j = 1; j <= to_y && j < (10 - to_x) && board[to_y - j][to_x + j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x + j);\n\t\t\t\t\ta_y = (to_y - j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot up-left\n\t\t\t\tfor(int j = 1; j < (10 - to_y) && j <= to_x && board[to_y + j][to_x - j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x - j);\n\t\t\t\t\ta_y = (to_y + j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\t// Try to shoot down-left\n\t\t\t\tfor(int j = 1; j <= to_y && j <= to_x && board[to_y - j][to_x - j] instanceof Blank; j++) {\n\t\t\t\t\ta_x = (to_x - j);\n\t\t\t\t\ta_y = (to_y - j);\n\t\t\t\t\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\n\t\t\t\t\t\n\t\t\t\t\tNode child = new Node(move, n);\n\t\t\t\t\tn.addChild(child);\n\t\t\t\t\t\n\t\t\t\t\tg_board.doMove(move);\n\t\t\t\t\t\n\t\t\t\t\tif(player == 1) {\n\t\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\n\t\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\n\t\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tg_board.undoMove();\n\t\t\t\t\t\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(A >= B) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif(A >= B) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t\t// If we found no successor moves for this child then this player can't move and therefore loses.\n\t\tif(n.getChildren() == null || n.getChildren().isEmpty()) {\n//\t\t\tval = (float)(player == 1 ? Double.NEGATIVE_INFINITY : Double.POSITIVE_INFINITY);\n//\t\t\tleaves++;\n\t\t\tval = alphaBeta(n, 0, A, B, player);\n\t\t}\n\t\t\n\t\tn.setScore((float)val);\n\t\t\n\t\treturn (float)val;\n\t}","title":""},{"docid":"21edc93acb0bd48b28f01164f3ad6802","score":"0.54374325","text":"public Entry maxValue(Board board, int depth) throws CloneNotSupportedException{\n \tint score;\n \tif (cutOffTest(board, depth)) {\n \t\tscore = utility(board);\n \t\tEntry entry = new Entry(score, 0); \n \t\treturn entry;\n \t}\n \t\n \tint max = Integer.MIN_VALUE;\n \tint direction = 0;\n \t\n \tfor (int i = 1; i <= 4; i++) {\n \t\tBoard newboard = (Board)board.clone();\n \t\t\n \t\tnewboard.move(i);\n \t\tEntry entry = minValue(newboard, depth+1);\n \t\tif (entry.score > max) {\n \t\t\tmax = entry.score;\n \t\t\tdirection = i;\n \t\t}\n \t}\n \t\n \tEntry res = new Entry(max, direction);\n \treturn res;\n }","title":""},{"docid":"b0bcae09cec6b1e71f16aaff216e5408","score":"0.54329216","text":"Move getBestMove() {\n //System.out.println(\"AI chooses: \" + m.toString());\n return moves.get((int) (Math.random() * moves.size()));\n }","title":""},{"docid":"658f1902da62d71cb3c6663bc36827c7","score":"0.54323786","text":"public int alphabetaSearch(BoardState state, int maxDepth) {\n\t\tint[] pits = new int[6];\r\n\t\t\r\n\t\t// state to check moves\r\n\t\tBoardState move = state;\r\n\t\r\n\t\t// initializing the alpha and the beta value\r\n\t\tint alpha = Integer.MIN_VALUE;\r\n\t\tint beta = Integer.MAX_VALUE;\r\n\t\t\r\n\t\tint bestPit = 0;\r\n\r\n\t\t// for loop to get the SBE of the pits\r\n\t\tfor (int i = 0; i <= 5; i++) {\r\n\r\n\t\t\t// checking if the move is legal\r\n\t\t\tif (state.isLegalMove(1, i)) {\r\n\r\n\t\t\t\t// variable set to max since node at depth 1 is a max value\r\n\t\t\t\tint v = minValue(move.applyMove(1, i), maxDepth, maxDepth - 1, alpha, beta);\r\n\r\n\t\t\t\t// updating the alpha value based on our search\r\n\t\t\t\tif (v > alpha) {\r\n\t\t\t\t\talpha = v;\r\n\t\t\t\t\tbestPit = i;\r\n\t\t\t\t}\r\n\r\n\t\t\t\t// pruning\r\n\t\t\t\tif (beta <= alpha)\r\n\t\t\t\t\tbreak;\r\n\t\t\t}\r\n\t\t}\r\n\r\n\t\treturn bestPit;\r\n\t}","title":""},{"docid":"61f5f9b0a1390f8faba0e1446bdae7bb","score":"0.5402652","text":"private double minValue(Board state, int depth, double alpha, double beta) {\n if(terminalTest(state, depth))\n return utility(state);\n\n double value = Double.POSITIVE_INFINITY;\n for(Move action: actions(state)){\n Board nextState = new Board(state);\n\n value = Math.min(value,\n maxValue(result(nextState, action),\n depth-1, alpha, beta));\n\n if(value <= alpha)\n return value;\n\n beta = Math.min(beta, value);\n }\n\n return value;\n }","title":""},{"docid":"75a003726b49982cafb6dbfb6d26b15d","score":"0.539483","text":"private int[] getBestMoveAndScoreDifference(int[] board, int depth, boolean turn) {\n int boardCopy[];\n if (depth <= 0) {\n return new int[] {0,-1};\n }\n if (turn) {\n int minimum = MAXIMUM_POSSIPLE_SCORE_DIFFERENCE;\n int move = -1;\n for (int i = 0; i < 5; i++) {\n if (board[i] < 2) {\n continue;\n }\n boardCopy = board.clone();\n int x = playMove(boardCopy, i);\n int y = 0;\n if (!hasPlayer2Move(boardCopy)) {\n if (hasPlayer1Move(boardCopy)) {\n y = getBestMove(boardCopy, depth - 1, turn);\n } else {\n for (int j = 0; j < 5; j++) {\n y = y - boardCopy[j];\n }\n for (int j = 5; j < 10; j++) {\n y = y + boardCopy[j];\n }\n }\n } else {\n y = getBestMove(boardCopy, depth - 1, ! turn);\n }\n int z = y - x;\n if (z < minimum) {\n minimum = z;\n move = i;\n }\n }\n int i = 10;\n if (board[2] < 2) {\n return new int[] {minimum,move};\n }\n boardCopy = board.clone();\n int x = playMove(boardCopy, i);\n int y = 0;\n if (!hasPlayer2Move(boardCopy)) {\n if (hasPlayer1Move(boardCopy)) {\n y = getBestMove(boardCopy, depth - 1, turn);\n } else {\n for (int j = 0; j < 5; j++) {\n y = y - boardCopy[j];\n }\n for (int j = 5; j < 10; j++) {\n y = y + boardCopy[j];\n }\n }\n } else {\n y = getBestMove(boardCopy, depth - 1, !turn);\n }\n int z = y - x;\n if (z < minimum) {\n minimum = z;\n move = i;\n }\n return new int[] {minimum,move};\n } else {\n int maximum = MINIMUM_POSSIPLE_SCORE_DIFFERENCE;\n int move = -1;\n for (int i = 5; i < 10; i++) {\n if (board[i] < 2) {\n continue;\n }\n boardCopy = board.clone();\n int x = playMove(boardCopy, i);\n int y = 0;\n if (!hasPlayer1Move(boardCopy)) {\n if (hasPlayer2Move(boardCopy)) {\n y = getBestMove(boardCopy, depth - 1, turn);\n } else {\n for (int j = 0; j < 5; j++) {\n y = y - boardCopy[j];\n }\n for (int j = 5; j < 10; j++) {\n y = y + boardCopy[j];\n }\n }\n } else {\n y = getBestMove(boardCopy, depth - 1, !turn);\n }\n int z = y + x;\n if (z > maximum) {\n maximum = z;\n move = i;\n }\n }\n int i = 11;\n if (board[7] < 2) {\n return new int[] {maximum,move};\n }\n boardCopy = board.clone();\n int x = playMove(boardCopy, i);\n int y = 0;\n if (!hasPlayer1Move(boardCopy)) {\n if (hasPlayer2Move(boardCopy)) {\n y = getBestMove(boardCopy, depth - 1, turn);\n } else {\n for (int j = 0; j < 5; j++) {\n y = y - boardCopy[j];\n }\n for (int j = 5; j < 10; j++) {\n y = y + boardCopy[j];\n }\n }\n } else {\n y = getBestMove(boardCopy, depth - 1, !turn);\n }\n int z = y + x;\n if (z > maximum) {\n maximum = z;\n move = i;\n }\n return new int[] {maximum,move};\n }\n }","title":""},{"docid":"20daca39256256304fb32fdd8cba067b","score":"0.53871834","text":"@Override\n public int calculateBattleValue() {\n return calculateBattleValue(false, false);\n }","title":""},{"docid":"8c7e18a4a7f8e46274cbba3db606d70a","score":"0.53555566","text":"private TraversalResult traverseAction(DeterministicBoardStateNode current, String currentState, String action, int depth, double sampleRate, double maxSamples,\n boolean filterLethal, RNGBoardStateNode nextRNG) {\n ResolutionResult result = this.b.executePlayerAction(new StringTokenizer(action));\n BoardStateNode node;\n double nextMaxSamples = maxSamples;\n double nextSampleRate = sampleRate;\n if (depth + 1 >= SAMPLING_MIN_DEPTH) {\n if (depth + 1 == SAMPLING_MIN_DEPTH) {\n nextMaxSamples = this.config.maxSamples;\n } else {\n nextMaxSamples = maxSamples * this.config.maxSamplesMultiplier;\n }\n nextSampleRate = sampleRate * current.getWeightedProportionOfAction(action) * this.config.sampleRateMultiplier;\n }\n if (result.rng) {\n // the number of trials we've already done to get to this node\n int cumTrials = 0;\n if (nextRNG != null) {\n String state = this.b.stateToString();\n UUID stateHash = UUID.nameUUIDFromBytes(state.getBytes());\n cumTrials += nextRNG.getCount(this.nodeMap.get(stateHash));\n }\n nextSampleRate *= 1 - (this.config.rngPenalty * Math.pow(this.config.rngPenaltyReduction, cumTrials));\n }\n if (this.b.getWinner() != 0 || depth == SAMPLING_MAX_DEPTH) {\n // no more actions can be taken\n node = new TerminalBoardStateNode(current.team, evaluateAdvantage(this.b, current.team));\n if (!result.rng && this.b.getWinner() == current.team) {\n current.lethal = true; // the current node has an action that results in a lethal 100% of the time\n }\n } else if (Integer.parseInt(action.substring(0, 1)) == EndTurnAction.ID || this.b.getCurrentPlayerTurn() != current.team) {\n // assess what's the worst the opponent can do\n if (filterLethal) {\n // not part of my pay grade\n node = new TerminalBoardStateNode(current.team * -1, evaluateAdvantage(this.b, current.team * -1));\n } else {\n node = this.getBestTurn(current.team * -1, depth + 1,\n Math.max(nextSampleRate, this.config.enemySampleRate),\n Math.max(nextMaxSamples, this.config.maxSamplesEnemy),\n true);\n }\n } else {\n DeterministicBoardStateNode dbsn = this.getBestTurn(current.team, depth + 1, nextSampleRate, nextMaxSamples, filterLethal);\n if (dbsn == null) {\n // something went wrong, here's a bandaid\n node = new TerminalBoardStateNode(current.team, evaluateAdvantage(this.b, current.team));\n } else {\n if (dbsn.lethal) {\n current.lethal = true; // the current node has an action that leads to a node that eventually results in lethal\n }\n node = dbsn;\n }\n }\n List<Event> undoStack = new LinkedList<>(result.events);\n while (!undoStack.isEmpty()) {\n undoStack.get(undoStack.size() - 1).undo(this.b);\n undoStack.remove(undoStack.size() - 1);\n }\n // aura difference checking isn't updated by undoing, we have to update it ourselves\n this.b.updateAuraLastCheck();\n this.b.updateDependentStatsLastCheck();\n String stateAfterUndo = this.b.stateToString();\n if (!currentState.equals(stateAfterUndo)) {\n System.out.println(\n \"Discrepancy after executing \" + action + \", rng = \" + result.rng + \", depth = \" + depth);\n for (Event e : result.events) {\n System.out.print(e.toString());\n }\n System.out.println(\"Before:\");\n System.out.println(currentState);\n System.out.println(\"After:\");\n System.out.println(stateAfterUndo);\n throw new RuntimeException();\n }\n return new TraversalResult(node, result.rng);\n }","title":""},{"docid":"f511dae2d2338a440d720dd6d3955cab","score":"0.5354711","text":"private MMT(Board b, int depth, String mPlayer, boolean ifMax, int prevMove) {\n\t\tboard = new Board(b);\n\t\tmaxPlayer = mPlayer;\n\t\tifMaxPlayer = ifMax;\n\t\tparentMove = prevMove;\n\t\t//fill in the children\n\t\tchildLst = generateChildren(board, mPlayer, !ifMax, depth);\n\t\t//assign value to node \n\t\tvalue = getValue(this);\n\t}","title":""},{"docid":"cb53ea6d113bfca0a2f1be5f2c21eb43","score":"0.5352335","text":"int getTemporaryMaxDepth();","title":""},{"docid":"5da75c877236ecff54f01d7269513799","score":"0.53393066","text":"private NewMove findBestMove(ChessGameNode node, char player ) {\r\n\t\tChessGameNode[] childrenNodes = node.getChildren();\r\n\t\tint currentValue = this.rootNode.getValue();\r\n\t\tint bestValue = 0;\r\n\t\tNewMove bestMove = null;\r\n\t\tfor( ChessGameNode childNode : childrenNodes) {\r\n\t\t\tif (childNode != null) {\r\n\t\t\t\tif (player == 'w') {\r\n\t\t\t\t\tif (childNode.getValue() >= currentValue) {\r\n\t\t\t\t\t\tbestValue = childNode.getValue();\r\n\t\t\t\t\t\tbestMove = childNode.getOriginalMove();\r\n\t\t\t\t\t}\r\n\t\t\t\t} else if (player == 'b') {\r\n\t\t\t\t\tif (childNode.getValue() <= currentValue) {\r\n\t\t\t\t\t\tbestValue = childNode.getValue();\r\n\t\t\t\t\t\tbestMove = childNode.getOriginalMove();\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 bestMove;\r\n\t}","title":""},{"docid":"ed4e523de809e6d6e64c0812f07bd78c","score":"0.53221726","text":"public MoveNode getMinimaxMove() {\n return minimaxMove;\n }","title":""},{"docid":"9181e417a4fda009ac49e7c3bb9ef9f9","score":"0.53155243","text":"public static PlayerMove alphaBeta(int depth, int alpha, int beta, PossibleMove move, ArrayList<Player> listOfPlayers, int player) {\n PlayerMove newMove;\r\n PlayerMove bestMove = null;\r\n System.out.println(\"Player: \" + player);\r\n Player currentPlayer = listOfPlayers.get(player);\r\n ArrayList<PossibleMove> possibleMoveList = BoardAIBlackController.getPossibleMoves(currentPlayer);\r\n int bestValue;\r\n\r\n if (isMaxDepth(depth)) {\r\n Piece newPiece = move.getPiece();\r\n System.out.println(\"New moveX: \" + move.getNewXPost() + \" New move Y: \" + move.getNewYPost());\r\n int newXPost = move.getNewXPost();\r\n int newYPost = move.getNewYPost();\r\n System.out.println(\"NewXPost: \" + newXPost + \"NewYPost \" + newYPost);\r\n System.out.println(\"OldXPost: \" + move.getPiece().getOldX() + \" OldYPost: \" + move.getPiece().getOldY());\r\n// newPiece.setLayoutX(newXPost * 100);\r\n// newPiece.setLayoutY(newYPost * 100);\r\n System.out.println(newPiece.getLayoutX());\r\n System.out.println(newPiece.getLayoutY());\r\n int fitnessValue = BoardAIBlackController.evaluatePiece(currentPlayer, newPiece, move.getNewXPost(), move.getNewYPost());\r\n System.out.println(\"Fitness value of move is: \" + fitnessValue);\r\n System.out.println(move.getNewXPost() + \" \" + move.getNewYPost());\r\n newMove = new PlayerMove(currentPlayer, move, fitnessValue);\r\n// System.out.println(newMove.toString());\r\n return newMove;\r\n }\r\n\r\n for (int i = 0; i < possibleMoveList.size() - 1; i++) {\r\n //Maximizing player\r\n if (player == 1) {\r\n //Initialize current best move\r\n bestMove = new PlayerMove(currentPlayer, move, MIN);\r\n\r\n System.out.println(\"Who is the player: \" + currentPlayer);\r\n newMove = alphaBeta(depth - 1, alpha, beta, possibleMoveList.get(i), listOfPlayers, Math.abs(player - 1));\r\n bestMove.setFitnessValue(Math.max(bestMove.getFitnessValue(), newMove.getFitnessValue()));\r\n System.out.println(\"Current Alpha: \" + alpha + \" Current BestMove: \" + bestMove.getFitnessValue() + \" Current Beta: \" + beta);\r\n \r\n alpha = Math.max(alpha, bestMove.getFitnessValue());\r\n \r\n //Pruning\r\n if (beta <= alpha) {\r\n System.out.println(\"Prunned\");\r\n break;\r\n }\r\n } //Minimizing player\r\n else {\r\n //Initialize current best move\r\n bestMove = new PlayerMove(currentPlayer, move, MAX);\r\n System.out.println(\"Who is the player: \" + currentPlayer);\r\n newMove = alphaBeta(depth - 1, alpha, beta, possibleMoveList.get(i), listOfPlayers, Math.abs(player + 1));\r\n bestMove.setFitnessValue(Math.max(bestMove.getFitnessValue(), newMove.getFitnessValue()));\r\n beta = Math.max(alpha, bestMove.getFitnessValue());\r\n\r\n //Pruning\r\n if (beta <= alpha) {\r\n break;\r\n }\r\n }\r\n }\r\n return bestMove;\r\n\r\n }","title":""},{"docid":"18b2fe3858c79ceaa708fb1287db1a96","score":"0.53125644","text":"public double minValue(S state, P player, double alpha, double beta, int depth) {\n updateMetrics(depth);\n if (game.isTerminal(state) || depth >= currDepthLimit || timer.timeOutOccurred()) {\n return eval(state, player);\n } else {\n double value = Double.POSITIVE_INFINITY;\n for (A action : orderActions(state, game.getActions(state), player, depth)) {\n value = Math.min(value, maxValue(game.getResult(state, action), //\n player, alpha, beta, depth + 1));\n if (value <= alpha)\n return value;\n beta = Math.min(beta, value);\n }\n return value;\n }\n }","title":""},{"docid":"beb2dae27577c9168e327fdf07759238","score":"0.531082","text":"int getMaxLevel();","title":""},{"docid":"42d8d7eee2f2754d8812b45f75d844a9","score":"0.5308122","text":"public void actionPerformed(ActionEvent e) {\n timer.stop();\n //get all the available moves\n ArrayList<Point> possibleMoves = getCurrentlyValidMoves();\n canLastPlayerMove = false;\n try {\n //check if we can move\n if( possibleMoves.size() == 0 ){\n return;\n }\n //make an array to store the best moves available\n ArrayList<Point> bestMoves = new ArrayList<Point>();\n //the lower the level, the higher priority is assigned to the move\n //a move of level 10 is the absolute lowest\n //this heuristic follows the strategy I use, omitting situation-specific content\n int level = 10;\n for (Point p : possibleMoves) {\n int x = (int) p.getX();\n int y = (int) p.getY();\n if ((x == 0 || x == 7) && (y == 0 || y == 7)) {\n if (level > 0) {\n bestMoves.clear();\n level = 0;\n }\n bestMoves.add( p );\n } else if (level >= 1 && (x == 0 || y == 0 || x == 7 || y == 7)) {\n if (level > 1) {\n bestMoves.clear();\n level = 1;\n }\n bestMoves.add( p );\n } else if (level >= 2 && (x > 2 && x < 6 && y > 2 && y < 6)) {\n if ( level > 2) {\n bestMoves.clear();\n level = 2;\n }\n bestMoves.add( p );\n } else if (level >= 3 && x != 1 && x != 6 && y != 1 && y != 6) {\n if (level > 3) {\n bestMoves.clear();\n level = 3;\n }\n bestMoves.add(p);\n } else if (level >= 4) {\n bestMoves.add(p);\n }\n }\n //for debugging purposes, output the level of move chosen by the ai\n System.out.println(level);\n //select a random move from the pool of best moves\n Point move = bestMoves.get((int) (Math.random() * bestMoves.size()));\n int aix = (int) move.getX();\n int aiy = (int) move.getY();\n //move there\n attemptMove(aix, aiy);\n gamepieces[aix][aiy] = currentPlayer;\n //the ai moved, so this is true\n canLastPlayerMove = true;\n } finally { //if the ai moved or if it didn't\n //change the player\n currentPlayer = Color.WHITE;\n gameFrame.repaint();\n //if the human player has no moves left\n if( getCurrentlyValidMoves().size() == 0 ){\n if( canLastPlayerMove ){ //... and the ai could move\n //switch players, enable the ai to move again in 1 second\n currentPlayer = Color.BLACK;\n timer.start();\n }else{ //... and the ai couldn't move\n gameOver();\n }\n }\n }\n }","title":""},{"docid":"ef16f9b49c5e21246c7ddd88d83e33cd","score":"0.5304071","text":"public int minValue(BoardState state, int maxDepth, int currentDepth, int alpha, int beta) {\n\t\tif (currentDepth == 0)\r\n\t\t\treturn sbe(state);\r\n\r\n\t\t// initializing variable to the maximum possible value\r\n\t\tint v = Integer.MAX_VALUE;\r\n\r\n\t\tfor (int i = 0; i <= 5; i++) {\r\n\t\t\t\r\n\t\t\t// checks for the legal move\r\n\t\t\tif (state.isLegalMove(2, i)) {\r\n\t\t\t\t\r\n\t\t\t\t// updating our max value to v\r\n\t\t\t\tv = Math.min(v, maxValue(state.applyMove(2, i), maxDepth, currentDepth - 1, alpha, beta));\r\n\r\n\t\t\t\t// updating beta is a new min is found\r\n\t\t\t\tbeta = Math.min(beta, v);\r\n\r\n\t\t\t\t//pruning\r\n\t\t\t\tif (beta <= alpha)\r\n\t\t\t\t\tbreak;\r\n\r\n\t\t\t}\r\n\t\t}\r\n\t\tif (v == Integer.MAX_VALUE) {\r\n\t\t\treturn sbe(state);\r\n\t\t}\r\n\t\treturn v;\r\n\t}","title":""},{"docid":"6a62d3b7c2966fed1077776457c8aa41","score":"0.53015184","text":"@Test\r\n public void testMaxDouble() {\r\n Player player = new Player();\r\n int expResult = -1;\r\n int result = player.maxDouble();\r\n assertEquals(expResult, result);\r\n \r\n Stack stack=new Stack(false);\r\n player.setHand(stack.drawTiles(28));\r\n int expResult2=6;\r\n int result2=player.maxDouble();\r\n assertEquals(expResult2, result2);\r\n \r\n \r\n }","title":""},{"docid":"933b36327eff28acc8306c9cbf845e98","score":"0.52934074","text":"private static int evalState(GameState state){\n Move m = state.getMove();\n int counter = 0;\n\n // return directly if we encouter win or loss\n if(m.isXWin()){\n return 10000;\n }\n else if(m.isOWin()){\n return -1;\n }\n\n Vector<Integer> points = new Vector<Integer>();\n points.setSize(state.BOARD_SIZE*2+2);\n int player;\n Collections.fill(points, 1);\n int scaling = 4;\n int value = 0;\n\n for(int row = 0; row < state.BOARD_SIZE; row ++){\n for(int col = 0; col < state.BOARD_SIZE; col ++){\n player = state.at(row, col);\n\n // add points to the vector, increase by a factor for every new entry\n if(player == 1){\n points.set(row, points.get(row)*scaling);\n points.add(state.BOARD_SIZE + col, points.get(state.BOARD_SIZE - 1 + col)*scaling);\n\n // if it's in the first diagonal\n if(counter%state.BOARD_SIZE+1 == 0){\n points.add(state.BOARD_SIZE*2, points.get(state.BOARD_SIZE*2)*scaling);\n }\n\n // checking other diagonal\n if(counter%state.BOARD_SIZE-1 == 0 && row+col != 0){\n points.add(state.BOARD_SIZE*2 + 1, points.get(state.BOARD_SIZE*2)*scaling);\n }\n }\n // if an enemy player is encoutered null the value of the row/col\n else if(player == 2){\n points.set(row, 0);\n points.set(state.BOARD_SIZE + col, 0);\n if(counter%state.BOARD_SIZE+1 == 0){\n points.add(state.BOARD_SIZE*2, 0);\n }\n if(counter%state.BOARD_SIZE-1 == 0){\n points.add(state.BOARD_SIZE*2 + 1, 0);\n }\n }\n counter++;\n }\n }\n\n // if we have nulled the point we don't count it for the value of the state\n for(Integer i: points){\n if(i > 1){\n value += i;\n }\n }\n //System.err.println(\"Value: \" + value);\n return value;\n }","title":""},{"docid":"4a945850e99d939990b5753e7ec057ac","score":"0.5291221","text":"public int determineHighestVal() {\n if (playerCards[0].value > playerCards[1].value) {\n return playerCards[0].value;\n }\n return playerCards[1].value;\n\n }","title":""},{"docid":"d4ce3a42095ed163ad7f7b30c89b7b90","score":"0.52669233","text":"private int recursiveSearchCurrentPlayer(int maxDepth, int depth, GameState gs, Player currentPlayer, Board b,\r\n\t\t\tMoveTracker mt) {\r\n\t\tif (maxDepth == depth) {\r\n\t\t\treturn bEval.getEvaluation(currentPlayer, b, mt);\r\n\t\t} else if (depth != 0) {\r\n\t\t\tMove mv = nextStep(gs, currentPlayer, b, mt);\r\n\t\t\tif (mv == null) { // current player is in checkmate or stalemate\r\n\t\t\t\treturn Integer.MIN_VALUE;\r\n\t\t\t}\r\n\t\t\tBoard newBoard = b.cloneBoard();\r\n\t\t\tRules.move(gs, currentPlayer, newBoard, mt, null, mv);\r\n\t\t\treturn recursiveSearchOppositePlayer(maxDepth, depth + 1, gs.cloneGameState(), currentPlayer, newBoard, mt.cloneMoveTracker());\r\n\t\t} else {\r\n\t\t\treturn recursiveSearchOppositePlayer(maxDepth, depth + 1, gs.cloneGameState(), currentPlayer, b.cloneBoard(), mt.cloneMoveTracker());\r\n\t\t}\r\n\t}","title":""},{"docid":"4c3313cab9c1c315771635e317e8be22","score":"0.524731","text":"public int getExperienceToNextLevel() {\n\t\treturn (int)(Math.sqrt(level)*2*(level*level));\n\t}","title":""},{"docid":"e4c0e28be86d215ab5a724e780348a45","score":"0.524697","text":"private int minValue(Node state, int alpha, int beta) {\n\t\t\n\t\tthis.nodesExplored++;\n\t\tthis.nodesExploredThisTurn++;\n\t\t\n\t\tif (this.cutoffTest(state)) {\n\t\t\treturn state.eval(this.player);\n\t\t}\n\t\t\n\t\t\n\t\tArrayList<Move> legalMoves = state.getGame().getLegalMoves();\n\t\t\n\t\tif (this.moveOrdering) {\n\t\t\tthis.quickSort(state, legalMoves, 0, legalMoves.size() - 1, true);\n\t\t}\n\t\t\n\t\tint v = Integer.MAX_VALUE;\n\t\tMove bestMove = null;\n\t\tfor (Move move : legalMoves) {\n\n\t\t\tif (System.currentTimeMillis() - startMili > this.maxTime * 1000)\n\t\t\t\treturn 0;\n\t\t\t\n\t\t\tint value = this.maxValue(state.result(move), alpha, beta);\n\t\t\tif (v > value) { //\n\t\t\t\tv = value;\n\t\t\t\tbestMove = move;\n\t\t\t}\n\n\t\t\tif (v <= alpha) {\n\t\t\t\tstate.setBestMove(bestMove);\n\t\t\t\treturn v;\n\t\t\t}\n\t\t\tbeta = Math.min(v, beta);\n\t\t}\n\t\tstate.setBestMove(bestMove);\n\t\treturn v;\n\t}","title":""},{"docid":"a94294e62cc2ddbb3acce536535adc4d","score":"0.5240496","text":"private int evaluateChildren() {\n if (PRINT_PROGRESS) {\n System.out.println(\"Evaled:\"+boardsEvaluated);\n }\n if (this.children == null || this.children.isEmpty()) { // Exit case: Node is a leaf\n return evaluateBoard(this.board);\n }\n \n int bestEval = Integer.MIN_VALUE;\n for (final BoardTree child : this.children) {\n child.evaluation = child.evaluateChildren();\n if (child.evaluation > bestEval) {\n bestEval = child.evaluation;\n }\n }\n return bestEval;\n }","title":""},{"docid":"22e94b56c1585bd967339e1afc7ecc1e","score":"0.5232771","text":"public int makeAIMove(Player player) {\n\t\tint input = -1;\n\t\tboolean validMove = false;\n\n\t\tSystem.out.println(\"Current player is: \" + player.color);\n\n\t\t// Get all the valid moves if there are any\n\t\tArrayList<ArrayList<Integer>> validMoves = getValidMoves(board, player.color);\n\t\tprintValidMoves(validMoves, board);\n\t\t// As long as the input isn't correct, this will loop\n\t\twhile (validMove == false) {\n\t\t\t// Check if there are any possible moves\n\t\t\tif (!validMoves.isEmpty()) {\n\t\t\t\t// Als er een blocking move gedaan kan worden, wordt dit gedaan. Dit heeft\n\t\t\t\t// nummer 1 prioriteit.\n\t\t\t\tint blockMove = player.ai.blockingMove(validMoves, board, player);\n\t\t\t\tif (blockMove != -1) {\n\t\t\t\t\tinput = blockMove;\n\t\t\t\t\t// Random zet, gebeurt op dit moment nooit\n\t\t\t\t} else if (turn < 0) {\n\t\t\t\t\tinput = player.ai.random(board, player);\n\t\t\t\t\t// Zet gebaseerd op boardweight, gebeurt op dit moment nooit\n\t\t\t\t} else if (turn < 0) {\n\t\t\t\t\tinput = player.ai.boardWeighting(board, player);\n\t\t\t\t\t// Minimax, 8 diep, gebeurt tussen beurt 0 en 30\n\t\t\t\t} else if (turn < 30) {\n\t\t\t\t\tinput = player.ai.minimaxAvailableMoves(board, player, 0, 8, 0, 0, Integer.MIN_VALUE,\n\t\t\t\t\t\t\tInteger.MAX_VALUE, 0);\n\t\t\t\t\t// Minimax, 9 diep, gebeurt tussen beurt 30 en 40\n\t\t\t\t} else if (turn < 40) {\n\t\t\t\t\tinput = player.ai.minimaxAvailableMoves(board, player, 0, 9, 0, 0, Integer.MIN_VALUE,\n\t\t\t\t\t\t\tInteger.MAX_VALUE, 0);\n\t\t\t\t\t// Minimax, 10 diep, gebeurt tussen beurt 40 en 45\n\t\t\t\t} else if (turn < 45) {\n\t\t\t\t\tinput = player.ai.minimaxAvailableMoves(board, player, 0, 10, 0, 0, Integer.MIN_VALUE,\n\t\t\t\t\t\t\tInteger.MAX_VALUE, 0);\n\t\t\t\t\t// Minimax, 16 diep, gebeurt tussen beurt 45 en 60\n\t\t\t\t} else {\n\t\t\t\t\tinput = player.ai.minimaxTest(board, player, 0, 16, 0, 0, Integer.MIN_VALUE, Integer.MAX_VALUE, 0);\n\t\t\t\t}\n\n\t\t\t\t// Voer de move die gevonden is uit.\n\t\t\t\tvalidMove = setMove(input, validMoves, player.color, board);\n\n\t\t\t\tif (validMove == true) {\n\t\t\t\t\tturn++;\n\t\t\t\t}\n\t\t\t\t// Reset noWinnerCount\n\t\t\t\tnoWinnerCount = 0;\n\t\t\t} else {\n\t\t\t\t// 1 player can't move, if this counter reaches 2, that means both players can't\n\t\t\t\t// move and the game will end\n\t\t\t\tnoWinnerCount++;\n\t\t\t\tSystem.out.println(\"Out of moves + Count = \" + noWinnerCount);\n\t\t\t\tvalidMove = true;\n\t\t\t}\n\t\t}\n\n\t\t// Input is last player player\n\t\tArrayList<ArrayList<Integer>> validMovesOpponent = getValidMoves(board, player.opponent);\n\t\tif (validMovesOpponent.size() > 0) {\n\t\t\tswitchTurn(player);\n\t\t}\n\n\t\treturn input;\n\t}","title":""},{"docid":"2d8833f7d69dcf8ba7e83f729d1313c1","score":"0.5229196","text":"private Move getBestMove(Node node) {\n Move bestMove = null;\n double best_val = Integer.MIN_VALUE;\n for (Node child : node.getChildren()) {\n double payOff = (child.getPlays() == 0) ? 0 : (child.getWins() / child.getPlays());\n if (child.getPlays() == 0) {\n System.out.println(\"No records for play: \" + \"oldRow: \" + child.getState().getMove().oldRow + \", oldCol: \"\n + child.getState().getMove().oldCol + \", newRow: \" + child.getState().getMove().newRow + \", newCol: \" +\n child.getState().getMove().newCol + \", board: \" + Arrays.deepToString(child.getState().getBoard()));\n } else {\n System.out.println(\"payOff: \" + payOff + \", play: \" + \"oldRow: \" + child.getState().getMove().oldRow + \", oldCol: \"\n + child.getState().getMove().oldCol + \", newRow: \" + child.getState().getMove().newRow + \", newCol: \" +\n child.getState().getMove().newCol + \", plays: \" + child.getPlays() + \", wins: \" + child.getWins());\n }\n if (payOff > best_val) {\n best_val = payOff;\n bestMove = child.getState().getMove();\n }\n }\n System.out.println();\n return bestMove;\n }","title":""},{"docid":"5d645591ad1aa1e70dfd1c8eda4b13b9","score":"0.52251637","text":"public Action getBestAction() {\n long startTime = System.currentTimeMillis();\n\n // Continue iterating through the search algorithm until the time limit\n // is reached\n while (System.currentTimeMillis() < startTime + timeLimit) {\n Node newNode = selectAndExpandNewNode();\n double randomPlayout = simulateRandomPlayout(newNode);\n backPropagate(newNode, randomPlayout);\n }\n\n // Technically this function will take us slightly over timeLimit, but\n // that's why a buffer is removed from timeLimit when passed to this\n // class\n return bestActionFromFinishedTree();\n }","title":""},{"docid":"5a8175947012594a728806c64462fddf","score":"0.52205276","text":"@Override\n\tpublic double stateEvaluator(GameState s)\n\t{\r\n\t\tint count = 0;\n\t\tif (s.takenList[1] == 0)\r\n\t\t{\r\n\t\t\treturn 0;\r\n\t\t}\r\n\t\telse if(s.lastMove == 1)\r\n\t\t{\r\n\t\t\tfor (int i = 1; i < s.takenList.length ; i++)\r\n\t\t\t{\r\n\t\t\t\tif (s.takenList[i] == 0)\r\n\t\t\t\t{\r\n\t\t\t\t\tcount++;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tif (count % 2 == 0)\r\n\t\t\t{\r\n\t\t\t\treturn -0.5;\r\n\t\t\t}\r\n\t\t\telse \r\n\t\t\t{\r\n\t\t\t\treturn 0.5;\r\n\t\t\t}\r\n\t\t}\r\n\t\telse if (isPrime(s.lastMove))\r\n\t\t{\r\n\t\t\tfor (int i = 1; i < s.takenList.length; i++)\r\n\t\t\t{\r\n\t\t\t\tif (s.takenList[i] == 0 && i % s.lastMove == 0) // i = 4, % 2\r\n\t\t\t\t{\r\n\t\t\t\t\tcount++;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tif (count % 2 == 0)\r\n\t\t\t{\r\n\t\t\t\treturn -0.7;\r\n\t\t\t}\r\n\t\t\telse\r\n\t\t\t{\r\n\t\t\t\treturn 0.7;\r\n\t\t\t}\r\n\t\t}\r\n\t\telse \r\n\t\t{\r\n\t\t\tint largestPrime = 2;\r\n\t\t\tfor (int i = 2; i < (s.lastMove/2); i++)\r\n\t\t\t{\r\n\t\t\t\tif (s.lastMove % i == 0 && isPrime(i))\r\n\t\t\t\t{\r\n\t\t\t\t\tlargestPrime = i;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tfor (int i = largestPrime; i <= s.lastMove; i+= largestPrime)\r\n\t\t\t{\r\n\t\t\t\tif (s.takenList[i] == 0)\r\n\t\t\t\t{\r\n\t\t\t\t\tcount++;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tif (count % 2 == 0)\r\n\t\t\t{\r\n\t\t\t\treturn -0.6;\r\n\t\t\t}\r\n\t\t\telse \r\n\t\t\t{\r\n\t\t\t\treturn 0.6;\r\n\t\t\t}\r\n\r\n\t\t}\n\t}","title":""},{"docid":"486b744f7d59d129bdeb8de148cfbf33","score":"0.52149224","text":"public static int run(State curr_state, char player) {\n\t\tint result = 0;\r\n\t\t//Calls the max_value part because dark plays first, wants max value\r\n\t\tif(player == '1'){\r\n\t\t\t//Returns number of times the max function runs\r\n\t\t\tresult = max_value(curr_state);\r\n\t\t}\r\n\t\t//Start at min, as light's turn, and it wants min value and\r\n\t\t//therefore subsequently will call min_value nd return\r\n\t\telse if(player == '2'){\r\n\t\t\tresult = min_value(curr_state);\t\r\n\t\t}\r\n\t\t//Return the number of states , i.e., minCounter + max Counter\r\n\t\t//Return minCounter + maxCounter;\r\n\t\treturn result;\r\n\t}","title":""},{"docid":"b96d422c588659f00c7c4143cca06a61","score":"0.5212186","text":"@Override\r\n public int getSpecialValue() {\n int num = this.getCombatLevel();\r\n num += this.levelChangeAgainstCultistPlayer;\r\n \r\n return num;\r\n }","title":""},{"docid":"d856d8ef20756c79667616cc3f12c3d5","score":"0.52117634","text":"public Action getActionBasedOnValueEpsilonGreedy(final State state, final double epsilon) {\r\n final double decision = Math.random();\r\n final List<Action> allActions = new LinkedList<Action>();\r\n final List<Action> bestActions = new LinkedList<Action>();\r\n double bestValue = Integer.MIN_VALUE;\r\n\r\n // Determine the best action(s)\r\n for (final Map.Entry<Action, Double> actionValue : getProperties(state).getActionValues().entrySet()) {\r\n final Action action = actionValue.getKey();\r\n final double value = actionValue.getValue();\r\n\r\n allActions.add(action);\r\n\r\n if (value > bestValue) {\r\n bestActions.clear();\r\n bestValue = value;\r\n }\r\n if (value >= bestValue) {\r\n bestActions.add(action);\r\n }\r\n }\r\n\r\n if (decision > epsilon || allActions.size() == bestActions.size()) {\r\n // Pick a best action\r\n return bestActions.get((int) Math.floor(Math.random() * bestActions.size()));\r\n } else {\r\n // Pick a non-best action for exploration\r\n for (final Action bestAction : bestActions) {\r\n allActions.remove(bestAction);\r\n }\r\n return allActions.get((int) Math.floor(Math.random() * allActions.size()));\r\n }\r\n }","title":""},{"docid":"d9f19351964e2cf9a507ce346b4d8895","score":"0.5209583","text":"public int nextAction() {\n double w = random.nextDouble();\n for (int i = 0; i < nMoves; i++) {\n if (w < probabilities[i]) {\n lastMove = i;\n break;\n }\n w -= probabilities[i];\n }\n nIters++;\n\n if (N_SELECTED_ACTIONS > 1) {\n lastNMoves.add(lastMove);\n if (lastNMoves.size() > N_SELECTED_ACTIONS)\n lastNMoves.poll();\n }\n\n if (LOGGING && nIters % 1000 == 0) {\n for (int i = 0; i < nMoves; i++)\n logWriter.printf(\"%.8f;\", probabilities[i]);\n logWriter.println();\n logWriter.flush();\n }\n\n return lastMove;\n }","title":""},{"docid":"6bffeff2cdade42977eba68ed82afbde","score":"0.5205331","text":"@Override\n public Action getBestAction(Agent r, Maze m, QLearning q) {\n double epsilon = 0.000001d;\n ArrayList<Action> actions = m.getValidActions(r);\n double[] actionValues = q.getActionValues(r.getState(m), actions);\n\n ArrayList<Action> bestActions = new ArrayList<>();\n double maxValue = Double.MIN_VALUE;\n\n for (int i = 0; i < actionValues.length; i++)\n {\n if (actionValues[i] > maxValue)\n {\n bestActions = new ArrayList<>();\n maxValue = actionValues[i];\n bestActions.add(actions.get(i));\n } else if (Math.abs(actionValues[i] - maxValue) < epsilon) {\n bestActions.add(actions.get(i));\n }\n }\n\n Random rand = new Random();\n return bestActions.get(rand.nextInt(bestActions.size()));\n }","title":""},{"docid":"98fd58e946b070f50968c50581e00857","score":"0.52010405","text":"private int minimaxPlayerBlack(int depth, Player player, int alpha, int beta) {\n if ((!playerCanMove(playerBlack) && !playerCanMove(playerWhite)) || depth > plyCutoff) {\n return getHeuristic(playerBlack);\n }\n\n ArrayList<MoveNode> moves = getAllMoves(player.getColor());\n\n if (moves.isEmpty()) {\n return getHeuristic(playerBlack);\n }\n\n ArrayList<Integer> scores = new ArrayList<>();\n\n Integer[][] savedBoard = new Integer[Board.MAX_ROW][Board.MAX_COLUMN];\n\n if (plyCutoff >= depth) {\n copyBoard(savedBoard);\n }\n\n for (int i = 0; i < moves.size(); i++) {\n MoveNode move = moves.get(i);\n\n if (player.equals(playerBlack)) {\n makeMoveFromMinimax(move);\n\n int currentScore = minimaxPlayerBlack(depth + 1, playerWhite, alpha, beta);\n scores.add(currentScore);\n\n if (alphaBetaEnable) {\n if (move.getMinimaxValue() > alpha) {\n alpha = move.getMinimaxValue();\n }\n\n if (beta <= alpha) {\n break;\n }\n }\n\n if (depth == 0) {\n move.setMinimaxValue(currentScore);\n rootValues.add(move);\n }\n } else if (player.equals(playerWhite)) {\n makeMoveFromMinimax(move);\n\n int currentScore = minimaxPlayerBlack(depth + 1, playerBlack, alpha, beta);\n scores.add(currentScore);\n\n if (alphaBetaEnable) {\n if (move.getMinimaxValue() < beta) {\n beta = move.getMinimaxValue();\n }\n\n if (alpha >= beta) {\n break;\n }\n }\n }\n\n resetBoard(savedBoard);\n }\n\n if (player.equals(playerBlack)) {\n return Collections.max(scores);\n }\n\n return Collections.min(scores);\n }","title":""},{"docid":"7cd9b33bbdb103734c9aae81070e346d","score":"0.5187843","text":"public Integer getMaxDepth() {\n return this.maxDepth;\n }","title":""},{"docid":"4d50f4d5081b1043d266d28111de4898","score":"0.5187245","text":"private float alphaBeta(Node n, int depth, double A, double B, int player) {\n\t\t\n\t\t// Only do a depth check for termination, as this implementation passes nodes that initially have empty\n\t\t// successor moves (so we can't test for terminal node at this step)\n\t\tif(depth == 0) {\n\t\t\tleaves++;\n\t\t\t\n\t\t\tfloat score = g_board.evaluate(player);\n\t\t\tn.setScore(score);\n\t\t\t\n\t\t\treturn score;\n\t\t}\n\t\t\n\t\tif(n.getChildren() == null || n.getChildren().isEmpty()) {\n\t\t\t// Send the parent information to the move generator, which will recursively call A-B with the child information\n\t\t\treturn generateLegalMoves(n, depth, A, B, player);\n\t\t} else {\n\t\t\t// If we have a pre-constructed tree already, we can run normal alphaBeta\n\t\t\tArrayList<Node> moves = n.getChildren();\n\t\t\t\n\t\t\t// White\n\t\t\tif(player == WHITE) {\n\t\t\t\tdouble val = Double.NEGATIVE_INFINITY;\n\t\t\t\t\n\t\t\t\tfor(Node child : moves) {\n\t\t\t\t\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, (BLACK)));\n\t\t\t\t\tA = Math.max(val, A);\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\treturn (float)val;\n\t\t\t// Black\n\t\t\t} else {\n\t\t\t\tdouble val = Double.POSITIVE_INFINITY;\n\t\t\t\t\n\t\t\t\tfor(Node child : moves) {\n\t\t\t\t\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, (WHITE)));\n\t\t\t\t\tB = Math.min(val, B);\n\t\t\t\t\tif(A >= B) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\treturn (float)val;\n\t\t\t}\n\t\t}\t\n\t}","title":""},{"docid":"015353c1b60f24371f7ff4dcad605c19","score":"0.5185909","text":"public int getJumpMaxElevationChange() {\n return getMaxElevation() -\n getGame().getBoard().getHex(getFinalCoords()).getLevel();\n }","title":""},{"docid":"f3d140e2366e24584afec163ad08bcc0","score":"0.51842564","text":"private int minMaxHelper(int alpha, int beta, int currDepth,\n int cPlayerID, Moves move,\n Point playerNewPos,\n Point player1pos,\n Point player2pos,\n int scoreP1, int scoreP2) {\n Point oppPlayer = player1pos;\n if (cPlayerID == 1) {\n oppPlayer = player2pos;\n }\n\n if (gameState[playerNewPos.x][playerNewPos.y] == States.EMPTY) {\n if (didCloseOffNewSpace(playerNewPos, move)) {\n // calculate new opponent score (max of all possible opponent scores)\n int opponentNewScore = 0;\n int playerNewScore = findNumOpenSpots(playerNewPos)\n Point[] adjPoints = getAdjacentPoints(oppPlayer);\n for (int i = 0; i < adjPoints.length; i++) {\n int tempAdjScore = findNumOpenSpots(adjPoints[i]);\n opponentNewScore = opponentNewScore > tempAdjScore ? opponentNewScore : tempAdjScore;\n }\n\n // set opponents new score\n if (cPlayerID == 1) {\n scoreP1 = playerNewScore;\n scoreP2 = opponentNewScore;\n } else {\n scoreP1 = opponentNewScore;\n scoreP2 = playerNewScore;\n }\n }\n } else {\n // spot is a player\n if (playerNewPos.x == oppPlayer.x && playerNewPos.y == oppPlayer.y) {\n return tyingScore;\n }\n // spot is a losing point\n return losingScore;\n }\n\n Point newPlayer1pos = player1pos;\n Point newPlayer2pos = player2pos;\n int nextPlayerID = 1;\n // set pos of curr player and swap player\n if (cPlayerID == 1) {\n newPlayer1pos = playerNewPos;\n nextPlayerID = 2;\n } else {\n newPlayer2pos = playerNewPos;\n }\n\n if (cPlayerID == 1) {\n gameState[playerNewPos.x][playerNewPos.y] = States.PLAYER1;\n } else {\n gameState[playerNewPos.x][playerNewPos.y] = States.PLAYER2;\n }\n\n int nextScore = minMax(alpha, beta, currDepth-1, nextPlayerID, newPlayer1pos, newPlayer2pos, scoreP1, scoreP2);\n\n return nextScore;\n }","title":""},{"docid":"e5a04155a4277ffadd69aa8bd3082905","score":"0.517708","text":"private Move findBestMove(Piece player, Board board, int depth,\n double cutoff) {\n Board newBoard = new Board(board);\n Move bestSoFar = newBoard.iterator().next();\n Iterator<Move> moveIterator = board.iterator();\n if (newBoard.piecesContiguous(player)) {\n return bestSoFar;\n } else if (newBoard.piecesContiguous(player.opposite())) {\n return guessBestMove(player, newBoard, cutoff);\n } else if (depth == 0) {\n return guessBestMove(player, newBoard, cutoff);\n }\n while (moveIterator.hasNext()) {\n Move nextMove = moveIterator.next();\n newBoard.makeMove(nextMove);\n int boardValue = eval(newBoard);\n Move response = findBestMove(player.opposite(),\n newBoard, depth - 1, -boardValue);\n newBoard.makeMove(response);\n int responseVal = eval(newBoard);\n newBoard.retract();\n newBoard.retract();\n if (-responseVal > boardValue) {\n boardValue = -responseVal;\n bestSoFar = nextMove;\n if (boardValue >= cutoff) {\n break;\n }\n }\n }\n return bestSoFar;\n }","title":""},{"docid":"bc60da47dd00efd8b2767f6f2ee55f54","score":"0.51742315","text":"PrioritizedMove getBestMoveFor(int player, int desiredLength);","title":""},{"docid":"4e2a04e72b5da6374a1280dd5f87a256","score":"0.51728344","text":"public List<Integer> GetMoves(boolean growthMoves, boolean expandMoves, boolean captureMoves, int maxGrowthValue) {\n List<Integer> moves = new ArrayList<>();\n\n if (Winner != PlayerType.Empty) {\n return moves;\n } else if (GetMoveTypeForTurn(Turn) == MoveType.AllGrow) {\n moves.add(Constants.AllGrowMove);\n } else {\n for (int i = 0; i < 80; i++) {\n // Grow existing tiles\n if (growthMoves && ((Tiles[i] > 0 && Player == PlayerType.One) || (Tiles[i] < 0 && Player == PlayerType.Two)) && Math.abs(Tiles[i]) < maxGrowthValue) {\n if (!Settings.AllowDormantVolcanoes || !Dormant[i]) {\n moves.add(i);\n }\n }\n\n // Claim new tiles\n if (expandMoves && Tiles[i] == 0) {\n moves.add(i);\n }\n\n // Capture enemy tiles\n if (captureMoves) {\n PlayerType opponent = Player == PlayerType.One ? PlayerType.Two : PlayerType.One;\n if (Settings.AllowMagmaChamberCaptures &&\n ((Tiles[i] > 0 && opponent == PlayerType.One) || (Tiles[i] < 0 && opponent == PlayerType.Two)) &&\n Math.abs(Tiles[i]) <= Settings.MaxMagmaChamberLevel) {\n moves.add(i);\n }\n if (Settings.AllowVolcanoCaptures &&\n ((Tiles[i] > 0 && opponent == PlayerType.One) || (Tiles[i] < 0 && opponent == PlayerType.Two)) &&\n Math.abs(Tiles[i]) > Settings.MaxMagmaChamberLevel) {\n moves.add(i);\n }\n }\n }\n }\n\n if (moves.size() == 0) {\n if (growthMoves && expandMoves & captureMoves && maxGrowthValue >= Settings.MaxVolcanoLevel) {\n // There are no moves in this position\n return moves;\n } else {\n return GetMoves(true, true, true, Settings.MaxVolcanoLevel);\n }\n }\n\n return moves;\n }","title":""},{"docid":"c4279e55ca8989995f48196e55758734","score":"0.5168601","text":"public static byte getMaxMoves() {\n return MAX_MOVES;\n }","title":""},{"docid":"bb6515c5dd5454403cd2fc6b53a7f41a","score":"0.5160259","text":"void setTemporaryMaxDepth(int depth);","title":""},{"docid":"cdc12a49153e7c44d3cf973eef154634","score":"0.51587516","text":"UAction nextAction() { What should we do next? Override this for custom AI.\n //\n updateSeenEntities();\n UAction bestAction = null;\n float bestUrgency = 0f;\n int bc=0;\n for (UBehavior behavior : behaviors) {\n bc++;\n UAction action = behavior.getAction(this);\n if (action != null) {\n if (bestAction == null) {\n bestAction = action;\n bestUrgency = behavior.getCurrentUrgency();\n } else if (behavior.getCurrentUrgency() > bestUrgency) {\n bestAction = action;\n bestUrgency = behavior.getCurrentUrgency();\n }\n }\n }\n return bestAction;\n }","title":""}],"string":"[\n {\n \"docid\": \"3c984dcbe4cf9da5dadf74ae2749900e\",\n \"score\": \"0.7206506\",\n \"text\": \"@Override\\r\\n\\tpublic double max_value(GameState s, int depthLimit) \\r\\n\\t{\\r\\n\\t\\tdouble stateEvaluationValue = stateEvaluator(s);\\r\\n\\r\\n\\t\\tif (depthLimit == 0)\\r\\n\\t\\t{\\r\\n\\t\\t\\treturn stateEvaluationValue;\\r\\n\\t\\t}\\r\\n\\t\\telse\\r\\n\\t\\t{\\r\\n\\t\\t\\tdouble currMax = Double.NEGATIVE_INFINITY;\\r\\n\\t\\t\\tint bestMove = 0;\\r\\n\\t\\t\\tArrayList <Integer> succList = generateSuccessors(s.lastMove, s.takenList);\\r\\n\\t\\t\\tif (succList.isEmpty())\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\ts.bestMove = -1;\\r\\n\\t\\t\\t\\ts.leaf = true;\\r\\n\\t\\t\\t\\treturn -1;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tIterator <Integer> myItr = succList.iterator();\\r\\n\\t\\t\\twhile (myItr.hasNext())\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tdouble tempMax = currMax;\\r\\n\\t\\t\\t\\tint currNumber = myItr.next();\\r\\n\\t\\t\\t\\tint [] newList = s.takenList;\\r\\n\\t\\t\\t\\tnewList [currNumber] = 1; //assign it to player 1\\r\\n\\t\\t\\t\\tGameState newGameState = new GameState(newList, currNumber);\\r\\n\\t\\t\\t\\tcurrMax = Math.max(currMax, min_value(newGameState, depthLimit - 1));\\r\\n\\r\\n\\t\\t\\t\\tif (tempMax < currMax)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tbestMove = currNumber;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\ts.bestMove = bestMove;\\t\\t\\t\\r\\n\\t\\t\\treturn currMax;\\r\\n\\t\\t}\\r\\n\\r\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f19e9bd75518ead0329fb0ffb8cc0676\",\n \"score\": \"0.6914502\",\n \"text\": \"@Override\\r\\n\\tpublic double min_value(GameState s, int depthLimit)\\r\\n\\t{\\r\\n\\t\\tdouble stateEvaluationValue = stateEvaluator(s);\\r\\n\\t\\r\\n\\t\\tif (depthLimit == 0)\\r\\n\\t\\t{\\r\\n\\t\\t\\treturn -(stateEvaluationValue);\\r\\n\\t\\t}\\r\\n\\t\\telse\\r\\n\\t\\t{\\r\\n\\t\\t\\tdouble currMin = Double.POSITIVE_INFINITY;\\r\\n\\t\\t\\tint bestMove = 0;\\r\\n\\t\\t\\tArrayList <Integer> succList = generateSuccessors(s.lastMove, s.takenList);\\r\\n\\t\\t\\tif (succList.isEmpty())\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\ts.leaf = true;\\r\\n\\t\\t\\t\\treturn 1;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tIterator <Integer> myItr = succList.iterator();\\r\\n\\t\\t\\t\\r\\n\\t\\t\\twhile (myItr.hasNext())\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tint currNumber = myItr.next();\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\tdouble tempMin = currMin;\\r\\n\\t\\t\\t\\tint [] newList = s.takenList;\\r\\n\\t\\t\\t\\tnewList [currNumber] = 2;\\r\\n\\t\\t\\t\\tGameState newGameState = new GameState(newList, currNumber);\\r\\n\\t\\t\\t\\tcurrMin = Math.min(currMin, max_value(newGameState, depthLimit - 1));\\r\\n\\r\\n\\t\\t\\t\\tif (currMin < tempMin)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tbestMove = currNumber;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\ts.bestMove = bestMove;\\r\\n\\t\\t\\treturn currMin;\\r\\n\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9a4ba6428c2567a242c9a2e6c324ab1f\",\n \"score\": \"0.67425936\",\n \"text\": \"public MoveNode ab(PentagoBoardState pbs,int myscore, int alpha, int beta,int amimaxplayer, int depth,int requireddepth){\\n\\n int bestmovescore;\\n PentagoMove bestmove;\\n\\n ArrayList<PentagoMove> legalmoves = pbs.getAllLegalMoves();\\n Collections.shuffle(legalmoves); //helps avoid worst run time if all good moves are at the end of array list\\n\\n MoveNode moveNode =new MoveNode(new PentagoMove(0,0,0,0,0),0);\\n\\n if (depth==requireddepth){\\n bestmovescore= evaluate(pbs);\\n moveNode.MyMove = null;\\n moveNode.value = evaluate(pbs);\\n return moveNode;\\n\\n }\\n else if (pbs.getWinner() != Board.NOBODY){ //check win since we are at leafnode\\n bestmovescore= evaluate(pbs);\\n moveNode.MyMove = null;\\n int movescore = evaluate(pbs);\\n if (movescore<-1200000){\\n moveNode.value = -999999999; //assign loss value\\n } //Losing Move\\n else if (movescore>1200000){\\n moveNode.value = 999999999; //assign win value\\n } // Winning Move\\n return moveNode;\\n\\n }\\n //do max player\\n if (amimaxplayer ==1){\\n int currentvalue = -999999999;\\n PentagoMove currentmove =legalmoves.get(0);\\n MoveNode currentmovenode = new MoveNode(currentmove,currentvalue);\\n for (int i = 0; i < legalmoves.size(); i++) {\\n PentagoBoardState newboard = (PentagoBoardState) pbs.clone();\\n PentagoMove movetoprocess = legalmoves.get(i);\\n newboard.processMove(movetoprocess);\\n\\n\\n MoveNode scoreAfterMove = ab(newboard, currentvalue, alpha, beta, 0, depth + 1, requireddepth); // run recursion till leaf node or depth reached\\n if (scoreAfterMove.value > currentvalue) { //see if current best value is lower than the new value if so replace\\n currentvalue = scoreAfterMove.value;\\n currentmove = movetoprocess;\\n currentmovenode.value = currentvalue;\\n currentmovenode.MyMove = currentmove;\\n\\n //System.out.println(\\\"I am max plyaer at depth:\\\" + depth + \\\"\\\\n current move is: \\\" + currentmove + \\\"\\\\ncurrentvalue is: \\\" + currentvalue);\\n\\n }\\n\\n alpha = Math.max(alpha,currentvalue);\\n if (alpha>=beta){ // break loop if alpha more than beta\\n //System.out.println(\\\"Get pruned my alpha is \\\" + alpha + \\\" my beta is \\\" + beta );\\n break;\\n }\\n }\\n //System.out.println(\\\"I am max plyaer at depth:\\\" + depth + \\\"\\\\n current move is: \\\" + currentmove + \\\"\\\\ncurrentvalue is: \\\" + currentvalue+\\\" my alpha is \\\" + alpha + \\\" my beta is \\\" + beta);\\n\\n return currentmovenode;\\n }\\n //do min player\\n else if (amimaxplayer==0){\\n int currentvalue = 999999999;\\n PentagoMove currentmove =legalmoves.get(0);\\n MoveNode currentmovenode = new MoveNode(currentmove,currentvalue);\\n for (int i = 0; i < legalmoves.size(); i++) {\\n PentagoBoardState newboard = (PentagoBoardState) pbs.clone();\\n PentagoMove movetoprocess = legalmoves.get(i);\\n newboard.processMove(movetoprocess);\\n\\n MoveNode scoreAfterMove = ab(newboard, currentvalue, alpha, beta, 1, depth + 1, requireddepth);\\n if (scoreAfterMove.value < currentvalue) {\\n currentvalue = scoreAfterMove.value;\\n currentmove = movetoprocess;\\n currentmovenode.value = currentvalue;\\n currentmovenode.MyMove = currentmove;\\n //System.out.println(\\\"I am min plyaer at depth:\\\" + depth + \\\"\\\\n current move is: \\\" + currentmove + \\\"\\\\ncurrentvalue is: \\\" + currentvalue);\\n }\\n beta = Math.min(beta,currentvalue);\\n if (alpha>=beta){\\n //System.out.println(\\\"Get pruned my alpha is \\\" + alpha + \\\" my beta is \\\" + beta );\\n break;\\n }\\n }\\n return currentmovenode;\\n }\\n //System.out.println(\\\"move val \\\" + moveNode.value);\\n return moveNode;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"79de7aa12a3bd05a66a1762335d07986\",\n \"score\": \"0.66441154\",\n \"text\": \"public static PentagoMove excecuteMiniMax(PentagoBoardState bs, int depth) {\\n\\t\\tlong timerStart = System.currentTimeMillis();\\n\\t\\tPentagoMove bestMove = null;\\n\\t\\tint highestVal = Integer.MIN_VALUE;\\n\\t\\tint lowestVal = Integer.MAX_VALUE;\\n\\t\\tint currentVal = 0;\\n\\t\\tint possibleMoves = bs.getAllLegalMoves().size();\\n\\t\\tfor (PentagoMove move : bs.getAllLegalMoves()) {\\n\\t\\t\\tPentagoBoardState stateClone = (PentagoBoardState) bs.clone();\\n\\t\\t\\tstateClone.processMove(move);\\n\\t\\t\\tif(bs.getTurnPlayer() == 0) {\\n\\t\\t\\t\\tMax(stateClone, depth-1);\\n\\t\\t\\t}\\n\\t\\t\\telse if(bs.getTurnPlayer() == 1) {\\n\\t\\t\\t\\tMin(stateClone, depth-1);\\n\\t\\t\\t}\\n\\t\\t\\tif (bs.getTurnPlayer() == 0 && currentVal >= highestVal) {\\n\\t\\t\\t\\thighestVal = currentVal;\\n\\t\\t\\t\\tbestMove = move;\\n\\t\\t\\t}\\n\\t\\t\\telse if (bs.getTurnPlayer() == 1 && currentVal <= lowestVal) {\\n\\t\\t\\t\\tlowestVal = currentVal;\\n\\t\\t\\t\\tbestMove = move;\\n\\t\\t\\t}\\n\\t\\t\\tif (System.currentTimeMillis() - timerStart >= 1900) {\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tlong totalTime = System.currentTimeMillis() - timerStart;\\n\\t\\tSystem.out.println(totalTime);\\n\\t\\treturn bestMove;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"99cb2bf3c8550fd95bc37b4ffa1de9e0\",\n \"score\": \"0.64711577\",\n \"text\": \"@Override\\r\\n\\tpublic int move(int lastMove, int[] takenList, int depthLimit) \\r\\n\\t{\\r\\n\\t\\tGameState myState = new GameState(takenList, lastMove);\\r\\n\\t\\tdouble maxValue = max_value(myState, depthLimit);\\r\\n\\t\\tint myBestMove = myState.bestMove;\\r\\n\\t\\tif (myState.leaf) //why did i do this\\r\\n\\t\\t{\\r\\n\\t\\t\\treturn -1;\\r\\n\\t\\t}\\r\\n\\t\\treturn myBestMove;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8b7422f01b627ecb06336ef275092928\",\n \"score\": \"0.6449242\",\n \"text\": \"private int negaMax(int depth, String indent) {\\r\\n\\r\\n\\t\\tif (depth <= 0\\r\\n\\t\\t\\t|| this.chessGame.getGameState() == ChessGame.GAME_STATE_END_WHITE_WON\\r\\n\\t\\t\\t|| this.chessGame.getGameState() == ChessGame.GAME_STATE_END_BLACK_WON){\\r\\n\\t\\t\\t\\r\\n\\t\\t\\treturn evaluateState();\\r\\n\\t\\t}\\r\\n\\t\\t\\r\\n\\t\\tList<Move> moves = generateMoves(false);\\r\\n\\t\\tint currentMax = Integer.MIN_VALUE;\\r\\n\\t\\t\\r\\n\\t\\tfor(Move currentMove : moves){\\r\\n\\t\\t\\t\\r\\n\\t\\t\\texecuteMove(currentMove);\\r\\n\\t\\t\\t//ChessConsole.printCurrentGameState(this.chessGame);\\r\\n\\t\\t\\tint score = -1 * negaMax(depth - 1, indent+\\\" \\\");\\r\\n\\t\\t\\t//System.out.println(indent+\\\"handling move: \\\"+currentMove+\\\" : \\\"+score);\\r\\n\\t\\t\\tundoMove(currentMove);\\r\\n\\t\\t\\t\\r\\n\\t\\t\\tif( score > currentMax){\\r\\n\\t\\t\\t\\tcurrentMax = score;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\t//System.out.println(indent+\\\"max: \\\"+currentMax);\\r\\n\\t\\treturn currentMax;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7b8366e19563eeebf44403664c6b159f\",\n \"score\": \"0.6436687\",\n \"text\": \"public int minimax(TablutBoardState boardState, boolean isMax, int depth, int alpha, int beta) {\\n\\t\\tif (boardState.gameOver()){\\n\\t\\t\\t//System.out.println(\\\"reach endgame in minimax\\\");\\n\\t\\t\\tif (boardState.getWinner() == boardState.MUSCOVITE) {\\n\\t return 1000;\\n\\t }else if (boardState.getWinner()==boardState.SWEDE){\\n\\t \\treturn -1000;\\n\\t }else{\\n\\t \\treturn 0;\\n\\t }\\n\\t\\t}\\n\\t\\tif (depth == 0){\\n\\t\\t\\t//System.out.println(\\\"reach bottom in minimax\\\");\\n return heuristic(boardState);\\n }\\n\\t\\t//int bestValue;\\n\\n\\t\\tif(isMax){\\n\\t\\t\\tint bestValue = Integer.MIN_VALUE;\\n\\t\\t\\tHashMap<Integer,TablutMove> moveScore = new HashMap<>();\\n\\t\\t\\tfor(TablutMove move : boardState.getAllLegalMoves()){\\n\\t\\t\\t\\tTablutBoardState cloneBS = (TablutBoardState) boardState.clone();\\n\\t\\t\\t\\tcloneBS.processMove(move);\\n\\t\\t\\t\\tint val = minimax(cloneBS,false,depth-1,alpha,beta);\\n\\t\\t\\t\\tmoveScore.put(new Integer(val),move); \\n\\t\\t\\t\\tbestValue = max(bestValue,val);\\n\\t\\t\\t\\talpha = max(alpha,bestValue);\\n\\t\\t\\t\\t//System.out.println(\\\"alpha: \\\"+alpha+\\\", beta: \\\"+beta);\\n\\t\\t\\t\\tif (beta <= alpha){\\n\\t\\t\\t\\t\\t//System.out.println(\\\"prunning: alpha: \\\"+alpha+\\\" and beta: \\\"+beta);\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\t\\n\\t\\t\\t}\\n\\t\\t\\tInteger index= Collections.max(moveScore.keySet());\\n\\t\\t\\tif(depth == DEPTH){\\n\\t\\t\\t\\t//System.out.println(\\\"update move from max\\\");\\n\\t\\t\\t\\tbestMove = moveScore.get(index);\\n\\t\\t\\t}\\n\\t\\t\\t\\n moveScore = null;\\n\\t\\t\\treturn bestValue;\\n\\t\\t\\t\\n\\t\\t}else{\\n\\t\\t\\tint bestValue = Integer.MAX_VALUE;\\n\\t\\t\\tHashMap<Integer,TablutMove> moveScore = new HashMap<>();\\n\\t\\t\\tfor(TablutMove move : boardState.getAllLegalMoves()){\\n\\t\\t\\t\\tTablutBoardState cloneBS = (TablutBoardState) boardState.clone();\\n\\t\\t\\t\\tcloneBS.processMove(move);\\n\\t\\t\\t\\tint val = minimax(cloneBS,true,depth-1,alpha,beta);\\n\\t\\t\\t\\tmoveScore.put(new Integer(val),move); \\n\\t\\t\\t\\tbestValue = min(bestValue,val);\\n\\t\\t\\t\\tbeta = min(beta,bestValue);\\n\\t\\t\\t\\t//System.out.println(\\\"alpha: \\\"+alpha+\\\", beta: \\\"+beta);\\n\\t\\t\\t\\tif(beta<= alpha){\\n\\t\\t\\t\\t\\t//System.out.println(\\\"prunning: alpha: \\\"+alpha+\\\" and beta: \\\"+beta);\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t\\tInteger index= Collections.min(moveScore.keySet());\\n\\t\\t\\tif(depth == DEPTH){\\n\\t\\t\\t\\t//System.out.println(\\\"update move from min\\\");\\n\\t\\t\\t\\tbestMove = moveScore.get(index);\\n\\t\\t\\t}\\n moveScore = null;\\n\\t\\t\\treturn bestValue;\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t\\t\\n\\t\\t//return 0;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b5ed00faa8cf93855eb7b77fcdd258ba\",\n \"score\": \"0.6435788\",\n \"text\": \"public static Pair<Integer, PentagoMove> miniMaxAlgo(PentagoBoardState boardState, int depth, int playerTurn) {\\n\\t\\t\\n\\t\\tArrayList<PentagoMove> possibleMoves = boardState.getAllLegalMoves();\\n\\t\\tint score = 0;\\n\\t\\t\\n\\t\\t//assign a high or low value to begin with, no move can have that high/low a value\\n\\t\\tif (playerTurn == 1) {\\n\\t\\t\\tscore = Integer.MIN_VALUE;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tscore = Integer.MAX_VALUE;\\n\\t\\t}\\n\\t\\t\\n\\t\\tint currentScore;\\n\\t\\tPentagoMove chosenMove = null;\\n\\t\\t\\n\\t\\t//when all moves have been propagated up to the depth desired, find the most valuated move\\n\\t\\tif (possibleMoves.size() == 0 || depth == 0) {\\n\\t\\t\\tscore = heuristic(boardState);\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\t//iterating through all possible moves\\n\\t\\t\\tfor(int i = 0; i < possibleMoves.size(); i++) {\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t//cloning board to predict 2 moves ahead (depth is 2)\\n\\t\\t\\t\\tPentagoBoardState clone = (PentagoBoardState) boardState.clone();\\n\\t\\t\\t\\tclone.processMove(possibleMoves.get(i));\\n\\t\\t\\t\\tint player = 1 - playerTurn;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t//0 = white, trying to maximize\\n\\t\\t\\t\\tif (player == 0) {\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t//if a found score is higher, make it the new current score, then use minimize at the lower depth\\n\\t\\t\\t\\t\\t//player will be \\\"swapped\\\" (if opponent is current player, we'll simulate the player's turn) when making the recursive call\\n\\t\\t\\t\\t\\tcurrentScore = miniMaxAlgo(clone, depth - 1, player).getKey();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif (currentScore >= score) {\\n\\t\\t\\t\\t\\t\\tchosenMove = possibleMoves.get(i);\\n\\t\\t\\t\\t\\t\\tscore = currentScore;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t} \\n\\t\\t\\t\\t\\n\\t\\t\\t\\t//1 = black, trying to minimize\\n\\t\\t\\t\\telse if (player == 1) {\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t//if a found score is lower, make it the new current score, then use maximize at the lower depth\\n\\t\\t\\t\\t\\t//player will be \\\"swapped\\\" (if opponent is current player, we'll simulate the player's turn) when making the recursive call\\n\\t\\t\\t\\t\\tcurrentScore = miniMaxAlgo(clone, depth - 1, player).getKey();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif (currentScore <= score) {\\n\\t\\t\\t\\t\\t\\tchosenMove = possibleMoves.get(i);\\n\\t\\t\\t\\t\\t\\tscore = currentScore;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//decided to go with pair to avoid having separated methods for the score and the move\\n\\t\\t//it is easy to extract the required value using .getKey() or .getValue()\\n\\t\\tPair<Integer, PentagoMove> answer = new Pair<>(score, chosenMove);\\n\\t\\treturn answer;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7a78acd57ebf9afa83d09660c2577598\",\n \"score\": \"0.64132524\",\n \"text\": \"private double minimax(int depth, boolean isMaximizingPlayer, double alpha, double beta) {\\n // Check the hashmap for this board\\n if (this.hashMap.containsKey(this.game.hashCode())) {\\n try {\\n double value = this.hashMap.get(this.game.hashCode());\\n this.hashMapHits += 1;\\n return value;\\n } catch (NullPointerException ex) {\\n System.out.println(\\\"Minimax - hashmap error\\\");\\n }\\n }\\n\\n // Base case\\n if (depth == 0) {\\n double value = -BoardEvaluator.evaluate(player, this.game.getBoard());\\n this.hashMap.put(this.game.hashCode(), value);\\n return value;\\n }\\n\\n List<Move> moves = this.game.getValidMoves(this.game.getActivePlayer());\\n\\n if (isMaximizingPlayer) {\\n double bestValue = Double.NEGATIVE_INFINITY;\\n for (Move move : moves) {\\n this.game.executeMove(move, false);\\n this.game.endTurn(false);\\n bestValue = Math.max(bestValue, minimax(depth - 1, !isMaximizingPlayer, alpha, beta));\\n this.game.undoMove(move, false);\\n this.game.endTurn(false);\\n this.moveCount += 1;\\n\\n alpha = Math.max(alpha, bestValue);\\n\\n // Alpha-Beta pruning\\n if (beta <= alpha) {\\n break;\\n }\\n }\\n return bestValue;\\n } else {\\n double bestValue = Double.POSITIVE_INFINITY;\\n for (Move move : moves) {\\n this.game.executeMove(move, false);\\n this.game.endTurn(false);\\n bestValue = Math.min(bestValue, minimax(depth - 1, !isMaximizingPlayer, alpha, beta));\\n this.game.undoMove(move, false);\\n this.game.endTurn(false);\\n this.moveCount += 1;\\n\\n beta = Math.min(beta, bestValue);\\n\\n // Alpha-Beta pruning\\n if (beta <= alpha) {\\n break;\\n }\\n }\\n return bestValue;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dd91584e4f034289dec7885d12d7cd7e\",\n \"score\": \"0.6368211\",\n \"text\": \"private int[] maxValue(int[][] currentState, int[] alpha, int[] beta, int depth) {\\n int[] bestMove = new int[]{MinimaxUtilties.freeCentralColumn(currentState), Integer.MIN_VALUE, 0};\\n\\n if (terminalTest(currentState) != 0) {\\n return new int[]{0, utility(currentState), maxDepth - depth};\\n }\\n\\n if (depth < 1){\\n return new int[]{0, utility(currentState), maxDepth};\\n }\\n\\n if (terminalTest(currentState) == 0 && depth > 0) {\\n // find all possible actions for this player from the current game state\\n ArrayList<Integer> possibleActions = actions(currentState, 1);\\n\\n // check if each possible action is better than the best action so far\\n for (int i = 0; i < possibleActions.size(); i++) {\\n int column = possibleActions.get(i);\\n int[][] resultOfAction = result(currentState, column, 1);\\n\\n // returns [column that was chosen, utility of choosing it]\\n int[] currentResult = new int[]{column, minValue(resultOfAction, alpha, beta, depth - 1)[1], maxDepth - depth};\\n\\n // found a new best action\\n // new move is better, or equal to best move but has shallower depth\\n if (currentResult[1] > bestMove[1] || (currentResult[1] == bestMove[1] && currentResult[2] < bestMove[2])) {\\n bestMove = currentResult;\\n }\\n\\n if (bestMove[1] > alpha[1] || (bestMove[1] == alpha[1] && bestMove[2] < alpha[2])) alpha = bestMove; // new best action is better than the current alpha action\\n\\n if (alpha[1] >= beta[1]) return alpha; // beta cut-off\\n }\\n }\\n\\n return bestMove;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"52738910de753d8aa2e39acfcb3877e0\",\n \"score\": \"0.63363177\",\n \"text\": \"private Outcome minMax(PossibleBoard posBoard, Icon icon, int depth) {\\n Outcome outcome = new Outcome();\\n Result result = posBoard.determineOutcome();\\n boolean maximiseWin = icon == getIcon();\\n\\n // BASE CASE\\n if (result.gameComplete()) {\\n outcome.score = result.getBonus();\\n outcome.moveToMake = posBoard.coor;\\n outcome.depth = depth;\\n return outcome;\\n }\\n\\n ArrayList<PossibleBoard> posNextBoards = getPossibleNextBoards(posBoard, icon);\\n int optimalScore = (maximiseWin ? Integer.MIN_VALUE : Integer.MAX_VALUE);\\n Coordinate optimalCoor = new Coordinate(0,0);\\n int optimalDepth = Integer.MAX_VALUE;\\n\\n for (PossibleBoard posNextBoard : posNextBoards) {\\n Outcome nextOutcome = minMax(posNextBoard, (icon == Icon.CROSSES ? Icon.NOUGHTS : Icon.CROSSES), depth + 1);\\n\\n if (maximiseWin && nextOutcome.score >= optimalScore) {\\n if (nextOutcome.score == optimalScore && nextOutcome.depth < optimalDepth) continue;\\n optimalScore = nextOutcome.score;\\n optimalCoor = posNextBoard.coor;\\n optimalDepth = nextOutcome.depth;\\n\\n } else if (!maximiseWin && nextOutcome.score <= optimalScore){\\n if (nextOutcome.score == optimalScore && nextOutcome.depth < optimalDepth) continue;\\n optimalScore = nextOutcome.score;\\n optimalCoor = posNextBoard.coor;\\n optimalDepth = nextOutcome.depth;\\n\\n }\\n }\\n\\n outcome.moveToMake = optimalCoor;\\n outcome.score = optimalScore;\\n outcome.depth = optimalDepth;\\n return outcome;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"99c38294190ae776d4cce37873cf69a8\",\n \"score\": \"0.63125294\",\n \"text\": \"protected Move alphaBetaSearch() {\\n\\n\\t\\tdouble value = maxValue(this.parent, Double.NEGATIVE_INFINITY,\\n\\t\\t\\t\\tDouble.POSITIVE_INFINITY);\\n\\t\\tSystem.out.println(\\\"value-alpha-beta = \\\" + value);\\n\\t\\t\\n\\t\\tdouble maxVal = Double.NEGATIVE_INFINITY;\\n\\t\\tMove idealMove = new Move();\\n\\t\\tfor (Node tempNode : this.parent.children) {\\n\\t\\t\\tSystem.out.println(\\\"tempNode.getEvalValue() = \\\" \\n\\t\\t+ tempNode.getEvalValue());\\n\\n\\t\\t\\tif (tempNode.getEvalValue() >= maxVal) {\\n\\t\\t\\t\\t\\tidealMove = tempNode.getMove();\\n\\t\\t\\t\\t\\tmaxVal = tempNode.getEvalValue();\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(this.forcedMove != null)\\n\\t\\t\\treturn this.forcedMove;\\n\\t\\treturn idealMove;\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9f12fa23cf0bdb0a7f7499b8f69d6d30\",\n \"score\": \"0.6296895\",\n \"text\": \"@Override\\n public A makeDecision(S state) {\\n metrics = new Metrics();\\n StringBuffer logText = null;\\n P player = game.getPlayer(state);\\n List<A> results = orderActions(state, game.getActions(state), player, 0);\\n timer.start();\\n currDepthLimit = 0;\\n do {\\n incrementDepthLimit();\\n if (logEnabled)\\n logText = new StringBuffer(\\\"depth \\\" + currDepthLimit + \\\": \\\");\\n heuristicEvaluationUsed = false;\\n ActionStore<A> newResults = new ActionStore<>();\\n for (A action : results) {\\n double value = minValue(game.getResult(state, action), player, Double.NEGATIVE_INFINITY,\\n Double.POSITIVE_INFINITY, 1);\\n if (timer.timeOutOccurred())\\n break; // exit from action loop\\n newResults.add(action, value);\\n if (logEnabled)\\n logText.append(action).append(\\\"->\\\").append(value).append(\\\" \\\");\\n }\\n if (logEnabled)\\n System.out.println(logText);\\n if (newResults.size() > 0) {\\n results = newResults.actions;\\n if (!timer.timeOutOccurred()) {\\n if (hasSafeWinner(newResults.utilValues.get(0)))\\n break; // exit from iterative deepening loop\\n else if (newResults.size() > 1\\n && isSignificantlyBetter(newResults.utilValues.get(0), newResults.utilValues.get(1)))\\n break; // exit from iterative deepening loop\\n }\\n }\\n } while (!timer.timeOutOccurred() && heuristicEvaluationUsed);\\n return results.get(0);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ed1795e832019d4f3e6f3e1cd301fc78\",\n \"score\": \"0.628888\",\n \"text\": \"private static int max_value(State curr_state) {\\n\\t\\tcounterMinimax++; \\r\\n\\r\\n\\r\\n\\t\\t//Check if the current state is a terminal state, if it is, return\\r\\n\\t\\t//its terminal value\\r\\n\\t\\tif(curr_state.isTerminal()){\\r\\n\\t\\t\\treturn curr_state.getScore();\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tint max_value = Integer.MIN_VALUE;\\r\\n\\t\\tState[] successors = curr_state.getSuccessors('1');\\r\\n\\r\\n\\t\\tif(successors.length == 0 && curr_state.isTerminal() == false){\\r\\n\\t\\t\\tmax_value = Math.max(max_value, min_value(curr_state));\\r\\n\\t\\t}\\r\\n\\t\\t//\\t\\telse if(successors.length != 0 && curr_state.isTerminal() == false){\\r\\n\\r\\n\\t\\t//Get the successors of the current state, as dark always runs first\\r\\n\\t\\t//it will call maxValue;\\r\\n\\r\\n\\r\\n\\t\\t//Select the successor that returns the biggest value\\r\\n\\t\\tfor(State state : successors){\\r\\n\\t\\t\\tmax_value = Math.max(max_value, min_value(state));\\r\\n\\t\\t}\\t\\r\\n\\t\\t//\\t\\t}\\r\\n\\t\\treturn max_value;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6a8fa8819efb2654e9be7564b986fced\",\n \"score\": \"0.6265943\",\n \"text\": \"private int alphaBetaMinimax (GameTreeNode node, int alpha, int beta, boolean isMax, Map<GameTreeNode, Integer> visited) {\\n\\n if(node.remaining == 0) {\\n //System.out.println(\\\"Terminal State: Up : Score \\\" + node.score);\\n return node.score;\\n }\\n if(visited.containsKey(node)) {\\n //System.out.println(\\\"Memoized State: Up : Score \\\" + visited.get(node));\\n return visited.get(node);\\n }\\n \\n \\n if(isMax) {\\n int minimaxScore = Integer.MIN_VALUE;\\n for(int i = 0; i < MAX_REMOVAL; i++) {\\n \\n GameTreeNode expandingChild = node.generateChild(1 + i);\\n \\n if(expandingChild == null) {\\n break;\\n }\\n \\n //System.out.println(\\\"Remaining \\\" + node.remaining + \\\" Down\\\");\\n //\\n minimaxScore = Math.max(minimaxScore, alphaBetaMinimax(expandingChild, alpha, beta, false, visited));\\n alpha = Math.max(alpha, minimaxScore);\\n //\\n //System.out.println(\\\"Remaining \\\" + node.remaining + \\\" Up : Score: \\\" + minimaxScore);\\n //\\n if(beta <= alpha) {\\n //System.out.println(\\\"Pruning: \\\" + node.remaining + \\\" child index \\\" + i+1);\\n break;\\n }\\n }\\n visited.put(node, minimaxScore);\\n node.score = minimaxScore;\\n return minimaxScore;\\n }\\n else {\\n int minimaxScore = Integer.MAX_VALUE;\\n for(int i = 0; i < MAX_REMOVAL; i++) {\\n \\n GameTreeNode expandingChild = node.generateChild(1 + i);\\n if(expandingChild == null) {\\n break;\\n }\\n //\\n \\n //\\n //System.out.println(\\\"Remaining \\\" + node.remaining + \\\" Down\\\");\\n //\\n minimaxScore = Math.min(minimaxScore, alphaBetaMinimax(expandingChild, alpha, beta, true, visited));\\n beta = Math.min(beta, minimaxScore);\\n //\\n //System.out.println(\\\"Remaining \\\" + node.remaining + \\\" Up : Score: \\\" + minimaxScore);\\n //\\n if(beta <= alpha) {\\n //System.out.println(\\\"Pruning: \\\" + node.remaining + \\\" child index \\\" + i+1);\\n break;\\n }\\n }\\n visited.put(node, minimaxScore);\\n node.score = minimaxScore;\\n return minimaxScore;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"513cda835cfcd4bad0bd64f250189f70\",\n \"score\": \"0.60198337\",\n \"text\": \"private double evaluate() {\\n // check for draws first, most lickely\\n if (board.gameState() == MNKGameState.DRAW) return 0;\\n else if (board.gameState() == MY_WIN) return 2 * M * N; // 2 times max depth\\n else if (board.gameState() == ENEMY_WIN) return -2 * M * N;\\n else {\\n evaluated++;\\n // keep the heuristic evaluation between 1 and -1\\n return board.value();\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3487aa1477850f735b791d8614fea70c\",\n \"score\": \"0.60172397\",\n \"text\": \"public MoveWrapper minimax(GameBoardState gameState, int depth, MoveWrapper alpha, MoveWrapper beta,\\n\\t\\t\\tboolean maximizingPlayer) {\\n\\n\\t\\tMoveWrapper maxEval = new MoveWrapper(gameState.getLeadingMove(), Integer.MIN_VALUE); // -infinity\\n\\n\\t\\tif (gameState.isTerminal() || AgentController.getAvailableMoves(gameState, playerTurn).isEmpty() || depth == 0) {\\n\\t\\t\\tnodesExamined++;\\n\\t\\t\\tmaxEval.setMoveReward((int) AgentController.getGameEvaluation(gameState, playerTurn));\\n//\\t\\t\\tSystem.out.println(\\\"in terminal statement \\\" + maxEval.getMoveReward());\\n\\t\\t\\treturn maxEval;\\n\\t\\t}\\n\\n\\t\\tif (maximizingPlayer) {\\n\\n\\t\\t\\tfor (ObjectiveWrapper move : AgentController.getAvailableMoves(gameState, playerTurn)) {\\n\\t\\t\\t\\tMoveWrapper eval = minimax(AgentController.getNewState(gameState, move), depth - 1, alpha, beta, false);\\n\\n\\t\\t\\t\\tif (eval.getMoveReward() > maxEval.getMoveReward()) { \\n\\t\\t\\t\\t\\tmaxEval.setObjectiveInformation(move);\\n\\t\\t\\t\\t\\tmaxEval.setMoveReward(eval.getMoveReward());\\n//\\t\\t\\t\\t\\tSystem.out.println(\\\"Player: \\\" + playerTurn + \\\"Maximizing - Depth: \\\" + depth + \\\", eval value: \\\" + eval.getMoveReward() + \\\", maxEval value: \\\" + maxEval.getMoveReward());\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t// alpha beta pruning\\n\\t\\t\\t\\t if (eval != null && alpha.compareTo(eval) < 0) {\\n\\t\\t\\t\\t alpha = eval;\\n\\t\\t\\t\\t }\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t if (beta.compareTo(alpha) <= 0) {\\n\\t\\t\\t\\t prunedCounter++;\\n\\t\\t\\t\\t break;\\n\\t\\t\\t\\t }\\n\\t\\t\\t}\\n\\t\\t\\treturn maxEval;\\n\\n\\t\\t} else {\\n\\t\\t\\tMoveWrapper minEval = new MoveWrapper(gameState.getLeadingMove(), Integer.MAX_VALUE); // +infinity\\n\\n\\t\\t\\tfor (ObjectiveWrapper move : AgentController.getAvailableMoves(gameState, GameTreeUtility.getCounterPlayer(playerTurn))) {\\n\\t\\t\\t\\tMoveWrapper eval = minimax(AgentController.getNewState(gameState, move), depth - 1, alpha, beta, true);\\n\\n\\t\\t\\t\\tif (eval.getMoveReward() < minEval.getMoveReward()) { \\n\\t\\t\\t\\t\\tminEval.setObjectiveInformation(move);\\n\\t\\t\\t\\t\\tminEval.setMoveReward(eval.getMoveReward());\\n//\\t\\t\\t\\t\\tSystem.out.println(\\\"Player: \\\" + playerTurn + \\\"Minimizing - Depth: \\\" + depth + \\\", eval value: \\\" + eval.getMoveReward() + \\\", minEval value: \\\" + minEval.getMoveReward());\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t// alpha beta pruning\\n\\t\\t\\t\\t if (eval != null && beta.compareTo(eval) > 0) {\\n\\t\\t\\t\\t beta = eval;\\n\\t\\t\\t\\t }\\n\\t\\t\\t\\t if (beta.compareTo(alpha) <= 0) {\\n\\t\\t\\t\\t prunedCounter++;\\n\\t\\t\\t\\t break;\\n\\t\\t\\t\\t }\\n\\t\\t\\t}\\n\\t\\t\\treturn minEval;\\n\\t\\t}\\n\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c8af00f5fc52e3c20e65fff4d2a945df\",\n \"score\": \"0.60169095\",\n \"text\": \"private int getBestMove(int[] board, int depth, boolean turn) {\\n int boardCopy[];\\n if (depth <= 0) {\\n return 0;\\n }\\n if (depth > STEP_BACK_DEPTH) {\\n try {\\n Thread.sleep(3);\\n } catch (InterruptedException e) {\\n e.printStackTrace();\\n if (shouldStop()) {\\n Log.d(Constants.MY_TAG,\\\"out CalculatingBot\\\");\\n unlock();\\n return 0;\\n }\\n }\\n }\\n if (turn) {\\n int minimum = MAXIMUM_POSSIPLE_SCORE_DIFFERENCE;\\n for (int i = 0; i < 5; i++) {\\n if (board[i] < 2) {\\n continue;\\n }\\n boardCopy = board.clone();\\n int x = playMove(boardCopy, i);\\n int y = 0;\\n if (!hasPlayer2Move(boardCopy)) {\\n if (hasPlayer1Move(boardCopy)) {\\n y = getBestMove(boardCopy, depth - 1, turn);\\n } else {\\n for (int j = 0; j < 5; j++) {\\n y = y - boardCopy[j];\\n }\\n for (int j = 5; j < 10; j++) {\\n y = y + boardCopy[j];\\n }\\n }\\n } else {\\n y = getBestMove(boardCopy, depth - 1, ! turn);\\n }\\n int z = y - x;\\n if (z < minimum) {\\n minimum = z;\\n }\\n }\\n int i = 10;\\n if (board[2] < 2) {\\n return minimum;\\n }\\n boardCopy = board.clone();\\n int x = playMove(boardCopy, i);\\n int y = 0;\\n if (!hasPlayer2Move(boardCopy)) {\\n if (hasPlayer1Move(boardCopy)) {\\n y = getBestMove(boardCopy, depth - 1, turn);\\n } else {\\n for (int j = 0; j < 5; j++) {\\n y = y - boardCopy[j];\\n }\\n for (int j = 5; j < 10; j++) {\\n y = y + boardCopy[j];\\n }\\n }\\n } else {\\n y = getBestMove(boardCopy, depth - 1, !turn);\\n }\\n int z = y - x;\\n if (z < minimum) {\\n minimum = z;\\n }\\n return minimum;\\n } else {\\n int maximum = MINIMUM_POSSIPLE_SCORE_DIFFERENCE;\\n for (int i = 5; i < 10; i++) {\\n if (board[i] < 2) {\\n continue;\\n }\\n boardCopy = board.clone();\\n int x = playMove(boardCopy, i);\\n int y = 0;\\n if (!hasPlayer1Move(boardCopy)) {\\n if (hasPlayer2Move(boardCopy)) {\\n y = getBestMove(boardCopy, depth - 1, turn);\\n } else {\\n for (int j = 0; j < 5; j++) {\\n y = y - boardCopy[j];\\n }\\n for (int j = 5; j < 10; j++) {\\n y = y + boardCopy[j];\\n }\\n }\\n } else {\\n y = getBestMove(boardCopy, depth - 1, !turn);\\n }\\n int z = y + x;\\n if (z > maximum) {\\n maximum = z;\\n }\\n }\\n int i = 11;\\n if (board[7] < 2) {\\n return maximum;\\n }\\n boardCopy = board.clone();\\n int x = playMove(boardCopy, i);\\n int y = 0;\\n if (!hasPlayer1Move(boardCopy)) {\\n if (hasPlayer2Move(boardCopy)) {\\n y = getBestMove(boardCopy, depth - 1, turn);\\n } else {\\n for (int j = 0; j < 5; j++) {\\n y = y - boardCopy[j];\\n }\\n for (int j = 5; j < 10; j++) {\\n y = y + boardCopy[j];\\n }\\n }\\n } else {\\n y = getBestMove(boardCopy, depth - 1, !turn);\\n }\\n int z = y + x;\\n if (z > maximum) {\\n maximum = z;\\n }\\n return maximum;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d6b5fa5c8fd9920a64953a6b7959a5cd\",\n \"score\": \"0.6011439\",\n \"text\": \"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 \"title\": \"\"\n },\n {\n \"docid\": \"cda6deb4c664da0c378d56b3206c5236\",\n \"score\": \"0.5940419\",\n \"text\": \"private void gameTree(MinimaxNode<GameState> currentNode, int depth, int oIndex){\\n currentNode.setNodeIndex(oIndex); \\n if (depth == 0) {\\n return;\\n }\\n else{\\n if (currentNode.getState().isDead(oIndex)){ //checks to see if current player is dead, if so, just skips their moves\\n int newIndex = (oIndex + 1) % currentNode.getState().getNrPlayers();\\n/* if(oIndex == 3){\\n newIndex = 0;\\n }\\n else{\\n newIndex = oIndex + 1;\\n }*/\\n gameTree(currentNode, depth-1, newIndex);\\n }\\n else{\\n //this if statement sets up chance nodes, if the target has been met it will create 5 children nodes with randomly generated new target postitions \\n if(!currentNode.getState().hasTarget()){\\n currentNode.setChanceNode();\\n for(int i = 1; i <= 5; i++){\\n try{\\n GameState newState = (GameState)currentNode.getState().clone();\\n newState.chooseNextTarget();\\n MinimaxNode<GameState> childNode = new MinimaxNode(newState);\\n childNode.setProbability(0.2);\\n currentNode.addChild(childNode); \\n }\\n catch (CloneNotSupportedException e){\\n System.out.println(\\\"Clone not excepted\\\");\\n }\\n \\n }\\n for (int i = 0; i < currentNode.getNumberOfChildren(); i++){\\n gameTree(currentNode.getChildren().get(i), depth, oIndex);\\n }\\n\\n }\\n else{\\n List<Integer> options = new ArrayList();\\n for (int i = 1; i <= 4; i++) {\\n if (currentNode.getState().isLegalMove(oIndex, i)){\\n options.add(i);\\n }\\n }\\n for (int i = 0; i < options.size(); i++){\\n try{\\n GameState newState = (GameState)currentNode.getState().clone();\\n newState.setOrientation(oIndex, options.get(i));\\n newState.updatePlayerPosition(oIndex);\\n MinimaxNode<GameState> childNode = new MinimaxNode(newState);\\n currentNode.addChild(childNode);\\n }\\n catch (CloneNotSupportedException e){\\n System.out.println(\\\"Clone not excepted\\\");\\n }\\n }\\n int newIndex = (oIndex + 1) % currentNode.getState().getNrPlayers();\\n /* if(oIndex == 3){\\n newIndex = 0;\\n }\\n else{\\n newIndex = oIndex + 1;\\n }*/\\n for (int i = 0; i < currentNode.getNumberOfChildren(); i++){\\n gameTree(currentNode.getChildren().get(i), depth-1, newIndex);\\n }\\n } \\n } \\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"91fc496745e42f4ba470dfe78adc83c8\",\n \"score\": \"0.5914755\",\n \"text\": \"public double calculateVal(DraughtsState s, int depth) {\\n int[] pieces = s.getPieces(); \\n \\n \\n // This is where the actual heuristic is calculated. because the situation is slightly different for the white and black\\n // player their heuristic is calculated seperately.\\n double h = 0;\\n int enemypieces = 0;\\n for (int i = 1; i < pieces.length; i++) {\\n int piece = pieces[i];\\n \\n // If we are white, substract 1, giving the white piece of the same category.\\n if (piece == BLACKPIECE + ((isWhite) ? -1 : 0) || piece == BLACKKING + ((isWhite) ? -1 : 0)) {\\n enemypieces++;\\n }\\n \\n //for the kings it is not checked whether they are on the sides of the board or not since they have more movement freedom\\n //and their is no real benifit for them to be at the sides.\\n h += SQ_LEFT(i) * SQ_RIGHT(i) * ((piece == WHITEPIECE) ? 1.5 : 0) - SQ_LEFT(i) * SQ_RIGHT(i) * ((piece == BLACKPIECE) ? 1 : 0) + \\n ((piece == WHITEKING) ? 4 : 0) - ((piece == BLACKKING) ? 5 : 0) + 0.3 * is_square(i, pieces);\\n \\n }\\n \\n // Victory rush\\n if(enemypieces < 4) {\\n h += 1;\\n }\\n\\n \\n if (isWhite) {\\n return h;\\n } else\\n \\n return -h;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fa1aaa9a5742800b0800fba1bd180698\",\n \"score\": \"0.5909432\",\n \"text\": \"@Override\\r\\n\\t\\tpublic Action BestMove(AI_Domain game) {\\r\\n\\t\\t\\t return new Action(minimax(game,true,depth,true,null).getPath());\\r\\n\\t\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"83d45a72e288c96f382664c60fc634d1\",\n \"score\": \"0.5908354\",\n \"text\": \"public HusMove MinimaxAB(HusBoardState board_state, int depth, double alpha, double beta){\\n \\n \\n ArrayList<HusMove> moves = board_state.getLegalMoves();\\n double maxScore = 0;\\n HusMove maxMove = moves.get(0);\\n \\n for(int i = 0; i< moves.size(); i++){\\n \\n HusBoardState cloned_board_state = (HusBoardState) board_state.clone();\\n cloned_board_state.move(moves.get(i));\\n \\n double score = MinValue(cloned_board_state, depth-1, alpha, beta);\\n \\n if (score > maxScore){\\n maxScore = score;\\n maxMove = moves.get(i);\\n }\\n }\\n //System.out.println(\\\"The best move: \\\"+maxMove.getPit());\\n\\n return maxMove;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9525f1c1bdc025031fdffc7e39b66d2d\",\n \"score\": \"0.59045696\",\n \"text\": \"public int recurseReward(int initialState) {\\n\\t\\tint maxValue = -100000;\\n\\t\\t\\n\\t\\tfor(int action = 0; action < this.columns; action++) {\\n\\t\\t\\tif(!isActionLegal(initialState, action)){\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}else {\\n\\t\\t\\t\\tint potNewState = getStateActionMap(initialState, action);\\n\\t//\\t\\t\\tint pNewColumns = potNewState % (int)Math.sqrt(this.rows);\\n\\t//\\t\\t\\tint pNewRows = (potNewState - pNewColumns)/(int)Math.sqrt(this.rows);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(this.qGrid[initialState][action] > maxValue) {\\n\\t\\t\\t\\t\\tmaxValue = this.qGrid[initialState][action];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tSystem.out.println(\\\"De max value is: \\\" + maxValue);\\n\\t\\treturn maxValue;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f0b09ad8db02fda833da8400fd7ac3b5\",\n \"score\": \"0.5903188\",\n \"text\": \"int getMax_depth();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e94f013902eaa0c4d0ba59f34fdcd9ab\",\n \"score\": \"0.58976096\",\n \"text\": \"private int calculateNextMove(@TTTConstants.Sign int sign, int depth) {\\n\\n if (isWin(computerSign, false)) {\\n return 10 - depth;\\n } else if (isWin(playerSign, false)) {\\n return depth - 10;\\n }\\n\\n if (depth >= 9) {\\n return 0;\\n }\\n\\n List<Integer> scores = new ArrayList<>(), rowIndices = new ArrayList<>(), columnIndices = new ArrayList<>();\\n\\n for (int i = 0; i < 3; i++) {\\n for (int j = 0; j < 3; j++) {\\n if (board[i][j] == TTTConstants.EMPTY) {\\n board[i][j] = sign;\\n scores.add(calculateNextMove(getOppositeSign(sign), depth + 1));\\n rowIndices.add(i);\\n columnIndices.add(j);\\n board[i][j] = TTTConstants.EMPTY;\\n }\\n }\\n }\\n\\n if (sign == computerSign) {\\n int maxScore = -100;\\n for (int i = 0; i < scores.size(); i++) {\\n if (scores.get(i) > maxScore) {\\n maxScore = scores.get(i);\\n }\\n }\\n return randomizeScore(maxScore, scores, rowIndices, columnIndices);\\n\\n } else {\\n int minScore = 100;\\n for (int i = 0; i < scores.size(); i++) {\\n if (scores.get(i) < minScore) {\\n minScore = scores.get(i);\\n }\\n }\\n return randomizeScore(minScore, scores, rowIndices, columnIndices);\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4316074be4744cd42fc4bbc06cb390e3\",\n \"score\": \"0.58826023\",\n \"text\": \"private Pair<Double, Move> minimax(OthelloBoard board, OthelloSide side, int depth, int max_depth, \\n\\t\\t\\t\\t\\t\\t\\t\\tMove m, double alpha, double beta) {\\n\\t\\tdouble bestScore;\\n\\t\\tint turncount = turn;\\n\\t\\tMove bestMove;\\n\\t\\t//System.out.println(\\\"Start of minimax. Depth: \\\" + depth + \\\" Side: \\\" + side);\\n\\t /* int state = board.getState();\\n\\t\\tif (state == OthelloBoard.DRAW)\\n\\t return new Pair<Double, Move>(0, m);\\n\\t if ((state == OthelloBoard.BLACK_WINS) && (side == OthelloSide.BLACK)) \\n\\t return new Pair<Double, Move>(Double.POSITIVE_INFINITY, m); \\n\\t if ((state == OthelloBoard.WHITE_WINS) && (side == OthelloSide.WHITE))\\n\\t return new Pair<Double, Move>(Double.POSITIVE_INFINITY, m);\\n\\t if ((state == OthelloBoard.BLACK_WINS) && (side == OthelloSide.WHITE))\\n\\t return new Pair<Double, Move>(Double.NEGATIVE_INFINITY, m);\\n\\t if ((state == OthelloBoard.WHITE_WINS) && (side == OthelloSide.BLACK))\\n\\t return new Pair<Double, Move>(Double.NEGATIVE_INFINITY, m);*/\\n\\t\\tif(board.isDone()) {\\n\\t\\t\\tdouble endgame = board.countBlack() - board.countWhite();\\n\\t\\t\\treturn new Pair<Double, Move>(endgame, m);\\n\\t\\t}\\n\\t\\tif(depth == max_depth) {\\n\\t\\t\\tdouble mdScore = evaluator(board, side);\\n\\t\\t\\treturn new Pair<Double, Move>(mdScore, m);\\t\\t\\t\\n\\t\\t} else {\\n\\t\\t\\tLinkedList<Move> moveList = getMoveList(board, side);\\n\\t\\t\\tif(depth == 0) {\\n\\t \\t\\t\\tLinkedList<Move> corners = new LinkedList<Move>();\\n\\t\\t\\t\\tfor(Move mv : moveList) {\\n\\t\\t\\t\\t\\tif(board.isCorner(mv)) {\\n\\t\\t\\t\\t\\t\\tcorners.add(mv);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(corners.size() != 0) {\\n\\t\\t\\t\\t\\tMove bcorner = null;\\n\\t\\t\\t\\t\\tdouble best = -Double.MAX_VALUE;\\n\\t\\t\\t\\t\\tfor(Move ml : corners) {\\n\\t\\t\\t\\t\\t\\tdouble temp = evalMove(board, side, ml);\\n\\t\\t\\t\\t\\t\\tif(temp > best) {\\n\\t\\t\\t\\t\\t\\t\\tbest = temp;\\n\\t\\t\\t\\t\\t\\t\\tbcorner = ml;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\treturn new Pair<Double, Move>(best, bcorner);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t//System.out.println(moveList.toString());\\n\\t\\t\\tbestScore = -Double.MAX_VALUE;\\n\\t\\t\\tbestMove = new Move(1,1);\\n\\t\\t\\tif(moveList.size() == 0) {\\n\\t\\t\\t\\tdouble mdScore = evaluator(board, side);\\n\\t\\t\\t\\treturn new Pair<Double, Move>(mdScore, m);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tfor(int i = 0; i < moveList.size(); i++) {\\n\\t\\t\\t\\t\\tOthelloBoard tempBoard = board.copy();\\n\\t\\t\\t\\t\\tMove move = moveList.get(i);\\n\\t\\t\\t\\t\\ttempBoard.move(move, side);\\n\\t\\t\\t\\t\\talpha = -(minimax(tempBoard, side.opposite(), depth + 1, max_depth, move, -beta, -alpha)).score;\\n\\t\\t\\t\\t\\t//System.out.println(\\\"Side: \\\" + side);\\n\\t\\t\\t\\t\\t//System.out.println(\\\"alpha (before IF): \\\" + alpha);\\n\\t\\t\\t\\t\\t//System.out.println(\\\"bestScore (before IF): \\\" + bestScore);\\n\\t\\t\\t\\t\\tif(beta <= alpha) {\\n\\t\\t\\t\\t\\t\\treturn new Pair<Double, Move>(alpha, move);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif(alpha > bestScore ) {\\n\\t\\t\\t\\t\\t\\tbestScore = alpha;\\n\\t\\t\\t\\t\\t\\tbestMove = move;\\n\\t\\t\\t\\t\\t\\t//bestMove.copy(move);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"theScore(IF): \\\" + alpha);\\n\\t\\t\\t\\t\\t\\t//System.out.println(\\\"bestScore(IF): \\\" + bestScore);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn new Pair<Double, Move>(bestScore, bestMove);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6c9c05ffe6d5d008df9e0e31670714f3\",\n \"score\": \"0.5875684\",\n \"text\": \"private double maxValue(Board state, int depth, double alpha, double beta) {\\n if(terminalTest(state, depth))\\n return utility(state);\\n\\n double value = Double.NEGATIVE_INFINITY;\\n for(Move action: actions(state)){\\n Board nextState = new Board(state);\\n\\n value = Math.max(value,\\n minValue(result(nextState, action),\\n depth-1, alpha, beta));\\n\\n if(value >= beta)\\n return value;\\n\\n alpha = Math.max(alpha, value);\\n }\\n\\n return value;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"fecf60ed54e1a36746862fd393f6fa02\",\n \"score\": \"0.58360726\",\n \"text\": \"private int maxValue(Node state, int alpha, int beta) {\\n\\t\\t\\n\\t\\t\\n\\t\\tthis.nodesExplored++;\\n\\t\\tthis.nodesExploredThisTurn++;\\n\\t\\t\\n\\t\\tif (this.cutoffTest(state)) {\\n\\t\\t\\treturn state.eval(this.player);\\n\\t\\t}\\n\\t\\t\\n\\t\\tArrayList<Move> legalMoves = state.getGame().getLegalMoves();\\n\\t\\n\\t\\tif (this.moveOrdering) {\\n\\t\\t\\tthis.quickSort(state, legalMoves, 0, legalMoves.size() - 1, false);\\n\\t\\t}\\n\\t\\t\\n\\t\\tint v = Integer.MIN_VALUE;\\n\\t\\tMove bestMove = null;\\n\\t\\tfor (Move move : legalMoves) {\\n\\t\\t\\t\\n\\t\\t\\tif (System.currentTimeMillis() - startMili > this.maxTime * 1000) {\\n\\t\\t\\t\\treturn 0;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tint value = this.minValue(state.result(move), alpha, beta);\\n\\t\\t\\tif (v < value) { //\\n\\t\\t\\t\\tv = value;\\n\\t\\t\\t\\tbestMove = move;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tif (v >= beta) {\\n\\t\\t\\t\\tstate.setBestMove(bestMove);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\treturn v;\\n\\t\\t\\t}\\n\\t\\t\\talpha = Math.max(v, alpha);\\n\\t\\t}\\n\\t\\tstate.setBestMove(bestMove);\\n\\t\\treturn v;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"18ecb1909b89a66604edbb2cbfbdd31a\",\n \"score\": \"0.5834713\",\n \"text\": \"public MoveNode getBestMove() {\\n if (rootValues.isEmpty()) {\\n return null;\\n }\\n\\n MoveNode moveNode = rootValues.get(0);\\n int maxScore = moveNode.getMinimaxValue();\\n\\n for(MoveNode m : rootValues) {\\n if(m.getMinimaxValue() > maxScore) {\\n moveNode = m;\\n maxScore = m.getMinimaxValue();\\n }\\n }\\n\\n return moveNode;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"21944de9f03825dd6628a0d8845b6f96\",\n \"score\": \"0.5804737\",\n \"text\": \"private Move getBestMove() {\\r\\n\\t\\tSystem.out.println(\\\"getting best move\\\");\\r\\n\\t\\tChessConsole.printCurrentGameState(this.chessGame);\\r\\n\\t\\tSystem.out.println(\\\"thinking...\\\");\\r\\n\\t\\t\\r\\n\\t\\tList<Move> validMoves = generateMoves(false);\\r\\n\\t\\tint bestResult = Integer.MIN_VALUE;\\r\\n\\t\\tMove bestMove = null;\\r\\n\\t\\t\\r\\n\\t\\tfor (Move move : validMoves) {\\r\\n\\t\\t\\texecuteMove(move);\\r\\n\\t\\t\\t//System.out.println(\\\"evaluate move: \\\"+move+\\\" =========================================\\\");\\r\\n\\t\\t\\tint evaluationResult = -1 * negaMax(this.maxDepth,\\\"\\\");\\r\\n\\t\\t\\t//System.out.println(\\\"result: \\\"+evaluationResult);\\r\\n\\t\\t\\tundoMove(move);\\r\\n\\t\\t\\tif( evaluationResult > bestResult){\\r\\n\\t\\t\\t\\tbestResult = evaluationResult;\\r\\n\\t\\t\\t\\tbestMove = move;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\tSystem.out.println(\\\"done thinking! best move is: \\\"+bestMove);\\r\\n\\t\\treturn bestMove;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"74d9e084a5fc617ecd90bbaa9abfc289\",\n \"score\": \"0.57926786\",\n \"text\": \"private static double minMaxPruning(GameState state, int depth, double alpha, double beta){\\n\\n double v = 0;\\n\\n // A vector containing all possible children states if this current state\\n Vector<GameState> nextStates = new Vector<GameState>();\\n state.findPossibleMoves(nextStates);\\n\\n /**\\n // Try testing win/loss before going into depth search\\n Move m = state.getMove();\\n\\n if(m.isXWin()){\\n return 1000+depth;\\n }\\n\\n else if(m.isOWin()){\\n return -1;\\n }\\n */\\n if (depth==0 || nextStates.size()==0){\\n v = evalState(state);\\n }\\n\\n // 2 is 'O' so if nextPlayer is 2 it means that the current player is 'X'\\n else if (state.getNextPlayer() == 1){\\n v=Double.NEGATIVE_INFINITY;\\n\\n for(GameState s: nextStates){\\n v = Math.max(v, minMaxPruning(s,depth-1, alpha, beta));\\n alpha = Math.max(alpha, v);\\n if(beta <= alpha) {\\n return v;\\n }\\n }\\n }\\n // 1 is 'X' so if nextplayer is 1 it means that the current player is 'O'\\n else if (state.getNextPlayer() == 2){\\n v=Double.POSITIVE_INFINITY;\\n\\n for(GameState s: nextStates){\\n v= Math.min(v,minMaxPruning(s,depth-1, alpha, beta));\\n beta = Math.min(beta, v);\\n if( beta <= alpha ) {\\n return v;\\n }\\n }\\n }\\n return v;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b489bfe82b98d81f8f07985aa29ca289\",\n \"score\": \"0.57754046\",\n \"text\": \"public double maxValue(S state, P player, double alpha, double beta, int depth) {\\n updateMetrics(depth);\\n if (game.isTerminal(state) || depth >= currDepthLimit || timer.timeOutOccurred()) {\\n return eval(state, player);\\n } else {\\n double value = Double.NEGATIVE_INFINITY;\\n for (A action : orderActions(state, game.getActions(state), player, depth)) {\\n value = Math.max(value, minValue(game.getResult(state, action), //\\n player, alpha, beta, depth + 1));\\n if (value >= beta)\\n return value;\\n alpha = Math.max(alpha, value);\\n }\\n return value;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e01e7c98c595d423e4759d1d9e656d48\",\n \"score\": \"0.5774815\",\n \"text\": \"@Override\\n\\tpublic Move getMove(Board game) {\\n\\t\\t\\n\\t\\tthis.maximumDepthReachedThisTurn = 0;\\n\\t\\tArrayList<Move> moveList = game.getLegalMoves();\\n\\t\\t/* tell the player what her options are */\\n\\t\\tSystem.out.println(\\\"Turn \\\" + game.getTurn() + \\\", legal moves (\\\" + moveList.size() + \\\"): \\\");\\n\\t\\tfor(Move m : moveList) {\\n\\t\\t\\tSystem.out.println(m.toString());\\n\\t\\t}\\n\\t\\t\\n\\t\\tthis.nodesExploredThisTurn = 0;\\n\\t\\tthis.isEndGameStatusFound = false;\\n\\t\\tthis.maxDepth = 1;\\n\\t\\tthis.bestMoveSoFar = null;\\n\\t\\tthis.startMili = System.currentTimeMillis();\\n\\t\\n\\t\\twhile (System.currentTimeMillis() - startMili < this.maxTime * 1000) {\\n\\t\\t\\tNode state = new Node(game, null, 0);\\n\\t\\t\\tthis.bestMoveSoFar = this.alphaBetaSearch(state);\\n\\t\\t\\t\\n\\t\\t\\tif (this.isEndGameStatusFound)\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\n\\t\\t\\tthis.maxDepth++;\\n\\t\\t}\\n\\n\\t\\tlong endMili=System.currentTimeMillis();\\n\\t\\tdouble duration = ((double)(endMili - startMili)) / 1000.0;\\n\\t\\t\\n\\t\\tthis.maximumDepthReached += this.maximumDepthReachedThisTurn;\\n\\t\\tSystem.out.println(\\\"Maximum depth reached at this turn: \\\" + this.maximumDepthReachedThisTurn);\\n\\t\\tSystem.out.println(\\\"Maximum depth reached from game start state: \\\" + this.maximumDepthReached);\\n\\t\\tSystem.out.println(\\\"Nodes explored at this turn: \\\" + this.nodesExploredThisTurn);\\n\\t\\tSystem.out.println(\\\"Total nodes explored: \\\" + this.nodesExplored);\\n\\t\\tSystem.out.println(\\\"Time to decide on a move: \\\" + duration);\\n\\n\\t\\treturn this.bestMoveSoFar;\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"29572f159b3986dd10f82539fcca39d5\",\n \"score\": \"0.57408774\",\n \"text\": \"public Move chooseMove(TablutBoardState boardState) {\\n \\n \\tList<TablutMove> options = boardState.getAllLegalMoves();\\n\\n \\n bestMove = options.get(((int) MyTools.getSomething())% (options.size()));\\n\\n int depth = DEPTH;\\n int opponent = boardState.getOpponent();\\n boolean isMax;\\n if(opponent==1){\\n \\tisMax = true;\\n \\t//System.out.println(\\\"I'm max\\\");\\n }\\n else{\\n \\tisMax = false;\\n \\t//System.out.println(\\\"I'm min\\\");\\n }\\n //bestMove = \\n \\n int bestvalue = minimax(boardState,isMax, depth,-10000,10000);\\n \\n \\n //int minNumberOfOpponentPieces = boardState.getNumberPlayerPieces(opponent);\\n //boolean moveCaptures = false;\\n //System.out.println(\\\"minimax return value: \\\"+bestvalue);\\n \\n \\n \\n \\n return bestMove;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e6c416467ac13035c60597b702c572b9\",\n \"score\": \"0.57305664\",\n \"text\": \"private static int min_value(State curr_state) {\\n\\t\\tcounterMinimax++;\\r\\n\\r\\n\\t\\t//Check if the current state is a terminal state, if it is, return\\r\\n\\t\\t//its terminal value\\r\\n\\t\\tif(curr_state.isTerminal()){\\r\\n\\t\\t\\treturn curr_state.getScore();\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tint min_value = Integer.MAX_VALUE;\\r\\n\\t\\t//Get the successors of the current state, as light always runs second\\r\\n\\t\\t//it will call minValue;\\r\\n\\t\\tState[] successors = curr_state.getSuccessors('2');\\r\\n\\r\\n\\t\\tif(successors.length == 0 && curr_state.isTerminal() == false){\\r\\n\\t\\t\\tmin_value = Math.min(min_value, max_value(curr_state));\\r\\n\\t\\t}\\r\\n\\r\\n\\r\\n\\t\\t//Select the successor that returns the smallest(optimal) value\\r\\n\\t\\tfor(State state : successors){\\r\\n\\t\\t\\tmin_value = Math.min(min_value, max_value(state));\\r\\n\\t\\t}\\r\\n\\r\\n\\r\\n\\t\\treturn min_value;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2b8a41ff345c16fb7364e9e7eee9bc0a\",\n \"score\": \"0.5725358\",\n \"text\": \"public int maxValue(BoardState state, int maxDepth, int currentDepth, int alpha, int beta) {\\n\\t\\tif (currentDepth == 0)\\r\\n\\t\\t\\treturn sbe(state);\\r\\n\\r\\n\\t\\t// initializing the smaller possible number to x\\r\\n\\t\\tint v = Integer.MIN_VALUE;\\r\\n\\r\\n\\t\\tfor (int i = 0; i <= 5; i++) {\\r\\n\\r\\n\\t\\t\\t// checking if a move is legal\\r\\n\\t\\t\\tif (state.isLegalMove(1, i)) {\\r\\n\\r\\n\\t\\t\\t\\t// updating our max value to v\\r\\n\\t\\t\\t\\tv = Math.max(v, minValue(state.applyMove(1, i), maxDepth, currentDepth - 1, alpha, beta));\\r\\n\\t\\t\\t\\talpha = Math.max(alpha, v);\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t// Pruning\\r\\n\\t\\t\\t\\tif (beta <= alpha) \\t\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\tif (v == Integer.MIN_VALUE) {\\r\\n\\t\\t\\treturn sbe(state);\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\treturn v;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5adf54be971c006d549c965e6727a692\",\n \"score\": \"0.5700767\",\n \"text\": \"private Move alphaBetaSearch(Node state) {\\n\\t\\t\\n\\t\\tint v = this.maxValue(state, Integer.MIN_VALUE, Integer.MAX_VALUE);\\n\\t\\t\\n\\t\\tthis.nodesExplored--;\\n\\t\\tthis.nodesExploredThisTurn--;\\n\\t\\t\\n\\t\\tif (System.currentTimeMillis() - startMili > this.maxTime * 1000) {\\n\\t\\t\\treturn this.bestMoveSoFar;\\n\\t\\t}\\n\\n\\t\\tif (Math.abs(v) == Integer.MAX_VALUE / 2 || Math.abs(v) == Math.abs(Integer.MIN_VALUE / 2) ) {\\n\\t\\t\\t\\n\\t\\t\\tthis.isEndGameStatusFound = true;\\n\\t\\t\\treturn state.getBestMove();\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn state.getBestMove();\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b6739e57bdd85db9e9570ec88240225f\",\n \"score\": \"0.56996495\",\n \"text\": \"public checkersSetup.Turn getBestMoveBasedOnSearchOfDepthN(CheckersSetup setup, boolean isDarkPlayer, int curdepth) {\\n\\t\\t\\n\\t\\tint numAlternativelyGoodMoves=0;\\n\\t\\t\\n\\t\\tif(curdepth > 0) {\\n\\t\\t\\t\\n\\t\\t\\tArrayList<checkersSetup.Turn> turnChoices = BasicCheckersAIFunctions.getAllPossiblePlayerOptionsFor1Turn(setup, isDarkPlayer);\\n\\t\\t\\t\\n\\t\\t\\tfavTurn = new Turn[turnChoices.size()];\\n\\t\\t\\t\\n\\t\\t\\tfavTurn[0] = turnChoices.get(0);\\n\\t\\t\\t\\n\\t\\t\\tsetup.playTurn(turnChoices.get(0));\\n\\t\\t\\t//note: op = OPPONENT!\\n\\t\\t\\tdouble opWorstPosUtil = getEstUtilityOfPosition(setup, !isDarkPlayer, curdepth-1);\\n\\t\\t\\tsetup.reverseTurn(turnChoices.get(0));\\n\\t\\t\\t\\n\\t\\t\\tdouble opPosUtil;\\n\\t\\t\\n\\t\\t\\tfor(int i=1; i<turnChoices.size(); i++) {\\n\\t\\t\\t\\tsetup.playTurn(turnChoices.get(i));\\n\\t\\t\\t\\t\\n\\t\\t\\t\\topPosUtil = getEstUtilityOfPosition(setup, !isDarkPlayer, curdepth-1);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(opPosUtil < opWorstPosUtil) {\\n\\t\\t\\t\\t\\topWorstPosUtil = opPosUtil;\\n\\t\\t\\t\\t\\tfavTurn[0] = turnChoices.get(i);\\n\\t\\t\\t\\t\\tnumAlternativelyGoodMoves = 0;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t} else if(opPosUtil == opWorstPosUtil) {\\n\\t\\t\\t\\t\\tnumAlternativelyGoodMoves++;\\n\\t\\t\\t\\t\\tfavTurn[numAlternativelyGoodMoves] = turnChoices.get(i);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tsetup.reverseTurn(turnChoices.get(i));\\n\\t\\t\\t}\\n\\t\\t\\tif(opWorstPosUtil <= -BasicCheckersAIFunctions.DARK_WIN_UTILITY) {\\n\\t\\t\\t\\tSystem.out.println(\\\"YOU ARE FUCKED!!\\\");\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t//TODO\\n\\t\\t\\t//opUtilityOfLastMove = -opWorstPosUtil;\\n\\t\\t} else {\\n\\t\\t\\tSystem.out.println(\\\"Error: the depth should be bigger than 0!\\\");\\n\\t\\t\\tSystem.exit(1);\\n\\t\\t\\t//stub to stop java from complaining:\\n\\t\\t\\tfavTurn = new Turn[0];\\n\\t\\t}\\n\\t\\t\\n\\t\\t//if AI is NOT deterministic AND\\n\\t\\t//\\tthere's several choices that seem similarly good, the AI randomly choses a move \\n\\t\\tif(numAlternativelyGoodMoves > 0 && this.deterministic == false) {\\n\\t\\t\\tSystem.out.println(\\\"aitree is randomly choosing beetween \\\" + (numAlternativelyGoodMoves+1) + \\\" ways to do his turn\\\");\\n\\t\\t\\tnumFavMoves = numAlternativelyGoodMoves+1;\\n\\t\\t\\treturn favTurn[(int)(Math.random()*(numAlternativelyGoodMoves+1))];\\n\\t\\t} else {\\n\\t\\t\\tnumFavMoves = 1;\\n\\t\\t\\treturn favTurn[0];\\n\\t\\t}\\n\\t\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f8f221a9117517e1772096bbb99ebd0e\",\n \"score\": \"0.5672249\",\n \"text\": \"private int minmax(Board board, int level, int depth, int alpha, int beta) \\n {\\n if (computerWin(board) || playerWin(board) || draw(board) || depth >= LIMIT)\\n return evaluate(board);\\n \\n else if (level == MAX)\\n {\\n int maxValue = Integer.MIN_VALUE;\\n \\n LinkedList<Board> children = generate(board, COMPUTER);\\n \\n for (int i = 0; i < children.size(); i++)\\n {\\n int currentValue = minmax(children.get(i), MIN, depth + 1, alpha, beta);\\n \\n if (currentValue > maxValue)\\n maxValue = currentValue;\\n if (maxValue >= beta)\\n return maxValue;\\n if (maxValue > alpha)\\n alpha = maxValue;\\n }\\n return maxValue;\\n }\\n else \\n {\\n int minValue = Integer.MAX_VALUE;\\n \\n LinkedList<Board> children = generate(board, PLAYER);\\n \\n for (int i = 0; i < children.size(); i++)\\n {\\n int currentValue = minmax(children.get(i), MAX, depth + 1, alpha, beta);\\n \\n if (currentValue < minValue)\\n minValue = currentValue;\\n if (minValue <= alpha)\\n return minValue;\\n if (minValue < beta)\\n beta = minValue;\\n }\\n return minValue;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"31bcb3d3bc3a12f6f79327bc2e13ffa6\",\n \"score\": \"0.5665297\",\n \"text\": \"public boolean[] eGreedyAction()\\n\\t{\\n\\t\\t// initialize variables\\n\\t\\tRandom generator = new Random();\\n\\t\\t\\n\\t\\t// find best action\\n\\t\\tList<boolean[]> validActions = getValidActions();\\n\\t\\t\\n\\t\\t// initiate values for comparison\\n\\t\\tStateActionPair sap = new StateActionPair(state, validActions.get(0));\\n\\t\\tboolean[] bestAction = sap.action;\\n\\t\\t\\n\\t\\tdouble bestValue= getStateActionValue(sap);\\n\\t\\t\\n\\t\\tfor(int i=1; i<validActions.size(); i++)\\n\\t\\t{\\n\\t\\t\\tsap = new StateActionPair(state, validActions.get(i));\\n\\t\\t\\tdouble qValue = getStateActionValue(sap);\\n\\t\\t\\tif( qValue > bestValue )\\n\\t\\t\\t{\\n\\t\\t\\t\\tbestAction = sap.action;\\n\\t\\t\\t\\tbestValue = qValue;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t// choose random action\\n\\t\\tif( generator.nextDouble() < epsilon )\\t\\n\\t\\t{\\n\\t\\t\\tList<boolean[]> randomActions = new ArrayList<boolean[]>(validActions);\\n\\t\\t\\trandomActions.remove(bestAction);\\t// don't choose the best action\\n\\t\\t\\tboolean[] randomAction = randomActions.get(generator.nextInt(randomActions.size()));\\n\\t\\t\\treturn randomAction;\\n\\t\\t}\\n\\t\\t\\n\\n\\t\\treturn bestAction;\\t// choose best action\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"3230d9719d554d3c32356eefdec153b8\",\n \"score\": \"0.56531256\",\n \"text\": \"private int[] minValue(int[][] currentState, int[] alpha, int[] beta, int depth) {\\n int[] bestMove = new int[]{MinimaxUtilties.freeCentralColumn(currentState), Integer.MAX_VALUE, 0};\\n\\n if (terminalTest(currentState) != 0) {\\n return new int[]{0, utility(currentState), maxDepth - depth};\\n }\\n\\n if (depth < 1){\\n return new int[]{0, utility(currentState), maxDepth};\\n }\\n\\n if (terminalTest(currentState) == 0 && depth > 0) {\\n ArrayList<Integer> possibleActions = actions(currentState, 2);\\n\\n for (int i = 0; i < possibleActions.size(); i++) {\\n int column = possibleActions.get(i);\\n int[][] resultOfAction = result(currentState, column, 2);\\n\\n int[] currentResult = new int[]{column, maxValue(resultOfAction, alpha, beta, depth - 1)[1], maxDepth - depth};\\n\\n if (currentResult[1] < bestMove[1] || (currentResult[1] == bestMove[1] && currentResult[2] < bestMove[2])) {\\n bestMove = currentResult;\\n }\\n\\n if (bestMove[1] < beta[1] || (bestMove[1] == beta[1] && bestMove[2] < beta[2])) beta = bestMove;\\n\\n if (alpha[1] >= beta[1]) return beta;\\n }\\n }\\n\\n return bestMove;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"24537319874458147f9718f170f3a4e7\",\n \"score\": \"0.5630002\",\n \"text\": \"public int[] getMove() {\\n int[] bestMove = new int[] {-1, -1, -1};\\n int bestEval = Integer.MIN_VALUE;\\n for (final BoardTree child : this.children) {\\n if (child.evaluation > bestEval) {\\n bestEval = child.evaluation;\\n bestMove = child.prevMove;\\n }\\n if (VERBOSE) {\\n System.out.println(Arrays.toString(child.prevMove)+\\\":\\\"+child.evaluation);\\n }\\n }\\n delTree(this);\\n\\n if (VERBOSE) {\\n System.out.println(\\\"Chose eval: \\\"+bestEval);\\n }\\n return bestMove;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"78ba93158bde460a9d2a59043a514d24\",\n \"score\": \"0.5625526\",\n \"text\": \"private static int getOptimalValue(int depth, int nodeIndex, boolean isMax,\\n int[] scores, int h) {\\n if (depth == h) \\n return scores[nodeIndex];\\n \\n if (isMax) {\\n return Math.max(getOptimalValue(depth+1, nodeIndex*2, false, scores, h), \\n getOptimalValue(depth+1, nodeIndex * 2 + 1, false, scores, h));\\n } else {\\n return Math.min(getOptimalValue(depth+1, nodeIndex*2, true, scores, h), \\n getOptimalValue(depth+1, nodeIndex * 2 + 1, true, scores, h));\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"baa96577e3a3909ae7101e2924fbf433\",\n \"score\": \"0.56157434\",\n \"text\": \"static double addHeuristic1(GameState c, boolean isMaxNode) {\\n\\t\\t// Value returned will be absolute. If its max node, this config is good\\n\\t\\t// then value will be positive. If its min node,\\n\\t\\t// and this config is good for min, then value will be negative\\n\\n\\t\\tint i, j, vacant_spaces;\\n\\t\\t// Compute : Feasible Moves for self\\n\\t\\tint self_feasible_moves = 0;\\n\\t\\tint self_remaining_moves = 0;\\n\\t\\tint opponent_feasible_moves = 0;\\n\\t\\tint opponent_remaining_moves = 0;\\n\\n\\t\\t// Go through the board and figure out vacant spots\\n\\t\\tvacant_spaces = 0;\\n\\t\\tfor (i = -GameState.HALF_BOARD; i <= GameState.HALF_BOARD; i = i + 1) {\\n\\t\\t\\tif (c.getWeight(i) == 0) {\\n\\t\\t\\t\\tvacant_spaces++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tfor (i = 1; i <= GameState.MAX_WEIGHT; i = i + 1) {\\n\\t\\t\\t// Check if self have the weight\\n\\t\\t\\tif (c.IHaveWeight(i)) {\\n\\t\\t\\t\\tself_remaining_moves++;\\n\\t\\t\\t\\t// Go through all the possible positions\\n\\t\\t\\t\\tfor (j = -GameState.HALF_BOARD; j < GameState.HALF_BOARD; j++) {\\n\\t\\t\\t\\t\\tif (c.getWeight(j) == 0) {\\n\\t\\t\\t\\t\\t\\t// Place it and see if you tip\\n\\t\\t\\t\\t\\t\\tc.makeMove(i, j, PlayerName.none);\\n\\t\\t\\t\\t\\t\\tif (!c.isTipping_old()) {\\n\\t\\t\\t\\t\\t\\t\\tself_feasible_moves++;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t// Now remove the weight\\n\\t\\t\\t\\t\\t\\tc.removeMove(j);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t// Check if opponent has this weight\\n\\t\\t\\tif (c.opponentHasWeight(i)) {\\n\\t\\t\\t\\topponent_remaining_moves++;\\n\\t\\t\\t\\t// Go through all the possible positions\\n\\t\\t\\t\\tfor (j = -GameState.HALF_BOARD; j < GameState.HALF_BOARD; j++) {\\n\\t\\t\\t\\t\\t// Place the weight and see if you tip\\n\\t\\t\\t\\t\\tif (c.getWeight(j) == 0) {\\n\\t\\t\\t\\t\\t\\tc.makeMove(i, j, PlayerName.none);\\n\\t\\t\\t\\t\\t\\tif (!c.isTipping_old()) {\\n\\t\\t\\t\\t\\t\\t\\topponent_feasible_moves++;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t// Now remove the weight\\n\\t\\t\\t\\t\\t\\tc.removeMove(j);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t// Need to take the max because one of the players may have played one\\n\\t\\t// chance less\\n\\t\\tif (self_remaining_moves == 0 && opponent_remaining_moves == 0) {\\n\\t\\t\\treturn 0.0;\\n\\t\\t} else if (self_remaining_moves > opponent_remaining_moves)\\n\\t\\t\\treturn (double) (self_feasible_moves - opponent_feasible_moves)\\n\\t\\t\\t\\t\\t/ (double) (self_remaining_moves * vacant_spaces);\\n\\t\\telse\\n\\t\\t\\treturn (double) (self_feasible_moves - opponent_feasible_moves)\\n\\t\\t\\t\\t\\t/ (double) (opponent_remaining_moves * vacant_spaces);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"1fbd5eab02a385c91ef9909b674a4510\",\n \"score\": \"0.5610305\",\n \"text\": \"private Action bestActionFromFinishedTree() {\\n return Collections.max(validActionsDiscretized, Comparator.comparing(\\n c -> root.getActionReward(c) / (double) root.getActionVisits(c)));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2e0f29be2f67f2901a0249c1fe7468c4\",\n \"score\": \"0.56044203\",\n \"text\": \"public static int applyMinMax(int d, BoardModel model, boolean maximizingTeam, int alpha, int beta, boolean whiteTeam, int startDepth) {\\n //base case, figure out determinaion of game over\\n\\n // printMap(model);\\n // System.out.println(\\\"Depth: \\\"+d);\\n \\n\\n //allPossibleMoves moveTree = new allPossibleMoves();\\n int[] currentQueen;\\n ArrayList<int[]> whiteQueens = new ArrayList<>();\\n ArrayList<int[]> blackQueens = new ArrayList<>();\\n ArrayList<int[]> myQueens = new ArrayList<>();\\n // possibleMove bestestMove = null;\\n\\n// for (int count = 0; count < model.queenPositions.size(); count++) {\\n// if (model.getTile(model.queenPositions.get(count)).equals(POS_MARKED_BLACK)) {\\n// blackQueens.add(model.queenPositions.get(count));\\n// // System.out.println(\\\"Black: \\\"+model.getTile(model.queenPositions.get(count)));\\n// } else {\\n// whiteQueens.add(model.queenPositions.get(count));\\n// // System.out.println(\\\"White: \\\"+model.getTile(model.queenPositions.get(count)));\\n// }\\n// }\\n//set black and white queens \\n for (int jam = 0; jam < 10; jam++) {\\n for (int pb = 0; pb < 10; pb++) {\\n if (model.getTile(new int[]{jam, pb}).equals(POS_MARKED_WHITE)) {\\n whiteQueens.add(new int[]{jam, pb});\\n }\\n if (model.getTile(new int[]{jam, pb}).equals(POS_MARKED_BLACK)) {\\n blackQueens.add(new int[]{jam, pb});\\n }\\n }\\n }\\n if (maximizingTeam){\\n if (whiteTeam){\\n myQueens = whiteQueens;\\n }\\n else{\\n myQueens = blackQueens;\\n }\\n }\\n if (!maximizingTeam){\\n if (whiteTeam){\\n myQueens = blackQueens;\\n }\\n else{\\n myQueens = whiteQueens;\\n }\\n }\\n \\n if (d == 0 || findAllMoves(model,myQueens).isEmpty() ) {\\n return baseCase(model, whiteTeam);\\n }\\n\\n // System.out.println(\\\"White Queens identified as: \\\" + whiteQueens.get(0)[0] + \\\"\\\" + whiteQueens.get(0)[1] + \\\" \\\" + whiteQueens.get(1)[0] + whiteQueens.get(1)[1] + \\\" \\\" + whiteQueens.get(2)[0] + whiteQueens.get(2)[1] + \\\" \\\" + whiteQueens.get(3)[0] + whiteQueens.get(3)[1]);\\n //if (whiteTeam) {\\n // myQueens = whiteQueens;\\n //} else {\\n // myQueens = blackQueens;\\n // }\\n // perform a check to see which side we are on. \\n // System.out.println(\\\"Status: \\\"+maximizingTeam);\\n if (maximizingTeam) {\\n // System.out.println(\\\"Maximizing turn\\\");\\n if (whiteTeam) {\\n myQueens = whiteQueens;\\n } else {\\n myQueens = blackQueens;\\n }\\n\\n int maxEval = -1000000;\\n // considering this move was played. \\n\\n // printMap(model);\\n // System.out.println();\\n //find all children from this state\\n ArrayList<ArrayList<int[]>> children = findAllMoves(model, myQueens);\\n if (children.size() == 0){\\n return baseCase(model, whiteTeam);\\n }\\n if(children.size()==0 && d == startDepth){\\n System.out.println(\\\"We Lost :( \\\");\\n }\\n // printMap(model);\\n // System.out.println();\\n for (int i = 0; i < children.size(); i++) {\\n\\n String m1 = stringMap(model);\\n\\n BoardModel recursionModel = new BoardModel(10);\\n\\n for (int jam = 0; jam < 10; jam++) {\\n for (int pb = 0; pb < 10; pb++) {\\n recursionModel.setTile(new int[]{jam, pb}, model.getTile(new int[]{jam, pb}));\\n }\\n }\\n recursionModel.queenPositions = new ArrayList<>();\\n for (int x = 0; x < model.queenPositions.size(); x++) {\\n recursionModel.queenPositions.add(model.queenPositions.get(x));\\n }\\n\\n // printMap(recursionModel);\\n recursionModel.moveQueen(children.get(i).get(0), children.get(i).get(1));\\n recursionModel.setTile(children.get(i).get(2), POS_MARKED_ARROW);\\n // System.out.println(\\\"max recursive call\\\");\\n int childVal = applyMinMax(d - 1, recursionModel, false, alpha, beta, whiteTeam, startDepth);\\n recursionModel.moveQueen(children.get(i).get(1), children.get(i).get(0));\\n recursionModel.setTile(children.get(i).get(2), POS_AVAILABLE);\\n\\n String m2 = stringMap(model);\\n // System.out.println(\\\"Check board Validity Max: \\\"+m1.equals(m2));\\n\\n maxEval = max(maxEval, childVal);\\n if (d == startDepth) {\\n ArrayList<int[]> blah = new ArrayList<int[]>();\\n blah.add(children.get(i).get(0));\\n blah.add(children.get(i).get(1));\\n blah.add(children.get(i).get(2));\\n blah.add(new int[]{childVal});\\n maxMinMoves.add(blah);\\n }\\n alpha = max(maxEval, alpha);\\n // System.out.println(\\\"A: \\\"+alpha);\\n if (alpha >= beta) {\\n break;\\n }\\n }\\n return maxEval;\\n\\n } else {\\n // System.out.println(\\\"Minimizing turn\\\");\\n if (!whiteTeam) {\\n myQueens = whiteQueens;\\n } else {\\n myQueens = blackQueens;\\n }\\n\\n int maxEval = 1000000;\\n // considering this move was played. \\n\\n // printMap(model);\\n // System.out.println();\\n //find all children from this state\\n ArrayList<ArrayList<int[]>> children = findAllMoves(model, myQueens);\\n if (children.size() == 0){\\n return baseCase(model, whiteTeam);\\n }\\n if(children.size()==0 && d == startDepth){\\n System.out.println(\\\"We Lost :( \\\");\\n }\\n // printMap(model);\\n // System.out.println();\\n for (int i = 0; i < children.size(); i++) {\\n\\n String m1 = stringMap(model);\\n\\n BoardModel recursionModel = new BoardModel(10);\\n\\n for (int jam = 0; jam < 10; jam++) {\\n for (int pb = 0; pb < 10; pb++) {\\n recursionModel.setTile(new int[]{jam, pb}, model.getTile(new int[]{jam, pb}));\\n }\\n }\\n recursionModel.queenPositions = new ArrayList<>();\\n for (int x = 0; x < model.queenPositions.size(); x++) {\\n recursionModel.queenPositions.add(model.queenPositions.get(x));\\n }\\n\\n // printMap(recursionModel);\\n recursionModel.moveQueen(children.get(i).get(0), children.get(i).get(1));\\n recursionModel.setTile(children.get(i).get(2), POS_MARKED_ARROW);\\n // System.out.println(\\\"min recursive call\\\");\\n int childVal = applyMinMax(d - 1, recursionModel, true, alpha, beta, whiteTeam, startDepth);\\n recursionModel.moveQueen(children.get(i).get(1), children.get(i).get(0));\\n recursionModel.setTile(children.get(i).get(2), POS_AVAILABLE);\\n\\n String m2 = stringMap(model);\\n // System.out.println(\\\"Check board Validity Max: \\\"+m1.equals(m2));\\n\\n maxEval = min(maxEval, childVal);\\n if (d == startDepth) {\\n ArrayList<int[]> blah = new ArrayList<int[]>();\\n blah.add(children.get(i).get(0));\\n blah.add(children.get(i).get(1));\\n blah.add(children.get(i).get(2));\\n blah.add(new int[]{childVal});\\n maxMinMoves.add(blah);\\n }\\n beta = min(maxEval, alpha);\\n // System.out.println(\\\"A: \\\"+alpha);\\n if (alpha >= beta) {\\n break;\\n }\\n }\\n return maxEval;\\n }\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"0133053a3b224750ac8a06f893e0533b\",\n \"score\": \"0.55714476\",\n \"text\": \"public interface MiniMaxState extends State {\\r\\n\\t/**\\r\\n\\t * Determine if this state is a state in which MAX acts (we, as opposed to\\r\\n\\t * the opponent that we have no control over).\\r\\n\\t * \\r\\n\\t * @return true if MAX acts, false if opponent acts\\r\\n\\t */\\r\\n\\tpublic boolean isMaxState();\\r\\n\\r\\n\\t/**\\r\\n\\t * Determine the \\\"utility\\\" of the state, is usually called when a\\r\\n\\t * terminating state is visited. Should be a positive value (not exceeding\\r\\n\\t * +9999999) if we're doing well, a negative value (not below -9999999) if\\r\\n\\t * we're doing badly.\\r\\n\\t * \\r\\n\\t * @return the utility of the state\\r\\n\\t */\\r\\n\\tpublic double utility();\\r\\n\\r\\n}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e62880fb655f48e3438795c367e50ac7\",\n \"score\": \"0.5555728\",\n \"text\": \"public static int[] alphaBeta(Board b, int depth, int alpha, int beta, int playerNum){\\n //if the depth is 0 or the game is over return the last move\\n if (depth == 0 || b.isGameOver()){\\n return b.getLastMove();\\n }\\n //If player 1, maximize board score\\n if (playerNum == Board.PLAYER_1){\\n int[] bestMove = new int[3];\\n bestMove[2] = Integer.MIN_VALUE;\\n //check nodes of next tree\\n for (Board board: Board.getPossibleBoards(b, Board.PLAYER_2)) {\\n //calls minimax using next player to determine minimum board score possible\\n int[] move = alphaBeta(board, depth - 1, alpha, beta, Board.PLAYER_2);\\n if (move[2] > bestMove[2] && !isLosingMove(b, move[1], Board.PLAYER_2))\\n bestMove = move;\\n else if(move[2] == bestMove[2]){\\n if (Math.abs(move[1] - 3) < Math.abs(bestMove[1] - 3)){\\n bestMove = move;\\n }\\n else if (getRandom()){\\n bestMove = move;\\n }\\n }\\n //update upper bound\\n if(bestMove[2] > alpha){\\n alpha = bestMove[2];\\n }\\n //if bounds cross, node and children can be ignored\\n if(beta < alpha)\\n break;\\n }\\n return bestMove;\\n }\\n //if player 2, minimize board score\\n else if(playerNum == 2){\\n int[] bestMove = new int[3];\\n bestMove[2] = Integer.MAX_VALUE;\\n //check next nodes of tree\\n for (Board board: Board.getPossibleBoards(b, Board.PLAYER_1)){\\n //determine maximum loss using recursion\\n int[] move = alphaBeta(board, depth - 1, alpha, beta, Board.PLAYER_1);\\n if (move[2] < bestMove[2] && !isLosingMove(b, move[1], Board.PLAYER_2))\\n bestMove = move;\\n else if (move[2] == bestMove[2]){\\n if (Math.abs(move[1] - 3) < Math.abs(bestMove[1] - 3)){\\n bestMove = move;\\n }\\n else if (getRandom()){\\n bestMove = move;\\n }\\n }\\n //update lower bound\\n if(bestMove[2] < beta){\\n beta = bestMove[2];\\n }\\n //break if bounds intersect\\n if(beta < alpha)\\n break;\\n }\\n //minimizes max loss\\n return bestMove;\\n }\\n return null;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a16bbb809172722d494907f29e32b23f\",\n \"score\": \"0.5532613\",\n \"text\": \"abstract int getMaxLevel();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"eaac15d5953bb149473800badacd644e\",\n \"score\": \"0.55172807\",\n \"text\": \"private DeterministicBoardStateNode getBestTurn(int team, int depth, double sampleRate, double maxSamples,\\n boolean filterLethal) {\\n // no turn possible\\n if (this.b.getCurrentPlayerTurn() != team || this.b.getWinner() != 0) {\\n return null;\\n }\\n String state = this.b.stateToString();\\n UUID stateHash = UUID.nameUUIDFromBytes(state.getBytes());\\n DeterministicBoardStateNode dbsn;\\n boolean cacheHit = false;\\n if (!this.nodeMap.containsKey(stateHash)) {\\n dbsn = new DeterministicBoardStateNode(team,\\n evaluateAdvantage(this.b, team),\\n filterLethal ? this.getPossibleLethalActions(team) : this.getPossibleActions(team));\\n dbsn.sampleRate = sampleRate;\\n this.nodeMap.put(stateHash, dbsn);\\n } else {\\n dbsn = this.nodeMap.get(stateHash);\\n cacheHit = true;\\n if (this.traversedNodes.contains(dbsn)) {\\n System.err.println(\\\"AI encountered a cycle somehow\\\");\\n return null;\\n }\\n }\\n this.traversedNodes.add(dbsn);\\n // start sampling\\n int numSamples = (int) Math.round(Math.min(dbsn.totalBranches * sampleRate, maxSamples));\\n numSamples = Math.max(numSamples, SAMPLING_MIN_SAMPLES);\\n numSamples = Math.min(numSamples, dbsn.totalBranches);\\n // if we are revisiting this node, but it needs to be re-evaluated at a better detail level\\n if (cacheHit && dbsn.sampleRate < sampleRate - this.config.reevaluationMaxSampleRateDiff) {\\n dbsn.resetEvaluationOrder();\\n dbsn.sampleRate = sampleRate;\\n this.totalReevaluations++;\\n }\\n\\n // some statistics for debugging purposes\\n this.maxBranches[depth] = Math.max(this.maxBranches[depth], numSamples);\\n this.width[depth]++;\\n this.totalEvaluated++;\\n if (cacheHit) {\\n this.cacheHits[depth]++;\\n this.totalCacheHits++;\\n }\\n while (dbsn.evaluatedBranches < numSamples) {\\n String action = dbsn.nextBranchToEvaluate();\\n TraversalResult traverse = this.traverseAction(dbsn, state, action, depth, sampleRate, maxSamples,\\n filterLethal, null);\\n if (traverse.rng) {\\n // rng, re-evaluate action many times, channel an average score into an RNGBoardStateNode\\n int trials = Math.max(SelectRandom.ditherRound(Math.pow(this.config.rngDensityMultiplier, dbsn.totalBranches) * (this.config.rngMaxTrials - depth * this.config.rngTrialReduction)), this.config.rngMinTrials);\\n RNGBoardStateNode nextBsn = (RNGBoardStateNode) dbsn.branches.get(action); // trust\\n if (nextBsn != null) {\\n // if previously evaluated this rng branch, see if we can add some trials to it\\n trials = Math.max(1, trials - nextBsn.trials);\\n } else {\\n nextBsn = new RNGBoardStateNode(team);\\n nextBsn.addTrial(traverse.next);\\n }\\n for (int j = 1; j < trials; j++) {\\n traverse = this.traverseAction(dbsn, state, action, depth, sampleRate, maxSamples, filterLethal, nextBsn);\\n nextBsn.addTrial(traverse.next);\\n }\\n dbsn.logEvaluation(action, nextBsn);\\n } else {\\n // not rng, whatever\\n dbsn.logEvaluation(action, traverse.next);\\n if (dbsn.lethal) {\\n break;\\n }\\n }\\n }\\n this.traversedNodes.remove(dbsn);\\n return dbsn;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b21bc37c607c0d6340a63882519b59b7\",\n \"score\": \"0.54919946\",\n \"text\": \"private List<Double> MinimaxAlgorithm(MinimaxNode<GameState> node, int dataCount){\\n if(node.getNumberOfChildren() == 0){ //checks to see if terminal node\\n List<Double> heuristics = new ArrayList();\\n heuristics.addAll(calculateHeuristic(node.getState()));\\n return heuristics;\\n }\\n else{ //will maximise all the scores for each player.\\n double value = Double.NEGATIVE_INFINITY;\\n double checkValue;\\n int bestMove;\\n List<Double> heuristics = new ArrayList();\\n if(node.getIfChanceNode()){ //checks if current node is a chance node, if so, times \\n for (int i = 0; i < node.getChildren().size(); i++){\\n List<Double> tempHeuristics = new ArrayList();\\n tempHeuristics.addAll(MinimaxAlgorithm(node.getChildren().get(i),dataCount+1));\\n checkValue = node.getChildren().get(i).getProbability() * tempHeuristics.get(node.getNodeIndex());\\n value = Math.max(value, checkValue);//maximises the score.\\n if(checkValue == value){\\n heuristics.addAll(tempHeuristics); \\n }\\n if(dataCount == 0){//checks if this is the root node\\n if(checkValue == value){\\n MinimaxPlayer.optimalMoves = node.getChildren().get(i).getState().getOrientation(node.getNodeIndex()); \\n }\\n } \\n }\\n }\\n else{\\n for (int i = 0; i < node.getChildren().size(); i++){\\n List<Double> tempHeuristics = new ArrayList();\\n tempHeuristics.addAll(MinimaxAlgorithm(node.getChildren().get(i),dataCount+1));\\n checkValue = tempHeuristics.get(node.getNodeIndex());\\n value = Math.max(value, checkValue);//maximises the score.\\n if(checkValue == value){\\n heuristics.addAll(tempHeuristics); \\n }\\n if(dataCount == 0){//checks if this is the root node\\n if(checkValue == value){\\n MinimaxPlayer.optimalMoves = node.getChildren().get(i).getState().getOrientation(node.getNodeIndex()); \\n }\\n } \\n } \\n }\\n return heuristics;\\n } \\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5eb2b93a3b1a53072b96485eb21de5c6\",\n \"score\": \"0.54799473\",\n \"text\": \"public static GameState getBestMove(Vector<GameState> states){\\n int index = 0;\\n double max = 0;\\n double v = 0;\\n\\n // find state with max value and save its index\\n for(int i = 0; i < states.size(); i++){\\n v = minMaxPruning(states.get(i), depth, Double.NEGATIVE_INFINITY, Double.POSITIVE_INFINITY);\\n if(max < v){\\n max = v;\\n index = i;\\n }\\n }\\n return states.get(index);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9963c9edbdaff81e9a1e284792e1ae81\",\n \"score\": \"0.5478927\",\n \"text\": \"public void move(BoardState state) {\\n\\t move = alphabetaSearch(state, maxDepth);\\r\\n\\r\\n\\t\\t// TEST CASES\\r\\n\\t\\t// System.out.println(maxValue(state, maxDepth, 2, -1000, 1000));\\r\\n\\t\\t// System.out.println(alphabetaSearch(state, 10));\\r\\n\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5522635aa85a165bcfce55e0bb2785d7\",\n \"score\": \"0.54650664\",\n \"text\": \"public int minimax(Tile[][] board, int depth, boolean isMaximizing) {\\n int result = WinnerChecker.checkWinner();\\r\\n if(result != 2) {\\r\\n return result;\\r\\n }\\r\\n\\r\\n int bestScore = 0;\\r\\n if(isMaximizing){\\r\\n bestScore = 1;\\r\\n for(int i = 0; i< 3; i++){\\r\\n for(int j = 0; j< 3; j++){\\r\\n // Is the spot available?\\r\\n if(board[i][j].text.getText().isEmpty()){\\r\\n board[i][j].text.setText(\\\"O\\\");\\r\\n TicTacToeApp.previous_move = board[i][j];\\r\\n int score = minimax(board, depth+1,false);\\r\\n board[i][j].text.setText(\\\"\\\");\\r\\n bestScore = Math.min(score, bestScore);\\r\\n }\\r\\n }\\r\\n }\\r\\n }else{\\r\\n bestScore = -1;\\r\\n for(int i = 0; i< 3; i++){\\r\\n for(int j = 0; j< 3; j++){\\r\\n // Is the spot available?\\r\\n if(board[i][j].text.getText().isEmpty()){\\r\\n board[i][j].text.setText(\\\"X\\\");\\r\\n TicTacToeApp.previous_move = board[i][j];\\r\\n int score = minimax(board, depth+1,true);\\r\\n board[i][j].text.setText(\\\"\\\");\\r\\n bestScore = Math.max(score, bestScore);\\r\\n }\\r\\n }\\r\\n }\\r\\n }\\r\\n return bestScore;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"41708a414ae9321cbcbbd3dd8db8474f\",\n \"score\": \"0.5452009\",\n \"text\": \"public int getBestMove(ModelInterface field, List<IRatingMechanism> ratingMechanisms, Token owner) {\\n tree = new Tree(field, ratingMechanisms, owner);\\n // minimize or maximize each level\\n for (int i = Tree.MAXDEPTH - 1; i > 0; i--) {\\n //System.out.println(\\\"max/min level \\\" + i);\\n List<Node> currLevel = tree.getLevel(i);\\n if (!currLevel.isEmpty()) {\\n \\n if (currLevel.get(0).getCurrentOwner() == owner) {\\n \\n for (Node node : currLevel) {\\n maximize(node);\\n }\\n \\n } else {\\n \\n for (Node node : currLevel) {\\n minimize(node);\\n }\\n }\\n }\\n }\\n\\n // debug\\n for (int i = 0; i < tree.getLevel(1).size(); i++) {\\n System.out.println(tree.getLevel(1).get(i).getMove().toString());\\n }\\n\\n PossibleMove minMove = tree.getLevel(1).get(0).getMove();\\n for (int i = 0; i < tree.getLevel(1).size(); i++) {\\n if (tree.getLevel(1).get(i).getMove().getRating() < minMove.getRating()) {\\n minMove = tree.getLevel(1).get(i).getMove();\\n }\\n }\\n return minMove.getMove();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"dc0ce2e9fcf373f8fc027d16f5d501be\",\n \"score\": \"0.54419297\",\n \"text\": \"private float generateLegalMoves(Node n, int depth, double A, double B, int player) {\\n\\t\\tdouble val = (player == 1 ? Double.NEGATIVE_INFINITY : Double.POSITIVE_INFINITY);\\n\\t\\t\\n\\t\\tGamepiece[] playerPieces = (player == 1 ? g_board.getWhiteQueens() : g_board.getBlackQueens());\\n\\t\\t\\n\\t\\tfor(Gamepiece Queen : playerPieces) {\\n\\t\\t\\tint[] pos = Queen.position();\\n\\t\\t\\t\\n\\t\\t\\tint x = pos[0];\\n\\t\\t\\tint y = pos[1];\\n\\t\\t\\tint to_x = 0, to_y = 0, a_x = 0, a_y = 0;\\n\\t\\t\\t\\n\\t\\t\\t// Try to move up\\n\\t\\t\\tfor(int i = 1; i < (10 - y) && board[y + i][x] instanceof Blank; i++) {\\n\\t\\t\\t\\tto_x = x;\\n\\t\\t\\t\\tto_y = (y + i);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot up\\n\\t\\t\\t\\tfor(int j = 1; j < (10 - to_y) && board[to_y + j][to_x] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\t// Finish constructing the move\\n\\t\\t\\t\\t\\ta_x = to_x;\\n\\t\\t\\t\\t\\ta_y = (to_y + j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Create a new node with the move and this node as its parent\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Play the move on the AI board\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Recursive call back to alphaBeta to search deeper\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Undo the move made at this level\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// If we've reached a point where A >= B, break out of the entire move generation process\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot right\\n\\t\\t\\t\\tfor(int j = 1; j < (10 - to_x) && board[to_y][to_x + j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = to_x + j;\\n\\t\\t\\t\\t\\ta_y = to_y;\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot down (with special case => can shoot to queen's origin square)\\n\\t\\t\\t\\tfor(int j = 1; j <= to_y && (board[to_y - j][to_x] instanceof Blank || (to_y - j == y)); j++) {\\n\\t\\t\\t\\t\\ta_x = to_x;\\n\\t\\t\\t\\t\\ta_y = (to_y - j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot left\\n\\t\\t\\t\\tfor(int j = 1; j <= to_x && board[to_y][to_x - j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x - j);\\n\\t\\t\\t\\t\\ta_y = to_y;\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot up-right\\n\\t\\t\\t\\tfor(int j = 1; j < (10 - to_y) && j < (10 - to_x) && board[to_y + j][to_x + j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x + j);\\n\\t\\t\\t\\t\\ta_y = (to_y + j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot down-right\\n\\t\\t\\t\\tfor(int j = 1; j <= to_y && j < (10 - to_x) && board[to_y - j][to_x + j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x + j);\\n\\t\\t\\t\\t\\ta_y = (to_y - j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot up-left\\n\\t\\t\\t\\tfor(int j = 1; j < (10 - to_y) && j <= to_x && board[to_y + j][to_x - j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x - j);\\n\\t\\t\\t\\t\\ta_y = (to_y + j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot down-left\\n\\t\\t\\t\\tfor(int j = 1; j <= to_y && j <= to_x && board[to_y - j][to_x - j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x - j);\\n\\t\\t\\t\\t\\ta_y = (to_y - j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t// Try to move right\\n\\t\\t\\tfor(int i = 1; i < (10 - x) && board[y][x + i] instanceof Blank; i++) {\\n\\t\\t\\t\\tto_x = x + i;\\n\\t\\t\\t\\tto_y = y;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot up\\n\\t\\t\\t\\tfor(int j = 1; j < (10 - to_y) && board[to_y + j][to_x] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\t// Finish constructing the move\\n\\t\\t\\t\\t\\ta_x = to_x;\\n\\t\\t\\t\\t\\ta_y = (to_y + j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Create a new node with the move and this node as its parent\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Play the move on the AI board\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Recursive call back to alphaBeta to search deeper\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Undo the move made at this level\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// If we've reached a point where A >= B, break out of the entire move generation process\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot right\\n\\t\\t\\t\\tfor(int j = 1; j < (10 - to_x) && board[to_y][to_x + j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = to_x + j;\\n\\t\\t\\t\\t\\ta_y = to_y;\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot down \\n\\t\\t\\t\\tfor(int j = 1; j <= to_y && board[to_y - j][to_x] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = to_x;\\n\\t\\t\\t\\t\\ta_y = (to_y - j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot left (with special case => can shoot to queen's origin square)\\n\\t\\t\\t\\tfor(int j = 1; j <= to_x && (board[to_y][to_x - j] instanceof Blank || (to_x - j) == x); j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x - j);\\n\\t\\t\\t\\t\\ta_y = to_y;\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot up-right\\n\\t\\t\\t\\tfor(int j = 1; j < (10 - to_y) && j < (10 - to_x) && board[to_y + j][to_x + j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x + j);\\n\\t\\t\\t\\t\\ta_y = (to_y + j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot down-right\\n\\t\\t\\t\\tfor(int j = 1; j <= to_y && j < (10 - to_x) && board[to_y - j][to_x + j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x + j);\\n\\t\\t\\t\\t\\ta_y = (to_y - j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot up-left\\n\\t\\t\\t\\tfor(int j = 1; j < (10 - to_y) && j <= to_x && board[to_y + j][to_x - j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x - j);\\n\\t\\t\\t\\t\\ta_y = (to_y + j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot down-left\\n\\t\\t\\t\\tfor(int j = 1; j <= to_y && j <= to_x && board[to_y - j][to_x - j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x - j);\\n\\t\\t\\t\\t\\ta_y = (to_y - j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t// Try to move down\\n\\t\\t\\tfor(int i = 1; i <= y && board[y - i][x] instanceof Blank; i++) {\\n\\t\\t\\t\\tto_x = x;\\n\\t\\t\\t\\tto_y = y - i;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot up (With special case arrow loc = queen start)\\n\\t\\t\\t\\tfor(int j = 1; j < (10 - to_y) && (board[to_y + j][to_x] instanceof Blank || to_y + j == y); j++) {\\n\\t\\t\\t\\t\\t// Finish constructing the move\\n\\t\\t\\t\\t\\ta_x = to_x;\\n\\t\\t\\t\\t\\ta_y = (to_y + j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Create a new node with the move and this node as its parent\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Play the move on the AI board\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Recursive call back to alphaBeta to search deeper\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Undo the move made at this level\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// If we've reached a point where A >= B, break out of the entire move generation process\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot right\\n\\t\\t\\t\\tfor(int j = 1; j < (10 - to_x) && board[to_y][to_x + j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = to_x + j;\\n\\t\\t\\t\\t\\ta_y = to_y;\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot down \\n\\t\\t\\t\\tfor(int j = 1; j <= to_y && board[to_y - j][to_x] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = to_x;\\n\\t\\t\\t\\t\\ta_y = (to_y - j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot left (with special case => can shoot to queen's origin square)\\n\\t\\t\\t\\tfor(int j = 1; j <= to_x && (board[to_y][to_x - j] instanceof Blank || (to_x - j) == x); j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x - j);\\n\\t\\t\\t\\t\\ta_y = to_y;\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot up-right\\n\\t\\t\\t\\tfor(int j = 1; j < (10 - to_y) && j < (10 - to_x) && board[to_y + j][to_x + j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x + j);\\n\\t\\t\\t\\t\\ta_y = (to_y + j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot down-right\\n\\t\\t\\t\\tfor(int j = 1; j <= to_y && j < (10 - to_x) && board[to_y - j][to_x + j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x + j);\\n\\t\\t\\t\\t\\ta_y = (to_y - j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot up-left\\n\\t\\t\\t\\tfor(int j = 1; j < (10 - to_y) && j <= to_x && board[to_y + j][to_x - j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x - j);\\n\\t\\t\\t\\t\\ta_y = (to_y + j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot down-left\\n\\t\\t\\t\\tfor(int j = 1; j <= to_y && j <= to_x && board[to_y - j][to_x - j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x - j);\\n\\t\\t\\t\\t\\ta_y = (to_y - j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t// Try to move left\\n\\t\\t\\tfor(int i = 1; i <= x && board[y][x - i] instanceof Blank; i++) {\\n\\t\\t\\t\\tto_x = x - i;\\n\\t\\t\\t\\tto_y = y;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot up\\n\\t\\t\\t\\tfor(int j = 1; j < (10 - to_y) && board[to_y + j][to_x] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\t// Finish constructing the move\\n\\t\\t\\t\\t\\ta_x = to_x;\\n\\t\\t\\t\\t\\ta_y = (to_y + j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Create a new node with the move and this node as its parent\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Play the move on the AI board\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Recursive call back to alphaBeta to search deeper\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Undo the move made at this level\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// If we've reached a point where A >= B, break out of the entire move generation process\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot right (with special case)\\n\\t\\t\\t\\tfor(int j = 1; j < (10 - to_x) && (board[to_y][to_x + j] instanceof Blank || (to_x + j == x)); j++) {\\n\\t\\t\\t\\t\\ta_x = to_x + j;\\n\\t\\t\\t\\t\\ta_y = to_y;\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot down \\n\\t\\t\\t\\tfor(int j = 1; j <= to_y && board[to_y - j][to_x] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = to_x;\\n\\t\\t\\t\\t\\ta_y = (to_y - j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot left (with special case => can shoot to queen's origin square)\\n\\t\\t\\t\\tfor(int j = 1; j <= to_x && (board[to_y][to_x - j] instanceof Blank || (to_x - j) == x); j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x - j);\\n\\t\\t\\t\\t\\ta_y = to_y;\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot up-right\\n\\t\\t\\t\\tfor(int j = 1; j < (10 - to_y) && j < (10 - to_x) && board[to_y + j][to_x + j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x + j);\\n\\t\\t\\t\\t\\ta_y = (to_y + j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot down-right\\n\\t\\t\\t\\tfor(int j = 1; j <= to_y && j < (10 - to_x) && board[to_y - j][to_x + j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x + j);\\n\\t\\t\\t\\t\\ta_y = (to_y - j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot up-left\\n\\t\\t\\t\\tfor(int j = 1; j < (10 - to_y) && j <= to_x && board[to_y + j][to_x - j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x - j);\\n\\t\\t\\t\\t\\ta_y = (to_y + j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot down-left\\n\\t\\t\\t\\tfor(int j = 1; j <= to_y && j <= to_x && board[to_y - j][to_x - j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x - j);\\n\\t\\t\\t\\t\\ta_y = (to_y - j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t// Try to move up-right\\n\\t\\t\\tfor(int i = 1; i < (10 - y) && i < (10 - x) && board[y + i][x + i] instanceof Blank; i++) {\\n\\t\\t\\t\\tto_x = x + i;\\n\\t\\t\\t\\tto_y = y + i;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot up\\n\\t\\t\\t\\tfor(int j = 1; j < (10 - to_y) && board[to_y + j][to_x] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\t// Finish constructing the move\\n\\t\\t\\t\\t\\ta_x = to_x;\\n\\t\\t\\t\\t\\ta_y = (to_y + j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Create a new node with the move and this node as its parent\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Play the move on the AI board\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Recursive call back to alphaBeta to search deeper\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Undo the move made at this level\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// If we've reached a point where A >= B, break out of the entire move generation process\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot right\\n\\t\\t\\t\\tfor(int j = 1; j < (10 - to_x) && board[to_y][to_x + j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = to_x + j;\\n\\t\\t\\t\\t\\ta_y = to_y;\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot down \\n\\t\\t\\t\\tfor(int j = 1; j <= to_y && board[to_y - j][to_x] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = to_x;\\n\\t\\t\\t\\t\\ta_y = (to_y - j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot left\\n\\t\\t\\t\\tfor(int j = 1; j <= to_x && board[to_y][to_x - j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x - j);\\n\\t\\t\\t\\t\\ta_y = to_y;\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot up-right\\n\\t\\t\\t\\tfor(int j = 1; j < (10 - to_y) && j < (10 - to_x) && board[to_y + j][to_x + j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x + j);\\n\\t\\t\\t\\t\\ta_y = (to_y + j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot down-right\\n\\t\\t\\t\\tfor(int j = 1; j <= to_y && j < (10 - to_x) && board[to_y - j][to_x + j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x + j);\\n\\t\\t\\t\\t\\ta_y = (to_y - j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot up-left\\n\\t\\t\\t\\tfor(int j = 1; j < (10 - to_y) && j <= to_x && board[to_y + j][to_x - j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x - j);\\n\\t\\t\\t\\t\\ta_y = (to_y + j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot down-left (with special case)\\n\\t\\t\\t\\tfor(int j = 1; j <= to_y && j <= to_x && (board[to_y - j][to_x - j] instanceof Blank || ((to_y - j) == y && (to_x - j) == x)); j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x - j);\\n\\t\\t\\t\\t\\ta_y = (to_y - j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t// Try to move down-right\\n\\t\\t\\tfor(int i = 1; i <= y && i < (10 - x) && board[y - i][x + i] instanceof Blank; i++) {\\n\\t\\t\\t\\tto_x = x + i;\\n\\t\\t\\t\\tto_y = y - i;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot up\\n\\t\\t\\t\\tfor(int j = 1; j < (10 - to_y) && board[to_y + j][to_x] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\t// Finish constructing the move\\n\\t\\t\\t\\t\\ta_x = to_x;\\n\\t\\t\\t\\t\\ta_y = (to_y + j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Create a new node with the move and this node as its parent\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Play the move on the AI board\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Recursive call back to alphaBeta to search deeper\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Undo the move made at this level\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// If we've reached a point where A >= B, break out of the entire move generation process\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot right\\n\\t\\t\\t\\tfor(int j = 1; j < (10 - to_x) && board[to_y][to_x + j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = to_x + j;\\n\\t\\t\\t\\t\\ta_y = to_y;\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot down \\n\\t\\t\\t\\tfor(int j = 1; j <= to_y && board[to_y - j][to_x] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = to_x;\\n\\t\\t\\t\\t\\ta_y = (to_y - j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot left\\n\\t\\t\\t\\tfor(int j = 1; j <= to_x && board[to_y][to_x - j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x - j);\\n\\t\\t\\t\\t\\ta_y = to_y;\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot up-right\\n\\t\\t\\t\\tfor(int j = 1; j < (10 - to_y) && j < (10 - to_x) && board[to_y + j][to_x + j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x + j);\\n\\t\\t\\t\\t\\ta_y = (to_y + j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot down-right\\n\\t\\t\\t\\tfor(int j = 1; j <= to_y && j < (10 - to_x) && board[to_y - j][to_x + j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x + j);\\n\\t\\t\\t\\t\\ta_y = (to_y - j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot up-left (with special case)\\n\\t\\t\\t\\tfor(int j = 1; j < (10 - to_y) && j <= to_x && (board[to_y + j][to_x - j] instanceof Blank || ((to_y + j) == y && (to_x - j) == x)); j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x - j);\\n\\t\\t\\t\\t\\ta_y = (to_y + j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot down-left\\n\\t\\t\\t\\tfor(int j = 1; j <= to_y && j <= to_x && board[to_y - j][to_x - j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x - j);\\n\\t\\t\\t\\t\\ta_y = (to_y - j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t// Try to move up-left\\n\\t\\t\\tfor(int i = 1; i < (10 - y) && i <= x && board[y + i][x - i] instanceof Blank; i++) {\\n\\t\\t\\t\\tto_x = x - i;\\n\\t\\t\\t\\tto_y = y + i;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot up\\n\\t\\t\\t\\tfor(int j = 1; j < (10 - to_y) && board[to_y + j][to_x] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\t// Finish constructing the move\\n\\t\\t\\t\\t\\ta_x = to_x;\\n\\t\\t\\t\\t\\ta_y = (to_y + j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Create a new node with the move and this node as its parent\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Play the move on the AI board\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Recursive call back to alphaBeta to search deeper\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Undo the move made at this level\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// If we've reached a point where A >= B, break out of the entire move generation process\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot right\\n\\t\\t\\t\\tfor(int j = 1; j < (10 - to_x) && board[to_y][to_x + j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = to_x + j;\\n\\t\\t\\t\\t\\ta_y = to_y;\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot down \\n\\t\\t\\t\\tfor(int j = 1; j <= to_y && board[to_y - j][to_x] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = to_x;\\n\\t\\t\\t\\t\\ta_y = (to_y - j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot left\\n\\t\\t\\t\\tfor(int j = 1; j <= to_x && board[to_y][to_x - j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x - j);\\n\\t\\t\\t\\t\\ta_y = to_y;\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot up-right\\n\\t\\t\\t\\tfor(int j = 1; j < (10 - to_y) && j < (10 - to_x) && board[to_y + j][to_x + j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x + j);\\n\\t\\t\\t\\t\\ta_y = (to_y + j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot down-right (with special case)\\n\\t\\t\\t\\tfor(int j = 1; j <= to_y && j < (10 - to_x) && (board[to_y - j][to_x + j] instanceof Blank || ((to_y - j) == y && (to_x + j) == x)); j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x + j);\\n\\t\\t\\t\\t\\ta_y = (to_y - j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot up-left\\n\\t\\t\\t\\tfor(int j = 1; j < (10 - to_y) && j <= to_x && board[to_y + j][to_x - j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x - j);\\n\\t\\t\\t\\t\\ta_y = (to_y + j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot down-left\\n\\t\\t\\t\\tfor(int j = 1; j <= to_y && j <= to_x && board[to_y - j][to_x - j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x - j);\\n\\t\\t\\t\\t\\ta_y = (to_y - j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t// Try to move down-left\\n\\t\\t\\tfor(int i = 1; i <= y && i <= x && board[y - i][x - i] instanceof Blank; i++) {\\n\\t\\t\\t\\tto_x = x - i;\\n\\t\\t\\t\\tto_y = y - i;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot up\\n\\t\\t\\t\\tfor(int j = 1; j < (10 - to_y) && board[to_y + j][to_x] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\t// Finish constructing the move\\n\\t\\t\\t\\t\\ta_x = to_x;\\n\\t\\t\\t\\t\\ta_y = (to_y + j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Create a new node with the move and this node as its parent\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Play the move on the AI board\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Recursive call back to alphaBeta to search deeper\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// Undo the move made at this level\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t// If we've reached a point where A >= B, break out of the entire move generation process\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot right\\n\\t\\t\\t\\tfor(int j = 1; j < (10 - to_x) && board[to_y][to_x + j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = to_x + j;\\n\\t\\t\\t\\t\\ta_y = to_y;\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot down \\n\\t\\t\\t\\tfor(int j = 1; j <= to_y && board[to_y - j][to_x] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = to_x;\\n\\t\\t\\t\\t\\ta_y = (to_y - j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot left\\n\\t\\t\\t\\tfor(int j = 1; j <= to_x && board[to_y][to_x - j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x - j);\\n\\t\\t\\t\\t\\ta_y = to_y;\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot up-right (with special case)\\n\\t\\t\\t\\tfor(int j = 1; j < (10 - to_y) && j < (10 - to_x) && (board[to_y + j][to_x + j] instanceof Blank || ((to_y + j) == y && (to_x + j) == x)); j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x + j);\\n\\t\\t\\t\\t\\ta_y = (to_y + j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot down-right\\n\\t\\t\\t\\tfor(int j = 1; j <= to_y && j < (10 - to_x) && board[to_y - j][to_x + j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x + j);\\n\\t\\t\\t\\t\\ta_y = (to_y - j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot up-left\\n\\t\\t\\t\\tfor(int j = 1; j < (10 - to_y) && j <= to_x && board[to_y + j][to_x - j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x - j);\\n\\t\\t\\t\\t\\ta_y = (to_y + j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t// Try to shoot down-left\\n\\t\\t\\t\\tfor(int j = 1; j <= to_y && j <= to_x && board[to_y - j][to_x - j] instanceof Blank; j++) {\\n\\t\\t\\t\\t\\ta_x = (to_x - j);\\n\\t\\t\\t\\t\\ta_y = (to_y - j);\\n\\t\\t\\t\\t\\tint move = encodeMove(x, y, to_x, to_y, a_x, a_y);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tNode child = new Node(move, n);\\n\\t\\t\\t\\t\\tn.addChild(child);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.doMove(move);\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(player == 1) {\\n\\t\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, 2));\\n\\t\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, 1));\\n\\t\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tg_board.undoMove();\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t// If we found no successor moves for this child then this player can't move and therefore loses.\\n\\t\\tif(n.getChildren() == null || n.getChildren().isEmpty()) {\\n//\\t\\t\\tval = (float)(player == 1 ? Double.NEGATIVE_INFINITY : Double.POSITIVE_INFINITY);\\n//\\t\\t\\tleaves++;\\n\\t\\t\\tval = alphaBeta(n, 0, A, B, player);\\n\\t\\t}\\n\\t\\t\\n\\t\\tn.setScore((float)val);\\n\\t\\t\\n\\t\\treturn (float)val;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"21edc93acb0bd48b28f01164f3ad6802\",\n \"score\": \"0.54374325\",\n \"text\": \"public Entry maxValue(Board board, int depth) throws CloneNotSupportedException{\\n \\tint score;\\n \\tif (cutOffTest(board, depth)) {\\n \\t\\tscore = utility(board);\\n \\t\\tEntry entry = new Entry(score, 0); \\n \\t\\treturn entry;\\n \\t}\\n \\t\\n \\tint max = Integer.MIN_VALUE;\\n \\tint direction = 0;\\n \\t\\n \\tfor (int i = 1; i <= 4; i++) {\\n \\t\\tBoard newboard = (Board)board.clone();\\n \\t\\t\\n \\t\\tnewboard.move(i);\\n \\t\\tEntry entry = minValue(newboard, depth+1);\\n \\t\\tif (entry.score > max) {\\n \\t\\t\\tmax = entry.score;\\n \\t\\t\\tdirection = i;\\n \\t\\t}\\n \\t}\\n \\t\\n \\tEntry res = new Entry(max, direction);\\n \\treturn res;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b0bcae09cec6b1e71f16aaff216e5408\",\n \"score\": \"0.54329216\",\n \"text\": \"Move getBestMove() {\\n //System.out.println(\\\"AI chooses: \\\" + m.toString());\\n return moves.get((int) (Math.random() * moves.size()));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"658f1902da62d71cb3c6663bc36827c7\",\n \"score\": \"0.54323786\",\n \"text\": \"public int alphabetaSearch(BoardState state, int maxDepth) {\\n\\t\\tint[] pits = new int[6];\\r\\n\\t\\t\\r\\n\\t\\t// state to check moves\\r\\n\\t\\tBoardState move = state;\\r\\n\\t\\r\\n\\t\\t// initializing the alpha and the beta value\\r\\n\\t\\tint alpha = Integer.MIN_VALUE;\\r\\n\\t\\tint beta = Integer.MAX_VALUE;\\r\\n\\t\\t\\r\\n\\t\\tint bestPit = 0;\\r\\n\\r\\n\\t\\t// for loop to get the SBE of the pits\\r\\n\\t\\tfor (int i = 0; i <= 5; i++) {\\r\\n\\r\\n\\t\\t\\t// checking if the move is legal\\r\\n\\t\\t\\tif (state.isLegalMove(1, i)) {\\r\\n\\r\\n\\t\\t\\t\\t// variable set to max since node at depth 1 is a max value\\r\\n\\t\\t\\t\\tint v = minValue(move.applyMove(1, i), maxDepth, maxDepth - 1, alpha, beta);\\r\\n\\r\\n\\t\\t\\t\\t// updating the alpha value based on our search\\r\\n\\t\\t\\t\\tif (v > alpha) {\\r\\n\\t\\t\\t\\t\\talpha = v;\\r\\n\\t\\t\\t\\t\\tbestPit = i;\\r\\n\\t\\t\\t\\t}\\r\\n\\r\\n\\t\\t\\t\\t// pruning\\r\\n\\t\\t\\t\\tif (beta <= alpha)\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\r\\n\\t\\treturn bestPit;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"61f5f9b0a1390f8faba0e1446bdae7bb\",\n \"score\": \"0.5402652\",\n \"text\": \"private double minValue(Board state, int depth, double alpha, double beta) {\\n if(terminalTest(state, depth))\\n return utility(state);\\n\\n double value = Double.POSITIVE_INFINITY;\\n for(Move action: actions(state)){\\n Board nextState = new Board(state);\\n\\n value = Math.min(value,\\n maxValue(result(nextState, action),\\n depth-1, alpha, beta));\\n\\n if(value <= alpha)\\n return value;\\n\\n beta = Math.min(beta, value);\\n }\\n\\n return value;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"75a003726b49982cafb6dbfb6d26b15d\",\n \"score\": \"0.539483\",\n \"text\": \"private int[] getBestMoveAndScoreDifference(int[] board, int depth, boolean turn) {\\n int boardCopy[];\\n if (depth <= 0) {\\n return new int[] {0,-1};\\n }\\n if (turn) {\\n int minimum = MAXIMUM_POSSIPLE_SCORE_DIFFERENCE;\\n int move = -1;\\n for (int i = 0; i < 5; i++) {\\n if (board[i] < 2) {\\n continue;\\n }\\n boardCopy = board.clone();\\n int x = playMove(boardCopy, i);\\n int y = 0;\\n if (!hasPlayer2Move(boardCopy)) {\\n if (hasPlayer1Move(boardCopy)) {\\n y = getBestMove(boardCopy, depth - 1, turn);\\n } else {\\n for (int j = 0; j < 5; j++) {\\n y = y - boardCopy[j];\\n }\\n for (int j = 5; j < 10; j++) {\\n y = y + boardCopy[j];\\n }\\n }\\n } else {\\n y = getBestMove(boardCopy, depth - 1, ! turn);\\n }\\n int z = y - x;\\n if (z < minimum) {\\n minimum = z;\\n move = i;\\n }\\n }\\n int i = 10;\\n if (board[2] < 2) {\\n return new int[] {minimum,move};\\n }\\n boardCopy = board.clone();\\n int x = playMove(boardCopy, i);\\n int y = 0;\\n if (!hasPlayer2Move(boardCopy)) {\\n if (hasPlayer1Move(boardCopy)) {\\n y = getBestMove(boardCopy, depth - 1, turn);\\n } else {\\n for (int j = 0; j < 5; j++) {\\n y = y - boardCopy[j];\\n }\\n for (int j = 5; j < 10; j++) {\\n y = y + boardCopy[j];\\n }\\n }\\n } else {\\n y = getBestMove(boardCopy, depth - 1, !turn);\\n }\\n int z = y - x;\\n if (z < minimum) {\\n minimum = z;\\n move = i;\\n }\\n return new int[] {minimum,move};\\n } else {\\n int maximum = MINIMUM_POSSIPLE_SCORE_DIFFERENCE;\\n int move = -1;\\n for (int i = 5; i < 10; i++) {\\n if (board[i] < 2) {\\n continue;\\n }\\n boardCopy = board.clone();\\n int x = playMove(boardCopy, i);\\n int y = 0;\\n if (!hasPlayer1Move(boardCopy)) {\\n if (hasPlayer2Move(boardCopy)) {\\n y = getBestMove(boardCopy, depth - 1, turn);\\n } else {\\n for (int j = 0; j < 5; j++) {\\n y = y - boardCopy[j];\\n }\\n for (int j = 5; j < 10; j++) {\\n y = y + boardCopy[j];\\n }\\n }\\n } else {\\n y = getBestMove(boardCopy, depth - 1, !turn);\\n }\\n int z = y + x;\\n if (z > maximum) {\\n maximum = z;\\n move = i;\\n }\\n }\\n int i = 11;\\n if (board[7] < 2) {\\n return new int[] {maximum,move};\\n }\\n boardCopy = board.clone();\\n int x = playMove(boardCopy, i);\\n int y = 0;\\n if (!hasPlayer1Move(boardCopy)) {\\n if (hasPlayer2Move(boardCopy)) {\\n y = getBestMove(boardCopy, depth - 1, turn);\\n } else {\\n for (int j = 0; j < 5; j++) {\\n y = y - boardCopy[j];\\n }\\n for (int j = 5; j < 10; j++) {\\n y = y + boardCopy[j];\\n }\\n }\\n } else {\\n y = getBestMove(boardCopy, depth - 1, !turn);\\n }\\n int z = y + x;\\n if (z > maximum) {\\n maximum = z;\\n move = i;\\n }\\n return new int[] {maximum,move};\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"20daca39256256304fb32fdd8cba067b\",\n \"score\": \"0.53871834\",\n \"text\": \"@Override\\n public int calculateBattleValue() {\\n return calculateBattleValue(false, false);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"8c7e18a4a7f8e46274cbba3db606d70a\",\n \"score\": \"0.53555566\",\n \"text\": \"private TraversalResult traverseAction(DeterministicBoardStateNode current, String currentState, String action, int depth, double sampleRate, double maxSamples,\\n boolean filterLethal, RNGBoardStateNode nextRNG) {\\n ResolutionResult result = this.b.executePlayerAction(new StringTokenizer(action));\\n BoardStateNode node;\\n double nextMaxSamples = maxSamples;\\n double nextSampleRate = sampleRate;\\n if (depth + 1 >= SAMPLING_MIN_DEPTH) {\\n if (depth + 1 == SAMPLING_MIN_DEPTH) {\\n nextMaxSamples = this.config.maxSamples;\\n } else {\\n nextMaxSamples = maxSamples * this.config.maxSamplesMultiplier;\\n }\\n nextSampleRate = sampleRate * current.getWeightedProportionOfAction(action) * this.config.sampleRateMultiplier;\\n }\\n if (result.rng) {\\n // the number of trials we've already done to get to this node\\n int cumTrials = 0;\\n if (nextRNG != null) {\\n String state = this.b.stateToString();\\n UUID stateHash = UUID.nameUUIDFromBytes(state.getBytes());\\n cumTrials += nextRNG.getCount(this.nodeMap.get(stateHash));\\n }\\n nextSampleRate *= 1 - (this.config.rngPenalty * Math.pow(this.config.rngPenaltyReduction, cumTrials));\\n }\\n if (this.b.getWinner() != 0 || depth == SAMPLING_MAX_DEPTH) {\\n // no more actions can be taken\\n node = new TerminalBoardStateNode(current.team, evaluateAdvantage(this.b, current.team));\\n if (!result.rng && this.b.getWinner() == current.team) {\\n current.lethal = true; // the current node has an action that results in a lethal 100% of the time\\n }\\n } else if (Integer.parseInt(action.substring(0, 1)) == EndTurnAction.ID || this.b.getCurrentPlayerTurn() != current.team) {\\n // assess what's the worst the opponent can do\\n if (filterLethal) {\\n // not part of my pay grade\\n node = new TerminalBoardStateNode(current.team * -1, evaluateAdvantage(this.b, current.team * -1));\\n } else {\\n node = this.getBestTurn(current.team * -1, depth + 1,\\n Math.max(nextSampleRate, this.config.enemySampleRate),\\n Math.max(nextMaxSamples, this.config.maxSamplesEnemy),\\n true);\\n }\\n } else {\\n DeterministicBoardStateNode dbsn = this.getBestTurn(current.team, depth + 1, nextSampleRate, nextMaxSamples, filterLethal);\\n if (dbsn == null) {\\n // something went wrong, here's a bandaid\\n node = new TerminalBoardStateNode(current.team, evaluateAdvantage(this.b, current.team));\\n } else {\\n if (dbsn.lethal) {\\n current.lethal = true; // the current node has an action that leads to a node that eventually results in lethal\\n }\\n node = dbsn;\\n }\\n }\\n List<Event> undoStack = new LinkedList<>(result.events);\\n while (!undoStack.isEmpty()) {\\n undoStack.get(undoStack.size() - 1).undo(this.b);\\n undoStack.remove(undoStack.size() - 1);\\n }\\n // aura difference checking isn't updated by undoing, we have to update it ourselves\\n this.b.updateAuraLastCheck();\\n this.b.updateDependentStatsLastCheck();\\n String stateAfterUndo = this.b.stateToString();\\n if (!currentState.equals(stateAfterUndo)) {\\n System.out.println(\\n \\\"Discrepancy after executing \\\" + action + \\\", rng = \\\" + result.rng + \\\", depth = \\\" + depth);\\n for (Event e : result.events) {\\n System.out.print(e.toString());\\n }\\n System.out.println(\\\"Before:\\\");\\n System.out.println(currentState);\\n System.out.println(\\\"After:\\\");\\n System.out.println(stateAfterUndo);\\n throw new RuntimeException();\\n }\\n return new TraversalResult(node, result.rng);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f511dae2d2338a440d720dd6d3955cab\",\n \"score\": \"0.5354711\",\n \"text\": \"private MMT(Board b, int depth, String mPlayer, boolean ifMax, int prevMove) {\\n\\t\\tboard = new Board(b);\\n\\t\\tmaxPlayer = mPlayer;\\n\\t\\tifMaxPlayer = ifMax;\\n\\t\\tparentMove = prevMove;\\n\\t\\t//fill in the children\\n\\t\\tchildLst = generateChildren(board, mPlayer, !ifMax, depth);\\n\\t\\t//assign value to node \\n\\t\\tvalue = getValue(this);\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cb53ea6d113bfca0a2f1be5f2c21eb43\",\n \"score\": \"0.5352335\",\n \"text\": \"int getTemporaryMaxDepth();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5da75c877236ecff54f01d7269513799\",\n \"score\": \"0.53393066\",\n \"text\": \"private NewMove findBestMove(ChessGameNode node, char player ) {\\r\\n\\t\\tChessGameNode[] childrenNodes = node.getChildren();\\r\\n\\t\\tint currentValue = this.rootNode.getValue();\\r\\n\\t\\tint bestValue = 0;\\r\\n\\t\\tNewMove bestMove = null;\\r\\n\\t\\tfor( ChessGameNode childNode : childrenNodes) {\\r\\n\\t\\t\\tif (childNode != null) {\\r\\n\\t\\t\\t\\tif (player == 'w') {\\r\\n\\t\\t\\t\\t\\tif (childNode.getValue() >= currentValue) {\\r\\n\\t\\t\\t\\t\\t\\tbestValue = childNode.getValue();\\r\\n\\t\\t\\t\\t\\t\\tbestMove = childNode.getOriginalMove();\\r\\n\\t\\t\\t\\t\\t}\\r\\n\\t\\t\\t\\t} else if (player == 'b') {\\r\\n\\t\\t\\t\\t\\tif (childNode.getValue() <= currentValue) {\\r\\n\\t\\t\\t\\t\\t\\tbestValue = childNode.getValue();\\r\\n\\t\\t\\t\\t\\t\\tbestMove = childNode.getOriginalMove();\\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 bestMove;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ed4e523de809e6d6e64c0812f07bd78c\",\n \"score\": \"0.53221726\",\n \"text\": \"public MoveNode getMinimaxMove() {\\n return minimaxMove;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"9181e417a4fda009ac49e7c3bb9ef9f9\",\n \"score\": \"0.53155243\",\n \"text\": \"public static PlayerMove alphaBeta(int depth, int alpha, int beta, PossibleMove move, ArrayList<Player> listOfPlayers, int player) {\\n PlayerMove newMove;\\r\\n PlayerMove bestMove = null;\\r\\n System.out.println(\\\"Player: \\\" + player);\\r\\n Player currentPlayer = listOfPlayers.get(player);\\r\\n ArrayList<PossibleMove> possibleMoveList = BoardAIBlackController.getPossibleMoves(currentPlayer);\\r\\n int bestValue;\\r\\n\\r\\n if (isMaxDepth(depth)) {\\r\\n Piece newPiece = move.getPiece();\\r\\n System.out.println(\\\"New moveX: \\\" + move.getNewXPost() + \\\" New move Y: \\\" + move.getNewYPost());\\r\\n int newXPost = move.getNewXPost();\\r\\n int newYPost = move.getNewYPost();\\r\\n System.out.println(\\\"NewXPost: \\\" + newXPost + \\\"NewYPost \\\" + newYPost);\\r\\n System.out.println(\\\"OldXPost: \\\" + move.getPiece().getOldX() + \\\" OldYPost: \\\" + move.getPiece().getOldY());\\r\\n// newPiece.setLayoutX(newXPost * 100);\\r\\n// newPiece.setLayoutY(newYPost * 100);\\r\\n System.out.println(newPiece.getLayoutX());\\r\\n System.out.println(newPiece.getLayoutY());\\r\\n int fitnessValue = BoardAIBlackController.evaluatePiece(currentPlayer, newPiece, move.getNewXPost(), move.getNewYPost());\\r\\n System.out.println(\\\"Fitness value of move is: \\\" + fitnessValue);\\r\\n System.out.println(move.getNewXPost() + \\\" \\\" + move.getNewYPost());\\r\\n newMove = new PlayerMove(currentPlayer, move, fitnessValue);\\r\\n// System.out.println(newMove.toString());\\r\\n return newMove;\\r\\n }\\r\\n\\r\\n for (int i = 0; i < possibleMoveList.size() - 1; i++) {\\r\\n //Maximizing player\\r\\n if (player == 1) {\\r\\n //Initialize current best move\\r\\n bestMove = new PlayerMove(currentPlayer, move, MIN);\\r\\n\\r\\n System.out.println(\\\"Who is the player: \\\" + currentPlayer);\\r\\n newMove = alphaBeta(depth - 1, alpha, beta, possibleMoveList.get(i), listOfPlayers, Math.abs(player - 1));\\r\\n bestMove.setFitnessValue(Math.max(bestMove.getFitnessValue(), newMove.getFitnessValue()));\\r\\n System.out.println(\\\"Current Alpha: \\\" + alpha + \\\" Current BestMove: \\\" + bestMove.getFitnessValue() + \\\" Current Beta: \\\" + beta);\\r\\n \\r\\n alpha = Math.max(alpha, bestMove.getFitnessValue());\\r\\n \\r\\n //Pruning\\r\\n if (beta <= alpha) {\\r\\n System.out.println(\\\"Prunned\\\");\\r\\n break;\\r\\n }\\r\\n } //Minimizing player\\r\\n else {\\r\\n //Initialize current best move\\r\\n bestMove = new PlayerMove(currentPlayer, move, MAX);\\r\\n System.out.println(\\\"Who is the player: \\\" + currentPlayer);\\r\\n newMove = alphaBeta(depth - 1, alpha, beta, possibleMoveList.get(i), listOfPlayers, Math.abs(player + 1));\\r\\n bestMove.setFitnessValue(Math.max(bestMove.getFitnessValue(), newMove.getFitnessValue()));\\r\\n beta = Math.max(alpha, bestMove.getFitnessValue());\\r\\n\\r\\n //Pruning\\r\\n if (beta <= alpha) {\\r\\n break;\\r\\n }\\r\\n }\\r\\n }\\r\\n return bestMove;\\r\\n\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"18b2fe3858c79ceaa708fb1287db1a96\",\n \"score\": \"0.53125644\",\n \"text\": \"public double minValue(S state, P player, double alpha, double beta, int depth) {\\n updateMetrics(depth);\\n if (game.isTerminal(state) || depth >= currDepthLimit || timer.timeOutOccurred()) {\\n return eval(state, player);\\n } else {\\n double value = Double.POSITIVE_INFINITY;\\n for (A action : orderActions(state, game.getActions(state), player, depth)) {\\n value = Math.min(value, maxValue(game.getResult(state, action), //\\n player, alpha, beta, depth + 1));\\n if (value <= alpha)\\n return value;\\n beta = Math.min(beta, value);\\n }\\n return value;\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"beb2dae27577c9168e327fdf07759238\",\n \"score\": \"0.531082\",\n \"text\": \"int getMaxLevel();\",\n \"title\": \"\"\n },\n {\n \"docid\": \"42d8d7eee2f2754d8812b45f75d844a9\",\n \"score\": \"0.5308122\",\n \"text\": \"public void actionPerformed(ActionEvent e) {\\n timer.stop();\\n //get all the available moves\\n ArrayList<Point> possibleMoves = getCurrentlyValidMoves();\\n canLastPlayerMove = false;\\n try {\\n //check if we can move\\n if( possibleMoves.size() == 0 ){\\n return;\\n }\\n //make an array to store the best moves available\\n ArrayList<Point> bestMoves = new ArrayList<Point>();\\n //the lower the level, the higher priority is assigned to the move\\n //a move of level 10 is the absolute lowest\\n //this heuristic follows the strategy I use, omitting situation-specific content\\n int level = 10;\\n for (Point p : possibleMoves) {\\n int x = (int) p.getX();\\n int y = (int) p.getY();\\n if ((x == 0 || x == 7) && (y == 0 || y == 7)) {\\n if (level > 0) {\\n bestMoves.clear();\\n level = 0;\\n }\\n bestMoves.add( p );\\n } else if (level >= 1 && (x == 0 || y == 0 || x == 7 || y == 7)) {\\n if (level > 1) {\\n bestMoves.clear();\\n level = 1;\\n }\\n bestMoves.add( p );\\n } else if (level >= 2 && (x > 2 && x < 6 && y > 2 && y < 6)) {\\n if ( level > 2) {\\n bestMoves.clear();\\n level = 2;\\n }\\n bestMoves.add( p );\\n } else if (level >= 3 && x != 1 && x != 6 && y != 1 && y != 6) {\\n if (level > 3) {\\n bestMoves.clear();\\n level = 3;\\n }\\n bestMoves.add(p);\\n } else if (level >= 4) {\\n bestMoves.add(p);\\n }\\n }\\n //for debugging purposes, output the level of move chosen by the ai\\n System.out.println(level);\\n //select a random move from the pool of best moves\\n Point move = bestMoves.get((int) (Math.random() * bestMoves.size()));\\n int aix = (int) move.getX();\\n int aiy = (int) move.getY();\\n //move there\\n attemptMove(aix, aiy);\\n gamepieces[aix][aiy] = currentPlayer;\\n //the ai moved, so this is true\\n canLastPlayerMove = true;\\n } finally { //if the ai moved or if it didn't\\n //change the player\\n currentPlayer = Color.WHITE;\\n gameFrame.repaint();\\n //if the human player has no moves left\\n if( getCurrentlyValidMoves().size() == 0 ){\\n if( canLastPlayerMove ){ //... and the ai could move\\n //switch players, enable the ai to move again in 1 second\\n currentPlayer = Color.BLACK;\\n timer.start();\\n }else{ //... and the ai couldn't move\\n gameOver();\\n }\\n }\\n }\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"ef16f9b49c5e21246c7ddd88d83e33cd\",\n \"score\": \"0.5304071\",\n \"text\": \"public int minValue(BoardState state, int maxDepth, int currentDepth, int alpha, int beta) {\\n\\t\\tif (currentDepth == 0)\\r\\n\\t\\t\\treturn sbe(state);\\r\\n\\r\\n\\t\\t// initializing variable to the maximum possible value\\r\\n\\t\\tint v = Integer.MAX_VALUE;\\r\\n\\r\\n\\t\\tfor (int i = 0; i <= 5; i++) {\\r\\n\\t\\t\\t\\r\\n\\t\\t\\t// checks for the legal move\\r\\n\\t\\t\\tif (state.isLegalMove(2, i)) {\\r\\n\\t\\t\\t\\t\\r\\n\\t\\t\\t\\t// updating our max value to v\\r\\n\\t\\t\\t\\tv = Math.min(v, maxValue(state.applyMove(2, i), maxDepth, currentDepth - 1, alpha, beta));\\r\\n\\r\\n\\t\\t\\t\\t// updating beta is a new min is found\\r\\n\\t\\t\\t\\tbeta = Math.min(beta, v);\\r\\n\\r\\n\\t\\t\\t\\t//pruning\\r\\n\\t\\t\\t\\tif (beta <= alpha)\\r\\n\\t\\t\\t\\t\\tbreak;\\r\\n\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\tif (v == Integer.MAX_VALUE) {\\r\\n\\t\\t\\treturn sbe(state);\\r\\n\\t\\t}\\r\\n\\t\\treturn v;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6a62d3b7c2966fed1077776457c8aa41\",\n \"score\": \"0.53015184\",\n \"text\": \"@Test\\r\\n public void testMaxDouble() {\\r\\n Player player = new Player();\\r\\n int expResult = -1;\\r\\n int result = player.maxDouble();\\r\\n assertEquals(expResult, result);\\r\\n \\r\\n Stack stack=new Stack(false);\\r\\n player.setHand(stack.drawTiles(28));\\r\\n int expResult2=6;\\r\\n int result2=player.maxDouble();\\r\\n assertEquals(expResult2, result2);\\r\\n \\r\\n \\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"933b36327eff28acc8306c9cbf845e98\",\n \"score\": \"0.52934074\",\n \"text\": \"private static int evalState(GameState state){\\n Move m = state.getMove();\\n int counter = 0;\\n\\n // return directly if we encouter win or loss\\n if(m.isXWin()){\\n return 10000;\\n }\\n else if(m.isOWin()){\\n return -1;\\n }\\n\\n Vector<Integer> points = new Vector<Integer>();\\n points.setSize(state.BOARD_SIZE*2+2);\\n int player;\\n Collections.fill(points, 1);\\n int scaling = 4;\\n int value = 0;\\n\\n for(int row = 0; row < state.BOARD_SIZE; row ++){\\n for(int col = 0; col < state.BOARD_SIZE; col ++){\\n player = state.at(row, col);\\n\\n // add points to the vector, increase by a factor for every new entry\\n if(player == 1){\\n points.set(row, points.get(row)*scaling);\\n points.add(state.BOARD_SIZE + col, points.get(state.BOARD_SIZE - 1 + col)*scaling);\\n\\n // if it's in the first diagonal\\n if(counter%state.BOARD_SIZE+1 == 0){\\n points.add(state.BOARD_SIZE*2, points.get(state.BOARD_SIZE*2)*scaling);\\n }\\n\\n // checking other diagonal\\n if(counter%state.BOARD_SIZE-1 == 0 && row+col != 0){\\n points.add(state.BOARD_SIZE*2 + 1, points.get(state.BOARD_SIZE*2)*scaling);\\n }\\n }\\n // if an enemy player is encoutered null the value of the row/col\\n else if(player == 2){\\n points.set(row, 0);\\n points.set(state.BOARD_SIZE + col, 0);\\n if(counter%state.BOARD_SIZE+1 == 0){\\n points.add(state.BOARD_SIZE*2, 0);\\n }\\n if(counter%state.BOARD_SIZE-1 == 0){\\n points.add(state.BOARD_SIZE*2 + 1, 0);\\n }\\n }\\n counter++;\\n }\\n }\\n\\n // if we have nulled the point we don't count it for the value of the state\\n for(Integer i: points){\\n if(i > 1){\\n value += i;\\n }\\n }\\n //System.err.println(\\\"Value: \\\" + value);\\n return value;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4a945850e99d939990b5753e7ec057ac\",\n \"score\": \"0.5291221\",\n \"text\": \"public int determineHighestVal() {\\n if (playerCards[0].value > playerCards[1].value) {\\n return playerCards[0].value;\\n }\\n return playerCards[1].value;\\n\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d4ce3a42095ed163ad7f7b30c89b7b90\",\n \"score\": \"0.52669233\",\n \"text\": \"private int recursiveSearchCurrentPlayer(int maxDepth, int depth, GameState gs, Player currentPlayer, Board b,\\r\\n\\t\\t\\tMoveTracker mt) {\\r\\n\\t\\tif (maxDepth == depth) {\\r\\n\\t\\t\\treturn bEval.getEvaluation(currentPlayer, b, mt);\\r\\n\\t\\t} else if (depth != 0) {\\r\\n\\t\\t\\tMove mv = nextStep(gs, currentPlayer, b, mt);\\r\\n\\t\\t\\tif (mv == null) { // current player is in checkmate or stalemate\\r\\n\\t\\t\\t\\treturn Integer.MIN_VALUE;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tBoard newBoard = b.cloneBoard();\\r\\n\\t\\t\\tRules.move(gs, currentPlayer, newBoard, mt, null, mv);\\r\\n\\t\\t\\treturn recursiveSearchOppositePlayer(maxDepth, depth + 1, gs.cloneGameState(), currentPlayer, newBoard, mt.cloneMoveTracker());\\r\\n\\t\\t} else {\\r\\n\\t\\t\\treturn recursiveSearchOppositePlayer(maxDepth, depth + 1, gs.cloneGameState(), currentPlayer, b.cloneBoard(), mt.cloneMoveTracker());\\r\\n\\t\\t}\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4c3313cab9c1c315771635e317e8be22\",\n \"score\": \"0.524731\",\n \"text\": \"public int getExperienceToNextLevel() {\\n\\t\\treturn (int)(Math.sqrt(level)*2*(level*level));\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e4c0e28be86d215ab5a724e780348a45\",\n \"score\": \"0.524697\",\n \"text\": \"private int minValue(Node state, int alpha, int beta) {\\n\\t\\t\\n\\t\\tthis.nodesExplored++;\\n\\t\\tthis.nodesExploredThisTurn++;\\n\\t\\t\\n\\t\\tif (this.cutoffTest(state)) {\\n\\t\\t\\treturn state.eval(this.player);\\n\\t\\t}\\n\\t\\t\\n\\t\\t\\n\\t\\tArrayList<Move> legalMoves = state.getGame().getLegalMoves();\\n\\t\\t\\n\\t\\tif (this.moveOrdering) {\\n\\t\\t\\tthis.quickSort(state, legalMoves, 0, legalMoves.size() - 1, true);\\n\\t\\t}\\n\\t\\t\\n\\t\\tint v = Integer.MAX_VALUE;\\n\\t\\tMove bestMove = null;\\n\\t\\tfor (Move move : legalMoves) {\\n\\n\\t\\t\\tif (System.currentTimeMillis() - startMili > this.maxTime * 1000)\\n\\t\\t\\t\\treturn 0;\\n\\t\\t\\t\\n\\t\\t\\tint value = this.maxValue(state.result(move), alpha, beta);\\n\\t\\t\\tif (v > value) { //\\n\\t\\t\\t\\tv = value;\\n\\t\\t\\t\\tbestMove = move;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif (v <= alpha) {\\n\\t\\t\\t\\tstate.setBestMove(bestMove);\\n\\t\\t\\t\\treturn v;\\n\\t\\t\\t}\\n\\t\\t\\tbeta = Math.min(v, beta);\\n\\t\\t}\\n\\t\\tstate.setBestMove(bestMove);\\n\\t\\treturn v;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"a94294e62cc2ddbb3acce536535adc4d\",\n \"score\": \"0.5240496\",\n \"text\": \"private int evaluateChildren() {\\n if (PRINT_PROGRESS) {\\n System.out.println(\\\"Evaled:\\\"+boardsEvaluated);\\n }\\n if (this.children == null || this.children.isEmpty()) { // Exit case: Node is a leaf\\n return evaluateBoard(this.board);\\n }\\n \\n int bestEval = Integer.MIN_VALUE;\\n for (final BoardTree child : this.children) {\\n child.evaluation = child.evaluateChildren();\\n if (child.evaluation > bestEval) {\\n bestEval = child.evaluation;\\n }\\n }\\n return bestEval;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"22e94b56c1585bd967339e1afc7ecc1e\",\n \"score\": \"0.5232771\",\n \"text\": \"public int makeAIMove(Player player) {\\n\\t\\tint input = -1;\\n\\t\\tboolean validMove = false;\\n\\n\\t\\tSystem.out.println(\\\"Current player is: \\\" + player.color);\\n\\n\\t\\t// Get all the valid moves if there are any\\n\\t\\tArrayList<ArrayList<Integer>> validMoves = getValidMoves(board, player.color);\\n\\t\\tprintValidMoves(validMoves, board);\\n\\t\\t// As long as the input isn't correct, this will loop\\n\\t\\twhile (validMove == false) {\\n\\t\\t\\t// Check if there are any possible moves\\n\\t\\t\\tif (!validMoves.isEmpty()) {\\n\\t\\t\\t\\t// Als er een blocking move gedaan kan worden, wordt dit gedaan. Dit heeft\\n\\t\\t\\t\\t// nummer 1 prioriteit.\\n\\t\\t\\t\\tint blockMove = player.ai.blockingMove(validMoves, board, player);\\n\\t\\t\\t\\tif (blockMove != -1) {\\n\\t\\t\\t\\t\\tinput = blockMove;\\n\\t\\t\\t\\t\\t// Random zet, gebeurt op dit moment nooit\\n\\t\\t\\t\\t} else if (turn < 0) {\\n\\t\\t\\t\\t\\tinput = player.ai.random(board, player);\\n\\t\\t\\t\\t\\t// Zet gebaseerd op boardweight, gebeurt op dit moment nooit\\n\\t\\t\\t\\t} else if (turn < 0) {\\n\\t\\t\\t\\t\\tinput = player.ai.boardWeighting(board, player);\\n\\t\\t\\t\\t\\t// Minimax, 8 diep, gebeurt tussen beurt 0 en 30\\n\\t\\t\\t\\t} else if (turn < 30) {\\n\\t\\t\\t\\t\\tinput = player.ai.minimaxAvailableMoves(board, player, 0, 8, 0, 0, Integer.MIN_VALUE,\\n\\t\\t\\t\\t\\t\\t\\tInteger.MAX_VALUE, 0);\\n\\t\\t\\t\\t\\t// Minimax, 9 diep, gebeurt tussen beurt 30 en 40\\n\\t\\t\\t\\t} else if (turn < 40) {\\n\\t\\t\\t\\t\\tinput = player.ai.minimaxAvailableMoves(board, player, 0, 9, 0, 0, Integer.MIN_VALUE,\\n\\t\\t\\t\\t\\t\\t\\tInteger.MAX_VALUE, 0);\\n\\t\\t\\t\\t\\t// Minimax, 10 diep, gebeurt tussen beurt 40 en 45\\n\\t\\t\\t\\t} else if (turn < 45) {\\n\\t\\t\\t\\t\\tinput = player.ai.minimaxAvailableMoves(board, player, 0, 10, 0, 0, Integer.MIN_VALUE,\\n\\t\\t\\t\\t\\t\\t\\tInteger.MAX_VALUE, 0);\\n\\t\\t\\t\\t\\t// Minimax, 16 diep, gebeurt tussen beurt 45 en 60\\n\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\tinput = player.ai.minimaxTest(board, player, 0, 16, 0, 0, Integer.MIN_VALUE, Integer.MAX_VALUE, 0);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t// Voer de move die gevonden is uit.\\n\\t\\t\\t\\tvalidMove = setMove(input, validMoves, player.color, board);\\n\\n\\t\\t\\t\\tif (validMove == true) {\\n\\t\\t\\t\\t\\tturn++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t// Reset noWinnerCount\\n\\t\\t\\t\\tnoWinnerCount = 0;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\t// 1 player can't move, if this counter reaches 2, that means both players can't\\n\\t\\t\\t\\t// move and the game will end\\n\\t\\t\\t\\tnoWinnerCount++;\\n\\t\\t\\t\\tSystem.out.println(\\\"Out of moves + Count = \\\" + noWinnerCount);\\n\\t\\t\\t\\tvalidMove = true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t// Input is last player player\\n\\t\\tArrayList<ArrayList<Integer>> validMovesOpponent = getValidMoves(board, player.opponent);\\n\\t\\tif (validMovesOpponent.size() > 0) {\\n\\t\\t\\tswitchTurn(player);\\n\\t\\t}\\n\\n\\t\\treturn input;\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"2d8833f7d69dcf8ba7e83f729d1313c1\",\n \"score\": \"0.5229196\",\n \"text\": \"private Move getBestMove(Node node) {\\n Move bestMove = null;\\n double best_val = Integer.MIN_VALUE;\\n for (Node child : node.getChildren()) {\\n double payOff = (child.getPlays() == 0) ? 0 : (child.getWins() / child.getPlays());\\n if (child.getPlays() == 0) {\\n System.out.println(\\\"No records for play: \\\" + \\\"oldRow: \\\" + child.getState().getMove().oldRow + \\\", oldCol: \\\"\\n + child.getState().getMove().oldCol + \\\", newRow: \\\" + child.getState().getMove().newRow + \\\", newCol: \\\" +\\n child.getState().getMove().newCol + \\\", board: \\\" + Arrays.deepToString(child.getState().getBoard()));\\n } else {\\n System.out.println(\\\"payOff: \\\" + payOff + \\\", play: \\\" + \\\"oldRow: \\\" + child.getState().getMove().oldRow + \\\", oldCol: \\\"\\n + child.getState().getMove().oldCol + \\\", newRow: \\\" + child.getState().getMove().newRow + \\\", newCol: \\\" +\\n child.getState().getMove().newCol + \\\", plays: \\\" + child.getPlays() + \\\", wins: \\\" + child.getWins());\\n }\\n if (payOff > best_val) {\\n best_val = payOff;\\n bestMove = child.getState().getMove();\\n }\\n }\\n System.out.println();\\n return bestMove;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5d645591ad1aa1e70dfd1c8eda4b13b9\",\n \"score\": \"0.52251637\",\n \"text\": \"public Action getBestAction() {\\n long startTime = System.currentTimeMillis();\\n\\n // Continue iterating through the search algorithm until the time limit\\n // is reached\\n while (System.currentTimeMillis() < startTime + timeLimit) {\\n Node newNode = selectAndExpandNewNode();\\n double randomPlayout = simulateRandomPlayout(newNode);\\n backPropagate(newNode, randomPlayout);\\n }\\n\\n // Technically this function will take us slightly over timeLimit, but\\n // that's why a buffer is removed from timeLimit when passed to this\\n // class\\n return bestActionFromFinishedTree();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"5a8175947012594a728806c64462fddf\",\n \"score\": \"0.52205276\",\n \"text\": \"@Override\\n\\tpublic double stateEvaluator(GameState s)\\n\\t{\\r\\n\\t\\tint count = 0;\\n\\t\\tif (s.takenList[1] == 0)\\r\\n\\t\\t{\\r\\n\\t\\t\\treturn 0;\\r\\n\\t\\t}\\r\\n\\t\\telse if(s.lastMove == 1)\\r\\n\\t\\t{\\r\\n\\t\\t\\tfor (int i = 1; i < s.takenList.length ; i++)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tif (s.takenList[i] == 0)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tcount++;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tif (count % 2 == 0)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\treturn -0.5;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse \\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\treturn 0.5;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\telse if (isPrime(s.lastMove))\\r\\n\\t\\t{\\r\\n\\t\\t\\tfor (int i = 1; i < s.takenList.length; i++)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tif (s.takenList[i] == 0 && i % s.lastMove == 0) // i = 4, % 2\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tcount++;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tif (count % 2 == 0)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\treturn -0.7;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\treturn 0.7;\\r\\n\\t\\t\\t}\\r\\n\\t\\t}\\r\\n\\t\\telse \\r\\n\\t\\t{\\r\\n\\t\\t\\tint largestPrime = 2;\\r\\n\\t\\t\\tfor (int i = 2; i < (s.lastMove/2); i++)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tif (s.lastMove % i == 0 && isPrime(i))\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tlargestPrime = i;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tfor (int i = largestPrime; i <= s.lastMove; i+= largestPrime)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\tif (s.takenList[i] == 0)\\r\\n\\t\\t\\t\\t{\\r\\n\\t\\t\\t\\t\\tcount++;\\r\\n\\t\\t\\t\\t}\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\tif (count % 2 == 0)\\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\treturn -0.6;\\r\\n\\t\\t\\t}\\r\\n\\t\\t\\telse \\r\\n\\t\\t\\t{\\r\\n\\t\\t\\t\\treturn 0.6;\\r\\n\\t\\t\\t}\\r\\n\\r\\n\\t\\t}\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"486b744f7d59d129bdeb8de148cfbf33\",\n \"score\": \"0.52149224\",\n \"text\": \"public static int run(State curr_state, char player) {\\n\\t\\tint result = 0;\\r\\n\\t\\t//Calls the max_value part because dark plays first, wants max value\\r\\n\\t\\tif(player == '1'){\\r\\n\\t\\t\\t//Returns number of times the max function runs\\r\\n\\t\\t\\tresult = max_value(curr_state);\\r\\n\\t\\t}\\r\\n\\t\\t//Start at min, as light's turn, and it wants min value and\\r\\n\\t\\t//therefore subsequently will call min_value nd return\\r\\n\\t\\telse if(player == '2'){\\r\\n\\t\\t\\tresult = min_value(curr_state);\\t\\r\\n\\t\\t}\\r\\n\\t\\t//Return the number of states , i.e., minCounter + max Counter\\r\\n\\t\\t//Return minCounter + maxCounter;\\r\\n\\t\\treturn result;\\r\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"b96d422c588659f00c7c4143cca06a61\",\n \"score\": \"0.5212186\",\n \"text\": \"@Override\\r\\n public int getSpecialValue() {\\n int num = this.getCombatLevel();\\r\\n num += this.levelChangeAgainstCultistPlayer;\\r\\n \\r\\n return num;\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d856d8ef20756c79667616cc3f12c3d5\",\n \"score\": \"0.52117634\",\n \"text\": \"public Action getActionBasedOnValueEpsilonGreedy(final State state, final double epsilon) {\\r\\n final double decision = Math.random();\\r\\n final List<Action> allActions = new LinkedList<Action>();\\r\\n final List<Action> bestActions = new LinkedList<Action>();\\r\\n double bestValue = Integer.MIN_VALUE;\\r\\n\\r\\n // Determine the best action(s)\\r\\n for (final Map.Entry<Action, Double> actionValue : getProperties(state).getActionValues().entrySet()) {\\r\\n final Action action = actionValue.getKey();\\r\\n final double value = actionValue.getValue();\\r\\n\\r\\n allActions.add(action);\\r\\n\\r\\n if (value > bestValue) {\\r\\n bestActions.clear();\\r\\n bestValue = value;\\r\\n }\\r\\n if (value >= bestValue) {\\r\\n bestActions.add(action);\\r\\n }\\r\\n }\\r\\n\\r\\n if (decision > epsilon || allActions.size() == bestActions.size()) {\\r\\n // Pick a best action\\r\\n return bestActions.get((int) Math.floor(Math.random() * bestActions.size()));\\r\\n } else {\\r\\n // Pick a non-best action for exploration\\r\\n for (final Action bestAction : bestActions) {\\r\\n allActions.remove(bestAction);\\r\\n }\\r\\n return allActions.get((int) Math.floor(Math.random() * allActions.size()));\\r\\n }\\r\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"d9f19351964e2cf9a507ce346b4d8895\",\n \"score\": \"0.5209583\",\n \"text\": \"public int nextAction() {\\n double w = random.nextDouble();\\n for (int i = 0; i < nMoves; i++) {\\n if (w < probabilities[i]) {\\n lastMove = i;\\n break;\\n }\\n w -= probabilities[i];\\n }\\n nIters++;\\n\\n if (N_SELECTED_ACTIONS > 1) {\\n lastNMoves.add(lastMove);\\n if (lastNMoves.size() > N_SELECTED_ACTIONS)\\n lastNMoves.poll();\\n }\\n\\n if (LOGGING && nIters % 1000 == 0) {\\n for (int i = 0; i < nMoves; i++)\\n logWriter.printf(\\\"%.8f;\\\", probabilities[i]);\\n logWriter.println();\\n logWriter.flush();\\n }\\n\\n return lastMove;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"6bffeff2cdade42977eba68ed82afbde\",\n \"score\": \"0.5205331\",\n \"text\": \"@Override\\n public Action getBestAction(Agent r, Maze m, QLearning q) {\\n double epsilon = 0.000001d;\\n ArrayList<Action> actions = m.getValidActions(r);\\n double[] actionValues = q.getActionValues(r.getState(m), actions);\\n\\n ArrayList<Action> bestActions = new ArrayList<>();\\n double maxValue = Double.MIN_VALUE;\\n\\n for (int i = 0; i < actionValues.length; i++)\\n {\\n if (actionValues[i] > maxValue)\\n {\\n bestActions = new ArrayList<>();\\n maxValue = actionValues[i];\\n bestActions.add(actions.get(i));\\n } else if (Math.abs(actionValues[i] - maxValue) < epsilon) {\\n bestActions.add(actions.get(i));\\n }\\n }\\n\\n Random rand = new Random();\\n return bestActions.get(rand.nextInt(bestActions.size()));\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"98fd58e946b070f50968c50581e00857\",\n \"score\": \"0.52010405\",\n \"text\": \"private int minimaxPlayerBlack(int depth, Player player, int alpha, int beta) {\\n if ((!playerCanMove(playerBlack) && !playerCanMove(playerWhite)) || depth > plyCutoff) {\\n return getHeuristic(playerBlack);\\n }\\n\\n ArrayList<MoveNode> moves = getAllMoves(player.getColor());\\n\\n if (moves.isEmpty()) {\\n return getHeuristic(playerBlack);\\n }\\n\\n ArrayList<Integer> scores = new ArrayList<>();\\n\\n Integer[][] savedBoard = new Integer[Board.MAX_ROW][Board.MAX_COLUMN];\\n\\n if (plyCutoff >= depth) {\\n copyBoard(savedBoard);\\n }\\n\\n for (int i = 0; i < moves.size(); i++) {\\n MoveNode move = moves.get(i);\\n\\n if (player.equals(playerBlack)) {\\n makeMoveFromMinimax(move);\\n\\n int currentScore = minimaxPlayerBlack(depth + 1, playerWhite, alpha, beta);\\n scores.add(currentScore);\\n\\n if (alphaBetaEnable) {\\n if (move.getMinimaxValue() > alpha) {\\n alpha = move.getMinimaxValue();\\n }\\n\\n if (beta <= alpha) {\\n break;\\n }\\n }\\n\\n if (depth == 0) {\\n move.setMinimaxValue(currentScore);\\n rootValues.add(move);\\n }\\n } else if (player.equals(playerWhite)) {\\n makeMoveFromMinimax(move);\\n\\n int currentScore = minimaxPlayerBlack(depth + 1, playerBlack, alpha, beta);\\n scores.add(currentScore);\\n\\n if (alphaBetaEnable) {\\n if (move.getMinimaxValue() < beta) {\\n beta = move.getMinimaxValue();\\n }\\n\\n if (alpha >= beta) {\\n break;\\n }\\n }\\n }\\n\\n resetBoard(savedBoard);\\n }\\n\\n if (player.equals(playerBlack)) {\\n return Collections.max(scores);\\n }\\n\\n return Collections.min(scores);\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"7cd9b33bbdb103734c9aae81070e346d\",\n \"score\": \"0.5187843\",\n \"text\": \"public Integer getMaxDepth() {\\n return this.maxDepth;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4d50f4d5081b1043d266d28111de4898\",\n \"score\": \"0.5187245\",\n \"text\": \"private float alphaBeta(Node n, int depth, double A, double B, int player) {\\n\\t\\t\\n\\t\\t// Only do a depth check for termination, as this implementation passes nodes that initially have empty\\n\\t\\t// successor moves (so we can't test for terminal node at this step)\\n\\t\\tif(depth == 0) {\\n\\t\\t\\tleaves++;\\n\\t\\t\\t\\n\\t\\t\\tfloat score = g_board.evaluate(player);\\n\\t\\t\\tn.setScore(score);\\n\\t\\t\\t\\n\\t\\t\\treturn score;\\n\\t\\t}\\n\\t\\t\\n\\t\\tif(n.getChildren() == null || n.getChildren().isEmpty()) {\\n\\t\\t\\t// Send the parent information to the move generator, which will recursively call A-B with the child information\\n\\t\\t\\treturn generateLegalMoves(n, depth, A, B, player);\\n\\t\\t} else {\\n\\t\\t\\t// If we have a pre-constructed tree already, we can run normal alphaBeta\\n\\t\\t\\tArrayList<Node> moves = n.getChildren();\\n\\t\\t\\t\\n\\t\\t\\t// White\\n\\t\\t\\tif(player == WHITE) {\\n\\t\\t\\t\\tdouble val = Double.NEGATIVE_INFINITY;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tfor(Node child : moves) {\\n\\t\\t\\t\\t\\tval = Math.max(val, alphaBeta(child, depth - 1, A, B, (BLACK)));\\n\\t\\t\\t\\t\\tA = Math.max(val, A);\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\treturn (float)val;\\n\\t\\t\\t// Black\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tdouble val = Double.POSITIVE_INFINITY;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tfor(Node child : moves) {\\n\\t\\t\\t\\t\\tval = Math.min(val, alphaBeta(child, depth - 1, A, B, (WHITE)));\\n\\t\\t\\t\\t\\tB = Math.min(val, B);\\n\\t\\t\\t\\t\\tif(A >= B) {\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\n\\t\\t\\t\\treturn (float)val;\\n\\t\\t\\t}\\n\\t\\t}\\t\\n\\t}\",\n \"title\": \"\"\n },\n {\n \"docid\": \"015353c1b60f24371f7ff4dcad605c19\",\n \"score\": \"0.5185909\",\n \"text\": \"public int getJumpMaxElevationChange() {\\n return getMaxElevation() -\\n getGame().getBoard().getHex(getFinalCoords()).getLevel();\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"f3d140e2366e24584afec163ad08bcc0\",\n \"score\": \"0.51842564\",\n \"text\": \"private int minMaxHelper(int alpha, int beta, int currDepth,\\n int cPlayerID, Moves move,\\n Point playerNewPos,\\n Point player1pos,\\n Point player2pos,\\n int scoreP1, int scoreP2) {\\n Point oppPlayer = player1pos;\\n if (cPlayerID == 1) {\\n oppPlayer = player2pos;\\n }\\n\\n if (gameState[playerNewPos.x][playerNewPos.y] == States.EMPTY) {\\n if (didCloseOffNewSpace(playerNewPos, move)) {\\n // calculate new opponent score (max of all possible opponent scores)\\n int opponentNewScore = 0;\\n int playerNewScore = findNumOpenSpots(playerNewPos)\\n Point[] adjPoints = getAdjacentPoints(oppPlayer);\\n for (int i = 0; i < adjPoints.length; i++) {\\n int tempAdjScore = findNumOpenSpots(adjPoints[i]);\\n opponentNewScore = opponentNewScore > tempAdjScore ? opponentNewScore : tempAdjScore;\\n }\\n\\n // set opponents new score\\n if (cPlayerID == 1) {\\n scoreP1 = playerNewScore;\\n scoreP2 = opponentNewScore;\\n } else {\\n scoreP1 = opponentNewScore;\\n scoreP2 = playerNewScore;\\n }\\n }\\n } else {\\n // spot is a player\\n if (playerNewPos.x == oppPlayer.x && playerNewPos.y == oppPlayer.y) {\\n return tyingScore;\\n }\\n // spot is a losing point\\n return losingScore;\\n }\\n\\n Point newPlayer1pos = player1pos;\\n Point newPlayer2pos = player2pos;\\n int nextPlayerID = 1;\\n // set pos of curr player and swap player\\n if (cPlayerID == 1) {\\n newPlayer1pos = playerNewPos;\\n nextPlayerID = 2;\\n } else {\\n newPlayer2pos = playerNewPos;\\n }\\n\\n if (cPlayerID == 1) {\\n gameState[playerNewPos.x][playerNewPos.y] = States.PLAYER1;\\n } else {\\n gameState[playerNewPos.x][playerNewPos.y] = States.PLAYER2;\\n }\\n\\n int nextScore = minMax(alpha, beta, currDepth-1, nextPlayerID, newPlayer1pos, newPlayer2pos, scoreP1, scoreP2);\\n\\n return nextScore;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"e5a04155a4277ffadd69aa8bd3082905\",\n \"score\": \"0.517708\",\n \"text\": \"private Move findBestMove(Piece player, Board board, int depth,\\n double cutoff) {\\n Board newBoard = new Board(board);\\n Move bestSoFar = newBoard.iterator().next();\\n Iterator<Move> moveIterator = board.iterator();\\n if (newBoard.piecesContiguous(player)) {\\n return bestSoFar;\\n } else if (newBoard.piecesContiguous(player.opposite())) {\\n return guessBestMove(player, newBoard, cutoff);\\n } else if (depth == 0) {\\n return guessBestMove(player, newBoard, cutoff);\\n }\\n while (moveIterator.hasNext()) {\\n Move nextMove = moveIterator.next();\\n newBoard.makeMove(nextMove);\\n int boardValue = eval(newBoard);\\n Move response = findBestMove(player.opposite(),\\n newBoard, depth - 1, -boardValue);\\n newBoard.makeMove(response);\\n int responseVal = eval(newBoard);\\n newBoard.retract();\\n newBoard.retract();\\n if (-responseVal > boardValue) {\\n boardValue = -responseVal;\\n bestSoFar = nextMove;\\n if (boardValue >= cutoff) {\\n break;\\n }\\n }\\n }\\n return bestSoFar;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bc60da47dd00efd8b2767f6f2ee55f54\",\n \"score\": \"0.51742315\",\n \"text\": \"PrioritizedMove getBestMoveFor(int player, int desiredLength);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"4e2a04e72b5da6374a1280dd5f87a256\",\n \"score\": \"0.51728344\",\n \"text\": \"public List<Integer> GetMoves(boolean growthMoves, boolean expandMoves, boolean captureMoves, int maxGrowthValue) {\\n List<Integer> moves = new ArrayList<>();\\n\\n if (Winner != PlayerType.Empty) {\\n return moves;\\n } else if (GetMoveTypeForTurn(Turn) == MoveType.AllGrow) {\\n moves.add(Constants.AllGrowMove);\\n } else {\\n for (int i = 0; i < 80; i++) {\\n // Grow existing tiles\\n if (growthMoves && ((Tiles[i] > 0 && Player == PlayerType.One) || (Tiles[i] < 0 && Player == PlayerType.Two)) && Math.abs(Tiles[i]) < maxGrowthValue) {\\n if (!Settings.AllowDormantVolcanoes || !Dormant[i]) {\\n moves.add(i);\\n }\\n }\\n\\n // Claim new tiles\\n if (expandMoves && Tiles[i] == 0) {\\n moves.add(i);\\n }\\n\\n // Capture enemy tiles\\n if (captureMoves) {\\n PlayerType opponent = Player == PlayerType.One ? PlayerType.Two : PlayerType.One;\\n if (Settings.AllowMagmaChamberCaptures &&\\n ((Tiles[i] > 0 && opponent == PlayerType.One) || (Tiles[i] < 0 && opponent == PlayerType.Two)) &&\\n Math.abs(Tiles[i]) <= Settings.MaxMagmaChamberLevel) {\\n moves.add(i);\\n }\\n if (Settings.AllowVolcanoCaptures &&\\n ((Tiles[i] > 0 && opponent == PlayerType.One) || (Tiles[i] < 0 && opponent == PlayerType.Two)) &&\\n Math.abs(Tiles[i]) > Settings.MaxMagmaChamberLevel) {\\n moves.add(i);\\n }\\n }\\n }\\n }\\n\\n if (moves.size() == 0) {\\n if (growthMoves && expandMoves & captureMoves && maxGrowthValue >= Settings.MaxVolcanoLevel) {\\n // There are no moves in this position\\n return moves;\\n } else {\\n return GetMoves(true, true, true, Settings.MaxVolcanoLevel);\\n }\\n }\\n\\n return moves;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"c4279e55ca8989995f48196e55758734\",\n \"score\": \"0.5168601\",\n \"text\": \"public static byte getMaxMoves() {\\n return MAX_MOVES;\\n }\",\n \"title\": \"\"\n },\n {\n \"docid\": \"bb6515c5dd5454403cd2fc6b53a7f41a\",\n \"score\": \"0.5160259\",\n \"text\": \"void setTemporaryMaxDepth(int depth);\",\n \"title\": \"\"\n },\n {\n \"docid\": \"cdc12a49153e7c44d3cf973eef154634\",\n \"score\": \"0.51587516\",\n \"text\": \"UAction nextAction() { What should we do next? Override this for custom AI.\\n //\\n updateSeenEntities();\\n UAction bestAction = null;\\n float bestUrgency = 0f;\\n int bc=0;\\n for (UBehavior behavior : behaviors) {\\n bc++;\\n UAction action = behavior.getAction(this);\\n if (action != null) {\\n if (bestAction == null) {\\n bestAction = action;\\n bestUrgency = behavior.getCurrentUrgency();\\n } else if (behavior.getCurrentUrgency() > bestUrgency) {\\n bestAction = action;\\n bestUrgency = behavior.getCurrentUrgency();\\n }\\n }\\n }\\n return bestAction;\\n }\",\n \"title\": \"\"\n }\n]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":9853,"numItemsPerPage":100,"numTotalItems":995064,"offset":985300,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3OTQxMjUzNiwic3ViIjoiL2RhdGFzZXRzL250aGFrdXIvY29ybnN0YWNrLWphdmEtdjEtdGV2YXRyb24tMU0iLCJleHAiOjE3Nzk0MTYxMzYsImlzcyI6Imh0dHBzOi8vaHVnZ2luZ2ZhY2UuY28ifQ.UGL9aovqfhpX6hUGGex3q5sqfjlkEOa3_wzSXoxObC75W9AIYxQJLR42e9GgryODCpDCMRrukaZ1ATw_HbYRAQ","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":995064,"numBytesParquet":17569818855}]},"discussionsStats":{"closed":0,"open":0,"total":0},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
query_id stringlengths 32 32 | query stringlengths 7 129k | positive_passages listlengths 1 1 | negative_passages listlengths 88 101 |
|---|---|---|---|
4216a64588b38171298591c162a254da | / 265: / 266: | [
{
"docid": "a288dd3301d3b9f614252b91e69d1a5e",
"score": "0.0",
"text": "public SSLParameters getSSLParameters()\r\n/* 267: */ {\r\n/* 268:273 */ return this.engine.getSSLParameters();\r\n/* 269: */ }",
"title": ""
}
] | [
{
"docid": "5c806bfd66d858ecdc6fbee7bd89db16",
"score": "0.60549027",
"text": "static int H (String chave) {\n int c= ((int) chave.charAt(1))*100 + ((int) chave.charAt(0));\n double d=OURO*c;\n //return c % m;\n return (int) ((d- Math.floor(d)) * m);\n }",
"title": ""
},
{
"docid": "9716... |
84ff18aaaaab611fc182dc0eef85f12d | Sets the completeTime value for this WorkOrdersEntity. | [
{
"docid": "4947cfa0c09eb84b4ef2bc475514fea9",
"score": "0.76350516",
"text": "public void setCompleteTime(java.lang.String completeTime) {\n this.completeTime = completeTime;\n }",
"title": ""
}
] | [
{
"docid": "86fcc8c8542a79c57b837d61858c9028",
"score": "0.78241515",
"text": "public void setCompleteTime(Date completeTime) {\n this.completeTime = completeTime;\n }",
"title": ""
},
{
"docid": "818f40dfbdd8b459ba0e0d3d0d333c8a",
"score": "0.7815619",
"text": "public void... |
ce00efe83592b9a0f5cb5bd35e1eb0d4 | Leads Method to get all leads | [
{
"docid": "c27d3d3538dba71eab4fba9c65c6f334",
"score": "0.6314119",
"text": "public LeadList getLeads(String facility_id, Options options) {\n String json = \"\";\n\n try {\n json = forward(\"GET\", facility_id + \"/leads\" + load(options), null);\n } catch (Exception e)... | [
{
"docid": "8e1a46bc80c620b264a81c8699d6c3f7",
"score": "0.6344061",
"text": "@Override\n public List<Lesson> findLessons() {\n System.out.println(\"..........DemoService..........findLessons.........\");\n List<Lesson> list;\n List<Refund> listr;\n\n try {\n li... |
9a04fe5249684cba2d761c5cc472697e | Creates new form UpdaterFrame | [
{
"docid": "13517205d2a92fb4d46880a56cd616e7",
"score": "0.7325064",
"text": "public UpdaterFrame() {\n initComponents ();\n pack ();\n center();\n }",
"title": ""
}
] | [
{
"docid": "abf20ed9fb1218926e5297a36ef3bec9",
"score": "0.65261894",
"text": "public UpdateFrame() {\n\t\tinitComponents();\n\t\tthis.setResizable(false);\n\t}",
"title": ""
},
{
"docid": "848d6b2564dd0a7a3fdd753c0839ac89",
"score": "0.63214916",
"text": "public CreateFrame() {\n ... |
7e7b11188a96543832d6097532a063ea | This method identifies whether the map has the data with daraitemId or not. | [
{
"docid": "e8b2397ba305f344a93a257c8225696b",
"score": "0.79662013",
"text": "public boolean contain(int dataitemId) {\r\n return map.containsKey(dataitemId);\r\n }",
"title": ""
}
] | [
{
"docid": "93bbdb70a9f29e826f30cc1383148bb2",
"score": "0.6784585",
"text": "boolean hasItemId();",
"title": ""
},
{
"docid": "93bbdb70a9f29e826f30cc1383148bb2",
"score": "0.6784585",
"text": "boolean hasItemId();",
"title": ""
},
{
"docid": "93bbdb70a9f29e826f30cc138314... |
4186fab2b5c98c605fd46abebd7482a3 | [UC1136] Inserir Contrato de Parcelamento por Cliente Filtra os Usuarios por Id ou Nome para ser utilizado no Autocomplete | [
{
"docid": "acbb5c91316b50db8d4a67d26b01ebe8",
"score": "0.64055026",
"text": "public Collection filtrarAutocompleteUsuario(String valor)throws ControladorException;",
"title": ""
}
] | [
{
"docid": "ccf413a941177118900cdd5ea4f4002f",
"score": "0.6499044",
"text": "private void pesquisarUsuario() {\n try {\n String result = dao.selecionaUsuario(Integer.parseInt(tfCod.getText()));\n tfNome.setText(result);\n if (result.length() > 0) {\n ... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "54ac12dbeaf32cada319239d8fd49462",
"score": "0.0",
"text": "public void onClick(DialogInterface dialog, int which) {\n\t\t\t\tToast.makeText(getApplicationContext(), \"Close Clicked\", Toast.LENGTH_SHORT).show();\r\n\t\t\t}",
"title": ""
}
] | [
{
"docid": "1acc57d42c31dee937ac33ea6f2a5b0b",
"score": "0.68399656",
"text": "@Override\r\n\tpublic void comer() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "118f2b8a20f48999973063ac332d07d3",
"score": "0.6563993",
"text": "@Override\r\n\t\t\tpublic void atras() {\n\r\n\t\t\t}",
... |
dcc4f469f8da3b400849db710dfa64fb | Constructs a default Triangle object with color, filled, sideA, sideB, and sideC value | [
{
"docid": "b81ead89dc090270fe0c7ef6dcafd730",
"score": "0.7253769",
"text": "public ComparableTriangle(String color, boolean filled,\r\n double sideA, double sideB, double sideC) {\r\n super();\r\n this.sideA = sideA;\r\n this.sideB = sideB;\r\n this.sideC = sideC... | [
{
"docid": "d33bb939d91d65d3767e6d52a5b16b3f",
"score": "0.7309381",
"text": "public Triangle() {\r\n\t\t triangleType = new String(\"Unset\");\t\t\r\n\t}",
"title": ""
},
{
"docid": "acbab1780f21ca867698dac21dcb11e1",
"score": "0.72925556",
"text": "public Triangle() {\n heig... |
6075a44ecc4ac5ac7739d0bbd10c6903 | Gets the profile2.profile.entity.set.minimal list of properties that should be used in the minimal profile view. Returns default list of ProfileConstants.ENTITY_SET_MINIMAL if none. | [
{
"docid": "935ec2d7265056a426b4a94b23ea1a21",
"score": "0.6638182",
"text": "public List<String> getMinimalEntityConfigurationSet();",
"title": ""
}
] | [
{
"docid": "a8b42929d887be1879ca41538f74eb40",
"score": "0.5505762",
"text": "public Set<String> getProperties();",
"title": ""
},
{
"docid": "fa2eb2300850da6e8ee0c87ca1920f44",
"score": "0.52944",
"text": "public abstract Set<String> getProperties();",
"title": ""
},
{
"... |
7b439c4ab7ccf64f330f1e919b31ee62 | Sellers characteristics, generates cars | [
{
"docid": "95b103cb39794ea586fc3119e41a7695",
"score": "0.6195439",
"text": "protected void setup() {\n\t\tRandom rd = new Random();\n\t\tagreeableness = rd.nextInt(20);\n\t\tfor(iter = 0; iter < 10; iter++) {\n\t\t\tCar car = null;\n\t\t\ttry {\n\t\t\t\tcar = JsonLoader.GenerateCar();\n\t\t\t\tcar.car... | [
{
"docid": "4d51de2cfbb4e595d886baf25a13e63e",
"score": "0.7265112",
"text": "public void generateCars() {\r\n\t\tCar car;\r\n\r\n\t\tfor(short i=1; i<100; i++)\r\n\t\t{\r\n\t\t\tcar = new Car(i, true, predDomains, carContextFactory, factFactory);\r\n\t\t\tallCars.add(car);\r\n\t\t\tavailableCars.add(ca... |
39d9407841f45d1f892e82667edb4eda | Delete sessions (bulk) Delete message sessions, together with all nested messages, by given ID(s) or delete all message sessions. | [
{
"docid": "555868c4dc57f1211144c79f8f5ad7fd",
"score": "0.5529112",
"text": "public ApiResponse<Void> deleteMessageSessionsBulkWithHttpInfo(DeleteMessageSessionsBulkInputObject deleteMessageSessionsBulkInputObject) throws ApiException {\n com.squareup.okhttp.Call call = deleteMessageSessionsBulk... | [
{
"docid": "10938d90256b78e129247ca5b9eb3e4e",
"score": "0.614738",
"text": "public void deleteMessageSessionsBulk(DeleteMessageSessionsBulkInputObject deleteMessageSessionsBulkInputObject) throws ApiException {\n deleteMessageSessionsBulkWithHttpInfo(deleteMessageSessionsBulkInputObject);\n }... |
f786dcb40b9b7d2e4e47cc3edfaa455d | Get the raw token text | [
{
"docid": "d219f5ef86cb1a78ded30a8341b0a8cc",
"score": "0.0",
"text": "String getText();",
"title": ""
}
] | [
{
"docid": "e4edc6855ba12f8e536b44d92daa784c",
"score": "0.760641",
"text": "public String getToken() {\n return token.getPlainText();\n }",
"title": ""
},
{
"docid": "55ea9cce2cdcc62df0b42ca6b606fc6a",
"score": "0.7326302",
"text": "java.lang.String getToken();",
... |
d19379ae13e86ca263226d2f5947320c | int32 oneof_1531 = 1531; | [
{
"docid": "ef6f83d5fd9055f860c174528d51198a",
"score": "0.5295968",
"text": "int getOneof1531();",
"title": ""
}
] | [
{
"docid": "8e6e1fb5554302c4ea4f1fb00f513fe5",
"score": "0.63207495",
"text": "int getFixed32Value();",
"title": ""
},
{
"docid": "8e6e1fb5554302c4ea4f1fb00f513fe5",
"score": "0.63207495",
"text": "int getFixed32Value();",
"title": ""
},
{
"docid": "07aaff2f289111ce495e8d... |
c892abe19d7e5c5481b417c584aff051 | is the current node closed... Create an XmlWriter on top of an existing java.io.Writer. | [
{
"docid": "8510b38ec476dbb3e18eec91b982a2da",
"score": "0.59520453",
"text": "public XmlWriter(Writer writer) {\n this.writer = writer;\n this.closed = true;\n this.stack = new Stack();\n }",
"title": ""
}
] | [
{
"docid": "de332b76a4a0ad8a0dd0908455784fbe",
"score": "0.6389644",
"text": "public void close() throws XmlWriterException {\n if(!this.stack.empty()) {\n throw new XmlWriterException(\"Tags are not all closed. \"+\n \"Possibly, \"+this.stack.pop()+\" is unclosed. \");\... |
2d7d481121478712f99ff072b25773b8 | $ANTLR end T66 $ANTLR start T67 | [
{
"docid": "58fdc01dd57e82758a4ac4f8e2847e5f",
"score": "0.51464754",
"text": "public final void mT67() throws RecognitionException {\n try {\n int _type = T67;\n // ../com.emftriple.query.jpql.ui/src-gen/com/emftriple/query/ui/contentassist/antlr/internal/InternalJpql.g:60:... | [
{
"docid": "b5e923c4575e48798d5eaf2393ac8fcf",
"score": "0.5609418",
"text": "private int yyr67() {\n {\n yyrv = svExpr(new Binary(BinaryOp.AND, yysv[yysp-3].expr, yysv[yysp-1].expr, yysv[yysp-2].pos));\n }\n yysv[yysp-=3] = yyrv;\n return y... |
896279ec50eb9a3521b8e28835f94695 | List all possible failures, given the information about this pointcut. It's up to the FIState modelchecker and the server filter to decide which failures that we want to exercise later. All we want to do here is simply list all possible failures. | [
{
"docid": "56000a0e5a8c0fa1749d1d58d5e8f642",
"score": "0.6501012",
"text": "private static FailType[] listPossibleFailures(FMAllContext fac) {\n\n List<FailType> list = new ArrayList<FailType>();\n\n boolean crash = false;\n boolean exception = false;\n boolean corruption = false;\n boo... | [
{
"docid": "0f40a221ad9ebe4419115683a68600ac",
"score": "0.60467094",
"text": "public List whyFailed() {\n\n return failureReasons;\n\n }",
"title": ""
},
{
"docid": "9bf805ca6bd0e3175c4b9d4ee73eb6c1",
"score": "0.59361446",
"text": "java.lang.String getFailedactions();",
"ti... |
49588ff534426bdfff021bb39ffcb425 | Retrieves one of the static objects in this class by name. | [
{
"docid": "d2844bb68b7ed76f8aff8e3b9cc6be4e",
"score": "0.0",
"text": "public static AudioMediaType valueOf(String typeName)\n\t{\n\t\ttypeName = typeName.replaceAll(\"-\", \"_\").toUpperCase();\n\t\ttry {\n\t\t\tField f = AudioMediaType.class.getField(typeName);\n\t\t\tObject obj = f.get(null);\n\t\t\... | [
{
"docid": "fb1a885fda8647037a28e4ce3008d58b",
"score": "0.6155683",
"text": "Object get(String name);",
"title": ""
},
{
"docid": "7baba7346644176c28293183f076dddd",
"score": "0.59684545",
"text": "public abstract Object get(String name);",
"title": ""
},
{
"docid": "421... |
94475d35953013fea34f82add1c8d5bc | / A3 ap = new A3(); B3 bp = new B3(); System.out.println("ap= " +ap); System.out.println("bp= " +bp); | [
{
"docid": "648b20f0e4ec2c66d170fd2ad590e1d7",
"score": "0.61908066",
"text": "public static void main(String[] args) {\n\t\tObject[] obj = new Object[2];//��� Ŭ������ ObjectŬ������ ��� \n\t\tobj[0] = new A3();\n\t\tobj[1] = new B3();\n\t\tfor(int i =0;i<obj.length;i++) {\n\t\t\tSystem.out.println(\"obj... | [
{
"docid": "2b26de84b0733b6343d0601d37a6186f",
"score": "0.7075757",
"text": "public static void main(String[] args) {\nBB b=new BB();\r\nSystem.out.println(b.a);\r\n\t}",
"title": ""
},
{
"docid": "73b11e008a403101bcead54c657cd148",
"score": "0.6893089",
"text": "public static void ... |
0dd45514dbf6eb43c4c87ff5b9b2f48a | change UI elements here | [
{
"docid": "09357a1649f5a21b24ed9281847be246",
"score": "0.0",
"text": "@Override\n public void run() {\n String sqStr = NskAlgoSignalQuality.values()[fLevel].toString();\n sqText.setText(sqStr);\n }",
"title": ""
... | [
{
"docid": "d7124645b22c5662ba58f21d92dcd42d",
"score": "0.8003524",
"text": "public void modifyUI() {\n\t\t}",
"title": ""
},
{
"docid": "4c57561c47240dfbc7061dfbf948d262",
"score": "0.7645568",
"text": "private void updateUI() {\n }",
"title": ""
},
{
"docid": "c05e4... |
b34df1cd7fb386c38423a79df6825702 | required string itemid = 2; | [
{
"docid": "d60586fe9d3925c06c9505f3550260c6",
"score": "0.0",
"text": "public boolean hasItemid() {\n return ((bitField0_ & 0x00000002) == 0x00000002);\n }",
"title": ""
}
] | [
{
"docid": "5555309d9a6498b686a60a7b224f5062",
"score": "0.7047322",
"text": "public void setID(int id) {itemID = id;}",
"title": ""
},
{
"docid": "0f2dccb10c44f8b40686ec8740783ab1",
"score": "0.65075976",
"text": "public static final String USE_ITEM(int id)\r\n/* 129: */ {\r\... |
a8071c3fc34d80446de18fbfe36205e7 | Generates assessment records for user selection First, calculates the number of records to generate and sets it to status.totalNumber | [
{
"docid": "62066ea9890f2ff3e2984cfbe324575b",
"score": "0.5594145",
"text": "public void generateAssessmentRecords(String projectId, String siteId, String buildingId,\n String floorId, String activityType, String recordsFor) {\n // total number of records to generate\n int tota... | [
{
"docid": "4ff92d0c0d3f6999c2dff8e88371d46a",
"score": "0.54174685",
"text": "public void getCount(boolean status) {\n\n\t\tif (status) {\n\t\t\tinventoryLinkedList.sort(\n\t\t\t\t\t(s1, s2) -> Double.valueOf(s1.getQuantity()).compareTo(Double.valueOf(s2.getQuantity())) * -1);\n\t\t\tLOG.info(\"User se... |
59dd0a6c5cf26d61c52f9eb1f558d4f4 | Util method to write an attribute without the ns prefix | [
{
"docid": "fd6dc57573a0fb4ed77a13ff3febd90c",
"score": "0.0",
"text": "private void writeQNameAttribute(java.lang.String namespace,\r\n\t\t\t\tjava.lang.String attName, javax.xml.namespace.QName qname,\r\n\t\t\t\tjavax.xml.stream.XMLStreamWriter xmlWriter)\r\n\t\t\t\tthrows javax.xml.stream.XMLStreamEx... | [
{
"docid": "4032b8c44c9067682aec7c95df9e1e42",
"score": "0.7244922",
"text": "private void writeAttribute(java.lang.String namespace,java.lang.String attName,\r\n java.lang.String attValue,javax.xml.stream.XMLStreamWriter xmlWriter) throws javax.xml.stream.XMLStreamE... |
45a8a809882172ef70243a21683b5fc1 | Generates hexadecimal string from given byte array | [
{
"docid": "a49f74aec6d00aef2c83431e2334b00f",
"score": "0.8192628",
"text": "public static String bytetohex(byte[] bytearray) {\n\t\tStringBuilder sb = new StringBuilder();\n\t\t\n\t\tfor (byte b : bytearray) {\n\t\t\tbyte first = (byte) ((b & 0xf0) >> 4);\n\t\t\tbyte second = (byte) (b & 0x0f);\n\t\t\... | [
{
"docid": "41e4fdb3ba7f5c83e0b62040048fb272",
"score": "0.79772496",
"text": "public static String hex(byte[] array) {\n \tStringBuffer sb = new StringBuffer();\n \tfor (int i = 0; i < array.length; ++i) {\n \t\tsb.append(Integer.toHexString((array[i]& 0xFF) | 0x100).substring(1,3)); \n... |
2f63bfbe7e01845836e6ed27dfd7f7e2 | rellena el tablero con las minas y adyacentes | [
{
"docid": "885664db3660607efd20a9d7ddca8559",
"score": "0.6464529",
"text": "private void algoritmoRelleno(int[][] tablero) {\n int contador = 0; //contador a 0 para saber la posición de las minas\n for (int j = 0; j < tablero.length; j++) { // recorremos el array y vamos poniendo las min... | [
{
"docid": "3c5fe95bbb8e259739e0214d3b8ab8c2",
"score": "0.6863797",
"text": "private void limparTabelaAbaDois() {\n DefaultTableModel modelo = (DefaultTableModel) tbProdutos.getModel();\n modelo.setNumRows(0);\n }",
"title": ""
},
{
"docid": "c027058ac57e6e5efb96a4b9f54f80a... |
d186395a57aceb648ae418603fb8ff8d | The async counterpart of Service. | [
{
"docid": "8213df8aae256510a3e58e296f18a89d",
"score": "0.69750184",
"text": "public interface ContentServiceAsync extends AbstractServiceAsync<Content> {\r\n}",
"title": ""
}
] | [
{
"docid": "196524bdf4ab88a57255e12fd00106ab",
"score": "0.71475255",
"text": "public interface DemoServiceAsync {\n\tvoid load(AsyncCallback<Void> callback) throws IllegalArgumentException;\n\tvoid processPost(Source source, Post post, AsyncCallback<DemoResult[]> callback) throws IllegalArgumentExcepti... |
1b0db9a86fbc30535f4932272842fb48 | / renamed from: a | [
{
"docid": "ac3fa0824382876c20e973e1b9baba1d",
"score": "0.0",
"text": "public xr m39005a() {\n return this.f31402a;\n }",
"title": ""
}
] | [
{
"docid": "e8b407e15e709133d36c40b376c5772b",
"score": "0.6288352",
"text": "@C4056a\n /* renamed from: a */\n public abstract Object mo18472a(String str);",
"title": ""
},
{
"docid": "b7e8cbc10834bded8ca03375afdf1d79",
"score": "0.6287218",
"text": "public interface C35231a {... |
f5adb876e78e27ca318650d474ee5425 | """""""""""Reset password api calling""""""""""// | [
{
"docid": "5958978625f5cdf631bc142dd07318ad",
"score": "0.6070057",
"text": "private void dilogResetPass(String email, final RelativeLayout forgot_layout, final Dialog dialog, final ProgressBar progressBar1) {\n if (Constant.isNetworkAvailable(this, forgot_layout)) {\n progressDialog.... | [
{
"docid": "0b733d426ccadc6945b0faca60a9eec5",
"score": "0.8028921",
"text": "private void callResetPwdApi() {\n try {\n RequestParams requestParams = new RequestParams();\n requestParams.put(\"email\", mIntent.getStringExtra(\"email\"));\n requestParams.put(\"ver... |
549137de62ab124e7d29716a7761bd6e | This is called when the server sends a register packet. | [
{
"docid": "b83bb33f8a78299b56953f243705c8b2",
"score": "0.60999304",
"text": "public void registerPacket (ICBEvent event);",
"title": ""
}
] | [
{
"docid": "7b6c192c879b7c17f920c479d852bf91",
"score": "0.7644886",
"text": "@SuppressWarnings(\"unchecked\")\n\tpublic void register() throws SocketException, IOException {\n\t\tspinUpListener();\n\n\t\tString str = new StringBuilder()\n\t\t\t.append(REG_STR)\n\t\t\t.append(\" \")\n\t\t\t.append(nick)... |
0de62d1ea438a6e3594eb168f2eb3b58 | How much time it took to parse the trace file Not set if |capture_status| is not set to |SUCCESS| optional uint64 parsing_time_ms = 5; | [
{
"docid": "9aa104c8e8cd5237fd64214490cf8241",
"score": "0.52343667",
"text": "public boolean hasParsingTimeMs() {\n return ((bitField0_ & 0x00000010) != 0);\n }",
"title": ""
}
] | [
{
"docid": "8c54cde4a6cfd818783f9b34fa751e5b",
"score": "0.56911683",
"text": "public long getParsingTimeMs() {\n return parsingTimeMs_;\n }",
"title": ""
},
{
"docid": "e53035f3e13b5f2dabf2f1f5b460fdca",
"score": "0.5622819",
"text": "public long getParsingTimeMs() {\n retu... |
798fcbed57e51b6865b39b7da74c50ea | At this point this is only changed on testcases The bridge shouldn't be sending blocking anyways | [
{
"docid": "9dfa1a36453f62be234ccae8b34eba58",
"score": "0.0",
"text": "public BridgeConfiguration setCallTimeout(long callTimeout) {\n this.callTimeout = callTimeout;\n return this;\n }",
"title": ""
}
] | [
{
"docid": "a57fcc0448f43c5cbd6a245902de38d5",
"score": "0.67728597",
"text": "public boolean isBlocking() {return true;}",
"title": ""
},
{
"docid": "bb150cb65736df0ce66b42efc4af8f34",
"score": "0.6470238",
"text": "void testReceiveSend() throws IOException {\n Isolate i = Is... |
b5784cacaa3cd061380cc2d7612cfab2 | This method was generated by MyBatis Generator. This method returns the value of the database column doctors_login_info.doctors_phone | [
{
"docid": "8ac154dacab82b97bb001fdbd6d4297c",
"score": "0.7049127",
"text": "public String getDoctorsPhone() {\n return doctorsPhone;\n }",
"title": ""
}
] | [
{
"docid": "afde6bfa3350e62d08a050e5aa73d8d1",
"score": "0.6050129",
"text": "public void setDoctorsPhone(String doctorsPhone) {\n this.doctorsPhone = doctorsPhone == null ? null : doctorsPhone.trim();\n }",
"title": ""
},
{
"docid": "eea09a917c4794eab9c0368dcc3dbbba",
"score":... |
b80e7fb6ce0da6ebee1824cbbad39492 | optional .assistant.api.params.ResponseLoggingParams assistant_logging_params = 12; | [
{
"docid": "08343dcc689671e9e13ffcfcba919f25",
"score": "0.6280021",
"text": "boolean hasAssistantLoggingParams();",
"title": ""
}
] | [
{
"docid": "0b89a80b08ecdecf1dc686c01d2d5e4e",
"score": "0.82790697",
"text": "com.google.assistant.api.params.proto.ResponseLoggingParamsProto.ResponseLoggingParams getAssistantLoggingParams();",
"title": ""
},
{
"docid": "ed2a733124e348955d5764e26afe951d",
"score": "0.79400134",
"t... |
a52101f7570e6c33feca63eb584ccb35 | Sets the list of options for a question. | [
{
"docid": "ea3f80fe86dca2a5b80e0ae375bcf36c",
"score": "0.62881064",
"text": "public void setOptionList(List<OptionDef> optionList){\n\t\toptions = optionList;\n\n\t\tfor(int index = 0; index < changeListeners.size(); index++)\n\t\t\tchangeListeners.get(index).onOptionsChanged(this,optionList);\n\t}",
... | [
{
"docid": "d2a3e7a5c90c3a9d8314e31f9c7a0c80",
"score": "0.7206785",
"text": "public void setQuestionAndOption(){\n optionText1.setText(questionList.get(index).getOptions().get(0));\n optionText2.setText(questionList.get(index).getOptions().get(1));\n optionText3.setText(questionLis... |
0566f5e4da278a628afd0136d285cfbd | To solve this problem, you first need to know what isedit distance. You may refer to this wikipedia article for more information. For this problem, it implicitly assumes to use the classicLevenshtein distance, which involves insertion, deletion and substitution operations and all of them are of the same cost. Thus, if ... | [
{
"docid": "1ca953eea9fc7d4231eaf94a16399bbc",
"score": "0.6276428",
"text": "public boolean isOneEditDistance(String s, String t) {\n if (null == s || null == t)\n return false;\n int m = s.length(), n = t.length();\n if (m > n)\n return isOneEditDistance(t, s... | [
{
"docid": "c005fa443e8ab30381962492bd59f134",
"score": "0.72516274",
"text": "int LevenshteinDistance(String s,int len_s, String t,int len_t)\n\t{\n\t\tint cost;\n\t\t\n\t /* base case: empty strings */\n\t if (len_s == 0) return len_t;\n\t if (len_t == 0) return len_s;\n\t \n\t /* test if last cha... |
1bf89447b80ec86ff401a389c9f91f7d | / access modifiers changed from: protected | [
{
"docid": "d816ad0aa00e11d87131ab635aa3d143",
"score": "0.0",
"text": "@Override // androidx.recyclerview.widget.RecyclerView.r\r\n public void a(View view, RecyclerView.s sVar, RecyclerView.r.a aVar) {\r\n int b2 = b(view, c());\r\n int a2 = a(view, d());\r\n int a3 = a((int) M... | [
{
"docid": "74a4209c94e08d9f5eb0b60e580f5e04",
"score": "0.68727666",
"text": "@Override\r\n\tpublic void comit() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "534c466f09845319b9edaf959a891c09",
"score": "0.68639606",
"text": "@Override\r\n\tpublic void debriyaj() {\n\t\t\r\n\t}",
... |
dcba33888bc1728052d4f6c2630a2384 | empty constructor(needed to create a new instance) return types while methods do Instantiates a new Contestant. | [
{
"docid": "5aa4cb1115fbc16e6df6af6c06c52852",
"score": "0.6596482",
"text": "public Contestant(int attackLevel, int defenseLevel, int healthLevel) {}",
"title": ""
}
] | [
{
"docid": "a7863313a1c5e65da74460613a8bac47",
"score": "0.677827",
"text": "public CompteCourant() {\r\n\r\n\t}",
"title": ""
},
{
"docid": "145d821e62344f7cf4d7e77a30e72573",
"score": "0.6442312",
"text": "public SiacDSoggettoClasse() {\n\t}",
"title": ""
},
{
"docid": ... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "344e83216905dcad3a26bab664b7c2b3",
"score": "0.0",
"text": "@Override\r\n\tpublic void onProviderDisabled(String provider) {\n\t\tToast.makeText(this, \"Disabled provider \" + provider,\r\n\t\t\t\tToast.LENGTH_SHORT).show();\r\n\t}",
"title": ""
}
] | [
{
"docid": "05a606445504484958a1c21e14b7198e",
"score": "0.69474965",
"text": "@Override\r\n\tpublic void sapace() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "8619203d4867f5c6d05eb9a5354405c0",
"score": "0.6920049",
"text": "@Override\n\t\tpublic void pintate() {\n\t\t\t\n\t\t}",
... |
7d7b361728a3d0d1ff1d46db12e6346f | toAtributeType / Positive or Negative; Sim or Nao | [
{
"docid": "7bdd482cd9c77622cdacb29972b513cb",
"score": "0.0",
"text": "static boolean toBoolean(String s) {\n if ( \"N\".equals(s) || \"false\".equalsIgnoreCase(s)) {\n return false;\n }\n return true;\n }",
"title": ""
}
] | [
{
"docid": "281fdf6a6ad540f2db762ce0e26a865b",
"score": "0.5774827",
"text": "public AssemType translateToIntType() {\n\t\tAssemType retAssemType = null;\n\n\t\tTemp temp = new Temp();\n\t\tAssemTemp assemTemp = new AssemTemp(temp, getValueProperties());\n\t\t\n\t\tAssemMove assemMove = new AssemMove(as... |
181ba21dd5618a0493567df6ffbe6b14 | Returns the result of interpreting the object as an instance of 'Function Call'. This implementation returns null; returning a nonnull result will terminate the switch. | [
{
"docid": "1aacf0950ee34180912be8c688cb84b0",
"score": "0.7152695",
"text": "public T caseFunctionCall(FunctionCall object)\n {\n return null;\n }",
"title": ""
}
] | [
{
"docid": "2d2ee17b7dca356dccdca8263ac53fcb",
"score": "0.7548947",
"text": "public T caseCallFunction(CallFunction object) {\n\t\treturn null;\n\t}",
"title": ""
},
{
"docid": "d2f9b3e47af159f679c2639ab9d6eea6",
"score": "0.7276139",
"text": "public T caseProcCall(ProcCall object)\... |
60541a071e6c48d1c24d32be1fea3a74 | An import transaction may contain one or more outputs repeated .PlainOutput outputs = 1; | [
{
"docid": "01371001efacb89cb402143c972035c5",
"score": "0.0",
"text": "public Builder addOutputs(\n int index, org.hyperledger.fabric.protos.token.Transaction.PlainOutput value) {\n if (outputsBuilder_ == null) {\n if (value == null) {\n throw new NullPointerExceptio... | [
{
"docid": "0e0923786b2613fbd1d74dcd2c25bd8b",
"score": "0.5838448",
"text": "private ArrayList<Long> storeTransactionInputs(long transactionId, ArrayList<TransactionInput> inputs, int isCoinbase){\n \t\tint inputindex = 0;\n \t\tlong previousOutputId;\n \t\tString prevOutputHash;\n \t\tResultSet findOu... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "0e3527146f151dcf20a158934372f296",
"score": "0.0",
"text": "public Actividadasignada insertar(Actividadasignada actividadasignada) {\n\t\treturn actividadasignadaRepository.save(actividadasignada);\n\n\n\n\t}",
"title": ""
}
] | [
{
"docid": "b7c706d331e2b507ec0ff8404ad87dc7",
"score": "0.69742316",
"text": "@Override\r\n\t\t\tpublic void crispel() {\n\t\t\t\t\r\n\t\t\t}",
"title": ""
},
{
"docid": "76b3966c8e3f64884c4127d1a3df09a8",
"score": "0.68059677",
"text": "@Override\r\n\t\t\tpublic void maruti() {\n\t... |
752b86226cd1c932cc72771a33008057 | Tests the batchCreate(DataObject[], String, boolean, ResultData) when not using the own connection. All the records should be added into the database. | [
{
"docid": "5c49a61d481ba110b5bb596c18a6a416",
"score": "0.7171389",
"text": "public void testBatchCreate_InAtomNotUseOwnConnectionAccuracy() throws Exception {\n TimeEntry[] myTimeEntrys = new TimeEntry[10];\n\n for (int i = 0; i < 10; i++) {\n myTimeEntrys[i] = new TimeEntry()... | [
{
"docid": "b9ca594071c1c9613c98c63732996bb9",
"score": "0.729001",
"text": "public void testBatchCreate_InAtomUseOwnConnectionAccuracy() throws Exception {\n TimeEntry[] myTimeEntrys = new TimeEntry[10];\n\n for (int i = 0; i < 10; i++) {\n myTimeEntrys[i] = new TimeEntry();\n ... |
cb23a0e69a89a022cfdf42be238185aa | Called when the activity is first created | [
{
"docid": "efa6b01ad62e70093acee4491e76f5e4",
"score": "0.0",
"text": "@Override\n\tprotected void onCreate(Bundle savedInstanceState) {\n\t\tsuper.onCreate(savedInstanceState);\n\t\tLogUtils.info(CLASS_NAME, CLASS_NAME, \"Activity Created\");\n\t\t\n\t\t//show splash screen\n\t\tsetContentView(R.layou... | [
{
"docid": "829f14c50876832c151f887509682464",
"score": "0.77526313",
"text": "@Override\r\n\tpublic void onActivityCreated(Bundle savedInstanceState) {\n\t\tsuper.onActivityCreated(savedInstanceState);\r\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "2b888ba6778573b9a721f33447b0c3ae",
"score... |
263dcb9838302d75cdd3db372cfbdb5b | Inflate the layout for this fragment | [
{
"docid": "bd1bfc13e490d3df9f9f6327d7b596e4",
"score": "0.0",
"text": "@Override\n public View onCreateView(LayoutInflater inflater, ViewGroup container,\n Bundle savedInstanceState) {\n rootView= inflater.inflate(R.layout.fragment_dung, container, false);\n ... | [
{
"docid": "20692959eae44893b50b4d537901ae50",
"score": "0.67938715",
"text": "@Override\n public View onCreateView(LayoutInflater inflater, ViewGroup container,\n Bundle savedInstanceState) {\n View view=inflater.inflate(R.layout.fragment_base, container, false);\... |
491c41c891c26bf63bf7575198e489d4 | Gets the processCount value for this SMTPPlainReport. | [
{
"docid": "86ae35768559f402232d96b2e0c40ce6",
"score": "0.7198812",
"text": "public int getProcessCount() {\n return processCount;\n }",
"title": ""
}
] | [
{
"docid": "e74ae2a6ab5c347b1b4481be5427f328",
"score": "0.65731674",
"text": "@ManagedAttribute\n public long getNumberOfMessagesProcessed() {\n return numberProcessed.get();\n }",
"title": ""
},
{
"docid": "3d0d70aca101175794b4c2a8fbaff8c7",
"score": "0.64671487",
"tex... |
69002e183897f7ba7136393da6184199 | Pulls the given branch. | [
{
"docid": "851061cd24c0c2812b07d6fb63cfe6fd",
"score": "0.7960896",
"text": "private void pullBranch(String gitDir, String branch) {\n try {\n Repository fr = new FileRepositoryBuilder()\n .setGitDir(new File(gitDir + \"/.git\"))\n .readEnvironment()\n ... | [
{
"docid": "31faec1fd2f2ebfaed22240f877416ac",
"score": "0.6491192",
"text": "Branch getBranch(String branch, boolean updateable) throws RepositoryException;",
"title": ""
},
{
"docid": "a69b40d277b442a8dd0e4c11348c0e0e",
"score": "0.62780404",
"text": "public static void gitPull(Git... |
17627d12a7ab31982a60a25c2a06d767 | Gets the attribute value for CreatedBy, using the alias name CreatedBy. | [
{
"docid": "8ee5a76068f42099fbe8e3b85a19a4ef",
"score": "0.75492704",
"text": "public Number getCreatedBy() {\n return (Number)getAttributeInternal(CREATEDBY);\n }",
"title": ""
}
] | [
{
"docid": "54adb0eba35ef55bf88a7eccac5cbde1",
"score": "0.77700865",
"text": "public String getCreatedBy() {\r\n return (String) getAttributeInternal(CREATEDBY);\r\n }",
"title": ""
},
{
"docid": "52f8c346f5e32467777ae9b6dff32409",
"score": "0.7750887",
"text": "public Str... |
2be0006167bb132400c7d8a2e5785bae | Setter for the turn field. | [
{
"docid": "92b4d1a9c321b8f4454a20c8c267a332",
"score": "0.72788715",
"text": "void setTurn(ITurn turn);",
"title": ""
}
] | [
{
"docid": "cee94a1c86db0a5fdfa42e14d4ee06f2",
"score": "0.7939988",
"text": "public void setTurn(Turn turn) { this.turn = turn; }",
"title": ""
},
{
"docid": "380424e991e23ee8ac4692472e96bdf9",
"score": "0.77211386",
"text": "public void setTurn(Turn turn){\r\n\t\tthis.turn = turn;\... |
a594efe6a0ae74c773897991fa1478e4 | Function to get all the links: | [
{
"docid": "1a31f07021ab06080bb59f0dbc7b37dd",
"score": "0.7092544",
"text": "public List<String> getLinks() {\n return this.links;\n\n }",
"title": ""
}
] | [
{
"docid": "d39cb2eea7c0af66c4de95a6ee4f78c9",
"score": "0.7861875",
"text": "public String getLinks() {\n Elements links = this.doc.select(\"a[href]\");\n int length = links.size();\n String urls = \"\";\n\n for (int i = 0; i < length+1; i++) {\n String linkHref =... |
d1fd4dd68a879e764f19dbcc3ee017a3 | // Functions for type membership. // Returns a set of fields named name defined in type container or a supertype. The list returned may be empty. | [
{
"docid": "97d59d27cc25d1e18ad5cafd7a1e1e66",
"score": "0.5913653",
"text": "private Set<FieldInstance> findFields(Type container, TypeSystem_c.FieldMatcher matcher) {\n assert_(container);\n \n Set<FieldInstance> candidates = CollectionFactory.newHashSet();\n \n for (Type t : e... | [
{
"docid": "8df95f77caf7901b676eefb583599595",
"score": "0.632302",
"text": "private Set<Field> selectAllDeclaredFields( Class<?> type){\n\t\tSet<Field> fields = new HashSet<Field>();\n\t\tlogger.debug(\"selectAllDeclaredFields:\"+type.getSimpleName());\n\t\trecDefineAllFields(fields, type);\n\t\tMap <... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "2c76077234168502bb95a89a87c0fb6d",
"score": "0.0",
"text": "public void onClick(ClickEvent event) {\n\t\t\t\teventBus.fireEvent(new FlipHorizontalEvent());\n\t\t\t}",
"title": ""
}
] | [
{
"docid": "d7194e467f51e022c107531d8614b6a3",
"score": "0.6905833",
"text": "@Override\r\n\tpublic void anular() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "cdf542363f5b089e84183e3d9020935f",
"score": "0.6697644",
"text": "@Override\n\t protected void ramana() {\n\t\t\n\t}",
"ti... |
bef42a0cc6a73a06948ecd37982fc2aa | dap status should be off | [
{
"docid": "0196c40864a33d8956fcb1700a1aab62",
"score": "0.60549676",
"text": "private void checkOffStatus(String profileName){\n viewAction_consumer_ui.turnOffDaxFromConsumerUI();\n\n // check dap is off in consumer ui\n viewAssertions_consumer_ui.checkConsumerUIDisplay(SOUND_SETTI... | [
{
"docid": "cf987cb061b69d5e598974b3c176504d",
"score": "0.6405266",
"text": "public void off() {\n\n System.out.println(\"TV is off\");\n }",
"title": ""
},
{
"docid": "ec48ab956430217cd9ea3d3624e755bb",
"score": "0.6330475",
"text": "public void switchOff()\r\n\t{\n\t\tte... |
1988d40442ce3f04617c8b841ef166bb | Gets the implements clause. | [
{
"docid": "bfcda81e8614a147cdc55e1ff3c0f2b9",
"score": "0.71090406",
"text": "public DeclaredTypeListNode getImplementsClause()throws ClassCastException;",
"title": ""
}
] | [
{
"docid": "8a6aeeb98561966ad6e1186fad06bf60",
"score": "0.6700378",
"text": "public Enumeration getImplements()\n {\n ensureLoaded();\n return m_tblInterface.keys();\n }",
"title": ""
},
{
"docid": "09446cb8abbc615a646871086906cd08",
"score": "0.64344096",
... |
4e8dd64688e49496777b152c9bf42a19 | / BACKEND METHOD PARAMS | [
{
"docid": "3c3b0e18c856b1fec08591397a85d728",
"score": "0.0",
"text": "private Object[] getReturnPatientsParams(String session) {\r\n \r\n \t\treturn new Object[] {\r\n \t\t\t\t1,\r\n \t\t\t\tgetAdminSession(),\r\n \t\t\t\tgetAllPatientIds(),\r\n \t\t\t\tnew String[] { \"rec_name\", \"age\", \"diseases... | [
{
"docid": "8b1109ae93fa10b675810abe6ffa3e5c",
"score": "0.6190537",
"text": "@Override\n public void setParams()\n {\n\n }",
"title": ""
},
{
"docid": "1ca77b09e8fbb0082f000ae98606af81",
"score": "0.6159638",
"text": "public abstract String getParams();",
"title": ""
... |
123923d713cad85db4c06f23b0afec53 | Creates an ordered array of unique letters corresponding to the letters used as first characters in the items name | [
{
"docid": "083f7d534936a062cc0923ebeee9889d",
"score": "0.7647952",
"text": "public static String[] getCustomAlphabetSet(Set<String> items) {\n Set<String> first_letters = new HashSet<>();\n String[] res;\n\n for (String item:items) {\n first_letters.add(item.substring(0... | [
{
"docid": "724d802627d2635ec11e38191e3eed5b",
"score": "0.65887076",
"text": "public static List<String> createAlphabet() {\n List alphabet = new ArrayList();\n // Add all letters of alphabet\n for (char c = 'A'; c <= 'Z'; c++)\n alphabet.add(\"\" + c);\n // Add w... |
a5d969949dc2248f2b56775cef885f56 | RequisitionGroupMapper maps the RequisitionGroup entity to corresponding representation in database. Also provides methods like getting all requisition groups for a supervisory node, getting requisition group for a program and facility. | [
{
"docid": "4e43d22e4f40b492ed3d315849242c8e",
"score": "0.5700668",
"text": "@Repository\npublic interface RequisitionGroupMapper {\n\n @Insert(\"INSERT INTO requisition_groups\" +\n \"(code, name, description, supervisoryNodeId, createdBy, modifiedBy, modifiedDate) \" +\n \"VALUES (#{code}, #{n... | [
{
"docid": "01df060d519af516f2109cf7b31960e3",
"score": "0.56211585",
"text": "@MapsId(\"groupId\")\n @ManyToOne(fetch = FetchType.LAZY)\n @JoinColumn(name = \"groupId\", referencedColumnName = \"id\")\n public Group getGroup() {\n return _group;\n }",
"title": ""
},
{
"do... |
61ba1b9307585a1fe70e5343f784870f | Creates a new instance of PostulanteBean | [
{
"docid": "a672a7c970bf62afa007b09be7ed7e9f",
"score": "0.0",
"text": "public void getPostulantes(){\n postulaciones = postulacionFacade.findAll();\n }",
"title": ""
}
] | [
{
"docid": "190cd4e818322a6c47800466ceb6aa52",
"score": "0.7112014",
"text": "public PostBean()\n {\n }",
"title": ""
},
{
"docid": "c0cf66c0d0a5423c526f3a962001441f",
"score": "0.70147395",
"text": "public PagoBean() {\r\n }",
"title": ""
},
{
"docid": "1fe6fb6a... |
87f73b6fd9b006cf9f2148272c6e999d | Convert the given object to string with each line indented by 4 spaces (except the first line). | [
{
"docid": "8279fe35d1f3c688ad6983974b78755b",
"score": "0.0",
"text": "private String toIndentedString(java.lang.Object o) {\n if (o == null) {\n return \"null\";\n }\n return o.toString().replace(\"\\n\", \"\\n \");\n }",
"title": ""
}
] | [
{
"docid": "63c12a4413c6af0d7a213d6c691564e6",
"score": "0.75527424",
"text": "private String toIndentedString(java.lang.Object o) {\n if (o == null) {\n return \"null\";\n }\n return o.toString().replace(\"\\n\", \"\\n \");\n}",
"title": ""
},
{
"docid": "060c307f35bb4b6b5f41e4ead1... |
139aeb7e74358dc4f09b509d92db1c4c | we need two arguments | [
{
"docid": "1c96c7f6d81e960df3236c083d0d531a",
"score": "0.0",
"text": "public static void main(String[] args)\r\n {\n GenJSP app = new GenJSP(args);\r\n app.start();\r\n }",
"title": ""
}
] | [
{
"docid": "ef2f5827eb1a968bb58c64de6c471171",
"score": "0.6334536",
"text": "@Override\n\tpublic void implementionTwo(String[] args) throws Exception {\n\n\t}",
"title": ""
},
{
"docid": "8fd980ec82abcb69c8fe839c70b9ee94",
"score": "0.6137306",
"text": "private void test(int side1, ... |
3a7296d000176a31688ffda9ddee2c29 | Public Methods Converts the specified grade from a table to a grade as shown in the grade combo box. | [
{
"docid": "68d8edf448772308f0aea0bb8e930724",
"score": "0.65891576",
"text": "public static String getGradeTblToBox(String tblGrade) {\r\n String boxGrade = null;\r\n switch (tblGrade) {\r\n case \"9\":\tboxGrade = \"Freshman - 9th\";\r\n\t\t\t\t\t\tbreak;\r\n case \... | [
{
"docid": "ead8ca171256ccf880b0722b58d77ece",
"score": "0.64675945",
"text": "public static String getGradeBoxToTbl(String boxGrade) {\r\n String tblCSA = null;\r\n switch (boxGrade) {\r\n case \"Freshman - 9th\": tblCSA = \"9\";\r\n ... |
c8a7b065f3bb60b7e46c9ebe24a19470 | Allows to draw a color filled rectangle on the RecyclerView item swiped area | [
{
"docid": "1e43e76ba3d377a0e4df2c00592b2890",
"score": "0.677528",
"text": "public static Paint drawRectOnSwipe(View _itemView,\n Canvas _canvas,\n final int _color,\n final float _dX) {\n ... | [
{
"docid": "fde7c4c9cb802b8e0ef53556c0f13c7a",
"score": "0.67585474",
"text": "@Override\n public void onChildDraw(@NonNull Canvas c, @NonNull RecyclerView recyclerView, @NonNull RecyclerView.ViewHolder viewHolder, float dX, float dY, int actionState, boolean isCurrentlyActive) {\n new... |
8a0afba9209dd5e51ea2c66fbe568a57 | / / / / / / / / / / / / | [
{
"docid": "bc3e93adccb541bdd5e203a2af8911c4",
"score": "0.0",
"text": "public static String randomAlphabetic(int count) {\n/* 125 */ return random(count, true, false);\n/* */ }",
"title": ""
}
] | [
{
"docid": "40250d8ac5d37747fdda383a712a674e",
"score": "0.54664886",
"text": "int whisper_full_n_segments (Pointer ctx);",
"title": ""
},
{
"docid": "a74c758496d482b079833c1a94bd2305",
"score": "0.5319465",
"text": "public int getMinVertSpace () {return 80;}",
"title": ""
},
... |
470060344556c20d390d66f919a5fb32 | get data model of this page | [
{
"docid": "3dc8d66d4de1076b74ceedebb406400b",
"score": "0.0",
"text": "UrlBean execute(HttpServletRequest request,HttpServletResponse response)\n\t\t\tthrows IOException;",
"title": ""
}
] | [
{
"docid": "a1da7d1f08f1a789e3ac6695241e3f84",
"score": "0.7325418",
"text": "PageModel getModel();",
"title": ""
},
{
"docid": "3ea87875d13ab210666c59c9e7fe81b0",
"score": "0.71637166",
"text": "public PageModel getPageModel() {\n\t\treturn pageModel;\n\t}",
"title": ""
},
{... |
cfbe02649ca21263c3021fc64c347d50 | Gets a instance of the class. | [
{
"docid": "c8e9a7d20df70984f84071ee94f85edb",
"score": "0.0",
"text": "public static AlarmPersistenceFacade getInstance() {\n\n\t\tif (instance == null) {\n\t\t\tinstance = new AlarmPersistenceFacade();\n\t\t}\n\t\treturn instance;\n\t}",
"title": ""
}
] | [
{
"docid": "607f18f518b6f88ecb57c86a65332cb3",
"score": "0.7122604",
"text": "<T> T getInstance(Class<T> classType);",
"title": ""
},
{
"docid": "7ab8de83fb70c561c22b5cf5aa731702",
"score": "0.7009464",
"text": "Instance getInstance();",
"title": ""
},
{
"docid": "fdffc36... |
d2de3d11303b0a530f3cfd6655280ef2 | Get the current version of BlocksHub API | [
{
"docid": "9fd5d82f473802c3291c8a13bfeb704d",
"score": "0.0",
"text": "double getVersion();",
"title": ""
}
] | [
{
"docid": "4f1b3bf4205c0c70d53d837f0aed982c",
"score": "0.68991387",
"text": "@GetMapping(path = RestEndpoints.URL_VERSION)\n public ResponseEntity<VersionRepresentationModel> currentVersion() {\n VersionRepresentationModel resource = new VersionRepresentationModel();\n resource.setVersion(Taska... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "2b1ef26e5ae4d2fac5e1e17c98296393",
"score": "0.0",
"text": "@Override\n\t\tprotected Void doInBackground(Void... params) {\n\t\t\t\n\t\t\ttry {\n\t\t\t\tjsonFavs = loadJSONFromAsset();\n\t\t\t\tarray = new JSONArray(jsonFavs);\t\t// asset den çağırılan json objesi json arrayine dönüştürülüyo... | [
{
"docid": "1acc57d42c31dee937ac33ea6f2a5b0b",
"score": "0.68399656",
"text": "@Override\r\n\tpublic void comer() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "118f2b8a20f48999973063ac332d07d3",
"score": "0.6563993",
"text": "@Override\r\n\t\t\tpublic void atras() {\n\r\n\t\t\t}",
... |
62c8adaed979977c08726b295fe340e2 | if isALL, do not print drop message, and ignore foreign key constraints | [
{
"docid": "f73e97471a14762aea0b9c90ce4eec37",
"score": "0.6422579",
"text": "private void dropTableInternal(Table table, boolean isALL)\n\t{\n\t\tString key = getTableKey(table.getName());\n\t\tif( ! isALL)\n\t\t{\n\t\t\tif(table.hasReferencing())\n\t\t\t{\n\t\t\t\tprintMessage(Constant.DropReferencedT... | [
{
"docid": "7371bcb40c36958d9bc324ecf210e51c",
"score": "0.682609",
"text": "protected void dropConstraints() throws Exception {\n\n\t\t/*\n\t\t * Remove as chaves estrangeiras\n\t\t */\n\t\tboolean writeCommentForeignKey = true;\n\t\tfor (TableSchema tableSchema : tables) {\n\t\t\tif (tableSchema.getFo... |
6defc4bfbef7ec7244f19bd5c7d6208c | We are going to create our own custom manifest so we can add multiple resource paths to it. | [
{
"docid": "764a853620b51b14377e2500e0d607de",
"score": "0.57785743",
"text": "@Override\n protected AndroidManifest getAppManifest(Config config) {\n try {\n // Using the manifest file's relative path, we can figure out the application directory.\n final URL appRoot = ne... | [
{
"docid": "49fd1bd38f984dffe465b21b46599719",
"score": "0.6646316",
"text": "protected Manifest createNewManifest()\n {\n Manifest manifest = new Manifest();\n manifest.getMainAttributes().put( Attributes.Name.MANIFEST_VERSION, \"1.0\" );\n manifest.getMainAttributes().put( Attr... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "50e7c3bbb9d1f70d45a63ba228c05201",
"score": "0.0",
"text": "@Override\n\tpublic void startactivity(Activity activity,String name) {\n\t\tactivity.startActivity(new Intent(activity,Web.class));\n\t\tactivity.finish();\n\t}",
"title": ""
}
] | [
{
"docid": "d7194e467f51e022c107531d8614b6a3",
"score": "0.6905833",
"text": "@Override\r\n\tpublic void anular() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "941cb2826e3c700358fcaba402e6bb01",
"score": "0.66775143",
"text": "@Override\r\n\tpublic void hissetmek() {\n\r\n\t}",
"ti... |
7ed9565ad8ea4e0b103d3e737a276f8a | Test case number: 16 / 150 covered goals: Goal 1. org.jfree.chart.plot.CategoryPlot.(Lorg/jfree/data/category/CategoryDataset;Lorg/jfree/chart/axis/CategoryAxis;Lorg/jfree/chart/axis/ValueAxis;Lorg/jfree/chart/renderer/category/CategoryItemRenderer;)V: Line 512 Goal 2. org.jfree.chart.plot.CategoryPlot.(Lorg/jfree/data... | [
{
"docid": "9434fad01d863aa991817608c2e71020",
"score": "0.7311913",
"text": "@Test\n public void test16() throws Throwable {\n DefaultCategoryDataset defaultCategoryDataset0 = new DefaultCategoryDataset();\n CategoryAxis categoryAxis0 = new CategoryAxis();\n NumberAxis3D numberAxis3D0... | [
{
"docid": "5ebdd11e62eaf38253ea1862f00e4097",
"score": "0.7638241",
"text": "@Test\n public void test27() throws Throwable {\n Point2D.Double point2D_Double0 = new Point2D.Double(0.0, 0.0);\n String string0 = point2D_Double0.toString();\n CombinedDomainCategoryPlot combinedDomainCateg... |
f37e08e124019032fffee63f45e2124a | Creates a Stats from the given values. | [
{
"docid": "4411e09b3766af48ad01e3fc7a68edd8",
"score": "0.46441296",
"text": "public Stats(int health, int attack, int speed, int defense, int vision) {\n\t\tthis.health = health;\n\t\tthis.attack = attack;\n\t\tthis.speed = speed;\n\t\tthis.defense = defense;\n\t\tthis.vision = vision;\n\t}",
"tit... | [
{
"docid": "84536051dd680669853756cd840d8519",
"score": "0.5659423",
"text": "public Stats() {}",
"title": ""
},
{
"docid": "e3278f022a978e2959a2014589a68b48",
"score": "0.5601031",
"text": "protected UIEfficiencyStatistic createStatistic( Object value ) {\n\t\treturn new UIEfficienc... |
71bfa370eefd4c7aa3eb534832774e33 | result3 team1 inputed into getScore not taking into account if score is valid | [
{
"docid": "58fc20a55d6001441da8454f0d6020e9",
"score": "0.8062813",
"text": "@Test\n\tpublic void result3GetScoreTeam1() {\n\t\tassertEquals(6.1, result3.getScore(8.1, 3, true),0.01);\n\t}",
"title": ""
}
] | [
{
"docid": "95d74754f60491a8d1fc8cc5fdf2c9e4",
"score": "0.7445377",
"text": "@Test\n\tpublic void result2GetScoreTeam2() {\n\t\tassertEquals(23 , result2.getScore(16, 7, false), 1);\n\t}",
"title": ""
},
{
"docid": "5c318be17383030331a18091673e52bf",
"score": "0.6920495",
"text": "I... |
d4275aa32619b5978fbbab04dbe21335 | Creates a nonexpiring basic cache | [
{
"docid": "4f171b36958a5985b8617e24f5c39362",
"score": "0.601004",
"text": "public <K, V> Cache<K, V> simpleCache(String cacheName) {\n synchronized (caches) {\n checkName(cacheName);\n\n GuavaBasicCache<K,V> cache = GuavaBasicCache.permanent(cacheName);\n caches... | [
{
"docid": "4a9c521db448c824d4d2446e64634af8",
"score": "0.7229349",
"text": "private void creatingCache() {\n\n\n\n }",
"title": ""
},
{
"docid": "09af19c41b720a76f63c9ea21e21e7c4",
"score": "0.72178936",
"text": "public abstract Cache<Object, Object> makeCache();",
"title": ... |
3f70a77cd149ae2de60201215e6f7cac | This will be AUTO IMPLEMENTED by Spring into a Bean called userRepository CRUD refers Create, Read, Update, Delete | [
{
"docid": "39194921219594a94ffa729b139b5ff6",
"score": "0.0",
"text": "public interface PlayerRepository extends JpaRepository<Player, Long> {\n}",
"title": ""
}
] | [
{
"docid": "31fb2e3e168ac138a2dd5bf328dd2098",
"score": "0.744403",
"text": "public interface UsersRepository {\n\n List<User> getAll();\n\n User getById(long id);\n\n void add(User user);\n\n void modify(User user);\n\n void delete(long id);\n\n}",
"title": ""
},
{
"docid": "... |
b6b6122093c496fef9fc3d2ec192c1f3 | Log.e("Keith", "onCompleted, entity: " + entity.toString()); | [
{
"docid": "697e87684917c3c3e60d6849b2dec1c2",
"score": "0.0",
"text": "public void onCompleted(BMRData entity, Exception exception,\n\t\t\t\t\t\tServiceFilterResponse response) {\n\n\t\t\t\t\tif (exception == null) {\n\t\t\t\t\t\tBMRUtil.createAndShowDialog(\"Insert successfully.\",\n\t\t\t\t\t\t\t\t\"... | [
{
"docid": "ea42e07360651c9cda7744a930c60615",
"score": "0.56491464",
"text": "@Override\n public void onComplete() {\n Log.d(TAG, \"onComplete: completed..\");\n }",
"title": ""
},
{
"docid": "70a1f8349f1c8bca0d03ff0da1f4e39e",
"score": "0.55608946",
"text": "@Override\... |
23f68ea5ebe985f4582b0da1dbe47761 | Add tests for the updateBalance method to the overall test suite. | [
{
"docid": "237951ae9d1f3b32788c342855dbecd6",
"score": "0.77645445",
"text": "private void addTestSuiteFor$TestUpdateBalance\r\n (junit.framework.TestSuite overallTestSuite$)\r\n {\r\n junit.framework.TestSuite methodTests$\r\n = this.emptyTestSuiteFor(\"updateBalance\");\r\... | [
{
"docid": "c2f2833ade60a8566a4394801ab305f5",
"score": "0.6541014",
"text": "@Test\n public void testOnGame_UpgradeOneBuyAction() {\n //Arrange\n int price = 10;\n int oldprice = 10;\n int Bankvalue = 100;\n int ActiveIncome = 0;\n \n //act\n i... |
33e1ffecb517bb0957828cf731b1459c | BA.debugLineNum = 343;BA.debugLine="Public Sub ClearCart"; BA.debugLineNum = 344;BA.debugLine="ScannedItems.Clear"; | [
{
"docid": "dd56801878e581df32d70252e9874cc3",
"score": "0.83540046",
"text": "public String _clearcart() throws Exception{\n_scanneditems.Clear();\n //BA.debugLineNum = 345;BA.debugLine=\"CallSub(Main,\\\"ClearItemInfo\\\")\";\n__c.CallSubNew(ba,(Object)(_main.getObject()),\"ClearItemInfo\");\n //BA.d... | [
{
"docid": "5bc9d2fea615ce1836b38f81abe58a94",
"score": "0.72678685",
"text": "public String _removeitemfrombasket(b4a.diplomna.types._good _good) throws Exception{\n_itemssuppliers.Remove((Object)(_good.SupplierID));\n //BA.debugLineNum = 146;BA.debugLine=\"ScannedItems.Remove(Good.ID)\";\n_scannedite... |
99245bc9cda61ce9e9ec00570d823160 | Creates a new pathSelector at the current getGamePanel().boardCursor position. Does nothing if the current tile is unoccupied or the unit has already moved. | [
{
"docid": "56dcf1eef60ade57151a1183f48b7f50",
"score": "0.72087276",
"text": "private void startPathSelection() {\n Tile t = getGamePanel().boardCursor.getElm();\n if (!t.isOccupied() || !t.getOccupyingUnit().canMove()) return;\n\n locationSelector = new PathSelector(this, (MovingUnit) t.getOc... | [
{
"docid": "117293e95714bd66c0973dd31194a50e",
"score": "0.58854175",
"text": "private void drawSelector(){\n if(selectorVisible) {\n int[] pos = RenderUtils.getPositionFromMouse();\n selectedTiles.add(pos);\n for(int[] t : selectedTiles) {\n final ... |
16d9c45488a997f499757c39060f743c | Get a story by id | [
{
"docid": "60a5b246f15e2ccdea12eb05b399f9de",
"score": "0.75882584",
"text": "@RequestMapping(value = \"{id}\", method = RequestMethod.GET) @ResponseBody\n public final Story get( @PathVariable( \"id\" ) final Long aId){\n return _projectsService.getStoryById(aId);\n }",
"title": ""
... | [
{
"docid": "f842a7ba7c5f0335d48b7dc8a3372899",
"score": "0.7657847",
"text": "@Override\n public Story findStoryById(int storyid){\n return storyDao.findStoryById(storyid);\n }",
"title": ""
},
{
"docid": "bdc004cfdda0e7e43c4fed67dabb1ded",
"score": "0.6759312",
"text": ... |
0cc6e7293b5885359d1bea66d6d9113d | Gets the name of the customer. | [
{
"docid": "51fb80fdffa08b5af32087c1e8b2dcbe",
"score": "0.0",
"text": "public String getName()\n {\n return name;\n }",
"title": ""
}
] | [
{
"docid": "b58409412c5780abc70ef3a8b2f0211d",
"score": "0.9008514",
"text": "public String getCustomerName(){\n\t\treturn customer.getName();\n\t}",
"title": ""
},
{
"docid": "a4a2f6740f50d9bc51b8f52298eb73d4",
"score": "0.8463702",
"text": "public String getCustomerName() {return c... |
062f989cfea917c9c46161d608888950 | This method was generated by MyBatis Generator. This method corresponds to the database table store | [
{
"docid": "e1b1e96dbc0df50e01cc4c97951ef1a5",
"score": "0.0",
"text": "int deleteByPrimaryKey(Integer id);",
"title": ""
}
] | [
{
"docid": "13226d2553ac57f716637d8e529e8e0d",
"score": "0.63245285",
"text": "public abstract String tableName();",
"title": ""
},
{
"docid": "6dcf527b2bd7fb1521d96da9f78104cf",
"score": "0.6301815",
"text": "public abstract String getTableName();",
"title": ""
},
{
"doc... |
bae88e51aba598ca579921f488461f43 | Flushes a single entity's state to the database, by scheduling an update action, if necessary | [
{
"docid": "930af3893ae9cfd1934ff87040d06bdd",
"score": "0.0",
"text": "public void onFlushEntity(FlushEntityEvent event) throws HibernateException {\n\t\tfinal Object entity = event.getEntity();\n\t\tfinal EntityEntry entry = event.getEntityEntry();\n\t\tfinal EventSource session = event.getSession();\... | [
{
"docid": "338168715f07b6cb1204d122e4a2324f",
"score": "0.67533666",
"text": "void flush(Entity entity);",
"title": ""
},
{
"docid": "0454ad2963e2fc0dd30def5d613133d1",
"score": "0.6717066",
"text": "public void flushUpdates() {\n\t}",
"title": ""
},
{
"docid": "5cb1b5f3... |
635e2d6c6b3ed7b4da383657f00f4d98 | number of salesman which is basically like the length/size of the team array This is the main method. This method just calls different methods from the instances created in an order and the actual calculations and results are given from the other methods. | [
{
"docid": "ffb1c291d42ea804ee52f221b8ac1a28",
"score": "0.5165559",
"text": "public static void main(String[] args) {\r\n\t\t// instance of the class SalesReporter\r\n\t\tSalesReporter myReporter = new SalesReporter(); // instance created using 'new' operator\r\n\r\n\t\t//various methods from instance ... | [
{
"docid": "79892f8d8ba34d5ccae4f6d74ee295bc",
"score": "0.67056847",
"text": "public void getData() {\r\n\t\t// defines the datatype of team array to be of Salesman class\r\n\t\tteam = new Salesman[numOfSalesman]; // sets the length of team array to numOfSalesman\r\n\r\n\t\t// for loop to get to every ... |
1006d5af7baf745290de3c763b222126 | A mix of pre and postrename super classes. The postrename supers should not get renamed. | [
{
"docid": "0ce654c76c6782087e0475d4bef1ef02",
"score": "0.6712331",
"text": "@Test\n public void testRenamingPreRenameClassInfoWithPreAndPostRenameNames() {\n String self = \"self\";\n String postRenameSuper1 = CommonType.SHADOW_ENUM.dotName;\n String postRenameSuper2 = PackageC... | [
{
"docid": "876227d7bc5557e88db64194b517bcf3",
"score": "0.7071041",
"text": "@Test\n public void testPostRenameClassInfoWithNoSupers() {\n // Check a regular class.\n ClassInformation info = ClassInformation.preRenameInfoFor(false, \"class\", null, null);\n ClassInformation rena... |
893cd12e0ae908f04f892e59f06d7808 | Returns the sentence start word. | [
{
"docid": "98a55f87acd6e7c19891840bf3227549",
"score": "0.85756904",
"text": "public Word getSentenceStartWord() {\n return getWord(SENTENCE_START_SPELLING);\n }",
"title": ""
}
] | [
{
"docid": "7ce58f74fb92967c90190a458e3b88d8",
"score": "0.81726277",
"text": "private String getStart_Word() throws FehlerhafterSatzException {\n\t\tJsonObject sentence = json_sentence.get(satzNummer).getAsJsonObject();\n\t\tif (sentence.has(\"start_word\")) {\n\t\t\treturn sentence.get(\"start_word\")... |
ef5a6d66f05637a0e1f836687d384487 | Internal query to resolve the "userBudgets" tomany relationship of user. | [
{
"docid": "fa7258de21c29558a5609fd4529830b0",
"score": "0.68314105",
"text": "public List<budgets> _queryUser_UserBudgets(long idUser) {\n synchronized (this) {\n if (user_UserBudgetsQuery == null) {\n QueryBuilder<budgets> queryBuilder = queryBuilder();\n ... | [
{
"docid": "c2419f3c919c9a2e52d5699460a080a3",
"score": "0.50788885",
"text": "@Override\n\tpublic List<Account> getAllAcountsForUser(User user) {\n\t\t/* begin transaction */ \n\t\tSession session = getCurrentSession(); \n\t\tsession.beginTransaction();\n\n\t\tQuery query = session.createQuery(\"from A... |
35588e24b1aa3cc28d4e136ab6116f7a | Add a Customer to the customer list. | [
{
"docid": "1ab2a0c03de5c839f81f7355f2f9c159",
"score": "0.6879496",
"text": "Boolean addCustomer(ICustomer customer);",
"title": ""
}
] | [
{
"docid": "dafea0734c90df43e376d0e8481c99be",
"score": "0.83556014",
"text": "public static void addCustomer(Customer customer)\n {\n customers.add(customer);\n }",
"title": ""
},
{
"docid": "19162f1ee35a6af8a362fdf9132fefdc",
"score": "0.7784763",
"text": "public void ... |
b5676a38bfec4b458fb6efb1cb461f03 | A course components exists most of the times of multiple lectures. This number gives the index number of the lecture in all the given lectures. | [
{
"docid": "333c1d287a598acf8422d7b97e72e227",
"score": "0.64966196",
"text": "public int getIndexInCourseComponent() {\n\t\treturn indexInCourseComponent;\n\t}",
"title": ""
}
] | [
{
"docid": "18fe1efa5cbb7c0c279cfc0f42cce11c",
"score": "0.59472907",
"text": "public int getNumberOfCourses() {\n\t\treturn courses.size();\n\t}",
"title": ""
},
{
"docid": "9aba7f971d4d6d75ac0803528e5cd785",
"score": "0.57473135",
"text": "public int component_count() {\n re... |
5e185150f8b61ce5105970ef4a853eb6 | 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. | [
{
"docid": "cc7ff149e829ffca72855e85cd1514b3",
"score": "0.0",
"text": "@SuppressWarnings(\"unchecked\")\n // <editor-fold defaultstate=\"collapsed\" desc=\"Generated Code\">//GEN-BEGIN:initComponents\n private void initComponents() {\n\n lblId = new javax.swing.JLabel();\n txtId = n... | [
{
"docid": "0683d7c04886f33eb3de4cd0ed5cbadc",
"score": "0.7454324",
"text": "public Herrendjimi1() {\n initComponents();\n }",
"title": ""
},
{
"docid": "a265c28895719fa5abe69bc5acb37bbf",
"score": "0.73023176",
"text": "public FormLat3() {\n initComponents();\n ... |
a573b1697d91b802fe2e8709b295e409 | private recursive method that does the work refer to pg.1057, x = change(x) | [
{
"docid": "5cdcfae853ac19ac8520c3bb3751bd04",
"score": "0.0",
"text": "private IntTreeNode add(IntTreeNode root, int value)\n {\n if(root == null)\n {\n root = new IntTreeNode(value);\n }\n \n else if(value <= root.data)\n {\n root.left = add(root.left, v... | [
{
"docid": "f2523f527e9ddabc3ff52ea6d5f29a8e",
"score": "0.62898004",
"text": "@Test\n public void testChange() throws Exception {\n int[] expResult = \n {10, -8, 3, -2, 9, -8, -3, -5, -1, -3, 2, 2, 8, -9, 7, 0, -9, 9, 4, 6};\n int[] result = instance.change(input);\n ... |
c0c36ef85926255e75604c54d0ddc1e7 | overriding hasNext to check if reached end of deck | [
{
"docid": "4c8bc64a3f1e58b7582c86cbc4f294ea",
"score": "0.76370907",
"text": "@Override\n public boolean hasNext()\n {\n return pos < hand.size();\n }",
"title": ""
}
] | [
{
"docid": "22887f38f4d709d939f5cacdadfa235a",
"score": "0.75306755",
"text": "public abstract boolean hasNext();",
"title": ""
},
{
"docid": "4a4199578a1bcc90b10acb90b83e4e40",
"score": "0.7320102",
"text": "public boolean hasNext();",
"title": ""
},
{
"docid": "4a419957... |
f5774eed4dc2d249995de0e7b6877ca3 | A PlayerBanSource is the source of a ban that has been issued by a Player | [
{
"docid": "1da47c020eaeb8013fe87a6b5cee78b4",
"score": "0.72865516",
"text": "public interface PlayerBanSource extends BanSource {\n\n\tUUID getUUID();\n\n\t/**\n\t * Does no guarantee that the player is online\n\t */\n\tPlayer getPlayer();\n\n}",
"title": ""
}
] | [
{
"docid": "daf64321f91fd9182905396f23b6f337",
"score": "0.5885944",
"text": "@Override\n\tpublic CommandResult execute(CommandSource source, CommandContext args)throws CommandException {\n\n\t\t\n\t\t\n\t\tif(source instanceof Player) {\n\t\t\tPlayer player = (Player) source;\n\t\t\tString playerName;\... |
9e34f523e87f3a717aedebd765aa5055 | Declarar variables numerico y texto | [
{
"docid": "d14db76085c91d95cda948897f1a02b7",
"score": "0.0",
"text": "public static void main(String[]args){\n int edad; // Declarando\r\n edad=25; // asignando e inicializando\r\n char genero ='F';\r\n String nombre = \"Mireya\";\r\n boolean estadocivil = false;\r\... | [
{
"docid": "40152ab5a6dac79b7d2c1185206cc2c5",
"score": "0.65372276",
"text": "public void creaArmas(){\n tipo = \"Baston de Aire\";\n precio = 120;\n atk = 33;\n descripcion = \"Un baston de aire, es magnifico. Daño 33, Precio 120.\";\n}",
"title": ""
},
{
"docid": "802d858c8010... |
eda4e4e054efd91eaefbf4bfeab03a8c | Returns curve associated with this point. No copy of curve is made before return, so change of returned object will also change curve for this point. | [
{
"docid": "d8f9ce20f381d8d919983b2c99ac5a7e",
"score": "0.7185384",
"text": "public ECCurve getCurve() {\n \treturn theCurve;\n }",
"title": ""
}
] | [
{
"docid": "b3c058f4575e2fc36da4844b9b3ffb80",
"score": "0.7183551",
"text": "public Curve getUnderlyingCurve() {\n return underlyingCurve;\n }",
"title": ""
},
{
"docid": "2259402cd9b4ad39fb3ecdb7dc18bbca",
"score": "0.69731885",
"text": "public CompositeCurve getCompositeCurve(... |
864126338e4a8fe7ab025a95663e342e | end check left method ______________________________________________________________________________________________ | [
{
"docid": "013f596a9715305e6a9f575a1fd61077",
"score": "0.0",
"text": "public static double nextPoissonInterval(double lambda){\r\nreturn Math.log(rand.nextDouble()/(-lambda));\r\n}",
"title": ""
}
] | [
{
"docid": "e6ecf2aef08a4557dcb0a9134380fdf7",
"score": "0.7266574",
"text": "private void branchLeft()\n\t\t{\n\t\t\tif(current_branch > 0)\n\t\t\t{\n\t\t\t\tcurrent_branch--;\n\t\t\t}\n\t\t}",
"title": ""
},
{
"docid": "5ad65f61f33c8e4b706de14f7e9dcba0",
"score": "0.721778",
"text"... |
25197b4cf814864ecd440f23b9149cb3 | TODO Autogenerated method stub | [
{
"docid": "49bbd478c0b26fdf298c7bf1a20aaedf",
"score": "0.0",
"text": "@Override\n\t\t\tpublic void onClick(View v) {\n\t\t\t\tswitch(v.getId()) {\n\t\t\t\tcase R.id.red : //red버튼을 눌러서 들어왔느냐?\n\t\t\t\t\tr.setBackgroundColor(Color.RED); //레드버튼을 누르면 te의 백그라운드 컬러를 레드로 바꿔라\n\t\t\t\t\tbreak;\n\t\t\t\t\t\n\... | [
{
"docid": "1acc57d42c31dee937ac33ea6f2a5b0b",
"score": "0.6836411",
"text": "@Override\r\n\tpublic void comer() {\n\t\t\r\n\t}",
"title": ""
},
{
"docid": "33d41636b65afa8267c9085dae3d1a2d",
"score": "0.6679176",
"text": "private void apparence() {\r\n\r\n\t}",
"title": ""
},
... |
defbde0c1c7016f6a64bb0af244171c3 | Creates a new GameListRequest that holds a response listener that listens for a response from the game table database | [
{
"docid": "465f58a458a6c8d320ced917a767dc1f",
"score": "0.744302",
"text": "public GameListRequest(Response.Listener<String> listener) {\r\n super(Request.Method.POST, GAME_LIST_REQUEST_URL, listener, null);\r\n }",
"title": ""
}
] | [
{
"docid": "cdb4a701a2e1dcc2c91876005eaf58ad",
"score": "0.69234645",
"text": "@SuppressWarnings(\"unused\")\n\tprivate void createGameRequest() {\n\t\tgameClientStub.sendNewGameRequest();\n\t}",
"title": ""
},
{
"docid": "4a95dd83d6026906ccb6764fc0f4e506",
"score": "0.6210674",
"tex... |
9464fad79aef09ae07aac681b2a6fd65 | Gets the telefoni value for this Anagrafica. | [
{
"docid": "c5459b2f85de2b6c3403262ec281be8d",
"score": "0.731603",
"text": "public it.equitalia.gestorefascicolows.dati.Telefono[] getTelefoni() {\r\n return telefoni;\r\n }",
"title": ""
}
] | [
{
"docid": "0820e5d1ed05aa66404bedc0a12aac4c",
"score": "0.7445506",
"text": "public java.lang.String getTelefone() {\r\n return telefone;\r\n }",
"title": ""
},
{
"docid": "a711584a11a1c0e8c4943c8278748d70",
"score": "0.7327006",
"text": "public String getTelefone() {\n\n\... |
18d4ef427aa0dc08cc5a1776e9483e08 | Process one operator: Take an operator from operatorStack and apply it on the operands in the operandStack | [
{
"docid": "a369261bb3130ec182b66886009099be",
"score": "0.7823257",
"text": "public static void processOperator(Stack<Integer> operandStack, Stack<Character> operatorStack){\n char operator = operatorStack.pop();\n int op1 = operandStack.pop();\n int op2 = operandStack.pop();\n\n ... | [
{
"docid": "8b68d52533275aab54b74ad41f2f717c",
"score": "0.77358043",
"text": "public static void processAnOperator(\r\n\t\t\tStack<Integer> operandStack, Stack<Character> operatorStack) {\r\n\t\tchar op = operatorStack.pop();\r\n\t\tint op1 = operandStack.pop();\r\n\t\tint op2 = operandStack.pop();\r\n... |
1be1f0c3228ed8b60c218a51d1e95d9b | METHODS FOR EXPANDING THIS STATE Returns a Value object that represents the value of this state based on which player's turn it is or if a random action will occure. It will expand itself to a depth of 'maxDepth' to calculate the value of this state. It acts as a expectaminimax function. | [
{
"docid": "a89f5dcb064d6019e70f244fa8c56216",
"score": "0.79481035",
"text": "final Value getValue(int maxDepth){\n\t\t\n\t\t//if this state is at the max depth return the value of this state\n\t\tif(maxDepth == depth)\n\t\t\treturn evaluateState();\n\t\t\n\t\t//if not - must continue expanding tree\n\... | [
{
"docid": "3c984dcbe4cf9da5dadf74ae2749900e",
"score": "0.7206506",
"text": "@Override\r\n\tpublic double max_value(GameState s, int depthLimit) \r\n\t{\r\n\t\tdouble stateEvaluationValue = stateEvaluator(s);\r\n\r\n\t\tif (depthLimit == 0)\r\n\t\t{\r\n\t\t\treturn stateEvaluationValue;\r\n\t\t}\r\n\t\... |